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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.17 by root, Tue Sep 12 19:20:06 2006 UTC vs.
Revision 1.70 by root, Tue Oct 16 00:30:24 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.17 by root, Tue Sep 12 19:20:06 2006 UTC vs. Revision 1.70 by root, Tue Oct 16 00:30:24 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.17 by root, Tue Sep 12 19:20:06 2006 UTC vs.
Revision 1.70 by root, Tue Oct 16 00:30:24 2007 UTC