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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.23 by root, Thu Sep 14 23:13:48 2006 UTC vs. Revision 1.100 by root, Fri Mar 26 00:59:20 2010 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.23 by root, Thu Sep 14 23:13:48 2006 UTC vs.
Revision 1.100 by root, Fri Mar 26 00:59:20 2010 UTC