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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.37 by pippijn, Mon Jan 15 21:06:18 2007 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.37 by pippijn, Mon Jan 15 21:06:18 2007 UTC vs.
Revision 1.119 by root, Sat Dec 1 20:22:12 2018 UTC