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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.37 by pippijn, Mon Jan 15 21:06:18 2007 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 2009 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 it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation; either version 2 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* 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 Affero GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* and the GNU General Public License along with this program. If not, see
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	23	*/
24		24
25	#include <cassert>	25	#include <cassert>
26		26
27	#include <global.h>	27	#include <global.h>
28	#include <funcpoint.h>
29	#include <loader.h>	28	#include <loader.h>
30		29
31	#define USE_UNORDERED_MAP 0
32
33	#if USE_UNORDERED_MAP
34	# include <tr1/functional>	30	#include <tr1/functional>
35	# include <tr1/unordered_map>	31	#include <tr1/unordered_map>
36	#endif
37		32
38	int arch_cmp = 0; /* How many strcmp's */	33	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
39	int arch_search = 0; /* How many searches */	34	arch_ptr archetype::empty;
40	int arch_init; /* True if doing arch initialization */
41		35
42	/* The naming of these functions is really poor - they are all
43	* pretty much named '.._arch_...', but they may more may not
44	* return archetypes. Some make the arch_to_object call, and thus
45	* return an object. Perhaps those should be called 'archob' functions
46	* to denote they return an object derived from the archetype.
47	* MSW 2003-04-29
48	*/
49
50	#if USE_UNORDERED_MAP
51	// the hashtable	36	// the hashtable
52	typedef std::tr1::unordered_map	37	typedef std::tr1::unordered_map
53	<	38	<
54	std::size_t,	39	const char *,
55	arch_ptr,	40	arch_ptr,
56	std::tr1::hash<size_t>,	41	str_hash,
57	std::equal_to<size_t>,	42	str_equal,
58	slice_allocator< std::pair<const std::size_t, archetype *> >	43	slice_allocator< std::pair<const char *const, arch_ptr> >
59	true,
60	> HT;	44	> HT;
61		45
62	static HT ht;	46	static HT ht (10000);
63	#else	47	archvec archetypes;
64	static arch_ptr arch_table[ARCHTABLE];	48	static unordered_vector<archetype *> allarch;
65	#endif	49	static int dirtycnt;
		50
		51	// the vector of other_arch references to be resolved
		52	static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
		53	// the vector of loaded but not yet committed archetypes
		54	static std::vector<archetype *> postponed_arch;
		55
		56	//+GPL
66		57
67	/**	58	/**
68	* GROS - This function retrieves an archetype given the name that appears	59	* GROS - This function retrieves an archetype given the name that appears
69	* during the game (for example, "writing pen" instead of "stylus").	60	* during the game (for example, "writing pen" instead of "stylus").
70	* It does not use the hashtable system, but browse the whole archlist each time.	61	* It does not use the hashtable system, but browse the whole archlist each time.
76	* - the archetype found or null if nothing was found.	67	* - the archetype found or null if nothing was found.
77	*/	68	*/
78	archetype *	69	archetype *
79	find_archetype_by_object_name (const char *name)	70	find_archetype_by_object_name (const char *name)
80	{	71	{
81	archetype *at;	72	shstr_cmp name_cmp (name);
82		73
83	if (name == NULL)	74	for_all_archetypes (at)
84	return (archetype *) NULL;	75	if (at->name == name_cmp)
85
86	for (at = first_archetype; at != NULL; at = at->next)
87	{
88	if (!strcmp (at->clone.name, name))
89	return at;	76	return at;
90	}	77
91	return NULL;	78	return 0;
92	}	79	}
93		80
94	/**	81	/**
95	* This function retrieves an archetype by type and name that appears during	82	* This function retrieves an archetype by type and name that appears during
96	* the game. It is basically the same as find_archetype_by_object_name()	83	* the game. It is basically the same as find_archetype_by_object_name()
97	* except that it considers only items of the given type.	84	* except that it considers only items of the given type.
98	*/	85	*/
99	archetype *	86	archetype *
100	find_archetype_by_object_type_name (int type, const char *name)	87	find_archetype_by_object_type_name (int type, const char *name)
101	{	88	{
102	archetype *at;	89	shstr_cmp name_cmp (name);
103		90
104	if (name == NULL)	91	for_all_archetypes (at)
105	return NULL;	92	if (at->name == name_cmp && at->type == type)
106
107	for (at = first_archetype; at != NULL; at = at->next)
108	{
109	if (at->clone.type == type && strcmp (at->clone.name, name) == 0)
110	return at;	93	return at;
111	}
112		94
113	return NULL;	95	return 0;
114	}	96	}
115		97
116	/* This is a lot like the above function. Instead, we are trying to match	98	/* This is a lot like the above function. Instead, we are trying to match
117	* the arch->skill values. type is the type of object to match	99	* the arch->skill values. type is the type of object to match
118	* against (eg, to only match against skills or only skill objects for example).	100	* against (eg, to only match against skills or only skill objects for example).
119	* If type is -1, ew don't match on type.	101	* If type is -1, ew don't match on type.
120	*/	102	*/
121	object *	103	object *
122	get_archetype_by_skill_name (const char *skill, int type)	104	get_archetype_by_skill_name (const char *skill, int type)
123	{	105	{
124	archetype *at;	106	shstr_cmp skill_cmp (skill);
125		107
126	if (skill)	108	for_all_archetypes (at)
127	for (at = first_archetype; at; at = at->next)	109	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
128	if (((type == -1) \|\| (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))	110	return at->instance ();
129	return arch_to_object (at);
130		111
131	return 0;	112	return 0;
132	}	113	}
133		114
134	/* similiar to above - this returns the first archetype	115	/* similiar to above - this returns the first archetype
…		…
139	* (eg, skills)	120	* (eg, skills)
140	*/	121	*/
141	archetype *	122	archetype *
142	get_archetype_by_type_subtype (int type, int subtype)	123	get_archetype_by_type_subtype (int type, int subtype)
143	{	124	{
144	archetype *	125	for_all_archetypes (at)
145	at;
146
147	for (at = first_archetype; at != NULL; at = at->next)
148	{
149	if (((type == -1) \|\| (type == at->clone.type)) && (subtype == -1 \|\| subtype == at->clone.subtype))	126	if ((type == -1 \|\| type == at->type) && (subtype == -1 \|\| subtype == at->subtype))
150	return at;	127	return at;
151	}	128
152	return NULL;	129	return 0;
153	}	130	}
154		131
155	/**	132	/**
156	* GROS - this returns a new object given the name that appears during the game	133	* GROS - this returns a new object given the name that appears during the game
157	* (for example, "writing pen" instead of "stylus").	134	* (for example, "writing pen" instead of "stylus").
…		…
159	* - name: The name we're searching for (ex: "writing pen");	136	* - name: The name we're searching for (ex: "writing pen");
160	* Return value:	137	* Return value:
161	* - a corresponding object if found; a singularity object if not found.	138	* - a corresponding object if found; a singularity object if not found.
162	* Note by MSW - it appears that it takes the full name and keeps	139	* Note by MSW - it appears that it takes the full name and keeps
163	* shortening it until it finds a match. I re-wrote this so that it	140	* shortening it until it finds a match. I re-wrote this so that it
164	* doesn't malloc it each time - not that this function is used much,	141	* doesn't allocate it each time - not that this function is used much,
165	* but it otherwise had a big memory leak.	142	* but it otherwise had a big memory leak.
166	*/	143	*/
167	object *	144	object *
168	get_archetype_by_object_name (const char *name)	145	get_archetype_by_object_name (const char *name)
169	{	146	{
170	archetype *at;
171	char tmpname[MAX_BUF];	147	char tmpname[MAX_BUF];
172	int i;
173		148
174	assign (tmpname, name);	149	assign (tmpname, name);
175		150
176	for (i = strlen (tmpname); i > 0; i--)	151	for (int i = strlen (tmpname); i > 0; i--)
177	{	152	{
178	tmpname[i] = 0;	153	tmpname[i] = 0;
		154
179	at = find_archetype_by_object_name (tmpname);	155	if (archetype *at = find_archetype_by_object_name (tmpname))
180		156	return at->instance ();
181	if (at)
182	return arch_to_object (at);
183	}	157	}
184		158
185	return create_singularity (name);	159	return create_singularity (name);
186	}	160	}
187		161
188	/* This is a subset of the parse_id command. Basically, name can be	162	/* This is a subset of the parse_id command. Basically, name can be
189	* a string seperated lists of things to match, with certain keywords.	163	* a string seperated lists of things to match, with certain keywords.
190	* pl is the player (only needed to set count properly)	164	* pl is the player (only needed to set count properly)
191	* op is the item we are trying to match. Calling function takes care	165	* op is the item we are trying to match. Calling function takes care
192	* of what action might need to be done and if it is valid	166	* of what action might need to be done and if it is valid
193	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher	167	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
194	* value means a better match. 0 means no match.	168	* value means a better match. 0 means no match.
195	*	169	*
196	* Brief outline of the procedure:	170	* Brief outline of the procedure:
197	* We take apart the name variable into the individual components.	171	* We take apart the name variable into the individual components.
198	* cases for 'all' and unpaid are pretty obvious.	172	* cases for 'all' and unpaid are pretty obvious.
199	* Next, we check for a count (either specified in name, or in the	173	* Next, we check for a count (either specified in name, or in the
200	* player object.)	174	* player object.)
201	* If count is 1, make a quick check on the name.	175	* If count is 1, make a quick check on the name.
202	* IF count is >1, we need to make plural name. Return if match.	176	* IF count is >1, we need to make plural name. Return if match.
203	* Last, make a check on the full name.	177	* Last, make a check on the full name.
204	*/	178	*/
205	int	179	int
206	item_matched_string (object pl, object op, const char *name)	180	item_matched_string (object pl, object op, const char *name)
207	{	181	{
208	char *cp, local_name[MAX_BUF];	182	char *cp, local_name[MAX_BUF];
209	int count, retval = 0;	183	int count, retval = 0;
210		184
211	strcpy (local_name, name); /* strtok is destructive to name */	185	assign (local_name, name); /* strtok is destructive to name */
212		186
213	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))	187	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
214	{	188	{
215	while (cp[0] == ' ')	189	while (cp[0] == ' ')
216	++cp; /* get rid of spaces */	190	++cp; /* get rid of spaces */
…		…
221	return 1;	195	return 1;
222		196
223	/* unpaid is a little more specific */	197	/* unpaid is a little more specific */
224	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	198	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
225	return 2;	199	return 2;
		200
226	if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))	201	if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))
227	return 2;	202	return 2;
228		203
229	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	204	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
230	return 2;	205	return 2;
…		…
252	* is because of the 'else' handling - we don't want to match on	227	* is because of the 'else' handling - we don't want to match on
253	* something and set a low retval, even though it may match a higher retcal	228	* something and set a low retval, even though it may match a higher retcal
254	* later. So keep it in descending order here, so we try for the best	229	* later. So keep it in descending order here, so we try for the best
255	* match first, and work downward.	230	* match first, and work downward.
256	*/	231	*/
		232	const char qbn0, qbn1, *qsn; // query base name/short name caches
		233
257	if (!strcasecmp (cp, query_name (op)))	234	if (!strcasecmp (cp, query_name (op)))
258	retval = 20;	235	retval = 20;
259	else if (!strcasecmp (cp, query_short_name (op)))	236	else if (!strcasecmp (cp, qsn = query_short_name (op)))
260	retval = 18;	237	retval = 18;
261	else if (!strcasecmp (cp, query_base_name (op, 0)))	238	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
262	retval = 16;	239	retval = 16;
263	else if (!strcasecmp (cp, query_base_name (op, 1)))	240	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
264	retval = 16;	241	retval = 16;
265	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	242	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
266	retval = 15;	243	retval = 15;
267	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	244	else if (!strncasecmp (cp, qbn0, strlen (cp)))
268	retval = 14;	245	retval = 14;
269	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	246	else if (!strncasecmp (cp, qbn1, strlen (cp)))
270	retval = 14;	247	retval = 14;
271	/* Do substring checks, so things like 'Str+1' will match.	248	/* Do substring checks, so things like 'Str+1' will match.
272	* retval of these should perhaps be lower - they are lower	249	* retval of these should perhaps be lower - they are lower
273	* then the specific strcasecmp aboves, but still higher than	250	* then the specific strcasecmp aboves, but still higher than
274	* some other match criteria.	251	* some other match criteria.
275	*/	252	*/
276	else if (strstr (query_base_name (op, 1), cp))	253	else if (strstr (qbn1, cp))
277	retval = 12;	254	retval = 12;
278	else if (strstr (query_base_name (op, 0), cp))	255	else if (strstr (qbn0, cp))
279	retval = 12;	256	retval = 12;
280	else if (strstr (query_short_name (op), cp))	257	else if (strstr (qsn, cp))
281	retval = 12;	258	retval = 12;
282	/* Check against plural/non plural based on count. */	259	/* Check against plural/non plural based on count. */
283	else if (count > 1 && !strcasecmp (cp, op->name_pl))	260	else if (count > 1 && !strcasecmp (cp, op->name_pl))
284	retval = 6;	261	retval = 6;
285	else if (count == 1 && !strcasecmp (op->name, cp))	262	else if (count == 1 && !strcasecmp (op->name, cp))
286	retval = 6;	263	retval = 6;
287	/* base name matched - not bad */	264	/* base name matched - not bad */
288	else if (strcasecmp (cp, op->name) == 0 && !count)	265	else if (strcasecmp (cp, op->name) == 0 && !count)
289	retval = 4;	266	retval = 4;
290	/* Check for partial custom name, but give a real low priority */	267	/* Check for partial custom name, but give a real low priority */
291	else if (op->custom_name && strstr (op->custom_name, cp))	268	else if (op->custom_name.contains (cp))
292	retval = 3;	269	retval = 3;
293		270
294	if (retval)	271	if (retval)
295	{	272	{
296	if (pl->type == PLAYER)	273	if (pl->type == PLAYER)
…		…
301	}	278	}
302		279
303	return 0;	280	return 0;
304	}	281	}
305		282
		283	//-GPL
		284
		285	archetype::archetype (const char *name)
		286	{
		287	arch = this;
		288	this->archname = this->name = this->name_pl = name;
		289	}
		290
		291	archetype::~archetype ()
		292	{
		293	unlink ();
		294	}
		295
		296	void
		297	archetype::link ()
		298	{
		299	if (!archetypes.contains (this))
		300	{
		301	archetypes.insert (this);
		302	ht.insert (std::make_pair (archname, this));
		303	}
		304	}
		305
		306	void
		307	archetype::unlink ()
		308	{
		309	if (archetypes.contains (this))
		310	{
		311	archetypes.erase (this);
		312	ht.erase (archname);
		313	}
		314	}
		315
306	/*	316	/*
307	* Initialises the internal linked list of archetypes (read from file).	317	* Finds, using the hashtable, which archetype matches the given name.
308	* Then the global "empty_archetype" pointer is initialised.	318	* returns a pointer to the found archetype, otherwise NULL.
309	* Then the blocksview[] array is initialised.
310	*/	319	*/
		320	archetype *
		321	archetype::find (const char *name)
		322	{
		323	if (!name)
		324	return 0;
		325
		326	auto (i, ht.find (name));
		327
		328	if (i == ht.end ())
		329	return 0;
		330	else
		331	return i->second;
		332	}
		333
		334	archetype *
		335	archetype::read (object_thawer &f)
		336	{
		337	assert (f.kw == KW_object);
		338
		339	std::vector<archetype *> parts;
		340
		341	coroapi::cede_to_tick ();
		342
		343	for (;;)
		344	{
		345	archetype *at = new archetype (f.get_str ());
		346
		347	f.next ();
		348
		349	#if 0
		350	// implementing it here in the server does neither allow multiple inheritence
		351	// nor does it cleanly "just override". it would allow use in map files, though,
		352	// and other resource files dynamically laoded (as opposed to being preprocessed).
		353	// not that any of this is relevant as of yet...
		354	if (f.kw == KW_inherit)
		355	{
		356	if (archetype *at = find (f.get_str ()))
		357	*op = at->clone;
		358	else
		359	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		360	&at->archname, f.get_str ());
		361
		362	f.next ();
		363	}
		364	#endif
		365
		366	loading_arch = at; // hack to tell parse_kv et al. to behave
		367	bool parse_ok = at->parse_kv (f);
		368	loading_arch = 0;
		369
		370	if (!parse_ok)
		371	goto fail;
		372
		373	loading_arch = at; // hack to tell parse_kv et al. to behave
		374	at->post_load_check ();
		375	loading_arch = 0;
		376
		377	parts.push_back (at);
		378
		379	if (f.kw != KW_more)
		380	break;
		381
		382	f.next ();
		383
		384	if (f.kw != KW_object)
		385	{
		386	f.parse_error ("more object");
		387	goto fail;
		388	}
		389	}
		390
		391	{
		392	auto (at, parts.begin ());
		393
		394	archetype *new_head = parts.front ();
		395	archetype *old_head = find (new_head->archname);
		396
		397	if (old_head && !old_head->is_head ())
		398	{
		399	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		400	&new_head->archname, &old_head->archname);
		401	goto fail;
		402	}
		403
		404	// check that all archetypes belong to the same old object or are new
		405	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		406	{
		407	archetype new_part = at;
		408	archetype *old_part = find (new_part->archname);
		409
		410	if (old_part && old_part->head_ () != old_head)
		411	{
		412	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		413	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		414	goto fail;
		415	}
		416	}
		417
		418	// assemble new chain
		419	new_head->min_x = new_head->max_x = new_head->x;
		420	new_head->min_y = new_head->max_y = new_head->y;
		421
		422	archetype *less = new_head;
		423	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		424	{
		425	archetype at = p;
		426
		427	// some flags get inherited from the head (probably a lot more)
		428	// doing it here doesn't feel too cozy, but it allows code
		429	// to ignore head checks for these flags, which saves time
		430	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		431	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		432	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		433	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		434
		435	new_head->min_x = min (new_head->min_x, at->x);
		436	new_head->min_y = min (new_head->min_y, at->y);
		437	new_head->max_x = max (new_head->max_x, at->x);
		438	new_head->max_y = max (new_head->max_y, at->y);
		439
		440	at->head = new_head;
		441	less->more = at;
		442	less = at;
		443	}
		444
		445	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
		446
		447	return new_head;
		448	}
		449
		450	fail:
		451	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		452	(*p)->destroy ();
		453
		454	return 0;
		455	}
