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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.8 by root, Wed Aug 30 06:06:26 2006 UTC vs.
Revision 1.109 by root, Sat Dec 31 06:18:00 2011 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.8 2006/08/30 06:06:26 root Exp $";	3	*
		4	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011 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>
4	*/	23	*/
		24
		25	#include <cassert>
		26
		27	#include <global.h>
		28
		29	#include <tr1/functional>
		30	#include <tr1/unordered_map>
		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 std::tr1::unordered_map
		37	<
		38	const char *,
		39	arch_ptr,
		40	str_hash,
		41	str_equal,
		42	slice_allocator< std::pair<const char *const, arch_ptr> >
		43	> HT;
		44
		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
5		56
6	/*	57	/*
7	CrossFire, A Multiplayer game for X-windows	58	* Creates an object. This function is called by archetype::get ()
8		59	* if it fails to find the appropriate archetype.
9	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	60	* Thus archetype::get() will be guaranteed to always return
10	Copyright (C) 1992 Frank Tore Johansen	61	* 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	*/	62	*/
		63	static object *
		64	create_singularity (const char *name)
		65	{
		66	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
28		67
29	#include <global.h>	68	if (!strcmp (name, "bug"))
30	#include <arch.h>	69	abort ();
31	#include <funcpoint.h>
32	#include <loader.h>
33		70
34	#include <cassert>	71	object *op = archetype::get (shstr_bug);
		72	op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
35		73
36	/* IF set, does a little timing on the archetype load. */	74	return op;
37	#define TIME_ARCH_LOAD 0	75	}
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		76
54	/**	77	/**
55	* GROS - This function retrieves an archetype given the name that appears	78	* GROS - This function retrieves an archetype given the name that appears
56	* during the game (for example, "writing pen" instead of "stylus").	79	* 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.	80	* It does not use the hashtable system, but browse the whole archlist each time.
60	* Params:	83	* Params:
61	* - name: the name we're searching for (ex: "writing pen");	84	* - name: the name we're searching for (ex: "writing pen");
62	* Return value:	85	* Return value:
63	* - the archetype found or null if nothing was found.	86	* - the archetype found or null if nothing was found.
64	*/	87	*/
		88	archetype *
65	archetype find_archetype_by_object_name(const char name) {	89	find_archetype_by_object_name (const char *name)
66	archetype *at;	90	{
		91	shstr_cmp name_cmp (name);
67		92
68	if (name == NULL)	93	for_all_archetypes (at)
69	return (archetype *) NULL;	94	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;	95	return at;
74	}	96
75	return NULL;	97	return 0;
76	}	98	}
77		99
78	/**	100	/**
79	* This function retrieves an archetype by type and name that appears during	101	* 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()	102	* the game. It is basically the same as find_archetype_by_object_name()
81	* except that it considers only items of the given type.	103	* except that it considers only items of the given type.
82	*/	104	*/
		105	archetype *
83	archetype find_archetype_by_object_type_name(int type, const char name) {	106	find_archetype_by_object_type_name (int type, const char *name)
84	archetype *at;	107	{
		108	shstr_cmp name_cmp (name);
85		109
86	if (name == NULL)	110	for_all_archetypes (at)
87	return NULL;	111	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;	112	return at;
92	}
93		113
94	return NULL;	114	return 0;
95	}	115	}
96		116
97	/* This is a lot like the above function. Instead, we are trying to match	117	/* 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	118	* 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).	119	* against (eg, to only match against skills or only skill objects for example).
100	* If type is -1, ew don't match on type.	120	* If type is -1, ew don't match on type.
101	*/	121	*/
		122	object *
102	object get_archetype_by_skill_name(const char skill, int type) {	123	get_archetype_by_skill_name (const char *skill, int type)
103	archetype *at;	124	{
		125	shstr_cmp skill_cmp (skill);
104		126
105	if (skill == NULL)	127	for_all_archetypes (at)
106	return NULL;	128	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
		129	return at->instance ();
107		130
108	for(at = first_archetype;at!=NULL;at=at->next) {	131	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	}	132	}
115		133
116	/* similiar to above - this returns the first archetype	134	/* similiar to above - this returns the first archetype
117	* that matches both the type and subtype. type and subtype	135	* 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	136	* 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	137	* may not be very useful. This function is most useful when
120	* subtypes are known to be unique for a particular type	138	* subtypes are known to be unique for a particular type
121	* (eg, skills)	139	* (eg, skills)
122	*/	140	*/
		141	archetype *
123	archetype *get_archetype_by_type_subtype(int type, int subtype) {	142	get_archetype_by_type_subtype (int type, int subtype)
124	archetype *at;	143	{
125		144	for_all_archetypes (at)
126	for(at = first_archetype;at!=NULL;at=at->next) {	145	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;	146	return at;
130	}	147
131	return NULL;	148	return 0;
132	}	149	}
133		150
134	/**	151	/**
135	* GROS - this returns a new object given the name that appears during the game	152	* GROS - this returns a new object given the name that appears during the game
136	* (for example, "writing pen" instead of "stylus").	153	* (for example, "writing pen" instead of "stylus").
…		…
138	* - name: The name we're searching for (ex: "writing pen");	155	* - name: The name we're searching for (ex: "writing pen");
139	* Return value:	156	* Return value:
140	* - a corresponding object if found; a singularity object if not found.	157	* - 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	158	* 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	159	* 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,	160	* doesn't allocate it each time - not that this function is used much,
144	* but it otherwise had a big memory leak.	161	* but it otherwise had a big memory leak.
145	*/	162	*/
		163	object *
146	object get_archetype_by_object_name(const char name) {	164	get_archetype_by_object_name (const char *name)
147	archetype *at;	165	{
148	char tmpname[MAX_BUF];	166	char tmpname[MAX_BUF];
149	int i;
150		167
151	strncpy(tmpname,name,MAX_BUF-1);	168	assign (tmpname, name);
152	tmpname[MAX_BUF-1] = 0;	169
153	for(i=strlen(tmpname); i>0; i--) {	170	for (int i = strlen (tmpname); i > 0; i--)
		171	{
154	tmpname[i] = 0;	172	tmpname[i] = 0;
		173
155	at = find_archetype_by_object_name(tmpname);	174	if (archetype *at = find_archetype_by_object_name (tmpname))
156	if (at !=NULL)	175	return at->instance ();
		176	}
		177
		178	return create_singularity (name);
		179	}
		180
		181	/* This is a subset of the parse_id command. Basically, name can be
		182	* a string seperated lists of things to match, with certain keywords.
		183	* pl is the player (only needed to set count properly)
		184	* op is the item we are trying to match. Calling function takes care
		185	* of what action might need to be done and if it is valid
		186	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
		187	* value means a better match. 0 means no match.
		188	*
		189	* Brief outline of the procedure:
		190	* We take apart the name variable into the individual components.
		191	* cases for 'all' and unpaid are pretty obvious.
		192	* Next, we check for a count (either specified in name, or in the
		193	* player object.)
		194	* If count is 1, make a quick check on the name.
		195	* IF count is >1, we need to make plural name. Return if match.
		196	* Last, make a check on the full name.
		197	*/
		198	int
		199	item_matched_string (object pl, object op, const char *name)
		200	{
		201	char *cp, local_name[MAX_BUF];
		202	int count, retval = 0;
		203
		204	assign (local_name, name); /* strtok is destructive to name */
		205
		206	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
		207	{
		208	while (cp[0] == ' ')
		209	++cp; /* get rid of spaces */
		210
		211	/* LOG(llevDebug,"Trying to match %s\n", cp); */
		212	/* All is a very generic match - low match value */
		213	if (!strcmp (cp, "all"))
		214	return 1;
		215
		216	/* unpaid is a little more specific */
		217	if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID])
		218	return 2;
		219
		220	if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] \|\| op->flag [FLAG_DAMNED]))
		221	return 2;
		222
		223	if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED])
		224	return 2;
		225
		226	/* Allow for things like '100 arrows' */
		227	if ((count = atoi (cp)) != 0)
