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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.15 by root, Sun Sep 10 13:20:12 2006 UTC vs. Revision 1.91 by root, Tue Oct 27 01:38:39 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.15 by root, Sun Sep 10 13:20:12 2006 UTC vs.
Revision 1.91 by root, Tue Oct 27 01:38:39 2009 UTC