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.123 by root, Thu Aug 30 07:28:24 2007 UTC vs.
Revision 1.158 by root, Tue Feb 17 03:53:31 2009 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"
29
30sint8 maptile::outdoor_darkness;
32 31
33/* This rolls up wall, blocks_magic, blocks_view, etc, all into 32/* This rolls up wall, blocks_magic, blocks_view, etc, all into
34 * one function that just returns a P_.. value (see map.h) 33 * one function that just returns a P_.. value (see map.h)
35 * it will also do map translation for tiled maps, returning 34 * it will also do map translation for tiled maps, returning
36 * new values into newmap, nx, and ny. Any and all of those 35 * new values into newmap, nx, and ny. Any and all of those
… …
166 } 165 }
167 return 0; 166 return 0;
168} 167}
169 168
170/* 169/*
171 * Returns true if the given object can't fit in the given spot. 170 * 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, 171 * spot. This is meant for multi space objects - for single space objecs,
173 * just calling get_map_blocked and checking that against movement type 172 * just calling get_map_blocked and checking that against movement type
174 * of object. This function goes through all the parts of the 173 * of object. This function goes through all the parts of the multipart
175 * multipart object and makes sure they can be inserted. 174 * object and makes sure they can be inserted.
176 * 175 *
177 * While this doesn't call out of map, the get_map_flags does. 176 * While this doesn't call out of map, the get_map_flags does.
178 * 177 *
179 * This function has been used to deprecate arch_out_of_map - 178 * This function has been used to deprecate arch_out_of_map -
180 * this function also does that check, and since in most cases, 179 * this function also does that check, and since in most cases,
… …
191 * 190 *
192 * Note this used to be arch_blocked, but with new movement 191 * Note this used to be arch_blocked, but with new movement
193 * code, we need to have actual object to check its move_type 192 * code, we need to have actual object to check its move_type
194 * against the move_block values. 193 * against the move_block values.
195 */ 194 */
196int 195bool
197ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 196object::blocked (maptile *m, int x, int y) const
198{ 197{
199 archetype *tmp; 198 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 } 199 {
200 mapxy pos (m, x + tmp->x, y + tmp->y);
213 201
214 for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) 202 if (!pos.normalise ())
215 { 203 return 1;
216 flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
217 204
218 if (flag & P_OUT_OF_MAP) 205 mapspace &ms = *pos;
219 return P_OUT_OF_MAP; 206
220 if (flag & P_IS_ALIVE) 207 if (ms.flags () & P_IS_ALIVE)
221 return P_IS_ALIVE; 208 return 1;
222 209
223 mapspace &ms = m1->at (sx, sy); 210 /* However, often ob doesn't have any move type
224 211 * (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. 212 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
228 */ 213 */
229
230 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 214 if (!move_type && ms.move_block != MOVE_ALL)
231 continue; 215 continue;
232 216
233 /* Note it is intentional that we check ob - the movement type of the 217 /* Note it is intentional that we check ob - the movement type of the
234 * head of the object should correspond for the entire object. 218 * head of the object should correspond for the entire object.
235 */ 219 */
236 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 220 if (ms.blocks (move_type))
237 return P_NO_PASS; 221 return 1;
238 } 222 }
239 223
240 return 0; 224 return 0;
241} 225}
242 226
… …
260 244
261 insert_ob_in_ob (tmp, container); 245 insert_ob_in_ob (tmp, container);
262 tmp = next; 246 tmp = next;
263 } 247 }
264 248
265 /* sum_weight will go through and calculate what all the containers are 249 // go through and calculate what all the containers are carrying.
266 * carrying. 250 //TODO: remove
267 */ 251 container->update_weight ();
268 sum_weight (container);
269} 252}
270 253
271void 254void
272maptile::set_object_flag (int flag, int value) 255maptile::set_object_flag (int flag, int value)
273{ 256{
… …
275 return; 258 return;
276 259
277 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 260 for (mapspace *ms = spaces + size (); ms-- > spaces; )
278 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 261 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
279 tmp->flag [flag] = value; 262 tmp->flag [flag] = value;
263}
264
265void
266maptile::post_load_original ()
267{
268 if (!spaces)
269 return;
270
271 set_object_flag (FLAG_OBJ_ORIGINAL);
272
273 for (mapspace *ms = spaces + size (); ms-- > spaces; )
274 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
275 INVOKE_OBJECT (RESET, tmp);
280} 276}
281 277
282/* link_multipart_objects go through all the objects on the map looking 278/* 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 279 * 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 280 * info we have, they only have the head (as would be expected when
… …
322bool 318bool
323maptile::_load_objects (object_thawer &f) 319maptile::_load_objects (object_thawer &f)
324{ 320{
325 for (;;) 321 for (;;)
326 { 322 {
327 coroapi::cede_to_tick_every (100); // cede once in a while 323 coroapi::cede_to_tick (); // cede once in a while
328 324
329 switch (f.kw) 325 switch (f.kw)
330 { 326 {
331 case KW_arch: 327 case KW_arch:
332 if (object *op = object::read (f, this)) 328 if (object *op = object::read (f, this))
333 { 329 {
330 // TODO: why?
334 if (op->inv) 331 if (op->inv)
335 sum_weight (op); 332 op->update_weight ();
336 333
337 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 334 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
335 {
336 // we insert manually because
337 // a) its way faster
338 // b) we remove manually, too, and there are good reasons for that
339 // c) it's correct
340 mapspace &ms = at (op->x, op->y);
341
342 op->flag [FLAG_REMOVED] = false;
343
344 op->above = 0;
345 op->below = ms.top;
346
347 *(ms.top ? &ms.top->above : &ms.bot) = op;
348
349 ms.top = op;
350 ms.flags_ = 0;
351 }
352 else
353 {
354 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
355 op->destroy ();
356 }
338 } 357 }
339 358
340 continue; 359 continue;
341 360
342 case KW_EOF: 361 case KW_EOF:
… …
405 } 424 }
406 425
407 coroapi::cede_to_tick (); 426 coroapi::cede_to_tick ();
408 427
409 return true; 428 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} 429}
433 430
434bool 431bool
435maptile::_save_objects (const char *path, int flags) 432maptile::_save_objects (const char *path, int flags)
436{ 433{
… …
611bool 608bool
612maptile::_load_header (object_thawer &thawer) 609maptile::_load_header (object_thawer &thawer)
613{ 610{
614 for (;;) 611 for (;;)
615 { 612 {
616 thawer.next ();
617
618 switch (thawer.kw) 613 switch (thawer.kw)
619 { 614 {
620 case KW_msg: 615 case KW_msg:
621 thawer.get_ml (KW_endmsg, msg); 616 thawer.get_ml (KW_endmsg, msg);
622 break; 617 break;
… …
656 case KW_sky: thawer.get (sky); break; 651 case KW_sky: thawer.get (sky); break;
657 652
658 case KW_per_player: thawer.get (per_player); break; 653 case KW_per_player: thawer.get (per_player); break;
659 case KW_per_party: thawer.get (per_party); break; 654 case KW_per_party: thawer.get (per_party); break;
660 case KW_no_reset: thawer.get (no_reset); break; 655 case KW_no_reset: thawer.get (no_reset); break;
656 case KW_no_drop: thawer.get (no_drop); break;
661 657
662 case KW_region: default_region = region::find (thawer.get_str ()); break; 658 case KW_region: default_region = region::find (thawer.get_str ()); break;
663 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 659 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
664 660
665 // old names new names 661 // old names new names
… …
681 case KW_ERROR: 677 case KW_ERROR:
682 set_key_text (thawer.kw_str, thawer.value); 678 set_key_text (thawer.kw_str, thawer.value);
683 break; 679 break;
684 680
685 case KW_end: 681 case KW_end:
682 thawer.next ();
686 return true; 683 return true;
687 684
688 default: 685 default:
689 if (!thawer.parse_error ("map", 0)) 686 if (!thawer.parse_error ("map", 0))
690 return false; 687 return false;
691 break; 688 break;
692 } 689 }
690
691 thawer.next ();
693 } 692 }
694 693
695 abort (); 694 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} 695}
708 696
709/****************************************************************************** 697/******************************************************************************
710 * This is the start of unique map handling code 698 * This is the start of unique map handling code
711 *****************************************************************************/ 699 *****************************************************************************/
… …
723 711
724 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 712 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
725 unique = 1; 713 unique = 1;
726 714
727 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 715 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
728 {
729 op->destroy_inv (false);
730 op->destroy (); 716 op->destroy ();
731 }
732 717
733 op = above; 718 op = above;
734 } 719 }
735 } 720 }
736} 721}
… …
747 MAP_OUT (swap_time); 732 MAP_OUT (swap_time);
748 MAP_OUT (reset_time); 733 MAP_OUT (reset_time);
749 MAP_OUT (reset_timeout); 734 MAP_OUT (reset_timeout);
750 MAP_OUT (fixed_resettime); 735 MAP_OUT (fixed_resettime);
751 MAP_OUT (no_reset); 736 MAP_OUT (no_reset);
737 MAP_OUT (no_drop);
752 MAP_OUT (difficulty); 738 MAP_OUT (difficulty);
753 739
754 if (default_region) MAP_OUT2 (region, default_region->name); 740 if (default_region) MAP_OUT2 (region, default_region->name);
755 741
756 if (shopitems) 742 if (shopitems)
… …
810 * Remove and free all objects in the given map. 796 * Remove and free all objects in the given map.
811 */ 797 */
812void 798void
813maptile::clear () 799maptile::clear ()
814{ 800{
815 sfree (regions, size ()); regions = 0;
816 delete [] regionmap; regionmap = 0;
817
818 if (spaces) 801 if (spaces)
819 { 802 {
820 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 803 for (mapspace *ms = spaces + size (); ms-- > spaces; )
821 while (object *op = ms->bot) 804 while (object *op = ms->bot)
822 { 805 {
806 // manually remove, as to not trigger anything
807 if (ms->bot = op->above)
808 ms->bot->below = 0;
809
810 op->flag [FLAG_REMOVED] = true;
811
823 op = op->head_ (); 812 object *head = op->head_ ();
824 op->destroy_inv (false); 813 if (op == head)
825 op->destroy (); 814 op->destroy ();
815 else if (head->map != op->map)
816 {
817 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
818 head->destroy ();
819 }
826 } 820 }
827 821
828 sfree (spaces, size ()), spaces = 0; 822 sfree0 (spaces, size ());
829 } 823 }
830 824
831 if (buttons) 825 if (buttons)
832 free_objectlinkpt (buttons), buttons = 0; 826 free_objectlinkpt (buttons), buttons = 0;
827
828 sfree0 (regions, size ());
829 delete [] regionmap; regionmap = 0;
833} 830}
834 831
835void 832void
836maptile::clear_header () 833maptile::clear_header ()
837{ 834{
… …
937 op->destroy (); 934 op->destroy ();
938 } 935 }
939} 936}
940 937
941/* 938/*
942 * Updates every button on the map (by calling update_button() for them).
943 */
944void
945maptile::update_buttons ()
946{
947 for (oblinkpt *obp = buttons; obp; obp = obp->next)
948 for (objectlink *ol = obp->link; ol; ol = ol->next)
949 {
950 if (!ol->ob)
951 {
952 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
953 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
954 continue;
955 }
956
957 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
958 {
959 update_button (ol->ob);
960 break;
961 }
962 }
963}
964
965/*
966 * This routine is supposed to find out the difficulty of the map. 939 * This routine is supposed to find out the difficulty of the map.
967 * difficulty does not have a lot to do with character level, 940 * difficulty does not have a lot to do with character level,
968 * but does have a lot to do with treasure on the map. 941 * but does have a lot to do with treasure on the map.
969 * 942 *
970 * Difficulty can now be set by the map creature. If the value stored 943 * Difficulty can now be set by the map creator. If the value stored
971 * in the map is zero, then use this routine. Maps should really 944 * in the map is zero, then use this routine. Maps should really
972 * have a difficulty set than using this function - human calculation 945 * have a difficulty set rather than using this function - human calculation
973 * is much better than this functions guesswork. 946 * is much better than this function's guesswork.
974 */ 947 */
975int 948int
976maptile::estimate_difficulty () const 949maptile::estimate_difficulty () const
977{ 950{
978 long monster_cnt = 0; 951 long monster_cnt = 0;
… …
990 963
991 if (QUERY_FLAG (op, FLAG_GENERATOR)) 964 if (QUERY_FLAG (op, FLAG_GENERATOR))
992 { 965 {
993 total_exp += op->stats.exp; 966 total_exp += op->stats.exp;
994 967
995 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 968 if (archetype *at = op->other_arch)
969 {
996 total_exp += at->stats.exp * 8; 970 total_exp += at->stats.exp * 8;
997
998 monster_cnt++; 971 monster_cnt++;
972 }
973
974 for (object *inv = op->inv; inv; inv = inv->below)
975 {
976 total_exp += op->stats.exp * 8;
977 monster_cnt++;
978 }
999 } 979 }
1000 } 980 }
1001 981
1002 avgexp = (double) total_exp / monster_cnt; 982 avgexp = (double) total_exp / monster_cnt;
1003 983
… …
1016 * postive values make it darker, negative make it brighter 996 * postive values make it darker, negative make it brighter
1017 */ 997 */
1018int 998int
1019maptile::change_map_light (int change) 999maptile::change_map_light (int change)
1020{ 1000{
1021 int new_level = darkness + change;
1022
1023 /* Nothing to do */ 1001 /* Nothing to do */
1024 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1002 if (!change)
1025 return 0; 1003 return 0;
1026 1004
1027 /* inform all players on the map */ 1005 /* inform all players on the map */
1028 if (change > 0) 1006 if (change > 0)
1029 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1007 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1030 else 1008 else
1031 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1009 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1032 1010
1033 /* Do extra checking. since darkness is a unsigned value, 1011 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 1012
1045 /* All clients need to get re-updated for the change */ 1013 /* All clients need to get re-updated for the change */
1046 update_all_map_los (this); 1014 update_all_map_los (this);
1015
1047 return 1; 1016 return 1;
1048} 1017}
1049 1018
1050/* 1019/*
1051 * This function updates various attributes about a specific space 1020 * This function updates various attributes about a specific space
… …
1054 * through, etc) 1023 * through, etc)
1055 */ 1024 */
1056void 1025void
1057mapspace::update_ () 1026mapspace::update_ ()
1058{ 1027{
1059 object *tmp, *last = 0; 1028 object *last = 0;
1060 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1029 uint8 flags = P_UPTODATE, anywhere = 0;
1030 sint8 light = 0;
1061 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1031 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1062 1032
1063 //object *middle = 0; 1033 //object *middle = 0;
1064 //object *top = 0; 1034 //object *top = 0;
1065 //object *floor = 0; 1035 //object *floor = 0;
1066 // this seems to generate better code than using locals, above 1036 // this seems to generate better code than using locals, above
1067 object *&top = faces_obj[0] = 0; 1037 object *&top = faces_obj[0] = 0;
1068 object *&middle = faces_obj[1] = 0; 1038 object *&middle = faces_obj[1] = 0;
1069 object *&floor = faces_obj[2] = 0; 1039 object *&floor = faces_obj[2] = 0;
1070 1040
1071 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1041 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1072 { 1042 {
1073 /* This could be made additive I guess (two lights better than 1043 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1074 * one). But if so, it shouldn't be a simple additive - 2
1075 * light bulbs do not illuminate twice as far as once since
1076 * it is a dissapation factor that is cubed.
1077 */
1078 if (tmp->glow_radius > light)
1079 light = tmp->glow_radius; 1044 light += tmp->glow_radius;
1080 1045
1081 /* This call is needed in order to update objects the player 1046 /* This call is needed in order to update objects the player
1082 * is standing in that have animations (ie, grass, fire, etc). 1047 * is standing in that have animations (ie, grass, fire, etc).
1083 * However, it also causes the look window to be re-drawn 1048 * However, it also causes the look window to be re-drawn
1084 * 3 times each time the player moves, because many of the 1049 * 3 times each time the player moves, because many of the
… …
1103 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1068 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1104 { 1069 {
1105 middle = tmp; 1070 middle = tmp;
1106 anywhere = 1; 1071 anywhere = 1;
1107 } 1072 }
1073
1108 /* Find the highest visible face around. If equal 1074 /* Find the highest visible face around. If equal
1109 * visibilities, we still want the one nearer to the 1075 * visibilities, we still want the one nearer to the
1110 * top 1076 * top
1111 */ 1077 */
1112 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) 1078 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
… …
1131 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1097 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1132 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1098 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1133 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1099 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1134 } 1100 }
1135 1101
1136 this->light = light; 1102 this->light = min (light, MAX_LIGHT_RADIUS);
1137 this->flags_ = flags; 1103 this->flags_ = flags;
1138 this->move_block = move_block & ~move_allow; 1104 this->move_block = move_block & ~move_allow;
1139 this->move_on = move_on; 1105 this->move_on = move_on;
1140 this->move_off = move_off; 1106 this->move_off = move_off;
1141 this->move_slow = move_slow; 1107 this->move_slow = move_slow;
… …
1161 * 1) top face is set, need middle to be set. 1127 * 1) top face is set, need middle to be set.
1162 * 2) middle is set, need to set top. 1128 * 2) middle is set, need to set top.
1163 * 3) neither middle or top is set - need to set both. 1129 * 3) neither middle or top is set - need to set both.
1164 */ 1130 */
1165 1131
1166 for (tmp = last; tmp; tmp = tmp->below) 1132 for (object *tmp = last; tmp; tmp = tmp->below)
1167 { 1133 {
1168 /* Once we get to a floor, stop, since we already have a floor object */ 1134 /* Once we get to a floor, stop, since we already have a floor object */
1169 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1135 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1170 break; 1136 break;
1171 1137
… …
1223 vol += op->volume (); 1189 vol += op->volume ();
1224 1190
1225 return vol; 1191 return vol;
1226} 1192}
1227 1193
1228bool 1194maptile *
1229maptile::tile_available (int dir, bool load) 1195maptile::tile_available (int dir, bool load)
1230{ 1196{
1231 if (!tile_path[dir]) 1197 if (tile_path[dir])
1232 return 0; 1198 {
1233
1234 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) 1199 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1235 return 1; 1200 return tile_map[dir];
1236 1201
1237 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1202 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1238 return 1; 1203 return tile_map[dir];
1204 }
1239 1205
1240 return 0; 1206 return 0;
1241} 1207}
1242 1208
1243/* this returns TRUE if the coordinates (x,y) are out of 1209/* this returns TRUE if the coordinates (x,y) are out of
… …
1574} 1540}
1575 1541
1576object * 1542object *
1577maptile::insert (object *op, int x, int y, object *originator, int flags) 1543maptile::insert (object *op, int x, int y, object *originator, int flags)
1578{ 1544{
1579 if (!op->flag [FLAG_REMOVED])
1580 op->remove ();
1581
1582 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1545 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1583} 1546}
1584 1547
1585region * 1548region *
1586maptile::region (int x, int y) const 1549maptile::region (int x, int y) const
… …
1596 1559
1597 return ::region::default_region (); 1560 return ::region::default_region ();
1598} 1561}
1599 1562
1600/* picks a random object from a style map. 1563/* picks a random object from a style map.
1601 * Redone by MSW so it should be faster and not use static
1602 * variables to generate tables.
1603 */ 1564 */
1604object * 1565object *
1605maptile::pick_random_object () const 1566maptile::pick_random_object (rand_gen &gen) const
1606{ 1567{
1607 /* while returning a null object will result in a crash, that 1568 /* while returning a null object will result in a crash, that
1608 * is actually preferable to an infinite loop. That is because 1569 * is actually preferable to an infinite loop. That is because
1609 * most servers will automatically restart in case of crash. 1570 * most servers will automatically restart in case of crash.
1610 * Change the logic on getting the random space - shouldn't make 1571 * Change the logic on getting the random space - shouldn't make
1611 * any difference, but this seems clearer to me. 1572 * any difference, but this seems clearer to me.
1612 */ 1573 */
1613 for (int i = 1000; --i;) 1574 for (int i = 1000; --i;)
1614 { 1575 {
1615 object *pick = at (rndm (width), rndm (height)).bot; 1576 object *pick = at (gen (width), gen (height)).bot;
1616 1577
1617 // do not prefer big monsters just because they are big. 1578 // do not prefer big monsters just because they are big.
1618 if (pick && pick->head_ () == pick) 1579 if (pick && pick->is_head ())
1619 return pick->head_ (); 1580 return pick->head_ ();
1620 } 1581 }
1621 1582
1622 // instead of crashing in the unlikely(?) case, try to return *something* 1583 // instead of crashing in the unlikely(?) case, try to return *something*
1623 return get_archetype ("blocked"); 1584 return archetype::find ("bug");
1624} 1585}
1625 1586
1626void 1587void
1627maptile::play_sound (faceidx sound, int x, int y) const 1588maptile::play_sound (faceidx sound, int x, int y) const
1628{ 1589{
1629 if (!sound) 1590 if (!sound)
1630 return; 1591 return;
1631 1592
1593 for_all_players_on_map (pl, this)
1594 if (client *ns = pl->ns)
1595 {
1596 int dx = x - pl->ob->x;
1597 int dy = y - pl->ob->y;
1598
1599 int distance = idistance (dx, dy);
1600
1601 if (distance <= MAX_SOUND_DISTANCE)
1602 ns->play_sound (sound, dx, dy);
1603 }
1604}
1605
1606void
1607maptile::say_msg (const char *msg, int x, int y) const
1608{
1632 for_all_players (pl) 1609 for_all_players (pl)
1633 if (pl->ob->map == this)
1634 if (client *ns = pl->ns) 1610 if (client *ns = pl->ns)
1635 { 1611 {
1636 int dx = x - pl->ob->x; 1612 int dx = x - pl->ob->x;
1637 int dy = y - pl->ob->y; 1613 int dy = y - pl->ob->y;
1638 1614
1639 int distance = idistance (dx, dy); 1615 int distance = idistance (dx, dy);
1640 1616
1641 if (distance <= MAX_SOUND_DISTANCE) 1617 if (distance <= MAX_SOUND_DISTANCE)
1642 ns->play_sound (sound, dx, dy); 1618 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1643 } 1619 }
1644} 1620}
1645 1621
1622static void
1623split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1624{
1625 // clip to map to the left
1626 if (x0 < 0)
1627 {
1628 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1629 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1630
1631 if (x1 < 0) // entirely to the left
1632 return;
1633
1634 x0 = 0;
1635 }
1636
1637 // clip to map to the right
1638 if (x1 > m->width)
1639 {
1640 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1641 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1642
1643 if (x0 > m->width) // entirely to the right
1644 return;
1645
1646 x1 = m->width;
1647 }
1648
1649 // clip to map above
1650 if (y0 < 0)
1651 {
1652 if (maptile *tile = m->tile_available (TILE_UP, 1))
1653 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1654
1655 if (y1 < 0) // entirely above
1656 return;
1657
1658 y0 = 0;
1659 }
1660
1661 // clip to map below
1662 if (y1 > m->height)
1663 {
1664 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1665 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1666
1667 if (y0 > m->height) // entirely below
1668 return;
1669
1670 y1 = m->height;
1671 }
1672
1673 // if we get here, the rect is within the current map
1674 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1675
1676 r->m = m;
1677 r->x0 = x0;
1678 r->y0 = y0;
1679 r->x1 = x1;
1680 r->y1 = y1;
1681 r->dx = dx;
1682 r->dy = dy;
1683}
1684
1685maprect *
1686maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1687{
1688 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1689 buf.clear ();
1690
1691 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1692
1693 // add end marker
1694 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1695 r->m = 0;
1696
1697 return (maprect *)buf.linearise ();
1698}
1699

Diff Legend

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