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.86 by root, Fri Aug 31 00:20:41 2007 UTC vs.
Revision 1.96 by root, Mon Jul 14 16:42:49 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 */
261 267
262 MTH void play_sound (faceidx sound, int x, int y) const; 268 MTH void play_sound (faceidx sound, int x, int y) const;
263 269
264 // set the given flag on all objects in the map 270 // set the given flag on all objects in the map
265 MTH void set_object_flag (int flag, int value = 1); 271 MTH void set_object_flag (int flag, int value = 1);
272 MTH void post_load_original ();
266 273
267 MTH void link_multipart_objects (); 274 MTH void link_multipart_objects ();
268 MTH void clear_unique_items (); 275 MTH void clear_unique_items ();
269 276
270 MTH void clear_header (); 277 MTH void clear_header ();
271 MTH void clear_links_to (maptile *m); 278 MTH void clear_links_to (maptile *m);
272 279
273 MTH struct region *region (int x, int y) const; 280 MTH struct region *region (int x, int y) const;
274 281
275 // loas the header pseudo-object 282 // load the header pseudo-object
276 bool _load_header (object_thawer &thawer); 283 bool _load_header (object_thawer &thawer);
277 MTH bool _load_header (const char *path); 284 MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); }
278 285
279 // load objects into the map 286 // load objects into the map
280 bool _load_objects (object_thawer &thawer); 287 bool _load_objects (object_thawer &thawer);
281 MTH bool _load_objects (const char *path, bool skip_header = true); 288 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
282 289
283 // save objects into the given file (uses IO_ flags) 290 // save objects into the given file (uses IO_ flags)
284 bool _save_objects (object_freezer &freezer, int flags); 291 bool _save_objects (object_freezer &freezer, int flags);
285 MTH bool _save_objects (const char *path, int flags); 292 MTH bool _save_objects (const char *path, int flags);
286 293
324 bool generate_random_map (random_map_params *RP); 331 bool generate_random_map (random_map_params *RP);
325 332
326 static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL 333 static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL
327 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 334 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
328 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL 335 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
329 MTH object *pick_random_object () const; 336 object *pick_random_object (rand_gen &gen = rndm) const;
330 337
331 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 338 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
332 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } 339 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
333}; 340};
334 341
348 int distance_y; 355 int distance_y;
349 int direction; 356 int direction;
350 object *part; 357 object *part;
351}; 358};
352 359
360// comaptibility cruft start
353//TODO: these should be refactored into things like xy_normalise 361//TODO: these should be refactored into things like xy_normalise
354// and so on. 362// and so on.
355int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); 363int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
356int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
357int out_of_map (maptile *m, int x, int y); 364int out_of_map (maptile *m, int x, int y);
358maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); 365maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
359void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); 366void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
360void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); 367void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
361int on_same_map (const object *op1, const object *op2); 368int on_same_map (const object *op1, const object *op2);
362int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); 369int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
363 370
364// adjust map, x and y for tiled maps and return true if the position is valid at all 371// adjust map, x and y for tiled maps and return true if the position is valid at all
365inline bool 372static inline bool
366xy_normalise (maptile *&map, sint16 &x, sint16 &y) 373xy_normalise (maptile *&map, sint16 &x, sint16 &y)
367{ 374{
368 // when in range, do a quick return, otherwise go the slow route 375 // when in range, do a quick return, otherwise go the slow route
369 return 376 return
370 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) 377 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
371 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); 378 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
372} 379}
380// comaptibility cruft end
373 381
374inline mapspace & 382inline mapspace &
375object::ms () const 383object::ms () const
376{ 384{
377 return map->at (x, y); 385 return map->at (x, y);
378} 386}
379 387
380// not used anywhere *yet*
381struct mapxy { 388struct mapxy {
382 maptile *m; 389 maptile *m;
383 sint16 x, y; 390 sint16 x, y;
384 391
385 mapxy (maptile *m, sint16 x, sint16 y) 392 mapxy (maptile *m, sint16 x, sint16 y)
388 395
389 mapxy (object *op) 396 mapxy (object *op)
390 : m(op->map), x(op->x), y(op->y) 397 : m(op->map), x(op->x), y(op->y)
391 { } 398 { }
392 399
400 mapxy &move (int dx, int dy)
401 {
402 x += dx;
403 y += dy;
404
405 return *this;
406 }
407
393 mapxy &move (int dir) 408 mapxy &move (int dir)
394 { 409 {
395 x += freearr_x [dir]; 410 return move (freearr_x [dir], freearr_y [dir]);
396 y += freearr_y [dir];
397
398 return *this;
399 } 411 }
400 412
401 operator void *() const { return (void *)m; } 413 operator void *() const { return (void *)m; }
402 mapxy &operator =(const object *op) 414 mapxy &operator =(const object *op)
403 { 415 {
407 419
408 return *this; 420 return *this;
409 } 421 }
410 422
411 mapspace *operator ->() const { return &m->at (x, y); } 423 mapspace *operator ->() const { return &m->at (x, y); }
412 mapspace *operator * () const { return &m->at (x, y); } 424 mapspace &operator * () const { return m->at (x, y); }
413 425
414 bool normalise () 426 bool normalise ()
415 { 427 {
416 return xy_normalise (m, x, y); 428 return xy_normalise (m, x, y);
417 } 429 }
418 430
431 mapspace &ms () const
432 {
433 return m->at (x, y);
434 }
435
419 object *insert (object *op, object *originator = 0, int flags = 0) const 436 object *insert (object *op, object *originator = 0, int flags = 0) const
420 { 437 {
421 m->insert (op, x, y, originator, flags); 438 return m->insert (op, x, y, originator, flags);
422 } 439 }
423}; 440};
424 441
425inline const mapxy & 442inline const mapxy &
426object::operator =(const mapxy &pos) 443object::operator =(const mapxy &pos)

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines