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

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.29 by root, Tue Dec 26 20:04:09 2006 UTC vs.
Revision 1.42 by root, Mon Apr 16 10:14:25 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
183	load_treasures (void)	210	load_treasures ()
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
		215	char filename[MAX_BUF];
191	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	216	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);
192	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	217
		218	object_thawer f (filename);
		219
		220	if (!f)
193	{	221	{
194	LOG (llevError, "Can't open treasure file.\n");	222	LOG (llevError, "Can't open treasure file.\n");
195	return;	223	return false;
196	}
197	while (fgets (buf, MAX_BUF, fp) != NULL)
198	{	224	}
199	line++;
200	if (*buf == '#')
201	continue;
202		225
203	if (sscanf (buf, "treasureone %s\n", name) \|\| sscanf (buf, "treasure %s\n", name))	226	f.next ();
204	{
205	treasurelist *tl = get_empty_treasurelist ();
206		227
207	tl->name = name;	228	for (;;)
208	if (previous == NULL)	229	{
209	first_treasurelist = tl;	230	switch (f.kw)
210	else	231	{
211	previous->next = tl;	232	case KW_treasure:
212	previous = tl;	233	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	{	234	{
221	for (t = tl->items; t != NULL; t = t->next)	235	bool one = f.kw == KW_treasureone;
		236	treasurelist *tl = treasurelist::get (f.get_str ());
		237
		238	clear (tl);
		239	tl->items = load_treasure (f);
		240
		241	if (!tl->items)
		242	return false;
		243
		244	/* This is a one of the many items on the list should be generated.
		245	* Add up the chance total, and check to make sure the yes & no
		246	* fields of the treasures are not being used.
		247	*/
		248	if (one)
222	{	249	{
		250	for (t = tl->items; t; t = t->next)
		251	{
223	#ifdef TREASURE_DEBUG	252	#ifdef TREASURE_DEBUG
224	if (t->next_yes \|\| t->next_no)	253	if (t->next_yes \|\| t->next_no)
225	{	254	{
226	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);	255	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");	256	LOG (llevError, " the next_yes or next_no field is set\n");
		257	}
		258	#endif
		259	tl->total_chance += t->chance;
228	}	260	}
229	#endif
230	tl->total_chance += t->chance;
231	}	261	}
232	}	262	}
233	}	263	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		264
		265	case KW_EOF:
239	#ifdef TREASURE_DEBUG	266	#ifdef TREASURE_DEBUG
240	/* Perform some checks on how valid the treasure data actually is.	267	/* Perform some checks on how valid the treasure data actually is.
241	* verify that list transitions work (ie, the list that it is supposed	268	* verify that list transitions work (ie, the list that it is supposed
242	* to transition to exists). Also, verify that at least the name	269	* to transition to exists). Also, verify that at least the name
243	* or archetype is set for each treasure element.	270	* or archetype is set for each treasure element.
244	*/	271	*/
245	for (previous = first_treasurelist; previous != NULL; previous = previous->next)	272	for (treasurelist *tl = first_treasurelist; tl; tl = tl->next)
246	check_treasurelist (previous->items, previous);	273	check_treasurelist (tl->items, tl);
247	#endif	274	#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;	275	return true;
266		276
267	if (first_treasurelist)	277	default:
268	LOG (llevError, "Couldn't find treasurelist %s\n", name);	278	if (!f.parse_error ("treasure lists"))
		279	return false;
269		280
270	return 0;	281	break;
271	}	282	}
272		283
		284	f.next ();
		285	}
		286	}
