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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.28 by root, Tue Dec 12 20:53:02 2006 UTC vs.
Revision 1.57 by root, Thu Apr 19 19:24:25 2007 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game for X-windows
3		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* This program is free software; you can redistribute it and/or modify
8	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
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation; either version 2 of the License, or
10	(at your option) any later version.	11	* (at your option) 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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License 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
18	along with this program; if not, write to the Free Software	19	* along with this program; if not, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20		21	*
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	23	*/
23		24
24	#include <cassert>	25	#include <cassert>
25		26
26	#include <global.h>	27	#include <global.h>
27	#include <funcpoint.h>	28	#include <funcpoint.h>
28	#include <loader.h>	29	#include <loader.h>
29		30
30	#define USE_UNORDERED_MAP 0
31
32	#if USE_UNORDERED_MAP
33	# include <tr1/functional>	31	#include <tr1/functional>
34	# include <tr1/unordered_map>	32	#include <tr1/unordered_map>
35	#endif
36
37	int arch_cmp = 0; /* How many strcmp's */
38	int arch_search = 0; /* How many searches */
39	int arch_init; /* True if doing arch initialization */
40		33
41	/* The naming of these functions is really poor - they are all	34	/* The naming of these functions is really poor - they are all
42	* pretty much named '.._arch_...', but they may more may not	35	* pretty much named '.._arch_...', but they may more may not
43	* return archetypes. Some make the arch_to_object call, and thus	36	* return archetypes. Some make the arch_to_object call, and thus
44	* return an object. Perhaps those should be called 'archob' functions	37	* return an object. Perhaps those should be called 'archob' functions
45	* to denote they return an object derived from the archetype.	38	* to denote they return an object derived from the archetype.
46	* MSW 2003-04-29	39	* MSW 2003-04-29
47	*/	40	*/
48		41
49	#if USE_UNORDERED_MAP	42	bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
		43
50	// the hashtable	44	// the hashtable
51	typedef std::tr1::unordered_map	45	typedef std::tr1::unordered_map
52	<	46	<
53	std::size_t,	47	const char *,
54	arch_ptr,	48	arch_ptr,
55	std::tr1::hash<size_t>,	49	str_hash,
56	std::equal_to<size_t>,	50	str_equal,
57	slice_allocator< std::pair<const std::size_t, archetype *> >	51	slice_allocator< std::pair<const char *const, arch_ptr> >
58	true,
59	> HT;	52	> HT;
60		53
61	static HT ht;	54	static HT ht (5000);
62	#else	55	static std::vector<archetype *> archetypes;
63	static arch_ptr arch_table[ARCHTABLE];
64	#endif
65		56
66	/**	57	/**
67	* GROS - This function retrieves an archetype given the name that appears	58	* GROS - This function retrieves an archetype given the name that appears
68	* during the game (for example, "writing pen" instead of "stylus").	59	* during the game (for example, "writing pen" instead of "stylus").
69	* It does not use the hashtable system, but browse the whole archlist each time.	60	* It does not use the hashtable system, but browse the whole archlist each time.
75	* - the archetype found or null if nothing was found.	66	* - the archetype found or null if nothing was found.
76	*/	67	*/
77	archetype *	68	archetype *
78	find_archetype_by_object_name (const char *name)	69	find_archetype_by_object_name (const char *name)
79	{	70	{
80	archetype *at;	71	shstr_cmp name_cmp (name);
81		72
82	if (name == NULL)
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	}
…		…
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 *cp, local_name[MAX_BUF];	182	char *cp, local_name[MAX_BUF];
212	int count, retval = 0;	183	int count, retval = 0;
213		184
214	strcpy (local_name, name); /* strtok is destructive to name */	185	assign (local_name, name); /* strtok is destructive to name */
215		186
216	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))	187	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
217	{	188	{
218	while (cp[0] == ' ')	189	while (cp[0] == ' ')
219	++cp; /* get rid of spaces */	190	++cp; /* get rid of spaces */
…		…
304	}	275	}
305		276
306	return 0;	277	return 0;
307	}	278	}
308		279
309	/*	280	archetype::archetype ()
310	* Initialises the internal linked list of archetypes (read from file).	281	{
311	* Then the global "empty_archetype" pointer is initialised.	282	clone.arch = this;
312	* Then the blocksview[] array is initialised.
313	*/
314		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
315	void	310	void
316	init_archetypes (void)	311	overwrite (archetype at, object op)
317	{ /* called from add_player() and edit() */	312	{
318	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	parts.push_back (std::make_pair (at, op));
		357
		358	if (f.kw != KW_more)
		359	break;
		360
		361	f.next ();
		362
		363	if (f.kw != KW_object)
		364	{
		365	f.parse_error ("more object");
		366	goto fail;
		367	}
		368	}
		369
		370	{
		371	archetype *head = parts.front ().first;
		372
		373	// check that all archetypes belong to the same object or are heads
		374	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		375	{
		376	archetype *at = p->first;
		377
		378	if (at->head != head && at->head)
		379	{
		380	LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
		381	goto fail;
		382	}
		383
		384	if (at->next && at != head)
		385	{
		386	LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
		387	goto fail;
		388	}
		389	}
		390
		391	// sever chain of existing head object
		392	for (archetype more, at = head; at; at = more)
		393	{
		394	more = at->more;
		395
		396	at->head = 0;
		397	at->more = 0;
		398	}
		399
		400	// replace/update head
		401	overwrite (head, parts.front ().second);
		402	head->tail_x = 0;
		403	head->tail_y = 0;
		404
		405	// link into list of heads, if not already there
		406	if (!head->linked)
		407	{
		408	head->linked = true;
		409	head->next = first_archetype;
		410	first_archetype = head;
		411	}
		412
		413	// reassemble new chain
		414	archetype *prev = head;
		415	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		416	{
		417	archetype *at = p->first;
		418	overwrite (at, p->second);
		419
		420	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
		421	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
		422
		423	at->head = head;
		424	at->clone.head = &head->clone;
		425	prev->more = at;
		426	prev->clone.more = &at->clone;
		427
		428	prev = at;
		429	}
		430
		431	loading_arch = false;
		432	return head;
		433	}
		434
		435	fail:
		436	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		437	p->second->destroy (true);
		438
		439	loading_arch = false;
319	return;	440	return 0;
		441	}
320		442
321	arch_init = 1;	443	/*
322	load_archetypes ();	444	* Initialize global archtype pointers:
323	arch_init = 0;	445	*/
		446	void
		447	init_archetype_pointers ()
		448	{
		449	ring_arch = archetype::find ("ring");
		450	amulet_arch = archetype::find ("amulet");
		451	staff_arch = archetype::find ("staff");
		452	crown_arch = archetype::find ("crown");
324	empty_archetype = archetype::find ("empty_archetype");	453	empty_archetype = archetype::find ("empty_archetype");
325
326	/* init_blocksview();*/
327	}
328
329	/*
330	* Stores debug-information about how efficient the hashtable
331	* used for archetypes has been in the static errmsg array.
332	*/
333
334	void
335	arch_info (object *op)
336	{
337	sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);
338	new_draw_info (NDI_BLACK, 0, op, errmsg);
339	}
340
341	/*
342	* Initialise the hashtable used by the archetypes.
343	*/
344
345	void
346	clear_archetable (void)
347	{
348	memset ((void ) arch_table, 0, ARCHTABLE sizeof (archetype *));
349	}
350
351	/*
352	* An alternative way to init the hashtable which is slower, but _works_...
353	*/
354
355	void
356	init_archetable (void)
357	{
358	archetype *at;
359
360	LOG (llevDebug, " Setting up archetable...\n");
361
362	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
363	at->hash_add ();
364
365	LOG (llevDebug, "done\n");
366	}
367
368	void
369	free_all_archs (void)
370	{
371	archetype at, next;
372	int i = 0, f = 0;
373
374	for (at = first_archetype; at != NULL; at = next)
375	{
376	if (at->more)
377	next = at->more;
378	else
379	next = at->next;
380
381	delete
382	at;
383
384	i++;
385	}
386
387	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
388	}
389
390	archetype::archetype ()
391	{
392	clear_object (&clone); /* to initial state other also */
393	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */
394	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
395	}
396
397	archetype::~archetype ()
398	{
399	}
400
401	/*
402	* Reads/parses the archetype-file, and copies into a linked list
403	* of archetype-structures.
404	*/
405	void
406	first_arch_pass (object_thawer & fp)
407	{
408	archetype head = 0, last_more = 0;
409
410	archetype *at = new archetype;
411	at->clone.arch = first_archetype = at;
412
413	while (int i = load_object (fp, &at->clone, 0))
414	{
415	at->clone.speed_left = (float) (-0.1);
416	/* copy the body_info to the body_used - this is only really
417	* need for monsters, but doesn't hurt to do it for everything.
418	* by doing so, when a monster is created, it has good starting
419	* values for the body_used info, so when items are created
420	* for it, they can be properly equipped.
421	*/
422	memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
423
424	switch (i)
425	{
426	case LL_NORMAL: /* A new archetype, just link it with the previous */
427	if (last_more != NULL)
428	last_more->next = at;
429	if (head != NULL)
430	head->next = at;
431	head = last_more = at;
432	#if 0
433	if (!op->type)
434	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
435	#endif
436	at->tail_x = 0;
437	at->tail_y = 0;
438	break;
439
440	case LL_MORE: /* Another part of the previous archetype, link it correctly */
441
442	at->head = head;
443	at->clone.head = &head->clone;
444	if (last_more != NULL)
445	{
446	last_more->more = at;
447	last_more->clone.more = &at->clone;
448	}
449	last_more = at;
450
451	/* If this multipart image is still composed of individual small
452	* images, don't set the tail_.. values. We can't use them anyways,
453	* and setting these to zero makes the map sending to the client much
454	* easier as just looking at the head, we know what to do.
455	*/
456	if (at->clone.face != head->clone.face)
457	{
458	head->tail_x = 0;
459	head->tail_y = 0;
460	}
461	else
462	{
463	if (at->clone.x > head->tail_x)
464	head->tail_x = at->clone.x;
465	if (at->clone.y > head->tail_y)
466	head->tail_y = at->clone.y;
467	}
468	break;
469
470	}
471
472	at = new archetype;
473
474	at->clone.arch = at;
475	}
476
477	delete at;
478	}
479
480	/*
481	* Reads the archetype file once more, and links all pointers between
482	* archetypes.
483	*/
484
485	void
486	second_arch_pass (object_thawer & thawer)
487	{
488	char buf[MAX_BUF], variable = buf, argument, *cp;
489	archetype at = NULL, other;
490
491	while (fgets (buf, MAX_BUF, thawer) != NULL)
492	{
493	if (*buf == '#')
494	continue;
495	if ((argument = strchr (buf, ' ')) != NULL)
496	{
497	*argument = '\0', argument++;
498	cp = argument + strlen (argument) - 1;
499	while (isspace (*cp))
500	{
501	*cp = '\0';
502	cp--;
503	}
504	}
505	if (!strcmp ("Object", variable))
506	{
507	if ((at = archetype::find (argument)) == NULL)
508	LOG (llevError, "Warning: failed to find arch %s\n", argument);
509	}
510	else if (!strcmp ("other_arch", variable))
511	{
512	if (at != NULL && at->clone.other_arch == NULL)
513	{
514	if ((other = archetype::find (argument)) == NULL)
515	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
516	else if (at != NULL)
517	at->clone.other_arch = other;
518	}
519	}
520	else if (!strcmp ("randomitems", variable))
521	{
522	if (at != NULL)
523	{
524	treasurelist *tl = find_treasurelist (argument);
525
526	if (tl == NULL)
527	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
528	else
529	at->clone.randomitems = tl;
530	}
531	}
532	}
533	}
534
535	#ifdef DEBUG
536	void
537	check_generators (void)
538	{
539	archetype *at;
540
541	for (at = first_archetype; at != NULL; at = at->next)
542	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
543	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
544	}
545	#endif
546
547	/*
548	* First initialises the archtype hash-table (init_archetable()).
549	* Reads and parses the archetype file (with the first and second-pass
550	* functions).
551	* Then initialises treasures by calling load_treasures().
552	*/
553
554	void
555	load_archetypes (void)
556	{
557	char filename[MAX_BUF];
558
559	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
560	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
561
562	{
563	object_thawer
564	thawer (filename);
565
566	clear_archetable ();
567	LOG (llevDebug, " arch-pass 1...\n");
568	first_arch_pass (thawer);
569	LOG (llevDebug, " done\n");
570	}
571
572	init_archetable ();
573	warn_archetypes = 1;
574
575	{
576	object_thawer
577	thawer (filename);
578
579	LOG (llevDebug, " loading treasure...\n");
580	load_treasures ();
581	LOG (llevDebug, " done\n arch-pass 2...\n");
582	second_arch_pass (thawer);
583	LOG (llevDebug, " done\n");
584	#ifdef DEBUG
585	check_generators ();
586	#endif
587	}
588	LOG (llevDebug, " done\n");
589	}	454	}
590		455
591	/*	456	/*
592	* Creates and returns a new object which is a copy of the given archetype.	457	* Creates and returns a new object which is a copy of the given archetype.
593	* This function returns NULL on failure.	458	* This function returns NULL on failure.
594	*/	459	*/
595
596	object *	460	object *
597	arch_to_object (archetype *at)	461	arch_to_object (archetype *at)
598	{	462	{
599	object *op;	463	if (!at)
600
601	if (at == NULL)
602	{	464	{
603	if (warn_archetypes)
604	LOG (llevError, "Couldn't find archetype.\n");	465	LOG (llevError, "Couldn't find archetype.\n");
605
606	return NULL;	466	return 0;
607	}	467	}
608		468
609	op = get_object ();	469	object *op = at->clone.clone ();
610	copy_object (&at->clone, op);
611	op->arch = at;	470	op->arch = at;
612	op->instantiate ();	471	op->instantiate ();
		472
613	return op;	473	return op;
614	}	474	}
615		475
616	/*	476	/*
617	* Creates an object. This function is called by get_archetype()	477	* Creates an object. This function is called by get_archetype()
618	* if it fails to find the appropriate archetype.	478	* if it fails to find the appropriate archetype.
619	* Thus get_archetype() will be guaranteed to always return	479	* Thus get_archetype() will be guaranteed to always return
620	* an object, and never NULL.	480	* an object, and never NULL.
621	*/	481	*/
622
623	object *	482	object *
624	create_singularity (const char *name)	483	create_singularity (const char *name)
625	{	484	{
626	object *op;	485	object *op;
627	char buf[MAX_BUF];	486	char buf[MAX_BUF];
628		487
629	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	488	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
630	op = get_object ();	489	op = object::create ();
631	op->name = op->name_pl = buf;	490	op->name = op->name_pl = buf;
632	SET_FLAG (op, FLAG_NO_PICK);	491	SET_FLAG (op, FLAG_NO_PICK);
633	return op;	492	return op;
634	}	493	}
635		494
636	/*	495	/*
637	* Finds which archetype matches the given name, and returns a new	496	* Finds which archetype matches the given name, and returns a new
638	* object containing a copy of the archetype.	497	* object containing a copy of the archetype.
639	*/	498	*/
640
641	object *	499	object *
642	get_archetype (const char *name)	500	get_archetype (const char *name)
643	{	501	{
644	archetype *at = archetype::find (name);	502	archetype *at = archetype::find (name);
645		503
…		…
648		506
649	return arch_to_object (at);	507	return arch_to_object (at);
650	}	508	}
651		509
652	/*	510	/*
653	* Hash-function used by the arch-hashtable.
654	*/
655
656	unsigned long
657	hasharch (const char *str, int tablesize)
658	{
659	unsigned long hash = 0;
660	unsigned int i = 0;
661	const char *p;
662
663	/* use the one-at-a-time hash function, which supposedly is
664	* better than the djb2-like one used by perl5.005, but
665	* certainly is better then the bug used here before.
666	* see http://burtleburtle.net/bob/hash/doobs.html
667	*/
668	for (p = str; i < MAXSTRING && *p; p++, i++)
669	{
670	hash += *p;
671	hash += hash << 10;
672	hash ^= hash >> 6;
673	}
674
675	hash += hash << 3;
676	hash ^= hash >> 11;
677	hash += hash << 15;
678
679	return hash % tablesize;
680	}
681
682	/*
683	* Finds, using the hashtable, which archetype matches the given name.	511	* Finds, using the hashtable, which archetype matches the given name.
684	* returns a pointer to the found archetype, otherwise NULL.	512	* returns a pointer to the found archetype, otherwise NULL.
685	*/	513	*/
686
687	archetype *	514	archetype *
688	archetype::find (const char *name)	515	archetype::find (const char *name)
689	{	516	{
690	if (!name)	517	if (!name)
691	return 0;	518	return 0;
692		519
693	#if USE_UNORDERED_MAP	520	auto (i, ht.find (name));
694	AUTODECL (i, ht.find ((size_t) name));
695		521
696	if (i == ht.end ())	522	if (i == ht.end ())
697	return 0;	523	return 0;
698	else	524	else
699	return i->second;	525	return i->second;
700	#endif	526	}
701		527
702	archetype *at;	528	archetype *
703	unsigned long index;	529	archetype::get (const char *name)
		530	{
		531	archetype *at = find (name);
704		532
705	index = hasharch (name, ARCHTABLE);	533	if (!at)
706	arch_search++;
707	for (;;)
708	{
709	at = arch_table[index];
710
711	if (at == NULL)
712	{
713	if (warn_archetypes)
714	LOG (llevError, "Couldn't find archetype %s\n", name);
715
716	return NULL;
717	}
718
719	arch_cmp++;
720
721	if (!strcmp ((const char *) at->name, name))
722	return at;
723
724	if (++index >= ARCHTABLE)
725	index = 0;
726	}	534	{
		535	archetypes.push_back (at = new archetype);
		536	at->name = at->clone.name = at->clone.name_pl = name;
		537	at->hash_add ();
		538	}
		539
		540	return at;
727	}	541	}
728		542
729	/*	543	/*
730	* Adds an archetype to the hashtable.	544	* Adds an archetype to the hashtable.
731	*/	545	*/
732	void	546	void
733	archetype::hash_add ()	547	archetype::hash_add ()
734	{	548	{
735	#if USE_UNORDERED_MAP
736	ht.insert (std::make_pair ((size_t) (const char *) name, this));	549	ht.insert (std::make_pair (name, this));
737	#else
738
739	int index = hasharch ((const char *) name, ARCHTABLE), org_index = index;
740
741	for (;;)
742	{
743	if (!arch_table[index])
744	{
745	arch_table[index] = this;
746	break;
747	}
748
749	if (++index == ARCHTABLE)
750	index = 0;
751
752	if (index == org_index)
753	fatal (ARCHTABLE_TOO_SMALL);
754	}
755	#endif
756	}	550	}
757		551
758	void	552	void
759	archetype::hash_del ()	553	archetype::hash_del ()
760	{	554	{
761	#if USE_UNORDERED_MAP	555	ht.erase (name);
762	# error remove this from HT
763	#else
764
765	int index = hasharch ((const char *) name, ARCHTABLE), org_index = index;
766
767	for (;;)
768	{
769	if (arch_table[index] == this)
770	{
771	arch_table[index] = 0;
772	break;
773	}
774
775	if (++index == ARCHTABLE)
776	index = 0;
777
778	if (index == org_index)
779	break;
780	}
781	#endif
782	}	556	}
783		557
784	/*	558	/*
785	* Returns the first archetype using the given type.	559	* Returns the first archetype using the given type.
786	* Used in treasure-generation.	560	* Used in treasure-generation.
787	*/	561	*/
788
789	archetype *	562	archetype *
790	type_to_archetype (int type)	563	type_to_archetype (int type)
791	{	564	{
792	archetype *at;
793
794	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	565	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
795	if (at->clone.type == type)	566	if (at->clone.type == type)
796	return at;	567	return at;
797		568
798	return 0;	569	return 0;
799	}	570	}
…		…
801	/*	572	/*
802	* Returns a new object copied from the first archetype matching	573	* Returns a new object copied from the first archetype matching
803	* the given type.	574	* the given type.
804	* Used in treasure-generation.	575	* Used in treasure-generation.
805	*/	576	*/
806
807	object *	577	object *
808	clone_arch (int type)	578	clone_arch (int type)
809	{	579	{
810	archetype *at;	580	archetype *at;
811	object *op = get_object ();
812		581
813	if ((at = type_to_archetype (type)) == NULL)	582	if ((at = type_to_archetype (type)) == NULL)
814	{	583	{
815	LOG (llevError, "Can't clone archetype %d\n", type);	584	LOG (llevError, "Can't clone archetype %d\n", type);
816	op->destroy (0);
817	return NULL;	585	return 0;
818	}	586	}
819		587
820	copy_object (&at->clone, op);	588	object *op = at->clone.clone ();
821	op->instantiate ();	589	op->instantiate ();
822	return op;	590	return op;
823	}	591	}
824		592
825	/*	593	/*

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.28 by root, Tue Dec 12 20:53:02 2006 UTC vs. Revision 1.57 by root, Thu Apr 19 19:24:25 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.28 by root, Tue Dec 12 20:53:02 2006 UTC vs.
Revision 1.57 by root, Thu Apr 19 19:24:25 2007 UTC