1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
… | |
… | |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <unistd.h> |
25 | #include <unistd.h> |
26 | |
26 | |
27 | #include "global.h" |
27 | #include "global.h" |
28 | #include "loader.h" |
|
|
29 | #include "path.h" |
28 | #include "path.h" |
30 | |
29 | |
31 | //+GPL |
30 | //+GPL |
32 | |
31 | |
33 | sint8 maptile::outdoor_darkness; |
32 | sint8 maptile::outdoor_darkness; |
… | |
… | |
78 | /* Make sure the coordinates are valid - they should be, as caller should |
77 | /* Make sure the coordinates are valid - they should be, as caller should |
79 | * have already checked this. |
78 | * have already checked this. |
80 | */ |
79 | */ |
81 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
80 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
82 | { |
81 | { |
83 | LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
82 | LOG (llevError | logBacktrace, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
84 | return 1; |
83 | return 1; |
85 | } |
84 | } |
86 | |
85 | |
87 | mapspace &ms = m->at (sx, sy); |
86 | mapspace &ms = m->at (sx, sy); |
88 | |
87 | |
… | |
… | |
91 | |
90 | |
92 | /* If space is currently not blocked by anything, no need to |
91 | /* If space is currently not blocked by anything, no need to |
93 | * go further. Not true for players - all sorts of special |
92 | * go further. Not true for players - all sorts of special |
94 | * things we need to do for players. |
93 | * things we need to do for players. |
95 | */ |
94 | */ |
96 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
95 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0) |
97 | return 0; |
96 | return 0; |
98 | |
97 | |
99 | /* if there isn't anything alive on this space, and this space isn't |
98 | /* if there isn't anything alive on this space, and this space isn't |
100 | * otherwise blocked, we can return now. Only if there is a living |
99 | * otherwise blocked, we can return now. Only if there is a living |
101 | * creature do we need to investigate if it is part of this creature |
100 | * creature do we need to investigate if it is part of this creature |
… | |
… | |
111 | /* We basically go through the stack of objects, and if there is |
110 | /* We basically go through the stack of objects, and if there is |
112 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
111 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
113 | * true. If we get through the entire stack, that must mean |
112 | * true. If we get through the entire stack, that must mean |
114 | * ob is blocking it, so return 0. |
113 | * ob is blocking it, so return 0. |
115 | */ |
114 | */ |
116 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
115 | for (object *tmp = ms.top; tmp; tmp = tmp->below) |
117 | { |
116 | { |
118 | if (OB_MOVE_BLOCK (ob, tmp)) |
117 | if (OB_MOVE_BLOCK (ob, tmp)) |
119 | { |
118 | { |
120 | if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob)) |
119 | if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob)) |
121 | if (RESULT_INT (0)) |
120 | if (RESULT_INT (0)) |
… | |
… | |
145 | return 1; // unconditional block |
144 | return 1; // unconditional block |
146 | |
145 | |
147 | } else { |
146 | } else { |
148 | // space does not block the ob, directly, but |
147 | // space does not block the ob, directly, but |
149 | // anything alive that is not a door still |
148 | // anything alive that is not a door still |
150 | // blocks anything but wizards. |
149 | // blocks anything |
151 | |
150 | |
152 | if (tmp->flag [FLAG_ALIVE] |
151 | if (tmp->flag [FLAG_ALIVE] |
153 | && tmp->head_ () != ob |
|
|
154 | && tmp != ob |
|
|
155 | && tmp->type != DOOR) |
152 | && tmp->type != DOOR |
|
|
153 | && tmp->head_ () != ob) //TODO: maybe move these check up? |
156 | return 1; |
154 | return 1; |
157 | } |
155 | } |
158 | } |
156 | } |
159 | |
157 | |
160 | return 0; |
158 | return 0; |
161 | } |
159 | } |
162 | |
160 | |
163 | /* |
161 | /* |
164 | * Returns qthe blocking object if the given object can't fit in the given |
162 | * Returns the blocking object if the given object can't fit in the given |
165 | * spot. This is meant for multi space objects - for single space objecs, |
163 | * spot. This is meant for multi space objects - for single space objecs, |
166 | * just calling get_map_blocked and checking that against movement type |
164 | * just calling get_map_blocked and checking that against movement type |
167 | * of object. This function goes through all the parts of the multipart |
165 | * of object. This function goes through all the parts of the multipart |
168 | * object and makes sure they can be inserted. |
166 | * object and makes sure they can be inserted. |
169 | * |
167 | * |
… | |
… | |
313 | case KW_arch: |
311 | case KW_arch: |
314 | if (object *op = object::read (f, this)) |
312 | if (object *op = object::read (f, this)) |
315 | { |
313 | { |
316 | // TODO: why? |
314 | // TODO: why? |
317 | if (op->inv) |
315 | if (op->inv) |
|
|
316 | { |
|
|
317 | op->carrying = 0; |
318 | op->update_weight (); |
318 | op->update_weight (); |
|
|
319 | } |
319 | |
320 | |
320 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
321 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
321 | { |
322 | { |
322 | // we insert manually because |
323 | // we insert manually because |
323 | // a) its way faster |
324 | // a) its way faster |
… | |
… | |
360 | } |
361 | } |
361 | |
362 | |
362 | void |
363 | void |
363 | maptile::activate () |
364 | maptile::activate () |
364 | { |
365 | { |
365 | if (spaces) |
366 | if (state != MAP_INACTIVE) |
|
|
367 | return; |
|
|
368 | |
366 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
369 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
367 | for (object *op = ms->bot; op; op = op->above) |
370 | for (object *op = ms->bot; op; op = op->above) |
368 | op->activate_recursive (); |
371 | op->activate_recursive (); |
|
|
372 | |
|
|
373 | state = MAP_ACTIVE; |
369 | } |
374 | } |
370 | |
375 | |
371 | void |
376 | void |
372 | maptile::deactivate () |
377 | maptile::deactivate () |
373 | { |
378 | { |
374 | if (spaces) |
379 | if (state != MAP_ACTIVE) |
|
|
380 | return; |
|
|
381 | |
375 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
382 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
376 | for (object *op = ms->bot; op; op = op->above) |
383 | for (object *op = ms->bot; op; op = op->above) |
377 | op->deactivate_recursive (); |
384 | op->deactivate_recursive (); |
|
|
385 | |
|
|
386 | state = MAP_INACTIVE; |
378 | } |
387 | } |
379 | |
388 | |
380 | bool |
389 | bool |
381 | maptile::_save_objects (object_freezer &f, int flags) |
390 | maptile::_save_objects (object_freezer &f, int flags) |
382 | { |
391 | { |
… | |
… | |
423 | return false; |
432 | return false; |
424 | |
433 | |
425 | return freezer.save (path); |
434 | return freezer.save (path); |
426 | } |
435 | } |
427 | |
436 | |
428 | maptile::maptile () |
437 | void |
|
|
438 | maptile::init () |
429 | { |
439 | { |
430 | in_memory = MAP_SWAPPED; |
440 | state = MAP_SWAPPED; |
431 | |
441 | |
432 | /* The maps used to pick up default x and y values from the |
442 | /* The maps used to pick up default x and y values from the |
433 | * map archetype. Mimic that behaviour. |
443 | * map archetype. Mimic that behaviour. |
434 | */ |
444 | */ |
435 | width = 16; |
445 | width = 16; |
436 | height = 16; |
446 | height = 16; |
437 | timeout = 300; |
447 | timeout = 300; |
438 | max_items = MAX_ITEM_PER_ACTION; |
448 | max_items = MAX_ITEM_PER_ACTION; |
439 | max_volume = 2000000; // 2m³ |
449 | max_volume = 2000000; // 2m³ |
440 | } |
|
|
441 | |
|
|
442 | maptile::maptile (int w, int h) |
|
|
443 | { |
|
|
444 | in_memory = MAP_SWAPPED; |
|
|
445 | |
|
|
446 | width = w; |
|
|
447 | height = h; |
|
|
448 | reset_timeout = 0; |
450 | reset_timeout = 0; |
449 | timeout = 300; |
|
|
450 | enter_x = 0; |
451 | enter_x = 0; |
451 | enter_y = 0; |
452 | enter_y = 0; |
|
|
453 | } |
|
|
454 | |
|
|
455 | maptile::maptile () |
|
|
456 | { |
|
|
457 | init (); |
|
|
458 | } |
|
|
459 | |
|
|
460 | maptile::maptile (int w, int h) |
|
|
461 | { |
|
|
462 | init (); |
|
|
463 | |
|
|
464 | width = w; |
|
|
465 | height = h; |
452 | |
466 | |
453 | alloc (); |
467 | alloc (); |
454 | } |
468 | } |
455 | |
469 | |
456 | /* |
470 | /* |
… | |
… | |
556 | * the map (or something equivilent) into output_string. */ |
570 | * the map (or something equivilent) into output_string. */ |
557 | static const char * |
571 | static const char * |
558 | print_shop_string (maptile *m) |
572 | print_shop_string (maptile *m) |
559 | { |
573 | { |
560 | static dynbuf_text buf; buf.clear (); |
574 | static dynbuf_text buf; buf.clear (); |
|
|
575 | bool first = true; |
561 | |
576 | |
562 | for (int i = 0; i < m->shopitems[0].index; i++) |
577 | for (int i = 0; i < m->shopitems[0].index; i++) |
563 | { |
578 | { |
|
|
579 | if (!first) |
|
|
580 | buf << ';'; |
|
|
581 | |
|
|
582 | first = false; |
|
|
583 | |
564 | if (m->shopitems[i].typenum) |
584 | if (m->shopitems[i].typenum) |
565 | { |
585 | { |
566 | if (m->shopitems[i].strength) |
586 | if (m->shopitems[i].strength) |
567 | buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
587 | buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength); |
568 | else |
588 | else |
569 | buf.printf ("%s;", m->shopitems[i].name); |
589 | buf.printf ("%s", m->shopitems[i].name); |
570 | } |
590 | } |
571 | else |
591 | else |
572 | { |
592 | { |
573 | if (m->shopitems[i].strength) |
593 | if (m->shopitems[i].strength) |
574 | buf.printf ("*:%d;", m->shopitems[i].strength); |
594 | buf.printf ("*:%d", m->shopitems[i].strength); |
575 | else |
595 | else |
576 | buf.printf ("*"); |
596 | buf.printf ("*"); |
577 | } |
597 | } |
578 | } |
598 | } |
579 | |
599 | |
… | |
… | |
602 | { |
622 | { |
603 | case KW_msg: |
623 | case KW_msg: |
604 | thawer.get_ml (KW_endmsg, msg); |
624 | thawer.get_ml (KW_endmsg, msg); |
605 | break; |
625 | break; |
606 | |
626 | |
607 | case KW_lore: // CF+ extension |
627 | case KW_lore: // deliantra extension |
608 | thawer.get_ml (KW_endlore, maplore); |
628 | thawer.get_ml (KW_endlore, maplore); |
609 | break; |
629 | break; |
610 | |
630 | |
611 | case KW_maplore: |
631 | case KW_maplore: |
612 | thawer.get_ml (KW_endmaplore, maplore); |
632 | thawer.get_ml (KW_endmaplore, maplore); |
… | |
… | |
635 | case KW_per_player: thawer.get (per_player); break; |
655 | case KW_per_player: thawer.get (per_player); break; |
636 | case KW_per_party: thawer.get (per_party); break; |
656 | case KW_per_party: thawer.get (per_party); break; |
637 | case KW_no_reset: thawer.get (no_reset); break; |
657 | case KW_no_reset: thawer.get (no_reset); break; |
638 | case KW_no_drop: thawer.get (no_drop); break; |
658 | case KW_no_drop: thawer.get (no_drop); break; |
639 | |
659 | |
640 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
660 | case KW_region: thawer.get (default_region); break; |
641 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
661 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
642 | |
662 | |
643 | // old names new names |
663 | // old names new names |
644 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
664 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
645 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
665 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
… | |
… | |
653 | |
673 | |
654 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
674 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
655 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
675 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
656 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
676 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
657 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
677 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
|
|
678 | case KW_tile_path_5: thawer.get (tile_path [4]); break; |
|
|
679 | case KW_tile_path_6: thawer.get (tile_path [5]); break; |
658 | |
680 | |
659 | case KW_ERROR: |
681 | case KW_ERROR: |
660 | set_key_text (thawer.kw_str, thawer.value); |
682 | set_key_text (thawer.kw_str, thawer.value); |
661 | break; |
683 | break; |
662 | |
684 | |
663 | case KW_end: |
685 | case KW_end: |
664 | thawer.next (); |
686 | thawer.next (); |
665 | return true; |
687 | return true; |
666 | |
688 | |
667 | default: |
689 | default: |
668 | if (!thawer.parse_error ("map", 0)) |
690 | if (!thawer.parse_error ("map")) |
669 | return false; |
691 | return false; |
670 | break; |
692 | break; |
671 | } |
693 | } |
672 | |
694 | |
673 | thawer.next (); |
695 | thawer.next (); |
… | |
… | |
691 | int unique = 0; |
713 | int unique = 0; |
692 | for (object *op = spaces [i].bot; op; ) |
714 | for (object *op = spaces [i].bot; op; ) |
693 | { |
715 | { |
694 | object *above = op->above; |
716 | object *above = op->above; |
695 | |
717 | |
696 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
718 | if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE]) |
697 | unique = 1; |
719 | unique = 1; |
698 | |
720 | |
699 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
721 | if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique)) |
700 | op->destroy (); |
722 | op->destroy (); |
701 | |
723 | |
702 | op = above; |
724 | op = above; |
703 | } |
725 | } |
704 | } |
726 | } |
… | |
… | |
745 | |
767 | |
746 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
768 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
747 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
769 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
748 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
770 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
749 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
771 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
|
|
772 | if (tile_path [4]) MAP_OUT2 (tile_path_5, tile_path [4]); |
|
|
773 | if (tile_path [5]) MAP_OUT2 (tile_path_6, tile_path [5]); |
750 | |
774 | |
751 | freezer.put (this); |
775 | freezer.put (this); |
752 | freezer.put (KW(end)); |
776 | freezer.put (KW(end)); |
753 | |
777 | |
754 | return true; |
778 | return true; |
… | |
… | |
811 | msg = 0; |
835 | msg = 0; |
812 | maplore = 0; |
836 | maplore = 0; |
813 | shoprace = 0; |
837 | shoprace = 0; |
814 | delete [] shopitems, shopitems = 0; |
838 | delete [] shopitems, shopitems = 0; |
815 | |
839 | |
816 | for (int i = 0; i < 4; i++) |
840 | for (int i = 0; i < array_length (tile_path); i++) |
817 | tile_path [i] = 0; |
841 | tile_path [i] = 0; |
818 | } |
842 | } |
819 | |
843 | |
820 | maptile::~maptile () |
844 | maptile::~maptile () |
821 | { |
845 | { |
… | |
… | |
828 | /* We need to look through all the maps and see if any maps |
852 | /* We need to look through all the maps and see if any maps |
829 | * are pointing at this one for tiling information. Since |
853 | * are pointing at this one for tiling information. Since |
830 | * tiling can be asymetric, we just can not look to see which |
854 | * tiling can be asymetric, we just can not look to see which |
831 | * maps this map tiles with and clears those. |
855 | * maps this map tiles with and clears those. |
832 | */ |
856 | */ |
833 | for (int i = 0; i < 4; i++) |
857 | for (int i = 0; i < array_length (tile_path); i++) |
834 | if (tile_map[i] == m) |
858 | if (tile_map[i] == m) |
835 | tile_map[i] = 0; |
859 | tile_map[i] = 0; |
836 | } |
860 | } |
837 | |
861 | |
838 | void |
862 | void |
… | |
… | |
854 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
878 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
855 | for (object *above, *op = ms->bot; op; op = above) |
879 | for (object *above, *op = ms->bot; op; op = above) |
856 | { |
880 | { |
857 | above = op->above; |
881 | above = op->above; |
858 | |
882 | |
|
|
883 | // do not decay anything above unique floor tiles (yet :) |
|
|
884 | if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE]) |
|
|
885 | break; |
|
|
886 | |
859 | bool destroy = 0; |
887 | bool destroy = 0; |
860 | |
888 | |
861 | // do not decay anything above unique floor tiles (yet :) |
889 | if (op->flag [FLAG_IS_FLOOR] |
862 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
890 | || op->flag [FLAG_OBJ_ORIGINAL] |
863 | break; |
891 | || op->flag [FLAG_UNIQUE] |
864 | |
892 | || op->flag [FLAG_OVERLAY_FLOOR] |
865 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
893 | || op->flag [FLAG_UNPAID] |
866 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
867 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
868 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
869 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
870 | || op->is_alive ()) |
894 | || op->is_alive ()) |
871 | ; // do not decay |
895 | ; // do not decay |
872 | else if (op->is_weapon ()) |
896 | else if (op->is_weapon ()) |
873 | { |
897 | { |
874 | op->stats.dam--; |
898 | op->stats.dam--; |
… | |
… | |
930 | sint64 total_exp = 0; |
954 | sint64 total_exp = 0; |
931 | |
955 | |
932 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
956 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
933 | for (object *op = ms->bot; op; op = op->above) |
957 | for (object *op = ms->bot; op; op = op->above) |
934 | { |
958 | { |
935 | if (QUERY_FLAG (op, FLAG_MONSTER)) |
959 | if (op->flag [FLAG_MONSTER]) |
936 | { |
960 | { |
937 | total_exp += op->stats.exp; |
961 | total_exp += op->stats.exp; |
938 | monster_cnt++; |
962 | monster_cnt++; |
939 | } |
963 | } |
940 | |
964 | |
941 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
965 | if (op->flag [FLAG_GENERATOR]) |
942 | { |
966 | { |
943 | total_exp += op->stats.exp; |
967 | total_exp += op->stats.exp; |
944 | |
968 | |
945 | if (archetype *at = op->other_arch) |
969 | if (archetype *at = op->other_arch) |
946 | { |
970 | { |
… | |
… | |
1128 | */ |
1152 | */ |
1129 | |
1153 | |
1130 | for (object *tmp = last; tmp; tmp = tmp->below) |
1154 | for (object *tmp = last; tmp; tmp = tmp->below) |
1131 | { |
1155 | { |
1132 | /* Once we get to a floor, stop, since we already have a floor object */ |
1156 | /* Once we get to a floor, stop, since we already have a floor object */ |
1133 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1157 | if (tmp->flag [FLAG_IS_FLOOR]) |
1134 | break; |
1158 | break; |
1135 | |
1159 | |
1136 | /* If two top faces are already set, quit processing */ |
1160 | /* If two top faces are already set, quit processing */ |
1137 | if (top && middle) |
1161 | if (top && middle) |
1138 | break; |
1162 | break; |
… | |
… | |
1181 | maptile * |
1205 | maptile * |
1182 | maptile::tile_available (int dir, bool load) |
1206 | maptile::tile_available (int dir, bool load) |
1183 | { |
1207 | { |
1184 | if (tile_path[dir]) |
1208 | if (tile_path[dir]) |
1185 | { |
1209 | { |
|
|
1210 | // map is there and we don't need to load it OR it's loaded => return what we have |
1186 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1211 | if (tile_map[dir] && (!load || tile_map[dir]->linkable ())) |
1187 | return tile_map[dir]; |
1212 | return tile_map[dir]; |
1188 | |
1213 | |
|
|
1214 | // well, try to locate it then, if possible - maybe it's there already |
1189 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1215 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1190 | return tile_map[dir]; |
1216 | return tile_map[dir]; |
1191 | } |
1217 | } |
1192 | |
1218 | |
1193 | return 0; |
1219 | return 0; |
… | |
… | |
1305 | /** |
1331 | /** |
1306 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1332 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1307 | * map1 to map2 in dx/dy. |
1333 | * map1 to map2 in dx/dy. |
1308 | */ |
1334 | */ |
1309 | int |
1335 | int |
1310 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1336 | adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy) |
1311 | { |
1337 | { |
1312 | if (!map1 || !map2) |
1338 | if (!map1 || !map2) |
1313 | return 0; |
1339 | return 0; |
1314 | |
1340 | |
1315 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
1341 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
… | |
… | |
1317 | if (map1 == map2) |
1343 | if (map1 == map2) |
1318 | { |
1344 | { |
1319 | *dx = 0; |
1345 | *dx = 0; |
1320 | *dy = 0; |
1346 | *dy = 0; |
1321 | } |
1347 | } |
1322 | else if (map1->tile_map[0] == map2) |
1348 | else if (map1->tile_available (TILE_NORTH, false) == map2) |
1323 | { /* up */ |
1349 | { |
1324 | *dx = 0; |
1350 | *dx = 0; |
1325 | *dy = -map2->height; |
1351 | *dy = -map2->height; |
1326 | } |
1352 | } |
1327 | else if (map1->tile_map[1] == map2) |
1353 | else if (map1->tile_available (TILE_EAST , false) == map2) |
1328 | { /* right */ |
1354 | { |
1329 | *dx = map1->width; |
1355 | *dx = map1->width; |
1330 | *dy = 0; |
1356 | *dy = 0; |
1331 | } |
1357 | } |
1332 | else if (map1->tile_map[2] == map2) |
1358 | else if (map1->tile_available (TILE_SOUTH, false) == map2) |
1333 | { /* down */ |
1359 | { |
1334 | *dx = 0; |
1360 | *dx = 0; |
1335 | *dy = map1->height; |
1361 | *dy = map1->height; |
1336 | } |
1362 | } |
1337 | else if (map1->tile_map[3] == map2) |
1363 | else if (map1->tile_available (TILE_WEST , false) == map2) |
1338 | { /* left */ |
1364 | { |
1339 | *dx = -map2->width; |
1365 | *dx = -map2->width; |
1340 | *dy = 0; |
1366 | *dy = 0; |
1341 | } |
1367 | } |
1342 | else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) |
1368 | else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2) |
1343 | { /* up right */ |
1369 | { /* up right */ |
1344 | *dx = map1->tile_map[0]->width; |
1370 | *dx = +map1->tile_map[TILE_NORTH]->width; |
1345 | *dy = -map1->tile_map[0]->height; |
1371 | *dy = -map1->tile_map[TILE_NORTH]->height; |
1346 | } |
1372 | } |
1347 | else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) |
1373 | else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2) |
1348 | { /* up left */ |
1374 | { /* up left */ |
1349 | *dx = -map2->width; |
1375 | *dx = -map2->width; |
1350 | *dy = -map1->tile_map[0]->height; |
1376 | *dy = -map1->tile_map[TILE_NORTH]->height; |
1351 | } |
1377 | } |
1352 | else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) |
1378 | else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2) |
1353 | { /* right up */ |
1379 | { /* right up */ |
1354 | *dx = map1->width; |
1380 | *dx = +map1->width; |
1355 | *dy = -map2->height; |
1381 | *dy = -map2->height; |
1356 | } |
1382 | } |
1357 | else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) |
1383 | else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2) |
1358 | { /* right down */ |
1384 | { /* right down */ |
1359 | *dx = map1->width; |
1385 | *dx = +map1->width; |
1360 | *dy = map1->tile_map[1]->height; |
1386 | *dy = +map1->tile_map[TILE_EAST]->height; |
1361 | } |
1387 | } |
1362 | else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) |
1388 | else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2) |
1363 | { /* down right */ |
1389 | { /* down right */ |
1364 | *dx = map1->tile_map[2]->width; |
1390 | *dx = +map1->tile_map[TILE_SOUTH]->width; |
1365 | *dy = map1->height; |
1391 | *dy = +map1->height; |
1366 | } |
1392 | } |
1367 | else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) |
1393 | else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2) |
1368 | { /* down left */ |
1394 | { /* down left */ |
1369 | *dx = -map2->width; |
1395 | *dx = -map2->width; |
1370 | *dy = map1->height; |
1396 | *dy = +map1->height; |
1371 | } |
1397 | } |
1372 | else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) |
1398 | else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2) |
1373 | { /* left up */ |
1399 | { /* left up */ |
1374 | *dx = -map1->tile_map[3]->width; |
1400 | *dx = -map1->tile_map[TILE_WEST]->width; |
1375 | *dy = -map2->height; |
1401 | *dy = -map2->height; |
1376 | } |
1402 | } |
1377 | else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) |
1403 | else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2) |
1378 | { /* left down */ |
1404 | { /* left down */ |
1379 | *dx = -map1->tile_map[3]->width; |
1405 | *dx = -map1->tile_map[TILE_WEST]->width; |
1380 | *dy = map1->tile_map[3]->height; |
1406 | *dy = +map1->tile_map[TILE_WEST]->height; |
1381 | } |
1407 | } |
1382 | else |
1408 | else |
1383 | return 0; |
1409 | return 0; |
1384 | |
1410 | |
1385 | return 1; |
1411 | return 1; |
… | |
… | |
1421 | * |
1447 | * |
1422 | * currently, the only flag supported (0x1) is don't translate for |
1448 | * currently, the only flag supported (0x1) is don't translate for |
1423 | * closest body part of 'op1' |
1449 | * closest body part of 'op1' |
1424 | */ |
1450 | */ |
1425 | void |
1451 | void |
1426 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1452 | get_rangevector (object *op1, object *op2, rv_vector *retval, int flags) |
1427 | { |
1453 | { |
1428 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1454 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1429 | { |
1455 | { |
1430 | /* be conservative and fill in _some_ data */ |
1456 | /* be conservative and fill in _some_ data */ |
1431 | retval->distance = 10000; |
1457 | retval->distance = 10000; |
1432 | retval->distance_x = 10000; |
1458 | retval->distance_x = 10000; |
1433 | retval->distance_y = 10000; |
1459 | retval->distance_y = 10000; |
1434 | retval->direction = 0; |
1460 | retval->direction = 0; |
1435 | retval->part = 0; |
1461 | retval->part = 0; |
1436 | } |
1462 | } |
1437 | else |
1463 | else |
1438 | { |
1464 | { |
1439 | object *best; |
|
|
1440 | |
|
|
1441 | retval->distance_x += op2->x - op1->x; |
1465 | retval->distance_x += op2->x - op1->x; |
1442 | retval->distance_y += op2->y - op1->y; |
1466 | retval->distance_y += op2->y - op1->y; |
1443 | |
1467 | |
1444 | best = op1; |
1468 | object *best = op1; |
|
|
1469 | |
1445 | /* If this is multipart, find the closest part now */ |
1470 | /* If this is multipart, find the closest part now */ |
1446 | if (!(flags & 0x1) && op1->more) |
1471 | if (!(flags & 1) && op1->more) |
1447 | { |
1472 | { |
1448 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1473 | int best_distance = idistance (retval->distance_x, retval->distance_y); |
1449 | |
1474 | |
1450 | /* we just take the offset of the piece to head to figure |
1475 | /* we just take the offset of the piece to head to figure |
1451 | * distance instead of doing all that work above again |
1476 | * distance instead of doing all that work above again |
1452 | * since the distance fields we set above are positive in the |
1477 | * since the distance fields we set above are positive in the |
1453 | * same axis as is used for multipart objects, the simply arithmetic |
1478 | * same axis as is used for multipart objects, the simply arithmetic |
1454 | * below works. |
1479 | * below works. |
1455 | */ |
1480 | */ |
1456 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1481 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1457 | { |
1482 | { |
1458 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1483 | int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y); |
1459 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1484 | |
1460 | if (tmpi < best_distance) |
1485 | if (tmpi < best_distance) |
1461 | { |
1486 | { |
1462 | best_distance = tmpi; |
1487 | best_distance = tmpi; |
1463 | best = tmp; |
1488 | best = tmp; |
1464 | } |
1489 | } |
1465 | } |
1490 | } |
1466 | |
1491 | |
1467 | if (best != op1) |
1492 | if (best != op1) |
1468 | { |
1493 | { |
1469 | retval->distance_x += op1->x - best->x; |
1494 | retval->distance_x += op1->x - best->x; |
1470 | retval->distance_y += op1->y - best->y; |
1495 | retval->distance_y += op1->y - best->y; |
1471 | } |
1496 | } |
1472 | } |
1497 | } |
1473 | |
1498 | |
1474 | retval->part = best; |
1499 | retval->part = best; |
1475 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1500 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1476 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1501 | retval->direction = find_dir_2 (retval->distance_x, retval->distance_y); |
1477 | } |
1502 | } |
1478 | } |
1503 | } |
1479 | |
1504 | |
1480 | /* this is basically the same as get_rangevector above, but instead of |
1505 | /* this is basically the same as get_rangevector above, but instead of |
1481 | * the first parameter being an object, it instead is the map |
1506 | * the first parameter being an object, it instead is the map |
… | |
… | |
1486 | * be more consistant with the above function and also in case they are needed |
1511 | * be more consistant with the above function and also in case they are needed |
1487 | * for something in the future. Also, since no object is pasted, the best |
1512 | * for something in the future. Also, since no object is pasted, the best |
1488 | * field of the rv_vector is set to NULL. |
1513 | * field of the rv_vector is set to NULL. |
1489 | */ |
1514 | */ |
1490 | void |
1515 | void |
1491 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1516 | get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1492 | { |
1517 | { |
1493 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1518 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1494 | { |
1519 | { |
1495 | /* be conservative and fill in _some_ data */ |
1520 | /* be conservative and fill in _some_ data */ |
1496 | retval->distance = 100000; |
1521 | retval->distance = 100000; |
1497 | retval->distance_x = 32767; |
1522 | retval->distance_x = 32767; |
1498 | retval->distance_y = 32767; |
1523 | retval->distance_y = 32767; |
1499 | retval->direction = 0; |
1524 | retval->direction = 0; |
1500 | retval->part = 0; |
1525 | retval->part = 0; |
1501 | } |
1526 | } |
1502 | else |
1527 | else |
1503 | { |
1528 | { |
1504 | retval->distance_x += op2->x - x; |
1529 | retval->distance_x += op2->x - x; |
1505 | retval->distance_y += op2->y - y; |
1530 | retval->distance_y += op2->y - y; |
1506 | |
1531 | |
1507 | retval->part = 0; |
1532 | retval->part = 0; |
1508 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1533 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1509 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1534 | retval->direction = find_dir_2 (retval->distance_x, retval->distance_y); |
1510 | } |
1535 | } |
1511 | } |
1536 | } |
1512 | |
1537 | |
1513 | /* Returns true of op1 and op2 are effectively on the same map |
1538 | /* Returns true of op1 and op2 are effectively on the same map |
1514 | * (as related to map tiling). Note that this looks for a path from |
1539 | * (as related to map tiling). Note that this looks for a path from |
… | |
… | |
1564 | */ |
1589 | */ |
1565 | for (int i = 1000; --i;) |
1590 | for (int i = 1000; --i;) |
1566 | { |
1591 | { |
1567 | object *pick = at (gen (width), gen (height)).bot; |
1592 | object *pick = at (gen (width), gen (height)).bot; |
1568 | |
1593 | |
1569 | // do not prefer big monsters just because they are big. |
1594 | // must be head: do not prefer big monsters just because they are big. |
1570 | if (pick && pick->is_head ()) |
1595 | if (pick && pick->is_head ()) |
1571 | return pick->head_ (); |
1596 | return pick; |
1572 | } |
1597 | } |
1573 | |
1598 | |
1574 | // instead of crashing in the unlikely(?) case, try to return *something* |
1599 | // instead of crashing in the unlikely(?) case, try to return *something* |
1575 | return archetype::find (shstr_bug); |
1600 | return archetype::find (shstr_bug); |
1576 | } |
1601 | } |
… | |
… | |
1610 | if (distance <= MAX_SOUND_DISTANCE) |
1635 | if (distance <= MAX_SOUND_DISTANCE) |
1611 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1636 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1612 | } |
1637 | } |
1613 | } |
1638 | } |
1614 | |
1639 | |
|
|
1640 | dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25); |
|
|
1641 | |
1615 | static void |
1642 | static void |
1616 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
1643 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
1617 | { |
1644 | { |
1618 | // clip to map to the left |
1645 | // clip to map to the left |
1619 | if (x0 < 0) |
1646 | if (x0 < 0) |
1620 | { |
1647 | { |
1621 | if (maptile *tile = m->tile_available (TILE_LEFT, 1)) |
1648 | if (maptile *tile = m->tile_available (TILE_WEST, 1)) |
1622 | split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); |
1649 | split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); |
1623 | |
1650 | |
1624 | if (x1 < 0) // entirely to the left |
1651 | if (x1 < 0) // entirely to the left |
1625 | return; |
1652 | return; |
1626 | |
1653 | |
… | |
… | |
1628 | } |
1655 | } |
1629 | |
1656 | |
1630 | // clip to map to the right |
1657 | // clip to map to the right |
1631 | if (x1 > m->width) |
1658 | if (x1 > m->width) |
1632 | { |
1659 | { |
1633 | if (maptile *tile = m->tile_available (TILE_RIGHT, 1)) |
1660 | if (maptile *tile = m->tile_available (TILE_EAST, 1)) |
1634 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
1661 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
1635 | |
1662 | |
1636 | if (x0 > m->width) // entirely to the right |
1663 | if (x0 > m->width) // entirely to the right |
1637 | return; |
1664 | return; |
1638 | |
1665 | |
… | |
… | |
1640 | } |
1667 | } |
1641 | |
1668 | |
1642 | // clip to map above |
1669 | // clip to map above |
1643 | if (y0 < 0) |
1670 | if (y0 < 0) |
1644 | { |
1671 | { |
1645 | if (maptile *tile = m->tile_available (TILE_UP, 1)) |
1672 | if (maptile *tile = m->tile_available (TILE_NORTH, 1)) |
1646 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
1673 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
1647 | |
1674 | |
1648 | if (y1 < 0) // entirely above |
1675 | if (y1 < 0) // entirely above |
1649 | return; |
1676 | return; |
1650 | |
1677 | |
… | |
… | |
1652 | } |
1679 | } |
1653 | |
1680 | |
1654 | // clip to map below |
1681 | // clip to map below |
1655 | if (y1 > m->height) |
1682 | if (y1 > m->height) |
1656 | { |
1683 | { |
1657 | if (maptile *tile = m->tile_available (TILE_DOWN, 1)) |
1684 | if (maptile *tile = m->tile_available (TILE_SOUTH, 1)) |
1658 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
1685 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
1659 | |
1686 | |
1660 | if (y0 > m->height) // entirely below |
1687 | if (y0 > m->height) // entirely below |
1661 | return; |
1688 | return; |
1662 | |
1689 | |
… | |
… | |
1674 | r->dx = dx; |
1701 | r->dx = dx; |
1675 | r->dy = dy; |
1702 | r->dy = dy; |
1676 | } |
1703 | } |
1677 | |
1704 | |
1678 | maprect * |
1705 | maprect * |
1679 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
1706 | maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1) |
1680 | { |
1707 | { |
1681 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1682 | buf.clear (); |
1708 | buf.clear (); |
1683 | |
1709 | |
1684 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
1710 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
1685 | |
1711 | |
1686 | // add end marker |
1712 | // add end marker |