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.12 by root, Mon Sep 4 13:55:54 2006 UTC vs.
Revision 1.73 by root, Sun Apr 20 05:24:55 2008 UTC

1
2	/*	1	/*
3	* static char *rcs_treasure_c =	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
4	* "$Id: treasure.C,v 1.12 2006/09/04 13:55:54 root Exp $";	3	*
5	*/	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
6
7	/*
8	CrossFire, A Multiplayer game for X-windows
9
10	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
11	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
12		7	*
13	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
14	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
15	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
16	(at your option) any later version.	11	* (at your option) any later version.
17		12	*
18	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,
19	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
20	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21	GNU General Public License for more details.	16	* GNU General Public License for more details.
22		17	*
23	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
24	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
25	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
26		21	* The authors can be reached via e-mail to <support@deliantra.net>
27	The authors can be reached via e-mail at crossfire-devel@real-time.com
28	*/	22	*/
29
30	#define ALLOWED_COMBINATION
31		23
32	/* TREASURE_DEBUG does some checking on the treasurelists after loading.	24	/* TREASURE_DEBUG does some checking on the treasurelists after loading.
33	* 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
34	* 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
35	* left on	27	* left on
36	*/	28	*/
37	#define TREASURE_DEBUG	29	#define TREASURE_DEBUG
38		30
39	/* TREASURE_VERBOSE enables copious output concerning artifact generation */	31	/* TREASURE_VERBOSE enables copious output concerning artifact generation */
		32
40	/* #define TREASURE_VERBOSE */	33	//#define TREASURE_VERBOSE
41		34
42	#include <global.h>	35	#include <global.h>
43	#include <treasure.h>	36	#include <treasure.h>
44	#include <funcpoint.h>	37	#include <funcpoint.h>
45	#include <loader.h>	38	#include <loader.h>
46		39
47
48	static void change_treasure (treasure * t, object * op); /* overrule default values */
49	extern char *spell_mapping[];	40	extern char *spell_mapping[];
50		41
51	/*	42	static treasurelist *first_treasurelist;
52	* Initialize global archtype pointers:
53	*/
54		43
		44	static void change_treasure (treasure *t, object *op); /* overrule default values */
		45
		46	typedef std::tr1::unordered_map<
		47	const char *,
		48	treasurelist *,
		49	str_hash,
		50	str_equal,
		51	slice_allocator< std::pair<const char *const, treasurelist *> >,
		52	true
		53	> tl_map_t;
		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
55	void	98	void
56	init_archetype_pointers ()	99	clear (treasurelist *tl)
57	{	100	{
58	int prev_warn = warn_archetypes;	101	if (tl->items)
59	warn_archetypes = 1;
60	if (ring_arch == NULL)
61	ring_arch = find_archetype ("ring");
62	if (amulet_arch == NULL)
63	amulet_arch = find_archetype ("amulet");
64	if (staff_arch == NULL)
65	staff_arch = find_archetype ("staff");
66	if (crown_arch == NULL)
67	crown_arch = find_archetype ("crown");
68	warn_archetypes = prev_warn;
69	}
70
71	/*
72	* Allocate and return the pointer to an empty treasurelist structure.
73	*/
74
75	static treasurelist *
76	get_empty_treasurelist (void)
77	{
78	return new treasurelist;
79	}
80
81	/*
82	* Allocate and return the pointer to an empty treasure structure.
83	*/
84	//TODO: make this a constructor
85	static treasure *
86	get_empty_treasure (void)
87	{
88	treasure *t = new treasure;
89
90	t->chance = 100;
91
92	return t;
93	}
94
95	/*
96	* Reads the lib/treasure file from disk, and parses the contents
97	* into an internal treasure structure (very linked lists)
98	*/
99
100	static treasure *
101	load_treasure (FILE * fp, int *line)
102	{
103	char buf[MAX_BUF], *cp, variable[MAX_BUF];
104	treasure *t = get_empty_treasure ();
105	int value;
106
107	nroftreasures++;
108	while (fgets (buf, MAX_BUF, fp) != NULL)
109	{
110	(*line)++;
111
112	if (*buf == '#')
113	continue;
114	if ((cp = strchr (buf, '\n')) != NULL)
115	*cp = '\0';
116	cp = buf;
117	while (isspace (*cp)) /* Skip blanks */
118	cp++;
119
120	if (sscanf (cp, "arch %s", variable))
121	{
122	if ((t->item = find_archetype (variable)) == NULL)
123	LOG (llevError, "Treasure lacks archetype: %s\n", variable);
124	}
125	else if (sscanf (cp, "list %s", variable))
126	t->name = variable;
127	else if (sscanf (cp, "change_name %s", variable))
128	t->change_arch.name = variable;
129	else if (sscanf (cp, "change_title %s", variable))
130	t->change_arch.title = variable;
131	else if (sscanf (cp, "change_slaying %s", variable))
132	t->change_arch.slaying = variable;
133	else if (sscanf (cp, "chance %d", &value))
134	t->chance = (uint8) value;
135	else if (sscanf (cp, "nrof %d", &value))
136	t->nrof = (uint16) value;
137	else if (sscanf (cp, "magic %d", &value))
138	t->magic = (uint8) value;
139	else if (!strcmp (cp, "yes"))
140	t->next_yes = load_treasure (fp, line);
141	else if (!strcmp (cp, "no"))
142	t->next_no = load_treasure (fp, line);
143	else if (!strcmp (cp, "end"))
144	return t;
145	else if (!strcmp (cp, "more"))
146	{
147	t->next = load_treasure (fp, line);
148	return t;
149	}
150	else
151	LOG (llevError, "Unknown treasure-command: '%s', last entry %s, line %d\n", cp, &t->name, *line);
152	}	102	{
153	LOG (llevError, "treasure lacks 'end'.\n");	103	free_treasurestruct (tl->items);
154	return t;	104	tl->items = 0;
		105	}
		106
		107	tl->total_chance = 0;
155	}	108	}
156		109
157	#ifdef TREASURE_DEBUG	110	#ifdef TREASURE_DEBUG
158	/* recursived checks the linked list. Treasurelist is passed only	111	/* recursived checks the linked list. Treasurelist is passed only
159	* so that the treasure name can be printed out	112	* so that the treasure name can be printed out
160	*/	113	*/
161	static void	114	static void
162	check_treasurelist (const treasure * t, const treasurelist * tl)	115	check_treasurelist (const treasure *t, const treasurelist * tl)
163	{	116	{
164	if (t->item == NULL && t->name == NULL)
165	LOG (llevError, "Treasurelist %s has element with no name or archetype\n", &tl->name);
166	if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))	117	if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
167	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);	118	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
168	/* find_treasurelist will print out its own error message */	119
169	if (t->name && *t->name)
170	(void) find_treasurelist (t->name);
171	if (t->next)	120	if (t->next)
172	check_treasurelist (t->next, tl);	121	check_treasurelist (t->next, tl);
		122
173	if (t->next_yes)	123	if (t->next_yes)
174	check_treasurelist (t->next_yes, tl);	124	check_treasurelist (t->next_yes, tl);
		125
175	if (t->next_no)	126	if (t->next_no)
176	check_treasurelist (t->next_no, tl);	127	check_treasurelist (t->next_no, tl);
177	}	128	}
178	#endif	129	#endif
179		130
180	/*	131	/*
181	* Opens LIBDIR/treasure and reads all treasure-declarations from it.	132	* Reads the lib/treasure file from disk, and parses the contents
		133	* into an internal treasure structure (very linked lists)
		134	*/
		135	static treasure *
		136	read_treasure (object_thawer &f)
		137	{
		138	treasure *t = new treasure;
		139
		140	f.next ();
		141
		142	for (;;)
		143	{
		144	coroapi::cede_to_tick ();
		145
		146	switch (f.kw)
		147	{
		148	case KW_arch:
		149	t->item = archetype::find (f.get_str ());
		150
		151	if (!t->item)
		152	{
		153	f.parse_warn ("treasure references unknown archetype");
		154	t->item = archetype::empty;
		155	}
		156
		157	break;
		158
		159	case KW_list: f.get (t->name); break;
		160	case KW_change_name: f.get (t->change_arch.name); break;
		161	case KW_change_title: f.get (t->change_arch.title); break;
		162	case KW_change_slaying: f.get (t->change_arch.slaying); break;
		163	case KW_chance: f.get (t->chance); break;
		164	case KW_nrof: f.get (t->nrof); break;
		165	case KW_magic: f.get (t->magic); break;
		166
		167	case KW_yes: t->next_yes = read_treasure (f); continue;
		168	case KW_no: t->next_no = read_treasure (f); continue;
		169
		170	case KW_end:
		171	f.next ();
		172	return t;
		173
		174	case KW_more:
		175	t->next = read_treasure (f);
		176	return t;
		177
		178	default:
		179	if (!f.parse_error ("treasurelist", t->name))
		180	goto error;
		181
		182	return t;
		183	}
		184
		185	f.next ();
		186	}
		187
		188	// not reached
		189
		190	error:
		191	delete t;
		192	return 0;
		193	}
		194
		195	/*
182	* Each treasure is parsed with the help of load_treasure().	196	* Each treasure is parsed with the help of load_treasure().
183	*/	197	*/
184		198	treasurelist *
185	void	199	treasurelist::read (object_thawer &f)
186	load_treasures (void)
187	{	200	{
188	FILE *fp;	201	assert (f.kw == KW_treasure || f.kw == KW_treasureone);
189	char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];
190	treasurelist *previous = NULL;
191	treasure *t;
192	int comp, line = 0;
193		202
194	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	203	bool one = f.kw == KW_treasureone;
195	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	204	treasurelist *tl = treasurelist::get (f.get_str ());
196	{	205	clear (tl);
197	LOG (llevError, "Can't open treasure file.\n");	206	tl->items = read_treasure (f);
		207	if (!tl->items)
198	return;	208	return 0;
199	}
200	while (fgets (buf, MAX_BUF, fp) != NULL)
201	{
202	line++;
203	if (*buf == '#')
204	continue;
205		209
206	if (sscanf (buf, "treasureone %s\n", name) || sscanf (buf, "treasure %s\n", name))
207	{
208	treasurelist *tl = get_empty_treasurelist ();
209	tl->name = name;
210	if (previous == NULL)
211	first_treasurelist = tl;
212	else
213	previous->next = tl;
214	previous = tl;
215	tl->items = load_treasure (fp, &line);
216
217	/* This is a one of the many items on the list should be generated.	210	/* This is a one of the many items on the list should be generated.
218	* Add up the chance total, and check to make sure the yes & no	211	* Add up the chance total, and check to make sure the yes & no
219	* fields of the treasures are not being used.	212	* fields of the treasures are not being used.
220	*/
221	if (!strncmp (buf, "treasureone", 11))
222	{
223	for (t = tl->items; t != NULL; t = t->next)
224	{
225	#ifdef TREASURE_DEBUG
226	if (t->next_yes || t->next_no)
227	{
228	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);
229	LOG (llevError, " the next_yes or next_no field is set\n");
230	}
231	#endif
232	tl->total_chance += t->chance;
233	}
234	}
235	}
236	else
237	LOG (llevError, "Treasure-list %s didn't understand: %s, line %d\n", filename, buf, line);
238	}
239	close_and_delete (fp, comp);
240
241	#ifdef TREASURE_DEBUG
242	/* Perform some checks on how valid the treasure data actually is.
243	* verify that list transitions work (ie, the list that it is supposed
244	* to transition to exists). Also, verify that at least the name
245	* or archetype is set for each treasure element.
246	*/	213	*/
247	for (previous = first_treasurelist; previous != NULL; previous = previous->next)
248	check_treasurelist (previous->items, previous);
249	#endif
250	}
251
252	/*
253	* Searches for the given treasurelist in the globally linked list
254	* of treasurelists which has been built by load_treasures().
255	*/
256
257	treasurelist *
258	find_treasurelist (const char *name)
259	{
260	/* Special cases - randomitems of NULL is to override default. If
261	* first_treasurelist is null, it means we are on the first pass of
262	* of loading archetypes, so for now, just return - second pass will
263	* init these values.
264	*/
265	if (!name)	214	if (one)
266	return 0;	215	{
		216	for (treasure *t = tl->items; t; t = t->next)
		217	{
		218	if (t->next_yes || t->next_no)
		219	{
		220	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->archname : &t->name);
		221	LOG (llevError, " the next_yes or next_no field is set\n");
		222	}
267		223
268	if (const char *tmp = shstr::find (name))	224	tl->total_chance += t->chance;
269	for (treasurelist *tl = first_treasurelist; tl != 0; tl = tl->next)	225	}
270	if (tmp == tl->name)	226	}
271	return tl;
272		227
273	if (first_treasurelist)
274	LOG (llevError, "Couldn't find treasurelist %s\n", name);
275
276	return 0;	228	return tl;
277	}	229	}
278
279		230
280	/*	231	/*
281	* Generates the objects specified by the given treasure.	232	* Generates the objects specified by the given treasure.
282	* It goes recursively through the rest of the linked list.	233	* It goes recursively through the rest of the linked list.
283	* If there is a certain percental chance for a treasure to be generated,	234	* If there is a certain percental chance for a treasure to be generated,
…		…
286	* being generated.	237	* being generated.
287	* If flag is GT_INVISIBLE, only invisible objects are generated (ie, only	238	* If flag is GT_INVISIBLE, only invisible objects are generated (ie, only
288	* abilities. This is used by summon spells, thus no summoned monsters	239	* abilities. This is used by summon spells, thus no summoned monsters
289	* start with equipment, but only their abilities).	240	* start with equipment, but only their abilities).
290	*/	241	*/
291
292
293	static void	242	static void
294	put_treasure (object * op, object * creator, int flags)	243	put_treasure (object *op, object *creator, int flags)
295	{	244	{
296	object *tmp;	245	if (flags & GT_ENVIRONMENT)
297		246	{
298	/* Bit of a hack - spells should never be put onto the map. The entire	247	/* Bit of a hack - spells should never be put onto the map. The entire
299	* treasure stuff is a problem - there is no clear idea of knowing	248	* treasure stuff is a problem - there is no clear idea of knowing
300	* this is the original object, or if this is an object that should be created	249	* this is the original object, or if this is an object that should be created
301	* by another object.	250	* by another object.
302	*/	251	*/
303	if (flags & GT_ENVIRONMENT && op->type != SPELL)	252	//TODO: flag such as objects... as such (no drop, anybody?)
304	{	253	if (op->type == SPELL)
305	op->x = creator->x;	254	{
306	op->y = creator->y;	255	op->destroy ();
		256	return;
		257	}
		258
		259	op->expand_tail ();
		260
		261	if (op->blocked (creator->map, creator->x, creator->y))
		262	op->destroy ();
		263	else
		264	{
307	SET_FLAG (op, FLAG_OBJ_ORIGINAL);	265	SET_FLAG (op, FLAG_OBJ_ORIGINAL);
308	insert_ob_in_map (op, creator->map, op, INS_NO_MERGE | INS_NO_WALK_ON);	266	op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);
		267	}
309	}	268	}
310	else	269	else
311	{	270	{
312	op = insert_ob_in_ob (op, creator);	271	op = creator->insert (op);
		272
313	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))	273	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
314	monster_check_apply (creator, op);	274	monster_check_apply (creator, op);
315	if ((flags & GT_UPDATE_INV) && (tmp = is_player_inv (creator)) != NULL)	275
		276	if (flags & GT_UPDATE_INV)
		277	if (object *tmp = creator->in_player ())
316	esrv_send_item (tmp, op);	278	esrv_send_item (tmp, op);
317	}	279	}
318	}	280	}
319		281
320	/* if there are change_xxx commands in the treasure, we include the changes	282	/* if there are change_xxx commands in the treasure, we include the changes
321	* in the generated object	283	* in the generated object
…		…
335		297
336	if (t->change_arch.slaying)	298	if (t->change_arch.slaying)
337	op->slaying = t->change_arch.slaying;	299	op->slaying = t->change_arch.slaying;
338	}	300	}
339		301
340	void	302	static void
341	create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries)	303	create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries)
342	{	304	{
343	object *tmp;
344
345	if ((int) t->chance >= 100 || (RANDOM () % 100 + 1) < (int) t->chance)	305	if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance)
346	{	306	{
347	if (t->name)	307	if (t->name)
348	{	308	{
349	if (strcmp (t->name, "NONE") && difficulty >= t->magic)	309	if (difficulty >= t->magic)
350	create_treasure (find_treasurelist (t->name), op, flag, difficulty, tries);	310	if (treasurelist *tl = treasurelist::find (t->name))
351	}	311	create_treasure (tl, op, flag, difficulty, tries);
		312	else
		313	LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
		314	}
352	else	315	else
353	{	316	{
354	if (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))	317	if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE)))
355	{	318	{
356	tmp = arch_to_object (t->item);	319	object *tmp = arch_to_object (t->item);
		320
357	if (t->nrof && tmp->nrof <= 1)	321	if (t->nrof && tmp->nrof <= 1)
358	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	322	tmp->nrof = rndm (t->nrof) + 1;
		323
359	fix_generated_item (tmp, op, difficulty, t->magic, flag);	324	fix_generated_item (tmp, op, difficulty, t->magic, flag);
360	change_treasure (t, tmp);	325	change_treasure (t, tmp);
361	put_treasure (tmp, op, flag);	326	put_treasure (tmp, op, flag);
362	}	327	}
363	}	328	}
364		329
365	if (t->next_yes != NULL)	330	if (t->next_yes)
366	create_all_treasures (t->next_yes, op, flag, difficulty, tries);	331	create_all_treasures (t->next_yes, op, flag, difficulty, tries);
367	}	332	}
368	else if (t->next_no != NULL)	333	else if (t->next_no)
369	create_all_treasures (t->next_no, op, flag, difficulty, tries);	334	create_all_treasures (t->next_no, op, flag, difficulty, tries);
370		335
371	if (t->next != NULL)	336	if (t->next)
372	create_all_treasures (t->next, op, flag, difficulty, tries);	337	create_all_treasures (t->next, op, flag, difficulty, tries);
373	}	338	}
374		339
375	void	340	static void
376	create_one_treasure (treasurelist *tl, object * op, int flag, int difficulty, int tries)	341	create_one_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
377	{	342	{
378	int value = RANDOM () % tl->total_chance;	343	int value = rndm (tl->total_chance);
379	treasure *t;	344	treasure *t;
380		345
381	if (tries++ > 100)	346	if (tries++ > 100)
382	{	347	{
383	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");	348	LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");
384	return;	349	return;
385	}	350	}
386		351
387	for (t = tl->items; t != NULL; t = t->next)	352	for (t = tl->items; t; t = t->next)
388	{	353	{
389	value -= t->chance;	354	value -= t->chance;
390		355
391	if (value < 0)	356	if (value < 0)
392	break;	357	break;
393	}	358	}
394		359
395	if (!t || value >= 0)	360	if (!t || value >= 0)
396	{
397	LOG (llevError, "create_one_treasure: got null object or not able to find treasure\n");	361	cleanup ("create_one_treasure: got null object or not able to find treasure\n", 1);
398	abort ();
399	return;
400	}
401		362
402	if (t->name)	363	if (t->name)
403	{	364	{
404	if (!strcmp (t->name, "NONE"))
405	return;
406
407	if (difficulty >= t->magic)	365	if (difficulty >= t->magic)
408	create_treasure (find_treasurelist (t->name), op, flag, difficulty, tries);	366	{
		367	treasurelist *tl = treasurelist::find (t->name);
		368	if (tl)
		369	create_treasure (tl, op, flag, difficulty, tries);
		370	}
409	else if (t->nrof)	371	else if (t->nrof)
410	create_one_treasure (tl, op, flag, difficulty, tries);	372	create_one_treasure (tl, op, flag, difficulty, tries);
411
412	return;
413	}	373	}
414
415	if ((t->item && t->item->clone.invisible != 0) || flag != GT_INVISIBLE)	374	else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE))
416	{	375	{
417	object *tmp = arch_to_object (t->item);	376	if (object *tmp = arch_to_object (t->item))
418		377	{
419	if (!tmp)
420	return;
421
422	if (t->nrof && tmp->nrof <= 1)	378	if (t->nrof && tmp->nrof <= 1)
423	tmp->nrof = RANDOM () % ((int) t->nrof) + 1;	379	tmp->nrof = rndm (t->nrof) + 1;
424		380
425	// fix_generated_item (tmp, op, difficulty, t->magic, flag);	381	fix_generated_item (tmp, op, difficulty, t->magic, flag);
426	// change_treasure (t, tmp);	382	change_treasure (t, tmp);
427	put_treasure (tmp, op, flag);	383	put_treasure (tmp, op, flag);
		384	}
428	}	385	}
		386	}
		387
		388	void
		389	object::create_treasure (treasurelist *tl, int flags)
		390	{
		391	::create_treasure (tl, this, flags, map ? map->difficulty : 0);
429	}	392	}
430		393
431	/* This calls the appropriate treasure creation function. tries is passed	394	/* This calls the appropriate treasure creation function. tries is passed
432	* to determine how many list transitions or attempts to create treasure	395	* to determine how many list transitions or attempts to create treasure
433	* have been made. It is really in place to prevent infinite loops with	396	* have been made. It is really in place to prevent infinite loops with
434	* list transitions, or so that excessively good treasure will not be	397	* list transitions, or so that excessively good treasure will not be
435	* created on weak maps, because it will exceed the number of allowed tries	398	* created on weak maps, because it will exceed the number of allowed tries
436	* to do that.	399	* to do that.
437	*/	400	*/
438	void	401	void
439	create_treasure (treasurelist * t, object * op, int flag, int difficulty, int tries)	402	create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
440	{	403	{
		404	// empty treasurelists are legal
		405	if (!tl->items)
		406	return;
441		407
442	if (tries++ > 100)	408	if (tries++ > 100)
443	{	409	{
444	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	410	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
445	return;	411	return;
446	}	412	}
		413
		414	if (op->flag [FLAG_TREASURE_ENV])
		415	{
		416	// do not generate items when there already is something above the object
		417	if (op->flag [FLAG_IS_FLOOR] && op->above)
		418	return;
		419
		420	flag |= GT_ENVIRONMENT;
		421	}
		422
447	if (t->total_chance)	423	if (tl->total_chance)
448	create_one_treasure (t, op, flag, difficulty, tries);	424	create_one_treasure (tl, op, flag, difficulty, tries);
449	else	425	else
450	create_all_treasures (t->items, op, flag, difficulty, tries);	426	create_all_treasures (tl->items, op, flag, difficulty, tries);
451	}	427	}
452		428
453	/* This is similar to the old generate treasure function. However,	429	/* This is similar to the old generate treasure function. However,
454	* it instead takes a treasurelist. It is really just a wrapper around	430	* it instead takes a treasurelist. It is really just a wrapper around
455	* create_treasure. We create a dummy object that the treasure gets	431	* create_treasure. We create a dummy object that the treasure gets
456	* inserted into, and then return that treausre	432	* inserted into, and then return that treausre
457	*/	433	*/
458	object *	434	object *
459	generate_treasure (treasurelist * t, int difficulty)	435	generate_treasure (treasurelist *tl, int difficulty)
460	{	436	{
461	object *ob = get_object (), *tmp;	437	difficulty = clamp (difficulty, 1, settings.max_level);
462		438
		439	object *ob = object::create ();
		440
463	create_treasure (t, ob, 0, difficulty, 0);	441	create_treasure (tl, ob, 0, difficulty, 0);
464		442
465	/* Don't want to free the object we are about to return */	443	/* Don't want to free the object we are about to return */
466	tmp = ob->inv;	444	object *tmp = ob->inv;
467	if (tmp != NULL)	445	if (tmp)
468	remove_ob (tmp);	446	tmp->remove ();
		447
469	if (ob->inv)	448	if (ob->inv)
470	{
471	LOG (llevError, "In generate treasure, created multiple objects.\n");	449	LOG (llevError, "In generate treasure, created multiple objects.\n");
472	}	450
473	free_object (ob);	451	ob->destroy ();
474	return tmp;	452	return tmp;
475	}	453	}
476		454
477	/*	455	/*
478	* This is a new way of calculating the chance for an item to have	456	* This is a new way of calculating the chance for an item to have
…		…
480	* The array has two arguments, the difficulty of the level, and the	458	* The array has two arguments, the difficulty of the level, and the
481	* magical bonus "wanted".	459	* magical bonus "wanted".
482	*/	460	*/
483		461
484	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	462	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
485	/*chance of magic difficulty*/	463	// chance of magic difficulty
486	/* +0 +1 +2 +3 +4 */	464	// +0 +1 +2 +3 +4
487	{95, 2, 2, 1, 0}, /*1 */	465	{95, 2, 2, 1, 0}, // 1
488	{92, 5, 2, 1, 0}, /*2 */	466	{92, 5, 2, 1, 0}, // 2
489	{85, 10, 4, 1, 0}, /*3 */	467	{85, 10, 4, 1, 0}, // 3
490	{80, 14, 4, 2, 0}, /*4 */	468	{80, 14, 4, 2, 0}, // 4
491	{75, 17, 5, 2, 1}, /*5 */	469	{75, 17, 5, 2, 1}, // 5
492	{70, 18, 8, 3, 1}, /*6 */	470	{70, 18, 8, 3, 1}, // 6
493	{65, 21, 10, 3, 1}, /*7 */	471	{65, 21, 10, 3, 1}, // 7
494	{60, 22, 12, 4, 2}, /*8 */	472	{60, 22, 12, 4, 2}, // 8
495	{55, 25, 14, 4, 2}, /*9 */	473	{55, 25, 14, 4, 2}, // 9
496	{50, 27, 16, 5, 2}, /*10 */	474	{50, 27, 16, 5, 2}, // 10
497	{45, 28, 18, 6, 3}, /*11 */	475	{45, 28, 18, 6, 3}, // 11
498	{42, 28, 20, 7, 3}, /*12 */	476	{42, 28, 20, 7, 3}, // 12
499	{40, 27, 21, 8, 4}, /*13 */	477	{40, 27, 21, 8, 4}, // 13
500	{38, 25, 22, 10, 5}, /*14 */	478	{38, 25, 22, 10, 5}, // 14
501	{36, 23, 23, 12, 6}, /*15 */	479	{36, 23, 23, 12, 6}, // 15
502	{33, 21, 24, 14, 8}, /*16 */	480	{33, 21, 24, 14, 8}, // 16
503	{31, 19, 25, 16, 9}, /*17 */	481	{31, 19, 25, 16, 9}, // 17
504	{27, 15, 30, 18, 10}, /*18 */	482	{27, 15, 30, 18, 10}, // 18
505	{20, 12, 30, 25, 13}, /*19 */	483	{20, 12, 30, 25, 13}, // 19
506	{15, 10, 28, 30, 17}, /*20 */	484	{15, 10, 28, 30, 17}, // 20
507	{13, 9, 27, 28, 23}, /*21 */	485	{13, 9, 27, 28, 23}, // 21
508	{10, 8, 25, 28, 29}, /*22 */	486	{10, 8, 25, 28, 29}, // 22
509	{8, 7, 23, 26, 36}, /*23 */	487	{ 8, 7, 23, 26, 36}, // 23
510	{6, 6, 20, 22, 46}, /*24 */	488	{ 6, 6, 20, 22, 46}, // 24
511	{4, 5, 17, 18, 56}, /*25 */	489	{ 4, 5, 17, 18, 56}, // 25
512	{2, 4, 12, 14, 68}, /*26 */	490	{ 2, 4, 12, 14, 68}, // 26
513	{0, 3, 7, 10, 80}, /*27 */	491	{ 0, 3, 7, 10, 80}, // 27
514	{0, 0, 3, 7, 90}, /*28 */	492	{ 0, 0, 3, 7, 90}, // 28
515	{0, 0, 0, 3, 97}, /*29 */	493	{ 0, 0, 0, 3, 97}, // 29
516	{0, 0, 0, 0, 100}, /*30 */	494	{ 0, 0, 0, 0, 100}, // 30
517	{0, 0, 0, 0, 100}, /*31 */	495	{ 0, 0, 0, 0, 100}, // 31
518	};	496	};
519
520		497
521	/* calculate the appropriate level for wands staves and scrolls.	498	/* calculate the appropriate level for wands staves and scrolls.
522	* This code presumes that op has had its spell object created (in op->inv)	499	* This code presumes that op has had its spell object created (in op->inv)
523	*	500	*
524	* elmex Wed Aug 9 17:44:59 CEST 2006:	501	* elmex Wed Aug 9 17:44:59 CEST 2006:
525	* Removed multiplicator, too many high-level items were generated on low-difficulty maps.	502	* Removed multiplicator, too many high-level items were generated on low-difficulty maps.
526	*/	503	*/
527
528	int	504	int
529	level_for_item (const object * op, int difficulty)	505	level_for_item (const object *op, int difficulty)
530	{	506	{
531	int mult = 0, olevel = 0;
532
533	if (!op->inv)	507	if (!op->inv)
534	{	508	{
535	LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);	509	LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);
536	return 0;	510	return 0;
537	}	511	}
538		512
539	olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2));	513	int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.));
540		514
541	if (olevel <= 0)	515	if (olevel <= 0)
542	olevel = rndm (1, MIN (op->inv->level, 1));	516	olevel = rndm (1, op->inv->level);
543		517
544	if (olevel > MAXLEVEL)	518	return min (olevel, MAXLEVEL);
545	olevel = MAXLEVEL;
546
547	return olevel;
548	}	519	}
549		520
550	/*	521	/*
551	* Based upon the specified difficulty and upon the difftomagic_list array,	522	* Based upon the specified difficulty and upon the difftomagic_list array,
552	* a random magical bonus is returned. This is used when determine	523	* a random magical bonus is returned. This is used when determine
…		…
555	* elmex Thu Aug 10 18:45:44 CEST 2006:	526	* elmex Thu Aug 10 18:45:44 CEST 2006:
556	* Scaling difficulty by max_level, as difficulty is a level and not some	527	* Scaling difficulty by max_level, as difficulty is a level and not some
557	* weird integer between 1-31.	528	* weird integer between 1-31.
558	*	529	*
559	*/	530	*/
560
561	int	531	int
562	magic_from_difficulty (int difficulty)	532	magic_from_difficulty (int difficulty)
563	{	533	{
564	int percent = 0, magic = 0;	534	int percent = 0, magic = 0;
565	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	535	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
…		…
570	scaled_diff = 0;	540	scaled_diff = 0;
571		541
572	if (scaled_diff >= DIFFLEVELS)	542	if (scaled_diff >= DIFFLEVELS)
573	scaled_diff = DIFFLEVELS - 1;	543	scaled_diff = DIFFLEVELS - 1;
574		544
575	percent = RANDOM () % 100;	545	percent = rndm (100);
576		546
577	for (magic = 0; magic < (MAXMAGIC + 1); magic++)	547	for (magic = 0; magic < (MAXMAGIC + 1); magic++)
578	{	548	{
579	percent -= difftomagic_list[scaled_diff][magic];	549	percent -= difftomagic_list[scaled_diff][magic];
580		550
581	if (percent < 0)	551	if (percent < 0)
582	break;	552	break;
583	}	553	}
584		554
585	if (magic == (MAXMAGIC + 1))	555	if (magic == (MAXMAGIC + 1))
586	{	556	{
587	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);	557	LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);
588	magic = 0;	558	magic = 0;
589	}	559	}
590		560
591	magic = (RANDOM () % 3) ? magic : -magic;	561	magic = (rndm (3)) ? magic : -magic;
592	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */	562	/* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */
593		563
594	return magic;	564	return magic;
595	}	565	}
596		566
…		…
600	* This function doesn't work properly, should add use of archetypes	570	* This function doesn't work properly, should add use of archetypes
601	* to make it truly absolute.	571	* to make it truly absolute.
602	*/	572	*/
603		573
604	void	574	void
605	set_abs_magic (object * op, int magic)	575	set_abs_magic (object *op, int magic)
606	{	576	{
607	if (!magic)	577	if (!magic)
608	return;	578	return;
609		579
610	op->magic = magic;	580	op->magic = magic;
611	if (op->arch)	581	if (op->arch)
612	{	582	{
613	if (op->type == ARMOUR)	583	if (op->type == ARMOUR)
614	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	584	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
615		585
616	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	586	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
617	magic = (-magic);	587	magic = (-magic);
618	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	588	op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
619	}	589	}
620	else	590	else
621	{	591	{
622	if (op->type == ARMOUR)	592	if (op->type == ARMOUR)
623	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	593	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
624	if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */	594	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
625	magic = (-magic);	595	magic = (-magic);
626	op->weight = (op->weight * (100 - magic * 10)) / 100;	596	op->weight = (op->weight * (100 - magic * 10)) / 100;
627	}	597	}
628	}	598	}
629		599
630	/*	600	/*
631	* Sets a random magical bonus in the given object based upon	601	* Sets a random magical bonus in the given object based upon
632	* the given difficulty, and the given max possible bonus.	602	* the given difficulty, and the given max possible bonus.
633	*/	603	*/
634		604
635	static void	605	static void
636	set_magic (int difficulty, object * op, int max_magic, int flags)	606	set_magic (int difficulty, object *op, int max_magic, int flags)
637	{	607	{
638	int i;	608	int i;
		609
639	i = magic_from_difficulty (difficulty);	610	i = magic_from_difficulty (difficulty);
640	if ((flags & GT_ONLY_GOOD) && i < 0)	611	if ((flags & GT_ONLY_GOOD) && i < 0)
641	i = -i;	612	i = -i;
642	if (i > max_magic)	613	if (i > max_magic)
643	i = max_magic;	614	i = max_magic;
…		…
652	* 1) Since rings can have multiple bonuses, if the same bonus	623	* 1) Since rings can have multiple bonuses, if the same bonus
653	* is rolled again, increase it - the bonuses now stack with	624	* is rolled again, increase it - the bonuses now stack with
654	* other bonuses previously rolled and ones the item might natively have.	625	* other bonuses previously rolled and ones the item might natively have.
655	* 2) Add code to deal with new PR method.	626	* 2) Add code to deal with new PR method.
656	*/	627	*/
657
658	void	628	void
659	set_ring_bonus (object * op, int bonus)	629	set_ring_bonus (object *op, int bonus)
660	{	630	{
661		631
662	int r = RANDOM () % (bonus > 0 ? 25 : 11);	632	int r = rndm (bonus > 0 ? 25 : 11);
663		633
664	if (op->type == AMULET)	634	if (op->type == AMULET)
665	{	635	{
666	if (!(RANDOM () % 21))	636	if (!(rndm (21)))
667	r = 20 + RANDOM () % 2;	637	r = 20 + rndm (2);
668	else	638	else
669	{	639	{
670	if (RANDOM () & 2)	640	if (rndm (2))
671	r = 10;	641	r = 10;
672	else	642	else
673	r = 11 + RANDOM () % 9;	643	r = 11 + rndm (9);
674	}	644	}
675	}	645	}
676		646
677	switch (r)	647	switch (r)
678	{	648	{
679	/* Redone by MSW 2000-11-26 to have much less code. Also,	649	/* Redone by MSW 2000-11-26 to have much less code. Also,
680	* bonuses and penalties will stack and add to existing values.	650	* bonuses and penalties will stack and add to existing values.
681	* of the item.	651	* of the item.
682	*/	652	*/
683	case 0:	653	case 0:
684	case 1:	654	case 1:
685	case 2:	655	case 2:
686	case 3:	656	case 3:
687	case 4:	657	case 4:
688	case 5:	658	case 5:
689	case 6:	659	case 6:
690	set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r)));	660	op->stats.stat (r) += bonus;
691	break;	661	break;
692		662
693	case 7:	663	case 7:
694	op->stats.dam += bonus;	664	op->stats.dam += bonus;
695	break;	665	break;
696		666
697	case 8:	667	case 8:
698	op->stats.wc += bonus;	668	op->stats.wc += bonus;
699	break;	669	break;
700		670
701	case 9:	671	case 9:
702	op->stats.food += bonus; /* hunger/sustenance */	672	op->stats.food += bonus; /* hunger/sustenance */
703	break;	673	break;
704		674
705	case 10:	675	case 10:
706	op->stats.ac += bonus;	676	op->stats.ac += bonus;
707	break;	677	break;
708		678
709	/* Item that gives protections/vulnerabilities */	679	/* Item that gives protections/vulnerabilities */
710	case 11:	680	case 11:
711	case 12:	681	case 12:
712	case 13:	682	case 13:
713	case 14:	683	case 14:
714	case 15:	684	case 15:
715	case 16:	685	case 16:
716	case 17:	686	case 17:
717	case 18:	687	case 18:
718	case 19:	688	case 19:
719	{	689	{
720	int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table;	690	int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
721		691
722	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */	692	/* Roughly generate a bonus between 100 and 35 (depending on the bonus) */
723	val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b;	693	val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
724		694
725	/* Cursed items need to have higher negative values to equal out with	695	/* Cursed items need to have higher negative values to equal out with
726	* positive values for how protections work out. Put another	696	* positive values for how protections work out. Put another
727	* little random element in since that they don't always end up with	697	* little random element in since that they don't always end up with
728	* even values.	698	* even values.
729	*/	699	*/
730	if (bonus < 0)	700	if (bonus < 0)
731	val = 2 * -val - RANDOM () % b;	701	val = 2 * -val - rndm (b);
732	if (val > 35)	702	if (val > 35)
733	val = 35; /* Upper limit */	703	val = 35; /* Upper limit */
734	b = 0;	704	b = 0;
		705
735	while (op->resist[resist_table[resist]] != 0 && b < 4)	706	while (op->resist[resist_table[resist]] != 0 && b < 4)
736	{	707	resist = rndm (num_resist_table);
737	resist = RANDOM () % num_resist_table;	708
738	}	709	if (b == 4)
739	if (b == 4)
740	return; /* Not able to find a free resistance */	710	return; /* Not able to find a free resistance */
		711
741	op->resist[resist_table[resist]] = val;	712	op->resist[resist_table[resist]] = val;
742	/* We should probably do something more clever here to adjust value	713	/* We should probably do something more clever here to adjust value
743	* based on how good a resistance we gave.	714	* based on how good a resistance we gave.
744	*/	715	*/
745	break;	716	break;
746	}	717	}
747	case 20:	718	case 20:
748	if (op->type == AMULET)	719	if (op->type == AMULET)
749	{	720	{
750	SET_FLAG (op, FLAG_REFL_SPELL);	721	SET_FLAG (op, FLAG_REFL_SPELL);
751	op->value *= 11;	722	op->value *= 11;
752	}	723	}
753	else	724	else
754	{	725	{
755	op->stats.hp = 1; /* regenerate hit points */	726	op->stats.hp = 1; /* regenerate hit points */
756	op->value *= 4;	727	op->value *= 4;
757	}	728	}
758	break;	729	break;
759		730
760	case 21:	731	case 21:
761	if (op->type == AMULET)	732	if (op->type == AMULET)
762	{	733	{
763	SET_FLAG (op, FLAG_REFL_MISSILE);	734	SET_FLAG (op, FLAG_REFL_MISSILE);
764	op->value *= 9;	735	op->value *= 9;
765	}	736	}
766	else	737	else
767	{	738	{
768	op->stats.sp = 1; /* regenerate spell points */	739	op->stats.sp = 1; /* regenerate spell points */
769	op->value *= 3;	740	op->value *= 3;
770	}	741	}
771	break;	742	break;
772		743
773	case 22:	744	case 22:
774	op->stats.exp += bonus; /* Speed! */	745	op->stats.exp += bonus; /* Speed! */
775	op->value = (op->value * 2) / 3;	746	op->value = (op->value * 2) / 3;
776	break;	747	break;
777	}	748	}
		749
778	if (bonus > 0)	750	if (bonus > 0)
779	op->value *= 2 * bonus;	751	op->value *= 2 * bonus;
780	else	752	else
781	op->value = -(op->value * 2 * bonus) / 3;	753	op->value = -(op->value * 2 * bonus) / 3;
782	}	754	}
…		…
787	* higher is the chance of returning a low number.	759	* higher is the chance of returning a low number.
788	* It is only used in fix_generated_treasure() to set bonuses on	760	* It is only used in fix_generated_treasure() to set bonuses on
789	* rings and amulets.	761	* rings and amulets.
790	* Another scheme is used to calculate the magic of weapons and armours.	762	* Another scheme is used to calculate the magic of weapons and armours.
791	*/	763	*/
792
793	int	764	int
794	get_magic (int diff)	765	get_magic (int diff)
795	{	766	{
796	int i;	767	int i;
		768
797	if (diff < 3)	769	if (diff < 3)
798	diff = 3;	770	diff = 3;
		771
799	for (i = 0; i < 4; i++)	772	for (i = 0; i < 4; i++)
800	if (RANDOM () % diff)	773	if (rndm (diff))
801	return i;	774	return i;
		775
802	return 4;	776	return 4;
803	}	777	}
804		778
805	#define DICE2 (get_magic(2)==2?2:1)	779	#define DICE2 (get_magic(2)==2?2:1)
806	#define DICESPELL (RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3)	780	#define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))
807		781
808	/*	782	/*
809	* fix_generated_item(): This is called after an item is generated, in	783	* fix_generated_item(): This is called after an item is generated, in
810	* order to set it up right. This produced magical bonuses, puts spells	784	* order to set it up right. This produced magical bonuses, puts spells
811	* into scrolls/books/wands, makes it unidentified, hides the value, etc.	785	* into scrolls/books/wands, makes it unidentified, hides the value, etc.
812	*/	786	*/
		787
