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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.13 by pippijn, Thu Sep 7 09:37:11 2006 UTC vs.
Revision 1.26 by root, Fri Nov 17 19:40:53 2006 UTC

…		…
1	/*
2	* static char *rcsid_arch_c =
3	* "$Id: arch.C,v 1.13 2006/09/07 09:37:11 pippijn Exp $";
4	*/
5
6	/*	1	/*
7	CrossFire, A Multiplayer game for X-windows	2	CrossFire, A Multiplayer game for X-windows
8		3
9	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	4	Copyright (C) 2002 Mark Wedel & Crossfire Development Team
10	Copyright (C) 1992 Frank Tore Johansen	5	Copyright (C) 1992 Frank Tore Johansen
21		16
22	You should have received a copy of the GNU General Public License	17	You should have received a copy of the GNU General Public License
23	along with this program; if not, write to the Free Software	18	along with this program; if not, write to the Free Software
24	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25		20
26	The authors can be reached via e-mail at crossfire-devel@real-time.com	21	The authors can be reached via e-mail at <crossfire@schmorp.de>
27	*/	22	*/
28		23
29	#include <cassert>	24	#include <cassert>
30		25
31	#include <tr1/unordered_map>
32
33	#include <global.h>	26	#include <global.h>
34	#include <arch.h>
35	#include <funcpoint.h>	27	#include <funcpoint.h>
36	#include <loader.h>	28	#include <loader.h>
37		29
38	/* IF set, does a little timing on the archetype load. */	30	#define USE_UNORDERED_MAP 0
39	#define TIME_ARCH_LOAD 0
40		31
41	static void add_arch (archetype * at);	32	#if USE_UNORDERED_MAP
		33	# include <tr1/functional>
		34	# include <tr1/unordered_map>
		35	#endif
42		36
43	static archetype *arch_table[ARCHTABLE];
44	int arch_cmp = 0; /* How many strcmp's */	37	int arch_cmp = 0; /* How many strcmp's */
45	int arch_search = 0; /* How many searches */	38	int arch_search = 0; /* How many searches */
46	int arch_init; /* True if doing arch initialization */	39	int arch_init; /* True if doing arch initialization */
47		40
48	/* The naming of these functions is really poor - they are all	41	/* The naming of these functions is really poor - they are all
…		…
53	* MSW 2003-04-29	46	* MSW 2003-04-29
54	*/	47	*/
55		48
56	#if USE_UNORDERED_MAP	49	#if USE_UNORDERED_MAP
57	// the hashtable	50	// the hashtable
58	typedef std::tr1::unordered_map<size_t, archetype *> HT;	51	typedef std::tr1::unordered_map
		52	<
		53	std::size_t,
		54	arch_ptr,
		55	std::tr1::hash<size_t>,
		56	std::equal_to<size_t>,
		57	slice_allocator< std::pair<const std::size_t, archetype *> >
		58	true,
		59	> HT;
59		60
60	static HT ht;	61	static HT ht;
		62	#else
		63	static arch_ptr arch_table[ARCHTABLE];
61	#endif	64	#endif
62		65
63	/**	66	/**
64	* GROS - This function retrieves an archetype given the name that appears	67	* GROS - This function retrieves an archetype given the name that appears
65	* during the game (for example, "writing pen" instead of "stylus").	68	* during the game (for example, "writing pen" instead of "stylus").
…		…
165	* but it otherwise had a big memory leak.	168	* but it otherwise had a big memory leak.
166	*/	169	*/
167	object *	170	object *
168	get_archetype_by_object_name (const char *name)	171	get_archetype_by_object_name (const char *name)
169	{	172	{
170	archetype *	173	archetype *at;
171	at;
172	char
173	tmpname[MAX_BUF];	174	char tmpname[MAX_BUF];
174	int	175	int i;
175	i;
176		176
177	strncpy (tmpname, name, MAX_BUF - 1);	177	assign (tmpname, name);
178	tmpname[MAX_BUF - 1] = 0;	178
179	for (i = strlen (tmpname); i > 0; i--)	179	for (i = strlen (tmpname); i > 0; i--)
180	{	180	{
181	tmpname[i] = 0;	181	tmpname[i] = 0;
182	at = find_archetype_by_object_name (tmpname);	182	at = find_archetype_by_object_name (tmpname);
		183
183	if (at != NULL)	184	if (at != NULL)
184	{
185	return arch_to_object (at);	185	return arch_to_object (at);
186	}
187	}	186	}
		187
188	return create_singularity (name);	188	return create_singularity (name);
189	}	189	}
190		190
191	/* This is a subset of the parse_id command. Basically, name can be	191	/* This is a subset of the parse_id command. Basically, name can be
192	* a string seperated lists of things to match, with certain keywords.	192	* a string seperated lists of things to match, with certain keywords.
…		…
204	* If count is 1, make a quick check on the name.	204	* If count is 1, make a quick check on the name.
205	* IF count is >1, we need to make plural name. Return if match.	205	* IF count is >1, we need to make plural name. Return if match.
206	* Last, make a check on the full name.	206	* Last, make a check on the full name.
207	*/	207	*/
208	int	208	int
209	item_matched_string (object * pl, object * op, const char *name)	209	item_matched_string (object pl, object op, const char *name)
210	{	210	{
211	char *
212	cp,
213	local_name[MAX_BUF];	211	char *cp, local_name[MAX_BUF];
214	int	212	int count, retval = 0;
215	count,	213
216	retval = 0;
217	strcpy (local_name, name); /* strtok is destructive to name */	214	strcpy (local_name, name); /* strtok is destructive to name */
218		215
219	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))	216	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
220	{	217	{
221	while (cp[0] == ' ')	218	while (cp[0] == ' ')
…		…
272	retval = 15;	269	retval = 15;
273	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	270	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
274	retval = 14;	271	retval = 14;
275	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	272	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
276	retval = 14;	273	retval = 14;
277
278	/* Do substring checks, so things like 'Str+1' will match.	274	/* Do substring checks, so things like 'Str+1' will match.
279	* retval of these should perhaps be lower - they are lower	275	* retval of these should perhaps be lower - they are lower
280	* then the specific strcasecmp aboves, but still higher than	276	* then the specific strcasecmp aboves, but still higher than
281	* some other match criteria.	277	* some other match criteria.
282	*/	278	*/
…		…
284	retval = 12;	280	retval = 12;
285	else if (strstr (query_base_name (op, 0), cp))	281	else if (strstr (query_base_name (op, 0), cp))
286	retval = 12;	282	retval = 12;
287	else if (strstr (query_short_name (op), cp))	283	else if (strstr (query_short_name (op), cp))
288	retval = 12;	284	retval = 12;
289
290	/* Check against plural/non plural based on count. */	285	/* Check against plural/non plural based on count. */
291	else if (count > 1 && !strcasecmp (cp, op->name_pl))	286	else if (count > 1 && !strcasecmp (cp, op->name_pl))
292	{
293	retval = 6;	287	retval = 6;
294	}
295	else if (count == 1 && !strcasecmp (op->name, cp))	288	else if (count == 1 && !strcasecmp (op->name, cp))
296	{
297	retval = 6;	289	retval = 6;
298	}
299	/* base name matched - not bad */	290	/* base name matched - not bad */
300	else if (strcasecmp (cp, op->name) == 0 && !count)	291	else if (strcasecmp (cp, op->name) == 0 && !count)
301	retval = 4;	292	retval = 4;
302	/* Check for partial custom name, but give a real low priority */	293	/* Check for partial custom name, but give a real low priority */
303	else if (op->custom_name && strstr (op->custom_name, cp))	294	else if (op->custom_name && strstr (op->custom_name, cp))
…		…
305		296
306	if (retval)	297	if (retval)
307	{	298	{
308	if (pl->type == PLAYER)	299	if (pl->type == PLAYER)
309	pl->contr->count = count;	300	pl->contr->count = count;
		301
310	return retval;	302	return retval;
311	}	303	}
312	}	304	}
		305
313	return 0;	306	return 0;
314	}	307	}
315		308
316	/*	309	/*
317	* Initialises the internal linked list of archetypes (read from file).	310	* Initialises the internal linked list of archetypes (read from file).
…		…
322	void	315	void
323	init_archetypes (void)	316	init_archetypes (void)
324	{ /* called from add_player() and edit() */	317	{ /* called from add_player() and edit() */
325	if (first_archetype != NULL) /* Only do this once */	318	if (first_archetype != NULL) /* Only do this once */
326	return;	319	return;
		320
327	arch_init = 1;	321	arch_init = 1;
328	load_archetypes ();	322	load_archetypes ();
329	arch_init = 0;	323	arch_init = 0;
330	empty_archetype = find_archetype ("empty_archetype");	324	empty_archetype = archetype::find ("empty_archetype");
		325
331	/* init_blocksview();*/	326	/* init_blocksview();*/
332	}	327	}
333		328
334	/*	329	/*
335	* Stores debug-information about how efficient the hashtable	330	* Stores debug-information about how efficient the hashtable
336	* used for archetypes has been in the static errmsg array.	331	* used for archetypes has been in the static errmsg array.
337	*/	332	*/
338		333
339	void	334	void
340	arch_info (object * op)	335	arch_info (object *op)
341	{	336	{
342	sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);	337	sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);
343	new_draw_info (NDI_BLACK, 0, op, errmsg);	338	new_draw_info (NDI_BLACK, 0, op, errmsg);
344	}	339	}
345		340
…		…
363	archetype *at;	358	archetype *at;
364		359
365	LOG (llevDebug, " Setting up archetable...\n");	360	LOG (llevDebug, " Setting up archetable...\n");
366		361
367	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)	362	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
368	add_arch (at);	363	at->hash_add ();
369		364
370	LOG (llevDebug, "done\n");	365	LOG (llevDebug, "done\n");
371	}	366	}
372		367
373	/*
374	* Dumps an archetype to debug-level output.
375	*/
376
377	void
378	dump_arch (archetype * at)
379	{
380	dump_object (&at->clone);
381	}
382
383	/*
384	* Dumps _all_ archetypes to debug-level output.
385	* If you run crossfire with debug, and enter DM-mode, you can trigger
386	* this with the O key.
387	*/
388
389	void
390	dump_all_archetypes (void)
391	{
392	archetype *
393	at;
394	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
395	{
396	dump_arch (at);
397	fprintf (logfile, "%s\n", errmsg);
398	}
399	}
400
401	void	368	void
402	free_all_archs (void)	369	free_all_archs (void)
403	{	370	{
404	archetype *	371	archetype at, next;
405	at, *
406	next;
407	int
408	i = 0, f = 0;	372	int i = 0, f = 0;
409		373
410	for (at = first_archetype; at != NULL; at = next)	374	for (at = first_archetype; at != NULL; at = next)
411	{	375	{
412	if (at->more)	376	if (at->more)
413	next = at->more;	377	next = at->more;
414	else	378	else
415	next = at->next;	379	next = at->next;
416		380
417	delete	381	delete
418	at;	382	at;
		383
419	i++;	384	i++;
420	}	385	}
		386
421	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);	387	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
422	}	388	}
423		389
424	/*	390	archetype::archetype ()
425	* Allocates, initialises and returns the pointer to an archetype structure.
426	*/
427	// TODO: should become constructor
428	archetype *
429	get_archetype_struct (void)
430	{	391	{
431	archetype *
432	arch;
433
434	arch = new archetype;
435
436	clear_object (&arch->clone); /* to initial state other also */	392	clear_object (&clone); /* to initial state other also */
437	CLEAR_FLAG (&arch->clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */	393	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */
438	SET_FLAG (&arch->clone, FLAG_REMOVED); /* doesn't copy these flags... */	394	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
		395	}
439		396
440	return arch;	397	archetype::~archetype ()
		398	{
441	}	399	}
442		400
443	/*	401	/*
444	* Reads/parses the archetype-file, and copies into a linked list	402	* Reads/parses the archetype-file, and copies into a linked list
445	* of archetype-structures.	403	* of archetype-structures.
446	*/	404	*/
447	void	405	void
448	first_arch_pass (object_thawer & fp)	406	first_arch_pass (object_thawer & fp)
449	{	407	{
450	object *
451	op;
452	archetype *
453	at, *
454	head = NULL, *last_more = NULL;	408	archetype at, head = NULL, *last_more = NULL;
455	int
456	i;
457		409
458	op = get_object ();
459	op->arch = first_archetype = at = get_archetype_struct ();	410	at->clone.arch = first_archetype = at = new archetype;
460		411
461	while ((i = load_object (fp, op, 0)))	412	while (int i = load_object (fp, &at->clone, 0))
462	{	413	{
463	copy_object (op, &at->clone);
464	at->clone.speed_left = (float) (-0.1);	414	at->clone.speed_left = (float) (-0.1);
465	/* copy the body_info to the body_used - this is only really	415	/* copy the body_info to the body_used - this is only really
466	* need for monsters, but doesn't hurt to do it for everything.	416	* need for monsters, but doesn't hurt to do it for everything.
467	* by doing so, when a monster is created, it has good starting	417	* by doing so, when a monster is created, it has good starting
468	* values for the body_used info, so when items are created	418	* values for the body_used info, so when items are created
469	* for it, they can be properly equipped.	419	* for it, they can be properly equipped.
470	*/	420	*/
471	memcpy (&at->clone.body_used, &op->body_info, sizeof (op->body_info));	421	memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
472		422
473	switch (i)	423	switch (i)
474	{	424	{
475	case LL_NORMAL: /* A new archetype, just link it with the previous */	425	case LL_NORMAL: /* A new archetype, just link it with the previous */
476	if (last_more != NULL)	426	if (last_more != NULL)
477	last_more->next = at;	427	last_more->next = at;
478	if (head != NULL)	428	if (head != NULL)
479	head->next = at;	429	head->next = at;
480	head = last_more = at;	430	head = last_more = at;
481	#if 0	431	#if 0
482	if (!op->type)	432	if (!op->type)
483	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);	433	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
484	#endif	434	#endif
485	at->tail_x = 0;	435	at->tail_x = 0;
486	at->tail_y = 0;	436	at->tail_y = 0;
487	break;	437	break;
488		438
489	case LL_MORE: /* Another part of the previous archetype, link it correctly */	439	case LL_MORE: /* Another part of the previous archetype, link it correctly */
490		440
491	at->head = head;	441	at->head = head;
492	at->clone.head = &head->clone;	442	at->clone.head = &head->clone;
493	if (last_more != NULL)	443	if (last_more != NULL)
494	{	444	{
495	last_more->more = at;	445	last_more->more = at;
496	last_more->clone.more = &at->clone;	446	last_more->clone.more = &at->clone;
497	}	447	}
498	last_more = at;	448	last_more = at;
499		449
500	/* If this multipart image is still composed of individual small	450	/* If this multipart image is still composed of individual small
501	* images, don't set the tail_.. values. We can't use them anyways,	451	* images, don't set the tail_.. values. We can't use them anyways,
502	* and setting these to zero makes the map sending to the client much	452	* and setting these to zero makes the map sending to the client much
503	* easier as just looking at the head, we know what to do.	453	* easier as just looking at the head, we know what to do.
504	*/	454	*/
505	if (at->clone.face != head->clone.face)	455	if (at->clone.face != head->clone.face)
506	{	456	{
507	head->tail_x = 0;	457	head->tail_x = 0;
508	head->tail_y = 0;	458	head->tail_y = 0;
509	}	459	}
510	else	460	else
511	{	461	{
512	if (at->clone.x > head->tail_x)	462	if (at->clone.x > head->tail_x)
513	head->tail_x = at->clone.x;	463	head->tail_x = at->clone.x;
514	if (at->clone.y > head->tail_y)	464	if (at->clone.y > head->tail_y)
515	head->tail_y = at->clone.y;	465	head->tail_y = at->clone.y;
516	}	466	}
517	break;	467	break;
518		468
519	}	469	}
520		470
521	at = get_archetype_struct ();	471	at = new archetype;
522	clear_object (op);	472
523	op->arch = at;	473	at->clone.arch = at;
524	}	474	}
525		475
526	delete	476	delete at;
527	at;
528	free_object (op);
529	}	477	}
530		478
531	/*	479	/*
532	* Reads the archetype file once more, and links all pointers between	480	* Reads the archetype file once more, and links all pointers between
533	* archetypes.	481	* archetypes.
534	*/	482	*/
535		483
536	void	484	void
537	second_arch_pass (object_thawer & thawer)	485	second_arch_pass (object_thawer & thawer)
538	{	486	{
539	char
540	buf[MAX_BUF], *
541	variable = buf, argument, cp;	487	char buf[MAX_BUF], variable = buf, argument, *cp;
542	archetype *
543	at = NULL, *other;	488	archetype at = NULL, other;
544		489
545	while (fgets (buf, MAX_BUF, thawer) != NULL)	490	while (fgets (buf, MAX_BUF, thawer) != NULL)
546	{	491	{
547	if (*buf == '#')	492	if (*buf == '#')
548	continue;	493	continue;
…		…
556	cp--;	501	cp--;
557	}	502	}
558	}	503	}
559	if (!strcmp ("Object", variable))	504	if (!strcmp ("Object", variable))
560	{	505	{
561	if ((at = find_archetype (argument)) == NULL)	506	if ((at = archetype::find (argument)) == NULL)
562	LOG (llevError, "Warning: failed to find arch %s\n", argument);	507	LOG (llevError, "Warning: failed to find arch %s\n", argument);
563	}	508	}
564	else if (!strcmp ("other_arch", variable))	509	else if (!strcmp ("other_arch", variable))
565	{	510	{
566	if (at != NULL && at->clone.other_arch == NULL)	511	if (at != NULL && at->clone.other_arch == NULL)
567	{	512	{
568	if ((other = find_archetype (argument)) == NULL)	513	if ((other = archetype::find (argument)) == NULL)
569	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);	514	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
570	else if (at != NULL)	515	else if (at != NULL)
571	at->clone.other_arch = other;	516	at->clone.other_arch = other;
572	}	517	}
573	}	518	}
574	else if (!strcmp ("randomitems", variable))	519	else if (!strcmp ("randomitems", variable))
575	{	520	{
576	if (at != NULL)	521	if (at != NULL)
577	{	522	{
578	treasurelist *
579	tl = find_treasurelist (argument);	523	treasurelist *tl = find_treasurelist (argument);
		524
580	if (tl == NULL)	525	if (tl == NULL)
581	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);	526	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
582	else	527	else
583	at->clone.randomitems = tl;	528	at->clone.randomitems = tl;
584	}	529	}
…		…
588		533
589	#ifdef DEBUG	534	#ifdef DEBUG
590	void	535	void
591	check_generators (void)	536	check_generators (void)
592	{	537	{
593	archetype *	538	archetype *at;
594	at;	539
595	for (at = first_archetype; at != NULL; at = at->next)	540	for (at = first_archetype; at != NULL; at = at->next)
596	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)	541	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
597	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);	542	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
598	}	543	}
599	#endif	544	#endif
…		…
606	*/	551	*/
607		552
608	void	553	void
609	load_archetypes (void)	554	load_archetypes (void)
610	{	555	{
611	char
612	filename[MAX_BUF];	556	char filename[MAX_BUF];
613	#if TIME_ARCH_LOAD
614	struct timeval
615	tv1,
616	tv2;
617	#endif
618		557
619	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);	558	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
620	LOG (llevDebug, "Reading archetypes from %s:\n", filename);	559	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
621		560
622	{	561	{
…		…
652	* Creates and returns a new object which is a copy of the given archetype.	591	* Creates and returns a new object which is a copy of the given archetype.
653	* This function returns NULL on failure.	592	* This function returns NULL on failure.
654	*/	593	*/
655		594
656	object *	595	object *
657	arch_to_object (archetype * at)	596	arch_to_object (archetype *at)
658	{	597	{
659	object *	598	object *op;
660	op;	599
661	if (at == NULL)	600	if (at == NULL)
662	{	601	{
663	if (warn_archetypes)	602	if (warn_archetypes)
664	LOG (llevError, "Couldn't find archetype.\n");	603	LOG (llevError, "Couldn't find archetype.\n");
		604
665	return NULL;	605	return NULL;
666	}	606	}
		607
667	op = get_object ();	608	op = get_object ();
668	copy_object (&at->clone, op);	609	copy_object (&at->clone, op);
		610	op->arch = at;
669	op->instantiate ();	611	op->instantiate ();
670	op->arch = at;
671	return op;	612	return op;
672	}	613	}
673		614
674	/*	615	/*
675	* Creates an object. This function is called by get_archetype()	616	* Creates an object. This function is called by get_archetype()
…		…
679	*/	620	*/
680		621
681	object *	622	object *
682	create_singularity (const char *name)	623	create_singularity (const char *name)
683	{	624	{
684	object *	625	object *op;
685	op;
686	char
687	buf[MAX_BUF];	626	char buf[MAX_BUF];
		627
688	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	628	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
689	op = get_object ();	629	op = get_object ();
690	op->name = op->name_pl = buf;	630	op->name = op->name_pl = buf;
691	SET_FLAG (op, FLAG_NO_PICK);	631	SET_FLAG (op, FLAG_NO_PICK);
692	return op;	632	return op;
…		…
698	*/	638	*/
699		639
700	object *	640	object *
701	get_archetype (const char *name)	641	get_archetype (const char *name)
702	{	642	{
703	archetype *	643	archetype *at = archetype::find (name);
704	at;	644
705	at = find_archetype (name);	645	if (!at)
706	if (at == NULL)
707	return create_singularity (name);	646	return create_singularity (name);
		647
708	return arch_to_object (at);	648	return arch_to_object (at);
709	}	649	}
710		650
711	/*	651	/*
712	* Hash-function used by the arch-hashtable.	652	* Hash-function used by the arch-hashtable.
713	*/	653	*/
714		654
715	unsigned long	655	unsigned long
716	hasharch (const char *str, int tablesize)	656	hasharch (const char *str, int tablesize)
717	{	657	{
718	unsigned long	658	unsigned long hash = 0;
719	hash = 0;
720	unsigned int	659	unsigned int i = 0;
721	i = 0;
722	const char *	660	const char *p;
723	p;
724		661
725	/* use the one-at-a-time hash function, which supposedly is	662	/* use the one-at-a-time hash function, which supposedly is
726	* better than the djb2-like one used by perl5.005, but	663	* better than the djb2-like one used by perl5.005, but
727	* certainly is better then the bug used here before.	664	* certainly is better then the bug used here before.
728	* see http://burtleburtle.net/bob/hash/doobs.html	665	* see http://burtleburtle.net/bob/hash/doobs.html
…		…
745	* Finds, using the hashtable, which archetype matches the given name.	682	* Finds, using the hashtable, which archetype matches the given name.
746	* returns a pointer to the found archetype, otherwise NULL.	683	* returns a pointer to the found archetype, otherwise NULL.
747	*/	684	*/
748		685
749	archetype *	686	archetype *
750	find_archetype (const char *name)	687	archetype::find (const char *name)
751	{	688	{
752	#if USE_UNORDERED_MAP
753	name = shstr::find (name);
754
755	if (!name)	689	if (!name)
756	return 0;	690	return 0;
757		691
758	HT::const_iterator i = ht.find ((size_t)name);	692	#if USE_UNORDERED_MAP
		693	AUTODECL (i, ht.find ((size_t) name));
759		694
760	if (i == ht.end ())	695	if (i == ht.end ())
761	return 0;	696	return 0;
762	else	697	else
763	return i->second;	698	return i->second;
764	#endif	699	#endif
765		700
766	archetype *at;	701	archetype *at;
767	unsigned long index;	702	unsigned long index;
768		703
769	if (name == NULL)
770	return (archetype *) NULL;
771
772	index = hasharch (name, ARCHTABLE);	704	index = hasharch (name, ARCHTABLE);
773	arch_search++;	705	arch_search++;
774	for (;;)	706	for (;;)
775	{	707	{
776	at = arch_table[index];	708	at = arch_table[index];
		709
777	if (at == NULL)	710	if (at == NULL)
778	{	711	{
779	if (warn_archetypes)	712	if (warn_archetypes)
780	LOG (llevError, "Couldn't find archetype %s\n", name);	713	LOG (llevError, "Couldn't find archetype %s\n", name);
		714
781	return NULL;	715	return NULL;
782	}	716	}
		717
783	arch_cmp++;	718	arch_cmp++;
		719
784	if (!strcmp ((const char *) at->name, name))	720	if (!strcmp ((const char *) at->name, name))
785	return at;	721	return at;
		722
786	if (++index >= ARCHTABLE)	723	if (++index >= ARCHTABLE)
787	index = 0;	724	index = 0;
788	}	725	}
789	}	726	}
790		727
791	/*	728	/*
792	* Adds an archetype to the hashtable.	729	* Adds an archetype to the hashtable.
793	*/	730	*/
794		731	void
795	static void	732	archetype::hash_add ()
796	add_arch (archetype *at)
797	{	733	{
798	#if USE_UNORDERED_MAP	734	#if USE_UNORDERED_MAP
799	ht.insert (std::make_pair ((size_t)(const char *)at->name, at));	735	ht.insert (std::make_pair ((size_t) (const char *) name, this));
800	#endif	736	#else
801		737
802	int index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index;	738	int index = hasharch ((const char *) name, ARCHTABLE), org_index = index;
803		739
804	for (;;)	740	for (;;)
805	{	741	{
806	if (arch_table[index] == NULL)	742	if (!arch_table[index])
807	{	743	{
808	arch_table[index] = at;	744	arch_table[index] = this;
809	return;	745	break;
810	}	746	}
811		747
812	if (++index == ARCHTABLE)	748	if (++index == ARCHTABLE)
813	index = 0;	749	index = 0;
814		750
815	if (index == org_index)	751	if (index == org_index)
816	fatal (ARCHTABLE_TOO_SMALL);	752	fatal (ARCHTABLE_TOO_SMALL);
817	}	753	}
		754	#endif
		755	}
		756
		757	void
		758	archetype::hash_del ()
		759	{
		760	#if USE_UNORDERED_MAP
		761	# error remove this from HT
		762	#else
		763
		764	int index = hasharch ((const char *) name, ARCHTABLE), org_index = index;
		765
		766	for (;;)
		767	{
		768	if (arch_table[index] == this)
		769	{
		770	arch_table[index] = 0;
		771	break;
		772	}
		773
		774	if (++index == ARCHTABLE)
		775	index = 0;
		776
		777	if (index == org_index)
		778	break;
		779	}
		780	#endif
818	}	781	}
819		782
820	/*	783	/*
821	* Returns the first archetype using the given type.	784	* Returns the first archetype using the given type.
822	* Used in treasure-generation.	785	* Used in treasure-generation.
823	*/	786	*/
824		787
825	archetype *	788	archetype *
826	type_to_archetype (int type)	789	type_to_archetype (int type)
827	{	790	{
828	archetype *	791	archetype *at;
829	at;
830		792
831	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)	793	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
832	if (at->clone.type == type)	794	if (at->clone.type == type)
833	return at;	795	return at;
		796
834	return NULL;	797	return 0;
835	}	798	}
836		799
837	/*	800	/*
838	* Returns a new object copied from the first archetype matching	801	* Returns a new object copied from the first archetype matching
839	* the given type.	802	* the given type.
…		…
841	*/	804	*/
842		805
843	object *	806	object *
844	clone_arch (int type)	807	clone_arch (int type)
845	{	808	{
846	archetype *	809	archetype *at;
847	at;
848	object *
849	op = get_object ();	810	object *op = get_object ();
850		811
851	if ((at = type_to_archetype (type)) == NULL)	812	if ((at = type_to_archetype (type)) == NULL)
852	{	813	{
853	LOG (llevError, "Can't clone archetype %d\n", type);	814	LOG (llevError, "Can't clone archetype %d\n", type);
854	free_object (op);	815	free_object (op);
855	return NULL;	816	return NULL;
856	}	817	}
		818
857	copy_object (&at->clone, op);	819	copy_object (&at->clone, op);
858	op->instantiate ();	820	op->instantiate ();
859	return op;	821	return op;
860	}	822	}
861		823
862	/*	824	/*
863	* member: make instance from class	825	* member: make instance from class
864	*/	826	*/
865		827
866	object *	828	object *
867	object_create_arch (archetype * at)	829	object_create_arch (archetype *at)
868	{	830	{
869	object *	831	object op, prev = 0, *head = 0;
870	op, *
871	prev = NULL, *head = NULL;
872		832
873	while (at)	833	while (at)
874	{	834	{
875	op = arch_to_object (at);	835	op = arch_to_object (at);
876	op->x = at->clone.x;	836	op->x = at->clone.x;
877	op->y = at->clone.y;	837	op->y = at->clone.y;
		838
878	if (head)	839	if (head)
879	op->head = head, prev->more = op;	840	op->head = head, prev->more = op;
		841
880	if (!head)	842	if (!head)
881	head = op;	843	head = op;
		844
882	prev = op;	845	prev = op;
883	at = at->more;	846	at = at->more;
884	}	847	}
		848
885	return (head);	849	return (head);
886	}	850	}
887		851
888	/* end of arch.c */

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.13 by pippijn, Thu Sep 7 09:37:11 2006 UTC vs. Revision 1.26 by root, Fri Nov 17 19:40:53 2006 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.13 by pippijn, Thu Sep 7 09:37:11 2006 UTC vs.
Revision 1.26 by root, Fri Nov 17 19:40:53 2006 UTC