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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.43 by root, Fri Feb 16 19:43:40 2007 UTC vs.
Revision 1.117 by root, Sun Nov 18 00:37:11 2018 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.43 by root, Fri Feb 16 19:43:40 2007 UTC vs. Revision 1.117 by root, Sun Nov 18 00:37:11 2018 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.43 by root, Fri Feb 16 19:43:40 2007 UTC vs.
Revision 1.117 by root, Sun Nov 18 00:37:11 2018 UTC