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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.35 by root, Wed Jan 3 20:32:13 2007 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@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>
29		28
30	#define USE_UNORDERED_MAP 0
31
32	#if USE_UNORDERED_MAP
33	# include <tr1/functional>	29	#include <tr1/functional>
34	# include <tr1/unordered_map>	30	#include <tr1/unordered_map>
35	#endif
36		31
37	int arch_cmp = 0; /* How many strcmp's */	32	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
38	int arch_search = 0; /* How many searches */	33	arch_ptr archetype::empty;
39	int arch_init; /* True if doing arch initialization */
40		34
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	35	// the hashtable
51	typedef std::tr1::unordered_map	36	typedef std::tr1::unordered_map
52	<	37	<
53	std::size_t,	38	const char *,
54	arch_ptr,	39	arch_ptr,
55	std::tr1::hash<size_t>,	40	str_hash,
56	std::equal_to<size_t>,	41	str_equal,
57	slice_allocator< std::pair<const std::size_t, archetype *> >	42	slice_allocator< std::pair<const char *const, arch_ptr> >
58	true,
59	> HT;	43	> HT;
60		44
61	static HT ht;	45	static HT ht (10000);
62	#else	46	archvec archetypes;
63	static arch_ptr arch_table[ARCHTABLE];	47	static unordered_vector<archetype *> allarch;
64	#endif	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 *at;	125	shstr_cmp skill_cmp (skill);
124		126
125	if (skill)	127	for_all_archetypes (at)
126	for (at = first_archetype; at; at = at->next)	128	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
127	if (((type == -1) \|\| (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))	129	return at->instance ();
128	return arch_to_object (at);
129		130
130	return 0;	131	return 0;
131	}	132	}
132		133
133	/* similiar to above - this returns the first archetype	134	/* similiar to above - this returns the first archetype
…		…
138	* (eg, skills)	139	* (eg, skills)
139	*/	140	*/
140	archetype *	141	archetype *
141	get_archetype_by_type_subtype (int type, int subtype)	142	get_archetype_by_type_subtype (int type, int subtype)
142	{	143	{
143	archetype *	144	for_all_archetypes (at)
144	at;
145
146	for (at = first_archetype; at != NULL; at = at->next)
147	{
148	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))
149	return at;	146	return at;
150	}	147
151	return NULL;	148	return 0;
152	}	149	}
153		150
154	/**	151	/**
155	* 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
156	* (for example, "writing pen" instead of "stylus").	153	* (for example, "writing pen" instead of "stylus").
…		…
158	* - name: The name we're searching for (ex: "writing pen");	155	* - name: The name we're searching for (ex: "writing pen");
159	* Return value:	156	* Return value:
160	* - a corresponding object if found; a singularity object if not found.	157	* - a corresponding object if found; a singularity object if not found.
161	* 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
162	* 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
163	* 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,
164	* but it otherwise had a big memory leak.	161	* but it otherwise had a big memory leak.
165	*/	162	*/
166	object *	163	object *
167	get_archetype_by_object_name (const char *name)	164	get_archetype_by_object_name (const char *name)
168	{	165	{
169	archetype *at;
170	char tmpname[MAX_BUF];	166	char tmpname[MAX_BUF];
171	int i;
172		167
173	assign (tmpname, name);	168	assign (tmpname, name);
174		169
175	for (i = strlen (tmpname); i > 0; i--)	170	for (int i = strlen (tmpname); i > 0; i--)
176	{	171	{
177	tmpname[i] = 0;	172	tmpname[i] = 0;
		173
178	at = find_archetype_by_object_name (tmpname);	174	if (archetype *at = find_archetype_by_object_name (tmpname))
179		175	return at->instance ();
180	if (at)
181	return arch_to_object (at);
182	}	176	}
183		177
184	return create_singularity (name);	178	return create_singularity (name);
185	}	179	}
186		180
187	/* 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
188	* a string seperated lists of things to match, with certain keywords.	182	* a string seperated lists of things to match, with certain keywords.
189	* pl is the player (only needed to set count properly)	183	* pl is the player (only needed to set count properly)
190	* 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
191	* 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
192	* (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
193	* value means a better match. 0 means no match.	187	* value means a better match. 0 means no match.
194	*	188	*
195	* Brief outline of the procedure:	189	* Brief outline of the procedure:
196	* We take apart the name variable into the individual components.	190	* We take apart the name variable into the individual components.
197	* cases for 'all' and unpaid are pretty obvious.	191	* cases for 'all' and unpaid are pretty obvious.
198	* 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
199	* player object.)	193	* player object.)
200	* If count is 1, make a quick check on the name.	194	* If count is 1, make a quick check on the name.
201	* 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.
202	* Last, make a check on the full name.	196	* Last, make a check on the full name.
203	*/	197	*/
204	int	198	int
205	item_matched_string (object pl, object op, const char *name)	199	item_matched_string (object pl, object op, const char *name)
206	{	200	{
207	char *cp, local_name[MAX_BUF];	201	char *cp, local_name[MAX_BUF];
208	int count, retval = 0;	202	int count, retval = 0;
209		203
210	strcpy (local_name, name); /* strtok is destructive to name */	204	assign (local_name, name); /* strtok is destructive to name */
211		205
212	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))	206	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
213	{	207	{
214	while (cp[0] == ' ')	208	while (cp[0] == ' ')
215	++cp; /* get rid of spaces */	209	++cp; /* get rid of spaces */
…		…
220	return 1;	214	return 1;
221		215
222	/* unpaid is a little more specific */	216	/* unpaid is a little more specific */
223	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	217	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
224	return 2;	218	return 2;
		219
225	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)))
226	return 2;	221	return 2;
227		222
228	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	223	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
229	return 2;	224	return 2;
…		…
251	* 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
252	* 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
253	* 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
254	* match first, and work downward.	249	* match first, and work downward.
255	*/	250	*/
		251	const char qbn0, qbn1, *qsn; // query base name/short name caches
		252
256	if (!strcasecmp (cp, query_name (op)))	253	if (!strcasecmp (cp, query_name (op)))
257	retval = 20;	254	retval = 20;
258	else if (!strcasecmp (cp, query_short_name (op)))	255	else if (!strcasecmp (cp, qsn = query_short_name (op)))
259	retval = 18;	256	retval = 18;
260	else if (!strcasecmp (cp, query_base_name (op, 0)))	257	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
261	retval = 16;	258	retval = 16;
262	else if (!strcasecmp (cp, query_base_name (op, 1)))	259	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
263	retval = 16;	260	retval = 16;
264	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	261	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
265	retval = 15;	262	retval = 15;
266	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	263	else if (!strncasecmp (cp, qbn0, strlen (cp)))
267	retval = 14;	264	retval = 14;
268	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	265	else if (!strncasecmp (cp, qbn1, strlen (cp)))
269	retval = 14;	266	retval = 14;
270	/* Do substring checks, so things like 'Str+1' will match.	267	/* Do substring checks, so things like 'Str+1' will match.
271	* retval of these should perhaps be lower - they are lower	268	* retval of these should perhaps be lower - they are lower
272	* then the specific strcasecmp aboves, but still higher than	269	* then the specific strcasecmp aboves, but still higher than
273	* some other match criteria.	270	* some other match criteria.
274	*/	271	*/
275	else if (strstr (query_base_name (op, 1), cp))	272	else if (strstr (qbn1, cp))
276	retval = 12;	273	retval = 12;
277	else if (strstr (query_base_name (op, 0), cp))	274	else if (strstr (qbn0, cp))
278	retval = 12;	275	retval = 12;
279	else if (strstr (query_short_name (op), cp))	276	else if (strstr (qsn, cp))
280	retval = 12;	277	retval = 12;
281	/* Check against plural/non plural based on count. */	278	/* Check against plural/non plural based on count. */
282	else if (count > 1 && !strcasecmp (cp, op->name_pl))	279	else if (count > 1 && !strcasecmp (cp, op->name_pl))
283	retval = 6;	280	retval = 6;
284	else if (count == 1 && !strcasecmp (op->name, cp))	281	else if (count == 1 && !strcasecmp (op->name, cp))
285	retval = 6;	282	retval = 6;
286	/* base name matched - not bad */	283	/* base name matched - not bad */
287	else if (strcasecmp (cp, op->name) == 0 && !count)	284	else if (strcasecmp (cp, op->name) == 0 && !count)
288	retval = 4;	285	retval = 4;
289	/* Check for partial custom name, but give a real low priority */	286	/* Check for partial custom name, but give a real low priority */
290	else if (op->custom_name && strstr (op->custom_name, cp))	287	else if (op->custom_name.contains (cp))
291	retval = 3;	288	retval = 3;
292		289
293	if (retval)	290	if (retval)
294	{	291	{
295	if (pl->type == PLAYER)	292	if (pl->type == PLAYER)
…		…
300	}	297	}
301		298
302	return 0;	299	return 0;
303	}	300	}
304		301
305	/*	302	//-GPL
306	* Initialises the internal linked list of archetypes (read from file).	303
307	* Then the global "empty_archetype" pointer is initialised.	304	archetype::archetype (const char *name)
308	* Then the blocksview[] array is initialised.	305	{
309	*/	306	arch = this;
		307	this->archname = this->name = this->name_pl = name;
		308	}
		309
		310	archetype::~archetype ()
		311	{
		312	unlink ();
		313	}