157	{	228	{
158	return arch_to_object(at);	229	cp = strchr (cp, ' ');
		230	while (cp && cp[0] == ' ')
		231	++cp; /* get rid of spaces */
159	}	232	}
160	}	233	else
161	return create_singularity(name);	234	{
162	}	235	if (pl->type == PLAYER)
163		236	count = pl->contr->count;
164	/* This is a subset of the parse_id command. Basically, name can be	237	else
165	* a string seperated lists of things to match, with certain keywords.	238	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	}	239	}
		240
		241	if (!cp \|\| cp[0] == '\0' \|\| count < 0)
		242	return 0;
		243
		244
		245	/* The code here should go from highest retval to lowest. That
		246	* is because of the 'else' handling - we don't want to match on
		247	* something and set a low retval, even though it may match a higher retcal
		248	* later. So keep it in descending order here, so we try for the best
		249	* match first, and work downward.
		250	*/
		251	const char qbn0, qbn1, *qsn; // query base name/short name caches
		252
		253	if (!strcasecmp (cp, query_name (op)))
		254	retval = 20;
		255	else if (!strcasecmp (cp, qsn = query_short_name (op)))
		256	retval = 18;
		257	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
		258	retval = 16;
		259	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
		260	retval = 16;
		261	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
		262	retval = 15;
		263	else if (!strncasecmp (cp, qbn0, strlen (cp)))
		264	retval = 14;
		265	else if (!strncasecmp (cp, qbn1, strlen (cp)))
		266	retval = 14;
		267	/* Do substring checks, so things like 'Str+1' will match.
		268	* retval of these should perhaps be lower - they are lower
		269	* then the specific strcasecmp aboves, but still higher than
		270	* some other match criteria.
		271	*/
		272	else if (strstr (qbn1, cp))
		273	retval = 12;
		274	else if (strstr (qbn0, cp))
		275	retval = 12;
		276	else if (strstr (qsn, cp))
		277	retval = 12;
		278	/* Check against plural/non plural based on count. */
		279	else if (count > 1 && !strcasecmp (cp, op->name_pl))
		280	retval = 6;
		281	else if (count == 1 && !strcasecmp (op->name, cp))
		282	retval = 6;
		283	/* base name matched - not bad */
		284	else if (strcasecmp (cp, op->name) == 0 && !count)
		285	retval = 4;
		286	/* Check for partial custom name, but give a real low priority */
		287	else if (op->custom_name.contains (cp))
		288	retval = 3;
		289
		290	if (retval)
208	else {	291	{
209	if (pl->type==PLAYER)	292	if (pl->type == PLAYER)
210	count=pl->contr->count;	293	pl->contr->count = count;
211	else	294
212	count = 0;	295	return retval;
213	}	296	}
		297	}
214		298
215	if (!cp \|\| cp[0]=='\0' \|\| count<0) return 0;	299	return 0;
		300	}
216		301
		302	//-GPL
217		303
218	/* The code here should go from highest retval to lowest. That	304	void
219	* is because of the 'else' handling - we don't want to match on	305	archetype::do_delete ()
220	* something and set a low retval, even though it may match a higher retcal	306	{
221	* later. So keep it in descending order here, so we try for the best	307	delete this;
222	* match first, and work downward.	308	}
		309
		310	archetype::archetype (const char *name)
		311	{
		312	arch = this;
		313	this->archname = this->name = this->name_pl = name;
		314	}
		315
		316	archetype::~archetype ()
		317	{
		318	unlink ();
		319	}
		320
		321	void
		322	archetype::link ()
		323	{
		324	if (!archetypes.contains (this))
		325	{
		326	archetypes.insert (this);
		327	ht.insert (std::make_pair (archname, this));
		328	}
		329	}
		330
		331	void
		332	archetype::unlink ()
		333	{
		334	if (archetypes.contains (this))
		335	{
		336	archetypes.erase (this);
		337	ht.erase (archname);
		338	}
		339	}
		340
		341	/*
		342	* Finds, using the hashtable, which archetype matches the given name.
		343	* returns a pointer to the found archetype, otherwise NULL.
		344	*/
		345	archetype *
		346	archetype::find (const char *name)
		347	{
		348	if (!name)
		349	return 0;
		350
		351	auto (i, ht.find (name));
		352
		353	if (i == ht.end ())
		354	return 0;
		355	else
		356	return i->second;
		357	}
		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)
223	*/	391	{
224	if (!strcasecmp(cp,query_name(op))) retval=20;	392	if (archetype *at = find (f.get_str ()))
225	else if (!strcasecmp(cp,query_short_name(op))) retval=18;	393	*op = at->clone;
226	else if (!strcasecmp(cp,query_base_name(op,0))) retval=16;	394	else
227	else if (!strcasecmp(cp,query_base_name(op,1))) retval=16;	395	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;	396	&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		397
234	/* Do substring checks, so things like 'Str+1' will match.	398	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	}	399	}
247	else if (count==1 && !strcasecmp(op->name,cp)) {	400	#endif
248	retval=6;	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;
249	}	424	}
250	/* base name matched - not bad */	425	}
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		426
255	if (retval) {	427	{
256	if (pl->type == PLAYER)	428	auto (at, parts.begin ());
257	pl->contr->count=count;	429
		430	archetype *new_head = parts.front ();
		431	archetype *old_head = find (new_head->archname);
		432
		433	if (old_head && !old_head->is_head ())
		434	{
		435	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		436	&new_head->archname, &old_head->archname);
		437	goto fail;
		438	}
		439
		440	// check that all archetypes belong to the same old object or are new
		441	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		442	{
		443	archetype new_part = at;
		444	archetype *old_part = find (new_part->archname);
		445
		446	if (old_part && old_part->head_ () != old_head)
		447	{
		448	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		449	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		450	goto fail;
		451	}
		452	}
		453
		454	// assemble new chain
		455	new_head->max_x = new_head->x;
		456
		457	archetype *less = new_head;
		458	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		459	{
		460	archetype at = p;
		461
		462	// some flags get inherited from the head (probably a lot more)
		463	// doing it here doesn't feel too cozy, but it allows code
		464	// to ignore head checks for these flags, which saves time
		465	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		466	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		467	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		468	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		469
		470	new_head->max_x = max (new_head->max_x, at->x);
		471
		472	at->head = new_head;
		473	less->more = at;
		474	less = at;
		475	}
		476
		477	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
		478
		479	return new_head;
		480	}
		481
		482	fail:
		483	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		484	(*p)->destroy ();
		485
		486	return 0;
		487	}
		488
		489	void
		490	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
		491	{
		492	ref = 0;
		493	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
		494	}
		495
		496	void
		497	archetype::commit_load ()
		498	{
		499	// unlink old archetypes and link in new ones */
		500	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
		501	{
		502	archetype at = p;
		503
		504	if (archetype *old = find (at->archname))
		505	old->unlink ();
		506
		507	allarch.push_back (at);
		508
		509	at->link ();
		510	++dirtycnt;
		511	}
		512
		513	postponed_arch.clear ();
		514
		515	// now resolve arch references
		516	for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
		517	{
		518	arch_ptr *ap = p->first;
		519	archetype *at = find (p->second);
		520
		521	if (!at)
		522	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		523
		524	*ap = at;
		525	}
		526
		527	postponed_arch_ref.clear ();
		528
		529	empty = find (shstr_empty_archetype);
		530	}
		531
		532	void
		533	archetype::gc ()
		534	{
		535	int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt));
		536	dirtycnt = max (0, dirtycnt - cnt);
		537
		538	do
		539	{
		540	static int idx;
		541
		542	if (idx >= allarch.size ())
		543	if (idx)
		544	idx = 0;
		545	else
258	return retval;	546	return;
		547
		548	archetype *at = allarch [idx];
		549
		550	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
		551	++idx;
		552	else
		553	{
		554	//LOG (llevDebug, "garbage collect arch %s", &at->archname);
		555	assert (at->arch == at); // verify that refcnt == 1 is truly valid
		556	allarch.erase (idx);
		557
		558	// break chain
		559	for (object *op = at->head_ (); op; )
		560	{
		561	object *next = op->more;
		562	op->head = 0;
		563	op->more = 0;
		564	op = next;
		565	}
		566
		567	at->destroy ();
		568	at->arch = 0;
259	}	569	}
260	}	570	}
261	return 0;	571	while (--cnt);
262	}	572	}
263		573
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
513	load_archetypes (void)
514	{
515	char filename[MAX_BUF];
516	int comp;
517	#if TIME_ARCH_LOAD
518	struct timeval tv1, tv2;
519	#endif
520
521	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
522	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
523
524	{
525	object_thawer thawer (filename);
526
527	clear_archetable ();
528	LOG (llevDebug, " arch-pass 1...\n");
529	first_arch_pass (thawer);
530	LOG (llevDebug, " done\n");
531
532	init_archetable ();
533	warn_archetypes = 1;
534	}
535
536	{
537	object_thawer thawer (filename);
538
539	LOG (llevDebug, " loading treasure...\n");
540	load_treasures ();
541	LOG (llevDebug, " done\n arch-pass 2...\n");
542	second_arch_pass (thawer);
543	LOG (llevDebug, " done\n");
544	#ifdef DEBUG
545	check_generators ();
546	#endif
547	}
548	LOG (llevDebug, " done\n");
549	}
550
551	/*
552	* Creates and returns a new object which is a copy of the given archetype.
553	* This function returns NULL on failure.
554	*/
555
556	object arch_to_object(archetype at) {
557	object *op;	574	object *
558	if(at==NULL) {	575	archetype::instance ()
559	if(warn_archetypes)	576	{
560	LOG(llevError,"Couldn't find archetype.\n");	577	object *op = clone ();
561	return NULL;
562	}
563	op=get_object();
564	copy_object(&at->clone,op);
565	op->instantiate ();	578	op->instantiate ();
566	op->arch=at;
567	return op;	579	return op;
568	}	580	}
569		581
570	/*	582	//+GPL
571	* Creates an object. This function is called by get_archetype()
572	* if it fails to find the appropriate archetype.
573	* Thus get_archetype() will be guaranteed to always return
574	* an object, and never NULL.
575	*/
576
577	object create_singularity(const char name) {
578	object *op;
579	char buf[MAX_BUF];
580	sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name);
581	op = get_object();
582	op->name = add_string(buf);
583	op->name_pl = add_string(buf);
584	SET_FLAG(op,FLAG_NO_PICK);
585	return op;
586	}
587		583
588	/*	584	/*
589	* Finds which archetype matches the given name, and returns a new	585	* Finds which archetype matches the given name, and returns a new
590	* object containing a copy of the archetype.	586	* object containing a copy of the archetype.
591	*/	587	*/
		588	object *
		589	archetype::get (const char *name)
		590	{
		591	archetype *at = find (name);
592		592
593	object get_archetype(const char name) {	593	if (!at)
594	archetype *at;
595	at = find_archetype(name);
596	if (at == NULL)
597	return create_singularity(name);	594	return create_singularity (name);
598	return arch_to_object(at);
599	}
600		595
601	/*	596	return at->instance ();
602	* Hash-function used by the arch-hashtable.
603	*/
604
605	unsigned long
606	hasharch(const char *str, int tablesize) {
607	unsigned long hash = 0;
608	int i = 0;
609	const char *p;
610
611	/* use the one-at-a-time hash function, which supposedly is
612	* better than the djb2-like one used by perl5.005, but
613	* certainly is better then the bug used here before.
614	* see http://burtleburtle.net/bob/hash/doobs.html
615	*/
616	for (p = str; i < MAXSTRING && *p; p++, i++) {
617	hash += *p;
618	hash += hash << 10;
619	hash ^= hash >> 6;
620	}
621	hash += hash << 3;
622	hash ^= hash >> 11;
623	hash += hash << 15;
624	return hash % tablesize;
625	}
626
627	/*
628	* Finds, using the hashtable, which archetype matches the given name.
629	* returns a pointer to the found archetype, otherwise NULL.
630	*/
631
632	archetype find_archetype(const char name) {
633	archetype *at;
634	unsigned long index;
635
636	if (name == NULL)
637	return (archetype *) NULL;
638
639	index=hasharch(name, ARCHTABLE);
640	arch_search++;
641	for(;;) {
642	at = arch_table[index];
643	if (at==NULL) {
644	if(warn_archetypes)
645	LOG(llevError,"Couldn't find archetype %s\n",name);
646	return NULL;
647	}
648	arch_cmp++;
649	if (!strcmp(at->name,name))
650	return at;
651	if(++index>=ARCHTABLE)
652	index=0;
653	}
654	}
655
656	/*
657	* Adds an archetype to the hashtable.
658	*/
659
660	static void add_arch(archetype *at) {
661	int index=hasharch(at->name, ARCHTABLE),org_index=index;
662	for(;;) {
663	if(arch_table[index]==NULL) {
664	arch_table[index]=at;
665	return;
666	}
667	if(++index==ARCHTABLE)
668	index=0;
669	if(index==org_index)
670	fatal(ARCHTABLE_TOO_SMALL);
671	}
672	}	597	}
673		598
674	/*	599	/*
675	* Returns the first archetype using the given type.	600	* Returns the first archetype using the given type.
676	* Used in treasure-generation.	601	* Used in treasure-generation.
677	*/	602	*/
678		603	static archetype *
679	archetype *type_to_archetype(int type) {	604	type_to_archetype (int type)
680	archetype *at;	605	{
681		606	for_all_archetypes (at)
682	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more)	607	if (at->type == type && at->head_ () != at)
683	if(at->clone.type==type)
684	return at;	608	return at;
		609
685	return NULL;	610	return 0;
686	}	611	}
687		612
688	/*	613	/*
689	* Returns a new object copied from the first archetype matching	614	* Returns a new object copied from the first archetype matching
690	* the given type.	615	* the given type.
691	* Used in treasure-generation.	616	* Used in treasure-generation.
692	*/	617	*/
693		618	object *
694	object *clone_arch(int type) {	619	clone_arch (int type)
695	archetype *at;	620	{
696	object *op=get_object();	621	archetype *at = type_to_archetype (type);
697		622
698	if((at=type_to_archetype(type))==NULL) {	623	if (!at)
		624	{
699	LOG(llevError,"Can't clone archetype %d\n",type);	625	LOG (llevError, "Can't clone archetype %d\n", type);
700	free_object(op);
701	return NULL;	626	return 0;
702	}	627	}
703	copy_object(&at->clone,op);	628
704	op->instantiate ();	629	return at->instance ();
705	return op;
706	}	630	}
707		631
708	/*	632	/*
709	* member: make instance from class	633	* member: make instance from class
710	*/	634	*/
711		635	object *
712	object object_create_arch (archetype at)	636	object_create_arch (archetype *at)
713	{	637	{
714	object op, prev = NULL, *head = NULL;	638	object op, prev = 0, *head = 0;
715		639
716	while (at) {	640	while (at)
717	op = arch_to_object (at);	641	{
		642	op = at->instance ();
		643
718	op->x = at->clone.x;	644	op->x = at->x;
719	op->y = at->clone.y;	645	op->y = at->y;
		646
720	if (head)	647	if (head)
721	op->head = head, prev->more = op;	648	op->head = head, prev->more = op;
		649
722	if (!head)	650	if (!head)
723	head = op;	651	head = op;
		652
724	prev = op;	653	prev = op;
725	at = at->more;	654	at = (archetype *)at->more;
726	}	655	}
		656
727	return (head);	657	return head;
728	}	658	}
729		659
730	/* end of arch.c */	660	//-GPL
		661

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.8 by root, Wed Aug 30 06:06:26 2006 UTC vs. Revision 1.109 by root, Sat Dec 31 06:18:00 2011 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.8 by root, Wed Aug 30 06:06:26 2006 UTC vs.
Revision 1.109 by root, Sat Dec 31 06:18:00 2011 UTC