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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.7 by root, Tue Aug 29 08:01:35 2006 UTC vs.
Revision 1.115 by root, Sat Nov 17 23:33:17 2018 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.7 by root, Tue Aug 29 08:01:35 2006 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.7 by root, Tue Aug 29 08:01:35 2006 UTC vs.
Revision 1.115 by root, Sat Nov 17 23:33:17 2018 UTC