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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.38 by root, Fri Feb 2 21:50:43 2007 UTC vs. Revision 1.91 by root, Tue Oct 27 01:38:39 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.38 by root, Fri Feb 2 21:50:43 2007 UTC vs.
Revision 1.91 by root, Tue Oct 27 01:38:39 2009 UTC