1 |
/* |
2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
* |
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 Mark Wedel & Crossfire Development Team |
6 |
* Copyright (©) 1992 Frank Tore Johansen |
7 |
* |
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 |
10 |
* Free Software Foundation, either version 3 of the License, or (at your |
11 |
* option) any later version. |
12 |
* |
13 |
* This program is distributed in the hope that it will be useful, |
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
* GNU General Public License for more details. |
17 |
* |
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 |
20 |
* <http://www.gnu.org/licenses/>. |
21 |
* |
22 |
* The authors can be reached via e-mail to <support@deliantra.net> |
23 |
*/ |
24 |
|
25 |
/* |
26 |
* The maptile is allocated each time a new map is opened. |
27 |
* It contains pointers (very indirectly) to all objects on the map. |
28 |
*/ |
29 |
|
30 |
#ifndef MAP_H |
31 |
#define MAP_H |
32 |
|
33 |
#include <tr1/unordered_map> |
34 |
|
35 |
//+GPL |
36 |
|
37 |
#include "region.h" |
38 |
#include "cfperl.h" |
39 |
|
40 |
/* We set this size - this is to make magic map work properly on |
41 |
* tiled maps. There is no requirement that this matches the |
42 |
* tiled maps size - it just seemed like a reasonable value. |
43 |
* Magic map code now always starts out putting the player in the |
44 |
* center of the map - this makes the most sense when dealing |
45 |
* with tiled maps. |
46 |
* We also figure out the magicmap color to use as we process the |
47 |
* spaces - this is more efficient as we already have up to date |
48 |
* map pointers. |
49 |
*/ |
50 |
#define MAGIC_MAP_SIZE 50 |
51 |
#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
52 |
|
53 |
#define MAP_LAYERS 3 |
54 |
|
55 |
// tile map index - toggling the lowest bit reverses direction |
56 |
enum |
57 |
{ |
58 |
TILE_NORTH, |
59 |
TILE_SOUTH, |
60 |
TILE_WEST, |
61 |
TILE_EAST, |
62 |
TILE_UP, |
63 |
TILE_DOWN, |
64 |
TILE_NUM |
65 |
}; |
66 |
|
67 |
#define REVERSE_TILE_DIR(dir) ((dir) ^ 1) |
68 |
|
69 |
/* Values for state below */ |
70 |
enum |
71 |
{ |
72 |
MAP_SWAPPED, // header loaded, nothing else |
73 |
MAP_INACTIVE, // in memory, linkable, but not active |
74 |
MAP_ACTIVE, // running! |
75 |
}; |
76 |
|
77 |
/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should |
78 |
* really be used, as it is multi tile aware. However, there are some cases |
79 |
* where it is known the map is not tiled or the values are known |
80 |
* consistent (eg, op->map, op->x, op->y) |
81 |
*/ |
82 |
// all those macros are herewith declared legacy |
83 |
#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
84 |
#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
85 |
#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
86 |
#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
87 |
#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
88 |
#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
89 |
#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on |
90 |
#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off |
91 |
|
92 |
/* You should really know what you are doing before using this - you |
93 |
* should almost always be using out_of_map instead, which takes into account |
94 |
* map tiling. |
95 |
*/ |
96 |
#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height))) |
97 |
|
98 |
/* These are used in the mapspace flags element. They are not used in |
99 |
* in the object flags structure. |
100 |
*/ |
101 |
#define P_BLOCKSVIEW 0x01 |
102 |
#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
103 |
#define P_NO_CLERIC 0x04 /* no clerical spells cast here */ |
104 |
#define P_SAFE 0x08 /* If this is set the map tile is a safe space, |
105 |
* that means, nothing harmful can be done, |
106 |
* such as: bombs, potion usage, alchemy, spells |
107 |
* this was introduced to make shops safer |
108 |
* but is useful in other situations */ |
109 |
|
110 |
#define P_PLAYER 0x10 /* a player (or something seeing these objects) is on this mapspace */ |
111 |
#define P_IS_ALIVE 0x20 /* something alive is on this space */ |
112 |
#define P_UPTODATE 0x80 // this space is up to date |
113 |
|
114 |
/* The following two values are not stored in the MapLook flags, but instead |
115 |
* used in the get_map_flags value - that function is used to return |
116 |
* the flag value, as well as other conditions - using a more general |
117 |
* function that does more of the work can hopefully be used to replace |
118 |
* lots of duplicate checks currently in the code. |
119 |
*/ |
120 |
#define P_OUT_OF_MAP 0x10000 /* This space is outside the 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 |
}; |
128 |
|
129 |
/* Instead of having numerous arrays that have information on a |
130 |
* particular space (was map, floor, floor2, map_ob), |
131 |
* have this structure take care of that information. |
132 |
* This puts it all in one place, and should also make it easier |
133 |
* to extend information about a space. |
134 |
*/ |
135 |
INTERFACE_CLASS (mapspace) |
136 |
struct mapspace |
137 |
{ |
138 |
object *ACC (RW, bot); |
139 |
object *ACC (RW, top); /* lowest/highest object on this space */ |
140 |
object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ |
141 |
uint8 flags_; /* flags about this space (see the P_ values above) */ |
142 |
sint8 ACC (RW, light); /* How much light this space provides */ |
143 |
MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
144 |
MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
145 |
MoveType ACC (RW, move_on); /* What movement types are activated */ |
146 |
MoveType ACC (RW, move_off); /* What movement types are activated */ |
147 |
uint16_t ACC (RW, items_); // saturates at 64k |
148 |
uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) |
149 |
uint32_t ACC (RW, smell); // the last count a player was seen here, or 0 |
150 |
static uint32_t ACC (RW, smellcount); // global smell counter |
151 |
|
152 |
uint8_t pflags; // additional, persistent flags |
153 |
uint8_t pad [3]; // pad to 64 bytes on LP64 systems |
154 |
|
155 |
//-GPL |
156 |
|
157 |
void update_ (); |
158 |
MTH void update () |
159 |
{ |
160 |
// we take advantage of the fact that 0x80 is the sign bit |
161 |
// to generate more efficient code on many cpus |
162 |
//assert (sint8 (P_UPTODATE) < 0); |
163 |
//assert (sint8 (-1 & ~P_UPTODATE) >= 0); |
164 |
|
165 |
if (expect_false (sint8 (flags_) >= 0)) |
166 |
update_ (); |
167 |
|
168 |
// must be true by now (gcc seems content with only the second test) |
169 |
ecb_assume (sint8 (flags_) < 0); |
170 |
ecb_assume (flags_ & P_UPTODATE); |
171 |
} |
172 |
|
173 |
MTH uint8 flags () |
174 |
{ |
175 |
update (); |
176 |
return flags_; |
177 |
} |
178 |
|
179 |
MTH void update_up (); |
180 |
|
181 |
MTH void invalidate () |
182 |
{ |
183 |
flags_ = 0; |
184 |
|
185 |
if (pflags) |
186 |
update_up (); |
187 |
} |
188 |
|
189 |
MTH object *player () |
190 |
{ |
191 |
object *op; |
192 |
|
193 |
if (flags () & P_PLAYER) |
194 |
for (op = top; op->type != PLAYER; op = op->below) |
195 |
; |
196 |
else |
197 |
op = 0; |
198 |
|
199 |
return op; |
200 |
} |
201 |
|
202 |
MTH uint32 items() |
203 |
{ |
204 |
update (); |
205 |
return items_; |
206 |
} |
207 |
|
208 |
// return the item volume on this mapspace in cm³ |
209 |
MTH volume_t volume () |
210 |
{ |
211 |
update (); |
212 |
return volume_ * 1024; |
213 |
} |
214 |
|
215 |
bool blocks (MoveType mt) const |
216 |
{ |
217 |
return move_block && (mt & move_block) == mt; |
218 |
} |
219 |
|
220 |
bool blocks (object *op) const |
221 |
{ |
222 |
return blocks (op->move_type); |
223 |
} |
224 |
}; |
225 |
|
226 |
// a rectangular area of a map, used my split_to_tiles/unordered_mapwalk |
227 |
struct maprect |
228 |
{ |
229 |
maptile *m; |
230 |
int x0, y0; |
231 |
int x1, y1; |
232 |
int dx, dy; // offset to go from local coordinates to original tile */ |
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 |
246 |
|
247 |
//+GPL |
248 |
|
249 |
struct shopitems : zero_initialised |
250 |
{ |
251 |
const char *name; /* name of the item in question, null if it is the default item */ |
252 |
const char *name_pl; /* plural name */ |
253 |
int typenum; /* itemtype number we need to match 0 if it is the default price */ |
254 |
sint8 strength; /* the degree of specialisation the shop has in this item, |
255 |
* as a percentage from -100 to 100 */ |
256 |
int index; /* being the size of the shopitems array. */ |
257 |
}; |
258 |
|
259 |
// map I/O, what to load/save |
260 |
enum { |
261 |
IO_HEADER = 0x01, // the "arch map" pseudo object |
262 |
IO_OBJECTS = 0x02, // the non-unique objects |
263 |
IO_UNIQUES = 0x04, // unique objects |
264 |
}; |
265 |
|
266 |
/* In general, code should always use the macros |
267 |
* above (or functions in map.c) to access many of the |
268 |
* values in the map structure. Failure to do this will |
269 |
* almost certainly break various features. You may think |
270 |
* it is safe to look at width and height values directly |
271 |
* (or even through the macros), but doing so will completely |
272 |
* break map tiling. |
273 |
*/ |
274 |
INTERFACE_CLASS (maptile) |
275 |
struct maptile : zero_initialised, attachable |
276 |
{ |
277 |
sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ |
278 |
struct mapspace *spaces; /* Array of spaces on this map */ |
279 |
uint8 *regions; /* region index per mapspace, if != 0 */ |
280 |
region_ptr *regionmap; /* index to region */ |
281 |
|
282 |
tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ |
283 |
|
284 |
shstr ACC (RW, name); /* Name of map as given by its creator */ |
285 |
region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by |
286 |
* points to the struct containing all the properties of |
287 |
* the region */ |
288 |
double ACC (RW, reset_time); |
289 |
uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map |
290 |
* should be reset |
291 |
*/ |
292 |
bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
293 |
bool ACC (RW, no_reset); // must not reset this map |
294 |
bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
295 |
* players entering/exiting map |
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 */ |
300 |
sint32 ACC (RW, timeout); /* swapout is set to this */ |
301 |
sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
302 |
sint16 players; /* How many players are on this map right now */ |
303 |
uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
304 |
|
305 |
bool ACC (RW, per_player); |
306 |
bool ACC (RW, per_party); |
307 |
bool ACC (RW, outdoor); /* True if an outdoor map */ |
308 |
bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */ |
309 |
sint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
310 |
static sint8 outdoor_darkness; /* the global darkness level outside */ |
311 |
|
312 |
uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
313 |
uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
314 |
oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
315 |
struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ |
316 |
shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ |
317 |
double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
318 |
sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
319 |
sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
320 |
shstr ACC (RW, msg); /* Message map creator may have left */ |
321 |
shstr ACC (RW, maplore); /* Map lore information */ |
322 |
shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */ |
323 |
maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */ |
324 |
shstr ACC (RW, path); /* Filename of the map */ |
325 |
volume_t ACC (RW, max_volume); // maximum volume for all items on a mapspace |
326 |
int ACC (RW, max_items); // maximum number of items on a mapspace |
327 |
|
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 (); |
335 |
|
336 |
// the maptile:: is neccessary here for the perl interface to work |
337 |
MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
338 |
{ |
339 |
return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
340 |
} |
341 |
|
342 |
static void adjust_daylight (); |
343 |
|
344 |
MTH void activate (); |
345 |
MTH void deactivate (); |
346 |
|
347 |
// allocates all (empty) mapspace |
348 |
MTH void alloc (); |
349 |
// deallocates the mapspaces (and destroys all objects) |
350 |
MTH void clear (); |
351 |
|
352 |
MTH void post_load (); // update cached values in mapspaces etc. |
353 |
MTH void fix_auto_apply (); |
354 |
MTH void do_decay_objects (); |
355 |
MTH void update_buttons (); |
356 |
MTH int change_map_light (int change); |
357 |
MTH int estimate_difficulty () const; |
358 |
|
359 |
MTH void play_sound (faceidx sound, int x, int y) const; |
360 |
MTH void say_msg (const_utf8_string msg, int x, int y) const; |
361 |
|
362 |
// connected links |
363 |
oblinkpt *find_link (shstr_tmp id); |
364 |
MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
365 |
|
366 |
// set the given flag on all objects in the map |
367 |
MTH void set_object_flag (int flag, int value = 1); |
368 |
MTH void post_load_original (); |
369 |
|
370 |
MTH void link_multipart_objects (); |
371 |
MTH void clear_unique_items (); |
372 |
|
373 |
MTH void clear_header (); |
374 |
MTH void clear_links_to (maptile *m); |
375 |
|
376 |
MTH struct region *region (int x, int y) const; |
377 |
|
378 |
// load the header pseudo-object |
379 |
bool _load_header (object_thawer &thawer); |
380 |
MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); } |
381 |
|
382 |
// load objects into the map |
383 |
bool _load_objects (object_thawer &thawer); |
384 |
MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
385 |
|
386 |
// save objects into the given file (uses IO_ flags) |
387 |
bool _save_objects (object_freezer &freezer, int flags); |
388 |
MTH bool _save_objects (const_octet_string path, int flags); |
389 |
|
390 |
// save the header pseudo object _only_ |
391 |
bool _save_header (object_freezer &freezer); |
392 |
MTH bool _save_header (const_octet_string path); |
393 |
|
394 |
maptile (); |
395 |
maptile (int w, int h); |
396 |
void init (); |
397 |
~maptile (); |
398 |
|
399 |
void do_destroy (); |
400 |
void gather_callbacks (AV *&callbacks, event_type event) const; |
401 |
|
402 |
MTH bool linkable () { return state >= MAP_INACTIVE; } |
403 |
|
404 |
MTH int size () const { return width * height; } |
405 |
|
406 |
MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
407 |
|
408 |
MTH void touch () { last_access = runtime; } |
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. |
416 |
MTH maptile *tile_available (int dir, bool load = true); |
417 |
|
418 |
// find the map that is at coordinate x|y relative to this map |
419 |
// TODO: need a better way than passing by reference |
420 |
// TODO: make perl interface |
421 |
maptile *xy_find (sint16 &x, sint16 &y); |
422 |
|
423 |
// like xy_find, but also loads the map |
424 |
maptile *xy_load (sint16 &x, sint16 &y); |
425 |
|
426 |
void do_load_sync ();//PERL |
427 |
|
428 |
// make sure the map is loaded |
429 |
MTH void load_sync () |
430 |
{ |
431 |
if (!spaces) |
432 |
do_load_sync (); |
433 |
} |
434 |
|
435 |
void make_map_floor (char **layout, const char *floorstyle, random_map_params *RP); |
436 |
bool generate_random_map (random_map_params *RP); |
437 |
|
438 |
static maptile *find_async (const_utf8_string path, maptile *original = 0, bool load = true);//PERL |
439 |
static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL |
440 |
static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL |
441 |
object *pick_random_object (rand_gen &gen = rndm) const; |
442 |
|
443 |
mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
444 |
|
445 |
// return an array of maprects corresponding |
446 |
// to the given rectangular area. the last rect will have |
447 |
// a 0 map pointer. |
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; |
451 |
}; |
452 |
|
453 |
inline bool |
454 |
object::is_in_shop () const |
455 |
{ |
456 |
return is_on_map () |
457 |
&& map->is_in_shop (x, y); |
458 |
} |
459 |
|
460 |
//+GPL |
461 |
|
462 |
/* This is used by get_rangevector to determine where the other |
463 |
* creature is. get_rangevector takes into account map tiling, |
464 |
* so you just can not look the the map coordinates and get the |
465 |
* righte value. distance_x/y are distance away, which |
466 |
* can be negative. direction is the crossfire direction scheme |
467 |
* that the creature should head. part is the part of the |
468 |
* monster that is closest. |
469 |
* Note: distance should be always >=0. I changed it to UINT. MT |
470 |
*/ |
471 |
struct rv_vector |
472 |
{ |
473 |
unsigned int distance; |
474 |
int distance_x; |
475 |
int distance_y; |
476 |
int direction; |
477 |
object *part; |
478 |
}; |
479 |
|
480 |
// comaptibility cruft start |
481 |
//TODO: these should be refactored into things like xy_normalise |
482 |
// and so on. |
483 |
int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
484 |
int out_of_map (maptile *m, int x, int y); |
485 |
maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
486 |
void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
487 |
void get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
488 |
int on_same_map (const object *op1, const object *op2); |
489 |
int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy); |
490 |
|
491 |
// adjust map, x and y for tiled maps and return true if the position is valid at all |
492 |
static inline bool |
493 |
xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
494 |
{ |
495 |
// when in range, do a quick return, otherwise go the slow route |
496 |
return |
497 |
(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
498 |
|| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
499 |
} |
500 |
// comaptibility cruft end |
501 |
|
502 |
//-GPL |
503 |
|
504 |
inline mapspace & |
505 |
object::ms () const |
506 |
{ |
507 |
return map->at (x, y); |
508 |
} |
509 |
|
510 |
struct mapxy { |
511 |
maptile *m; |
512 |
sint16 x, y; |
513 |
|
514 |
mapxy (maptile *m, sint16 x, sint16 y) |
515 |
: m(m), x(x), y(y) |
516 |
{ } |
517 |
|
518 |
mapxy (object *op) |
519 |
: m(op->map), x(op->x), y(op->y) |
520 |
{ } |
521 |
|
522 |
mapxy &move (int dx, int dy) |
523 |
{ |
524 |
x += dx; |
525 |
y += dy; |
526 |
|
527 |
return *this; |
528 |
} |
529 |
|
530 |
mapxy &move (int dir) |
531 |
{ |
532 |
return move (DIRX (dir), DIRY (dir)); |
533 |
} |
534 |
|
535 |
operator void *() const { return (void *)m; } |
536 |
mapxy &operator =(const object *op) |
537 |
{ |
538 |
m = op->map; |
539 |
x = op->x; |
540 |
y = op->y; |
541 |
|
542 |
return *this; |
543 |
} |
544 |
|
545 |
mapspace *operator ->() const { return &m->at (x, y); } |
546 |
mapspace &operator * () const { return m->at (x, y); } |
547 |
|
548 |
bool normalise () |
549 |
{ |
550 |
return xy_normalise (m, x, y); |
551 |
} |
552 |
|
553 |
mapspace &ms () const |
554 |
{ |
555 |
return m->at (x, y); |
556 |
} |
557 |
|
558 |
object *insert (object *op, object *originator = 0, int flags = 0) const |
559 |
{ |
560 |
return m->insert (op, x, y, originator, flags); |
561 |
} |
562 |
}; |
563 |
|
564 |
inline const mapxy & |
565 |
object::operator =(const mapxy &pos) |
566 |
{ |
567 |
map = pos.m; |
568 |
x = pos.x; |
569 |
y = pos.y; |
570 |
|
571 |
return pos; |
572 |
} |
573 |
|
574 |
// iterate over a rectangular area relative to op |
575 |
// can be used as a single statement, but both iterate macros |
576 |
// invocations must not be followed by a ";" |
577 |
// see common/los.C for usage example |
578 |
// the walk will be ordered, outer loop x, inner loop y |
579 |
// m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op |
580 |
// "continue" will skip to the next space |
581 |
#define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \ |
582 |
for (int dx = (dx0); dx <= (dx1); ++dx) \ |
583 |
{ \ |
584 |
sint16 nx, ny; \ |
585 |
maptile *m = 0; \ |
586 |
\ |
587 |
for (int dy = (dy0); dy <= (dy1); ++dy) \ |
588 |
{ \ |
589 |
/* check to see if we can simply go one down quickly, */ \ |
590 |
/* if not, do it the slow way */ \ |
591 |
if (!m || ++ny >= m->height) \ |
592 |
{ \ |
593 |
nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \ |
594 |
\ |
595 |
if (!xy_normalise (m, nx, ny)) \ |
596 |
m = 0; \ |
597 |
} |
598 |
|
599 |
#define ordered_mapwalk_end \ |
600 |
} \ |
601 |
} |
602 |
|
603 |
extern 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 |
608 |
struct 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! |
630 |
extern struct freed_map freed_map; // freed objects are moved here to avoid crashes |
631 |
|
632 |
// loop over every space in the given maprect, |
633 |
// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
634 |
// the iterator code must be a single statement following this macro call, similar to "if" |
635 |
// "continue" will skip to the next space |
636 |
#define rect_mapwalk(rect,dx0,dy0) \ |
637 |
statementvar (maptile *, m, (rect)->m) \ |
638 |
for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \ |
639 |
for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \ |
640 |
statementvar (int, dx, nx + (rect)->dx - (dx0)) \ |
641 |
statementvar (int, dy, ny + (rect)->dy - (dy0)) |
642 |
|
643 |
// same as ordered_mapwalk, but the walk will not follow any particular |
644 |
// order (unorded), but is likely faster. |
645 |
// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
646 |
// "continue" will skip to the next space |
647 |
#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \ |
648 |
for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \ |
649 |
(ox) + (dx0) , (oy) + (dy0) , \ |
650 |
(ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
651 |
r_e_c_t->m; \ |
652 |
++r_e_c_t) \ |
653 |
rect_mapwalk (r_e_c_t, (ox), (oy)) |
654 |
|
655 |
#define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \ |
656 |
unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
657 |
|
658 |
#endif |
659 |
|