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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.19 by root, Thu Sep 14 18:13:01 2006 UTC vs. Revision 1.67 by root, Sat Jun 9 21:16:12 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.19 by root, Thu Sep 14 18:13:01 2006 UTC vs.
Revision 1.67 by root, Sat Jun 9 21:16:12 2007 UTC