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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.14 by root, Fri Sep 8 17:14:07 2006 UTC vs.
Revision 1.73 by root, Sun Apr 20 00:44:12 2008 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.14 by root, Fri Sep 8 17:14:07 2006 UTC vs. Revision 1.73 by root, Sun Apr 20 00:44:12 2008 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.14 by root, Fri Sep 8 17:14:07 2006 UTC vs.
Revision 1.73 by root, Sun Apr 20 00:44:12 2008 UTC