311		456
312	void	457	void
313	init_archetypes (void)	458	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
314	{ /* called from add_player() and edit() */	459	{
315	if (first_archetype != NULL) /* Only do this once */	460	ref = 0;
316	return;	461	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
317
318	arch_init = 1;
319	load_archetypes ();
320	arch_init = 0;
321	empty_archetype = archetype::find ("empty_archetype");
322
323	/* init_blocksview();*/
324	}	462	}
325
326	/*
327	* Stores debug-information about how efficient the hashtable
328	* used for archetypes has been in the static errmsg array.
329	*/
330		463
331	void	464	void
332	arch_info (object *op)	465	archetype::commit_load ()
333	{	466	{
334	sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);	467	// unlink old archetypes and link in new ones */
335	new_draw_info (NDI_BLACK, 0, op, errmsg);	468	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
336	}	469	{
		470	archetype at = p;
337		471
338	/*	472	if (archetype *old = find (at->archname))
339	* Initialise the hashtable used by the archetypes.	473	old->unlink ();
340	*/	474
		475	allarch.push_back (at);
		476
		477	at->link ();
		478	++dirtycnt;
		479	}
		480
		481	postponed_arch.clear ();
		482
		483	// now resolve arch references
		484	for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
		485	{
		486	arch_ptr *ap = p->first;
		487	archetype *at = find (p->second);
		488
		489	if (!at)
		490	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		491
		492	*ap = at;
		493	}
		494
		495	postponed_arch_ref.clear ();
		496
		497	empty = find (shstr_empty_archetype);
		498	}
