| 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 | */ |
| … | |
… | |
| 46 | #define MAGIC_MAP_SIZE 50 |
47 | #define MAGIC_MAP_SIZE 50 |
| 47 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
48 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
| 48 | |
49 | |
| 49 | #define MAP_LAYERS 3 |
50 | #define MAP_LAYERS 3 |
| 50 | |
51 | |
| 51 | /* options passed to ready_map_name and load_original_map */ |
|
|
| 52 | #define MAP_FLUSH 0x01 |
|
|
| 53 | #define MAP_PLAYER_UNIQUE 0x02 |
|
|
| 54 | #define MAP_BLOCK 0x04 |
|
|
| 55 | #define MAP_STYLE 0x08 |
|
|
| 56 | #define MAP_OVERLAY 0x10 |
|
|
| 57 | |
|
|
| 58 | /* Values for in_memory below. Should probably be an enumerations */ |
52 | /* Values for in_memory below. Should probably be an enumerations */ |
| 59 | #define MAP_IN_MEMORY 1 |
53 | enum { |
| 60 | #define MAP_SWAPPED 2 |
54 | MAP_IN_MEMORY, |
| 61 | #define MAP_LOADING 3 |
55 | MAP_SWAPPED, |
| 62 | #define MAP_SAVING 4 |
56 | MAP_LOADING, |
|
|
57 | MAP_SAVING, |
|
|
58 | }; |
| 63 | |
59 | |
| 64 | /* 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 |
| 65 | * 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 |
| 66 | * 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 |
| 67 | * consistent (eg, op->map, op->x, op->y) |
63 | * consistent (eg, op->map, op->x, op->y) |
| … | |
… | |
| 80 | |
76 | |
| 81 | /* You should really know what you are doing before using this - you |
77 | /* You should really know what you are doing before using this - you |
| 82 | * should almost always be using out_of_map instead, which takes into account |
78 | * should almost always be using out_of_map instead, which takes into account |
| 83 | * map tiling. |
79 | * map tiling. |
| 84 | */ |
80 | */ |
| 85 | #define OUT_OF_REAL_MAP(M,X,Y) ((X)<0 || (Y)<0 || (X)>=(M)->width || (Y)>=(M)->height) |
81 | #define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height))) |
| 86 | |
82 | |
| 87 | /* These are used in the MapLook flags element. They are not used in |
83 | /* These are used in the MapLook flags element. They are not used in |
| 88 | * in the object flags structure. |
84 | * in the object flags structure. |
| 89 | */ |
85 | */ |
| 90 | #define P_BLOCKSVIEW 0x01 |
86 | #define P_BLOCKSVIEW 0x01 |
| … | |
… | |
| 96 | * this was introduced to make shops safer |
92 | * this was introduced to make shops safer |
| 97 | * but is useful in other situations */ |
93 | * but is useful in other situations */ |
| 98 | #define P_IS_ALIVE 0x10 /* something alive is on this space */ |
94 | #define P_IS_ALIVE 0x10 /* something alive is on this space */ |
| 99 | #define P_NO_CLERIC 0x20 /* no clerical spells cast here */ |
95 | #define P_NO_CLERIC 0x20 /* no clerical spells cast here */ |
| 100 | |
96 | |
| 101 | #define P_NEED_UPDATE 0x80 /* this space is out of date */ |
97 | #define P_UPTODATE 0x80 /* this space is up to date */ |
| 102 | |
98 | |
| 103 | /* The following two values are not stored in the MapLook flags, but instead |
99 | /* The following two values are not stored in the MapLook flags, but instead |
| 104 | * used in the get_map_flags value - that function is used to return |
100 | * used in the get_map_flags value - that function is used to return |
| 105 | * the flag value, as well as other conditions - using a more general |
101 | * the flag value, as well as other conditions - using a more general |
| 106 | * function that does more of the work can hopefully be used to replace |
102 | * function that does more of the work can hopefully be used to replace |
| … | |
… | |
| 122 | * to extend information about a space. |
118 | * to extend information about a space. |
| 123 | */ |
119 | */ |
| 124 | struct mapspace |
120 | struct mapspace |
| 125 | { |
121 | { |
| 126 | object *bot, *top; /* lowest/highest object on this space */ |
122 | object *bot, *top; /* lowest/highest object on this space */ |
| 127 | New_Face *faces[MAP_LAYERS]; /* faces for the 3 layers */ |
123 | facetile *faces[MAP_LAYERS]; /* faces for the 3 layers */ |
| 128 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
124 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
| 129 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
125 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
| 130 | sint8 light; /* How much light this space provides */ |
126 | sint8 light; /* How much light this space provides */ |
| 131 | MoveType move_block; /* What movement types this space blocks */ |
127 | MoveType move_block; /* What movement types this space blocks */ |
| 132 | MoveType move_slow; /* What movement types this space slows */ |
128 | MoveType move_slow; /* What movement types this space slows */ |
| … | |
… | |
| 134 | MoveType move_off; /* What movement types are activated */ |
130 | MoveType move_off; /* What movement types are activated */ |
| 135 | |
131 | |
| 136 | void update_ (); |
132 | void update_ (); |
| 137 | void update () |
133 | void update () |
| 138 | { |
134 | { |
| 139 | if (flags_ & P_NEED_UPDATE) |
135 | if (!(flags_ & P_UPTODATE)) |
| 140 | update_ (); |
136 | update_ (); |
| 141 | } |
137 | } |
| 142 | |
138 | |
| 143 | uint8 flags () |
139 | uint8 flags () |
| 144 | { |
140 | { |
| … | |
… | |
| 166 | * they have to appear here in the headers, before the mapdef |
162 | * they have to appear here in the headers, before the mapdef |
| 167 | */ |
163 | */ |
| 168 | INTERFACE_CLASS (region) |
164 | INTERFACE_CLASS (region) |
| 169 | struct region : zero_initialised |
165 | struct region : zero_initialised |
| 170 | { |
166 | { |
| 171 | struct region *ACC (RW, next); /* pointer to next region, NULL for the last one */ |
167 | region *ACC (RW, next); /* pointer to next region, NULL for the last one */ |
| 172 | char *ACC (RW, 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 */ |
| 173 | char *ACC (RW, parent_name); /* |
169 | shstr ACC (RW, parent_name); /* |
| 174 | * So that parent and child regions can be defined in |
170 | * So that parent and child regions can be defined in |
| 175 | * any order, we keep hold of the parent_name during |
171 | * any order, we keep hold of the parent_name during |
| 176 | * initialisation, and the children get assigned to their |
172 | * initialisation, and the children get assigned to their |
| 177 | * parents later. (before runtime on the server though) |
173 | * parents later. (before runtime on the server though) |
| 178 | * nothing outside the init code should ever use this value. |
174 | * nothing outside the init code should ever use this value. |
| 179 | */ |
175 | */ |
| 180 | struct region *ACC (RW, parent); /* |
176 | region *ACC (RW, parent); /* |
| 181 | * Pointer to the region that is a parent of the current |
177 | * Pointer to the region that is a parent of the current |
| 182 | * region, if a value isn't defined in the current region |
178 | * region, if a value isn't defined in the current region |
| 183 | * we traverse this series of pointers until it is. |
179 | * we traverse this series of pointers until it is. |
| 184 | */ |
180 | */ |
| 185 | char *ACC (RW, longname); /* Official title of the region, this might be defined |
181 | char *ACC (RW, longname); /* Official title of the region, this might be defined |
| 186 | * to be the same as name*/ |
182 | * to be the same as name*/ |
| 187 | char *ACC (RW, msg); /* the description of the region */ |
183 | shstr ACC (RW, msg); /* the description of the region */ |
| 188 | uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */ |
184 | uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */ |
| 189 | sint8 ACC (RW, fallback); /* whether, in the event of a region not existing, |
185 | sint8 ACC (RW, fallback); /* whether, in the event of a region not existing, |
| 190 | * this should be the one we fall back on as the default */ |
186 | * this should be the one we fall back on as the default */ |
| 191 | char *ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */ |
187 | shstr ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */ |
| 192 | sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */ |
188 | sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */ |
|
|
189 | |
|
|
190 | static region *default_region (); |
|
|
191 | static region *find (const char *name); |
|
|
192 | static region *find_fuzzy (const char *name); |
| 193 | }; |
193 | }; |
| 194 | |
194 | |
| 195 | struct shopitems : zero_initialised |
195 | struct shopitems : zero_initialised |
| 196 | { |
196 | { |
| 197 | const char *name; /* name of the item in question, null if it is the default item */ |
197 | const char *name; /* name of the item in question, null if it is the default item */ |
| … | |
… | |
| 220 | INTERFACE_CLASS (maptile) |
220 | INTERFACE_CLASS (maptile) |
| 221 | struct maptile : zero_initialised, attachable |
221 | struct maptile : zero_initialised, attachable |
| 222 | { |
222 | { |
| 223 | sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ |
223 | sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ |
| 224 | struct mapspace *spaces; /* Array of spaces on this map */ |
224 | struct mapspace *spaces; /* Array of spaces on this map */ |
|
|
225 | uint8 *regions; /* region index per mapspace, if != 0 */ |
|
|
226 | struct region **regionmap; /* index to region */ |
| 225 | |
227 | |
| 226 | tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ |
228 | tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ |
| 227 | |
229 | |
| 228 | shstr ACC (RW, name); /* Name of map as given by its creator */ |
230 | shstr ACC (RW, name); /* Name of map as given by its creator */ |
| 229 | struct region *ACC (RW, region); /* What jurisdiction in the game world this map is ruled by |
231 | struct region *ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by |
| 230 | * points to the struct containing all the properties of |
232 | * points to the struct containing all the properties of |
| 231 | * the region */ |
233 | * the region */ |
| 232 | double ACC (RW, reset_time); |
234 | double ACC (RW, reset_time); |
| 233 | uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map |
235 | uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map |
| 234 | * should be reset |
236 | * should be reset |
| 235 | */ |
237 | */ |
|
|
238 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
| 236 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
239 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
| 237 | * players entering/exiting map |
240 | * players entering/exiting map |
| 238 | */ |
241 | */ |
| 239 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
242 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
| 240 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
243 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
| … | |
… | |
| 245 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
248 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
| 246 | |
249 | |
| 247 | bool ACC (RW, per_player); |
250 | bool ACC (RW, per_player); |
| 248 | bool ACC (RW, per_party); |
251 | bool ACC (RW, per_party); |
| 249 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
252 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
|
|
253 | bool ACC (RW, nodrop); /* avoid dropping anything on this map */ |
| 250 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
254 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
| 251 | |
255 | |
| 252 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
256 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
| 253 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
257 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
| 254 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
258 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
| … | |
… | |
| 284 | MTH int change_map_light (int change); |
288 | MTH int change_map_light (int change); |
| 285 | static void change_all_map_light (int change); //PERL |
289 | static void change_all_map_light (int change); //PERL |
| 286 | MTH void set_darkness_map (); |
290 | MTH void set_darkness_map (); |
| 287 | MTH int estimate_difficulty () const; |
291 | MTH int estimate_difficulty () const; |
| 288 | |
292 | |
|
|
293 | // set the given flag on all objects in the map |
|
|
294 | MTH void set_object_flag (int flag, int value = 1); |
|
|
295 | |
| 289 | MTH void link_multipart_objects (); |
296 | MTH void link_multipart_objects (); |
| 290 | MTH void clear_unique_items (); |
297 | MTH void clear_unique_items (); |
| 291 | |
298 | |
| 292 | MTH void clear_header (); |
299 | MTH void clear_header (); |
| 293 | MTH void clear_links_to (maptile *m); |
300 | MTH void clear_links_to (maptile *m); |
| 294 | |
301 | |
|
|
302 | MTH struct region *region (int x, int y) const; |
|
|
303 | |
| 295 | // loas the header pseudo-object |
304 | // loas the header pseudo-object |
| 296 | bool load_header (object_thawer &thawer); |
305 | bool _load_header (object_thawer &thawer); |
| 297 | MTH bool load_header (const char *path); |
306 | MTH bool _load_header (const char *path); |
| 298 | |
307 | |
| 299 | // load objects into the map |
308 | // load objects into the map |
| 300 | bool load_objects (object_thawer &thawer); |
309 | bool _load_objects (object_thawer &thawer); |
| 301 | MTH bool load_objects (const char *path, bool skip_header = true); |
310 | MTH bool _load_objects (const char *path, bool skip_header = true); |
| 302 | |
311 | |
| 303 | // save objects into the given file (uses IO_ flags) |
312 | // save objects into the given file (uses IO_ flags) |
| 304 | bool save_objects (object_freezer &freezer, int flags); |
313 | bool _save_objects (object_freezer &freezer, int flags); |
| 305 | MTH bool save_objects (const char *path, int flags); |
314 | MTH bool _save_objects (const char *path, int flags); |
| 306 | |
315 | |
| 307 | // save the header pseudo object _only_ |
316 | // save the header pseudo object _only_ |
| 308 | bool save_header (object_freezer &freezer); |
317 | bool _save_header (object_freezer &freezer); |
| 309 | MTH bool save_header (const char *path); |
318 | MTH bool _save_header (const char *path); |
| 310 | |
319 | |
| 311 | maptile (); |
320 | maptile (); |
| 312 | maptile (int w, int h); |
321 | maptile (int w, int h); |
| 313 | ~maptile (); |
322 | ~maptile (); |
| 314 | |
323 | |
| … | |
… | |
| 317 | |
326 | |
| 318 | MTH int size () const { return width * height; } |
327 | MTH int size () const { return width * height; } |
| 319 | |
328 | |
| 320 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
329 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
| 321 | |
330 | |
| 322 | // static maptile *find_map (const char *path, maptile *origin);//PERL |
331 | MTH void touch () { last_access = runtime; } |
| 323 | // |
332 | |
| 324 | // // load a map relative to this one |
333 | // find the map that is at coordinate x|y relative to this map |
| 325 | // maptile *find_map (const char *path) |
334 | // TODO: need a better way than passing by reference |
| 326 | // { |
335 | // TODO: make perl interface |
| 327 | // return find_map (path, this); |
336 | maptile *xy_find (sint16 &x, sint16 &y); |
| 328 | // } |
337 | |
| 329 | // |
338 | // like xy_find, but also loads the map |
| 330 | // // customise this map for the given player |
339 | maptile *xy_load (sint16 &x, sint16 &y); |
| 331 | // // might return this or a completely new map |
340 | |
| 332 | // maptile *customise_for (object *op); |
|
|
| 333 | // |
|
|
| 334 | // void do_force_map_sync ();//PERL |
341 | void do_load_sync ();//PERL |
| 335 | // |
342 | |
| 336 | // // make sure the map is loaded |
343 | // make sure the map is loaded |
| 337 | // MTH void force_map_sync () |
344 | MTH void load_sync () |
| 338 | // { |
345 | { |
| 339 | // if (in_memory != MAP_IN_MEMORY) |
346 | if (!spaces) |
| 340 | // do_force_map_sync (); |
347 | do_load_sync (); |
| 341 | // } |
348 | } |
| 342 | |
349 | |
|
|
350 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
|
|
351 | bool generate_random_map (random_map_params *RP); |
|
|
352 | |
|
|
353 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
|
|
354 | // async prefetch |
| 343 | static maptile *load_map_sync (const char *path, maptile *original = 0);//PERL |
355 | static maptile *find_async (const char *path, maptile *original = 0);//PERL |
| 344 | static void emergency_save ();//PERL |
|
|
| 345 | |
356 | |
| 346 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
357 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
| 347 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
358 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
| 348 | }; |
359 | }; |
| 349 | |
360 | |
| … | |
… | |
| 363 | int distance_y; |
374 | int distance_y; |
| 364 | int direction; |
375 | int direction; |
| 365 | object *part; |
376 | object *part; |
| 366 | }; |
377 | }; |
| 367 | |
378 | |
|
|
379 | //TODO: these should be refactored into things like xy_normalise |
|
|
380 | // and so on. |
|
|
381 | int get_map_flags(maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
|
|
382 | int ob_blocked(const object *ob, maptile *m, sint16 x, sint16 y); |
|
|
383 | int out_of_map(maptile *m, int x, int y); |
|
|
384 | maptile *get_map_from_coord(maptile *m, sint16 *x, sint16 *y); |
|
|
385 | void get_rangevector(object *op1, object *op2, rv_vector *retval, int flags); |
|
|
386 | void get_rangevector_from_mapcoord(const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
|
|
387 | int on_same_map(const object *op1, const object *op2); |
|
|
388 | |
|
|
389 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
|
|
390 | inline bool |
|
|
391 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
|
|
392 | { |
|
|
393 | // when in range, do a quick return, otherwise go the slow route |
|
|
394 | return |
|
|
395 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
|
|
396 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
|
|
397 | } |
|
|
398 | |
| 368 | inline mapspace & |
399 | inline mapspace & |
| 369 | object::ms () const |
400 | object::ms () const |
| 370 | { |
401 | { |
| 371 | return map->at (x, y); |
402 | return map->at (x, y); |
| 372 | } |
403 | } |
