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

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.96 by root, Sat Nov 7 18:30:05 2009 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.96 by root, Sat Nov 7 18:30:05 2009 UTC