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

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.1 by elmex, Sun Aug 13 17:16:00 2006 UTC vs. Revision 1.73 by root, Sun Apr 20 00:44:12 2008 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.1 by elmex, Sun Aug 13 17:16:00 2006 UTC vs.
Revision 1.73 by root, Sun Apr 20 00:44:12 2008 UTC