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.1 by elmex, Sun Aug 13 17:16:01 2006 UTC vs.
Revision 1.122 by root, Sun Nov 18 15:19:48 2018 UTC

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

Diff Legend

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