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

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.41 by root, Mon Apr 16 06:23:40 2007 UTC vs.
Revision 1.74 by root, Mon Apr 21 23:35:24 2008 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
9	* 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
10	* the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your 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 GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	22	*/
24
25	#define ALLOWED_COMBINATION
26		23
27	/* TREASURE_DEBUG does some checking on the treasurelists after loading.	24	/* TREASURE_DEBUG does some checking on the treasurelists after loading.
28	* 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
29	* 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
30	* left on	27	* left on
31	*/	28	*/
32	#define TREASURE_DEBUG	29	#define TREASURE_DEBUG
33		30
34	/* TREASURE_VERBOSE enables copious output concerning artifact generation */	31	/* TREASURE_VERBOSE enables copious output concerning artifact generation */
35		32
36	/* #define TREASURE_VERBOSE */	33	//#define TREASURE_VERBOSE
37		34
38	#include <global.h>	35	#include <global.h>
39	#include <treasure.h>	36	#include <treasure.h>
40	#include <funcpoint.h>
41	#include <loader.h>	37	#include <loader.h>
42		38
43	extern char *spell_mapping[];	39	extern char *spell_mapping[];
44		40
45	static treasurelist *first_treasurelist;	41	static treasurelist *first_treasurelist;
56	> tl_map_t;	52	> tl_map_t;
57		53
58	static tl_map_t tl_map;	54	static tl_map_t tl_map;
59		55
60	/*	56	/*
61	* Initialize global archtype pointers:	57	* Searches for the given treasurelist
62	*/
63	void
64	init_archetype_pointers ()
65	{
66	int prev_warn = warn_archetypes;
67
68	warn_archetypes = 1;
69
70	if (ring_arch == NULL)
71	ring_arch = archetype::find ("ring");
72	if (amulet_arch == NULL)
73	amulet_arch = archetype::find ("amulet");
74	if (staff_arch == NULL)
75	staff_arch = archetype::find ("staff");
76	if (crown_arch == NULL)
77	crown_arch = archetype::find ("crown");
78
79	warn_archetypes = prev_warn;
80	}
81
82	/*
83	* Searches for the given treasurelist in the globally linked list
84	* of treasurelists which has been built by load_treasures().
85	*/	58	*/
86	treasurelist *	59	treasurelist *
87	treasurelist::find (const char *name)	60	treasurelist::find (const char *name)
88	{	61	{
89	if (!name)	62	if (!name)
90	return 0;	63	return 0;
91		64
92	AUTODECL (i, tl_map.find (name));	65	auto (i, tl_map.find (name));
93		66
94	if (i == tl_map.end ())	67	if (i == tl_map.end ())
95	return 0;	68	return 0;
96		69
97	return i->second;	70	return i->second;
…		…
127	if (tl->items)	100	if (tl->items)
128	{	101	{
129	free_treasurestruct (tl->items);	102	free_treasurestruct (tl->items);
130	tl->items = 0;	103	tl->items = 0;
131	}	104	}
		105
		106	tl->total_chance = 0;
132	}	107	}
		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
133		129
134	/*	130	/*
135	* Reads the lib/treasure file from disk, and parses the contents	131	* Reads the lib/treasure file from disk, and parses the contents
136	* into an internal treasure structure (very linked lists)	132	* into an internal treasure structure (very linked lists)
137	*/	133	*/
138
139	static treasure *	134	static treasure *
140	load_treasure (FILE * fp, int *line)	135	read_treasure (object_thawer &f)
141	{	136	{
142	char buf[MAX_BUF], *cp, variable[MAX_BUF];
143	treasure *t = new treasure;	137	treasure *t = new treasure;
144	int value;
145		138
146	nroftreasures++;	139	f.next ();
147	while (fgets (buf, MAX_BUF, fp) != NULL)
148	{
149	(*line)++;
150		140
151	if (*buf == '#')	141	for (;;)
152	continue;	142	{
153	if ((cp = strchr (buf, '\n')) != NULL)	143	coroapi::cede_to_tick ();
154	*cp = '\0';
155	cp = buf;
156	while (isspace (cp)) / Skip blanks */
157	cp++;
158		144
159	if (sscanf (cp, "arch %s", variable))	145	switch (f.kw)
160	{
161	if ((t->item = archetype::find (variable)) == NULL)
162	LOG (llevError, "Treasure lacks archetype: %s\n", variable);
163	}	146	{
164	else if (sscanf (cp, "list %s", variable))	147	case KW_arch:
165	t->name = variable;	148	t->item = archetype::find (f.get_str ());
166	else if (sscanf (cp, "change_name %s", variable))	149
167	t->change_arch.name = variable;	150	if (!t->item)
168	else if (sscanf (cp, "change_title %s", variable))
169	t->change_arch.title = variable;
170	else if (sscanf (cp, "change_slaying %s", variable))
171	t->change_arch.slaying = variable;
172	else if (sscanf (cp, "chance %d", &value))
173	t->chance = (uint8) value;
174	else if (sscanf (cp, "nrof %d", &value))
175	t->nrof = (uint16) value;
176	else if (sscanf (cp, "magic %d", &value))
177	t->magic = (uint8) value;
178	else if (!strcmp (cp, "yes"))
179	t->next_yes = load_treasure (fp, line);
180	else if (!strcmp (cp, "no"))
181	t->next_no = load_treasure (fp, line);
182	else if (!strcmp (cp, "end"))
183	return t;
184	else if (!strcmp (cp, "more"))
185	{	151	{
186	t->next = load_treasure (fp, line);	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 ();
187	return t;	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;
188	}	182	}
189	else	183
190	LOG (llevError, "Unknown treasure-command: '%s', last entry %s, line %d\n", cp, &t->name, *line);	184	f.next ();
191	}	185	}
192	LOG (llevError, "treasure lacks 'end'.\n");	186
		187	// not reached
		188
		189	error:
		190	delete t;
193	return t;	191	return 0;
194	}	192	}
195		193
196	#ifdef TREASURE_DEBUG
197
198	/* recursived checks the linked list. Treasurelist is passed only
199	* so that the treasure name can be printed out
200	*/
201	static void
202	check_treasurelist (const treasure t, const treasurelist tl)
203	{
204	if (t->chance >= 100 && t->next_yes && (t->next \|\| t->next_no))
205	LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
206
207	if (t->next)
208	check_treasurelist (t->next, tl);
209
210	if (t->next_yes)
211	check_treasurelist (t->next_yes, tl);
212
213	if (t->next_no)
214	check_treasurelist (t->next_no, tl);
215	}
216	#endif
217
218	/*	194	/*
219	* Opens LIBDIR/treasure and reads all treasure-declarations from it.
220	* Each treasure is parsed with the help of load_treasure().	195	* Each treasure is parsed with the help of load_treasure().
221	*/	196	*/
222		197	treasurelist *
223	void	198	treasurelist::read (object_thawer &f)
224	load_treasures (void)
225	{	199	{
226	FILE *fp;	200	assert (f.kw == KW_treasure \|\| f.kw == KW_treasureone);
227	char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];
228	treasure *t;
229	int comp, line = 0;
230		201
231	sprintf (filename, "%s/%s", settings.datadir, settings.treasures);	202	bool one = f.kw == KW_treasureone;
232	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)	203	treasurelist *tl = treasurelist::get (f.get_str ());
233	{	204	clear (tl);
234	LOG (llevError, "Can't open treasure file.\n");	205	tl->items = read_treasure (f);
		206	if (!tl->items)
235	return;	207	return 0;
236	}
237	while (fgets (buf, MAX_BUF, fp) != NULL)
238	{
239	line++;
240	if (buf == '#' \|\| buf == '\n')
241	; // ignore
242	else if (sscanf (buf, "treasureone %s\n", name) \|\| sscanf (buf, "treasure %s\n", name))
243	{
244	treasurelist *tl = treasurelist::get (name);
245		208
246	clear (tl);
247	tl->items = load_treasure (fp, &line);
248
249	/* 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.
250	* 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
251	* fields of the treasures are not being used.	211	* fields of the treasures are not being used.
252	*/	212	*/
253	if (!strncmp (buf, "treasureone", 11))	213	if (one)
		214	{
		215	for (treasure *t = tl->items; t; t = t->next)
		216	{
		217	if (t->next_yes \|\| t->next_no)
254	{	218	{
255	for (t = tl->items; t; t = t->next)
256	{
257	#ifdef TREASURE_DEBUG
258	if (t->next_yes \|\| t->next_no)
259	{
260	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);
261	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");
262	}
263	#endif
264	tl->total_chance += t->chance;
265	}
266	}	221	}
267	}
268	else
269	LOG (llevError, "Treasure-list %s didn't understand: %s, line %d\n", filename, buf, line);
270	}
271		222
272	close_and_delete (fp, comp);	223	tl->total_chance += t->chance;
		224	}
		225	}
273		226
274	#ifdef TREASURE_DEBUG	227	return tl;
275	/* Perform some checks on how valid the treasure data actually is.
276	* verify that list transitions work (ie, the list that it is supposed
277	* to transition to exists). Also, verify that at least the name
278	* or archetype is set for each treasure element.
279	*/
280	for (treasurelist *tl = first_treasurelist; tl; tl = tl->next)
281	check_treasurelist (tl->items, tl);
282	#endif
283	}	228	}
284		229
285	/*	230	/*
286	* Generates the objects specified by the given treasure.	231	* Generates the objects specified by the given treasure.
287	* It goes recursively through the rest of the linked list.	232	* It goes recursively through the rest of the linked list.
…		…
294	* start with equipment, but only their abilities).	239	* start with equipment, but only their abilities).
295	*/	240	*/
296	static void	241	static void
297	put_treasure (object op, object creator, int flags)	242	put_treasure (object op, object creator, int flags)
298	{	243	{
299	object *tmp;	244	if (flags & GT_ENVIRONMENT)
300		245	{
301	/* 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
302	* 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
303	* 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
304	* by another object.	249	* by another object.
305	*/	250	*/
306	if (flags & GT_ENVIRONMENT && op->type != SPELL)	251	//TODO: flag such as objects... as such (no drop, anybody?)
307	{	252	if (op->type == SPELL)
		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	{
308	SET_FLAG (op, FLAG_OBJ_ORIGINAL);	264	SET_FLAG (op, FLAG_OBJ_ORIGINAL);
309	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	}
310	}	267	}
311	else	268	else
312	{	269	{
313	op = creator->insert (op);	270	op = creator->insert (op);
314		271
315	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))	272	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
316	monster_check_apply (creator, op);	273	monster_check_apply (creator, op);
317		274
318	if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ()))	275	if (flags & GT_UPDATE_INV)
		276	if (object *tmp = creator->in_player ())
319	esrv_send_item (tmp, op);	277	esrv_send_item (tmp, op);
320	}	278	}
321	}	279	}
322		280
323	/* 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
324	* in the generated object	282	* in the generated object
…		…
346	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)	304	if ((int) t->chance >= 100 \|\| (rndm (100) + 1) < (int) t->chance)
347	{	305	{
348	if (t->name)	306	if (t->name)
349	{	307	{
350	if (difficulty >= t->magic)	308	if (difficulty >= t->magic)
		309	if (treasurelist *tl = treasurelist::find (t->name))
351	create_treasure (treasurelist::find (t->name), op, flag, difficulty, tries);	310	create_treasure (tl, op, flag, difficulty, tries);
		311	else
		312	LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
352	}	313	}
353	else	314	else
354	{	315	{
355	if (t->item && (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE)))	316	if (t->item && (t->item->invisible != 0 \|\| !(flag & GT_INVISIBLE)))
356	{	317	{
357	object *tmp = arch_to_object (t->item);	318	object *tmp = arch_to_object (t->item);
358		319
359	if (t->nrof && tmp->nrof <= 1)	320	if (t->nrof && tmp->nrof <= 1)
360	tmp->nrof = rndm (t->nrof) + 1;	321	tmp->nrof = rndm (t->nrof) + 1;
…		…
407	create_treasure (tl, op, flag, difficulty, tries);	368	create_treasure (tl, op, flag, difficulty, tries);
408	}	369	}
409	else if (t->nrof)	370	else if (t->nrof)
410	create_one_treasure (tl, op, flag, difficulty, tries);	371	create_one_treasure (tl, op, flag, difficulty, tries);
411	}	372	}
412	else if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))	373	else if (t->item && (t->item->invisible != 0 \|\| flag != GT_INVISIBLE))
413	{	374	{
414	if (object *tmp = arch_to_object (t->item))	375	if (object *tmp = arch_to_object (t->item))
415	{	376	{
416	if (t->nrof && tmp->nrof <= 1)	377	if (t->nrof && tmp->nrof <= 1)
417	tmp->nrof = rndm (t->nrof) + 1;	378	tmp->nrof = rndm (t->nrof) + 1;
…		…
419	fix_generated_item (tmp, op, difficulty, t->magic, flag);	380	fix_generated_item (tmp, op, difficulty, t->magic, flag);
420	change_treasure (t, tmp);	381	change_treasure (t, tmp);
421	put_treasure (tmp, op, flag);	382	put_treasure (tmp, op, flag);
422	}	383	}
423	}	384	}
		385	}
		386
		387	void
		388	object::create_treasure (treasurelist *tl, int flags)
		389	{
		390	::create_treasure (tl, this, flags, map ? map->difficulty : 0);
424	}	391	}
425		392
426	/* This calls the appropriate treasure creation function. tries is passed	393	/* This calls the appropriate treasure creation function. tries is passed
427	* to determine how many list transitions or attempts to create treasure	394	* to determine how many list transitions or attempts to create treasure
428	* 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
…		…
441	{	408	{
442	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	409	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
443	return;	410	return;
444	}	411	}
445		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)
		417	return;
		418
		419	flag \|= GT_ENVIRONMENT;
		420	}
		421
446	if (tl->total_chance)	422	if (tl->total_chance)
447	create_one_treasure (tl, op, flag, difficulty, tries);	423	create_one_treasure (tl, op, flag, difficulty, tries);
448	else	424	else
449	create_all_treasures (tl->items, op, flag, difficulty, tries);	425	create_all_treasures (tl->items, op, flag, difficulty, tries);
450	}	426	}
…		…
457	object *	433	object *
458	generate_treasure (treasurelist *tl, int difficulty)	434	generate_treasure (treasurelist *tl, int difficulty)
459	{	435	{
460	difficulty = clamp (difficulty, 1, settings.max_level);	436	difficulty = clamp (difficulty, 1, settings.max_level);
461		437
462	object ob = object::create (), tmp;	438	object *ob = object::create ();
463		439
464	create_treasure (tl, ob, 0, difficulty, 0);	440	create_treasure (tl, ob, 0, difficulty, 0);
465		441
466	/* 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 */
467	tmp = ob->inv;	443	object *tmp = ob->inv;
468	if (tmp != NULL)	444	if (tmp)
469	tmp->remove ();	445	tmp->remove ();
470		446
471	if (ob->inv)	447	if (ob->inv)
472	LOG (llevError, "In generate treasure, created multiple objects.\n");	448	LOG (llevError, "In generate treasure, created multiple objects.\n");
473		449
…		…
481	* 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
482	* magical bonus "wanted".	458	* magical bonus "wanted".
483	*/	459	*/
484		460
485	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {	461	static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
486
487	/chance of magic difficulty/	462	// chance of magic difficulty
488
489	/* +0 +1 +2 +3 +4 */	463	// +0 +1 +2 +3 +4
490	{95, 2, 2, 1, 0}, /1 /	464	{95, 2, 2, 1, 0}, // 1
491	{92, 5, 2, 1, 0}, /2 /	465	{92, 5, 2, 1, 0}, // 2
492	{85, 10, 4, 1, 0}, /3 /	466	{85, 10, 4, 1, 0}, // 3
493	{80, 14, 4, 2, 0}, /4 /	467	{80, 14, 4, 2, 0}, // 4
494	{75, 17, 5, 2, 1}, /5 /	468	{75, 17, 5, 2, 1}, // 5
495	{70, 18, 8, 3, 1}, /6 /	469	{70, 18, 8, 3, 1}, // 6
496	{65, 21, 10, 3, 1}, /7 /	470	{65, 21, 10, 3, 1}, // 7
497	{60, 22, 12, 4, 2}, /8 /	471	{60, 22, 12, 4, 2}, // 8
498	{55, 25, 14, 4, 2}, /9 /	472	{55, 25, 14, 4, 2}, // 9
499	{50, 27, 16, 5, 2}, /10 /	473	{50, 27, 16, 5, 2}, // 10
500	{45, 28, 18, 6, 3}, /11 /	474	{45, 28, 18, 6, 3}, // 11
501	{42, 28, 20, 7, 3}, /12 /	475	{42, 28, 20, 7, 3}, // 12
502	{40, 27, 21, 8, 4}, /13 /	476	{40, 27, 21, 8, 4}, // 13
503	{38, 25, 22, 10, 5}, /14 /	477	{38, 25, 22, 10, 5}, // 14
504	{36, 23, 23, 12, 6}, /15 /	478	{36, 23, 23, 12, 6}, // 15
505	{33, 21, 24, 14, 8}, /16 /	479	{33, 21, 24, 14, 8}, // 16
506	{31, 19, 25, 16, 9}, /17 /	480	{31, 19, 25, 16, 9}, // 17
507	{27, 15, 30, 18, 10}, /18 /	481	{27, 15, 30, 18, 10}, // 18
508	{20, 12, 30, 25, 13}, /19 /	482	{20, 12, 30, 25, 13}, // 19
509	{15, 10, 28, 30, 17}, /20 /	483	{15, 10, 28, 30, 17}, // 20
510	{13, 9, 27, 28, 23}, /21 /	484	{13, 9, 27, 28, 23}, // 21
511	{10, 8, 25, 28, 29}, /22 /	485	{10, 8, 25, 28, 29}, // 22
512	{8, 7, 23, 26, 36}, /23 /	486	{ 8, 7, 23, 26, 36}, // 23
513	{6, 6, 20, 22, 46}, /24 /	487	{ 6, 6, 20, 22, 46}, // 24
514	{4, 5, 17, 18, 56}, /25 /	488	{ 4, 5, 17, 18, 56}, // 25
515	{2, 4, 12, 14, 68}, /26 /	489	{ 2, 4, 12, 14, 68}, // 26
516	{0, 3, 7, 10, 80}, /27 /	490	{ 0, 3, 7, 10, 80}, // 27
517	{0, 0, 3, 7, 90}, /28 /	491	{ 0, 0, 3, 7, 90}, // 28
518	{0, 0, 0, 3, 97}, /29 /	492	{ 0, 0, 0, 3, 97}, // 29
519	{0, 0, 0, 0, 100}, /30 /	493	{ 0, 0, 0, 0, 100}, // 30
520	{0, 0, 0, 0, 100}, /31 /	494	{ 0, 0, 0, 0, 100}, // 31
521	};	495	};
522
523		496
524	/* calculate the appropriate level for wands staves and scrolls.	497	/* calculate the appropriate level for wands staves and scrolls.
525	* 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)
526	*	499	*
527	* elmex Wed Aug 9 17:44:59 CEST 2006:	500	* elmex Wed Aug 9 17:44:59 CEST 2006:
528	* 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.
529	*/	502	*/
530
531	int	503	int
532	level_for_item (const object *op, int difficulty)	504	level_for_item (const object *op, int difficulty)
533	{	505	{
534	int olevel = 0;
535
536	if (!op->inv)	506	if (!op->inv)
537	{	507	{
538	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);
539	return 0;	509	return 0;
540	}	510	}
541		511
542	olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2));	512	int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.));
543		513
544	if (olevel <= 0)	514	if (olevel <= 0)
545	olevel = rndm (1, MIN (op->inv->level, 1));	515	olevel = rndm (1, op->inv->level);
546		516
547	if (olevel > MAXLEVEL)	517	return min (olevel, MAXLEVEL);
548	olevel = MAXLEVEL;
549
550	return olevel;
551	}	518	}
552		519
553	/*	520	/*
554	* Based upon the specified difficulty and upon the difftomagic_list array,	521	* Based upon the specified difficulty and upon the difftomagic_list array,
555	* a random magical bonus is returned. This is used when determine	522	* a random magical bonus is returned. This is used when determine
…		…
611		578
612	op->magic = magic;	579	op->magic = magic;
613	if (op->arch)	580	if (op->arch)
614	{	581	{
615	if (op->type == ARMOUR)	582	if (op->type == ARMOUR)
616	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	583	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
617		584
618	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */	585	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
619	magic = (-magic);	586	magic = (-magic);
620	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	587	op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
621	}	588	}
622	else	589	else
623	{	590	{
624	if (op->type == ARMOUR)	591	if (op->type == ARMOUR)
625	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	592	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
…		…
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->name);
853
854	/* So the treasure doesn't get created again */	818	/* So the treasure doesn't get created again */
855	op->randomitems = NULL;	819	op->randomitems = 0;
856	}	820	}
857		821
858	if (difficulty < 1)	822	if (difficulty < 1)
859	difficulty = 1;	823	difficulty = 1;
860		824
…		…
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)	972	if (!op->arch) // wtf? schmorp
1012	{	973	{
1013	op->destroy ();	974	op->destroy ();
1014	op = 0;	975	op = 0;
1015	break;	976	break;
1016	}	977	}
1017		978
1018	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */	979	if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */
1019	break;	980	break;
1020		981
1021	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))	982	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1022	SET_FLAG (op, FLAG_CURSED);	983	SET_FLAG (op, FLAG_CURSED);
1023		984
…		…
1176	* Allocate and return the pointer to an empty artifactlist structure.	1137	* Allocate and return the pointer to an empty artifactlist structure.
1177	*/	1138	*/
1178	static artifactlist *	1139	static artifactlist *
1179	get_empty_artifactlist (void)	1140	get_empty_artifactlist (void)
1180	{	1141	{
1181	return salloc0 <artifactlist> ();	1142	return salloc0<artifactlist> ();
1182	}	1143	}
1183		1144
1184	/*	1145	/*
1185	* Allocate and return the pointer to an empty artifact structure.	1146	* Allocate and return the pointer to an empty artifact structure.
1186	*/	1147	*/
1187	static artifact *	1148	static artifact *
1188	get_empty_artifact (void)	1149	get_empty_artifact (void)
1189	{	1150	{
1190	return salloc0 <artifact> ();	1151	return salloc0<artifact> ();
1191	}	1152	}
1192		1153
1193	/*	1154	/*
1194	* 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
1195	* of objects on it.	1156	* of objects on it.
…		…
1200	for (artifactlist *al = first_artifactlist; al; al = al->next)	1161	for (artifactlist *al = first_artifactlist; al; al = al->next)
1201	if (al->type == type)	1162	if (al->type == type)
1202	return al;	1163	return al;
1203		1164
1204	return 0;	1165	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	}	1166	}
1328		1167
1329	/*	1168	/*
1330	* Builds up the lists of artifacts from the file in the libdir.	1169	* Builds up the lists of artifacts from the file in the libdir.
1331	*/	1170	*/
…		…
1346	object_thawer f (filename);	1185	object_thawer f (filename);
1347		1186
1348	if (!f)	1187	if (!f)
1349	return;	1188	return;
1350		1189
1351	f.next ();
1352
1353	for (;;)	1190	for (;;)
1354	{	1191	{
1355	switch (f.kw)	1192	switch (f.kw)
1356	{	1193	{
1357	case KW_allowed:	1194	case KW_allowed:
1358	if (!art)	1195	if (!art)
1359	{
1360	art = get_empty_artifact ();	1196	art = get_empty_artifact ();
1361	nrofartifacts++;
1362	}
1363		1197
1364	{	1198	{
1365	if (!strcmp (f.get_str (), "all"))	1199	if (!strcmp (f.get_str (), "all"))
1366	break;	1200	break;
1367		1201
1368	char next, cp = f.get_str ();	1202	char next, cp = f.get_str ();
1369		1203
1370	do	1204	do
1371	{	1205	{
1372	nrofallowedstr++;
1373
1374	if ((next = strchr (cp, ',')))	1206	if ((next = strchr (cp, ',')))
1375	*next++ = '\0';	1207	*next++ = '\0';
1376		1208
1377	linked_char *tmp = new linked_char;	1209	linked_char *tmp = new linked_char;
1378		1210
…		…
1393	break;	1225	break;
1394		1226
1395	case KW_object:	1227	case KW_object:
1396	{	1228	{
1397	art->item = object::create ();	1229	art->item = object::create ();
		1230	f.get (art->item->name);
		1231	f.next ();
1398		1232
1399	if (!art->item->parse_kv (f))	1233	if (!art->item->parse_kv (f))
1400	LOG (llevError, "Init_Artifacts: Could not load object.\n");	1234	LOG (llevError, "Init_Artifacts: Could not load object.\n");
1401		1235
1402	al = find_artifactlist (art->item->type);	1236	al = find_artifactlist (art->item->type);
…		…
1428	}	1262	}
1429		1263
1430	done:	1264	done:
1431	for (al = first_artifactlist; al; al = al->next)	1265	for (al = first_artifactlist; al; al = al->next)
1432	{	1266	{
		1267	al->total_chance = 0;
		1268
1433	for (art = al->items; art; art = art->next)	1269	for (art = al->items; art; art = art->next)
1434	{	1270	{
1435	if (!art->chance)	1271	if (!art->chance)
1436	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);	1272	LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1437	else	1273	else
…		…
1443	}	1279	}
1444		1280
1445	LOG (llevDebug, "done.\n");	1281	LOG (llevDebug, "done.\n");
1446	}	1282	}
1447		1283
1448
1449	/*	1284	/*
1450	* Used in artifact generation. The bonuses of the first object	1285	* Used in artifact generation. The bonuses of the first object
1451	* is modified by the bonuses of the second object.	1286	* is modified by the bonuses of the second object.
1452	*/	1287	*/
1453
1454	void	1288	void
1455	add_abilities (object op, object change)	1289	add_abilities (object op, object change)
1456	{	1290	{
1457	int i, tmp;	1291	int i, tmp;
1458		1292
1459	if (change->face != blank_face)	1293	if (change->face != blank_face)
1460	{	1294	{
1461	#ifdef TREASURE_VERBOSE	1295	#ifdef TREASURE_VERBOSE
1462	LOG (llevDebug, "FACE: %d\n", change->face->number);	1296	LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1463	#endif	1297	#endif
1464	op->face = change->face;	1298	op->face = change->face;
1465	}	1299	}
1466		1300
1467	for (i = 0; i < NUM_STATS; i++)	1301	for (i = 0; i < NUM_STATS; i++)
1468	change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i));	1302	change_attr_value (&(op->stats), i, change->stats.stat (i));
1469		1303
1470	op->attacktype \|= change->attacktype;	1304	op->attacktype \|= change->attacktype;
1471	op->path_attuned \|= change->path_attuned;	1305	op->path_attuned \|= change->path_attuned;
1472	op->path_repelled \|= change->path_repelled;	1306	op->path_repelled \|= change->path_repelled;
1473	op->path_denied \|= change->path_denied;	1307	op->path_denied \|= change->path_denied;
…		…
1637	if (change->msg)	1471	if (change->msg)
1638	op->msg = change->msg;	1472	op->msg = change->msg;
1639	}	1473	}
1640		1474
1641	static int	1475	static int
1642	legal_artifact_combination (object op, artifact art)	1476	legal_artifact_combination (object op, artifact art)
1643	{	1477	{
1644	int neg, success = 0;	1478	int neg, success = 0;
1645	linked_char *tmp;	1479	linked_char *tmp;
1646	const char *name;	1480	const char *name;
1647		1481
1648	if (art->allowed == (linked_char *) NULL)	1482	if (!art->allowed)
1649	return 1; /* Ie, "all" */	1483	return 1; /* Ie, "all" */
		1484
1650	for (tmp = art->allowed; tmp; tmp = tmp->next)	1485	for (tmp = art->allowed; tmp; tmp = tmp->next)
1651	{	1486	{
1652	#ifdef TREASURE_VERBOSE	1487	#ifdef TREASURE_VERBOSE
1653	LOG (llevDebug, "legal_art: %s\n", tmp->name);	1488	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1654	#endif	1489	#endif
1655	if (*tmp->name == '!')	1490	if (*tmp->name == '!')
1656	name = tmp->name + 1, neg = 1;	1491	name = tmp->name + 1, neg = 1;
1657	else	1492	else
1658	name = tmp->name, neg = 0;	1493	name = tmp->name, neg = 0;
1659		1494
1660	/* If we match name, then return the opposite of 'neg' */	1495	/* If we match name, then return the opposite of 'neg' */
1661	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)))
1662	return !neg;	1497	return !neg;
1663		1498
1664	/* 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
1665	* everything is allowed except what we match	1500	* everything is allowed except what we match
1666	*/	1501	*/
1667	else if (neg)	1502	else if (neg)
1668	success = 1;	1503	success = 1;
1669	}	1504	}
		1505
1670	return success;	1506	return success;
1671	}	1507	}
1672		1508
1673	/*	1509	/*
1674	* Fixes the given object, giving it the abilities and titles	1510	* Fixes the given object, giving it the abilities and titles
…		…
1753	continue;	1589	continue;
1754		1590
1755	if (!legal_artifact_combination (op, art))	1591	if (!legal_artifact_combination (op, art))
1756	{	1592	{
1757	#ifdef TREASURE_VERBOSE	1593	#ifdef TREASURE_VERBOSE
1758	LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name);	1594	LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1759	#endif	1595	#endif
1760	continue;	1596	continue;
1761	}	1597	}
		1598
1762	give_artifact_abilities (op, art->item);	1599	give_artifact_abilities (op, art->item);
1763	return;	1600	return;
1764	}	1601	}
1765	}	1602	}
1766		1603
…		…
1810	SET_FLAG (item, FLAG_NO_STEAL);	1647	SET_FLAG (item, FLAG_NO_STEAL);
1811	}	1648	}
1812	}	1649	}
1813		1650
1814	/* special_potion() - so that old potion code is still done right. */	1651	/* special_potion() - so that old potion code is still done right. */
1815
1816	int	1652	int
1817	special_potion (object *op)	1653	special_potion (object *op)
1818	{	1654	{
1819	if (op->attacktype)	1655	if (op->attacktype)
1820	return 1;	1656	return 1;

Diff Legend

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

Comparing deliantra/server/common/treasure.C (file contents): Revision 1.41 by root, Mon Apr 16 06:23:40 2007 UTC vs. Revision 1.74 by root, Mon Apr 21 23:35:24 2008 UTC

Diff Legend

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.41 by root, Mon Apr 16 06:23:40 2007 UTC vs.
Revision 1.74 by root, Mon Apr 21 23:35:24 2008 UTC