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.16 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.38 by root, Fri Feb 2 21:50:43 2007 UTC

1
2/* 1/*
3 * static char *rcsid_arch_c =
4 * "$Id: arch.C,v 1.16 2006/09/10 16:00:23 root Exp $";
5 */
6
7/*
8 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
9 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
10 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team
11 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
12 7 *
13 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
14 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
15 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
16 (at your option) any later version. 11 * (at your option) any later version.
17 12 *
18 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,
19 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 GNU General Public License for more details. 16 * GNU General Public License for more details.
22 17 *
23 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
24 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
25 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
26 21 *
27 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>
28*/ 23 */
29 24
30#include <cassert> 25#include <cassert>
31 26
32#include <tr1/unordered_map>
33
34#include <global.h> 27#include <global.h>
35#include <arch.h>
36#include <funcpoint.h> 28#include <funcpoint.h>
37#include <loader.h> 29#include <loader.h>
38 30
39/* IF set, does a little timing on the archetype load. */ 31#include <tr1/functional>
40#define TIME_ARCH_LOAD 0 32#include <tr1/unordered_map>
41 33
42static void add_arch (archetype *at);
43
44static archetype *arch_table[ARCHTABLE];
45int arch_cmp = 0; /* How many strcmp's */
46int arch_search = 0; /* How many searches */
47int arch_init; /* True if doing arch initialization */ 34int arch_init; /* True if doing arch initialization */
48 35
49/* The naming of these functions is really poor - they are all 36/* The naming of these functions is really poor - they are all
50 * pretty much named '.._arch_...', but they may more may not 37 * pretty much named '.._arch_...', but they may more may not
51 * return archetypes. Some make the arch_to_object call, and thus 38 * return archetypes. Some make the arch_to_object call, and thus
52 * return an object. Perhaps those should be called 'archob' functions 39 * return an object. Perhaps those should be called 'archob' functions
53 * to denote they return an object derived from the archetype. 40 * to denote they return an object derived from the archetype.
54 * MSW 2003-04-29 41 * MSW 2003-04-29
55 */ 42 */
56 43
57#if USE_UNORDERED_MAP
58// the hashtable 44// the hashtable
59typedef
60 std::tr1::unordered_map < 45typedef std::tr1::unordered_map
61size_t, archetype *> 46 <
47 const char *,
48 arch_ptr,
49 str_hash,
50 str_equal,
51 slice_allocator< std::pair<const char *const, arch_ptr> >
62 HT; 52 > HT;
63 53
64static 54static HT ht (5000);
65 HT
66 ht;
67#endif
68 55
69/** 56/**
70 * GROS - This function retrieves an archetype given the name that appears 57 * GROS - This function retrieves an archetype given the name that appears
71 * during the game (for example, "writing pen" instead of "stylus"). 58 * during the game (for example, "writing pen" instead of "stylus").
72 * 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.
… …
78 * - the archetype found or null if nothing was found. 65 * - the archetype found or null if nothing was found.
79 */ 66 */
80archetype * 67archetype *
81find_archetype_by_object_name (const char *name) 68find_archetype_by_object_name (const char *name)
82{ 69{
83 archetype * 70 archetype *at;
84 at;
85 71
86 if (name == NULL) 72 if (name == NULL)
87 return (archetype *) NULL; 73 return (archetype *) NULL;
88 74
89 for (at = first_archetype; at != NULL; at = at->next) 75 for (at = first_archetype; at != NULL; at = at->next)
… …
100 * except that it considers only items of the given type. 86 * except that it considers only items of the given type.
101 */ 87 */
102archetype * 88archetype *
103find_archetype_by_object_type_name (int type, const char *name) 89find_archetype_by_object_type_name (int type, const char *name)
104{ 90{
105 archetype * 91 archetype *at;
106 at;
107 92
108 if (name == NULL) 93 if (name == NULL)
109 return NULL; 94 return NULL;
110 95
111 for (at = first_archetype; at != NULL; at = at->next) 96 for (at = first_archetype; at != NULL; at = at->next)
… …
123 * If type is -1, ew don't match on type. 108 * If type is -1, ew don't match on type.
124 */ 109 */
125object * 110object *
126get_archetype_by_skill_name (const char *skill, int type) 111get_archetype_by_skill_name (const char *skill, int type)
127{ 112{
128 archetype * 113 archetype *at;
129 at;
130 114
131 if (skill == NULL) 115 if (skill)
132 return NULL;
133
134 for (at = first_archetype; at != NULL; at = at->next) 116 for (at = first_archetype; at; at = at->next)
135 {
136 if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill))) 117 if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))
137 return arch_to_object (at); 118 return arch_to_object (at);
138 } 119
139 return NULL; 120 return 0;
140} 121}
141 122
142/* similiar to above - this returns the first archetype 123/* similiar to above - this returns the first archetype
143 * that matches both the type and subtype. type and subtype 124 * that matches both the type and subtype. type and subtype
144 * can be -1 to say ignore, but in this case, the match it does 125 * can be -1 to say ignore, but in this case, the match it does
… …
173 * but it otherwise had a big memory leak. 154 * but it otherwise had a big memory leak.
174 */ 155 */
175object * 156object *
176get_archetype_by_object_name (const char *name) 157get_archetype_by_object_name (const char *name)
177{ 158{
178 archetype * 159 archetype *at;
179 at;
180 char
181 tmpname[MAX_BUF]; 160 char tmpname[MAX_BUF];
182 int 161 int i;
183 i;
184 162
185 strncpy (tmpname, name, MAX_BUF - 1); 163 assign (tmpname, name);
186 tmpname[MAX_BUF - 1] = 0; 164
187 for (i = strlen (tmpname); i > 0; i--) 165 for (i = strlen (tmpname); i > 0; i--)
188 { 166 {
189 tmpname[i] = 0; 167 tmpname[i] = 0;
190 at = find_archetype_by_object_name (tmpname); 168 at = find_archetype_by_object_name (tmpname);
169
191 if (at != NULL) 170 if (at)
192 {
193 return arch_to_object (at); 171 return arch_to_object (at);
194 }
195 } 172 }
173
196 return create_singularity (name); 174 return create_singularity (name);
197} 175}
198 176
199 /* This is a subset of the parse_id command. Basically, name can be 177 /* This is a subset of the parse_id command. Basically, name can be
200 * a string seperated lists of things to match, with certain keywords. 178 * a string seperated lists of things to match, with certain keywords.
… …
214 * Last, make a check on the full name. 192 * Last, make a check on the full name.
215 */ 193 */
216int 194int
217item_matched_string (object *pl, object *op, const char *name) 195item_matched_string (object *pl, object *op, const char *name)
218{ 196{
219 char *
220 cp,
221 local_name[MAX_BUF]; 197 char *cp, local_name[MAX_BUF];
222 int 198 int count, retval = 0;
223 count,
224 retval = 0;
225 199
226 strcpy (local_name, name); /* strtok is destructive to name */ 200 strcpy (local_name, name); /* strtok is destructive to name */
227 201
228 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) 202 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
229 { 203 {
… …
281 retval = 15; 255 retval = 15;
282 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 256 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
283 retval = 14; 257 retval = 14;
284 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 258 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
285 retval = 14; 259 retval = 14;
286
287 /* Do substring checks, so things like 'Str+1' will match. 260 /* Do substring checks, so things like 'Str+1' will match.
288 * retval of these should perhaps be lower - they are lower 261 * retval of these should perhaps be lower - they are lower
289 * then the specific strcasecmp aboves, but still higher than 262 * then the specific strcasecmp aboves, but still higher than
290 * some other match criteria. 263 * some other match criteria.
291 */ 264 */
… …
293 retval = 12; 266 retval = 12;
294 else if (strstr (query_base_name (op, 0), cp)) 267 else if (strstr (query_base_name (op, 0), cp))
295 retval = 12; 268 retval = 12;
296 else if (strstr (query_short_name (op), cp)) 269 else if (strstr (query_short_name (op), cp))
297 retval = 12; 270 retval = 12;
298
299 /* Check against plural/non plural based on count. */ 271 /* Check against plural/non plural based on count. */
300 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 272 else if (count > 1 && !strcasecmp (cp, op->name_pl))
301 {
302 retval = 6; 273 retval = 6;
303 }
304 else if (count == 1 && !strcasecmp (op->name, cp)) 274 else if (count == 1 && !strcasecmp (op->name, cp))
305 {
306 retval = 6; 275 retval = 6;
307 }
308 /* base name matched - not bad */ 276 /* base name matched - not bad */
309 else if (strcasecmp (cp, op->name) == 0 && !count) 277 else if (strcasecmp (cp, op->name) == 0 && !count)
310 retval = 4; 278 retval = 4;
311 /* Check for partial custom name, but give a real low priority */ 279 /* Check for partial custom name, but give a real low priority */
312 else if (op->custom_name && strstr (op->custom_name, cp)) 280 else if (op->custom_name && strstr (op->custom_name, cp))
… …
314 282
315 if (retval) 283 if (retval)
316 { 284 {
317 if (pl->type == PLAYER) 285 if (pl->type == PLAYER)
318 pl->contr->count = count; 286 pl->contr->count = count;
287
319 return retval; 288 return retval;
320 } 289 }
321 } 290 }
291
322 return 0; 292 return 0;
323} 293}
324 294
325/* 295/*
326 * Initialises the internal linked list of archetypes (read from file). 296 * Initialises the internal linked list of archetypes (read from file).
… …
331void 301void
332init_archetypes (void) 302init_archetypes (void)
333{ /* called from add_player() and edit() */ 303{ /* called from add_player() and edit() */
334 if (first_archetype != NULL) /* Only do this once */ 304 if (first_archetype != NULL) /* Only do this once */
335 return; 305 return;
306
336 arch_init = 1; 307 arch_init = 1;
337 load_archetypes (); 308 load_archetypes ();
338 arch_init = 0; 309 arch_init = 0;
339 empty_archetype = find_archetype ("empty_archetype"); 310 empty_archetype = archetype::find ("empty_archetype");
340 311
341/* init_blocksview();*/ 312/* init_blocksview();*/
342} 313}
343 314
344/* 315/*
345 * Stores debug-information about how efficient the hashtable
346 * used for archetypes has been in the static errmsg array.
347 */
348
349void
350arch_info (object *op)
351{
352 sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);
353 new_draw_info (NDI_BLACK, 0, op, errmsg);
354}
355
356/*
357 * Initialise the hashtable used by the archetypes.
358 */
359
360void
361clear_archetable (void)
362{
363 memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *));
364}
365
366/*
367 * An alternative way to init the hashtable which is slower, but _works_... 316 * An alternative way to init the hashtable which is slower, but _works_...
368 */ 317 */
369
370void 318void
371init_archetable (void) 319init_archetable (void)
372{ 320{
373 archetype * 321 archetype *at;
374 at;
375 322
376 LOG (llevDebug, " Setting up archetable...\n"); 323 LOG (llevDebug, " Setting up archetable...\n");
377 324
378 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 325 for (at = first_archetype; at; at = at->more ? at->more : at->next)
379 add_arch (at); 326 at->hash_add ();
380 327
381 LOG (llevDebug, "done\n"); 328 LOG (llevDebug, "done\n");
382} 329}
383 330
384/*
385 * Dumps an archetype to debug-level output.
386 */
387
388void
389dump_arch (archetype *at)
390{
391 dump_object (&at->clone);
392}
393
394/*
395 * Dumps _all_ archetypes to debug-level output.
396 * If you run crossfire with debug, and enter DM-mode, you can trigger
397 * this with the O key.
398 */
399
400void
401dump_all_archetypes (void)
402{
403 archetype *
404 at;
405
406 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
407 {
408 dump_arch (at);
409 fprintf (logfile, "%s\n", errmsg);
410 }
411}
412
413void 331void
414free_all_archs (void) 332free_all_archs (void)
415{ 333{
416 archetype * 334 archetype *at, *next;
417 at, *
418 next;
419 int
420 i = 0, f = 0; 335 int i = 0, f = 0;
421 336
422 for (at = first_archetype; at != NULL; at = next) 337 for (at = first_archetype; at; at = next)
423 { 338 {
424 if (at->more) 339 if (at->more)
425 next = at->more; 340 next = at->more;
426 else 341 else
427 next = at->next; 342 next = at->next;
… …
429 delete 344 delete
430 at; 345 at;
431 346
432 i++; 347 i++;
433 } 348 }
349
434 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); 350 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
435} 351}
436 352
437archetype::archetype () 353archetype::archetype ()
438{ 354{
439 clear_object (&clone); /* to initial state other also */
440 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */ 355 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
441 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ 356 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
442} 357}
443 358
444archetype::~archetype () 359archetype::~archetype ()
445{ 360{
… …
450 * of archetype-structures. 365 * of archetype-structures.
451 */ 366 */
452void 367void
453first_arch_pass (object_thawer & fp) 368first_arch_pass (object_thawer & fp)
454{ 369{
455 archetype * 370 archetype *head = 0, *last_more = 0;
456 at, *
457 head = NULL, *last_more = NULL;
458 371
372 archetype *at = new archetype;
459 at->clone.arch = first_archetype = at = new archetype; 373 at->clone.arch = first_archetype = at;
460 374
461 while (int i = load_object (fp, &at->clone, 0)) 375 while (int i = load_object (fp, &at->clone, 0))
462 { 376 {
463 at->clone.speed_left = (float) (-0.1); 377 at->clone.speed_left = (float) (-0.1);
464 /* copy the body_info to the body_used - this is only really 378 /* copy the body_info to the body_used - this is only really
… …
531 */ 445 */
532 446
533void 447void
534second_arch_pass (object_thawer & thawer) 448second_arch_pass (object_thawer & thawer)
535{ 449{
536 char
537 buf[MAX_BUF], *
538 variable = buf, *argument, *cp; 450 char buf[MAX_BUF], *variable = buf, *argument, *cp;
539 archetype *
540 at = NULL, *other; 451 archetype *at = NULL, *other;
541 452
542 while (fgets (buf, MAX_BUF, thawer) != NULL) 453 while (fgets (buf, MAX_BUF, thawer) != NULL)
543 { 454 {
544 if (*buf == '#') 455 if (*buf == '#')
545 continue; 456 continue;
… …
553 cp--; 464 cp--;
554 } 465 }
555 } 466 }
556 if (!strcmp ("Object", variable)) 467 if (!strcmp ("Object", variable))
557 { 468 {
558 if ((at = find_archetype (argument)) == NULL) 469 if ((at = archetype::find (argument)) == NULL)
559 LOG (llevError, "Warning: failed to find arch %s\n", argument); 470 LOG (llevError, "Warning: failed to find arch %s\n", argument);
560 } 471 }
561 else if (!strcmp ("other_arch", variable)) 472 else if (!strcmp ("other_arch", variable))
562 { 473 {
563 if (at != NULL && at->clone.other_arch == NULL) 474 if (at != NULL && at->clone.other_arch == NULL)
564 { 475 {
565 if ((other = find_archetype (argument)) == NULL) 476 if ((other = archetype::find (argument)) == NULL)
566 LOG (llevError, "Warning: failed to find other_arch %s\n", argument); 477 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
567 else if (at != NULL) 478 else if (at != NULL)
568 at->clone.other_arch = other; 479 at->clone.other_arch = other;
569 } 480 }
570 } 481 }
571 else if (!strcmp ("randomitems", variable)) 482 else if (!strcmp ("randomitems", variable))
572 { 483 {
573 if (at != NULL) 484 if (at != NULL)
574 { 485 {
575 treasurelist *
576 tl = find_treasurelist (argument); 486 treasurelist *tl = find_treasurelist (argument);
577 487
578 if (tl == NULL) 488 if (tl == NULL)
579 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); 489 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
580 else 490 else
581 at->clone.randomitems = tl; 491 at->clone.randomitems = tl;
… …
586 496
587#ifdef DEBUG 497#ifdef DEBUG
588void 498void
589check_generators (void) 499check_generators (void)
590{ 500{
591 archetype * 501 archetype *at;
592 at;
593 502
594 for (at = first_archetype; at != NULL; at = at->next) 503 for (at = first_archetype; at != NULL; at = at->next)
595 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) 504 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
596 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); 505 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
597} 506}
… …
605 */ 514 */
606 515
607void 516void
608load_archetypes (void) 517load_archetypes (void)
609{ 518{
610 char
611 filename[MAX_BUF]; 519 char filename[MAX_BUF];
612
613#if TIME_ARCH_LOAD
614 struct timeval
615 tv1,
616 tv2;
617#endif
618 520
619 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); 521 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
620 LOG (llevDebug, "Reading archetypes from %s:\n", filename); 522 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
621 523
622 { 524 {
623 object_thawer 525 object_thawer
624 thawer (filename); 526 thawer (filename);
625 527
626 clear_archetable ();
627 LOG (llevDebug, " arch-pass 1...\n"); 528 LOG (llevDebug, " arch-pass 1...\n");
628 first_arch_pass (thawer); 529 first_arch_pass (thawer);
629 LOG (llevDebug, " done\n"); 530 LOG (llevDebug, " done\n");
630 } 531 }
631 532
… …
636 object_thawer 537 object_thawer
637 thawer (filename); 538 thawer (filename);
638 539
639 LOG (llevDebug, " loading treasure...\n"); 540 LOG (llevDebug, " loading treasure...\n");
640 load_treasures (); 541 load_treasures ();
542 LOG (llevDebug, " done\n");
641 LOG (llevDebug, " done\n arch-pass 2...\n"); 543 LOG (llevDebug, " arch-pass 2...\n");
642 second_arch_pass (thawer); 544 second_arch_pass (thawer);
643 LOG (llevDebug, " done\n"); 545 LOG (llevDebug, " done\n");
644#ifdef DEBUG 546#ifdef DEBUG
645 check_generators (); 547 check_generators ();
646#endif 548#endif
… …
650 552
651/* 553/*
652 * Creates and returns a new object which is a copy of the given archetype. 554 * Creates and returns a new object which is a copy of the given archetype.
653 * This function returns NULL on failure. 555 * This function returns NULL on failure.
654 */ 556 */
655
656object * 557object *
657arch_to_object (archetype *at) 558arch_to_object (archetype *at)
658{ 559{
659 object * 560 object *op;
660 op;
661 561
662 if (at == NULL) 562 if (at == NULL)
663 { 563 {
664 if (warn_archetypes) 564 if (warn_archetypes)
665 LOG (llevError, "Couldn't find archetype.\n"); 565 LOG (llevError, "Couldn't find archetype.\n");
666 566
667 return NULL; 567 return NULL;
668 } 568 }
669 569
670 op = get_object (); 570 op = at->clone.clone ();
671 copy_object (&at->clone, op);
672 op->arch = at; 571 op->arch = at;
673 op->instantiate (); 572 op->instantiate ();
674 return op; 573 return op;
675} 574}
676 575
… …
678 * Creates an object. This function is called by get_archetype() 577 * Creates an object. This function is called by get_archetype()
679 * if it fails to find the appropriate archetype. 578 * if it fails to find the appropriate archetype.
680 * Thus get_archetype() will be guaranteed to always return 579 * Thus get_archetype() will be guaranteed to always return
681 * an object, and never NULL. 580 * an object, and never NULL.
682 */ 581 */
683
684object * 582object *
685create_singularity (const char *name) 583create_singularity (const char *name)
686{ 584{
687 object * 585 object *op;
688 op;
689 char
690 buf[MAX_BUF]; 586 char buf[MAX_BUF];
691 587
692 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 588 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
693 op = get_object (); 589 op = object::create ();
694 op->name = op->name_pl = buf; 590 op->name = op->name_pl = buf;
695 SET_FLAG (op, FLAG_NO_PICK); 591 SET_FLAG (op, FLAG_NO_PICK);
696 return op; 592 return op;
697} 593}
698 594
699/* 595/*
700 * Finds which archetype matches the given name, and returns a new 596 * Finds which archetype matches the given name, and returns a new
701 * object containing a copy of the archetype. 597 * object containing a copy of the archetype.
702 */ 598 */
703
704object * 599object *
705get_archetype (const char *name) 600get_archetype (const char *name)
706{ 601{
707 archetype * 602 archetype *at = archetype::find (name);
708 at;
709 603
710 at = find_archetype (name); 604 if (!at)
711 if (at == NULL)
712 return create_singularity (name); 605 return create_singularity (name);
713 606
714 return arch_to_object (at); 607 return arch_to_object (at);
715} 608}
716 609
… …
719 */ 612 */
720 613
721unsigned long 614unsigned long
722hasharch (const char *str, int tablesize) 615hasharch (const char *str, int tablesize)
723{ 616{
724 unsigned long 617 unsigned long hash = 0;
725 hash = 0;
726 unsigned int 618 unsigned int i = 0;
727 i = 0;
728 const char * 619 const char *p;
729 p;
730 620
731 /* use the one-at-a-time hash function, which supposedly is 621 /* use the one-at-a-time hash function, which supposedly is
732 * better than the djb2-like one used by perl5.005, but 622 * better than the djb2-like one used by perl5.005, but
733 * certainly is better then the bug used here before. 623 * certainly is better then the bug used here before.
734 * see http://burtleburtle.net/bob/hash/doobs.html 624 * see http://burtleburtle.net/bob/hash/doobs.html
… …
749 639
750/* 640/*
751 * Finds, using the hashtable, which archetype matches the given name. 641 * Finds, using the hashtable, which archetype matches the given name.
752 * returns a pointer to the found archetype, otherwise NULL. 642 * returns a pointer to the found archetype, otherwise NULL.
753 */ 643 */
754
755archetype * 644archetype *
756find_archetype (const char *name) 645archetype::find (const char *name)
757{ 646{
758#if USE_UNORDERED_MAP
759 name = shstr::find (name);
760
761 if (!name) 647 if (!name)
762 return 0; 648 return 0;
763 649
764 HT::const_iterator i = ht.find ((size_t) name); 650 AUTODECL (i, ht.find (name));
765 651
766 if (i == ht.end ()) 652 if (i == ht.end ())
767 return 0; 653 return 0;
768 else 654 else
769 return i->second; 655 return i->second;
770#endif
771
772 archetype *
773 at;
774 unsigned long
775 index;
776
777 if (name == NULL)
778 return (archetype *) NULL;
779
780 index = hasharch (name, ARCHTABLE);
781 arch_search++;
782 for (;;)
783 {
784 at = arch_table[index];
785 if (at == NULL)
786 {
787 if (warn_archetypes)
788 LOG (llevError, "Couldn't find archetype %s\n", name);
789 return NULL;
790 }
791 arch_cmp++;
792 if (!strcmp ((const char *) at->name, name))
793 return at;
794 if (++index >= ARCHTABLE)
795 index = 0;
796 }
797} 656}
798 657
799/* 658/*
800 * Adds an archetype to the hashtable. 659 * Adds an archetype to the hashtable.
801 */ 660 */
802 661void
803static void 662archetype::hash_add ()
804add_arch (archetype *at)
805{ 663{
806#if USE_UNORDERED_MAP 664 ht.insert (std::make_pair (name, this));
807 ht.insert (std::make_pair ((size_t) (const char *) at->name, at)); 665}
808#endif
809 666
810 int 667void
811 index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index; 668archetype::hash_del ()
812 669{
813 for (;;) 670 ht.erase (name);
814 {
815 if (arch_table[index] == NULL)
816 {
817 arch_table[index] = at;
818 return;
819 }
820
821 if (++index == ARCHTABLE)
822 index = 0;
823
824 if (index == org_index)
825 fatal (ARCHTABLE_TOO_SMALL);
826 }
827} 671}
828 672
829/* 673/*
830 * Returns the first archetype using the given type. 674 * Returns the first archetype using the given type.
831 * Used in treasure-generation. 675 * Used in treasure-generation.
832 */ 676 */
833
834archetype * 677archetype *
835type_to_archetype (int type) 678type_to_archetype (int type)
836{ 679{
837 archetype * 680 archetype *at;
838 at;
839 681
840 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 682 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
841 if (at->clone.type == type) 683 if (at->clone.type == type)
842 return at; 684 return at;
685
843 return NULL; 686 return 0;
844} 687}
845 688
846/* 689/*
847 * Returns a new object copied from the first archetype matching 690 * Returns a new object copied from the first archetype matching
848 * the given type. 691 * the given type.
… …
850 */ 693 */
851 694
852object * 695object *
853clone_arch (int type) 696clone_arch (int type)
854{ 697{
855 archetype * 698 archetype *at;
856 at;
857 object *
858 op = get_object ();
859 699
860 if ((at = type_to_archetype (type)) == NULL) 700 if ((at = type_to_archetype (type)) == NULL)
861 { 701 {
862 LOG (llevError, "Can't clone archetype %d\n", type); 702 LOG (llevError, "Can't clone archetype %d\n", type);
863 free_object (op);
864 return NULL; 703 return 0;
865 } 704 }
866 copy_object (&at->clone, op); 705
706 object *op = at->clone.clone ();
867 op->instantiate (); 707 op->instantiate ();
868 return op; 708 return op;
869} 709}
870 710
871/* 711/*
… …
873 */ 713 */
874 714
875object * 715object *
876object_create_arch (archetype *at) 716object_create_arch (archetype *at)
877{ 717{
878 object * 718 object *op, *prev = 0, *head = 0;
879 op, *
880 prev = NULL, *head = NULL;
881 719
882 while (at) 720 while (at)
883 { 721 {
884 op = arch_to_object (at); 722 op = arch_to_object (at);
885 op->x = at->clone.x; 723 op->x = at->clone.x;
886 op->y = at->clone.y; 724 op->y = at->clone.y;
725
887 if (head) 726 if (head)
888 op->head = head, prev->more = op; 727 op->head = head, prev->more = op;
728
889 if (!head) 729 if (!head)
890 head = op; 730 head = op;
731
891 prev = op; 732 prev = op;
892 at = at->more; 733 at = at->more;
893 } 734 }
735
894 return (head); 736 return (head);
895} 737}
896 738
897/*** end of arch.c ***/

Diff Legend

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