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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.25 by root, Tue Nov 7 16:30:54 2006 UTC vs.
Revision 1.70 by root, Tue Oct 16 00:30:24 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.25 by root, Tue Nov 7 16:30:54 2006 UTC vs. Revision 1.70 by root, Tue Oct 16 00:30:24 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.25 by root, Tue Nov 7 16:30:54 2006 UTC vs.
Revision 1.70 by root, Tue Oct 16 00:30:24 2007 UTC