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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.12 by root, Mon Sep 4 17:16:19 2006 UTC vs.
Revision 1.84 by root, Mon Sep 29 10:31:32 2008 UTC

…		…
1	/*	1	/*
2	* static char *rcsid_arch_c =	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	* "$Id: arch.C,v 1.12 2006/09/04 17:16:19 root Exp $";	3	*
4	*/	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5
6	/*
7	CrossFire, A Multiplayer game for X-windows
8
9	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
10	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
11		7	*
12	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
13	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
14	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
15	(at your option) any later version.	11	* (at your option) any later version.
16		12	*
17	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,
18	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
19	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20	GNU General Public License for more details.	16	* GNU General Public License for more details.
21		17	*
22	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
23	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
24	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
25		21	* The authors can be reached via e-mail to <support@deliantra.net>
26	The authors can be reached via e-mail at crossfire-devel@real-time.com
27	*/	22	*/
28		23
29	#include <cassert>	24	#include <cassert>
30		25
		26	#include <global.h>
		27	#include <loader.h>
		28
		29	#include <tr1/functional>
31	#include <tr1/unordered_map>	30	#include <tr1/unordered_map>
32		31
33	#include <global.h>	32	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
34	#include <arch.h>	33	arch_ptr archetype::empty;
35	#include <funcpoint.h>
36	#include <loader.h>
37		34
38	/* IF set, does a little timing on the archetype load. */
39	#define TIME_ARCH_LOAD 0
40
41	static void add_arch (archetype * at);
42
43	static archetype *arch_table[ARCHTABLE];
44	int arch_cmp = 0; /* How many strcmp's */
45	int arch_search = 0; /* How many searches */
46	int arch_init; /* True if doing arch initialization */
47
48	/* The naming of these functions is really poor - they are all
49	* pretty much named '.._arch_...', but they may more may not
50	* return archetypes. Some make the arch_to_object call, and thus
51	* return an object. Perhaps those should be called 'archob' functions
52	* to denote they return an object derived from the archetype.
53	* MSW 2003-04-29
54	*/
55
56	#if USE_UNORDERED_MAP
57	// the hashtable	35	// the hashtable
58	typedef std::tr1::unordered_map<size_t, archetype *> HT;	36	typedef std::tr1::unordered_map
		37	<
		38	const char *,
		39	arch_ptr,
		40	str_hash,
		41	str_equal,
		42	slice_allocator< std::pair<const char *const, arch_ptr> >
		43	> HT;
59		44
60	static HT ht;	45	static HT ht (10000);
61	#endif	46	archvec archetypes;
		47	static unordered_vector<archetype *> allarch;
		48	static int dirtycnt;
		49
		50	// the vector of other_arch references to be resolved
		51	static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
		52	// the vector of loaded but not yet committed archetypes
		53	static std::vector<archetype *> postponed_arch;
62		54
63	/**	55	/**
64	* GROS - This function retrieves an archetype given the name that appears	56	* GROS - This function retrieves an archetype given the name that appears
65	* during the game (for example, "writing pen" instead of "stylus").	57	* during the game (for example, "writing pen" instead of "stylus").
66	* It does not use the hashtable system, but browse the whole archlist each time.	58	* It does not use the hashtable system, but browse the whole archlist each time.
72	* - the archetype found or null if nothing was found.	64	* - the archetype found or null if nothing was found.
73	*/	65	*/
74	archetype *	66	archetype *
75	find_archetype_by_object_name (const char *name)	67	find_archetype_by_object_name (const char *name)
76	{	68	{
77	archetype *at;	69	shstr_cmp name_cmp (name);
78		70
79	if (name == NULL)	71	for_all_archetypes (at)
80	return (archetype *) NULL;	72	if (at->name == name_cmp)
81
82	for (at = first_archetype; at != NULL; at = at->next)
83	{
84	if (!strcmp (at->clone.name, name))
85	return at;	73	return at;
86	}	74
87	return NULL;	75	return 0;
88	}	76	}
89		77
90	/**	78	/**
91	* This function retrieves an archetype by type and name that appears during	79	* This function retrieves an archetype by type and name that appears during
92	* the game. It is basically the same as find_archetype_by_object_name()	80	* the game. It is basically the same as find_archetype_by_object_name()
93	* except that it considers only items of the given type.	81	* except that it considers only items of the given type.
94	*/	82	*/
95	archetype *	83	archetype *
96	find_archetype_by_object_type_name (int type, const char *name)	84	find_archetype_by_object_type_name (int type, const char *name)
97	{	85	{
98	archetype *at;	86	shstr_cmp name_cmp (name);
99		87
100	if (name == NULL)	88	for_all_archetypes (at)
101	return NULL;	89	if (at->name == name_cmp && at->type == type)
102
103	for (at = first_archetype; at != NULL; at = at->next)
104	{
105	if (at->clone.type == type && strcmp (at->clone.name, name) == 0)
106	return at;	90	return at;
107	}
108		91
109	return NULL;	92	return 0;
110	}	93	}
111		94
112	/* This is a lot like the above function. Instead, we are trying to match	95	/* This is a lot like the above function. Instead, we are trying to match
113	* the arch->skill values. type is the type of object to match	96	* the arch->skill values. type is the type of object to match
114	* against (eg, to only match against skills or only skill objects for example).	97	* against (eg, to only match against skills or only skill objects for example).
115	* If type is -1, ew don't match on type.	98	* If type is -1, ew don't match on type.
116	*/	99	*/
117	object *	100	object *
118	get_archetype_by_skill_name (const char *skill, int type)	101	get_archetype_by_skill_name (const char *skill, int type)
119	{	102	{
120	archetype *	103	shstr_cmp skill_cmp (skill);
121	at;
122		104
123	if (skill == NULL)	105	for_all_archetypes (at)
124	return NULL;	106	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
		107	return at->instance ();
125		108
126	for (at = first_archetype; at != NULL; at = at->next)
127	{
128	if (((type == -1) \|\| (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))
129	return arch_to_object (at);
130	}
131	return NULL;	109	return 0;
132	}	110	}
133		111
134	/* similiar to above - this returns the first archetype	112	/* similiar to above - this returns the first archetype
135	* that matches both the type and subtype. type and subtype	113	* that matches both the type and subtype. type and subtype
136	* can be -1 to say ignore, but in this case, the match it does	114	* can be -1 to say ignore, but in this case, the match it does
…		…
139	* (eg, skills)	117	* (eg, skills)
140	*/	118	*/
141	archetype *	119	archetype *
142	get_archetype_by_type_subtype (int type, int subtype)	120	get_archetype_by_type_subtype (int type, int subtype)
143	{	121	{
144	archetype *	122	for_all_archetypes (at)
145	at;
146
147	for (at = first_archetype; at != NULL; at = at->next)
148	{
149	if (((type == -1) \|\| (type == at->clone.type)) && (subtype == -1 \|\| subtype == at->clone.subtype))	123	if ((type == -1 \|\| type == at->type) && (subtype == -1 \|\| subtype == at->subtype))
150	return at;	124	return at;
151	}	125
152	return NULL;	126	return 0;
153	}	127	}
154		128
155	/**	129	/**
156	* GROS - this returns a new object given the name that appears during the game	130	* GROS - this returns a new object given the name that appears during the game
157	* (for example, "writing pen" instead of "stylus").	131	* (for example, "writing pen" instead of "stylus").
…		…
159	* - name: The name we're searching for (ex: "writing pen");	133	* - name: The name we're searching for (ex: "writing pen");
160	* Return value:	134	* Return value:
161	* - a corresponding object if found; a singularity object if not found.	135	* - a corresponding object if found; a singularity object if not found.
162	* Note by MSW - it appears that it takes the full name and keeps	136	* Note by MSW - it appears that it takes the full name and keeps
163	* shortening it until it finds a match. I re-wrote this so that it	137	* shortening it until it finds a match. I re-wrote this so that it
164	* doesn't malloc it each time - not that this function is used much,	138	* doesn't allocate it each time - not that this function is used much,
165	* but it otherwise had a big memory leak.	139	* but it otherwise had a big memory leak.
166	*/	140	*/
167	object *	141	object *
168	get_archetype_by_object_name (const char *name)	142	get_archetype_by_object_name (const char *name)
169	{	143	{
170	archetype *
171	at;
172	char
173	tmpname[MAX_BUF];	144	char tmpname[MAX_BUF];
174	int	145	int i;
175	i;
176		146
177	strncpy (tmpname, name, MAX_BUF - 1);	147	assign (tmpname, name);
178	tmpname[MAX_BUF - 1] = 0;	148
179	for (i = strlen (tmpname); i > 0; i--)	149	for (i = strlen (tmpname); i > 0; i--)
180	{	150	{
181	tmpname[i] = 0;	151	tmpname[i] = 0;
		152
182	at = find_archetype_by_object_name (tmpname);	153	if (archetype *at = find_archetype_by_object_name (tmpname))
183	if (at != NULL)	154	return at->instance ();
184	{
185	return arch_to_object (at);
186	}
187	}	155	}
		156
188	return create_singularity (name);	157	return create_singularity (name);
189	}	158	}
190		159
191	/* This is a subset of the parse_id command. Basically, name can be	160	/* This is a subset of the parse_id command. Basically, name can be
192	* a string seperated lists of things to match, with certain keywords.	161	* a string seperated lists of things to match, with certain keywords.
193	* pl is the player (only needed to set count properly)	162	* pl is the player (only needed to set count properly)
194	* op is the item we are trying to match. Calling function takes care	163	* op is the item we are trying to match. Calling function takes care
195	* of what action might need to be done and if it is valid	164	* of what action might need to be done and if it is valid
196	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher	165	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
197	* value means a better match. 0 means no match.	166	* value means a better match. 0 means no match.
198	*	167	*
199	* Brief outline of the procedure:	168	* Brief outline of the procedure:
200	* We take apart the name variable into the individual components.	169	* We take apart the name variable into the individual components.
201	* cases for 'all' and unpaid are pretty obvious.	170	* cases for 'all' and unpaid are pretty obvious.
202	* Next, we check for a count (either specified in name, or in the	171	* Next, we check for a count (either specified in name, or in the
203	* player object.)	172	* player object.)
204	* If count is 1, make a quick check on the name.	173	* If count is 1, make a quick check on the name.
205	* IF count is >1, we need to make plural name. Return if match.	174	* IF count is >1, we need to make plural name. Return if match.
206	* Last, make a check on the full name.	175	* Last, make a check on the full name.
207	*/	176	*/
208	int	177	int
209	item_matched_string (object * pl, object * op, const char *name)	178	item_matched_string (object pl, object op, const char *name)
210	{	179	{
211	char *
212	cp,
213	local_name[MAX_BUF];	180	char *cp, local_name[MAX_BUF];
214	int	181	int count, retval = 0;
215	count,	182
216	retval = 0;
217	strcpy (local_name, name); /* strtok is destructive to name */	183	assign (local_name, name); /* strtok is destructive to name */
218		184
219	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))	185	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
220	{	186	{
221	while (cp[0] == ' ')	187	while (cp[0] == ' ')
222	++cp; /* get rid of spaces */	188	++cp; /* get rid of spaces */
…		…
272	retval = 15;	238	retval = 15;
273	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	239	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
274	retval = 14;	240	retval = 14;
275	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	241	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
276	retval = 14;	242	retval = 14;
277
278	/* Do substring checks, so things like 'Str+1' will match.	243	/* Do substring checks, so things like 'Str+1' will match.
279	* retval of these should perhaps be lower - they are lower	244	* retval of these should perhaps be lower - they are lower
280	* then the specific strcasecmp aboves, but still higher than	245	* then the specific strcasecmp aboves, but still higher than
281	* some other match criteria.	246	* some other match criteria.
282	*/	247	*/
…		…
284	retval = 12;	249	retval = 12;
285	else if (strstr (query_base_name (op, 0), cp))	250	else if (strstr (query_base_name (op, 0), cp))
286	retval = 12;	251	retval = 12;
287	else if (strstr (query_short_name (op), cp))	252	else if (strstr (query_short_name (op), cp))
288	retval = 12;	253	retval = 12;
289
290	/* Check against plural/non plural based on count. */	254	/* Check against plural/non plural based on count. */
291	else if (count > 1 && !strcasecmp (cp, op->name_pl))	255	else if (count > 1 && !strcasecmp (cp, op->name_pl))
292	{
293	retval = 6;	256	retval = 6;
294	}
295	else if (count == 1 && !strcasecmp (op->name, cp))	257	else if (count == 1 && !strcasecmp (op->name, cp))
296	{
297	retval = 6;	258	retval = 6;
298	}
299	/* base name matched - not bad */	259	/* base name matched - not bad */
300	else if (strcasecmp (cp, op->name) == 0 && !count)	260	else if (strcasecmp (cp, op->name) == 0 && !count)
301	retval = 4;	261	retval = 4;
302	/* Check for partial custom name, but give a real low priority */	262	/* Check for partial custom name, but give a real low priority */
303	else if (op->custom_name && strstr (op->custom_name, cp))	263	else if (op->custom_name && strstr (op->custom_name, cp))
…		…
305		265
306	if (retval)	266	if (retval)
307	{	267	{
308	if (pl->type == PLAYER)	268	if (pl->type == PLAYER)
309	pl->contr->count = count;	269	pl->contr->count = count;
		270
310	return retval;	271	return retval;
311	}	272	}
312	}	273	}
		274
313	return 0;	275	return 0;
314	}	276	}
315		277
		278	archetype::archetype (const char *name)
		279	{
		280	arch = this;
		281	this->archname = this->name = this->name_pl = name;
		282	}
		283
		284	archetype::~archetype ()
		285	{
		286	unlink ();
		287	}
		288
		289	void
		290	archetype::link ()
		291	{
		292	if (!archetypes.contains (this))
		293	{
		294	archetypes.insert (this);
		295	ht.insert (std::make_pair (archname, this));
		296	}
		297	}
		298
		299	void
		300	archetype::unlink ()
		301	{
		302	if (archetypes.contains (this))
		303	{
		304	archetypes.erase (this);
		305	ht.erase (archname);
		306	}
		307	}
		308
316	/*	309	/*
317	* Initialises the internal linked list of archetypes (read from file).	310	* Finds, using the hashtable, which archetype matches the given name.
318	* Then the global "empty_archetype" pointer is initialised.	311	* returns a pointer to the found archetype, otherwise NULL.
319	* Then the blocksview[] array is initialised.
320	*/	312	*/
		313	archetype *
		314	archetype::find (const char *name)
		315	{
		316	if (!name)
		317	return 0;
		318
		319	auto (i, ht.find (name));
		320
		321	if (i == ht.end ())
		322	return 0;
		323	else
		324	return i->second;
		325	}
		326
		327	archetype *
		328	archetype::read (object_thawer &f)
		329	{
		330	assert (f.kw == KW_object);
		331
		332	std::vector<archetype *> parts;
		333
		334	coroapi::cede_to_tick ();
		335
		336	for (;;)
		337	{
		338	archetype *at = new archetype (f.get_str ());
		339
		340	f.next ();
		341
		342	#if 0
		343	// implementing it here in the server does neither allow multiple inheritence
		344	// nor does it cleanly "just override". it would allow use in map files, though,
		345	// and other resource files dynamically laoded (as opposed to being preprocessed).
		346	// not that any of this is relevant as of yet...
		347	if (f.kw == KW_inherit)
		348	{
		349	if (archetype *at = find (f.get_str ()))
		350	*op = at->clone;
		351	else
		352	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		353	&at->archname, f.get_str ());
		354
		355	f.next ();
		356	}
		357	#endif
		358
		359	loading_arch = at; // hack to tell parse_kv et al. to behave
		360	bool parse_ok = at->parse_kv (f);
		361	loading_arch = 0;
		362
		363	if (!parse_ok)
		364	goto fail;
		365
		366	loading_arch = at; // hack to tell parse_kv et al. to behave
		367	at->post_load_check ();
		368	loading_arch = 0;
		369
		370	parts.push_back (at);
		371
		372	if (f.kw != KW_more)
		373	break;
		374
		375	f.next ();
		376
		377	if (f.kw != KW_object)
		378	{
		379	f.parse_error ("more object");
		380	goto fail;
		381	}
		382	}
		383
		384	{
		385	auto (at, parts.begin ());
		386
		387	archetype *new_head = parts.front ();
		388	archetype *old_head = find (new_head->archname);
		389
		390	if (old_head && !old_head->is_head ())
		391	{
		392	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		393	&new_head->archname, &old_head->archname);
		394	goto fail;
		395	}
		396
		397	// check that all archetypes belong to the same old object or are new
		398	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		399	{
		400	archetype new_part = at;
		401	archetype *old_part = find (new_part->archname);
		402
		403	if (old_part && old_part->head_ () != old_head)
		404	{
		405	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		406	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		407	goto fail;
		408	}
		409	}
		410
		411	// assemble new chain
		412	new_head->min_x = new_head->max_x = new_head->x;
		413	new_head->min_y = new_head->max_y = new_head->y;
		414
		415	archetype *less = new_head;
		416	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		417	{
		418	archetype at = p;
		419
		420	// some flags get inherited from the head (probably a lot more)
		421	// doing it here doesn't feel too cozy, but it allows code
		422	// to ignore head checks for these flags, which saves time
		423	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		424	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		425	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		426	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		427
		428	new_head->min_x = min (new_head->min_x, at->x);
		429	new_head->min_y = min (new_head->min_y, at->y);
		430	new_head->max_x = max (new_head->max_x, at->x);
		431	new_head->max_y = max (new_head->max_y, at->y);
		432
		433	at->head = new_head;
		434	less->more = at;
		435	less = at;
		436	}
		437
		438	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
		439
		440	return new_head;
		441	}
		442
		443	fail:
		444	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		445	(*p)->destroy (true);
		446
		447	return 0;
		448	}
321		449
322	void	450	void
323	init_archetypes (void)	451	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
324	{ /* called from add_player() and edit() */	452	{
325	if (first_archetype != NULL) /* Only do this once */	453	ref = 0;
326	return;	454	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
327	arch_init = 1;
328	load_archetypes ();
329	arch_init = 0;
330	empty_archetype = find_archetype ("empty_archetype");
331	/* init_blocksview();*/
332	}	455	}
333
334	/*
335	* Stores debug-information about how efficient the hashtable
336	* used for archetypes has been in the static errmsg array.
337	*/
338		456
339	void	457	void
340	arch_info (object * op)	458	archetype::commit_load ()
341	{	459	{
342	sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);	460	// unlink old archetypes and link in new ones */
343	new_draw_info (NDI_BLACK, 0, op, errmsg);	461	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
344	}	462	{
		463	archetype at = p;
345		464
346	/*	465	if (archetype *old = find (at->archname))
347	* Initialise the hashtable used by the archetypes.	466	old->unlink ();
348	*/	467
		468	allarch.push_back (at);
		469
		470	at->link ();
		471	++dirtycnt;
		472	}
		473
		474	postponed_arch.clear ();
		475
		476	// now resolve arch references
		477	for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
		478	{
		479	arch_ptr *ap = p->first;
		480	archetype *at = find (p->second);
		481
		482	if (!at)
		483	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		484
		485	*ap = at;
		486	}
		487
		488	postponed_arch_ref.clear ();
		489
		490	empty = find (shstr_empty_archetype);
		491	}
349		492
350	void	493	void
351	clear_archetable (void)	494	archetype::gc ()
352	{	495	{
353	memset ((void ) arch_table, 0, ARCHTABLE sizeof (archetype *));	496	int cnt = max (1, min (allarch.size () / 128, dirtycnt));
354	}	497	dirtycnt = max (0, dirtycnt - cnt);
355		498
356	/*	499	do
357	* An alternative way to init the hashtable which is slower, but _works_...
358	*/
359
360	void
361	init_archetable (void)
362	{
363	archetype *at;
364
365	LOG (llevDebug, " Setting up archetable...\n");
366
367	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
368	add_arch (at);
369
370	LOG (llevDebug, "done\n");
371	}
372
373	/*
374	* Dumps an archetype to debug-level output.
375	*/
376
377	void
378	dump_arch (archetype * at)
379	{
380	dump_object (&at->clone);
381	}
382
383	/*
384	* Dumps _all_ archetypes to debug-level output.
385	* If you run crossfire with debug, and enter DM-mode, you can trigger
386	* this with the O key.
387	*/
388
389	void
390	dump_all_archetypes (void)
391	{
392	archetype *
393	at;
394	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
395	{
396	dump_arch (at);
397	fprintf (logfile, "%s\n", errmsg);
398	}	500	{
399	}	501	static int idx;
400		502
401	void	503	if (idx >= allarch.size ())
402	free_all_archs (void)	504	if (idx)
403	{	505	idx = 0;
404	archetype *	506	else
405	at, *	507	return;
406	next;
407	int
408	i = 0, f = 0;
409		508
410	for (at = first_archetype; at != NULL; at = next)	509	archetype *at = allarch [idx];
411	{	510
412	if (at->more)	511	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
413	next = at->more;	512	++idx;
414	else	513	else
415	next = at->next;
416
417	delete
418	at;
419	i++;
420	}
421	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
422	}
423
424	/*
425	* Allocates, initialises and returns the pointer to an archetype structure.
426	*/
427	// TODO: should become constructor
428	archetype *
429	get_archetype_struct (void)
430	{
431	archetype *
432	arch;
433
434	arch = new archetype;
435
436	clear_object (&arch->clone); /* to initial state other also */
437	CLEAR_FLAG (&arch->clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */
438	SET_FLAG (&arch->clone, FLAG_REMOVED); /* doesn't copy these flags... */
439
440	return arch;
441	}
442
443	/*
444	* Reads/parses the archetype-file, and copies into a linked list
445	* of archetype-structures.
446	*/
447	void
448	first_arch_pass (object_thawer & fp)
449	{
450	object *
451	op;
452	archetype *
453	at, *
454	head = NULL, *last_more = NULL;
455	int
456	i;
457
458	op = get_object ();
459	op->arch = first_archetype = at = get_archetype_struct ();
460
461	while ((i = load_object (fp, op, 0)))
462	{
463	copy_object (op, &at->clone);
464	at->clone.speed_left = (float) (-0.1);
465	/* copy the body_info to the body_used - this is only really
466	* need for monsters, but doesn't hurt to do it for everything.
467	* by doing so, when a monster is created, it has good starting
468	* values for the body_used info, so when items are created
469	* for it, they can be properly equipped.
470	*/
471	memcpy (&at->clone.body_used, &op->body_info, sizeof (op->body_info));
472
473	switch (i)
474	{	514	{
475	case LL_NORMAL: /* A new archetype, just link it with the previous */	515	LOG (llevDebug, "garbage collect arch %s", at->debug_desc ());
476	if (last_more != NULL)	516	assert (at->arch == at); // verify that refcnt == 1 is truly valid
477	last_more->next = at;	517	allarch.erase (idx);
478	if (head != NULL)	518
479	head->next = at;
480	head = last_more = at;
481	#if 0
482	if (!op->type)
483	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
484	#endif
485	at->tail_x = 0;
486	at->tail_y = 0;
487	break;	519	// break chain
488		520	for (object *op = at->head_ (); op; )
489	case LL_MORE: /* Another part of the previous archetype, link it correctly */
490
491	at->head = head;
492	at->clone.head = &head->clone;
493	if (last_more != NULL)
494	{	521	{
		522	object *next = op->more;
		523	op->head = 0;
495	last_more->more = at;	524	op->more = 0;
496	last_more->clone.more = &at->clone;	525	op = next;
497	}	526	}
498	last_more = at;
499		527
500	/* If this multipart image is still composed of individual small	528	at->destroy (true);
501	* images, don't set the tail_.. values. We can't use them anyways,	529	at->arch = 0;
502	* and setting these to zero makes the map sending to the client much
503	* easier as just looking at the head, we know what to do.
504	*/
505	if (at->clone.face != head->clone.face)
506	{
507	head->tail_x = 0;
508	head->tail_y = 0;
509	}
510	else
511	{
512	if (at->clone.x > head->tail_x)
513	head->tail_x = at->clone.x;
514	if (at->clone.y > head->tail_y)
515	head->tail_y = at->clone.y;
516	}
517	break;
518
519	}	530	}
520
521	at = get_archetype_struct ();
522	clear_object (op);
523	op->arch = at;
524	}
525
526	delete
527	at;
528	free_object (op);
529	}
530
531	/*
532	* Reads the archetype file once more, and links all pointers between
533	* archetypes.
534	*/
535
536	void
537	second_arch_pass (object_thawer & thawer)
538	{
539	char
540	buf[MAX_BUF], *
541	variable = buf, argument, cp;
542	archetype *
543	at = NULL, *other;
544
545	while (fgets (buf, MAX_BUF, thawer) != NULL)
546	{	531	}
547	if (*buf == '#')	532	while (--cnt);
548	continue;
549	if ((argument = strchr (buf, ' ')) != NULL)
550	{
551	*argument = '\0', argument++;
552	cp = argument + strlen (argument) - 1;
553	while (isspace (*cp))
554	{
555	*cp = '\0';
556	cp--;
557	}
558	}
559	if (!strcmp ("Object", variable))
560	{
561	if ((at = find_archetype (argument)) == NULL)
562	LOG (llevError, "Warning: failed to find arch %s\n", argument);
563	}
564	else if (!strcmp ("other_arch", variable))
565	{
566	if (at != NULL && at->clone.other_arch == NULL)
567	{
568	if ((other = find_archetype (argument)) == NULL)
569	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
570	else if (at != NULL)
571	at->clone.other_arch = other;
572	}
573	}
574	else if (!strcmp ("randomitems", variable))
575	{
576	if (at != NULL)
577	{
578	treasurelist *
579	tl = find_treasurelist (argument);
580	if (tl == NULL)
581	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
582	else
583	at->clone.randomitems = tl;
584	}
585	}
586	}
587	}	533	}
588		534
589	#ifdef DEBUG
590	void
591	check_generators (void)
592	{
593	archetype *
594	at;
595	for (at = first_archetype; at != NULL; at = at->next)
596	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
597	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
598	}
599	#endif
600
601	/*
602	* First initialises the archtype hash-table (init_archetable()).
603	* Reads and parses the archetype file (with the first and second-pass
604	* functions).
605	* Then initialises treasures by calling load_treasures().
606	*/
607
608	void
609	load_archetypes (void)
610	{
611	char
612	filename[MAX_BUF];
613	int
614	comp;
615	#if TIME_ARCH_LOAD
616	struct timeval
617	tv1,
618	tv2;
619	#endif
620
621	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
622	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
623
624	{
625	object_thawer
626	thawer (filename);
627
628	clear_archetable ();
629	LOG (llevDebug, " arch-pass 1...\n");
630	first_arch_pass (thawer);
631	LOG (llevDebug, " done\n");
632	}
633
634	init_archetable ();
635	warn_archetypes = 1;
636
637	{
638	object_thawer
639	thawer (filename);
640
641	LOG (llevDebug, " loading treasure...\n");
642	load_treasures ();
643	LOG (llevDebug, " done\n arch-pass 2...\n");
644	second_arch_pass (thawer);
645	LOG (llevDebug, " done\n");
646	#ifdef DEBUG
647	check_generators ();
648	#endif
649	}
650	LOG (llevDebug, " done\n");
651	}
652
653	/*
654	* Creates and returns a new object which is a copy of the given archetype.
655	* This function returns NULL on failure.
656	*/
657
658	object *
659	arch_to_object (archetype * at)
660	{
661	object *	535	object *
662	op;	536	archetype::instance ()
663	if (at == NULL)	537	{
664	{	538	object *op = clone ();
665	if (warn_archetypes)
666	LOG (llevError, "Couldn't find archetype.\n");
667	return NULL;
668	}
669	op = get_object ();
670	copy_object (&at->clone, op);
671	op->instantiate ();	539	op->instantiate ();
672	op->arch = at;
673	return op;	540	return op;
674	}	541	}
675		542
676	/*	543	/*
677	* Creates an object. This function is called by get_archetype()	544	* Creates an object. This function is called by get_archetype()
678	* if it fails to find the appropriate archetype.	545	* if it fails to find the appropriate archetype.
679	* Thus get_archetype() will be guaranteed to always return	546	* Thus get_archetype() will be guaranteed to always return
680	* an object, and never NULL.	547	* an object, and never NULL.
681	*/	548	*/
682
683	object *	549	object *
684	create_singularity (const char *name)	550	create_singularity (const char *name)
685	{	551	{
686	object *	552	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
687	op;	553
688	char	554	if (!strcmp (name, "bug"))
689	buf[MAX_BUF];	555	abort ();
690	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	556
691	op = get_object ();	557	object *op = archetype::get (shstr_bug);
692	op->name = op->name_pl = buf;	558	op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
693	SET_FLAG (op, FLAG_NO_PICK);	559
694	return op;	560	return op;
695	}	561	}
696		562
697	/*	563	/*
698	* Finds which archetype matches the given name, and returns a new	564	* Finds which archetype matches the given name, and returns a new
699	* object containing a copy of the archetype.	565	* object containing a copy of the archetype.
700	*/	566	*/
701
702	object *	567	object *
703	get_archetype (const char *name)	568	get_archetype (const char *name)
704	{	569	{
705	archetype *	570	return archetype::get (name);
706	at;	571	}
707	at = find_archetype (name);	572
708	if (at == NULL)	573	object *
		574	archetype::get (const char *name)
		575	{
		576	archetype *at = find (name);
		577
		578	if (!at)
709	return create_singularity (name);	579	return create_singularity (name);
710	return arch_to_object (at);
711	}
712		580
713	/*	581	return at->instance ();
714	* Hash-function used by the arch-hashtable.
715	*/
716
717	unsigned long
718	hasharch (const char *str, int tablesize)
719	{
720	unsigned long
721	hash = 0;
722	unsigned int
723	i = 0;
724	const char *
725	p;
726
727	/* use the one-at-a-time hash function, which supposedly is
728	* better than the djb2-like one used by perl5.005, but
729	* certainly is better then the bug used here before.
730	* see http://burtleburtle.net/bob/hash/doobs.html
731	*/
732	for (p = str; i < MAXSTRING && *p; p++, i++)
733	{
734	hash += *p;
735	hash += hash << 10;
736	hash ^= hash >> 6;
737	}
738
739	hash += hash << 3;
740	hash ^= hash >> 11;
741	hash += hash << 15;
742
743	return hash % tablesize;
744	}
745
746	/*
747	* Finds, using the hashtable, which archetype matches the given name.
748	* returns a pointer to the found archetype, otherwise NULL.
749	*/
750
751	archetype *
752	find_archetype (const char *name)
753	{
754	#if USE_UNORDERED_MAP
755	name = shstr::find (name);
756
757	if (!name)
758	return 0;
759
760	HT::const_iterator i = ht.find ((size_t)name);
761
762	if (i == ht.end ())
763	return 0;
764	else
765	return i->second;
766	#endif
767
768	archetype *at;
769	unsigned long index;
770
771	if (name == NULL)
772	return (archetype *) NULL;
773
774	index = hasharch (name, ARCHTABLE);
775	arch_search++;
776	for (;;)
777	{
778	at = arch_table[index];
779	if (at == NULL)
780	{
781	if (warn_archetypes)
782	LOG (llevError, "Couldn't find archetype %s\n", name);
783	return NULL;
784	}
785	arch_cmp++;
786	if (!strcmp ((const char *) at->name, name))
787	return at;
788	if (++index >= ARCHTABLE)
789	index = 0;
790	}
791	}
792
793	/*
794	* Adds an archetype to the hashtable.
795	*/
796
797	static void
798	add_arch (archetype *at)
799	{
800	#if USE_UNORDERED_MAP
801	ht.insert (std::make_pair ((size_t)(const char *)at->name, at));
802	#endif
803
804	int index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index;
805
806	for (;;)
807	{
808	if (arch_table[index] == NULL)
809	{
810	arch_table[index] = at;
811	return;
812	}
813
814	if (++index == ARCHTABLE)
815	index = 0;
816
817	if (index == org_index)
818	fatal (ARCHTABLE_TOO_SMALL);
819	}
820	}	582	}
821		583
822	/*	584	/*
823	* Returns the first archetype using the given type.	585	* Returns the first archetype using the given type.
824	* Used in treasure-generation.	586	* Used in treasure-generation.
825	*/	587	*/
826
827	archetype *	588	archetype *
828	type_to_archetype (int type)	589	type_to_archetype (int type)
829	{	590	{
830	archetype *	591	for_all_archetypes (at)
831	at;	592	if (at->type == type && at->head_ () != at)
832
833	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
834	if (at->clone.type == type)
835	return at;	593	return at;
		594
836	return NULL;	595	return 0;
837	}	596	}
838		597
839	/*	598	/*
840	* Returns a new object copied from the first archetype matching	599	* Returns a new object copied from the first archetype matching
841	* the given type.	600	* the given type.
842	* Used in treasure-generation.	601	* Used in treasure-generation.
843	*/	602	*/
844
845	object *	603	object *
846	clone_arch (int type)	604	clone_arch (int type)
847	{	605	{
848	archetype *	606	archetype *at = type_to_archetype (type);
849	at;
850	object *
851	op = get_object ();
852		607
853	if ((at = type_to_archetype (type)) == NULL)	608	if (!at)
854	{	609	{
855	LOG (llevError, "Can't clone archetype %d\n", type);	610	LOG (llevError, "Can't clone archetype %d\n", type);
856	free_object (op);
857	return NULL;	611	return 0;
858	}	612	}
859	copy_object (&at->clone, op);	613
860	op->instantiate ();	614	return at->instance ();
861	return op;
862	}	615	}
863		616
864	/*	617	/*
865	* member: make instance from class	618	* member: make instance from class
866	*/	619	*/
867
868	object *	620	object *
869	object_create_arch (archetype * at)	621	object_create_arch (archetype *at)
870	{	622	{
871	object *	623	object op, prev = 0, *head = 0;
872	op, *
873	prev = NULL, *head = NULL;
874		624
875	while (at)	625	while (at)
876	{	626	{
877	op = arch_to_object (at);	627	op = at->instance ();
		628
878	op->x = at->clone.x;	629	op->x = at->x;
879	op->y = at->clone.y;	630	op->y = at->y;
		631
880	if (head)	632	if (head)
881	op->head = head, prev->more = op;	633	op->head = head, prev->more = op;
		634
882	if (!head)	635	if (!head)
883	head = op;	636	head = op;
		637
884	prev = op;	638	prev = op;
885	at = at->more;	639	at = (archetype *)at->more;
886	}	640	}
		641
887	return (head);	642	return head;
888	}	643	}
889		644
890	/* end of arch.c */

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.12 by root, Mon Sep 4 17:16:19 2006 UTC vs. Revision 1.84 by root, Mon Sep 29 10:31:32 2008 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.12 by root, Mon Sep 4 17:16:19 2006 UTC vs.
Revision 1.84 by root, Mon Sep 29 10:31:32 2008 UTC