1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002-2005 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
… | |
… | |
48 | * map pointers. |
48 | * map pointers. |
49 | */ |
49 | */ |
50 | #define MAGIC_MAP_SIZE 50 |
50 | #define MAGIC_MAP_SIZE 50 |
51 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
51 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
52 | |
52 | |
53 | #define MAP_LAYERS 3 |
53 | #define MAP_LAYERS 3 |
54 | |
54 | |
55 | // tile map index |
55 | // tile map index |
56 | enum { |
56 | enum { |
57 | TILE_UP = 0, |
57 | TILE_NORTH, |
58 | TILE_RIGHT = 1, |
58 | TILE_EAST, |
|
|
59 | TILE_SOUTH, |
|
|
60 | TILE_WEST, |
|
|
61 | TILE_UP, |
59 | TILE_DOWN = 2, |
62 | TILE_DOWN, |
60 | TILE_LEFT = 3, |
63 | TILE_NUM, |
61 | }; |
64 | }; |
62 | |
65 | |
63 | /* Values for in_memory below */ |
66 | /* Values for state below */ |
64 | enum { |
67 | enum { |
65 | MAP_ACTIVE, |
68 | MAP_SWAPPED, // header loaded, nothing else |
66 | MAP_INACTIVE, // not used atm. |
69 | MAP_INACTIVE, // in memory, linkable, but not active |
67 | MAP_SWAPPED, |
70 | MAP_ACTIVE, // running! |
68 | MAP_LOADING, |
|
|
69 | MAP_SAVING, |
|
|
70 | }; |
71 | }; |
71 | |
72 | |
72 | /* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should |
73 | /* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should |
73 | * really be used, as it is multi tile aware. However, there are some cases |
74 | * really be used, as it is multi tile aware. However, there are some cases |
74 | * where it is known the map is not tiled or the values are known |
75 | * where it is known the map is not tiled or the values are known |
… | |
… | |
131 | sint8 ACC (RW, light); /* How much light this space provides */ |
132 | sint8 ACC (RW, light); /* How much light this space provides */ |
132 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
133 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
133 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
134 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
134 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
135 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
135 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
136 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
136 | uint16_t ACC (RW, nrof_); // saturates at 64k |
137 | uint16_t ACC (RW, items_); // saturates at 64k |
137 | uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) |
138 | uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) |
138 | uint32_t ACC (RW, smell); // the last count a player was seen here, or 0 |
139 | uint32_t ACC (RW, smell); // the last count a player was seen here, or 0 |
139 | static uint32_t ACC (RW, smellcount); // global smell counter |
140 | static uint32_t ACC (RW, smellcount); // global smell counter |
140 | |
141 | |
141 | uint32_t pad1_, pad2_; // pad to 64 bytes on 64 bit systems |
142 | uint32_t pad1_; // pad to 64 bytes on 64 bit systems |
142 | |
143 | |
143 | //-GPL |
144 | //-GPL |
144 | |
145 | |
145 | void update_ (); |
146 | void update_ (); |
146 | MTH void update () |
147 | MTH void update () |
147 | { |
148 | { |
148 | // we take advantage of the fact that 0x80 is the sign bit |
149 | // we take advantage of the fact that 0x80 is the sign bit |
149 | // to generate more efficient code on many cpus |
150 | // to generate more efficient code on many cpus |
150 | assert (P_UPTODATE == 0x80); |
151 | assert (sint8 (P_UPTODATE) < 0); |
|
|
152 | assert (sint8 (-1 & ~P_UPTODATE) >= 0); |
151 | |
153 | |
152 | if (expect_false (sint8 (flags_) < 0)) |
154 | if (expect_false (sint8 (flags_) >= 0)) |
153 | update_ (); |
155 | update_ (); |
154 | |
156 | |
155 | // must be true by now |
157 | // must be true by now (gcc seems content with only the second test) |
156 | assume (sint8 (flags_) < 0); |
158 | assume (sint8 (flags_) < 0); |
157 | assume (flags_ & P_UPTODATE); |
159 | assume (flags_ & P_UPTODATE); |
158 | } |
160 | } |
159 | |
161 | |
160 | MTH uint8 flags () |
162 | MTH uint8 flags () |
… | |
… | |
179 | op = 0; |
181 | op = 0; |
180 | |
182 | |
181 | return op; |
183 | return op; |
182 | } |
184 | } |
183 | |
185 | |
184 | MTH uint32 nrof () |
186 | MTH uint32 items() |
185 | { |
187 | { |
186 | update (); |
188 | update (); |
187 | return nrof_; |
189 | return items_; |
188 | } |
190 | } |
189 | |
191 | |
190 | // return the item volume on this mapspace in cm³ |
192 | // return the item volume on this mapspace in cm³ |
191 | MTH uint64 volume () |
193 | MTH uint64 volume () |
192 | { |
194 | { |
… | |
… | |
203 | { |
205 | { |
204 | return blocks (op->move_type); |
206 | return blocks (op->move_type); |
205 | } |
207 | } |
206 | }; |
208 | }; |
207 | |
209 | |
208 | // a rectangular area of a map |
210 | // a rectangular area of a map, used my split_to_tiles/unordered_mapwalk |
209 | struct maprect |
211 | struct maprect |
210 | { |
212 | { |
211 | maptile *m; |
213 | maptile *m; |
212 | int x0, y0; |
214 | int x0, y0; |
213 | int x1, y1; |
215 | int x1, y1; |
214 | int dx, dy; // offset to go from local coordinates to original tile */ |
216 | int dx, dy; // offset to go from local coordinates to original tile */ |
215 | }; |
217 | }; |
|
|
218 | |
|
|
219 | // (refcounted) list of objects on this map that need physics processing |
|
|
220 | struct physics_queue |
|
|
221 | : unordered_vector<object *> |
|
|
222 | { |
|
|
223 | int i; // already processed |
|
|
224 | physics_queue (); |
|
|
225 | object *pop (); |
|
|
226 | }; |
|
|
227 | |
|
|
228 | #define PHYSICS_QUEUES 16 // "activity" at least every 16 ticks |
216 | |
229 | |
217 | //+GPL |
230 | //+GPL |
218 | |
231 | |
219 | struct shopitems : zero_initialised |
232 | struct shopitems : zero_initialised |
220 | { |
233 | { |
… | |
… | |
262 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
275 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
263 | bool ACC (RW, no_reset); // must not reset this map |
276 | bool ACC (RW, no_reset); // must not reset this map |
264 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
277 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
265 | * players entering/exiting map |
278 | * players entering/exiting map |
266 | */ |
279 | */ |
|
|
280 | uint8 ACC (RW, state); /* If not true, the map has been freed and must |
|
|
281 | * be loaded before used. The map,omap and map_ob |
|
|
282 | * arrays will be allocated when the map is loaded */ |
267 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
283 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
268 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
284 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
269 | uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must |
|
|
270 | * be loaded before used. The map,omap and map_ob |
|
|
271 | * arrays will be allocated when the map is loaded */ |
|
|
272 | sint16 players; /* How many players are on this map right now */ |
285 | sint16 players; /* How many players are on this map right now */ |
273 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
286 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
274 | |
287 | |
275 | bool ACC (RW, per_player); |
288 | bool ACC (RW, per_player); |
276 | bool ACC (RW, per_party); |
289 | bool ACC (RW, per_party); |
… | |
… | |
280 | static sint8 outdoor_darkness; /* the global darkness level outside */ |
293 | static sint8 outdoor_darkness; /* the global darkness level outside */ |
281 | |
294 | |
282 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
295 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
283 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
296 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
284 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
297 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
285 | sint16 ACC (RW, temp); /* base temperature of this tile (F) */ |
|
|
286 | sint16 ACC (RW, pressure); /* barometric pressure (mb) */ |
|
|
287 | sint8 ACC (RW, humid); /* humitidy of this tile */ |
|
|
288 | sint8 ACC (RW, windspeed); /* windspeed of this tile */ |
|
|
289 | sint8 ACC (RW, winddir); /* direction of wind */ |
|
|
290 | sint8 ACC (RW, sky); /* sky conditions */ |
|
|
291 | int ACC (RW, worldpartx), ACC (RW, worldparty); /*Highly fasten conversion between worldmap and weathermap */ |
|
|
292 | struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ |
298 | struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ |
293 | shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ |
299 | shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ |
294 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
300 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
295 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
301 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
296 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
302 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
297 | shstr ACC (RW, msg); /* Message map creator may have left */ |
303 | shstr ACC (RW, msg); /* Message map creator may have left */ |
298 | shstr ACC (RW, maplore); /* Map lore information */ |
304 | shstr ACC (RW, maplore); /* Map lore information */ |
299 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
305 | shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */ |
300 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
306 | maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */ |
301 | shstr ACC (RW, path); /* Filename of the map */ |
307 | shstr ACC (RW, path); /* Filename of the map */ |
302 | int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace |
|
|
303 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
308 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
304 | int ACC (RW, max_items); // maximum number of items on a mapspace |
309 | int ACC (RW, max_items); // maximum number of items on a mapspace |
305 | |
310 | |
306 | //-GPL |
311 | //-GPL |
|
|
312 | |
|
|
313 | physics_queue pq[PHYSICS_QUEUES]; |
|
|
314 | MTH void queue_physics (object *ob, int after = 0); |
|
|
315 | MTH void queue_physics_at (int x, int y); |
|
|
316 | MTH void post_load_physics (); |
|
|
317 | MTH int run_physics (tick_t tick, int max_objects); |
307 | |
318 | |
308 | // the maptile:: is neccessary here for the perl interface to work |
319 | // the maptile:: is neccessary here for the perl interface to work |
309 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
320 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
310 | { |
321 | { |
311 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
322 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
… | |
… | |
319 | // allocates all (empty) mapspace |
330 | // allocates all (empty) mapspace |
320 | MTH void alloc (); |
331 | MTH void alloc (); |
321 | // deallocates the mapspaces (and destroys all objects) |
332 | // deallocates the mapspaces (and destroys all objects) |
322 | MTH void clear (); |
333 | MTH void clear (); |
323 | |
334 | |
|
|
335 | MTH void post_load (); // update cached values in mapspaces etc. |
324 | MTH void fix_auto_apply (); |
336 | MTH void fix_auto_apply (); |
325 | MTH void do_decay_objects (); |
337 | MTH void do_decay_objects (); |
326 | MTH void update_buttons (); |
338 | MTH void update_buttons (); |
327 | MTH int change_map_light (int change); |
339 | MTH int change_map_light (int change); |
328 | MTH int estimate_difficulty () const; |
340 | MTH int estimate_difficulty () const; |
329 | |
341 | |
330 | MTH void play_sound (faceidx sound, int x, int y) const; |
342 | MTH void play_sound (faceidx sound, int x, int y) const; |
331 | MTH void say_msg (const char *msg, int x, int y) const; |
343 | MTH void say_msg (const_utf8_string msg, int x, int y) const; |
332 | |
344 | |
333 | // connected links |
345 | // connected links |
334 | oblinkpt *find_link (shstr_tmp id); |
346 | oblinkpt *find_link (shstr_tmp id); |
335 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
347 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
336 | |
348 | |
… | |
… | |
354 | bool _load_objects (object_thawer &thawer); |
366 | bool _load_objects (object_thawer &thawer); |
355 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
367 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
356 | |
368 | |
357 | // save objects into the given file (uses IO_ flags) |
369 | // save objects into the given file (uses IO_ flags) |
358 | bool _save_objects (object_freezer &freezer, int flags); |
370 | bool _save_objects (object_freezer &freezer, int flags); |
359 | MTH bool _save_objects (const char *path, int flags); |
371 | MTH bool _save_objects (const_octet_string path, int flags); |
360 | |
372 | |
361 | // save the header pseudo object _only_ |
373 | // save the header pseudo object _only_ |
362 | bool _save_header (object_freezer &freezer); |
374 | bool _save_header (object_freezer &freezer); |
363 | MTH bool _save_header (const char *path); |
375 | MTH bool _save_header (const_octet_string path); |
364 | |
376 | |
365 | maptile (); |
377 | maptile (); |
366 | maptile (int w, int h); |
378 | maptile (int w, int h); |
|
|
379 | void init (); |
367 | ~maptile (); |
380 | ~maptile (); |
368 | |
381 | |
369 | void do_destroy (); |
382 | void do_destroy (); |
370 | void gather_callbacks (AV *&callbacks, event_type event) const; |
383 | void gather_callbacks (AV *&callbacks, event_type event) const; |
|
|
384 | |
|
|
385 | MTH bool linkable () { return state >= MAP_INACTIVE; } |
371 | |
386 | |
372 | MTH int size () const { return width * height; } |
387 | MTH int size () const { return width * height; } |
373 | |
388 | |
374 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
389 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
375 | |
390 | |
… | |
… | |
392 | { |
407 | { |
393 | if (!spaces) |
408 | if (!spaces) |
394 | do_load_sync (); |
409 | do_load_sync (); |
395 | } |
410 | } |
396 | |
411 | |
397 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
412 | void make_map_floor (char **layout, const char *floorstyle, random_map_params *RP); |
398 | bool generate_random_map (random_map_params *RP); |
413 | bool generate_random_map (random_map_params *RP); |
399 | |
414 | |
400 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
415 | static maptile *find_async (const_utf8_string path, maptile *original = 0, bool load = true);//PERL |
401 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
416 | static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL |
402 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
417 | static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL |
403 | object *pick_random_object (rand_gen &gen = rndm) const; |
418 | object *pick_random_object (rand_gen &gen = rndm) const; |
404 | |
419 | |
405 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
420 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
406 | |
421 | |
407 | // return an array of maprects corresponding |
422 | // return an array of maprects corresponding |
408 | // to the given rectangular area. the last rect will have |
423 | // to the given rectangular area. the last rect will have |
409 | // a 0 map pointer. |
424 | // a 0 map pointer. |
410 | // the array will be stored in a static memory area, |
|
|
411 | // so recursion is not atm. supported |
|
|
412 | maprect *split_to_tiles (int x0, int y0, int x1, int y1); |
425 | maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1); |
|
|
426 | |
|
|
427 | MTH bool is_in_shop (int x, int y) const; |
413 | }; |
428 | }; |
|
|
429 | |
|
|
430 | inline bool |
|
|
431 | object::is_in_shop () const |
|
|
432 | { |
|
|
433 | return is_on_map () |
|
|
434 | && map->is_in_shop (x, y); |
|
|
435 | } |
414 | |
436 | |
415 | //+GPL |
437 | //+GPL |
416 | |
438 | |
417 | /* This is used by get_rangevector to determine where the other |
439 | /* This is used by get_rangevector to determine where the other |
418 | * creature is. get_rangevector takes into account map tiling, |
440 | * creature is. get_rangevector takes into account map tiling, |
… | |
… | |
437 | // and so on. |
459 | // and so on. |
438 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
460 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
439 | int out_of_map (maptile *m, int x, int y); |
461 | int out_of_map (maptile *m, int x, int y); |
440 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
462 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
441 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
463 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
442 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
464 | void get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
443 | int on_same_map (const object *op1, const object *op2); |
465 | int on_same_map (const object *op1, const object *op2); |
444 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
466 | int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy); |
445 | |
467 | |
446 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
468 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
447 | static inline bool |
469 | static inline bool |
448 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
470 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
449 | { |
471 | { |
… | |
… | |
553 | |
575 | |
554 | #define ordered_mapwalk_end \ |
576 | #define ordered_mapwalk_end \ |
555 | } \ |
577 | } \ |
556 | } |
578 | } |
557 | |
579 | |
|
|
580 | extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations |
|
|
581 | |
558 | // loop over every space in the given maprect, |
582 | // loop over every space in the given maprect, |
559 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
583 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
560 | // the iterator code must be a single statement following this macro call, similar to "if" |
584 | // the iterator code must be a single statement following this macro call, similar to "if" |
561 | // "continue" will skip to the next space |
585 | // "continue" will skip to the next space |
562 | #define rect_mapwalk(rect,dx0,dy0) \ |
586 | #define rect_mapwalk(rect,dx0,dy0) \ |
… | |
… | |
568 | |
592 | |
569 | // same as ordered_mapwalk, but the walk will not follow any particular |
593 | // same as ordered_mapwalk, but the walk will not follow any particular |
570 | // order (unorded), but is likely faster. |
594 | // order (unorded), but is likely faster. |
571 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
595 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
572 | // "continue" will skip to the next space |
596 | // "continue" will skip to the next space |
573 | #define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \ |
597 | #define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \ |
574 | for (maprect *r_e_c_t = (map)->split_to_tiles ( \ |
598 | for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \ |
575 | (ox) + (dx0) , (oy) + (dy0) , \ |
599 | (ox) + (dx0) , (oy) + (dy0) , \ |
576 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
600 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
577 | r_e_c_t->m; \ |
601 | r_e_c_t->m; \ |
578 | ++r_e_c_t) \ |
602 | ++r_e_c_t) \ |
579 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
603 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
580 | |
604 | |
581 | #define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ |
605 | #define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \ |
582 | unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
606 | unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
583 | |
607 | |
584 | #endif |
608 | #endif |
585 | |
609 | |