ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.142 by root, Sun May 18 17:52:53 2008 UTC vs.
Revision 1.186 by root, Tue Apr 13 02:39:52 2010 UTC

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 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 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24#include <unistd.h> 25#include <unistd.h>
25 26
26#include "global.h" 27#include "global.h"
27
28#include "loader.h"
29
30#include "path.h" 28#include "path.h"
29
30//+GPL
31
32sint8 maptile::outdoor_darkness;
31 33
32/* This rolls up wall, blocks_magic, blocks_view, etc, all into 34/* This rolls up wall, blocks_magic, blocks_view, etc, all into
33 * one function that just returns a P_.. value (see map.h) 35 * one function that just returns a P_.. value (see map.h)
34 * it will also do map translation for tiled maps, returning 36 * it will also do map translation for tiled maps, returning
35 * new values into newmap, nx, and ny. Any and all of those 37 * new values into newmap, nx, and ny. Any and all of those
… …
70 * by the caller. 72 * by the caller.
71 */ 73 */
72int 74int
73blocked_link (object *ob, maptile *m, int sx, int sy) 75blocked_link (object *ob, maptile *m, int sx, int sy)
74{ 76{
75 object *tmp;
76 int mflags, blocked;
77
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, "blocked_link: Passed map, x, y coordinates outside of map\n");
84 return 1; 83 return 1;
85 } 84 }
86 85
87 /* Save some cycles - instead of calling get_map_flags(), just get the value 86 mapspace &ms = m->at (sx, sy);
88 * directly.
89 */
90 mflags = m->at (sx, sy).flags ();
91 87
92 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 88 int mflags = ms.flags ();
89 int blocked = ms.move_block;
93 90
94 /* If space is currently not blocked by anything, no need to 91 /* If space is currently not blocked by anything, no need to
95 * go further. Not true for players - all sorts of special 92 * go further. Not true for players - all sorts of special
96 * things we need to do for players. 93 * things we need to do for players.
97 */ 94 */
98 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 95 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
99 return 0; 96 return 0;
100 97
101 /* if there isn't anytyhing alive on this space, and this space isn't 98 /* if there isn't anything alive on this space, and this space isn't
102 * 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
103 * 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
104 * or another. Likewise, only if something is blocking us do we 101 * or another. Likewise, only if something is blocking us do we
105 * need to investigate if there is a special circumstance that would 102 * need to investigate if there is a special circumstance that would
106 * let the player through (inventory checkers for example) 103 * let the player through (inventory checkers for example)
… …
113 /* 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
114 * 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
115 * true. If we get through the entire stack, that must mean 112 * true. If we get through the entire stack, that must mean
116 * ob is blocking it, so return 0. 113 * ob is blocking it, so return 0.
117 */ 114 */
118 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 115 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
119 { 116 {
120 117 if (OB_MOVE_BLOCK (ob, tmp))
121 /* This must be before the checks below. Code for inventory checkers. */
122 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
123 { 118 {
124 /* If last_sp is set, the player/monster needs an object, 119 if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
125 * so we check for it. If they don't have it, they can't 120 if (RESULT_INT (0))
126 * pass through this space. 121 return 1;
127 */ 122 else
128 if (tmp->last_sp) 123 continue;
124
125 if (tmp->type == CHECK_INV)
129 { 126 {
130 if (check_inv_recursive (ob, tmp) == NULL) 127 bool have = check_inv_recursive (ob, tmp);
128
129 // last_sp set means we block if we don't have.
130 if (logical_xor (have, tmp->last_sp))
131 return 1; 131 return 1;
132 else 132 }
133 continue; 133 else if (tmp->type == T_MATCH)
134 {
135 // T_MATCH allows "entrance" iff the match is true
136 // == blocks if the match fails
137
138 // we could have used an INVOKE_OBJECT, but decided against it, as we
139 // assume that T_MATCH is relatively common.
140 if (!match (tmp->slaying, ob, tmp, ob))
141 return 1;
134 } 142 }
135 else 143 else
136 { 144 return 1; // unconditional block
137 /* In this case, the player must not have the object - 145
138 * if they do, they can't pass through.
139 */
140 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
141 return 1;
142 else
143 continue;
144 }
145 } /* if check_inv */
146 else 146 } else {
147 { 147 // space does not block the ob, directly, but
148 /* Broke apart a big nasty if into several here to make 148 // anything alive that is not a door still
149 * this more readable. first check - if the space blocks 149 // blocks anything but wizards.
150 * movement, can't move here.
151 * second - if a monster, can't move there, unless it is a
152 * hidden dm
153 */
154 if (OB_MOVE_BLOCK (ob, tmp))
155 return 1;
156 150
157 if (tmp->flag [FLAG_ALIVE] 151 if (tmp->flag [FLAG_ALIVE]
158 && tmp->head_ () != ob 152 && tmp->head_ () != ob
159 && tmp != ob 153 && tmp != ob
160 && tmp->type != DOOR 154 && tmp->type != DOOR)
161 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
162 return 1; 155 return 1;
163 } 156 }
164
165 } 157 }
158
166 return 0; 159 return 0;
167} 160}
168 161
169/* 162/*
170 * Returns qthe blocking object if the given object can't fit in the given 163 * Returns qthe blocking object if the given object can't fit in the given
… …
222 } 215 }
223 216
224 return 0; 217 return 0;
225} 218}
226 219
227/* When the map is loaded, load_object does not actually insert objects 220//-GPL
228 * into inventory, but just links them. What this does is go through
229 * and insert them properly.
230 * The object 'container' is the object that contains the inventory.
231 * This is needed so that we can update the containers weight.
232 */
233void
234fix_container (object *container)
235{
236 object *tmp = container->inv, *next;
237
238 container->inv = 0;
239 while (tmp)
240 {
241 next = tmp->below;
242 if (tmp->inv)
243 fix_container (tmp);
244
245 insert_ob_in_ob (tmp, container);
246 tmp = next;
247 }
248
249 // go through and calculate what all the containers are carrying.
250 //TODO: remove
251 container->update_weight ();
252}
253 221
254void 222void
255maptile::set_object_flag (int flag, int value) 223maptile::set_object_flag (int flag, int value)
256{ 224{
257 if (!spaces) 225 if (!spaces)
… …
259 227
260 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 228 for (mapspace *ms = spaces + size (); ms-- > spaces; )
261 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 229 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
262 tmp->flag [flag] = value; 230 tmp->flag [flag] = value;
263} 231}
232
233void
234maptile::post_load_original ()
235{
236 if (!spaces)
237 return;
238
239 set_object_flag (FLAG_OBJ_ORIGINAL);
240
241 for (mapspace *ms = spaces + size (); ms-- > spaces; )
242 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
243 INVOKE_OBJECT (RESET, tmp);
244}
245
246void
247maptile::post_load ()
248{
249#if 0
250 if (!spaces)
251 return;
252
253 for (mapspace *ms = spaces + size (); ms-- > spaces; )
254 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
255 ; // nop
256#endif
257}
258
259//+GPL
264 260
265/* link_multipart_objects go through all the objects on the map looking 261/* link_multipart_objects go through all the objects on the map looking
266 * for objects whose arch says they are multipart yet according to the 262 * for objects whose arch says they are multipart yet according to the
267 * info we have, they only have the head (as would be expected when 263 * info we have, they only have the head (as would be expected when
268 * they are saved). 264 * they are saved).
… …
296 op = op->above; 292 op = op->above;
297 } 293 }
298 } 294 }
299} 295}
300 296
297//-GPL
298
301/* 299/*
302 * Loads (ands parses) the objects into a given map from the specified 300 * Loads (ands parses) the objects into a given map from the specified
303 * file pointer. 301 * file pointer.
304 */ 302 */
305bool 303bool
… …
321 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) 319 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
322 { 320 {
323 // we insert manually because 321 // we insert manually because
324 // a) its way faster 322 // a) its way faster
325 // b) we remove manually, too, and there are good reasons for that 323 // b) we remove manually, too, and there are good reasons for that
326 // c) its correct 324 // c) it's correct
327 mapspace &ms = at (op->x, op->y); 325 mapspace &ms = at (op->x, op->y);
328 326
329 op->flag [FLAG_REMOVED] = false; 327 op->flag [FLAG_REMOVED] = false;
330 328
331 op->above = 0; 329 op->above = 0;
332 op->below = ms.top; 330 op->below = ms.top;
333 331
334 if (ms.top)
335 ms.top->above = op; 332 *(ms.top ? &ms.top->above : &ms.bot) = op;
336 else
337 ms.bot = op;
338 333
339 ms.top = op; 334 ms.top = op;
340 ms.flags_ = 0; 335 ms.flags_ = 0;
341 } 336 }
342 else 337 else
… …
437 * map archetype. Mimic that behaviour. 432 * map archetype. Mimic that behaviour.
438 */ 433 */
439 width = 16; 434 width = 16;
440 height = 16; 435 height = 16;
441 timeout = 300; 436 timeout = 300;
442 max_nrof = 1000; // 1000 items of anything 437 max_items = MAX_ITEM_PER_ACTION;
443 max_volume = 2000000; // 2m³ 438 max_volume = 2000000; // 2m³
444} 439}
445 440
446maptile::maptile (int w, int h) 441maptile::maptile (int w, int h)
447{ 442{
… …
468 if (spaces) 463 if (spaces)
469 return; 464 return;
470 465
471 spaces = salloc0<mapspace> (size ()); 466 spaces = salloc0<mapspace> (size ());
472} 467}
468
469//+GPL
473 470
474/* Takes a string from a map definition and outputs a pointer to the array of shopitems 471/* Takes a string from a map definition and outputs a pointer to the array of shopitems
475 * corresponding to that string. Memory is allocated for this, it must be freed 472 * corresponding to that string. Memory is allocated for this, it must be freed
476 * at a later date. 473 * at a later date.
477 * Called by parse_map_headers below. 474 * Called by parse_map_headers below.
… …
554 return items; 551 return items;
555} 552}
556 553
557/* opposite of parse string, this puts the string that was originally fed in to 554/* opposite of parse string, this puts the string that was originally fed in to
558 * the map (or something equivilent) into output_string. */ 555 * the map (or something equivilent) into output_string. */
559static void 556static const char *
560print_shop_string (maptile *m, char *output_string) 557print_shop_string (maptile *m)
561{ 558{
562 int i; 559 static dynbuf_text buf; buf.clear ();
563 char tmp[MAX_BUF];
564 560
565 strcpy (output_string, "");
566 for (i = 0; i < m->shopitems[0].index; i++) 561 for (int i = 0; i < m->shopitems[0].index; i++)
567 { 562 {
568 if (m->shopitems[i].typenum) 563 if (m->shopitems[i].typenum)
569 { 564 {
570 if (m->shopitems[i].strength) 565 if (m->shopitems[i].strength)
571 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 566 buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
572 else 567 else
573 sprintf (tmp, "%s;", m->shopitems[i].name); 568 buf.printf ("%s;", m->shopitems[i].name);
574 } 569 }
575 else 570 else
576 { 571 {
577 if (m->shopitems[i].strength) 572 if (m->shopitems[i].strength)
578 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 573 buf.printf ("*:%d;", m->shopitems[i].strength);
579 else 574 else
580 sprintf (tmp, "*"); 575 buf.printf ("*");
581 } 576 }
582
583 strcat (output_string, tmp);
584 } 577 }
578
579 return buf;
585} 580}
581
582//-GPL
586 583
587/* This loads the header information of the map. The header 584/* This loads the header information of the map. The header
588 * contains things like difficulty, size, timeout, etc. 585 * contains things like difficulty, size, timeout, etc.
589 * this used to be stored in the map object, but with the 586 * this used to be stored in the map object, but with the
590 * addition of tiling, fields beyond that easily named in an 587 * addition of tiling, fields beyond that easily named in an
… …
631 case KW_shopgreed: thawer.get (shopgreed); break; 628 case KW_shopgreed: thawer.get (shopgreed); break;
632 case KW_shopmin: thawer.get (shopmin); break; 629 case KW_shopmin: thawer.get (shopmin); break;
633 case KW_shopmax: thawer.get (shopmax); break; 630 case KW_shopmax: thawer.get (shopmax); break;
634 case KW_shoprace: thawer.get (shoprace); break; 631 case KW_shoprace: thawer.get (shoprace); break;
635 case KW_outdoor: thawer.get (outdoor); break; 632 case KW_outdoor: thawer.get (outdoor); break;
636 case KW_temp: thawer.get (temp); break;
637 case KW_pressure: thawer.get (pressure); break;
638 case KW_humid: thawer.get (humid); break;
639 case KW_windspeed: thawer.get (windspeed); break;
640 case KW_winddir: thawer.get (winddir); break;
641 case KW_sky: thawer.get (sky); break;
642 633
643 case KW_per_player: thawer.get (per_player); break; 634 case KW_per_player: thawer.get (per_player); break;
644 case KW_per_party: thawer.get (per_party); break; 635 case KW_per_party: thawer.get (per_party); break;
645 case KW_no_reset: thawer.get (no_reset); break; 636 case KW_no_reset: thawer.get (no_reset); break;
646 case KW_no_drop: thawer.get (no_drop); break; 637 case KW_no_drop: thawer.get (no_drop); break;
… …
682 } 673 }
683 674
684 abort (); 675 abort ();
685} 676}
686 677
678//+GPL
679
687/****************************************************************************** 680/******************************************************************************
688 * This is the start of unique map handling code 681 * This is the start of unique map handling code
689 *****************************************************************************/ 682 *****************************************************************************/
690 683
691/* This goes through the maptile and removed any unique items on the map. */ 684/* This goes through the maptile and removed any unique items on the map. */
… …
697 int unique = 0; 690 int unique = 0;
698 for (object *op = spaces [i].bot; op; ) 691 for (object *op = spaces [i].bot; op; )
699 { 692 {
700 object *above = op->above; 693 object *above = op->above;
701 694
702 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 695 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
703 unique = 1; 696 unique = 1;
704 697
705 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 698 if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique))
706 {
707 op->destroy_inv (false);
708 op->destroy (); 699 op->destroy ();
709 }
710 700
711 op = above; 701 op = above;
712 } 702 }
713 } 703 }
714} 704}
715 705
706//-GPL
707
716bool 708bool
717maptile::_save_header (object_freezer &freezer) 709maptile::_save_header (object_freezer &freezer)
718{ 710{
719#define MAP_OUT(k) freezer.put (KW_ ## k, k) 711#define MAP_OUT(k) freezer.put (KW(k), k)
720#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 712#define MAP_OUT2(k,v) freezer.put (KW(k), v)
721 713
722 MAP_OUT2 (arch, "map"); 714 MAP_OUT2 (arch, CS(map));
723 715
724 if (name) MAP_OUT (name); 716 if (name) MAP_OUT (name);
725 MAP_OUT (swap_time); 717 MAP_OUT (swap_time);
726 MAP_OUT (reset_time); 718 MAP_OUT (reset_time);
727 MAP_OUT (reset_timeout); 719 MAP_OUT (reset_timeout);
728 MAP_OUT (fixed_resettime); 720 MAP_OUT (fixed_resettime);
729 MAP_OUT (no_reset); 721 MAP_OUT (no_reset);
730 MAP_OUT (no_drop); 722 MAP_OUT (no_drop);
731 MAP_OUT (difficulty); 723 MAP_OUT (difficulty);
732
733 if (default_region) MAP_OUT2 (region, default_region->name); 724 if (default_region) MAP_OUT2 (region, default_region->name);
734 725
735 if (shopitems) 726 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
736 {
737 char shop[MAX_BUF];
738 print_shop_string (this, shop);
739 MAP_OUT2 (shopitems, shop);
740 }
741
742 MAP_OUT (shopgreed); 727 MAP_OUT (shopgreed);
743 MAP_OUT (shopmin); 728 MAP_OUT (shopmin);
744 MAP_OUT (shopmax); 729 MAP_OUT (shopmax);
745 if (shoprace) MAP_OUT (shoprace); 730 if (shoprace) MAP_OUT (shoprace);
746 MAP_OUT (darkness); 731
747 MAP_OUT (width); 732 MAP_OUT (width);
748 MAP_OUT (height); 733 MAP_OUT (height);
749 MAP_OUT (enter_x); 734 MAP_OUT (enter_x);
750 MAP_OUT (enter_y); 735 MAP_OUT (enter_y);
751 736 MAP_OUT (darkness);
752 if (msg) freezer.put (KW_msg , KW_endmsg , msg);
753 if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
754
755 MAP_OUT (outdoor); 737 MAP_OUT (outdoor);
756 MAP_OUT (temp); 738
757 MAP_OUT (pressure); 739 if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
758 MAP_OUT (humid); 740 if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
759 MAP_OUT (windspeed);
760 MAP_OUT (winddir);
761 MAP_OUT (sky);
762 741
763 MAP_OUT (per_player); 742 MAP_OUT (per_player);
764 MAP_OUT (per_party); 743 MAP_OUT (per_party);
765 744
766 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); 745 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
767 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); 746 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
768 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); 747 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
769 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); 748 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
770 749
771 freezer.put (this); 750 freezer.put (this);
772 freezer.put (KW_end); 751 freezer.put (KW(end));
773 752
774 return true; 753 return true;
775} 754}
776 755
777bool 756bool
… …
782 if (!_save_header (freezer)) 761 if (!_save_header (freezer))
783 return false; 762 return false;
784 763
785 return freezer.save (path); 764 return freezer.save (path);
786} 765}
766
767//+GPL
787 768
788/* 769/*
789 * Remove and free all objects in the given map. 770 * Remove and free all objects in the given map.
790 */ 771 */
791void 772void
… …
802 783
803 op->flag [FLAG_REMOVED] = true; 784 op->flag [FLAG_REMOVED] = true;
804 785
805 object *head = op->head_ (); 786 object *head = op->head_ ();
806 if (op == head) 787 if (op == head)
807 {
808 op->destroy_inv (false);
809 op->destroy (); 788 op->destroy ();
810 }
811 else if (head->map != op->map) 789 else if (head->map != op->map)
812 { 790 {
813 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); 791 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
814 head->destroy (); 792 head->destroy ();
815 } 793 }
… …
863 841
864 clear (); 842 clear ();
865} 843}
866 844
867/* decay and destroy perishable items in a map */ 845/* decay and destroy perishable items in a map */
846// TODO: should be done regularly, not on map load?
868void 847void
869maptile::do_decay_objects () 848maptile::do_decay_objects ()
870{ 849{
871 if (!spaces) 850 if (!spaces)
872 return; 851 return;
… …
874 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 853 for (mapspace *ms = spaces + size (); ms-- > spaces; )
875 for (object *above, *op = ms->bot; op; op = above) 854 for (object *above, *op = ms->bot; op; op = above)
876 { 855 {
877 above = op->above; 856 above = op->above;
878 857
858 // do not decay anything above unique floor tiles (yet :)
859 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
860 break;
861
879 bool destroy = 0; 862 bool destroy = 0;
880 863
881 // do not decay anything above unique floor tiles (yet :) 864 if (op->flag [FLAG_IS_FLOOR]
882 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 865 || op->flag [FLAG_OBJ_ORIGINAL]
883 break; 866 || op->flag [FLAG_UNIQUE]
884 867 || op->flag [FLAG_OVERLAY_FLOOR]
885 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 868 || op->flag [FLAG_UNPAID]
886 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
887 || QUERY_FLAG (op, FLAG_UNIQUE)
888 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
889 || QUERY_FLAG (op, FLAG_UNPAID)
890 || op->is_alive ()) 869 || op->is_alive ())
891 ; // do not decay 870 ; // do not decay
892 else if (op->is_weapon ()) 871 else if (op->is_weapon ())
893 { 872 {
894 op->stats.dam--; 873 op->stats.dam--;
… …
919 || mat & M_LIQUID 898 || mat & M_LIQUID
920 || (mat & M_IRON && rndm (1, 5) == 1) 899 || (mat & M_IRON && rndm (1, 5) == 1)
921 || (mat & M_GLASS && rndm (1, 2) == 1) 900 || (mat & M_GLASS && rndm (1, 2) == 1)
922 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) 901 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
923 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) 902 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
924 || (mat & M_ICE && temp > 32)) 903 //|| (mat & M_ICE && temp > 32)
904 )
925 destroy = 1; 905 destroy = 1;
926 } 906 }
927 907
928 /* adjust overall chance below */ 908 /* adjust overall chance below */
929 if (destroy && rndm (0, 1)) 909 if (destroy && rndm (0, 1))
930 op->destroy (); 910 op->destroy ();
931 }
932}
933
934/*
935 * Updates every button on the map (by calling update_button() for them).
936 */
937void
938maptile::update_buttons ()
939{
940 for (oblinkpt *obp = buttons; obp; obp = obp->next)
941 for (objectlink *ol = obp->link; ol; ol = ol->next)
942 {
943 if (!ol->ob)
944 {
945 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
946 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
947 continue;
948 }
949
950 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
951 {
952 update_button (ol->ob);
953 break;
954 }
955 } 911 }
956} 912}
957 913
958/* 914/*
959 * This routine is supposed to find out the difficulty of the map. 915 * This routine is supposed to find out the difficulty of the map.
960 * difficulty does not have a lot to do with character level, 916 * difficulty does not have a lot to do with character level,
961 * but does have a lot to do with treasure on the map. 917 * but does have a lot to do with treasure on the map.
962 * 918 *
963 * Difficulty can now be set by the map creature. If the value stored 919 * Difficulty can now be set by the map creator. If the value stored
964 * in the map is zero, then use this routine. Maps should really 920 * in the map is zero, then use this routine. Maps should really
965 * have a difficulty set than using this function - human calculation 921 * have a difficulty set rather than using this function - human calculation
966 * is much better than this functions guesswork. 922 * is much better than this function's guesswork.
967 */ 923 */
968int 924int
969maptile::estimate_difficulty () const 925maptile::estimate_difficulty () const
970{ 926{
971 long monster_cnt = 0; 927 long monster_cnt = 0;
… …
973 sint64 total_exp = 0; 929 sint64 total_exp = 0;
974 930
975 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 931 for (mapspace *ms = spaces + size (); ms-- > spaces; )
976 for (object *op = ms->bot; op; op = op->above) 932 for (object *op = ms->bot; op; op = op->above)
977 { 933 {
978 if (QUERY_FLAG (op, FLAG_MONSTER)) 934 if (op->flag [FLAG_MONSTER])
979 { 935 {
980 total_exp += op->stats.exp; 936 total_exp += op->stats.exp;
981 monster_cnt++; 937 monster_cnt++;
982 } 938 }
983 939
984 if (QUERY_FLAG (op, FLAG_GENERATOR)) 940 if (op->flag [FLAG_GENERATOR])
985 { 941 {
986 total_exp += op->stats.exp; 942 total_exp += op->stats.exp;
987 943
988 if (archetype *at = op->other_arch) 944 if (archetype *at = op->other_arch)
989 { 945 {
… …
1016 * postive values make it darker, negative make it brighter 972 * postive values make it darker, negative make it brighter
1017 */ 973 */
1018int 974int
1019maptile::change_map_light (int change) 975maptile::change_map_light (int change)
1020{ 976{
1021 int new_level = darkness + change;
1022
1023 /* Nothing to do */ 977 /* Nothing to do */
1024 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 978 if (!change)
1025 return 0; 979 return 0;
1026 980
1027 /* inform all players on the map */ 981 /* inform all players on the map */
1028 if (change > 0) 982 if (change > 0)
1029 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 983 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1030 else 984 else
1031 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 985 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1032 986
1033 /* Do extra checking. since darkness is a unsigned value, 987 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1034 * we need to be extra careful about negative values.
1035 * In general, the checks below are only needed if change
1036 * is not +/-1
1037 */
1038 if (new_level < 0)
1039 darkness = 0;
1040 else if (new_level >= MAX_DARKNESS)
1041 darkness = MAX_DARKNESS;
1042 else
1043 darkness = new_level;
1044 988
1045 /* All clients need to get re-updated for the change */ 989 /* All clients need to get re-updated for the change */
1046 update_all_map_los (this); 990 update_all_map_los (this);
1047 991
1048 return 1; 992 return 1;
… …
1056 */ 1000 */
1057void 1001void
1058mapspace::update_ () 1002mapspace::update_ ()
1059{ 1003{
1060 object *last = 0; 1004 object *last = 0;
1061 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1005 uint8 flags = P_UPTODATE;
1006 sint8 light = 0;
1062 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1007 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1008 uint64_t volume = 0;
1009 uint32_t items = 0;
1010 object *anywhere = 0;
1011 uint8_t middle_visibility = 0;
1063 1012
1064 //object *middle = 0; 1013 //object *middle = 0;
1065 //object *top = 0; 1014 //object *top = 0;
1066 //object *floor = 0; 1015 //object *floor = 0;
1067 // this seems to generate better code than using locals, above 1016 // this seems to generate better code than using locals, above
1068 object *&top = faces_obj[0] = 0; 1017 object *&top = faces_obj[0] = 0;
1069 object *&middle = faces_obj[1] = 0; 1018 object *&middle = faces_obj[1] = 0;
1070 object *&floor = faces_obj[2] = 0; 1019 object *&floor = faces_obj[2] = 0;
1071 1020
1021 object::flags_t allflags; // all flags of all objects or'ed together
1022
1072 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) 1023 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1073 { 1024 {
1074 /* This could be made additive I guess (two lights better than 1025 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1075 * one). But if so, it shouldn't be a simple additive - 2
1076 * light bulbs do not illuminate twice as far as once since
1077 * it is a dissapation factor that is cubed.
1078 */
1079 light = max (light, tmp->glow_radius); 1026 light += tmp->glow_radius;
1080 1027
1081 /* This call is needed in order to update objects the player 1028 /* This call is needed in order to update objects the player
1082 * is standing in that have animations (ie, grass, fire, etc). 1029 * is standing in that have animations (ie, grass, fire, etc).
1083 * However, it also causes the look window to be re-drawn 1030 * However, it also causes the look window to be re-drawn
1084 * 3 times each time the player moves, because many of the 1031 * 3 times each time the player moves, because many of the
1085 * functions the move_player calls eventualy call this. 1032 * functions the move_player calls eventualy call this.
1086 * 1033 *
1087 * Always put the player down for drawing. 1034 * Always put the player down for drawing.
1088 */ 1035 */
1089 if (!tmp->invisible) 1036 if (expect_true (!tmp->invisible))
1090 { 1037 {
1091 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1038 if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1092 top = tmp; 1039 top = tmp;
1093 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1040 else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1094 { 1041 {
1095 /* If we got a floor, that means middle and top were below it, 1042 /* If we got a floor, that means middle and top were below it,
1096 * so should not be visible, so we clear them. 1043 * so should not be visible, so we clear them.
1097 */ 1044 */
1098 middle = 0; 1045 middle = 0;
1099 top = 0; 1046 top = 0;
1100 floor = tmp; 1047 floor = tmp;
1048 volume = 0;
1049 items = 0;
1101 } 1050 }
1102 /* Flag anywhere have high priority */ 1051 else
1103 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1104 { 1052 {
1053 if (expect_true (!tmp->flag [FLAG_NO_PICK]))
1054 {
1055 ++items;
1056 volume += tmp->volume ();
1057 }
1058
1059 /* Flag anywhere have high priority */
1060 if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1061 anywhere = tmp;
1062
1063 /* Find the highest visible face around. If equal
1064 * visibilities, we still want the one nearer to the
1065 * top
1066 */
1067 if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
1068 {
1069 middle_visibility = ::faces [tmp->face].visibility;
1105 middle = tmp; 1070 middle = tmp;
1106 anywhere = 1; 1071 }
1107 } 1072 }
1108 /* Find the highest visible face around. If equal
1109 * visibilities, we still want the one nearer to the
1110 * top
1111 */
1112 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1113 middle = tmp;
1114 }
1115
1116 if (tmp == tmp->above)
1117 {
1118 LOG (llevError, "Error in structure of map\n");
1119 exit (-1);
1120 } 1073 }
1121 1074
1122 move_slow |= tmp->move_slow; 1075 move_slow |= tmp->move_slow;
1123 move_block |= tmp->move_block; 1076 move_block |= tmp->move_block;
1124 move_on |= tmp->move_on; 1077 move_on |= tmp->move_on;
1125 move_off |= tmp->move_off; 1078 move_off |= tmp->move_off;
1126 move_allow |= tmp->move_allow; 1079 move_allow |= tmp->move_allow;
1127 1080
1128 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; 1081 allflags |= tmp->flag;
1129 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; 1082
1130 if (tmp->type == PLAYER) flags |= P_PLAYER; 1083 if (tmp->type == PLAYER) flags |= P_PLAYER;
1131 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1084 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1132 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1133 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1134 } 1085 }
1135 1086
1136 this->light = light; 1087 // FLAG_SEE_ANYWHERE takes precedence
1088 if (anywhere)
1089 middle = anywhere;
1090
1091 // ORing all flags together and checking them here is much faster
1092 if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
1093 if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
1094 if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
1095 if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
1096
1097 this->light = min (light, MAX_LIGHT_RADIUS);
1137 this->flags_ = flags; 1098 this->flags_ = flags;
1138 this->move_block = move_block & ~move_allow; 1099 this->move_block = move_block & ~move_allow;
1139 this->move_on = move_on; 1100 this->move_on = move_on;
1140 this->move_off = move_off; 1101 this->move_off = move_off;
1141 this->move_slow = move_slow; 1102 this->move_slow = move_slow;
1103 this->volume_ = (volume + 1023) / 1024;
1104 this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1142 1105
1143 /* At this point, we have a floor face (if there is a floor), 1106 /* At this point, we have a floor face (if there is a floor),
1144 * and the floor is set - we are not going to touch it at 1107 * and the floor is set - we are not going to touch it at
1145 * this point. 1108 * this point.
1146 * middle contains the highest visibility face. 1109 * middle contains the highest visibility face.
… …
1164 */ 1127 */
1165 1128
1166 for (object *tmp = last; tmp; tmp = tmp->below) 1129 for (object *tmp = last; tmp; tmp = tmp->below)
1167 { 1130 {
1168 /* Once we get to a floor, stop, since we already have a floor object */ 1131 /* Once we get to a floor, stop, since we already have a floor object */
1169 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1132 if (tmp->flag [FLAG_IS_FLOOR])
1170 break; 1133 break;
1171 1134
1172 /* If two top faces are already set, quit processing */ 1135 /* If two top faces are already set, quit processing */
1173 if (top && middle) 1136 if (top && middle)
1174 break; 1137 break;
… …
1212 faces_obj [1] = middle; 1175 faces_obj [1] = middle;
1213 faces_obj [2] = floor; 1176 faces_obj [2] = floor;
1214#endif 1177#endif
1215} 1178}
1216 1179
1217uint64 1180maptile *
1218mapspace::volume () const
1219{
1220 uint64 vol = 0;
1221
1222 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1223 vol += op->volume ();
1224
1225 return vol;
1226}
1227
1228bool
1229maptile::tile_available (int dir, bool load) 1181maptile::tile_available (int dir, bool load)
1230{ 1182{
1231 if (!tile_path[dir]) 1183 if (tile_path[dir])
1232 return 0; 1184 {
1233
1234 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) 1185 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1235 return 1; 1186 return tile_map[dir];
1236 1187
1237 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1188 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1238 return 1; 1189 return tile_map[dir];
1190 }
1239 1191
1240 return 0; 1192 return 0;
1241} 1193}
1242 1194
1243/* this returns TRUE if the coordinates (x,y) are out of 1195/* this returns TRUE if the coordinates (x,y) are out of
… …
1468 * 1420 *
1469 * currently, the only flag supported (0x1) is don't translate for 1421 * currently, the only flag supported (0x1) is don't translate for
1470 * closest body part of 'op1' 1422 * closest body part of 'op1'
1471 */ 1423 */
1472void 1424void
1473get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1425get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
1474{ 1426{
1475 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1427 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1476 { 1428 {
1477 /* be conservative and fill in _some_ data */ 1429 /* be conservative and fill in _some_ data */
1478 retval->distance = 10000; 1430 retval->distance = 10000;
… …
1481 retval->direction = 0; 1433 retval->direction = 0;
1482 retval->part = 0; 1434 retval->part = 0;
1483 } 1435 }
1484 else 1436 else
1485 { 1437 {
1486 object *best;
1487
1488 retval->distance_x += op2->x - op1->x; 1438 retval->distance_x += op2->x - op1->x;
1489 retval->distance_y += op2->y - op1->y; 1439 retval->distance_y += op2->y - op1->y;
1490 1440
1491 best = op1; 1441 object *best = op1;
1442
1492 /* If this is multipart, find the closest part now */ 1443 /* If this is multipart, find the closest part now */
1493 if (!(flags & 0x1) && op1->more) 1444 if (!(flags & 1) && op1->more)
1494 { 1445 {
1495 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1446 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1496 1447
1497 /* we just take the offset of the piece to head to figure 1448 /* we just take the offset of the piece to head to figure
1498 * distance instead of doing all that work above again 1449 * distance instead of doing all that work above again
… …
1549 else 1500 else
1550 { 1501 {
1551 retval->distance_x += op2->x - x; 1502 retval->distance_x += op2->x - x;
1552 retval->distance_y += op2->y - y; 1503 retval->distance_y += op2->y - y;
1553 1504
1554 retval->part = NULL; 1505 retval->part = 0;
1555 retval->distance = idistance (retval->distance_x, retval->distance_y); 1506 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1556 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1507 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1557 } 1508 }
1558} 1509}
1559 1510
1560/* Returns true of op1 and op2 are effectively on the same map 1511/* Returns true of op1 and op2 are effectively on the same map
… …
1571 int dx, dy; 1522 int dx, dy;
1572 1523
1573 return adjacent_map (op1->map, op2->map, &dx, &dy); 1524 return adjacent_map (op1->map, op2->map, &dx, &dy);
1574} 1525}
1575 1526
1527//-GPL
1528
1576object * 1529object *
1577maptile::insert (object *op, int x, int y, object *originator, int flags) 1530maptile::insert (object *op, int x, int y, object *originator, int flags)
1578{ 1531{
1579 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1532 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1580} 1533}
… …
1591 if (default_region) 1544 if (default_region)
1592 return default_region; 1545 return default_region;
1593 1546
1594 return ::region::default_region (); 1547 return ::region::default_region ();
1595} 1548}
1549
1550//+GPL
1596 1551
1597/* picks a random object from a style map. 1552/* picks a random object from a style map.
1598 */ 1553 */
1599object * 1554object *
1600maptile::pick_random_object (rand_gen &gen) const 1555maptile::pick_random_object (rand_gen &gen) const
… …
1607 */ 1562 */
1608 for (int i = 1000; --i;) 1563 for (int i = 1000; --i;)
1609 { 1564 {
1610 object *pick = at (gen (width), gen (height)).bot; 1565 object *pick = at (gen (width), gen (height)).bot;
1611 1566
1612 // do not prefer big monsters just because they are big. 1567 // must be head: do not prefer big monsters just because they are big.
1613 if (pick && pick->is_head ()) 1568 if (pick && pick->is_head ())
1614 return pick->head_ (); 1569 return pick;
1615 } 1570 }
1616 1571
1617 // instead of crashing in the unlikely(?) case, try to return *something* 1572 // instead of crashing in the unlikely(?) case, try to return *something*
1618 return archetype::find ("bug"); 1573 return archetype::find (shstr_bug);
1619} 1574}
1575
1576//-GPL
1620 1577
1621void 1578void
1622maptile::play_sound (faceidx sound, int x, int y) const 1579maptile::play_sound (faceidx sound, int x, int y) const
1623{ 1580{
1624 if (!sound) 1581 if (!sound)
1625 return; 1582 return;
1626 1583
1584 for_all_players_on_map (pl, this)
1585 if (client *ns = pl->ns)
1586 {
1587 int dx = x - pl->ob->x;
1588 int dy = y - pl->ob->y;
1589
1590 int distance = idistance (dx, dy);
1591
1592 if (distance <= MAX_SOUND_DISTANCE)
1593 ns->play_sound (sound, dx, dy);
1594 }
1595}
1596
1597void
1598maptile::say_msg (const char *msg, int x, int y) const
1599{
1627 for_all_players (pl) 1600 for_all_players (pl)
1628 if (pl->ob->map == this)
1629 if (client *ns = pl->ns) 1601 if (client *ns = pl->ns)
1630 { 1602 {
1631 int dx = x - pl->ob->x; 1603 int dx = x - pl->ob->x;
1632 int dy = y - pl->ob->y; 1604 int dy = y - pl->ob->y;
1633 1605
1634 int distance = idistance (dx, dy); 1606 int distance = idistance (dx, dy);
1635 1607
1636 if (distance <= MAX_SOUND_DISTANCE) 1608 if (distance <= MAX_SOUND_DISTANCE)
1637 ns->play_sound (sound, dx, dy); 1609 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1638 } 1610 }
1639} 1611}
1640 1612
1613dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
1614
1615static void
1616split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1617{
1618 // clip to map to the left
1619 if (x0 < 0)
1620 {
1621 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1622 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1623
1624 if (x1 < 0) // entirely to the left
1625 return;
1626
1627 x0 = 0;
1628 }
1629
1630 // clip to map to the right
1631 if (x1 > m->width)
1632 {
1633 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1634 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1635
1636 if (x0 > m->width) // entirely to the right
1637 return;
1638
1639 x1 = m->width;
1640 }
1641
1642 // clip to map above
1643 if (y0 < 0)
1644 {
1645 if (maptile *tile = m->tile_available (TILE_UP, 1))
1646 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1647
1648 if (y1 < 0) // entirely above
1649 return;
1650
1651 y0 = 0;
1652 }
1653
1654 // clip to map below
1655 if (y1 > m->height)
1656 {
1657 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1658 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1659
1660 if (y0 > m->height) // entirely below
1661 return;
1662
1663 y1 = m->height;
1664 }
1665
1666 // if we get here, the rect is within the current map
1667 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1668
1669 r->m = m;
1670 r->x0 = x0;
1671 r->y0 = y0;
1672 r->x1 = x1;
1673 r->y1 = y1;
1674 r->dx = dx;
1675 r->dy = dy;
1676}
1677
1678maprect *
1679maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
1680{
1681 buf.clear ();
1682
1683 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1684
1685 // add end marker
1686 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1687 r->m = 0;
1688
1689 return (maprect *)buf.linearise ();
1690}
1691

Diff Legend

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