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

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.93 by root, Fri Nov 6 12:27:05 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.93 by root, Fri Nov 6 12:27:05 2009 UTC