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.19 by root, Thu Sep 14 18:13:01 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 * 70 shstr_cmp name_cmp (name);
81 at;
82 71
83 if (name == NULL)
84 return (archetype *) NULL;
85
86 for (at = first_archetype; at != NULL; at = at->next) 72 for (archetype *at = first_archetype; at; at = at->next)
87 { 73 if (at->clone.name == name_cmp)
88 if (!strcmp (at->clone.name, name))
89 return at; 74 return at;
90 } 75
91 return NULL; 76 return 0;
92} 77}
93 78
94/** 79/**
95 * 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
96 * 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()
97 * except that it considers only items of the given type. 82 * except that it considers only items of the given type.
98 */ 83 */
99archetype * 84archetype *
100find_archetype_by_object_type_name (int type, const char *name) 85find_archetype_by_object_type_name (int type, const char *name)
101{ 86{
102 archetype * 87 shstr_cmp name_cmp (name);
103 at;
104 88
105 if (name == NULL)
106 return NULL;
107
108 for (at = first_archetype; at != NULL; at = at->next) 89 for (archetype *at = first_archetype; at; at = at->next)
109 { 90 if (at->clone.name == name_cmp && at->clone.type == type)
110 if (at->clone.type == type && strcmp (at->clone.name, name) == 0)
111 return at; 91 return at;
112 }
113 92
114 return NULL; 93 return 0;
115} 94}
116 95
117/* 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
118 * 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
119 * 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).
120 * If type is -1, ew don't match on type. 99 * If type is -1, ew don't match on type.
121 */ 100 */
122object * 101object *
123get_archetype_by_skill_name (const char *skill, int type) 102get_archetype_by_skill_name (const char *skill, int type)
124{ 103{
125 archetype * 104 shstr_cmp skill_cmp (skill);
126 at;
127 105
128 if (skill == NULL)
129 return NULL;
130
131 for (at = first_archetype; at != NULL; at = at->next) 106 for (archetype *at = first_archetype; at; at = at->next)
132 { 107 if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type))
133 if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))
134 return arch_to_object (at); 108 return arch_to_object (at);
135 } 109
136 return NULL; 110 return 0;
137} 111}
138 112
139/* similiar to above - this returns the first archetype 113/* similiar to above - this returns the first archetype
140 * that matches both the type and subtype. type and subtype 114 * that matches both the type and subtype. type and subtype
141 * 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
… …
144 * (eg, skills) 118 * (eg, skills)
145 */ 119 */
146archetype * 120archetype *
147get_archetype_by_type_subtype (int type, int subtype) 121get_archetype_by_type_subtype (int type, int subtype)
148{ 122{
149 archetype *
150 at;
151
152 for (at = first_archetype; at != NULL; at = at->next) 123 for (archetype *at = first_archetype; at; at = at->next)
153 {
154 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))
155 return at; 125 return at;
156 } 126
157 return NULL; 127 return 0;
158} 128}
159 129
160/** 130/**
161 * 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
162 * (for example, "writing pen" instead of "stylus"). 132 * (for example, "writing pen" instead of "stylus").
… …
170 * but it otherwise had a big memory leak. 140 * but it otherwise had a big memory leak.
171 */ 141 */
172object * 142object *
173get_archetype_by_object_name (const char *name) 143get_archetype_by_object_name (const char *name)
174{ 144{
175 archetype *at;
176 char tmpname[MAX_BUF]; 145 char tmpname[MAX_BUF];
177 int i; 146 int i;
178 147
179 assign (tmpname, name); 148 assign (tmpname, name);
180 149
181 for (i = strlen (tmpname); i > 0; i--) 150 for (i = strlen (tmpname); i > 0; i--)
182 { 151 {
183 tmpname[i] = 0; 152 tmpname[i] = 0;
153
184 at = find_archetype_by_object_name (tmpname); 154 if (archetype *at = find_archetype_by_object_name (tmpname))
185
186 if (at != NULL)
187 {
188 return arch_to_object (at); 155 return arch_to_object (at);
189 }
190 } 156 }
191 157
192 return create_singularity (name); 158 return create_singularity (name);
193} 159}
194 160
… …
210 * Last, make a check on the full name. 176 * Last, make a check on the full name.
211 */ 177 */
212int 178int
213item_matched_string (object *pl, object *op, const char *name) 179item_matched_string (object *pl, object *op, const char *name)
214{ 180{
215 char *
216 cp,
217 local_name[MAX_BUF]; 181 char *cp, local_name[MAX_BUF];
218 int 182 int count, retval = 0;
219 count,
220 retval = 0;
221 183
222 strcpy (local_name, name); /* strtok is destructive to name */ 184 assign (local_name, name); /* strtok is destructive to name */
223 185
224 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) 186 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
225 { 187 {
226 while (cp[0] == ' ') 188 while (cp[0] == ' ')
227 ++cp; /* get rid of spaces */ 189 ++cp; /* get rid of spaces */
… …
277 retval = 15; 239 retval = 15;
278 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 240 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
279 retval = 14; 241 retval = 14;
280 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 242 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
281 retval = 14; 243 retval = 14;
282
283 /* Do substring checks, so things like 'Str+1' will match. 244 /* Do substring checks, so things like 'Str+1' will match.
284 * retval of these should perhaps be lower - they are lower 245 * retval of these should perhaps be lower - they are lower
285 * then the specific strcasecmp aboves, but still higher than 246 * then the specific strcasecmp aboves, but still higher than
286 * some other match criteria. 247 * some other match criteria.
287 */ 248 */
… …
289 retval = 12; 250 retval = 12;
290 else if (strstr (query_base_name (op, 0), cp)) 251 else if (strstr (query_base_name (op, 0), cp))
291 retval = 12; 252 retval = 12;
292 else if (strstr (query_short_name (op), cp)) 253 else if (strstr (query_short_name (op), cp))
293 retval = 12; 254 retval = 12;
294
295 /* Check against plural/non plural based on count. */ 255 /* Check against plural/non plural based on count. */
296 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 256 else if (count > 1 && !strcasecmp (cp, op->name_pl))
297 {
298 retval = 6; 257 retval = 6;
299 }
300 else if (count == 1 && !strcasecmp (op->name, cp)) 258 else if (count == 1 && !strcasecmp (op->name, cp))
301 {
302 retval = 6; 259 retval = 6;
303 }
304 /* base name matched - not bad */ 260 /* base name matched - not bad */
305 else if (strcasecmp (cp, op->name) == 0 && !count) 261 else if (strcasecmp (cp, op->name) == 0 && !count)
306 retval = 4; 262 retval = 4;
307 /* Check for partial custom name, but give a real low priority */ 263 /* Check for partial custom name, but give a real low priority */
308 else if (op->custom_name && strstr (op->custom_name, cp)) 264 else if (op->custom_name && strstr (op->custom_name, cp))
… …
310 266
311 if (retval) 267 if (retval)
312 { 268 {
313 if (pl->type == PLAYER) 269 if (pl->type == PLAYER)
314 pl->contr->count = count; 270 pl->contr->count = count;
271
315 return retval; 272 return retval;
316 } 273 }
317 } 274 }
275
318 return 0; 276 return 0;
319} 277}
320 278
321/* 279/*
322 * Initialises the internal linked list of archetypes (read from file). 280 * Initialises the internal linked list of archetypes (read from file).
… …
327void 285void
328init_archetypes (void) 286init_archetypes (void)
329{ /* called from add_player() and edit() */ 287{ /* called from add_player() and edit() */
330 if (first_archetype != NULL) /* Only do this once */ 288 if (first_archetype != NULL) /* Only do this once */
331 return; 289 return;
290
332 arch_init = 1; 291 arch_init = 1;
333 load_archetypes (); 292 load_archetypes ();
334 arch_init = 0; 293 arch_init = 0;
335 empty_archetype = find_archetype ("empty_archetype"); 294 empty_archetype = archetype::find ("empty_archetype");
336 295
337/* init_blocksview();*/ 296/* init_blocksview();*/
338} 297}
339 298
340/* 299/*
341 * Stores debug-information about how efficient the hashtable
342 * used for archetypes has been in the static errmsg array.
343 */
344
345void
346arch_info (object *op)
347{
348 sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);
349 new_draw_info (NDI_BLACK, 0, op, errmsg);
350}
351
352/*
353 * Initialise the hashtable used by the archetypes.
354 */
355
356void
357clear_archetable (void)
358{
359 memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *));
360}
361
362/*
363 * 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_...
364 */ 301 */
365
366void 302void
367init_archetable (void) 303init_archetable (void)
368{ 304{
369 archetype *
370 at;
371
372 LOG (llevDebug, " Setting up archetable...\n"); 305 LOG (llevDebug, " Setting up archetable...\n");
373 306
374 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 307 for (archetype *at = first_archetype; at; at = at->next)
375 add_arch (at); 308 for (archetype *bt = at; bt; bt = bt->more)
309 bt->hash_add ();
376 310
377 LOG (llevDebug, "done\n"); 311 LOG (llevDebug, "done\n");
378}
379
380/*
381 * Dumps an archetype to debug-level output.
382 */
383
384void
385dump_arch (archetype *at)
386{
387 dump_object (&at->clone);
388}
389
390/*
391 * Dumps _all_ archetypes to debug-level output.
392 * If you run crossfire with debug, and enter DM-mode, you can trigger
393 * this with the O key.
394 */
395
396void
397dump_all_archetypes (void)
398{
399 archetype *
400 at;
401
402 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
403 {
404 dump_arch (at);
405 fprintf (logfile, "%s\n", errmsg);
406 }
407} 312}
408 313
409void 314void
410free_all_archs (void) 315free_all_archs (void)
411{ 316{
412 archetype * 317 archetype *at, *next;
413 at, *
414 next;
415 int
416 i = 0, f = 0; 318 int i = 0, f = 0;
417 319
418 for (at = first_archetype; at != NULL; at = next) 320 for (at = first_archetype; at; at = next)
419 { 321 {
420 if (at->more) 322 if (at->more)
421 next = at->more; 323 next = at->more;
422 else 324 else
423 next = at->next; 325 next = at->next;
… …
425 delete 327 delete
426 at; 328 at;
427 329
428 i++; 330 i++;
429 } 331 }
332
430 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); 333 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
431} 334}
432 335
433archetype::archetype () 336archetype::archetype ()
434{ 337{
435 clear_object (&clone); /* to initial state other also */ 338 clone.arch = this;
339
436 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 */
437 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ 341 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
438} 342}
439 343
440archetype::~archetype () 344archetype::~archetype ()
441{ 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;
442} 393}
443 394
444/* 395/*
445 * Reads/parses the archetype-file, and copies into a linked list 396 * Reads/parses the archetype-file, and copies into a linked list
446 * of archetype-structures. 397 * of archetype-structures.
447 */ 398 */
448void 399static bool
449first_arch_pass (object_thawer & fp) 400first_arch_pass (object_thawer &f)
450{ 401{
451 archetype * 402 for (;;)
452 at, *
453 head = NULL, *last_more = NULL;
454
455 at->clone.arch = first_archetype = at = new archetype;
456
457 while (int i = load_object (fp, &at->clone, 0))
458 { 403 {
459 at->clone.speed_left = (float) (-0.1);
460 /* copy the body_info to the body_used - this is only really
461 * need for monsters, but doesn't hurt to do it for everything.
462 * by doing so, when a monster is created, it has good starting
463 * values for the body_used info, so when items are created
464 * for it, they can be properly equipped.
465 */
466 memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
467
468 switch (i) 404 switch (f.kw)
469 {
470 case LL_NORMAL: /* A new archetype, just link it with the previous */
471 if (last_more != NULL)
472 last_more->next = at;
473 if (head != NULL)
474 head->next = at;
475 head = last_more = at;
476#if 0
477 if (!op->type)
478 LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
479#endif
480 at->tail_x = 0;
481 at->tail_y = 0;
482 break;
483
484 case LL_MORE: /* Another part of the previous archetype, link it correctly */
485
486 at->head = head;
487 at->clone.head = &head->clone;
488 if (last_more != NULL)
489 {
490 last_more->more = at;
491 last_more->clone.more = &at->clone;
492 }
493 last_more = at;
494
495 /* If this multipart image is still composed of individual small
496 * images, don't set the tail_.. values. We can't use them anyways,
497 * and setting these to zero makes the map sending to the client much
498 * easier as just looking at the head, we know what to do.
499 */
500 if (at->clone.face != head->clone.face)
501 {
502 head->tail_x = 0;
503 head->tail_y = 0;
504 }
505 else
506 {
507 if (at->clone.x > head->tail_x)
508 head->tail_x = at->clone.x;
509 if (at->clone.y > head->tail_y)
510 head->tail_y = at->clone.y;
511 }
512 break;
513
514 } 405 {
406 case KW_object:
407 if (!archetype::read (f))
408 return false;
409 continue;
515 410
516 at = new archetype; 411 case KW_EOF:
412 return true;
517 413
518 at->clone.arch = at; 414 default:
519 } 415 if (!f.parse_error ("archetypes file"))
416 return false;
417 }
520 418
521 delete at; 419 f.next ();
420 }
522} 421}
523 422
524/* 423/*
525 * Reads the archetype file once more, and links all pointers between 424 * Reads the archetype file once more, and links all pointers between
526 * archetypes. 425 * archetypes.
527 */ 426 */
528
529void 427void
530second_arch_pass (object_thawer & thawer) 428second_arch_pass (object_thawer & thawer)
531{ 429{
532 char
533 buf[MAX_BUF], *
534 variable = buf, *argument, *cp; 430 char buf[MAX_BUF], *variable = buf, *argument, *cp;
535 archetype *
536 at = NULL, *other; 431 archetype *at = NULL, *other;
537 432
538 while (fgets (buf, MAX_BUF, thawer) != NULL) 433 while (fgets (buf, MAX_BUF, thawer) != NULL)
539 { 434 {
540 if (*buf == '#') 435 if (*buf == '#')
541 continue; 436 continue;
437
542 if ((argument = strchr (buf, ' ')) != NULL) 438 if ((argument = strchr (buf, ' ')) != NULL)
543 { 439 {
544 *argument = '\0', argument++; 440 *argument = '\0', argument++;
545 cp = argument + strlen (argument) - 1; 441 cp = argument + strlen (argument) - 1;
546 while (isspace (*cp)) 442 while (isspace (*cp))
547 { 443 {
548 *cp = '\0'; 444 *cp = '\0';
549 cp--; 445 cp--;
550 } 446 }
551 } 447 }
448
552 if (!strcmp ("Object", variable)) 449 if (!strcmp ("object", variable))
553 { 450 {
554 if ((at = find_archetype (argument)) == NULL) 451 if ((at = archetype::find (argument)) == NULL)
555 LOG (llevError, "Warning: failed to find arch %s\n", argument); 452 LOG (llevError, "Warning: failed to find arch %s\n", argument);
556 } 453 }
557 else if (!strcmp ("other_arch", variable)) 454 else if (!strcmp ("other_arch", variable))
558 { 455 {
559 if (at != NULL && at->clone.other_arch == NULL) 456 if (at != NULL && at->clone.other_arch == NULL)
560 { 457 {
561 if ((other = find_archetype (argument)) == NULL) 458 if ((other = archetype::find (argument)) == NULL)
562 LOG (llevError, "Warning: failed to find other_arch %s\n", argument); 459 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
563 else if (at != NULL) 460 else if (at != NULL)
564 at->clone.other_arch = other; 461 at->clone.other_arch = other;
565 } 462 }
566 } 463 }
567 else if (!strcmp ("randomitems", variable)) 464 else if (!strcmp ("randomitems", variable))
568 { 465 {
569 if (at != NULL) 466 if (at)
570 { 467 {
571 treasurelist *
572 tl = find_treasurelist (argument); 468 treasurelist *tl = find_treasurelist (argument);
573 469
574 if (tl == NULL) 470 if (tl == NULL)
575 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);
576 else 472 else
577 at->clone.randomitems = tl; 473 at->clone.randomitems = tl;
578 } 474 }
579 } 475 }
580 } 476 }
581} 477}
582 478
583#ifdef DEBUG
584void
585check_generators (void)
586{
587 archetype *
588 at;
589
590 for (at = first_archetype; at != NULL; at = at->next)
591 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
592 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
593}
594#endif
595
596/* 479/*
597 * First initialises the archtype hash-table (init_archetable()). 480 * First initialises the archtype hash-table (init_archetable()).
598 * 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
599 * functions). 482 * functions).
600 * Then initialises treasures by calling load_treasures(). 483 * Then initialises treasures by calling load_treasures().
601 */ 484 */
602
603void 485void
604load_archetypes (void) 486load_archetypes (void)
605{ 487{
606 char
607 filename[MAX_BUF]; 488 char filename[MAX_BUF];
608
609#if TIME_ARCH_LOAD
610 struct timeval
611 tv1,
612 tv2;
613#endif
614 489
615 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); 490 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
616 LOG (llevDebug, "Reading archetypes from %s:\n", filename); 491 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
617 492
618 { 493 {
619 object_thawer
620 thawer (filename); 494 object_thawer f (filename);
621 495
622 clear_archetable (); 496 f.next ();
497
623 LOG (llevDebug, " arch-pass 1...\n"); 498 LOG (llevDebug, " arch-pass 1...\n");
624 first_arch_pass (thawer); 499 if (!first_arch_pass (f))
500 cleanup ("errors during first arch pass are fatal");
625 LOG (llevDebug, " done\n"); 501 LOG (llevDebug, " done\n");
626 } 502 }
627 503
628 init_archetable (); 504 init_archetable ();
629 warn_archetypes = 1; 505 warn_archetypes = 1;
630 506
631 { 507 {
632 object_thawer
633 thawer (filename); 508 object_thawer f (filename);
634 509
635 LOG (llevDebug, " loading treasure...\n"); 510 LOG (llevDebug, " loading treasure...\n");
636 load_treasures (); 511 load_treasures ();
637 LOG (llevDebug, " done\n arch-pass 2...\n");
638 second_arch_pass (thawer);
639 LOG (llevDebug, " done\n"); 512 LOG (llevDebug, " done\n");
640#ifdef DEBUG 513 LOG (llevDebug, " arch-pass 2...\n");
641 check_generators (); 514 second_arch_pass (f);
642#endif 515 LOG (llevDebug, " done\n");
643 } 516 }
644 LOG (llevDebug, " done\n"); 517 LOG (llevDebug, " done\n");
645} 518}
646 519
647/* 520/*
648 * 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.
649 * This function returns NULL on failure. 522 * This function returns NULL on failure.
650 */ 523 */
651
652object * 524object *
653arch_to_object (archetype *at) 525arch_to_object (archetype *at)
654{ 526{
655 object * 527 if (!at)
656 op;
657
658 if (at == NULL)
659 { 528 {
660 if (warn_archetypes) 529 if (warn_archetypes)
661 LOG (llevError, "Couldn't find archetype.\n"); 530 LOG (llevError, "Couldn't find archetype.\n");
662 531
663 return NULL; 532 return NULL;
664 } 533 }
665 534
666 op = get_object (); 535 object *op = at->clone.clone ();
667 copy_object (&at->clone, op);
668 op->arch = at; 536 op->arch = at;
669 op->instantiate (); 537 op->instantiate ();
670 return op; 538 return op;
671} 539}
672 540
… …
674 * Creates an object. This function is called by get_archetype() 542 * Creates an object. This function is called by get_archetype()
675 * if it fails to find the appropriate archetype. 543 * if it fails to find the appropriate archetype.
676 * Thus get_archetype() will be guaranteed to always return 544 * Thus get_archetype() will be guaranteed to always return
677 * an object, and never NULL. 545 * an object, and never NULL.
678 */ 546 */
679
680object * 547object *
681create_singularity (const char *name) 548create_singularity (const char *name)
682{ 549{
683 object * 550 object *op;
684 op;
685 char
686 buf[MAX_BUF]; 551 char buf[MAX_BUF];
687 552
688 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 553 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
689 op = get_object (); 554 op = object::create ();
690 op->name = op->name_pl = buf; 555 op->name = op->name_pl = buf;
691 SET_FLAG (op, FLAG_NO_PICK); 556 SET_FLAG (op, FLAG_NO_PICK);
692 return op; 557 return op;
693} 558}
694 559
695/* 560/*
696 * Finds which archetype matches the given name, and returns a new 561 * Finds which archetype matches the given name, and returns a new
697 * object containing a copy of the archetype. 562 * object containing a copy of the archetype.
698 */ 563 */
699
700object * 564object *
701get_archetype (const char *name) 565get_archetype (const char *name)
702{ 566{
703 archetype * 567 archetype *at = archetype::find (name);
704 at;
705 568
706 at = find_archetype (name); 569 if (!at)
707 if (at == NULL)
708 return create_singularity (name); 570 return create_singularity (name);
709 571
710 return arch_to_object (at); 572 return arch_to_object (at);
711} 573}
712 574
… …
715 */ 577 */
716 578
717unsigned long 579unsigned long
718hasharch (const char *str, int tablesize) 580hasharch (const char *str, int tablesize)
719{ 581{
720 unsigned long 582 unsigned long hash = 0;
721 hash = 0;
722 unsigned int 583 unsigned int i = 0;
723 i = 0;
724 const char * 584 const char *p;
725 p;
726 585
727 /* use the one-at-a-time hash function, which supposedly is 586 /* use the one-at-a-time hash function, which supposedly is
728 * better than the djb2-like one used by perl5.005, but 587 * better than the djb2-like one used by perl5.005, but
729 * certainly is better then the bug used here before. 588 * certainly is better then the bug used here before.
730 * see http://burtleburtle.net/bob/hash/doobs.html 589 * see http://burtleburtle.net/bob/hash/doobs.html
… …
745 604
746/* 605/*
747 * Finds, using the hashtable, which archetype matches the given name. 606 * Finds, using the hashtable, which archetype matches the given name.
748 * returns a pointer to the found archetype, otherwise NULL. 607 * returns a pointer to the found archetype, otherwise NULL.
749 */ 608 */
750
751archetype * 609archetype *
752find_archetype (const char *name) 610archetype::find (const char *name)
753{ 611{
754#if USE_UNORDERED_MAP
755 name = shstr::find (name);
756
757 if (!name) 612 if (!name)
758 return 0; 613 return 0;
759 614
760 AUTODECL (i, ht.find ((size_t) name)); 615 AUTODECL (i, ht.find (name));
761 616
762 if (i == ht.end ()) 617 if (i == ht.end ())
763 return 0; 618 return 0;
764 else 619 else
765 return i->second; 620 return i->second;
766#endif
767
768 archetype *
769 at;
770 unsigned long
771 index;
772
773 if (name == NULL)
774 return (archetype *) NULL;
775
776 index = hasharch (name, ARCHTABLE);
777 arch_search++;
778 for (;;)
779 {
780 at = arch_table[index];
781 if (at == NULL)
782 {
783 if (warn_archetypes)
784 LOG (llevError, "Couldn't find archetype %s\n", name);
785 return NULL;
786 }
787 arch_cmp++;
788 if (!strcmp ((const char *) at->name, name))
789 return at;
790 if (++index >= ARCHTABLE)
791 index = 0;
792 }
793} 621}
794 622
795/* 623/*
796 * Adds an archetype to the hashtable. 624 * Adds an archetype to the hashtable.
797 */ 625 */
798 626void
799static void 627archetype::hash_add ()
800add_arch (archetype *at)
801{ 628{
802#if USE_UNORDERED_MAP 629 ht.insert (std::make_pair (name, this));
803 ht.insert (std::make_pair ((size_t) (const char *) at->name, at)); 630}
804#endif
805 631
806 int 632void
807 index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index; 633archetype::hash_del ()
808 634{
809 for (;;) 635 ht.erase (name);
810 {
811 if (arch_table[index] == NULL)
812 {
813 arch_table[index] = at;
814 return;
815 }
816
817 if (++index == ARCHTABLE)
818 index = 0;
819
820 if (index == org_index)
821 fatal (ARCHTABLE_TOO_SMALL);
822 }
823} 636}
824 637
825/* 638/*
826 * Returns the first archetype using the given type. 639 * Returns the first archetype using the given type.
827 * Used in treasure-generation. 640 * Used in treasure-generation.
828 */ 641 */
829
830archetype * 642archetype *
831type_to_archetype (int type) 643type_to_archetype (int type)
832{ 644{
833 archetype * 645 archetype *at;
834 at;
835 646
836 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 647 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
837 if (at->clone.type == type) 648 if (at->clone.type == type)
838 return at; 649 return at;
650
839 return NULL; 651 return 0;
840} 652}
841 653
842/* 654/*
843 * Returns a new object copied from the first archetype matching 655 * Returns a new object copied from the first archetype matching
844 * the given type. 656 * the given type.
… …
846 */ 658 */
847 659
848object * 660object *
849clone_arch (int type) 661clone_arch (int type)
850{ 662{
851 archetype * 663 archetype *at;
852 at;
853 object *
854 op = get_object ();
855 664
856 if ((at = type_to_archetype (type)) == NULL) 665 if ((at = type_to_archetype (type)) == NULL)
857 { 666 {
858 LOG (llevError, "Can't clone archetype %d\n", type); 667 LOG (llevError, "Can't clone archetype %d\n", type);
859 free_object (op);
860 return NULL; 668 return 0;
861 } 669 }
862 copy_object (&at->clone, op); 670
671 object *op = at->clone.clone ();
863 op->instantiate (); 672 op->instantiate ();
864 return op; 673 return op;
865} 674}
866 675
867/* 676/*
… …
869 */ 678 */
870 679
871object * 680object *
872object_create_arch (archetype *at) 681object_create_arch (archetype *at)
873{ 682{
874 object * 683 object *op, *prev = 0, *head = 0;
875 op, *
876 prev = NULL, *head = NULL;
877 684
878 while (at) 685 while (at)
879 { 686 {
880 op = arch_to_object (at); 687 op = arch_to_object (at);
881 op->x = at->clone.x; 688 op->x = at->clone.x;
882 op->y = at->clone.y; 689 op->y = at->clone.y;
690
883 if (head) 691 if (head)
884 op->head = head, prev->more = op; 692 op->head = head, prev->more = op;
693
885 if (!head) 694 if (!head)
886 head = op; 695 head = op;
696
887 prev = op; 697 prev = op;
888 at = at->more; 698 at = at->more;
889 } 699 }
700
890 return (head); 701 return (head);
891} 702}
892 703
893/*** end of arch.c ***/

Diff Legend

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