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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.14 by root, Fri Sep 8 17:14:07 2006 UTC vs.
Revision 1.111 by root, Mon Oct 29 23:55:52 2012 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.14 by root, Fri Sep 8 17:14:07 2006 UTC vs. Revision 1.111 by root, Mon Oct 29 23:55:52 2012 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.14 by root, Fri Sep 8 17:14:07 2006 UTC vs.
Revision 1.111 by root, Mon Oct 29 23:55:52 2012 UTC