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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.4 by root, Sun Aug 27 16:15:11 2006 UTC vs.
Revision 1.38 by root, Fri Feb 2 21:50:43 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.4 by root, Sun Aug 27 16:15:11 2006 UTC vs. Revision 1.38 by root, Fri Feb 2 21:50:43 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.4 by root, Sun Aug 27 16:15:11 2006 UTC vs.
Revision 1.38 by root, Fri Feb 2 21:50:43 2007 UTC