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

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.36 by root, Wed Feb 7 02:04:46 2007 UTC vs.
Revision 1.48 by root, Tue Apr 17 18:40:31 2007 UTC

…		…
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	21	*
22	* 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>
23	*/	23	*/
24		24
25	#define ALLOWED_COMBINATION
26
27	/* TREASURE_DEBUG does some checking on the treasurelists after loading.	25	/* TREASURE_DEBUG does some checking on the treasurelists after loading.
28	* 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
29	* 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
30	* left on	28	* left on
31	*/	29	*/
32	#define TREASURE_DEBUG	30	#define TREASURE_DEBUG
33		31
34	/* TREASURE_VERBOSE enables copious output concerning artifact generation */	32	/* TREASURE_VERBOSE enables copious output concerning artifact generation */
35		33
36	/* #define TREASURE_VERBOSE */	34	//#define TREASURE_VERBOSE
37		35
38	#include <global.h>	36	#include <global.h>
39	#include <treasure.h>	37	#include <treasure.h>
40	#include <funcpoint.h>	38	#include <funcpoint.h>
41	#include <loader.h>	39	#include <loader.h>
42		40
		41	extern char *spell_mapping[];
		42
		43	static treasurelist *first_treasurelist;
43		44
44	static void change_treasure (treasure t, object op); /* overrule default values */	45	static void change_treasure (treasure t, object op); /* overrule default values */
45	extern char *spell_mapping[];
46		46
47	/*	47	typedef std::tr1::unordered_map<
48	* Initialize global archtype pointers:	48	const char *,
49	*/	49	treasurelist *,
		50	str_hash,
		51	str_equal,
		52	slice_allocator< std::pair<const char const, treasurelist > >,
		53	true
		54	> tl_map_t;
50		55
		56	static tl_map_t tl_map;
		57
		58	/*
		59	* Searches for the given treasurelist
		60	*/
		61	treasurelist *
		62	treasurelist::find (const char *name)
		63	{
		64	if (!name)
		65	return 0;
		66
		67	auto (i, tl_map.find (name));
		68
		69	if (i == tl_map.end ())
		70	return 0;
		71
		72	return i->second;
		73	}
		74
		75	/*
		76	* Searches for the given treasurelist in the globally linked list
		77	* of treasurelists which has been built by load_treasures().
		78	*/
		79	treasurelist *
		80	treasurelist::get (const char *name)
		81	{
		82	treasurelist *tl = find (name);
		83
		84	if (!tl)
		85	{
		86	tl = new treasurelist;
		87
		88	tl->name = name;
		89	tl->next = first_treasurelist;
		90	first_treasurelist = tl;
		91
		92	tl_map.insert (std::make_pair (tl->name, tl));
		93	}
		94
		95	return tl;
		96	}
		97
		98	//TODO: class method
51	void	99	void
52	init_archetype_pointers ()	100	clear (treasurelist *tl)
53	{	101	{
54	int prev_warn = warn_archetypes;	102	if (tl->items)
		103	{
		104	free_treasurestruct (tl->items);
		105	tl->items = 0;
		106	}
55		107
56	warn_archetypes = 1;
57	if (ring_arch == NULL)
58	ring_arch = archetype::find ("ring");
59	if (amulet_arch == NULL)
60	amulet_arch = archetype::find ("amulet");
61	if (staff_arch == NULL)
62	staff_arch = archetype::find ("staff");
63	if (crown_arch == NULL)
64	crown_arch = archetype::find ("crown");
65	warn_archetypes = prev_warn;
66	}
67
68	/*
69	* Allocate and return the pointer to an empty treasurelist structure.
70	*/
71
72	static treasurelist *
73	get_empty_treasurelist (void)
74	{
75	return new treasurelist;
76	}
77
78	/*
79	* Allocate and return the pointer to an empty treasure structure.
80	*/
81	//TODO: make this a constructor
82	static treasure *
83	get_empty_treasure (void)
84	{
85	treasure *t = new treasure;
86
87	t->chance = 100;	108	tl->total_chance = 0;
88
89	return t;
90	}	109	}
		110
		111	#ifdef TREASURE_DEBUG
		112	/* recursived checks the linked list. Treasurelist is passed only
		113	* so that the treasure name can be printed out
		114	*/
		115	static void
		116	check_treasurelist (const treasure t, const treasurelist tl)
		117	{
		118	if (t->chance >= 100 && t->next_yes && (t->next \|\| t->next_no))
		119	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
		120
		121	if (t->next)
		122	check_treasurelist (t->next, tl);
		123
		124	if (t->next_yes)
		125	check_treasurelist (t->next_yes, tl);
		126
		127	if (t->next_no)
		128	check_treasurelist (t->next_no, tl);
		129	}
		130	#endif
91		131
92	/*	132	/*
93	* Reads the lib/treasure file from disk, and parses the contents	133	* Reads the lib/treasure file from disk, and parses the contents
94	* into an internal treasure structure (very linked lists)	134	* into an internal treasure structure (very linked lists)
95	*/	135	*/
96
97	static treasure *	136	static treasure *
98	load_treasure (FILE * fp, int *line)	137	read_treasure (object_thawer &f)
99	{	138	{
100	char buf[MAX_BUF], *cp, variable[MAX_BUF];
101	treasure *t = get_empty_treasure ();	139	treasure *t = new treasure;
102	int value;
103		140
104	nroftreasures++;	141	f.next ();
105	while (fgets (buf, MAX_BUF, fp) != NULL)
106	{
107	(*line)++;
108		142
109	if (*buf == '#')	143	for (;;)
110	continue;	144	{
111	if ((cp = strchr (buf, '\n')) != NULL)	145	coroapi::cede_to_tick_every (10);
112	*cp = '\0';
113	cp = buf;
114	while (isspace (cp)) / Skip blanks */
115	cp++;
116		146
117	if (sscanf (cp, "arch %s", variable))	147	switch (f.kw)
118	{
119	if ((t->item = archetype::find (variable)) == NULL)
120	LOG (llevError, "Treasure lacks archetype: %s\n", variable);
121	}	148	{
122	else if (sscanf (cp, "list %s", variable))	149	case KW_arch:
123	t->name = variable;	150	if (!(t->item = archetype::find (f.get_str ())))
124	else if (sscanf (cp, "change_name %s", variable))	151	LOG (llevError, "%s:%d treasure references unknown archetype '%s', skipping.\n", f.name, f.linenum, f.get_str ());
125	t->change_arch.name = variable;	152	break;
126	else if (sscanf (cp, "change_title %s", variable))	153
127	t->change_arch.title = variable;	154	case KW_list: f.get (t->name); break;
128	else if (sscanf (cp, "change_slaying %s", variable))	155	case KW_change_name: f.get (t->change_arch.name); break;
129	t->change_arch.slaying = variable;	156	case KW_change_title: f.get (t->change_arch.title); break;
130	else if (sscanf (cp, "chance %d", &value))	157	case KW_change_slaying: f.get (t->change_arch.slaying); break;
131	t->chance = (uint8) value;	158	case KW_chance: f.get (t->chance); break;
132	else if (sscanf (cp, "nrof %d", &value))	159	case KW_nrof: f.get (t->nrof); break;
133	t->nrof = (uint16) value;	160	case KW_magic: f.get (t->magic); break;
134	else if (sscanf (cp, "magic %d", &value))	161
135	t->magic = (uint8) value;	162	case KW_yes: t->next_yes = read_treasure (f); continue;
136	else if (!strcmp (cp, "yes"))	163	case KW_no: t->next_no = read_treasure (f); continue;
137	t->next_yes = load_treasure (fp, line);	164
138	else if (!strcmp (cp, "no"))	165	case KW_end:
139	t->next_no = load_treasure (fp, line);	166	f.next ();
140	else if (!strcmp (cp, "end"))
141	return t;
142	else if (!strcmp (cp, "more"))
143	{
144	t->next = load_treasure (fp, line);
145	return t;	167	return t;
146	}
147	else
148	LOG (llevError, "Unknown treasure-command: '%s', last entry %s, line %d\n", cp, &t->name, *line);
149	}
150	LOG (llevError, "treasure lacks 'end'.\n");
151	return t;
152	}
153		168
154	#ifdef TREASURE_DEBUG	169	case KW_more:
		170	t->next = read_treasure (f);
		171	return t;
155		172
156	/* recursived checks the linked list. Treasurelist is passed only	173	default:
157	* so that the treasure name can be printed out	174	if (!f.parse_error ("treasurelist", t->name))
158	*/	175	return 0;
159	static void
160	check_treasurelist (const treasure t, const treasurelist tl)
161	{
162	if (t->chance >= 100 && t->next_yes && (t->next \|\| t->next_no))
163	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
164	/* find_treasurelist will print out its own error message */
165	if (t->name && *t->name)
166	find_treasurelist (t->name);
167	if (t->next)
168	check_treasurelist (t->next, tl);
169	if (t->next_yes)
170	check_treasurelist (t->next_yes, tl);
171	if (t->next_no)
172	check_treasurelist (t->next_no, tl);
173	}
174	#endif
175		176
		177	return t;
		178	}
		179
		180	f.next ();
		181	}
		182	}
		183
176	/*	184	/*
177	* Opens LIBDIR/treasure and reads all treasure-declarations from it.
178	* Each treasure is parsed with the help of load_treasure().	185	* Each treasure is parsed with the help of load_treasure().
179	*/	186	*/
180		187	treasurelist *
181	void	188	treasurelist::read (object_thawer &f)
182	load_treasures (void)
183	{	189	{
184	FILE *fp;	190	assert (f.kw == KW_treasure \|\| f.kw == KW_treasureone);
185	char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];
186	treasurelist *previous = NULL;
187	treasure *t;
188	int comp, line = 0;
189		191
190	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	192	bool one = f.kw == KW_treasureone;
191	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	193	treasurelist *tl = treasurelist::get (f.get_str ());
192	{	194	clear (tl);
193	LOG (llevError, "Can't open treasure file.\n");	195	tl->items = read_treasure (f);
		196	if (!tl->items)
194	return;	197	return 0;
195	}
196	while (fgets (buf, MAX_BUF, fp) != NULL)
197	{
198	line++;
199	if (*buf == '#')
200	continue;
201		198
202	if (sscanf (buf, "treasureone %s\n", name) \|\| sscanf (buf, "treasure %s\n", name))
203	{
204	treasurelist *tl = get_empty_treasurelist ();
205
206	tl->name = name;
207	if (previous == NULL)
208	first_treasurelist = tl;
209	else
210	previous->next = tl;
211	previous = tl;
212	tl->items = load_treasure (fp, &line);
213
214	/* This is a one of the many items on the list should be generated.	199	/* This is a one of the many items on the list should be generated.
215	* Add up the chance total, and check to make sure the yes & no	200	* Add up the chance total, and check to make sure the yes & no
216	* fields of the treasures are not being used.	201	* fields of the treasures are not being used.
217	*/	202	*/
218	if (!strncmp (buf, "treasureone", 11))	203	tl->total_chance = 0;
		204
		205	if (one)
		206	{
		207	for (treasure *t = tl->items; t; t = t->next)
		208	{
		209	if (t->next_yes \|\| t->next_no)
219	{	210	{
220	for (t = tl->items; t != NULL; t = t->next)
221	{
222	#ifdef TREASURE_DEBUG
223	if (t->next_yes \|\| t->next_no)
224	{
225	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);	211	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);
226	LOG (llevError, " the next_yes or next_no field is set\n");	212	LOG (llevError, " the next_yes or next_no field is set\n");
227	}
228	#endif
229	tl->total_chance += t->chance;
230	}
231	}	213	}
232	}
233	else
234	LOG (llevError, "Treasure-list %s didn't understand: %s, line %d\n", filename, buf, line);
235	}
236	close_and_delete (fp, comp);
237		214
238	#ifdef TREASURE_DEBUG	215	tl->total_chance += t->chance;
239	/* Perform some checks on how valid the treasure data actually is.	216	}
240	* verify that list transitions work (ie, the list that it is supposed	217	}
241	* to transition to exists). Also, verify that at least the name
242	* or archetype is set for each treasure element.
243	*/
244	for (previous = first_treasurelist; previous != NULL; previous = previous->next)
245	check_treasurelist (previous->items, previous);
246	#endif
247	}
248		218
249	/*
250	* Searches for the given treasurelist in the globally linked list
251	* of treasurelists which has been built by load_treasures().
252	*/
253
254	treasurelist *
255	find_treasurelist (const char *name)
256	{
257	shstr_cmp name_ (name);
258
259	if (!name_)
260	return 0;
261
262	for (treasurelist *tl = first_treasurelist; tl != 0; tl = tl->next)
263	if (name_ == tl->name)
264	return tl;
265
266	if (first_treasurelist)
267	LOG (llevError, "Couldn't find treasurelist %s\n", name);
268
269	return 0;	219	return tl;
270	}	220	}
271
272		221
273	/*	222	/*
274	* Generates the objects specified by the given treasure.	223	* Generates the objects specified by the given treasure.
275	* It goes recursively through the rest of the linked list.	224	* It goes recursively through the rest of the linked list.
276	* If there is a certain percental chance for a treasure to be generated,	225	* If there is a certain percental chance for a treasure to be generated,
…		…
326		275
327	if (t->change_arch.slaying)	276	if (t->change_arch.slaying)
328	op->slaying = t->change_arch.slaying;	277	op->slaying = t->change_arch.slaying;
329	}	278	}
330		279
331	void	280	static void
332	create_all_treasures (treasure t, object op, int flag, int difficulty, int tries)	281	create_all_treasures (treasure t, object op, int flag, int difficulty, int tries)
333	{	282	{
334	object *tmp;
335
336	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)	283	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)
337	{	284	{
338	if (t->name)	285	if (t->name)
339	{	286	{
340	if (difficulty >= t->magic)	287	if (difficulty >= t->magic)
341	{
342	treasurelist *tl = find_treasurelist (t->name);	288	if (treasurelist *tl = treasurelist::find (t->name))
343	if (tl)
344	create_treasure (tl, op, flag, difficulty, tries);	289	create_treasure (tl, op, flag, difficulty, tries);
345	}	290	else
		291	LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
346	}	292	}
347	else	293	else
348	{	294	{
349	if (t->item && (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE)))	295	if (t->item && (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE)))
350	{	296	{
351	tmp = arch_to_object (t->item);	297	object *tmp = arch_to_object (t->item);
		298
352	if (t->nrof && tmp->nrof <= 1)	299	if (t->nrof && tmp->nrof <= 1)
353	tmp->nrof = rndm (t->nrof) + 1;	300	tmp->nrof = rndm (t->nrof) + 1;
354		301
355	fix_generated_item (tmp, op, difficulty, t->magic, flag);	302	fix_generated_item (tmp, op, difficulty, t->magic, flag);
356	change_treasure (t, tmp);	303	change_treasure (t, tmp);
357	put_treasure (tmp, op, flag);	304	put_treasure (tmp, op, flag);
358	}	305	}
359	}	306	}
360		307
361	if (t->next_yes != NULL)	308	if (t->next_yes)
362	create_all_treasures (t->next_yes, op, flag, difficulty, tries);	309	create_all_treasures (t->next_yes, op, flag, difficulty, tries);
363	}	310	}
364	else if (t->next_no != NULL)	311	else if (t->next_no)
365	create_all_treasures (t->next_no, op, flag, difficulty, tries);	312	create_all_treasures (t->next_no, op, flag, difficulty, tries);
366		313
367	if (t->next != NULL)	314	if (t->next)
368	create_all_treasures (t->next, op, flag, difficulty, tries);	315	create_all_treasures (t->next, op, flag, difficulty, tries);
369	}	316	}
370		317
371	void	318	static void
372	create_one_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)	319	create_one_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)
373	{	320	{
374	int value = rndm (tl->total_chance);	321	int value = rndm (tl->total_chance);
375	treasure *t;	322	treasure *t;
376		323
…		…
378	{	325	{
379	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");	326	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");
380	return;	327	return;
381	}	328	}
382		329
383	for (t = tl->items; t != NULL; t = t->next)	330	for (t = tl->items; t; t = t->next)
384	{	331	{
385	value -= t->chance;	332	value -= t->chance;
386		333
387	if (value < 0)	334	if (value < 0)
388	break;	335	break;
389	}	336	}
390		337
391	if (!t \|\| value >= 0)	338	if (!t \|\| value >= 0)
392	{
393	LOG (llevError, "create_one_treasure: got null object or not able to find treasure\n");	339	cleanup ("create_one_treasure: got null object or not able to find treasure\n", 1);
394	abort ();
395	return;
396	}
397		340
398	if (t->name)	341	if (t->name)
399	{	342	{
400	if (difficulty >= t->magic)	343	if (difficulty >= t->magic)
401	{	344	{
402	treasurelist *tl = find_treasurelist (t->name);	345	treasurelist *tl = treasurelist::find (t->name);
403	if (tl)	346	if (tl)
404	create_treasure (tl, op, flag, difficulty, tries);	347	create_treasure (tl, op, flag, difficulty, tries);
405	}	348	}
406	else if (t->nrof)	349	else if (t->nrof)
407	create_one_treasure (tl, op, flag, difficulty, tries);	350	create_one_treasure (tl, op, flag, difficulty, tries);
408
409	return;
410	}	351	}
411
412	if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))	352	else if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))
413	{	353	{
414	object *tmp = arch_to_object (t->item);	354	if (object *tmp = arch_to_object (t->item))
415		355	{
416	if (!tmp)
417	return;
418
419	if (t->nrof && tmp->nrof <= 1)	356	if (t->nrof && tmp->nrof <= 1)
420	tmp->nrof = rndm (t->nrof) + 1;	357	tmp->nrof = rndm (t->nrof) + 1;
421		358
422	fix_generated_item (tmp, op, difficulty, t->magic, flag);	359	fix_generated_item (tmp, op, difficulty, t->magic, flag);
423	change_treasure (t, tmp);	360	change_treasure (t, tmp);
424	put_treasure (tmp, op, flag);	361	put_treasure (tmp, op, flag);
		362	}
425	}	363	}
426	}	364	}
427		365
428	/* This calls the appropriate treasure creation function. tries is passed	366	/* This calls the appropriate treasure creation function. tries is passed
429	* to determine how many list transitions or attempts to create treasure	367	* to determine how many list transitions or attempts to create treasure
…		…
433	* to do that.	371	* to do that.
434	*/	372	*/
435	void	373	void
436	create_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)	374	create_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)
437	{	375	{
		376	// empty treasurelists are legal
		377	if (!tl->items)
		378	return;
438		379
439	if (tries++ > 100)	380	if (tries++ > 100)
440	{	381	{
441	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	382	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
442	return;	383	return;
443	}	384	}
		385
444	if (tl->total_chance)	386	if (tl->total_chance)
445	create_one_treasure (tl, op, flag, difficulty, tries);	387	create_one_treasure (tl, op, flag, difficulty, tries);
446	else	388	else
447	create_all_treasures (tl->items, op, flag, difficulty, tries);	389	create_all_treasures (tl->items, op, flag, difficulty, tries);
448	}	390	}
…		…
480	* magical bonus "wanted".	422	* magical bonus "wanted".
481	*/	423	*/
482		424
483	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	425	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
484		426
485	/chance of magic difficulty/	427	// chance of magic difficulty
486
487	/* +0 +1 +2 +3 +4 */	428	// +0 +1 +2 +3 +4
488	{95, 2, 2, 1, 0}, /1 /	429	{95, 2, 2, 1, 0}, // 1
489	{92, 5, 2, 1, 0}, /2 /	430	{92, 5, 2, 1, 0}, // 2
490	{85, 10, 4, 1, 0}, /3 /	431	{85, 10, 4, 1, 0}, // 3
491	{80, 14, 4, 2, 0}, /4 /	432	{80, 14, 4, 2, 0}, // 4
492	{75, 17, 5, 2, 1}, /5 /	433	{75, 17, 5, 2, 1}, // 5
493	{70, 18, 8, 3, 1}, /6 /	434	{70, 18, 8, 3, 1}, // 6
494	{65, 21, 10, 3, 1}, /7 /	435	{65, 21, 10, 3, 1}, // 7
495	{60, 22, 12, 4, 2}, /8 /	436	{60, 22, 12, 4, 2}, // 8
496	{55, 25, 14, 4, 2}, /9 /	437	{55, 25, 14, 4, 2}, // 9
497	{50, 27, 16, 5, 2}, /10 /	438	{50, 27, 16, 5, 2}, // 10
498	{45, 28, 18, 6, 3}, /11 /	439	{45, 28, 18, 6, 3}, // 11
499	{42, 28, 20, 7, 3}, /12 /	440	{42, 28, 20, 7, 3}, // 12
500	{40, 27, 21, 8, 4}, /13 /	441	{40, 27, 21, 8, 4}, // 13
501	{38, 25, 22, 10, 5}, /14 /	442	{38, 25, 22, 10, 5}, // 14
502	{36, 23, 23, 12, 6}, /15 /	443	{36, 23, 23, 12, 6}, // 15
503	{33, 21, 24, 14, 8}, /16 /	444	{33, 21, 24, 14, 8}, // 16
504	{31, 19, 25, 16, 9}, /17 /	445	{31, 19, 25, 16, 9}, // 17
505	{27, 15, 30, 18, 10}, /18 /	446	{27, 15, 30, 18, 10}, // 18
506	{20, 12, 30, 25, 13}, /19 /	447	{20, 12, 30, 25, 13}, // 19
507	{15, 10, 28, 30, 17}, /20 /	448	{15, 10, 28, 30, 17}, // 20
508	{13, 9, 27, 28, 23}, /21 /	449	{13, 9, 27, 28, 23}, // 21
509	{10, 8, 25, 28, 29}, /22 /	450	{10, 8, 25, 28, 29}, // 22
510	{8, 7, 23, 26, 36}, /23 /	451	{ 8, 7, 23, 26, 36}, // 23
511	{6, 6, 20, 22, 46}, /24 /	452	{ 6, 6, 20, 22, 46}, // 24
512	{4, 5, 17, 18, 56}, /25 /	453	{ 4, 5, 17, 18, 56}, // 25
513	{2, 4, 12, 14, 68}, /26 /	454	{ 2, 4, 12, 14, 68}, // 26
514	{0, 3, 7, 10, 80}, /27 /	455	{ 0, 3, 7, 10, 80}, // 27
515	{0, 0, 3, 7, 90}, /28 /	456	{ 0, 0, 3, 7, 90}, // 28
516	{0, 0, 0, 3, 97}, /29 /	457	{ 0, 0, 0, 3, 97}, // 29
517	{0, 0, 0, 0, 100}, /30 /	458	{ 0, 0, 0, 0, 100}, // 30
518	{0, 0, 0, 0, 100}, /31 /	459	{ 0, 0, 0, 0, 100}, // 31
519	};	460	};
520		461
521		462
522	/* calculate the appropriate level for wands staves and scrolls.	463	/* calculate the appropriate level for wands staves and scrolls.
523	* This code presumes that op has had its spell object created (in op->inv)	464	* This code presumes that op has had its spell object created (in op->inv)
…		…
556	* elmex Thu Aug 10 18:45:44 CEST 2006:	497	* elmex Thu Aug 10 18:45:44 CEST 2006:
557	* Scaling difficulty by max_level, as difficulty is a level and not some	498	* Scaling difficulty by max_level, as difficulty is a level and not some
558	* weird integer between 1-31.	499	* weird integer between 1-31.
559	*	500	*
560	*/	501	*/
561
562	int	502	int
563	magic_from_difficulty (int difficulty)	503	magic_from_difficulty (int difficulty)
564	{	504	{
565	int percent = 0, magic = 0;	505	int percent = 0, magic = 0;
566	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	506	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
…		…
654	* 1) Since rings can have multiple bonuses, if the same bonus	594	* 1) Since rings can have multiple bonuses, if the same bonus
655	* is rolled again, increase it - the bonuses now stack with	595	* is rolled again, increase it - the bonuses now stack with
656	* other bonuses previously rolled and ones the item might natively have.	596	* other bonuses previously rolled and ones the item might natively have.
657	* 2) Add code to deal with new PR method.	597	* 2) Add code to deal with new PR method.
658	*/	598	*/
659
660	void	599	void
661	set_ring_bonus (object *op, int bonus)	600	set_ring_bonus (object *op, int bonus)
662	{	601	{
663		602
664	int r = rndm (bonus > 0 ? 25 : 11);	603	int r = rndm (bonus > 0 ? 25 : 11);
…		…
831	* value.	770	* value.
832	* GT_MINIMAL: Does minimal processing on the object - just enough to make it	771	* GT_MINIMAL: Does minimal processing on the object - just enough to make it
833	* a working object - don't change magic, value, etc, but set it material	772	* a working object - don't change magic, value, etc, but set it material
834	* type as appropriate, for objects that need spell objects, set those, etc	773	* type as appropriate, for objects that need spell objects, set those, etc
835	*/	774	*/
836
837	void	775	void
838	fix_generated_item (object op, object creator, int difficulty, int max_magic, int flags)	776	fix_generated_item (object op, object creator, int difficulty, int max_magic, int flags)
839	{	777	{
840	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;	778	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;
841		779
…		…
848		786
849	if (op->randomitems && op->type != SPELL)	787	if (op->randomitems && op->type != SPELL)
850	{	788	{
851	create_treasure (op->randomitems, op, flags, difficulty, 0);	789	create_treasure (op->randomitems, op, flags, difficulty, 0);
852	if (!op->inv)	790	if (!op->inv)
853	LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", &op->name);	791	LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", op->debug_desc ());
854		792
855	/* So the treasure doesn't get created again */	793	/* So the treasure doesn't get created again */
856	op->randomitems = NULL;	794	op->randomitems = 0;
857	}	795	}
858		796
859	if (difficulty < 1)	797	if (difficulty < 1)
860	difficulty = 1;	798	difficulty = 1;
861		799
…		…
1174	*/	1112	*/
1175		1113
1176	/*	1114	/*
1177	* Allocate and return the pointer to an empty artifactlist structure.	1115	* Allocate and return the pointer to an empty artifactlist structure.
1178	*/	1116	*/
1179
1180	static artifactlist *	1117	static artifactlist *
1181	get_empty_artifactlist (void)	1118	get_empty_artifactlist (void)
1182	{	1119	{
1183	artifactlist al = (artifactlist ) malloc (sizeof (artifactlist));	1120	return salloc0 <artifactlist> ();
1184
1185	if (al == NULL)
1186	fatal (OUT_OF_MEMORY);
1187	al->next = NULL;
1188	al->items = NULL;
1189	al->total_chance = 0;
1190	return al;
1191	}	1121	}
1192		1122
1193	/*	1123	/*
1194	* Allocate and return the pointer to an empty artifact structure.	1124	* Allocate and return the pointer to an empty artifact structure.
1195	*/	1125	*/
1196
1197	static artifact *	1126	static artifact *
1198	get_empty_artifact (void)	1127	get_empty_artifact (void)
1199	{	1128	{
1200	artifact a = (artifact ) malloc (sizeof (artifact));	1129	return salloc0 <artifact> ();
1201
1202	if (a == NULL)
1203	fatal (OUT_OF_MEMORY);
1204	a->item = NULL;
1205	a->next = NULL;
1206	a->chance = 0;
1207	a->difficulty = 0;
1208	a->allowed = NULL;
1209	return a;
1210	}	1130	}
1211		1131
1212	/*	1132	/*
1213	* Searches the artifact lists and returns one that has the same type	1133	* Searches the artifact lists and returns one that has the same type
1214	* of objects on it.	1134	* of objects on it.
1215	*/	1135	*/
1216
1217	artifactlist *	1136	artifactlist *
1218	find_artifactlist (int type)	1137	find_artifactlist (int type)
1219	{	1138	{
1220	artifactlist *al;
1221
1222	for (al = first_artifactlist; al != NULL; al = al->next)	1139	for (artifactlist *al = first_artifactlist; al; al = al->next)
1223	if (al->type == type)	1140	if (al->type == type)
1224	return al;	1141	return al;
		1142
1225	return NULL;	1143	return 0;
1226	}	1144	}
1227		1145
1228	/*	1146	/*
1229	* For debugging purposes. Dumps all tables.	1147	* For debugging purposes. Dumps all tables.
1230	*/	1148	*/
1231
1232	void	1149	void
1233	dump_artifacts (void)	1150	dump_artifacts (void)
1234	{	1151	{
1235	artifactlist *al;	1152	artifactlist *al;
1236	artifact *art;	1153	artifact *art;
…		…
1243	for (art = al->items; art != NULL; art = art->next)	1160	for (art = al->items; art != NULL; art = art->next)
1244	{	1161	{
1245	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);	1162	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1246	if (art->allowed != NULL)	1163	if (art->allowed != NULL)
1247	{	1164	{
1248	fprintf (logfile, "\tAllowed combinations:");	1165	fprintf (logfile, "\tallowed combinations:");
1249	for (next = art->allowed; next != NULL; next = next->next)	1166	for (next = art->allowed; next != NULL; next = next->next)
1250	fprintf (logfile, "%s,", &next->name);	1167	fprintf (logfile, "%s,", &next->name);
1251	fprintf (logfile, "\n");	1168	fprintf (logfile, "\n");
1252	}	1169	}
1253	}	1170	}
…		…
1264	treasurelist *tl;	1181	treasurelist *tl;
1265	int i;	1182	int i;
1266		1183
1267	if (depth > 100)	1184	if (depth > 100)
1268	return;	1185	return;
		1186
1269	while (t)	1187	while (t)
1270	{	1188	{
1271	if (t->name)	1189	if (t->name)
1272	{	1190	{
1273	for (i = 0; i < depth; i++)	1191	for (i = 0; i < depth; i++)
1274	fprintf (logfile, " ");	1192	fprintf (logfile, " ");
		1193
1275	fprintf (logfile, "{ (list: %s)\n", &t->name);	1194	fprintf (logfile, "{ (list: %s)\n", &t->name);
		1195
1276	tl = find_treasurelist (t->name);	1196	tl = treasurelist::find (t->name);
1277	if (tl)	1197	if (tl)
1278	dump_monster_treasure_rec (name, tl->items, depth + 2);	1198	dump_monster_treasure_rec (name, tl->items, depth + 2);
		1199
1279	for (i = 0; i < depth; i++)	1200	for (i = 0; i < depth; i++)
1280	fprintf (logfile, " ");	1201	fprintf (logfile, " ");
		1202
1281	fprintf (logfile, "} (end of list: %s)\n", &t->name);	1203	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1282	}	1204	}
1283	else	1205	else
1284	{	1206	{
1285	for (i = 0; i < depth; i++)	1207	for (i = 0; i < depth; i++)
1286	fprintf (logfile, " ");	1208	fprintf (logfile, " ");
		1209
1287	if (t->item && t->item->clone.type == FLESH)	1210	if (t->item && t->item->clone.type == FLESH)
1288	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);	1211	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1289	else	1212	else
1290	fprintf (logfile, "%s\n", &t->item->clone.name);	1213	fprintf (logfile, "%s\n", &t->item->clone.name);
1291	}	1214	}
1292		1215
1293	if (t->next_yes)	1216	if (t->next_yes)
1294	{	1217	{
1295	for (i = 0; i < depth; i++)	1218	for (i = 0; i < depth; i++)
1296	fprintf (logfile, " ");	1219	fprintf (logfile, " ");
		1220
1297	fprintf (logfile, " (if yes)\n");	1221	fprintf (logfile, " (if yes)\n");
1298	dump_monster_treasure_rec (name, t->next_yes, depth + 1);	1222	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1299	}	1223	}
1300		1224
1301	if (t->next_no)	1225	if (t->next_no)
1302	{	1226	{
1303	for (i = 0; i < depth; i++)	1227	for (i = 0; i < depth; i++)
1304	fprintf (logfile, " ");	1228	fprintf (logfile, " ");
		1229
1305	fprintf (logfile, " (if no)\n");	1230	fprintf (logfile, " (if no)\n");
1306	dump_monster_treasure_rec (name, t->next_no, depth + 1);	1231	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1307	}	1232	}
1308		1233
1309	t = t->next;	1234	t = t->next;
…		…
1312		1237
1313	/*	1238	/*
1314	* For debugging purposes. Dumps all treasures for a given monster.	1239	* For debugging purposes. Dumps all treasures for a given monster.
1315	* Created originally by Raphael Quinet for debugging the alchemy code.	1240	* Created originally by Raphael Quinet for debugging the alchemy code.
1316	*/	1241	*/
1317
1318	void	1242	void
1319	dump_monster_treasure (const char *name)	1243	dump_monster_treasure (const char *name)
1320	{	1244	{
1321	archetype *at;	1245	archetype *at;
1322	int found;	1246	int found;
1323		1247
1324	found = 0;	1248	found = 0;
1325	fprintf (logfile, "\n");	1249	fprintf (logfile, "\n");
		1250
1326	for (at = first_archetype; at != NULL; at = at->next)	1251	for (at = first_archetype; at != NULL; at = at->next)
1327	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)	1252	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1328	{	1253	{
1329	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);	1254	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1330	if (at->clone.randomitems != NULL)	1255	if (at->clone.randomitems != NULL)
1331	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);	1256	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1332	else	1257	else
1333	fprintf (logfile, "(nothing)\n");	1258	fprintf (logfile, "(nothing)\n");
		1259
1334	fprintf (logfile, "\n");	1260	fprintf (logfile, "\n");
1335	found++;	1261	found++;
1336	}	1262	}
		1263
1337	if (found == 0)	1264	if (found == 0)
1338	fprintf (logfile, "No objects have the name %s!\n\n", name);	1265	fprintf (logfile, "No objects have the name %s!\n\n", name);
1339	}	1266	}
1340		1267
1341	/*	1268	/*
1342	* Builds up the lists of artifacts from the file in the libdir.	1269	* Builds up the lists of artifacts from the file in the libdir.
1343	*/	1270	*/
1344
1345	void	1271	void
1346	init_artifacts (void)	1272	init_artifacts (void)
1347	{	1273	{
1348	static int has_been_inited = 0;	1274	static int has_been_inited = 0;
1349	char filename[MAX_BUF], buf[HUGE_BUF], cp, next;	1275	char filename[MAX_BUF];
1350	artifact *art = NULL;	1276	artifact *art = NULL;
1351	linked_char *tmp;
1352	int value;
1353	artifactlist *al;	1277	artifactlist *al;
1354		1278
1355	if (has_been_inited)	1279	if (has_been_inited)
1356	return;	1280	return;
1357	else	1281	else
1358	has_been_inited = 1;	1282	has_been_inited = 1;
1359		1283
1360	sprintf (filename, "%s/artifacts", settings.datadir);	1284	sprintf (filename, "%s/artifacts", settings.datadir);
1361	object_thawer thawer (filename);	1285	object_thawer f (filename);
1362		1286
1363	if (!thawer)	1287	if (!f)
1364	return;	1288	return;
1365		1289
1366	while (fgets (buf, HUGE_BUF, thawer) != NULL)	1290	f.next ();
1367	{
1368	if (*buf == '#')
1369	continue;
1370	if ((cp = strchr (buf, '\n')) != NULL)
1371	*cp = '\0';
1372	cp = buf;
1373	while (cp == ' ') / Skip blanks */
1374	cp++;
1375	if (*cp == '\0')
1376	continue;
1377		1291
1378	if (!strncmp (cp, "Allowed", 7))	1292	for (;;)
		1293	{
		1294	switch (f.kw)
1379	{	1295	{
		1296	case KW_allowed:
1380	if (art == NULL)	1297	if (!art)
		1298	art = get_empty_artifact ();
		1299
1381	{	1300	{
1382	art = get_empty_artifact ();	1301	if (!strcmp (f.get_str (), "all"))
1383	nrofartifacts++;	1302	break;
		1303
		1304	char next, cp = f.get_str ();
		1305
		1306	do
		1307	{
		1308	if ((next = strchr (cp, ',')))
		1309	*next++ = '\0';
		1310
		1311	linked_char *tmp = new linked_char;
		1312
		1313	tmp->name = cp;
		1314	tmp->next = art->allowed;
		1315	art->allowed = tmp;
		1316	}
		1317	while ((cp = next));
1384	}	1318	}
1385	cp = strchr (cp, ' ') + 1;	1319	break;
1386	if (!strcmp (cp, "all"))	1320
		1321	case KW_chance:
		1322	f.get (art->chance);
		1323	break;
		1324
		1325	case KW_difficulty:
		1326	f.get (art->difficulty);
		1327	break;
		1328
		1329	case KW_object:
		1330	{
		1331	art->item = object::create ();
		1332
		1333	if (!art->item->parse_kv (f))
		1334	LOG (llevError, "Init_Artifacts: Could not load object.\n");
		1335
		1336	al = find_artifactlist (art->item->type);
		1337
		1338	if (!al)
		1339	{
		1340	al = get_empty_artifactlist ();
		1341	al->type = art->item->type;
		1342	al->next = first_artifactlist;
		1343	first_artifactlist = al;
		1344	}
		1345
		1346	art->next = al->items;
		1347	al->items = art;
		1348	art = 0;
		1349	}
1387	continue;	1350	continue;
1388		1351
1389	do	1352	case KW_EOF:
		1353	goto done;
		1354
		1355	default:
		1356	if (!f.parse_error ("artifacts file"))
		1357	cleanup ("artifacts file required");
1390	{	1358	break;
1391	nrofallowedstr++;
1392	if ((next = strchr (cp, ',')) != NULL)
1393	*(next++) = '\0';
1394	tmp = new linked_char;
1395
1396	tmp->name = cp;
1397	tmp->next = art->allowed;
1398	art->allowed = tmp;
1399	}
1400	while ((cp = next) != NULL);
1401	}
1402	else if (sscanf (cp, "chance %d", &value))
1403	art->chance = (uint16) value;
1404	else if (sscanf (cp, "difficulty %d", &value))
1405	art->difficulty = (uint8) value;
1406	else if (!strncmp (cp, "Object", 6))
1407	{	1359	}
1408	art->item = object::create ();
1409		1360
1410	if (!load_object (thawer, art->item, 0))	1361	f.next ();
1411	LOG (llevError, "Init_Artifacts: Could not load object.\n");
1412
1413	art->item->name = strchr (cp, ' ') + 1;
1414	al = find_artifactlist (art->item->type);
1415	if (al == NULL)
1416	{
1417	al = get_empty_artifactlist ();
1418	al->type = art->item->type;
1419	al->next = first_artifactlist;
1420	first_artifactlist = al;
1421	}
1422	art->next = al->items;
1423	al->items = art;
1424	art = NULL;
1425	}
1426	else
1427	LOG (llevError, "Unknown input in artifact file: %s\n", buf);
1428	}	1362	}
1429		1363
		1364	done:
1430	for (al = first_artifactlist; al != NULL; al = al->next)	1365	for (al = first_artifactlist; al; al = al->next)
1431	{	1366	{
		1367	al->total_chance = 0;
		1368
1432	for (art = al->items; art != NULL; art = art->next)	1369	for (art = al->items; art; art = art->next)
1433	{	1370	{
1434	if (!art->chance)	1371	if (!art->chance)
1435	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1372	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1436	else	1373	else
1437	al->total_chance += art->chance;	1374	al->total_chance += art->chance;
…		…
1442	}	1379	}
1443		1380
1444	LOG (llevDebug, "done.\n");	1381	LOG (llevDebug, "done.\n");
1445	}	1382	}
1446		1383
1447
1448	/*	1384	/*
1449	* Used in artifact generation. The bonuses of the first object	1385	* Used in artifact generation. The bonuses of the first object
1450	* is modified by the bonuses of the second object.	1386	* is modified by the bonuses of the second object.
1451	*/	1387	*/
1452
1453	void	1388	void
1454	add_abilities (object op, object change)	1389	add_abilities (object op, object change)
1455	{	1390	{
1456	int i, tmp;	1391	int i, tmp;
1457		1392
1458	if (change->face != blank_face)	1393	if (change->face != blank_face)
1459	{	1394	{
1460	#ifdef TREASURE_VERBOSE	1395	#ifdef TREASURE_VERBOSE
1461	LOG (llevDebug, "FACE: %d\n", change->face->number);	1396	LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1462	#endif	1397	#endif
1463	op->face = change->face;	1398	op->face = change->face;
1464	}	1399	}
1465		1400
1466	for (i = 0; i < NUM_STATS; i++)	1401	for (i = 0; i < NUM_STATS; i++)
…		…
1647	if (art->allowed == (linked_char *) NULL)	1582	if (art->allowed == (linked_char *) NULL)
1648	return 1; /* Ie, "all" */	1583	return 1; /* Ie, "all" */
1649	for (tmp = art->allowed; tmp; tmp = tmp->next)	1584	for (tmp = art->allowed; tmp; tmp = tmp->next)
1650	{	1585	{
1651	#ifdef TREASURE_VERBOSE	1586	#ifdef TREASURE_VERBOSE
1652	LOG (llevDebug, "legal_art: %s\n", tmp->name);	1587	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1653	#endif	1588	#endif
1654	if (*tmp->name == '!')	1589	if (*tmp->name == '!')
1655	name = tmp->name + 1, neg = 1;	1590	name = tmp->name + 1, neg = 1;
1656	else	1591	else
1657	name = tmp->name, neg = 0;	1592	name = tmp->name, neg = 0;
…		…
1752	continue;	1687	continue;
1753		1688
1754	if (!legal_artifact_combination (op, art))	1689	if (!legal_artifact_combination (op, art))
1755	{	1690	{
1756	#ifdef TREASURE_VERBOSE	1691	#ifdef TREASURE_VERBOSE
1757	LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name);	1692	LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1758	#endif	1693	#endif
1759	continue;	1694	continue;
1760	}	1695	}
		1696
1761	give_artifact_abilities (op, art->item);	1697	give_artifact_abilities (op, art->item);
1762	return;	1698	return;
1763	}	1699	}
1764	}	1700	}
1765		1701
…		…
1809	SET_FLAG (item, FLAG_NO_STEAL);	1745	SET_FLAG (item, FLAG_NO_STEAL);
1810	}	1746	}
1811	}	1747	}
1812		1748
1813	/* special_potion() - so that old potion code is still done right. */	1749	/* special_potion() - so that old potion code is still done right. */
1814
1815	int	1750	int
1816	special_potion (object *op)	1751	special_potion (object *op)
1817	{	1752	{
1818	if (op->attacktype)	1753	if (op->attacktype)
1819	return 1;	1754	return 1;
…		…
1829	}	1764	}
1830		1765
1831	void	1766	void
1832	free_treasurestruct (treasure *t)	1767	free_treasurestruct (treasure *t)
1833	{	1768	{
1834	if (t->next)
1835	free_treasurestruct (t->next);	1769	if (t->next) free_treasurestruct (t->next);
1836	if (t->next_yes)
1837	free_treasurestruct (t->next_yes);	1770	if (t->next_yes) free_treasurestruct (t->next_yes);
1838	if (t->next_no)
1839	free_treasurestruct (t->next_no);	1771	if (t->next_no) free_treasurestruct (t->next_no);
1840		1772
1841	delete t;	1773	delete t;
1842	}	1774	}
1843		1775
1844	void	1776	void
…		…
1849		1781
1850	delete lc;	1782	delete lc;
1851	}	1783	}
1852		1784
1853	void	1785	void
1854	free_artifact (artifact * at)	1786	free_artifact (artifact *at)
1855	{	1787	{
1856	if (at->next)
1857	free_artifact (at->next);	1788	if (at->next) free_artifact (at->next);
1858
1859	if (at->allowed)
1860	free_charlinks (at->allowed);	1789	if (at->allowed) free_charlinks (at->allowed);
1861		1790
1862	at->item->destroy (1);	1791	at->item->destroy (1);
1863		1792
1864	delete at;	1793	sfree (at);
1865	}	1794	}
1866		1795
1867	void	1796	void
1868	free_artifactlist (artifactlist * al)	1797	free_artifactlist (artifactlist *al)
1869	{	1798	{
1870	artifactlist *nextal;	1799	artifactlist *nextal;
1871		1800
1872	for (al = first_artifactlist; al; al = nextal)	1801	for (al = first_artifactlist; al; al = nextal)
1873	{	1802	{
1874	nextal = al->next;	1803	nextal = al->next;
1875		1804
1876	if (al->items)	1805	if (al->items)
1877	free_artifact (al->items);	1806	free_artifact (al->items);
1878		1807
1879	free (al);	1808	sfree (al);
1880	}	1809	}
1881	}	1810	}
1882		1811
1883	void	1812	void
1884	free_all_treasures (void)	1813	free_all_treasures (void)
1885	{	1814	{
1886	treasurelist tl, next;	1815	treasurelist tl, next;
1887		1816
1888
1889	for (tl = first_treasurelist; tl != NULL; tl = next)	1817	for (tl = first_treasurelist; tl; tl = next)
1890	{	1818	{
		1819	clear (tl);
		1820
1891	next = tl->next;	1821	next = tl->next;
1892	if (tl->items)
1893	free_treasurestruct (tl->items);
1894	delete tl;	1822	delete tl;
1895	}	1823	}
		1824
1896	free_artifactlist (first_artifactlist);	1825	free_artifactlist (first_artifactlist);
1897	}	1826	}

Diff Legend

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

Comparing deliantra/server/common/treasure.C (file contents): Revision 1.36 by root, Wed Feb 7 02:04:46 2007 UTC vs. Revision 1.48 by root, Tue Apr 17 18:40:31 2007 UTC

Diff Legend

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.36 by root, Wed Feb 7 02:04:46 2007 UTC vs.
Revision 1.48 by root, Tue Apr 17 18:40:31 2007 UTC