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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.7 by root, Tue Aug 29 08:01:35 2006 UTC vs.
Revision 1.43 by root, Fri Feb 16 19:43:40 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.7 by root, Tue Aug 29 08:01:35 2006 UTC vs. Revision 1.43 by root, Fri Feb 16 19:43:40 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.7 by root, Tue Aug 29 08:01:35 2006 UTC vs.
Revision 1.43 by root, Fri Feb 16 19:43:40 2007 UTC