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 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 | * |
… | |
… | |
423 | return false; |
421 | return false; |
424 | |
422 | |
425 | return freezer.save (path); |
423 | return freezer.save (path); |
426 | } |
424 | } |
427 | |
425 | |
428 | maptile::maptile () |
426 | void |
|
|
427 | maptile::init () |
429 | { |
428 | { |
430 | in_memory = MAP_SWAPPED; |
429 | in_memory = MAP_SWAPPED; |
431 | |
430 | |
432 | /* The maps used to pick up default x and y values from the |
431 | /* The maps used to pick up default x and y values from the |
433 | * map archetype. Mimic that behaviour. |
432 | * map archetype. Mimic that behaviour. |
434 | */ |
433 | */ |
435 | width = 16; |
434 | width = 16; |
436 | height = 16; |
435 | height = 16; |
437 | timeout = 300; |
436 | timeout = 300; |
438 | max_items = MAX_ITEM_PER_ACTION; |
437 | max_items = MAX_ITEM_PER_ACTION; |
439 | max_volume = 2000000; // 2m³ |
438 | 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; |
439 | reset_timeout = 0; |
449 | timeout = 300; |
|
|
450 | enter_x = 0; |
440 | enter_x = 0; |
451 | enter_y = 0; |
441 | enter_y = 0; |
|
|
442 | } |
|
|
443 | |
|
|
444 | maptile::maptile () |
|
|
445 | { |
|
|
446 | init (); |
|
|
447 | } |
|
|
448 | |
|
|
449 | maptile::maptile (int w, int h) |
|
|
450 | { |
|
|
451 | init (); |
|
|
452 | |
|
|
453 | width = w; |
|
|
454 | height = h; |
452 | |
455 | |
453 | alloc (); |
456 | alloc (); |
454 | } |
457 | } |
455 | |
458 | |
456 | /* |
459 | /* |
… | |
… | |
635 | case KW_per_player: thawer.get (per_player); break; |
638 | case KW_per_player: thawer.get (per_player); break; |
636 | case KW_per_party: thawer.get (per_party); break; |
639 | case KW_per_party: thawer.get (per_party); break; |
637 | case KW_no_reset: thawer.get (no_reset); break; |
640 | case KW_no_reset: thawer.get (no_reset); break; |
638 | case KW_no_drop: thawer.get (no_drop); break; |
641 | case KW_no_drop: thawer.get (no_drop); break; |
639 | |
642 | |
640 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
643 | case KW_region: default_region = region::find (thawer); break; |
641 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
644 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
642 | |
645 | |
643 | // old names new names |
646 | // old names new names |
644 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
647 | 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; |
648 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
… | |
… | |
663 | case KW_end: |
666 | case KW_end: |
664 | thawer.next (); |
667 | thawer.next (); |
665 | return true; |
668 | return true; |
666 | |
669 | |
667 | default: |
670 | default: |
668 | if (!thawer.parse_error ("map", 0)) |
671 | if (!thawer.parse_error ("map")) |
669 | return false; |
672 | return false; |
670 | break; |
673 | break; |
671 | } |
674 | } |
672 | |
675 | |
673 | thawer.next (); |
676 | thawer.next (); |
… | |
… | |
691 | int unique = 0; |
694 | int unique = 0; |
692 | for (object *op = spaces [i].bot; op; ) |
695 | for (object *op = spaces [i].bot; op; ) |
693 | { |
696 | { |
694 | object *above = op->above; |
697 | object *above = op->above; |
695 | |
698 | |
696 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
699 | if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE]) |
697 | unique = 1; |
700 | unique = 1; |
698 | |
701 | |
699 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
702 | if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique)) |
700 | op->destroy (); |
703 | op->destroy (); |
701 | |
704 | |
702 | op = above; |
705 | op = above; |
703 | } |
706 | } |
704 | } |
707 | } |
… | |
… | |
854 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
857 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
855 | for (object *above, *op = ms->bot; op; op = above) |
858 | for (object *above, *op = ms->bot; op; op = above) |
856 | { |
859 | { |
857 | above = op->above; |
860 | above = op->above; |
858 | |
861 | |
|
|
862 | // do not decay anything above unique floor tiles (yet :) |
|
|
863 | if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE]) |
|
|
864 | break; |
|
|
865 | |
859 | bool destroy = 0; |
866 | bool destroy = 0; |
860 | |
867 | |
861 | // do not decay anything above unique floor tiles (yet :) |
868 | if (op->flag [FLAG_IS_FLOOR] |
862 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
869 | || op->flag [FLAG_OBJ_ORIGINAL] |
863 | break; |
870 | || op->flag [FLAG_UNIQUE] |
864 | |
871 | || op->flag [FLAG_OVERLAY_FLOOR] |
865 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
872 | || 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 ()) |
873 | || op->is_alive ()) |
871 | ; // do not decay |
874 | ; // do not decay |
872 | else if (op->is_weapon ()) |
875 | else if (op->is_weapon ()) |
873 | { |
876 | { |
874 | op->stats.dam--; |
877 | op->stats.dam--; |
… | |
… | |
930 | sint64 total_exp = 0; |
933 | sint64 total_exp = 0; |
931 | |
934 | |
932 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
935 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
933 | for (object *op = ms->bot; op; op = op->above) |
936 | for (object *op = ms->bot; op; op = op->above) |
934 | { |
937 | { |
935 | if (QUERY_FLAG (op, FLAG_MONSTER)) |
938 | if (op->flag [FLAG_MONSTER]) |
936 | { |
939 | { |
937 | total_exp += op->stats.exp; |
940 | total_exp += op->stats.exp; |
938 | monster_cnt++; |
941 | monster_cnt++; |
939 | } |
942 | } |
940 | |
943 | |
941 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
944 | if (op->flag [FLAG_GENERATOR]) |
942 | { |
945 | { |
943 | total_exp += op->stats.exp; |
946 | total_exp += op->stats.exp; |
944 | |
947 | |
945 | if (archetype *at = op->other_arch) |
948 | if (archetype *at = op->other_arch) |
946 | { |
949 | { |
… | |
… | |
1128 | */ |
1131 | */ |
1129 | |
1132 | |
1130 | for (object *tmp = last; tmp; tmp = tmp->below) |
1133 | for (object *tmp = last; tmp; tmp = tmp->below) |
1131 | { |
1134 | { |
1132 | /* Once we get to a floor, stop, since we already have a floor object */ |
1135 | /* Once we get to a floor, stop, since we already have a floor object */ |
1133 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1136 | if (tmp->flag [FLAG_IS_FLOOR]) |
1134 | break; |
1137 | break; |
1135 | |
1138 | |
1136 | /* If two top faces are already set, quit processing */ |
1139 | /* If two top faces are already set, quit processing */ |
1137 | if (top && middle) |
1140 | if (top && middle) |
1138 | break; |
1141 | break; |
… | |
… | |
1421 | * |
1424 | * |
1422 | * currently, the only flag supported (0x1) is don't translate for |
1425 | * currently, the only flag supported (0x1) is don't translate for |
1423 | * closest body part of 'op1' |
1426 | * closest body part of 'op1' |
1424 | */ |
1427 | */ |
1425 | void |
1428 | void |
1426 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1429 | get_rangevector (object *op1, object *op2, rv_vector *retval, int flags) |
1427 | { |
1430 | { |
1428 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1431 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1429 | { |
1432 | { |
1430 | /* be conservative and fill in _some_ data */ |
1433 | /* be conservative and fill in _some_ data */ |
1431 | retval->distance = 10000; |
1434 | retval->distance = 10000; |
1432 | retval->distance_x = 10000; |
1435 | retval->distance_x = 10000; |
1433 | retval->distance_y = 10000; |
1436 | retval->distance_y = 10000; |
1434 | retval->direction = 0; |
1437 | retval->direction = 0; |
1435 | retval->part = 0; |
1438 | retval->part = 0; |
1436 | } |
1439 | } |
1437 | else |
1440 | else |
1438 | { |
1441 | { |
1439 | object *best; |
|
|
1440 | |
|
|
1441 | retval->distance_x += op2->x - op1->x; |
1442 | retval->distance_x += op2->x - op1->x; |
1442 | retval->distance_y += op2->y - op1->y; |
1443 | retval->distance_y += op2->y - op1->y; |
1443 | |
1444 | |
1444 | best = op1; |
1445 | object *best = op1; |
|
|
1446 | |
1445 | /* If this is multipart, find the closest part now */ |
1447 | /* If this is multipart, find the closest part now */ |
1446 | if (!(flags & 0x1) && op1->more) |
1448 | if (!(flags & 1) && op1->more) |
1447 | { |
1449 | { |
1448 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1450 | int best_distance = idistance (retval->distance_x, retval->distance_y); |
1449 | |
1451 | |
1450 | /* we just take the offset of the piece to head to figure |
1452 | /* we just take the offset of the piece to head to figure |
1451 | * distance instead of doing all that work above again |
1453 | * distance instead of doing all that work above again |
1452 | * since the distance fields we set above are positive in the |
1454 | * since the distance fields we set above are positive in the |
1453 | * same axis as is used for multipart objects, the simply arithmetic |
1455 | * same axis as is used for multipart objects, the simply arithmetic |
1454 | * below works. |
1456 | * below works. |
1455 | */ |
1457 | */ |
1456 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1458 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1457 | { |
1459 | { |
1458 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1460 | 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); |
1461 | |
1460 | if (tmpi < best_distance) |
1462 | if (tmpi < best_distance) |
1461 | { |
1463 | { |
1462 | best_distance = tmpi; |
1464 | best_distance = tmpi; |
1463 | best = tmp; |
1465 | best = tmp; |
1464 | } |
1466 | } |
1465 | } |
1467 | } |
1466 | |
1468 | |
1467 | if (best != op1) |
1469 | if (best != op1) |
1468 | { |
1470 | { |
1469 | retval->distance_x += op1->x - best->x; |
1471 | retval->distance_x += op1->x - best->x; |
1470 | retval->distance_y += op1->y - best->y; |
1472 | retval->distance_y += op1->y - best->y; |
1471 | } |
1473 | } |
1472 | } |
1474 | } |
1473 | |
1475 | |
1474 | retval->part = best; |
1476 | retval->part = best; |
1475 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1477 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1476 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1478 | retval->direction = find_dir_2 (retval->distance_x, retval->distance_y); |
1477 | } |
1479 | } |
1478 | } |
1480 | } |
1479 | |
1481 | |
1480 | /* this is basically the same as get_rangevector above, but instead of |
1482 | /* this is basically the same as get_rangevector above, but instead of |
1481 | * the first parameter being an object, it instead is the map |
1483 | * the first parameter being an object, it instead is the map |
… | |
… | |
1491 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1493 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1492 | { |
1494 | { |
1493 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1495 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1494 | { |
1496 | { |
1495 | /* be conservative and fill in _some_ data */ |
1497 | /* be conservative and fill in _some_ data */ |
1496 | retval->distance = 100000; |
1498 | retval->distance = 100000; |
1497 | retval->distance_x = 32767; |
1499 | retval->distance_x = 32767; |
1498 | retval->distance_y = 32767; |
1500 | retval->distance_y = 32767; |
1499 | retval->direction = 0; |
1501 | retval->direction = 0; |
1500 | retval->part = 0; |
1502 | retval->part = 0; |
1501 | } |
1503 | } |
1502 | else |
1504 | else |
1503 | { |
1505 | { |
1504 | retval->distance_x += op2->x - x; |
1506 | retval->distance_x += op2->x - x; |
1505 | retval->distance_y += op2->y - y; |
1507 | retval->distance_y += op2->y - y; |
1506 | |
1508 | |
1507 | retval->part = 0; |
1509 | retval->part = 0; |
1508 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1510 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1509 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1511 | retval->direction = find_dir_2 (retval->distance_x, retval->distance_y); |
1510 | } |
1512 | } |
1511 | } |
1513 | } |
1512 | |
1514 | |
1513 | /* Returns true of op1 and op2 are effectively on the same map |
1515 | /* 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 |
1516 | * (as related to map tiling). Note that this looks for a path from |
… | |
… | |
1564 | */ |
1566 | */ |
1565 | for (int i = 1000; --i;) |
1567 | for (int i = 1000; --i;) |
1566 | { |
1568 | { |
1567 | object *pick = at (gen (width), gen (height)).bot; |
1569 | object *pick = at (gen (width), gen (height)).bot; |
1568 | |
1570 | |
1569 | // do not prefer big monsters just because they are big. |
1571 | // must be head: do not prefer big monsters just because they are big. |
1570 | if (pick && pick->is_head ()) |
1572 | if (pick && pick->is_head ()) |
1571 | return pick->head_ (); |
1573 | return pick; |
1572 | } |
1574 | } |
1573 | |
1575 | |
1574 | // instead of crashing in the unlikely(?) case, try to return *something* |
1576 | // instead of crashing in the unlikely(?) case, try to return *something* |
1575 | return archetype::find (shstr_bug); |
1577 | return archetype::find (shstr_bug); |
1576 | } |
1578 | } |
… | |
… | |
1609 | |
1611 | |
1610 | if (distance <= MAX_SOUND_DISTANCE) |
1612 | if (distance <= MAX_SOUND_DISTANCE) |
1611 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1613 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1612 | } |
1614 | } |
1613 | } |
1615 | } |
|
|
1616 | |
|
|
1617 | dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25); |
1614 | |
1618 | |
1615 | static void |
1619 | static void |
1616 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
1620 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
1617 | { |
1621 | { |
1618 | // clip to map to the left |
1622 | // clip to map to the left |
… | |
… | |
1674 | r->dx = dx; |
1678 | r->dx = dx; |
1675 | r->dy = dy; |
1679 | r->dy = dy; |
1676 | } |
1680 | } |
1677 | |
1681 | |
1678 | maprect * |
1682 | maprect * |
1679 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
1683 | maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1) |
1680 | { |
1684 | { |
1681 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1682 | buf.clear (); |
1685 | buf.clear (); |
1683 | |
1686 | |
1684 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
1687 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
1685 | |
1688 | |
1686 | // add end marker |
1689 | // add end marker |