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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.38 by root, Fri Feb 2 21:50:43 2007 UTC vs. Revision 1.74 by root, Sun Apr 20 05:24:55 2008 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.38 by root, Fri Feb 2 21:50:43 2007 UTC vs.
Revision 1.74 by root, Sun Apr 20 05:24:55 2008 UTC