273		287
274	/*	288	/*
275	* Generates the objects specified by the given treasure.	289	* Generates the objects specified by the given treasure.
276	* It goes recursively through the rest of the linked list.	290	* It goes recursively through the rest of the linked list.
277	* If there is a certain percental chance for a treasure to be generated,	291	* If there is a certain percental chance for a treasure to be generated,
327		341
328	if (t->change_arch.slaying)	342	if (t->change_arch.slaying)
329	op->slaying = t->change_arch.slaying;	343	op->slaying = t->change_arch.slaying;
330	}	344	}
331		345
332	void	346	static void
333	create_all_treasures (treasure t, object op, int flag, int difficulty, int tries)	347	create_all_treasures (treasure t, object op, int flag, int difficulty, int tries)
334	{	348	{
335	object *tmp;
336
337	if ((int) t->chance >= 100 \|\| (RANDOM () % 100 + 1) < (int) t->chance)	349	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)
338	{	350	{
339	if (t->name)	351	if (t->name)
340	{	352	{
341	if (strcmp (t->name, "NONE") && difficulty >= t->magic)	353	if (difficulty >= t->magic)
		354	create_treasure (treasurelist::find (t->name), op, flag, difficulty, tries);
		355	}
		356	else
		357	{
		358	if (t->item && (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE)))
342	{	359	{
343	treasurelist *tl = find_treasurelist (t->name);
344	if (tl)
345	create_treasure (tl, op, flag, difficulty, tries);
346	}
347	}
348	else
349	{
350	if (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE))
351	{
352	tmp = arch_to_object (t->item);	360	object *tmp = arch_to_object (t->item);
		361
353	if (t->nrof && tmp->nrof <= 1)	362	if (t->nrof && tmp->nrof <= 1)
354	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	363	tmp->nrof = rndm (t->nrof) + 1;
		364
355	fix_generated_item (tmp, op, difficulty, t->magic, flag);	365	fix_generated_item (tmp, op, difficulty, t->magic, flag);
356	change_treasure (t, tmp);	366	change_treasure (t, tmp);
357	put_treasure (tmp, op, flag);	367	put_treasure (tmp, op, flag);
358	}	368	}
359	}	369	}
360		370
361	if (t->next_yes != NULL)	371	if (t->next_yes)
362	create_all_treasures (t->next_yes, op, flag, difficulty, tries);	372	create_all_treasures (t->next_yes, op, flag, difficulty, tries);
363	}	373	}
364	else if (t->next_no != NULL)	374	else if (t->next_no)
365	create_all_treasures (t->next_no, op, flag, difficulty, tries);	375	create_all_treasures (t->next_no, op, flag, difficulty, tries);
366		376
367	if (t->next != NULL)	377	if (t->next)
368	create_all_treasures (t->next, op, flag, difficulty, tries);	378	create_all_treasures (t->next, op, flag, difficulty, tries);
369	}	379	}
370		380
371	void	381	static void
372	create_one_treasure (treasurelist * tl, object *op, int flag, int difficulty, int tries)	382	create_one_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)
373	{	383	{
374	int value = RANDOM () % tl->total_chance;	384	int value = rndm (tl->total_chance);
375	treasure *t;	385	treasure *t;
376		386
377	if (tries++ > 100)	387	if (tries++ > 100)
378	{	388	{
379	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");	389	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");
380	return;	390	return;
381	}	391	}
382		392
383	for (t = tl->items; t != NULL; t = t->next)	393	for (t = tl->items; t; t = t->next)
384	{	394	{
385	value -= t->chance;	395	value -= t->chance;
386		396
387	if (value < 0)	397	if (value < 0)
388	break;	398	break;
389	}	399	}
390		400
391	if (!t \|\| value >= 0)	401	if (!t \|\| value >= 0)
392	{
393	LOG (llevError, "create_one_treasure: got null object or not able to find treasure\n");	402	cleanup ("create_one_treasure: got null object or not able to find treasure\n", 1);
394	abort ();
395	return;
396	}
397		403
398	if (t->name)	404	if (t->name)
399	{	405	{
400	if (!strcmp (t->name, "NONE"))
401	return;
402
403	if (difficulty >= t->magic)	406	if (difficulty >= t->magic)
404	{	407	{
405	treasurelist *tl = find_treasurelist (t->name);	408	treasurelist *tl = treasurelist::find (t->name);
406	if (tl)	409	if (tl)
407	create_treasure (tl, op, flag, difficulty, tries);	410	create_treasure (tl, op, flag, difficulty, tries);
408	}	411	}
409	else if (t->nrof)	412	else if (t->nrof)
410	create_one_treasure (tl, op, flag, difficulty, tries);	413	create_one_treasure (tl, op, flag, difficulty, tries);
411
412	return;
413	}	414	}
414
415	if ((t->item && t->item->clone.invisible != 0) \|\| flag != GT_INVISIBLE)	415	else if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))
416	{	416	{
417	object *tmp = arch_to_object (t->item);	417	if (object *tmp = arch_to_object (t->item))
418		418	{
419	if (!tmp)
420	return;
421
422	if (t->nrof && tmp->nrof <= 1)	419	if (t->nrof && tmp->nrof <= 1)
423	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	420	tmp->nrof = rndm (t->nrof) + 1;
424		421
425	fix_generated_item (tmp, op, difficulty, t->magic, flag);	422	fix_generated_item (tmp, op, difficulty, t->magic, flag);
426	change_treasure (t, tmp);	423	change_treasure (t, tmp);
427	put_treasure (tmp, op, flag);	424	put_treasure (tmp, op, flag);
		425	}
428	}	426	}
429	}	427	}
430		428
431	/* This calls the appropriate treasure creation function. tries is passed	429	/* This calls the appropriate treasure creation function. tries is passed
432	* to determine how many list transitions or attempts to create treasure	430	* to determine how many list transitions or attempts to create treasure
…		…
434	* list transitions, or so that excessively good treasure will not be	432	* list transitions, or so that excessively good treasure will not be
435	* created on weak maps, because it will exceed the number of allowed tries	433	* created on weak maps, because it will exceed the number of allowed tries
436	* to do that.	434	* to do that.
437	*/	435	*/
438	void	436	void
439	create_treasure (treasurelist * t, object *op, int flag, int difficulty, int tries)	437	create_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)
440	{	438	{
		439	// empty treasurelists are legal
		440	if (!tl->items)
		441	return;
441		442
442	if (tries++ > 100)	443	if (tries++ > 100)
443	{	444	{
444	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	445	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
445	return;	446	return;
446	}	447	}
		448
447	if (t->total_chance)	449	if (tl->total_chance)
448	create_one_treasure (t, op, flag, difficulty, tries);	450	create_one_treasure (tl, op, flag, difficulty, tries);
449	else	451	else
450	create_all_treasures (t->items, op, flag, difficulty, tries);	452	create_all_treasures (tl->items, op, flag, difficulty, tries);
451	}	453	}
452		454
453	/* This is similar to the old generate treasure function. However,	455	/* This is similar to the old generate treasure function. However,
454	* it instead takes a treasurelist. It is really just a wrapper around	456	* it instead takes a treasurelist. It is really just a wrapper around
455	* create_treasure. We create a dummy object that the treasure gets	457	* create_treasure. We create a dummy object that the treasure gets
456	* inserted into, and then return that treausre	458	* inserted into, and then return that treausre
457	*/	459	*/
458	object *	460	object *
459	generate_treasure (treasurelist *t, int difficulty)	461	generate_treasure (treasurelist *tl, int difficulty)
460	{	462	{
461	difficulty = clamp (difficulty, 1, settings.max_level);	463	difficulty = clamp (difficulty, 1, settings.max_level);
462		464
463	object ob = object::create (), tmp;	465	object ob = object::create (), tmp;
464		466
465	create_treasure (t, ob, 0, difficulty, 0);	467	create_treasure (tl, ob, 0, difficulty, 0);
466		468
467	/* Don't want to free the object we are about to return */	469	/* Don't want to free the object we are about to return */
468	tmp = ob->inv;	470	tmp = ob->inv;
469	if (tmp != NULL)	471	if (tmp != NULL)
470	tmp->remove ();	472	tmp->remove ();
…		…
483	* magical bonus "wanted".	485	* magical bonus "wanted".
484	*/	486	*/
485		487
486	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	488	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
487		489
488	/chance of magic difficulty/	490	// chance of magic difficulty
489
490	/* +0 +1 +2 +3 +4 */	491	// +0 +1 +2 +3 +4
491	{95, 2, 2, 1, 0}, /1 /	492	{95, 2, 2, 1, 0}, // 1
492	{92, 5, 2, 1, 0}, /2 /	493	{92, 5, 2, 1, 0}, // 2
493	{85, 10, 4, 1, 0}, /3 /	494	{85, 10, 4, 1, 0}, // 3
494	{80, 14, 4, 2, 0}, /4 /	495	{80, 14, 4, 2, 0}, // 4
495	{75, 17, 5, 2, 1}, /5 /	496	{75, 17, 5, 2, 1}, // 5
496	{70, 18, 8, 3, 1}, /6 /	497	{70, 18, 8, 3, 1}, // 6
497	{65, 21, 10, 3, 1}, /7 /	498	{65, 21, 10, 3, 1}, // 7
498	{60, 22, 12, 4, 2}, /8 /	499	{60, 22, 12, 4, 2}, // 8
499	{55, 25, 14, 4, 2}, /9 /	500	{55, 25, 14, 4, 2}, // 9
500	{50, 27, 16, 5, 2}, /10 /	501	{50, 27, 16, 5, 2}, // 10
501	{45, 28, 18, 6, 3}, /11 /	502	{45, 28, 18, 6, 3}, // 11
502	{42, 28, 20, 7, 3}, /12 /	503	{42, 28, 20, 7, 3}, // 12
503	{40, 27, 21, 8, 4}, /13 /	504	{40, 27, 21, 8, 4}, // 13
504	{38, 25, 22, 10, 5}, /14 /	505	{38, 25, 22, 10, 5}, // 14
505	{36, 23, 23, 12, 6}, /15 /	506	{36, 23, 23, 12, 6}, // 15
506	{33, 21, 24, 14, 8}, /16 /	507	{33, 21, 24, 14, 8}, // 16
507	{31, 19, 25, 16, 9}, /17 /	508	{31, 19, 25, 16, 9}, // 17
508	{27, 15, 30, 18, 10}, /18 /	509	{27, 15, 30, 18, 10}, // 18
509	{20, 12, 30, 25, 13}, /19 /	510	{20, 12, 30, 25, 13}, // 19
510	{15, 10, 28, 30, 17}, /20 /	511	{15, 10, 28, 30, 17}, // 20
511	{13, 9, 27, 28, 23}, /21 /	512	{13, 9, 27, 28, 23}, // 21
512	{10, 8, 25, 28, 29}, /22 /	513	{10, 8, 25, 28, 29}, // 22
513	{8, 7, 23, 26, 36}, /23 /	514	{ 8, 7, 23, 26, 36}, // 23
514	{6, 6, 20, 22, 46}, /24 /	515	{ 6, 6, 20, 22, 46}, // 24
515	{4, 5, 17, 18, 56}, /25 /	516	{ 4, 5, 17, 18, 56}, // 25
516	{2, 4, 12, 14, 68}, /26 /	517	{ 2, 4, 12, 14, 68}, // 26
517	{0, 3, 7, 10, 80}, /27 /	518	{ 0, 3, 7, 10, 80}, // 27
518	{0, 0, 3, 7, 90}, /28 /	519	{ 0, 0, 3, 7, 90}, // 28
519	{0, 0, 0, 3, 97}, /29 /	520	{ 0, 0, 0, 3, 97}, // 29
520	{0, 0, 0, 0, 100}, /30 /	521	{ 0, 0, 0, 0, 100}, // 30
521	{0, 0, 0, 0, 100}, /31 /	522	{ 0, 0, 0, 0, 100}, // 31
522	};	523	};
523		524
524		525
525	/* calculate the appropriate level for wands staves and scrolls.	526	/* calculate the appropriate level for wands staves and scrolls.
526	* This code presumes that op has had its spell object created (in op->inv)	527	* This code presumes that op has had its spell object created (in op->inv)
…		…
559	* elmex Thu Aug 10 18:45:44 CEST 2006:	560	* elmex Thu Aug 10 18:45:44 CEST 2006:
560	* Scaling difficulty by max_level, as difficulty is a level and not some	561	* Scaling difficulty by max_level, as difficulty is a level and not some
561	* weird integer between 1-31.	562	* weird integer between 1-31.
562	*	563	*
563	*/	564	*/
564
565	int	565	int
566	magic_from_difficulty (int difficulty)	566	magic_from_difficulty (int difficulty)
567	{	567	{
568	int percent = 0, magic = 0;	568	int percent = 0, magic = 0;
569	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	569	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
…		…
574	scaled_diff = 0;	574	scaled_diff = 0;
575		575
576	if (scaled_diff >= DIFFLEVELS)	576	if (scaled_diff >= DIFFLEVELS)
577	scaled_diff = DIFFLEVELS - 1;	577	scaled_diff = DIFFLEVELS - 1;
578		578
579	percent = RANDOM () % 100;	579	percent = rndm (100);
580		580
581	for (magic = 0; magic < (MAXMAGIC + 1); magic++)	581	for (magic = 0; magic < (MAXMAGIC + 1); magic++)
582	{	582	{
583	percent -= difftomagic_list[scaled_diff][magic];	583	percent -= difftomagic_list[scaled_diff][magic];
584		584
…		…
590	{	590	{
591	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);	591	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);
592	magic = 0;	592	magic = 0;
593	}	593	}
594		594
595	magic = (RANDOM () % 3) ? magic : -magic;	595	magic = (rndm (3)) ? magic : -magic;
596	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */	596	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */
597		597
598	return magic;	598	return magic;
599	}	599	}
600		600
…		…
615	if (op->arch)	615	if (op->arch)
616	{	616	{
617	if (op->type == ARMOUR)	617	if (op->type == ARMOUR)
618	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	618	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;
619		619
620	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	620	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
621	magic = (-magic);	621	magic = (-magic);
622	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	622	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;
623	}	623	}
624	else	624	else
625	{	625	{
626	if (op->type == ARMOUR)	626	if (op->type == ARMOUR)
627	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	627	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
628	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	628	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
629	magic = (-magic);	629	magic = (-magic);
630	op->weight = (op->weight * (100 - magic * 10)) / 100;	630	op->weight = (op->weight * (100 - magic * 10)) / 100;
631	}	631	}
632	}	632	}
633		633
…		…
657	* 1) Since rings can have multiple bonuses, if the same bonus	657	* 1) Since rings can have multiple bonuses, if the same bonus
658	* is rolled again, increase it - the bonuses now stack with	658	* is rolled again, increase it - the bonuses now stack with
659	* other bonuses previously rolled and ones the item might natively have.	659	* other bonuses previously rolled and ones the item might natively have.
660	* 2) Add code to deal with new PR method.	660	* 2) Add code to deal with new PR method.
661	*/	661	*/
662
663	void	662	void
664	set_ring_bonus (object *op, int bonus)	663	set_ring_bonus (object *op, int bonus)
665	{	664	{
666		665
667	int r = RANDOM () % (bonus > 0 ? 25 : 11);	666	int r = rndm (bonus > 0 ? 25 : 11);
668		667
669	if (op->type == AMULET)	668	if (op->type == AMULET)
670	{	669	{
671	if (!(RANDOM () % 21))	670	if (!(rndm (21)))
672	r = 20 + RANDOM () % 2;	671	r = 20 + rndm (2);
673	else	672	else
674	{	673	{
675	if (RANDOM () & 2)	674	if (rndm (2))
676	r = 10;	675	r = 10;
677	else	676	else
678	r = 11 + RANDOM () % 9;	677	r = 11 + rndm (9);
679	}	678	}
680	}	679	}
681		680
682	switch (r)	681	switch (r)
683	{	682	{
…		…
720	case 16:	719	case 16:
721	case 17:	720	case 17:
722	case 18:	721	case 18:
723	case 19:	722	case 19:
724	{	723	{
725	int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table;	724	int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
726		725
727	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */	726	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */
728	val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b;	727	val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
729		728
730	/* Cursed items need to have higher negative values to equal out with	729	/* Cursed items need to have higher negative values to equal out with
731	* positive values for how protections work out. Put another	730	* positive values for how protections work out. Put another
732	* little random element in since that they don't always end up with	731	* little random element in since that they don't always end up with
733	* even values.	732	* even values.
734	*/	733	*/
735	if (bonus < 0)	734	if (bonus < 0)
736	val = 2 * -val - RANDOM () % b;	735	val = 2 * -val - rndm (b);
737	if (val > 35)	736	if (val > 35)
738	val = 35; /* Upper limit */	737	val = 35; /* Upper limit */
739	b = 0;	738	b = 0;
		739
740	while (op->resist[resist_table[resist]] != 0 && b < 4)	740	while (op->resist[resist_table[resist]] != 0 && b < 4)
741	{
742	resist = RANDOM () % num_resist_table;	741	resist = rndm (num_resist_table);
743	}	742
744	if (b == 4)	743	if (b == 4)
745	return; /* Not able to find a free resistance */	744	return; /* Not able to find a free resistance */
		745
746	op->resist[resist_table[resist]] = val;	746	op->resist[resist_table[resist]] = val;
747	/* We should probably do something more clever here to adjust value	747	/* We should probably do something more clever here to adjust value
748	* based on how good a resistance we gave.	748	* based on how good a resistance we gave.
749	*/	749	*/
750	break;	750	break;
…		…
778	case 22:	778	case 22:
779	op->stats.exp += bonus; /* Speed! */	779	op->stats.exp += bonus; /* Speed! */
780	op->value = (op->value * 2) / 3;	780	op->value = (op->value * 2) / 3;
781	break;	781	break;
782	}	782	}
		783
783	if (bonus > 0)	784	if (bonus > 0)
784	op->value = 2 bonus;	785	op->value = 2 bonus;
785	else	786	else
786	op->value = -(op->value * 2 * bonus) / 3;	787	op->value = -(op->value * 2 * bonus) / 3;
787	}	788	}
…		…
792	* higher is the chance of returning a low number.	793	* higher is the chance of returning a low number.
793	* It is only used in fix_generated_treasure() to set bonuses on	794	* It is only used in fix_generated_treasure() to set bonuses on
794	* rings and amulets.	795	* rings and amulets.
795	* Another scheme is used to calculate the magic of weapons and armours.	796	* Another scheme is used to calculate the magic of weapons and armours.
796	*/	797	*/
797
798	int	798	int
799	get_magic (int diff)	799	get_magic (int diff)
800	{	800	{
801	int i;	801	int i;
802		802
803	if (diff < 3)	803	if (diff < 3)
804	diff = 3;	804	diff = 3;
		805
805	for (i = 0; i < 4; i++)	806	for (i = 0; i < 4; i++)
806	if (RANDOM () % diff)	807	if (rndm (diff))
807	return i;	808	return i;
		809
808	return 4;	810	return 4;
809	}	811	}
810		812
811	#define DICE2 (get_magic(2)==2?2:1)	813	#define DICE2 (get_magic(2)==2?2:1)
812	#define DICESPELL (RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3)	814	#define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))
813		815
814	/*	816	/*
815	* fix_generated_item(): This is called after an item is generated, in	817	* fix_generated_item(): This is called after an item is generated, in
816	* order to set it up right. This produced magical bonuses, puts spells	818	* order to set it up right. This produced magical bonuses, puts spells
817	* into scrolls/books/wands, makes it unidentified, hides the value, etc.	819	* into scrolls/books/wands, makes it unidentified, hides the value, etc.
…		…
831	* value.	833	* value.
832	* GT_MINIMAL: Does minimal processing on the object - just enough to make it	834	* 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	835	* 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	836	* type as appropriate, for objects that need spell objects, set those, etc
835	*/	837	*/
836
837	void	838	void
838	fix_generated_item (object op, object creator, int difficulty, int max_magic, int flags)	839	fix_generated_item (object op, object creator, int difficulty, int max_magic, int flags)
839	{	840	{
840	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;	841	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;
841		842
…		…
848		849
849	if (op->randomitems && op->type != SPELL)	850	if (op->randomitems && op->type != SPELL)
850	{	851	{
851	create_treasure (op->randomitems, op, flags, difficulty, 0);	852	create_treasure (op->randomitems, op, flags, difficulty, 0);
852	if (!op->inv)	853	if (!op->inv)
853	LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", &op->name);	854	LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", op->debug_desc ());
854		855
855	/* So the treasure doesn't get created again */	856	/* So the treasure doesn't get created again */
856	op->randomitems = NULL;	857	op->randomitems = 0;
857	}	858	}
858		859
859	if (difficulty < 1)	860	if (difficulty < 1)
860	difficulty = 1;	861	difficulty = 1;
861		862
…		…
878	if (!op->magic && max_magic)	879	if (!op->magic && max_magic)
879	set_magic (difficulty, op, max_magic, flags);	880	set_magic (difficulty, op, max_magic, flags);
880		881
881	num_enchantments = calc_item_power (op, 1);	882	num_enchantments = calc_item_power (op, 1);
882		883
883	if ((!was_magic && !(RANDOM () % CHANCE_FOR_ARTIFACT)) \|\| op->type == HORN \|\| difficulty >= settings.max_level) /* high difficulties always generate an artifact,	884	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
		885	\|\| op->type == HORN
		886	\|\| difficulty >= settings.max_level) /* high difficulties always generate an artifact,
884	* used for shop_floors or treasures */	887	* used for shop_floors or treasures */
885	generate_artifact (op, difficulty);	888	generate_artifact (op, difficulty);
886	}	889	}
887		890
888	/* Object was made an artifact. Calculate its item_power rating.	891	/* Object was made an artifact. Calculate its item_power rating.
…		…
946	case WEAPON:	949	case WEAPON:
947	case ARMOUR:	950	case ARMOUR:
948	case SHIELD:	951	case SHIELD:
949	case HELMET:	952	case HELMET:
950	case CLOAK:	953	case CLOAK:
951	if (QUERY_FLAG (op, FLAG_CURSED) && !(RANDOM () % 4))	954	if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
952	set_ring_bonus (op, -DICE2);	955	set_ring_bonus (op, -DICE2);
953	break;	956	break;
954		957
955	case BRACERS:	958	case BRACERS:
956	if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)))	959	if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
957	{	960	{
958	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	961	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
959	if (!QUERY_FLAG (op, FLAG_CURSED))	962	if (!QUERY_FLAG (op, FLAG_CURSED))
960	op->value *= 3;	963	op->value *= 3;
961	}	964	}
…		…
987	*/	990	*/
988	if (op->inv && op->randomitems)	991	if (op->inv && op->randomitems)
989	{	992	{
990	/* value multiplier is same as for scrolls */	993	/* value multiplier is same as for scrolls */
991	op->value = (op->value * op->inv->value);	994	op->value = (op->value * op->inv->value);
992	op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty;	995	op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
993	}	996	}
994	else	997	else
995	{	998	{
996	op->name = "potion";	999	op->name = "potion";
997	op->name_pl = "potions";	1000	op->name_pl = "potions";
998	}	1001	}
999		1002
1000	if (!(flags & GT_ONLY_GOOD) && RANDOM () % 2)	1003	if (!(flags & GT_ONLY_GOOD) && rndm (2))
1001	SET_FLAG (op, FLAG_CURSED);	1004	SET_FLAG (op, FLAG_CURSED);
1002	break;	1005	break;
1003	}	1006	}
1004		1007
1005	case AMULET:	1008	case AMULET:
…		…
1015	}	1018	}
1016		1019
1017	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */	1020	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */
1018	break;	1021	break;
1019		1022
1020	if (!(flags & GT_ONLY_GOOD) && !(RANDOM () % 3))	1023	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1021	SET_FLAG (op, FLAG_CURSED);	1024	SET_FLAG (op, FLAG_CURSED);
1022		1025
1023	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	1026	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
1024		1027
1025	if (op->type != RING) /* Amulets have only one ability */	1028	if (op->type != RING) /* Amulets have only one ability */
1026	break;	1029	break;
1027		1030
1028	if (!(RANDOM () % 4))	1031	if (!(rndm (4)))
1029	{	1032	{
1030	int d = (RANDOM () % 2 \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	1033	int d = (rndm (2) \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1031		1034
1032	if (d > 0)	1035	if (d > 0)
1033	op->value *= 3;	1036	op->value *= 3;
1034		1037
1035	set_ring_bonus (op, d);	1038	set_ring_bonus (op, d);
1036		1039
1037	if (!(RANDOM () % 4))	1040	if (!(rndm (4)))
1038	{	1041	{
1039	int d = (RANDOM () % 3 \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	1042	int d = (rndm (3) \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1040		1043
1041	if (d > 0)	1044	if (d > 0)
1042	op->value *= 5;	1045	op->value *= 5;
1043	set_ring_bonus (op, d);	1046	set_ring_bonus (op, d);
1044	}	1047	}
1045	}	1048	}
1046		1049
1047	if (GET_ANIM_ID (op))	1050	if (GET_ANIM_ID (op))
1048	SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op)));	1051	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1049		1052
1050	break;	1053	break;
1051		1054
1052	case BOOK:	1055	case BOOK:
1053	/* Is it an empty book?, if yes lets make a special·	1056	/* Is it an empty book?, if yes lets make a special·
1054	* msg for it, and tailor its properties based on the·	1057	* msg for it, and tailor its properties based on the·
1055	* creator and/or map level we found it on.	1058	* creator and/or map level we found it on.
1056	*/	1059	*/
1057	if (!op->msg && RANDOM () % 10)	1060	if (!op->msg && rndm (10))
1058	{	1061	{
1059	/* set the book level properly */	1062	/* set the book level properly */
1060	if (creator->level == 0 \|\| QUERY_FLAG (creator, FLAG_ALIVE))	1063	if (creator->level == 0 \|\| QUERY_FLAG (creator, FLAG_ALIVE))
1061	{	1064	{
1062	if (op->map && op->map->difficulty)	1065	if (op->map && op->map->difficulty)
1063	op->level = RANDOM () % (op->map->difficulty) + RANDOM () % 10 + 1;	1066	op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1064	else	1067	else
1065	op->level = RANDOM () % 20 + 1;	1068	op->level = rndm (20) + 1;
1066	}	1069	}
1067	else	1070	else
1068	op->level = RANDOM () % creator->level;	1071	op->level = rndm (creator->level);
1069		1072
1070	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);	1073	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);
1071	/* books w/ info are worth more! */	1074	/* books w/ info are worth more! */
1072	op->value = ((op->level > 10 ? op->level : (op->level + 1) / 2) ((strlen (op->msg) / 250) + 1));	1075	op->value = ((op->level > 10 ? op->level : (op->level + 1) / 2) ((strlen (op->msg) / 250) + 1));
1073	/* creator related stuff */	1076	/* creator related stuff */
…		…
1172	*/	1175	*/
1173		1176
1174	/*	1177	/*
1175	* Allocate and return the pointer to an empty artifactlist structure.	1178	* Allocate and return the pointer to an empty artifactlist structure.
1176	*/	1179	*/
1177
1178	static artifactlist *	1180	static artifactlist *
1179	get_empty_artifactlist (void)	1181	get_empty_artifactlist (void)
1180	{	1182	{
1181	artifactlist tl = (artifactlist ) malloc (sizeof (artifactlist));	1183	return salloc0 <artifactlist> ();
1182
1183	if (tl == NULL)
1184	fatal (OUT_OF_MEMORY);
1185	tl->next = NULL;
1186	tl->items = NULL;
1187	tl->total_chance = 0;
1188	return tl;
1189	}	1184	}
1190		1185
1191	/*	1186	/*
1192	* Allocate and return the pointer to an empty artifact structure.	1187	* Allocate and return the pointer to an empty artifact structure.
1193	*/	1188	*/
1194
1195	static artifact *	1189	static artifact *
1196	get_empty_artifact (void)	1190	get_empty_artifact (void)
1197	{	1191	{
1198	artifact t = (artifact ) malloc (sizeof (artifact));	1192	return salloc0 <artifact> ();
1199
1200	if (t == NULL)
1201	fatal (OUT_OF_MEMORY);
1202	t->item = NULL;
1203	t->next = NULL;
1204	t->chance = 0;
1205	t->difficulty = 0;
1206	t->allowed = NULL;
1207	return t;
1208	}	1193	}
1209		1194
1210	/*	1195	/*
1211	* Searches the artifact lists and returns one that has the same type	1196	* Searches the artifact lists and returns one that has the same type
1212	* of objects on it.	1197	* of objects on it.
1213	*/	1198	*/
1214
1215	artifactlist *	1199	artifactlist *
1216	find_artifactlist (int type)	1200	find_artifactlist (int type)
1217	{	1201	{
1218	artifactlist *al;
1219
1220	for (al = first_artifactlist; al != NULL; al = al->next)	1202	for (artifactlist *al = first_artifactlist; al; al = al->next)
1221	if (al->type == type)	1203	if (al->type == type)
1222	return al;	1204	return al;
		1205
1223	return NULL;	1206	return 0;
1224	}	1207	}
1225		1208
1226	/*	1209	/*
1227	* For debugging purposes. Dumps all tables.	1210	* For debugging purposes. Dumps all tables.
1228	*/	1211	*/
1229
1230	void	1212	void
1231	dump_artifacts (void)	1213	dump_artifacts (void)
1232	{	1214	{
1233	artifactlist *al;	1215	artifactlist *al;
1234	artifact *art;	1216	artifact *art;
…		…
1241	for (art = al->items; art != NULL; art = art->next)	1223	for (art = al->items; art != NULL; art = art->next)
1242	{	1224	{
1243	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);	1225	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1244	if (art->allowed != NULL)	1226	if (art->allowed != NULL)
1245	{	1227	{
1246	fprintf (logfile, "\tAllowed combinations:");	1228	fprintf (logfile, "\tallowed combinations:");
1247	for (next = art->allowed; next != NULL; next = next->next)	1229	for (next = art->allowed; next != NULL; next = next->next)
1248	fprintf (logfile, "%s,", &next->name);	1230	fprintf (logfile, "%s,", &next->name);
1249	fprintf (logfile, "\n");	1231	fprintf (logfile, "\n");
1250	}	1232	}
1251	}	1233	}
…		…
1262	treasurelist *tl;	1244	treasurelist *tl;
1263	int i;	1245	int i;
1264		1246
1265	if (depth > 100)	1247	if (depth > 100)
1266	return;	1248	return;
1267	while (t != NULL)	1249
		1250	while (t)
1268	{	1251	{
1269	if (t->name != NULL)	1252	if (t->name)
1270	{	1253	{
1271	for (i = 0; i < depth; i++)	1254	for (i = 0; i < depth; i++)
1272	fprintf (logfile, " ");	1255	fprintf (logfile, " ");
		1256
1273	fprintf (logfile, "{ (list: %s)\n", &t->name);	1257	fprintf (logfile, "{ (list: %s)\n", &t->name);
		1258
1274	tl = find_treasurelist (t->name);	1259	tl = treasurelist::find (t->name);
1275	if (tl)	1260	if (tl)
1276	dump_monster_treasure_rec (name, tl->items, depth + 2);	1261	dump_monster_treasure_rec (name, tl->items, depth + 2);
		1262
1277	for (i = 0; i < depth; i++)	1263	for (i = 0; i < depth; i++)
1278	fprintf (logfile, " ");	1264	fprintf (logfile, " ");
		1265
1279	fprintf (logfile, "} (end of list: %s)\n", &t->name);	1266	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1280	}	1267	}
1281	else	1268	else
1282	{	1269	{
1283	for (i = 0; i < depth; i++)	1270	for (i = 0; i < depth; i++)
1284	fprintf (logfile, " ");	1271	fprintf (logfile, " ");
		1272
1285	if (t->item->clone.type == FLESH)	1273	if (t->item && t->item->clone.type == FLESH)
1286	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);	1274	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1287	else	1275	else
1288	fprintf (logfile, "%s\n", &t->item->clone.name);	1276	fprintf (logfile, "%s\n", &t->item->clone.name);
1289	}	1277	}
		1278
1290	if (t->next_yes != NULL)	1279	if (t->next_yes)
1291	{	1280	{
1292	for (i = 0; i < depth; i++)	1281	for (i = 0; i < depth; i++)
1293	fprintf (logfile, " ");	1282	fprintf (logfile, " ");
		1283
1294	fprintf (logfile, " (if yes)\n");	1284	fprintf (logfile, " (if yes)\n");
1295	dump_monster_treasure_rec (name, t->next_yes, depth + 1);	1285	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1296	}	1286	}
		1287
1297	if (t->next_no != NULL)	1288	if (t->next_no)
1298	{	1289	{
1299	for (i = 0; i < depth; i++)	1290	for (i = 0; i < depth; i++)
1300	fprintf (logfile, " ");	1291	fprintf (logfile, " ");
		1292
1301	fprintf (logfile, " (if no)\n");	1293	fprintf (logfile, " (if no)\n");
1302	dump_monster_treasure_rec (name, t->next_no, depth + 1);	1294	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1303	}	1295	}
		1296
1304	t = t->next;	1297	t = t->next;
1305	}	1298	}
1306	}	1299	}
1307		1300
1308	/*	1301	/*
1309	* For debugging purposes. Dumps all treasures for a given monster.	1302	* For debugging purposes. Dumps all treasures for a given monster.
1310	* Created originally by Raphael Quinet for debugging the alchemy code.	1303	* Created originally by Raphael Quinet for debugging the alchemy code.
1311	*/	1304	*/
1312
1313	void	1305	void
1314	dump_monster_treasure (const char *name)	1306	dump_monster_treasure (const char *name)
1315	{	1307	{
1316	archetype *at;	1308	archetype *at;
1317	int found;	1309	int found;
1318		1310
1319	found = 0;	1311	found = 0;
1320	fprintf (logfile, "\n");	1312	fprintf (logfile, "\n");
		1313
1321	for (at = first_archetype; at != NULL; at = at->next)	1314	for (at = first_archetype; at != NULL; at = at->next)
1322	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)	1315	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1323	{	1316	{
1324	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);	1317	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1325	if (at->clone.randomitems != NULL)	1318	if (at->clone.randomitems != NULL)
1326	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);	1319	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1327	else	1320	else
1328	fprintf (logfile, "(nothing)\n");	1321	fprintf (logfile, "(nothing)\n");
		1322
1329	fprintf (logfile, "\n");	1323	fprintf (logfile, "\n");
1330	found++;	1324	found++;
1331	}	1325	}
		1326
1332	if (found == 0)	1327	if (found == 0)
1333	fprintf (logfile, "No objects have the name %s!\n\n", name);	1328	fprintf (logfile, "No objects have the name %s!\n\n", name);
1334	}	1329	}
1335		1330
1336	/*	1331	/*
1337	* Builds up the lists of artifacts from the file in the libdir.	1332	* Builds up the lists of artifacts from the file in the libdir.
1338	*/	1333	*/
1339
1340	void	1334	void
1341	init_artifacts (void)	1335	init_artifacts (void)
1342	{	1336	{
1343	static int has_been_inited = 0;	1337	static int has_been_inited = 0;
1344	char filename[MAX_BUF], buf[HUGE_BUF], cp, next;	1338	char filename[MAX_BUF];
1345	artifact *art = NULL;	1339	artifact *art = NULL;
1346	linked_char *tmp;
1347	int value;
1348	artifactlist *al;	1340	artifactlist *al;
1349		1341
1350	if (has_been_inited)	1342	if (has_been_inited)
1351	return;	1343	return;
1352	else	1344	else
1353	has_been_inited = 1;	1345	has_been_inited = 1;
1354		1346
1355	sprintf (filename, "%s/artifacts", settings.datadir);	1347	sprintf (filename, "%s/artifacts", settings.datadir);
1356	object_thawer thawer (filename);	1348	object_thawer f (filename);
1357		1349
1358	if (!thawer)	1350	if (!f)
1359	return;	1351	return;
1360		1352
1361	while (fgets (buf, HUGE_BUF, thawer) != NULL)	1353	f.next ();
1362	{
1363	if (*buf == '#')
1364	continue;
1365	if ((cp = strchr (buf, '\n')) != NULL)
1366	*cp = '\0';
1367	cp = buf;
1368	while (cp == ' ') / Skip blanks */
1369	cp++;
1370	if (*cp == '\0')
1371	continue;
1372		1354
1373	if (!strncmp (cp, "Allowed", 7))	1355	for (;;)
		1356	{
		1357	switch (f.kw)
1374	{	1358	{
		1359	case KW_allowed:
1375	if (art == NULL)	1360	if (!art)
		1361	{
		1362	art = get_empty_artifact ();
		1363	nrofartifacts++;
		1364	}
		1365
1376	{	1366	{
1377	art = get_empty_artifact ();	1367	if (!strcmp (f.get_str (), "all"))
1378	nrofartifacts++;	1368	break;
		1369
		1370	char next, cp = f.get_str ();
		1371
		1372	do
		1373	{
		1374	nrofallowedstr++;
		1375
		1376	if ((next = strchr (cp, ',')))
		1377	*next++ = '\0';
		1378
		1379	linked_char *tmp = new linked_char;
		1380
		1381	tmp->name = cp;
		1382	tmp->next = art->allowed;
		1383	art->allowed = tmp;
		1384	}
		1385	while ((cp = next));
1379	}	1386	}
1380	cp = strchr (cp, ' ') + 1;	1387	break;
1381	if (!strcmp (cp, "all"))	1388
		1389	case KW_chance:
		1390	f.get (art->chance);
		1391	break;
		1392
		1393	case KW_difficulty:
		1394	f.get (art->difficulty);
		1395	break;
		1396
		1397	case KW_object:
		1398	{
		1399	art->item = object::create ();
		1400
		1401	if (!art->item->parse_kv (f))
		1402	LOG (llevError, "Init_Artifacts: Could not load object.\n");
		1403
		1404	al = find_artifactlist (art->item->type);
		1405
		1406	if (!al)
		1407	{
		1408	al = get_empty_artifactlist ();
		1409	al->type = art->item->type;
		1410	al->next = first_artifactlist;
		1411	first_artifactlist = al;
		1412	}
		1413
		1414	art->next = al->items;
		1415	al->items = art;
		1416	art = 0;
		1417	}
1382	continue;	1418	continue;
1383		1419
1384	do	1420	case KW_EOF:
		1421	goto done;
		1422
		1423	default:
		1424	if (!f.parse_error ("artifacts file"))
		1425	cleanup ("artifacts file required");
1385	{	1426	break;
1386	nrofallowedstr++;
1387	if ((next = strchr (cp, ',')) != NULL)
1388	*(next++) = '\0';
1389	tmp = new linked_char;
1390
1391	tmp->name = cp;
1392	tmp->next = art->allowed;
1393	art->allowed = tmp;
1394	}
1395	while ((cp = next) != NULL);
1396	}
1397	else if (sscanf (cp, "chance %d", &value))
1398	art->chance = (uint16) value;
1399	else if (sscanf (cp, "difficulty %d", &value))
1400	art->difficulty = (uint8) value;
1401	else if (!strncmp (cp, "Object", 6))
1402	{	1427	}
1403	art->item = object::create ();
1404		1428
1405	if (!load_object (thawer, art->item, 0))	1429	f.next ();
1406	LOG (llevError, "Init_Artifacts: Could not load object.\n");
1407
1408	art->item->name = strchr (cp, ' ') + 1;
1409	al = find_artifactlist (art->item->type);
1410	if (al == NULL)
1411	{
1412	al = get_empty_artifactlist ();
1413	al->type = art->item->type;
1414	al->next = first_artifactlist;
1415	first_artifactlist = al;
1416	}
1417	art->next = al->items;
1418	al->items = art;
1419	art = NULL;
1420	}
1421	else
1422	LOG (llevError, "Unknown input in artifact file: %s\n", buf);
1423	}	1430	}
1424		1431
		1432	done:
1425	for (al = first_artifactlist; al != NULL; al = al->next)	1433	for (al = first_artifactlist; al; al = al->next)
1426	{	1434	{
1427	for (art = al->items; art != NULL; art = art->next)	1435	for (art = al->items; art; art = art->next)
1428	{	1436	{
1429	if (!art->chance)	1437	if (!art->chance)
1430	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1438	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1431	else	1439	else
1432	al->total_chance += art->chance;	1440	al->total_chance += art->chance;
…		…
1451	int i, tmp;	1459	int i, tmp;
1452		1460
1453	if (change->face != blank_face)	1461	if (change->face != blank_face)
1454	{	1462	{
1455	#ifdef TREASURE_VERBOSE	1463	#ifdef TREASURE_VERBOSE
1456	LOG (llevDebug, "FACE: %d\n", change->face->number);	1464	LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1457	#endif	1465	#endif
1458	op->face = change->face;	1466	op->face = change->face;
1459	}	1467	}
1460		1468
1461	for (i = 0; i < NUM_STATS; i++)	1469	for (i = 0; i < NUM_STATS; i++)
…		…
1501		1509
1502	op->set_speed (op->speed);	1510	op->set_speed (op->speed);
1503	}	1511	}
1504		1512
1505	if (change->nrof)	1513	if (change->nrof)
1506	op->nrof = RANDOM () % ((int) change->nrof) + 1;	1514	op->nrof = rndm (change->nrof) + 1;
1507		1515
1508	op->stats.exp += change->stats.exp; /* Speed modifier */	1516	op->stats.exp += change->stats.exp; /* Speed modifier */
1509	op->stats.wc += change->stats.wc;	1517	op->stats.wc += change->stats.wc;
1510	op->stats.ac += change->stats.ac;	1518	op->stats.ac += change->stats.ac;
1511		1519
…		…
1614	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);	1622	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);
1615	}	1623	}
1616		1624
1617	op->value *= change->value;	1625	op->value *= change->value;
1618		1626
1619	if (change->material)	1627	if (change->materials)
1620	op->material = change->material;	1628	op->materials = change->materials;
1621		1629
1622	if (change->materialname)	1630	if (change->materialname)
1623	op->materialname = change->materialname;	1631	op->materialname = change->materialname;
1624		1632
1625	if (change->slaying)	1633	if (change->slaying)
…		…
1642	if (art->allowed == (linked_char *) NULL)	1650	if (art->allowed == (linked_char *) NULL)
1643	return 1; /* Ie, "all" */	1651	return 1; /* Ie, "all" */
1644	for (tmp = art->allowed; tmp; tmp = tmp->next)	1652	for (tmp = art->allowed; tmp; tmp = tmp->next)
1645	{	1653	{
1646	#ifdef TREASURE_VERBOSE	1654	#ifdef TREASURE_VERBOSE
1647	LOG (llevDebug, "legal_art: %s\n", tmp->name);	1655	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1648	#endif	1656	#endif
1649	if (*tmp->name == '!')	1657	if (*tmp->name == '!')
1650	name = tmp->name + 1, neg = 1;	1658	name = tmp->name + 1, neg = 1;
1651	else	1659	else
1652	name = tmp->name, neg = 0;	1660	name = tmp->name, neg = 0;
…		…
1719	return;	1727	return;
1720	}	1728	}
1721		1729
1722	for (i = 0; i < ARTIFACT_TRIES; i++)	1730	for (i = 0; i < ARTIFACT_TRIES; i++)
1723	{	1731	{
1724	int roll = RANDOM () % al->total_chance;	1732	int roll = rndm (al->total_chance);
1725		1733
1726	for (art = al->items; art != NULL; art = art->next)	1734	for (art = al->items; art; art = art->next)
1727	{	1735	{
1728	roll -= art->chance;	1736	roll -= art->chance;
1729	if (roll < 0)	1737	if (roll < 0)
1730	break;	1738	break;
1731	}	1739	}
…		…
1747	continue;	1755	continue;
1748		1756
1749	if (!legal_artifact_combination (op, art))	1757	if (!legal_artifact_combination (op, art))
1750	{	1758	{
1751	#ifdef TREASURE_VERBOSE	1759	#ifdef TREASURE_VERBOSE
1752	LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name);	1760	LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1753	#endif	1761	#endif
1754	continue;	1762	continue;
1755	}	1763	}
		1764
1756	give_artifact_abilities (op, art->item);	1765	give_artifact_abilities (op, art->item);
1757	return;	1766	return;
1758	}	1767	}
1759	}	1768	}
1760		1769
…		…
1808	/* special_potion() - so that old potion code is still done right. */	1817	/* special_potion() - so that old potion code is still done right. */
1809		1818
1810	int	1819	int
1811	special_potion (object *op)	1820	special_potion (object *op)
1812	{	1821	{
1813
1814	int i;
1815
1816	if (op->attacktype)	1822	if (op->attacktype)
1817	return 1;	1823	return 1;
1818		1824
1819	if (op->stats.Str \|\| op->stats.Dex \|\| op->stats.Con \|\| op->stats.Pow \|\| op->stats.Wis \|\| op->stats.Int \|\| op->stats.Cha)	1825	if (op->stats.Str \|\| op->stats.Dex \|\| op->stats.Con \|\| op->stats.Pow \|\| op->stats.Wis \|\| op->stats.Int \|\| op->stats.Cha)
1820	return 1;	1826	return 1;
1821		1827
1822	for (i = 0; i < NROFATTACKS; i++)	1828	for (int i = 0; i < NROFATTACKS; i++)
1823	if (op->resist[i])	1829	if (op->resist[i])
1824	return 1;	1830	return 1;
1825		1831
1826	return 0;	1832	return 0;
1827	}	1833	}
1828		1834
1829	void	1835	void
1830	free_treasurestruct (treasure *t)	1836	free_treasurestruct (treasure *t)
1831	{	1837	{
1832	if (t->next)
1833	free_treasurestruct (t->next);	1838	if (t->next) free_treasurestruct (t->next);
1834	if (t->next_yes)
1835	free_treasurestruct (t->next_yes);	1839	if (t->next_yes) free_treasurestruct (t->next_yes);
1836	if (t->next_no)
1837	free_treasurestruct (t->next_no);	1840	if (t->next_no) free_treasurestruct (t->next_no);
1838		1841
1839	delete t;	1842	delete t;
1840	}	1843	}
1841		1844
1842	void	1845	void
…		…
1847		1850
1848	delete lc;	1851	delete lc;
1849	}	1852	}
1850		1853
1851	void	1854	void
1852	free_artifact (artifact * at)	1855	free_artifact (artifact *at)
1853	{	1856	{
1854	if (at->next)
1855	free_artifact (at->next);	1857	if (at->next) free_artifact (at->next);
1856
1857	if (at->allowed)
1858	free_charlinks (at->allowed);	1858	if (at->allowed) free_charlinks (at->allowed);
1859		1859
1860	at->item->destroy (1);	1860	at->item->destroy (1);
1861		1861
1862	delete at;	1862	sfree (at);
1863	}	1863	}
1864		1864
1865	void	1865	void
1866	free_artifactlist (artifactlist * al)	1866	free_artifactlist (artifactlist *al)
1867	{	1867	{
1868	artifactlist *nextal;	1868	artifactlist *nextal;
1869		1869
1870	for (al = first_artifactlist; al; al = nextal)	1870	for (al = first_artifactlist; al; al = nextal)
1871	{	1871	{
1872	nextal = al->next;	1872	nextal = al->next;
1873		1873
1874	if (al->items)	1874	if (al->items)
1875	free_artifact (al->items);	1875	free_artifact (al->items);
1876		1876
1877	free (al);	1877	sfree (al);
1878	}	1878	}
1879	}	1879	}
1880		1880
1881	void	1881	void
1882	free_all_treasures (void)	1882	free_all_treasures (void)
1883	{	1883	{
1884	treasurelist tl, next;	1884	treasurelist tl, next;
1885		1885
1886
1887	for (tl = first_treasurelist; tl != NULL; tl = next)	1886	for (tl = first_treasurelist; tl; tl = next)
1888	{	1887	{
		1888	clear (tl);
		1889
1889	next = tl->next;	1890	next = tl->next;
1890	if (tl->items)
1891	free_treasurestruct (tl->items);
1892	delete tl;	1891	delete tl;
1893	}	1892	}
		1893
1894	free_artifactlist (first_artifactlist);	1894	free_artifactlist (first_artifactlist);
1895	}	1895	}

Diff Legend

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

Comparing deliantra/server/common/treasure.C (file contents): Revision 1.29 by root, Tue Dec 26 20:04:09 2006 UTC vs. Revision 1.42 by root, Mon Apr 16 10:14:25 2007 UTC

Diff Legend

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.29 by root, Tue Dec 26 20:04:09 2006 UTC vs.
Revision 1.42 by root, Mon Apr 16 10:14:25 2007 UTC