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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.28 by root, Tue Dec 12 20:53:02 2006 UTC vs.
Revision 1.91 by root, Tue Oct 27 01:38:39 2009 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.28 by root, Tue Dec 12 20:53:02 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.28 by root, Tue Dec 12 20:53:02 2006 UTC vs.
Revision 1.91 by root, Tue Oct 27 01:38:39 2009 UTC