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.78 by root, Sun Jul 1 05:00:18 2007 UTC vs.
Revision 1.93 by root, Tue May 6 16:55:26 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your 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,
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 GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24/* 24/*
25 * The maptile is allocated each time a new map is opened. 25 * The maptile is allocated each time a new map is opened.
26 * It contains pointers (very indirectly) to all objects on the map. 26 * It contains pointers (very indirectly) to all objects on the map.
29#ifndef MAP_H 29#ifndef MAP_H
30#define MAP_H 30#define MAP_H
31 31
32#include <tr1/unordered_map> 32#include <tr1/unordered_map>
33 33
34#include "region.h"
34#include "cfperl.h" 35#include "cfperl.h"
35 36
36/* We set this size - this is to make magic map work properly on 37/* We set this size - this is to make magic map work properly on
37 * tiled maps. There is no requirement that this matches the 38 * tiled maps. There is no requirement that this matches the
38 * tiled maps size - it just seemed like a reasonable value. 39 * tiled maps size - it just seemed like a reasonable value.
46#define MAGIC_MAP_SIZE 50 47#define MAGIC_MAP_SIZE 50
47#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 48#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
48 49
49#define MAP_LAYERS 3 50#define MAP_LAYERS 3
50 51
51/* Values for in_memory below. Should probably be an enumerations */ 52/* Values for in_memory below */
52enum { 53enum {
53 MAP_IN_MEMORY, 54 MAP_ACTIVE,
55 MAP_INACTIVE, // not used atm.
54 MAP_SWAPPED, 56 MAP_SWAPPED,
55 MAP_LOADING, 57 MAP_LOADING,
56 MAP_SAVING, 58 MAP_SAVING,
57}; 59};
58 60
102 */ 104 */
103#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ 105#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */
104#define P_NEW_MAP 0x20000 106#define P_NEW_MAP 0x20000
105 /* Coordinates passed result in a new tiled map */ 107 /* Coordinates passed result in a new tiled map */
106 108
107/* P_NO_PASS is used for ob_blocked() return value. It needs
108 * to be here to make sure the bits don't match with anything.
109 */
110#define P_NO_PASS 0x80000
111
112/* Instead of having numerous arrays that have information on a 109/* Instead of having numerous arrays that have information on a
113 * particular space (was map, floor, floor2, map_ob), 110 * particular space (was map, floor, floor2, map_ob),
114 * have this structure take care of that information. 111 * have this structure take care of that information.
115 * This puts it all in one place, and should also make it easier 112 * This puts it all in one place, and should also make it easier
116 * to extend information about a space. 113 * to extend information about a space.
153 return 0; 150 return 0;
154 } 151 }
155 152
156 // return the item volume on this mapspace in cm³ 153 // return the item volume on this mapspace in cm³
157 uint64 volume () const; 154 uint64 volume () const;
155
156 bool blocks (MoveType mt) const
157 {
158 return move_block && (mt & move_block) == mt;
159 }
158}; 160};
159 161
160struct shopitems : zero_initialised 162struct shopitems : zero_initialised
161{ 163{
162 const char *name; /* name of the item in question, null if it is the default item */ 164 const char *name; /* name of the item in question, null if it is the default item */
186struct maptile : zero_initialised, attachable 188struct maptile : zero_initialised, attachable
187{ 189{
188 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ 190 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
189 struct mapspace *spaces; /* Array of spaces on this map */ 191 struct mapspace *spaces; /* Array of spaces on this map */
190 uint8 *regions; /* region index per mapspace, if != 0 */ 192 uint8 *regions; /* region index per mapspace, if != 0 */
191 struct region **regionmap; /* index to region */ 193 region_ptr *regionmap; /* index to region */
192 194
193 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ 195 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
194 196
195 shstr ACC (RW, name); /* Name of map as given by its creator */ 197 shstr ACC (RW, name); /* Name of map as given by its creator */
196 struct region *ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by 198 region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
197 * points to the struct containing all the properties of 199 * points to the struct containing all the properties of
198 * the region */ 200 * the region */
199 double ACC (RW, reset_time); 201 double ACC (RW, reset_time);
200 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map 202 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
201 * should be reset 203 * should be reset
211 * be loaded before used. The map,omap and map_ob 213 * be loaded before used. The map,omap and map_ob
212 * arrays will be allocated when the map is loaded */ 214 * arrays will be allocated when the map is loaded */
213 sint16 players; /* How many players are on this map right now */ 215 sint16 players; /* How many players are on this map right now */
214 uint16 ACC (RW, difficulty); /* What level the player should be to play here */ 216 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
215 217
216 bool ACC (RW, active); // wether this map is active or not
217 bool ACC (RW, per_player); 218 bool ACC (RW, per_player);
218 bool ACC (RW, per_party); 219 bool ACC (RW, per_party);
219 bool ACC (RW, outdoor); /* True if an outdoor map */ 220 bool ACC (RW, outdoor); /* True if an outdoor map */
220 bool ACC (RW, nodrop); /* avoid dropping anything on this map */ 221 bool ACC (RW, nodrop); /* avoid dropping anything on this map */
221 uint8 ACC (RW, darkness); /* indicates level of darkness of map */ 222 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
257 MTH int change_map_light (int change); 258 MTH int change_map_light (int change);
258 static void change_all_map_light (int change); //PERL 259 static void change_all_map_light (int change); //PERL
259 MTH void set_darkness_map (); 260 MTH void set_darkness_map ();
260 MTH int estimate_difficulty () const; 261 MTH int estimate_difficulty () const;
261 262
263 MTH void play_sound (faceidx sound, int x, int y) const;
264
262 // set the given flag on all objects in the map 265 // set the given flag on all objects in the map
263 MTH void set_object_flag (int flag, int value = 1); 266 MTH void set_object_flag (int flag, int value = 1);
264 267
265 MTH void link_multipart_objects (); 268 MTH void link_multipart_objects ();
266 MTH void clear_unique_items (); 269 MTH void clear_unique_items ();
268 MTH void clear_header (); 271 MTH void clear_header ();
269 MTH void clear_links_to (maptile *m); 272 MTH void clear_links_to (maptile *m);
270 273
271 MTH struct region *region (int x, int y) const; 274 MTH struct region *region (int x, int y) const;
272 275
273 // loas the header pseudo-object 276 // load the header pseudo-object
274 bool _load_header (object_thawer &thawer); 277 bool _load_header (object_thawer &thawer);
275 MTH bool _load_header (const char *path); 278 MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); }
276 279
277 // load objects into the map 280 // load objects into the map
278 bool _load_objects (object_thawer &thawer); 281 bool _load_objects (object_thawer &thawer);
279 MTH bool _load_objects (const char *path, bool skip_header = true); 282 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
280 283
281 // save objects into the given file (uses IO_ flags) 284 // save objects into the given file (uses IO_ flags)
282 bool _save_objects (object_freezer &freezer, int flags); 285 bool _save_objects (object_freezer &freezer, int flags);
283 MTH bool _save_objects (const char *path, int flags); 286 MTH bool _save_objects (const char *path, int flags);
284 287
296 MTH int size () const { return width * height; } 299 MTH int size () const { return width * height; }
297 300
298 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 301 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
299 302
300 MTH void touch () { last_access = runtime; } 303 MTH void touch () { last_access = runtime; }
304
305 MTH bool tile_available (int dir, bool load = true);
301 306
302 // find the map that is at coordinate x|y relative to this map 307 // find the map that is at coordinate x|y relative to this map
303 // TODO: need a better way than passing by reference 308 // TODO: need a better way than passing by reference
304 // TODO: make perl interface 309 // TODO: make perl interface
305 maptile *xy_find (sint16 &x, sint16 &y); 310 maptile *xy_find (sint16 &x, sint16 &y);
317 } 322 }
318 323
319 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); 324 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
320 bool generate_random_map (random_map_params *RP); 325 bool generate_random_map (random_map_params *RP);
321 326
322 static maptile *find_async (const char *path, maptile *original = 0);//PERL 327 static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL
323 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 328 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
324 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL 329 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
325 MTH object *pick_random_object () const; 330 object *pick_random_object (rand_gen &gen = rndm) const;
326 331
327 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 332 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
328 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } 333 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
329}; 334};
330 335
344 int distance_y; 349 int distance_y;
345 int direction; 350 int direction;
346 object *part; 351 object *part;
347}; 352};
348 353
354// comaptibility cruft start
349//TODO: these should be refactored into things like xy_normalise 355//TODO: these should be refactored into things like xy_normalise
350// and so on. 356// and so on.
351int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); 357int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
352int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
353int out_of_map (maptile *m, int x, int y); 358int out_of_map (maptile *m, int x, int y);
354maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); 359maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
355void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); 360void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
356void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); 361void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
357int on_same_map (const object *op1, const object *op2); 362int on_same_map (const object *op1, const object *op2);
358int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); 363int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
359 364
360// adjust map, x and y for tiled maps and return true if the position is valid at all 365// adjust map, x and y for tiled maps and return true if the position is valid at all
361inline bool 366static inline bool
362xy_normalise (maptile *&map, sint16 &x, sint16 &y) 367xy_normalise (maptile *&map, sint16 &x, sint16 &y)
363{ 368{
364 // when in range, do a quick return, otherwise go the slow route 369 // when in range, do a quick return, otherwise go the slow route
365 return 370 return
366 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) 371 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
367 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); 372 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
368} 373}
374// comaptibility cruft end
369 375
370inline mapspace & 376inline mapspace &
371object::ms () const 377object::ms () const
372{ 378{
373 return map->at (x, y); 379 return map->at (x, y);
374} 380}
375 381
382struct mapxy {
383 maptile *m;
384 sint16 x, y;
385
386 mapxy (maptile *m, sint16 x, sint16 y)
387 : m(m), x(x), y(y)
388 { }
389
390 mapxy (object *op)
391 : m(op->map), x(op->x), y(op->y)
392 { }
393
394 mapxy &move (int dx, int dy)
395 {
396 x += dx;
397 y += dy;
398
399 return *this;
400 }
401
402 mapxy &move (int dir)
403 {
404 return move (freearr_x [dir], freearr_y [dir]);
405 }
406
407 operator void *() const { return (void *)m; }
408 mapxy &operator =(const object *op)
409 {
410 m = op->map;
411 x = op->x;
412 y = op->y;
413
414 return *this;
415 }
416
417 mapspace *operator ->() const { return &m->at (x, y); }
418 mapspace &operator * () const { return m->at (x, y); }
419
420 bool normalise ()
421 {
422 return xy_normalise (m, x, y);
423 }
424
425 object *insert (object *op, object *originator = 0, int flags = 0) const
426 {
427 m->insert (op, x, y, originator, flags);
428 }
429};
430
431inline const mapxy &
432object::operator =(const mapxy &pos)
433{
434 map = pos.m;
435 x = pos.x;
436 y = pos.y;
437
438 return pos;
439}
440
376#endif 441#endif
377 442

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines