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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.20 by root, Thu Sep 14 21:16:11 2006 UTC vs.
Revision 1.62 by root, Mon Jun 4 12:19:08 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-devel@real-time.com	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 <tr1/unordered_map>
27
28	#include <global.h>	27	#include <global.h>
29	#include <arch.h>
30	#include <funcpoint.h>	28	#include <funcpoint.h>
31	#include <loader.h>	29	#include <loader.h>
32		30
33	/* IF set, does a little timing on the archetype load. */	31	#include <tr1/functional>
34	#define TIME_ARCH_LOAD 0	32	#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		33
43	/* The naming of these functions is really poor - they are all	34	/* The naming of these functions is really poor - they are all
44	* pretty much named '.._arch_...', but they may more may not	35	* pretty much named '.._arch_...', but they may more may not
45	* return archetypes. Some make the arch_to_object call, and thus	36	* return archetypes. Some make the arch_to_object call, and thus
46	* return an object. Perhaps those should be called 'archob' functions	37	* return an object. Perhaps those should be called 'archob' functions
47	* to denote they return an object derived from the archetype.	38	* to denote they return an object derived from the archetype.
48	* MSW 2003-04-29	39	* MSW 2003-04-29
49	*/	40	*/
50		41
51	#if USE_UNORDERED_MAP	42	bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
		43
