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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.27 by root, Sat Dec 9 14:01:12 2006 UTC vs.
Revision 1.119 by root, Sat Dec 1 20:22:12 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 (©) 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
4	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	6	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	7	* Copyright (©) 1992 Frank Tore Johansen
6		8	*
7	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
8	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
9	the Free Software Foundation; either version 2 of the License, or	11	* Free Software Foundation, either version 3 of the License, or (at your
10	(at your option) any later version.	12	* option) any later version.
11		13	*
12	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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	15	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	16	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	17	* GNU General Public License for more details.
16		18	*
17	You should have received a copy of the GNU General Public License	19	* You should have received a copy of the Affero GNU General Public License
18	along with this program; if not, write to the Free Software	20	* and the GNU General Public License along with this program. If not, see
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	21	* <http://www.gnu.org/licenses/>.
20		22	*
21	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>
22	*/	24	*/
23		25
24	#include <cassert>	26	#include <cassert>
		27	#include <functional>
		28
		29	#include <flat_hash_map.hpp>
25		30
26	#include <global.h>	31	#include <global.h>
27	#include <funcpoint.h>
28	#include <loader.h>
29		32
30	#define USE_UNORDERED_MAP 0	33	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
		34	arch_ptr archetype::empty;
31		35
32	#if USE_UNORDERED_MAP
33	# include <tr1/functional>
34	# include <tr1/unordered_map>
35	#endif
36
37	int arch_cmp = 0; /* How many strcmp's */
38	int arch_search = 0; /* How many searches */
39	int arch_init; /* True if doing arch initialization */
40
41	/* The naming of these functions is really poor - they are all
42	* pretty much named '.._arch_...', but they may more may not
43	* return archetypes. Some make the arch_to_object call, and thus
44	* return an object. Perhaps those should be called 'archob' functions
45	* to denote they return an object derived from the archetype.
46	* MSW 2003-04-29
47	*/
48
49	#if USE_UNORDERED_MAP
50	// the hashtable	36	// the hashtable
51	typedef std::tr1::unordered_map	37	typedef ska::flat_hash_map
52	<	38	<
53	std::size_t,	39	const char *,
54	arch_ptr,	40	arch_ptr,
55	std::tr1::hash<size_t>,	41	str_hash,
56	std::equal_to<size_t>,	42	str_equal,
57	slice_allocator< std::pair<const std::size_t, archetype *> >	43	slice_allocator< std::pair<const char *const, arch_ptr> >
58	true,
59	> HT;	44	> HT;
60		45
61	static HT ht;	46	static HT ht (10000);
62	#else	47	archvec archetypes;
63	static arch_ptr arch_table[ARCHTABLE];	48	static unordered_vector<archetype *> allarch;
64	#endif	49	static int dirtycnt;
		50
		51	// the vector of other_arch references to be resolved
		52	static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
		53	// the vector of loaded but not yet committed archetypes
		54	static std::vector<archetype *> postponed_arch;
		55
		56	//+GPL
		57
		58	/*
		59	* Creates an object. This function is called by 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	}
65		77
66	/**	78	/**
67	* GROS - This function retrieves an archetype given the name that appears	79	* GROS - This function retrieves an archetype given the name that appears
68	* during the game (for example, "writing pen" instead of "stylus").	80	* during the game (for example, "writing pen" instead of "stylus").
69	* 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.
75	* - the archetype found or null if nothing was found.	87	* - the archetype found or null if nothing was found.
76	*/	88	*/
77	archetype *	89	archetype *
78	find_archetype_by_object_name (const char *name)	90	find_archetype_by_object_name (const char *name)
79	{	91	{
80	archetype *at;	92	shstr_cmp name_cmp (name);
81		93
82	if (name == NULL)	94	for_all_archetypes (at)
83	return (archetype *) NULL;	95	if (at->name == name_cmp)
84
85	for (at = first_archetype; at != NULL; at = at->next)
86	{
87	if (!strcmp (at->clone.name, name))
88	return at;	96	return at;
89	}	97
90	return NULL;	98	return 0;
91	}	99	}
92		100
93	/**	101	/**
94	* This function retrieves an archetype by type and name that appears during	102	* This function retrieves an archetype by type and name that appears during
95	* the game. It is basically the same as find_archetype_by_object_name()	103	* the game. It is basically the same as find_archetype_by_object_name()
96	* except that it considers only items of the given type.	104	* except that it considers only items of the given type.
97	*/	105	*/
98	archetype *	106	archetype *
99	find_archetype_by_object_type_name (int type, const char *name)	107	find_archetype_by_object_type_name (int type, const char *name)
100	{	108	{
101	archetype *at;	109	shstr_cmp name_cmp (name);
102		110
103	if (name == NULL)	111	for_all_archetypes (at)
104	return NULL;	112	if (at->name == name_cmp && at->type == type)
105
106	for (at = first_archetype; at != NULL; at = at->next)
107	{
108	if (at->clone.type == type && strcmp (at->clone.name, name) == 0)
109	return at;	113	return at;
110	}
111		114
112	return NULL;	115	return 0;
113	}	116	}
114		117
115	/* This is a lot like the above function. Instead, we are trying to match	118	/* This is a lot like the above function. Instead, we are trying to match
116	* the arch->skill values. type is the type of object to match	119	* the arch->skill values. type is the type of object to match
117	* against (eg, to only match against skills or only skill objects for example).	120	* against (eg, to only match against skills or only skill objects for example).
118	* If type is -1, ew don't match on type.	121	* If type is -1, ew don't match on type.
119	*/	122	*/
120	object *	123	object *
121	get_archetype_by_skill_name (const char *skill, int type)	124	get_archetype_by_skill_name (const char *skill, int type)
122	{	125	{
123	archetype *	126	shstr_cmp skill_cmp (skill);
124	at;
125		127
126	if (skill == NULL)	128	for_all_archetypes (at)
127	return NULL;	129	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
		130	return at->instance ();
128		131
129	for (at = first_archetype; at != NULL; at = at->next)
130	{
131	if (((type == -1) \|\| (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))
132	return arch_to_object (at);
133	}
134	return NULL;	132	return 0;
135	}	133	}
136		134
137	/* similiar to above - this returns the first archetype	135	/* similiar to above - this returns the first archetype
138	* that matches both the type and subtype. type and subtype	136	* that matches both the type and subtype. type and subtype
139	* can be -1 to say ignore, but in this case, the match it does	137	* can be -1 to say ignore, but in this case, the match it does
…		…
142	* (eg, skills)	140	* (eg, skills)
143	*/	141	*/
144	archetype *	142	archetype *
145	get_archetype_by_type_subtype (int type, int subtype)	143	get_archetype_by_type_subtype (int type, int subtype)
146	{	144	{
147	archetype *	145	for_all_archetypes (at)
148	at;
149
150	for (at = first_archetype; at != NULL; at = at->next)
151	{
152	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))
153	return at;	147	return at;
154	}	148
155	return NULL;	149	return 0;
156	}	150	}
157		151
158	/**	152	/**
159	* GROS - this returns a new object given the name that appears during the game	153	* GROS - this returns a new object given the name that appears during the game
160	* (for example, "writing pen" instead of "stylus").	154	* (for example, "writing pen" instead of "stylus").
…		…
162	* - name: The name we're searching for (ex: "writing pen");	156	* - name: The name we're searching for (ex: "writing pen");
163	* Return value:	157	* Return value:
164	* - a corresponding object if found; a singularity object if not found.	158	* - a corresponding object if found; a singularity object if not found.
165	* 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
166	* 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
167	* 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,
168	* but it otherwise had a big memory leak.	162	* but it otherwise had a big memory leak.
169	*/	163	*/
170	object *	164	object *
171	get_archetype_by_object_name (const char *name)	165	get_archetype_by_object_name (const char *name)
172	{	166	{
173	archetype *at;
174	char tmpname[MAX_BUF];	167	char tmpname[MAX_BUF];
175	int i;
176		168
177	assign (tmpname, name);	169	assign (tmpname, name);
178		170
179	for (i = strlen (tmpname); i > 0; i--)	171	for (int i = strlen (tmpname); i > 0; i--)
180	{	172	{
181	tmpname[i] = 0;	173	tmpname[i] = 0;
		174
182	at = find_archetype_by_object_name (tmpname);	175	if (archetype *at = find_archetype_by_object_name (tmpname))
183		176	return at->instance ();
184	if (at != NULL)
185	return arch_to_object (at);
186	}	177	}
187		178
188	return create_singularity (name);	179	return create_singularity (name);
189	}	180	}
190		181
191	/* 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
192	* a string seperated lists of things to match, with certain keywords.	183	* a string seperated lists of things to match, with certain keywords.
193	* pl is the player (only needed to set count properly)	184	* pl is the player (only needed to set count properly)
194	* 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
195	* 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
196	* (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
197	* value means a better match. 0 means no match.	188	* value means a better match. 0 means no match.
198	*	189	*
199	* Brief outline of the procedure:	190	* Brief outline of the procedure:
200	* We take apart the name variable into the individual components.	191	* We take apart the name variable into the individual components.
201	* cases for 'all' and unpaid are pretty obvious.	192	* cases for 'all' and unpaid are pretty obvious.
202	* 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
203	* player object.)	194	* player object.)
204	* If count is 1, make a quick check on the name.	195	* If count is 1, make a quick check on the name.
205	* 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.
206	* Last, make a check on the full name.	197	* Last, make a check on the full name.
207	*/	198	*/
208	int	199	int
209	item_matched_string (object pl, object op, const char *name)	200	item_matched_string (object pl, object op, const char *name)
210	{	201	{
211	char *cp, local_name[MAX_BUF];	202	char *cp, local_name[MAX_BUF];
212	int count, retval = 0;	203	int count, retval = 0;
213		204
214	strcpy (local_name, name); /* strtok is destructive to name */	205	assign (local_name, name); /* strtok is destructive to name */
215		206
216	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))	207	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
217	{	208	{
218	while (cp[0] == ' ')	209	while (cp[0] == ' ')
219	++cp; /* get rid of spaces */	210	++cp; /* get rid of spaces */
…		…
222	/* All is a very generic match - low match value */	213	/* All is a very generic match - low match value */
223	if (!strcmp (cp, "all"))	214	if (!strcmp (cp, "all"))
224	return 1;	215	return 1;
225		216
226	/* unpaid is a little more specific */	217	/* unpaid is a little more specific */
227	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	218	if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID])
228	return 2;	219	return 2;
229	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]))
230	return 2;	222	return 2;
231		223
232	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	224	if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED])
233	return 2;	225	return 2;
234		226
235	/* Allow for things like '100 arrows' */	227	/* Allow for things like '100 arrows' */
236	if ((count = atoi (cp)) != 0)	228	if ((count = atoi (cp)) != 0)
237	{	229	{
…		…
255	* 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
256	* 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
257	* 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
258	* match first, and work downward.	250	* match first, and work downward.
259	*/	251	*/
		252	const char qbn0, qbn1, *qsn; // query base name/short name caches
		253
260	if (!strcasecmp (cp, query_name (op)))	254	if (!strcasecmp (cp, query_name (op)))
261	retval = 20;	255	retval = 20;
262	else if (!strcasecmp (cp, query_short_name (op)))	256	else if (!strcasecmp (cp, qsn = query_short_name (op)))
263	retval = 18;	257	retval = 18;
264	else if (!strcasecmp (cp, query_base_name (op, 0)))	258	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
265	retval = 16;	259	retval = 16;
266	else if (!strcasecmp (cp, query_base_name (op, 1)))	260	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
267	retval = 16;	261	retval = 16;
268	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	262	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
269	retval = 15;	263	retval = 15;
270	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	264	else if (!strncasecmp (cp, qbn0, strlen (cp)))
271	retval = 14;	265	retval = 14;
272	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	266	else if (!strncasecmp (cp, qbn1, strlen (cp)))
273	retval = 14;	267	retval = 14;
274	/* Do substring checks, so things like 'Str+1' will match.	268	/* Do substring checks, so things like 'Str+1' will match.
275	* retval of these should perhaps be lower - they are lower	269	* retval of these should perhaps be lower - they are lower
276	* then the specific strcasecmp aboves, but still higher than	270	* then the specific strcasecmp aboves, but still higher than
277	* some other match criteria.	271	* some other match criteria.
278	*/	272	*/
279	else if (strstr (query_base_name (op, 1), cp))	273	else if (strstr (qbn1, cp))
280	retval = 12;	274	retval = 12;
281	else if (strstr (query_base_name (op, 0), cp))	275	else if (strstr (qbn0, cp))
282	retval = 12;	276	retval = 12;
283	else if (strstr (query_short_name (op), cp))	277	else if (strstr (qsn, cp))
284	retval = 12;	278	retval = 12;
285	/* Check against plural/non plural based on count. */	279	/* Check against plural/non plural based on count. */
286	else if (count > 1 && !strcasecmp (cp, op->name_pl))	280	else if (count > 1 && !strcasecmp (cp, op->name_pl))
287	retval = 6;	281	retval = 6;
288	else if (count == 1 && !strcasecmp (op->name, cp))	282	else if (count == 1 && !strcasecmp (op->name, cp))
289	retval = 6;	283	retval = 6;
290	/* base name matched - not bad */	284	/* base name matched - not bad */
291	else if (strcasecmp (cp, op->name) == 0 && !count)	285	else if (strcasecmp (cp, op->name) == 0 && !count)
292	retval = 4;	286	retval = 4;
293	/* Check for partial custom name, but give a real low priority */	287	/* Check for partial custom name, but give a real low priority */
294	else if (op->custom_name && strstr (op->custom_name, cp))	288	else if (op->custom_name.contains (cp))
295	retval = 3;	289	retval = 3;
296		290
297	if (retval)	291	if (retval)
298	{	292	{
299	if (pl->type == PLAYER)	293	if (pl->type == PLAYER)
…		…
304	}	298	}
305		299
306	return 0;	300	return 0;
307	}	301	}
308		302
309	/*	303	//-GPL
310	* Initialises the internal linked list of archetypes (read from file).
311	* Then the global "empty_archetype" pointer is initialised.
312	* Then the blocksview[] array is initialised.
313	*/
314		304
315	void	305	void
316	init_archetypes (void)	306	archetype::do_delete ()
317	{ /* called from add_player() and edit() */	307	{
318	if (first_archetype != NULL) /* Only do this once */	308	delete this;
319	return;
320
321	arch_init = 1;
322	load_archetypes ();
323	arch_init = 0;
324	empty_archetype = archetype::find ("empty_archetype");
325
326	/* init_blocksview();*/
327	}	309	}
328		310
329	/*	311	archetype::archetype (const char *name)
330	* Stores debug-information about how efficient the hashtable	312	{
331	* used for archetypes has been in the static errmsg array.	313	arch = this;
332	*/	314	this->archname = this->name = this->name_pl = name;
		315	}
		316
		317	archetype::~archetype ()
		318	{
		319	unlink ();
		320	}
333		321
334	void	322	void
335	arch_info (object *op)	323	archetype::link ()
336	{	324	{
337	sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);	325	if (!archetypes.contains (this))
338	new_draw_info (NDI_BLACK, 0, op, errmsg);	326	{
		327	archetypes.insert (this);
		328	ht.insert (std::make_pair (archname, this));
		329	}
339	}	330	}
340
341	/*
342	* Initialise the hashtable used by the archetypes.
343	*/
344		331
345	void	332	void
346	clear_archetable (void)	333	archetype::unlink ()
347	{	334	{
348	memset ((void ) arch_table, 0, ARCHTABLE sizeof (archetype *));	335	if (archetypes.contains (this))
349	}
350
351	/*
352	* An alternative way to init the hashtable which is slower, but _works_...
353	*/
354
355	void
356	init_archetable (void)
357	{
358	archetype *at;
359
360	LOG (llevDebug, " Setting up archetable...\n");
361
362	for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
363	at->hash_add ();
364
365	LOG (llevDebug, "done\n");
366	}
367
368	void
369	free_all_archs (void)
370	{
371	archetype at, next;
372	int i = 0, f = 0;
373
374	for (at = first_archetype; at != NULL; at = next)
375	{
376	if (at->more)
377	next = at->more;
378	else
379	next = at->next;
380
381	delete
382	at;
383
384	i++;
385	}	336	{
386		337	archetypes.erase (this);
387	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);	338	ht.erase (archname);
388	}
389
390	archetype::archetype ()
391	{
392	clear_object (&clone); /* to initial state other also */
393	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */
394	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
395	}
396
397	archetype::~archetype ()
398	{
399	}
400
401	/*
402	* Reads/parses the archetype-file, and copies into a linked list
403	* of archetype-structures.
404	*/
405	void
406	first_arch_pass (object_thawer & fp)
407	{
408	archetype head = 0, last_more = 0;
409
410	archetype *at = new archetype;
411	at->clone.arch = first_archetype = at;
412
413	while (int i = load_object (fp, &at->clone, 0))
414	{	339	}
415	at->clone.speed_left = (float) (-0.1);
416	/* copy the body_info to the body_used - this is only really
417	* need for monsters, but doesn't hurt to do it for everything.
418	* by doing so, when a monster is created, it has good starting
419	* values for the body_used info, so when items are created
420	* for it, they can be properly equipped.
421	*/
422	memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
423
424	switch (i)
425	{
426	case LL_NORMAL: /* A new archetype, just link it with the previous */
427	if (last_more != NULL)
428	last_more->next = at;
429	if (head != NULL)
430	head->next = at;
431	head = last_more = at;
432	#if 0
433	if (!op->type)
434	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
435	#endif
436	at->tail_x = 0;
437	at->tail_y = 0;
438	break;
439
440	case LL_MORE: /* Another part of the previous archetype, link it correctly */
441
442	at->head = head;
443	at->clone.head = &head->clone;
444	if (last_more != NULL)
445	{
446	last_more->more = at;
447	last_more->clone.more = &at->clone;
448	}
449	last_more = at;
450
451	/* If this multipart image is still composed of individual small
452	* images, don't set the tail_.. values. We can't use them anyways,
453	* and setting these to zero makes the map sending to the client much
454	* easier as just looking at the head, we know what to do.
455	*/
456	if (at->clone.face != head->clone.face)
457	{
458	head->tail_x = 0;
459	head->tail_y = 0;
460	}
461	else
462	{
463	if (at->clone.x > head->tail_x)
464	head->tail_x = at->clone.x;
465	if (at->clone.y > head->tail_y)
466	head->tail_y = at->clone.y;
467	}
468	break;
469
470	}
471
472	at = new archetype;
473
474	at->clone.arch = at;
475	}
476
477	delete at;
478	}
479
480	/*
481	* Reads the archetype file once more, and links all pointers between
482	* archetypes.
483	*/
484
485	void
486	second_arch_pass (object_thawer & thawer)
487	{
488	char buf[MAX_BUF], variable = buf, argument, *cp;
489	archetype at = NULL, other;
490
491	while (fgets (buf, MAX_BUF, thawer) != NULL)
492	{
493	if (*buf == '#')
494	continue;
495	if ((argument = strchr (buf, ' ')) != NULL)
496	{
497	*argument = '\0', argument++;
498	cp = argument + strlen (argument) - 1;
499	while (isspace (*cp))
500	{
501	*cp = '\0';
502	cp--;
503	}
504	}
505	if (!strcmp ("Object", variable))
506	{
507	if ((at = archetype::find (argument)) == NULL)
508	LOG (llevError, "Warning: failed to find arch %s\n", argument);
509	}
510	else if (!strcmp ("other_arch", variable))
511	{
512	if (at != NULL && at->clone.other_arch == NULL)
513	{
514	if ((other = archetype::find (argument)) == NULL)
515	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
516	else if (at != NULL)
517	at->clone.other_arch = other;
518	}
519	}
520	else if (!strcmp ("randomitems", variable))
521	{
522	if (at != NULL)
523	{
524	treasurelist *tl = find_treasurelist (argument);
525
526	if (tl == NULL)
527	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
528	else
529	at->clone.randomitems = tl;
530	}
531	}
532	}
533	}
534
535	#ifdef DEBUG
536	void
537	check_generators (void)
538	{
539	archetype *at;
540
541	for (at = first_archetype; at != NULL; at = at->next)
542	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
543	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
544	}
545	#endif
546
547	/*
548	* First initialises the archtype hash-table (init_archetable()).
549	* Reads and parses the archetype file (with the first and second-pass
550	* functions).
551	* Then initialises treasures by calling load_treasures().
552	*/
553
554	void
555	load_archetypes (void)
556	{
557	char filename[MAX_BUF];
558
559	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
560	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
561
562	{
563	object_thawer
564	thawer (filename);
565
566	clear_archetable ();
567	LOG (llevDebug, " arch-pass 1...\n");
568	first_arch_pass (thawer);
569	LOG (llevDebug, " done\n");
570	}
571
572	init_archetable ();
573	warn_archetypes = 1;
574
575	{
576	object_thawer
577	thawer (filename);
578
579	LOG (llevDebug, " loading treasure...\n");
580	load_treasures ();
581	LOG (llevDebug, " done\n arch-pass 2...\n");
582	second_arch_pass (thawer);
583	LOG (llevDebug, " done\n");
584	#ifdef DEBUG
585	check_generators ();
586	#endif
587	}
588	LOG (llevDebug, " done\n");
589	}
590
591	/*
592	* Creates and returns a new object which is a copy of the given archetype.
593	* This function returns NULL on failure.
594	*/
595
596	object *
597	arch_to_object (archetype *at)
598	{
599	object *op;
600
601	if (at == NULL)
602	{
603	if (warn_archetypes)
604	LOG (llevError, "Couldn't find archetype.\n");
605
606	return NULL;
607	}
608
609	op = get_object ();
610	copy_object (&at->clone, op);
611	op->arch = at;
612	op->instantiate ();
613	return op;
614	}
615
616	/*
617	* Creates an object. This function is called by get_archetype()
618	* if it fails to find the appropriate archetype.
619	* Thus get_archetype() will be guaranteed to always return
620	* an object, and never NULL.
621	*/
622
623	object *
624	create_singularity (const char *name)
625	{
626	object *op;
627	char buf[MAX_BUF];
628
629	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
630	op = get_object ();
631	op->name = op->name_pl = buf;
632	SET_FLAG (op, FLAG_NO_PICK);
633	return op;
634	}
635
636	/*
637	* Finds which archetype matches the given name, and returns a new
638	* object containing a copy of the archetype.
639	*/
640
641	object *
642	get_archetype (const char *name)
643	{
644	archetype *at = archetype::find (name);
645
646	if (!at)
647	return create_singularity (name);
648
649	return arch_to_object (at);
650	}
651
652	/*
653	* Hash-function used by the arch-hashtable.
654	*/
655
656	unsigned long
657	hasharch (const char *str, int tablesize)
658	{
659	unsigned long hash = 0;
660	unsigned int i = 0;
661	const char *p;
662
663	/* use the one-at-a-time hash function, which supposedly is
664	* better than the djb2-like one used by perl5.005, but
665	* certainly is better then the bug used here before.
666	* see http://burtleburtle.net/bob/hash/doobs.html
667	*/
668	for (p = str; i < MAXSTRING && *p; p++, i++)
669	{
670	hash += *p;
671	hash += hash << 10;
672	hash ^= hash >> 6;
673	}
674
675	hash += hash << 3;
676	hash ^= hash >> 11;
677	hash += hash << 15;
678
679	return hash % tablesize;
680	}	340	}
681		341
682	/*	342	/*
683	* Finds, using the hashtable, which archetype matches the given name.	343	* Finds, using the hashtable, which archetype matches the given name.
684	* returns a pointer to the found archetype, otherwise NULL.	344	* returns a pointer to the found archetype, otherwise NULL.
685	*/	345	*/
686
687	archetype *	346	archetype *
688	archetype::find (const char *name)	347	archetype::find (const char *name)
689	{	348	{
690	if (!name)	349	if (!name)
691	return 0;	350	return 0;
692		351
693	#if USE_UNORDERED_MAP	352	auto i = ht.find (name);
694	AUTODECL (i, ht.find ((size_t) name));
695		353
696	if (i == ht.end ())	354	if (i == ht.end ())
697	return 0;	355	return 0;
698	else	356	else
699	return i->second;	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 ();
		369	}
		370
		371	archetype *
		372	archetype::read (object_thawer &f)
		373	{
		374	assert (f.kw == KW_object);
		375
		376	std::vector<archetype *> parts;
		377
		378	coroapi::cede_to_tick ();
		379
		380	for (;;)
		381	{
		382	archetype *at = new archetype (f.get_str ());
		383
		384	f.next ();
		385
		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...
		391	if (f.kw == KW_inherit)
		392	{
		393	if (archetype *at = find (f.get_str ()))
		394	*op = at->clone;
		395	else
		396	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		397	&at->archname, f.get_str ());
		398
		399	f.next ();
		400	}
700	#endif	401	#endif
701		402
702	archetype *at;	403	loading_arch = at; // hack to tell parse_kv et al. to behave
703	unsigned long index;	404	bool parse_ok = at->parse_kv (f);
		405	loading_arch = 0;
704		406
705	index = hasharch (name, ARCHTABLE);	407	if (!parse_ok)
706	arch_search++;	408	goto fail;
707	for (;;)
708	{
709	at = arch_table[index];
710		409
711	if (at == NULL)	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);
		415
		416	if (f.kw != KW_more)
		417	break;
		418
		419	f.next ();
		420
		421	if (f.kw != KW_object)
712	{	422	{
713	if (warn_archetypes)	423	f.parse_error ("more object");
714	LOG (llevError, "Couldn't find archetype %s\n", name);	424	goto fail;
715
716	return NULL;
717	}	425	}
		426	}
718		427
719	arch_cmp++;	428	{
		429	archetype *new_head = parts.front ();
		430	archetype *old_head = find (new_head->archname);
720		431
721	if (!strcmp ((const char *) at->name, name))	432	if (old_head && !old_head->is_head ())
722	return at;	433	{
		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	}
723		438
724	if (++index >= ARCHTABLE)	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)
		446	{
		447	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		448	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		449	goto fail;
		450	}
		451	}
		452
		453	// assemble new chain
		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)
		458	{
		459	archetype at = p;
		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
		471	at->head = new_head;
		472	less->more = at;
		473	less = at;
		474	}
		475
		476	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
		477
		478	return new_head;
		479	}
		480
		481	fail:
		482	for (auto &&at : parts)
		483	at->destroy ();
		484
		485	return 0;
		486	}
		487
		488	void
		489	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
		490	{
		491	ref = 0;
		492	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
		493	}
		494
		495	void
		496	archetype::commit_load ()
		497	{
		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)
725	index = 0;	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	}
726	}	567	}
		568	while (--cnt);
727	}	569	}
		570
		571	object *
		572	archetype::instance ()
		573	{
		574	object *op = clone ();
		575	op->instantiate ();
		576	return op;
		577	}
		578
		579	//+GPL
728		580
729	/*	581	/*
730	* Adds an archetype to the hashtable.	582	* Finds which archetype matches the given name, and returns a new
		583	* object containing a copy of the archetype.
731	*/	584	*/
732	void	585	object *
733	archetype::hash_add ()	586	archetype::get (const char *name)
734	{	587	{
735	#if USE_UNORDERED_MAP	588	archetype *at = find (name);
736	ht.insert (std::make_pair ((size_t) (const char *) name, this));
737	#else
738		589
739	int index = hasharch ((const char *) name, ARCHTABLE), org_index = index;	590	if (!at)
		591	return create_singularity (name);
740		592
741	for (;;)	593	return at->instance ();
742	{
743	if (!arch_table[index])
744	{
745	arch_table[index] = this;
746	break;
747	}
748
749	if (++index == ARCHTABLE)
750	index = 0;
751
752	if (index == org_index)
753	fatal (ARCHTABLE_TOO_SMALL);
754	}
755	#endif
756	}
757
758	void
759	archetype::hash_del ()
760	{
761	#if USE_UNORDERED_MAP
762	# error remove this from HT
763	#else
764
765	int index = hasharch ((const char *) name, ARCHTABLE), org_index = index;
766
767	for (;;)
768	{
769	if (arch_table[index] == this)
770	{
771	arch_table[index] = 0;
772	break;
773	}
774
775	if (++index == ARCHTABLE)
776	index = 0;
777
778	if (index == org_index)
779	break;
780	}
781	#endif
782	}	594	}
783		595
784	/*	596	/*
785	* Returns the first archetype using the given type.	597	* Returns the first archetype using the given type.
786	* Used in treasure-generation.	598	* Used in treasure-generation.
787	*/	599	*/
788
789	archetype *	600	static archetype *
790	type_to_archetype (int type)	601	type_to_archetype (int type)
791	{	602	{
792	archetype *at;	603	for_all_archetypes (at)
793		604	if (at->type == type && at->head_ () != at)
794	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
795	if (at->clone.type == type)
796	return at;	605	return at;
797		606
798	return 0;	607	return 0;
799	}	608	}
800		609
801	/*	610	/*
802	* Returns a new object copied from the first archetype matching	611	* Returns a new object copied from the first archetype matching
803	* the given type.	612	* the given type.
804	* Used in treasure-generation.	613	* Used in treasure-generation.
805	*/	614	*/
806
807	object *	615	object *
808	clone_arch (int type)	616	clone_arch (int type)
809	{	617	{
810	archetype *at;	618	archetype *at = type_to_archetype (type);
811	object *op = get_object ();
812		619
813	if ((at = type_to_archetype (type)) == NULL)	620	if (!at)
814	{	621	{
815	LOG (llevError, "Can't clone archetype %d\n", type);	622	LOG (llevError, "Can't clone archetype %d\n", type);
816	free_object (op);
817	return NULL;	623	return 0;
818	}	624	}
819		625
820	copy_object (&at->clone, op);	626	return at->instance ();
821	op->instantiate ();
822	return op;
823	}	627	}
824		628
825	/*	629	/*
826	* member: make instance from class	630	* member: make instance from class
827	*/	631	*/
828
829	object *	632	object *
830	object_create_arch (archetype *at)	633	object_create_arch (archetype *at)
831	{	634	{
832	object op, prev = 0, *head = 0;	635	object op, prev = 0, *head = 0;
833		636
834	while (at)	637	while (at)
835	{	638	{
836	op = arch_to_object (at);	639	op = at->instance ();
		640
837	op->x = at->clone.x;	641	op->x = at->x;
838	op->y = at->clone.y;	642	op->y = at->y;
839		643
840	if (head)	644	if (head)
841	op->head = head, prev->more = op;	645	op->head = head, prev->more = op;
842		646
843	if (!head)	647	if (!head)
844	head = op;	648	head = op;
845		649
846	prev = op;	650	prev = op;
847	at = at->more;	651	at = (archetype *)at->more;
848	}	652	}
849		653
850	return (head);	654	return head;
851	}	655	}
852		656
		657	//-GPL
		658

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.27 by root, Sat Dec 9 14:01:12 2006 UTC vs. Revision 1.119 by root, Sat Dec 1 20:22:12 2018 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.27 by root, Sat Dec 9 14:01:12 2006 UTC vs.
Revision 1.119 by root, Sat Dec 1 20:22:12 2018 UTC