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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.16 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC

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

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.16 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC