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.13 by pippijn, Thu Sep 7 09:37:11 2006 UTC vs.
Revision 1.73 by root, Sun Apr 20 00:44:12 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.13 2006/09/07 09:37:11 pippijn 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 */
28 23
29#include <cassert> 24#include <cassert>
30 25
31#include <tr1/unordered_map>
32
33#include <global.h> 26#include <global.h>
34#include <arch.h>
35#include <funcpoint.h> 27#include <funcpoint.h>
36#include <loader.h> 28#include <loader.h>
37 29
38/* IF set, does a little timing on the archetype load. */ 30#include <tr1/functional>
39#define TIME_ARCH_LOAD 0 31#include <tr1/unordered_map>
40 32
41static void add_arch (archetype * at); 33archetype *loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
34archetype *archetype::empty;
42 35
43static archetype *arch_table[ARCHTABLE];
44int arch_cmp = 0; /* How many strcmp's */
45int arch_search = 0; /* How many searches */
46int arch_init; /* True if doing arch initialization */
47
48/* The naming of these functions is really poor - they are all
49 * pretty much named '.._arch_...', but they may more may not
50 * return archetypes. Some make the arch_to_object call, and thus
51 * return an object. Perhaps those should be called 'archob' functions
52 * to denote they return an object derived from the archetype.
53 * MSW 2003-04-29
54 */
55
56#if USE_UNORDERED_MAP
57// the hashtable 36// the hashtable
58typedef std::tr1::unordered_map<size_t, archetype *> HT; 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;
59 45
60static HT ht; 46static HT ht (5000);
61#endif 47archvec archetypes;
48
49// the vector of other_arch references to be resolved
50static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
51// the vector of loaded but not yet committed archetypes
52static std::vector<archetype *> postponed_arch;
62 53
63/** 54/**
64 * GROS - This function retrieves an archetype given the name that appears 55 * GROS - This function retrieves an archetype given the name that appears
65 * during the game (for example, "writing pen" instead of "stylus"). 56 * during the game (for example, "writing pen" instead of "stylus").
66 * It does not use the hashtable system, but browse the whole archlist each time. 57 * It does not use the hashtable system, but browse the whole archlist each time.
… …
72 * - the archetype found or null if nothing was found. 63 * - the archetype found or null if nothing was found.
73 */ 64 */
74archetype * 65archetype *
75find_archetype_by_object_name (const char *name) 66find_archetype_by_object_name (const char *name)
76{ 67{
77 archetype *at; 68 shstr_cmp name_cmp (name);
78 69
79 if (name == NULL) 70 for_all_archetypes (at)
80 return (archetype *) NULL; 71 if (at->name == name_cmp)
81
82 for (at = first_archetype; at != NULL; at = at->next)
83 {
84 if (!strcmp (at->clone.name, name))
85 return at; 72 return at;
86 } 73
87 return NULL; 74 return 0;
88} 75}
89 76
90/** 77/**
91 * This function retrieves an archetype by type and name that appears during 78 * This function retrieves an archetype by type and name that appears during
92 * the game. It is basically the same as find_archetype_by_object_name() 79 * the game. It is basically the same as find_archetype_by_object_name()
93 * except that it considers only items of the given type. 80 * except that it considers only items of the given type.
94 */ 81 */
95archetype * 82archetype *
96find_archetype_by_object_type_name (int type, const char *name) 83find_archetype_by_object_type_name (int type, const char *name)
97{ 84{
98 archetype *at; 85 shstr_cmp name_cmp (name);
99 86
100 if (name == NULL) 87 for_all_archetypes (at)
101 return NULL; 88 if (at->name == name_cmp && at->type == type)
102
103 for (at = first_archetype; at != NULL; at = at->next)
104 {
105 if (at->clone.type == type && strcmp (at->clone.name, name) == 0)
106 return at; 89 return at;
107 }
108 90
109 return NULL; 91 return 0;
110} 92}
111 93
112/* This is a lot like the above function. Instead, we are trying to match 94/* This is a lot like the above function. Instead, we are trying to match
113 * the arch->skill values. type is the type of object to match 95 * the arch->skill values. type is the type of object to match
114 * against (eg, to only match against skills or only skill objects for example). 96 * against (eg, to only match against skills or only skill objects for example).
115 * If type is -1, ew don't match on type. 97 * If type is -1, ew don't match on type.
116 */ 98 */
117object * 99object *
118get_archetype_by_skill_name (const char *skill, int type) 100get_archetype_by_skill_name (const char *skill, int type)
119{ 101{
120 archetype * 102 shstr_cmp skill_cmp (skill);
121 at;
122 103
123 if (skill == NULL) 104 for_all_archetypes (at)
124 return NULL; 105 if (at->skill == skill_cmp && (type == -1 || type == at->type))
125
126 for (at = first_archetype; at != NULL; at = at->next)
127 {
128 if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))
129 return arch_to_object (at); 106 return arch_to_object (at);
130 } 107
131 return NULL; 108 return 0;
132} 109}
133 110
134/* similiar to above - this returns the first archetype 111/* similiar to above - this returns the first archetype
135 * that matches both the type and subtype. type and subtype 112 * that matches both the type and subtype. type and subtype
136 * can be -1 to say ignore, but in this case, the match it does 113 * can be -1 to say ignore, but in this case, the match it does
… …
139 * (eg, skills) 116 * (eg, skills)
140 */ 117 */
141archetype * 118archetype *
142get_archetype_by_type_subtype (int type, int subtype) 119get_archetype_by_type_subtype (int type, int subtype)
143{ 120{
144 archetype * 121 for_all_archetypes (at)
145 at;
146
147 for (at = first_archetype; at != NULL; at = at->next)
148 {
149 if (((type == -1) || (type == at->clone.type)) && (subtype == -1 || subtype == at->clone.subtype)) 122 if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype))
150 return at; 123 return at;
151 } 124
152 return NULL; 125 return 0;
153} 126}
154 127
155/** 128/**
156 * GROS - this returns a new object given the name that appears during the game 129 * GROS - this returns a new object given the name that appears during the game
157 * (for example, "writing pen" instead of "stylus"). 130 * (for example, "writing pen" instead of "stylus").
… …
165 * but it otherwise had a big memory leak. 138 * but it otherwise had a big memory leak.
166 */ 139 */
167object * 140object *
168get_archetype_by_object_name (const char *name) 141get_archetype_by_object_name (const char *name)
169{ 142{
170 archetype *
171 at;
172 char
173 tmpname[MAX_BUF]; 143 char tmpname[MAX_BUF];
174 int 144 int i;
175 i;
176 145
177 strncpy (tmpname, name, MAX_BUF - 1); 146 assign (tmpname, name);
178 tmpname[MAX_BUF - 1] = 0; 147
179 for (i = strlen (tmpname); i > 0; i--) 148 for (i = strlen (tmpname); i > 0; i--)
180 { 149 {
181 tmpname[i] = 0; 150 tmpname[i] = 0;
151
182 at = find_archetype_by_object_name (tmpname); 152 if (archetype *at = find_archetype_by_object_name (tmpname))
183 if (at != NULL)
184 {
185 return arch_to_object (at); 153 return arch_to_object (at);
186 }
187 } 154 }
155
188 return create_singularity (name); 156 return create_singularity (name);
189} 157}
190 158
191 /* This is a subset of the parse_id command. Basically, name can be 159/* This is a subset of the parse_id command. Basically, name can be
192 * a string seperated lists of things to match, with certain keywords. 160 * a string seperated lists of things to match, with certain keywords.
193 * pl is the player (only needed to set count properly) 161 * pl is the player (only needed to set count properly)
194 * op is the item we are trying to match. Calling function takes care 162 * op is the item we are trying to match. Calling function takes care
195 * of what action might need to be done and if it is valid 163 * of what action might need to be done and if it is valid
196 * (pickup, drop, etc.) Return NONZERO if we have a match. A higher 164 * (pickup, drop, etc.) Return NONZERO if we have a match. A higher
197 * value means a better match. 0 means no match. 165 * value means a better match. 0 means no match.
198 * 166 *
199 * Brief outline of the procedure: 167 * Brief outline of the procedure:
200 * We take apart the name variable into the individual components. 168 * We take apart the name variable into the individual components.
201 * cases for 'all' and unpaid are pretty obvious. 169 * cases for 'all' and unpaid are pretty obvious.
202 * Next, we check for a count (either specified in name, or in the 170 * Next, we check for a count (either specified in name, or in the
203 * player object.) 171 * player object.)
204 * If count is 1, make a quick check on the name. 172 * If count is 1, make a quick check on the name.
205 * IF count is >1, we need to make plural name. Return if match. 173 * IF count is >1, we need to make plural name. Return if match.
206 * Last, make a check on the full name. 174 * Last, make a check on the full name.
207 */ 175 */
208int 176int
209item_matched_string (object * pl, object * op, const char *name) 177item_matched_string (object *pl, object *op, const char *name)
210{ 178{
211 char *
212 cp,
213 local_name[MAX_BUF]; 179 char *cp, local_name[MAX_BUF];
214 int 180 int count, retval = 0;
215 count, 181
216 retval = 0;
217 strcpy (local_name, name); /* strtok is destructive to name */ 182 assign (local_name, name); /* strtok is destructive to name */
218 183
219 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) 184 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
220 { 185 {
221 while (cp[0] == ' ') 186 while (cp[0] == ' ')
222 ++cp; /* get rid of spaces */ 187 ++cp; /* get rid of spaces */
… …
272 retval = 15; 237 retval = 15;
273 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 238 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
274 retval = 14; 239 retval = 14;
275 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 240 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
276 retval = 14; 241 retval = 14;
277
278 /* Do substring checks, so things like 'Str+1' will match. 242 /* Do substring checks, so things like 'Str+1' will match.
279 * retval of these should perhaps be lower - they are lower 243 * retval of these should perhaps be lower - they are lower
280 * then the specific strcasecmp aboves, but still higher than 244 * then the specific strcasecmp aboves, but still higher than
281 * some other match criteria. 245 * some other match criteria.
282 */ 246 */
… …
284 retval = 12; 248 retval = 12;
285 else if (strstr (query_base_name (op, 0), cp)) 249 else if (strstr (query_base_name (op, 0), cp))
286 retval = 12; 250 retval = 12;
287 else if (strstr (query_short_name (op), cp)) 251 else if (strstr (query_short_name (op), cp))
288 retval = 12; 252 retval = 12;
289
290 /* Check against plural/non plural based on count. */ 253 /* Check against plural/non plural based on count. */
291 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 254 else if (count > 1 && !strcasecmp (cp, op->name_pl))
292 {
293 retval = 6; 255 retval = 6;
294 }
295 else if (count == 1 && !strcasecmp (op->name, cp)) 256 else if (count == 1 && !strcasecmp (op->name, cp))
296 {
297 retval = 6; 257 retval = 6;
298 }
299 /* base name matched - not bad */ 258 /* base name matched - not bad */
300 else if (strcasecmp (cp, op->name) == 0 && !count) 259 else if (strcasecmp (cp, op->name) == 0 && !count)
301 retval = 4; 260 retval = 4;
302 /* Check for partial custom name, but give a real low priority */ 261 /* Check for partial custom name, but give a real low priority */
303 else if (op->custom_name && strstr (op->custom_name, cp)) 262 else if (op->custom_name && strstr (op->custom_name, cp))
… …
305 264
306 if (retval) 265 if (retval)
307 { 266 {
308 if (pl->type == PLAYER) 267 if (pl->type == PLAYER)
309 pl->contr->count = count; 268 pl->contr->count = count;
269
310 return retval; 270 return retval;
311 } 271 }
312 } 272 }
273
313 return 0; 274 return 0;
314} 275}
315 276
316/* 277archetype::archetype (const char *name)
317 * Initialises the internal linked list of archetypes (read from file). 278{
318 * Then the global "empty_archetype" pointer is initialised. 279 arch = this;
319 * Then the blocksview[] array is initialised. 280 this->archname = this->name = this->name_pl = name;
320 */ 281}
282
283archetype::~archetype ()
284{
285 unlink ();
286}
321 287
322void 288void
323init_archetypes (void) 289archetype::link ()
324{ /* called from add_player() and edit() */ 290{
325 if (first_archetype != NULL) /* Only do this once */ 291 ht.insert (std::make_pair (archname, this));
326 return;
327 arch_init = 1;
328 load_archetypes ();
329 arch_init = 0;
330 empty_archetype = find_archetype ("empty_archetype");
331/* init_blocksview();*/
332}
333 292
334/* 293 if (!archetypes.contains (this))
335 * Stores debug-information about how efficient the hashtable 294 archetypes.insert (this);
336 * used for archetypes has been in the static errmsg array. 295}
337 */
338 296
339void 297void
340arch_info (object * op) 298archetype::unlink ()
341{ 299{
342 sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp); 300 ht.erase (archname);
343 new_draw_info (NDI_BLACK, 0, op, errmsg);
344}
345 301
302 if (archetypes.contains (this))
303 archetypes.erase (this);
304}
305
346/* 306/*
347 * Initialise the hashtable used by the archetypes. 307 * Finds, using the hashtable, which archetype matches the given name.
308 * returns a pointer to the found archetype, otherwise NULL.
348 */ 309 */
310archetype *
311archetype::find (const char *name)
312{
313 if (!name)
314 return 0;
315
316 auto (i, ht.find (name));
317
318 if (i == ht.end ())
319 return 0;
320 else
321 return i->second;
322}
323
324archetype *
325archetype::read (object_thawer &f)
326{
327 assert (f.kw == KW_object);
328
329 std::vector<archetype *> parts;
330
331 coroapi::cede_to_tick ();
332
333 for (;;)
334 {
335 archetype *at = new archetype (f.get_str ());
336
337 f.next ();
338
339#if 0
340 // implementing it here in the server does neither allow multiple inheritence
341 // nor does it cleanly "just override". it would allow use in map files, though,
342 // and other resource files dynamically laoded (as opposed to being preprocessed).
343 // not that any of this is relevant as of yet...
344 if (f.kw == KW_inherit)
345 {
346 if (archetype *at = find (f.get_str ()))
347 *op = at->clone;
348 else
349 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
350 &at->archname, f.get_str ());
351
352 f.next ();
353 }
354#endif
355
356 loading_arch = at; // hack to tell parse_kv et al. to behave
357 bool parse_ok = at->parse_kv (f);
358 loading_arch = 0;
359
360 if (!parse_ok)
361 goto fail;
362
363 loading_arch = at; // hack to tell parse_kv et al. to behave
364 at->post_load_check ();
365 loading_arch = 0;
366
367 parts.push_back (at);
368
369 if (f.kw != KW_more)
370 break;
371
372 f.next ();
373
374 if (f.kw != KW_object)
375 {
376 f.parse_error ("more object");
377 goto fail;
378 }
379 }
380
381 {
382 auto (at, parts.begin ());
383
384 archetype *new_head = parts.front ();
385 archetype *old_head = find (new_head->archname);
386
387 if (old_head && !old_head->is_head ())
388 {
389 LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
390 &new_head->archname, &old_head->archname);
391 goto fail;
392 }
393
394 // check that all archetypes belong to the same old object or are new
395 for (auto (at, parts.begin ()); at != parts.end (); ++at)
396 {
397 archetype *new_part = *at;
398 archetype *old_part = find (new_part->archname);
399
400 if (old_part && old_part->head_ () != old_head)
401 {
402 LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
403 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
404 goto fail;
405 }
406 }
407
408 // assemble new chain
409 new_head->min_x = new_head->max_x = new_head->x;
410 new_head->min_y = new_head->max_y = new_head->y;
411
412 archetype *less = new_head;
413 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
414 {
415 archetype *at = *p;
416
417 // some flags get inherited formt he head (probably a lot more)
418 // doing it here doesn't feel too cozy, but it allows code
419 // to ignore head checks for these flags, which saves time
420 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
421 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
422 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
423 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
424
425 if (at->x < new_head->min_x) new_head->min_x = at->x;
426 if (at->y < new_head->min_y) new_head->min_y = at->y;
427 if (at->x > new_head->max_x) new_head->max_x = at->x;
428 if (at->y > new_head->max_y) new_head->max_y = at->y;
429
430 at->head = new_head;
431 less->more = at;
432 less = at;
433 }
434
435 postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
436
437 return new_head;
438 }
439
440fail:
441 for (auto (p, parts.begin ()); p != parts.end (); ++p)
442 (*p)->destroy (true);
443
444 return 0;
445}
349 446
350void 447void
351clear_archetable (void) 448archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
352{ 449{
353 memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *)); 450 ref = 0;
451 postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
354} 452}
355
356/*
357 * An alternative way to init the hashtable which is slower, but _works_...
358 */
359 453
360void 454void
361init_archetable (void) 455archetype::commit_load ()
362{ 456{
363 archetype *at; 457 // unlink old archetypes and link in new ones */
364 458 for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
365 LOG (llevDebug, " Setting up archetable...\n");
366
367 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
368 add_arch (at);
369
370 LOG (llevDebug, "done\n");
371}
372
373/*
374 * Dumps an archetype to debug-level output.
375 */
376
377void
378dump_arch (archetype * at)
379{
380 dump_object (&at->clone);
381}
382
383/*
384 * Dumps _all_ archetypes to debug-level output.
385 * If you run crossfire with debug, and enter DM-mode, you can trigger
386 * this with the O key.
387 */
388
389void
390dump_all_archetypes (void)
391{
392 archetype *
393 at;
394 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
395 {
396 dump_arch (at);
397 fprintf (logfile, "%s\n", errmsg);
398 } 459 {
399} 460 archetype *at = *p;
400 461
401void 462 if (archetype *old = find (at->archname))
402free_all_archs (void) 463 old->unlink ();
403{
404 archetype *
405 at, *
406 next;
407 int
408 i = 0, f = 0;
409 464
410 for (at = first_archetype; at != NULL; at = next) 465 at->link ();
411 { 466 }
412 if (at->more)
413 next = at->more;
414 else
415 next = at->next;
416 467
417 delete 468 postponed_arch.clear ();
418 at; 469
419 i++; 470 // now resolve arch references
471 for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
420 } 472 {
421 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); 473 arch_ptr *ap = p->first;
422} 474 archetype *at = find (p->second);
423 475
424/* 476 if (!at)
425 * Allocates, initialises and returns the pointer to an archetype structure. 477 LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
426 */
427// TODO: should become constructor
428archetype *
429get_archetype_struct (void)
430{
431 archetype *
432 arch;
433 478
434 arch = new archetype; 479 *ap = at;
435
436 clear_object (&arch->clone); /* to initial state other also */
437 CLEAR_FLAG (&arch->clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */
438 SET_FLAG (&arch->clone, FLAG_REMOVED); /* doesn't copy these flags... */
439
440 return arch;
441}
442
443/*
444 * Reads/parses the archetype-file, and copies into a linked list
445 * of archetype-structures.
446 */
447void
448first_arch_pass (object_thawer & fp)
449{
450 object *
451 op;
452 archetype *
453 at, *
454 head = NULL, *last_more = NULL;
455 int
456 i;
457
458 op = get_object ();
459 op->arch = first_archetype = at = get_archetype_struct ();
460
461 while ((i = load_object (fp, op, 0)))
462 { 480 }
463 copy_object (op, &at->clone);
464 at->clone.speed_left = (float) (-0.1);
465 /* copy the body_info to the body_used - this is only really
466 * need for monsters, but doesn't hurt to do it for everything.
467 * by doing so, when a monster is created, it has good starting
468 * values for the body_used info, so when items are created
469 * for it, they can be properly equipped.
470 */
471 memcpy (&at->clone.body_used, &op->body_info, sizeof (op->body_info));
472 481
473 switch (i) 482 postponed_arch_ref.clear ();
474 {
475 case LL_NORMAL: /* A new archetype, just link it with the previous */
476 if (last_more != NULL)
477 last_more->next = at;
478 if (head != NULL)
479 head->next = at;
480 head = last_more = at;
481#if 0
482 if (!op->type)
483 LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
484#endif
485 at->tail_x = 0;
486 at->tail_y = 0;
487 break;
488 483
489 case LL_MORE: /* Another part of the previous archetype, link it correctly */ 484 empty = find (shstr_empty_archetype);
490
491 at->head = head;
492 at->clone.head = &head->clone;
493 if (last_more != NULL)
494 {
495 last_more->more = at;
496 last_more->clone.more = &at->clone;
497 }
498 last_more = at;
499
500 /* If this multipart image is still composed of individual small
501 * images, don't set the tail_.. values. We can't use them anyways,
502 * and setting these to zero makes the map sending to the client much
503 * easier as just looking at the head, we know what to do.
504 */
505 if (at->clone.face != head->clone.face)
506 {
507 head->tail_x = 0;
508 head->tail_y = 0;
509 }
510 else
511 {
512 if (at->clone.x > head->tail_x)
513 head->tail_x = at->clone.x;
514 if (at->clone.y > head->tail_y)
515 head->tail_y = at->clone.y;
516 }
517 break;
518
519 }
520
521 at = get_archetype_struct ();
522 clear_object (op);
523 op->arch = at;
524 }
525
526 delete
527 at;
528 free_object (op);
529}
530
531/*
532 * Reads the archetype file once more, and links all pointers between
533 * archetypes.
534 */
535
536void
537second_arch_pass (object_thawer & thawer)
538{
539 char
540 buf[MAX_BUF], *
541 variable = buf, *argument, *cp;
542 archetype *
543 at = NULL, *other;
544
545 while (fgets (buf, MAX_BUF, thawer) != NULL)
546 {
547 if (*buf == '#')
548 continue;
549 if ((argument = strchr (buf, ' ')) != NULL)
550 {
551 *argument = '\0', argument++;
552 cp = argument + strlen (argument) - 1;
553 while (isspace (*cp))
554 {
555 *cp = '\0';
556 cp--;
557 }
558 }
559 if (!strcmp ("Object", variable))
560 {
561 if ((at = find_archetype (argument)) == NULL)
562 LOG (llevError, "Warning: failed to find arch %s\n", argument);
563 }
564 else if (!strcmp ("other_arch", variable))
565 {
566 if (at != NULL && at->clone.other_arch == NULL)
567 {
568 if ((other = find_archetype (argument)) == NULL)
569 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
570 else if (at != NULL)
571 at->clone.other_arch = other;
572 }
573 }
574 else if (!strcmp ("randomitems", variable))
575 {
576 if (at != NULL)
577 {
578 treasurelist *
579 tl = find_treasurelist (argument);
580 if (tl == NULL)
581 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
582 else
583 at->clone.randomitems = tl;
584 }
585 }
586 }
587}
588
589#ifdef DEBUG
590void
591check_generators (void)
592{
593 archetype *
594 at;
595 for (at = first_archetype; at != NULL; at = at->next)
596 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
597 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
598}
599#endif
600
601/*
602 * First initialises the archtype hash-table (init_archetable()).
603 * Reads and parses the archetype file (with the first and second-pass
604 * functions).
605 * Then initialises treasures by calling load_treasures().
606 */
607
608void
609load_archetypes (void)
610{
611 char
612 filename[MAX_BUF];
613#if TIME_ARCH_LOAD
614 struct timeval
615 tv1,
616 tv2;
617#endif
618
619 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
620 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
621
622 {
623 object_thawer
624 thawer (filename);
625
626 clear_archetable ();
627 LOG (llevDebug, " arch-pass 1...\n");
628 first_arch_pass (thawer);
629 LOG (llevDebug, " done\n");
630 }
631
632 init_archetable ();
633 warn_archetypes = 1;
634
635 {
636 object_thawer
637 thawer (filename);
638
639 LOG (llevDebug, " loading treasure...\n");
640 load_treasures ();
641 LOG (llevDebug, " done\n arch-pass 2...\n");
642 second_arch_pass (thawer);
643 LOG (llevDebug, " done\n");
644#ifdef DEBUG
645 check_generators ();
646#endif
647 }
648 LOG (llevDebug, " done\n");
649} 485}
650 486
651/* 487/*
652 * Creates and returns a new object which is a copy of the given archetype. 488 * Creates and returns a new object which is a copy of the given archetype.
653 * This function returns NULL on failure. 489 * This function returns NULL on failure.
654 */ 490 */
655
656object * 491object *
657arch_to_object (archetype * at) 492arch_to_object (archetype *at)
658{ 493{
659 object * 494 if (!at)
660 op;
661 if (at == NULL)
662 { 495 {
663 if (warn_archetypes)
664 LOG (llevError, "Couldn't find archetype.\n"); 496 LOG (llevError, "Couldn't find archetype.\n");
665 return NULL; 497 return 0;
666 } 498 }
667 op = get_object (); 499
668 copy_object (&at->clone, op); 500 object *op = at->clone ();
501 op->arch = at;
669 op->instantiate (); 502 op->instantiate ();
670 op->arch = at; 503
671 return op; 504 return op;
505}
506
507object *
508archetype::instance ()
509{
510 return arch_to_object (this);
672} 511}
673 512
674/* 513/*
675 * Creates an object. This function is called by get_archetype() 514 * Creates an object. This function is called by get_archetype()
676 * if it fails to find the appropriate archetype. 515 * if it fails to find the appropriate archetype.
677 * Thus get_archetype() will be guaranteed to always return 516 * Thus get_archetype() will be guaranteed to always return
678 * an object, and never NULL. 517 * an object, and never NULL.
679 */ 518 */
680
681object * 519object *
682create_singularity (const char *name) 520create_singularity (const char *name)
683{ 521{
684 object * 522 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
685 op; 523
686 char 524 if (!strcmp (name, "bug"))
525 abort ();
526
687 buf[MAX_BUF]; 527 char buf[MAX_BUF];
688 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 528 sprintf (buf, "bug, please report (%s)", name);
689 op = get_object (); 529
530 object *op = get_archetype ("bug");
690 op->name = op->name_pl = buf; 531 op->name = op->name_pl = buf;
691 SET_FLAG (op, FLAG_NO_PICK); 532
692 return op; 533 return op;
693} 534}
694 535
695/* 536/*
696 * Finds which archetype matches the given name, and returns a new 537 * Finds which archetype matches the given name, and returns a new
697 * object containing a copy of the archetype. 538 * object containing a copy of the archetype.
698 */ 539 */
699
700object * 540object *
701get_archetype (const char *name) 541get_archetype (const char *name)
702{ 542{
703 archetype * 543 archetype *at = archetype::find (name);
704 at; 544
705 at = find_archetype (name); 545 if (!at)
706 if (at == NULL)
707 return create_singularity (name); 546 return create_singularity (name);
547
708 return arch_to_object (at); 548 return arch_to_object (at);
709}
710
711/*
712 * Hash-function used by the arch-hashtable.
713 */
714
715unsigned long
716hasharch (const char *str, int tablesize)
717{
718 unsigned long
719 hash = 0;
720 unsigned int
721 i = 0;
722 const char *
723 p;
724
725 /* use the one-at-a-time hash function, which supposedly is
726 * better than the djb2-like one used by perl5.005, but
727 * certainly is better then the bug used here before.
728 * see http://burtleburtle.net/bob/hash/doobs.html
729 */
730 for (p = str; i < MAXSTRING && *p; p++, i++)
731 {
732 hash += *p;
733 hash += hash << 10;
734 hash ^= hash >> 6;
735 }
736
737 hash += hash << 3;
738 hash ^= hash >> 11;
739 hash += hash << 15;
740
741 return hash % tablesize;
742}
743
744/*
745 * Finds, using the hashtable, which archetype matches the given name.
746 * returns a pointer to the found archetype, otherwise NULL.
747 */
748
749archetype *
750find_archetype (const char *name)
751{
752#if USE_UNORDERED_MAP
753 name = shstr::find (name);
754
755 if (!name)
756 return 0;
757
758 HT::const_iterator i = ht.find ((size_t)name);
759
760 if (i == ht.end ())
761 return 0;
762 else
763 return i->second;
764#endif
765
766 archetype *at;
767 unsigned long index;
768
769 if (name == NULL)
770 return (archetype *) NULL;
771
772 index = hasharch (name, ARCHTABLE);
773 arch_search++;
774 for (;;)
775 {
776 at = arch_table[index];
777 if (at == NULL)
778 {
779 if (warn_archetypes)
780 LOG (llevError, "Couldn't find archetype %s\n", name);
781 return NULL;
782 }
783 arch_cmp++;
784 if (!strcmp ((const char *) at->name, name))
785 return at;
786 if (++index >= ARCHTABLE)
787 index = 0;
788 }
789}
790
791/*
792 * Adds an archetype to the hashtable.
793 */
794
795static void
796add_arch (archetype *at)
797{
798#if USE_UNORDERED_MAP
799 ht.insert (std::make_pair ((size_t)(const char *)at->name, at));
800#endif
801
802 int index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index;
803
804 for (;;)
805 {
806 if (arch_table[index] == NULL)
807 {
808 arch_table[index] = at;
809 return;
810 }
811
812 if (++index == ARCHTABLE)
813 index = 0;
814
815 if (index == org_index)
816 fatal (ARCHTABLE_TOO_SMALL);
817 }
818} 549}
819 550
820/* 551/*
821 * Returns the first archetype using the given type. 552 * Returns the first archetype using the given type.
822 * Used in treasure-generation. 553 * Used in treasure-generation.
823 */ 554 */
824
825archetype * 555archetype *
826type_to_archetype (int type) 556type_to_archetype (int type)
827{ 557{
828 archetype * 558 for_all_archetypes (at)
829 at; 559 if (at->type == type && at->head_ () != at)
830
831 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
832 if (at->clone.type == type)
833 return at; 560 return at;
561
834 return NULL; 562 return 0;
835} 563}
836 564
837/* 565/*
838 * Returns a new object copied from the first archetype matching 566 * Returns a new object copied from the first archetype matching
839 * the given type. 567 * the given type.
840 * Used in treasure-generation. 568 * Used in treasure-generation.
841 */ 569 */
842
843object * 570object *
844clone_arch (int type) 571clone_arch (int type)
845{ 572{
846 archetype * 573 archetype *at;
847 at;
848 object *
849 op = get_object ();
850 574
851 if ((at = type_to_archetype (type)) == NULL) 575 if ((at = type_to_archetype (type)) == NULL)
852 { 576 {
853 LOG (llevError, "Can't clone archetype %d\n", type); 577 LOG (llevError, "Can't clone archetype %d\n", type);
854 free_object (op);
855 return NULL; 578 return 0;
856 } 579 }
857 copy_object (&at->clone, op); 580
581 object *op = at->clone ();
858 op->instantiate (); 582 op->instantiate ();
859 return op; 583 return op;
860} 584}
861 585
862/* 586/*
863 * member: make instance from class 587 * member: make instance from class
864 */ 588 */
865
866object * 589object *
867object_create_arch (archetype * at) 590object_create_arch (archetype *at)
868{ 591{
869 object * 592 object *op, *prev = 0, *head = 0;
870 op, *
871 prev = NULL, *head = NULL;
872 593
873 while (at) 594 while (at)
874 { 595 {
875 op = arch_to_object (at); 596 op = arch_to_object (at);
597
876 op->x = at->clone.x; 598 op->x = at->x;
877 op->y = at->clone.y; 599 op->y = at->y;
600
878 if (head) 601 if (head)
879 op->head = head, prev->more = op; 602 op->head = head, prev->more = op;
603
880 if (!head) 604 if (!head)
881 head = op; 605 head = op;
606
882 prev = op; 607 prev = op;
883 at = at->more; 608 at = (archetype *)at->more;
884 } 609 }
610
885 return (head); 611 return head;
886} 612}
887 613
888/*** end of arch.c ***/

Diff Legend

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