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.55 by root, Fri Jan 19 17:50:11 2007 UTC vs.
Revision 1.69 by root, Sat Feb 17 23:32:11 2007 UTC

… …
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/* 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
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,
63 MAP_LOADING, 56 MAP_LOADING,
… …
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) !(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (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
… …
160 if (op->type == PLAYER) 153 if (op->type == PLAYER)
161 return op; 154 return op;
162 155
163 return 0; 156 return 0;
164 } 157 }
158
159 // return the item volume on this mapspace in cm³
160 uint64 volume () const;
165}; 161};
166 162
167/* 163/*
168 * 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
169 * they have to appear here in the headers, before the mapdef 165 * they have to appear here in the headers, before the mapdef
170 */ 166 */
171INTERFACE_CLASS (region) 167INTERFACE_CLASS (region)
172struct region : zero_initialised 168struct region : zero_initialised
173{ 169{
174 struct region *ACC (RW, next); /* pointer to next region, NULL for the last one */
175 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 */
176 char *ACC (RW, parent_name); /*
177 * So that parent and child regions can be defined in
178 * any order, we keep hold of the parent_name during
179 * initialisation, and the children get assigned to their
180 * parents later. (before runtime on the server though)
181 * nothing outside the init code should ever use this value.
182 */
183 struct region *ACC (RW, parent); /* 171 region *ACC (RW, parent); /*
184 * Pointer to the region that is a parent of the current 172 * Pointer to the region that is a parent of the current
185 * region, if a value isn't defined in the current region 173 * region, if a value isn't defined in the current region
186 * we traverse this series of pointers until it is. 174 * we traverse this series of pointers until it is.
187 */ 175 */
188 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
189 * to be the same as name*/ 177 * to be the same as name*/
190 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);
191 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. */
192 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,
193 * 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 */
194 char *ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */ 185
195 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);
189 static region *read (object_thawer &f);
196}; 190};
191
192typedef object_vector<region, &region::index> regionvec;
193
194extern regionvec regions;
195
196#define for_all_regions(var) \
197 for (int _i = 0; _i < regions.size (); ++_i) \
198 declvar (region *, var, regions [_i])
197 199
198struct shopitems : zero_initialised 200struct shopitems : zero_initialised
199{ 201{
200 const char *name; /* name of the item in question, null if it is the default item */ 202 const char *name; /* name of the item in question, null if it is the default item */
201 const char *name_pl; /* plural name */ 203 const char *name_pl; /* plural name */
… …
223INTERFACE_CLASS (maptile) 225INTERFACE_CLASS (maptile)
224struct maptile : zero_initialised, attachable 226struct maptile : zero_initialised, attachable
225{ 227{
226 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ 228 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
227 struct mapspace *spaces; /* Array of spaces on this map */ 229 struct mapspace *spaces; /* Array of spaces on this map */
230 uint8 *regions; /* region index per mapspace, if != 0 */
231 struct region **regionmap; /* index to region */
228 232
229 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ 233 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
230 234
231 shstr ACC (RW, name); /* Name of map as given by its creator */ 235 shstr ACC (RW, name); /* Name of map as given by its creator */
232 struct region *ACC (RW, region); /* What jurisdiction in the game world this map is ruled by 236 struct region *ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
233 * points to the struct containing all the properties of 237 * points to the struct containing all the properties of
234 * the region */ 238 * the region */
235 double ACC (RW, reset_time); 239 double ACC (RW, reset_time);
236 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map 240 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
237 * should be reset 241 * should be reset
… …
249 uint16 ACC (RW, difficulty); /* What level the player should be to play here */ 253 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
250 254
251 bool ACC (RW, per_player); 255 bool ACC (RW, per_player);
252 bool ACC (RW, per_party); 256 bool ACC (RW, per_party);
253 bool ACC (RW, outdoor); /* True if an outdoor map */ 257 bool ACC (RW, outdoor); /* True if an outdoor map */
258 bool ACC (RW, nodrop); /* avoid dropping anything on this map */
254 uint8 ACC (RW, darkness); /* indicates level of darkness of map */ 259 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
255 260
256 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ 261 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 */ 262 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 */ 263 oblinkpt *buttons; /* Linked list of linked lists of buttons */
… …
271 shstr ACC (RW, msg); /* Message map creator may have left */ 276 shstr ACC (RW, msg); /* Message map creator may have left */
272 shstr ACC (RW, maplore); /* Map lore information */ 277 shstr ACC (RW, maplore); /* Map lore information */
273 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ 278 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
274 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ 279 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */
275 shstr ACC (RW, path); /* Filename of the map */ 280 shstr ACC (RW, path); /* Filename of the map */
281 int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
282 uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
276 283
277 MTH void activate (); 284 MTH void activate ();
278 MTH void deactivate (); 285 MTH void deactivate ();
279 286
280 // allocates all (empty) mapspace 287 // allocates all (empty) mapspace
… …
296 MTH void link_multipart_objects (); 303 MTH void link_multipart_objects ();
297 MTH void clear_unique_items (); 304 MTH void clear_unique_items ();
298 305
299 MTH void clear_header (); 306 MTH void clear_header ();
300 MTH void clear_links_to (maptile *m); 307 MTH void clear_links_to (maptile *m);
308
309 MTH struct region *region (int x, int y) const;
301 310
302 // loas the header pseudo-object 311 // loas the header pseudo-object
303 bool _load_header (object_thawer &thawer); 312 bool _load_header (object_thawer &thawer);
304 MTH bool _load_header (const char *path); 313 MTH bool _load_header (const char *path);
305 314
… …
346 } 355 }
347 356
348 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); 357 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
349 bool generate_random_map (random_map_params *RP); 358 bool generate_random_map (random_map_params *RP);
350 359
360 static maptile *find_async (const char *path, maptile *original = 0);//PERL
351 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 361 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
352 // async prefetch 362 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
353 static maptile *find_async (const char *path, maptile *original = 0);//PERL 363 MTH object *pick_random_object () const;
354 364
355 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 365 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
356 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } 366 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
357}; 367};
358 368
… …
374 object *part; 384 object *part;
375}; 385};
376 386
377//TODO: these should be refactored into things like xy_normalise 387//TODO: these should be refactored into things like xy_normalise
378// and so on. 388// and so on.
379int get_map_flags(maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); 389int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
380int ob_blocked(const object *ob, maptile *m, sint16 x, sint16 y); 390int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
381int out_of_map(maptile *m, int x, int y); 391int out_of_map (maptile *m, int x, int y);
382maptile *get_map_from_coord(maptile *m, sint16 *x, sint16 *y); 392maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
383void get_rangevector(object *op1, object *op2, rv_vector *retval, int flags); 393void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
384void get_rangevector_from_mapcoord(const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); 394void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
385int on_same_map(const object *op1, const object *op2); 395int on_same_map (const object *op1, const object *op2);
396int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
386 397
387// adjust map, x and y for tiled maps and return true if the position is valid at all 398// adjust map, x and y for tiled maps and return true if the position is valid at all
388inline bool 399inline bool
389xy_normalise (maptile *&map, sint16 &x, sint16 &y) 400xy_normalise (maptile *&map, sint16 &x, sint16 &y)
390{ 401{

Diff Legend

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