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.20 by root, Thu Sep 14 21:16:11 2006 UTC vs.
Revision 1.45 by root, Fri Apr 13 07:26:29 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
8 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
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 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,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 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
18 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 21 *
21 The authors can be reached via e-mail at crossfire-devel@real-time.com 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 23 */
23 24
24#include <cassert> 25#include <cassert>
25 26
26#include <tr1/unordered_map>
27
28#include <global.h> 27#include <global.h>
29#include <arch.h>
30#include <funcpoint.h> 28#include <funcpoint.h>
31#include <loader.h> 29#include <loader.h>
32 30
33/* IF set, does a little timing on the archetype load. */ 31#include <tr1/functional>
34#define TIME_ARCH_LOAD 0 32#include <tr1/unordered_map>
35 33
36static void add_arch (archetype *at);
37
38static archetype *arch_table[ARCHTABLE];
39int arch_cmp = 0; /* How many strcmp's */
40int arch_search = 0; /* How many searches */
41int arch_init; /* True if doing arch initialization */ 34int arch_init; /* True if doing arch initialization */
42 35
43/* The naming of these functions is really poor - they are all 36/* The naming of these functions is really poor - they are all
44 * pretty much named '.._arch_...', but they may more may not 37 * pretty much named '.._arch_...', but they may more may not
45 * return archetypes. Some make the arch_to_object call, and thus 38 * return archetypes. Some make the arch_to_object call, and thus
46 * return an object. Perhaps those should be called 'archob' functions 39 * return an object. Perhaps those should be called 'archob' functions
47 * to denote they return an object derived from the archetype. 40 * to denote they return an object derived from the archetype.
48 * MSW 2003-04-29 41 * MSW 2003-04-29
49 */ 42 */
50 43
51#if USE_UNORDERED_MAP
52// the hashtable 44// the hashtable
53typedef std::tr1::unordered_map 45typedef std::tr1::unordered_map
54 < 46 <
55 std::size_t, 47 const char *,
56 archetype *, 48 arch_ptr,
57 std::hash<size_t>, 49 str_hash,
58 std::equal_to<size_t>, 50 str_equal,
59 slice_allocator< std::pair<const std::size_t, archetype *> > 51 slice_allocator< std::pair<const char *const, arch_ptr> >
60 true,
61 > HT; 52 > HT;
62 53
63static HT ht; 54static HT ht (5000);
64#endif
65 55
66/** 56/**
67 * GROS - This function retrieves an archetype given the name that appears 57 * GROS - This function retrieves an archetype given the name that appears
68 * during the game (for example, "writing pen" instead of "stylus"). 58 * during the game (for example, "writing pen" instead of "stylus").
69 * 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.
… …
75 * - the archetype found or null if nothing was found. 65 * - the archetype found or null if nothing was found.
76 */ 66 */
77archetype * 67archetype *
78find_archetype_by_object_name (const char *name) 68find_archetype_by_object_name (const char *name)
79{ 69{
80 archetype *at; 70 shstr_cmp name_cmp (name);
81 71
82 if (name == NULL)
83 return (archetype *) NULL;
84
85 for (at = first_archetype; at != NULL; at = at->next) 72 for (archetype *at = first_archetype; at; at = at->next)
86 { 73 if (at->clone.name == name_cmp)
87 if (!strcmp (at->clone.name, name))
88 return at; 74 return at;
89 } 75
90 return NULL; 76 return 0;
91} 77}
92 78
93/** 79/**
94 * 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
95 * 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()
96 * except that it considers only items of the given type. 82 * except that it considers only items of the given type.
97 */ 83 */
98archetype * 84archetype *
99find_archetype_by_object_type_name (int type, const char *name) 85find_archetype_by_object_type_name (int type, const char *name)
100{ 86{
101 archetype *at; 87 shstr_cmp name_cmp (name);
102 88
103 if (name == NULL)
104 return NULL;
105
106 for (at = first_archetype; at != NULL; at = at->next) 89 for (archetype *at = first_archetype; at; at = at->next)
107 { 90 if (at->clone.name == name_cmp && at->clone.type == type)
108 if (at->clone.type == type && strcmp (at->clone.name, name) == 0)
109 return at; 91 return at;
110 }
111 92
112 return NULL; 93 return 0;
113} 94}
114 95
115/* 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
116 * 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
117 * 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).
118 * If type is -1, ew don't match on type. 99 * If type is -1, ew don't match on type.
119 */ 100 */
120object * 101object *
121get_archetype_by_skill_name (const char *skill, int type) 102get_archetype_by_skill_name (const char *skill, int type)
122{ 103{
123 archetype * 104 shstr_cmp skill_cmp (skill);
124 at;
125 105
126 if (skill == NULL)
127 return NULL;
128
129 for (at = first_archetype; at != NULL; at = at->next) 106 for (archetype *at = first_archetype; at; at = at->next)
130 { 107 if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type))
131 if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))
132 return arch_to_object (at); 108 return arch_to_object (at);
133 } 109
134 return NULL; 110 return 0;
135} 111}
136 112
137/* similiar to above - this returns the first archetype 113/* similiar to above - this returns the first archetype
138 * that matches both the type and subtype. type and subtype 114 * that matches both the type and subtype. type and subtype
139 * 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
… …
142 * (eg, skills) 118 * (eg, skills)
143 */ 119 */
144archetype * 120archetype *
145get_archetype_by_type_subtype (int type, int subtype) 121get_archetype_by_type_subtype (int type, int subtype)
146{ 122{
147 archetype *
148 at;
149
150 for (at = first_archetype; at != NULL; at = at->next) 123 for (archetype *at = first_archetype; at; at = at->next)
151 {
152 if (((type == -1) || (type == at->clone.type)) && (subtype == -1 || subtype == at->clone.subtype)) 124 if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype))
153 return at; 125 return at;
154 } 126
155 return NULL; 127 return 0;
156} 128}
157 129
158/** 130/**
159 * 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
160 * (for example, "writing pen" instead of "stylus"). 132 * (for example, "writing pen" instead of "stylus").
… …
168 * but it otherwise had a big memory leak. 140 * but it otherwise had a big memory leak.
169 */ 141 */
170object * 142object *
171get_archetype_by_object_name (const char *name) 143get_archetype_by_object_name (const char *name)
172{ 144{
173 archetype *at;
174 char tmpname[MAX_BUF]; 145 char tmpname[MAX_BUF];
175 int i; 146 int i;
176 147
177 assign (tmpname, name); 148 assign (tmpname, name);
178 149
179 for (i = strlen (tmpname); i > 0; i--) 150 for (i = strlen (tmpname); i > 0; i--)
180 { 151 {
181 tmpname[i] = 0; 152 tmpname[i] = 0;
153
182 at = find_archetype_by_object_name (tmpname); 154 if (archetype *at = find_archetype_by_object_name (tmpname))
183
184 if (at != NULL)
185 return arch_to_object (at); 155 return arch_to_object (at);
186 } 156 }
187 157
188 return create_singularity (name); 158 return create_singularity (name);
189} 159}
… …
206 * Last, make a check on the full name. 176 * Last, make a check on the full name.
207 */ 177 */
208int 178int
209item_matched_string (object *pl, object *op, const char *name) 179item_matched_string (object *pl, object *op, const char *name)
210{ 180{
211 char *
212 cp,
213 local_name[MAX_BUF]; 181 char *cp, local_name[MAX_BUF];
214 int 182 int count, retval = 0;
215 count,
216 retval = 0;
217 183
218 strcpy (local_name, name); /* strtok is destructive to name */ 184 assign (local_name, name); /* strtok is destructive to name */
219 185
220 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) 186 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
221 { 187 {
222 while (cp[0] == ' ') 188 while (cp[0] == ' ')
223 ++cp; /* get rid of spaces */ 189 ++cp; /* get rid of spaces */
… …
273 retval = 15; 239 retval = 15;
274 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 240 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
275 retval = 14; 241 retval = 14;
276 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 242 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
277 retval = 14; 243 retval = 14;
278
279 /* Do substring checks, so things like 'Str+1' will match. 244 /* Do substring checks, so things like 'Str+1' will match.
280 * retval of these should perhaps be lower - they are lower 245 * retval of these should perhaps be lower - they are lower
281 * then the specific strcasecmp aboves, but still higher than 246 * then the specific strcasecmp aboves, but still higher than
282 * some other match criteria. 247 * some other match criteria.
283 */ 248 */
… …
285 retval = 12; 250 retval = 12;
286 else if (strstr (query_base_name (op, 0), cp)) 251 else if (strstr (query_base_name (op, 0), cp))
287 retval = 12; 252 retval = 12;
288 else if (strstr (query_short_name (op), cp)) 253 else if (strstr (query_short_name (op), cp))
289 retval = 12; 254 retval = 12;
290
291 /* Check against plural/non plural based on count. */ 255 /* Check against plural/non plural based on count. */
292 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 256 else if (count > 1 && !strcasecmp (cp, op->name_pl))
293 {
294 retval = 6; 257 retval = 6;
295 }
296 else if (count == 1 && !strcasecmp (op->name, cp)) 258 else if (count == 1 && !strcasecmp (op->name, cp))
297 {
298 retval = 6; 259 retval = 6;
299 }
300 /* base name matched - not bad */ 260 /* base name matched - not bad */
301 else if (strcasecmp (cp, op->name) == 0 && !count) 261 else if (strcasecmp (cp, op->name) == 0 && !count)
302 retval = 4; 262 retval = 4;
303 /* Check for partial custom name, but give a real low priority */ 263 /* Check for partial custom name, but give a real low priority */
304 else if (op->custom_name && strstr (op->custom_name, cp)) 264 else if (op->custom_name && strstr (op->custom_name, cp))
… …
306 266
307 if (retval) 267 if (retval)
308 { 268 {
309 if (pl->type == PLAYER) 269 if (pl->type == PLAYER)
310 pl->contr->count = count; 270 pl->contr->count = count;
271
311 return retval; 272 return retval;
312 } 273 }
313 } 274 }
275
314 return 0; 276 return 0;
315} 277}
316 278
317/* 279/*
318 * Initialises the internal linked list of archetypes (read from file). 280 * Initialises the internal linked list of archetypes (read from file).
… …
333 295
334/* init_blocksview();*/ 296/* init_blocksview();*/
335} 297}
336 298
337/* 299/*
338 * Stores debug-information about how efficient the hashtable
339 * used for archetypes has been in the static errmsg array.
340 */
341
342void
343arch_info (object *op)
344{
345 sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);
346 new_draw_info (NDI_BLACK, 0, op, errmsg);
347}
348
349/*
350 * Initialise the hashtable used by the archetypes.
351 */
352
353void
354clear_archetable (void)
355{
356 memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *));
357}
358
359/*
360 * An alternative way to init the hashtable which is slower, but _works_... 300 * An alternative way to init the hashtable which is slower, but _works_...
361 */ 301 */
362
363void 302void
364init_archetable (void) 303init_archetable (void)
365{ 304{
366 archetype *
367 at;
368
369 LOG (llevDebug, " Setting up archetable...\n"); 305 LOG (llevDebug, " Setting up archetable...\n");
370 306
371 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 307 for (archetype *at = first_archetype; at; at = at->next)
372 add_arch (at); 308 for (archetype *bt = at; bt; bt = bt->more)
309 bt->hash_add ();
373 310
374 LOG (llevDebug, "done\n"); 311 LOG (llevDebug, "done\n");
375}
376
377/*
378 * Dumps an archetype to debug-level output.
379 */
380
381void
382dump_arch (archetype *at)
383{
384 dump_object (&at->clone);
385}
386
387/*
388 * Dumps _all_ archetypes to debug-level output.
389 * If you run crossfire with debug, and enter DM-mode, you can trigger
390 * this with the O key.
391 */
392
393void
394dump_all_archetypes (void)
395{
396 archetype *
397 at;
398
399 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
400 {
401 dump_arch (at);
402 fprintf (logfile, "%s\n", errmsg);
403 }
404} 312}
405 313
406void 314void
407free_all_archs (void) 315free_all_archs (void)
408{ 316{
409 archetype * 317 archetype *at, *next;
410 at, *
411 next;
412 int
413 i = 0, f = 0; 318 int i = 0, f = 0;
414 319
415 for (at = first_archetype; at != NULL; at = next) 320 for (at = first_archetype; at; at = next)
416 { 321 {
417 if (at->more) 322 if (at->more)
418 next = at->more; 323 next = at->more;
419 else 324 else
420 next = at->next; 325 next = at->next;
… …
422 delete 327 delete
423 at; 328 at;
424 329
425 i++; 330 i++;
426 } 331 }
332
427 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); 333 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
428} 334}
429 335
430archetype::archetype () 336archetype::archetype ()
431{ 337{
432 clear_object (&clone); /* to initial state other also */ 338 clone.arch = this;
339
433 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */ 340 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
434 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ 341 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
435} 342}
436 343
437archetype::~archetype () 344archetype::~archetype ()
438{ 345{
346 //TODO: nuke ->more's
347}
348
349archetype *
350archetype::read (object_thawer &f)
351{
352 assert (f.kw == KW_object);
353
354 archetype *head = new archetype;
355 f.get (head->name);
356
357 if (!head->clone.parse_kv (f))
358 {
359 delete head;
360 return 0;
361 }
362
363 for (archetype *prev = head; f.kw == KW_more; )
364 {
365 f.next ();
366
367 assert (f.kw == KW_object);
368
369 archetype *more = new archetype;
370 f.get (more->name);
371
372 if (!more->clone.parse_kv (f))
373 {
374 delete head;
375 return 0;
376 }
377
378 if (more->clone.x > head->tail_x) head->tail_x = more->clone.x;
379 if (more->clone.y > head->tail_y) head->tail_y = more->clone.y;
380
381 more->head = head;
382 more->clone.head = &head->clone;
383 prev->more = more;
384 prev->clone.more = &more->clone;
385
386 prev = more;
387 }
388
389 head->next = first_archetype;
390 first_archetype = head;
391
392 return head;
439} 393}
440 394
441/* 395/*
442 * Reads/parses the archetype-file, and copies into a linked list 396 * Reads/parses the archetype-file, and copies into a linked list
443 * of archetype-structures. 397 * of archetype-structures.
444 */ 398 */
445void 399static bool
446first_arch_pass (object_thawer & fp) 400first_arch_pass (object_thawer &f)
447{ 401{
448 archetype * 402 for (;;)
449 at, *
450 head = NULL, *last_more = NULL;
451
452 at->clone.arch = first_archetype = at = new archetype;
453
454 while (int i = load_object (fp, &at->clone, 0))
455 { 403 {
456 at->clone.speed_left = (float) (-0.1);
457 /* copy the body_info to the body_used - this is only really
458 * need for monsters, but doesn't hurt to do it for everything.
459 * by doing so, when a monster is created, it has good starting
460 * values for the body_used info, so when items are created
461 * for it, they can be properly equipped.
462 */
463 memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
464
465 switch (i) 404 switch (f.kw)
466 {
467 case LL_NORMAL: /* A new archetype, just link it with the previous */
468 if (last_more != NULL)
469 last_more->next = at;
470 if (head != NULL)
471 head->next = at;
472 head = last_more = at;
473#if 0
474 if (!op->type)
475 LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
476#endif
477 at->tail_x = 0;
478 at->tail_y = 0;
479 break;
480
481 case LL_MORE: /* Another part of the previous archetype, link it correctly */
482
483 at->head = head;
484 at->clone.head = &head->clone;
485 if (last_more != NULL)
486 {
487 last_more->more = at;
488 last_more->clone.more = &at->clone;
489 }
490 last_more = at;
491
492 /* If this multipart image is still composed of individual small
493 * images, don't set the tail_.. values. We can't use them anyways,
494 * and setting these to zero makes the map sending to the client much
495 * easier as just looking at the head, we know what to do.
496 */
497 if (at->clone.face != head->clone.face)
498 {
499 head->tail_x = 0;
500 head->tail_y = 0;
501 }
502 else
503 {
504 if (at->clone.x > head->tail_x)
505 head->tail_x = at->clone.x;
506 if (at->clone.y > head->tail_y)
507 head->tail_y = at->clone.y;
508 }
509 break;
510
511 } 405 {
406 case KW_object:
407 if (!archetype::read (f))
408 return false;
409 continue;
512 410
513 at = new archetype; 411 case KW_EOF:
412 return true;
514 413
515 at->clone.arch = at; 414 default:
516 } 415 if (!f.parse_error ("archetypes file"))
416 return false;
417 }
517 418
518 delete at; 419 f.next ();
420 }
519} 421}
520 422
521/* 423/*
522 * Reads the archetype file once more, and links all pointers between 424 * Reads the archetype file once more, and links all pointers between
523 * archetypes. 425 * archetypes.
524 */ 426 */
525
526void 427void
527second_arch_pass (object_thawer & thawer) 428second_arch_pass (object_thawer & thawer)
528{ 429{
529 char
530 buf[MAX_BUF], *
531 variable = buf, *argument, *cp; 430 char buf[MAX_BUF], *variable = buf, *argument, *cp;
532 archetype *
533 at = NULL, *other; 431 archetype *at = NULL, *other;
534 432
535 while (fgets (buf, MAX_BUF, thawer) != NULL) 433 while (fgets (buf, MAX_BUF, thawer) != NULL)
536 { 434 {
537 if (*buf == '#') 435 if (*buf == '#')
538 continue; 436 continue;
437
539 if ((argument = strchr (buf, ' ')) != NULL) 438 if ((argument = strchr (buf, ' ')) != NULL)
540 { 439 {
541 *argument = '\0', argument++; 440 *argument = '\0', argument++;
542 cp = argument + strlen (argument) - 1; 441 cp = argument + strlen (argument) - 1;
543 while (isspace (*cp)) 442 while (isspace (*cp))
544 { 443 {
545 *cp = '\0'; 444 *cp = '\0';
546 cp--; 445 cp--;
547 } 446 }
548 } 447 }
448
549 if (!strcmp ("Object", variable)) 449 if (!strcmp ("object", variable))
550 { 450 {
551 if ((at = archetype::find (argument)) == NULL) 451 if ((at = archetype::find (argument)) == NULL)
552 LOG (llevError, "Warning: failed to find arch %s\n", argument); 452 LOG (llevError, "Warning: failed to find arch %s\n", argument);
553 } 453 }
554 else if (!strcmp ("other_arch", variable)) 454 else if (!strcmp ("other_arch", variable))
… …
561 at->clone.other_arch = other; 461 at->clone.other_arch = other;
562 } 462 }
563 } 463 }
564 else if (!strcmp ("randomitems", variable)) 464 else if (!strcmp ("randomitems", variable))
565 { 465 {
566 if (at != NULL) 466 if (at)
567 { 467 {
568 treasurelist *
569 tl = find_treasurelist (argument); 468 treasurelist *tl = find_treasurelist (argument);
570 469
571 if (tl == NULL) 470 if (tl == NULL)
572 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); 471 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
573 else 472 else
574 at->clone.randomitems = tl; 473 at->clone.randomitems = tl;
575 } 474 }
576 } 475 }
577 } 476 }
578} 477}
579 478
580#ifdef DEBUG
581void
582check_generators (void)
583{
584 archetype *
585 at;
586
587 for (at = first_archetype; at != NULL; at = at->next)
588 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
589 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
590}
591#endif
592
593/* 479/*
594 * First initialises the archtype hash-table (init_archetable()). 480 * First initialises the archtype hash-table (init_archetable()).
595 * Reads and parses the archetype file (with the first and second-pass 481 * Reads and parses the archetype file (with the first and second-pass
596 * functions). 482 * functions).
597 * Then initialises treasures by calling load_treasures(). 483 * Then initialises treasures by calling load_treasures().
598 */ 484 */
599
600void 485void
601load_archetypes (void) 486load_archetypes (void)
602{ 487{
603 char
604 filename[MAX_BUF]; 488 char filename[MAX_BUF];
605
606#if TIME_ARCH_LOAD
607 struct timeval
608 tv1,
609 tv2;
610#endif
611 489
612 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); 490 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
613 LOG (llevDebug, "Reading archetypes from %s:\n", filename); 491 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
614 492
615 { 493 {
616 object_thawer
617 thawer (filename); 494 object_thawer f (filename);
618 495
619 clear_archetable (); 496 f.next ();
497
620 LOG (llevDebug, " arch-pass 1...\n"); 498 LOG (llevDebug, " arch-pass 1...\n");
621 first_arch_pass (thawer); 499 if (!first_arch_pass (f))
500 cleanup ("errors during first arch pass are fatal");
622 LOG (llevDebug, " done\n"); 501 LOG (llevDebug, " done\n");
623 } 502 }
624 503
625 init_archetable (); 504 init_archetable ();
626 warn_archetypes = 1; 505 warn_archetypes = 1;
627 506
628 { 507 {
629 object_thawer
630 thawer (filename); 508 object_thawer f (filename);
631 509
632 LOG (llevDebug, " loading treasure...\n"); 510 LOG (llevDebug, " loading treasure...\n");
633 load_treasures (); 511 load_treasures ();
634 LOG (llevDebug, " done\n arch-pass 2...\n");
635 second_arch_pass (thawer);
636 LOG (llevDebug, " done\n"); 512 LOG (llevDebug, " done\n");
637#ifdef DEBUG 513 LOG (llevDebug, " arch-pass 2...\n");
638 check_generators (); 514 second_arch_pass (f);
639#endif 515 LOG (llevDebug, " done\n");
640 } 516 }
641 LOG (llevDebug, " done\n"); 517 LOG (llevDebug, " done\n");
642} 518}
643 519
644/* 520/*
645 * Creates and returns a new object which is a copy of the given archetype. 521 * Creates and returns a new object which is a copy of the given archetype.
646 * This function returns NULL on failure. 522 * This function returns NULL on failure.
647 */ 523 */
648
649object * 524object *
650arch_to_object (archetype *at) 525arch_to_object (archetype *at)
651{ 526{
652 object * 527 if (!at)
653 op;
654
655 if (at == NULL)
656 { 528 {
657 if (warn_archetypes) 529 if (warn_archetypes)
658 LOG (llevError, "Couldn't find archetype.\n"); 530 LOG (llevError, "Couldn't find archetype.\n");
659 531
660 return NULL; 532 return NULL;
661 } 533 }
662 534
663 op = get_object (); 535 object *op = at->clone.clone ();
664 copy_object (&at->clone, op);
665 op->arch = at; 536 op->arch = at;
666 op->instantiate (); 537 op->instantiate ();
667 return op; 538 return op;
668} 539}
669 540
… …
671 * Creates an object. This function is called by get_archetype() 542 * Creates an object. This function is called by get_archetype()
672 * if it fails to find the appropriate archetype. 543 * if it fails to find the appropriate archetype.
673 * Thus get_archetype() will be guaranteed to always return 544 * Thus get_archetype() will be guaranteed to always return
674 * an object, and never NULL. 545 * an object, and never NULL.
675 */ 546 */
676
677object * 547object *
678create_singularity (const char *name) 548create_singularity (const char *name)
679{ 549{
680 object * op; 550 object *op;
681 char buf[MAX_BUF]; 551 char buf[MAX_BUF];
682 552
683 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 553 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
684 op = get_object (); 554 op = object::create ();
685 op->name = op->name_pl = buf; 555 op->name = op->name_pl = buf;
686 SET_FLAG (op, FLAG_NO_PICK); 556 SET_FLAG (op, FLAG_NO_PICK);
687 return op; 557 return op;
688} 558}
689 559
690/* 560/*
691 * Finds which archetype matches the given name, and returns a new 561 * Finds which archetype matches the given name, and returns a new
692 * object containing a copy of the archetype. 562 * object containing a copy of the archetype.
693 */ 563 */
694
695object * 564object *
696get_archetype (const char *name) 565get_archetype (const char *name)
697{ 566{
698 archetype *at = archetype::find (name); 567 archetype *at = archetype::find (name);
699 568
… …
735 604
736/* 605/*
737 * Finds, using the hashtable, which archetype matches the given name. 606 * Finds, using the hashtable, which archetype matches the given name.
738 * returns a pointer to the found archetype, otherwise NULL. 607 * returns a pointer to the found archetype, otherwise NULL.
739 */ 608 */
740
741archetype * 609archetype *
742archetype::find (const char *name) 610archetype::find (const char *name)
743{ 611{
744 if (!name) 612 if (!name)
745 return 0; 613 return 0;
746 614
747#if USE_UNORDERED_MAP
748 AUTODECL (i, ht.find ((size_t) name)); 615 AUTODECL (i, ht.find (name));
749 616
750 if (i == ht.end ()) 617 if (i == ht.end ())
751 return 0; 618 return 0;
752 else 619 else
753 return i->second; 620 return i->second;
754#endif
755
756 archetype *at;
757 unsigned long index;
758
759 index = hasharch (name, ARCHTABLE);
760 arch_search++;
761 for (;;)
762 {
763 at = arch_table[index];
764
765 if (at == NULL)
766 {
767 if (warn_archetypes)
768 LOG (llevError, "Couldn't find archetype %s\n", name);
769
770 return NULL;
771 }
772
773 arch_cmp++;
774
775 if (!strcmp ((const char *) at->name, name))
776 return at;
777
778 if (++index >= ARCHTABLE)
779 index = 0;
780 }
781} 621}
782 622
783/* 623/*
784 * Adds an archetype to the hashtable. 624 * Adds an archetype to the hashtable.
785 */ 625 */
786 626void
787static void 627archetype::hash_add ()
788add_arch (archetype *at)
789{ 628{
790#if USE_UNORDERED_MAP 629 ht.insert (std::make_pair (name, this));
791 ht.insert (std::make_pair ((size_t) (const char *) at->name, at)); 630}
792#endif
793 631
794 int index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index; 632void
795 633archetype::hash_del ()
796 for (;;) 634{
797 { 635 ht.erase (name);
798 if (arch_table[index] == NULL)
799 {
800 arch_table[index] = at;
801 return;
802 }
803
804 if (++index == ARCHTABLE)
805 index = 0;
806
807 if (index == org_index)
808 fatal (ARCHTABLE_TOO_SMALL);
809 }
810} 636}
811 637
812/* 638/*
813 * Returns the first archetype using the given type. 639 * Returns the first archetype using the given type.
814 * Used in treasure-generation. 640 * Used in treasure-generation.
815 */ 641 */
816
817archetype * 642archetype *
818type_to_archetype (int type) 643type_to_archetype (int type)
819{ 644{
820 archetype *at; 645 archetype *at;
821 646
… …
834 659
835object * 660object *
836clone_arch (int type) 661clone_arch (int type)
837{ 662{
838 archetype *at; 663 archetype *at;
839 object *op = get_object ();
840 664
841 if ((at = type_to_archetype (type)) == NULL) 665 if ((at = type_to_archetype (type)) == NULL)
842 { 666 {
843 LOG (llevError, "Can't clone archetype %d\n", type); 667 LOG (llevError, "Can't clone archetype %d\n", type);
844 free_object (op);
845 return NULL; 668 return 0;
846 } 669 }
847 670
848 copy_object (&at->clone, op); 671 object *op = at->clone.clone ();
849 op->instantiate (); 672 op->instantiate ();
850 return op; 673 return op;
851} 674}
852 675
853/* 676/*

Diff Legend

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