[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.48 by root, Tue Apr 17 18:40:31 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->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);
163	/* find_treasurelist will print out its own error message */
164	if (t->name && *t->name)
165	find_treasurelist (t->name);
166	if (t->next)
167	check_treasurelist (t->next, tl);
168	if (t->next_yes)
169	check_treasurelist (t->next_yes, tl);
170	if (t->next_no)
171	check_treasurelist (t->next_no, tl);
172	}
173	#endif
174		176
		177	return t;
		178	}
		179
		180	f.next ();
		181	}
		182	}
		183
175	/*	184	/*
176	* Opens LIBDIR/treasure and reads all treasure-declarations from it.
177	* Each treasure is parsed with the help of load_treasure().	185	* Each treasure is parsed with the help of load_treasure().
178	*/	186	*/
179		187	treasurelist *
180	void	188	treasurelist::read (object_thawer &f)
181	load_treasures (void)
182	{	189	{
183	FILE *fp;	190	assert (f.kw == KW_treasure \|\| f.kw == KW_treasureone);
184	char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];
185	treasurelist *previous = NULL;
186	treasure *t;
187	int comp, line = 0;
188		191
189	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	192	bool one = f.kw == KW_treasureone;
190	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	193	treasurelist *tl = treasurelist::get (f.get_str ());
191	{	194	clear (tl);
192	LOG (llevError, "Can't open treasure file.\n");	195	tl->items = read_treasure (f);
		196	if (!tl->items)
193	return;	197	return 0;
194	}
195	while (fgets (buf, MAX_BUF, fp) != NULL)
196	{
197	line++;
198	if (*buf == '#')
199	continue;
200		198
201	if (sscanf (buf, "treasureone %s\n", name) \|\| sscanf (buf, "treasure %s\n", name))
202	{
203	treasurelist *tl = get_empty_treasurelist ();
204
205	tl->name = name;
206	if (previous == NULL)
207	first_treasurelist = tl;
208	else
209	previous->next = tl;
210	previous = tl;
211	tl->items = load_treasure (fp, &line);
212
213	/* 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.
214	* 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
215	* fields of the treasures are not being used.	201	* fields of the treasures are not being used.
216	*/	202	*/
217	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)
218	{	210	{
219	for (t = tl->items; t != NULL; t = t->next)
220	{
221	#ifdef TREASURE_DEBUG
222	if (t->next_yes \|\| t->next_no)
223	{
224	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);
225	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");
226	}
227	#endif
228	tl->total_chance += t->chance;
229	}
230	}	213	}
231	}
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		214
237	#ifdef TREASURE_DEBUG	215	tl->total_chance += t->chance;
238	/* Perform some checks on how valid the treasure data actually is.	216	}
239	* verify that list transitions work (ie, the list that it is supposed	217	}
240	* to transition to exists). Also, verify that at least the name
241	* or archetype is set for each treasure element.
242	*/
243	for (previous = first_treasurelist; previous != NULL; previous = previous->next)
244	check_treasurelist (previous->items, previous);
245	#endif
246	}
247		218
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;
264
265	if (first_treasurelist)
266	LOG (llevError, "Couldn't find treasurelist %s\n", name);
267
268	return 0;	219	return tl;
269	}	220	}
270
271		221
272	/*	222	/*
273	* Generates the objects specified by the given treasure.	223	* Generates the objects specified by the given treasure.
274	* It goes recursively through the rest of the linked list.	224	* It goes recursively through the rest of the linked list.
275	* 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,
325		275
326	if (t->change_arch.slaying)	276	if (t->change_arch.slaying)
327	op->slaying = t->change_arch.slaying;	277	op->slaying = t->change_arch.slaying;
328	}	278	}
329		279
330	void	280	static void
331	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)
332	{	282	{
333	object *tmp;
334
335	if ((int) t->chance >= 100 \|\| (RANDOM () % 100 + 1) < (int) t->chance)	283	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)
336	{	284	{
337	if (t->name)	285	if (t->name)
338	{	286	{
339	if (difficulty >= t->magic)	287	if (difficulty >= t->magic)
340	{
341	treasurelist *tl = find_treasurelist (t->name);	288	if (treasurelist *tl = treasurelist::find (t->name))
342	if (tl)
343	create_treasure (tl, op, flag, difficulty, tries);	289	create_treasure (tl, op, flag, difficulty, tries);
344	}	290	else
		291	LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
345	}	292	}
346	else	293	else
347	{	294	{
348	if (t->item && (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE)))	295	if (t->item && (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE)))
349	{	296	{
350	tmp = arch_to_object (t->item);	297	object *tmp = arch_to_object (t->item);
		298
351	if (t->nrof && tmp->nrof <= 1)	299	if (t->nrof && tmp->nrof <= 1)
352	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	300	tmp->nrof = rndm (t->nrof) + 1;
		301
353	fix_generated_item (tmp, op, difficulty, t->magic, flag);	302	fix_generated_item (tmp, op, difficulty, t->magic, flag);
354	change_treasure (t, tmp);	303	change_treasure (t, tmp);
355	put_treasure (tmp, op, flag);	304	put_treasure (tmp, op, flag);
356	}	305	}
357	}	306	}
358		307
359	if (t->next_yes != NULL)	308	if (t->next_yes)
360	create_all_treasures (t->next_yes, op, flag, difficulty, tries);	309	create_all_treasures (t->next_yes, op, flag, difficulty, tries);
361	}	310	}
362	else if (t->next_no != NULL)	311	else if (t->next_no)
363	create_all_treasures (t->next_no, op, flag, difficulty, tries);	312	create_all_treasures (t->next_no, op, flag, difficulty, tries);
364		313
365	if (t->next != NULL)	314	if (t->next)
366	create_all_treasures (t->next, op, flag, difficulty, tries);	315	create_all_treasures (t->next, op, flag, difficulty, tries);
367	}	316	}
368		317
369	void	318	static void
370	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)
371	{	320	{
372	int value = RANDOM () % tl->total_chance;	321	int value = rndm (tl->total_chance);
373	treasure *t;	322	treasure *t;
374		323
375	if (tries++ > 100)	324	if (tries++ > 100)
376	{	325	{
377	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");
378	return;	327	return;
379	}	328	}
380		329
381	for (t = tl->items; t != NULL; t = t->next)	330	for (t = tl->items; t; t = t->next)
382	{	331	{
383	value -= t->chance;	332	value -= t->chance;
384		333
385	if (value < 0)	334	if (value < 0)
386	break;	335	break;
387	}	336	}
388		337
389	if (!t \|\| value >= 0)	338	if (!t \|\| value >= 0)
390	{
391	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);
392	abort ();
393	return;
394	}
395		340
396	if (t->name)	341	if (t->name)
397	{	342	{
398	if (difficulty >= t->magic)	343	if (difficulty >= t->magic)
399	{	344	{
400	treasurelist *tl = find_treasurelist (t->name);	345	treasurelist *tl = treasurelist::find (t->name);
401	if (tl)	346	if (tl)
402	create_treasure (tl, op, flag, difficulty, tries);	347	create_treasure (tl, op, flag, difficulty, tries);
403	}	348	}
404	else if (t->nrof)	349	else if (t->nrof)
405	create_one_treasure (tl, op, flag, difficulty, tries);	350	create_one_treasure (tl, op, flag, difficulty, tries);
406
407	return;
408	}	351	}
409
410	if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))	352	else if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))
411	{	353	{
412	object *tmp = arch_to_object (t->item);	354	if (object *tmp = arch_to_object (t->item))
413		355	{
414	if (!tmp)
415	return;
416
417	if (t->nrof && tmp->nrof <= 1)	356	if (t->nrof && tmp->nrof <= 1)
418	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	357	tmp->nrof = rndm (t->nrof) + 1;
419		358
420	fix_generated_item (tmp, op, difficulty, t->magic, flag);	359	fix_generated_item (tmp, op, difficulty, t->magic, flag);
421	change_treasure (t, tmp);	360	change_treasure (t, tmp);
422	put_treasure (tmp, op, flag);	361	put_treasure (tmp, op, flag);
		362	}
423	}	363	}
424	}	364	}
425		365
426	/* This calls the appropriate treasure creation function. tries is passed	366	/* This calls the appropriate treasure creation function. tries is passed
427	* to determine how many list transitions or attempts to create treasure	367	* to determine how many list transitions or attempts to create treasure
…		…
431	* to do that.	371	* to do that.
432	*/	372	*/
433	void	373	void
434	create_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)	374	create_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)
435	{	375	{
		376	// empty treasurelists are legal
		377	if (!tl->items)
		378	return;
436		379
437	if (tries++ > 100)	380	if (tries++ > 100)
438	{	381	{
439	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	382	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
440	return;	383	return;
441	}	384	}
		385
442	if (tl->total_chance)	386	if (tl->total_chance)
443	create_one_treasure (tl, op, flag, difficulty, tries);	387	create_one_treasure (tl, op, flag, difficulty, tries);
444	else	388	else
445	create_all_treasures (tl->items, op, flag, difficulty, tries);	389	create_all_treasures (tl->items, op, flag, difficulty, tries);
446	}	390	}
…		…
478	* magical bonus "wanted".	422	* magical bonus "wanted".
479	*/	423	*/
480		424
481	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	425	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
482		426
483	/chance of magic difficulty/	427	// chance of magic difficulty
484
485	/* +0 +1 +2 +3 +4 */	428	// +0 +1 +2 +3 +4
486	{95, 2, 2, 1, 0}, /1 /	429	{95, 2, 2, 1, 0}, // 1
487	{92, 5, 2, 1, 0}, /2 /	430	{92, 5, 2, 1, 0}, // 2
488	{85, 10, 4, 1, 0}, /3 /	431	{85, 10, 4, 1, 0}, // 3
489	{80, 14, 4, 2, 0}, /4 /	432	{80, 14, 4, 2, 0}, // 4
490	{75, 17, 5, 2, 1}, /5 /	433	{75, 17, 5, 2, 1}, // 5
491	{70, 18, 8, 3, 1}, /6 /	434	{70, 18, 8, 3, 1}, // 6
492	{65, 21, 10, 3, 1}, /7 /	435	{65, 21, 10, 3, 1}, // 7
493	{60, 22, 12, 4, 2}, /8 /	436	{60, 22, 12, 4, 2}, // 8
494	{55, 25, 14, 4, 2}, /9 /	437	{55, 25, 14, 4, 2}, // 9
495	{50, 27, 16, 5, 2}, /10 /	438	{50, 27, 16, 5, 2}, // 10
496	{45, 28, 18, 6, 3}, /11 /	439	{45, 28, 18, 6, 3}, // 11
497	{42, 28, 20, 7, 3}, /12 /	440	{42, 28, 20, 7, 3}, // 12
498	{40, 27, 21, 8, 4}, /13 /	441	{40, 27, 21, 8, 4}, // 13
499	{38, 25, 22, 10, 5}, /14 /	442	{38, 25, 22, 10, 5}, // 14
500	{36, 23, 23, 12, 6}, /15 /	443	{36, 23, 23, 12, 6}, // 15
501	{33, 21, 24, 14, 8}, /16 /	444	{33, 21, 24, 14, 8}, // 16
502	{31, 19, 25, 16, 9}, /17 /	445	{31, 19, 25, 16, 9}, // 17
503	{27, 15, 30, 18, 10}, /18 /	446	{27, 15, 30, 18, 10}, // 18
504	{20, 12, 30, 25, 13}, /19 /	447	{20, 12, 30, 25, 13}, // 19
505	{15, 10, 28, 30, 17}, /20 /	448	{15, 10, 28, 30, 17}, // 20
506	{13, 9, 27, 28, 23}, /21 /	449	{13, 9, 27, 28, 23}, // 21
507	{10, 8, 25, 28, 29}, /22 /	450	{10, 8, 25, 28, 29}, // 22
508	{8, 7, 23, 26, 36}, /23 /	451	{ 8, 7, 23, 26, 36}, // 23
509	{6, 6, 20, 22, 46}, /24 /	452	{ 6, 6, 20, 22, 46}, // 24
510	{4, 5, 17, 18, 56}, /25 /	453	{ 4, 5, 17, 18, 56}, // 25
511	{2, 4, 12, 14, 68}, /26 /	454	{ 2, 4, 12, 14, 68}, // 26
512	{0, 3, 7, 10, 80}, /27 /	455	{ 0, 3, 7, 10, 80}, // 27
513	{0, 0, 3, 7, 90}, /28 /	456	{ 0, 0, 3, 7, 90}, // 28
514	{0, 0, 0, 3, 97}, /29 /	457	{ 0, 0, 0, 3, 97}, // 29
515	{0, 0, 0, 0, 100}, /30 /	458	{ 0, 0, 0, 0, 100}, // 30
516	{0, 0, 0, 0, 100}, /31 /	459	{ 0, 0, 0, 0, 100}, // 31
517	};	460	};
518		461
519		462
520	/* calculate the appropriate level for wands staves and scrolls.	463	/* calculate the appropriate level for wands staves and scrolls.
521	* 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)
…		…
554	* elmex Thu Aug 10 18:45:44 CEST 2006:	497	* elmex Thu Aug 10 18:45:44 CEST 2006:
555	* 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
556	* weird integer between 1-31.	499	* weird integer between 1-31.
557	*	500	*
558	*/	501	*/
559
560	int	502	int
561	magic_from_difficulty (int difficulty)	503	magic_from_difficulty (int difficulty)
562	{	504	{
563	int percent = 0, magic = 0;	505	int percent = 0, magic = 0;
564	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	506	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
…		…
569	scaled_diff = 0;	511	scaled_diff = 0;
570		512
571	if (scaled_diff >= DIFFLEVELS)	513	if (scaled_diff >= DIFFLEVELS)
572	scaled_diff = DIFFLEVELS - 1;	514	scaled_diff = DIFFLEVELS - 1;
573		515
574	percent = RANDOM () % 100;	516	percent = rndm (100);
575		517
576	for (magic = 0; magic < (MAXMAGIC + 1); magic++)	518	for (magic = 0; magic < (MAXMAGIC + 1); magic++)
577	{	519	{
578	percent -= difftomagic_list[scaled_diff][magic];	520	percent -= difftomagic_list[scaled_diff][magic];
579		521
…		…
585	{	527	{
586	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);
587	magic = 0;	529	magic = 0;
588	}	530	}
589		531
590	magic = (RANDOM () % 3) ? magic : -magic;	532	magic = (rndm (3)) ? magic : -magic;
591	/* 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); */
592		534
593	return magic;	535	return magic;
594	}	536	}
595		537
…		…
610	if (op->arch)	552	if (op->arch)
611	{	553	{
612	if (op->type == ARMOUR)	554	if (op->type == ARMOUR)
613	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;
614		556
615	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 */
616	magic = (-magic);	558	magic = (-magic);
617	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	559	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;
618	}	560	}
619	else	561	else
620	{	562	{
621	if (op->type == ARMOUR)	563	if (op->type == ARMOUR)
622	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	564	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
623	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 */
624	magic = (-magic);	566	magic = (-magic);
625	op->weight = (op->weight * (100 - magic * 10)) / 100;	567	op->weight = (op->weight * (100 - magic * 10)) / 100;
626	}	568	}
627	}	569	}
628		570
…		…
652	* 1) Since rings can have multiple bonuses, if the same bonus	594	* 1) Since rings can have multiple bonuses, if the same bonus
653	* is rolled again, increase it - the bonuses now stack with	595	* is rolled again, increase it - the bonuses now stack with
654	* other bonuses previously rolled and ones the item might natively have.	596	* other bonuses previously rolled and ones the item might natively have.
655	* 2) Add code to deal with new PR method.	597	* 2) Add code to deal with new PR method.
656	*/	598	*/
657
658	void	599	void
659	set_ring_bonus (object *op, int bonus)	600	set_ring_bonus (object *op, int bonus)
660	{	601	{
661		602
662	int r = RANDOM () % (bonus > 0 ? 25 : 11);	603	int r = rndm (bonus > 0 ? 25 : 11);
663		604
664	if (op->type == AMULET)	605	if (op->type == AMULET)
665	{	606	{
666	if (!(RANDOM () % 21))	607	if (!(rndm (21)))
667	r = 20 + RANDOM () % 2;	608	r = 20 + rndm (2);
668	else	609	else
669	{	610	{
670	if (RANDOM () & 2)	611	if (rndm (2))
671	r = 10;	612	r = 10;
672	else	613	else
673	r = 11 + RANDOM () % 9;	614	r = 11 + rndm (9);
674	}	615	}
675	}	616	}
676		617
677	switch (r)	618	switch (r)
678	{	619	{
…		…
715	case 16:	656	case 16:
716	case 17:	657	case 17:
717	case 18:	658	case 18:
718	case 19:	659	case 19:
719	{	660	{
720	int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table;	661	int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
721		662
722	/* 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) */
723	val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b;	664	val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
724		665
725	/* 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
726	* positive values for how protections work out. Put another	667	* positive values for how protections work out. Put another
727	* 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
728	* even values.	669	* even values.
729	*/	670	*/
730	if (bonus < 0)	671	if (bonus < 0)
731	val = 2 * -val - RANDOM () % b;	672	val = 2 * -val - rndm (b);
732	if (val > 35)	673	if (val > 35)
733	val = 35; /* Upper limit */	674	val = 35; /* Upper limit */
734	b = 0;	675	b = 0;
		676
735	while (op->resist[resist_table[resist]] != 0 && b < 4)	677	while (op->resist[resist_table[resist]] != 0 && b < 4)
736	{
737	resist = RANDOM () % num_resist_table;	678	resist = rndm (num_resist_table);
738	}	679
739	if (b == 4)	680	if (b == 4)
740	return; /* Not able to find a free resistance */	681	return; /* Not able to find a free resistance */
		682
741	op->resist[resist_table[resist]] = val;	683	op->resist[resist_table[resist]] = val;
742	/* We should probably do something more clever here to adjust value	684	/* We should probably do something more clever here to adjust value
743	* based on how good a resistance we gave.	685	* based on how good a resistance we gave.
744	*/	686	*/
745	break;	687	break;
…		…
773	case 22:	715	case 22:
774	op->stats.exp += bonus; /* Speed! */	716	op->stats.exp += bonus; /* Speed! */
775	op->value = (op->value * 2) / 3;	717	op->value = (op->value * 2) / 3;
776	break;	718	break;
777	}	719	}
		720
778	if (bonus > 0)	721	if (bonus > 0)
779	op->value = 2 bonus;	722	op->value = 2 bonus;
780	else	723	else
781	op->value = -(op->value * 2 * bonus) / 3;	724	op->value = -(op->value * 2 * bonus) / 3;
782	}	725	}
…		…
787	* higher is the chance of returning a low number.	730	* higher is the chance of returning a low number.
788	* 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
789	* rings and amulets.	732	* rings and amulets.
790	* 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.
791	*/	734	*/
792
793	int	735	int
794	get_magic (int diff)	736	get_magic (int diff)
795	{	737	{
796	int i;	738	int i;
797		739
798	if (diff < 3)	740	if (diff < 3)
799	diff = 3;	741	diff = 3;
		742
800	for (i = 0; i < 4; i++)	743	for (i = 0; i < 4; i++)
801	if (RANDOM () % diff)	744	if (rndm (diff))
802	return i;	745	return i;
		746
803	return 4;	747	return 4;
804	}	748	}
805		749
806	#define DICE2 (get_magic(2)==2?2:1)	750	#define DICE2 (get_magic(2)==2?2:1)
807	#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))
808		752
809	/*	753	/*
810	* 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
811	* 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
812	* into scrolls/books/wands, makes it unidentified, hides the value, etc.	756	* into scrolls/books/wands, makes it unidentified, hides the value, etc.
…		…
826	* value.	770	* value.
827	* 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
828	* 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
829	* 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
830	*/	774	*/
831
832	void	775	void
833	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)
834	{	777	{
835	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;
836		779
…		…
843		786
844	if (op->randomitems && op->type != SPELL)	787	if (op->randomitems && op->type != SPELL)
845	{	788	{
846	create_treasure (op->randomitems, op, flags, difficulty, 0);	789	create_treasure (op->randomitems, op, flags, difficulty, 0);
847	if (!op->inv)	790	if (!op->inv)
848	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 ());
849		792
850	/* So the treasure doesn't get created again */	793	/* So the treasure doesn't get created again */
851	op->randomitems = NULL;	794	op->randomitems = 0;
852	}	795	}
853		796
854	if (difficulty < 1)	797	if (difficulty < 1)
855	difficulty = 1;	798	difficulty = 1;
856		799
…		…
873	if (!op->magic && max_magic)	816	if (!op->magic && max_magic)
874	set_magic (difficulty, op, max_magic, flags);	817	set_magic (difficulty, op, max_magic, flags);
875		818
876	num_enchantments = calc_item_power (op, 1);	819	num_enchantments = calc_item_power (op, 1);
877		820
878	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,
879	* used for shop_floors or treasures */	824	* used for shop_floors or treasures */
880	generate_artifact (op, difficulty);	825	generate_artifact (op, difficulty);
881	}	826	}
882		827
883	/* Object was made an artifact. Calculate its item_power rating.	828	/* Object was made an artifact. Calculate its item_power rating.
…		…
941	case WEAPON:	886	case WEAPON:
942	case ARMOUR:	887	case ARMOUR:
943	case SHIELD:	888	case SHIELD:
944	case HELMET:	889	case HELMET:
945	case CLOAK:	890	case CLOAK:
946	if (QUERY_FLAG (op, FLAG_CURSED) && !(RANDOM () % 4))	891	if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
947	set_ring_bonus (op, -DICE2);	892	set_ring_bonus (op, -DICE2);
948	break;	893	break;
949		894
950	case BRACERS:	895	case BRACERS:
951	if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)))	896	if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
952	{	897	{
953	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	898	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
954	if (!QUERY_FLAG (op, FLAG_CURSED))	899	if (!QUERY_FLAG (op, FLAG_CURSED))
955	op->value *= 3;	900	op->value *= 3;
956	}	901	}
…		…
982	*/	927	*/
983	if (op->inv && op->randomitems)	928	if (op->inv && op->randomitems)
984	{	929	{
985	/* value multiplier is same as for scrolls */	930	/* value multiplier is same as for scrolls */
986	op->value = (op->value * op->inv->value);	931	op->value = (op->value * op->inv->value);
987	op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty;	932	op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
988	}	933	}
989	else	934	else
990	{	935	{
991	op->name = "potion";	936	op->name = "potion";
992	op->name_pl = "potions";	937	op->name_pl = "potions";
993	}	938	}
994		939
995	if (!(flags & GT_ONLY_GOOD) && RANDOM () % 2)	940	if (!(flags & GT_ONLY_GOOD) && rndm (2))
996	SET_FLAG (op, FLAG_CURSED);	941	SET_FLAG (op, FLAG_CURSED);
997	break;	942	break;
998	}	943	}
999		944
1000	case AMULET:	945	case AMULET:
…		…
1010	}	955	}
1011		956
1012	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! */
1013	break;	958	break;
1014		959
1015	if (!(flags & GT_ONLY_GOOD) && !(RANDOM () % 3))	960	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1016	SET_FLAG (op, FLAG_CURSED);	961	SET_FLAG (op, FLAG_CURSED);
1017		962
1018	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	963	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
1019		964
1020	if (op->type != RING) /* Amulets have only one ability */	965	if (op->type != RING) /* Amulets have only one ability */
1021	break;	966	break;
1022		967
1023	if (!(RANDOM () % 4))	968	if (!(rndm (4)))
1024	{	969	{
1025	int d = (RANDOM () % 2 \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	970	int d = (rndm (2) \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1026		971
1027	if (d > 0)	972	if (d > 0)
1028	op->value *= 3;	973	op->value *= 3;
1029		974
1030	set_ring_bonus (op, d);	975	set_ring_bonus (op, d);
1031		976
1032	if (!(RANDOM () % 4))	977	if (!(rndm (4)))
1033	{	978	{
1034	int d = (RANDOM () % 3 \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	979	int d = (rndm (3) \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1035		980
1036	if (d > 0)	981	if (d > 0)
1037	op->value *= 5;	982	op->value *= 5;
1038	set_ring_bonus (op, d);	983	set_ring_bonus (op, d);
1039	}	984	}
1040	}	985	}
1041		986
1042	if (GET_ANIM_ID (op))	987	if (GET_ANIM_ID (op))
1043	SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op)));	988	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1044		989
1045	break;	990	break;
1046		991
1047	case BOOK:	992	case BOOK:
1048	/* Is it an empty book?, if yes lets make a special·	993	/* Is it an empty book?, if yes lets make a special·
1049	* msg for it, and tailor its properties based on the·	994	* msg for it, and tailor its properties based on the·
1050	* creator and/or map level we found it on.	995	* creator and/or map level we found it on.
1051	*/	996	*/
1052	if (!op->msg && RANDOM () % 10)	997	if (!op->msg && rndm (10))
1053	{	998	{
1054	/* set the book level properly */	999	/* set the book level properly */
1055	if (creator->level == 0 \|\| QUERY_FLAG (creator, FLAG_ALIVE))	1000	if (creator->level == 0 \|\| QUERY_FLAG (creator, FLAG_ALIVE))
1056	{	1001	{
1057	if (op->map && op->map->difficulty)	1002	if (op->map && op->map->difficulty)
1058	op->level = RANDOM () % (op->map->difficulty) + RANDOM () % 10 + 1;	1003	op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1059	else	1004	else
1060	op->level = RANDOM () % 20 + 1;	1005	op->level = rndm (20) + 1;
1061	}	1006	}
1062	else	1007	else
1063	op->level = RANDOM () % creator->level;	1008	op->level = rndm (creator->level);
1064		1009
1065	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);
1066	/* books w/ info are worth more! */	1011	/* books w/ info are worth more! */
1067	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));
1068	/* creator related stuff */	1013	/* creator related stuff */
…		…
1167	*/	1112	*/
1168		1113
1169	/*	1114	/*
1170	* Allocate and return the pointer to an empty artifactlist structure.	1115	* Allocate and return the pointer to an empty artifactlist structure.
1171	*/	1116	*/
1172
1173	static artifactlist *	1117	static artifactlist *
1174	get_empty_artifactlist (void)	1118	get_empty_artifactlist (void)
1175	{	1119	{
1176	artifactlist al = (artifactlist ) malloc (sizeof (artifactlist));	1120	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	}	1121	}
1185		1122
1186	/*	1123	/*
1187	* Allocate and return the pointer to an empty artifact structure.	1124	* Allocate and return the pointer to an empty artifact structure.
1188	*/	1125	*/
1189
1190	static artifact *	1126	static artifact *
1191	get_empty_artifact (void)	1127	get_empty_artifact (void)
1192	{	1128	{
1193	artifact a = (artifact ) malloc (sizeof (artifact));	1129	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	}	1130	}
1204		1131
1205	/*	1132	/*
1206	* 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
1207	* of objects on it.	1134	* of objects on it.
1208	*/	1135	*/
1209
1210	artifactlist *	1136	artifactlist *
1211	find_artifactlist (int type)	1137	find_artifactlist (int type)
1212	{	1138	{
1213	artifactlist *al;
1214
1215	for (al = first_artifactlist; al != NULL; al = al->next)	1139	for (artifactlist *al = first_artifactlist; al; al = al->next)
1216	if (al->type == type)	1140	if (al->type == type)
1217	return al;	1141	return al;
		1142
1218	return NULL;	1143	return 0;
1219	}	1144	}
1220		1145
1221	/*	1146	/*
1222	* For debugging purposes. Dumps all tables.	1147	* For debugging purposes. Dumps all tables.
1223	*/	1148	*/
1224
1225	void	1149	void
1226	dump_artifacts (void)	1150	dump_artifacts (void)
1227	{	1151	{
1228	artifactlist *al;	1152	artifactlist *al;
1229	artifact *art;	1153	artifact *art;
…		…
1236	for (art = al->items; art != NULL; art = art->next)	1160	for (art = al->items; art != NULL; art = art->next)
1237	{	1161	{
1238	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);
1239	if (art->allowed != NULL)	1163	if (art->allowed != NULL)
1240	{	1164	{
1241	fprintf (logfile, "\tAllowed combinations:");	1165	fprintf (logfile, "\tallowed combinations:");
1242	for (next = art->allowed; next != NULL; next = next->next)	1166	for (next = art->allowed; next != NULL; next = next->next)
1243	fprintf (logfile, "%s,", &next->name);	1167	fprintf (logfile, "%s,", &next->name);
1244	fprintf (logfile, "\n");	1168	fprintf (logfile, "\n");
1245	}	1169	}
1246	}	1170	}
…		…
1257	treasurelist *tl;	1181	treasurelist *tl;
1258	int i;	1182	int i;
1259		1183
1260	if (depth > 100)	1184	if (depth > 100)
1261	return;	1185	return;
		1186
1262	while (t)	1187	while (t)
1263	{	1188	{
1264	if (t->name)	1189	if (t->name)
1265	{	1190	{
1266	for (i = 0; i < depth; i++)	1191	for (i = 0; i < depth; i++)
1267	fprintf (logfile, " ");	1192	fprintf (logfile, " ");
		1193
1268	fprintf (logfile, "{ (list: %s)\n", &t->name);	1194	fprintf (logfile, "{ (list: %s)\n", &t->name);
		1195
1269	tl = find_treasurelist (t->name);	1196	tl = treasurelist::find (t->name);
1270	if (tl)	1197	if (tl)
1271	dump_monster_treasure_rec (name, tl->items, depth + 2);	1198	dump_monster_treasure_rec (name, tl->items, depth + 2);
		1199
1272	for (i = 0; i < depth; i++)	1200	for (i = 0; i < depth; i++)
1273	fprintf (logfile, " ");	1201	fprintf (logfile, " ");
		1202
1274	fprintf (logfile, "} (end of list: %s)\n", &t->name);	1203	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1275	}	1204	}
1276	else	1205	else
1277	{	1206	{
1278	for (i = 0; i < depth; i++)	1207	for (i = 0; i < depth; i++)
1279	fprintf (logfile, " ");	1208	fprintf (logfile, " ");
		1209
1280	if (t->item && t->item->clone.type == FLESH)	1210	if (t->item && t->item->clone.type == FLESH)
1281	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);	1211	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1282	else	1212	else
1283	fprintf (logfile, "%s\n", &t->item->clone.name);	1213	fprintf (logfile, "%s\n", &t->item->clone.name);
1284	}	1214	}
1285		1215
1286	if (t->next_yes)	1216	if (t->next_yes)
1287	{	1217	{
1288	for (i = 0; i < depth; i++)	1218	for (i = 0; i < depth; i++)
1289	fprintf (logfile, " ");	1219	fprintf (logfile, " ");
		1220
1290	fprintf (logfile, " (if yes)\n");	1221	fprintf (logfile, " (if yes)\n");
1291	dump_monster_treasure_rec (name, t->next_yes, depth + 1);	1222	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1292	}	1223	}
1293		1224
1294	if (t->next_no)	1225	if (t->next_no)
1295	{	1226	{
1296	for (i = 0; i < depth; i++)	1227	for (i = 0; i < depth; i++)
1297	fprintf (logfile, " ");	1228	fprintf (logfile, " ");
		1229
1298	fprintf (logfile, " (if no)\n");	1230	fprintf (logfile, " (if no)\n");
1299	dump_monster_treasure_rec (name, t->next_no, depth + 1);	1231	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1300	}	1232	}
1301		1233
1302	t = t->next;	1234	t = t->next;
…		…
1305		1237
1306	/*	1238	/*
1307	* For debugging purposes. Dumps all treasures for a given monster.	1239	* For debugging purposes. Dumps all treasures for a given monster.
1308	* Created originally by Raphael Quinet for debugging the alchemy code.	1240	* Created originally by Raphael Quinet for debugging the alchemy code.
1309	*/	1241	*/
1310
1311	void	1242	void
1312	dump_monster_treasure (const char *name)	1243	dump_monster_treasure (const char *name)
1313	{	1244	{
1314	archetype *at;	1245	archetype *at;
1315	int found;	1246	int found;
1316		1247
1317	found = 0;	1248	found = 0;
1318	fprintf (logfile, "\n");	1249	fprintf (logfile, "\n");
		1250
1319	for (at = first_archetype; at != NULL; at = at->next)	1251	for (at = first_archetype; at != NULL; at = at->next)
1320	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)	1252	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1321	{	1253	{
1322	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);
1323	if (at->clone.randomitems != NULL)	1255	if (at->clone.randomitems != NULL)
1324	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);
1325	else	1257	else
1326	fprintf (logfile, "(nothing)\n");	1258	fprintf (logfile, "(nothing)\n");
		1259
1327	fprintf (logfile, "\n");	1260	fprintf (logfile, "\n");
1328	found++;	1261	found++;
1329	}	1262	}
		1263
1330	if (found == 0)	1264	if (found == 0)
1331	fprintf (logfile, "No objects have the name %s!\n\n", name);	1265	fprintf (logfile, "No objects have the name %s!\n\n", name);
1332	}	1266	}
1333		1267
1334	/*	1268	/*
1335	* 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.
1336	*/	1270	*/
1337
1338	void	1271	void
1339	init_artifacts (void)	1272	init_artifacts (void)
1340	{	1273	{
1341	static int has_been_inited = 0;	1274	static int has_been_inited = 0;
1342	char filename[MAX_BUF], buf[HUGE_BUF], cp, next;	1275	char filename[MAX_BUF];
1343	artifact *art = NULL;	1276	artifact *art = NULL;
1344	linked_char *tmp;
1345	int value;
1346	artifactlist *al;	1277	artifactlist *al;
1347		1278
1348	if (has_been_inited)	1279	if (has_been_inited)
1349	return;	1280	return;
1350	else	1281	else
1351	has_been_inited = 1;	1282	has_been_inited = 1;
1352		1283
1353	sprintf (filename, "%s/artifacts", settings.datadir);	1284	sprintf (filename, "%s/artifacts", settings.datadir);
1354	object_thawer thawer (filename);	1285	object_thawer f (filename);
1355		1286
1356	if (!thawer)	1287	if (!f)
1357	return;	1288	return;
1358		1289
1359	while (fgets (buf, HUGE_BUF, thawer) != NULL)	1290	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		1291
1371	if (!strncmp (cp, "Allowed", 7))	1292	for (;;)
		1293	{
		1294	switch (f.kw)
1372	{	1295	{
		1296	case KW_allowed:
1373	if (art == NULL)	1297	if (!art)
		1298	art = get_empty_artifact ();
		1299
1374	{	1300	{
1375	art = get_empty_artifact ();	1301	if (!strcmp (f.get_str (), "all"))
1376	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));
1377	}	1318	}
1378	cp = strchr (cp, ' ') + 1;	1319	break;
1379	if (!strcmp (cp, "all"))	1320
		1321	case KW_chance:
		1322	f.get (art->chance);
		1323	break;
		1324
		1325	case KW_difficulty:
		1326	f.get (art->difficulty);
		1327	break;
		1328
		1329	case KW_object:
		1330	{
		1331	art->item = object::create ();
		1332
		1333	if (!art->item->parse_kv (f))
		1334	LOG (llevError, "Init_Artifacts: Could not load object.\n");
		1335
		1336	al = find_artifactlist (art->item->type);
		1337
		1338	if (!al)
		1339	{
		1340	al = get_empty_artifactlist ();
		1341	al->type = art->item->type;
		1342	al->next = first_artifactlist;
		1343	first_artifactlist = al;
		1344	}
		1345
		1346	art->next = al->items;
		1347	al->items = art;
		1348	art = 0;
		1349	}
1380	continue;	1350	continue;
1381		1351
1382	do	1352	case KW_EOF:
		1353	goto done;
		1354
		1355	default:
		1356	if (!f.parse_error ("artifacts file"))
		1357	cleanup ("artifacts file required");
1383	{	1358	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	{	1359	}
1401	art->item = object::create ();
1402		1360
1403	if (!load_object (thawer, art->item, 0))	1361	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	}	1362	}
1422		1363
		1364	done:
1423	for (al = first_artifactlist; al != NULL; al = al->next)	1365	for (al = first_artifactlist; al; al = al->next)
1424	{	1366	{
		1367	al->total_chance = 0;
		1368
1425	for (art = al->items; art != NULL; art = art->next)	1369	for (art = al->items; art; art = art->next)
1426	{	1370	{
1427	if (!art->chance)	1371	if (!art->chance)
1428	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1372	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1429	else	1373	else
1430	al->total_chance += art->chance;	1374	al->total_chance += art->chance;
…		…
1435	}	1379	}
1436		1380
1437	LOG (llevDebug, "done.\n");	1381	LOG (llevDebug, "done.\n");
1438	}	1382	}
1439		1383
1440
1441	/*	1384	/*
1442	* Used in artifact generation. The bonuses of the first object	1385	* Used in artifact generation. The bonuses of the first object
1443	* is modified by the bonuses of the second object.	1386	* is modified by the bonuses of the second object.
1444	*/	1387	*/
1445
1446	void	1388	void
1447	add_abilities (object op, object change)	1389	add_abilities (object op, object change)
1448	{	1390	{
1449	int i, tmp;	1391	int i, tmp;
1450		1392
1451	if (change->face != blank_face)	1393	if (change->face != blank_face)
1452	{	1394	{
1453	#ifdef TREASURE_VERBOSE	1395	#ifdef TREASURE_VERBOSE
1454	LOG (llevDebug, "FACE: %d\n", change->face->number);	1396	LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1455	#endif	1397	#endif
1456	op->face = change->face;	1398	op->face = change->face;
1457	}	1399	}
1458		1400
1459	for (i = 0; i < NUM_STATS; i++)	1401	for (i = 0; i < NUM_STATS; i++)
…		…
1499		1441
1500	op->set_speed (op->speed);	1442	op->set_speed (op->speed);
1501	}	1443	}
1502		1444
1503	if (change->nrof)	1445	if (change->nrof)
1504	op->nrof = RANDOM () % ((int) change->nrof) + 1;	1446	op->nrof = rndm (change->nrof) + 1;
1505		1447
1506	op->stats.exp += change->stats.exp; /* Speed modifier */	1448	op->stats.exp += change->stats.exp; /* Speed modifier */
1507	op->stats.wc += change->stats.wc;	1449	op->stats.wc += change->stats.wc;
1508	op->stats.ac += change->stats.ac;	1450	op->stats.ac += change->stats.ac;
1509		1451
…		…
1612	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);	1554	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);
1613	}	1555	}
1614		1556
1615	op->value *= change->value;	1557	op->value *= change->value;
1616		1558
1617	if (change->material)	1559	if (change->materials)
1618	op->material = change->material;	1560	op->materials = change->materials;
1619		1561
1620	if (change->materialname)	1562	if (change->materialname)
1621	op->materialname = change->materialname;	1563	op->materialname = change->materialname;
1622		1564
1623	if (change->slaying)	1565	if (change->slaying)
…		…
1640	if (art->allowed == (linked_char *) NULL)	1582	if (art->allowed == (linked_char *) NULL)
1641	return 1; /* Ie, "all" */	1583	return 1; /* Ie, "all" */
1642	for (tmp = art->allowed; tmp; tmp = tmp->next)	1584	for (tmp = art->allowed; tmp; tmp = tmp->next)
1643	{	1585	{
1644	#ifdef TREASURE_VERBOSE	1586	#ifdef TREASURE_VERBOSE
1645	LOG (llevDebug, "legal_art: %s\n", tmp->name);	1587	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1646	#endif	1588	#endif
1647	if (*tmp->name == '!')	1589	if (*tmp->name == '!')
1648	name = tmp->name + 1, neg = 1;	1590	name = tmp->name + 1, neg = 1;
1649	else	1591	else
1650	name = tmp->name, neg = 0;	1592	name = tmp->name, neg = 0;
…		…
1717	return;	1659	return;
1718	}	1660	}
1719		1661
1720	for (i = 0; i < ARTIFACT_TRIES; i++)	1662	for (i = 0; i < ARTIFACT_TRIES; i++)
1721	{	1663	{
1722	int roll = RANDOM () % al->total_chance;	1664	int roll = rndm (al->total_chance);
1723		1665
1724	for (art = al->items; art != NULL; art = art->next)	1666	for (art = al->items; art; art = art->next)
1725	{	1667	{
1726	roll -= art->chance;	1668	roll -= art->chance;
1727	if (roll < 0)	1669	if (roll < 0)
1728	break;	1670	break;
1729	}	1671	}
…		…
1745	continue;	1687	continue;
1746		1688
1747	if (!legal_artifact_combination (op, art))	1689	if (!legal_artifact_combination (op, art))
1748	{	1690	{
1749	#ifdef TREASURE_VERBOSE	1691	#ifdef TREASURE_VERBOSE
1750	LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name);	1692	LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1751	#endif	1693	#endif
1752	continue;	1694	continue;
1753	}	1695	}
		1696
1754	give_artifact_abilities (op, art->item);	1697	give_artifact_abilities (op, art->item);
1755	return;	1698	return;
1756	}	1699	}
1757	}	1700	}
1758		1701
…		…
1802	SET_FLAG (item, FLAG_NO_STEAL);	1745	SET_FLAG (item, FLAG_NO_STEAL);
1803	}	1746	}
1804	}	1747	}
1805		1748
1806	/* special_potion() - so that old potion code is still done right. */	1749	/* special_potion() - so that old potion code is still done right. */
1807
1808	int	1750	int
1809	special_potion (object *op)	1751	special_potion (object *op)
1810	{	1752	{
1811	if (op->attacktype)	1753	if (op->attacktype)
1812	return 1;	1754	return 1;
…		…
1822	}	1764	}
1823		1765
1824	void	1766	void
1825	free_treasurestruct (treasure *t)	1767	free_treasurestruct (treasure *t)
1826	{	1768	{
1827	if (t->next)
1828	free_treasurestruct (t->next);	1769	if (t->next) free_treasurestruct (t->next);
1829	if (t->next_yes)
1830	free_treasurestruct (t->next_yes);	1770	if (t->next_yes) free_treasurestruct (t->next_yes);
1831	if (t->next_no)
1832	free_treasurestruct (t->next_no);	1771	if (t->next_no) free_treasurestruct (t->next_no);
1833		1772
1834	delete t;	1773	delete t;
1835	}	1774	}
1836		1775
1837	void	1776	void
…		…
1842		1781
1843	delete lc;	1782	delete lc;
1844	}	1783	}
1845		1784
1846	void	1785	void
1847	free_artifact (artifact * at)	1786	free_artifact (artifact *at)
1848	{	1787	{
1849	if (at->next)
1850	free_artifact (at->next);	1788	if (at->next) free_artifact (at->next);
1851
1852	if (at->allowed)
1853	free_charlinks (at->allowed);	1789	if (at->allowed) free_charlinks (at->allowed);
1854		1790
1855	at->item->destroy (1);	1791	at->item->destroy (1);
1856		1792
1857	delete at;	1793	sfree (at);
1858	}	1794	}
1859		1795
1860	void	1796	void
1861	free_artifactlist (artifactlist * al)	1797	free_artifactlist (artifactlist *al)
1862	{	1798	{
1863	artifactlist *nextal;	1799	artifactlist *nextal;
1864		1800
1865	for (al = first_artifactlist; al; al = nextal)	1801	for (al = first_artifactlist; al; al = nextal)
1866	{	1802	{
1867	nextal = al->next;	1803	nextal = al->next;
1868		1804
1869	if (al->items)	1805	if (al->items)
1870	free_artifact (al->items);	1806	free_artifact (al->items);
1871		1807
1872	free (al);	1808	sfree (al);
1873	}	1809	}
1874	}	1810	}
1875		1811
1876	void	1812	void
1877	free_all_treasures (void)	1813	free_all_treasures (void)
1878	{	1814	{
1879	treasurelist tl, next;	1815	treasurelist tl, next;
1880		1816
1881
1882	for (tl = first_treasurelist; tl != NULL; tl = next)	1817	for (tl = first_treasurelist; tl; tl = next)
1883	{	1818	{
		1819	clear (tl);
		1820
1884	next = tl->next;	1821	next = tl->next;
1885	if (tl->items)
1886	free_treasurestruct (tl->items);
1887	delete tl;	1822	delete tl;
1888	}	1823	}
		1824
1889	free_artifactlist (first_artifactlist);	1825	free_artifactlist (first_artifactlist);
1890	}	1826	}

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.48 by root, Tue Apr 17 18:40:31 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.48 by root, Tue Apr 17 18:40:31 2007 UTC