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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.4 by root, Sun Aug 27 16:15:11 2006 UTC vs.
Revision 1.97 by root, Sun Nov 8 22:28:10 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.4 2006/08/27 16:15:11 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;
74	}
75	return NULL;	96	return at;
		97
		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;
130	}
131	return NULL;	147	return at;
		148
		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);
162	}
163
164	/* GROS - find_best_weapon_used_match and item_matched_string moved there */
165	object find_best_weapon_used_match(object pl, const char *params)
166	{
167	object tmp, best=NULL;
168	int match_val=0,tmpmatch;
169
170	for (tmp=pl->inv; tmp; tmp=tmp->below) {
171	if (tmp->invisible) continue;
172	if ((tmpmatch=item_matched_string(pl, tmp, params))>match_val)
173	{
174	if ((QUERY_FLAG(tmp, FLAG_APPLIED))&&(tmp->type==WEAPON))
175	{	235	{
176	match_val=tmpmatch;	236	if (pl->type == PLAYER)
177	best=tmp;	237	count = pl->contr->count;
		238	else
		239	count = 0;
178	};	240	}
179	}
180	}
181	return best;
182	}
183		241
184	/* This is a subset of the parse_id command. Basically, name can be	242	if (!cp \|\| cp[0] == '\0' \|\| count < 0)
185	* a string seperated lists of things to match, with certain keywords.
186	* pl is the player (only needed to set count properly)
187	* op is the item we are trying to match. Calling function takes care
188	* of what action might need to be done and if it is valid
189	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
190	* value means a better match. 0 means no match.
191	*
192	* Brief outline of the procedure:
193	* We take apart the name variable into the individual components.
194	* cases for 'all' and unpaid are pretty obvious.
195	* Next, we check for a count (either specified in name, or in the
196	* player object.)
197	* If count is 1, make a quick check on the name.
198	* IF count is >1, we need to make plural name. Return if match.
199	* Last, make a check on the full name.
200	*/
201	int item_matched_string(object pl, object op, const char *name)
202	{
203	char *cp, local_name[MAX_BUF];
204	int count,retval=0;
205	strcpy(local_name, name); /* strtok is destructive to name */
206
207	for (cp=strtok(local_name,","); cp; cp=strtok(NULL,",")) {
208	while (cp[0]==' ') ++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")) return 1;
213
214	/* unpaid is a little more specific */
215	if (!strcmp(cp,"unpaid") && QUERY_FLAG(op,FLAG_UNPAID)) return 2;
216	if (!strcmp(cp,"cursed") && QUERY_FLAG(op,FLAG_KNOWN_CURSED) &&
217	(QUERY_FLAG(op,FLAG_CURSED) \|\|QUERY_FLAG(op,FLAG_DAMNED)))
218	return 2;	243	return 0;
219		244
220	if (!strcmp(cp,"unlocked") && !QUERY_FLAG(op, FLAG_INV_LOCKED))
221	return 2;
222		245
223	/* Allow for things like '100 arrows' */
224	if ((count=atoi(cp))!=0) {
225	cp=strchr(cp, ' ');
226	while (cp && cp[0]==' ') ++cp; /* get rid of spaces */
227	}
228	else {
229	if (pl->type==PLAYER)
230	count=pl->contr->count;
231	else
232	count = 0;
233	}
234
235	if (!cp \|\| cp[0]=='\0' \|\| count<0) return 0;
236
237
238	/* The code here should go from highest retval to lowest. That	246	/* The code here should go from highest retval to lowest. That
239	* is because of the 'else' handling - we don't want to match on	247	* is because of the 'else' handling - we don't want to match on
240	* something and set a low retval, even though it may match a higher retcal	248	* something and set a low retval, even though it may match a higher retcal
241	* later. So keep it in descending order here, so we try for the best	249	* later. So keep it in descending order here, so we try for the best
242	* match first, and work downward.	250	* match first, and work downward.
243	*/	251	*/
		252	const char qbn0, qbn1, *qsn; // query base name/short name caches
		253
244	if (!strcasecmp(cp,query_name(op))) retval=20;	254	if (!strcasecmp (cp, query_name (op)))
		255	retval = 20;
245	else if (!strcasecmp(cp,query_short_name(op))) retval=18;	256	else if (!strcasecmp (cp, qsn = query_short_name (op)))
		257	retval = 18;
246	else if (!strcasecmp(cp,query_base_name(op,0))) retval=16;	258	else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
		259	retval = 16;
247	else if (!strcasecmp(cp,query_base_name(op,1))) retval=16;	260	else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
		261	retval = 16;
248	else if (op->custom_name && !strcasecmp(cp,op->custom_name)) retval=15;	262	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
249	else if (!strncasecmp(cp,query_base_name(op,0),	263	retval = 15;
250	strlen(cp))) retval=14;	264	else if (!strncasecmp (cp, qbn0, strlen (cp)))
251	else if (!strncasecmp(cp,query_base_name(op,1),	265	retval = 14;
252	strlen(cp))) retval=14;	266	else if (!strncasecmp (cp, qbn1, strlen (cp)))
253		267	retval = 14;
254	/* Do substring checks, so things like 'Str+1' will match.	268	/* Do substring checks, so things like 'Str+1' will match.
255	* retval of these should perhaps be lower - they are lower	269	* retval of these should perhaps be lower - they are lower
256	* then the specific strcasecmp aboves, but still higher than	270	* then the specific strcasecmp aboves, but still higher than
257	* some other match criteria.	271	* some other match criteria.
258	*/	272	*/
259	else if (strstr(query_base_name(op,1), cp)) retval = 12;	273	else if (strstr (qbn1, cp))
260	else if (strstr(query_base_name(op,0), cp)) retval = 12;	274	retval = 12;
261	else if (strstr(query_short_name(op), cp)) retval = 12;	275	else if (strstr (qbn0, cp))
262		276	retval = 12;
		277	else if (strstr (qsn, cp))
		278	retval = 12;
263	/* Check against plural/non plural based on count. */	279	/* Check against plural/non plural based on count. */
264	else if (count>1 && !strcasecmp(cp,op->name_pl)) {	280	else if (count > 1 && !strcasecmp (cp, op->name_pl))
265	retval=6;	281	retval = 6;
266	}
267	else if (count==1 && !strcasecmp(op->name,cp)) {	282	else if (count == 1 && !strcasecmp (op->name, cp))
268	retval=6;	283	retval = 6;
269	}
270	/* base name matched - not bad */	284	/* base name matched - not bad */
271	else if (strcasecmp(cp,op->name)==0 && !count) retval=4;	285	else if (strcasecmp (cp, op->name) == 0 && !count)
		286	retval = 4;
272	/* Check for partial custom name, but give a real low priority */	287	/* Check for partial custom name, but give a real low priority */
273	else if (op->custom_name && strstr(op->custom_name, cp)) retval = 3;	288	else if (op->custom_name.contains (cp))
		289	retval = 3;
274		290
275	if (retval) {	291	if (retval)
		292	{
276	if (pl->type == PLAYER)	293	if (pl->type == PLAYER)
277	pl->contr->count=count;	294	pl->contr->count = count;
		295
278	return retval;	296	return retval;
279	}	297	}
280	}	298	}
		299
281	return 0;	300	return 0;
		301	}
		302
		303	//-GPL
		304
		305	archetype::archetype (const char *name)
		306	{
		307	arch = this;
		308	this->archname = this->name = this->name_pl = name;
		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	}
282	}	334	}
283		335
284	/*	336	/*
285	* Initialises the internal linked list of archetypes (read from file).	337	* Finds, using the hashtable, which archetype matches the given name.
286	* Then the global "empty_archetype" pointer is initialised.	338	* returns a pointer to the found archetype, otherwise NULL.
287	* Then the blocksview[] array is initialised.
288	*/	339	*/
289		340	archetype *
290	void init_archetypes(void) { /* called from add_player() and edit() */	341	archetype::find (const char *name)
291	if(first_archetype!=NULL) /* Only do this once */	342	{
		343	if (!name)
292	return;	344	return 0;
293	arch_init = 1;
294	load_archetypes();
295	arch_init = 0;
296	empty_archetype=find_archetype("empty_archetype");
297	/* init_blocksview();*/
298	}
299		345
300	/*	346	auto (i, ht.find (name));
301	* Stores debug-information about how efficient the hashtable
302	* used for archetypes has been in the static errmsg array.
303	*/
304		347
305	void arch_info(object *op) {	348	if (i == ht.end ())
306	sprintf(errmsg,"%d searches and %d strcmp()'s",arch_search,arch_cmp);	349	return 0;
307	new_draw_info(NDI_BLACK, 0, op,errmsg);	350	else
		351	return i->second;
308	}	352	}
309		353
310	/*	354	void
311	* Initialise the hashtable used by the archetypes.	355	archetype::post_load_check ()
312	*/	356	{
		357	object::post_load_check ();
313		358
314	void clear_archetable(void) {	359	assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
315	memset((void ) arch_table,0,ARCHTABLEsizeof(archetype *));
316	}	360	}
317		361
318	/*
319	* An alternative way to init the hashtable which is slower, but _works_...
320	*/
321
322	void init_archetable(void) {
323	archetype *at;	362	archetype *
324	LOG(llevDebug," Setting up archetable...\n");	363	archetype::read (object_thawer &f)
325	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more)	364	{
326	add_arch(at);	365	assert (f.kw == KW_object);
327	LOG(llevDebug,"done\n");
328	}
329		366
330	/*	367	std::vector<archetype *> parts;
331	* Dumps an archetype to debug-level output.
332	*/
333		368
334	void dump_arch(archetype *at) {	369	coroapi::cede_to_tick ();
335	dump_object(&at->clone);
336	}
337		370
338	/*	371	for (;;)
339	* Dumps _all_ archetypes to debug-level output.	372	{
340	* If you run crossfire with debug, and enter DM-mode, you can trigger	373	archetype *at = new archetype (f.get_str ());
341	* this with the O key.
342	*/
343		374
344	void dump_all_archetypes(void) {	375	f.next ();
345	archetype *at;	376
346	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) {	377	#if 0
347	dump_arch(at);	378	// implementing it here in the server does neither allow multiple inheritence
348	fprintf(logfile, "%s\n", errmsg);	379	// nor does it cleanly "just override". it would allow use in map files, though,
		380	// and other resource files dynamically laoded (as opposed to being preprocessed).
		381	// not that any of this is relevant as of yet...
		382	if (f.kw == KW_inherit)
		383	{
		384	if (archetype *at = find (f.get_str ()))
		385	*op = at->clone;
		386	else
		387	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		388	&at->archname, f.get_str ());
		389
		390	f.next ();
		391	}
		392	#endif
		393
		394	loading_arch = at; // hack to tell parse_kv et al. to behave
		395	bool parse_ok = at->parse_kv (f);
		396	loading_arch = 0;
		397
		398	if (!parse_ok)
		399	goto fail;
		400
		401	loading_arch = at; // hack to tell parse_kv et al. to behave
		402	at->post_load_check ();
		403	loading_arch = 0;
		404
		405	parts.push_back (at);
		406
		407	if (f.kw != KW_more)
		408	break;
		409
		410	f.next ();
		411
		412	if (f.kw != KW_object)
		413	{
		414	f.parse_error ("more object");
		415	goto fail;
		416	}
		417	}
		418
		419	{
		420	auto (at, parts.begin ());
		421
		422	archetype *new_head = parts.front ();
		423	archetype *old_head = find (new_head->archname);
		424
		425	if (old_head && !old_head->is_head ())
		426	{
		427	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		428	&new_head->archname, &old_head->archname);
		429	goto fail;
		430	}
		431
		432	// check that all archetypes belong to the same old object or are new
		433	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		434	{
		435	archetype new_part = at;
		436	archetype *old_part = find (new_part->archname);
		437
		438	if (old_part && old_part->head_ () != old_head)
		439	{
		440	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		441	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		442	goto fail;
		443	}
		444	}
		445
		446	// assemble new chain
		447	new_head->min_x = new_head->max_x = new_head->x;
		448	new_head->min_y = new_head->max_y = new_head->y;
		449
		450	archetype *less = new_head;
		451	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		452	{
		453	archetype at = p;
		454
		455	// some flags get inherited from the head (probably a lot more)
		456	// doing it here doesn't feel too cozy, but it allows code
		457	// to ignore head checks for these flags, which saves time
		458	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		459	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		460	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		461	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		462
		463	new_head->min_x = min (new_head->min_x, at->x);
		464	new_head->min_y = min (new_head->min_y, at->y);
		465	new_head->max_x = max (new_head->max_x, at->x);
		466	new_head->max_y = max (new_head->max_y, at->y);
		467
		468	at->head = new_head;
		469	less->more = at;
		470	less = at;
		471	}
		472
		473	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
		474
		475	return new_head;
349	}	476	}
350	}
351		477
352	void free_all_archs(void)	478	fail:
353	{	479	for (auto (p, parts.begin ()); p != parts.end (); ++p)
354	archetype at, next;	480	(*p)->destroy ();
355	int i=0,f=0;
356		481
357	for (at=first_archetype; at!=NULL; at=next) {
358	if (at->more) next=at->more;
359	else next=at->next;
360	if (at->name) free_string(at->name);
361	if (at->clone.name) free_string(at->clone.name);
362	if (at->clone.name_pl) free_string(at->clone.name_pl);
363	if (at->clone.title) free_string(at->clone.title);
364	if (at->clone.race) free_string(at->clone.race);
365	if (at->clone.slaying) free_string(at->clone.slaying);
366	if (at->clone.msg) free_string(at->clone.msg);
367	free(at);
368	i++;
369	}
370	LOG(llevDebug,"Freed %d archetypes, %d faces\n", i, f);
371	}
372
373	/*
374	* Allocates, initialises and returns the pointer to an archetype structure.
375	*/
376
377	archetype *get_archetype_struct(void) {
378	archetype *arch;
379
380	arch=(archetype *)CALLOC(1,sizeof(archetype));
381	if(arch==NULL)
382	fatal(OUT_OF_MEMORY);
383	arch->next=NULL;
384	arch->name=NULL;
385	arch->clone.other_arch=NULL;
386	arch->clone.name=NULL;
387	arch->clone.name_pl=NULL;
388	arch->clone.title=NULL;
389	arch->clone.race=NULL;
390	arch->clone.slaying=NULL;
391	arch->clone.msg=NULL;
392	clear_object(&arch->clone); /* to initial state other also */
393	CLEAR_FLAG((&arch->clone),FLAG_FREED); /* This shouldn't matter, since copy_object() */
394	SET_FLAG((&arch->clone), FLAG_REMOVED); /* doesn't copy these flags... */
395	arch->head=NULL;
396	arch->more=NULL;
397	return arch;	482	return 0;
398	}	483	}
399		484
400	/*	485	void
401	* Reads/parses the archetype-file, and copies into a linked list	486	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
402	* of archetype-structures.	487	{
403	*/	488	ref = 0;
404	void first_arch_pass(FILE *fp) {	489	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
405	object *op;	490	}
406	archetype at,head=NULL,*last_more=NULL;
407	int i,first=2;
408		491
409	object_thawer thawer;	492	void
410		493	archetype::commit_load ()
411	op=get_object();	494	{
412	op->arch=first_archetype=at=get_archetype_struct();	495	// unlink old archetypes and link in new ones */
413		496	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
414	while((i=load_object(fp,thawer,op,first,0))) {
415	first=0;
416	copy_object(op,&at->clone);
417	at->clone.speed_left= (float) (-0.1);
418	/* copy the body_info to the body_used - this is only really
419	* need for monsters, but doesn't hurt to do it for everything.
420	* by doing so, when a monster is created, it has good starting
421	* values for the body_used info, so when items are created
422	* for it, they can be properly equipped.
423	*/
424	memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info));
425
426	switch(i) {
427	case LL_NORMAL: /* A new archetype, just link it with the previous */
428	if(last_more!=NULL)
429	last_more->next=at;
430	if(head!=NULL)
431	head->next=at;
432	head=last_more=at;
433	#if 0
434	if(!op->type)
435	LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name);
436	#endif
437	at->tail_x = 0;
438	at->tail_y = 0;
439	break;
440
441	case LL_MORE: /* Another part of the previous archetype, link it correctly */
442
443	at->head=head;
444	at->clone.head = &head->clone;
445	if(last_more!=NULL) {
446	last_more->more=at;
447	last_more->clone.more = &at->clone;
448	}
449	last_more=at;
450
451	/* If this multipart image is still composed of individual small
452	* images, don't set the tail_.. values. We can't use them anyways,
453	* and setting these to zero makes the map sending to the client much
454	* easier as just looking at the head, we know what to do.
455	*/
456	if (at->clone.face != head->clone.face) {
457	head->tail_x = 0;
458	head->tail_y = 0;
459	} else {
460	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
461	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
462	}
463	break;
464
465	}
466
467	at=get_archetype_struct();
468	clear_object(op);
469	op->arch=at;
470	}	497	{
471	free(at);	498	archetype at = p;
472	free_object(op);
473	}
474		499
475	/*	500	if (archetype *old = find (at->archname))
476	* Reads the archetype file once more, and links all pointers between	501	old->unlink ();
477	* archetypes.
478	*/
479		502
480	void second_arch_pass(FILE *fp) {	503	allarch.push_back (at);
481	char buf[MAX_BUF],variable=buf,argument,*cp;
482	archetype at=NULL,other;
483		504
484	while(fgets(buf,MAX_BUF,fp)!=NULL) {	505	at->link ();
485	if(*buf=='#')	506	++dirtycnt;
486	continue;
487	if((argument=strchr(buf,' '))!=NULL) {
488	*argument='\0',argument++;
489	cp = argument + strlen(argument)-1;
490	while (isspace(*cp)) {
491	*cp='\0';
492	cp--;
493	}
494	}
495	if(!strcmp("Object",variable)) {
496	if((at=find_archetype(argument))==NULL)
497	LOG(llevError,"Warning: failed to find arch %s\n",argument);
498	} else if(!strcmp("other_arch",variable)) {
499	if(at!=NULL&&at->clone.other_arch==NULL) {
500	if((other=find_archetype(argument))==NULL)
501	LOG(llevError,"Warning: failed to find other_arch %s\n",argument);
502	else if(at!=NULL)
503	at->clone.other_arch=other;
504	}	507	}
505	} else if(!strcmp("randomitems",variable)) {	508
506	if(at!=NULL) {	509	postponed_arch.clear ();
507	treasurelist *tl=find_treasurelist(argument);	510
508	if(tl==NULL)	511	// now resolve arch references
509	LOG(llevError,"Failed to link treasure to arch (%s): %s\n",at->name, argument);	512	for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
		513	{
		514	arch_ptr *ap = p->first;
		515	archetype *at = find (p->second);
		516
		517	if (!at)
		518	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		519
		520	*ap = at;
		521	}
		522
		523	postponed_arch_ref.clear ();
		524
		525	empty = find (shstr_empty_archetype);
		526	}
		527
		528	void
		529	archetype::gc ()
		530	{
		531	int cnt = max (1, min (allarch.size () / 128, dirtycnt));
		532	dirtycnt = max (0, dirtycnt - cnt);
		533
		534	do
		535	{
		536	static int idx;
		537
		538	if (idx >= allarch.size ())
		539	if (idx)
		540	idx = 0;
510	else	541	else
511	at->clone.randomitems=tl;	542	return;
		543
		544	archetype *at = allarch [idx];
		545
		546	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
		547	++idx;
		548	else
		549	{
		550	LOG (llevDebug, "garbage collect arch %s", &at->archname);
		551	assert (at->arch == at); // verify that refcnt == 1 is truly valid
		552	allarch.erase (idx);
		553
		554	// break chain
		555	for (object *op = at->head_ (); op; )
		556	{
		557	object *next = op->more;
		558	op->head = 0;
		559	op->more = 0;
		560	op = next;
		561	}
		562
		563	at->destroy ();
		564	at->arch = 0;
512	}	565	}
513	}
514	}
515	}
516
517	#ifdef DEBUG
518	void check_generators(void) {
519	archetype *at;
520	for(at=first_archetype;at!=NULL;at=at->next)
521	if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL)
522	LOG(llevError,"Warning: %s is generator but lacks other_arch.\n",
523	at->name);
524	}
525	#endif
526
527	/*
528	* First initialises the archtype hash-table (init_archetable()).
529	* Reads and parses the archetype file (with the first and second-pass
530	* functions).
531	* Then initialises treasures by calling load_treasures().
532	*/
533
534	void load_archetypes(void) {
535	FILE *fp;
536	char filename[MAX_BUF];
537	int comp;
538	#if TIME_ARCH_LOAD
539	struct timeval tv1,tv2;
540	#endif
541
542	sprintf(filename,"%s/%s",settings.datadir,settings.archetypes);
543	LOG(llevDebug,"Reading archetypes from %s...\n",filename);
544	if((fp=open_and_uncompress(filename,0,&comp))==NULL) {
545	LOG(llevError," Can't open archetype file.\n");
546	return;
547	}
548	clear_archetable();
549	LOG(llevDebug," arch-pass 1...\n");
550	#if TIME_ARCH_LOAD
551	GETTIMEOFDAY(&tv1);
552	#endif
553	first_arch_pass(fp);
554	#if TIME_ARCH_LOAD
555	{ int sec, usec;
556	GETTIMEOFDAY(&tv2);
557	sec = tv2.tv_sec - tv1.tv_sec;
558	usec = tv2.tv_usec - tv1.tv_usec;
559	if (usec<0) { usec +=1000000; sec--;}
560	LOG(llevDebug,"Load took %d.%06d seconds\n", sec, usec);
561	}	566	}
562	#endif	567	while (--cnt);
563
564	LOG(llevDebug," done\n");
565	init_archetable();
566	warn_archetypes=1;
567
568	/* do a close and reopen instead of a rewind - necessary in case the
569	* file has been compressed.
570	*/
571	close_and_delete(fp, comp);
572	fp=open_and_uncompress(filename,0,&comp);
573
574	LOG(llevDebug," loading treasure...\n");
575	load_treasures();
576	LOG(llevDebug," done\n arch-pass 2...\n");
577	second_arch_pass(fp);
578	LOG(llevDebug," done\n");
579	#ifdef DEBUG
580	check_generators();
581	#endif
582	close_and_delete(fp, comp);
583	LOG(llevDebug," done\n");
584	}	568	}
585		569
586	/*
587	* Creates and returns a new object which is a copy of the given archetype.
588	* This function returns NULL on failure.
589	*/
590
591	object arch_to_object(archetype at) {
592	object *op;	570	object *
593	if(at==NULL) {	571	archetype::instance ()
594	if(warn_archetypes)	572	{
595	LOG(llevError,"Couldn't find archetype.\n");	573	object *op = clone ();
596	return NULL;
597	}
598	op=get_object();
599	copy_object(&at->clone,op);
600	op->instantiate ();	574	op->instantiate ();
601	op->arch=at;
602	return op;	575	return op;
603	}	576	}
604		577
605	/*	578	//+GPL
606	* Creates an object. This function is called by get_archetype()
607	* if it fails to find the appropriate archetype.
608	* Thus get_archetype() will be guaranteed to always return
609	* an object, and never NULL.
610	*/
611
612	object create_singularity(const char name) {
613	object *op;
614	char buf[MAX_BUF];
615	sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name);
616	op = get_object();
617	op->name = add_string(buf);
618	op->name_pl = add_string(buf);
619	SET_FLAG(op,FLAG_NO_PICK);
620	return op;
621	}
622		579
623	/*	580	/*
624	* Finds which archetype matches the given name, and returns a new	581	* Finds which archetype matches the given name, and returns a new
625	* object containing a copy of the archetype.	582	* object containing a copy of the archetype.
626	*/	583	*/
627		584	object *
628	object get_archetype(const char name) {	585	get_archetype (const char *name)
629	archetype *at;	586	{
630	at = find_archetype(name);	587	return archetype::get (name);
631	if (at == NULL)	588	}
		589
		590	object *
		591	archetype::get (const char *name)
		592	{
		593	archetype *at = find (name);
		594
		595	if (!at)
632	return create_singularity(name);	596	return create_singularity (name);
633	return arch_to_object(at);
634	}
635		597
636	/*	598	return at->instance ();
637	* Hash-function used by the arch-hashtable.
638	*/
639
640	unsigned long
641	hasharch(const char *str, int tablesize) {
642	unsigned long hash = 0;
643	int i = 0;
644	const char *p;
645
646	/* use the one-at-a-time hash function, which supposedly is
647	* better than the djb2-like one used by perl5.005, but
648	* certainly is better then the bug used here before.
649	* see http://burtleburtle.net/bob/hash/doobs.html
650	*/
651	for (p = str; i < MAXSTRING && *p; p++, i++) {
652	hash += *p;
653	hash += hash << 10;
654	hash ^= hash >> 6;
655	}
656	hash += hash << 3;
657	hash ^= hash >> 11;
658	hash += hash << 15;
659	return hash % tablesize;
660	}
661
662	/*
663	* Finds, using the hashtable, which archetype matches the given name.
664	* returns a pointer to the found archetype, otherwise NULL.
665	*/
666
667	archetype find_archetype(const char name) {
668	archetype *at;
669	unsigned long index;
670
671	if (name == NULL)
672	return (archetype *) NULL;
673
674	index=hasharch(name, ARCHTABLE);
675	arch_search++;
676	for(;;) {
677	at = arch_table[index];
678	if (at==NULL) {
679	if(warn_archetypes)
680	LOG(llevError,"Couldn't find archetype %s\n",name);
681	return NULL;
682	}
683	arch_cmp++;
684	if (!strcmp(at->name,name))
685	return at;
686	if(++index>=ARCHTABLE)
687	index=0;
688	}
689	}
690
691	/*
692	* Adds an archetype to the hashtable.
693	*/
694
695	static void add_arch(archetype *at) {
696	int index=hasharch(at->name, ARCHTABLE),org_index=index;
697	for(;;) {
698	if(arch_table[index]==NULL) {
699	arch_table[index]=at;
700	return;
701	}
702	if(++index==ARCHTABLE)
703	index=0;
704	if(index==org_index)
705	fatal(ARCHTABLE_TOO_SMALL);
706	}
707	}	599	}
708		600
709	/*	601	/*
710	* Returns the first archetype using the given type.	602	* Returns the first archetype using the given type.
711	* Used in treasure-generation.	603	* Used in treasure-generation.
712	*/	604	*/
713		605	static archetype *
714	archetype *type_to_archetype(int type) {	606	type_to_archetype (int type)
715	archetype *at;	607	{
716		608	for_all_archetypes (at)
717	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more)	609	if (at->type == type && at->head_ () != at)
718	if(at->clone.type==type)
719	return at;	610	return at;
		611
720	return NULL;	612	return 0;
721	}	613	}
722		614
723	/*	615	/*
724	* Returns a new object copied from the first archetype matching	616	* Returns a new object copied from the first archetype matching
725	* the given type.	617	* the given type.
726	* Used in treasure-generation.	618	* Used in treasure-generation.
727	*/	619	*/
728		620	object *
729	object *clone_arch(int type) {	621	clone_arch (int type)
730	archetype *at;	622	{
731	object *op=get_object();	623	archetype *at = type_to_archetype (type);
732		624
733	if((at=type_to_archetype(type))==NULL) {	625	if (!at)
		626	{
734	LOG(llevError,"Can't clone archetype %d\n",type);	627	LOG (llevError, "Can't clone archetype %d\n", type);
735	free_object(op);
736	return NULL;	628	return 0;
737	}	629	}
738	copy_object(&at->clone,op);	630
739	op->instantiate ();	631	return at->instance ();
740	return op;
741	}	632	}
742		633
743	/*	634	/*
744	* member: make instance from class	635	* member: make instance from class
745	*/	636	*/
746		637	object *
747	object object_create_arch (archetype at)	638	object_create_arch (archetype *at)
748	{	639	{
749	object op, prev = NULL, *head = NULL;	640	object op, prev = 0, *head = 0;
750		641
751	while (at) {	642	while (at)
752	op = arch_to_object (at);	643	{
		644	op = at->instance ();
		645
753	op->x = at->clone.x;	646	op->x = at->x;
754	op->y = at->clone.y;	647	op->y = at->y;
		648
755	if (head)	649	if (head)
756	op->head = head, prev->more = op;	650	op->head = head, prev->more = op;
		651
757	if (!head)	652	if (!head)
758	head = op;	653	head = op;
		654
759	prev = op;	655	prev = op;
760	at = at->more;	656	at = (archetype *)at->more;
761	}	657	}
		658
762	return (head);	659	return head;
763	}	660	}
764		661
765	/* end of arch.c */	662	//-GPL
		663

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.4 by root, Sun Aug 27 16:15:11 2006 UTC vs. Revision 1.97 by root, Sun Nov 8 22:28:10 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.4 by root, Sun Aug 27 16:15:11 2006 UTC vs.
Revision 1.97 by root, Sun Nov 8 22:28:10 2009 UTC