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.59 by root, Thu Jan 25 03:54:45 2007 UTC vs.
Revision 1.74 by root, Thu Apr 19 16:23:47 2007 UTC

65// all those macros are herewith declared legacy 65// all those macros are herewith declared legacy
66#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 ()
67#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
68#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
69#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
70#define GET_MAP_FACE(M,X,Y,L) (M)->at((X),(Y)).faces[L]
71#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]
72#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
73#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
74#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
75#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
118 * to extend information about a space. 117 * to extend information about a space.
119 */ 118 */
120struct mapspace 119struct mapspace
121{ 120{
122 object *bot, *top; /* lowest/highest object on this space */ 121 object *bot, *top; /* lowest/highest object on this space */
123 facetile *faces[MAP_LAYERS]; /* faces for the 3 layers */
124 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ 122 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */
125 uint8 flags_; /* flags about this space (see the P_ values above) */ 123 uint8 flags_; /* flags about this space (see the P_ values above) */
126 sint8 light; /* How much light this space provides */ 124 sint8 light; /* How much light this space provides */
127 MoveType move_block; /* What movement types this space blocks */ 125 MoveType move_block; /* What movement types this space blocks */
128 MoveType move_slow; /* What movement types this space slows */ 126 MoveType move_slow; /* What movement types this space slows */
153 if (op->type == PLAYER) 151 if (op->type == PLAYER)
154 return op; 152 return op;
155 153
156 return 0; 154 return 0;
157 } 155 }
158};
159 156
160/* 157 // return the item volume on this mapspace in cm³
161 * Each map is in a given region of the game world and links to a region definiton, so 158 uint64 volume () const;
162 * they have to appear here in the headers, before the mapdef
163 */
164INTERFACE_CLASS (region)
165struct region : zero_initialised
166{
167 struct region *ACC (RW, next); /* pointer to next region, NULL for the last one */
168 char *ACC (RW, name); /* Shortend name of the region as maps refer to it */
169 char *ACC (RW, parent_name); /*
170 * So that parent and child regions can be defined in
171 * any order, we keep hold of the parent_name during
172 * initialisation, and the children get assigned to their
173 * parents later. (before runtime on the server though)
174 * nothing outside the init code should ever use this value.
175 */
176 struct region *ACC (RW, parent); /*
177 * Pointer to the region that is a parent of the current
178 * region, if a value isn't defined in the current region
179 * we traverse this series of pointers until it is.
180 */
181 char *ACC (RW, longname); /* Official title of the region, this might be defined
182 * to be the same as name*/
183 char *ACC (RW, msg); /* the description of the region */
184 uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */
185 sint8 ACC (RW, fallback); /* whether, in the event of a region not existing,
186 * this should be the one we fall back on as the default */
187 char *ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */
188 sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */
189}; 159};
190 160
191struct shopitems : zero_initialised 161struct shopitems : zero_initialised
192{ 162{
193 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 */
216INTERFACE_CLASS (maptile) 186INTERFACE_CLASS (maptile)
217struct maptile : zero_initialised, attachable 187struct maptile : zero_initialised, attachable
218{ 188{
219 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. */
220 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 struct region **regionmap; /* index to region */
221 193
222 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 */
223 195
224 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 */
225 struct region *ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by 197 struct region *ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
265 shstr ACC (RW, msg); /* Message map creator may have left */ 237 shstr ACC (RW, msg); /* Message map creator may have left */
266 shstr ACC (RW, maplore); /* Map lore information */ 238 shstr ACC (RW, maplore); /* Map lore information */
267 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ 239 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
268 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ 240 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */
269 shstr ACC (RW, path); /* Filename of the map */ 241 shstr ACC (RW, path); /* Filename of the map */
242 int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
243 uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
270 244
271 MTH void activate (); 245 MTH void activate ();
272 MTH void deactivate (); 246 MTH void deactivate ();
273 247
274 // allocates all (empty) mapspace 248 // allocates all (empty) mapspace
291 MTH void clear_unique_items (); 265 MTH void clear_unique_items ();
292 266
293 MTH void clear_header (); 267 MTH void clear_header ();
294 MTH void clear_links_to (maptile *m); 268 MTH void clear_links_to (maptile *m);
295 269
296 struct region *region (int x, int y) const 270 MTH struct region *region (int x, int y) const;
297 {
298 return default_region;
299 }
300 271
301 // loas the header pseudo-object 272 // loas the header pseudo-object
302 bool _load_header (object_thawer &thawer); 273 bool _load_header (object_thawer &thawer);
303 MTH bool _load_header (const char *path); 274 MTH bool _load_header (const char *path);
304 275
345 } 316 }
346 317
347 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); 318 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
348 bool generate_random_map (random_map_params *RP); 319 bool generate_random_map (random_map_params *RP);
349 320
321 static maptile *find_async (const char *path, maptile *original = 0);//PERL
350 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 322 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
351 // async prefetch 323 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
352 static maptile *find_async (const char *path, maptile *original = 0);//PERL 324 MTH object *pick_random_object () const;
353 325
354 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 326 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
355 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } 327 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
356}; 328};
357 329
373 object *part; 345 object *part;
374}; 346};
375 347
376//TODO: these should be refactored into things like xy_normalise 348//TODO: these should be refactored into things like xy_normalise
377// and so on. 349// and so on.
378int get_map_flags(maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); 350int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
379int ob_blocked(const object *ob, maptile *m, sint16 x, sint16 y); 351int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
380int out_of_map(maptile *m, int x, int y); 352int out_of_map (maptile *m, int x, int y);
381maptile *get_map_from_coord(maptile *m, sint16 *x, sint16 *y); 353maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
382void get_rangevector(object *op1, object *op2, rv_vector *retval, int flags); 354void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
383void get_rangevector_from_mapcoord(const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); 355void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
384int on_same_map(const object *op1, const object *op2); 356int on_same_map (const object *op1, const object *op2);
357int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
385 358
386// adjust map, x and y for tiled maps and return true if the position is valid at all 359// adjust map, x and y for tiled maps and return true if the position is valid at all
387inline bool 360inline bool
388xy_normalise (maptile *&map, sint16 &x, sint16 &y) 361xy_normalise (maptile *&map, sint16 &x, sint16 &y)
389{ 362{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines