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.70 by pippijn, Thu Mar 1 12:28:16 2007 UTC vs.
Revision 1.86 by root, Fri Aug 31 00:20:41 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT 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 2 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
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, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at crossfire@schmorp.de 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
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.
65// all those macros are herewith declared legacy 65// all those macros are herewith declared legacy
66#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () 66#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()
67#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light 67#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light
68#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot 68#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot
69#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top 69#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top
70#define GET_MAP_FACE(M,X,Y,L) (M)->at((X),(Y)).faces[L]
71#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] 70#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]
72#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block 71#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block
73#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow 72#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow
74#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on 73#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on
75#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off 74#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off
118 * to extend information about a space. 117 * to extend information about a space.
119 */ 118 */
120struct mapspace 119struct mapspace
121{ 120{
122 object *bot, *top; /* lowest/highest object on this space */ 121 object *bot, *top; /* lowest/highest object on this space */
123 facetile *faces[MAP_LAYERS]; /* faces for the 3 layers */
124 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ 122 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */
125 uint8 flags_; /* flags about this space (see the P_ values above) */ 123 uint8 flags_; /* flags about this space (see the P_ values above) */
126 sint8 light; /* How much light this space provides */ 124 sint8 light; /* How much light this space provides */
127 MoveType move_block; /* What movement types this space blocks */ 125 MoveType move_block; /* What movement types this space blocks */
128 MoveType move_slow; /* What movement types this space slows */ 126 MoveType move_slow; /* What movement types this space slows */
158 156
159 // return the item volume on this mapspace in cm³ 157 // return the item volume on this mapspace in cm³
160 uint64 volume () const; 158 uint64 volume () const;
161}; 159};
162 160
163/*
164 * Each map is in a given region of the game world and links to a region definiton, so
165 * they have to appear here in the headers, before the mapdef
166 */
167INTERFACE_CLASS (region)
168struct region : zero_initialised
169{
170 shstr ACC (RW, name); /* Shortend name of the region as maps refer to it */
171 region *ACC (RW, parent); /*
172 * Pointer to the region that is a parent of the current
173 * region, if a value isn't defined in the current region
174 * we traverse this series of pointers until it is.
175 */
176 shstr ACC (RW, longname); /* Official title of the region, this might be defined
177 * to be the same as name*/
178 shstr ACC (RW, msg); /* the description of the region */
179 shstr ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */
180 int ACC (RW, index);
181 uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */
182 sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */
183 bool ACC (RW, fallback); /* whether, in the event of a region not existing,
184 * this should be the one we fall back on as the default */
185
186 static region *default_region ();
187 static region *find (const char *name);
188 static region *find_fuzzy (const char *name);
189 static region *read (object_thawer &f);
190};
191
192typedef object_vector<region, &region::index> regionvec;
193
194extern regionvec regions;
195
196#define for_all_regions(var) \
197 for (unsigned _i = 0; _i < regions.size (); ++_i) \
198 declvar (region *, var, regions [_i])
199
200struct shopitems : zero_initialised 161struct shopitems : zero_initialised
201{ 162{
202 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 */
203 const char *name_pl; /* plural name */ 164 const char *name_pl; /* plural name */
204 int typenum; /* itemtype number we need to match 0 if it is the default price */ 165 int typenum; /* itemtype number we need to match 0 if it is the default price */
226struct maptile : zero_initialised, attachable 187struct maptile : zero_initialised, attachable
227{ 188{
228 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. */
229 struct mapspace *spaces; /* Array of spaces on this map */ 190 struct mapspace *spaces; /* Array of spaces on this map */
230 uint8 *regions; /* region index per mapspace, if != 0 */ 191 uint8 *regions; /* region index per mapspace, if != 0 */
231 struct region **regionmap; /* index to region */ 192 region_ptr *regionmap; /* index to region */
232 193
233 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 */
234 195
235 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 */
236 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
237 * points to the struct containing all the properties of 198 * points to the struct containing all the properties of
238 * the region */ 199 * the region */
239 double ACC (RW, reset_time); 200 double ACC (RW, reset_time);
240 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
241 * should be reset 202 * should be reset
242 */ 203 */
243 bool ACC (RW, dirty); /* if true, something was inserted or removed */ 204 bool ACC (RW, dirty); /* if true, something was inserted or removed */
205 bool ACC (RW, no_reset); // must not reset this map
244 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by 206 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
245 * players entering/exiting map 207 * players entering/exiting map
246 */ 208 */
247 sint32 ACC (RW, timeout); /* swapout is set to this */ 209 sint32 ACC (RW, timeout); /* swapout is set to this */
248 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ 210 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
288 MTH void alloc (); 250 MTH void alloc ();
289 // deallocates the mapspaces (and destroys all objects) 251 // deallocates the mapspaces (and destroys all objects)
290 MTH void clear (); 252 MTH void clear ();
291 253
292 MTH void fix_auto_apply (); 254 MTH void fix_auto_apply ();
293 MTH void decay_objects (); 255 MTH void do_decay_objects ();
294 MTH void update_buttons (); 256 MTH void update_buttons ();
295 MTH int change_map_light (int change); 257 MTH int change_map_light (int change);
296 static void change_all_map_light (int change); //PERL 258 static void change_all_map_light (int change); //PERL
297 MTH void set_darkness_map (); 259 MTH void set_darkness_map ();
298 MTH int estimate_difficulty () const; 260 MTH int estimate_difficulty () const;
299 261
262 MTH void play_sound (faceidx sound, int x, int y) const;
263
300 // set the given flag on all objects in the map 264 // set the given flag on all objects in the map
301 MTH void set_object_flag (int flag, int value = 1); 265 MTH void set_object_flag (int flag, int value = 1);
302 266
303 MTH void link_multipart_objects (); 267 MTH void link_multipart_objects ();
304 MTH void clear_unique_items (); 268 MTH void clear_unique_items ();
334 MTH int size () const { return width * height; } 298 MTH int size () const { return width * height; }
335 299
336 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);
337 301
338 MTH void touch () { last_access = runtime; } 302 MTH void touch () { last_access = runtime; }
303
304 MTH bool tile_available (int dir, bool load = true);
339 305
340 // 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
341 // TODO: need a better way than passing by reference 307 // TODO: need a better way than passing by reference
342 // TODO: make perl interface 308 // TODO: make perl interface
343 maptile *xy_find (sint16 &x, sint16 &y); 309 maptile *xy_find (sint16 &x, sint16 &y);
355 } 321 }
356 322
357 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);
358 bool generate_random_map (random_map_params *RP); 324 bool generate_random_map (random_map_params *RP);
359 325
360 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
361 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 327 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
362 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
363 MTH object *pick_random_object () const; 329 MTH object *pick_random_object () const;
364 330
365 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]; }
409object::ms () const 375object::ms () const
410{ 376{
411 return map->at (x, y); 377 return map->at (x, y);
412} 378}
413 379
380// not used anywhere *yet*
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 dir)
394 {
395 x += freearr_x [dir];
396 y += freearr_y [dir];
397
398 return *this;
399 }
400
401 operator void *() const { return (void *)m; }
402 mapxy &operator =(const object *op)
403 {
404 m = op->map;
405 x = op->x;
406 y = op->y;
407
408 return *this;
409 }
410
411 mapspace *operator ->() const { return &m->at (x, y); }
412 mapspace *operator * () const { return &m->at (x, y); }
413
414 bool normalise ()
415 {
416 return xy_normalise (m, x, y);
417 }
418
419 object *insert (object *op, object *originator = 0, int flags = 0) const
420 {
421 m->insert (op, x, y, originator, flags);
422 }
423};
424
425inline const mapxy &
426object::operator =(const mapxy &pos)
427{
428 map = pos.m;
429 x = pos.x;
430 y = pos.y;
431
432 return pos;
433}
434
414#endif 435#endif
415 436

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines