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.98 by root, Sun Aug 17 22:46: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.
117 */ 114 */
115INTERFACE_CLASS (mapspace)
118struct mapspace 116struct mapspace
119{ 117{
118 object *ACC (RW, bot);
120 object *bot, *top; /* lowest/highest object on this space */ 119 object *ACC (RW, top); /* lowest/highest object on this space */
121 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ 120 object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */
122 uint8 flags_; /* flags about this space (see the P_ values above) */ 121 uint8 flags_; /* flags about this space (see the P_ values above) */
123 sint8 light; /* How much light this space provides */ 122 sint8 ACC (RW, light); /* How much light this space provides */
124 MoveType move_block; /* What movement types this space blocks */ 123 MoveType ACC (RW, move_block); /* What movement types this space blocks */
125 MoveType move_slow; /* What movement types this space slows */ 124 MoveType ACC (RW, move_slow); /* What movement types this space slows */
126 MoveType move_on; /* What movement types are activated */ 125 MoveType ACC (RW, move_on); /* What movement types are activated */
127 MoveType move_off; /* What movement types are activated */ 126 MoveType ACC (RW, move_off); /* What movement types are activated */
128 127
129 void update_ (); 128 void update_ ();
130 void update () 129 MTH void update ()
131 { 130 {
132 if (!(flags_ & P_UPTODATE)) 131 if (!(flags_ & P_UPTODATE))
133 update_ (); 132 update_ ();
134 } 133 }
135 134
136 uint8 flags () 135 MTH uint8 flags ()
137 { 136 {
138 update (); 137 update ();
139 return flags_; 138 return flags_;
140 } 139 }
141 140
142 // maybe only inline quick flags_ checking?
143 object *player () 141 MTH object *player ()
144 { 142 {
145 // search from the top, because players are usually on top 143 object *op;
146 // make usually == always and this non-amortized O(1) 144
147 // could gte rid of P_PLAYER, too, then
148 if (flags () & P_PLAYER) 145 if (flags () & P_PLAYER)
149 for (object *op = top; op; op = op->below) 146 for (op = top; op->type != PLAYER; op = op->below)
150 if (op->type == PLAYER) 147 ;
151 return op; 148 else
149 op = 0;
152 150
153 return 0; 151 return op;
154 } 152 }
155 153
156 // return the item volume on this mapspace in cm³ 154 // return the item volume on this mapspace in cm³
157 uint64 volume () const; 155 MTH uint64 volume () const;
156
157 bool blocks (MoveType mt) const
158 {
159 return move_block && (mt & move_block) == mt;
160 }
161
162 bool blocks (object *op) const
163 {
164 return blocks (op->move_type);
165 }
158}; 166};
159 167
160struct shopitems : zero_initialised 168struct shopitems : zero_initialised
161{ 169{
162 const char *name; /* name of the item in question, null if it is the default item */ 170 const char *name; /* name of the item in question, null if it is the default item */
… …
186struct maptile : zero_initialised, attachable 194struct maptile : zero_initialised, attachable
187{ 195{
188 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ 196 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
189 struct mapspace *spaces; /* Array of spaces on this map */ 197 struct mapspace *spaces; /* Array of spaces on this map */
190 uint8 *regions; /* region index per mapspace, if != 0 */ 198 uint8 *regions; /* region index per mapspace, if != 0 */
191 struct region **regionmap; /* index to region */ 199 region_ptr *regionmap; /* index to region */
192 200
193 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ 201 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
194 202
195 shstr ACC (RW, name); /* Name of map as given by its creator */ 203 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 204 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 205 * points to the struct containing all the properties of
198 * the region */ 206 * the region */
199 double ACC (RW, reset_time); 207 double ACC (RW, reset_time);
200 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map 208 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
201 * should be reset 209 * should be reset
… …
211 * be loaded before used. The map,omap and map_ob 219 * be loaded before used. The map,omap and map_ob
212 * arrays will be allocated when the map is loaded */ 220 * arrays will be allocated when the map is loaded */
213 sint16 players; /* How many players are on this map right now */ 221 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 */ 222 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
215 223
216 bool ACC (RW, active); // wether this map is active or not
217 bool ACC (RW, per_player); 224 bool ACC (RW, per_player);
218 bool ACC (RW, per_party); 225 bool ACC (RW, per_party);
219 bool ACC (RW, outdoor); /* True if an outdoor map */ 226 bool ACC (RW, outdoor); /* True if an outdoor map */
220 bool ACC (RW, nodrop); /* avoid dropping anything on this map */ 227 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 */ 228 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
222 229
223 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ 230 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 */ 231 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 */ 232 oblinkpt *buttons; /* Linked list of linked lists of buttons */
… …
257 MTH int change_map_light (int change); 264 MTH int change_map_light (int change);
258 static void change_all_map_light (int change); //PERL 265 static void change_all_map_light (int change); //PERL
259 MTH void set_darkness_map (); 266 MTH void set_darkness_map ();
260 MTH int estimate_difficulty () const; 267 MTH int estimate_difficulty () const;
261 268
269 MTH void play_sound (faceidx sound, int x, int y) const;
270
262 // set the given flag on all objects in the map 271 // set the given flag on all objects in the map
263 MTH void set_object_flag (int flag, int value = 1); 272 MTH void set_object_flag (int flag, int value = 1);
273 MTH void post_load_original ();
264 274
265 MTH void link_multipart_objects (); 275 MTH void link_multipart_objects ();
266 MTH void clear_unique_items (); 276 MTH void clear_unique_items ();
267 277
268 MTH void clear_header (); 278 MTH void clear_header ();
269 MTH void clear_links_to (maptile *m); 279 MTH void clear_links_to (maptile *m);
270 280
271 MTH struct region *region (int x, int y) const; 281 MTH struct region *region (int x, int y) const;
272 282
273 // loas the header pseudo-object 283 // load the header pseudo-object
274 bool _load_header (object_thawer &thawer); 284 bool _load_header (object_thawer &thawer);
275 MTH bool _load_header (const char *path); 285 MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); }
276 286
277 // load objects into the map 287 // load objects into the map
278 bool _load_objects (object_thawer &thawer); 288 bool _load_objects (object_thawer &thawer);
279 MTH bool _load_objects (const char *path, bool skip_header = true); 289 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
280 290
281 // save objects into the given file (uses IO_ flags) 291 // save objects into the given file (uses IO_ flags)
282 bool _save_objects (object_freezer &freezer, int flags); 292 bool _save_objects (object_freezer &freezer, int flags);
283 MTH bool _save_objects (const char *path, int flags); 293 MTH bool _save_objects (const char *path, int flags);
284 294
… …
296 MTH int size () const { return width * height; } 306 MTH int size () const { return width * height; }
297 307
298 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); 308 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
299 309
300 MTH void touch () { last_access = runtime; } 310 MTH void touch () { last_access = runtime; }
311
312 MTH bool tile_available (int dir, bool load = true);
301 313
302 // find the map that is at coordinate x|y relative to this map 314 // find the map that is at coordinate x|y relative to this map
303 // TODO: need a better way than passing by reference 315 // TODO: need a better way than passing by reference
304 // TODO: make perl interface 316 // TODO: make perl interface
305 maptile *xy_find (sint16 &x, sint16 &y); 317 maptile *xy_find (sint16 &x, sint16 &y);
… …
317 } 329 }
318 330
319 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); 331 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
320 bool generate_random_map (random_map_params *RP); 332 bool generate_random_map (random_map_params *RP);
321 333
322 static maptile *find_async (const char *path, maptile *original = 0);//PERL 334 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 335 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 336 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
325 MTH object *pick_random_object () const; 337 object *pick_random_object (rand_gen &gen = rndm) const;
326 338
327 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } 339 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]; } 340 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
329}; 341};
330 342
… …
344 int distance_y; 356 int distance_y;
345 int direction; 357 int direction;
346 object *part; 358 object *part;
347}; 359};
348 360
361// comaptibility cruft start
349//TODO: these should be refactored into things like xy_normalise 362//TODO: these should be refactored into things like xy_normalise
350// and so on. 363// and so on.
351int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); 364int 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); 365int out_of_map (maptile *m, int x, int y);
354maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); 366maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
355void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); 367void 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); 368void 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); 369int on_same_map (const object *op1, const object *op2);
358int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); 370int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
359 371
360// adjust map, x and y for tiled maps and return true if the position is valid at all 372// adjust map, x and y for tiled maps and return true if the position is valid at all
361inline bool 373static inline bool
362xy_normalise (maptile *&map, sint16 &x, sint16 &y) 374xy_normalise (maptile *&map, sint16 &x, sint16 &y)
363{ 375{
364 // when in range, do a quick return, otherwise go the slow route 376 // when in range, do a quick return, otherwise go the slow route
365 return 377 return
366 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) 378 (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); 379 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
368} 380}
381// comaptibility cruft end
369 382
370inline mapspace & 383inline mapspace &
371object::ms () const 384object::ms () const
372{ 385{
373 return map->at (x, y); 386 return map->at (x, y);
374} 387}
375 388
389struct mapxy {
390 maptile *m;
391 sint16 x, y;
392
393 mapxy (maptile *m, sint16 x, sint16 y)
394 : m(m), x(x), y(y)
395 { }
396
397 mapxy (object *op)
398 : m(op->map), x(op->x), y(op->y)
399 { }
400
401 mapxy &move (int dx, int dy)
402 {
403 x += dx;
404 y += dy;
405
406 return *this;
407 }
408
409 mapxy &move (int dir)
410 {
411 return move (freearr_x [dir], freearr_y [dir]);
412 }
413
414 operator void *() const { return (void *)m; }
415 mapxy &operator =(const object *op)
416 {
417 m = op->map;
418 x = op->x;
419 y = op->y;
420
421 return *this;
422 }
423
424 mapspace *operator ->() const { return &m->at (x, y); }
425 mapspace &operator * () const { return m->at (x, y); }
426
427 bool normalise ()
428 {
429 return xy_normalise (m, x, y);
430 }
431
432 mapspace &ms () const
433 {
434 return m->at (x, y);
435 }
436
437 object *insert (object *op, object *originator = 0, int flags = 0) const
438 {
439 return m->insert (op, x, y, originator, flags);
440 }
441};
442
443inline const mapxy &
444object::operator =(const mapxy &pos)
445{
446 map = pos.m;
447 x = pos.x;
448 y = pos.y;
449
450 return pos;
451}
452
376#endif 453#endif
377 454

Diff Legend

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