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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.48 by root, Mon Apr 16 11:09:30 2007 UTC vs.
Revision 1.97 by root, Sun Nov 8 22:28:10 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	/* The naming of these functions is really poor - they are all
35	* pretty much named '.._arch_...', but they may more may not
36	* return archetypes. Some make the arch_to_object call, and thus
37	* return an object. Perhaps those should be called 'archob' functions
38	* to denote they return an object derived from the archetype.
39	* MSW 2003-04-29
40	*/
41
42	bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing	33	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
		34	arch_ptr archetype::empty;
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
55	static std::vector<archetype *> 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	static 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	}
56		77
57	/**	78	/**
58	* GROS - This function retrieves an archetype given the name that appears	79	* GROS - This function retrieves an archetype given the name that appears
59	* during the game (for example, "writing pen" instead of "stylus").	80	* during the game (for example, "writing pen" instead of "stylus").
60	* 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.
…		…
68	archetype *	89	archetype *
69	find_archetype_by_object_name (const char *name)	90	find_archetype_by_object_name (const char *name)
70	{	91	{
71	shstr_cmp name_cmp (name);	92	shstr_cmp name_cmp (name);
72		93
73	for (archetype *at = first_archetype; at; at = at->next)	94	for_all_archetypes (at)
74	if (at->clone.name == name_cmp)	95	if (at->name == name_cmp)
75	return at;	96	return at;
76		97
77	return 0;	98	return 0;
78	}	99	}
79		100
…		…
85	archetype *	106	archetype *
86	find_archetype_by_object_type_name (int type, const char *name)	107	find_archetype_by_object_type_name (int type, const char *name)
87	{	108	{
88	shstr_cmp name_cmp (name);	109	shstr_cmp name_cmp (name);
89		110
90	for (archetype *at = first_archetype; at; at = at->next)	111	for_all_archetypes (at)
91	if (at->clone.name == name_cmp && at->clone.type == type)	112	if (at->name == name_cmp && at->type == type)
92	return at;	113	return at;
93		114
94	return 0;	115	return 0;
95	}	116	}
96		117
…		…
102	object *	123	object *
103	get_archetype_by_skill_name (const char *skill, int type)	124	get_archetype_by_skill_name (const char *skill, int type)
104	{	125	{
105	shstr_cmp skill_cmp (skill);	126	shstr_cmp skill_cmp (skill);
106		127
107	for (archetype *at = first_archetype; at; at = at->next)	128	for_all_archetypes (at)
108	if (at->clone.skill == skill_cmp && (type == -1 \|\| type == at->clone.type))	129	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
109	return arch_to_object (at);	130	return at->instance ();
110		131
111	return 0;	132	return 0;
112	}	133	}
113		134
114	/* similiar to above - this returns the first archetype	135	/* similiar to above - this returns the first archetype
…		…
119	* (eg, skills)	140	* (eg, skills)
120	*/	141	*/
121	archetype *	142	archetype *
122	get_archetype_by_type_subtype (int type, int subtype)	143	get_archetype_by_type_subtype (int type, int subtype)
123	{	144	{
124	for (archetype *at = first_archetype; at; at = at->next)	145	for_all_archetypes (at)
125	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))
126	return at;	147	return at;
127		148
128	return 0;	149	return 0;
129	}	150	}
130		151
…		…
135	* - name: The name we're searching for (ex: "writing pen");	156	* - name: The name we're searching for (ex: "writing pen");
136	* Return value:	157	* Return value:
137	* - a corresponding object if found; a singularity object if not found.	158	* - a corresponding object if found; a singularity object if not found.
138	* 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
139	* 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
140	* 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,
141	* but it otherwise had a big memory leak.	162	* but it otherwise had a big memory leak.
142	*/	163	*/
143	object *	164	object *
144	get_archetype_by_object_name (const char *name)	165	get_archetype_by_object_name (const char *name)
145	{	166	{
146	char tmpname[MAX_BUF];	167	char tmpname[MAX_BUF];
147	int i;
148		168
149	assign (tmpname, name);	169	assign (tmpname, name);
150		170
151	for (i = strlen (tmpname); i > 0; i--)	171	for (int i = strlen (tmpname); i > 0; i--)
152	{	172	{
153	tmpname[i] = 0;	173	tmpname[i] = 0;
154		174
155	if (archetype *at = find_archetype_by_object_name (tmpname))	175	if (archetype *at = find_archetype_by_object_name (tmpname))
156	return arch_to_object (at);	176	return at->instance ();
157	}	177	}
158		178
159	return create_singularity (name);	179	return create_singularity (name);
160	}	180	}
161		181
162	/* 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
163	* a string seperated lists of things to match, with certain keywords.	183	* a string seperated lists of things to match, with certain keywords.
164	* pl is the player (only needed to set count properly)	184	* pl is the player (only needed to set count properly)
165	* 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
166	* 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
167	* (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
168	* value means a better match. 0 means no match.	188	* value means a better match. 0 means no match.
169	*	189	*
170	* Brief outline of the procedure:	190	* Brief outline of the procedure:
171	* We take apart the name variable into the individual components.	191	* We take apart the name variable into the individual components.
172	* cases for 'all' and unpaid are pretty obvious.	192	* cases for 'all' and unpaid are pretty obvious.
173	* 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
174	* player object.)	194	* player object.)
175	* If count is 1, make a quick check on the name.	195	* If count is 1, make a quick check on the name.
176	* 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.
177	* Last, make a check on the full name.	197	* Last, make a check on the full name.
178	*/	198	*/
179	int	199	int
180	item_matched_string (object pl, object op, const char *name)	200	item_matched_string (object pl, object op, const char *name)
181	{	201	{
182	char *cp, local_name[MAX_BUF];	202	char *cp, local_name[MAX_BUF];
183	int count, retval = 0;	203	int count, retval = 0;
…		…
195	return 1;	215	return 1;
196		216
197	/* unpaid is a little more specific */	217	/* unpaid is a little more specific */
198	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	218	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
199	return 2;	219	return 2;
		220
200	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)))
201	return 2;	222	return 2;
202		223
203	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	224	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
204	return 2;	225	return 2;
…		…
226	* 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
227	* 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
228	* 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
229	* match first, and work downward.	250	* match first, and work downward.
230	*/	251	*/
		252	const char qbn0, qbn1, *qsn; // query base name/short name caches
		253
231	if (!strcasecmp (cp, query_name (op)))	254	if (!strcasecmp (cp, query_name (op)))
232	retval = 20;	255	retval = 20;
233	else if (!strcasecmp (cp, query_short_name (op)))	256	else if (!strcasecmp (cp, qsn = query_short_name (op)))
234	retval = 18;	257	retval = 18;
235	else if (!strcasecmp (cp, query_base_name (op, 0)))	258	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
236	retval = 16;	259	retval = 16;
237	else if (!strcasecmp (cp, query_base_name (op, 1)))	260	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
238	retval = 16;	261	retval = 16;
239	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	262	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
240	retval = 15;	263	retval = 15;
241	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	264	else if (!strncasecmp (cp, qbn0, strlen (cp)))
242	retval = 14;	265	retval = 14;
243	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	266	else if (!strncasecmp (cp, qbn1, strlen (cp)))
244	retval = 14;	267	retval = 14;
245	/* Do substring checks, so things like 'Str+1' will match.	268	/* Do substring checks, so things like 'Str+1' will match.
246	* retval of these should perhaps be lower - they are lower	269	* retval of these should perhaps be lower - they are lower
247	* then the specific strcasecmp aboves, but still higher than	270	* then the specific strcasecmp aboves, but still higher than
248	* some other match criteria.	271	* some other match criteria.
249	*/	272	*/
250	else if (strstr (query_base_name (op, 1), cp))	273	else if (strstr (qbn1, cp))
251	retval = 12;	274	retval = 12;
252	else if (strstr (query_base_name (op, 0), cp))	275	else if (strstr (qbn0, cp))
253	retval = 12;	276	retval = 12;
254	else if (strstr (query_short_name (op), cp))	277	else if (strstr (qsn, cp))
255	retval = 12;	278	retval = 12;
256	/* Check against plural/non plural based on count. */	279	/* Check against plural/non plural based on count. */
257	else if (count > 1 && !strcasecmp (cp, op->name_pl))	280	else if (count > 1 && !strcasecmp (cp, op->name_pl))
258	retval = 6;	281	retval = 6;
259	else if (count == 1 && !strcasecmp (op->name, cp))	282	else if (count == 1 && !strcasecmp (op->name, cp))
260	retval = 6;	283	retval = 6;
261	/* base name matched - not bad */	284	/* base name matched - not bad */
262	else if (strcasecmp (cp, op->name) == 0 && !count)	285	else if (strcasecmp (cp, op->name) == 0 && !count)
263	retval = 4;	286	retval = 4;
264	/* Check for partial custom name, but give a real low priority */	287	/* Check for partial custom name, but give a real low priority */
265	else if (op->custom_name && strstr (op->custom_name, cp))	288	else if (op->custom_name.contains (cp))
266	retval = 3;	289	retval = 3;
267		290
268	if (retval)	291	if (retval)
269	{	292	{
270	if (pl->type == PLAYER)	293	if (pl->type == PLAYER)
…		…
275	}	298	}
276		299
277	return 0;	300	return 0;
278	}	301	}
279		302
280	archetype::archetype ()	303	//-GPL
		304
		305	archetype::archetype (const char *name)
281	{	306	{
282	clone.arch = this;	307	arch = this;
283		308	this->archname = this->name = this->name_pl = name;
284	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
285	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
286	}	309	}
287		310
288	archetype::~archetype ()	311	archetype::~archetype ()
289	{	312	{
290	//TODO: nuke ->more's	313	unlink ();
291	}	314	}
292		315
293	static void
294	unlink (archetype *at)
295	{
296	if (at->head)
297	at = at->head;
298
299	// destroy this archetype's link, making singletons out of its parts
300	while (at)
301	{
302	archetype *more = at->more;
303	at->clone.destroy_inv ();
304	at->head = at->more = 0;
305	at = more;
306	}
307	}
308
309	// dire hack, need to rationalise
310	void	316	void
311	overwrite (archetype at, object op)	317	archetype::link ()
312	{	318	{
313	at->clone = *op;	319	if (!archetypes.contains (this))
314
315	at->clone.arch = at;
316	//TODO: inv et al.
317	}
318
319	archetype *
320	archetype::read (object_thawer &f)
321	{
322	assert (f.kw == KW_object);
323
324	archetype *head = get (f.get_str ());
325	unlink (head);
326	object *op = object::create ();
327
328	if (!op->parse_kv (f))
329	{
330	op->destroy (true);
331	// leak head
332	return 0;
333	}	320	{
334		321	archetypes.insert (this);
335	overwrite (head, op);	322	ht.insert (std::make_pair (archname, this));
336	op->destroy ();
337
338	for (archetype *prev = head; f.kw == KW_more; )
339	{	323	}
340	f.next ();	324	}
341	assert (f.kw == KW_object);
342		325
343	archetype *more = get (f.get_str ());	326	void
344	unlink (more);	327	archetype::unlink ()
345	object *op = object::create ();	328	{
346		329	if (archetypes.contains (this))
347	if (!op->parse_kv (f))
348	{
349	op->destroy (true);
350	// leak head more*
351	return 0;
352	}
353
354	overwrite (more, op);
355	op->destroy ();
356
357	if (more->clone.x > head->tail_x) head->tail_x = more->clone.x;
358	if (more->clone.y > head->tail_y) head->tail_y = more->clone.y;
359
360	more->head = head;
361	more->clone.head = &head->clone;
362	prev->more = more;
363	prev->clone.more = &more->clone;
364
365	prev = more;
366	}	330	{
367		331	archetypes.erase (this);
368	if (!head->next)	332	ht.erase (archname);
369	{	333	}
370	head->next = first_archetype;
371	first_archetype = head;
372	}
373
374	return head;
375	}
376
377	/*
378	* Reads/parses the archetype-file, and copies into a linked list
379	* of archetype-structures.
380	*/
381	static bool
382	load_archetypes (object_thawer &f)
383	{
384	for (;;)
385	{
386	switch (f.kw)
387	{
388	case KW_object:
389	loading_arch = true;
390	if (!archetype::read (f))
391	{
392	loading_arch = false;
393	return false;
394	}
395
396	loading_arch = false;
397	continue;
398
399	case KW_EOF:
400	return true;
401
402	default:
403	if (!f.parse_error ("archetypes file"))
404	return false;
405	}
406
407	f.next ();
408	}
409	}
410
411	/*
412	* First initialises the archtype hash-table (init_archetable()).
413	* Reads and parses the archetype file (with the first and second-pass
414	* functions).
415	*/
416	bool
417	load_archetype_file (const char *filename)
418	{
419	object_thawer f (filename);
420
421	f.next ();
422
423	// make sure the next - long - step is only done after a tick
424	coroapi::wait_for_tick_begin ();
425
426	if (!load_archetypes (f))
427	return false;
428
429	warn_archetypes = 1;
430
431	empty_archetype = archetype::find ("empty_archetype");
432	if (!empty_archetype)
433	return false;
434
435	coroapi::cede ();
436
437	return true;
438	}
439
440	/*
441	* Creates and returns a new object which is a copy of the given archetype.
442	* This function returns NULL on failure.
443	*/
444	object *
445	arch_to_object (archetype *at)
446	{
447	if (!at)
448	{
449	if (warn_archetypes)
450	LOG (llevError, "Couldn't find archetype.\n");
451
452	return NULL;
453	}
454
455	object *op = at->clone.clone ();
456	op->arch = at;
457	op->instantiate ();
458	return op;
459	}
460
461	/*
462	* Creates an object. This function is called by get_archetype()
463	* if it fails to find the appropriate archetype.
464	* Thus get_archetype() will be guaranteed to always return
465	* an object, and never NULL.
466	*/
467	object *
468	create_singularity (const char *name)
469	{
470	object *op;
471	char buf[MAX_BUF];
472
473	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
474	op = object::create ();
475	op->name = op->name_pl = buf;
476	SET_FLAG (op, FLAG_NO_PICK);
477	return op;
478	}
479
480	/*
481	* Finds which archetype matches the given name, and returns a new
482	* object containing a copy of the archetype.
483	*/
484	object *
485	get_archetype (const char *name)
486	{
487	archetype *at = archetype::find (name);
488
489	if (!at)
490	return create_singularity (name);
491
492	return arch_to_object (at);
493	}
494
495	/*
496	* Hash-function used by the arch-hashtable.
497	*/
498
499	unsigned long
500	hasharch (const char *str, int tablesize)
501	{
502	unsigned long hash = 0;
503	unsigned int i = 0;
504	const char *p;
505
506	/* use the one-at-a-time hash function, which supposedly is
507	* better than the djb2-like one used by perl5.005, but
508	* certainly is better then the bug used here before.
509	* see http://burtleburtle.net/bob/hash/doobs.html
510	*/
511	for (p = str; i < MAXSTRING && *p; p++, i++)
512	{
513	hash += *p;
514	hash += hash << 10;
515	hash ^= hash >> 6;
516	}
517
518	hash += hash << 3;
519	hash ^= hash >> 11;
520	hash += hash << 15;
521
522	return hash % tablesize;
523	}	334	}
524		335
525	/*	336	/*
526	* Finds, using the hashtable, which archetype matches the given name.	337	* Finds, using the hashtable, which archetype matches the given name.
527	* returns a pointer to the found archetype, otherwise NULL.	338	* returns a pointer to the found archetype, otherwise NULL.
…		…
530	archetype::find (const char *name)	341	archetype::find (const char *name)
531	{	342	{
532	if (!name)	343	if (!name)
533	return 0;	344	return 0;
534		345
535	AUTODECL (i, ht.find (name));	346	auto (i, ht.find (name));
536		347
537	if (i == ht.end ())	348	if (i == ht.end ())
538	return 0;	349	return 0;
539	else	350	else
540	return i->second;	351	return i->second;
541	}	352	}
542		353
		354	void
		355	archetype::post_load_check ()
		356	{
		357	object::post_load_check ();
		358
		359	assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
		360	}
		361
543	archetype *	362	archetype *
		363	archetype::read (object_thawer &f)
		364	{
		365	assert (f.kw == KW_object);
		366
		367	std::vector<archetype *> parts;
		368
		369	coroapi::cede_to_tick ();
		370
		371	for (;;)
		372	{
		373	archetype *at = new archetype (f.get_str ());
		374
		375	f.next ();
		376
		377	#if 0
		378	// implementing it here in the server does neither allow multiple inheritence
		379	// nor does it cleanly "just override". it would allow use in map files, though,
		380	// and other resource files dynamically laoded (as opposed to being preprocessed).
		381	// not that any of this is relevant as of yet...
		382	if (f.kw == KW_inherit)
		383	{
		384	if (archetype *at = find (f.get_str ()))
		385	*op = at->clone;
		386	else
		387	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		388	&at->archname, f.get_str ());
		389
		390	f.next ();
		391	}
		392	#endif
		393
		394	loading_arch = at; // hack to tell parse_kv et al. to behave
		395	bool parse_ok = at->parse_kv (f);
		396	loading_arch = 0;
		397
		398	if (!parse_ok)
		399	goto fail;
		400
		401	loading_arch = at; // hack to tell parse_kv et al. to behave
		402	at->post_load_check ();
		403	loading_arch = 0;
		404
		405	parts.push_back (at);
		406
		407	if (f.kw != KW_more)
		408	break;
		409
		410	f.next ();
		411
		412	if (f.kw != KW_object)
		413	{
		414	f.parse_error ("more object");
		415	goto fail;
		416	}
		417	}
		418
		419	{
		420	auto (at, parts.begin ());
		421
		422	archetype *new_head = parts.front ();
		423	archetype *old_head = find (new_head->archname);
		424
		425	if (old_head && !old_head->is_head ())
		426	{
		427	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		428	&new_head->archname, &old_head->archname);
		429	goto fail;
		430	}
		431
		432	// check that all archetypes belong to the same old object or are new
		433	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		434	{
		435	archetype new_part = at;
		436	archetype *old_part = find (new_part->archname);
		437
		438	if (old_part && old_part->head_ () != old_head)
		439	{
		440	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		441	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		442	goto fail;
		443	}
		444	}
		445
		446	// assemble new chain
		447	new_head->min_x = new_head->max_x = new_head->x;
		448	new_head->min_y = new_head->max_y = new_head->y;
		449
		450	archetype *less = new_head;
		451	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		452	{
		453	archetype at = p;
		454
		455	// some flags get inherited from the head (probably a lot more)
		456	// doing it here doesn't feel too cozy, but it allows code
		457	// to ignore head checks for these flags, which saves time
		458	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		459	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		460	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		461	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		462
		463	new_head->min_x = min (new_head->min_x, at->x);
		464	new_head->min_y = min (new_head->min_y, at->y);
		465	new_head->max_x = max (new_head->max_x, at->x);
		466	new_head->max_y = max (new_head->max_y, at->y);
		467
		468	at->head = new_head;
		469	less->more = at;
		470	less = at;
		471	}
		472
		473	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
		474
		475	return new_head;
		476	}
		477
		478	fail:
		479	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		480	(*p)->destroy ();
		481
		482	return 0;
		483	}
		484
		485	void
		486	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
		487	{
		488	ref = 0;
		489	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
		490	}
		491
		492	void
		493	archetype::commit_load ()
		494	{
		495	// unlink old archetypes and link in new ones */
		496	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
		497	{
		498	archetype at = p;
		499
		500	if (archetype *old = find (at->archname))
		501	old->unlink ();
		502
		503	allarch.push_back (at);
		504
		505	at->link ();
		506	++dirtycnt;
		507	}
		508
		509	postponed_arch.clear ();
		510
		511	// now resolve arch references
		512	for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
		513	{
		514	arch_ptr *ap = p->first;
		515	archetype *at = find (p->second);
		516
		517	if (!at)
		518	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		519
		520	*ap = at;
		521	}
		522
		523	postponed_arch_ref.clear ();
		524
		525	empty = find (shstr_empty_archetype);
		526	}
		527
		528	void
		529	archetype::gc ()
		530	{
		531	int cnt = max (1, min (allarch.size () / 128, dirtycnt));
		532	dirtycnt = max (0, dirtycnt - cnt);
		533
		534	do
		535	{
		536	static int idx;
		537
		538	if (idx >= allarch.size ())
		539	if (idx)
		540	idx = 0;
		541	else
		542	return;
		543
		544	archetype *at = allarch [idx];
		545
		546	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
		547	++idx;
		548	else
		549	{
		550	LOG (llevDebug, "garbage collect arch %s", &at->archname);
		551	assert (at->arch == at); // verify that refcnt == 1 is truly valid
		552	allarch.erase (idx);
		553
		554	// break chain
		555	for (object *op = at->head_ (); op; )
		556	{
		557	object *next = op->more;
		558	op->head = 0;
		559	op->more = 0;
		560	op = next;
		561	}
		562
		563	at->destroy ();
		564	at->arch = 0;
		565	}
		566	}
		567	while (--cnt);
		568	}
		569
		570	object *
		571	archetype::instance ()
		572	{
		573	object *op = clone ();
		574	op->instantiate ();
		575	return op;
		576	}
		577
		578	//+GPL
		579
		580	/*
		581	* Finds which archetype matches the given name, and returns a new
		582	* object containing a copy of the archetype.
		583	*/
		584	object *
		585	get_archetype (const char *name)
		586	{
		587	return archetype::get (name);
		588	}
		589
		590	object *
544	archetype::get (const char *name)	591	archetype::get (const char *name)
545	{	592	{
546	archetype *at = find (name);	593	archetype *at = find (name);
547		594
548	if (!at)	595	if (!at)
549	{	596	return create_singularity (name);
550	archetypes.push_back (at = new archetype);
551	at->name = name;
552	at->hash_add ();
553	}
554		597
555	return at;	598	return at->instance ();
556	}
557
558	/*
559	* Adds an archetype to the hashtable.
560	*/
561	void
562	archetype::hash_add ()
563	{
564	ht.insert (std::make_pair (name, this));
565	}
566
567	void
568	archetype::hash_del ()
569	{
570	ht.erase (name);
571	}	599	}
572		600
573	/*	601	/*
574	* Returns the first archetype using the given type.	602	* Returns the first archetype using the given type.
575	* Used in treasure-generation.	603	* Used in treasure-generation.
576	*/	604	*/
577	archetype *	605	static archetype *
578	type_to_archetype (int type)	606	type_to_archetype (int type)
579	{	607	{
580	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	608	for_all_archetypes (at)
581	if (at->clone.type == type)	609	if (at->type == type && at->head_ () != at)
582	return at;	610	return at;
583		611
584	return 0;	612	return 0;
585	}	613	}
586		614
…		…
590	* Used in treasure-generation.	618	* Used in treasure-generation.
591	*/	619	*/
592	object *	620	object *
593	clone_arch (int type)	621	clone_arch (int type)
594	{	622	{
595	archetype *at;	623	archetype *at = type_to_archetype (type);
596		624
597	if ((at = type_to_archetype (type)) == NULL)	625	if (!at)
598	{	626	{
599	LOG (llevError, "Can't clone archetype %d\n", type);	627	LOG (llevError, "Can't clone archetype %d\n", type);
600	return 0;	628	return 0;
601	}	629	}
602		630
603	object *op = at->clone.clone ();	631	return at->instance ();
604	op->instantiate ();
605	return op;
606	}	632	}
607		633
608	/*	634	/*
609	* member: make instance from class	635	* member: make instance from class
610	*/	636	*/
611
612	object *	637	object *
613	object_create_arch (archetype *at)	638	object_create_arch (archetype *at)
614	{	639	{
615	object op, prev = 0, *head = 0;	640	object op, prev = 0, *head = 0;
616		641
617	while (at)	642	while (at)
618	{	643	{
619	op = arch_to_object (at);	644	op = at->instance ();
		645
620	op->x = at->clone.x;	646	op->x = at->x;
621	op->y = at->clone.y;	647	op->y = at->y;
622		648
623	if (head)	649	if (head)
624	op->head = head, prev->more = op;	650	op->head = head, prev->more = op;
625		651
626	if (!head)	652	if (!head)
627	head = op;	653	head = op;
628		654
629	prev = op;	655	prev = op;
630	at = at->more;	656	at = (archetype *)at->more;
631	}	657	}
632		658
633	return (head);	659	return head;
634	}	660	}
635		661
		662	//-GPL
		663

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.48 by root, Mon Apr 16 11:09:30 2007 UTC vs. Revision 1.97 by root, Sun Nov 8 22:28:10 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.48 by root, Mon Apr 16 11:09:30 2007 UTC vs.
Revision 1.97 by root, Sun Nov 8 22:28:10 2009 UTC