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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.41 by root, Thu Feb 8 03:09:31 2007 UTC vs.
Revision 1.115 by root, Sat Nov 17 23:33:17 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 (©) 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	5	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation; either version 2 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*
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	*	17	*
		18	* You should have received a copy of the Affero GNU General Public License
		19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
		21	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	23	*/
24		24
25	#include <cassert>	25	#include <cassert>
		26	#include <functional>
		27
		28	#include <flat_hash_map.hpp>
26		29
27	#include <global.h>	30	#include <global.h>
28	#include <funcpoint.h>
29	#include <loader.h>
30		31
31	#include <tr1/functional>	32	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
32	#include <tr1/unordered_map>	33	arch_ptr archetype::empty;
33
34	int arch_init; /* True if doing arch initialization */
35
36	/* The naming of these functions is really poor - they are all
37	* pretty much named '.._arch_...', but they may more may not
38	* return archetypes. Some make the arch_to_object call, and thus
39	* return an object. Perhaps those should be called 'archob' functions
40	* to denote they return an object derived from the archetype.
41	* MSW 2003-04-29
42	*/
43		34
44	// the hashtable	35	// the hashtable
45	typedef std::tr1::unordered_map	36	typedef ska::flat_hash_map<
46	<
47	const char *,	37	const char *,
48	arch_ptr,	38	arch_ptr,
49	str_hash,	39	str_hash,
50	str_equal,	40	str_equal,
51	slice_allocator< std::pair<const char *const, arch_ptr> >	41	slice_allocator< std::pair<const char *const, arch_ptr> >
52	> HT;	42	> HT;
53		43
54	static HT ht (5000);	44	static HT ht (10000);
		45	archvec archetypes;
		46	static unordered_vector<archetype *> allarch;
		47	static int dirtycnt;
		48
		49	// the vector of other_arch references to be resolved
		50	static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
		51	// the vector of loaded but not yet committed archetypes
		52	static std::vector<archetype *> postponed_arch;
		53
		54	//+GPL
		55
		56	/*
		57	* Creates an object. This function is called by archetype::get ()
		58	* if it fails to find the appropriate archetype.
		59	* Thus archetype::get() will be guaranteed to always return
		60	* an object, and never NULL.
		61	*/
		62	static object *
		63	create_singularity (const char *name)
		64	{
		65	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
		66
		67	if (!strcmp (name, "bug"))
		68	abort ();
		69
		70	object *op = archetype::get (shstr_bug);
		71	op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
		72
		73	return op;
		74	}
55		75
56	/**	76	/**
57	* GROS - This function retrieves an archetype given the name that appears	77	* GROS - This function retrieves an archetype given the name that appears
58	* during the game (for example, "writing pen" instead of "stylus").	78	* during the game (for example, "writing pen" instead of "stylus").
59	* It does not use the hashtable system, but browse the whole archlist each time.	79	* It does not use the hashtable system, but browse the whole archlist each time.
67	archetype *	87	archetype *
68	find_archetype_by_object_name (const char *name)	88	find_archetype_by_object_name (const char *name)
69	{	89	{
70	shstr_cmp name_cmp (name);	90	shstr_cmp name_cmp (name);
71		91
72	for (archetype *at = first_archetype; at; at = at->next)	92	for_all_archetypes (at)
73	if (at->clone.name == name_cmp)	93	if (at->name == name_cmp)
74	return at;	94	return at;
75		95
76	return 0;	96	return 0;
77	}	97	}
78		98
…		…
84	archetype *	104	archetype *
85	find_archetype_by_object_type_name (int type, const char *name)	105	find_archetype_by_object_type_name (int type, const char *name)
86	{	106	{
87	shstr_cmp name_cmp (name);	107	shstr_cmp name_cmp (name);
88		108
89	for (archetype *at = first_archetype; at; at = at->next)	109	for_all_archetypes (at)
90	if (at->clone.name == name_cmp && at->clone.type == type)	110	if (at->name == name_cmp && at->type == type)
91	return at;	111	return at;
92		112
93	return 0;	113	return 0;
94	}	114	}
95		115
…		…
101	object *	121	object *
102	get_archetype_by_skill_name (const char *skill, int type)	122	get_archetype_by_skill_name (const char *skill, int type)
103	{	123	{
104	shstr_cmp skill_cmp (skill);	124	shstr_cmp skill_cmp (skill);
105		125
106	for (archetype *at = first_archetype; at; at = at->next)	126	for_all_archetypes (at)
107	if (at->clone.skill == skill_cmp && (type == -1 \|\| type == at->clone.type))	127	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
108	return arch_to_object (at);	128	return at->instance ();
109		129
110	return 0;	130	return 0;
111	}	131	}
112		132
113	/* similiar to above - this returns the first archetype	133	/* similiar to above - this returns the first archetype
…		…
118	* (eg, skills)	138	* (eg, skills)
119	*/	139	*/
120	archetype *	140	archetype *
121	get_archetype_by_type_subtype (int type, int subtype)	141	get_archetype_by_type_subtype (int type, int subtype)
122	{	142	{
123	for (archetype *at = first_archetype; at; at = at->next)	143	for_all_archetypes (at)
124	if ((type == -1 \|\| type == at->clone.type) && (subtype == -1 \|\| subtype == at->clone.subtype))	144	if ((type == -1 \|\| type == at->type) && (subtype == -1 \|\| subtype == at->subtype))
125	return at;	145	return at;
126		146
127	return 0;	147	return 0;
128	}	148	}
129		149
…		…
134	* - name: The name we're searching for (ex: "writing pen");	154	* - name: The name we're searching for (ex: "writing pen");
135	* Return value:	155	* Return value:
136	* - a corresponding object if found; a singularity object if not found.	156	* - a corresponding object if found; a singularity object if not found.
137	* Note by MSW - it appears that it takes the full name and keeps	157	* Note by MSW - it appears that it takes the full name and keeps
138	* shortening it until it finds a match. I re-wrote this so that it	158	* shortening it until it finds a match. I re-wrote this so that it
139	* doesn't malloc it each time - not that this function is used much,	159	* doesn't allocate it each time - not that this function is used much,
140	* but it otherwise had a big memory leak.	160	* but it otherwise had a big memory leak.
141	*/	161	*/
142	object *	162	object *
143	get_archetype_by_object_name (const char *name)	163	get_archetype_by_object_name (const char *name)
144	{	164	{
145	char tmpname[MAX_BUF];	165	char tmpname[MAX_BUF];
146	int i;
147		166
148	assign (tmpname, name);	167	assign (tmpname, name);
149		168
150	for (i = strlen (tmpname); i > 0; i--)	169	for (int i = strlen (tmpname); i > 0; i--)
151	{	170	{
152	tmpname[i] = 0;	171	tmpname[i] = 0;
153		172
154	if (archetype *at = find_archetype_by_object_name (tmpname))	173	if (archetype *at = find_archetype_by_object_name (tmpname))
155	return arch_to_object (at);	174	return at->instance ();
156	}	175	}
157		176
158	return create_singularity (name);	177	return create_singularity (name);
159	}	178	}
160		179
161	/* This is a subset of the parse_id command. Basically, name can be	180	/* This is a subset of the parse_id command. Basically, name can be
162	* a string seperated lists of things to match, with certain keywords.	181	* a string seperated lists of things to match, with certain keywords.
163	* pl is the player (only needed to set count properly)	182	* pl is the player (only needed to set count properly)
164	* op is the item we are trying to match. Calling function takes care	183	* op is the item we are trying to match. Calling function takes care
165	* of what action might need to be done and if it is valid	184	* of what action might need to be done and if it is valid
166	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher	185	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
167	* value means a better match. 0 means no match.	186	* value means a better match. 0 means no match.
168	*	187	*
169	* Brief outline of the procedure:	188	* Brief outline of the procedure:
170	* We take apart the name variable into the individual components.	189	* We take apart the name variable into the individual components.
171	* cases for 'all' and unpaid are pretty obvious.	190	* cases for 'all' and unpaid are pretty obvious.
172	* Next, we check for a count (either specified in name, or in the	191	* Next, we check for a count (either specified in name, or in the
173	* player object.)	192	* player object.)
174	* If count is 1, make a quick check on the name.	193	* If count is 1, make a quick check on the name.
175	* IF count is >1, we need to make plural name. Return if match.	194	* IF count is >1, we need to make plural name. Return if match.
176	* Last, make a check on the full name.	195	* Last, make a check on the full name.
177	*/	196	*/
178	int	197	int
179	item_matched_string (object pl, object op, const char *name)	198	item_matched_string (object pl, object op, const char *name)
180	{	199	{
181	char *cp, local_name[MAX_BUF];	200	char *cp, local_name[MAX_BUF];
182	int count, retval = 0;	201	int count, retval = 0;
…		…
192	/* All is a very generic match - low match value */	211	/* All is a very generic match - low match value */
193	if (!strcmp (cp, "all"))	212	if (!strcmp (cp, "all"))
194	return 1;	213	return 1;
195		214
196	/* unpaid is a little more specific */	215	/* unpaid is a little more specific */
197	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	216	if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID])
198	return 2;	217	return 2;
199	if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))	218
		219	if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] \|\| op->flag [FLAG_DAMNED]))
200	return 2;	220	return 2;
201		221
202	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	222	if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED])
203	return 2;	223	return 2;
204		224
205	/* Allow for things like '100 arrows' */	225	/* Allow for things like '100 arrows' */
206	if ((count = atoi (cp)) != 0)	226	if ((count = atoi (cp)) != 0)
207	{	227	{
…		…
225	* is because of the 'else' handling - we don't want to match on	245	* is because of the 'else' handling - we don't want to match on
226	* something and set a low retval, even though it may match a higher retcal	246	* something and set a low retval, even though it may match a higher retcal
227	* later. So keep it in descending order here, so we try for the best	247	* later. So keep it in descending order here, so we try for the best
228	* match first, and work downward.	248	* match first, and work downward.
229	*/	249	*/
		250	const char qbn0, qbn1, *qsn; // query base name/short name caches
		251
230	if (!strcasecmp (cp, query_name (op)))	252	if (!strcasecmp (cp, query_name (op)))
231	retval = 20;	253	retval = 20;
232	else if (!strcasecmp (cp, query_short_name (op)))	254	else if (!strcasecmp (cp, qsn = query_short_name (op)))
233	retval = 18;	255	retval = 18;
234	else if (!strcasecmp (cp, query_base_name (op, 0)))	256	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
235	retval = 16;	257	retval = 16;
236	else if (!strcasecmp (cp, query_base_name (op, 1)))	258	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
237	retval = 16;	259	retval = 16;
238	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	260	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
239	retval = 15;	261	retval = 15;
240	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	262	else if (!strncasecmp (cp, qbn0, strlen (cp)))
241	retval = 14;	263	retval = 14;
242	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	264	else if (!strncasecmp (cp, qbn1, strlen (cp)))
243	retval = 14;	265	retval = 14;
244	/* Do substring checks, so things like 'Str+1' will match.	266	/* Do substring checks, so things like 'Str+1' will match.
245	* retval of these should perhaps be lower - they are lower	267	* retval of these should perhaps be lower - they are lower
246	* then the specific strcasecmp aboves, but still higher than	268	* then the specific strcasecmp aboves, but still higher than
247	* some other match criteria.	269	* some other match criteria.
248	*/	270	*/
249	else if (strstr (query_base_name (op, 1), cp))	271	else if (strstr (qbn1, cp))
250	retval = 12;	272	retval = 12;
251	else if (strstr (query_base_name (op, 0), cp))	273	else if (strstr (qbn0, cp))
252	retval = 12;	274	retval = 12;
253	else if (strstr (query_short_name (op), cp))	275	else if (strstr (qsn, cp))
254	retval = 12;	276	retval = 12;
255	/* Check against plural/non plural based on count. */	277	/* Check against plural/non plural based on count. */
256	else if (count > 1 && !strcasecmp (cp, op->name_pl))	278	else if (count > 1 && !strcasecmp (cp, op->name_pl))
257	retval = 6;	279	retval = 6;
258	else if (count == 1 && !strcasecmp (op->name, cp))	280	else if (count == 1 && !strcasecmp (op->name, cp))
259	retval = 6;	281	retval = 6;
260	/* base name matched - not bad */	282	/* base name matched - not bad */
261	else if (strcasecmp (cp, op->name) == 0 && !count)	283	else if (strcasecmp (cp, op->name) == 0 && !count)
262	retval = 4;	284	retval = 4;
263	/* Check for partial custom name, but give a real low priority */	285	/* Check for partial custom name, but give a real low priority */
264	else if (op->custom_name && strstr (op->custom_name, cp))	286	else if (op->custom_name.contains (cp))
265	retval = 3;	287	retval = 3;
266		288
267	if (retval)	289	if (retval)
268	{	290	{
269	if (pl->type == PLAYER)	291	if (pl->type == PLAYER)
…		…
274	}	296	}
275		297
276	return 0;	298	return 0;
277	}	299	}
278		300
279	/*	301	//-GPL
280	* Initialises the internal linked list of archetypes (read from file).
281	* Then the global "empty_archetype" pointer is initialised.
282	* Then the blocksview[] array is initialised.
283	*/
284		302
285	void	303	void
286	init_archetypes (void)	304	archetype::do_delete ()
287	{ /* called from add_player() and edit() */	305	{
288	if (first_archetype != NULL) /* Only do this once */	306	delete this;
289	return;
290
291	arch_init = 1;
292	load_archetypes ();
293	arch_init = 0;
294	empty_archetype = archetype::find ("empty_archetype");
295
296	/* init_blocksview();*/
297	}	307	}
298		308
299	/*	309	archetype::archetype (const char *name)
300	* An alternative way to init the hashtable which is slower, but _works_...	310	{
301	*/	311	arch = this;
		312	this->archname = this->name = this->name_pl = name;
		313	}
		314
		315	archetype::~archetype ()
		316	{
		317	unlink ();
		318	}
		319
302	void	320	void
303	init_archetable (void)	321	archetype::link ()
304	{	322	{
305	archetype *at;	323	if (!archetypes.contains (this))
306		324	{
307	LOG (llevDebug, " Setting up archetable...\n");	325	archetypes.insert (this);
308		326	ht.insert (std::make_pair (archname, this));
309	for (at = first_archetype; at; at = at->more ? at->more : at->next)	327	}
310	at->hash_add ();
311
312	LOG (llevDebug, "done\n");
313	}	328	}
314		329
315	void	330	void
316	free_all_archs (void)	331	archetype::unlink ()
317	{	332	{
318	archetype at, next;	333	if (archetypes.contains (this))
319	int i = 0, f = 0;
320
321	for (at = first_archetype; at; at = next)
322	{
323	if (at->more)
324	next = at->more;
325	else
326	next = at->next;
327
328	delete
329	at;
330
331	i++;
332	}	334	{
333		335	archetypes.erase (this);
334	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);	336	ht.erase (archname);
335	}
336
337	archetype::archetype ()
338	{
339	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
340	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
341	}
342
343	archetype::~archetype ()
344	{
345	}
346
347	/*
348	* Reads/parses the archetype-file, and copies into a linked list
349	* of archetype-structures.
350	*/
351	void
352	first_arch_pass (object_thawer & fp)
353	{
354	archetype head = 0, last_more = 0;
355
356	archetype *at = new archetype;
357	at->clone.arch = first_archetype = at;
358
359	while (int i = load_object (fp, &at->clone, 0))
360	{	337	}
361	at->clone.speed_left = (float) (-0.1);
362	/* copy the body_info to the body_used - this is only really
363	* need for monsters, but doesn't hurt to do it for everything.
364	* by doing so, when a monster is created, it has good starting
365	* values for the body_used info, so when items are created
366	* for it, they can be properly equipped.
367	*/
368	memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
369
370	switch (i)
371	{
372	case LL_NORMAL: /* A new archetype, just link it with the previous */
373	if (last_more != NULL)
374	last_more->next = at;
375	if (head != NULL)
376	head->next = at;
377	head = last_more = at;
378	#if 0
379	if (!op->type)
380	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
381	#endif
382	at->tail_x = 0;
383	at->tail_y = 0;
384	break;
385
386	case LL_MORE: /* Another part of the previous archetype, link it correctly */
387
388	at->head = head;
389	at->clone.head = &head->clone;
390	if (last_more != NULL)
391	{
392	last_more->more = at;
393	last_more->clone.more = &at->clone;
394	}
395	last_more = at;
396
397	/* If this multipart image is still composed of individual small
398	* images, don't set the tail_.. values. We can't use them anyways,
399	* and setting these to zero makes the map sending to the client much
400	* easier as just looking at the head, we know what to do.
401	*/
402	if (at->clone.face != head->clone.face)
403	{
404	head->tail_x = 0;
405	head->tail_y = 0;
406	}
407	else
408	{
409	if (at->clone.x > head->tail_x)
410	head->tail_x = at->clone.x;
411	if (at->clone.y > head->tail_y)
412	head->tail_y = at->clone.y;
413	}
414	break;
415
416	}
417
418	at = new archetype;
419
420	at->clone.arch = at;
421	}
422
423	delete at;
424	}
425
426	/*
427	* Reads the archetype file once more, and links all pointers between
428	* archetypes.
429	*/
430
431	void
432	second_arch_pass (object_thawer & thawer)
433	{
434	char buf[MAX_BUF], variable = buf, argument, *cp;
435	archetype at = NULL, other;
436
437	while (fgets (buf, MAX_BUF, thawer) != NULL)
438	{
439	if (*buf == '#')
440	continue;
441	if ((argument = strchr (buf, ' ')) != NULL)
442	{
443	*argument = '\0', argument++;
444	cp = argument + strlen (argument) - 1;
445	while (isspace (*cp))
446	{
447	*cp = '\0';
448	cp--;
449	}
450	}
451	if (!strcmp ("object", variable))
452	{
453	if ((at = archetype::find (argument)) == NULL)
454	LOG (llevError, "Warning: failed to find arch %s\n", argument);
455	}
456	else if (!strcmp ("other_arch", variable))
457	{
458	if (at != NULL && at->clone.other_arch == NULL)
459	{
460	if ((other = archetype::find (argument)) == NULL)
461	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
462	else if (at != NULL)
463	at->clone.other_arch = other;
464	}
465	}
466	else if (!strcmp ("randomitems", variable))
467	{
468	if (at != NULL)
469	{
470	treasurelist *tl = find_treasurelist (argument);
471
472	if (tl == NULL)
473	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
474	else
475	at->clone.randomitems = tl;
476	}
477	}
478	}
479	}
480
481	#ifdef DEBUG
482	void
483	check_generators (void)
484	{
485	archetype *at;
486
487	for (at = first_archetype; at != NULL; at = at->next)
488	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
489	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
490	}
491	#endif
492
493	/*
494	* First initialises the archtype hash-table (init_archetable()).
495	* Reads and parses the archetype file (with the first and second-pass
496	* functions).
497	* Then initialises treasures by calling load_treasures().
498	*/
499
500	void
501	load_archetypes (void)
502	{
503	char filename[MAX_BUF];
504
505	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
506	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
507
508	{
509	object_thawer
510	thawer (filename);
511
512	LOG (llevDebug, " arch-pass 1...\n");
513	first_arch_pass (thawer);
514	LOG (llevDebug, " done\n");
515	}
516
517	init_archetable ();
518	warn_archetypes = 1;
519
520	{
521	object_thawer
522	thawer (filename);
523
524	LOG (llevDebug, " loading treasure...\n");
525	load_treasures ();
526	LOG (llevDebug, " done\n");
527	LOG (llevDebug, " arch-pass 2...\n");
528	second_arch_pass (thawer);
529	LOG (llevDebug, " done\n");
530	#ifdef DEBUG
531	check_generators ();
532	#endif
533	}
534	LOG (llevDebug, " done\n");
535	}
536
537	/*
538	* Creates and returns a new object which is a copy of the given archetype.
539	* This function returns NULL on failure.
540	*/
541	object *
542	arch_to_object (archetype *at)
543	{
544	object *op;
545
546	if (at == NULL)
547	{
548	if (warn_archetypes)
549	LOG (llevError, "Couldn't find archetype.\n");
550
551	return NULL;
552	}
553
554	op = at->clone.clone ();
555	op->arch = at;
556	op->instantiate ();
557	return op;
558	}
559
560	/*
561	* Creates an object. This function is called by get_archetype()
562	* if it fails to find the appropriate archetype.
563	* Thus get_archetype() will be guaranteed to always return
564	* an object, and never NULL.
565	*/
566	object *
567	create_singularity (const char *name)
568	{
569	object *op;
570	char buf[MAX_BUF];
571
572	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
573	op = object::create ();
574	op->name = op->name_pl = buf;
575	SET_FLAG (op, FLAG_NO_PICK);
576	return op;
577	}
578
579	/*
580	* Finds which archetype matches the given name, and returns a new
581	* object containing a copy of the archetype.
582	*/
583	object *
584	get_archetype (const char *name)
585	{
586	archetype *at = archetype::find (name);
587
588	if (!at)
589	return create_singularity (name);
590
591	return arch_to_object (at);
592	}
593
594	/*
595	* Hash-function used by the arch-hashtable.
596	*/
597
598	unsigned long
599	hasharch (const char *str, int tablesize)
600	{
601	unsigned long hash = 0;
602	unsigned int i = 0;
603	const char *p;
604
605	/* use the one-at-a-time hash function, which supposedly is
606	* better than the djb2-like one used by perl5.005, but
607	* certainly is better then the bug used here before.
608	* see http://burtleburtle.net/bob/hash/doobs.html
609	*/
610	for (p = str; i < MAXSTRING && *p; p++, i++)
611	{
612	hash += *p;
613	hash += hash << 10;
614	hash ^= hash >> 6;
615	}
616
617	hash += hash << 3;
618	hash ^= hash >> 11;
619	hash += hash << 15;
620
621	return hash % tablesize;
622	}	338	}
623		339
624	/*	340	/*
625	* Finds, using the hashtable, which archetype matches the given name.	341	* Finds, using the hashtable, which archetype matches the given name.
626	* returns a pointer to the found archetype, otherwise NULL.	342	* returns a pointer to the found archetype, otherwise NULL.
…		…
629	archetype::find (const char *name)	345	archetype::find (const char *name)
630	{	346	{
631	if (!name)	347	if (!name)
632	return 0;	348	return 0;
633		349
634	AUTODECL (i, ht.find (name));	350	auto (i, ht.find (name));
635		351
636	if (i == ht.end ())	352	if (i == ht.end ())
637	return 0;	353	return 0;
638	else	354	else
639	return i->second;	355	return i->second;
640	}	356	}
641		357
		358	void
		359	archetype::post_load_check ()
		360	{
		361	assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
		362
		363	if (type == SKILL)
		364	add_skill_archetype (this);
		365
		366	object::post_load_check ();
		367	}
		368
		369	archetype *
		370	archetype::read (object_thawer &f)
		371	{
		372	assert (f.kw == KW_object);
		373
		374	std::vector<archetype *> parts;
		375
		376	coroapi::cede_to_tick ();
		377
		378	for (;;)
		379	{
		380	archetype *at = new archetype (f.get_str ());
		381
		382	f.next ();
		383
		384	#if 0
		385	// implementing it here in the server does neither allow multiple inheritence
		386	// nor does it cleanly "just override". it would allow use in map files, though,
		387	// and other resource files dynamically loaded (as opposed to being preprocessed).
		388	// not that any of this is relevant as of yet...
		389	if (f.kw == KW_inherit)
		390	{
		391	if (archetype *at = find (f.get_str ()))
		392	*op = at->clone;
		393	else
		394	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		395	&at->archname, f.get_str ());
		396
		397	f.next ();
		398	}
		399	#endif
		400
		401	loading_arch = at; // hack to tell parse_kv et al. to behave
		402	bool parse_ok = at->parse_kv (f);
		403	loading_arch = 0;
		404
		405	if (!parse_ok)
		406	goto fail;
		407
		408	loading_arch = at; // hack to tell parse_kv et al. to behave
		409	at->post_load_check ();
		410	loading_arch = 0;
		411
		412	parts.push_back (at);
		413
		414	if (f.kw != KW_more)
		415	break;
		416
		417	f.next ();
		418
		419	if (f.kw != KW_object)
		420	{
		421	f.parse_error ("more object");
		422	goto fail;
		423	}
		424	}
		425
		426	{
		427	auto (at, parts.begin ());
		428
		429	archetype *new_head = parts.front ();
		430	archetype *old_head = find (new_head->archname);
		431
		432	if (old_head && !old_head->is_head ())
		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	}
		438
		439	// check that all archetypes belong to the same old object or are new
		440	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		441	{
		442	archetype new_part = at;
		443	archetype *old_part = find (new_part->archname);
		444
		445	if (old_part && old_part->head_ () != old_head)
		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 (p, parts.begin ()); p != parts.end (); ++p)
		483	(*p)->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 (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
		500	{
		501	archetype at = p;
		502
		503	if (archetype *old = find (at->archname))
		504	old->unlink ();
		505
		506	allarch.push_back (at);
		507
		508	at->link ();
		509	++dirtycnt;
		510	}
		511
		512	postponed_arch.clear ();
		513
		514	// now resolve arch references
		515	for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
		516	{
		517	arch_ptr *ap = p->first;
		518	archetype *at = find (p->second);
		519
		520	if (!at)
		521	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		522
		523	*ap = at;
		524	}
		525
		526	postponed_arch_ref.clear ();
		527
		528	empty = find (shstr_empty_archetype);
		529	}
		530
		531	void
		532	archetype::gc ()
		533	{
		534	int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt));
		535	dirtycnt = max (0, dirtycnt - cnt);
		536
		537	do
		538	{
		539	static int idx;
		540
		541	if (idx >= allarch.size ())
		542	if (idx)
		543	idx = 0;
		544	else
		545	return;
		546
		547	archetype *at = allarch [idx];
		548
		549	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
		550	++idx;
		551	else
		552	{
		553	//LOG (llevDebug, "garbage collect arch %s", &at->archname);
		554	assert (at->arch == at); // verify that refcnt == 1 is truly valid
		555	allarch.erase (idx);
		556
		557	// break chain
		558	for (object *op = at->head_ (); op; )
		559	{
		560	object *next = op->more;
		561	op->head = 0;
		562	op->more = 0;
		563	op = next;
		564	}
		565
		566	at->destroy ();
		567	at->arch = 0;
		568	}
		569	}
		570	while (--cnt);
		571	}
		572
		573	object *
		574	archetype::instance ()
		575	{
		576	object *op = clone ();
		577	op->instantiate ();
		578	return op;
		579	}
		580
		581	//+GPL
		582
642	/*	583	/*
643	* Adds an archetype to the hashtable.	584	* Finds which archetype matches the given name, and returns a new
		585	* object containing a copy of the archetype.
644	*/	586	*/
645	void	587	object *
646	archetype::hash_add ()	588	archetype::get (const char *name)
647	{	589	{
648	ht.insert (std::make_pair (name, this));	590	archetype *at = find (name);
649	}
650		591
651	void	592	if (!at)
652	archetype::hash_del ()	593	return create_singularity (name);
653	{	594
654	ht.erase (name);	595	return at->instance ();
655	}	596	}
656		597
657	/*	598	/*
658	* Returns the first archetype using the given type.	599	* Returns the first archetype using the given type.
659	* Used in treasure-generation.	600	* Used in treasure-generation.
660	*/	601	*/
661	archetype *	602	static archetype *
662	type_to_archetype (int type)	603	type_to_archetype (int type)
663	{	604	{
664	archetype *at;	605	for_all_archetypes (at)
665		606	if (at->type == type && at->head_ () != at)
666	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
667	if (at->clone.type == type)
668	return at;	607	return at;
669		608
670	return 0;	609	return 0;
671	}	610	}
672		611
673	/*	612	/*
674	* Returns a new object copied from the first archetype matching	613	* Returns a new object copied from the first archetype matching
675	* the given type.	614	* the given type.
676	* Used in treasure-generation.	615	* Used in treasure-generation.
677	*/	616	*/
678
679	object *	617	object *
680	clone_arch (int type)	618	clone_arch (int type)
681	{	619	{
682	archetype *at;	620	archetype *at = type_to_archetype (type);
683		621
684	if ((at = type_to_archetype (type)) == NULL)	622	if (!at)
685	{	623	{
686	LOG (llevError, "Can't clone archetype %d\n", type);	624	LOG (llevError, "Can't clone archetype %d\n", type);
687	return 0;	625	return 0;
688	}	626	}
689		627
690	object *op = at->clone.clone ();	628	return at->instance ();
691	op->instantiate ();
692	return op;
693	}	629	}
694		630
695	/*	631	/*
696	* member: make instance from class	632	* member: make instance from class
697	*/	633	*/
698
699	object *	634	object *
700	object_create_arch (archetype *at)	635	object_create_arch (archetype *at)
701	{	636	{
702	object op, prev = 0, *head = 0;	637	object op, prev = 0, *head = 0;
703		638
704	while (at)	639	while (at)
705	{	640	{
706	op = arch_to_object (at);	641	op = at->instance ();
		642
707	op->x = at->clone.x;	643	op->x = at->x;
708	op->y = at->clone.y;	644	op->y = at->y;
709		645
710	if (head)	646	if (head)
711	op->head = head, prev->more = op;	647	op->head = head, prev->more = op;
712		648
713	if (!head)	649	if (!head)
714	head = op;	650	head = op;
715		651
716	prev = op;	652	prev = op;
717	at = at->more;	653	at = (archetype *)at->more;
718	}	654	}
719		655
720	return (head);	656	return head;
721	}	657	}
722		658
		659	//-GPL
		660

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.41 by root, Thu Feb 8 03:09:31 2007 UTC vs. Revision 1.115 by root, Sat Nov 17 23:33:17 2018 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.41 by root, Thu Feb 8 03:09:31 2007 UTC vs.
Revision 1.115 by root, Sat Nov 17 23:33:17 2018 UTC