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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.36 by pippijn, Sat Jan 6 14:42:28 2007 UTC vs. Revision 1.105 by root, Thu Apr 15 00:36:51 2010 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.36 by pippijn, Sat Jan 6 14:42:28 2007 UTC vs.
Revision 1.105 by root, Thu Apr 15 00:36:51 2010 UTC