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

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.44 by root, Mon Apr 16 15:36:22 2007 UTC vs.
Revision 1.86 by root, Mon Oct 12 14:00:57 2009 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation; either version 2 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* 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,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* and the GNU General Public License along with this program. If not, see
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	23	*/
24		24
25	/* TREASURE_DEBUG does some checking on the treasurelists after loading.	25	/* TREASURE_DEBUG does some checking on the treasurelists after loading.
26	* It is useful for finding bugs in the treasures file. Since it only	26	* It is useful for finding bugs in the treasures file. Since it only
27	* slows the startup some (and not actual game play), it is by default	27	* slows the startup some (and not actual game play), it is by default
33		33
34	//#define TREASURE_VERBOSE	34	//#define TREASURE_VERBOSE
35		35
36	#include <global.h>	36	#include <global.h>
37	#include <treasure.h>	37	#include <treasure.h>
38	#include <funcpoint.h>
39	#include <loader.h>	38	#include <loader.h>
40		39
41	extern char *spell_mapping[];	40	extern char *spell_mapping[];
42		41
43	static treasurelist *first_treasurelist;	42	static treasurelist *first_treasurelist;
…		…
47	typedef std::tr1::unordered_map<	46	typedef std::tr1::unordered_map<
48	const char *,	47	const char *,
49	treasurelist *,	48	treasurelist *,
50	str_hash,	49	str_hash,
51	str_equal,	50	str_equal,
52	slice_allocator< std::pair<const char const, treasurelist > >,	51	slice_allocator< std::pair<const char const, treasurelist > >
53	true
54	> tl_map_t;	52	> tl_map_t;
55		53
56	static tl_map_t tl_map;	54	static tl_map_t tl_map;
57
58	/*
59	* Initialize global archtype pointers:
60	*/
61	void
62	init_archetype_pointers ()
63	{
64	int prev_warn = warn_archetypes;
65
66	warn_archetypes = 1;
67
68	if (ring_arch == NULL)
69	ring_arch = archetype::find ("ring");
70	if (amulet_arch == NULL)
71	amulet_arch = archetype::find ("amulet");
72	if (staff_arch == NULL)
73	staff_arch = archetype::find ("staff");
74	if (crown_arch == NULL)
75	crown_arch = archetype::find ("crown");
76
77	warn_archetypes = prev_warn;
78	}
79		55
80	/*	56	/*
81	* Searches for the given treasurelist	57	* Searches for the given treasurelist
82	*/	58	*/
83	treasurelist *	59	treasurelist *
84	treasurelist::find (const char *name)	60	treasurelist::find (const char *name)
85	{	61	{
86	if (!name)	62	if (!name)
87	return 0;	63	return 0;
88		64
89	AUTODECL (i, tl_map.find (name));	65	auto (i, tl_map.find (name));
90		66
91	if (i == tl_map.end ())	67	if (i == tl_map.end ())
92	return 0;	68	return 0;
93		69
94	return i->second;	70	return i->second;
…		…
128	}	104	}
129		105
130	tl->total_chance = 0;	106	tl->total_chance = 0;
131	}	107	}
132		108
		109	#ifdef TREASURE_DEBUG
		110	/* recursived checks the linked list. Treasurelist is passed only
		111	* so that the treasure name can be printed out
		112	*/
		113	static void
		114	check_treasurelist (const treasure t, const treasurelist tl)
		115	{
		116	if (t->chance >= 100 && t->next_yes && (t->next \|\| t->next_no))
		117	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
		118
		119	if (t->next)
		120	check_treasurelist (t->next, tl);
		121
		122	if (t->next_yes)
		123	check_treasurelist (t->next_yes, tl);
		124
		125	if (t->next_no)
		126	check_treasurelist (t->next_no, tl);
		127	}
		128	#endif
		129
133	/*	130	/*
134	* Reads the lib/treasure file from disk, and parses the contents	131	* Reads the lib/treasure file from disk, and parses the contents
135	* into an internal treasure structure (very linked lists)	132	* into an internal treasure structure (very linked lists)
136	*/	133	*/
137	static treasure *	134	static treasure *
138	load_treasure (object_thawer &f)	135	read_treasure (object_thawer &f)
139	{	136	{
140	treasure *t = new treasure;	137	treasure *t = new treasure;
141	int value;
142		138
143	nroftreasures++;	139	f.next ();
144		140
145	for (;;)	141	for (;;)
146	{	142	{
147	coroapi::cede_every (10);	143	coroapi::cede_to_tick ();
148
149	f.next ();
150		144
151	switch (f.kw)	145	switch (f.kw)
152	{	146	{
153	case KW_arch:	147	case KW_arch:
154	if (!(t->item = archetype::find (f.get_str ())))	148	t->item = archetype::find (f.get_str ());
155	LOG (llevError, "%s:%d treasure references unknown archetype '%s', skipping.\n", f.name, f.linenum, 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;	156	break;
157		157
158	case KW_list: f.get (t->name); break;	158	case KW_list: f.get (t->name); break;
159	case KW_change_name: f.get (t->change_arch.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;	160	case KW_change_title: f.get (t->change_arch.title); break;
161	case KW_change_slaying: f.get (t->change_arch.slaying); break;	161	case KW_change_slaying: f.get (t->change_arch.slaying); break;
162	case KW_chance: f.get (t->chance); break;	162	case KW_chance: f.get (t->chance); break;
163	case KW_nrof: f.get (t->nrof); break;	163	case KW_nrof: f.get (t->nrof); break;
164	case KW_magic: f.get (t->magic); break;	164	case KW_magic: f.get (t->magic); break;
165		165
166	case KW_yes: t->next_yes = load_treasure (f); break;	166	case KW_yes: t->next_yes = read_treasure (f); continue;
167	case KW_no: t->next_no = load_treasure (f); break;	167	case KW_no: t->next_no = read_treasure (f); continue;
168		168
169	case KW_end:	169	case KW_end:
		170	f.next ();
170	return t;	171	return t;
171		172
172	case KW_more:	173	case KW_more:
173	t->next = load_treasure (f);	174	t->next = read_treasure (f);
174	return t;	175	return t;
175		176
176	default:	177	default:
177	if (!f.parse_error ("treasure list"))	178	if (!f.parse_error ("treasurelist", t->name))
178	return t; // error	179	goto error;
179		180
180	return t;	181	return t;
181	}	182	}
182	}
183	}
184		183
185	#ifdef TREASURE_DEBUG	184	f.next ();
186	/* recursived checks the linked list. Treasurelist is passed only	185	}
187	* so that the treasure name can be printed out
188	*/
189	static void
190	check_treasurelist (const treasure t, const treasurelist tl)
191	{
192	if (t->chance >= 100 && t->next_yes && (t->next \|\| t->next_no))
193	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
194		186
195	if (t->next)	187	// not reached
196	check_treasurelist (t->next, tl);
197		188
198	if (t->next_yes)	189	error:
199	check_treasurelist (t->next_yes, tl);	190	delete t;
200		191	return 0;
201	if (t->next_no)
202	check_treasurelist (t->next_no, tl);
203	}	192	}
204	#endif
205		193
206	/*	194	/*
207	* Opens LIBDIR/treasure and reads all treasure-declarations from it.
208	* Each treasure is parsed with the help of load_treasure().	195	* Each treasure is parsed with the help of load_treasure().
209	*/	196	*/
210	bool	197	treasurelist *
211	load_treasure_file (const char *filename)	198	treasurelist::read (object_thawer &f)
212	{	199	{
213	treasure *t;	200	assert (f.kw == KW_treasure \|\| f.kw == KW_treasureone);
214	int comp, line = 0;
215		201
216	object_thawer f (filename);	202	bool one = f.kw == KW_treasureone;
217		203	treasurelist *tl = treasurelist::get (f.get_str ());
218	if (!f)	204	clear (tl);
219	{	205	tl->items = read_treasure (f);
220	LOG (llevError, "Can't open treasure file.\n");	206	if (!tl->items)
221	return false;	207	return 0;
		208
		209	/* This is a one of the many items on the list should be generated.
		210	* Add up the chance total, and check to make sure the yes & no
		211	* fields of the treasures are not being used.
		212	*/
		213	if (one)
222	}	214	{
223		215	for (treasure *t = tl->items; t; t = t->next)
224	f.next ();
225
226	for (;;)
227	{
228	switch (f.kw)
229	{	216	{
230	case KW_treasure:	217	if (t->next_yes \|\| t->next_no)
231	case KW_treasureone:
232	{	218	{
233	bool one = f.kw == KW_treasureone;
234	treasurelist *tl = treasurelist::get (f.get_str ());
235
236	clear (tl);
237	tl->items = load_treasure (f);
238
239	if (!tl->items)
240	return false;
241
242	/* This is a one of the many items on the list should be generated.
243	* Add up the chance total, and check to make sure the yes & no
244	* fields of the treasures are not being used.
245	*/
246	if (one)
247	{
248	for (t = tl->items; t; t = t->next)
249	{
250	#ifdef TREASURE_DEBUG
251	if (t->next_yes \|\| t->next_no)
252	{
253	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &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);
254	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");
255	}
256	#endif
257	tl->total_chance += t->chance;
258	}
259	}
260	}	221	}
261	break;
262		222
263	case KW_EOF:	223	tl->total_chance += t->chance;
264	#ifdef TREASURE_DEBUG
265	/* Perform some checks on how valid the treasure data actually is.
266	* verify that list transitions work (ie, the list that it is supposed
267	* to transition to exists). Also, verify that at least the name
268	* or archetype is set for each treasure element.
269	*/
270	for (treasurelist *tl = first_treasurelist; tl; tl = tl->next)
271	check_treasurelist (tl->items, tl);
272	#endif
273	return true;
274
275	default:
276	if (!f.parse_error ("treasure lists"))
277	return false;
278
279	break;
280	}	224	}
281
282	f.next ();
283	}	225	}
		226
		227	return tl;
284	}	228	}
285		229
286	/*	230	/*
287	* Generates the objects specified by the given treasure.	231	* Generates the objects specified by the given treasure.
288	* It goes recursively through the rest of the linked list.	232	* It goes recursively through the rest of the linked list.
…		…
295	* start with equipment, but only their abilities).	239	* start with equipment, but only their abilities).
296	*/	240	*/
297	static void	241	static void
298	put_treasure (object op, object creator, int flags)	242	put_treasure (object op, object creator, int flags)
299	{	243	{
300	object *tmp;	244	if (flags & GT_ENVIRONMENT)
301		245	{
302	/* 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
303	* 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
304	* 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
305	* by another object.	249	* by another object.
306	*/	250	*/
307	if (flags & GT_ENVIRONMENT && op->type != SPELL)	251	//TODO: flag such as objects... as such (no drop, anybody?)
308	{	252	if (op->type == SPELL)
		253	{
		254	op->destroy ();
		255	return;
		256	}
		257
		258	op->expand_tail ();
		259
		260	if (!creator->is_on_map () \|\| op->blocked (creator->map, creator->x, creator->y))
		261	op->destroy ();
		262	else
		263	{
309	SET_FLAG (op, FLAG_OBJ_ORIGINAL);	264	SET_FLAG (op, FLAG_OBJ_ORIGINAL);
310	op->insert_at (creator, creator, INS_NO_MERGE \| INS_NO_WALK_ON);	265	op->insert_at (creator, creator, INS_NO_MERGE \| INS_NO_WALK_ON);
		266	}
311	}	267	}
312	else	268	else
313	{	269	{
314	op = creator->insert (op);	270	op = creator->insert (op);
315		271
316	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))	272	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
317	monster_check_apply (creator, op);	273	monster_check_apply (creator, op);
318
319	if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ()))
320	esrv_send_item (tmp, op);
321	}	274	}
322	}	275	}
323		276
324	/* if there are change_xxx commands in the treasure, we include the changes	277	/* if there are change_xxx commands in the treasure, we include the changes
325	* in the generated object	278	* in the generated object
…		…
347	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)	300	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)
348	{	301	{
349	if (t->name)	302	if (t->name)
350	{	303	{
351	if (difficulty >= t->magic)	304	if (difficulty >= t->magic)
		305	if (treasurelist *tl = treasurelist::find (t->name))
352	create_treasure (treasurelist::find (t->name), op, flag, difficulty, tries);	306	create_treasure (tl, op, flag, difficulty, tries);
		307	else
		308	LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
353	}	309	}
354	else	310	else
355	{	311	{
356	if (t->item && (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE)))	312	if (t->item && (t->item->invisible != 0 \|\| !(flag & GT_INVISIBLE)))
357	{	313	{
358	object *tmp = arch_to_object (t->item);	314	object *tmp = arch_to_object (t->item);
359		315
360	if (t->nrof && tmp->nrof <= 1)	316	if (t->nrof && tmp->nrof <= 1)
361	tmp->nrof = rndm (t->nrof) + 1;	317	tmp->nrof = rndm (t->nrof) + 1;
…		…
408	create_treasure (tl, op, flag, difficulty, tries);	364	create_treasure (tl, op, flag, difficulty, tries);
409	}	365	}
410	else if (t->nrof)	366	else if (t->nrof)
411	create_one_treasure (tl, op, flag, difficulty, tries);	367	create_one_treasure (tl, op, flag, difficulty, tries);
412	}	368	}
413	else if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))	369	else if (t->item && (t->item->invisible != 0 \|\| flag != GT_INVISIBLE))
414	{	370	{
415	if (object *tmp = arch_to_object (t->item))	371	if (object *tmp = arch_to_object (t->item))
416	{	372	{
417	if (t->nrof && tmp->nrof <= 1)	373	if (t->nrof && tmp->nrof <= 1)
418	tmp->nrof = rndm (t->nrof) + 1;	374	tmp->nrof = rndm (t->nrof) + 1;
…		…
420	fix_generated_item (tmp, op, difficulty, t->magic, flag);	376	fix_generated_item (tmp, op, difficulty, t->magic, flag);
421	change_treasure (t, tmp);	377	change_treasure (t, tmp);
422	put_treasure (tmp, op, flag);	378	put_treasure (tmp, op, flag);
423	}	379	}
424	}	380	}
		381	}
		382
		383	void
		384	object::create_treasure (treasurelist *tl, int flags)
		385	{
		386	::create_treasure (tl, this, flags, map ? map->difficulty : 0);
425	}	387	}
426		388
427	/* This calls the appropriate treasure creation function. tries is passed	389	/* This calls the appropriate treasure creation function. tries is passed
428	* to determine how many list transitions or attempts to create treasure	390	* to determine how many list transitions or attempts to create treasure
429	* have been made. It is really in place to prevent infinite loops with	391	* have been made. It is really in place to prevent infinite loops with
…		…
442	{	404	{
443	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	405	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
444	return;	406	return;
445	}	407	}
446		408
		409	if (op->flag [FLAG_TREASURE_ENV])
		410	{
		411	// do not generate items when there already is something above the object
		412	if (op->flag [FLAG_IS_FLOOR] && op->above)
		413	return;
		414
		415	flag \|= GT_ENVIRONMENT;
		416	}
		417
447	if (tl->total_chance)	418	if (tl->total_chance)
448	create_one_treasure (tl, op, flag, difficulty, tries);	419	create_one_treasure (tl, op, flag, difficulty, tries);
449	else	420	else
450	create_all_treasures (tl->items, op, flag, difficulty, tries);	421	create_all_treasures (tl->items, op, flag, difficulty, tries);
451	}	422	}
…		…
458	object *	429	object *
459	generate_treasure (treasurelist *tl, int difficulty)	430	generate_treasure (treasurelist *tl, int difficulty)
460	{	431	{
461	difficulty = clamp (difficulty, 1, settings.max_level);	432	difficulty = clamp (difficulty, 1, settings.max_level);
462		433
463	object ob = object::create (), tmp;	434	object *ob = object::create ();
464		435
465	create_treasure (tl, ob, 0, difficulty, 0);	436	create_treasure (tl, ob, 0, difficulty, 0);
466		437
467	/* Don't want to free the object we are about to return */	438	/* Don't want to free the object we are about to return */
468	tmp = ob->inv;	439	object *tmp = ob->inv;
469	if (tmp != NULL)	440	if (tmp)
470	tmp->remove ();	441	tmp->remove ();
471		442
472	if (ob->inv)	443	if (ob->inv)
473	LOG (llevError, "In generate treasure, created multiple objects.\n");	444	LOG (llevError, "In generate treasure, created multiple objects.\n");
474		445
475	ob->destroy ();	446	ob->destroy ();
		447
476	return tmp;	448	return tmp;
477	}	449	}
478		450
479	/*	451	/*
480	* This is a new way of calculating the chance for an item to have	452	* This is a new way of calculating the chance for an item to have
…		…
482	* The array has two arguments, the difficulty of the level, and the	454	* The array has two arguments, the difficulty of the level, and the
483	* magical bonus "wanted".	455	* magical bonus "wanted".
484	*/	456	*/
485		457
486	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	458	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
487
488	// chance of magic difficulty	459	// chance of magic difficulty
489	// +0 +1 +2 +3 +4	460	// +0 +1 +2 +3 +4
490	{95, 2, 2, 1, 0}, // 1	461	{95, 2, 2, 1, 0}, // 1
491	{92, 5, 2, 1, 0}, // 2	462	{92, 5, 2, 1, 0}, // 2
492	{85, 10, 4, 1, 0}, // 3	463	{85, 10, 4, 1, 0}, // 3
…		…
518	{ 0, 0, 0, 3, 97}, // 29	489	{ 0, 0, 0, 3, 97}, // 29
519	{ 0, 0, 0, 0, 100}, // 30	490	{ 0, 0, 0, 0, 100}, // 30
520	{ 0, 0, 0, 0, 100}, // 31	491	{ 0, 0, 0, 0, 100}, // 31
521	};	492	};
522		493
523
524	/* calculate the appropriate level for wands staves and scrolls.	494	/* calculate the appropriate level for wands staves and scrolls.
525	* This code presumes that op has had its spell object created (in op->inv)	495	* This code presumes that op has had its spell object created (in op->inv)
526	*	496	*
527	* elmex Wed Aug 9 17:44:59 CEST 2006:	497	* elmex Wed Aug 9 17:44:59 CEST 2006:
528	* Removed multiplicator, too many high-level items were generated on low-difficulty maps.	498	* Removed multiplicator, too many high-level items were generated on low-difficulty maps.
529	*/	499	*/
530
531	int	500	int
532	level_for_item (const object *op, int difficulty)	501	level_for_item (const object *op, int difficulty)
533	{	502	{
534	int olevel = 0;
535
536	if (!op->inv)	503	if (!op->inv)
537	{	504	{
538	LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);	505	LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);
539	return 0;	506	return 0;
540	}	507	}
541		508
542	olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2));	509	int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.));
543		510
544	if (olevel <= 0)	511	if (olevel <= 0)
545	olevel = rndm (1, MIN (op->inv->level, 1));	512	olevel = rndm (1, op->inv->level);
546		513
547	if (olevel > MAXLEVEL)	514	return min (olevel, MAXLEVEL);
548	olevel = MAXLEVEL;
549
550	return olevel;
551	}	515	}
552		516
553	/*	517	/*
554	* Based upon the specified difficulty and upon the difftomagic_list array,	518	* Based upon the specified difficulty and upon the difftomagic_list array,
555	* a random magical bonus is returned. This is used when determine	519	* a random magical bonus is returned. This is used when determine
…		…
611		575
612	op->magic = magic;	576	op->magic = magic;
613	if (op->arch)	577	if (op->arch)
614	{	578	{
615	if (op->type == ARMOUR)	579	if (op->type == ARMOUR)
616	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	580	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
617		581
618	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */	582	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
619	magic = (-magic);	583	magic = (-magic);
		584
620	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	585	op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
621	}	586	}
622	else	587	else
623	{	588	{
624	if (op->type == ARMOUR)	589	if (op->type == ARMOUR)
625	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	590	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
		591
626	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */	592	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
627	magic = (-magic);	593	magic = (-magic);
		594
628	op->weight = (op->weight * (100 - magic * 10)) / 100;	595	op->weight = (op->weight * (100 - magic * 10)) / 100;
629	}	596	}
630	}	597	}
631		598
632	/*	599	/*
…		…
687	case 2:	654	case 2:
688	case 3:	655	case 3:
689	case 4:	656	case 4:
690	case 5:	657	case 5:
691	case 6:	658	case 6:
692	set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r)));	659	op->stats.stat (r) += bonus;
693	break;	660	break;
694		661
695	case 7:	662	case 7:
696	op->stats.dam += bonus;	663	op->stats.dam += bonus;
697	break;	664	break;
…		…
845	save_item_power = op->item_power;	812	save_item_power = op->item_power;
846	op->item_power = 0;	813	op->item_power = 0;
847		814
848	if (op->randomitems && op->type != SPELL)	815	if (op->randomitems && op->type != SPELL)
849	{	816	{
850	create_treasure (op->randomitems, op, flags, difficulty, 0);	817	create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0);
851	if (!op->inv)
852	LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", op->debug_desc ());
853
854	/* So the treasure doesn't get created again */	818	/* So the treasure doesn't get created again */
855	op->randomitems = 0;	819	op->randomitems = 0;
856	}	820	}
857		821
858	if (difficulty < 1)	822	if (difficulty < 1)
…		…
864	ARG_INT (flags)))	828	ARG_INT (flags)))
865	return;	829	return;
866		830
867	if (!(flags & GT_MINIMAL))	831	if (!(flags & GT_MINIMAL))
868	{	832	{
869	if (op->arch == crown_arch)	833	if (IS_ARCH (op->arch, crown))
870	{	834	{
871	set_magic (difficulty, op, max_magic, flags);	835	set_magic (difficulty, op, max_magic, flags);
872	num_enchantments = calc_item_power (op, 1);	836	num_enchantments = calc_item_power (op, 1);
873	generate_artifact (op, difficulty);	837	generate_artifact (op, difficulty);
874	}	838	}
…		…
879		843
880	num_enchantments = calc_item_power (op, 1);	844	num_enchantments = calc_item_power (op, 1);
881		845
882	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))	846	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
883	\|\| op->type == HORN	847	\|\| op->type == HORN
884	\|\| 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 */
885	* used for shop_floors or treasures */
886	generate_artifact (op, difficulty);	849	generate_artifact (op, difficulty);
887	}	850	}
888		851
889	/* Object was made an artifact. Calculate its item_power rating.	852	/* Object was made an artifact. Calculate its item_power rating.
890	* the item_power in the object is what the artfiact adds.	853	* the item_power in the object is what the artfiact adds.
…		…
932	{	895	{
933	if (op->type == POTION)	896	if (op->type == POTION)
934	/* Handle healing and magic power potions */	897	/* Handle healing and magic power potions */
935	if (op->stats.sp && !op->randomitems)	898	if (op->stats.sp && !op->randomitems)
936	{	899	{
937	object *tmp;
938
939	tmp = get_archetype (spell_mapping[op->stats.sp]);	900	object *tmp = get_archetype (spell_mapping [op->stats.sp]);
940	insert_ob_in_ob (tmp, op);	901	insert_ob_in_ob (tmp, op);
941	op->stats.sp = 0;	902	op->stats.sp = 0;
942	}	903	}
943	}	904	}
944	else if (!op->title) /* Only modify object if not special */	905	else if (!op->title) /* Only modify object if not special */
…		…
1002	SET_FLAG (op, FLAG_CURSED);	963	SET_FLAG (op, FLAG_CURSED);
1003	break;	964	break;
1004	}	965	}
1005		966
1006	case AMULET:	967	case AMULET:
1007	if (op->arch == amulet_arch)	968	if (IS_ARCH (op->arch, amulet))
1008	op->value = 5; / Since it's not just decoration */	969	op->value = 5; / Since it's not just decoration */
1009		970
1010	case RING:	971	case RING:
1011	if (op->arch == NULL)
1012	{
1013	op->destroy ();
1014	op = 0;
1015	break;
1016	}
1017
1018	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */	972	if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */
1019	break;	973	break;
1020		974
1021	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))	975	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1022	SET_FLAG (op, FLAG_CURSED);	976	SET_FLAG (op, FLAG_CURSED);
1023		977
…		…
1043	op->value *= 5;	997	op->value *= 5;
1044	set_ring_bonus (op, d);	998	set_ring_bonus (op, d);
1045	}	999	}
1046	}	1000	}
1047		1001
1048	if (GET_ANIM_ID (op))	1002	if (op->animation_id)
1049	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));	1003	op->set_anim_frame (rndm (op->anim_frames ()));
1050		1004
1051	break;	1005	break;
1052		1006
1053	case BOOK:	1007	case BOOK:
1054	/* Is it an empty book?, if yes lets make a special·	1008	/* Is it an empty book?, if yes lets make a special·
…		…
1176	* Allocate and return the pointer to an empty artifactlist structure.	1130	* Allocate and return the pointer to an empty artifactlist structure.
1177	*/	1131	*/
1178	static artifactlist *	1132	static artifactlist *
1179	get_empty_artifactlist (void)	1133	get_empty_artifactlist (void)
1180	{	1134	{
1181	return salloc0 <artifactlist> ();	1135	return salloc0<artifactlist> ();
1182	}	1136	}
1183		1137
1184	/*	1138	/*
1185	* Allocate and return the pointer to an empty artifact structure.	1139	* Allocate and return the pointer to an empty artifact structure.
1186	*/	1140	*/
1187	static artifact *	1141	static artifact *
1188	get_empty_artifact (void)	1142	get_empty_artifact (void)
1189	{	1143	{
1190	return salloc0 <artifact> ();	1144	return salloc0<artifact> ();
1191	}	1145	}
1192		1146
1193	/*	1147	/*
1194	* Searches the artifact lists and returns one that has the same type	1148	* Searches the artifact lists and returns one that has the same type
1195	* of objects on it.	1149	* of objects on it.
…		…
1200	for (artifactlist *al = first_artifactlist; al; al = al->next)	1154	for (artifactlist *al = first_artifactlist; al; al = al->next)
1201	if (al->type == type)	1155	if (al->type == type)
1202	return al;	1156	return al;
1203		1157
1204	return 0;	1158	return 0;
1205	}
1206
1207	/*
1208	* For debugging purposes. Dumps all tables.
1209	*/
1210	void
1211	dump_artifacts (void)
1212	{
1213	artifactlist *al;
1214	artifact *art;
1215	linked_char *next;
1216
1217	fprintf (logfile, "\n");
1218	for (al = first_artifactlist; al != NULL; al = al->next)
1219	{
1220	fprintf (logfile, "Artifact has type %d, total_chance=%d\n", al->type, al->total_chance);
1221	for (art = al->items; art != NULL; art = art->next)
1222	{
1223	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1224	if (art->allowed != NULL)
1225	{
1226	fprintf (logfile, "\tallowed combinations:");
1227	for (next = art->allowed; next != NULL; next = next->next)
1228	fprintf (logfile, "%s,", &next->name);
1229	fprintf (logfile, "\n");
1230	}
1231	}
1232	}
1233	fprintf (logfile, "\n");
1234	}
1235
1236	/*
1237	* For debugging purposes. Dumps all treasures recursively (see below).
1238	*/
1239	void
1240	dump_monster_treasure_rec (const char name, treasure t, int depth)
1241	{
1242	treasurelist *tl;
1243	int i;
1244
1245	if (depth > 100)
1246	return;
1247
1248	while (t)
1249	{
1250	if (t->name)
1251	{
1252	for (i = 0; i < depth; i++)
1253	fprintf (logfile, " ");
1254
1255	fprintf (logfile, "{ (list: %s)\n", &t->name);
1256
1257	tl = treasurelist::find (t->name);
1258	if (tl)
1259	dump_monster_treasure_rec (name, tl->items, depth + 2);
1260
1261	for (i = 0; i < depth; i++)
1262	fprintf (logfile, " ");
1263
1264	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1265	}
1266	else
1267	{
1268	for (i = 0; i < depth; i++)
1269	fprintf (logfile, " ");
1270
1271	if (t->item && t->item->clone.type == FLESH)
1272	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1273	else
1274	fprintf (logfile, "%s\n", &t->item->clone.name);
1275	}
1276
1277	if (t->next_yes)
1278	{
1279	for (i = 0; i < depth; i++)
1280	fprintf (logfile, " ");
1281
1282	fprintf (logfile, " (if yes)\n");
1283	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1284	}
1285
1286	if (t->next_no)
1287	{
1288	for (i = 0; i < depth; i++)
1289	fprintf (logfile, " ");
1290
1291	fprintf (logfile, " (if no)\n");
1292	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1293	}
1294
1295	t = t->next;
1296	}
1297	}
1298
1299	/*
1300	* For debugging purposes. Dumps all treasures for a given monster.
1301	* Created originally by Raphael Quinet for debugging the alchemy code.
1302	*/
1303	void
1304	dump_monster_treasure (const char *name)
1305	{
1306	archetype *at;
1307	int found;
1308
1309	found = 0;
1310	fprintf (logfile, "\n");
1311
1312	for (at = first_archetype; at != NULL; at = at->next)
1313	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1314	{
1315	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1316	if (at->clone.randomitems != NULL)
1317	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1318	else
1319	fprintf (logfile, "(nothing)\n");
1320
1321	fprintf (logfile, "\n");
1322	found++;
1323	}
1324
1325	if (found == 0)
1326	fprintf (logfile, "No objects have the name %s!\n\n", name);
1327	}	1159	}
1328		1160
1329	/*	1161	/*
1330	* Builds up the lists of artifacts from the file in the libdir.	1162	* Builds up the lists of artifacts from the file in the libdir.
1331	*/	1163	*/
…		…
1346	object_thawer f (filename);	1178	object_thawer f (filename);
1347		1179
1348	if (!f)	1180	if (!f)
1349	return;	1181	return;
1350		1182
1351	f.next ();
1352
1353	for (;;)	1183	for (;;)
1354	{	1184	{
1355	switch (f.kw)	1185	switch (f.kw)
1356	{	1186	{
1357	case KW_allowed:	1187	case KW_allowed:
1358	if (!art)	1188	if (!art)
1359	{
1360	art = get_empty_artifact ();	1189	art = get_empty_artifact ();
1361	nrofartifacts++;
1362	}
1363		1190
1364	{	1191	{
1365	if (!strcmp (f.get_str (), "all"))	1192	if (!strcmp (f.get_str (), "all"))
1366	break;	1193	break;
1367		1194
1368	char next, cp = f.get_str ();	1195	char next, cp = f.get_str ();
1369		1196
1370	do	1197	do
1371	{	1198	{
1372	nrofallowedstr++;
1373
1374	if ((next = strchr (cp, ',')))	1199	if ((next = strchr (cp, ',')))
1375	*next++ = '\0';	1200	*next++ = '\0';
1376		1201
1377	linked_char *tmp = new linked_char;	1202	linked_char *tmp = new linked_char;
1378		1203
…		…
1393	break;	1218	break;
1394		1219
1395	case KW_object:	1220	case KW_object:
1396	{	1221	{
1397	art->item = object::create ();	1222	art->item = object::create ();
		1223	f.get (art->item->name);
		1224	f.next ();
1398		1225
1399	if (!art->item->parse_kv (f))	1226	if (!art->item->parse_kv (f))
1400	LOG (llevError, "Init_Artifacts: Could not load object.\n");	1227	LOG (llevError, "Init_Artifacts: Could not load object.\n");
1401		1228
1402	al = find_artifactlist (art->item->type);	1229	al = find_artifactlist (art->item->type);
…		…
1428	}	1255	}
1429		1256
1430	done:	1257	done:
1431	for (al = first_artifactlist; al; al = al->next)	1258	for (al = first_artifactlist; al; al = al->next)
1432	{	1259	{
		1260	al->total_chance = 0;
		1261
1433	for (art = al->items; art; art = art->next)	1262	for (art = al->items; art; art = art->next)
1434	{	1263	{
1435	if (!art->chance)	1264	if (!art->chance)
1436	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1265	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1437	else	1266	else
…		…
1443	}	1272	}
1444		1273
1445	LOG (llevDebug, "done.\n");	1274	LOG (llevDebug, "done.\n");
1446	}	1275	}
1447		1276
1448
1449	/*	1277	/*
1450	* Used in artifact generation. The bonuses of the first object	1278	* Used in artifact generation. The bonuses of the first object
1451	* is modified by the bonuses of the second object.	1279	* is modified by the bonuses of the second object.
1452	*/	1280	*/
1453
1454	void	1281	void
1455	add_abilities (object op, object change)	1282	add_abilities (object op, object change)
1456	{	1283	{
1457	int i, tmp;	1284	int i, tmp;
1458		1285
…		…
1463	#endif	1290	#endif
1464	op->face = change->face;	1291	op->face = change->face;
1465	}	1292	}
1466		1293
1467	for (i = 0; i < NUM_STATS; i++)	1294	for (i = 0; i < NUM_STATS; i++)
1468	change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i));	1295	change_attr_value (&(op->stats), i, change->stats.stat (i));
1469		1296
1470	op->attacktype \|= change->attacktype;	1297	op->attacktype \|= change->attacktype;
1471	op->path_attuned \|= change->path_attuned;	1298	op->path_attuned \|= change->path_attuned;
1472	op->path_repelled \|= change->path_repelled;	1299	op->path_repelled \|= change->path_repelled;
1473	op->path_denied \|= change->path_denied;	1300	op->path_denied \|= change->path_denied;
…		…
1521	* to cast. So convert that to into a spell and put it into	1348	* to cast. So convert that to into a spell and put it into
1522	* this object.	1349	* this object.
1523	*/	1350	*/
1524	if (op->type == HORN \|\| op->type == POTION)	1351	if (op->type == HORN \|\| op->type == POTION)
1525	{	1352	{
1526	object *tmp_obj;
1527
1528	/* Remove any spells this object currently has in it */	1353	/* Remove any spells this object currently has in it */
1529	while (op->inv)
1530	op->inv->destroy ();	1354	op->destroy_inv (false);
1531		1355
1532	tmp_obj = arch_to_object (change->other_arch);	1356	object *tmp = arch_to_object (change->other_arch);
1533	insert_ob_in_ob (tmp_obj, op);	1357	insert_ob_in_ob (tmp, op);
1534	}	1358	}
1535	/* No harm setting this for potions/horns */	1359	/* No harm setting this for potions/horns */
1536	op->other_arch = change->other_arch;	1360	op->other_arch = change->other_arch;
1537	}	1361	}
1538		1362
…		…
1637	if (change->msg)	1461	if (change->msg)
1638	op->msg = change->msg;	1462	op->msg = change->msg;
1639	}	1463	}
1640		1464
1641	static int	1465	static int
1642	legal_artifact_combination (object op, artifact art)	1466	legal_artifact_combination (object op, artifact art)
1643	{	1467	{
1644	int neg, success = 0;	1468	int neg, success = 0;
1645	linked_char *tmp;	1469	linked_char *tmp;
1646	const char *name;	1470	const char *name;
1647		1471
1648	if (art->allowed == (linked_char *) NULL)	1472	if (!art->allowed)
1649	return 1; /* Ie, "all" */	1473	return 1; /* Ie, "all" */
		1474
1650	for (tmp = art->allowed; tmp; tmp = tmp->next)	1475	for (tmp = art->allowed; tmp; tmp = tmp->next)
1651	{	1476	{
1652	#ifdef TREASURE_VERBOSE	1477	#ifdef TREASURE_VERBOSE
1653	LOG (llevDebug, "legal_art: %s\n", &tmp->name);	1478	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1654	#endif	1479	#endif
…		…
1656	name = tmp->name + 1, neg = 1;	1481	name = tmp->name + 1, neg = 1;
1657	else	1482	else
1658	name = tmp->name, neg = 0;	1483	name = tmp->name, neg = 0;
1659		1484
1660	/* If we match name, then return the opposite of 'neg' */	1485	/* If we match name, then return the opposite of 'neg' */
1661	if (!strcmp (name, op->name) \|\| (op->arch && !strcmp (name, op->arch->name)))	1486	if (!strcmp (name, op->name) \|\| (op->arch && !strcmp (name, op->arch->archname)))
1662	return !neg;	1487	return !neg;
1663		1488
1664	/* Set success as true, since if the match was an inverse, it means	1489	/* Set success as true, since if the match was an inverse, it means
1665	* everything is allowed except what we match	1490	* everything is allowed except what we match
1666	*/	1491	*/
1667	else if (neg)	1492	else if (neg)
1668	success = 1;	1493	success = 1;
1669	}	1494	}
		1495
1670	return success;	1496	return success;
1671	}	1497	}
1672		1498
1673	/*	1499	/*
1674	* Fixes the given object, giving it the abilities and titles	1500	* Fixes the given object, giving it the abilities and titles
…		…
1741	#if 1	1567	#if 1
1742	LOG (llevError, "Got null entry and non zero roll in generate_artifact, type %d\n", op->type);	1568	LOG (llevError, "Got null entry and non zero roll in generate_artifact, type %d\n", op->type);
1743	#endif	1569	#endif
1744	return;	1570	return;
1745	}	1571	}
1746	if (!strcmp (art->item->name, "NONE"))	1572
		1573	if (art->item->name == shstr_NONE)
1747	return;	1574	return;
		1575
1748	if (FABS (op->magic) < art->item->magic)	1576	if (fabs (op->magic) < art->item->magic)
1749	continue; /* Not magic enough to be this item */	1577	continue; /* Not magic enough to be this item */
1750		1578
1751	/* Map difficulty not high enough */	1579	/* Map difficulty not high enough */
1752	if (difficulty < art->difficulty)	1580	if (difficulty < art->difficulty)
1753	continue;	1581	continue;
…		…
1804	item->level = donor->level;	1632	item->level = donor->level;
1805		1633
1806	/* if donor has some attacktypes, the flesh is poisonous */	1634	/* if donor has some attacktypes, the flesh is poisonous */
1807	if (donor->attacktype & AT_POISON)	1635	if (donor->attacktype & AT_POISON)
1808	item->type = POISON;	1636	item->type = POISON;
		1637
1809	if (donor->attacktype & AT_ACID)	1638	if (donor->attacktype & AT_ACID)
1810	item->stats.hp = -1 * item->stats.food;	1639	item->stats.hp = -1 * item->stats.food;
		1640
1811	SET_FLAG (item, FLAG_NO_STEAL);	1641	SET_FLAG (item, FLAG_NO_STEAL);
1812	}	1642	}
1813	}	1643	}
1814		1644
1815	/* special_potion() - so that old potion code is still done right. */	1645	/* special_potion() - so that old potion code is still done right. */
1816
1817	int	1646	int
1818	special_potion (object *op)	1647	special_potion (object *op)
1819	{	1648	{
1820	if (op->attacktype)	1649	if (op->attacktype)
1821	return 1;	1650	return 1;
…		…
1853	free_artifact (artifact *at)	1682	free_artifact (artifact *at)
1854	{	1683	{
1855	if (at->next) free_artifact (at->next);	1684	if (at->next) free_artifact (at->next);
1856	if (at->allowed) free_charlinks (at->allowed);	1685	if (at->allowed) free_charlinks (at->allowed);
1857		1686
1858	at->item->destroy (1);	1687	at->item->destroy ();
1859		1688
1860	sfree (at);	1689	sfree (at);
1861	}	1690	}
1862		1691
1863	void	1692	void

Diff Legend

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

Comparing deliantra/server/common/treasure.C (file contents): Revision 1.44 by root, Mon Apr 16 15:36:22 2007 UTC vs. Revision 1.86 by root, Mon Oct 12 14:00:57 2009 UTC

Diff Legend

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.44 by root, Mon Apr 16 15:36:22 2007 UTC vs.
Revision 1.86 by root, Mon Oct 12 14:00:57 2009 UTC