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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.35 by root, Wed Jan 3 20:32:13 2007 UTC vs.
Revision 1.67 by root, Sat Jun 9 21:16:12 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.35 by root, Wed Jan 3 20:32:13 2007 UTC vs. Revision 1.67 by root, Sat Jun 9 21:16:12 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.35 by root, Wed Jan 3 20:32:13 2007 UTC vs.
Revision 1.67 by root, Sat Jun 9 21:16:12 2007 UTC