ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/arch.C
(Generate patch)

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.11 by root, Sun Sep 3 22:45:55 2006 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 2009 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.11 2006/09/03 22:45:55 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 it under
13 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
14 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
15 (at your option) any later version. 11 * 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 Affero GNU General Public License
23 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
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 <support@deliantra.net>
27*/ 23 */
24
25#include <cassert>
28 26
29#include <global.h> 27#include <global.h>
30#include <arch.h>
31#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. */ 33archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
37#define TIME_ARCH_LOAD 0 34arch_ptr archetype::empty;
38 35
39static void add_arch(archetype *at); 36// the hashtable
37typedef 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
41static archetype *arch_table[ARCHTABLE]; 46static HT ht (10000);
42int arch_cmp=0; /* How many strcmp's */ 47archvec archetypes;
43int arch_search=0; /* How many searches */ 48static unordered_vector<archetype *> allarch;
44int arch_init; /* True if doing arch initialization */ 49static 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 52static 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 54static std::vector<archetype *> postponed_arch;
50 * to denote they return an object derived from the archetype. 55
51 * MSW 2003-04-29 56//+GPL
52 */
53 57
54/** 58/**
55 * GROS - This function retrieves an archetype given the name that appears 59 * GROS - This function retrieves an archetype given the name that appears
56 * during the game (for example, "writing pen" instead of "stylus"). 60 * 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. 61 * It does not use the hashtable system, but browse the whole archlist each time.
60 * Params: 64 * Params:
61 * - name: the name we're searching for (ex: "writing pen"); 65 * - name: the name we're searching for (ex: "writing pen");
62 * Return value: 66 * Return value:
63 * - the archetype found or null if nothing was found. 67 * - the archetype found or null if nothing was found.
64 */ 68 */
69archetype *
65archetype *find_archetype_by_object_name(const char *name) { 70find_archetype_by_object_name (const char *name)
66 archetype *at; 71{
72 shstr_cmp name_cmp (name);
67 73
68 if (name == NULL) 74 for_all_archetypes (at)
69 return (archetype *) NULL; 75 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; 76 return at;
74 } 77
75 return NULL; 78 return 0;
76} 79}
77 80
78/** 81/**
79 * This function retrieves an archetype by type and name that appears during 82 * 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() 83 * the game. It is basically the same as find_archetype_by_object_name()
81 * except that it considers only items of the given type. 84 * except that it considers only items of the given type.
82 */ 85 */
86archetype *
83archetype *find_archetype_by_object_type_name(int type, const char *name) { 87find_archetype_by_object_type_name (int type, const char *name)
84 archetype *at; 88{
89 shstr_cmp name_cmp (name);
85 90
86 if (name == NULL) 91 for_all_archetypes (at)
87 return NULL; 92 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; 93 return at;
92 }
93 94
94 return NULL; 95 return 0;
95} 96}
96 97
97/* This is a lot like the above function. Instead, we are trying to match 98/* 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 99 * 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). 100 * against (eg, to only match against skills or only skill objects for example).
100 * If type is -1, ew don't match on type. 101 * If type is -1, ew don't match on type.
101 */ 102 */
103object *
102object *get_archetype_by_skill_name(const char *skill, int type) { 104get_archetype_by_skill_name (const char *skill, int type)
103 archetype *at; 105{
106 shstr_cmp skill_cmp (skill);
104 107
105 if (skill == NULL) 108 for_all_archetypes (at)
106 return NULL; 109 if (at->skill == skill_cmp && (type == -1 || type == at->type))
110 return at->instance ();
107 111
108 for(at = first_archetype;at!=NULL;at=at->next) { 112 return 0;
109 if ( ((type == -1) || (type == at->clone.type)) &&
110 (!strcmp(at->clone.skill, skill)))
111 return arch_to_object(at);
112 }
113 return NULL;
114} 113}
115 114
116/* similiar to above - this returns the first archetype 115/* similiar to above - this returns the first archetype
117 * that matches both the type and subtype. type and subtype 116 * 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 117 * 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 118 * may not be very useful. This function is most useful when
120 * subtypes are known to be unique for a particular type 119 * subtypes are known to be unique for a particular type
121 * (eg, skills) 120 * (eg, skills)
122 */ 121 */
122archetype *
123archetype *get_archetype_by_type_subtype(int type, int subtype) { 123get_archetype_by_type_subtype (int type, int subtype)
124 archetype *at; 124{
125 125 for_all_archetypes (at)
126 for(at = first_archetype;at!=NULL;at=at->next) { 126 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; 127 return at;
130 } 128
131 return NULL; 129 return 0;
132} 130}
133 131
134/** 132/**
135 * GROS - this returns a new object given the name that appears during the game 133 * GROS - this returns a new object given the name that appears during the game
136 * (for example, "writing pen" instead of "stylus"). 134 * (for example, "writing pen" instead of "stylus").
138 * - name: The name we're searching for (ex: "writing pen"); 136 * - name: The name we're searching for (ex: "writing pen");
139 * Return value: 137 * Return value:
140 * - a corresponding object if found; a singularity object if not found. 138 * - a corresponding object if found; a singularity object if not found.
141 * Note by MSW - it appears that it takes the full name and keeps 139 * 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 140 * 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, 141 * doesn't allocate it each time - not that this function is used much,
144 * but it otherwise had a big memory leak. 142 * but it otherwise had a big memory leak.
145 */ 143 */
144object *
146object *get_archetype_by_object_name(const char *name) { 145get_archetype_by_object_name (const char *name)
147 archetype *at; 146{
148 char tmpname[MAX_BUF]; 147 char tmpname[MAX_BUF];
149 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 (int 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 at->instance ();
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 */
179int
180item_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
201 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED)))
202 return 2;
203
204 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
205 return 2;
206
207 /* Allow for things like '100 arrows' */
208 if ((count = atoi (cp)) != 0)
157 { 209 {
158 return arch_to_object(at); 210 cp = strchr (cp, ' ');
211 while (cp && cp[0] == ' ')
212 ++cp; /* get rid of spaces */
159 } 213 }
160 } 214 else
161 return create_singularity(name); 215 {
162} 216 if (pl->type == PLAYER)
163 217 count = pl->contr->count;
164 /* This is a subset of the parse_id command. Basically, name can be 218 else
165 * a string seperated lists of things to match, with certain keywords. 219 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 */
181int 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 } 220 }
221
222 if (!cp || cp[0] == '\0' || count < 0)
223 return 0;
224
225
226 /* The code here should go from highest retval to lowest. That
227 * is because of the 'else' handling - we don't want to match on
228 * something and set a low retval, even though it may match a higher retcal
229 * later. So keep it in descending order here, so we try for the best
230 * match first, and work downward.
231 */
232 const char *qbn0, *qbn1, *qsn; // query base name/short name caches
233
234 if (!strcasecmp (cp, query_name (op)))
235 retval = 20;
236 else if (!strcasecmp (cp, qsn = query_short_name (op)))
237 retval = 18;
238 else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
239 retval = 16;
240 else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
241 retval = 16;
242 else if (op->custom_name && !strcasecmp (cp, op->custom_name))
243 retval = 15;
244 else if (!strncasecmp (cp, qbn0, strlen (cp)))
245 retval = 14;
246 else if (!strncasecmp (cp, qbn1, strlen (cp)))
247 retval = 14;
248 /* Do substring checks, so things like 'Str+1' will match.
249 * retval of these should perhaps be lower - they are lower
250 * then the specific strcasecmp aboves, but still higher than
251 * some other match criteria.
252 */
253 else if (strstr (qbn1, cp))
254 retval = 12;
255 else if (strstr (qbn0, cp))
256 retval = 12;
257 else if (strstr (qsn, cp))
258 retval = 12;
259 /* Check against plural/non plural based on count. */
260 else if (count > 1 && !strcasecmp (cp, op->name_pl))
261 retval = 6;
262 else if (count == 1 && !strcasecmp (op->name, cp))
263 retval = 6;
264 /* base name matched - not bad */
265 else if (strcasecmp (cp, op->name) == 0 && !count)
266 retval = 4;
267 /* Check for partial custom name, but give a real low priority */
268 else if (op->custom_name.contains (cp))
269 retval = 3;
270
271 if (retval)
208 else { 272 {
209 if (pl->type==PLAYER) 273 if (pl->type == PLAYER)
210 count=pl->contr->count; 274 pl->contr->count = count;
211 else 275
212 count = 0; 276 return retval;
213 } 277 }
278 }
214 279
215 if (!cp || cp[0]=='\0' || count<0) return 0; 280 return 0;
281}
216 282
283//-GPL
217 284
218 /* The code here should go from highest retval to lowest. That 285archetype::archetype (const char *name)
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 arch = this;
221 * later. So keep it in descending order here, so we try for the best 288 this->archname = this->name = this->name_pl = name;
222 * match first, and work downward. 289}
290
291archetype::~archetype ()
292{
293 unlink ();
294}
295
296void
297archetype::link ()
298{
299 if (!archetypes.contains (this))
300 {
301 archetypes.insert (this);
302 ht.insert (std::make_pair (archname, this));
303 }
304}
305
306void
307archetype::unlink ()
308{
309 if (archetypes.contains (this))
310 {
311 archetypes.erase (this);
312 ht.erase (archname);
313 }
314}
315
316/*
317 * Finds, using the hashtable, which archetype matches the given name.
318 * returns a pointer to the found archetype, otherwise NULL.
319 */
320archetype *
321archetype::find (const char *name)
322{
323 if (!name)
324 return 0;
325
326 auto (i, ht.find (name));
327
328 if (i == ht.end ())
329 return 0;
330 else
331 return i->second;
332}
333
334archetype *
335archetype::read (object_thawer &f)
336{
337 assert (f.kw == KW_object);
338
339 std::vector<archetype *> parts;
340
341 coroapi::cede_to_tick ();
342
343 for (;;)
344 {
345 archetype *at = new archetype (f.get_str ());
346
347 f.next ();
348
349#if 0
350 // implementing it here in the server does neither allow multiple inheritence
351 // nor does it cleanly "just override". it would allow use in map files, though,
352 // and other resource files dynamically laoded (as opposed to being preprocessed).
353 // not that any of this is relevant as of yet...
354 if (f.kw == KW_inherit)
223 */ 355 {
224 if (!strcasecmp(cp,query_name(op))) retval=20; 356 if (archetype *at = find (f.get_str ()))
225 else if (!strcasecmp(cp,query_short_name(op))) retval=18; 357 *op = at->clone;
226 else if (!strcasecmp(cp,query_base_name(op,0))) retval=16; 358 else
227 else if (!strcasecmp(cp,query_base_name(op,1))) retval=16; 359 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; 360 &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 361
234 /* Do substring checks, so things like 'Str+1' will match. 362 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 } 363 }
247 else if (count==1 && !strcasecmp(op->name,cp)) { 364#endif
248 retval=6; 365
366 loading_arch = at; // hack to tell parse_kv et al. to behave
367 bool parse_ok = at->parse_kv (f);
368 loading_arch = 0;
369
370 if (!parse_ok)
371 goto fail;
372
373 loading_arch = at; // hack to tell parse_kv et al. to behave
374 at->post_load_check ();
375 loading_arch = 0;
376
377 parts.push_back (at);
378
379 if (f.kw != KW_more)
380 break;
381
382 f.next ();
383
384 if (f.kw != KW_object)
385 {
386 f.parse_error ("more object");
387 goto fail;
249 } 388 }
250 /* base name matched - not bad */ 389 }
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 390
255 if (retval) { 391 {
256 if (pl->type == PLAYER) 392 auto (at, parts.begin ());
257 pl->contr->count=count; 393
394 archetype *new_head = parts.front ();
395 archetype *old_head = find (new_head->archname);
396
397 if (old_head && !old_head->is_head ())
398 {
399 LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
400 &new_head->archname, &old_head->archname);
401 goto fail;
402 }
403
404 // check that all archetypes belong to the same old object or are new
405 for (auto (at, parts.begin ()); at != parts.end (); ++at)
406 {
407 archetype *new_part = *at;
408 archetype *old_part = find (new_part->archname);
409
410 if (old_part && old_part->head_ () != old_head)
411 {
412 LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
413 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
414 goto fail;
415 }
416 }
417
418 // assemble new chain
419 new_head->min_x = new_head->max_x = new_head->x;
420 new_head->min_y = new_head->max_y = new_head->y;
421
422 archetype *less = new_head;
423 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
424 {
425 archetype *at = *p;
426
427 // some flags get inherited from the head (probably a lot more)
428 // doing it here doesn't feel too cozy, but it allows code
429 // to ignore head checks for these flags, which saves time
430 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
431 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
432 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
433 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
434
435 new_head->min_x = min (new_head->min_x, at->x);
436 new_head->min_y = min (new_head->min_y, at->y);
437 new_head->max_x = max (new_head->max_x, at->x);
438 new_head->max_y = max (new_head->max_y, at->y);
439
440 at->head = new_head;
441 less->more = at;
442 less = at;
443 }
444
445 postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
446
447 return new_head;
448 }
449
450fail:
451 for (auto (p, parts.begin ()); p != parts.end (); ++p)
452 (*p)->destroy ();
453
454 return 0;
455}
456
457void
458archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
459{
460 ref = 0;
461 postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
462}
463
464void
465archetype::commit_load ()
466{
467 // unlink old archetypes and link in new ones */
468 for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
469 {
470 archetype *at = *p;
471
472 if (archetype *old = find (at->archname))
473 old->unlink ();
474
475 allarch.push_back (at);
476
477 at->link ();
478 ++dirtycnt;
479 }
480
481 postponed_arch.clear ();
482
483 // now resolve arch references
484 for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
485 {
486 arch_ptr *ap = p->first;
487 archetype *at = find (p->second);
488
489 if (!at)
490 LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
491
492 *ap = at;
493 }
494
495 postponed_arch_ref.clear ();
496
497 empty = find (shstr_empty_archetype);
498}
499
500void
501archetype::gc ()
502{
503 int cnt = max (1, min (allarch.size () / 128, dirtycnt));
504 dirtycnt = max (0, dirtycnt - cnt);
505
506 do
507 {
508 static int idx;
509
510 if (idx >= allarch.size ())
511 if (idx)
512 idx = 0;
513 else
258 return retval; 514 return;
515
516 archetype *at = allarch [idx];
517
518 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
519 ++idx;
520 else
521 {
522 LOG (llevDebug, "garbage collect arch %s", &at->archname);
523 assert (at->arch == at); // verify that refcnt == 1 is truly valid
524 allarch.erase (idx);
525
526 // break chain
527 for (object *op = at->head_ (); op; )
528 {
529 object *next = op->more;
530 op->head = 0;
531 op->more = 0;
532 op = next;
533 }
534
535 at->destroy ();
536 at->arch = 0;
259 } 537 }
260 } 538 }
261 return 0; 539 while (--cnt);
262} 540}
263 541
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
270void 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
285void 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
294void clear_archetable(void) {
295 memset((void *) arch_table,0,ARCHTABLE*sizeof(archetype *));
296}
297
298/*
299 * An alternative way to init the hashtable which is slower, but _works_...
300 */
301
302void 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
314void 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
324void 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
332void 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
351archetype *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 */
367void 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
441void 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
479void 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
494void
495load_archetypes (void)
496{
497 char filename[MAX_BUF];
498 int comp;
499#if TIME_ARCH_LOAD
500 struct timeval tv1, tv2;
501#endif
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}
532
533/*
534 * Creates and returns a new object which is a copy of the given archetype.
535 * This function returns NULL on failure.
536 */
537
538object *arch_to_object(archetype *at) {
539 object *op; 542object *
540 if(at==NULL) { 543archetype::instance ()
541 if(warn_archetypes) 544{
542 LOG(llevError,"Couldn't find archetype.\n"); 545 object *op = clone ();
543 return NULL;
544 }
545 op=get_object();
546 copy_object(&at->clone,op);
547 op->instantiate (); 546 op->instantiate ();
548 op->arch=at;
549 return op; 547 return op;
550} 548}
549
550//+GPL
551 551
552/* 552/*
553 * Creates an object. This function is called by get_archetype() 553 * Creates an object. This function is called by get_archetype()
554 * if it fails to find the appropriate archetype. 554 * if it fails to find the appropriate archetype.
555 * Thus get_archetype() will be guaranteed to always return 555 * Thus get_archetype() will be guaranteed to always return
556 * an object, and never NULL. 556 * an object, and never NULL.
557 */ 557 */
558 558object *
559object *create_singularity(const char *name) { 559create_singularity (const char *name)
560 object *op; 560{
561 char buf[MAX_BUF]; 561 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
562 sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name); 562
563 op = get_object(); 563 if (!strcmp (name, "bug"))
564 op->name = op->name_pl = buf; 564 abort ();
565 SET_FLAG(op,FLAG_NO_PICK); 565
566 object *op = archetype::get (shstr_bug);
567 op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
568
566 return op; 569 return op;
567} 570}
568 571
569/* 572/*
570 * Finds which archetype matches the given name, and returns a new 573 * Finds which archetype matches the given name, and returns a new
571 * object containing a copy of the archetype. 574 * object containing a copy of the archetype.
572 */ 575 */
573 576object *
574object *get_archetype(const char *name) { 577get_archetype (const char *name)
575 archetype *at; 578{
576 at = find_archetype(name); 579 return archetype::get (name);
577 if (at == NULL) 580}
581
582object *
583archetype::get (const char *name)
584{
585 archetype *at = find (name);
586
587 if (!at)
578 return create_singularity(name); 588 return create_singularity (name);
579 return arch_to_object(at);
580}
581 589
582/* 590 return at->instance ();
583 * Hash-function used by the arch-hashtable.
584 */
585
586unsigned long
587hasharch(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
617archetype *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
645static 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} 591}
658 592
659/* 593/*
660 * Returns the first archetype using the given type. 594 * Returns the first archetype using the given type.
661 * Used in treasure-generation. 595 * Used in treasure-generation.
662 */ 596 */
663
664archetype *type_to_archetype(int type) {
665 archetype *at; 597archetype *
666 598type_to_archetype (int type)
667 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) 599{
668 if(at->clone.type==type) 600 for_all_archetypes (at)
601 if (at->type == type && at->head_ () != at)
669 return at; 602 return at;
603
670 return NULL; 604 return 0;
671} 605}
672 606
673/* 607/*
674 * Returns a new object copied from the first archetype matching 608 * Returns a new object copied from the first archetype matching
675 * the given type. 609 * the given type.
676 * Used in treasure-generation. 610 * Used in treasure-generation.
677 */ 611 */
678 612object *
679object *clone_arch(int type) { 613clone_arch (int type)
680 archetype *at; 614{
681 object *op=get_object(); 615 archetype *at = type_to_archetype (type);
682 616
683 if((at=type_to_archetype(type))==NULL) { 617 if (!at)
618 {
684 LOG(llevError,"Can't clone archetype %d\n",type); 619 LOG (llevError, "Can't clone archetype %d\n", type);
685 free_object(op);
686 return NULL; 620 return 0;
687 } 621 }
688 copy_object(&at->clone,op); 622
689 op->instantiate (); 623 return at->instance ();
690 return op;
691} 624}
692 625
693/* 626/*
694 * member: make instance from class 627 * member: make instance from class
695 */ 628 */
696 629object *
697object *object_create_arch (archetype * at) 630object_create_arch (archetype *at)
698{ 631{
699 object *op, *prev = NULL, *head = NULL; 632 object *op, *prev = 0, *head = 0;
700 633
701 while (at) { 634 while (at)
702 op = arch_to_object (at); 635 {
636 op = at->instance ();
637
703 op->x = at->clone.x; 638 op->x = at->x;
704 op->y = at->clone.y; 639 op->y = at->y;
640
705 if (head) 641 if (head)
706 op->head = head, prev->more = op; 642 op->head = head, prev->more = op;
643
707 if (!head) 644 if (!head)
708 head = op; 645 head = op;
646
709 prev = op; 647 prev = op;
710 at = at->more; 648 at = (archetype *)at->more;
711 } 649 }
650
712 return (head); 651 return head;
713} 652}
714 653
715/*** end of arch.c ***/ 654//-GPL
655

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines