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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.13 by pippijn, Thu Sep 7 09:37:11 2006 UTC vs.
Revision 1.74 by root, Sun Apr 20 05:24:55 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.13 2006/09/07 09:37:11 pippijn 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
31	#include <tr1/unordered_map>
32
33	#include <global.h>	26	#include <global.h>
34	#include <arch.h>
35	#include <funcpoint.h>	27	#include <funcpoint.h>
36	#include <loader.h>	28	#include <loader.h>
37		29
38	/* IF set, does a little timing on the archetype load. */	30	#include <tr1/functional>
39	#define TIME_ARCH_LOAD 0	31	#include <tr1/unordered_map>
40		32
41	static void add_arch (archetype * at);	33	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
		34	arch_ptr archetype::empty;
42		35
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	36	// the hashtable
58	typedef std::tr1::unordered_map<size_t, archetype *> HT;	37	typedef std::tr1::unordered_map
		38	<
		39	const char *,
		40	arch_ptr,
		41	str_hash,
		42	str_equal,
		43	slice_allocator< std::pair<const char *const, arch_ptr> >
		44	> HT;
59		45
60	static HT ht;	46	static HT ht (10000);
61	#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;
62		55
63	/**	56	/**
64	* GROS - This function retrieves an archetype given the name that appears	57	* GROS - This function retrieves an archetype given the name that appears
65	* during the game (for example, "writing pen" instead of "stylus").	58	* 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.	59	* It does not use the hashtable system, but browse the whole archlist each time.
72	* - the archetype found or null if nothing was found.	65	* - the archetype found or null if nothing was found.
73	*/	66	*/
74	archetype *	67	archetype *
75	find_archetype_by_object_name (const char *name)	68	find_archetype_by_object_name (const char *name)
76	{	69	{
77	archetype *at;	70	shstr_cmp name_cmp (name);
78		71
79	if (name == NULL)	72	for_all_archetypes (at)
80	return (archetype *) NULL;	73	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;	74	return at;
86	}	75
87	return NULL;	76	return 0;
88	}	77	}
89		78
90	/**	79	/**
91	* 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
92	* 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()
93	* except that it considers only items of the given type.	82	* except that it considers only items of the given type.
94	*/	83	*/
95	archetype *	84	archetype *
96	find_archetype_by_object_type_name (int type, const char *name)	85	find_archetype_by_object_type_name (int type, const char *name)
97	{	86	{
98	archetype *at;	87	shstr_cmp name_cmp (name);
99		88
100	if (name == NULL)	89	for_all_archetypes (at)
101	return NULL;	90	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;	91	return at;
107	}
108		92
109	return NULL;	93	return 0;
110	}	94	}
111		95
112	/* 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
113	* 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
114	* 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).
115	* If type is -1, ew don't match on type.	99	* If type is -1, ew don't match on type.
116	*/	100	*/
117	object *	101	object *
118	get_archetype_by_skill_name (const char *skill, int type)	102	get_archetype_by_skill_name (const char *skill, int type)
119	{	103	{
120	archetype *	104	shstr_cmp skill_cmp (skill);
121	at;
122		105
123	if (skill == NULL)	106	for_all_archetypes (at)
124	return NULL;	107	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
125
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);	108	return arch_to_object (at);
130	}	109
131	return NULL;	110	return 0;
132	}	111	}
133		112
134	/* similiar to above - this returns the first archetype	113	/* similiar to above - this returns the first archetype
135	* that matches both the type and subtype. type and subtype	114	* 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	115	* can be -1 to say ignore, but in this case, the match it does
…		…
139	* (eg, skills)	118	* (eg, skills)
140	*/	119	*/
141	archetype *	120	archetype *
142	get_archetype_by_type_subtype (int type, int subtype)	121	get_archetype_by_type_subtype (int type, int subtype)
143	{	122	{
144	archetype *	123	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))	124	if ((type == -1 \|\| type == at->type) && (subtype == -1 \|\| subtype == at->subtype))
150	return at;	125	return at;
151	}	126
152	return NULL;	127	return 0;
153	}	128	}
154		129
155	/**	130	/**
156	* 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
157	* (for example, "writing pen" instead of "stylus").	132	* (for example, "writing pen" instead of "stylus").
…		…
165	* but it otherwise had a big memory leak.	140	* but it otherwise had a big memory leak.
166	*/	141	*/
167	object *	142	object *
168	get_archetype_by_object_name (const char *name)	143	get_archetype_by_object_name (const char *name)
169	{	144	{
170	archetype *
171	at;
172	char
173	tmpname[MAX_BUF];	145	char tmpname[MAX_BUF];
174	int	146	int i;
175	i;
176		147
177	strncpy (tmpname, name, MAX_BUF - 1);	148	assign (tmpname, name);
178	tmpname[MAX_BUF - 1] = 0;	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	if (at != NULL)
184	{
185	return arch_to_object (at);	155	return arch_to_object (at);
186	}
187	}	156	}
		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,	183
216	retval = 0;
217	strcpy (local_name, name); /* strtok is destructive to name */	184	assign (local_name, name); /* strtok is destructive to name */
218		185
219	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))	186	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
220	{	187	{
221	while (cp[0] == ' ')	188	while (cp[0] == ' ')
222	++cp; /* get rid of spaces */	189	++cp; /* get rid of spaces */
…		…
272	retval = 15;	239	retval = 15;
273	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	240	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
274	retval = 14;	241	retval = 14;
275	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	242	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
276	retval = 14;	243	retval = 14;
277
278	/* Do substring checks, so things like 'Str+1' will match.	244	/* Do substring checks, so things like 'Str+1' will match.
279	* retval of these should perhaps be lower - they are lower	245	* retval of these should perhaps be lower - they are lower
280	* then the specific strcasecmp aboves, but still higher than	246	* then the specific strcasecmp aboves, but still higher than
281	* some other match criteria.	247	* some other match criteria.
282	*/	248	*/
…		…
284	retval = 12;	250	retval = 12;
285	else if (strstr (query_base_name (op, 0), cp))	251	else if (strstr (query_base_name (op, 0), cp))
286	retval = 12;	252	retval = 12;
287	else if (strstr (query_short_name (op), cp))	253	else if (strstr (query_short_name (op), cp))
288	retval = 12;	254	retval = 12;
289
290	/* Check against plural/non plural based on count. */	255	/* Check against plural/non plural based on count. */
291	else if (count > 1 && !strcasecmp (cp, op->name_pl))	256	else if (count > 1 && !strcasecmp (cp, op->name_pl))
292	{
293	retval = 6;	257	retval = 6;
294	}
295	else if (count == 1 && !strcasecmp (op->name, cp))	258	else if (count == 1 && !strcasecmp (op->name, cp))
296	{
297	retval = 6;	259	retval = 6;
298	}
299	/* base name matched - not bad */	260	/* base name matched - not bad */
300	else if (strcasecmp (cp, op->name) == 0 && !count)	261	else if (strcasecmp (cp, op->name) == 0 && !count)
301	retval = 4;	262	retval = 4;
302	/* Check for partial custom name, but give a real low priority */	263	/* Check for partial custom name, but give a real low priority */
303	else if (op->custom_name && strstr (op->custom_name, cp))	264	else if (op->custom_name && strstr (op->custom_name, cp))
…		…
305		266
306	if (retval)	267	if (retval)
307	{	268	{
308	if (pl->type == PLAYER)	269	if (pl->type == PLAYER)
309	pl->contr->count = count;	270	pl->contr->count = count;
		271
310	return retval;	272	return retval;
311	}	273	}
312	}	274	}
		275
313	return 0;	276	return 0;
314	}	277	}
315		278
316	/*	279	archetype::archetype (const char *name)
317	* Initialises the internal linked list of archetypes (read from file).	280	{
318	* Then the global "empty_archetype" pointer is initialised.	281	arch = this;
319	* Then the blocksview[] array is initialised.	282	this->archname = this->name = this->name_pl = name;
320	*/	283	}
		284
		285	archetype::~archetype ()
		286	{
		287	unlink ();
		288	}
321		289
322	void	290	void
323	init_archetypes (void)	291	archetype::link ()
324	{ /* called from add_player() and edit() */	292	{
325	if (first_archetype != NULL) /* Only do this once */	293	if (!archetypes.contains (this))
326	return;	294	{
327	arch_init = 1;	295	archetypes.insert (this);
328	load_archetypes ();	296	ht.insert (std::make_pair (archname, this));
329	arch_init = 0;	297	}
330	empty_archetype = find_archetype ("empty_archetype");
331	/* init_blocksview();*/
332	}	298	}
333
334	/*
335	* Stores debug-information about how efficient the hashtable
336	* used for archetypes has been in the static errmsg array.
337	*/
338		299
339	void	300	void
340	arch_info (object * op)	301	archetype::unlink ()
341	{	302	{
342	sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);	303	if (archetypes.contains (this))
343	new_draw_info (NDI_BLACK, 0, op, errmsg);	304	{
		305	archetypes.erase (this);
		306	ht.erase (archname);
		307	}
344	}	308	}
345		309
346	/*	310	/*
347	* Initialise the hashtable used by the archetypes.	311	* Finds, using the hashtable, which archetype matches the given name.
		312	* returns a pointer to the found archetype, otherwise NULL.
348	*/	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 (true);
		447
		448	return 0;
		449	}
349		450
350	void	451	void
351	clear_archetable (void)	452	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
352	{	453	{
353	memset ((void ) arch_table, 0, ARCHTABLE sizeof (archetype *));	454	ref = 0;
		455	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
354	}	456	}
355
356	/*
357	* An alternative way to init the hashtable which is slower, but _works_...
358	*/
359		457
360	void	458	void
361	init_archetable (void)	459	archetype::commit_load ()
362	{	460	{
		461	// unlink old archetypes and link in new ones */
		462	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
		463	{
363	archetype *at;	464	archetype at = p;
364		465
365	LOG (llevDebug, " Setting up archetable...\n");	466	if (archetype *old = find (at->archname))
		467	old->unlink ();
366		468
367	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)	469	allarch.push_back (at);
368	add_arch (at);
369		470
370	LOG (llevDebug, "done\n");	471	at->link ();
371	}	472	++dirtycnt;
		473	}
372		474
373	/*	475	postponed_arch.clear ();
374	* Dumps an archetype to debug-level output.	476
375	*/	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	}
376		493
377	void	494	void
378	dump_arch (archetype * at)	495	archetype::gc ()
379	{	496	{
380	dump_object (&at->clone);	497	int cnt = max (1, min (allarch.size () / 128, dirtycnt));
381	}	498	dirtycnt = max (0, dirtycnt - cnt);
382		499
383	/*	500	do
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	}	501	{
399	}	502	static int idx;
400		503
401	void	504	if (idx >= allarch.size ())
402	free_all_archs (void)	505	if (idx)
403	{	506	idx = 0;
404	archetype *	507	else
405	at, *	508	return;
406	next;
407	int
408	i = 0, f = 0;
409		509
410	for (at = first_archetype; at != NULL; at = next)	510	archetype *at = allarch [idx];
411	{	511
412	if (at->more)	512	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
413	next = at->more;	513	++idx;
414	else	514	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	{	515	{
475	case LL_NORMAL: /* A new archetype, just link it with the previous */	516	LOG (llevDebug, "garbage collect arch %s", at->debug_desc ());
476	if (last_more != NULL)	517	assert (at->arch == at); // verify that refcnt == 1 is truely valid
477	last_more->next = at;	518	allarch.erase (idx);
478	if (head != NULL)
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;	519	at->arch = 0;
486	at->tail_y = 0;
487	break;
488
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	{
495	last_more->more = at;
496	last_more->clone.more = &at->clone;
497	}
498	last_more = at;	520	at->more = 0;
499		521	at->destroy ();
500	/* If this multipart image is still composed of individual small
501	* images, don't set the tail_.. values. We can't use them anyways,
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	}	522	}
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	{	523	}
547	if (*buf == '#')	524	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	}
588
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	#if TIME_ARCH_LOAD
614	struct timeval
615	tv1,
616	tv2;
617	#endif
618
619	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
620	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
621
622	{
623	object_thawer
624	thawer (filename);
625
626	clear_archetable ();
627	LOG (llevDebug, " arch-pass 1...\n");
628	first_arch_pass (thawer);
629	LOG (llevDebug, " done\n");
630	}
631
632	init_archetable ();
633	warn_archetypes = 1;
634
635	{
636	object_thawer
637	thawer (filename);
638
639	LOG (llevDebug, " loading treasure...\n");
640	load_treasures ();
641	LOG (llevDebug, " done\n arch-pass 2...\n");
642	second_arch_pass (thawer);
643	LOG (llevDebug, " done\n");
644	#ifdef DEBUG
645	check_generators ();
646	#endif
647	}
648	LOG (llevDebug, " done\n");
649	}	525	}
650		526
651	/*	527	/*
652	* Creates and returns a new object which is a copy of the given archetype.	528	* Creates and returns a new object which is a copy of the given archetype.
653	* This function returns NULL on failure.	529	* This function returns NULL on failure.
654	*/	530	*/
655
656	object *	531	object *
657	arch_to_object (archetype * at)	532	arch_to_object (archetype *at)
658	{	533	{
659	object *	534	if (!at)
660	op;
661	if (at == NULL)
662	{	535	{
663	if (warn_archetypes)
664	LOG (llevError, "Couldn't find archetype.\n");	536	LOG (llevError, "Couldn't find archetype.\n");
665	return NULL;	537	return 0;
666	}	538	}
667	op = get_object ();	539
668	copy_object (&at->clone, op);	540	object *op = at->clone ();
		541	op->arch = at;
669	op->instantiate ();	542	op->instantiate ();
670	op->arch = at;	543
671	return op;	544	return op;
		545	}
		546
		547	object *
		548	archetype::instance ()
		549	{
		550	return arch_to_object (this);
672	}	551	}
673		552
674	/*	553	/*
675	* Creates an object. This function is called by get_archetype()	554	* Creates an object. This function is called by get_archetype()
676	* if it fails to find the appropriate archetype.	555	* if it fails to find the appropriate archetype.
677	* Thus get_archetype() will be guaranteed to always return	556	* Thus get_archetype() will be guaranteed to always return
678	* an object, and never NULL.	557	* an object, and never NULL.
679	*/	558	*/
680
681	object *	559	object *
682	create_singularity (const char *name)	560	create_singularity (const char *name)
683	{	561	{
684	object *	562	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
685	op;	563
686	char	564	if (!strcmp (name, "bug"))
		565	abort ();
		566
687	buf[MAX_BUF];	567	char buf[MAX_BUF];
688	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	568	sprintf (buf, "bug, please report (%s)", name);
689	op = get_object ();	569
		570	object *op = get_archetype ("bug");
690	op->name = op->name_pl = buf;	571	op->name = op->name_pl = buf;
691	SET_FLAG (op, FLAG_NO_PICK);	572
692	return op;	573	return op;
693	}	574	}
694		575
695	/*	576	/*
696	* Finds which archetype matches the given name, and returns a new	577	* Finds which archetype matches the given name, and returns a new
697	* object containing a copy of the archetype.	578	* object containing a copy of the archetype.
698	*/	579	*/
699
700	object *	580	object *
701	get_archetype (const char *name)	581	get_archetype (const char *name)
702	{	582	{
703	archetype *	583	archetype *at = archetype::find (name);
704	at;	584
705	at = find_archetype (name);	585	if (!at)
706	if (at == NULL)
707	return create_singularity (name);	586	return create_singularity (name);
		587
708	return arch_to_object (at);	588	return arch_to_object (at);
709	}
710
711	/*
712	* Hash-function used by the arch-hashtable.
713	*/
714
715	unsigned long
716	hasharch (const char *str, int tablesize)
717	{
718	unsigned long
719	hash = 0;
720	unsigned int
721	i = 0;
722	const char *
723	p;
724
725	/* use the one-at-a-time hash function, which supposedly is
726	* better than the djb2-like one used by perl5.005, but
727	* certainly is better then the bug used here before.
728	* see http://burtleburtle.net/bob/hash/doobs.html
729	*/
730	for (p = str; i < MAXSTRING && *p; p++, i++)
731	{
732	hash += *p;
733	hash += hash << 10;
734	hash ^= hash >> 6;
735	}
736
737	hash += hash << 3;
738	hash ^= hash >> 11;
739	hash += hash << 15;
740
741	return hash % tablesize;
742	}
743
744	/*
745	* Finds, using the hashtable, which archetype matches the given name.
746	* returns a pointer to the found archetype, otherwise NULL.
747	*/
748
749	archetype *
750	find_archetype (const char *name)
751	{
752	#if USE_UNORDERED_MAP
753	name = shstr::find (name);
754
755	if (!name)
756	return 0;
757
758	HT::const_iterator i = ht.find ((size_t)name);
759
760	if (i == ht.end ())
761	return 0;
762	else
763	return i->second;
764	#endif
765
766	archetype *at;
767	unsigned long index;
768
769	if (name == NULL)
770	return (archetype *) NULL;
771
772	index = hasharch (name, ARCHTABLE);
773	arch_search++;
774	for (;;)
775	{
776	at = arch_table[index];
777	if (at == NULL)
778	{
779	if (warn_archetypes)
780	LOG (llevError, "Couldn't find archetype %s\n", name);
781	return NULL;
782	}
783	arch_cmp++;
784	if (!strcmp ((const char *) at->name, name))
785	return at;
786	if (++index >= ARCHTABLE)
787	index = 0;
788	}
789	}
790
791	/*
792	* Adds an archetype to the hashtable.
793	*/
794
795	static void
796	add_arch (archetype *at)
797	{
798	#if USE_UNORDERED_MAP
799	ht.insert (std::make_pair ((size_t)(const char *)at->name, at));
800	#endif
801
802	int index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index;
803
804	for (;;)
805	{
806	if (arch_table[index] == NULL)
807	{
808	arch_table[index] = at;
809	return;
810	}
811
812	if (++index == ARCHTABLE)
813	index = 0;
814
815	if (index == org_index)
816	fatal (ARCHTABLE_TOO_SMALL);
817	}
818	}	589	}
819		590
820	/*	591	/*
821	* Returns the first archetype using the given type.	592	* Returns the first archetype using the given type.
822	* Used in treasure-generation.	593	* Used in treasure-generation.
823	*/	594	*/
824
825	archetype *	595	archetype *
826	type_to_archetype (int type)	596	type_to_archetype (int type)
827	{	597	{
828	archetype *	598	for_all_archetypes (at)
829	at;	599	if (at->type == type && at->head_ () != at)
830
831	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
832	if (at->clone.type == type)
833	return at;	600	return at;
		601
834	return NULL;	602	return 0;
835	}	603	}
836		604
837	/*	605	/*
838	* Returns a new object copied from the first archetype matching	606	* Returns a new object copied from the first archetype matching
839	* the given type.	607	* the given type.
840	* Used in treasure-generation.	608	* Used in treasure-generation.
841	*/	609	*/
842
843	object *	610	object *
844	clone_arch (int type)	611	clone_arch (int type)
845	{	612	{
846	archetype *	613	archetype *at;
847	at;
848	object *
849	op = get_object ();
850		614
851	if ((at = type_to_archetype (type)) == NULL)	615	if ((at = type_to_archetype (type)) == NULL)
852	{	616	{
853	LOG (llevError, "Can't clone archetype %d\n", type);	617	LOG (llevError, "Can't clone archetype %d\n", type);
854	free_object (op);
855	return NULL;	618	return 0;
856	}	619	}
857	copy_object (&at->clone, op);	620
		621	object *op = at->clone ();
858	op->instantiate ();	622	op->instantiate ();
859	return op;	623	return op;
860	}	624	}
861		625
862	/*	626	/*
863	* member: make instance from class	627	* member: make instance from class
864	*/	628	*/
865
866	object *	629	object *
867	object_create_arch (archetype * at)	630	object_create_arch (archetype *at)
868	{	631	{
869	object *	632	object op, prev = 0, *head = 0;
870	op, *
871	prev = NULL, *head = NULL;
872		633
873	while (at)	634	while (at)
874	{	635	{
875	op = arch_to_object (at);	636	op = arch_to_object (at);
		637
876	op->x = at->clone.x;	638	op->x = at->x;
877	op->y = at->clone.y;	639	op->y = at->y;
		640
878	if (head)	641	if (head)
879	op->head = head, prev->more = op;	642	op->head = head, prev->more = op;
		643
880	if (!head)	644	if (!head)
881	head = op;	645	head = op;
		646
882	prev = op;	647	prev = op;
883	at = at->more;	648	at = (archetype *)at->more;
884	}	649	}
		650
885	return (head);	651	return head;
886	}	652	}
887		653
888	/* end of arch.c */

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.13 by pippijn, Thu Sep 7 09:37:11 2006 UTC vs. Revision 1.74 by root, Sun Apr 20 05:24:55 2008 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.13 by pippijn, Thu Sep 7 09:37:11 2006 UTC vs.
Revision 1.74 by root, Sun Apr 20 05:24:55 2008 UTC