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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.3 by root, Sat Aug 26 23:36:28 2006 UTC vs. Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.3 by root, Sat Aug 26 23:36:28 2006 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC