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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.10 by root, Sun Sep 3 00:18:39 2006 UTC vs.
Revision 1.74 by root, Sun Apr 20 05:24:55 2008 UTC

…		…
1	/*	1	/*
2	* static char *rcsid_arch_c =	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	* "$Id: arch.C,v 1.10 2006/09/03 00:18:39 root Exp $";	3	*
4	*/	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5
6	/*
7	CrossFire, A Multiplayer game for X-windows
8
9	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
10	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
11		7	*
12	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
13	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
14	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
15	(at your option) any later version.	11	* (at your option) any later version.
16		12	*
17	This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
18	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
19	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20	GNU General Public License for more details.	16	* GNU General Public License for more details.
21		17	*
22	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
23	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
24	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
25		21	* The authors can be reached via e-mail to <support@deliantra.net>
26	The authors can be reached via e-mail at crossfire-devel@real-time.com
27	*/	22	*/
		23
		24	#include <cassert>
28		25
29	#include <global.h>	26	#include <global.h>
30	#include <arch.h>
31	#include <funcpoint.h>	27	#include <funcpoint.h>
32	#include <loader.h>	28	#include <loader.h>
33		29
34	#include <cassert>	30	#include <tr1/functional>
		31	#include <tr1/unordered_map>
35		32
36	/* IF set, does a little timing on the archetype load. */	33	archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
37	#define TIME_ARCH_LOAD 0	34	arch_ptr archetype::empty;
38		35
39	static void add_arch(archetype *at);	36	// the hashtable
		37	typedef std::tr1::unordered_map
		38	<
		39	const char *,
		40	arch_ptr,
		41	str_hash,
		42	str_equal,
		43	slice_allocator< std::pair<const char *const, arch_ptr> >
		44	> HT;
40		45
41	static archetype *arch_table[ARCHTABLE];	46	static HT ht (10000);
42	int arch_cmp=0; /* How many strcmp's */	47	archvec archetypes;
43	int arch_search=0; /* How many searches */	48	static unordered_vector<archetype *> allarch;
44	int arch_init; /* True if doing arch initialization */	49	static int dirtycnt;
45		50
46	/* The naming of these functions is really poor - they are all	51	// the vector of other_arch references to be resolved
47	* pretty much named '.._arch_...', but they may more may not	52	static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
48	* return archetypes. Some make the arch_to_object call, and thus	53	// the vector of loaded but not yet committed archetypes
49	* return an object. Perhaps those should be called 'archob' functions	54	static std::vector<archetype *> postponed_arch;
50	* to denote they return an object derived from the archetype.
51	* MSW 2003-04-29
52	*/
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	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)	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;	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)	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);	213	{
162	}	214	if (pl->type == PLAYER)
163		215	count = pl->contr->count;
164	/* This is a subset of the parse_id command. Basically, name can be	216	else
165	* a string seperated lists of things to match, with certain keywords.	217	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	}	218	}
		219
		220	if (!cp \|\| cp[0] == '\0' \|\| count < 0)
		221	return 0;
		222
		223
		224	/* The code here should go from highest retval to lowest. That
		225	* is because of the 'else' handling - we don't want to match on
		226	* something and set a low retval, even though it may match a higher retcal
		227	* later. So keep it in descending order here, so we try for the best
		228	* match first, and work downward.
		229	*/
		230	if (!strcasecmp (cp, query_name (op)))
		231	retval = 20;
		232	else if (!strcasecmp (cp, query_short_name (op)))
		233	retval = 18;
		234	else if (!strcasecmp (cp, query_base_name (op, 0)))
		235	retval = 16;
		236	else if (!strcasecmp (cp, query_base_name (op, 1)))
		237	retval = 16;
		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;
		244	/* Do substring checks, so things like 'Str+1' will match.
		245	* retval of these should perhaps be lower - they are lower
		246	* then the specific strcasecmp aboves, but still higher than
		247	* some other match criteria.
		248	*/
		249	else if (strstr (query_base_name (op, 1), cp))
		250	retval = 12;
		251	else if (strstr (query_base_name (op, 0), cp))
		252	retval = 12;
		253	else if (strstr (query_short_name (op), cp))
		254	retval = 12;
		255	/* Check against plural/non plural based on count. */
		256	else if (count > 1 && !strcasecmp (cp, op->name_pl))
		257	retval = 6;
		258	else if (count == 1 && !strcasecmp (op->name, cp))
		259	retval = 6;
		260	/* base name matched - not bad */
		261	else if (strcasecmp (cp, op->name) == 0 && !count)
		262	retval = 4;
		263	/* Check for partial custom name, but give a real low priority */
		264	else if (op->custom_name && strstr (op->custom_name, cp))
		265	retval = 3;
		266
		267	if (retval)
208	else {	268	{
209	if (pl->type==PLAYER)	269	if (pl->type == PLAYER)
210	count=pl->contr->count;	270	pl->contr->count = count;
211	else	271
212	count = 0;	272	return retval;
213	}	273	}
		274	}
214		275
215	if (!cp \|\| cp[0]=='\0' \|\| count<0) return 0;	276	return 0;
		277	}
216		278
		279	archetype::archetype (const char *name)
		280	{
		281	arch = this;
		282	this->archname = this->name = this->name_pl = name;
		283	}
217		284
218	/* The code here should go from highest retval to lowest. That	285	archetype::~archetype ()
219	* is because of the 'else' handling - we don't want to match on	286	{
220	* something and set a low retval, even though it may match a higher retcal	287	unlink ();
221	* later. So keep it in descending order here, so we try for the best	288	}
222	* match first, and work downward.	289
		290	void
		291	archetype::link ()
		292	{
		293	if (!archetypes.contains (this))
		294	{
		295	archetypes.insert (this);
		296	ht.insert (std::make_pair (archname, this));
		297	}
		298	}
		299
		300	void
		301	archetype::unlink ()
		302	{
		303	if (archetypes.contains (this))
		304	{
		305	archetypes.erase (this);
		306	ht.erase (archname);
		307	}
		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::read (object_thawer &f)
		330	{
		331	assert (f.kw == KW_object);
		332
		333	std::vector<archetype *> parts;
		334
		335	coroapi::cede_to_tick ();
		336
		337	for (;;)
		338	{
		339	archetype *at = new archetype (f.get_str ());
		340
		341	f.next ();
		342
		343	#if 0
		344	// implementing it here in the server does neither allow multiple inheritence
		345	// nor does it cleanly "just override". it would allow use in map files, though,
		346	// and other resource files dynamically laoded (as opposed to being preprocessed).
		347	// not that any of this is relevant as of yet...
		348	if (f.kw == KW_inherit)
223	*/	349	{
224	if (!strcasecmp(cp,query_name(op))) retval=20;	350	if (archetype *at = find (f.get_str ()))
225	else if (!strcasecmp(cp,query_short_name(op))) retval=18;	351	*op = at->clone;
226	else if (!strcasecmp(cp,query_base_name(op,0))) retval=16;	352	else
227	else if (!strcasecmp(cp,query_base_name(op,1))) retval=16;	353	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;	354	&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		355
234	/* Do substring checks, so things like 'Str+1' will match.	356	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	}	357	}
247	else if (count==1 && !strcasecmp(op->name,cp)) {	358	#endif
248	retval=6;	359
		360	loading_arch = at; // hack to tell parse_kv et al. to behave
		361	bool parse_ok = at->parse_kv (f);
		362	loading_arch = 0;
		363
		364	if (!parse_ok)
		365	goto fail;
		366
		367	loading_arch = at; // hack to tell parse_kv et al. to behave
		368	at->post_load_check ();
		369	loading_arch = 0;
		370
		371	parts.push_back (at);
		372
		373	if (f.kw != KW_more)
		374	break;
		375
		376	f.next ();
		377
		378	if (f.kw != KW_object)
		379	{
		380	f.parse_error ("more object");
		381	goto fail;
249	}	382	}
250	/* base name matched - not bad */	383	}
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		384
255	if (retval) {	385	{
256	if (pl->type == PLAYER)	386	auto (at, parts.begin ());
257	pl->contr->count=count;	387
		388	archetype *new_head = parts.front ();
		389	archetype *old_head = find (new_head->archname);
		390
		391	if (old_head && !old_head->is_head ())
		392	{
		393	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		394	&new_head->archname, &old_head->archname);
		395	goto fail;
		396	}
		397
		398	// check that all archetypes belong to the same old object or are new
		399	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		400	{
		401	archetype new_part = at;
		402	archetype *old_part = find (new_part->archname);
		403
		404	if (old_part && old_part->head_ () != old_head)
		405	{
		406	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
		407	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
		408	goto fail;
		409	}
		410	}
		411
		412	// assemble new chain
		413	new_head->min_x = new_head->max_x = new_head->x;
		414	new_head->min_y = new_head->max_y = new_head->y;
		415
		416	archetype *less = new_head;
		417	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		418	{
		419	archetype at = p;
		420
		421	// some flags get inherited from the head (probably a lot more)
		422	// doing it here doesn't feel too cozy, but it allows code
		423	// to ignore head checks for these flags, which saves time
		424	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		425	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		426	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		427	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		428
		429	new_head->min_x = min (new_head->min_x, at->x);
		430	new_head->min_y = min (new_head->min_y, at->y);
		431	new_head->max_x = max (new_head->max_x, at->x);
		432	new_head->max_y = max (new_head->max_y, at->y);
		433
		434	at->head = new_head;
		435	less->more = at;
		436	less = at;
		437	}
		438
		439	postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
		440
		441	return new_head;
		442	}
		443
		444	fail:
		445	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		446	(*p)->destroy (true);
		447
		448	return 0;
		449	}
		450
		451	void
		452	archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
		453	{
		454	ref = 0;
		455	postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
		456	}
		457
		458	void
		459	archetype::commit_load ()
		460	{
		461	// unlink old archetypes and link in new ones */
		462	for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
		463	{
		464	archetype at = p;
		465
		466	if (archetype *old = find (at->archname))
		467	old->unlink ();
		468
		469	allarch.push_back (at);
		470
		471	at->link ();
		472	++dirtycnt;
		473	}
		474
		475	postponed_arch.clear ();
		476
		477	// now resolve arch references
		478	for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
		479	{
		480	arch_ptr *ap = p->first;
		481	archetype *at = find (p->second);
		482
		483	if (!at)
		484	LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
		485
		486	*ap = at;
		487	}
		488
		489	postponed_arch_ref.clear ();
		490
		491	empty = find (shstr_empty_archetype);
		492	}
		493
		494	void
		495	archetype::gc ()
		496	{
		497	int cnt = max (1, min (allarch.size () / 128, dirtycnt));
		498	dirtycnt = max (0, dirtycnt - cnt);
		499
		500	do
		501	{
		502	static int idx;
		503
		504	if (idx >= allarch.size ())
		505	if (idx)
		506	idx = 0;
		507	else
258	return retval;	508	return;
		509
		510	archetype *at = allarch [idx];
		511
		512	if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
		513	++idx;
		514	else
		515	{
		516	LOG (llevDebug, "garbage collect arch %s", at->debug_desc ());
		517	assert (at->arch == at); // verify that refcnt == 1 is truely valid
		518	allarch.erase (idx);
		519	at->arch = 0;
		520	at->more = 0;
		521	at->destroy ();
259	}	522	}
260	}	523	}
261	return 0;	524	while (--cnt);
262	}
263
264	/*
265	* Initialises the internal linked list of archetypes (read from file).
266	* Then the global "empty_archetype" pointer is initialised.
267	* Then the blocksview[] array is initialised.
268	*/
269
270	void init_archetypes(void) { /* called from add_player() and edit() */
271	if(first_archetype!=NULL) /* Only do this once */
272	return;
273	arch_init = 1;
274	load_archetypes();
275	arch_init = 0;
276	empty_archetype=find_archetype("empty_archetype");
277	/* init_blocksview();*/
278	}
279
280	/*
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	*/
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	}
330	}
331
332	void free_all_archs(void)
333	{
334	archetype at, next;
335	int i=0,f=0;
336
337	for (at=first_archetype; at!=NULL; at=next) {
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;
361	}
362
363	/*
364	* Reads/parses the archetype-file, and copies into a linked list
365	* of archetype-structures.
366	*/
367	void first_arch_pass(object_thawer &fp) {
368	object *op;
369	archetype at,head=NULL,*last_more=NULL;
370	int i,first=2;
371
372	op=get_object();
373	op->arch=first_archetype=at=get_archetype_struct();
374
375	while((i=load_object(fp,op,first,0))) {
376	first=0;
377	copy_object(op,&at->clone);
378	at->clone.speed_left= (float) (-0.1);
379	/* copy the body_info to the body_used - this is only really
380	* need for monsters, but doesn't hurt to do it for everything.
381	* by doing so, when a monster is created, it has good starting
382	* values for the body_used info, so when items are created
383	* for it, they can be properly equipped.
384	*/
385	memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info));
386
387	switch(i) {
388	case LL_NORMAL: /* A new archetype, just link it with the previous */
389	if(last_more!=NULL)
390	last_more->next=at;
391	if(head!=NULL)
392	head->next=at;
393	head=last_more=at;
394	#if 0
395	if(!op->type)
396	LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name);
397	#endif
398	at->tail_x = 0;
399	at->tail_y = 0;
400	break;
401
402	case LL_MORE: /* Another part of the previous archetype, link it correctly */
403
404	at->head=head;
405	at->clone.head = &head->clone;
406	if(last_more!=NULL) {
407	last_more->more=at;
408	last_more->clone.more = &at->clone;
409	}
410	last_more=at;
411
412	/* If this multipart image is still composed of individual small
413	* images, don't set the tail_.. values. We can't use them anyways,
414	* and setting these to zero makes the map sending to the client much
415	* easier as just looking at the head, we know what to do.
416	*/
417	if (at->clone.face != head->clone.face) {
418	head->tail_x = 0;
419	head->tail_y = 0;
420	} else {
421	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
422	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
423	}
424	break;
425
426	}
427
428	at=get_archetype_struct();
429	clear_object(op);
430	op->arch=at;
431	}
432
433	delete at;
434	free_object(op);
435	}
436
437	/*
438	* Reads the archetype file once more, and links all pointers between
439	* archetypes.
440	*/
441
442	void second_arch_pass(object_thawer &thawer) {
443	char buf[MAX_BUF],variable=buf,argument,*cp;
444	archetype at=NULL,other;
445
446	while(fgets(buf,MAX_BUF,thawer)!=NULL) {
447	if(*buf=='#')
448	continue;
449	if((argument=strchr(buf,' '))!=NULL) {
450	*argument='\0',argument++;
451	cp = argument + strlen(argument)-1;
452	while (isspace(*cp)) {
453	*cp='\0';
454	cp--;
455	}
456	}
457	if(!strcmp("Object",variable)) {
458	if((at=find_archetype(argument))==NULL)
459	LOG(llevError,"Warning: failed to find arch %s\n",argument);
460	} else if(!strcmp("other_arch",variable)) {
461	if(at!=NULL&&at->clone.other_arch==NULL) {
462	if((other=find_archetype(argument))==NULL)
463	LOG(llevError,"Warning: failed to find other_arch %s\n",argument);
464	else if(at!=NULL)
465	at->clone.other_arch=other;
466	}
467	} else if(!strcmp("randomitems",variable)) {
468	if(at!=NULL) {
469	treasurelist *tl=find_treasurelist(argument);
470	if(tl==NULL)
471	LOG(llevError,"Failed to link treasure to arch (%s): %s\n", &at->name, argument);
472	else
473	at->clone.randomitems=tl;
474	}
475	}
476	}
477	}
478
479	#ifdef DEBUG
480	void check_generators(void) {
481	archetype *at;
482	for(at=first_archetype;at!=NULL;at=at->next)
483	if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL)
484	LOG(llevError,"Warning: %s is generator but lacks other_arch.\n", &at->name);
485	}
486	#endif
487
488	/*
489	* First initialises the archtype hash-table (init_archetable()).
490	* Reads and parses the archetype file (with the first and second-pass
491	* functions).
492	* Then initialises treasures by calling load_treasures().
493	*/
494
495	void
496	load_archetypes (void)
497	{
498	char filename[MAX_BUF];
499	int comp;
500	#if TIME_ARCH_LOAD
501	struct timeval tv1, tv2;
502	#endif
503
504	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
505	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
506
507	{
508	object_thawer thawer (filename);
509
510	clear_archetable ();
511	LOG (llevDebug, " arch-pass 1...\n");
512	first_arch_pass (thawer);
513	LOG (llevDebug, " done\n");
514
515	init_archetable ();
516	warn_archetypes = 1;
517	}
518
519	{
520	object_thawer thawer (filename);
521
522	LOG (llevDebug, " loading treasure...\n");
523	load_treasures ();
524	LOG (llevDebug, " done\n arch-pass 2...\n");
525	second_arch_pass (thawer);
526	LOG (llevDebug, " done\n");
527	#ifdef DEBUG
528	check_generators ();
529	#endif
530	}
531	LOG (llevDebug, " done\n");
532	}	525	}
533		526
534	/*	527	/*
535	* Creates and returns a new object which is a copy of the given archetype.	528	* Creates and returns a new object which is a copy of the given archetype.
536	* This function returns NULL on failure.	529	* This function returns NULL on failure.
537	*/	530	*/
538		531	object *
539	object arch_to_object(archetype at) {	532	arch_to_object (archetype *at)
540	object *op;	533	{
541	if(at==NULL) {	534	if (!at)
542	if(warn_archetypes)	535	{
543	LOG(llevError,"Couldn't find archetype.\n");	536	LOG (llevError, "Couldn't find archetype.\n");
544	return NULL;	537	return 0;
545	}	538	}
546	op=get_object();	539
547	copy_object(&at->clone,op);	540	object *op = at->clone ();
		541	op->arch = at;
548	op->instantiate ();	542	op->instantiate ();
549	op->arch=at;	543
550	return op;	544	return op;
		545	}
		546
		547	object *
		548	archetype::instance ()
		549	{
		550	return arch_to_object (this);
551	}	551	}
552		552
553	/*	553	/*
554	* Creates an object. This function is called by get_archetype()	554	* Creates an object. This function is called by get_archetype()
555	* if it fails to find the appropriate archetype.	555	* if it fails to find the appropriate archetype.
556	* Thus get_archetype() will be guaranteed to always return	556	* Thus get_archetype() will be guaranteed to always return
557	* an object, and never NULL.	557	* an object, and never NULL.
558	*/	558	*/
559		559	object *
560	object create_singularity(const char name) {	560	create_singularity (const char *name)
561	object *op;	561	{
		562	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
		563
		564	if (!strcmp (name, "bug"))
		565	abort ();
		566
562	char buf[MAX_BUF];	567	char buf[MAX_BUF];
563	sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name);	568	sprintf (buf, "bug, please report (%s)", name);
564	op = get_object();	569
		570	object *op = get_archetype ("bug");
565	op->name = op->name_pl = buf;	571	op->name = op->name_pl = buf;
566	SET_FLAG(op,FLAG_NO_PICK);	572
567	return op;	573	return op;
568	}	574	}
569		575
570	/*	576	/*
571	* Finds which archetype matches the given name, and returns a new	577	* Finds which archetype matches the given name, and returns a new
572	* object containing a copy of the archetype.	578	* object containing a copy of the archetype.
573	*/	579	*/
574		580	object *
575	object get_archetype(const char name) {	581	get_archetype (const char *name)
576	archetype *at;	582	{
577	at = find_archetype(name);	583	archetype *at = archetype::find (name);
578	if (at == NULL)	584
		585	if (!at)
579	return create_singularity(name);	586	return create_singularity (name);
		587
580	return arch_to_object(at);	588	return arch_to_object (at);
581	}
582
583	/*
584	* Hash-function used by the arch-hashtable.
585	*/
586
587	unsigned long
588	hasharch(const char *str, int tablesize)
589	{
590	unsigned long hash = 0;
591	unsigned int i = 0;
592	const char *p;
593
594	/* use the one-at-a-time hash function, which supposedly is
595	* better than the djb2-like one used by perl5.005, but
596	* certainly is better then the bug used here before.
597	* see http://burtleburtle.net/bob/hash/doobs.html
598	*/
599	for (p = str; i < MAXSTRING && *p; p++, i++)
600	{
601	hash += *p;
602	hash += hash << 10;
603	hash ^= hash >> 6;
604	}
605
606	hash += hash << 3;
607	hash ^= hash >> 11;
608	hash += hash << 15;
609
610	return hash % tablesize;
611	}
612
613	/*
614	* Finds, using the hashtable, which archetype matches the given name.
615	* returns a pointer to the found archetype, otherwise NULL.
616	*/
617
618	archetype find_archetype(const char name) {
619	archetype *at;
620	unsigned long index;
621
622	if (name == NULL)
623	return (archetype *) NULL;
624
625	index=hasharch(name, ARCHTABLE);
626	arch_search++;
627	for(;;) {
628	at = arch_table[index];
629	if (at==NULL) {
630	if(warn_archetypes)
631	LOG(llevError,"Couldn't find archetype %s\n",name);
632	return NULL;
633	}
634	arch_cmp++;
635	if (!strcmp((const char *)at->name,name))
636	return at;
637	if(++index>=ARCHTABLE)
638	index=0;
639	}
640	}
641
642	/*
643	* Adds an archetype to the hashtable.
644	*/
645
646	static void add_arch(archetype *at) {
647	int index=hasharch((const char *)at->name, ARCHTABLE),org_index=index;
648	for(;;) {
649	if(arch_table[index]==NULL) {
650	arch_table[index]=at;
651	return;
652	}
653	if(++index==ARCHTABLE)
654	index=0;
655	if(index==org_index)
656	fatal(ARCHTABLE_TOO_SMALL);
657	}
658	}	589	}
659		590
660	/*	591	/*
661	* Returns the first archetype using the given type.	592	* Returns the first archetype using the given type.
662	* Used in treasure-generation.	593	* Used in treasure-generation.
663	*/	594	*/
664
665	archetype *type_to_archetype(int type) {
666	archetype *at;	595	archetype *
667		596	type_to_archetype (int type)
668	for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more)	597	{
669	if(at->clone.type==type)	598	for_all_archetypes (at)
		599	if (at->type == type && at->head_ () != at)
670	return at;	600	return at;
		601
671	return NULL;	602	return 0;
672	}	603	}
673		604
674	/*	605	/*
675	* Returns a new object copied from the first archetype matching	606	* Returns a new object copied from the first archetype matching
676	* the given type.	607	* the given type.
677	* Used in treasure-generation.	608	* Used in treasure-generation.
678	*/	609	*/
679		610	object *
680	object *clone_arch(int type) {	611	clone_arch (int type)
		612	{
681	archetype *at;	613	archetype *at;
682	object *op=get_object();
683		614
684	if((at=type_to_archetype(type))==NULL) {	615	if ((at = type_to_archetype (type)) == NULL)
		616	{
685	LOG(llevError,"Can't clone archetype %d\n",type);	617	LOG (llevError, "Can't clone archetype %d\n", type);
686	free_object(op);
687	return NULL;	618	return 0;
688	}	619	}
689	copy_object(&at->clone,op);	620
		621	object *op = at->clone ();
690	op->instantiate ();	622	op->instantiate ();
691	return op;	623	return op;
692	}	624	}
693		625
694	/*	626	/*
695	* member: make instance from class	627	* member: make instance from class
696	*/	628	*/
697		629	object *
698	object object_create_arch (archetype at)	630	object_create_arch (archetype *at)
699	{	631	{
700	object op, prev = NULL, *head = NULL;	632	object op, prev = 0, *head = 0;
701		633
702	while (at) {	634	while (at)
		635	{
703	op = arch_to_object (at);	636	op = arch_to_object (at);
		637
704	op->x = at->clone.x;	638	op->x = at->x;
705	op->y = at->clone.y;	639	op->y = at->y;
		640
706	if (head)	641	if (head)
707	op->head = head, prev->more = op;	642	op->head = head, prev->more = op;
		643
708	if (!head)	644	if (!head)
709	head = op;	645	head = op;
		646
710	prev = op;	647	prev = op;
711	at = at->more;	648	at = (archetype *)at->more;
712	}	649	}
		650
713	return (head);	651	return head;
714	}	652	}
715		653
716	/* end of arch.c */

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.10 by root, Sun Sep 3 00:18:39 2006 UTC vs. Revision 1.74 by root, Sun Apr 20 05:24:55 2008 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.10 by root, Sun Sep 3 00:18:39 2006 UTC vs.
Revision 1.74 by root, Sun Apr 20 05:24:55 2008 UTC