341		499
342	void	500	void
343	clear_archetable (void)	501	archetype::gc ()
344	{	502	{
345	memset ((void ) arch_table, 0, ARCHTABLE sizeof (archetype *));	503	int cnt = max (1, min (allarch.size () / 128, dirtycnt));
346	}	504	dirtycnt = max (0, dirtycnt - cnt);
347		505
348	/*	506	do
349	* An alternative way to init the hashtable which is slower, but _works_...
350	*/
351
352	void
353	init_archetable (void)
354	{
355	archetype *at;
356
357	LOG (llevDebug, " Setting up archetable...\n");
358
359	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
360	at->hash_add ();
361
362	LOG (llevDebug, "done\n");
363	}
364
365	void
366	free_all_archs (void)
367	{
368	archetype at, next;
369	int i = 0, f = 0;
370
371	for (at = first_archetype; at != NULL; at = next)
372	{	507	{
373	if (at->more)	508	static int idx;
374	next = at->more;	509
		510	if (idx >= allarch.size ())
		511	if (idx)
		512	idx = 0;
		513	else
		514	return;
		515
		516	archetype *at = allarch [idx];
		517
		518	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
		519	++idx;
375	else	520	else
376	next = at->next;
377
378	delete
379	at;
380
381	i++;
382	}
383
384	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
385	}
386
387	archetype::archetype ()
388	{
389	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
390	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
391	}
392
393	archetype::~archetype ()
394	{
395	}
396
397	/*
398	* Reads/parses the archetype-file, and copies into a linked list
399	* of archetype-structures.
400	*/
401	void
402	first_arch_pass (object_thawer & fp)
403	{
404	archetype head = 0, last_more = 0;
405
406	archetype *at = new archetype;
407	at->clone.arch = first_archetype = at;
408
409	while (int i = load_object (fp, &at->clone, 0))
410	{
411	at->clone.speed_left = (float) (-0.1);
412	/* copy the body_info to the body_used - this is only really
413	* need for monsters, but doesn't hurt to do it for everything.
414	* by doing so, when a monster is created, it has good starting
415	* values for the body_used info, so when items are created
416	* for it, they can be properly equipped.
417	*/
418	memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
419
420	switch (i)
421	{	521	{
422	case LL_NORMAL: /* A new archetype, just link it with the previous */	522	LOG (llevDebug, "garbage collect arch %s", &at->archname);
423	if (last_more != NULL)	523	assert (at->arch == at); // verify that refcnt == 1 is truly valid
424	last_more->next = at;	524	allarch.erase (idx);
425	if (head != NULL)
426	head->next = at;
427	head = last_more = at;
428	#if 0
429	if (!op->type)
430	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
431	#endif
432	at->tail_x = 0;
433	at->tail_y = 0;
434	break;
435		525
436	case LL_MORE: /* Another part of the previous archetype, link it correctly */	526	// break chain
437		527	for (object *op = at->head_ (); op; )
438	at->head = head;
439	at->clone.head = &head->clone;
440	if (last_more != NULL)
441	{	528	{
		529	object *next = op->more;
		530	op->head = 0;
442	last_more->more = at;	531	op->more = 0;
443	last_more->clone.more = &at->clone;	532	op = next;
444	}	533	}
445	last_more = at;
446		534
447	/* If this multipart image is still composed of individual small	535	at->destroy ();
448	* images, don't set the tail_.. values. We can't use them anyways,	536	at->arch = 0;
449	* and setting these to zero makes the map sending to the client much
450	* easier as just looking at the head, we know what to do.
451	*/
452	if (at->clone.face != head->clone.face)
453	{
454	head->tail_x = 0;
455	head->tail_y = 0;
456	}
457	else
458	{
459	if (at->clone.x > head->tail_x)
460	head->tail_x = at->clone.x;
461	if (at->clone.y > head->tail_y)
462	head->tail_y = at->clone.y;
463	}
464	break;
465
466	}	537	}
467
468	at = new archetype;
469
470	at->clone.arch = at;
471	}
472
473	delete at;
474	}
475
476	/*
477	* Reads the archetype file once more, and links all pointers between
478	* archetypes.
479	*/
480
481	void
482	second_arch_pass (object_thawer & thawer)
483	{
484	char buf[MAX_BUF], variable = buf, argument, *cp;
485	archetype at = NULL, other;
486
487	while (fgets (buf, MAX_BUF, thawer) != NULL)
488	{	538	}
489	if (*buf == '#')	539	while (--cnt);
490	continue;
491	if ((argument = strchr (buf, ' ')) != NULL)
492	{
493	*argument = '\0', argument++;
494	cp = argument + strlen (argument) - 1;
495	while (isspace (*cp))
496	{
497	*cp = '\0';
498	cp--;
499	}
500	}
501	if (!strcmp ("Object", variable))
502	{
503	if ((at = archetype::find (argument)) == NULL)
504	LOG (llevError, "Warning: failed to find arch %s\n", argument);
505	}
506	else if (!strcmp ("other_arch", variable))
507	{
508	if (at != NULL && at->clone.other_arch == NULL)
509	{
510	if ((other = archetype::find (argument)) == NULL)
511	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
512	else if (at != NULL)
513	at->clone.other_arch = other;
514	}
515	}
516	else if (!strcmp ("randomitems", variable))
517	{
518	if (at != NULL)
519	{
520	treasurelist *tl = find_treasurelist (argument);
521
522	if (tl == NULL)
523	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
524	else
525	at->clone.randomitems = tl;
526	}
527	}
528	}
529	}	540	}
530		541
531	#ifdef DEBUG
532	void
533	check_generators (void)
534	{
535	archetype *at;
536
537	for (at = first_archetype; at != NULL; at = at->next)
538	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
539	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
540	}
541	#endif
542
543	/*
544	* First initialises the archtype hash-table (init_archetable()).
545	* Reads and parses the archetype file (with the first and second-pass
546	* functions).
547	* Then initialises treasures by calling load_treasures().
548	*/
549
550	void
551	load_archetypes (void)
552	{
553	char filename[MAX_BUF];
554
555	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
556	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
557
558	{
559	object_thawer
560	thawer (filename);
561
562	clear_archetable ();
563	LOG (llevDebug, " arch-pass 1...\n");
564	first_arch_pass (thawer);
565	LOG (llevDebug, " done\n");
566	}
567
568	init_archetable ();
569	warn_archetypes = 1;
570
571	{
572	object_thawer
573	thawer (filename);
574
575	LOG (llevDebug, " loading treasure...\n");
576	load_treasures ();
577	LOG (llevDebug, " done\n");
578	LOG (llevDebug, " arch-pass 2...\n");
579	second_arch_pass (thawer);
580	LOG (llevDebug, " done\n");
581	#ifdef DEBUG
582	check_generators ();
583	#endif
584	}
585	LOG (llevDebug, " done\n");
586	}
587
588	/*
589	* Creates and returns a new object which is a copy of the given archetype.
590	* This function returns NULL on failure.
591	*/
592	object *
593	arch_to_object (archetype *at)
594	{
595	object *op;	542	object *
596		543	archetype::instance ()
597	if (at == NULL)	544	{
598	{	545	object *op = clone ();
599	if (warn_archetypes)
600	LOG (llevError, "Couldn't find archetype.\n");
601
602	return NULL;
603	}
604
605	op = at->clone.clone ();
606	op->arch = at;
607	op->instantiate ();	546	op->instantiate ();
608	return op;	547	return op;
609	}	548	}
		549
		550	//+GPL
