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.14 by root, Fri Sep 8 17:14:07 2006 UTC vs.
Revision 1.38 by root, Fri Feb 2 21:50:43 2007 UTC

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

Diff Legend

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