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

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.86 by root, Sun Oct 5 14:54:05 2008 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.86 by root, Sun Oct 5 14:54:05 2008 UTC