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.39 by root, Wed Dec 27 13:13:47 2006 UTC vs.
Revision 1.73 by root, Sat Apr 14 07:23:00 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 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,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 21 *
21 The authors can be reached via e-mail at crossfire@schmorp.de 22 * The authors can be reached via e-mail at crossfire@schmorp.de
22*/ 23 */
23 24
24/* 25/*
25 * The maptile is allocated each time a new map is opened. 26 * The maptile is allocated each time a new map is opened.
26 * It contains pointers (very indirectly) to all objects on the map. 27 * It contains pointers (very indirectly) to all objects on the map.
27 */ 28 */
28 29
29#ifndef MAP_H 30#ifndef MAP_H
30#define MAP_H 31#define MAP_H
32
33#include <tr1/unordered_map>
31 34
32#include "cfperl.h" 35#include "cfperl.h"
33 36
34/* We set this size - this is to make magic map work properly on 37/* We set this size - this is to make magic map work properly on
35 * tiled maps. There is no requirement that this matches the 38 * tiled maps. There is no requirement that this matches the
44#define MAGIC_MAP_SIZE 50 47#define MAGIC_MAP_SIZE 50
45#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 48#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
46 49
47#define MAP_LAYERS 3 50#define MAP_LAYERS 3
48 51
49/* options passed to ready_map_name and load_original_map */
50#define MAP_FLUSH 0x01
51#define MAP_PLAYER_UNIQUE 0x02
52#define MAP_BLOCK 0x04
53#define MAP_STYLE 0x08
54#define MAP_OVERLAY 0x10
55
56/* Values for in_memory below. Should probably be an enumerations */ 52/* Values for in_memory below. Should probably be an enumerations */
57#define MAP_IN_MEMORY 1 53enum {
58#define MAP_SWAPPED 2 54 MAP_IN_MEMORY,
59#define MAP_LOADING 3 55 MAP_SWAPPED,
60#define MAP_SAVING 4 56 MAP_LOADING,
57 MAP_SAVING,
58};
61 59
62/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should 60/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
63 * really be used, as it is multi tile aware. However, there are some cases 61 * really be used, as it is multi tile aware. However, there are some cases
64 * where it is known the map is not tiled or the values are known 62 * where it is known the map is not tiled or the values are known
65 * consistent (eg, op->map, op->x, op->y) 63 * consistent (eg, op->map, op->x, op->y)
67// all those macros are herewith declared legacy 65// all those macros are herewith declared legacy
68#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () 66#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()
69#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light 67#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light
70#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot 68#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot
71#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top 69#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top
72#define GET_MAP_FACE(M,X,Y,L) (M)->at((X),(Y)).faces[L]
73#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] 70#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]
74#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block 71#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block
75#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow 72#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow
76#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on 73#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on
77#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off 74#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off
78 75
79/* You should really know what you are doing before using this - you 76/* You should really know what you are doing before using this - you
80 * should almost always be using out_of_map instead, which takes into account 77 * should almost always be using out_of_map instead, which takes into account
81 * map tiling. 78 * map tiling.
82 */ 79 */
83#define OUT_OF_REAL_MAP(M,X,Y) ((X)<0 || (Y)<0 || (X)>=(M)->width || (Y)>=(M)->height) 80#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))
84 81
85/* These are used in the MapLook flags element. They are not used in 82/* These are used in the MapLook flags element. They are not used in
86 * in the object flags structure. 83 * in the object flags structure.
87 */ 84 */
88#define P_BLOCKSVIEW 0x01 85#define P_BLOCKSVIEW 0x01
94 * this was introduced to make shops safer 91 * this was introduced to make shops safer
95 * but is useful in other situations */ 92 * but is useful in other situations */
96#define P_IS_ALIVE 0x10 /* something alive is on this space */ 93#define P_IS_ALIVE 0x10 /* something alive is on this space */
97#define P_NO_CLERIC 0x20 /* no clerical spells cast here */ 94#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
98 95
99#define P_NEED_UPDATE 0x80 /* this space is out of date */ 96#define P_UPTODATE 0x80 /* this space is up to date */
100 97
101/* The following two values are not stored in the MapLook flags, but instead 98/* The following two values are not stored in the MapLook flags, but instead
102 * used in the get_map_flags value - that function is used to return 99 * used in the get_map_flags value - that function is used to return
103 * the flag value, as well as other conditions - using a more general 100 * the flag value, as well as other conditions - using a more general
104 * function that does more of the work can hopefully be used to replace 101 * function that does more of the work can hopefully be used to replace
120 * to extend information about a space. 117 * to extend information about a space.
121 */ 118 */
122struct mapspace 119struct mapspace
123{ 120{
124 object *bot, *top; /* lowest/highest object on this space */ 121 object *bot, *top; /* lowest/highest object on this space */
125 New_Face *faces[MAP_LAYERS]; /* faces for the 3 layers */
126 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ 122 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */
127 uint8 flags_; /* flags about this space (see the P_ values above) */ 123 uint8 flags_; /* flags about this space (see the P_ values above) */
128 sint8 light; /* How much light this space provides */ 124 sint8 light; /* How much light this space provides */
129 MoveType move_block; /* What movement types this space blocks */ 125 MoveType move_block; /* What movement types this space blocks */
130 MoveType move_slow; /* What movement types this space slows */ 126 MoveType move_slow; /* What movement types this space slows */
132 MoveType move_off; /* What movement types are activated */ 128 MoveType move_off; /* What movement types are activated */
133 129
134 void update_ (); 130 void update_ ();
135 void update () 131 void update ()
136 { 132 {
137 if (flags_ & P_NEED_UPDATE) 133 if (!(flags_ & P_UPTODATE))
138 update_ (); 134 update_ ();
139 } 135 }
140 136
141 uint8 flags () 137 uint8 flags ()
142 { 138 {
155 if (op->type == PLAYER) 151 if (op->type == PLAYER)
156 return op; 152 return op;
157 153
158 return 0; 154 return 0;
159 } 155 }
160};
161 156
162/* 157 // return the item volume on this mapspace in cm³
163 * this is an overlay structure of the whole world. It exists as a simple 158 uint64 volume () const;
164 * high level map, which doesn't contain the full data of the underlying map.
165 * in this map, only things such as weather are recorded. By doing so, we
166 * can keep the entire world parameters in memory, and act as a whole on
167 * them at once. We can then, in a separate loop, update the actual world
168 * with the new values we have assigned.
169 */
170
171struct weathermap_t
172{
173 sint16 temp; /* base temperature of this tile (F) */
174 sint16 pressure; /* barometric pressure (mb) */
175 sint8 humid; /* humitidy of this tile */
176 sint8 windspeed; /* windspeed of this tile */
177 sint8 winddir; /* direction of wind */
178 sint8 sky; /* sky conditions */
179 sint32 avgelev; /* average elevation */
180 uint32 rainfall; /* cumulative rainfall */
181 uint8 darkness; /* indicates level of darkness of map */
182 uint8 water; /* 0-100 percentage of water tiles */
183 /*Dynamic parts */
184 sint16 realtemp; /* temperature at a given calculation step for this tile */
185}; 159};
186 160
187/* 161/*
188 * Each map is in a given region of the game world and links to a region definiton, so 162 * Each map is in a given region of the game world and links to a region definiton, so
189 * they have to appear here in the headers, before the mapdef 163 * they have to appear here in the headers, before the mapdef
190 */ 164 */
165INTERFACE_CLASS (region)
191struct region : zero_initialised 166struct region : zero_initialised
192{ 167{
193 struct region *next; /* pointer to next region, NULL for the last one */
194 const char *name; /* Shortend name of the region as maps refer to it */ 168 shstr ACC (RW, name); /* Shortend name of the region as maps refer to it */
195 const char *parent_name; /* 169 shstr ACC (RW, match); // a perl regex that matches map paths
196 * So that parent and child regions can be defined in 170 region *ACC (RW, parent); /*
197 * any order, we keep hold of the parent_name during
198 * initialisation, and the children get assigned to their
199 * parents later. (before runtime on the server though)
200 * nothing outside the init code should ever use this value.
201 */
202 struct region *parent; /*
203 * Pointer to the region that is a parent of the current 171 * Pointer to the region that is a parent of the current
204 * region, if a value isn't defined in the current region 172 * region, if a value isn't defined in the current region
205 * we traverse this series of pointers until it is. 173 * we traverse this series of pointers until it is.
206 */ 174 */
207 const char *longname; /* Official title of the region, this might be defined 175 shstr ACC (RW, longname); /* Official title of the region, this might be defined
208 * to be the same as name*/ 176 * to be the same as name*/
209 const char *msg; /* the description of the region */ 177 shstr ACC (RW, msg); /* the description of the region */
178 shstr ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */
179 int ACC (RW, index);
210 uint32 counter; /* A generic counter for holding temporary data. */ 180 uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */
181 sint16 ACC (RW, jailx), ACC (RW, jaily);/* The coodinates in jailmap to which the player should be sent. */
211 sint8 fallback; /* whether, in the event of a region not existing, 182 bool ACC (RW, fallback); /* whether, in the event of a region not existing,
212 * this should be the one we fall back on as the default */ 183 * this should be the one we fall back on as the default */
213 char *jailmap; /*where a player that is arrested in this region should be imprisoned. */ 184
214 sint16 jailx, jaily; /* The coodinates in jailmap to which the player should be sent. */ 185 static region *default_region ();
186 static region *find (const char *name);
187 static region *find_fuzzy (const char *name);
188 static region *read (object_thawer &f);
215}; 189};
190
191typedef object_vector<region, &region::index> regionvec;
192
193extern regionvec regions;
194
195#define for_all_regions(var) \
196 for (unsigned _i = 0; _i < regions.size (); ++_i) \
197 declvar (region *, var, regions [_i])
216 198
217struct shopitems : zero_initialised 199struct shopitems : zero_initialised
218{ 200{
219 const char *name; /* name of the item in question, null if it is the default item */ 201 const char *name; /* name of the item in question, null if it is the default item */
220 const char *name_pl; /* plural name */ 202 const char *name_pl; /* plural name */
221 int typenum; /* itemtype number we need to match 0 if it is the default price */ 203 int typenum; /* itemtype number we need to match 0 if it is the default price */
222 sint8 strength; /* the degree of specialisation the shop has in this item, 204 sint8 strength; /* the degree of specialisation the shop has in this item,
223 * as a percentage from -100 to 100 */ 205 * as a percentage from -100 to 100 */
224 int index; /* being the size of the shopitems array. */ 206 int index; /* being the size of the shopitems array. */
207};
208
209// map I/O, what to load/save
210enum {
211 IO_HEADER = 0x01, // the "arch map" pseudo object
212 IO_OBJECTS = 0x02, // the non-unique objects
213 IO_UNIQUES = 0x04, // unique objects
225}; 214};
226 215
227/* In general, code should always use the macros 216/* In general, code should always use the macros
228 * above (or functions in map.c) to access many of the 217 * above (or functions in map.c) to access many of the
229 * values in the map structure. Failure to do this will 218 * values in the map structure. Failure to do this will
233 * break map tiling. 222 * break map tiling.
234 */ 223 */
235INTERFACE_CLASS (maptile) 224INTERFACE_CLASS (maptile)
236struct maptile : zero_initialised, attachable 225struct maptile : zero_initialised, attachable
237{ 226{
238 sint32 ACC (RO, width), ACC (RO, height); /* Width and height of map. */ 227 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
239 struct mapspace *spaces; /* Array of spaces on this map */ 228 struct mapspace *spaces; /* Array of spaces on this map */
229 uint8 *regions; /* region index per mapspace, if != 0 */
230 struct region **regionmap; /* index to region */
240 231
241 maptile *ACC (RW, next); /* Next map, linked list */ 232 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
242 char *ACC (RO, tmpname); /* Name of temporary file */ 233
243 char *ACC (RO, name); /* Name of map as given by its creator */ 234 shstr ACC (RW, name); /* Name of map as given by its creator */
244 struct region *ACC (RW, region); /* What jurisdiction in the game world this map is ruled by 235 struct region *ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
245 * points to the struct containing all the properties of 236 * points to the struct containing all the properties of
246 * the region */ 237 * the region */
247 uint32 ACC (RW, reset_time); /* when this map should reset */ 238 double ACC (RW, reset_time);
248 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map 239 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
249 * should be reset 240 * should be reset
250 */ 241 */
242 bool ACC (RW, dirty); /* if true, something was inserted or removed */
251 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by 243 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
252 * players entering/exiting map 244 * players entering/exiting map
253 */ 245 */
254 bool ACC (RW, unique); /* if set, this is a per player unique map */
255 bool ACC (RW, templatemap); /* if set, this is a template map */
256 bool ACC (RW, nosmooth); /* if set the content of this map has smoothlevel=0 forced */
257 sint32 ACC (RW, timeout); /* swapout is set to this */ 246 sint32 ACC (RW, timeout); /* swapout is set to this */
258 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ 247 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
259 uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must 248 uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must
260 * be loaded before used. The map,omap and map_ob 249 * be loaded before used. The map,omap and map_ob
261 * arrays will be allocated when the map is loaded */ 250 * arrays will be allocated when the map is loaded */
262 sint16 ACC (RW, players); /* How many players are on this level right now */ 251 sint16 players; /* How many players are on this map right now */
263 uint16 ACC (RW, difficulty); /* What level the player should be to play here */ 252 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
264 253
254 bool ACC (RW, per_player);
255 bool ACC (RW, per_party);
256 bool ACC (RW, outdoor); /* True if an outdoor map */
257 bool ACC (RW, nodrop); /* avoid dropping anything on this map */
265 uint8 ACC (RW, darkness); /* indicates level of darkness of map */ 258 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
259
266 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ 260 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
267 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ 261 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
268 bool ACC (RW, outdoor); /* True if an outdoor map */
269 oblinkpt *buttons; /* Linked list of linked lists of buttons */ 262 oblinkpt *buttons; /* Linked list of linked lists of buttons */
270 sint16 ACC (RW, temp); /* base temperature of this tile (F) */ 263 sint16 ACC (RW, temp); /* base temperature of this tile (F) */
271 sint16 ACC (RW, pressure); /* barometric pressure (mb) */ 264 sint16 ACC (RW, pressure); /* barometric pressure (mb) */
272 sint8 ACC (RW, humid); /* humitidy of this tile */ 265 sint8 ACC (RW, humid); /* humitidy of this tile */
273 sint8 ACC (RW, windspeed); /* windspeed of this tile */ 266 sint8 ACC (RW, windspeed); /* windspeed of this tile */
274 sint8 ACC (RW, winddir); /* direction of wind */ 267 sint8 ACC (RW, winddir); /* direction of wind */
275 sint8 ACC (RW, sky); /* sky conditions */ 268 sint8 ACC (RW, sky); /* sky conditions */
276 int ACC (RW, worldpartx), ACC (RW, worldparty); /*Highly fasten conversion between worldmap and weathermap */ 269 int ACC (RW, worldpartx), ACC (RW, worldparty); /*Highly fasten conversion between worldmap and weathermap */
277 struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ 270 struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */
278 char *ACC (RO, shoprace); /* the preffered race of the local shopkeeper */ 271 shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
279 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ 272 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
280 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ 273 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
281 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ 274 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
282 char *ACC (RO, msg); /* Message map creator may have left */ 275 shstr ACC (RW, msg); /* Message map creator may have left */
283 char *ACC (RO, maplore); /* Map lore information */ 276 shstr ACC (RW, maplore); /* Map lore information */
284 char *tile_path[4]; /* path to adjoining maps */ 277 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
285 maptile *tile_map[4]; /* Next map, linked list */ 278 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */
286 char ACC (RW, path)[HUGE_BUF]; /* Filename of the map */ 279 shstr ACC (RW, path); /* Filename of the map */
280 int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
281 uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
282
283 MTH void activate ();
284 MTH void deactivate ();
285
286 // allocates all (empty) mapspace
287 MTH void alloc ();
288 // deallocates the mapspaces (and destroys all objects)
289 MTH void clear ();
290
291 MTH void fix_auto_apply ();
292 MTH void decay_objects ();
293 MTH void update_buttons ();
294 MTH int change_map_light (int change);
295 static void change_all_map_light (int change); //PERL
296 MTH void set_darkness_map ();
297 MTH int estimate_difficulty () const;
298
299 // set the given flag on all objects in the map
300 MTH void set_object_flag (int flag, int value = 1);
301
302 MTH void link_multipart_objects ();
303 MTH void clear_unique_items ();
304
305 MTH void clear_header ();
306 MTH void clear_links_to (maptile *m);
307
308 MTH struct region *region (int x, int y) const;
309
310 // loas the header pseudo-object
311 bool _load_header (object_thawer &thawer);
312 MTH bool _load_header (const char *path);
313
314 // load objects into the map
315 bool _load_objects (object_thawer &thawer);
316 MTH bool _load_objects (const char *path, bool skip_header = true);
317
318 // save objects into the given file (uses IO_ flags)
319 bool _save_objects (object_freezer &freezer, int flags);
320 MTH bool _save_objects (const char *path, int flags);
321
322 // save the header pseudo object _only_
323 bool _save_header (object_freezer &freezer);
324 MTH bool _save_header (const char *path);
287 325
288 maptile (); 326 maptile ();
327 maptile (int w, int h);
289 ~maptile (); 328 ~maptile ();
329
290 void do_destroy (); 330 void do_destroy ();
291 void gather_callbacks (AV *&callbacks, event_type event) const; 331 void gather_callbacks (AV *&callbacks, event_type event) const;
292 332
293 MTH void allocate ();
294 MTH int size () const { return width * height; } 333 MTH int size () const { return width * height; }
295 334
296 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 335 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
297 336
337 MTH void touch () { last_access = runtime; }
338
339 // find the map that is at coordinate x|y relative to this map
340 // TODO: need a better way than passing by reference
341 // TODO: make perl interface
342 maptile *xy_find (sint16 &x, sint16 &y);
343
344 // like xy_find, but also loads the map
345 maptile *xy_load (sint16 &x, sint16 &y);
346
347 void do_load_sync ();//PERL
348
349 // make sure the map is loaded
298 MTH void link (); 350 MTH void load_sync ()
299 MTH void unlink (); 351 {
352 if (!spaces)
353 do_load_sync ();
354 }
355
356 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
357 bool generate_random_map (random_map_params *RP);
358
359 static maptile *find_async (const char *path, maptile *original = 0);//PERL
360 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
361 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
362 MTH object *pick_random_object () const;
300 363
301 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 364 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
302 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } 365 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
303}; 366};
304
305#define for_all_maps(var) for (maptile *var = first_map; var; var = var->next)
306 367
307/* This is used by get_rangevector to determine where the other 368/* This is used by get_rangevector to determine where the other
308 * creature is. get_rangevector takes into account map tiling, 369 * creature is. get_rangevector takes into account map tiling,
309 * so you just can not look the the map coordinates and get the 370 * so you just can not look the the map coordinates and get the
310 * righte value. distance_x/y are distance away, which 371 * righte value. distance_x/y are distance away, which
320 int distance_y; 381 int distance_y;
321 int direction; 382 int direction;
322 object *part; 383 object *part;
323}; 384};
324 385
386//TODO: these should be refactored into things like xy_normalise
387// and so on.
388int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
389int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
390int out_of_map (maptile *m, int x, int y);
391maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
392void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
393void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
394int on_same_map (const object *op1, const object *op2);
395int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
396
397// adjust map, x and y for tiled maps and return true if the position is valid at all
398inline bool
399xy_normalise (maptile *&map, sint16 &x, sint16 &y)
400{
401 // when in range, do a quick return, otherwise go the slow route
402 return
403 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
404 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
405}
406
325inline mapspace & 407inline mapspace &
326object::ms () const 408object::ms () const
327{ 409{
328 return map->at (x, y); 410 return map->at (x, y);
329} 411}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines