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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.50 by root, Mon Apr 16 13:02:28 2007 UTC vs.
Revision 1.110 by root, Tue Jan 3 11:25:30 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	*	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>
30		28
31	#include <tr1/functional>	29	#include <tr1/functional>
32	#include <tr1/unordered_map>	30	#include <tr1/unordered_map>
33		31
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	32	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
		33	arch_ptr archetype::empty;
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
55	static std::vector<archetype *> 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	}
56		76
57	/**	77	/**
58	* GROS - This function retrieves an archetype given the name that appears	78	* GROS - This function retrieves an archetype given the name that appears
59	* during the game (for example, "writing pen" instead of "stylus").	79	* 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.	80	* It does not use the hashtable system, but browse the whole archlist each time.
…		…
68	archetype *	88	archetype *
69	find_archetype_by_object_name (const char *name)	89	find_archetype_by_object_name (const char *name)
70	{	90	{
71	shstr_cmp name_cmp (name);	91	shstr_cmp name_cmp (name);
72		92
73	for (archetype *at = first_archetype; at; at = at->next)	93	for_all_archetypes (at)
74	if (at->clone.name == name_cmp)	94	if (at->name == name_cmp)
75	return at;	95	return at;
76		96
77	return 0;	97	return 0;
78	}	98	}
79		99
…		…
85	archetype *	105	archetype *
86	find_archetype_by_object_type_name (int type, const char *name)	106	find_archetype_by_object_type_name (int type, const char *name)
87	{	107	{
88	shstr_cmp name_cmp (name);	108	shstr_cmp name_cmp (name);
89		109
90	for (archetype *at = first_archetype; at; at = at->next)	110	for_all_archetypes (at)
91	if (at->clone.name == name_cmp && at->clone.type == type)	111	if (at->name == name_cmp && at->type == type)
92	return at;	112	return at;
93		113
94	return 0;	114	return 0;
95	}	115	}
96		116
…		…
102	object *	122	object *
103	get_archetype_by_skill_name (const char *skill, int type)	123	get_archetype_by_skill_name (const char *skill, int type)
104	{	124	{
105	shstr_cmp skill_cmp (skill);	125	shstr_cmp skill_cmp (skill);
106		126
107	for (archetype *at = first_archetype; at; at = at->next)	127	for_all_archetypes (at)
108	if (at->clone.skill == skill_cmp && (type == -1 \|\| type == at->clone.type))	128	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
109	return arch_to_object (at);	129	return at->instance ();
110		130
111	return 0;	131	return 0;
112	}	132	}
113		133
114	/* similiar to above - this returns the first archetype	134	/* similiar to above - this returns the first archetype
…		…
119	* (eg, skills)	139	* (eg, skills)
120	*/	140	*/
121	archetype *	141	archetype *
122	get_archetype_by_type_subtype (int type, int subtype)	142	get_archetype_by_type_subtype (int type, int subtype)
123	{	143	{
124	for (archetype *at = first_archetype; at; at = at->next)	144	for_all_archetypes (at)
125	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))
126	return at;	146	return at;
127		147
128	return 0;	148	return 0;
129	}	149	}
130		150
…		…
135	* - name: The name we're searching for (ex: "writing pen");	155	* - name: The name we're searching for (ex: "writing pen");
136	* Return value:	156	* Return value:
137	* - a corresponding object if found; a singularity object if not found.	157	* - 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	158	* 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	159	* 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,	160	* doesn't allocate it each time - not that this function is used much,
141	* but it otherwise had a big memory leak.	161	* but it otherwise had a big memory leak.
142	*/	162	*/
143	object *	163	object *
144	get_archetype_by_object_name (const char *name)	164	get_archetype_by_object_name (const char *name)
145	{	165	{
146	char tmpname[MAX_BUF];	166	char tmpname[MAX_BUF];
147	int i;
148		167
149	assign (tmpname, name);	168	assign (tmpname, name);
150		169
151	for (i = strlen (tmpname); i > 0; i--)	170	for (int i = strlen (tmpname); i > 0; i--)
152	{	171	{
153	tmpname[i] = 0;	172	tmpname[i] = 0;
154		173
155	if (archetype *at = find_archetype_by_object_name (tmpname))	174	if (archetype *at = find_archetype_by_object_name (tmpname))
156	return arch_to_object (at);	175	return at->instance ();
157	}	176	}
158		177
159	return create_singularity (name);	178	return create_singularity (name);
160	}	179	}
161		180
162	/* 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
163	* a string seperated lists of things to match, with certain keywords.	182	* a string seperated lists of things to match, with certain keywords.
164	* pl is the player (only needed to set count properly)	183	* pl is the player (only needed to set count properly)
165	* 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
166	* 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
167	* (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
168	* value means a better match. 0 means no match.	187	* value means a better match. 0 means no match.
169	*	188	*
170	* Brief outline of the procedure:	189	* Brief outline of the procedure:
171	* We take apart the name variable into the individual components.	190	* We take apart the name variable into the individual components.
172	* cases for 'all' and unpaid are pretty obvious.	191	* cases for 'all' and unpaid are pretty obvious.
173	* 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
174	* player object.)	193	* player object.)
175	* If count is 1, make a quick check on the name.	194	* 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.	195	* IF count is >1, we need to make plural name. Return if match.
177	* Last, make a check on the full name.	196	* Last, make a check on the full name.
178	*/	197	*/
179	int	198	int
180	item_matched_string (object pl, object op, const char *name)	199	item_matched_string (object pl, object op, const char *name)
181	{	200	{
182	char *cp, local_name[MAX_BUF];	201	char *cp, local_name[MAX_BUF];
183	int count, retval = 0;	202	int count, retval = 0;
…		…
193	/* All is a very generic match - low match value */	212	/* All is a very generic match - low match value */
194	if (!strcmp (cp, "all"))	213	if (!strcmp (cp, "all"))
195	return 1;	214	return 1;
196		215
197	/* unpaid is a little more specific */	216	/* unpaid is a little more specific */
198	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	217	if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID])
199	return 2;	218	return 2;
200	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]))
201	return 2;	221	return 2;
202		222
203	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	223	if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED])
204	return 2;	224	return 2;
205		225
206	/* Allow for things like '100 arrows' */	226	/* Allow for things like '100 arrows' */
207	if ((count = atoi (cp)) != 0)	227	if ((count = atoi (cp)) != 0)
208	{	228	{
…		…
226	* 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
227	* 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
228	* 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
229	* match first, and work downward.	249	* match first, and work downward.
230	*/	250	*/
		251	const char qbn0, qbn1, *qsn; // query base name/short name caches
		252
231	if (!strcasecmp (cp, query_name (op)))	253	if (!strcasecmp (cp, query_name (op)))
232	retval = 20;	254	retval = 20;
233	else if (!strcasecmp (cp, query_short_name (op)))	255	else if (!strcasecmp (cp, qsn = query_short_name (op)))
234	retval = 18;	256	retval = 18;
235	else if (!strcasecmp (cp, query_base_name (op, 0)))	257	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
236	retval = 16;	258	retval = 16;
237	else if (!strcasecmp (cp, query_base_name (op, 1)))	259	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
238	retval = 16;	260	retval = 16;
239	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	261	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
240	retval = 15;	262	retval = 15;
241	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	263	else if (!strncasecmp (cp, qbn0, strlen (cp)))
242	retval = 14;	264	retval = 14;
243	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	265	else if (!strncasecmp (cp, qbn1, strlen (cp)))
244	retval = 14;	266	retval = 14;
245	/* Do substring checks, so things like 'Str+1' will match.	267	/* Do substring checks, so things like 'Str+1' will match.
246	* retval of these should perhaps be lower - they are lower	268	* retval of these should perhaps be lower - they are lower
247	* then the specific strcasecmp aboves, but still higher than	269	* then the specific strcasecmp aboves, but still higher than
248	* some other match criteria.	270	* some other match criteria.
249	*/	271	*/
250	else if (strstr (query_base_name (op, 1), cp))	272	else if (strstr (qbn1, cp))
251	retval = 12;	273	retval = 12;
252	else if (strstr (query_base_name (op, 0), cp))	274	else if (strstr (qbn0, cp))
253	retval = 12;	275	retval = 12;
254	else if (strstr (query_short_name (op), cp))	276	else if (strstr (qsn, cp))
255	retval = 12;	277	retval = 12;
256	/* Check against plural/non plural based on count. */	278	/* Check against plural/non plural based on count. */
257	else if (count > 1 && !strcasecmp (cp, op->name_pl))	279	else if (count > 1 && !strcasecmp (cp, op->name_pl))
258	retval = 6;	280	retval = 6;
259	else if (count == 1 && !strcasecmp (op->name, cp))	281	else if (count == 1 && !strcasecmp (op->name, cp))
260	retval = 6;	282	retval = 6;
261	/* base name matched - not bad */	283	/* base name matched - not bad */
262	else if (strcasecmp (cp, op->name) == 0 && !count)	284	else if (strcasecmp (cp, op->name) == 0 && !count)
263	retval = 4;	285	retval = 4;
264	/* Check for partial custom name, but give a real low priority */	286	/* Check for partial custom name, but give a real low priority */
265	else if (op->custom_name && strstr (op->custom_name, cp))	287	else if (op->custom_name.contains (cp))
266	retval = 3;	288	retval = 3;
267		289
268	if (retval)	290	if (retval)
269	{	291	{
270	if (pl->type == PLAYER)	292	if (pl->type == PLAYER)
…		…
275	}	297	}
276		298
277	return 0;	299	return 0;
278	}	300	}
279		301
280	archetype::archetype ()	302	//-GPL
		303
		304	void
		305	archetype::do_delete ()
281	{	306	{
		307	delete this;
		308	}
		309
		310	archetype::archetype (const char *name)
		311	{
282	clone.arch = this;	312	arch = this;
283		313	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	}	314	}
287		315
288	archetype::~archetype ()	316	archetype::~archetype ()
289	{	317	{
290	//TODO: nuke ->more's	318	unlink ();
291	}	319	}
292		320
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	321	void
311	overwrite (archetype at, object op)	322	archetype::link ()
312	{	323	{
313	at->clone = *op;	324	if (!archetypes.contains (this))
314
315	at->clone.arch = at;
316	at->clone.inv = op->inv; op->inv = 0;
317
318	op->destroy ();
319	}
320
321	bool
322	archetype::load (object_thawer &f)
323	{
324	assert (f.kw == KW_object);
325
326	typedef std::pair<archetype , object > part;
327	std::vector<part> parts;
328
329	for (;;)
330	{
331	archetype *at = get (f.get_str ());
332	object *op = object::create ();
333
334	if (!op->parse_kv (f))
335	goto fail;
336
337	parts.push_back (std::make_pair (at, op));
338
339	if (f.kw != KW_more)
340	break;
341
342	f.next ();
343	assert (f.kw == KW_object);
344	}
345
346	{
347	archetype *head = parts.front ().first;
348
349	// check that all archetypes belong to the same object or are heads
350	for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)
351	{	325	{
352	archetype *at = p->first;	326	archetypes.insert (this);
353		327	ht.insert (std::make_pair (archname, this));
354	if (at->head != head && at->head)
355	{
356	LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
357	goto fail;
358	}
359
360	if (at->next && at != head)
361	{
362	LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
363	goto fail;
364	}
365	}	328	}
		329	}
366		330
367	// sever chain of existing head object	331	void
368	for (archetype more, at = head; at; at = more)	332	archetype::unlink ()
		333	{
		334	if (archetypes.contains (this))
369	{	335	{
370	more = at->more;	336	archetypes.erase (this);
371		337	ht.erase (archname);
372	at->head = 0;
373	at->more = 0;
374	}	338	}
375
376	// replace/update head
377	overwrite (head, parts.front ().second);
378	head->tail_x = 0;
379	head->tail_y = 0;
380
381	// link into list of heads, if not already there
382	if (!head->linked)
383	{
384	head->linked = true;
385	head->next = first_archetype;
386	first_archetype = head;
387	}
388
389	// reassemble new chain
390	archetype *prev = head;
391	for (AUTODECL (p, parts.begin () + 1); p != parts.end (); ++p)
392	{
393	archetype *at = p->first;
394	overwrite (at, p->second);
395
396	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
397	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
398
399	at->head = head;
400	at->clone.head = &head->clone;
401	prev->more = at;
402	prev->clone.more = &at->clone;
403
404	prev = at;
405	}
406	}
407
408	return true;
409
410	fail:
411	for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)
412	p->second->destroy (true);
413
414	return false;
415	}
416
417	/*
418	* Reads/parses the archetype-file, and copies into a linked list
419	* of archetype-structures.
420	*/
421	static bool
422	load_archetypes (object_thawer &f)
423	{
424	for (;;)
425	{
426	switch (f.kw)
427	{
428	case KW_object:
429	loading_arch = true;
430	if (!archetype::load (f))
431	{
432	loading_arch = false;
433	return false;
434	}
435
436	loading_arch = false;
437	continue;
438
439	case KW_EOF:
440	return true;
441
442	default:
443	if (!f.parse_error ("archetypes file"))
444	return false;
445	}
446
447	f.next ();
448	}
449	}
450
451	/*
452	* First initialises the archtype hash-table (init_archetable()).
453	* Reads and parses the archetype file (with the first and second-pass
454	* functions).
455	*/
456	bool
457	load_archetype_file (const char *filename)
458	{
459	object_thawer f (filename);
460
461	f.next ();
462
463	// make sure the next - long - step is only done after a tick
464	coroapi::wait_for_tick_begin ();
465
466	if (!load_archetypes (f))
467	return false;
468
469	warn_archetypes = 1;
470
471	empty_archetype = archetype::find ("empty_archetype");
472	if (!empty_archetype)
473	return false;
474
475	coroapi::cede ();
476
477	return true;
478	}
479
480	/*
481	* Creates and returns a new object which is a copy of the given archetype.
482	* This function returns NULL on failure.
483	*/
484	object *
485	arch_to_object (archetype *at)
486	{
487	if (!at)
488	{
489	if (warn_archetypes)
490	LOG (llevError, "Couldn't find archetype.\n");
491
492	return NULL;
493	}
494
495	object *op = at->clone.clone ();
496	op->arch = at;
497	op->instantiate ();
498	return op;
499	}
500
501	/*
502	* Creates an object. This function is called by get_archetype()
503	* if it fails to find the appropriate archetype.
504	* Thus get_archetype() will be guaranteed to always return
505	* an object, and never NULL.
506	*/
507	object *
508	create_singularity (const char *name)
509	{
510	object *op;
511	char buf[MAX_BUF];
512
513	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
514	op = object::create ();
515	op->name = op->name_pl = buf;
516	SET_FLAG (op, FLAG_NO_PICK);
517	return op;
518	}
519
520	/*
521	* Finds which archetype matches the given name, and returns a new
522	* object containing a copy of the archetype.
523	*/
524	object *
525	get_archetype (const char *name)
526	{
527	archetype *at = archetype::find (name);
528
529	if (!at)
530	return create_singularity (name);
531
532	return arch_to_object (at);
533	}	339	}
534		340
535	/*	341	/*
536	* Finds, using the hashtable, which archetype matches the given name.	342	* Finds, using the hashtable, which archetype matches the given name.
537	* returns a pointer to the found archetype, otherwise NULL.	343	* returns a pointer to the found archetype, otherwise NULL.
…		…
540	archetype::find (const char *name)	346	archetype::find (const char *name)
541	{	347	{
542	if (!name)	348	if (!name)
543	return 0;	349	return 0;
544		350
545	AUTODECL (i, ht.find (name));	351	auto (i, ht.find (name));
546		352
547	if (i == ht.end ())	353	if (i == ht.end ())
548	return 0;	354	return 0;
549	else	355	else
550	return i->second;	356	return i->second;
551	}	357	}
552		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
553	archetype *	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
		584	/*
		585	* Finds which archetype matches the given name, and returns a new
		586	* object containing a copy of the archetype.
		587	*/
		588	object *
554	archetype::get (const char *name)	589	archetype::get (const char *name)
555	{	590	{
556	archetype *at = find (name);	591	archetype *at = find (name);
557		592
558	if (!at)	593	if (!at)
559	{	594	return create_singularity (name);
560	archetypes.push_back (at = new archetype);
561	at->name = name;
562	at->hash_add ();
563	}
564		595
565	return at;	596	return at->instance ();
566	}
567
568	/*
569	* Adds an archetype to the hashtable.
570	*/
571	void
572	archetype::hash_add ()
573	{
574	ht.insert (std::make_pair (name, this));
575	}
576
577	void
578	archetype::hash_del ()
579	{
580	ht.erase (name);
581	}	597	}
582		598
583	/*	599	/*
584	* Returns the first archetype using the given type.	600	* Returns the first archetype using the given type.
585	* Used in treasure-generation.	601	* Used in treasure-generation.
586	*/	602	*/
587	archetype *	603	static archetype *
588	type_to_archetype (int type)	604	type_to_archetype (int type)
589	{	605	{
590	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	606	for_all_archetypes (at)
591	if (at->clone.type == type)	607	if (at->type == type && at->head_ () != at)
592	return at;	608	return at;
593		609
594	return 0;	610	return 0;
595	}	611	}
596		612
…		…
600	* Used in treasure-generation.	616	* Used in treasure-generation.
601	*/	617	*/
602	object *	618	object *
603	clone_arch (int type)	619	clone_arch (int type)
604	{	620	{
605	archetype *at;	621	archetype *at = type_to_archetype (type);
606		622
607	if ((at = type_to_archetype (type)) == NULL)	623	if (!at)
608	{	624	{
609	LOG (llevError, "Can't clone archetype %d\n", type);	625	LOG (llevError, "Can't clone archetype %d\n", type);
610	return 0;	626	return 0;
611	}	627	}
612		628
613	object *op = at->clone.clone ();	629	return at->instance ();
614	op->instantiate ();
615	return op;
616	}	630	}
617		631
618	/*	632	/*
619	* member: make instance from class	633	* member: make instance from class
620	*/	634	*/
621
622	object *	635	object *
623	object_create_arch (archetype *at)	636	object_create_arch (archetype *at)
624	{	637	{
625	object op, prev = 0, *head = 0;	638	object op, prev = 0, *head = 0;
626		639
627	while (at)	640	while (at)
628	{	641	{
629	op = arch_to_object (at);	642	op = at->instance ();
		643
630	op->x = at->clone.x;	644	op->x = at->x;
631	op->y = at->clone.y;	645	op->y = at->y;
632		646
633	if (head)	647	if (head)
634	op->head = head, prev->more = op;	648	op->head = head, prev->more = op;
635		649
636	if (!head)	650	if (!head)
637	head = op;	651	head = op;
638		652
639	prev = op;	653	prev = op;
640	at = at->more;	654	at = (archetype *)at->more;
641	}	655	}
642		656
643	return (head);	657	return head;
644	}	658	}
645		659
		660	//-GPL
		661

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.50 by root, Mon Apr 16 13:02:28 2007 UTC vs. Revision 1.110 by root, Tue Jan 3 11:25:30 2012 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.50 by root, Mon Apr 16 13:02:28 2007 UTC vs.
Revision 1.110 by root, Tue Jan 3 11:25:30 2012 UTC