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.46 by root, Mon Jan 1 12:28:47 2007 UTC vs.
Revision 1.64 by root, Thu Feb 1 19:15:39 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) 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 53enum {
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
122 * to extend information about a space. 118 * to extend information about a space.
123 */ 119 */
124struct mapspace 120struct 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 */
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 */
168INTERFACE_CLASS (region) 164INTERFACE_CLASS (region)
169struct region : zero_initialised 165struct region : zero_initialised
170{ 166{
171 struct 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 */ 167 shstr ACC (RW, name); /* Shortend name of the region as maps refer to it */
173 char *ACC (RW, parent_name); /*
174 * So that parent and child regions can be defined in
175 * any order, we keep hold of the parent_name during
176 * initialisation, and the children get assigned to their
177 * parents later. (before runtime on the server though)
178 * nothing outside the init code should ever use this value.
179 */
180 struct region *ACC (RW, parent); /* 168 region *ACC (RW, parent); /*
181 * Pointer to the region that is a parent of the current 169 * Pointer to the region that is a parent of the current
182 * region, if a value isn't defined in the current region 170 * region, if a value isn't defined in the current region
183 * we traverse this series of pointers until it is. 171 * we traverse this series of pointers until it is.
184 */ 172 */
185 char *ACC (RW, longname); /* Official title of the region, this might be defined 173 shstr ACC (RW, longname); /* Official title of the region, this might be defined
186 * to be the same as name*/ 174 * to be the same as name*/
187 char *ACC (RW, msg); /* the description of the region */ 175 shstr ACC (RW, msg); /* the description of the region */
176 shstr ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */
177 int ACC (RW, index);
188 uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */ 178 uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */
179 sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */
189 sint8 ACC (RW, fallback); /* whether, in the event of a region not existing, 180 bool 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 */ 181 * 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. */ 182
192 sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */ 183 static region *default_region ();
184 static region *find (const char *name);
185 static region *find_fuzzy (const char *name);
193}; 186};
187
188typedef object_vector<region, &region::index> regionvec;
189
190extern regionvec regions;
191
192#define for_all_regions(var) \
193 for (int _i = 0; _i < regions.size (); ++_i) \
194 declvar (region *, var, regions [_i])
194 195
195struct shopitems : zero_initialised 196struct shopitems : zero_initialised
196{ 197{
197 const char *name; /* name of the item in question, null if it is the default item */ 198 const char *name; /* name of the item in question, null if it is the default item */
198 const char *name_pl; /* plural name */ 199 const char *name_pl; /* plural name */
220INTERFACE_CLASS (maptile) 221INTERFACE_CLASS (maptile)
221struct maptile : zero_initialised, attachable 222struct maptile : zero_initialised, attachable
222{ 223{
223 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ 224 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
224 struct mapspace *spaces; /* Array of spaces on this map */ 225 struct mapspace *spaces; /* Array of spaces on this map */
226 uint8 *regions; /* region index per mapspace, if != 0 */
227 struct region **regionmap; /* index to region */
225 228
226 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ 229 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
227 230
228 shstr ACC (RW, name); /* Name of map as given by its creator */ 231 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 232 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 233 * points to the struct containing all the properties of
231 * the region */ 234 * the region */
232 double ACC (RW, reset_time); 235 double ACC (RW, reset_time);
233 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map 236 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
234 * should be reset 237 * should be reset
246 uint16 ACC (RW, difficulty); /* What level the player should be to play here */ 249 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
247 250
248 bool ACC (RW, per_player); 251 bool ACC (RW, per_player);
249 bool ACC (RW, per_party); 252 bool ACC (RW, per_party);
250 bool ACC (RW, outdoor); /* True if an outdoor map */ 253 bool ACC (RW, outdoor); /* True if an outdoor map */
254 bool ACC (RW, nodrop); /* avoid dropping anything on this map */
251 uint8 ACC (RW, darkness); /* indicates level of darkness of map */ 255 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
252 256
253 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ 257 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
254 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ 258 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
255 oblinkpt *buttons; /* Linked list of linked lists of buttons */ 259 oblinkpt *buttons; /* Linked list of linked lists of buttons */
294 MTH void clear_unique_items (); 298 MTH void clear_unique_items ();
295 299
296 MTH void clear_header (); 300 MTH void clear_header ();
297 MTH void clear_links_to (maptile *m); 301 MTH void clear_links_to (maptile *m);
298 302
303 MTH struct region *region (int x, int y) const;
304
299 // loas the header pseudo-object 305 // loas the header pseudo-object
300 bool load_header (object_thawer &thawer); 306 bool _load_header (object_thawer &thawer);
301 MTH bool load_header (const char *path); 307 MTH bool _load_header (const char *path);
302 308
303 // load objects into the map 309 // load objects into the map
304 bool load_objects (object_thawer &thawer); 310 bool _load_objects (object_thawer &thawer);
305 MTH bool load_objects (const char *path, bool skip_header = true); 311 MTH bool _load_objects (const char *path, bool skip_header = true);
306 312
307 // save objects into the given file (uses IO_ flags) 313 // save objects into the given file (uses IO_ flags)
308 bool save_objects (object_freezer &freezer, int flags); 314 bool _save_objects (object_freezer &freezer, int flags);
309 MTH bool save_objects (const char *path, int flags); 315 MTH bool _save_objects (const char *path, int flags);
310 316
311 // save the header pseudo object _only_ 317 // save the header pseudo object _only_
312 bool save_header (object_freezer &freezer); 318 bool _save_header (object_freezer &freezer);
313 MTH bool save_header (const char *path); 319 MTH bool _save_header (const char *path);
314 320
315 maptile (); 321 maptile ();
316 maptile (int w, int h); 322 maptile (int w, int h);
317 ~maptile (); 323 ~maptile ();
318 324
323 329
324 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 330 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
325 331
326 MTH void touch () { last_access = runtime; } 332 MTH void touch () { last_access = runtime; }
327 333
328// static maptile *find_map (const char *path, maptile *origin);//PERL 334 // find the map that is at coordinate x|y relative to this map
329// 335 // TODO: need a better way than passing by reference
330// // load a map relative to this one 336 // TODO: make perl interface
331// maptile *find_map (const char *path) 337 maptile *xy_find (sint16 &x, sint16 &y);
332// { 338
333// return find_map (path, this); 339 // like xy_find, but also loads the map
334// } 340 maptile *xy_load (sint16 &x, sint16 &y);
335// 341
336// // customise this map for the given player
337// // might return this or a completely new map
338// maptile *customise_for (object *op);
339//
340// void do_force_map_sync ();//PERL 342 void do_load_sync ();//PERL
341// 343
342// // make sure the map is loaded 344 // make sure the map is loaded
343// MTH void force_map_sync () 345 MTH void load_sync ()
344// { 346 {
345// if (in_memory != MAP_IN_MEMORY) 347 if (!spaces)
346// do_force_map_sync (); 348 do_load_sync ();
347// } 349 }
348 350
351 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
352 bool generate_random_map (random_map_params *RP);
353
354 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
355 // async prefetch
349 static maptile *load_map_sync (const char *path, maptile *original = 0);//PERL 356 static maptile *find_async (const char *path, maptile *original = 0);//PERL
350 static void emergency_save ();//PERL
351 357
352 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 358 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
353 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } 359 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
354}; 360};
355 361
369 int distance_y; 375 int distance_y;
370 int direction; 376 int direction;
371 object *part; 377 object *part;
372}; 378};
373 379
380//TODO: these should be refactored into things like xy_normalise
381// and so on.
382int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
383int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
384int out_of_map (maptile *m, int x, int y);
385maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
386void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
387void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
388int on_same_map (const object *op1, const object *op2);
389int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
390
391// adjust map, x and y for tiled maps and return true if the position is valid at all
392inline bool
393xy_normalise (maptile *&map, sint16 &x, sint16 &y)
394{
395 // when in range, do a quick return, otherwise go the slow route
396 return
397 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
398 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
399}
400
374inline mapspace & 401inline mapspace &
375object::ms () const 402object::ms () const
376{ 403{
377 return map->at (x, y); 404 return map->at (x, y);
378} 405}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines