ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/map.h
(Generate patch)

Comparing deliantra/server/include/map.h (file contents):
Revision 1.117 by root, Sun Nov 8 15:11:23 2009 UTC vs.
Revision 1.153 by root, Wed Nov 16 23:42:00 2016 UTC

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,2012,2013,2014,2015,2016 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.
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 Affero GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * and the GNU General Public License along with this program. If not, see 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * 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>
23 */ 23 */
24 24
25/* 25/*
26 * The maptile is allocated each time a new map is opened. 26 * The maptile is allocated each time a new map is opened.
… …
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
56enum { 56enum
57 TILE_UP = 0, 57{
58 TILE_RIGHT = 1, 58 TILE_NORTH,
59 TILE_SOUTH,
60 TILE_WEST,
61 TILE_EAST,
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 */
64enum { 70enum
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
124enum
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
… …
131 sint8 ACC (RW, light); /* How much light this space provides */ 142 sint8 ACC (RW, light); /* How much light this space provides */
132 MoveType ACC (RW, move_block); /* What movement types this space blocks */ 143 MoveType ACC (RW, move_block); /* What movement types this space blocks */
133 MoveType ACC (RW, move_slow); /* What movement types this space slows */ 144 MoveType ACC (RW, move_slow); /* What movement types this space slows */
134 MoveType ACC (RW, move_on); /* What movement types are activated */ 145 MoveType ACC (RW, move_on); /* What movement types are activated */
135 MoveType ACC (RW, move_off); /* What movement types are activated */ 146 MoveType ACC (RW, move_off); /* What movement types are activated */
136 uint16_t ACC (RW, nrof_); // 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 ()
147 { 159 {
148 // we take advantage of the fact that 0x80 is the sign bit 160 // we take advantage of the fact that 0x80 is the sign bit
149 // to generate more efficient code on many cpus 161 // to generate more efficient code on many cpus
150 assert (P_UPTODATE == 0x80); 162 assert (sint8 (P_UPTODATE) < 0);
163 assert (sint8 (-1 & ~P_UPTODATE) >= 0);
151 164
152 if (expect_false (sint8 (flags_) < 0)) 165 if (expect_false (sint8 (flags_) >= 0))
153 update_ (); 166 update_ ();
154 167
155 // must be true by now 168 // must be true by now (gcc seems content with only the second test)
156 assume (sint8 (flags_) < 0); 169 assume (sint8 (flags_) < 0);
157 assume (flags_ & P_UPTODATE); 170 assume (flags_ & P_UPTODATE);
158 } 171 }
159 172
160 MTH uint8 flags () 173 MTH uint8 flags ()
161 { 174 {
162 update (); 175 update ();
163 return flags_; 176 return flags_;
164 } 177 }
165 178
179 MTH void update_up ();
180
166 MTH void invalidate () 181 MTH void invalidate ()
167 { 182 {
168 flags_ = 0; 183 flags_ = 0;
169 } 184
185 if (pflags)
186 update_up ();
170 187 }
188
171 MTH object *player () 189 MTH object *player ()
172 { 190 {
173 object *op; 191 object *op;
174 192
175 if (flags () & P_PLAYER) 193 if (flags () & P_PLAYER)
… …
179 op = 0; 197 op = 0;
180 198
181 return op; 199 return op;
182 } 200 }
183 201
184 MTH uint32 nrof () 202 MTH uint32 items()
185 { 203 {
186 update (); 204 update ();
187 return nrof_; 205 return items_;
188 } 206 }
189 207
190 // return the item volume on this mapspace in cm³ 208 // return the item volume on this mapspace in cm³
191 MTH uint64 volume () 209 MTH volume_t volume ()
192 { 210 {
193 update (); 211 update ();
194 return volume_ * 1024; 212 return volume_ * 1024;
195 } 213 }
196 214
… …
203 { 221 {
204 return blocks (op->move_type); 222 return blocks (op->move_type);
205 } 223 }
206}; 224};
207 225
208// a rectangular area of a map 226// a rectangular area of a map, used my split_to_tiles/unordered_mapwalk
209struct maprect 227struct maprect
210{ 228{
211 maptile *m; 229 maptile *m;
212 int x0, y0; 230 int x0, y0;
213 int x1, y1; 231 int x1, y1;
214 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 */
215}; 233};
234
235// (refcounted) list of objects on this map that need physics processing
236struct 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
216 246
217//+GPL 247//+GPL
218 248
219struct shopitems : zero_initialised 249struct shopitems : zero_initialised
220{ 250{
… …
262 bool ACC (RW, dirty); /* if true, something was inserted or removed */ 292 bool ACC (RW, dirty); /* if true, something was inserted or removed */
263 bool ACC (RW, no_reset); // must not reset this map 293 bool ACC (RW, no_reset); // must not reset this map
264 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
265 * players entering/exiting map 295 * players entering/exiting map
266 */ 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 */
267 sint32 ACC (RW, timeout); /* swapout is set to this */ 300 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 */ 301 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 */ 302 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 */ 303 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
274 304
275 bool ACC (RW, per_player); 305 bool ACC (RW, per_player);
276 bool ACC (RW, per_party); 306 bool ACC (RW, per_party);
… …
280 static sint8 outdoor_darkness; /* the global darkness level outside */ 310 static sint8 outdoor_darkness; /* the global darkness level outside */
281 311
282 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 */
283 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 */
284 oblinkpt *buttons; /* Linked list of linked lists of buttons */ 314 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 */ 315 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 */ 316 shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
294 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ 317 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
295 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ 318 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
296 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ 319 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
297 shstr ACC (RW, msg); /* Message map creator may have left */ 320 shstr ACC (RW, msg); /* Message map creator may have left */
298 shstr ACC (RW, maplore); /* Map lore information */ 321 shstr ACC (RW, maplore); /* Map lore information */
299 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ 322 shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
300 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ 323 maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */
301 shstr ACC (RW, path); /* Filename of the map */ 324 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 325 volume_t 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
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 int run_physics (tick_t tick, int max_objects);
334 MTH void activate_physics ();
307 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);
… …
319 // allocates all (empty) mapspace 347 // allocates all (empty) mapspace
320 MTH void alloc (); 348 MTH void alloc ();
321 // deallocates the mapspaces (and destroys all objects) 349 // deallocates the mapspaces (and destroys all objects)
322 MTH void clear (); 350 MTH void clear ();
323 351
352 MTH void post_load (); // update cached values in mapspaces etc.
324 MTH void fix_auto_apply (); 353 MTH void fix_auto_apply ();
325 MTH void do_decay_objects (); 354 MTH void do_decay_objects ();
326 MTH void update_buttons (); 355 MTH void update_buttons ();
327 MTH int change_map_light (int change); 356 MTH int change_map_light (int change);
328 MTH int estimate_difficulty () const; 357 MTH int estimate_difficulty () const;
329 358
330 MTH void play_sound (faceidx sound, int x, int y) const; 359 MTH void play_sound (faceidx sound, int x, int y) const;
331 MTH void say_msg (const char *msg, int x, int y) const; 360 MTH void say_msg (const_utf8_string msg, int x, int y) const;
332 361
333 // connected links 362 // connected links
334 oblinkpt *find_link (shstr_tmp id); 363 oblinkpt *find_link (shstr_tmp id);
335 MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); 364 MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0);
336 365
… …
354 bool _load_objects (object_thawer &thawer); 383 bool _load_objects (object_thawer &thawer);
355 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } 384 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
356 385
357 // save objects into the given file (uses IO_ flags) 386 // save objects into the given file (uses IO_ flags)
358 bool _save_objects (object_freezer &freezer, int flags); 387 bool _save_objects (object_freezer &freezer, int flags);
359 MTH bool _save_objects (const char *path, int flags); 388 MTH bool _save_objects (const_octet_string path, int flags);
360 389
361 // save the header pseudo object _only_ 390 // save the header pseudo object _only_
362 bool _save_header (object_freezer &freezer); 391 bool _save_header (object_freezer &freezer);
363 MTH bool _save_header (const char *path); 392 MTH bool _save_header (const_octet_string path);
364 393
365 maptile (); 394 maptile ();
366 maptile (int w, int h); 395 maptile (int w, int h);
396 void init ();
367 ~maptile (); 397 ~maptile ();
368 398
369 void do_destroy (); 399 void do_destroy ();
370 void gather_callbacks (AV *&callbacks, event_type event) const; 400 void gather_callbacks (AV *&callbacks, event_type event) const;
371 401
402 MTH bool linkable () { return state >= MAP_INACTIVE; }
403
372 MTH int size () const { return width * height; } 404 MTH int size () const { return width * height; }
373 405
374 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 406 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
375 407
376 MTH void touch () { last_access = runtime; } 408 MTH void touch () { last_access = runtime; }
377 409
410 // returns the map at given direction. if the map isn't linked yet,
411 // it will either return false (if load is false), or otherwise try to link
412 // it - if linking fails because the map is not loaded yet, it will
413 // start loading the map and return 0.
414 // thus, if you get 0, the map exists and load is true, then some later
415 // call (some tick or so later...) will eventually succeed.
378 MTH maptile *tile_available (int dir, bool load = true); 416 MTH maptile *tile_available (int dir, bool load = true);
379 417
380 // find the map that is at coordinate x|y relative to this map 418 // find the map that is at coordinate x|y relative to this map
381 // TODO: need a better way than passing by reference 419 // TODO: need a better way than passing by reference
382 // TODO: make perl interface 420 // TODO: make perl interface
… …
392 { 430 {
393 if (!spaces) 431 if (!spaces)
394 do_load_sync (); 432 do_load_sync ();
395 } 433 }
396 434
397 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); 435 void make_map_floor (char **layout, const char *floorstyle, random_map_params *RP);
398 bool generate_random_map (random_map_params *RP); 436 bool generate_random_map (random_map_params *RP);
399 437
400 static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL 438 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 439 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 440 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; 441 object *pick_random_object (rand_gen &gen = rndm) const;
404 442
405 mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 443 mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
406 444
407 // return an array of maprects corresponding 445 // return an array of maprects corresponding
408 // to the given rectangular area. the last rect will have 446 // to the given rectangular area. the last rect will have
409 // a 0 map pointer. 447 // 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); 448 maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1);
449
450 MTH bool is_in_shop (int x, int y) const;
413}; 451};
452
453inline bool
454object::is_in_shop () const
455{
456 return is_on_map ()
457 && map->is_in_shop (x, y);
458}
414 459
415//+GPL 460//+GPL
416 461
417/* This is used by get_rangevector to determine where the other 462/* This is used by get_rangevector to determine where the other
418 * creature is. get_rangevector takes into account map tiling, 463 * creature is. get_rangevector takes into account map tiling,
… …
437// and so on. 482// and so on.
438int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); 483int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
439int out_of_map (maptile *m, int x, int y); 484int out_of_map (maptile *m, int x, int y);
440maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); 485maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
441void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); 486void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
442void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); 487void get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/);
443int on_same_map (const object *op1, const object *op2); 488int on_same_map (const object *op1, const object *op2);
444int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); 489int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy);
445 490
446// adjust map, x and y for tiled maps and return true if the position is valid at all 491// adjust map, x and y for tiled maps and return true if the position is valid at all
447static inline bool 492static inline bool
448xy_normalise (maptile *&map, sint16 &x, sint16 &y) 493xy_normalise (maptile *&map, sint16 &x, sint16 &y)
449{ 494{
… …
553 598
554#define ordered_mapwalk_end \ 599#define ordered_mapwalk_end \
555 } \ 600 } \
556 } 601 }
557 602
603extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
604
605// special "grave" map used to store all removed objects
606// till they can be destroyed - saves a lot of checks in the rest
607// of the code
608struct freed_map
609: maptile
610{
611 freed_map ()
612 : maptile (3, 3)
613 {
614 path = "<freed objects map>";
615 name = "/internal/freed_objects_map";
616 no_drop = 1;
617 no_reset = 1;
618
619 state = MAP_ACTIVE;
620 }
621
622 ~freed_map ()
623 {
624 destroy ();
625 }
626};
627
628// initialised in common/shstr.C, due to shstr usage we need defined
629// initialisation order!
630extern struct freed_map freed_map; // freed objects are moved here to avoid crashes
631
558// loop over every space in the given maprect, 632// 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 633// 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" 634// the iterator code must be a single statement following this macro call, similar to "if"
561// "continue" will skip to the next space 635// "continue" will skip to the next space
562#define rect_mapwalk(rect,dx0,dy0) \ 636#define rect_mapwalk(rect,dx0,dy0) \
… …
568 642
569// same as ordered_mapwalk, but the walk will not follow any particular 643// same as ordered_mapwalk, but the walk will not follow any particular
570// order (unorded), but is likely faster. 644// 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 645// 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 646// "continue" will skip to the next space
573#define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \ 647#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \
574 for (maprect *r_e_c_t = (map)->split_to_tiles ( \ 648 for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \
575 (ox) + (dx0) , (oy) + (dy0) , \ 649 (ox) + (dx0) , (oy) + (dy0) , \
576 (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ 650 (ox) + (dx1) + 1, (oy) + (dy1) + 1); \
577 r_e_c_t->m; \ 651 r_e_c_t->m; \
578 ++r_e_c_t) \ 652 ++r_e_c_t) \
579 rect_mapwalk (r_e_c_t, (ox), (oy)) 653 rect_mapwalk (r_e_c_t, (ox), (oy))
580 654
581#define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ 655#define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \
582 unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1) 656 unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1)
583 657
584#endif 658#endif
585 659

Diff Legend

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