… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 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> |
… | |
… | |
31 | * If it fails (something blocks the passage), it returns 0, |
32 | * If it fails (something blocks the passage), it returns 0, |
32 | * otherwise 1. |
33 | * otherwise 1. |
33 | * This is an improvement from the previous move_ob(), which |
34 | * This is an improvement from the previous move_ob(), which |
34 | * removed and inserted objects even if they were unable to move. |
35 | * removed and inserted objects even if they were unable to move. |
35 | */ |
36 | */ |
36 | |
|
|
37 | int |
37 | int |
38 | move_object (object *op, int dir) |
38 | move_object (object *op, int dir) |
39 | { |
39 | { |
40 | return move_ob (op, dir, op); |
40 | return op->move (dir); |
41 | } |
41 | } |
42 | |
42 | |
43 | /* object op is trying to move in direction dir. |
43 | /* object op is trying to move in direction dir. |
44 | * originator is typically the same as op, but |
44 | * originator is typically the same as op, but |
45 | * can be different if originator is causing op to |
45 | * can be different if originator is causing op to |
… | |
… | |
50 | * very similiar to move_object. |
50 | * very similiar to move_object. |
51 | */ |
51 | */ |
52 | int |
52 | int |
53 | move_ob (object *op, int dir, object *originator) |
53 | move_ob (object *op, int dir, object *originator) |
54 | { |
54 | { |
|
|
55 | return op->move (dir, originator); |
|
|
56 | } |
|
|
57 | |
|
|
58 | int |
|
|
59 | object::move (int dir, object *originator) |
|
|
60 | { |
55 | sint16 newx = op->x + freearr_x[dir]; |
61 | sint16 newx = x + freearr_x[dir]; |
56 | sint16 newy = op->y + freearr_y[dir]; |
62 | sint16 newy = y + freearr_y[dir]; |
57 | object *tmp; |
|
|
58 | maptile *m; |
|
|
59 | int mflags; |
|
|
60 | |
63 | |
61 | if (op == NULL) |
64 | mapxy pos (this); |
62 | { |
65 | pos.move (dir); |
63 | LOG (llevError, "Trying to move NULL.\n"); |
|
|
64 | return 0; |
|
|
65 | } |
|
|
66 | |
66 | |
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, |
67 | /* If the space the object is moving to is out of the map, |
71 | * bail now - we know it can't work. |
68 | * bail now - we know it can't work. |
72 | */ |
69 | */ |
73 | if (mflags & P_OUT_OF_MAP) |
70 | if (!pos.normalise ()) |
74 | return 0; |
71 | return 0; |
75 | |
72 | |
76 | /* Is this space blocked? Players with wizpass are immune to |
73 | /* Is this space blocked? Players with wizpass are immune to |
77 | * this condition. |
74 | * this condition. |
78 | */ |
75 | */ |
79 | if (blocked_link (op, m, newx, newy) && !QUERY_FLAG (op, FLAG_WIZPASS)) |
76 | if (blocked_link (this, pos.m, pos.x, pos.y) && !flag [FLAG_WIZPASS]) |
80 | return 0; |
77 | return 0; |
81 | |
78 | |
|
|
79 | // check tail movability |
|
|
80 | if (more && !more->move (dir, more->head)) |
|
|
81 | return 0; |
|
|
82 | |
82 | /* 0.94.2 - we need to set the direction for the new animation code. |
83 | /* 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 | * it uses it to figure out face to use - I can't see it |
84 | * breaking anything, but it might. |
85 | * breaking anything, but it might. |
85 | */ |
86 | */ |
86 | if (op->more && !move_ob (op->more, dir, op->more->head)) |
|
|
87 | return 0; |
|
|
88 | |
|
|
89 | op->direction = dir; |
87 | direction = dir; |
90 | |
88 | |
91 | if (op->will_apply & 4) |
89 | if (will_apply & 4) |
92 | check_earthwalls (op, m, newx, newy); |
90 | check_earthwalls (this, pos.m, pos.x, pos.y); |
93 | |
91 | |
94 | if (op->will_apply & 8) |
92 | if (will_apply & 8) |
95 | check_doors (op, m, newx, newy); |
93 | 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 | |
94 | |
114 | /* If this is a tail portion, just want to tell caller that move is |
95 | /* 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 |
96 | * ok - the caller will deal with actual object removal/insertion |
116 | */ |
97 | */ |
117 | if (op->head) |
98 | if (head) |
118 | return 1; |
99 | return 1; |
119 | |
100 | |
120 | if (m != op->map && op->contr) |
101 | if (pos.m != map && contr) |
121 | { |
102 | { |
122 | if (INVOKE_MAP (LEAVE, op->map, ARG_PLAYER (op->contr))) |
103 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
123 | return 0; |
104 | return 0; |
124 | |
105 | |
125 | op->remove (); |
106 | remove (); |
126 | |
107 | |
127 | if (INVOKE_PLAYER (MAP_CHANGE, op->contr, ARG_MAP (m), ARG_INT (newx), ARG_INT (newy))) |
108 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (pos.m), ARG_INT (pos.x), ARG_INT (pos.y))) |
128 | return 0; |
109 | return 0; |
129 | |
110 | |
130 | if (INVOKE_MAP (ENTER, m, ARG_PLAYER (op->contr), ARG_INT (newx), ARG_INT (newy))) |
111 | if (INVOKE_MAP (ENTER, pos.m, ARG_PLAYER (contr), ARG_INT (pos.x), ARG_INT (pos.y))) |
131 | return 0; |
112 | return 0; |
132 | } |
113 | } |
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 | |
114 | |
147 | /* insert_ob_in_map will deal with any tiling issues */ |
115 | /* insert_ob_in_map will deal with any tiling issues */ |
148 | insert_ob_in_map (op, m, originator, 0); |
116 | pos.insert (this, originator); |
149 | |
117 | |
150 | return 1; |
118 | return 1; |
151 | } |
119 | } |
152 | |
|
|
153 | |
120 | |
154 | /* |
121 | /* |
155 | * transfer_ob(): Move an object (even linked objects) to another spot |
122 | * transfer_ob(): Move an object (even linked objects) to another spot |
156 | * on the same map. |
123 | * on the same map. |
157 | * |
124 | * |
… | |
… | |
180 | op = op->head_ (); |
147 | op = op->head_ (); |
181 | op->remove (); |
148 | op->remove (); |
182 | |
149 | |
183 | for (object *tmp = op; tmp; tmp = tmp->more) |
150 | for (object *tmp = op; tmp; tmp = tmp->more) |
184 | { |
151 | { |
185 | tmp->x = x + freearr_x[i] + (!tmp->arch ? 0 : tmp->arch->x); |
152 | tmp->x = x + freearr_x[i] + tmp->arch->x; |
186 | tmp->y = y + freearr_y[i] + (!tmp->arch ? 0 : tmp->arch->y); |
153 | tmp->y = y + freearr_y[i] + tmp->arch->y; |
187 | } |
154 | } |
188 | |
155 | |
189 | op = insert_ob_in_map (op, op->map, originator, 0); |
156 | op = insert_ob_in_map (op, op->map, originator, 0); |
190 | |
157 | |
191 | return !op; |
158 | return !op; |
… | |
… | |
204 | * one of another type. |
171 | * one of another type. |
205 | */ |
172 | */ |
206 | int |
173 | int |
207 | teleport (object *teleporter, uint8 tele_type, object *user) |
174 | teleport (object *teleporter, uint8 tele_type, object *user) |
208 | { |
175 | { |
209 | object *altern; |
176 | if (!user) |
210 | int i, j, k, nrofalt = 0; |
177 | return 0; |
|
|
178 | |
211 | object *other_teleporter, *tmp; |
179 | object *other_teleporter = 0; |
212 | maptile *m; |
180 | int nrofalt = 0; |
213 | sint16 sx, sy; |
|
|
214 | |
181 | |
215 | if (user == NULL) |
|
|
216 | return 0; |
|
|
217 | if (user->head != NULL) |
|
|
218 | user = user->head; |
182 | user = user->head_ (); |
219 | |
183 | |
220 | /* Find all other teleporters within range. This range |
184 | /* Find all other teleporters within range. This range |
221 | * should really be setable by some object attribute instead of |
185 | * should really be setable by some object attribute instead of |
222 | * using hard coded values. |
186 | * using hard coded values. |
223 | */ |
187 | */ |
224 | for (i = -5; i < 6; i++) |
188 | unordered_mapwalk (teleporter, -5, -5, 5, 5) |
225 | for (j = -5; j < 6; j++) |
|
|
226 | { |
189 | { |
227 | if (i == 0 && j == 0) |
190 | 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 | |
191 | |
234 | while (other_teleporter) |
192 | for (object *tmp = ms.top; tmp; tmp = tmp->below) |
|
|
193 | if (tmp->type == tele_type) |
235 | { |
194 | { |
236 | if (other_teleporter->type == tele_type) |
195 | if ((dx || dy) && !rndm (++nrofalt)) |
|
|
196 | other_teleporter = tmp; |
|
|
197 | |
237 | break; |
198 | break; |
238 | other_teleporter = other_teleporter->above; |
|
|
239 | } |
199 | } |
240 | if (other_teleporter && !(RANDOM () % ++nrofalt)) |
|
|
241 | altern = other_teleporter; |
|
|
242 | } |
200 | } |
243 | |
201 | |
244 | if (!nrofalt) |
202 | if (!nrofalt) |
245 | { |
203 | { |
246 | LOG (llevError, "%s: no alternative teleporters around (user %s).\n", |
204 | LOG (llevError, "%s: no alternative teleporters around (user %s).\n", |
247 | teleporter->debug_desc (), user->debug_desc ()); |
205 | teleporter->debug_desc (), user->debug_desc ()); |
248 | return 0; |
206 | return 0; |
249 | } |
207 | } |
250 | |
208 | |
251 | other_teleporter = altern; |
|
|
252 | k = find_free_spot (user, other_teleporter->map, other_teleporter->x, other_teleporter->y, 1, 9); |
209 | int k = find_free_spot (user, other_teleporter->map, other_teleporter->x, other_teleporter->y, 1, 9); |
253 | |
210 | |
254 | /* if k==-1, unable to find a free spot. If this is shop |
211 | /* if k==-1, unable to find a free spot. If this is shop |
255 | * mat that the player is using, find someplace to move |
212 | * mat that the player is using, find someplace to move |
256 | * the player - otherwise, player can get trapped in the shops |
213 | * the player - otherwise, player can get trapped in the shops |
257 | * that appear in random dungeons. We basically just make |
214 | * that appear in random dungeons. We basically just make |
258 | * sure the space isn't no pass (eg wall), and don't care |
215 | * sure the space isn't no pass (eg wall), and don't care |
259 | * about is alive. |
216 | * about is alive. |
260 | */ |
217 | */ |
261 | if (k == -1) |
218 | if (k == -1) |
262 | { |
219 | { |
263 | if (tele_type == SHOP_MAT && user->type == PLAYER) |
220 | if (tele_type == SHOP_MAT && user->is_player ()) |
264 | { |
221 | { |
265 | for (k = 1; k < 9; k++) |
222 | for (k = 1; k < 9; k++) |
266 | { |
223 | { |
|
|
224 | maptile *m; |
|
|
225 | sint16 sx, sy; |
|
|
226 | |
267 | if (get_map_flags (other_teleporter->map, &m, |
227 | 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) |
228 | other_teleporter->x + freearr_x[k], other_teleporter->y + freearr_y[k], &sx, &sy) & P_OUT_OF_MAP) |
269 | continue; |
229 | continue; |
270 | |
230 | |
271 | if (!OB_TYPE_MOVE_BLOCK (user, GET_MAP_MOVE_BLOCK (m, sx, sy))) |
231 | if (!OB_TYPE_MOVE_BLOCK (user, GET_MAP_MOVE_BLOCK (m, sx, sy))) |
272 | break; |
232 | break; |
273 | |
|
|
274 | } |
233 | } |
|
|
234 | |
275 | if (k == 9) |
235 | if (k == 9) |
276 | { |
236 | { |
277 | LOG (llevError, "Shop mat %s (%d, %d) is in solid rock?\n", |
237 | LOG (llevError, "Shop mat %s (%d, %d) is in solid rock?\n", |
278 | &other_teleporter->name, other_teleporter->x, other_teleporter->y); |
238 | &other_teleporter->name, other_teleporter->x, other_teleporter->y); |
279 | return 0; |
239 | return 0; |
… | |
… | |
281 | } |
241 | } |
282 | else |
242 | else |
283 | return 0; |
243 | return 0; |
284 | } |
244 | } |
285 | |
245 | |
286 | user->remove (); |
246 | return !other_teleporter->map->insert ( |
287 | |
247 | user, other_teleporter->x + freearr_x[k], other_teleporter->y + freearr_y[k] |
288 | /* Update location for the object */ |
248 | ); |
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 | } |
249 | } |
310 | |
250 | |
311 | /* |
251 | /* |
312 | * This is a new version of blocked, this one handles objects |
252 | * 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. |
253 | * that can be passed through by monsters with the CAN_PASS_THRU defined. |
314 | * |
254 | * |
315 | * very new version handles also multipart objects |
255 | * very new version handles also multipart objects |
316 | * This is currently only used for the boulder roll code. |
256 | * This is currently only used for the boulder roll code. |
317 | * Returns 1 if object does not fit, 0 if it does. |
257 | * Returns 1 if object does not fit, 0 if it does. |
318 | */ |
258 | */ |
319 | |
259 | static int |
320 | int |
|
|
321 | try_fit (object *op, maptile *m, int x, int y) |
260 | try_fit (object *op, maptile *m, int x, int y) |
322 | { |
261 | { |
323 | object *tmp, *more; |
262 | object *tmp, *more; |
324 | sint16 tx, ty; |
263 | sint16 tx, ty; |
325 | int mflags; |
264 | int mflags; |
… | |
… | |
357 | /* |
296 | /* |
358 | * this is not perfect yet. |
297 | * this is not perfect yet. |
359 | * it does not roll objects behind multipart objects properly. |
298 | * it does not roll objects behind multipart objects properly. |
360 | * Support for rolling multipart objects is questionable. |
299 | * Support for rolling multipart objects is questionable. |
361 | */ |
300 | */ |
362 | |
301 | static int |
363 | int |
|
|
364 | roll_ob (object *op, int dir, object *pusher) |
302 | roll_ob (object *op, int dir, object *pusher) |
365 | { |
303 | { |
366 | object *tmp; |
|
|
367 | sint16 x, y; |
304 | sint16 x, y; |
368 | int flags; |
305 | int flags; |
369 | maptile *m; |
306 | maptile *m; |
370 | MoveType move_block; |
307 | MoveType move_block; |
371 | |
308 | |
… | |
… | |
389 | move_block = GET_MAP_MOVE_BLOCK (m, x, y); |
326 | move_block = GET_MAP_MOVE_BLOCK (m, x, y); |
390 | |
327 | |
391 | /* If the target space is not blocked, no need to look at the objects on it */ |
328 | /* 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) |
329 | if ((op->move_type & move_block) == op->move_type) |
393 | { |
330 | { |
394 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
331 | for (object *tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above) |
395 | { |
332 | { |
396 | if (tmp->head == op) |
333 | if (tmp->head == op) |
397 | continue; |
334 | continue; |
|
|
335 | |
398 | if (OB_MOVE_BLOCK (op, tmp) && !roll_ob (tmp, dir, pusher)) |
336 | if (OB_MOVE_BLOCK (op, tmp) && !roll_ob (tmp, dir, pusher)) |
399 | return 0; |
337 | return 0; |
400 | } |
338 | } |
401 | } |
339 | } |
|
|
340 | |
402 | if (try_fit (op, m, x, y)) |
341 | if (try_fit (op, m, x, y)) |
403 | return 0; |
342 | return 0; |
404 | |
343 | |
405 | op->remove (); |
344 | op->move (dir); |
406 | for (tmp = op; tmp != NULL; tmp = tmp->more) |
345 | |
407 | tmp->x += freearr_x[dir], tmp->y += freearr_y[dir]; |
|
|
408 | insert_ob_in_map (op, op->map, pusher, 0); |
|
|
409 | return 1; |
346 | return 1; |
|
|
347 | } |
|
|
348 | |
|
|
349 | void |
|
|
350 | recursive_roll (object *op, int dir, object *pusher) |
|
|
351 | { |
|
|
352 | if (!roll_ob (op, dir, pusher)) |
|
|
353 | { |
|
|
354 | new_draw_info_format (NDI_UNIQUE, 0, pusher, "You fail to push the %s.", query_name (op)); |
|
|
355 | return; |
|
|
356 | } |
|
|
357 | |
|
|
358 | move_ob (pusher, dir, pusher); |
|
|
359 | new_draw_info_format (NDI_BLACK, 0, pusher, "You move the %s.", query_name (op)); |
|
|
360 | return; |
410 | } |
361 | } |
411 | |
362 | |
412 | /* returns 1 if pushing invokes a attack, 0 when not */ |
363 | /* returns 1 if pushing invokes a attack, 0 when not */ |
413 | int |
364 | int |
414 | push_ob (object *who, int dir, object *pusher) |
365 | push_ob (object *who, int dir, object *pusher) |
… | |
… | |
447 | pusher->map = who->map; |
398 | pusher->map = who->map; |
448 | who->map = m; |
399 | who->map = m; |
449 | |
400 | |
450 | insert_ob_in_map (who, who->map, pusher, 0); |
401 | insert_ob_in_map (who, who->map, pusher, 0); |
451 | insert_ob_in_map (pusher, pusher->map, pusher, 0); |
402 | insert_ob_in_map (pusher, pusher->map, pusher, 0); |
|
|
403 | |
452 | return 0; |
404 | return 0; |
453 | } |
405 | } |
454 | |
406 | |
455 | /* We want ONLY become enemy of evil, unaggressive monster. We must RUN in them */ |
407 | /* 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 */ |
408 | /* In original we have here a unaggressive check only - that was the reason why */ |