[ViewVC] Diff of: cvs/deliantra/server/include/map.h

Comparing deliantra/server/include/map.h (file contents):
Revision 1.66 by root, Wed Feb 7 23:50:01 2007 UTC vs.
Revision 1.95 by root, Sat May 17 14:11:13 2008 UTC

 /*
- * CrossFire, A Multiplayer game for X-windows
+ * This file is part of Deliantra, the Roguelike Realtime MMORPG.
  *
- * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
+ * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
- * Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team
+ * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team
- * Copyright (C) 1992 Frank Tore Johansen
+ * Copyright (©) 1992,2007 Frank Tore Johansen
  *
- * This program is free software; you can redistribute it and/or modify
+ * Deliantra is free software: you can redistribute it and/or modify
  * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
+ * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  * GNU General Public License for more details.
  *
  * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
- * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  *
- * The authors can be reached via e-mail at crossfire@schmorp.de
+ * The authors can be reached via e-mail to <support@deliantra.net>
  */
 /*
  * The maptile is allocated each time a new map is opened.
  * It contains pointers (very indirectly) to all objects on the map.
 #ifndef MAP_H
 #define MAP_H
 #include <tr1/unordered_map>
+#include "region.h"
 #include "cfperl.h"
 /* We set this size - this is to make magic map work properly on
  * tiled maps. There is no requirement that this matches the
  * tiled maps size - it just seemed like a reasonable value.
 #define MAGIC_MAP_SIZE  50
 #define MAGIC_MAP_HALF  MAGIC_MAP_SIZE/2
 #define MAP_LAYERS		3
-/* Values for in_memory below.  Should probably be an enumerations */
+/* Values for in_memory below */
 enum {
-  MAP_IN_MEMORY,
+  MAP_ACTIVE,
+  MAP_INACTIVE, // not used atm.
   MAP_SWAPPED,
   MAP_LOADING,
   MAP_SAVING,
 };
 // all those macros are herewith declared legacy
 #define GET_MAP_FLAGS(M,X,Y)         (M)->at((X),(Y)).flags ()
 #define GET_MAP_LIGHT(M,X,Y)         (M)->at((X),(Y)).light
 #define GET_MAP_OB(M,X,Y)            (M)->at((X),(Y)).bot
 #define GET_MAP_TOP(M,X,Y)           (M)->at((X),(Y)).top
-#define GET_MAP_FACE(M,X,Y,L)        (M)->at((X),(Y)).faces[L]
 #define GET_MAP_FACE_OBJ(M,X,Y,L)    (M)->at((X),(Y)).faces_obj[L]
 #define GET_MAP_MOVE_BLOCK(M,X,Y)    (M)->at((X),(Y)).move_block
 #define GET_MAP_MOVE_SLOW(M,X,Y)     (M)->at((X),(Y)).move_slow
 #define GET_MAP_MOVE_ON(M,X,Y)       (M)->at((X),(Y)).move_on
 #define GET_MAP_MOVE_OFF(M,X,Y)      (M)->at((X),(Y)).move_off
  */
 #define P_OUT_OF_MAP	0x10000   /* This space is outside the map */
 #define	P_NEW_MAP	0x20000
                                 /* Coordinates passed result in a new tiled map  */
-/* P_NO_PASS is used for ob_blocked() return value.  It needs
- * to be here to make sure the bits don't match with anything.
- */
-#define P_NO_PASS       0x80000
 /* Instead of having numerous arrays that have information on a
  * particular space (was map, floor, floor2, map_ob),
  * have this structure take care of that information.
  * This puts it all in one place, and should also make it easier
  * to extend information about a space.
  */
 struct mapspace
 {
   object *bot, *top;            /* lowest/highest object on this space */
-  facetile *faces[MAP_LAYERS];  /* faces for the 3 layers */
   object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */
   uint8 flags_;                 /* flags about this space (see the P_ values above) */
   sint8 light;                  /* How much light this space provides */
   MoveType move_block;          /* What movement types this space blocks */
   MoveType move_slow;           /* What movement types this space slows */
     return 0;
   }
   // return the item volume on this mapspace in cm³
   uint64 volume () const;
-};
-/*
+  bool blocks (MoveType mt) const
- * Each map is in a given region of the game world and links to a region definiton, so
+  {
- * they have to appear here in the headers, before the mapdef
+    return move_block && (mt & move_block) == mt;
- */
+  }
-INTERFACE_CLASS (region)
-struct region : zero_initialised
-{
-  shstr ACC (RW, name);                   /* Shortend name of the region as maps refer to it */
-  region *ACC (RW, parent);        /*
-                                           * Pointer to the region that is a parent of the current
-                                           * region, if a value isn't defined in the current region
-                                           * we traverse this series of pointers until it is.
-                                           */
-  shstr ACC (RW, longname);               /* Official title of the region, this might be defined
-                                           * to be the same as name*/
-  shstr ACC (RW, msg);                    /* the description of the region */
-  shstr ACC (RW, jailmap);                /*where a player that is arrested in this region should be imprisoned. */
-  int ACC (RW, index);
-  uint32 ACC (RW, counter);               /* A generic counter for holding temporary data. */
-  sint16 ACC (RW, jailx), ACC (RW, jaily);          /* The coodinates in jailmap to which the player should be sent. */
-  bool ACC (RW, fallback);               /* whether, in the event of a region not existing,
-                                           * this should be the one we fall back on as the default */
-  static region *default_region ();
+  bool blocks (object *op) const
-  static region *find (const char *name);
+  {
-  static region *find_fuzzy (const char *name);
+    return blocks (op->move_type);
+  }
 };
-typedef object_vector<region, &region::index> regionvec;
-extern regionvec regions;
-#define for_all_regions(var)			\
-  for (int _i = 0; _i < regions.size (); ++_i)	\
-    declvar (region *, var, regions [_i])
 struct shopitems : zero_initialised
 {
   const char *name;             /* name of the item in question, null if it is the default item */
   const char *name_pl;          /* plural name */
 struct maptile : zero_initialised, attachable
 {
   sint32 ACC (RW, width), ACC (RW, height);        /* Width and height of map. */
   struct mapspace *spaces;         /* Array of spaces on this map */
   uint8 *regions;                  /* region index per mapspace, if != 0 */
-  struct region **regionmap;       /* index to region */
+  region_ptr *regionmap;           /* index to region */
   tstamp ACC (RW, last_access);    /* last time this map was accessed somehow */
   shstr ACC (RW, name);    /* Name of map as given by its creator */
-  struct region *ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
+  region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
                                     * points to the struct containing all the properties of
                                     * the region */
   double ACC (RW, reset_time);
   uint32 ACC (RW, reset_timeout);  /* How many seconds must elapse before this map
                                     * should be reset
                                     */
   bool ACC (RW, dirty);            /* if true, something was inserted or removed */
+  bool ACC (RW, no_reset);         // must not reset this map
   bool ACC (RW, fixed_resettime);  /* if true, reset time is not affected by
                                     * players entering/exiting map
                                     */
   sint32 ACC (RW, timeout);        /* swapout is set to this */
   sint32 ACC (RW, swap_time);      /* When it reaches 0, the map will be swapped out */
   uint16 ACC (RW, difficulty);     /* What level the player should be to play here */
   bool ACC (RW, per_player);
   bool ACC (RW, per_party);
   bool ACC (RW, outdoor);  /* True if an outdoor map */
-  bool ACC (RW, nodrop);   /* avoid dropping anything on this map */
+  bool ACC (RW, no_drop);   /* avoid auto-dropping (on death) anything on this map */
   uint8 ACC (RW, darkness);        /* indicates level of darkness of map */
   uint16 ACC (RW, enter_x);        /* enter_x and enter_y are default entrance location */
   uint16 ACC (RW, enter_y);        /* on the map if none are set in the exit */
   oblinkpt *buttons;       /* Linked list of linked lists of buttons */
   MTH void alloc ();
   // deallocates the mapspaces (and destroys all objects)
   MTH void clear ();
   MTH void fix_auto_apply ();
-  MTH void decay_objects ();
+  MTH void do_decay_objects ();
   MTH void update_buttons ();
   MTH int change_map_light (int change);
   static void change_all_map_light (int change); //PERL
   MTH void set_darkness_map ();
   MTH int estimate_difficulty () const;
+  MTH void play_sound (faceidx sound, int x, int y) const;
   // set the given flag on all objects in the map
   MTH void set_object_flag (int flag, int value = 1);
   MTH void link_multipart_objects ();
   MTH void clear_unique_items ();
   MTH void clear_header ();
   MTH void clear_links_to (maptile *m);
   MTH struct region *region (int x, int y) const;
-  // loas the header pseudo-object
+  // load the header pseudo-object
   bool _load_header (object_thawer &thawer);
-  MTH bool _load_header (const char *path);
+  MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); }
   // load objects into the map
   bool _load_objects (object_thawer &thawer);
-  MTH bool _load_objects (const char *path, bool skip_header = true);
+  MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
   // save objects into the given file (uses IO_ flags)
   bool _save_objects (object_freezer &freezer, int flags);
   MTH bool _save_objects (const char *path, int flags);
   MTH int size () const { return width * height; }
   MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
   MTH void touch () { last_access = runtime; }
+  MTH bool tile_available (int dir, bool load = true);
   // find the map that is at coordinate x|y relative to this map
   // TODO: need a better way than passing by reference
   // TODO: make perl interface
   maptile *xy_find (sint16 &x, sint16 &y);
   }
   void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
   bool generate_random_map (random_map_params *RP);
+  static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL
   static maptile *find_sync (const char *path, maptile *original = 0);//PERL
-  // async prefetch
+  static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
-  static maptile *find_async (const char *path, maptile *original = 0);//PERL
+  object *pick_random_object (rand_gen &gen = rndm) const;
   mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
   mapspace       &at (uint32 x, uint32 y)       { return spaces [x * height + y]; }
 };
   int distance_y;
   int direction;
   object *part;
 };
+// comaptibility cruft start
 //TODO: these should be refactored into things like xy_normalise
 // and so on.
 int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
-int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
 int out_of_map (maptile *m, int x, int y);
 maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
 void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
 void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
 int on_same_map (const object *op1, const object *op2);
 int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
 // adjust map, x and y for tiled maps and return true if the position is valid at all
-inline bool
+static inline bool
 xy_normalise (maptile *&map, sint16 &x, sint16 &y)
 {
   // when in range, do a quick return, otherwise go the slow route
   return
     (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
     || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
 }
+// comaptibility cruft end
 inline mapspace &
 object::ms () const
 {
   return map->at (x, y);
 }
+struct mapxy {
+  maptile *m;
+  sint16 x, y;
+  mapxy (maptile *m, sint16 x, sint16 y)
+  : m(m), x(x), y(y)
+  { }
+  mapxy (object *op)
+  : m(op->map), x(op->x), y(op->y)
+  { }
+  mapxy &move (int dx, int dy)
+  {
+    x += dx;
+    y += dy;
+    return *this;
+  }
+  mapxy &move (int dir)
+  {
+    return move (freearr_x [dir], freearr_y [dir]);
+  }
+  operator void *() const { return (void *)m; }
+  mapxy &operator =(const object *op)
+  {
+    m = op->map;
+    x = op->x;
+    y = op->y;
+    return *this;
+  }
+  mapspace *operator ->() const { return &m->at (x, y); }
+  mapspace &operator * () const { return  m->at (x, y); }
+  bool normalise ()
+  {
+    return xy_normalise (m, x, y);
+  }
+  mapspace &ms () const
+  {
+    return m->at (x, y);
+  }
+  object *insert (object *op, object *originator = 0, int flags = 0) const
+  {
+    return m->insert (op, x, y, originator, flags);
+  }
+};
+inline const mapxy &
+object::operator =(const mapxy &pos)
+{
+  map = pos.m;
+  x   = pos.x;
+  y   = pos.y;
+  return pos;
+}
 #endif

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.66 by root, Wed Feb 7 23:50:01 2007 UTC vs. Revision 1.95 by root, Sat May 17 14:11:13 2008 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.66 by root, Wed Feb 7 23:50:01 2007 UTC vs.
Revision 1.95 by root, Sat May 17 14:11:13 2008 UTC