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.126 by root, Fri Sep 7 13:10:30 2007 UTC vs.
Revision 1.155 by root, Fri Dec 26 10:36:42 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"
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) its 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 if (ms.top)
348 ms.top->above = op;
349 else
350 ms.bot = op;
351
352 ms.top = op;
353 ms.flags_ = 0;
354 }
355 else
356 {
357 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
358 op->destroy ();
359 }
338 } 360 }
339 361
340 continue; 362 continue;
341 363
342 case KW_EOF: 364 case KW_EOF:
… …
632 case KW_sky: thawer.get (sky); break; 654 case KW_sky: thawer.get (sky); break;
633 655
634 case KW_per_player: thawer.get (per_player); break; 656 case KW_per_player: thawer.get (per_player); break;
635 case KW_per_party: thawer.get (per_party); break; 657 case KW_per_party: thawer.get (per_party); break;
636 case KW_no_reset: thawer.get (no_reset); break; 658 case KW_no_reset: thawer.get (no_reset); break;
659 case KW_no_drop: thawer.get (no_drop); break;
637 660
638 case KW_region: default_region = region::find (thawer.get_str ()); break; 661 case KW_region: default_region = region::find (thawer.get_str ()); break;
639 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 662 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
640 663
641 // old names new names 664 // old names new names
… …
691 714
692 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 715 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
693 unique = 1; 716 unique = 1;
694 717
695 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 718 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
696 {
697 op->destroy_inv (false);
698 op->destroy (); 719 op->destroy ();
699 }
700 720
701 op = above; 721 op = above;
702 } 722 }
703 } 723 }
704} 724}
… …
715 MAP_OUT (swap_time); 735 MAP_OUT (swap_time);
716 MAP_OUT (reset_time); 736 MAP_OUT (reset_time);
717 MAP_OUT (reset_timeout); 737 MAP_OUT (reset_timeout);
718 MAP_OUT (fixed_resettime); 738 MAP_OUT (fixed_resettime);
719 MAP_OUT (no_reset); 739 MAP_OUT (no_reset);
740 MAP_OUT (no_drop);
720 MAP_OUT (difficulty); 741 MAP_OUT (difficulty);
721 742
722 if (default_region) MAP_OUT2 (region, default_region->name); 743 if (default_region) MAP_OUT2 (region, default_region->name);
723 744
724 if (shopitems) 745 if (shopitems)
… …
778 * Remove and free all objects in the given map. 799 * Remove and free all objects in the given map.
779 */ 800 */
780void 801void
781maptile::clear () 802maptile::clear ()
782{ 803{
783 sfree (regions, size ()); regions = 0;
784 delete [] regionmap; regionmap = 0;
785
786 if (spaces) 804 if (spaces)
787 { 805 {
788 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 806 for (mapspace *ms = spaces + size (); ms-- > spaces; )
789 while (object *op = ms->bot) 807 while (object *op = ms->bot)
790 { 808 {
809 // manually remove, as to not trigger anything
810 if (ms->bot = op->above)
811 ms->bot->below = 0;
812
813 op->flag [FLAG_REMOVED] = true;
814
791 op = op->head_ (); 815 object *head = op->head_ ();
792 op->destroy_inv (false); 816 if (op == head)
793 op->destroy (); 817 op->destroy ();
818 else if (head->map != op->map)
819 {
820 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
821 head->destroy ();
822 }
794 } 823 }
795 824
796 sfree (spaces, size ()), spaces = 0; 825 sfree0 (spaces, size ());
797 } 826 }
798 827
799 if (buttons) 828 if (buttons)
800 free_objectlinkpt (buttons), buttons = 0; 829 free_objectlinkpt (buttons), buttons = 0;
830
831 sfree0 (regions, size ());
832 delete [] regionmap; regionmap = 0;
801} 833}
802 834
803void 835void
804maptile::clear_header () 836maptile::clear_header ()
805{ 837{
… …
933/* 965/*
934 * This routine is supposed to find out the difficulty of the map. 966 * This routine is supposed to find out the difficulty of the map.
935 * difficulty does not have a lot to do with character level, 967 * difficulty does not have a lot to do with character level,
936 * but does have a lot to do with treasure on the map. 968 * but does have a lot to do with treasure on the map.
937 * 969 *
938 * Difficulty can now be set by the map creature. If the value stored 970 * Difficulty can now be set by the map creator. If the value stored
939 * in the map is zero, then use this routine. Maps should really 971 * in the map is zero, then use this routine. Maps should really
940 * have a difficulty set than using this function - human calculation 972 * have a difficulty set rather than using this function - human calculation
941 * is much better than this functions guesswork. 973 * is much better than this function's guesswork.
942 */ 974 */
943int 975int
944maptile::estimate_difficulty () const 976maptile::estimate_difficulty () const
945{ 977{
946 long monster_cnt = 0; 978 long monster_cnt = 0;
… …
958 990
959 if (QUERY_FLAG (op, FLAG_GENERATOR)) 991 if (QUERY_FLAG (op, FLAG_GENERATOR))
960 { 992 {
961 total_exp += op->stats.exp; 993 total_exp += op->stats.exp;
962 994
963 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 995 if (archetype *at = op->other_arch)
996 {
964 total_exp += at->stats.exp * 8; 997 total_exp += at->stats.exp * 8;
965
966 monster_cnt++; 998 monster_cnt++;
999 }
1000
1001 for (object *inv = op->inv; inv; inv = inv->below)
1002 {
1003 total_exp += op->stats.exp * 8;
1004 monster_cnt++;
1005 }
967 } 1006 }
968 } 1007 }
969 1008
970 avgexp = (double) total_exp / monster_cnt; 1009 avgexp = (double) total_exp / monster_cnt;
971 1010
… …
984 * postive values make it darker, negative make it brighter 1023 * postive values make it darker, negative make it brighter
985 */ 1024 */
986int 1025int
987maptile::change_map_light (int change) 1026maptile::change_map_light (int change)
988{ 1027{
989 int new_level = darkness + change;
990
991 /* Nothing to do */ 1028 /* Nothing to do */
992 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1029 if (!change)
993 return 0; 1030 return 0;
994 1031
995 /* inform all players on the map */ 1032 /* inform all players on the map */
996 if (change > 0) 1033 if (change > 0)
997 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1034 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
998 else 1035 else
999 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1036 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1000 1037
1001 /* Do extra checking. since darkness is a unsigned value, 1038 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1002 * we need to be extra careful about negative values.
1003 * In general, the checks below are only needed if change
1004 * is not +/-1
1005 */
1006 if (new_level < 0)
1007 darkness = 0;
1008 else if (new_level >= MAX_DARKNESS)
1009 darkness = MAX_DARKNESS;
1010 else
1011 darkness = new_level;
1012 1039
1013 /* All clients need to get re-updated for the change */ 1040 /* All clients need to get re-updated for the change */
1014 update_all_map_los (this); 1041 update_all_map_los (this);
1042
1015 return 1; 1043 return 1;
1016} 1044}
1017 1045
1018/* 1046/*
1019 * This function updates various attributes about a specific space 1047 * This function updates various attributes about a specific space
… …
1022 * through, etc) 1050 * through, etc)
1023 */ 1051 */
1024void 1052void
1025mapspace::update_ () 1053mapspace::update_ ()
1026{ 1054{
1027 object *tmp, *last = 0; 1055 object *last = 0;
1028 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1056 uint8 flags = P_UPTODATE, anywhere = 0;
1057 sint8 light = 0;
1029 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1058 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1030 1059
1031 //object *middle = 0; 1060 //object *middle = 0;
1032 //object *top = 0; 1061 //object *top = 0;
1033 //object *floor = 0; 1062 //object *floor = 0;
1034 // this seems to generate better code than using locals, above 1063 // this seems to generate better code than using locals, above
1035 object *&top = faces_obj[0] = 0; 1064 object *&top = faces_obj[0] = 0;
1036 object *&middle = faces_obj[1] = 0; 1065 object *&middle = faces_obj[1] = 0;
1037 object *&floor = faces_obj[2] = 0; 1066 object *&floor = faces_obj[2] = 0;
1038 1067
1039 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1068 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1040 { 1069 {
1041 /* This could be made additive I guess (two lights better than 1070 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1042 * one). But if so, it shouldn't be a simple additive - 2
1043 * light bulbs do not illuminate twice as far as once since
1044 * it is a dissapation factor that is cubed.
1045 */
1046 if (tmp->glow_radius > light)
1047 light = tmp->glow_radius; 1071 light += tmp->glow_radius;
1048 1072
1049 /* This call is needed in order to update objects the player 1073 /* This call is needed in order to update objects the player
1050 * is standing in that have animations (ie, grass, fire, etc). 1074 * is standing in that have animations (ie, grass, fire, etc).
1051 * However, it also causes the look window to be re-drawn 1075 * However, it also causes the look window to be re-drawn
1052 * 3 times each time the player moves, because many of the 1076 * 3 times each time the player moves, because many of the
… …
1071 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1095 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1072 { 1096 {
1073 middle = tmp; 1097 middle = tmp;
1074 anywhere = 1; 1098 anywhere = 1;
1075 } 1099 }
1100
1076 /* Find the highest visible face around. If equal 1101 /* Find the highest visible face around. If equal
1077 * visibilities, we still want the one nearer to the 1102 * visibilities, we still want the one nearer to the
1078 * top 1103 * top
1079 */ 1104 */
1080 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) 1105 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
… …
1099 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1124 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1100 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1125 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1101 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1126 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1102 } 1127 }
1103 1128
1104 this->light = light; 1129 this->light = min (light, MAX_LIGHT_RADIUS);
1105 this->flags_ = flags; 1130 this->flags_ = flags;
1106 this->move_block = move_block & ~move_allow; 1131 this->move_block = move_block & ~move_allow;
1107 this->move_on = move_on; 1132 this->move_on = move_on;
1108 this->move_off = move_off; 1133 this->move_off = move_off;
1109 this->move_slow = move_slow; 1134 this->move_slow = move_slow;
… …
1129 * 1) top face is set, need middle to be set. 1154 * 1) top face is set, need middle to be set.
1130 * 2) middle is set, need to set top. 1155 * 2) middle is set, need to set top.
1131 * 3) neither middle or top is set - need to set both. 1156 * 3) neither middle or top is set - need to set both.
1132 */ 1157 */
1133 1158
1134 for (tmp = last; tmp; tmp = tmp->below) 1159 for (object *tmp = last; tmp; tmp = tmp->below)
1135 { 1160 {
1136 /* Once we get to a floor, stop, since we already have a floor object */ 1161 /* Once we get to a floor, stop, since we already have a floor object */
1137 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1162 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1138 break; 1163 break;
1139 1164
… …
1191 vol += op->volume (); 1216 vol += op->volume ();
1192 1217
1193 return vol; 1218 return vol;
1194} 1219}
1195 1220
1196bool 1221maptile *
1197maptile::tile_available (int dir, bool load) 1222maptile::tile_available (int dir, bool load)
1198{ 1223{
1199 if (!tile_path[dir]) 1224 if (tile_path[dir])
1200 return 0; 1225 {
1201
1202 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) 1226 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1203 return 1; 1227 return tile_map[dir];
1204 1228
1205 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1229 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1206 return 1; 1230 return tile_map[dir];
1231 }
1207 1232
1208 return 0; 1233 return 0;
1209} 1234}
1210 1235
1211/* this returns TRUE if the coordinates (x,y) are out of 1236/* this returns TRUE if the coordinates (x,y) are out of
… …
1542} 1567}
1543 1568
1544object * 1569object *
1545maptile::insert (object *op, int x, int y, object *originator, int flags) 1570maptile::insert (object *op, int x, int y, object *originator, int flags)
1546{ 1571{
1547 if (!op->flag [FLAG_REMOVED])
1548 op->remove ();
1549
1550 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1572 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1551} 1573}
1552 1574
1553region * 1575region *
1554maptile::region (int x, int y) const 1576maptile::region (int x, int y) const
… …
1564 1586
1565 return ::region::default_region (); 1587 return ::region::default_region ();
1566} 1588}
1567 1589
1568/* picks a random object from a style map. 1590/* picks a random object from a style map.
1569 * Redone by MSW so it should be faster and not use static
1570 * variables to generate tables.
1571 */ 1591 */
1572object * 1592object *
1573maptile::pick_random_object () const 1593maptile::pick_random_object (rand_gen &gen) const
1574{ 1594{
1575 /* while returning a null object will result in a crash, that 1595 /* while returning a null object will result in a crash, that
1576 * is actually preferable to an infinite loop. That is because 1596 * is actually preferable to an infinite loop. That is because
1577 * most servers will automatically restart in case of crash. 1597 * most servers will automatically restart in case of crash.
1578 * Change the logic on getting the random space - shouldn't make 1598 * Change the logic on getting the random space - shouldn't make
1579 * any difference, but this seems clearer to me. 1599 * any difference, but this seems clearer to me.
1580 */ 1600 */
1581 for (int i = 1000; --i;) 1601 for (int i = 1000; --i;)
1582 { 1602 {
1583 object *pick = at (rndm (width), rndm (height)).bot; 1603 object *pick = at (gen (width), gen (height)).bot;
1584 1604
1585 // do not prefer big monsters just because they are big. 1605 // do not prefer big monsters just because they are big.
1586 if (pick && pick->head_ () == pick) 1606 if (pick && pick->is_head ())
1587 return pick->head_ (); 1607 return pick->head_ ();
1588 } 1608 }
1589 1609
1590 // instead of crashing in the unlikely(?) case, try to return *something* 1610 // instead of crashing in the unlikely(?) case, try to return *something*
1591 return get_archetype ("blocked"); 1611 return archetype::find ("bug");
1592} 1612}
1593 1613
1594void 1614void
1595maptile::play_sound (faceidx sound, int x, int y) const 1615maptile::play_sound (faceidx sound, int x, int y) const
1596{ 1616{
1597 if (!sound) 1617 if (!sound)
1598 return; 1618 return;
1599 1619
1600 for_all_players (pl) 1620 for_all_players_on_map (pl, this)
1601 if (pl->observe->map == this)
1602 if (client *ns = pl->ns) 1621 if (client *ns = pl->ns)
1603 { 1622 {
1604 int dx = x - pl->observe->x; 1623 int dx = x - pl->ob->x;
1605 int dy = y - pl->observe->y; 1624 int dy = y - pl->ob->y;
1606 1625
1607 int distance = idistance (dx, dy); 1626 int distance = idistance (dx, dy);
1608 1627
1609 if (distance <= MAX_SOUND_DISTANCE) 1628 if (distance <= MAX_SOUND_DISTANCE)
1610 ns->play_sound (sound, dx, dy); 1629 ns->play_sound (sound, dx, dy);
1611 } 1630 }
1612} 1631}
1613 1632
1633static void
1634split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1635{
1636 // clip to map to the left
1637 if (x0 < 0)
1638 {
1639 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1640 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1641
1642 if (x1 < 0) // entirely to the left
1643 return;
1644
1645 x0 = 0;
1646 }
1647
1648 // clip to map to the right
1649 if (x1 > m->width)
1650 {
1651 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1652 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1653
1654 if (x0 > m->width) // entirely to the right
1655 return;
1656
1657 x1 = m->width;
1658 }
1659
1660 // clip to map above
1661 if (y0 < 0)
1662 {
1663 if (maptile *tile = m->tile_available (TILE_UP, 1))
1664 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1665
1666 if (y1 < 0) // entirely above
1667 return;
1668
1669 y0 = 0;
1670 }
1671
1672 // clip to map below
1673 if (y1 > m->height)
1674 {
1675 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1676 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1677
1678 if (y0 > m->height) // entirely below
1679 return;
1680
1681 y1 = m->height;
1682 }
1683
1684 // if we get here, the rect is within the current map
1685 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1686
1687 r->m = m;
1688 r->x0 = x0;
1689 r->y0 = y0;
1690 r->x1 = x1;
1691 r->y1 = y1;
1692 r->dx = dx;
1693 r->dy = dy;
1694}
1695
1696maprect *
1697maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1698{
1699 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1700 buf.clear ();
1701
1702 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1703
1704 // add end marker
1705 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1706 r->m = 0;
1707
1708 return (maprect *)buf.linearise ();
1709}
1710

Diff Legend

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