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