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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.47 by root, Mon Apr 16 10:14:25 2007 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* 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
9	* 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
10	* the Free Software Foundation; either version 2 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* 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,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* 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
19	* 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
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* 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>
23	*/	23	*/
24		24
25	#include <cassert>	25	#include <cassert>
26		26
27	#include <global.h>	27	#include <global.h>
28	#include <funcpoint.h>
29	#include <loader.h>	28	#include <loader.h>
30		29
31	#include <tr1/functional>	30	#include <tr1/functional>
32	#include <tr1/unordered_map>	31	#include <tr1/unordered_map>
33		32
34	/* The naming of these functions is really poor - they are all
35	* pretty much named '.._arch_...', but they may more may not
36	* return archetypes. Some make the arch_to_object call, and thus
37	* return an object. Perhaps those should be called 'archob' functions
38	* to denote they return an object derived from the archetype.
39	* MSW 2003-04-29
40	*/
41
42	bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing	33	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
		34	arch_ptr archetype::empty;
43		35
44	// the hashtable	36	// the hashtable
45	typedef std::tr1::unordered_map	37	typedef std::tr1::unordered_map
46	<	38	<
47	const char *,	39	const char *,
49	str_hash,	41	str_hash,
50	str_equal,	42	str_equal,
51	slice_allocator< std::pair<const char *const, arch_ptr> >	43	slice_allocator< std::pair<const char *const, arch_ptr> >
52	> HT;	44	> HT;
53		45
54	static HT ht (5000);	46	static HT ht (10000);
		47	archvec archetypes;
		48	static unordered_vector<archetype *> allarch;
		49	static int dirtycnt;
		50
		51	// the vector of other_arch references to be resolved
		52	static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
		53	// the vector of loaded but not yet committed archetypes
55	static std::vector<archetype *> archetypes;	54	static std::vector<archetype *> postponed_arch;
56		55
57	/**	56	/**
58	* GROS - This function retrieves an archetype given the name that appears	57	* GROS - This function retrieves an archetype given the name that appears
59	* during the game (for example, "writing pen" instead of "stylus").	58	* during the game (for example, "writing pen" instead of "stylus").
60	* 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.
…		…
68	archetype *	67	archetype *
69	find_archetype_by_object_name (const char *name)	68	find_archetype_by_object_name (const char *name)
70	{	69	{
71	shstr_cmp name_cmp (name);	70	shstr_cmp name_cmp (name);
72		71
73	for (archetype *at = first_archetype; at; at = at->next)	72	for_all_archetypes (at)
74	if (at->clone.name == name_cmp)	73	if (at->name == name_cmp)
75	return at;	74	return at;
76		75
77	return 0;	76	return 0;
78	}	77	}
79		78
…		…
85	archetype *	84	archetype *
86	find_archetype_by_object_type_name (int type, const char *name)	85	find_archetype_by_object_type_name (int type, const char *name)
87	{	86	{
88	shstr_cmp name_cmp (name);	87	shstr_cmp name_cmp (name);
89		88
90	for (archetype *at = first_archetype; at; at = at->next)	89	for_all_archetypes (at)
91	if (at->clone.name == name_cmp && at->clone.type == type)	90	if (at->name == name_cmp && at->type == type)
92	return at;	91	return at;
93		92
94	return 0;	93	return 0;
95	}	94	}
96		95
…		…
102	object *	101	object *
103	get_archetype_by_skill_name (const char *skill, int type)	102	get_archetype_by_skill_name (const char *skill, int type)
104	{	103	{
105	shstr_cmp skill_cmp (skill);	104	shstr_cmp skill_cmp (skill);
106		105
107	for (archetype *at = first_archetype; at; at = at->next)	106	for_all_archetypes (at)
108	if (at->clone.skill == skill_cmp && (type == -1 \|\| type == at->clone.type))	107	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
109	return arch_to_object (at);	108	return at->instance ();
110		109
111	return 0;	110	return 0;
112	}	111	}
113		112
114	/* similiar to above - this returns the first archetype	113	/* similiar to above - this returns the first archetype
…		…
119	* (eg, skills)	118	* (eg, skills)
120	*/	119	*/
121	archetype *	120	archetype *
122	get_archetype_by_type_subtype (int type, int subtype)	121	get_archetype_by_type_subtype (int type, int subtype)
123	{	122	{
124	for (archetype *at = first_archetype; at; at = at->next)	123	for_all_archetypes (at)
125	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))
126	return at;	125	return at;
127		126
128	return 0;	127	return 0;
129	}	128	}
130		129
…		…
135	* - name: The name we're searching for (ex: "writing pen");	134	* - name: The name we're searching for (ex: "writing pen");
136	* Return value:	135	* Return value:
137	* - a corresponding object if found; a singularity object if not found.	136	* - a corresponding object if found; a singularity object if not found.
138	* 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
139	* 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
140	* 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,
141	* but it otherwise had a big memory leak.	140	* but it otherwise had a big memory leak.
142	*/	141	*/
143	object *	142	object *
144	get_archetype_by_object_name (const char *name)	143	get_archetype_by_object_name (const char *name)
145	{	144	{
146	char tmpname[MAX_BUF];	145	char tmpname[MAX_BUF];
147	int i;
148		146
149	assign (tmpname, name);	147	assign (tmpname, name);
150		148
151	for (i = strlen (tmpname); i > 0; i--)	149	for (int i = strlen (tmpname); i > 0; i--)
152	{	150	{
153	tmpname[i] = 0;	151	tmpname[i] = 0;
154		152
155	if (archetype *at = find_archetype_by_object_name (tmpname))	153	if (archetype *at = find_archetype_by_object_name (tmpname))
156	return arch_to_object (at);	154	return at->instance ();
157	}	155	}
158		156
159	return create_singularity (name);	157	return create_singularity (name);
160	}	158	}
161		159
162	/* 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
163	* a string seperated lists of things to match, with certain keywords.	161	* a string seperated lists of things to match, with certain keywords.
164	* pl is the player (only needed to set count properly)	162	* pl is the player (only needed to set count properly)
165	* 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
166	* 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
167	* (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
168	* value means a better match. 0 means no match.	166	* value means a better match. 0 means no match.
169	*	167	*
170	* Brief outline of the procedure:	168	* Brief outline of the procedure:
171	* We take apart the name variable into the individual components.	169	* We take apart the name variable into the individual components.
172	* cases for 'all' and unpaid are pretty obvious.	170	* cases for 'all' and unpaid are pretty obvious.
173	* 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
174	* player object.)	172	* player object.)
175	* If count is 1, make a quick check on the name.	173	* If count is 1, make a quick check on the name.
176	* 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.
177	* Last, make a check on the full name.	175	* Last, make a check on the full name.
178	*/	176	*/
179	int	177	int
180	item_matched_string (object pl, object op, const char *name)	178	item_matched_string (object pl, object op, const char *name)
181	{	179	{
182	char *cp, local_name[MAX_BUF];	180	char *cp, local_name[MAX_BUF];
183	int count, retval = 0;	181	int count, retval = 0;
…		…
195	return 1;	193	return 1;
196		194
197	/* unpaid is a little more specific */	195	/* unpaid is a little more specific */
198	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	196	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
199	return 2;	197	return 2;
		198
200	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)))
201	return 2;	200	return 2;
202		201
203	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	202	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
204	return 2;	203	return 2;
…		…
226	* 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
227	* 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
228	* 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
229	* match first, and work downward.	228	* match first, and work downward.
230	*/	229	*/
		230	const char qbn0, qbn1, *qsn; // query base name/short name caches
		231
231	if (!strcasecmp (cp, query_name (op)))	232	if (!strcasecmp (cp, query_name (op)))
232	retval = 20;	233	retval = 20;
233	else if (!strcasecmp (cp, query_short_name (op)))	234	else if (!strcasecmp (cp, qsn = query_short_name (op)))
234	retval = 18;	235	retval = 18;
235	else if (!strcasecmp (cp, query_base_name (op, 0)))	236	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
236	retval = 16;	237	retval = 16;
237	else if (!strcasecmp (cp, query_base_name (op, 1)))	238	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
238	retval = 16;	239	retval = 16;
239	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	240	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
240	retval = 15;	241	retval = 15;
241	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	242	else if (!strncasecmp (cp, qbn0, strlen (cp)))
242	retval = 14;	243	retval = 14;
243	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	244	else if (!strncasecmp (cp, qbn1, strlen (cp)))
244	retval = 14;	245	retval = 14;
245	/* Do substring checks, so things like 'Str+1' will match.	246	/* Do substring checks, so things like 'Str+1' will match.
246	* retval of these should perhaps be lower - they are lower	247	* retval of these should perhaps be lower - they are lower
247	* then the specific strcasecmp aboves, but still higher than	248	* then the specific strcasecmp aboves, but still higher than
248	* some other match criteria.	249	* some other match criteria.
249	*/	250	*/
250	else if (strstr (query_base_name (op, 1), cp))	251	else if (strstr (qbn1, cp))
251	retval = 12;	252	retval = 12;
252	else if (strstr (query_base_name (op, 0), cp))	253	else if (strstr (qbn0, cp))
253	retval = 12;	254	retval = 12;
254	else if (strstr (query_short_name (op), cp))	255	else if (strstr (qsn, cp))
255	retval = 12;	256	retval = 12;
256	/* Check against plural/non plural based on count. */	257	/* Check against plural/non plural based on count. */
257	else if (count > 1 && !strcasecmp (cp, op->name_pl))	258	else if (count > 1 && !strcasecmp (cp, op->name_pl))
258	retval = 6;	259	retval = 6;
259	else if (count == 1 && !strcasecmp (op->name, cp))	260	else if (count == 1 && !strcasecmp (op->name, cp))
260	retval = 6;	261	retval = 6;
261	/* base name matched - not bad */	262	/* base name matched - not bad */
262	else if (strcasecmp (cp, op->name) == 0 && !count)	263	else if (strcasecmp (cp, op->name) == 0 && !count)
263	retval = 4;	264	retval = 4;
264	/* Check for partial custom name, but give a real low priority */	265	/* Check for partial custom name, but give a real low priority */
265	else if (op->custom_name && strstr (op->custom_name, cp))	266	else if (op->custom_name.contains (cp))
266	retval = 3;	267	retval = 3;
267		268
268	if (retval)	269	if (retval)
269	{	270	{
270	if (pl->type == PLAYER)	271	if (pl->type == PLAYER)
…		…
275	}	276	}
276		277
277	return 0;	278	return 0;
278	}	279	}
279		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
280	void	292	void
281	init_archetypes (void)	293	archetype::link ()
282	{	294	{
283	load_archetypes ();	295	if (!archetypes.contains (this))
284
285	empty_archetype = archetype::find ("empty_archetype");
286	}
287
288	archetype::archetype ()
289	{
290	clone.arch = this;
291
292	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
293	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
294	}
295
296	archetype::~archetype ()
297	{
298	//TODO: nuke ->more's
299	}
300
301	static void
302	unlink (archetype *at)
303	{
304	if (at->head)
305	at = at->head;
306
307	// destroy this archetype's link, making singletons out of its parts
308	while (at)
309	{
310	archetype *more = at->more;
311	at->clone.destroy_inv ();
312	at->head = at->more = 0;
313	at = more;
314	}	296	{
		297	archetypes.insert (this);
		298	ht.insert (std::make_pair (archname, this));
		299	}
315	}	300	}
316		301
317	// dire hack, need to rationalise
318	void	302	void
319	overwrite (archetype at, object op)	303	archetype::unlink ()
320	{	304	{
321	at->clone = *op;	305	if (archetypes.contains (this))
322		306	{
323	at->clone.arch = at;	307	archetypes.erase (this);
324	//TODO: inv et al.	308	ht.erase (archname);
		309	}
		310	}
		311
		312	/*
		313	* Finds, using the hashtable, which archetype matches the given name.
		314	* returns a pointer to the found archetype, otherwise NULL.
		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;
325	}	328	}
326		329
327	archetype *	330	archetype *
328	archetype::read (object_thawer &f)	331	archetype::read (object_thawer &f)
329	{	332	{
330	assert (f.kw == KW_object);	333	assert (f.kw == KW_object);
331		334
332	archetype *head = get (f.get_str ());	335	std::vector<archetype *> parts;
333	unlink (head);
334	object *op = object::create ();
335		336
336	if (!op->parse_kv (f))	337	coroapi::cede_to_tick ();
337	{	338
338	op->destroy (true);	339	for (;;)
339	// leak head
340	return 0;
341	}	340	{
		341	archetype *at = new archetype (f.get_str ());
342		342
343	overwrite (head, op);
344	op->destroy ();
345
346	for (archetype *prev = head; f.kw == KW_more; )
347	{
348	f.next ();	343	f.next ();
349	assert (f.kw == KW_object);
350		344
351	archetype *more = get (f.get_str ());	345	#if 0
352	unlink (more);	346	// implementing it here in the server does neither allow multiple inheritence
353	object *op = object::create ();	347	// nor does it cleanly "just override". it would allow use in map files, though,
354		348	// and other resource files dynamically laoded (as opposed to being preprocessed).
355	if (!op->parse_kv (f))	349	// not that any of this is relevant as of yet...
		350	if (f.kw == KW_inherit)
356	{	351	{
357	op->destroy (true);	352	if (archetype *at = find (f.get_str ()))
358	// leak head more*	353	*op = at->clone;
359	return 0;	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 ();
360	}	359	}
		360	#endif
361		361
362	overwrite (more, op);	362	loading_arch = at; // hack to tell parse_kv et al. to behave
363	op->destroy ();	363	bool parse_ok = at->parse_kv (f);
		364	loading_arch = 0;
364		365
365	if (more->clone.x > head->tail_x) head->tail_x = more->clone.x;	366	if (!parse_ok)
366	if (more->clone.y > head->tail_y) head->tail_y = more->clone.y;	367	goto fail;
367		368
368	more->head = head;	369	loading_arch = at; // hack to tell parse_kv et al. to behave
369	more->clone.head = &head->clone;	370	at->post_load_check ();
370	prev->more = more;	371	loading_arch = 0;
371	prev->clone.more = &more->clone;
372		372
373	prev = more;	373	parts.push_back (at);
374	}
375		374
376	if (!head->next)	375	if (f.kw != KW_more)
377	{	376	break;
378	head->next = first_archetype;
379	first_archetype = head;
380	}
381		377
382	return head;	378	f.next ();
383	}
384		379
385	/*	380	if (f.kw != KW_object)
386	* Reads/parses the archetype-file, and copies into a linked list
387	* of archetype-structures.
388	*/
389	static bool
390	load_archetypes (object_thawer &f)
391	{
392	for (;;)
393	{
394	switch (f.kw)
395	{	381	{
396	case KW_object:	382	f.parse_error ("more object");
397	loading_arch = true;	383	goto fail;
398	if (!archetype::read (f))
399	{
400	loading_arch = false;
401	return false;
402	}
403
404	loading_arch = false;
405	continue;
406
407	case KW_EOF:
408	return true;
409
410	default:
411	if (!f.parse_error ("archetypes file"))
412	return false;
413	}	384	}
		385	}
414		386
415	f.next ();	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;
416	}	398	}
417	}
418		399
419	/*	400	// check that all archetypes belong to the same old object or are new
420	* First initialises the archtype hash-table (init_archetable()).	401	for (auto (at, parts.begin ()); at != parts.end (); ++at)
421	* Reads and parses the archetype file (with the first and second-pass	402	{
422	* functions).	403	archetype new_part = at;
423	*/	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	}
		452
424	void	453	void
425	load_archetypes (void)	454	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
426	{	455	{
427	char filename[MAX_BUF];	456	ref = 0;
428		457	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
429	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
430	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
431
432	object_thawer f (filename);
433
434	f.next ();
435
436	if (!load_archetypes (f))
437	cleanup ("unable to load archetypes");
438
439	warn_archetypes = 1;
440
441	load_treasures ();
442	}	458	}
443		459
444	/*	460	void
445	* Creates and returns a new object which is a copy of the given archetype.	461	archetype::commit_load ()
446	* This function returns NULL on failure.
447	*/
448	object *
449	arch_to_object (archetype *at)
450	{	462	{
		463	// unlink old archetypes and link in new ones */
		464	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
		465	{
		466	archetype at = p;
		467
		468	if (archetype *old = find (at->archname))
		469	old->unlink ();
		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
451	if (!at)	485	if (!at)
		486	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		487
		488	*ap = at;
452	{	489	}
453	if (warn_archetypes)
454	LOG (llevError, "Couldn't find archetype.\n");
455		490
456	return NULL;	491	postponed_arch_ref.clear ();
		492
		493	empty = find (shstr_empty_archetype);
		494	}
		495
		496	void
		497	archetype::gc ()
		498	{
		499	int cnt = max (1, min (allarch.size () / 128, dirtycnt));
		500	dirtycnt = max (0, dirtycnt - cnt);
		501
		502	do
457	}	503	{
		504	static int idx;
458		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;
		516	else
		517	{
		518	LOG (llevDebug, "garbage collect arch %s", &at->archname);
		519	assert (at->arch == at); // verify that refcnt == 1 is truly valid
		520	allarch.erase (idx);
		521
		522	// break chain
		523	for (object *op = at->head_ (); op; )
		524	{
		525	object *next = op->more;
		526	op->head = 0;
		527	op->more = 0;
		528	op = next;
		529	}
		530
		531	at->destroy ();
		532	at->arch = 0;
		533	}
		534	}
		535	while (--cnt);
		536	}
		537
		538	object *
		539	archetype::instance ()
		540	{
459	object *op = at->clone.clone ();	541	object *op = clone ();
460	op->arch = at;
461	op->instantiate ();	542	op->instantiate ();
462	return op;	543	return op;
463	}	544	}
464		545
465	/*	546	/*
…		…
469	* an object, and never NULL.	550	* an object, and never NULL.
470	*/	551	*/
471	object *	552	object *
472	create_singularity (const char *name)	553	create_singularity (const char *name)
473	{	554	{
474	object *op;	555	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
475	char buf[MAX_BUF];
476		556
477	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	557	if (!strcmp (name, "bug"))
478	op = object::create ();	558	abort ();
479	op->name = op->name_pl = buf;	559
480	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
481	return op;	563	return op;
482	}	564	}
483		565
484	/*	566	/*
485	* Finds which archetype matches the given name, and returns a new	567	* Finds which archetype matches the given name, and returns a new
486	* object containing a copy of the archetype.	568	* object containing a copy of the archetype.
487	*/	569	*/
488	object *	570	object *
489	get_archetype (const char *name)	571	get_archetype (const char *name)
490	{	572	{
		573	return archetype::get (name);
		574	}
		575
		576	object *
		577	archetype::get (const char *name)
		578	{
491	archetype *at = archetype::find (name);	579	archetype *at = find (name);
492		580
493	if (!at)	581	if (!at)
494	return create_singularity (name);	582	return create_singularity (name);
495		583
496	return arch_to_object (at);	584	return at->instance ();
497	}
498
499	/*
500	* Hash-function used by the arch-hashtable.
501	*/
502
503	unsigned long
504	hasharch (const char *str, int tablesize)
505	{
506	unsigned long hash = 0;
507	unsigned int i = 0;
508	const char *p;
509
510	/* use the one-at-a-time hash function, which supposedly is
511	* better than the djb2-like one used by perl5.005, but
512	* certainly is better then the bug used here before.
513	* see http://burtleburtle.net/bob/hash/doobs.html
514	*/
515	for (p = str; i < MAXSTRING && *p; p++, i++)
516	{
517	hash += *p;
518	hash += hash << 10;
519	hash ^= hash >> 6;
520	}
521
522	hash += hash << 3;
523	hash ^= hash >> 11;
524	hash += hash << 15;
525
526	return hash % tablesize;
527	}
528
529	/*
530	* Finds, using the hashtable, which archetype matches the given name.
531	* returns a pointer to the found archetype, otherwise NULL.
532	*/
533	archetype *
534	archetype::find (const char *name)
535	{
536	if (!name)
537	return 0;
538
539	AUTODECL (i, ht.find (name));
540
541	if (i == ht.end ())
542	return 0;
543	else
544	return i->second;
545	}
546
547	archetype *
548	archetype::get (const char *name)
549	{
550	archetype *at = find (name);
551
552	if (!at)
553	{
554	archetypes.push_back (at = new archetype);
555	at->name = name;
556	at->hash_add ();
557	}
558
559	return at;
560	}
561
562	/*
563	* Adds an archetype to the hashtable.
564	*/
565	void
566	archetype::hash_add ()
567	{
568	ht.insert (std::make_pair (name, this));
569	}
570
571	void
572	archetype::hash_del ()
573	{
574	ht.erase (name);
575	}	585	}
576		586
577	/*	587	/*
578	* Returns the first archetype using the given type.	588	* Returns the first archetype using the given type.
579	* Used in treasure-generation.	589	* Used in treasure-generation.
580	*/	590	*/
581	archetype *	591	archetype *
582	type_to_archetype (int type)	592	type_to_archetype (int type)
583	{	593	{
584	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	594	for_all_archetypes (at)
585	if (at->clone.type == type)	595	if (at->type == type && at->head_ () != at)
586	return at;	596	return at;
587		597
588	return 0;	598	return 0;
589	}	599	}
590		600
…		…
594	* Used in treasure-generation.	604	* Used in treasure-generation.
595	*/	605	*/
596	object *	606	object *
597	clone_arch (int type)	607	clone_arch (int type)
598	{	608	{
599	archetype *at;	609	archetype *at = type_to_archetype (type);
600		610
601	if ((at = type_to_archetype (type)) == NULL)	611	if (!at)
602	{	612	{
603	LOG (llevError, "Can't clone archetype %d\n", type);	613	LOG (llevError, "Can't clone archetype %d\n", type);
604	return 0;	614	return 0;
605	}	615	}
606		616
607	object *op = at->clone.clone ();	617	return at->instance ();
608	op->instantiate ();
609	return op;
610	}	618	}
611		619
612	/*	620	/*
613	* member: make instance from class	621	* member: make instance from class
614	*/	622	*/
615
616	object *	623	object *
617	object_create_arch (archetype *at)	624	object_create_arch (archetype *at)
618	{	625	{
619	object op, prev = 0, *head = 0;	626	object op, prev = 0, *head = 0;
620		627
621	while (at)	628	while (at)
622	{	629	{
623	op = arch_to_object (at);	630	op = at->instance ();
		631
624	op->x = at->clone.x;	632	op->x = at->x;
625	op->y = at->clone.y;	633	op->y = at->y;
626		634
627	if (head)	635	if (head)
628	op->head = head, prev->more = op;	636	op->head = head, prev->more = op;
629		637
630	if (!head)	638	if (!head)
631	head = op;	639	head = op;
632		640
633	prev = op;	641	prev = op;
634	at = at->more;	642	at = (archetype *)at->more;
635	}	643	}
636		644
637	return (head);	645	return head;
638	}	646	}
639		647

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.47 by root, Mon Apr 16 10:14:25 2007 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.47 by root, Mon Apr 16 10:14:25 2007 UTC vs.
Revision 1.91 by root, Tue Oct 27 01:38:39 2009 UTC