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.77 by root, Thu Jun 7 19:12:22 2007 UTC vs.
Revision 1.90 by root, Thu Nov 8 19:43:24 2007 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines