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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.15 by root, Sun Sep 10 13:20:12 2006 UTC vs.
Revision 1.69 by root, Tue Sep 4 18:20:35 2007 UTC

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

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.15 by root, Sun Sep 10 13:20:12 2006 UTC vs.
Revision 1.69 by root, Tue Sep 4 18:20:35 2007 UTC