813	/* 4/28/96 added creator object from which op may now inherit properties based on	788	/* 4/28/96 added creator object from which op may now inherit properties based on
814	* op->type. Right now, which stuff the creator passes on is object type	789	* op->type. Right now, which stuff the creator passes on is object type
815	* dependant. I know this is a spagetti manuever, but is there a cleaner	790	* dependant. I know this is a spagetti manuever, but is there a cleaner
816	* way to do this? b.t. */	791	* way to do this? b.t. */
		792
817	/*	793	/*
818	* ! (flags & GT_ENVIRONMENT):	794	* ! (flags & GT_ENVIRONMENT):
819	* Automatically calls fix_flesh_item().	795	* Automatically calls fix_flesh_item().
820	*	796	*
821	* flags:	797	* flags:
…		…
823	* value.	799	* value.
824	* GT_MINIMAL: Does minimal processing on the object - just enough to make it	800	* 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	801	* 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	802	* type as appropriate, for objects that need spell objects, set those, etc
827	*/	803	*/
828
829	void	804	void
830	fix_generated_item (object * op, object * creator, int difficulty, int max_magic, int flags)	805	fix_generated_item (object *op, object *creator, int difficulty, int max_magic, int flags)
831	{	806	{
832	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;	807	int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;
833		808
834	if (!creator || creator->type == op->type)	809	if (!creator || creator->type == op->type)
835	creator = op; /*safety & to prevent polymorphed objects giving attributes */	810	creator = op; /*safety & to prevent polymorphed objects giving attributes */
836		811
837	/* If we make an artifact, this information will be destroyed */	812	/* If we make an artifact, this information will be destroyed */
838	save_item_power = op->item_power;	813	save_item_power = op->item_power;
839	op->item_power = 0;	814	op->item_power = 0;
840		815
841	if (op->randomitems && op->type != SPELL)	816	if (op->randomitems && op->type != SPELL)
842	{	817	{
843	create_treasure (op->randomitems, op, flags, difficulty, 0);	818	create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0);
844	if (!op->inv)
845	LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", &op->name);
846
847	/* So the treasure doesn't get created again */	819	/* So the treasure doesn't get created again */
848	op->randomitems = NULL;	820	op->randomitems = 0;
849	}	821	}
850		822
851	if (difficulty < 1)	823	if (difficulty < 1)
852	difficulty = 1;	824	difficulty = 1;
853		825
		826	if (INVOKE_OBJECT (ADD_BONUS, op,
		827	ARG_OBJECT (creator != op ? creator : 0),
		828	ARG_INT (difficulty), ARG_INT (max_magic),
		829	ARG_INT (flags)))
		830	return;
		831
854	if (!(flags & GT_MINIMAL))	832	if (!(flags & GT_MINIMAL))
855	{	833	{
856	if (op->arch == crown_arch)	834	if (IS_ARCH (op->arch, crown))
857	{	835	{
858	set_magic (difficulty, op, max_magic, flags);	836	set_magic (difficulty, op, max_magic, flags);
859	num_enchantments = calc_item_power (op, 1);	837	num_enchantments = calc_item_power (op, 1);
860	generate_artifact (op, difficulty);	838	generate_artifact (op, difficulty);
861	}	839	}
862	else	840	else
863	{	841	{
864	if (!op->magic && max_magic)	842	if (!op->magic && max_magic)
865	set_magic (difficulty, op, max_magic, flags);	843	set_magic (difficulty, op, max_magic, flags);
866		844
867	num_enchantments = calc_item_power (op, 1);	845	num_enchantments = calc_item_power (op, 1);
868		846
869	if ((!was_magic && !(RANDOM () % CHANCE_FOR_ARTIFACT)) || op->type == HORN || difficulty >= settings.max_level) /* high difficulties always generate an artifact,	847	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
870	* used for shop_floors or treasures */	848	|| op->type == HORN
		849	|| difficulty >= settings.max_level) /* high difficulties always generate an artifact, used for shop_floors or treasures */
871	generate_artifact (op, difficulty);	850	generate_artifact (op, difficulty);
872	}	851	}
873		852
874	/* Object was made an artifact. Calculate its item_power rating.	853	/* Object was made an artifact. Calculate its item_power rating.
875	* the item_power in the object is what the artfiact adds.	854	* the item_power in the object is what the artfiact adds.
876	*/	855	*/
877	if (op->title)	856	if (op->title)
878	{	857	{
879	/* if save_item_power is set, then most likely we started with an	858	/* if save_item_power is set, then most likely we started with an
880	* artifact and have added new abilities to it - this is rare, but	859	* artifact and have added new abilities to it - this is rare, but
881	* but I have seen things like 'strange rings of fire'. So just figure	860	* but I have seen things like 'strange rings of fire'. So just figure
882	* out the power from the base power plus what this one adds. Note	861	* out the power from the base power plus what this one adds. Note
883	* that since item_power is not quite linear, this actually ends up	862	* that since item_power is not quite linear, this actually ends up
884	* being somewhat of a bonus	863	* being somewhat of a bonus
885	*/	864	*/
886	if (save_item_power)	865	if (save_item_power)
887	op->item_power = save_item_power + get_power_from_ench (op->item_power);	866	op->item_power = save_item_power + get_power_from_ench (op->item_power);
888	else	867	else
889	op->item_power = get_power_from_ench (op->item_power + num_enchantments);	868	op->item_power = get_power_from_ench (op->item_power + num_enchantments);
890	}	869	}
891	else if (save_item_power)	870	else if (save_item_power)
892	{	871	{
893	/* restore the item_power field to the object if we haven't changed it.	872	/* restore the item_power field to the object if we haven't changed it.
894	* we don't care about num_enchantments - that will basically just	873	* we don't care about num_enchantments - that will basically just
895	* have calculated some value from the base attributes of the archetype.	874	* have calculated some value from the base attributes of the archetype.
896	*/	875	*/
897	op->item_power = save_item_power;	876	op->item_power = save_item_power;
898	}	877	}
899	else	878	else
900	{	879	{
901	/* item_power was zero. This is suspicious, as it may be because it	880	/* item_power was zero. This is suspicious, as it may be because it
902	* was never previously calculated. Let's compute a value and see if	881	* was never previously calculated. Let's compute a value and see if
903	* it is non-zero. If it indeed is, then assign it as the new	882	* it is non-zero. If it indeed is, then assign it as the new
904	* item_power value.	883	* item_power value.
905	* - gros, 21th of July 2006.	884	* - gros, 21th of July 2006.
906	*/	885	*/
907	op->item_power = calc_item_power (op, 0);	886	op->item_power = calc_item_power (op, 0);
908	save_item_power = op->item_power; /* Just in case it would get used	887	save_item_power = op->item_power; /* Just in case it would get used
909	* again below */	888	* again below */
910	}	889	}
911	}	890	}
912		891
913	/* materialtype modifications. Note we allow this on artifacts. */	892	/* materialtype modifications. Note we allow this on artifacts. */
914	set_materialname (op, difficulty, NULL);	893	set_materialname (op, difficulty, NULL);
915		894
916	if (flags & GT_MINIMAL)	895	if (flags & GT_MINIMAL)
917	{	896	{
918	if (op->type == POTION)	897	if (op->type == POTION)
919	/* Handle healing and magic power potions */	898	/* Handle healing and magic power potions */
920	if (op->stats.sp && !op->randomitems)	899	if (op->stats.sp && !op->randomitems)
921	{	900	{
922	object *tmp;
923
924	tmp = get_archetype (spell_mapping[op->stats.sp]);	901	object *tmp = get_archetype (spell_mapping [op->stats.sp]);
925	insert_ob_in_ob (tmp, op);	902	insert_ob_in_ob (tmp, op);
926	op->stats.sp = 0;	903	op->stats.sp = 0;
927	}	904	}
928	}	905	}
929	else if (!op->title) /* Only modify object if not special */	906	else if (!op->title) /* Only modify object if not special */
930	switch (op->type)	907	switch (op->type)
931	{	908	{
932	case WEAPON:	909	case WEAPON:
933	case ARMOUR:	910	case ARMOUR:
934	case SHIELD:	911	case SHIELD:
935	case HELMET:	912	case HELMET:
936	case CLOAK:	913	case CLOAK:
937	if (QUERY_FLAG (op, FLAG_CURSED) && !(RANDOM () % 4))	914	if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
938	set_ring_bonus (op, -DICE2);	915	set_ring_bonus (op, -DICE2);
939	break;	916	break;
940		917
941	case BRACERS:	918	case BRACERS:
942	if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)))	919	if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
943	{	920	{
		921	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
		922	if (!QUERY_FLAG (op, FLAG_CURSED))
		923	op->value *= 3;
		924	}
		925	break;
		926
		927	case POTION:
		928	{
		929	int too_many_tries = 0, is_special = 0;
		930
		931	/* Handle healing and magic power potions */
		932	if (op->stats.sp && !op->randomitems)
		933	{
		934	object *tmp;
		935
		936	tmp = get_archetype (spell_mapping[op->stats.sp]);
		937	insert_ob_in_ob (tmp, op);
		938	op->stats.sp = 0;
		939	}
		940
		941	while (!(is_special = special_potion (op)) && !op->inv)
		942	{
		943	generate_artifact (op, difficulty);
		944	if (too_many_tries++ > 10)
		945	break;
		946	}
		947
		948	/* don't want to change value for healing/magic power potions,
		949	* since the value set on those is already correct.
		950	*/
		951	if (op->inv && op->randomitems)
		952	{
		953	/* value multiplier is same as for scrolls */
		954	op->value = (op->value * op->inv->value);
		955	op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
		956	}
		957	else
		958	{
		959	op->name = "potion";
		960	op->name_pl = "potions";
		961	}
		962
		963	if (!(flags & GT_ONLY_GOOD) && rndm (2))
		964	SET_FLAG (op, FLAG_CURSED);
		965	break;
		966	}
		967
		968	case AMULET:
		969	if (IS_ARCH (op->arch, amulet))
		970	op->value *= 5; /* Since it's not just decoration */
		971
		972	case RING:
		973	if (!op->arch) // wtf? schmorp
		974	{
		975	op->destroy ();
		976	op = 0;
		977	break;
		978	}
		979
		980	if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */
		981	break;
		982
		983	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
		984	SET_FLAG (op, FLAG_CURSED);
		985
944	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);	986	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
945	if (!QUERY_FLAG (op, FLAG_CURSED))
946	op->value *= 3;
947	}
948	break;
949		987
950	case POTION:
951	{
952	int too_many_tries = 0, is_special = 0;
953
954	/* Handle healing and magic power potions */
955	if (op->stats.sp && !op->randomitems)
956	{
957	object *tmp;
958
959	tmp = get_archetype (spell_mapping[op->stats.sp]);
960	insert_ob_in_ob (tmp, op);
961	op->stats.sp = 0;
962	}
963
964	while (!(is_special = special_potion (op)) && !op->inv)
965	{
966	generate_artifact (op, difficulty);
967	if (too_many_tries++ > 10)
968	break;
969	}
970
971	/* don't want to change value for healing/magic power potions,
972	* since the value set on those is already correct.
973	*/
974	if (op->inv && op->randomitems)
975	{
976	/* value multiplier is same as for scrolls */
977	op->value = (op->value * op->inv->value);
978	op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty;
979	}
980	else
981	{
982	op->name = "potion";
983	op->name_pl = "potions";
984	}
985
986	if (!(flags & GT_ONLY_GOOD) && RANDOM () % 2)
987	SET_FLAG (op, FLAG_CURSED);
988	break;
989	}
990
991	case AMULET:
992	if (op->arch == amulet_arch)
993	op->value *= 5; /* Since it's not just decoration */
994
995	case RING:
996	if (op->arch == NULL)
997	{
998	remove_ob (op);
999	free_object (op);
1000	op = NULL;
1001	break;
1002	}
1003
1004	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */
1005	break;
1006
1007	if (!(flags & GT_ONLY_GOOD) && !(RANDOM () % 3))
1008	SET_FLAG (op, FLAG_CURSED);
1009
1010	set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
1011
1012	if (op->type != RING) /* Amulets have only one ability */	988	if (op->type != RING) /* Amulets have only one ability */
1013	break;	989	break;
1014		990
1015	if (!(RANDOM () % 4))	991	if (!(rndm (4)))
1016	{	992	{
1017	int d = (RANDOM () % 2 || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	993	int d = (rndm (2) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1018		994
1019	if (d > 0)	995	if (d > 0)
1020	op->value *= 3;	996	op->value *= 3;
1021		997
1022	set_ring_bonus (op, d);	998	set_ring_bonus (op, d);
1023		999
1024	if (!(RANDOM () % 4))	1000	if (!(rndm (4)))
1025	{	1001	{
1026	int d = (RANDOM () % 3 || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;	1002	int d = (rndm (3) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1027	if (d > 0)
1028	op->value *= 5;
1029	set_ring_bonus (op, d);
1030	}
1031	}
1032		1003
		1004	if (d > 0)
		1005	op->value *= 5;
		1006	set_ring_bonus (op, d);
		1007	}
		1008	}
		1009
1033	if (GET_ANIM_ID (op))	1010	if (GET_ANIM_ID (op))
1034	SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op)));	1011	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1035		1012
1036	break;	1013	break;
1037		1014
1038	case BOOK:	1015	case BOOK:
1039	/* Is it an empty book?, if yes lets make a special·	1016	/* Is it an empty book?, if yes lets make a special·
1040	* msg for it, and tailor its properties based on the·	1017	* msg for it, and tailor its properties based on the·
1041	* creator and/or map level we found it on.	1018	* creator and/or map level we found it on.
1042	*/	1019	*/
1043	if (!op->msg && RANDOM () % 10)	1020	if (!op->msg && rndm (10))
1044	{	1021	{
1045	/* set the book level properly */	1022	/* set the book level properly */
1046	if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE))	1023	if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE))
1047	{	1024	{
1048	if (op->map && op->map->difficulty)	1025	if (op->map && op->map->difficulty)
1049	op->level = RANDOM () % (op->map->difficulty) + RANDOM () % 10 + 1;	1026	op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1050	else	1027	else
1051	op->level = RANDOM () % 20 + 1;	1028	op->level = rndm (20) + 1;
1052	}	1029	}
1053	else	1030	else
1054	op->level = RANDOM () % creator->level;	1031	op->level = rndm (creator->level);
1055		1032
1056	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);	1033	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);
1057	/* books w/ info are worth more! */	1034	/* books w/ info are worth more! */
1058	op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1));	1035	op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1));
1059	/* creator related stuff */	1036	/* creator related stuff */
1060		1037
1061	/* for library, chained books. Note that some monsters have no_pick	1038	/* for library, chained books. Note that some monsters have no_pick
1062	* set - we don't want to set no pick in that case.	1039	* set - we don't want to set no pick in that case.
1063	*/	1040	*/
1064	if (QUERY_FLAG (creator, FLAG_NO_PICK) && !QUERY_FLAG (creator, FLAG_MONSTER))	1041	if (QUERY_FLAG (creator, FLAG_NO_PICK) && !QUERY_FLAG (creator, FLAG_MONSTER))
1065	SET_FLAG (op, FLAG_NO_PICK);	1042	SET_FLAG (op, FLAG_NO_PICK);
1066	if (creator->slaying && !op->slaying) /* for check_inv floors */	1043	if (creator->slaying && !op->slaying) /* for check_inv floors */
1067	op->slaying = creator->slaying;	1044	op->slaying = creator->slaying;
1068		1045
1069	/* add exp so reading it gives xp (once) */	1046	/* add exp so reading it gives xp (once) */
1070	op->stats.exp = op->value > 10000 ? op->value / 5 : op->value / 10;	1047	op->stats.exp = op->value > 10000 ? op->value / 5 : op->value / 10;
1071	}	1048	}
1072	break;	1049	break;
1073		1050
1074	case SPELLBOOK:	1051	case SPELLBOOK:
1075	op->value = op->value * op->inv->value;	1052	op->value = op->value * op->inv->value;
1076	/* add exp so learning gives xp */	1053	/* add exp so learning gives xp */
1077	op->level = op->inv->level;	1054	op->level = op->inv->level;
1078	op->stats.exp = op->value;	1055	op->stats.exp = op->value;
1079	break;	1056	break;
1080		1057
1081	case WAND:	1058	case WAND:
1082	/* nrof in the treasure list is number of charges,	1059	/* nrof in the treasure list is number of charges,
1083	* not number of wands. So copy that into food (charges),	1060	* not number of wands. So copy that into food (charges),
1084	* and reset nrof.	1061	* and reset nrof.
1085	*/	1062	*/
1086	op->stats.food = op->inv->nrof;	1063	op->stats.food = op->inv->nrof;
1087	op->nrof = 1;	1064	op->nrof = 1;
1088	/* If the spell changes by level, choose a random level	1065	/* If the spell changes by level, choose a random level
1089	* for it, and adjust price. If the spell doesn't	1066	* for it, and adjust price. If the spell doesn't
1090	* change by level, just set the wand to the level of	1067	* change by level, just set the wand to the level of
1091	* the spell, and value calculation is simpler.	1068	* the spell, and value calculation is simpler.
1092	*/	1069	*/
1093	if (op->inv->duration_modifier || op->inv->dam_modifier || op->inv->range_modifier)	1070	if (op->inv->duration_modifier || op->inv->dam_modifier || op->inv->range_modifier)
1094	{	1071	{
		1072	op->level = level_for_item (op, difficulty);
		1073	op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50);
		1074	}
		1075	else
		1076	{
		1077	op->level = op->inv->level;
		1078	op->value = op->value * op->inv->value;
		1079	}
		1080	break;
		1081
		1082	case ROD:
1095	op->level = level_for_item (op, difficulty);	1083	op->level = level_for_item (op, difficulty);
		1084	/* Add 50 to both level an divisor to keep prices a little more
		1085	* reasonable. Otherwise, a high level version of a low level
		1086	* spell can be worth tons a money (eg, level 20 rod, level 2 spell =
		1087	* 10 time multiplier). This way, the value are a bit more reasonable.
		1088	*/
1096	op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50);	1089	op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50);
1097	}	1090	/* maxhp is used to denote how many 'charges' the rod holds before */
1098	else	1091	if (op->stats.maxhp)
1099	{	1092	op->stats.maxhp *= MAX (op->inv->stats.sp, op->inv->stats.grace);
1100	op->level = op->inv->level;	1093	else
1101	op->value = op->value * op->inv->value;	1094	op->stats.maxhp = 2 * MAX (op->inv->stats.sp, op->inv->stats.grace);
1102	}
1103	break;
1104		1095
		1096	op->stats.hp = op->stats.maxhp;
		1097	break;
		1098
1105	case ROD:	1099	case SCROLL:
1106	op->level = level_for_item (op, difficulty);	1100	op->level = level_for_item (op, difficulty);
1107	/* Add 50 to both level an divisor to keep prices a little more
1108	* reasonable. Otherwise, a high level version of a low level
1109	* spell can be worth tons a money (eg, level 20 rod, level 2 spell =
1110	* 10 time multiplier). This way, the value are a bit more reasonable.
1111	*/
1112	op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50);	1101	op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50);
1113	/* maxhp is used to denote how many 'charges' the rod holds before */
1114	if (op->stats.maxhp)
1115	op->stats.maxhp *= MAX (op->inv->stats.sp, op->inv->stats.grace);
1116	else
1117	op->stats.maxhp = 2 * MAX (op->inv->stats.sp, op->inv->stats.grace);
1118		1102
1119	op->stats.hp = op->stats.maxhp;
1120	break;
1121
1122	case SCROLL:
1123	op->level = level_for_item (op, difficulty);
1124	op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50);
1125
1126	/* add exp so reading them properly gives xp */	1103	/* add exp so reading them properly gives xp */
1127	op->stats.exp = op->value / 5;	1104	op->stats.exp = op->value / 5;
1128	op->nrof = op->inv->nrof;	1105	op->nrof = op->inv->nrof;
1129	break;	1106	break;
1130		1107
1131	case RUNE:	1108	case RUNE:
1132	trap_adjust (op, difficulty);	1109	trap_adjust (op, difficulty);
1133	break;	1110	break;
1134		1111
1135	case TRAP:	1112	case TRAP:
1136	trap_adjust (op, difficulty);	1113	trap_adjust (op, difficulty);
1137	break;	1114	break;
1138	} /* switch type */	1115	} /* switch type */
1139		1116
1140	if (flags & GT_STARTEQUIP)	1117	if (flags & GT_STARTEQUIP)
1141	{	1118	{
1142	if (op->nrof < 2 && op->type != CONTAINER && op->type != MONEY && !QUERY_FLAG (op, FLAG_IS_THROWN))	1119	if (op->nrof < 2 && op->type != CONTAINER && op->type != MONEY && !QUERY_FLAG (op, FLAG_IS_THROWN))
1143	SET_FLAG (op, FLAG_STARTEQUIP);	1120	SET_FLAG (op, FLAG_STARTEQUIP);
1144	else if (op->type != MONEY)	1121	else if (op->type != MONEY)
1145	op->value = 0;	1122	op->value = 0;
1146	}	1123	}
1147		1124
1148	if (!(flags & GT_ENVIRONMENT))	1125	if (!(flags & GT_ENVIRONMENT))
1149	fix_flesh_item (op, creator);	1126	fix_flesh_item (op, creator);
1150	}	1127	}
…		…
1158	*/	1135	*/
1159		1136
1160	/*	1137	/*
1161	* Allocate and return the pointer to an empty artifactlist structure.	1138	* Allocate and return the pointer to an empty artifactlist structure.
1162	*/	1139	*/
1163
1164	static artifactlist *	1140	static artifactlist *
1165	get_empty_artifactlist (void)	1141	get_empty_artifactlist (void)
1166	{	1142	{
1167	artifactlist *tl = (artifactlist *) malloc (sizeof (artifactlist));	1143	return salloc0<artifactlist> ();
1168	if (tl == NULL)
1169	fatal (OUT_OF_MEMORY);
1170	tl->next = NULL;
1171	tl->items = NULL;
1172	tl->total_chance = 0;
1173	return tl;
1174	}	1144	}
1175		1145
1176	/*	1146	/*
1177	* Allocate and return the pointer to an empty artifact structure.	1147	* Allocate and return the pointer to an empty artifact structure.
1178	*/	1148	*/
1179
1180	static artifact *	1149	static artifact *
1181	get_empty_artifact (void)	1150	get_empty_artifact (void)
1182	{	1151	{
1183	artifact *t = (artifact *) malloc (sizeof (artifact));	1152	return salloc0<artifact> ();
1184	if (t == NULL)
1185	fatal (OUT_OF_MEMORY);
1186	t->item = NULL;
1187	t->next = NULL;
1188	t->chance = 0;
1189	t->difficulty = 0;
1190	t->allowed = NULL;
1191	return t;
1192	}	1153	}
1193		1154
1194	/*	1155	/*
1195	* Searches the artifact lists and returns one that has the same type	1156	* Searches the artifact lists and returns one that has the same type
1196	* of objects on it.	1157	* of objects on it.
1197	*/	1158	*/
1198
1199	artifactlist *	1159	artifactlist *
1200	find_artifactlist (int type)	1160	find_artifactlist (int type)
1201	{	1161	{
1202	artifactlist *al;
1203
1204	for (al = first_artifactlist; al != NULL; al = al->next)	1162	for (artifactlist *al = first_artifactlist; al; al = al->next)
1205	if (al->type == type)	1163	if (al->type == type)
1206	return al;	1164	return al;
1207	return NULL;
1208	}
1209		1165
1210	/*
1211	* For debugging purposes. Dumps all tables.
1212	*/
1213
1214	void
1215	dump_artifacts (void)
1216	{
1217	artifactlist *al;
1218	artifact *art;
1219	linked_char *next;
1220
1221	fprintf (logfile, "\n");
1222	for (al = first_artifactlist; al != NULL; al = al->next)
1223	{
1224	fprintf (logfile, "Artifact has type %d, total_chance=%d\n", al->type, al->total_chance);
1225	for (art = al->items; art != NULL; art = art->next)
1226	{
1227	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1228	if (art->allowed != NULL)
1229	{
1230	fprintf (logfile, "\tAllowed combinations:");
1231	for (next = art->allowed; next != NULL; next = next->next)
1232	fprintf (logfile, "%s,", &next->name);
1233	fprintf (logfile, "\n");
1234	}
1235	}
1236	}
1237	fprintf (logfile, "\n");
1238	}
1239
1240	/*
1241	* For debugging purposes. Dumps all treasures recursively (see below).
1242	*/
1243	void
1244	dump_monster_treasure_rec (const char *name, treasure * t, int depth)
1245	{
1246	treasurelist *tl;
1247	int i;
1248
1249	if (depth > 100)
1250	return;	1166	return 0;
1251	while (t != NULL)
1252	{
1253	if (t->name != NULL)
1254	{
1255	for (i = 0; i < depth; i++)
1256	fprintf (logfile, " ");
1257	fprintf (logfile, "{ (list: %s)\n", &t->name);
1258	tl = find_treasurelist (t->name);
1259	dump_monster_treasure_rec (name, tl->items, depth + 2);
1260	for (i = 0; i < depth; i++)
1261	fprintf (logfile, " ");
1262	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1263	}
1264	else
1265	{
1266	for (i = 0; i < depth; i++)
1267	fprintf (logfile, " ");
1268	if (t->item->clone.type == FLESH)
1269	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1270	else
1271	fprintf (logfile, "%s\n", &t->item->clone.name);
1272	}
1273	if (t->next_yes != NULL)
1274	{
1275	for (i = 0; i < depth; i++)
1276	fprintf (logfile, " ");
1277	fprintf (logfile, " (if yes)\n");
1278	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1279	}
1280	if (t->next_no != NULL)
1281	{
1282	for (i = 0; i < depth; i++)
1283	fprintf (logfile, " ");
1284	fprintf (logfile, " (if no)\n");
1285	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1286	}
1287	t = t->next;
1288	}
1289	}
1290
1291	/*
1292	* For debugging purposes. Dumps all treasures for a given monster.
1293	* Created originally by Raphael Quinet for debugging the alchemy code.
1294	*/
1295
1296	void
1297	dump_monster_treasure (const char *name)
1298	{
1299	archetype *at;
1300	int found;
1301
1302	found = 0;
1303	fprintf (logfile, "\n");
1304	for (at = first_archetype; at != NULL; at = at->next)
1305	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1306	{
1307	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1308	if (at->clone.randomitems != NULL)
1309	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1310	else
1311	fprintf (logfile, "(nothing)\n");
1312	fprintf (logfile, "\n");
1313	found++;
1314	}
1315	if (found == 0)
1316	fprintf (logfile, "No objects have the name %s!\n\n", name);
1317	}	1167	}
1318		1168
1319	/*	1169	/*
1320	* Builds up the lists of artifacts from the file in the libdir.	1170	* Builds up the lists of artifacts from the file in the libdir.
1321	*/	1171	*/
1322
1323	void	1172	void
1324	init_artifacts (void)	1173	init_artifacts (void)
1325	{	1174	{
1326	static int has_been_inited = 0;	1175	static int has_been_inited = 0;
1327	char filename[MAX_BUF], buf[HUGE_BUF], *cp, *next;	1176	char filename[MAX_BUF];
1328	artifact *art = NULL;	1177	artifact *art = NULL;
1329	linked_char *tmp;
1330	int value, comp;
1331	artifactlist *al;	1178	artifactlist *al;
1332		1179
1333	if (has_been_inited)	1180	if (has_been_inited)
1334	return;	1181	return;
1335	else	1182	else
1336	has_been_inited = 1;	1183	has_been_inited = 1;
1337		1184
1338	sprintf (filename, "%s/artifacts", settings.datadir);	1185	sprintf (filename, "%s/artifacts", settings.datadir);
1339	object_thawer thawer (filename);	1186	object_thawer f (filename);
1340		1187
1341	if (!thawer)	1188	if (!f)
1342	return;	1189	return;
1343		1190
1344	while (fgets (buf, HUGE_BUF, thawer) != NULL)	1191	for (;;)
1345	{
1346	if (*buf == '#')
1347	continue;
1348	if ((cp = strchr (buf, '\n')) != NULL)
1349	*cp = '\0';
1350	cp = buf;
1351	while (*cp == ' ') /* Skip blanks */
1352	cp++;
1353	if (*cp == '\0')
1354	continue;
1355
1356	if (!strncmp (cp, "Allowed", 7))
1357	{
1358	if (art == NULL)
1359	{	1192	{
		1193	switch (f.kw)
		1194	{
		1195	case KW_allowed:
		1196	if (!art)
1360	art = get_empty_artifact ();	1197	art = get_empty_artifact ();
1361	nrofartifacts++;	1198
		1199	{
		1200	if (!strcmp (f.get_str (), "all"))
		1201	break;
		1202
		1203	char *next, *cp = f.get_str ();
		1204
		1205	do
		1206	{
		1207	if ((next = strchr (cp, ',')))
		1208	*next++ = '\0';
		1209
		1210	linked_char *tmp = new linked_char;
		1211
		1212	tmp->name = cp;
		1213	tmp->next = art->allowed;
		1214	art->allowed = tmp;
		1215	}
		1216	while ((cp = next));
		1217	}
		1218	break;
		1219
		1220	case KW_chance:
		1221	f.get (art->chance);
		1222	break;
		1223
		1224	case KW_difficulty:
		1225	f.get (art->difficulty);
		1226	break;
		1227
		1228	case KW_object:
		1229	{
		1230	art->item = object::create ();
		1231	f.get (art->item->name);
		1232	f.next ();
		1233
		1234	if (!art->item->parse_kv (f))
		1235	LOG (llevError, "Init_Artifacts: Could not load object.\n");
		1236
		1237	al = find_artifactlist (art->item->type);
		1238
		1239	if (!al)
		1240	{
		1241	al = get_empty_artifactlist ();
		1242	al->type = art->item->type;
		1243	al->next = first_artifactlist;
		1244	first_artifactlist = al;
		1245	}
		1246
		1247	art->next = al->items;
		1248	al->items = art;
		1249	art = 0;
		1250	}
		1251	continue;
		1252
		1253	case KW_EOF:
		1254	goto done;
		1255
		1256	default:
		1257	if (!f.parse_error ("artifacts file"))
		1258	cleanup ("artifacts file required");
		1259	break;
		1260	}
		1261
		1262	f.next ();
1362	}	1263	}
1363	cp = strchr (cp, ' ') + 1;
1364	if (!strcmp (cp, "all"))
1365	continue;
1366		1264
1367	do	1265	done:
1368	{
1369	nrofallowedstr++;
1370	if ((next = strchr (cp, ',')) != NULL)
1371	*(next++) = '\0';
1372	tmp = new linked_char;
1373	tmp->name = cp;
1374	tmp->next = art->allowed;
1375	art->allowed = tmp;
1376	}
1377	while ((cp = next) != NULL);
1378	}
1379	else if (sscanf (cp, "chance %d", &value))
1380	art->chance = (uint16) value;
1381	else if (sscanf (cp, "difficulty %d", &value))
1382	art->difficulty = (uint8) value;
1383	else if (!strncmp (cp, "Object", 6))
1384	{
1385	art->item = get_object ();
1386
1387	if (!load_object (thawer, art->item, 0))
1388	LOG (llevError, "Init_Artifacts: Could not load object.\n");
1389
1390	art->item->name = strchr (cp, ' ') + 1;
1391	al = find_artifactlist (art->item->type);
1392	if (al == NULL)
1393	{
1394	al = get_empty_artifactlist ();
1395	al->type = art->item->type;
1396	al->next = first_artifactlist;
1397	first_artifactlist = al;
1398	}
1399	art->next = al->items;
1400	al->items = art;
1401	art = NULL;
1402	}
1403	else
1404	LOG (llevError, "Unknown input in artifact file: %s\n", buf);
1405	}
1406
1407	for (al = first_artifactlist; al != NULL; al = al->next)	1266	for (al = first_artifactlist; al; al = al->next)
1408	{	1267	{
		1268	al->total_chance = 0;
		1269
1409	for (art = al->items; art != NULL; art = art->next)	1270	for (art = al->items; art; art = art->next)
1410	{	1271	{
1411	if (!art->chance)	1272	if (!art->chance)
1412	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1273	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1413	else	1274	else
1414	al->total_chance += art->chance;	1275	al->total_chance += art->chance;
1415	}	1276	}
1416	#if 0	1277	#if 0
1417	LOG (llevDebug, "Artifact list type %d has %d total chance\n", al->type, al->total_chance);	1278	LOG (llevDebug, "Artifact list type %d has %d total chance\n", al->type, al->total_chance);
1418	#endif	1279	#endif
1419	}	1280	}
1420		1281
1421	LOG (llevDebug, "done.\n");	1282	LOG (llevDebug, "done.\n");
1422	}	1283	}
1423		1284
1424
1425	/*	1285	/*
1426	* Used in artifact generation. The bonuses of the first object	1286	* Used in artifact generation. The bonuses of the first object
1427	* is modified by the bonuses of the second object.	1287	* is modified by the bonuses of the second object.
1428	*/	1288	*/
1429
1430	void	1289	void
1431	add_abilities (object * op, object * change)	1290	add_abilities (object *op, object *change)
1432	{	1291	{
1433	int i, j, tmp;	1292	int i, tmp;
1434		1293
1435	if (change->face != blank_face)	1294	if (change->face != blank_face)
1436	{	1295	{
1437	#ifdef TREASURE_VERBOSE	1296	#ifdef TREASURE_VERBOSE
1438	LOG (llevDebug, "FACE: %d\n", change->face->number);	1297	LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1439	#endif	1298	#endif
1440	op->face = change->face;	1299	op->face = change->face;
1441	}	1300	}
1442		1301
1443	for (i = 0; i < NUM_STATS; i++)	1302	for (i = 0; i < NUM_STATS; i++)
1444	change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i));	1303	change_attr_value (&(op->stats), i, change->stats.stat (i));
1445		1304
1446	op->attacktype |= change->attacktype;	1305	op->attacktype |= change->attacktype;
1447	op->path_attuned |= change->path_attuned;	1306	op->path_attuned |= change->path_attuned;
1448	op->path_repelled |= change->path_repelled;	1307	op->path_repelled |= change->path_repelled;
1449	op->path_denied |= change->path_denied;	1308	op->path_denied |= change->path_denied;
…		…
1477	if (QUERY_FLAG (change, FLAG_STAND_STILL))	1336	if (QUERY_FLAG (change, FLAG_STAND_STILL))
1478	{	1337	{
1479	CLEAR_FLAG (op, FLAG_ANIMATE);	1338	CLEAR_FLAG (op, FLAG_ANIMATE);
1480	/* so artifacts will join */	1339	/* so artifacts will join */
1481	if (!QUERY_FLAG (op, FLAG_ALIVE))	1340	if (!QUERY_FLAG (op, FLAG_ALIVE))
1482	op->speed = 0.0;	1341	op->speed = 0.0;
1483		1342
1484	update_ob_speed (op);	1343	op->set_speed (op->speed);
1485	}	1344	}
1486		1345
1487	if (change->nrof)	1346	if (change->nrof)
1488	op->nrof = RANDOM () % ((int) change->nrof) + 1;	1347	op->nrof = rndm (change->nrof) + 1;
1489		1348
1490	op->stats.exp += change->stats.exp; /* Speed modifier */	1349	op->stats.exp += change->stats.exp; /* Speed modifier */
1491	op->stats.wc += change->stats.wc;	1350	op->stats.wc += change->stats.wc;
1492	op->stats.ac += change->stats.ac;	1351	op->stats.ac += change->stats.ac;
1493		1352
1494	if (change->other_arch)	1353	if (change->other_arch)
1495	{	1354	{
1496	/* Basically, for horns & potions, the other_arch field is the spell	1355	/* Basically, for horns & potions, the other_arch field is the spell
1497	* to cast. So convert that to into a spell and put it into	1356	* to cast. So convert that to into a spell and put it into
1498	* this object.	1357	* this object.
1499	*/	1358	*/
1500	if (op->type == HORN || op->type == POTION)	1359	if (op->type == HORN || op->type == POTION)
1501	{	1360	{
1502	object *tmp_obj;	1361	object *tmp_obj;
		1362
1503	/* Remove any spells this object currently has in it */	1363	/* Remove any spells this object currently has in it */
1504	while (op->inv)	1364	while (op->inv)
1505	{	1365	op->inv->destroy ();
1506	tmp_obj = op->inv;
1507	remove_ob (tmp_obj);
1508	free_object (tmp_obj);
1509	}
1510		1366
1511	tmp_obj = arch_to_object (change->other_arch);	1367	tmp_obj = arch_to_object (change->other_arch);
1512	insert_ob_in_ob (tmp_obj, op);	1368	insert_ob_in_ob (tmp_obj, op);
1513	}	1369	}
1514	/* No harm setting this for potions/horns */	1370	/* No harm setting this for potions/horns */
1515	op->other_arch = change->other_arch;	1371	op->other_arch = change->other_arch;
1516	}	1372	}
1517		1373
1518	if (change->stats.hp < 0)	1374	if (change->stats.hp < 0)
…		…
1551	op->gen_sp_armour = (op->gen_sp_armour * (change->gen_sp_armour)) / 100;	1407	op->gen_sp_armour = (op->gen_sp_armour * (change->gen_sp_armour)) / 100;
1552		1408
1553	op->item_power = change->item_power;	1409	op->item_power = change->item_power;
1554		1410
1555	for (i = 0; i < NROFATTACKS; i++)	1411	for (i = 0; i < NROFATTACKS; i++)
1556	{
1557	if (change->resist[i])	1412	if (change->resist[i])
1558	{
1559	op->resist[i] += change->resist[i];	1413	op->resist[i] += change->resist[i];
1560	}
1561	}
1562		1414
1563	if (change->stats.dam)	1415	if (change->stats.dam)
1564	{	1416	{
1565	if (change->stats.dam < 0)	1417	if (change->stats.dam < 0)
1566	op->stats.dam = (-change->stats.dam);	1418	op->stats.dam = (-change->stats.dam);
1567	else if (op->stats.dam)	1419	else if (op->stats.dam)
1568	{	1420	{
1569	tmp = (signed char) (((int) op->stats.dam * (int) change->stats.dam) / 10);	1421	tmp = (signed char) (((int) op->stats.dam * (int) change->stats.dam) / 10);
1570	if (tmp == op->stats.dam)	1422	if (tmp == op->stats.dam)
1571	{	1423	{
1572	if (change->stats.dam < 10)	1424	if (change->stats.dam < 10)
1573	op->stats.dam--;	1425	op->stats.dam--;
		1426	else
		1427	op->stats.dam++;
		1428	}
1574	else	1429	else
1575	op->stats.dam++;
1576	}
1577	else
1578	op->stats.dam = tmp;	1430	op->stats.dam = tmp;
1579	}	1431	}
1580	}	1432	}
1581		1433
1582	if (change->weight)	1434	if (change->weight)
1583	{	1435	{
1584	if (change->weight < 0)	1436	if (change->weight < 0)
1585	op->weight = (-change->weight);	1437	op->weight = (-change->weight);
1586	else	1438	else
1587	op->weight = (op->weight * (change->weight)) / 100;	1439	op->weight = (op->weight * (change->weight)) / 100;
1588	}	1440	}
1589		1441
1590	if (change->last_sp)	1442	if (change->last_sp)
1591	{	1443	{
1592	if (change->last_sp < 0)	1444	if (change->last_sp < 0)
1593	op->last_sp = (-change->last_sp);	1445	op->last_sp = (-change->last_sp);
1594	else	1446	else
1595	op->last_sp = (signed char) (((int) op->last_sp * (int) change->last_sp) / (int) 100);	1447	op->last_sp = (signed char) (((int) op->last_sp * (int) change->last_sp) / (int) 100);
1596	}	1448	}
1597		1449
1598	if (change->gen_sp_armour)	1450	if (change->gen_sp_armour)
1599	{	1451	{
1600	if (change->gen_sp_armour < 0)	1452	if (change->gen_sp_armour < 0)
1601	op->gen_sp_armour = (-change->gen_sp_armour);	1453	op->gen_sp_armour = (-change->gen_sp_armour);
1602	else	1454	else
1603	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);	1455	op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);
1604	}	1456	}
1605		1457
1606	op->value *= change->value;	1458	op->value *= change->value;
1607		1459
1608	if (change->material)	1460	if (change->materials)
1609	op->material = change->material;	1461	op->materials = change->materials;
1610		1462
1611	if (change->materialname)	1463	if (change->materialname)
1612	op->materialname = change->materialname;	1464	op->materialname = change->materialname;
1613		1465
1614	if (change->slaying)	1466	if (change->slaying)
…		…
1620	if (change->msg)	1472	if (change->msg)
1621	op->msg = change->msg;	1473	op->msg = change->msg;
1622	}	1474	}
1623		1475
1624	static int	1476	static int
1625	legal_artifact_combination (object * op, artifact * art)	1477	legal_artifact_combination (object *op, artifact *art)
1626	{	1478	{
1627	int neg, success = 0;	1479	int neg, success = 0;
1628	linked_char *tmp;	1480	linked_char *tmp;
1629	const char *name;	1481	const char *name;
1630		1482
1631	if (art->allowed == (linked_char *) NULL)	1483	if (!art->allowed)
1632	return 1; /* Ie, "all" */	1484	return 1; /* Ie, "all" */
		1485
1633	for (tmp = art->allowed; tmp; tmp = tmp->next)	1486	for (tmp = art->allowed; tmp; tmp = tmp->next)
1634	{	1487	{
1635	#ifdef TREASURE_VERBOSE	1488	#ifdef TREASURE_VERBOSE
1636	LOG (llevDebug, "legal_art: %s\n", tmp->name);	1489	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1637	#endif	1490	#endif
1638	if (*tmp->name == '!')	1491	if (*tmp->name == '!')
1639	name = tmp->name + 1, neg = 1;	1492	name = tmp->name + 1, neg = 1;
1640	else	1493	else
1641	name = tmp->name, neg = 0;	1494	name = tmp->name, neg = 0;
1642		1495
1643	/* If we match name, then return the opposite of 'neg' */	1496	/* If we match name, then return the opposite of 'neg' */
1644	if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->name)))	1497	if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname)))
1645	return !neg;	1498	return !neg;
1646		1499
1647	/* Set success as true, since if the match was an inverse, it means	1500	/* Set success as true, since if the match was an inverse, it means
1648	* everything is allowed except what we match	1501	* everything is allowed except what we match
1649	*/	1502	*/
1650	else if (neg)	1503	else if (neg)
1651	success = 1;	1504	success = 1;
1652	}	1505	}
		1506
1653	return success;	1507	return success;
1654	}	1508	}
1655		1509
1656	/*	1510	/*
1657	* Fixes the given object, giving it the abilities and titles	1511	* Fixes the given object, giving it the abilities and titles
…		…
1663	{	1517	{
1664	char new_name[MAX_BUF];	1518	char new_name[MAX_BUF];
1665		1519
1666	sprintf (new_name, "of %s", &artifct->name);	1520	sprintf (new_name, "of %s", &artifct->name);
1667	op->title = new_name;	1521	op->title = new_name;
1668	add_abilities (op, artifct); /* Give out the bonuses */	1522	add_abilities (op, artifct); /* Give out the bonuses */
1669		1523
1670	#if 0 /* Bit verbose, but keep it here until next time I need it... */	1524	#if 0 /* Bit verbose, but keep it here until next time I need it... */
1671	{	1525	{
1672	char identified = QUERY_FLAG (op, FLAG_IDENTIFIED);	1526	char identified = QUERY_FLAG (op, FLAG_IDENTIFIED);
		1527
1673	SET_FLAG (op, FLAG_IDENTIFIED);	1528	SET_FLAG (op, FLAG_IDENTIFIED);
1674	LOG (llevDebug, "Generated artifact %s %s [%s]\n", op->name, op->title, describe_item (op, NULL));	1529	LOG (llevDebug, "Generated artifact %s %s [%s]\n", op->name, op->title, describe_item (op, NULL));
1675	if (!identified)	1530	if (!identified)
1676	CLEAR_FLAG (op, FLAG_IDENTIFIED);	1531	CLEAR_FLAG (op, FLAG_IDENTIFIED);
1677	}	1532	}
…		…
1689		1544
1690	/* Give 1 re-roll attempt per artifact */	1545	/* Give 1 re-roll attempt per artifact */
1691	#define ARTIFACT_TRIES 2	1546	#define ARTIFACT_TRIES 2
1692		1547
1693	void	1548	void
1694	generate_artifact (object * op, int difficulty)	1549	generate_artifact (object *op, int difficulty)
1695	{	1550	{
1696	artifactlist *al;	1551	artifactlist *al;
1697	artifact *art;	1552	artifact *art;
1698	int i;	1553	int i;
1699		1554
1700	al = find_artifactlist (op->type);	1555	al = find_artifactlist (op->type);
1701		1556
1702	if (al == NULL)	1557	if (al == NULL)
1703	{	1558	{
1704	#if 0 /* This is too verbose, usually */	1559	#if 0 /* This is too verbose, usually */
1705	LOG (llevDebug, "Couldn't change %s into artifact - no table.\n", op->name);	1560	LOG (llevDebug, "Couldn't change %s into artifact - no table.\n", op->name);
1706	#endif	1561	#endif
1707	return;	1562	return;
1708	}	1563	}
1709		1564
1710	for (i = 0; i < ARTIFACT_TRIES; i++)	1565	for (i = 0; i < ARTIFACT_TRIES; i++)
1711	{	1566	{
1712	int roll = RANDOM () % al->total_chance;	1567	int roll = rndm (al->total_chance);
1713		1568
1714	for (art = al->items; art != NULL; art = art->next)	1569	for (art = al->items; art; art = art->next)
1715	{	1570	{
1716	roll -= art->chance;	1571	roll -= art->chance;
1717	if (roll < 0)	1572	if (roll < 0)
1718	break;	1573	break;
1719	}	1574	}
1720		1575
1721	if (art == NULL || roll >= 0)	1576	if (art == NULL || roll >= 0)
1722	{	1577	{
1723	#if 1	1578	#if 1
1724	LOG (llevError, "Got null entry and non zero roll in generate_artifact, type %d\n", op->type);	1579	LOG (llevError, "Got null entry and non zero roll in generate_artifact, type %d\n", op->type);
1725	#endif	1580	#endif
1726	return;	1581	return;
1727	}	1582	}
1728	if (!strcmp (art->item->name, "NONE"))	1583	if (!strcmp (art->item->name, "NONE"))
1729	return;	1584	return;
1730	if (FABS (op->magic) < art->item->magic)	1585	if (FABS (op->magic) < art->item->magic)
1731	continue; /* Not magic enough to be this item */	1586	continue; /* Not magic enough to be this item */
1732		1587
1733	/* Map difficulty not high enough */	1588	/* Map difficulty not high enough */
1734	if (difficulty < art->difficulty)	1589	if (difficulty < art->difficulty)
1735	continue;	1590	continue;
1736		1591
1737	if (!legal_artifact_combination (op, art))	1592	if (!legal_artifact_combination (op, art))
1738	{	1593	{
1739	#ifdef TREASURE_VERBOSE	1594	#ifdef TREASURE_VERBOSE
1740	LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name);	1595	LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1741	#endif	1596	#endif
1742	continue;	1597	continue;
1743	}	1598	}
		1599
1744	give_artifact_abilities (op, art->item);	1600	give_artifact_abilities (op, art->item);
1745	return;	1601	return;
1746	}	1602	}
1747	}	1603	}
1748		1604
…		…
1750	* FOOD, except they inherit properties (name, food value, etc).	1606	* FOOD, except they inherit properties (name, food value, etc).
1751	* based on the original owner (or 'donor' if you like). -b.t.	1607	* based on the original owner (or 'donor' if you like). -b.t.
1752	*/	1608	*/
1753		1609
1754	void	1610	void
1755	fix_flesh_item (object * item, object * donor)	1611	fix_flesh_item (object *item, object *donor)
1756	{	1612	{
1757	char tmpbuf[MAX_BUF];	1613	char tmpbuf[MAX_BUF];
1758	int i;	1614	int i;
1759		1615
1760	if (item->type == FLESH && donor)	1616	if (item->type == FLESH && donor)
1761	{	1617	{
1762	/* change the name */	1618	/* change the name */
1763	sprintf (tmpbuf, "%s's %s", &donor->name, &item->name); item->name = tmpbuf;	1619	sprintf (tmpbuf, "%s's %s", &donor->name, &item->name);
		1620	item->name = tmpbuf;
1764	sprintf (tmpbuf, "%s's %s", &donor->name, &item->name_pl); item->name_pl = tmpbuf;	1621	sprintf (tmpbuf, "%s's %s", &donor->name, &item->name_pl);
		1622	item->name_pl = tmpbuf;
1765		1623
1766	/* weight is FLESH weight/100 * donor */	1624	/* weight is FLESH weight/100 * donor */
1767	if ((item->weight = (signed long) (((double) item->weight / (double) 100.0) * (double) donor->weight)) == 0)	1625	if ((item->weight = (signed long) (((double) item->weight / (double) 100.0) * (double) donor->weight)) == 0)
1768	item->weight = 1;	1626	item->weight = 1;
1769		1627
1770	/* value is multiplied by level of donor */	1628	/* value is multiplied by level of donor */
1771	item->value *= isqrt (donor->level * 2);	1629	item->value *= isqrt (donor->level * 2);
1772		1630
1773	/* food value */	1631	/* food value */
…		…
1775		1633
1776	/* flesh items inherit some abilities of donor, but not	1634	/* flesh items inherit some abilities of donor, but not
1777	* full effect.	1635	* full effect.
1778	*/	1636	*/
1779	for (i = 0; i < NROFATTACKS; i++)	1637	for (i = 0; i < NROFATTACKS; i++)
1780	item->resist[i] = donor->resist[i] / 2;	1638	item->resist[i] = donor->resist[i] / 2;
1781		1639
1782	/* item inherits donor's level (important for quezals) */	1640	/* item inherits donor's level (important for quezals) */
1783	item->level = donor->level;	1641	item->level = donor->level;
1784		1642
1785	/* if donor has some attacktypes, the flesh is poisonous */	1643	/* if donor has some attacktypes, the flesh is poisonous */
1786	if (donor->attacktype & AT_POISON)	1644	if (donor->attacktype & AT_POISON)
1787	item->type = POISON;	1645	item->type = POISON;
1788	if (donor->attacktype & AT_ACID)	1646	if (donor->attacktype & AT_ACID)
1789	item->stats.hp = -1 * item->stats.food;	1647	item->stats.hp = -1 * item->stats.food;
1790	SET_FLAG (item, FLAG_NO_STEAL);	1648	SET_FLAG (item, FLAG_NO_STEAL);
1791	}	1649	}
1792	}	1650	}
1793		1651
1794	/* special_potion() - so that old potion code is still done right. */	1652	/* special_potion() - so that old potion code is still done right. */
1795
1796	int	1653	int
1797	special_potion (object * op)	1654	special_potion (object *op)
1798	{	1655	{
1799
1800	int i;
1801
1802	if (op->attacktype)	1656	if (op->attacktype)
1803	return 1;	1657	return 1;
1804		1658
1805	if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha)	1659	if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha)
1806	return 1;	1660	return 1;
1807		1661
1808	for (i = 0; i < NROFATTACKS; i++)	1662	for (int i = 0; i < NROFATTACKS; i++)
1809	if (op->resist[i])	1663	if (op->resist[i])
1810	return 1;	1664	return 1;
1811		1665
1812	return 0;	1666	return 0;
1813	}	1667	}
1814		1668
1815	void	1669	void
1816	free_treasurestruct (treasure * t)	1670	free_treasurestruct (treasure *t)
1817	{	1671	{
1818	if (t->next)
1819	free_treasurestruct (t->next);	1672	if (t->next) free_treasurestruct (t->next);
1820	if (t->next_yes)
1821	free_treasurestruct (t->next_yes);	1673	if (t->next_yes) free_treasurestruct (t->next_yes);
1822	if (t->next_no)
1823	free_treasurestruct (t->next_no);	1674	if (t->next_no) free_treasurestruct (t->next_no);
1824		1675
1825	delete t;	1676	delete t;
1826	}	1677	}
1827		1678
1828	void	1679	void
1829	free_charlinks (linked_char * lc)	1680	free_charlinks (linked_char *lc)
1830	{	1681	{
1831	if (lc->next)	1682	if (lc->next)
1832	free_charlinks (lc->next);	1683	free_charlinks (lc->next);
1833		1684
1834	delete lc;	1685	delete lc;
1835	}	1686	}
1836		1687
1837	void	1688	void
1838	free_artifact (artifact * at)	1689	free_artifact (artifact *at)
1839	{	1690	{
1840
1841	if (at->next)
1842	free_artifact (at->next);	1691	if (at->next) free_artifact (at->next);
1843	if (at->allowed)
1844	free_charlinks (at->allowed);	1692	if (at->allowed) free_charlinks (at->allowed);
1845		1693
1846	delete at->item;	1694	at->item->destroy (1);
1847		1695
1848	delete at;	1696	sfree (at);
1849	}	1697	}
1850		1698
1851	void	1699	void
1852	free_artifactlist (artifactlist * al)	1700	free_artifactlist (artifactlist *al)
1853	{	1701	{
1854	artifactlist *nextal;	1702	artifactlist *nextal;
		1703
1855	for (al = first_artifactlist; al != NULL; al = nextal)	1704	for (al = first_artifactlist; al; al = nextal)
1856	{	1705	{
1857	nextal = al->next;	1706	nextal = al->next;
		1707
1858	if (al->items)	1708	if (al->items)
1859	{
1860	free_artifact (al->items);	1709	free_artifact (al->items);
1861	}	1710
1862	free (al);	1711	sfree (al);
1863	}	1712	}
1864	}	1713	}
1865		1714
1866	void	1715	void
1867	free_all_treasures (void)	1716	free_all_treasures (void)
1868	{	1717	{
1869	treasurelist *tl, *next;	1718	treasurelist *tl, *next;
1870		1719
1871
1872	for (tl = first_treasurelist; tl != NULL; tl = next)	1720	for (tl = first_treasurelist; tl; tl = next)
1873	{	1721	{
		1722	clear (tl);
		1723
1874	next = tl->next;	1724	next = tl->next;
1875	if (tl->items)
1876	free_treasurestruct (tl->items);
1877	delete tl;	1725	delete tl;
1878	}	1726	}
		1727
1879	free_artifactlist (first_artifactlist);	1728	free_artifactlist (first_artifactlist);
1880	}	1729	}

Diff Legend

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