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

Diff Legend

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