[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.68 by root, Sun Jul 1 05:00:17 2007 UTC

…		…
1	/*	1	/*
2	* static char *rcsid_arch_c =	2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3	* "$Id: arch.C,v 1.4 2006/08/27 16:15:11 root Exp $";	3	*
4	*/	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5
6	/*
7	CrossFire, A Multiplayer game for X-windows
8
9	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
10	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
11		7	*
12	This program is free software; you can redistribute it and/or modify	8	* Crossfire TRT is free software: you can redistribute it and/or modify
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 <crossfire@schmorp.de>
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	#include <cassert>	30	#include <tr1/functional>
35		31	#include <tr1/unordered_map>
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 */
45		32
46	/* The naming of these functions is really poor - they are all	33	/* The naming of these functions is really poor - they are all
47	* pretty much named '.._arch_...', but they may more may not	34	* pretty much named '.._arch_...', but they may more may not
48	* return archetypes. Some make the arch_to_object call, and thus	35	* return archetypes. Some make the arch_to_object call, and thus
49	* return an object. Perhaps those should be called 'archob' functions	36	* return an object. Perhaps those should be called 'archob' functions
50	* to denote they return an object derived from the archetype.	37	* to denote they return an object derived from the archetype.
51	* MSW 2003-04-29	38	* MSW 2003-04-29
52	*/	39	*/
		40
		41	bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
		42
		43	// the hashtable
		44	typedef std::tr1::unordered_map
		45	<
		46	const char *,
		47	arch_ptr,
		48	str_hash,
		49	str_equal,
		50	slice_allocator< std::pair<const char *const, arch_ptr> >
		51	> HT;
		52
		53	static HT ht (5000);
		54	archvec archetypes;
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)	72	for_all_archetypes (at)
69	return (archetype *) NULL;	73	if (at->name == name_cmp)
70
71	for(at = first_archetype;at!=NULL;at=at->next) {
72	if (!strcmp(at->clone.name, name))
73	return at;
74	}
75	return NULL;	74	return at;
		75
		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)	89	for_all_archetypes (at)
87	return NULL;	90	if (at->name == name_cmp && at->type == type)
88
89	for (at = first_archetype; at != NULL; at = at->next) {
90	if (at->clone.type == type && strcmp(at->clone.name, name) == 0)
91	return at;	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	for_all_archetypes (at)
106	return NULL;	107	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
107
108	for(at = first_archetype;at!=NULL;at=at->next) {
109	if ( ((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		123	for_all_archetypes (at)
126	for(at = first_archetype;at!=NULL;at=at->next) {	124	if ((type == -1 \|\| type == at->type) && (subtype == -1 \|\| subtype == at->subtype))
127	if ( ((type == -1) \|\| (type == at->clone.type)) &&
128	(subtype == -1 \|\| subtype == at->clone.subtype))
129	return at;
130	}
131	return NULL;	125	return at;
		126
		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)	155	return arch_to_object (at);
		156	}
		157
		158	return create_singularity (name);
		159	}
		160
		161	/* This is a subset of the parse_id command. Basically, name can be
		162	* a string seperated lists of things to match, with certain keywords.
		163	* pl is the player (only needed to set count properly)
		164	* op is the item we are trying to match. Calling function takes care
		165	* of what action might need to be done and if it is valid
		166	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
		167	* value means a better match. 0 means no match.
		168	*
		169	* Brief outline of the procedure:
		170	* We take apart the name variable into the individual components.
		171	* cases for 'all' and unpaid are pretty obvious.
		172	* Next, we check for a count (either specified in name, or in the
		173	* player object.)
		174	* If count is 1, make a quick check on the name.
		175	* IF count is >1, we need to make plural name. Return if match.
		176	* Last, make a check on the full name.
		177	*/
		178	int
		179	item_matched_string (object pl, object op, const char *name)
		180	{
		181	char *cp, local_name[MAX_BUF];
		182	int count, retval = 0;
		183
		184	assign (local_name, name); /* strtok is destructive to name */
		185
		186	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
		187	{
		188	while (cp[0] == ' ')
		189	++cp; /* get rid of spaces */
		190
		191	/* LOG(llevDebug,"Trying to match %s\n", cp); */
		192	/* All is a very generic match - low match value */
		193	if (!strcmp (cp, "all"))
		194	return 1;
		195
		196	/* unpaid is a little more specific */
		197	if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
		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;
		201
		202	if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
		203	return 2;
		204
		205	/* Allow for things like '100 arrows' */
		206	if ((count = atoi (cp)) != 0)
157	{	207	{
158	return arch_to_object(at);	208	cp = strchr (cp, ' ');
		209	while (cp && cp[0] == ' ')
		210	++cp; /* get rid of spaces */
159	}	211	}
160	}	212	else
161	return create_singularity(name);
162	}
163
164	/* GROS - find_best_weapon_used_match and item_matched_string moved there */
165	object find_best_weapon_used_match(object pl, const char *params)
166	{
167	object tmp, best=NULL;
168	int match_val=0,tmpmatch;
169
170	for (tmp=pl->inv; tmp; tmp=tmp->below) {
171	if (tmp->invisible) continue;
172	if ((tmpmatch=item_matched_string(pl, tmp, params))>match_val)
173	{
174	if ((QUERY_FLAG(tmp, FLAG_APPLIED))&&(tmp->type==WEAPON))
175	{	213	{
176	match_val=tmpmatch;	214	if (pl->type == PLAYER)
177	best=tmp;	215	count = pl->contr->count;
		216	else
		217	count = 0;
178	};	218	}
179	}
180	}
181	return best;
182	}
183		219
184	/* This is a subset of the parse_id command. Basically, name can be	220	if (!cp \|\| cp[0] == '\0' \|\| count < 0)
185	* a string seperated lists of things to match, with certain keywords.
186	* pl is the player (only needed to set count properly)
187	* op is the item we are trying to match. Calling function takes care
188	* of what action might need to be done and if it is valid
189	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
190	* value means a better match. 0 means no match.
191	*
192	* Brief outline of the procedure:
193	* We take apart the name variable into the individual components.
194	* cases for 'all' and unpaid are pretty obvious.
195	* Next, we check for a count (either specified in name, or in the
196	* player object.)
197	* If count is 1, make a quick check on the name.
198	* IF count is >1, we need to make plural name. Return if match.
199	* Last, make a check on the full name.
200	*/
201	int item_matched_string(object pl, object op, const char *name)
202	{
203	char *cp, local_name[MAX_BUF];
204	int count,retval=0;
205	strcpy(local_name, name); /* strtok is destructive to name */
206
207	for (cp=strtok(local_name,","); cp; cp=strtok(NULL,",")) {
208	while (cp[0]==' ') ++cp; /* get rid of spaces */
209
210	/* LOG(llevDebug,"Trying to match %s\n", cp);*/
211	/* All is a very generic match - low match value */
212	if (!strcmp(cp,"all")) return 1;
213
214	/* unpaid is a little more specific */
215	if (!strcmp(cp,"unpaid") && QUERY_FLAG(op,FLAG_UNPAID)) return 2;
216	if (!strcmp(cp,"cursed") && QUERY_FLAG(op,FLAG_KNOWN_CURSED) &&
217	(QUERY_FLAG(op,FLAG_CURSED) \|\|QUERY_FLAG(op,FLAG_DAMNED)))
218	return 2;	221	return 0;
219		222
220	if (!strcmp(cp,"unlocked") && !QUERY_FLAG(op, FLAG_INV_LOCKED))
221	return 2;
222		223
223	/* Allow for things like '100 arrows' */
224	if ((count=atoi(cp))!=0) {
225	cp=strchr(cp, ' ');
226	while (cp && cp[0]==' ') ++cp; /* get rid of spaces */
227	}
228	else {
229	if (pl->type==PLAYER)
230	count=pl->contr->count;
231	else
232	count = 0;
233	}
234
235	if (!cp \|\| cp[0]=='\0' \|\| count<0) return 0;
236
237
238	/* The code here should go from highest retval to lowest. That	224	/* 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	225	* 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	226	* 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	227	* later. So keep it in descending order here, so we try for the best
242	* match first, and work downward.	228	* match first, and work downward.
243	*/	229	*/
244	if (!strcasecmp(cp,query_name(op))) retval=20;	230	if (!strcasecmp (cp, query_name (op)))
		231	retval = 20;
245	else if (!strcasecmp(cp,query_short_name(op))) retval=18;	232	else if (!strcasecmp (cp, query_short_name (op)))
246	else if (!strcasecmp(cp,query_base_name(op,0))) retval=16;	233	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),	234	else if (!strcasecmp (cp, query_base_name (op, 0)))
250	strlen(cp))) retval=14;	235	retval = 16;
251	else if (!strncasecmp(cp,query_base_name(op,1),	236	else if (!strcasecmp (cp, query_base_name (op, 1)))
252	strlen(cp))) retval=14;	237	retval = 16;
253		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;
254	/* Do substring checks, so things like 'Str+1' will match.	244	/* Do substring checks, so things like 'Str+1' will match.
255	* retval of these should perhaps be lower - they are lower	245	* retval of these should perhaps be lower - they are lower
256	* then the specific strcasecmp aboves, but still higher than	246	* then the specific strcasecmp aboves, but still higher than
257	* some other match criteria.	247	* some other match criteria.
258	*/	248	*/
259	else if (strstr(query_base_name(op,1), cp)) retval = 12;	249	else if (strstr (query_base_name (op, 1), cp))
		250	retval = 12;
260	else if (strstr(query_base_name(op,0), cp)) retval = 12;	251	else if (strstr (query_base_name (op, 0), cp))
		252	retval = 12;
261	else if (strstr(query_short_name(op), cp)) retval = 12;	253	else if (strstr (query_short_name (op), cp))
262		254	retval = 12;
263	/* Check against plural/non plural based on count. */	255	/* Check against plural/non plural based on count. */
264	else if (count>1 && !strcasecmp(cp,op->name_pl)) {	256	else if (count > 1 && !strcasecmp (cp, op->name_pl))
265	retval=6;	257	retval = 6;
266	}
267	else if (count==1 && !strcasecmp(op->name,cp)) {	258	else if (count == 1 && !strcasecmp (op->name, cp))
268	retval=6;	259	retval = 6;
269	}
270	/* base name matched - not bad */	260	/* base name matched - not bad */
271	else if (strcasecmp(cp,op->name)==0 && !count) retval=4;	261	else if (strcasecmp (cp, op->name) == 0 && !count)
		262	retval = 4;
272	/* Check for partial custom name, but give a real low priority */	263	/* Check for partial custom name, but give a real low priority */
273	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;
274		266
275	if (retval) {	267	if (retval)
		268	{
276	if (pl->type == PLAYER)	269	if (pl->type == PLAYER)
277	pl->contr->count=count;	270	pl->contr->count = count;
		271
278	return retval;	272	return retval;
279	}	273	}
280	}	274	}
		275
		276	return 0;
		277	}
		278
		279	archetype::archetype (const char *name)
		280	{
		281	stub = true;
		282	arch = this;
		283	this->archname = this->name = this->name_pl = name;
		284	}
		285
		286	archetype::~archetype ()
		287	{
		288	unlink ();
		289	}
		290
		291	void
		292	archetype::link ()
		293	{
		294	ht.insert (std::make_pair (archname, this));
		295
		296	if (!archetypes.contains (this))
		297	archetypes.insert (this);
		298	}
		299
		300	void
		301	archetype::unlink ()
		302	{
		303	ht.erase (archname);
		304	if (!strcmp (&archname, "Gaea")) fprintf (stderr, "oI\n");//D
		305	if (archetypes.contains (this))
		306	archetypes.erase (this);
		307	}
		308
		309	/*
		310	* Finds, using the hashtable, which archetype matches the given name.
		311	* returns a pointer to the found archetype, otherwise NULL.
		312	*/
		313	archetype *
		314	archetype::find (const char *name)
		315	{
		316	if (!name)
281	return 0;	317	return 0;
282	}
283		318
284	/*	319	auto (i, ht.find (name));
285	* Initialises the internal linked list of archetypes (read from file).
286	* Then the global "empty_archetype" pointer is initialised.
287	* Then the blocksview[] array is initialised.
288	*/
289		320
290	void init_archetypes(void) { /* called from add_player() and edit() */	321	if (i == ht.end ())
291	if(first_archetype!=NULL) /* Only do this once */
292	return;	322	return 0;
293	arch_init = 1;	323	else
294	load_archetypes();	324	return i->second;
295	arch_init = 0;
296	empty_archetype=find_archetype("empty_archetype");
297	/* init_blocksview();*/
298	}	325	}
299		326
300	/*
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_...
320	*/
321
322	void init_archetable(void) {
323	archetype *at;	327	archetype *
324	LOG(llevDebug," Setting up archetable...\n");	328	archetype::get (const char *name)
325	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more)	329	{
326	add_arch(at);	330	if (!name)
327	LOG(llevDebug,"done\n");	331	{
328	}	332	LOG (llevError, "null archetype requested\n");
		333	name = "(null)";
		334	}
329		335
330	/*	336	archetype *at = find (name);
331	* Dumps an archetype to debug-level output.
332	*/
333		337
334	void dump_arch(archetype *at) {	338	if (!at)
335	dump_object(&at->clone);	339	{
336	}	340	at = new archetype (name);
		341	at->link ();
		342	}
337		343
338	/*	344	return at;
339	* Dumps _all_ archetypes to debug-level output.	345	}
340	* If you run crossfire with debug, and enter DM-mode, you can trigger
341	* this with the O key.
342	*/
343		346
344	void dump_all_archetypes(void) {
345	archetype *at;	347	archetype *
346	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) {	348	archetype::read (object_thawer &f)
347	dump_arch(at);	349	{
348	fprintf(logfile, "%s\n", errmsg);	350	assert (f.kw == KW_object);
		351
		352	loading_arch = true; // hack to tell parse_kv et al. to behave
		353
		354	std::vector<archetype *> parts;
		355
		356	coroapi::cede_to_tick_every (10);
		357
		358	for (;;)
		359	{
		360	// the archetype might have been referenced earlier
		361	// so try to find an existing stub archetype first
		362	archetype *at = find (f.get_str ());
		363
		364	if (!at \|\| !at->stub)
		365	at = new archetype (f.get_str ());
		366
		367	f.next ();
		368
		369	#if 0
		370	// implementing it here in the server does neither allow multiple inheritence
		371	// nor does it cleanly "just override". it would allow use in map files, though,
		372	// and other resource files dynamically laoded (as opposed to being preprocessed).
		373	// not that any of this is relevant as of yet...
		374	if (f.kw == KW_inherit)
		375	{
		376	if (archetype *at = find (f.get_str ()))
		377	*op = at->clone;
		378	else
		379	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		380	&at->archname, f.get_str ());
		381
		382	f.next ();
		383	}
		384	#endif
		385
		386	if (!at->parse_kv (f))
		387	goto fail;
		388
		389	at->post_load_check ();
		390
		391	parts.push_back (at);
		392
		393	if (f.kw != KW_more)
		394	break;
		395
		396	f.next ();
		397
		398	if (f.kw != KW_object)
		399	{
		400	f.parse_error ("more object");
		401	goto fail;
		402	}
		403	}
		404
		405	loading_arch = false;
		406
		407	{
		408	auto (at, parts.begin ());
		409
		410	archetype *new_head = parts.front ();
		411	archetype *old_head = find (new_head->archname);
		412
		413	if (old_head && !old_head->is_head ())
		414	{
		415	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		416	&new_head->archname, &old_head->archname);
		417	goto fail;
		418	}
		419
		420	// check that all archetypes belong to the same old object or are new
		421	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		422	{
		423	archetype new_part = at;
		424	archetype *old_part = find (new_part->archname);
		425
		426	if (old_part && old_part->head_ () != old_head)
		427	{
		428	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		429	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		430	goto fail;
		431	}
		432	}
		433
		434	// deactivate existing archetype
		435	for (archetype at = old_head; at; at = (archetype )at->more)
		436	at->unlink ();
		437
		438	// assemble new chain
		439	new_head->min_x = new_head->max_x = new_head->x;
		440	new_head->min_y = new_head->max_y = new_head->y;
		441
		442	archetype *less = new_head;
		443	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		444	{
		445	archetype at = p;
		446
		447	// some flags get inherited formt he head (probably a lot more)
		448	// doing it here doesn't feel too cozy, but it allows code
		449	// to ignore head checks for these flags, which saves time
		450	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		451	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		452	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		453	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		454
		455	if (at->x < new_head->min_x) new_head->min_x = at->x;
		456	if (at->y < new_head->min_y) new_head->min_y = at->y;
		457	if (at->x > new_head->max_x) new_head->max_x = at->x;
		458	if (at->y > new_head->max_y) new_head->max_y = at->y;
		459
		460	at->head = new_head;
		461	less->more = at;
		462	less = at;
		463	}
		464
		465	// now activate it
		466	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		467	{
		468	archetype at = p;
		469	at->stub = false;
		470	at->link ();
		471	}
		472
		473	return new_head;
349	}	474	}
350	}
351		475
352	void free_all_archs(void)	476	fail:
353	{	477	for (auto (p, parts.begin ()); p != parts.end (); ++p)
354	archetype at, next;	478	(*p)->destroy (true);
355	int i=0,f=0;
356		479
357	for (at=first_archetype; at!=NULL; at=next) {	480	loading_arch = false;
358	if (at->more) next=at->more;
359	else next=at->next;
360	if (at->name) free_string(at->name);
361	if (at->clone.name) free_string(at->clone.name);
362	if (at->clone.name_pl) free_string(at->clone.name_pl);
363	if (at->clone.title) free_string(at->clone.title);
364	if (at->clone.race) free_string(at->clone.race);
365	if (at->clone.slaying) free_string(at->clone.slaying);
366	if (at->clone.msg) free_string(at->clone.msg);
367	free(at);
368	i++;
369	}
370	LOG(llevDebug,"Freed %d archetypes, %d faces\n", i, f);
371	}
372
373	/*
374	* Allocates, initialises and returns the pointer to an archetype structure.
375	*/
376
377	archetype *get_archetype_struct(void) {
378	archetype *arch;
379
380	arch=(archetype *)CALLOC(1,sizeof(archetype));
381	if(arch==NULL)
382	fatal(OUT_OF_MEMORY);
383	arch->next=NULL;
384	arch->name=NULL;
385	arch->clone.other_arch=NULL;
386	arch->clone.name=NULL;
387	arch->clone.name_pl=NULL;
388	arch->clone.title=NULL;
389	arch->clone.race=NULL;
390	arch->clone.slaying=NULL;
391	arch->clone.msg=NULL;
392	clear_object(&arch->clone); /* to initial state other also */
393	CLEAR_FLAG((&arch->clone),FLAG_FREED); /* This shouldn't matter, since copy_object() */
394	SET_FLAG((&arch->clone), FLAG_REMOVED); /* doesn't copy these flags... */
395	arch->head=NULL;
396	arch->more=NULL;
397	return arch;	481	return 0;
398	}	482	}
399		483
400	/*	484	/*
401	* Reads/parses the archetype-file, and copies into a linked list	485	* Initialize global archtype pointers:
402	* of archetype-structures.
403	*/
404	void first_arch_pass(FILE *fp) {
405	object *op;
406	archetype at,head=NULL,*last_more=NULL;
407	int i,first=2;
408
409	object_thawer thawer;
410
411	op=get_object();
412	op->arch=first_archetype=at=get_archetype_struct();
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);
418	/* 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.
420	* by doing so, when a monster is created, it has good starting
421	* values for the body_used info, so when items are created
422	* for it, they can be properly equipped.
423	*/	486	*/
424	memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info));	487	void
425		488	init_archetype_pointers ()
426	switch(i) {	489	{
427	case LL_NORMAL: /* A new archetype, just link it with the previous */	490	ring_arch = archetype::find ("ring");
428	if(last_more!=NULL)	491	amulet_arch = archetype::find ("amulet");
429	last_more->next=at;	492	staff_arch = archetype::find ("staff");
430	if(head!=NULL)	493	crown_arch = archetype::find ("crown");
431	head->next=at;	494	empty_archetype = archetype::find ("empty_archetype");
432	head=last_more=at;
433	#if 0
434	if(!op->type)
435	LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name);
436	#endif
437	at->tail_x = 0;
438	at->tail_y = 0;
439	break;
440
441	case LL_MORE: /* Another part of the previous archetype, link it correctly */
442
443	at->head=head;
444	at->clone.head = &head->clone;
445	if(last_more!=NULL) {
446	last_more->more=at;
447	last_more->clone.more = &at->clone;
448	}
449	last_more=at;
450
451	/* If this multipart image is still composed of individual small
452	* 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
454	* easier as just looking at the head, we know what to do.
455	*/
456	if (at->clone.face != head->clone.face) {
457	head->tail_x = 0;
458	head->tail_y = 0;
459	} else {
460	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
461	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
462	}
463	break;
464
465	}
466
467	at=get_archetype_struct();
468	clear_object(op);
469	op->arch=at;
470	}
471	free(at);
472	free_object(op);
473	}
474
475	/*
476	* Reads the archetype file once more, and links all pointers between
477	* archetypes.
478	*/
479
480	void second_arch_pass(FILE *fp) {
481	char buf[MAX_BUF],variable=buf,argument,*cp;
482	archetype at=NULL,other;
483
484	while(fgets(buf,MAX_BUF,fp)!=NULL) {
485	if(*buf=='#')
486	continue;
487	if((argument=strchr(buf,' '))!=NULL) {
488	*argument='\0',argument++;
489	cp = argument + strlen(argument)-1;
490	while (isspace(*cp)) {
491	*cp='\0';
492	cp--;
493	}
494	}
495	if(!strcmp("Object",variable)) {
496	if((at=find_archetype(argument))==NULL)
497	LOG(llevError,"Warning: failed to find arch %s\n",argument);
498	} else if(!strcmp("other_arch",variable)) {
499	if(at!=NULL&&at->clone.other_arch==NULL) {
500	if((other=find_archetype(argument))==NULL)
501	LOG(llevError,"Warning: failed to find other_arch %s\n",argument);
502	else if(at!=NULL)
503	at->clone.other_arch=other;
504	}
505	} else if(!strcmp("randomitems",variable)) {
506	if(at!=NULL) {
507	treasurelist *tl=find_treasurelist(argument);
508	if(tl==NULL)
509	LOG(llevError,"Failed to link treasure to arch (%s): %s\n",at->name, argument);
510	else
511	at->clone.randomitems=tl;
512	}
513	}
514	}
515	}
516
517	#ifdef DEBUG
518	void check_generators(void) {
519	archetype *at;
520	for(at=first_archetype;at!=NULL;at=at->next)
521	if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL)
522	LOG(llevError,"Warning: %s is generator but lacks other_arch.\n",
523	at->name);
524	}
525	#endif
526
527	/*
528	* First initialises the archtype hash-table (init_archetable()).
529	* Reads and parses the archetype file (with the first and second-pass
530	* functions).
531	* Then initialises treasures by calling load_treasures().
532	*/
533
534	void load_archetypes(void) {
535	FILE *fp;
536	char filename[MAX_BUF];
537	int comp;
538	#if TIME_ARCH_LOAD
539	struct timeval tv1,tv2;
540	#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	}
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");
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	}	495	}
585		496
586	/*	497	/*
587	* Creates and returns a new object which is a copy of the given archetype.	498	* Creates and returns a new object which is a copy of the given archetype.
588	* This function returns NULL on failure.	499	* This function returns NULL on failure.
589	*/	500	*/
590		501	object *
591	object arch_to_object(archetype at) {	502	arch_to_object (archetype *at)
592	object *op;	503	{
593	if(at==NULL) {	504	if (!at)
594	if(warn_archetypes)	505	{
595	LOG(llevError,"Couldn't find archetype.\n");	506	LOG (llevError, "Couldn't find archetype.\n");
596	return NULL;	507	return 0;
597	}	508	}
598	op=get_object();	509
599	copy_object(&at->clone,op);	510	object *op = at->clone ();
		511	op->arch = at;
600	op->instantiate ();	512	op->instantiate ();
601	op->arch=at;	513
602	return op;	514	return op;
603	}	515	}
604		516
605	/*	517	/*
606	* Creates an object. This function is called by get_archetype()	518	* Creates an object. This function is called by get_archetype()
607	* if it fails to find the appropriate archetype.	519	* if it fails to find the appropriate archetype.
608	* Thus get_archetype() will be guaranteed to always return	520	* Thus get_archetype() will be guaranteed to always return
609	* an object, and never NULL.	521	* an object, and never NULL.
610	*/	522	*/
611		523	object *
612	object create_singularity(const char name) {	524	create_singularity (const char *name)
613	object *op;	525	{
		526	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
		527
		528	if (!strcmp (name, "bug"))
		529	abort ();
		530
614	char buf[MAX_BUF];	531	char buf[MAX_BUF];
615	sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name);	532	sprintf (buf, "bug, please report (%s)", name);
616	op = get_object();	533
617	op->name = add_string(buf);	534	object *op = get_archetype ("bug");
618	op->name_pl = add_string(buf);	535	op->name = op->name_pl = buf;
619	SET_FLAG(op,FLAG_NO_PICK);	536
620	return op;	537	return op;
621	}	538	}
622		539
623	/*	540	/*
624	* Finds which archetype matches the given name, and returns a new	541	* Finds which archetype matches the given name, and returns a new
625	* object containing a copy of the archetype.	542	* object containing a copy of the archetype.
626	*/	543	*/
627		544	object *
628	object get_archetype(const char name) {	545	get_archetype (const char *name)
629	archetype *at;	546	{
630	at = find_archetype(name);	547	archetype *at = archetype::find (name);
631	if (at == NULL)	548
		549	if (!at)
632	return create_singularity(name);	550	return create_singularity (name);
		551
633	return arch_to_object(at);	552	return arch_to_object (at);
634	}
635
636	/*
637	* Hash-function used by the arch-hashtable.
638	*/
639
640	unsigned long
641	hasharch(const char *str, int tablesize) {
642	unsigned long hash = 0;
643	int i = 0;
644	const char *p;
645
646	/* use the one-at-a-time hash function, which supposedly is
647	* better than the djb2-like one used by perl5.005, but
648	* certainly is better then the bug used here before.
649	* see http://burtleburtle.net/bob/hash/doobs.html
650	*/
651	for (p = str; i < MAXSTRING && *p; p++, i++) {
652	hash += *p;
653	hash += hash << 10;
654	hash ^= hash >> 6;
655	}
656	hash += hash << 3;
657	hash ^= hash >> 11;
658	hash += hash << 15;
659	return hash % tablesize;
660	}
661
662	/*
663	* Finds, using the hashtable, which archetype matches the given name.
664	* returns a pointer to the found archetype, otherwise NULL.
665	*/
666
667	archetype find_archetype(const char name) {
668	archetype *at;
669	unsigned long index;
670
671	if (name == NULL)
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;
686	if(++index>=ARCHTABLE)
687	index=0;
688	}
689	}
690
691	/*
692	* Adds an archetype to the hashtable.
693	*/
694
695	static void add_arch(archetype *at) {
696	int index=hasharch(at->name, ARCHTABLE),org_index=index;
697	for(;;) {
698	if(arch_table[index]==NULL) {
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	}	553	}
708		554
709	/*	555	/*
710	* Returns the first archetype using the given type.	556	* Returns the first archetype using the given type.
711	* Used in treasure-generation.	557	* Used in treasure-generation.
712	*/	558	*/
713
714	archetype *type_to_archetype(int type) {
715	archetype *at;	559	archetype *
716		560	type_to_archetype (int type)
717	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more)	561	{
718	if(at->clone.type==type)	562	for_all_archetypes (at)
		563	if (at->type == type && at->head_ () != at)
719	return at;	564	return at;
		565
720	return NULL;	566	return 0;
721	}	567	}
722		568
723	/*	569	/*
724	* Returns a new object copied from the first archetype matching	570	* Returns a new object copied from the first archetype matching
725	* the given type.	571	* the given type.
726	* Used in treasure-generation.	572	* Used in treasure-generation.
727	*/	573	*/
728		574	object *
729	object *clone_arch(int type) {	575	clone_arch (int type)
		576	{
730	archetype *at;	577	archetype *at;
731	object *op=get_object();
732		578
733	if((at=type_to_archetype(type))==NULL) {	579	if ((at = type_to_archetype (type)) == NULL)
		580	{
734	LOG(llevError,"Can't clone archetype %d\n",type);	581	LOG (llevError, "Can't clone archetype %d\n", type);
735	free_object(op);
736	return NULL;	582	return 0;
737	}	583	}
738	copy_object(&at->clone,op);	584
		585	object *op = at->clone ();
739	op->instantiate ();	586	op->instantiate ();
740	return op;	587	return op;
741	}	588	}
742		589
743	/*	590	/*
744	* member: make instance from class	591	* member: make instance from class
745	*/	592	*/
746		593	object *
747	object object_create_arch (archetype at)	594	object_create_arch (archetype *at)
748	{	595	{
749	object op, prev = NULL, *head = NULL;	596	object op, prev = 0, *head = 0;
750		597
751	while (at) {	598	while (at)
		599	{
752	op = arch_to_object (at);	600	op = arch_to_object (at);
		601
753	op->x = at->clone.x;	602	op->x = at->x;
754	op->y = at->clone.y;	603	op->y = at->y;
		604
755	if (head)	605	if (head)
756	op->head = head, prev->more = op;	606	op->head = head, prev->more = op;
		607
757	if (!head)	608	if (!head)
758	head = op;	609	head = op;
		610
759	prev = op;	611	prev = op;
760	at = at->more;	612	at = (archetype *)at->more;
761	}	613	}
		614
762	return (head);	615	return head;
763	}	616	}
764		617
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.68 by root, Sun Jul 1 05:00:17 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.68 by root, Sun Jul 1 05:00:17 2007 UTC