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

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.30 by elmex, Wed Jan 3 02:30:51 2007 UTC vs.
Revision 1.43 by root, Mon Apr 16 11:09:30 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/common/treasure.C (file contents): Revision 1.30 by elmex, Wed Jan 3 02:30:51 2007 UTC vs. Revision 1.43 by root, Mon Apr 16 11:09:30 2007 UTC

Diff Legend

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.30 by elmex, Wed Jan 3 02:30:51 2007 UTC vs.
Revision 1.43 by root, Mon Apr 16 11:09:30 2007 UTC