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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.26 by root, Fri Nov 17 19:40:53 2006 UTC vs. Revision 1.96 by root, Sat Nov 7 18:30:05 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.26 by root, Fri Nov 17 19:40:53 2006 UTC vs.
Revision 1.96 by root, Sat Nov 7 18:30:05 2009 UTC