610		551
611	/*	552	/*
612	* Creates an object. This function is called by get_archetype()	553	* Creates an object. This function is called by get_archetype()
613	* if it fails to find the appropriate archetype.	554	* if it fails to find the appropriate archetype.
614	* Thus get_archetype() will be guaranteed to always return	555	* Thus get_archetype() will be guaranteed to always return
615	* an object, and never NULL.	556	* an object, and never NULL.
616	*/	557	*/
617	object *	558	object *
618	create_singularity (const char *name)	559	create_singularity (const char *name)
619	{	560	{
620	object *op;	561	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
621	char buf[MAX_BUF];
622		562
623	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	563	if (!strcmp (name, "bug"))
624	op = object::create ();	564	abort ();
625	op->name = op->name_pl = buf;	565
626	SET_FLAG (op, FLAG_NO_PICK);	566	object *op = archetype::get (shstr_bug);
		567	op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
		568
627	return op;	569	return op;
628	}	570	}
629		571
630	/*	572	/*
631	* Finds which archetype matches the given name, and returns a new	573	* Finds which archetype matches the given name, and returns a new
632	* object containing a copy of the archetype.	574	* object containing a copy of the archetype.
633	*/	575	*/
634	object *	576	object *
635	get_archetype (const char *name)	577	get_archetype (const char *name)
636	{	578	{
		579	return archetype::get (name);
		580	}
		581
		582	object *
		583	archetype::get (const char *name)
		584	{
637	archetype *at = archetype::find (name);	585	archetype *at = find (name);
638		586
639	if (!at)	587	if (!at)
640	return create_singularity (name);	588	return create_singularity (name);
641		589
642	return arch_to_object (at);	590	return at->instance ();
643	}
644
645	/*
646	* Hash-function used by the arch-hashtable.
647	*/
648
649	unsigned long
650	hasharch (const char *str, int tablesize)
651	{
652	unsigned long hash = 0;
653	unsigned int i = 0;
654	const char *p;
655
656	/* use the one-at-a-time hash function, which supposedly is
657	* better than the djb2-like one used by perl5.005, but
658	* certainly is better then the bug used here before.
659	* see http://burtleburtle.net/bob/hash/doobs.html
660	*/
661	for (p = str; i < MAXSTRING && *p; p++, i++)
662	{
663	hash += *p;
664	hash += hash << 10;
665	hash ^= hash >> 6;
666	}
667
668	hash += hash << 3;
669	hash ^= hash >> 11;
670	hash += hash << 15;
671
672	return hash % tablesize;
673	}
674
675	/*
676	* Finds, using the hashtable, which archetype matches the given name.
677	* returns a pointer to the found archetype, otherwise NULL.
678	*/
679
680	archetype *
681	archetype::find (const char *name)
682	{
683	if (!name)
684	return 0;
685
686	#if USE_UNORDERED_MAP
687	AUTODECL (i, ht.find ((size_t) name));
688
689	if (i == ht.end ())
690	return 0;
691	else
692	return i->second;
693	#endif
694
695	archetype *at;
696	unsigned long index;
697
698	index = hasharch (name, ARCHTABLE);
699	arch_search++;
700	for (;;)
701	{
702	at = arch_table[index];
703
704	if (at == NULL)
705	{
706	if (warn_archetypes)
707	LOG (llevError, "Couldn't find archetype %s\n", name);
708
709	return NULL;
710	}
711
712	arch_cmp++;
713
714	if (!strcmp ((const char *) at->name, name))
715	return at;
716
717	if (++index >= ARCHTABLE)
718	index = 0;
719	}
720	}
721
722	/*
723	* Adds an archetype to the hashtable.
724	*/
725	void
726	archetype::hash_add ()
727	{
728	#if USE_UNORDERED_MAP
729	ht.insert (std::make_pair ((size_t) (const char *) name, this));
730	#else
731
732	int index = hasharch ((const char *) name, ARCHTABLE), org_index = index;
733
734	for (;;)
735	{
736	if (!arch_table[index])
737	{
738	arch_table[index] = this;
739	break;
740	}
741
742	if (++index == ARCHTABLE)
743	index = 0;
744
745	if (index == org_index)
746	fatal (ARCHTABLE_TOO_SMALL);
747	}
748	#endif
749	}
750
751	void
752	archetype::hash_del ()
753	{
754	#if USE_UNORDERED_MAP
755	# error remove this from HT
756	#else
757
758	int index = hasharch ((const char *) name, ARCHTABLE), org_index = index;
759
760	for (;;)
761	{
762	if (arch_table[index] == this)
763	{
764	arch_table[index] = 0;
765	break;
766	}
767
768	if (++index == ARCHTABLE)
769	index = 0;
770
771	if (index == org_index)
772	break;
773	}
774	#endif
775	}	591	}
776		592
777	/*	593	/*
778	* Returns the first archetype using the given type.	594	* Returns the first archetype using the given type.
779	* Used in treasure-generation.	595	* Used in treasure-generation.
780	*/	596	*/
781
782	archetype *	597	archetype *
783	type_to_archetype (int type)	598	type_to_archetype (int type)
784	{	599	{
785	archetype *at;	600	for_all_archetypes (at)
786		601	if (at->type == type && at->head_ () != at)
787	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
788	if (at->clone.type == type)
789	return at;	602	return at;
790		603
791	return 0;	604	return 0;
792	}	605	}
793		606
794	/*	607	/*
795	* Returns a new object copied from the first archetype matching	608	* Returns a new object copied from the first archetype matching
796	* the given type.	609	* the given type.
797	* Used in treasure-generation.	610	* Used in treasure-generation.
798	*/	611	*/
799
800	object *	612	object *
801	clone_arch (int type)	613	clone_arch (int type)
802	{	614	{
803	archetype *at;	615	archetype *at = type_to_archetype (type);
804		616
805	if ((at = type_to_archetype (type)) == NULL)	617	if (!at)
806	{	618	{
807	LOG (llevError, "Can't clone archetype %d\n", type);	619	LOG (llevError, "Can't clone archetype %d\n", type);
808	return 0;	620	return 0;
809	}	621	}
810		622
811	object *op = at->clone.clone ();	623	return at->instance ();
812	op->instantiate ();
813	return op;
814	}	624	}
815		625
816	/*	626	/*
817	* member: make instance from class	627	* member: make instance from class
818	*/	628	*/
819
820	object *	629	object *
821	object_create_arch (archetype *at)	630	object_create_arch (archetype *at)
822	{	631	{
823	object op, prev = 0, *head = 0;	632	object op, prev = 0, *head = 0;
824		633
825	while (at)	634	while (at)
826	{	635	{
827	op = arch_to_object (at);	636	op = at->instance ();
		637
828	op->x = at->clone.x;	638	op->x = at->x;
829	op->y = at->clone.y;	639	op->y = at->y;
830		640
831	if (head)	641	if (head)
832	op->head = head, prev->more = op;	642	op->head = head, prev->more = op;
833		643
834	if (!head)	644	if (!head)
835	head = op;	645	head = op;
836		646
837	prev = op;	647	prev = op;
838	at = at->more;	648	at = (archetype *)at->more;
839	}	649	}
840		650
841	return (head);	651	return head;
842	}	652	}
843		653
		654	//-GPL
		655

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.37 by pippijn, Mon Jan 15 21:06:18 2007 UTC vs. Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.37 by pippijn, Mon Jan 15 21:06:18 2007 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC