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.47 by root, Thu Jan 4 16:19:32 2007 UTC vs.
Revision 1.89 by root, Sun Sep 30 20:22:18 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
4 Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT 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 3 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, see <http://www.gnu.org/licenses/>.
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
20
21 The authors can be reached via e-mail at crossfire@schmorp.de 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
22*/ 22 */
23 23
24/* 24/*
25 * The maptile is allocated each time a new map is opened. 25 * The maptile is allocated each time a new map is opened.
26 * It contains pointers (very indirectly) to all objects on the map. 26 * It contains pointers (very indirectly) to all objects on the map.
27 */ 27 */
… …
29#ifndef MAP_H 29#ifndef MAP_H
30#define MAP_H 30#define MAP_H
31 31
32#include <tr1/unordered_map> 32#include <tr1/unordered_map>
33 33
34#include "region.h"
34#include "cfperl.h" 35#include "cfperl.h"
35 36
36/* 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
37 * tiled maps. There is no requirement that this matches the 38 * tiled maps. There is no requirement that this matches the
38 * tiled maps size - it just seemed like a reasonable value. 39 * tiled maps size - it just seemed like a reasonable value.
… …
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 */
59enum { 53enum {
60 MAP_IN_MEMORY, 54 MAP_IN_MEMORY,
61 MAP_SWAPPED, 55 MAP_SWAPPED,
62 MAP_LOADING, 56 MAP_LOADING,
… …
71// all those macros are herewith declared legacy 65// all those macros are herewith declared legacy
72#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 ()
73#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
74#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
75#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
76#define GET_MAP_FACE(M,X,Y,L) (M)->at((X),(Y)).faces[L]
77#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]
78#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
79#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
80#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
81#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
82 75
83/* 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
84 * 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
85 * map tiling. 78 * map tiling.
86 */ 79 */
87#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)))
88 81
89/* 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
90 * in the object flags structure. 83 * in the object flags structure.
91 */ 84 */
92#define P_BLOCKSVIEW 0x01 85#define P_BLOCKSVIEW 0x01
… …
110 */ 103 */
111#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ 104#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */
112#define P_NEW_MAP 0x20000 105#define P_NEW_MAP 0x20000
113 /* Coordinates passed result in a new tiled map */ 106 /* Coordinates passed result in a new tiled map */
114 107
115/* P_NO_PASS is used for ob_blocked() return value. It needs
116 * to be here to make sure the bits don't match with anything.
117 */
118#define P_NO_PASS 0x80000
119
120/* Instead of having numerous arrays that have information on a 108/* Instead of having numerous arrays that have information on a
121 * particular space (was map, floor, floor2, map_ob), 109 * particular space (was map, floor, floor2, map_ob),
122 * have this structure take care of that information. 110 * have this structure take care of that information.
123 * This puts it all in one place, and should also make it easier 111 * This puts it all in one place, and should also make it easier
124 * to extend information about a space. 112 * to extend information about a space.
125 */ 113 */
126struct mapspace 114struct mapspace
127{ 115{
128 object *bot, *top; /* lowest/highest object on this space */ 116 object *bot, *top; /* lowest/highest object on this space */
129 New_Face *faces[MAP_LAYERS]; /* faces for the 3 layers */
130 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ 117 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */
131 uint8 flags_; /* flags about this space (see the P_ values above) */ 118 uint8 flags_; /* flags about this space (see the P_ values above) */
132 sint8 light; /* How much light this space provides */ 119 sint8 light; /* How much light this space provides */
133 MoveType move_block; /* What movement types this space blocks */ 120 MoveType move_block; /* What movement types this space blocks */
134 MoveType move_slow; /* What movement types this space slows */ 121 MoveType move_slow; /* What movement types this space slows */
… …
159 if (op->type == PLAYER) 146 if (op->type == PLAYER)
160 return op; 147 return op;
161 148
162 return 0; 149 return 0;
163 } 150 }
164};
165 151
166/* 152 // return the item volume on this mapspace in cm³
167 * Each map is in a given region of the game world and links to a region definiton, so 153 uint64 volume () const;
168 * they have to appear here in the headers, before the mapdef 154
169 */ 155 bool blocks (MoveType mt) const
170INTERFACE_CLASS (region) 156 {
171struct region : zero_initialised 157 return move_block && (mt & move_block) == mt;
172{ 158 }
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 */
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); /*
183 * Pointer to the region that is a parent of the current
184 * region, if a value isn't defined in the current region
185 * we traverse this series of pointers until it is.
186 */
187 char *ACC (RW, longname); /* Official title of the region, this might be defined
188 * to be the same as name*/
189 char *ACC (RW, msg); /* the description of the region */
190 uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */
191 sint8 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 */
193 char *ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */
194 sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */
195}; 159};
196 160
197struct shopitems : zero_initialised 161struct shopitems : zero_initialised
198{ 162{
199 const char *name; /* name of the item in question, null if it is the default item */ 163 const char *name; /* name of the item in question, null if it is the default item */
… …
222INTERFACE_CLASS (maptile) 186INTERFACE_CLASS (maptile)
223struct maptile : zero_initialised, attachable 187struct maptile : zero_initialised, attachable
224{ 188{
225 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ 189 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
226 struct mapspace *spaces; /* Array of spaces on this map */ 190 struct mapspace *spaces; /* Array of spaces on this map */
191 uint8 *regions; /* region index per mapspace, if != 0 */
192 region_ptr *regionmap; /* index to region */
227 193
228 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ 194 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
229 195
230 shstr ACC (RW, name); /* Name of map as given by its creator */ 196 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 197 region_ptr 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 198 * points to the struct containing all the properties of
233 * the region */ 199 * the region */
234 double ACC (RW, reset_time); 200 double ACC (RW, reset_time);
235 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map 201 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
236 * should be reset 202 * should be reset
237 */ 203 */
238 bool ACC (RW, dirty); /* if true, something was inserted or removed */ 204 bool ACC (RW, dirty); /* if true, something was inserted or removed */
205 bool ACC (RW, no_reset); // must not reset this map
239 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by 206 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
240 * players entering/exiting map 207 * players entering/exiting map
241 */ 208 */
242 sint32 ACC (RW, timeout); /* swapout is set to this */ 209 sint32 ACC (RW, timeout); /* swapout is set to this */
243 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ 210 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
… …
248 uint16 ACC (RW, difficulty); /* What level the player should be to play here */ 215 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
249 216
250 bool ACC (RW, per_player); 217 bool ACC (RW, per_player);
251 bool ACC (RW, per_party); 218 bool ACC (RW, per_party);
252 bool ACC (RW, outdoor); /* True if an outdoor map */ 219 bool ACC (RW, outdoor); /* True if an outdoor map */
220 bool ACC (RW, nodrop); /* avoid dropping anything on this map */
253 uint8 ACC (RW, darkness); /* indicates level of darkness of map */ 221 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
254 222
255 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ 223 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 */ 224 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 */ 225 oblinkpt *buttons; /* Linked list of linked lists of buttons */
… …
270 shstr ACC (RW, msg); /* Message map creator may have left */ 238 shstr ACC (RW, msg); /* Message map creator may have left */
271 shstr ACC (RW, maplore); /* Map lore information */ 239 shstr ACC (RW, maplore); /* Map lore information */
272 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ 240 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
273 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ 241 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */
274 shstr ACC (RW, path); /* Filename of the map */ 242 shstr ACC (RW, path); /* Filename of the map */
243 int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
244 uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
275 245
276 MTH void activate (); 246 MTH void activate ();
277 MTH void deactivate (); 247 MTH void deactivate ();
278 248
279 // allocates all (empty) mapspace 249 // allocates all (empty) mapspace
280 MTH void alloc (); 250 MTH void alloc ();
281 // deallocates the mapspaces (and destroys all objects) 251 // deallocates the mapspaces (and destroys all objects)
282 MTH void clear (); 252 MTH void clear ();
283 253
284 MTH void fix_auto_apply (); 254 MTH void fix_auto_apply ();
285 MTH void decay_objects (); 255 MTH void do_decay_objects ();
286 MTH void update_buttons (); 256 MTH void update_buttons ();
287 MTH int change_map_light (int change); 257 MTH int change_map_light (int change);
288 static void change_all_map_light (int change); //PERL 258 static void change_all_map_light (int change); //PERL
289 MTH void set_darkness_map (); 259 MTH void set_darkness_map ();
290 MTH int estimate_difficulty () const; 260 MTH int estimate_difficulty () const;
291 261
262 MTH void play_sound (faceidx sound, int x, int y) const;
263
292 // set the given flag on all objects in the map 264 // set the given flag on all objects in the map
293 MTH void set_object_flag (int flag, int value = 1); 265 MTH void set_object_flag (int flag, int value = 1);
294 266
295 MTH void link_multipart_objects (); 267 MTH void link_multipart_objects ();
296 MTH void clear_unique_items (); 268 MTH void clear_unique_items ();
297 269
298 MTH void clear_header (); 270 MTH void clear_header ();
299 MTH void clear_links_to (maptile *m); 271 MTH void clear_links_to (maptile *m);
300 272
273 MTH struct region *region (int x, int y) const;
274
301 // loas the header pseudo-object 275 // load the header pseudo-object
302 bool load_header (object_thawer &thawer); 276 bool _load_header (object_thawer &thawer);
303 MTH bool load_header (const char *path); 277 MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); }
304 278
305 // load objects into the map 279 // load objects into the map
306 bool load_objects (object_thawer &thawer); 280 bool _load_objects (object_thawer &thawer);
307 MTH bool load_objects (const char *path, bool skip_header = true); 281 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
308 282
309 // save objects into the given file (uses IO_ flags) 283 // save objects into the given file (uses IO_ flags)
310 bool save_objects (object_freezer &freezer, int flags); 284 bool _save_objects (object_freezer &freezer, int flags);
311 MTH bool save_objects (const char *path, int flags); 285 MTH bool _save_objects (const char *path, int flags);
312 286
313 // save the header pseudo object _only_ 287 // save the header pseudo object _only_
314 bool save_header (object_freezer &freezer); 288 bool _save_header (object_freezer &freezer);
315 MTH bool save_header (const char *path); 289 MTH bool _save_header (const char *path);
316 290
317 maptile (); 291 maptile ();
318 maptile (int w, int h); 292 maptile (int w, int h);
319 ~maptile (); 293 ~maptile ();
320 294
… …
324 MTH int size () const { return width * height; } 298 MTH int size () const { return width * height; }
325 299
326 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 300 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
327 301
328 MTH void touch () { last_access = runtime; } 302 MTH void touch () { last_access = runtime; }
303
304 MTH bool tile_available (int dir, bool load = true);
329 305
330 // find the map that is at coordinate x|y relative to this map 306 // find the map that is at coordinate x|y relative to this map
331 // TODO: need a better way than passing by reference 307 // TODO: need a better way than passing by reference
332 // TODO: make perl interface 308 // TODO: make perl interface
333 maptile *xy_find (sint16 &x, sint16 &y); 309 maptile *xy_find (sint16 &x, sint16 &y);
… …
342 { 318 {
343 if (!spaces) 319 if (!spaces)
344 do_load_sync (); 320 do_load_sync ();
345 } 321 }
346 322
323 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
324 bool generate_random_map (random_map_params *RP);
325
326 static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL
347 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 327 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
348 static void emergency_save ();//PERL 328 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
329 MTH object *pick_random_object () const;
349 330
350 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 331 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]; } 332 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
352}; 333};
353 334
… …
367 int distance_y; 348 int distance_y;
368 int direction; 349 int direction;
369 object *part; 350 object *part;
370}; 351};
371 352
353// comaptibility cruft start
354//TODO: these should be refactored into things like xy_normalise
355// and so on.
356int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
357int out_of_map (maptile *m, int x, int y);
358maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
359void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
360void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
361int on_same_map (const object *op1, const object *op2);
362int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
363
364// adjust map, x and y for tiled maps and return true if the position is valid at all
365static inline bool
366xy_normalise (maptile *&map, sint16 &x, sint16 &y)
367{
368 // when in range, do a quick return, otherwise go the slow route
369 return
370 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
371 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
372}
373// comaptibility cruft end
374
372inline mapspace & 375inline mapspace &
373object::ms () const 376object::ms () const
374{ 377{
375 return map->at (x, y); 378 return map->at (x, y);
376} 379}
377 380
381struct mapxy {
382 maptile *m;
383 sint16 x, y;
384
385 mapxy (maptile *m, sint16 x, sint16 y)
386 : m(m), x(x), y(y)
387 { }
388
389 mapxy (object *op)
390 : m(op->map), x(op->x), y(op->y)
391 { }
392
393 mapxy &move (int dx, int dy)
394 {
395 x += dx;
396 y += dy;
397
398 return *this;
399 }
400
401 mapxy &move (int dir)
402 {
403 return move (freearr_x [dir], freearr_y [dir]);
404 }
405
406 operator void *() const { return (void *)m; }
407 mapxy &operator =(const object *op)
408 {
409 m = op->map;
410 x = op->x;
411 y = op->y;
412
413 return *this;
414 }
415
416 mapspace *operator ->() const { return &m->at (x, y); }
417 mapspace &operator * () const { return m->at (x, y); }
418
419 bool normalise ()
420 {
421 return xy_normalise (m, x, y);
422 }
423
424 object *insert (object *op, object *originator = 0, int flags = 0) const
425 {
426 m->insert (op, x, y, originator, flags);
427 }
428};
429
430inline const mapxy &
431object::operator =(const mapxy &pos)
432{
433 map = pos.m;
434 x = pos.x;
435 y = pos.y;
436
437 return pos;
438}
439
378#endif 440#endif
379 441

Diff Legend

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