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.146 by root, Sun May 8 11:32:12 2011 UTC vs.
Revision 1.154 by root, Sun Jan 29 02:47:05 2017 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.
55// tile map index - toggling the lowest bit reverses direction 55// tile map index - toggling the lowest bit reverses direction
56enum 56enum
57{ 57{
58 TILE_NORTH, 58 TILE_NORTH,
59 TILE_SOUTH, 59 TILE_SOUTH,
60 TILE_EAST ,
61 TILE_WEST, 60 TILE_WEST,
61 TILE_EAST,
62 TILE_UP, 62 TILE_UP,
63 TILE_DOWN, 63 TILE_DOWN,
64 TILE_NUM 64 TILE_NUM
65}; 65};
66 66
204 update (); 204 update ();
205 return items_; 205 return items_;
206 } 206 }
207 207
208 // return the item volume on this mapspace in cm³ 208 // return the item volume on this mapspace in cm³
209 MTH uint64 volume () 209 MTH volume_t volume ()
210 { 210 {
211 update (); 211 update ();
212 return volume_ * 1024; 212 return volume_ * 1024;
213 } 213 }
214 214
249struct shopitems : zero_initialised 249struct shopitems : zero_initialised
250{ 250{
251 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 */
252 const char *name_pl; /* plural name */ 252 const char *name_pl; /* plural name */
253 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 */
254 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,
255 * as a percentage from -100 to 100 */ 255 * as a percentage from -100 to 100 */
256 int index; /* being the size of the shopitems array. */ 256 int index; /* being the size of the shopitems array. */
257}; 257};
258 258
259// map I/O, what to load/save 259// map I/O, what to load/save
261 IO_HEADER = 0x01, // the "arch map" pseudo object 261 IO_HEADER = 0x01, // the "arch map" pseudo object
262 IO_OBJECTS = 0x02, // the non-unique objects 262 IO_OBJECTS = 0x02, // the non-unique objects
263 IO_UNIQUES = 0x04, // unique objects 263 IO_UNIQUES = 0x04, // unique objects
264}; 264};
265 265
266/* In general, code should always use the macros 266/* In general, code should always use the macros
267 * above (or functions in map.c) to access many of the 267 * above (or functions in map.c) to access many of the
268 * values in the map structure. Failure to do this will 268 * values in the map structure. Failure to do this will
269 * almost certainly break various features. You may think 269 * almost certainly break various features. You may think
270 * it is safe to look at width and height values directly 270 * it is safe to look at width and height values directly
271 * (or even through the macros), but doing so will completely 271 * (or even through the macros), but doing so will completely
272 * break map tiling. 272 * break map tiling.
280 region_ptr *regionmap; /* index to region */ 280 region_ptr *regionmap; /* index to region */
281 281
282 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 */
283 283
284 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 */
285 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
286 * points to the struct containing all the properties of 286 * points to the struct containing all the properties of
287 * the region */ 287 * the region */
288 double ACC (RW, reset_time); 288 double ACC (RW, reset_time);
289 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
290 * should be reset 290 * should be reset
291 */ 291 */
320 shstr ACC (RW, msg); /* Message map creator may have left */ 320 shstr ACC (RW, msg); /* Message map creator may have left */
321 shstr ACC (RW, maplore); /* Map lore information */ 321 shstr ACC (RW, maplore); /* Map lore information */
322 shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */ 322 shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
323 maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */ 323 maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */
324 shstr ACC (RW, path); /* Filename of the map */ 324 shstr ACC (RW, path); /* Filename of the map */
325 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
326 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
327 327
328//-GPL 328//-GPL
329 329
330 physics_queue pq[PHYSICS_QUEUES]; 330 physics_queue pq[PHYSICS_QUEUES];
331 MTH void queue_physics (object *ob, int after = 0); 331 MTH void queue_physics (object *ob, int after = 0);
332 MTH void queue_physics_at (int x, int y); 332 MTH void queue_physics_at (int x, int y);
333 MTH void post_load_physics ();
334 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 ();
335 335
336 // the maptile:: is neccessary here for the perl interface to work 336 // the maptile:: is neccessary here for the perl interface to work
337 MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const 337 MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
338 { 338 {
339 return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); 339 return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
340 } 340 }
341 341
342 static void adjust_daylight (); 342 static void adjust_daylight ();
343 343
344 MTH void activate (); 344 MTH void activate ();
345 MTH void activate_physics ();
346 MTH void deactivate (); 345 MTH void deactivate ();
347 346
348 // allocates all (empty) mapspace 347 // allocates all (empty) mapspace
349 MTH void alloc (); 348 MTH void alloc ();
350 // deallocates the mapspaces (and destroys all objects) 349 // deallocates the mapspaces (and destroys all objects)
601 } \ 600 } \
602 } 601 }
603 602
604extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations 603extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
605 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
606// loop over every space in the given maprect, 632// loop over every space in the given maprect,
607// 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
608// 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"
609// "continue" will skip to the next space 635// "continue" will skip to the next space
610#define rect_mapwalk(rect,dx0,dy0) \ 636#define rect_mapwalk(rect,dx0,dy0) \

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines