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

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.22 by root, Sun Dec 10 20:15:57 2006 UTC vs.
Revision 1.41 by root, Mon Apr 16 06:23:40 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
24	#define ALLOWED_COMBINATION	25	#define ALLOWED_COMBINATION
25		26
26	/* TREASURE_DEBUG does some checking on the treasurelists after loading.	27	/* TREASURE_DEBUG does some checking on the treasurelists after loading.
27	* It is useful for finding bugs in the treasures file. Since it only	28	* It is useful for finding bugs in the treasures file. Since it only
37	#include <global.h>	38	#include <global.h>
38	#include <treasure.h>	39	#include <treasure.h>
39	#include <funcpoint.h>	40	#include <funcpoint.h>
40	#include <loader.h>	41	#include <loader.h>
41		42
		43	extern char *spell_mapping[];
		44
		45	static treasurelist *first_treasurelist;
42		46
43	static void change_treasure (treasure t, object op); /* overrule default values */	47	static void change_treasure (treasure t, object op); /* overrule default values */
44	extern char *spell_mapping[];	48
		49	typedef std::tr1::unordered_map<
		50	const char *,
		51	treasurelist *,
		52	str_hash,
		53	str_equal,
		54	slice_allocator< std::pair<const char const, treasurelist > >,
		55	true
		56	> tl_map_t;
		57
		58	static tl_map_t tl_map;
45		59
46	/*	60	/*
47	* Initialize global archtype pointers:	61	* Initialize global archtype pointers:
48	*/	62	*/
49
50	void	63	void
51	init_archetype_pointers ()	64	init_archetype_pointers ()
52	{	65	{
53	int prev_warn = warn_archetypes;	66	int prev_warn = warn_archetypes;
54		67
55	warn_archetypes = 1;	68	warn_archetypes = 1;
		69
56	if (ring_arch == NULL)	70	if (ring_arch == NULL)
57	ring_arch = archetype::find ("ring");	71	ring_arch = archetype::find ("ring");
58	if (amulet_arch == NULL)	72	if (amulet_arch == NULL)
59	amulet_arch = archetype::find ("amulet");	73	amulet_arch = archetype::find ("amulet");
60	if (staff_arch == NULL)	74	if (staff_arch == NULL)
61	staff_arch = archetype::find ("staff");	75	staff_arch = archetype::find ("staff");
62	if (crown_arch == NULL)	76	if (crown_arch == NULL)
63	crown_arch = archetype::find ("crown");	77	crown_arch = archetype::find ("crown");
		78
64	warn_archetypes = prev_warn;	79	warn_archetypes = prev_warn;
65	}	80	}
66		81
67	/*	82	/*
68	* Allocate and return the pointer to an empty treasurelist structure.	83	* Searches for the given treasurelist in the globally linked list
		84	* of treasurelists which has been built by load_treasures().
69	*/	85	*/
70
71	static treasurelist *	86	treasurelist *
72	get_empty_treasurelist (void)	87	treasurelist::find (const char *name)
73	{	88	{
		89	if (!name)
		90	return 0;
		91
		92	AUTODECL (i, tl_map.find (name));
		93
		94	if (i == tl_map.end ())
		95	return 0;
		96
		97	return i->second;
		98	}
		99
		100	/*
		101	* Searches for the given treasurelist in the globally linked list
		102	* of treasurelists which has been built by load_treasures().
		103	*/
		104	treasurelist *
		105	treasurelist::get (const char *name)
		106	{
		107	treasurelist *tl = find (name);
		108
		109	if (!tl)
		110	{
74	return new treasurelist;	111	tl = new treasurelist;
75	}
76		112
77	/*	113	tl->name = name;
78	* Allocate and return the pointer to an empty treasure structure.	114	tl->next = first_treasurelist;
79	*/	115	first_treasurelist = tl;
80	//TODO: make this a constructor
81	static treasure *
82	get_empty_treasure (void)
83	{
84	treasure *t = new treasure;
85		116
86	t->chance = 100;	117	tl_map.insert (std::make_pair (tl->name, tl));
		118	}
87		119
88	return t;	120	return tl;
		121	}
		122
		123	//TODO: class method
		124	void
		125	clear (treasurelist *tl)
		126	{
		127	if (tl->items)
		128	{
		129	free_treasurestruct (tl->items);
		130	tl->items = 0;
		131	}
89	}	132	}
90		133
91	/*	134	/*
92	* Reads the lib/treasure file from disk, and parses the contents	135	* Reads the lib/treasure file from disk, and parses the contents
93	* into an internal treasure structure (very linked lists)	136	* into an internal treasure structure (very linked lists)
…		…
95		138
96	static treasure *	139	static treasure *
97	load_treasure (FILE * fp, int *line)	140	load_treasure (FILE * fp, int *line)
98	{	141	{
99	char buf[MAX_BUF], *cp, variable[MAX_BUF];	142	char buf[MAX_BUF], *cp, variable[MAX_BUF];
100	treasure *t = get_empty_treasure ();	143	treasure *t = new treasure;
101	int value;	144	int value;
102		145
103	nroftreasures++;	146	nroftreasures++;
104	while (fgets (buf, MAX_BUF, fp) != NULL)	147	while (fgets (buf, MAX_BUF, fp) != NULL)
105	{	148	{
…		…
156	* so that the treasure name can be printed out	199	* so that the treasure name can be printed out
157	*/	200	*/
158	static void	201	static void
159	check_treasurelist (const treasure t, const treasurelist tl)	202	check_treasurelist (const treasure t, const treasurelist tl)
160	{	203	{
161	if (t->item == NULL && t->name == NULL)
162	LOG (llevError, "Treasurelist %s has element with no name or archetype\n", &tl->name);
163	if (t->chance >= 100 && t->next_yes && (t->next \|\| t->next_no))	204	if (t->chance >= 100 && t->next_yes && (t->next \|\| t->next_no))
164	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);	205	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
165	/* find_treasurelist will print out its own error message */	206
166	if (t->name && *t->name)
167	(void) find_treasurelist (t->name);
168	if (t->next)	207	if (t->next)
169	check_treasurelist (t->next, tl);	208	check_treasurelist (t->next, tl);
		209
170	if (t->next_yes)	210	if (t->next_yes)
171	check_treasurelist (t->next_yes, tl);	211	check_treasurelist (t->next_yes, tl);
		212
172	if (t->next_no)	213	if (t->next_no)
173	check_treasurelist (t->next_no, tl);	214	check_treasurelist (t->next_no, tl);
174	}	215	}
175	#endif	216	#endif
176		217
…		…
182	void	223	void
183	load_treasures (void)	224	load_treasures (void)
184	{	225	{
185	FILE *fp;	226	FILE *fp;
186	char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];	227	char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];
187	treasurelist *previous = NULL;
188	treasure *t;	228	treasure *t;
189	int comp, line = 0;	229	int comp, line = 0;
190		230
191	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	231	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);
192	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	232	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)
…		…
195	return;	235	return;
196	}	236	}
197	while (fgets (buf, MAX_BUF, fp) != NULL)	237	while (fgets (buf, MAX_BUF, fp) != NULL)
198	{	238	{
199	line++;	239	line++;
200	if (*buf == '#')	240	if (buf == '#' \|\| buf == '\n')
201	continue;	241	; // ignore
202
203	if (sscanf (buf, "treasureone %s\n", name) \|\| sscanf (buf, "treasure %s\n", name))	242	else if (sscanf (buf, "treasureone %s\n", name) \|\| sscanf (buf, "treasure %s\n", name))
204	{	243	{
205	treasurelist *tl = get_empty_treasurelist ();	244	treasurelist *tl = treasurelist::get (name);
206		245
207	tl->name = name;	246	clear (tl);
208	if (previous == NULL)
209	first_treasurelist = tl;
210	else
211	previous->next = tl;
212	previous = tl;
213	tl->items = load_treasure (fp, &line);	247	tl->items = load_treasure (fp, &line);
214		248
215	/* This is a one of the many items on the list should be generated.	249	/* This is a one of the many items on the list should be generated.
216	* Add up the chance total, and check to make sure the yes & no	250	* Add up the chance total, and check to make sure the yes & no
217	* fields of the treasures are not being used.	251	* fields of the treasures are not being used.
218	*/	252	*/
219	if (!strncmp (buf, "treasureone", 11))	253	if (!strncmp (buf, "treasureone", 11))
220	{	254	{
221	for (t = tl->items; t != NULL; t = t->next)	255	for (t = tl->items; t; t = t->next)
222	{	256	{
223	#ifdef TREASURE_DEBUG	257	#ifdef TREASURE_DEBUG
224	if (t->next_yes \|\| t->next_no)	258	if (t->next_yes \|\| t->next_no)
225	{	259	{
226	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);	260	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);
…		…
232	}	266	}
233	}	267	}
234	else	268	else
235	LOG (llevError, "Treasure-list %s didn't understand: %s, line %d\n", filename, buf, line);	269	LOG (llevError, "Treasure-list %s didn't understand: %s, line %d\n", filename, buf, line);
236	}	270	}
		271
237	close_and_delete (fp, comp);	272	close_and_delete (fp, comp);
238		273
239	#ifdef TREASURE_DEBUG	274	#ifdef TREASURE_DEBUG
240	/* Perform some checks on how valid the treasure data actually is.	275	/* Perform some checks on how valid the treasure data actually is.
241	* verify that list transitions work (ie, the list that it is supposed	276	* verify that list transitions work (ie, the list that it is supposed
242	* to transition to exists). Also, verify that at least the name	277	* to transition to exists). Also, verify that at least the name
243	* or archetype is set for each treasure element.	278	* or archetype is set for each treasure element.
244	*/	279	*/
245	for (previous = first_treasurelist; previous != NULL; previous = previous->next)	280	for (treasurelist *tl = first_treasurelist; tl; tl = tl->next)
246	check_treasurelist (previous->items, previous);	281	check_treasurelist (tl->items, tl);
247	#endif	282	#endif
248	}	283	}
249
250	/*
251	* Searches for the given treasurelist in the globally linked list
252	* of treasurelists which has been built by load_treasures().
253	*/
254
255	treasurelist *
256	find_treasurelist (const char *name)
257	{
258	shstr_cmp name_ (name);
259
260	if (!name_)
261	return 0;
262
263	for (treasurelist * tl = first_treasurelist; tl != 0; tl = tl->next)
264	if (name_ == tl->name)
265	return tl;
266
267	if (first_treasurelist)
268	LOG (llevError, "Couldn't find treasurelist %s\n", name);
269
270	return 0;
271	}
272
273		284
274	/*	285	/*
275	* Generates the objects specified by the given treasure.	286	* Generates the objects specified by the given treasure.
276	* It goes recursively through the rest of the linked list.	287	* It goes recursively through the rest of the linked list.
277	* 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,
…		…
280	* being generated.	291	* being generated.
281	* If flag is GT_INVISIBLE, only invisible objects are generated (ie, only	292	* If flag is GT_INVISIBLE, only invisible objects are generated (ie, only
282	* abilities. This is used by summon spells, thus no summoned monsters	293	* abilities. This is used by summon spells, thus no summoned monsters
283	* start with equipment, but only their abilities).	294	* start with equipment, but only their abilities).
284	*/	295	*/
285
286
287	static void	296	static void
288	put_treasure (object op, object creator, int flags)	297	put_treasure (object op, object creator, int flags)
289	{	298	{
290	object *tmp;	299	object *tmp;
291		300
…		…
294	* this is the original object, or if this is an object that should be created	303	* this is the original object, or if this is an object that should be created
295	* by another object.	304	* by another object.
296	*/	305	*/
297	if (flags & GT_ENVIRONMENT && op->type != SPELL)	306	if (flags & GT_ENVIRONMENT && op->type != SPELL)
298	{	307	{
299	op->x = creator->x;
300	op->y = creator->y;
301	SET_FLAG (op, FLAG_OBJ_ORIGINAL);	308	SET_FLAG (op, FLAG_OBJ_ORIGINAL);
302	insert_ob_in_map (op, creator->map, op, INS_NO_MERGE \| INS_NO_WALK_ON);	309	op->insert_at (creator, creator, INS_NO_MERGE \| INS_NO_WALK_ON);
303	}	310	}
304	else	311	else
305	{	312	{
306	op = insert_ob_in_ob (op, creator);	313	op = creator->insert (op);
		314
307	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))	315	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
308	monster_check_apply (creator, op);	316	monster_check_apply (creator, op);
		317
309	if ((flags & GT_UPDATE_INV) && (tmp = is_player_inv (creator)) != NULL)	318	if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ()))
310	esrv_send_item (tmp, op);	319	esrv_send_item (tmp, op);
311	}	320	}
312	}	321	}
313		322
314	/* if there are change_xxx commands in the treasure, we include the changes	323	/* if there are change_xxx commands in the treasure, we include the changes
…		…
329		338
330	if (t->change_arch.slaying)	339	if (t->change_arch.slaying)
331	op->slaying = t->change_arch.slaying;	340	op->slaying = t->change_arch.slaying;
332	}	341	}
333		342
334	void	343	static void
335	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)
336	{	345	{
337	object *tmp;
338
339	if ((int) t->chance >= 100 \|\| (RANDOM () % 100 + 1) < (int) t->chance)	346	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)
340	{	347	{
341	if (t->name)	348	if (t->name)
342	{	349	{
343	if (strcmp (t->name, "NONE") && difficulty >= t->magic)	350	if (difficulty >= t->magic)
344	create_treasure (find_treasurelist (t->name), op, flag, difficulty, tries);	351	create_treasure (treasurelist::find (t->name), op, flag, difficulty, tries);
345	}	352	}
346	else	353	else
347	{	354	{
348	if (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 (!strcmp (t->name, "NONE"))
399	return;
400
401	if (difficulty >= t->magic)	403	if (difficulty >= t->magic)
		404	{
		405	treasurelist *tl = treasurelist::find (t->name);
		406	if (tl)
402	create_treasure (find_treasurelist (t->name), op, flag, difficulty, tries);	407	create_treasure (tl, op, flag, difficulty, tries);
		408	}
403	else if (t->nrof)	409	else if (t->nrof)
404	create_one_treasure (tl, op, flag, difficulty, tries);	410	create_one_treasure (tl, op, flag, difficulty, tries);
405
406	return;
407	}	411	}
408
409	if ((t->item && t->item->clone.invisible != 0) \|\| flag != GT_INVISIBLE)	412	else if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))
410	{	413	{
411	object *tmp = arch_to_object (t->item);	414	if (object *tmp = arch_to_object (t->item))
412		415	{
413	if (!tmp)
414	return;
415
416	if (t->nrof && tmp->nrof <= 1)	416	if (t->nrof && tmp->nrof <= 1)
417	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	417	tmp->nrof = rndm (t->nrof) + 1;
418		418
419	fix_generated_item (tmp, op, difficulty, t->magic, flag);	419	fix_generated_item (tmp, op, difficulty, t->magic, flag);
420	change_treasure (t, tmp);	420	change_treasure (t, tmp);
421	put_treasure (tmp, op, flag);	421	put_treasure (tmp, op, flag);
		422	}
422	}	423	}
423	}	424	}
424		425
425	/* This calls the appropriate treasure creation function. tries is passed	426	/* This calls the appropriate treasure creation function. tries is passed
426	* to determine how many list transitions or attempts to create treasure	427	* to determine how many list transitions or attempts to create treasure
…		…
428	* list transitions, or so that excessively good treasure will not be	429	* list transitions, or so that excessively good treasure will not be
429	* created on weak maps, because it will exceed the number of allowed tries	430	* created on weak maps, because it will exceed the number of allowed tries
430	* to do that.	431	* to do that.
431	*/	432	*/
432	void	433	void
433	create_treasure (treasurelist * t, object *op, int flag, int difficulty, int tries)	434	create_treasure (treasurelist tl, object op, int flag, int difficulty, int tries)
434	{	435	{
		436	// empty treasurelists are legal
		437	if (!tl->items)
		438	return;
435		439
436	if (tries++ > 100)	440	if (tries++ > 100)
437	{	441	{
438	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	442	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
439	return;	443	return;
440	}	444	}
		445
441	if (t->total_chance)	446	if (tl->total_chance)
442	create_one_treasure (t, op, flag, difficulty, tries);	447	create_one_treasure (tl, op, flag, difficulty, tries);
443	else	448	else
444	create_all_treasures (t->items, op, flag, difficulty, tries);	449	create_all_treasures (tl->items, op, flag, difficulty, tries);
445	}	450	}
446		451
447	/* This is similar to the old generate treasure function. However,	452	/* This is similar to the old generate treasure function. However,
448	* it instead takes a treasurelist. It is really just a wrapper around	453	* it instead takes a treasurelist. It is really just a wrapper around
449	* create_treasure. We create a dummy object that the treasure gets	454	* create_treasure. We create a dummy object that the treasure gets
450	* inserted into, and then return that treausre	455	* inserted into, and then return that treausre
451	*/	456	*/
452	object *	457	object *
453	generate_treasure (treasurelist * t, int difficulty)	458	generate_treasure (treasurelist *tl, int difficulty)
454	{	459	{
		460	difficulty = clamp (difficulty, 1, settings.max_level);
		461
455	object ob = get_object (), tmp;	462	object ob = object::create (), tmp;
456		463
457	create_treasure (t, ob, 0, difficulty, 0);	464	create_treasure (tl, ob, 0, difficulty, 0);
458		465
459	/* Don't want to free the object we are about to return */	466	/* Don't want to free the object we are about to return */
460	tmp = ob->inv;	467	tmp = ob->inv;
461	if (tmp != NULL)	468	if (tmp != NULL)
462	remove_ob (tmp);	469	tmp->remove ();
463		470
464	if (ob->inv)	471	if (ob->inv)
465	LOG (llevError, "In generate treasure, created multiple objects.\n");	472	LOG (llevError, "In generate treasure, created multiple objects.\n");
466		473
467	free_object (ob);	474	ob->destroy ();
468	return tmp;	475	return tmp;
469	}	476	}
470		477
471	/*	478	/*
472	* This is a new way of calculating the chance for an item to have	479	* This is a new way of calculating the chance for an item to have
…		…
551	* elmex Thu Aug 10 18:45:44 CEST 2006:	558	* elmex Thu Aug 10 18:45:44 CEST 2006:
552	* Scaling difficulty by max_level, as difficulty is a level and not some	559	* Scaling difficulty by max_level, as difficulty is a level and not some
553	* weird integer between 1-31.	560	* weird integer between 1-31.
554	*	561	*
555	*/	562	*/
556
557	int	563	int
558	magic_from_difficulty (int difficulty)	564	magic_from_difficulty (int difficulty)
559	{	565	{
560	int percent = 0, magic = 0;	566	int percent = 0, magic = 0;
561	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	567	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
…		…
566	scaled_diff = 0;	572	scaled_diff = 0;
567		573
568	if (scaled_diff >= DIFFLEVELS)	574	if (scaled_diff >= DIFFLEVELS)
569	scaled_diff = DIFFLEVELS - 1;	575	scaled_diff = DIFFLEVELS - 1;
570		576
571	percent = RANDOM () % 100;	577	percent = rndm (100);
572		578
573	for (magic = 0; magic < (MAXMAGIC + 1); magic++)	579	for (magic = 0; magic < (MAXMAGIC + 1); magic++)
574	{	580	{
575	percent -= difftomagic_list[scaled_diff][magic];	581	percent -= difftomagic_list[scaled_diff][magic];
576		582
…		…
582	{	588	{
583	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);	589	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);
584	magic = 0;	590	magic = 0;
585	}	591	}
586		592
587	magic = (RANDOM () % 3) ? magic : -magic;	593	magic = (rndm (3)) ? magic : -magic;
588	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */	594	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */
589		595
590	return magic;	596	return magic;
591	}	597	}
592		598
…		…
607	if (op->arch)	613	if (op->arch)
608	{	614	{
609	if (op->type == ARMOUR)	615	if (op->type == ARMOUR)
610	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	616	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;
611		617
612	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	618	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
613	magic = (-magic);	619	magic = (-magic);
614	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	620	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;
615	}	621	}
616	else	622	else
617	{	623	{
618	if (op->type == ARMOUR)	624	if (op->type == ARMOUR)
619	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	625	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
620	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	626	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
621	magic = (-magic);	627	magic = (-magic);
622	op->weight = (op->weight * (100 - magic * 10)) / 100;	628	op->weight = (op->weight * (100 - magic * 10)) / 100;
623	}	629	}
624	}	630	}
625		631
…		…
649	* 1) Since rings can have multiple bonuses, if the same bonus	655	* 1) Since rings can have multiple bonuses, if the same bonus
650	* is rolled again, increase it - the bonuses now stack with	656	* is rolled again, increase it - the bonuses now stack with
651	* other bonuses previously rolled and ones the item might natively have.	657	* other bonuses previously rolled and ones the item might natively have.
652	* 2) Add code to deal with new PR method.	658	* 2) Add code to deal with new PR method.
653	*/	659	*/
654
655	void	660	void
656	set_ring_bonus (object *op, int bonus)	661	set_ring_bonus (object *op, int bonus)
657	{	662	{
658		663
659	int r = RANDOM () % (bonus > 0 ? 25 : 11);	664	int r = rndm (bonus > 0 ? 25 : 11);
660		665
661	if (op->type == AMULET)	666	if (op->type == AMULET)
662	{	667	{
663	if (!(RANDOM () % 21))	668	if (!(rndm (21)))
664	r = 20 + RANDOM () % 2;	669	r = 20 + rndm (2);
665	else	670	else
666	{	671	{
667	if (RANDOM () & 2)	672	if (rndm (2))
668	r = 10;	673	r = 10;
669	else	674	else
670	r = 11 + RANDOM () % 9;	675	r = 11 + rndm (9);
671	}	676	}
672	}	677	}
673		678
674	switch (r)	679	switch (r)
675	{	680	{
…		…
712	case 16:	717	case 16:
713	case 17:	718	case 17:
714	case 18:	719	case 18:
715	case 19:	720	case 19:
716	{	721	{
717	int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table;	722	int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
718		723
719	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */	724	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */
720	val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b;	725	val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
721		726
722	/* Cursed items need to have higher negative values to equal out with	727	/* Cursed items need to have higher negative values to equal out with
723	* positive values for how protections work out. Put another	728	* positive values for how protections work out. Put another
724	* little random element in since that they don't always end up with	729	* little random element in since that they don't always end up with
725	* even values.	730	* even values.
726	*/	731	*/
727	if (bonus < 0)	732	if (bonus < 0)
728	val = 2 * -val - RANDOM () % b;	733	val = 2 * -val - rndm (b);
729	if (val > 35)	734	if (val > 35)
730	val = 35; /* Upper limit */	735	val = 35; /* Upper limit */
731	b = 0;	736	b = 0;
		737
732	while (op->resist[resist_table[resist]] != 0 && b < 4)	738	while (op->resist[resist_table[resist]] != 0 && b < 4)
733	{
734	resist = RANDOM () % num_resist_table;	739	resist = rndm (num_resist_table);
735	}	740
736	if (b == 4)	741	if (b == 4)
737	return; /* Not able to find a free resistance */	742	return; /* Not able to find a free resistance */
		743
738	op->resist[resist_table[resist]] = val;	744	op->resist[resist_table[resist]] = val;
739	/* We should probably do something more clever here to adjust value	745	/* We should probably do something more clever here to adjust value
740	* based on how good a resistance we gave.	746	* based on how good a resistance we gave.
741	*/	747	*/
742	break;	748	break;
…		…
770	case 22:	776	case 22:
771	op->stats.exp += bonus; /* Speed! */	777	op->stats.exp += bonus; /* Speed! */
772	op->value = (op->value * 2) / 3;	778	op->value = (op->value * 2) / 3;
773	break;	779	break;
774	}	780	}
		781
775	if (bonus > 0)	782	if (bonus > 0)
776	op->value = 2 bonus;	783	op->value = 2 bonus;
777	else	784	else
778	op->value = -(op->value * 2 * bonus) / 3;	785	op->value = -(op->value * 2 * bonus) / 3;
779	}	786	}
…		…
784	* higher is the chance of returning a low number.	791	* higher is the chance of returning a low number.
785	* It is only used in fix_generated_treasure() to set bonuses on	792	* It is only used in fix_generated_treasure() to set bonuses on
786	* rings and amulets.	793	* rings and amulets.
787	* Another scheme is used to calculate the magic of weapons and armours.	794	* Another scheme is used to calculate the magic of weapons and armours.
788	*/	795	*/
789
790	int	796	int
791	get_magic (int diff)	797	get_magic (int diff)
792	{	798	{
793	int i;	799	int i;
794		800
795	if (diff < 3)	801	if (diff < 3)
796	diff = 3;	802	diff = 3;
		803
797	for (i = 0; i < 4; i++)	804	for (i = 0; i < 4; i++)
798	if (RANDOM () % diff)	805	if (rndm (diff))
799	return i;	806	return i;
		807
800	return 4;	808	return 4;
801	}	809	}
802		810
803	#define DICE2 (get_magic(2)==2?2:1)	811	#define DICE2 (get_magic(2)==2?2:1)
804	#define DICESPELL (RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3)	812	#define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))
805		813
806	/*	814	/*
807	* fix_generated_item(): This is called after an item is generated, in	815	* fix_generated_item(): This is called after an item is generated, in
808	* order to set it up right. This produced magical bonuses, puts spells	816	* order to set it up right. This produced magical bonuses, puts spells
809	* into scrolls/books/wands, makes it unidentified, hides the value, etc.	817	* into scrolls/books/wands, makes it unidentified, hides the value, etc.
…		…
823	* value.	831	* value.
824	* GT_MINIMAL: Does minimal processing on the object - just enough to make it	832	* GT_MINIMAL: Does minimal processing on the object - just enough to make it
825	* a working object - don't change magic, value, etc, but set it material	833	* a working object - don't change magic, value, etc, but set it material
826	* type as appropriate, for objects that need spell objects, set those, etc	834	* type as appropriate, for objects that need spell objects, set those, etc
827	*/	835	*/
828
829	void	836	void
830	fix_generated_item (object op, object creator, int difficulty, int max_magic, int flags)	837	fix_generated_item (object op, object creator, int difficulty, int max_magic, int flags)
831	{	838	{
832	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;	839	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;
833		840
…		…
870	if (!op->magic && max_magic)	877	if (!op->magic && max_magic)
871	set_magic (difficulty, op, max_magic, flags);	878	set_magic (difficulty, op, max_magic, flags);
872		879
873	num_enchantments = calc_item_power (op, 1);	880	num_enchantments = calc_item_power (op, 1);
874		881
875	if ((!was_magic && !(RANDOM () % CHANCE_FOR_ARTIFACT)) \|\| op->type == HORN \|\| difficulty >= settings.max_level) /* high difficulties always generate an artifact,	882	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
		883	\|\| op->type == HORN
		884	\|\| difficulty >= settings.max_level) /* high difficulties always generate an artifact,
876	* used for shop_floors or treasures */	885	* used for shop_floors or treasures */
877	generate_artifact (op, difficulty);	886	generate_artifact (op, difficulty);
878	}	887	}
879		888
880	/* Object was made an artifact. Calculate its item_power rating.	889	/* Object was made an artifact. Calculate its item_power rating.
…		…
938	case WEAPON:	947	case WEAPON:
939	case ARMOUR:	948	case ARMOUR:
940	case SHIELD:	949	case SHIELD:
941	case HELMET:	950	case HELMET:
942	case CLOAK:	951	case CLOAK:
943	if (QUERY_FLAG (op, FLAG_CURSED) && !(RANDOM () % 4))	952	if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
944	set_ring_bonus (op, -DICE2);	953	set_ring_bonus (op, -DICE2);
945	break;	954	break;
946		955
947	case BRACERS:	956	case BRACERS:
948	if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)))	957	if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
949	{	958	{
950	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	959	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
951	if (!QUERY_FLAG (op, FLAG_CURSED))	960	if (!QUERY_FLAG (op, FLAG_CURSED))
952	op->value *= 3;	961	op->value *= 3;
953	}	962	}
…		…
979	*/	988	*/
980	if (op->inv && op->randomitems)	989	if (op->inv && op->randomitems)
981	{	990	{
982	/* value multiplier is same as for scrolls */	991	/* value multiplier is same as for scrolls */
983	op->value = (op->value * op->inv->value);	992	op->value = (op->value * op->inv->value);
984	op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty;	993	op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
985	}	994	}
986	else	995	else
987	{	996	{
988	op->name = "potion";	997	op->name = "potion";
989	op->name_pl = "potions";	998	op->name_pl = "potions";
990	}	999	}
991		1000
992	if (!(flags & GT_ONLY_GOOD) && RANDOM () % 2)	1001	if (!(flags & GT_ONLY_GOOD) && rndm (2))
993	SET_FLAG (op, FLAG_CURSED);	1002	SET_FLAG (op, FLAG_CURSED);
994	break;	1003	break;
995	}	1004	}
996		1005
997	case AMULET:	1006	case AMULET:
…		…
999	op->value = 5; / Since it's not just decoration */	1008	op->value = 5; / Since it's not just decoration */
1000		1009
1001	case RING:	1010	case RING:
1002	if (op->arch == NULL)	1011	if (op->arch == NULL)
1003	{	1012	{
1004	remove_ob (op);	1013	op->destroy ();
1005	free_object (op);
1006	op = NULL;	1014	op = 0;
1007	break;	1015	break;
1008	}	1016	}
1009		1017
1010	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */	1018	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */
1011	break;	1019	break;
1012		1020
1013	if (!(flags & GT_ONLY_GOOD) && !(RANDOM () % 3))	1021	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1014	SET_FLAG (op, FLAG_CURSED);	1022	SET_FLAG (op, FLAG_CURSED);
1015		1023
1016	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	1024	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
1017		1025
1018	if (op->type != RING) /* Amulets have only one ability */	1026	if (op->type != RING) /* Amulets have only one ability */
1019	break;	1027	break;
1020		1028
1021	if (!(RANDOM () % 4))	1029	if (!(rndm (4)))
1022	{	1030	{
1023	int d = (RANDOM () % 2 \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	1031	int d = (rndm (2) \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1024		1032
1025	if (d > 0)	1033	if (d > 0)
1026	op->value *= 3;	1034	op->value *= 3;
1027		1035
1028	set_ring_bonus (op, d);	1036	set_ring_bonus (op, d);
1029		1037
1030	if (!(RANDOM () % 4))	1038	if (!(rndm (4)))
1031	{	1039	{
1032	int d = (RANDOM () % 3 \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	1040	int d = (rndm (3) \|\| QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1033		1041
1034	if (d > 0)	1042	if (d > 0)
1035	op->value *= 5;	1043	op->value *= 5;
1036	set_ring_bonus (op, d);	1044	set_ring_bonus (op, d);
1037	}	1045	}
1038	}	1046	}
1039		1047
1040	if (GET_ANIM_ID (op))	1048	if (GET_ANIM_ID (op))
1041	SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op)));	1049	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1042		1050
1043	break;	1051	break;
1044		1052
1045	case BOOK:	1053	case BOOK:
1046	/* Is it an empty book?, if yes lets make a special·	1054	/* Is it an empty book?, if yes lets make a special·
1047	* msg for it, and tailor its properties based on the·	1055	* msg for it, and tailor its properties based on the·
1048	* creator and/or map level we found it on.	1056	* creator and/or map level we found it on.
1049	*/	1057	*/
1050	if (!op->msg && RANDOM () % 10)	1058	if (!op->msg && rndm (10))
1051	{	1059	{
1052	/* set the book level properly */	1060	/* set the book level properly */
1053	if (creator->level == 0 \|\| QUERY_FLAG (creator, FLAG_ALIVE))	1061	if (creator->level == 0 \|\| QUERY_FLAG (creator, FLAG_ALIVE))
1054	{	1062	{
1055	if (op->map && op->map->difficulty)	1063	if (op->map && op->map->difficulty)
1056	op->level = RANDOM () % (op->map->difficulty) + RANDOM () % 10 + 1;	1064	op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1057	else	1065	else
1058	op->level = RANDOM () % 20 + 1;	1066	op->level = rndm (20) + 1;
1059	}	1067	}
1060	else	1068	else
1061	op->level = RANDOM () % creator->level;	1069	op->level = rndm (creator->level);
1062		1070
1063	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);	1071	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);
1064	/* books w/ info are worth more! */	1072	/* books w/ info are worth more! */
1065	op->value = ((op->level > 10 ? op->level : (op->level + 1) / 2) ((strlen (op->msg) / 250) + 1));	1073	op->value = ((op->level > 10 ? op->level : (op->level + 1) / 2) ((strlen (op->msg) / 250) + 1));
1066	/* creator related stuff */	1074	/* creator related stuff */
…		…
1165	*/	1173	*/
1166		1174
1167	/*	1175	/*
1168	* Allocate and return the pointer to an empty artifactlist structure.	1176	* Allocate and return the pointer to an empty artifactlist structure.
1169	*/	1177	*/
1170
1171	static artifactlist *	1178	static artifactlist *
1172	get_empty_artifactlist (void)	1179	get_empty_artifactlist (void)
1173	{	1180	{
1174	artifactlist tl = (artifactlist ) malloc (sizeof (artifactlist));	1181	return salloc0 <artifactlist> ();
1175
1176	if (tl == NULL)
1177	fatal (OUT_OF_MEMORY);
1178	tl->next = NULL;
1179	tl->items = NULL;
1180	tl->total_chance = 0;
1181	return tl;
1182	}	1182	}
1183		1183
1184	/*	1184	/*
1185	* Allocate and return the pointer to an empty artifact structure.	1185	* Allocate and return the pointer to an empty artifact structure.
1186	*/	1186	*/
1187
1188	static artifact *	1187	static artifact *
1189	get_empty_artifact (void)	1188	get_empty_artifact (void)
1190	{	1189	{
1191	artifact t = (artifact ) malloc (sizeof (artifact));	1190	return salloc0 <artifact> ();
1192
1193	if (t == NULL)
1194	fatal (OUT_OF_MEMORY);
1195	t->item = NULL;
1196	t->next = NULL;
1197	t->chance = 0;
1198	t->difficulty = 0;
1199	t->allowed = NULL;
1200	return t;
1201	}	1191	}
1202		1192
1203	/*	1193	/*
1204	* Searches the artifact lists and returns one that has the same type	1194	* Searches the artifact lists and returns one that has the same type
1205	* of objects on it.	1195	* of objects on it.
1206	*/	1196	*/
1207
1208	artifactlist *	1197	artifactlist *
1209	find_artifactlist (int type)	1198	find_artifactlist (int type)
1210	{	1199	{
1211	artifactlist *al;
1212
1213	for (al = first_artifactlist; al != NULL; al = al->next)	1200	for (artifactlist *al = first_artifactlist; al; al = al->next)
1214	if (al->type == type)	1201	if (al->type == type)
1215	return al;	1202	return al;
		1203
1216	return NULL;	1204	return 0;
1217	}	1205	}
1218		1206
1219	/*	1207	/*
1220	* For debugging purposes. Dumps all tables.	1208	* For debugging purposes. Dumps all tables.
1221	*/	1209	*/
1222
1223	void	1210	void
1224	dump_artifacts (void)	1211	dump_artifacts (void)
1225	{	1212	{
1226	artifactlist *al;	1213	artifactlist *al;
1227	artifact *art;	1214	artifact *art;
…		…
1234	for (art = al->items; art != NULL; art = art->next)	1221	for (art = al->items; art != NULL; art = art->next)
1235	{	1222	{
1236	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);	1223	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1237	if (art->allowed != NULL)	1224	if (art->allowed != NULL)
1238	{	1225	{
1239	fprintf (logfile, "\tAllowed combinations:");	1226	fprintf (logfile, "\tallowed combinations:");
1240	for (next = art->allowed; next != NULL; next = next->next)	1227	for (next = art->allowed; next != NULL; next = next->next)
1241	fprintf (logfile, "%s,", &next->name);	1228	fprintf (logfile, "%s,", &next->name);
1242	fprintf (logfile, "\n");	1229	fprintf (logfile, "\n");
1243	}	1230	}
1244	}	1231	}
…		…
1255	treasurelist *tl;	1242	treasurelist *tl;
1256	int i;	1243	int i;
1257		1244
1258	if (depth > 100)	1245	if (depth > 100)
1259	return;	1246	return;
1260	while (t != NULL)	1247
		1248	while (t)
1261	{	1249	{
1262	if (t->name != NULL)	1250	if (t->name)
1263	{	1251	{
1264	for (i = 0; i < depth; i++)	1252	for (i = 0; i < depth; i++)
1265	fprintf (logfile, " ");	1253	fprintf (logfile, " ");
		1254
1266	fprintf (logfile, "{ (list: %s)\n", &t->name);	1255	fprintf (logfile, "{ (list: %s)\n", &t->name);
		1256
1267	tl = find_treasurelist (t->name);	1257	tl = treasurelist::find (t->name);
		1258	if (tl)
1268	dump_monster_treasure_rec (name, tl->items, depth + 2);	1259	dump_monster_treasure_rec (name, tl->items, depth + 2);
		1260
1269	for (i = 0; i < depth; i++)	1261	for (i = 0; i < depth; i++)
1270	fprintf (logfile, " ");	1262	fprintf (logfile, " ");
		1263
1271	fprintf (logfile, "} (end of list: %s)\n", &t->name);	1264	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1272	}	1265	}
1273	else	1266	else
1274	{	1267	{
1275	for (i = 0; i < depth; i++)	1268	for (i = 0; i < depth; i++)
1276	fprintf (logfile, " ");	1269	fprintf (logfile, " ");
		1270
1277	if (t->item->clone.type == FLESH)	1271	if (t->item && t->item->clone.type == FLESH)
1278	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);	1272	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1279	else	1273	else
1280	fprintf (logfile, "%s\n", &t->item->clone.name);	1274	fprintf (logfile, "%s\n", &t->item->clone.name);
1281	}	1275	}
		1276
1282	if (t->next_yes != NULL)	1277	if (t->next_yes)
1283	{	1278	{
1284	for (i = 0; i < depth; i++)	1279	for (i = 0; i < depth; i++)
1285	fprintf (logfile, " ");	1280	fprintf (logfile, " ");
		1281
1286	fprintf (logfile, " (if yes)\n");	1282	fprintf (logfile, " (if yes)\n");
1287	dump_monster_treasure_rec (name, t->next_yes, depth + 1);	1283	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1288	}	1284	}
		1285
1289	if (t->next_no != NULL)	1286	if (t->next_no)
1290	{	1287	{
1291	for (i = 0; i < depth; i++)	1288	for (i = 0; i < depth; i++)
1292	fprintf (logfile, " ");	1289	fprintf (logfile, " ");
		1290
1293	fprintf (logfile, " (if no)\n");	1291	fprintf (logfile, " (if no)\n");
1294	dump_monster_treasure_rec (name, t->next_no, depth + 1);	1292	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1295	}	1293	}
		1294
1296	t = t->next;	1295	t = t->next;
1297	}	1296	}
1298	}	1297	}
1299		1298
1300	/*	1299	/*
1301	* For debugging purposes. Dumps all treasures for a given monster.	1300	* For debugging purposes. Dumps all treasures for a given monster.
1302	* Created originally by Raphael Quinet for debugging the alchemy code.	1301	* Created originally by Raphael Quinet for debugging the alchemy code.
1303	*/	1302	*/
1304
1305	void	1303	void
1306	dump_monster_treasure (const char *name)	1304	dump_monster_treasure (const char *name)
1307	{	1305	{
1308	archetype *at;	1306	archetype *at;
1309	int found;	1307	int found;
1310		1308
1311	found = 0;	1309	found = 0;
1312	fprintf (logfile, "\n");	1310	fprintf (logfile, "\n");
		1311
1313	for (at = first_archetype; at != NULL; at = at->next)	1312	for (at = first_archetype; at != NULL; at = at->next)
1314	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)	1313	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1315	{	1314	{
1316	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);	1315	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1317	if (at->clone.randomitems != NULL)	1316	if (at->clone.randomitems != NULL)
1318	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);	1317	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1319	else	1318	else
1320	fprintf (logfile, "(nothing)\n");	1319	fprintf (logfile, "(nothing)\n");
		1320
1321	fprintf (logfile, "\n");	1321	fprintf (logfile, "\n");
1322	found++;	1322	found++;
1323	}	1323	}
		1324
1324	if (found == 0)	1325	if (found == 0)
1325	fprintf (logfile, "No objects have the name %s!\n\n", name);	1326	fprintf (logfile, "No objects have the name %s!\n\n", name);
1326	}	1327	}
1327		1328
1328	/*	1329	/*
1329	* Builds up the lists of artifacts from the file in the libdir.	1330	* Builds up the lists of artifacts from the file in the libdir.
1330	*/	1331	*/
1331
1332	void	1332	void
1333	init_artifacts (void)	1333	init_artifacts (void)
1334	{	1334	{
1335	static int has_been_inited = 0;	1335	static int has_been_inited = 0;
1336	char filename[MAX_BUF], buf[HUGE_BUF], cp, next;	1336	char filename[MAX_BUF];
1337	artifact *art = NULL;	1337	artifact *art = NULL;
1338	linked_char *tmp;
1339	int value;
1340	artifactlist *al;	1338	artifactlist *al;
1341		1339
1342	if (has_been_inited)	1340	if (has_been_inited)
1343	return;	1341	return;
1344	else	1342	else
1345	has_been_inited = 1;	1343	has_been_inited = 1;
1346		1344
1347	sprintf (filename, "%s/artifacts", settings.datadir);	1345	sprintf (filename, "%s/artifacts", settings.datadir);
1348	object_thawer thawer (filename);	1346	object_thawer f (filename);
1349		1347
1350	if (!thawer)	1348	if (!f)
1351	return;	1349	return;
1352		1350
1353	while (fgets (buf, HUGE_BUF, thawer) != NULL)	1351	f.next ();
1354	{
1355	if (*buf == '#')
1356	continue;
1357	if ((cp = strchr (buf, '\n')) != NULL)
1358	*cp = '\0';
1359	cp = buf;
1360	while (cp == ' ') / Skip blanks */
1361	cp++;
1362	if (*cp == '\0')
1363	continue;
1364		1352
1365	if (!strncmp (cp, "Allowed", 7))	1353	for (;;)
		1354	{
		1355	switch (f.kw)
1366	{	1356	{
		1357	case KW_allowed:
1367	if (art == NULL)	1358	if (!art)
		1359	{
		1360	art = get_empty_artifact ();
		1361	nrofartifacts++;
		1362	}
		1363
1368	{	1364	{
1369	art = get_empty_artifact ();	1365	if (!strcmp (f.get_str (), "all"))
1370	nrofartifacts++;	1366	break;
		1367
		1368	char next, cp = f.get_str ();
		1369
		1370	do
		1371	{
		1372	nrofallowedstr++;
		1373
		1374	if ((next = strchr (cp, ',')))
		1375	*next++ = '\0';
		1376
		1377	linked_char *tmp = new linked_char;
		1378
		1379	tmp->name = cp;
		1380	tmp->next = art->allowed;
		1381	art->allowed = tmp;
		1382	}
		1383	while ((cp = next));
1371	}	1384	}
1372	cp = strchr (cp, ' ') + 1;	1385	break;
1373	if (!strcmp (cp, "all"))	1386
		1387	case KW_chance:
		1388	f.get (art->chance);
		1389	break;
		1390
		1391	case KW_difficulty:
		1392	f.get (art->difficulty);
		1393	break;
		1394
		1395	case KW_object:
		1396	{
		1397	art->item = object::create ();
		1398
		1399	if (!art->item->parse_kv (f))
		1400	LOG (llevError, "Init_Artifacts: Could not load object.\n");
		1401
		1402	al = find_artifactlist (art->item->type);
		1403
		1404	if (!al)
		1405	{
		1406	al = get_empty_artifactlist ();
		1407	al->type = art->item->type;
		1408	al->next = first_artifactlist;
		1409	first_artifactlist = al;
		1410	}
		1411
		1412	art->next = al->items;
		1413	al->items = art;
		1414	art = 0;
		1415	}
1374	continue;	1416	continue;
1375		1417
1376	do	1418	case KW_EOF:
		1419	goto done;
		1420
		1421	default:
		1422	if (!f.parse_error ("artifacts file"))
		1423	cleanup ("artifacts file required");
1377	{	1424	break;
1378	nrofallowedstr++;
1379	if ((next = strchr (cp, ',')) != NULL)
1380	*(next++) = '\0';
1381	tmp = new linked_char;
1382
1383	tmp->name = cp;
1384	tmp->next = art->allowed;
1385	art->allowed = tmp;
1386	}
1387	while ((cp = next) != NULL);
1388	}
1389	else if (sscanf (cp, "chance %d", &value))
1390	art->chance = (uint16) value;
1391	else if (sscanf (cp, "difficulty %d", &value))
1392	art->difficulty = (uint8) value;
1393	else if (!strncmp (cp, "Object", 6))
1394	{	1425	}
1395	art->item = get_object ();
1396		1426
1397	if (!load_object (thawer, art->item, 0))	1427	f.next ();
1398	LOG (llevError, "Init_Artifacts: Could not load object.\n");
1399
1400	art->item->name = strchr (cp, ' ') + 1;
1401	al = find_artifactlist (art->item->type);
1402	if (al == NULL)
1403	{
1404	al = get_empty_artifactlist ();
1405	al->type = art->item->type;
1406	al->next = first_artifactlist;
1407	first_artifactlist = al;
1408	}
1409	art->next = al->items;
1410	al->items = art;
1411	art = NULL;
1412	}
1413	else
1414	LOG (llevError, "Unknown input in artifact file: %s\n", buf);
1415	}	1428	}
1416		1429
		1430	done:
1417	for (al = first_artifactlist; al != NULL; al = al->next)	1431	for (al = first_artifactlist; al; al = al->next)
1418	{	1432	{
1419	for (art = al->items; art != NULL; art = art->next)	1433	for (art = al->items; art; art = art->next)
1420	{	1434	{
1421	if (!art->chance)	1435	if (!art->chance)
1422	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1436	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1423	else	1437	else
1424	al->total_chance += art->chance;	1438	al->total_chance += art->chance;
…		…
1489	CLEAR_FLAG (op, FLAG_ANIMATE);	1503	CLEAR_FLAG (op, FLAG_ANIMATE);
1490	/* so artifacts will join */	1504	/* so artifacts will join */
1491	if (!QUERY_FLAG (op, FLAG_ALIVE))	1505	if (!QUERY_FLAG (op, FLAG_ALIVE))
1492	op->speed = 0.0;	1506	op->speed = 0.0;
1493		1507
1494	update_ob_speed (op);	1508	op->set_speed (op->speed);
1495	}	1509	}
1496		1510
1497	if (change->nrof)	1511	if (change->nrof)
1498	op->nrof = RANDOM () % ((int) change->nrof) + 1;	1512	op->nrof = rndm (change->nrof) + 1;
1499		1513
1500	op->stats.exp += change->stats.exp; /* Speed modifier */	1514	op->stats.exp += change->stats.exp; /* Speed modifier */
1501	op->stats.wc += change->stats.wc;	1515	op->stats.wc += change->stats.wc;
1502	op->stats.ac += change->stats.ac;	1516	op->stats.ac += change->stats.ac;
1503		1517
…		…
1511	{	1525	{
1512	object *tmp_obj;	1526	object *tmp_obj;
1513		1527
1514	/* Remove any spells this object currently has in it */	1528	/* Remove any spells this object currently has in it */
1515	while (op->inv)	1529	while (op->inv)
1516	{	1530	op->inv->destroy ();
1517	tmp_obj = op->inv;
1518	remove_ob (tmp_obj);
1519	free_object (tmp_obj);
1520	}
1521		1531
1522	tmp_obj = arch_to_object (change->other_arch);	1532	tmp_obj = arch_to_object (change->other_arch);
1523	insert_ob_in_ob (tmp_obj, op);	1533	insert_ob_in_ob (tmp_obj, op);
1524	}	1534	}
1525	/* No harm setting this for potions/horns */	1535	/* No harm setting this for potions/horns */
…		…
1610	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);	1620	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);
1611	}	1621	}
1612		1622
1613	op->value *= change->value;	1623	op->value *= change->value;
1614		1624
1615	if (change->material)	1625	if (change->materials)
1616	op->material = change->material;	1626	op->materials = change->materials;
1617		1627
1618	if (change->materialname)	1628	if (change->materialname)
1619	op->materialname = change->materialname;	1629	op->materialname = change->materialname;
1620		1630
1621	if (change->slaying)	1631	if (change->slaying)
…		…
1715	return;	1725	return;
1716	}	1726	}
1717		1727
1718	for (i = 0; i < ARTIFACT_TRIES; i++)	1728	for (i = 0; i < ARTIFACT_TRIES; i++)
1719	{	1729	{
1720	int roll = RANDOM () % al->total_chance;	1730	int roll = rndm (al->total_chance);
1721		1731
1722	for (art = al->items; art != NULL; art = art->next)	1732	for (art = al->items; art; art = art->next)
1723	{	1733	{
1724	roll -= art->chance;	1734	roll -= art->chance;
1725	if (roll < 0)	1735	if (roll < 0)
1726	break;	1736	break;
1727	}	1737	}
…		…
1804	/* special_potion() - so that old potion code is still done right. */	1814	/* special_potion() - so that old potion code is still done right. */
1805		1815
1806	int	1816	int
1807	special_potion (object *op)	1817	special_potion (object *op)
1808	{	1818	{
1809
1810	int i;
1811
1812	if (op->attacktype)	1819	if (op->attacktype)
1813	return 1;	1820	return 1;
1814		1821
1815	if (op->stats.Str \|\| op->stats.Dex \|\| op->stats.Con \|\| op->stats.Pow \|\| op->stats.Wis \|\| op->stats.Int \|\| op->stats.Cha)	1822	if (op->stats.Str \|\| op->stats.Dex \|\| op->stats.Con \|\| op->stats.Pow \|\| op->stats.Wis \|\| op->stats.Int \|\| op->stats.Cha)
1816	return 1;	1823	return 1;
1817		1824
1818	for (i = 0; i < NROFATTACKS; i++)	1825	for (int i = 0; i < NROFATTACKS; i++)
1819	if (op->resist[i])	1826	if (op->resist[i])
1820	return 1;	1827	return 1;
1821		1828
1822	return 0;	1829	return 0;
1823	}	1830	}
1824		1831
1825	void	1832	void
1826	free_treasurestruct (treasure *t)	1833	free_treasurestruct (treasure *t)
1827	{	1834	{
1828	if (t->next)
1829	free_treasurestruct (t->next);	1835	if (t->next) free_treasurestruct (t->next);
1830	if (t->next_yes)
1831	free_treasurestruct (t->next_yes);	1836	if (t->next_yes) free_treasurestruct (t->next_yes);
1832	if (t->next_no)
1833	free_treasurestruct (t->next_no);	1837	if (t->next_no) free_treasurestruct (t->next_no);
1834		1838
1835	delete t;	1839	delete t;
1836	}	1840	}
1837		1841
1838	void	1842	void
…		…
1843		1847
1844	delete lc;	1848	delete lc;
1845	}	1849	}
1846		1850
1847	void	1851	void
1848	free_artifact (artifact * at)	1852	free_artifact (artifact *at)
1849	{	1853	{
1850	if (at->next)
1851	free_artifact (at->next);	1854	if (at->next) free_artifact (at->next);
1852
1853	if (at->allowed)
1854	free_charlinks (at->allowed);	1855	if (at->allowed) free_charlinks (at->allowed);
1855		1856
1856	at->item->destroy (1);	1857	at->item->destroy (1);
1857		1858
1858	delete at;	1859	sfree (at);
1859	}	1860	}
1860		1861
1861	void	1862	void
1862	free_artifactlist (artifactlist * al)	1863	free_artifactlist (artifactlist *al)
1863	{	1864	{
1864	artifactlist *nextal;	1865	artifactlist *nextal;
1865		1866
1866	for (al = first_artifactlist; al; al = nextal)	1867	for (al = first_artifactlist; al; al = nextal)
1867	{	1868	{
1868	nextal = al->next;	1869	nextal = al->next;
1869		1870
1870	if (al->items)	1871	if (al->items)
1871	free_artifact (al->items);	1872	free_artifact (al->items);
1872		1873
1873	free (al);	1874	sfree (al);
1874	}	1875	}
1875	}	1876	}
1876		1877
1877	void	1878	void
1878	free_all_treasures (void)	1879	free_all_treasures (void)
1879	{	1880	{
1880	treasurelist tl, next;	1881	treasurelist tl, next;
1881		1882
1882
1883	for (tl = first_treasurelist; tl != NULL; tl = next)	1883	for (tl = first_treasurelist; tl; tl = next)
1884	{	1884	{
		1885	clear (tl);
		1886
1885	next = tl->next;	1887	next = tl->next;
1886	if (tl->items)
1887	free_treasurestruct (tl->items);
1888	delete tl;	1888	delete tl;
1889	}	1889	}
		1890
1890	free_artifactlist (first_artifactlist);	1891	free_artifactlist (first_artifactlist);
1891	}	1892	}

Diff Legend

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

Comparing deliantra/server/common/treasure.C (file contents): Revision 1.22 by root, Sun Dec 10 20:15:57 2006 UTC vs. Revision 1.41 by root, Mon Apr 16 06:23:40 2007 UTC

Diff Legend

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.22 by root, Sun Dec 10 20:15:57 2006 UTC vs.
Revision 1.41 by root, Mon Apr 16 06:23:40 2007 UTC