1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * 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 |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
19 | * along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at crossfire@schmorp.de |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* |
24 | /* |
26 | * The maptile is allocated each time a new map is opened. |
25 | * The maptile is allocated each time a new map is opened. |
27 | * It contains pointers (very indirectly) to all objects on the map. |
26 | * It contains pointers (very indirectly) to all objects on the map. |
… | |
… | |
30 | #ifndef MAP_H |
29 | #ifndef MAP_H |
31 | #define MAP_H |
30 | #define MAP_H |
32 | |
31 | |
33 | #include <tr1/unordered_map> |
32 | #include <tr1/unordered_map> |
34 | |
33 | |
|
|
34 | #include "region.h" |
35 | #include "cfperl.h" |
35 | #include "cfperl.h" |
36 | |
36 | |
37 | /* 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 |
38 | * tiled maps. There is no requirement that this matches the |
38 | * tiled maps. There is no requirement that this matches the |
39 | * tiled maps size - it just seemed like a reasonable value. |
39 | * tiled maps size - it just seemed like a reasonable value. |
… | |
… | |
47 | #define MAGIC_MAP_SIZE 50 |
47 | #define MAGIC_MAP_SIZE 50 |
48 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
48 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
49 | |
49 | |
50 | #define MAP_LAYERS 3 |
50 | #define MAP_LAYERS 3 |
51 | |
51 | |
52 | /* Values for in_memory below. Should probably be an enumerations */ |
52 | /* Values for in_memory below */ |
53 | enum { |
53 | enum { |
54 | MAP_IN_MEMORY, |
54 | MAP_ACTIVE, |
|
|
55 | MAP_INACTIVE, // not used atm. |
55 | MAP_SWAPPED, |
56 | MAP_SWAPPED, |
56 | MAP_LOADING, |
57 | MAP_LOADING, |
57 | MAP_SAVING, |
58 | MAP_SAVING, |
58 | }; |
59 | }; |
59 | |
60 | |
… | |
… | |
103 | */ |
104 | */ |
104 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
105 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
105 | #define P_NEW_MAP 0x20000 |
106 | #define P_NEW_MAP 0x20000 |
106 | /* Coordinates passed result in a new tiled map */ |
107 | /* Coordinates passed result in a new tiled map */ |
107 | |
108 | |
108 | /* P_NO_PASS is used for ob_blocked() return value. It needs |
|
|
109 | * to be here to make sure the bits don't match with anything. |
|
|
110 | */ |
|
|
111 | #define P_NO_PASS 0x80000 |
|
|
112 | |
|
|
113 | /* Instead of having numerous arrays that have information on a |
109 | /* Instead of having numerous arrays that have information on a |
114 | * particular space (was map, floor, floor2, map_ob), |
110 | * particular space (was map, floor, floor2, map_ob), |
115 | * have this structure take care of that information. |
111 | * have this structure take care of that information. |
116 | * This puts it all in one place, and should also make it easier |
112 | * This puts it all in one place, and should also make it easier |
117 | * to extend information about a space. |
113 | * to extend information about a space. |
118 | */ |
114 | */ |
|
|
115 | INTERFACE_CLASS (mapspace) |
119 | struct mapspace |
116 | struct mapspace |
120 | { |
117 | { |
|
|
118 | object *ACC (RW, bot); |
121 | object *bot, *top; /* lowest/highest object on this space */ |
119 | object *ACC (RW, top); /* lowest/highest object on this space */ |
122 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
120 | object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ |
123 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
121 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
124 | sint8 light; /* How much light this space provides */ |
122 | sint8 ACC (RW, light); /* How much light this space provides */ |
125 | MoveType move_block; /* What movement types this space blocks */ |
123 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
126 | MoveType move_slow; /* What movement types this space slows */ |
124 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
127 | MoveType move_on; /* What movement types are activated */ |
125 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
128 | MoveType move_off; /* What movement types are activated */ |
126 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
129 | |
127 | |
130 | void update_ (); |
128 | void update_ (); |
131 | void update () |
129 | MTH void update () |
132 | { |
130 | { |
133 | if (!(flags_ & P_UPTODATE)) |
131 | if (!(flags_ & P_UPTODATE)) |
134 | update_ (); |
132 | update_ (); |
135 | } |
133 | } |
136 | |
134 | |
137 | uint8 flags () |
135 | MTH uint8 flags () |
138 | { |
136 | { |
139 | update (); |
137 | update (); |
140 | return flags_; |
138 | return flags_; |
141 | } |
139 | } |
142 | |
140 | |
143 | // maybe only inline quick flags_ checking? |
|
|
144 | object *player () |
141 | MTH object *player () |
145 | { |
142 | { |
146 | // search from the top, because players are usually on top |
143 | object *op; |
147 | // make usually == always and this non-amortized O(1) |
144 | |
148 | // could gte rid of P_PLAYER, too, then |
|
|
149 | if (flags () & P_PLAYER) |
145 | if (flags () & P_PLAYER) |
150 | for (object *op = top; op; op = op->below) |
146 | for (op = top; op->type != PLAYER; op = op->below) |
151 | if (op->type == PLAYER) |
147 | ; |
152 | return op; |
148 | else |
|
|
149 | op = 0; |
153 | |
150 | |
154 | return 0; |
151 | return op; |
155 | } |
152 | } |
156 | |
153 | |
157 | // return the item volume on this mapspace in cm³ |
154 | // return the item volume on this mapspace in cm³ |
158 | uint64 volume () const; |
155 | MTH uint64 volume () const; |
|
|
156 | |
|
|
157 | bool blocks (MoveType mt) const |
|
|
158 | { |
|
|
159 | return move_block && (mt & move_block) == mt; |
|
|
160 | } |
|
|
161 | |
|
|
162 | bool blocks (object *op) const |
|
|
163 | { |
|
|
164 | return blocks (op->move_type); |
|
|
165 | } |
159 | }; |
166 | }; |
160 | |
167 | |
161 | struct shopitems : zero_initialised |
168 | struct shopitems : zero_initialised |
162 | { |
169 | { |
163 | const char *name; /* name of the item in question, null if it is the default item */ |
170 | const char *name; /* name of the item in question, null if it is the default item */ |
… | |
… | |
187 | struct maptile : zero_initialised, attachable |
194 | struct maptile : zero_initialised, attachable |
188 | { |
195 | { |
189 | sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ |
196 | sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ |
190 | struct mapspace *spaces; /* Array of spaces on this map */ |
197 | struct mapspace *spaces; /* Array of spaces on this map */ |
191 | uint8 *regions; /* region index per mapspace, if != 0 */ |
198 | uint8 *regions; /* region index per mapspace, if != 0 */ |
192 | struct region **regionmap; /* index to region */ |
199 | region_ptr *regionmap; /* index to region */ |
193 | |
200 | |
194 | tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ |
201 | tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ |
195 | |
202 | |
196 | shstr ACC (RW, name); /* Name of map as given by its creator */ |
203 | shstr ACC (RW, name); /* Name of map as given by its creator */ |
197 | struct region *ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by |
204 | region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by |
198 | * points to the struct containing all the properties of |
205 | * points to the struct containing all the properties of |
199 | * the region */ |
206 | * the region */ |
200 | double ACC (RW, reset_time); |
207 | double ACC (RW, reset_time); |
201 | uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map |
208 | uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map |
202 | * should be reset |
209 | * should be reset |
203 | */ |
210 | */ |
204 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
211 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
|
|
212 | bool ACC (RW, no_reset); // must not reset this map |
205 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
213 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
206 | * players entering/exiting map |
214 | * players entering/exiting map |
207 | */ |
215 | */ |
208 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
216 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
209 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
217 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
… | |
… | |
214 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
222 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
215 | |
223 | |
216 | bool ACC (RW, per_player); |
224 | bool ACC (RW, per_player); |
217 | bool ACC (RW, per_party); |
225 | bool ACC (RW, per_party); |
218 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
226 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
219 | bool ACC (RW, nodrop); /* avoid dropping anything on this map */ |
227 | bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */ |
220 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
228 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
221 | |
229 | |
222 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
230 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
223 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
231 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
224 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
232 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
… | |
… | |
249 | MTH void alloc (); |
257 | MTH void alloc (); |
250 | // deallocates the mapspaces (and destroys all objects) |
258 | // deallocates the mapspaces (and destroys all objects) |
251 | MTH void clear (); |
259 | MTH void clear (); |
252 | |
260 | |
253 | MTH void fix_auto_apply (); |
261 | MTH void fix_auto_apply (); |
254 | MTH void decay_objects (); |
262 | MTH void do_decay_objects (); |
255 | MTH void update_buttons (); |
263 | MTH void update_buttons (); |
256 | MTH int change_map_light (int change); |
264 | MTH int change_map_light (int change); |
257 | static void change_all_map_light (int change); //PERL |
265 | static void change_all_map_light (int change); //PERL |
258 | MTH void set_darkness_map (); |
266 | MTH void set_darkness_map (); |
259 | MTH int estimate_difficulty () const; |
267 | MTH int estimate_difficulty () const; |
260 | |
268 | |
|
|
269 | MTH void play_sound (faceidx sound, int x, int y) const; |
|
|
270 | |
261 | // set the given flag on all objects in the map |
271 | // set the given flag on all objects in the map |
262 | MTH void set_object_flag (int flag, int value = 1); |
272 | MTH void set_object_flag (int flag, int value = 1); |
|
|
273 | MTH void post_load_original (); |
263 | |
274 | |
264 | MTH void link_multipart_objects (); |
275 | MTH void link_multipart_objects (); |
265 | MTH void clear_unique_items (); |
276 | MTH void clear_unique_items (); |
266 | |
277 | |
267 | MTH void clear_header (); |
278 | MTH void clear_header (); |
268 | MTH void clear_links_to (maptile *m); |
279 | MTH void clear_links_to (maptile *m); |
269 | |
280 | |
270 | MTH struct region *region (int x, int y) const; |
281 | MTH struct region *region (int x, int y) const; |
271 | |
282 | |
272 | // loas the header pseudo-object |
283 | // load the header pseudo-object |
273 | bool _load_header (object_thawer &thawer); |
284 | bool _load_header (object_thawer &thawer); |
274 | MTH bool _load_header (const char *path); |
285 | MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); } |
275 | |
286 | |
276 | // load objects into the map |
287 | // load objects into the map |
277 | bool _load_objects (object_thawer &thawer); |
288 | bool _load_objects (object_thawer &thawer); |
278 | MTH bool _load_objects (const char *path, bool skip_header = true); |
289 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
279 | |
290 | |
280 | // save objects into the given file (uses IO_ flags) |
291 | // save objects into the given file (uses IO_ flags) |
281 | bool _save_objects (object_freezer &freezer, int flags); |
292 | bool _save_objects (object_freezer &freezer, int flags); |
282 | MTH bool _save_objects (const char *path, int flags); |
293 | MTH bool _save_objects (const char *path, int flags); |
283 | |
294 | |
… | |
… | |
295 | MTH int size () const { return width * height; } |
306 | MTH int size () const { return width * height; } |
296 | |
307 | |
297 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
308 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
298 | |
309 | |
299 | MTH void touch () { last_access = runtime; } |
310 | MTH void touch () { last_access = runtime; } |
|
|
311 | |
|
|
312 | MTH bool tile_available (int dir, bool load = true); |
300 | |
313 | |
301 | // find the map that is at coordinate x|y relative to this map |
314 | // find the map that is at coordinate x|y relative to this map |
302 | // TODO: need a better way than passing by reference |
315 | // TODO: need a better way than passing by reference |
303 | // TODO: make perl interface |
316 | // TODO: make perl interface |
304 | maptile *xy_find (sint16 &x, sint16 &y); |
317 | maptile *xy_find (sint16 &x, sint16 &y); |
… | |
… | |
316 | } |
329 | } |
317 | |
330 | |
318 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
331 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
319 | bool generate_random_map (random_map_params *RP); |
332 | bool generate_random_map (random_map_params *RP); |
320 | |
333 | |
321 | static maptile *find_async (const char *path, maptile *original = 0);//PERL |
334 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
322 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
335 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
323 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
336 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
324 | MTH object *pick_random_object () const; |
337 | object *pick_random_object (rand_gen &gen = rndm) const; |
325 | |
338 | |
326 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
339 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
327 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
340 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
328 | }; |
341 | }; |
329 | |
342 | |
… | |
… | |
343 | int distance_y; |
356 | int distance_y; |
344 | int direction; |
357 | int direction; |
345 | object *part; |
358 | object *part; |
346 | }; |
359 | }; |
347 | |
360 | |
|
|
361 | // comaptibility cruft start |
348 | //TODO: these should be refactored into things like xy_normalise |
362 | //TODO: these should be refactored into things like xy_normalise |
349 | // and so on. |
363 | // and so on. |
350 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
364 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
351 | int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y); |
|
|
352 | int out_of_map (maptile *m, int x, int y); |
365 | int out_of_map (maptile *m, int x, int y); |
353 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
366 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
354 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
367 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
355 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
368 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
356 | int on_same_map (const object *op1, const object *op2); |
369 | int on_same_map (const object *op1, const object *op2); |
357 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
370 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
358 | |
371 | |
359 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
372 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
360 | inline bool |
373 | static inline bool |
361 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
374 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
362 | { |
375 | { |
363 | // when in range, do a quick return, otherwise go the slow route |
376 | // when in range, do a quick return, otherwise go the slow route |
364 | return |
377 | return |
365 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
378 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
366 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
379 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
367 | } |
380 | } |
|
|
381 | // comaptibility cruft end |
368 | |
382 | |
369 | inline mapspace & |
383 | inline mapspace & |
370 | object::ms () const |
384 | object::ms () const |
371 | { |
385 | { |
372 | return map->at (x, y); |
386 | return map->at (x, y); |
373 | } |
387 | } |
374 | |
388 | |
|
|
389 | struct mapxy { |
|
|
390 | maptile *m; |
|
|
391 | sint16 x, y; |
|
|
392 | |
|
|
393 | mapxy (maptile *m, sint16 x, sint16 y) |
|
|
394 | : m(m), x(x), y(y) |
|
|
395 | { } |
|
|
396 | |
|
|
397 | mapxy (object *op) |
|
|
398 | : m(op->map), x(op->x), y(op->y) |
|
|
399 | { } |
|
|
400 | |
|
|
401 | mapxy &move (int dx, int dy) |
|
|
402 | { |
|
|
403 | x += dx; |
|
|
404 | y += dy; |
|
|
405 | |
|
|
406 | return *this; |
|
|
407 | } |
|
|
408 | |
|
|
409 | mapxy &move (int dir) |
|
|
410 | { |
|
|
411 | return move (freearr_x [dir], freearr_y [dir]); |
|
|
412 | } |
|
|
413 | |
|
|
414 | operator void *() const { return (void *)m; } |
|
|
415 | mapxy &operator =(const object *op) |
|
|
416 | { |
|
|
417 | m = op->map; |
|
|
418 | x = op->x; |
|
|
419 | y = op->y; |
|
|
420 | |
|
|
421 | return *this; |
|
|
422 | } |
|
|
423 | |
|
|
424 | mapspace *operator ->() const { return &m->at (x, y); } |
|
|
425 | mapspace &operator * () const { return m->at (x, y); } |
|
|
426 | |
|
|
427 | bool normalise () |
|
|
428 | { |
|
|
429 | return xy_normalise (m, x, y); |
|
|
430 | } |
|
|
431 | |
|
|
432 | mapspace &ms () const |
|
|
433 | { |
|
|
434 | return m->at (x, y); |
|
|
435 | } |
|
|
436 | |
|
|
437 | object *insert (object *op, object *originator = 0, int flags = 0) const |
|
|
438 | { |
|
|
439 | return m->insert (op, x, y, originator, flags); |
|
|
440 | } |
|
|
441 | }; |
|
|
442 | |
|
|
443 | inline const mapxy & |
|
|
444 | object::operator =(const mapxy &pos) |
|
|
445 | { |
|
|
446 | map = pos.m; |
|
|
447 | x = pos.x; |
|
|
448 | y = pos.y; |
|
|
449 | |
|
|
450 | return pos; |
|
|
451 | } |
|
|
452 | |
375 | #endif |
453 | #endif |
376 | |
454 | |