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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.45 by root, Fri Apr 13 07:26:29 2007 UTC vs. Revision 1.82 by root, Sun May 18 19:53:07 2008 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.45 by root, Fri Apr 13 07:26:29 2007 UTC vs.
Revision 1.82 by root, Sun May 18 19:53:07 2008 UTC