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

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.51 by root, Thu Apr 19 16:36:00 2007 UTC vs.
Revision 1.90 by root, Fri Nov 6 13:31:47 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;
		55
		56	//TODO: class method
		57	static void free_treasurestruct (treasure *t); // bleh desu
		58	static void
		59	clear (treasurelist *tl)
		60	{
		61	if (tl->items)
		62	{
		63	free_treasurestruct (tl->items);
		64	tl->items = 0;
		65	}
		66
		67	tl->total_chance = 0;
		68	}
57		69
58	/*	70	/*
59	* Searches for the given treasurelist	71	* Searches for the given treasurelist
60	*/	72	*/
61	treasurelist *	73	treasurelist *
…		…
93	}	105	}
94		106
95	return tl;	107	return tl;
96	}	108	}
97		109
98	//TODO: class method
99	void
100	clear (treasurelist *tl)
101	{
102	if (tl->items)
103	{
104	free_treasurestruct (tl->items);
105	tl->items = 0;
106	}
107
108	tl->total_chance = 0;
109	}
110
111	#ifdef TREASURE_DEBUG	110	#ifdef TREASURE_DEBUG
112	/* recursived checks the linked list. Treasurelist is passed only	111	/* recursived checks the linked list. Treasurelist is passed only
113	* so that the treasure name can be printed out	112	* so that the treasure name can be printed out
114	*/	113	*/
115	static void	114	static void
…		…
140		139
141	f.next ();	140	f.next ();
142		141
143	for (;;)	142	for (;;)
144	{	143	{
145	coroapi::cede_to_tick_every (10);	144	coroapi::cede_to_tick ();
146		145
147	switch (f.kw)	146	switch (f.kw)
148	{	147	{
149	case KW_arch:	148	case KW_arch:
150	t->item = archetype::get (f.get_str ());	149	t->item = archetype::find (f.get_str ());
		150
		151	if (!t->item)
		152	{
		153	f.parse_warn ("treasure references unknown archetype");
		154	t->item = archetype::empty;
		155	}
		156
151	break;	157	break;
152		158
153	case KW_list: f.get (t->name); break;	159	case KW_list: f.get (t->name); break;
154	case KW_change_name: f.get (t->change_arch.name); break;	160	case KW_change_name: f.get (t->change_arch.name); break;
155	case KW_change_title: f.get (t->change_arch.title); break;	161	case KW_change_title: f.get (t->change_arch.title); break;
…		…
169	t->next = read_treasure (f);	175	t->next = read_treasure (f);
170	return t;	176	return t;
171		177
172	default:	178	default:
173	if (!f.parse_error ("treasurelist", t->name))	179	if (!f.parse_error ("treasurelist", t->name))
174	return 0;	180	goto error;
175		181
176	return t;	182	return t;
177	}	183	}
178		184
179	f.next ();	185	f.next ();
180	}	186	}
		187
		188	// not reached
		189
		190	error:
		191	delete t;
		192	return 0;
181	}	193	}
182		194
183	/*	195	/*
184	* Each treasure is parsed with the help of load_treasure().	196	* Each treasure is parsed with the help of load_treasure().
185	*/	197	*/
…		…
197		209
198	/* This is a one of the many items on the list should be generated.	210	/* This is a one of the many items on the list should be generated.
199	* Add up the chance total, and check to make sure the yes & no	211	* Add up the chance total, and check to make sure the yes & no
200	* fields of the treasures are not being used.	212	* fields of the treasures are not being used.
201	*/	213	*/
202	tl->total_chance = 0;
203
204	if (one)	214	if (one)
205	{	215	{
206	for (treasure *t = tl->items; t; t = t->next)	216	for (treasure *t = tl->items; t; t = t->next)
207	{	217	{
208	if (t->next_yes \|\| t->next_no)	218	if (t->next_yes \|\| t->next_no)
209	{	219	{
210	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);	220	LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->archname : &t->name);
211	LOG (llevError, " the next_yes or next_no field is set\n");	221	LOG (llevError, " the next_yes or next_no field is set\n");
212	}	222	}
213		223
214	tl->total_chance += t->chance;	224	tl->total_chance += t->chance;
215	}	225	}
…		…
230	* start with equipment, but only their abilities).	240	* start with equipment, but only their abilities).
231	*/	241	*/
232	static void	242	static void
233	put_treasure (object op, object creator, int flags)	243	put_treasure (object op, object creator, int flags)
234	{	244	{
		245	if (flags & GT_ENVIRONMENT)
		246	{
235	/* Bit of a hack - spells should never be put onto the map. The entire	247	/* Bit of a hack - spells should never be put onto the map. The entire
236	* treasure stuff is a problem - there is no clear idea of knowing	248	* treasure stuff is a problem - there is no clear idea of knowing
237	* this is the original object, or if this is an object that should be created	249	* this is the original object, or if this is an object that should be created
238	* by another object.	250	* by another object.
239	*/	251	*/
240	if (flags & GT_ENVIRONMENT && op->type != SPELL)	252	//TODO: flag such as objects... as such (no drop, anybody?)
241	{	253	if (op->type == SPELL)
		254	{
		255	op->destroy ();
		256	return;
		257	}
		258
		259	op->expand_tail ();
		260
242	if (ob_blocked (op, creator->map, creator->x, creator->y))	261	if (!creator->is_on_map () \|\| op->blocked (creator->map, creator->x, creator->y))
243	op->destroy ();	262	op->destroy ();
244	else	263	else
245	{	264	{
246	SET_FLAG (op, FLAG_OBJ_ORIGINAL);	265	SET_FLAG (op, FLAG_OBJ_ORIGINAL);
247	op->insert_at (creator, creator, INS_NO_MERGE \| INS_NO_WALK_ON);	266	op->insert_at (creator, creator, INS_NO_MERGE \| INS_NO_WALK_ON);
…		…
251	{	270	{
252	op = creator->insert (op);	271	op = creator->insert (op);
253		272
254	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))	273	if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
255	monster_check_apply (creator, op);	274	monster_check_apply (creator, op);
256
257	if (flags & GT_UPDATE_INV)
258	if (object *tmp = creator->in_player ())
259	esrv_send_item (tmp, op);
260	}	275	}
261	}	276	}
262		277
263	/* if there are change_xxx commands in the treasure, we include the changes	278	/* if there are change_xxx commands in the treasure, we include the changes
264	* in the generated object	279	* in the generated object
…		…
293	else	308	else
294	LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);	309	LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
295	}	310	}
296	else	311	else
297	{	312	{
298	if (t->item && (t->item->clone.invisible != 0 \|\| !(flag & GT_INVISIBLE)))	313	if (t->item && (t->item->invisible != 0 \|\| !(flag & GT_INVISIBLE)))
299	{	314	{
300	object *tmp = arch_to_object (t->item);	315	object *tmp = arch_to_object (t->item);
301		316
302	if (t->nrof && tmp->nrof <= 1)	317	if (t->nrof && tmp->nrof <= 1)
303	tmp->nrof = rndm (t->nrof) + 1;	318	tmp->nrof = rndm (t->nrof) + 1;
…		…
350	create_treasure (tl, op, flag, difficulty, tries);	365	create_treasure (tl, op, flag, difficulty, tries);
351	}	366	}
352	else if (t->nrof)	367	else if (t->nrof)
353	create_one_treasure (tl, op, flag, difficulty, tries);	368	create_one_treasure (tl, op, flag, difficulty, tries);
354	}	369	}
355	else if (t->item && (t->item->clone.invisible != 0 \|\| flag != GT_INVISIBLE))	370	else if (t->item && (t->item->invisible != 0 \|\| flag != GT_INVISIBLE))
356	{	371	{
357	if (object *tmp = arch_to_object (t->item))	372	if (object *tmp = arch_to_object (t->item))
358	{	373	{
359	if (t->nrof && tmp->nrof <= 1)	374	if (t->nrof && tmp->nrof <= 1)
360	tmp->nrof = rndm (t->nrof) + 1;	375	tmp->nrof = rndm (t->nrof) + 1;
…		…
362	fix_generated_item (tmp, op, difficulty, t->magic, flag);	377	fix_generated_item (tmp, op, difficulty, t->magic, flag);
363	change_treasure (t, tmp);	378	change_treasure (t, tmp);
364	put_treasure (tmp, op, flag);	379	put_treasure (tmp, op, flag);
365	}	380	}
366	}	381	}
		382	}
		383
		384	void
		385	object::create_treasure (treasurelist *tl, int flags)
		386	{
		387	::create_treasure (tl, this, flags, map ? map->difficulty : 0);
367	}	388	}
368		389
369	/* This calls the appropriate treasure creation function. tries is passed	390	/* This calls the appropriate treasure creation function. tries is passed
370	* to determine how many list transitions or attempts to create treasure	391	* to determine how many list transitions or attempts to create treasure
371	* have been made. It is really in place to prevent infinite loops with	392	* have been made. It is really in place to prevent infinite loops with
…		…
384	{	405	{
385	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");	406	LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
386	return;	407	return;
387	}	408	}
388		409
		410	if (op->flag [FLAG_TREASURE_ENV])
		411	{
		412	// do not generate items when there already is something above the object
		413	if (op->flag [FLAG_IS_FLOOR] && op->above)
		414	return;
		415
		416	flag \|= GT_ENVIRONMENT;
		417	}
		418
389	if (tl->total_chance)	419	if (tl->total_chance)
390	create_one_treasure (tl, op, flag, difficulty, tries);	420	create_one_treasure (tl, op, flag, difficulty, tries);
391	else	421	else
392	create_all_treasures (tl->items, op, flag, difficulty, tries);	422	create_all_treasures (tl->items, op, flag, difficulty, tries);
393	}	423	}
…		…
413		443
414	if (ob->inv)	444	if (ob->inv)
415	LOG (llevError, "In generate treasure, created multiple objects.\n");	445	LOG (llevError, "In generate treasure, created multiple objects.\n");
416		446
417	ob->destroy ();	447	ob->destroy ();
		448
418	return tmp;	449	return tmp;
419	}	450	}
420		451
421	/*	452	/*
422	* This is a new way of calculating the chance for an item to have	453	* This is a new way of calculating the chance for an item to have
…		…
465	* This code presumes that op has had its spell object created (in op->inv)	496	* This code presumes that op has had its spell object created (in op->inv)
466	*	497	*
467	* elmex Wed Aug 9 17:44:59 CEST 2006:	498	* elmex Wed Aug 9 17:44:59 CEST 2006:
468	* Removed multiplicator, too many high-level items were generated on low-difficulty maps.	499	* Removed multiplicator, too many high-level items were generated on low-difficulty maps.
469	*/	500	*/
470	int	501	static int
471	level_for_item (const object *op, int difficulty)	502	level_for_item (const object *op, int difficulty)
472	{	503	{
473	int olevel = 0;
474
475	if (!op->inv)	504	if (!op->inv)
476	{	505	{
477	LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);	506	LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);
478	return 0;	507	return 0;
479	}	508	}
480		509
481	olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2));	510	int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.));
482		511
483	if (olevel <= 0)	512	if (olevel <= 0)
484	olevel = rndm (1, MIN (op->inv->level, 1));	513	olevel = rndm (1, op->inv->level);
485		514
486	if (olevel > MAXLEVEL)	515	return min (olevel, MAXLEVEL);
487	olevel = MAXLEVEL;
488
489	return olevel;
490	}	516	}
491		517
492	/*	518	/*
493	* Based upon the specified difficulty and upon the difftomagic_list array,	519	* Based upon the specified difficulty and upon the difftomagic_list array,
494	* a random magical bonus is returned. This is used when determine	520	* a random magical bonus is returned. This is used when determine
…		…
497	* elmex Thu Aug 10 18:45:44 CEST 2006:	523	* elmex Thu Aug 10 18:45:44 CEST 2006:
498	* Scaling difficulty by max_level, as difficulty is a level and not some	524	* Scaling difficulty by max_level, as difficulty is a level and not some
499	* weird integer between 1-31.	525	* weird integer between 1-31.
500	*	526	*
501	*/	527	*/
502	int	528	static int
503	magic_from_difficulty (int difficulty)	529	magic_from_difficulty (int difficulty)
504	{	530	{
505	int percent = 0, magic = 0;	531	int percent = 0, magic = 0;
506	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);	532	int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
507		533
…		…
550		576
551	op->magic = magic;	577	op->magic = magic;
552	if (op->arch)	578	if (op->arch)
553	{	579	{
554	if (op->type == ARMOUR)	580	if (op->type == ARMOUR)
555	ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;	581	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
556		582
557	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */	583	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
558	magic = (-magic);	584	magic = (-magic);
		585
559	op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;	586	op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
560	}	587	}
561	else	588	else
562	{	589	{
563	if (op->type == ARMOUR)	590	if (op->type == ARMOUR)
564	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;	591	ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
		592
565	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */	593	if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
566	magic = (-magic);	594	magic = (-magic);
		595
567	op->weight = (op->weight * (100 - magic * 10)) / 100;	596	op->weight = (op->weight * (100 - magic * 10)) / 100;
568	}	597	}
569	}	598	}
570		599
571	/*	600	/*
…		…
594	* 1) Since rings can have multiple bonuses, if the same bonus	623	* 1) Since rings can have multiple bonuses, if the same bonus
595	* is rolled again, increase it - the bonuses now stack with	624	* is rolled again, increase it - the bonuses now stack with
596	* other bonuses previously rolled and ones the item might natively have.	625	* other bonuses previously rolled and ones the item might natively have.
597	* 2) Add code to deal with new PR method.	626	* 2) Add code to deal with new PR method.
598	*/	627	*/
599	void	628	static void
600	set_ring_bonus (object *op, int bonus)	629	set_ring_bonus (object *op, int bonus)
601	{	630	{
602
603	int r = rndm (bonus > 0 ? 25 : 11);	631	int r = rndm (bonus > 0 ? 25 : 11);
604		632
605	if (op->type == AMULET)	633	if (op->type == AMULET)
606	{	634	{
607	if (!(rndm (21)))	635	if (!(rndm (21)))
…		…
626	case 2:	654	case 2:
627	case 3:	655	case 3:
628	case 4:	656	case 4:
629	case 5:	657	case 5:
630	case 6:	658	case 6:
631	set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r)));	659	op->stats.stat (r) += bonus;
632	break;	660	break;
633		661
634	case 7:	662	case 7:
635	op->stats.dam += bonus;	663	op->stats.dam += bonus;
636	break;	664	break;
…		…
730	* higher is the chance of returning a low number.	758	* higher is the chance of returning a low number.
731	* 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
732	* rings and amulets.	760	* rings and amulets.
733	* 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.
734	*/	762	*/
735	int	763	static int
736	get_magic (int diff)	764	get_magic (int diff)
737	{	765	{
738	int i;	766	int i;
739		767
740	if (diff < 3)	768	if (diff < 3)
…		…
743	for (i = 0; i < 4; i++)	771	for (i = 0; i < 4; i++)
744	if (rndm (diff))	772	if (rndm (diff))
745	return i;	773	return i;
746		774
747	return 4;	775	return 4;
		776	}
		777
		778	/* special_potion() - so that old potion code is still done right. */
		779	static int
		780	special_potion (object *op)
		781	{
		782	if (op->attacktype)
		783	return 1;
		784
		785	if (op->stats.Str \|\| op->stats.Dex \|\| op->stats.Con \|\| op->stats.Pow \|\| op->stats.Wis \|\| op->stats.Int \|\| op->stats.Cha)
		786	return 1;
		787
		788	for (int i = 0; i < NROFATTACKS; i++)
		789	if (op->resist[i])
		790	return 1;
		791
		792	return 0;
748	}	793	}
749		794
750	#define DICE2 (get_magic(2)==2?2:1)	795	#define DICE2 (get_magic(2)==2?2:1)
751	#define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))	796	#define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))
752		797
…		…
800	ARG_INT (flags)))	845	ARG_INT (flags)))
801	return;	846	return;
802		847
803	if (!(flags & GT_MINIMAL))	848	if (!(flags & GT_MINIMAL))
804	{	849	{
805	if (op->arch == crown_arch)	850	if (IS_ARCH (op->arch, crown))
806	{	851	{
807	set_magic (difficulty, op, max_magic, flags);	852	set_magic (difficulty, op, max_magic, flags);
808	num_enchantments = calc_item_power (op, 1);	853	num_enchantments = calc_item_power (op, 1);
809	generate_artifact (op, difficulty);	854	generate_artifact (op, difficulty);
810	}	855	}
…		…
815		860
816	num_enchantments = calc_item_power (op, 1);	861	num_enchantments = calc_item_power (op, 1);
817		862
818	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))	863	if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
819	\|\| op->type == HORN	864	\|\| op->type == HORN
820	\|\| difficulty >= settings.max_level) /* high difficulties always generate an artifact,	865	\|\| difficulty >= settings.max_level) /* high difficulties always generate an artifact, used for shop_floors or treasures */
821	* used for shop_floors or treasures */
822	generate_artifact (op, difficulty);	866	generate_artifact (op, difficulty);
823	}	867	}
824		868
825	/* Object was made an artifact. Calculate its item_power rating.	869	/* Object was made an artifact. Calculate its item_power rating.
826	* the item_power in the object is what the artfiact adds.	870	* the item_power in the object is what the artfiact adds.
…		…
868	{	912	{
869	if (op->type == POTION)	913	if (op->type == POTION)
870	/* Handle healing and magic power potions */	914	/* Handle healing and magic power potions */
871	if (op->stats.sp && !op->randomitems)	915	if (op->stats.sp && !op->randomitems)
872	{	916	{
873	object *tmp;
874
875	tmp = get_archetype (spell_mapping[op->stats.sp]);	917	object *tmp = get_archetype (spell_mapping [op->stats.sp]);
876	insert_ob_in_ob (tmp, op);	918	insert_ob_in_ob (tmp, op);
877	op->stats.sp = 0;	919	op->stats.sp = 0;
878	}	920	}
879	}	921	}
880	else if (!op->title) /* Only modify object if not special */	922	else if (!op->title) /* Only modify object if not special */
…		…
938	SET_FLAG (op, FLAG_CURSED);	980	SET_FLAG (op, FLAG_CURSED);
939	break;	981	break;
940	}	982	}
941		983
942	case AMULET:	984	case AMULET:
943	if (op->arch == amulet_arch)	985	if (IS_ARCH (op->arch, amulet))
944	op->value = 5; / Since it's not just decoration */	986	op->value = 5; / Since it's not just decoration */
945		987
946	case RING:	988	case RING:
947	if (op->arch == NULL)
948	{
949	op->destroy ();
950	op = 0;
951	break;
952	}
953
954	if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */	989	if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */
955	break;	990	break;
956		991
957	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))	992	if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
958	SET_FLAG (op, FLAG_CURSED);	993	SET_FLAG (op, FLAG_CURSED);
959		994
…		…
979	op->value *= 5;	1014	op->value *= 5;
980	set_ring_bonus (op, d);	1015	set_ring_bonus (op, d);
981	}	1016	}
982	}	1017	}
983		1018
984	if (GET_ANIM_ID (op))	1019	if (op->animation_id)
985	SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));	1020	op->set_anim_frame (rndm (op->anim_frames ()));
986		1021
987	break;	1022	break;
988		1023
989	case BOOK:	1024	case BOOK:
990	/* Is it an empty book?, if yes lets make a special·	1025	/* Is it an empty book?, if yes lets make a special·
…		…
1005	op->level = rndm (creator->level);	1040	op->level = rndm (creator->level);
1006		1041
1007	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);	1042	tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);
1008	/* books w/ info are worth more! */	1043	/* books w/ info are worth more! */
1009	op->value = ((op->level > 10 ? op->level : (op->level + 1) / 2) ((strlen (op->msg) / 250) + 1));	1044	op->value = ((op->level > 10 ? op->level : (op->level + 1) / 2) ((strlen (op->msg) / 250) + 1));
1010	/* creator related stuff */
1011
1012	/* for library, chained books. Note that some monsters have no_pick
1013	* set - we don't want to set no pick in that case.
1014	*/
1015	if (QUERY_FLAG (creator, FLAG_NO_PICK) && !QUERY_FLAG (creator, FLAG_MONSTER))
1016	SET_FLAG (op, FLAG_NO_PICK);
1017	if (creator->slaying && !op->slaying) /* for check_inv floors */
1018	op->slaying = creator->slaying;
1019		1045
1020	/* add exp so reading it gives xp (once) */	1046	/* add exp so reading it gives xp (once) */
1021	op->stats.exp = op->value > 10000 ? op->value / 5 : op->value / 10;	1047	op->stats.exp = op->value > 10000 ? op->value / 5 : op->value / 10;
1022	}	1048	}
		1049
		1050	/* creator related stuff */
		1051
		1052	/* for library, chained books. Note that some monsters have no_pick
		1053	* set - we don't want to set no pick in that case.
		1054	*/
		1055	if (QUERY_FLAG (creator, FLAG_NO_PICK) && !QUERY_FLAG (creator, FLAG_MONSTER))
		1056	SET_FLAG (op, FLAG_NO_PICK);
		1057	if (creator->slaying && !op->slaying) /* for check_inv floors */
		1058	op->slaying = creator->slaying;
1023	break;	1059	break;
1024		1060
1025	case SPELLBOOK:	1061	case SPELLBOOK:
1026	op->value = op->value * op->inv->value;	1062	op->value = op->value * op->inv->value;
1027	/* add exp so learning gives xp */	1063	/* add exp so learning gives xp */
…		…
1112	* Allocate and return the pointer to an empty artifactlist structure.	1148	* Allocate and return the pointer to an empty artifactlist structure.
1113	*/	1149	*/
1114	static artifactlist *	1150	static artifactlist *
1115	get_empty_artifactlist (void)	1151	get_empty_artifactlist (void)
1116	{	1152	{
1117	return salloc0 <artifactlist> ();	1153	return salloc0<artifactlist> ();
1118	}	1154	}
1119		1155
1120	/*	1156	/*
1121	* Allocate and return the pointer to an empty artifact structure.	1157	* Allocate and return the pointer to an empty artifact structure.
1122	*/	1158	*/
1123	static artifact *	1159	static artifact *
1124	get_empty_artifact (void)	1160	get_empty_artifact (void)
1125	{	1161	{
1126	return salloc0 <artifact> ();	1162	return salloc0<artifact> ();
1127	}	1163	}
1128		1164
1129	/*	1165	/*
1130	* Searches the artifact lists and returns one that has the same type	1166	* Searches the artifact lists and returns one that has the same type
1131	* of objects on it.	1167	* of objects on it.
…		…
1136	for (artifactlist *al = first_artifactlist; al; al = al->next)	1172	for (artifactlist *al = first_artifactlist; al; al = al->next)
1137	if (al->type == type)	1173	if (al->type == type)
1138	return al;	1174	return al;
1139		1175
1140	return 0;	1176	return 0;
1141	}
1142
1143	/*
1144	* For debugging purposes. Dumps all tables.
1145	*/
1146	void
1147	dump_artifacts (void)
1148	{
1149	artifactlist *al;
1150	artifact *art;
1151	linked_char *next;
1152
1153	fprintf (logfile, "\n");
1154	for (al = first_artifactlist; al != NULL; al = al->next)
1155	{
1156	fprintf (logfile, "Artifact has type %d, total_chance=%d\n", al->type, al->total_chance);
1157	for (art = al->items; art != NULL; art = art->next)
1158	{
1159	fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1160	if (art->allowed != NULL)
1161	{
1162	fprintf (logfile, "\tallowed combinations:");
1163	for (next = art->allowed; next != NULL; next = next->next)
1164	fprintf (logfile, "%s,", &next->name);
1165	fprintf (logfile, "\n");
1166	}
1167	}
1168	}
1169	fprintf (logfile, "\n");
1170	}
1171
1172	/*
1173	* For debugging purposes. Dumps all treasures recursively (see below).
1174	*/
1175	void
1176	dump_monster_treasure_rec (const char name, treasure t, int depth)
1177	{
1178	treasurelist *tl;
1179	int i;
1180
1181	if (depth > 100)
1182	return;
1183
1184	while (t)
1185	{
1186	if (t->name)
1187	{
1188	for (i = 0; i < depth; i++)
1189	fprintf (logfile, " ");
1190
1191	fprintf (logfile, "{ (list: %s)\n", &t->name);
1192
1193	tl = treasurelist::find (t->name);
1194	if (tl)
1195	dump_monster_treasure_rec (name, tl->items, depth + 2);
1196
1197	for (i = 0; i < depth; i++)
1198	fprintf (logfile, " ");
1199
1200	fprintf (logfile, "} (end of list: %s)\n", &t->name);
1201	}
1202	else
1203	{
1204	for (i = 0; i < depth; i++)
1205	fprintf (logfile, " ");
1206
1207	if (t->item && t->item->clone.type == FLESH)
1208	fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1209	else
1210	fprintf (logfile, "%s\n", &t->item->clone.name);
1211	}
1212
1213	if (t->next_yes)
1214	{
1215	for (i = 0; i < depth; i++)
1216	fprintf (logfile, " ");
1217
1218	fprintf (logfile, " (if yes)\n");
1219	dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1220	}
1221
1222	if (t->next_no)
1223	{
1224	for (i = 0; i < depth; i++)
1225	fprintf (logfile, " ");
1226
1227	fprintf (logfile, " (if no)\n");
1228	dump_monster_treasure_rec (name, t->next_no, depth + 1);
1229	}
1230
1231	t = t->next;
1232	}
1233	}
1234
1235	/*
1236	* For debugging purposes. Dumps all treasures for a given monster.
1237	* Created originally by Raphael Quinet for debugging the alchemy code.
1238	*/
1239	void
1240	dump_monster_treasure (const char *name)
1241	{
1242	archetype *at;
1243	int found;
1244
1245	found = 0;
1246	fprintf (logfile, "\n");
1247
1248	for (at = first_archetype; at != NULL; at = at->next)
1249	if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1250	{
1251	fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1252	if (at->clone.randomitems != NULL)
1253	dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1254	else
1255	fprintf (logfile, "(nothing)\n");
1256
1257	fprintf (logfile, "\n");
1258	found++;
1259	}
1260
1261	if (found == 0)
1262	fprintf (logfile, "No objects have the name %s!\n\n", name);
1263	}	1177	}
1264		1178
1265	/*	1179	/*
1266	* Builds up the lists of artifacts from the file in the libdir.	1180	* Builds up the lists of artifacts from the file in the libdir.
1267	*/	1181	*/
…		…
1281	sprintf (filename, "%s/artifacts", settings.datadir);	1195	sprintf (filename, "%s/artifacts", settings.datadir);
1282	object_thawer f (filename);	1196	object_thawer f (filename);
1283		1197
1284	if (!f)	1198	if (!f)
1285	return;	1199	return;
1286
1287	f.next ();
1288		1200
1289	for (;;)	1201	for (;;)
1290	{	1202	{
1291	switch (f.kw)	1203	switch (f.kw)
1292	{	1204	{
…		…
1396	#endif	1308	#endif
1397	op->face = change->face;	1309	op->face = change->face;
1398	}	1310	}
1399		1311
1400	for (i = 0; i < NUM_STATS; i++)	1312	for (i = 0; i < NUM_STATS; i++)
1401	change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i));	1313	change_attr_value (&(op->stats), i, change->stats.stat (i));
1402		1314
1403	op->attacktype \|= change->attacktype;	1315	op->attacktype \|= change->attacktype;
1404	op->path_attuned \|= change->path_attuned;	1316	op->path_attuned \|= change->path_attuned;
1405	op->path_repelled \|= change->path_repelled;	1317	op->path_repelled \|= change->path_repelled;
1406	op->path_denied \|= change->path_denied;	1318	op->path_denied \|= change->path_denied;
…		…
1454	* to cast. So convert that to into a spell and put it into	1366	* to cast. So convert that to into a spell and put it into
1455	* this object.	1367	* this object.
1456	*/	1368	*/
1457	if (op->type == HORN \|\| op->type == POTION)	1369	if (op->type == HORN \|\| op->type == POTION)
1458	{	1370	{
1459	object *tmp_obj;
1460
1461	/* Remove any spells this object currently has in it */	1371	/* Remove any spells this object currently has in it */
1462	while (op->inv)
1463	op->inv->destroy ();	1372	op->destroy_inv (false);
1464		1373
1465	tmp_obj = arch_to_object (change->other_arch);	1374	object *tmp = arch_to_object (change->other_arch);
1466	insert_ob_in_ob (tmp_obj, op);	1375	insert_ob_in_ob (tmp, op);
1467	}	1376	}
1468	/* No harm setting this for potions/horns */	1377	/* No harm setting this for potions/horns */
1469	op->other_arch = change->other_arch;	1378	op->other_arch = change->other_arch;
1470	}	1379	}
1471		1380
…		…
1570	if (change->msg)	1479	if (change->msg)
1571	op->msg = change->msg;	1480	op->msg = change->msg;
1572	}	1481	}
1573		1482
1574	static int	1483	static int
1575	legal_artifact_combination (object op, artifact art)	1484	legal_artifact_combination (object op, artifact art)
1576	{	1485	{
1577	int neg, success = 0;	1486	int neg, success = 0;
1578	linked_char *tmp;	1487	linked_char *tmp;
1579	const char *name;	1488	const char *name;
1580		1489
1581	if (art->allowed == (linked_char *) NULL)	1490	if (!art->allowed)
1582	return 1; /* Ie, "all" */	1491	return 1; /* Ie, "all" */
		1492
1583	for (tmp = art->allowed; tmp; tmp = tmp->next)	1493	for (tmp = art->allowed; tmp; tmp = tmp->next)
1584	{	1494	{
1585	#ifdef TREASURE_VERBOSE	1495	#ifdef TREASURE_VERBOSE
1586	LOG (llevDebug, "legal_art: %s\n", &tmp->name);	1496	LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1587	#endif	1497	#endif
…		…
1589	name = tmp->name + 1, neg = 1;	1499	name = tmp->name + 1, neg = 1;
1590	else	1500	else
1591	name = tmp->name, neg = 0;	1501	name = tmp->name, neg = 0;
1592		1502
1593	/* If we match name, then return the opposite of 'neg' */	1503	/* If we match name, then return the opposite of 'neg' */
1594	if (!strcmp (name, op->name) \|\| (op->arch && !strcmp (name, op->arch->name)))	1504	if (!strcmp (name, op->name) \|\| (op->arch && !strcmp (name, op->arch->archname)))
1595	return !neg;	1505	return !neg;
1596		1506
1597	/* Set success as true, since if the match was an inverse, it means	1507	/* Set success as true, since if the match was an inverse, it means
1598	* everything is allowed except what we match	1508	* everything is allowed except what we match
1599	*/	1509	*/
1600	else if (neg)	1510	else if (neg)
1601	success = 1;	1511	success = 1;
1602	}	1512	}
		1513
1603	return success;	1514	return success;
1604	}	1515	}
1605		1516
1606	/*	1517	/*
1607	* Fixes the given object, giving it the abilities and titles	1518	* Fixes the given object, giving it the abilities and titles
…		…
1674	#if 1	1585	#if 1
1675	LOG (llevError, "Got null entry and non zero roll in generate_artifact, type %d\n", op->type);	1586	LOG (llevError, "Got null entry and non zero roll in generate_artifact, type %d\n", op->type);
1676	#endif	1587	#endif
1677	return;	1588	return;
1678	}	1589	}
1679	if (!strcmp (art->item->name, "NONE"))	1590
		1591	if (art->item->name == shstr_NONE)
1680	return;	1592	return;
		1593
1681	if (FABS (op->magic) < art->item->magic)	1594	if (fabs (op->magic) < art->item->magic)
1682	continue; /* Not magic enough to be this item */	1595	continue; /* Not magic enough to be this item */
1683		1596
1684	/* Map difficulty not high enough */	1597	/* Map difficulty not high enough */
1685	if (difficulty < art->difficulty)	1598	if (difficulty < art->difficulty)
1686	continue;	1599	continue;
…		…
1737	item->level = donor->level;	1650	item->level = donor->level;
1738		1651
1739	/* if donor has some attacktypes, the flesh is poisonous */	1652	/* if donor has some attacktypes, the flesh is poisonous */
1740	if (donor->attacktype & AT_POISON)	1653	if (donor->attacktype & AT_POISON)
1741	item->type = POISON;	1654	item->type = POISON;
		1655
1742	if (donor->attacktype & AT_ACID)	1656	if (donor->attacktype & AT_ACID)
1743	item->stats.hp = -1 * item->stats.food;	1657	item->stats.hp = -1 * item->stats.food;
		1658
1744	SET_FLAG (item, FLAG_NO_STEAL);	1659	SET_FLAG (item, FLAG_NO_STEAL);
1745	}	1660	}
1746	}	1661	}
1747		1662
1748	/* special_potion() - so that old potion code is still done right. */	1663	static void
1749	int
1750	special_potion (object *op)
1751	{
1752	if (op->attacktype)
1753	return 1;
1754
1755	if (op->stats.Str \|\| op->stats.Dex \|\| op->stats.Con \|\| op->stats.Pow \|\| op->stats.Wis \|\| op->stats.Int \|\| op->stats.Cha)
1756	return 1;
1757
1758	for (int i = 0; i < NROFATTACKS; i++)
1759	if (op->resist[i])
1760	return 1;
1761
1762	return 0;
1763	}
1764
1765	void
1766	free_treasurestruct (treasure *t)	1664	free_treasurestruct (treasure *t)
1767	{	1665	{
1768	if (t->next) free_treasurestruct (t->next);	1666	if (t->next) free_treasurestruct (t->next);
1769	if (t->next_yes) free_treasurestruct (t->next_yes);	1667	if (t->next_yes) free_treasurestruct (t->next_yes);
1770	if (t->next_no) free_treasurestruct (t->next_no);	1668	if (t->next_no) free_treasurestruct (t->next_no);
1771		1669
1772	delete t;	1670	delete t;
1773	}	1671	}
1774		1672
1775	void	1673	static void
1776	free_charlinks (linked_char *lc)	1674	free_charlinks (linked_char *lc)
1777	{	1675	{
1778	if (lc->next)	1676	if (lc->next)
1779	free_charlinks (lc->next);	1677	free_charlinks (lc->next);
1780		1678
1781	delete lc;	1679	delete lc;
1782	}	1680	}
1783		1681
1784	void	1682	static void
1785	free_artifact (artifact *at)	1683	free_artifact (artifact *at)
1786	{	1684	{
1787	if (at->next) free_artifact (at->next);	1685	if (at->next) free_artifact (at->next);
1788	if (at->allowed) free_charlinks (at->allowed);	1686	if (at->allowed) free_charlinks (at->allowed);
1789		1687
1790	at->item->destroy (1);	1688	at->item->destroy ();
1791		1689
1792	sfree (at);	1690	sfree (at);
1793	}	1691	}
1794		1692
1795	void	1693	static void
1796	free_artifactlist (artifactlist *al)	1694	free_artifactlist (artifactlist *al)
1797	{	1695	{
1798	artifactlist *nextal;	1696	artifactlist *nextal;
1799		1697
1800	for (al = first_artifactlist; al; al = nextal)	1698	for (al = first_artifactlist; al; al = nextal)
…		…
1806		1704
1807	sfree (al);	1705	sfree (al);
1808	}	1706	}
1809	}	1707	}
1810		1708
1811	void
1812	free_all_treasures (void)
1813	{
1814	treasurelist tl, next;
1815
1816	for (tl = first_treasurelist; tl; tl = next)
1817	{
1818	clear (tl);
1819
1820	next = tl->next;
1821	delete tl;
1822	}
1823
1824	free_artifactlist (first_artifactlist);
1825	}

Diff Legend

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

Comparing deliantra/server/common/treasure.C (file contents): Revision 1.51 by root, Thu Apr 19 16:36:00 2007 UTC vs. Revision 1.90 by root, Fri Nov 6 13:31:47 2009 UTC

Diff Legend

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.51 by root, Thu Apr 19 16:36:00 2007 UTC vs.
Revision 1.90 by root, Fri Nov 6 13:31:47 2009 UTC