310		314
311	void	315	void
312	init_archetypes (void)	316	archetype::link ()
313	{ /* called from add_player() and edit() */	317	{
314	if (first_archetype != NULL) /* Only do this once */	318	if (!archetypes.contains (this))
315	return;	319	{
316		320	archetypes.insert (this);
317	arch_init = 1;	321	ht.insert (std::make_pair (archname, this));
318	load_archetypes ();	322	}
319	arch_init = 0;
320	empty_archetype = archetype::find ("empty_archetype");
321
322	/* init_blocksview();*/
323	}	323	}
324
325	/*
326	* Stores debug-information about how efficient the hashtable
327	* used for archetypes has been in the static errmsg array.
328	*/
329		324
330	void	325	void
331	arch_info (object *op)	326	archetype::unlink ()
332	{	327	{
333	sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);	328	if (archetypes.contains (this))
334	new_draw_info (NDI_BLACK, 0, op, errmsg);
335	}
336
337	/*
338	* Initialise the hashtable used by the archetypes.
339	*/
340
341	void
342	clear_archetable (void)
343	{
344	memset ((void ) arch_table, 0, ARCHTABLE sizeof (archetype *));
345	}
346
347	/*
348	* An alternative way to init the hashtable which is slower, but _works_...
349	*/
350
351	void
352	init_archetable (void)
353	{
354	archetype *at;
355
356	LOG (llevDebug, " Setting up archetable...\n");
357
358	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
359	at->hash_add ();
360
361	LOG (llevDebug, "done\n");
362	}
363
364	void
365	free_all_archs (void)
366	{
367	archetype at, next;
368	int i = 0, f = 0;
369
370	for (at = first_archetype; at != NULL; at = next)
371	{
372	if (at->more)
373	next = at->more;
374	else
375	next = at->next;
376
377	delete
378	at;
379
380	i++;
381	}	329	{
382		330	archetypes.erase (this);
383	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);	331	ht.erase (archname);
384	}
385
386	archetype::archetype ()
387	{
388	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
389	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
390	}
391
392	archetype::~archetype ()
393	{
394	}
395
396	/*
397	* Reads/parses the archetype-file, and copies into a linked list
398	* of archetype-structures.
399	*/
400	void
401	first_arch_pass (object_thawer & fp)
402	{
403	archetype head = 0, last_more = 0;
404
405	archetype *at = new archetype;
406	at->clone.arch = first_archetype = at;
407
408	while (int i = load_object (fp, &at->clone, 0))
409	{	332	}
410	at->clone.speed_left = (float) (-0.1);
411	/* copy the body_info to the body_used - this is only really
412	* need for monsters, but doesn't hurt to do it for everything.
413	* by doing so, when a monster is created, it has good starting
414	* values for the body_used info, so when items are created
415	* for it, they can be properly equipped.
416	*/
417	memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
418
419	switch (i)
420	{
421	case LL_NORMAL: /* A new archetype, just link it with the previous */
422	if (last_more != NULL)
423	last_more->next = at;
424	if (head != NULL)
425	head->next = at;
426	head = last_more = at;
427	#if 0
428	if (!op->type)
429	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
430	#endif
431	at->tail_x = 0;
432	at->tail_y = 0;
433	break;
434
435	case LL_MORE: /* Another part of the previous archetype, link it correctly */
436
437	at->head = head;
438	at->clone.head = &head->clone;
439	if (last_more != NULL)
440	{
441	last_more->more = at;
442	last_more->clone.more = &at->clone;
443	}
444	last_more = at;
445
446	/* If this multipart image is still composed of individual small
447	* images, don't set the tail_.. values. We can't use them anyways,
448	* and setting these to zero makes the map sending to the client much
449	* easier as just looking at the head, we know what to do.
450	*/
451	if (at->clone.face != head->clone.face)
452	{
453	head->tail_x = 0;
454	head->tail_y = 0;
455	}
456	else
457	{
458	if (at->clone.x > head->tail_x)
459	head->tail_x = at->clone.x;
460	if (at->clone.y > head->tail_y)
461	head->tail_y = at->clone.y;
462	}
463	break;
464
465	}
466
467	at = new archetype;
468
469	at->clone.arch = at;
470	}
471
472	delete at;
473	}
474
475	/*
476	* Reads the archetype file once more, and links all pointers between
477	* archetypes.
478	*/
479
480	void
481	second_arch_pass (object_thawer & thawer)
482	{
483	char buf[MAX_BUF], variable = buf, argument, *cp;
484	archetype at = NULL, other;
485
486	while (fgets (buf, MAX_BUF, thawer) != NULL)
487	{
488	if (*buf == '#')
489	continue;
490	if ((argument = strchr (buf, ' ')) != NULL)
491	{
492	*argument = '\0', argument++;
493	cp = argument + strlen (argument) - 1;
494	while (isspace (*cp))
495	{
496	*cp = '\0';
497	cp--;
498	}
499	}
500	if (!strcmp ("Object", variable))
501	{
502	if ((at = archetype::find (argument)) == NULL)
503	LOG (llevError, "Warning: failed to find arch %s\n", argument);
504	}
505	else if (!strcmp ("other_arch", variable))
506	{
507	if (at != NULL && at->clone.other_arch == NULL)
508	{
509	if ((other = archetype::find (argument)) == NULL)
510	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
511	else if (at != NULL)
512	at->clone.other_arch = other;
513	}
514	}
515	else if (!strcmp ("randomitems", variable))
516	{
517	if (at != NULL)
518	{
519	treasurelist *tl = find_treasurelist (argument);
520
521	if (tl == NULL)
522	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
523	else
524	at->clone.randomitems = tl;
525	}
526	}
527	}
528	}
529
530	#ifdef DEBUG
531	void
532	check_generators (void)
533	{
534	archetype *at;
535
536	for (at = first_archetype; at != NULL; at = at->next)
537	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
538	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
539	}
540	#endif
541
542	/*
543	* First initialises the archtype hash-table (init_archetable()).
544	* Reads and parses the archetype file (with the first and second-pass
545	* functions).
546	* Then initialises treasures by calling load_treasures().
547	*/
548
549	void
550	load_archetypes (void)
551	{
552	char filename[MAX_BUF];
553
554	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
555	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
556
557	{
558	object_thawer
559	thawer (filename);
560
561	clear_archetable ();
562	LOG (llevDebug, " arch-pass 1...\n");
563	first_arch_pass (thawer);
564	LOG (llevDebug, " done\n");
565	}
566
567	init_archetable ();
568	warn_archetypes = 1;
569
570	{
571	object_thawer
572	thawer (filename);
573
574	LOG (llevDebug, " loading treasure...\n");
575	load_treasures ();
576	LOG (llevDebug, " done\n");
577	LOG (llevDebug, " arch-pass 2...\n");
578	second_arch_pass (thawer);
579	LOG (llevDebug, " done\n");
580	#ifdef DEBUG
581	check_generators ();
582	#endif
583	}
584	LOG (llevDebug, " done\n");
585	}
586
587	/*
588	* Creates and returns a new object which is a copy of the given archetype.
589	* This function returns NULL on failure.
590	*/
591	object *
592	arch_to_object (archetype *at)
593	{
594	object *op;
595
596	if (at == NULL)
597	{
598	if (warn_archetypes)
599	LOG (llevError, "Couldn't find archetype.\n");
600
601	return NULL;
602	}
603
604	op = at->clone.clone ();
605	op->arch = at;
606	op->instantiate ();
607	return op;
608	}
609
610	/*
611	* Creates an object. This function is called by get_archetype()
612	* if it fails to find the appropriate archetype.
613	* Thus get_archetype() will be guaranteed to always return
614	* an object, and never NULL.
615	*/
616	object *
617	create_singularity (const char *name)
618	{
619	object *op;
620	char buf[MAX_BUF];
621
622	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
623	op = object::create ();
624	op->name = op->name_pl = buf;
625	SET_FLAG (op, FLAG_NO_PICK);
626	return op;
627	}
628
629	/*
630	* Finds which archetype matches the given name, and returns a new
631	* object containing a copy of the archetype.
632	*/
633	object *
634	get_archetype (const char *name)
635	{
636	archetype *at = archetype::find (name);
637
638	if (!at)
639	return create_singularity (name);
640
641	return arch_to_object (at);
642	}
643
644	/*
645	* Hash-function used by the arch-hashtable.
646	*/
647
648	unsigned long
649	hasharch (const char *str, int tablesize)
650	{
651	unsigned long hash = 0;
652	unsigned int i = 0;
653	const char *p;
654
655	/* use the one-at-a-time hash function, which supposedly is
656	* better than the djb2-like one used by perl5.005, but
657	* certainly is better then the bug used here before.
658	* see http://burtleburtle.net/bob/hash/doobs.html
659	*/
660	for (p = str; i < MAXSTRING && *p; p++, i++)
661	{
662	hash += *p;
663	hash += hash << 10;
664	hash ^= hash >> 6;
665	}
666
667	hash += hash << 3;
668	hash ^= hash >> 11;
669	hash += hash << 15;
670
671	return hash % tablesize;
672	}	333	}
673		334
674	/*	335	/*
675	* Finds, using the hashtable, which archetype matches the given name.	336	* Finds, using the hashtable, which archetype matches the given name.
676	* returns a pointer to the found archetype, otherwise NULL.	337	* returns a pointer to the found archetype, otherwise NULL.
677	*/	338	*/
678
679	archetype *	339	archetype *
680	archetype::find (const char *name)	340	archetype::find (const char *name)
681	{	341	{
682	if (!name)	342	if (!name)
683	return 0;	343	return 0;
684		344
685	#if USE_UNORDERED_MAP	345	auto (i, ht.find (name));
686	AUTODECL (i, ht.find ((size_t) name));
687		346
688	if (i == ht.end ())	347	if (i == ht.end ())
689	return 0;	348	return 0;
690	else	349	else
691	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	}
692	#endif	391	#endif
693		392
694	archetype *at;	393	loading_arch = at; // hack to tell parse_kv et al. to behave
695	unsigned long index;	394	bool parse_ok = at->parse_kv (f);
		395	loading_arch = 0;
696		396
697	index = hasharch (name, ARCHTABLE);	397	if (!parse_ok)
698	arch_search++;	398	goto fail;
699	for (;;)
700	{
701	at = arch_table[index];
702		399
703	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)
704	{	412	{
705	if (warn_archetypes)	413	f.parse_error ("more object");
706	LOG (llevError, "Couldn't find archetype %s\n", name);	414	goto fail;
707
708	return NULL;
709	}	415	}
		416	}
710		417
711	arch_cmp++;	418	{
		419	auto (at, parts.begin ());
712		420
713	if (!strcmp ((const char *) at->name, name))	421	archetype *new_head = parts.front ();
714	return at;	422	archetype *old_head = find (new_head->archname);
715		423
716	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)
717	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	}
718	}	561	}
		562	while (--cnt);
719	}	563	}
		564
		565	object *
		566	archetype::instance ()
		567	{
		568	object *op = clone ();
		569	op->instantiate ();
		570	return op;
		571	}
		572
		573	//+GPL
720		574
721	/*	575	/*
722	* 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.
723	*/	578	*/
724	void	579	object *
725	archetype::hash_add ()	580	get_archetype (const char *name)
726	{	581	{
727	#if USE_UNORDERED_MAP	582	return archetype::get (name);
728	ht.insert (std::make_pair ((size_t) (const char *) name, this));
729	#else
730
731	int index = hasharch ((const char *) name, ARCHTABLE), org_index = index;
732
733	for (;;)
734	{
735	if (!arch_table[index])
736	{
737	arch_table[index] = this;
738	break;
739	}
740
741	if (++index == ARCHTABLE)
742	index = 0;
743
744	if (index == org_index)
745	fatal (ARCHTABLE_TOO_SMALL);
746	}
747	#endif
748	}	583	}
749		584
750	void	585	object *
751	archetype::hash_del ()	586	archetype::get (const char *name)
752	{	587	{
753	#if USE_UNORDERED_MAP	588	archetype *at = find (name);
754	# error remove this from HT
755	#else
756		589
757	int index = hasharch ((const char *) name, ARCHTABLE), org_index = index;	590	if (!at)
		591	return create_singularity (name);
758		592
759	for (;;)	593	return at->instance ();
760	{
761	if (arch_table[index] == this)
762	{
763	arch_table[index] = 0;
764	break;
765	}
766
767	if (++index == ARCHTABLE)
768	index = 0;
769
770	if (index == org_index)
771	break;
772	}
773	#endif
774	}	594	}
775		595
776	/*	596	/*
777	* Returns the first archetype using the given type.	597	* Returns the first archetype using the given type.
778	* Used in treasure-generation.	598	* Used in treasure-generation.
779	*/	599	*/
780
781	archetype *	600	static archetype *
782	type_to_archetype (int type)	601	type_to_archetype (int type)
783	{	602	{
784	archetype *at;	603	for_all_archetypes (at)
785		604	if (at->type == type && at->head_ () != at)
786	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
787	if (at->clone.type == type)
788	return at;	605	return at;
789		606
790	return 0;	607	return 0;
791	}	608	}
792		609
793	/*	610	/*
794	* Returns a new object copied from the first archetype matching	611	* Returns a new object copied from the first archetype matching
795	* the given type.	612	* the given type.
796	* Used in treasure-generation.	613	* Used in treasure-generation.
797	*/	614	*/
798
799	object *	615	object *
800	clone_arch (int type)	616	clone_arch (int type)
801	{	617	{
802	archetype *at;	618	archetype *at = type_to_archetype (type);
803		619
804	if ((at = type_to_archetype (type)) == NULL)	620	if (!at)
805	{	621	{
806	LOG (llevError, "Can't clone archetype %d\n", type);	622	LOG (llevError, "Can't clone archetype %d\n", type);
807	return 0;	623	return 0;
808	}	624	}
809		625
810	object *op = at->clone.clone ();	626	return at->instance ();
811	op->instantiate ();
812	return op;
813	}	627	}
814		628
815	/*	629	/*
816	* member: make instance from class	630	* member: make instance from class
817	*/	631	*/
818
819	object *	632	object *
820	object_create_arch (archetype *at)	633	object_create_arch (archetype *at)
821	{	634	{
822	object op, prev = 0, *head = 0;	635	object op, prev = 0, *head = 0;
823		636
824	while (at)	637	while (at)
825	{	638	{
826	op = arch_to_object (at);	639	op = at->instance ();
		640
827	op->x = at->clone.x;	641	op->x = at->x;
828	op->y = at->clone.y;	642	op->y = at->y;
829		643
830	if (head)	644	if (head)
831	op->head = head, prev->more = op;	645	op->head = head, prev->more = op;
832		646
833	if (!head)	647	if (!head)
834	head = op;	648	head = op;
835		649
836	prev = op;	650	prev = op;
837	at = at->more;	651	at = (archetype *)at->more;
838	}	652	}
839		653
840	return (head);	654	return head;
841	}	655	}
842		656
		657	//-GPL
		658

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.35 by root, Wed Jan 3 20:32:13 2007 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.35 by root, Wed Jan 3 20:32:13 2007 UTC vs.
Revision 1.101 by root, Fri Mar 26 01:04:43 2010 UTC