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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.21 by root, Thu Sep 14 22:33:58 2006 UTC vs.
Revision 1.89 by root, Mon Oct 12 14:00:57 2009 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.21 by root, Thu Sep 14 22:33:58 2006 UTC vs. Revision 1.89 by root, Mon Oct 12 14:00:57 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.21 by root, Thu Sep 14 22:33:58 2006 UTC vs.
Revision 1.89 by root, Mon Oct 12 14:00:57 2009 UTC