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.79 by root, Fri Jul 13 15:54:40 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 */
212 * be loaded before used. The map,omap and map_ob 218 * be loaded before used. The map,omap and map_ob
213 * arrays will be allocated when the map is loaded */ 219 * arrays will be allocated when the map is loaded */
214 sint16 players; /* How many players are on this map right now */ 220 sint16 players; /* How many players are on this map right now */
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, active); // wether this map is active or not
218 bool ACC (RW, per_player); 223 bool ACC (RW, per_player);
219 bool ACC (RW, per_party); 224 bool ACC (RW, per_party);
220 bool ACC (RW, outdoor); /* True if an outdoor map */ 225 bool ACC (RW, outdoor); /* True if an outdoor map */
221 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 */
222 uint8 ACC (RW, darkness); /* indicates level of darkness of map */ 227 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
223 228
224 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 */
225 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 */
226 oblinkpt *buttons; /* Linked list of linked lists of buttons */ 231 oblinkpt *buttons; /* Linked list of linked lists of buttons */
258 MTH int change_map_light (int change); 263 MTH int change_map_light (int change);
259 static void change_all_map_light (int change); //PERL 264 static void change_all_map_light (int change); //PERL
260 MTH void set_darkness_map (); 265 MTH void set_darkness_map ();
261 MTH int estimate_difficulty () const; 266 MTH int estimate_difficulty () const;
262 267
268 MTH void play_sound (faceidx sound, int x, int y) const;
269
263 // set the given flag on all objects in the map 270 // set the given flag on all objects in the map
264 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 ();
265 273
266 MTH void link_multipart_objects (); 274 MTH void link_multipart_objects ();
267 MTH void clear_unique_items (); 275 MTH void clear_unique_items ();
268 276
269 MTH void clear_header (); 277 MTH void clear_header ();
270 MTH void clear_links_to (maptile *m); 278 MTH void clear_links_to (maptile *m);
271 279
272 MTH struct region *region (int x, int y) const; 280 MTH struct region *region (int x, int y) const;
273 281
274 // loas the header pseudo-object 282 // load the header pseudo-object
275 bool _load_header (object_thawer &thawer); 283 bool _load_header (object_thawer &thawer);
276 MTH bool _load_header (const char *path); 284 MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); }
277 285
278 // load objects into the map 286 // load objects into the map
279 bool _load_objects (object_thawer &thawer); 287 bool _load_objects (object_thawer &thawer);
280 MTH bool _load_objects (const char *path, bool skip_header = true); 288 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
281 289
282 // save objects into the given file (uses IO_ flags) 290 // save objects into the given file (uses IO_ flags)
283 bool _save_objects (object_freezer &freezer, int flags); 291 bool _save_objects (object_freezer &freezer, int flags);
284 MTH bool _save_objects (const char *path, int flags); 292 MTH bool _save_objects (const char *path, int flags);
285 293
297 MTH int size () const { return width * height; } 305 MTH int size () const { return width * height; }
298 306
299 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 307 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
300 308
301 MTH void touch () { last_access = runtime; } 309 MTH void touch () { last_access = runtime; }
310
311 MTH bool tile_available (int dir, bool load = true);
302 312
303 // find the map that is at coordinate x|y relative to this map 313 // find the map that is at coordinate x|y relative to this map
304 // TODO: need a better way than passing by reference 314 // TODO: need a better way than passing by reference
305 // TODO: make perl interface 315 // TODO: make perl interface
306 maptile *xy_find (sint16 &x, sint16 &y); 316 maptile *xy_find (sint16 &x, sint16 &y);
318 } 328 }
319 329
320 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); 330 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
321 bool generate_random_map (random_map_params *RP); 331 bool generate_random_map (random_map_params *RP);
322 332
323 static maptile *find_async (const char *path, maptile *original = 0);//PERL 333 static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL
324 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 334 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
325 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
326 MTH object *pick_random_object () const; 336 object *pick_random_object (rand_gen &gen = rndm) const;
327 337
328 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]; }
329 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } 339 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
330}; 340};
331 341
345 int distance_y; 355 int distance_y;
346 int direction; 356 int direction;
347 object *part; 357 object *part;
348}; 358};
349 359
360// comaptibility cruft start
350//TODO: these should be refactored into things like xy_normalise 361//TODO: these should be refactored into things like xy_normalise
351// and so on. 362// and so on.
352int 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);
353int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
354int out_of_map (maptile *m, int x, int y); 364int out_of_map (maptile *m, int x, int y);
355maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); 365maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
356void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); 366void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
357void 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);
358int on_same_map (const object *op1, const object *op2); 368int on_same_map (const object *op1, const object *op2);
359int 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);
360 370
361// 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
362inline bool 372static inline bool
363xy_normalise (maptile *&map, sint16 &x, sint16 &y) 373xy_normalise (maptile *&map, sint16 &x, sint16 &y)
364{ 374{
365 // 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
366 return 376 return
367 (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))
368 || !(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);
369} 379}
380// comaptibility cruft end
370 381
371inline mapspace & 382inline mapspace &
372object::ms () const 383object::ms () const
373{ 384{
374 return map->at (x, y); 385 return map->at (x, y);
375} 386}
376 387
388struct mapxy {
389 maptile *m;
390 sint16 x, y;
391
392 mapxy (maptile *m, sint16 x, sint16 y)
393 : m(m), x(x), y(y)
394 { }
395
396 mapxy (object *op)
397 : m(op->map), x(op->x), y(op->y)
398 { }
399
400 mapxy &move (int dx, int dy)
401 {
402 x += dx;
403 y += dy;
404
405 return *this;
406 }
407
408 mapxy &move (int dir)
409 {
410 return move (freearr_x [dir], freearr_y [dir]);
411 }
412
413 operator void *() const { return (void *)m; }
414 mapxy &operator =(const object *op)
415 {
416 m = op->map;
417 x = op->x;
418 y = op->y;
419
420 return *this;
421 }
422
423 mapspace *operator ->() const { return &m->at (x, y); }
424 mapspace &operator * () const { return m->at (x, y); }
425
426 bool normalise ()
427 {
428 return xy_normalise (m, x, y);
429 }
430
431 mapspace &ms () const
432 {
433 return m->at (x, y);
434 }
435
436 object *insert (object *op, object *originator = 0, int flags = 0) const
437 {
438 return m->insert (op, x, y, originator, flags);
439 }
440};
441
442inline const mapxy &
443object::operator =(const mapxy &pos)
444{
445 map = pos.m;
446 x = pos.x;
447 y = pos.y;
448
449 return pos;
450}
451
377#endif 452#endif
378 453

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines