[ViewVC] Diff of: cvs/deliantra/server/common/treasure.C

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.28 by root, Tue Dec 26 08:54:59 2006 UTC vs.
Revision 1.43 by root, Mon Apr 16 11:09:30 2007 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game for X-windows
3		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* This program 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 2 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, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20		21	*
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	23	*/
23
24	#define ALLOWED_COMBINATION
25		24
26	/* TREASURE_DEBUG does some checking on the treasurelists after loading.	25	/* TREASURE_DEBUG does some checking on the treasurelists after loading.
27	* It is useful for finding bugs in the treasures file. Since it only	26	* 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	27	* slows the startup some (and not actual game play), it is by default
29	* left on	28	* left on
30	*/	29	*/
31	#define TREASURE_DEBUG	30	#define TREASURE_DEBUG
32		31
33	/* TREASURE_VERBOSE enables copious output concerning artifact generation */	32	/* TREASURE_VERBOSE enables copious output concerning artifact generation */
34		33
35	/* #define TREASURE_VERBOSE */	34	//#define TREASURE_VERBOSE
36		35
37	#include <global.h>	36	#include <global.h>
38	#include <treasure.h>	37	#include <treasure.h>
39	#include <funcpoint.h>	38	#include <funcpoint.h>
40	#include <loader.h>	39	#include <loader.h>
41		40
		41	extern char *spell_mapping[];
		42
		43	static treasurelist *first_treasurelist;
42		44
43	static void change_treasure (treasure t, object op); /* overrule default values */	45	static void change_treasure (treasure t, object op); /* overrule default values */
44	extern char *spell_mapping[];	46
		47	typedef std::tr1::unordered_map<
		48	const char *,
		49	treasurelist *,
		50	str_hash,
		51	str_equal,
		52	slice_allocator< std::pair<const char const, treasurelist > >,
		53	true
		54	> tl_map_t;
		55
		56	static tl_map_t tl_map;
45		57
46	/*	58	/*
47	* Initialize global archtype pointers:	59	* Initialize global archtype pointers:
48	*/	60	*/
49
50	void	61	void
51	init_archetype_pointers ()	62	init_archetype_pointers ()
52	{	63	{
53	int prev_warn = warn_archetypes;	64	int prev_warn = warn_archetypes;
54		65
55	warn_archetypes = 1;	66	warn_archetypes = 1;
		67
56	if (ring_arch == NULL)	68	if (ring_arch == NULL)
57	ring_arch = archetype::find ("ring");	69	ring_arch = archetype::find ("ring");
58	if (amulet_arch == NULL)	70	if (amulet_arch == NULL)
59	amulet_arch = archetype::find ("amulet");	71	amulet_arch = archetype::find ("amulet");
60	if (staff_arch == NULL)	72	if (staff_arch == NULL)
61	staff_arch = archetype::find ("staff");	73	staff_arch = archetype::find ("staff");
62	if (crown_arch == NULL)	74	if (crown_arch == NULL)
63	crown_arch = archetype::find ("crown");	75	crown_arch = archetype::find ("crown");
		76
64	warn_archetypes = prev_warn;	77	warn_archetypes = prev_warn;
65	}	78	}
66		79
67	/*	80	/*
68	* Allocate and return the pointer to an empty treasurelist structure.	81	* Searches for the given treasurelist in the globally linked list
		82	* of treasurelists which has been built by load_treasures().
69	*/	83	*/
70
71	static treasurelist *	84	treasurelist *
72	get_empty_treasurelist (void)	85	treasurelist::find (const char *name)
73	{	86	{
		87	if (!name)
		88	return 0;
		89
		90	AUTODECL (i, tl_map.find (name));
		91
		92	if (i == tl_map.end ())
		93	return 0;
		94
		95	return i->second;
		96	}
		97
		98	/*
		99	* Searches for the given treasurelist in the globally linked list
		100	* of treasurelists which has been built by load_treasures().
		101	*/
		102	treasurelist *
		103	treasurelist::get (const char *name)
		104	{
		105	treasurelist *tl = find (name);
		106
		107	if (!tl)
		108	{
74	return new treasurelist;	109	tl = new treasurelist;
75	}
76		110
77	/*	111	tl->name = name;
78	* Allocate and return the pointer to an empty treasure structure.	112	tl->next = first_treasurelist;
79	*/	113	first_treasurelist = tl;
80	//TODO: make this a constructor
81	static treasure *
82	get_empty_treasure (void)
83	{
84	treasure *t = new treasure;
85		114
86	t->chance = 100;	115	tl_map.insert (std::make_pair (tl->name, tl));
		116	}
87		117
88	return t;	118	return tl;
		119	}
		120
		121	//TODO: class method
		122	void
		123	clear (treasurelist *tl)
		124	{
		125	if (tl->items)
		126	{
		127	free_treasurestruct (tl->items);
		128	tl->items = 0;
		129	}
89	}	130	}
90		131
91	/*	132	/*
92	* Reads the lib/treasure file from disk, and parses the contents	133	* Reads the lib/treasure file from disk, and parses the contents
93	* into an internal treasure structure (very linked lists)	134	* into an internal treasure structure (very linked lists)
94	*/	135	*/
95
96	static treasure *	136	static treasure *
97	load_treasure (FILE * fp, int *line)	137	load_treasure (object_thawer &f)
98	{	138	{
99	char buf[MAX_BUF], *cp, variable[MAX_BUF];
100	treasure *t = get_empty_treasure ();	139	treasure *t = new treasure;
101	int value;	140	int value;
102		141
103	nroftreasures++;	142	nroftreasures++;
104	while (fgets (buf, MAX_BUF, fp) != NULL)
105	{
106	(*line)++;
107		143
108	if (*buf == '#')	144	for (;;)
109	continue;	145	{
110	if ((cp = strchr (buf, '\n')) != NULL)	146	coroapi::cede_every (10);
111	*cp = '\0';
112	cp = buf;
113	while (isspace (cp)) / Skip blanks */
114	cp++;
115		147
116	if (sscanf (cp, "arch %s", variable))	148	f.next ();
117	{	149
118	if ((t->item = archetype::find (variable)) == NULL)	150	switch (f.kw)
119	LOG (llevError, "Treasure lacks archetype: %s\n", variable);
120	}	151	{
121	else if (sscanf (cp, "list %s", variable))	152	case KW_arch:
122	t->name = variable;	153	if (!(t->item = archetype::find (f.get_str ())))
123	else if (sscanf (cp, "change_name %s", variable))	154	LOG (llevError, "%s:%d treasure references unknown archetype '%s', skipping.\n", f.name, f.linenum, f.get_str ());
124	t->change_arch.name = variable;	155	break;
125	else if (sscanf (cp, "change_title %s", variable))	156
126	t->change_arch.title = variable;	157	case KW_list: f.get (t->name); break;
127	else if (sscanf (cp, "change_slaying %s", variable))	158	case KW_change_name: f.get (t->change_arch.name); break;
128	t->change_arch.slaying = variable;	159	case KW_change_title: f.get (t->change_arch.title); break;
129	else if (sscanf (cp, "chance %d", &value))	160	case KW_change_slaying: f.get (t->change_arch.slaying); break;
130	t->chance = (uint8) value;	161	case KW_chance: f.get (t->chance); break;
131	else if (sscanf (cp, "nrof %d", &value))	162	case KW_nrof: f.get (t->nrof); break;
132	t->nrof = (uint16) value;	163	case KW_magic: f.get (t->magic); break;
133	else if (sscanf (cp, "magic %d", &value))	164
134	t->magic = (uint8) value;	165	case KW_yes: t->next_yes = load_treasure (f); break;
135	else if (!strcmp (cp, "yes"))	166	case KW_no: t->next_no = load_treasure (f); break;
136	t->next_yes = load_treasure (fp, line);	167
137	else if (!strcmp (cp, "no"))	168	case KW_end:
138	t->next_no = load_treasure (fp, line);
139	else if (!strcmp (cp, "end"))
140	return t;
141	else if (!strcmp (cp, "more"))
142	{
143	t->next = load_treasure (fp, line);
144	return t;	169	return t;
		170
		171	case KW_more:
		172	t->next = load_treasure (f);
		173	return t;
		174
		175	default:
		176	if (!f.parse_error ("treasure list"))
		177	return t; // error
		178
		179	return t;
145	}	180	}
146	else
147	LOG (llevError, "Unknown treasure-command: '%s', last entry %s, line %d\n", cp, &t->name, *line);
148	}	181	}
149	LOG (llevError, "treasure lacks 'end'.\n");
150	return t;
151	}	182	}
152		183
153	#ifdef TREASURE_DEBUG	184	#ifdef TREASURE_DEBUG
154
155	/* recursived checks the linked list. Treasurelist is passed only	185	/* recursived checks the linked list. Treasurelist is passed only
156	* so that the treasure name can be printed out	186	* so that the treasure name can be printed out
157	*/	187	*/
158	static void	188	static void
159	check_treasurelist (const treasure t, const treasurelist tl)	189	check_treasurelist (const treasure t, const treasurelist tl)
160	{	190	{
161	if (t->item == NULL && t->name == NULL)
162	LOG (llevError, "Treasurelist %s has element with no name or archetype\n", &tl->name);
163	if (t->chance >= 100 && t->next_yes && (t->next \|\| t->next_no))	191	if (t->chance >= 100 && t->next_yes && (t->next \|\| t->next_no))
164	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);	192	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
165	/* find_treasurelist will print out its own error message */	193
166	if (t->name && *t->name)
167	(void) find_treasurelist (t->name);
168	if (t->next)	194	if (t->next)
169	check_treasurelist (t->next, tl);	195	check_treasurelist (t->next, tl);
		196
170	if (t->next_yes)	197	if (t->next_yes)
171	check_treasurelist (t->next_yes, tl);	198	check_treasurelist (t->next_yes, tl);
		199
172	if (t->next_no)	200	if (t->next_no)
173	check_treasurelist (t->next_no, tl);	201	check_treasurelist (t->next_no, tl);
174	}	202	}
175	#endif	203	#endif
176		204
177	/*	205	/*
178	* Opens LIBDIR/treasure and reads all treasure-declarations from it.	206	* Opens LIBDIR/treasure and reads all treasure-declarations from it.
179	* Each treasure is parsed with the help of load_treasure().	207	* Each treasure is parsed with the help of load_treasure().
180	*/	208	*/
181		209	bool
182	void	210	load_treasure_file (const char *filename)
183	load_treasures (void)
184	{	211	{
185	FILE *fp;
186	char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];
187	treasurelist *previous = NULL;
188	treasure *t;	212	treasure *t;
189	int comp, line = 0;	213	int comp, line = 0;
190		214
191	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	215	object_thawer f (filename);
192	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	216
		217	if (!f)
193	{	218	{
194	LOG (llevError, "Can't open treasure file.\n");	219	LOG (llevError, "Can't open treasure file.\n");
195	return;	220	return false;
196	}
197	while (fgets (buf, MAX_BUF, fp) != NULL)
198	{	221	}
199	line++;
200	if (*buf == '#')
201	continue;
202		222
203	if (sscanf (buf, "treasureone %s\n", name) \|\| sscanf (buf, "treasure %s\n", name))	223	f.next ();
204	{
205	treasurelist *tl = get_empty_treasurelist ();
206		224
207	tl->name = name;	225	for (;;)
208	if (previous == NULL)	226	{
209	first_treasurelist = tl;	227	switch (f.kw)
210	else	228	{
211	previous->next = tl;	229	case KW_treasure:
212	previous = tl;	230	case KW_treasureone:
213	tl->items = load_treasure (fp, &line);
214
215	/* This is a one of the many items on the list should be generated.
216	* Add up the chance total, and check to make sure the yes & no
217	* fields of the treasures are not being used.
218	*/
219	if (!strncmp (buf, "treasureone", 11))
220	{	231	{
221	for (t = tl->items; t != NULL; t = t->next)	232	bool one = f.kw == KW_treasureone;
		233	treasurelist *tl = treasurelist::get (f.get_str ());
		234
		235	clear (tl);
		236	tl->items = load_treasure (f);
		237
		238	if (!tl->items)
		239	return false;
		240
		241	/* This is a one of the many items on the list should be generated.
		242	* Add up the chance total, and check to make sure the yes & no
		243	* fields of the treasures are not being used.
		244	*/
		245	if (one)
222	{	246	{
		247	for (t = tl->items; t; t = t->next)
		248	{
223	#ifdef TREASURE_DEBUG	249	#ifdef TREASURE_DEBUG
224	if (t->next_yes \|\| t->next_no)	250	if (t->next_yes \|\| t->next_no)
225	{	251	{
226	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);	252	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);
227	LOG (llevError, " the next_yes or next_no field is set\n");	253	LOG (llevError, " the next_yes or next_no field is set\n");
		254	}
		255	#endif
		256	tl->total_chance += t->chance;
228	}	257	}
229	#endif
230	tl->total_chance += t->chance;
231	}	258	}
232	}	259	}
233	}	260	break;
234	else
235	LOG (llevError, "Treasure-list %s didn't understand: %s, line %d\n", filename, buf, line);
236	}
237	close_and_delete (fp, comp);
238		261
		262	case KW_EOF:
239	#ifdef TREASURE_DEBUG	263	#ifdef TREASURE_DEBUG
240	/* Perform some checks on how valid the treasure data actually is.	264	/* Perform some checks on how valid the treasure data actually is.
241	* verify that list transitions work (ie, the list that it is supposed	265	* verify that list transitions work (ie, the list that it is supposed
242	* to transition to exists). Also, verify that at least the name	266	* to transition to exists). Also, verify that at least the name
243	* or archetype is set for each treasure element.	267	* or archetype is set for each treasure element.
244	*/	268	*/
245	for (previous = first_treasurelist; previous != NULL; previous = previous->next)	269	for (treasurelist *tl = first_treasurelist; tl; tl = tl->next)
246	check_treasurelist (previous->items, previous);	270	check_treasurelist (tl->items, tl);
247	#endif	271	#endif
248	}
249
250	/*
251	* Searches for the given treasurelist in the globally linked list
252	* of treasurelists which has been built by load_treasures().
253	*/
254
255	treasurelist *
256	find_treasurelist (const char *name)
257	{
258	shstr_cmp name_ (name);
259
260	if (!name_)
261	return 0;
262
263	for (treasurelist *tl = first_treasurelist; tl != 0; tl = tl->next)
264	if (name_ == tl->name)
265	return tl;	272	return true;
266		273
267	if (first_treasurelist)	274	default:
268	LOG (llevError, "Couldn't find treasurelist %s\n", name);	275	if (!f.parse_error ("treasure lists"))
		276	return false;
269		277
270	return 0;	278	break;
271	}	279	}
272		280
		281	f.next ();
		282	}
		283	}
273		284
274	/*	285	/*
275	* Generates the objects specified by the given treasure.	286	* Generates the objects specified by the given treasure.
276	* It goes recursively through the rest of the linked list.	287	* It goes recursively through the rest of the linked list.
277	* If there is a certain percental chance for a treasure to be generated,	288	* If there is a certain percental chance for a treasure to be generated,
292	* this is the original object, or if this is an object that should be created	303	* this is the original object, or if this is an object that should be created
293	* by another object.	304	* by another object.
294	*/	305	*/
295	if (flags & GT_ENVIRONMENT && op->type != SPELL)	306	if (flags & GT_ENVIRONMENT && op->type != SPELL)
296	{	307	{
297	op->x = creator->x;
298	op->y = creator->y;
299	SET_FLAG (op, FLAG_OBJ_ORIGINAL);	308	SET_FLAG (op, FLAG_OBJ_ORIGINAL);
300	insert_ob_in_map (op, creator->map, op, INS_NO_MERGE \| INS_NO_WALK_ON);	309	op->insert_at (creator, creator, INS_NO_MERGE \| INS_NO_WALK_ON);
301	}	310	}
302	else	311	else
303	{	312	{
304	op = insert_ob_in_ob (op, creator);	313	op = creator->insert (op);
305		314
306	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))	315	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
307	monster_check_apply (creator, op);	316	monster_check_apply (creator, op);
308		317
309	if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ()))	318	if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ()))
…		…
329		338
330	if (t->change_arch.slaying)	339	if (t->change_arch.slaying)
331	op->slaying = t->change_arch.slaying;	340	op->slaying = t->change_arch.slaying;
332	}	341	}
333		342
334	void	343	static void
335	create_all_treasures (treasure t, object op, int flag, int difficulty, int tries)	344	create_all_treasures (treasure t, object op, int flag, int difficulty, int tries)
336	{	345	{
337	object *tmp;
338
339	if ((int) t->chance >= 100 \|\| (RANDOM () % 100 + 1) < (int) t->chance)	346	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)
340	{	347	{
341	if (t->name)	348	if (t->name)
342	{	349	{
343	if (strcmp (t->name, "NONE") && difficulty >= t->magic)	350	if (difficulty >= t->magic)
		351	create_treasure (treasurelist::find (t->name), op, flag, difficulty, tries);
		352	}
		353	else
		354	{
		355	if (t->item && (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE)))
344	{	356	{
345	treasurelist *tl = find_treasurelist (t->name);
346	if (tl)
347	create_treasure (tl, op, flag, difficulty, tries);
348	}
349	}
350	else
351	{
352	if (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE))
353	{
354	tmp = arch_to_object (t->item);	357	object *tmp = arch_to_object (t->item);
		358
355	if (t->nrof && tmp->nrof <= 1)	359	if (t->nrof && tmp->nrof <= 1)
356	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	360	tmp->nrof = rndm (t->nrof) + 1;
		361
357	fix_generated_item (tmp, op, difficulty, t->magic, flag);	362	fix_generated_item (tmp, op, difficulty, t->magic, flag);
358	change_treasure (t, tmp);	363	change_treasure (t, tmp);
359	put_treasure (tmp, op, flag);	364	put_treasure (tmp, op, flag);
360	}	365	}
361	}	366	}
362		367
363	if (t->next_yes != NULL)	368	if (t->next_yes)
364	create_all_treasures (t->next_yes, op, flag, difficulty, tries);	369	create_all_treasures (t->next_yes, op, flag, difficulty, tries);
365	}	370	}
366	else if (t->next_no != NULL)	371	else if (t->next_no)
367	create_all_treasures (t->next_no, op, flag, difficulty, tries);	372	create_all_treasures (t->next_no, op, flag, difficulty, tries);
368		373
369	if (t->next != NULL)	374	if (t->next)
370	create_all_treasures (t->next, op, flag, difficulty, tries);	375	create_all_treasures (t->next, op, flag, difficulty, tries);
371	}	376	}
372		377
373	void	378	static void
374	create_one_treasure (treasurelist * tl, object *op, int flag, int difficulty, int tries)	379	create_one_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)
375	{	380	{
376	int value = RANDOM () % tl->total_chance;	381	int value = rndm (tl->total_chance);
377	treasure *t;	382	treasure *t;
378		383
379	if (tries++ > 100)	384	if (tries++ > 100)
380	{	385	{
381	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");	386	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");
382	return;	387	return;
383	}	388	}
384		389
385	for (t = tl->items; t != NULL; t = t->next)	390	for (t = tl->items; t; t = t->next)
386	{	391	{
387	value -= t->chance;	392	value -= t->chance;
388		393
389	if (value < 0)	394	if (value < 0)
390	break;	395	break;
391	}	396	}
392		397
393	if (!t \|\| value >= 0)	398	if (!t \|\| value >= 0)
394	{
395	LOG (llevError, "create_one_treasure: got null object or not able to find treasure\n");	399	cleanup ("create_one_treasure: got null object or not able to find treasure\n", 1);
396	abort ();
397	return;
398	}
399		400
400	if (t->name)	401	if (t->name)
401	{	402	{
402	if (!strcmp (t->name, "NONE"))
403	return;
404
405	if (difficulty >= t->magic)	403	if (difficulty >= t->magic)
406	{	404	{
407	treasurelist *tl = find_treasurelist (t->name);	405	treasurelist *tl = treasurelist::find (t->name);
408	if (tl)	406	if (tl)
409	create_treasure (tl, op, flag, difficulty, tries);	407	create_treasure (tl, op, flag, difficulty, tries);
410	}	408	}
411	else if (t->nrof)	409	else if (t->nrof)
412	create_one_treasure (tl, op, flag, difficulty, tries);	410	create_one_treasure (tl, op, flag, difficulty, tries);
413
414	return;
415	}	411	}
416
417	if ((t->item && t->item->clone.invisible != 0) \|\| flag != GT_INVISIBLE)	412	else if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))
418	{	413	{
419	object *tmp = arch_to_object (t->item);	414	if (object *tmp = arch_to_object (t->item))
420		415	{
421	if (!tmp)
422	return;
423
424	if (t->nrof && tmp->nrof <= 1)	416	if (t->nrof && tmp->nrof <= 1)
425	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	417	tmp->nrof = rndm (t->nrof) + 1;
426		418
427	fix_generated_item (tmp, op, difficulty, t->magic, flag);	419	fix_generated_item (tmp, op, difficulty, t->magic, flag);
428	change_treasure (t, tmp);	420	change_treasure (t, tmp);
429	put_treasure (tmp, op, flag);	421	put_treasure (tmp, op, flag);
		422	}
430	}	423	}
431	}	424	}
432		425
433	/* This calls the appropriate treasure creation function. tries is passed	426	/* This calls the appropriate treasure creation function. tries is passed
434	* to determine how many list transitions or attempts to create treasure	427	* to determine how many list transitions or attempts to create treasure
…		…
436	* list transitions, or so that excessively good treasure will not be	429	* list transitions, or so that excessively good treasure will not be
437	* created on weak maps, because it will exceed the number of allowed tries	430	* created on weak maps, because it will exceed the number of allowed tries
438	* to do that.	431	* to do that.
439	*/	432	*/
440	void	433	void
441	create_treasure (treasurelist * t, object *op, int flag, int difficulty, int tries)	434	create_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)
442	{	435	{
		436	// empty treasurelists are legal
		437	if (!tl->items)
		438	return;
443		439
444	if (tries++ > 100)	440	if (tries++ > 100)
445	{	441	{
446	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	442	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
447	return;	443	return;
448	}	444	}
		445
449	if (t->total_chance)	446	if (tl->total_chance)
450	create_one_treasure (t, op, flag, difficulty, tries);	447	create_one_treasure (tl, op, flag, difficulty, tries);
451	else	448	else
452	create_all_treasures (t->items, op, flag, difficulty, tries);	449	create_all_treasures (tl->items, op, flag, difficulty, tries);
453	}	450	}
454		451
455	/* This is similar to the old generate treasure function. However,	452	/* This is similar to the old generate treasure function. However,
456	* it instead takes a treasurelist. It is really just a wrapper around	453	* it instead takes a treasurelist. It is really just a wrapper around
457	* create_treasure. We create a dummy object that the treasure gets	454	* create_treasure. We create a dummy object that the treasure gets
458	* inserted into, and then return that treausre	455	* inserted into, and then return that treausre
459	*/	456	*/
460	object *	457	object *
461	generate_treasure (treasurelist *t, int difficulty)	458	generate_treasure (treasurelist *tl, int difficulty)
462	{	459	{
463	difficulty = clamp (difficulty, 1, settings.max_level);	460	difficulty = clamp (difficulty, 1, settings.max_level);
464		461
465	object ob = object::create (), tmp;	462	object ob = object::create (), tmp;
466		463
467	create_treasure (t, ob, 0, difficulty, 0);	464	create_treasure (tl, ob, 0, difficulty, 0);
468		465
469	/* Don't want to free the object we are about to return */	466	/* Don't want to free the object we are about to return */
470	tmp = ob->inv;	467	tmp = ob->inv;
471	if (tmp != NULL)	468	if (tmp != NULL)
472	tmp->remove ();	469	tmp->remove ();
…		…
485	* magical bonus "wanted".	482	* magical bonus "wanted".
486	*/	483	*/
487		484
488	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	485	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
489		486
490	/chance of magic difficulty/	487	// chance of magic difficulty
491
492	/* +0 +1 +2 +3 +4 */	488	// +0 +1 +2 +3 +4
493	{95, 2, 2, 1, 0}, /1 /	489	{95, 2, 2, 1, 0}, // 1
494	{92, 5, 2, 1, 0}, /2 /	490	{92, 5, 2, 1, 0}, // 2
495	{85, 10, 4, 1, 0}, /3 /	491	{85, 10, 4, 1, 0}, // 3
496	{80, 14, 4, 2, 0}, /4 /	492	{80, 14, 4, 2, 0}, // 4
497	{75, 17, 5, 2, 1}, /5 /	493	{75, 17, 5, 2, 1}, // 5
498	{70, 18, 8, 3, 1}, /6 /	494	{70, 18, 8, 3, 1}, // 6
499	{65, 21, 10, 3, 1}, /7 /	495	{65, 21, 10, 3, 1}, // 7
500	{60, 22, 12, 4, 2}, /8 /	496	{60, 22, 12, 4, 2}, // 8
501	{55, 25, 14, 4, 2}, /9 /	497	{55, 25, 14, 4, 2}, // 9
502	{50, 27, 16, 5, 2}, /10 /	498	{50, 27, 16, 5, 2}, // 10
503	{45, 28, 18, 6, 3}, /11 /	499	{45, 28, 18, 6, 3}, // 11
504	{42, 28, 20, 7, 3}, /12 /	500	{42, 28, 20, 7, 3}, // 12
505	{40, 27, 21, 8, 4}, /13 /	501	{40, 27, 21, 8, 4}, // 13
506	{38, 25, 22, 10, 5}, /14 /	502	{38, 25, 22, 10, 5}, // 14
507	{36, 23, 23, 12, 6}, /15 /	503	{36, 23, 23, 12, 6}, // 15
508	{33, 21, 24, 14, 8}, /16 /	504	{33, 21, 24, 14, 8}, // 16
509	{31, 19, 25, 16, 9}, /17 /	505	{31, 19, 25, 16, 9}, // 17
510	{27, 15, 30, 18, 10}, /18 /	506	{27, 15, 30, 18, 10}, // 18
511	{20, 12, 30, 25, 13}, /19 /	507	{20, 12, 30, 25, 13}, // 19
512	{15, 10, 28, 30, 17}, /20 /	508	{15, 10, 28, 30, 17}, // 20
513	{13, 9, 27, 28, 23}, /21 /	509	{13, 9, 27, 28, 23}, // 21
514	{10, 8, 25, 28, 29}, /22 /	510	{10, 8, 25, 28, 29}, // 22
515	{8, 7, 23, 26, 36}, /23 /	511	{ 8, 7, 23, 26, 36}, // 23
516	{6, 6, 20, 22, 46}, /24 /	512	{ 6, 6, 20, 22, 46}, // 24
517	{4, 5, 17, 18, 56}, /25 /	513	{ 4, 5, 17, 18, 56}, // 25
518	{2, 4, 12, 14, 68}, /26 /	514	{ 2, 4, 12, 14, 68}, // 26
519	{0, 3, 7, 10, 80}, /27 /	515	{ 0, 3, 7, 10, 80}, // 27
520	{0, 0, 3, 7, 90}, /28 /	516	{ 0, 0, 3, 7, 90}, // 28
521	{0, 0, 0, 3, 97}, /29 /	517	{ 0, 0, 0, 3, 97}, // 29
522	{0, 0, 0, 0, 100}, /30 /	518	{ 0, 0, 0, 0, 100}, // 30
523	{0, 0, 0, 0, 100}, /31 /	519	{ 0, 0, 0, 0, 100}, // 31
524	};	520	};
525		521
526		522
527	/* calculate the appropriate level for wands staves and scrolls.	523	/* calculate the appropriate level for wands staves and scrolls.
528	* This code presumes that op has had its spell object created (in op->inv)	524	* This code presumes that op has had its spell object created (in op->inv)
…		…
561	* elmex Thu Aug 10 18:45:44 CEST 2006:	557	* elmex Thu Aug 10 18:45:44 CEST 2006:
562	* Scaling difficulty by max_level, as difficulty is a level and not some	558	* Scaling difficulty by max_level, as difficulty is a level and not some
563	* weird integer between 1-31.	559	* weird integer between 1-31.
564	*	560	*
565	*/	561	*/
566
567	int	562	int
568	magic_from_difficulty (int difficulty)	563	magic_from_difficulty (int difficulty)
569	{	564	{
570	int percent = 0, magic = 0;	565	int percent = 0, magic = 0;
571	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	566	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
…		…
576	scaled_diff = 0;	571	scaled_diff = 0;
577		572
578	if (scaled_diff >= DIFFLEVELS)	573	if (scaled_diff >= DIFFLEVELS)
579	scaled_diff = DIFFLEVELS - 1;	574	scaled_diff = DIFFLEVELS - 1;
580		575
581	percent = RANDOM () % 100;	576	percent = rndm (100);
582		577
583	for (magic = 0; magic < (MAXMAGIC + 1); magic++)	578	for (magic = 0; magic < (MAXMAGIC + 1); magic++)
584	{	579	{
585	percent -= difftomagic_list[scaled_diff][magic];	580	percent -= difftomagic_list[scaled_diff][magic];
586		581
…		…
592	{	587	{
593	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);	588	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);
594	magic = 0;	589	magic = 0;
595	}	590	}
596		591
597	magic = (RANDOM () % 3) ? magic : -magic;	592	magic = (rndm (3)) ? magic : -magic;
598	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */	593	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */
599		594
600	return magic;	595	return magic;
601	}	596	}
602		597
…		…
617	if (op->arch)	612	if (op->arch)
618	{	613	{
619	if (op->type == ARMOUR)	614	if (op->type == ARMOUR)
620	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	615	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;
621		616
622	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	617	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
623	magic = (-magic);	618	magic = (-magic);
624	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	619	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;
625	}	620	}
626	else	621	else
627	{	622	{
628	if (op->type == ARMOUR)	623	if (op->type == ARMOUR)
629	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	624	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
630	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	625	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
631	magic = (-magic);	626	magic = (-magic);
632	op->weight = (op->weight * (100 - magic * 10)) / 100;	627	op->weight = (op->weight * (100 - magic * 10)) / 100;
633	}	628	}
634	}	629	}
635		630
…		…
659	* 1) Since rings can have multiple bonuses, if the same bonus	654	* 1) Since rings can have multiple bonuses, if the same bonus
660	* is rolled again, increase it - the bonuses now stack with	655	* is rolled again, increase it - the bonuses now stack with
661	* other bonuses previously rolled and ones the item might natively have.	656	* other bonuses previously rolled and ones the item might natively have.
662	* 2) Add code to deal with new PR method.	657	* 2) Add code to deal with new PR method.
663	*/	658	*/
664
665	void	659	void
666	set_ring_bonus (object *op, int bonus)	660	set_ring_bonus (object *op, int bonus)
667	{	661	{
668		662
669	int r = RANDOM () % (bonus > 0 ? 25 : 11);	663	int r = rndm (bonus > 0 ? 25 : 11);
670		664
671	if (op->type == AMULET)	665	if (op->type == AMULET)
672	{	666	{
673	if (!(RANDOM () % 21))	667	if (!(rndm (21)))
674	r = 20 + RANDOM () % 2;	668	r = 20 + rndm (2);
675	else	669	else
676	{	670	{
677	if (RANDOM () & 2)	671	if (rndm (2))
678	r = 10;	672	r = 10;
679	else	673	else
680	r = 11 + RANDOM () % 9;	674	r = 11 + rndm (9);
681	}	675	}
682	}	676	}
683		677
684	switch (r)	678	switch (r)
685	{	679	{
…		…
722	case 16:	716	case 16:
723	case 17:	717	case 17:
724	case 18:	718	case 18:
725	case 19:	719	case 19:
726	{	720	{
727	int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table;	721	int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
728		722
729	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */	723	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */
730	val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b;	724	val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
731		725
732	/* Cursed items need to have higher negative values to equal out with	726	/* Cursed items need to have higher negative values to equal out with
733	* positive values for how protections work out. Put another	727	* positive values for how protections work out. Put another
734	* little random element in since that they don't always end up with	728	* little random element in since that they don't always end up with
735	* even values.	729	* even values.
736	*/	730	*/
737	if (bonus < 0)	731	if (bonus < 0)
738	val = 2 * -val - RANDOM () % b;	732	val = 2 * -val - rndm (b);
739	if (val > 35)	733	if (val > 35)
740	val = 35; /* Upper limit */	734	val = 35; /* Upper limit */
741	b = 0;	735	b = 0;
		736
742	while (op->resist[resist_table[resist]] != 0 && b < 4)	737	while (op->resist[resist_table[resist]] != 0 && b < 4)
743	{
744	resist = RANDOM () % num_resist_table;	738	resist = rndm (num_resist_table);
745	}	739
746	if (b == 4)	740	if (b == 4)
747	return; /* Not able to find a free resistance */	741	return; /* Not able to find a free resistance */
		742
748	op->resist[resist_table[resist]] = val;	743	op->resist[resist_table[resist]] = val;
749	/* We should probably do something more clever here to adjust value	744	/* We should probably do something more clever here to adjust value
750	* based on how good a resistance we gave.	745	* based on how good a resistance we gave.
751	*/	746	*/
752	break;	747	break;
…		…
780	case 22:	775	case 22:
781	op->stats.exp += bonus; /* Speed! */	776	op->stats.exp += bonus; /* Speed! */
782	op->value = (op->value * 2) / 3;	777	op->value = (op->value * 2) / 3;
783	break;	778	break;
784	}	779	}
		780
785	if (bonus > 0)	781	if (bonus > 0)
786	op->value = 2 bonus;	782	op->value = 2 bonus;
787	else	783	else
788	op->value = -(op->value * 2 * bonus) / 3;	784	op->value = -(op->value * 2 * bonus) / 3;
789	}	785	}
…		…
794	* higher is the chance of returning a low number.	790	* higher is the chance of returning a low number.
795	* It is only used in fix_generated_treasure() to set bonuses on	791	* It is only used in fix_generated_treasure() to set bonuses on
796	* rings and amulets.	792	* rings and amulets.
797	* Another scheme is used to calculate the magic of weapons and armours.	793	* Another scheme is used to calculate the magic of weapons and armours.
798	*/	794	*/
799
800	int	795	int
801	get_magic (int diff)	796	get_magic (int diff)
802	{	797	{
803	int i;	798	int i;
804		799
805	if (diff < 3)	800	if (diff < 3)
806	diff = 3;	801	diff = 3;
		802
807	for (i = 0; i < 4; i++)	803	for (i = 0; i < 4; i++)
808	if (RANDOM () % diff)	804	if (rndm (diff))
809	return i;	805	return i;
		806
810	return 4;	807	return 4;
811	}	808	}
812		809
813	#define DICE2 (get_magic(2)==2?2:1)	810	#define DICE2 (get_magic(2)==2?2:1)
814	#define DICESPELL (RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3)	811	#define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))
815		812
816	/*	813	/*
817	* fix_generated_item(): This is called after an item is generated, in	814	* fix_generated_item(): This is called after an item is generated, in
818	* order to set it up right. This produced magical bonuses, puts spells	815	* order to set it up right. This produced magical bonuses, puts spells
819	* into scrolls/books/wands, makes it unidentified, hides the value, etc.	816	* into scrolls/books/wands, makes it unidentified, hides the value, etc.
…		…
833	* value.	830	* value.
834	* GT_MINIMAL: Does minimal processing on the object - just enough to make it	831	* GT_MINIMAL: Does minimal processing on the object - just enough to make it
835	* a working object - don't change magic, value, etc, but set it material	832	* a working object - don't change magic, value, etc, but set it material
836	* type as appropriate, for objects that need spell objects, set those, etc	833	* type as appropriate, for objects that need spell objects, set those, etc
837	*/	834	*/
838
839	void	835	void
840	fix_generated_item (object op, object creator, int difficulty, int max_magic, int flags)	836	fix_generated_item (object op, object creator, int difficulty, int max_magic, int flags)
841	{	837	{
842	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;	838	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;
843		839
…		…
850		846
851	if (op->randomitems && op->type != SPELL)	847	if (op->randomitems && op->type != SPELL)
852	{	848	{
853	create_treasure (op->randomitems, op, flags, difficulty, 0);	849	create_treasure (op->randomitems, op, flags, difficulty, 0);
854	if (!op->inv)	850	if (!op->inv)
855	LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", &op->name);	851	LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", op->debug_desc ());
856		852
857	/* So the treasure doesn't get created again */	853	/* So the treasure doesn't get created again */
858	op->randomitems = NULL;	854	op->randomitems = 0;
859	}	855	}
860		856
861	if (difficulty < 1)	857	if (difficulty < 1)
862	difficulty = 1;	858	difficulty = 1;
863		859
…		…
880	if (!op->magic && max_magic)	876	if (!op->magic && max_magic)
881	set_magic (difficulty, op, max_magic, flags);	877	set_magic (difficulty, op, max_magic, flags);
882		878
883	num_enchantments = calc_item_power (op, 1);	879	num_enchantments = calc_item_power (op, 1);
884		880
885	if ((!was_magic && !(RANDOM () % CHANCE_FOR_ARTIFACT)) \|\| op->type == HORN \|\| difficulty >= settings.max_level) /* high difficulties always generate an artifact,	881	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
		882	\|\| op->type == HORN
		883	\|\| difficulty >= settings.max_level) /* high difficulties always generate an artifact,
886	* used for shop_floors or treasures */	884	* used for shop_floors or treasures */
887	generate_artifact (op, difficulty);	885	generate_artifact (op, difficulty);
888	}	886	}
889		887
890	/* Object was made an artifact. Calculate its item_power rating.	888	/* Object was made an artifact. Calculate its item_power rating.
…		…
948	case WEAPON:	946	case WEAPON:
949	case ARMOUR:	947	case ARMOUR:
950	case SHIELD:	948	case SHIELD:
951	case HELMET:	949	case HELMET:
952	case CLOAK:	950	case CLOAK:
953	if (QUERY_FLAG (op, FLAG_CURSED) && !(RANDOM () % 4))	951	if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
954	set_ring_bonus (op, -DICE2);	952	set_ring_bonus (op, -DICE2);
955	break;	953	break;
956		954
957	case BRACERS:	955	case BRACERS:
958	if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)))	956	if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
959	{	957	{
960	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	958	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
961	if (!QUERY_FLAG (op, FLAG_CURSED))	959	if (!QUERY_FLAG (op, FLAG_CURSED))
962	op->value *= 3;	960	op->value *= 3;
963	}	961	}
…		…
989	*/	987	*/
990	if (op->inv && op->randomitems)	988	if (op->inv && op->randomitems)
991	{	989	{
992	/* value multiplier is same as for scrolls */	990	/* value multiplier is same as for scrolls */
993	op->value = (op->value * op->inv->value);	991	op->value = (op->value * op->inv->value);
994	op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty;	992	op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
995	}	993	}
996	else	994	else
997	{	995	{
998	op->name = "potion";	996	op->name = "potion";
999	op->name_pl = "potions";	997	op->name_pl = "potions";
1000	}	998	}
1001		999
1002	if (!(flags & GT_ONLY_GOOD) && RANDOM () % 2)	1000	if (!(flags & GT_ONLY_GOOD) && rndm (2))
1003	SET_FLAG (op, FLAG_CURSED);	1001	SET_FLAG (op, FLAG_CURSED);
1004	break;	1002	break;
1005	}	1003	}
1006		1004
1007	case AMULET:	1005	case AMULET:
…		…
1017	}	1015	}
1018		1016
1019	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */	1017	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */
1020	break;	1018	break;
1021		1019
1022	if (!(flags & GT_ONLY_GOOD) && !(RANDOM () % 3))	1020	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1023	SET_FLAG (op, FLAG_CURSED);	1021	SET_FLAG (op, FLAG_CURSED);
1024		1022
1025	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	1023	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
1026		1024
1027	if (op->type != RING) /* Amulets have only one ability */	1025	if (op->type != RING) /* Amulets have only one ability */
1028	break;	1026	break;
1029		1027
1030	if (!(RANDOM () % 4))	1028	if (!(rndm (4)))
1031	{	1029	{
1032	int d = (RANDOM () % 2 \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	1030	int d = (rndm (2) \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1033		1031
1034	if (d > 0)	1032	if (d > 0)
1035	op->value *= 3;	1033	op->value *= 3;
1036		1034
1037	set_ring_bonus (op, d);	1035	set_ring_bonus (op, d);
1038		1036
1039	if (!(RANDOM () % 4))	1037	if (!(rndm (4)))
1040	{	1038	{
1041	int d = (RANDOM () % 3 \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	1039	int d = (rndm (3) \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1042		1040
1043	if (d > 0)	1041	if (d > 0)
1044	op->value *= 5;	1042	op->value *= 5;
1045	set_ring_bonus (op, d);	1043	set_ring_bonus (op, d);
1046	}	1044	}
1047	}	1045	}
1048		1046
1049	if (GET_ANIM_ID (op))	1047	if (GET_ANIM_ID (op))
1050	SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op)));	1048	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1051		1049
1052	break;	1050	break;
1053		1051
1054	case BOOK:	1052	case BOOK:
1055	/* Is it an empty book?, if yes lets make a special·	1053	/* Is it an empty book?, if yes lets make a special·
1056	* msg for it, and tailor its properties based on the·	1054	* msg for it, and tailor its properties based on the·
1057	* creator and/or map level we found it on.	1055	* creator and/or map level we found it on.
1058	*/	1056	*/
1059	if (!op->msg && RANDOM () % 10)	1057	if (!op->msg && rndm (10))
1060	{	1058	{
1061	/* set the book level properly */	1059	/* set the book level properly */
1062	if (creator->level == 0 \|\| QUERY_FLAG (creator, FLAG_ALIVE))	1060	if (creator->level == 0 \|\| QUERY_FLAG (creator, FLAG_ALIVE))
1063	{	1061	{
1064	if (op->map && op->map->difficulty)	1062	if (op->map && op->map->difficulty)
1065	op->level = RANDOM () % (op->map->difficulty) + RANDOM () % 10 + 1;	1063	op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1066	else	1064	else
1067	op->level = RANDOM () % 20 + 1;	1065	op->level = rndm (20) + 1;
1068	}	1066	}
1069	else	1067	else
1070	op->level = RANDOM () % creator->level;	1068	op->level = rndm (creator->level);
1071		1069
1072	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);	1070	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);
1073	/* books w/ info are worth more! */	1071	/* books w/ info are worth more! */
1074	op->value = ((op->level > 10 ? op->level : (op->level + 1) / 2) ((strlen (op->msg) / 250) + 1));	1072	op->value = ((op->level > 10 ? op->level : (op->level + 1) / 2) ((strlen (op->msg) / 250) + 1));
1075	/* creator related stuff */	1073	/* creator related stuff */
…		…
1174	*/	1172	*/
1175		1173
1176	/*	1174	/*
1177	* Allocate and return the pointer to an empty artifactlist structure.	1175	* Allocate and return the pointer to an empty artifactlist structure.
1178	*/	1176	*/
1179
1180	static artifactlist *	1177	static artifactlist *
1181	get_empty_artifactlist (void)	1178	get_empty_artifactlist (void)
1182	{	1179	{
1183	artifactlist tl = (artifactlist ) malloc (sizeof (artifactlist));	1180	return salloc0 <artifactlist> ();
1184
1185	if (tl == NULL)
1186	fatal (OUT_OF_MEMORY);
1187	tl->next = NULL;
1188	tl->items = NULL;
1189	tl->total_chance = 0;
1190	return tl;
1191	}	1181	}
1192		1182
1193	/*	1183	/*
1194	* Allocate and return the pointer to an empty artifact structure.	1184	* Allocate and return the pointer to an empty artifact structure.
1195	*/	1185	*/
1196
1197	static artifact *	1186	static artifact *
1198	get_empty_artifact (void)	1187	get_empty_artifact (void)
1199	{	1188	{
1200	artifact t = (artifact ) malloc (sizeof (artifact));	1189	return salloc0 <artifact> ();
1201
1202	if (t == NULL)
1203	fatal (OUT_OF_MEMORY);
1204	t->item = NULL;
1205	t->next = NULL;
1206	t->chance = 0;
1207	t->difficulty = 0;
1208	t->allowed = NULL;
1209	return t;
1210	}	1190	}
1211		1191
1212	/*	1192	/*
1213	* Searches the artifact lists and returns one that has the same type	1193	* Searches the artifact lists and returns one that has the same type
1214	* of objects on it.	1194	* of objects on it.
1215	*/	1195	*/
1216
1217	artifactlist *	1196	artifactlist *
1218	find_artifactlist (int type)	1197	find_artifactlist (int type)
1219	{	1198	{
1220	artifactlist *al;
1221
1222	for (al = first_artifactlist; al != NULL; al = al->next)	1199	for (artifactlist *al = first_artifactlist; al; al = al->next)
1223	if (al->type == type)	1200	if (al->type == type)
1224	return al;	1201	return al;
		1202
1225	return NULL;	1203	return 0;
1226	}	1204	}
1227		1205
1228	/*	1206	/*
1229	* For debugging purposes. Dumps all tables.	1207	* For debugging purposes. Dumps all tables.
1230	*/	1208	*/
1231
1232	void	1209	void
1233	dump_artifacts (void)	1210	dump_artifacts (void)
1234	{	1211	{
1235	artifactlist *al;	1212	artifactlist *al;
1236	artifact *art;	1213	artifact *art;
…		…
1243	for (art = al->items; art != NULL; art = art->next)	1220	for (art = al->items; art != NULL; art = art->next)
1244	{	1221	{
1245	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);	1222	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1246	if (art->allowed != NULL)	1223	if (art->allowed != NULL)
1247	{	1224	{
1248	fprintf (logfile, "\tAllowed combinations:");	1225	fprintf (logfile, "\tallowed combinations:");
1249	for (next = art->allowed; next != NULL; next = next->next)	1226	for (next = art->allowed; next != NULL; next = next->next)
1250	fprintf (logfile, "%s,", &next->name);	1227	fprintf (logfile, "%s,", &next->name);
1251	fprintf (logfile, "\n");	1228	fprintf (logfile, "\n");
1252	}	1229	}
1253	}	1230	}
…		…
1264	treasurelist *tl;	1241	treasurelist *tl;
1265	int i;	1242	int i;
1266		1243
1267	if (depth > 100)	1244	if (depth > 100)
1268	return;	1245	return;
1269	while (t != NULL)	1246
		1247	while (t)
1270	{	1248	{
1271	if (t->name != NULL)	1249	if (t->name)
1272	{	1250	{
1273	for (i = 0; i < depth; i++)	1251	for (i = 0; i < depth; i++)
1274	fprintf (logfile, " ");	1252	fprintf (logfile, " ");
		1253
1275	fprintf (logfile, "{ (list: %s)\n", &t->name);	1254	fprintf (logfile, "{ (list: %s)\n", &t->name);
		1255
1276	tl = find_treasurelist (t->name);	1256	tl = treasurelist::find (t->name);
1277	if (tl)	1257	if (tl)
1278	dump_monster_treasure_rec (name, tl->items, depth + 2);	1258	dump_monster_treasure_rec (name, tl->items, depth + 2);
		1259
1279	for (i = 0; i < depth; i++)	1260	for (i = 0; i < depth; i++)
1280	fprintf (logfile, " ");	1261	fprintf (logfile, " ");
		1262
1281	fprintf (logfile, "} (end of list: %s)\n", &t->name);	1263	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1282	}	1264	}
1283	else	1265	else
1284	{	1266	{
1285	for (i = 0; i < depth; i++)	1267	for (i = 0; i < depth; i++)
1286	fprintf (logfile, " ");	1268	fprintf (logfile, " ");
		1269
1287	if (t->item->clone.type == FLESH)	1270	if (t->item && t->item->clone.type == FLESH)
1288	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);	1271	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1289	else	1272	else
1290	fprintf (logfile, "%s\n", &t->item->clone.name);	1273	fprintf (logfile, "%s\n", &t->item->clone.name);
1291	}	1274	}
		1275
1292	if (t->next_yes != NULL)	1276	if (t->next_yes)
1293	{	1277	{
1294	for (i = 0; i < depth; i++)	1278	for (i = 0; i < depth; i++)
1295	fprintf (logfile, " ");	1279	fprintf (logfile, " ");
		1280
1296	fprintf (logfile, " (if yes)\n");	1281	fprintf (logfile, " (if yes)\n");
1297	dump_monster_treasure_rec (name, t->next_yes, depth + 1);	1282	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1298	}	1283	}
		1284
1299	if (t->next_no != NULL)	1285	if (t->next_no)
1300	{	1286	{
1301	for (i = 0; i < depth; i++)	1287	for (i = 0; i < depth; i++)
1302	fprintf (logfile, " ");	1288	fprintf (logfile, " ");
		1289
1303	fprintf (logfile, " (if no)\n");	1290	fprintf (logfile, " (if no)\n");
1304	dump_monster_treasure_rec (name, t->next_no, depth + 1);	1291	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1305	}	1292	}
		1293
1306	t = t->next;	1294	t = t->next;
1307	}	1295	}
1308	}	1296	}
1309		1297
1310	/*	1298	/*
1311	* For debugging purposes. Dumps all treasures for a given monster.	1299	* For debugging purposes. Dumps all treasures for a given monster.
1312	* Created originally by Raphael Quinet for debugging the alchemy code.	1300	* Created originally by Raphael Quinet for debugging the alchemy code.
1313	*/	1301	*/
1314
1315	void	1302	void
1316	dump_monster_treasure (const char *name)	1303	dump_monster_treasure (const char *name)
1317	{	1304	{
1318	archetype *at;	1305	archetype *at;
1319	int found;	1306	int found;
1320		1307
1321	found = 0;	1308	found = 0;
1322	fprintf (logfile, "\n");	1309	fprintf (logfile, "\n");
		1310
1323	for (at = first_archetype; at != NULL; at = at->next)	1311	for (at = first_archetype; at != NULL; at = at->next)
1324	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)	1312	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1325	{	1313	{
1326	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);	1314	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1327	if (at->clone.randomitems != NULL)	1315	if (at->clone.randomitems != NULL)
1328	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);	1316	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1329	else	1317	else
1330	fprintf (logfile, "(nothing)\n");	1318	fprintf (logfile, "(nothing)\n");
		1319
1331	fprintf (logfile, "\n");	1320	fprintf (logfile, "\n");
1332	found++;	1321	found++;
1333	}	1322	}
		1323
1334	if (found == 0)	1324	if (found == 0)
1335	fprintf (logfile, "No objects have the name %s!\n\n", name);	1325	fprintf (logfile, "No objects have the name %s!\n\n", name);
1336	}	1326	}
1337		1327
1338	/*	1328	/*
1339	* Builds up the lists of artifacts from the file in the libdir.	1329	* Builds up the lists of artifacts from the file in the libdir.
1340	*/	1330	*/
1341
1342	void	1331	void
1343	init_artifacts (void)	1332	init_artifacts (void)
1344	{	1333	{
1345	static int has_been_inited = 0;	1334	static int has_been_inited = 0;
1346	char filename[MAX_BUF], buf[HUGE_BUF], cp, next;	1335	char filename[MAX_BUF];
1347	artifact *art = NULL;	1336	artifact *art = NULL;
1348	linked_char *tmp;
1349	int value;
1350	artifactlist *al;	1337	artifactlist *al;
1351		1338
1352	if (has_been_inited)	1339	if (has_been_inited)
1353	return;	1340	return;
1354	else	1341	else
1355	has_been_inited = 1;	1342	has_been_inited = 1;
1356		1343
1357	sprintf (filename, "%s/artifacts", settings.datadir);	1344	sprintf (filename, "%s/artifacts", settings.datadir);
1358	object_thawer thawer (filename);	1345	object_thawer f (filename);
1359		1346
1360	if (!thawer)	1347	if (!f)
1361	return;	1348	return;
1362		1349
1363	while (fgets (buf, HUGE_BUF, thawer) != NULL)	1350	f.next ();
1364	{
1365	if (*buf == '#')
1366	continue;
1367	if ((cp = strchr (buf, '\n')) != NULL)
1368	*cp = '\0';
1369	cp = buf;
1370	while (cp == ' ') / Skip blanks */
1371	cp++;
1372	if (*cp == '\0')
1373	continue;
1374		1351
1375	if (!strncmp (cp, "Allowed", 7))	1352	for (;;)
		1353	{
		1354	switch (f.kw)
1376	{	1355	{
		1356	case KW_allowed:
1377	if (art == NULL)	1357	if (!art)
		1358	{
		1359	art = get_empty_artifact ();
		1360	nrofartifacts++;
		1361	}
		1362
1378	{	1363	{
1379	art = get_empty_artifact ();	1364	if (!strcmp (f.get_str (), "all"))
1380	nrofartifacts++;	1365	break;
		1366
		1367	char next, cp = f.get_str ();
		1368
		1369	do
		1370	{
		1371	nrofallowedstr++;
		1372
		1373	if ((next = strchr (cp, ',')))
		1374	*next++ = '\0';
		1375
		1376	linked_char *tmp = new linked_char;
		1377
		1378	tmp->name = cp;
		1379	tmp->next = art->allowed;
		1380	art->allowed = tmp;
		1381	}
		1382	while ((cp = next));
1381	}	1383	}
1382	cp = strchr (cp, ' ') + 1;	1384	break;
1383	if (!strcmp (cp, "all"))	1385
		1386	case KW_chance:
		1387	f.get (art->chance);
		1388	break;
		1389
		1390	case KW_difficulty:
		1391	f.get (art->difficulty);
		1392	break;
		1393
		1394	case KW_object:
		1395	{
		1396	art->item = object::create ();
		1397
		1398	if (!art->item->parse_kv (f))
		1399	LOG (llevError, "Init_Artifacts: Could not load object.\n");
		1400
		1401	al = find_artifactlist (art->item->type);
		1402
		1403	if (!al)
		1404	{
		1405	al = get_empty_artifactlist ();
		1406	al->type = art->item->type;
		1407	al->next = first_artifactlist;
		1408	first_artifactlist = al;
		1409	}
		1410
		1411	art->next = al->items;
		1412	al->items = art;
		1413	art = 0;
		1414	}
1384	continue;	1415	continue;
1385		1416
1386	do	1417	case KW_EOF:
		1418	goto done;
		1419
		1420	default:
		1421	if (!f.parse_error ("artifacts file"))
		1422	cleanup ("artifacts file required");
1387	{	1423	break;
1388	nrofallowedstr++;
1389	if ((next = strchr (cp, ',')) != NULL)
1390	*(next++) = '\0';
1391	tmp = new linked_char;
1392
1393	tmp->name = cp;
1394	tmp->next = art->allowed;
1395	art->allowed = tmp;
1396	}
1397	while ((cp = next) != NULL);
1398	}
1399	else if (sscanf (cp, "chance %d", &value))
1400	art->chance = (uint16) value;
1401	else if (sscanf (cp, "difficulty %d", &value))
1402	art->difficulty = (uint8) value;
1403	else if (!strncmp (cp, "Object", 6))
1404	{	1424	}
1405	art->item = object::create ();
1406		1425
1407	if (!load_object (thawer, art->item, 0))	1426	f.next ();
1408	LOG (llevError, "Init_Artifacts: Could not load object.\n");
1409
1410	art->item->name = strchr (cp, ' ') + 1;
1411	al = find_artifactlist (art->item->type);
1412	if (al == NULL)
1413	{
1414	al = get_empty_artifactlist ();
1415	al->type = art->item->type;
1416	al->next = first_artifactlist;
1417	first_artifactlist = al;
1418	}
1419	art->next = al->items;
1420	al->items = art;
1421	art = NULL;
1422	}
1423	else
1424	LOG (llevError, "Unknown input in artifact file: %s\n", buf);
1425	}	1427	}
1426		1428
		1429	done:
1427	for (al = first_artifactlist; al != NULL; al = al->next)	1430	for (al = first_artifactlist; al; al = al->next)
1428	{	1431	{
1429	for (art = al->items; art != NULL; art = art->next)	1432	for (art = al->items; art; art = art->next)
1430	{	1433	{
1431	if (!art->chance)	1434	if (!art->chance)
1432	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1435	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1433	else	1436	else
1434	al->total_chance += art->chance;	1437	al->total_chance += art->chance;
…		…
1453	int i, tmp;	1456	int i, tmp;
1454		1457
1455	if (change->face != blank_face)	1458	if (change->face != blank_face)
1456	{	1459	{
1457	#ifdef TREASURE_VERBOSE	1460	#ifdef TREASURE_VERBOSE
1458	LOG (llevDebug, "FACE: %d\n", change->face->number);	1461	LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1459	#endif	1462	#endif
1460	op->face = change->face;	1463	op->face = change->face;
1461	}	1464	}
1462		1465
1463	for (i = 0; i < NUM_STATS; i++)	1466	for (i = 0; i < NUM_STATS; i++)
…		…
1503		1506
1504	op->set_speed (op->speed);	1507	op->set_speed (op->speed);
1505	}	1508	}
1506		1509
1507	if (change->nrof)	1510	if (change->nrof)
1508	op->nrof = RANDOM () % ((int) change->nrof) + 1;	1511	op->nrof = rndm (change->nrof) + 1;
1509		1512
1510	op->stats.exp += change->stats.exp; /* Speed modifier */	1513	op->stats.exp += change->stats.exp; /* Speed modifier */
1511	op->stats.wc += change->stats.wc;	1514	op->stats.wc += change->stats.wc;
1512	op->stats.ac += change->stats.ac;	1515	op->stats.ac += change->stats.ac;
1513		1516
…		…
1616	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);	1619	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);
1617	}	1620	}
1618		1621
1619	op->value *= change->value;	1622	op->value *= change->value;
1620		1623
1621	if (change->material)	1624	if (change->materials)
1622	op->material = change->material;	1625	op->materials = change->materials;
1623		1626
1624	if (change->materialname)	1627	if (change->materialname)
1625	op->materialname = change->materialname;	1628	op->materialname = change->materialname;
1626		1629
1627	if (change->slaying)	1630	if (change->slaying)
…		…
1644	if (art->allowed == (linked_char *) NULL)	1647	if (art->allowed == (linked_char *) NULL)
1645	return 1; /* Ie, "all" */	1648	return 1; /* Ie, "all" */
1646	for (tmp = art->allowed; tmp; tmp = tmp->next)	1649	for (tmp = art->allowed; tmp; tmp = tmp->next)
1647	{	1650	{
1648	#ifdef TREASURE_VERBOSE	1651	#ifdef TREASURE_VERBOSE
1649	LOG (llevDebug, "legal_art: %s\n", tmp->name);	1652	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1650	#endif	1653	#endif
1651	if (*tmp->name == '!')	1654	if (*tmp->name == '!')
1652	name = tmp->name + 1, neg = 1;	1655	name = tmp->name + 1, neg = 1;
1653	else	1656	else
1654	name = tmp->name, neg = 0;	1657	name = tmp->name, neg = 0;
…		…
1721	return;	1724	return;
1722	}	1725	}
1723		1726
1724	for (i = 0; i < ARTIFACT_TRIES; i++)	1727	for (i = 0; i < ARTIFACT_TRIES; i++)
1725	{	1728	{
1726	int roll = RANDOM () % al->total_chance;	1729	int roll = rndm (al->total_chance);
1727		1730
1728	for (art = al->items; art != NULL; art = art->next)	1731	for (art = al->items; art; art = art->next)
1729	{	1732	{
1730	roll -= art->chance;	1733	roll -= art->chance;
1731	if (roll < 0)	1734	if (roll < 0)
1732	break;	1735	break;
1733	}	1736	}
…		…
1749	continue;	1752	continue;
1750		1753
1751	if (!legal_artifact_combination (op, art))	1754	if (!legal_artifact_combination (op, art))
1752	{	1755	{
1753	#ifdef TREASURE_VERBOSE	1756	#ifdef TREASURE_VERBOSE
1754	LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name);	1757	LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1755	#endif	1758	#endif
1756	continue;	1759	continue;
1757	}	1760	}
		1761
1758	give_artifact_abilities (op, art->item);	1762	give_artifact_abilities (op, art->item);
1759	return;	1763	return;
1760	}	1764	}
1761	}	1765	}
1762		1766
…		…
1810	/* special_potion() - so that old potion code is still done right. */	1814	/* special_potion() - so that old potion code is still done right. */
1811		1815
1812	int	1816	int
1813	special_potion (object *op)	1817	special_potion (object *op)
1814	{	1818	{
1815
1816	int i;
1817
1818	if (op->attacktype)	1819	if (op->attacktype)
1819	return 1;	1820	return 1;
1820		1821
1821	if (op->stats.Str \|\| op->stats.Dex \|\| op->stats.Con \|\| op->stats.Pow \|\| op->stats.Wis \|\| op->stats.Int \|\| op->stats.Cha)	1822	if (op->stats.Str \|\| op->stats.Dex \|\| op->stats.Con \|\| op->stats.Pow \|\| op->stats.Wis \|\| op->stats.Int \|\| op->stats.Cha)
1822	return 1;	1823	return 1;
1823		1824
1824	for (i = 0; i < NROFATTACKS; i++)	1825	for (int i = 0; i < NROFATTACKS; i++)
1825	if (op->resist[i])	1826	if (op->resist[i])
1826	return 1;	1827	return 1;
1827		1828
1828	return 0;	1829	return 0;
1829	}	1830	}
1830		1831
1831	void	1832	void
1832	free_treasurestruct (treasure *t)	1833	free_treasurestruct (treasure *t)
1833	{	1834	{
1834	if (t->next)
1835	free_treasurestruct (t->next);	1835	if (t->next) free_treasurestruct (t->next);
1836	if (t->next_yes)
1837	free_treasurestruct (t->next_yes);	1836	if (t->next_yes) free_treasurestruct (t->next_yes);
1838	if (t->next_no)
1839	free_treasurestruct (t->next_no);	1837	if (t->next_no) free_treasurestruct (t->next_no);
1840		1838
1841	delete t;	1839	delete t;
1842	}	1840	}
1843		1841
1844	void	1842	void
…		…
1849		1847
1850	delete lc;	1848	delete lc;
1851	}	1849	}
1852		1850
1853	void	1851	void
1854	free_artifact (artifact * at)	1852	free_artifact (artifact *at)
1855	{	1853	{
1856	if (at->next)
1857	free_artifact (at->next);	1854	if (at->next) free_artifact (at->next);
1858
1859	if (at->allowed)
1860	free_charlinks (at->allowed);	1855	if (at->allowed) free_charlinks (at->allowed);
1861		1856
1862	at->item->destroy (1);	1857	at->item->destroy (1);
1863		1858
1864	delete at;	1859	sfree (at);
1865	}	1860	}
1866		1861
1867	void	1862	void
1868	free_artifactlist (artifactlist * al)	1863	free_artifactlist (artifactlist *al)
1869	{	1864	{
1870	artifactlist *nextal;	1865	artifactlist *nextal;
1871		1866
1872	for (al = first_artifactlist; al; al = nextal)	1867	for (al = first_artifactlist; al; al = nextal)
1873	{	1868	{
1874	nextal = al->next;	1869	nextal = al->next;
1875		1870
1876	if (al->items)	1871	if (al->items)
1877	free_artifact (al->items);	1872	free_artifact (al->items);
1878		1873
1879	free (al);	1874	sfree (al);
1880	}	1875	}
1881	}	1876	}
1882		1877
1883	void	1878	void
1884	free_all_treasures (void)	1879	free_all_treasures (void)
1885	{	1880	{
1886	treasurelist tl, next;	1881	treasurelist tl, next;
1887		1882
1888
1889	for (tl = first_treasurelist; tl != NULL; tl = next)	1883	for (tl = first_treasurelist; tl; tl = next)
1890	{	1884	{
		1885	clear (tl);
		1886
1891	next = tl->next;	1887	next = tl->next;
1892	if (tl->items)
1893	free_treasurestruct (tl->items);
1894	delete tl;	1888	delete tl;
1895	}	1889	}
		1890
1896	free_artifactlist (first_artifactlist);	1891	free_artifactlist (first_artifactlist);
1897	}	1892	}

Diff Legend

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

Comparing deliantra/server/common/treasure.C (file contents): Revision 1.28 by root, Tue Dec 26 08:54:59 2006 UTC vs. Revision 1.43 by root, Mon Apr 16 11:09:30 2007 UTC

Diff Legend

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.28 by root, Tue Dec 26 08:54:59 2006 UTC vs.
Revision 1.43 by root, Mon Apr 16 11:09:30 2007 UTC