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.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->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	/*	195	/*
176	* Opens LIBDIR/treasure and reads all treasure-declarations from it.
177	* Each treasure is parsed with the help of load_treasure().	196	* Each treasure is parsed with the help of load_treasure().
178	*/	197	*/
179		198	treasurelist *
180	void	199	treasurelist::read (object_thawer &f)
181	load_treasures (void)
182	{	200	{
183	FILE *fp;	201	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		202
189	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	203	bool one = f.kw == KW_treasureone;
190	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	204	treasurelist *tl = treasurelist::get (f.get_str ());
191	{	205	clear (tl);
192	LOG (llevError, "Can't open treasure file.\n");	206	tl->items = read_treasure (f);
		207	if (!tl->items)
193	return;	208	return 0;
194	}
195	while (fgets (buf, MAX_BUF, fp) != NULL)
196	{
197	line++;
198	if (*buf == '#')
199	continue;
200		209
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.	210	/* 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	211	* Add up the chance total, and check to make sure the yes & no
215	* fields of the treasures are not being used.	212	* fields of the treasures are not being used.
216	*/	213	*/
217	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)
218	{	219	{
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);	220	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");	221	LOG (llevError, " the next_yes or next_no field is set\n");
226	}
227	#endif
228	tl->total_chance += t->chance;
229	}
230	}	222	}
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		223
237	#ifdef TREASURE_DEBUG	224	tl->total_chance += t->chance;
238	/* Perform some checks on how valid the treasure data actually is.	225	}
239	* verify that list transitions work (ie, the list that it is supposed	226	}
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		227
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;	228	return tl;
269	}	229	}
270
271		230
272	/*	231	/*
273	* Generates the objects specified by the given treasure.	232	* Generates the objects specified by the given treasure.
274	* It goes recursively through the rest of the linked list.	233	* It goes recursively through the rest of the linked list.
275	* 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,
…		…
281	* start with equipment, but only their abilities).	240	* start with equipment, but only their abilities).
282	*/	241	*/
283	static void	242	static void
284	put_treasure (object *op, object *creator, int flags)	243	put_treasure (object *op, object *creator, int flags)
285	{	244	{
286	object *tmp;	245	if (flags & GT_ENVIRONMENT)
287		246	{
288	/* 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
289	* 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
290	* 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
291	* by another object.	250	* by another object.
292	*/	251	*/
293	if (flags & GT_ENVIRONMENT && op->type != SPELL)	252	//TODO: flag such as objects... as such (no drop, anybody?)
294	{	253	if (op->type == SPELL)
		254	{
		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	{
295	SET_FLAG (op, FLAG_OBJ_ORIGINAL);	265	SET_FLAG (op, FLAG_OBJ_ORIGINAL);
296	op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);	266	op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);
		267	}
297	}	268	}
298	else	269	else
299	{	270	{
300	op = creator->insert (op);	271	op = creator->insert (op);
301		272
302	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))	273	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
303	monster_check_apply (creator, op);	274	monster_check_apply (creator, op);
304		275
305	if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ()))	276	if (flags & GT_UPDATE_INV)
		277	if (object *tmp = creator->in_player ())
306	esrv_send_item (tmp, op);	278	esrv_send_item (tmp, op);
307	}	279	}
308	}	280	}
309		281
310	/* 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
311	* in the generated object	283	* in the generated object
…		…
325		297
326	if (t->change_arch.slaying)	298	if (t->change_arch.slaying)
327	op->slaying = t->change_arch.slaying;	299	op->slaying = t->change_arch.slaying;
328	}	300	}
329		301
330	void	302	static void
331	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)
332	{	304	{
333	object *tmp;
334
335	if ((int) t->chance >= 100 || (RANDOM () % 100 + 1) < (int) t->chance)	305	if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance)
336	{	306	{
337	if (t->name)	307	if (t->name)
338	{	308	{
339	if (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)))
340	{	318	{
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);	319	object *tmp = arch_to_object (t->item);
		320
351	if (t->nrof && tmp->nrof <= 1)	321	if (t->nrof && tmp->nrof <= 1)
352	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	322	tmp->nrof = rndm (t->nrof) + 1;
		323
353	fix_generated_item (tmp, op, difficulty, t->magic, flag);	324	fix_generated_item (tmp, op, difficulty, t->magic, flag);
354	change_treasure (t, tmp);	325	change_treasure (t, tmp);
355	put_treasure (tmp, op, flag);	326	put_treasure (tmp, op, flag);
356	}	327	}
357	}	328	}
358		329
359	if (t->next_yes != NULL)	330	if (t->next_yes)
360	create_all_treasures (t->next_yes, op, flag, difficulty, tries);	331	create_all_treasures (t->next_yes, op, flag, difficulty, tries);
361	}	332	}
362	else if (t->next_no != NULL)	333	else if (t->next_no)
363	create_all_treasures (t->next_no, op, flag, difficulty, tries);	334	create_all_treasures (t->next_no, op, flag, difficulty, tries);
364		335
365	if (t->next != NULL)	336	if (t->next)
366	create_all_treasures (t->next, op, flag, difficulty, tries);	337	create_all_treasures (t->next, op, flag, difficulty, tries);
367	}	338	}
368		339
369	void	340	static void
370	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)
371	{	342	{
372	int value = RANDOM () % tl->total_chance;	343	int value = rndm (tl->total_chance);
373	treasure *t;	344	treasure *t;
374		345
375	if (tries++ > 100)	346	if (tries++ > 100)
376	{	347	{
377	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");
378	return;	349	return;
379	}	350	}
380		351
381	for (t = tl->items; t != NULL; t = t->next)	352	for (t = tl->items; t; t = t->next)
382	{	353	{
383	value -= t->chance;	354	value -= t->chance;
384		355
385	if (value < 0)	356	if (value < 0)
386	break;	357	break;
387	}	358	}
388		359
389	if (!t || value >= 0)	360	if (!t || value >= 0)
390	{
391	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);
392	abort ();
393	return;
394	}
395		362
396	if (t->name)	363	if (t->name)
397	{	364	{
398	if (difficulty >= t->magic)	365	if (difficulty >= t->magic)
399	{	366	{
400	treasurelist *tl = find_treasurelist (t->name);	367	treasurelist *tl = treasurelist::find (t->name);
401	if (tl)	368	if (tl)
402	create_treasure (tl, op, flag, difficulty, tries);	369	create_treasure (tl, op, flag, difficulty, tries);
403	}	370	}
404	else if (t->nrof)	371	else if (t->nrof)
405	create_one_treasure (tl, op, flag, difficulty, tries);	372	create_one_treasure (tl, op, flag, difficulty, tries);
406
407	return;
408	}	373	}
409
410	if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE))	374	else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE))
411	{	375	{
412	object *tmp = arch_to_object (t->item);	376	if (object *tmp = arch_to_object (t->item))
413		377	{
414	if (!tmp)
415	return;
416
417	if (t->nrof && tmp->nrof <= 1)	378	if (t->nrof && tmp->nrof <= 1)
418	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	379	tmp->nrof = rndm (t->nrof) + 1;
419		380
420	fix_generated_item (tmp, op, difficulty, t->magic, flag);	381	fix_generated_item (tmp, op, difficulty, t->magic, flag);
421	change_treasure (t, tmp);	382	change_treasure (t, tmp);
422	put_treasure (tmp, op, flag);	383	put_treasure (tmp, op, flag);
		384	}
423	}	385	}
		386	}
		387
		388	void
		389	object::create_treasure (treasurelist *tl, int flags)
		390	{
		391	::create_treasure (tl, this, flags, map ? map->difficulty : 0);
424	}	392	}
425		393
426	/* This calls the appropriate treasure creation function. tries is passed	394	/* This calls the appropriate treasure creation function. tries is passed
427	* to determine how many list transitions or attempts to create treasure	395	* 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	396	* have been made. It is really in place to prevent infinite loops with
…		…
431	* to do that.	399	* to do that.
432	*/	400	*/
433	void	401	void
434	create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)	402	create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
435	{	403	{
		404	// empty treasurelists are legal
		405	if (!tl->items)
		406	return;
436		407
437	if (tries++ > 100)	408	if (tries++ > 100)
438	{	409	{
439	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	410	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
440	return;	411	return;
441	}	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
442	if (tl->total_chance)	423	if (tl->total_chance)
443	create_one_treasure (tl, op, flag, difficulty, tries);	424	create_one_treasure (tl, op, flag, difficulty, tries);
444	else	425	else
445	create_all_treasures (tl->items, op, flag, difficulty, tries);	426	create_all_treasures (tl->items, op, flag, difficulty, tries);
446	}	427	}
…		…
453	object *	434	object *
454	generate_treasure (treasurelist *tl, int difficulty)	435	generate_treasure (treasurelist *tl, int difficulty)
455	{	436	{
456	difficulty = clamp (difficulty, 1, settings.max_level);	437	difficulty = clamp (difficulty, 1, settings.max_level);
457		438
458	object *ob = object::create (), *tmp;	439	object *ob = object::create ();
459		440
460	create_treasure (tl, ob, 0, difficulty, 0);	441	create_treasure (tl, ob, 0, difficulty, 0);
461		442
462	/* 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 */
463	tmp = ob->inv;	444	object *tmp = ob->inv;
464	if (tmp != NULL)	445	if (tmp)
465	tmp->remove ();	446	tmp->remove ();
466		447
467	if (ob->inv)	448	if (ob->inv)
468	LOG (llevError, "In generate treasure, created multiple objects.\n");	449	LOG (llevError, "In generate treasure, created multiple objects.\n");
469		450
…		…
477	* 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
478	* magical bonus "wanted".	459	* magical bonus "wanted".
479	*/	460	*/
480		461
481	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	462	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
482
483	/*chance of magic difficulty*/	463	// chance of magic difficulty
484
485	/* +0 +1 +2 +3 +4 */	464	// +0 +1 +2 +3 +4
486	{95, 2, 2, 1, 0}, /*1 */	465	{95, 2, 2, 1, 0}, // 1
487	{92, 5, 2, 1, 0}, /*2 */	466	{92, 5, 2, 1, 0}, // 2
488	{85, 10, 4, 1, 0}, /*3 */	467	{85, 10, 4, 1, 0}, // 3
489	{80, 14, 4, 2, 0}, /*4 */	468	{80, 14, 4, 2, 0}, // 4
490	{75, 17, 5, 2, 1}, /*5 */	469	{75, 17, 5, 2, 1}, // 5
491	{70, 18, 8, 3, 1}, /*6 */	470	{70, 18, 8, 3, 1}, // 6
492	{65, 21, 10, 3, 1}, /*7 */	471	{65, 21, 10, 3, 1}, // 7
493	{60, 22, 12, 4, 2}, /*8 */	472	{60, 22, 12, 4, 2}, // 8
494	{55, 25, 14, 4, 2}, /*9 */	473	{55, 25, 14, 4, 2}, // 9
495	{50, 27, 16, 5, 2}, /*10 */	474	{50, 27, 16, 5, 2}, // 10
496	{45, 28, 18, 6, 3}, /*11 */	475	{45, 28, 18, 6, 3}, // 11
497	{42, 28, 20, 7, 3}, /*12 */	476	{42, 28, 20, 7, 3}, // 12
498	{40, 27, 21, 8, 4}, /*13 */	477	{40, 27, 21, 8, 4}, // 13
499	{38, 25, 22, 10, 5}, /*14 */	478	{38, 25, 22, 10, 5}, // 14
500	{36, 23, 23, 12, 6}, /*15 */	479	{36, 23, 23, 12, 6}, // 15
501	{33, 21, 24, 14, 8}, /*16 */	480	{33, 21, 24, 14, 8}, // 16
502	{31, 19, 25, 16, 9}, /*17 */	481	{31, 19, 25, 16, 9}, // 17
503	{27, 15, 30, 18, 10}, /*18 */	482	{27, 15, 30, 18, 10}, // 18
504	{20, 12, 30, 25, 13}, /*19 */	483	{20, 12, 30, 25, 13}, // 19
505	{15, 10, 28, 30, 17}, /*20 */	484	{15, 10, 28, 30, 17}, // 20
506	{13, 9, 27, 28, 23}, /*21 */	485	{13, 9, 27, 28, 23}, // 21
507	{10, 8, 25, 28, 29}, /*22 */	486	{10, 8, 25, 28, 29}, // 22
508	{8, 7, 23, 26, 36}, /*23 */	487	{ 8, 7, 23, 26, 36}, // 23
509	{6, 6, 20, 22, 46}, /*24 */	488	{ 6, 6, 20, 22, 46}, // 24
510	{4, 5, 17, 18, 56}, /*25 */	489	{ 4, 5, 17, 18, 56}, // 25
511	{2, 4, 12, 14, 68}, /*26 */	490	{ 2, 4, 12, 14, 68}, // 26
512	{0, 3, 7, 10, 80}, /*27 */	491	{ 0, 3, 7, 10, 80}, // 27
513	{0, 0, 3, 7, 90}, /*28 */	492	{ 0, 0, 3, 7, 90}, // 28
514	{0, 0, 0, 3, 97}, /*29 */	493	{ 0, 0, 0, 3, 97}, // 29
515	{0, 0, 0, 0, 100}, /*30 */	494	{ 0, 0, 0, 0, 100}, // 30
516	{0, 0, 0, 0, 100}, /*31 */	495	{ 0, 0, 0, 0, 100}, // 31
517	};	496	};
518
519		497
520	/* calculate the appropriate level for wands staves and scrolls.	498	/* calculate the appropriate level for wands staves and scrolls.
521	* 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)
522	*	500	*
523	* elmex Wed Aug 9 17:44:59 CEST 2006:	501	* elmex Wed Aug 9 17:44:59 CEST 2006:
524	* 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.
525	*/	503	*/
526
527	int	504	int
528	level_for_item (const object *op, int difficulty)	505	level_for_item (const object *op, int difficulty)
529	{	506	{
530	int olevel = 0;
531
532	if (!op->inv)	507	if (!op->inv)
533	{	508	{
534	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);
535	return 0;	510	return 0;
536	}	511	}
537		512
538	olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2));	513	int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.));
539		514
540	if (olevel <= 0)	515	if (olevel <= 0)
541	olevel = rndm (1, MIN (op->inv->level, 1));	516	olevel = rndm (1, op->inv->level);
542		517
543	if (olevel > MAXLEVEL)	518	return min (olevel, MAXLEVEL);
544	olevel = MAXLEVEL;
545
546	return olevel;
547	}	519	}
548		520
549	/*	521	/*
550	* Based upon the specified difficulty and upon the difftomagic_list array,	522	* Based upon the specified difficulty and upon the difftomagic_list array,
551	* a random magical bonus is returned. This is used when determine	523	* a random magical bonus is returned. This is used when determine
…		…
554	* elmex Thu Aug 10 18:45:44 CEST 2006:	526	* elmex Thu Aug 10 18:45:44 CEST 2006:
555	* 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
556	* weird integer between 1-31.	528	* weird integer between 1-31.
557	*	529	*
558	*/	530	*/
559
560	int	531	int
561	magic_from_difficulty (int difficulty)	532	magic_from_difficulty (int difficulty)
562	{	533	{
563	int percent = 0, magic = 0;	534	int percent = 0, magic = 0;
564	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	535	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
…		…
569	scaled_diff = 0;	540	scaled_diff = 0;
570		541
571	if (scaled_diff >= DIFFLEVELS)	542	if (scaled_diff >= DIFFLEVELS)
572	scaled_diff = DIFFLEVELS - 1;	543	scaled_diff = DIFFLEVELS - 1;
573		544
574	percent = RANDOM () % 100;	545	percent = rndm (100);
575		546
576	for (magic = 0; magic < (MAXMAGIC + 1); magic++)	547	for (magic = 0; magic < (MAXMAGIC + 1); magic++)
577	{	548	{
578	percent -= difftomagic_list[scaled_diff][magic];	549	percent -= difftomagic_list[scaled_diff][magic];
579		550
…		…
585	{	556	{
586	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);
587	magic = 0;	558	magic = 0;
588	}	559	}
589		560
590	magic = (RANDOM () % 3) ? magic : -magic;	561	magic = (rndm (3)) ? magic : -magic;
591	/* 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); */
592		563
593	return magic;	564	return magic;
594	}	565	}
595		566
…		…
608		579
609	op->magic = magic;	580	op->magic = magic;
610	if (op->arch)	581	if (op->arch)
611	{	582	{
612	if (op->type == ARMOUR)	583	if (op->type == ARMOUR)
613	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	584	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
614		585
615	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 */
616	magic = (-magic);	587	magic = (-magic);
617	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	588	op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
618	}	589	}
619	else	590	else
620	{	591	{
621	if (op->type == ARMOUR)	592	if (op->type == ARMOUR)
622	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	593	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
623	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 */
624	magic = (-magic);	595	magic = (-magic);
625	op->weight = (op->weight * (100 - magic * 10)) / 100;	596	op->weight = (op->weight * (100 - magic * 10)) / 100;
626	}	597	}
627	}	598	}
628		599
…		…
652	* 1) Since rings can have multiple bonuses, if the same bonus	623	* 1) Since rings can have multiple bonuses, if the same bonus
653	* is rolled again, increase it - the bonuses now stack with	624	* is rolled again, increase it - the bonuses now stack with
654	* other bonuses previously rolled and ones the item might natively have.	625	* other bonuses previously rolled and ones the item might natively have.
655	* 2) Add code to deal with new PR method.	626	* 2) Add code to deal with new PR method.
656	*/	627	*/
657
658	void	628	void
659	set_ring_bonus (object *op, int bonus)	629	set_ring_bonus (object *op, int bonus)
660	{	630	{
661		631
662	int r = RANDOM () % (bonus > 0 ? 25 : 11);	632	int r = rndm (bonus > 0 ? 25 : 11);
663		633
664	if (op->type == AMULET)	634	if (op->type == AMULET)
665	{	635	{
666	if (!(RANDOM () % 21))	636	if (!(rndm (21)))
667	r = 20 + RANDOM () % 2;	637	r = 20 + rndm (2);
668	else	638	else
669	{	639	{
670	if (RANDOM () & 2)	640	if (rndm (2))
671	r = 10;	641	r = 10;
672	else	642	else
673	r = 11 + RANDOM () % 9;	643	r = 11 + rndm (9);
674	}	644	}
675	}	645	}
676		646
677	switch (r)	647	switch (r)
678	{	648	{
…		…
685	case 2:	655	case 2:
686	case 3:	656	case 3:
687	case 4:	657	case 4:
688	case 5:	658	case 5:
689	case 6:	659	case 6:
690	set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r)));	660	op->stats.stat (r) += bonus;
691	break;	661	break;
692		662
693	case 7:	663	case 7:
694	op->stats.dam += bonus;	664	op->stats.dam += bonus;
695	break;	665	break;
…		…
715	case 16:	685	case 16:
716	case 17:	686	case 17:
717	case 18:	687	case 18:
718	case 19:	688	case 19:
719	{	689	{
720	int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table;	690	int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
721		691
722	/* 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) */
723	val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b;	693	val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
724		694
725	/* 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
726	* positive values for how protections work out. Put another	696	* positive values for how protections work out. Put another
727	* 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
728	* even values.	698	* even values.
729	*/	699	*/
730	if (bonus < 0)	700	if (bonus < 0)
731	val = 2 * -val - RANDOM () % b;	701	val = 2 * -val - rndm (b);
732	if (val > 35)	702	if (val > 35)
733	val = 35; /* Upper limit */	703	val = 35; /* Upper limit */
734	b = 0;	704	b = 0;
		705
735	while (op->resist[resist_table[resist]] != 0 && b < 4)	706	while (op->resist[resist_table[resist]] != 0 && b < 4)
736	{
737	resist = RANDOM () % num_resist_table;	707	resist = rndm (num_resist_table);
738	}	708
739	if (b == 4)	709	if (b == 4)
740	return; /* Not able to find a free resistance */	710	return; /* Not able to find a free resistance */
		711
741	op->resist[resist_table[resist]] = val;	712	op->resist[resist_table[resist]] = val;
742	/* We should probably do something more clever here to adjust value	713	/* We should probably do something more clever here to adjust value
743	* based on how good a resistance we gave.	714	* based on how good a resistance we gave.
744	*/	715	*/
745	break;	716	break;
…		…
773	case 22:	744	case 22:
774	op->stats.exp += bonus; /* Speed! */	745	op->stats.exp += bonus; /* Speed! */
775	op->value = (op->value * 2) / 3;	746	op->value = (op->value * 2) / 3;
776	break;	747	break;
777	}	748	}
		749
778	if (bonus > 0)	750	if (bonus > 0)
779	op->value *= 2 * bonus;	751	op->value *= 2 * bonus;
780	else	752	else
781	op->value = -(op->value * 2 * bonus) / 3;	753	op->value = -(op->value * 2 * bonus) / 3;
782	}	754	}
…		…
787	* higher is the chance of returning a low number.	759	* higher is the chance of returning a low number.
788	* 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
789	* rings and amulets.	761	* rings and amulets.
790	* 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.
791	*/	763	*/
792
793	int	764	int
794	get_magic (int diff)	765	get_magic (int diff)
795	{	766	{
796	int i;	767	int i;
797		768
798	if (diff < 3)	769	if (diff < 3)
799	diff = 3;	770	diff = 3;
		771
800	for (i = 0; i < 4; i++)	772	for (i = 0; i < 4; i++)
801	if (RANDOM () % diff)	773	if (rndm (diff))
802	return i;	774	return i;
		775
803	return 4;	776	return 4;
804	}	777	}
805		778
806	#define DICE2 (get_magic(2)==2?2:1)	779	#define DICE2 (get_magic(2)==2?2:1)
807	#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))
808		781
809	/*	782	/*
810	* 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
811	* 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
812	* into scrolls/books/wands, makes it unidentified, hides the value, etc.	785	* into scrolls/books/wands, makes it unidentified, hides the value, etc.
…		…
826	* value.	799	* value.
827	* 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
828	* 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
829	* 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
830	*/	803	*/
831
832	void	804	void
833	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)
834	{	806	{
835	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;
836		808
…		…
841	save_item_power = op->item_power;	813	save_item_power = op->item_power;
842	op->item_power = 0;	814	op->item_power = 0;
843		815
844	if (op->randomitems && op->type != SPELL)	816	if (op->randomitems && op->type != SPELL)
845	{	817	{
846	create_treasure (op->randomitems, op, flags, difficulty, 0);	818	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 */	819	/* So the treasure doesn't get created again */
851	op->randomitems = NULL;	820	op->randomitems = 0;
852	}	821	}
853		822
854	if (difficulty < 1)	823	if (difficulty < 1)
855	difficulty = 1;	824	difficulty = 1;
856		825
…		…
860	ARG_INT (flags)))	829	ARG_INT (flags)))
861	return;	830	return;
862		831
863	if (!(flags & GT_MINIMAL))	832	if (!(flags & GT_MINIMAL))
864	{	833	{
865	if (op->arch == crown_arch)	834	if (IS_ARCH (op->arch, crown))
866	{	835	{
867	set_magic (difficulty, op, max_magic, flags);	836	set_magic (difficulty, op, max_magic, flags);
868	num_enchantments = calc_item_power (op, 1);	837	num_enchantments = calc_item_power (op, 1);
869	generate_artifact (op, difficulty);	838	generate_artifact (op, difficulty);
870	}	839	}
…		…
873	if (!op->magic && max_magic)	842	if (!op->magic && max_magic)
874	set_magic (difficulty, op, max_magic, flags);	843	set_magic (difficulty, op, max_magic, flags);
875		844
876	num_enchantments = calc_item_power (op, 1);	845	num_enchantments = calc_item_power (op, 1);
877		846
878	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))
879	* 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 */
880	generate_artifact (op, difficulty);	850	generate_artifact (op, difficulty);
881	}	851	}
882		852
883	/* Object was made an artifact. Calculate its item_power rating.	853	/* Object was made an artifact. Calculate its item_power rating.
884	* the item_power in the object is what the artfiact adds.	854	* the item_power in the object is what the artfiact adds.
…		…
926	{	896	{
927	if (op->type == POTION)	897	if (op->type == POTION)
928	/* Handle healing and magic power potions */	898	/* Handle healing and magic power potions */
929	if (op->stats.sp && !op->randomitems)	899	if (op->stats.sp && !op->randomitems)
930	{	900	{
931	object *tmp;
932
933	tmp = get_archetype (spell_mapping[op->stats.sp]);	901	object *tmp = get_archetype (spell_mapping [op->stats.sp]);
934	insert_ob_in_ob (tmp, op);	902	insert_ob_in_ob (tmp, op);
935	op->stats.sp = 0;	903	op->stats.sp = 0;
936	}	904	}
937	}	905	}
938	else if (!op->title) /* Only modify object if not special */	906	else if (!op->title) /* Only modify object if not special */
…		…
941	case WEAPON:	909	case WEAPON:
942	case ARMOUR:	910	case ARMOUR:
943	case SHIELD:	911	case SHIELD:
944	case HELMET:	912	case HELMET:
945	case CLOAK:	913	case CLOAK:
946	if (QUERY_FLAG (op, FLAG_CURSED) && !(RANDOM () % 4))	914	if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
947	set_ring_bonus (op, -DICE2);	915	set_ring_bonus (op, -DICE2);
948	break;	916	break;
949		917
950	case BRACERS:	918	case BRACERS:
951	if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)))	919	if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
952	{	920	{
953	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	921	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
954	if (!QUERY_FLAG (op, FLAG_CURSED))	922	if (!QUERY_FLAG (op, FLAG_CURSED))
955	op->value *= 3;	923	op->value *= 3;
956	}	924	}
…		…
982	*/	950	*/
983	if (op->inv && op->randomitems)	951	if (op->inv && op->randomitems)
984	{	952	{
985	/* value multiplier is same as for scrolls */	953	/* value multiplier is same as for scrolls */
986	op->value = (op->value * op->inv->value);	954	op->value = (op->value * op->inv->value);
987	op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty;	955	op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
988	}	956	}
989	else	957	else
990	{	958	{
991	op->name = "potion";	959	op->name = "potion";
992	op->name_pl = "potions";	960	op->name_pl = "potions";
993	}	961	}
994		962
995	if (!(flags & GT_ONLY_GOOD) && RANDOM () % 2)	963	if (!(flags & GT_ONLY_GOOD) && rndm (2))
996	SET_FLAG (op, FLAG_CURSED);	964	SET_FLAG (op, FLAG_CURSED);
997	break;	965	break;
998	}	966	}
999		967
1000	case AMULET:	968	case AMULET:
1001	if (op->arch == amulet_arch)	969	if (IS_ARCH (op->arch, amulet))
1002	op->value *= 5; /* Since it's not just decoration */	970	op->value *= 5; /* Since it's not just decoration */
1003		971
1004	case RING:	972	case RING:
1005	if (op->arch == NULL)	973	if (!op->arch) // wtf? schmorp
1006	{	974	{
1007	op->destroy ();	975	op->destroy ();
1008	op = 0;	976	op = 0;
1009	break;	977	break;
1010	}	978	}
1011		979
1012	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! */
1013	break;	981	break;
1014		982
1015	if (!(flags & GT_ONLY_GOOD) && !(RANDOM () % 3))	983	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1016	SET_FLAG (op, FLAG_CURSED);	984	SET_FLAG (op, FLAG_CURSED);
1017		985
1018	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	986	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
1019		987
1020	if (op->type != RING) /* Amulets have only one ability */	988	if (op->type != RING) /* Amulets have only one ability */
1021	break;	989	break;
1022		990
1023	if (!(RANDOM () % 4))	991	if (!(rndm (4)))
1024	{	992	{
1025	int d = (RANDOM () % 2 || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	993	int d = (rndm (2) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1026		994
1027	if (d > 0)	995	if (d > 0)
1028	op->value *= 3;	996	op->value *= 3;
1029		997
1030	set_ring_bonus (op, d);	998	set_ring_bonus (op, d);
1031		999
1032	if (!(RANDOM () % 4))	1000	if (!(rndm (4)))
1033	{	1001	{
1034	int d = (RANDOM () % 3 || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	1002	int d = (rndm (3) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1035		1003
1036	if (d > 0)	1004	if (d > 0)
1037	op->value *= 5;	1005	op->value *= 5;
1038	set_ring_bonus (op, d);	1006	set_ring_bonus (op, d);
1039	}	1007	}
1040	}	1008	}
1041		1009
1042	if (GET_ANIM_ID (op))	1010	if (GET_ANIM_ID (op))
1043	SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op)));	1011	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1044		1012
1045	break;	1013	break;
1046		1014
1047	case BOOK:	1015	case BOOK:
1048	/* Is it an empty book?, if yes lets make a special·	1016	/* Is it an empty book?, if yes lets make a special·
1049	* msg for it, and tailor its properties based on the·	1017	* msg for it, and tailor its properties based on the·
1050	* creator and/or map level we found it on.	1018	* creator and/or map level we found it on.
1051	*/	1019	*/
1052	if (!op->msg && RANDOM () % 10)	1020	if (!op->msg && rndm (10))
1053	{	1021	{
1054	/* set the book level properly */	1022	/* set the book level properly */
1055	if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE))	1023	if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE))
1056	{	1024	{
1057	if (op->map && op->map->difficulty)	1025	if (op->map && op->map->difficulty)
1058	op->level = RANDOM () % (op->map->difficulty) + RANDOM () % 10 + 1;	1026	op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1059	else	1027	else
1060	op->level = RANDOM () % 20 + 1;	1028	op->level = rndm (20) + 1;
1061	}	1029	}
1062	else	1030	else
1063	op->level = RANDOM () % creator->level;	1031	op->level = rndm (creator->level);
1064		1032
1065	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);
1066	/* books w/ info are worth more! */	1034	/* books w/ info are worth more! */
1067	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));
1068	/* creator related stuff */	1036	/* creator related stuff */
…		…
1167	*/	1135	*/
1168		1136
1169	/*	1137	/*
1170	* Allocate and return the pointer to an empty artifactlist structure.	1138	* Allocate and return the pointer to an empty artifactlist structure.
1171	*/	1139	*/
1172
1173	static artifactlist *	1140	static artifactlist *
1174	get_empty_artifactlist (void)	1141	get_empty_artifactlist (void)
1175	{	1142	{
1176	artifactlist *al = (artifactlist *) malloc (sizeof (artifactlist));	1143	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	}	1144	}
1185		1145
1186	/*	1146	/*
1187	* Allocate and return the pointer to an empty artifact structure.	1147	* Allocate and return the pointer to an empty artifact structure.
1188	*/	1148	*/
1189
1190	static artifact *	1149	static artifact *
1191	get_empty_artifact (void)	1150	get_empty_artifact (void)
1192	{	1151	{
1193	artifact *a = (artifact *) malloc (sizeof (artifact));	1152	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	}	1153	}
1204		1154
1205	/*	1155	/*
1206	* 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
1207	* of objects on it.	1157	* of objects on it.
1208	*/	1158	*/
1209
1210	artifactlist *	1159	artifactlist *
1211	find_artifactlist (int type)	1160	find_artifactlist (int type)
1212	{	1161	{
1213	artifactlist *al;
1214
1215	for (al = first_artifactlist; al != NULL; al = al->next)	1162	for (artifactlist *al = first_artifactlist; al; al = al->next)
1216	if (al->type == type)	1163	if (al->type == type)
1217	return al;	1164	return al;
1218	return NULL;
1219	}
1220		1165
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;	1166	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	}	1167	}
1333		1168
1334	/*	1169	/*
1335	* 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.
1336	*/	1171	*/
1337
1338	void	1172	void
1339	init_artifacts (void)	1173	init_artifacts (void)
1340	{	1174	{
1341	static int has_been_inited = 0;	1175	static int has_been_inited = 0;
1342	char filename[MAX_BUF], buf[HUGE_BUF], *cp, *next;	1176	char filename[MAX_BUF];
1343	artifact *art = NULL;	1177	artifact *art = NULL;
1344	linked_char *tmp;
1345	int value;
1346	artifactlist *al;	1178	artifactlist *al;
1347		1179
1348	if (has_been_inited)	1180	if (has_been_inited)
1349	return;	1181	return;
1350	else	1182	else
1351	has_been_inited = 1;	1183	has_been_inited = 1;
1352		1184
1353	sprintf (filename, "%s/artifacts", settings.datadir);	1185	sprintf (filename, "%s/artifacts", settings.datadir);
1354	object_thawer thawer (filename);	1186	object_thawer f (filename);
1355		1187
1356	if (!thawer)	1188	if (!f)
1357	return;	1189	return;
1358		1190
1359	while (fgets (buf, HUGE_BUF, thawer) != NULL)	1191	for (;;)
1360	{	1192	{
1361	if (*buf == '#')	1193	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	{	1194	{
		1195	case KW_allowed:
1373	if (art == NULL)	1196	if (!art)
		1197	art = get_empty_artifact ();
		1198
1374	{	1199	{
1375	art = get_empty_artifact ();	1200	if (!strcmp (f.get_str (), "all"))
1376	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));
1377	}	1217	}
1378	cp = strchr (cp, ' ') + 1;	1218	break;
1379	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	}
1380	continue;	1251	continue;
1381		1252
1382	do	1253	case KW_EOF:
		1254	goto done;
		1255
		1256	default:
		1257	if (!f.parse_error ("artifacts file"))
		1258	cleanup ("artifacts file required");
1383	{	1259	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	{	1260	}
1401	art->item = object::create ();
1402		1261
1403	if (!load_object (thawer, art->item, 0))	1262	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	}	1263	}
1422		1264
		1265	done:
1423	for (al = first_artifactlist; al != NULL; al = al->next)	1266	for (al = first_artifactlist; al; al = al->next)
1424	{	1267	{
		1268	al->total_chance = 0;
		1269
1425	for (art = al->items; art != NULL; art = art->next)	1270	for (art = al->items; art; art = art->next)
1426	{	1271	{
1427	if (!art->chance)	1272	if (!art->chance)
1428	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);
1429	else	1274	else
1430	al->total_chance += art->chance;	1275	al->total_chance += art->chance;
…		…
1435	}	1280	}
1436		1281
1437	LOG (llevDebug, "done.\n");	1282	LOG (llevDebug, "done.\n");
1438	}	1283	}
1439		1284
1440
1441	/*	1285	/*
1442	* Used in artifact generation. The bonuses of the first object	1286	* Used in artifact generation. The bonuses of the first object
1443	* is modified by the bonuses of the second object.	1287	* is modified by the bonuses of the second object.
1444	*/	1288	*/
1445
1446	void	1289	void
1447	add_abilities (object *op, object *change)	1290	add_abilities (object *op, object *change)
1448	{	1291	{
1449	int i, tmp;	1292	int i, tmp;
1450		1293
1451	if (change->face != blank_face)	1294	if (change->face != blank_face)
1452	{	1295	{
1453	#ifdef TREASURE_VERBOSE	1296	#ifdef TREASURE_VERBOSE
1454	LOG (llevDebug, "FACE: %d\n", change->face->number);	1297	LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1455	#endif	1298	#endif
1456	op->face = change->face;	1299	op->face = change->face;
1457	}	1300	}
1458		1301
1459	for (i = 0; i < NUM_STATS; i++)	1302	for (i = 0; i < NUM_STATS; i++)
1460	change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i));	1303	change_attr_value (&(op->stats), i, change->stats.stat (i));
1461		1304
1462	op->attacktype |= change->attacktype;	1305	op->attacktype |= change->attacktype;
1463	op->path_attuned |= change->path_attuned;	1306	op->path_attuned |= change->path_attuned;
1464	op->path_repelled |= change->path_repelled;	1307	op->path_repelled |= change->path_repelled;
1465	op->path_denied |= change->path_denied;	1308	op->path_denied |= change->path_denied;
…		…
1499		1342
1500	op->set_speed (op->speed);	1343	op->set_speed (op->speed);
1501	}	1344	}
1502		1345
1503	if (change->nrof)	1346	if (change->nrof)
1504	op->nrof = RANDOM () % ((int) change->nrof) + 1;	1347	op->nrof = rndm (change->nrof) + 1;
1505		1348
1506	op->stats.exp += change->stats.exp; /* Speed modifier */	1349	op->stats.exp += change->stats.exp; /* Speed modifier */
1507	op->stats.wc += change->stats.wc;	1350	op->stats.wc += change->stats.wc;
1508	op->stats.ac += change->stats.ac;	1351	op->stats.ac += change->stats.ac;
1509		1352
…		…
1612	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);
1613	}	1456	}
1614		1457
1615	op->value *= change->value;	1458	op->value *= change->value;
1616		1459
1617	if (change->material)	1460	if (change->materials)
1618	op->material = change->material;	1461	op->materials = change->materials;
1619		1462
1620	if (change->materialname)	1463	if (change->materialname)
1621	op->materialname = change->materialname;	1464	op->materialname = change->materialname;
1622		1465
1623	if (change->slaying)	1466	if (change->slaying)
…		…
1629	if (change->msg)	1472	if (change->msg)
1630	op->msg = change->msg;	1473	op->msg = change->msg;
1631	}	1474	}
1632		1475
1633	static int	1476	static int
1634	legal_artifact_combination (object *op, artifact * art)	1477	legal_artifact_combination (object *op, artifact *art)
1635	{	1478	{
1636	int neg, success = 0;	1479	int neg, success = 0;
1637	linked_char *tmp;	1480	linked_char *tmp;
1638	const char *name;	1481	const char *name;
1639		1482
1640	if (art->allowed == (linked_char *) NULL)	1483	if (!art->allowed)
1641	return 1; /* Ie, "all" */	1484	return 1; /* Ie, "all" */
		1485
1642	for (tmp = art->allowed; tmp; tmp = tmp->next)	1486	for (tmp = art->allowed; tmp; tmp = tmp->next)
1643	{	1487	{
1644	#ifdef TREASURE_VERBOSE	1488	#ifdef TREASURE_VERBOSE
1645	LOG (llevDebug, "legal_art: %s\n", tmp->name);	1489	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1646	#endif	1490	#endif
1647	if (*tmp->name == '!')	1491	if (*tmp->name == '!')
1648	name = tmp->name + 1, neg = 1;	1492	name = tmp->name + 1, neg = 1;
1649	else	1493	else
1650	name = tmp->name, neg = 0;	1494	name = tmp->name, neg = 0;
1651		1495
1652	/* If we match name, then return the opposite of 'neg' */	1496	/* If we match name, then return the opposite of 'neg' */
1653	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)))
1654	return !neg;	1498	return !neg;
1655		1499
1656	/* 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
1657	* everything is allowed except what we match	1501	* everything is allowed except what we match
1658	*/	1502	*/
1659	else if (neg)	1503	else if (neg)
1660	success = 1;	1504	success = 1;
1661	}	1505	}
		1506
1662	return success;	1507	return success;
1663	}	1508	}
1664		1509
1665	/*	1510	/*
1666	* Fixes the given object, giving it the abilities and titles	1511	* Fixes the given object, giving it the abilities and titles
…		…
1717	return;	1562	return;
1718	}	1563	}
1719		1564
1720	for (i = 0; i < ARTIFACT_TRIES; i++)	1565	for (i = 0; i < ARTIFACT_TRIES; i++)
1721	{	1566	{
1722	int roll = RANDOM () % al->total_chance;	1567	int roll = rndm (al->total_chance);
1723		1568
1724	for (art = al->items; art != NULL; art = art->next)	1569	for (art = al->items; art; art = art->next)
1725	{	1570	{
1726	roll -= art->chance;	1571	roll -= art->chance;
1727	if (roll < 0)	1572	if (roll < 0)
1728	break;	1573	break;
1729	}	1574	}
…		…
1745	continue;	1590	continue;
1746		1591
1747	if (!legal_artifact_combination (op, art))	1592	if (!legal_artifact_combination (op, art))
1748	{	1593	{
1749	#ifdef TREASURE_VERBOSE	1594	#ifdef TREASURE_VERBOSE
1750	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);
1751	#endif	1596	#endif
1752	continue;	1597	continue;
1753	}	1598	}
		1599
1754	give_artifact_abilities (op, art->item);	1600	give_artifact_abilities (op, art->item);
1755	return;	1601	return;
1756	}	1602	}
1757	}	1603	}
1758		1604
…		…
1802	SET_FLAG (item, FLAG_NO_STEAL);	1648	SET_FLAG (item, FLAG_NO_STEAL);
1803	}	1649	}
1804	}	1650	}
1805		1651
1806	/* special_potion() - so that old potion code is still done right. */	1652	/* special_potion() - so that old potion code is still done right. */
1807
1808	int	1653	int
1809	special_potion (object *op)	1654	special_potion (object *op)
1810	{	1655	{
1811	if (op->attacktype)	1656	if (op->attacktype)
1812	return 1;	1657	return 1;
…		…
1822	}	1667	}
1823		1668
1824	void	1669	void
1825	free_treasurestruct (treasure *t)	1670	free_treasurestruct (treasure *t)
1826	{	1671	{
1827	if (t->next)
1828	free_treasurestruct (t->next);	1672	if (t->next) free_treasurestruct (t->next);
1829	if (t->next_yes)
1830	free_treasurestruct (t->next_yes);	1673	if (t->next_yes) free_treasurestruct (t->next_yes);
1831	if (t->next_no)
1832	free_treasurestruct (t->next_no);	1674	if (t->next_no) free_treasurestruct (t->next_no);
1833		1675
1834	delete t;	1676	delete t;
1835	}	1677	}
1836		1678
1837	void	1679	void
…		…
1842		1684
1843	delete lc;	1685	delete lc;
1844	}	1686	}
1845		1687
1846	void	1688	void
1847	free_artifact (artifact * at)	1689	free_artifact (artifact *at)
1848	{	1690	{
1849	if (at->next)
1850	free_artifact (at->next);	1691	if (at->next) free_artifact (at->next);
1851
1852	if (at->allowed)
1853	free_charlinks (at->allowed);	1692	if (at->allowed) free_charlinks (at->allowed);
1854		1693
1855	at->item->destroy (1);	1694	at->item->destroy (1);
1856		1695
1857	delete at;	1696	sfree (at);
1858	}	1697	}
1859		1698
1860	void	1699	void
1861	free_artifactlist (artifactlist * al)	1700	free_artifactlist (artifactlist *al)
1862	{	1701	{
1863	artifactlist *nextal;	1702	artifactlist *nextal;
1864		1703
1865	for (al = first_artifactlist; al; al = nextal)	1704	for (al = first_artifactlist; al; al = nextal)
1866	{	1705	{
1867	nextal = al->next;	1706	nextal = al->next;
1868		1707
1869	if (al->items)	1708	if (al->items)
1870	free_artifact (al->items);	1709	free_artifact (al->items);
1871		1710
1872	free (al);	1711	sfree (al);
1873	}	1712	}
1874	}	1713	}
1875		1714
1876	void	1715	void
1877	free_all_treasures (void)	1716	free_all_treasures (void)
1878	{	1717	{
1879	treasurelist *tl, *next;	1718	treasurelist *tl, *next;
1880		1719
1881
1882	for (tl = first_treasurelist; tl != NULL; tl = next)	1720	for (tl = first_treasurelist; tl; tl = next)
1883	{	1721	{
		1722	clear (tl);
		1723
1884	next = tl->next;	1724	next = tl->next;
1885	if (tl->items)
1886	free_treasurestruct (tl->items);
1887	delete tl;	1725	delete tl;
1888	}	1726	}
		1727
1889	free_artifactlist (first_artifactlist);	1728	free_artifactlist (first_artifactlist);
1890	}	1729	}

Diff Legend

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