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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.61 by root, Mon May 28 21:21:39 2007 UTC vs.
Revision 1.115 by root, Sat Nov 17 23:33:17 2018 UTC

…		…
1	/*	1	/*
2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT is free software; you can redistribute it and/or modify it	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* under the terms of the GNU General Public License as published by the Free	9	* the terms of the Affero GNU General Public License as published by the
10	* Software Foundation; either version 2 of the License, or (at your option)	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful, but	13	* This program is distributed in the hope that it will be useful,
14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* 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 along	18	* You should have received a copy of the Affero GNU General Public License
19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51	19	* and the GNU General Public License along with this program. If not, see
20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* The authors can be reached via e-mail to <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	#include <functional>
		27
		28	#include <flat_hash_map.hpp>
26		29
27	#include <global.h>	30	#include <global.h>
28	#include <funcpoint.h>
29	#include <loader.h>
30		31
31	#include <tr1/functional>
32	#include <tr1/unordered_map>
33
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 ska::flat_hash_map<
46	<
47	const char *,	37	const char *,
48	arch_ptr,	38	arch_ptr,
49	str_hash,	39	str_hash,
50	str_equal,	40	str_equal,
51	slice_allocator< std::pair<const char *const, arch_ptr> >	41	slice_allocator< std::pair<const char *const, arch_ptr> >
52	> HT;	42	> HT;
53		43
54	static HT ht (5000);	44	static HT ht (10000);
		45	archvec archetypes;
		46	static unordered_vector<archetype *> allarch;
		47	static int dirtycnt;
		48
		49	// the vector of other_arch references to be resolved
		50	static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
		51	// the vector of loaded but not yet committed archetypes
55	static std::vector<archetype *> archetypes;	52	static std::vector<archetype *> postponed_arch;
		53
		54	//+GPL
		55
		56	/*
		57	* Creates an object. This function is called by archetype::get ()
		58	* if it fails to find the appropriate archetype.
		59	* Thus archetype::get() will be guaranteed to always return
		60	* an object, and never NULL.
		61	*/
		62	static object *
		63	create_singularity (const char *name)
		64	{
		65	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
		66
		67	if (!strcmp (name, "bug"))
		68	abort ();
		69
		70	object *op = archetype::get (shstr_bug);
		71	op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
		72
		73	return op;
		74	}
56		75
57	/**	76	/**
58	* GROS - This function retrieves an archetype given the name that appears	77	* GROS - This function retrieves an archetype given the name that appears
59	* during the game (for example, "writing pen" instead of "stylus").	78	* 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.	79	* It does not use the hashtable system, but browse the whole archlist each time.
68	archetype *	87	archetype *
69	find_archetype_by_object_name (const char *name)	88	find_archetype_by_object_name (const char *name)
70	{	89	{
71	shstr_cmp name_cmp (name);	90	shstr_cmp name_cmp (name);
72		91
73	for (archetype *at = first_archetype; at; at = at->next)	92	for_all_archetypes (at)
74	if (at->clone.name == name_cmp)	93	if (at->name == name_cmp)
75	return at;	94	return at;
76		95
77	return 0;	96	return 0;
78	}	97	}
79		98
…		…
85	archetype *	104	archetype *
86	find_archetype_by_object_type_name (int type, const char *name)	105	find_archetype_by_object_type_name (int type, const char *name)
87	{	106	{
88	shstr_cmp name_cmp (name);	107	shstr_cmp name_cmp (name);
89		108
90	for (archetype *at = first_archetype; at; at = at->next)	109	for_all_archetypes (at)
91	if (at->clone.name == name_cmp && at->clone.type == type)	110	if (at->name == name_cmp && at->type == type)
92	return at;	111	return at;
93		112
94	return 0;	113	return 0;
95	}	114	}
96		115
…		…
102	object *	121	object *
103	get_archetype_by_skill_name (const char *skill, int type)	122	get_archetype_by_skill_name (const char *skill, int type)
104	{	123	{
105	shstr_cmp skill_cmp (skill);	124	shstr_cmp skill_cmp (skill);
106		125
107	for (archetype *at = first_archetype; at; at = at->next)	126	for_all_archetypes (at)
108	if (at->clone.skill == skill_cmp && (type == -1 \|\| type == at->clone.type))	127	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
109	return arch_to_object (at);	128	return at->instance ();
110		129
111	return 0;	130	return 0;
112	}	131	}
113		132
114	/* similiar to above - this returns the first archetype	133	/* similiar to above - this returns the first archetype
…		…
119	* (eg, skills)	138	* (eg, skills)
120	*/	139	*/
121	archetype *	140	archetype *
122	get_archetype_by_type_subtype (int type, int subtype)	141	get_archetype_by_type_subtype (int type, int subtype)
123	{	142	{
124	for (archetype *at = first_archetype; at; at = at->next)	143	for_all_archetypes (at)
125	if ((type == -1 \|\| type == at->clone.type) && (subtype == -1 \|\| subtype == at->clone.subtype))	144	if ((type == -1 \|\| type == at->type) && (subtype == -1 \|\| subtype == at->subtype))
126	return at;	145	return at;
127		146
128	return 0;	147	return 0;
129	}	148	}
130		149
…		…
135	* - name: The name we're searching for (ex: "writing pen");	154	* - name: The name we're searching for (ex: "writing pen");
136	* Return value:	155	* Return value:
137	* - a corresponding object if found; a singularity object if not found.	156	* - 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	157	* 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	158	* 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,	159	* doesn't allocate it each time - not that this function is used much,
141	* but it otherwise had a big memory leak.	160	* but it otherwise had a big memory leak.
142	*/	161	*/
143	object *	162	object *
144	get_archetype_by_object_name (const char *name)	163	get_archetype_by_object_name (const char *name)
145	{	164	{
146	char tmpname[MAX_BUF];	165	char tmpname[MAX_BUF];
147	int i;
148		166
149	assign (tmpname, name);	167	assign (tmpname, name);
150		168
151	for (i = strlen (tmpname); i > 0; i--)	169	for (int i = strlen (tmpname); i > 0; i--)
152	{	170	{
153	tmpname[i] = 0;	171	tmpname[i] = 0;
154		172
155	if (archetype *at = find_archetype_by_object_name (tmpname))	173	if (archetype *at = find_archetype_by_object_name (tmpname))
156	return arch_to_object (at);	174	return at->instance ();
157	}	175	}
158		176
159	return create_singularity (name);	177	return create_singularity (name);
160	}	178	}
161		179
162	/* This is a subset of the parse_id command. Basically, name can be	180	/* 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.	181	* a string seperated lists of things to match, with certain keywords.
164	* pl is the player (only needed to set count properly)	182	* pl is the player (only needed to set count properly)
165	* op is the item we are trying to match. Calling function takes care	183	* 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	184	* 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	185	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
168	* value means a better match. 0 means no match.	186	* value means a better match. 0 means no match.
169	*	187	*
170	* Brief outline of the procedure:	188	* Brief outline of the procedure:
171	* We take apart the name variable into the individual components.	189	* We take apart the name variable into the individual components.
172	* cases for 'all' and unpaid are pretty obvious.	190	* cases for 'all' and unpaid are pretty obvious.
173	* Next, we check for a count (either specified in name, or in the	191	* Next, we check for a count (either specified in name, or in the
174	* player object.)	192	* player object.)
175	* If count is 1, make a quick check on the name.	193	* 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.	194	* IF count is >1, we need to make plural name. Return if match.
177	* Last, make a check on the full name.	195	* Last, make a check on the full name.
178	*/	196	*/
179	int	197	int
180	item_matched_string (object pl, object op, const char *name)	198	item_matched_string (object pl, object op, const char *name)
181	{	199	{
182	char *cp, local_name[MAX_BUF];	200	char *cp, local_name[MAX_BUF];
183	int count, retval = 0;	201	int count, retval = 0;
…		…
193	/* All is a very generic match - low match value */	211	/* All is a very generic match - low match value */
194	if (!strcmp (cp, "all"))	212	if (!strcmp (cp, "all"))
195	return 1;	213	return 1;
196		214
197	/* unpaid is a little more specific */	215	/* unpaid is a little more specific */
198	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	216	if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID])
199	return 2;	217	return 2;
200	if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))	218
		219	if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] \|\| op->flag [FLAG_DAMNED]))
201	return 2;	220	return 2;
202		221
203	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	222	if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED])
204	return 2;	223	return 2;
205		224
206	/* Allow for things like '100 arrows' */	225	/* Allow for things like '100 arrows' */
207	if ((count = atoi (cp)) != 0)	226	if ((count = atoi (cp)) != 0)
208	{	227	{
…		…
226	* is because of the 'else' handling - we don't want to match on	245	* 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	246	* 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	247	* later. So keep it in descending order here, so we try for the best
229	* match first, and work downward.	248	* match first, and work downward.
230	*/	249	*/
		250	const char qbn0, qbn1, *qsn; // query base name/short name caches
		251
231	if (!strcasecmp (cp, query_name (op)))	252	if (!strcasecmp (cp, query_name (op)))
232	retval = 20;	253	retval = 20;
233	else if (!strcasecmp (cp, query_short_name (op)))	254	else if (!strcasecmp (cp, qsn = query_short_name (op)))
234	retval = 18;	255	retval = 18;
235	else if (!strcasecmp (cp, query_base_name (op, 0)))	256	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
236	retval = 16;	257	retval = 16;
237	else if (!strcasecmp (cp, query_base_name (op, 1)))	258	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
238	retval = 16;	259	retval = 16;
239	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	260	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
240	retval = 15;	261	retval = 15;
241	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	262	else if (!strncasecmp (cp, qbn0, strlen (cp)))
242	retval = 14;	263	retval = 14;
243	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	264	else if (!strncasecmp (cp, qbn1, strlen (cp)))
244	retval = 14;	265	retval = 14;
245	/* Do substring checks, so things like 'Str+1' will match.	266	/* Do substring checks, so things like 'Str+1' will match.
246	* retval of these should perhaps be lower - they are lower	267	* retval of these should perhaps be lower - they are lower
247	* then the specific strcasecmp aboves, but still higher than	268	* then the specific strcasecmp aboves, but still higher than
248	* some other match criteria.	269	* some other match criteria.
249	*/	270	*/
250	else if (strstr (query_base_name (op, 1), cp))	271	else if (strstr (qbn1, cp))
251	retval = 12;	272	retval = 12;
252	else if (strstr (query_base_name (op, 0), cp))	273	else if (strstr (qbn0, cp))
253	retval = 12;	274	retval = 12;
254	else if (strstr (query_short_name (op), cp))	275	else if (strstr (qsn, cp))
255	retval = 12;	276	retval = 12;
256	/* Check against plural/non plural based on count. */	277	/* Check against plural/non plural based on count. */
257	else if (count > 1 && !strcasecmp (cp, op->name_pl))	278	else if (count > 1 && !strcasecmp (cp, op->name_pl))
258	retval = 6;	279	retval = 6;
259	else if (count == 1 && !strcasecmp (op->name, cp))	280	else if (count == 1 && !strcasecmp (op->name, cp))
260	retval = 6;	281	retval = 6;
261	/* base name matched - not bad */	282	/* base name matched - not bad */
262	else if (strcasecmp (cp, op->name) == 0 && !count)	283	else if (strcasecmp (cp, op->name) == 0 && !count)
263	retval = 4;	284	retval = 4;
264	/* Check for partial custom name, but give a real low priority */	285	/* Check for partial custom name, but give a real low priority */
265	else if (op->custom_name && strstr (op->custom_name, cp))	286	else if (op->custom_name.contains (cp))
266	retval = 3;	287	retval = 3;
267		288
268	if (retval)	289	if (retval)
269	{	290	{
270	if (pl->type == PLAYER)	291	if (pl->type == PLAYER)
…		…
275	}	296	}
276		297
277	return 0;	298	return 0;
278	}	299	}
279		300
280	archetype::archetype ()	301	//-GPL
		302
		303	void
		304	archetype::do_delete ()
281	{	305	{
		306	delete this;
		307	}
		308
		309	archetype::archetype (const char *name)
		310	{
282	clone.arch = this;	311	arch = this;
283		312	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	}	313	}
287		314
288	archetype::~archetype ()	315	archetype::~archetype ()
289	{	316	{
290	//TODO: nuke ->more's	317	unlink ();
291	}	318	}
292		319
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	320	void
311	overwrite (archetype at, object op)	321	archetype::link ()
312	{	322	{
313	at->clone = *op;	323	if (!archetypes.contains (this))
314	at->clone.arch = at;	324	{
		325	archetypes.insert (this);
		326	ht.insert (std::make_pair (archname, this));
		327	}
		328	}
315		329
316	at->clone.inv = op->inv; op->inv = 0;	330	void
		331	archetype::unlink ()
		332	{
		333	if (archetypes.contains (this))
		334	{
		335	archetypes.erase (this);
		336	ht.erase (archname);
		337	}
		338	}
317		339
318	op->destroy ();	340	/*
		341	* Finds, using the hashtable, which archetype matches the given name.
		342	* returns a pointer to the found archetype, otherwise NULL.
		343	*/
		344	archetype *
		345	archetype::find (const char *name)
		346	{
		347	if (!name)
		348	return 0;
		349
		350	auto (i, ht.find (name));
		351
		352	if (i == ht.end ())
		353	return 0;
		354	else
		355	return i->second;
		356	}
		357
		358	void
		359	archetype::post_load_check ()
		360	{
		361	assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
		362
		363	if (type == SKILL)
		364	add_skill_archetype (this);
		365
		366	object::post_load_check ();
319	}	367	}
320		368
321	archetype *	369	archetype *
322	archetype::read (object_thawer &f)	370	archetype::read (object_thawer &f)
323	{	371	{
324	assert (f.kw == KW_object);	372	assert (f.kw == KW_object);
325		373
326	loading_arch = true; // hack to tell parse_kv et al. to behave
327
328	typedef std::pair<archetype , object > part;
329	std::vector<part> parts;	374	std::vector<archetype *> parts;
330		375
331	coroapi::cede_to_tick_every (100);	376	coroapi::cede_to_tick ();
332		377
333	for (;;)	378	for (;;)
334	{	379	{
335	object *op = object::create ();
336	archetype *at = get (f.get_str ());	380	archetype *at = new archetype (f.get_str ());
337	f.get (op->name);	381
338	f.next ();	382	f.next ();
339		383
340	#if 0	384	#if 0
		385	// implementing it here in the server does neither allow multiple inheritence
		386	// nor does it cleanly "just override". it would allow use in map files, though,
		387	// and other resource files dynamically loaded (as opposed to being preprocessed).
		388	// not that any of this is relevant as of yet...
341	if (f.kw == KW_inherit)	389	if (f.kw == KW_inherit)
342	{	390	{
343	if (archetype *at = find (f.get_str ()))	391	if (archetype *at = find (f.get_str ()))
344	*op = at->clone;	392	*op = at->clone;
345	else	393	else
346	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",	394	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
347	&at->name, f.get_str ());	395	&at->archname, f.get_str ());
348		396
349	f.next ();	397	f.next ();
350	}	398	}
351	#endif	399	#endif
352		400
		401	loading_arch = at; // hack to tell parse_kv et al. to behave
		402	bool parse_ok = at->parse_kv (f);
		403	loading_arch = 0;
		404
353	if (!op->parse_kv (f))	405	if (!parse_ok)
354	goto fail;	406	goto fail;
355		407
		408	loading_arch = at; // hack to tell parse_kv et al. to behave
356	op->post_load_check ();	409	at->post_load_check ();
		410	loading_arch = 0;
357		411
358	parts.push_back (std::make_pair (at, op));	412	parts.push_back (at);
359		413
360	if (f.kw != KW_more)	414	if (f.kw != KW_more)
361	break;	415	break;
362		416
363	f.next ();	417	f.next ();
…		…
368	goto fail;	422	goto fail;
369	}	423	}
370	}	424	}
371		425
372	{	426	{
		427	auto (at, parts.begin ());
		428
373	archetype *head = parts.front ().first;	429	archetype *new_head = parts.front ();
		430	archetype *old_head = find (new_head->archname);
374		431
375	// check that all archetypes belong to the same object or are heads	432	if (old_head && !old_head->is_head ())
376	for (auto (p, parts.begin ()); p != parts.end (); ++p)
377	{	433	{
378	archetype *at = p->first;	434	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		435	&new_head->archname, &old_head->archname);
		436	goto fail;
		437	}
379		438
380	if (at->head != head && at->head)	439	// check that all archetypes belong to the same old object or are new
		440	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		441	{
		442	archetype new_part = at;
		443	archetype *old_part = find (new_part->archname);
		444
		445	if (old_part && old_part->head_ () != old_head)
381	{	446	{
382	LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);	447	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
383	goto fail;	448	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
384	}
385
386	if (at->next && at != head)
387	{
388	LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
389	goto fail;	449	goto fail;
390	}	450	}
391	}	451	}
392		452
393	// sever chain of existing head object
394	for (archetype more, at = head; at; at = more)
395	{
396	more = at->more;
397
398	at->head = 0;
399	at->more = 0;
400	}
401
402	// replace/update head
403	overwrite (head, parts.front ().second);
404	head->tail_x = 0;
405	head->tail_y = 0;
406
407	// link into list of heads, if not already there
408	if (!head->linked)
409	{
410	head->linked = true;
411	head->next = first_archetype;
412	first_archetype = head;
413	}
414
415	// reassemble new chain	453	// assemble new chain
		454	new_head->max_x = new_head->x;
		455
416	archetype *prev = head;	456	archetype *less = new_head;
417	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)	457	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
418	{	458	{
419	archetype *at = p->first;	459	archetype at = p;
420	overwrite (at, p->second);
421		460
422	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;	461	// some flags get inherited from the head (probably a lot more)
423	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;	462	// doing it here doesn't feel too cozy, but it allows code
		463	// to ignore head checks for these flags, which saves time
		464	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		465	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		466	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		467	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
424		468
		469	new_head->max_x = max (new_head->max_x, at->x);
		470
425	at->head = head;	471	at->head = new_head;
426	at->clone.head = &head->clone;
427	prev->more = at;	472	less->more = at;
428	prev->clone.more = &at->clone;
429
430	prev = at;	473	less = at;
431	}	474	}
432		475
433	loading_arch = false;	476	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
		477
434	return head;	478	return new_head;
435	}	479	}
436		480
437	fail:	481	fail:
438	for (auto (p, parts.begin ()); p != parts.end (); ++p)	482	for (auto (p, parts.begin ()); p != parts.end (); ++p)
439	p->second->destroy (true);	483	(*p)->destroy ();
440		484
441	loading_arch = false;
442	return 0;	485	return 0;
443	}	486	}
444		487
445	/*
446	* Initialize global archtype pointers:
447	*/
448	void	488	void
449	init_archetype_pointers ()	489	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
450	{	490	{
451	ring_arch = archetype::find ("ring");	491	ref = 0;
452	amulet_arch = archetype::find ("amulet");	492	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
453	staff_arch = archetype::find ("staff");
454	crown_arch = archetype::find ("crown");
455	empty_archetype = archetype::find ("empty_archetype");
456	}	493	}
457		494
458	/*	495	void
459	* Creates and returns a new object which is a copy of the given archetype.	496	archetype::commit_load ()
460	* This function returns NULL on failure.	497	{
461	*/	498	// unlink old archetypes and link in new ones */
		499	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
		500	{
		501	archetype at = p;
		502
		503	if (archetype *old = find (at->archname))
		504	old->unlink ();
		505
		506	allarch.push_back (at);
		507
		508	at->link ();
		509	++dirtycnt;
		510	}
		511
		512	postponed_arch.clear ();
		513
		514	// now resolve arch references
		515	for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
		516	{
		517	arch_ptr *ap = p->first;
		518	archetype *at = find (p->second);
		519
		520	if (!at)
		521	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		522
		523	*ap = at;
		524	}
		525
		526	postponed_arch_ref.clear ();
		527
		528	empty = find (shstr_empty_archetype);
		529	}
		530
		531	void
		532	archetype::gc ()
		533	{
		534	int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt));
		535	dirtycnt = max (0, dirtycnt - cnt);
		536
		537	do
		538	{
		539	static int idx;
		540
		541	if (idx >= allarch.size ())
		542	if (idx)
		543	idx = 0;
		544	else
		545	return;
		546
		547	archetype *at = allarch [idx];
		548
		549	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
		550	++idx;
		551	else
		552	{
		553	//LOG (llevDebug, "garbage collect arch %s", &at->archname);
		554	assert (at->arch == at); // verify that refcnt == 1 is truly valid
		555	allarch.erase (idx);
		556
		557	// break chain
		558	for (object *op = at->head_ (); op; )
		559	{
		560	object *next = op->more;
		561	op->head = 0;
		562	op->more = 0;
		563	op = next;
		564	}
		565
		566	at->destroy ();
		567	at->arch = 0;
		568	}
		569	}
		570	while (--cnt);
		571	}
		572
462	object *	573	object *
463	arch_to_object (archetype *at)	574	archetype::instance ()
464	{	575	{
465	if (!at)
466	{
467	LOG (llevError, "Couldn't find archetype.\n");
468	return 0;
469	}
470
471	object *op = at->clone.clone ();	576	object *op = clone ();
472	op->arch = at;
473	op->instantiate ();	577	op->instantiate ();
474
475	return op;	578	return op;
476	}	579	}
477		580
478	/*	581	//+GPL
479	* Creates an object. This function is called by get_archetype()
480	* if it fails to find the appropriate archetype.
481	* Thus get_archetype() will be guaranteed to always return
482	* an object, and never NULL.
483	*/
484	object *
485	create_singularity (const char *name)
486	{
487	object *op;
488	char buf[MAX_BUF];
489
490	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
491	op = object::create ();
492	op->name = op->name_pl = buf;
493	SET_FLAG (op, FLAG_NO_PICK);
494	return op;
495	}
496		582
497	/*	583	/*
498	* Finds which archetype matches the given name, and returns a new	584	* Finds which archetype matches the given name, and returns a new
499	* object containing a copy of the archetype.	585	* object containing a copy of the archetype.
500	*/	586	*/
501	object *	587	object *
502	get_archetype (const char *name)	588	archetype::get (const char *name)
503	{	589	{
504	archetype *at = archetype::find (name);	590	archetype *at = find (name);
505		591
506	if (!at)	592	if (!at)
507	return create_singularity (name);	593	return create_singularity (name);
508		594
509	return arch_to_object (at);	595	return at->instance ();
510	}
511
512	/*
513	* Finds, using the hashtable, which archetype matches the given name.
514	* returns a pointer to the found archetype, otherwise NULL.
515	*/
516	archetype *
517	archetype::find (const char *name)
518	{
519	if (!name)
520	return 0;
521
522	auto (i, ht.find (name));
523
524	if (i == ht.end ())
525	return 0;
526	else
527	return i->second;
528	}
529
530	archetype *
531	archetype::get (const char *name)
532	{
533	if (!name)
534	{
535	LOG (llevError, "null archetype requested\n");
536	name = "(null)";
537	}
538
539	archetype *at = find (name);
540
541	if (!at)
542	{
543	archetypes.push_back (at = new archetype);
544	at->name = at->clone.name = at->clone.name_pl = name;
545	at->hash_add ();
546	}
547
548	return at;
549	}
550
551	/*
552	* Adds an archetype to the hashtable.
553	*/
554	void
555	archetype::hash_add ()
556	{
557	ht.insert (std::make_pair (name, this));
558	}
559
560	void
561	archetype::hash_del ()
562	{
563	ht.erase (name);
564	}	596	}
565		597
566	/*	598	/*
567	* Returns the first archetype using the given type.	599	* Returns the first archetype using the given type.
568	* Used in treasure-generation.	600	* Used in treasure-generation.
569	*/	601	*/
570	archetype *	602	static archetype *
571	type_to_archetype (int type)	603	type_to_archetype (int type)
572	{	604	{
573	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	605	for_all_archetypes (at)
574	if (at->clone.type == type)	606	if (at->type == type && at->head_ () != at)
575	return at;	607	return at;
576		608
577	return 0;	609	return 0;
578	}	610	}
579		611
…		…
583	* Used in treasure-generation.	615	* Used in treasure-generation.
584	*/	616	*/
585	object *	617	object *
586	clone_arch (int type)	618	clone_arch (int type)
587	{	619	{
588	archetype *at;	620	archetype *at = type_to_archetype (type);
589		621
590	if ((at = type_to_archetype (type)) == NULL)	622	if (!at)
591	{	623	{
592	LOG (llevError, "Can't clone archetype %d\n", type);	624	LOG (llevError, "Can't clone archetype %d\n", type);
593	return 0;	625	return 0;
594	}	626	}
595		627
596	object *op = at->clone.clone ();	628	return at->instance ();
597	op->instantiate ();
598	return op;
599	}	629	}
600		630
601	/*	631	/*
602	* member: make instance from class	632	* member: make instance from class
603	*/	633	*/
604
605	object *	634	object *
606	object_create_arch (archetype *at)	635	object_create_arch (archetype *at)
607	{	636	{
608	object op, prev = 0, *head = 0;	637	object op, prev = 0, *head = 0;
609		638
610	while (at)	639	while (at)
611	{	640	{
612	op = arch_to_object (at);	641	op = at->instance ();
		642
613	op->x = at->clone.x;	643	op->x = at->x;
614	op->y = at->clone.y;	644	op->y = at->y;
615		645
616	if (head)	646	if (head)
617	op->head = head, prev->more = op;	647	op->head = head, prev->more = op;
618		648
619	if (!head)	649	if (!head)
620	head = op;	650	head = op;
621		651
622	prev = op;	652	prev = op;
623	at = at->more;	653	at = (archetype *)at->more;
624	}	654	}
625		655
626	return (head);	656	return head;
627	}	657	}
628		658
		659	//-GPL
		660

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.61 by root, Mon May 28 21:21:39 2007 UTC vs. Revision 1.115 by root, Sat Nov 17 23:33:17 2018 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.61 by root, Mon May 28 21:21:39 2007 UTC vs.
Revision 1.115 by root, Sat Nov 17 23:33:17 2018 UTC