--- deliantra/server/include/map.h 2008/12/27 08:41:44 1.107
+++ deliantra/server/include/map.h 2009/11/05 15:57:15 1.116
@@ -5,18 +5,19 @@
* Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team
* Copyright (©) 1992,2007 Frank Tore Johansen
*
- * 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 3 of the License, or
- * (at your option) any later version.
+ * 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 GNU General Public License
- * along with this program. If not, see .
+ * 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
+ * .
*
* The authors can be reached via e-mail to
*/
@@ -31,6 +32,8 @@
#include
+//+GPL
+
#include "region.h"
#include "cfperl.h"
@@ -133,10 +136,12 @@
MoveType ACC (RW, move_on); /* What movement types are activated */
MoveType ACC (RW, move_off); /* What movement types are activated */
+//-GPL
+
void update_ ();
MTH void update ()
{
- if (!(flags_ & P_UPTODATE))
+ if (expect_false (!(flags_ & P_UPTODATE)))
update_ ();
}
@@ -187,6 +192,8 @@
int dx, dy; // offset to go from local coordinates to original tile */
};
+//+GPL
+
struct shopitems : zero_initialised
{
const char *name; /* name of the item in question, null if it is the default item */
@@ -273,6 +280,8 @@
int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
+//-GPL
+
// the maptile:: is neccessary here for the perl interface to work
MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
{
@@ -296,6 +305,11 @@
MTH int estimate_difficulty () const;
MTH void play_sound (faceidx sound, int x, int y) const;
+ MTH void say_msg (const char *msg, int x, int y) const;
+
+ // connected links
+ oblinkpt *find_link (shstr_tmp id);
+ MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0);
// set the given flag on all objects in the map
MTH void set_object_flag (int flag, int value = 1);
@@ -375,6 +389,8 @@
maprect *split_to_tiles (int x0, int y0, int x1, int y1);
};
+//+GPL
+
/* This is used by get_rangevector to determine where the other
* creature is. get_rangevector takes into account map tiling,
* so you just can not look the the map coordinates and get the
@@ -400,7 +416,7 @@
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);
+void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/);
int on_same_map (const object *op1, const object *op2);
int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
@@ -415,6 +431,8 @@
}
// comaptibility cruft end
+//-GPL
+
inline mapspace &
object::ms () const
{
@@ -491,6 +509,7 @@
// see common/los.C for usage example
// the walk will be ordered, outer loop x, inner loop y
// m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op
+// "continue" will skip to the next space
#define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \
for (int dx = (dx0); dx <= (dx1); ++dx) \
{ \
@@ -514,8 +533,9 @@
}
// loop over every space in the given maprect,
-// setting m, nx, ny to the map and -coordinate and dx, dy to the offste relative to dx0,dy0
+// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
// the iterator code must be a single statement following this macro call, similar to "if"
+// "continue" will skip to the next space
#define rect_mapwalk(rect,dx0,dy0) \
statementvar (maptile *, m, (rect)->m) \
for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \
@@ -523,16 +543,20 @@
statementvar (int, dx, nx + (rect)->dx - (dx0)) \
statementvar (int, dy, ny + (rect)->dy - (dy0))
-// same as above, but the walk will not follow any particular
+// same as ordered_mapwalk, but the walk will not follow any particular
// order (unorded), but is likely faster.
// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
-#define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \
- for (maprect *r_e_c_t = (op)->map->split_to_tiles ( \
- (op)->x + (dx0) , (op)->y + (dy0) , \
- (op)->x + (dx1) + 1, (op)->y + (dy1) + 1); \
+// "continue" will skip to the next space
+#define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \
+ for (maprect *r_e_c_t = (map)->split_to_tiles ( \
+ (ox) + (dx0) , (oy) + (dy0) , \
+ (ox) + (dx1) + 1, (oy) + (dy1) + 1); \
r_e_c_t->m; \
++r_e_c_t) \
- rect_mapwalk (r_e_c_t, (op)->x, (op)->y)
+ rect_mapwalk (r_e_c_t, (ox), (oy))
+
+#define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \
+ unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1)
#endif