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.17 by root, Tue Sep 12 19:20:06 2006 UTC vs.
Revision 1.42 by root, Fri Feb 9 01:52:10 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
54 std::tr1::unordered_map < 45typedef std::tr1::unordered_map
55size_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> >
56 HT; 52 > HT;
57 53
58static 54static HT ht (5000);
59 HT
60 ht;
61#endif
62 55
63/** 56/**
64 * GROS - This function retrieves an archetype given the name that appears 57 * GROS - This function retrieves an archetype given the name that appears
65 * during the game (for example, "writing pen" instead of "stylus"). 58 * 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. 59 * It does not use the hashtable system, but browse the whole archlist each time.
… …
72 * - the archetype found or null if nothing was found. 65 * - the archetype found or null if nothing was found.
73 */ 66 */
74archetype * 67archetype *
75find_archetype_by_object_name (const char *name) 68find_archetype_by_object_name (const char *name)
76{ 69{
77 archetype * 70 shstr_cmp name_cmp (name);
78 at;
79 71
80 if (name == NULL)
81 return (archetype *) NULL;
82
83 for (at = first_archetype; at != NULL; at = at->next) 72 for (archetype *at = first_archetype; at; at = at->next)
84 { 73 if (at->clone.name == name_cmp)
85 if (!strcmp (at->clone.name, name))
86 return at; 74 return at;
87 } 75
88 return NULL; 76 return 0;
89} 77}
90 78
91/** 79/**
92 * 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
93 * 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()
94 * except that it considers only items of the given type. 82 * except that it considers only items of the given type.
95 */ 83 */
96archetype * 84archetype *
97find_archetype_by_object_type_name (int type, const char *name) 85find_archetype_by_object_type_name (int type, const char *name)
98{ 86{
99 archetype * 87 shstr_cmp name_cmp (name);
100 at;
101 88
102 if (name == NULL)
103 return NULL;
104
105 for (at = first_archetype; at != NULL; at = at->next) 89 for (archetype *at = first_archetype; at; at = at->next)
106 { 90 if (at->clone.name == name_cmp && at->clone.type == type)
107 if (at->clone.type == type && strcmp (at->clone.name, name) == 0)
108 return at; 91 return at;
109 }
110 92
111 return NULL; 93 return 0;
112} 94}
113 95
114/* 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
115 * 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
116 * 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).
117 * If type is -1, ew don't match on type. 99 * If type is -1, ew don't match on type.
118 */ 100 */
119object * 101object *
120get_archetype_by_skill_name (const char *skill, int type) 102get_archetype_by_skill_name (const char *skill, int type)
121{ 103{
122 archetype * 104 shstr_cmp skill_cmp (skill);
123 at;
124 105
125 if (skill == NULL)
126 return NULL;
127
128 for (at = first_archetype; at != NULL; at = at->next) 106 for (archetype *at = first_archetype; at; at = at->next)
129 { 107 if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type))
130 if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))
131 return arch_to_object (at); 108 return arch_to_object (at);
132 } 109
133 return NULL; 110 return 0;
134} 111}
135 112
136/* similiar to above - this returns the first archetype 113/* similiar to above - this returns the first archetype
137 * that matches both the type and subtype. type and subtype 114 * that matches both the type and subtype. type and subtype
138 * 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
… …
141 * (eg, skills) 118 * (eg, skills)
142 */ 119 */
143archetype * 120archetype *
144get_archetype_by_type_subtype (int type, int subtype) 121get_archetype_by_type_subtype (int type, int subtype)
145{ 122{
146 archetype *
147 at;
148
149 for (at = first_archetype; at != NULL; at = at->next) 123 for (archetype *at = first_archetype; at; at = at->next)
150 {
151 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))
152 return at; 125 return at;
153 } 126
154 return NULL; 127 return 0;
155} 128}
156 129
157/** 130/**
158 * 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
159 * (for example, "writing pen" instead of "stylus"). 132 * (for example, "writing pen" instead of "stylus").
… …
167 * but it otherwise had a big memory leak. 140 * but it otherwise had a big memory leak.
168 */ 141 */
169object * 142object *
170get_archetype_by_object_name (const char *name) 143get_archetype_by_object_name (const char *name)
171{ 144{
172 archetype *at;
173 char tmpname[MAX_BUF]; 145 char tmpname[MAX_BUF];
174 int i; 146 int i;
175 147
176 assign (tmpname, name); 148 assign (tmpname, name);
177 149
178 for (i = strlen (tmpname); i > 0; i--) 150 for (i = strlen (tmpname); i > 0; i--)
179 { 151 {
180 tmpname[i] = 0; 152 tmpname[i] = 0;
153
181 at = find_archetype_by_object_name (tmpname); 154 if (archetype *at = find_archetype_by_object_name (tmpname))
182
183 if (at != NULL)
184 {
185 return arch_to_object (at); 155 return arch_to_object (at);
186 }
187 } 156 }
188 157
189 return create_singularity (name); 158 return create_singularity (name);
190} 159}
191 160
… …
207 * Last, make a check on the full name. 176 * Last, make a check on the full name.
208 */ 177 */
209int 178int
210item_matched_string (object *pl, object *op, const char *name) 179item_matched_string (object *pl, object *op, const char *name)
211{ 180{
212 char *
213 cp,
214 local_name[MAX_BUF]; 181 char *cp, local_name[MAX_BUF];
215 int 182 int count, retval = 0;
216 count,
217 retval = 0;
218 183
219 strcpy (local_name, name); /* strtok is destructive to name */ 184 assign (local_name, name); /* strtok is destructive to name */
220 185
221 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) 186 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
222 { 187 {
223 while (cp[0] == ' ') 188 while (cp[0] == ' ')
224 ++cp; /* get rid of spaces */ 189 ++cp; /* get rid of spaces */
… …
274 retval = 15; 239 retval = 15;
275 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 240 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
276 retval = 14; 241 retval = 14;
277 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 242 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
278 retval = 14; 243 retval = 14;
279
280 /* Do substring checks, so things like 'Str+1' will match. 244 /* Do substring checks, so things like 'Str+1' will match.
281 * retval of these should perhaps be lower - they are lower 245 * retval of these should perhaps be lower - they are lower
282 * then the specific strcasecmp aboves, but still higher than 246 * then the specific strcasecmp aboves, but still higher than
283 * some other match criteria. 247 * some other match criteria.
284 */ 248 */
… …
286 retval = 12; 250 retval = 12;
287 else if (strstr (query_base_name (op, 0), cp)) 251 else if (strstr (query_base_name (op, 0), cp))
288 retval = 12; 252 retval = 12;
289 else if (strstr (query_short_name (op), cp)) 253 else if (strstr (query_short_name (op), cp))
290 retval = 12; 254 retval = 12;
291
292 /* Check against plural/non plural based on count. */ 255 /* Check against plural/non plural based on count. */
293 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 256 else if (count > 1 && !strcasecmp (cp, op->name_pl))
294 {
295 retval = 6; 257 retval = 6;
296 }
297 else if (count == 1 && !strcasecmp (op->name, cp)) 258 else if (count == 1 && !strcasecmp (op->name, cp))
298 {
299 retval = 6; 259 retval = 6;
300 }
301 /* base name matched - not bad */ 260 /* base name matched - not bad */
302 else if (strcasecmp (cp, op->name) == 0 && !count) 261 else if (strcasecmp (cp, op->name) == 0 && !count)
303 retval = 4; 262 retval = 4;
304 /* Check for partial custom name, but give a real low priority */ 263 /* Check for partial custom name, but give a real low priority */
305 else if (op->custom_name && strstr (op->custom_name, cp)) 264 else if (op->custom_name && strstr (op->custom_name, cp))
… …
307 266
308 if (retval) 267 if (retval)
309 { 268 {
310 if (pl->type == PLAYER) 269 if (pl->type == PLAYER)
311 pl->contr->count = count; 270 pl->contr->count = count;
271
312 return retval; 272 return retval;
313 } 273 }
314 } 274 }
275
315 return 0; 276 return 0;
316} 277}
317 278
318/* 279/*
319 * Initialises the internal linked list of archetypes (read from file). 280 * Initialises the internal linked list of archetypes (read from file).
… …
324void 285void
325init_archetypes (void) 286init_archetypes (void)
326{ /* called from add_player() and edit() */ 287{ /* called from add_player() and edit() */
327 if (first_archetype != NULL) /* Only do this once */ 288 if (first_archetype != NULL) /* Only do this once */
328 return; 289 return;
290
329 arch_init = 1; 291 arch_init = 1;
330 load_archetypes (); 292 load_archetypes ();
331 arch_init = 0; 293 arch_init = 0;
332 empty_archetype = find_archetype ("empty_archetype"); 294 empty_archetype = archetype::find ("empty_archetype");
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 * 305 archetype *at;
367 at;
368 306
369 LOG (llevDebug, " Setting up archetable...\n"); 307 LOG (llevDebug, " Setting up archetable...\n");
370 308
371 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 309 for (at = first_archetype; at; at = at->more ? at->more : at->next)
372 add_arch (at); 310 at->hash_add ();
373 311
374 LOG (llevDebug, "done\n"); 312 LOG (llevDebug, "done\n");
375} 313}
376 314
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}
405
406void 315void
407free_all_archs (void) 316free_all_archs (void)
408{ 317{
409 archetype * 318 archetype *at, *next;
410 at, *
411 next;
412 int
413 i = 0, f = 0; 319 int i = 0, f = 0;
414 320
415 for (at = first_archetype; at != NULL; at = next) 321 for (at = first_archetype; at; at = next)
416 { 322 {
417 if (at->more) 323 if (at->more)
418 next = at->more; 324 next = at->more;
419 else 325 else
420 next = at->next; 326 next = at->next;
… …
422 delete 328 delete
423 at; 329 at;
424 330
425 i++; 331 i++;
426 } 332 }
333
427 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); 334 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
428} 335}
429 336
430archetype::archetype () 337archetype::archetype ()
431{ 338{
432 clear_object (&clone); /* to initial state other also */
433 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */ 339 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
434 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ 340 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
435} 341}
436 342
437archetype::~archetype () 343archetype::~archetype ()
438{ 344{
… …
443 * of archetype-structures. 349 * of archetype-structures.
444 */ 350 */
445void 351void
446first_arch_pass (object_thawer & fp) 352first_arch_pass (object_thawer & fp)
447{ 353{
448 archetype * 354 archetype *head = 0, *last_more = 0;
449 at, *
450 head = NULL, *last_more = NULL;
451 355
356 archetype *at = new archetype;
452 at->clone.arch = first_archetype = at = new archetype; 357 at->clone.arch = first_archetype = at;
453 358
454 while (int i = load_object (fp, &at->clone, 0)) 359 while (int i = load_object (fp, &at->clone, 0))
455 { 360 {
456 at->clone.speed_left = (float) (-0.1); 361 at->clone.speed_left = (float) (-0.1);
457 /* copy the body_info to the body_used - this is only really 362 /* copy the body_info to the body_used - this is only really
… …
524 */ 429 */
525 430
526void 431void
527second_arch_pass (object_thawer & thawer) 432second_arch_pass (object_thawer & thawer)
528{ 433{
529 char
530 buf[MAX_BUF], *
531 variable = buf, *argument, *cp; 434 char buf[MAX_BUF], *variable = buf, *argument, *cp;
532 archetype *
533 at = NULL, *other; 435 archetype *at = NULL, *other;
534 436
535 while (fgets (buf, MAX_BUF, thawer) != NULL) 437 while (fgets (buf, MAX_BUF, thawer) != NULL)
536 { 438 {
537 if (*buf == '#') 439 if (*buf == '#')
538 continue; 440 continue;
441
539 if ((argument = strchr (buf, ' ')) != NULL) 442 if ((argument = strchr (buf, ' ')) != NULL)
540 { 443 {
541 *argument = '\0', argument++; 444 *argument = '\0', argument++;
542 cp = argument + strlen (argument) - 1; 445 cp = argument + strlen (argument) - 1;
543 while (isspace (*cp)) 446 while (isspace (*cp))
544 { 447 {
545 *cp = '\0'; 448 *cp = '\0';
546 cp--; 449 cp--;
547 } 450 }
548 } 451 }
452
549 if (!strcmp ("Object", variable)) 453 if (!strcmp ("object", variable))
550 { 454 {
551 if ((at = find_archetype (argument)) == NULL) 455 if ((at = archetype::find (argument)) == NULL)
552 LOG (llevError, "Warning: failed to find arch %s\n", argument); 456 LOG (llevError, "Warning: failed to find arch %s\n", argument);
553 } 457 }
554 else if (!strcmp ("other_arch", variable)) 458 else if (!strcmp ("other_arch", variable))
555 { 459 {
556 if (at != NULL && at->clone.other_arch == NULL) 460 if (at != NULL && at->clone.other_arch == NULL)
557 { 461 {
558 if ((other = find_archetype (argument)) == NULL) 462 if ((other = archetype::find (argument)) == NULL)
559 LOG (llevError, "Warning: failed to find other_arch %s\n", argument); 463 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
560 else if (at != NULL) 464 else if (at != NULL)
561 at->clone.other_arch = other; 465 at->clone.other_arch = other;
562 } 466 }
563 } 467 }
564 else if (!strcmp ("randomitems", variable)) 468 else if (!strcmp ("randomitems", variable))
565 { 469 {
566 if (at != NULL) 470 if (at)
567 { 471 {
568 treasurelist *
569 tl = find_treasurelist (argument); 472 treasurelist *tl = find_treasurelist (argument);
570 473
571 if (tl == NULL) 474 if (tl == NULL)
572 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); 475 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
573 else 476 else
574 at->clone.randomitems = tl; 477 at->clone.randomitems = tl;
… …
579 482
580#ifdef DEBUG 483#ifdef DEBUG
581void 484void
582check_generators (void) 485check_generators (void)
583{ 486{
584 archetype * 487 archetype *at;
585 at;
586 488
587 for (at = first_archetype; at != NULL; at = at->next) 489 for (at = first_archetype; at != NULL; at = at->next)
588 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) 490 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); 491 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
590} 492}
… …
598 */ 500 */
599 501
600void 502void
601load_archetypes (void) 503load_archetypes (void)
602{ 504{
603 char
604 filename[MAX_BUF]; 505 char filename[MAX_BUF];
605
606#if TIME_ARCH_LOAD
607 struct timeval
608 tv1,
609 tv2;
610#endif
611 506
612 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); 507 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
613 LOG (llevDebug, "Reading archetypes from %s:\n", filename); 508 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
614 509
615 { 510 {
616 object_thawer 511 object_thawer
617 thawer (filename); 512 thawer (filename);
618 513
619 clear_archetable ();
620 LOG (llevDebug, " arch-pass 1...\n"); 514 LOG (llevDebug, " arch-pass 1...\n");
621 first_arch_pass (thawer); 515 first_arch_pass (thawer);
622 LOG (llevDebug, " done\n"); 516 LOG (llevDebug, " done\n");
623 } 517 }
624 518
… …
629 object_thawer 523 object_thawer
630 thawer (filename); 524 thawer (filename);
631 525
632 LOG (llevDebug, " loading treasure...\n"); 526 LOG (llevDebug, " loading treasure...\n");
633 load_treasures (); 527 load_treasures ();
528 LOG (llevDebug, " done\n");
634 LOG (llevDebug, " done\n arch-pass 2...\n"); 529 LOG (llevDebug, " arch-pass 2...\n");
635 second_arch_pass (thawer); 530 second_arch_pass (thawer);
636 LOG (llevDebug, " done\n"); 531 LOG (llevDebug, " done\n");
637#ifdef DEBUG 532#ifdef DEBUG
638 check_generators (); 533 check_generators ();
639#endif 534#endif
… …
643 538
644/* 539/*
645 * Creates and returns a new object which is a copy of the given archetype. 540 * Creates and returns a new object which is a copy of the given archetype.
646 * This function returns NULL on failure. 541 * This function returns NULL on failure.
647 */ 542 */
648
649object * 543object *
650arch_to_object (archetype *at) 544arch_to_object (archetype *at)
651{ 545{
652 object * 546 object *op;
653 op;
654 547
655 if (at == NULL) 548 if (at == NULL)
656 { 549 {
657 if (warn_archetypes) 550 if (warn_archetypes)
658 LOG (llevError, "Couldn't find archetype.\n"); 551 LOG (llevError, "Couldn't find archetype.\n");
659 552
660 return NULL; 553 return NULL;
661 } 554 }
662 555
663 op = get_object (); 556 op = at->clone.clone ();
664 copy_object (&at->clone, op);
665 op->arch = at; 557 op->arch = at;
666 op->instantiate (); 558 op->instantiate ();
667 return op; 559 return op;
668} 560}
669 561
… …
671 * Creates an object. This function is called by get_archetype() 563 * Creates an object. This function is called by get_archetype()
672 * if it fails to find the appropriate archetype. 564 * if it fails to find the appropriate archetype.
673 * Thus get_archetype() will be guaranteed to always return 565 * Thus get_archetype() will be guaranteed to always return
674 * an object, and never NULL. 566 * an object, and never NULL.
675 */ 567 */
676
677object * 568object *
678create_singularity (const char *name) 569create_singularity (const char *name)
679{ 570{
680 object * 571 object *op;
681 op;
682 char
683 buf[MAX_BUF]; 572 char buf[MAX_BUF];
684 573
685 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 574 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
686 op = get_object (); 575 op = object::create ();
687 op->name = op->name_pl = buf; 576 op->name = op->name_pl = buf;
688 SET_FLAG (op, FLAG_NO_PICK); 577 SET_FLAG (op, FLAG_NO_PICK);
689 return op; 578 return op;
690} 579}
691 580
692/* 581/*
693 * Finds which archetype matches the given name, and returns a new 582 * Finds which archetype matches the given name, and returns a new
694 * object containing a copy of the archetype. 583 * object containing a copy of the archetype.
695 */ 584 */
696
697object * 585object *
698get_archetype (const char *name) 586get_archetype (const char *name)
699{ 587{
700 archetype * 588 archetype *at = archetype::find (name);
701 at;
702 589
703 at = find_archetype (name); 590 if (!at)
704 if (at == NULL)
705 return create_singularity (name); 591 return create_singularity (name);
706 592
707 return arch_to_object (at); 593 return arch_to_object (at);
708} 594}
709 595
… …
712 */ 598 */
713 599
714unsigned long 600unsigned long
715hasharch (const char *str, int tablesize) 601hasharch (const char *str, int tablesize)
716{ 602{
717 unsigned long 603 unsigned long hash = 0;
718 hash = 0;
719 unsigned int 604 unsigned int i = 0;
720 i = 0;
721 const char * 605 const char *p;
722 p;
723 606
724 /* use the one-at-a-time hash function, which supposedly is 607 /* use the one-at-a-time hash function, which supposedly is
725 * better than the djb2-like one used by perl5.005, but 608 * better than the djb2-like one used by perl5.005, but
726 * certainly is better then the bug used here before. 609 * certainly is better then the bug used here before.
727 * see http://burtleburtle.net/bob/hash/doobs.html 610 * see http://burtleburtle.net/bob/hash/doobs.html
… …
742 625
743/* 626/*
744 * Finds, using the hashtable, which archetype matches the given name. 627 * Finds, using the hashtable, which archetype matches the given name.
745 * returns a pointer to the found archetype, otherwise NULL. 628 * returns a pointer to the found archetype, otherwise NULL.
746 */ 629 */
747
748archetype * 630archetype *
749find_archetype (const char *name) 631archetype::find (const char *name)
750{ 632{
751#if USE_UNORDERED_MAP
752 name = shstr::find (name);
753
754 if (!name) 633 if (!name)
755 return 0; 634 return 0;
756 635
757 HT::const_iterator i = ht.find ((size_t) name); 636 AUTODECL (i, ht.find (name));
758 637
759 if (i == ht.end ()) 638 if (i == ht.end ())
760 return 0; 639 return 0;
761 else 640 else
762 return i->second; 641 return i->second;
763#endif
764
765 archetype *
766 at;
767 unsigned long
768 index;
769
770 if (name == NULL)
771 return (archetype *) NULL;
772
773 index = hasharch (name, ARCHTABLE);
774 arch_search++;
775 for (;;)
776 {
777 at = arch_table[index];
778 if (at == NULL)
779 {
780 if (warn_archetypes)
781 LOG (llevError, "Couldn't find archetype %s\n", name);
782 return NULL;
783 }
784 arch_cmp++;
785 if (!strcmp ((const char *) at->name, name))
786 return at;
787 if (++index >= ARCHTABLE)
788 index = 0;
789 }
790} 642}
791 643
792/* 644/*
793 * Adds an archetype to the hashtable. 645 * Adds an archetype to the hashtable.
794 */ 646 */
795 647void
796static void 648archetype::hash_add ()
797add_arch (archetype *at)
798{ 649{
799#if USE_UNORDERED_MAP 650 ht.insert (std::make_pair (name, this));
800 ht.insert (std::make_pair ((size_t) (const char *) at->name, at)); 651}
801#endif
802 652
803 int 653void
804 index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index; 654archetype::hash_del ()
805 655{
806 for (;;) 656 ht.erase (name);
807 {
808 if (arch_table[index] == NULL)
809 {
810 arch_table[index] = at;
811 return;
812 }
813
814 if (++index == ARCHTABLE)
815 index = 0;
816
817 if (index == org_index)
818 fatal (ARCHTABLE_TOO_SMALL);
819 }
820} 657}
821 658
822/* 659/*
823 * Returns the first archetype using the given type. 660 * Returns the first archetype using the given type.
824 * Used in treasure-generation. 661 * Used in treasure-generation.
825 */ 662 */
826
827archetype * 663archetype *
828type_to_archetype (int type) 664type_to_archetype (int type)
829{ 665{
830 archetype * 666 archetype *at;
831 at;
832 667
833 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 668 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
834 if (at->clone.type == type) 669 if (at->clone.type == type)
835 return at; 670 return at;
671
836 return NULL; 672 return 0;
837} 673}
838 674
839/* 675/*
840 * Returns a new object copied from the first archetype matching 676 * Returns a new object copied from the first archetype matching
841 * the given type. 677 * the given type.
… …
843 */ 679 */
844 680
845object * 681object *
846clone_arch (int type) 682clone_arch (int type)
847{ 683{
848 archetype * 684 archetype *at;
849 at;
850 object *
851 op = get_object ();
852 685
853 if ((at = type_to_archetype (type)) == NULL) 686 if ((at = type_to_archetype (type)) == NULL)
854 { 687 {
855 LOG (llevError, "Can't clone archetype %d\n", type); 688 LOG (llevError, "Can't clone archetype %d\n", type);
856 free_object (op);
857 return NULL; 689 return 0;
858 } 690 }
859 copy_object (&at->clone, op); 691
692 object *op = at->clone.clone ();
860 op->instantiate (); 693 op->instantiate ();
861 return op; 694 return op;
862} 695}
863 696
864/* 697/*
… …
866 */ 699 */
867 700
868object * 701object *
869object_create_arch (archetype *at) 702object_create_arch (archetype *at)
870{ 703{
871 object * 704 object *op, *prev = 0, *head = 0;
872 op, *
873 prev = NULL, *head = NULL;
874 705
875 while (at) 706 while (at)
876 { 707 {
877 op = arch_to_object (at); 708 op = arch_to_object (at);
878 op->x = at->clone.x; 709 op->x = at->clone.x;
879 op->y = at->clone.y; 710 op->y = at->clone.y;
711
880 if (head) 712 if (head)
881 op->head = head, prev->more = op; 713 op->head = head, prev->more = op;
714
882 if (!head) 715 if (!head)
883 head = op; 716 head = op;
717
884 prev = op; 718 prev = op;
885 at = at->more; 719 at = at->more;
886 } 720 }
721
887 return (head); 722 return (head);
888} 723}
889 724
890/*** end of arch.c ***/

Diff Legend

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