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.125 by root, Sun Jan 10 19:21:46 2010 UTC vs.
Revision 1.143 by root, Sat May 7 10:50:35 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 ()
… …
212 maptile *m; 213 maptile *m;
213 int x0, y0; 214 int x0, y0;
214 int x1, y1; 215 int x1, y1;
215 int dx, dy; // offset to go from local coordinates to original tile */ 216 int dx, dy; // offset to go from local coordinates to original tile */
216}; 217};
218
219// (refcounted) list of objects on this map that need physics processing
220struct physics_queue
221: unordered_vector<object *>
222{
223 int i; // already processed
224 physics_queue ();
225 ~physics_queue ();
226 object *pop ();
227};
228
229#define PHYSICS_QUEUES 16 // "activity" at least every 16 ticks
217 230
218//+GPL 231//+GPL
219 232
220struct shopitems : zero_initialised 233struct shopitems : zero_initialised
221{ 234{
… …
263 bool ACC (RW, dirty); /* if true, something was inserted or removed */ 276 bool ACC (RW, dirty); /* if true, something was inserted or removed */
264 bool ACC (RW, no_reset); // must not reset this map 277 bool ACC (RW, no_reset); // must not reset this map
265 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by 278 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
266 * players entering/exiting map 279 * players entering/exiting map
267 */ 280 */
281 uint8 ACC (RW, state); /* If not true, the map has been freed and must
282 * be loaded before used. The map,omap and map_ob
283 * arrays will be allocated when the map is loaded */
268 sint32 ACC (RW, timeout); /* swapout is set to this */ 284 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 */ 285 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 */ 286 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 */ 287 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
275 288
276 bool ACC (RW, per_player); 289 bool ACC (RW, per_player);
277 bool ACC (RW, per_party); 290 bool ACC (RW, per_party);
… …
288 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ 301 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
289 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ 302 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
290 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ 303 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
291 shstr ACC (RW, msg); /* Message map creator may have left */ 304 shstr ACC (RW, msg); /* Message map creator may have left */
292 shstr ACC (RW, maplore); /* Map lore information */ 305 shstr ACC (RW, maplore); /* Map lore information */
293 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ 306 shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
294 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ 307 maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */
295 shstr ACC (RW, path); /* Filename of the map */ 308 shstr ACC (RW, path); /* Filename of the map */
296 uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace 309 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 310 int ACC (RW, max_items); // maximum number of items on a mapspace
298 311
299//-GPL 312//-GPL
300 313
314 physics_queue pq[PHYSICS_QUEUES];
315 MTH void queue_physics (object *ob, int after = 0);
316 MTH void queue_physics_at (int x, int y);
317 MTH void post_load_physics ();
318 MTH int run_physics (tick_t tick, int max_objects);
319
301 // the maptile:: is neccessary here for the perl interface to work 320 // the maptile:: is neccessary here for the perl interface to work
302 MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const 321 MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
303 { 322 {
304 return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); 323 return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
305 } 324 }
306 325
307 static void adjust_daylight (); 326 static void adjust_daylight ();
308 327
309 MTH void activate (); 328 MTH void activate ();
329 MTH void activate_physics ();
310 MTH void deactivate (); 330 MTH void deactivate ();
311 331
312 // allocates all (empty) mapspace 332 // allocates all (empty) mapspace
313 MTH void alloc (); 333 MTH void alloc ();
314 // deallocates the mapspaces (and destroys all objects) 334 // deallocates the mapspaces (and destroys all objects)
… …
320 MTH void update_buttons (); 340 MTH void update_buttons ();
321 MTH int change_map_light (int change); 341 MTH int change_map_light (int change);
322 MTH int estimate_difficulty () const; 342 MTH int estimate_difficulty () const;
323 343
324 MTH void play_sound (faceidx sound, int x, int y) const; 344 MTH void play_sound (faceidx sound, int x, int y) const;
325 MTH void say_msg (const char *msg, int x, int y) const; 345 MTH void say_msg (const_utf8_string msg, int x, int y) const;
326 346
327 // connected links 347 // connected links
328 oblinkpt *find_link (shstr_tmp id); 348 oblinkpt *find_link (shstr_tmp id);
329 MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); 349 MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0);
330 350
… …
348 bool _load_objects (object_thawer &thawer); 368 bool _load_objects (object_thawer &thawer);
349 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } 369 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
350 370
351 // save objects into the given file (uses IO_ flags) 371 // save objects into the given file (uses IO_ flags)
352 bool _save_objects (object_freezer &freezer, int flags); 372 bool _save_objects (object_freezer &freezer, int flags);
353 MTH bool _save_objects (const char *path, int flags); 373 MTH bool _save_objects (const_octet_string path, int flags);
354 374
355 // save the header pseudo object _only_ 375 // save the header pseudo object _only_
356 bool _save_header (object_freezer &freezer); 376 bool _save_header (object_freezer &freezer);
357 MTH bool _save_header (const char *path); 377 MTH bool _save_header (const_octet_string path);
358 378
359 maptile (); 379 maptile ();
360 maptile (int w, int h); 380 maptile (int w, int h);
381 void init ();
361 ~maptile (); 382 ~maptile ();
362 383
363 void do_destroy (); 384 void do_destroy ();
364 void gather_callbacks (AV *&callbacks, event_type event) const; 385 void gather_callbacks (AV *&callbacks, event_type event) const;
386
387 MTH bool linkable () { return state >= MAP_INACTIVE; }
365 388
366 MTH int size () const { return width * height; } 389 MTH int size () const { return width * height; }
367 390
368 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 391 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
369 392
… …
386 { 409 {
387 if (!spaces) 410 if (!spaces)
388 do_load_sync (); 411 do_load_sync ();
389 } 412 }
390 413
391 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); 414 void make_map_floor (char **layout, const char *floorstyle, random_map_params *RP);
392 bool generate_random_map (random_map_params *RP); 415 bool generate_random_map (random_map_params *RP);
393 416
394 static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL 417 static maptile *find_async (const_utf8_string path, maptile *original = 0, bool load = true);//PERL
395 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 418 static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL
396 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL 419 static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL
397 object *pick_random_object (rand_gen &gen = rndm) const; 420 object *pick_random_object (rand_gen &gen = rndm) const;
398 421
399 mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 422 mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
400 423
401 // return an array of maprects corresponding 424 // return an array of maprects corresponding
402 // to the given rectangular area. the last rect will have 425 // to the given rectangular area. the last rect will have
403 // a 0 map pointer. 426 // 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); 427 maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1);
428
429 MTH bool is_in_shop (int x, int y) const;
407}; 430};
431
432inline bool
433object::is_in_shop () const
434{
435 return is_on_map ()
436 && map->is_in_shop (x, y);
437}
408 438
409//+GPL 439//+GPL
410 440
411/* This is used by get_rangevector to determine where the other 441/* This is used by get_rangevector to determine where the other
412 * creature is. get_rangevector takes into account map tiling, 442 * creature is. get_rangevector takes into account map tiling,
… …
431// and so on. 461// and so on.
432int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); 462int 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); 463int out_of_map (maptile *m, int x, int y);
434maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); 464maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
435void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); 465void 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*/); 466void 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); 467int on_same_map (const object *op1, const object *op2);
438int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); 468int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy);
439 469
440// adjust map, x and y for tiled maps and return true if the position is valid at all 470// adjust map, x and y for tiled maps and return true if the position is valid at all
441static inline bool 471static inline bool
442xy_normalise (maptile *&map, sint16 &x, sint16 &y) 472xy_normalise (maptile *&map, sint16 &x, sint16 &y)
443{ 473{
… …
547 577
548#define ordered_mapwalk_end \ 578#define ordered_mapwalk_end \
549 } \ 579 } \
550 } 580 }
551 581
582extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
583
552// loop over every space in the given maprect, 584// 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 585// 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" 586// the iterator code must be a single statement following this macro call, similar to "if"
555// "continue" will skip to the next space 587// "continue" will skip to the next space
556#define rect_mapwalk(rect,dx0,dy0) \ 588#define rect_mapwalk(rect,dx0,dy0) \
… …
562 594
563// same as ordered_mapwalk, but the walk will not follow any particular 595// same as ordered_mapwalk, but the walk will not follow any particular
564// order (unorded), but is likely faster. 596// 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 597// 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 598// "continue" will skip to the next space
567#define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \ 599#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \
568 for (maprect *r_e_c_t = (map)->split_to_tiles ( \ 600 for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \
569 (ox) + (dx0) , (oy) + (dy0) , \ 601 (ox) + (dx0) , (oy) + (dy0) , \
570 (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ 602 (ox) + (dx1) + 1, (oy) + (dy1) + 1); \
571 r_e_c_t->m; \ 603 r_e_c_t->m; \
572 ++r_e_c_t) \ 604 ++r_e_c_t) \
573 rect_mapwalk (r_e_c_t, (ox), (oy)) 605 rect_mapwalk (r_e_c_t, (ox), (oy))
574 606
575#define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ 607#define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \
576 unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1) 608 unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1)
577 609
578#endif 610#endif
579 611

Diff Legend

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