1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | (at your option) any later version. |
11 | * any later version. |
11 | |
12 | * |
12 | 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, but |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | GNU General Public License for more details. |
16 | * for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License along |
18 | along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
20 | |
21 | * |
21 | The author can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
25 | #include <pwd.h> |
|
|
26 | #include <sproto.h> |
26 | #include <sproto.h> |
27 | #include <sounds.h> |
27 | #include <sounds.h> |
28 | #include <living.h> |
28 | #include <living.h> |
29 | #include <object.h> |
29 | #include <object.h> |
30 | #include <spells.h> |
30 | #include <spells.h> |
31 | #include <skills.h> |
31 | #include <skills.h> |
32 | |
32 | |
33 | #include <algorithm> |
33 | #include <algorithm> |
34 | #include <functional> |
34 | #include <functional> |
35 | |
35 | |
36 | player * |
36 | playervec players; |
37 | find_player (const char *plname) |
|
|
38 | { |
|
|
39 | player *pl; |
|
|
40 | |
|
|
41 | for (pl = first_player; pl; pl = pl->next) |
|
|
42 | if (pl->ob && !strcmp (query_name (pl->ob), plname)) |
|
|
43 | return pl; |
|
|
44 | |
|
|
45 | return 0; |
|
|
46 | } |
|
|
47 | |
37 | |
48 | void |
38 | void |
49 | display_motd (const object *op) |
39 | display_motd (const object *op) |
50 | { |
40 | { |
51 | char buf[MAX_BUF]; |
41 | char buf[MAX_BUF]; |
… | |
… | |
125 | |
115 | |
126 | news[0] = '\0'; |
116 | news[0] = '\0'; |
127 | subject[0] = '\0'; |
117 | subject[0] = '\0'; |
128 | size = 0; |
118 | size = 0; |
129 | |
119 | |
130 | while (fgets (buf, MAX_BUF, fp) != NULL) |
120 | while (fgets (buf, MAX_BUF, fp)) |
131 | { |
121 | { |
132 | if (*buf == '#') |
122 | if (*buf == '#') |
133 | continue; |
123 | continue; |
134 | |
124 | |
135 | if (*buf == '%') |
125 | if (*buf == '%') |
136 | { /* send one news */ |
126 | { /* send one news */ |
137 | if (size > 0) |
127 | if (size > 0) |
138 | draw_ext_info_format (NDI_UNIQUE | NDI_GREEN, 0, op, MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, "INFORMATION: %s\n%s", "%s\n%s", subject, news); /*send previously read news */ |
128 | draw_ext_info_format (NDI_UNIQUE | NDI_GREEN, 0, op, MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, "INFORMATION: %s\n%s", (char *)"%s\n%s", subject, news); /*send previously read news */ |
|
|
129 | |
139 | strcpy (subject, buf + 1); |
130 | strcpy (subject, buf + 1); |
140 | strip_endline (subject); |
131 | strip_endline (subject); |
141 | size = 0; |
132 | size = 0; |
142 | news[0] = '\0'; |
133 | news[0] = '\0'; |
143 | } |
134 | } |
… | |
… | |
152 | size += strlen (buf); |
143 | size += strlen (buf); |
153 | } |
144 | } |
154 | } |
145 | } |
155 | |
146 | |
156 | draw_ext_info_format (NDI_UNIQUE | NDI_GREEN, 0, op, |
147 | draw_ext_info_format (NDI_UNIQUE | NDI_GREEN, 0, op, |
157 | MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, "INFORMATION: %s\n%s\n", "%s\n%s", subject, news); |
148 | MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, "INFORMATION: %s\n%s\n", (char *)"%s\n%s", subject, news); |
158 | close_and_delete (fp, comp); |
149 | close_and_delete (fp, comp); |
159 | } |
150 | } |
160 | |
151 | |
161 | /* This loads the first map an puts the player on it. */ |
152 | /* This loads the first map an puts the player on it. */ |
162 | static void |
153 | static void |
163 | set_first_map (object *op) |
154 | set_first_map (object *op) |
164 | { |
155 | { |
165 | strcpy (op->contr->maplevel, first_map_path); |
156 | op->contr->maplevel = first_map_path; |
166 | op->x = -1; |
157 | op->x = -1; |
167 | op->y = -1; |
158 | op->y = -1; |
168 | enter_exit (op, 0); |
159 | } |
|
|
160 | |
|
|
161 | void |
|
|
162 | player::activate () |
|
|
163 | { |
|
|
164 | if (active) |
|
|
165 | return; |
|
|
166 | |
|
|
167 | players.insert (this); |
|
|
168 | ob->remove (); |
|
|
169 | ob->map = 0; |
|
|
170 | ob->activate_recursive (); |
|
|
171 | CLEAR_FLAG (ob, FLAG_FRIENDLY); |
|
|
172 | add_friendly_object (ob); |
|
|
173 | } |
|
|
174 | |
|
|
175 | void |
|
|
176 | player::deactivate () |
|
|
177 | { |
|
|
178 | if (!active) |
|
|
179 | return; |
|
|
180 | |
|
|
181 | terminate_all_pets (ob); |
|
|
182 | remove_friendly_object (ob); |
|
|
183 | ob->deactivate_recursive (); |
|
|
184 | |
|
|
185 | if (ob->map) |
|
|
186 | maplevel = ob->map->path; |
|
|
187 | |
|
|
188 | ob->remove (); |
|
|
189 | ob->map = 0; |
|
|
190 | party = 0; |
|
|
191 | |
|
|
192 | combat_ob = ranged_ob = 0; //TODO, should be special marker, non-refcounted, not this |
|
|
193 | |
|
|
194 | players.erase (this); |
169 | } |
195 | } |
170 | |
196 | |
171 | // connect the player with a specific client |
197 | // connect the player with a specific client |
172 | // also changed, rationalises, and fixes some incorrect settings |
198 | // also changes, rationalises, and fixes some incorrect settings |
173 | void |
199 | void |
174 | player::connect (client *ns) |
200 | player::connect (client *ns) |
175 | { |
201 | { |
176 | this->ns = ns; |
202 | this->ns = ns; |
177 | ns->pl = this; |
203 | ns->pl = this; |
178 | |
204 | |
179 | next = first_player; |
205 | run_on = 0; |
180 | first_player = this; |
206 | fire_on = 0; |
|
|
207 | ob->close_container (); //TODO: client-specific |
181 | |
208 | |
182 | ns->update_look = 0; |
209 | ns->update_look = 0; |
183 | ns->look_position = 0; |
210 | ns->look_position = 0; |
184 | |
211 | |
185 | clear_los (ob); |
212 | clear_los (this); |
186 | |
213 | |
|
|
214 | ns->reset_stats (); |
|
|
215 | |
|
|
216 | /* make sure he's a player -- needed because of class change. */ |
187 | ob->type = PLAYER; // we are paranoid |
217 | ob->type = PLAYER; // we are paranoid |
188 | ob->race = ob->arch->clone.race; |
218 | ob->race = ob->arch->race; |
189 | |
|
|
190 | if (!legal_range (ob, shoottype)) |
|
|
191 | shoottype = range_none; |
|
|
192 | |
219 | |
193 | ob->carrying = sum_weight (ob); |
220 | ob->carrying = sum_weight (ob); |
194 | link_player_skills (ob); |
221 | link_player_skills (ob); |
195 | |
222 | |
196 | CLEAR_FLAG (ob, FLAG_NO_FIX_PLAYER); |
223 | CLEAR_FLAG (ob, FLAG_NO_FIX_PLAYER); |
197 | ob->update_stats (); |
|
|
198 | update_ob_speed (ob); |
|
|
199 | |
224 | |
200 | assign (title, ob->arch->clone.name); |
225 | assign (title, ob->arch->object::name); |
201 | |
|
|
202 | /* can_use_shield is a new flag. However, the can_use.. seems to largely come |
|
|
203 | * from the class, and not race. I don't see any way to get the class information |
|
|
204 | * to then update this. I don't think this will actually break anything - anyone |
|
|
205 | * that can use armour should be able to use a shield. What this may 'break' |
|
|
206 | * are features new characters get, eg, if someone starts up with a Q, they |
|
|
207 | * should be able to use a shield. However, old Q's won't get that advantage. |
|
|
208 | */ |
|
|
209 | if (QUERY_FLAG (ob, FLAG_USE_ARMOUR)) |
|
|
210 | SET_FLAG (ob, FLAG_USE_SHIELD); |
|
|
211 | |
226 | |
212 | /* if it's a dragon player, set the correct title here */ |
227 | /* if it's a dragon player, set the correct title here */ |
213 | if (is_dragon_pl (ob)) |
228 | if (is_dragon_pl (ob)) |
214 | { |
229 | { |
215 | object *tmp, *abil = 0, *skin = 0; |
230 | object *tmp, *abil = 0, *skin = 0; |
… | |
… | |
217 | shstr_cmp dragon_ability_force ("dragon_ability_force"); |
232 | shstr_cmp dragon_ability_force ("dragon_ability_force"); |
218 | shstr_cmp dragon_skin_force ("dragon_skin_force"); |
233 | shstr_cmp dragon_skin_force ("dragon_skin_force"); |
219 | |
234 | |
220 | for (tmp = ob->inv; tmp; tmp = tmp->below) |
235 | for (tmp = ob->inv; tmp; tmp = tmp->below) |
221 | if (tmp->type == FORCE) |
236 | if (tmp->type == FORCE) |
222 | if (tmp->arch->name == dragon_ability_force) |
237 | if (tmp->arch->archname == dragon_ability_force) |
223 | abil = tmp; |
238 | abil = tmp; |
224 | else if (tmp->arch->name == dragon_skin_force) |
239 | else if (tmp->arch->archname == dragon_skin_force) |
225 | skin = tmp; |
240 | skin = tmp; |
226 | |
241 | |
227 | set_dragon_name (ob, abil, skin); |
242 | set_dragon_name (ob, abil, skin); |
228 | } |
243 | } |
229 | |
244 | |
230 | CLEAR_FLAG (ob, FLAG_FRIENDLY); |
|
|
231 | add_friendly_object (ob); |
|
|
232 | |
|
|
233 | LOG (llevInfo, "LOGIN: Player named %s from ip %s\n", &ob->name, ns->host); |
|
|
234 | |
|
|
235 | new_draw_info (NDI_UNIQUE, 0, ob, "Welcome Back!"); |
245 | new_draw_info (NDI_UNIQUE, 0, ob, "Welcome Back!"); |
236 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, NULL, "%s has entered the game.", &ob->name); |
246 | |
|
|
247 | esrv_new_player (this, ob->weight + ob->carrying); |
|
|
248 | |
|
|
249 | ob->flag [FLAG_READY_WEAPON] = false; |
|
|
250 | ob->flag [FLAG_READY_SKILL] = false; |
|
|
251 | ob->flag [FLAG_READY_BOW] = false; |
|
|
252 | |
|
|
253 | for (object *op = ob->inv; op; op = op->below) |
|
|
254 | if (op->flag [FLAG_APPLIED]) |
|
|
255 | switch (op->type) |
|
|
256 | { |
|
|
257 | case SKILL: |
|
|
258 | ob->flag [FLAG_APPLIED] = false; |
|
|
259 | break; |
|
|
260 | |
|
|
261 | case WAND: |
|
|
262 | case ROD: |
|
|
263 | case HORN: |
|
|
264 | case BOW: |
|
|
265 | ranged_ob = op; |
|
|
266 | break; |
|
|
267 | |
|
|
268 | case WEAPON: |
|
|
269 | combat_ob = op; |
|
|
270 | break; |
|
|
271 | } |
|
|
272 | |
|
|
273 | ob->change_weapon (combat_ob ? combat_ob : ranged_ob); |
|
|
274 | ob->update_stats (); |
237 | |
275 | |
238 | ns->floorbox_update (); |
276 | ns->floorbox_update (); |
239 | |
|
|
240 | esrv_new_player (this, ob->weight + ob->carrying); |
|
|
241 | esrv_send_inventory (ob, ob); |
277 | esrv_send_inventory (ob, ob); |
242 | esrv_add_spells (this, 0); |
278 | esrv_add_spells (this, 0); |
243 | |
279 | |
244 | enter_exit (ob, 0); |
280 | activate (); |
245 | |
281 | |
246 | // send_rules (ob);//TODO |
282 | send_rules (ob); |
247 | // send_news (ob);//TODO |
283 | send_news (ob); |
248 | // display_motd (ob);//TODO |
284 | display_motd (ob); |
|
|
285 | |
|
|
286 | INVOKE_PLAYER (CONNECT, this); |
249 | INVOKE_PLAYER (LOGIN, this); |
287 | INVOKE_PLAYER (LOGIN, this); |
|
|
288 | } |
|
|
289 | |
|
|
290 | void |
|
|
291 | player::disconnect () |
|
|
292 | { |
|
|
293 | if (ns) |
|
|
294 | { |
|
|
295 | if (active) |
|
|
296 | INVOKE_PLAYER (LOGOUT, this, ARG_INT (0)); |
|
|
297 | |
|
|
298 | INVOKE_PLAYER (DISCONNECT, this); |
|
|
299 | |
|
|
300 | ns->reset_stats (); |
|
|
301 | ns->pl = 0; |
|
|
302 | ns = 0; |
|
|
303 | } |
|
|
304 | |
|
|
305 | if (ob) |
|
|
306 | ob->close_container (); //TODO: client-specific |
|
|
307 | |
|
|
308 | observe = ob; |
|
|
309 | |
|
|
310 | deactivate (); |
250 | } |
311 | } |
251 | |
312 | |
252 | // the need for this function can be explained |
313 | // the need for this function can be explained |
253 | // by load_object not returning the object |
314 | // by load_object not returning the object |
254 | void |
315 | void |
255 | player::set_object (object *op) |
316 | player::set_object (object *op) |
256 | { |
317 | { |
257 | ob = op; |
318 | ob = observe = op; |
258 | ob->contr = this; /* this aren't yet in archetype */ |
319 | ob->contr = this; /* this aren't yet in archetype */ |
259 | |
320 | |
|
|
321 | ob->speed = 1.0f; |
260 | ob->speed_left = 0.5; |
322 | ob->speed_left = 0.5f; |
261 | ob->speed = 1.0; |
323 | |
262 | ob->direction = 5; /* So player faces south */ |
324 | ob->direction = 5; /* So player faces south */ |
263 | ob->stats.wc = 2; |
325 | } |
264 | ob->run_away = 25; /* Then we panick... */ |
|
|
265 | |
326 | |
266 | set_first_map (ob); |
327 | void |
267 | |
328 | player::set_observe (object *op) |
268 | ob->roll_stats (); |
329 | { |
|
|
330 | observe = op ? op : ob; |
|
|
331 | do_los = 1; |
269 | } |
332 | } |
270 | |
333 | |
271 | player::player () |
334 | player::player () |
272 | { |
335 | { |
273 | /* There are some elements we want initialized to non zero value - |
336 | /* There are some elements we want initialised to non zero value - |
274 | * we deal with that below this point. |
337 | * we deal with that below this point. |
275 | */ |
338 | */ |
276 | outputs_sync = 16; /* Every 2 seconds */ |
339 | outputs_sync = 4; |
277 | outputs_count = 8; /* Keeps present behaviour */ |
340 | outputs_count = 4; |
278 | unapply = unapply_nochoice; |
341 | unapply = unapply_nochoice; |
279 | |
342 | |
280 | assign (savebed_map, first_map_path); /* Init. respawn position */ |
343 | savebed_map = first_map_path; /* Init. respawn position */ |
281 | |
344 | |
282 | gen_sp_armour = 10; |
345 | gen_sp_armour = 10; |
283 | last_speed = -1; |
|
|
284 | shoottype = range_none; |
|
|
285 | bowtype = bow_normal; |
346 | bowtype = bow_normal; |
286 | petmode = pet_normal; |
347 | petmode = pet_normal; |
287 | listening = 10; |
348 | listening = 10; |
288 | usekeys = containers; |
349 | usekeys = containers; |
289 | last_weapon_sp = -1; |
|
|
290 | peaceful = 1; /* default peaceful */ |
350 | peaceful = 1; /* default peaceful */ |
291 | do_los = 1; |
351 | do_los = 1; |
292 | |
352 | |
293 | /* we need to clear these to -1 and not zero - otherwise, |
353 | weapon_sp = 1.0f; |
294 | * if a player quits and starts a new character, we wont |
354 | weapon_sp_left = 0.5f; |
295 | * send new values to the client, as things like exp start |
355 | } |
296 | * at zero. |
|
|
297 | */ |
|
|
298 | for (int i = 0; i < NUM_SKILLS; i++) |
|
|
299 | last_skill_exp[i] = -1; |
|
|
300 | |
356 | |
301 | for (int i = 0; i < NROFATTACKS; i++) |
357 | void |
302 | last_resist[i] = -1; |
358 | player::do_destroy () |
|
|
359 | { |
|
|
360 | disconnect (); |
303 | |
361 | |
304 | last_stats.exp = -1; |
362 | attachable::do_destroy (); |
305 | last_weight = (uint32) - 1; |
363 | |
|
|
364 | if (ob) |
|
|
365 | { |
|
|
366 | ob->destroy_inv (false); |
|
|
367 | ob->destroy (); |
|
|
368 | } |
306 | } |
369 | } |
307 | |
370 | |
308 | player::~player () |
371 | player::~player () |
309 | { |
372 | { |
310 | terminate_all_pets (ob); |
|
|
311 | |
|
|
312 | if (first_player != this) |
|
|
313 | { |
|
|
314 | player *prev = first_player; |
|
|
315 | |
|
|
316 | while (prev && prev->next && prev->next != this) |
|
|
317 | prev = prev->next; |
|
|
318 | |
|
|
319 | if (prev->next != this) |
|
|
320 | { |
|
|
321 | LOG (llevError, "Free_player: Can't find previous player.\n"); |
|
|
322 | abort (); |
|
|
323 | } |
|
|
324 | |
|
|
325 | prev->next = next; |
|
|
326 | } |
|
|
327 | else |
|
|
328 | first_player = next; |
|
|
329 | |
|
|
330 | if (ob) |
|
|
331 | { |
|
|
332 | ob->contr = 0; |
|
|
333 | ob->destroy (1); |
|
|
334 | } |
|
|
335 | |
|
|
336 | if (ns) |
|
|
337 | { |
|
|
338 | ns->send_packet ("goodbye"); |
|
|
339 | ns->flush (); |
|
|
340 | ns->pl = 0; |
|
|
341 | ns->destroy (); |
|
|
342 | } |
|
|
343 | |
|
|
344 | /* Clear item stack */ |
373 | /* Clear item stack */ |
345 | free (stack_items); |
374 | free (stack_items); |
346 | } |
375 | } |
347 | |
376 | |
348 | /* Tries to add player on the connection passed in ns. |
377 | /* Tries to add player on the connection passed in ns. |
… | |
… | |
353 | player::create () |
382 | player::create () |
354 | { |
383 | { |
355 | player *pl = new player; |
384 | player *pl = new player; |
356 | |
385 | |
357 | pl->set_object (arch_to_object (get_player_archetype (0))); |
386 | pl->set_object (arch_to_object (get_player_archetype (0))); |
|
|
387 | |
|
|
388 | pl->ob->roll_stats (); |
|
|
389 | pl->ob->stats.wc = 2; |
|
|
390 | pl->ob->run_away = 25; /* Then we panick... */ |
|
|
391 | |
|
|
392 | set_first_map (pl->ob); |
358 | |
393 | |
359 | return pl; |
394 | return pl; |
360 | } |
395 | } |
361 | |
396 | |
362 | /* |
397 | /* |
… | |
… | |
365 | * Note: there MUST be at least one player archetype! |
400 | * Note: there MUST be at least one player archetype! |
366 | */ |
401 | */ |
367 | archetype * |
402 | archetype * |
368 | get_player_archetype (archetype *at) |
403 | get_player_archetype (archetype *at) |
369 | { |
404 | { |
370 | archetype *start = at; |
405 | archvec::iterator i = at ? archetypes.find (at) : archetypes.begin (); |
371 | |
406 | |
372 | for (;;) |
407 | for (;;) |
373 | { |
408 | { |
374 | if (at == NULL || at->next == NULL) |
409 | if (++i == archetypes.end ()) |
375 | at = first_archetype; |
410 | i = archetypes.begin (); |
376 | else |
411 | else if (*i == at) |
377 | at = at->next; |
412 | cleanup ("not a single player archetype found"); |
378 | |
413 | |
379 | if (at->clone.type == PLAYER) |
414 | if ((*i)->type == PLAYER) |
380 | return at; |
415 | return *i; |
381 | |
|
|
382 | if (at == start) |
|
|
383 | { |
|
|
384 | LOG (llevError, "No Player archetypes\n"); |
|
|
385 | exit (-1); |
|
|
386 | } |
|
|
387 | } |
416 | } |
388 | } |
417 | } |
389 | |
418 | |
390 | object * |
419 | object * |
391 | get_nearest_player (object *mon) |
420 | get_nearest_player (object *mon) |
392 | { |
421 | { |
393 | object *op = NULL; |
422 | object *op = NULL; |
394 | player *pl = NULL; |
|
|
395 | objectlink *ol; |
423 | objectlink *ol; |
396 | unsigned lastdist; |
424 | unsigned lastdist; |
397 | rv_vector rv; |
425 | rv_vector rv; |
398 | |
426 | |
399 | for (ol = first_friendly_object, lastdist = 1000; ol != NULL; ol = ol->next) |
427 | for (ol = first_friendly_object, lastdist = 1000; ol; ol = ol->next) |
400 | { |
428 | { |
401 | /* We should not find free objects on this friendly list, but it |
429 | /* We should not find free objects on this friendly list, but it |
402 | * does periodically happen. Given that, lets deal with it. |
430 | * does periodically happen. Given that, lets deal with it. |
403 | * While unlikely, it is possible the next object on the friendly |
431 | * While unlikely, it is possible the next object on the friendly |
404 | * list is also free, so encapsulate this in a while loop. |
432 | * list is also free, so encapsulate this in a while loop. |
… | |
… | |
408 | object *tmp = ol->ob; |
436 | object *tmp = ol->ob; |
409 | |
437 | |
410 | /* Can't do much more other than log the fact, because the object |
438 | /* Can't do much more other than log the fact, because the object |
411 | * itself will have been cleared. |
439 | * itself will have been cleared. |
412 | */ |
440 | */ |
413 | LOG (llevDebug, "get_nearest_player: Found free/non friendly object on friendly list\n"); |
441 | LOG (llevDebug, "get_nearest_player: Found free/non friendly object '%s' on friendly list\n", |
|
|
442 | tmp->debug_desc ()); |
414 | ol = ol->next; |
443 | ol = ol->next; |
415 | remove_friendly_object (tmp); |
444 | remove_friendly_object (tmp); |
416 | if (!ol) |
445 | if (!ol) |
417 | return op; |
446 | return op; |
418 | } |
447 | } |
… | |
… | |
431 | { |
460 | { |
432 | op = ol->ob; |
461 | op = ol->ob; |
433 | lastdist = rv.distance; |
462 | lastdist = rv.distance; |
434 | } |
463 | } |
435 | } |
464 | } |
436 | for (pl = first_player; pl != NULL; pl = pl->next) |
465 | |
437 | { |
466 | for_all_players (pl) |
438 | if (can_detect_enemy (mon, pl->ob, &rv)) |
467 | if (can_detect_enemy (mon, pl->ob, &rv)) |
439 | { |
|
|
440 | |
|
|
441 | if (lastdist > rv.distance) |
468 | if (lastdist > rv.distance) |
442 | { |
469 | { |
443 | op = pl->ob; |
470 | op = pl->ob; |
444 | lastdist = rv.distance; |
471 | lastdist = rv.distance; |
445 | } |
472 | } |
446 | } |
473 | |
447 | } |
|
|
448 | #if 0 |
474 | #if 0 |
449 | LOG (llevDebug, "get_nearest_player() finds player: %s\n", op ? &op->name : "(null)"); |
475 | LOG (llevDebug, "get_nearest_player() finds player: %s\n", op ? &op->name : "(null)"); |
450 | #endif |
476 | #endif |
451 | return op; |
477 | return op; |
452 | } |
478 | } |
… | |
… | |
510 | x = mon->x; |
536 | x = mon->x; |
511 | y = mon->y; |
537 | y = mon->y; |
512 | m = mon->map; |
538 | m = mon->map; |
513 | dir = rv.direction; |
539 | dir = rv.direction; |
514 | lastdir = firstdir = rv.direction; /* perhaps we stand next to pl, init firstdir too */ |
540 | lastdir = firstdir = rv.direction; /* perhaps we stand next to pl, init firstdir too */ |
515 | diff = FABS (rv.distance_x) > FABS (rv.distance_y) ? FABS (rv.distance_x) : FABS (rv.distance_y); |
541 | diff = ::max (abs (rv.distance_x), abs (rv.distance_y)); |
|
|
542 | |
516 | /* If we can't solve it within the search distance, return now. */ |
543 | /* If we can't solve it within the search distance, return now. */ |
517 | if (diff > max) |
544 | if (diff > max) |
518 | return 0; |
545 | return 0; |
|
|
546 | |
519 | while (diff > 1 && max > 0) |
547 | while (diff > 1 && max > 0) |
520 | { |
548 | { |
521 | lastx = x; |
549 | lastx = x; |
522 | lasty = y; |
550 | lasty = y; |
523 | lastmap = m; |
551 | lastmap = m; |
… | |
… | |
605 | max--; |
633 | max--; |
606 | lastdir = dir; |
634 | lastdir = dir; |
607 | if (!firstdir) |
635 | if (!firstdir) |
608 | firstdir = dir; |
636 | firstdir = dir; |
609 | } |
637 | } |
|
|
638 | |
610 | if (diff <= 1) |
639 | if (diff <= 1) |
611 | { |
640 | { |
612 | /* Recalculate diff (distance) because we may not have actually |
641 | /* Recalculate diff (distance) because we may not have actually |
613 | * headed toward player for entire distance. |
642 | * headed toward player for entire distance. |
614 | */ |
643 | */ |
615 | get_rangevector_from_mapcoord (m, x, y, pl, &rv, 0); |
644 | get_rangevector_from_mapcoord (m, x, y, pl, &rv, 0); |
616 | diff = FABS (rv.distance_x) > FABS (rv.distance_y) ? FABS (rv.distance_x) : FABS (rv.distance_y); |
645 | diff = ::max (abs (rv.distance_x), abs (rv.distance_y)); |
617 | } |
646 | } |
|
|
647 | |
618 | if (diff > max) |
648 | if (diff > max) |
619 | return 0; |
649 | return 0; |
620 | } |
650 | } |
|
|
651 | |
621 | /* If we reached the max, didn't find a direction in time */ |
652 | /* If we reached the max, didn't find a direction in time */ |
622 | if (!max) |
653 | if (!max) |
623 | return 0; |
654 | return 0; |
624 | |
655 | |
625 | return firstdir; |
656 | return firstdir; |
… | |
… | |
739 | roll_stat (void) |
770 | roll_stat (void) |
740 | { |
771 | { |
741 | int a[4], i, j, k; |
772 | int a[4], i, j, k; |
742 | |
773 | |
743 | for (i = 0; i < 4; i++) |
774 | for (i = 0; i < 4; i++) |
744 | a[i] = (int) RANDOM () % 6 + 1; |
775 | a[i] = (int) rndm (6) + 1; |
745 | |
776 | |
746 | for (i = 0, j = 0, k = 7; i < 4; i++) |
777 | for (i = 0, j = 0, k = 7; i < 4; i++) |
747 | if (a[i] < k) |
778 | if (a[i] < k) |
748 | k = a[i], j = i; |
779 | k = a[i], j = i; |
749 | |
780 | |
… | |
… | |
755 | } |
786 | } |
756 | |
787 | |
757 | void |
788 | void |
758 | object::roll_stats () |
789 | object::roll_stats () |
759 | { |
790 | { |
760 | int statsort [7]; |
791 | int statsort [NUM_STATS]; |
761 | |
792 | |
762 | for (;;) |
793 | for (;;) |
763 | { |
794 | { |
764 | int sum = 0; |
795 | int sum = 0; |
765 | for (int i = 7; i--; ) |
796 | for (int i = NUM_STATS; i--; ) |
766 | sum += statsort [i] = roll_stat (); |
797 | sum += statsort [i] = roll_stat (); |
767 | |
798 | |
768 | if (sum >= 82 && sum <= 116) |
799 | if (sum >= 82 && sum <= 116) |
769 | break; |
800 | break; |
770 | } |
801 | } |
771 | |
802 | |
772 | // Sort the stats so that rerolling is easier... |
803 | // Sort the stats so that rerolling is easier... |
773 | std::sort (statsort, statsort + 7, std::greater<int>()); |
804 | std::sort (statsort, statsort + NUM_STATS, std::greater<int>()); |
774 | |
805 | |
|
|
806 | for (int i = 0; i < NUM_STATS; ++i) |
775 | stats.Str = statsort[0]; |
807 | stats.stat (i) = statsort [i]; |
776 | stats.Dex = statsort[1]; |
|
|
777 | stats.Con = statsort[2]; |
|
|
778 | stats.Int = statsort[3]; |
|
|
779 | stats.Wis = statsort[4]; |
|
|
780 | stats.Pow = statsort[5]; |
|
|
781 | stats.Cha = statsort[6]; |
|
|
782 | |
808 | |
783 | stats.exp = 0; |
809 | stats.exp = 0; |
784 | stats.ac = 0; |
810 | stats.ac = 0; |
785 | |
811 | |
786 | stats.hp = stats.maxhp; |
812 | stats.hp = stats.maxhp; |
… | |
… | |
798 | } |
824 | } |
799 | |
825 | |
800 | void |
826 | void |
801 | object::swap_stats (int a, int b) |
827 | object::swap_stats (int a, int b) |
802 | { |
828 | { |
803 | int tmp = get_attr_value (&contr->orig_stats, a); |
829 | swap (contr->orig_stats.stat (a), contr->orig_stats.stat (b)); |
804 | set_attr_value (&contr->orig_stats, a, get_attr_value (&contr->orig_stats, b)); |
|
|
805 | set_attr_value (&contr->orig_stats, b, tmp); |
|
|
806 | |
830 | |
|
|
831 | for (int i = 0; i < NUM_STATS; ++i) |
807 | stats.Str = contr->orig_stats.Str; |
832 | stats.stat (i) = contr->orig_stats.stat (i); |
808 | stats.Dex = contr->orig_stats.Dex; |
|
|
809 | stats.Con = contr->orig_stats.Con; |
|
|
810 | stats.Int = contr->orig_stats.Int; |
|
|
811 | stats.Wis = contr->orig_stats.Wis; |
|
|
812 | stats.Pow = contr->orig_stats.Pow; |
|
|
813 | stats.Cha = contr->orig_stats.Cha; |
|
|
814 | |
833 | |
815 | //TODO: the following code looks so borked and should, at the very least, |
834 | //TODO: the following code looks so borked and should, at the very least, |
816 | // be merged with the similar code in roll_stats |
835 | // be merged with the similar code in roll_stats |
817 | stats.ac = 0; |
836 | stats.ac = 0; |
818 | |
837 | |
… | |
… | |
830 | contr->levsp[1] = 6; |
849 | contr->levsp[1] = 6; |
831 | contr->levgrace[1] = 3; |
850 | contr->levgrace[1] = 3; |
832 | |
851 | |
833 | contr->orig_stats = stats; |
852 | contr->orig_stats = stats; |
834 | } |
853 | } |
|
|
854 | } |
|
|
855 | |
|
|
856 | static void |
|
|
857 | start_info (object *op) |
|
|
858 | { |
|
|
859 | char buf[MAX_BUF]; |
|
|
860 | |
|
|
861 | sprintf (buf, "Welcome to Crossfire v%s!", VERSION); |
|
|
862 | new_draw_info (NDI_UNIQUE, 0, op, buf); |
|
|
863 | //new_draw_info (NDI_UNIQUE, 0, op, "Press `?' for help"); |
|
|
864 | //new_draw_info (NDI_UNIQUE, 0, op, " "); |
835 | } |
865 | } |
836 | |
866 | |
837 | /* This function takes the key that is passed, and does the |
867 | /* This function takes the key that is passed, and does the |
838 | * appropriate action with it (change race, or other things). |
868 | * appropriate action with it (change race, or other things). |
839 | * The function name is for historical reasons - now we have |
869 | * The function name is for historical reasons - now we have |
840 | * separate race and class; this actually changes the RACE, |
870 | * separate race and class; this actually changes the RACE, |
841 | * not the class. |
871 | * not the class. |
842 | */ |
872 | */ |
843 | int |
873 | void |
844 | key_change_class (object *op, char key) |
874 | player::chargen_race_done () |
845 | { |
875 | { |
846 | int tmp_loop; |
|
|
847 | |
|
|
848 | if (key == 'd' || key == 'D') |
|
|
849 | { |
|
|
850 | char buf[MAX_BUF]; |
|
|
851 | |
|
|
852 | /* this must before then initial items are given */ |
876 | /* this must before then initial items are given */ |
853 | esrv_new_player (op->contr, op->weight + op->carrying); |
877 | esrv_new_player (ob->contr, ob->weight + ob->carrying); |
854 | |
878 | |
855 | treasurelist *tl = find_treasurelist ("starting_wealth"); |
879 | treasurelist *tl = treasurelist::find ("starting_wealth"); |
856 | if (tl) |
880 | if (tl) |
857 | create_treasure (tl, op, 0, 0, 0); |
881 | create_treasure (tl, ob, 0, 0, 0); |
858 | |
882 | |
859 | INVOKE_PLAYER (BIRTH, op->contr); |
883 | INVOKE_PLAYER (BIRTH, ob->contr); |
860 | INVOKE_PLAYER (LOGIN, op->contr); |
884 | INVOKE_PLAYER (LOGIN, ob->contr); |
861 | |
885 | |
862 | op->contr->ns->state = ST_PLAYING; |
886 | ob->contr->ns->state = ST_PLAYING; |
863 | |
887 | |
864 | if (op->msg) |
888 | if (ob->msg) |
865 | op->msg = NULL; |
889 | ob->msg = 0; |
866 | |
890 | |
867 | /* We create this now because some of the unique maps will need it |
891 | /* We create this now because some of the unique maps will need it |
868 | * to save here. |
892 | * to save here. |
869 | */ |
893 | */ |
|
|
894 | { |
|
|
895 | char buf[MAX_BUF]; |
870 | sprintf (buf, "%s/%s/%s", settings.localdir, settings.playerdir, &op->name); |
896 | sprintf (buf, "%s/%s/%s", settings.localdir, settings.playerdir, &ob->name); |
871 | make_path_to_file (buf); |
897 | make_path_to_file (buf); |
|
|
898 | } |
872 | |
899 | |
873 | #ifdef AUTOSAVE |
|
|
874 | op->contr->last_save_tick = pticks; |
|
|
875 | #endif |
|
|
876 | start_info (op); |
900 | start_info (ob); |
877 | CLEAR_FLAG (op, FLAG_WIZ); |
901 | CLEAR_FLAG (ob, FLAG_WIZ); |
878 | give_initial_items (op, op->randomitems); |
902 | give_initial_items (ob, ob->randomitems); |
879 | link_player_skills (op); |
903 | link_player_skills (ob); |
880 | esrv_send_inventory (op, op); |
904 | esrv_send_inventory (ob, ob); |
881 | op->update_stats (); |
905 | ob->update_stats (); |
882 | |
906 | |
883 | /* This moves the player to a different start map, if there |
907 | /* This moves the player to a different start map, if there |
884 | * is one for this race |
908 | * is one for this race |
885 | */ |
909 | */ |
886 | if (*first_map_ext_path) |
910 | if (*first_map_ext_path) |
887 | { |
911 | { |
888 | object *tmp; |
912 | object *tmp; |
889 | char mapname[MAX_BUF]; |
913 | char mapname[MAX_BUF]; |
890 | |
914 | |
891 | snprintf (mapname, MAX_BUF - 1, "%s/%s", first_map_ext_path, &op->arch->name); |
915 | snprintf (mapname, MAX_BUF - 1, "%s/%s", &first_map_ext_path, &ob->arch->archname); |
892 | tmp = object::create (); |
916 | tmp = object::create (); |
893 | EXIT_PATH (tmp) = mapname; |
917 | EXIT_PATH (tmp) = mapname; |
894 | EXIT_X (tmp) = op->x; |
918 | EXIT_X (tmp) = ob->x; |
895 | EXIT_Y (tmp) = op->y; |
919 | EXIT_Y (tmp) = ob->y; |
896 | enter_exit (op, tmp); /* we don't really care if it succeeded; |
920 | ob->enter_exit (tmp); /* we don't really care if it succeeded; |
897 | * if the map isn't there, then stay on the |
921 | * if the map isn't there, then stay on the |
898 | * default initial map */ |
922 | * default initial map */ |
899 | tmp->destroy (); |
923 | tmp->destroy (); |
900 | } |
924 | } |
901 | else |
925 | else |
902 | LOG (llevDebug, "first_map_ext_path not set\n"); |
926 | LOG (llevDebug, "first_map_ext_path not set\n"); |
|
|
927 | } |
903 | |
928 | |
904 | return 0; |
929 | void |
905 | } |
930 | player::chargen_race_next () |
906 | |
931 | { |
907 | /* Following actually changes the race - this is the default command |
932 | /* Following actually changes the race - this is the default command |
908 | * if we don't match with one of the options above. |
933 | * if we don't match with one of the options above. |
909 | */ |
934 | */ |
910 | |
935 | |
911 | tmp_loop = 0; |
936 | do |
912 | while (!tmp_loop) |
|
|
913 | { |
937 | { |
914 | shstr name = op->name; |
938 | shstr name = ob->name; |
915 | int x = op->x, y = op->y; |
939 | int x = ob->x, y = ob->y; |
916 | |
940 | |
917 | op->remove_statbonus (); |
941 | ob->remove_statbonus (); |
918 | op->remove (); |
942 | ob->remove (); |
919 | op->arch = get_player_archetype (op->arch); |
943 | ob->arch = get_player_archetype (ob->arch); |
920 | op->arch->clone.copy_to (op); |
944 | ob->arch->copy_to (ob); |
921 | op->instantiate (); |
945 | ob->instantiate (); |
922 | op->stats = op->contr->orig_stats; |
946 | ob->stats = ob->contr->orig_stats; |
923 | op->name = op->name_pl = name; |
947 | ob->name = ob->name_pl = name; |
924 | op->x = x; |
948 | ob->x = x; |
925 | op->y = y; |
949 | ob->y = y; |
926 | SET_ANIMATION (op, 2); /* So player faces south */ |
950 | SET_ANIMATION (ob, 2); /* So player faces south */ |
927 | insert_ob_in_map (op, op->map, op, 0); |
951 | insert_ob_in_map (ob, ob->map, ob, 0); |
928 | assign (op->contr->title, op->arch->clone.name); |
952 | assign (ob->contr->title, ob->arch->object::name); |
929 | op->add_statbonus (); |
953 | ob->add_statbonus (); |
930 | tmp_loop = allowed_class (op); |
|
|
931 | } |
954 | } |
|
|
955 | while (!allowed_class (ob)); |
932 | |
956 | |
933 | update_object (op, UP_OBJ_FACE); |
957 | update_object (ob, UP_OBJ_FACE); |
934 | esrv_update_item (UPD_FACE, op, op); |
958 | esrv_update_item (UPD_FACE, ob, ob); |
935 | op->update_stats (); |
959 | ob->update_stats (); |
936 | op->stats.hp = op->stats.maxhp; |
960 | ob->stats.hp = ob->stats.maxhp; |
937 | op->stats.sp = op->stats.maxsp; |
961 | ob->stats.sp = ob->stats.maxsp; |
938 | op->stats.grace = 0; |
962 | ob->stats.grace = 0; |
939 | |
|
|
940 | if (op->msg) |
|
|
941 | new_draw_info (NDI_BLUE, 0, op, op->msg); |
|
|
942 | |
|
|
943 | send_query (op->contr->ns, CS_QUERY_SINGLECHAR, "Press any key for the next race.\nPress `d' to play this race.\n"); |
|
|
944 | return 0; |
|
|
945 | } |
|
|
946 | |
|
|
947 | int |
|
|
948 | key_confirm_quit (object *op, char key) |
|
|
949 | { |
|
|
950 | if (key != 'y' && key != 'Y' && key != 'q' && key != 'Q') |
|
|
951 | { |
|
|
952 | op->contr->ns->state = ST_PLAYING; |
|
|
953 | new_draw_info (NDI_UNIQUE, 0, op, "OK, continuing to play."); |
|
|
954 | return 1; |
|
|
955 | } |
|
|
956 | |
|
|
957 | INVOKE_PLAYER (LOGOUT, op->contr); |
|
|
958 | INVOKE_PLAYER (QUIT, op->contr); |
|
|
959 | |
|
|
960 | terminate_all_pets (op); |
|
|
961 | leave_map (op); |
|
|
962 | op->direction = 0; |
|
|
963 | new_draw_info_format (NDI_UNIQUE | NDI_ALL, 5, NULL, "%s quits the game.", &op->name); |
|
|
964 | |
|
|
965 | strcpy (op->contr->killer, "quit"); |
|
|
966 | check_score (op); |
|
|
967 | op->contr->party = 0; |
|
|
968 | op->contr->own_title[0] = '\0'; |
|
|
969 | |
|
|
970 | object_ptr ob = op; |
|
|
971 | |
|
|
972 | delete ob->contr; |
|
|
973 | |
|
|
974 | /* We need to hunt for any per player unique maps in memory and |
|
|
975 | * get rid of them. The trailing slash in the path is intentional, |
|
|
976 | * so that players named 'Ab' won't match against players 'Abe' pathname |
|
|
977 | */ |
|
|
978 | char buf[MAX_BUF]; |
|
|
979 | sprintf (buf, "%s/%s/%s/", settings.localdir, settings.playerdir, &op->name); |
|
|
980 | |
|
|
981 | for (maptile *next, *mp = first_map; mp; mp = next) |
|
|
982 | { |
|
|
983 | next = mp->next; |
|
|
984 | |
|
|
985 | if (!strncmp (mp->path, buf, strlen (buf))) |
|
|
986 | delete_map (mp); |
|
|
987 | } |
|
|
988 | |
|
|
989 | delete_character (ob->name, 1); |
|
|
990 | |
|
|
991 | return 1; |
|
|
992 | } |
963 | } |
993 | |
964 | |
994 | void |
965 | void |
995 | flee_player (object *op) |
966 | flee_player (object *op) |
996 | { |
967 | { |
… | |
… | |
1043 | /* Cornered, get rid of scared */ |
1014 | /* Cornered, get rid of scared */ |
1044 | CLEAR_FLAG (op, FLAG_SCARED); |
1015 | CLEAR_FLAG (op, FLAG_SCARED); |
1045 | op->enemy = NULL; |
1016 | op->enemy = NULL; |
1046 | } |
1017 | } |
1047 | |
1018 | |
1048 | |
|
|
1049 | /* check_pick sees if there is stuff to be picked up/picks up stuff. |
1019 | /* check_pick sees if there is stuff to be picked up/picks up stuff. |
1050 | * IT returns 1 if the player should keep on moving, 0 if he should |
1020 | * It returns 1 if the player should keep on moving, 0 if he should |
1051 | * stop. |
1021 | * stop. |
1052 | */ |
1022 | */ |
1053 | int |
1023 | int |
1054 | check_pick (object *op) |
1024 | check_pick (object *op) |
1055 | { |
1025 | { |
1056 | object *tmp, *next; |
1026 | object *tmp, *next; |
1057 | int stop = 0; |
1027 | int stop = 0; |
1058 | int j, k, wvratio; |
1028 | int wvratio; |
1059 | char putstring[128], tmpstr[16]; |
1029 | char putstring[128]; |
1060 | |
1030 | |
1061 | /* if you're flying, you cna't pick up anything */ |
1031 | /* if you're flying, you cna't pick up anything */ |
1062 | if (op->move_type & MOVE_FLYING) |
1032 | if (op->move_type & MOVE_FLYING) |
1063 | return 1; |
1033 | return 1; |
1064 | |
1034 | |
… | |
… | |
1132 | if (tmp->name != NULL) |
1102 | if (tmp->name != NULL) |
1133 | sprintf (putstring, "item name: %s item type: %d weight/value: %d", |
1103 | sprintf (putstring, "item name: %s item type: %d weight/value: %d", |
1134 | &tmp->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1104 | &tmp->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1135 | else |
1105 | else |
1136 | sprintf (putstring, "item name: %s item type: %d weight/value: %d", |
1106 | sprintf (putstring, "item name: %s item type: %d weight/value: %d", |
1137 | &tmp->arch->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1107 | &tmp->arch->archname, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
|
|
1108 | |
1138 | new_draw_info (NDI_UNIQUE, 0, op, putstring); |
1109 | new_draw_info (NDI_UNIQUE, 0, op, putstring); |
1139 | |
|
|
1140 | sprintf (putstring, "...flags: "); |
|
|
1141 | for (k = 0; k < 4; k++) |
|
|
1142 | { |
|
|
1143 | for (j = 0; j < 32; j++) |
|
|
1144 | { |
|
|
1145 | if ((tmp->flags[k] >> j) & 0x01) |
|
|
1146 | { |
|
|
1147 | sprintf (tmpstr, "%d ", k * 32 + j); |
|
|
1148 | strcat (putstring, tmpstr); |
|
|
1149 | } |
|
|
1150 | } |
|
|
1151 | } |
|
|
1152 | new_draw_info (NDI_UNIQUE, 0, op, putstring); |
|
|
1153 | |
|
|
1154 | #if 0 |
|
|
1155 | /* print the flags too */ |
|
|
1156 | for (k = 0; k < 4; k++) |
|
|
1157 | { |
|
|
1158 | fprintf (stderr, "%d [%d] ", k, k * 32 + 31); |
|
|
1159 | for (j = 0; j < 32; j++) |
|
|
1160 | { |
|
|
1161 | fprintf (stderr, "%d", tmp->flags[k] >> (31 - j) & 0x01); |
|
|
1162 | if (!((j + 1) % 4)) |
|
|
1163 | fprintf (stderr, " "); |
|
|
1164 | } |
|
|
1165 | fprintf (stderr, " [%d]\n", k * 32); |
|
|
1166 | } |
|
|
1167 | #endif |
|
|
1168 | } |
1110 | } |
|
|
1111 | |
1169 | /* philosophy: |
1112 | /* philosophy: |
1170 | * It's easy to grab an item type from a pile, as long as it's |
1113 | * It's easy to grab an item type from a pile, as long as it's |
1171 | * generic. This takes no game-time. For more detailed pickups |
1114 | * generic. This takes no game-time. For more detailed pickups |
1172 | * and selections, select-items shoul dbe used. This is a |
1115 | * and selections, select-items should be used. This is a |
1173 | * grab-as-you-run type mode that's really useful for arrows for |
1116 | * grab-as-you-run type mode that's really useful for arrows for |
1174 | * example. |
1117 | * example. |
1175 | * The drawback: right now it has no frontend, so you need to |
1118 | * The drawback: right now it has no frontend, so you need to |
1176 | * stick the bits you want into a calculator in hex mode and then |
1119 | * stick the bits you want into a calculator in hex mode and then |
1177 | * convert to decimal and then 'pickup <#> |
1120 | * convert to decimal and then 'pickup <#> |
… | |
… | |
1362 | /* careful: chairs and tables are weapons! */ |
1305 | /* careful: chairs and tables are weapons! */ |
1363 | if (op->contr->mode & PU_ALLWEAPON) |
1306 | if (op->contr->mode & PU_ALLWEAPON) |
1364 | { |
1307 | { |
1365 | if (tmp->type == WEAPON && tmp->name != NULL) |
1308 | if (tmp->type == WEAPON && tmp->name != NULL) |
1366 | { |
1309 | { |
1367 | if (strstr (tmp->name, "table") == NULL && strstr (tmp->arch->name, "table") == NULL && |
1310 | if (strstr (tmp->name, "table") == NULL && strstr (tmp->arch->archname, "table") == NULL && |
1368 | strstr (tmp->name, "chair") && strstr (tmp->arch->name, "chair") == NULL) |
1311 | strstr (tmp->name, "chair") && strstr (tmp->arch->archname, "chair") == NULL) |
1369 | { |
1312 | { |
1370 | pick_up (op, tmp); |
1313 | pick_up (op, tmp); |
1371 | continue; |
1314 | continue; |
1372 | } |
1315 | } |
1373 | } |
1316 | } |
1374 | |
1317 | |
1375 | if (tmp->type == WEAPON && tmp->name == NULL) |
1318 | if (tmp->type == WEAPON && tmp->name == NULL) |
1376 | { |
1319 | { |
1377 | if (strstr (tmp->arch->name, "table") == NULL && strstr (tmp->arch->name, "chair") == NULL) |
1320 | if (strstr (tmp->arch->archname, "table") == NULL && strstr (tmp->arch->archname, "chair") == NULL) |
1378 | { |
1321 | { |
1379 | pick_up (op, tmp); |
1322 | pick_up (op, tmp); |
1380 | continue; |
1323 | continue; |
1381 | } |
1324 | } |
1382 | } |
1325 | } |
… | |
… | |
1407 | if (tmp->name != NULL) |
1350 | if (tmp->name != NULL) |
1408 | { |
1351 | { |
1409 | fprintf (stderr, "%s", tmp->name); |
1352 | fprintf (stderr, "%s", tmp->name); |
1410 | } |
1353 | } |
1411 | else |
1354 | else |
1412 | fprintf (stderr, "%s", tmp->arch->name); |
1355 | fprintf (stderr, "%s", tmp->arch->archname); |
1413 | fprintf (stderr, ",%d] = ", tmp->type); |
1356 | fprintf (stderr, ",%d] = ", tmp->type); |
1414 | fprintf (stderr, "%d\n", (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1357 | fprintf (stderr, "%d\n", (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1415 | #endif |
1358 | #endif |
1416 | continue; |
1359 | continue; |
1417 | } |
1360 | } |
… | |
… | |
1428 | * found object is returned. |
1371 | * found object is returned. |
1429 | */ |
1372 | */ |
1430 | object * |
1373 | object * |
1431 | find_arrow (object *op, const char *type) |
1374 | find_arrow (object *op, const char *type) |
1432 | { |
1375 | { |
1433 | object *tmp = NULL; |
1376 | object *tmp = 0; |
1434 | |
1377 | |
1435 | for (op = op->inv; op; op = op->below) |
1378 | for (op = op->inv; op; op = op->below) |
1436 | if (!tmp && op->type == CONTAINER && op->race == type && QUERY_FLAG (op, FLAG_APPLIED)) |
1379 | if (!tmp && op->type == CONTAINER && op->race == type && QUERY_FLAG (op, FLAG_APPLIED)) |
1437 | tmp = find_arrow (op, type); |
1380 | tmp = find_arrow (op, type); |
1438 | else if (op->type == ARROW && op->race == type) |
1381 | else if (op->type == ARROW && op->race == type) |
1439 | return op; |
1382 | return op; |
|
|
1383 | |
1440 | return tmp; |
1384 | return tmp; |
1441 | } |
1385 | } |
1442 | |
1386 | |
1443 | /* |
1387 | /* |
1444 | * Similar to find_arrow, but looks for (roughly) the best arrow to use |
1388 | * Similar to find_arrow, but looks for (roughly) the best arrow to use |
1445 | * against the target. A full test is not performed, simply a basic test |
1389 | * against the target. A full test is not performed, simply a basic test |
1446 | * of resistances. The archer is making a quick guess at what he sees down |
1390 | * of resistances. The archer is making a quick guess at what he sees down |
1447 | * the hall. Failing that it does it's best to pick the highest plus arrow. |
1391 | * the hall. Failing that it does it's best to pick the highest plus arrow. |
1448 | */ |
1392 | */ |
1449 | |
|
|
1450 | object * |
1393 | object * |
1451 | find_better_arrow (object *op, object *target, const char *type, int *better) |
1394 | find_better_arrow (object *op, object *target, const char *type, int *better) |
1452 | { |
1395 | { |
1453 | object *tmp = NULL, *arrow, *ntmp; |
1396 | object *tmp = NULL, *arrow, *ntmp; |
1454 | int attacknum, attacktype, betterby = 0, i; |
1397 | int attacknum, attacktype, betterby = 0, i; |
… | |
… | |
1487 | else |
1430 | else |
1488 | { |
1431 | { |
1489 | for (attacknum = 0; attacknum < NROFATTACKS; attacknum++) |
1432 | for (attacknum = 0; attacknum < NROFATTACKS; attacknum++) |
1490 | { |
1433 | { |
1491 | attacktype = 1 << attacknum; |
1434 | attacktype = 1 << attacknum; |
1492 | if ((arrow->attacktype & attacktype) && (target->arch->clone.resist[attacknum]) < 0) |
1435 | if ((arrow->attacktype & attacktype) && (target->arch->resist[attacknum]) < 0) |
1493 | if (((arrow->magic + arrow->stats.dam) * (100 - target->arch->clone.resist[attacknum]) / 100) > betterby) |
1436 | if (((arrow->magic + arrow->stats.dam) * (100 - target->arch->resist[attacknum]) / 100) > betterby) |
1494 | { |
1437 | { |
1495 | tmp = arrow; |
1438 | tmp = arrow; |
1496 | betterby = (arrow->magic + arrow->stats.dam) * (100 - target->arch->clone.resist[attacknum]) / 100; |
1439 | betterby = (arrow->magic + arrow->stats.dam) * (100 - target->arch->resist[attacknum]) / 100; |
1497 | } |
1440 | } |
1498 | } |
1441 | } |
1499 | if ((2 + arrow->magic + arrow->stats.dam) > betterby) |
1442 | if ((2 + arrow->magic + arrow->stats.dam) > betterby) |
1500 | { |
1443 | { |
1501 | tmp = arrow; |
1444 | tmp = arrow; |
… | |
… | |
1520 | * find_better_arrow to find a decent arrow to use. |
1463 | * find_better_arrow to find a decent arrow to use. |
1521 | * op = the shooter |
1464 | * op = the shooter |
1522 | * type = bow->race |
1465 | * type = bow->race |
1523 | * dir = fire direction |
1466 | * dir = fire direction |
1524 | */ |
1467 | */ |
1525 | |
|
|
1526 | object * |
1468 | object * |
1527 | pick_arrow_target (object *op, const char *type, int dir) |
1469 | pick_arrow_target (object *op, const char *type, int dir) |
1528 | { |
1470 | { |
1529 | object *tmp = NULL; |
1471 | object *tmp = NULL; |
1530 | maptile *m; |
1472 | maptile *m; |
… | |
… | |
1595 | */ |
1537 | */ |
1596 | int |
1538 | int |
1597 | fire_bow (object *op, object *part, object *arrow, int dir, int wc_mod, sint16 sx, sint16 sy) |
1539 | fire_bow (object *op, object *part, object *arrow, int dir, int wc_mod, sint16 sx, sint16 sy) |
1598 | { |
1540 | { |
1599 | object *left, *bow; |
1541 | object *left, *bow; |
1600 | int bowspeed, mflags; |
1542 | int mflags; |
1601 | maptile *m; |
1543 | maptile *m; |
1602 | |
1544 | |
1603 | if (!dir) |
1545 | if (!dir) |
1604 | { |
1546 | { |
1605 | new_draw_info (NDI_UNIQUE, 0, op, "You can't shoot yourself!"); |
1547 | new_draw_info (NDI_UNIQUE, 0, op, "You can't shoot yourself!"); |
1606 | return 0; |
1548 | return 0; |
1607 | } |
1549 | } |
1608 | |
1550 | |
1609 | if (op->type == PLAYER) |
1551 | if (op->contr) |
1610 | bow = op->contr->ranges[range_bow]; |
1552 | bow = op->current_weapon; |
1611 | else |
1553 | else |
1612 | { |
1554 | { |
1613 | for (bow = op->inv; bow; bow = bow->below) |
1555 | for (bow = op->inv; bow; bow = bow->below) |
1614 | /* Don't check for applied - monsters don't apply bows - in that way, they |
1556 | /* Don't check for applied - monsters don't apply bows - in that way, they |
1615 | * don't need to switch back and forth between bows and weapons. |
1557 | * don't need to switch back and forth between bows and weapons. |
… | |
… | |
1620 | if (!bow) |
1562 | if (!bow) |
1621 | { |
1563 | { |
1622 | LOG (llevError, "Range: bow without activated bow (%s).\n", &op->name); |
1564 | LOG (llevError, "Range: bow without activated bow (%s).\n", &op->name); |
1623 | return 0; |
1565 | return 0; |
1624 | } |
1566 | } |
|
|
1567 | |
|
|
1568 | // optimisation: move object to top so we will find it quickly again |
|
|
1569 | if (bow->below) |
|
|
1570 | { |
|
|
1571 | bow->remove (); |
|
|
1572 | op->insert (bow); |
|
|
1573 | } |
|
|
1574 | |
1625 | } |
1575 | } |
1626 | |
1576 | |
1627 | if (!bow->race || !bow->skill) |
1577 | if (!bow->race || !bow->skill) |
1628 | { |
1578 | { |
1629 | new_draw_info_format (NDI_UNIQUE, 0, op, "Your %s is broken.", &bow->name); |
1579 | new_draw_info_format (NDI_UNIQUE, 0, op, "Your %s is broken.", &bow->name); |
1630 | return 0; |
1580 | return 0; |
1631 | } |
1581 | } |
1632 | |
|
|
1633 | bowspeed = bow->stats.sp + dex_bonus[op->stats.Dex]; |
|
|
1634 | |
|
|
1635 | /* penalize ROF for bestarrow */ |
|
|
1636 | if (op->type == PLAYER && op->contr->bowtype == bow_bestarrow) |
|
|
1637 | bowspeed -= dex_bonus[op->stats.Dex] + 5; |
|
|
1638 | |
|
|
1639 | if (bowspeed < 1) |
|
|
1640 | bowspeed = 1; |
|
|
1641 | |
1582 | |
1642 | if (arrow == NULL) |
1583 | if (arrow == NULL) |
1643 | { |
1584 | { |
1644 | if ((arrow = find_arrow (op, bow->race)) == NULL) |
1585 | if ((arrow = find_arrow (op, bow->race)) == NULL) |
1645 | { |
1586 | { |
1646 | if (op->type == PLAYER) |
1587 | if (op->type == PLAYER) |
1647 | new_draw_info_format (NDI_UNIQUE, 0, op, "You have no %s left.", &bow->race); |
1588 | new_draw_info_format (NDI_UNIQUE, 0, op, "You have no %s left.", &bow->race); |
1648 | /* FLAG_READY_BOW will get reset if the monsters picks up some arrows */ |
1589 | /* FLAG_READY_BOW will get reset if the monsters picks up some arrows */ |
1649 | else |
1590 | else |
1650 | CLEAR_FLAG (op, FLAG_READY_BOW); |
1591 | CLEAR_FLAG (op, FLAG_READY_BOW); |
|
|
1592 | |
1651 | return 0; |
1593 | return 0; |
1652 | } |
1594 | } |
1653 | } |
1595 | } |
1654 | |
1596 | |
1655 | mflags = get_map_flags (op->map, &m, sx, sy, &sx, &sy); |
1597 | mflags = get_map_flags (op->map, &m, sx, sy, &sx, &sy); |
… | |
… | |
1677 | return 0; |
1619 | return 0; |
1678 | } |
1620 | } |
1679 | |
1621 | |
1680 | arrow->set_owner (op); |
1622 | arrow->set_owner (op); |
1681 | arrow->skill = bow->skill; |
1623 | arrow->skill = bow->skill; |
1682 | |
|
|
1683 | arrow->direction = dir; |
1624 | arrow->direction = dir; |
1684 | arrow->x = sx; |
1625 | |
1685 | arrow->y = sy; |
1626 | arrow->stats.sp = arrow->stats.wc; /* save original wc, dam, attacktype and slaying */ |
|
|
1627 | arrow->stats.hp = arrow->stats.dam; |
|
|
1628 | arrow->stats.grace = arrow->attacktype; |
|
|
1629 | |
|
|
1630 | if (arrow->slaying) |
|
|
1631 | arrow->spellarg = strdup (arrow->slaying); |
|
|
1632 | |
|
|
1633 | #if 0 |
|
|
1634 | if (player *pl = op->contr) |
|
|
1635 | { |
|
|
1636 | float speed = pl->weapon_sp; |
|
|
1637 | |
|
|
1638 | /* penalize ROF for bestarrow */ |
|
|
1639 | if (pl->bowtype == bow_bestarrow) |
|
|
1640 | speed *= .9f; |
|
|
1641 | else |
|
|
1642 | speed *= 1.f + dex_bonus[op->stats.Dex] * .2f; |
|
|
1643 | |
|
|
1644 | op->speed_left += speed - op->speed; |
|
|
1645 | } |
|
|
1646 | #endif |
|
|
1647 | |
|
|
1648 | SET_ANIMATION (arrow, arrow->direction); |
|
|
1649 | |
|
|
1650 | /* update the speed */ |
|
|
1651 | arrow->speed = ((bow->flag [FLAG_NO_STRENGTH] ? 0 : dam_bonus[op->stats.Str]) + bow->magic + arrow->magic) / 5.f |
|
|
1652 | + bow->stats.dam / 7.f; |
|
|
1653 | |
|
|
1654 | arrow->set_speed (max (arrow->speed, 2.f)); |
|
|
1655 | arrow->speed_left = 0; |
|
|
1656 | |
|
|
1657 | int wc = op->stats.wc + wc_mod - arrow->magic - arrow->stats.wc; |
1686 | |
1658 | |
1687 | if (op->type == PLAYER) |
1659 | if (op->type == PLAYER) |
1688 | { |
1660 | { |
1689 | op->speed_left = 0.01 - (float) FABS (op->speed) * 100 / bowspeed; |
|
|
1690 | op->update_stats (); |
|
|
1691 | } |
|
|
1692 | |
|
|
1693 | SET_ANIMATION (arrow, arrow->direction); |
|
|
1694 | arrow->stats.sp = arrow->stats.wc; /* save original wc and dam */ |
|
|
1695 | arrow->stats.hp = arrow->stats.dam; |
|
|
1696 | arrow->stats.grace = arrow->attacktype; |
|
|
1697 | if (arrow->slaying != NULL) |
|
|
1698 | arrow->spellarg = strdup (arrow->slaying); |
|
|
1699 | |
|
|
1700 | /* Note that this was different for monsters - they got their level |
|
|
1701 | * added to the damage. I think the strength bonus is more proper. |
|
|
1702 | */ |
|
|
1703 | |
|
|
1704 | arrow->stats.dam += (QUERY_FLAG (bow, FLAG_NO_STRENGTH) ? 0 : dam_bonus[op->stats.Str]) + bow->stats.dam + bow->magic + arrow->magic; |
|
|
1705 | |
|
|
1706 | /* update the speed */ |
|
|
1707 | arrow->speed = (float) ((QUERY_FLAG (bow, FLAG_NO_STRENGTH) ? |
|
|
1708 | 0 : dam_bonus[op->stats.Str]) + bow->magic + arrow->magic) / 5.0 + (float) bow->stats.dam / 7.0; |
|
|
1709 | |
|
|
1710 | if (arrow->speed < 1.0) |
|
|
1711 | arrow->speed = 1.0; |
|
|
1712 | update_ob_speed (arrow); |
|
|
1713 | arrow->speed_left = 0; |
|
|
1714 | |
|
|
1715 | if (op->type == PLAYER) |
|
|
1716 | { |
|
|
1717 | arrow->stats.wc = 20 - bow->magic - arrow->magic - |
|
|
1718 | (op->chosen_skill ? op->chosen_skill->level : op->level) - |
|
|
1719 | dex_bonus[op->stats.Dex] - thaco_bonus[op->stats.Str] - arrow->stats.wc - bow->stats.wc + wc_mod; |
|
|
1720 | |
|
|
1721 | arrow->level = op->chosen_skill ? op->chosen_skill->level : op->level; |
1661 | arrow->level = op->chosen_skill ? op->chosen_skill->level : op->level; |
|
|
1662 | wc -= dex_bonus[op->stats.Dex]; |
|
|
1663 | |
|
|
1664 | if (!arrow->slaying) |
|
|
1665 | arrow->slaying = op->slaying; |
|
|
1666 | |
|
|
1667 | arrow->attacktype |= op->attacktype; |
1722 | } |
1668 | } |
1723 | else |
1669 | else |
1724 | { |
1670 | { |
1725 | arrow->stats.wc = op->stats.wc - bow->magic - arrow->magic - arrow->stats.wc + wc_mod; |
|
|
1726 | arrow->level = op->level; |
1671 | arrow->level = op->level; |
1727 | } |
1672 | arrow->stats.wc -= bow->magic; |
1728 | |
1673 | |
1729 | if (arrow->attacktype == AT_PHYSICAL) |
1674 | if (!arrow->slaying) |
|
|
1675 | arrow->slaying = bow->slaying; |
|
|
1676 | |
1730 | arrow->attacktype |= bow->attacktype; |
1677 | arrow->attacktype |= bow->attacktype; |
|
|
1678 | } |
1731 | |
1679 | |
1732 | if (bow->slaying) |
1680 | wc -= arrow->level; |
1733 | arrow->slaying = bow->slaying; |
1681 | arrow->stats.dam = clamp (arrow->stats.dam + op->stats.dam + arrow->magic, MIN_DAM, MAX_DAM); |
1734 | |
1682 | |
1735 | arrow->map = m; |
1683 | arrow->stats.wc = clamp (wc, MIN_WC, MAX_WC); |
1736 | arrow->move_type = MOVE_FLY_LOW; |
1684 | arrow->move_type = MOVE_FLY_LOW; |
1737 | arrow->move_on = MOVE_FLY_LOW | MOVE_WALK; |
1685 | arrow->move_on = MOVE_FLY_LOW | MOVE_WALK; |
1738 | |
1686 | |
1739 | play_sound_map (op->map, op->x, op->y, SOUND_FIRE_ARROW); |
1687 | play_sound_map (op->map, op->x, op->y, SOUND_FIRE_ARROW); |
1740 | insert_ob_in_map (arrow, m, op, 0); |
1688 | m->insert (arrow, sx, sy, op); |
1741 | |
1689 | |
1742 | if (!arrow->destroyed ()) |
1690 | if (!arrow->destroyed ()) |
1743 | move_arrow (arrow); |
1691 | move_arrow (arrow); |
1744 | |
1692 | |
1745 | if (op->type == PLAYER) |
1693 | if (op->type == PLAYER) |
… | |
… | |
1765 | { |
1713 | { |
1766 | int ret = 0, wcmod = 0; |
1714 | int ret = 0, wcmod = 0; |
1767 | |
1715 | |
1768 | if (op->contr->bowtype == bow_bestarrow) |
1716 | if (op->contr->bowtype == bow_bestarrow) |
1769 | { |
1717 | { |
1770 | ret = fire_bow (op, op, pick_arrow_target (op, op->contr->ranges[range_bow]->race, dir), dir, 0, op->x, op->y); |
1718 | ret = fire_bow (op, op, pick_arrow_target (op, op->contr->ranged_ob->race, dir), dir, 0, op->x, op->y); |
1771 | } |
1719 | } |
1772 | else if (op->contr->bowtype >= bow_n && op->contr->bowtype <= bow_nw) |
1720 | else if (op->contr->bowtype >= bow_n && op->contr->bowtype <= bow_nw) |
1773 | { |
1721 | { |
1774 | if (!similar_direction (dir, op->contr->bowtype - bow_n + 1)) |
1722 | if (!similar_direction (dir, op->contr->bowtype - bow_n + 1)) |
1775 | wcmod = -1; |
1723 | wcmod = -1; |
|
|
1724 | |
1776 | ret = fire_bow (op, op, NULL, op->contr->bowtype - bow_n + 1, wcmod, op->x, op->y); |
1725 | ret = fire_bow (op, op, NULL, op->contr->bowtype - bow_n + 1, wcmod, op->x, op->y); |
1777 | } |
1726 | } |
1778 | else if (op->contr->bowtype == bow_threewide) |
1727 | else if (op->contr->bowtype == bow_threewide) |
1779 | { |
1728 | { |
1780 | ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1729 | ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
… | |
… | |
1784 | else if (op->contr->bowtype == bow_spreadshot) |
1733 | else if (op->contr->bowtype == bow_spreadshot) |
1785 | { |
1734 | { |
1786 | ret |= fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1735 | ret |= fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1787 | ret |= fire_bow (op, op, NULL, absdir (dir - 1), -5, op->x, op->y); |
1736 | ret |= fire_bow (op, op, NULL, absdir (dir - 1), -5, op->x, op->y); |
1788 | ret |= fire_bow (op, op, NULL, absdir (dir + 1), -5, op->x, op->y); |
1737 | ret |= fire_bow (op, op, NULL, absdir (dir + 1), -5, op->x, op->y); |
1789 | |
|
|
1790 | } |
1738 | } |
1791 | else |
1739 | else |
1792 | { |
1740 | { |
1793 | /* Simple case */ |
1741 | /* Simple case */ |
1794 | ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1742 | ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1795 | } |
1743 | } |
|
|
1744 | |
1796 | return ret; |
1745 | return ret; |
1797 | } |
1746 | } |
1798 | |
|
|
1799 | |
1747 | |
1800 | /* Fires a misc (wand/rod/horn) object in 'dir'. |
1748 | /* Fires a misc (wand/rod/horn) object in 'dir'. |
1801 | * Broken apart from 'fire' to keep it more readable. |
1749 | * Broken apart from 'fire' to keep it more readable. |
1802 | */ |
1750 | */ |
1803 | void |
1751 | void |
1804 | fire_misc_object (object *op, int dir) |
1752 | fire_misc_object (object *op, int dir) |
1805 | { |
1753 | { |
1806 | object *item; |
1754 | object *item = op->contr->ranged_ob; |
1807 | |
1755 | |
1808 | if (!op->contr->ranges[range_misc]) |
1756 | if (!item) |
1809 | { |
1757 | { |
1810 | new_draw_info (NDI_UNIQUE, 0, op, "You have range item readied."); |
1758 | new_draw_info (NDI_UNIQUE, 0, op, "You have range item readied."); |
1811 | return; |
1759 | return; |
1812 | } |
1760 | } |
1813 | |
1761 | |
1814 | item = op->contr->ranges[range_misc]; |
|
|
1815 | if (!item->inv) |
1762 | if (!item->inv) |
1816 | { |
1763 | { |
1817 | LOG (llevError, "Object %s lacks a spell\n", &item->name); |
1764 | LOG (llevError, "Object %s lacks a spell\n", &item->name); |
1818 | return; |
1765 | return; |
1819 | } |
1766 | } |
|
|
1767 | |
|
|
1768 | if (!op->change_weapon (item)) |
|
|
1769 | return; |
|
|
1770 | |
1820 | if (item->type == WAND) |
1771 | if (item->type == WAND) |
1821 | { |
1772 | { |
1822 | if (item->stats.food <= 0) |
1773 | if (item->stats.food <= 0) |
1823 | { |
1774 | { |
1824 | play_sound_player_only (op->contr, SOUND_WAND_POOF, 0, 0); |
1775 | play_sound_player_only (op->contr, SOUND_WAND_POOF, 0, 0); |
1825 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s goes poof.", query_base_name (item, 0)); |
1776 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s goes poof.", query_base_name (item, 0)); |
|
|
1777 | |
1826 | return; |
1778 | return; |
1827 | } |
1779 | } |
1828 | } |
1780 | } |
1829 | else if (item->type == ROD || item->type == HORN) |
1781 | else if (item->type == ROD || item->type == HORN) |
1830 | { |
1782 | { |
1831 | if (item->stats.hp < MAX (item->inv->stats.sp, item->inv->stats.grace)) |
1783 | if (item->stats.hp < MAX (item->inv->stats.sp, item->inv->stats.grace)) |
1832 | { |
1784 | { |
1833 | play_sound_player_only (op->contr, SOUND_WAND_POOF, 0, 0); |
1785 | play_sound_player_only (op->contr, SOUND_WAND_POOF, 0, 0); |
|
|
1786 | |
1834 | if (item->type == ROD) |
1787 | if (item->type == ROD) |
1835 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s whines for a while, but nothing happens.", query_base_name (item, 0)); |
1788 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s whines for a while, but nothing happens.", query_base_name (item, 0)); |
1836 | else |
1789 | else |
1837 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s needs more time to charge.", query_base_name (item, 0)); |
1790 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s needs more time to charge.", query_base_name (item, 0)); |
|
|
1791 | |
1838 | return; |
1792 | return; |
1839 | } |
1793 | } |
1840 | } |
1794 | } |
1841 | |
1795 | |
1842 | if (cast_spell (op, item, dir, item->inv, NULL)) |
1796 | if (cast_spell (op, item, dir, item->inv, NULL)) |
… | |
… | |
1849 | object *tmp; |
1803 | object *tmp; |
1850 | |
1804 | |
1851 | if (item->arch) |
1805 | if (item->arch) |
1852 | { |
1806 | { |
1853 | CLEAR_FLAG (item, FLAG_ANIMATE); |
1807 | CLEAR_FLAG (item, FLAG_ANIMATE); |
1854 | item->face = item->arch->clone.face; |
1808 | item->face = item->arch->face; |
1855 | item->speed = 0; |
1809 | item->set_speed (0); |
1856 | update_ob_speed (item); |
|
|
1857 | } |
1810 | } |
|
|
1811 | |
1858 | if ((tmp = item->in_player ())) |
1812 | if ((tmp = item->in_player ())) |
1859 | esrv_update_item (UPD_ANIM, tmp, item); |
1813 | esrv_update_item (UPD_ANIM, tmp, item); |
1860 | } |
1814 | } |
1861 | } |
1815 | } |
1862 | else if (item->type == ROD || item->type == HORN) |
1816 | else if (item->type == ROD || item->type == HORN) |
1863 | { |
|
|
1864 | drain_rod_charge (item); |
1817 | drain_rod_charge (item); |
1865 | } |
|
|
1866 | } |
1818 | } |
1867 | } |
1819 | } |
1868 | |
1820 | |
1869 | /* Received a fire command for the player - go and do it. |
1821 | /* Received a fire command for the player - go and do it. |
1870 | */ |
1822 | */ |
1871 | void |
1823 | bool |
1872 | fire (object *op, int dir) |
1824 | fire (object *op, int dir) |
1873 | { |
1825 | { |
1874 | int spellcost = 0; |
1826 | int spellcost = 0; |
1875 | |
1827 | |
1876 | /* check for loss of invisiblity/hide */ |
1828 | /* check for loss of invisiblity/hide */ |
1877 | if (action_makes_visible (op)) |
1829 | if (action_makes_visible (op)) |
1878 | make_visible (op); |
1830 | make_visible (op); |
1879 | |
1831 | |
1880 | switch (op->contr->shoottype) |
1832 | player *pl = op->contr; |
|
|
1833 | |
|
|
1834 | if (pl->golem) |
|
|
1835 | { |
|
|
1836 | control_golem (op->contr->golem, dir); |
|
|
1837 | return false; |
1881 | { |
1838 | } |
1882 | case range_none: |
|
|
1883 | return; |
|
|
1884 | |
1839 | |
1885 | case range_bow: |
1840 | object *ob = pl->ranged_ob; |
|
|
1841 | |
|
|
1842 | if (!ob) |
|
|
1843 | return false; |
|
|
1844 | |
|
|
1845 | if (!op->change_weapon (ob)) |
|
|
1846 | return false; |
|
|
1847 | |
|
|
1848 | if (op->speed_left > 0.f) |
|
|
1849 | --op->speed_left; |
|
|
1850 | else |
|
|
1851 | return false; |
|
|
1852 | |
|
|
1853 | switch (ob->type) |
|
|
1854 | { |
|
|
1855 | case BOW: |
1886 | player_fire_bow (op, dir); |
1856 | player_fire_bow (op, dir); |
1887 | return; |
1857 | break; |
1888 | |
1858 | |
1889 | case range_magic: /* Casting spells */ |
1859 | case SPELL: |
1890 | spellcost = (cast_spell (op, op, dir, op->contr->ranges[range_magic], op->contr->spellparam[0] ? op->contr->spellparam : 0)); |
1860 | spellcost = cast_spell (op, op, dir, ob, pl->spellparam[0] ? pl->spellparam : 0); |
1891 | return; |
1861 | break; |
1892 | |
1862 | |
1893 | case range_misc: |
1863 | case BUILDER: |
|
|
1864 | apply_map_builder (op, dir); |
|
|
1865 | break; |
|
|
1866 | |
|
|
1867 | case SKILL: |
|
|
1868 | do_skill (op, op, ob, dir, 0); |
|
|
1869 | break; |
|
|
1870 | |
|
|
1871 | default: |
1894 | fire_misc_object (op, dir); |
1872 | fire_misc_object (op, dir); |
1895 | return; |
1873 | break; |
1896 | |
|
|
1897 | case range_golem: /* Control summoned monsters from scrolls */ |
|
|
1898 | if (QUERY_FLAG (op->contr->ranges[range_golem], FLAG_REMOVED)) |
|
|
1899 | { |
|
|
1900 | op->contr->ranges[range_golem] = 0; |
|
|
1901 | op->contr->shoottype = range_none; |
|
|
1902 | } |
|
|
1903 | else |
|
|
1904 | control_golem (op->contr->ranges[range_golem], dir); |
|
|
1905 | return; |
|
|
1906 | |
|
|
1907 | case range_skill: |
|
|
1908 | if (!op->chosen_skill) |
|
|
1909 | { |
|
|
1910 | if (op->type == PLAYER) |
|
|
1911 | new_draw_info (NDI_UNIQUE, 0, op, "You have no applicable skill to use."); |
|
|
1912 | return; |
|
|
1913 | } |
|
|
1914 | (void) do_skill (op, op, op->chosen_skill, dir, NULL); |
|
|
1915 | return; |
|
|
1916 | case range_builder: |
|
|
1917 | apply_map_builder (op, dir); |
|
|
1918 | return; |
|
|
1919 | default: |
|
|
1920 | new_draw_info (NDI_UNIQUE, 0, op, "Illegal shoot type."); |
|
|
1921 | return; |
|
|
1922 | } |
1874 | } |
1923 | } |
|
|
1924 | |
1875 | |
1925 | |
1876 | return true; |
|
|
1877 | } |
1926 | |
1878 | |
1927 | /* find_key |
1879 | /* find_key |
1928 | * We try to find a key for the door as passed. If we find a key |
1880 | * We try to find a key for the door as passed. If we find a key |
1929 | * and successfully use it, we return the key, otherwise NULL |
1881 | * and successfully use it, we return the key, otherwise NULL |
1930 | * This function merges both normal and locked door, since the logic |
1882 | * This function merges both normal and locked door, since the logic |
… | |
… | |
1932 | * pl is the player, |
1884 | * pl is the player, |
1933 | * inv is the objects inventory to searched |
1885 | * inv is the objects inventory to searched |
1934 | * door is the door we are trying to match against. |
1886 | * door is the door we are trying to match against. |
1935 | * This function can be called recursively to search containers. |
1887 | * This function can be called recursively to search containers. |
1936 | */ |
1888 | */ |
1937 | |
|
|
1938 | object * |
1889 | object * |
1939 | find_key (object *pl, object *container, object *door) |
1890 | find_key (object *pl, object *container, object *door) |
1940 | { |
1891 | { |
1941 | object *tmp, *key; |
1892 | object *tmp, *key; |
1942 | |
1893 | |
1943 | /* Should not happen, but sanity checking is never bad */ |
1894 | /* Should not happen, but sanity checking is never bad */ |
1944 | if (container->inv == NULL) |
1895 | if (!container->inv) |
1945 | return NULL; |
1896 | return 0; |
1946 | |
1897 | |
1947 | /* First, lets try to find a key in the top level inventory */ |
1898 | /* First, lets try to find a key in the top level inventory */ |
1948 | for (tmp = container->inv; tmp != NULL; tmp = tmp->below) |
1899 | for (tmp = container->inv; tmp; tmp = tmp->below) |
1949 | { |
1900 | { |
1950 | if (door->type == DOOR && tmp->type == KEY) |
1901 | if (door->type == DOOR && tmp->type == KEY) |
1951 | break; |
1902 | break; |
1952 | /* For sanity, we should really check door type, but other stuff |
1903 | /* For sanity, we should really check door type, but other stuff |
1953 | * (like containers) can be locked with special keys |
1904 | * (like containers) can be locked with special keys |
1954 | */ |
1905 | */ |
1955 | if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying) |
1906 | if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying) |
1956 | break; |
1907 | break; |
1957 | } |
1908 | } |
|
|
1909 | |
1958 | /* No key found - lets search inventories now */ |
1910 | /* No key found - lets search inventories now */ |
1959 | /* If we find and use a key in an inventory, return at that time. |
1911 | /* If we find and use a key in an inventory, return at that time. |
1960 | * otherwise, if we search all the inventories and still don't find |
1912 | * otherwise, if we search all the inventories and still don't find |
1961 | * a key, return |
1913 | * a key, return |
1962 | */ |
1914 | */ |
1963 | if (!tmp) |
1915 | if (!tmp) |
1964 | { |
1916 | { |
1965 | for (tmp = container->inv; tmp != NULL; tmp = tmp->below) |
1917 | for (tmp = container->inv; tmp; tmp = tmp->below) |
1966 | { |
1918 | { |
1967 | /* No reason to search empty containers */ |
1919 | /* No reason to search empty containers */ |
1968 | if (tmp->type == CONTAINER && tmp->inv) |
1920 | if (tmp->type == CONTAINER && tmp->inv) |
1969 | { |
1921 | { |
1970 | if ((key = find_key (pl, tmp, door)) != NULL) |
1922 | if ((key = find_key (pl, tmp, door))) |
1971 | return key; |
1923 | return key; |
1972 | } |
1924 | } |
1973 | } |
1925 | } |
|
|
1926 | |
1974 | if (!tmp) |
1927 | if (!tmp) |
1975 | return NULL; |
1928 | return NULL; |
1976 | } |
1929 | } |
|
|
1930 | |
1977 | /* We get down here if we have found a key. Now if its in a container, |
1931 | /* We get down here if we have found a key. Now if its in a container, |
1978 | * see if we actually want to use it |
1932 | * see if we actually want to use it |
1979 | */ |
1933 | */ |
1980 | if (pl != container) |
1934 | if (pl != container) |
1981 | { |
1935 | { |
… | |
… | |
2002 | new_draw_info_format (NDI_UNIQUE | NDI_BROWN, 0, pl, |
1956 | new_draw_info_format (NDI_UNIQUE | NDI_BROWN, 0, pl, |
2003 | "The %s in your %s vibrates as you approach the door", query_name (tmp), query_name (container)); |
1957 | "The %s in your %s vibrates as you approach the door", query_name (tmp), query_name (container)); |
2004 | return NULL; |
1958 | return NULL; |
2005 | } |
1959 | } |
2006 | } |
1960 | } |
|
|
1961 | |
2007 | return tmp; |
1962 | return tmp; |
2008 | } |
1963 | } |
2009 | |
1964 | |
2010 | /* moved door processing out of move_player_attack. |
1965 | /* moved door processing out of move_player_attack. |
2011 | * returns 1 if player has opened the door with a key |
1966 | * returns 1 if player has opened the door with a key |
… | |
… | |
2013 | * 0 otherwise |
1968 | * 0 otherwise |
2014 | */ |
1969 | */ |
2015 | static int |
1970 | static int |
2016 | player_attack_door (object *op, object *door) |
1971 | player_attack_door (object *op, object *door) |
2017 | { |
1972 | { |
2018 | /* If its a door, try to find a use a key. If we do destroy the door, |
1973 | /* If its a door, try to find a key. If we do destroy the door, |
2019 | * might as well return immediately as there is nothing more to do - |
1974 | * might as well return immediately as there is nothing more to do - |
2020 | * otherwise, we fall through to the rest of the code. |
1975 | * otherwise, we fall through to the rest of the code. |
2021 | */ |
1976 | */ |
2022 | object *key = find_key (op, op, door); |
1977 | object *key = find_key (op, op, door); |
2023 | |
1978 | |
2024 | /* IF we found a key, do some extra work */ |
1979 | /* If we found a key, do some extra work */ |
2025 | if (key) |
1980 | if (key) |
2026 | { |
1981 | { |
2027 | object *container = key->env; |
1982 | object *container = key->env; |
2028 | |
1983 | |
2029 | play_sound_map (op->map, op->x, op->y, SOUND_OPEN_DOOR); |
1984 | play_sound_map (op->map, op->x, op->y, SOUND_OPEN_DOOR); |
|
|
1985 | |
2030 | if (action_makes_visible (op)) |
1986 | if (action_makes_visible (op)) |
2031 | make_visible (op); |
1987 | make_visible (op); |
|
|
1988 | |
2032 | if (door->inv && (door->inv->type == RUNE || door->inv->type == TRAP)) |
1989 | if (door->inv && (door->inv->type == RUNE || door->inv->type == TRAP)) |
2033 | spring_trap (door->inv, op); |
1990 | spring_trap (door->inv, op); |
|
|
1991 | |
2034 | if (door->type == DOOR) |
1992 | if (door->type == DOOR) |
2035 | { |
|
|
2036 | hit_player (door, 9998, op, AT_PHYSICAL, 1); /* Break through the door */ |
1993 | hit_player (door, 9998, op, AT_PHYSICAL, 1); /* Break through the door */ |
2037 | } |
|
|
2038 | else if (door->type == LOCKED_DOOR) |
1994 | else if (door->type == LOCKED_DOOR) |
2039 | { |
1995 | { |
2040 | new_draw_info_format (NDI_UNIQUE, NDI_BROWN, op, "You open the door with the %s", query_short_name (key)); |
1996 | new_draw_info_format (NDI_UNIQUE, NDI_BROWN, op, "You open the door with the %s", query_short_name (key)); |
2041 | remove_door2 (door); /* remove door without violence ;-) */ |
1997 | remove_door2 (door); /* remove door without violence ;-) */ |
2042 | } |
1998 | } |
|
|
1999 | |
2043 | /* Do this after we print the message */ |
2000 | /* Do this after we print the message */ |
2044 | decrease_ob (key); /* Use up one of the keys */ |
2001 | decrease_ob (key); /* Use up one of the keys */ |
2045 | /* Need to update the weight the container the key was in */ |
2002 | /* Need to update the weight the container the key was in */ |
2046 | if (container != op) |
2003 | if (container != op) |
2047 | esrv_update_item (UPD_WEIGHT, op, container); |
2004 | esrv_update_item (UPD_WEIGHT, op, container); |
|
|
2005 | |
2048 | return 1; /* Nothing more to do below */ |
2006 | return 1; /* Nothing more to do below */ |
2049 | } |
2007 | } |
2050 | else if (door->type == LOCKED_DOOR) |
2008 | else if (door->type == LOCKED_DOOR) |
2051 | { |
2009 | { |
2052 | /* Might as well return now - no other way to open this */ |
2010 | /* Might as well return now - no other way to open this */ |
2053 | new_draw_info (NDI_UNIQUE | NDI_NAVY, 0, op, door->msg); |
2011 | new_draw_info (NDI_UNIQUE | NDI_NAVY, 0, op, door->msg); |
2054 | return 1; |
2012 | return 1; |
2055 | } |
2013 | } |
|
|
2014 | |
2056 | return 0; |
2015 | return 0; |
2057 | } |
2016 | } |
2058 | |
2017 | |
2059 | /* This function is just part of a breakup from move_player. |
2018 | /* This function is just part of a breakup from move_player. |
2060 | * It should keep the code cleaner. |
2019 | * It should keep the code cleaner. |
2061 | * When this is called, the players direction has been updated |
2020 | * When this is called, the players direction has been updated |
2062 | * (taking into account confusion.) The player is also actually |
2021 | * (taking into account confusion.) The player is also actually |
2063 | * going to try and move (not fire weapons). |
2022 | * going to try and move (not fire weapons). |
2064 | */ |
2023 | */ |
2065 | void |
2024 | bool |
2066 | move_player_attack (object *op, int dir) |
2025 | move_player_attack (object *op, int dir) |
2067 | { |
2026 | { |
2068 | object *tmp, *mon; |
|
|
2069 | sint16 nx, ny; |
|
|
2070 | int on_battleground; |
2027 | int on_battleground; |
2071 | maptile *m; |
|
|
2072 | |
2028 | |
2073 | nx = freearr_x[dir] + op->x; |
2029 | sint16 nx = freearr_x[dir] + op->x; |
2074 | ny = freearr_y[dir] + op->y; |
2030 | sint16 ny = freearr_y[dir] + op->y; |
2075 | |
2031 | |
2076 | on_battleground = op_on_battleground (op, 0, 0); |
2032 | on_battleground = op_on_battleground (op, 0, 0); |
|
|
2033 | |
|
|
2034 | if (out_of_map (op->map, nx, ny)) |
|
|
2035 | return false; |
|
|
2036 | |
|
|
2037 | if (!op->contr->braced && op->speed_left > 0.f && move_ob (op, dir, op)) |
|
|
2038 | { |
|
|
2039 | --op->speed_left; |
|
|
2040 | return true; |
|
|
2041 | } |
2077 | |
2042 | |
2078 | /* If braced, or can't move to the square, and it is not out of the |
2043 | /* If braced, or can't move to the square, and it is not out of the |
2079 | * map, attack it. Note order of if statement is important - don't |
2044 | * map, attack it. Note order of if statement is important - don't |
2080 | * want to be calling move_ob if braced, because move_ob will move the |
2045 | * want to be calling move_ob if braced, because move_ob will move the |
2081 | * player. This is a pretty nasty hack, because if we could |
2046 | * player. This is a pretty nasty hack, because if we could |
2082 | * move to some space, it then means that if we are braced, we should |
2047 | * move to some space, it then means that if we are braced, we should |
2083 | * do nothing at all. As it is, if we are braced, we go through |
2048 | * do nothing at all. As it is, if we are braced, we go through |
2084 | * quite a bit of processing. However, it probably is less than what |
2049 | * quite a bit of processing. However, it probably is less than what |
2085 | * move_ob uses. |
2050 | * move_ob uses. |
2086 | */ |
2051 | */ |
2087 | if ((op->contr->braced || !move_ob (op, dir, op)) && !out_of_map (op->map, nx, ny)) |
2052 | maptile *m = op->map->xy_find (nx, ny); |
2088 | { |
|
|
2089 | if (OUT_OF_REAL_MAP (op->map, nx, ny)) |
|
|
2090 | { |
|
|
2091 | m = get_map_from_coord (op->map, &nx, &ny); |
|
|
2092 | if (!m) |
|
|
2093 | return; /* Don't think this should happen */ |
|
|
2094 | } |
|
|
2095 | else |
|
|
2096 | m = op->map; |
|
|
2097 | |
2053 | |
2098 | if ((tmp = GET_MAP_OB (m, nx, ny)) == NULL) |
|
|
2099 | { |
|
|
2100 | /* LOG(llevError,"player_move_attack: GET_MAP_OB returns NULL, but player can not move there.\n"); */ |
|
|
2101 | return; |
|
|
2102 | } |
|
|
2103 | |
|
|
2104 | mon = 0; |
|
|
2105 | /* Go through all the objects, and find ones of interest. Only stop if |
2054 | /* Go through all the objects, and find ones of interest. Only stop if |
2106 | * we find a monster - that is something we know we want to attack. |
2055 | * we find a monster - that is something we know we want to attack. |
2107 | * if its a door or barrel (can roll) see if there may be monsters |
2056 | * if its a door or barrel (can roll) see if there may be monsters |
2108 | * on the space |
2057 | * on the space |
2109 | */ |
2058 | */ |
2110 | while (tmp) |
2059 | object *mon; |
2111 | { |
2060 | for (mon = m->at (nx, ny).bot; mon; mon = mon->above) |
2112 | if (tmp == op) |
2061 | { |
2113 | { |
2062 | if ((mon->flag [FLAG_ALIVE] |
2114 | tmp = tmp->above; |
2063 | || mon->type == LOCKED_DOOR |
2115 | continue; |
2064 | || mon->flag [FLAG_CAN_ROLL]) |
2116 | } |
|
|
2117 | |
|
|
2118 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) |
|
|
2119 | { |
|
|
2120 | mon = tmp; |
2065 | && mon != op) |
2121 | break; |
2066 | break; |
2122 | } |
2067 | } |
2123 | |
2068 | |
2124 | if (tmp->type == LOCKED_DOOR || QUERY_FLAG (tmp, FLAG_CAN_ROLL)) |
|
|
2125 | mon = tmp; |
|
|
2126 | |
|
|
2127 | tmp = tmp->above; |
|
|
2128 | } |
|
|
2129 | |
|
|
2130 | if (!mon) /* This happens anytime the player tries to move */ |
2069 | if (!mon) /* This happens anytime the player tries to move */ |
2131 | return; /* into a wall */ |
2070 | return false; /* into a wall */ |
2132 | |
2071 | |
2133 | if (mon->head) |
|
|
2134 | mon = mon->head; |
2072 | mon = mon->head_ (); |
2135 | |
2073 | |
2136 | if ((mon->type == DOOR && mon->stats.hp >= 0) || (mon->type == LOCKED_DOOR)) |
2074 | if ((mon->type == DOOR && mon->stats.hp >= 0) || (mon->type == LOCKED_DOOR)) |
|
|
2075 | if (op->contr->weapon_sp_left > 0.f) |
2137 | if (player_attack_door (op, mon)) |
2076 | if (player_attack_door (op, mon)) |
|
|
2077 | { |
|
|
2078 | --op->contr->weapon_sp_left; |
2138 | return; |
2079 | return true; |
|
|
2080 | } |
2139 | |
2081 | |
2140 | /* The following deals with possibly attacking peaceful |
2082 | /* The following deals with possibly attacking peaceful |
2141 | * or frienddly creatures. Basically, all players are considered |
2083 | * or friendly creatures. Basically, all players are considered |
2142 | * unaggressive. If the moving player has peaceful set, then the |
2084 | * unaggressive. If the moving player has peaceful set, then the |
2143 | * object should be pushed instead of attacked. It is assumed that |
2085 | * object should be pushed instead of attacked. It is assumed that |
2144 | * if you are braced, you will not attack friends accidently, |
2086 | * if you are braced, you will not attack friends accidently, |
2145 | * and thus will not push them. |
2087 | * and thus will not push them. |
2146 | */ |
2088 | */ |
2147 | |
2089 | |
2148 | /* If the creature is a pet, push it even if the player is not |
2090 | /* If the creature is a pet, push it even if the player is not |
2149 | * peaceful. Our assumption is the creature is a pet if the |
2091 | * peaceful. Our assumption is the creature is a pet if the |
2150 | * player owns it and it is either friendly or unagressive. |
2092 | * player owns it and it is either friendly or unagressive. |
2151 | */ |
2093 | */ |
2152 | if ((op->type == PLAYER) |
2094 | if (op->type == PLAYER |
2153 | #if COZY_SERVER |
|
|
2154 | && |
|
|
2155 | ((mon->owner && mon->owner->contr |
2095 | && ((mon->owner && mon->owner->contr |
2156 | && same_party (mon->owner->contr->party, op->contr->party)) || mon->owner == op) |
2096 | && same_party (mon->owner->contr->party, op->contr->party)) |
2157 | #else |
|
|
2158 | && mon->owner == op |
2097 | || mon->owner == op) |
2159 | #endif |
|
|
2160 | && (QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) || QUERY_FLAG (mon, FLAG_FRIENDLY))) |
2098 | && (QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) || QUERY_FLAG (mon, FLAG_FRIENDLY))) |
2161 | { |
2099 | { |
2162 | /* If we're braced, we don't want to switch places with it */ |
2100 | /* If we're braced, we don't want to switch places with it */ |
2163 | if (op->contr->braced) |
2101 | if (op->contr->braced) |
2164 | return; |
2102 | return false; |
|
|
2103 | |
|
|
2104 | if (op->speed_left > 0.f) |
|
|
2105 | { |
|
|
2106 | --op->speed_left; |
|
|
2107 | |
2165 | play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER); |
2108 | play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER); |
2166 | (void) push_ob (mon, dir, op); |
2109 | push_ob (mon, dir, op); |
|
|
2110 | |
2167 | if (op->contr->tmp_invis || op->hide) |
2111 | if (op->contr->tmp_invis || op->hide) |
2168 | make_visible (op); |
2112 | make_visible (op); |
|
|
2113 | |
2169 | return; |
2114 | return true; |
2170 | } |
2115 | } |
|
|
2116 | else |
|
|
2117 | return false; |
|
|
2118 | } |
2171 | |
2119 | |
2172 | /* in certain circumstances, you shouldn't attack friendly |
2120 | /* in certain circumstances, you shouldn't attack friendly |
2173 | * creatures. Note that if you are braced, you can't push |
2121 | * creatures. Note that if you are braced, you can't push |
2174 | * someone, but put it inside this loop so that you won't |
2122 | * someone, but put it inside this loop so that you won't |
2175 | * attack them either. |
2123 | * attack them either. |
2176 | */ |
2124 | */ |
2177 | if ((mon->type == PLAYER || mon->enemy != op) && |
2125 | if ((mon->type == PLAYER || mon->enemy != op) |
2178 | (mon->type == PLAYER || QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) || QUERY_FLAG (mon, FLAG_FRIENDLY)) && ( |
2126 | && (mon->type == PLAYER || QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) || QUERY_FLAG (mon, FLAG_FRIENDLY)) |
2179 | #ifdef PROHIBIT_PLAYERKILL |
|
|
2180 | (op->contr->peaceful |
2127 | && ((op->contr->peaceful |
2181 | || (mon->type == PLAYER |
2128 | || (mon->type == PLAYER && mon->contr->peaceful)) |
2182 | && mon->contr-> |
|
|
2183 | peaceful)) && |
|
|
2184 | #else |
|
|
2185 | op->contr->peaceful && |
|
|
2186 | #endif |
|
|
2187 | !on_battleground)) |
2129 | && !on_battleground)) |
|
|
2130 | { |
|
|
2131 | if (op->speed_left > 0.f) |
2188 | { |
2132 | { |
|
|
2133 | --op->speed_left; |
|
|
2134 | |
2189 | if (!op->contr->braced) |
2135 | if (!op->contr->braced) |
2190 | { |
2136 | { |
2191 | play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER); |
2137 | play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER); |
2192 | (void) push_ob (mon, dir, op); |
2138 | push_ob (mon, dir, op); |
2193 | } |
2139 | } |
2194 | else |
2140 | else |
2195 | new_draw_info (0, 0, op, "You withhold your attack"); |
2141 | new_draw_info (0, 0, op, "You withhold your attack"); |
2196 | |
2142 | |
2197 | if (op->contr->tmp_invis || op->hide) |
2143 | if (op->contr->tmp_invis || op->hide) |
2198 | make_visible (op); |
2144 | make_visible (op); |
2199 | } |
|
|
2200 | |
2145 | |
|
|
2146 | return true; |
|
|
2147 | } |
|
|
2148 | } |
2201 | /* If the object is a boulder or other rollable object, then |
2149 | /* If the object is a boulder or other rollable object, then |
2202 | * roll it if not braced. You can't roll it if you are braced. |
2150 | * roll it if not braced. You can't roll it if you are braced. |
2203 | */ |
2151 | */ |
2204 | else if (QUERY_FLAG (mon, FLAG_CAN_ROLL) && (!op->contr->braced)) |
2152 | else if (QUERY_FLAG (mon, FLAG_CAN_ROLL) && (!op->contr->braced)) |
|
|
2153 | { |
|
|
2154 | if (op->speed_left > 0.f) |
2205 | { |
2155 | { |
|
|
2156 | --op->speed_left; |
|
|
2157 | |
2206 | recursive_roll (mon, dir, op); |
2158 | recursive_roll (mon, dir, op); |
2207 | if (action_makes_visible (op)) |
2159 | if (action_makes_visible (op)) |
2208 | make_visible (op); |
2160 | make_visible (op); |
2209 | } |
|
|
2210 | |
2161 | |
|
|
2162 | return true; |
|
|
2163 | } |
|
|
2164 | } |
2211 | /* Any generic living creature. Including things like doors. |
2165 | /* Any generic living creature. Including things like doors. |
2212 | * Way it works is like this: First, it must have some hit points |
2166 | * Way it works is like this: First, it must have some hit points |
2213 | * and be living. Then, it must be one of the following: |
2167 | * and be living. Then, it must be one of the following: |
2214 | * 1) Not a player, 2) A player, but of a different party. Note |
2168 | * 1) Not a player, 2) A player, but of a different party. Note |
2215 | * that party_number -1 is no party, so attacks can still happen. |
2169 | * that party_number -1 is no party, so attacks can still happen. |
2216 | */ |
2170 | */ |
2217 | |
|
|
2218 | else if ((mon->stats.hp >= 0) && QUERY_FLAG (mon, FLAG_ALIVE) && |
2171 | else if ((mon->stats.hp >= 0) && QUERY_FLAG (mon, FLAG_ALIVE) && |
2219 | ((mon->type != PLAYER || op->contr->party == NULL || op->contr->party != mon->contr->party))) |
2172 | ((mon->type != PLAYER || op->contr->party == NULL || op->contr->party != mon->contr->party))) |
2220 | { |
2173 | { |
2221 | |
2174 | if (op->contr->weapon_sp_left > 0.f && !op->flag [FLAG_WIZPASS]) |
2222 | /* If the player hasn't hit something this tick, and does |
|
|
2223 | * so, give them speed boost based on weapon speed. Doing |
|
|
2224 | * it here is better than process_players2, which basically |
|
|
2225 | * incurred a 1 tick offset. |
|
|
2226 | */ |
|
|
2227 | if (!op->contr->has_hit) |
|
|
2228 | { |
2175 | { |
2229 | op->speed_left += op->speed / op->contr->weapon_sp; |
2176 | --op->contr->weapon_sp_left; |
2230 | |
|
|
2231 | op->contr->has_hit = 1; /* The last action was to hit, so use weapon_sp */ |
|
|
2232 | } |
|
|
2233 | |
2177 | |
2234 | skill_attack (mon, op, 0, 0, 0); |
2178 | skill_attack (mon, op, 0, 0, 0); |
2235 | |
|
|
2236 | /* If attacking another player, that player gets automatic |
|
|
2237 | * hitback, and doesn't loose luck either. |
|
|
2238 | * Disable hitback on the battleground or if the target is |
|
|
2239 | * the wiz. |
|
|
2240 | */ |
|
|
2241 | if (mon->type == PLAYER && mon->stats.hp >= 0 && !mon->contr->has_hit && !on_battleground && !QUERY_FLAG (mon, FLAG_WIZ)) |
|
|
2242 | { |
|
|
2243 | short luck = mon->stats.luck; |
|
|
2244 | |
|
|
2245 | mon->contr->has_hit = 1; |
|
|
2246 | skill_attack (op, mon, 0, 0, 0); |
|
|
2247 | mon->stats.luck = luck; |
|
|
2248 | } |
|
|
2249 | |
2179 | |
2250 | if (action_makes_visible (op)) |
2180 | if (action_makes_visible (op)) |
2251 | make_visible (op); |
2181 | make_visible (op); |
2252 | } |
|
|
2253 | } /* if player should attack something */ |
|
|
2254 | } |
|
|
2255 | |
2182 | |
2256 | int |
2183 | return true; |
|
|
2184 | } |
|
|
2185 | } |
|
|
2186 | |
|
|
2187 | return false; |
|
|
2188 | } |
|
|
2189 | |
|
|
2190 | bool |
2257 | move_player (object *op, int dir) |
2191 | move_player (object *op, int dir) |
2258 | { |
2192 | { |
2259 | int pick; |
2193 | int pick; |
2260 | |
2194 | |
2261 | if (op->map == NULL || op->map->in_memory != MAP_IN_MEMORY) |
2195 | if (!op->map || op->map->in_memory != MAP_IN_MEMORY) |
2262 | return 0; |
2196 | return 0; |
2263 | |
2197 | |
2264 | /* Sanity check: make sure dir is valid */ |
2198 | /* Sanity check: make sure dir is valid */ |
2265 | if ((dir < 0) || (dir >= 9)) |
2199 | if ((dir < 0) || (dir >= 9)) |
2266 | { |
2200 | { |
2267 | LOG (llevError, "move_player: invalid direction %d\n", dir); |
2201 | LOG (llevError, "move_player: invalid direction %d\n", dir); |
2268 | return 0; |
2202 | return 0; |
2269 | } |
2203 | } |
2270 | |
2204 | |
2271 | /* peterm: added following line */ |
2205 | /* peterm: added following line */ |
2272 | if (QUERY_FLAG (op, FLAG_CONFUSED) && dir) |
2206 | if (QUERY_FLAG (op, FLAG_CONFUSED) && dir) |
2273 | dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2); |
2207 | dir = absdir (dir + rndm (3) + rndm (3) - 2); |
2274 | |
2208 | |
2275 | op->facing = dir; |
2209 | op->facing = dir; |
2276 | |
2210 | |
2277 | if (op->hide) |
2211 | if (op->hide) |
2278 | do_hidden_move (op); |
2212 | do_hidden_move (op); |
2279 | |
2213 | |
|
|
2214 | bool retval; |
|
|
2215 | |
2280 | if (INVOKE_PLAYER (MOVE, op->contr, ARG_INT (dir))) |
2216 | if (INVOKE_PLAYER (MOVE, op->contr, ARG_INT (dir))) |
2281 | /*nop */ ; |
2217 | retval = RESULT_INT (0); |
2282 | else if (op->contr->fire_on) |
2218 | else if (op->contr->fire_on) |
2283 | fire (op, dir); |
2219 | retval = fire (op, dir); |
2284 | else |
2220 | else |
2285 | { |
2221 | { |
2286 | move_player_attack (op, dir); |
2222 | retval = move_player_attack (op, dir); |
2287 | pick = check_pick (op); |
2223 | pick = check_pick (op); |
2288 | } |
2224 | } |
2289 | |
2225 | |
2290 | /* Add special check for newcs players and fire on - this way, the |
2226 | /* Add special check for newcs players and fire on - this way, the |
2291 | * server can handle repeat firing. |
2227 | * server can handle repeat firing. |
… | |
… | |
2298 | /* Update how the player looks. Use the facing, so direction may |
2234 | /* Update how the player looks. Use the facing, so direction may |
2299 | * get reset to zero. This allows for full animation capabilities |
2235 | * get reset to zero. This allows for full animation capabilities |
2300 | * for players. |
2236 | * for players. |
2301 | */ |
2237 | */ |
2302 | animate_object (op, op->facing); |
2238 | animate_object (op, op->facing); |
2303 | return 0; |
2239 | |
|
|
2240 | return retval; |
2304 | } |
2241 | } |
2305 | |
2242 | |
2306 | /* This is similar to handle_player, below, but is only used by the |
2243 | /* This is similar to handle_player, below, but is only used by the |
2307 | * new client/server stuff. |
2244 | * new client/server stuff. |
2308 | * This is sort of special, in that the new client/server actually uses |
2245 | * This is sort of special, in that the new client/server actually uses |
2309 | * the new speed values for commands. |
2246 | * the new speed values for commands. |
2310 | * |
2247 | * |
2311 | * Returns true if there are more actions we can do. |
2248 | * Returns true if there are more actions we can do. Should not do |
|
|
2249 | * many actions in a row, as that would be too unfair to other |
|
|
2250 | * players. |
2312 | */ |
2251 | */ |
2313 | int |
2252 | bool |
2314 | handle_newcs_player (object *op) |
2253 | handle_newcs_player (object *op) |
2315 | { |
2254 | { |
2316 | if (op->contr->hidden) |
|
|
2317 | { |
|
|
2318 | op->invisible = 1000; |
|
|
2319 | /* the socket code flashes the player visible/invisible |
|
|
2320 | * depending on the value of invisible, so we need to |
|
|
2321 | * alternate it here for it to work correctly. |
|
|
2322 | */ |
|
|
2323 | if (pticks & 2) |
|
|
2324 | op->invisible--; |
|
|
2325 | } |
|
|
2326 | else if (op->invisible && !(QUERY_FLAG (op, FLAG_MAKE_INVIS))) |
|
|
2327 | { |
|
|
2328 | op->invisible--; |
|
|
2329 | if (!op->invisible) |
|
|
2330 | { |
|
|
2331 | make_visible (op); |
|
|
2332 | new_draw_info (NDI_UNIQUE, 0, op, "Your invisibility spell runs out."); |
|
|
2333 | } |
|
|
2334 | } |
|
|
2335 | |
|
|
2336 | if (QUERY_FLAG (op, FLAG_SCARED)) |
2255 | if (QUERY_FLAG (op, FLAG_SCARED)) |
2337 | { |
2256 | { |
2338 | flee_player (op); |
2257 | if (op->speed_left > 0.f) |
2339 | /* If player is still scared, that is his action for this tick */ |
|
|
2340 | if (QUERY_FLAG (op, FLAG_SCARED)) |
|
|
2341 | { |
2258 | { |
2342 | op->speed_left--; |
2259 | --op->speed_left; |
|
|
2260 | flee_player (op); |
|
|
2261 | |
2343 | return 0; |
2262 | return true; |
2344 | } |
2263 | } |
|
|
2264 | else |
|
|
2265 | return false; |
2345 | } |
2266 | } |
2346 | |
|
|
2347 | /* I've been seeing crashes where the golem has been destroyed, but |
|
|
2348 | * the player object still points to the defunct golem. The code that |
|
|
2349 | * destroys the golem looks correct, and it doesn't always happen, so |
|
|
2350 | * put this in a a workaround to clean up the golem pointer. |
|
|
2351 | */ |
|
|
2352 | if (op->contr->ranges[range_golem] && QUERY_FLAG (op->contr->ranges[range_golem], FLAG_REMOVED)) |
|
|
2353 | op->contr->ranges[range_golem] = 0; |
|
|
2354 | |
2267 | |
2355 | /* call this here - we also will call this in do_ericserver, but |
2268 | /* call this here - we also will call this in do_ericserver, but |
2356 | * the players time has been increased when doericserver has been |
2269 | * the players time has been increased when doericserver has been |
2357 | * called, so we recheck it here. |
2270 | * called, so we recheck it here. |
2358 | */ |
2271 | */ |
2359 | //TODO: better than handling 8 commands, use some more intelligent rate-limiting |
2272 | if (op->contr->ns->handle_command ()) |
2360 | for (int rep = 8; --rep && op->contr->ns->handle_command (); ) |
|
|
2361 | ; |
|
|
2362 | |
|
|
2363 | if (op->speed_left < 0) |
|
|
2364 | return 0; |
2273 | return true; |
2365 | |
2274 | |
2366 | if (op->direction && (op->contr->run_on || op->contr->fire_on)) |
2275 | if (op->direction && (op->contr->run_on || op->contr->fire_on)) |
2367 | { |
|
|
2368 | /* All move commands take 1 tick, at least for now */ |
|
|
2369 | op->speed_left--; |
|
|
2370 | |
|
|
2371 | /* Instead of all the stuff below, let move_player take care |
|
|
2372 | * of it. Also, some of the skill stuff is only put in |
|
|
2373 | * there, as well as the confusion stuff. |
|
|
2374 | */ |
|
|
2375 | move_player (op, op->direction); |
2276 | return move_player (op, op->direction); |
2376 | if (op->speed_left > 0) |
|
|
2377 | return 1; |
|
|
2378 | else |
|
|
2379 | return 0; |
|
|
2380 | } |
|
|
2381 | |
2277 | |
2382 | return 0; |
2278 | return false; |
2383 | } |
2279 | } |
2384 | |
2280 | |
2385 | int |
2281 | int |
2386 | save_life (object *op) |
2282 | save_life (object *op) |
2387 | { |
2283 | { |
… | |
… | |
2422 | * from. |
2318 | * from. |
2423 | */ |
2319 | */ |
2424 | void |
2320 | void |
2425 | remove_unpaid_objects (object *op, object *env) |
2321 | remove_unpaid_objects (object *op, object *env) |
2426 | { |
2322 | { |
2427 | object *next; |
|
|
2428 | |
|
|
2429 | while (op) |
2323 | while (op) |
2430 | { |
2324 | { |
2431 | next = op->below; /* Make sure we have a good value, in case |
2325 | object *next = op->below; /* Make sure we have a good value, in case we remove object 'op' */ |
2432 | * we remove object 'op' |
2326 | |
2433 | */ |
|
|
2434 | if (QUERY_FLAG (op, FLAG_UNPAID)) |
2327 | if (QUERY_FLAG (op, FLAG_UNPAID)) |
2435 | { |
2328 | { |
2436 | op->remove (); |
|
|
2437 | op->x = env->x; |
|
|
2438 | op->y = env->y; |
|
|
2439 | if (env->type == PLAYER) |
2329 | if (env->type == PLAYER) |
2440 | esrv_del_item (env->contr, op->count); |
2330 | esrv_del_item (env->contr, op->count); |
2441 | insert_ob_in_map (op, env->map, NULL, 0); |
2331 | |
|
|
2332 | op->insert_at (env); |
2442 | } |
2333 | } |
2443 | else if (op->inv) |
2334 | else if (op->inv) |
2444 | remove_unpaid_objects (op->inv, env); |
2335 | remove_unpaid_objects (op->inv, env); |
2445 | |
2336 | |
2446 | op = next; |
2337 | op = next; |
… | |
… | |
2502 | int rate_grace = 2000; |
2393 | int rate_grace = 2000; |
2503 | const int max_hp = 1; |
2394 | const int max_hp = 1; |
2504 | const int max_sp = 1; |
2395 | const int max_sp = 1; |
2505 | const int max_grace = 1; |
2396 | const int max_grace = 1; |
2506 | |
2397 | |
2507 | if (op->contr->outputs_sync) |
2398 | if (op->contr->hidden) |
|
|
2399 | { |
|
|
2400 | op->invisible = 1000; |
|
|
2401 | /* the socket code flashes the player visible/invisible |
|
|
2402 | * depending on the value of invisible, so we need to |
|
|
2403 | * alternate it here for it to work correctly. |
|
|
2404 | */ |
|
|
2405 | if (pticks & 2) |
|
|
2406 | op->invisible--; |
2508 | { |
2407 | } |
2509 | for (i = 0; i < NUM_OUTPUT_BUFS; i++) |
2408 | else if (op->invisible && !(QUERY_FLAG (op, FLAG_MAKE_INVIS))) |
2510 | if (op->contr->outputs[i].buf && (op->contr->outputs[i].first_update + op->contr->outputs_sync) < (uint16) pticks) |
2409 | { |
2511 | flush_output_element (op, &op->contr->outputs[i]); |
2410 | if (!op->invisible--) |
|
|
2411 | { |
|
|
2412 | make_visible (op); |
|
|
2413 | new_draw_info (NDI_UNIQUE, 0, op, "Your invisibility spell runs out."); |
|
|
2414 | } |
2512 | } |
2415 | } |
2513 | |
2416 | |
2514 | if (op->contr->ns->state == ST_PLAYING) |
2417 | if (op->contr->ns->state == ST_PLAYING) |
2515 | { |
2418 | { |
2516 | /* these next three if clauses make it possible to SLOW DOWN |
2419 | /* these next three if clauses make it possible to SLOW DOWN |
… | |
… | |
2538 | gen_grace = op->stats.maxgrace; |
2441 | gen_grace = op->stats.maxgrace; |
2539 | rate_grace -= rate_grace / 2 * op->contr->gen_grace; |
2442 | rate_grace -= rate_grace / 2 * op->contr->gen_grace; |
2540 | } |
2443 | } |
2541 | |
2444 | |
2542 | /* Regenerate Spell Points */ |
2445 | /* Regenerate Spell Points */ |
2543 | if (op->contr->ranges[range_golem] == NULL && --op->last_sp < 0) |
2446 | if (!op->contr->golem && --op->last_sp < 0) |
2544 | { |
2447 | { |
2545 | gen_sp = gen_sp * 10 / (op->contr->gen_sp_armour < 10 ? 10 : op->contr->gen_sp_armour); |
2448 | gen_sp = gen_sp * 10 / (op->contr->gen_sp_armour < 10 ? 10 : op->contr->gen_sp_armour); |
2546 | if (op->stats.sp < op->stats.maxsp) |
2449 | if (op->stats.sp < op->stats.maxsp) |
2547 | { |
2450 | { |
2548 | op->stats.sp++; |
2451 | op->stats.sp++; |
… | |
… | |
2646 | } |
2549 | } |
2647 | |
2550 | |
2648 | /* Digestion */ |
2551 | /* Digestion */ |
2649 | if (--op->last_eat < 0) |
2552 | if (--op->last_eat < 0) |
2650 | { |
2553 | { |
2651 | #ifdef COZY_SERVER |
|
|
2652 | int dg = op->contr->digestion >= 0 && op->contr->digestion < 2 ? 2 : op->contr->digestion; |
|
|
2653 | int bonus = dg > 0 ? dg : 0, penalty = dg < 0 ? -dg : 0; |
|
|
2654 | #else |
|
|
2655 | int bonus = op->contr->digestion > 0 ? op->contr->digestion : 0, penalty = op->contr->digestion < 0 ? -op->contr->digestion : 0; |
2554 | int bonus = op->contr->digestion > 0 ? op->contr->digestion : 0, penalty = op->contr->digestion < 0 ? -op->contr->digestion : 0; |
2656 | #endif |
|
|
2657 | |
2555 | |
2658 | if (op->contr->gen_hp > 0) |
2556 | if (op->contr->gen_hp > 0) |
2659 | op->last_eat = 25 * (1 + bonus) / (op->contr->gen_hp + penalty + 1); |
2557 | op->last_eat = 25 * (1 + bonus) / (op->contr->gen_hp + penalty + 1); |
2660 | else |
2558 | else |
2661 | op->last_eat = 25 * (1 + bonus) / (penalty + 1); |
2559 | op->last_eat = 25 * (1 + bonus) / (penalty + 1); |
… | |
… | |
2739 | new_draw_info (NDI_UNIQUE | NDI_NAVY, 0, op, "You have been defeated in combat!"); |
2637 | new_draw_info (NDI_UNIQUE | NDI_NAVY, 0, op, "You have been defeated in combat!"); |
2740 | new_draw_info (NDI_UNIQUE | NDI_NAVY, 0, op, "Local medics have saved your life..."); |
2638 | new_draw_info (NDI_UNIQUE | NDI_NAVY, 0, op, "Local medics have saved your life..."); |
2741 | |
2639 | |
2742 | /* restore player */ |
2640 | /* restore player */ |
2743 | at = archetype::find ("poisoning"); |
2641 | at = archetype::find ("poisoning"); |
2744 | tmp = present_arch_in_ob (at, op); |
2642 | if (object *tmp = present_arch_in_ob (at, op)) |
2745 | if (tmp) |
|
|
2746 | { |
2643 | { |
2747 | tmp->destroy (); |
2644 | tmp->destroy (); |
2748 | new_draw_info (NDI_UNIQUE, 0, op, "Your body feels cleansed"); |
2645 | new_draw_info (NDI_UNIQUE, 0, op, "Your body feels cleansed"); |
2749 | } |
2646 | } |
2750 | |
2647 | |
2751 | at = archetype::find ("confusion"); |
2648 | at = archetype::find ("confusion"); |
2752 | tmp = present_arch_in_ob (at, op); |
2649 | if (object *tmp = present_arch_in_ob (at, op)) |
2753 | if (tmp) |
|
|
2754 | { |
2650 | { |
2755 | tmp->destroy (); |
2651 | tmp->destroy (); |
2756 | new_draw_info (NDI_UNIQUE, 0, tmp, "Your mind feels clearer"); |
2652 | new_draw_info (NDI_UNIQUE, 0, tmp, "Your mind feels clearer"); |
2757 | } |
2653 | } |
2758 | |
2654 | |
… | |
… | |
2760 | op->stats.hp = op->stats.maxhp; |
2656 | op->stats.hp = op->stats.maxhp; |
2761 | if (op->stats.food <= 0) |
2657 | if (op->stats.food <= 0) |
2762 | op->stats.food = 999; |
2658 | op->stats.food = 999; |
2763 | |
2659 | |
2764 | /* create a bodypart-trophy to make the winner happy */ |
2660 | /* create a bodypart-trophy to make the winner happy */ |
2765 | tmp = arch_to_object (archetype::find ("finger")); |
2661 | if (object *tmp = arch_to_object (archetype::find ("finger"))) |
2766 | if (tmp != NULL) |
|
|
2767 | { |
2662 | { |
2768 | sprintf (buf, "%s's finger", &op->name); |
2663 | sprintf (buf, "%s's finger", &op->name); |
2769 | tmp->name = buf; |
2664 | tmp->name = buf; |
2770 | sprintf (buf, " This finger has been cut off %s\n" |
2665 | sprintf (buf, " This finger has been cut off %s\n" |
2771 | " the %s, when he was defeated at\n level %d by %s.\n", |
2666 | " the %s, when he was defeated at\n level %d by %s.\n", |
2772 | &op->name, op->contr->title, (int) (op->level), op->contr->killer); |
2667 | &op->name, op->contr->title, (int) (op->level), op->contr->killer); |
2773 | tmp->msg = buf; |
2668 | tmp->msg = buf; |
2774 | tmp->value = 0, tmp->material = 0, tmp->type = 0; |
2669 | tmp->value = 0, tmp->type = 0; |
2775 | tmp->materialname = NULL; |
2670 | tmp->materialname = "organics"; |
2776 | tmp->x = op->x, tmp->y = op->y; |
2671 | tmp->insert_at (op, tmp); |
2777 | insert_ob_in_map (tmp, op->map, op, 0); |
|
|
2778 | } |
2672 | } |
2779 | |
2673 | |
2780 | /* teleport defeated player to new destination */ |
2674 | /* teleport defeated player to new destination */ |
2781 | transfer_ob (op, x, y, 0, NULL); |
2675 | transfer_ob (op, x, y, 0, NULL); |
2782 | op->contr->braced = 0; |
2676 | op->contr->braced = 0; |
… | |
… | |
2787 | |
2681 | |
2788 | command_kill_pets (op, 0); |
2682 | command_kill_pets (op, 0); |
2789 | |
2683 | |
2790 | if (op->stats.food < 0) |
2684 | if (op->stats.food < 0) |
2791 | { |
2685 | { |
2792 | if (op->contr->explore) |
|
|
2793 | { |
|
|
2794 | new_draw_info (NDI_UNIQUE, 0, op, "You would have starved, but you are"); |
|
|
2795 | new_draw_info (NDI_UNIQUE, 0, op, "in explore mode, so..."); |
|
|
2796 | op->stats.food = 999; |
|
|
2797 | return; |
|
|
2798 | } |
|
|
2799 | sprintf (buf, "%s starved to death.", &op->name); |
2686 | sprintf (buf, "%s starved to death.", &op->name); |
2800 | strcpy (op->contr->killer, "starvation"); |
2687 | strcpy (op->contr->killer, "starvation"); |
2801 | } |
2688 | } |
2802 | else |
2689 | else |
2803 | { |
|
|
2804 | if (op->contr->explore) |
|
|
2805 | { |
|
|
2806 | new_draw_info (NDI_UNIQUE, 0, op, "You would have died, but you are"); |
|
|
2807 | new_draw_info (NDI_UNIQUE, 0, op, "in explore mode, so..."); |
|
|
2808 | op->stats.hp = op->stats.maxhp; |
|
|
2809 | return; |
|
|
2810 | } |
|
|
2811 | sprintf (buf, "%s died.", &op->name); |
2690 | sprintf (buf, "%s died.", &op->name); |
2812 | } |
2691 | |
2813 | play_sound_player_only (op->contr, SOUND_PLAYER_DIES, 0, 0); |
2692 | play_sound_player_only (op->contr, SOUND_PLAYER_DIES, 0, 0); |
2814 | |
2693 | |
2815 | /* save the map location for corpse, gravestone */ |
2694 | /* save the map location for corpse, gravestone */ |
2816 | x = op->x; |
2695 | x = op->x; |
2817 | y = op->y; |
2696 | y = op->y; |
2818 | map = op->map; |
2697 | map = op->map; |
2819 | |
|
|
2820 | |
2698 | |
2821 | /* NOT_PERMADEATH code. This basically brings the character back to |
2699 | /* NOT_PERMADEATH code. This basically brings the character back to |
2822 | * life if they are dead - it takes some exp and a random stat. |
2700 | * life if they are dead - it takes some exp and a random stat. |
2823 | * See the config.h file for a little more in depth detail about this. |
2701 | * See the config.h file for a little more in depth detail about this. |
2824 | */ |
2702 | */ |
… | |
… | |
2841 | num_stats_lose = 1; |
2719 | num_stats_lose = 1; |
2842 | else |
2720 | else |
2843 | num_stats_lose = 1 + op->level / BALSL_NUMBER_LOSSES_RATIO; |
2721 | num_stats_lose = 1 + op->level / BALSL_NUMBER_LOSSES_RATIO; |
2844 | } |
2722 | } |
2845 | else |
2723 | else |
2846 | { |
|
|
2847 | num_stats_lose = 1; |
2724 | num_stats_lose = 1; |
2848 | } |
2725 | |
2849 | lost_a_stat = 0; |
2726 | lost_a_stat = 0; |
2850 | |
2727 | |
2851 | for (z = 0; z < num_stats_lose; z++) |
2728 | for (z = 0; z < num_stats_lose; z++) |
2852 | { |
2729 | { |
2853 | i = RANDOM () % NUM_STATS; |
2730 | i = RANDOM () % NUM_STATS; |
… | |
… | |
2994 | op->stats.hp = op->stats.maxhp; |
2871 | op->stats.hp = op->stats.maxhp; |
2995 | op->stats.sp = MAX (op->stats.sp, op->stats.maxsp); |
2872 | op->stats.sp = MAX (op->stats.sp, op->stats.maxsp); |
2996 | op->stats.grace = MAX (op->stats.grace, op->stats.maxgrace); |
2873 | op->stats.grace = MAX (op->stats.grace, op->stats.maxgrace); |
2997 | |
2874 | |
2998 | /* |
2875 | /* |
2999 | * Check to see if the player is in a shop. IF so, then check to see if |
|
|
3000 | * the player has any unpaid items. If so, remove them and put them back |
2876 | * Check to see if the player has any unpaid items. If so, remove them |
3001 | * in the map. |
2877 | * and put them back in the map. |
3002 | */ |
2878 | */ |
3003 | |
|
|
3004 | if (is_in_shop (op)) |
|
|
3005 | remove_unpaid_objects (op->inv, op); |
2879 | remove_unpaid_objects (op->inv, op); |
3006 | |
2880 | |
3007 | /****************************************/ |
2881 | /****************************************/ |
3008 | /* */ |
2882 | /* */ |
3009 | /* Move player to his current respawn- */ |
2883 | /* Move player to his current respawn- */ |
3010 | /* position (usually last savebed) */ |
2884 | /* position (usually last savebed) */ |
3011 | /* */ |
2885 | /* */ |
3012 | /****************************************/ |
2886 | /****************************************/ |
3013 | |
2887 | |
3014 | enter_player_savebed (op); |
2888 | enter_player_savebed (op); |
3015 | |
2889 | |
3016 | /* Save the player before inserting the force to reduce |
|
|
3017 | * chance of abuse. |
|
|
3018 | */ |
|
|
3019 | op->contr->braced = 0; |
2890 | op->contr->braced = 0; |
3020 | op->contr->save (); |
|
|
3021 | |
2891 | |
3022 | /* it is possible that the player has blown something up |
2892 | /* it is possible that the player has blown something up |
3023 | * at his savebed location, and that can have long lasting |
2893 | * at his savebed location, and that can have long lasting |
3024 | * spell effects. So first see if there is a spell effect |
2894 | * spell effects. So first see if there is a spell effect |
3025 | * on the space that might harm the player. |
2895 | * on the space that might harm the player. |
… | |
… | |
3034 | object *force; |
2904 | object *force; |
3035 | int at; |
2905 | int at; |
3036 | |
2906 | |
3037 | force = get_archetype (FORCE_NAME); |
2907 | force = get_archetype (FORCE_NAME); |
3038 | /* 50 ticks should be enough time for the spell to abate */ |
2908 | /* 50 ticks should be enough time for the spell to abate */ |
3039 | force->speed = 0.1; |
2909 | force->speed = 0.1f; |
3040 | force->speed_left = -5.0; |
2910 | force->speed_left = -5.f; |
3041 | SET_FLAG (force, FLAG_APPLIED); |
2911 | SET_FLAG (force, FLAG_APPLIED); |
3042 | for (at = 0; at < NROFATTACKS; at++) |
2912 | for (at = 0; at < NROFATTACKS; at++) |
3043 | if (will_kill_again & (1 << at)) |
2913 | if (will_kill_again & (1 << at)) |
3044 | force->resist[at] = 100; |
2914 | force->resist[at] = 100; |
3045 | |
2915 | |
… | |
… | |
3054 | void |
2924 | void |
3055 | loot_object (object *op) |
2925 | loot_object (object *op) |
3056 | { /* Grab and destroy some treasure */ |
2926 | { /* Grab and destroy some treasure */ |
3057 | object *tmp, *tmp2, *next; |
2927 | object *tmp, *tmp2, *next; |
3058 | |
2928 | |
3059 | if (op->container) |
2929 | op->close_container (); /* close open sack first */ |
3060 | esrv_apply_container (op, op->container); /* close open sack first */ |
|
|
3061 | |
2930 | |
3062 | for (tmp = op->inv; tmp; tmp = next) |
2931 | for (tmp = op->inv; tmp; tmp = next) |
3063 | { |
2932 | { |
3064 | next = tmp->below; |
2933 | next = tmp->below; |
3065 | |
2934 | |
3066 | if (tmp->invisible) |
2935 | if (tmp->invisible) |
3067 | continue; |
2936 | continue; |
3068 | |
2937 | |
3069 | tmp->remove (); |
2938 | tmp->remove (); |
3070 | tmp->x = op->x, tmp->y = op->y; |
2939 | tmp->x = op->x, tmp->y = op->y; |
|
|
2940 | |
3071 | if (tmp->type == CONTAINER) |
2941 | if (tmp->type == CONTAINER) |
3072 | { /* empty container to ground */ |
2942 | loot_object (tmp); /* empty container to ground */ |
3073 | loot_object (tmp); |
2943 | |
3074 | } |
|
|
3075 | if (!QUERY_FLAG (tmp, FLAG_UNIQUE) && (QUERY_FLAG (tmp, FLAG_STARTEQUIP) || QUERY_FLAG (tmp, FLAG_NO_DROP) || !(RANDOM () % 3))) |
2944 | if (!QUERY_FLAG (tmp, FLAG_UNIQUE) && (QUERY_FLAG (tmp, FLAG_STARTEQUIP) || QUERY_FLAG (tmp, FLAG_NO_DROP) || !(rndm (3)))) |
3076 | { |
2945 | { |
3077 | if (tmp->nrof > 1) |
2946 | if (tmp->nrof > 1) |
3078 | { |
2947 | { |
3079 | tmp2 = get_split_ob (tmp, 1 + RANDOM () % (tmp->nrof - 1)); |
2948 | tmp2 = get_split_ob (tmp, 1 + RANDOM () % (tmp->nrof - 1)); |
3080 | tmp2->destroy (); |
2949 | tmp2->destroy (); |
… | |
… | |
3091 | /* |
2960 | /* |
3092 | * fix_weight(): Check recursively the weight of all players, and fix |
2961 | * fix_weight(): Check recursively the weight of all players, and fix |
3093 | * what needs to be fixed. Refresh windows and fix speed if anything |
2962 | * what needs to be fixed. Refresh windows and fix speed if anything |
3094 | * was changed. |
2963 | * was changed. |
3095 | */ |
2964 | */ |
3096 | |
|
|
3097 | void |
2965 | void |
3098 | fix_weight (void) |
2966 | fix_weight (void) |
3099 | { |
2967 | { |
3100 | for (player *pl = first_player; pl; pl = pl->next) |
2968 | for_all_players (pl) |
3101 | { |
2969 | { |
3102 | int old = pl->ob->carrying, sum = sum_weight (pl->ob); |
2970 | int old = pl->ob->carrying, sum = sum_weight (pl->ob); |
3103 | |
2971 | |
3104 | if (old == sum) |
2972 | if (old == sum) |
3105 | continue; |
2973 | continue; |
… | |
… | |
3109 | } |
2977 | } |
3110 | |
2978 | |
3111 | void |
2979 | void |
3112 | fix_luck (void) |
2980 | fix_luck (void) |
3113 | { |
2981 | { |
3114 | for (player *pl = first_player; pl; pl = pl->next) |
2982 | for_all_players (pl) |
3115 | if (!pl->ob->contr->ns->state) |
2983 | if (!pl->ob->contr->ns->state) |
3116 | pl->ob->change_luck (0); |
2984 | pl->ob->change_luck (0); |
3117 | } |
2985 | } |
3118 | |
2986 | |
3119 | /* cast_dust() - handles op throwing objects of type 'DUST'. |
2987 | /* cast_dust() - handles op throwing objects of type 'DUST'. |
… | |
… | |
3161 | if (op->type == PLAYER) |
3029 | if (op->type == PLAYER) |
3162 | { |
3030 | { |
3163 | op->contr->tmp_invis = 0; |
3031 | op->contr->tmp_invis = 0; |
3164 | op->contr->invis_race = 0; |
3032 | op->contr->invis_race = 0; |
3165 | } |
3033 | } |
|
|
3034 | |
3166 | update_object (op, UP_OBJ_FACE); |
3035 | update_object (op, UP_OBJ_CHANGE); |
3167 | } |
3036 | } |
3168 | |
3037 | |
3169 | int |
3038 | int |
3170 | is_true_undead (object *op) |
3039 | is_true_undead (object *op) |
3171 | { |
3040 | { |
3172 | object *tmp = NULL; |
|
|
3173 | |
|
|
3174 | if (QUERY_FLAG (&op->arch->clone, FLAG_UNDEAD)) |
3041 | if (QUERY_FLAG (op->arch, FLAG_UNDEAD)) |
3175 | return 1; |
3042 | return 1; |
3176 | |
3043 | |
3177 | return 0; |
3044 | return 0; |
3178 | } |
3045 | } |
3179 | |
3046 | |
… | |
… | |
3223 | /* For Hidden creatures - a chance of becoming 'unhidden' |
3090 | /* For Hidden creatures - a chance of becoming 'unhidden' |
3224 | * every time they move - as we subtract off 'invisibility' |
3091 | * every time they move - as we subtract off 'invisibility' |
3225 | * AND, for players, if they move into a ridiculously unhideable |
3092 | * AND, for players, if they move into a ridiculously unhideable |
3226 | * spot (surrounded by clear terrain in broad daylight). -b.t. |
3093 | * spot (surrounded by clear terrain in broad daylight). -b.t. |
3227 | */ |
3094 | */ |
3228 | |
|
|
3229 | void |
3095 | void |
3230 | do_hidden_move (object *op) |
3096 | do_hidden_move (object *op) |
3231 | { |
3097 | { |
3232 | int hide = 0, num = random_roll (0, 19, op, PREFER_LOW); |
3098 | int hide = 0, num = random_roll (0, 19, op, PREFER_LOW); |
3233 | object *skop; |
3099 | object *skop; |
… | |
… | |
3237 | |
3103 | |
3238 | skop = find_obj_by_type_subtype (op, SKILL, SK_HIDING); |
3104 | skop = find_obj_by_type_subtype (op, SKILL, SK_HIDING); |
3239 | |
3105 | |
3240 | /* its *extremely* hard to run and sneak/hide at the same time! */ |
3106 | /* its *extremely* hard to run and sneak/hide at the same time! */ |
3241 | if (op->type == PLAYER && op->contr->run_on) |
3107 | if (op->type == PLAYER && op->contr->run_on) |
3242 | { |
|
|
3243 | if (!skop || num >= skop->level) |
3108 | if (!skop || num >= skop->level) |
3244 | { |
3109 | { |
3245 | new_draw_info (NDI_UNIQUE, 0, op, "You ran too much! You are no longer hidden!"); |
3110 | new_draw_info (NDI_UNIQUE, 0, op, "You ran too much! You are no longer hidden!"); |
3246 | make_visible (op); |
3111 | make_visible (op); |
3247 | return; |
3112 | return; |
3248 | } |
3113 | } |
3249 | else |
3114 | else |
3250 | num += 20; |
3115 | num += 20; |
3251 | } |
3116 | |
3252 | num += op->map->difficulty; |
3117 | num += op->map->difficulty; |
3253 | hide = hideability (op); /* modify by terrain hidden level */ |
3118 | hide = hideability (op); /* modify by terrain hidden level */ |
3254 | num -= hide; |
3119 | num -= hide; |
|
|
3120 | |
3255 | if ((op->type == PLAYER && hide < -10) || ((op->invisible -= num) <= 0)) |
3121 | if ((op->type == PLAYER && hide < -10) || ((op->invisible -= num) <= 0)) |
3256 | { |
3122 | { |
3257 | make_visible (op); |
3123 | make_visible (op); |
3258 | if (op->type == PLAYER) |
3124 | if (op->type == PLAYER) |
3259 | new_draw_info (NDI_UNIQUE, 0, op, "You moved out of hiding! You are visible!"); |
3125 | new_draw_info (NDI_UNIQUE, 0, op, "You moved out of hiding! You are visible!"); |
3260 | } |
3126 | } |
3261 | else if (op->type == PLAYER && skop) |
3127 | else if (op->type == PLAYER && skop) |
3262 | { |
|
|
3263 | change_exp (op, calc_skill_exp (op, NULL, skop), skop->skill, 0); |
3128 | change_exp (op, calc_skill_exp (op, NULL, skop), skop->skill, 0); |
3264 | } |
|
|
3265 | } |
3129 | } |
3266 | |
3130 | |
3267 | /* determine if who is standing near a hostile creature. */ |
3131 | /* determine if who is standing near a hostile creature. */ |
3268 | |
3132 | |
3269 | int |
3133 | int |
… | |
… | |
3336 | if (pl->type != PLAYER) |
3200 | if (pl->type != PLAYER) |
3337 | { |
3201 | { |
3338 | LOG (llevError, "player_can_view() called for non-player object\n"); |
3202 | LOG (llevError, "player_can_view() called for non-player object\n"); |
3339 | return -1; |
3203 | return -1; |
3340 | } |
3204 | } |
|
|
3205 | |
3341 | if (!pl || !op) |
3206 | if (!pl || !op) |
3342 | return 0; |
3207 | return 0; |
3343 | |
3208 | |
3344 | if (op->head) |
|
|
3345 | { |
|
|
3346 | op = op->head; |
3209 | op = op->head_ (); |
3347 | } |
3210 | |
3348 | get_rangevector (pl, op, &rv, 0x1); |
3211 | get_rangevector (pl, op, &rv, 0x1); |
3349 | |
3212 | |
3350 | /* starting with the 'head' part, lets loop |
3213 | /* starting with the 'head' part, lets loop |
3351 | * through the object and find if it has any |
3214 | * through the object and find if it has any |
3352 | * part that is in the los array but isnt on |
3215 | * part that is in the los array but isnt on |
3353 | * a blocked los square. |
3216 | * a blocked los square. |
3354 | * we use the archetype to figure out offsets. |
3217 | * we use the archetype to figure out offsets. |
3355 | */ |
3218 | */ |
3356 | while (op) |
3219 | while (op) |
3357 | { |
3220 | { |
3358 | dx = rv.distance_x + op->arch->clone.x; |
3221 | dx = rv.distance_x + op->arch->x; |
3359 | dy = rv.distance_y + op->arch->clone.y; |
3222 | dy = rv.distance_y + op->arch->y; |
3360 | |
3223 | |
3361 | /* only the viewable area the player sees is updated by LOS |
3224 | /* only the viewable area the player sees is updated by LOS |
3362 | * code, so we need to restrict ourselves to that range of values |
3225 | * code, so we need to restrict ourselves to that range of values |
3363 | * for any meaningful values. |
3226 | * for any meaningful values. |
3364 | */ |
3227 | */ |
… | |
… | |
3469 | char buf[MAX_BUF]; /* tmp. string buffer */ |
3332 | char buf[MAX_BUF]; /* tmp. string buffer */ |
3470 | int i = 0, j = 0; |
3333 | int i = 0, j = 0; |
3471 | |
3334 | |
3472 | /* get the appropriate treasurelist */ |
3335 | /* get the appropriate treasurelist */ |
3473 | if (atnr == ATNR_FIRE) |
3336 | if (atnr == ATNR_FIRE) |
3474 | trlist = find_treasurelist ("dragon_ability_fire"); |
3337 | trlist = treasurelist::find ("dragon_ability_fire"); |
3475 | else if (atnr == ATNR_COLD) |
3338 | else if (atnr == ATNR_COLD) |
3476 | trlist = find_treasurelist ("dragon_ability_cold"); |
3339 | trlist = treasurelist::find ("dragon_ability_cold"); |
3477 | else if (atnr == ATNR_ELECTRICITY) |
3340 | else if (atnr == ATNR_ELECTRICITY) |
3478 | trlist = find_treasurelist ("dragon_ability_elec"); |
3341 | trlist = treasurelist::find ("dragon_ability_elec"); |
3479 | else if (atnr == ATNR_POISON) |
3342 | else if (atnr == ATNR_POISON) |
3480 | trlist = find_treasurelist ("dragon_ability_poison"); |
3343 | trlist = treasurelist::find ("dragon_ability_poison"); |
3481 | |
3344 | |
3482 | if (trlist == NULL || who->type != PLAYER) |
3345 | if (trlist == NULL || who->type != PLAYER) |
3483 | return; |
3346 | return; |
3484 | |
3347 | |
3485 | for (i = 0, tr = trlist->items; tr != NULL && i < level - 1; tr = tr->next, i++); |
3348 | for (i = 0, tr = trlist->items; tr != NULL && i < level - 1; tr = tr->next, i++); |
3486 | |
3349 | |
3487 | if (tr == NULL || tr->item == NULL) |
3350 | if (!tr || !tr->item) |
3488 | { |
3351 | { |
3489 | /* LOG(llevDebug, "-> no more treasure for %s\n", change_resist_msg[atnr]); */ |
3352 | /* LOG(llevDebug, "-> no more treasure for %s\n", change_resist_msg[atnr]); */ |
3490 | return; |
3353 | return; |
3491 | } |
3354 | } |
3492 | |
3355 | |
3493 | /* everything seems okay - now bring on the gift: */ |
3356 | /* everything seems okay - now bring on the gift: */ |
3494 | item = &(tr->item->clone); |
3357 | item = tr->item; |
3495 | |
3358 | |
3496 | if (item->type == SPELL) |
3359 | if (item->type == SPELL) |
3497 | { |
3360 | { |
3498 | if (check_spell_known (who, item->name)) |
3361 | if (check_spell_known (who, item->name)) |
3499 | return; |
3362 | return; |
… | |
… | |
3559 | /* forces in the treasurelist can alter the player's stats */ |
3422 | /* forces in the treasurelist can alter the player's stats */ |
3560 | object *skin; |
3423 | object *skin; |
3561 | |
3424 | |
3562 | /* first get the dragon skin force */ |
3425 | /* first get the dragon skin force */ |
3563 | shstr_cmp dragon_skin_force ("dragon_skin_force"); |
3426 | shstr_cmp dragon_skin_force ("dragon_skin_force"); |
3564 | for (skin = who->inv; skin && !(skin->arch->name == dragon_skin_force); skin = skin->below) |
3427 | for (skin = who->inv; skin && !(skin->arch->archname == dragon_skin_force); skin = skin->below) |
3565 | ; |
3428 | ; |
3566 | |
3429 | |
3567 | if (!skin) |
3430 | if (!skin) |
3568 | return; |
3431 | return; |
3569 | |
3432 | |
… | |
… | |
3617 | * not readied. |
3480 | * not readied. |
3618 | */ |
3481 | */ |
3619 | void |
3482 | void |
3620 | player_unready_range_ob (player *pl, object *ob) |
3483 | player_unready_range_ob (player *pl, object *ob) |
3621 | { |
3484 | { |
3622 | rangetype i; |
3485 | if (pl->ob->current_weapon == ob) |
|
|
3486 | pl->ob->current_weapon = 0; |
3623 | |
3487 | |
3624 | for (i = (rangetype) 0; i < range_size; i = (rangetype) ((int) i + 1)) |
3488 | if (pl->combat_ob == ob) |
3625 | { |
3489 | pl->combat_ob = 0; |
|
|
3490 | |
3626 | if (pl->ranges[i] == ob) |
3491 | if (pl->ranged_ob == ob) |
3627 | { |
3492 | pl->ranged_ob = 0; |
3628 | pl->ranges[i] = NULL; |
|
|
3629 | if (pl->shoottype == i) |
|
|
3630 | { |
|
|
3631 | pl->shoottype = range_none; |
|
|
3632 | } |
|
|
3633 | } |
|
|
3634 | } |
|
|
3635 | } |
3493 | } |
|
|
3494 | |
|
|
3495 | sint8 |
|
|
3496 | player::visibility_at (maptile *map, int x, int y) const |
|
|
3497 | { |
|
|
3498 | if (!ns) |
|
|
3499 | return 0; |
|
|
3500 | |
|
|
3501 | int dx, dy; |
|
|
3502 | if (!adjacent_map (map, ns->current_map, &dx, &dy)) |
|
|
3503 | return 0; |
|
|
3504 | |
|
|
3505 | x += dx - ns->current_x + ns->mapx / 2; |
|
|
3506 | y += dy - ns->current_y + ns->mapy / 2; |
|
|
3507 | |
|
|
3508 | if (!IN_RANGE_EXC (x, 0, ns->mapx) || !IN_RANGE_EXC (y, 0, ns->mapy)) |
|
|
3509 | return 0; |
|
|
3510 | |
|
|
3511 | return 100 - blocked_los [x][y]; |
|
|
3512 | } |