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.60 by root, Sat Jan 27 23:59:29 2007 UTC vs.
Revision 1.69 by root, Sat Feb 17 23:32:11 2007 UTC

… …
153 if (op->type == PLAYER) 153 if (op->type == PLAYER)
154 return op; 154 return op;
155 155
156 return 0; 156 return 0;
157 } 157 }
158
159 // return the item volume on this mapspace in cm³
160 uint64 volume () const;
158}; 161};
159 162
160/* 163/*
161 * 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
162 * they have to appear here in the headers, before the mapdef 165 * they have to appear here in the headers, before the mapdef
163 */ 166 */
164INTERFACE_CLASS (region) 167INTERFACE_CLASS (region)
165struct region : zero_initialised 168struct region : zero_initialised
166{ 169{
167 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 */ 170 shstr 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 region *ACC (RW, parent); /* 171 region *ACC (RW, parent); /*
177 * Pointer to the region that is a parent of the current 172 * Pointer to the region that is a parent of the current
178 * region, if a value isn't defined in the current region 173 * region, if a value isn't defined in the current region
179 * we traverse this series of pointers until it is. 174 * we traverse this series of pointers until it is.
180 */ 175 */
181 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
182 * to be the same as name*/ 177 * to be the same as name*/
183 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);
184 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. */
185 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,
186 * 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 */
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 185
190 static region *default_region (); 186 static region *default_region ();
191 static region *find (const char *name); 187 static region *find (const char *name);
188 static region *find_fuzzy (const char *name);
189 static region *read (object_thawer &f);
192}; 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])
193 199
194struct shopitems : zero_initialised 200struct shopitems : zero_initialised
195{ 201{
196 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 */
197 const char *name_pl; /* plural name */ 203 const char *name_pl; /* plural name */
… …
270 shstr ACC (RW, msg); /* Message map creator may have left */ 276 shstr ACC (RW, msg); /* Message map creator may have left */
271 shstr ACC (RW, maplore); /* Map lore information */ 277 shstr ACC (RW, maplore); /* Map lore information */
272 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ 278 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
273 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ 279 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */
274 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
275 283
276 MTH void activate (); 284 MTH void activate ();
277 MTH void deactivate (); 285 MTH void deactivate ();
278 286
279 // allocates all (empty) mapspace 287 // allocates all (empty) mapspace
… …
347 } 355 }
348 356
349 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);
350 bool generate_random_map (random_map_params *RP); 358 bool generate_random_map (random_map_params *RP);
351 359
360 static maptile *find_async (const char *path, maptile *original = 0);//PERL
352 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 361 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
353 // async prefetch 362 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
354 static maptile *find_async (const char *path, maptile *original = 0);//PERL 363 MTH object *pick_random_object () const;
355 364
356 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]; }
357 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } 366 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
358}; 367};
359 368
… …
375 object *part; 384 object *part;
376}; 385};
377 386
378//TODO: these should be refactored into things like xy_normalise 387//TODO: these should be refactored into things like xy_normalise
379// and so on. 388// and so on.
380int 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);
381int ob_blocked(const object *ob, maptile *m, sint16 x, sint16 y); 390int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
382int out_of_map(maptile *m, int x, int y); 391int out_of_map (maptile *m, int x, int y);
383maptile *get_map_from_coord(maptile *m, sint16 *x, sint16 *y); 392maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
384void get_rangevector(object *op1, object *op2, rv_vector *retval, int flags); 393void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
385void 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);
386int 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);
387 397
388// 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
389inline bool 399inline bool
390xy_normalise (maptile *&map, sint16 &x, sint16 &y) 400xy_normalise (maptile *&map, sint16 &x, sint16 &y)
391{ 401{

Diff Legend

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