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.19 by root, Thu Sep 14 22:34:00 2006 UTC vs.
Revision 1.125 by root, Sat Oct 8 21:54:05 2022 UTC

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

Diff Legend

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