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 op->move (dir);
}

/* 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)
{
  return op->move (dir, originator);
}

int
object::move (int dir, object *originator)
{
  sint16 newx = x + freearr_x[dir];
  sint16 newy = y + freearr_y[dir];

  mapxy pos (this);
  pos.move (dir);

  /* If the space the object is moving to is out of the map,
   * bail now - we know it can't work.
   */
  if (!pos.normalise ())
    return 0;

  /* Is this space blocked?  Players with wizpass are immune to
   * this condition.
   */
  if (blocked_link (this, pos.m, pos.x, pos.y) && !flag [FLAG_WIZPASS])
    return 0;

  // check tail movability
  if (more && !more->move (dir, more->head))
    return 0;

  /* 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.
   */
  direction = dir;

  if (will_apply & 4)
    check_earthwalls (this, pos.m, pos.x, pos.y);

  if (will_apply & 8)
    check_doors (this, pos.m, pos.x, pos.y);

  /* 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 (head)
    return 1;

  if (pos.m != map && contr)
    {
      if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
        return 0;

      remove ();

      if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (pos.m), ARG_INT (pos.x), ARG_INT (pos.y)))
        return 0;

      if (INVOKE_MAP (ENTER, pos.m, ARG_PLAYER (contr), ARG_INT (pos.x), ARG_INT (pos.y)))
        return 0;
    }

  /* insert_ob_in_map will deal with any tiling issues */
  pos.insert (this, originator);

  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 */

  op = op->head_ ();
  op->remove ();

  for (object *tmp = op; tmp; tmp = tmp->more)
    {
      tmp->x = x + freearr_x[i] + tmp->arch->x;
      tmp->y = y + freearr_y[i] + tmp->arch->y;
    }

  op = insert_ob_in_map (op, op->map, originator, 0);

  return !op;
}

/*
 * 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)
{
  if (!user)
    return 0;

  object *other_teleporter = 0;
  int nrofalt = 0;

  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.
   */
  unordered_mapwalk (teleporter, -5, -5, 5, 5)
    {
      mapspace &ms = m->at (nx, ny);

      for (object *tmp = ms.top; tmp; tmp = tmp->below)
        if (tmp->type == tele_type)
          {
            if ((dx || dy) && !rndm (++nrofalt))
              other_teleporter = tmp;

            break;
          }
      }

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

  int 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->is_player ())
        {
          for (k = 1; k < 9; k++)
            {
              maptile *m;
              sint16 sx, sy;

              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;
    }

  return !other_teleporter->map->insert (
            user, other_teleporter->x + freearr_x[k], other_teleporter->y + freearr_y[k]
         );
}

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)
{
  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 (object *tmp = GET_MAP_OB (m, x, y); tmp; 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->move (dir);

  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.30
Committed:	Sun Dec 28 15:28:47 2008 UTC (15 years, 4 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_76, rel-2_77, rel-2_74, rel-2_75, rel-2_79, rel-2_78
Changes since 1.29:	+48 -96 lines
Log Message:	fix more multipart monster bugs, speed up teleporters, clean up lotsa code
#	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	root	1.7	int
37			move_object (object *op, int dir)
38			{
39	root	1.29	return op->move (dir);
40	elmex	1.1	}
41
42			/* object op is trying to move in direction dir.
43			* originator is typically the same as op, but
44			* can be different if originator is causing op to
45			* move (originator is pushing op)
46			* returns 0 if the object is not able to move to the
47			* desired space, 1 otherwise (in which case we also
48			* move the object accordingly. This function is
49			* very similiar to move_object.
50			*/
51	root	1.7	int
52			move_ob (object op, int dir, object originator)
53	elmex	1.1	{
54	root	1.29	return op->move (dir, originator);
55			}
56
57			int
58			object::move (int dir, object *originator)
59			{
60			sint16 newx = x + freearr_x[dir];
61			sint16 newy = y + freearr_y[dir];
62	elmex	1.1
63	root	1.30	mapxy pos (this);
64			pos.move (dir);
65	root	1.7
66	root	1.30	/* If the space the object is moving to is out of the map,
67	root	1.7	* bail now - we know it can't work.
68			*/
69	root	1.30	if (!pos.normalise ())
70	root	1.7	return 0;
71	elmex	1.1
72	root	1.7	/* Is this space blocked? Players with wizpass are immune to
73			* this condition.
74			*/
75	root	1.30	if (blocked_link (this, pos.m, pos.x, pos.y) && !flag [FLAG_WIZPASS])
76	root	1.7	return 0;
77	elmex	1.1
78	root	1.30	// check tail movability
79			if (more && !more->move (dir, more->head))
80			return 0;
81
82			/* we need to set the direction for the new animation code.
83	root	1.7	* it uses it to figure out face to use - I can't see it
84			* breaking anything, but it might.
85			*/
86	root	1.29	direction = dir;
87	elmex	1.1
88	root	1.29	if (will_apply & 4)
89	root	1.30	check_earthwalls (this, pos.m, pos.x, pos.y);
90	root	1.12
91	root	1.29	if (will_apply & 8)
92	root	1.30	check_doors (this, pos.m, pos.x, pos.y);
93	elmex	1.1
94	root	1.7	/* If this is a tail portion, just want to tell caller that move is
95			* ok - the caller will deal with actual object removal/insertion
96			*/
97	root	1.29	if (head)
98	root	1.7	return 1;
99	elmex	1.1
100	root	1.30	if (pos.m != map && contr)
101	root	1.13	{
102	root	1.29	if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
103	root	1.13	return 0;
104
105	root	1.29	remove ();
106	root	1.13
107	root	1.30	if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (pos.m), ARG_INT (pos.x), ARG_INT (pos.y)))
108	root	1.13	return 0;
109
110	root	1.30	if (INVOKE_MAP (ENTER, pos.m, ARG_PLAYER (contr), ARG_INT (pos.x), ARG_INT (pos.y)))
111	root	1.13	return 0;
112			}
113	elmex	1.1
114	root	1.7	/* insert_ob_in_map will deal with any tiling issues */
115	root	1.30	pos.insert (this, originator);
116	elmex	1.1
117	root	1.7	return 1;
118	elmex	1.1	}
119
120			/*
121			* transfer_ob(): Move an object (even linked objects) to another spot
122			* on the same map.
123			*
124			* Does nothing if there is no free spot.
125			*
126			* randomly: If true, use find_free_spot() to find the destination, otherwise
127			* use find_first_free_spot().
128			*
129			* Return value: 1 if object was destroyed, 0 otherwise.
130			*/
131
132	root	1.7	int
133			transfer_ob (object op, int x, int y, int randomly, object originator)
134	elmex	1.1	{
135	root	1.7	int i;
136			object *tmp;
137
138			if (randomly)
139			i = find_free_spot (op, op->map, x, y, 0, SIZEOFFREE);
140			else
141			i = find_first_free_spot (op, op->map, x, y);
142
143			if (i == -1)
144			return 0; /* No free spot */
145
146	root	1.26	op = op->head_ ();
147	root	1.10	op->remove ();
148	elmex	1.1
149	root	1.26	for (object *tmp = op; tmp; tmp = tmp->more)
150			{
151	root	1.30	tmp->x = x + freearr_x[i] + tmp->arch->x;
152			tmp->y = y + freearr_y[i] + tmp->arch->y;
153	root	1.26	}
154
155			op = insert_ob_in_map (op, op->map, originator, 0);
156
157			return !op;
158	elmex	1.1	}
159
160			/*
161			* Return value: 1 if object was destroyed, 0 otherwise.
162			* Modified so that instead of passing the 'originator' that had no
163			* real use, instead we pass the 'user' of the teleporter. All the
164			* callers know what they wanted to teleporter (move_teleporter or
165			* shop map code)
166			* tele_type is the type of teleporter we want to match against -
167			* currently, this is either set to SHOP_MAT or TELEPORTER.
168			* It is basically used so that shop_mats and normal teleporters can
169			* be used close to each other and not have the player put to the
170			* one of another type.
171			*/
172	root	1.7	int
173			teleport (object teleporter, uint8 tele_type, object user)
174	elmex	1.1	{
175	root	1.30	if (!user)
176			return 0;
177
178			object *other_teleporter = 0;
179			int nrofalt = 0;
180	root	1.7
181	root	1.30	user = user->head_ ();
182	elmex	1.1
183	root	1.7	/* Find all other teleporters within range. This range
184			* should really be setable by some object attribute instead of
185			* using hard coded values.
186			*/
187	root	1.30	unordered_mapwalk (teleporter, -5, -5, 5, 5)
188			{
189			mapspace &ms = m->at (nx, ny);
190	root	1.28
191	root	1.30	for (object *tmp = ms.top; tmp; tmp = tmp->below)
192			if (tmp->type == tele_type)
193			{
194			if ((dx \|\| dy) && !rndm (++nrofalt))
195			other_teleporter = tmp;
196	root	1.7
197	root	1.30	break;
198	root	1.7	}
199			}
200	elmex	1.1
201	root	1.7	if (!nrofalt)
202			{
203	root	1.23	LOG (llevError, "%s: no alternative teleporters around (user %s).\n",
204			teleporter->debug_desc (), user->debug_desc ());
205	root	1.7	return 0;
206	elmex	1.1	}
207
208	root	1.30	int k = find_free_spot (user, other_teleporter->map, other_teleporter->x, other_teleporter->y, 1, 9);
209	root	1.7
210			/* if k==-1, unable to find a free spot. If this is shop
211			* mat that the player is using, find someplace to move
212			* the player - otherwise, player can get trapped in the shops
213			* that appear in random dungeons. We basically just make
214			* sure the space isn't no pass (eg wall), and don't care
215			* about is alive.
216			*/
217			if (k == -1)
218			{
219	root	1.30	if (tele_type == SHOP_MAT && user->is_player ())
220	root	1.7	{
221			for (k = 1; k < 9; k++)
222			{
223	root	1.30	maptile *m;
224			sint16 sx, sy;
225
226	root	1.7	if (get_map_flags (other_teleporter->map, &m,
227			other_teleporter->x + freearr_x[k], other_teleporter->y + freearr_y[k], &sx, &sy) & P_OUT_OF_MAP)
228			continue;
229	root	1.4
230	root	1.7	if (!OB_TYPE_MOVE_BLOCK (user, GET_MAP_MOVE_BLOCK (m, sx, sy)))
231			break;
232	root	1.30	}
233	root	1.4
234	root	1.7	if (k == 9)
235			{
236			LOG (llevError, "Shop mat %s (%d, %d) is in solid rock?\n",
237			&other_teleporter->name, other_teleporter->x, other_teleporter->y);
238			return 0;
239	root	1.4	}
240			}
241	root	1.7	else
242			return 0;
243	elmex	1.1	}
244
245	root	1.30	return !other_teleporter->map->insert (
246			user, other_teleporter->x + freearr_x[k], other_teleporter->y + freearr_y[k]
247			);
248	elmex	1.1	}
249
250	root	1.7	void
251			recursive_roll (object op, int dir, object pusher)
252			{
253			if (!roll_ob (op, dir, pusher))
254			{
255			new_draw_info_format (NDI_UNIQUE, 0, pusher, "You fail to push the %s.", query_name (op));
256			return;
257			}
258			(void) move_ob (pusher, dir, pusher);
259			new_draw_info_format (NDI_BLACK, 0, pusher, "You move the %s.", query_name (op));
260	elmex	1.1	return;
261			}
262
263			/*
264			* This is a new version of blocked, this one handles objects
265			* that can be passed through by monsters with the CAN_PASS_THRU defined.
266			*
267			* very new version handles also multipart objects
268			* This is currently only used for the boulder roll code.
269			* Returns 1 if object does not fit, 0 if it does.
270			*/
271
272	root	1.7	int
273	root	1.9	try_fit (object op, maptile m, int x, int y)
274	elmex	1.1	{
275	root	1.7	object tmp, more;
276			sint16 tx, ty;
277			int mflags;
278	root	1.9	maptile *m2;
279	elmex	1.1
280	root	1.7	if (op->head)
281			op = op->head;
282	elmex	1.1
283	root	1.7	for (more = op; more; more = more->more)
284			{
285			tx = x + more->x - op->x;
286			ty = y + more->y - op->y;
287	elmex	1.1
288	root	1.7	mflags = get_map_flags (m, &m2, tx, ty, &tx, &ty);
289	elmex	1.1
290	root	1.7	if (mflags & P_OUT_OF_MAP)
291			return 1;
292	elmex	1.1
293	root	1.12	for (tmp = GET_MAP_OB (m2, tx, ty); tmp; tmp = tmp->above)
294	root	1.7	{
295			if (tmp->head == op \|\| tmp == op)
296			continue;
297	elmex	1.1
298	root	1.7	if ((QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->type != DOOR))
299			return 1;
300	elmex	1.1
301	root	1.7	if (OB_MOVE_BLOCK (op, tmp))
302			return 1;
303	elmex	1.1
304	root	1.4	}
305	elmex	1.1	}
306	root	1.7	return 0;
307	elmex	1.1	}
308
309			/*
310			* this is not perfect yet.
311			* it does not roll objects behind multipart objects properly.
312			* Support for rolling multipart objects is questionable.
313			*/
314	root	1.7	int
315			roll_ob (object op, int dir, object pusher)
316			{
317			sint16 x, y;
318			int flags;
319	root	1.9	maptile *m;
320	root	1.7	MoveType move_block;
321
322			if (op->head)
323			op = op->head;
324
325			x = op->x + freearr_x[dir];
326			y = op->y + freearr_y[dir];
327
328	root	1.25	if (!QUERY_FLAG (op, FLAG_CAN_ROLL)
329			\|\| (op->weight && random_roll (0, op->weight / 50000 - 1, pusher, PREFER_LOW)
330			> pusher->stats.Str))
331	root	1.7	return 0;
332	elmex	1.1
333	root	1.7	m = op->map;
334			flags = get_map_flags (m, &m, x, y, &x, &y);
335	elmex	1.1
336	root	1.7	if (flags & (P_OUT_OF_MAP \| P_IS_ALIVE))
337			return 0;
338	elmex	1.1
339	root	1.7	move_block = GET_MAP_MOVE_BLOCK (m, x, y);
340	elmex	1.1
341	root	1.7	/* If the target space is not blocked, no need to look at the objects on it */
342			if ((op->move_type & move_block) == op->move_type)
343			{
344	root	1.30	for (object *tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above)
345	root	1.7	{
346			if (tmp->head == op)
347	root	1.4	continue;
348	root	1.30
349	root	1.7	if (OB_MOVE_BLOCK (op, tmp) && !roll_ob (tmp, dir, pusher))
350	root	1.4	return 0;
351			}
352	elmex	1.1	}
353	root	1.30
354	root	1.7	if (try_fit (op, m, x, y))
355			return 0;
356	elmex	1.1
357	root	1.30	op->move (dir);
358
359	root	1.7	return 1;
360	elmex	1.1	}
361
362			/* returns 1 if pushing invokes a attack, 0 when not */
363	root	1.7	int
364			push_ob (object who, int dir, object pusher)
365			{
366			int str1, str2;
367			object *owner;
368
369			if (who->head != NULL)
370			who = who->head;
371	root	1.11	owner = who->owner;
372	root	1.7
373			/* Wake up sleeping monsters that may be pushed */
374			CLEAR_FLAG (who, FLAG_SLEEP);
375
376			/* player change place with his pets or summoned creature */
377			/* TODO: allow multi arch pushing. Can't be very difficult */
378			if (who->more == NULL
379	root	1.18	&& ((owner && owner->contr && pusher->contr && same_party (owner->contr->party, pusher->contr->party))
380			\|\| owner == pusher)
381	root	1.7	)
382			{
383			int temp;
384	root	1.9	maptile *m;
385	root	1.7
386	root	1.10	who->remove ();
387			pusher->remove ();
388	root	1.7	temp = pusher->x;
389			pusher->x = who->x;
390			who->x = temp;
391
392			temp = pusher->y;
393			pusher->y = who->y;
394			who->y = temp;
395	root	1.4
396	root	1.7	m = pusher->map;
397			pusher->map = who->map;
398			who->map = m;
399
400			insert_ob_in_map (who, who->map, pusher, 0);
401			insert_ob_in_map (pusher, pusher->map, pusher, 0);
402	root	1.30
403	root	1.7	return 0;
404	elmex	1.1	}
405
406	root	1.7	/* We want ONLY become enemy of evil, unaggressive monster. We must RUN in them */
407			/* In original we have here a unaggressive check only - that was the reason why */
408			/* we so often become an enemy of friendly monsters... */
409			/* funny: was they set to unaggressive 0 (= not so nice) they don't attack */
410			if (owner != pusher && pusher->type == PLAYER && who->type != PLAYER &&
411			!QUERY_FLAG (who, FLAG_FRIENDLY) && !QUERY_FLAG (who, FLAG_NEUTRAL))
412			{
413			if (pusher->contr->run_on) /* only when we run */
414			{
415	root	1.16	new_draw_info_format (NDI_UNIQUE, 0, pusher, "You start to attack %s!!", &who->name);
416	root	1.7	CLEAR_FLAG (who, FLAG_UNAGGRESSIVE); /* the sucker don't like you anymore */
417			who->enemy = pusher;
418			return 1;
419	root	1.4	}
420	root	1.7	else
421	root	1.16	new_draw_info_format (NDI_UNIQUE, 0, pusher, "You avoid attacking %s.", &who->name);
422	elmex	1.1	}
423
424	root	1.7	/* now, lets test stand still. we NEVER can push stand_still monsters. */
425			if (QUERY_FLAG (who, FLAG_STAND_STILL))
426	elmex	1.1	{
427	root	1.7	new_draw_info_format (NDI_UNIQUE, 0, pusher, "You can't push %s.", &who->name);
428			return 0;
429	elmex	1.1	}
430	root	1.7
431			/* This block is basically if you are pushing friendly but
432			* non pet creaturs.
433			* It basically does a random strength comparision to
434			* determine if you can push someone around. Note that
435			* this pushes the other person away - its not a swap.
436			*/
437
438			str1 = (who->stats.Str > 0 ? who->stats.Str : who->level);
439			str2 = (pusher->stats.Str > 0 ? pusher->stats.Str : pusher->level);
440			if (QUERY_FLAG (who, FLAG_WIZ) \|\|
441	root	1.17	random_roll (str1, str1 * 5 / 2, who, PREFER_HIGH) >=
442			random_roll (str2, str2 * 5 / 2, pusher, PREFER_HIGH) \|\| !move_object (who, dir))
443	root	1.7	{
444			if (who->type == PLAYER)
445	root	1.17	new_draw_info_format (NDI_UNIQUE, 0, who, "%s tried to push you.", &pusher->name);
446
447	root	1.7	return 0;
448	elmex	1.1	}
449
450	root	1.7	/* If we get here, the push succeeded.
451			* Let everyone know the status.
452			*/
453			if (who->type == PLAYER)
454			{
455			new_draw_info_format (NDI_UNIQUE, 0, who, "%s pushed you.", &pusher->name);
456	elmex	1.1	}
457	root	1.7	if (pusher->type == PLAYER)
458			{
459			new_draw_info_format (NDI_UNIQUE, 0, pusher, "You pushed %s back.", &who->name);
460			}
461
462			return 1;
463	elmex	1.1	}