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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.40 by root, Fri Feb 2 22:08:23 2007 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 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	#include <cassert>	25	#include <cassert>
26		26
27	#include <global.h>	27	#include <global.h>
28	#include <funcpoint.h>
29	#include <loader.h>	28	#include <loader.h>
30		29
31	#include <tr1/functional>	30	#include <tr1/functional>
32	#include <tr1/unordered_map>	31	#include <tr1/unordered_map>
33		32
34	int arch_init; /* True if doing arch initialization */	33	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
35		34	arch_ptr archetype::empty;
36	/* The naming of these functions is really poor - they are all
37	* pretty much named '.._arch_...', but they may more may not
38	* return archetypes. Some make the arch_to_object call, and thus
39	* return an object. Perhaps those should be called 'archob' functions
40	* to denote they return an object derived from the archetype.
41	* MSW 2003-04-29
42	*/
43		35
44	// the hashtable	36	// the hashtable
45	typedef std::tr1::unordered_map	37	typedef std::tr1::unordered_map
46	<	38	<
47	const char *,	39	const char *,
49	str_hash,	41	str_hash,
50	str_equal,	42	str_equal,
51	slice_allocator< std::pair<const char *const, arch_ptr> >	43	slice_allocator< std::pair<const char *const, arch_ptr> >
52	> HT;	44	> HT;
53		45
54	static HT ht (5000);	46	static HT ht (10000);
		47	archvec archetypes;
		48	static unordered_vector<archetype *> allarch;
		49	static int dirtycnt;
		50
		51	// the vector of other_arch references to be resolved
		52	static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
		53	// the vector of loaded but not yet committed archetypes
		54	static std::vector<archetype *> postponed_arch;
		55
		56	//+GPL
55		57
56	/**	58	/**
57	* GROS - This function retrieves an archetype given the name that appears	59	* GROS - This function retrieves an archetype given the name that appears
58	* during the game (for example, "writing pen" instead of "stylus").	60	* during the game (for example, "writing pen" instead of "stylus").
59	* It does not use the hashtable system, but browse the whole archlist each time.	61	* It does not use the hashtable system, but browse the whole archlist each time.
…		…
67	archetype *	69	archetype *
68	find_archetype_by_object_name (const char *name)	70	find_archetype_by_object_name (const char *name)
69	{	71	{
70	shstr_cmp name_cmp (name);	72	shstr_cmp name_cmp (name);
71		73
72	for (archetype *at = first_archetype; at; at = at->next)	74	for_all_archetypes (at)
73	if (at->clone.name == name_cmp)	75	if (at->name == name_cmp)
74	return at;	76	return at;
75		77
76	return 0;	78	return 0;
77	}	79	}
78		80
…		…
84	archetype *	86	archetype *
85	find_archetype_by_object_type_name (int type, const char *name)	87	find_archetype_by_object_type_name (int type, const char *name)
86	{	88	{
87	shstr_cmp name_cmp (name);	89	shstr_cmp name_cmp (name);
88		90
89	for (archetype *at = first_archetype; at; at = at->next)	91	for_all_archetypes (at)
90	if (at->clone.name == name_cmp && at->clone.type == type)	92	if (at->name == name_cmp && at->type == type)
91	return at;	93	return at;
92		94
93	return 0;	95	return 0;
94	}	96	}
95		97
…		…
101	object *	103	object *
102	get_archetype_by_skill_name (const char *skill, int type)	104	get_archetype_by_skill_name (const char *skill, int type)
103	{	105	{
104	shstr_cmp skill_cmp (skill);	106	shstr_cmp skill_cmp (skill);
105		107
106	for (archetype *at = first_archetype; at; at = at->next)	108	for_all_archetypes (at)
107	if (at->clone.skill == skill_cmp && (type == -1 \|\| type == at->clone.type))	109	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
108	return arch_to_object (at);	110	return at->instance ();
109		111
110	return 0;	112	return 0;
111	}	113	}
112		114
113	/* similiar to above - this returns the first archetype	115	/* similiar to above - this returns the first archetype
…		…
118	* (eg, skills)	120	* (eg, skills)
119	*/	121	*/
120	archetype *	122	archetype *
121	get_archetype_by_type_subtype (int type, int subtype)	123	get_archetype_by_type_subtype (int type, int subtype)
122	{	124	{
123	for (archetype *at = first_archetype; at; at = at->next)	125	for_all_archetypes (at)
124	if ((type == -1 \|\| type == at->clone.type) && (subtype == -1 \|\| subtype == at->clone.subtype))	126	if ((type == -1 \|\| type == at->type) && (subtype == -1 \|\| subtype == at->subtype))
125	return at;	127	return at;
126		128
127	return 0;	129	return 0;
128	}	130	}
129		131
…		…
134	* - name: The name we're searching for (ex: "writing pen");	136	* - name: The name we're searching for (ex: "writing pen");
135	* Return value:	137	* Return value:
136	* - a corresponding object if found; a singularity object if not found.	138	* - a corresponding object if found; a singularity object if not found.
137	* Note by MSW - it appears that it takes the full name and keeps	139	* Note by MSW - it appears that it takes the full name and keeps
138	* shortening it until it finds a match. I re-wrote this so that it	140	* shortening it until it finds a match. I re-wrote this so that it
139	* doesn't malloc it each time - not that this function is used much,	141	* doesn't allocate it each time - not that this function is used much,
140	* but it otherwise had a big memory leak.	142	* but it otherwise had a big memory leak.
141	*/	143	*/
142	object *	144	object *
143	get_archetype_by_object_name (const char *name)	145	get_archetype_by_object_name (const char *name)
144	{	146	{
145	char tmpname[MAX_BUF];	147	char tmpname[MAX_BUF];
146	int i;
147		148
148	assign (tmpname, name);	149	assign (tmpname, name);
149		150
150	for (i = strlen (tmpname); i > 0; i--)	151	for (int i = strlen (tmpname); i > 0; i--)
151	{	152	{
152	tmpname[i] = 0;	153	tmpname[i] = 0;
153		154
154	if (archetype *at = find_archetype_by_object_name (tmpname))	155	if (archetype *at = find_archetype_by_object_name (tmpname))
155	return arch_to_object (at);	156	return at->instance ();
156	}	157	}
157		158
158	return create_singularity (name);	159	return create_singularity (name);
159	}	160	}
160		161
161	/* This is a subset of the parse_id command. Basically, name can be	162	/* This is a subset of the parse_id command. Basically, name can be
162	* a string seperated lists of things to match, with certain keywords.	163	* a string seperated lists of things to match, with certain keywords.
163	* pl is the player (only needed to set count properly)	164	* pl is the player (only needed to set count properly)
164	* op is the item we are trying to match. Calling function takes care	165	* op is the item we are trying to match. Calling function takes care
165	* of what action might need to be done and if it is valid	166	* of what action might need to be done and if it is valid
166	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher	167	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
167	* value means a better match. 0 means no match.	168	* value means a better match. 0 means no match.
168	*	169	*
169	* Brief outline of the procedure:	170	* Brief outline of the procedure:
170	* We take apart the name variable into the individual components.	171	* We take apart the name variable into the individual components.
171	* cases for 'all' and unpaid are pretty obvious.	172	* cases for 'all' and unpaid are pretty obvious.
172	* Next, we check for a count (either specified in name, or in the	173	* Next, we check for a count (either specified in name, or in the
173	* player object.)	174	* player object.)
174	* If count is 1, make a quick check on the name.	175	* If count is 1, make a quick check on the name.
175	* IF count is >1, we need to make plural name. Return if match.	176	* IF count is >1, we need to make plural name. Return if match.
176	* Last, make a check on the full name.	177	* Last, make a check on the full name.
177	*/	178	*/
178	int	179	int
179	item_matched_string (object pl, object op, const char *name)	180	item_matched_string (object pl, object op, const char *name)
180	{	181	{
181	char *cp, local_name[MAX_BUF];	182	char *cp, local_name[MAX_BUF];
182	int count, retval = 0;	183	int count, retval = 0;
…		…
194	return 1;	195	return 1;
195		196
196	/* unpaid is a little more specific */	197	/* unpaid is a little more specific */
197	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	198	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
198	return 2;	199	return 2;
		200
199	if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))	201	if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))
200	return 2;	202	return 2;
201		203
202	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	204	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
203	return 2;	205	return 2;
…		…
225	* is because of the 'else' handling - we don't want to match on	227	* is because of the 'else' handling - we don't want to match on
226	* something and set a low retval, even though it may match a higher retcal	228	* something and set a low retval, even though it may match a higher retcal
227	* later. So keep it in descending order here, so we try for the best	229	* later. So keep it in descending order here, so we try for the best
228	* match first, and work downward.	230	* match first, and work downward.
229	*/	231	*/
		232	const char qbn0, qbn1, *qsn; // query base name/short name caches
		233
230	if (!strcasecmp (cp, query_name (op)))	234	if (!strcasecmp (cp, query_name (op)))
231	retval = 20;	235	retval = 20;
232	else if (!strcasecmp (cp, query_short_name (op)))	236	else if (!strcasecmp (cp, qsn = query_short_name (op)))
233	retval = 18;	237	retval = 18;
234	else if (!strcasecmp (cp, query_base_name (op, 0)))	238	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
235	retval = 16;	239	retval = 16;
236	else if (!strcasecmp (cp, query_base_name (op, 1)))	240	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
237	retval = 16;	241	retval = 16;
238	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	242	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
239	retval = 15;	243	retval = 15;
240	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	244	else if (!strncasecmp (cp, qbn0, strlen (cp)))
241	retval = 14;	245	retval = 14;
242	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	246	else if (!strncasecmp (cp, qbn1, strlen (cp)))
243	retval = 14;	247	retval = 14;
244	/* Do substring checks, so things like 'Str+1' will match.	248	/* Do substring checks, so things like 'Str+1' will match.
245	* retval of these should perhaps be lower - they are lower	249	* retval of these should perhaps be lower - they are lower
246	* then the specific strcasecmp aboves, but still higher than	250	* then the specific strcasecmp aboves, but still higher than
247	* some other match criteria.	251	* some other match criteria.
248	*/	252	*/
249	else if (strstr (query_base_name (op, 1), cp))	253	else if (strstr (qbn1, cp))
250	retval = 12;	254	retval = 12;
251	else if (strstr (query_base_name (op, 0), cp))	255	else if (strstr (qbn0, cp))
252	retval = 12;	256	retval = 12;
253	else if (strstr (query_short_name (op), cp))	257	else if (strstr (qsn, cp))
254	retval = 12;	258	retval = 12;
255	/* Check against plural/non plural based on count. */	259	/* Check against plural/non plural based on count. */
256	else if (count > 1 && !strcasecmp (cp, op->name_pl))	260	else if (count > 1 && !strcasecmp (cp, op->name_pl))
257	retval = 6;	261	retval = 6;
258	else if (count == 1 && !strcasecmp (op->name, cp))	262	else if (count == 1 && !strcasecmp (op->name, cp))
259	retval = 6;	263	retval = 6;
260	/* base name matched - not bad */	264	/* base name matched - not bad */
261	else if (strcasecmp (cp, op->name) == 0 && !count)	265	else if (strcasecmp (cp, op->name) == 0 && !count)
262	retval = 4;	266	retval = 4;
263	/* Check for partial custom name, but give a real low priority */	267	/* Check for partial custom name, but give a real low priority */
264	else if (op->custom_name && strstr (op->custom_name, cp))	268	else if (op->custom_name.contains (cp))
265	retval = 3;	269	retval = 3;
266		270
267	if (retval)	271	if (retval)
268	{	272	{
269	if (pl->type == PLAYER)	273	if (pl->type == PLAYER)
…		…
274	}	278	}
275		279
276	return 0;	280	return 0;
277	}	281	}
278		282
		283	//-GPL
		284
		285	archetype::archetype (const char *name)
		286	{
		287	arch = this;
		288	this->archname = this->name = this->name_pl = name;
		289	}
		290
		291	archetype::~archetype ()
		292	{
		293	unlink ();
		294	}
		295
		296	void
		297	archetype::link ()
		298	{
		299	if (!archetypes.contains (this))
		300	{
		301	archetypes.insert (this);
		302	ht.insert (std::make_pair (archname, this));
		303	}
		304	}
		305
		306	void
		307	archetype::unlink ()
		308	{
		309	if (archetypes.contains (this))
		310	{
		311	archetypes.erase (this);
		312	ht.erase (archname);
		313	}
		314	}
		315
279	/*	316	/*
280	* Initialises the internal linked list of archetypes (read from file).	317	* Finds, using the hashtable, which archetype matches the given name.
281	* Then the global "empty_archetype" pointer is initialised.	318	* returns a pointer to the found archetype, otherwise NULL.
282	* Then the blocksview[] array is initialised.
283	*/	319	*/
		320	archetype *
		321	archetype::find (const char *name)
		322	{
		323	if (!name)
		324	return 0;
		325
		326	auto (i, ht.find (name));
		327
		328	if (i == ht.end ())
		329	return 0;
		330	else
		331	return i->second;
		332	}
		333
		334	archetype *
		335	archetype::read (object_thawer &f)
		336	{
		337	assert (f.kw == KW_object);
		338
		339	std::vector<archetype *> parts;
		340
		341	coroapi::cede_to_tick ();
		342
		343	for (;;)
		344	{
		345	archetype *at = new archetype (f.get_str ());
		346
		347	f.next ();
		348
		349	#if 0
		350	// implementing it here in the server does neither allow multiple inheritence
		351	// nor does it cleanly "just override". it would allow use in map files, though,
		352	// and other resource files dynamically laoded (as opposed to being preprocessed).
		353	// not that any of this is relevant as of yet...
		354	if (f.kw == KW_inherit)
		355	{
		356	if (archetype *at = find (f.get_str ()))
		357	*op = at->clone;
		358	else
		359	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		360	&at->archname, f.get_str ());
		361
		362	f.next ();
		363	}
		364	#endif
		365
		366	loading_arch = at; // hack to tell parse_kv et al. to behave
		367	bool parse_ok = at->parse_kv (f);
		368	loading_arch = 0;
		369
		370	if (!parse_ok)
		371	goto fail;
		372
		373	loading_arch = at; // hack to tell parse_kv et al. to behave
		374	at->post_load_check ();
		375	loading_arch = 0;
		376
		377	parts.push_back (at);
		378
		379	if (f.kw != KW_more)
		380	break;
		381
		382	f.next ();
		383
		384	if (f.kw != KW_object)
		385	{
		386	f.parse_error ("more object");
		387	goto fail;
		388	}
		389	}
		390
		391	{
		392	auto (at, parts.begin ());
		393
		394	archetype *new_head = parts.front ();
		395	archetype *old_head = find (new_head->archname);
		396
		397	if (old_head && !old_head->is_head ())
		398	{
		399	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		400	&new_head->archname, &old_head->archname);
		401	goto fail;
		402	}
		403
		404	// check that all archetypes belong to the same old object or are new
		405	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		406	{
		407	archetype new_part = at;
		408	archetype *old_part = find (new_part->archname);
		409
		410	if (old_part && old_part->head_ () != old_head)
		411	{
		412	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		413	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		414	goto fail;
		415	}
		416	}
		417
		418	// assemble new chain
		419	new_head->min_x = new_head->max_x = new_head->x;
		420	new_head->min_y = new_head->max_y = new_head->y;
		421
		422	archetype *less = new_head;
		423	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		424	{
		425	archetype at = p;
		426
		427	// some flags get inherited from the head (probably a lot more)
		428	// doing it here doesn't feel too cozy, but it allows code
		429	// to ignore head checks for these flags, which saves time
		430	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		431	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		432	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		433	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		434
		435	new_head->min_x = min (new_head->min_x, at->x);
		436	new_head->min_y = min (new_head->min_y, at->y);
		437	new_head->max_x = max (new_head->max_x, at->x);
		438	new_head->max_y = max (new_head->max_y, at->y);
		439
		440	at->head = new_head;
		441	less->more = at;
		442	less = at;
		443	}
		444
		445	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
		446
		447	return new_head;
		448	}
		449
		450	fail:
		451	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		452	(*p)->destroy ();
		453
		454	return 0;
		455	}
284		456
285	void	457	void
286	init_archetypes (void)	458	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
287	{ /* called from add_player() and edit() */	459	{
288	if (first_archetype != NULL) /* Only do this once */	460	ref = 0;
289	return;	461	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
290
291	arch_init = 1;
292	load_archetypes ();
293	arch_init = 0;
294	empty_archetype = archetype::find ("empty_archetype");
295
296	/* init_blocksview();*/
297	}	462	}
298		463
299	/*
300	* An alternative way to init the hashtable which is slower, but _works_...
301	*/
302	void	464	void
303	init_archetable (void)	465	archetype::commit_load ()
304	{	466	{
		467	// unlink old archetypes and link in new ones */
		468	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
		469	{
305	archetype *at;	470	archetype at = p;
306		471
307	LOG (llevDebug, " Setting up archetable...\n");	472	if (archetype *old = find (at->archname))
		473	old->unlink ();
308		474
309	for (at = first_archetype; at; at = at->more ? at->more : at->next)	475	allarch.push_back (at);
310	at->hash_add ();
311		476
312	LOG (llevDebug, "done\n");	477	at->link ();
		478	++dirtycnt;
		479	}
		480
		481	postponed_arch.clear ();
		482
		483	// now resolve arch references
		484	for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
		485	{
		486	arch_ptr *ap = p->first;
		487	archetype *at = find (p->second);
		488
		489	if (!at)
		490	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		491
		492	*ap = at;
		493	}
		494
		495	postponed_arch_ref.clear ();
		496
		497	empty = find (shstr_empty_archetype);
313	}	498	}
314		499
315	void	500	void
316	free_all_archs (void)	501	archetype::gc ()
317	{	502	{
318	archetype at, next;	503	int cnt = max (1, min (allarch.size () / 128, dirtycnt));
319	int i = 0, f = 0;	504	dirtycnt = max (0, dirtycnt - cnt);
320		505
321	for (at = first_archetype; at; at = next)	506	do
322	{	507	{
323	if (at->more)	508	static int idx;
324	next = at->more;	509
		510	if (idx >= allarch.size ())
		511	if (idx)
		512	idx = 0;
		513	else
		514	return;
		515
		516	archetype *at = allarch [idx];
		517
		518	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
		519	++idx;
325	else	520	else
326	next = at->next;
327
328	delete
329	at;
330
331	i++;
332	}
333
334	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
335	}
336
337	archetype::archetype ()
338	{
339	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
340	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
341	}
342
343	archetype::~archetype ()
344	{
345	}
346
347	/*
348	* Reads/parses the archetype-file, and copies into a linked list
349	* of archetype-structures.
350	*/
351	void
352	first_arch_pass (object_thawer & fp)
353	{
354	archetype head = 0, last_more = 0;
355
356	archetype *at = new archetype;
357	at->clone.arch = first_archetype = at;
358
359	while (int i = load_object (fp, &at->clone, 0))
360	{
361	at->clone.speed_left = (float) (-0.1);
362	/* copy the body_info to the body_used - this is only really
363	* need for monsters, but doesn't hurt to do it for everything.
364	* by doing so, when a monster is created, it has good starting
365	* values for the body_used info, so when items are created
366	* for it, they can be properly equipped.
367	*/
368	memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
369
370	switch (i)
371	{	521	{
372	case LL_NORMAL: /* A new archetype, just link it with the previous */	522	LOG (llevDebug, "garbage collect arch %s", &at->archname);
373	if (last_more != NULL)	523	assert (at->arch == at); // verify that refcnt == 1 is truly valid
374	last_more->next = at;	524	allarch.erase (idx);
375	if (head != NULL)
376	head->next = at;
377	head = last_more = at;
378	#if 0
379	if (!op->type)
380	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
381	#endif
382	at->tail_x = 0;
383	at->tail_y = 0;
384	break;
385		525
386	case LL_MORE: /* Another part of the previous archetype, link it correctly */	526	// break chain
387		527	for (object *op = at->head_ (); op; )
388	at->head = head;
389	at->clone.head = &head->clone;
390	if (last_more != NULL)
391	{	528	{
		529	object *next = op->more;
		530	op->head = 0;
392	last_more->more = at;	531	op->more = 0;
393	last_more->clone.more = &at->clone;	532	op = next;
394	}	533	}
395	last_more = at;
396		534
397	/* If this multipart image is still composed of individual small	535	at->destroy ();
398	* images, don't set the tail_.. values. We can't use them anyways,	536	at->arch = 0;
399	* and setting these to zero makes the map sending to the client much
400	* easier as just looking at the head, we know what to do.
401	*/
402	if (at->clone.face != head->clone.face)
403	{
404	head->tail_x = 0;
405	head->tail_y = 0;
406	}
407	else
408	{
409	if (at->clone.x > head->tail_x)
410	head->tail_x = at->clone.x;
411	if (at->clone.y > head->tail_y)
412	head->tail_y = at->clone.y;
413	}
414	break;
415
416	}	537	}
417
418	at = new archetype;
419
420	at->clone.arch = at;
421	}
422
423	delete at;
424	}
425
426	/*
427	* Reads the archetype file once more, and links all pointers between
428	* archetypes.
429	*/
430
431	void
432	second_arch_pass (object_thawer & thawer)
433	{
434	char buf[MAX_BUF], variable = buf, argument, *cp;
435	archetype at = NULL, other;
436
437	while (fgets (buf, MAX_BUF, thawer) != NULL)
438	{	538	}
439	if (*buf == '#')	539	while (--cnt);
440	continue;
441	if ((argument = strchr (buf, ' ')) != NULL)
442	{
443	*argument = '\0', argument++;
444	cp = argument + strlen (argument) - 1;
445	while (isspace (*cp))
446	{
447	*cp = '\0';
448	cp--;
449	}
450	}
451	if (!strcmp ("Object", variable))
452	{
453	if ((at = archetype::find (argument)) == NULL)
454	LOG (llevError, "Warning: failed to find arch %s\n", argument);
455	}
456	else if (!strcmp ("other_arch", variable))
457	{
458	if (at != NULL && at->clone.other_arch == NULL)
459	{
460	if ((other = archetype::find (argument)) == NULL)
461	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
462	else if (at != NULL)
463	at->clone.other_arch = other;
464	}
465	}
466	else if (!strcmp ("randomitems", variable))
467	{
468	if (at != NULL)
469	{
470	treasurelist *tl = find_treasurelist (argument);
471
472	if (tl == NULL)
473	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
474	else
475	at->clone.randomitems = tl;
476	}
477	}
478	}
479	}	540	}
480		541
481	#ifdef DEBUG
482	void
483	check_generators (void)
484	{
485	archetype *at;
486
487	for (at = first_archetype; at != NULL; at = at->next)
488	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
489	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
490	}
491	#endif
492
493	/*
494	* First initialises the archtype hash-table (init_archetable()).
495	* Reads and parses the archetype file (with the first and second-pass
496	* functions).
497	* Then initialises treasures by calling load_treasures().
498	*/
499
500	void
501	load_archetypes (void)
502	{
503	char filename[MAX_BUF];
504
505	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
506	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
507
508	{
509	object_thawer
510	thawer (filename);
511
512	LOG (llevDebug, " arch-pass 1...\n");
513	first_arch_pass (thawer);
514	LOG (llevDebug, " done\n");
515	}
516
517	init_archetable ();
518	warn_archetypes = 1;
519
520	{
521	object_thawer
522	thawer (filename);
523
524	LOG (llevDebug, " loading treasure...\n");
525	load_treasures ();
526	LOG (llevDebug, " done\n");
527	LOG (llevDebug, " arch-pass 2...\n");
528	second_arch_pass (thawer);
529	LOG (llevDebug, " done\n");
530	#ifdef DEBUG
531	check_generators ();
532	#endif
533	}
534	LOG (llevDebug, " done\n");
535	}
536
537	/*
538	* Creates and returns a new object which is a copy of the given archetype.
539	* This function returns NULL on failure.
540	*/
541	object *
542	arch_to_object (archetype *at)
543	{
544	object *op;	542	object *
545		543	archetype::instance ()
546	if (at == NULL)	544	{
547	{	545	object *op = clone ();
548	if (warn_archetypes)
549	LOG (llevError, "Couldn't find archetype.\n");
550
551	return NULL;
552	}
553
554	op = at->clone.clone ();
555	op->arch = at;
556	op->instantiate ();	546	op->instantiate ();
557	return op;	547	return op;
558	}	548	}
		549
		550	//+GPL
559		551
560	/*	552	/*
561	* Creates an object. This function is called by get_archetype()	553	* Creates an object. This function is called by get_archetype()
562	* if it fails to find the appropriate archetype.	554	* if it fails to find the appropriate archetype.
563	* Thus get_archetype() will be guaranteed to always return	555	* Thus get_archetype() will be guaranteed to always return
564	* an object, and never NULL.	556	* an object, and never NULL.
565	*/	557	*/
566	object *	558	object *
567	create_singularity (const char *name)	559	create_singularity (const char *name)
568	{	560	{
569	object *op;	561	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
570	char buf[MAX_BUF];
571		562
572	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	563	if (!strcmp (name, "bug"))
573	op = object::create ();	564	abort ();
574	op->name = op->name_pl = buf;	565
575	SET_FLAG (op, FLAG_NO_PICK);	566	object *op = archetype::get (shstr_bug);
		567	op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
		568
576	return op;	569	return op;
577	}	570	}
578		571
579	/*	572	/*
580	* Finds which archetype matches the given name, and returns a new	573	* Finds which archetype matches the given name, and returns a new
581	* object containing a copy of the archetype.	574	* object containing a copy of the archetype.
582	*/	575	*/
583	object *	576	object *
584	get_archetype (const char *name)	577	get_archetype (const char *name)
585	{	578	{
		579	return archetype::get (name);
		580	}
		581
		582	object *
		583	archetype::get (const char *name)
		584	{
586	archetype *at = archetype::find (name);	585	archetype *at = find (name);
587		586
588	if (!at)	587	if (!at)
589	return create_singularity (name);	588	return create_singularity (name);
590		589
591	return arch_to_object (at);	590	return at->instance ();
592	}
593
594	/*
595	* Hash-function used by the arch-hashtable.
596	*/
597
598	unsigned long
599	hasharch (const char *str, int tablesize)
600	{
601	unsigned long hash = 0;
602	unsigned int i = 0;
603	const char *p;
604
605	/* use the one-at-a-time hash function, which supposedly is
606	* better than the djb2-like one used by perl5.005, but
607	* certainly is better then the bug used here before.
608	* see http://burtleburtle.net/bob/hash/doobs.html
609	*/
610	for (p = str; i < MAXSTRING && *p; p++, i++)
611	{
612	hash += *p;
613	hash += hash << 10;
614	hash ^= hash >> 6;
615	}
616
617	hash += hash << 3;
618	hash ^= hash >> 11;
619	hash += hash << 15;
620
621	return hash % tablesize;
622	}
623
624	/*
625	* Finds, using the hashtable, which archetype matches the given name.
626	* returns a pointer to the found archetype, otherwise NULL.
627	*/
628	archetype *
629	archetype::find (const char *name)
630	{
631	if (!name)
632	return 0;
633
634	AUTODECL (i, ht.find (name));
635
636	if (i == ht.end ())
637	return 0;
638	else
639	return i->second;
640	}
641
642	/*
643	* Adds an archetype to the hashtable.
644	*/
645	void
646	archetype::hash_add ()
647	{
648	ht.insert (std::make_pair (name, this));
649	}
650
651	void
652	archetype::hash_del ()
653	{
654	ht.erase (name);
655	}	591	}
656		592
657	/*	593	/*
658	* Returns the first archetype using the given type.	594	* Returns the first archetype using the given type.
659	* Used in treasure-generation.	595	* Used in treasure-generation.
660	*/	596	*/
661	archetype *	597	archetype *
662	type_to_archetype (int type)	598	type_to_archetype (int type)
663	{	599	{
664	archetype *at;	600	for_all_archetypes (at)
665		601	if (at->type == type && at->head_ () != at)
666	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
667	if (at->clone.type == type)
668	return at;	602	return at;
669		603
670	return 0;	604	return 0;
671	}	605	}
672		606
673	/*	607	/*
674	* Returns a new object copied from the first archetype matching	608	* Returns a new object copied from the first archetype matching
675	* the given type.	609	* the given type.
676	* Used in treasure-generation.	610	* Used in treasure-generation.
677	*/	611	*/
678
679	object *	612	object *
680	clone_arch (int type)	613	clone_arch (int type)
681	{	614	{
682	archetype *at;	615	archetype *at = type_to_archetype (type);
683		616
684	if ((at = type_to_archetype (type)) == NULL)	617	if (!at)
685	{	618	{
686	LOG (llevError, "Can't clone archetype %d\n", type);	619	LOG (llevError, "Can't clone archetype %d\n", type);
687	return 0;	620	return 0;
688	}	621	}
689		622
690	object *op = at->clone.clone ();	623	return at->instance ();
691	op->instantiate ();
692	return op;
693	}	624	}
694		625
695	/*	626	/*
696	* member: make instance from class	627	* member: make instance from class
697	*/	628	*/
698
699	object *	629	object *
700	object_create_arch (archetype *at)	630	object_create_arch (archetype *at)
701	{	631	{
702	object op, prev = 0, *head = 0;	632	object op, prev = 0, *head = 0;
703		633
704	while (at)	634	while (at)
705	{	635	{
706	op = arch_to_object (at);	636	op = at->instance ();
		637
707	op->x = at->clone.x;	638	op->x = at->x;
708	op->y = at->clone.y;	639	op->y = at->y;
709		640
710	if (head)	641	if (head)
711	op->head = head, prev->more = op;	642	op->head = head, prev->more = op;
712		643
713	if (!head)	644	if (!head)
714	head = op;	645	head = op;
715		646
716	prev = op;	647	prev = op;
717	at = at->more;	648	at = (archetype *)at->more;
718	}	649	}
719		650
720	return (head);	651	return head;
721	}	652	}
722		653
		654	//-GPL
		655

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.40 by root, Fri Feb 2 22:08:23 2007 UTC vs. Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.40 by root, Fri Feb 2 22:08:23 2007 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC