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

Diff Legend

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