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

Comparing deliantra/server/include/object.h (file contents):
Revision 1.258 by root, Sat Apr 23 04:56:49 2011 UTC vs.
Revision 1.273 by root, Sat Nov 17 23:33:18 2018 UTC

 /*
  * This file is part of Deliantra, the Roguelike Realtime MMORPG.
  *
+ * Copyright (©) 2018 Marc Alexander Lehmann / the Deliantra team
- * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
+ * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
  * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
  * Copyright (©) 1992 Frank Tore Johansen
  *
  * Deliantra is free software: you can redistribute it and/or modify it under
  * the terms of the Affero GNU General Public License as published by 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
  * GNU General Public License for more details.
  *
  * You should have received a copy of the Affero GNU General Public License
  * and the GNU General Public License along with this program. If not, see
  * <http://www.gnu.org/licenses/>.
  *
  * The authors can be reached via e-mail to <support@deliantra.net>
  */
 #ifndef OBJECT_H
 #define OBJECT_H
  * accessing the list directly.
  * Exception is if you want to walk this list for some reason.
  */
 struct key_value : slice_allocated
 {
-  key_value *next;
+  key_value *next; // must be first element
   shstr key, value;
+};
+// "crossfires version of a perl hash."
+struct key_values
+{
+  key_value *first; // must be first element
+  bool empty() const
+  {
+    return !first;
+  }
+  void clear ();
+  shstr_tmp get (shstr_tmp key) const;
+  void del (shstr_tmp key);
+  void set (shstr_tmp key, shstr_tmp value);
+  void add (shstr_tmp key, shstr_tmp value); // liek set, but doesn't check for duplicates
+  void reverse (); // reverses the ordering, to be used after loading an object
+  key_values &operator =(const key_values &kv);
+  // custom extra fields management
+  struct access_proxy
+  {
+    key_values &kv;
+    shstr_tmp key;
+    access_proxy (key_values &kv, shstr_tmp key)
+    : kv (kv), key (key)
+    {
+    }
+    const access_proxy &operator =(shstr_tmp value) const
+    {
+      kv.set (key, value);
+      return *this;
+    }
+    operator const shstr_tmp () const { return kv.get (key); }
+    operator const char     *() const { return kv.get (key); }
+  private:
+    void operator =(int);
+  };
+  const access_proxy operator [](shstr_tmp key)
+  {
+    return access_proxy (*this, key);
+  }
 };
 //-GPL
 struct UUID
 {				/* Used to link together several object links */
   struct oblnk *link;
   struct oblinkpt *next;
   shstr id;			/* Used as connected value in buttons/gates */
 } oblinkpt;
+// temporary hack to find the culprit who corrupts face numbers. maybe. hopefully.
+struct faceidx_debug
+{
+  faceidx x;
+  operator faceidx () const
+  {
+    return x;
+  }
+  faceidx operator =(faceidx i)
+  {
+    if (ecb_expect_false (i >= faces.size ()))
+      {
+        fork_abort ("illegal faceidx assignment");
+        i = blank_face;
+      }
+    return x = i;
+  }
+};
+#if CFPERL
+static inline void sv_to (SV *sv, faceidx_debug &v) { v = SvIV (sv); }
+#endif
 INTERFACE_CLASS (object)
 // these are being copied
 struct object_copy : attachable
 {
   sint8 ACC (RW, glow_radius);	/* indicates the glow radius of the object */
   uint8 ACC (RW, weapontype);	/* type of weapon */
   body_slot slot [NUM_BODY_LOCATIONS];
-  faceidx ACC (RW, face);	/* the graphical face */
+  faceidx_debug ACC (RW, face);	/* the graphical face */
   faceidx ACC (RW, sound);      /* the sound face */
   faceidx ACC (RW, sound_destroy); /* played on destroy */
   sint32 ACC (RW, weight);	/* Attributes of the object */
   // 8 free bits
   //float ACC (RW, expmul) = 1.0;	/* needed experience = (calc_exp*expmul) - means some */
   //                                    /* races/classes can need less/more exp to gain levels */
-  static const float expmul = 1.0;//D
+  constexpr static const float expmul = 1.0;//D
   float ACC (RW, move_slow_penalty);	/* How much this slows down the object */
   /* Following are values used by any object */
   /* this objects turns into or what this object creates */
   treasurelist *ACC (RW, randomitems);	/* Items to be generated */
   object *ACC (RW, env);	/* Pointer to the object which is the environment.
 				 * This is typically the container that the object is in.
 				 */
   object *ACC (RW, more);	/* Pointer to the rest of a large body of objects */
   object *head;			/* Points to the main object of a large body */ // NO ACC, perl semantics are different
-  key_value *key_values;	/* Fields not explictly known by the loader. */
   MTH void set_flag (int flagnum)
   {
     flag [flagnum] = true;
   }
   MTH void clr_flag (int flagnum)
   {
     flag [flagnum] = false;
   }
-  // privates / perl
+  // extra key value pairs
-  shstr_tmp kv_get (shstr_tmp key) const;
+  key_values kv;
-  void kv_del (shstr_tmp key);
-  void kv_set (shstr_tmp key, shstr_tmp value);
 //-GPL
-  // custom extra fields management
-  struct key_value_access_proxy
-  {
-    object &ob;
-    shstr_tmp key;
-    key_value_access_proxy (object &ob, shstr_tmp key)
-    : ob (ob), key (key)
-    {
-    }
-    const key_value_access_proxy &operator =(shstr_tmp value) const
-    {
-      ob.kv_set (key, value);
-      return *this;
-    }
-    operator const shstr_tmp () const { return ob.kv_get (key); }
-    operator const char     *() const { return ob.kv_get (key); }
-  private:
-    void operator =(int);
-  };
-  // operator [] is too annoying to use
-  const key_value_access_proxy kv (shstr_tmp key)
-  {
-    return key_value_access_proxy (*this, key);
-  }
   bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all
   MTH void post_load_check ();          // do some adjustments after parsing
   static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go.
   bool write (object_freezer &f);
   // object op is trying to move in direction dir.
   // originator is typically the same as op, but
   // can be different if originator is causing op to
   // move (originator is pushing op)
   // returns 0 if the object is not able to move to the
   // desired space, 1 otherwise (in which case we also
   // move the object accordingly.  This function is
   // very similiar to move_object.
   int move (int dir, object *originator);
   int move (int dir)
     return op1->value == op2->value
         && op1->name  == op2->name
         && can_merge_slow (op1, op2);
   }
-  MTH void set_owner (object *owner);
+  MTH void set_owner (object_ornull *owner);
   MTH void set_speed (float speed);
   MTH void set_glow_radius (sint8 rad);
   MTH void open_container (object *new_container);
   MTH void close_container ()
     // strangely enough, using ?: here causes code to inflate
     return type == CONTAINER
         && ((env && env->container_ () == this)
             || (!env && flag [FLAG_APPLIED]));
   }
+  MTH object *find_spell (const_utf8_string prefix) const;
   MTH object *force_find (shstr_tmp name);
   MTH void force_set_timer (int duration);
   MTH object *force_add (shstr_tmp name, int duration = 0);
   MTH int number_of () const
   {
     return nrof ? nrof : 1;
   }
-  MTH sint32 total_weight () const
+  MTH weight_t total_weight () const
   {
-    return (weight + carrying) * number_of ();
+    return sint64 (weight + carrying) * number_of ();
   }
   MTH void update_weight ();
   // return the dominant material of this item, always return something
   {
     return material;
   }
   // return the volume of this object in cm³
-  MTH uint64 volume () const
+  MTH volume_t volume () const
   {
-    return (uint64)total_weight ()
+    return (volume_t)total_weight ()
            * 1024 // 1000 actually
            * (type == CONTAINER ? 128 : 1)
            / dominant_material ()->density; // ugh, division
   }
   static bool msg_has_dialogue (const char *msg) { return *msg == '@'; }
   MTH bool has_dialogue () const { return msg_has_dialogue (&msg); }
   /* need_identify returns true if the item should be identified.  This
    * function really should not exist - by default, any item not identified
    * should need it.
    */
   MTH bool need_identify () const;
   MTH void activate   ();
   MTH void deactivate ();
   MTH void activate_recursive   ();
   MTH void deactivate_recursive ();
+  // prefetch and activate the surrounding area
+  MTH void prefetch_surrounding_maps ();
   // set the given flag on all objects in the inventory recursively
   MTH void set_flag_inv (int flag, int value = 1);
   void enter_exit (object *exit); // perl
   MTH object *instance ();
   MTH void post_load_check ();          // do some adjustments after parsing
   object_vector_index ACC (RW, archid);         // index in archvector
-  shstr ACC (RW, archname);		   	/* More definite name, like "generate_kobold" */
+  shstr ACC (RW, archname);			/* More definite name, like "generate_kobold" */
   sint8 ACC (RW, max_x);       /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */
   // support for archetype loading
   static archetype *read (object_thawer &f);
 // "safely" iterate over inv in a way such that the current item is removable
 // quite horrible, that's why its hidden in some macro
 #define for_inv_removable(op,var)			\
   for (object *var, *next_ = (op)->inv; (var = next_), var && (next_ = var->below), var; )
-#define for_all_objects(var)                    	\
+#define for_all_objects(var)				\
-  for (unsigned _i = 0; _i < objects.size (); ++_i)     \
+  for (unsigned _i = 0; _i < objects.size (); ++_i)	\
     statementvar (object *, var, objects [_i])
-#define for_all_actives(var)                    	\
+#define for_all_actives(var)				\
-  for (unsigned _i = 0; _i < actives.size (); ++_i)     \
+  for (unsigned _i = 0; _i < actives.size (); ++_i)	\
     statementvar (object *, var, actives [_i])
-#define for_all_archetypes(var)                 	\
+#define for_all_archetypes(var)				\
-  for (unsigned _i = 0; _i < archetypes.size (); ++_i)  \
+  for (unsigned _i = 0; _i < archetypes.size (); ++_i)	\
     statementvar (archetype *, var, archetypes [_i])
 //+GPL
 /* Used by update_object to know if the object being passed is
 #define UP_OBJ_INSERT   1
 #define UP_OBJ_REMOVE   2
 #define UP_OBJ_CHANGE   3
 #define UP_OBJ_FACE     4	/* Only thing that changed was the face */
 /* These are flags passed to insert_ob_in_map and
  * insert_ob_in_ob.  Note that all flags may not be meaningful
  * for both functions.
  * Most are fairly explanatory:
  * INS_NO_MERGE: don't try to merge inserted object with ones alrady
  *    on space.
  * INS_ABOVE_FLOOR_ONLY: Put object immediatly above the floor.
  * INS_NO_WALK_ON: Don't call check_walk_on against the
  *    originator - saves cpu time if you know the inserted object
  *    is not meaningful in terms of having an effect.
  * INS_ON_TOP: Always put object on top.  Generally only needed when loading
  *     files from disk and ordering needs to be preserved.
  * INS_BELOW_ORIGINATOR: Insert new object immediately below originator -
  *     Use for treasure chests so the new object is the highest thing
  *     beneath the player, but not actually above it.  Note - the
  *     map and x,y coordinates for the object to be inserted must
  *     match the originator.

Diff Legend

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

Comparing deliantra/server/include/object.h (file contents): Revision 1.258 by root, Sat Apr 23 04:56:49 2011 UTC vs. Revision 1.273 by root, Sat Nov 17 23:33:18 2018 UTC

Diff Legend

Comparing deliantra/server/include/object.h (file contents):
Revision 1.258 by root, Sat Apr 23 04:56:49 2011 UTC vs.
Revision 1.273 by root, Sat Nov 17 23:33:18 2018 UTC