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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.1 by elmex, Sun Aug 13 17:16:00 2006 UTC vs. Revision 1.103 by root, Sun Apr 11 02:04:54 2010 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.1 by elmex, Sun Aug 13 17:16:00 2006 UTC vs.
Revision 1.103 by root, Sun Apr 11 02:04:54 2010 UTC