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.142 by root, Thu May 5 18:59:43 2011 UTC vs.
Revision 1.156 by root, Sat Nov 17 23:33:18 2018 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,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002-2005 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002-2005 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992 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.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the Affero GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * and the GNU General Public License along with this program. If not, see 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25/* 25/*
26 * The maptile is allocated each time a new map is opened. 26 * The maptile is allocated each time a new map is opened.
… …
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 - toggling the lowest bit reverses direction
56enum { 56enum
57{
57 TILE_NORTH, 58 TILE_NORTH,
58 TILE_EAST,
59 TILE_SOUTH, 59 TILE_SOUTH,
60 TILE_WEST, 60 TILE_WEST,
61 TILE_EAST,
61 TILE_UP, 62 TILE_UP,
62 TILE_DOWN, 63 TILE_DOWN,
63 TILE_NUM, 64 TILE_NUM
64}; 65};
66
67#define REVERSE_TILE_DIR(dir) ((dir) ^ 1)
65 68
66/* Values for state below */ 69/* Values for state below */
67enum { 70enum
71{
68 MAP_SWAPPED, // header loaded, nothing else 72 MAP_SWAPPED, // header loaded, nothing else
69 MAP_INACTIVE, // in memory, linkable, but not active 73 MAP_INACTIVE, // in memory, linkable, but not active
70 MAP_ACTIVE, // running! 74 MAP_ACTIVE, // running!
71}; 75};
72 76
… …
89 * should almost always be using out_of_map instead, which takes into account 93 * should almost always be using out_of_map instead, which takes into account
90 * map tiling. 94 * map tiling.
91 */ 95 */
92#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height))) 96#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))
93 97
94/* These are used in the MapLook flags element. They are not used in 98/* These are used in the mapspace flags element. They are not used in
95 * in the object flags structure. 99 * in the object flags structure.
96 */ 100 */
97#define P_BLOCKSVIEW 0x01 101#define P_BLOCKSVIEW 0x01
98#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ 102#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */
99#define P_NO_CLERIC 0x04 /* no clerical spells cast here */ 103#define P_NO_CLERIC 0x04 /* no clerical spells cast here */
… …
113 * function that does more of the work can hopefully be used to replace 117 * function that does more of the work can hopefully be used to replace
114 * lots of duplicate checks currently in the code. 118 * lots of duplicate checks currently in the code.
115 */ 119 */
116#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ 120#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */
117#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ 121#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */
122
123// persistent flags (pflags) in mapspace
124enum
125{
126 PF_VIS_UP = 0x01, // visible upwards, set by upmap, cleared by mapspace
127};
118 128
119/* Instead of having numerous arrays that have information on a 129/* Instead of having numerous arrays that have information on a
120 * particular space (was map, floor, floor2, map_ob), 130 * particular space (was map, floor, floor2, map_ob),
121 * have this structure take care of that information. 131 * have this structure take care of that information.
122 * This puts it all in one place, and should also make it easier 132 * This puts it all in one place, and should also make it easier
… …
137 uint16_t ACC (RW, items_); // saturates at 64k 147 uint16_t ACC (RW, items_); // saturates at 64k
138 uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) 148 uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024)
139 uint32_t ACC (RW, smell); // the last count a player was seen here, or 0 149 uint32_t ACC (RW, smell); // the last count a player was seen here, or 0
140 static uint32_t ACC (RW, smellcount); // global smell counter 150 static uint32_t ACC (RW, smellcount); // global smell counter
141 151
152 uint8_t pflags; // additional, persistent flags
142 uint32_t pad1_; // pad to 64 bytes on 64 bit systems 153 uint8_t pad [3]; // pad to 64 bytes on LP64 systems
143 154
144//-GPL 155//-GPL
145 156
146 void update_ (); 157 void update_ ();
147 MTH void update () 158 MTH void update ()
148 { 159 {
149 // we take advantage of the fact that 0x80 is the sign bit 160 // we take advantage of the fact that 0x80 is the sign bit
150 // to generate more efficient code on many cpus 161 // to generate more efficient code on many cpus
151 assert (sint8 (P_UPTODATE) < 0); 162 //assert (sint8 (P_UPTODATE) < 0);
152 assert (sint8 (-1 & ~P_UPTODATE) >= 0); 163 //assert (sint8 (-1 & ~P_UPTODATE) >= 0);
153 164
154 if (expect_false (sint8 (flags_) >= 0)) 165 if (expect_false (sint8 (flags_) >= 0))
155 update_ (); 166 update_ ();
156 167
157 // must be true by now (gcc seems content with only the second test) 168 // must be true by now (gcc seems content with only the second test)
158 assume (sint8 (flags_) < 0); 169 ecb_assume (sint8 (flags_) < 0);
159 assume (flags_ & P_UPTODATE); 170 ecb_assume (flags_ & P_UPTODATE);
160 } 171 }
161 172
162 MTH uint8 flags () 173 MTH uint8 flags ()
163 { 174 {
164 update (); 175 update ();
165 return flags_; 176 return flags_;
166 } 177 }
167 178
179 MTH void update_up ();
180
168 MTH void invalidate () 181 MTH void invalidate ()
169 { 182 {
170 flags_ = 0; 183 flags_ = 0;
171 } 184
185 if (pflags)
186 update_up ();
172 187 }
188
173 MTH object *player () 189 MTH object *player ()
174 { 190 {
175 object *op; 191 object *op;
176 192
177 if (flags () & P_PLAYER) 193 if (flags () & P_PLAYER)
… …
188 update (); 204 update ();
189 return items_; 205 return items_;
190 } 206 }
191 207
192 // return the item volume on this mapspace in cm³ 208 // return the item volume on this mapspace in cm³
193 MTH uint64 volume () 209 MTH volume_t volume ()
194 { 210 {
195 update (); 211 update ();
196 return volume_ * 1024; 212 return volume_ * 1024;
197 } 213 }
198 214
… …
233struct shopitems : zero_initialised 249struct shopitems : zero_initialised
234{ 250{
235 const char *name; /* name of the item in question, null if it is the default item */ 251 const char *name; /* name of the item in question, null if it is the default item */
236 const char *name_pl; /* plural name */ 252 const char *name_pl; /* plural name */
237 int typenum; /* itemtype number we need to match 0 if it is the default price */ 253 int typenum; /* itemtype number we need to match 0 if it is the default price */
238 sint8 strength; /* the degree of specialisation the shop has in this item, 254 sint8 strength; /* the degree of specialisation the shop has in this item,
239 * as a percentage from -100 to 100 */ 255 * as a percentage from -100 to 100 */
240 int index; /* being the size of the shopitems array. */ 256 int index; /* being the size of the shopitems array. */
241}; 257};
242 258
243// map I/O, what to load/save 259// map I/O, what to load/save
… …
245 IO_HEADER = 0x01, // the "arch map" pseudo object 261 IO_HEADER = 0x01, // the "arch map" pseudo object
246 IO_OBJECTS = 0x02, // the non-unique objects 262 IO_OBJECTS = 0x02, // the non-unique objects
247 IO_UNIQUES = 0x04, // unique objects 263 IO_UNIQUES = 0x04, // unique objects
248}; 264};
249 265
250/* In general, code should always use the macros 266/* In general, code should always use the macros
251 * above (or functions in map.c) to access many of the 267 * above (or functions in map.c) to access many of the
252 * values in the map structure. Failure to do this will 268 * values in the map structure. Failure to do this will
253 * almost certainly break various features. You may think 269 * almost certainly break various features. You may think
254 * it is safe to look at width and height values directly 270 * it is safe to look at width and height values directly
255 * (or even through the macros), but doing so will completely 271 * (or even through the macros), but doing so will completely
256 * break map tiling. 272 * break map tiling.
… …
264 region_ptr *regionmap; /* index to region */ 280 region_ptr *regionmap; /* index to region */
265 281
266 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ 282 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
267 283
268 shstr ACC (RW, name); /* Name of map as given by its creator */ 284 shstr ACC (RW, name); /* Name of map as given by its creator */
269 region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by 285 region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
270 * points to the struct containing all the properties of 286 * points to the struct containing all the properties of
271 * the region */ 287 * the region */
272 double ACC (RW, reset_time); 288 double ACC (RW, reset_time);
273 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map 289 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
274 * should be reset 290 * should be reset
275 */ 291 */
… …
304 shstr ACC (RW, msg); /* Message map creator may have left */ 320 shstr ACC (RW, msg); /* Message map creator may have left */
305 shstr ACC (RW, maplore); /* Map lore information */ 321 shstr ACC (RW, maplore); /* Map lore information */
306 shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */ 322 shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
307 maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */ 323 maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */
308 shstr ACC (RW, path); /* Filename of the map */ 324 shstr ACC (RW, path); /* Filename of the map */
309 uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace 325 volume_t ACC (RW, max_volume); // maximum volume for all items on a mapspace
310 int ACC (RW, max_items); // maximum number of items on a mapspace 326 int ACC (RW, max_items); // maximum number of items on a mapspace
311 327
312//-GPL 328//-GPL
313 329
314 physics_queue pq[PHYSICS_QUEUES]; 330 physics_queue pq[PHYSICS_QUEUES];
315 MTH void queue_physics (object *ob, int after = 0); 331 MTH void queue_physics (object *ob, int after = 0);
316 MTH void queue_physics_at (int x, int y); 332 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); 333 MTH int run_physics (tick_t tick, int max_objects);
334 MTH void activate_physics ();
319 335
320 // the maptile:: is neccessary here for the perl interface to work 336 // the maptile:: is neccessary here for the perl interface to work
321 MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const 337 MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
322 { 338 {
323 return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); 339 return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
… …
389 405
390 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 406 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
391 407
392 MTH void touch () { last_access = runtime; } 408 MTH void touch () { last_access = runtime; }
393 409
410 // returns the map at given direction. if the map isn't linked yet,
411 // it will either return false (if load is false), or otherwise try to link
412 // it - if linking fails because the map is not loaded yet, it will
413 // start loading the map and return 0.
414 // thus, if you get 0, the map exists and load is true, then some later
415 // call (some tick or so later...) will eventually succeed.
394 MTH maptile *tile_available (int dir, bool load = true); 416 MTH maptile *tile_available (int dir, bool load = true);
395 417
396 // find the map that is at coordinate x|y relative to this map 418 // find the map that is at coordinate x|y relative to this map
397 // TODO: need a better way than passing by reference 419 // TODO: need a better way than passing by reference
398 // TODO: make perl interface 420 // TODO: make perl interface
… …
505 return *this; 527 return *this;
506 } 528 }
507 529
508 mapxy &move (int dir) 530 mapxy &move (int dir)
509 { 531 {
510 return move (freearr_x [dir], freearr_y [dir]); 532 return move (DIRX (dir), DIRY (dir));
511 } 533 }
512 534
513 operator void *() const { return (void *)m; } 535 operator void *() const { return (void *)m; }
514 mapxy &operator =(const object *op) 536 mapxy &operator =(const object *op)
515 { 537 {
… …
578 } \ 600 } \
579 } 601 }
580 602
581extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations 603extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
582 604
605// special "grave" map used to store all removed objects
606// till they can be destroyed - saves a lot of checks in the rest
607// of the code
608struct freed_map
609: maptile
610{
611 freed_map ()
612 : maptile (3, 3)
613 {
614 path = "<freed objects map>";
615 name = "/internal/freed_objects_map";
616 no_drop = 1;
617 no_reset = 1;
618
619 state = MAP_ACTIVE;
620 }
621
622 ~freed_map ()
623 {
624 destroy ();
625 }
626};
627
628// initialised in common/shstr.C, due to shstr usage we need defined
629// initialisation order!
630extern struct freed_map freed_map; // freed objects are moved here to avoid crashes
631
583// loop over every space in the given maprect, 632// loop over every space in the given maprect,
584// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 633// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
585// the iterator code must be a single statement following this macro call, similar to "if" 634// the iterator code must be a single statement following this macro call, similar to "if"
586// "continue" will skip to the next space 635// "continue" will skip to the next space
587#define rect_mapwalk(rect,dx0,dy0) \ 636#define rect_mapwalk(rect,dx0,dy0) \

Diff Legend

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