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

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.111 by root, Mon Oct 29 23:55:52 2012 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.111 by root, Mon Oct 29 23:55:52 2012 UTC