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 |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License 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 |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
20 | |
|
|
21 | The author can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | #include <global.h> |
24 | #include <global.h> |
25 | #include <pwd.h> |
|
|
26 | #include <sproto.h> |
25 | #include <sproto.h> |
27 | #include <sounds.h> |
26 | #include <sounds.h> |
28 | #include <living.h> |
27 | #include <living.h> |
29 | #include <object.h> |
28 | #include <object.h> |
30 | #include <spells.h> |
29 | #include <spells.h> |
31 | #include <skills.h> |
30 | #include <skills.h> |
32 | |
31 | |
33 | #include <algorithm> |
32 | #include <algorithm> |
34 | #include <functional> |
33 | #include <functional> |
35 | |
34 | |
36 | player * |
35 | playervec players; |
37 | find_player (const char *plname) |
|
|
38 | { |
|
|
39 | for_all_players (pl) |
|
|
40 | if (pl->ob && !strcmp (query_name (pl->ob), plname)) |
|
|
41 | return pl; |
|
|
42 | |
|
|
43 | return 0; |
|
|
44 | } |
|
|
45 | |
36 | |
46 | void |
37 | void |
47 | display_motd (const object *op) |
38 | display_motd (const object *op) |
48 | { |
39 | { |
49 | char buf[MAX_BUF]; |
40 | char buf[MAX_BUF]; |
… | |
… | |
123 | |
114 | |
124 | news[0] = '\0'; |
115 | news[0] = '\0'; |
125 | subject[0] = '\0'; |
116 | subject[0] = '\0'; |
126 | size = 0; |
117 | size = 0; |
127 | |
118 | |
128 | while (fgets (buf, MAX_BUF, fp) != NULL) |
119 | while (fgets (buf, MAX_BUF, fp)) |
129 | { |
120 | { |
130 | if (*buf == '#') |
121 | if (*buf == '#') |
131 | continue; |
122 | continue; |
132 | |
123 | |
133 | if (*buf == '%') |
124 | if (*buf == '%') |
134 | { /* send one news */ |
125 | { /* send one news */ |
135 | if (size > 0) |
126 | if (size > 0) |
136 | 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 */ |
127 | 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 */ |
|
|
128 | |
137 | strcpy (subject, buf + 1); |
129 | strcpy (subject, buf + 1); |
138 | strip_endline (subject); |
130 | strip_endline (subject); |
139 | size = 0; |
131 | size = 0; |
140 | news[0] = '\0'; |
132 | news[0] = '\0'; |
141 | } |
133 | } |
… | |
… | |
150 | size += strlen (buf); |
142 | size += strlen (buf); |
151 | } |
143 | } |
152 | } |
144 | } |
153 | |
145 | |
154 | draw_ext_info_format (NDI_UNIQUE | NDI_GREEN, 0, op, |
146 | draw_ext_info_format (NDI_UNIQUE | NDI_GREEN, 0, op, |
155 | MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, "INFORMATION: %s\n%s\n", "%s\n%s", subject, news); |
147 | MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, "INFORMATION: %s\n%s\n", (char *)"%s\n%s", subject, news); |
156 | close_and_delete (fp, comp); |
148 | close_and_delete (fp, comp); |
157 | } |
149 | } |
158 | |
150 | |
159 | /* This loads the first map an puts the player on it. */ |
151 | /* This loads the first map an puts the player on it. */ |
160 | static void |
152 | static void |
161 | set_first_map (object *op) |
153 | set_first_map (object *op) |
162 | { |
154 | { |
163 | strcpy (op->contr->maplevel, first_map_path); |
155 | op->contr->maplevel = first_map_path; |
164 | op->x = -1; |
156 | op->x = -1; |
165 | op->y = -1; |
157 | op->y = -1; |
166 | } |
158 | } |
167 | |
159 | |
168 | void |
160 | void |
169 | player::enter_map () |
161 | player::activate () |
170 | { |
162 | { |
171 | object *tmp = object::create (); |
163 | if (active) |
|
|
164 | return; |
172 | |
165 | |
173 | EXIT_PATH (tmp) = maplevel; |
166 | players.insert (this); |
174 | EXIT_X (tmp) = ob->x; |
167 | ob->remove (); |
175 | EXIT_Y (tmp) = ob->y; |
168 | ob->map = 0; |
176 | ob->enter_exit (tmp); |
169 | ob->activate_recursive (); |
|
|
170 | CLEAR_FLAG (ob, FLAG_FRIENDLY); |
|
|
171 | add_friendly_object (ob); |
|
|
172 | } |
177 | |
173 | |
178 | tmp->destroy (); |
174 | void |
|
|
175 | player::deactivate () |
|
|
176 | { |
|
|
177 | if (!active) |
|
|
178 | return; |
|
|
179 | |
|
|
180 | terminate_all_pets (ob); |
|
|
181 | remove_friendly_object (ob); |
|
|
182 | ob->deactivate_recursive (); |
|
|
183 | |
|
|
184 | if (ob->map) |
|
|
185 | maplevel = ob->map->path; |
|
|
186 | |
|
|
187 | ob->remove (); |
|
|
188 | ob->enemy = 0; // sometimes keeps an extra refcount on itself |
|
|
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); |
179 | } |
195 | } |
180 | |
196 | |
181 | // connect the player with a specific client |
197 | // connect the player with a specific client |
182 | // also changed, rationalises, and fixes some incorrect settings |
198 | // also changes, rationalises, and fixes some incorrect settings |
183 | void |
199 | void |
184 | player::connect (client *ns) |
200 | player::connect (client *ns) |
185 | { |
201 | { |
186 | this->ns = ns; |
202 | this->ns = ns; |
187 | ns->pl = this; |
203 | ns->pl = this; |
188 | |
204 | |
189 | next = first_player; |
205 | run_on = 0; |
190 | first_player = this; |
206 | fire_on = 0; |
|
|
207 | ob->close_container (); //TODO: client-specific |
191 | |
208 | |
192 | ns->update_look = 0; |
209 | ns->update_look = 0; |
193 | ns->look_position = 0; |
210 | ns->look_position = 0; |
194 | |
211 | |
195 | clear_los (ob); |
212 | clear_los (this); |
|
|
213 | |
|
|
214 | ns->reset_stats (); |
196 | |
215 | |
197 | /* make sure he's a player -- needed because of class change. */ |
216 | /* make sure he's a player -- needed because of class change. */ |
198 | ob->type = PLAYER; // we are paranoid |
217 | ob->type = PLAYER; // we are paranoid |
199 | ob->race = ob->arch->clone.race; |
218 | ob->race = ob->arch->race; |
200 | |
|
|
201 | if (!legal_range (ob, shoottype)) |
|
|
202 | shoottype = range_none; |
|
|
203 | |
219 | |
204 | ob->carrying = sum_weight (ob); |
220 | ob->carrying = sum_weight (ob); |
205 | link_player_skills (ob); |
221 | link_player_skills (ob); |
206 | |
222 | |
207 | CLEAR_FLAG (ob, FLAG_NO_FIX_PLAYER); |
223 | CLEAR_FLAG (ob, FLAG_NO_FIX_PLAYER); |
208 | |
224 | |
209 | assign (title, ob->arch->clone.name); |
225 | assign (title, ob->arch->object::name); |
210 | |
|
|
211 | /* can_use_shield is a new flag. However, the can_use.. seems to largely come |
|
|
212 | * from the class, and not race. I don't see any way to get the class information |
|
|
213 | * to then update this. I don't think this will actually break anything - anyone |
|
|
214 | * that can use armour should be able to use a shield. What this may 'break' |
|
|
215 | * are features new characters get, eg, if someone starts up with a Q, they |
|
|
216 | * should be able to use a shield. However, old Q's won't get that advantage. |
|
|
217 | */ |
|
|
218 | if (QUERY_FLAG (ob, FLAG_USE_ARMOUR)) |
|
|
219 | SET_FLAG (ob, FLAG_USE_SHIELD); |
|
|
220 | |
226 | |
221 | /* if it's a dragon player, set the correct title here */ |
227 | /* if it's a dragon player, set the correct title here */ |
222 | if (is_dragon_pl (ob)) |
228 | if (is_dragon_pl (ob)) |
223 | { |
229 | { |
224 | object *tmp, *abil = 0, *skin = 0; |
230 | object *tmp, *abil = 0, *skin = 0; |
225 | |
231 | |
226 | shstr_cmp dragon_ability_force ("dragon_ability_force"); |
|
|
227 | shstr_cmp dragon_skin_force ("dragon_skin_force"); |
|
|
228 | |
|
|
229 | for (tmp = ob->inv; tmp; tmp = tmp->below) |
232 | for (tmp = ob->inv; tmp; tmp = tmp->below) |
230 | if (tmp->type == FORCE) |
233 | if (tmp->type == FORCE) |
231 | if (tmp->arch->name == dragon_ability_force) |
234 | if (tmp->arch->archname == shstr_dragon_ability_force) |
232 | abil = tmp; |
235 | abil = tmp; |
233 | else if (tmp->arch->name == dragon_skin_force) |
236 | else if (tmp->arch->archname == shstr_dragon_skin_force) |
234 | skin = tmp; |
237 | skin = tmp; |
235 | |
238 | |
236 | set_dragon_name (ob, abil, skin); |
239 | set_dragon_name (ob, abil, skin); |
237 | } |
240 | } |
238 | |
241 | |
239 | CLEAR_FLAG (ob, FLAG_FRIENDLY); |
|
|
240 | add_friendly_object (ob); |
|
|
241 | |
|
|
242 | LOG (llevInfo, "LOGIN: Player named %s from ip %s\n", &ob->name, ns->host); |
|
|
243 | |
|
|
244 | new_draw_info (NDI_UNIQUE, 0, ob, "Welcome Back!"); |
242 | new_draw_info (NDI_UNIQUE, 0, ob, "Welcome Back!"); |
245 | |
243 | |
246 | esrv_new_player (this, ob->weight + ob->carrying); |
244 | esrv_new_player (this, ob->weight + ob->carrying); |
247 | |
245 | |
|
|
246 | ob->flag [FLAG_READY_WEAPON] = false; |
|
|
247 | ob->flag [FLAG_READY_SKILL] = false; |
|
|
248 | ob->flag [FLAG_READY_BOW] = false; |
|
|
249 | |
|
|
250 | for (object *op = ob->inv; op; op = op->below) |
|
|
251 | if (op->flag [FLAG_APPLIED]) |
|
|
252 | switch (op->type) |
|
|
253 | { |
|
|
254 | case SKILL: |
|
|
255 | ob->flag [FLAG_APPLIED] = false; |
|
|
256 | break; |
|
|
257 | |
|
|
258 | case WAND: |
|
|
259 | case ROD: |
|
|
260 | case HORN: |
|
|
261 | case BOW: |
|
|
262 | ranged_ob = op; |
|
|
263 | break; |
|
|
264 | |
|
|
265 | case WEAPON: |
|
|
266 | combat_ob = op; |
|
|
267 | break; |
|
|
268 | } |
|
|
269 | |
|
|
270 | ob->change_weapon (combat_ob ? combat_ob : ranged_ob); |
248 | ob->update_stats (); |
271 | ob->update_stats (); |
|
|
272 | |
249 | ns->floorbox_update (); |
273 | ns->floorbox_update (); |
250 | |
|
|
251 | esrv_send_inventory (ob, ob); |
274 | esrv_send_inventory (ob, ob); |
252 | esrv_add_spells (this, 0); |
275 | esrv_add_spells (this, 0); |
253 | |
276 | |
254 | ob->activate (1); |
277 | activate (); |
255 | enter_map (); |
|
|
256 | |
278 | |
257 | send_rules (ob); |
279 | send_rules (ob); |
258 | send_news (ob); |
280 | send_news (ob); |
259 | display_motd (ob); |
281 | display_motd (ob); |
|
|
282 | |
|
|
283 | INVOKE_PLAYER (CONNECT, this); |
260 | INVOKE_PLAYER (LOGIN, this); |
284 | INVOKE_PLAYER (LOGIN, this); |
261 | } |
285 | } |
262 | |
286 | |
263 | void |
287 | void |
264 | player::disconnect () |
288 | player::disconnect () |
265 | { |
289 | { |
266 | if (ob) |
290 | if (ob) |
267 | ob->deactivate (1); |
291 | { |
|
|
292 | ob->close_container (); //TODO: client-specific |
|
|
293 | ob->drop_unpaid_items (); |
|
|
294 | } |
268 | |
295 | |
269 | //TODO: don't be so harsh and destroy :) |
|
|
270 | if (ns) |
296 | if (ns) |
271 | { |
297 | { |
272 | if (enable_save) |
298 | if (active) |
273 | INVOKE_PLAYER (LOGOUT, this, ARG_INT (0)); |
299 | INVOKE_PLAYER (LOGOUT, this, ARG_INT (0)); |
274 | |
300 | |
275 | client *ns = this->ns; |
301 | INVOKE_PLAYER (DISCONNECT, this); |
276 | ns->send_packet ("goodbye"); |
302 | |
277 | ns->flush (); |
303 | ns->reset_stats (); |
278 | ns->pl = 0; |
304 | ns->pl = 0; |
279 | this->ns = 0; |
305 | ns = 0; |
280 | |
|
|
281 | ns->destroy (); |
|
|
282 | destroy (); |
|
|
283 | } |
306 | } |
|
|
307 | |
|
|
308 | observe = ob; |
|
|
309 | |
|
|
310 | deactivate (); |
284 | } |
311 | } |
285 | |
312 | |
286 | // the need for this function can be explained |
313 | // the need for this function can be explained |
287 | // by load_object not returning the object |
314 | // by load_object not returning the object |
288 | void |
315 | void |
289 | player::set_object (object *op) |
316 | player::set_object (object *op) |
290 | { |
317 | { |
291 | ob = op; |
318 | ob = observe = op; |
292 | ob->contr = this; /* this aren't yet in archetype */ |
319 | ob->contr = this; /* this aren't yet in archetype */ |
293 | |
320 | |
|
|
321 | ob->speed = 1.0f; |
294 | ob->speed_left = 0.5; |
322 | ob->speed_left = 0.5f; |
295 | ob->speed = 1.0; |
323 | |
296 | ob->direction = 5; /* So player faces south */ |
324 | ob->direction = 5; /* So player faces south */ |
297 | ob->stats.wc = 2; |
325 | } |
298 | ob->run_away = 25; /* Then we panick... */ |
|
|
299 | |
326 | |
300 | set_first_map (ob); |
327 | void |
301 | enter_map (); |
328 | player::set_observe (object *op) |
302 | |
329 | { |
303 | ob->roll_stats (); |
330 | observe = op ? op : ob; |
|
|
331 | do_los = 1; |
304 | } |
332 | } |
305 | |
333 | |
306 | player::player () |
334 | player::player () |
307 | { |
335 | { |
308 | /* There are some elements we want initialized to non zero value - |
336 | /* There are some elements we want initialised to non zero value - |
309 | * we deal with that below this point. |
337 | * we deal with that below this point. |
310 | */ |
338 | */ |
311 | outputs_sync = 16; /* Every 2 seconds */ |
339 | outputs_sync = 4; |
312 | outputs_count = 8; /* Keeps present behaviour */ |
340 | outputs_count = 4; |
313 | unapply = unapply_nochoice; |
341 | unapply = unapply_nochoice; |
314 | |
342 | |
315 | assign (savebed_map, first_map_path); /* Init. respawn position */ |
343 | savebed_map = first_map_path; /* Init. respawn position */ |
316 | |
344 | |
317 | gen_sp_armour = 10; |
345 | gen_sp_armour = 10; |
318 | last_speed = -1; |
|
|
319 | shoottype = range_none; |
|
|
320 | bowtype = bow_normal; |
346 | bowtype = bow_normal; |
321 | petmode = pet_normal; |
347 | petmode = pet_normal; |
322 | listening = 10; |
348 | listening = 10; |
323 | usekeys = containers; |
349 | usekeys = containers; |
324 | last_weapon_sp = -1; |
|
|
325 | peaceful = 1; /* default peaceful */ |
350 | peaceful = 1; /* default peaceful */ |
326 | do_los = 1; |
351 | do_los = 1; |
327 | |
352 | |
328 | /* we need to clear these to -1 and not zero - otherwise, |
353 | weapon_sp = 1.0f; |
329 | * if a player quits and starts a new character, we wont |
354 | weapon_sp_left = 0.5f; |
330 | * send new values to the client, as things like exp start |
|
|
331 | * at zero. |
|
|
332 | */ |
|
|
333 | for (int i = 0; i < NUM_SKILLS; i++) |
|
|
334 | last_skill_exp[i] = -1; |
|
|
335 | |
|
|
336 | for (int i = 0; i < NROFATTACKS; i++) |
|
|
337 | last_resist[i] = -1; |
|
|
338 | |
|
|
339 | last_stats.exp = -1; |
|
|
340 | last_weight = (uint32) - 1; |
|
|
341 | } |
355 | } |
342 | |
356 | |
343 | void |
357 | void |
344 | player::do_destroy () |
358 | player::do_destroy () |
345 | { |
359 | { |
346 | disconnect (); |
360 | disconnect (); |
347 | |
361 | |
348 | save (false); |
|
|
349 | enable_save = false; |
|
|
350 | |
|
|
351 | attachable::do_destroy (); |
362 | attachable::do_destroy (); |
352 | |
|
|
353 | terminate_all_pets (ob); |
|
|
354 | |
|
|
355 | if (first_player != this) |
|
|
356 | { |
|
|
357 | player *prev = first_player; |
|
|
358 | |
|
|
359 | while (prev && prev->next && prev->next != this) |
|
|
360 | prev = prev->next; |
|
|
361 | |
|
|
362 | if (prev->next != this) |
|
|
363 | { |
|
|
364 | LOG (llevError, "Free_player: Can't find previous player.\n"); |
|
|
365 | abort (); |
|
|
366 | } |
|
|
367 | |
|
|
368 | prev->next = next; |
|
|
369 | } |
|
|
370 | else |
|
|
371 | first_player = next; |
|
|
372 | |
363 | |
373 | if (ob) |
364 | if (ob) |
374 | { |
365 | { |
375 | ob->destroy_inv (false); |
366 | ob->destroy_inv (false); |
376 | ob->destroy (); |
367 | ob->destroy (); |
377 | } |
368 | } |
|
|
369 | |
|
|
370 | ob = observe = 0; |
378 | } |
371 | } |
379 | |
372 | |
380 | player::~player () |
373 | player::~player () |
381 | { |
374 | { |
382 | /* Clear item stack */ |
375 | /* Clear item stack */ |
… | |
… | |
391 | player::create () |
384 | player::create () |
392 | { |
385 | { |
393 | player *pl = new player; |
386 | player *pl = new player; |
394 | |
387 | |
395 | pl->set_object (arch_to_object (get_player_archetype (0))); |
388 | pl->set_object (arch_to_object (get_player_archetype (0))); |
|
|
389 | |
|
|
390 | pl->ob->roll_stats (); |
|
|
391 | pl->ob->stats.wc = 2; |
|
|
392 | pl->ob->run_away = 25; /* Then we panick... */ |
|
|
393 | |
|
|
394 | set_first_map (pl->ob); |
396 | |
395 | |
397 | return pl; |
396 | return pl; |
398 | } |
397 | } |
399 | |
398 | |
400 | /* |
399 | /* |
… | |
… | |
403 | * Note: there MUST be at least one player archetype! |
402 | * Note: there MUST be at least one player archetype! |
404 | */ |
403 | */ |
405 | archetype * |
404 | archetype * |
406 | get_player_archetype (archetype *at) |
405 | get_player_archetype (archetype *at) |
407 | { |
406 | { |
408 | archetype *start = at; |
407 | archvec::iterator i = at ? archetypes.find (at) : archetypes.begin (); |
409 | |
408 | |
410 | for (;;) |
409 | for (;;) |
411 | { |
410 | { |
412 | if (at == NULL || at->next == NULL) |
411 | if (++i == archetypes.end ()) |
413 | at = first_archetype; |
412 | i = archetypes.begin (); |
414 | else |
413 | else if (*i == at) |
415 | at = at->next; |
414 | cleanup ("not a single player archetype found"); |
416 | |
415 | |
417 | if (at->clone.type == PLAYER) |
416 | if ((*i)->type == PLAYER) |
418 | return at; |
417 | return *i; |
419 | |
|
|
420 | if (at == start) |
|
|
421 | { |
|
|
422 | LOG (llevError, "No Player archetypes\n"); |
|
|
423 | exit (-1); |
|
|
424 | } |
|
|
425 | } |
418 | } |
426 | } |
419 | } |
427 | |
420 | |
428 | object * |
421 | object * |
429 | get_nearest_player (object *mon) |
422 | get_nearest_player (object *mon) |
… | |
… | |
431 | object *op = NULL; |
424 | object *op = NULL; |
432 | objectlink *ol; |
425 | objectlink *ol; |
433 | unsigned lastdist; |
426 | unsigned lastdist; |
434 | rv_vector rv; |
427 | rv_vector rv; |
435 | |
428 | |
436 | for (ol = first_friendly_object, lastdist = 1000; ol != NULL; ol = ol->next) |
429 | for (ol = first_friendly_object, lastdist = 1000; ol; ol = ol->next) |
437 | { |
430 | { |
438 | /* We should not find free objects on this friendly list, but it |
|
|
439 | * does periodically happen. Given that, lets deal with it. |
|
|
440 | * While unlikely, it is possible the next object on the friendly |
|
|
441 | * list is also free, so encapsulate this in a while loop. |
|
|
442 | */ |
|
|
443 | while (QUERY_FLAG (ol->ob, FLAG_FREED) || !QUERY_FLAG (ol->ob, FLAG_FRIENDLY)) |
|
|
444 | { |
|
|
445 | object *tmp = ol->ob; |
|
|
446 | |
|
|
447 | /* Can't do much more other than log the fact, because the object |
|
|
448 | * itself will have been cleared. |
|
|
449 | */ |
|
|
450 | LOG (llevDebug, "get_nearest_player: Found free/non friendly object on friendly list\n"); |
|
|
451 | ol = ol->next; |
|
|
452 | remove_friendly_object (tmp); |
|
|
453 | if (!ol) |
|
|
454 | return op; |
|
|
455 | } |
|
|
456 | |
|
|
457 | /* Remove special check for player from this. First, it looks to cause |
|
|
458 | * some crashes (ol->ob->contr not set properly?), but secondly, a more |
|
|
459 | * complicated method of state checking would be needed in any case - |
|
|
460 | * as it was, a clever player could type quit, and the function would |
|
|
461 | * skip them over while waiting for confirmation. Remove |
|
|
462 | * on_same_map check, as can_detect_enemy also does this |
|
|
463 | */ |
|
|
464 | if (!can_detect_enemy (mon, ol->ob, &rv)) |
431 | if (!can_detect_enemy (mon, ol->ob, &rv)) |
465 | continue; |
432 | continue; |
466 | |
433 | |
467 | if (lastdist > rv.distance) |
434 | if (lastdist > rv.distance) |
468 | { |
435 | { |
… | |
… | |
544 | x = mon->x; |
511 | x = mon->x; |
545 | y = mon->y; |
512 | y = mon->y; |
546 | m = mon->map; |
513 | m = mon->map; |
547 | dir = rv.direction; |
514 | dir = rv.direction; |
548 | lastdir = firstdir = rv.direction; /* perhaps we stand next to pl, init firstdir too */ |
515 | lastdir = firstdir = rv.direction; /* perhaps we stand next to pl, init firstdir too */ |
549 | diff = FABS (rv.distance_x) > FABS (rv.distance_y) ? FABS (rv.distance_x) : FABS (rv.distance_y); |
516 | diff = ::max (abs (rv.distance_x), abs (rv.distance_y)); |
|
|
517 | |
550 | /* If we can't solve it within the search distance, return now. */ |
518 | /* If we can't solve it within the search distance, return now. */ |
551 | if (diff > max) |
519 | if (diff > max) |
552 | return 0; |
520 | return 0; |
|
|
521 | |
553 | while (diff > 1 && max > 0) |
522 | while (diff > 1 && max > 0) |
554 | { |
523 | { |
555 | lastx = x; |
524 | lastx = x; |
556 | lasty = y; |
525 | lasty = y; |
557 | lastmap = m; |
526 | lastmap = m; |
… | |
… | |
639 | max--; |
608 | max--; |
640 | lastdir = dir; |
609 | lastdir = dir; |
641 | if (!firstdir) |
610 | if (!firstdir) |
642 | firstdir = dir; |
611 | firstdir = dir; |
643 | } |
612 | } |
|
|
613 | |
644 | if (diff <= 1) |
614 | if (diff <= 1) |
645 | { |
615 | { |
646 | /* Recalculate diff (distance) because we may not have actually |
616 | /* Recalculate diff (distance) because we may not have actually |
647 | * headed toward player for entire distance. |
617 | * headed toward player for entire distance. |
648 | */ |
618 | */ |
649 | get_rangevector_from_mapcoord (m, x, y, pl, &rv, 0); |
619 | get_rangevector_from_mapcoord (m, x, y, pl, &rv, 0); |
650 | diff = FABS (rv.distance_x) > FABS (rv.distance_y) ? FABS (rv.distance_x) : FABS (rv.distance_y); |
620 | diff = ::max (abs (rv.distance_x), abs (rv.distance_y)); |
651 | } |
621 | } |
|
|
622 | |
652 | if (diff > max) |
623 | if (diff > max) |
653 | return 0; |
624 | return 0; |
654 | } |
625 | } |
|
|
626 | |
655 | /* If we reached the max, didn't find a direction in time */ |
627 | /* If we reached the max, didn't find a direction in time */ |
656 | if (!max) |
628 | if (!max) |
657 | return 0; |
629 | return 0; |
658 | |
630 | |
659 | return firstdir; |
631 | return firstdir; |
… | |
… | |
773 | roll_stat (void) |
745 | roll_stat (void) |
774 | { |
746 | { |
775 | int a[4], i, j, k; |
747 | int a[4], i, j, k; |
776 | |
748 | |
777 | for (i = 0; i < 4; i++) |
749 | for (i = 0; i < 4; i++) |
778 | a[i] = (int) RANDOM () % 6 + 1; |
750 | a[i] = (int) rndm (6) + 1; |
779 | |
751 | |
780 | for (i = 0, j = 0, k = 7; i < 4; i++) |
752 | for (i = 0, j = 0, k = 7; i < 4; i++) |
781 | if (a[i] < k) |
753 | if (a[i] < k) |
782 | k = a[i], j = i; |
754 | k = a[i], j = i; |
783 | |
755 | |
… | |
… | |
789 | } |
761 | } |
790 | |
762 | |
791 | void |
763 | void |
792 | object::roll_stats () |
764 | object::roll_stats () |
793 | { |
765 | { |
794 | int statsort [7]; |
766 | int statsort [NUM_STATS]; |
795 | |
767 | |
796 | for (;;) |
768 | for (;;) |
797 | { |
769 | { |
798 | int sum = 0; |
770 | int sum = 0; |
799 | for (int i = 7; i--; ) |
771 | for (int i = NUM_STATS; i--; ) |
800 | sum += statsort [i] = roll_stat (); |
772 | sum += statsort [i] = roll_stat (); |
801 | |
773 | |
802 | if (sum >= 82 && sum <= 116) |
774 | if (sum >= 82 && sum <= 116) |
803 | break; |
775 | break; |
804 | } |
776 | } |
805 | |
777 | |
806 | // Sort the stats so that rerolling is easier... |
778 | // Sort the stats so that rerolling is easier... |
807 | std::sort (statsort, statsort + 7, std::greater<int>()); |
779 | std::sort (statsort, statsort + NUM_STATS, std::greater<int>()); |
808 | |
780 | |
|
|
781 | for (int i = 0; i < NUM_STATS; ++i) |
809 | stats.Str = statsort[0]; |
782 | stats.stat (i) = statsort [i]; |
810 | stats.Dex = statsort[1]; |
|
|
811 | stats.Con = statsort[2]; |
|
|
812 | stats.Int = statsort[3]; |
|
|
813 | stats.Wis = statsort[4]; |
|
|
814 | stats.Pow = statsort[5]; |
|
|
815 | stats.Cha = statsort[6]; |
|
|
816 | |
783 | |
817 | stats.exp = 0; |
784 | stats.exp = 0; |
818 | stats.ac = 0; |
785 | stats.ac = 0; |
819 | |
786 | |
820 | stats.hp = stats.maxhp; |
787 | stats.hp = stats.maxhp; |
… | |
… | |
832 | } |
799 | } |
833 | |
800 | |
834 | void |
801 | void |
835 | object::swap_stats (int a, int b) |
802 | object::swap_stats (int a, int b) |
836 | { |
803 | { |
837 | int tmp = get_attr_value (&contr->orig_stats, a); |
804 | swap (contr->orig_stats.stat (a), contr->orig_stats.stat (b)); |
838 | set_attr_value (&contr->orig_stats, a, get_attr_value (&contr->orig_stats, b)); |
|
|
839 | set_attr_value (&contr->orig_stats, b, tmp); |
|
|
840 | |
805 | |
|
|
806 | for (int i = 0; i < NUM_STATS; ++i) |
841 | stats.Str = contr->orig_stats.Str; |
807 | stats.stat (i) = contr->orig_stats.stat (i); |
842 | stats.Dex = contr->orig_stats.Dex; |
|
|
843 | stats.Con = contr->orig_stats.Con; |
|
|
844 | stats.Int = contr->orig_stats.Int; |
|
|
845 | stats.Wis = contr->orig_stats.Wis; |
|
|
846 | stats.Pow = contr->orig_stats.Pow; |
|
|
847 | stats.Cha = contr->orig_stats.Cha; |
|
|
848 | |
808 | |
849 | //TODO: the following code looks so borked and should, at the very least, |
809 | //TODO: the following code looks so borked and should, at the very least, |
850 | // be merged with the similar code in roll_stats |
810 | // be merged with the similar code in roll_stats |
851 | stats.ac = 0; |
811 | stats.ac = 0; |
852 | |
812 | |
… | |
… | |
883 | * appropriate action with it (change race, or other things). |
843 | * appropriate action with it (change race, or other things). |
884 | * The function name is for historical reasons - now we have |
844 | * The function name is for historical reasons - now we have |
885 | * separate race and class; this actually changes the RACE, |
845 | * separate race and class; this actually changes the RACE, |
886 | * not the class. |
846 | * not the class. |
887 | */ |
847 | */ |
888 | int |
848 | void |
889 | key_change_class (object *op, char key) |
849 | player::chargen_race_done () |
890 | { |
850 | { |
891 | int tmp_loop; |
|
|
892 | |
|
|
893 | if (key == 'd' || key == 'D') |
|
|
894 | { |
|
|
895 | char buf[MAX_BUF]; |
|
|
896 | |
|
|
897 | /* this must before then initial items are given */ |
851 | /* this must before then initial items are given */ |
898 | esrv_new_player (op->contr, op->weight + op->carrying); |
852 | esrv_new_player (ob->contr, ob->weight + ob->carrying); |
899 | |
853 | |
900 | treasurelist *tl = find_treasurelist ("starting_wealth"); |
854 | treasurelist *tl = treasurelist::find ("starting_wealth"); |
901 | if (tl) |
855 | if (tl) |
902 | create_treasure (tl, op, 0, 0, 0); |
856 | create_treasure (tl, ob, 0, 0, 0); |
903 | |
857 | |
904 | INVOKE_PLAYER (BIRTH, op->contr); |
858 | INVOKE_PLAYER (BIRTH, ob->contr); |
905 | INVOKE_PLAYER (LOGIN, op->contr); |
859 | INVOKE_PLAYER (LOGIN, ob->contr); |
906 | |
860 | |
907 | op->contr->ns->state = ST_PLAYING; |
861 | ob->contr->ns->state = ST_PLAYING; |
908 | |
862 | |
909 | if (op->msg) |
863 | if (ob->msg) |
910 | op->msg = NULL; |
864 | ob->msg = 0; |
911 | |
865 | |
912 | /* We create this now because some of the unique maps will need it |
866 | /* We create this now because some of the unique maps will need it |
913 | * to save here. |
867 | * to save here. |
914 | */ |
868 | */ |
|
|
869 | { |
|
|
870 | char buf[MAX_BUF]; |
915 | sprintf (buf, "%s/%s/%s", settings.localdir, settings.playerdir, &op->name); |
871 | sprintf (buf, "%s/%s/%s", settings.localdir, settings.playerdir, &ob->name); |
916 | make_path_to_file (buf); |
872 | make_path_to_file (buf); |
|
|
873 | } |
917 | |
874 | |
918 | #ifdef AUTOSAVE |
|
|
919 | op->contr->last_save_tick = pticks; |
|
|
920 | #endif |
|
|
921 | start_info (op); |
875 | start_info (ob); |
922 | CLEAR_FLAG (op, FLAG_WIZ); |
876 | CLEAR_FLAG (ob, FLAG_WIZ); |
923 | give_initial_items (op, op->randomitems); |
877 | give_initial_items (ob, ob->randomitems); |
924 | link_player_skills (op); |
878 | link_player_skills (ob); |
925 | esrv_send_inventory (op, op); |
879 | esrv_send_inventory (ob, ob); |
926 | op->update_stats (); |
880 | ob->update_stats (); |
927 | |
881 | |
928 | /* This moves the player to a different start map, if there |
882 | /* This moves the player to a different start map, if there |
929 | * is one for this race |
883 | * is one for this race |
930 | */ |
884 | */ |
931 | if (*first_map_ext_path) |
885 | if (*first_map_ext_path) |
932 | { |
886 | { |
933 | object *tmp; |
887 | object *tmp; |
934 | char mapname[MAX_BUF]; |
888 | char mapname[MAX_BUF]; |
935 | |
889 | |
936 | snprintf (mapname, MAX_BUF - 1, "%s/%s", first_map_ext_path, &op->arch->name); |
890 | snprintf (mapname, MAX_BUF - 1, "%s/%s", &first_map_ext_path, &ob->arch->archname); |
937 | tmp = object::create (); |
891 | tmp = object::create (); |
938 | EXIT_PATH (tmp) = mapname; |
892 | EXIT_PATH (tmp) = mapname; |
939 | EXIT_X (tmp) = op->x; |
893 | EXIT_X (tmp) = ob->x; |
940 | EXIT_Y (tmp) = op->y; |
894 | EXIT_Y (tmp) = ob->y; |
941 | op->enter_exit (tmp); /* we don't really care if it succeeded; |
895 | ob->enter_exit (tmp); /* we don't really care if it succeeded; |
942 | * if the map isn't there, then stay on the |
896 | * if the map isn't there, then stay on the |
943 | * default initial map */ |
897 | * default initial map */ |
944 | tmp->destroy (); |
898 | tmp->destroy (); |
945 | } |
899 | } |
946 | else |
900 | else |
947 | LOG (llevDebug, "first_map_ext_path not set\n"); |
901 | LOG (llevDebug, "first_map_ext_path not set\n"); |
|
|
902 | } |
948 | |
903 | |
949 | return 0; |
904 | void |
950 | } |
905 | player::chargen_race_next () |
951 | |
906 | { |
952 | /* Following actually changes the race - this is the default command |
907 | /* Following actually changes the race - this is the default command |
953 | * if we don't match with one of the options above. |
908 | * if we don't match with one of the options above. |
954 | */ |
909 | */ |
955 | |
910 | |
956 | tmp_loop = 0; |
911 | do |
957 | while (!tmp_loop) |
|
|
958 | { |
912 | { |
959 | shstr name = op->name; |
913 | shstr name = ob->name; |
960 | int x = op->x, y = op->y; |
914 | int x = ob->x, y = ob->y; |
961 | |
915 | |
962 | op->remove_statbonus (); |
916 | ob->remove_statbonus (); |
963 | op->remove (); |
917 | ob->remove (); |
964 | op->arch = get_player_archetype (op->arch); |
918 | ob->arch = get_player_archetype (ob->arch); |
965 | op->arch->clone.copy_to (op); |
919 | ob->arch->copy_to (ob); |
966 | op->instantiate (); |
920 | ob->instantiate (); |
967 | op->stats = op->contr->orig_stats; |
921 | ob->stats = ob->contr->orig_stats; |
968 | op->name = op->name_pl = name; |
922 | ob->name = ob->name_pl = name; |
969 | op->x = x; |
923 | ob->x = x; |
970 | op->y = y; |
924 | ob->y = y; |
971 | SET_ANIMATION (op, 2); /* So player faces south */ |
925 | SET_ANIMATION (ob, 2); /* So player faces south */ |
972 | insert_ob_in_map (op, op->map, op, 0); |
926 | insert_ob_in_map (ob, ob->map, ob, 0); |
973 | assign (op->contr->title, op->arch->clone.name); |
927 | assign (ob->contr->title, ob->arch->object::name); |
974 | op->add_statbonus (); |
928 | ob->add_statbonus (); |
975 | tmp_loop = allowed_class (op); |
|
|
976 | } |
929 | } |
|
|
930 | while (!allowed_class (ob)); |
977 | |
931 | |
978 | update_object (op, UP_OBJ_FACE); |
932 | update_object (ob, UP_OBJ_FACE); |
979 | esrv_update_item (UPD_FACE, op, op); |
933 | esrv_update_item (UPD_FACE, ob, ob); |
980 | op->update_stats (); |
934 | ob->update_stats (); |
981 | op->stats.hp = op->stats.maxhp; |
935 | ob->stats.hp = ob->stats.maxhp; |
982 | op->stats.sp = op->stats.maxsp; |
936 | ob->stats.sp = ob->stats.maxsp; |
983 | op->stats.grace = 0; |
937 | ob->stats.grace = 0; |
984 | |
|
|
985 | if (op->msg) |
|
|
986 | new_draw_info (NDI_BLUE, 0, op, op->msg); |
|
|
987 | |
|
|
988 | send_query (op->contr->ns, CS_QUERY_SINGLECHAR, "Press any key for the next race.\nPress `d' to play this race.\n"); |
|
|
989 | return 0; |
|
|
990 | } |
|
|
991 | |
|
|
992 | int |
|
|
993 | key_confirm_quit (object *op, char key) |
|
|
994 | { |
|
|
995 | if (key != 'y' && key != 'Y' && key != 'q' && key != 'Q') |
|
|
996 | { |
|
|
997 | op->contr->ns->state = ST_PLAYING; |
|
|
998 | new_draw_info (NDI_UNIQUE, 0, op, "OK, continuing to play."); |
|
|
999 | return 1; |
|
|
1000 | } |
|
|
1001 | |
|
|
1002 | INVOKE_PLAYER (LOGOUT, op->contr); |
|
|
1003 | INVOKE_PLAYER (QUIT, op->contr); |
|
|
1004 | |
|
|
1005 | op->contr->enable_save = false; |
|
|
1006 | |
|
|
1007 | terminate_all_pets (op); |
|
|
1008 | op->remove (); |
|
|
1009 | op->direction = 0; |
|
|
1010 | new_draw_info_format (NDI_UNIQUE | NDI_ALL, 5, NULL, "%s quits the game.", &op->name); |
|
|
1011 | |
|
|
1012 | strcpy (op->contr->killer, "quit"); |
|
|
1013 | check_score (op); |
|
|
1014 | op->contr->party = 0; |
|
|
1015 | op->contr->own_title[0] = '\0'; |
|
|
1016 | op->contr->destroy (); |
|
|
1017 | |
|
|
1018 | return 1; |
|
|
1019 | } |
938 | } |
1020 | |
939 | |
1021 | void |
940 | void |
1022 | flee_player (object *op) |
941 | flee_player (object *op) |
1023 | { |
942 | { |
… | |
… | |
1070 | /* Cornered, get rid of scared */ |
989 | /* Cornered, get rid of scared */ |
1071 | CLEAR_FLAG (op, FLAG_SCARED); |
990 | CLEAR_FLAG (op, FLAG_SCARED); |
1072 | op->enemy = NULL; |
991 | op->enemy = NULL; |
1073 | } |
992 | } |
1074 | |
993 | |
1075 | |
|
|
1076 | /* check_pick sees if there is stuff to be picked up/picks up stuff. |
994 | /* check_pick sees if there is stuff to be picked up/picks up stuff. |
1077 | * IT returns 1 if the player should keep on moving, 0 if he should |
995 | * It returns 1 if the player should keep on moving, 0 if he should |
1078 | * stop. |
996 | * stop. |
1079 | */ |
997 | */ |
1080 | int |
998 | int |
1081 | check_pick (object *op) |
999 | check_pick (object *op) |
1082 | { |
1000 | { |
1083 | object *tmp, *next; |
1001 | object *tmp, *next; |
1084 | int stop = 0; |
1002 | int stop = 0; |
1085 | int j, k, wvratio; |
1003 | int wvratio; |
1086 | char putstring[128], tmpstr[16]; |
1004 | char putstring[128]; |
1087 | |
1005 | |
1088 | /* if you're flying, you cna't pick up anything */ |
1006 | /* if you're flying, you cna't pick up anything */ |
1089 | if (op->move_type & MOVE_FLYING) |
1007 | if (op->move_type & MOVE_FLYING) |
1090 | return 1; |
1008 | return 1; |
1091 | |
1009 | |
… | |
… | |
1159 | if (tmp->name != NULL) |
1077 | if (tmp->name != NULL) |
1160 | sprintf (putstring, "item name: %s item type: %d weight/value: %d", |
1078 | sprintf (putstring, "item name: %s item type: %d weight/value: %d", |
1161 | &tmp->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1079 | &tmp->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1162 | else |
1080 | else |
1163 | sprintf (putstring, "item name: %s item type: %d weight/value: %d", |
1081 | sprintf (putstring, "item name: %s item type: %d weight/value: %d", |
1164 | &tmp->arch->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1082 | &tmp->arch->archname, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1165 | |
1083 | |
1166 | new_draw_info (NDI_UNIQUE, 0, op, putstring); |
1084 | new_draw_info (NDI_UNIQUE, 0, op, putstring); |
1167 | } |
1085 | } |
1168 | |
1086 | |
1169 | /* philosophy: |
1087 | /* philosophy: |
… | |
… | |
1244 | pick_up (op, tmp); |
1162 | pick_up (op, tmp); |
1245 | continue; |
1163 | continue; |
1246 | } |
1164 | } |
1247 | |
1165 | |
1248 | if (op->contr->mode & PU_READABLES) |
1166 | if (op->contr->mode & PU_READABLES) |
1249 | if (tmp->type == BOOK || tmp->type == SCROLL) |
1167 | if (tmp->type == BOOK || tmp->type == SCROLL || tmp->type == INSCRIBABLE) |
1250 | { |
1168 | { |
1251 | pick_up (op, tmp); |
1169 | pick_up (op, tmp); |
1252 | continue; |
1170 | continue; |
1253 | } |
1171 | } |
1254 | |
1172 | |
… | |
… | |
1362 | /* careful: chairs and tables are weapons! */ |
1280 | /* careful: chairs and tables are weapons! */ |
1363 | if (op->contr->mode & PU_ALLWEAPON) |
1281 | if (op->contr->mode & PU_ALLWEAPON) |
1364 | { |
1282 | { |
1365 | if (tmp->type == WEAPON && tmp->name != NULL) |
1283 | if (tmp->type == WEAPON && tmp->name != NULL) |
1366 | { |
1284 | { |
1367 | if (strstr (tmp->name, "table") == NULL && strstr (tmp->arch->name, "table") == NULL && |
1285 | if (strstr (tmp->name, "table") == NULL && strstr (tmp->arch->archname, "table") == NULL && |
1368 | strstr (tmp->name, "chair") && strstr (tmp->arch->name, "chair") == NULL) |
1286 | strstr (tmp->name, "chair") && strstr (tmp->arch->archname, "chair") == NULL) |
1369 | { |
1287 | { |
1370 | pick_up (op, tmp); |
1288 | pick_up (op, tmp); |
1371 | continue; |
1289 | continue; |
1372 | } |
1290 | } |
1373 | } |
1291 | } |
1374 | |
1292 | |
1375 | if (tmp->type == WEAPON && tmp->name == NULL) |
1293 | if (tmp->type == WEAPON && tmp->name == NULL) |
1376 | { |
1294 | { |
1377 | if (strstr (tmp->arch->name, "table") == NULL && strstr (tmp->arch->name, "chair") == NULL) |
1295 | if (strstr (tmp->arch->archname, "table") == NULL && strstr (tmp->arch->archname, "chair") == NULL) |
1378 | { |
1296 | { |
1379 | pick_up (op, tmp); |
1297 | pick_up (op, tmp); |
1380 | continue; |
1298 | continue; |
1381 | } |
1299 | } |
1382 | } |
1300 | } |
… | |
… | |
1407 | if (tmp->name != NULL) |
1325 | if (tmp->name != NULL) |
1408 | { |
1326 | { |
1409 | fprintf (stderr, "%s", tmp->name); |
1327 | fprintf (stderr, "%s", tmp->name); |
1410 | } |
1328 | } |
1411 | else |
1329 | else |
1412 | fprintf (stderr, "%s", tmp->arch->name); |
1330 | fprintf (stderr, "%s", tmp->arch->archname); |
1413 | fprintf (stderr, ",%d] = ", tmp->type); |
1331 | fprintf (stderr, ",%d] = ", tmp->type); |
1414 | fprintf (stderr, "%d\n", (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1332 | fprintf (stderr, "%d\n", (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1415 | #endif |
1333 | #endif |
1416 | continue; |
1334 | continue; |
1417 | } |
1335 | } |
… | |
… | |
1428 | * found object is returned. |
1346 | * found object is returned. |
1429 | */ |
1347 | */ |
1430 | object * |
1348 | object * |
1431 | find_arrow (object *op, const char *type) |
1349 | find_arrow (object *op, const char *type) |
1432 | { |
1350 | { |
1433 | object *tmp = NULL; |
1351 | object *tmp = 0; |
1434 | |
1352 | |
1435 | for (op = op->inv; op; op = op->below) |
1353 | for (op = op->inv; op; op = op->below) |
1436 | if (!tmp && op->type == CONTAINER && op->race == type && QUERY_FLAG (op, FLAG_APPLIED)) |
1354 | if (!tmp && op->type == CONTAINER && op->race == type && QUERY_FLAG (op, FLAG_APPLIED)) |
1437 | tmp = find_arrow (op, type); |
1355 | tmp = find_arrow (op, type); |
1438 | else if (op->type == ARROW && op->race == type) |
1356 | else if (op->type == ARROW && op->race == type) |
1439 | return op; |
1357 | return op; |
|
|
1358 | |
1440 | return tmp; |
1359 | return tmp; |
1441 | } |
1360 | } |
1442 | |
1361 | |
1443 | /* |
1362 | /* |
1444 | * Similar to find_arrow, but looks for (roughly) the best arrow to use |
1363 | * 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 |
1364 | * 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 |
1365 | * 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. |
1366 | * the hall. Failing that it does it's best to pick the highest plus arrow. |
1448 | */ |
1367 | */ |
1449 | |
|
|
1450 | object * |
1368 | object * |
1451 | find_better_arrow (object *op, object *target, const char *type, int *better) |
1369 | find_better_arrow (object *op, object *target, const char *type, int *better) |
1452 | { |
1370 | { |
1453 | object *tmp = NULL, *arrow, *ntmp; |
1371 | object *tmp = NULL, *arrow, *ntmp; |
1454 | int attacknum, attacktype, betterby = 0, i; |
1372 | int attacknum, attacktype, betterby = 0, i; |
… | |
… | |
1487 | else |
1405 | else |
1488 | { |
1406 | { |
1489 | for (attacknum = 0; attacknum < NROFATTACKS; attacknum++) |
1407 | for (attacknum = 0; attacknum < NROFATTACKS; attacknum++) |
1490 | { |
1408 | { |
1491 | attacktype = 1 << attacknum; |
1409 | attacktype = 1 << attacknum; |
1492 | if ((arrow->attacktype & attacktype) && (target->arch->clone.resist[attacknum]) < 0) |
1410 | if ((arrow->attacktype & attacktype) && (target->arch->resist[attacknum]) < 0) |
1493 | if (((arrow->magic + arrow->stats.dam) * (100 - target->arch->clone.resist[attacknum]) / 100) > betterby) |
1411 | if (((arrow->magic + arrow->stats.dam) * (100 - target->arch->resist[attacknum]) / 100) > betterby) |
1494 | { |
1412 | { |
1495 | tmp = arrow; |
1413 | tmp = arrow; |
1496 | betterby = (arrow->magic + arrow->stats.dam) * (100 - target->arch->clone.resist[attacknum]) / 100; |
1414 | betterby = (arrow->magic + arrow->stats.dam) * (100 - target->arch->resist[attacknum]) / 100; |
1497 | } |
1415 | } |
1498 | } |
1416 | } |
1499 | if ((2 + arrow->magic + arrow->stats.dam) > betterby) |
1417 | if ((2 + arrow->magic + arrow->stats.dam) > betterby) |
1500 | { |
1418 | { |
1501 | tmp = arrow; |
1419 | tmp = arrow; |
… | |
… | |
1520 | * find_better_arrow to find a decent arrow to use. |
1438 | * find_better_arrow to find a decent arrow to use. |
1521 | * op = the shooter |
1439 | * op = the shooter |
1522 | * type = bow->race |
1440 | * type = bow->race |
1523 | * dir = fire direction |
1441 | * dir = fire direction |
1524 | */ |
1442 | */ |
1525 | |
|
|
1526 | object * |
1443 | object * |
1527 | pick_arrow_target (object *op, const char *type, int dir) |
1444 | pick_arrow_target (object *op, const char *type, int dir) |
1528 | { |
1445 | { |
1529 | object *tmp = NULL; |
1446 | object *tmp = NULL; |
1530 | maptile *m; |
1447 | maptile *m; |
… | |
… | |
1595 | */ |
1512 | */ |
1596 | int |
1513 | int |
1597 | fire_bow (object *op, object *part, object *arrow, int dir, int wc_mod, sint16 sx, sint16 sy) |
1514 | fire_bow (object *op, object *part, object *arrow, int dir, int wc_mod, sint16 sx, sint16 sy) |
1598 | { |
1515 | { |
1599 | object *left, *bow; |
1516 | object *left, *bow; |
1600 | int bowspeed, mflags; |
1517 | int mflags; |
1601 | maptile *m; |
1518 | maptile *m; |
1602 | |
1519 | |
1603 | if (!dir) |
1520 | if (!dir) |
1604 | { |
1521 | { |
1605 | new_draw_info (NDI_UNIQUE, 0, op, "You can't shoot yourself!"); |
1522 | new_draw_info (NDI_UNIQUE, 0, op, "You can't shoot yourself!"); |
1606 | return 0; |
1523 | return 0; |
1607 | } |
1524 | } |
1608 | |
1525 | |
1609 | if (op->type == PLAYER) |
1526 | if (op->contr) |
1610 | bow = op->contr->ranges[range_bow]; |
1527 | bow = op->current_weapon; |
1611 | else |
1528 | else |
1612 | { |
1529 | { |
1613 | for (bow = op->inv; bow; bow = bow->below) |
1530 | for (bow = op->inv; bow; bow = bow->below) |
1614 | /* Don't check for applied - monsters don't apply bows - in that way, they |
1531 | /* 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. |
1532 | * don't need to switch back and forth between bows and weapons. |
… | |
… | |
1620 | if (!bow) |
1537 | if (!bow) |
1621 | { |
1538 | { |
1622 | LOG (llevError, "Range: bow without activated bow (%s).\n", &op->name); |
1539 | LOG (llevError, "Range: bow without activated bow (%s).\n", &op->name); |
1623 | return 0; |
1540 | return 0; |
1624 | } |
1541 | } |
|
|
1542 | |
|
|
1543 | // optimisation: move object to top so we will find it quickly again |
|
|
1544 | if (bow->below) |
|
|
1545 | { |
|
|
1546 | bow->remove (); |
|
|
1547 | op->insert (bow); |
|
|
1548 | } |
|
|
1549 | |
1625 | } |
1550 | } |
1626 | |
1551 | |
1627 | if (!bow->race || !bow->skill) |
1552 | if (!bow->race || !bow->skill) |
1628 | { |
1553 | { |
1629 | new_draw_info_format (NDI_UNIQUE, 0, op, "Your %s is broken.", &bow->name); |
1554 | new_draw_info_format (NDI_UNIQUE, 0, op, "Your %s is broken.", &bow->name); |
1630 | return 0; |
1555 | return 0; |
1631 | } |
1556 | } |
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 | |
1557 | |
1642 | if (arrow == NULL) |
1558 | if (arrow == NULL) |
1643 | { |
1559 | { |
1644 | if ((arrow = find_arrow (op, bow->race)) == NULL) |
1560 | if ((arrow = find_arrow (op, bow->race)) == NULL) |
1645 | { |
1561 | { |
1646 | if (op->type == PLAYER) |
1562 | if (op->type == PLAYER) |
1647 | new_draw_info_format (NDI_UNIQUE, 0, op, "You have no %s left.", &bow->race); |
1563 | 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 */ |
1564 | /* FLAG_READY_BOW will get reset if the monsters picks up some arrows */ |
1649 | else |
1565 | else |
1650 | CLEAR_FLAG (op, FLAG_READY_BOW); |
1566 | CLEAR_FLAG (op, FLAG_READY_BOW); |
|
|
1567 | |
1651 | return 0; |
1568 | return 0; |
1652 | } |
1569 | } |
1653 | } |
1570 | } |
1654 | |
1571 | |
1655 | mflags = get_map_flags (op->map, &m, sx, sy, &sx, &sy); |
1572 | mflags = get_map_flags (op->map, &m, sx, sy, &sx, &sy); |
… | |
… | |
1679 | |
1596 | |
1680 | arrow->set_owner (op); |
1597 | arrow->set_owner (op); |
1681 | arrow->skill = bow->skill; |
1598 | arrow->skill = bow->skill; |
1682 | arrow->direction = dir; |
1599 | arrow->direction = dir; |
1683 | |
1600 | |
|
|
1601 | arrow->stats.sp = arrow->stats.wc; /* save original wc, dam, attacktype and slaying */ |
|
|
1602 | arrow->stats.hp = arrow->stats.dam; |
|
|
1603 | arrow->stats.grace = arrow->attacktype; |
|
|
1604 | |
|
|
1605 | if (arrow->slaying) |
|
|
1606 | arrow->spellarg = strdup (arrow->slaying); |
|
|
1607 | |
|
|
1608 | #if 0 |
|
|
1609 | if (player *pl = op->contr) |
|
|
1610 | { |
|
|
1611 | float speed = pl->weapon_sp; |
|
|
1612 | |
|
|
1613 | /* penalize ROF for bestarrow */ |
|
|
1614 | if (pl->bowtype == bow_bestarrow) |
|
|
1615 | speed *= .9f; |
|
|
1616 | else |
|
|
1617 | speed *= 1.f + dex_bonus[op->stats.Dex] * .2f; |
|
|
1618 | |
|
|
1619 | op->speed_left += speed - op->speed; |
|
|
1620 | } |
|
|
1621 | #endif |
|
|
1622 | |
|
|
1623 | SET_ANIMATION (arrow, arrow->direction); |
|
|
1624 | |
|
|
1625 | /* update the speed */ |
|
|
1626 | arrow->speed = ((bow->flag [FLAG_NO_STRENGTH] ? 0 : dam_bonus[op->stats.Str]) + bow->magic + arrow->magic) / 5.f |
|
|
1627 | + bow->stats.dam / 7.f; |
|
|
1628 | |
|
|
1629 | arrow->set_speed (max (arrow->speed, 2.f)); |
|
|
1630 | arrow->speed_left = 0; |
|
|
1631 | |
|
|
1632 | int wc = op->stats.wc + wc_mod - arrow->magic - arrow->stats.wc; |
|
|
1633 | |
1684 | if (op->type == PLAYER) |
1634 | if (op->type == PLAYER) |
1685 | { |
1635 | { |
1686 | op->speed_left = 0.01 - (float) FABS (op->speed) * 100 / bowspeed; |
|
|
1687 | op->update_stats (); |
|
|
1688 | } |
|
|
1689 | |
|
|
1690 | SET_ANIMATION (arrow, arrow->direction); |
|
|
1691 | arrow->stats.sp = arrow->stats.wc; /* save original wc and dam */ |
|
|
1692 | arrow->stats.hp = arrow->stats.dam; |
|
|
1693 | arrow->stats.grace = arrow->attacktype; |
|
|
1694 | if (arrow->slaying != NULL) |
|
|
1695 | arrow->spellarg = strdup (arrow->slaying); |
|
|
1696 | |
|
|
1697 | /* Note that this was different for monsters - they got their level |
|
|
1698 | * added to the damage. I think the strength bonus is more proper. |
|
|
1699 | */ |
|
|
1700 | |
|
|
1701 | arrow->stats.dam += (QUERY_FLAG (bow, FLAG_NO_STRENGTH) ? 0 : dam_bonus[op->stats.Str]) + bow->stats.dam + bow->magic + arrow->magic; |
|
|
1702 | |
|
|
1703 | /* update the speed */ |
|
|
1704 | arrow->speed = (float) ((QUERY_FLAG (bow, FLAG_NO_STRENGTH) ? |
|
|
1705 | 0 : dam_bonus[op->stats.Str]) + bow->magic + arrow->magic) / 5.0 + (float) bow->stats.dam / 7.0; |
|
|
1706 | |
|
|
1707 | arrow->set_speed (max (arrow->speed, 1.0)); |
|
|
1708 | arrow->speed_left = 0; |
|
|
1709 | |
|
|
1710 | if (op->type == PLAYER) |
|
|
1711 | { |
|
|
1712 | arrow->stats.wc = 20 - bow->magic - arrow->magic - |
|
|
1713 | (op->chosen_skill ? op->chosen_skill->level : op->level) - |
|
|
1714 | dex_bonus[op->stats.Dex] - thaco_bonus[op->stats.Str] - arrow->stats.wc - bow->stats.wc + wc_mod; |
|
|
1715 | |
|
|
1716 | arrow->level = op->chosen_skill ? op->chosen_skill->level : op->level; |
1636 | arrow->level = op->chosen_skill ? op->chosen_skill->level : op->level; |
|
|
1637 | wc -= dex_bonus[op->stats.Dex]; |
|
|
1638 | |
|
|
1639 | if (!arrow->slaying) |
|
|
1640 | arrow->slaying = op->slaying; |
|
|
1641 | |
|
|
1642 | arrow->attacktype |= op->attacktype; |
1717 | } |
1643 | } |
1718 | else |
1644 | else |
1719 | { |
1645 | { |
1720 | arrow->stats.wc = op->stats.wc - bow->magic - arrow->magic - arrow->stats.wc + wc_mod; |
|
|
1721 | arrow->level = op->level; |
1646 | arrow->level = op->level; |
1722 | } |
1647 | arrow->stats.wc -= bow->magic; |
1723 | |
1648 | |
1724 | if (arrow->attacktype == AT_PHYSICAL) |
1649 | if (!arrow->slaying) |
|
|
1650 | arrow->slaying = bow->slaying; |
|
|
1651 | |
1725 | arrow->attacktype |= bow->attacktype; |
1652 | arrow->attacktype |= bow->attacktype; |
|
|
1653 | } |
1726 | |
1654 | |
1727 | if (bow->slaying) |
1655 | wc -= arrow->level; |
1728 | arrow->slaying = bow->slaying; |
1656 | arrow->stats.dam = clamp (arrow->stats.dam + op->stats.dam + arrow->magic, MIN_DAM, MAX_DAM); |
1729 | |
1657 | |
|
|
1658 | arrow->stats.wc = clamp (wc, MIN_WC, MAX_WC); |
1730 | arrow->move_type = MOVE_FLY_LOW; |
1659 | arrow->move_type = MOVE_FLY_LOW; |
1731 | arrow->move_on = MOVE_FLY_LOW | MOVE_WALK; |
1660 | arrow->move_on = MOVE_FLY_LOW | MOVE_WALK; |
1732 | |
1661 | |
1733 | play_sound_map (op->map, op->x, op->y, SOUND_FIRE_ARROW); |
1662 | op->play_sound (sound_find ("fire_arrow")); |
1734 | m->insert (arrow, sx, sy, op); |
1663 | m->insert (arrow, sx, sy, op); |
1735 | |
1664 | |
1736 | if (!arrow->destroyed ()) |
1665 | if (!arrow->destroyed ()) |
1737 | move_arrow (arrow); |
1666 | move_arrow (arrow); |
1738 | |
1667 | |
… | |
… | |
1759 | { |
1688 | { |
1760 | int ret = 0, wcmod = 0; |
1689 | int ret = 0, wcmod = 0; |
1761 | |
1690 | |
1762 | if (op->contr->bowtype == bow_bestarrow) |
1691 | if (op->contr->bowtype == bow_bestarrow) |
1763 | { |
1692 | { |
1764 | ret = fire_bow (op, op, pick_arrow_target (op, op->contr->ranges[range_bow]->race, dir), dir, 0, op->x, op->y); |
1693 | ret = fire_bow (op, op, pick_arrow_target (op, op->contr->ranged_ob->race, dir), dir, 0, op->x, op->y); |
1765 | } |
1694 | } |
1766 | else if (op->contr->bowtype >= bow_n && op->contr->bowtype <= bow_nw) |
1695 | else if (op->contr->bowtype >= bow_n && op->contr->bowtype <= bow_nw) |
1767 | { |
1696 | { |
1768 | if (!similar_direction (dir, op->contr->bowtype - bow_n + 1)) |
1697 | if (!similar_direction (dir, op->contr->bowtype - bow_n + 1)) |
1769 | wcmod = -1; |
1698 | wcmod = -1; |
… | |
… | |
1779 | else if (op->contr->bowtype == bow_spreadshot) |
1708 | else if (op->contr->bowtype == bow_spreadshot) |
1780 | { |
1709 | { |
1781 | ret |= fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1710 | ret |= fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1782 | ret |= fire_bow (op, op, NULL, absdir (dir - 1), -5, op->x, op->y); |
1711 | ret |= fire_bow (op, op, NULL, absdir (dir - 1), -5, op->x, op->y); |
1783 | ret |= fire_bow (op, op, NULL, absdir (dir + 1), -5, op->x, op->y); |
1712 | ret |= fire_bow (op, op, NULL, absdir (dir + 1), -5, op->x, op->y); |
1784 | |
|
|
1785 | } |
1713 | } |
1786 | else |
1714 | else |
1787 | { |
1715 | { |
1788 | /* Simple case */ |
1716 | /* Simple case */ |
1789 | ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1717 | ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1790 | } |
1718 | } |
|
|
1719 | |
1791 | return ret; |
1720 | return ret; |
1792 | } |
1721 | } |
1793 | |
|
|
1794 | |
1722 | |
1795 | /* Fires a misc (wand/rod/horn) object in 'dir'. |
1723 | /* Fires a misc (wand/rod/horn) object in 'dir'. |
1796 | * Broken apart from 'fire' to keep it more readable. |
1724 | * Broken apart from 'fire' to keep it more readable. |
1797 | */ |
1725 | */ |
1798 | void |
1726 | void |
1799 | fire_misc_object (object *op, int dir) |
1727 | fire_misc_object (object *op, int dir) |
1800 | { |
1728 | { |
1801 | object *item; |
1729 | object *item = op->contr->ranged_ob; |
1802 | |
1730 | |
1803 | if (!op->contr->ranges[range_misc]) |
1731 | if (!item) |
1804 | { |
1732 | { |
1805 | new_draw_info (NDI_UNIQUE, 0, op, "You have range item readied."); |
1733 | new_draw_info (NDI_UNIQUE, 0, op, "You have range item readied."); |
1806 | return; |
1734 | return; |
1807 | } |
1735 | } |
1808 | |
1736 | |
1809 | item = op->contr->ranges[range_misc]; |
|
|
1810 | if (!item->inv) |
1737 | if (!item->inv) |
1811 | { |
1738 | { |
1812 | LOG (llevError, "Object %s lacks a spell\n", &item->name); |
1739 | LOG (llevError, "Object %s lacks a spell\n", &item->name); |
1813 | return; |
1740 | return; |
1814 | } |
1741 | } |
|
|
1742 | |
|
|
1743 | if (!op->change_weapon (item)) |
|
|
1744 | return; |
|
|
1745 | |
1815 | if (item->type == WAND) |
1746 | if (item->type == WAND) |
1816 | { |
1747 | { |
1817 | if (item->stats.food <= 0) |
1748 | if (item->stats.food <= 0) |
1818 | { |
1749 | { |
1819 | play_sound_player_only (op->contr, SOUND_WAND_POOF, 0, 0); |
1750 | op->contr->play_sound (sound_find ("wand_poof")); |
1820 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s goes poof.", query_base_name (item, 0)); |
1751 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s goes poof.", query_base_name (item, 0)); |
|
|
1752 | |
1821 | return; |
1753 | return; |
1822 | } |
1754 | } |
1823 | } |
1755 | } |
1824 | else if (item->type == ROD || item->type == HORN) |
1756 | else if (item->type == ROD || item->type == HORN) |
1825 | { |
1757 | { |
1826 | if (item->stats.hp < MAX (item->inv->stats.sp, item->inv->stats.grace)) |
1758 | if (item->stats.hp < MAX (item->inv->stats.sp, item->inv->stats.grace)) |
1827 | { |
1759 | { |
1828 | play_sound_player_only (op->contr, SOUND_WAND_POOF, 0, 0); |
1760 | op->contr->play_sound (sound_find ("wand_poof")); |
|
|
1761 | |
1829 | if (item->type == ROD) |
1762 | if (item->type == ROD) |
1830 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s whines for a while, but nothing happens.", query_base_name (item, 0)); |
1763 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s whines for a while, but nothing happens.", query_base_name (item, 0)); |
1831 | else |
1764 | else |
1832 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s needs more time to charge.", query_base_name (item, 0)); |
1765 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s needs more time to charge.", query_base_name (item, 0)); |
|
|
1766 | |
1833 | return; |
1767 | return; |
1834 | } |
1768 | } |
1835 | } |
1769 | } |
1836 | |
1770 | |
1837 | if (cast_spell (op, item, dir, item->inv, NULL)) |
1771 | if (cast_spell (op, item, dir, item->inv, NULL)) |
… | |
… | |
1844 | object *tmp; |
1778 | object *tmp; |
1845 | |
1779 | |
1846 | if (item->arch) |
1780 | if (item->arch) |
1847 | { |
1781 | { |
1848 | CLEAR_FLAG (item, FLAG_ANIMATE); |
1782 | CLEAR_FLAG (item, FLAG_ANIMATE); |
1849 | item->face = item->arch->clone.face; |
1783 | item->face = item->arch->face; |
1850 | item->set_speed (0); |
1784 | item->set_speed (0); |
1851 | } |
1785 | } |
1852 | |
1786 | |
1853 | if ((tmp = item->in_player ())) |
1787 | if ((tmp = item->in_player ())) |
1854 | esrv_update_item (UPD_ANIM, tmp, item); |
1788 | esrv_update_item (UPD_ANIM, tmp, item); |
… | |
… | |
1859 | } |
1793 | } |
1860 | } |
1794 | } |
1861 | |
1795 | |
1862 | /* Received a fire command for the player - go and do it. |
1796 | /* Received a fire command for the player - go and do it. |
1863 | */ |
1797 | */ |
1864 | void |
1798 | bool |
1865 | fire (object *op, int dir) |
1799 | fire (object *op, int dir) |
1866 | { |
1800 | { |
1867 | int spellcost = 0; |
1801 | int spellcost = 0; |
1868 | |
1802 | |
1869 | /* check for loss of invisiblity/hide */ |
1803 | /* check for loss of invisiblity/hide */ |
1870 | if (action_makes_visible (op)) |
1804 | if (action_makes_visible (op)) |
1871 | make_visible (op); |
1805 | make_visible (op); |
1872 | |
1806 | |
1873 | switch (op->contr->shoottype) |
1807 | player *pl = op->contr; |
|
|
1808 | |
|
|
1809 | if (pl->golem) |
|
|
1810 | { |
|
|
1811 | control_golem (op->contr->golem, dir); |
|
|
1812 | return false; |
1874 | { |
1813 | } |
1875 | case range_none: |
|
|
1876 | return; |
|
|
1877 | |
1814 | |
1878 | case range_bow: |
1815 | object *ob = pl->ranged_ob; |
|
|
1816 | |
|
|
1817 | if (!ob) |
|
|
1818 | return false; |
|
|
1819 | |
|
|
1820 | if (!op->change_weapon (ob)) |
|
|
1821 | return false; |
|
|
1822 | |
|
|
1823 | if (op->speed_left > 0.f) |
|
|
1824 | --op->speed_left; |
|
|
1825 | else |
|
|
1826 | return false; |
|
|
1827 | |
|
|
1828 | switch (ob->type) |
|
|
1829 | { |
|
|
1830 | case BOW: |
1879 | player_fire_bow (op, dir); |
1831 | player_fire_bow (op, dir); |
1880 | return; |
1832 | break; |
1881 | |
1833 | |
1882 | case range_magic: /* Casting spells */ |
1834 | case SPELL: |
1883 | spellcost = (cast_spell (op, op, dir, op->contr->ranges[range_magic], op->contr->spellparam[0] ? op->contr->spellparam : 0)); |
1835 | spellcost = cast_spell (op, op, dir, ob, pl->spellparam[0] ? pl->spellparam : 0); |
1884 | return; |
1836 | break; |
1885 | |
1837 | |
1886 | case range_misc: |
1838 | case BUILDER: |
|
|
1839 | apply_map_builder (op, dir); |
|
|
1840 | break; |
|
|
1841 | |
|
|
1842 | case SKILL: |
|
|
1843 | do_skill (op, op, ob, dir, 0); |
|
|
1844 | break; |
|
|
1845 | |
|
|
1846 | default: |
1887 | fire_misc_object (op, dir); |
1847 | fire_misc_object (op, dir); |
1888 | return; |
1848 | break; |
1889 | |
|
|
1890 | case range_golem: /* Control summoned monsters from scrolls */ |
|
|
1891 | if (QUERY_FLAG (op->contr->ranges[range_golem], FLAG_REMOVED)) |
|
|
1892 | { |
|
|
1893 | op->contr->ranges[range_golem] = 0; |
|
|
1894 | op->contr->shoottype = range_none; |
|
|
1895 | } |
|
|
1896 | else |
|
|
1897 | control_golem (op->contr->ranges[range_golem], dir); |
|
|
1898 | return; |
|
|
1899 | |
|
|
1900 | case range_skill: |
|
|
1901 | if (!op->chosen_skill) |
|
|
1902 | { |
|
|
1903 | if (op->type == PLAYER) |
|
|
1904 | new_draw_info (NDI_UNIQUE, 0, op, "You have no applicable skill to use."); |
|
|
1905 | return; |
|
|
1906 | } |
|
|
1907 | (void) do_skill (op, op, op->chosen_skill, dir, NULL); |
|
|
1908 | return; |
|
|
1909 | case range_builder: |
|
|
1910 | apply_map_builder (op, dir); |
|
|
1911 | return; |
|
|
1912 | default: |
|
|
1913 | new_draw_info (NDI_UNIQUE, 0, op, "Illegal shoot type."); |
|
|
1914 | return; |
|
|
1915 | } |
1849 | } |
1916 | } |
|
|
1917 | |
1850 | |
1918 | |
1851 | return true; |
|
|
1852 | } |
1919 | |
1853 | |
1920 | /* find_key |
1854 | /* find_key |
1921 | * We try to find a key for the door as passed. If we find a key |
1855 | * We try to find a key for the door as passed. If we find a key |
1922 | * and successfully use it, we return the key, otherwise NULL |
1856 | * and successfully use it, we return the key, otherwise NULL |
1923 | * This function merges both normal and locked door, since the logic |
1857 | * This function merges both normal and locked door, since the logic |
… | |
… | |
1925 | * pl is the player, |
1859 | * pl is the player, |
1926 | * inv is the objects inventory to searched |
1860 | * inv is the objects inventory to searched |
1927 | * door is the door we are trying to match against. |
1861 | * door is the door we are trying to match against. |
1928 | * This function can be called recursively to search containers. |
1862 | * This function can be called recursively to search containers. |
1929 | */ |
1863 | */ |
1930 | |
|
|
1931 | object * |
1864 | object * |
1932 | find_key (object *pl, object *container, object *door) |
1865 | find_key (object *pl, object *container, object *door) |
1933 | { |
1866 | { |
1934 | object *tmp, *key; |
1867 | object *tmp, *key; |
1935 | |
1868 | |
1936 | /* Should not happen, but sanity checking is never bad */ |
1869 | /* Should not happen, but sanity checking is never bad */ |
1937 | if (container->inv == NULL) |
1870 | if (!container->inv) |
1938 | return NULL; |
1871 | return 0; |
1939 | |
1872 | |
1940 | /* First, lets try to find a key in the top level inventory */ |
1873 | /* First, lets try to find a key in the top level inventory */ |
1941 | for (tmp = container->inv; tmp != NULL; tmp = tmp->below) |
1874 | for (tmp = container->inv; tmp; tmp = tmp->below) |
1942 | { |
1875 | { |
1943 | if (door->type == DOOR && tmp->type == KEY) |
1876 | if (door->type == DOOR && tmp->type == KEY) |
1944 | break; |
1877 | break; |
1945 | /* For sanity, we should really check door type, but other stuff |
1878 | /* For sanity, we should really check door type, but other stuff |
1946 | * (like containers) can be locked with special keys |
1879 | * (like containers) can be locked with special keys |
1947 | */ |
1880 | */ |
1948 | if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying) |
1881 | if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying) |
1949 | break; |
1882 | break; |
1950 | } |
1883 | } |
|
|
1884 | |
1951 | /* No key found - lets search inventories now */ |
1885 | /* No key found - lets search inventories now */ |
1952 | /* If we find and use a key in an inventory, return at that time. |
1886 | /* If we find and use a key in an inventory, return at that time. |
1953 | * otherwise, if we search all the inventories and still don't find |
1887 | * otherwise, if we search all the inventories and still don't find |
1954 | * a key, return |
1888 | * a key, return |
1955 | */ |
1889 | */ |
1956 | if (!tmp) |
1890 | if (!tmp) |
1957 | { |
1891 | { |
1958 | for (tmp = container->inv; tmp != NULL; tmp = tmp->below) |
1892 | for (tmp = container->inv; tmp; tmp = tmp->below) |
1959 | { |
1893 | { |
1960 | /* No reason to search empty containers */ |
1894 | /* No reason to search empty containers */ |
1961 | if (tmp->type == CONTAINER && tmp->inv) |
1895 | if (tmp->type == CONTAINER && tmp->inv) |
1962 | { |
1896 | { |
1963 | if ((key = find_key (pl, tmp, door)) != NULL) |
1897 | if ((key = find_key (pl, tmp, door))) |
1964 | return key; |
1898 | return key; |
1965 | } |
1899 | } |
1966 | } |
1900 | } |
|
|
1901 | |
1967 | if (!tmp) |
1902 | if (!tmp) |
1968 | return NULL; |
1903 | return NULL; |
1969 | } |
1904 | } |
|
|
1905 | |
1970 | /* We get down here if we have found a key. Now if its in a container, |
1906 | /* We get down here if we have found a key. Now if its in a container, |
1971 | * see if we actually want to use it |
1907 | * see if we actually want to use it |
1972 | */ |
1908 | */ |
1973 | if (pl != container) |
1909 | if (pl != container) |
1974 | { |
1910 | { |
… | |
… | |
1995 | new_draw_info_format (NDI_UNIQUE | NDI_BROWN, 0, pl, |
1931 | new_draw_info_format (NDI_UNIQUE | NDI_BROWN, 0, pl, |
1996 | "The %s in your %s vibrates as you approach the door", query_name (tmp), query_name (container)); |
1932 | "The %s in your %s vibrates as you approach the door", query_name (tmp), query_name (container)); |
1997 | return NULL; |
1933 | return NULL; |
1998 | } |
1934 | } |
1999 | } |
1935 | } |
|
|
1936 | |
2000 | return tmp; |
1937 | return tmp; |
2001 | } |
1938 | } |
2002 | |
1939 | |
2003 | /* moved door processing out of move_player_attack. |
1940 | /* moved door processing out of move_player_attack. |
2004 | * returns 1 if player has opened the door with a key |
1941 | * returns 1 if player has opened the door with a key |
… | |
… | |
2006 | * 0 otherwise |
1943 | * 0 otherwise |
2007 | */ |
1944 | */ |
2008 | static int |
1945 | static int |
2009 | player_attack_door (object *op, object *door) |
1946 | player_attack_door (object *op, object *door) |
2010 | { |
1947 | { |
2011 | /* If its a door, try to find a use a key. If we do destroy the door, |
1948 | /* If its a door, try to find a key. If we do destroy the door, |
2012 | * might as well return immediately as there is nothing more to do - |
1949 | * might as well return immediately as there is nothing more to do - |
2013 | * otherwise, we fall through to the rest of the code. |
1950 | * otherwise, we fall through to the rest of the code. |
2014 | */ |
1951 | */ |
2015 | object *key = find_key (op, op, door); |
1952 | object *key = find_key (op, op, door); |
2016 | |
1953 | |
2017 | /* IF we found a key, do some extra work */ |
1954 | /* If we found a key, do some extra work */ |
2018 | if (key) |
1955 | if (key) |
2019 | { |
1956 | { |
2020 | object *container = key->env; |
1957 | object *container = key->env; |
2021 | |
1958 | |
2022 | play_sound_map (op->map, op->x, op->y, SOUND_OPEN_DOOR); |
|
|
2023 | if (action_makes_visible (op)) |
1959 | if (action_makes_visible (op)) |
2024 | make_visible (op); |
1960 | make_visible (op); |
|
|
1961 | |
2025 | if (door->inv && (door->inv->type == RUNE || door->inv->type == TRAP)) |
1962 | if (door->inv && (door->inv->type == RUNE || door->inv->type == TRAP)) |
2026 | spring_trap (door->inv, op); |
1963 | spring_trap (door->inv, op); |
|
|
1964 | |
2027 | if (door->type == DOOR) |
1965 | if (door->type == DOOR) |
2028 | { |
|
|
2029 | hit_player (door, 9998, op, AT_PHYSICAL, 1); /* Break through the door */ |
1966 | hit_player (door, 9998, op, AT_PHYSICAL, 1); /* Break through the door */ |
2030 | } |
|
|
2031 | else if (door->type == LOCKED_DOOR) |
1967 | else if (door->type == LOCKED_DOOR) |
2032 | { |
1968 | { |
2033 | new_draw_info_format (NDI_UNIQUE, NDI_BROWN, op, "You open the door with the %s", query_short_name (key)); |
1969 | op->statusmsg (format ("You open the door with the %s", query_short_name (key)), NDI_BROWN); |
2034 | remove_door2 (door); /* remove door without violence ;-) */ |
1970 | remove_door2 (door); /* remove door without violence ;-) */ |
2035 | } |
1971 | } |
|
|
1972 | |
2036 | /* Do this after we print the message */ |
1973 | /* Do this after we print the message */ |
2037 | decrease_ob (key); /* Use up one of the keys */ |
1974 | decrease_ob (key); /* Use up one of the keys */ |
2038 | /* Need to update the weight the container the key was in */ |
1975 | /* Need to update the weight the container the key was in */ |
2039 | if (container != op) |
1976 | if (container != op) |
2040 | esrv_update_item (UPD_WEIGHT, op, container); |
1977 | esrv_update_item (UPD_WEIGHT, op, container); |
|
|
1978 | |
2041 | return 1; /* Nothing more to do below */ |
1979 | return 1; /* Nothing more to do below */ |
2042 | } |
1980 | } |
2043 | else if (door->type == LOCKED_DOOR) |
1981 | else if (door->type == LOCKED_DOOR) |
2044 | { |
1982 | { |
2045 | /* Might as well return now - no other way to open this */ |
1983 | /* Might as well return now - no other way to open this */ |
2046 | new_draw_info (NDI_UNIQUE | NDI_NAVY, 0, op, door->msg); |
1984 | op->failmsg (door->msg ? &door->msg : "Hmm, you miss the certain something to open this door..."); |
2047 | return 1; |
1985 | return 1; |
2048 | } |
1986 | } |
|
|
1987 | |
2049 | return 0; |
1988 | return 0; |
2050 | } |
1989 | } |
2051 | |
1990 | |
2052 | /* This function is just part of a breakup from move_player. |
1991 | /* This function is just part of a breakup from move_player. |
2053 | * It should keep the code cleaner. |
1992 | * It should keep the code cleaner. |
2054 | * When this is called, the players direction has been updated |
1993 | * When this is called, the players direction has been updated |
2055 | * (taking into account confusion.) The player is also actually |
1994 | * (taking into account confusion.) The player is also actually |
2056 | * going to try and move (not fire weapons). |
1995 | * going to try and move (not fire weapons). |
2057 | */ |
1996 | */ |
2058 | void |
1997 | bool |
2059 | move_player_attack (object *op, int dir) |
1998 | move_player_attack (object *op, int dir) |
2060 | { |
1999 | { |
2061 | object *tmp, *mon; |
|
|
2062 | sint16 nx, ny; |
|
|
2063 | int on_battleground; |
2000 | int on_battleground; |
2064 | maptile *m; |
|
|
2065 | |
2001 | |
2066 | nx = freearr_x[dir] + op->x; |
2002 | sint16 nx = freearr_x[dir] + op->x; |
2067 | ny = freearr_y[dir] + op->y; |
2003 | sint16 ny = freearr_y[dir] + op->y; |
2068 | |
2004 | |
2069 | on_battleground = op_on_battleground (op, 0, 0); |
2005 | on_battleground = op_on_battleground (op, 0, 0); |
|
|
2006 | |
|
|
2007 | if (out_of_map (op->map, nx, ny)) |
|
|
2008 | return false; |
|
|
2009 | |
|
|
2010 | if (!op->contr->braced && op->speed_left > 0.f && move_ob (op, dir, op)) |
|
|
2011 | { |
|
|
2012 | --op->speed_left; |
|
|
2013 | return true; |
|
|
2014 | } |
2070 | |
2015 | |
2071 | /* If braced, or can't move to the square, and it is not out of the |
2016 | /* If braced, or can't move to the square, and it is not out of the |
2072 | * map, attack it. Note order of if statement is important - don't |
2017 | * map, attack it. Note order of if statement is important - don't |
2073 | * want to be calling move_ob if braced, because move_ob will move the |
2018 | * want to be calling move_ob if braced, because move_ob will move the |
2074 | * player. This is a pretty nasty hack, because if we could |
2019 | * player. This is a pretty nasty hack, because if we could |
2075 | * move to some space, it then means that if we are braced, we should |
2020 | * move to some space, it then means that if we are braced, we should |
2076 | * do nothing at all. As it is, if we are braced, we go through |
2021 | * do nothing at all. As it is, if we are braced, we go through |
2077 | * quite a bit of processing. However, it probably is less than what |
2022 | * quite a bit of processing. However, it probably is less than what |
2078 | * move_ob uses. |
2023 | * move_ob uses. |
2079 | */ |
2024 | */ |
2080 | if ((op->contr->braced || !move_ob (op, dir, op)) && !out_of_map (op->map, nx, ny)) |
2025 | maptile *m = op->map->xy_find (nx, ny); |
2081 | { |
|
|
2082 | if (OUT_OF_REAL_MAP (op->map, nx, ny)) |
|
|
2083 | { |
|
|
2084 | m = get_map_from_coord (op->map, &nx, &ny); |
|
|
2085 | if (!m) |
|
|
2086 | return; /* Don't think this should happen */ |
|
|
2087 | } |
|
|
2088 | else |
|
|
2089 | m = op->map; |
|
|
2090 | |
2026 | |
2091 | if ((tmp = GET_MAP_OB (m, nx, ny)) == NULL) |
|
|
2092 | { |
|
|
2093 | /* LOG(llevError,"player_move_attack: GET_MAP_OB returns NULL, but player can not move there.\n"); */ |
|
|
2094 | return; |
|
|
2095 | } |
|
|
2096 | |
|
|
2097 | mon = 0; |
|
|
2098 | /* Go through all the objects, and find ones of interest. Only stop if |
2027 | /* Go through all the objects, and find ones of interest. Only stop if |
2099 | * we find a monster - that is something we know we want to attack. |
2028 | * we find a monster - that is something we know we want to attack. |
2100 | * if its a door or barrel (can roll) see if there may be monsters |
2029 | * if its a door or barrel (can roll) see if there may be monsters |
2101 | * on the space |
2030 | * on the space |
2102 | */ |
2031 | */ |
2103 | while (tmp) |
2032 | object *mon; |
2104 | { |
2033 | for (mon = m->at (nx, ny).bot; mon; mon = mon->above) |
2105 | if (tmp == op) |
2034 | { |
2106 | { |
2035 | if ((mon->flag [FLAG_ALIVE] |
2107 | tmp = tmp->above; |
2036 | || mon->type == LOCKED_DOOR |
2108 | continue; |
2037 | || mon->flag [FLAG_CAN_ROLL]) |
2109 | } |
|
|
2110 | |
|
|
2111 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) |
|
|
2112 | { |
|
|
2113 | mon = tmp; |
2038 | && mon != op) |
2114 | break; |
2039 | break; |
2115 | } |
2040 | } |
2116 | |
2041 | |
2117 | if (tmp->type == LOCKED_DOOR || QUERY_FLAG (tmp, FLAG_CAN_ROLL)) |
|
|
2118 | mon = tmp; |
|
|
2119 | |
|
|
2120 | tmp = tmp->above; |
|
|
2121 | } |
|
|
2122 | |
|
|
2123 | if (!mon) /* This happens anytime the player tries to move */ |
2042 | if (!mon) /* This happens anytime the player tries to move */ |
2124 | return; /* into a wall */ |
2043 | return false; /* into a wall */ |
2125 | |
2044 | |
2126 | if (mon->head) |
|
|
2127 | mon = mon->head; |
2045 | mon = mon->head_ (); |
2128 | |
2046 | |
2129 | if ((mon->type == DOOR && mon->stats.hp >= 0) || (mon->type == LOCKED_DOOR)) |
2047 | if ((mon->type == DOOR && mon->stats.hp >= 0) || (mon->type == LOCKED_DOOR)) |
|
|
2048 | if (op->contr->weapon_sp_left > 0.f) |
2130 | if (player_attack_door (op, mon)) |
2049 | if (player_attack_door (op, mon)) |
|
|
2050 | { |
|
|
2051 | --op->contr->weapon_sp_left; |
2131 | return; |
2052 | return true; |
|
|
2053 | } |
2132 | |
2054 | |
2133 | /* The following deals with possibly attacking peaceful |
2055 | /* The following deals with possibly attacking peaceful |
2134 | * or frienddly creatures. Basically, all players are considered |
2056 | * or friendly creatures. Basically, all players are considered |
2135 | * unaggressive. If the moving player has peaceful set, then the |
2057 | * unaggressive. If the moving player has peaceful set, then the |
2136 | * object should be pushed instead of attacked. It is assumed that |
2058 | * object should be pushed instead of attacked. It is assumed that |
2137 | * if you are braced, you will not attack friends accidently, |
2059 | * if you are braced, you will not attack friends accidently, |
2138 | * and thus will not push them. |
2060 | * and thus will not push them. |
2139 | */ |
2061 | */ |
2140 | |
2062 | |
2141 | /* If the creature is a pet, push it even if the player is not |
2063 | /* If the creature is a pet, push it even if the player is not |
2142 | * peaceful. Our assumption is the creature is a pet if the |
2064 | * peaceful. Our assumption is the creature is a pet if the |
2143 | * player owns it and it is either friendly or unagressive. |
2065 | * player owns it and it is either friendly or unagressive. |
2144 | */ |
2066 | */ |
2145 | if ((op->type == PLAYER) |
2067 | if (op->type == PLAYER |
2146 | #if COZY_SERVER |
|
|
2147 | && |
|
|
2148 | ((mon->owner && mon->owner->contr |
2068 | && ((mon->owner && mon->owner->contr |
2149 | && same_party (mon->owner->contr->party, op->contr->party)) || mon->owner == op) |
2069 | && same_party (mon->owner->contr->party, op->contr->party)) |
2150 | #else |
|
|
2151 | && mon->owner == op |
2070 | || mon->owner == op) |
2152 | #endif |
|
|
2153 | && (QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) || QUERY_FLAG (mon, FLAG_FRIENDLY))) |
2071 | && (QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) || QUERY_FLAG (mon, FLAG_FRIENDLY))) |
2154 | { |
2072 | { |
2155 | /* If we're braced, we don't want to switch places with it */ |
2073 | /* If we're braced, we don't want to switch places with it */ |
2156 | if (op->contr->braced) |
2074 | if (op->contr->braced) |
2157 | return; |
2075 | return false; |
2158 | play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER); |
2076 | |
|
|
2077 | if (op->speed_left > 0.f) |
|
|
2078 | { |
|
|
2079 | --op->speed_left; |
|
|
2080 | |
|
|
2081 | op->play_sound (sound_find ("push_player")); |
2159 | (void) push_ob (mon, dir, op); |
2082 | push_ob (mon, dir, op); |
|
|
2083 | |
2160 | if (op->contr->tmp_invis || op->hide) |
2084 | if (op->contr->tmp_invis || op->hide) |
2161 | make_visible (op); |
2085 | make_visible (op); |
|
|
2086 | |
2162 | return; |
2087 | return true; |
2163 | } |
2088 | } |
|
|
2089 | else |
|
|
2090 | return false; |
|
|
2091 | } |
2164 | |
2092 | |
2165 | /* in certain circumstances, you shouldn't attack friendly |
2093 | /* in certain circumstances, you shouldn't attack friendly |
2166 | * creatures. Note that if you are braced, you can't push |
2094 | * creatures. Note that if you are braced, you can't push |
2167 | * someone, but put it inside this loop so that you won't |
2095 | * someone, but put it inside this loop so that you won't |
2168 | * attack them either. |
2096 | * attack them either. |
2169 | */ |
2097 | */ |
2170 | if ((mon->type == PLAYER || mon->enemy != op) && |
2098 | if ((mon->type == PLAYER || mon->enemy != op) |
2171 | (mon->type == PLAYER || QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) || QUERY_FLAG (mon, FLAG_FRIENDLY)) && ( |
2099 | && (mon->type == PLAYER || QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) || QUERY_FLAG (mon, FLAG_FRIENDLY)) |
2172 | #ifdef PROHIBIT_PLAYERKILL |
|
|
2173 | (op->contr->peaceful |
2100 | && ((op->contr->peaceful |
2174 | || (mon->type == PLAYER |
2101 | || (mon->type == PLAYER && mon->contr->peaceful)) |
2175 | && mon->contr-> |
|
|
2176 | peaceful)) && |
|
|
2177 | #else |
|
|
2178 | op->contr->peaceful && |
|
|
2179 | #endif |
|
|
2180 | !on_battleground)) |
2102 | && !on_battleground)) |
|
|
2103 | { |
|
|
2104 | if (op->speed_left > 0.f) |
2181 | { |
2105 | { |
|
|
2106 | --op->speed_left; |
|
|
2107 | |
2182 | if (!op->contr->braced) |
2108 | if (!op->contr->braced) |
2183 | { |
2109 | { |
2184 | play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER); |
2110 | op->play_sound (sound_find ("push_player")); |
2185 | (void) push_ob (mon, dir, op); |
2111 | push_ob (mon, dir, op); |
2186 | } |
2112 | } |
2187 | else |
2113 | else |
2188 | new_draw_info (0, 0, op, "You withhold your attack"); |
2114 | op->statusmsg ("You withhold your attack"); |
2189 | |
2115 | |
2190 | if (op->contr->tmp_invis || op->hide) |
2116 | if (op->contr->tmp_invis || op->hide) |
2191 | make_visible (op); |
2117 | make_visible (op); |
2192 | } |
|
|
2193 | |
2118 | |
|
|
2119 | return true; |
|
|
2120 | } |
|
|
2121 | } |
2194 | /* If the object is a boulder or other rollable object, then |
2122 | /* If the object is a boulder or other rollable object, then |
2195 | * roll it if not braced. You can't roll it if you are braced. |
2123 | * roll it if not braced. You can't roll it if you are braced. |
2196 | */ |
2124 | */ |
2197 | else if (QUERY_FLAG (mon, FLAG_CAN_ROLL) && (!op->contr->braced)) |
2125 | else if (QUERY_FLAG (mon, FLAG_CAN_ROLL) && (!op->contr->braced)) |
|
|
2126 | { |
|
|
2127 | if (op->speed_left > 0.f) |
2198 | { |
2128 | { |
|
|
2129 | --op->speed_left; |
|
|
2130 | |
2199 | recursive_roll (mon, dir, op); |
2131 | recursive_roll (mon, dir, op); |
2200 | if (action_makes_visible (op)) |
2132 | if (action_makes_visible (op)) |
2201 | make_visible (op); |
2133 | make_visible (op); |
2202 | } |
|
|
2203 | |
2134 | |
|
|
2135 | return true; |
|
|
2136 | } |
|
|
2137 | } |
2204 | /* Any generic living creature. Including things like doors. |
2138 | /* Any generic living creature. Including things like doors. |
2205 | * Way it works is like this: First, it must have some hit points |
2139 | * Way it works is like this: First, it must have some hit points |
2206 | * and be living. Then, it must be one of the following: |
2140 | * and be living. Then, it must be one of the following: |
2207 | * 1) Not a player, 2) A player, but of a different party. Note |
2141 | * 1) Not a player, 2) A player, but of a different party. Note |
2208 | * that party_number -1 is no party, so attacks can still happen. |
2142 | * that party_number -1 is no party, so attacks can still happen. |
2209 | */ |
2143 | */ |
2210 | |
|
|
2211 | else if ((mon->stats.hp >= 0) && QUERY_FLAG (mon, FLAG_ALIVE) && |
2144 | else if ((mon->stats.hp >= 0) && QUERY_FLAG (mon, FLAG_ALIVE) && |
2212 | ((mon->type != PLAYER || op->contr->party == NULL || op->contr->party != mon->contr->party))) |
2145 | ((mon->type != PLAYER || op->contr->party == NULL || op->contr->party != mon->contr->party))) |
2213 | { |
2146 | { |
2214 | |
2147 | if (op->contr->weapon_sp_left > 0.f && !op->flag [FLAG_WIZPASS]) |
2215 | /* If the player hasn't hit something this tick, and does |
|
|
2216 | * so, give them speed boost based on weapon speed. Doing |
|
|
2217 | * it here is better than process_players2, which basically |
|
|
2218 | * incurred a 1 tick offset. |
|
|
2219 | */ |
|
|
2220 | if (!op->contr->has_hit) |
|
|
2221 | { |
2148 | { |
2222 | op->speed_left += op->speed / op->contr->weapon_sp; |
2149 | --op->contr->weapon_sp_left; |
2223 | |
|
|
2224 | op->contr->has_hit = 1; /* The last action was to hit, so use weapon_sp */ |
|
|
2225 | } |
|
|
2226 | |
2150 | |
2227 | skill_attack (mon, op, 0, 0, 0); |
2151 | skill_attack (mon, op, 0, 0, 0); |
2228 | |
|
|
2229 | /* If attacking another player, that player gets automatic |
|
|
2230 | * hitback, and doesn't loose luck either. |
|
|
2231 | * Disable hitback on the battleground or if the target is |
|
|
2232 | * the wiz. |
|
|
2233 | */ |
|
|
2234 | if (mon->type == PLAYER && mon->stats.hp >= 0 && !mon->contr->has_hit && !on_battleground && !QUERY_FLAG (mon, FLAG_WIZ)) |
|
|
2235 | { |
|
|
2236 | short luck = mon->stats.luck; |
|
|
2237 | |
|
|
2238 | mon->contr->has_hit = 1; |
|
|
2239 | skill_attack (op, mon, 0, 0, 0); |
|
|
2240 | mon->stats.luck = luck; |
|
|
2241 | } |
|
|
2242 | |
2152 | |
2243 | if (action_makes_visible (op)) |
2153 | if (action_makes_visible (op)) |
2244 | make_visible (op); |
2154 | make_visible (op); |
2245 | } |
|
|
2246 | } /* if player should attack something */ |
|
|
2247 | } |
|
|
2248 | |
2155 | |
2249 | int |
2156 | return true; |
|
|
2157 | } |
|
|
2158 | } |
|
|
2159 | |
|
|
2160 | return false; |
|
|
2161 | } |
|
|
2162 | |
|
|
2163 | bool |
2250 | move_player (object *op, int dir) |
2164 | move_player (object *op, int dir) |
2251 | { |
2165 | { |
2252 | int pick; |
2166 | int pick; |
2253 | |
2167 | |
2254 | if (op->map == NULL || op->map->in_memory != MAP_IN_MEMORY) |
2168 | if (!op->map || op->map->in_memory != MAP_IN_MEMORY) |
2255 | return 0; |
2169 | return 0; |
2256 | |
2170 | |
2257 | /* Sanity check: make sure dir is valid */ |
2171 | /* Sanity check: make sure dir is valid */ |
2258 | if ((dir < 0) || (dir >= 9)) |
2172 | if ((dir < 0) || (dir >= 9)) |
2259 | { |
2173 | { |
2260 | LOG (llevError, "move_player: invalid direction %d\n", dir); |
2174 | LOG (llevError, "move_player: invalid direction %d\n", dir); |
2261 | return 0; |
2175 | return 0; |
2262 | } |
2176 | } |
2263 | |
2177 | |
2264 | /* peterm: added following line */ |
2178 | /* peterm: added following line */ |
2265 | if (QUERY_FLAG (op, FLAG_CONFUSED) && dir) |
2179 | if (QUERY_FLAG (op, FLAG_CONFUSED) && dir) |
2266 | dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2); |
2180 | dir = absdir (dir + rndm (3) + rndm (3) - 2); |
2267 | |
2181 | |
2268 | op->facing = dir; |
2182 | op->facing = dir; |
2269 | |
2183 | |
2270 | if (op->hide) |
2184 | if (op->hide) |
2271 | do_hidden_move (op); |
2185 | do_hidden_move (op); |
2272 | |
2186 | |
|
|
2187 | bool retval; |
|
|
2188 | |
2273 | if (INVOKE_PLAYER (MOVE, op->contr, ARG_INT (dir))) |
2189 | if (INVOKE_PLAYER (MOVE, op->contr, ARG_INT (dir))) |
2274 | /*nop */ ; |
2190 | retval = RESULT_INT (0); |
2275 | else if (op->contr->fire_on) |
2191 | else if (op->contr->fire_on) |
2276 | fire (op, dir); |
2192 | retval = fire (op, dir); |
2277 | else |
2193 | else |
2278 | { |
2194 | { |
2279 | move_player_attack (op, dir); |
2195 | retval = move_player_attack (op, dir); |
2280 | pick = check_pick (op); |
2196 | pick = check_pick (op); |
2281 | } |
2197 | } |
2282 | |
2198 | |
2283 | /* Add special check for newcs players and fire on - this way, the |
2199 | /* Add special check for newcs players and fire on - this way, the |
2284 | * server can handle repeat firing. |
2200 | * server can handle repeat firing. |
… | |
… | |
2291 | /* Update how the player looks. Use the facing, so direction may |
2207 | /* Update how the player looks. Use the facing, so direction may |
2292 | * get reset to zero. This allows for full animation capabilities |
2208 | * get reset to zero. This allows for full animation capabilities |
2293 | * for players. |
2209 | * for players. |
2294 | */ |
2210 | */ |
2295 | animate_object (op, op->facing); |
2211 | animate_object (op, op->facing); |
2296 | return 0; |
2212 | |
|
|
2213 | return retval; |
2297 | } |
2214 | } |
2298 | |
2215 | |
2299 | /* This is similar to handle_player, below, but is only used by the |
2216 | /* This is similar to handle_player, below, but is only used by the |
2300 | * new client/server stuff. |
2217 | * new client/server stuff. |
2301 | * This is sort of special, in that the new client/server actually uses |
2218 | * This is sort of special, in that the new client/server actually uses |
2302 | * the new speed values for commands. |
2219 | * the new speed values for commands. |
2303 | * |
2220 | * |
2304 | * Returns true if there are more actions we can do. |
2221 | * Returns true if there are more actions we can do. Should not do |
|
|
2222 | * many actions in a row, as that would be too unfair to other |
|
|
2223 | * players. |
2305 | */ |
2224 | */ |
2306 | int |
2225 | bool |
2307 | handle_newcs_player (object *op) |
2226 | handle_newcs_player (object *op) |
2308 | { |
2227 | { |
2309 | if (op->contr->hidden) |
|
|
2310 | { |
|
|
2311 | op->invisible = 1000; |
|
|
2312 | /* the socket code flashes the player visible/invisible |
|
|
2313 | * depending on the value of invisible, so we need to |
|
|
2314 | * alternate it here for it to work correctly. |
|
|
2315 | */ |
|
|
2316 | if (pticks & 2) |
|
|
2317 | op->invisible--; |
|
|
2318 | } |
|
|
2319 | else if (op->invisible && !(QUERY_FLAG (op, FLAG_MAKE_INVIS))) |
|
|
2320 | { |
|
|
2321 | op->invisible--; |
|
|
2322 | if (!op->invisible) |
|
|
2323 | { |
|
|
2324 | make_visible (op); |
|
|
2325 | new_draw_info (NDI_UNIQUE, 0, op, "Your invisibility spell runs out."); |
|
|
2326 | } |
|
|
2327 | } |
|
|
2328 | |
|
|
2329 | if (QUERY_FLAG (op, FLAG_SCARED)) |
2228 | if (QUERY_FLAG (op, FLAG_SCARED)) |
2330 | { |
2229 | { |
2331 | flee_player (op); |
2230 | if (op->speed_left > 0.f) |
2332 | /* If player is still scared, that is his action for this tick */ |
|
|
2333 | if (QUERY_FLAG (op, FLAG_SCARED)) |
|
|
2334 | { |
2231 | { |
2335 | op->speed_left--; |
2232 | --op->speed_left; |
|
|
2233 | flee_player (op); |
|
|
2234 | |
2336 | return 0; |
2235 | return true; |
2337 | } |
2236 | } |
|
|
2237 | else |
|
|
2238 | return false; |
2338 | } |
2239 | } |
2339 | |
|
|
2340 | /* I've been seeing crashes where the golem has been destroyed, but |
|
|
2341 | * the player object still points to the defunct golem. The code that |
|
|
2342 | * destroys the golem looks correct, and it doesn't always happen, so |
|
|
2343 | * put this in a a workaround to clean up the golem pointer. |
|
|
2344 | */ |
|
|
2345 | if (op->contr->ranges[range_golem] && QUERY_FLAG (op->contr->ranges[range_golem], FLAG_REMOVED)) |
|
|
2346 | op->contr->ranges[range_golem] = 0; |
|
|
2347 | |
2240 | |
2348 | /* call this here - we also will call this in do_ericserver, but |
2241 | /* call this here - we also will call this in do_ericserver, but |
2349 | * the players time has been increased when doericserver has been |
2242 | * the players time has been increased when doericserver has been |
2350 | * called, so we recheck it here. |
2243 | * called, so we recheck it here. |
2351 | */ |
2244 | */ |
2352 | //TODO: better than handling 8 commands, use some more intelligent rate-limiting |
2245 | if (op->contr->ns->handle_command ()) |
2353 | for (int rep = 8; --rep && op->contr->ns->handle_command (); ) |
|
|
2354 | ; |
|
|
2355 | |
|
|
2356 | if (op->speed_left < 0) |
|
|
2357 | return 0; |
2246 | return true; |
2358 | |
2247 | |
2359 | if (op->direction && (op->contr->run_on || op->contr->fire_on)) |
2248 | if (op->direction && (op->contr->run_on || op->contr->fire_on)) |
2360 | { |
|
|
2361 | /* All move commands take 1 tick, at least for now */ |
|
|
2362 | op->speed_left--; |
|
|
2363 | |
|
|
2364 | /* Instead of all the stuff below, let move_player take care |
|
|
2365 | * of it. Also, some of the skill stuff is only put in |
|
|
2366 | * there, as well as the confusion stuff. |
|
|
2367 | */ |
|
|
2368 | move_player (op, op->direction); |
2249 | return move_player (op, op->direction); |
2369 | if (op->speed_left > 0) |
|
|
2370 | return 1; |
|
|
2371 | else |
|
|
2372 | return 0; |
|
|
2373 | } |
|
|
2374 | |
2250 | |
2375 | return 0; |
2251 | return false; |
2376 | } |
2252 | } |
2377 | |
2253 | |
2378 | int |
2254 | int |
2379 | save_life (object *op) |
2255 | save_life (object *op) |
2380 | { |
2256 | { |
… | |
… | |
2382 | return 0; |
2258 | return 0; |
2383 | |
2259 | |
2384 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2260 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2385 | if (QUERY_FLAG (tmp, FLAG_APPLIED) && QUERY_FLAG (tmp, FLAG_LIFESAVE)) |
2261 | if (QUERY_FLAG (tmp, FLAG_APPLIED) && QUERY_FLAG (tmp, FLAG_LIFESAVE)) |
2386 | { |
2262 | { |
2387 | play_sound_map (op->map, op->x, op->y, SOUND_OB_EVAPORATE); |
2263 | op->play_sound (sound_find ("ob_evaporate")); |
2388 | new_draw_info_format (NDI_UNIQUE, 0, op, "Your %s vibrates violently, then evaporates.", query_name (tmp)); |
2264 | new_draw_info_format (NDI_UNIQUE, 0, op, "Your %s vibrates violently, then evaporates.", query_name (tmp)); |
2389 | |
2265 | |
2390 | if (op->contr) |
2266 | if (op->contr) |
2391 | esrv_del_item (op->contr, tmp->count); |
2267 | esrv_del_item (op->contr, tmp->count); |
2392 | |
2268 | |
… | |
… | |
2412 | /* This goes throws the inventory and removes unpaid objects, and puts them |
2288 | /* This goes throws the inventory and removes unpaid objects, and puts them |
2413 | * back in the map (location and map determined by values of env). This |
2289 | * back in the map (location and map determined by values of env). This |
2414 | * function will descend into containers. op is the object to start the search |
2290 | * function will descend into containers. op is the object to start the search |
2415 | * from. |
2291 | * from. |
2416 | */ |
2292 | */ |
2417 | void |
2293 | static void |
2418 | remove_unpaid_objects (object *op, object *env) |
2294 | drop_unpaid_items (object *op, object *env) |
2419 | { |
2295 | { |
2420 | object *next; |
|
|
2421 | |
|
|
2422 | while (op) |
2296 | while (op) |
2423 | { |
2297 | { |
2424 | object *next = op->below; /* Make sure we have a good value, in case we remove object 'op' */ |
2298 | object *next = op->below; /* Make sure we have a good value, in case we remove object 'op' */ |
2425 | |
2299 | |
2426 | if (QUERY_FLAG (op, FLAG_UNPAID)) |
2300 | if (QUERY_FLAG (op, FLAG_UNPAID)) |
… | |
… | |
2429 | esrv_del_item (env->contr, op->count); |
2303 | esrv_del_item (env->contr, op->count); |
2430 | |
2304 | |
2431 | op->insert_at (env); |
2305 | op->insert_at (env); |
2432 | } |
2306 | } |
2433 | else if (op->inv) |
2307 | else if (op->inv) |
2434 | remove_unpaid_objects (op->inv, env); |
2308 | drop_unpaid_items (op->inv, env); |
2435 | |
2309 | |
2436 | op = next; |
2310 | op = next; |
2437 | } |
2311 | } |
|
|
2312 | } |
|
|
2313 | |
|
|
2314 | void |
|
|
2315 | object::drop_unpaid_items () |
|
|
2316 | { |
|
|
2317 | if (!flag [FLAG_REMOVED]) |
|
|
2318 | ::drop_unpaid_items (inv, this); |
2438 | } |
2319 | } |
2439 | |
2320 | |
2440 | /* |
2321 | /* |
2441 | * Returns pointer a static string containing gravestone text |
2322 | * Returns pointer a static string containing gravestone text |
2442 | * Moved from apply.c to player.c - player.c is what |
2323 | * Moved from apply.c to player.c - player.c is what |
… | |
… | |
2492 | int rate_grace = 2000; |
2373 | int rate_grace = 2000; |
2493 | const int max_hp = 1; |
2374 | const int max_hp = 1; |
2494 | const int max_sp = 1; |
2375 | const int max_sp = 1; |
2495 | const int max_grace = 1; |
2376 | const int max_grace = 1; |
2496 | |
2377 | |
2497 | if (op->contr->outputs_sync) |
2378 | if (op->contr->hidden) |
|
|
2379 | { |
|
|
2380 | op->invisible = 1000; |
|
|
2381 | /* the socket code flashes the player visible/invisible |
|
|
2382 | * depending on the value of invisible, so we need to |
|
|
2383 | * alternate it here for it to work correctly. |
|
|
2384 | */ |
|
|
2385 | if (pticks & 2) |
|
|
2386 | op->invisible--; |
2498 | { |
2387 | } |
2499 | for (i = 0; i < NUM_OUTPUT_BUFS; i++) |
2388 | else if (op->invisible && !(QUERY_FLAG (op, FLAG_MAKE_INVIS))) |
2500 | if (op->contr->outputs[i].buf && (op->contr->outputs[i].first_update + op->contr->outputs_sync) < (uint16) pticks) |
2389 | { |
2501 | flush_output_element (op, &op->contr->outputs[i]); |
2390 | if (!op->invisible--) |
|
|
2391 | { |
|
|
2392 | make_visible (op); |
|
|
2393 | new_draw_info (NDI_UNIQUE, 0, op, "Your invisibility spell runs out."); |
|
|
2394 | } |
2502 | } |
2395 | } |
2503 | |
2396 | |
2504 | if (op->contr->ns->state == ST_PLAYING) |
2397 | if (op->contr->ns->state == ST_PLAYING) |
2505 | { |
2398 | { |
2506 | /* these next three if clauses make it possible to SLOW DOWN |
2399 | /* these next three if clauses make it possible to SLOW DOWN |
… | |
… | |
2525 | gen_grace = (op->contr->gen_grace + 1) * op->stats.maxgrace; |
2418 | gen_grace = (op->contr->gen_grace + 1) * op->stats.maxgrace; |
2526 | else |
2419 | else |
2527 | { |
2420 | { |
2528 | gen_grace = op->stats.maxgrace; |
2421 | gen_grace = op->stats.maxgrace; |
2529 | rate_grace -= rate_grace / 2 * op->contr->gen_grace; |
2422 | rate_grace -= rate_grace / 2 * op->contr->gen_grace; |
2530 | } |
|
|
2531 | |
|
|
2532 | /* Regenerate Spell Points */ |
|
|
2533 | if (op->contr->ranges[range_golem] == NULL && --op->last_sp < 0) |
|
|
2534 | { |
|
|
2535 | gen_sp = gen_sp * 10 / (op->contr->gen_sp_armour < 10 ? 10 : op->contr->gen_sp_armour); |
|
|
2536 | if (op->stats.sp < op->stats.maxsp) |
|
|
2537 | { |
|
|
2538 | op->stats.sp++; |
|
|
2539 | /* dms do not consume food */ |
|
|
2540 | if (!QUERY_FLAG (op, FLAG_WIZ)) |
|
|
2541 | { |
|
|
2542 | op->stats.food--; |
|
|
2543 | if (op->contr->digestion < 0) |
|
|
2544 | op->stats.food += op->contr->digestion; |
|
|
2545 | else if (op->contr->digestion > 0 && random_roll (0, op->contr->digestion, op, PREFER_HIGH)) |
|
|
2546 | op->stats.food = last_food; |
|
|
2547 | } |
|
|
2548 | } |
|
|
2549 | |
|
|
2550 | if (max_sp > 1) |
|
|
2551 | { |
|
|
2552 | over_sp = (gen_sp + 10) / rate_sp; |
|
|
2553 | if (over_sp > 0) |
|
|
2554 | { |
|
|
2555 | if (op->stats.sp < op->stats.maxsp) |
|
|
2556 | { |
|
|
2557 | op->stats.sp += over_sp > max_sp ? max_sp : over_sp; |
|
|
2558 | |
|
|
2559 | if (random_roll (0, rate_sp - 1, op, PREFER_LOW) > ((gen_sp + 10) % rate_sp)) |
|
|
2560 | op->stats.sp--; |
|
|
2561 | |
|
|
2562 | if (op->stats.sp > op->stats.maxsp) |
|
|
2563 | op->stats.sp = op->stats.maxsp; |
|
|
2564 | } |
|
|
2565 | op->last_sp = 0; |
|
|
2566 | } |
|
|
2567 | else |
|
|
2568 | op->last_sp = rate_sp / (gen_sp < 20 ? 30 : gen_sp + 10); |
|
|
2569 | } |
|
|
2570 | else |
|
|
2571 | op->last_sp = rate_sp / (gen_sp < 20 ? 30 : gen_sp + 10); |
|
|
2572 | } |
2423 | } |
2573 | |
2424 | |
2574 | /* Regenerate Grace */ |
2425 | /* Regenerate Grace */ |
2575 | /* I altered this a little - maximum grace is ony achieved through prayer -b.t. */ |
2426 | /* I altered this a little - maximum grace is ony achieved through prayer -b.t. */ |
2576 | if (--op->last_grace < 0) |
2427 | if (--op->last_grace < 0) |
… | |
… | |
2597 | op->last_grace = rate_grace / (gen_grace < 20 ? 30 : gen_grace + 10); |
2448 | op->last_grace = rate_grace / (gen_grace < 20 ? 30 : gen_grace + 10); |
2598 | } |
2449 | } |
2599 | /* wearing stuff doesn't detract from grace generation. */ |
2450 | /* wearing stuff doesn't detract from grace generation. */ |
2600 | } |
2451 | } |
2601 | |
2452 | |
|
|
2453 | if (op->stats.food > 0) |
|
|
2454 | { |
2602 | /* Regenerate Hit Points */ |
2455 | /* Regenerate Spell Points */ |
2603 | if (--op->last_heal < 0) |
2456 | if (!op->contr->golem && --op->last_sp < 0) |
2604 | { |
|
|
2605 | if (op->stats.hp < op->stats.maxhp) |
|
|
2606 | { |
2457 | { |
2607 | op->stats.hp++; |
2458 | gen_sp = gen_sp * 10 / (op->contr->gen_sp_armour < 10 ? 10 : op->contr->gen_sp_armour); |
2608 | /* dms do not consume food */ |
2459 | |
2609 | if (!QUERY_FLAG (op, FLAG_WIZ)) |
2460 | if (op->stats.sp < op->stats.maxsp) |
2610 | { |
2461 | { |
|
|
2462 | op->stats.sp++; |
|
|
2463 | |
|
|
2464 | /* dms do not consume food */ |
|
|
2465 | if (!QUERY_FLAG (op, FLAG_WIZ)) |
|
|
2466 | { |
2611 | op->stats.food--; |
2467 | op->stats.food--; |
|
|
2468 | |
2612 | if (op->contr->digestion < 0) |
2469 | if (op->contr->digestion < 0) |
2613 | op->stats.food += op->contr->digestion; |
2470 | op->stats.food += op->contr->digestion; |
2614 | else if (op->contr->digestion > 0 && random_roll (0, op->contr->digestion, op, PREFER_HIGH)) |
2471 | else if (op->contr->digestion > 0 && random_roll (0, op->contr->digestion, op, PREFER_HIGH)) |
2615 | op->stats.food = last_food; |
2472 | op->stats.food = last_food; |
|
|
2473 | } |
2616 | } |
2474 | } |
2617 | } |
|
|
2618 | |
2475 | |
2619 | if (max_hp > 1) |
2476 | if (max_sp > 1) |
2620 | { |
|
|
2621 | over_hp = (gen_hp < 20 ? 30 : gen_hp + 10) / rate_hp; |
|
|
2622 | if (over_hp > 0) |
|
|
2623 | { |
2477 | { |
2624 | op->stats.sp += over_hp + (RANDOM () % rate_hp > ((gen_hp < 20 ? 30 : gen_hp + 10) % rate_hp)) ? -1 : 0; |
2478 | over_sp = (gen_sp + 10) / rate_sp; |
|
|
2479 | if (over_sp > 0) |
|
|
2480 | { |
|
|
2481 | if (op->stats.sp < op->stats.maxsp) |
|
|
2482 | { |
|
|
2483 | op->stats.sp += over_sp > max_sp ? max_sp : over_sp; |
|
|
2484 | |
|
|
2485 | if (random_roll (0, rate_sp - 1, op, PREFER_LOW) > ((gen_sp + 10) % rate_sp)) |
|
|
2486 | op->stats.sp--; |
|
|
2487 | |
|
|
2488 | if (op->stats.sp > op->stats.maxsp) |
|
|
2489 | op->stats.sp = op->stats.maxsp; |
|
|
2490 | } |
|
|
2491 | |
2625 | op->last_heal = 0; |
2492 | op->last_sp = 0; |
|
|
2493 | } |
|
|
2494 | else |
|
|
2495 | op->last_sp = rate_sp / (gen_sp < 20 ? 30 : gen_sp + 10); |
2626 | } |
2496 | } |
2627 | else |
2497 | else |
|
|
2498 | op->last_sp = rate_sp / (gen_sp < 20 ? 30 : gen_sp + 10); |
|
|
2499 | } |
|
|
2500 | |
|
|
2501 | /* Regenerate Hit Points */ |
|
|
2502 | if (--op->last_heal < 0) |
|
|
2503 | { |
|
|
2504 | if (op->stats.hp < op->stats.maxhp) |
2628 | { |
2505 | { |
2629 | op->last_heal = rate_hp / (gen_hp < 20 ? 30 : gen_hp + 10); |
2506 | op->stats.hp++; |
|
|
2507 | |
|
|
2508 | /* dms do not consume food */ |
|
|
2509 | if (!QUERY_FLAG (op, FLAG_WIZ)) |
|
|
2510 | { |
|
|
2511 | op->stats.food--; |
|
|
2512 | |
|
|
2513 | if (op->contr->digestion < 0) |
|
|
2514 | op->stats.food += op->contr->digestion; |
|
|
2515 | else if (op->contr->digestion > 0 && random_roll (0, op->contr->digestion, op, PREFER_HIGH)) |
|
|
2516 | op->stats.food = last_food; |
|
|
2517 | } |
2630 | } |
2518 | } |
|
|
2519 | |
|
|
2520 | if (max_hp > 1) |
|
|
2521 | { |
|
|
2522 | over_hp = (gen_hp < 20 ? 30 : gen_hp + 10) / rate_hp; |
|
|
2523 | |
|
|
2524 | if (over_hp > 0) |
|
|
2525 | { |
|
|
2526 | op->stats.sp += over_hp + (RANDOM () % rate_hp > ((gen_hp < 20 ? 30 : gen_hp + 10) % rate_hp)) ? -1 : 0; |
|
|
2527 | op->last_heal = 0; |
|
|
2528 | } |
|
|
2529 | else |
|
|
2530 | op->last_heal = rate_hp / (gen_hp < 20 ? 30 : gen_hp + 10); |
2631 | } |
2531 | } |
2632 | else |
2532 | else |
2633 | { |
|
|
2634 | op->last_heal = rate_hp / (gen_hp < 20 ? 30 : gen_hp + 10); |
2533 | op->last_heal = rate_hp / (gen_hp < 20 ? 30 : gen_hp + 10); |
2635 | } |
2534 | } |
2636 | } |
2535 | } |
2637 | |
2536 | |
2638 | /* Digestion */ |
2537 | /* Digestion */ |
2639 | if (--op->last_eat < 0) |
2538 | if (--op->last_eat < 0) |
2640 | { |
2539 | { |
2641 | #ifdef COZY_SERVER |
2540 | int bonus = max (0, op->contr->digestion), |
2642 | int dg = op->contr->digestion >= 0 && op->contr->digestion < 2 ? 2 : op->contr->digestion; |
2541 | penalty = max (0, -op->contr->digestion); |
2643 | int bonus = dg > 0 ? dg : 0, penalty = dg < 0 ? -dg : 0; |
|
|
2644 | #else |
|
|
2645 | int bonus = op->contr->digestion > 0 ? op->contr->digestion : 0, penalty = op->contr->digestion < 0 ? -op->contr->digestion : 0; |
|
|
2646 | #endif |
|
|
2647 | |
2542 | |
2648 | if (op->contr->gen_hp > 0) |
|
|
2649 | op->last_eat = 25 * (1 + bonus) / (op->contr->gen_hp + penalty + 1); |
2543 | op->last_eat = 25 * (1 + bonus) / (max (0, op->contr->gen_hp) + penalty + 1); |
2650 | else |
|
|
2651 | op->last_eat = 25 * (1 + bonus) / (penalty + 1); |
|
|
2652 | |
2544 | |
2653 | /* dms do not consume food */ |
2545 | /* dms do not consume food */ |
2654 | if (!QUERY_FLAG (op, FLAG_WIZ)) |
2546 | if (!QUERY_FLAG (op, FLAG_WIZ)) |
2655 | op->stats.food--; |
2547 | op->stats.food--; |
2656 | } |
2548 | } |
… | |
… | |
2683 | new_draw_info (NDI_UNIQUE, 0, op, "You blindly grab for a bite of food."); |
2575 | new_draw_info (NDI_UNIQUE, 0, op, "You blindly grab for a bite of food."); |
2684 | manual_apply (op, flesh, 0); |
2576 | manual_apply (op, flesh, 0); |
2685 | } |
2577 | } |
2686 | } |
2578 | } |
2687 | |
2579 | |
2688 | while (op->stats.food < 0 && op->stats.hp >= 0) |
2580 | if (op->stats.food < 0) |
2689 | op->stats.food++, op->stats.hp--; |
2581 | { |
|
|
2582 | op->stats.hp += op->stats.food; |
|
|
2583 | op->stats.food = 0; |
|
|
2584 | } |
2690 | |
2585 | |
2691 | if (op->stats.hp < 0 && !QUERY_FLAG (op, FLAG_WIZ)) |
2586 | if (op->stats.hp < 0 && !QUERY_FLAG (op, FLAG_WIZ)) |
2692 | kill_player (op); |
2587 | kill_player (op); |
2693 | } |
2588 | } |
2694 | } |
2589 | } |
… | |
… | |
2699 | * file. |
2594 | * file. |
2700 | */ |
2595 | */ |
2701 | void |
2596 | void |
2702 | kill_player (object *op) |
2597 | kill_player (object *op) |
2703 | { |
2598 | { |
|
|
2599 | int x, y; |
2704 | char buf[MAX_BUF]; |
2600 | char buf[MAX_BUF]; |
2705 | int x, y; |
|
|
2706 | |
|
|
2707 | //int i; |
|
|
2708 | maptile *map; /* this is for resurrection */ |
2601 | maptile *map; /* this is for resurrection */ |
2709 | |
|
|
2710 | /* int z; |
|
|
2711 | int num_stats_lose; |
|
|
2712 | int lost_a_stat; |
|
|
2713 | int lose_this_stat; |
|
|
2714 | int this_stat; */ |
|
|
2715 | int will_kill_again; |
2602 | int will_kill_again; |
2716 | archetype *at; |
2603 | archetype *at; |
2717 | object *tmp; |
2604 | object *tmp; |
2718 | |
2605 | |
2719 | if (save_life (op)) |
2606 | if (save_life (op)) |
2720 | return; |
2607 | return; |
2721 | |
|
|
2722 | |
2608 | |
2723 | /* If player dies on BATTLEGROUND, no stat/exp loss! For Combat-Arenas |
2609 | /* If player dies on BATTLEGROUND, no stat/exp loss! For Combat-Arenas |
2724 | * in cities ONLY!!! It is very important that this doesn't get abused. |
2610 | * in cities ONLY!!! It is very important that this doesn't get abused. |
2725 | * Look at op_on_battleground() for more info --AndreasV |
2611 | * Look at op_on_battleground() for more info --AndreasV |
2726 | */ |
2612 | */ |
… | |
… | |
2742 | { |
2628 | { |
2743 | tmp->destroy (); |
2629 | tmp->destroy (); |
2744 | new_draw_info (NDI_UNIQUE, 0, tmp, "Your mind feels clearer"); |
2630 | new_draw_info (NDI_UNIQUE, 0, tmp, "Your mind feels clearer"); |
2745 | } |
2631 | } |
2746 | |
2632 | |
2747 | cure_disease (op, 0); /* remove any disease */ |
2633 | cure_disease (op, 0, 0); /* remove any disease */ |
2748 | op->stats.hp = op->stats.maxhp; |
2634 | op->stats.hp = op->stats.maxhp; |
2749 | if (op->stats.food <= 0) |
2635 | if (op->stats.food <= 0) |
2750 | op->stats.food = 999; |
2636 | op->stats.food = 999; |
2751 | |
2637 | |
2752 | /* create a bodypart-trophy to make the winner happy */ |
2638 | /* create a bodypart-trophy to make the winner happy */ |
2753 | if (object *tmp = arch_to_object (archetype::find ("finger"))) |
2639 | if (object *tmp = arch_to_object (archetype::find ("finger"))) |
2754 | { |
2640 | { |
2755 | sprintf (buf, "%s's finger", &op->name); |
2641 | tmp->name = format ("%s's finger" , &op->name); |
2756 | tmp->name = buf; |
2642 | tmp->name_pl = format ("%s's fingers", &op->name); |
2757 | sprintf (buf, " This finger has been cut off %s\n" |
2643 | tmp->msg = format ( |
2758 | " the %s, when he was defeated at\n level %d by %s.\n", |
2644 | "This finger has been cut off of %s the %s, when he was defeated at level %d by %s.\n", |
2759 | &op->name, op->contr->title, (int) (op->level), op->contr->killer); |
2645 | &op->name, op->contr->title, (int) (op->level), op->contr->killer |
2760 | tmp->msg = buf; |
2646 | ); |
2761 | tmp->value = 0, tmp->material = 0, tmp->type = 0; |
2647 | tmp->value = 0, tmp->type = 0; |
2762 | tmp->materialname = NULL; |
2648 | tmp->materialname = "organics"; |
2763 | op->insert_at (tmp, op); |
2649 | tmp->insert_at (op, tmp); |
2764 | } |
2650 | } |
2765 | |
2651 | |
2766 | /* teleport defeated player to new destination */ |
2652 | /* teleport defeated player to new destination */ |
2767 | transfer_ob (op, x, y, 0, NULL); |
2653 | transfer_ob (op, x, y, 0, NULL); |
2768 | op->contr->braced = 0; |
2654 | op->contr->braced = 0; |
… | |
… | |
2772 | INVOKE_PLAYER (DEATH, op->contr); |
2658 | INVOKE_PLAYER (DEATH, op->contr); |
2773 | |
2659 | |
2774 | command_kill_pets (op, 0); |
2660 | command_kill_pets (op, 0); |
2775 | |
2661 | |
2776 | if (op->stats.food < 0) |
2662 | if (op->stats.food < 0) |
2777 | { |
|
|
2778 | if (op->contr->explore) |
|
|
2779 | { |
|
|
2780 | new_draw_info (NDI_UNIQUE, 0, op, "You would have starved, but you are"); |
|
|
2781 | new_draw_info (NDI_UNIQUE, 0, op, "in explore mode, so..."); |
|
|
2782 | op->stats.food = 999; |
|
|
2783 | return; |
|
|
2784 | } |
|
|
2785 | sprintf (buf, "%s starved to death.", &op->name); |
|
|
2786 | strcpy (op->contr->killer, "starvation"); |
2663 | strcpy (op->contr->killer, "starvation"); |
2787 | } |
|
|
2788 | else |
|
|
2789 | { |
|
|
2790 | if (op->contr->explore) |
|
|
2791 | { |
|
|
2792 | new_draw_info (NDI_UNIQUE, 0, op, "You would have died, but you are"); |
|
|
2793 | new_draw_info (NDI_UNIQUE, 0, op, "in explore mode, so..."); |
|
|
2794 | op->stats.hp = op->stats.maxhp; |
|
|
2795 | return; |
|
|
2796 | } |
|
|
2797 | sprintf (buf, "%s died.", &op->name); |
|
|
2798 | } |
|
|
2799 | |
2664 | |
2800 | play_sound_player_only (op->contr, SOUND_PLAYER_DIES, 0, 0); |
2665 | op->contr->play_sound (sound_find ("player_dies")); |
2801 | |
2666 | |
2802 | /* save the map location for corpse, gravestone */ |
2667 | /* save the map location for corpse, gravestone */ |
2803 | x = op->x; |
2668 | x = op->x; |
2804 | y = op->y; |
2669 | y = op->y; |
2805 | map = op->map; |
2670 | map = op->map; |
… | |
… | |
2968 | { |
2833 | { |
2969 | tmp->destroy (); |
2834 | tmp->destroy (); |
2970 | new_draw_info (NDI_UNIQUE, 0, tmp, "Your mind feels clearer"); |
2835 | new_draw_info (NDI_UNIQUE, 0, tmp, "Your mind feels clearer"); |
2971 | } |
2836 | } |
2972 | |
2837 | |
2973 | cure_disease (op, 0); /* remove any disease */ |
2838 | cure_disease (op, 0, 0); /* remove any disease */ |
2974 | |
2839 | |
2975 | /*add_exp(op, (op->stats.exp * -0.20)); */ |
2840 | /*add_exp(op, (op->stats.exp * -0.20)); */ |
2976 | apply_death_exp_penalty (op); |
2841 | apply_death_exp_penalty (op); |
2977 | if (op->stats.food < 100) |
2842 | if (op->stats.food < 100) |
2978 | op->stats.food = 900; |
2843 | op->stats.food = 900; |
2979 | op->stats.hp = op->stats.maxhp; |
2844 | op->stats.hp = op->stats.maxhp; |
2980 | op->stats.sp = MAX (op->stats.sp, op->stats.maxsp); |
2845 | op->stats.sp = MAX (op->stats.sp, op->stats.maxsp); |
2981 | op->stats.grace = MAX (op->stats.grace, op->stats.maxgrace); |
2846 | op->stats.grace = MAX (op->stats.grace, op->stats.maxgrace); |
2982 | |
2847 | |
2983 | /* |
2848 | /* |
2984 | * Check to see if the player is in a shop. IF so, then check to see if |
|
|
2985 | * the player has any unpaid items. If so, remove them and put them back |
2849 | * Check to see if the player has any unpaid items. If so, remove them |
2986 | * in the map. |
2850 | * and put them back in the map. |
2987 | */ |
2851 | */ |
2988 | |
2852 | op->drop_unpaid_items (); |
2989 | if (is_in_shop (op)) |
|
|
2990 | remove_unpaid_objects (op->inv, op); |
|
|
2991 | |
2853 | |
2992 | /****************************************/ |
2854 | /****************************************/ |
2993 | /* */ |
2855 | /* */ |
2994 | /* Move player to his current respawn- */ |
2856 | /* Move player to his current respawn- */ |
2995 | /* position (usually last savebed) */ |
2857 | /* position (usually last savebed) */ |
2996 | /* */ |
2858 | /* */ |
2997 | /****************************************/ |
2859 | /****************************************/ |
2998 | |
2860 | |
2999 | enter_player_savebed (op); |
2861 | enter_player_savebed (op); |
3000 | |
2862 | |
3001 | /* Save the player before inserting the force to reduce |
|
|
3002 | * chance of abuse. |
|
|
3003 | */ |
|
|
3004 | op->contr->braced = 0; |
2863 | op->contr->braced = 0; |
3005 | op->contr->save (); |
|
|
3006 | |
2864 | |
3007 | /* it is possible that the player has blown something up |
2865 | /* it is possible that the player has blown something up |
3008 | * at his savebed location, and that can have long lasting |
2866 | * at his savebed location, and that can have long lasting |
3009 | * spell effects. So first see if there is a spell effect |
2867 | * spell effects. So first see if there is a spell effect |
3010 | * on the space that might harm the player. |
2868 | * on the space that might harm the player. |
… | |
… | |
3019 | object *force; |
2877 | object *force; |
3020 | int at; |
2878 | int at; |
3021 | |
2879 | |
3022 | force = get_archetype (FORCE_NAME); |
2880 | force = get_archetype (FORCE_NAME); |
3023 | /* 50 ticks should be enough time for the spell to abate */ |
2881 | /* 50 ticks should be enough time for the spell to abate */ |
3024 | force->speed = 0.1; |
2882 | force->speed = 0.1f; |
3025 | force->speed_left = -5.0; |
2883 | force->speed_left = -5.f; |
3026 | SET_FLAG (force, FLAG_APPLIED); |
2884 | SET_FLAG (force, FLAG_APPLIED); |
3027 | for (at = 0; at < NROFATTACKS; at++) |
2885 | for (at = 0; at < NROFATTACKS; at++) |
3028 | if (will_kill_again & (1 << at)) |
2886 | if (will_kill_again & (1 << at)) |
3029 | force->resist[at] = 100; |
2887 | force->resist[at] = 100; |
3030 | |
2888 | |
… | |
… | |
3039 | void |
2897 | void |
3040 | loot_object (object *op) |
2898 | loot_object (object *op) |
3041 | { /* Grab and destroy some treasure */ |
2899 | { /* Grab and destroy some treasure */ |
3042 | object *tmp, *tmp2, *next; |
2900 | object *tmp, *tmp2, *next; |
3043 | |
2901 | |
3044 | if (op->container) |
2902 | op->close_container (); /* close open sack first */ |
3045 | esrv_apply_container (op, op->container); /* close open sack first */ |
|
|
3046 | |
2903 | |
3047 | for (tmp = op->inv; tmp; tmp = next) |
2904 | for (tmp = op->inv; tmp; tmp = next) |
3048 | { |
2905 | { |
3049 | next = tmp->below; |
2906 | next = tmp->below; |
3050 | |
2907 | |
3051 | if (tmp->invisible) |
2908 | if (tmp->invisible) |
3052 | continue; |
2909 | continue; |
3053 | |
2910 | |
3054 | tmp->remove (); |
2911 | tmp->remove (); |
3055 | tmp->x = op->x, tmp->y = op->y; |
2912 | tmp->x = op->x, tmp->y = op->y; |
|
|
2913 | |
3056 | if (tmp->type == CONTAINER) |
2914 | if (tmp->type == CONTAINER) |
3057 | { /* empty container to ground */ |
2915 | loot_object (tmp); /* empty container to ground */ |
3058 | loot_object (tmp); |
2916 | |
3059 | } |
|
|
3060 | if (!QUERY_FLAG (tmp, FLAG_UNIQUE) && (QUERY_FLAG (tmp, FLAG_STARTEQUIP) || QUERY_FLAG (tmp, FLAG_NO_DROP) || !(RANDOM () % 3))) |
2917 | if (!QUERY_FLAG (tmp, FLAG_UNIQUE) && (QUERY_FLAG (tmp, FLAG_STARTEQUIP) || QUERY_FLAG (tmp, FLAG_NO_DROP) || !(rndm (3)))) |
3061 | { |
2918 | { |
3062 | if (tmp->nrof > 1) |
2919 | if (tmp->nrof > 1) |
3063 | { |
2920 | { |
3064 | tmp2 = get_split_ob (tmp, 1 + RANDOM () % (tmp->nrof - 1)); |
2921 | tmp2 = get_split_ob (tmp, 1 + RANDOM () % (tmp->nrof - 1)); |
3065 | tmp2->destroy (); |
2922 | tmp2->destroy (); |
… | |
… | |
3076 | /* |
2933 | /* |
3077 | * fix_weight(): Check recursively the weight of all players, and fix |
2934 | * fix_weight(): Check recursively the weight of all players, and fix |
3078 | * what needs to be fixed. Refresh windows and fix speed if anything |
2935 | * what needs to be fixed. Refresh windows and fix speed if anything |
3079 | * was changed. |
2936 | * was changed. |
3080 | */ |
2937 | */ |
3081 | |
|
|
3082 | void |
2938 | void |
3083 | fix_weight (void) |
2939 | fix_weight (void) |
3084 | { |
2940 | { |
3085 | for_all_players (pl) |
2941 | for_all_players (pl) |
3086 | { |
2942 | { |
… | |
… | |
3141 | void |
2997 | void |
3142 | make_visible (object *op) |
2998 | make_visible (object *op) |
3143 | { |
2999 | { |
3144 | op->hide = 0; |
3000 | op->hide = 0; |
3145 | op->invisible = 0; |
3001 | op->invisible = 0; |
|
|
3002 | |
3146 | if (op->type == PLAYER) |
3003 | if (op->type == PLAYER) |
3147 | { |
3004 | { |
3148 | op->contr->tmp_invis = 0; |
3005 | op->contr->tmp_invis = 0; |
3149 | op->contr->invis_race = 0; |
3006 | op->contr->invis_race = 0; |
3150 | } |
3007 | } |
|
|
3008 | |
3151 | update_object (op, UP_OBJ_FACE); |
3009 | update_object (op, UP_OBJ_CHANGE); |
3152 | } |
3010 | } |
3153 | |
3011 | |
3154 | int |
3012 | int |
3155 | is_true_undead (object *op) |
3013 | is_true_undead (object *op) |
3156 | { |
3014 | { |
3157 | object *tmp = NULL; |
|
|
3158 | |
|
|
3159 | if (QUERY_FLAG (&op->arch->clone, FLAG_UNDEAD)) |
3015 | if (QUERY_FLAG (op->arch, FLAG_UNDEAD)) |
3160 | return 1; |
3016 | return 1; |
3161 | |
3017 | |
3162 | return 0; |
3018 | return 0; |
3163 | } |
3019 | } |
3164 | |
3020 | |
3165 | /* look at the surrounding terrain to determine |
3021 | /* look at the surrounding terrain to determine |
3166 | * the hideability of this object. Positive levels |
3022 | * the hideability of this object. Positive levels |
3167 | * indicate greater hideability. |
3023 | * indicate greater hideability. |
3168 | */ |
3024 | */ |
3169 | |
|
|
3170 | int |
3025 | int |
3171 | hideability (object *ob) |
3026 | hideability (object *ob) |
3172 | { |
3027 | { |
3173 | int i, level = 0, mflag; |
3028 | int i, level = 0, mflag; |
3174 | sint16 x, y; |
3029 | sint16 x, y; |
… | |
… | |
3208 | /* For Hidden creatures - a chance of becoming 'unhidden' |
3063 | /* For Hidden creatures - a chance of becoming 'unhidden' |
3209 | * every time they move - as we subtract off 'invisibility' |
3064 | * every time they move - as we subtract off 'invisibility' |
3210 | * AND, for players, if they move into a ridiculously unhideable |
3065 | * AND, for players, if they move into a ridiculously unhideable |
3211 | * spot (surrounded by clear terrain in broad daylight). -b.t. |
3066 | * spot (surrounded by clear terrain in broad daylight). -b.t. |
3212 | */ |
3067 | */ |
3213 | |
|
|
3214 | void |
3068 | void |
3215 | do_hidden_move (object *op) |
3069 | do_hidden_move (object *op) |
3216 | { |
3070 | { |
3217 | int hide = 0, num = random_roll (0, 19, op, PREFER_LOW); |
3071 | int hide = 0, num = random_roll (0, 19, op, PREFER_LOW); |
3218 | object *skop; |
3072 | object *skop; |
… | |
… | |
3222 | |
3076 | |
3223 | skop = find_obj_by_type_subtype (op, SKILL, SK_HIDING); |
3077 | skop = find_obj_by_type_subtype (op, SKILL, SK_HIDING); |
3224 | |
3078 | |
3225 | /* its *extremely* hard to run and sneak/hide at the same time! */ |
3079 | /* its *extremely* hard to run and sneak/hide at the same time! */ |
3226 | if (op->type == PLAYER && op->contr->run_on) |
3080 | if (op->type == PLAYER && op->contr->run_on) |
3227 | { |
|
|
3228 | if (!skop || num >= skop->level) |
3081 | if (!skop || num >= skop->level) |
3229 | { |
3082 | { |
3230 | new_draw_info (NDI_UNIQUE, 0, op, "You ran too much! You are no longer hidden!"); |
3083 | new_draw_info (NDI_UNIQUE, 0, op, "You ran too much! You are no longer hidden!"); |
3231 | make_visible (op); |
3084 | make_visible (op); |
3232 | return; |
3085 | return; |
3233 | } |
3086 | } |
3234 | else |
3087 | else |
3235 | num += 20; |
3088 | num += 20; |
3236 | } |
3089 | |
3237 | num += op->map->difficulty; |
3090 | num += op->map->difficulty; |
3238 | hide = hideability (op); /* modify by terrain hidden level */ |
3091 | hide = hideability (op); /* modify by terrain hidden level */ |
3239 | num -= hide; |
3092 | num -= hide; |
|
|
3093 | |
3240 | if ((op->type == PLAYER && hide < -10) || ((op->invisible -= num) <= 0)) |
3094 | if ((op->type == PLAYER && hide < -10) || ((op->invisible -= num) <= 0)) |
3241 | { |
3095 | { |
3242 | make_visible (op); |
3096 | make_visible (op); |
3243 | if (op->type == PLAYER) |
3097 | if (op->type == PLAYER) |
3244 | new_draw_info (NDI_UNIQUE, 0, op, "You moved out of hiding! You are visible!"); |
3098 | new_draw_info (NDI_UNIQUE, 0, op, "You moved out of hiding! You are visible!"); |
3245 | } |
3099 | } |
3246 | else if (op->type == PLAYER && skop) |
3100 | else if (op->type == PLAYER && skop) |
3247 | { |
|
|
3248 | change_exp (op, calc_skill_exp (op, NULL, skop), skop->skill, 0); |
3101 | change_exp (op, calc_skill_exp (op, NULL, skop), skop->skill, 0); |
3249 | } |
|
|
3250 | } |
3102 | } |
3251 | |
3103 | |
3252 | /* determine if who is standing near a hostile creature. */ |
3104 | /* determine if who is standing near a hostile creature. */ |
3253 | |
3105 | |
3254 | int |
3106 | int |
… | |
… | |
3302 | * object op. This function works fine for monsters, |
3154 | * object op. This function works fine for monsters, |
3303 | * but we dont worry if the object isnt the top one in |
3155 | * but we dont worry if the object isnt the top one in |
3304 | * a pile (say a coin under a table would return "viewable" |
3156 | * a pile (say a coin under a table would return "viewable" |
3305 | * by this routine). Another question, should we be |
3157 | * by this routine). Another question, should we be |
3306 | * concerned with the direction the player is looking |
3158 | * concerned with the direction the player is looking |
3307 | * in? Realistically, most of use cant see stuff behind |
3159 | * in? Realistically, most of us can't see stuff behind |
3308 | * our backs...on the other hand, does the "facing" direction |
3160 | * our backs...on the other hand, does the "facing" direction |
3309 | * imply the way your head, or body is facing? Its possible |
3161 | * imply the way your head, or body is facing? It's possible |
3310 | * for them to differ. Sigh, this fctn could get a bit more complex. |
3162 | * for them to differ. Sigh, this fctn could get a bit more complex. |
3311 | * -b.t. |
3163 | * -b.t. |
3312 | * This function is now map tiling safe. |
3164 | * This function is now map tiling safe. |
3313 | */ |
3165 | */ |
3314 | |
|
|
3315 | int |
3166 | int |
3316 | player_can_view (object *pl, object *op) |
3167 | player_can_view (object *pl, object *op) |
3317 | { |
3168 | { |
3318 | rv_vector rv; |
3169 | rv_vector rv; |
3319 | int dx, dy; |
3170 | int dx, dy; |
… | |
… | |
3331 | |
3182 | |
3332 | get_rangevector (pl, op, &rv, 0x1); |
3183 | get_rangevector (pl, op, &rv, 0x1); |
3333 | |
3184 | |
3334 | /* starting with the 'head' part, lets loop |
3185 | /* starting with the 'head' part, lets loop |
3335 | * through the object and find if it has any |
3186 | * through the object and find if it has any |
3336 | * part that is in the los array but isnt on |
3187 | * part that is in the los array but isn't on |
3337 | * a blocked los square. |
3188 | * a blocked los square. |
3338 | * we use the archetype to figure out offsets. |
3189 | * we use the archetype to figure out offsets. |
3339 | */ |
3190 | */ |
3340 | while (op) |
3191 | while (op) |
3341 | { |
3192 | { |
3342 | dx = rv.distance_x + op->arch->clone.x; |
3193 | dx = rv.distance_x + op->arch->x; |
3343 | dy = rv.distance_y + op->arch->clone.y; |
3194 | dy = rv.distance_y + op->arch->y; |
3344 | |
3195 | |
3345 | /* only the viewable area the player sees is updated by LOS |
3196 | /* only the viewable area the player sees is updated by LOS |
3346 | * code, so we need to restrict ourselves to that range of values |
3197 | * code, so we need to restrict ourselves to that range of values |
3347 | * for any meaningful values. |
3198 | * for any meaningful values. |
3348 | */ |
3199 | */ |
3349 | if (FABS (dx) <= (pl->contr->ns->mapx / 2) && |
3200 | if (abs (dx) <= (pl->contr->ns->mapx / 2) && |
3350 | FABS (dy) <= (pl->contr->ns->mapy / 2) && |
3201 | abs (dy) <= (pl->contr->ns->mapy / 2) && |
3351 | !pl->contr->blocked_los[dx + (pl->contr->ns->mapx / 2)][dy + (pl->contr->ns->mapy / 2)]) |
3202 | !pl->contr->blocked_los[dx + (pl->contr->ns->mapx / 2)][dy + (pl->contr->ns->mapy / 2)]) |
3352 | return 1; |
3203 | return 1; |
|
|
3204 | |
3353 | op = op->more; |
3205 | op = op->more; |
3354 | } |
3206 | } |
|
|
3207 | |
3355 | return 0; |
3208 | return 0; |
3356 | } |
3209 | } |
3357 | |
3210 | |
3358 | /* routine for both players and monsters. We call this when |
3211 | /* routine for both players and monsters. We call this when |
3359 | * there is a possibility for our action distrubing our hiding |
3212 | * there is a possibility for our action distrubing our hiding |
… | |
… | |
3362 | * return 0. |
3215 | * return 0. |
3363 | */ |
3216 | */ |
3364 | int |
3217 | int |
3365 | action_makes_visible (object *op) |
3218 | action_makes_visible (object *op) |
3366 | { |
3219 | { |
3367 | |
|
|
3368 | if (op->invisible && QUERY_FLAG (op, FLAG_ALIVE)) |
3220 | if (op->invisible && QUERY_FLAG (op, FLAG_ALIVE)) |
3369 | { |
3221 | { |
3370 | if (QUERY_FLAG (op, FLAG_MAKE_INVIS)) |
3222 | if (QUERY_FLAG (op, FLAG_MAKE_INVIS)) |
3371 | return 0; |
3223 | return 0; |
3372 | |
3224 | |
… | |
… | |
3378 | { |
3230 | { |
3379 | new_draw_info_format (NDI_UNIQUE, 0, op, "You become %s!", op->hide ? "unhidden" : "visible"); |
3231 | new_draw_info_format (NDI_UNIQUE, 0, op, "You become %s!", op->hide ? "unhidden" : "visible"); |
3380 | return 1; |
3232 | return 1; |
3381 | } |
3233 | } |
3382 | } |
3234 | } |
|
|
3235 | |
3383 | return 0; |
3236 | return 0; |
3384 | } |
3237 | } |
3385 | |
3238 | |
3386 | /* op_on_battleground - checks if the given object op (usually |
3239 | /* op_on_battleground - checks if the given object op (usually |
3387 | * a player) is standing on a valid battleground-tile, |
3240 | * a player) is standing on a valid battleground-tile, |
… | |
… | |
3392 | * Default is to do the same as before, so only people wanting to have different points need worry about this |
3245 | * Default is to do the same as before, so only people wanting to have different points need worry about this |
3393 | */ |
3246 | */ |
3394 | int |
3247 | int |
3395 | op_on_battleground (object *op, int *x, int *y) |
3248 | op_on_battleground (object *op, int *x, int *y) |
3396 | { |
3249 | { |
3397 | object *tmp; |
|
|
3398 | |
|
|
3399 | /* A battleground-tile needs the following attributes to be valid: |
3250 | /* A battleground-tile needs the following attributes to be valid: |
3400 | * is_floor 1 (has to be the FIRST floor beneath the player's feet), |
3251 | * is_floor 1 (has to be the FIRST floor beneath the player's feet), |
3401 | * name="battleground", no_pick 1, type=58 (type BATTLEGROUND) |
3252 | * name="battleground", no_pick 1, type=58 (type BATTLEGROUND) |
3402 | * and the exit-coordinates sp/hp must both be > 0. |
3253 | * and the exit-coordinates sp/hp must both be > 0. |
3403 | * => The intention here is to prevent abuse of the battleground- |
3254 | * => The intention here is to prevent abuse of the battleground- |
3404 | * feature (like pickable or hidden battleground tiles). */ |
3255 | * feature (like pickable or hidden battleground tiles). */ |
3405 | for (tmp = op->below; tmp != NULL; tmp = tmp->below) |
3256 | for (object *tmp = op->below; tmp; tmp = tmp->below) |
3406 | { |
3257 | { |
3407 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
3258 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
3408 | { |
3259 | { |
3409 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && |
3260 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) |
3410 | strcmp (tmp->name, "battleground") == 0 && tmp->type == BATTLEGROUND && EXIT_X (tmp) && EXIT_Y (tmp)) |
3261 | && tmp->type == BATTLEGROUND |
|
|
3262 | && tmp->name == shstr_battleground |
|
|
3263 | && EXIT_X (tmp) && EXIT_Y (tmp)) |
3411 | { |
3264 | { |
3412 | /*before we assign the exit, check if this is a teambattle */ |
3265 | /* before we assign the exit, check if this is a teambattle */ |
3413 | if (EXIT_ALT_X (tmp) && EXIT_ALT_Y (tmp) && EXIT_PATH (tmp)) |
3266 | if (EXIT_ALT_X (tmp) && EXIT_ALT_Y (tmp) && EXIT_PATH (tmp)) |
3414 | { |
3267 | { |
3415 | object *invtmp; |
|
|
3416 | |
|
|
3417 | for (invtmp = op->inv; invtmp != NULL; invtmp = invtmp->below) |
3268 | for (object *invtmp = op->inv; invtmp; invtmp = invtmp->below) |
3418 | { |
3269 | { |
3419 | if (invtmp->type == FORCE && invtmp->slaying && !strcmp (EXIT_PATH (tmp), invtmp->slaying)) |
3270 | if (invtmp->type == FORCE && invtmp->slaying && tmp->slaying == invtmp->slaying) |
3420 | { |
3271 | { |
3421 | if (x != NULL && y != NULL) |
3272 | if (x && y) |
3422 | *x = EXIT_ALT_X (tmp), *y = EXIT_ALT_Y (tmp); |
3273 | *x = EXIT_ALT_X (tmp), *y = EXIT_ALT_Y (tmp); |
|
|
3274 | |
3423 | return 1; |
3275 | return 1; |
3424 | } |
3276 | } |
3425 | } |
3277 | } |
3426 | } |
3278 | } |
|
|
3279 | |
3427 | if (x != NULL && y != NULL) |
3280 | if (x && y) |
3428 | *x = EXIT_X (tmp), *y = EXIT_Y (tmp); |
3281 | *x = EXIT_X (tmp), *y = EXIT_Y (tmp); |
|
|
3282 | |
3429 | return 1; |
3283 | return 1; |
3430 | } |
3284 | } |
3431 | } |
3285 | } |
3432 | } |
3286 | } |
|
|
3287 | |
3433 | /* If we got here, did not find a battleground */ |
3288 | /* If we got here, did not find a battleground */ |
3434 | return 0; |
3289 | return 0; |
3435 | } |
3290 | } |
3436 | |
3291 | |
3437 | /* |
3292 | /* |
… | |
… | |
3453 | char buf[MAX_BUF]; /* tmp. string buffer */ |
3308 | char buf[MAX_BUF]; /* tmp. string buffer */ |
3454 | int i = 0, j = 0; |
3309 | int i = 0, j = 0; |
3455 | |
3310 | |
3456 | /* get the appropriate treasurelist */ |
3311 | /* get the appropriate treasurelist */ |
3457 | if (atnr == ATNR_FIRE) |
3312 | if (atnr == ATNR_FIRE) |
3458 | trlist = find_treasurelist ("dragon_ability_fire"); |
3313 | trlist = treasurelist::find (shstr_dragon_ability_fire); |
3459 | else if (atnr == ATNR_COLD) |
3314 | else if (atnr == ATNR_COLD) |
3460 | trlist = find_treasurelist ("dragon_ability_cold"); |
3315 | trlist = treasurelist::find (shstr_dragon_ability_cold); |
3461 | else if (atnr == ATNR_ELECTRICITY) |
3316 | else if (atnr == ATNR_ELECTRICITY) |
3462 | trlist = find_treasurelist ("dragon_ability_elec"); |
3317 | trlist = treasurelist::find (shstr_dragon_ability_elec); |
3463 | else if (atnr == ATNR_POISON) |
3318 | else if (atnr == ATNR_POISON) |
3464 | trlist = find_treasurelist ("dragon_ability_poison"); |
3319 | trlist = treasurelist::find (shstr_dragon_ability_poison); |
3465 | |
3320 | |
3466 | if (trlist == NULL || who->type != PLAYER) |
3321 | if (trlist == NULL || who->type != PLAYER) |
3467 | return; |
3322 | return; |
3468 | |
3323 | |
3469 | for (i = 0, tr = trlist->items; tr != NULL && i < level - 1; tr = tr->next, i++); |
3324 | for (i = 0, tr = trlist->items; tr != NULL && i < level - 1; tr = tr->next, i++); |
3470 | |
3325 | |
3471 | if (tr == NULL || tr->item == NULL) |
3326 | if (!tr || !tr->item) |
3472 | { |
3327 | { |
3473 | /* LOG(llevDebug, "-> no more treasure for %s\n", change_resist_msg[atnr]); */ |
3328 | /* LOG(llevDebug, "-> no more treasure for %s\n", change_resist_msg[atnr]); */ |
3474 | return; |
3329 | return; |
3475 | } |
3330 | } |
3476 | |
3331 | |
3477 | /* everything seems okay - now bring on the gift: */ |
3332 | /* everything seems okay - now bring on the gift: */ |
3478 | item = &(tr->item->clone); |
3333 | item = tr->item; |
3479 | |
3334 | |
3480 | if (item->type == SPELL) |
3335 | if (item->type == SPELL) |
3481 | { |
3336 | { |
3482 | if (check_spell_known (who, item->name)) |
3337 | if (check_spell_known (who, item->name)) |
3483 | return; |
3338 | return; |
… | |
… | |
3542 | { |
3397 | { |
3543 | /* forces in the treasurelist can alter the player's stats */ |
3398 | /* forces in the treasurelist can alter the player's stats */ |
3544 | object *skin; |
3399 | object *skin; |
3545 | |
3400 | |
3546 | /* first get the dragon skin force */ |
3401 | /* first get the dragon skin force */ |
3547 | shstr_cmp dragon_skin_force ("dragon_skin_force"); |
|
|
3548 | for (skin = who->inv; skin && !(skin->arch->name == dragon_skin_force); skin = skin->below) |
3402 | for (skin = who->inv; skin && !(skin->arch->archname == shstr_dragon_skin_force); skin = skin->below) |
3549 | ; |
3403 | ; |
3550 | |
3404 | |
3551 | if (!skin) |
3405 | if (!skin) |
3552 | return; |
3406 | return; |
3553 | |
3407 | |
… | |
… | |
3601 | * not readied. |
3455 | * not readied. |
3602 | */ |
3456 | */ |
3603 | void |
3457 | void |
3604 | player_unready_range_ob (player *pl, object *ob) |
3458 | player_unready_range_ob (player *pl, object *ob) |
3605 | { |
3459 | { |
3606 | rangetype i; |
3460 | if (pl->ob->current_weapon == ob) |
|
|
3461 | pl->ob->current_weapon = 0; |
3607 | |
3462 | |
3608 | for (i = (rangetype) 0; i < range_size; i = (rangetype) ((int) i + 1)) |
3463 | if (pl->combat_ob == ob) |
3609 | { |
3464 | pl->combat_ob = 0; |
|
|
3465 | |
3610 | if (pl->ranges[i] == ob) |
3466 | if (pl->ranged_ob == ob) |
3611 | { |
3467 | pl->ranged_ob = 0; |
3612 | pl->ranges[i] = NULL; |
|
|
3613 | if (pl->shoottype == i) |
|
|
3614 | { |
|
|
3615 | pl->shoottype = range_none; |
|
|
3616 | } |
|
|
3617 | } |
|
|
3618 | } |
|
|
3619 | } |
3468 | } |
|
|
3469 | |
|
|
3470 | sint8 |
|
|
3471 | player::visibility_at (maptile *map, int x, int y) const |
|
|
3472 | { |
|
|
3473 | if (!ns) |
|
|
3474 | return 0; |
|
|
3475 | |
|
|
3476 | int dx, dy; |
|
|
3477 | if (!adjacent_map (map, ns->current_map, &dx, &dy)) |
|
|
3478 | return 0; |
|
|
3479 | |
|
|
3480 | x += dx - ns->current_x + ns->mapx / 2; |
|
|
3481 | y += dy - ns->current_y + ns->mapy / 2; |
|
|
3482 | |
|
|
3483 | if (!IN_RANGE_EXC (x, 0, ns->mapx) || !IN_RANGE_EXC (y, 0, ns->mapy)) |
|
|
3484 | return 0; |
|
|
3485 | |
|
|
3486 | return 100 - blocked_los [x][y]; |
|
|
3487 | } |
|
|
3488 | |
|
|
3489 | void |
|
|
3490 | player::infobox (const char *title, const char *msg, int color) |
|
|
3491 | { |
|
|
3492 | send_msg (color | NDI_DEF | NDI_REPLY | NDI_CLEAR, title, msg); |
|
|
3493 | } |
|
|
3494 | |
|
|
3495 | void |
|
|
3496 | player::statusmsg (const char *msg, int color) |
|
|
3497 | { |
|
|
3498 | send_msg (color | NDI_REPLY, INFO_CHANNEL, msg); |
|
|
3499 | } |
|
|
3500 | |
|
|
3501 | void |
|
|
3502 | player::failmsg (const char *msg, int color) |
|
|
3503 | { |
|
|
3504 | play_sound (sound_find ("generic_failure")); |
|
|
3505 | statusmsg (msg, color); |
|
|
3506 | } |
|
|
3507 | |