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

Diff Legend

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