[ViewVC] Diff of: cvs/deliantra/server/common/treasure.C

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.35 by root, Sat Jan 27 02:19:36 2007 UTC vs.
Revision 1.124 by root, Sat Dec 1 20:22:12 2018 UTC

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

Diff Legend

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

Comparing deliantra/server/common/treasure.C (file contents): Revision 1.35 by root, Sat Jan 27 02:19:36 2007 UTC vs. Revision 1.124 by root, Sat Dec 1 20:22:12 2018 UTC

Diff Legend

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.35 by root, Sat Jan 27 02:19:36 2007 UTC vs.
Revision 1.124 by root, Sat Dec 1 20:22:12 2018 UTC