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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.36 by pippijn, Sat Jan 6 14:42:28 2007 UTC vs. Revision 1.78 by root, Fri May 2 16:16:02 2008 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.36 by pippijn, Sat Jan 6 14:42:28 2007 UTC vs.
Revision 1.78 by root, Fri May 2 16:16:02 2008 UTC