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

Diff Legend

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