[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.49 by root, Tue Apr 17 18:59:05 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[];
45		46
46	/*	47	typedef std::tr1::unordered_map<
47	* Initialize global archtype pointers:	48	const char *,
48	*/	49	treasurelist *,
		50	str_hash,
		51	str_equal,
		52	slice_allocator< std::pair<const char const, treasurelist > >,
		53	true
		54	> tl_map_t;
49		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
50	void	99	void
51	init_archetype_pointers ()	100	clear (treasurelist *tl)
52	{	101	{
53	int prev_warn = warn_archetypes;	102	if (tl->items)
		103	{
		104	free_treasurestruct (tl->items);
		105	tl->items = 0;
		106	}
54		107
55	warn_archetypes = 1;
56	if (ring_arch == NULL)
57	ring_arch = archetype::find ("ring");
58	if (amulet_arch == NULL)
59	amulet_arch = archetype::find ("amulet");
60	if (staff_arch == NULL)
61	staff_arch = archetype::find ("staff");
62	if (crown_arch == NULL)
63	crown_arch = archetype::find ("crown");
64	warn_archetypes = prev_warn;
65	}
66
67	/*
68	* Allocate and return the pointer to an empty treasurelist structure.
69	*/
70
71	static treasurelist *
72	get_empty_treasurelist (void)
73	{
74	return new treasurelist;
75	}
76
77	/*
78	* Allocate and return the pointer to an empty treasure structure.
79	*/
80	//TODO: make this a constructor
81	static treasure *
82	get_empty_treasure (void)
83	{
84	treasure *t = new treasure;
85
86	t->chance = 100;	108	tl->total_chance = 0;
87
88	return t;
89	}	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
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	read_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;
102		140
103	nroftreasures++;	141	f.next ();
104	while (fgets (buf, MAX_BUF, fp) != NULL)
105	{
106	(*line)++;
107		142
108	if (*buf == '#')	143	for (;;)
109	continue;	144	{
110	if ((cp = strchr (buf, '\n')) != NULL)	145	coroapi::cede_to_tick_every (10);
111	*cp = '\0';
112	cp = buf;
113	while (isspace (cp)) / Skip blanks */
114	cp++;
115		146
116	if (sscanf (cp, "arch %s", variable))	147	switch (f.kw)
117	{
118	if ((t->item = archetype::find (variable)) == NULL)
119	LOG (llevError, "Treasure lacks archetype: %s\n", variable);
120	}	148	{
121	else if (sscanf (cp, "list %s", variable))	149	case KW_arch:
122	t->name = variable;	150	if (!(t->item = archetype::find (f.get_str ())))
123	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 ());
124	t->change_arch.name = variable;	152	break;
125	else if (sscanf (cp, "change_title %s", variable))	153
126	t->change_arch.title = variable;	154	case KW_list: f.get (t->name); break;
127	else if (sscanf (cp, "change_slaying %s", variable))	155	case KW_change_name: f.get (t->change_arch.name); break;
128	t->change_arch.slaying = variable;	156	case KW_change_title: f.get (t->change_arch.title); break;
129	else if (sscanf (cp, "chance %d", &value))	157	case KW_change_slaying: f.get (t->change_arch.slaying); break;
130	t->chance = (uint8) value;	158	case KW_chance: f.get (t->chance); break;
131	else if (sscanf (cp, "nrof %d", &value))	159	case KW_nrof: f.get (t->nrof); break;
132	t->nrof = (uint16) value;	160	case KW_magic: f.get (t->magic); break;
133	else if (sscanf (cp, "magic %d", &value))	161
134	t->magic = (uint8) value;	162	case KW_yes: t->next_yes = read_treasure (f); continue;
135	else if (!strcmp (cp, "yes"))	163	case KW_no: t->next_no = read_treasure (f); continue;
136	t->next_yes = load_treasure (fp, line);	164
137	else if (!strcmp (cp, "no"))	165	case KW_end:
138	t->next_no = load_treasure (fp, line);	166	f.next ();
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;	167	return t;
145	}
146	else
147	LOG (llevError, "Unknown treasure-command: '%s', last entry %s, line %d\n", cp, &t->name, *line);
148	}
149	LOG (llevError, "treasure lacks 'end'.\n");
150	return t;
151	}
152		168
153	#ifdef TREASURE_DEBUG	169	case KW_more:
		170	t->next = read_treasure (f);
		171	return t;
154		172
155	/* recursived checks the linked list. Treasurelist is passed only	173	default:
156	* so that the treasure name can be printed out	174	if (!f.parse_error ("treasurelist", t->name))
157	*/	175	return 0;
158	static void
159	check_treasurelist (const treasure t, const treasurelist tl)
160	{
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))
164	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 */
166	if (t->name && *t->name)
167	(void) find_treasurelist (t->name);
168	if (t->next)
169	check_treasurelist (t->next, tl);
170	if (t->next_yes)
171	check_treasurelist (t->next_yes, tl);
172	if (t->next_no)
173	check_treasurelist (t->next_no, tl);
174	}
175	#endif
176		176
		177	return t;
		178	}
		179
		180	f.next ();
		181	}
		182	}
		183
177	/*	184	/*
178	* Opens LIBDIR/treasure and reads all treasure-declarations from it.
179	* Each treasure is parsed with the help of load_treasure().	185	* Each treasure is parsed with the help of load_treasure().
180	*/	186	*/
181		187	treasurelist *
182	void	188	treasurelist::read (object_thawer &f)
183	load_treasures (void)
184	{	189	{
185	FILE *fp;	190	assert (f.kw == KW_treasure \|\| f.kw == KW_treasureone);
186	char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];
187	treasurelist *previous = NULL;
188	treasure *t;
189	int comp, line = 0;
190		191
191	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	192	bool one = f.kw == KW_treasureone;
192	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	193	treasurelist *tl = treasurelist::get (f.get_str ());
193	{	194	clear (tl);
194	LOG (llevError, "Can't open treasure file.\n");	195	tl->items = read_treasure (f);
		196	if (!tl->items)
195	return;	197	return 0;
196	}
197	while (fgets (buf, MAX_BUF, fp) != NULL)
198	{
199	line++;
200	if (*buf == '#')
201	continue;
202		198
203	if (sscanf (buf, "treasureone %s\n", name) \|\| sscanf (buf, "treasure %s\n", name))
204	{
205	treasurelist *tl = get_empty_treasurelist ();
206
207	tl->name = name;
208	if (previous == NULL)
209	first_treasurelist = tl;
210	else
211	previous->next = tl;
212	previous = tl;
213	tl->items = load_treasure (fp, &line);
214
215	/* 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.
216	* 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
217	* fields of the treasures are not being used.	201	* fields of the treasures are not being used.
218	*/	202	*/
219	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)
220	{	210	{
221	for (t = tl->items; t != NULL; t = t->next)
222	{
223	#ifdef TREASURE_DEBUG
224	if (t->next_yes \|\| t->next_no)
225	{
226	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);
227	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");
228	}
229	#endif
230	tl->total_chance += t->chance;
231	}
232	}	213	}
233	}
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		214
239	#ifdef TREASURE_DEBUG	215	tl->total_chance += t->chance;
240	/* Perform some checks on how valid the treasure data actually is.	216	}
241	* verify that list transitions work (ie, the list that it is supposed	217	}
242	* to transition to exists). Also, verify that at least the name
243	* or archetype is set for each treasure element.
244	*/
245	for (previous = first_treasurelist; previous != NULL; previous = previous->next)
246	check_treasurelist (previous->items, previous);
247	#endif
248	}
249		218
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;
266
267	if (first_treasurelist)
268	LOG (llevError, "Couldn't find treasurelist %s\n", name);
269
270	return 0;	219	return tl;
271	}	220	}
272
273		221
274	/*	222	/*
275	* Generates the objects specified by the given treasure.	223	* Generates the objects specified by the given treasure.
276	* It goes recursively through the rest of the linked list.	224	* It goes recursively through the rest of the linked list.
277	* 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,
327		275
328	if (t->change_arch.slaying)	276	if (t->change_arch.slaying)
329	op->slaying = t->change_arch.slaying;	277	op->slaying = t->change_arch.slaying;
330	}	278	}
331		279
332	void	280	static void
333	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)
334	{	282	{
335	object *tmp;
336
337	if ((int) t->chance >= 100 \|\| (RANDOM () % 100 + 1) < (int) t->chance)	283	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)
338	{	284	{
339	if (t->name)	285	if (t->name)
340	{	286	{
341	if (strcmp (t->name, "NONE") && difficulty >= t->magic)	287	if (difficulty >= t->magic)
		288	if (treasurelist *tl = treasurelist::find (t->name))
		289	create_treasure (tl, op, flag, difficulty, tries);
		290	else
		291	LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
		292	}
		293	else
		294	{
		295	if (t->item && (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE)))
342	{	296	{
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);	297	object *tmp = arch_to_object (t->item);
		298
353	if (t->nrof && tmp->nrof <= 1)	299	if (t->nrof && tmp->nrof <= 1)
354	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	300	tmp->nrof = rndm (t->nrof) + 1;
		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 = RANDOM () % tl->total_chance;	321	int value = rndm (tl->total_chance);
375	treasure *t;	322	treasure *t;
376		323
377	if (tries++ > 100)	324	if (tries++ > 100)
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 (!strcmp (t->name, "NONE"))
401	return;
402
403	if (difficulty >= t->magic)	343	if (difficulty >= t->magic)
404	{	344	{
405	treasurelist *tl = find_treasurelist (t->name);	345	treasurelist *tl = treasurelist::find (t->name);
406	if (tl)	346	if (tl)
407	create_treasure (tl, op, flag, difficulty, tries);	347	create_treasure (tl, op, flag, difficulty, tries);
408	}	348	}
409	else if (t->nrof)	349	else if (t->nrof)
410	create_one_treasure (tl, op, flag, difficulty, tries);	350	create_one_treasure (tl, op, flag, difficulty, tries);
411
412	return;
413	}	351	}
414
415	if ((t->item && t->item->clone.invisible != 0) \|\| flag != GT_INVISIBLE)	352	else if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))
416	{	353	{
417	object *tmp = arch_to_object (t->item);	354	if (object *tmp = arch_to_object (t->item))
418		355	{
419	if (!tmp)
420	return;
421
422	if (t->nrof && tmp->nrof <= 1)	356	if (t->nrof && tmp->nrof <= 1)
423	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	357	tmp->nrof = rndm (t->nrof) + 1;
424		358
425	fix_generated_item (tmp, op, difficulty, t->magic, flag);	359	fix_generated_item (tmp, op, difficulty, t->magic, flag);
426	change_treasure (t, tmp);	360	change_treasure (t, tmp);
427	put_treasure (tmp, op, flag);	361	put_treasure (tmp, op, flag);
		362	}
428	}	363	}
429	}	364	}
430		365
431	/* This calls the appropriate treasure creation function. tries is passed	366	/* This calls the appropriate treasure creation function. tries is passed
432	* to determine how many list transitions or attempts to create treasure	367	* to determine how many list transitions or attempts to create treasure
…		…
434	* list transitions, or so that excessively good treasure will not be	369	* 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	370	* created on weak maps, because it will exceed the number of allowed tries
436	* to do that.	371	* to do that.
437	*/	372	*/
438	void	373	void
439	create_treasure (treasurelist * t, object *op, int flag, int difficulty, int tries)	374	create_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)
440	{	375	{
		376	// empty treasurelists are legal
		377	if (!tl->items)
		378	return;
441		379
442	if (tries++ > 100)	380	if (tries++ > 100)
443	{	381	{
444	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	382	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
445	return;	383	return;
446	}	384	}
		385
447	if (t->total_chance)	386	if (tl->total_chance)
448	create_one_treasure (t, op, flag, difficulty, tries);	387	create_one_treasure (tl, op, flag, difficulty, tries);
449	else	388	else
450	create_all_treasures (t->items, op, flag, difficulty, tries);	389	create_all_treasures (tl->items, op, flag, difficulty, tries);
451	}	390	}
452		391
453	/* This is similar to the old generate treasure function. However,	392	/* This is similar to the old generate treasure function. However,
454	* it instead takes a treasurelist. It is really just a wrapper around	393	* it instead takes a treasurelist. It is really just a wrapper around
455	* create_treasure. We create a dummy object that the treasure gets	394	* create_treasure. We create a dummy object that the treasure gets
456	* inserted into, and then return that treausre	395	* inserted into, and then return that treausre
457	*/	396	*/
458	object *	397	object *
459	generate_treasure (treasurelist *t, int difficulty)	398	generate_treasure (treasurelist *tl, int difficulty)
460	{	399	{
461	difficulty = clamp (difficulty, 1, settings.max_level);	400	difficulty = clamp (difficulty, 1, settings.max_level);
462		401
463	object ob = object::create (), tmp;	402	object ob = object::create (), tmp;
464		403
465	create_treasure (t, ob, 0, difficulty, 0);	404	create_treasure (tl, ob, 0, difficulty, 0);
466		405
467	/* Don't want to free the object we are about to return */	406	/* Don't want to free the object we are about to return */
468	tmp = ob->inv;	407	tmp = ob->inv;
469	if (tmp != NULL)	408	if (tmp != NULL)
470	tmp->remove ();	409	tmp->remove ();
…		…
483	* magical bonus "wanted".	422	* magical bonus "wanted".
484	*/	423	*/
485		424
486	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	425	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
487		426
488	/chance of magic difficulty/	427	// chance of magic difficulty
489
490	/* +0 +1 +2 +3 +4 */	428	// +0 +1 +2 +3 +4
491	{95, 2, 2, 1, 0}, /1 /	429	{95, 2, 2, 1, 0}, // 1
492	{92, 5, 2, 1, 0}, /2 /	430	{92, 5, 2, 1, 0}, // 2
493	{85, 10, 4, 1, 0}, /3 /	431	{85, 10, 4, 1, 0}, // 3
494	{80, 14, 4, 2, 0}, /4 /	432	{80, 14, 4, 2, 0}, // 4
495	{75, 17, 5, 2, 1}, /5 /	433	{75, 17, 5, 2, 1}, // 5
496	{70, 18, 8, 3, 1}, /6 /	434	{70, 18, 8, 3, 1}, // 6
497	{65, 21, 10, 3, 1}, /7 /	435	{65, 21, 10, 3, 1}, // 7
498	{60, 22, 12, 4, 2}, /8 /	436	{60, 22, 12, 4, 2}, // 8
499	{55, 25, 14, 4, 2}, /9 /	437	{55, 25, 14, 4, 2}, // 9
500	{50, 27, 16, 5, 2}, /10 /	438	{50, 27, 16, 5, 2}, // 10
501	{45, 28, 18, 6, 3}, /11 /	439	{45, 28, 18, 6, 3}, // 11
502	{42, 28, 20, 7, 3}, /12 /	440	{42, 28, 20, 7, 3}, // 12
503	{40, 27, 21, 8, 4}, /13 /	441	{40, 27, 21, 8, 4}, // 13
504	{38, 25, 22, 10, 5}, /14 /	442	{38, 25, 22, 10, 5}, // 14
505	{36, 23, 23, 12, 6}, /15 /	443	{36, 23, 23, 12, 6}, // 15
506	{33, 21, 24, 14, 8}, /16 /	444	{33, 21, 24, 14, 8}, // 16
507	{31, 19, 25, 16, 9}, /17 /	445	{31, 19, 25, 16, 9}, // 17
508	{27, 15, 30, 18, 10}, /18 /	446	{27, 15, 30, 18, 10}, // 18
509	{20, 12, 30, 25, 13}, /19 /	447	{20, 12, 30, 25, 13}, // 19
510	{15, 10, 28, 30, 17}, /20 /	448	{15, 10, 28, 30, 17}, // 20
511	{13, 9, 27, 28, 23}, /21 /	449	{13, 9, 27, 28, 23}, // 21
512	{10, 8, 25, 28, 29}, /22 /	450	{10, 8, 25, 28, 29}, // 22
513	{8, 7, 23, 26, 36}, /23 /	451	{ 8, 7, 23, 26, 36}, // 23
514	{6, 6, 20, 22, 46}, /24 /	452	{ 6, 6, 20, 22, 46}, // 24
515	{4, 5, 17, 18, 56}, /25 /	453	{ 4, 5, 17, 18, 56}, // 25
516	{2, 4, 12, 14, 68}, /26 /	454	{ 2, 4, 12, 14, 68}, // 26
517	{0, 3, 7, 10, 80}, /27 /	455	{ 0, 3, 7, 10, 80}, // 27
518	{0, 0, 3, 7, 90}, /28 /	456	{ 0, 0, 3, 7, 90}, // 28
519	{0, 0, 0, 3, 97}, /29 /	457	{ 0, 0, 0, 3, 97}, // 29
520	{0, 0, 0, 0, 100}, /30 /	458	{ 0, 0, 0, 0, 100}, // 30
521	{0, 0, 0, 0, 100}, /31 /	459	{ 0, 0, 0, 0, 100}, // 31
522	};	460	};
523		461
524		462
525	/* calculate the appropriate level for wands staves and scrolls.	463	/* calculate the appropriate level for wands staves and scrolls.
526	* 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)
…		…
559	* elmex Thu Aug 10 18:45:44 CEST 2006:	497	* elmex Thu Aug 10 18:45:44 CEST 2006:
560	* 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
561	* weird integer between 1-31.	499	* weird integer between 1-31.
562	*	500	*
563	*/	501	*/
564
565	int	502	int
566	magic_from_difficulty (int difficulty)	503	magic_from_difficulty (int difficulty)
567	{	504	{
568	int percent = 0, magic = 0;	505	int percent = 0, magic = 0;
569	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	506	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
…		…
574	scaled_diff = 0;	511	scaled_diff = 0;
575		512
576	if (scaled_diff >= DIFFLEVELS)	513	if (scaled_diff >= DIFFLEVELS)
577	scaled_diff = DIFFLEVELS - 1;	514	scaled_diff = DIFFLEVELS - 1;
578		515
579	percent = RANDOM () % 100;	516	percent = rndm (100);
580		517
581	for (magic = 0; magic < (MAXMAGIC + 1); magic++)	518	for (magic = 0; magic < (MAXMAGIC + 1); magic++)
582	{	519	{
583	percent -= difftomagic_list[scaled_diff][magic];	520	percent -= difftomagic_list[scaled_diff][magic];
584		521
…		…
590	{	527	{
591	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);	528	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);
592	magic = 0;	529	magic = 0;
593	}	530	}
594		531
595	magic = (RANDOM () % 3) ? magic : -magic;	532	magic = (rndm (3)) ? magic : -magic;
596	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */	533	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */
597		534
598	return magic;	535	return magic;
599	}	536	}
600		537
…		…
615	if (op->arch)	552	if (op->arch)
616	{	553	{
617	if (op->type == ARMOUR)	554	if (op->type == ARMOUR)
618	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	555	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;
619		556
620	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	557	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
621	magic = (-magic);	558	magic = (-magic);
622	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	559	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;
623	}	560	}
624	else	561	else
625	{	562	{
626	if (op->type == ARMOUR)	563	if (op->type == ARMOUR)
627	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	564	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
628	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	565	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
629	magic = (-magic);	566	magic = (-magic);
630	op->weight = (op->weight * (100 - magic * 10)) / 100;	567	op->weight = (op->weight * (100 - magic * 10)) / 100;
631	}	568	}
632	}	569	}
633		570
…		…
657	* 1) Since rings can have multiple bonuses, if the same bonus	594	* 1) Since rings can have multiple bonuses, if the same bonus
658	* is rolled again, increase it - the bonuses now stack with	595	* is rolled again, increase it - the bonuses now stack with
659	* other bonuses previously rolled and ones the item might natively have.	596	* other bonuses previously rolled and ones the item might natively have.
660	* 2) Add code to deal with new PR method.	597	* 2) Add code to deal with new PR method.
661	*/	598	*/
662
663	void	599	void
664	set_ring_bonus (object *op, int bonus)	600	set_ring_bonus (object *op, int bonus)
665	{	601	{
666		602
667	int r = RANDOM () % (bonus > 0 ? 25 : 11);	603	int r = rndm (bonus > 0 ? 25 : 11);
668		604
669	if (op->type == AMULET)	605	if (op->type == AMULET)
670	{	606	{
671	if (!(RANDOM () % 21))	607	if (!(rndm (21)))
672	r = 20 + RANDOM () % 2;	608	r = 20 + rndm (2);
673	else	609	else
674	{	610	{
675	if (RANDOM () & 2)	611	if (rndm (2))
676	r = 10;	612	r = 10;
677	else	613	else
678	r = 11 + RANDOM () % 9;	614	r = 11 + rndm (9);
679	}	615	}
680	}	616	}
681		617
682	switch (r)	618	switch (r)
683	{	619	{
…		…
720	case 16:	656	case 16:
721	case 17:	657	case 17:
722	case 18:	658	case 18:
723	case 19:	659	case 19:
724	{	660	{
725	int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table;	661	int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
726		662
727	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */	663	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */
728	val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b;	664	val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
729		665
730	/* Cursed items need to have higher negative values to equal out with	666	/* Cursed items need to have higher negative values to equal out with
731	* positive values for how protections work out. Put another	667	* positive values for how protections work out. Put another
732	* little random element in since that they don't always end up with	668	* little random element in since that they don't always end up with
733	* even values.	669	* even values.
734	*/	670	*/
735	if (bonus < 0)	671	if (bonus < 0)
736	val = 2 * -val - RANDOM () % b;	672	val = 2 * -val - rndm (b);
737	if (val > 35)	673	if (val > 35)
738	val = 35; /* Upper limit */	674	val = 35; /* Upper limit */
739	b = 0;	675	b = 0;
		676
740	while (op->resist[resist_table[resist]] != 0 && b < 4)	677	while (op->resist[resist_table[resist]] != 0 && b < 4)
741	{
742	resist = RANDOM () % num_resist_table;	678	resist = rndm (num_resist_table);
743	}	679
744	if (b == 4)	680	if (b == 4)
745	return; /* Not able to find a free resistance */	681	return; /* Not able to find a free resistance */
		682
746	op->resist[resist_table[resist]] = val;	683	op->resist[resist_table[resist]] = val;
747	/* We should probably do something more clever here to adjust value	684	/* We should probably do something more clever here to adjust value
748	* based on how good a resistance we gave.	685	* based on how good a resistance we gave.
749	*/	686	*/
750	break;	687	break;
…		…
778	case 22:	715	case 22:
779	op->stats.exp += bonus; /* Speed! */	716	op->stats.exp += bonus; /* Speed! */
780	op->value = (op->value * 2) / 3;	717	op->value = (op->value * 2) / 3;
781	break;	718	break;
782	}	719	}
		720
783	if (bonus > 0)	721	if (bonus > 0)
784	op->value = 2 bonus;	722	op->value = 2 bonus;
785	else	723	else
786	op->value = -(op->value * 2 * bonus) / 3;	724	op->value = -(op->value * 2 * bonus) / 3;
787	}	725	}
…		…
792	* higher is the chance of returning a low number.	730	* higher is the chance of returning a low number.
793	* It is only used in fix_generated_treasure() to set bonuses on	731	* It is only used in fix_generated_treasure() to set bonuses on
794	* rings and amulets.	732	* rings and amulets.
795	* Another scheme is used to calculate the magic of weapons and armours.	733	* Another scheme is used to calculate the magic of weapons and armours.
796	*/	734	*/
797
798	int	735	int
799	get_magic (int diff)	736	get_magic (int diff)
800	{	737	{
801	int i;	738	int i;
802		739
803	if (diff < 3)	740	if (diff < 3)
804	diff = 3;	741	diff = 3;
		742
805	for (i = 0; i < 4; i++)	743	for (i = 0; i < 4; i++)
806	if (RANDOM () % diff)	744	if (rndm (diff))
807	return i;	745	return i;
		746
808	return 4;	747	return 4;
809	}	748	}
810		749
811	#define DICE2 (get_magic(2)==2?2:1)	750	#define DICE2 (get_magic(2)==2?2:1)
812	#define DICESPELL (RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3)	751	#define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))
813		752
814	/*	753	/*
815	* fix_generated_item(): This is called after an item is generated, in	754	* 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	755	* order to set it up right. This produced magical bonuses, puts spells
817	* into scrolls/books/wands, makes it unidentified, hides the value, etc.	756	* into scrolls/books/wands, makes it unidentified, hides the value, etc.
…		…
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
…		…
878	if (!op->magic && max_magic)	816	if (!op->magic && max_magic)
879	set_magic (difficulty, op, max_magic, flags);	817	set_magic (difficulty, op, max_magic, flags);
880		818
881	num_enchantments = calc_item_power (op, 1);	819	num_enchantments = calc_item_power (op, 1);
882		820
883	if ((!was_magic && !(RANDOM () % CHANCE_FOR_ARTIFACT)) \|\| op->type == HORN \|\| difficulty >= settings.max_level) /* high difficulties always generate an artifact,	821	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
		822	\|\| op->type == HORN
		823	\|\| difficulty >= settings.max_level) /* high difficulties always generate an artifact,
884	* used for shop_floors or treasures */	824	* used for shop_floors or treasures */
885	generate_artifact (op, difficulty);	825	generate_artifact (op, difficulty);
886	}	826	}
887		827
888	/* Object was made an artifact. Calculate its item_power rating.	828	/* Object was made an artifact. Calculate its item_power rating.
…		…
946	case WEAPON:	886	case WEAPON:
947	case ARMOUR:	887	case ARMOUR:
948	case SHIELD:	888	case SHIELD:
949	case HELMET:	889	case HELMET:
950	case CLOAK:	890	case CLOAK:
951	if (QUERY_FLAG (op, FLAG_CURSED) && !(RANDOM () % 4))	891	if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
952	set_ring_bonus (op, -DICE2);	892	set_ring_bonus (op, -DICE2);
953	break;	893	break;
954		894
955	case BRACERS:	895	case BRACERS:
956	if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)))	896	if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
957	{	897	{
958	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	898	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
959	if (!QUERY_FLAG (op, FLAG_CURSED))	899	if (!QUERY_FLAG (op, FLAG_CURSED))
960	op->value *= 3;	900	op->value *= 3;
961	}	901	}
…		…
987	*/	927	*/
988	if (op->inv && op->randomitems)	928	if (op->inv && op->randomitems)
989	{	929	{
990	/* value multiplier is same as for scrolls */	930	/* value multiplier is same as for scrolls */
991	op->value = (op->value * op->inv->value);	931	op->value = (op->value * op->inv->value);
992	op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty;	932	op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
993	}	933	}
994	else	934	else
995	{	935	{
996	op->name = "potion";	936	op->name = "potion";
997	op->name_pl = "potions";	937	op->name_pl = "potions";
998	}	938	}
999		939
1000	if (!(flags & GT_ONLY_GOOD) && RANDOM () % 2)	940	if (!(flags & GT_ONLY_GOOD) && rndm (2))
1001	SET_FLAG (op, FLAG_CURSED);	941	SET_FLAG (op, FLAG_CURSED);
1002	break;	942	break;
1003	}	943	}
1004		944
1005	case AMULET:	945	case AMULET:
…		…
1015	}	955	}
1016		956
1017	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */	957	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */
1018	break;	958	break;
1019		959
1020	if (!(flags & GT_ONLY_GOOD) && !(RANDOM () % 3))	960	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1021	SET_FLAG (op, FLAG_CURSED);	961	SET_FLAG (op, FLAG_CURSED);
1022		962
1023	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	963	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
1024		964
1025	if (op->type != RING) /* Amulets have only one ability */	965	if (op->type != RING) /* Amulets have only one ability */
1026	break;	966	break;
1027		967
1028	if (!(RANDOM () % 4))	968	if (!(rndm (4)))
1029	{	969	{
1030	int d = (RANDOM () % 2 \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	970	int d = (rndm (2) \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1031		971
1032	if (d > 0)	972	if (d > 0)
1033	op->value *= 3;	973	op->value *= 3;
1034		974
1035	set_ring_bonus (op, d);	975	set_ring_bonus (op, d);
1036		976
1037	if (!(RANDOM () % 4))	977	if (!(rndm (4)))
1038	{	978	{
1039	int d = (RANDOM () % 3 \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	979	int d = (rndm (3) \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1040		980
1041	if (d > 0)	981	if (d > 0)
1042	op->value *= 5;	982	op->value *= 5;
1043	set_ring_bonus (op, d);	983	set_ring_bonus (op, d);
1044	}	984	}
1045	}	985	}
1046		986
1047	if (GET_ANIM_ID (op))	987	if (GET_ANIM_ID (op))
1048	SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op)));	988	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1049		989
1050	break;	990	break;
1051		991
1052	case BOOK:	992	case BOOK:
1053	/* Is it an empty book?, if yes lets make a special·	993	/* Is it an empty book?, if yes lets make a special·
1054	* msg for it, and tailor its properties based on the·	994	* msg for it, and tailor its properties based on the·
1055	* creator and/or map level we found it on.	995	* creator and/or map level we found it on.
1056	*/	996	*/
1057	if (!op->msg && RANDOM () % 10)	997	if (!op->msg && rndm (10))
1058	{	998	{
1059	/* set the book level properly */	999	/* set the book level properly */
1060	if (creator->level == 0 \|\| QUERY_FLAG (creator, FLAG_ALIVE))	1000	if (creator->level == 0 \|\| QUERY_FLAG (creator, FLAG_ALIVE))
1061	{	1001	{
1062	if (op->map && op->map->difficulty)	1002	if (op->map && op->map->difficulty)
1063	op->level = RANDOM () % (op->map->difficulty) + RANDOM () % 10 + 1;	1003	op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1064	else	1004	else
1065	op->level = RANDOM () % 20 + 1;	1005	op->level = rndm (20) + 1;
1066	}	1006	}
1067	else	1007	else
1068	op->level = RANDOM () % creator->level;	1008	op->level = rndm (creator->level);
1069		1009
1070	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);	1010	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);
1071	/* books w/ info are worth more! */	1011	/* books w/ info are worth more! */
1072	op->value = ((op->level > 10 ? op->level : (op->level + 1) / 2) ((strlen (op->msg) / 250) + 1));	1012	op->value = ((op->level > 10 ? op->level : (op->level + 1) / 2) ((strlen (op->msg) / 250) + 1));
1073	/* creator related stuff */	1013	/* creator related stuff */
…		…
1172	*/	1112	*/
1173		1113
1174	/*	1114	/*
1175	* Allocate and return the pointer to an empty artifactlist structure.	1115	* Allocate and return the pointer to an empty artifactlist structure.
1176	*/	1116	*/
1177
1178	static artifactlist *	1117	static artifactlist *
1179	get_empty_artifactlist (void)	1118	get_empty_artifactlist (void)
1180	{	1119	{
1181	artifactlist tl = (artifactlist ) malloc (sizeof (artifactlist));	1120	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	}	1121	}
1190		1122
1191	/*	1123	/*
1192	* Allocate and return the pointer to an empty artifact structure.	1124	* Allocate and return the pointer to an empty artifact structure.
1193	*/	1125	*/
1194
1195	static artifact *	1126	static artifact *
1196	get_empty_artifact (void)	1127	get_empty_artifact (void)
1197	{	1128	{
1198	artifact t = (artifact ) malloc (sizeof (artifact));	1129	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	}	1130	}
1209		1131
1210	/*	1132	/*
1211	* 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
1212	* of objects on it.	1134	* of objects on it.
1213	*/	1135	*/
1214
1215	artifactlist *	1136	artifactlist *
1216	find_artifactlist (int type)	1137	find_artifactlist (int type)
1217	{	1138	{
1218	artifactlist *al;
1219
1220	for (al = first_artifactlist; al != NULL; al = al->next)	1139	for (artifactlist *al = first_artifactlist; al; al = al->next)
1221	if (al->type == type)	1140	if (al->type == type)
1222	return al;	1141	return al;
		1142
1223	return NULL;	1143	return 0;
1224	}	1144	}
1225		1145
1226	/*	1146	/*
1227	* For debugging purposes. Dumps all tables.	1147	* For debugging purposes. Dumps all tables.
1228	*/	1148	*/
1229
1230	void	1149	void
1231	dump_artifacts (void)	1150	dump_artifacts (void)
1232	{	1151	{
1233	artifactlist *al;	1152	artifactlist *al;
1234	artifact *art;	1153	artifact *art;
…		…
1241	for (art = al->items; art != NULL; art = art->next)	1160	for (art = al->items; art != NULL; art = art->next)
1242	{	1161	{
1243	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);
1244	if (art->allowed != NULL)	1163	if (art->allowed != NULL)
1245	{	1164	{
1246	fprintf (logfile, "\tAllowed combinations:");	1165	fprintf (logfile, "\tallowed combinations:");
1247	for (next = art->allowed; next != NULL; next = next->next)	1166	for (next = art->allowed; next != NULL; next = next->next)
1248	fprintf (logfile, "%s,", &next->name);	1167	fprintf (logfile, "%s,", &next->name);
1249	fprintf (logfile, "\n");	1168	fprintf (logfile, "\n");
1250	}	1169	}
1251	}	1170	}
…		…
1262	treasurelist *tl;	1181	treasurelist *tl;
1263	int i;	1182	int i;
1264		1183
1265	if (depth > 100)	1184	if (depth > 100)
1266	return;	1185	return;
1267	while (t != NULL)	1186
		1187	while (t)
1268	{	1188	{
1269	if (t->name != NULL)	1189	if (t->name)
1270	{	1190	{
1271	for (i = 0; i < depth; i++)	1191	for (i = 0; i < depth; i++)
1272	fprintf (logfile, " ");	1192	fprintf (logfile, " ");
		1193
1273	fprintf (logfile, "{ (list: %s)\n", &t->name);	1194	fprintf (logfile, "{ (list: %s)\n", &t->name);
		1195
1274	tl = find_treasurelist (t->name);	1196	tl = treasurelist::find (t->name);
1275	if (tl)	1197	if (tl)
1276	dump_monster_treasure_rec (name, tl->items, depth + 2);	1198	dump_monster_treasure_rec (name, tl->items, depth + 2);
		1199
1277	for (i = 0; i < depth; i++)	1200	for (i = 0; i < depth; i++)
1278	fprintf (logfile, " ");	1201	fprintf (logfile, " ");
		1202
1279	fprintf (logfile, "} (end of list: %s)\n", &t->name);	1203	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1280	}	1204	}
1281	else	1205	else
1282	{	1206	{
1283	for (i = 0; i < depth; i++)	1207	for (i = 0; i < depth; i++)
1284	fprintf (logfile, " ");	1208	fprintf (logfile, " ");
		1209
1285	if (t->item->clone.type == FLESH)	1210	if (t->item && t->item->clone.type == FLESH)
1286	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);	1211	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1287	else	1212	else
1288	fprintf (logfile, "%s\n", &t->item->clone.name);	1213	fprintf (logfile, "%s\n", &t->item->clone.name);
1289	}	1214	}
		1215
1290	if (t->next_yes != NULL)	1216	if (t->next_yes)
1291	{	1217	{
1292	for (i = 0; i < depth; i++)	1218	for (i = 0; i < depth; i++)
1293	fprintf (logfile, " ");	1219	fprintf (logfile, " ");
		1220
1294	fprintf (logfile, " (if yes)\n");	1221	fprintf (logfile, " (if yes)\n");
1295	dump_monster_treasure_rec (name, t->next_yes, depth + 1);	1222	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1296	}	1223	}
		1224
1297	if (t->next_no != NULL)	1225	if (t->next_no)
1298	{	1226	{
1299	for (i = 0; i < depth; i++)	1227	for (i = 0; i < depth; i++)
1300	fprintf (logfile, " ");	1228	fprintf (logfile, " ");
		1229
1301	fprintf (logfile, " (if no)\n");	1230	fprintf (logfile, " (if no)\n");
1302	dump_monster_treasure_rec (name, t->next_no, depth + 1);	1231	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1303	}	1232	}
		1233
1304	t = t->next;	1234	t = t->next;
1305	}	1235	}
1306	}	1236	}
1307		1237
1308	/*	1238	/*
1309	* For debugging purposes. Dumps all treasures for a given monster.	1239	* For debugging purposes. Dumps all treasures for a given monster.
1310	* Created originally by Raphael Quinet for debugging the alchemy code.	1240	* Created originally by Raphael Quinet for debugging the alchemy code.
1311	*/	1241	*/
1312
1313	void	1242	void
1314	dump_monster_treasure (const char *name)	1243	dump_monster_treasure (const char *name)
1315	{	1244	{
1316	archetype *at;	1245	archetype *at;
1317	int found;	1246	int found;
1318		1247
1319	found = 0;	1248	found = 0;
1320	fprintf (logfile, "\n");	1249	fprintf (logfile, "\n");
		1250
1321	for (at = first_archetype; at != NULL; at = at->next)	1251	for (at = first_archetype; at != NULL; at = at->next)
1322	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)	1252	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1323	{	1253	{
1324	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);
1325	if (at->clone.randomitems != NULL)	1255	if (at->clone.randomitems != NULL)
1326	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);
1327	else	1257	else
1328	fprintf (logfile, "(nothing)\n");	1258	fprintf (logfile, "(nothing)\n");
		1259
1329	fprintf (logfile, "\n");	1260	fprintf (logfile, "\n");
1330	found++;	1261	found++;
1331	}	1262	}
		1263
1332	if (found == 0)	1264	if (found == 0)
1333	fprintf (logfile, "No objects have the name %s!\n\n", name);	1265	fprintf (logfile, "No objects have the name %s!\n\n", name);
1334	}	1266	}
1335		1267
1336	/*	1268	/*
1337	* 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.
1338	*/	1270	*/
1339
1340	void	1271	void
1341	init_artifacts (void)	1272	init_artifacts (void)
1342	{	1273	{
1343	static int has_been_inited = 0;	1274	static int has_been_inited = 0;
1344	char filename[MAX_BUF], buf[HUGE_BUF], cp, next;	1275	char filename[MAX_BUF];
1345	artifact *art = NULL;	1276	artifact *art = NULL;
1346	linked_char *tmp;
1347	int value;
1348	artifactlist *al;	1277	artifactlist *al;
1349		1278
1350	if (has_been_inited)	1279	if (has_been_inited)
1351	return;	1280	return;
1352	else	1281	else
1353	has_been_inited = 1;	1282	has_been_inited = 1;
1354		1283
1355	sprintf (filename, "%s/artifacts", settings.datadir);	1284	sprintf (filename, "%s/artifacts", settings.datadir);
1356	object_thawer thawer (filename);	1285	object_thawer f (filename);
1357		1286
1358	if (!thawer)	1287	if (!f)
1359	return;	1288	return;
1360		1289
1361	while (fgets (buf, HUGE_BUF, thawer) != NULL)	1290	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		1291
1373	if (!strncmp (cp, "Allowed", 7))	1292	for (;;)
		1293	{
		1294	switch (f.kw)
1374	{	1295	{
		1296	case KW_allowed:
1375	if (art == NULL)	1297	if (!art)
		1298	art = get_empty_artifact ();
		1299
1376	{	1300	{
1377	art = get_empty_artifact ();	1301	if (!strcmp (f.get_str (), "all"))
1378	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));
1379	}	1318	}
1380	cp = strchr (cp, ' ') + 1;	1319	break;
1381	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	f.get (art->item->name);
		1333	f.next ();
		1334
		1335	if (!art->item->parse_kv (f))
		1336	LOG (llevError, "Init_Artifacts: Could not load object.\n");
		1337
		1338	al = find_artifactlist (art->item->type);
		1339
		1340	if (!al)
		1341	{
		1342	al = get_empty_artifactlist ();
		1343	al->type = art->item->type;
		1344	al->next = first_artifactlist;
		1345	first_artifactlist = al;
		1346	}
		1347
		1348	art->next = al->items;
		1349	al->items = art;
		1350	art = 0;
		1351	}
1382	continue;	1352	continue;
1383		1353
1384	do	1354	case KW_EOF:
		1355	goto done;
		1356
		1357	default:
		1358	if (!f.parse_error ("artifacts file"))
		1359	cleanup ("artifacts file required");
1385	{	1360	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	{	1361	}
1403	art->item = object::create ();
1404		1362
1405	if (!load_object (thawer, art->item, 0))	1363	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	}	1364	}
1424		1365
		1366	done:
1425	for (al = first_artifactlist; al != NULL; al = al->next)	1367	for (al = first_artifactlist; al; al = al->next)
1426	{	1368	{
		1369	al->total_chance = 0;
		1370
1427	for (art = al->items; art != NULL; art = art->next)	1371	for (art = al->items; art; art = art->next)
1428	{	1372	{
1429	if (!art->chance)	1373	if (!art->chance)
1430	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1374	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1431	else	1375	else
1432	al->total_chance += art->chance;	1376	al->total_chance += art->chance;
…		…
1437	}	1381	}
1438		1382
1439	LOG (llevDebug, "done.\n");	1383	LOG (llevDebug, "done.\n");
1440	}	1384	}
1441		1385
1442
1443	/*	1386	/*
1444	* Used in artifact generation. The bonuses of the first object	1387	* Used in artifact generation. The bonuses of the first object
1445	* is modified by the bonuses of the second object.	1388	* is modified by the bonuses of the second object.
1446	*/	1389	*/
1447
1448	void	1390	void
1449	add_abilities (object op, object change)	1391	add_abilities (object op, object change)
1450	{	1392	{
1451	int i, tmp;	1393	int i, tmp;
1452		1394
1453	if (change->face != blank_face)	1395	if (change->face != blank_face)
1454	{	1396	{
1455	#ifdef TREASURE_VERBOSE	1397	#ifdef TREASURE_VERBOSE
1456	LOG (llevDebug, "FACE: %d\n", change->face->number);	1398	LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1457	#endif	1399	#endif
1458	op->face = change->face;	1400	op->face = change->face;
1459	}	1401	}
1460		1402
1461	for (i = 0; i < NUM_STATS; i++)	1403	for (i = 0; i < NUM_STATS; i++)
…		…
1501		1443
1502	op->set_speed (op->speed);	1444	op->set_speed (op->speed);
1503	}	1445	}
1504		1446
1505	if (change->nrof)	1447	if (change->nrof)
1506	op->nrof = RANDOM () % ((int) change->nrof) + 1;	1448	op->nrof = rndm (change->nrof) + 1;
1507		1449
1508	op->stats.exp += change->stats.exp; /* Speed modifier */	1450	op->stats.exp += change->stats.exp; /* Speed modifier */
1509	op->stats.wc += change->stats.wc;	1451	op->stats.wc += change->stats.wc;
1510	op->stats.ac += change->stats.ac;	1452	op->stats.ac += change->stats.ac;
1511		1453
…		…
1614	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);	1556	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);
1615	}	1557	}
1616		1558
1617	op->value *= change->value;	1559	op->value *= change->value;
1618		1560
1619	if (change->material)	1561	if (change->materials)
1620	op->material = change->material;	1562	op->materials = change->materials;
1621		1563
1622	if (change->materialname)	1564	if (change->materialname)
1623	op->materialname = change->materialname;	1565	op->materialname = change->materialname;
1624		1566
1625	if (change->slaying)	1567	if (change->slaying)
…		…
1642	if (art->allowed == (linked_char *) NULL)	1584	if (art->allowed == (linked_char *) NULL)
1643	return 1; /* Ie, "all" */	1585	return 1; /* Ie, "all" */
1644	for (tmp = art->allowed; tmp; tmp = tmp->next)	1586	for (tmp = art->allowed; tmp; tmp = tmp->next)
1645	{	1587	{
1646	#ifdef TREASURE_VERBOSE	1588	#ifdef TREASURE_VERBOSE
1647	LOG (llevDebug, "legal_art: %s\n", tmp->name);	1589	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1648	#endif	1590	#endif
1649	if (*tmp->name == '!')	1591	if (*tmp->name == '!')
1650	name = tmp->name + 1, neg = 1;	1592	name = tmp->name + 1, neg = 1;
1651	else	1593	else
1652	name = tmp->name, neg = 0;	1594	name = tmp->name, neg = 0;
…		…
1719	return;	1661	return;
1720	}	1662	}
1721		1663
1722	for (i = 0; i < ARTIFACT_TRIES; i++)	1664	for (i = 0; i < ARTIFACT_TRIES; i++)
1723	{	1665	{
1724	int roll = RANDOM () % al->total_chance;	1666	int roll = rndm (al->total_chance);
1725		1667
1726	for (art = al->items; art != NULL; art = art->next)	1668	for (art = al->items; art; art = art->next)
1727	{	1669	{
1728	roll -= art->chance;	1670	roll -= art->chance;
1729	if (roll < 0)	1671	if (roll < 0)
1730	break;	1672	break;
1731	}	1673	}
…		…
1747	continue;	1689	continue;
1748		1690
1749	if (!legal_artifact_combination (op, art))	1691	if (!legal_artifact_combination (op, art))
1750	{	1692	{
1751	#ifdef TREASURE_VERBOSE	1693	#ifdef TREASURE_VERBOSE
1752	LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name);	1694	LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1753	#endif	1695	#endif
1754	continue;	1696	continue;
1755	}	1697	}
		1698
1756	give_artifact_abilities (op, art->item);	1699	give_artifact_abilities (op, art->item);
1757	return;	1700	return;
1758	}	1701	}
1759	}	1702	}
1760		1703
…		…
1804	SET_FLAG (item, FLAG_NO_STEAL);	1747	SET_FLAG (item, FLAG_NO_STEAL);
1805	}	1748	}
1806	}	1749	}
1807		1750
1808	/* special_potion() - so that old potion code is still done right. */	1751	/* special_potion() - so that old potion code is still done right. */
1809
1810	int	1752	int
1811	special_potion (object *op)	1753	special_potion (object *op)
1812	{	1754	{
1813
1814	int i;
1815
1816	if (op->attacktype)	1755	if (op->attacktype)
1817	return 1;	1756	return 1;
1818		1757
1819	if (op->stats.Str \|\| op->stats.Dex \|\| op->stats.Con \|\| op->stats.Pow \|\| op->stats.Wis \|\| op->stats.Int \|\| op->stats.Cha)	1758	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;	1759	return 1;
1821		1760
1822	for (i = 0; i < NROFATTACKS; i++)	1761	for (int i = 0; i < NROFATTACKS; i++)
1823	if (op->resist[i])	1762	if (op->resist[i])
1824	return 1;	1763	return 1;
1825		1764
1826	return 0;	1765	return 0;
1827	}	1766	}
1828		1767
1829	void	1768	void
1830	free_treasurestruct (treasure *t)	1769	free_treasurestruct (treasure *t)
1831	{	1770	{
1832	if (t->next)
1833	free_treasurestruct (t->next);	1771	if (t->next) free_treasurestruct (t->next);
1834	if (t->next_yes)
1835	free_treasurestruct (t->next_yes);	1772	if (t->next_yes) free_treasurestruct (t->next_yes);
1836	if (t->next_no)
1837	free_treasurestruct (t->next_no);	1773	if (t->next_no) free_treasurestruct (t->next_no);
1838		1774
1839	delete t;	1775	delete t;
1840	}	1776	}
1841		1777
1842	void	1778	void
…		…
1847		1783
1848	delete lc;	1784	delete lc;
1849	}	1785	}
1850		1786
1851	void	1787	void
1852	free_artifact (artifact * at)	1788	free_artifact (artifact *at)
1853	{	1789	{
1854	if (at->next)
1855	free_artifact (at->next);	1790	if (at->next) free_artifact (at->next);
1856
1857	if (at->allowed)
1858	free_charlinks (at->allowed);	1791	if (at->allowed) free_charlinks (at->allowed);
1859		1792
1860	at->item->destroy (1);	1793	at->item->destroy (1);
1861		1794
1862	delete at;	1795	sfree (at);
1863	}	1796	}
1864		1797
1865	void	1798	void
1866	free_artifactlist (artifactlist * al)	1799	free_artifactlist (artifactlist *al)
1867	{	1800	{
1868	artifactlist *nextal;	1801	artifactlist *nextal;
1869		1802
1870	for (al = first_artifactlist; al; al = nextal)	1803	for (al = first_artifactlist; al; al = nextal)
1871	{	1804	{
1872	nextal = al->next;	1805	nextal = al->next;
1873		1806
1874	if (al->items)	1807	if (al->items)
1875	free_artifact (al->items);	1808	free_artifact (al->items);
1876		1809
1877	free (al);	1810	sfree (al);
1878	}	1811	}
1879	}	1812	}
1880		1813
1881	void	1814	void
1882	free_all_treasures (void)	1815	free_all_treasures (void)
1883	{	1816	{
1884	treasurelist tl, next;	1817	treasurelist tl, next;
1885		1818
1886
1887	for (tl = first_treasurelist; tl != NULL; tl = next)	1819	for (tl = first_treasurelist; tl; tl = next)
1888	{	1820	{
		1821	clear (tl);
		1822
1889	next = tl->next;	1823	next = tl->next;
1890	if (tl->items)
1891	free_treasurestruct (tl->items);
1892	delete tl;	1824	delete tl;
1893	}	1825	}
		1826
1894	free_artifactlist (first_artifactlist);	1827	free_artifactlist (first_artifactlist);
1895	}	1828	}

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.49 by root, Tue Apr 17 18:59:05 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.49 by root, Tue Apr 17 18:59:05 2007 UTC