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 | */ |
… | |
… | |
45 | */ |
46 | */ |
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 | /* 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 | |
51 | |
58 | /* Values for in_memory below. Should probably be an enumerations */ |
52 | /* Values for in_memory below. Should probably be an enumerations */ |
59 | enum { |
53 | enum { |
60 | MAP_IN_MEMORY, |
54 | MAP_IN_MEMORY, |
61 | MAP_SWAPPED, |
55 | MAP_SWAPPED, |
… | |
… | |
82 | |
76 | |
83 | /* 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 |
84 | * 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 |
85 | * map tiling. |
79 | * map tiling. |
86 | */ |
80 | */ |
87 | #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))) |
88 | |
82 | |
89 | /* 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 |
90 | * in the object flags structure. |
84 | * in the object flags structure. |
91 | */ |
85 | */ |
92 | #define P_BLOCKSVIEW 0x01 |
86 | #define P_BLOCKSVIEW 0x01 |
… | |
… | |
124 | * to extend information about a space. |
118 | * to extend information about a space. |
125 | */ |
119 | */ |
126 | struct mapspace |
120 | struct mapspace |
127 | { |
121 | { |
128 | object *bot, *top; /* lowest/highest object on this space */ |
122 | object *bot, *top; /* lowest/highest object on this space */ |
129 | New_Face *faces[MAP_LAYERS]; /* faces for the 3 layers */ |
123 | facetile *faces[MAP_LAYERS]; /* faces for the 3 layers */ |
130 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
124 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
131 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
125 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
132 | sint8 light; /* How much light this space provides */ |
126 | sint8 light; /* How much light this space provides */ |
133 | MoveType move_block; /* What movement types this space blocks */ |
127 | MoveType move_block; /* What movement types this space blocks */ |
134 | MoveType move_slow; /* What movement types this space slows */ |
128 | MoveType move_slow; /* What movement types this space slows */ |
… | |
… | |
159 | if (op->type == PLAYER) |
153 | if (op->type == PLAYER) |
160 | return op; |
154 | return op; |
161 | |
155 | |
162 | return 0; |
156 | return 0; |
163 | } |
157 | } |
|
|
158 | |
|
|
159 | // return the item volume on this mapspace in kg/m³ |
|
|
160 | uint64 volume (); |
164 | }; |
161 | }; |
165 | |
162 | |
166 | /* |
163 | /* |
167 | * Each map is in a given region of the game world and links to a region definiton, so |
164 | * Each map is in a given region of the game world and links to a region definiton, so |
168 | * they have to appear here in the headers, before the mapdef |
165 | * they have to appear here in the headers, before the mapdef |
169 | */ |
166 | */ |
170 | INTERFACE_CLASS (region) |
167 | INTERFACE_CLASS (region) |
171 | struct region : zero_initialised |
168 | struct region : zero_initialised |
172 | { |
169 | { |
173 | struct region *ACC (RW, next); /* pointer to next region, NULL for the last one */ |
|
|
174 | char *ACC (RW, name); /* Shortend name of the region as maps refer to it */ |
170 | shstr ACC (RW, name); /* Shortend name of the region as maps refer to it */ |
175 | char *ACC (RW, parent_name); /* |
|
|
176 | * So that parent and child regions can be defined in |
|
|
177 | * any order, we keep hold of the parent_name during |
|
|
178 | * initialisation, and the children get assigned to their |
|
|
179 | * parents later. (before runtime on the server though) |
|
|
180 | * nothing outside the init code should ever use this value. |
|
|
181 | */ |
|
|
182 | struct region *ACC (RW, parent); /* |
171 | region *ACC (RW, parent); /* |
183 | * Pointer to the region that is a parent of the current |
172 | * Pointer to the region that is a parent of the current |
184 | * region, if a value isn't defined in the current region |
173 | * region, if a value isn't defined in the current region |
185 | * we traverse this series of pointers until it is. |
174 | * we traverse this series of pointers until it is. |
186 | */ |
175 | */ |
187 | char *ACC (RW, longname); /* Official title of the region, this might be defined |
176 | shstr ACC (RW, longname); /* Official title of the region, this might be defined |
188 | * to be the same as name*/ |
177 | * to be the same as name*/ |
189 | char *ACC (RW, msg); /* the description of the region */ |
178 | shstr ACC (RW, msg); /* the description of the region */ |
|
|
179 | shstr ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */ |
|
|
180 | int ACC (RW, index); |
190 | uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */ |
181 | uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */ |
|
|
182 | sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */ |
191 | sint8 ACC (RW, fallback); /* whether, in the event of a region not existing, |
183 | bool ACC (RW, fallback); /* whether, in the event of a region not existing, |
192 | * this should be the one we fall back on as the default */ |
184 | * this should be the one we fall back on as the default */ |
193 | char *ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */ |
185 | |
194 | sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */ |
186 | static region *default_region (); |
|
|
187 | static region *find (const char *name); |
|
|
188 | static region *find_fuzzy (const char *name); |
195 | }; |
189 | }; |
|
|
190 | |
|
|
191 | typedef object_vector<region, ®ion::index> regionvec; |
|
|
192 | |
|
|
193 | extern regionvec regions; |
|
|
194 | |
|
|
195 | #define for_all_regions(var) \ |
|
|
196 | for (int _i = 0; _i < regions.size (); ++_i) \ |
|
|
197 | declvar (region *, var, regions [_i]) |
196 | |
198 | |
197 | struct shopitems : zero_initialised |
199 | struct shopitems : zero_initialised |
198 | { |
200 | { |
199 | 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 */ |
200 | const char *name_pl; /* plural name */ |
202 | const char *name_pl; /* plural name */ |
… | |
… | |
222 | INTERFACE_CLASS (maptile) |
224 | INTERFACE_CLASS (maptile) |
223 | struct maptile : zero_initialised, attachable |
225 | struct maptile : zero_initialised, attachable |
224 | { |
226 | { |
225 | sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ |
227 | sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ |
226 | 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 */ |
227 | |
231 | |
228 | tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ |
232 | tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ |
229 | |
233 | |
230 | shstr ACC (RW, name); /* Name of map as given by its creator */ |
234 | shstr ACC (RW, name); /* Name of map as given by its creator */ |
231 | 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 |
232 | * points to the struct containing all the properties of |
236 | * points to the struct containing all the properties of |
233 | * the region */ |
237 | * the region */ |
234 | double ACC (RW, reset_time); |
238 | double ACC (RW, reset_time); |
235 | 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 |
236 | * should be reset |
240 | * should be reset |
… | |
… | |
248 | 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 */ |
249 | |
253 | |
250 | bool ACC (RW, per_player); |
254 | bool ACC (RW, per_player); |
251 | bool ACC (RW, per_party); |
255 | bool ACC (RW, per_party); |
252 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
256 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
|
|
257 | bool ACC (RW, nodrop); /* avoid dropping anything on this map */ |
253 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
258 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
254 | |
259 | |
255 | 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 */ |
256 | 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 */ |
257 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
262 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
… | |
… | |
296 | MTH void clear_unique_items (); |
301 | MTH void clear_unique_items (); |
297 | |
302 | |
298 | MTH void clear_header (); |
303 | MTH void clear_header (); |
299 | MTH void clear_links_to (maptile *m); |
304 | MTH void clear_links_to (maptile *m); |
300 | |
305 | |
|
|
306 | MTH struct region *region (int x, int y) const; |
|
|
307 | |
301 | // loas the header pseudo-object |
308 | // loas the header pseudo-object |
302 | bool load_header (object_thawer &thawer); |
309 | bool _load_header (object_thawer &thawer); |
303 | MTH bool load_header (const char *path); |
310 | MTH bool _load_header (const char *path); |
304 | |
311 | |
305 | // load objects into the map |
312 | // load objects into the map |
306 | bool load_objects (object_thawer &thawer); |
313 | bool _load_objects (object_thawer &thawer); |
307 | MTH bool load_objects (const char *path, bool skip_header = true); |
314 | MTH bool _load_objects (const char *path, bool skip_header = true); |
308 | |
315 | |
309 | // save objects into the given file (uses IO_ flags) |
316 | // save objects into the given file (uses IO_ flags) |
310 | bool save_objects (object_freezer &freezer, int flags); |
317 | bool _save_objects (object_freezer &freezer, int flags); |
311 | MTH bool save_objects (const char *path, int flags); |
318 | MTH bool _save_objects (const char *path, int flags); |
312 | |
319 | |
313 | // save the header pseudo object _only_ |
320 | // save the header pseudo object _only_ |
314 | bool save_header (object_freezer &freezer); |
321 | bool _save_header (object_freezer &freezer); |
315 | MTH bool save_header (const char *path); |
322 | MTH bool _save_header (const char *path); |
316 | |
323 | |
317 | maptile (); |
324 | maptile (); |
318 | maptile (int w, int h); |
325 | maptile (int w, int h); |
319 | ~maptile (); |
326 | ~maptile (); |
320 | |
327 | |
… | |
… | |
342 | { |
349 | { |
343 | if (!spaces) |
350 | if (!spaces) |
344 | do_load_sync (); |
351 | do_load_sync (); |
345 | } |
352 | } |
346 | |
353 | |
|
|
354 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
|
|
355 | bool generate_random_map (random_map_params *RP); |
|
|
356 | |
347 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
357 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
348 | static void emergency_save ();//PERL |
358 | // async prefetch |
|
|
359 | static maptile *find_async (const char *path, maptile *original = 0);//PERL |
349 | |
360 | |
350 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
361 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
351 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
362 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
352 | }; |
363 | }; |
353 | |
364 | |
… | |
… | |
367 | int distance_y; |
378 | int distance_y; |
368 | int direction; |
379 | int direction; |
369 | object *part; |
380 | object *part; |
370 | }; |
381 | }; |
371 | |
382 | |
|
|
383 | //TODO: these should be refactored into things like xy_normalise |
|
|
384 | // and so on. |
|
|
385 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
|
|
386 | int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y); |
|
|
387 | int out_of_map (maptile *m, int x, int y); |
|
|
388 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
|
|
389 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
|
|
390 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
|
|
391 | int on_same_map (const object *op1, const object *op2); |
|
|
392 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
|
|
393 | |
|
|
394 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
|
|
395 | inline bool |
|
|
396 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
|
|
397 | { |
|
|
398 | // when in range, do a quick return, otherwise go the slow route |
|
|
399 | return |
|
|
400 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
|
|
401 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
|
|
402 | } |
|
|
403 | |
372 | inline mapspace & |
404 | inline mapspace & |
373 | object::ms () const |
405 | object::ms () const |
374 | { |
406 | { |
375 | return map->at (x, y); |
407 | return map->at (x, y); |
376 | } |
408 | } |