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.83 by root, Wed Aug 15 04:57:48 2007 UTC vs.
Revision 1.95 by root, Sat May 17 14:11:13 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.
47#define MAGIC_MAP_SIZE 50 47#define MAGIC_MAP_SIZE 50
48#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 48#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
49 49
50#define MAP_LAYERS 3 50#define MAP_LAYERS 3
51 51
52/* Values for in_memory below. Should probably be an enumerations */ 52/* Values for in_memory below */
53enum { 53enum {
54 MAP_IN_MEMORY, 54 MAP_ACTIVE,
55 MAP_INACTIVE, // not used atm.
55 MAP_SWAPPED, 56 MAP_SWAPPED,
56 MAP_LOADING, 57 MAP_LOADING,
57 MAP_SAVING, 58 MAP_SAVING,
58}; 59};
59 60
103 */ 104 */
104#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 */
105#define P_NEW_MAP 0x20000 106#define P_NEW_MAP 0x20000
106 /* Coordinates passed result in a new tiled map */ 107 /* Coordinates passed result in a new tiled map */
107 108
108/* P_NO_PASS is used for ob_blocked() return value. It needs
109 * to be here to make sure the bits don't match with anything.
110 */
111#define P_NO_PASS 0x80000
112
113/* Instead of having numerous arrays that have information on a 109/* Instead of having numerous arrays that have information on a
114 * particular space (was map, floor, floor2, map_ob), 110 * particular space (was map, floor, floor2, map_ob),
115 * have this structure take care of that information. 111 * have this structure take care of that information.
116 * 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
117 * to extend information about a space. 113 * to extend information about a space.
154 return 0; 150 return 0;
155 } 151 }
156 152
157 // return the item volume on this mapspace in cm³ 153 // return the item volume on this mapspace in cm³
158 uint64 volume () const; 154 uint64 volume () const;
155
156 bool blocks (MoveType mt) const
157 {
158 return move_block && (mt & move_block) == mt;
159 }
160
161 bool blocks (object *op) const
162 {
163 return blocks (op->move_type);
164 }
159}; 165};
160 166
161struct shopitems : zero_initialised 167struct shopitems : zero_initialised
162{ 168{
163 const char *name; /* name of the item in question, null if it is the default item */ 169 const char *name; /* name of the item in question, null if it is the default item */
215 uint16 ACC (RW, difficulty); /* What level the player should be to play here */ 221 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
216 222
217 bool ACC (RW, per_player); 223 bool ACC (RW, per_player);
218 bool ACC (RW, per_party); 224 bool ACC (RW, per_party);
219 bool ACC (RW, outdoor); /* True if an outdoor map */ 225 bool ACC (RW, outdoor); /* True if an outdoor map */
220 bool ACC (RW, nodrop); /* avoid dropping anything on this map */ 226 bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */
221 uint8 ACC (RW, darkness); /* indicates level of darkness of map */ 227 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
222 228
223 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ 229 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
224 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ 230 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
225 oblinkpt *buttons; /* Linked list of linked lists of buttons */ 231 oblinkpt *buttons; /* Linked list of linked lists of buttons */
270 MTH void clear_header (); 276 MTH void clear_header ();
271 MTH void clear_links_to (maptile *m); 277 MTH void clear_links_to (maptile *m);
272 278
273 MTH struct region *region (int x, int y) const; 279 MTH struct region *region (int x, int y) const;
274 280
275 // loas the header pseudo-object 281 // load the header pseudo-object
276 bool _load_header (object_thawer &thawer); 282 bool _load_header (object_thawer &thawer);
277 MTH bool _load_header (const char *path); 283 MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); }
278 284
279 // load objects into the map 285 // load objects into the map
280 bool _load_objects (object_thawer &thawer); 286 bool _load_objects (object_thawer &thawer);
281 MTH bool _load_objects (const char *path, bool skip_header = true); 287 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
282 288
283 // save objects into the given file (uses IO_ flags) 289 // save objects into the given file (uses IO_ flags)
284 bool _save_objects (object_freezer &freezer, int flags); 290 bool _save_objects (object_freezer &freezer, int flags);
285 MTH bool _save_objects (const char *path, int flags); 291 MTH bool _save_objects (const char *path, int flags);
286 292
298 MTH int size () const { return width * height; } 304 MTH int size () const { return width * height; }
299 305
300 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 306 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
301 307
302 MTH void touch () { last_access = runtime; } 308 MTH void touch () { last_access = runtime; }
309
310 MTH bool tile_available (int dir, bool load = true);
303 311
304 // find the map that is at coordinate x|y relative to this map 312 // find the map that is at coordinate x|y relative to this map
305 // TODO: need a better way than passing by reference 313 // TODO: need a better way than passing by reference
306 // TODO: make perl interface 314 // TODO: make perl interface
307 maptile *xy_find (sint16 &x, sint16 &y); 315 maptile *xy_find (sint16 &x, sint16 &y);
319 } 327 }
320 328
321 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); 329 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
322 bool generate_random_map (random_map_params *RP); 330 bool generate_random_map (random_map_params *RP);
323 331
324 static maptile *find_async (const char *path, maptile *original = 0);//PERL 332 static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL
325 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 333 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
326 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL 334 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
327 MTH object *pick_random_object () const; 335 object *pick_random_object (rand_gen &gen = rndm) const;
328 336
329 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 337 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
330 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } 338 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
331}; 339};
332 340
346 int distance_y; 354 int distance_y;
347 int direction; 355 int direction;
348 object *part; 356 object *part;
349}; 357};
350 358
359// comaptibility cruft start
351//TODO: these should be refactored into things like xy_normalise 360//TODO: these should be refactored into things like xy_normalise
352// and so on. 361// and so on.
353int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); 362int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
354int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
355int out_of_map (maptile *m, int x, int y); 363int out_of_map (maptile *m, int x, int y);
356maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); 364maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
357void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); 365void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
358void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); 366void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
359int on_same_map (const object *op1, const object *op2); 367int on_same_map (const object *op1, const object *op2);
360int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); 368int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
361 369
362// adjust map, x and y for tiled maps and return true if the position is valid at all 370// adjust map, x and y for tiled maps and return true if the position is valid at all
363inline bool 371static inline bool
364xy_normalise (maptile *&map, sint16 &x, sint16 &y) 372xy_normalise (maptile *&map, sint16 &x, sint16 &y)
365{ 373{
366 // when in range, do a quick return, otherwise go the slow route 374 // when in range, do a quick return, otherwise go the slow route
367 return 375 return
368 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) 376 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
369 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); 377 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
370} 378}
379// comaptibility cruft end
371 380
372inline mapspace & 381inline mapspace &
373object::ms () const 382object::ms () const
374{ 383{
375 return map->at (x, y); 384 return map->at (x, y);
376} 385}
377 386
387struct mapxy {
388 maptile *m;
389 sint16 x, y;
390
391 mapxy (maptile *m, sint16 x, sint16 y)
392 : m(m), x(x), y(y)
393 { }
394
395 mapxy (object *op)
396 : m(op->map), x(op->x), y(op->y)
397 { }
398
399 mapxy &move (int dx, int dy)
400 {
401 x += dx;
402 y += dy;
403
404 return *this;
405 }
406
407 mapxy &move (int dir)
408 {
409 return move (freearr_x [dir], freearr_y [dir]);
410 }
411
412 operator void *() const { return (void *)m; }
413 mapxy &operator =(const object *op)
414 {
415 m = op->map;
416 x = op->x;
417 y = op->y;
418
419 return *this;
420 }
421
422 mapspace *operator ->() const { return &m->at (x, y); }
423 mapspace &operator * () const { return m->at (x, y); }
424
425 bool normalise ()
426 {
427 return xy_normalise (m, x, y);
428 }
429
430 mapspace &ms () const
431 {
432 return m->at (x, y);
433 }
434
435 object *insert (object *op, object *originator = 0, int flags = 0) const
436 {
437 return m->insert (op, x, y, originator, flags);
438 }
439};
440
441inline const mapxy &
442object::operator =(const mapxy &pos)
443{
444 map = pos.m;
445 x = pos.x;
446 y = pos.y;
447
448 return pos;
449}
450
378#endif 451#endif
379 452

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines