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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.80 by root, Sun May 4 18:46:01 2008 UTC vs.
Revision 1.115 by root, Sat Nov 17 23:33:17 2018 UTC

…		…
1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 (©) 2002,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* Deliantra 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 3 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	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	#include <cassert>	25	#include <cassert>
		26	#include <functional>
		27
		28	#include <flat_hash_map.hpp>
25		29
26	#include <global.h>	30	#include <global.h>
27	#include <loader.h>
28
29	#include <tr1/functional>
30	#include <tr1/unordered_map>
31		31
32	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing	32	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
33	arch_ptr archetype::empty;	33	arch_ptr archetype::empty;
34		34
35	// the hashtable	35	// the hashtable
36	typedef std::tr1::unordered_map	36	typedef ska::flat_hash_map<
37	<
38	const char *,	37	const char *,
39	arch_ptr,	38	arch_ptr,
40	str_hash,	39	str_hash,
41	str_equal,	40	str_equal,
42	slice_allocator< std::pair<const char *const, arch_ptr> >	41	slice_allocator< std::pair<const char *const, arch_ptr> >
43	> HT;	42	> HT;
44		43
45	static HT ht (10000);	44	static HT ht (10000);
46	archvec archetypes;	45	archvec archetypes;
47	static unordered_vector<archetype *> allarch;	46	static unordered_vector<archetype *> allarch;
48	static int dirtycnt;	47	static int dirtycnt;
49		48
50	// the vector of other_arch references to be resolved	49	// the vector of other_arch references to be resolved
51	static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;	50	static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
52	// the vector of loaded but not yet committed archetypes	51	// the vector of loaded but not yet committed archetypes
53	static std::vector<archetype *> postponed_arch;	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	}
54		75
55	/**	76	/**
56	* GROS - This function retrieves an archetype given the name that appears	77	* GROS - This function retrieves an archetype given the name that appears
57	* during the game (for example, "writing pen" instead of "stylus").	78	* during the game (for example, "writing pen" instead of "stylus").
58	* 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.
140	*/	161	*/
141	object *	162	object *
142	get_archetype_by_object_name (const char *name)	163	get_archetype_by_object_name (const char *name)
143	{	164	{
144	char tmpname[MAX_BUF];	165	char tmpname[MAX_BUF];
145	int i;
146		166
147	assign (tmpname, name);	167	assign (tmpname, name);
148		168
149	for (i = strlen (tmpname); i > 0; i--)	169	for (int i = strlen (tmpname); i > 0; i--)
150	{	170	{
151	tmpname[i] = 0;	171	tmpname[i] = 0;
152		172
153	if (archetype *at = find_archetype_by_object_name (tmpname))	173	if (archetype *at = find_archetype_by_object_name (tmpname))
154	return at->instance ();	174	return at->instance ();
…		…
191	/* All is a very generic match - low match value */	211	/* All is a very generic match - low match value */
192	if (!strcmp (cp, "all"))	212	if (!strcmp (cp, "all"))
193	return 1;	213	return 1;
194		214
195	/* unpaid is a little more specific */	215	/* unpaid is a little more specific */
196	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))	216	if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID])
197	return 2;	217	return 2;
198	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]))
199	return 2;	220	return 2;
200		221
201	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))	222	if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED])
202	return 2;	223	return 2;
203		224
204	/* Allow for things like '100 arrows' */	225	/* Allow for things like '100 arrows' */
205	if ((count = atoi (cp)) != 0)	226	if ((count = atoi (cp)) != 0)
206	{	227	{
…		…
224	* 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
225	* 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
226	* 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
227	* match first, and work downward.	248	* match first, and work downward.
228	*/	249	*/
		250	const char qbn0, qbn1, *qsn; // query base name/short name caches
		251
229	if (!strcasecmp (cp, query_name (op)))	252	if (!strcasecmp (cp, query_name (op)))
230	retval = 20;	253	retval = 20;
231	else if (!strcasecmp (cp, query_short_name (op)))	254	else if (!strcasecmp (cp, qsn = query_short_name (op)))
232	retval = 18;	255	retval = 18;
233	else if (!strcasecmp (cp, query_base_name (op, 0)))	256	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
234	retval = 16;	257	retval = 16;
235	else if (!strcasecmp (cp, query_base_name (op, 1)))	258	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
236	retval = 16;	259	retval = 16;
237	else if (op->custom_name && !strcasecmp (cp, op->custom_name))	260	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
238	retval = 15;	261	retval = 15;
239	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))	262	else if (!strncasecmp (cp, qbn0, strlen (cp)))
240	retval = 14;	263	retval = 14;
241	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))	264	else if (!strncasecmp (cp, qbn1, strlen (cp)))
242	retval = 14;	265	retval = 14;
243	/* Do substring checks, so things like 'Str+1' will match.	266	/* Do substring checks, so things like 'Str+1' will match.
244	* retval of these should perhaps be lower - they are lower	267	* retval of these should perhaps be lower - they are lower
245	* then the specific strcasecmp aboves, but still higher than	268	* then the specific strcasecmp aboves, but still higher than
246	* some other match criteria.	269	* some other match criteria.
247	*/	270	*/
248	else if (strstr (query_base_name (op, 1), cp))	271	else if (strstr (qbn1, cp))
249	retval = 12;	272	retval = 12;
250	else if (strstr (query_base_name (op, 0), cp))	273	else if (strstr (qbn0, cp))
251	retval = 12;	274	retval = 12;
252	else if (strstr (query_short_name (op), cp))	275	else if (strstr (qsn, cp))
253	retval = 12;	276	retval = 12;
254	/* Check against plural/non plural based on count. */	277	/* Check against plural/non plural based on count. */
255	else if (count > 1 && !strcasecmp (cp, op->name_pl))	278	else if (count > 1 && !strcasecmp (cp, op->name_pl))
256	retval = 6;	279	retval = 6;
257	else if (count == 1 && !strcasecmp (op->name, cp))	280	else if (count == 1 && !strcasecmp (op->name, cp))
258	retval = 6;	281	retval = 6;
259	/* base name matched - not bad */	282	/* base name matched - not bad */
260	else if (strcasecmp (cp, op->name) == 0 && !count)	283	else if (strcasecmp (cp, op->name) == 0 && !count)
261	retval = 4;	284	retval = 4;
262	/* Check for partial custom name, but give a real low priority */	285	/* Check for partial custom name, but give a real low priority */
263	else if (op->custom_name && strstr (op->custom_name, cp))	286	else if (op->custom_name.contains (cp))
264	retval = 3;	287	retval = 3;
265		288
266	if (retval)	289	if (retval)
267	{	290	{
268	if (pl->type == PLAYER)	291	if (pl->type == PLAYER)
…		…
273	}	296	}
274		297
275	return 0;	298	return 0;
276	}	299	}
277		300
		301	//-GPL
		302
		303	void
		304	archetype::do_delete ()
		305	{
		306	delete this;
		307	}
		308
278	archetype::archetype (const char *name)	309	archetype::archetype (const char *name)
279	{	310	{
280	arch = this;	311	arch = this;
281	this->archname = this->name = this->name_pl = name;	312	this->archname = this->name = this->name_pl = name;
282	}	313	}
…		…
322	return 0;	353	return 0;
323	else	354	else
324	return i->second;	355	return i->second;
325	}	356	}
326		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
327	archetype *	369	archetype *
328	archetype::read (object_thawer &f)	370	archetype::read (object_thawer &f)
329	{	371	{
330	assert (f.kw == KW_object);	372	assert (f.kw == KW_object);
331		373
…		…
340	f.next ();	382	f.next ();
341		383
342	#if 0	384	#if 0
343	// implementing it here in the server does neither allow multiple inheritence	385	// implementing it here in the server does neither allow multiple inheritence
344	// nor does it cleanly "just override". it would allow use in map files, though,	386	// nor does it cleanly "just override". it would allow use in map files, though,
345	// and other resource files dynamically laoded (as opposed to being preprocessed).	387	// and other resource files dynamically loaded (as opposed to being preprocessed).
346	// not that any of this is relevant as of yet...	388	// not that any of this is relevant as of yet...
347	if (f.kw == KW_inherit)	389	if (f.kw == KW_inherit)
348	{	390	{
349	if (archetype *at = find (f.get_str ()))	391	if (archetype *at = find (f.get_str ()))
350	*op = at->clone;	392	*op = at->clone;
…		…
407	goto fail;	449	goto fail;
408	}	450	}
409	}	451	}
410		452
411	// assemble new chain	453	// assemble new chain
412	new_head->min_x = new_head->max_x = new_head->x;	454	new_head->max_x = new_head->x;
413	new_head->min_y = new_head->max_y = new_head->y;
414		455
415	archetype *less = new_head;	456	archetype *less = new_head;
416	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)	457	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
417	{	458	{
418	archetype at = p;	459	archetype at = p;
…		…
423	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];	464	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
424	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];	465	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
425	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];	466	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
426	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];	467	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
427		468
428	new_head->min_x = min (new_head->min_x, at->x);
429	new_head->min_y = min (new_head->min_y, at->y);
430	new_head->max_x = max (new_head->max_x, at->x);	469	new_head->max_x = max (new_head->max_x, at->x);
431	new_head->max_y = max (new_head->max_y, at->y);
432		470
433	at->head = new_head;	471	at->head = new_head;
434	less->more = at;	472	less->more = at;
435	less = at;	473	less = at;
436	}	474	}
…		…
440	return new_head;	478	return new_head;
441	}	479	}
442		480
443	fail:	481	fail:
444	for (auto (p, parts.begin ()); p != parts.end (); ++p)	482	for (auto (p, parts.begin ()); p != parts.end (); ++p)
445	(*p)->destroy (true);	483	(*p)->destroy ();
446		484
447	return 0;	485	return 0;
448	}	486	}
449		487
450	void	488	void
…		…
491	}	529	}
492		530
493	void	531	void
494	archetype::gc ()	532	archetype::gc ()
495	{	533	{
496	int cnt = max (1, min (allarch.size () / 128, dirtycnt));	534	int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt));
497	dirtycnt = max (0, dirtycnt - cnt);	535	dirtycnt = max (0, dirtycnt - cnt);
498		536
499	do	537	do
500	{	538	{
501	static int idx;	539	static int idx;
…		…
510		548
511	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object	549	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
512	++idx;	550	++idx;
513	else	551	else
514	{	552	{
515	LOG (llevDebug, "garbage collect arch %s", at->debug_desc ());	553	//LOG (llevDebug, "garbage collect arch %s", &at->archname);
516	assert (at->arch == at); // verify that refcnt == 1 is truly valid	554	assert (at->arch == at); // verify that refcnt == 1 is truly valid
517	allarch.erase (idx);	555	allarch.erase (idx);
518		556
519	// break chain	557	// break chain
520	for (object *op = at->head_ (); op; )	558	for (object *op = at->head_ (); op; )
…		…
530	}	568	}
531	}	569	}
532	while (--cnt);	570	while (--cnt);
533	}	571	}
534		572
535	/*
536	* Creates and returns a new object which is a copy of the given archetype.
537	* This function returns NULL on failure.
538	*/
539	object *
540	arch_to_object (archetype *at)
541	{
542	if (!at)
543	{
544	LOG (llevError, "Couldn't find archetype.\n");
545	return 0;
546	}
547
548	return at->instance ();
549	}
550
551	object *	573	object *
552	archetype::instance ()	574	archetype::instance ()
553	{	575	{
554	object *op = clone ();	576	object *op = clone ();
555	op->instantiate ();	577	op->instantiate ();
556	return op;	578	return op;
557	}	579	}
558		580
559	/*	581	//+GPL
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	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
569
570	if (!strcmp (name, "bug"))
571	abort ();
572
573	object *op = archetype::get ("bug");
574	op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
575
576	return op;
577	}
578		582
579	/*	583	/*
580	* Finds which archetype matches the given name, and returns a new	584	* Finds which archetype matches the given name, and returns a new
581	* object containing a copy of the archetype.	585	* object containing a copy of the archetype.
582	*/	586	*/
583	object *	587	object *
584	get_archetype (const char *name)
585	{
586	return archetype::get (name);
587	}
588
589	object *
590	archetype::get (const char *name)	588	archetype::get (const char *name)
591	{	589	{
592	archetype *at = find (name);	590	archetype *at = find (name);
593		591
594	if (!at)	592	if (!at)
…		…
599		597
600	/*	598	/*
601	* Returns the first archetype using the given type.	599	* Returns the first archetype using the given type.
602	* Used in treasure-generation.	600	* Used in treasure-generation.
603	*/	601	*/
604	archetype *	602	static archetype *
605	type_to_archetype (int type)	603	type_to_archetype (int type)
606	{	604	{
607	for_all_archetypes (at)	605	for_all_archetypes (at)
608	if (at->type == type && at->head_ () != at)	606	if (at->type == type && at->head_ () != at)
609	return at;	607	return at;
…		…
656	}	654	}
657		655
658	return head;	656	return head;
659	}	657	}
660		658
		659	//-GPL
		660

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.80 by root, Sun May 4 18:46:01 2008 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.80 by root, Sun May 4 18:46:01 2008 UTC vs.
Revision 1.115 by root, Sat Nov 17 23:33:17 2018 UTC