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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.19 by root, Thu Sep 14 18:13:01 2006 UTC vs.
Revision 1.96 by root, Sat Nov 7 18:30:05 2009 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.19 by root, Thu Sep 14 18:13:01 2006 UTC vs. Revision 1.96 by root, Sat Nov 7 18:30:05 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.19 by root, Thu Sep 14 18:13:01 2006 UTC vs.
Revision 1.96 by root, Sat Nov 7 18:30:05 2009 UTC