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.42 by root, Fri Feb 9 01:52:10 2007 UTC vs.
Revision 1.59 by root, Mon May 7 06:01:47 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 op->post_load_check ();
357
358 parts.push_back (std::make_pair (at, op));
359
360 if (f.kw != KW_more)
384 break; 361 break;
385 362
386 case LL_MORE: /* Another part of the previous archetype, link it correctly */ 363 f.next ();
387 364
388 at->head = head; 365 if (f.kw != KW_object)
389 at->clone.head = &head->clone; 366 {
390 if (last_more != NULL) 367 f.parse_error ("more object");
391 { 368 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 } 369 }
370 }
417 371
418 at = new archetype; 372 {
373 archetype *head = parts.front ().first;
419 374
420 at->clone.arch = at; 375 // check that all archetypes belong to the same object or are heads
376 for (auto (p, parts.begin ()); p != parts.end (); ++p)
377 {
378 archetype *at = p->first;
379
380 if (at->head != head && at->head)
381 {
382 LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
383 goto fail;
384 }
385
386 if (at->next && at != head)
387 {
388 LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
389 goto fail;
390 }
421 } 391 }
422 392
423 delete at; 393 // sever chain of existing head object
424} 394 for (archetype *more, *at = head; at; at = more)
395 {
396 more = at->more;
425 397
426/* 398 at->head = 0;
427 * Reads the archetype file once more, and links all pointers between 399 at->more = 0;
428 * archetypes. 400 }
429 */
430 401
402 // replace/update head
403 overwrite (head, parts.front ().second);
404 head->tail_x = 0;
405 head->tail_y = 0;
406
407 // link into list of heads, if not already there
408 if (!head->linked)
409 {
410 head->linked = true;
411 head->next = first_archetype;
412 first_archetype = head;
413 }
414
415 // reassemble new chain
416 archetype *prev = head;
417 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
418 {
419 archetype *at = p->first;
420 overwrite (at, p->second);
421
422 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
423 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
424
425 at->head = head;
426 at->clone.head = &head->clone;
427 prev->more = at;
428 prev->clone.more = &at->clone;
429
430 prev = at;
431 }
432
433 loading_arch = false;
434 return head;
435 }
436
437fail:
438 for (auto (p, parts.begin ()); p != parts.end (); ++p)
439 p->second->destroy (true);
440
441 loading_arch = false;
442 return 0;
443}
444
445/*
446 * Initialize global archtype pointers:
447 */
431void 448void
432second_arch_pass (object_thawer & thawer) 449init_archetype_pointers ()
433{ 450{
434 char buf[MAX_BUF], *variable = buf, *argument, *cp; 451 ring_arch = archetype::find ("ring");
435 archetype *at = NULL, *other; 452 amulet_arch = archetype::find ("amulet");
436 453 staff_arch = archetype::find ("staff");
437 while (fgets (buf, MAX_BUF, thawer) != NULL) 454 crown_arch = archetype::find ("crown");
438 { 455 empty_archetype = archetype::find ("empty_archetype");
439 if (*buf == '#')
440 continue;
441
442 if ((argument = strchr (buf, ' ')) != NULL)
443 {
444 *argument = '\0', argument++;
445 cp = argument + strlen (argument) - 1;
446 while (isspace (*cp))
447 {
448 *cp = '\0';
449 cp--;
450 }
451 }
452
453 if (!strcmp ("object", variable))
454 {
455 if ((at = archetype::find (argument)) == NULL)
456 LOG (llevError, "Warning: failed to find arch %s\n", argument);
457 }
458 else if (!strcmp ("other_arch", variable))
459 {
460 if (at != NULL && at->clone.other_arch == NULL)
461 {
462 if ((other = archetype::find (argument)) == NULL)
463 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
464 else if (at != NULL)
465 at->clone.other_arch = other;
466 }
467 }
468 else if (!strcmp ("randomitems", variable))
469 {
470 if (at)
471 {
472 treasurelist *tl = find_treasurelist (argument);
473
474 if (tl == NULL)
475 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
476 else
477 at->clone.randomitems = tl;
478 }
479 }
480 }
481}
482
483#ifdef DEBUG
484void
485check_generators (void)
486{
487 archetype *at;
488
489 for (at = first_archetype; at != NULL; at = at->next)
490 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
491 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
492}
493#endif
494
495/*
496 * First initialises the archtype hash-table (init_archetable()).
497 * Reads and parses the archetype file (with the first and second-pass
498 * functions).
499 * Then initialises treasures by calling load_treasures().
500 */
501
502void
503load_archetypes (void)
504{
505 char filename[MAX_BUF];
506
507 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
508 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
509
510 {
511 object_thawer
512 thawer (filename);
513
514 LOG (llevDebug, " arch-pass 1...\n");
515 first_arch_pass (thawer);
516 LOG (llevDebug, " done\n");
517 }
518
519 init_archetable ();
520 warn_archetypes = 1;
521
522 {
523 object_thawer
524 thawer (filename);
525
526 LOG (llevDebug, " loading treasure...\n");
527 load_treasures ();
528 LOG (llevDebug, " done\n");
529 LOG (llevDebug, " arch-pass 2...\n");
530 second_arch_pass (thawer);
531 LOG (llevDebug, " done\n");
532#ifdef DEBUG
533 check_generators ();
534#endif
535 }
536 LOG (llevDebug, " done\n");
537} 456}
538 457
539/* 458/*
540 * Creates and returns a new object which is a copy of the given archetype. 459 * Creates and returns a new object which is a copy of the given archetype.
541 * This function returns NULL on failure. 460 * This function returns NULL on failure.
542 */ 461 */
543object * 462object *
544arch_to_object (archetype *at) 463arch_to_object (archetype *at)
545{ 464{
546 object *op; 465 if (!at)
547
548 if (at == NULL)
549 { 466 {
550 if (warn_archetypes)
551 LOG (llevError, "Couldn't find archetype.\n"); 467 LOG (llevError, "Couldn't find archetype.\n");
552
553 return NULL; 468 return 0;
554 } 469 }
555 470
556 op = at->clone.clone (); 471 object *op = at->clone.clone ();
557 op->arch = at; 472 op->arch = at;
558 op->instantiate (); 473 op->instantiate ();
474
559 return op; 475 return op;
560} 476}
561 477
562/* 478/*
563 * Creates an object. This function is called by get_archetype() 479 * Creates an object. This function is called by get_archetype()
592 508
593 return arch_to_object (at); 509 return arch_to_object (at);
594} 510}
595 511
596/* 512/*
597 * Hash-function used by the arch-hashtable.
598 */
599
600unsigned long
601hasharch (const char *str, int tablesize)
602{
603 unsigned long hash = 0;
604 unsigned int i = 0;
605 const char *p;
606
607 /* use the one-at-a-time hash function, which supposedly is
608 * better than the djb2-like one used by perl5.005, but
609 * certainly is better then the bug used here before.
610 * see http://burtleburtle.net/bob/hash/doobs.html
611 */
612 for (p = str; i < MAXSTRING && *p; p++, i++)
613 {
614 hash += *p;
615 hash += hash << 10;
616 hash ^= hash >> 6;
617 }
618
619 hash += hash << 3;
620 hash ^= hash >> 11;
621 hash += hash << 15;
622
623 return hash % tablesize;
624}
625
626/*
627 * Finds, using the hashtable, which archetype matches the given name. 513 * Finds, using the hashtable, which archetype matches the given name.
628 * returns a pointer to the found archetype, otherwise NULL. 514 * returns a pointer to the found archetype, otherwise NULL.
629 */ 515 */
630archetype * 516archetype *
631archetype::find (const char *name) 517archetype::find (const char *name)
632{ 518{
633 if (!name) 519 if (!name)
634 return 0; 520 return 0;
635 521
636 AUTODECL (i, ht.find (name)); 522 auto (i, ht.find (name));
637 523
638 if (i == ht.end ()) 524 if (i == ht.end ())
639 return 0; 525 return 0;
640 else 526 else
641 return i->second; 527 return i->second;
642} 528}
643 529
530archetype *
531archetype::get (const char *name)
532{
533 if (!name)
534 {
535 LOG (llevError, "null archetype requested\n");
536 name = "(null)";
537 }
538
539 archetype *at = find (name);
540
541 if (!at)
542 {
543 archetypes.push_back (at = new archetype);
544 at->name = at->clone.name = at->clone.name_pl = name;
545 at->hash_add ();
546 }
547
548 return at;
549}
550
644/* 551/*
645 * Adds an archetype to the hashtable. 552 * Adds an archetype to the hashtable.
646 */ 553 */
647void 554void
648archetype::hash_add () 555archetype::hash_add ()
661 * Used in treasure-generation. 568 * Used in treasure-generation.
662 */ 569 */
663archetype * 570archetype *
664type_to_archetype (int type) 571type_to_archetype (int type)
665{ 572{
666 archetype *at;
667
668 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) 573 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
669 if (at->clone.type == type) 574 if (at->clone.type == type)
670 return at; 575 return at;
671 576
672 return 0; 577 return 0;
673} 578}
675/* 580/*
676 * Returns a new object copied from the first archetype matching 581 * Returns a new object copied from the first archetype matching
677 * the given type. 582 * the given type.
678 * Used in treasure-generation. 583 * Used in treasure-generation.
679 */ 584 */
680
681object * 585object *
682clone_arch (int type) 586clone_arch (int type)
683{ 587{
684 archetype *at; 588 archetype *at;
685 589

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines