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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.111 by root, Thu Jan 8 19:23:44 2009 UTC vs.
Revision 1.158 by root, Wed Dec 5 19:03:26 2018 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 5 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team 6 * Copyright (©) 2002-2005 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 7 * Copyright (©) 1992 Frank Tore Johansen
7 * 8 *
8 * Deliantra is free software: you can redistribute it and/or modify 9 * 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 10 * 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 11 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 12 * option) any later version.
12 * 13 *
13 * This program is distributed in the hope that it will be useful, 14 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 17 * GNU General Public License for more details.
17 * 18 *
18 * You should have received a copy of the GNU General Public License 19 * 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/>. 20 * and the GNU General Public License along with this program. If not, see
21 * <http://www.gnu.org/licenses/>.
20 * 22 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 23 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 24 */
23 25
24/* 26/*
25 * The maptile is allocated each time a new map is opened. 27 * The maptile is allocated each time a new map is opened.
… …
28 30
29#ifndef MAP_H 31#ifndef MAP_H
30#define MAP_H 32#define MAP_H
31 33
32#include <tr1/unordered_map> 34#include <tr1/unordered_map>
35
36//+GPL
33 37
34#include "region.h" 38#include "region.h"
35#include "cfperl.h" 39#include "cfperl.h"
36 40
37/* We set this size - this is to make magic map work properly on 41/* We set this size - this is to make magic map work properly on
… …
45 * map pointers. 49 * map pointers.
46 */ 50 */
47#define MAGIC_MAP_SIZE 50 51#define MAGIC_MAP_SIZE 50
48#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 52#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
49 53
50#define MAP_LAYERS 3 54#define MAP_LAYERS 3
51 55
52// tile map index 56// tile map index - toggling the lowest bit reverses direction
53enum { 57enum
54 TILE_UP = 0, 58{
55 TILE_RIGHT = 1, 59 TILE_NORTH,
60 TILE_SOUTH,
61 TILE_WEST,
62 TILE_EAST,
63 TILE_UP,
56 TILE_DOWN = 2, 64 TILE_DOWN,
57 TILE_LEFT = 3, 65 TILE_NUM
58}; 66};
59 67
68#define REVERSE_TILE_DIR(dir) ((dir) ^ 1)
69
60/* Values for in_memory below */ 70/* Values for state below */
61enum { 71enum
62 MAP_ACTIVE, 72{
63 MAP_INACTIVE, // not used atm. 73 MAP_SWAPPED, // header loaded, nothing else
64 MAP_SWAPPED, 74 MAP_INACTIVE, // in memory, linkable, but not active
65 MAP_LOADING, 75 MAP_ACTIVE, // running!
66 MAP_SAVING,
67}; 76};
68 77
69/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should 78/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
70 * really be used, as it is multi tile aware. However, there are some cases 79 * really be used, as it is multi tile aware. However, there are some cases
71 * where it is known the map is not tiled or the values are known 80 * where it is known the map is not tiled or the values are known
… …
85 * should almost always be using out_of_map instead, which takes into account 94 * should almost always be using out_of_map instead, which takes into account
86 * map tiling. 95 * map tiling.
87 */ 96 */
88#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height))) 97#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))
89 98
90/* These are used in the MapLook flags element. They are not used in 99/* These are used in the mapspace flags element. They are not used in
91 * in the object flags structure. 100 * in the object flags structure.
92 */ 101 */
93#define P_BLOCKSVIEW 0x01 102#define P_BLOCKSVIEW 0x01
94#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ 103#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */
95#define P_PLAYER 0x04 /* a player (or something seeing these objects) is on this mapspace */ 104#define P_NO_CLERIC 0x04 /* no clerical spells cast here */
96#define P_SAFE 0x08 /* If this is set the map tile is a safe space, 105#define P_SAFE 0x08 /* If this is set the map tile is a safe space,
97 * that means, nothing harmful can be done, 106 * that means, nothing harmful can be done,
98 * such as: bombs, potion usage, alchemy, spells 107 * such as: bombs, potion usage, alchemy, spells
99 * this was introduced to make shops safer 108 * this was introduced to make shops safer
100 * but is useful in other situations */ 109 * but is useful in other situations */
110
111#define P_PLAYER 0x10 /* a player (or something seeing these objects) is on this mapspace */
101#define P_IS_ALIVE 0x10 /* something alive is on this space */ 112#define P_IS_ALIVE 0x20 /* something alive is on this space */
102#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
103
104#define P_UPTODATE 0x80 /* this space is up to date */ 113#define P_UPTODATE 0x80 // this space is up to date
105 114
106/* The following two values are not stored in the MapLook flags, but instead 115/* The following two values are not stored in the MapLook flags, but instead
107 * used in the get_map_flags value - that function is used to return 116 * used in the get_map_flags value - that function is used to return
108 * the flag value, as well as other conditions - using a more general 117 * the flag value, as well as other conditions - using a more general
109 * function that does more of the work can hopefully be used to replace 118 * function that does more of the work can hopefully be used to replace
110 * lots of duplicate checks currently in the code. 119 * lots of duplicate checks currently in the code.
111 */ 120 */
112#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ 121#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */
113#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ 122#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */
114 123
124// persistent flags (pflags) in mapspace
125enum
126{
127 PF_VIS_UP = 0x01, // visible upwards, set by upmap, cleared by mapspace
128};
129
115/* Instead of having numerous arrays that have information on a 130/* Instead of having numerous arrays that have information on a
116 * particular space (was map, floor, floor2, map_ob), 131 * particular space (was map, floor, floor2, map_ob),
117 * have this structure take care of that information. 132 * have this structure take care of that information.
118 * This puts it all in one place, and should also make it easier 133 * This puts it all in one place, and should also make it easier
119 * to extend information about a space. 134 * to extend information about a space.
120 */ 135 */
121INTERFACE_CLASS (mapspace) 136INTERFACE_CLASS (mapspace)
122struct mapspace 137struct mapspace
123{ 138{
124 object *ACC (RW, bot); 139 object *ACC (RW, bot);
125 object *ACC (RW, top); /* lowest/highest object on this space */ 140 object *ACC (RW, top); /* lowest/highest object on this space */
126 object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ 141 object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */
127 uint32_t smell; // the last count a player was seen here, or 0
128 static uint32_t smellcount; // global smell counter
129 uint8 flags_; /* flags about this space (see the P_ values above) */ 142 uint8 flags_; /* flags about this space (see the P_ values above) */
130 sint8 ACC (RW, light); /* How much light this space provides */ 143 sint8 ACC (RW, light); /* How much light this space provides */
131 MoveType ACC (RW, move_block); /* What movement types this space blocks */ 144 MoveType ACC (RW, move_block); /* What movement types this space blocks */
132 MoveType ACC (RW, move_slow); /* What movement types this space slows */ 145 MoveType ACC (RW, move_slow); /* What movement types this space slows */
133 MoveType ACC (RW, move_on); /* What movement types are activated */ 146 MoveType ACC (RW, move_on); /* What movement types are activated */
134 MoveType ACC (RW, move_off); /* What movement types are activated */ 147 MoveType ACC (RW, move_off); /* What movement types are activated */
148 uint16_t ACC (RW, items_); // saturates at 64k
149 uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024)
150 uint32_t ACC (RW, smell); // the last count a player was seen here, or 0
151 static uint32_t ACC (RW, smellcount); // global smell counter
152
153 uint8_t pflags; // additional, persistent flags
154 uint8_t pad [3]; // pad to 64 bytes on LP64 systems
155
156//-GPL
135 157
136 void update_ (); 158 void update_ ();
137 MTH void update () 159 MTH void update ()
138 { 160 {
139 if (!(flags_ & P_UPTODATE)) 161 // we take advantage of the fact that 0x80 is the sign bit
162 // to generate more efficient code on many cpus
163 //assert (sint8 (P_UPTODATE) < 0);
164 //assert (sint8 (-1 & ~P_UPTODATE) >= 0);
165
166 if (ecb_expect_false (sint8 (flags_) >= 0))
140 update_ (); 167 update_ ();
168
169 // must be true by now (gcc seems content with only the second test)
170 ecb_assume (sint8 (flags_) < 0);
171 ecb_assume (flags_ & P_UPTODATE);
141 } 172 }
142 173
143 MTH uint8 flags () 174 MTH uint8 flags ()
144 { 175 {
145 update (); 176 update ();
146 return flags_; 177 return flags_;
147 } 178 }
148 179
180 MTH void update_up ();
181
149 MTH void invalidate () 182 MTH void invalidate ()
150 { 183 {
151 flags_ = 0; 184 flags_ = 0;
152 } 185
186 if (pflags)
187 update_up ();
153 188 }
189
154 MTH object *player () 190 MTH object *player ()
155 { 191 {
156 object *op; 192 object *op;
157 193
158 if (flags () & P_PLAYER) 194 if (flags () & P_PLAYER)
… …
162 op = 0; 198 op = 0;
163 199
164 return op; 200 return op;
165 } 201 }
166 202
203 MTH uint32 items()
204 {
205 update ();
206 return items_;
207 }
208
167 // return the item volume on this mapspace in cm³ 209 // return the item volume on this mapspace in cm³
168 MTH uint64 volume () const; 210 MTH volume_t volume ()
211 {
212 update ();
213 return volume_ * 1024;
214 }
169 215
170 bool blocks (MoveType mt) const 216 bool blocks (MoveType mt) const
171 { 217 {
172 return move_block && (mt & move_block) == mt; 218 return move_block && (mt & move_block) == mt;
173 } 219 }
… …
176 { 222 {
177 return blocks (op->move_type); 223 return blocks (op->move_type);
178 } 224 }
179}; 225};
180 226
181// a rectangular area of a map 227// a rectangular area of a map, used my split_to_tiles/unordered_mapwalk
182struct maprect 228struct maprect
183{ 229{
184 maptile *m; 230 maptile *m;
185 int x0, y0; 231 int x0, y0;
186 int x1, y1; 232 int x1, y1;
187 int dx, dy; // offset to go from local coordinates to original tile */ 233 int dx, dy; // offset to go from local coordinates to original tile */
188}; 234};
189 235
236// (refcounted) list of objects on this map that need physics processing
237struct physics_queue
238: unordered_vector<object *>
239{
240 int i; // already processed
241 physics_queue ();
242 ~physics_queue ();
243 object *pop ();
244};
245
246#define PHYSICS_QUEUES 16 // "activity" at least every 16 ticks
247
248//+GPL
249
190struct shopitems : zero_initialised 250struct shopitems : zero_initialised
191{ 251{
192 const char *name; /* name of the item in question, null if it is the default item */ 252 const char *name; /* name of the item in question, null if it is the default item */
193 const char *name_pl; /* plural name */ 253 const char *name_pl; /* plural name */
194 int typenum; /* itemtype number we need to match 0 if it is the default price */ 254 int typenum; /* itemtype number we need to match 0 if it is the default price */
195 sint8 strength; /* the degree of specialisation the shop has in this item, 255 sint8 strength; /* the degree of specialisation the shop has in this item,
196 * as a percentage from -100 to 100 */ 256 * as a percentage from -100 to 100 */
197 int index; /* being the size of the shopitems array. */ 257 int index; /* being the size of the shopitems array. */
198}; 258};
199 259
200// map I/O, what to load/save 260// map I/O, what to load/save
… …
202 IO_HEADER = 0x01, // the "arch map" pseudo object 262 IO_HEADER = 0x01, // the "arch map" pseudo object
203 IO_OBJECTS = 0x02, // the non-unique objects 263 IO_OBJECTS = 0x02, // the non-unique objects
204 IO_UNIQUES = 0x04, // unique objects 264 IO_UNIQUES = 0x04, // unique objects
205}; 265};
206 266
207/* In general, code should always use the macros 267/* In general, code should always use the macros
208 * above (or functions in map.c) to access many of the 268 * above (or functions in map.c) to access many of the
209 * values in the map structure. Failure to do this will 269 * values in the map structure. Failure to do this will
210 * almost certainly break various features. You may think 270 * almost certainly break various features. You may think
211 * it is safe to look at width and height values directly 271 * it is safe to look at width and height values directly
212 * (or even through the macros), but doing so will completely 272 * (or even through the macros), but doing so will completely
213 * break map tiling. 273 * break map tiling.
… …
221 region_ptr *regionmap; /* index to region */ 281 region_ptr *regionmap; /* index to region */
222 282
223 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ 283 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
224 284
225 shstr ACC (RW, name); /* Name of map as given by its creator */ 285 shstr ACC (RW, name); /* Name of map as given by its creator */
226 region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by 286 region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
227 * points to the struct containing all the properties of 287 * points to the struct containing all the properties of
228 * the region */ 288 * the region */
229 double ACC (RW, reset_time); 289 double ACC (RW, reset_time);
230 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map 290 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
231 * should be reset 291 * should be reset
232 */ 292 */
233 bool ACC (RW, dirty); /* if true, something was inserted or removed */ 293 bool ACC (RW, dirty); /* if true, something was inserted or removed */
234 bool ACC (RW, no_reset); // must not reset this map 294 bool ACC (RW, no_reset); // must not reset this map
235 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by 295 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
236 * players entering/exiting map 296 * players entering/exiting map
237 */ 297 */
298 uint8 ACC (RW, state); /* If not true, the map has been freed and must
299 * be loaded before used. The map,omap and map_ob
300 * arrays will be allocated when the map is loaded */
238 sint32 ACC (RW, timeout); /* swapout is set to this */ 301 sint32 ACC (RW, timeout); /* swapout is set to this */
239 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ 302 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
240 uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must
241 * be loaded before used. The map,omap and map_ob
242 * arrays will be allocated when the map is loaded */
243 sint16 players; /* How many players are on this map right now */ 303 sint16 players; /* How many players are on this map right now */
244 uint16 ACC (RW, difficulty); /* What level the player should be to play here */ 304 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
245 305
246 bool ACC (RW, per_player); 306 bool ACC (RW, per_player);
247 bool ACC (RW, per_party); 307 bool ACC (RW, per_party);
… …
251 static sint8 outdoor_darkness; /* the global darkness level outside */ 311 static sint8 outdoor_darkness; /* the global darkness level outside */
252 312
253 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ 313 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
254 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ 314 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
255 oblinkpt *buttons; /* Linked list of linked lists of buttons */ 315 oblinkpt *buttons; /* Linked list of linked lists of buttons */
256 sint16 ACC (RW, temp); /* base temperature of this tile (F) */
257 sint16 ACC (RW, pressure); /* barometric pressure (mb) */
258 sint8 ACC (RW, humid); /* humitidy of this tile */
259 sint8 ACC (RW, windspeed); /* windspeed of this tile */
260 sint8 ACC (RW, winddir); /* direction of wind */
261 sint8 ACC (RW, sky); /* sky conditions */
262 int ACC (RW, worldpartx), ACC (RW, worldparty); /*Highly fasten conversion between worldmap and weathermap */
263 struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ 316 struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */
264 shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */ 317 shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
265 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ 318 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
266 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ 319 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
267 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ 320 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
268 shstr ACC (RW, msg); /* Message map creator may have left */ 321 shstr ACC (RW, msg); /* Message map creator may have left */
269 shstr ACC (RW, maplore); /* Map lore information */ 322 shstr ACC (RW, maplore); /* Map lore information */
270 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ 323 shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
271 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ 324 maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */
272 shstr ACC (RW, path); /* Filename of the map */ 325 shstr ACC (RW, path); /* Filename of the map */
273 int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
274 uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace 326 volume_t ACC (RW, max_volume); // maximum volume for all items on a mapspace
327 int ACC (RW, max_items); // maximum number of items on a mapspace
328
329//-GPL
330
331 physics_queue pq[PHYSICS_QUEUES];
332 MTH void queue_physics (object *ob, int after = 0);
333 MTH void queue_physics_at (int x, int y);
334 MTH int run_physics (tick_t tick, int max_objects);
335 MTH void activate_physics ();
275 336
276 // the maptile:: is neccessary here for the perl interface to work 337 // the maptile:: is neccessary here for the perl interface to work
277 MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const 338 MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
278 { 339 {
279 return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); 340 return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
… …
287 // allocates all (empty) mapspace 348 // allocates all (empty) mapspace
288 MTH void alloc (); 349 MTH void alloc ();
289 // deallocates the mapspaces (and destroys all objects) 350 // deallocates the mapspaces (and destroys all objects)
290 MTH void clear (); 351 MTH void clear ();
291 352
353 MTH void post_load (); // update cached values in mapspaces etc.
292 MTH void fix_auto_apply (); 354 MTH void fix_auto_apply ();
293 MTH void do_decay_objects (); 355 MTH void do_decay_objects ();
294 MTH void update_buttons (); 356 MTH void update_buttons ();
295 MTH int change_map_light (int change); 357 MTH int change_map_light (int change);
296 MTH int estimate_difficulty () const; 358 MTH int estimate_difficulty () const;
297 359
298 MTH void play_sound (faceidx sound, int x, int y) const; 360 MTH void play_sound (faceidx sound, int x, int y) const;
299 MTH void say_msg (const char *msg, int x, int y) const; 361 MTH void say_msg (const_utf8_string msg, int x, int y) const;
300 362
301 // connected links 363 // connected links
302 oblinkpt *find_link (shstr_tmp id); 364 oblinkpt *find_link (shstr_tmp id);
303 MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); 365 MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0);
304 366
… …
322 bool _load_objects (object_thawer &thawer); 384 bool _load_objects (object_thawer &thawer);
323 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } 385 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
324 386
325 // save objects into the given file (uses IO_ flags) 387 // save objects into the given file (uses IO_ flags)
326 bool _save_objects (object_freezer &freezer, int flags); 388 bool _save_objects (object_freezer &freezer, int flags);
327 MTH bool _save_objects (const char *path, int flags); 389 MTH bool _save_objects (const_octet_string path, int flags);
328 390
329 // save the header pseudo object _only_ 391 // save the header pseudo object _only_
330 bool _save_header (object_freezer &freezer); 392 bool _save_header (object_freezer &freezer);
331 MTH bool _save_header (const char *path); 393 MTH bool _save_header (const_octet_string path);
332 394
333 maptile (); 395 maptile ();
334 maptile (int w, int h); 396 maptile (int w, int h);
397 void init ();
335 ~maptile (); 398 ~maptile ();
336 399
337 void do_destroy (); 400 void do_destroy ();
338 void gather_callbacks (AV *&callbacks, event_type event) const; 401 void gather_callbacks (AV *&callbacks, event_type event) const;
339 402
403 MTH bool linkable () { return state >= MAP_INACTIVE; }
404
340 MTH int size () const { return width * height; } 405 MTH int size () const { return width * height; }
341 406
342 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 407 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
343 408
344 MTH void touch () { last_access = runtime; } 409 MTH void touch () { last_access = runtime; }
345 410
411 // returns the map at given direction. if the map isn't linked yet,
412 // it will either return false (if load is false), or otherwise try to link
413 // it - if linking fails because the map is not loaded yet, it will
414 // start loading the map and return 0.
415 // thus, if you get 0, the map exists and load is true, then some later
416 // call (some tick or so later...) will eventually succeed.
346 MTH maptile *tile_available (int dir, bool load = true); 417 MTH maptile *tile_available (int dir, bool load = true);
347 418
348 // find the map that is at coordinate x|y relative to this map 419 // find the map that is at coordinate x|y relative to this map
349 // TODO: need a better way than passing by reference 420 // TODO: need a better way than passing by reference
350 // TODO: make perl interface 421 // TODO: make perl interface
… …
360 { 431 {
361 if (!spaces) 432 if (!spaces)
362 do_load_sync (); 433 do_load_sync ();
363 } 434 }
364 435
365 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); 436 void make_map_floor (char **layout, const char *floorstyle, random_map_params *RP);
366 bool generate_random_map (random_map_params *RP); 437 bool generate_random_map (random_map_params *RP);
367 438
368 static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL 439 static maptile *find_async (const_utf8_string path, maptile *original = 0, bool load = true);//PERL
369 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 440 static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL
370 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL 441 static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL
371 object *pick_random_object (rand_gen &gen = rndm) const; 442 object *pick_random_object (rand_gen &gen = rndm) const;
372 443
373 mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 444 mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
374 445
375 // return an array of maprects corresponding 446 // return an array of maprects corresponding
376 // to the given rectangular area. the last rect will have 447 // to the given rectangular area. the last rect will have
377 // a 0 map pointer. 448 // a 0 map pointer.
378 // the array will be stored in a static memory area,
379 // so recursion is not atm. supported
380 maprect *split_to_tiles (int x0, int y0, int x1, int y1); 449 maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1);
450
451 MTH bool is_in_shop (int x, int y) const;
381}; 452};
453
454inline bool
455object::is_in_shop () const
456{
457 return is_on_map ()
458 && map->is_in_shop (x, y);
459}
460
461//+GPL
382 462
383/* This is used by get_rangevector to determine where the other 463/* This is used by get_rangevector to determine where the other
384 * creature is. get_rangevector takes into account map tiling, 464 * creature is. get_rangevector takes into account map tiling,
385 * so you just can not look the the map coordinates and get the 465 * so you just can not look the the map coordinates and get the
386 * righte value. distance_x/y are distance away, which 466 * righte value. distance_x/y are distance away, which
… …
403// and so on. 483// and so on.
404int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); 484int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
405int out_of_map (maptile *m, int x, int y); 485int out_of_map (maptile *m, int x, int y);
406maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); 486maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
407void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); 487void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
408void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); 488void get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/);
409int on_same_map (const object *op1, const object *op2); 489int on_same_map (const object *op1, const object *op2);
410int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); 490int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy);
411 491
412// adjust map, x and y for tiled maps and return true if the position is valid at all 492// adjust map, x and y for tiled maps and return true if the position is valid at all
413static inline bool 493static inline bool
414xy_normalise (maptile *&map, sint16 &x, sint16 &y) 494xy_normalise (maptile *&map, sint16 &x, sint16 &y)
415{ 495{
… …
418 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) 498 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
419 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); 499 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
420} 500}
421// comaptibility cruft end 501// comaptibility cruft end
422 502
503//-GPL
504
423inline mapspace & 505inline mapspace &
424object::ms () const 506object::ms () const
425{ 507{
426 return map->at (x, y); 508 return map->at (x, y);
427} 509}
… …
446 return *this; 528 return *this;
447 } 529 }
448 530
449 mapxy &move (int dir) 531 mapxy &move (int dir)
450 { 532 {
451 return move (freearr_x [dir], freearr_y [dir]); 533 return move (DIRX (dir), DIRY (dir));
452 } 534 }
453 535
454 operator void *() const { return (void *)m; } 536 operator void *() const { return (void *)m; }
455 mapxy &operator =(const object *op) 537 mapxy &operator =(const object *op)
456 { 538 {
… …
517 599
518#define ordered_mapwalk_end \ 600#define ordered_mapwalk_end \
519 } \ 601 } \
520 } 602 }
521 603
604extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
605
606// special "grave" map used to store all removed objects
607// till they can be destroyed - saves a lot of checks in the rest
608// of the code
609struct freed_map
610: maptile
611{
612 freed_map ()
613 : maptile (3, 3)
614 {
615 path = "<freed objects map>";
616 name = "/internal/freed_objects_map";
617 no_drop = 1;
618 no_reset = 1;
619
620 state = MAP_ACTIVE;
621 }
622
623 ~freed_map ()
624 {
625 destroy ();
626 }
627};
628
629// initialised in common/shstr.C, due to shstr usage we need defined
630// initialisation order!
631extern struct freed_map freed_map; // freed objects are moved here to avoid crashes
632
522// loop over every space in the given maprect, 633// loop over every space in the given maprect,
523// setting m, nx, ny to the map and -coordinate and dx, dy to the offste relative to dx0,dy0 634// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
524// the iterator code must be a single statement following this macro call, similar to "if" 635// the iterator code must be a single statement following this macro call, similar to "if"
525// "continue" will skip to the next space 636// "continue" will skip to the next space
526#define rect_mapwalk(rect,dx0,dy0) \ 637#define rect_mapwalk(rect,dx0,dy0) \
527 statementvar (maptile *, m, (rect)->m) \ 638 statementvar (maptile *, m, (rect)->m) \
528 for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \ 639 for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \
529 for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \ 640 for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \
530 statementvar (int, dx, nx + (rect)->dx - (dx0)) \ 641 statementvar (int, dx, nx + (rect)->dx - (dx0)) \
531 statementvar (int, dy, ny + (rect)->dy - (dy0)) 642 statementvar (int, dy, ny + (rect)->dy - (dy0))
532 643
533// same as above, but the walk will not follow any particular 644// same as ordered_mapwalk, but the walk will not follow any particular
534// order (unorded), but is likely faster. 645// order (unorded), but is likely faster.
535// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op 646// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
536// "continue" will skip to the next space 647// "continue" will skip to the next space
537#define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ 648#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \
538 for (maprect *r_e_c_t = (op)->map->split_to_tiles ( \ 649 for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \
539 (op)->x + (dx0) , (op)->y + (dy0) , \ 650 (ox) + (dx0) , (oy) + (dy0) , \
540 (op)->x + (dx1) + 1, (op)->y + (dy1) + 1); \ 651 (ox) + (dx1) + 1, (oy) + (dy1) + 1); \
541 r_e_c_t->m; \ 652 r_e_c_t->m; \
542 ++r_e_c_t) \ 653 ++r_e_c_t) \
543 rect_mapwalk (r_e_c_t, (op)->x, (op)->y) 654 rect_mapwalk (r_e_c_t, (ox), (oy))
655
656#define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \
657 unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1)
544 658
545#endif 659#endif
546 660

Diff Legend

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