1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
25 | #ifndef __CEXTRACT__ |
26 | #ifndef __CEXTRACT__ |
26 | # include <sproto.h> |
27 | # include <sproto.h> |
27 | #endif |
28 | #endif |
28 | |
29 | |
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 | int |
30 | int |
38 | move_object (object *op, int dir) |
|
|
39 | { |
|
|
40 | return move_ob (op, dir, op); |
|
|
41 | } |
|
|
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 | int |
|
|
53 | move_ob (object *op, int dir, object *originator) |
31 | object::move (int dir, object *originator) |
54 | { |
32 | { |
55 | sint16 newx = op->x + freearr_x[dir]; |
33 | sint16 newx = x + freearr_x[dir]; |
56 | sint16 newy = op->y + freearr_y[dir]; |
34 | sint16 newy = y + freearr_y[dir]; |
57 | object *tmp; |
|
|
58 | maptile *m; |
|
|
59 | int mflags; |
|
|
60 | |
35 | |
61 | if (op == NULL) |
36 | mapxy pos (this); |
62 | { |
37 | pos.move (dir); |
63 | LOG (llevError, "Trying to move NULL.\n"); |
|
|
64 | return 0; |
|
|
65 | } |
|
|
66 | |
38 | |
67 | 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, |
39 | /* If the space the object is moving to is out of the map, |
71 | * bail now - we know it can't work. |
40 | * bail now - we know it can't work. |
72 | */ |
41 | */ |
73 | if (mflags & P_OUT_OF_MAP) |
42 | if (!pos.normalise ()) |
74 | return 0; |
43 | return 0; |
75 | |
44 | |
76 | /* Is this space blocked? Players with wizpass are immune to |
45 | /* Is this space blocked? Players with wizpass are immune to |
77 | * this condition. |
46 | * this condition. |
78 | */ |
47 | */ |
79 | if (blocked_link (op, m, newx, newy) && !QUERY_FLAG (op, FLAG_WIZPASS)) |
48 | if (blocked_link (this, pos.m, pos.x, pos.y) && !flag [FLAG_WIZPASS]) |
80 | return 0; |
49 | return 0; |
81 | |
50 | |
|
|
51 | // check tail movability |
|
|
52 | if (more && !more->move (dir, more->head)) |
|
|
53 | return 0; |
|
|
54 | |
82 | /* 0.94.2 - we need to set the direction for the new animation code. |
55 | /* 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 |
56 | * it uses it to figure out face to use - I can't see it |
84 | * breaking anything, but it might. |
57 | * breaking anything, but it might. |
85 | */ |
58 | */ |
86 | if (op->more && !move_ob (op->more, dir, op->more->head)) |
|
|
87 | return 0; |
|
|
88 | |
|
|
89 | op->direction = dir; |
59 | direction = dir; |
90 | |
60 | |
91 | if (op->will_apply & 4) |
61 | if (will_apply & 4) |
92 | check_earthwalls (op, m, newx, newy); |
62 | check_earthwalls (this, pos.m, pos.x, pos.y); |
93 | |
63 | |
94 | if (op->will_apply & 8) |
64 | if (will_apply & 8) |
95 | check_doors (op, m, newx, newy); |
65 | check_doors (this, pos.m, pos.x, pos.y); |
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 | |
|
|
107 | 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 | } |
|
|
113 | |
66 | |
114 | /* If this is a tail portion, just want to tell caller that move is |
67 | /* 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 |
68 | * ok - the caller will deal with actual object removal/insertion |
116 | */ |
69 | */ |
117 | if (op->head) |
70 | if (head) |
118 | return 1; |
71 | return 1; |
119 | |
72 | |
120 | if (m != op->map && op->contr) |
73 | if (pos.m != map && contr) |
121 | { |
74 | { |
122 | if (INVOKE_MAP (LEAVE, op->map, ARG_PLAYER (op->contr))) |
75 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
123 | return 0; |
76 | return 0; |
124 | |
77 | |
125 | op->remove (); |
78 | remove (); |
126 | |
79 | |
127 | if (INVOKE_PLAYER (MAP_CHANGE, op->contr, ARG_MAP (m), ARG_INT (newx), ARG_INT (newy))) |
80 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (pos.m), ARG_INT (pos.x), ARG_INT (pos.y))) |
128 | return 0; |
81 | return 0; |
129 | |
82 | |
130 | if (INVOKE_MAP (ENTER, m, ARG_PLAYER (op->contr), ARG_INT (newx), ARG_INT (newy))) |
83 | if (INVOKE_MAP (ENTER, pos.m, ARG_PLAYER (contr), ARG_INT (pos.x), ARG_INT (pos.y))) |
131 | return 0; |
84 | return 0; |
132 | } |
85 | } |
133 | else |
|
|
134 | op->remove (); |
|
|
135 | |
|
|
136 | /* 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 | } |
|
|
146 | |
86 | |
147 | /* insert_ob_in_map will deal with any tiling issues */ |
87 | /* insert_ob_in_map will deal with any tiling issues */ |
148 | insert_ob_in_map (op, m, originator, 0); |
88 | pos.insert (this, originator); |
149 | |
89 | |
150 | return 1; |
90 | return 1; |
151 | } |
91 | } |
152 | |
|
|
153 | |
92 | |
154 | /* |
93 | /* |
155 | * transfer_ob(): Move an object (even linked objects) to another spot |
94 | * transfer_ob(): Move an object (even linked objects) to another spot |
156 | * on the same map. |
95 | * on the same map. |
157 | * |
96 | * |
… | |
… | |
175 | i = find_first_free_spot (op, op->map, x, y); |
114 | i = find_first_free_spot (op, op->map, x, y); |
176 | |
115 | |
177 | if (i == -1) |
116 | if (i == -1) |
178 | return 0; /* No free spot */ |
117 | return 0; /* No free spot */ |
179 | |
118 | |
180 | if (op->head != NULL) |
|
|
181 | op = op->head; |
119 | op = op->head_ (); |
182 | op->remove (); |
120 | op->remove (); |
|
|
121 | |
183 | for (tmp = op; tmp != NULL; tmp = tmp->more) |
122 | for (object *tmp = op; tmp; tmp = tmp->more) |
184 | tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->x), |
123 | { |
|
|
124 | tmp->x = x + freearr_x[i] + tmp->arch->x; |
185 | tmp->y = y + freearr_y[i] + (tmp->arch == NULL ? 0 : tmp->arch->y); |
125 | tmp->y = y + freearr_y[i] + tmp->arch->y; |
|
|
126 | } |
186 | |
127 | |
187 | tmp = insert_ob_in_map (op, op->map, originator, 0); |
128 | op = insert_ob_in_map (op, op->map, originator, 0); |
188 | if (tmp) |
129 | |
189 | return 0; |
130 | return !op; |
190 | else |
|
|
191 | return 1; |
|
|
192 | } |
131 | } |
193 | |
132 | |
194 | /* |
133 | /* |
195 | * Return value: 1 if object was destroyed, 0 otherwise. |
134 | * Return value: 1 if object was destroyed, 0 otherwise. |
196 | * Modified so that instead of passing the 'originator' that had no |
135 | * Modified so that instead of passing the 'originator' that had no |
… | |
… | |
204 | * one of another type. |
143 | * one of another type. |
205 | */ |
144 | */ |
206 | int |
145 | int |
207 | teleport (object *teleporter, uint8 tele_type, object *user) |
146 | teleport (object *teleporter, uint8 tele_type, object *user) |
208 | { |
147 | { |
209 | object *altern; |
148 | if (!user) |
210 | int i, j, k, nrofalt = 0; |
149 | return 0; |
|
|
150 | |
211 | object *other_teleporter, *tmp; |
151 | object *other_teleporter = 0; |
212 | maptile *m; |
152 | int nrofalt = 0; |
213 | sint16 sx, sy; |
|
|
214 | |
153 | |
215 | if (user == NULL) |
|
|
216 | return 0; |
|
|
217 | if (user->head != NULL) |
|
|
218 | user = user->head; |
154 | user = user->head_ (); |
219 | |
155 | |
220 | /* Find all other teleporters within range. This range |
156 | /* Find all other teleporters within range. This range |
221 | * should really be setable by some object attribute instead of |
157 | * should really be setable by some object attribute instead of |
222 | * using hard coded values. |
158 | * using hard coded values. |
223 | */ |
159 | */ |
224 | for (i = -5; i < 6; i++) |
160 | unordered_mapwalk (mapwalk_buf, teleporter, -5, -5, 5, 5) |
225 | for (j = -5; j < 6; j++) |
|
|
226 | { |
161 | { |
227 | if (i == 0 && j == 0) |
162 | mapspace &ms = m->at (nx, ny); |
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 | other_teleporter = GET_MAP_OB (teleporter->map, teleporter->x + i, teleporter->y + j); |
|
|
233 | |
163 | |
234 | while (other_teleporter) |
164 | for (object *tmp = ms.top; tmp; tmp = tmp->below) |
|
|
165 | if (tmp->type == tele_type) |
235 | { |
166 | { |
236 | if (other_teleporter->type == tele_type) |
167 | if ((dx || dy) && !rndm (++nrofalt)) |
|
|
168 | other_teleporter = tmp; |
|
|
169 | |
237 | break; |
170 | break; |
238 | other_teleporter = other_teleporter->above; |
|
|
239 | } |
171 | } |
240 | if (other_teleporter && !(RANDOM () % ++nrofalt)) |
|
|
241 | altern = other_teleporter; |
|
|
242 | } |
172 | } |
243 | |
173 | |
244 | if (!nrofalt) |
174 | if (!nrofalt) |
245 | { |
175 | { |
246 | LOG (llevError, "%s: no alternative teleporters around (user %s).\n", |
176 | LOG (llevError, "%s: no alternative teleporters around (user %s).\n", |
247 | teleporter->debug_desc (), user->debug_desc ()); |
177 | teleporter->debug_desc (), user->debug_desc ()); |
248 | return 0; |
178 | return 0; |
249 | } |
179 | } |
250 | |
180 | |
251 | other_teleporter = altern; |
|
|
252 | k = find_free_spot (user, other_teleporter->map, other_teleporter->x, other_teleporter->y, 1, 9); |
181 | int k = find_free_spot (user, other_teleporter->map, other_teleporter->x, other_teleporter->y, 1, SIZEOFFREE1 + 1); |
253 | |
182 | |
254 | /* if k==-1, unable to find a free spot. If this is shop |
183 | /* if k==-1, unable to find a free spot. If this is shop |
255 | * mat that the player is using, find someplace to move |
184 | * mat that the player is using, find someplace to move |
256 | * the player - otherwise, player can get trapped in the shops |
185 | * the player - otherwise, player can get trapped in the shops |
257 | * that appear in random dungeons. We basically just make |
186 | * that appear in random dungeons. We basically just make |
258 | * sure the space isn't no pass (eg wall), and don't care |
187 | * sure the space isn't no pass (eg wall), and don't care |
259 | * about is alive. |
188 | * about is alive. |
260 | */ |
189 | */ |
261 | if (k == -1) |
190 | if (k == -1) |
262 | { |
191 | { |
263 | if (tele_type == SHOP_MAT && user->type == PLAYER) |
192 | if (tele_type == SHOP_MAT && user->is_player ()) |
264 | { |
193 | { |
265 | for (k = 1; k < 9; k++) |
194 | for (k = 1; k < 9; k++) |
266 | { |
195 | { |
|
|
196 | maptile *m; |
|
|
197 | sint16 sx, sy; |
|
|
198 | |
267 | if (get_map_flags (other_teleporter->map, &m, |
199 | 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) |
200 | other_teleporter->x + freearr_x[k], other_teleporter->y + freearr_y[k], &sx, &sy) & P_OUT_OF_MAP) |
269 | continue; |
201 | continue; |
270 | |
202 | |
271 | if (!OB_TYPE_MOVE_BLOCK (user, GET_MAP_MOVE_BLOCK (m, sx, sy))) |
203 | if (!OB_TYPE_MOVE_BLOCK (user, GET_MAP_MOVE_BLOCK (m, sx, sy))) |
272 | break; |
204 | break; |
273 | |
|
|
274 | } |
205 | } |
|
|
206 | |
275 | if (k == 9) |
207 | if (k == 9) |
276 | { |
208 | { |
277 | LOG (llevError, "Shop mat %s (%d, %d) is in solid rock?\n", |
209 | LOG (llevError, "Shop mat %s (%d, %d) is in solid rock?\n", |
278 | &other_teleporter->name, other_teleporter->x, other_teleporter->y); |
210 | &other_teleporter->name, other_teleporter->x, other_teleporter->y); |
279 | return 0; |
211 | return 0; |
… | |
… | |
281 | } |
213 | } |
282 | else |
214 | else |
283 | return 0; |
215 | return 0; |
284 | } |
216 | } |
285 | |
217 | |
286 | user->remove (); |
218 | return !other_teleporter->map->insert ( |
287 | |
219 | user, other_teleporter->x + freearr_x[k], other_teleporter->y + freearr_y[k] |
288 | /* Update location for the object */ |
220 | ); |
289 | for (tmp = user; tmp != NULL; tmp = tmp->more) |
|
|
290 | { |
|
|
291 | 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 | } |
|
|
294 | tmp = insert_ob_in_map (user, other_teleporter->map, NULL, 0); |
|
|
295 | return (tmp == NULL); |
|
|
296 | } |
|
|
297 | |
|
|
298 | 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 | return; |
|
|
309 | } |
221 | } |
310 | |
222 | |
311 | /* |
223 | /* |
312 | * This is a new version of blocked, this one handles objects |
224 | * 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. |
225 | * that can be passed through by monsters with the CAN_PASS_THRU defined. |
314 | * |
226 | * |
315 | * very new version handles also multipart objects |
227 | * very new version handles also multipart objects |
316 | * This is currently only used for the boulder roll code. |
228 | * This is currently only used for the boulder roll code. |
317 | * Returns 1 if object does not fit, 0 if it does. |
229 | * Returns 1 if object does not fit, 0 if it does. |
318 | */ |
230 | */ |
319 | |
231 | static int |
320 | int |
|
|
321 | try_fit (object *op, maptile *m, int x, int y) |
232 | try_fit (object *op, maptile *m, int x, int y) |
322 | { |
233 | { |
323 | object *tmp, *more; |
234 | object *tmp, *more; |
324 | sint16 tx, ty; |
235 | sint16 tx, ty; |
325 | int mflags; |
236 | int mflags; |
… | |
… | |
341 | for (tmp = GET_MAP_OB (m2, tx, ty); tmp; tmp = tmp->above) |
252 | for (tmp = GET_MAP_OB (m2, tx, ty); tmp; tmp = tmp->above) |
342 | { |
253 | { |
343 | if (tmp->head == op || tmp == op) |
254 | if (tmp->head == op || tmp == op) |
344 | continue; |
255 | continue; |
345 | |
256 | |
346 | if ((QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->type != DOOR)) |
257 | if ((tmp->flag [FLAG_ALIVE] && tmp->type != DOOR)) |
347 | return 1; |
258 | return 1; |
348 | |
259 | |
349 | if (OB_MOVE_BLOCK (op, tmp)) |
260 | if (OB_MOVE_BLOCK (op, tmp)) |
350 | return 1; |
261 | return 1; |
351 | |
262 | |
… | |
… | |
357 | /* |
268 | /* |
358 | * this is not perfect yet. |
269 | * this is not perfect yet. |
359 | * it does not roll objects behind multipart objects properly. |
270 | * it does not roll objects behind multipart objects properly. |
360 | * Support for rolling multipart objects is questionable. |
271 | * Support for rolling multipart objects is questionable. |
361 | */ |
272 | */ |
362 | |
273 | static int |
363 | int |
|
|
364 | roll_ob (object *op, int dir, object *pusher) |
274 | roll_ob (object *op, int dir, object *pusher) |
365 | { |
275 | { |
366 | object *tmp; |
|
|
367 | sint16 x, y; |
276 | sint16 x, y; |
368 | int flags; |
277 | int flags; |
369 | maptile *m; |
278 | maptile *m; |
370 | MoveType move_block; |
279 | MoveType move_block; |
371 | |
280 | |
… | |
… | |
373 | op = op->head; |
282 | op = op->head; |
374 | |
283 | |
375 | x = op->x + freearr_x[dir]; |
284 | x = op->x + freearr_x[dir]; |
376 | y = op->y + freearr_y[dir]; |
285 | y = op->y + freearr_y[dir]; |
377 | |
286 | |
378 | if (!QUERY_FLAG (op, FLAG_CAN_ROLL) |
287 | if (!op->flag [FLAG_CAN_ROLL] |
379 | || (op->weight && random_roll (0, op->weight / 50000 - 1, pusher, PREFER_LOW) |
288 | || (op->weight && random_roll (0, op->weight / 50000 - 1, pusher, PREFER_LOW) |
380 | > pusher->stats.Str)) |
289 | > pusher->stats.Str)) |
381 | return 0; |
290 | return 0; |
382 | |
291 | |
383 | m = op->map; |
292 | m = op->map; |
… | |
… | |
389 | move_block = GET_MAP_MOVE_BLOCK (m, x, y); |
298 | move_block = GET_MAP_MOVE_BLOCK (m, x, y); |
390 | |
299 | |
391 | /* If the target space is not blocked, no need to look at the objects on it */ |
300 | /* If the target space is not blocked, no need to look at the objects on it */ |
392 | if ((op->move_type & move_block) == op->move_type) |
301 | if ((op->move_type & move_block) == op->move_type) |
393 | { |
302 | { |
394 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
303 | for (object *tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above) |
395 | { |
304 | { |
396 | if (tmp->head == op) |
305 | if (tmp->head == op) |
397 | continue; |
306 | continue; |
|
|
307 | |
398 | if (OB_MOVE_BLOCK (op, tmp) && !roll_ob (tmp, dir, pusher)) |
308 | if (OB_MOVE_BLOCK (op, tmp) && !roll_ob (tmp, dir, pusher)) |
399 | return 0; |
309 | return 0; |
400 | } |
310 | } |
401 | } |
311 | } |
|
|
312 | |
402 | if (try_fit (op, m, x, y)) |
313 | if (try_fit (op, m, x, y)) |
403 | return 0; |
314 | return 0; |
404 | |
315 | |
405 | op->remove (); |
316 | op->move (dir); |
406 | for (tmp = op; tmp != NULL; tmp = tmp->more) |
317 | |
407 | tmp->x += freearr_x[dir], tmp->y += freearr_y[dir]; |
|
|
408 | insert_ob_in_map (op, op->map, pusher, 0); |
|
|
409 | return 1; |
318 | return 1; |
|
|
319 | } |
|
|
320 | |
|
|
321 | void |
|
|
322 | recursive_roll (object *op, int dir, object *pusher) |
|
|
323 | { |
|
|
324 | if (!roll_ob (op, dir, pusher)) |
|
|
325 | { |
|
|
326 | new_draw_info_format (NDI_UNIQUE, 0, pusher, "You fail to push the %s.", query_name (op)); |
|
|
327 | return; |
|
|
328 | } |
|
|
329 | |
|
|
330 | pusher->move (dir); |
|
|
331 | new_draw_info_format (NDI_BLACK, 0, pusher, "You move the %s.", query_name (op)); |
|
|
332 | return; |
410 | } |
333 | } |
411 | |
334 | |
412 | /* returns 1 if pushing invokes a attack, 0 when not */ |
335 | /* returns 1 if pushing invokes a attack, 0 when not */ |
413 | int |
336 | int |
414 | push_ob (object *who, int dir, object *pusher) |
337 | push_ob (object *who, int dir, object *pusher) |
… | |
… | |
419 | if (who->head != NULL) |
342 | if (who->head != NULL) |
420 | who = who->head; |
343 | who = who->head; |
421 | owner = who->owner; |
344 | owner = who->owner; |
422 | |
345 | |
423 | /* Wake up sleeping monsters that may be pushed */ |
346 | /* Wake up sleeping monsters that may be pushed */ |
424 | CLEAR_FLAG (who, FLAG_SLEEP); |
347 | who->clr_flag (FLAG_SLEEP); |
425 | |
348 | |
426 | /* player change place with his pets or summoned creature */ |
349 | /* player change place with his pets or summoned creature */ |
427 | /* TODO: allow multi arch pushing. Can't be very difficult */ |
350 | /* TODO: allow multi arch pushing. Can't be very difficult */ |
428 | if (who->more == NULL |
351 | if (who->more == NULL |
429 | && ((owner && owner->contr && pusher->contr && same_party (owner->contr->party, pusher->contr->party)) |
352 | && ((owner && owner->contr && pusher->contr && same_party (owner->contr->party, pusher->contr->party)) |
… | |
… | |
447 | pusher->map = who->map; |
370 | pusher->map = who->map; |
448 | who->map = m; |
371 | who->map = m; |
449 | |
372 | |
450 | insert_ob_in_map (who, who->map, pusher, 0); |
373 | insert_ob_in_map (who, who->map, pusher, 0); |
451 | insert_ob_in_map (pusher, pusher->map, pusher, 0); |
374 | insert_ob_in_map (pusher, pusher->map, pusher, 0); |
|
|
375 | |
452 | return 0; |
376 | return 0; |
453 | } |
377 | } |
454 | |
378 | |
455 | /* We want ONLY become enemy of evil, unaggressive monster. We must RUN in them */ |
379 | /* We want ONLY become enemy of evil, unaggressive monster. We must RUN in them */ |
456 | /* In original we have here a unaggressive check only - that was the reason why */ |
380 | /* In original we have here a unaggressive check only - that was the reason why */ |
457 | /* we so often become an enemy of friendly monsters... */ |
381 | /* we so often become an enemy of friendly monsters... */ |
458 | /* funny: was they set to unaggressive 0 (= not so nice) they don't attack */ |
382 | /* funny: was they set to unaggressive 0 (= not so nice) they don't attack */ |
459 | if (owner != pusher && pusher->type == PLAYER && who->type != PLAYER && |
383 | if (owner != pusher && pusher->type == PLAYER && who->type != PLAYER && |
460 | !QUERY_FLAG (who, FLAG_FRIENDLY) && !QUERY_FLAG (who, FLAG_NEUTRAL)) |
384 | !who->flag [FLAG_FRIENDLY] && !who->flag [FLAG_NEUTRAL]) |
461 | { |
385 | { |
462 | if (pusher->contr->run_on) /* only when we run */ |
386 | if (pusher->contr->run_on) /* only when we run */ |
463 | { |
387 | { |
464 | new_draw_info_format (NDI_UNIQUE, 0, pusher, "You start to attack %s!!", &who->name); |
388 | new_draw_info_format (NDI_UNIQUE, 0, pusher, "You start to attack %s!!", &who->name); |
465 | CLEAR_FLAG (who, FLAG_UNAGGRESSIVE); /* the sucker don't like you anymore */ |
389 | who->clr_flag (FLAG_UNAGGRESSIVE); /* the sucker don't like you anymore */ |
466 | who->enemy = pusher; |
390 | who->enemy = pusher; |
467 | return 1; |
391 | return 1; |
468 | } |
392 | } |
469 | else |
393 | else |
470 | new_draw_info_format (NDI_UNIQUE, 0, pusher, "You avoid attacking %s.", &who->name); |
394 | new_draw_info_format (NDI_UNIQUE, 0, pusher, "You avoid attacking %s. H<You have to run if you wish to attack unnagressive NPCs.>", &who->name); |
471 | } |
395 | } |
472 | |
396 | |
473 | /* now, lets test stand still. we NEVER can push stand_still monsters. */ |
397 | /* now, let's test stand still. we NEVER can push stand_still monsters. */ |
474 | if (QUERY_FLAG (who, FLAG_STAND_STILL)) |
398 | if (who->flag [FLAG_STAND_STILL]) |
475 | { |
399 | { |
476 | new_draw_info_format (NDI_UNIQUE, 0, pusher, "You can't push %s.", &who->name); |
400 | new_draw_info_format (NDI_UNIQUE, 0, pusher, "You can't push %s. H<You simply can't.>", &who->name); |
477 | return 0; |
401 | return 0; |
478 | } |
402 | } |
479 | |
403 | |
480 | /* This block is basically if you are pushing friendly but |
404 | /* This block is basically if you are pushing friendly but |
481 | * non pet creaturs. |
405 | * non pet creaturs. |
… | |
… | |
484 | * this pushes the other person away - its not a swap. |
408 | * this pushes the other person away - its not a swap. |
485 | */ |
409 | */ |
486 | |
410 | |
487 | str1 = (who->stats.Str > 0 ? who->stats.Str : who->level); |
411 | str1 = (who->stats.Str > 0 ? who->stats.Str : who->level); |
488 | str2 = (pusher->stats.Str > 0 ? pusher->stats.Str : pusher->level); |
412 | str2 = (pusher->stats.Str > 0 ? pusher->stats.Str : pusher->level); |
489 | if (QUERY_FLAG (who, FLAG_WIZ) || |
413 | if (who->flag [FLAG_WIZ] || |
490 | random_roll (str1, str1 * 5 / 2, who, PREFER_HIGH) >= |
414 | random_roll (str1, str1 * 5 / 2, who, PREFER_HIGH) >= |
491 | random_roll (str2, str2 * 5 / 2, pusher, PREFER_HIGH) || !move_object (who, dir)) |
415 | random_roll (str2, str2 * 5 / 2, pusher, PREFER_HIGH) || !who->move (dir)) |
492 | { |
416 | { |
493 | if (who->type == PLAYER) |
417 | if (who->type == PLAYER) |
494 | new_draw_info_format (NDI_UNIQUE, 0, who, "%s tried to push you.", &pusher->name); |
418 | new_draw_info_format (NDI_UNIQUE, 0, who, "%s tried to push you.", &pusher->name); |
495 | |
419 | |
496 | return 0; |
420 | return 0; |
… | |
… | |
498 | |
422 | |
499 | /* If we get here, the push succeeded. |
423 | /* If we get here, the push succeeded. |
500 | * Let everyone know the status. |
424 | * Let everyone know the status. |
501 | */ |
425 | */ |
502 | if (who->type == PLAYER) |
426 | if (who->type == PLAYER) |
503 | { |
|
|
504 | new_draw_info_format (NDI_UNIQUE, 0, who, "%s pushed you.", &pusher->name); |
427 | new_draw_info_format (NDI_UNIQUE, 0, who, "%s pushed you.", &pusher->name); |
505 | } |
428 | |
506 | if (pusher->type == PLAYER) |
429 | if (pusher->type == PLAYER) |
507 | { |
|
|
508 | new_draw_info_format (NDI_UNIQUE, 0, pusher, "You pushed %s back.", &who->name); |
430 | new_draw_info_format (NDI_UNIQUE, 0, pusher, "You pushed %s back.", &who->name); |
509 | } |
|
|
510 | |
431 | |
511 | return 1; |
432 | return 1; |
512 | } |
433 | } |