ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/treasure.C

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.33 by root, Thu Jan 18 19:42:09 2007 UTC vs.
Revision 1.64 by root, Sun Jul 1 05:00:18 2007 UTC

1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Crossfire TRT is free software: you can redistribute it and/or modify
9	* 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
10	* the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your option) any later version.
12	*	12	*
13	* 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,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* 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
19	* along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <crossfire@schmorp.de>
23	*/	22	*/
24
25	#define ALLOWED_COMBINATION
26		23
27	/* TREASURE_DEBUG does some checking on the treasurelists after loading.	24	/* TREASURE_DEBUG does some checking on the treasurelists after loading.
28	* It is useful for finding bugs in the treasures file. Since it only	25	* It is useful for finding bugs in the treasures file. Since it only
29	* slows the startup some (and not actual game play), it is by default	26	* slows the startup some (and not actual game play), it is by default
30	* left on	27	* left on
31	*/	28	*/
32	#define TREASURE_DEBUG	29	#define TREASURE_DEBUG
33		30
34	/* TREASURE_VERBOSE enables copious output concerning artifact generation */	31	/* TREASURE_VERBOSE enables copious output concerning artifact generation */
35		32
36	/* #define TREASURE_VERBOSE */	33	//#define TREASURE_VERBOSE
37		34
38	#include <global.h>	35	#include <global.h>
39	#include <treasure.h>	36	#include <treasure.h>
40	#include <funcpoint.h>	37	#include <funcpoint.h>
41	#include <loader.h>	38	#include <loader.h>
42		39
		40	extern char *spell_mapping[];
		41
		42	static treasurelist *first_treasurelist;
43		43
44	static void change_treasure (treasure *t, object *op); /* overrule default values */	44	static void change_treasure (treasure *t, object *op); /* overrule default values */
45	extern char *spell_mapping[];
46		45
47	/*	46	typedef std::tr1::unordered_map<
48	* Initialize global archtype pointers:	47	const char *,
49	*/	48	treasurelist *,
		49	str_hash,
		50	str_equal,
		51	slice_allocator< std::pair<const char *const, treasurelist *> >,
		52	true
		53	> tl_map_t;
50		54
		55	static tl_map_t tl_map;
		56
		57	/*
		58	* Searches for the given treasurelist
		59	*/
		60	treasurelist *
		61	treasurelist::find (const char *name)
		62	{
		63	if (!name)
		64	return 0;
		65
		66	auto (i, tl_map.find (name));
		67
		68	if (i == tl_map.end ())
		69	return 0;
		70
		71	return i->second;
		72	}
		73
		74	/*
		75	* Searches for the given treasurelist in the globally linked list
		76	* of treasurelists which has been built by load_treasures().
		77	*/
		78	treasurelist *
		79	treasurelist::get (const char *name)
		80	{
		81	treasurelist *tl = find (name);
		82
		83	if (!tl)
		84	{
		85	tl = new treasurelist;
		86
		87	tl->name = name;
		88	tl->next = first_treasurelist;
		89	first_treasurelist = tl;
		90
		91	tl_map.insert (std::make_pair (tl->name, tl));
		92	}
		93
		94	return tl;
		95	}
		96
		97	//TODO: class method
51	void	98	void
52	init_archetype_pointers ()	99	clear (treasurelist *tl)
53	{	100	{
54	int prev_warn = warn_archetypes;	101	if (tl->items)
		102	{
		103	free_treasurestruct (tl->items);
		104	tl->items = 0;
		105	}
55		106
56	warn_archetypes = 1;
57	if (ring_arch == NULL)
58	ring_arch = archetype::find ("ring");
59	if (amulet_arch == NULL)
60	amulet_arch = archetype::find ("amulet");
61	if (staff_arch == NULL)
62	staff_arch = archetype::find ("staff");
63	if (crown_arch == NULL)
64	crown_arch = archetype::find ("crown");
65	warn_archetypes = prev_warn;
66	}
67
68	/*
69	* Allocate and return the pointer to an empty treasurelist structure.
70	*/
71
72	static treasurelist *
73	get_empty_treasurelist (void)
74	{
75	return new treasurelist;
76	}
77
78	/*
79	* Allocate and return the pointer to an empty treasure structure.
80	*/
81	//TODO: make this a constructor
82	static treasure *
83	get_empty_treasure (void)
84	{
85	treasure *t = new treasure;
86
87	t->chance = 100;	107	tl->total_chance = 0;
88
89	return t;
90	}	108	}
		109
		110	#ifdef TREASURE_DEBUG
		111	/* recursived checks the linked list. Treasurelist is passed only
		112	* so that the treasure name can be printed out
		113	*/
		114	static void
		115	check_treasurelist (const treasure *t, const treasurelist * tl)
		116	{
		117	if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
		118	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
		119
		120	if (t->next)
		121	check_treasurelist (t->next, tl);
		122
		123	if (t->next_yes)
		124	check_treasurelist (t->next_yes, tl);
		125
		126	if (t->next_no)
		127	check_treasurelist (t->next_no, tl);
		128	}
		129	#endif
91		130
92	/*	131	/*
93	* Reads the lib/treasure file from disk, and parses the contents	132	* Reads the lib/treasure file from disk, and parses the contents
94	* into an internal treasure structure (very linked lists)	133	* into an internal treasure structure (very linked lists)
95	*/	134	*/
96
97	static treasure *	135	static treasure *
98	load_treasure (FILE * fp, int *line)	136	read_treasure (object_thawer &f)
99	{	137	{
100	char buf[MAX_BUF], *cp, variable[MAX_BUF];
101	treasure *t = get_empty_treasure ();	138	treasure *t = new treasure;
102	int value;
103		139
104	nroftreasures++;	140	f.next ();
105	while (fgets (buf, MAX_BUF, fp) != NULL)
106	{
107	(*line)++;
108		141
109	if (*buf == '#')	142	for (;;)
110	continue;	143	{
111	if ((cp = strchr (buf, '\n')) != NULL)	144	coroapi::cede_to_tick_every (10);
112	*cp = '\0';
113	cp = buf;
114	while (isspace (*cp)) /* Skip blanks */
115	cp++;
116		145
117	if (sscanf (cp, "arch %s", variable))	146	switch (f.kw)
118	{
119	if ((t->item = archetype::find (variable)) == NULL)
120	LOG (llevError, "Treasure lacks archetype: %s\n", variable);
121	}	147	{
122	else if (sscanf (cp, "list %s", variable))	148	case KW_arch:
123	t->name = variable;	149	t->item = archetype::get (f.get_str ());
124	else if (sscanf (cp, "change_name %s", variable))	150	break;
125	t->change_arch.name = variable;	151
126	else if (sscanf (cp, "change_title %s", variable))	152	case KW_list: f.get (t->name); break;
127	t->change_arch.title = variable;	153	case KW_change_name: f.get (t->change_arch.name); break;
128	else if (sscanf (cp, "change_slaying %s", variable))	154	case KW_change_title: f.get (t->change_arch.title); break;
129	t->change_arch.slaying = variable;	155	case KW_change_slaying: f.get (t->change_arch.slaying); break;
130	else if (sscanf (cp, "chance %d", &value))	156	case KW_chance: f.get (t->chance); break;
131	t->chance = (uint8) value;	157	case KW_nrof: f.get (t->nrof); break;
132	else if (sscanf (cp, "nrof %d", &value))	158	case KW_magic: f.get (t->magic); break;
133	t->nrof = (uint16) value;	159
134	else if (sscanf (cp, "magic %d", &value))	160	case KW_yes: t->next_yes = read_treasure (f); continue;
135	t->magic = (uint8) value;	161	case KW_no: t->next_no = read_treasure (f); continue;
136	else if (!strcmp (cp, "yes"))	162
137	t->next_yes = load_treasure (fp, line);	163	case KW_end:
138	else if (!strcmp (cp, "no"))	164	f.next ();
139	t->next_no = load_treasure (fp, line);
140	else if (!strcmp (cp, "end"))
141	return t;
142	else if (!strcmp (cp, "more"))
143	{
144	t->next = load_treasure (fp, line);
145	return t;	165	return t;
146	}
147	else
148	LOG (llevError, "Unknown treasure-command: '%s', last entry %s, line %d\n", cp, &t->name, *line);
149	}
150	LOG (llevError, "treasure lacks 'end'.\n");
151	return t;
152	}
153		166
154	#ifdef TREASURE_DEBUG	167	case KW_more:
		168	t->next = read_treasure (f);
		169	return t;
155		170
156	/* recursived checks the linked list. Treasurelist is passed only	171	default:
157	* so that the treasure name can be printed out	172	if (!f.parse_error ("treasurelist", t->name))
158	*/	173	return 0;
159	static void
160	check_treasurelist (const treasure *t, const treasurelist * tl)
161	{
162	if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
163	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
164	/* find_treasurelist will print out its own error message */
165	if (t->name && *t->name)
166	find_treasurelist (t->name);
167	if (t->next)
168	check_treasurelist (t->next, tl);
169	if (t->next_yes)
170	check_treasurelist (t->next_yes, tl);
171	if (t->next_no)
172	check_treasurelist (t->next_no, tl);
173	}
174	#endif
175		174
		175	return t;
		176	}
		177
		178	f.next ();
		179	}
		180	}
		181
176	/*	182	/*
177	* Opens LIBDIR/treasure and reads all treasure-declarations from it.
178	* Each treasure is parsed with the help of load_treasure().	183	* Each treasure is parsed with the help of load_treasure().
179	*/	184	*/
180		185	treasurelist *
181	void	186	treasurelist::read (object_thawer &f)
182	load_treasures (void)
183	{	187	{
184	FILE *fp;	188	assert (f.kw == KW_treasure || f.kw == KW_treasureone);
185	char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];
186	treasurelist *previous = NULL;
187	treasure *t;
188	int comp, line = 0;
189		189
190	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	190	bool one = f.kw == KW_treasureone;
191	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	191	treasurelist *tl = treasurelist::get (f.get_str ());
192	{	192	clear (tl);
193	LOG (llevError, "Can't open treasure file.\n");	193	tl->items = read_treasure (f);
		194	if (!tl->items)
194	return;	195	return 0;
195	}
196	while (fgets (buf, MAX_BUF, fp) != NULL)
197	{
198	line++;
199	if (*buf == '#')
200	continue;
201		196
202	if (sscanf (buf, "treasureone %s\n", name) || sscanf (buf, "treasure %s\n", name))
203	{
204	treasurelist *tl = get_empty_treasurelist ();
205
206	tl->name = name;
207	if (previous == NULL)
208	first_treasurelist = tl;
209	else
210	previous->next = tl;
211	previous = tl;
212	tl->items = load_treasure (fp, &line);
213
214	/* This is a one of the many items on the list should be generated.	197	/* This is a one of the many items on the list should be generated.
215	* Add up the chance total, and check to make sure the yes & no	198	* Add up the chance total, and check to make sure the yes & no
216	* fields of the treasures are not being used.	199	* fields of the treasures are not being used.
217	*/	200	*/
218	if (!strncmp (buf, "treasureone", 11))	201	if (one)
		202	{
		203	for (treasure *t = tl->items; t; t = t->next)
		204	{
		205	if (t->next_yes || t->next_no)
219	{	206	{
220	for (t = tl->items; t != NULL; t = t->next)
221	{
222	#ifdef TREASURE_DEBUG
223	if (t->next_yes || t->next_no)
224	{
225	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);	207	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->archname : &t->name);
226	LOG (llevError, " the next_yes or next_no field is set\n");	208	LOG (llevError, " the next_yes or next_no field is set\n");
227	}
228	#endif
229	tl->total_chance += t->chance;
230	}
231	}	209	}
232	}
233	else
234	LOG (llevError, "Treasure-list %s didn't understand: %s, line %d\n", filename, buf, line);
235	}
236	close_and_delete (fp, comp);
237		210
238	#ifdef TREASURE_DEBUG	211	tl->total_chance += t->chance;
239	/* Perform some checks on how valid the treasure data actually is.	212	}
240	* verify that list transitions work (ie, the list that it is supposed	213	}
241	* to transition to exists). Also, verify that at least the name
242	* or archetype is set for each treasure element.
243	*/
244	for (previous = first_treasurelist; previous != NULL; previous = previous->next)
245	check_treasurelist (previous->items, previous);
246	#endif
247	}
248		214
249	/*
250	* Searches for the given treasurelist in the globally linked list
251	* of treasurelists which has been built by load_treasures().
252	*/
253
254	treasurelist *
255	find_treasurelist (const char *name)
256	{
257	shstr_cmp name_ (name);
258
259	if (!name_)
260	return 0;
261
262	for (treasurelist *tl = first_treasurelist; tl != 0; tl = tl->next)
263	if (name_ == tl->name)
264	return tl;
265
266	if (first_treasurelist)
267	LOG (llevError, "Couldn't find treasurelist %s\n", name);
268
269	return 0;	215	return tl;
270	}	216	}
271
272		217
273	/*	218	/*
274	* Generates the objects specified by the given treasure.	219	* Generates the objects specified by the given treasure.
275	* It goes recursively through the rest of the linked list.	220	* It goes recursively through the rest of the linked list.
276	* If there is a certain percental chance for a treasure to be generated,	221	* If there is a certain percental chance for a treasure to be generated,
…		…
282	* start with equipment, but only their abilities).	227	* start with equipment, but only their abilities).
283	*/	228	*/
284	static void	229	static void
285	put_treasure (object *op, object *creator, int flags)	230	put_treasure (object *op, object *creator, int flags)
286	{	231	{
287	object *tmp;	232	if (flags & GT_ENVIRONMENT)
288		233	{
289	/* Bit of a hack - spells should never be put onto the map. The entire	234	/* Bit of a hack - spells should never be put onto the map. The entire
290	* treasure stuff is a problem - there is no clear idea of knowing	235	* treasure stuff is a problem - there is no clear idea of knowing
291	* this is the original object, or if this is an object that should be created	236	* this is the original object, or if this is an object that should be created
292	* by another object.	237	* by another object.
293	*/	238	*/
294	if (flags & GT_ENVIRONMENT && op->type != SPELL)	239	//TODO: flag such as objects... as such (no drop, anybody?)
295	{	240	if (op->type == SPELL)
		241	{
		242	op->destroy ();
		243	return;
		244	}
		245
		246	op->expand_tail ();
		247
		248	if (ob_blocked (op, creator->map, creator->x, creator->y))
		249	op->destroy ();
		250	else
		251	{
296	SET_FLAG (op, FLAG_OBJ_ORIGINAL);	252	SET_FLAG (op, FLAG_OBJ_ORIGINAL);
297	op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);	253	op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);
		254	}
298	}	255	}
299	else	256	else
300	{	257	{
301	op = creator->insert (op);	258	op = creator->insert (op);
302		259
303	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))	260	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
304	monster_check_apply (creator, op);	261	monster_check_apply (creator, op);
305		262
306	if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ()))	263	if (flags & GT_UPDATE_INV)
		264	if (object *tmp = creator->in_player ())
307	esrv_send_item (tmp, op);	265	esrv_send_item (tmp, op);
308	}	266	}
309	}	267	}
310		268
311	/* if there are change_xxx commands in the treasure, we include the changes	269	/* if there are change_xxx commands in the treasure, we include the changes
312	* in the generated object	270	* in the generated object
…		…
326		284
327	if (t->change_arch.slaying)	285	if (t->change_arch.slaying)
328	op->slaying = t->change_arch.slaying;	286	op->slaying = t->change_arch.slaying;
329	}	287	}
330		288
331	void	289	static void
332	create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries)	290	create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries)
333	{	291	{
334	object *tmp;
335
336	if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance)	292	if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance)
337	{	293	{
338	if (t->name)	294	if (t->name)
339	{	295	{
340	if (difficulty >= t->magic)	296	if (difficulty >= t->magic)
		297	if (treasurelist *tl = treasurelist::find (t->name))
		298	create_treasure (tl, op, flag, difficulty, tries);
		299	else
		300	LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
		301	}
		302	else
		303	{
		304	if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE)))
341	{	305	{
342	treasurelist *tl = find_treasurelist (t->name);
343	if (tl)
344	create_treasure (tl, op, flag, difficulty, tries);
345	}
346	}
347	else
348	{
349	if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE)))
350	{
351	tmp = arch_to_object (t->item);	306	object *tmp = arch_to_object (t->item);
		307
352	if (t->nrof && tmp->nrof <= 1)	308	if (t->nrof && tmp->nrof <= 1)
353	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	309	tmp->nrof = rndm (t->nrof) + 1;
		310
354	fix_generated_item (tmp, op, difficulty, t->magic, flag);	311	fix_generated_item (tmp, op, difficulty, t->magic, flag);
355	change_treasure (t, tmp);	312	change_treasure (t, tmp);
356	put_treasure (tmp, op, flag);	313	put_treasure (tmp, op, flag);
357	}	314	}
358	}	315	}
359		316
360	if (t->next_yes != NULL)	317	if (t->next_yes)
361	create_all_treasures (t->next_yes, op, flag, difficulty, tries);	318	create_all_treasures (t->next_yes, op, flag, difficulty, tries);
362	}	319	}
363	else if (t->next_no != NULL)	320	else if (t->next_no)
364	create_all_treasures (t->next_no, op, flag, difficulty, tries);	321	create_all_treasures (t->next_no, op, flag, difficulty, tries);
365		322
366	if (t->next != NULL)	323	if (t->next)
367	create_all_treasures (t->next, op, flag, difficulty, tries);	324	create_all_treasures (t->next, op, flag, difficulty, tries);
368	}	325	}
369		326
370	void	327	static void
371	create_one_treasure (treasurelist * tl, object *op, int flag, int difficulty, int tries)	328	create_one_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
372	{	329	{
373	int value = RANDOM () % tl->total_chance;	330	int value = rndm (tl->total_chance);
374	treasure *t;	331	treasure *t;
375		332
376	if (tries++ > 100)	333	if (tries++ > 100)
377	{	334	{
378	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");	335	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");
379	return;	336	return;
380	}	337	}
381		338
382	for (t = tl->items; t != NULL; t = t->next)	339	for (t = tl->items; t; t = t->next)
383	{	340	{
384	value -= t->chance;	341	value -= t->chance;
385		342
386	if (value < 0)	343	if (value < 0)
387	break;	344	break;
388	}	345	}
389		346
390	if (!t || value >= 0)	347	if (!t || value >= 0)
391	{
392	LOG (llevError, "create_one_treasure: got null object or not able to find treasure\n");	348	cleanup ("create_one_treasure: got null object or not able to find treasure\n", 1);
393	abort ();
394	return;
395	}
396		349
397	if (t->name)	350	if (t->name)
398	{	351	{
399	if (difficulty >= t->magic)	352	if (difficulty >= t->magic)
400	{	353	{
401	treasurelist *tl = find_treasurelist (t->name);	354	treasurelist *tl = treasurelist::find (t->name);
402	if (tl)	355	if (tl)
403	create_treasure (tl, op, flag, difficulty, tries);	356	create_treasure (tl, op, flag, difficulty, tries);
404	}	357	}
405	else if (t->nrof)	358	else if (t->nrof)
406	create_one_treasure (tl, op, flag, difficulty, tries);	359	create_one_treasure (tl, op, flag, difficulty, tries);
407
408	return;
409	}	360	}
410
411	if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE))	361	else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE))
412	{	362	{
413	object *tmp = arch_to_object (t->item);	363	if (object *tmp = arch_to_object (t->item))
414		364	{
415	if (!tmp)
416	return;
417
418	if (t->nrof && tmp->nrof <= 1)	365	if (t->nrof && tmp->nrof <= 1)
419	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	366	tmp->nrof = rndm (t->nrof) + 1;
420		367
421	fix_generated_item (tmp, op, difficulty, t->magic, flag);	368	fix_generated_item (tmp, op, difficulty, t->magic, flag);
422	change_treasure (t, tmp);	369	change_treasure (t, tmp);
423	put_treasure (tmp, op, flag);	370	put_treasure (tmp, op, flag);
		371	}
424	}	372	}
		373	}
		374
		375	void
		376	object::create_treasure (treasurelist *tl, int flags)
		377	{
		378	::create_treasure (tl, this, flags, map ? map->difficulty : 0);
425	}	379	}
426		380
427	/* This calls the appropriate treasure creation function. tries is passed	381	/* This calls the appropriate treasure creation function. tries is passed
428	* to determine how many list transitions or attempts to create treasure	382	* to determine how many list transitions or attempts to create treasure
429	* have been made. It is really in place to prevent infinite loops with	383	* have been made. It is really in place to prevent infinite loops with
…		…
432	* to do that.	386	* to do that.
433	*/	387	*/
434	void	388	void
435	create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)	389	create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
436	{	390	{
		391	// empty treasurelists are legal
		392	if (!tl->items)
		393	return;
437		394
438	if (tries++ > 100)	395	if (tries++ > 100)
439	{	396	{
440	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	397	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
441	return;	398	return;
442	}	399	}
		400
		401	if (op->flag [FLAG_TREASURE_ENV])
		402	{
		403	// do not generate items when there already is something above the object
		404	if (op->flag [FLAG_IS_FLOOR] && op->above)
		405	return;
		406
		407	flag |= GT_ENVIRONMENT;
		408	}
		409
443	if (tl->total_chance)	410	if (tl->total_chance)
444	create_one_treasure (tl, op, flag, difficulty, tries);	411	create_one_treasure (tl, op, flag, difficulty, tries);
445	else	412	else
446	create_all_treasures (tl->items, op, flag, difficulty, tries);	413	create_all_treasures (tl->items, op, flag, difficulty, tries);
447	}	414	}
…		…
454	object *	421	object *
455	generate_treasure (treasurelist *tl, int difficulty)	422	generate_treasure (treasurelist *tl, int difficulty)
456	{	423	{
457	difficulty = clamp (difficulty, 1, settings.max_level);	424	difficulty = clamp (difficulty, 1, settings.max_level);
458		425
459	object *ob = object::create (), *tmp;	426	object *ob = object::create ();
460		427
461	create_treasure (tl, ob, 0, difficulty, 0);	428	create_treasure (tl, ob, 0, difficulty, 0);
462		429
463	/* Don't want to free the object we are about to return */	430	/* Don't want to free the object we are about to return */
464	tmp = ob->inv;	431	object *tmp = ob->inv;
465	if (tmp != NULL)	432	if (tmp)
466	tmp->remove ();	433	tmp->remove ();
467		434
468	if (ob->inv)	435	if (ob->inv)
469	LOG (llevError, "In generate treasure, created multiple objects.\n");	436	LOG (llevError, "In generate treasure, created multiple objects.\n");
470		437
…		…
478	* The array has two arguments, the difficulty of the level, and the	445	* The array has two arguments, the difficulty of the level, and the
479	* magical bonus "wanted".	446	* magical bonus "wanted".
480	*/	447	*/
481		448
482	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	449	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
483
484	/*chance of magic difficulty*/	450	// chance of magic difficulty
485
486	/* +0 +1 +2 +3 +4 */	451	// +0 +1 +2 +3 +4
487	{95, 2, 2, 1, 0}, /*1 */	452	{95, 2, 2, 1, 0}, // 1
488	{92, 5, 2, 1, 0}, /*2 */	453	{92, 5, 2, 1, 0}, // 2
489	{85, 10, 4, 1, 0}, /*3 */	454	{85, 10, 4, 1, 0}, // 3
490	{80, 14, 4, 2, 0}, /*4 */	455	{80, 14, 4, 2, 0}, // 4
491	{75, 17, 5, 2, 1}, /*5 */	456	{75, 17, 5, 2, 1}, // 5
492	{70, 18, 8, 3, 1}, /*6 */	457	{70, 18, 8, 3, 1}, // 6
493	{65, 21, 10, 3, 1}, /*7 */	458	{65, 21, 10, 3, 1}, // 7
494	{60, 22, 12, 4, 2}, /*8 */	459	{60, 22, 12, 4, 2}, // 8
495	{55, 25, 14, 4, 2}, /*9 */	460	{55, 25, 14, 4, 2}, // 9
496	{50, 27, 16, 5, 2}, /*10 */	461	{50, 27, 16, 5, 2}, // 10
497	{45, 28, 18, 6, 3}, /*11 */	462	{45, 28, 18, 6, 3}, // 11
498	{42, 28, 20, 7, 3}, /*12 */	463	{42, 28, 20, 7, 3}, // 12
499	{40, 27, 21, 8, 4}, /*13 */	464	{40, 27, 21, 8, 4}, // 13
500	{38, 25, 22, 10, 5}, /*14 */	465	{38, 25, 22, 10, 5}, // 14
501	{36, 23, 23, 12, 6}, /*15 */	466	{36, 23, 23, 12, 6}, // 15
502	{33, 21, 24, 14, 8}, /*16 */	467	{33, 21, 24, 14, 8}, // 16
503	{31, 19, 25, 16, 9}, /*17 */	468	{31, 19, 25, 16, 9}, // 17
504	{27, 15, 30, 18, 10}, /*18 */	469	{27, 15, 30, 18, 10}, // 18
505	{20, 12, 30, 25, 13}, /*19 */	470	{20, 12, 30, 25, 13}, // 19
506	{15, 10, 28, 30, 17}, /*20 */	471	{15, 10, 28, 30, 17}, // 20
507	{13, 9, 27, 28, 23}, /*21 */	472	{13, 9, 27, 28, 23}, // 21
508	{10, 8, 25, 28, 29}, /*22 */	473	{10, 8, 25, 28, 29}, // 22
509	{8, 7, 23, 26, 36}, /*23 */	474	{ 8, 7, 23, 26, 36}, // 23
510	{6, 6, 20, 22, 46}, /*24 */	475	{ 6, 6, 20, 22, 46}, // 24
511	{4, 5, 17, 18, 56}, /*25 */	476	{ 4, 5, 17, 18, 56}, // 25
512	{2, 4, 12, 14, 68}, /*26 */	477	{ 2, 4, 12, 14, 68}, // 26
513	{0, 3, 7, 10, 80}, /*27 */	478	{ 0, 3, 7, 10, 80}, // 27
514	{0, 0, 3, 7, 90}, /*28 */	479	{ 0, 0, 3, 7, 90}, // 28
515	{0, 0, 0, 3, 97}, /*29 */	480	{ 0, 0, 0, 3, 97}, // 29
516	{0, 0, 0, 0, 100}, /*30 */	481	{ 0, 0, 0, 0, 100}, // 30
517	{0, 0, 0, 0, 100}, /*31 */	482	{ 0, 0, 0, 0, 100}, // 31
518	};	483	};
519
520		484
521	/* calculate the appropriate level for wands staves and scrolls.	485	/* calculate the appropriate level for wands staves and scrolls.
522	* This code presumes that op has had its spell object created (in op->inv)	486	* This code presumes that op has had its spell object created (in op->inv)
523	*	487	*
524	* elmex Wed Aug 9 17:44:59 CEST 2006:	488	* elmex Wed Aug 9 17:44:59 CEST 2006:
525	* Removed multiplicator, too many high-level items were generated on low-difficulty maps.	489	* Removed multiplicator, too many high-level items were generated on low-difficulty maps.
526	*/	490	*/
527
528	int	491	int
529	level_for_item (const object *op, int difficulty)	492	level_for_item (const object *op, int difficulty)
530	{	493	{
531	int olevel = 0;	494	int olevel = 0;
532		495
…		…
555	* elmex Thu Aug 10 18:45:44 CEST 2006:	518	* elmex Thu Aug 10 18:45:44 CEST 2006:
556	* Scaling difficulty by max_level, as difficulty is a level and not some	519	* Scaling difficulty by max_level, as difficulty is a level and not some
557	* weird integer between 1-31.	520	* weird integer between 1-31.
558	*	521	*
559	*/	522	*/
560
561	int	523	int
562	magic_from_difficulty (int difficulty)	524	magic_from_difficulty (int difficulty)
563	{	525	{
564	int percent = 0, magic = 0;	526	int percent = 0, magic = 0;
565	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	527	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
…		…
609		571
610	op->magic = magic;	572	op->magic = magic;
611	if (op->arch)	573	if (op->arch)
612	{	574	{
613	if (op->type == ARMOUR)	575	if (op->type == ARMOUR)
614	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	576	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
615		577
616	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */	578	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
617	magic = (-magic);	579	magic = (-magic);
618	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	580	op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
619	}	581	}
620	else	582	else
621	{	583	{
622	if (op->type == ARMOUR)	584	if (op->type == ARMOUR)
623	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	585	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
…		…
653	* 1) Since rings can have multiple bonuses, if the same bonus	615	* 1) Since rings can have multiple bonuses, if the same bonus
654	* is rolled again, increase it - the bonuses now stack with	616	* is rolled again, increase it - the bonuses now stack with
655	* other bonuses previously rolled and ones the item might natively have.	617	* other bonuses previously rolled and ones the item might natively have.
656	* 2) Add code to deal with new PR method.	618	* 2) Add code to deal with new PR method.
657	*/	619	*/
658
659	void	620	void
660	set_ring_bonus (object *op, int bonus)	621	set_ring_bonus (object *op, int bonus)
661	{	622	{
662		623
663	int r = RANDOM () % (bonus > 0 ? 25 : 11);	624	int r = rndm (bonus > 0 ? 25 : 11);
664		625
665	if (op->type == AMULET)	626	if (op->type == AMULET)
666	{	627	{
667	if (!(rndm (21)))	628	if (!(rndm (21)))
668	r = 20 + rndm (2);	629	r = 20 + rndm (2);
669	else	630	else
670	{	631	{
671	if (RANDOM () & 2)	632	if (rndm (2))
672	r = 10;	633	r = 10;
673	else	634	else
674	r = 11 + rndm (9);	635	r = 11 + rndm (9);
675	}	636	}
676	}	637	}
…		…
686	case 2:	647	case 2:
687	case 3:	648	case 3:
688	case 4:	649	case 4:
689	case 5:	650	case 5:
690	case 6:	651	case 6:
691	set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r)));	652	op->stats.stat (r) += bonus;
692	break;	653	break;
693		654
694	case 7:	655	case 7:
695	op->stats.dam += bonus;	656	op->stats.dam += bonus;
696	break;	657	break;
…		…
716	case 16:	677	case 16:
717	case 17:	678	case 17:
718	case 18:	679	case 18:
719	case 19:	680	case 19:
720	{	681	{
721	int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table;	682	int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
722		683
723	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */	684	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */
724	val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b;	685	val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
725		686
726	/* Cursed items need to have higher negative values to equal out with	687	/* Cursed items need to have higher negative values to equal out with
727	* positive values for how protections work out. Put another	688	* positive values for how protections work out. Put another
728	* little random element in since that they don't always end up with	689	* little random element in since that they don't always end up with
729	* even values.	690	* even values.
730	*/	691	*/
731	if (bonus < 0)	692	if (bonus < 0)
732	val = 2 * -val - RANDOM () % b;	693	val = 2 * -val - rndm (b);
733	if (val > 35)	694	if (val > 35)
734	val = 35; /* Upper limit */	695	val = 35; /* Upper limit */
735	b = 0;	696	b = 0;
		697
736	while (op->resist[resist_table[resist]] != 0 && b < 4)	698	while (op->resist[resist_table[resist]] != 0 && b < 4)
737	{
738	resist = RANDOM () % num_resist_table;	699	resist = rndm (num_resist_table);
739	}	700
740	if (b == 4)	701	if (b == 4)
741	return; /* Not able to find a free resistance */	702	return; /* Not able to find a free resistance */
		703
742	op->resist[resist_table[resist]] = val;	704	op->resist[resist_table[resist]] = val;
743	/* We should probably do something more clever here to adjust value	705	/* We should probably do something more clever here to adjust value
744	* based on how good a resistance we gave.	706	* based on how good a resistance we gave.
745	*/	707	*/
746	break;	708	break;
…		…
774	case 22:	736	case 22:
775	op->stats.exp += bonus; /* Speed! */	737	op->stats.exp += bonus; /* Speed! */
776	op->value = (op->value * 2) / 3;	738	op->value = (op->value * 2) / 3;
777	break;	739	break;
778	}	740	}
		741
779	if (bonus > 0)	742	if (bonus > 0)
780	op->value *= 2 * bonus;	743	op->value *= 2 * bonus;
781	else	744	else
782	op->value = -(op->value * 2 * bonus) / 3;	745	op->value = -(op->value * 2 * bonus) / 3;
783	}	746	}
…		…
788	* higher is the chance of returning a low number.	751	* higher is the chance of returning a low number.
789	* It is only used in fix_generated_treasure() to set bonuses on	752	* It is only used in fix_generated_treasure() to set bonuses on
790	* rings and amulets.	753	* rings and amulets.
791	* Another scheme is used to calculate the magic of weapons and armours.	754	* Another scheme is used to calculate the magic of weapons and armours.
792	*/	755	*/
793
794	int	756	int
795	get_magic (int diff)	757	get_magic (int diff)
796	{	758	{
797	int i;	759	int i;
798		760
799	if (diff < 3)	761	if (diff < 3)
800	diff = 3;	762	diff = 3;
		763
801	for (i = 0; i < 4; i++)	764	for (i = 0; i < 4; i++)
802	if (RANDOM () % diff)	765	if (rndm (diff))
803	return i;	766	return i;
		767
804	return 4;	768	return 4;
805	}	769	}
806		770
807	#define DICE2 (get_magic(2)==2?2:1)	771	#define DICE2 (get_magic(2)==2?2:1)
808	#define DICESPELL (rndm (3)+RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3)	772	#define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))
809		773
810	/*	774	/*
811	* fix_generated_item(): This is called after an item is generated, in	775	* fix_generated_item(): This is called after an item is generated, in
812	* order to set it up right. This produced magical bonuses, puts spells	776	* order to set it up right. This produced magical bonuses, puts spells
813	* into scrolls/books/wands, makes it unidentified, hides the value, etc.	777	* into scrolls/books/wands, makes it unidentified, hides the value, etc.
…		…
827	* value.	791	* value.
828	* GT_MINIMAL: Does minimal processing on the object - just enough to make it	792	* GT_MINIMAL: Does minimal processing on the object - just enough to make it
829	* a working object - don't change magic, value, etc, but set it material	793	* a working object - don't change magic, value, etc, but set it material
830	* type as appropriate, for objects that need spell objects, set those, etc	794	* type as appropriate, for objects that need spell objects, set those, etc
831	*/	795	*/
832
833	void	796	void
834	fix_generated_item (object *op, object *creator, int difficulty, int max_magic, int flags)	797	fix_generated_item (object *op, object *creator, int difficulty, int max_magic, int flags)
835	{	798	{
836	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;	799	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;
837		800
…		…
842	save_item_power = op->item_power;	805	save_item_power = op->item_power;
843	op->item_power = 0;	806	op->item_power = 0;
844		807
845	if (op->randomitems && op->type != SPELL)	808	if (op->randomitems && op->type != SPELL)
846	{	809	{
847	create_treasure (op->randomitems, op, flags, difficulty, 0);	810	create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0);
848	if (!op->inv)
849	LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", &op->name);
850
851	/* So the treasure doesn't get created again */	811	/* So the treasure doesn't get created again */
852	op->randomitems = NULL;	812	op->randomitems = 0;
853	}	813	}
854		814
855	if (difficulty < 1)	815	if (difficulty < 1)
856	difficulty = 1;	816	difficulty = 1;
857		817
…		…
874	if (!op->magic && max_magic)	834	if (!op->magic && max_magic)
875	set_magic (difficulty, op, max_magic, flags);	835	set_magic (difficulty, op, max_magic, flags);
876		836
877	num_enchantments = calc_item_power (op, 1);	837	num_enchantments = calc_item_power (op, 1);
878		838
879	if ((!was_magic && !(RANDOM () % CHANCE_FOR_ARTIFACT)) || op->type == HORN || difficulty >= settings.max_level) /* high difficulties always generate an artifact,	839	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
		840	|| op->type == HORN
		841	|| difficulty >= settings.max_level) /* high difficulties always generate an artifact,
880	* used for shop_floors or treasures */	842	* used for shop_floors or treasures */
881	generate_artifact (op, difficulty);	843	generate_artifact (op, difficulty);
882	}	844	}
883		845
884	/* Object was made an artifact. Calculate its item_power rating.	846	/* Object was made an artifact. Calculate its item_power rating.
…		…
947	if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))	909	if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
948	set_ring_bonus (op, -DICE2);	910	set_ring_bonus (op, -DICE2);
949	break;	911	break;
950		912
951	case BRACERS:	913	case BRACERS:
952	if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)))	914	if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
953	{	915	{
954	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	916	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
955	if (!QUERY_FLAG (op, FLAG_CURSED))	917	if (!QUERY_FLAG (op, FLAG_CURSED))
956	op->value *= 3;	918	op->value *= 3;
957	}	919	}
…		…
983	*/	945	*/
984	if (op->inv && op->randomitems)	946	if (op->inv && op->randomitems)
985	{	947	{
986	/* value multiplier is same as for scrolls */	948	/* value multiplier is same as for scrolls */
987	op->value = (op->value * op->inv->value);	949	op->value = (op->value * op->inv->value);
988	op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty;	950	op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
989	}	951	}
990	else	952	else
991	{	953	{
992	op->name = "potion";	954	op->name = "potion";
993	op->name_pl = "potions";	955	op->name_pl = "potions";
…		…
1039	set_ring_bonus (op, d);	1001	set_ring_bonus (op, d);
1040	}	1002	}
1041	}	1003	}
1042		1004
1043	if (GET_ANIM_ID (op))	1005	if (GET_ANIM_ID (op))
1044	SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op)));	1006	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1045		1007
1046	break;	1008	break;
1047		1009
1048	case BOOK:	1010	case BOOK:
1049	/* Is it an empty book?, if yes lets make a special·	1011	/* Is it an empty book?, if yes lets make a special·
…		…
1054	{	1016	{
1055	/* set the book level properly */	1017	/* set the book level properly */
1056	if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE))	1018	if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE))
1057	{	1019	{
1058	if (op->map && op->map->difficulty)	1020	if (op->map && op->map->difficulty)
1059	op->level = RANDOM () % (op->map->difficulty) + rndm (10) + 1;	1021	op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1060	else	1022	else
1061	op->level = rndm (20) + 1;	1023	op->level = rndm (20) + 1;
1062	}	1024	}
1063	else	1025	else
1064	op->level = RANDOM () % creator->level;	1026	op->level = rndm (creator->level);
1065		1027
1066	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);	1028	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);
1067	/* books w/ info are worth more! */	1029	/* books w/ info are worth more! */
1068	op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1));	1030	op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1));
1069	/* creator related stuff */	1031	/* creator related stuff */
…		…
1168	*/	1130	*/
1169		1131
1170	/*	1132	/*
1171	* Allocate and return the pointer to an empty artifactlist structure.	1133	* Allocate and return the pointer to an empty artifactlist structure.
1172	*/	1134	*/
1173
1174	static artifactlist *	1135	static artifactlist *
1175	get_empty_artifactlist (void)	1136	get_empty_artifactlist (void)
1176	{	1137	{
1177	artifactlist *al = (artifactlist *) malloc (sizeof (artifactlist));	1138	return salloc0 <artifactlist> ();
1178
1179	if (al == NULL)
1180	fatal (OUT_OF_MEMORY);
1181	al->next = NULL;
1182	al->items = NULL;
1183	al->total_chance = 0;
1184	return al;
1185	}	1139	}
1186		1140
1187	/*	1141	/*
1188	* Allocate and return the pointer to an empty artifact structure.	1142	* Allocate and return the pointer to an empty artifact structure.
1189	*/	1143	*/
1190
1191	static artifact *	1144	static artifact *
1192	get_empty_artifact (void)	1145	get_empty_artifact (void)
1193	{	1146	{
1194	artifact *a = (artifact *) malloc (sizeof (artifact));	1147	return salloc0 <artifact> ();
1195
1196	if (a == NULL)
1197	fatal (OUT_OF_MEMORY);
1198	a->item = NULL;
1199	a->next = NULL;
1200	a->chance = 0;
1201	a->difficulty = 0;
1202	a->allowed = NULL;
1203	return a;
1204	}	1148	}
1205		1149
1206	/*	1150	/*
1207	* Searches the artifact lists and returns one that has the same type	1151	* Searches the artifact lists and returns one that has the same type
1208	* of objects on it.	1152	* of objects on it.
1209	*/	1153	*/
1210
1211	artifactlist *	1154	artifactlist *
1212	find_artifactlist (int type)	1155	find_artifactlist (int type)
1213	{	1156	{
1214	artifactlist *al;
1215
1216	for (al = first_artifactlist; al != NULL; al = al->next)	1157	for (artifactlist *al = first_artifactlist; al; al = al->next)
1217	if (al->type == type)	1158	if (al->type == type)
1218	return al;	1159	return al;
		1160
1219	return NULL;	1161	return 0;
1220	}	1162	}
1221		1163
1222	/*	1164	/*
1223	* For debugging purposes. Dumps all tables.	1165	* For debugging purposes. Dumps all tables.
1224	*/	1166	*/
1225
1226	void	1167	void
1227	dump_artifacts (void)	1168	dump_artifacts (void)
1228	{	1169	{
1229	artifactlist *al;	1170	artifactlist *al;
1230	artifact *art;	1171	artifact *art;
…		…
1237	for (art = al->items; art != NULL; art = art->next)	1178	for (art = al->items; art != NULL; art = art->next)
1238	{	1179	{
1239	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);	1180	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1240	if (art->allowed != NULL)	1181	if (art->allowed != NULL)
1241	{	1182	{
1242	fprintf (logfile, "\tAllowed combinations:");	1183	fprintf (logfile, "\tallowed combinations:");
1243	for (next = art->allowed; next != NULL; next = next->next)	1184	for (next = art->allowed; next != NULL; next = next->next)
1244	fprintf (logfile, "%s,", &next->name);	1185	fprintf (logfile, "%s,", &next->name);
1245	fprintf (logfile, "\n");	1186	fprintf (logfile, "\n");
1246	}	1187	}
1247	}	1188	}
…		…
1258	treasurelist *tl;	1199	treasurelist *tl;
1259	int i;	1200	int i;
1260		1201
1261	if (depth > 100)	1202	if (depth > 100)
1262	return;	1203	return;
		1204
1263	while (t)	1205	while (t)
1264	{	1206	{
1265	if (t->name)	1207	if (t->name)
1266	{	1208	{
1267	for (i = 0; i < depth; i++)	1209	for (i = 0; i < depth; i++)
1268	fprintf (logfile, " ");	1210	fprintf (logfile, " ");
		1211
1269	fprintf (logfile, "{ (list: %s)\n", &t->name);	1212	fprintf (logfile, "{ (list: %s)\n", &t->name);
		1213
1270	tl = find_treasurelist (t->name);	1214	tl = treasurelist::find (t->name);
1271	if (tl)	1215	if (tl)
1272	dump_monster_treasure_rec (name, tl->items, depth + 2);	1216	dump_monster_treasure_rec (name, tl->items, depth + 2);
		1217
1273	for (i = 0; i < depth; i++)	1218	for (i = 0; i < depth; i++)
1274	fprintf (logfile, " ");	1219	fprintf (logfile, " ");
		1220
1275	fprintf (logfile, "} (end of list: %s)\n", &t->name);	1221	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1276	}	1222	}
1277	else	1223	else
1278	{	1224	{
1279	for (i = 0; i < depth; i++)	1225	for (i = 0; i < depth; i++)
1280	fprintf (logfile, " ");	1226	fprintf (logfile, " ");
		1227
1281	if (t->item && t->item->clone.type == FLESH)	1228	if (t->item && t->item->type == FLESH)
1282	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);	1229	fprintf (logfile, "%s's %s\n", name, &t->item->object::name);
1283	else	1230	else
1284	fprintf (logfile, "%s\n", &t->item->clone.name);	1231	fprintf (logfile, "%s\n", &t->item->object::name);
1285	}	1232	}
1286		1233
1287	if (t->next_yes)	1234	if (t->next_yes)
1288	{	1235	{
1289	for (i = 0; i < depth; i++)	1236	for (i = 0; i < depth; i++)
1290	fprintf (logfile, " ");	1237	fprintf (logfile, " ");
		1238
1291	fprintf (logfile, " (if yes)\n");	1239	fprintf (logfile, " (if yes)\n");
1292	dump_monster_treasure_rec (name, t->next_yes, depth + 1);	1240	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1293	}	1241	}
1294		1242
1295	if (t->next_no)	1243	if (t->next_no)
1296	{	1244	{
1297	for (i = 0; i < depth; i++)	1245	for (i = 0; i < depth; i++)
1298	fprintf (logfile, " ");	1246	fprintf (logfile, " ");
		1247
1299	fprintf (logfile, " (if no)\n");	1248	fprintf (logfile, " (if no)\n");
1300	dump_monster_treasure_rec (name, t->next_no, depth + 1);	1249	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1301	}	1250	}
1302		1251
1303	t = t->next;	1252	t = t->next;
…		…
1306		1255
1307	/*	1256	/*
1308	* For debugging purposes. Dumps all treasures for a given monster.	1257	* For debugging purposes. Dumps all treasures for a given monster.
1309	* Created originally by Raphael Quinet for debugging the alchemy code.	1258	* Created originally by Raphael Quinet for debugging the alchemy code.
1310	*/	1259	*/
1311
1312	void	1260	void
1313	dump_monster_treasure (const char *name)	1261	dump_monster_treasure (const char *name)
1314	{	1262	{
1315	archetype *at;	1263	archetype *at;
1316	int found;	1264	int found;
1317		1265
1318	found = 0;	1266	found = 0;
1319	fprintf (logfile, "\n");	1267	fprintf (logfile, "\n");
1320	for (at = first_archetype; at != NULL; at = at->next)	1268
		1269	for_all_archetypes (at)
1321	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)	1270	if (!strcasecmp (at->object::name, name) && at->title == NULL)
1322	{	1271	{
1323	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);	1272	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->object::name, &at->archname);
1324	if (at->clone.randomitems != NULL)	1273	if (at->randomitems != NULL)
1325	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);	1274	dump_monster_treasure_rec (at->object::name, at->randomitems->items, 1);
1326	else	1275	else
1327	fprintf (logfile, "(nothing)\n");	1276	fprintf (logfile, "(nothing)\n");
		1277
1328	fprintf (logfile, "\n");	1278	fprintf (logfile, "\n");
1329	found++;	1279	found++;
1330	}	1280	}
		1281
1331	if (found == 0)	1282	if (found == 0)
1332	fprintf (logfile, "No objects have the name %s!\n\n", name);	1283	fprintf (logfile, "No objects have the name %s!\n\n", name);
1333	}	1284	}
1334		1285
1335	/*	1286	/*
1336	* Builds up the lists of artifacts from the file in the libdir.	1287	* Builds up the lists of artifacts from the file in the libdir.
1337	*/	1288	*/
1338
1339	void	1289	void
1340	init_artifacts (void)	1290	init_artifacts (void)
1341	{	1291	{
1342	static int has_been_inited = 0;	1292	static int has_been_inited = 0;
1343	char filename[MAX_BUF], buf[HUGE_BUF], *cp, *next;	1293	char filename[MAX_BUF];
1344	artifact *art = NULL;	1294	artifact *art = NULL;
1345	linked_char *tmp;
1346	int value;
1347	artifactlist *al;	1295	artifactlist *al;
1348		1296
1349	if (has_been_inited)	1297	if (has_been_inited)
1350	return;	1298	return;
1351	else	1299	else
1352	has_been_inited = 1;	1300	has_been_inited = 1;
1353		1301
1354	sprintf (filename, "%s/artifacts", settings.datadir);	1302	sprintf (filename, "%s/artifacts", settings.datadir);
1355	object_thawer thawer (filename);	1303	object_thawer f (filename);
1356		1304
1357	if (!thawer)	1305	if (!f)
1358	return;	1306	return;
1359		1307
1360	while (fgets (buf, HUGE_BUF, thawer) != NULL)	1308	f.next ();
1361	{
1362	if (*buf == '#')
1363	continue;
1364	if ((cp = strchr (buf, '\n')) != NULL)
1365	*cp = '\0';
1366	cp = buf;
1367	while (*cp == ' ') /* Skip blanks */
1368	cp++;
1369	if (*cp == '\0')
1370	continue;
1371		1309
1372	if (!strncmp (cp, "Allowed", 7))	1310	for (;;)
		1311	{
		1312	switch (f.kw)
1373	{	1313	{
		1314	case KW_allowed:
1374	if (art == NULL)	1315	if (!art)
		1316	art = get_empty_artifact ();
		1317
1375	{	1318	{
1376	art = get_empty_artifact ();	1319	if (!strcmp (f.get_str (), "all"))
1377	nrofartifacts++;	1320	break;
		1321
		1322	char *next, *cp = f.get_str ();
		1323
		1324	do
		1325	{
		1326	if ((next = strchr (cp, ',')))
		1327	*next++ = '\0';
		1328
		1329	linked_char *tmp = new linked_char;
		1330
		1331	tmp->name = cp;
		1332	tmp->next = art->allowed;
		1333	art->allowed = tmp;
		1334	}
		1335	while ((cp = next));
1378	}	1336	}
1379	cp = strchr (cp, ' ') + 1;	1337	break;
1380	if (!strcmp (cp, "all"))	1338
		1339	case KW_chance:
		1340	f.get (art->chance);
		1341	break;
		1342
		1343	case KW_difficulty:
		1344	f.get (art->difficulty);
		1345	break;
		1346
		1347	case KW_object:
		1348	{
		1349	art->item = object::create ();
		1350	f.get (art->item->name);
		1351	f.next ();
		1352
		1353	if (!art->item->parse_kv (f))
		1354	LOG (llevError, "Init_Artifacts: Could not load object.\n");
		1355
		1356	al = find_artifactlist (art->item->type);
		1357
		1358	if (!al)
		1359	{
		1360	al = get_empty_artifactlist ();
		1361	al->type = art->item->type;
		1362	al->next = first_artifactlist;
		1363	first_artifactlist = al;
		1364	}
		1365
		1366	art->next = al->items;
		1367	al->items = art;
		1368	art = 0;
		1369	}
1381	continue;	1370	continue;
1382		1371
1383	do	1372	case KW_EOF:
		1373	goto done;
		1374
		1375	default:
		1376	if (!f.parse_error ("artifacts file"))
		1377	cleanup ("artifacts file required");
1384	{	1378	break;
1385	nrofallowedstr++;
1386	if ((next = strchr (cp, ',')) != NULL)
1387	*(next++) = '\0';
1388	tmp = new linked_char;
1389
1390	tmp->name = cp;
1391	tmp->next = art->allowed;
1392	art->allowed = tmp;
1393	}
1394	while ((cp = next) != NULL);
1395	}
1396	else if (sscanf (cp, "chance %d", &value))
1397	art->chance = (uint16) value;
1398	else if (sscanf (cp, "difficulty %d", &value))
1399	art->difficulty = (uint8) value;
1400	else if (!strncmp (cp, "Object", 6))
1401	{	1379	}
1402	art->item = object::create ();
1403		1380
1404	if (!load_object (thawer, art->item, 0))	1381	f.next ();
1405	LOG (llevError, "Init_Artifacts: Could not load object.\n");
1406
1407	art->item->name = strchr (cp, ' ') + 1;
1408	al = find_artifactlist (art->item->type);
1409	if (al == NULL)
1410	{
1411	al = get_empty_artifactlist ();
1412	al->type = art->item->type;
1413	al->next = first_artifactlist;
1414	first_artifactlist = al;
1415	}
1416	art->next = al->items;
1417	al->items = art;
1418	art = NULL;
1419	}
1420	else
1421	LOG (llevError, "Unknown input in artifact file: %s\n", buf);
1422	}	1382	}
1423		1383
		1384	done:
1424	for (al = first_artifactlist; al != NULL; al = al->next)	1385	for (al = first_artifactlist; al; al = al->next)
1425	{	1386	{
		1387	al->total_chance = 0;
		1388
1426	for (art = al->items; art != NULL; art = art->next)	1389	for (art = al->items; art; art = art->next)
1427	{	1390	{
1428	if (!art->chance)	1391	if (!art->chance)
1429	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1392	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1430	else	1393	else
1431	al->total_chance += art->chance;	1394	al->total_chance += art->chance;
…		…
1436	}	1399	}
1437		1400
1438	LOG (llevDebug, "done.\n");	1401	LOG (llevDebug, "done.\n");
1439	}	1402	}
1440		1403
1441
1442	/*	1404	/*
1443	* Used in artifact generation. The bonuses of the first object	1405	* Used in artifact generation. The bonuses of the first object
1444	* is modified by the bonuses of the second object.	1406	* is modified by the bonuses of the second object.
1445	*/	1407	*/
1446
1447	void	1408	void
1448	add_abilities (object *op, object *change)	1409	add_abilities (object *op, object *change)
1449	{	1410	{
1450	int i, tmp;	1411	int i, tmp;
1451		1412
1452	if (change->face != blank_face)	1413	if (change->face != blank_face)
1453	{	1414	{
1454	#ifdef TREASURE_VERBOSE	1415	#ifdef TREASURE_VERBOSE
1455	LOG (llevDebug, "FACE: %d\n", change->face->number);	1416	LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1456	#endif	1417	#endif
1457	op->face = change->face;	1418	op->face = change->face;
1458	}	1419	}
1459		1420
1460	for (i = 0; i < NUM_STATS; i++)	1421	for (i = 0; i < NUM_STATS; i++)
1461	change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i));	1422	change_attr_value (&(op->stats), i, change->stats.stat (i));
1462		1423
1463	op->attacktype |= change->attacktype;	1424	op->attacktype |= change->attacktype;
1464	op->path_attuned |= change->path_attuned;	1425	op->path_attuned |= change->path_attuned;
1465	op->path_repelled |= change->path_repelled;	1426	op->path_repelled |= change->path_repelled;
1466	op->path_denied |= change->path_denied;	1427	op->path_denied |= change->path_denied;
…		…
1500		1461
1501	op->set_speed (op->speed);	1462	op->set_speed (op->speed);
1502	}	1463	}
1503		1464
1504	if (change->nrof)	1465	if (change->nrof)
1505	op->nrof = RANDOM () % ((int) change->nrof) + 1;	1466	op->nrof = rndm (change->nrof) + 1;
1506		1467
1507	op->stats.exp += change->stats.exp; /* Speed modifier */	1468	op->stats.exp += change->stats.exp; /* Speed modifier */
1508	op->stats.wc += change->stats.wc;	1469	op->stats.wc += change->stats.wc;
1509	op->stats.ac += change->stats.ac;	1470	op->stats.ac += change->stats.ac;
1510		1471
…		…
1613	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);	1574	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);
1614	}	1575	}
1615		1576
1616	op->value *= change->value;	1577	op->value *= change->value;
1617		1578
1618	if (change->material)	1579	if (change->materials)
1619	op->material = change->material;	1580	op->materials = change->materials;
1620		1581
1621	if (change->materialname)	1582	if (change->materialname)
1622	op->materialname = change->materialname;	1583	op->materialname = change->materialname;
1623		1584
1624	if (change->slaying)	1585	if (change->slaying)
…		…
1630	if (change->msg)	1591	if (change->msg)
1631	op->msg = change->msg;	1592	op->msg = change->msg;
1632	}	1593	}
1633		1594
1634	static int	1595	static int
1635	legal_artifact_combination (object *op, artifact * art)	1596	legal_artifact_combination (object *op, artifact *art)
1636	{	1597	{
1637	int neg, success = 0;	1598	int neg, success = 0;
1638	linked_char *tmp;	1599	linked_char *tmp;
1639	const char *name;	1600	const char *name;
1640		1601
1641	if (art->allowed == (linked_char *) NULL)	1602	if (!art->allowed)
1642	return 1; /* Ie, "all" */	1603	return 1; /* Ie, "all" */
		1604
1643	for (tmp = art->allowed; tmp; tmp = tmp->next)	1605	for (tmp = art->allowed; tmp; tmp = tmp->next)
1644	{	1606	{
1645	#ifdef TREASURE_VERBOSE	1607	#ifdef TREASURE_VERBOSE
1646	LOG (llevDebug, "legal_art: %s\n", tmp->name);	1608	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1647	#endif	1609	#endif
1648	if (*tmp->name == '!')	1610	if (*tmp->name == '!')
1649	name = tmp->name + 1, neg = 1;	1611	name = tmp->name + 1, neg = 1;
1650	else	1612	else
1651	name = tmp->name, neg = 0;	1613	name = tmp->name, neg = 0;
1652		1614
1653	/* If we match name, then return the opposite of 'neg' */	1615	/* If we match name, then return the opposite of 'neg' */
1654	if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->name)))	1616	if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname)))
1655	return !neg;	1617	return !neg;
1656		1618
1657	/* Set success as true, since if the match was an inverse, it means	1619	/* Set success as true, since if the match was an inverse, it means
1658	* everything is allowed except what we match	1620	* everything is allowed except what we match
1659	*/	1621	*/
1660	else if (neg)	1622	else if (neg)
1661	success = 1;	1623	success = 1;
1662	}	1624	}
		1625
1663	return success;	1626	return success;
1664	}	1627	}
1665		1628
1666	/*	1629	/*
1667	* Fixes the given object, giving it the abilities and titles	1630	* Fixes the given object, giving it the abilities and titles
…		…
1718	return;	1681	return;
1719	}	1682	}
1720		1683
1721	for (i = 0; i < ARTIFACT_TRIES; i++)	1684	for (i = 0; i < ARTIFACT_TRIES; i++)
1722	{	1685	{
1723	int roll = RANDOM () % al->total_chance;	1686	int roll = rndm (al->total_chance);
1724		1687
1725	for (art = al->items; art != NULL; art = art->next)	1688	for (art = al->items; art; art = art->next)
1726	{	1689	{
1727	roll -= art->chance;	1690	roll -= art->chance;
1728	if (roll < 0)	1691	if (roll < 0)
1729	break;	1692	break;
1730	}	1693	}
…		…
1746	continue;	1709	continue;
1747		1710
1748	if (!legal_artifact_combination (op, art))	1711	if (!legal_artifact_combination (op, art))
1749	{	1712	{
1750	#ifdef TREASURE_VERBOSE	1713	#ifdef TREASURE_VERBOSE
1751	LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name);	1714	LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1752	#endif	1715	#endif
1753	continue;	1716	continue;
1754	}	1717	}
		1718
1755	give_artifact_abilities (op, art->item);	1719	give_artifact_abilities (op, art->item);
1756	return;	1720	return;
1757	}	1721	}
1758	}	1722	}
1759		1723
…		…
1803	SET_FLAG (item, FLAG_NO_STEAL);	1767	SET_FLAG (item, FLAG_NO_STEAL);
1804	}	1768	}
1805	}	1769	}
1806		1770
1807	/* special_potion() - so that old potion code is still done right. */	1771	/* special_potion() - so that old potion code is still done right. */
1808
1809	int	1772	int
1810	special_potion (object *op)	1773	special_potion (object *op)
1811	{	1774	{
1812	if (op->attacktype)	1775	if (op->attacktype)
1813	return 1;	1776	return 1;
…		…
1823	}	1786	}
1824		1787
1825	void	1788	void
1826	free_treasurestruct (treasure *t)	1789	free_treasurestruct (treasure *t)
1827	{	1790	{
1828	if (t->next)
1829	free_treasurestruct (t->next);	1791	if (t->next) free_treasurestruct (t->next);
1830	if (t->next_yes)
1831	free_treasurestruct (t->next_yes);	1792	if (t->next_yes) free_treasurestruct (t->next_yes);
1832	if (t->next_no)
1833	free_treasurestruct (t->next_no);	1793	if (t->next_no) free_treasurestruct (t->next_no);
1834		1794
1835	delete t;	1795	delete t;
1836	}	1796	}
1837		1797
1838	void	1798	void
…		…
1843		1803
1844	delete lc;	1804	delete lc;
1845	}	1805	}
1846		1806
1847	void	1807	void
1848	free_artifact (artifact * at)	1808	free_artifact (artifact *at)
1849	{	1809	{
1850	if (at->next)
1851	free_artifact (at->next);	1810	if (at->next) free_artifact (at->next);
1852
1853	if (at->allowed)
1854	free_charlinks (at->allowed);	1811	if (at->allowed) free_charlinks (at->allowed);
1855		1812
1856	at->item->destroy (1);	1813	at->item->destroy (1);
1857		1814
1858	delete at;	1815	sfree (at);
1859	}	1816	}
1860		1817
1861	void	1818	void
1862	free_artifactlist (artifactlist * al)	1819	free_artifactlist (artifactlist *al)
1863	{	1820	{
1864	artifactlist *nextal;	1821	artifactlist *nextal;
1865		1822
1866	for (al = first_artifactlist; al; al = nextal)	1823	for (al = first_artifactlist; al; al = nextal)
1867	{	1824	{
1868	nextal = al->next;	1825	nextal = al->next;
1869		1826
1870	if (al->items)	1827	if (al->items)
1871	free_artifact (al->items);	1828	free_artifact (al->items);
1872		1829
1873	free (al);	1830	sfree (al);
1874	}	1831	}
1875	}	1832	}
1876		1833
1877	void	1834	void
1878	free_all_treasures (void)	1835	free_all_treasures (void)
1879	{	1836	{
1880	treasurelist *tl, *next;	1837	treasurelist *tl, *next;
1881		1838
1882
1883	for (tl = first_treasurelist; tl != NULL; tl = next)	1839	for (tl = first_treasurelist; tl; tl = next)
1884	{	1840	{
		1841	clear (tl);
		1842
1885	next = tl->next;	1843	next = tl->next;
1886	if (tl->items)
1887	free_treasurestruct (tl->items);
1888	delete tl;	1844	delete tl;
1889	}	1845	}
		1846
1890	free_artifactlist (first_artifactlist);	1847	free_artifactlist (first_artifactlist);
1891	}	1848	}

Diff Legend

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