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_SWAPPED, // header loaded, nothing else |
55 | MAP_INACTIVE, // not used atm. |
69 | MAP_INACTIVE, // in memory, linkable, but not active |
56 | MAP_SWAPPED, |
70 | MAP_ACTIVE, // running! |
57 | MAP_LOADING, |
|
|
58 | MAP_SAVING, |
|
|
59 | }; |
71 | }; |
60 | |
72 | |
61 | /* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should |
73 | /* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should |
62 | * really be used, as it is multi tile aware. However, there are some cases |
74 | * really be used, as it is multi tile aware. However, there are some cases |
63 | * where it is known the map is not tiled or the values are known |
75 | * where it is known the map is not tiled or the values are known |
64 | * consistent (eg, op->map, op->x, op->y) |
76 | * consistent (eg, op->map, op->x, op->y) |
65 | */ |
77 | */ |
66 | // all those macros are herewith declared legacy |
78 | // all those macros are herewith declared legacy |
67 | #define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
79 | #define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
68 | #define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light |
|
|
69 | #define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
80 | #define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
70 | #define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
81 | #define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
71 | #define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
82 | #define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
72 | #define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
83 | #define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
73 | #define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
84 | #define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
… | |
… | |
83 | /* These are used in the MapLook flags element. They are not used in |
94 | /* These are used in the MapLook flags element. They are not used in |
84 | * in the object flags structure. |
95 | * in the object flags structure. |
85 | */ |
96 | */ |
86 | #define P_BLOCKSVIEW 0x01 |
97 | #define P_BLOCKSVIEW 0x01 |
87 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
98 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
88 | //#define P_PLAYER 0x04 /* a player (or something seeing these objects) is on this mapspace */ |
99 | #define P_NO_CLERIC 0x04 /* no clerical spells cast here */ |
89 | #define P_SAFE 0x08 /* If this is set the map tile is a safe space, |
100 | #define P_SAFE 0x08 /* If this is set the map tile is a safe space, |
90 | * that means, nothing harmful can be done, |
101 | * that means, nothing harmful can be done, |
91 | * such as: bombs, potion usage, alchemy, spells |
102 | * such as: bombs, potion usage, alchemy, spells |
92 | * this was introduced to make shops safer |
103 | * this was introduced to make shops safer |
93 | * but is useful in other situations */ |
104 | * but is useful in other situations */ |
|
|
105 | |
|
|
106 | #define P_PLAYER 0x10 /* a player (or something seeing these objects) is on this mapspace */ |
94 | #define P_IS_ALIVE 0x10 /* something alive is on this space */ |
107 | #define P_IS_ALIVE 0x20 /* something alive is on this space */ |
95 | #define P_NO_CLERIC 0x20 /* no clerical spells cast here */ |
|
|
96 | |
|
|
97 | #define P_UPTODATE 0x80 /* this space is up to date */ |
108 | #define P_UPTODATE 0x80 // this space is up to date |
98 | |
109 | |
99 | /* The following two values are not stored in the MapLook flags, but instead |
110 | /* The following two values are not stored in the MapLook flags, but instead |
100 | * used in the get_map_flags value - that function is used to return |
111 | * used in the get_map_flags value - that function is used to return |
101 | * the flag value, as well as other conditions - using a more general |
112 | * the flag value, as well as other conditions - using a more general |
102 | * function that does more of the work can hopefully be used to replace |
113 | * function that does more of the work can hopefully be used to replace |
103 | * lots of duplicate checks currently in the code. |
114 | * lots of duplicate checks currently in the code. |
104 | */ |
115 | */ |
105 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
116 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
106 | #define P_NEW_MAP 0x20000 |
117 | #define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ |
107 | /* Coordinates passed result in a new tiled map */ |
|
|
108 | |
118 | |
109 | /* Instead of having numerous arrays that have information on a |
119 | /* Instead of having numerous arrays that have information on a |
110 | * particular space (was map, floor, floor2, map_ob), |
120 | * particular space (was map, floor, floor2, map_ob), |
111 | * have this structure take care of that information. |
121 | * have this structure take care of that information. |
112 | * This puts it all in one place, and should also make it easier |
122 | * This puts it all in one place, and should also make it easier |
… | |
… | |
114 | */ |
124 | */ |
115 | INTERFACE_CLASS (mapspace) |
125 | INTERFACE_CLASS (mapspace) |
116 | struct mapspace |
126 | struct mapspace |
117 | { |
127 | { |
118 | object *ACC (RW, bot); |
128 | object *ACC (RW, bot); |
119 | object *ACC (RW, top); /* lowest/highest object on this space */ |
129 | object *ACC (RW, top); /* lowest/highest object on this space */ |
120 | object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ |
130 | object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ |
121 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
131 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
122 | sint8 ACC (RW, light); /* How much light this space provides */ |
132 | sint8 ACC (RW, light); /* How much light this space provides */ |
123 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
133 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
124 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
134 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
125 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
135 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
126 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
136 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
|
|
137 | uint16_t ACC (RW, items_); // saturates at 64k |
|
|
138 | uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) |
|
|
139 | uint32_t ACC (RW, smell); // the last count a player was seen here, or 0 |
|
|
140 | static uint32_t ACC (RW, smellcount); // global smell counter |
|
|
141 | |
|
|
142 | uint32_t pad1_; // pad to 64 bytes on 64 bit systems |
|
|
143 | |
|
|
144 | //-GPL |
127 | |
145 | |
128 | void update_ (); |
146 | void update_ (); |
129 | MTH void update () |
147 | MTH void update () |
130 | { |
148 | { |
131 | if (!(flags_ & P_UPTODATE)) |
149 | // we take advantage of the fact that 0x80 is the sign bit |
|
|
150 | // to generate more efficient code on many cpus |
|
|
151 | assert (sint8 (P_UPTODATE) < 0); |
|
|
152 | assert (sint8 (-1 & ~P_UPTODATE) >= 0); |
|
|
153 | |
|
|
154 | if (expect_false (sint8 (flags_) >= 0)) |
132 | update_ (); |
155 | update_ (); |
|
|
156 | |
|
|
157 | // must be true by now (gcc seems content with only the second test) |
|
|
158 | assume (sint8 (flags_) < 0); |
|
|
159 | assume (flags_ & P_UPTODATE); |
133 | } |
160 | } |
134 | |
161 | |
135 | MTH uint8 flags () |
162 | MTH uint8 flags () |
136 | { |
163 | { |
137 | update (); |
164 | update (); |
138 | return flags_; |
165 | return flags_; |
139 | } |
166 | } |
|
|
167 | |
|
|
168 | MTH void invalidate () |
|
|
169 | { |
|
|
170 | flags_ = 0; |
|
|
171 | } |
140 | |
172 | |
141 | MTH object *player () |
173 | MTH object *player () |
142 | { |
174 | { |
143 | // this assumes that players are always on top |
175 | object *op; |
144 | return top && top->type == PLAYER ? top : 0; |
176 | |
|
|
177 | if (flags () & P_PLAYER) |
|
|
178 | for (op = top; op->type != PLAYER; op = op->below) |
|
|
179 | ; |
|
|
180 | else |
|
|
181 | op = 0; |
|
|
182 | |
|
|
183 | return op; |
|
|
184 | } |
|
|
185 | |
|
|
186 | MTH uint32 items() |
|
|
187 | { |
|
|
188 | update (); |
|
|
189 | return items_; |
145 | } |
190 | } |
146 | |
191 | |
147 | // return the item volume on this mapspace in cm³ |
192 | // return the item volume on this mapspace in cm³ |
148 | MTH uint64 volume () const; |
193 | MTH uint64 volume () |
|
|
194 | { |
|
|
195 | update (); |
|
|
196 | return volume_ * 1024; |
|
|
197 | } |
149 | |
198 | |
150 | bool blocks (MoveType mt) const |
199 | bool blocks (MoveType mt) const |
151 | { |
200 | { |
152 | return move_block && (mt & move_block) == mt; |
201 | return move_block && (mt & move_block) == mt; |
153 | } |
202 | } |
… | |
… | |
155 | bool blocks (object *op) const |
204 | bool blocks (object *op) const |
156 | { |
205 | { |
157 | return blocks (op->move_type); |
206 | return blocks (op->move_type); |
158 | } |
207 | } |
159 | }; |
208 | }; |
|
|
209 | |
|
|
210 | // a rectangular area of a map, used my split_to_tiles/unordered_mapwalk |
|
|
211 | struct maprect |
|
|
212 | { |
|
|
213 | maptile *m; |
|
|
214 | int x0, y0; |
|
|
215 | int x1, y1; |
|
|
216 | int dx, dy; // offset to go from local coordinates to original tile */ |
|
|
217 | }; |
|
|
218 | |
|
|
219 | //+GPL |
160 | |
220 | |
161 | struct shopitems : zero_initialised |
221 | struct shopitems : zero_initialised |
162 | { |
222 | { |
163 | const char *name; /* name of the item in question, null if it is the default item */ |
223 | const char *name; /* name of the item in question, null if it is the default item */ |
164 | const char *name_pl; /* plural name */ |
224 | const char *name_pl; /* plural name */ |
… | |
… | |
216 | |
276 | |
217 | bool ACC (RW, per_player); |
277 | bool ACC (RW, per_player); |
218 | bool ACC (RW, per_party); |
278 | bool ACC (RW, per_party); |
219 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
279 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
220 | bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */ |
280 | 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 */ |
281 | sint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
|
|
282 | static sint8 outdoor_darkness; /* the global darkness level outside */ |
222 | |
283 | |
223 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
284 | 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 */ |
285 | 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 */ |
286 | 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 */ |
287 | 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 */ |
288 | shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ |
235 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
289 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
236 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
290 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
237 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
291 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
238 | shstr ACC (RW, msg); /* Message map creator may have left */ |
292 | shstr ACC (RW, msg); /* Message map creator may have left */ |
239 | shstr ACC (RW, maplore); /* Map lore information */ |
293 | shstr ACC (RW, maplore); /* Map lore information */ |
240 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
294 | shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */ |
241 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
295 | maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */ |
242 | shstr ACC (RW, path); /* Filename of the map */ |
296 | 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 |
297 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
|
|
298 | int ACC (RW, max_items); // maximum number of items on a mapspace |
|
|
299 | |
|
|
300 | //-GPL |
|
|
301 | |
|
|
302 | // the maptile:: is neccessary here for the perl interface to work |
|
|
303 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
|
|
304 | { |
|
|
305 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
|
|
306 | } |
|
|
307 | |
|
|
308 | static void adjust_daylight (); |
245 | |
309 | |
246 | MTH void activate (); |
310 | MTH void activate (); |
247 | MTH void deactivate (); |
311 | MTH void deactivate (); |
248 | |
312 | |
249 | // allocates all (empty) mapspace |
313 | // allocates all (empty) mapspace |
250 | MTH void alloc (); |
314 | MTH void alloc (); |
251 | // deallocates the mapspaces (and destroys all objects) |
315 | // deallocates the mapspaces (and destroys all objects) |
252 | MTH void clear (); |
316 | MTH void clear (); |
253 | |
317 | |
|
|
318 | MTH void post_load (); // update cached values in mapspaces etc. |
254 | MTH void fix_auto_apply (); |
319 | MTH void fix_auto_apply (); |
255 | MTH void do_decay_objects (); |
320 | MTH void do_decay_objects (); |
256 | MTH void update_buttons (); |
321 | MTH void update_buttons (); |
257 | MTH int change_map_light (int change); |
322 | 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; |
323 | MTH int estimate_difficulty () const; |
261 | |
324 | |
262 | MTH void play_sound (faceidx sound, int x, int y) const; |
325 | MTH void play_sound (faceidx sound, int x, int y) const; |
|
|
326 | MTH void say_msg (const_utf8_string msg, int x, int y) const; |
|
|
327 | |
|
|
328 | // connected links |
|
|
329 | oblinkpt *find_link (shstr_tmp id); |
|
|
330 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
263 | |
331 | |
264 | // set the given flag on all objects in the map |
332 | // set the given flag on all objects in the map |
265 | MTH void set_object_flag (int flag, int value = 1); |
333 | MTH void set_object_flag (int flag, int value = 1); |
266 | MTH void post_load_original (); |
334 | MTH void post_load_original (); |
267 | |
335 | |
… | |
… | |
281 | bool _load_objects (object_thawer &thawer); |
349 | bool _load_objects (object_thawer &thawer); |
282 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
350 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
283 | |
351 | |
284 | // save objects into the given file (uses IO_ flags) |
352 | // save objects into the given file (uses IO_ flags) |
285 | bool _save_objects (object_freezer &freezer, int flags); |
353 | bool _save_objects (object_freezer &freezer, int flags); |
286 | MTH bool _save_objects (const char *path, int flags); |
354 | MTH bool _save_objects (const_octet_string path, int flags); |
287 | |
355 | |
288 | // save the header pseudo object _only_ |
356 | // save the header pseudo object _only_ |
289 | bool _save_header (object_freezer &freezer); |
357 | bool _save_header (object_freezer &freezer); |
290 | MTH bool _save_header (const char *path); |
358 | MTH bool _save_header (const_octet_string path); |
291 | |
359 | |
292 | maptile (); |
360 | maptile (); |
293 | maptile (int w, int h); |
361 | maptile (int w, int h); |
|
|
362 | void init (); |
294 | ~maptile (); |
363 | ~maptile (); |
295 | |
364 | |
296 | void do_destroy (); |
365 | void do_destroy (); |
297 | void gather_callbacks (AV *&callbacks, event_type event) const; |
366 | void gather_callbacks (AV *&callbacks, event_type event) const; |
298 | |
367 | |
|
|
368 | MTH bool linkable () { return in_memory >= MAP_INACTIVE; } |
|
|
369 | |
299 | MTH int size () const { return width * height; } |
370 | MTH int size () const { return width * height; } |
300 | |
371 | |
301 | 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); |
302 | |
373 | |
303 | MTH void touch () { last_access = runtime; } |
374 | MTH void touch () { last_access = runtime; } |
304 | |
375 | |
305 | MTH bool tile_available (int dir, bool load = true); |
376 | MTH maptile *tile_available (int dir, bool load = true); |
306 | |
377 | |
307 | // 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 |
308 | // TODO: need a better way than passing by reference |
379 | // TODO: need a better way than passing by reference |
309 | // TODO: make perl interface |
380 | // TODO: make perl interface |
310 | maptile *xy_find (sint16 &x, sint16 &y); |
381 | maptile *xy_find (sint16 &x, sint16 &y); |
… | |
… | |
319 | { |
390 | { |
320 | if (!spaces) |
391 | if (!spaces) |
321 | do_load_sync (); |
392 | do_load_sync (); |
322 | } |
393 | } |
323 | |
394 | |
324 | 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); |
325 | bool generate_random_map (random_map_params *RP); |
396 | bool generate_random_map (random_map_params *RP); |
326 | |
397 | |
327 | 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 |
328 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
399 | static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL |
329 | 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 |
330 | object *pick_random_object (rand_gen &gen = rndm) const; |
401 | object *pick_random_object (rand_gen &gen = rndm) const; |
331 | |
402 | |
332 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
403 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
333 | mapspace &at (uint32 x, uint32 y) { 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; |
334 | }; |
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 |
335 | |
421 | |
336 | /* This is used by get_rangevector to determine where the other |
422 | /* This is used by get_rangevector to determine where the other |
337 | * creature is. get_rangevector takes into account map tiling, |
423 | * creature is. get_rangevector takes into account map tiling, |
338 | * 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 |
339 | * righte value. distance_x/y are distance away, which |
425 | * righte value. distance_x/y are distance away, which |
… | |
… | |
356 | // and so on. |
442 | // and so on. |
357 | 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); |
358 | int out_of_map (maptile *m, int x, int y); |
444 | int out_of_map (maptile *m, int x, int y); |
359 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
445 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
360 | 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); |
361 | 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*/); |
362 | int on_same_map (const object *op1, const object *op2); |
448 | int on_same_map (const object *op1, const object *op2); |
363 | 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); |
364 | |
450 | |
365 | // 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 |
366 | static inline bool |
452 | static inline bool |
367 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
453 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
368 | { |
454 | { |
… | |
… | |
371 | (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)) |
372 | || !(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); |
373 | } |
459 | } |
374 | // comaptibility cruft end |
460 | // comaptibility cruft end |
375 | |
461 | |
|
|
462 | //-GPL |
|
|
463 | |
376 | inline mapspace & |
464 | inline mapspace & |
377 | object::ms () const |
465 | object::ms () const |
378 | { |
466 | { |
379 | return map->at (x, y); |
467 | return map->at (x, y); |
380 | } |
468 | } |
… | |
… | |
441 | y = pos.y; |
529 | y = pos.y; |
442 | |
530 | |
443 | return pos; |
531 | return pos; |
444 | } |
532 | } |
445 | |
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 | |
446 | #endif |
591 | #endif |
447 | |
592 | |