52	// the hashtable	44	// the hashtable
53	typedef std::tr1::unordered_map	45	typedef std::tr1::unordered_map
54	<	46	<
55	std::size_t,	47	const char *,
56	archetype *,	48	arch_ptr,
57	std::hash<size_t>,	49	str_hash,
58	std::equal_to<size_t>,	50	str_equal,
59	slice_allocator< std::pair<const std::size_t, archetype *> >	51	slice_allocator< std::pair<const char *const, arch_ptr> >
60	true,
61	> HT;	52	> HT;
62		53
63	static HT ht;	54	static HT ht (5000);
64	#endif	55	archvec archetypes;
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)
83	return (archetype *) NULL;
84
85	for (at = first_archetype; at != NULL; at = at->next)	73	for (archetype *at = first_archetype; at; at = at->next)
86	{	74	if (at->clone.name == name_cmp)
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)
104	return NULL;
105
106	for (at = first_archetype; at != NULL; at = at->next)	90	for (archetype *at = first_archetype; at; at = at->next)
107	{	91	if (at->clone.name == name_cmp && at->clone.type == type)
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 *	105	shstr_cmp skill_cmp (skill);
124	at;
125		106
126	if (skill == NULL)
127	return NULL;
128
129	for (at = first_archetype; at != NULL; at = at->next)	107	for (archetype *at = first_archetype; at; at = at->next)
130	{	108	if (at->clone.skill == skill_cmp && (type == -1 \|\| type == at->clone.type))
131	if (((type == -1) \|\| (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))
132	return arch_to_object (at);	109	return arch_to_object (at);
133	}	110
134	return NULL;	111	return 0;
135	}	112	}
136		113
137	/* similiar to above - this returns the first archetype	114	/* similiar to above - this returns the first archetype
138	* that matches both the type and subtype. type and subtype	115	* 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	116	* can be -1 to say ignore, but in this case, the match it does
…		…
142	* (eg, skills)	119	* (eg, skills)
143	*/	120	*/
144	archetype *	121	archetype *
145	get_archetype_by_type_subtype (int type, int subtype)	122	get_archetype_by_type_subtype (int type, int subtype)
146	{	123	{
147	archetype *
148	at;
149
150	for (at = first_archetype; at != NULL; at = at->next)	124	for (archetype *at = first_archetype; at; at = at->next)
151	{
152	if (((type == -1) \|\| (type == at->clone.type)) && (subtype == -1 \|\| subtype == at->clone.subtype))	125	if ((type == -1 \|\| type == at->clone.type) && (subtype == -1 \|\| subtype == at->clone.subtype))
153	return at;	126	return at;
154	}	127
155	return NULL;	128	return 0;
156	}	129	}
157		130
158	/**	131	/**
159	* 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
160	* (for example, "writing pen" instead of "stylus").	133	* (for example, "writing pen" instead of "stylus").
…		…
168	* but it otherwise had a big memory leak.	141	* but it otherwise had a big memory leak.
169	*/	142	*/
170	object *	143	object *
171	get_archetype_by_object_name (const char *name)	144	get_archetype_by_object_name (const char *name)
172	{	145	{
173	archetype *at;
174	char tmpname[MAX_BUF];	146	char tmpname[MAX_BUF];
175	int i;	147	int i;
176		148
177	assign (tmpname, name);	149	assign (tmpname, name);
178		150
179	for (i = strlen (tmpname); i > 0; i--)	151	for (i = strlen (tmpname); i > 0; i--)
180	{	152	{
181	tmpname[i] = 0;	153	tmpname[i] = 0;
		154
182	at = find_archetype_by_object_name (tmpname);	155	if (archetype *at = find_archetype_by_object_name (tmpname))
183
184	if (at != NULL)
185	return arch_to_object (at);	156	return arch_to_object (at);
186	}	157	}
187		158
188	return create_singularity (name);	159	return create_singularity (name);
189	}	160	}
…		…
206	* Last, make a check on the full name.	177	* Last, make a check on the full name.
207	*/	178	*/
208	int	179	int
209	item_matched_string (object pl, object op, const char *name)	180	item_matched_string (object pl, object op, const char *name)
210	{	181	{
211	char *
212	cp,
213	local_name[MAX_BUF];	182	char *cp, local_name[MAX_BUF];
214	int	183	int count, retval = 0;
215	count,
216	retval = 0;
217		184
218	strcpy (local_name, name); /* strtok is destructive to name */	185	assign (local_name, name); /* strtok is destructive to name */
219		186
220	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))	187	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
221	{	188	{
222	while (cp[0] == ' ')	189	while (cp[0] == ' ')
223	++cp; /* get rid of spaces */	190	++cp; /* get rid of spaces */
…		…
273	retval = 15;	240	retval = 15;
274	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	241	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
275	retval = 14;	242	retval = 14;
276	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	243	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
277	retval = 14;	244	retval = 14;
278
279	/* Do substring checks, so things like 'Str+1' will match.	245	/* Do substring checks, so things like 'Str+1' will match.
280	* retval of these should perhaps be lower - they are lower	246	* retval of these should perhaps be lower - they are lower
281	* then the specific strcasecmp aboves, but still higher than	247	* then the specific strcasecmp aboves, but still higher than
282	* some other match criteria.	248	* some other match criteria.
283	*/	249	*/
…		…
285	retval = 12;	251	retval = 12;
286	else if (strstr (query_base_name (op, 0), cp))	252	else if (strstr (query_base_name (op, 0), cp))
287	retval = 12;	253	retval = 12;
288	else if (strstr (query_short_name (op), cp))	254	else if (strstr (query_short_name (op), cp))
289	retval = 12;	255	retval = 12;
290
291	/* Check against plural/non plural based on count. */	256	/* Check against plural/non plural based on count. */
292	else if (count > 1 && !strcasecmp (cp, op->name_pl))	257	else if (count > 1 && !strcasecmp (cp, op->name_pl))
293	{
294	retval = 6;	258	retval = 6;
295	}
296	else if (count == 1 && !strcasecmp (op->name, cp))	259	else if (count == 1 && !strcasecmp (op->name, cp))
297	{
298	retval = 6;	260	retval = 6;
299	}
300	/* base name matched - not bad */	261	/* base name matched - not bad */
301	else if (strcasecmp (cp, op->name) == 0 && !count)	262	else if (strcasecmp (cp, op->name) == 0 && !count)
302	retval = 4;	263	retval = 4;
303	/* Check for partial custom name, but give a real low priority */	264	/* Check for partial custom name, but give a real low priority */
304	else if (op->custom_name && strstr (op->custom_name, cp))	265	else if (op->custom_name && strstr (op->custom_name, cp))
…		…
306		267
307	if (retval)	268	if (retval)
308	{	269	{
309	if (pl->type == PLAYER)	270	if (pl->type == PLAYER)
310	pl->contr->count = count;	271	pl->contr->count = count;
		272
311	return retval;	273	return retval;
312	}	274	}
313	}	275	}
		276
314	return 0;	277	return 0;
315	}	278	}
316		279
317	/*	280	archetype::archetype ()
318	* Initialises the internal linked list of archetypes (read from file).	281	{
319	* Then the global "empty_archetype" pointer is initialised.	282	clone.arch = this;
320	* Then the blocksview[] array is initialised.
321	*/
322		283
		284	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
		285	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
		286	}
		287
		288	archetype::~archetype ()
		289	{
		290	//TODO: nuke ->more's
		291	}
		292
		293	static void
		294	unlink (archetype *at)
		295	{
		296	if (at->head)
		297	at = at->head;
		298
		299	// destroy this archetype's link, making singletons out of its parts
		300	while (at)
		301	{
		302	archetype *more = at->more;
		303	at->clone.destroy_inv ();
		304	at->head = at->more = 0;
		305	at = more;
		306	}
		307	}
		308
		309	// dire hack, need to rationalise
323	void	310	void
324	init_archetypes (void)	311	overwrite (archetype at, object op)
325	{ /* called from add_player() and edit() */	312	{
326	if (first_archetype != NULL) /* Only do this once */	313	at->clone = *op;
		314	at->clone.arch = at;
		315
		316	at->clone.inv = op->inv; op->inv = 0;
		317
		318	op->destroy ();
		319	}
		320
		321	archetype *
		322	archetype::read (object_thawer &f)
		323	{
		324	assert (f.kw == KW_object);
		325
		326	loading_arch = true; // hack to tell parse_kv et al. to behave
		327
		328	typedef std::pair<archetype , object > part;
		329	std::vector<part> parts;
		330
		331	coroapi::cede_to_tick_every (100);
		332
		333	for (;;)
		334	{
		335	object *op = object::create ();
		336	archetype *at = get (f.get_str ());
		337	f.get (op->name);
		338	f.next ();
		339
		340	#if 0
		341	if (f.kw == KW_inherit)
		342	{
		343	if (archetype *at = find (f.get_str ()))
		344	*op = at->clone;
		345	else
		346	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		347	&at->name, f.get_str ());
		348
		349	f.next ();
		350	}
		351	#endif
		352
		353	if (!op->parse_kv (f))
		354	goto fail;
		355
		356	op->post_load_check ();
		357
		358	parts.push_back (std::make_pair (at, op));
		359
		360	if (f.kw != KW_more)
		361	break;
		362
		363	f.next ();
		364
		365	if (f.kw != KW_object)
		366	{
		367	f.parse_error ("more object");
		368	goto fail;
		369	}
		370	}
		371
		372	{
		373	archetype *head = parts.front ().first;
		374
		375	// check that all archetypes belong to the same object or are heads
		376	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		377	{
		378	archetype *at = p->first;
		379
		380	if (at->head != head && at->head)
		381	{
		382	LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->archname);
		383	goto fail;
		384	}
		385
		386	if (at->next && at != head)
		387	{
		388	LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->archname);
		389	goto fail;
		390	}
		391	}
		392
		393	// sever chain of existing head object
		394	for (archetype more, at = head; at; at = more)
		395	{
		396	more = at->more;
		397
		398	at->head = 0;
		399	at->more = 0;
		400	}
		401
		402	// replace/update head
		403	overwrite (head, parts.front ().second);
		404	head->tail_x = 0;
		405	head->tail_y = 0;
		406
		407	// link into list of heads, if not already there
		408	if (!head->linked)
		409	{
		410	head->linked = true;
		411	head->next = first_archetype;
		412	first_archetype = head;
		413	}
		414
		415	// reassemble new chain
		416	archetype *prev = head;
		417	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		418	{
		419	archetype *at = p->first;
		420	overwrite (at, p->second);
		421
		422	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
		423	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
		424
		425	at->head = head;
		426	at->clone.head = &head->clone;
		427	prev->more = at;
		428	prev->clone.more = &at->clone;
		429
		430	prev = at;
		431	}
		432
		433	loading_arch = false;
		434	return head;
		435	}
		436
		437	fail:
		438	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		439	p->second->destroy (true);
		440
		441	loading_arch = false;
