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 |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* |
25 | /* |
… | |
… | |
28 | |
29 | |
29 | #ifndef MAP_H |
30 | #ifndef MAP_H |
30 | #define MAP_H |
31 | #define MAP_H |
31 | |
32 | |
32 | #include <tr1/unordered_map> |
33 | #include <tr1/unordered_map> |
|
|
34 | |
|
|
35 | //+GPL |
33 | |
36 | |
34 | #include "region.h" |
37 | #include "region.h" |
35 | #include "cfperl.h" |
38 | #include "cfperl.h" |
36 | |
39 | |
37 | /* We set this size - this is to make magic map work properly on |
40 | /* We set this size - this is to make magic map work properly on |
… | |
… | |
45 | * map pointers. |
48 | * map pointers. |
46 | */ |
49 | */ |
47 | #define MAGIC_MAP_SIZE 50 |
50 | #define MAGIC_MAP_SIZE 50 |
48 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
51 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
49 | |
52 | |
50 | #define MAP_LAYERS 3 |
53 | #define MAP_LAYERS 3 |
|
|
54 | |
|
|
55 | // tile map index |
|
|
56 | enum { |
|
|
57 | TILE_NORTH, |
|
|
58 | TILE_EAST, |
|
|
59 | TILE_SOUTH, |
|
|
60 | TILE_WEST, |
|
|
61 | TILE_UP, |
|
|
62 | TILE_DOWN, |
|
|
63 | TILE_NUM, |
|
|
64 | }; |
51 | |
65 | |
52 | /* Values for in_memory below */ |
66 | /* Values for in_memory below */ |
53 | enum { |
67 | enum { |
54 | MAP_ACTIVE, |
68 | MAP_ACTIVE, |
55 | MAP_INACTIVE, // not used atm. |
69 | MAP_INACTIVE, // not used atm. |
… | |
… | |
82 | /* These are used in the MapLook flags element. They are not used in |
96 | /* These are used in the MapLook flags element. They are not used in |
83 | * in the object flags structure. |
97 | * in the object flags structure. |
84 | */ |
98 | */ |
85 | #define P_BLOCKSVIEW 0x01 |
99 | #define P_BLOCKSVIEW 0x01 |
86 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
100 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
87 | #define P_PLAYER 0x04 /* a player (or something seeing these objects) is on this mapspace */ |
101 | #define P_NO_CLERIC 0x04 /* no clerical spells cast here */ |
88 | #define P_SAFE 0x08 /* If this is set the map tile is a safe space, |
102 | #define P_SAFE 0x08 /* If this is set the map tile is a safe space, |
89 | * that means, nothing harmful can be done, |
103 | * that means, nothing harmful can be done, |
90 | * such as: bombs, potion usage, alchemy, spells |
104 | * such as: bombs, potion usage, alchemy, spells |
91 | * this was introduced to make shops safer |
105 | * this was introduced to make shops safer |
92 | * but is useful in other situations */ |
106 | * but is useful in other situations */ |
|
|
107 | |
|
|
108 | #define P_PLAYER 0x10 /* a player (or something seeing these objects) is on this mapspace */ |
93 | #define P_IS_ALIVE 0x10 /* something alive is on this space */ |
109 | #define P_IS_ALIVE 0x20 /* something alive is on this space */ |
94 | #define P_NO_CLERIC 0x20 /* no clerical spells cast here */ |
|
|
95 | |
|
|
96 | #define P_UPTODATE 0x80 /* this space is up to date */ |
110 | #define P_UPTODATE 0x80 // this space is up to date |
97 | |
111 | |
98 | /* The following two values are not stored in the MapLook flags, but instead |
112 | /* The following two values are not stored in the MapLook flags, but instead |
99 | * used in the get_map_flags value - that function is used to return |
113 | * used in the get_map_flags value - that function is used to return |
100 | * the flag value, as well as other conditions - using a more general |
114 | * the flag value, as well as other conditions - using a more general |
101 | * function that does more of the work can hopefully be used to replace |
115 | * function that does more of the work can hopefully be used to replace |
102 | * lots of duplicate checks currently in the code. |
116 | * lots of duplicate checks currently in the code. |
103 | */ |
117 | */ |
104 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
118 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
105 | #define P_NEW_MAP 0x20000 |
119 | #define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ |
106 | /* Coordinates passed result in a new tiled map */ |
|
|
107 | |
120 | |
108 | /* Instead of having numerous arrays that have information on a |
121 | /* Instead of having numerous arrays that have information on a |
109 | * particular space (was map, floor, floor2, map_ob), |
122 | * particular space (was map, floor, floor2, map_ob), |
110 | * have this structure take care of that information. |
123 | * have this structure take care of that information. |
111 | * This puts it all in one place, and should also make it easier |
124 | * This puts it all in one place, and should also make it easier |
… | |
… | |
113 | */ |
126 | */ |
114 | INTERFACE_CLASS (mapspace) |
127 | INTERFACE_CLASS (mapspace) |
115 | struct mapspace |
128 | struct mapspace |
116 | { |
129 | { |
117 | object *ACC (RW, bot); |
130 | object *ACC (RW, bot); |
118 | object *ACC (RW, top); /* lowest/highest object on this space */ |
131 | object *ACC (RW, top); /* lowest/highest object on this space */ |
119 | object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ |
132 | object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ |
120 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
133 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
121 | sint8 ACC (RW, light); /* How much light this space provides */ |
134 | sint8 ACC (RW, light); /* How much light this space provides */ |
122 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
135 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
123 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
136 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
124 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
137 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
125 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
138 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
|
|
139 | uint16_t ACC (RW, items_); // saturates at 64k |
|
|
140 | uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) |
|
|
141 | uint32_t ACC (RW, smell); // the last count a player was seen here, or 0 |
|
|
142 | static uint32_t ACC (RW, smellcount); // global smell counter |
|
|
143 | |
|
|
144 | uint32_t pad1_, pad2_; // pad to 64 bytes on 64 bit systems |
|
|
145 | |
|
|
146 | //-GPL |
126 | |
147 | |
127 | void update_ (); |
148 | void update_ (); |
128 | MTH void update () |
149 | MTH void update () |
129 | { |
150 | { |
130 | if (!(flags_ & P_UPTODATE)) |
151 | // we take advantage of the fact that 0x80 is the sign bit |
|
|
152 | // to generate more efficient code on many cpus |
|
|
153 | assert (sint8 (P_UPTODATE) < 0); |
|
|
154 | assert (sint8 (-1 & ~P_UPTODATE) >= 0); |
|
|
155 | |
|
|
156 | if (expect_false (sint8 (flags_) >= 0)) |
131 | update_ (); |
157 | update_ (); |
|
|
158 | |
|
|
159 | // must be true by now (gcc seems content with only the second test) |
|
|
160 | assume (sint8 (flags_) < 0); |
|
|
161 | assume (flags_ & P_UPTODATE); |
132 | } |
162 | } |
133 | |
163 | |
134 | MTH uint8 flags () |
164 | MTH uint8 flags () |
135 | { |
165 | { |
136 | update (); |
166 | update (); |
… | |
… | |
153 | op = 0; |
183 | op = 0; |
154 | |
184 | |
155 | return op; |
185 | return op; |
156 | } |
186 | } |
157 | |
187 | |
|
|
188 | MTH uint32 items() |
|
|
189 | { |
|
|
190 | update (); |
|
|
191 | return items_; |
|
|
192 | } |
|
|
193 | |
158 | // return the item volume on this mapspace in cm³ |
194 | // return the item volume on this mapspace in cm³ |
159 | MTH uint64 volume () const; |
195 | MTH uint64 volume () |
|
|
196 | { |
|
|
197 | update (); |
|
|
198 | return volume_ * 1024; |
|
|
199 | } |
160 | |
200 | |
161 | bool blocks (MoveType mt) const |
201 | bool blocks (MoveType mt) const |
162 | { |
202 | { |
163 | return move_block && (mt & move_block) == mt; |
203 | return move_block && (mt & move_block) == mt; |
164 | } |
204 | } |
… | |
… | |
166 | bool blocks (object *op) const |
206 | bool blocks (object *op) const |
167 | { |
207 | { |
168 | return blocks (op->move_type); |
208 | return blocks (op->move_type); |
169 | } |
209 | } |
170 | }; |
210 | }; |
|
|
211 | |
|
|
212 | // a rectangular area of a map, used my split_to_tiles/unordered_mapwalk |
|
|
213 | struct maprect |
|
|
214 | { |
|
|
215 | maptile *m; |
|
|
216 | int x0, y0; |
|
|
217 | int x1, y1; |
|
|
218 | int dx, dy; // offset to go from local coordinates to original tile */ |
|
|
219 | }; |
|
|
220 | |
|
|
221 | //+GPL |
171 | |
222 | |
172 | struct shopitems : zero_initialised |
223 | struct shopitems : zero_initialised |
173 | { |
224 | { |
174 | const char *name; /* name of the item in question, null if it is the default item */ |
225 | const char *name; /* name of the item in question, null if it is the default item */ |
175 | const char *name_pl; /* plural name */ |
226 | const char *name_pl; /* plural name */ |
… | |
… | |
233 | static sint8 outdoor_darkness; /* the global darkness level outside */ |
284 | static sint8 outdoor_darkness; /* the global darkness level outside */ |
234 | |
285 | |
235 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
286 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
236 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
287 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
237 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
288 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
238 | sint16 ACC (RW, temp); /* base temperature of this tile (F) */ |
|
|
239 | sint16 ACC (RW, pressure); /* barometric pressure (mb) */ |
|
|
240 | sint8 ACC (RW, humid); /* humitidy of this tile */ |
|
|
241 | sint8 ACC (RW, windspeed); /* windspeed of this tile */ |
|
|
242 | sint8 ACC (RW, winddir); /* direction of wind */ |
|
|
243 | sint8 ACC (RW, sky); /* sky conditions */ |
|
|
244 | int ACC (RW, worldpartx), ACC (RW, worldparty); /*Highly fasten conversion between worldmap and weathermap */ |
|
|
245 | struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ |
289 | struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ |
246 | shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ |
290 | shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ |
247 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
291 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
248 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
292 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
249 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
293 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
250 | shstr ACC (RW, msg); /* Message map creator may have left */ |
294 | shstr ACC (RW, msg); /* Message map creator may have left */ |
251 | shstr ACC (RW, maplore); /* Map lore information */ |
295 | shstr ACC (RW, maplore); /* Map lore information */ |
252 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
296 | shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */ |
253 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
297 | maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */ |
254 | shstr ACC (RW, path); /* Filename of the map */ |
298 | shstr ACC (RW, path); /* Filename of the map */ |
255 | int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace |
|
|
256 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
299 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
|
|
300 | int ACC (RW, max_items); // maximum number of items on a mapspace |
|
|
301 | |
|
|
302 | //-GPL |
257 | |
303 | |
258 | // the maptile:: is neccessary here for the perl interface to work |
304 | // the maptile:: is neccessary here for the perl interface to work |
259 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
305 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
260 | { |
306 | { |
261 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
307 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
… | |
… | |
269 | // allocates all (empty) mapspace |
315 | // allocates all (empty) mapspace |
270 | MTH void alloc (); |
316 | MTH void alloc (); |
271 | // deallocates the mapspaces (and destroys all objects) |
317 | // deallocates the mapspaces (and destroys all objects) |
272 | MTH void clear (); |
318 | MTH void clear (); |
273 | |
319 | |
|
|
320 | MTH void post_load (); // update cached values in mapspaces etc. |
274 | MTH void fix_auto_apply (); |
321 | MTH void fix_auto_apply (); |
275 | MTH void do_decay_objects (); |
322 | MTH void do_decay_objects (); |
276 | MTH void update_buttons (); |
323 | MTH void update_buttons (); |
277 | MTH int change_map_light (int change); |
324 | MTH int change_map_light (int change); |
278 | MTH int estimate_difficulty () const; |
325 | MTH int estimate_difficulty () const; |
279 | |
326 | |
280 | MTH void play_sound (faceidx sound, int x, int y) const; |
327 | MTH void play_sound (faceidx sound, int x, int y) const; |
|
|
328 | MTH void say_msg (const_utf8_string msg, int x, int y) const; |
|
|
329 | |
|
|
330 | // connected links |
|
|
331 | oblinkpt *find_link (shstr_tmp id); |
|
|
332 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
281 | |
333 | |
282 | // set the given flag on all objects in the map |
334 | // set the given flag on all objects in the map |
283 | MTH void set_object_flag (int flag, int value = 1); |
335 | MTH void set_object_flag (int flag, int value = 1); |
284 | MTH void post_load_original (); |
336 | MTH void post_load_original (); |
285 | |
337 | |
… | |
… | |
299 | bool _load_objects (object_thawer &thawer); |
351 | bool _load_objects (object_thawer &thawer); |
300 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
352 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
301 | |
353 | |
302 | // save objects into the given file (uses IO_ flags) |
354 | // save objects into the given file (uses IO_ flags) |
303 | bool _save_objects (object_freezer &freezer, int flags); |
355 | bool _save_objects (object_freezer &freezer, int flags); |
304 | MTH bool _save_objects (const char *path, int flags); |
356 | MTH bool _save_objects (const_octet_string path, int flags); |
305 | |
357 | |
306 | // save the header pseudo object _only_ |
358 | // save the header pseudo object _only_ |
307 | bool _save_header (object_freezer &freezer); |
359 | bool _save_header (object_freezer &freezer); |
308 | MTH bool _save_header (const char *path); |
360 | MTH bool _save_header (const_octet_string path); |
309 | |
361 | |
310 | maptile (); |
362 | maptile (); |
311 | maptile (int w, int h); |
363 | maptile (int w, int h); |
|
|
364 | void init (); |
312 | ~maptile (); |
365 | ~maptile (); |
313 | |
366 | |
314 | void do_destroy (); |
367 | void do_destroy (); |
315 | void gather_callbacks (AV *&callbacks, event_type event) const; |
368 | void gather_callbacks (AV *&callbacks, event_type event) const; |
316 | |
369 | |
… | |
… | |
318 | |
371 | |
319 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
372 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
320 | |
373 | |
321 | MTH void touch () { last_access = runtime; } |
374 | MTH void touch () { last_access = runtime; } |
322 | |
375 | |
323 | MTH bool tile_available (int dir, bool load = true); |
376 | MTH maptile *tile_available (int dir, bool load = true); |
324 | |
377 | |
325 | // find the map that is at coordinate x|y relative to this map |
378 | // find the map that is at coordinate x|y relative to this map |
326 | // TODO: need a better way than passing by reference |
379 | // TODO: need a better way than passing by reference |
327 | // TODO: make perl interface |
380 | // TODO: make perl interface |
328 | maptile *xy_find (sint16 &x, sint16 &y); |
381 | maptile *xy_find (sint16 &x, sint16 &y); |
… | |
… | |
337 | { |
390 | { |
338 | if (!spaces) |
391 | if (!spaces) |
339 | do_load_sync (); |
392 | do_load_sync (); |
340 | } |
393 | } |
341 | |
394 | |
342 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
395 | void make_map_floor (char **layout, const char *floorstyle, random_map_params *RP); |
343 | bool generate_random_map (random_map_params *RP); |
396 | bool generate_random_map (random_map_params *RP); |
344 | |
397 | |
345 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
398 | static maptile *find_async (const_utf8_string path, maptile *original = 0, bool load = true);//PERL |
346 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
399 | static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL |
347 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
400 | static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL |
348 | object *pick_random_object (rand_gen &gen = rndm) const; |
401 | object *pick_random_object (rand_gen &gen = rndm) const; |
349 | |
402 | |
350 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
403 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
|
|
404 | |
|
|
405 | // return an array of maprects corresponding |
|
|
406 | // to the given rectangular area. the last rect will have |
|
|
407 | // a 0 map pointer. |
|
|
408 | maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1); |
|
|
409 | |
|
|
410 | MTH bool is_in_shop (int x, int y) const; |
351 | }; |
411 | }; |
|
|
412 | |
|
|
413 | inline bool |
|
|
414 | object::is_in_shop () const |
|
|
415 | { |
|
|
416 | return is_on_map () |
|
|
417 | && map->is_in_shop (x, y); |
|
|
418 | } |
|
|
419 | |
|
|
420 | //+GPL |
352 | |
421 | |
353 | /* This is used by get_rangevector to determine where the other |
422 | /* This is used by get_rangevector to determine where the other |
354 | * creature is. get_rangevector takes into account map tiling, |
423 | * creature is. get_rangevector takes into account map tiling, |
355 | * so you just can not look the the map coordinates and get the |
424 | * so you just can not look the the map coordinates and get the |
356 | * righte value. distance_x/y are distance away, which |
425 | * righte value. distance_x/y are distance away, which |
… | |
… | |
373 | // and so on. |
442 | // and so on. |
374 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
443 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
375 | int out_of_map (maptile *m, int x, int y); |
444 | int out_of_map (maptile *m, int x, int y); |
376 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
445 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
377 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
446 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
378 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
447 | void get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
379 | int on_same_map (const object *op1, const object *op2); |
448 | int on_same_map (const object *op1, const object *op2); |
380 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
449 | int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy); |
381 | |
450 | |
382 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
451 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
383 | static inline bool |
452 | static inline bool |
384 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
453 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
385 | { |
454 | { |
… | |
… | |
388 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
457 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
389 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
458 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
390 | } |
459 | } |
391 | // comaptibility cruft end |
460 | // comaptibility cruft end |
392 | |
461 | |
|
|
462 | //-GPL |
|
|
463 | |
393 | inline mapspace & |
464 | inline mapspace & |
394 | object::ms () const |
465 | object::ms () const |
395 | { |
466 | { |
396 | return map->at (x, y); |
467 | return map->at (x, y); |
397 | } |
468 | } |
… | |
… | |
458 | y = pos.y; |
529 | y = pos.y; |
459 | |
530 | |
460 | return pos; |
531 | return pos; |
461 | } |
532 | } |
462 | |
533 | |
|
|
534 | // iterate over a rectangular area relative to op |
|
|
535 | // can be used as a single statement, but both iterate macros |
|
|
536 | // invocations must not be followed by a ";" |
|
|
537 | // see common/los.C for usage example |
|
|
538 | // the walk will be ordered, outer loop x, inner loop y |
|
|
539 | // m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op |
|
|
540 | // "continue" will skip to the next space |
|
|
541 | #define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \ |
|
|
542 | for (int dx = (dx0); dx <= (dx1); ++dx) \ |
|
|
543 | { \ |
|
|
544 | sint16 nx, ny; \ |
|
|
545 | maptile *m = 0; \ |
|
|
546 | \ |
|
|
547 | for (int dy = (dy0); dy <= (dy1); ++dy) \ |
|
|
548 | { \ |
|
|
549 | /* check to see if we can simply go one down quickly, */ \ |
|
|
550 | /* if not, do it the slow way */ \ |
|
|
551 | if (!m || ++ny >= m->height) \ |
|
|
552 | { \ |
|
|
553 | nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \ |
|
|
554 | \ |
|
|
555 | if (!xy_normalise (m, nx, ny)) \ |
|
|
556 | m = 0; \ |
|
|
557 | } |
|
|
558 | |
|
|
559 | #define ordered_mapwalk_end \ |
|
|
560 | } \ |
|
|
561 | } |
|
|
562 | |
|
|
563 | extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations |
|
|
564 | |
|
|
565 | // loop over every space in the given maprect, |
|
|
566 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
|
|
567 | // the iterator code must be a single statement following this macro call, similar to "if" |
|
|
568 | // "continue" will skip to the next space |
|
|
569 | #define rect_mapwalk(rect,dx0,dy0) \ |
|
|
570 | statementvar (maptile *, m, (rect)->m) \ |
|
|
571 | for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \ |
|
|
572 | for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \ |
|
|
573 | statementvar (int, dx, nx + (rect)->dx - (dx0)) \ |
|
|
574 | statementvar (int, dy, ny + (rect)->dy - (dy0)) |
|
|
575 | |
|
|
576 | // same as ordered_mapwalk, but the walk will not follow any particular |
|
|
577 | // order (unorded), but is likely faster. |
|
|
578 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
|
|
579 | // "continue" will skip to the next space |
|
|
580 | #define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \ |
|
|
581 | for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \ |
|
|
582 | (ox) + (dx0) , (oy) + (dy0) , \ |
|
|
583 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
|
|
584 | r_e_c_t->m; \ |
|
|
585 | ++r_e_c_t) \ |
|
|
586 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
|
|
587 | |
|
|
588 | #define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \ |
|
|
589 | unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
|
|
590 | |
463 | #endif |
591 | #endif |
464 | |
592 | |