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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.20 by root, Thu Sep 14 21:16:11 2006 UTC vs.
Revision 1.101 by root, Fri Mar 26 01:04:43 2010 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.20 by root, Thu Sep 14 21:16:11 2006 UTC vs. Revision 1.101 by root, Fri Mar 26 01:04:43 2010 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.20 by root, Thu Sep 14 21:16:11 2006 UTC vs.
Revision 1.101 by root, Fri Mar 26 01:04:43 2010 UTC