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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.11 by root, Sun Sep 3 22:45:55 2006 UTC vs.
Revision 1.65 by root, Thu Jun 7 18:55:24 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.11 by root, Sun Sep 3 22:45:55 2006 UTC vs. Revision 1.65 by root, Thu Jun 7 18:55:24 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.11 by root, Sun Sep 3 22:45:55 2006 UTC vs.
Revision 1.65 by root, Thu Jun 7 18:55:24 2007 UTC