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.117 by root, Fri Aug 24 00:26:09 2007 UTC vs.
Revision 1.148 by root, Mon Sep 29 10:31:32 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your 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,
… …
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 GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24#include <unistd.h> 24#include <unistd.h>
25 25
26#include "global.h" 26#include "global.h"
27#include "funcpoint.h"
28
29#include "loader.h" 27#include "loader.h"
30
31#include "path.h" 28#include "path.h"
32 29
33/* This rolls up wall, blocks_magic, blocks_view, etc, all into 30/* This rolls up wall, blocks_magic, blocks_view, etc, all into
34 * one function that just returns a P_.. value (see map.h) 31 * one function that just returns a P_.. value (see map.h)
35 * it will also do map translation for tiled maps, returning 32 * it will also do map translation for tiled maps, returning
… …
166 } 163 }
167 return 0; 164 return 0;
168} 165}
169 166
170/* 167/*
171 * Returns true if the given object can't fit in the given spot. 168 * Returns qthe blocking object if the given object can't fit in the given
172 * This is meant for multi space objects - for single space objecs, 169 * spot. This is meant for multi space objects - for single space objecs,
173 * just calling get_map_blocked and checking that against movement type 170 * just calling get_map_blocked and checking that against movement type
174 * of object. This function goes through all the parts of the 171 * of object. This function goes through all the parts of the multipart
175 * multipart object and makes sure they can be inserted. 172 * object and makes sure they can be inserted.
176 * 173 *
177 * While this doesn't call out of map, the get_map_flags does. 174 * While this doesn't call out of map, the get_map_flags does.
178 * 175 *
179 * This function has been used to deprecate arch_out_of_map - 176 * This function has been used to deprecate arch_out_of_map -
180 * this function also does that check, and since in most cases, 177 * this function also does that check, and since in most cases,
… …
191 * 188 *
192 * Note this used to be arch_blocked, but with new movement 189 * Note this used to be arch_blocked, but with new movement
193 * code, we need to have actual object to check its move_type 190 * code, we need to have actual object to check its move_type
194 * against the move_block values. 191 * against the move_block values.
195 */ 192 */
196int 193bool
197ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 194object::blocked (maptile *m, int x, int y) const
198{ 195{
199 archetype *tmp; 196 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
200 int flag;
201 maptile *m1;
202 sint16 sx, sy;
203
204 if (!ob)
205 {
206 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
207 if (flag & P_OUT_OF_MAP)
208 return P_OUT_OF_MAP;
209
210 /* don't have object, so don't know what types would block */
211 return m1->at (sx, sy).move_block;
212 } 197 {
198 mapxy pos (m, x + tmp->x, y + tmp->y);
213 199
214 for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) 200 if (!pos.normalise ())
215 { 201 return 1;
216 flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
217 202
218 if (flag & P_OUT_OF_MAP) 203 mapspace &ms = *pos;
219 return P_OUT_OF_MAP; 204
220 if (flag & P_IS_ALIVE) 205 if (ms.flags () & P_IS_ALIVE)
221 return P_IS_ALIVE; 206 return 1;
222 207
223 mapspace &ms = m1->at (sx, sy); 208 /* However, often ob doesn't have any move type
224 209 * (signifying non-moving objects)
225 /* find_first_free_spot() calls this function. However, often
226 * ob doesn't have any move type (when used to place exits)
227 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 210 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
228 */ 211 */
229
230 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 212 if (!move_type && ms.move_block != MOVE_ALL)
231 continue; 213 continue;
232 214
233 /* Note it is intentional that we check ob - the movement type of the 215 /* Note it is intentional that we check ob - the movement type of the
234 * head of the object should correspond for the entire object. 216 * head of the object should correspond for the entire object.
235 */ 217 */
236 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 218 if (ms.blocks (move_type))
237 return P_NO_PASS; 219 return 1;
238 } 220 }
239 221
240 return 0; 222 return 0;
241} 223}
242 224
… …
260 242
261 insert_ob_in_ob (tmp, container); 243 insert_ob_in_ob (tmp, container);
262 tmp = next; 244 tmp = next;
263 } 245 }
264 246
265 /* sum_weight will go through and calculate what all the containers are 247 // go through and calculate what all the containers are carrying.
266 * carrying. 248 //TODO: remove
267 */ 249 container->update_weight ();
268 sum_weight (container);
269} 250}
270 251
271void 252void
272maptile::set_object_flag (int flag, int value) 253maptile::set_object_flag (int flag, int value)
273{ 254{
… …
275 return; 256 return;
276 257
277 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 258 for (mapspace *ms = spaces + size (); ms-- > spaces; )
278 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 259 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
279 tmp->flag [flag] = value; 260 tmp->flag [flag] = value;
261}
262
263void
264maptile::post_load_original ()
265{
266 if (!spaces)
267 return;
268
269 set_object_flag (FLAG_OBJ_ORIGINAL);
270
271 for (mapspace *ms = spaces + size (); ms-- > spaces; )
272 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
273 INVOKE_OBJECT (RESET, tmp);
280} 274}
281 275
282/* link_multipart_objects go through all the objects on the map looking 276/* link_multipart_objects go through all the objects on the map looking
283 * for objects whose arch says they are multipart yet according to the 277 * for objects whose arch says they are multipart yet according to the
284 * info we have, they only have the head (as would be expected when 278 * info we have, they only have the head (as would be expected when
… …
322bool 316bool
323maptile::_load_objects (object_thawer &f) 317maptile::_load_objects (object_thawer &f)
324{ 318{
325 for (;;) 319 for (;;)
326 { 320 {
327 coroapi::cede_to_tick_every (100); // cede once in a while 321 coroapi::cede_to_tick (); // cede once in a while
328 322
329 switch (f.kw) 323 switch (f.kw)
330 { 324 {
331 case KW_arch: 325 case KW_arch:
332 if (object *op = object::read (f, this)) 326 if (object *op = object::read (f, this))
333 { 327 {
328 // TODO: why?
334 if (op->inv) 329 if (op->inv)
335 sum_weight (op); 330 op->update_weight ();
336 331
337 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 332 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
333 {
334 // we insert manually because
335 // a) its way faster
336 // b) we remove manually, too, and there are good reasons for that
337 // c) its correct
338 mapspace &ms = at (op->x, op->y);
339
340 op->flag [FLAG_REMOVED] = false;
341
342 op->above = 0;
343 op->below = ms.top;
344
345 if (ms.top)
346 ms.top->above = op;
347 else
348 ms.bot = op;
349
350 ms.top = op;
351 ms.flags_ = 0;
352 }
353 else
354 {
355 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
356 op->destroy ();
357 }
338 } 358 }
339 359
340 continue; 360 continue;
341 361
342 case KW_EOF: 362 case KW_EOF:
… …
383 if (!spaces) 403 if (!spaces)
384 return false; 404 return false;
385 405
386 for (int i = 0; i < size (); ++i) 406 for (int i = 0; i < size (); ++i)
387 { 407 {
388 int unique = 0; 408 bool unique = 0;
409
389 for (object *op = spaces [i].bot; op; op = op->above) 410 for (object *op = spaces [i].bot; op; op = op->above)
390 { 411 {
391 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 412 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
392 unique = 1;
393 413
394 if (!op->can_map_save ()) 414 if (expect_false (!op->can_map_save ()))
395 continue; 415 continue;
396 416
397 if (unique || op->flag [FLAG_UNIQUE]) 417 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
398 { 418 {
399 if (flags & IO_UNIQUES) 419 if (flags & IO_UNIQUES)
400 op->write (f); 420 op->write (f);
401 } 421 }
402 else if (flags & IO_OBJECTS) 422 else if (expect_true (flags & IO_OBJECTS))
403 op->write (f); 423 op->write (f);
404 } 424 }
405 } 425 }
406 426
407 coroapi::cede_to_tick (); 427 coroapi::cede_to_tick ();
408 428
409 return true; 429 return true;
410}
411
412bool
413maptile::_load_objects (const char *path, bool skip_header)
414{
415 object_thawer f (path);
416
417 if (!f)
418 return false;
419
420 f.next ();
421
422 if (skip_header)
423 for (;;)
424 {
425 keyword kw = f.kw;
426 f.skip ();
427 if (kw == KW_end)
428 break;
429 }
430
431 return _load_objects (f);
432} 430}
433 431
434bool 432bool
435maptile::_save_objects (const char *path, int flags) 433maptile::_save_objects (const char *path, int flags)
436{ 434{
… …
611bool 609bool
612maptile::_load_header (object_thawer &thawer) 610maptile::_load_header (object_thawer &thawer)
613{ 611{
614 for (;;) 612 for (;;)
615 { 613 {
616 thawer.next ();
617
618 switch (thawer.kw) 614 switch (thawer.kw)
619 { 615 {
620 case KW_msg: 616 case KW_msg:
621 thawer.get_ml (KW_endmsg, msg); 617 thawer.get_ml (KW_endmsg, msg);
622 break; 618 break;
… …
656 case KW_sky: thawer.get (sky); break; 652 case KW_sky: thawer.get (sky); break;
657 653
658 case KW_per_player: thawer.get (per_player); break; 654 case KW_per_player: thawer.get (per_player); break;
659 case KW_per_party: thawer.get (per_party); break; 655 case KW_per_party: thawer.get (per_party); break;
660 case KW_no_reset: thawer.get (no_reset); break; 656 case KW_no_reset: thawer.get (no_reset); break;
657 case KW_no_drop: thawer.get (no_drop); break;
661 658
662 case KW_region: default_region = region::find (thawer.get_str ()); break; 659 case KW_region: default_region = region::find (thawer.get_str ()); break;
663 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 660 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
664 661
665 // old names new names 662 // old names new names
… …
677 case KW_tile_path_2: thawer.get (tile_path [1]); break; 674 case KW_tile_path_2: thawer.get (tile_path [1]); break;
678 case KW_tile_path_3: thawer.get (tile_path [2]); break; 675 case KW_tile_path_3: thawer.get (tile_path [2]); break;
679 case KW_tile_path_4: thawer.get (tile_path [3]); break; 676 case KW_tile_path_4: thawer.get (tile_path [3]); break;
680 677
681 case KW_ERROR: 678 case KW_ERROR:
682 set_key (thawer.kw_str, thawer.value); 679 set_key_text (thawer.kw_str, thawer.value);
683 break; 680 break;
684 681
685 case KW_end: 682 case KW_end:
683 thawer.next ();
686 return true; 684 return true;
687 685
688 default: 686 default:
689 if (!thawer.parse_error ("map", 0)) 687 if (!thawer.parse_error ("map", 0))
690 return false; 688 return false;
691 break; 689 break;
692 } 690 }
691
692 thawer.next ();
693 } 693 }
694 694
695 abort (); 695 abort ();
696}
697
698bool
699maptile::_load_header (const char *path)
700{
701 object_thawer thawer (path);
702
703 if (!thawer)
704 return false;
705
706 return _load_header (thawer);
707} 696}
708 697
709/****************************************************************************** 698/******************************************************************************
710 * This is the start of unique map handling code 699 * This is the start of unique map handling code
711 *****************************************************************************/ 700 *****************************************************************************/
… …
723 712
724 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 713 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
725 unique = 1; 714 unique = 1;
726 715
727 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 716 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
728 {
729 op->destroy_inv (false);
730 op->destroy (); 717 op->destroy ();
731 }
732 718
733 op = above; 719 op = above;
734 } 720 }
735 } 721 }
736} 722}
… …
747 MAP_OUT (swap_time); 733 MAP_OUT (swap_time);
748 MAP_OUT (reset_time); 734 MAP_OUT (reset_time);
749 MAP_OUT (reset_timeout); 735 MAP_OUT (reset_timeout);
750 MAP_OUT (fixed_resettime); 736 MAP_OUT (fixed_resettime);
751 MAP_OUT (no_reset); 737 MAP_OUT (no_reset);
738 MAP_OUT (no_drop);
752 MAP_OUT (difficulty); 739 MAP_OUT (difficulty);
753 740
754 if (default_region) MAP_OUT2 (region, default_region->name); 741 if (default_region) MAP_OUT2 (region, default_region->name);
755 742
756 if (shopitems) 743 if (shopitems)
… …
810 * Remove and free all objects in the given map. 797 * Remove and free all objects in the given map.
811 */ 798 */
812void 799void
813maptile::clear () 800maptile::clear ()
814{ 801{
815 sfree (regions, size ()); regions = 0;
816 delete [] regionmap; regionmap = 0;
817
818 if (spaces) 802 if (spaces)
819 { 803 {
820 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 804 for (mapspace *ms = spaces + size (); ms-- > spaces; )
821 while (object *op = ms->bot) 805 while (object *op = ms->bot)
822 { 806 {
807 // manually remove, as to not trigger anything
808 if (ms->bot = op->above)
809 ms->bot->below = 0;
810
811 op->flag [FLAG_REMOVED] = true;
812
823 op = op->head_ (); 813 object *head = op->head_ ();
824 op->destroy_inv (false); 814 if (op == head)
825 op->destroy (); 815 op->destroy ();
816 else if (head->map != op->map)
817 {
818 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
819 head->destroy ();
820 }
826 } 821 }
827 822
828 sfree (spaces, size ()), spaces = 0; 823 sfree0 (spaces, size ());
829 } 824 }
830 825
831 if (buttons) 826 if (buttons)
832 free_objectlinkpt (buttons), buttons = 0; 827 free_objectlinkpt (buttons), buttons = 0;
828
829 sfree0 (regions, size ());
830 delete [] regionmap; regionmap = 0;
833} 831}
834 832
835void 833void
836maptile::clear_header () 834maptile::clear_header ()
837{ 835{
… …
889 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 887 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
890 break; 888 break;
891 889
892 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 890 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
893 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) 891 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
894 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
895 || QUERY_FLAG (op, FLAG_UNIQUE) 892 || QUERY_FLAG (op, FLAG_UNIQUE)
896 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) 893 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
897 || QUERY_FLAG (op, FLAG_UNPAID) 894 || QUERY_FLAG (op, FLAG_UNPAID)
898 || op->is_alive ()) 895 || op->is_alive ())
899 ; // do not decay 896 ; // do not decay
… …
933 destroy = 1; 930 destroy = 1;
934 } 931 }
935 932
936 /* adjust overall chance below */ 933 /* adjust overall chance below */
937 if (destroy && rndm (0, 1)) 934 if (destroy && rndm (0, 1))
938 op->destroy (); 935 op->destroy (true);
939 } 936 }
940} 937}
941 938
942/* 939/*
943 * Updates every button on the map (by calling update_button() for them). 940 * Updates every button on the map (by calling update_button() for them).
… …
991 988
992 if (QUERY_FLAG (op, FLAG_GENERATOR)) 989 if (QUERY_FLAG (op, FLAG_GENERATOR))
993 { 990 {
994 total_exp += op->stats.exp; 991 total_exp += op->stats.exp;
995 992
996 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 993 if (archetype *at = op->other_arch)
994 {
997 total_exp += at->stats.exp * 8; 995 total_exp += at->stats.exp * 8;
998
999 monster_cnt++; 996 monster_cnt++;
997 }
998
999 for (object *inv = op->inv; inv; inv = inv->below)
1000 {
1001 total_exp += op->stats.exp * 8;
1002 monster_cnt++;
1003 }
1000 } 1004 }
1001 } 1005 }
1002 1006
1003 avgexp = (double) total_exp / monster_cnt; 1007 avgexp = (double) total_exp / monster_cnt;
1004 1008
… …
1043 else 1047 else
1044 darkness = new_level; 1048 darkness = new_level;
1045 1049
1046 /* All clients need to get re-updated for the change */ 1050 /* All clients need to get re-updated for the change */
1047 update_all_map_los (this); 1051 update_all_map_los (this);
1052
1048 return 1; 1053 return 1;
1049} 1054}
1050 1055
1051/* 1056/*
1052 * This function updates various attributes about a specific space 1057 * This function updates various attributes about a specific space
… …
1055 * through, etc) 1060 * through, etc)
1056 */ 1061 */
1057void 1062void
1058mapspace::update_ () 1063mapspace::update_ ()
1059{ 1064{
1060 object *tmp, *last = 0; 1065 object *last = 0;
1061 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1066 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1062 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1067 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1063 1068
1064 //object *middle = 0; 1069 //object *middle = 0;
1065 //object *top = 0; 1070 //object *top = 0;
… …
1067 // this seems to generate better code than using locals, above 1072 // this seems to generate better code than using locals, above
1068 object *&top = faces_obj[0] = 0; 1073 object *&top = faces_obj[0] = 0;
1069 object *&middle = faces_obj[1] = 0; 1074 object *&middle = faces_obj[1] = 0;
1070 object *&floor = faces_obj[2] = 0; 1075 object *&floor = faces_obj[2] = 0;
1071 1076
1072 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1077 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1073 { 1078 {
1074 /* This could be made additive I guess (two lights better than 1079 /* This could be made additive I guess (two lights better than
1075 * one). But if so, it shouldn't be a simple additive - 2 1080 * one). But if so, it shouldn't be a simple additive - 2
1076 * light bulbs do not illuminate twice as far as once since 1081 * light bulbs do not illuminate twice as far as once since
1077 * it is a dissapation factor that is cubed. 1082 * it is a dissapation factor that is cubed.
1078 */ 1083 */
1079 if (tmp->glow_radius > light)
1080 light = tmp->glow_radius; 1084 light = max (light, tmp->glow_radius);
1081 1085
1082 /* This call is needed in order to update objects the player 1086 /* This call is needed in order to update objects the player
1083 * is standing in that have animations (ie, grass, fire, etc). 1087 * is standing in that have animations (ie, grass, fire, etc).
1084 * However, it also causes the look window to be re-drawn 1088 * However, it also causes the look window to be re-drawn
1085 * 3 times each time the player moves, because many of the 1089 * 3 times each time the player moves, because many of the
… …
1104 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1108 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1105 { 1109 {
1106 middle = tmp; 1110 middle = tmp;
1107 anywhere = 1; 1111 anywhere = 1;
1108 } 1112 }
1113
1109 /* Find the highest visible face around. If equal 1114 /* Find the highest visible face around. If equal
1110 * visibilities, we still want the one nearer to the 1115 * visibilities, we still want the one nearer to the
1111 * top 1116 * top
1112 */ 1117 */
1113 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) 1118 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
… …
1162 * 1) top face is set, need middle to be set. 1167 * 1) top face is set, need middle to be set.
1163 * 2) middle is set, need to set top. 1168 * 2) middle is set, need to set top.
1164 * 3) neither middle or top is set - need to set both. 1169 * 3) neither middle or top is set - need to set both.
1165 */ 1170 */
1166 1171
1167 for (tmp = last; tmp; tmp = tmp->below) 1172 for (object *tmp = last; tmp; tmp = tmp->below)
1168 { 1173 {
1169 /* Once we get to a floor, stop, since we already have a floor object */ 1174 /* Once we get to a floor, stop, since we already have a floor object */
1170 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1175 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1171 break; 1176 break;
1172 1177
… …
1227} 1232}
1228 1233
1229bool 1234bool
1230maptile::tile_available (int dir, bool load) 1235maptile::tile_available (int dir, bool load)
1231{ 1236{
1232 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY))
1233 return 1;
1234
1235 if (!tile_path[dir]) 1237 if (!tile_path[dir])
1236 return 0; 1238 return 0;
1239
1240 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1241 return 1;
1237 1242
1238 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1243 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1239 return 1; 1244 return 1;
1240 1245
1241 return 0; 1246 return 0;
… …
1259 if (!m) 1264 if (!m)
1260 return 0; 1265 return 0;
1261 1266
1262 if (x < 0) 1267 if (x < 0)
1263 { 1268 {
1264 if (!m->tile_available (3, 0)) 1269 if (!m->tile_available (3))
1265 return 1; 1270 return 1;
1266 1271
1267 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1272 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1268 } 1273 }
1269 1274
1270 if (x >= m->width) 1275 if (x >= m->width)
1271 { 1276 {
1272 if (!m->tile_available (1, 0)) 1277 if (!m->tile_available (1))
1273 return 1; 1278 return 1;
1274 1279
1275 return out_of_map (m->tile_map[1], x - m->width, y); 1280 return out_of_map (m->tile_map[1], x - m->width, y);
1276 } 1281 }
1277 1282
1278 if (y < 0) 1283 if (y < 0)
1279 { 1284 {
1280 if (!m->tile_available (0, 0)) 1285 if (!m->tile_available (0))
1281 return 1; 1286 return 1;
1282 1287
1283 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1288 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1284 } 1289 }
1285 1290
1286 if (y >= m->height) 1291 if (y >= m->height)
1287 { 1292 {
1288 if (!m->tile_available (2, 0)) 1293 if (!m->tile_available (2))
1289 return 1; 1294 return 1;
1290 1295
1291 return out_of_map (m->tile_map[2], x, y - m->height); 1296 return out_of_map (m->tile_map[2], x, y - m->height);
1292 } 1297 }
1293 1298
… …
1308maptile * 1313maptile *
1309maptile::xy_find (sint16 &x, sint16 &y) 1314maptile::xy_find (sint16 &x, sint16 &y)
1310{ 1315{
1311 if (x < 0) 1316 if (x < 0)
1312 { 1317 {
1313 if (!tile_available (3, 1)) 1318 if (!tile_available (3))
1314 return 0; 1319 return 0;
1315 1320
1316 x += tile_map[3]->width; 1321 x += tile_map[3]->width;
1317 return tile_map[3]->xy_find (x, y); 1322 return tile_map[3]->xy_find (x, y);
1318 } 1323 }
1319 1324
1320 if (x >= width) 1325 if (x >= width)
1321 { 1326 {
1322 if (!tile_available (1, 1)) 1327 if (!tile_available (1))
1323 return 0; 1328 return 0;
1324 1329
1325 x -= width; 1330 x -= width;
1326 return tile_map[1]->xy_find (x, y); 1331 return tile_map[1]->xy_find (x, y);
1327 } 1332 }
1328 1333
1329 if (y < 0) 1334 if (y < 0)
1330 { 1335 {
1331 if (!tile_available (0, 1)) 1336 if (!tile_available (0))
1332 return 0; 1337 return 0;
1333 1338
1334 y += tile_map[0]->height; 1339 y += tile_map[0]->height;
1335 return tile_map[0]->xy_find (x, y); 1340 return tile_map[0]->xy_find (x, y);
1336 } 1341 }
1337 1342
1338 if (y >= height) 1343 if (y >= height)
1339 { 1344 {
1340 if (!tile_available (2, 1)) 1345 if (!tile_available (2))
1341 return 0; 1346 return 0;
1342 1347
1343 y -= height; 1348 y -= height;
1344 return tile_map[2]->xy_find (x, y); 1349 return tile_map[2]->xy_find (x, y);
1345 } 1350 }
… …
1358adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1363adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1359{ 1364{
1360 if (!map1 || !map2) 1365 if (!map1 || !map2)
1361 return 0; 1366 return 0;
1362 1367
1363 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1368 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1364 //fix: compare paths instead (this is likely faster, too!) 1369 //fix: compare paths instead (this is likely faster, too!)
1365 if (map1 == map2) 1370 if (map1 == map2)
1366 { 1371 {
1367 *dx = 0; 1372 *dx = 0;
1368 *dy = 0; 1373 *dy = 0;
… …
1575} 1580}
1576 1581
1577object * 1582object *
1578maptile::insert (object *op, int x, int y, object *originator, int flags) 1583maptile::insert (object *op, int x, int y, object *originator, int flags)
1579{ 1584{
1580 if (!op->flag [FLAG_REMOVED])
1581 op->remove ();
1582
1583 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1585 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1584} 1586}
1585 1587
1586region * 1588region *
1587maptile::region (int x, int y) const 1589maptile::region (int x, int y) const
… …
1597 1599
1598 return ::region::default_region (); 1600 return ::region::default_region ();
1599} 1601}
1600 1602
1601/* picks a random object from a style map. 1603/* picks a random object from a style map.
1602 * Redone by MSW so it should be faster and not use static
1603 * variables to generate tables.
1604 */ 1604 */
1605object * 1605object *
1606maptile::pick_random_object () const 1606maptile::pick_random_object (rand_gen &gen) const
1607{ 1607{
1608 /* while returning a null object will result in a crash, that 1608 /* while returning a null object will result in a crash, that
1609 * is actually preferable to an infinite loop. That is because 1609 * is actually preferable to an infinite loop. That is because
1610 * most servers will automatically restart in case of crash. 1610 * most servers will automatically restart in case of crash.
1611 * Change the logic on getting the random space - shouldn't make 1611 * Change the logic on getting the random space - shouldn't make
1612 * any difference, but this seems clearer to me. 1612 * any difference, but this seems clearer to me.
1613 */ 1613 */
1614 for (int i = 1000; --i;) 1614 for (int i = 1000; --i;)
1615 { 1615 {
1616 object *pick = at (rndm (width), rndm (height)).bot; 1616 object *pick = at (gen (width), gen (height)).bot;
1617 1617
1618 // do not prefer big monsters just because they are big. 1618 // do not prefer big monsters just because they are big.
1619 if (pick && pick->head_ () == pick) 1619 if (pick && pick->is_head ())
1620 return pick->head_ (); 1620 return pick->head_ ();
1621 } 1621 }
1622 1622
1623 // instead of crashing in the unlikely(?) case, try to return *something* 1623 // instead of crashing in the unlikely(?) case, try to return *something*
1624 return get_archetype ("blocked"); 1624 return archetype::find ("bug");
1625} 1625}
1626 1626
1627void 1627void
1628maptile::play_sound (faceidx sound, int x, int y) const 1628maptile::play_sound (faceidx sound, int x, int y) const
1629{ 1629{

Diff Legend

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