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.49 by root, Mon Apr 16 12:37:08 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
291}
292
293static void
294unlink (archetype *at)
295{
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
310void
311overwrite (archetype *at, object *op)
312{
313 at->clone = *op;
314
315 at->clone.arch = at;
316 at->clone.inv = op->inv; op->inv = 0;
317
318 op->destroy ();
319}
320
321bool
322archetype::load (object_thawer &f)
323{
324 assert (f.kw == KW_object);
325
326 typedef std::pair<archetype *, object *> part;
327 std::vector<part> parts;
328
329 for (;;)
330 {
331 archetype *at = get (f.get_str ());
332 object *op = object::create ();
333
334 if (!op->parse_kv (f))
335 goto fail;
336
337 parts.push_back (std::make_pair (at, op));
338
339 if (f.kw != KW_more)
340 break;
341
342 f.next ();
343 assert (f.kw == KW_object);
344 }
345
346 {
347 archetype *head = parts.front ().first;
348
349 // check that all archetypes belong to the same object or are heads
350 for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)
351 {
352 archetype *at = p->first;
353
354 if (at->head != head && at->head)
355 {
356 LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
357 goto fail;
358 }
359
360 if (at->next && at != head)
361 {
362 LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
363 goto fail;
364 }
365 }
366
367 // sever chain of existing head object
368 for (archetype *more, *at = head; at; at = more)
369 {
370 more = at->more;
371
372 at->head = 0;
373 at->more = 0;
374 }
375
376 // replace/update head
377 overwrite (head, parts.front ().second);
378 head->tail_x = 0;
379 head->tail_y = 0;
380
381 // link into list of heads, if not already there
382 if (!head->next)
383 {
384 head->next = first_archetype;
385 first_archetype = head;
386 }
387
388 // reassemble new chain
389 archetype *prev = head;
390 for (AUTODECL (p, parts.begin () + 1); p != parts.end (); ++p)
391 {
392 archetype *at = p->first;
393 overwrite (at, p->second);
394
395 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
396 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
397
398 at->head = head;
399 at->clone.head = &head->clone;
400 prev->more = at;
401 prev->clone.more = &at->clone;
402
403 prev = at;
404 }
405 }
406
407 return true;
408
409fail:
410 for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)
411 p->second->destroy (true);
412
413 return false;
345} 414}
346 415
347/* 416/*
348 * Reads/parses the archetype-file, and copies into a linked list 417 * Reads/parses the archetype-file, and copies into a linked list
349 * of archetype-structures. 418 * of archetype-structures.
350 */ 419 */
351void 420static bool
352first_arch_pass (object_thawer & fp) 421load_archetypes (object_thawer &f)
353{ 422{
354 archetype *head = 0, *last_more = 0; 423 for (;;)
355
356 archetype *at = new archetype;
357 at->clone.arch = first_archetype = at;
358
359 while (int i = load_object (fp, &at->clone, 0))
360 { 424 {
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
370 switch (i) 425 switch (f.kw)
371 { 426 {
372 case LL_NORMAL: /* A new archetype, just link it with the previous */ 427 case KW_object:
373 if (last_more != NULL) 428 loading_arch = true;
374 last_more->next = at; 429 if (!archetype::load (f))
375 if (head != NULL)
376 head->next = at;
377 head = last_more = at;
378#if 0
379 if (!op->type)
380 LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
381#endif
382 at->tail_x = 0;
383 at->tail_y = 0;
384 break;
385
386 case LL_MORE: /* Another part of the previous archetype, link it correctly */
387
388 at->head = head;
389 at->clone.head = &head->clone;
390 if (last_more != NULL)
391 { 430 {
392 last_more->more = at; 431 loading_arch = false;
393 last_more->clone.more = &at->clone; 432 return false;
394 } 433 }
395 last_more = at;
396 434
397 /* If this multipart image is still composed of individual small 435 loading_arch = false;
398 * images, don't set the tail_.. values. We can't use them anyways, 436 continue;
399 * and setting these to zero makes the map sending to the client much 437
400 * easier as just looking at the head, we know what to do. 438 case KW_EOF:
401 */ 439 return true;
402 if (at->clone.face != head->clone.face) 440
403 { 441 default:
404 head->tail_x = 0; 442 if (!f.parse_error ("archetypes file"))
405 head->tail_y = 0;
406 }
407 else 443 return false;
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 } 444 }
417 445
418 at = new archetype; 446 f.next ();
419
420 at->clone.arch = at;
421 }
422
423 delete at;
424}
425
426/*
427 * Reads the archetype file once more, and links all pointers between
428 * archetypes.
429 */
430
431void
432second_arch_pass (object_thawer & thawer)
433{
434 char buf[MAX_BUF], *variable = buf, *argument, *cp;
435 archetype *at = NULL, *other;
436
437 while (fgets (buf, MAX_BUF, thawer) != NULL)
438 { 447 }
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} 448}
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 449
493/* 450/*
494 * First initialises the archtype hash-table (init_archetable()). 451 * First initialises the archtype hash-table (init_archetable()).
495 * Reads and parses the archetype file (with the first and second-pass 452 * Reads and parses the archetype file (with the first and second-pass
496 * functions). 453 * functions).
497 * Then initialises treasures by calling load_treasures().
498 */ 454 */
499 455bool
500void 456load_archetype_file (const char *filename)
501load_archetypes (void)
502{ 457{
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); 458 object_thawer f (filename);
511 459
512 LOG (llevDebug, " arch-pass 1...\n"); 460 f.next ();
513 first_arch_pass (thawer);
514 LOG (llevDebug, " done\n");
515 }
516 461
517 init_archetable (); 462 // make sure the next - long - step is only done after a tick
463 coroapi::wait_for_tick_begin ();
464
465 if (!load_archetypes (f))
466 return false;
467
518 warn_archetypes = 1; 468 warn_archetypes = 1;
519 469
520 { 470 empty_archetype = archetype::find ("empty_archetype");
521 object_thawer 471 if (!empty_archetype)
522 thawer (filename); 472 return false;
523 473
524 LOG (llevDebug, " loading treasure...\n"); 474 coroapi::cede ();
525 load_treasures (); 475
526 LOG (llevDebug, " done\n"); 476 return true;
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} 477}
536 478
537/* 479/*
538 * Creates and returns a new object which is a copy of the given archetype. 480 * Creates and returns a new object which is a copy of the given archetype.
539 * This function returns NULL on failure. 481 * This function returns NULL on failure.
540 */ 482 */
541object * 483object *
542arch_to_object (archetype *at) 484arch_to_object (archetype *at)
543{ 485{
544 object *op; 486 if (!at)
545
546 if (at == NULL)
547 { 487 {
548 if (warn_archetypes) 488 if (warn_archetypes)
549 LOG (llevError, "Couldn't find archetype.\n"); 489 LOG (llevError, "Couldn't find archetype.\n");
550 490
551 return NULL; 491 return NULL;
552 } 492 }
553 493
554 op = at->clone.clone (); 494 object *op = at->clone.clone ();
555 op->arch = at; 495 op->arch = at;
556 op->instantiate (); 496 op->instantiate ();
557 return op; 497 return op;
558} 498}
559 499
… …
637 return 0; 577 return 0;
638 else 578 else
639 return i->second; 579 return i->second;
640} 580}
641 581
582archetype *
583archetype::get (const char *name)
584{
585 archetype *at = find (name);
586
587 if (!at)
588 {
589 archetypes.push_back (at = new archetype);
590 at->name = name;
591 at->hash_add ();
592 }
593
594 return at;
595}
596
642/* 597/*
643 * Adds an archetype to the hashtable. 598 * Adds an archetype to the hashtable.
644 */ 599 */
645void 600void
646archetype::hash_add () 601archetype::hash_add ()
… …
659 * Used in treasure-generation. 614 * Used in treasure-generation.
660 */ 615 */
661archetype * 616archetype *
662type_to_archetype (int type) 617type_to_archetype (int type)
663{ 618{
664 archetype *at;
665
666 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) 619 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
667 if (at->clone.type == type) 620 if (at->clone.type == type)
668 return at; 621 return at;
669 622
670 return 0; 623 return 0;
671} 624}
… …
673/* 626/*
674 * Returns a new object copied from the first archetype matching 627 * Returns a new object copied from the first archetype matching
675 * the given type. 628 * the given type.
676 * Used in treasure-generation. 629 * Used in treasure-generation.
677 */ 630 */
678
679object * 631object *
680clone_arch (int type) 632clone_arch (int type)
681{ 633{
682 archetype *at; 634 archetype *at;
683 635

Diff Legend

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