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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.2 by root, Sat Aug 26 08:44:04 2006 UTC vs.
Revision 1.67 by root, Sat Jun 9 21:16:12 2007 UTC

…		…
1	/*	1	/*
2	* static char *rcsid_arch_c =	2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3	* "$Id: arch.C,v 1.2 2006/08/26 08:44:04 root Exp $";	3	*
4	*/	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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	* Crossfire TRT is free software; you can redistribute it and/or modify it
13	it under the terms of the GNU General Public License as published by	9	* under the terms of the GNU General Public License as published by the Free
14	the Free Software Foundation; either version 2 of the License, or	10	* Software Foundation; either version 2 of the License, or (at your option)
15	(at your option) any later version.	11	* 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, but
18	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
19	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20	GNU General Public License for more details.	16	* 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 along
23	along with this program; if not, write to the Free Software	19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
24	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
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 <crossfire@schmorp.de>
27	*/	23	*/
		24
		25	#include <cassert>
28		26
29	#include <global.h>	27	#include <global.h>
30	#include <arch.h>
31	#include <funcpoint.h>	28	#include <funcpoint.h>
32	#include <loader.h>	29	#include <loader.h>
33		30
34	/* IF set, does a little timing on the archetype load. */	31	#include <tr1/functional>
35	#define TIME_ARCH_LOAD 0	32	#include <tr1/unordered_map>
36
37	static void add_arch(archetype *at);
38
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		33
44	/* The naming of these functions is really poor - they are all	34	/* The naming of these functions is really poor - they are all
45	* pretty much named '.._arch_...', but they may more may not	35	* pretty much named '.._arch_...', but they may more may not
46	* return archetypes. Some make the arch_to_object call, and thus	36	* return archetypes. Some make the arch_to_object call, and thus
47	* return an object. Perhaps those should be called 'archob' functions	37	* return an object. Perhaps those should be called 'archob' functions
48	* to denote they return an object derived from the archetype.	38	* to denote they return an object derived from the archetype.
49	* MSW 2003-04-29	39	* MSW 2003-04-29
50	*/	40	*/
		41
		42	bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
		43
		44	// the hashtable
		45	typedef std::tr1::unordered_map
		46	<
		47	const char *,
		48	arch_ptr,
		49	str_hash,
		50	str_equal,
		51	slice_allocator< std::pair<const char *const, arch_ptr> >
		52	> HT;
		53
		54	static HT ht (5000);
		55	archvec archetypes;
51		56
52	/**	57	/**
53	* GROS - This function retrieves an archetype given the name that appears	58	* GROS - This function retrieves an archetype given the name that appears
54	* during the game (for example, "writing pen" instead of "stylus").	59	* 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.	60	* It does not use the hashtable system, but browse the whole archlist each time.
58	* Params:	63	* Params:
59	* - name: the name we're searching for (ex: "writing pen");	64	* - name: the name we're searching for (ex: "writing pen");
60	* Return value:	65	* Return value:
61	* - the archetype found or null if nothing was found.	66	* - the archetype found or null if nothing was found.
62	*/	67	*/
		68	archetype *
63	archetype find_archetype_by_object_name(const char name) {	69	find_archetype_by_object_name (const char *name)
64	archetype *at;	70	{
		71	shstr_cmp name_cmp (name);
65		72
66	if (name == NULL)	73	for_all_archetypes (at)
67	return (archetype *) NULL;	74	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;	75	return at;
		76
		77	return 0;
74	}	78	}
75		79
76	/**	80	/**
77	* This function retrieves an archetype by type and name that appears during	81	* 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()	82	* the game. It is basically the same as find_archetype_by_object_name()
79	* except that it considers only items of the given type.	83	* except that it considers only items of the given type.
80	*/	84	*/
		85	archetype *
81	archetype find_archetype_by_object_type_name(int type, const char name) {	86	find_archetype_by_object_type_name (int type, const char *name)
82	archetype *at;	87	{
		88	shstr_cmp name_cmp (name);
83		89
84	if (name == NULL)	90	for_all_archetypes (at)
85	return NULL;	91	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;	92	return at;
90	}
91		93
92	return NULL;	94	return 0;
93	}	95	}
94		96
95	/* This is a lot like the above function. Instead, we are trying to match	97	/* 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	98	* 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).	99	* against (eg, to only match against skills or only skill objects for example).
98	* If type is -1, ew don't match on type.	100	* If type is -1, ew don't match on type.
99	*/	101	*/
		102	object *
100	object get_archetype_by_skill_name(const char skill, int type) {	103	get_archetype_by_skill_name (const char *skill, int type)
101	archetype *at;	104	{
		105	shstr_cmp skill_cmp (skill);
102		106
103	if (skill == NULL)	107	for_all_archetypes (at)
104	return NULL;	108	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
105
106	for(at = first_archetype;at!=NULL;at=at->next) {
107	if ( ((type == -1) \|\| (type == at->clone.type)) &&
108	(!strcmp(at->clone.skill, skill)))
109	return arch_to_object(at);	109	return arch_to_object (at);
110	}	110
111	return NULL;	111	return 0;
112	}	112	}
113		113
114	/* similiar to above - this returns the first archetype	114	/* similiar to above - this returns the first archetype
115	* that matches both the type and subtype. type and subtype	115	* 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	116	* 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	117	* may not be very useful. This function is most useful when
118	* subtypes are known to be unique for a particular type	118	* subtypes are known to be unique for a particular type
119	* (eg, skills)	119	* (eg, skills)
120	*/	120	*/
		121	archetype *
121	archetype *get_archetype_by_type_subtype(int type, int subtype) {	122	get_archetype_by_type_subtype (int type, int subtype)
122	archetype *at;	123	{
123		124	for_all_archetypes (at)
124	for(at = first_archetype;at!=NULL;at=at->next) {	125	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;	126	return at;
		127
		128	return 0;
130	}	129	}
131		130
132	/**	131	/**
133	* GROS - this returns a new object given the name that appears during the game	132	* GROS - this returns a new object given the name that appears during the game
134	* (for example, "writing pen" instead of "stylus").	133	* (for example, "writing pen" instead of "stylus").
…		…
139	* Note by MSW - it appears that it takes the full name and keeps	138	* 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	139	* 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,	140	* doesn't malloc it each time - not that this function is used much,
142	* but it otherwise had a big memory leak.	141	* but it otherwise had a big memory leak.
143	*/	142	*/
		143	object *
144	object get_archetype_by_object_name(const char name) {	144	get_archetype_by_object_name (const char *name)
145	archetype *at;	145	{
146	char tmpname[MAX_BUF];	146	char tmpname[MAX_BUF];
147	int i;	147	int i;
148		148
149	strncpy(tmpname,name,MAX_BUF-1);	149	assign (tmpname, name);
150	tmpname[MAX_BUF-1] = 0;	150
151	for(i=strlen(tmpname); i>0; i--) {	151	for (i = strlen (tmpname); i > 0; i--)
		152	{
152	tmpname[i] = 0;	153	tmpname[i] = 0;
		154
153	at = find_archetype_by_object_name(tmpname);	155	if (archetype *at = find_archetype_by_object_name (tmpname))
154	if (at !=NULL)	156	return arch_to_object (at);
		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	if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))
		201	return 2;
		202
		203	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
		204	return 2;
		205
		206	/* Allow for things like '100 arrows' */
		207	if ((count = atoi (cp)) != 0)
155	{	208	{
156	return arch_to_object(at);	209	cp = strchr (cp, ' ');
		210	while (cp && cp[0] == ' ')
		211	++cp; /* get rid of spaces */
157	}	212	}
158	}	213	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	{	214	{
174	match_val=tmpmatch;	215	if (pl->type == PLAYER)
175	best=tmp;	216	count = pl->contr->count;
		217	else
		218	count = 0;
176	};	219	}
177	}
178	}
179	return best;
180	}
181		220
182	/* This is a subset of the parse_id command. Basically, name can be	221	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;	222	return 0;
217		223
218	if (!strcmp(cp,"unlocked") && !QUERY_FLAG(op, FLAG_INV_LOCKED))
219	return 2;
220		224
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	225	/* 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	226	* 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	227	* 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	228	* later. So keep it in descending order here, so we try for the best
240	* match first, and work downward.	229	* match first, and work downward.
241	*/	230	*/
242	if (!strcasecmp(cp,query_name(op))) retval=20;	231	if (!strcasecmp (cp, query_name (op)))
		232	retval = 20;
243	else if (!strcasecmp(cp,query_short_name(op))) retval=18;	233	else if (!strcasecmp (cp, query_short_name (op)))
244	else if (!strcasecmp(cp,query_base_name(op,0))) retval=16;	234	retval = 18;
245	else if (!strcasecmp(cp,query_base_name(op,1))) retval=16;
246	else if (op->custom_name && !strcasecmp(cp,op->custom_name)) retval=15;
247	else if (!strncasecmp(cp,query_base_name(op,0),	235	else if (!strcasecmp (cp, query_base_name (op, 0)))
248	strlen(cp))) retval=14;	236	retval = 16;
249	else if (!strncasecmp(cp,query_base_name(op,1),	237	else if (!strcasecmp (cp, query_base_name (op, 1)))
250	strlen(cp))) retval=14;	238	retval = 16;
251		239	else if (op->custom_name && !strcasecmp (cp, op->custom_name))
		240	retval = 15;
		241	else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
		242	retval = 14;
		243	else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
		244	retval = 14;
252	/* Do substring checks, so things like 'Str+1' will match.	245	/* Do substring checks, so things like 'Str+1' will match.
253	* retval of these should perhaps be lower - they are lower	246	* retval of these should perhaps be lower - they are lower
254	* then the specific strcasecmp aboves, but still higher than	247	* then the specific strcasecmp aboves, but still higher than
255	* some other match criteria.	248	* some other match criteria.
256	*/	249	*/
257	else if (strstr(query_base_name(op,1), cp)) retval = 12;	250	else if (strstr (query_base_name (op, 1), cp))
		251	retval = 12;
258	else if (strstr(query_base_name(op,0), cp)) retval = 12;	252	else if (strstr (query_base_name (op, 0), cp))
		253	retval = 12;
259	else if (strstr(query_short_name(op), cp)) retval = 12;	254	else if (strstr (query_short_name (op), cp))
260		255	retval = 12;
261	/* Check against plural/non plural based on count. */	256	/* Check against plural/non plural based on count. */
262	else if (count>1 && !strcasecmp(cp,op->name_pl)) {	257	else if (count > 1 && !strcasecmp (cp, op->name_pl))
263	retval=6;	258	retval = 6;
264	}
265	else if (count==1 && !strcasecmp(op->name,cp)) {	259	else if (count == 1 && !strcasecmp (op->name, cp))
266	retval=6;	260	retval = 6;
267	}
268	/* base name matched - not bad */	261	/* base name matched - not bad */
269	else if (strcasecmp(cp,op->name)==0 && !count) retval=4;	262	else if (strcasecmp (cp, op->name) == 0 && !count)
		263	retval = 4;
270	/* Check for partial custom name, but give a real low priority */	264	/* Check for partial custom name, but give a real low priority */
271	else if (op->custom_name && strstr(op->custom_name, cp)) retval = 3;	265	else if (op->custom_name && strstr (op->custom_name, cp))
		266	retval = 3;
272		267
273	if (retval) {	268	if (retval)
		269	{
274	if (pl->type == PLAYER)	270	if (pl->type == PLAYER)
275	pl->contr->count=count;	271	pl->contr->count = count;
		272
276	return retval;	273	return retval;
277	}	274	}
278	}	275	}
		276
		277	return 0;
		278	}
		279
		280	archetype::archetype (const char *name)
		281	{
		282	stub = true;
		283	arch = this;
		284	this->archname = this->name = this->name_pl = name;
		285	}
		286
		287	archetype::~archetype ()
		288	{
		289	unlink ();
		290	}
		291
		292	void
		293	archetype::link ()
		294	{
		295	ht.insert (std::make_pair (archname, this));
		296
		297	if (!archetypes.contains (this))
		298	archetypes.insert (this);
		299	}
		300
		301	void
		302	archetype::unlink ()
		303	{
		304	ht.erase (archname);
		305	if (!strcmp (&archname, "Gaea")) fprintf (stderr, "oI\n");//D
		306	if (archetypes.contains (this))
		307	archetypes.erase (this);
		308	}
		309
		310	/*
		311	* Finds, using the hashtable, which archetype matches the given name.
		312	* returns a pointer to the found archetype, otherwise NULL.
		313	*/
		314	archetype *
		315	archetype::find (const char *name)
		316	{
		317	if (!name)
279	return 0;	318	return 0;
280	}
281		319
282	/*	320	auto (i, ht.find (name));
283	* Initialises the internal linked list of archetypes (read from file).
284	* Then the global "empty_archetype" pointer is initialised.
285	* Then the blocksview[] array is initialised.
286	*/
287		321
288	void init_archetypes(void) { /* called from add_player() and edit() */	322	if (i == ht.end ())
289	if(first_archetype!=NULL) /* Only do this once */
290	return;	323	return 0;
291	arch_init = 1;	324	else
292	load_archetypes();	325	return i->second;
293	arch_init = 0;
294	empty_archetype=find_archetype("empty_archetype");
295	/* init_blocksview();*/
296	}	326	}
297		327
298	/*
299	* Stores debug-information about how efficient the hashtable
300	* used for archetypes has been in the static errmsg array.
301	*/
302
303	void arch_info(object *op) {
304	sprintf(errmsg,"%d searches and %d strcmp()'s",arch_search,arch_cmp);
305	new_draw_info(NDI_BLACK, 0, op,errmsg);
306	}
307
308	/*
309	* Initialise the hashtable used by the archetypes.
310	*/
311
312	void clear_archetable(void) {
313	memset((void ) arch_table,0,ARCHTABLEsizeof(archetype *));
314	}
315
316	/*
317	* An alternative way to init the hashtable which is slower, but _works_...
318	*/
319
320	void init_archetable(void) {
321	archetype *at;	328	archetype *
322	LOG(llevDebug," Setting up archetable...\n");	329	archetype::get (const char *name)
323	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more)	330	{
324	add_arch(at);	331	if (!name)
325	LOG(llevDebug,"done\n");	332	{
326	}	333	LOG (llevError, "null archetype requested\n");
		334	name = "(null)";
		335	}
327		336
328	/*	337	archetype *at = find (name);
329	* Dumps an archetype to debug-level output.
330	*/
331		338
332	void dump_arch(archetype *at) {	339	if (!at)
333	dump_object(&at->clone);	340	{
334	}	341	at = new archetype (name);
		342	at->link ();
		343	}
335		344
336	/*	345	return at;
337	* Dumps _all_ archetypes to debug-level output.	346	}
338	* If you run crossfire with debug, and enter DM-mode, you can trigger
339	* this with the O key.
340	*/
341		347
342	void dump_all_archetypes(void) {
343	archetype *at;	348	archetype *
344	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) {	349	archetype::read (object_thawer &f)
345	dump_arch(at);	350	{
346	fprintf(logfile, "%s\n", errmsg);	351	assert (f.kw == KW_object);
		352
		353	loading_arch = true; // hack to tell parse_kv et al. to behave
		354
		355	std::vector<archetype *> parts;
		356
		357	coroapi::cede_to_tick_every (10);
		358
		359	for (;;)
		360	{
		361	// the archetype might have been referenced earlier
		362	// so try to find an existing stub archetype first
		363	archetype *at = find (f.get_str ());
		364
		365	if (!at \|\| !at->stub)
		366	at = new archetype (f.get_str ());
		367
		368	f.next ();
		369
		370	#if 0
		371	// implementing it here in the server does neither allow multiple inheritence
		372	// nor does it cleanly "just override". it would allow use in map files, though,
		373	// and other resource files dynamically laoded (as opposed to being preprocessed).
		374	// not that any of this is relevant as of yet...
		375	if (f.kw == KW_inherit)
		376	{
		377	if (archetype *at = find (f.get_str ()))
		378	*op = at->clone;
		379	else
		380	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		381	&at->archname, f.get_str ());
		382
		383	f.next ();
		384	}
		385	#endif
		386
		387	if (!at->parse_kv (f))
		388	goto fail;
		389
		390	at->post_load_check ();
		391
		392	parts.push_back (at);
		393
		394	if (f.kw != KW_more)
		395	break;
		396
		397	f.next ();
		398
		399	if (f.kw != KW_object)
		400	{
		401	f.parse_error ("more object");
		402	goto fail;
		403	}
		404	}
		405
		406	loading_arch = false;
		407
		408	{
		409	auto (at, parts.begin ());
		410
		411	archetype *new_head = parts.front ();
		412	archetype *old_head = find (new_head->archname);
		413
		414	if (old_head && !old_head->is_head ())
		415	{
		416	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		417	&new_head->archname, &old_head->archname);
		418	goto fail;
		419	}
		420
		421	// check that all archetypes belong to the same old object or are new
		422	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		423	{
		424	archetype new_part = at;
		425	archetype *old_part = find (new_part->archname);
		426
		427	if (old_part && old_part->head_ () != old_head)
		428	{
		429	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		430	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		431	goto fail;
		432	}
		433	}
		434
		435	// deactivate existing archetype
		436	for (archetype at = old_head; at; at = (archetype )at->more)
		437	at->unlink ();
		438
		439	// assemble new chain
		440	new_head->min_x = new_head->max_x = new_head->x;
		441	new_head->min_y = new_head->max_y = new_head->y;
		442
		443	archetype *less = new_head;
		444	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		445	{
		446	archetype at = p;
		447
		448	// some flags get inherited formt he head (probably a lot more)
		449	// doing it here doesn't feel too cozy, but it allows code
		450	// to ignore head checks for these flags, which saves time
		451	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		452	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		453	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		454	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		455
		456	if (at->x < new_head->min_x) new_head->min_x = at->x;
		457	if (at->y < new_head->min_y) new_head->min_y = at->y;
		458	if (at->x > new_head->max_x) new_head->max_x = at->x;
		459	if (at->y > new_head->max_y) new_head->max_y = at->y;
		460
		461	at->head = new_head;
		462	less->more = at;
		463	less = at;
		464	}
		465
		466	// now activate it
		467	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		468	{
		469	archetype at = p;
		470	at->stub = false;
		471	at->link ();
		472	}
		473
		474	return new_head;
347	}	475	}
348	}
349		476
350	void free_all_archs(void)	477	fail:
351	{	478	for (auto (p, parts.begin ()); p != parts.end (); ++p)
352	archetype at, next;	479	(*p)->destroy (true);
353	int i=0,f=0;
354		480
355	for (at=first_archetype; at!=NULL; at=next) {	481	loading_arch = false;
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;	482	return 0;
396	}	483	}
397		484
398	/*	485	/*
399	* Reads/parses the archetype-file, and copies into a linked list	486	* Initialize global archtype pointers:
400	* of archetype-structures.
401	*/
402	void first_arch_pass(FILE *fp) {
403	object *op;
404	archetype at,head=NULL,*last_more=NULL;
405	int i,first=2;
406
407	op=get_object();
408	op->arch=first_archetype=at=get_archetype_struct();
409
410	while((i=load_object(fp,op,first,0))) {
411	first=0;
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	*/	487	*/
420	memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info));	488	void
421		489	init_archetype_pointers ()
422	switch(i) {	490	{
423	case LL_NORMAL: /* A new archetype, just link it with the previous */	491	ring_arch = archetype::find ("ring");
424	if(last_more!=NULL)	492	amulet_arch = archetype::find ("amulet");
425	last_more->next=at;	493	staff_arch = archetype::find ("staff");
426	if(head!=NULL)	494	crown_arch = archetype::find ("crown");
427	head->next=at;	495	empty_archetype = archetype::find ("empty_archetype");
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	}
467	free(at);
468	free_object(op);
469	}
470
471	/*
472	* Reads the archetype file once more, and links all pointers between
473	* archetypes.
474	*/
475
476	void second_arch_pass(FILE *fp) {
477	char buf[MAX_BUF],variable=buf,argument,*cp;
478	archetype at=NULL,other;
479
480	while(fgets(buf,MAX_BUF,fp)!=NULL) {
481	if(*buf=='#')
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	}
501	} else if(!strcmp("randomitems",variable)) {
502	if(at!=NULL) {
503	treasurelist *tl=find_treasurelist(argument);
504	if(tl==NULL)
505	LOG(llevError,"Failed to link treasure to arch (%s): %s\n",at->name, argument);
506	else
507	at->clone.randomitems=tl;
508	}
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	}
558	#endif
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	}	496	}
581		497
582	/*	498	/*
583	* Creates and returns a new object which is a copy of the given archetype.	499	* Creates and returns a new object which is a copy of the given archetype.
584	* This function returns NULL on failure.	500	* This function returns NULL on failure.
585	*/	501	*/
586		502	object *
587	object arch_to_object(archetype at) {	503	arch_to_object (archetype *at)
588	object *op;	504	{
589	if(at==NULL) {	505	if (!at)
590	if(warn_archetypes)	506	{
591	LOG(llevError,"Couldn't find archetype.\n");	507	LOG (llevError, "Couldn't find archetype.\n");
592	return NULL;	508	return 0;
593	}	509	}
594	op=get_object();	510
595	copy_object(&at->clone,op);	511	object *op = at->clone ();
		512	op->arch = at;
596	op->instantiate ();	513	op->instantiate ();
597	op->arch=at;	514
598	return op;	515	return op;
599	}	516	}
600		517
601	/*	518	/*
602	* Creates an object. This function is called by get_archetype()	519	* Creates an object. This function is called by get_archetype()
603	* if it fails to find the appropriate archetype.	520	* if it fails to find the appropriate archetype.
604	* Thus get_archetype() will be guaranteed to always return	521	* Thus get_archetype() will be guaranteed to always return
605	* an object, and never NULL.	522	* an object, and never NULL.
606	*/	523	*/
607		524	object *
608	object create_singularity(const char name) {	525	create_singularity (const char *name)
609	object *op;	526	{
		527	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
		528
		529	if (!strcmp (name, "bug"))
		530	abort ();
		531
610	char buf[MAX_BUF];	532	char buf[MAX_BUF];
611	sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name);	533	sprintf (buf, "bug, please report (%s)", name);
612	op = get_object();	534
613	op->name = add_string(buf);	535	object *op = get_archetype ("bug");
614	op->name_pl = add_string(buf);	536	op->name = op->name_pl = buf;
615	SET_FLAG(op,FLAG_NO_PICK);	537
616	return op;	538	return op;
617	}	539	}
618		540
619	/*	541	/*
620	* Finds which archetype matches the given name, and returns a new	542	* Finds which archetype matches the given name, and returns a new
621	* object containing a copy of the archetype.	543	* object containing a copy of the archetype.
622	*/	544	*/
623		545	object *
624	object get_archetype(const char name) {	546	get_archetype (const char *name)
625	archetype *at;	547	{
626	at = find_archetype(name);	548	archetype *at = archetype::find (name);
627	if (at == NULL)	549
		550	if (!at)
628	return create_singularity(name);	551	return create_singularity (name);
		552
629	return arch_to_object(at);	553	return arch_to_object (at);
630	}
631
632	/*
633	* Hash-function used by the arch-hashtable.
634	*/
635
636	unsigned long
637	hasharch(const char *str, int tablesize) {
638	unsigned long hash = 0;
639	int i = 0;
640	const char *p;
641
642	/* use the one-at-a-time hash function, which supposedly is
643	* better than the djb2-like one used by perl5.005, but
644	* certainly is better then the bug used here before.
645	* see http://burtleburtle.net/bob/hash/doobs.html
646	*/
647	for (p = str; i < MAXSTRING && *p; p++, i++) {
648	hash += *p;
649	hash += hash << 10;
650	hash ^= hash >> 6;
651	}
652	hash += hash << 3;
653	hash ^= hash >> 11;
654	hash += hash << 15;
655	return hash % tablesize;
656	}
657
658	/*
659	* Finds, using the hashtable, which archetype matches the given name.
660	* returns a pointer to the found archetype, otherwise NULL.
661	*/
662
663	archetype find_archetype(const char name) {
664	archetype *at;
665	unsigned long index;
666
667	if (name == NULL)
668	return (archetype *) NULL;
669
670	index=hasharch(name, ARCHTABLE);
671	arch_search++;
672	for(;;) {
673	at = arch_table[index];
674	if (at==NULL) {
675	if(warn_archetypes)
676	LOG(llevError,"Couldn't find archetype %s\n",name);
677	return NULL;
678	}
679	arch_cmp++;
680	if (!strcmp(at->name,name))
681	return at;
682	if(++index>=ARCHTABLE)
683	index=0;
684	}
685	}
686
687	/*
688	* Adds an archetype to the hashtable.
689	*/
690
691	static void add_arch(archetype *at) {
692	int index=hasharch(at->name, ARCHTABLE),org_index=index;
693	for(;;) {
694	if(arch_table[index]==NULL) {
695	arch_table[index]=at;
696	return;
697	}
698	if(++index==ARCHTABLE)
699	index=0;
700	if(index==org_index)
701	fatal(ARCHTABLE_TOO_SMALL);
702	}
703	}	554	}
704		555
705	/*	556	/*
706	* Returns the first archetype using the given type.	557	* Returns the first archetype using the given type.
707	* Used in treasure-generation.	558	* Used in treasure-generation.
708	*/	559	*/
709
710	archetype *type_to_archetype(int type) {
711	archetype *at;	560	archetype *
712		561	type_to_archetype (int type)
713	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more)	562	{
714	if(at->clone.type==type)	563	for_all_archetypes (at)
		564	if (at->type == type && at->head_ () != at)
715	return at;	565	return at;
		566
716	return NULL;	567	return 0;
717	}	568	}
718		569
719	/*	570	/*
720	* Returns a new object copied from the first archetype matching	571	* Returns a new object copied from the first archetype matching
721	* the given type.	572	* the given type.
722	* Used in treasure-generation.	573	* Used in treasure-generation.
723	*/	574	*/
724		575	object *
725	object *clone_arch(int type) {	576	clone_arch (int type)
		577	{
726	archetype *at;	578	archetype *at;
727	object *op=get_object();
728		579
729	if((at=type_to_archetype(type))==NULL) {	580	if ((at = type_to_archetype (type)) == NULL)
		581	{
730	LOG(llevError,"Can't clone archetype %d\n",type);	582	LOG (llevError, "Can't clone archetype %d\n", type);
731	free_object(op);
732	return NULL;	583	return 0;
733	}	584	}
734	copy_object(&at->clone,op);	585
		586	object *op = at->clone ();
		587	op->instantiate ();
735	return op;	588	return op;
736	}	589	}
737		590
738	/*	591	/*
739	* member: make instance from class	592	* member: make instance from class
740	*/	593	*/
741		594	object *
742	object object_create_arch (archetype at)	595	object_create_arch (archetype *at)
743	{	596	{
744	object op, prev = NULL, *head = NULL;	597	object op, prev = 0, *head = 0;
745		598
746	while (at) {	599	while (at)
		600	{
747	op = arch_to_object (at);	601	op = arch_to_object (at);
		602
748	op->x = at->clone.x;	603	op->x = at->x;
749	op->y = at->clone.y;	604	op->y = at->y;
		605
750	if (head)	606	if (head)
751	op->head = head, prev->more = op;	607	op->head = head, prev->more = op;
		608
752	if (!head)	609	if (!head)
753	head = op;	610	head = op;
		611
754	prev = op;	612	prev = op;
755	at = at->more;	613	at = (archetype *)at->more;
756	}	614	}
		615
757	return (head);	616	return head;
758	}	617	}
759		618
760	/* end of arch.c */

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.2 by root, Sat Aug 26 08:44:04 2006 UTC vs. Revision 1.67 by root, Sat Jun 9 21:16:12 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.2 by root, Sat Aug 26 08:44:04 2006 UTC vs.
Revision 1.67 by root, Sat Jun 9 21:16:12 2007 UTC