… | |
… | |
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 | |
34 | int 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 | |
|
|
42 | bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing |
43 | |
43 | |
44 | // the hashtable |
44 | // the hashtable |
45 | typedef std::tr1::unordered_map |
45 | typedef 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 | |
54 | static HT ht (5000); |
54 | static HT ht (5000); |
|
|
55 | static 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 | |
|
|
285 | void |
280 | void |
286 | init_archetypes (void) |
281 | init_archetypes (void) |
287 | { /* called from add_player() and edit() */ |
282 | { |
288 | if (first_archetype != NULL) /* Only do this once */ |
|
|
289 | return; |
|
|
290 | |
|
|
291 | arch_init = 1; |
|
|
292 | load_archetypes (); |
283 | load_archetypes (); |
293 | arch_init = 0; |
284 | |
294 | empty_archetype = archetype::find ("empty_archetype"); |
285 | 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 | */ |
|
|
302 | void |
|
|
303 | init_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 | |
|
|
315 | void |
|
|
316 | free_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 | } |
286 | } |
336 | |
287 | |
337 | archetype::archetype () |
288 | archetype::archetype () |
338 | { |
289 | { |
|
|
290 | clone.arch = this; |
|
|
291 | |
339 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
292 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
340 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
293 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
341 | } |
294 | } |
342 | |
295 | |
343 | archetype::~archetype () |
296 | archetype::~archetype () |
344 | { |
297 | { |
|
|
298 | //TODO: nuke ->more's |
|
|
299 | } |
|
|
300 | |
|
|
301 | static void |
|
|
302 | unlink (archetype *at) |
|
|
303 | { |
|
|
304 | if (at->head) |
|
|
305 | at = at->head; |
|
|
306 | |
|
|
307 | // destroy this archetype's link, making singletons out of its parts |
|
|
308 | while (at) |
|
|
309 | { |
|
|
310 | archetype *more = at->more; |
|
|
311 | at->clone.destroy_inv (); |
|
|
312 | at->head = at->more = 0; |
|
|
313 | at = more; |
|
|
314 | } |
|
|
315 | } |
|
|
316 | |
|
|
317 | // dire hack, need to rationalise |
|
|
318 | void |
|
|
319 | overwrite (archetype *at, object *op) |
|
|
320 | { |
|
|
321 | at->clone = *op; |
|
|
322 | |
|
|
323 | at->clone.arch = at; |
|
|
324 | //TODO: inv et al. |
|
|
325 | } |
|
|
326 | |
|
|
327 | archetype * |
|
|
328 | archetype::read (object_thawer &f) |
|
|
329 | { |
|
|
330 | assert (f.kw == KW_object); |
|
|
331 | |
|
|
332 | archetype *head = get (f.get_str ()); |
|
|
333 | unlink (head); |
|
|
334 | object *op = object::create (); |
|
|
335 | |
|
|
336 | if (!op->parse_kv (f)) |
|
|
337 | { |
|
|
338 | op->destroy (true); |
|
|
339 | // leak head |
|
|
340 | return 0; |
|
|
341 | } |
|
|
342 | |
|
|
343 | overwrite (head, op); |
|
|
344 | op->destroy (); |
|
|
345 | |
|
|
346 | for (archetype *prev = head; f.kw == KW_more; ) |
|
|
347 | { |
|
|
348 | f.next (); |
|
|
349 | assert (f.kw == KW_object); |
|
|
350 | |
|
|
351 | archetype *more = get (f.get_str ()); |
|
|
352 | unlink (more); |
|
|
353 | object *op = object::create (); |
|
|
354 | |
|
|
355 | if (!op->parse_kv (f)) |
|
|
356 | { |
|
|
357 | op->destroy (true); |
|
|
358 | // leak head more* |
|
|
359 | return 0; |
|
|
360 | } |
|
|
361 | |
|
|
362 | overwrite (more, op); |
|
|
363 | op->destroy (); |
|
|
364 | |
|
|
365 | if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; |
|
|
366 | if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; |
|
|
367 | |
|
|
368 | more->head = head; |
|
|
369 | more->clone.head = &head->clone; |
|
|
370 | prev->more = more; |
|
|
371 | prev->clone.more = &more->clone; |
|
|
372 | |
|
|
373 | prev = more; |
|
|
374 | } |
|
|
375 | |
|
|
376 | if (!head->next) |
|
|
377 | { |
|
|
378 | head->next = first_archetype; |
|
|
379 | first_archetype = head; |
|
|
380 | } |
|
|
381 | |
|
|
382 | return head; |
345 | } |
383 | } |
346 | |
384 | |
347 | /* |
385 | /* |
348 | * Reads/parses the archetype-file, and copies into a linked list |
386 | * Reads/parses the archetype-file, and copies into a linked list |
349 | * of archetype-structures. |
387 | * of archetype-structures. |
350 | */ |
388 | */ |
351 | void |
389 | static bool |
352 | first_arch_pass (object_thawer & fp) |
390 | load_archetypes (object_thawer &f) |
353 | { |
391 | { |
354 | archetype *head = 0, *last_more = 0; |
392 | 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 | { |
393 | { |
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) |
394 | switch (f.kw) |
371 | { |
395 | { |
372 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
396 | case KW_object: |
373 | if (last_more != NULL) |
397 | loading_arch = true; |
374 | last_more->next = at; |
398 | if (!archetype::read (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 | { |
399 | { |
392 | last_more->more = at; |
400 | loading_arch = false; |
393 | last_more->clone.more = &at->clone; |
401 | return false; |
394 | } |
402 | } |
395 | last_more = at; |
|
|
396 | |
403 | |
397 | /* If this multipart image is still composed of individual small |
404 | loading_arch = false; |
398 | * images, don't set the tail_.. values. We can't use them anyways, |
405 | continue; |
399 | * and setting these to zero makes the map sending to the client much |
406 | |
400 | * easier as just looking at the head, we know what to do. |
407 | case KW_EOF: |
401 | */ |
408 | return true; |
402 | if (at->clone.face != head->clone.face) |
409 | |
403 | { |
410 | default: |
404 | head->tail_x = 0; |
411 | if (!f.parse_error ("archetypes file")) |
405 | head->tail_y = 0; |
|
|
406 | } |
|
|
407 | else |
412 | 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 | } |
413 | } |
417 | |
414 | |
418 | at = new archetype; |
415 | 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 | |
|
|
431 | void |
|
|
432 | second_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 | { |
416 | } |
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 | } |
417 | } |
482 | |
|
|
483 | #ifdef DEBUG |
|
|
484 | void |
|
|
485 | check_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 | |
418 | |
495 | /* |
419 | /* |
496 | * First initialises the archtype hash-table (init_archetable()). |
420 | * First initialises the archtype hash-table (init_archetable()). |
497 | * Reads and parses the archetype file (with the first and second-pass |
421 | * Reads and parses the archetype file (with the first and second-pass |
498 | * functions). |
422 | * functions). |
499 | * Then initialises treasures by calling load_treasures(). |
|
|
500 | */ |
423 | */ |
501 | |
|
|
502 | void |
424 | void |
503 | load_archetypes (void) |
425 | load_archetypes (void) |
504 | { |
426 | { |
505 | char filename[MAX_BUF]; |
427 | char filename[MAX_BUF]; |
506 | |
428 | |
507 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
429 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
508 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
430 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
509 | |
431 | |
510 | { |
|
|
511 | object_thawer |
|
|
512 | thawer (filename); |
432 | object_thawer f (filename); |
513 | |
433 | |
514 | LOG (llevDebug, " arch-pass 1...\n"); |
434 | f.next (); |
515 | first_arch_pass (thawer); |
|
|
516 | LOG (llevDebug, " done\n"); |
|
|
517 | } |
|
|
518 | |
435 | |
519 | init_archetable (); |
436 | if (!load_archetypes (f)) |
|
|
437 | cleanup ("unable to load archetypes"); |
|
|
438 | |
520 | warn_archetypes = 1; |
439 | warn_archetypes = 1; |
521 | |
440 | |
522 | { |
|
|
523 | object_thawer |
|
|
524 | thawer (filename); |
|
|
525 | |
|
|
526 | LOG (llevDebug, " loading treasure...\n"); |
|
|
527 | load_treasures (); |
441 | 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 | } |
442 | } |
538 | |
443 | |
539 | /* |
444 | /* |
540 | * Creates and returns a new object which is a copy of the given archetype. |
445 | * Creates and returns a new object which is a copy of the given archetype. |
541 | * This function returns NULL on failure. |
446 | * This function returns NULL on failure. |
542 | */ |
447 | */ |
543 | object * |
448 | object * |
544 | arch_to_object (archetype *at) |
449 | arch_to_object (archetype *at) |
545 | { |
450 | { |
546 | object *op; |
451 | if (!at) |
547 | |
|
|
548 | if (at == NULL) |
|
|
549 | { |
452 | { |
550 | if (warn_archetypes) |
453 | if (warn_archetypes) |
551 | LOG (llevError, "Couldn't find archetype.\n"); |
454 | LOG (llevError, "Couldn't find archetype.\n"); |
552 | |
455 | |
553 | return NULL; |
456 | return NULL; |
554 | } |
457 | } |
555 | |
458 | |
556 | op = at->clone.clone (); |
459 | object *op = at->clone.clone (); |
557 | op->arch = at; |
460 | op->arch = at; |
558 | op->instantiate (); |
461 | op->instantiate (); |
559 | return op; |
462 | return op; |
560 | } |
463 | } |
561 | |
464 | |
… | |
… | |
639 | return 0; |
542 | return 0; |
640 | else |
543 | else |
641 | return i->second; |
544 | return i->second; |
642 | } |
545 | } |
643 | |
546 | |
|
|
547 | archetype * |
|
|
548 | archetype::get (const char *name) |
|
|
549 | { |
|
|
550 | archetype *at = find (name); |
|
|
551 | |
|
|
552 | if (!at) |
|
|
553 | { |
|
|
554 | archetypes.push_back (at = new archetype); |
|
|
555 | at->name = name; |
|
|
556 | at->hash_add (); |
|
|
557 | } |
|
|
558 | |
|
|
559 | return at; |
|
|
560 | } |
|
|
561 | |
644 | /* |
562 | /* |
645 | * Adds an archetype to the hashtable. |
563 | * Adds an archetype to the hashtable. |
646 | */ |
564 | */ |
647 | void |
565 | void |
648 | archetype::hash_add () |
566 | archetype::hash_add () |
… | |
… | |
661 | * Used in treasure-generation. |
579 | * Used in treasure-generation. |
662 | */ |
580 | */ |
663 | archetype * |
581 | archetype * |
664 | type_to_archetype (int type) |
582 | type_to_archetype (int type) |
665 | { |
583 | { |
666 | archetype *at; |
|
|
667 | |
|
|
668 | for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
584 | for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
669 | if (at->clone.type == type) |
585 | if (at->clone.type == type) |
670 | return at; |
586 | return at; |
671 | |
587 | |
672 | return 0; |
588 | return 0; |
673 | } |
589 | } |
… | |
… | |
675 | /* |
591 | /* |
676 | * Returns a new object copied from the first archetype matching |
592 | * Returns a new object copied from the first archetype matching |
677 | * the given type. |
593 | * the given type. |
678 | * Used in treasure-generation. |
594 | * Used in treasure-generation. |
679 | */ |
595 | */ |
680 | |
|
|
681 | object * |
596 | object * |
682 | clone_arch (int type) |
597 | clone_arch (int type) |
683 | { |
598 | { |
684 | archetype *at; |
599 | archetype *at; |
685 | |
600 | |