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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.58 by root, Sat Apr 21 11:55:36 2007 UTC vs.
Revision 1.118 by root, Tue Nov 27 18:50:22 2018 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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
		5	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team	6	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	7	* Copyright (©) 1992 Frank Tore Johansen
7	*	8	*
8	* This program is free software; you can redistribute it and/or modify	9	* 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	10	* 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	11	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	12	* option) any later version.
12	*	13	*
13	* This program is distributed in the hope that it will be useful,	14	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	15	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	16	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	17	* GNU General Public License for more details.
17	*
18	* You should have received a copy of the GNU General Public License
19	* along with this program; if not, write to the Free Software
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	18	*
		19	* You should have received a copy of the Affero GNU General Public License
		20	* and the GNU General Public License along with this program. If not, see
		21	* <http://www.gnu.org/licenses/>.
		22	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	23	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	24	*/
24		25
25	#include <cassert>	26	#include <cassert>
		27	#include <functional>
		28
		29	#include <flat_hash_map.hpp>
26		30
27	#include <global.h>	31	#include <global.h>
28	#include <funcpoint.h>
29	#include <loader.h>
30		32
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	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 ska::flat_hash_map
46	<	38	<
47	const char *,	39	const char *,
48	arch_ptr,	40	arch_ptr,
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 archetype::get ()
		60	* if it fails to find the appropriate archetype.
		61	* Thus archetype::get() 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;
…		…
193	/* All is a very generic match - low match value */	213	/* All is a very generic match - low match value */
194	if (!strcmp (cp, "all"))	214	if (!strcmp (cp, "all"))
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") && op->flag [FLAG_UNPAID])
199	return 2;	219	return 2;
200	if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))	220
		221	if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] \|\| op->flag [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") && !op->flag [FLAG_INV_LOCKED])
204	return 2;	225	return 2;
205		226
206	/* Allow for things like '100 arrows' */	227	/* Allow for things like '100 arrows' */
207	if ((count = atoi (cp)) != 0)	228	if ((count = atoi (cp)) != 0)
208	{	229	{
…		…
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	void
		306	archetype::do_delete ()
281	{	307	{
		308	delete this;
		309	}
		310
		311	archetype::archetype (const char *name)
		312	{
282	clone.arch = this;	313	arch = this;
283		314	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	}	315	}
287		316
288	archetype::~archetype ()	317	archetype::~archetype ()
289	{	318	{
290	//TODO: nuke ->more's	319	unlink ();
291	}	320	}
292		321
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	322	void
311	overwrite (archetype at, object op)	323	archetype::link ()
312	{	324	{
313	at->clone = *op;	325	if (!archetypes.contains (this))
314	at->clone.arch = at;	326	{
		327	archetypes.insert (this);
		328	ht.insert (std::make_pair (archname, this));
		329	}
		330	}
315		331
316	at->clone.inv = op->inv; op->inv = 0;	332	void
		333	archetype::unlink ()
		334	{
		335	if (archetypes.contains (this))
		336	{
		337	archetypes.erase (this);
		338	ht.erase (archname);
		339	}
		340	}
317		341
318	op->destroy ();	342	/*
		343	* Finds, using the hashtable, which archetype matches the given name.
		344	* returns a pointer to the found archetype, otherwise NULL.
		345	*/
		346	archetype *
		347	archetype::find (const char *name)
		348	{
		349	if (!name)
		350	return 0;
		351
		352	auto (i, ht.find (name));
		353
		354	if (i == ht.end ())
		355	return 0;
		356	else
		357	return i->second;
		358	}
		359
		360	void
		361	archetype::post_load_check ()
		362	{
		363	assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
		364
		365	if (type == SKILL)
		366	add_skill_archetype (this);
		367
		368	object::post_load_check ();
319	}	369	}
320		370
321	archetype *	371	archetype *
322	archetype::read (object_thawer &f)	372	archetype::read (object_thawer &f)
323	{	373	{
324	assert (f.kw == KW_object);	374	assert (f.kw == KW_object);
325		375
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;	376	std::vector<archetype *> parts;
330		377
331	coroapi::cede_to_tick_every (100);	378	coroapi::cede_to_tick ();
332		379
333	for (;;)	380	for (;;)
334	{	381	{
335	object *op = object::create ();
336	archetype *at = get (f.get_str ());	382	archetype *at = new archetype (f.get_str ());
337	f.get (op->name);	383
338	f.next ();	384	f.next ();
339		385
340	#if 0	386	#if 0
		387	// implementing it here in the server does neither allow multiple inheritence
		388	// nor does it cleanly "just override". it would allow use in map files, though,
		389	// and other resource files dynamically loaded (as opposed to being preprocessed).
		390	// not that any of this is relevant as of yet...
341	if (f.kw == KW_inherit)	391	if (f.kw == KW_inherit)
342	{	392	{
343	if (archetype *at = find (f.get_str ()))	393	if (archetype *at = find (f.get_str ()))
344	*op = at->clone;	394	*op = at->clone;
345	else	395	else
346	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",	396	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
347	&at->name, f.get_str ());	397	&at->archname, f.get_str ());
348		398
349	f.next ();	399	f.next ();
350	}	400	}
351	#endif	401	#endif
352		402
		403	loading_arch = at; // hack to tell parse_kv et al. to behave
		404	bool parse_ok = at->parse_kv (f);
		405	loading_arch = 0;
		406
353	if (!op->parse_kv (f))	407	if (!parse_ok)
354	goto fail;	408	goto fail;
355		409
356	parts.push_back (std::make_pair (at, op));	410	loading_arch = at; // hack to tell parse_kv et al. to behave
		411	at->post_load_check ();
		412	loading_arch = 0;
		413
		414	parts.push_back (at);
357		415
358	if (f.kw != KW_more)	416	if (f.kw != KW_more)
359	break;	417	break;
360		418
361	f.next ();	419	f.next ();
…		…
366	goto fail;	424	goto fail;
367	}	425	}
368	}	426	}
369		427
370	{	428	{
371	archetype *head = parts.front ().first;	429	archetype *new_head = parts.front ();
		430	archetype *old_head = find (new_head->archname);
372		431
373	// check that all archetypes belong to the same object or are heads	432	if (old_head && !old_head->is_head ())
374	for (auto (p, parts.begin ()); p != parts.end (); ++p)
375	{	433	{
376	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	}
377		438
378	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)
		441	{
		442	archetype *new_part = at;
		443	archetype *old_part = find (new_part->archname);
		444
		445	if (old_part && old_part->head_ () != old_head)
379	{	446	{
380	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",
381	goto fail;	448	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
382	}
383
384	if (at->next && at != head)
385	{
386	LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
387	goto fail;	449	goto fail;
388	}	450	}
389	}	451	}
390		452
391	// sever chain of existing head object	453	// assemble new chain
392	for (archetype more, at = head; at; at = more)	454	new_head->max_x = new_head->x;
		455
		456	archetype *less = new_head;
		457	for (auto &&p = parts.begin () + 1; p != parts.end (); ++p)
393	{	458	{
394	more = at->more;	459	archetype at = p;
395		460
		461	// some flags get inherited from the head (probably a lot more)
		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];
		468
		469	new_head->max_x = max (new_head->max_x, at->x);
		470
396	at->head = 0;	471	at->head = new_head;
397	at->more = 0;	472	less->more = at;
		473	less = at;
398	}	474	}
399		475
400	// replace/update head	476	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
401	overwrite (head, parts.front ().second);
402	head->tail_x = 0;
403	head->tail_y = 0;
404		477
405	// link into list of heads, if not already there
406	if (!head->linked)
407	{
408	head->linked = true;
409	head->next = first_archetype;
410	first_archetype = head;
411	}
412
413	// reassemble new chain
414	archetype *prev = head;
415	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
416	{
417	archetype *at = p->first;
418	overwrite (at, p->second);
419
420	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
421	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
422
423	at->head = head;
424	at->clone.head = &head->clone;
425	prev->more = at;
426	prev->clone.more = &at->clone;
427
428	prev = at;
429	}
430
431	loading_arch = false;
432	return head;	478	return new_head;
433	}	479	}
434		480
435	fail:	481	fail:
436	for (auto (p, parts.begin ()); p != parts.end (); ++p)	482	for (auto &&at : parts)
437	p->second->destroy (true);	483	at->destroy ();
438		484
439	loading_arch = false;
440	return 0;	485	return 0;
441	}	486	}
442		487
443	/*
444	* Initialize global archtype pointers:
445	*/
446	void	488	void
447	init_archetype_pointers ()	489	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
448	{	490	{
449	ring_arch = archetype::find ("ring");	491	ref = 0;
450	amulet_arch = archetype::find ("amulet");	492	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
451	staff_arch = archetype::find ("staff");
452	crown_arch = archetype::find ("crown");
453	empty_archetype = archetype::find ("empty_archetype");
454	}	493	}
455		494
456	/*	495	void
457	* Creates and returns a new object which is a copy of the given archetype.	496	archetype::commit_load ()
458	* This function returns NULL on failure.	497	{
459	*/	498	// unlink old archetypes and link in new ones */
		499	for (auto &&at : postponed_arch)
		500	{
		501	if (archetype *old = find (at->archname))
		502	old->unlink ();
		503
		504	allarch.push_back (at);
		505
		506	at->link ();
		507	++dirtycnt;
		508	}
		509
		510	postponed_arch.clear ();
		511
		512	// now resolve arch references
		513	for (auto &&p : postponed_arch_ref) // not yet C++17
		514	{
		515	arch_ptr *ap = p.first;
		516	archetype *at = find (p.second);
		517
		518	if (!at)
		519	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p.second);
		520
		521	*ap = at;
		522	}
		523
		524	postponed_arch_ref.clear ();
		525
		526	empty = find (shstr_empty_archetype);
		527	}
		528
		529	void
		530	archetype::gc ()
		531	{
		532	int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt));
		533	dirtycnt = max (0, dirtycnt - cnt);
		534
		535	do
		536	{
		537	static int idx;
		538
		539	if (idx >= allarch.size ())
		540	if (idx)
		541	idx = 0;
		542	else
		543	return;
		544
		545	archetype *at = allarch [idx];
		546
		547	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
		548	++idx;
		549	else
		550	{
		551	//LOG (llevDebug, "garbage collect arch %s", &at->archname);
		552	assert (at->arch == at); // verify that refcnt == 1 is truly valid
		553	allarch.erase (idx);
		554
		555	// break chain
		556	for (object *op = at->head_ (); op; )
		557	{
		558	object *next = op->more;
		559	op->head = 0;
		560	op->more = 0;
		561	op = next;
		562	}
		563
		564	at->destroy ();
		565	at->arch = 0;
		566	}
		567	}
		568	while (--cnt);
		569	}
		570
460	object *	571	object *
461	arch_to_object (archetype *at)	572	archetype::instance ()
462	{	573	{
463	if (!at)
464	{
465	LOG (llevError, "Couldn't find archetype.\n");
466	return 0;
467	}
468
469	object *op = at->clone.clone ();	574	object *op = clone ();
470	op->arch = at;
471	op->instantiate ();	575	op->instantiate ();
472
473	return op;	576	return op;
474	}	577	}
475		578
476	/*	579	//+GPL
477	* Creates an object. This function is called by get_archetype()
478	* if it fails to find the appropriate archetype.
479	* Thus get_archetype() will be guaranteed to always return
480	* an object, and never NULL.
481	*/
482	object *
483	create_singularity (const char *name)
484	{
485	object *op;
486	char buf[MAX_BUF];
487
488	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
489	op = object::create ();
490	op->name = op->name_pl = buf;
491	SET_FLAG (op, FLAG_NO_PICK);
492	return op;
493	}
494		580
495	/*	581	/*
496	* Finds which archetype matches the given name, and returns a new	582	* Finds which archetype matches the given name, and returns a new
497	* object containing a copy of the archetype.	583	* object containing a copy of the archetype.
498	*/	584	*/
499	object *	585	object *
500	get_archetype (const char *name)	586	archetype::get (const char *name)
501	{	587	{
502	archetype *at = archetype::find (name);	588	archetype *at = find (name);
503		589
504	if (!at)	590	if (!at)
505	return create_singularity (name);	591	return create_singularity (name);
506		592
507	return arch_to_object (at);	593	return at->instance ();
508	}
509
510	/*
511	* Finds, using the hashtable, which archetype matches the given name.
512	* returns a pointer to the found archetype, otherwise NULL.
513	*/
514	archetype *
515	archetype::find (const char *name)
516	{
517	if (!name)
518	return 0;
519
520	auto (i, ht.find (name));
521
522	if (i == ht.end ())
523	return 0;
524	else
525	return i->second;
526	}
527
528	archetype *
529	archetype::get (const char *name)
530	{
531	if (!name)
532	{
533	LOG (llevError, "null archetype requested\n");
534	name = "(null)";
535	}
536
537	archetype *at = find (name);
538
539	if (!at)
540	{
541	archetypes.push_back (at = new archetype);
542	at->name = at->clone.name = at->clone.name_pl = name;
543	at->hash_add ();
544	}
545
546	return at;
547	}
548
549	/*
550	* Adds an archetype to the hashtable.
551	*/
552	void
553	archetype::hash_add ()
554	{
555	ht.insert (std::make_pair (name, this));
556	}
557
558	void
559	archetype::hash_del ()
560	{
561	ht.erase (name);
562	}	594	}
563		595
564	/*	596	/*
565	* Returns the first archetype using the given type.	597	* Returns the first archetype using the given type.
566	* Used in treasure-generation.	598	* Used in treasure-generation.
567	*/	599	*/
568	archetype *	600	static archetype *
569	type_to_archetype (int type)	601	type_to_archetype (int type)
570	{	602	{
571	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	603	for_all_archetypes (at)
572	if (at->clone.type == type)	604	if (at->type == type && at->head_ () != at)
573	return at;	605	return at;
574		606
575	return 0;	607	return 0;
576	}	608	}
577		609
…		…
581	* Used in treasure-generation.	613	* Used in treasure-generation.
582	*/	614	*/
583	object *	615	object *
584	clone_arch (int type)	616	clone_arch (int type)
585	{	617	{
586	archetype *at;	618	archetype *at = type_to_archetype (type);
587		619
588	if ((at = type_to_archetype (type)) == NULL)	620	if (!at)
589	{	621	{
590	LOG (llevError, "Can't clone archetype %d\n", type);	622	LOG (llevError, "Can't clone archetype %d\n", type);
591	return 0;	623	return 0;
592	}	624	}
593		625
594	object *op = at->clone.clone ();	626	return at->instance ();
595	op->instantiate ();
596	return op;
597	}	627	}
598		628
599	/*	629	/*
600	* member: make instance from class	630	* member: make instance from class
601	*/	631	*/
602
603	object *	632	object *
604	object_create_arch (archetype *at)	633	object_create_arch (archetype *at)
605	{	634	{
606	object op, prev = 0, *head = 0;	635	object op, prev = 0, *head = 0;
607		636
608	while (at)	637	while (at)
609	{	638	{
610	op = arch_to_object (at);	639	op = at->instance ();
		640
611	op->x = at->clone.x;	641	op->x = at->x;
612	op->y = at->clone.y;	642	op->y = at->y;
613		643
614	if (head)	644	if (head)
615	op->head = head, prev->more = op;	645	op->head = head, prev->more = op;
616		646
617	if (!head)	647	if (!head)
618	head = op;	648	head = op;
619		649
620	prev = op;	650	prev = op;
621	at = at->more;	651	at = (archetype *)at->more;
622	}	652	}
623		653
624	return (head);	654	return head;
625	}	655	}
626		656
		657	//-GPL
		658

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.58 by root, Sat Apr 21 11:55:36 2007 UTC vs. Revision 1.118 by root, Tue Nov 27 18:50:22 2018 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.58 by root, Sat Apr 21 11:55:36 2007 UTC vs.
Revision 1.118 by root, Tue Nov 27 18:50:22 2018 UTC