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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.16 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.65 by root, Thu Jun 7 18:55:24 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.16 by root, Sun Sep 10 16:00:23 2006 UTC vs. Revision 1.65 by root, Thu Jun 7 18:55:24 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.16 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.65 by root, Thu Jun 7 18:55:24 2007 UTC