1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | 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 |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | 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 |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
|
|
25 | #include <funcpoint.h> |
|
|
26 | |
|
|
27 | #include <loader.h> |
|
|
28 | #include <unistd.h> |
25 | #include <unistd.h> |
|
|
26 | |
|
|
27 | #include "global.h" |
|
|
28 | #include "funcpoint.h" |
|
|
29 | |
|
|
30 | #include "loader.h" |
29 | |
31 | |
30 | #include "path.h" |
32 | #include "path.h" |
31 | |
33 | |
32 | /* |
34 | /* |
33 | * This makes a path absolute outside the world of Crossfire. |
35 | * This makes a path absolute outside the world of Crossfire. |
… | |
… | |
66 | char *endbuf; |
68 | char *endbuf; |
67 | struct stat statbuf; |
69 | struct stat statbuf; |
68 | int mode = 0; |
70 | int mode = 0; |
69 | |
71 | |
70 | if (prepend_dir) |
72 | if (prepend_dir) |
71 | strcpy (buf, create_pathname (name)); |
73 | assign (buf, create_pathname (name)); |
72 | else |
74 | else |
73 | strcpy (buf, name); |
75 | assign (buf, name); |
74 | |
76 | |
75 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
77 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
76 | * this method should be equivalant and is clearer. |
78 | * this method should be equivalant and is clearer. |
77 | * Can not use strcat because we need to cycle through |
79 | * Can not use strcat because we need to cycle through |
78 | * all the names. |
80 | * all the names. |
… | |
… | |
227 | |
229 | |
228 | } |
230 | } |
229 | return 0; |
231 | return 0; |
230 | } |
232 | } |
231 | |
233 | |
232 | |
|
|
233 | /* |
234 | /* |
234 | * Returns true if the given object can't fit in the given spot. |
235 | * Returns true if the given object can't fit in the given spot. |
235 | * This is meant for multi space objects - for single space objecs, |
236 | * This is meant for multi space objects - for single space objecs, |
236 | * just calling get_map_blocked and checking that against movement type |
237 | * just calling get_map_blocked and checking that against movement type |
237 | * of object. This function goes through all the parts of the |
238 | * of object. This function goes through all the parts of the |
… | |
… | |
353 | { |
354 | { |
354 | if (!spaces) |
355 | if (!spaces) |
355 | return; |
356 | return; |
356 | |
357 | |
357 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
358 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
358 | for (object *tmp = ms->bot; tmp; ) |
359 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
359 | { |
360 | { |
360 | object *above = tmp->above; |
|
|
361 | |
|
|
362 | /* already multipart - don't do anything more */ |
361 | /* already multipart - don't do anything more */ |
363 | if (!tmp->head && !tmp->more) |
362 | if (!tmp->head && !tmp->more) |
364 | { |
363 | { |
365 | /* If there is nothing more to this object, this for loop |
364 | /* If there is nothing more to this object, this for loop |
366 | * won't do anything. |
365 | * won't do anything. |
… | |
… | |
388 | * the coding is simpler to just to it here with each part. |
387 | * the coding is simpler to just to it here with each part. |
389 | */ |
388 | */ |
390 | insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); |
389 | insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); |
391 | } |
390 | } |
392 | } |
391 | } |
393 | |
|
|
394 | tmp = above; |
|
|
395 | } |
392 | } |
396 | } |
393 | } |
397 | |
394 | |
398 | /* |
395 | /* |
399 | * Loads (ands parses) the objects into a given map from the specified |
396 | * Loads (ands parses) the objects into a given map from the specified |
400 | * file pointer. |
397 | * file pointer. |
401 | * mapflags is the same as we get with load_original_map |
|
|
402 | */ |
398 | */ |
403 | bool |
399 | bool |
404 | maptile::load_objects (object_thawer &thawer) |
400 | maptile::_load_objects (object_thawer &f) |
405 | { |
401 | { |
406 | int unique; |
402 | for (;;) |
407 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
|
|
408 | |
|
|
409 | op = object::create (); |
|
|
410 | op->map = this; /* To handle buttons correctly */ |
|
|
411 | |
|
|
412 | while (int i = load_object (thawer, op, 0)) |
|
|
413 | { |
403 | { |
414 | /* if the archetype for the object is null, means that we |
404 | coroapi::cede_every (1000); // cede once in a while |
415 | * got an invalid object. Don't do anything with it - the game |
405 | |
416 | * or editor will not be able to do anything with it either. |
406 | switch (f.kw) |
417 | */ |
|
|
418 | if (op->arch == NULL) |
|
|
419 | { |
407 | { |
420 | LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); |
408 | case KW_arch: |
421 | continue; |
409 | if (object *op = object::read (f, this)) |
422 | } |
|
|
423 | |
|
|
424 | switch (i) |
|
|
425 | { |
410 | { |
426 | case LL_NORMAL: |
411 | if (op->inv) |
|
|
412 | sum_weight (op); |
|
|
413 | |
427 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
414 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
|
|
415 | } |
428 | |
416 | |
429 | if (op->inv) |
417 | continue; |
430 | sum_weight (op); |
|
|
431 | |
418 | |
432 | prev = op, last_more = op; |
|
|
433 | break; |
|
|
434 | |
|
|
435 | case LL_MORE: |
419 | case KW_EOF: |
436 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); |
420 | return true; |
437 | op->head = prev, last_more->more = op, last_more = op; |
421 | |
|
|
422 | default: |
|
|
423 | if (!f.parse_error ("map file")) |
|
|
424 | return false; |
438 | break; |
425 | break; |
439 | } |
426 | } |
440 | |
427 | |
441 | op = object::create (); |
428 | f.next (); |
442 | op->map = this; |
|
|
443 | } |
|
|
444 | |
|
|
445 | op->destroy (); |
|
|
446 | |
|
|
447 | #if 0 |
|
|
448 | for (i = 0; i < width; i++) |
|
|
449 | for (j = 0; j < height; j++) |
|
|
450 | { |
|
|
451 | unique = 0; |
|
|
452 | /* check for unique items, or unique squares */ |
|
|
453 | for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above) |
|
|
454 | { |
|
|
455 | if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) |
|
|
456 | unique = 1; |
|
|
457 | |
|
|
458 | if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) |
|
|
459 | SET_FLAG (otmp, FLAG_OBJ_ORIGINAL); |
|
|
460 | } |
|
|
461 | } |
429 | } |
462 | #endif |
|
|
463 | |
430 | |
464 | return true; |
431 | return true; |
465 | } |
432 | } |
466 | |
433 | |
467 | void |
434 | void |
… | |
… | |
485 | for (object *op = ms->bot; op; op = op->above) |
452 | for (object *op = ms->bot; op; op = op->above) |
486 | op->deactivate_recursive (); |
453 | op->deactivate_recursive (); |
487 | } |
454 | } |
488 | |
455 | |
489 | bool |
456 | bool |
490 | maptile::save_objects (object_freezer &freezer, int flags) |
457 | maptile::_save_objects (object_freezer &f, int flags) |
491 | { |
458 | { |
|
|
459 | static int cede_count = 0; |
|
|
460 | |
492 | if (flags & IO_HEADER) |
461 | if (flags & IO_HEADER) |
493 | save_header (freezer); |
462 | _save_header (f); |
494 | |
463 | |
495 | if (!spaces) |
464 | if (!spaces) |
496 | return false; |
465 | return false; |
497 | |
466 | |
498 | for (int i = 0; i < size (); ++i) |
467 | for (int i = 0; i < size (); ++i) |
499 | { |
468 | { |
|
|
469 | if (cede_count >= 500) |
|
|
470 | { |
|
|
471 | cede_count = 0; |
|
|
472 | coroapi::cede (); |
|
|
473 | } |
|
|
474 | |
500 | int unique = 0; |
475 | int unique = 0; |
501 | for (object *op = spaces [i].bot; op; op = op->above) |
476 | for (object *op = spaces [i].bot; op; op = op->above) |
502 | { |
477 | { |
|
|
478 | // count per-object, but cede only when modification-safe |
|
|
479 | cede_count++; |
|
|
480 | |
503 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
481 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
504 | unique = 1; |
482 | unique = 1; |
505 | |
483 | |
506 | if (!op->can_map_save ()) |
484 | if (!op->can_map_save ()) |
507 | continue; |
485 | continue; |
508 | |
486 | |
509 | if (unique || op->flag [FLAG_UNIQUE]) |
487 | if (unique || op->flag [FLAG_UNIQUE]) |
510 | { |
488 | { |
511 | if (flags & IO_UNIQUES) |
489 | if (flags & IO_UNIQUES) |
512 | save_object (freezer, op, 1); |
490 | op->write (f); |
513 | } |
491 | } |
514 | else if (flags & IO_OBJECTS) |
492 | else if (flags & IO_OBJECTS) |
515 | save_object (freezer, op, 1); |
493 | op->write (f); |
516 | } |
494 | } |
517 | } |
495 | } |
518 | |
496 | |
519 | return true; |
497 | return true; |
520 | } |
498 | } |
521 | |
499 | |
522 | bool |
500 | bool |
523 | maptile::load_objects (const char *path, bool skip_header) |
501 | maptile::_load_objects (const char *path, bool skip_header) |
524 | { |
502 | { |
525 | object_thawer thawer (path); |
503 | object_thawer f (path); |
526 | |
504 | |
527 | if (!thawer) |
505 | if (!f) |
528 | return false; |
506 | return false; |
|
|
507 | |
|
|
508 | f.next (); |
529 | |
509 | |
530 | if (skip_header) |
510 | if (skip_header) |
531 | for (;;) |
511 | for (;;) |
532 | { |
512 | { |
533 | keyword kw = thawer.get_kv (); |
513 | keyword kw = f.kw; |
534 | |
514 | f.skip (); |
535 | if (kw == KW_end) |
515 | if (kw == KW_end) |
536 | break; |
516 | break; |
537 | |
|
|
538 | thawer.skip_kv (kw); |
|
|
539 | } |
517 | } |
540 | |
518 | |
541 | return load_objects (thawer); |
519 | return _load_objects (f); |
542 | } |
520 | } |
543 | |
521 | |
544 | bool |
522 | bool |
545 | maptile::save_objects (const char *path, int flags) |
523 | maptile::_save_objects (const char *path, int flags) |
546 | { |
524 | { |
547 | object_freezer freezer; |
525 | object_freezer freezer; |
548 | |
526 | |
549 | if (!save_objects (freezer, flags)) |
527 | if (!_save_objects (freezer, flags)) |
550 | return false; |
528 | return false; |
551 | |
529 | |
552 | return freezer.save (path); |
530 | return freezer.save (path); |
553 | } |
531 | } |
554 | |
532 | |
555 | maptile::maptile () |
533 | maptile::maptile () |
556 | { |
534 | { |
557 | in_memory = MAP_SWAPPED; |
535 | in_memory = MAP_SWAPPED; |
558 | |
536 | |
559 | /* The maps used to pick up default x and y values from the |
537 | /* The maps used to pick up default x and y values from the |
560 | * map archetype. Mimic that behaviour. |
538 | * map archetype. Mimic that behaviour. |
561 | */ |
539 | */ |
562 | width = 16; |
540 | width = 16; |
563 | height = 16; |
541 | height = 16; |
564 | reset_timeout = 0; |
|
|
565 | timeout = 300; |
542 | timeout = 300; |
566 | enter_x = 0; |
543 | max_nrof = 1000; // 1000 items of anything |
567 | enter_y = 0; |
544 | max_volume = 2000000; // 2m³ |
568 | } |
545 | } |
569 | |
546 | |
570 | maptile::maptile (int w, int h) |
547 | maptile::maptile (int w, int h) |
571 | { |
548 | { |
572 | in_memory = MAP_SWAPPED; |
549 | in_memory = MAP_SWAPPED; |
… | |
… | |
718 | * This could be done in lex (like the object loader), but I think |
695 | * This could be done in lex (like the object loader), but I think |
719 | * currently, there are few enough fields this is not a big deal. |
696 | * currently, there are few enough fields this is not a big deal. |
720 | * MSW 2001-07-01 |
697 | * MSW 2001-07-01 |
721 | */ |
698 | */ |
722 | bool |
699 | bool |
723 | maptile::load_header (object_thawer &thawer) |
700 | maptile::_load_header (object_thawer &thawer) |
724 | { |
701 | { |
725 | char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end; |
|
|
726 | int msgpos = 0; |
|
|
727 | int maplorepos = 0; |
|
|
728 | |
|
|
729 | for (;;) |
702 | for (;;) |
730 | { |
703 | { |
731 | keyword kw = thawer.get_kv (); |
704 | keyword kw = thawer.get_kv (); |
732 | |
705 | |
733 | switch (kw) |
706 | switch (kw) |
734 | { |
707 | { |
735 | case KW_EOF: |
|
|
736 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
|
|
737 | return false; |
|
|
738 | |
|
|
739 | case KW_end: |
|
|
740 | return true; |
|
|
741 | |
|
|
742 | case KW_msg: |
708 | case KW_msg: |
743 | thawer.get_ml (KW_endmsg, msg); |
709 | thawer.get_ml (KW_endmsg, msg); |
744 | break; |
710 | break; |
745 | |
711 | |
746 | case KW_lore: // CF+ extension |
712 | case KW_lore: // CF+ extension |
… | |
… | |
778 | case KW_sky: thawer.get (sky); break; |
744 | case KW_sky: thawer.get (sky); break; |
779 | |
745 | |
780 | case KW_per_player: thawer.get (per_player); break; |
746 | case KW_per_player: thawer.get (per_player); break; |
781 | case KW_per_party: thawer.get (per_party); break; |
747 | case KW_per_party: thawer.get (per_party); break; |
782 | |
748 | |
783 | case KW_region: get_region_by_name (thawer.get_str ()); break; |
749 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
784 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
750 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
785 | |
751 | |
786 | // old names new names |
752 | // old names new names |
787 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
753 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
788 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
754 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
… | |
… | |
797 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
763 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
798 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
764 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
799 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
765 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
800 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
766 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
801 | |
767 | |
|
|
768 | case KW_end: |
|
|
769 | return true; |
|
|
770 | |
802 | default: |
771 | default: |
803 | LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); |
772 | if (!thawer.parse_error ("map", 0)) |
|
|
773 | return false; |
804 | break; |
774 | break; |
805 | } |
775 | } |
806 | } |
776 | } |
807 | |
777 | |
808 | abort (); |
778 | abort (); |
809 | } |
779 | } |
810 | |
780 | |
811 | bool |
781 | bool |
812 | maptile::load_header (const char *path) |
782 | maptile::_load_header (const char *path) |
813 | { |
783 | { |
814 | object_thawer thawer (path); |
784 | object_thawer thawer (path); |
815 | |
785 | |
816 | if (!thawer) |
786 | if (!thawer) |
817 | return false; |
787 | return false; |
818 | |
788 | |
819 | return load_header (thawer); |
789 | return _load_header (thawer); |
820 | } |
790 | } |
821 | |
791 | |
822 | /****************************************************************************** |
792 | /****************************************************************************** |
823 | * This is the start of unique map handling code |
793 | * This is the start of unique map handling code |
824 | *****************************************************************************/ |
794 | *****************************************************************************/ |
… | |
… | |
847 | } |
817 | } |
848 | } |
818 | } |
849 | } |
819 | } |
850 | |
820 | |
851 | bool |
821 | bool |
852 | maptile::save_header (object_freezer &freezer) |
822 | maptile::_save_header (object_freezer &freezer) |
853 | { |
823 | { |
854 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
824 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
855 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
825 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
856 | |
826 | |
857 | MAP_OUT2 (arch, "map"); |
827 | MAP_OUT2 (arch, "map"); |
… | |
… | |
861 | MAP_OUT (reset_time); |
831 | MAP_OUT (reset_time); |
862 | MAP_OUT (reset_timeout); |
832 | MAP_OUT (reset_timeout); |
863 | MAP_OUT (fixed_resettime); |
833 | MAP_OUT (fixed_resettime); |
864 | MAP_OUT (difficulty); |
834 | MAP_OUT (difficulty); |
865 | |
835 | |
866 | if (region) MAP_OUT2 (region, region->name); |
836 | if (default_region) MAP_OUT2 (region, default_region->name); |
867 | |
837 | |
868 | if (shopitems) |
838 | if (shopitems) |
869 | { |
839 | { |
870 | char shop[MAX_BUF]; |
840 | char shop[MAX_BUF]; |
871 | print_shop_string (this, shop); |
841 | print_shop_string (this, shop); |
… | |
… | |
906 | |
876 | |
907 | return true; |
877 | return true; |
908 | } |
878 | } |
909 | |
879 | |
910 | bool |
880 | bool |
911 | maptile::save_header (const char *path) |
881 | maptile::_save_header (const char *path) |
912 | { |
882 | { |
913 | object_freezer freezer; |
883 | object_freezer freezer; |
914 | |
884 | |
915 | if (!save_header (freezer)) |
885 | if (!_save_header (freezer)) |
916 | return false; |
886 | return false; |
917 | |
887 | |
918 | return freezer.save (path); |
888 | return freezer.save (path); |
919 | } |
889 | } |
920 | |
890 | |
… | |
… | |
922 | * Remove and free all objects in the given map. |
892 | * Remove and free all objects in the given map. |
923 | */ |
893 | */ |
924 | void |
894 | void |
925 | maptile::clear () |
895 | maptile::clear () |
926 | { |
896 | { |
|
|
897 | sfree (regions, size ()), regions = 0; |
|
|
898 | free (regionmap), regionmap = 0; |
|
|
899 | |
927 | if (!spaces) |
900 | if (spaces) |
928 | return; |
901 | { |
929 | |
|
|
930 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
902 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
931 | while (object *op = ms->bot) |
903 | while (object *op = ms->bot) |
932 | { |
904 | { |
933 | if (op->head) |
905 | if (op->head) |
934 | op = op->head; |
906 | op = op->head; |
935 | |
907 | |
936 | op->destroy_inv (false); |
908 | op->destroy_inv (false); |
937 | op->destroy (); |
909 | op->destroy (); |
938 | } |
910 | } |
939 | |
911 | |
940 | sfree (spaces, size ()), spaces = 0; |
912 | sfree (spaces, size ()), spaces = 0; |
|
|
913 | } |
941 | |
914 | |
942 | if (buttons) |
915 | if (buttons) |
943 | free_objectlinkpt (buttons), buttons = 0; |
916 | free_objectlinkpt (buttons), buttons = 0; |
944 | } |
917 | } |
945 | |
918 | |
… | |
… | |
1099 | */ |
1072 | */ |
1100 | void |
1073 | void |
1101 | mapspace::update_ () |
1074 | mapspace::update_ () |
1102 | { |
1075 | { |
1103 | object *tmp, *last = 0; |
1076 | object *tmp, *last = 0; |
1104 | uint8 flags = 0, light = 0, anywhere = 0; |
1077 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1105 | New_Face *top, *floor, *middle; |
|
|
1106 | object *top_obj, *floor_obj, *middle_obj; |
|
|
1107 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1078 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1108 | |
1079 | |
1109 | middle = blank_face; |
1080 | //object *middle = 0; |
1110 | top = blank_face; |
1081 | //object *top = 0; |
1111 | floor = blank_face; |
1082 | //object *floor = 0; |
1112 | |
1083 | // this seems to generate better code than using locals, above |
1113 | middle_obj = 0; |
1084 | object *&top = faces_obj[0] = 0; |
1114 | top_obj = 0; |
1085 | object *&middle = faces_obj[1] = 0; |
1115 | floor_obj = 0; |
1086 | object *&floor = faces_obj[2] = 0; |
1116 | |
1087 | |
1117 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1088 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1118 | { |
1089 | { |
1119 | /* This could be made additive I guess (two lights better than |
1090 | /* This could be made additive I guess (two lights better than |
1120 | * one). But if so, it shouldn't be a simple additive - 2 |
1091 | * one). But if so, it shouldn't be a simple additive - 2 |
… | |
… | |
1133 | * Always put the player down for drawing. |
1104 | * Always put the player down for drawing. |
1134 | */ |
1105 | */ |
1135 | if (!tmp->invisible) |
1106 | if (!tmp->invisible) |
1136 | { |
1107 | { |
1137 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1108 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1138 | { |
|
|
1139 | top = tmp->face; |
|
|
1140 | top_obj = tmp; |
1109 | top = tmp; |
1141 | } |
|
|
1142 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1110 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1143 | { |
1111 | { |
1144 | /* If we got a floor, that means middle and top were below it, |
1112 | /* If we got a floor, that means middle and top were below it, |
1145 | * so should not be visible, so we clear them. |
1113 | * so should not be visible, so we clear them. |
1146 | */ |
1114 | */ |
1147 | middle = blank_face; |
1115 | middle = 0; |
1148 | top = blank_face; |
1116 | top = 0; |
1149 | floor = tmp->face; |
|
|
1150 | floor_obj = tmp; |
1117 | floor = tmp; |
1151 | } |
1118 | } |
1152 | /* Flag anywhere have high priority */ |
1119 | /* Flag anywhere have high priority */ |
1153 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1120 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1154 | { |
1121 | { |
1155 | middle = tmp->face; |
|
|
1156 | |
|
|
1157 | middle_obj = tmp; |
1122 | middle = tmp; |
1158 | anywhere = 1; |
1123 | anywhere = 1; |
1159 | } |
1124 | } |
1160 | /* Find the highest visible face around. If equal |
1125 | /* Find the highest visible face around. If equal |
1161 | * visibilities, we still want the one nearer to the |
1126 | * visibilities, we still want the one nearer to the |
1162 | * top |
1127 | * top |
1163 | */ |
1128 | */ |
1164 | else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) |
1129 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
1165 | { |
|
|
1166 | middle = tmp->face; |
|
|
1167 | middle_obj = tmp; |
1130 | middle = tmp; |
1168 | } |
|
|
1169 | } |
1131 | } |
1170 | |
1132 | |
1171 | if (tmp == tmp->above) |
1133 | if (tmp == tmp->above) |
1172 | { |
1134 | { |
1173 | LOG (llevError, "Error in structure of map\n"); |
1135 | LOG (llevError, "Error in structure of map\n"); |
… | |
… | |
1208 | * middle face. This should not happen, as we already have the |
1170 | * middle face. This should not happen, as we already have the |
1209 | * else statement above so middle should not get set. OTOH, it |
1171 | * else statement above so middle should not get set. OTOH, it |
1210 | * may be possible for the faces to match but be different objects. |
1172 | * may be possible for the faces to match but be different objects. |
1211 | */ |
1173 | */ |
1212 | if (top == middle) |
1174 | if (top == middle) |
1213 | middle = blank_face; |
1175 | middle = 0; |
1214 | |
1176 | |
1215 | /* There are three posibilities at this point: |
1177 | /* There are three posibilities at this point: |
1216 | * 1) top face is set, need middle to be set. |
1178 | * 1) top face is set, need middle to be set. |
1217 | * 2) middle is set, need to set top. |
1179 | * 2) middle is set, need to set top. |
1218 | * 3) neither middle or top is set - need to set both. |
1180 | * 3) neither middle or top is set - need to set both. |
… | |
… | |
1223 | /* Once we get to a floor, stop, since we already have a floor object */ |
1185 | /* Once we get to a floor, stop, since we already have a floor object */ |
1224 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1186 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1225 | break; |
1187 | break; |
1226 | |
1188 | |
1227 | /* If two top faces are already set, quit processing */ |
1189 | /* If two top faces are already set, quit processing */ |
1228 | if ((top != blank_face) && (middle != blank_face)) |
1190 | if (top && middle) |
1229 | break; |
1191 | break; |
1230 | |
1192 | |
1231 | /* Only show visible faces, unless its the editor - show all */ |
1193 | /* Only show visible faces */ |
1232 | if (!tmp->invisible || editor) |
1194 | if (!tmp->invisible) |
1233 | { |
1195 | { |
1234 | /* Fill in top if needed */ |
1196 | /* Fill in top if needed */ |
1235 | if (top == blank_face) |
1197 | if (!top) |
1236 | { |
1198 | { |
1237 | top = tmp->face; |
|
|
1238 | top_obj = tmp; |
1199 | top = tmp; |
1239 | if (top == middle) |
1200 | if (top == middle) |
1240 | middle = blank_face; |
1201 | middle = 0; |
1241 | } |
1202 | } |
1242 | else |
1203 | else |
1243 | { |
1204 | { |
1244 | /* top is already set - we should only get here if |
1205 | /* top is already set - we should only get here if |
1245 | * middle is not set |
1206 | * middle is not set |
1246 | * |
1207 | * |
1247 | * Set the middle face and break out, since there is nothing |
1208 | * Set the middle face and break out, since there is nothing |
1248 | * more to fill in. We don't check visiblity here, since |
1209 | * more to fill in. We don't check visiblity here, since |
1249 | * |
1210 | * |
1250 | */ |
1211 | */ |
1251 | if (tmp->face != top) |
1212 | if (tmp != top) |
1252 | { |
1213 | { |
1253 | middle = tmp->face; |
|
|
1254 | middle_obj = tmp; |
1214 | middle = tmp; |
1255 | break; |
1215 | break; |
1256 | } |
1216 | } |
1257 | } |
1217 | } |
1258 | } |
1218 | } |
1259 | } |
1219 | } |
1260 | |
1220 | |
1261 | if (middle == floor) |
1221 | if (middle == floor) |
1262 | middle = blank_face; |
1222 | middle = 0; |
1263 | |
1223 | |
1264 | if (top == middle) |
1224 | if (top == middle) |
1265 | middle = blank_face; |
1225 | middle = 0; |
1266 | |
1226 | |
1267 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1227 | #if 0 |
1268 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1228 | faces_obj [0] = top; |
1269 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1229 | faces_obj [1] = middle; |
|
|
1230 | faces_obj [2] = floor; |
|
|
1231 | #endif |
1270 | } |
1232 | } |
1271 | |
1233 | |
|
|
1234 | uint64 |
|
|
1235 | mapspace::volume () const |
|
|
1236 | { |
|
|
1237 | uint64 vol = 0; |
|
|
1238 | |
|
|
1239 | for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below) |
|
|
1240 | vol += op->volume (); |
|
|
1241 | |
|
|
1242 | return vol; |
|
|
1243 | } |
|
|
1244 | |
1272 | /* this updates the orig_map->tile_map[tile_num] value after loading |
1245 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1273 | * the map. It also takes care of linking back the freshly loaded |
1246 | * the map. It also takes care of linking back the freshly found |
1274 | * maps tile_map values if it tiles back to this one. It returns |
1247 | * maps tile_map values if it tiles back to this one. It returns |
1275 | * the value of orig_map->tile_map[tile_num]. It really only does this |
1248 | * the value of orig_map->tile_map[tile_num]. |
1276 | * so that it is easier for calling functions to verify success. |
|
|
1277 | */ |
1249 | */ |
1278 | static maptile * |
1250 | static inline maptile * |
1279 | load_and_link_tiled_map (maptile *orig_map, int tile_num) |
1251 | find_and_link (maptile *orig_map, int tile_num) |
1280 | { |
1252 | { |
|
|
1253 | maptile *mp = orig_map->tile_map [tile_num]; |
|
|
1254 | |
|
|
1255 | if (!mp) |
|
|
1256 | { |
1281 | maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); |
1257 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
1282 | |
1258 | |
1283 | if (!mp || mp->in_memory != MAP_IN_MEMORY) |
1259 | if (!mp) |
1284 | { |
1260 | { |
1285 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
1261 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
1286 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
1262 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
1287 | &orig_map->tile_path[tile_num], &orig_map->path); |
1263 | &orig_map->tile_path[tile_num], &orig_map->path); |
1288 | mp = new maptile (1, 1); |
1264 | mp = new maptile (1, 1); |
1289 | mp->alloc (); |
1265 | mp->alloc (); |
1290 | mp->in_memory = MAP_IN_MEMORY; |
1266 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1267 | } |
1291 | } |
1268 | } |
1292 | |
1269 | |
1293 | int dest_tile = (tile_num + 2) % 4; |
1270 | int dest_tile = (tile_num + 2) % 4; |
1294 | |
1271 | |
1295 | orig_map->tile_map[tile_num] = mp; |
1272 | orig_map->tile_map [tile_num] = mp; |
1296 | |
1273 | |
1297 | // optimisation: back-link map to origin map if euclidean |
1274 | // optimisation: back-link map to origin map if euclidean |
1298 | //TODO: non-euclidean maps MUST GO |
1275 | //TODO: non-euclidean maps MUST GO |
1299 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
1276 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
1300 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
1277 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
1301 | |
1278 | |
1302 | return mp; |
1279 | return mp; |
|
|
1280 | } |
|
|
1281 | |
|
|
1282 | static inline void |
|
|
1283 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1284 | { |
|
|
1285 | find_and_link (orig_map, tile_num)->load_sync (); |
1303 | } |
1286 | } |
1304 | |
1287 | |
1305 | /* this returns TRUE if the coordinates (x,y) are out of |
1288 | /* this returns TRUE if the coordinates (x,y) are out of |
1306 | * map m. This function also takes into account any |
1289 | * map m. This function also takes into account any |
1307 | * tiling considerations, loading adjacant maps as needed. |
1290 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1324 | { |
1307 | { |
1325 | if (!m->tile_path[3]) |
1308 | if (!m->tile_path[3]) |
1326 | return 1; |
1309 | return 1; |
1327 | |
1310 | |
1328 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1311 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1329 | load_and_link_tiled_map (m, 3); |
1312 | find_and_link (m, 3); |
1330 | |
1313 | |
1331 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1314 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1332 | } |
1315 | } |
1333 | |
1316 | |
1334 | if (x >= m->width) |
1317 | if (x >= m->width) |
1335 | { |
1318 | { |
1336 | if (!m->tile_path[1]) |
1319 | if (!m->tile_path[1]) |
1337 | return 1; |
1320 | return 1; |
1338 | |
1321 | |
1339 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1322 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1340 | load_and_link_tiled_map (m, 1); |
1323 | find_and_link (m, 1); |
1341 | |
1324 | |
1342 | return out_of_map (m->tile_map[1], x - m->width, y); |
1325 | return out_of_map (m->tile_map[1], x - m->width, y); |
1343 | } |
1326 | } |
1344 | |
1327 | |
1345 | if (y < 0) |
1328 | if (y < 0) |
1346 | { |
1329 | { |
1347 | if (!m->tile_path[0]) |
1330 | if (!m->tile_path[0]) |
1348 | return 1; |
1331 | return 1; |
1349 | |
1332 | |
1350 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1333 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1351 | load_and_link_tiled_map (m, 0); |
1334 | find_and_link (m, 0); |
1352 | |
1335 | |
1353 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1336 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1354 | } |
1337 | } |
1355 | |
1338 | |
1356 | if (y >= m->height) |
1339 | if (y >= m->height) |
1357 | { |
1340 | { |
1358 | if (!m->tile_path[2]) |
1341 | if (!m->tile_path[2]) |
1359 | return 1; |
1342 | return 1; |
1360 | |
1343 | |
1361 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1344 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1362 | load_and_link_tiled_map (m, 2); |
1345 | find_and_link (m, 2); |
1363 | |
1346 | |
1364 | return out_of_map (m->tile_map[2], x, y - m->height); |
1347 | return out_of_map (m->tile_map[2], x, y - m->height); |
1365 | } |
1348 | } |
1366 | |
1349 | |
1367 | /* Simple case - coordinates are within this local |
1350 | /* Simple case - coordinates are within this local |
… | |
… | |
1372 | |
1355 | |
1373 | /* This is basically the same as out_of_map above, but |
1356 | /* This is basically the same as out_of_map above, but |
1374 | * instead we return NULL if no map is valid (coordinates |
1357 | * instead we return NULL if no map is valid (coordinates |
1375 | * out of bounds and no tiled map), otherwise it returns |
1358 | * out of bounds and no tiled map), otherwise it returns |
1376 | * the map as that the coordinates are really on, and |
1359 | * the map as that the coordinates are really on, and |
1377 | * updates x and y to be the localized coordinates. |
1360 | * updates x and y to be the localised coordinates. |
1378 | * Using this is more efficient of calling out_of_map |
1361 | * Using this is more efficient of calling out_of_map |
1379 | * and then figuring out what the real map is |
1362 | * and then figuring out what the real map is |
1380 | */ |
1363 | */ |
1381 | maptile * |
1364 | maptile * |
1382 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
1365 | maptile::xy_find (sint16 &x, sint16 &y) |
1383 | { |
1366 | { |
1384 | if (*x < 0) |
1367 | if (x < 0) |
1385 | { |
1368 | { |
1386 | if (!m->tile_path[3]) |
1369 | if (!tile_path[3]) |
1387 | return 0; |
1370 | return 0; |
1388 | |
1371 | |
1389 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1372 | find_and_link (this, 3); |
1390 | load_and_link_tiled_map (m, 3); |
|
|
1391 | |
|
|
1392 | *x += m->tile_map[3]->width; |
1373 | x += tile_map[3]->width; |
1393 | return (get_map_from_coord (m->tile_map[3], x, y)); |
1374 | return tile_map[3]->xy_find (x, y); |
1394 | } |
1375 | } |
1395 | |
1376 | |
1396 | if (*x >= m->width) |
1377 | if (x >= width) |
1397 | { |
1378 | { |
1398 | if (!m->tile_path[1]) |
1379 | if (!tile_path[1]) |
1399 | return 0; |
1380 | return 0; |
1400 | |
1381 | |
1401 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1382 | find_and_link (this, 1); |
1402 | load_and_link_tiled_map (m, 1); |
|
|
1403 | |
|
|
1404 | *x -= m->width; |
1383 | x -= width; |
1405 | return (get_map_from_coord (m->tile_map[1], x, y)); |
1384 | return tile_map[1]->xy_find (x, y); |
1406 | } |
1385 | } |
1407 | |
1386 | |
1408 | if (*y < 0) |
1387 | if (y < 0) |
1409 | { |
1388 | { |
1410 | if (!m->tile_path[0]) |
1389 | if (!tile_path[0]) |
1411 | return 0; |
1390 | return 0; |
1412 | |
1391 | |
1413 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1392 | find_and_link (this, 0); |
1414 | load_and_link_tiled_map (m, 0); |
|
|
1415 | |
|
|
1416 | *y += m->tile_map[0]->height; |
1393 | y += tile_map[0]->height; |
1417 | return (get_map_from_coord (m->tile_map[0], x, y)); |
1394 | return tile_map[0]->xy_find (x, y); |
1418 | } |
1395 | } |
1419 | |
1396 | |
1420 | if (*y >= m->height) |
1397 | if (y >= height) |
1421 | { |
1398 | { |
1422 | if (!m->tile_path[2]) |
1399 | if (!tile_path[2]) |
1423 | return 0; |
1400 | return 0; |
1424 | |
1401 | |
1425 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1402 | find_and_link (this, 2); |
1426 | load_and_link_tiled_map (m, 2); |
|
|
1427 | |
|
|
1428 | *y -= m->height; |
1403 | y -= height; |
1429 | return (get_map_from_coord (m->tile_map[2], x, y)); |
1404 | return tile_map[2]->xy_find (x, y); |
1430 | } |
1405 | } |
1431 | |
1406 | |
1432 | /* Simple case - coordinates are within this local |
1407 | /* Simple case - coordinates are within this local |
1433 | * map. |
1408 | * map. |
1434 | */ |
1409 | */ |
1435 | return m; |
1410 | return this; |
1436 | } |
1411 | } |
1437 | |
1412 | |
1438 | /** |
1413 | /** |
1439 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1414 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1440 | * map1 to map2 in dx/dy. |
1415 | * map1 to map2 in dx/dy. |
1441 | */ |
1416 | */ |
1442 | static int |
1417 | int |
1443 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1418 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1444 | { |
1419 | { |
1445 | if (!map1 || !map2) |
1420 | if (!map1 || !map2) |
1446 | return 0; |
1421 | return 0; |
1447 | |
1422 | |
|
|
1423 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
|
|
1424 | //fix: compare paths instead (this is likely faster, too!) |
1448 | if (map1 == map2) |
1425 | if (map1 == map2) |
1449 | { |
1426 | { |
1450 | *dx = 0; |
1427 | *dx = 0; |
1451 | *dy = 0; |
1428 | *dy = 0; |
1452 | } |
1429 | } |
… | |
… | |
1512 | } |
1489 | } |
1513 | else |
1490 | else |
1514 | return 0; |
1491 | return 0; |
1515 | |
1492 | |
1516 | return 1; |
1493 | return 1; |
|
|
1494 | } |
|
|
1495 | |
|
|
1496 | maptile * |
|
|
1497 | maptile::xy_load (sint16 &x, sint16 &y) |
|
|
1498 | { |
|
|
1499 | maptile *map = xy_find (x, y); |
|
|
1500 | |
|
|
1501 | if (map) |
|
|
1502 | map->load_sync (); |
|
|
1503 | |
|
|
1504 | return map; |
|
|
1505 | } |
|
|
1506 | |
|
|
1507 | maptile * |
|
|
1508 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
|
|
1509 | { |
|
|
1510 | return m->xy_load (*x, *y); |
1517 | } |
1511 | } |
1518 | |
1512 | |
1519 | /* From map.c |
1513 | /* From map.c |
1520 | * This is used by get_player to determine where the other |
1514 | * This is used by get_player to determine where the other |
1521 | * creature is. get_rangevector takes into account map tiling, |
1515 | * creature is. get_rangevector takes into account map tiling, |
1522 | * so you just can not look the the map coordinates and get the |
1516 | * so you just can not look the the map coordinates and get the |
1523 | * righte value. distance_x/y are distance away, which |
1517 | * righte value. distance_x/y are distance away, which |
1524 | * can be negativbe. direction is the crossfire direction scheme |
1518 | * can be negative. direction is the crossfire direction scheme |
1525 | * that the creature should head. part is the part of the |
1519 | * that the creature should head. part is the part of the |
1526 | * monster that is closest. |
1520 | * monster that is closest. |
1527 | * |
1521 | * |
1528 | * get_rangevector looks at op1 and op2, and fills in the |
1522 | * get_rangevector looks at op1 and op2, and fills in the |
1529 | * structure for op1 to get to op2. |
1523 | * structure for op1 to get to op2. |
… | |
… | |
1540 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1534 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1541 | { |
1535 | { |
1542 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1536 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1543 | { |
1537 | { |
1544 | /* be conservative and fill in _some_ data */ |
1538 | /* be conservative and fill in _some_ data */ |
1545 | retval->distance = 100000; |
1539 | retval->distance = 10000; |
1546 | retval->distance_x = 32767; |
1540 | retval->distance_x = 10000; |
1547 | retval->distance_y = 32767; |
1541 | retval->distance_y = 10000; |
1548 | retval->direction = 0; |
1542 | retval->direction = 0; |
1549 | retval->part = 0; |
1543 | retval->part = 0; |
1550 | } |
1544 | } |
1551 | else |
1545 | else |
1552 | { |
1546 | { |
… | |
… | |
1557 | |
1551 | |
1558 | best = op1; |
1552 | best = op1; |
1559 | /* If this is multipart, find the closest part now */ |
1553 | /* If this is multipart, find the closest part now */ |
1560 | if (!(flags & 0x1) && op1->more) |
1554 | if (!(flags & 0x1) && op1->more) |
1561 | { |
1555 | { |
1562 | object *tmp; |
|
|
1563 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1556 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1564 | |
1557 | |
1565 | /* we just take the offset of the piece to head to figure |
1558 | /* we just take the offset of the piece to head to figure |
1566 | * distance instead of doing all that work above again |
1559 | * distance instead of doing all that work above again |
1567 | * since the distance fields we set above are positive in the |
1560 | * since the distance fields we set above are positive in the |
1568 | * same axis as is used for multipart objects, the simply arithmetic |
1561 | * same axis as is used for multipart objects, the simply arithmetic |
1569 | * below works. |
1562 | * below works. |
1570 | */ |
1563 | */ |
1571 | for (tmp = op1->more; tmp != NULL; tmp = tmp->more) |
1564 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1572 | { |
1565 | { |
1573 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1566 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1574 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1567 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1575 | if (tmpi < best_distance) |
1568 | if (tmpi < best_distance) |
1576 | { |
1569 | { |
1577 | best_distance = tmpi; |
1570 | best_distance = tmpi; |
1578 | best = tmp; |
1571 | best = tmp; |
1579 | } |
1572 | } |
1580 | } |
1573 | } |
|
|
1574 | |
1581 | if (best != op1) |
1575 | if (best != op1) |
1582 | { |
1576 | { |
1583 | retval->distance_x += op1->x - best->x; |
1577 | retval->distance_x += op1->x - best->x; |
1584 | retval->distance_y += op1->y - best->y; |
1578 | retval->distance_y += op1->y - best->y; |
1585 | } |
1579 | } |
1586 | } |
1580 | } |
|
|
1581 | |
1587 | retval->part = best; |
1582 | retval->part = best; |
1588 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1583 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1589 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1584 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1590 | } |
1585 | } |
1591 | } |
1586 | } |
1592 | |
1587 | |
1593 | /* this is basically the same as get_rangevector above, but instead of |
1588 | /* this is basically the same as get_rangevector above, but instead of |
… | |
… | |
1598 | * flags has no meaning for this function at this time - I kept it in to |
1593 | * flags has no meaning for this function at this time - I kept it in to |
1599 | * be more consistant with the above function and also in case they are needed |
1594 | * be more consistant with the above function and also in case they are needed |
1600 | * for something in the future. Also, since no object is pasted, the best |
1595 | * for something in the future. Also, since no object is pasted, the best |
1601 | * field of the rv_vector is set to NULL. |
1596 | * field of the rv_vector is set to NULL. |
1602 | */ |
1597 | */ |
1603 | |
|
|
1604 | void |
1598 | void |
1605 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) |
1599 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1606 | { |
1600 | { |
1607 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1601 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1608 | { |
1602 | { |
1609 | /* be conservative and fill in _some_ data */ |
1603 | /* be conservative and fill in _some_ data */ |
1610 | retval->distance = 100000; |
1604 | retval->distance = 100000; |
… | |
… | |
1617 | { |
1611 | { |
1618 | retval->distance_x += op2->x - x; |
1612 | retval->distance_x += op2->x - x; |
1619 | retval->distance_y += op2->y - y; |
1613 | retval->distance_y += op2->y - y; |
1620 | |
1614 | |
1621 | retval->part = NULL; |
1615 | retval->part = NULL; |
1622 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1616 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1623 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1617 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1624 | } |
1618 | } |
1625 | } |
1619 | } |
1626 | |
1620 | |
1627 | /* Returns true of op1 and op2 are effectively on the same map |
1621 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1647 | op->remove (); |
1641 | op->remove (); |
1648 | |
1642 | |
1649 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1643 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1650 | } |
1644 | } |
1651 | |
1645 | |
|
|
1646 | region * |
|
|
1647 | maptile::region (int x, int y) const |
|
|
1648 | { |
|
|
1649 | if (regions |
|
|
1650 | && regionmap |
|
|
1651 | && !OUT_OF_REAL_MAP (this, x, y)) |
|
|
1652 | if (struct region *reg = regionmap [regions [y * width + x]]) |
|
|
1653 | return reg; |
|
|
1654 | |
|
|
1655 | if (default_region) |
|
|
1656 | return default_region; |
|
|
1657 | |
|
|
1658 | return ::region::default_region (); |
|
|
1659 | } |
|
|
1660 | |
|
|
1661 | /* picks a random object from a style map. |
|
|
1662 | * Redone by MSW so it should be faster and not use static |
|
|
1663 | * variables to generate tables. |
|
|
1664 | */ |
|
|
1665 | object * |
|
|
1666 | maptile::pick_random_object () const |
|
|
1667 | { |
|
|
1668 | /* while returning a null object will result in a crash, that |
|
|
1669 | * is actually preferable to an infinite loop. That is because |
|
|
1670 | * most servers will automatically restart in case of crash. |
|
|
1671 | * Change the logic on getting the random space - shouldn't make |
|
|
1672 | * any difference, but this seems clearer to me. |
|
|
1673 | */ |
|
|
1674 | for (int i = 1000; --i;) |
|
|
1675 | { |
|
|
1676 | object *pick = at (rndm (width), rndm (height)).bot; |
|
|
1677 | |
|
|
1678 | // do not prefer big monsters just because they are big. |
|
|
1679 | if (pick && pick->head_ () == pick) |
|
|
1680 | return pick->head_ (); |
|
|
1681 | } |
|
|
1682 | |
|
|
1683 | // instead of crashing in the unlikely(?) case, try to return *something* |
|
|
1684 | return get_archetype ("blocked"); |
|
|
1685 | } |
|
|
1686 | |