| 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 - toggling the lowest bit reverses direction |
| 56 | enum { |
56 | enum |
| 57 | TILE_UP = 0, |
57 | { |
| 58 | TILE_RIGHT = 1, |
58 | TILE_NORTH, |
|
|
59 | TILE_SOUTH, |
|
|
60 | TILE_EAST , |
|
|
61 | TILE_WEST, |
|
|
62 | TILE_UP, |
| 59 | TILE_DOWN = 2, |
63 | TILE_DOWN, |
| 60 | TILE_LEFT = 3, |
64 | TILE_NUM |
| 61 | }; |
65 | }; |
| 62 | |
66 | |
|
|
67 | #define REVERSE_TILE_DIR(dir) ((dir) ^ 1) |
|
|
68 | |
| 63 | /* Values for in_memory below */ |
69 | /* Values for state below */ |
| 64 | enum { |
70 | enum |
| 65 | MAP_ACTIVE, |
71 | { |
| 66 | MAP_INACTIVE, // not used atm. |
72 | MAP_SWAPPED, // header loaded, nothing else |
| 67 | MAP_SWAPPED, |
73 | MAP_INACTIVE, // in memory, linkable, but not active |
| 68 | MAP_LOADING, |
74 | MAP_ACTIVE, // running! |
| 69 | MAP_SAVING, |
|
|
| 70 | }; |
75 | }; |
| 71 | |
76 | |
| 72 | /* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should |
77 | /* 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 |
78 | * 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 |
79 | * where it is known the map is not tiled or the values are known |
| … | |
… | |
| 88 | * should almost always be using out_of_map instead, which takes into account |
93 | * should almost always be using out_of_map instead, which takes into account |
| 89 | * map tiling. |
94 | * map tiling. |
| 90 | */ |
95 | */ |
| 91 | #define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height))) |
96 | #define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height))) |
| 92 | |
97 | |
| 93 | /* These are used in the MapLook flags element. They are not used in |
98 | /* These are used in the mapspace flags element. They are not used in |
| 94 | * in the object flags structure. |
99 | * in the object flags structure. |
| 95 | */ |
100 | */ |
| 96 | #define P_BLOCKSVIEW 0x01 |
101 | #define P_BLOCKSVIEW 0x01 |
| 97 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
102 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
| 98 | #define P_NO_CLERIC 0x04 /* no clerical spells cast here */ |
103 | #define P_NO_CLERIC 0x04 /* no clerical spells cast here */ |
| … | |
… | |
| 112 | * function that does more of the work can hopefully be used to replace |
117 | * function that does more of the work can hopefully be used to replace |
| 113 | * lots of duplicate checks currently in the code. |
118 | * lots of duplicate checks currently in the code. |
| 114 | */ |
119 | */ |
| 115 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
120 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
| 116 | #define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ |
121 | #define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ |
|
|
122 | |
|
|
123 | // persistent flags (pflags) in mapspace |
|
|
124 | enum |
|
|
125 | { |
|
|
126 | PF_VIS_UP = 0x01, // visible upwards, set by upmap, cleared by mapspace |
|
|
127 | }; |
| 117 | |
128 | |
| 118 | /* Instead of having numerous arrays that have information on a |
129 | /* Instead of having numerous arrays that have information on a |
| 119 | * particular space (was map, floor, floor2, map_ob), |
130 | * particular space (was map, floor, floor2, map_ob), |
| 120 | * have this structure take care of that information. |
131 | * have this structure take care of that information. |
| 121 | * This puts it all in one place, and should also make it easier |
132 | * This puts it all in one place, and should also make it easier |
| … | |
… | |
| 136 | uint16_t ACC (RW, items_); // saturates at 64k |
147 | uint16_t ACC (RW, items_); // saturates at 64k |
| 137 | uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) |
148 | 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 |
149 | 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 |
150 | static uint32_t ACC (RW, smellcount); // global smell counter |
| 140 | |
151 | |
| 141 | uint32_t pad1_, pad2_; // pad to 64 bytes on 64 bit systems |
152 | uint8_t pflags; // additional, persistent flags |
|
|
153 | uint8_t pad [3]; // pad to 64 bytes on LP64 systems |
| 142 | |
154 | |
| 143 | //-GPL |
155 | //-GPL |
| 144 | |
156 | |
| 145 | void update_ (); |
157 | void update_ (); |
| 146 | MTH void update () |
158 | MTH void update () |
| … | |
… | |
| 162 | { |
174 | { |
| 163 | update (); |
175 | update (); |
| 164 | return flags_; |
176 | return flags_; |
| 165 | } |
177 | } |
| 166 | |
178 | |
|
|
179 | MTH void update_up (); |
|
|
180 | |
| 167 | MTH void invalidate () |
181 | MTH void invalidate () |
| 168 | { |
182 | { |
| 169 | flags_ = 0; |
183 | flags_ = 0; |
| 170 | } |
184 | |
|
|
185 | if (pflags) |
|
|
186 | update_up (); |
| 171 | |
187 | } |
|
|
188 | |
| 172 | MTH object *player () |
189 | MTH object *player () |
| 173 | { |
190 | { |
| 174 | object *op; |
191 | object *op; |
| 175 | |
192 | |
| 176 | if (flags () & P_PLAYER) |
193 | if (flags () & P_PLAYER) |
| … | |
… | |
| 204 | { |
221 | { |
| 205 | return blocks (op->move_type); |
222 | return blocks (op->move_type); |
| 206 | } |
223 | } |
| 207 | }; |
224 | }; |
| 208 | |
225 | |
| 209 | // a rectangular area of a map |
226 | // a rectangular area of a map, used my split_to_tiles/unordered_mapwalk |
| 210 | struct maprect |
227 | struct maprect |
| 211 | { |
228 | { |
| 212 | maptile *m; |
229 | maptile *m; |
| 213 | int x0, y0; |
230 | int x0, y0; |
| 214 | int x1, y1; |
231 | int x1, y1; |
| 215 | int dx, dy; // offset to go from local coordinates to original tile */ |
232 | int dx, dy; // offset to go from local coordinates to original tile */ |
| 216 | }; |
233 | }; |
|
|
234 | |
|
|
235 | // (refcounted) list of objects on this map that need physics processing |
|
|
236 | struct physics_queue |
|
|
237 | : unordered_vector<object *> |
|
|
238 | { |
|
|
239 | int i; // already processed |
|
|
240 | physics_queue (); |
|
|
241 | ~physics_queue (); |
|
|
242 | object *pop (); |
|
|
243 | }; |
|
|
244 | |
|
|
245 | #define PHYSICS_QUEUES 16 // "activity" at least every 16 ticks |
| 217 | |
246 | |
| 218 | //+GPL |
247 | //+GPL |
| 219 | |
248 | |
| 220 | struct shopitems : zero_initialised |
249 | struct shopitems : zero_initialised |
| 221 | { |
250 | { |
| … | |
… | |
| 263 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
292 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
| 264 | bool ACC (RW, no_reset); // must not reset this map |
293 | bool ACC (RW, no_reset); // must not reset this map |
| 265 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
294 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
| 266 | * players entering/exiting map |
295 | * players entering/exiting map |
| 267 | */ |
296 | */ |
|
|
297 | uint8 ACC (RW, state); /* If not true, the map has been freed and must |
|
|
298 | * be loaded before used. The map,omap and map_ob |
|
|
299 | * arrays will be allocated when the map is loaded */ |
| 268 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
300 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
| 269 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
301 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
| 270 | uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must |
|
|
| 271 | * be loaded before used. The map,omap and map_ob |
|
|
| 272 | * arrays will be allocated when the map is loaded */ |
|
|
| 273 | sint16 players; /* How many players are on this map right now */ |
302 | sint16 players; /* How many players are on this map right now */ |
| 274 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
303 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
| 275 | |
304 | |
| 276 | bool ACC (RW, per_player); |
305 | bool ACC (RW, per_player); |
| 277 | bool ACC (RW, per_party); |
306 | bool ACC (RW, per_party); |
| … | |
… | |
| 281 | static sint8 outdoor_darkness; /* the global darkness level outside */ |
310 | static sint8 outdoor_darkness; /* the global darkness level outside */ |
| 282 | |
311 | |
| 283 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
312 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
| 284 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
313 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
| 285 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
314 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
| 286 | sint16 ACC (RW, temp); /* base temperature of this tile (F) */ |
|
|
| 287 | sint16 ACC (RW, pressure); /* barometric pressure (mb) */ |
|
|
| 288 | sint8 ACC (RW, humid); /* humitidy of this tile */ |
|
|
| 289 | sint8 ACC (RW, windspeed); /* windspeed of this tile */ |
|
|
| 290 | sint8 ACC (RW, winddir); /* direction of wind */ |
|
|
| 291 | sint8 ACC (RW, sky); /* sky conditions */ |
|
|
| 292 | int ACC (RW, worldpartx), ACC (RW, worldparty); /*Highly fasten conversion between worldmap and weathermap */ |
|
|
| 293 | struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ |
315 | struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ |
| 294 | shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ |
316 | shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ |
| 295 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
317 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
| 296 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
318 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
| 297 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
319 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
| 298 | shstr ACC (RW, msg); /* Message map creator may have left */ |
320 | shstr ACC (RW, msg); /* Message map creator may have left */ |
| 299 | shstr ACC (RW, maplore); /* Map lore information */ |
321 | shstr ACC (RW, maplore); /* Map lore information */ |
| 300 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
322 | shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */ |
| 301 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
323 | maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */ |
| 302 | shstr ACC (RW, path); /* Filename of the map */ |
324 | shstr ACC (RW, path); /* Filename of the map */ |
| 303 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
325 | 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 |
326 | int ACC (RW, max_items); // maximum number of items on a mapspace |
| 305 | |
327 | |
| 306 | //-GPL |
328 | //-GPL |
| 307 | |
329 | |
|
|
330 | physics_queue pq[PHYSICS_QUEUES]; |
|
|
331 | MTH void queue_physics (object *ob, int after = 0); |
|
|
332 | MTH void queue_physics_at (int x, int y); |
|
|
333 | MTH void post_load_physics (); |
|
|
334 | MTH int run_physics (tick_t tick, int max_objects); |
|
|
335 | |
| 308 | // the maptile:: is neccessary here for the perl interface to work |
336 | // the maptile:: is neccessary here for the perl interface to work |
| 309 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
337 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
| 310 | { |
338 | { |
| 311 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
339 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
| 312 | } |
340 | } |
| 313 | |
341 | |
| 314 | static void adjust_daylight (); |
342 | static void adjust_daylight (); |
| 315 | |
343 | |
| 316 | MTH void activate (); |
344 | MTH void activate (); |
|
|
345 | MTH void activate_physics (); |
| 317 | MTH void deactivate (); |
346 | MTH void deactivate (); |
| 318 | |
347 | |
| 319 | // allocates all (empty) mapspace |
348 | // allocates all (empty) mapspace |
| 320 | MTH void alloc (); |
349 | MTH void alloc (); |
| 321 | // deallocates the mapspaces (and destroys all objects) |
350 | // deallocates the mapspaces (and destroys all objects) |
| … | |
… | |
| 327 | MTH void update_buttons (); |
356 | MTH void update_buttons (); |
| 328 | MTH int change_map_light (int change); |
357 | MTH int change_map_light (int change); |
| 329 | MTH int estimate_difficulty () const; |
358 | MTH int estimate_difficulty () const; |
| 330 | |
359 | |
| 331 | MTH void play_sound (faceidx sound, int x, int y) const; |
360 | MTH void play_sound (faceidx sound, int x, int y) const; |
| 332 | MTH void say_msg (const char *msg, int x, int y) const; |
361 | MTH void say_msg (const_utf8_string msg, int x, int y) const; |
| 333 | |
362 | |
| 334 | // connected links |
363 | // connected links |
| 335 | oblinkpt *find_link (shstr_tmp id); |
364 | oblinkpt *find_link (shstr_tmp id); |
| 336 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
365 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
| 337 | |
366 | |
| … | |
… | |
| 355 | bool _load_objects (object_thawer &thawer); |
384 | bool _load_objects (object_thawer &thawer); |
| 356 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
385 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
| 357 | |
386 | |
| 358 | // save objects into the given file (uses IO_ flags) |
387 | // save objects into the given file (uses IO_ flags) |
| 359 | bool _save_objects (object_freezer &freezer, int flags); |
388 | bool _save_objects (object_freezer &freezer, int flags); |
| 360 | MTH bool _save_objects (const char *path, int flags); |
389 | MTH bool _save_objects (const_octet_string path, int flags); |
| 361 | |
390 | |
| 362 | // save the header pseudo object _only_ |
391 | // save the header pseudo object _only_ |
| 363 | bool _save_header (object_freezer &freezer); |
392 | bool _save_header (object_freezer &freezer); |
| 364 | MTH bool _save_header (const char *path); |
393 | MTH bool _save_header (const_octet_string path); |
| 365 | |
394 | |
| 366 | maptile (); |
395 | maptile (); |
| 367 | maptile (int w, int h); |
396 | maptile (int w, int h); |
|
|
397 | void init (); |
| 368 | ~maptile (); |
398 | ~maptile (); |
| 369 | |
399 | |
| 370 | void do_destroy (); |
400 | void do_destroy (); |
| 371 | void gather_callbacks (AV *&callbacks, event_type event) const; |
401 | void gather_callbacks (AV *&callbacks, event_type event) const; |
| 372 | |
402 | |
|
|
403 | MTH bool linkable () { return state >= MAP_INACTIVE; } |
|
|
404 | |
| 373 | MTH int size () const { return width * height; } |
405 | MTH int size () const { return width * height; } |
| 374 | |
406 | |
| 375 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
407 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
| 376 | |
408 | |
| 377 | MTH void touch () { last_access = runtime; } |
409 | MTH void touch () { last_access = runtime; } |
| 378 | |
410 | |
|
|
411 | // returns the map at given direction. if the map isn't linked yet, |
|
|
412 | // it will either return false (if load is false), or otherwise try to link |
|
|
413 | // it - if linking fails because the map is not loaded yet, it will |
|
|
414 | // start loading the map and return 0. |
|
|
415 | // thus, if you get 0, the map exists and load is true, then some later |
|
|
416 | // call (some tick or so later...) will eventually succeed. |
| 379 | MTH maptile *tile_available (int dir, bool load = true); |
417 | MTH maptile *tile_available (int dir, bool load = true); |
| 380 | |
418 | |
| 381 | // find the map that is at coordinate x|y relative to this map |
419 | // find the map that is at coordinate x|y relative to this map |
| 382 | // TODO: need a better way than passing by reference |
420 | // TODO: need a better way than passing by reference |
| 383 | // TODO: make perl interface |
421 | // TODO: make perl interface |
| … | |
… | |
| 393 | { |
431 | { |
| 394 | if (!spaces) |
432 | if (!spaces) |
| 395 | do_load_sync (); |
433 | do_load_sync (); |
| 396 | } |
434 | } |
| 397 | |
435 | |
| 398 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
436 | void make_map_floor (char **layout, const char *floorstyle, random_map_params *RP); |
| 399 | bool generate_random_map (random_map_params *RP); |
437 | bool generate_random_map (random_map_params *RP); |
| 400 | |
438 | |
| 401 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
439 | static maptile *find_async (const_utf8_string path, maptile *original = 0, bool load = true);//PERL |
| 402 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
440 | static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL |
| 403 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
441 | static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL |
| 404 | object *pick_random_object (rand_gen &gen = rndm) const; |
442 | object *pick_random_object (rand_gen &gen = rndm) const; |
| 405 | |
443 | |
| 406 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
444 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
| 407 | |
445 | |
| 408 | // return an array of maprects corresponding |
446 | // return an array of maprects corresponding |
| 409 | // to the given rectangular area. the last rect will have |
447 | // to the given rectangular area. the last rect will have |
| 410 | // a 0 map pointer. |
448 | // a 0 map pointer. |
| 411 | // the array will be stored in a static memory area, |
|
|
| 412 | // so recursion is not atm. supported |
|
|
| 413 | maprect *split_to_tiles (int x0, int y0, int x1, int y1); |
449 | maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1); |
|
|
450 | |
|
|
451 | MTH bool is_in_shop (int x, int y) const; |
| 414 | }; |
452 | }; |
|
|
453 | |
|
|
454 | inline bool |
|
|
455 | object::is_in_shop () const |
|
|
456 | { |
|
|
457 | return is_on_map () |
|
|
458 | && map->is_in_shop (x, y); |
|
|
459 | } |
| 415 | |
460 | |
| 416 | //+GPL |
461 | //+GPL |
| 417 | |
462 | |
| 418 | /* This is used by get_rangevector to determine where the other |
463 | /* This is used by get_rangevector to determine where the other |
| 419 | * creature is. get_rangevector takes into account map tiling, |
464 | * creature is. get_rangevector takes into account map tiling, |
| … | |
… | |
| 438 | // and so on. |
483 | // and so on. |
| 439 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
484 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
| 440 | int out_of_map (maptile *m, int x, int y); |
485 | int out_of_map (maptile *m, int x, int y); |
| 441 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
486 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
| 442 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
487 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
| 443 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
488 | void get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
| 444 | int on_same_map (const object *op1, const object *op2); |
489 | int on_same_map (const object *op1, const object *op2); |
| 445 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
490 | int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy); |
| 446 | |
491 | |
| 447 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
492 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
| 448 | static inline bool |
493 | static inline bool |
| 449 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
494 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
| 450 | { |
495 | { |
| … | |
… | |
| 554 | |
599 | |
| 555 | #define ordered_mapwalk_end \ |
600 | #define ordered_mapwalk_end \ |
| 556 | } \ |
601 | } \ |
| 557 | } |
602 | } |
| 558 | |
603 | |
|
|
604 | extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations |
|
|
605 | |
| 559 | // loop over every space in the given maprect, |
606 | // loop over every space in the given maprect, |
| 560 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
607 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
| 561 | // the iterator code must be a single statement following this macro call, similar to "if" |
608 | // the iterator code must be a single statement following this macro call, similar to "if" |
| 562 | // "continue" will skip to the next space |
609 | // "continue" will skip to the next space |
| 563 | #define rect_mapwalk(rect,dx0,dy0) \ |
610 | #define rect_mapwalk(rect,dx0,dy0) \ |
| … | |
… | |
| 569 | |
616 | |
| 570 | // same as ordered_mapwalk, but the walk will not follow any particular |
617 | // same as ordered_mapwalk, but the walk will not follow any particular |
| 571 | // order (unorded), but is likely faster. |
618 | // order (unorded), but is likely faster. |
| 572 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
619 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
| 573 | // "continue" will skip to the next space |
620 | // "continue" will skip to the next space |
| 574 | #define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \ |
621 | #define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \ |
| 575 | for (maprect *r_e_c_t = (map)->split_to_tiles ( \ |
622 | for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \ |
| 576 | (ox) + (dx0) , (oy) + (dy0) , \ |
623 | (ox) + (dx0) , (oy) + (dy0) , \ |
| 577 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
624 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
| 578 | r_e_c_t->m; \ |
625 | r_e_c_t->m; \ |
| 579 | ++r_e_c_t) \ |
626 | ++r_e_c_t) \ |
| 580 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
627 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
| 581 | |
628 | |
| 582 | #define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ |
629 | #define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \ |
| 583 | unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
630 | unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
| 584 | |
631 | |
| 585 | #endif |
632 | #endif |
| 586 | |
633 | |
