| 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team |
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 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 | /* |
25 | /* |
| … | |
… | |
| 47 | #define MAGIC_MAP_SIZE 50 |
48 | #define MAGIC_MAP_SIZE 50 |
| 48 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
49 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
| 49 | |
50 | |
| 50 | #define MAP_LAYERS 3 |
51 | #define MAP_LAYERS 3 |
| 51 | |
52 | |
|
|
53 | // tile map index |
|
|
54 | enum { |
|
|
55 | TILE_UP = 0, |
|
|
56 | TILE_RIGHT = 1, |
|
|
57 | TILE_DOWN = 2, |
|
|
58 | TILE_LEFT = 3, |
|
|
59 | }; |
|
|
60 | |
| 52 | /* Values for in_memory below */ |
61 | /* Values for in_memory below */ |
| 53 | enum { |
62 | enum { |
| 54 | MAP_ACTIVE, |
63 | MAP_ACTIVE, |
| 55 | MAP_INACTIVE, // not used atm. |
64 | MAP_INACTIVE, // not used atm. |
| 56 | MAP_SWAPPED, |
65 | MAP_SWAPPED, |
| … | |
… | |
| 63 | * where it is known the map is not tiled or the values are known |
72 | * where it is known the map is not tiled or the values are known |
| 64 | * consistent (eg, op->map, op->x, op->y) |
73 | * consistent (eg, op->map, op->x, op->y) |
| 65 | */ |
74 | */ |
| 66 | // all those macros are herewith declared legacy |
75 | // all those macros are herewith declared legacy |
| 67 | #define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
76 | #define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
| 68 | #define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light |
|
|
| 69 | #define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
77 | #define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
| 70 | #define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
78 | #define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
| 71 | #define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
79 | #define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
| 72 | #define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
80 | #define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
| 73 | #define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
81 | #define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
| … | |
… | |
| 100 | * used in the get_map_flags value - that function is used to return |
108 | * used in the get_map_flags value - that function is used to return |
| 101 | * the flag value, as well as other conditions - using a more general |
109 | * the flag value, as well as other conditions - using a more general |
| 102 | * function that does more of the work can hopefully be used to replace |
110 | * function that does more of the work can hopefully be used to replace |
| 103 | * lots of duplicate checks currently in the code. |
111 | * lots of duplicate checks currently in the code. |
| 104 | */ |
112 | */ |
| 105 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
113 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
| 106 | #define P_NEW_MAP 0x20000 |
114 | #define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ |
| 107 | /* Coordinates passed result in a new tiled map */ |
|
|
| 108 | |
115 | |
| 109 | /* Instead of having numerous arrays that have information on a |
116 | /* Instead of having numerous arrays that have information on a |
| 110 | * particular space (was map, floor, floor2, map_ob), |
117 | * particular space (was map, floor, floor2, map_ob), |
| 111 | * have this structure take care of that information. |
118 | * have this structure take care of that information. |
| 112 | * This puts it all in one place, and should also make it easier |
119 | * This puts it all in one place, and should also make it easier |
| 113 | * to extend information about a space. |
120 | * to extend information about a space. |
| 114 | */ |
121 | */ |
|
|
122 | INTERFACE_CLASS (mapspace) |
| 115 | struct mapspace |
123 | struct mapspace |
| 116 | { |
124 | { |
|
|
125 | object *ACC (RW, bot); |
| 117 | object *bot, *top; /* lowest/highest object on this space */ |
126 | object *ACC (RW, top); /* lowest/highest object on this space */ |
| 118 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
127 | object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ |
|
|
128 | uint32_t smell; // the last count a player was seen here, or 0 |
|
|
129 | static uint32_t smellcount; // global smell counter |
| 119 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
130 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
| 120 | sint8 light; /* How much light this space provides */ |
131 | sint8 ACC (RW, light); /* How much light this space provides */ |
| 121 | MoveType move_block; /* What movement types this space blocks */ |
132 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
| 122 | MoveType move_slow; /* What movement types this space slows */ |
133 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
| 123 | MoveType move_on; /* What movement types are activated */ |
134 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
| 124 | MoveType move_off; /* What movement types are activated */ |
135 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
| 125 | |
136 | |
| 126 | void update_ (); |
137 | void update_ (); |
| 127 | void update () |
138 | MTH void update () |
| 128 | { |
139 | { |
| 129 | if (!(flags_ & P_UPTODATE)) |
140 | if (expect_false (!(flags_ & P_UPTODATE))) |
| 130 | update_ (); |
141 | update_ (); |
| 131 | } |
142 | } |
| 132 | |
143 | |
| 133 | uint8 flags () |
144 | MTH uint8 flags () |
| 134 | { |
145 | { |
| 135 | update (); |
146 | update (); |
| 136 | return flags_; |
147 | return flags_; |
| 137 | } |
148 | } |
|
|
149 | |
|
|
150 | MTH void invalidate () |
|
|
151 | { |
|
|
152 | flags_ = 0; |
|
|
153 | } |
| 138 | |
154 | |
| 139 | // maybe only inline quick flags_ checking? |
|
|
| 140 | object *player () |
155 | MTH object *player () |
| 141 | { |
156 | { |
| 142 | // search from the top, because players are usually on top |
157 | object *op; |
| 143 | // make usually == always and this non-amortized O(1) |
158 | |
| 144 | // could gte rid of P_PLAYER, too, then |
|
|
| 145 | if (flags () & P_PLAYER) |
159 | if (flags () & P_PLAYER) |
| 146 | for (object *op = top; op; op = op->below) |
160 | for (op = top; op->type != PLAYER; op = op->below) |
| 147 | if (op->type == PLAYER) |
161 | ; |
| 148 | return op; |
162 | else |
|
|
163 | op = 0; |
| 149 | |
164 | |
| 150 | return 0; |
165 | return op; |
| 151 | } |
166 | } |
| 152 | |
167 | |
| 153 | // return the item volume on this mapspace in cm³ |
168 | // return the item volume on this mapspace in cm³ |
| 154 | uint64 volume () const; |
169 | MTH uint64 volume () const; |
| 155 | |
170 | |
| 156 | bool blocks (MoveType mt) const |
171 | bool blocks (MoveType mt) const |
| 157 | { |
172 | { |
| 158 | return move_block && (mt & move_block) == mt; |
173 | return move_block && (mt & move_block) == mt; |
| 159 | } |
174 | } |
|
|
175 | |
|
|
176 | bool blocks (object *op) const |
|
|
177 | { |
|
|
178 | return blocks (op->move_type); |
|
|
179 | } |
|
|
180 | }; |
|
|
181 | |
|
|
182 | // a rectangular area of a map |
|
|
183 | struct maprect |
|
|
184 | { |
|
|
185 | maptile *m; |
|
|
186 | int x0, y0; |
|
|
187 | int x1, y1; |
|
|
188 | int dx, dy; // offset to go from local coordinates to original tile */ |
| 160 | }; |
189 | }; |
| 161 | |
190 | |
| 162 | struct shopitems : zero_initialised |
191 | struct shopitems : zero_initialised |
| 163 | { |
192 | { |
| 164 | const char *name; /* name of the item in question, null if it is the default item */ |
193 | const char *name; /* name of the item in question, null if it is the default item */ |
| … | |
… | |
| 216 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
245 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
| 217 | |
246 | |
| 218 | bool ACC (RW, per_player); |
247 | bool ACC (RW, per_player); |
| 219 | bool ACC (RW, per_party); |
248 | bool ACC (RW, per_party); |
| 220 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
249 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
| 221 | bool ACC (RW, nodrop); /* avoid dropping anything on this map */ |
250 | bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */ |
| 222 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
251 | sint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
|
|
252 | static sint8 outdoor_darkness; /* the global darkness level outside */ |
| 223 | |
253 | |
| 224 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
254 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
| 225 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
255 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
| 226 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
256 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
| 227 | sint16 ACC (RW, temp); /* base temperature of this tile (F) */ |
257 | sint16 ACC (RW, temp); /* base temperature of this tile (F) */ |
| … | |
… | |
| 242 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
272 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
| 243 | shstr ACC (RW, path); /* Filename of the map */ |
273 | shstr ACC (RW, path); /* Filename of the map */ |
| 244 | int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace |
274 | int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace |
| 245 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
275 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
| 246 | |
276 | |
|
|
277 | // the maptile:: is neccessary here for the perl interface to work |
|
|
278 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
|
|
279 | { |
|
|
280 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
|
|
281 | } |
|
|
282 | |
|
|
283 | static void adjust_daylight (); |
|
|
284 | |
| 247 | MTH void activate (); |
285 | MTH void activate (); |
| 248 | MTH void deactivate (); |
286 | MTH void deactivate (); |
| 249 | |
287 | |
| 250 | // allocates all (empty) mapspace |
288 | // allocates all (empty) mapspace |
| 251 | MTH void alloc (); |
289 | MTH void alloc (); |
| … | |
… | |
| 254 | |
292 | |
| 255 | MTH void fix_auto_apply (); |
293 | MTH void fix_auto_apply (); |
| 256 | MTH void do_decay_objects (); |
294 | MTH void do_decay_objects (); |
| 257 | MTH void update_buttons (); |
295 | MTH void update_buttons (); |
| 258 | MTH int change_map_light (int change); |
296 | MTH int change_map_light (int change); |
| 259 | static void change_all_map_light (int change); //PERL |
|
|
| 260 | MTH void set_darkness_map (); |
|
|
| 261 | MTH int estimate_difficulty () const; |
297 | MTH int estimate_difficulty () const; |
| 262 | |
298 | |
| 263 | MTH void play_sound (faceidx sound, int x, int y) const; |
299 | MTH void play_sound (faceidx sound, int x, int y) const; |
|
|
300 | MTH void say_msg (const char *msg, int x, int y) const; |
|
|
301 | |
|
|
302 | // connected links |
|
|
303 | oblinkpt *find_link (shstr_tmp id); |
|
|
304 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
| 264 | |
305 | |
| 265 | // set the given flag on all objects in the map |
306 | // set the given flag on all objects in the map |
| 266 | MTH void set_object_flag (int flag, int value = 1); |
307 | MTH void set_object_flag (int flag, int value = 1); |
|
|
308 | MTH void post_load_original (); |
| 267 | |
309 | |
| 268 | MTH void link_multipart_objects (); |
310 | MTH void link_multipart_objects (); |
| 269 | MTH void clear_unique_items (); |
311 | MTH void clear_unique_items (); |
| 270 | |
312 | |
| 271 | MTH void clear_header (); |
313 | MTH void clear_header (); |
| … | |
… | |
| 300 | |
342 | |
| 301 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
343 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
| 302 | |
344 | |
| 303 | MTH void touch () { last_access = runtime; } |
345 | MTH void touch () { last_access = runtime; } |
| 304 | |
346 | |
| 305 | MTH bool tile_available (int dir, bool load = true); |
347 | MTH maptile *tile_available (int dir, bool load = true); |
| 306 | |
348 | |
| 307 | // find the map that is at coordinate x|y relative to this map |
349 | // find the map that is at coordinate x|y relative to this map |
| 308 | // TODO: need a better way than passing by reference |
350 | // TODO: need a better way than passing by reference |
| 309 | // TODO: make perl interface |
351 | // TODO: make perl interface |
| 310 | maptile *xy_find (sint16 &x, sint16 &y); |
352 | maptile *xy_find (sint16 &x, sint16 &y); |
| … | |
… | |
| 327 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
369 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
| 328 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
370 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
| 329 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
371 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
| 330 | object *pick_random_object (rand_gen &gen = rndm) const; |
372 | object *pick_random_object (rand_gen &gen = rndm) const; |
| 331 | |
373 | |
| 332 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
374 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
| 333 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
375 | |
|
|
376 | // return an array of maprects corresponding |
|
|
377 | // to the given rectangular area. the last rect will have |
|
|
378 | // a 0 map pointer. |
|
|
379 | // the array will be stored in a static memory area, |
|
|
380 | // so recursion is not atm. supported |
|
|
381 | maprect *split_to_tiles (int x0, int y0, int x1, int y1); |
| 334 | }; |
382 | }; |
| 335 | |
383 | |
| 336 | /* This is used by get_rangevector to determine where the other |
384 | /* This is used by get_rangevector to determine where the other |
| 337 | * creature is. get_rangevector takes into account map tiling, |
385 | * creature is. get_rangevector takes into account map tiling, |
| 338 | * so you just can not look the the map coordinates and get the |
386 | * so you just can not look the the map coordinates and get the |
| … | |
… | |
| 356 | // and so on. |
404 | // and so on. |
| 357 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
405 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
| 358 | int out_of_map (maptile *m, int x, int y); |
406 | int out_of_map (maptile *m, int x, int y); |
| 359 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
407 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
| 360 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
408 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
| 361 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
409 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
| 362 | int on_same_map (const object *op1, const object *op2); |
410 | int on_same_map (const object *op1, const object *op2); |
| 363 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
411 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
| 364 | |
412 | |
| 365 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
413 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
| 366 | static inline bool |
414 | static inline bool |
| … | |
… | |
| 420 | bool normalise () |
468 | bool normalise () |
| 421 | { |
469 | { |
| 422 | return xy_normalise (m, x, y); |
470 | return xy_normalise (m, x, y); |
| 423 | } |
471 | } |
| 424 | |
472 | |
|
|
473 | mapspace &ms () const |
|
|
474 | { |
|
|
475 | return m->at (x, y); |
|
|
476 | } |
|
|
477 | |
| 425 | object *insert (object *op, object *originator = 0, int flags = 0) const |
478 | object *insert (object *op, object *originator = 0, int flags = 0) const |
| 426 | { |
479 | { |
| 427 | m->insert (op, x, y, originator, flags); |
480 | return m->insert (op, x, y, originator, flags); |
| 428 | } |
481 | } |
| 429 | }; |
482 | }; |
| 430 | |
483 | |
| 431 | inline const mapxy & |
484 | inline const mapxy & |
| 432 | object::operator =(const mapxy &pos) |
485 | object::operator =(const mapxy &pos) |
| … | |
… | |
| 436 | y = pos.y; |
489 | y = pos.y; |
| 437 | |
490 | |
| 438 | return pos; |
491 | return pos; |
| 439 | } |
492 | } |
| 440 | |
493 | |
|
|
494 | // iterate over a rectangular area relative to op |
|
|
495 | // can be used as a single statement, but both iterate macros |
|
|
496 | // invocations must not be followed by a ";" |
|
|
497 | // see common/los.C for usage example |
|
|
498 | // the walk will be ordered, outer loop x, inner loop y |
|
|
499 | // m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op |
|
|
500 | // "continue" will skip to the next space |
|
|
501 | #define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \ |
|
|
502 | for (int dx = (dx0); dx <= (dx1); ++dx) \ |
|
|
503 | { \ |
|
|
504 | sint16 nx, ny; \ |
|
|
505 | maptile *m = 0; \ |
|
|
506 | \ |
|
|
507 | for (int dy = (dy0); dy <= (dy1); ++dy) \ |
|
|
508 | { \ |
|
|
509 | /* check to see if we can simply go one down quickly, */ \ |
|
|
510 | /* if not, do it the slow way */ \ |
|
|
511 | if (!m || ++ny >= m->height) \ |
|
|
512 | { \ |
|
|
513 | nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \ |
|
|
514 | \ |
|
|
515 | if (!xy_normalise (m, nx, ny)) \ |
|
|
516 | m = 0; \ |
|
|
517 | } |
|
|
518 | |
|
|
519 | #define ordered_mapwalk_end \ |
|
|
520 | } \ |
|
|
521 | } |
|
|
522 | |
|
|
523 | // loop over every space in the given maprect, |
|
|
524 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
|
|
525 | // the iterator code must be a single statement following this macro call, similar to "if" |
|
|
526 | // "continue" will skip to the next space |
|
|
527 | #define rect_mapwalk(rect,dx0,dy0) \ |
|
|
528 | statementvar (maptile *, m, (rect)->m) \ |
|
|
529 | for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \ |
|
|
530 | for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \ |
|
|
531 | statementvar (int, dx, nx + (rect)->dx - (dx0)) \ |
|
|
532 | statementvar (int, dy, ny + (rect)->dy - (dy0)) |
|
|
533 | |
|
|
534 | // same as ordered_mapwalk, but the walk will not follow any particular |
|
|
535 | // order (unorded), but is likely faster. |
|
|
536 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
|
|
537 | // "continue" will skip to the next space |
|
|
538 | #define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \ |
|
|
539 | for (maprect *r_e_c_t = (map)->split_to_tiles ( \ |
|
|
540 | (ox) + (dx0) , (oy) + (dy0) , \ |
|
|
541 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
|
|
542 | r_e_c_t->m; \ |
|
|
543 | ++r_e_c_t) \ |
|
|
544 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
|
|
545 | |
|
|
546 | #define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ |
|
|
547 | unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
|
|
548 | |
| 441 | #endif |
549 | #endif |
| 442 | |
550 | |
