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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.22 by root, Thu Sep 14 22:35:53 2006 UTC vs.
Revision 1.65 by root, Thu Jun 7 18:55:24 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.22 by root, Thu Sep 14 22:35:53 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.22 by root, Thu Sep 14 22:35:53 2006 UTC vs.
Revision 1.65 by root, Thu Jun 7 18:55:24 2007 UTC