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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.43 by root, Fri Feb 16 19:43:40 2007 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 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	int arch_init; /* True if doing arch initialization */	33	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
35		34	arch_ptr archetype::empty;
36	/* The naming of these functions is really poor - they are all
37	* pretty much named '.._arch_...', but they may more may not
38	* return archetypes. Some make the arch_to_object call, and thus
39	* return an object. Perhaps those should be called 'archob' functions
40	* to denote they return an object derived from the archetype.
41	* MSW 2003-04-29
42	*/
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
		54	static std::vector<archetype *> postponed_arch;
		55
		56	//+GPL
55		57
56	/**	58	/**
57	* GROS - This function retrieves an archetype given the name that appears	59	* GROS - This function retrieves an archetype given the name that appears
58	* during the game (for example, "writing pen" instead of "stylus").	60	* during the game (for example, "writing pen" instead of "stylus").
59	* It does not use the hashtable system, but browse the whole archlist each time.	61	* It does not use the hashtable system, but browse the whole archlist each time.
…		…
67	archetype *	69	archetype *
68	find_archetype_by_object_name (const char *name)	70	find_archetype_by_object_name (const char *name)
69	{	71	{
70	shstr_cmp name_cmp (name);	72	shstr_cmp name_cmp (name);
71		73
72	for (archetype *at = first_archetype; at; at = at->next)	74	for_all_archetypes (at)
73	if (at->clone.name == name_cmp)	75	if (at->name == name_cmp)
74	return at;	76	return at;
75		77
76	return 0;	78	return 0;
77	}	79	}
78		80
…		…
84	archetype *	86	archetype *
85	find_archetype_by_object_type_name (int type, const char *name)	87	find_archetype_by_object_type_name (int type, const char *name)
86	{	88	{
87	shstr_cmp name_cmp (name);	89	shstr_cmp name_cmp (name);
88		90
89	for (archetype *at = first_archetype; at; at = at->next)	91	for_all_archetypes (at)
90	if (at->clone.name == name_cmp && at->clone.type == type)	92	if (at->name == name_cmp && at->type == type)
91	return at;	93	return at;
92		94
93	return 0;	95	return 0;
94	}	96	}
95		97
…		…
101	object *	103	object *
102	get_archetype_by_skill_name (const char *skill, int type)	104	get_archetype_by_skill_name (const char *skill, int type)
103	{	105	{
104	shstr_cmp skill_cmp (skill);	106	shstr_cmp skill_cmp (skill);
105		107
106	for (archetype *at = first_archetype; at; at = at->next)	108	for_all_archetypes (at)
107	if (at->clone.skill == skill_cmp && (type == -1 \|\| type == at->clone.type))	109	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
108	return arch_to_object (at);	110	return at->instance ();
109		111
110	return 0;	112	return 0;
111	}	113	}
112		114
113	/* similiar to above - this returns the first archetype	115	/* similiar to above - this returns the first archetype
…		…
118	* (eg, skills)	120	* (eg, skills)
119	*/	121	*/
120	archetype *	122	archetype *
121	get_archetype_by_type_subtype (int type, int subtype)	123	get_archetype_by_type_subtype (int type, int subtype)
122	{	124	{
123	for (archetype *at = first_archetype; at; at = at->next)	125	for_all_archetypes (at)
124	if ((type == -1 \|\| type == at->clone.type) && (subtype == -1 \|\| subtype == at->clone.subtype))	126	if ((type == -1 \|\| type == at->type) && (subtype == -1 \|\| subtype == at->subtype))
125	return at;	127	return at;
126		128
127	return 0;	129	return 0;
128	}	130	}
129		131
…		…
134	* - name: The name we're searching for (ex: "writing pen");	136	* - name: The name we're searching for (ex: "writing pen");
135	* Return value:	137	* Return value:
136	* - a corresponding object if found; a singularity object if not found.	138	* - a corresponding object if found; a singularity object if not found.
137	* Note by MSW - it appears that it takes the full name and keeps	139	* Note by MSW - it appears that it takes the full name and keeps
138	* shortening it until it finds a match. I re-wrote this so that it	140	* shortening it until it finds a match. I re-wrote this so that it
139	* doesn't malloc it each time - not that this function is used much,	141	* doesn't allocate it each time - not that this function is used much,
140	* but it otherwise had a big memory leak.	142	* but it otherwise had a big memory leak.
141	*/	143	*/
142	object *	144	object *
143	get_archetype_by_object_name (const char *name)	145	get_archetype_by_object_name (const char *name)
144	{	146	{
145	char tmpname[MAX_BUF];	147	char tmpname[MAX_BUF];
146	int i;
147		148
148	assign (tmpname, name);	149	assign (tmpname, name);
149		150
150	for (i = strlen (tmpname); i > 0; i--)	151	for (int i = strlen (tmpname); i > 0; i--)
151	{	152	{
152	tmpname[i] = 0;	153	tmpname[i] = 0;
153		154
154	if (archetype *at = find_archetype_by_object_name (tmpname))	155	if (archetype *at = find_archetype_by_object_name (tmpname))
155	return arch_to_object (at);	156	return at->instance ();
156	}	157	}
157		158
158	return create_singularity (name);	159	return create_singularity (name);
159	}	160	}
160		161
161	/* This is a subset of the parse_id command. Basically, name can be	162	/* This is a subset of the parse_id command. Basically, name can be
162	* a string seperated lists of things to match, with certain keywords.	163	* a string seperated lists of things to match, with certain keywords.
163	* pl is the player (only needed to set count properly)	164	* pl is the player (only needed to set count properly)
164	* op is the item we are trying to match. Calling function takes care	165	* op is the item we are trying to match. Calling function takes care
165	* of what action might need to be done and if it is valid	166	* of what action might need to be done and if it is valid
166	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher	167	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
167	* value means a better match. 0 means no match.	168	* value means a better match. 0 means no match.
168	*	169	*
169	* Brief outline of the procedure:	170	* Brief outline of the procedure:
170	* We take apart the name variable into the individual components.	171	* We take apart the name variable into the individual components.
171	* cases for 'all' and unpaid are pretty obvious.	172	* cases for 'all' and unpaid are pretty obvious.
172	* Next, we check for a count (either specified in name, or in the	173	* Next, we check for a count (either specified in name, or in the
173	* player object.)	174	* player object.)
174	* If count is 1, make a quick check on the name.	175	* If count is 1, make a quick check on the name.
175	* IF count is >1, we need to make plural name. Return if match.	176	* IF count is >1, we need to make plural name. Return if match.
176	* Last, make a check on the full name.	177	* Last, make a check on the full name.
177	*/	178	*/
178	int	179	int
179	item_matched_string (object pl, object op, const char *name)	180	item_matched_string (object pl, object op, const char *name)
180	{	181	{
181	char *cp, local_name[MAX_BUF];	182	char *cp, local_name[MAX_BUF];
182	int count, retval = 0;	183	int count, retval = 0;
…		…
194	return 1;	195	return 1;
195		196
196	/* unpaid is a little more specific */	197	/* unpaid is a little more specific */
197	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	198	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
198	return 2;	199	return 2;
		200
199	if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))	201	if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))
200	return 2;	202	return 2;
201		203
202	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	204	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
203	return 2;	205	return 2;
…		…
225	* is because of the 'else' handling - we don't want to match on	227	* is because of the 'else' handling - we don't want to match on
226	* something and set a low retval, even though it may match a higher retcal	228	* something and set a low retval, even though it may match a higher retcal
227	* later. So keep it in descending order here, so we try for the best	229	* later. So keep it in descending order here, so we try for the best
228	* match first, and work downward.	230	* match first, and work downward.
229	*/	231	*/
		232	const char qbn0, qbn1, *qsn; // query base name/short name caches
		233
230	if (!strcasecmp (cp, query_name (op)))	234	if (!strcasecmp (cp, query_name (op)))
231	retval = 20;	235	retval = 20;
232	else if (!strcasecmp (cp, query_short_name (op)))	236	else if (!strcasecmp (cp, qsn = query_short_name (op)))
233	retval = 18;	237	retval = 18;
234	else if (!strcasecmp (cp, query_base_name (op, 0)))	238	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
235	retval = 16;	239	retval = 16;
236	else if (!strcasecmp (cp, query_base_name (op, 1)))	240	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
237	retval = 16;	241	retval = 16;
238	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	242	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
239	retval = 15;	243	retval = 15;
240	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	244	else if (!strncasecmp (cp, qbn0, strlen (cp)))
241	retval = 14;	245	retval = 14;
242	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	246	else if (!strncasecmp (cp, qbn1, strlen (cp)))
243	retval = 14;	247	retval = 14;
244	/* Do substring checks, so things like 'Str+1' will match.	248	/* Do substring checks, so things like 'Str+1' will match.
245	* retval of these should perhaps be lower - they are lower	249	* retval of these should perhaps be lower - they are lower
246	* then the specific strcasecmp aboves, but still higher than	250	* then the specific strcasecmp aboves, but still higher than
247	* some other match criteria.	251	* some other match criteria.
248	*/	252	*/
249	else if (strstr (query_base_name (op, 1), cp))	253	else if (strstr (qbn1, cp))
250	retval = 12;	254	retval = 12;
251	else if (strstr (query_base_name (op, 0), cp))	255	else if (strstr (qbn0, cp))
252	retval = 12;	256	retval = 12;
253	else if (strstr (query_short_name (op), cp))	257	else if (strstr (qsn, cp))
254	retval = 12;	258	retval = 12;
255	/* Check against plural/non plural based on count. */	259	/* Check against plural/non plural based on count. */
256	else if (count > 1 && !strcasecmp (cp, op->name_pl))	260	else if (count > 1 && !strcasecmp (cp, op->name_pl))
257	retval = 6;	261	retval = 6;
258	else if (count == 1 && !strcasecmp (op->name, cp))	262	else if (count == 1 && !strcasecmp (op->name, cp))
259	retval = 6;	263	retval = 6;
260	/* base name matched - not bad */	264	/* base name matched - not bad */
261	else if (strcasecmp (cp, op->name) == 0 && !count)	265	else if (strcasecmp (cp, op->name) == 0 && !count)
262	retval = 4;	266	retval = 4;
263	/* Check for partial custom name, but give a real low priority */	267	/* Check for partial custom name, but give a real low priority */
264	else if (op->custom_name && strstr (op->custom_name, cp))	268	else if (op->custom_name.contains (cp))
265	retval = 3;	269	retval = 3;
266		270
267	if (retval)	271	if (retval)
268	{	272	{
269	if (pl->type == PLAYER)	273	if (pl->type == PLAYER)
…		…
274	}	278	}
275		279
276	return 0;	280	return 0;
277	}	281	}
278		282
		283	//-GPL
		284
		285	archetype::archetype (const char *name)
		286	{
		287	arch = this;
		288	this->archname = this->name = this->name_pl = name;
		289	}
		290
		291	archetype::~archetype ()
		292	{
		293	unlink ();
		294	}
		295
		296	void
		297	archetype::link ()
		298	{
		299	if (!archetypes.contains (this))
		300	{
		301	archetypes.insert (this);
		302	ht.insert (std::make_pair (archname, this));
		303	}
		304	}
		305
		306	void
		307	archetype::unlink ()
		308	{
		309	if (archetypes.contains (this))
		310	{
		311	archetypes.erase (this);
		312	ht.erase (archname);
		313	}
		314	}
		315
279	/*	316	/*
280	* Initialises the internal linked list of archetypes (read from file).	317	* Finds, using the hashtable, which archetype matches the given name.
281	* Then the global "empty_archetype" pointer is initialised.	318	* returns a pointer to the found archetype, otherwise NULL.
282	* Then the blocksview[] array is initialised.
283	*/	319	*/
284		320	archetype *
285	void	321	archetype::find (const char *name)
286	init_archetypes (void)	322	{
287	{ /* called from add_player() and edit() */	323	if (!name)
288	if (first_archetype != NULL) /* Only do this once */
289	return;	324	return 0;
290		325
291	arch_init = 1;	326	auto (i, ht.find (name));
292	load_archetypes ();
293	arch_init = 0;
294	empty_archetype = archetype::find ("empty_archetype");
295		327
296	/* init_blocksview();*/	328	if (i == ht.end ())
297	}	329	return 0;
298
299	/*
300	* An alternative way to init the hashtable which is slower, but _works_...
301	*/
302	void
303	init_archetable (void)
304	{
305	LOG (llevDebug, " Setting up archetable...\n");
306
307	for (archetype *at = first_archetype; at; at = at->next)
308	for (archetype *bt = at; bt; bt = bt->more)
309	bt->hash_add ();
310
311	LOG (llevDebug, "done\n");
312	}
313
314	void
315	free_all_archs (void)
316	{
317	archetype at, next;
318	int i = 0, f = 0;
319
320	for (at = first_archetype; at; at = next)
321	{
322	if (at->more)
323	next = at->more;
324	else	330	else
325	next = at->next;	331	return i->second;
326
327	delete
328	at;
329
330	i++;
331	}
332
333	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
334	}
335
336	archetype::archetype ()
337	{
338	clone.arch = this;
339
340	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
341	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
342	}
343
344	archetype::~archetype ()
345	{
346	//TODO: nuke ->more's
347	}	332	}
348		333
349	archetype *	334	archetype *
350	archetype::read (object_thawer &f)	335	archetype::read (object_thawer &f)
351	{	336	{
352	assert (f.kw == KW_object);	337	assert (f.kw == KW_object);
353		338
354	archetype *head = new archetype;	339	std::vector<archetype *> parts;
355	f.get (head->name);
356		340
357	if (!head->clone.parse_kv (f))	341	coroapi::cede_to_tick ();
358	{	342
359	delete head;	343	for (;;)
360	return 0;
361	}	344	{
		345	archetype *at = new archetype (f.get_str ());
362		346
363	for (archetype *prev = head; f.kw == KW_more; )
364	{
365	f.next ();	347	f.next ();
366		348
367	assert (f.kw == KW_object);	349	#if 0
368		350	// implementing it here in the server does neither allow multiple inheritence
369	archetype *more = new archetype;	351	// nor does it cleanly "just override". it would allow use in map files, though,
370	f.get (more->name);	352	// and other resource files dynamically laoded (as opposed to being preprocessed).
371		353	// not that any of this is relevant as of yet...
372	if (!more->clone.parse_kv (f))	354	if (f.kw == KW_inherit)
373	{	355	{
374	delete head;	356	if (archetype *at = find (f.get_str ()))
375	return 0;	357	*op = at->clone;
		358	else
		359	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		360	&at->archname, f.get_str ());
		361
		362	f.next ();
376	}	363	}
		364	#endif
377		365
378	assert (("pippijn sagt es gibt keine tiles mehr", head->clone.face == more->clone.face));	366	loading_arch = at; // hack to tell parse_kv et al. to behave
		367	bool parse_ok = at->parse_kv (f);
		368	loading_arch = 0;
379		369
380	if (more->clone.x > head->tail_x) head->tail_x = more->clone.x;	370	if (!parse_ok)
381	if (more->clone.y > head->tail_y) head->tail_y = more->clone.y;	371	goto fail;
382		372
383	more->head = head;	373	loading_arch = at; // hack to tell parse_kv et al. to behave
384	more->clone.head = &head->clone;	374	at->post_load_check ();
385	prev->more = more;	375	loading_arch = 0;
386	prev->clone.more = &more->clone;
387		376
388	prev = more;	377	parts.push_back (at);
389	}
390		378
391	head->next = first_archetype;	379	if (f.kw != KW_more)
392	first_archetype = head;	380	break;
393		381
394	return head;	382	f.next ();
395	}
396		383
397	/*	384	if (f.kw != KW_object)
398	* Reads/parses the archetype-file, and copies into a linked list
399	* of archetype-structures.
400	*/
401	static bool
402	first_arch_pass (object_thawer &f)
403	{
404	for (;;)
405	{
406	switch (f.kw)
407	{	385	{
408	case KW_object:	386	f.parse_error ("more object");
409	if (!archetype::read (f))	387	goto fail;
410	return false;
411	continue;
412
413	case KW_EOF:
414	return true;
415
416	default:
417	if (!f.parse_error ("archetypes file"))
418	return false;
419	}	388	}
		389	}
420		390
421	f.next ();	391	{
		392	auto (at, parts.begin ());
		393
		394	archetype *new_head = parts.front ();
		395	archetype *old_head = find (new_head->archname);
		396
		397	if (old_head && !old_head->is_head ())
		398	{
		399	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		400	&new_head->archname, &old_head->archname);
		401	goto fail;
422	}	402	}
423	}
424		403
425	/*	404	// check that all archetypes belong to the same old object or are new
426	* Reads the archetype file once more, and links all pointers between	405	for (auto (at, parts.begin ()); at != parts.end (); ++at)
427	* archetypes.	406	{
428	*/	407	archetype new_part = at;
		408	archetype *old_part = find (new_part->archname);
		409
		410	if (old_part && old_part->head_ () != old_head)
		411	{
		412	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		413	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		414	goto fail;
		415	}
		416	}
		417
		418	// assemble new chain
		419	new_head->min_x = new_head->max_x = new_head->x;
		420	new_head->min_y = new_head->max_y = new_head->y;
		421
		422	archetype *less = new_head;
		423	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		424	{
		425	archetype at = p;
		426
		427	// some flags get inherited from the head (probably a lot more)
		428	// doing it here doesn't feel too cozy, but it allows code
		429	// to ignore head checks for these flags, which saves time
		430	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		431	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		432	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		433	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		434
		435	new_head->min_x = min (new_head->min_x, at->x);
		436	new_head->min_y = min (new_head->min_y, at->y);
		437	new_head->max_x = max (new_head->max_x, at->x);
		438	new_head->max_y = max (new_head->max_y, at->y);
		439
		440	at->head = new_head;
		441	less->more = at;
		442	less = at;
		443	}
		444
		445	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
		446
		447	return new_head;
		448	}
		449
		450	fail:
		451	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		452	(*p)->destroy ();
		453
		454	return 0;
		455	}
		456
429	void	457	void
430	second_arch_pass (object_thawer & thawer)	458	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
431	{	459	{
432	char buf[MAX_BUF], variable = buf, argument, *cp;	460	ref = 0;
433	archetype at = NULL, other;	461	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
		462	}
434		463
435	while (fgets (buf, MAX_BUF, thawer) != NULL)	464	void
		465	archetype::commit_load ()
		466	{
		467	// unlink old archetypes and link in new ones */
		468	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
		469	{
		470	archetype at = p;
		471
		472	if (archetype *old = find (at->archname))
		473	old->unlink ();
		474
		475	allarch.push_back (at);
		476
		477	at->link ();
		478	++dirtycnt;
436	{	479	}
437	if (*buf == '#')
438	continue;
439		480
440	if ((argument = strchr (buf, ' ')) != NULL)	481	postponed_arch.clear ();
		482
		483	// now resolve arch references
		484	for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
		485	{
		486	arch_ptr *ap = p->first;
		487	archetype *at = find (p->second);
		488
		489	if (!at)
		490	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		491
		492	*ap = at;
		493	}
		494
		495	postponed_arch_ref.clear ();
		496
		497	empty = find (shstr_empty_archetype);
		498	}
		499
		500	void
		501	archetype::gc ()
		502	{
		503	int cnt = max (1, min (allarch.size () / 128, dirtycnt));
		504	dirtycnt = max (0, dirtycnt - cnt);
		505
		506	do
		507	{
		508	static int idx;
		509
		510	if (idx >= allarch.size ())
		511	if (idx)
		512	idx = 0;
		513	else
		514	return;
		515
		516	archetype *at = allarch [idx];
		517
		518	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
		519	++idx;
		520	else
441	{	521	{
442	*argument = '\0', argument++;	522	LOG (llevDebug, "garbage collect arch %s", &at->archname);
443	cp = argument + strlen (argument) - 1;	523	assert (at->arch == at); // verify that refcnt == 1 is truly valid
444	while (isspace (*cp))	524	allarch.erase (idx);
		525
		526	// break chain
		527	for (object *op = at->head_ (); op; )
445	{	528	{
		529	object *next = op->more;
		530	op->head = 0;
		531	op->more = 0;
446	*cp = '\0';	532	op = next;
447	cp--;
448	}	533	}
		534
		535	at->destroy ();
		536	at->arch = 0;
449	}	537	}
450
451	if (!strcmp ("object", variable))
452	{
453	if ((at = archetype::find (argument)) == NULL)
454	LOG (llevError, "Warning: failed to find arch %s\n", argument);
455	}
456	else if (!strcmp ("other_arch", variable))
457	{
458	if (at != NULL && at->clone.other_arch == NULL)
459	{
460	if ((other = archetype::find (argument)) == NULL)
461	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
462	else if (at != NULL)
463	at->clone.other_arch = other;
464	}
465	}
466	else if (!strcmp ("randomitems", variable))
467	{
468	if (at)
469	{
470	treasurelist *tl = find_treasurelist (argument);
471
472	if (tl == NULL)
473	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
474	else
475	at->clone.randomitems = tl;
476	}
477	}
478	}
479	}
480
481	#ifdef DEBUG
482	void
483	check_generators (void)
484	{
485	archetype *at;
486
487	for (at = first_archetype; at != NULL; at = at->next)
488	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
489	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
490	}
491	#endif
492
493	/*
494	* First initialises the archtype hash-table (init_archetable()).
495	* Reads and parses the archetype file (with the first and second-pass
496	* functions).
497	* Then initialises treasures by calling load_treasures().
498	*/
499
500	void
501	load_archetypes (void)
502	{
503	char filename[MAX_BUF];
504
505	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
506	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
507
508	{
509	object_thawer f (filename);
510
511	f.next ();
512
513	LOG (llevDebug, " arch-pass 1...\n");
514	if (!first_arch_pass (f))
515	cleanup ("errors during first arch pass are fatal");
516	LOG (llevDebug, " done\n");
517	}
518
519	init_archetable ();
520	warn_archetypes = 1;
521
522	{
523	object_thawer f (filename);
524
525	LOG (llevDebug, " loading treasure...\n");
526	load_treasures ();
527	LOG (llevDebug, " done\n");
528	LOG (llevDebug, " arch-pass 2...\n");
529	second_arch_pass (f);
530	LOG (llevDebug, " done\n");
531	#ifdef DEBUG
532	check_generators ();
533	#endif
534	}
535	LOG (llevDebug, " done\n");
536	}
537
538	/*
539	* Creates and returns a new object which is a copy of the given archetype.
540	* This function returns NULL on failure.
541	*/
542	object *
543	arch_to_object (archetype *at)
544	{
545	if (!at)
546	{	538	}
547	if (warn_archetypes)	539	while (--cnt);
548	LOG (llevError, "Couldn't find archetype.\n");	540	}
549		541
550	return NULL;	542	object *
551	}	543	archetype::instance ()
552		544	{
553	object *op = at->clone.clone ();	545	object *op = clone ();
554	op->arch = at;
555	op->instantiate ();	546	op->instantiate ();
556	return op;	547	return op;
557	}	548	}
		549
		550	//+GPL
558		551
559	/*	552	/*
560	* Creates an object. This function is called by get_archetype()	553	* Creates an object. This function is called by get_archetype()
561	* if it fails to find the appropriate archetype.	554	* if it fails to find the appropriate archetype.
562	* Thus get_archetype() will be guaranteed to always return	555	* Thus get_archetype() will be guaranteed to always return
563	* an object, and never NULL.	556	* an object, and never NULL.
564	*/	557	*/
565	object *	558	object *
566	create_singularity (const char *name)	559	create_singularity (const char *name)
567	{	560	{
568	object *op;	561	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
569	char buf[MAX_BUF];
570		562
571	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	563	if (!strcmp (name, "bug"))
572	op = object::create ();	564	abort ();
573	op->name = op->name_pl = buf;	565
574	SET_FLAG (op, FLAG_NO_PICK);	566	object *op = archetype::get (shstr_bug);
		567	op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
		568
575	return op;	569	return op;
576	}	570	}
577		571
578	/*	572	/*
579	* Finds which archetype matches the given name, and returns a new	573	* Finds which archetype matches the given name, and returns a new
580	* object containing a copy of the archetype.	574	* object containing a copy of the archetype.
581	*/	575	*/
582	object *	576	object *
583	get_archetype (const char *name)	577	get_archetype (const char *name)
584	{	578	{
		579	return archetype::get (name);
		580	}
		581
		582	object *
		583	archetype::get (const char *name)
		584	{
585	archetype *at = archetype::find (name);	585	archetype *at = find (name);
586		586
587	if (!at)	587	if (!at)
588	return create_singularity (name);	588	return create_singularity (name);
589		589
590	return arch_to_object (at);	590	return at->instance ();
591	}
592
593	/*
594	* Hash-function used by the arch-hashtable.
595	*/
596
597	unsigned long
598	hasharch (const char *str, int tablesize)
599	{
600	unsigned long hash = 0;
601	unsigned int i = 0;
602	const char *p;
603
604	/* use the one-at-a-time hash function, which supposedly is
605	* better than the djb2-like one used by perl5.005, but
606	* certainly is better then the bug used here before.
607	* see http://burtleburtle.net/bob/hash/doobs.html
608	*/
609	for (p = str; i < MAXSTRING && *p; p++, i++)
610	{
611	hash += *p;
612	hash += hash << 10;
613	hash ^= hash >> 6;
614	}
615
616	hash += hash << 3;
617	hash ^= hash >> 11;
618	hash += hash << 15;
619
620	return hash % tablesize;
621	}
622
623	/*
624	* Finds, using the hashtable, which archetype matches the given name.
625	* returns a pointer to the found archetype, otherwise NULL.
626	*/
627	archetype *
628	archetype::find (const char *name)
629	{
630	if (!name)
631	return 0;
632
633	AUTODECL (i, ht.find (name));
634
635	if (i == ht.end ())
636	return 0;
637	else
638	return i->second;
639	}
640
641	/*
642	* Adds an archetype to the hashtable.
643	*/
644	void
645	archetype::hash_add ()
646	{
647	ht.insert (std::make_pair (name, this));
648	}
649
650	void
651	archetype::hash_del ()
652	{
653	ht.erase (name);
654	}	591	}
655		592
656	/*	593	/*
657	* Returns the first archetype using the given type.	594	* Returns the first archetype using the given type.
658	* Used in treasure-generation.	595	* Used in treasure-generation.
659	*/	596	*/
660	archetype *	597	archetype *
661	type_to_archetype (int type)	598	type_to_archetype (int type)
662	{	599	{
663	archetype *at;	600	for_all_archetypes (at)
664		601	if (at->type == type && at->head_ () != at)
665	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
666	if (at->clone.type == type)
667	return at;	602	return at;
668		603
669	return 0;	604	return 0;
670	}	605	}
671		606
672	/*	607	/*
673	* Returns a new object copied from the first archetype matching	608	* Returns a new object copied from the first archetype matching
674	* the given type.	609	* the given type.
675	* Used in treasure-generation.	610	* Used in treasure-generation.
676	*/	611	*/
677
678	object *	612	object *
679	clone_arch (int type)	613	clone_arch (int type)
680	{	614	{
681	archetype *at;	615	archetype *at = type_to_archetype (type);
682		616
683	if ((at = type_to_archetype (type)) == NULL)	617	if (!at)
684	{	618	{
685	LOG (llevError, "Can't clone archetype %d\n", type);	619	LOG (llevError, "Can't clone archetype %d\n", type);
686	return 0;	620	return 0;
687	}	621	}
688		622
689	object *op = at->clone.clone ();	623	return at->instance ();
690	op->instantiate ();
691	return op;
692	}	624	}
693		625
694	/*	626	/*
695	* member: make instance from class	627	* member: make instance from class
696	*/	628	*/
697
698	object *	629	object *
699	object_create_arch (archetype *at)	630	object_create_arch (archetype *at)
700	{	631	{
701	object op, prev = 0, *head = 0;	632	object op, prev = 0, *head = 0;
702		633
703	while (at)	634	while (at)
704	{	635	{
705	op = arch_to_object (at);	636	op = at->instance ();
		637
706	op->x = at->clone.x;	638	op->x = at->x;
707	op->y = at->clone.y;	639	op->y = at->y;
708		640
709	if (head)	641	if (head)
710	op->head = head, prev->more = op;	642	op->head = head, prev->more = op;
711		643
712	if (!head)	644	if (!head)
713	head = op;	645	head = op;
714		646
715	prev = op;	647	prev = op;
716	at = at->more;	648	at = (archetype *)at->more;
717	}	649	}
718		650
719	return (head);	651	return head;
720	}	652	}
721		653
		654	//-GPL
		655

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.43 by root, Fri Feb 16 19:43:40 2007 UTC vs. Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.43 by root, Fri Feb 16 19:43:40 2007 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC