server/server/move.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2002,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.
 * 
 * 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 <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

#include <global.h>
#ifndef __CEXTRACT__
# include <sproto.h>
#endif

/*
 * move_object() tries to move object op in the direction "dir".
 * If it fails (something blocks the passage), it returns 0,
 * otherwise 1.
 * This is an improvement from the previous move_ob(), which
 * removed and inserted objects even if they were unable to move.
 */

int
move_object (object *op, int dir)
{
  return move_ob (op, dir, op);
}

/* 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_ob (object *op, int dir, object *originator)
{
  sint16 newx = op->x + freearr_x[dir];
  sint16 newy = op->y + freearr_y[dir];
  object *tmp;
  maptile *m;
  int mflags;

  if (op == NULL)
    {
      LOG (llevError, "Trying to move NULL.\n");
      return 0;
    }

  m = op->map;
  mflags = get_map_flags (m, &m, newx, newy, &newx, &newy);

  /* If the space the player is trying to is out of the map,
   * bail now - we know it can't work.
   */
  if (mflags & P_OUT_OF_MAP)
    return 0;

  /* Is this space blocked?  Players with wizpass are immune to
   * this condition.
   */
  if (blocked_link (op, m, newx, newy) && !QUERY_FLAG (op, FLAG_WIZPASS))
    return 0;

  /* 0.94.2 - we need to set the direction for the new animation code.
   * it uses it to figure out face to use - I can't see it
   * breaking anything, but it might.
   */
  if (op->more && !move_ob (op->more, dir, op->more->head))
    return 0;

  op->direction = dir;

  if (op->will_apply & 4)
    check_earthwalls (op, m, newx, newy);

  if (op->will_apply & 8)
    check_doors (op, m, newx, newy);

  /* 0.94.1 - I got a stack trace that showed it crash with remove_ob trying
   * to remove a removed object, and this function was the culprit.  A possible
   * guess I have is that check_doors above ran into a trap, killing the
   * monster.
   *
   * Unfortunately, it doesn't appear that the calling functions of move_object
   * deal very well with op being killed, so all this might do is just
   * migrate the problem someplace else.
   */

  if (QUERY_FLAG (op, FLAG_REMOVED))
    {
      LOG (llevDebug, "move_object: monster has been removed - will not process further\n");
      /* Was not successful, but don't want to try and move again */
      return 1;
    }

  /* If this is a tail portion, just want to tell caller that move is
   * ok - the caller will deal with actual object removal/insertion
   */
  if (op->head)
    return 1;

  if (m != op->map && op->contr)
    {
      if (INVOKE_MAP (LEAVE, op->map, ARG_PLAYER (op->contr)))
        return 0;

      op->remove ();

      if (INVOKE_PLAYER (MAP_CHANGE, op->contr, ARG_MAP (m), ARG_INT (newx), ARG_INT (newy)))
        return 0;

      if (INVOKE_MAP (ENTER, m, ARG_PLAYER (op->contr), ARG_INT (newx), ARG_INT (newy)))
        return 0;
    }
  else
    op->remove ();

  /* we already have newx, newy, and m, so lets use them.
   * In addition, this fixes potential crashes, because multipart object was
   * on edge of map, +=x, +=y doesn't make correct coordinates.
   */
  for (tmp = op; tmp != NULL; tmp = tmp->more)
    {
      tmp->x += freearr_x[dir];
      tmp->y += freearr_y[dir];
      tmp->map = get_map_from_coord (tmp->map, &tmp->x, &tmp->y);
    }

  /* insert_ob_in_map will deal with any tiling issues */
  insert_ob_in_map (op, m, originator, 0);

  return 1;
}


/*
 * transfer_ob(): Move an object (even linked objects) to another spot
 * on the same map.
 *
 * Does nothing if there is no free spot.
 *
 * randomly: If true, use find_free_spot() to find the destination, otherwise
 * use find_first_free_spot().
 *
 * Return value: 1 if object was destroyed, 0 otherwise.
 */

int
transfer_ob (object *op, int x, int y, int randomly, object *originator)
{
  int i;
  object *tmp;

  if (randomly)
    i = find_free_spot (op, op->map, x, y, 0, SIZEOFFREE);
  else
    i = find_first_free_spot (op, op->map, x, y);

  if (i == -1)
    return 0;                   /* No free spot */

  if (op->head != NULL)
    op = op->head;
  op->remove ();
  for (tmp = op; tmp != NULL; tmp = tmp->more)
    tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->x),
      tmp->y = y + freearr_y[i] + (tmp->arch == NULL ? 0 : tmp->arch->y);

  tmp = insert_ob_in_map (op, op->map, originator, 0);
  if (tmp)
    return 0;
  else
    return 1;
}

/*
 * Return value: 1 if object was destroyed, 0 otherwise.
 * Modified so that instead of passing the 'originator' that had no
 * real use, instead we pass the 'user' of the teleporter.  All the
 * callers know what they wanted to teleporter (move_teleporter or
 * shop map code)
 * tele_type is the type of teleporter we want to match against -
 * currently, this is either set to SHOP_MAT or TELEPORTER.
 * It is basically used so that shop_mats and normal teleporters can
 * be used close to each other and not have the player put to the
 * one of another type.
 */
int
teleport (object *teleporter, uint8 tele_type, object *user)
{
  object *altern;
  int i, j, k, nrofalt = 0;
  object *other_teleporter, *tmp;
  maptile *m;
  sint16 sx, sy;

  if (user == NULL)
    return 0;
  if (user->head != NULL)
    user = user->head;

  /* Find all other teleporters within range.  This range
   * should really be setable by some object attribute instead of
   * using hard coded values.
   */
  for (i = -5; i < 6; i++)
    for (j = -5; j < 6; j++)
      {
        if (i == 0 && j == 0)
          continue;
        /* Perhaps this should be extended to support tiled maps */
        if (OUT_OF_REAL_MAP (teleporter->map, teleporter->x + i, teleporter->y + j))
          continue;
        other_teleporter = GET_MAP_OB (teleporter->map, teleporter->x + i, teleporter->y + j);

        while (other_teleporter)
          {
            if (other_teleporter->type == tele_type)
              break;
            other_teleporter = other_teleporter->above;
          }
        if (other_teleporter && !(RANDOM () % ++nrofalt))
          altern = other_teleporter;
      }

  if (!nrofalt)
    {
      LOG (llevError, "%s: no alternative teleporters around (user %s).\n",
           teleporter->debug_desc (), user->debug_desc ());
      return 0;
    }

  other_teleporter = altern;
  k = find_free_spot (user, other_teleporter->map, other_teleporter->x, other_teleporter->y, 1, 9);

  /* if k==-1, unable to find a free spot.  If this is shop
   * mat that the player is using, find someplace to move
   * the player - otherwise, player can get trapped in the shops
   * that appear in random dungeons.  We basically just make
   * sure the space isn't no pass (eg wall), and don't care
   * about is alive.
   */
  if (k == -1)
    {
      if (tele_type == SHOP_MAT && user->type == PLAYER)
        {
          for (k = 1; k < 9; k++)
            {
              if (get_map_flags (other_teleporter->map, &m,
                                 other_teleporter->x + freearr_x[k], other_teleporter->y + freearr_y[k], &sx, &sy) & P_OUT_OF_MAP)
                continue;

              if (!OB_TYPE_MOVE_BLOCK (user, GET_MAP_MOVE_BLOCK (m, sx, sy)))
                break;

            }
          if (k == 9)
            {
              LOG (llevError, "Shop mat %s (%d, %d) is in solid rock?\n",
                   &other_teleporter->name, other_teleporter->x, other_teleporter->y);
              return 0;
            }
        }
      else
        return 0;
    }

  user->remove ();

  /* Update location for the object */
  for (tmp = user; tmp != NULL; tmp = tmp->more)
    {
      tmp->x = other_teleporter->x + freearr_x[k] + (tmp->arch == NULL ? 0 : tmp->arch->x);
      tmp->y = other_teleporter->y + freearr_y[k] + (tmp->arch == NULL ? 0 : tmp->arch->y);
    }
  tmp = insert_ob_in_map (user, other_teleporter->map, NULL, 0);
  return (tmp == NULL);
}

void
recursive_roll (object *op, int dir, object *pusher)
{
  if (!roll_ob (op, dir, pusher))
    {
      new_draw_info_format (NDI_UNIQUE, 0, pusher, "You fail to push the %s.", query_name (op));
      return;
    }
  (void) move_ob (pusher, dir, pusher);
  new_draw_info_format (NDI_BLACK, 0, pusher, "You move the %s.", query_name (op));
  return;
}

/*
 * This is a new version of blocked, this one handles objects
 * that can be passed through by monsters with the CAN_PASS_THRU defined.
 *
 * very new version handles also multipart objects
 * This is currently only used for the boulder roll code.
 * Returns 1 if object does not fit, 0 if it does.
 */

int
try_fit (object *op, maptile *m, int x, int y)
{
  object *tmp, *more;
  sint16 tx, ty;
  int mflags;
  maptile *m2;

  if (op->head)
    op = op->head;

  for (more = op; more; more = more->more)
    {
      tx = x + more->x - op->x;
      ty = y + more->y - op->y;

      mflags = get_map_flags (m, &m2, tx, ty, &tx, &ty);

      if (mflags & P_OUT_OF_MAP)
        return 1;

      for (tmp = GET_MAP_OB (m2, tx, ty); tmp; tmp = tmp->above)
        {
          if (tmp->head == op || tmp == op)
            continue;

          if ((QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->type != DOOR))
            return 1;

          if (OB_MOVE_BLOCK (op, tmp))
            return 1;

        }
    }
  return 0;
}

/*
 * this is not perfect yet. 
 * it does not roll objects behind multipart objects properly.
 * Support for rolling multipart objects is questionable.
 */

int
roll_ob (object *op, int dir, object *pusher)
{
  object *tmp;
  sint16 x, y;
  int flags;
  maptile *m;
  MoveType move_block;

  if (op->head)
    op = op->head;

  x = op->x + freearr_x[dir];
  y = op->y + freearr_y[dir];

  if (!QUERY_FLAG (op, FLAG_CAN_ROLL) || (op->weight && random_roll (0, op->weight / 50000 - 1, pusher, PREFER_LOW) > pusher->stats.Str))
    return 0;

  m = op->map;
  flags = get_map_flags (m, &m, x, y, &x, &y);

  if (flags & (P_OUT_OF_MAP | P_IS_ALIVE))
    return 0;

  move_block = GET_MAP_MOVE_BLOCK (m, x, y);

  /* If the target space is not blocked, no need to look at the objects on it */
  if ((op->move_type & move_block) == op->move_type)
    {
      for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
        {
          if (tmp->head == op)
            continue;
          if (OB_MOVE_BLOCK (op, tmp) && !roll_ob (tmp, dir, pusher))
            return 0;
        }
    }
  if (try_fit (op, m, x, y))
    return 0;

  op->remove ();
  for (tmp = op; tmp != NULL; tmp = tmp->more)
    tmp->x += freearr_x[dir], tmp->y += freearr_y[dir];
  insert_ob_in_map (op, op->map, pusher, 0);
  return 1;
}

/* returns 1 if pushing invokes a attack, 0 when not */
int
push_ob (object *who, int dir, object *pusher)
{
  int str1, str2;
  object *owner;

  if (who->head != NULL)
    who = who->head;
  owner = who->owner;

  /* Wake up sleeping monsters that may be pushed */
  CLEAR_FLAG (who, FLAG_SLEEP);

  /* player change place with his pets or summoned creature */
  /* TODO: allow multi arch pushing. Can't be very difficult */
  if (who->more == NULL
      && ((owner && owner->contr && pusher->contr && same_party (owner->contr->party, pusher->contr->party))
          || owner == pusher)
    )
    {
      int temp;
      maptile *m;

      who->remove ();
      pusher->remove ();
      temp = pusher->x;
      pusher->x = who->x;
      who->x = temp;

      temp = pusher->y;
      pusher->y = who->y;
      who->y = temp;

      m = pusher->map;
      pusher->map = who->map;
      who->map = m;

      insert_ob_in_map (who, who->map, pusher, 0);
      insert_ob_in_map (pusher, pusher->map, pusher, 0);
      return 0;
    }

  /* We want ONLY become enemy of evil, unaggressive monster. We must RUN in them */
  /* In original we have here a unaggressive check only - that was the reason why */
  /* we so often become an enemy of friendly monsters... */
  /* funny: was they set to unaggressive 0 (= not so nice) they don't attack */
  if (owner != pusher && pusher->type == PLAYER && who->type != PLAYER &&
      !QUERY_FLAG (who, FLAG_FRIENDLY) && !QUERY_FLAG (who, FLAG_NEUTRAL))
    {
      if (pusher->contr->run_on)        /* only when we run */
        {
          new_draw_info_format (NDI_UNIQUE, 0, pusher, "You start to attack %s!!", &who->name);
          CLEAR_FLAG (who, FLAG_UNAGGRESSIVE);  /* the sucker don't like you anymore */
          who->enemy = pusher;
          return 1;
        }
      else
        new_draw_info_format (NDI_UNIQUE, 0, pusher, "You avoid attacking %s.", &who->name);
    }

  /* now, lets test stand still. we NEVER can push stand_still monsters. */
  if (QUERY_FLAG (who, FLAG_STAND_STILL))
    {
      new_draw_info_format (NDI_UNIQUE, 0, pusher, "You can't push %s.", &who->name);
      return 0;
    }

  /* This block is basically if you are pushing friendly but
   * non pet creaturs.
   * It basically does a random strength comparision to
   * determine if you can push someone around.  Note that
   * this pushes the other person away - its not a swap.
   */

  str1 = (who->stats.Str > 0 ? who->stats.Str : who->level);
  str2 = (pusher->stats.Str > 0 ? pusher->stats.Str : pusher->level);
  if (QUERY_FLAG (who, FLAG_WIZ) ||
      random_roll (str1, str1 * 5 / 2, who, PREFER_HIGH) >=
      random_roll (str2, str2 * 5 / 2, pusher, PREFER_HIGH) || !move_object (who, dir))
    {
      if (who->type == PLAYER)
        new_draw_info_format (NDI_UNIQUE, 0, who, "%s tried to push you.", &pusher->name);

      return 0;
    }

  /* If we get here, the push succeeded.
   * Let everyone know the status.
   */
  if (who->type == PLAYER)
    {
      new_draw_info_format (NDI_UNIQUE, 0, who, "%s pushed you.", &pusher->name);
    }
  if (pusher->type == PLAYER)
    {
      new_draw_info_format (NDI_UNIQUE, 0, pusher, "You pushed %s back.", &who->name);
    }

  return 1;
}
Revision:	1.24
Committed:	Tue May 6 16:55:26 2008 UTC (16 years ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_54
Changes since 1.23:	+1 -1 lines
Log Message:	update copyright
#	User	Rev	Content
1	elmex	1.1	/*
2	root	1.22	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	pippijn	1.15	*
4	root	1.24	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	root	1.19	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6			* Copyright (©) 1992,2007 Frank Tore Johansen
7	pippijn	1.15	*
8	root	1.22	* Deliantra is free software: you can redistribute it and/or modify
9	root	1.21	* 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
11			* (at your option) any later version.
12	pippijn	1.15	*
13	root	1.21	* This program is distributed in the hope that it will be useful,
14			* but WITHOUT ANY WARRANTY; without even the implied warranty of
15			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16			* GNU General Public License for more details.
17	pippijn	1.15	*
18	root	1.21	* 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/>.
20	root	1.19	*
21	root	1.22	* The authors can be reached via e-mail to <support@deliantra.net>
22	pippijn	1.15	*/
23	elmex	1.1
24			#include <global.h>
25			#ifndef __CEXTRACT__
26	root	1.7	# include <sproto.h>
27	elmex	1.1	#endif
28
29			/*
30			* move_object() tries to move object op in the direction "dir".
31			* If it fails (something blocks the passage), it returns 0,
32			* otherwise 1.
33			* This is an improvement from the previous move_ob(), which
34			* removed and inserted objects even if they were unable to move.
35			*/
36
37	root	1.7	int
38			move_object (object *op, int dir)
39			{
40			return move_ob (op, dir, op);
41	elmex	1.1	}
42
43			/* object op is trying to move in direction dir.
44			* originator is typically the same as op, but
45			* can be different if originator is causing op to
46			* move (originator is pushing op)
47			* returns 0 if the object is not able to move to the
48			* desired space, 1 otherwise (in which case we also
49			* move the object accordingly. This function is
50			* very similiar to move_object.
51			*/
52	root	1.7	int
53			move_ob (object op, int dir, object originator)
54	elmex	1.1	{
55	root	1.7	sint16 newx = op->x + freearr_x[dir];
56			sint16 newy = op->y + freearr_y[dir];
57			object *tmp;
58	root	1.9	maptile *m;
59	root	1.7	int mflags;
60	elmex	1.1
61	root	1.7	if (op == NULL)
62			{
63			LOG (llevError, "Trying to move NULL.\n");
64			return 0;
65	elmex	1.1	}
66
67	root	1.7	m = op->map;
68			mflags = get_map_flags (m, &m, newx, newy, &newx, &newy);
69
70			/* If the space the player is trying to is out of the map,
71			* bail now - we know it can't work.
72			*/
73			if (mflags & P_OUT_OF_MAP)
74			return 0;
75	elmex	1.1
76	root	1.7	/* Is this space blocked? Players with wizpass are immune to
77			* this condition.
78			*/
79			if (blocked_link (op, m, newx, newy) && !QUERY_FLAG (op, FLAG_WIZPASS))
80			return 0;
81	elmex	1.1
82	root	1.7	/* 0.94.2 - we need to set the direction for the new animation code.
83			* it uses it to figure out face to use - I can't see it
84			* breaking anything, but it might.
85			*/
86	root	1.12	if (op->more && !move_ob (op->more, dir, op->more->head))
87	root	1.7	return 0;
88	elmex	1.1
89	root	1.7	op->direction = dir;
90	elmex	1.1
91	root	1.7	if (op->will_apply & 4)
92			check_earthwalls (op, m, newx, newy);
93	root	1.12
94	root	1.7	if (op->will_apply & 8)
95			check_doors (op, m, newx, newy);
96
97			/* 0.94.1 - I got a stack trace that showed it crash with remove_ob trying
98			* to remove a removed object, and this function was the culprit. A possible
99			* guess I have is that check_doors above ran into a trap, killing the
100			* monster.
101			*
102			* Unfortunately, it doesn't appear that the calling functions of move_object
103			* deal very well with op being killed, so all this might do is just
104			* migrate the problem someplace else.
105			*/
106	elmex	1.1
107	root	1.7	if (QUERY_FLAG (op, FLAG_REMOVED))
108			{
109			LOG (llevDebug, "move_object: monster has been removed - will not process further\n");
110			/* Was not successful, but don't want to try and move again */
111			return 1;
112	elmex	1.1	}
113
114	root	1.7	/* If this is a tail portion, just want to tell caller that move is
115			* ok - the caller will deal with actual object removal/insertion
116			*/
117			if (op->head)
118			return 1;
119	elmex	1.1
120	root	1.13	if (m != op->map && op->contr)
121			{
122			if (INVOKE_MAP (LEAVE, op->map, ARG_PLAYER (op->contr)))
123			return 0;
124
125			op->remove ();
126
127			if (INVOKE_PLAYER (MAP_CHANGE, op->contr, ARG_MAP (m), ARG_INT (newx), ARG_INT (newy)))
128			return 0;
129
130			if (INVOKE_MAP (ENTER, m, ARG_PLAYER (op->contr), ARG_INT (newx), ARG_INT (newy)))
131			return 0;
132			}
133			else
134			op->remove ();
135	elmex	1.1
136	root	1.7	/* we already have newx, newy, and m, so lets use them.
137			* In addition, this fixes potential crashes, because multipart object was
138			* on edge of map, +=x, +=y doesn't make correct coordinates.
139			*/
140			for (tmp = op; tmp != NULL; tmp = tmp->more)
141			{
142			tmp->x += freearr_x[dir];
143			tmp->y += freearr_y[dir];
144			tmp->map = get_map_from_coord (tmp->map, &tmp->x, &tmp->y);
145	elmex	1.1	}
146
147	root	1.7	/* insert_ob_in_map will deal with any tiling issues */
148			insert_ob_in_map (op, m, originator, 0);
149	elmex	1.1
150	root	1.7	return 1;
151	elmex	1.1	}
152
153
154			/*
155			* transfer_ob(): Move an object (even linked objects) to another spot
156			* on the same map.
157			*
158			* Does nothing if there is no free spot.
159			*
160			* randomly: If true, use find_free_spot() to find the destination, otherwise
161			* use find_first_free_spot().
162			*
163			* Return value: 1 if object was destroyed, 0 otherwise.
164			*/
165
166	root	1.7	int
167			transfer_ob (object op, int x, int y, int randomly, object originator)
168	elmex	1.1	{
169	root	1.7	int i;
170			object *tmp;
171
172			if (randomly)
173			i = find_free_spot (op, op->map, x, y, 0, SIZEOFFREE);
174			else
175			i = find_first_free_spot (op, op->map, x, y);
176
177			if (i == -1)
178			return 0; /* No free spot */
179
180			if (op->head != NULL)
181			op = op->head;
182	root	1.10	op->remove ();
183	root	1.7	for (tmp = op; tmp != NULL; tmp = tmp->more)
184	root	1.20	tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->x),
185			tmp->y = y + freearr_y[i] + (tmp->arch == NULL ? 0 : tmp->arch->y);
186	elmex	1.1
187	root	1.7	tmp = insert_ob_in_map (op, op->map, originator, 0);
188			if (tmp)
189			return 0;
190			else
191			return 1;
192	elmex	1.1	}
193
194			/*
195			* Return value: 1 if object was destroyed, 0 otherwise.
196			* Modified so that instead of passing the 'originator' that had no
197			* real use, instead we pass the 'user' of the teleporter. All the
198			* callers know what they wanted to teleporter (move_teleporter or
199			* shop map code)
200			* tele_type is the type of teleporter we want to match against -
201			* currently, this is either set to SHOP_MAT or TELEPORTER.
202			* It is basically used so that shop_mats and normal teleporters can
203			* be used close to each other and not have the player put to the
204			* one of another type.
205			*/
206	root	1.7	int
207			teleport (object teleporter, uint8 tele_type, object user)
208	elmex	1.1	{
209	root	1.7	object *altern;
210			int i, j, k, nrofalt = 0;
211			object other_teleporter, tmp;
212	root	1.9	maptile *m;
213	root	1.7	sint16 sx, sy;
214
215			if (user == NULL)
216			return 0;
217			if (user->head != NULL)
218			user = user->head;
219	elmex	1.1
220	root	1.7	/* Find all other teleporters within range. This range
221			* should really be setable by some object attribute instead of
222			* using hard coded values.
223			*/
224			for (i = -5; i < 6; i++)
225			for (j = -5; j < 6; j++)
226			{
227			if (i == 0 && j == 0)
228			continue;
229			/* Perhaps this should be extended to support tiled maps */
230			if (OUT_OF_REAL_MAP (teleporter->map, teleporter->x + i, teleporter->y + j))
231			continue;
232	root	1.12	other_teleporter = GET_MAP_OB (teleporter->map, teleporter->x + i, teleporter->y + j);
233	root	1.7
234			while (other_teleporter)
235			{
236			if (other_teleporter->type == tele_type)
237			break;
238			other_teleporter = other_teleporter->above;
239			}
240			if (other_teleporter && !(RANDOM () % ++nrofalt))
241			altern = other_teleporter;
242			}
243	elmex	1.1
244	root	1.7	if (!nrofalt)
245			{
246	root	1.23	LOG (llevError, "%s: no alternative teleporters around (user %s).\n",
247			teleporter->debug_desc (), user->debug_desc ());
248	root	1.7	return 0;
249	elmex	1.1	}
250
251	root	1.7	other_teleporter = altern;
252			k = find_free_spot (user, other_teleporter->map, other_teleporter->x, other_teleporter->y, 1, 9);
253
254			/* if k==-1, unable to find a free spot. If this is shop
255			* mat that the player is using, find someplace to move
256			* the player - otherwise, player can get trapped in the shops
257			* that appear in random dungeons. We basically just make
258			* sure the space isn't no pass (eg wall), and don't care
259			* about is alive.
260			*/
261			if (k == -1)
262			{
263			if (tele_type == SHOP_MAT && user->type == PLAYER)
264			{
265			for (k = 1; k < 9; k++)
266			{
267			if (get_map_flags (other_teleporter->map, &m,
268			other_teleporter->x + freearr_x[k], other_teleporter->y + freearr_y[k], &sx, &sy) & P_OUT_OF_MAP)
269			continue;
270	root	1.4
271	root	1.7	if (!OB_TYPE_MOVE_BLOCK (user, GET_MAP_MOVE_BLOCK (m, sx, sy)))
272			break;
273	root	1.4
274			}
275	root	1.7	if (k == 9)
276			{
277			LOG (llevError, "Shop mat %s (%d, %d) is in solid rock?\n",
278			&other_teleporter->name, other_teleporter->x, other_teleporter->y);
279			return 0;
280	root	1.4	}
281			}
282	root	1.7	else
283			return 0;
284	elmex	1.1	}
285
286	root	1.10	user->remove ();
287	elmex	1.1
288	root	1.7	/* Update location for the object */
289			for (tmp = user; tmp != NULL; tmp = tmp->more)
290			{
291	root	1.20	tmp->x = other_teleporter->x + freearr_x[k] + (tmp->arch == NULL ? 0 : tmp->arch->x);
292			tmp->y = other_teleporter->y + freearr_y[k] + (tmp->arch == NULL ? 0 : tmp->arch->y);
293	elmex	1.1	}
294	root	1.7	tmp = insert_ob_in_map (user, other_teleporter->map, NULL, 0);
295			return (tmp == NULL);
296	elmex	1.1	}
297
298	root	1.7	void
299			recursive_roll (object op, int dir, object pusher)
300			{
301			if (!roll_ob (op, dir, pusher))
302			{
303			new_draw_info_format (NDI_UNIQUE, 0, pusher, "You fail to push the %s.", query_name (op));
304			return;
305			}
306			(void) move_ob (pusher, dir, pusher);
307			new_draw_info_format (NDI_BLACK, 0, pusher, "You move the %s.", query_name (op));
308	elmex	1.1	return;
309			}
310
311			/*
312			* This is a new version of blocked, this one handles objects
313			* that can be passed through by monsters with the CAN_PASS_THRU defined.
314			*
315			* very new version handles also multipart objects
316			* This is currently only used for the boulder roll code.
317			* Returns 1 if object does not fit, 0 if it does.
318			*/
319
320	root	1.7	int
321	root	1.9	try_fit (object op, maptile m, int x, int y)
322	elmex	1.1	{
323	root	1.7	object tmp, more;
324			sint16 tx, ty;
325			int mflags;
326	root	1.9	maptile *m2;
327	elmex	1.1
328	root	1.7	if (op->head)
329			op = op->head;
330	elmex	1.1
331	root	1.7	for (more = op; more; more = more->more)
332			{
333			tx = x + more->x - op->x;
334			ty = y + more->y - op->y;
335	elmex	1.1
336	root	1.7	mflags = get_map_flags (m, &m2, tx, ty, &tx, &ty);
337	elmex	1.1
338	root	1.7	if (mflags & P_OUT_OF_MAP)
339			return 1;
340	elmex	1.1
341	root	1.12	for (tmp = GET_MAP_OB (m2, tx, ty); tmp; tmp = tmp->above)
342	root	1.7	{
343			if (tmp->head == op \|\| tmp == op)
344			continue;
345	elmex	1.1
346	root	1.7	if ((QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->type != DOOR))
347			return 1;
348	elmex	1.1
349	root	1.7	if (OB_MOVE_BLOCK (op, tmp))
350			return 1;
351	elmex	1.1
352	root	1.4	}
353	elmex	1.1	}
354	root	1.7	return 0;
355	elmex	1.1	}
356
357			/*
358			* this is not perfect yet.
359			* it does not roll objects behind multipart objects properly.
360			* Support for rolling multipart objects is questionable.
361			*/
362
363	root	1.7	int
364			roll_ob (object op, int dir, object pusher)
365			{
366			object *tmp;
367			sint16 x, y;
368			int flags;
369	root	1.9	maptile *m;
370	root	1.7	MoveType move_block;
371
372			if (op->head)
373			op = op->head;
374
375			x = op->x + freearr_x[dir];
376			y = op->y + freearr_y[dir];
377
378			if (!QUERY_FLAG (op, FLAG_CAN_ROLL) \|\| (op->weight && random_roll (0, op->weight / 50000 - 1, pusher, PREFER_LOW) > pusher->stats.Str))
379			return 0;
380	elmex	1.1
381	root	1.7	m = op->map;
382			flags = get_map_flags (m, &m, x, y, &x, &y);
383	elmex	1.1
384	root	1.7	if (flags & (P_OUT_OF_MAP \| P_IS_ALIVE))
385			return 0;
386	elmex	1.1
387	root	1.7	move_block = GET_MAP_MOVE_BLOCK (m, x, y);
388	elmex	1.1
389	root	1.7	/* If the target space is not blocked, no need to look at the objects on it */
390			if ((op->move_type & move_block) == op->move_type)
391			{
392	root	1.12	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
393	root	1.7	{
394			if (tmp->head == op)
395	root	1.4	continue;
396	root	1.7	if (OB_MOVE_BLOCK (op, tmp) && !roll_ob (tmp, dir, pusher))
397	root	1.4	return 0;
398			}
399	elmex	1.1	}
400	root	1.7	if (try_fit (op, m, x, y))
401			return 0;
402	elmex	1.1
403	root	1.10	op->remove ();
404	root	1.7	for (tmp = op; tmp != NULL; tmp = tmp->more)
405			tmp->x += freearr_x[dir], tmp->y += freearr_y[dir];
406			insert_ob_in_map (op, op->map, pusher, 0);
407			return 1;
408	elmex	1.1	}
409
410			/* returns 1 if pushing invokes a attack, 0 when not */
411	root	1.7	int
412			push_ob (object who, int dir, object pusher)
413			{
414			int str1, str2;
415			object *owner;
416
417			if (who->head != NULL)
418			who = who->head;
419	root	1.11	owner = who->owner;
420	root	1.7
421			/* Wake up sleeping monsters that may be pushed */
422			CLEAR_FLAG (who, FLAG_SLEEP);
423
424			/* player change place with his pets or summoned creature */
425			/* TODO: allow multi arch pushing. Can't be very difficult */
426			if (who->more == NULL
427	root	1.18	&& ((owner && owner->contr && pusher->contr && same_party (owner->contr->party, pusher->contr->party))
428			\|\| owner == pusher)
429	root	1.7	)
430			{
431			int temp;
432	root	1.9	maptile *m;
433	root	1.7
434	root	1.10	who->remove ();
435			pusher->remove ();
436	root	1.7	temp = pusher->x;
437			pusher->x = who->x;
438			who->x = temp;
439
440			temp = pusher->y;
441			pusher->y = who->y;
442			who->y = temp;
443	root	1.4
444	root	1.7	m = pusher->map;
445			pusher->map = who->map;
446			who->map = m;
447
448			insert_ob_in_map (who, who->map, pusher, 0);
449			insert_ob_in_map (pusher, pusher->map, pusher, 0);
450			return 0;
451	elmex	1.1	}
452
453	root	1.7	/* We want ONLY become enemy of evil, unaggressive monster. We must RUN in them */
454			/* In original we have here a unaggressive check only - that was the reason why */
455			/* we so often become an enemy of friendly monsters... */
456			/* funny: was they set to unaggressive 0 (= not so nice) they don't attack */
457			if (owner != pusher && pusher->type == PLAYER && who->type != PLAYER &&
458			!QUERY_FLAG (who, FLAG_FRIENDLY) && !QUERY_FLAG (who, FLAG_NEUTRAL))
459			{
460			if (pusher->contr->run_on) /* only when we run */
461			{
462	root	1.16	new_draw_info_format (NDI_UNIQUE, 0, pusher, "You start to attack %s!!", &who->name);
463	root	1.7	CLEAR_FLAG (who, FLAG_UNAGGRESSIVE); /* the sucker don't like you anymore */
464			who->enemy = pusher;
465			return 1;
466	root	1.4	}
467	root	1.7	else
468	root	1.16	new_draw_info_format (NDI_UNIQUE, 0, pusher, "You avoid attacking %s.", &who->name);
469	elmex	1.1	}
470
471	root	1.7	/* now, lets test stand still. we NEVER can push stand_still monsters. */
472			if (QUERY_FLAG (who, FLAG_STAND_STILL))
473	elmex	1.1	{
474	root	1.7	new_draw_info_format (NDI_UNIQUE, 0, pusher, "You can't push %s.", &who->name);
475			return 0;
476	elmex	1.1	}
477	root	1.7
478			/* This block is basically if you are pushing friendly but
479			* non pet creaturs.
480			* It basically does a random strength comparision to
481			* determine if you can push someone around. Note that
482			* this pushes the other person away - its not a swap.
483			*/
484
485			str1 = (who->stats.Str > 0 ? who->stats.Str : who->level);
486			str2 = (pusher->stats.Str > 0 ? pusher->stats.Str : pusher->level);
487			if (QUERY_FLAG (who, FLAG_WIZ) \|\|
488	root	1.17	random_roll (str1, str1 * 5 / 2, who, PREFER_HIGH) >=
489			random_roll (str2, str2 * 5 / 2, pusher, PREFER_HIGH) \|\| !move_object (who, dir))
490	root	1.7	{
491			if (who->type == PLAYER)
492	root	1.17	new_draw_info_format (NDI_UNIQUE, 0, who, "%s tried to push you.", &pusher->name);
493
494	root	1.7	return 0;
495	elmex	1.1	}
496
497	root	1.7	/* If we get here, the push succeeded.
498			* Let everyone know the status.
499			*/
500			if (who->type == PLAYER)
501			{
502			new_draw_info_format (NDI_UNIQUE, 0, who, "%s pushed you.", &pusher->name);
503	elmex	1.1	}
504	root	1.7	if (pusher->type == PLAYER)
505			{
506			new_draw_info_format (NDI_UNIQUE, 0, pusher, "You pushed %s back.", &who->name);
507			}
508
509			return 1;
510	elmex	1.1	}