327	return;	442	return 0;
		443	}
328		444
329	arch_init = 1;	445	/*
330	load_archetypes ();	446	* Initialize global archtype pointers:
331	arch_init = 0;	447	*/
		448	void
		449	init_archetype_pointers ()
		450	{
		451	ring_arch = archetype::find ("ring");
		452	amulet_arch = archetype::find ("amulet");
		453	staff_arch = archetype::find ("staff");
		454	crown_arch = archetype::find ("crown");
332	empty_archetype = archetype::find ("empty_archetype");	455	empty_archetype = archetype::find ("empty_archetype");
333
334	/* init_blocksview();*/
335	}
336
337	/*
338	* Stores debug-information about how efficient the hashtable
339	* used for archetypes has been in the static errmsg array.
340	*/
341
342	void
343	arch_info (object *op)
344	{
345	sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);
346	new_draw_info (NDI_BLACK, 0, op, errmsg);
347	}
348
349	/*
350	* Initialise the hashtable used by the archetypes.
351	*/
352
353	void
354	clear_archetable (void)
355	{
356	memset ((void ) arch_table, 0, ARCHTABLE sizeof (archetype *));
357	}
358
359	/*
360	* An alternative way to init the hashtable which is slower, but _works_...
361	*/
362
363	void
364	init_archetable (void)
365	{
366	archetype *
367	at;
368
369	LOG (llevDebug, " Setting up archetable...\n");
370
371	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
372	add_arch (at);
373
374	LOG (llevDebug, "done\n");
375	}
376
377	/*
378	* Dumps an archetype to debug-level output.
379	*/
380
381	void
382	dump_arch (archetype *at)
383	{
384	dump_object (&at->clone);
385	}
386
387	/*
388	* Dumps _all_ archetypes to debug-level output.
389	* If you run crossfire with debug, and enter DM-mode, you can trigger
390	* this with the O key.
391	*/
392
393	void
394	dump_all_archetypes (void)
395	{
396	archetype *
397	at;
398
399	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
400	{
401	dump_arch (at);
402	fprintf (logfile, "%s\n", errmsg);
403	}
404	}
405
406	void
407	free_all_archs (void)
408	{
409	archetype *
410	at, *
411	next;
412	int
413	i = 0, f = 0;
414
415	for (at = first_archetype; at != NULL; at = next)
416	{
417	if (at->more)
418	next = at->more;
419	else
420	next = at->next;
421
422	delete
423	at;
424
425	i++;
426	}
427	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
428	}
429
430	archetype::archetype ()
431	{
432	clear_object (&clone); /* to initial state other also */
433	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */
434	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
435	}
436
437	archetype::~archetype ()
438	{
439	}
440
441	/*
442	* Reads/parses the archetype-file, and copies into a linked list
443	* of archetype-structures.
444	*/
445	void
446	first_arch_pass (object_thawer & fp)
447	{
448	archetype *
449	at, *
450	head = NULL, *last_more = NULL;
451
452	at->clone.arch = first_archetype = at = new archetype;
453
454	while (int i = load_object (fp, &at->clone, 0))
455	{
456	at->clone.speed_left = (float) (-0.1);
457	/* copy the body_info to the body_used - this is only really
458	* need for monsters, but doesn't hurt to do it for everything.
459	* by doing so, when a monster is created, it has good starting
460	* values for the body_used info, so when items are created
461	* for it, they can be properly equipped.
462	*/
463	memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
464
465	switch (i)
466	{
467	case LL_NORMAL: /* A new archetype, just link it with the previous */
468	if (last_more != NULL)
469	last_more->next = at;
470	if (head != NULL)
471	head->next = at;
472	head = last_more = at;
473	#if 0
474	if (!op->type)
475	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
476	#endif
477	at->tail_x = 0;
478	at->tail_y = 0;
479	break;
480
481	case LL_MORE: /* Another part of the previous archetype, link it correctly */
482
483	at->head = head;
484	at->clone.head = &head->clone;
485	if (last_more != NULL)
486	{
487	last_more->more = at;
488	last_more->clone.more = &at->clone;
489	}
490	last_more = at;
491
492	/* If this multipart image is still composed of individual small
493	* images, don't set the tail_.. values. We can't use them anyways,
494	* and setting these to zero makes the map sending to the client much
495	* easier as just looking at the head, we know what to do.
496	*/
497	if (at->clone.face != head->clone.face)
498	{
499	head->tail_x = 0;
500	head->tail_y = 0;
501	}
502	else
503	{
504	if (at->clone.x > head->tail_x)
505	head->tail_x = at->clone.x;
506	if (at->clone.y > head->tail_y)
507	head->tail_y = at->clone.y;
508	}
509	break;
510
511	}
512
513	at = new archetype;
514
515	at->clone.arch = at;
516	}
517
518	delete at;
519	}
520
521	/*
522	* Reads the archetype file once more, and links all pointers between
523	* archetypes.
524	*/
525
526	void
527	second_arch_pass (object_thawer & thawer)
528	{
529	char
530	buf[MAX_BUF], *
531	variable = buf, argument, cp;
532	archetype *
533	at = NULL, *other;
534
535	while (fgets (buf, MAX_BUF, thawer) != NULL)
536	{
537	if (*buf == '#')
538	continue;
539	if ((argument = strchr (buf, ' ')) != NULL)
540	{
541	*argument = '\0', argument++;
542	cp = argument + strlen (argument) - 1;
543	while (isspace (*cp))
544	{
545	*cp = '\0';
546	cp--;
547	}
548	}
549	if (!strcmp ("Object", variable))
550	{
551	if ((at = archetype::find (argument)) == NULL)
552	LOG (llevError, "Warning: failed to find arch %s\n", argument);
553	}
554	else if (!strcmp ("other_arch", variable))
555	{
556	if (at != NULL && at->clone.other_arch == NULL)
557	{
558	if ((other = archetype::find (argument)) == NULL)
559	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
560	else if (at != NULL)
561	at->clone.other_arch = other;
562	}
563	}
564	else if (!strcmp ("randomitems", variable))
565	{
566	if (at != NULL)
567	{
568	treasurelist *
569	tl = find_treasurelist (argument);
570
571	if (tl == NULL)
572	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
573	else
574	at->clone.randomitems = tl;
575	}
576	}
577	}
578	}
579
580	#ifdef DEBUG
581	void
582	check_generators (void)
583	{
584	archetype *
585	at;
586
587	for (at = first_archetype; at != NULL; at = at->next)
588	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
589	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
590	}
591	#endif
592
593	/*
594	* First initialises the archtype hash-table (init_archetable()).
595	* Reads and parses the archetype file (with the first and second-pass
596	* functions).
597	* Then initialises treasures by calling load_treasures().
598	*/
599
600	void
601	load_archetypes (void)
602	{
603	char
604	filename[MAX_BUF];
605
606	#if TIME_ARCH_LOAD
607	struct timeval
608	tv1,
609	tv2;
610	#endif
611
612	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
613	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
614
615	{
616	object_thawer
617	thawer (filename);
618
619	clear_archetable ();
620	LOG (llevDebug, " arch-pass 1...\n");
621	first_arch_pass (thawer);
622	LOG (llevDebug, " done\n");
623	}
624
625	init_archetable ();
626	warn_archetypes = 1;
627
628	{
629	object_thawer
630	thawer (filename);
631
632	LOG (llevDebug, " loading treasure...\n");
633	load_treasures ();
634	LOG (llevDebug, " done\n arch-pass 2...\n");
635	second_arch_pass (thawer);
636	LOG (llevDebug, " done\n");
637	#ifdef DEBUG
638	check_generators ();
639	#endif
640	}
641	LOG (llevDebug, " done\n");
642	}	456	}
643		457
644	/*	458	/*
645	* Creates and returns a new object which is a copy of the given archetype.	459	* Creates and returns a new object which is a copy of the given archetype.
646	* This function returns NULL on failure.	460	* This function returns NULL on failure.
647	*/	461	*/
648
649	object *	462	object *
650	arch_to_object (archetype *at)	463	arch_to_object (archetype *at)
651	{	464	{
652	object *	465	if (!at)
653	op;
654
655	if (at == NULL)
656	{	466	{
657	if (warn_archetypes)
658	LOG (llevError, "Couldn't find archetype.\n");	467	LOG (llevError, "Couldn't find archetype.\n");
659
660	return NULL;	468	return 0;
661	}	469	}
662		470
663	op = get_object ();	471	object *op = at->clone.clone ();
664	copy_object (&at->clone, op);
665	op->arch = at;	472	op->arch = at;
666	op->instantiate ();	473	op->instantiate ();
		474
667	return op;	475	return op;
668	}	476	}
669		477
670	/*	478	/*
671	* Creates an object. This function is called by get_archetype()	479	* Creates an object. This function is called by get_archetype()
672	* if it fails to find the appropriate archetype.	480	* if it fails to find the appropriate archetype.
673	* Thus get_archetype() will be guaranteed to always return	481	* Thus get_archetype() will be guaranteed to always return
674	* an object, and never NULL.	482	* an object, and never NULL.
675	*/	483	*/
676
677	object *	484	object *
678	create_singularity (const char *name)	485	create_singularity (const char *name)
679	{	486	{
680	object * op;	487	object *op;
681	char buf[MAX_BUF];	488	char buf[MAX_BUF];
682		489
683	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	490	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
684	op = get_object ();	491	op = object::create ();
685	op->name = op->name_pl = buf;	492	op->name = op->name_pl = buf;
686	SET_FLAG (op, FLAG_NO_PICK);	493	SET_FLAG (op, FLAG_NO_PICK);
687	return op;	494	return op;
688	}	495	}
689		496
690	/*	497	/*
691	* Finds which archetype matches the given name, and returns a new	498	* Finds which archetype matches the given name, and returns a new
692	* object containing a copy of the archetype.	499	* object containing a copy of the archetype.
693	*/	500	*/
694
695	object *	501	object *
696	get_archetype (const char *name)	502	get_archetype (const char *name)
697	{	503	{
698	archetype *at = archetype::find (name);	504	archetype *at = archetype::find (name);
699		505
…		…
702		508
703	return arch_to_object (at);	509	return arch_to_object (at);
704	}	510	}
705		511
706	/*	512	/*
707	* Hash-function used by the arch-hashtable.
708	*/
709
710	unsigned long
711	hasharch (const char *str, int tablesize)
712	{
713	unsigned long hash = 0;
714	unsigned int i = 0;
715	const char *p;
716
717	/* use the one-at-a-time hash function, which supposedly is
718	* better than the djb2-like one used by perl5.005, but
719	* certainly is better then the bug used here before.
720	* see http://burtleburtle.net/bob/hash/doobs.html
721	*/
722	for (p = str; i < MAXSTRING && *p; p++, i++)
723	{
724	hash += *p;
725	hash += hash << 10;
726	hash ^= hash >> 6;
727	}
728
729	hash += hash << 3;
730	hash ^= hash >> 11;
731	hash += hash << 15;
732
733	return hash % tablesize;
734	}
735
736	/*
737	* Finds, using the hashtable, which archetype matches the given name.	513	* Finds, using the hashtable, which archetype matches the given name.
738	* returns a pointer to the found archetype, otherwise NULL.	514	* returns a pointer to the found archetype, otherwise NULL.
739	*/	515	*/
740
741	archetype *	516	archetype *
742	archetype::find (const char *name)	517	archetype::find (const char *name)
743	{	518	{
744	if (!name)	519	if (!name)
745	return 0;	520	return 0;
746		521
747	#if USE_UNORDERED_MAP	522	auto (i, ht.find (name));
748	AUTODECL (i, ht.find ((size_t) name));
749		523
750	if (i == ht.end ())	524	if (i == ht.end ())
751	return 0;	525	return 0;
752	else	526	else
753	return i->second;	527	return i->second;
754	#endif	528	}
755		529
756	archetype *at;	530	archetype *
757	unsigned long index;	531	archetype::get (const char *name)
758		532	{
759	index = hasharch (name, ARCHTABLE);	533	if (!name)
760	arch_search++;
761	for (;;)
762	{
763	at = arch_table[index];
764
765	if (at == NULL)
766	{
767	if (warn_archetypes)
768	LOG (llevError, "Couldn't find archetype %s\n", name);
769
770	return NULL;
771	}
772
773	arch_cmp++;
774
775	if (!strcmp ((const char *) at->name, name))
776	return at;
777
778	if (++index >= ARCHTABLE)
779	index = 0;
780	}	534	{
		535	LOG (llevError, "null archetype requested\n");
		536	name = "(null)";
		537	}
		538
		539	archetype *at = find (name);
		540
		541	if (!at)
		542	{
		543	archetypes.insert (at = new archetype);
		544	at->archname = at->clone.name = at->clone.name_pl = name;
		545	at->hash_add ();
		546	}
		547
		548	return at;
781	}	549	}
782		550
783	/*	551	/*
784	* Adds an archetype to the hashtable.	552	* Adds an archetype to the hashtable.
785	*/	553	*/
786		554	void
787	static void	555	archetype::hash_add ()
788	add_arch (archetype *at)
789	{	556	{
790	#if USE_UNORDERED_MAP	557	ht.insert (std::make_pair (archname, this));
791	ht.insert (std::make_pair ((size_t) (const char *) at->name, at));	558	}
792	#endif
793		559
794	int index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index;	560	void
795		561	archetype::hash_del ()
796	for (;;)	562	{
797	{	563	ht.erase (archname);
798	if (arch_table[index] == NULL)
799	{
800	arch_table[index] = at;
801	return;
802	}
803
804	if (++index == ARCHTABLE)
805	index = 0;
806
807	if (index == org_index)
808	fatal (ARCHTABLE_TOO_SMALL);
809	}
810	}	564	}
811		565
812	/*	566	/*
813	* Returns the first archetype using the given type.	567	* Returns the first archetype using the given type.
814	* Used in treasure-generation.	568	* Used in treasure-generation.
815	*/	569	*/
816
817	archetype *	570	archetype *
818	type_to_archetype (int type)	571	type_to_archetype (int type)
819	{	572	{
820	archetype *at;
821
822	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	573	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
823	if (at->clone.type == type)	574	if (at->clone.type == type)
824	return at;	575	return at;
825		576
826	return 0;	577	return 0;
827	}	578	}
…		…
829	/*	580	/*
830	* Returns a new object copied from the first archetype matching	581	* Returns a new object copied from the first archetype matching
831	* the given type.	582	* the given type.
832	* Used in treasure-generation.	583	* Used in treasure-generation.
833	*/	584	*/
834
835	object *	585	object *
836	clone_arch (int type)	586	clone_arch (int type)
837	{	587	{
838	archetype *at;	588	archetype *at;
839	object *op = get_object ();
840		589
841	if ((at = type_to_archetype (type)) == NULL)	590	if ((at = type_to_archetype (type)) == NULL)
842	{	591	{
843	LOG (llevError, "Can't clone archetype %d\n", type);	592	LOG (llevError, "Can't clone archetype %d\n", type);
844	free_object (op);
845	return NULL;	593	return 0;
846	}	594	}
847		595
848	copy_object (&at->clone, op);	596	object *op = at->clone.clone ();
849	op->instantiate ();	597	op->instantiate ();
850	return op;	598	return op;
851	}	599	}
852		600
853	/*	601	/*

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.20 by root, Thu Sep 14 21:16:11 2006 UTC vs. Revision 1.62 by root, Mon Jun 4 12:19:08 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.20 by root, Thu Sep 14 21:16:11 2006 UTC vs.
Revision 1.62 by root, Mon Jun 4 12:19:08 2007 UTC