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.127 by root, Sat Jan 16 17:57:32 2010 UTC vs.
Revision 1.139 by root, Wed May 4 07:41:14 2011 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002-2005 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify it under 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 9 * the terms of the Affero GNU General Public License as published by the
10 * Free Software Foundation, either version 3 of the License, or (at your 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * option) any later version. 11 * option) any later version.
… …
48 * map pointers. 48 * map pointers.
49 */ 49 */
50#define MAGIC_MAP_SIZE 50 50#define MAGIC_MAP_SIZE 50
51#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 51#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
52 52
53#define MAP_LAYERS 3 53#define MAP_LAYERS 3
54 54
55// tile map index 55// tile map index
56enum { 56enum {
57 TILE_UP = 0, 57 TILE_NORTH,
58 TILE_RIGHT = 1, 58 TILE_EAST,
59 TILE_SOUTH,
60 TILE_WEST,
61 TILE_UP,
59 TILE_DOWN = 2, 62 TILE_DOWN,
60 TILE_LEFT = 3, 63 TILE_NUM,
61}; 64};
62 65
63/* Values for in_memory below */ 66/* Values for state below */
64enum { 67enum {
65 MAP_ACTIVE, 68 MAP_SWAPPED, // header loaded, nothing else
66 MAP_INACTIVE, // not used atm. 69 MAP_INACTIVE, // in memory, linkable, but not active
67 MAP_SWAPPED, 70 MAP_ACTIVE, // running!
68 MAP_LOADING,
69 MAP_SAVING,
70}; 71};
71 72
72/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should 73/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
73 * really be used, as it is multi tile aware. However, there are some cases 74 * really be used, as it is multi tile aware. However, there are some cases
74 * where it is known the map is not tiled or the values are known 75 * where it is known the map is not tiled or the values are known
… …
136 uint16_t ACC (RW, items_); // saturates at 64k 137 uint16_t ACC (RW, items_); // saturates at 64k
137 uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) 138 uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024)
138 uint32_t ACC (RW, smell); // the last count a player was seen here, or 0 139 uint32_t ACC (RW, smell); // the last count a player was seen here, or 0
139 static uint32_t ACC (RW, smellcount); // global smell counter 140 static uint32_t ACC (RW, smellcount); // global smell counter
140 141
141 uint32_t pad1_, pad2_; // pad to 64 bytes on 64 bit systems 142 uint32_t pad1_; // pad to 64 bytes on 64 bit systems
142 143
143//-GPL 144//-GPL
144 145
145 void update_ (); 146 void update_ ();
146 MTH void update () 147 MTH void update ()
… …
263 bool ACC (RW, dirty); /* if true, something was inserted or removed */ 264 bool ACC (RW, dirty); /* if true, something was inserted or removed */
264 bool ACC (RW, no_reset); // must not reset this map 265 bool ACC (RW, no_reset); // must not reset this map
265 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by 266 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
266 * players entering/exiting map 267 * players entering/exiting map
267 */ 268 */
269 uint8 ACC (RW, state); /* If not true, the map has been freed and must
270 * be loaded before used. The map,omap and map_ob
271 * arrays will be allocated when the map is loaded */
268 sint32 ACC (RW, timeout); /* swapout is set to this */ 272 sint32 ACC (RW, timeout); /* swapout is set to this */
269 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ 273 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
270 uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must
271 * be loaded before used. The map,omap and map_ob
272 * arrays will be allocated when the map is loaded */
273 sint16 players; /* How many players are on this map right now */ 274 sint16 players; /* How many players are on this map right now */
274 uint16 ACC (RW, difficulty); /* What level the player should be to play here */ 275 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
275 276
276 bool ACC (RW, per_player); 277 bool ACC (RW, per_player);
277 bool ACC (RW, per_party); 278 bool ACC (RW, per_party);
… …
288 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ 289 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
289 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ 290 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
290 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ 291 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
291 shstr ACC (RW, msg); /* Message map creator may have left */ 292 shstr ACC (RW, msg); /* Message map creator may have left */
292 shstr ACC (RW, maplore); /* Map lore information */ 293 shstr ACC (RW, maplore); /* Map lore information */
293 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ 294 shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
294 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ 295 maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */
295 shstr ACC (RW, path); /* Filename of the map */ 296 shstr ACC (RW, path); /* Filename of the map */
296 uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace 297 uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
297 int ACC (RW, max_items); // maximum number of items on a mapspace 298 int ACC (RW, max_items); // maximum number of items on a mapspace
298 299
299//-GPL 300//-GPL
… …
356 bool _save_header (object_freezer &freezer); 357 bool _save_header (object_freezer &freezer);
357 MTH bool _save_header (const_octet_string path); 358 MTH bool _save_header (const_octet_string path);
358 359
359 maptile (); 360 maptile ();
360 maptile (int w, int h); 361 maptile (int w, int h);
362 void init ();
361 ~maptile (); 363 ~maptile ();
362 364
363 void do_destroy (); 365 void do_destroy ();
364 void gather_callbacks (AV *&callbacks, event_type event) const; 366 void gather_callbacks (AV *&callbacks, event_type event) const;
367
368 MTH bool linkable () { return state >= MAP_INACTIVE; }
365 369
366 MTH int size () const { return width * height; } 370 MTH int size () const { return width * height; }
367 371
368 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 372 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
369 373
… …
386 { 390 {
387 if (!spaces) 391 if (!spaces)
388 do_load_sync (); 392 do_load_sync ();
389 } 393 }
390 394
391 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); 395 void make_map_floor (char **layout, const char *floorstyle, random_map_params *RP);
392 bool generate_random_map (random_map_params *RP); 396 bool generate_random_map (random_map_params *RP);
393 397
394 static maptile *find_async (const_utf8_string path, maptile *original = 0, bool load = true);//PERL 398 static maptile *find_async (const_utf8_string path, maptile *original = 0, bool load = true);//PERL
395 static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL 399 static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL
396 static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL 400 static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL
… …
399 mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 403 mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
400 404
401 // return an array of maprects corresponding 405 // return an array of maprects corresponding
402 // to the given rectangular area. the last rect will have 406 // to the given rectangular area. the last rect will have
403 // a 0 map pointer. 407 // a 0 map pointer.
404 // the array will be stored in a static memory area,
405 // so recursion is not atm. supported
406 maprect *split_to_tiles (int x0, int y0, int x1, int y1); 408 maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1);
409
410 MTH bool is_in_shop (int x, int y) const;
407}; 411};
412
413inline bool
414object::is_in_shop () const
415{
416 return is_on_map ()
417 && map->is_in_shop (x, y);
418}
408 419
409//+GPL 420//+GPL
410 421
411/* This is used by get_rangevector to determine where the other 422/* This is used by get_rangevector to determine where the other
412 * creature is. get_rangevector takes into account map tiling, 423 * creature is. get_rangevector takes into account map tiling,
… …
431// and so on. 442// and so on.
432int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); 443int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
433int out_of_map (maptile *m, int x, int y); 444int out_of_map (maptile *m, int x, int y);
434maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); 445maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
435void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); 446void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
436void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); 447void get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/);
437int on_same_map (const object *op1, const object *op2); 448int on_same_map (const object *op1, const object *op2);
438int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); 449int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy);
439 450
440// adjust map, x and y for tiled maps and return true if the position is valid at all 451// adjust map, x and y for tiled maps and return true if the position is valid at all
441static inline bool 452static inline bool
442xy_normalise (maptile *&map, sint16 &x, sint16 &y) 453xy_normalise (maptile *&map, sint16 &x, sint16 &y)
443{ 454{
… …
547 558
548#define ordered_mapwalk_end \ 559#define ordered_mapwalk_end \
549 } \ 560 } \
550 } 561 }
551 562
563extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
564
552// loop over every space in the given maprect, 565// loop over every space in the given maprect,
553// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 566// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
554// the iterator code must be a single statement following this macro call, similar to "if" 567// the iterator code must be a single statement following this macro call, similar to "if"
555// "continue" will skip to the next space 568// "continue" will skip to the next space
556#define rect_mapwalk(rect,dx0,dy0) \ 569#define rect_mapwalk(rect,dx0,dy0) \
… …
562 575
563// same as ordered_mapwalk, but the walk will not follow any particular 576// same as ordered_mapwalk, but the walk will not follow any particular
564// order (unorded), but is likely faster. 577// order (unorded), but is likely faster.
565// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op 578// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
566// "continue" will skip to the next space 579// "continue" will skip to the next space
567#define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \ 580#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \
568 for (maprect *r_e_c_t = (map)->split_to_tiles ( \ 581 for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \
569 (ox) + (dx0) , (oy) + (dy0) , \ 582 (ox) + (dx0) , (oy) + (dy0) , \
570 (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ 583 (ox) + (dx1) + 1, (oy) + (dy1) + 1); \
571 r_e_c_t->m; \ 584 r_e_c_t->m; \
572 ++r_e_c_t) \ 585 ++r_e_c_t) \
573 rect_mapwalk (r_e_c_t, (ox), (oy)) 586 rect_mapwalk (r_e_c_t, (ox), (oy))
574 587
575#define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ 588#define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \
576 unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1) 589 unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1)
577 590
578#endif 591#endif
579 592

Diff Legend

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