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.50 by root, Wed Jan 10 01:16:54 2007 UTC vs.
Revision 1.58 by root, Wed Jan 24 22:42:48 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) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
7 7 *
8 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
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 2 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, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 21 *
22 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
23*/ 23 */
24 24
25/* 25/*
26 * The maptile is allocated each time a new map is opened. 26 * The maptile is allocated each time a new map is opened.
27 * It contains pointers (very indirectly) to all objects on the map. 27 * It contains pointers (very indirectly) to all objects on the map.
28 */ 28 */
46 */ 46 */
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
52/* options passed to ready_map_name and load_original_map */
53#define MAP_FLUSH 0x01
54#define MAP_PLAYER_UNIQUE 0x02
55#define MAP_BLOCK 0x04
56#define MAP_STYLE 0x08
57#define MAP_OVERLAY 0x10
58 51
59/* Values for in_memory below. Should probably be an enumerations */ 52/* Values for in_memory below. Should probably be an enumerations */
60enum { 53enum {
61 MAP_IN_MEMORY, 54 MAP_IN_MEMORY,
62 MAP_SWAPPED, 55 MAP_SWAPPED,
83 76
84/* 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
85 * 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
86 * map tiling. 79 * map tiling.
87 */ 80 */
88#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)))
89 82
90/* 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
91 * in the object flags structure. 84 * in the object flags structure.
92 */ 85 */
93#define P_BLOCKSVIEW 0x01 86#define P_BLOCKSVIEW 0x01
125 * to extend information about a space. 118 * to extend information about a space.
126 */ 119 */
127struct mapspace 120struct mapspace
128{ 121{
129 object *bot, *top; /* lowest/highest object on this space */ 122 object *bot, *top; /* lowest/highest object on this space */
130 New_Face *faces[MAP_LAYERS]; /* faces for the 3 layers */ 123 facetile *faces[MAP_LAYERS]; /* faces for the 3 layers */
131 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ 124 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */
132 uint8 flags_; /* flags about this space (see the P_ values above) */ 125 uint8 flags_; /* flags about this space (see the P_ values above) */
133 sint8 light; /* How much light this space provides */ 126 sint8 light; /* How much light this space provides */
134 MoveType move_block; /* What movement types this space blocks */ 127 MoveType move_block; /* What movement types this space blocks */
135 MoveType move_slow; /* What movement types this space slows */ 128 MoveType move_slow; /* What movement types this space slows */
249 uint16 ACC (RW, difficulty); /* What level the player should be to play here */ 242 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
250 243
251 bool ACC (RW, per_player); 244 bool ACC (RW, per_player);
252 bool ACC (RW, per_party); 245 bool ACC (RW, per_party);
253 bool ACC (RW, outdoor); /* True if an outdoor map */ 246 bool ACC (RW, outdoor); /* True if an outdoor map */
247 bool ACC (RW, nodrop); /* avoid dropping anything on this map */
254 uint8 ACC (RW, darkness); /* indicates level of darkness of map */ 248 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
255 249
256 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ 250 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
257 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ 251 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
258 oblinkpt *buttons; /* Linked list of linked lists of buttons */ 252 oblinkpt *buttons; /* Linked list of linked lists of buttons */
298 292
299 MTH void clear_header (); 293 MTH void clear_header ();
300 MTH void clear_links_to (maptile *m); 294 MTH void clear_links_to (maptile *m);
301 295
302 // loas the header pseudo-object 296 // loas the header pseudo-object
303 bool load_header (object_thawer &thawer); 297 bool _load_header (object_thawer &thawer);
304 MTH bool load_header (const char *path); 298 MTH bool _load_header (const char *path);
305 299
306 // load objects into the map 300 // load objects into the map
307 bool load_objects (object_thawer &thawer); 301 bool _load_objects (object_thawer &thawer);
308 MTH bool load_objects (const char *path, bool skip_header = true); 302 MTH bool _load_objects (const char *path, bool skip_header = true);
309 303
310 // save objects into the given file (uses IO_ flags) 304 // save objects into the given file (uses IO_ flags)
311 bool save_objects (object_freezer &freezer, int flags); 305 bool _save_objects (object_freezer &freezer, int flags);
312 MTH bool save_objects (const char *path, int flags); 306 MTH bool _save_objects (const char *path, int flags);
313 307
314 // save the header pseudo object _only_ 308 // save the header pseudo object _only_
315 bool save_header (object_freezer &freezer); 309 bool _save_header (object_freezer &freezer);
316 MTH bool save_header (const char *path); 310 MTH bool _save_header (const char *path);
317 311
318 maptile (); 312 maptile ();
319 maptile (int w, int h); 313 maptile (int w, int h);
320 ~maptile (); 314 ~maptile ();
321 315
343 { 337 {
344 if (!spaces) 338 if (!spaces)
345 do_load_sync (); 339 do_load_sync ();
346 } 340 }
347 341
342 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
343 bool generate_random_map (random_map_params *RP);
344
348 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 345 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
349 // async prefetch 346 // async prefetch
350 static maptile *find_async (const char *path, maptile *original = 0);//PERL 347 static maptile *find_async (const char *path, maptile *original = 0);//PERL
351 348
352 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 349 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
369 int distance_y; 366 int distance_y;
370 int direction; 367 int direction;
371 object *part; 368 object *part;
372}; 369};
373 370
371//TODO: these should be refactored into things like xy_normalise
372// and so on.
373int get_map_flags(maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
374int ob_blocked(const object *ob, maptile *m, sint16 x, sint16 y);
375int out_of_map(maptile *m, int x, int y);
376maptile *get_map_from_coord(maptile *m, sint16 *x, sint16 *y);
377void get_rangevector(object *op1, object *op2, rv_vector *retval, int flags);
378void get_rangevector_from_mapcoord(const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
379int on_same_map(const object *op1, const object *op2);
380
381// adjust map, x and y for tiled maps and return true if the position is valid at all
382inline bool
383xy_normalise (maptile *&map, sint16 &x, sint16 &y)
384{
385 // when in range, do a quick return, otherwise go the slow route
386 return
387 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
388 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
389}
390
374inline mapspace & 391inline mapspace &
375object::ms () const 392object::ms () const
376{ 393{
377 return map->at (x, y); 394 return map->at (x, y);
378} 395}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines