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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 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 |
… | |
… | |
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 |
51 | |
54 | |
52 | /* Values for in_memory below. Should probably be an enumerations */ |
55 | // tile map index |
53 | enum { |
56 | enum { |
54 | MAP_IN_MEMORY, |
57 | TILE_UP = 0, |
|
|
58 | TILE_RIGHT = 1, |
|
|
59 | TILE_DOWN = 2, |
|
|
60 | TILE_LEFT = 3, |
|
|
61 | }; |
|
|
62 | |
|
|
63 | /* Values for in_memory below */ |
|
|
64 | enum { |
|
|
65 | MAP_ACTIVE, |
|
|
66 | MAP_INACTIVE, // not used atm. |
55 | MAP_SWAPPED, |
67 | MAP_SWAPPED, |
56 | MAP_LOADING, |
68 | MAP_LOADING, |
57 | MAP_SAVING, |
69 | MAP_SAVING, |
58 | }; |
70 | }; |
59 | |
71 | |
… | |
… | |
62 | * where it is known the map is not tiled or the values are known |
74 | * where it is known the map is not tiled or the values are known |
63 | * consistent (eg, op->map, op->x, op->y) |
75 | * consistent (eg, op->map, op->x, op->y) |
64 | */ |
76 | */ |
65 | // all those macros are herewith declared legacy |
77 | // all those macros are herewith declared legacy |
66 | #define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
78 | #define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
67 | #define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light |
|
|
68 | #define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
79 | #define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
69 | #define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
80 | #define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
70 | #define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
81 | #define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
71 | #define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
82 | #define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
72 | #define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
83 | #define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
… | |
… | |
82 | /* These are used in the MapLook flags element. They are not used in |
93 | /* These are used in the MapLook flags element. They are not used in |
83 | * in the object flags structure. |
94 | * in the object flags structure. |
84 | */ |
95 | */ |
85 | #define P_BLOCKSVIEW 0x01 |
96 | #define P_BLOCKSVIEW 0x01 |
86 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
97 | #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 */ |
98 | #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, |
99 | #define P_SAFE 0x08 /* If this is set the map tile is a safe space, |
89 | * that means, nothing harmful can be done, |
100 | * that means, nothing harmful can be done, |
90 | * such as: bombs, potion usage, alchemy, spells |
101 | * such as: bombs, potion usage, alchemy, spells |
91 | * this was introduced to make shops safer |
102 | * this was introduced to make shops safer |
92 | * but is useful in other situations */ |
103 | * but is useful in other situations */ |
|
|
104 | |
|
|
105 | #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 */ |
106 | #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 */ |
107 | #define P_UPTODATE 0x80 // this space is up to date |
97 | |
108 | |
98 | /* The following two values are not stored in the MapLook flags, but instead |
109 | /* 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 |
110 | * 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 |
111 | * 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 |
112 | * function that does more of the work can hopefully be used to replace |
102 | * lots of duplicate checks currently in the code. |
113 | * lots of duplicate checks currently in the code. |
103 | */ |
114 | */ |
104 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
115 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
105 | #define P_NEW_MAP 0x20000 |
116 | #define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ |
106 | /* Coordinates passed result in a new tiled map */ |
|
|
107 | |
117 | |
108 | /* Instead of having numerous arrays that have information on a |
118 | /* Instead of having numerous arrays that have information on a |
109 | * particular space (was map, floor, floor2, map_ob), |
119 | * particular space (was map, floor, floor2, map_ob), |
110 | * have this structure take care of that information. |
120 | * have this structure take care of that information. |
111 | * This puts it all in one place, and should also make it easier |
121 | * This puts it all in one place, and should also make it easier |
112 | * to extend information about a space. |
122 | * to extend information about a space. |
113 | */ |
123 | */ |
|
|
124 | INTERFACE_CLASS (mapspace) |
114 | struct mapspace |
125 | struct mapspace |
115 | { |
126 | { |
|
|
127 | object *ACC (RW, bot); |
116 | object *bot, *top; /* lowest/highest object on this space */ |
128 | object *ACC (RW, top); /* lowest/highest object on this space */ |
117 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
129 | object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ |
118 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
130 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
119 | sint8 light; /* How much light this space provides */ |
131 | sint8 ACC (RW, light); /* How much light this space provides */ |
120 | MoveType move_block; /* What movement types this space blocks */ |
132 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
121 | MoveType move_slow; /* What movement types this space slows */ |
133 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
122 | MoveType move_on; /* What movement types are activated */ |
134 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
123 | MoveType move_off; /* What movement types are activated */ |
135 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
|
|
136 | uint16_t ACC (RW, items_); // saturates at 64k |
|
|
137 | uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) |
|
|
138 | uint32_t ACC (RW, smell); // the last count a player was seen here, or 0 |
|
|
139 | static uint32_t ACC (RW, smellcount); // global smell counter |
|
|
140 | |
|
|
141 | uint32_t pad1_, pad2_; // pad to 64 bytes on 64 bit systems |
|
|
142 | |
|
|
143 | //-GPL |
124 | |
144 | |
125 | void update_ (); |
145 | void update_ (); |
126 | void update () |
146 | MTH void update () |
127 | { |
147 | { |
128 | if (!(flags_ & P_UPTODATE)) |
148 | // we take advantage of the fact that 0x80 is the sign bit |
|
|
149 | // to generate more efficient code on many cpus |
|
|
150 | assert (sint8 (P_UPTODATE) < 0); |
|
|
151 | assert (sint8 (-1 & ~P_UPTODATE) >= 0); |
|
|
152 | |
|
|
153 | if (expect_false (sint8 (flags_) >= 0)) |
129 | update_ (); |
154 | update_ (); |
130 | } |
|
|
131 | |
155 | |
|
|
156 | // must be true by now (gcc seems content with only the second test) |
|
|
157 | assume (sint8 (flags_) < 0); |
|
|
158 | assume (flags_ & P_UPTODATE); |
|
|
159 | } |
|
|
160 | |
132 | uint8 flags () |
161 | MTH uint8 flags () |
133 | { |
162 | { |
134 | update (); |
163 | update (); |
135 | return flags_; |
164 | return flags_; |
136 | } |
165 | } |
|
|
166 | |
|
|
167 | MTH void invalidate () |
|
|
168 | { |
|
|
169 | flags_ = 0; |
|
|
170 | } |
137 | |
171 | |
138 | // maybe only inline quick flags_ checking? |
|
|
139 | object *player () |
172 | MTH object *player () |
140 | { |
173 | { |
141 | // search from the top, because players are usually on top |
174 | object *op; |
142 | // make usually == always and this non-amortized O(1) |
175 | |
143 | // could gte rid of P_PLAYER, too, then |
|
|
144 | if (flags () & P_PLAYER) |
176 | if (flags () & P_PLAYER) |
145 | for (object *op = top; op; op = op->below) |
177 | for (op = top; op->type != PLAYER; op = op->below) |
146 | if (op->type == PLAYER) |
178 | ; |
147 | return op; |
179 | else |
|
|
180 | op = 0; |
148 | |
181 | |
149 | return 0; |
182 | return op; |
|
|
183 | } |
|
|
184 | |
|
|
185 | MTH uint32 items() |
|
|
186 | { |
|
|
187 | update (); |
|
|
188 | return items_; |
150 | } |
189 | } |
151 | |
190 | |
152 | // return the item volume on this mapspace in cm³ |
191 | // return the item volume on this mapspace in cm³ |
153 | uint64 volume () const; |
192 | MTH uint64 volume () |
|
|
193 | { |
|
|
194 | update (); |
|
|
195 | return volume_ * 1024; |
|
|
196 | } |
154 | |
197 | |
155 | bool blocks (MoveType mt) const |
198 | bool blocks (MoveType mt) const |
156 | { |
199 | { |
157 | return move_block && (mt & move_block) == mt; |
200 | return move_block && (mt & move_block) == mt; |
158 | } |
201 | } |
|
|
202 | |
|
|
203 | bool blocks (object *op) const |
|
|
204 | { |
|
|
205 | return blocks (op->move_type); |
|
|
206 | } |
159 | }; |
207 | }; |
|
|
208 | |
|
|
209 | // a rectangular area of a map |
|
|
210 | struct maprect |
|
|
211 | { |
|
|
212 | maptile *m; |
|
|
213 | int x0, y0; |
|
|
214 | int x1, y1; |
|
|
215 | int dx, dy; // offset to go from local coordinates to original tile */ |
|
|
216 | }; |
|
|
217 | |
|
|
218 | //+GPL |
160 | |
219 | |
161 | struct shopitems : zero_initialised |
220 | struct shopitems : zero_initialised |
162 | { |
221 | { |
163 | const char *name; /* name of the item in question, null if it is the default item */ |
222 | const char *name; /* name of the item in question, null if it is the default item */ |
164 | const char *name_pl; /* plural name */ |
223 | const char *name_pl; /* plural name */ |
… | |
… | |
215 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
274 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
216 | |
275 | |
217 | bool ACC (RW, per_player); |
276 | bool ACC (RW, per_player); |
218 | bool ACC (RW, per_party); |
277 | bool ACC (RW, per_party); |
219 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
278 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
220 | bool ACC (RW, nodrop); /* avoid dropping anything on this map */ |
279 | bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */ |
221 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
280 | sint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
|
|
281 | static sint8 outdoor_darkness; /* the global darkness level outside */ |
222 | |
282 | |
223 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
283 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
224 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
284 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
225 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
285 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
226 | sint16 ACC (RW, temp); /* base temperature of this tile (F) */ |
|
|
227 | sint16 ACC (RW, pressure); /* barometric pressure (mb) */ |
|
|
228 | sint8 ACC (RW, humid); /* humitidy of this tile */ |
|
|
229 | sint8 ACC (RW, windspeed); /* windspeed of this tile */ |
|
|
230 | sint8 ACC (RW, winddir); /* direction of wind */ |
|
|
231 | sint8 ACC (RW, sky); /* sky conditions */ |
|
|
232 | int ACC (RW, worldpartx), ACC (RW, worldparty); /*Highly fasten conversion between worldmap and weathermap */ |
|
|
233 | struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ |
286 | struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ |
234 | shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ |
287 | shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ |
235 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
288 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
236 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
289 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
237 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
290 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
238 | shstr ACC (RW, msg); /* Message map creator may have left */ |
291 | shstr ACC (RW, msg); /* Message map creator may have left */ |
239 | shstr ACC (RW, maplore); /* Map lore information */ |
292 | shstr ACC (RW, maplore); /* Map lore information */ |
240 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
293 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
241 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
294 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
242 | shstr ACC (RW, path); /* Filename of the map */ |
295 | shstr ACC (RW, path); /* Filename of the map */ |
243 | int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace |
|
|
244 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
296 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
|
|
297 | int ACC (RW, max_items); // maximum number of items on a mapspace |
|
|
298 | |
|
|
299 | //-GPL |
|
|
300 | |
|
|
301 | // the maptile:: is neccessary here for the perl interface to work |
|
|
302 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
|
|
303 | { |
|
|
304 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
|
|
305 | } |
|
|
306 | |
|
|
307 | static void adjust_daylight (); |
245 | |
308 | |
246 | MTH void activate (); |
309 | MTH void activate (); |
247 | MTH void deactivate (); |
310 | MTH void deactivate (); |
248 | |
311 | |
249 | // allocates all (empty) mapspace |
312 | // allocates all (empty) mapspace |
250 | MTH void alloc (); |
313 | MTH void alloc (); |
251 | // deallocates the mapspaces (and destroys all objects) |
314 | // deallocates the mapspaces (and destroys all objects) |
252 | MTH void clear (); |
315 | MTH void clear (); |
253 | |
316 | |
|
|
317 | MTH void post_load (); // update cached values in mapspaces etc. |
254 | MTH void fix_auto_apply (); |
318 | MTH void fix_auto_apply (); |
255 | MTH void do_decay_objects (); |
319 | MTH void do_decay_objects (); |
256 | MTH void update_buttons (); |
320 | MTH void update_buttons (); |
257 | MTH int change_map_light (int change); |
321 | MTH int change_map_light (int change); |
258 | static void change_all_map_light (int change); //PERL |
|
|
259 | MTH void set_darkness_map (); |
|
|
260 | MTH int estimate_difficulty () const; |
322 | MTH int estimate_difficulty () const; |
261 | |
323 | |
262 | MTH void play_sound (faceidx sound, int x, int y) const; |
324 | MTH void play_sound (faceidx sound, int x, int y) const; |
|
|
325 | MTH void say_msg (const char *msg, int x, int y) const; |
|
|
326 | |
|
|
327 | // connected links |
|
|
328 | oblinkpt *find_link (shstr_tmp id); |
|
|
329 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
263 | |
330 | |
264 | // set the given flag on all objects in the map |
331 | // set the given flag on all objects in the map |
265 | MTH void set_object_flag (int flag, int value = 1); |
332 | MTH void set_object_flag (int flag, int value = 1); |
|
|
333 | MTH void post_load_original (); |
266 | |
334 | |
267 | MTH void link_multipart_objects (); |
335 | MTH void link_multipart_objects (); |
268 | MTH void clear_unique_items (); |
336 | MTH void clear_unique_items (); |
269 | |
337 | |
270 | MTH void clear_header (); |
338 | MTH void clear_header (); |
… | |
… | |
299 | |
367 | |
300 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
368 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
301 | |
369 | |
302 | MTH void touch () { last_access = runtime; } |
370 | MTH void touch () { last_access = runtime; } |
303 | |
371 | |
304 | MTH bool tile_available (int dir, bool load = true); |
372 | MTH maptile *tile_available (int dir, bool load = true); |
305 | |
373 | |
306 | // find the map that is at coordinate x|y relative to this map |
374 | // find the map that is at coordinate x|y relative to this map |
307 | // TODO: need a better way than passing by reference |
375 | // TODO: need a better way than passing by reference |
308 | // TODO: make perl interface |
376 | // TODO: make perl interface |
309 | maptile *xy_find (sint16 &x, sint16 &y); |
377 | maptile *xy_find (sint16 &x, sint16 &y); |
… | |
… | |
324 | bool generate_random_map (random_map_params *RP); |
392 | bool generate_random_map (random_map_params *RP); |
325 | |
393 | |
326 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
394 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
327 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
395 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
328 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
396 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
329 | MTH object *pick_random_object () const; |
397 | object *pick_random_object (rand_gen &gen = rndm) const; |
330 | |
398 | |
331 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
399 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
332 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
400 | |
|
|
401 | // return an array of maprects corresponding |
|
|
402 | // to the given rectangular area. the last rect will have |
|
|
403 | // a 0 map pointer. |
|
|
404 | // the array will be stored in a static memory area, |
|
|
405 | // so recursion is not atm. supported |
|
|
406 | maprect *split_to_tiles (int x0, int y0, int x1, int y1); |
333 | }; |
407 | }; |
|
|
408 | |
|
|
409 | //+GPL |
334 | |
410 | |
335 | /* This is used by get_rangevector to determine where the other |
411 | /* This is used by get_rangevector to determine where the other |
336 | * creature is. get_rangevector takes into account map tiling, |
412 | * creature is. get_rangevector takes into account map tiling, |
337 | * so you just can not look the the map coordinates and get the |
413 | * so you just can not look the the map coordinates and get the |
338 | * righte value. distance_x/y are distance away, which |
414 | * righte value. distance_x/y are distance away, which |
… | |
… | |
355 | // and so on. |
431 | // and so on. |
356 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
432 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
357 | int out_of_map (maptile *m, int x, int y); |
433 | int out_of_map (maptile *m, int x, int y); |
358 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
434 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
359 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
435 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
360 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
436 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
361 | int on_same_map (const object *op1, const object *op2); |
437 | int on_same_map (const object *op1, const object *op2); |
362 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
438 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
363 | |
439 | |
364 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
440 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
365 | static inline bool |
441 | static inline bool |
… | |
… | |
370 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
446 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
371 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
447 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
372 | } |
448 | } |
373 | // comaptibility cruft end |
449 | // comaptibility cruft end |
374 | |
450 | |
|
|
451 | //-GPL |
|
|
452 | |
375 | inline mapspace & |
453 | inline mapspace & |
376 | object::ms () const |
454 | object::ms () const |
377 | { |
455 | { |
378 | return map->at (x, y); |
456 | return map->at (x, y); |
379 | } |
457 | } |
… | |
… | |
419 | bool normalise () |
497 | bool normalise () |
420 | { |
498 | { |
421 | return xy_normalise (m, x, y); |
499 | return xy_normalise (m, x, y); |
422 | } |
500 | } |
423 | |
501 | |
|
|
502 | mapspace &ms () const |
|
|
503 | { |
|
|
504 | return m->at (x, y); |
|
|
505 | } |
|
|
506 | |
424 | object *insert (object *op, object *originator = 0, int flags = 0) const |
507 | object *insert (object *op, object *originator = 0, int flags = 0) const |
425 | { |
508 | { |
426 | m->insert (op, x, y, originator, flags); |
509 | return m->insert (op, x, y, originator, flags); |
427 | } |
510 | } |
428 | }; |
511 | }; |
429 | |
512 | |
430 | inline const mapxy & |
513 | inline const mapxy & |
431 | object::operator =(const mapxy &pos) |
514 | object::operator =(const mapxy &pos) |
… | |
… | |
435 | y = pos.y; |
518 | y = pos.y; |
436 | |
519 | |
437 | return pos; |
520 | return pos; |
438 | } |
521 | } |
439 | |
522 | |
|
|
523 | // iterate over a rectangular area relative to op |
|
|
524 | // can be used as a single statement, but both iterate macros |
|
|
525 | // invocations must not be followed by a ";" |
|
|
526 | // see common/los.C for usage example |
|
|
527 | // the walk will be ordered, outer loop x, inner loop y |
|
|
528 | // m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op |
|
|
529 | // "continue" will skip to the next space |
|
|
530 | #define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \ |
|
|
531 | for (int dx = (dx0); dx <= (dx1); ++dx) \ |
|
|
532 | { \ |
|
|
533 | sint16 nx, ny; \ |
|
|
534 | maptile *m = 0; \ |
|
|
535 | \ |
|
|
536 | for (int dy = (dy0); dy <= (dy1); ++dy) \ |
|
|
537 | { \ |
|
|
538 | /* check to see if we can simply go one down quickly, */ \ |
|
|
539 | /* if not, do it the slow way */ \ |
|
|
540 | if (!m || ++ny >= m->height) \ |
|
|
541 | { \ |
|
|
542 | nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \ |
|
|
543 | \ |
|
|
544 | if (!xy_normalise (m, nx, ny)) \ |
|
|
545 | m = 0; \ |
|
|
546 | } |
|
|
547 | |
|
|
548 | #define ordered_mapwalk_end \ |
|
|
549 | } \ |
|
|
550 | } |
|
|
551 | |
|
|
552 | // loop over every space in the given maprect, |
|
|
553 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
|
|
554 | // the iterator code must be a single statement following this macro call, similar to "if" |
|
|
555 | // "continue" will skip to the next space |
|
|
556 | #define rect_mapwalk(rect,dx0,dy0) \ |
|
|
557 | statementvar (maptile *, m, (rect)->m) \ |
|
|
558 | for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \ |
|
|
559 | for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \ |
|
|
560 | statementvar (int, dx, nx + (rect)->dx - (dx0)) \ |
|
|
561 | statementvar (int, dy, ny + (rect)->dy - (dy0)) |
|
|
562 | |
|
|
563 | // same as ordered_mapwalk, but the walk will not follow any particular |
|
|
564 | // order (unorded), but is likely faster. |
|
|
565 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
|
|
566 | // "continue" will skip to the next space |
|
|
567 | #define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \ |
|
|
568 | for (maprect *r_e_c_t = (map)->split_to_tiles ( \ |
|
|
569 | (ox) + (dx0) , (oy) + (dy0) , \ |
|
|
570 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
|
|
571 | r_e_c_t->m; \ |
|
|
572 | ++r_e_c_t) \ |
|
|
573 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
|
|
574 | |
|
|
575 | #define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ |
|
|
576 | unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
|
|
577 | |
440 | #endif |
578 | #endif |
441 | |
579 | |