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.41 by root, Thu Feb 8 03:09:31 2007 UTC vs.
Revision 1.58 by root, Sat Apr 21 11:55:36 2007 UTC

… …
29#include <loader.h> 29#include <loader.h>
30 30
31#include <tr1/functional> 31#include <tr1/functional>
32#include <tr1/unordered_map> 32#include <tr1/unordered_map>
33 33
34int arch_init; /* True if doing arch initialization */
35
36/* The naming of these functions is really poor - they are all 34/* The naming of these functions is really poor - they are all
37 * pretty much named '.._arch_...', but they may more may not 35 * pretty much named '.._arch_...', but they may more may not
38 * return archetypes. Some make the arch_to_object call, and thus 36 * return archetypes. Some make the arch_to_object call, and thus
39 * return an object. Perhaps those should be called 'archob' functions 37 * return an object. Perhaps those should be called 'archob' functions
40 * to denote they return an object derived from the archetype. 38 * to denote they return an object derived from the archetype.
41 * MSW 2003-04-29 39 * MSW 2003-04-29
42 */ 40 */
41
42bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
43 43
44// the hashtable 44// the hashtable
45typedef std::tr1::unordered_map 45typedef std::tr1::unordered_map
46 < 46 <
47 const char *, 47 const char *,
… …
50 str_equal, 50 str_equal,
51 slice_allocator< std::pair<const char *const, arch_ptr> > 51 slice_allocator< std::pair<const char *const, arch_ptr> >
52 > HT; 52 > HT;
53 53
54static HT ht (5000); 54static HT ht (5000);
55static std::vector<archetype *> archetypes;
55 56
56/** 57/**
57 * GROS - This function retrieves an archetype given the name that appears 58 * GROS - This function retrieves an archetype given the name that appears
58 * during the game (for example, "writing pen" instead of "stylus"). 59 * during the game (for example, "writing pen" instead of "stylus").
59 * It does not use the hashtable system, but browse the whole archlist each time. 60 * It does not use the hashtable system, but browse the whole archlist each time.
… …
274 } 275 }
275 276
276 return 0; 277 return 0;
277} 278}
278 279
279/*
280 * Initialises the internal linked list of archetypes (read from file).
281 * Then the global "empty_archetype" pointer is initialised.
282 * Then the blocksview[] array is initialised.
283 */
284
285void
286init_archetypes (void)
287{ /* called from add_player() and edit() */
288 if (first_archetype != NULL) /* Only do this once */
289 return;
290
291 arch_init = 1;
292 load_archetypes ();
293 arch_init = 0;
294 empty_archetype = archetype::find ("empty_archetype");
295
296/* init_blocksview();*/
297}
298
299/*
300 * An alternative way to init the hashtable which is slower, but _works_...
301 */
302void
303init_archetable (void)
304{
305 archetype *at;
306
307 LOG (llevDebug, " Setting up archetable...\n");
308
309 for (at = first_archetype; at; at = at->more ? at->more : at->next)
310 at->hash_add ();
311
312 LOG (llevDebug, "done\n");
313}
314
315void
316free_all_archs (void)
317{
318 archetype *at, *next;
319 int i = 0, f = 0;
320
321 for (at = first_archetype; at; at = next)
322 {
323 if (at->more)
324 next = at->more;
325 else
326 next = at->next;
327
328 delete
329 at;
330
331 i++;
332 }
333
334 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
335}
336
337archetype::archetype () 280archetype::archetype ()
338{ 281{
282 clone.arch = this;
283
339 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ 284 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
340 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ 285 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
341} 286}
342 287
343archetype::~archetype () 288archetype::~archetype ()
344{ 289{
290 //TODO: nuke ->more's
345} 291}
346 292
347/* 293static void
348 * Reads/parses the archetype-file, and copies into a linked list 294unlink (archetype *at)
349 * of archetype-structures. 295{
350 */ 296 if (at->head)
297 at = at->head;
298
299 // destroy this archetype's link, making singletons out of its parts
300 while (at)
301 {
302 archetype *more = at->more;
303 at->clone.destroy_inv ();
304 at->head = at->more = 0;
305 at = more;
306 }
307}
308
309// dire hack, need to rationalise
351void 310void
352first_arch_pass (object_thawer & fp) 311overwrite (archetype *at, object *op)
353{ 312{
354 archetype *head = 0, *last_more = 0; 313 at->clone = *op;
314 at->clone.arch = at;
355 315
356 archetype *at = new archetype; 316 at->clone.inv = op->inv; op->inv = 0;
357 at->clone.arch = first_archetype = at;
358 317
359 while (int i = load_object (fp, &at->clone, 0)) 318 op->destroy ();
360 { 319}
361 at->clone.speed_left = (float) (-0.1);
362 /* copy the body_info to the body_used - this is only really
363 * need for monsters, but doesn't hurt to do it for everything.
364 * by doing so, when a monster is created, it has good starting
365 * values for the body_used info, so when items are created
366 * for it, they can be properly equipped.
367 */
368 memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
369 320
370 switch (i) 321archetype *
322archetype::read (object_thawer &f)
323{
324 assert (f.kw == KW_object);
325
326 loading_arch = true; // hack to tell parse_kv et al. to behave
327
328 typedef std::pair<archetype *, object *> part;
329 std::vector<part> parts;
330
331 coroapi::cede_to_tick_every (100);
332
333 for (;;)
334 {
335 object *op = object::create ();
336 archetype *at = get (f.get_str ());
337 f.get (op->name);
338 f.next ();
339
340#if 0
341 if (f.kw == KW_inherit)
371 { 342 {
372 case LL_NORMAL: /* A new archetype, just link it with the previous */ 343 if (archetype *at = find (f.get_str ()))
373 if (last_more != NULL) 344 *op = at->clone;
374 last_more->next = at; 345 else
375 if (head != NULL) 346 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
376 head->next = at; 347 &at->name, f.get_str ());
377 head = last_more = at; 348
378#if 0 349 f.next ();
379 if (!op->type) 350 }
380 LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
381#endif 351#endif
382 at->tail_x = 0; 352
383 at->tail_y = 0; 353 if (!op->parse_kv (f))
354 goto fail;
355
356 parts.push_back (std::make_pair (at, op));
357
358 if (f.kw != KW_more)
384 break; 359 break;
385 360
386 case LL_MORE: /* Another part of the previous archetype, link it correctly */ 361 f.next ();
387 362
388 at->head = head; 363 if (f.kw != KW_object)
389 at->clone.head = &head->clone; 364 {
390 if (last_more != NULL) 365 f.parse_error ("more object");
391 { 366 goto fail;
392 last_more->more = at;
393 last_more->clone.more = &at->clone;
394 }
395 last_more = at;
396
397 /* If this multipart image is still composed of individual small
398 * images, don't set the tail_.. values. We can't use them anyways,
399 * and setting these to zero makes the map sending to the client much
400 * easier as just looking at the head, we know what to do.
401 */
402 if (at->clone.face != head->clone.face)
403 {
404 head->tail_x = 0;
405 head->tail_y = 0;
406 }
407 else
408 {
409 if (at->clone.x > head->tail_x)
410 head->tail_x = at->clone.x;
411 if (at->clone.y > head->tail_y)
412 head->tail_y = at->clone.y;
413 }
414 break;
415
416 } 367 }
368 }
417 369
418 at = new archetype; 370 {
371 archetype *head = parts.front ().first;
419 372
420 at->clone.arch = at; 373 // check that all archetypes belong to the same object or are heads
374 for (auto (p, parts.begin ()); p != parts.end (); ++p)
375 {
376 archetype *at = p->first;
377
378 if (at->head != head && at->head)
379 {
380 LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
381 goto fail;
382 }
383
384 if (at->next && at != head)
385 {
386 LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
387 goto fail;
388 }
421 } 389 }
422 390
423 delete at; 391 // sever chain of existing head object
424} 392 for (archetype *more, *at = head; at; at = more)
393 {
394 more = at->more;
425 395
426/* 396 at->head = 0;
427 * Reads the archetype file once more, and links all pointers between 397 at->more = 0;
428 * archetypes. 398 }
429 */
430 399
400 // replace/update head
401 overwrite (head, parts.front ().second);
402 head->tail_x = 0;
403 head->tail_y = 0;
404
405 // link into list of heads, if not already there
406 if (!head->linked)
407 {
408 head->linked = true;
409 head->next = first_archetype;
410 first_archetype = head;
411 }
412
413 // reassemble new chain
414 archetype *prev = head;
415 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
416 {
417 archetype *at = p->first;
418 overwrite (at, p->second);
419
420 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
421 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
422
423 at->head = head;
424 at->clone.head = &head->clone;
425 prev->more = at;
426 prev->clone.more = &at->clone;
427
428 prev = at;
429 }
430
431 loading_arch = false;
432 return head;
433 }
434
435fail:
436 for (auto (p, parts.begin ()); p != parts.end (); ++p)
437 p->second->destroy (true);
438
439 loading_arch = false;
440 return 0;
441}
442
443/*
444 * Initialize global archtype pointers:
445 */
431void 446void
432second_arch_pass (object_thawer & thawer) 447init_archetype_pointers ()
433{ 448{
434 char buf[MAX_BUF], *variable = buf, *argument, *cp; 449 ring_arch = archetype::find ("ring");
435 archetype *at = NULL, *other; 450 amulet_arch = archetype::find ("amulet");
436 451 staff_arch = archetype::find ("staff");
437 while (fgets (buf, MAX_BUF, thawer) != NULL) 452 crown_arch = archetype::find ("crown");
438 { 453 empty_archetype = archetype::find ("empty_archetype");
439 if (*buf == '#')
440 continue;
441 if ((argument = strchr (buf, ' ')) != NULL)
442 {
443 *argument = '\0', argument++;
444 cp = argument + strlen (argument) - 1;
445 while (isspace (*cp))
446 {
447 *cp = '\0';
448 cp--;
449 }
450 }
451 if (!strcmp ("object", variable))
452 {
453 if ((at = archetype::find (argument)) == NULL)
454 LOG (llevError, "Warning: failed to find arch %s\n", argument);
455 }
456 else if (!strcmp ("other_arch", variable))
457 {
458 if (at != NULL && at->clone.other_arch == NULL)
459 {
460 if ((other = archetype::find (argument)) == NULL)
461 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
462 else if (at != NULL)
463 at->clone.other_arch = other;
464 }
465 }
466 else if (!strcmp ("randomitems", variable))
467 {
468 if (at != NULL)
469 {
470 treasurelist *tl = find_treasurelist (argument);
471
472 if (tl == NULL)
473 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
474 else
475 at->clone.randomitems = tl;
476 }
477 }
478 }
479}
480
481#ifdef DEBUG
482void
483check_generators (void)
484{
485 archetype *at;
486
487 for (at = first_archetype; at != NULL; at = at->next)
488 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
489 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
490}
491#endif
492
493/*
494 * First initialises the archtype hash-table (init_archetable()).
495 * Reads and parses the archetype file (with the first and second-pass
496 * functions).
497 * Then initialises treasures by calling load_treasures().
498 */
499
500void
501load_archetypes (void)
502{
503 char filename[MAX_BUF];
504
505 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
506 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
507
508 {
509 object_thawer
510 thawer (filename);
511
512 LOG (llevDebug, " arch-pass 1...\n");
513 first_arch_pass (thawer);
514 LOG (llevDebug, " done\n");
515 }
516
517 init_archetable ();
518 warn_archetypes = 1;
519
520 {
521 object_thawer
522 thawer (filename);
523
524 LOG (llevDebug, " loading treasure...\n");
525 load_treasures ();
526 LOG (llevDebug, " done\n");
527 LOG (llevDebug, " arch-pass 2...\n");
528 second_arch_pass (thawer);
529 LOG (llevDebug, " done\n");
530#ifdef DEBUG
531 check_generators ();
532#endif
533 }
534 LOG (llevDebug, " done\n");
535} 454}
536 455
537/* 456/*
538 * Creates and returns a new object which is a copy of the given archetype. 457 * Creates and returns a new object which is a copy of the given archetype.
539 * This function returns NULL on failure. 458 * This function returns NULL on failure.
540 */ 459 */
541object * 460object *
542arch_to_object (archetype *at) 461arch_to_object (archetype *at)
543{ 462{
544 object *op; 463 if (!at)
545
546 if (at == NULL)
547 { 464 {
548 if (warn_archetypes)
549 LOG (llevError, "Couldn't find archetype.\n"); 465 LOG (llevError, "Couldn't find archetype.\n");
550
551 return NULL; 466 return 0;
552 } 467 }
553 468
554 op = at->clone.clone (); 469 object *op = at->clone.clone ();
555 op->arch = at; 470 op->arch = at;
556 op->instantiate (); 471 op->instantiate ();
472
557 return op; 473 return op;
558} 474}
559 475
560/* 476/*
561 * Creates an object. This function is called by get_archetype() 477 * Creates an object. This function is called by get_archetype()
… …
590 506
591 return arch_to_object (at); 507 return arch_to_object (at);
592} 508}
593 509
594/* 510/*
595 * Hash-function used by the arch-hashtable.
596 */
597
598unsigned long
599hasharch (const char *str, int tablesize)
600{
601 unsigned long hash = 0;
602 unsigned int i = 0;
603 const char *p;
604
605 /* use the one-at-a-time hash function, which supposedly is
606 * better than the djb2-like one used by perl5.005, but
607 * certainly is better then the bug used here before.
608 * see http://burtleburtle.net/bob/hash/doobs.html
609 */
610 for (p = str; i < MAXSTRING && *p; p++, i++)
611 {
612 hash += *p;
613 hash += hash << 10;
614 hash ^= hash >> 6;
615 }
616
617 hash += hash << 3;
618 hash ^= hash >> 11;
619 hash += hash << 15;
620
621 return hash % tablesize;
622}
623
624/*
625 * Finds, using the hashtable, which archetype matches the given name. 511 * Finds, using the hashtable, which archetype matches the given name.
626 * returns a pointer to the found archetype, otherwise NULL. 512 * returns a pointer to the found archetype, otherwise NULL.
627 */ 513 */
628archetype * 514archetype *
629archetype::find (const char *name) 515archetype::find (const char *name)
630{ 516{
631 if (!name) 517 if (!name)
632 return 0; 518 return 0;
633 519
634 AUTODECL (i, ht.find (name)); 520 auto (i, ht.find (name));
635 521
636 if (i == ht.end ()) 522 if (i == ht.end ())
637 return 0; 523 return 0;
638 else 524 else
639 return i->second; 525 return i->second;
640} 526}
641 527
528archetype *
529archetype::get (const char *name)
530{
531 if (!name)
532 {
533 LOG (llevError, "null archetype requested\n");
534 name = "(null)";
535 }
536
537 archetype *at = find (name);
538
539 if (!at)
540 {
541 archetypes.push_back (at = new archetype);
542 at->name = at->clone.name = at->clone.name_pl = name;
543 at->hash_add ();
544 }
545
546 return at;
547}
548
642/* 549/*
643 * Adds an archetype to the hashtable. 550 * Adds an archetype to the hashtable.
644 */ 551 */
645void 552void
646archetype::hash_add () 553archetype::hash_add ()
… …
659 * Used in treasure-generation. 566 * Used in treasure-generation.
660 */ 567 */
661archetype * 568archetype *
662type_to_archetype (int type) 569type_to_archetype (int type)
663{ 570{
664 archetype *at;
665
666 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) 571 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
667 if (at->clone.type == type) 572 if (at->clone.type == type)
668 return at; 573 return at;
669 574
670 return 0; 575 return 0;
671} 576}
… …
673/* 578/*
674 * Returns a new object copied from the first archetype matching 579 * Returns a new object copied from the first archetype matching
675 * the given type. 580 * the given type.
676 * Used in treasure-generation. 581 * Used in treasure-generation.
677 */ 582 */
678
679object * 583object *
680clone_arch (int type) 584clone_arch (int type)
681{ 585{
682 archetype *at; 586 archetype *at;
683 587

Diff Legend

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