ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/treasure.C

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.27 by root, Wed Dec 20 09:14:21 2006 UTC vs.
Revision 1.73 by root, Sun Apr 20 05:24:55 2008 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3		3	*
		4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
18	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
20		21	* The authors can be reached via e-mail to <support@deliantra.net>
21	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	22	*/
23
24	#define ALLOWED_COMBINATION
25		23
26	/* TREASURE_DEBUG does some checking on the treasurelists after loading.	24	/* TREASURE_DEBUG does some checking on the treasurelists after loading.
27	* It is useful for finding bugs in the treasures file. Since it only	25	* It is useful for finding bugs in the treasures file. Since it only
28	* slows the startup some (and not actual game play), it is by default	26	* slows the startup some (and not actual game play), it is by default
29	* left on	27	* left on
30	*/	28	*/
31	#define TREASURE_DEBUG	29	#define TREASURE_DEBUG
32		30
33	/* TREASURE_VERBOSE enables copious output concerning artifact generation */	31	/* TREASURE_VERBOSE enables copious output concerning artifact generation */
34		32
35	/* #define TREASURE_VERBOSE */	33	//#define TREASURE_VERBOSE
36		34
37	#include <global.h>	35	#include <global.h>
38	#include <treasure.h>	36	#include <treasure.h>
39	#include <funcpoint.h>	37	#include <funcpoint.h>
40	#include <loader.h>	38	#include <loader.h>
41		39
		40	extern char *spell_mapping[];
		41
		42	static treasurelist *first_treasurelist;
42		43
43	static void change_treasure (treasure *t, object *op); /* overrule default values */	44	static void change_treasure (treasure *t, object *op); /* overrule default values */
44	extern char *spell_mapping[];
45		45
46	/*	46	typedef std::tr1::unordered_map<
47	* Initialize global archtype pointers:	47	const char *,
48	*/	48	treasurelist *,
		49	str_hash,
		50	str_equal,
		51	slice_allocator< std::pair<const char *const, treasurelist *> >,
		52	true
		53	> tl_map_t;
49		54
		55	static tl_map_t tl_map;
		56
		57	/*
		58	* Searches for the given treasurelist
		59	*/
		60	treasurelist *
		61	treasurelist::find (const char *name)
		62	{
		63	if (!name)
		64	return 0;
		65
		66	auto (i, tl_map.find (name));
		67
		68	if (i == tl_map.end ())
		69	return 0;
		70
		71	return i->second;
		72	}
		73
		74	/*
		75	* Searches for the given treasurelist in the globally linked list
		76	* of treasurelists which has been built by load_treasures().
		77	*/
		78	treasurelist *
		79	treasurelist::get (const char *name)
		80	{
		81	treasurelist *tl = find (name);
		82
		83	if (!tl)
		84	{
		85	tl = new treasurelist;
		86
		87	tl->name = name;
		88	tl->next = first_treasurelist;
		89	first_treasurelist = tl;
		90
		91	tl_map.insert (std::make_pair (tl->name, tl));
		92	}
		93
		94	return tl;
		95	}
		96
		97	//TODO: class method
50	void	98	void
51	init_archetype_pointers ()	99	clear (treasurelist *tl)
52	{	100	{
53	int prev_warn = warn_archetypes;	101	if (tl->items)
		102	{
		103	free_treasurestruct (tl->items);
		104	tl->items = 0;
		105	}
54		106
55	warn_archetypes = 1;
56	if (ring_arch == NULL)
57	ring_arch = archetype::find ("ring");
58	if (amulet_arch == NULL)
59	amulet_arch = archetype::find ("amulet");
60	if (staff_arch == NULL)
61	staff_arch = archetype::find ("staff");
62	if (crown_arch == NULL)
63	crown_arch = archetype::find ("crown");
64	warn_archetypes = prev_warn;
65	}
66
67	/*
68	* Allocate and return the pointer to an empty treasurelist structure.
69	*/
70
71	static treasurelist *
72	get_empty_treasurelist (void)
73	{
74	return new treasurelist;
75	}
76
77	/*
78	* Allocate and return the pointer to an empty treasure structure.
79	*/
80	//TODO: make this a constructor
81	static treasure *
82	get_empty_treasure (void)
83	{
84	treasure *t = new treasure;
85
86	t->chance = 100;	107	tl->total_chance = 0;
87
88	return t;
89	}	108	}
		109
		110	#ifdef TREASURE_DEBUG
		111	/* recursived checks the linked list. Treasurelist is passed only
		112	* so that the treasure name can be printed out
		113	*/
		114	static void
		115	check_treasurelist (const treasure *t, const treasurelist * tl)
		116	{
		117	if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
		118	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
		119
		120	if (t->next)
		121	check_treasurelist (t->next, tl);
		122
		123	if (t->next_yes)
		124	check_treasurelist (t->next_yes, tl);
		125
		126	if (t->next_no)
		127	check_treasurelist (t->next_no, tl);
		128	}
		129	#endif
90		130
91	/*	131	/*
92	* Reads the lib/treasure file from disk, and parses the contents	132	* Reads the lib/treasure file from disk, and parses the contents
93	* into an internal treasure structure (very linked lists)	133	* into an internal treasure structure (very linked lists)
94	*/	134	*/
95
96	static treasure *	135	static treasure *
97	load_treasure (FILE * fp, int *line)	136	read_treasure (object_thawer &f)
98	{	137	{
99	char buf[MAX_BUF], *cp, variable[MAX_BUF];
100	treasure *t = get_empty_treasure ();	138	treasure *t = new treasure;
101	int value;
102		139
103	nroftreasures++;	140	f.next ();
104	while (fgets (buf, MAX_BUF, fp) != NULL)
105	{
106	(*line)++;
107		141
108	if (*buf == '#')	142	for (;;)
109	continue;	143	{
110	if ((cp = strchr (buf, '\n')) != NULL)	144	coroapi::cede_to_tick ();
111	*cp = '\0';
112	cp = buf;
113	while (isspace (*cp)) /* Skip blanks */
114	cp++;
115		145
116	if (sscanf (cp, "arch %s", variable))	146	switch (f.kw)
117	{
118	if ((t->item = archetype::find (variable)) == NULL)
119	LOG (llevError, "Treasure lacks archetype: %s\n", variable);
120	}	147	{
121	else if (sscanf (cp, "list %s", variable))	148	case KW_arch:
122	t->name = variable;	149	t->item = archetype::find (f.get_str ());
123	else if (sscanf (cp, "change_name %s", variable))	150
124	t->change_arch.name = variable;	151	if (!t->item)
125	else if (sscanf (cp, "change_title %s", variable))
126	t->change_arch.title = variable;
127	else if (sscanf (cp, "change_slaying %s", variable))
128	t->change_arch.slaying = variable;
129	else if (sscanf (cp, "chance %d", &value))
130	t->chance = (uint8) value;
131	else if (sscanf (cp, "nrof %d", &value))
132	t->nrof = (uint16) value;
133	else if (sscanf (cp, "magic %d", &value))
134	t->magic = (uint8) value;
135	else if (!strcmp (cp, "yes"))
136	t->next_yes = load_treasure (fp, line);
137	else if (!strcmp (cp, "no"))
138	t->next_no = load_treasure (fp, line);
139	else if (!strcmp (cp, "end"))
140	return t;
141	else if (!strcmp (cp, "more"))
142	{	152	{
143	t->next = load_treasure (fp, line);	153	f.parse_warn ("treasure references unknown archetype");
		154	t->item = archetype::empty;
		155	}
		156
		157	break;
		158
		159	case KW_list: f.get (t->name); break;
		160	case KW_change_name: f.get (t->change_arch.name); break;
		161	case KW_change_title: f.get (t->change_arch.title); break;
		162	case KW_change_slaying: f.get (t->change_arch.slaying); break;
		163	case KW_chance: f.get (t->chance); break;
		164	case KW_nrof: f.get (t->nrof); break;
		165	case KW_magic: f.get (t->magic); break;
		166
		167	case KW_yes: t->next_yes = read_treasure (f); continue;
		168	case KW_no: t->next_no = read_treasure (f); continue;
		169
		170	case KW_end:
		171	f.next ();
144	return t;	172	return t;
		173
		174	case KW_more:
		175	t->next = read_treasure (f);
		176	return t;
		177
		178	default:
		179	if (!f.parse_error ("treasurelist", t->name))
		180	goto error;
		181
		182	return t;
145	}	183	}
146	else	184
147	LOG (llevError, "Unknown treasure-command: '%s', last entry %s, line %d\n", cp, &t->name, *line);	185	f.next ();
148	}	186	}
149	LOG (llevError, "treasure lacks 'end'.\n");	187
		188	// not reached
		189
		190	error:
		191	delete t;
150	return t;	192	return 0;
151	}	193	}
152		194
153	#ifdef TREASURE_DEBUG
154
155	/* recursived checks the linked list. Treasurelist is passed only
156	* so that the treasure name can be printed out
157	*/
158	static void
159	check_treasurelist (const treasure *t, const treasurelist * tl)
160	{
161	if (t->item == NULL && t->name == NULL)
162	LOG (llevError, "Treasurelist %s has element with no name or archetype\n", &tl->name);
163	if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
164	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
165	/* find_treasurelist will print out its own error message */
166	if (t->name && *t->name)
167	(void) find_treasurelist (t->name);
168	if (t->next)
169	check_treasurelist (t->next, tl);
170	if (t->next_yes)
171	check_treasurelist (t->next_yes, tl);
172	if (t->next_no)
173	check_treasurelist (t->next_no, tl);
174	}
175	#endif
176
177	/*	195	/*
178	* Opens LIBDIR/treasure and reads all treasure-declarations from it.
179	* Each treasure is parsed with the help of load_treasure().	196	* Each treasure is parsed with the help of load_treasure().
180	*/	197	*/
181		198	treasurelist *
182	void	199	treasurelist::read (object_thawer &f)
183	load_treasures (void)
184	{	200	{
185	FILE *fp;	201	assert (f.kw == KW_treasure || f.kw == KW_treasureone);
186	char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];
187	treasurelist *previous = NULL;
188	treasure *t;
189	int comp, line = 0;
190		202
191	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	203	bool one = f.kw == KW_treasureone;
192	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	204	treasurelist *tl = treasurelist::get (f.get_str ());
193	{	205	clear (tl);
194	LOG (llevError, "Can't open treasure file.\n");	206	tl->items = read_treasure (f);
		207	if (!tl->items)
195	return;	208	return 0;
196	}
197	while (fgets (buf, MAX_BUF, fp) != NULL)
198	{
199	line++;
200	if (*buf == '#')
201	continue;
202		209
203	if (sscanf (buf, "treasureone %s\n", name) || sscanf (buf, "treasure %s\n", name))
204	{
205	treasurelist *tl = get_empty_treasurelist ();
206
207	tl->name = name;
208	if (previous == NULL)
209	first_treasurelist = tl;
210	else
211	previous->next = tl;
212	previous = tl;
213	tl->items = load_treasure (fp, &line);
214
215	/* This is a one of the many items on the list should be generated.	210	/* This is a one of the many items on the list should be generated.
216	* Add up the chance total, and check to make sure the yes & no	211	* Add up the chance total, and check to make sure the yes & no
217	* fields of the treasures are not being used.	212	* fields of the treasures are not being used.
218	*/	213	*/
219	if (!strncmp (buf, "treasureone", 11))	214	if (one)
		215	{
		216	for (treasure *t = tl->items; t; t = t->next)
		217	{
		218	if (t->next_yes || t->next_no)
220	{	219	{
221	for (t = tl->items; t != NULL; t = t->next)
222	{
223	#ifdef TREASURE_DEBUG
224	if (t->next_yes || t->next_no)
225	{
226	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);	220	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->archname : &t->name);
227	LOG (llevError, " the next_yes or next_no field is set\n");	221	LOG (llevError, " the next_yes or next_no field is set\n");
228	}
229	#endif
230	tl->total_chance += t->chance;
231	}
232	}	222	}
233	}
234	else
235	LOG (llevError, "Treasure-list %s didn't understand: %s, line %d\n", filename, buf, line);
236	}
237	close_and_delete (fp, comp);
238		223
239	#ifdef TREASURE_DEBUG	224	tl->total_chance += t->chance;
240	/* Perform some checks on how valid the treasure data actually is.	225	}
241	* verify that list transitions work (ie, the list that it is supposed	226	}
242	* to transition to exists). Also, verify that at least the name
243	* or archetype is set for each treasure element.
244	*/
245	for (previous = first_treasurelist; previous != NULL; previous = previous->next)
246	check_treasurelist (previous->items, previous);
247	#endif
248	}
249		227
250	/*
251	* Searches for the given treasurelist in the globally linked list
252	* of treasurelists which has been built by load_treasures().
253	*/
254
255	treasurelist *
256	find_treasurelist (const char *name)
257	{
258	shstr_cmp name_ (name);
259
260	if (!name_)
261	return 0;
262
263	for (treasurelist *tl = first_treasurelist; tl != 0; tl = tl->next)
264	if (name_ == tl->name)
265	return tl;
266
267	if (first_treasurelist)
268	LOG (llevError, "Couldn't find treasurelist %s\n", name);
269
270	return 0;	228	return tl;
271	}	229	}
272
273		230
274	/*	231	/*
275	* Generates the objects specified by the given treasure.	232	* Generates the objects specified by the given treasure.
276	* It goes recursively through the rest of the linked list.	233	* It goes recursively through the rest of the linked list.
277	* If there is a certain percental chance for a treasure to be generated,	234	* If there is a certain percental chance for a treasure to be generated,
…		…
283	* start with equipment, but only their abilities).	240	* start with equipment, but only their abilities).
284	*/	241	*/
285	static void	242	static void
286	put_treasure (object *op, object *creator, int flags)	243	put_treasure (object *op, object *creator, int flags)
287	{	244	{
288	object *tmp;	245	if (flags & GT_ENVIRONMENT)
289		246	{
290	/* Bit of a hack - spells should never be put onto the map. The entire	247	/* Bit of a hack - spells should never be put onto the map. The entire
291	* treasure stuff is a problem - there is no clear idea of knowing	248	* treasure stuff is a problem - there is no clear idea of knowing
292	* this is the original object, or if this is an object that should be created	249	* this is the original object, or if this is an object that should be created
293	* by another object.	250	* by another object.
294	*/	251	*/
295	if (flags & GT_ENVIRONMENT && op->type != SPELL)	252	//TODO: flag such as objects... as such (no drop, anybody?)
296	{	253	if (op->type == SPELL)
297	op->x = creator->x;	254	{
298	op->y = creator->y;	255	op->destroy ();
		256	return;
		257	}
		258
		259	op->expand_tail ();
		260
		261	if (op->blocked (creator->map, creator->x, creator->y))
		262	op->destroy ();
		263	else
		264	{
299	SET_FLAG (op, FLAG_OBJ_ORIGINAL);	265	SET_FLAG (op, FLAG_OBJ_ORIGINAL);
300	insert_ob_in_map (op, creator->map, op, INS_NO_MERGE | INS_NO_WALK_ON);	266	op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);
		267	}
301	}	268	}
302	else	269	else
303	{	270	{
304	op = insert_ob_in_ob (op, creator);	271	op = creator->insert (op);
305		272
306	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))	273	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
307	monster_check_apply (creator, op);	274	monster_check_apply (creator, op);
308		275
309	if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ()))	276	if (flags & GT_UPDATE_INV)
		277	if (object *tmp = creator->in_player ())
310	esrv_send_item (tmp, op);	278	esrv_send_item (tmp, op);
311	}	279	}
312	}	280	}
313		281
314	/* if there are change_xxx commands in the treasure, we include the changes	282	/* if there are change_xxx commands in the treasure, we include the changes
315	* in the generated object	283	* in the generated object
…		…
329		297
330	if (t->change_arch.slaying)	298	if (t->change_arch.slaying)
331	op->slaying = t->change_arch.slaying;	299	op->slaying = t->change_arch.slaying;
332	}	300	}
333		301
334	void	302	static void
335	create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries)	303	create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries)
336	{	304	{
337	object *tmp;
338
339	if ((int) t->chance >= 100 || (RANDOM () % 100 + 1) < (int) t->chance)	305	if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance)
340	{	306	{
341	if (t->name)	307	if (t->name)
342	{	308	{
343	if (strcmp (t->name, "NONE") && difficulty >= t->magic)	309	if (difficulty >= t->magic)
		310	if (treasurelist *tl = treasurelist::find (t->name))
		311	create_treasure (tl, op, flag, difficulty, tries);
		312	else
		313	LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
		314	}
		315	else
		316	{
		317	if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE)))
344	{	318	{
345	treasurelist *tl = find_treasurelist (t->name);
346	if (tl)
347	create_treasure (tl, op, flag, difficulty, tries);
348	}
349	}
350	else
351	{
352	if (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))
353	{
354	tmp = arch_to_object (t->item);	319	object *tmp = arch_to_object (t->item);
		320
355	if (t->nrof && tmp->nrof <= 1)	321	if (t->nrof && tmp->nrof <= 1)
356	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	322	tmp->nrof = rndm (t->nrof) + 1;
		323
357	fix_generated_item (tmp, op, difficulty, t->magic, flag);	324	fix_generated_item (tmp, op, difficulty, t->magic, flag);
358	change_treasure (t, tmp);	325	change_treasure (t, tmp);
359	put_treasure (tmp, op, flag);	326	put_treasure (tmp, op, flag);
360	}	327	}
361	}	328	}
362		329
363	if (t->next_yes != NULL)	330	if (t->next_yes)
364	create_all_treasures (t->next_yes, op, flag, difficulty, tries);	331	create_all_treasures (t->next_yes, op, flag, difficulty, tries);
365	}	332	}
366	else if (t->next_no != NULL)	333	else if (t->next_no)
367	create_all_treasures (t->next_no, op, flag, difficulty, tries);	334	create_all_treasures (t->next_no, op, flag, difficulty, tries);
368		335
369	if (t->next != NULL)	336	if (t->next)
370	create_all_treasures (t->next, op, flag, difficulty, tries);	337	create_all_treasures (t->next, op, flag, difficulty, tries);
371	}	338	}
372		339
373	void	340	static void
374	create_one_treasure (treasurelist * tl, object *op, int flag, int difficulty, int tries)	341	create_one_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
375	{	342	{
376	int value = RANDOM () % tl->total_chance;	343	int value = rndm (tl->total_chance);
377	treasure *t;	344	treasure *t;
378		345
379	if (tries++ > 100)	346	if (tries++ > 100)
380	{	347	{
381	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");	348	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");
382	return;	349	return;
383	}	350	}
384		351
385	for (t = tl->items; t != NULL; t = t->next)	352	for (t = tl->items; t; t = t->next)
386	{	353	{
387	value -= t->chance;	354	value -= t->chance;
388		355
389	if (value < 0)	356	if (value < 0)
390	break;	357	break;
391	}	358	}
392		359
393	if (!t || value >= 0)	360	if (!t || value >= 0)
394	{
395	LOG (llevError, "create_one_treasure: got null object or not able to find treasure\n");	361	cleanup ("create_one_treasure: got null object or not able to find treasure\n", 1);
396	abort ();
397	return;
398	}
399		362
400	if (t->name)	363	if (t->name)
401	{	364	{
402	if (!strcmp (t->name, "NONE"))
403	return;
404
405	if (difficulty >= t->magic)	365	if (difficulty >= t->magic)
406	{	366	{
407	treasurelist *tl = find_treasurelist (t->name);	367	treasurelist *tl = treasurelist::find (t->name);
408	if (tl)	368	if (tl)
409	create_treasure (tl, op, flag, difficulty, tries);	369	create_treasure (tl, op, flag, difficulty, tries);
410	}	370	}
411	else if (t->nrof)	371	else if (t->nrof)
412	create_one_treasure (tl, op, flag, difficulty, tries);	372	create_one_treasure (tl, op, flag, difficulty, tries);
413
414	return;
415	}	373	}
416
417	if ((t->item && t->item->clone.invisible != 0) || flag != GT_INVISIBLE)	374	else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE))
418	{	375	{
419	object *tmp = arch_to_object (t->item);	376	if (object *tmp = arch_to_object (t->item))
420		377	{
421	if (!tmp)
422	return;
423
424	if (t->nrof && tmp->nrof <= 1)	378	if (t->nrof && tmp->nrof <= 1)
425	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	379	tmp->nrof = rndm (t->nrof) + 1;
426		380
427	fix_generated_item (tmp, op, difficulty, t->magic, flag);	381	fix_generated_item (tmp, op, difficulty, t->magic, flag);
428	change_treasure (t, tmp);	382	change_treasure (t, tmp);
429	put_treasure (tmp, op, flag);	383	put_treasure (tmp, op, flag);
		384	}
430	}	385	}
		386	}
		387
		388	void
		389	object::create_treasure (treasurelist *tl, int flags)
		390	{
		391	::create_treasure (tl, this, flags, map ? map->difficulty : 0);
431	}	392	}
432		393
433	/* This calls the appropriate treasure creation function. tries is passed	394	/* This calls the appropriate treasure creation function. tries is passed
434	* to determine how many list transitions or attempts to create treasure	395	* to determine how many list transitions or attempts to create treasure
435	* have been made. It is really in place to prevent infinite loops with	396	* have been made. It is really in place to prevent infinite loops with
436	* list transitions, or so that excessively good treasure will not be	397	* list transitions, or so that excessively good treasure will not be
437	* created on weak maps, because it will exceed the number of allowed tries	398	* created on weak maps, because it will exceed the number of allowed tries
438	* to do that.	399	* to do that.
439	*/	400	*/
440	void	401	void
441	create_treasure (treasurelist * t, object *op, int flag, int difficulty, int tries)	402	create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
442	{	403	{
		404	// empty treasurelists are legal
		405	if (!tl->items)
		406	return;
443		407
444	if (tries++ > 100)	408	if (tries++ > 100)
445	{	409	{
446	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	410	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
447	return;	411	return;
448	}	412	}
		413
		414	if (op->flag [FLAG_TREASURE_ENV])
		415	{
		416	// do not generate items when there already is something above the object
		417	if (op->flag [FLAG_IS_FLOOR] && op->above)
		418	return;
		419
		420	flag |= GT_ENVIRONMENT;
		421	}
		422
449	if (t->total_chance)	423	if (tl->total_chance)
450	create_one_treasure (t, op, flag, difficulty, tries);	424	create_one_treasure (tl, op, flag, difficulty, tries);
451	else	425	else
452	create_all_treasures (t->items, op, flag, difficulty, tries);	426	create_all_treasures (tl->items, op, flag, difficulty, tries);
453	}	427	}
454		428
455	/* This is similar to the old generate treasure function. However,	429	/* This is similar to the old generate treasure function. However,
456	* it instead takes a treasurelist. It is really just a wrapper around	430	* it instead takes a treasurelist. It is really just a wrapper around
457	* create_treasure. We create a dummy object that the treasure gets	431	* create_treasure. We create a dummy object that the treasure gets
458	* inserted into, and then return that treausre	432	* inserted into, and then return that treausre
459	*/	433	*/
460	object *	434	object *
461	generate_treasure (treasurelist *t, int difficulty)	435	generate_treasure (treasurelist *tl, int difficulty)
462	{	436	{
463	difficulty = clamp (difficulty, 1, settings.max_level);	437	difficulty = clamp (difficulty, 1, settings.max_level);
464		438
465	object *ob = object::create (), *tmp;	439	object *ob = object::create ();
466		440
467	create_treasure (t, ob, 0, difficulty, 0);	441	create_treasure (tl, ob, 0, difficulty, 0);
468		442
469	/* Don't want to free the object we are about to return */	443	/* Don't want to free the object we are about to return */
470	tmp = ob->inv;	444	object *tmp = ob->inv;
471	if (tmp != NULL)	445	if (tmp)
472	tmp->remove ();	446	tmp->remove ();
473		447
474	if (ob->inv)	448	if (ob->inv)
475	LOG (llevError, "In generate treasure, created multiple objects.\n");	449	LOG (llevError, "In generate treasure, created multiple objects.\n");
476		450
…		…
484	* The array has two arguments, the difficulty of the level, and the	458	* The array has two arguments, the difficulty of the level, and the
485	* magical bonus "wanted".	459	* magical bonus "wanted".
486	*/	460	*/
487		461
488	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	462	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
489
490	/*chance of magic difficulty*/	463	// chance of magic difficulty
491
492	/* +0 +1 +2 +3 +4 */	464	// +0 +1 +2 +3 +4
493	{95, 2, 2, 1, 0}, /*1 */	465	{95, 2, 2, 1, 0}, // 1
494	{92, 5, 2, 1, 0}, /*2 */	466	{92, 5, 2, 1, 0}, // 2
495	{85, 10, 4, 1, 0}, /*3 */	467	{85, 10, 4, 1, 0}, // 3
496	{80, 14, 4, 2, 0}, /*4 */	468	{80, 14, 4, 2, 0}, // 4
497	{75, 17, 5, 2, 1}, /*5 */	469	{75, 17, 5, 2, 1}, // 5
498	{70, 18, 8, 3, 1}, /*6 */	470	{70, 18, 8, 3, 1}, // 6
499	{65, 21, 10, 3, 1}, /*7 */	471	{65, 21, 10, 3, 1}, // 7
500	{60, 22, 12, 4, 2}, /*8 */	472	{60, 22, 12, 4, 2}, // 8
501	{55, 25, 14, 4, 2}, /*9 */	473	{55, 25, 14, 4, 2}, // 9
502	{50, 27, 16, 5, 2}, /*10 */	474	{50, 27, 16, 5, 2}, // 10
503	{45, 28, 18, 6, 3}, /*11 */	475	{45, 28, 18, 6, 3}, // 11
504	{42, 28, 20, 7, 3}, /*12 */	476	{42, 28, 20, 7, 3}, // 12
505	{40, 27, 21, 8, 4}, /*13 */	477	{40, 27, 21, 8, 4}, // 13
506	{38, 25, 22, 10, 5}, /*14 */	478	{38, 25, 22, 10, 5}, // 14
507	{36, 23, 23, 12, 6}, /*15 */	479	{36, 23, 23, 12, 6}, // 15
508	{33, 21, 24, 14, 8}, /*16 */	480	{33, 21, 24, 14, 8}, // 16
509	{31, 19, 25, 16, 9}, /*17 */	481	{31, 19, 25, 16, 9}, // 17
510	{27, 15, 30, 18, 10}, /*18 */	482	{27, 15, 30, 18, 10}, // 18
511	{20, 12, 30, 25, 13}, /*19 */	483	{20, 12, 30, 25, 13}, // 19
512	{15, 10, 28, 30, 17}, /*20 */	484	{15, 10, 28, 30, 17}, // 20
513	{13, 9, 27, 28, 23}, /*21 */	485	{13, 9, 27, 28, 23}, // 21
514	{10, 8, 25, 28, 29}, /*22 */	486	{10, 8, 25, 28, 29}, // 22
515	{8, 7, 23, 26, 36}, /*23 */	487	{ 8, 7, 23, 26, 36}, // 23
516	{6, 6, 20, 22, 46}, /*24 */	488	{ 6, 6, 20, 22, 46}, // 24
517	{4, 5, 17, 18, 56}, /*25 */	489	{ 4, 5, 17, 18, 56}, // 25
518	{2, 4, 12, 14, 68}, /*26 */	490	{ 2, 4, 12, 14, 68}, // 26
519	{0, 3, 7, 10, 80}, /*27 */	491	{ 0, 3, 7, 10, 80}, // 27
520	{0, 0, 3, 7, 90}, /*28 */	492	{ 0, 0, 3, 7, 90}, // 28
521	{0, 0, 0, 3, 97}, /*29 */	493	{ 0, 0, 0, 3, 97}, // 29
522	{0, 0, 0, 0, 100}, /*30 */	494	{ 0, 0, 0, 0, 100}, // 30
523	{0, 0, 0, 0, 100}, /*31 */	495	{ 0, 0, 0, 0, 100}, // 31
524	};	496	};
525
526		497
527	/* calculate the appropriate level for wands staves and scrolls.	498	/* calculate the appropriate level for wands staves and scrolls.
528	* This code presumes that op has had its spell object created (in op->inv)	499	* This code presumes that op has had its spell object created (in op->inv)
529	*	500	*
530	* elmex Wed Aug 9 17:44:59 CEST 2006:	501	* elmex Wed Aug 9 17:44:59 CEST 2006:
531	* Removed multiplicator, too many high-level items were generated on low-difficulty maps.	502	* Removed multiplicator, too many high-level items were generated on low-difficulty maps.
532	*/	503	*/
533
534	int	504	int
535	level_for_item (const object *op, int difficulty)	505	level_for_item (const object *op, int difficulty)
536	{	506	{
537	int olevel = 0;
538
539	if (!op->inv)	507	if (!op->inv)
540	{	508	{
541	LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);	509	LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);
542	return 0;	510	return 0;
543	}	511	}
544		512
545	olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2));	513	int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.));
546		514
547	if (olevel <= 0)	515	if (olevel <= 0)
548	olevel = rndm (1, MIN (op->inv->level, 1));	516	olevel = rndm (1, op->inv->level);
549		517
550	if (olevel > MAXLEVEL)	518	return min (olevel, MAXLEVEL);
551	olevel = MAXLEVEL;
552
553	return olevel;
554	}	519	}
555		520
556	/*	521	/*
557	* Based upon the specified difficulty and upon the difftomagic_list array,	522	* Based upon the specified difficulty and upon the difftomagic_list array,
558	* a random magical bonus is returned. This is used when determine	523	* a random magical bonus is returned. This is used when determine
…		…
561	* elmex Thu Aug 10 18:45:44 CEST 2006:	526	* elmex Thu Aug 10 18:45:44 CEST 2006:
562	* Scaling difficulty by max_level, as difficulty is a level and not some	527	* Scaling difficulty by max_level, as difficulty is a level and not some
563	* weird integer between 1-31.	528	* weird integer between 1-31.
564	*	529	*
565	*/	530	*/
566
567	int	531	int
568	magic_from_difficulty (int difficulty)	532	magic_from_difficulty (int difficulty)
569	{	533	{
570	int percent = 0, magic = 0;	534	int percent = 0, magic = 0;
571	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	535	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
…		…
576	scaled_diff = 0;	540	scaled_diff = 0;
577		541
578	if (scaled_diff >= DIFFLEVELS)	542	if (scaled_diff >= DIFFLEVELS)
579	scaled_diff = DIFFLEVELS - 1;	543	scaled_diff = DIFFLEVELS - 1;
580		544
581	percent = RANDOM () % 100;	545	percent = rndm (100);
582		546
583	for (magic = 0; magic < (MAXMAGIC + 1); magic++)	547	for (magic = 0; magic < (MAXMAGIC + 1); magic++)
584	{	548	{
585	percent -= difftomagic_list[scaled_diff][magic];	549	percent -= difftomagic_list[scaled_diff][magic];
586		550
…		…
592	{	556	{
593	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);	557	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);
594	magic = 0;	558	magic = 0;
595	}	559	}
596		560
597	magic = (RANDOM () % 3) ? magic : -magic;	561	magic = (rndm (3)) ? magic : -magic;
598	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */	562	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */
599		563
600	return magic;	564	return magic;
601	}	565	}
602		566
…		…
615		579
616	op->magic = magic;	580	op->magic = magic;
617	if (op->arch)	581	if (op->arch)
618	{	582	{
619	if (op->type == ARMOUR)	583	if (op->type == ARMOUR)
620	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	584	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
621		585
622	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	586	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
623	magic = (-magic);	587	magic = (-magic);
624	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	588	op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
625	}	589	}
626	else	590	else
627	{	591	{
628	if (op->type == ARMOUR)	592	if (op->type == ARMOUR)
629	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	593	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
630	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	594	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
631	magic = (-magic);	595	magic = (-magic);
632	op->weight = (op->weight * (100 - magic * 10)) / 100;	596	op->weight = (op->weight * (100 - magic * 10)) / 100;
633	}	597	}
634	}	598	}
635		599
…		…
659	* 1) Since rings can have multiple bonuses, if the same bonus	623	* 1) Since rings can have multiple bonuses, if the same bonus
660	* is rolled again, increase it - the bonuses now stack with	624	* is rolled again, increase it - the bonuses now stack with
661	* other bonuses previously rolled and ones the item might natively have.	625	* other bonuses previously rolled and ones the item might natively have.
662	* 2) Add code to deal with new PR method.	626	* 2) Add code to deal with new PR method.
663	*/	627	*/
664
665	void	628	void
666	set_ring_bonus (object *op, int bonus)	629	set_ring_bonus (object *op, int bonus)
667	{	630	{
668		631
669	int r = RANDOM () % (bonus > 0 ? 25 : 11);	632	int r = rndm (bonus > 0 ? 25 : 11);
670		633
671	if (op->type == AMULET)	634	if (op->type == AMULET)
672	{	635	{
673	if (!(RANDOM () % 21))	636	if (!(rndm (21)))
674	r = 20 + RANDOM () % 2;	637	r = 20 + rndm (2);
675	else	638	else
676	{	639	{
677	if (RANDOM () & 2)	640	if (rndm (2))
678	r = 10;	641	r = 10;
679	else	642	else
680	r = 11 + RANDOM () % 9;	643	r = 11 + rndm (9);
681	}	644	}
682	}	645	}
683		646
684	switch (r)	647	switch (r)
685	{	648	{
…		…
692	case 2:	655	case 2:
693	case 3:	656	case 3:
694	case 4:	657	case 4:
695	case 5:	658	case 5:
696	case 6:	659	case 6:
697	set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r)));	660	op->stats.stat (r) += bonus;
698	break;	661	break;
699		662
700	case 7:	663	case 7:
701	op->stats.dam += bonus;	664	op->stats.dam += bonus;
702	break;	665	break;
…		…
722	case 16:	685	case 16:
723	case 17:	686	case 17:
724	case 18:	687	case 18:
725	case 19:	688	case 19:
726	{	689	{
727	int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table;	690	int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
728		691
729	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */	692	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */
730	val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b;	693	val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
731		694
732	/* Cursed items need to have higher negative values to equal out with	695	/* Cursed items need to have higher negative values to equal out with
733	* positive values for how protections work out. Put another	696	* positive values for how protections work out. Put another
734	* little random element in since that they don't always end up with	697	* little random element in since that they don't always end up with
735	* even values.	698	* even values.
736	*/	699	*/
737	if (bonus < 0)	700	if (bonus < 0)
738	val = 2 * -val - RANDOM () % b;	701	val = 2 * -val - rndm (b);
739	if (val > 35)	702	if (val > 35)
740	val = 35; /* Upper limit */	703	val = 35; /* Upper limit */
741	b = 0;	704	b = 0;
		705
742	while (op->resist[resist_table[resist]] != 0 && b < 4)	706	while (op->resist[resist_table[resist]] != 0 && b < 4)
743	{
744	resist = RANDOM () % num_resist_table;	707	resist = rndm (num_resist_table);
745	}	708
746	if (b == 4)	709	if (b == 4)
747	return; /* Not able to find a free resistance */	710	return; /* Not able to find a free resistance */
		711
748	op->resist[resist_table[resist]] = val;	712	op->resist[resist_table[resist]] = val;
749	/* We should probably do something more clever here to adjust value	713	/* We should probably do something more clever here to adjust value
750	* based on how good a resistance we gave.	714	* based on how good a resistance we gave.
751	*/	715	*/
752	break;	716	break;
…		…
780	case 22:	744	case 22:
781	op->stats.exp += bonus; /* Speed! */	745	op->stats.exp += bonus; /* Speed! */
782	op->value = (op->value * 2) / 3;	746	op->value = (op->value * 2) / 3;
783	break;	747	break;
784	}	748	}
		749
785	if (bonus > 0)	750	if (bonus > 0)
786	op->value *= 2 * bonus;	751	op->value *= 2 * bonus;
787	else	752	else
788	op->value = -(op->value * 2 * bonus) / 3;	753	op->value = -(op->value * 2 * bonus) / 3;
789	}	754	}
…		…
794	* higher is the chance of returning a low number.	759	* higher is the chance of returning a low number.
795	* It is only used in fix_generated_treasure() to set bonuses on	760	* It is only used in fix_generated_treasure() to set bonuses on
796	* rings and amulets.	761	* rings and amulets.
797	* Another scheme is used to calculate the magic of weapons and armours.	762	* Another scheme is used to calculate the magic of weapons and armours.
798	*/	763	*/
799
800	int	764	int
801	get_magic (int diff)	765	get_magic (int diff)
802	{	766	{
803	int i;	767	int i;
804		768
805	if (diff < 3)	769	if (diff < 3)
806	diff = 3;	770	diff = 3;
		771
807	for (i = 0; i < 4; i++)	772	for (i = 0; i < 4; i++)
808	if (RANDOM () % diff)	773	if (rndm (diff))
809	return i;	774	return i;
		775
810	return 4;	776	return 4;
811	}	777	}
812		778
813	#define DICE2 (get_magic(2)==2?2:1)	779	#define DICE2 (get_magic(2)==2?2:1)
814	#define DICESPELL (RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3)	780	#define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))
815		781
816	/*	782	/*
817	* fix_generated_item(): This is called after an item is generated, in	783	* fix_generated_item(): This is called after an item is generated, in
818	* order to set it up right. This produced magical bonuses, puts spells	784	* order to set it up right. This produced magical bonuses, puts spells
819	* into scrolls/books/wands, makes it unidentified, hides the value, etc.	785	* into scrolls/books/wands, makes it unidentified, hides the value, etc.
…		…
833	* value.	799	* value.
834	* GT_MINIMAL: Does minimal processing on the object - just enough to make it	800	* GT_MINIMAL: Does minimal processing on the object - just enough to make it
835	* a working object - don't change magic, value, etc, but set it material	801	* a working object - don't change magic, value, etc, but set it material
836	* type as appropriate, for objects that need spell objects, set those, etc	802	* type as appropriate, for objects that need spell objects, set those, etc
837	*/	803	*/
838
839	void	804	void
840	fix_generated_item (object *op, object *creator, int difficulty, int max_magic, int flags)	805	fix_generated_item (object *op, object *creator, int difficulty, int max_magic, int flags)
841	{	806	{
842	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;	807	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;
843		808
…		…
848	save_item_power = op->item_power;	813	save_item_power = op->item_power;
849	op->item_power = 0;	814	op->item_power = 0;
850		815
851	if (op->randomitems && op->type != SPELL)	816	if (op->randomitems && op->type != SPELL)
852	{	817	{
853	create_treasure (op->randomitems, op, flags, difficulty, 0);	818	create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0);
854	if (!op->inv)
855	LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", &op->name);
856
857	/* So the treasure doesn't get created again */	819	/* So the treasure doesn't get created again */
858	op->randomitems = NULL;	820	op->randomitems = 0;
859	}	821	}
860		822
861	if (difficulty < 1)	823	if (difficulty < 1)
862	difficulty = 1;	824	difficulty = 1;
863		825
…		…
867	ARG_INT (flags)))	829	ARG_INT (flags)))
868	return;	830	return;
869		831
870	if (!(flags & GT_MINIMAL))	832	if (!(flags & GT_MINIMAL))
871	{	833	{
872	if (op->arch == crown_arch)	834	if (IS_ARCH (op->arch, crown))
873	{	835	{
874	set_magic (difficulty, op, max_magic, flags);	836	set_magic (difficulty, op, max_magic, flags);
875	num_enchantments = calc_item_power (op, 1);	837	num_enchantments = calc_item_power (op, 1);
876	generate_artifact (op, difficulty);	838	generate_artifact (op, difficulty);
877	}	839	}
…		…
880	if (!op->magic && max_magic)	842	if (!op->magic && max_magic)
881	set_magic (difficulty, op, max_magic, flags);	843	set_magic (difficulty, op, max_magic, flags);
882		844
883	num_enchantments = calc_item_power (op, 1);	845	num_enchantments = calc_item_power (op, 1);
884		846
885	if ((!was_magic && !(RANDOM () % CHANCE_FOR_ARTIFACT)) || op->type == HORN || difficulty >= settings.max_level) /* high difficulties always generate an artifact,	847	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
886	* used for shop_floors or treasures */	848	|| op->type == HORN
		849	|| difficulty >= settings.max_level) /* high difficulties always generate an artifact, used for shop_floors or treasures */
887	generate_artifact (op, difficulty);	850	generate_artifact (op, difficulty);
888	}	851	}
889		852
890	/* Object was made an artifact. Calculate its item_power rating.	853	/* Object was made an artifact. Calculate its item_power rating.
891	* the item_power in the object is what the artfiact adds.	854	* the item_power in the object is what the artfiact adds.
…		…
933	{	896	{
934	if (op->type == POTION)	897	if (op->type == POTION)
935	/* Handle healing and magic power potions */	898	/* Handle healing and magic power potions */
936	if (op->stats.sp && !op->randomitems)	899	if (op->stats.sp && !op->randomitems)
937	{	900	{
938	object *tmp;
939
940	tmp = get_archetype (spell_mapping[op->stats.sp]);	901	object *tmp = get_archetype (spell_mapping [op->stats.sp]);
941	insert_ob_in_ob (tmp, op);	902	insert_ob_in_ob (tmp, op);
942	op->stats.sp = 0;	903	op->stats.sp = 0;
943	}	904	}
944	}	905	}
945	else if (!op->title) /* Only modify object if not special */	906	else if (!op->title) /* Only modify object if not special */
…		…
948	case WEAPON:	909	case WEAPON:
949	case ARMOUR:	910	case ARMOUR:
950	case SHIELD:	911	case SHIELD:
951	case HELMET:	912	case HELMET:
952	case CLOAK:	913	case CLOAK:
953	if (QUERY_FLAG (op, FLAG_CURSED) && !(RANDOM () % 4))	914	if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
954	set_ring_bonus (op, -DICE2);	915	set_ring_bonus (op, -DICE2);
955	break;	916	break;
956		917
957	case BRACERS:	918	case BRACERS:
958	if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)))	919	if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
959	{	920	{
960	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	921	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
961	if (!QUERY_FLAG (op, FLAG_CURSED))	922	if (!QUERY_FLAG (op, FLAG_CURSED))
962	op->value *= 3;	923	op->value *= 3;
963	}	924	}
…		…
989	*/	950	*/
990	if (op->inv && op->randomitems)	951	if (op->inv && op->randomitems)
991	{	952	{
992	/* value multiplier is same as for scrolls */	953	/* value multiplier is same as for scrolls */
993	op->value = (op->value * op->inv->value);	954	op->value = (op->value * op->inv->value);
994	op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty;	955	op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
995	}	956	}
996	else	957	else
997	{	958	{
998	op->name = "potion";	959	op->name = "potion";
999	op->name_pl = "potions";	960	op->name_pl = "potions";
1000	}	961	}
1001		962
1002	if (!(flags & GT_ONLY_GOOD) && RANDOM () % 2)	963	if (!(flags & GT_ONLY_GOOD) && rndm (2))
1003	SET_FLAG (op, FLAG_CURSED);	964	SET_FLAG (op, FLAG_CURSED);
1004	break;	965	break;
1005	}	966	}
1006		967
1007	case AMULET:	968	case AMULET:
1008	if (op->arch == amulet_arch)	969	if (IS_ARCH (op->arch, amulet))
1009	op->value *= 5; /* Since it's not just decoration */	970	op->value *= 5; /* Since it's not just decoration */
1010		971
1011	case RING:	972	case RING:
1012	if (op->arch == NULL)	973	if (!op->arch) // wtf? schmorp
1013	{	974	{
1014	op->destroy ();	975	op->destroy ();
1015	op = 0;	976	op = 0;
1016	break;	977	break;
1017	}	978	}
1018		979
1019	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */	980	if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */
1020	break;	981	break;
1021		982
1022	if (!(flags & GT_ONLY_GOOD) && !(RANDOM () % 3))	983	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1023	SET_FLAG (op, FLAG_CURSED);	984	SET_FLAG (op, FLAG_CURSED);
1024		985
1025	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	986	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
1026		987
1027	if (op->type != RING) /* Amulets have only one ability */	988	if (op->type != RING) /* Amulets have only one ability */
1028	break;	989	break;
1029		990
1030	if (!(RANDOM () % 4))	991	if (!(rndm (4)))
1031	{	992	{
1032	int d = (RANDOM () % 2 || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	993	int d = (rndm (2) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1033		994
1034	if (d > 0)	995	if (d > 0)
1035	op->value *= 3;	996	op->value *= 3;
1036		997
1037	set_ring_bonus (op, d);	998	set_ring_bonus (op, d);
1038		999
1039	if (!(RANDOM () % 4))	1000	if (!(rndm (4)))
1040	{	1001	{
1041	int d = (RANDOM () % 3 || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	1002	int d = (rndm (3) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1042		1003
1043	if (d > 0)	1004	if (d > 0)
1044	op->value *= 5;	1005	op->value *= 5;
1045	set_ring_bonus (op, d);	1006	set_ring_bonus (op, d);
1046	}	1007	}
1047	}	1008	}
1048		1009
1049	if (GET_ANIM_ID (op))	1010	if (GET_ANIM_ID (op))
1050	SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op)));	1011	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1051		1012
1052	break;	1013	break;
1053		1014
1054	case BOOK:	1015	case BOOK:
1055	/* Is it an empty book?, if yes lets make a special·	1016	/* Is it an empty book?, if yes lets make a special·
1056	* msg for it, and tailor its properties based on the·	1017	* msg for it, and tailor its properties based on the·
1057	* creator and/or map level we found it on.	1018	* creator and/or map level we found it on.
1058	*/	1019	*/
1059	if (!op->msg && RANDOM () % 10)	1020	if (!op->msg && rndm (10))
1060	{	1021	{
1061	/* set the book level properly */	1022	/* set the book level properly */
1062	if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE))	1023	if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE))
1063	{	1024	{
1064	if (op->map && op->map->difficulty)	1025	if (op->map && op->map->difficulty)
1065	op->level = RANDOM () % (op->map->difficulty) + RANDOM () % 10 + 1;	1026	op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1066	else	1027	else
1067	op->level = RANDOM () % 20 + 1;	1028	op->level = rndm (20) + 1;
1068	}	1029	}
1069	else	1030	else
1070	op->level = RANDOM () % creator->level;	1031	op->level = rndm (creator->level);
1071		1032
1072	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);	1033	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);
1073	/* books w/ info are worth more! */	1034	/* books w/ info are worth more! */
1074	op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1));	1035	op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1));
1075	/* creator related stuff */	1036	/* creator related stuff */
…		…
1174	*/	1135	*/
1175		1136
1176	/*	1137	/*
1177	* Allocate and return the pointer to an empty artifactlist structure.	1138	* Allocate and return the pointer to an empty artifactlist structure.
1178	*/	1139	*/
1179
1180	static artifactlist *	1140	static artifactlist *
1181	get_empty_artifactlist (void)	1141	get_empty_artifactlist (void)
1182	{	1142	{
1183	artifactlist *tl = (artifactlist *) malloc (sizeof (artifactlist));	1143	return salloc0<artifactlist> ();
1184
1185	if (tl == NULL)
1186	fatal (OUT_OF_MEMORY);
1187	tl->next = NULL;
1188	tl->items = NULL;
1189	tl->total_chance = 0;
1190	return tl;
1191	}	1144	}
1192		1145
1193	/*	1146	/*
1194	* Allocate and return the pointer to an empty artifact structure.	1147	* Allocate and return the pointer to an empty artifact structure.
1195	*/	1148	*/
1196
1197	static artifact *	1149	static artifact *
1198	get_empty_artifact (void)	1150	get_empty_artifact (void)
1199	{	1151	{
1200	artifact *t = (artifact *) malloc (sizeof (artifact));	1152	return salloc0<artifact> ();
1201
1202	if (t == NULL)
1203	fatal (OUT_OF_MEMORY);
1204	t->item = NULL;
1205	t->next = NULL;
1206	t->chance = 0;
1207	t->difficulty = 0;
1208	t->allowed = NULL;
1209	return t;
1210	}	1153	}
1211		1154
1212	/*	1155	/*
1213	* Searches the artifact lists and returns one that has the same type	1156	* Searches the artifact lists and returns one that has the same type
1214	* of objects on it.	1157	* of objects on it.
1215	*/	1158	*/
1216
1217	artifactlist *	1159	artifactlist *
1218	find_artifactlist (int type)	1160	find_artifactlist (int type)
1219	{	1161	{
1220	artifactlist *al;
1221
1222	for (al = first_artifactlist; al != NULL; al = al->next)	1162	for (artifactlist *al = first_artifactlist; al; al = al->next)
1223	if (al->type == type)	1163	if (al->type == type)
1224	return al;	1164	return al;
1225	return NULL;
1226	}
1227		1165
1228	/*
1229	* For debugging purposes. Dumps all tables.
1230	*/
1231
1232	void
1233	dump_artifacts (void)
1234	{
1235	artifactlist *al;
1236	artifact *art;
1237	linked_char *next;
1238
1239	fprintf (logfile, "\n");
1240	for (al = first_artifactlist; al != NULL; al = al->next)
1241	{
1242	fprintf (logfile, "Artifact has type %d, total_chance=%d\n", al->type, al->total_chance);
1243	for (art = al->items; art != NULL; art = art->next)
1244	{
1245	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1246	if (art->allowed != NULL)
1247	{
1248	fprintf (logfile, "\tAllowed combinations:");
1249	for (next = art->allowed; next != NULL; next = next->next)
1250	fprintf (logfile, "%s,", &next->name);
1251	fprintf (logfile, "\n");
1252	}
1253	}
1254	}
1255	fprintf (logfile, "\n");
1256	}
1257
1258	/*
1259	* For debugging purposes. Dumps all treasures recursively (see below).
1260	*/
1261	void
1262	dump_monster_treasure_rec (const char *name, treasure *t, int depth)
1263	{
1264	treasurelist *tl;
1265	int i;
1266
1267	if (depth > 100)
1268	return;	1166	return 0;
1269	while (t != NULL)
1270	{
1271	if (t->name != NULL)
1272	{
1273	for (i = 0; i < depth; i++)
1274	fprintf (logfile, " ");
1275	fprintf (logfile, "{ (list: %s)\n", &t->name);
1276	tl = find_treasurelist (t->name);
1277	if (tl)
1278	dump_monster_treasure_rec (name, tl->items, depth + 2);
1279	for (i = 0; i < depth; i++)
1280	fprintf (logfile, " ");
1281	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1282	}
1283	else
1284	{
1285	for (i = 0; i < depth; i++)
1286	fprintf (logfile, " ");
1287	if (t->item->clone.type == FLESH)
1288	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1289	else
1290	fprintf (logfile, "%s\n", &t->item->clone.name);
1291	}
1292	if (t->next_yes != NULL)
1293	{
1294	for (i = 0; i < depth; i++)
1295	fprintf (logfile, " ");
1296	fprintf (logfile, " (if yes)\n");
1297	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1298	}
1299	if (t->next_no != NULL)
1300	{
1301	for (i = 0; i < depth; i++)
1302	fprintf (logfile, " ");
1303	fprintf (logfile, " (if no)\n");
1304	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1305	}
1306	t = t->next;
1307	}
1308	}
1309
1310	/*
1311	* For debugging purposes. Dumps all treasures for a given monster.
1312	* Created originally by Raphael Quinet for debugging the alchemy code.
1313	*/
1314
1315	void
1316	dump_monster_treasure (const char *name)
1317	{
1318	archetype *at;
1319	int found;
1320
1321	found = 0;
1322	fprintf (logfile, "\n");
1323	for (at = first_archetype; at != NULL; at = at->next)
1324	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1325	{
1326	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1327	if (at->clone.randomitems != NULL)
1328	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1329	else
1330	fprintf (logfile, "(nothing)\n");
1331	fprintf (logfile, "\n");
1332	found++;
1333	}
1334	if (found == 0)
1335	fprintf (logfile, "No objects have the name %s!\n\n", name);
1336	}	1167	}
1337		1168
1338	/*	1169	/*
1339	* Builds up the lists of artifacts from the file in the libdir.	1170	* Builds up the lists of artifacts from the file in the libdir.
1340	*/	1171	*/
1341
1342	void	1172	void
1343	init_artifacts (void)	1173	init_artifacts (void)
1344	{	1174	{
1345	static int has_been_inited = 0;	1175	static int has_been_inited = 0;
1346	char filename[MAX_BUF], buf[HUGE_BUF], *cp, *next;	1176	char filename[MAX_BUF];
1347	artifact *art = NULL;	1177	artifact *art = NULL;
1348	linked_char *tmp;
1349	int value;
1350	artifactlist *al;	1178	artifactlist *al;
1351		1179
1352	if (has_been_inited)	1180	if (has_been_inited)
1353	return;	1181	return;
1354	else	1182	else
1355	has_been_inited = 1;	1183	has_been_inited = 1;
1356		1184
1357	sprintf (filename, "%s/artifacts", settings.datadir);	1185	sprintf (filename, "%s/artifacts", settings.datadir);
1358	object_thawer thawer (filename);	1186	object_thawer f (filename);
1359		1187
1360	if (!thawer)	1188	if (!f)
1361	return;	1189	return;
1362		1190
1363	while (fgets (buf, HUGE_BUF, thawer) != NULL)	1191	for (;;)
1364	{	1192	{
1365	if (*buf == '#')	1193	switch (f.kw)
1366	continue;
1367	if ((cp = strchr (buf, '\n')) != NULL)
1368	*cp = '\0';
1369	cp = buf;
1370	while (*cp == ' ') /* Skip blanks */
1371	cp++;
1372	if (*cp == '\0')
1373	continue;
1374
1375	if (!strncmp (cp, "Allowed", 7))
1376	{	1194	{
		1195	case KW_allowed:
1377	if (art == NULL)	1196	if (!art)
		1197	art = get_empty_artifact ();
		1198
1378	{	1199	{
1379	art = get_empty_artifact ();	1200	if (!strcmp (f.get_str (), "all"))
1380	nrofartifacts++;	1201	break;
		1202
		1203	char *next, *cp = f.get_str ();
		1204
		1205	do
		1206	{
		1207	if ((next = strchr (cp, ',')))
		1208	*next++ = '\0';
		1209
		1210	linked_char *tmp = new linked_char;
		1211
		1212	tmp->name = cp;
		1213	tmp->next = art->allowed;
		1214	art->allowed = tmp;
		1215	}
		1216	while ((cp = next));
1381	}	1217	}
1382	cp = strchr (cp, ' ') + 1;	1218	break;
1383	if (!strcmp (cp, "all"))	1219
		1220	case KW_chance:
		1221	f.get (art->chance);
		1222	break;
		1223
		1224	case KW_difficulty:
		1225	f.get (art->difficulty);
		1226	break;
		1227
		1228	case KW_object:
		1229	{
		1230	art->item = object::create ();
		1231	f.get (art->item->name);
		1232	f.next ();
		1233
		1234	if (!art->item->parse_kv (f))
		1235	LOG (llevError, "Init_Artifacts: Could not load object.\n");
		1236
		1237	al = find_artifactlist (art->item->type);
		1238
		1239	if (!al)
		1240	{
		1241	al = get_empty_artifactlist ();
		1242	al->type = art->item->type;
		1243	al->next = first_artifactlist;
		1244	first_artifactlist = al;
		1245	}
		1246
		1247	art->next = al->items;
		1248	al->items = art;
		1249	art = 0;
		1250	}
1384	continue;	1251	continue;
1385		1252
1386	do	1253	case KW_EOF:
		1254	goto done;
		1255
		1256	default:
		1257	if (!f.parse_error ("artifacts file"))
		1258	cleanup ("artifacts file required");
1387	{	1259	break;
1388	nrofallowedstr++;
1389	if ((next = strchr (cp, ',')) != NULL)
1390	*(next++) = '\0';
1391	tmp = new linked_char;
1392
1393	tmp->name = cp;
1394	tmp->next = art->allowed;
1395	art->allowed = tmp;
1396	}
1397	while ((cp = next) != NULL);
1398	}
1399	else if (sscanf (cp, "chance %d", &value))
1400	art->chance = (uint16) value;
1401	else if (sscanf (cp, "difficulty %d", &value))
1402	art->difficulty = (uint8) value;
1403	else if (!strncmp (cp, "Object", 6))
1404	{	1260	}
1405	art->item = object::create ();
1406		1261
1407	if (!load_object (thawer, art->item, 0))	1262	f.next ();
1408	LOG (llevError, "Init_Artifacts: Could not load object.\n");
1409
1410	art->item->name = strchr (cp, ' ') + 1;
1411	al = find_artifactlist (art->item->type);
1412	if (al == NULL)
1413	{
1414	al = get_empty_artifactlist ();
1415	al->type = art->item->type;
1416	al->next = first_artifactlist;
1417	first_artifactlist = al;
1418	}
1419	art->next = al->items;
1420	al->items = art;
1421	art = NULL;
1422	}
1423	else
1424	LOG (llevError, "Unknown input in artifact file: %s\n", buf);
1425	}	1263	}
1426		1264
		1265	done:
1427	for (al = first_artifactlist; al != NULL; al = al->next)	1266	for (al = first_artifactlist; al; al = al->next)
1428	{	1267	{
		1268	al->total_chance = 0;
		1269
1429	for (art = al->items; art != NULL; art = art->next)	1270	for (art = al->items; art; art = art->next)
1430	{	1271	{
1431	if (!art->chance)	1272	if (!art->chance)
1432	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1273	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1433	else	1274	else
1434	al->total_chance += art->chance;	1275	al->total_chance += art->chance;
…		…
1439	}	1280	}
1440		1281
1441	LOG (llevDebug, "done.\n");	1282	LOG (llevDebug, "done.\n");
1442	}	1283	}
1443		1284
1444
1445	/*	1285	/*
1446	* Used in artifact generation. The bonuses of the first object	1286	* Used in artifact generation. The bonuses of the first object
1447	* is modified by the bonuses of the second object.	1287	* is modified by the bonuses of the second object.
1448	*/	1288	*/
1449
1450	void	1289	void
1451	add_abilities (object *op, object *change)	1290	add_abilities (object *op, object *change)
1452	{	1291	{
1453	int i, tmp;	1292	int i, tmp;
1454		1293
1455	if (change->face != blank_face)	1294	if (change->face != blank_face)
1456	{	1295	{
1457	#ifdef TREASURE_VERBOSE	1296	#ifdef TREASURE_VERBOSE
1458	LOG (llevDebug, "FACE: %d\n", change->face->number);	1297	LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1459	#endif	1298	#endif
1460	op->face = change->face;	1299	op->face = change->face;
1461	}	1300	}
1462		1301
1463	for (i = 0; i < NUM_STATS; i++)	1302	for (i = 0; i < NUM_STATS; i++)
1464	change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i));	1303	change_attr_value (&(op->stats), i, change->stats.stat (i));
1465		1304
1466	op->attacktype |= change->attacktype;	1305	op->attacktype |= change->attacktype;
1467	op->path_attuned |= change->path_attuned;	1306	op->path_attuned |= change->path_attuned;
1468	op->path_repelled |= change->path_repelled;	1307	op->path_repelled |= change->path_repelled;
1469	op->path_denied |= change->path_denied;	1308	op->path_denied |= change->path_denied;
…		…
1499	CLEAR_FLAG (op, FLAG_ANIMATE);	1338	CLEAR_FLAG (op, FLAG_ANIMATE);
1500	/* so artifacts will join */	1339	/* so artifacts will join */
1501	if (!QUERY_FLAG (op, FLAG_ALIVE))	1340	if (!QUERY_FLAG (op, FLAG_ALIVE))
1502	op->speed = 0.0;	1341	op->speed = 0.0;
1503		1342
1504	update_ob_speed (op);	1343	op->set_speed (op->speed);
1505	}	1344	}
1506		1345
1507	if (change->nrof)	1346	if (change->nrof)
1508	op->nrof = RANDOM () % ((int) change->nrof) + 1;	1347	op->nrof = rndm (change->nrof) + 1;
1509		1348
1510	op->stats.exp += change->stats.exp; /* Speed modifier */	1349	op->stats.exp += change->stats.exp; /* Speed modifier */
1511	op->stats.wc += change->stats.wc;	1350	op->stats.wc += change->stats.wc;
1512	op->stats.ac += change->stats.ac;	1351	op->stats.ac += change->stats.ac;
1513		1352
…		…
1616	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);	1455	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);
1617	}	1456	}
1618		1457
1619	op->value *= change->value;	1458	op->value *= change->value;
1620		1459
1621	if (change->material)	1460	if (change->materials)
1622	op->material = change->material;	1461	op->materials = change->materials;
1623		1462
1624	if (change->materialname)	1463	if (change->materialname)
1625	op->materialname = change->materialname;	1464	op->materialname = change->materialname;
1626		1465
1627	if (change->slaying)	1466	if (change->slaying)
…		…
1633	if (change->msg)	1472	if (change->msg)
1634	op->msg = change->msg;	1473	op->msg = change->msg;
1635	}	1474	}
1636		1475
1637	static int	1476	static int
1638	legal_artifact_combination (object *op, artifact * art)	1477	legal_artifact_combination (object *op, artifact *art)
1639	{	1478	{
1640	int neg, success = 0;	1479	int neg, success = 0;
1641	linked_char *tmp;	1480	linked_char *tmp;
1642	const char *name;	1481	const char *name;
1643		1482
1644	if (art->allowed == (linked_char *) NULL)	1483	if (!art->allowed)
1645	return 1; /* Ie, "all" */	1484	return 1; /* Ie, "all" */
		1485
1646	for (tmp = art->allowed; tmp; tmp = tmp->next)	1486	for (tmp = art->allowed; tmp; tmp = tmp->next)
1647	{	1487	{
1648	#ifdef TREASURE_VERBOSE	1488	#ifdef TREASURE_VERBOSE
1649	LOG (llevDebug, "legal_art: %s\n", tmp->name);	1489	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1650	#endif	1490	#endif
1651	if (*tmp->name == '!')	1491	if (*tmp->name == '!')
1652	name = tmp->name + 1, neg = 1;	1492	name = tmp->name + 1, neg = 1;
1653	else	1493	else
1654	name = tmp->name, neg = 0;	1494	name = tmp->name, neg = 0;
1655		1495
1656	/* If we match name, then return the opposite of 'neg' */	1496	/* If we match name, then return the opposite of 'neg' */
1657	if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->name)))	1497	if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname)))
1658	return !neg;	1498	return !neg;
1659		1499
1660	/* Set success as true, since if the match was an inverse, it means	1500	/* Set success as true, since if the match was an inverse, it means
1661	* everything is allowed except what we match	1501	* everything is allowed except what we match
1662	*/	1502	*/
1663	else if (neg)	1503	else if (neg)
1664	success = 1;	1504	success = 1;
1665	}	1505	}
		1506
1666	return success;	1507	return success;
1667	}	1508	}
1668		1509
1669	/*	1510	/*
1670	* Fixes the given object, giving it the abilities and titles	1511	* Fixes the given object, giving it the abilities and titles
…		…
1721	return;	1562	return;
1722	}	1563	}
1723		1564
1724	for (i = 0; i < ARTIFACT_TRIES; i++)	1565	for (i = 0; i < ARTIFACT_TRIES; i++)
1725	{	1566	{
1726	int roll = RANDOM () % al->total_chance;	1567	int roll = rndm (al->total_chance);
1727		1568
1728	for (art = al->items; art != NULL; art = art->next)	1569	for (art = al->items; art; art = art->next)
1729	{	1570	{
1730	roll -= art->chance;	1571	roll -= art->chance;
1731	if (roll < 0)	1572	if (roll < 0)
1732	break;	1573	break;
1733	}	1574	}
…		…
1749	continue;	1590	continue;
1750		1591
1751	if (!legal_artifact_combination (op, art))	1592	if (!legal_artifact_combination (op, art))
1752	{	1593	{
1753	#ifdef TREASURE_VERBOSE	1594	#ifdef TREASURE_VERBOSE
1754	LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name);	1595	LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1755	#endif	1596	#endif
1756	continue;	1597	continue;
1757	}	1598	}
		1599
1758	give_artifact_abilities (op, art->item);	1600	give_artifact_abilities (op, art->item);
1759	return;	1601	return;
1760	}	1602	}
1761	}	1603	}
1762		1604
…		…
1806	SET_FLAG (item, FLAG_NO_STEAL);	1648	SET_FLAG (item, FLAG_NO_STEAL);
1807	}	1649	}
1808	}	1650	}
1809		1651
1810	/* special_potion() - so that old potion code is still done right. */	1652	/* special_potion() - so that old potion code is still done right. */
1811
1812	int	1653	int
1813	special_potion (object *op)	1654	special_potion (object *op)
1814	{	1655	{
1815
1816	int i;
1817
1818	if (op->attacktype)	1656	if (op->attacktype)
1819	return 1;	1657	return 1;
1820		1658
1821	if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha)	1659	if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha)
1822	return 1;	1660	return 1;
1823		1661
1824	for (i = 0; i < NROFATTACKS; i++)	1662	for (int i = 0; i < NROFATTACKS; i++)
1825	if (op->resist[i])	1663	if (op->resist[i])
1826	return 1;	1664	return 1;
1827		1665
1828	return 0;	1666	return 0;
1829	}	1667	}
1830		1668
1831	void	1669	void
1832	free_treasurestruct (treasure *t)	1670	free_treasurestruct (treasure *t)
1833	{	1671	{
1834	if (t->next)
1835	free_treasurestruct (t->next);	1672	if (t->next) free_treasurestruct (t->next);
1836	if (t->next_yes)
1837	free_treasurestruct (t->next_yes);	1673	if (t->next_yes) free_treasurestruct (t->next_yes);
1838	if (t->next_no)
1839	free_treasurestruct (t->next_no);	1674	if (t->next_no) free_treasurestruct (t->next_no);
1840		1675
1841	delete t;	1676	delete t;
1842	}	1677	}
1843		1678
1844	void	1679	void
…		…
1849		1684
1850	delete lc;	1685	delete lc;
1851	}	1686	}
1852		1687
1853	void	1688	void
1854	free_artifact (artifact * at)	1689	free_artifact (artifact *at)
1855	{	1690	{
1856	if (at->next)
1857	free_artifact (at->next);	1691	if (at->next) free_artifact (at->next);
1858
1859	if (at->allowed)
1860	free_charlinks (at->allowed);	1692	if (at->allowed) free_charlinks (at->allowed);
1861		1693
1862	at->item->destroy (1);	1694	at->item->destroy (1);
1863		1695
1864	delete at;	1696	sfree (at);
1865	}	1697	}
1866		1698
1867	void	1699	void
1868	free_artifactlist (artifactlist * al)	1700	free_artifactlist (artifactlist *al)
1869	{	1701	{
1870	artifactlist *nextal;	1702	artifactlist *nextal;
1871		1703
1872	for (al = first_artifactlist; al; al = nextal)	1704	for (al = first_artifactlist; al; al = nextal)
1873	{	1705	{
1874	nextal = al->next;	1706	nextal = al->next;
1875		1707
1876	if (al->items)	1708	if (al->items)
1877	free_artifact (al->items);	1709	free_artifact (al->items);
1878		1710
1879	free (al);	1711	sfree (al);
1880	}	1712	}
1881	}	1713	}
1882		1714
1883	void	1715	void
1884	free_all_treasures (void)	1716	free_all_treasures (void)
1885	{	1717	{
1886	treasurelist *tl, *next;	1718	treasurelist *tl, *next;
1887		1719
1888
1889	for (tl = first_treasurelist; tl != NULL; tl = next)	1720	for (tl = first_treasurelist; tl; tl = next)
1890	{	1721	{
		1722	clear (tl);
		1723
1891	next = tl->next;	1724	next = tl->next;
1892	if (tl->items)
1893	free_treasurestruct (tl->items);
1894	delete tl;	1725	delete tl;
1895	}	1726	}
		1727
1896	free_artifactlist (first_artifactlist);	1728	free_artifactlist (first_artifactlist);
1897	}	1729	}

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines