ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/server/monster.C
(Generate patch)

Comparing deliantra/server/server/monster.C (file contents):
Revision 1.20 by pippijn, Sat Jan 6 14:42:31 2007 UTC vs.
Revision 1.56 by root, Sat Dec 27 08:41:44 2008 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 7 *
8 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 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
10 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version. 11 * (at your option) any later version.
12 12 *
13 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 16 * GNU General Public License for more details.
17 17 *
18 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
21 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 The authors can be reached via e-mail at <crossfire@schmorp.de>
23*/ 22 */
24 23
25#include <global.h> 24#include <global.h>
26#include <sproto.h> 25#include <sproto.h>
27#include <spells.h> 26#include <spells.h>
28#include <skills.h> 27#include <skills.h>
36 * set to sane values. 35 * set to sane values.
37 */ 36 */
38object * 37object *
39check_enemy (object *npc, rv_vector * rv) 38check_enemy (object *npc, rv_vector * rv)
40{ 39{
41
42 /* if this is pet, let him attack the same enemy as his owner 40 /* if this is pet, let him attack the same enemy as his owner
43 * TODO: when there is no ower enemy, try to find a target, 41 * TODO: when there is no ower enemy, try to find a target,
44 * which CAN attack the owner. */ 42 * which CAN attack the owner. */
45 if ((npc->attack_movement & HI4) == PETMOVE) 43 if ((npc->attack_movement & HI4) == PETMOVE)
46 { 44 {
85 * target enemy - this code below makes sure the enemy is something 83 * target enemy - this code below makes sure the enemy is something
86 * that should be attacked. My guess is that the arrow hits 84 * that should be attacked. My guess is that the arrow hits
87 * the creature/owner, and so the creature then takes that 85 * the creature/owner, and so the creature then takes that
88 * as the enemy to attack. 86 * as the enemy to attack.
89 */ 87 */
90 else if (!QUERY_FLAG (npc->enemy, FLAG_MONSTER) && 88 else if (!QUERY_FLAG (npc->enemy, FLAG_MONSTER)
91 !QUERY_FLAG (npc->enemy, FLAG_GENERATOR) && npc->enemy->type != PLAYER && npc->enemy->type != GOLEM) 89 && !QUERY_FLAG (npc->enemy, FLAG_GENERATOR)
90 && npc->enemy->type != PLAYER
91 && npc->enemy->type != GOLEM)
92 npc->enemy = NULL; 92 npc->enemy = NULL;
93 93
94 } 94 }
95
95 return can_detect_enemy (npc, npc->enemy, rv) ? npc->enemy : NULL; 96 return can_detect_enemy (npc, npc->enemy, rv) ? npc->enemy : NULL;
96} 97}
97 98
98/* Returns the nearest living creature (monster or generator). 99/* Returns the nearest living creature (monster or generator).
99 * Modified to deal with tiled maps properly. 100 * Modified to deal with tiled maps properly.
113find_nearest_living_creature (object *npc) 114find_nearest_living_creature (object *npc)
114{ 115{
115 int i, mflags; 116 int i, mflags;
116 sint16 nx, ny; 117 sint16 nx, ny;
117 maptile *m; 118 maptile *m;
118 object *tmp;
119 int search_arr[SIZEOFFREE]; 119 int search_arr[SIZEOFFREE];
120 120
121 get_search_arr (search_arr); 121 get_search_arr (search_arr);
122
122 for (i = 0; i < SIZEOFFREE; i++) 123 for (i = 0; i < SIZEOFFREE; i++)
123 { 124 {
124 /* modified to implement smart searching using search_arr 125 /* modified to implement smart searching using search_arr
125 * guidance array to determine direction of search order 126 * guidance array to determine direction of search order
126 */ 127 */
127 nx = npc->x + freearr_x[search_arr[i]]; 128 nx = npc->x + freearr_x[search_arr[i]];
128 ny = npc->y + freearr_y[search_arr[i]]; 129 ny = npc->y + freearr_y[search_arr[i]];
129 m = npc->map; 130 m = npc->map;
130 131
131 mflags = get_map_flags (m, &m, nx, ny, &nx, &ny); 132 mflags = get_map_flags (m, &m, nx, ny, &nx, &ny);
133
132 if (mflags & P_OUT_OF_MAP) 134 if (mflags & P_OUT_OF_MAP)
133 continue; 135 continue;
134 136
135 if (mflags & P_IS_ALIVE) 137 if (mflags & P_IS_ALIVE)
136 { 138 {
137 tmp = GET_MAP_OB (m, nx, ny); 139 for (object *tmp = m->at (nx, ny).top; tmp; tmp = tmp->below)
138 while (tmp != NULL && !QUERY_FLAG (tmp, FLAG_MONSTER) && !QUERY_FLAG (tmp, FLAG_GENERATOR) && tmp->type != PLAYER) 140 if (tmp->flag [FLAG_MONSTER] || tmp->flag [FLAG_GENERATOR] || tmp->type == PLAYER)
139 tmp = tmp->above;
140
141 if (!tmp)
142 {
143 LOG (llevDebug, "find_nearest_living_creature: map %s (%d,%d) has is_alive set but did not find a monster?\n",
144 &m->path, nx, ny);
145 }
146 else
147 {
148 if (can_see_monsterP (m, nx, ny, i)) 141 if (can_see_monsterP (m, nx, ny, i))
149 return tmp; 142 return tmp;
150 } 143 }
151 } /* is something living on this space */
152 } 144 }
153 return NULL; /* nothing found */
154}
155 145
146 return 0;
147}
156 148
157/* Tries to find an enmy for npc. We pass the range vector since 149/* Tries to find an enemy for npc. We pass the range vector since
158 * our caller will find the information useful. 150 * our caller will find the information useful.
159 * Currently, only move_monster calls this function. 151 * Currently, only move_monster calls this function.
160 * Fix function so that we always make calls to get_rangevector 152 * Fix function so that we always make calls to get_rangevector
161 * if we have a valid target - function as not doing so in 153 * if we have a valid target - function as not doing so in
162 * many cases. 154 * many cases.
163 */ 155 */
164
165object * 156object *
166find_enemy (object *npc, rv_vector * rv) 157find_enemy (object *npc, rv_vector * rv)
167{ 158{
168 object *attacker, *tmp = NULL; 159 object *attacker, *tmp = NULL;
169 160
175 { 166 {
176 tmp = find_nearest_living_creature (npc); 167 tmp = find_nearest_living_creature (npc);
177 168
178 if (tmp) 169 if (tmp)
179 get_rangevector (npc, tmp, rv, 0); 170 get_rangevector (npc, tmp, rv, 0);
171
180 return tmp; 172 return tmp;
181 } 173 }
182 174
183 /* Here is the main enemy selection. 175 /* Here is the main enemy selection.
184 * We want this: if there is an enemy, attack him until its not possible or 176 * We want this: if there is an enemy, attack him until its not possible or
204 /* we check our old enemy. */ 196 /* we check our old enemy. */
205 if (!(tmp = check_enemy (npc, rv))) 197 if (!(tmp = check_enemy (npc, rv)))
206 { 198 {
207 if (attacker) /* if we have an attacker, check him */ 199 if (attacker) /* if we have an attacker, check him */
208 { 200 {
209 /* TODO: thats not finished */ 201 /* TODO: that's not finished */
210 /* we don't want a fight evil vs evil or good against non evil */ 202 /* we don't want a fight evil vs evil or good against non evil */
211 203
212 if (QUERY_FLAG (npc, FLAG_NEUTRAL) || QUERY_FLAG (attacker, FLAG_NEUTRAL) || /* neutral */ 204 if (QUERY_FLAG (npc, FLAG_NEUTRAL) || QUERY_FLAG (attacker, FLAG_NEUTRAL) || /* neutral */
213 (QUERY_FLAG (npc, FLAG_FRIENDLY) && QUERY_FLAG (attacker, FLAG_FRIENDLY)) || 205 (QUERY_FLAG (npc, FLAG_FRIENDLY) && QUERY_FLAG (attacker, FLAG_FRIENDLY)) ||
214 (!QUERY_FLAG (npc, FLAG_FRIENDLY) && (!QUERY_FLAG (attacker, FLAG_FRIENDLY) && attacker->type != PLAYER))) 206 (!QUERY_FLAG (npc, FLAG_FRIENDLY) && (!QUERY_FLAG (attacker, FLAG_FRIENDLY) && attacker->type != PLAYER)))
215 CLEAR_FLAG (npc, FLAG_SLEEP); /* skip it, but lets wakeup */ 207 CLEAR_FLAG (npc, FLAG_SLEEP); /* skip it, but lets wakeup */
216 else if (on_same_map (npc, attacker)) /* thats the only thing we must know... */ 208 else if (on_same_map (npc, attacker)) /* that's the only thing we must know... */
217 { 209 {
218 CLEAR_FLAG (npc, FLAG_SLEEP); /* well, NOW we really should wake up! */ 210 CLEAR_FLAG (npc, FLAG_SLEEP); /* well, NOW we really should wake up! */
219 npc->enemy = attacker; 211 npc->enemy = attacker;
220 return attacker; /* yes, we face our attacker! */ 212 return attacker; /* yes, we face our attacker! */
221 } 213 }
237/* Sees if this monster should wake up. 229/* Sees if this monster should wake up.
238 * Currently, this is only called from move_monster, and 230 * Currently, this is only called from move_monster, and
239 * if enemy is set, then so should be rv. 231 * if enemy is set, then so should be rv.
240 * returns 1 if the monster should wake up, 0 otherwise. 232 * returns 1 if the monster should wake up, 0 otherwise.
241 */ 233 */
242
243int 234int
244check_wakeup (object *op, object *enemy, rv_vector * rv) 235check_wakeup (object *op, object *enemy, rv_vector *rv)
245{ 236{
246 int radius = op->stats.Wis > MIN_MON_RADIUS ? op->stats.Wis : MIN_MON_RADIUS;
247
248 /* Trim work - if no enemy, no need to do anything below */ 237 /* Trim work - if no enemy, no need to do anything below */
249 if (!enemy) 238 if (!enemy)
250 return 0; 239 return 0;
251 240
241 int radius = max (op->stats.Wis, MIN_MON_RADIUS);
242
243 if (op->flag [FLAG_BLIND])
252 /* blinded monsters can only find nearby objects to attack */ 244 /* blinded monsters can only find nearby objects to attack */
253 if (QUERY_FLAG (op, FLAG_BLIND))
254 radius = MIN_MON_RADIUS; 245 radius = MIN_MON_RADIUS;
255 246 else if (op->map
247 && !enemy->invisible
248 && !stand_in_light (enemy)
249 && (!op->flag[FLAG_SEE_IN_DARK] || !op->flag [FLAG_SEE_INVISIBLE]))
256 /* This covers the situation where the monster is in the dark 250 /* This covers the situation where the monster is in the dark
257 * and has an enemy. If the enemy has no carried light (or isnt 251 * and has an enemy. If the enemy has no carried light (or isnt
258 * glowing!) then the monster has trouble finding the enemy. 252 * glowing!) then the monster has trouble finding the enemy.
259 * Remember we already checked to see if the monster can see in 253 * Remember we already checked to see if the monster can see in
260 * the dark. */ 254 * the dark. */
261 255 radius = min (radius, MIN_MON_RADIUS + MAX_DARKNESS - op->map->darklevel ());
262 else if (op->map && op->map->darkness > 0 && enemy && !enemy->invisible && 256 else if (!op->flag [FLAG_SLEEP])
263 !stand_in_light (enemy) && (!QUERY_FLAG (op, FLAG_SEE_IN_DARK) || !QUERY_FLAG (op, FLAG_SEE_INVISIBLE)))
264 {
265 int dark = radius / (op->map->darkness);
266
267 radius = (dark > MIN_MON_RADIUS) ? (dark + 1) : MIN_MON_RADIUS;
268 }
269 else if (!QUERY_FLAG (op, FLAG_SLEEP))
270 return 1; 257 return 1;
258
259 if (enemy->flag [FLAG_STEALTH])
260 radius = radius / 2 + 1;
271 261
272 /* enemy should already be on this map, so don't really need to check 262 /* enemy should already be on this map, so don't really need to check
273 * for that. 263 * for that.
274 */ 264 */
275 if (rv->distance < (unsigned int) (QUERY_FLAG (enemy, FLAG_STEALTH) ? (radius / 2) + 1 : radius)) 265 if (rv->distance <= radius)
276 { 266 {
277 CLEAR_FLAG (op, FLAG_SLEEP); 267 CLEAR_FLAG (op, FLAG_SLEEP);
278 return 1; 268 return 1;
279 } 269 }
270
280 return 0; 271 return 0;
281} 272}
282 273
283int 274int
284move_randomly (object *op) 275move_randomly (object *op)
285{ 276{
286 int i;
287
288 /* Give up to 15 chances for a monster to move randomly */ 277 /* Give up to 15 chances for a monster to move randomly */
289 for (i = 0; i < 15; i++) 278 for (int i = 0; i < 15; i++)
290 {
291 if (move_object (op, RANDOM () % 8 + 1)) 279 if (move_object (op, rndm (8) + 1))
292 return 1; 280 return 1;
293 } 281
294 return 0; 282 return 0;
295} 283}
296 284
297/* 285/*
298 * Move-monster returns 1 if the object has been freed, otherwise 0. 286 * Move-monster returns 1 if the object has been freed, otherwise 0.
299 */ 287 */
300
301int 288int
302move_monster (object *op) 289move_monster (object *op)
303{ 290{
304 int dir, diff, pre_att_dir; /* elmex: pre_att_dir remembers the direction before attack movement */ 291 int dir, diff, pre_att_dir; /* elmex: pre_att_dir remembers the direction before attack movement */
305 object *owner, *enemy, *part, *oph = op; 292 object *owner, *enemy, *part, *oph = op;
322 enemy->attacked_by = op; /* our ptr */ 309 enemy->attacked_by = op; /* our ptr */
323 310
324 /* generate hp, if applicable */ 311 /* generate hp, if applicable */
325 if (op->stats.Con > 0 && op->stats.hp < op->stats.maxhp) 312 if (op->stats.Con > 0 && op->stats.hp < op->stats.maxhp)
326 { 313 {
327
328 /* last heal is in funny units. Dividing by speed puts 314 /* last heal is in funny units. Dividing by speed puts
329 * the regeneration rate on a basis of time instead of 315 * the regeneration rate on a basis of time instead of
330 * #moves the monster makes. The scaling by 8 is 316 * #moves the monster makes. The scaling by 8 is
331 * to capture 8th's of a hp fraction regens 317 * to capture 8th's of a hp fraction regens
332 * 318 *
337 op->last_heal += (int) ((float) (8 * op->stats.Con) / FABS (op->speed)); 323 op->last_heal += (int) ((float) (8 * op->stats.Con) / FABS (op->speed));
338 op->stats.hp = MIN ((sint32) op->stats.hp + op->last_heal / 32, op->stats.maxhp); /* causes Con/4 hp/tick */ 324 op->stats.hp = MIN ((sint32) op->stats.hp + op->last_heal / 32, op->stats.maxhp); /* causes Con/4 hp/tick */
339 op->last_heal %= 32; 325 op->last_heal %= 32;
340 326
341 /* So if the monster has gained enough HP that they are no longer afraid */ 327 /* So if the monster has gained enough HP that they are no longer afraid */
342 if (QUERY_FLAG (op, FLAG_RUN_AWAY) && op->stats.hp >= (signed short) (((float) op->run_away / (float) 100) * (float) op->stats.maxhp)) 328 if (QUERY_FLAG (op, FLAG_RUN_AWAY) && op->stats.hp >= (signed short)(((float)op->run_away / 100.f) * (float)op->stats.maxhp))
343 CLEAR_FLAG (op, FLAG_RUN_AWAY); 329 CLEAR_FLAG (op, FLAG_RUN_AWAY);
344 330
345 if (op->stats.hp > op->stats.maxhp) 331 if (op->stats.hp > op->stats.maxhp)
346 op->stats.hp = op->stats.maxhp; 332 op->stats.hp = op->stats.maxhp;
347 } 333 }
348 334
349 /* generate sp, if applicable */ 335 /* generate sp, if applicable */
350 if (op->stats.Pow > 0 && op->stats.sp < op->stats.maxsp) 336 if (op->stats.Pow > 0 && op->stats.sp < op->stats.maxsp)
351 { 337 {
352
353 /* last_sp is in funny units. Dividing by speed puts 338 /* last_sp is in funny units. Dividing by speed puts
354 * the regeneration rate on a basis of time instead of 339 * the regeneration rate on a basis of time instead of
355 * #moves the monster makes. The scaling by 8 is 340 * #moves the monster makes. The scaling by 8 is
356 * to capture 8th's of a sp fraction regens 341 * to capture 8th's of a sp fraction regens
357 * 342 *
358 * Cast to sint32 before comparing to maxhp since otherwise an (sint16) 343 * Cast to sint32 before comparing to maxhp since otherwise an (sint16)
359 * overflow might produce monsters with negative sp. 344 * overflow might produce monsters with negative sp.
360 */ 345 */
361 346
362 op->last_sp += (int) ((float) (8 * op->stats.Pow) / FABS (op->speed)); 347 op->last_sp += (int) ((float) (8 * op->stats.Pow) / fabsf (op->speed));
363 op->stats.sp = MIN (op->stats.sp + op->last_sp / 128, op->stats.maxsp); /* causes Pow/16 sp/tick */ 348 op->stats.sp = min (op->stats.sp + op->last_sp / 128, op->stats.maxsp); /* causes Pow/16 sp/tick */
364 op->last_sp %= 128; 349 op->last_sp %= 128;
365 } 350 }
366 351
367 /* this should probably get modified by many more values. 352 /* this should probably get modified by many more values.
368 * (eg, creatures resistance to fear, level, etc. ) 353 * (eg, creatures resistance to fear, level, etc. )
369 */ 354 */
370 if (QUERY_FLAG (op, FLAG_SCARED) && !(RANDOM () % 20)) 355 if (QUERY_FLAG (op, FLAG_SCARED) && !(rndm (20)))
371 {
372 CLEAR_FLAG (op, FLAG_SCARED); /* Time to regain some "guts"... */ 356 CLEAR_FLAG (op, FLAG_SCARED); /* Time to regain some "guts"... */
373 }
374 357
375 if (INVOKE_OBJECT (MONSTER_MOVE, op, ARG_OBJECT (op->enemy))) 358 if (INVOKE_OBJECT (MONSTER_MOVE, op, ARG_OBJECT (op->enemy)))
376 return QUERY_FLAG (op, FLAG_FREED); 359 return QUERY_FLAG (op, FLAG_FREED);
377 360
378 if (QUERY_FLAG (op, FLAG_SLEEP) || QUERY_FLAG (op, FLAG_BLIND) || 361 if (QUERY_FLAG (op, FLAG_SLEEP) || QUERY_FLAG (op, FLAG_BLIND) ||
379 ((op->map->darkness > 0) && !QUERY_FLAG (op, FLAG_SEE_IN_DARK) && !QUERY_FLAG (op, FLAG_SEE_INVISIBLE))) 362 ((op->map->darklevel () > 0) && !QUERY_FLAG (op, FLAG_SEE_IN_DARK) && !QUERY_FLAG (op, FLAG_SEE_INVISIBLE)))
380 {
381 if (!check_wakeup (op, enemy, &rv)) 363 if (!check_wakeup (op, enemy, &rv))
382 return 0; 364 return 0;
383 }
384 365
385 /* check if monster pops out of hidden spot */ 366 /* check if monster pops out of hidden spot */
386 if (op->hide) 367 if (op->flag [FLAG_HIDDEN])
387 do_hidden_move (op); 368 do_hidden_move (op);
388 369
389 if (op->pick_up) 370 if (op->pick_up)
390 monster_check_pickup (op); 371 monster_check_pickup (op);
391 372
395 /* If we don't have an enemy, do special movement or the like */ 376 /* If we don't have an enemy, do special movement or the like */
396 if (!enemy) 377 if (!enemy)
397 { 378 {
398 if (QUERY_FLAG (op, FLAG_ONLY_ATTACK)) 379 if (QUERY_FLAG (op, FLAG_ONLY_ATTACK))
399 { 380 {
400 op->destroy (); 381 op->drop_and_destroy ();
401 return 1; 382 return 1;
402 } 383 }
403 384
404 /* Probably really a bug for a creature to have both 385 /* Probably really a bug for a creature to have both
405 * stand still and a movement type set. 386 * stand still and a movement type set.
408 { 389 {
409 if (op->attack_movement & HI4) 390 if (op->attack_movement & HI4)
410 { 391 {
411 switch (op->attack_movement & HI4) 392 switch (op->attack_movement & HI4)
412 { 393 {
413 case (PETMOVE): 394 case (PETMOVE):
414 pet_move (op); 395 pet_move (op);
415 break; 396 break;
416 397
417 case (CIRCLE1): 398 case (CIRCLE1):
418 circ1_move (op); 399 circ1_move (op);
419 break; 400 break;
420 401
421 case (CIRCLE2): 402 case (CIRCLE2):
422 circ2_move (op); 403 circ2_move (op);
423 break; 404 break;
424 405
425 case (PACEV): 406 case (PACEV):
426 pace_movev (op); 407 pace_movev (op);
427 break; 408 break;
428 409
429 case (PACEH): 410 case (PACEH):
430 pace_moveh (op); 411 pace_moveh (op);
431 break; 412 break;
432 413
433 case (PACEV2): 414 case (PACEV2):
434 pace2_movev (op); 415 pace2_movev (op);
435 break; 416 break;
436 417
437 case (PACEH2): 418 case (PACEH2):
438 pace2_moveh (op); 419 pace2_moveh (op);
439 break; 420 break;
440 421
441 case (RANDO): 422 case (RANDO):
442 rand_move (op); 423 rand_move (op);
443 break; 424 break;
444 425
445 case (RANDO2): 426 case (RANDO2):
446 move_randomly (op); 427 move_randomly (op);
447 break; 428 break;
448 } 429 }
430
449 return 0; 431 return 0;
450 } 432 }
451 else if (QUERY_FLAG (op, FLAG_RANDOM_MOVE)) 433 else if (QUERY_FLAG (op, FLAG_RANDOM_MOVE))
452 (void) move_randomly (op); 434 move_randomly (op);
453
454 } /* stand still */ 435 } /* stand still */
436
455 return 0; 437 return 0;
456 } /* no enemy */ 438 } /* no enemy */
457 439
458 /* We have an enemy. Block immediately below is for pets */ 440 /* We have an enemy. Block immediately below is for pets */
459 if ((op->attack_movement & HI4) == PETMOVE && (owner = op->owner) != NULL && !on_same_map (op, owner)) 441 if ((op->attack_movement & HI4) == PETMOVE
442 && (owner = op->owner) != NULL
443 && !on_same_map (op, owner)
444 && !owner->flag [FLAG_REMOVED])
460 return follow_owner (op, owner); 445 return follow_owner (op, owner);
461 446
462 /* doppleganger code to change monster facing to that of the nearest 447 /* doppleganger code to change monster facing to that of the nearest
463 * player. Hmm. The code is here, but no monster in the current 448 * player. Hmm. The code is here, but no monster in the current
464 * arch set uses it. 449 * arch set uses it.
465 */ 450 */
466 if ((op->race != NULL) && strcmp (op->race, "doppleganger") == 0) 451 if (op->race && strcmp (op->race, "doppleganger") == 0)
467 { 452 {
468 op->face = enemy->face; 453 op->face = enemy->face;
469 op->name = enemy->name; 454 op->name = enemy->name;
470 } 455 }
471 456
483 if (!QUERY_FLAG (op, FLAG_SCARED)) 468 if (!QUERY_FLAG (op, FLAG_SCARED))
484 { 469 {
485 rv_vector rv1; 470 rv_vector rv1;
486 471
487 /* now we test every part of an object .... this is a real ugly piece of code */ 472 /* now we test every part of an object .... this is a real ugly piece of code */
488 for (part = op; part != NULL; part = part->more) 473 for (part = op; part; part = part->more)
489 { 474 {
490 get_rangevector (part, enemy, &rv1, 0x1); 475 get_rangevector (part, enemy, &rv1, 0x1);
491 dir = rv1.direction; 476 dir = rv1.direction;
492 477
493 /* hm, not sure about this part - in original was a scared flag here too 478 /* hm, not sure about this part - in original was a scared flag here too
494 * but that we test above... so can be old code here 479 * but that we test above... so can be old code here
495 */ 480 */
496 if (QUERY_FLAG (op, FLAG_RUN_AWAY)) 481 if (QUERY_FLAG (op, FLAG_RUN_AWAY))
497 dir = absdir (dir + 4); 482 dir = absdir (dir + 4);
483
498 if (QUERY_FLAG (op, FLAG_CONFUSED)) 484 if (QUERY_FLAG (op, FLAG_CONFUSED))
499 dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2); 485 dir = absdir (dir + rndm (3) + rndm (3) - 2);
500 486
501 if (QUERY_FLAG (op, FLAG_CAST_SPELL) && !(RANDOM () % 3)) 487 if (QUERY_FLAG (op, FLAG_CAST_SPELL) && !(rndm (3)))
502 {
503 if (monster_cast_spell (op, part, enemy, dir, &rv1)) 488 if (monster_cast_spell (op, part, enemy, dir, &rv1))
504 return 0; 489 return 0;
505 }
506 490
507 if (QUERY_FLAG (op, FLAG_READY_SCROLL) && !(RANDOM () % 3)) 491 if (QUERY_FLAG (op, FLAG_READY_SCROLL) && !(rndm (3)))
508 {
509 if (monster_use_scroll (op, part, enemy, dir, &rv1)) 492 if (monster_use_scroll (op, part, enemy, dir, &rv1))
510 return 0; 493 return 0;
511 }
512 494
513 if (QUERY_FLAG (op, FLAG_READY_RANGE) && !(RANDOM () % 3)) 495 if (QUERY_FLAG (op, FLAG_READY_RANGE) && !(rndm (3)))
514 {
515 if (monster_use_range (op, part, enemy, dir)) 496 if (monster_use_range (op, part, enemy, dir))
516 return 0; 497 return 0;
517 } 498
518 if (QUERY_FLAG (op, FLAG_READY_SKILL) && !(RANDOM () % 3)) 499 if (QUERY_FLAG (op, FLAG_READY_SKILL) && !(rndm (3)))
519 {
520 if (monster_use_skill (op, rv.part, enemy, rv.direction)) 500 if (monster_use_skill (op, rv.part, enemy, rv.direction))
521 return 0; 501 return 0;
522 } 502
523 if (QUERY_FLAG (op, FLAG_READY_BOW) && !(RANDOM () % 2)) 503 if (QUERY_FLAG (op, FLAG_READY_BOW) && !(rndm (2)))
524 {
525 if (monster_use_bow (op, part, enemy, dir)) 504 if (monster_use_bow (op, part, enemy, dir))
526 return 0; 505 return 0;
527 }
528 } /* for processing of all parts */ 506 } /* for processing of all parts */
529 } /* If not scared */ 507 } /* If not scared */
530 508
531
532 part = rv.part; 509 part = rv.part;
533 dir = rv.direction; 510 dir = rv.direction;
534 511
512#if DEVEL
513 // if the enemy is a player, we have los. if los says we
514 // can directly reach the player, we do not deviate.
515 // for non-players, we never deviate
516 if (enemy->contr && enemy->contr->darkness_at (op->map, op->x, op->y) == LOS_BLOCKED)
517 {
518 int sdir = 0;
519
520 for (int dir = 1; dir <= 8; ++dir)
521 {
522 mapxy pos (op); pos.move (dir);
523 if (pos.normalise ())
524 {
525 mapspace &ms = pos.ms ();
526
527 if (ms.smell > op->ms ().smell)
528 {
529 printf ("%s: found smell, following it, apparently (%d, %d)\n",& op->name,op->ms().smell,ms.smell);//D
530 op->ms ().smell = ms.smell - 1;
531 sdir = dir;
532
533 // perturbing the path might let the monster lose track,
534 // but it will also wide the actual path, spreading information
535 if (!rndm (20))
536 sdir += absdir (1 - rndm (2) * 2);
537 }
538 }
539 }
540
541 if (sdir)
542 dir = sdir;
543 else
544 // no better smell found, so assume the player jumped, and erase this smell
545 {if (op->ms ().smell) printf ("erasing smell %d\n", op->ms ().smell);//D
546 ordered_mapwalk_begin (op, -1, -1, 1, 1)
547 if (m)
548 m->at (nx, ny).smell = 0;
549 ordered_mapwalk_end
550 }//D
551 }
552
553#endif
554
535 if (QUERY_FLAG (op, FLAG_SCARED) || QUERY_FLAG (op, FLAG_RUN_AWAY)) 555 if (QUERY_FLAG (op, FLAG_SCARED) || QUERY_FLAG (op, FLAG_RUN_AWAY))
536 dir = absdir (dir + 4); 556 dir = absdir (dir + 4);
537 557
538 if (QUERY_FLAG (op, FLAG_CONFUSED)) 558 if (QUERY_FLAG (op, FLAG_CONFUSED))
539 dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2); 559 dir = absdir (dir + rndm (3) + rndm (3) - 2);
540 560
541 pre_att_dir = dir; /* remember the original direction */ 561 pre_att_dir = dir; /* remember the original direction */
542 562
543 if ((op->attack_movement & LO4) && !QUERY_FLAG (op, FLAG_SCARED)) 563 if ((op->attack_movement & LO4) && !QUERY_FLAG (op, FLAG_SCARED))
544 { 564 {
545 switch (op->attack_movement & LO4) 565 switch (op->attack_movement & LO4)
546 { 566 {
547 case DISTATT: 567 case DISTATT:
548 dir = dist_att (dir, op, enemy, part, &rv); 568 dir = dist_att (dir, op, enemy, part, &rv);
549 break; 569 break;
550 570
551 case RUNATT: 571 case RUNATT:
552 dir = run_att (dir, op, enemy, part, &rv); 572 dir = run_att (dir, op, enemy, part, &rv);
553 break; 573 break;
554 574
555 case HITRUN: 575 case HITRUN:
556 dir = hitrun_att (dir, op, enemy); 576 dir = hitrun_att (dir, op, enemy);
557 break; 577 break;
558 578
559 case WAITATT: 579 case WAITATT:
560 dir = wait_att (dir, op, enemy, part, &rv); 580 dir = wait_att (dir, op, enemy, part, &rv);
561 break; 581 break;
562 582
563 case RUSH: /* default - monster normally moves towards player */ 583 case RUSH: /* default - monster normally moves towards player */
564 case ALLRUN: 584 case ALLRUN:
565 break; 585 break;
566 586
567 case DISTHIT: 587 case DISTHIT:
568 dir = disthit_att (dir, op, enemy, part, &rv); 588 dir = disthit_att (dir, op, enemy, part, &rv);
569 break; 589 break;
570 590
571 case WAIT2: 591 case WAIT2:
572 dir = wait_att2 (dir, op, enemy, part, &rv); 592 dir = wait_att2 (dir, op, enemy, part, &rv);
573 break; 593 break;
574 594
575 default: 595 default:
576 LOG (llevDebug, "Illegal low mon-move: %d\n", op->attack_movement & LO4); 596 LOG (llevDebug, "Illegal low mon-move: %d\n", op->attack_movement & LO4);
577 } 597 }
578 } 598 }
579 599
580 if (!dir) 600 if (!dir)
581 return 0; 601 return 0;
591 return 0; 611 return 0;
592 } 612 }
593 613
594 if (QUERY_FLAG (op, FLAG_SCARED) || !can_hit (part, enemy, &rv) || QUERY_FLAG (op, FLAG_RUN_AWAY)) 614 if (QUERY_FLAG (op, FLAG_SCARED) || !can_hit (part, enemy, &rv) || QUERY_FLAG (op, FLAG_RUN_AWAY))
595 { 615 {
596
597 /* Try move around corners if !close */ 616 /* Try move around corners if !close */
598 int maxdiff = (QUERY_FLAG (op, FLAG_ONLY_ATTACK) || RANDOM () & 1) ? 1 : 2; 617 int maxdiff = (QUERY_FLAG (op, FLAG_ONLY_ATTACK) || rndm (2)) ? 1 : 2;
599 618
600 for (diff = 1; diff <= maxdiff; diff++) 619 for (diff = 1; diff <= maxdiff; diff++)
601 { 620 {
602 /* try different detours */ 621 /* try different detours */
603 int m = 1 - (RANDOM () & 2); /* Try left or right first? */ 622 int m = 1 - rndm (2) * 2; /* Try left or right first? */
604 623
605 if (move_object (op, absdir (dir + diff * m)) || move_object (op, absdir (dir - diff * m))) 624 if (move_object (op, absdir (dir + diff * m)) || move_object (op, absdir (dir - diff * m)))
606 return 0; 625 return 0;
607 } 626 }
608 } 627 }
635 { 654 {
636 object *nearest_player = get_nearest_player (op); 655 object *nearest_player = get_nearest_player (op);
637 656
638 if (nearest_player && nearest_player != enemy && !can_hit (part, enemy, &rv)) 657 if (nearest_player && nearest_player != enemy && !can_hit (part, enemy, &rv))
639 { 658 {
640 op->enemy = NULL; 659 op->enemy = 0;
641 enemy = nearest_player; 660 enemy = nearest_player;
642 } 661 }
643 } 662 }
644 663
645 if (!QUERY_FLAG (op, FLAG_SCARED) && can_hit (part, enemy, &rv)) 664 if (!QUERY_FLAG (op, FLAG_SCARED) && can_hit (part, enemy, &rv))
651 * still be pretty nasty. 670 * still be pretty nasty.
652 */ 671 */
653 if (QUERY_FLAG (op, FLAG_RUN_AWAY)) 672 if (QUERY_FLAG (op, FLAG_RUN_AWAY))
654 { 673 {
655 part->stats.wc += 10; 674 part->stats.wc += 10;
656 (void) skill_attack (enemy, part, 0, NULL, NULL); 675 skill_attack (enemy, part, 0, NULL, NULL);
657 part->stats.wc -= 10; 676 part->stats.wc -= 10;
658 } 677 }
659 else 678 else
660 (void) skill_attack (enemy, part, 0, NULL, NULL); 679 skill_attack (enemy, part, 0, NULL, NULL);
661 } /* if monster is in attack range */ 680 } /* if monster is in attack range */
662 681
663 if (QUERY_FLAG (part, FLAG_FREED)) /* Might be freed by ghost-attack or hit-back */ 682 if (QUERY_FLAG (part, FLAG_FREED)) /* Might be freed by ghost-attack or hit-back */
664 return 1; 683 return 1;
665 684
666 if (QUERY_FLAG (op, FLAG_ONLY_ATTACK)) 685 if (QUERY_FLAG (op, FLAG_ONLY_ATTACK))
667 { 686 {
668 op->remove ();
669 op->destroy (); 687 op->drop_and_destroy ();
670 return 1; 688 return 1;
671 } 689 }
690
672 return 0; 691 return 0;
673} 692}
674 693
675int 694int
676can_hit (object *ob1, object *ob2, rv_vector * rv) 695can_hit (object *ob1, object *ob2, rv_vector * rv)
677{ 696{
678 object *more; 697 object *more;
679 rv_vector rv1; 698 rv_vector rv1;
680 699
681 if (QUERY_FLAG (ob1, FLAG_CONFUSED) && !(RANDOM () % 3)) 700 if (QUERY_FLAG (ob1, FLAG_CONFUSED) && !(rndm (3)))
682 return 0; 701 return 0;
683 702
684 if (abs (rv->distance_x) < 2 && abs (rv->distance_y) < 2) 703 if (abs (rv->distance_x) < 2 && abs (rv->distance_y) < 2)
685 return 1; 704 return 1;
686 705
691 { 710 {
692 get_rangevector (ob1, more, &rv1, 0); 711 get_rangevector (ob1, more, &rv1, 0);
693 if (abs (rv1.distance_x) < 2 && abs (rv1.distance_y) < 2) 712 if (abs (rv1.distance_x) < 2 && abs (rv1.distance_y) < 2)
694 return 1; 713 return 1;
695 } 714 }
715
696 return 0; 716 return 0;
697
698} 717}
699 718
700/* Returns 1 is monster should cast spell sp at an enemy 719/* Returns 1 is monster should cast spell sp at an enemy
701 * Returns 0 if the monster should not cast this spell. 720 * Returns 0 if the monster should not cast this spell.
702 * 721 *
720 spell_ob->subtype == SP_EXPLOSION || spell_ob->subtype == SP_CONE || 739 spell_ob->subtype == SP_EXPLOSION || spell_ob->subtype == SP_CONE ||
721 spell_ob->subtype == SP_BOMB || spell_ob->subtype == SP_SMITE || 740 spell_ob->subtype == SP_BOMB || spell_ob->subtype == SP_SMITE ||
722 spell_ob->subtype == SP_MAGIC_MISSILE || spell_ob->subtype == SP_SUMMON_GOLEM || 741 spell_ob->subtype == SP_MAGIC_MISSILE || spell_ob->subtype == SP_SUMMON_GOLEM ||
723 spell_ob->subtype == SP_MAGIC_WALL || spell_ob->subtype == SP_SUMMON_MONSTER || 742 spell_ob->subtype == SP_MAGIC_WALL || spell_ob->subtype == SP_SUMMON_MONSTER ||
724 spell_ob->subtype == SP_MOVING_BALL || spell_ob->subtype == SP_SWARM || spell_ob->subtype == SP_INVISIBLE) 743 spell_ob->subtype == SP_MOVING_BALL || spell_ob->subtype == SP_SWARM || spell_ob->subtype == SP_INVISIBLE)
725
726 return 1; 744 return 1;
727 745
728 return 0; 746 return 0;
729} 747}
730
731 748
732#define MAX_KNOWN_SPELLS 20 749#define MAX_KNOWN_SPELLS 20
733 750
734/* Returns a randomly selected spell. This logic is still 751/* Returns a randomly selected spell. This logic is still
735 * less than ideal. This code also only seems to deal with 752 * less than ideal. This code also only seems to deal with
738 */ 755 */
739object * 756object *
740monster_choose_random_spell (object *monster) 757monster_choose_random_spell (object *monster)
741{ 758{
742 object *altern[MAX_KNOWN_SPELLS]; 759 object *altern[MAX_KNOWN_SPELLS];
743 object *tmp;
744 int i = 0; 760 int i = 0;
745 761
746 for (tmp = monster->inv; tmp != NULL; tmp = tmp->below) 762 for (object *tmp = monster->inv; tmp; tmp = tmp->below)
747 if (tmp->type == SPELLBOOK || tmp->type == SPELL) 763 if (tmp->type == SPELLBOOK || tmp->type == SPELL)
748 { 764 {
749 /* Check and see if it's actually a useful spell. 765 /* Check and see if it's actually a useful spell.
750 * If its a spellbook, the spell is actually the inventory item. 766 * If its a spellbook, the spell is actually the inventory item.
751 * if it is a spell, then it is just the object itself. 767 * if it is a spell, then it is just the object itself.
752 */ 768 */
753 if (monster_should_cast_spell (monster, (tmp->type == SPELLBOOK) ? tmp->inv : tmp)) 769 if (monster_should_cast_spell (monster, (tmp->type == SPELLBOOK) ? tmp->inv : tmp))
754 { 770 {
755 altern[i++] = tmp; 771 altern [i++] = tmp;
772
756 if (i == MAX_KNOWN_SPELLS) 773 if (i == MAX_KNOWN_SPELLS)
757 break; 774 break;
758 } 775 }
759 } 776 }
760 if (!i) 777
761 return NULL; 778 return i ? altern [rndm (i)] : 0;
762 return altern[RANDOM () % i];
763} 779}
764 780
765/* This checks to see if the monster should cast a spell/ability. 781/* This checks to see if the monster should cast a spell/ability.
766 * it returns true if the monster casts a spell, 0 if he doesn't. 782 * it returns true if the monster casts a spell, 0 if he doesn't.
767 * head is the head of the monster. 783 * head is the head of the monster.
768 * part is the part of the monster we are checking against. 784 * part is the part of the monster we are checking against.
769 * pl is the target. 785 * pl is the target.
770 * dir is the direction to case. 786 * dir is the direction to case.
771 * rv is the vector which describes where the enemy is. 787 * rv is the vector which describes where the enemy is.
772 */ 788 */
773
774int 789int
775monster_cast_spell (object *head, object *part, object *pl, int dir, rv_vector * rv) 790monster_cast_spell (object *head, object *part, object *pl, int dir, rv_vector * rv)
776{ 791{
777 object *spell_item; 792 object *spell_item;
778 object *owner; 793 object *owner;
789 804
790 if (QUERY_FLAG (head, FLAG_FRIENDLY) && (owner = head->owner) != NULL) 805 if (QUERY_FLAG (head, FLAG_FRIENDLY) && (owner = head->owner) != NULL)
791 { 806 {
792 get_rangevector (head, owner, &rv1, 0x1); 807 get_rangevector (head, owner, &rv1, 0x1);
793 if (dirdiff (dir, rv1.direction) < 2) 808 if (dirdiff (dir, rv1.direction) < 2)
794 {
795 return 0; /* Might hit owner with spell */ 809 return 0; /* Might hit owner with spell */
796 }
797 } 810 }
798 811
799 if (QUERY_FLAG (head, FLAG_CONFUSED)) 812 if (QUERY_FLAG (head, FLAG_CONFUSED))
800 dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2); 813 dir = absdir (dir + rndm (3) + rndm (3) - 2);
801 814
802 /* If the monster hasn't already chosen a spell, choose one 815 /* If the monster hasn't already chosen a spell, choose one
803 * I'm not sure if it really make sense to pre-select spells (events 816 * I'm not sure if it really make sense to pre-select spells (events
804 * could be different by the time the monster goes again). 817 * could be different by the time the monster goes again).
805 */ 818 */
809 { 822 {
810 LOG (llevMonster, "Turned off spells in %s\n", &head->name); 823 LOG (llevMonster, "Turned off spells in %s\n", &head->name);
811 CLEAR_FLAG (head, FLAG_CAST_SPELL); /* Will be turned on when picking up book */ 824 CLEAR_FLAG (head, FLAG_CAST_SPELL); /* Will be turned on when picking up book */
812 return 0; 825 return 0;
813 } 826 }
827
814 if (spell_item->type == SPELLBOOK) 828 if (spell_item->type == SPELLBOOK)
815 { 829 {
816 if (!spell_item->inv) 830 if (!spell_item->inv)
817 { 831 {
818 LOG (llevError, "spellbook %s does not contain a spell?\n", &spell_item->name); 832 LOG (llevError, "spellbook %s does not contain a spell?\n", &spell_item->name);
819 return 0; 833 return 0;
820 } 834 }
835
821 spell_item = spell_item->inv; 836 spell_item = spell_item->inv;
822 } 837 }
823 } 838 }
824 else 839 else
825 spell_item = head->spellitem; 840 spell_item = head->spellitem;
844 /* set this to null, so next time monster will choose something different */ 859 /* set this to null, so next time monster will choose something different */
845 head->spellitem = NULL; 860 head->spellitem = NULL;
846 861
847 return cast_spell (part, part, dir, spell_item, NULL); 862 return cast_spell (part, part, dir, spell_item, NULL);
848} 863}
849
850 864
851int 865int
852monster_use_scroll (object *head, object *part, object *pl, int dir, rv_vector * rv) 866monster_use_scroll (object *head, object *part, object *pl, int dir, rv_vector * rv)
853{ 867{
854 object *scroll; 868 object *scroll;
872 return 0; /* Might hit owner with spell */ 886 return 0; /* Might hit owner with spell */
873 } 887 }
874 } 888 }
875 889
876 if (QUERY_FLAG (head, FLAG_CONFUSED)) 890 if (QUERY_FLAG (head, FLAG_CONFUSED))
877 dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2); 891 dir = absdir (dir + rndm (3) + rndm (3) - 2);
878 892
879 for (scroll = head->inv; scroll; scroll = scroll->below) 893 for (scroll = head->inv; scroll; scroll = scroll->below)
880 if (scroll->type == SCROLL && monster_should_cast_spell (head, scroll->inv)) 894 if (scroll->type == SCROLL && monster_should_cast_spell (head, scroll->inv))
881 break; 895 break;
882 896
904 * The skills we are treating here are all but those. -b.t. 918 * The skills we are treating here are all but those. -b.t.
905 * 919 *
906 * At the moment this is only useful for throwing, perhaps for 920 * At the moment this is only useful for throwing, perhaps for
907 * stealing. TODO: This should be more integrated in the game. -MT, 25.11.01 921 * stealing. TODO: This should be more integrated in the game. -MT, 25.11.01
908 */ 922 */
909
910int 923int
911monster_use_skill (object *head, object *part, object *pl, int dir) 924monster_use_skill (object *head, object *part, object *pl, int dir)
912{ 925{
913 object *skill, *owner; 926 object *skill, *owner;
914 927
920 int dir2 = find_dir_2 (head->x - owner->x, head->y - owner->y); 933 int dir2 = find_dir_2 (head->x - owner->x, head->y - owner->y);
921 934
922 if (dirdiff (dir, dir2) < 1) 935 if (dirdiff (dir, dir2) < 1)
923 return 0; /* Might hit owner with skill -thrown rocks for example ? */ 936 return 0; /* Might hit owner with skill -thrown rocks for example ? */
924 } 937 }
938
925 if (QUERY_FLAG (head, FLAG_CONFUSED)) 939 if (QUERY_FLAG (head, FLAG_CONFUSED))
926 dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2); 940 dir = absdir (dir + rndm (3) + rndm (3) - 2);
927 941
928 /* skill selection - monster will use the next unused skill. 942 /* skill selection - monster will use the next unused skill.
929 * well...the following scenario will allow the monster to 943 * well...the following scenario will allow the monster to
930 * toggle between 2 skills. One day it would be nice to make 944 * toggle between 2 skills. One day it would be nice to make
931 * more skills available to monsters. 945 * more skills available to monsters.
932 */ 946 */
933
934 for (skill = head->inv; skill != NULL; skill = skill->below) 947 for (skill = head->inv; skill; skill = skill->below)
935 if (skill->type == SKILL && skill != head->chosen_skill) 948 if (skill->type == SKILL && skill != head->chosen_skill)
936 { 949 {
937 head->chosen_skill = skill; 950 head->chosen_skill = skill;
938 break; 951 break;
939 } 952 }
942 { 955 {
943 LOG (llevDebug, "Error: Monster %s (%d) has FLAG_READY_SKILL without skill.\n", &head->name, head->count); 956 LOG (llevDebug, "Error: Monster %s (%d) has FLAG_READY_SKILL without skill.\n", &head->name, head->count);
944 CLEAR_FLAG (head, FLAG_READY_SKILL); 957 CLEAR_FLAG (head, FLAG_READY_SKILL);
945 return 0; 958 return 0;
946 } 959 }
960
947 /* use skill */ 961 /* use skill */
948 return do_skill (head, part, head->chosen_skill, dir, NULL); 962 return do_skill (head, part, head->chosen_skill, dir, NULL);
949} 963}
950 964
951/* Monster will use a ranged spell attack. */ 965/* Monster will use a ranged spell attack. */
952
953int 966int
954monster_use_range (object *head, object *part, object *pl, int dir) 967monster_use_range (object *head, object *part, object *pl, int dir)
955{ 968{
956 object *wand, *owner; 969 object *wand, *owner;
957 int at_least_one = 0; 970 int at_least_one = 0;
964 int dir2 = find_dir_2 (head->x - owner->x, head->y - owner->y); 977 int dir2 = find_dir_2 (head->x - owner->x, head->y - owner->y);
965 978
966 if (dirdiff (dir, dir2) < 2) 979 if (dirdiff (dir, dir2) < 2)
967 return 0; /* Might hit owner with spell */ 980 return 0; /* Might hit owner with spell */
968 } 981 }
982
969 if (QUERY_FLAG (head, FLAG_CONFUSED)) 983 if (QUERY_FLAG (head, FLAG_CONFUSED))
970 dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2); 984 dir = absdir (dir + rndm (3) + rndm (3) - 2);
971 985
972 for (wand = head->inv; wand != NULL; wand = wand->below) 986 for (wand = head->inv; wand; wand = wand->below)
973 { 987 {
974 if (wand->type == WAND) 988 if (wand->type == WAND)
975 { 989 {
976 /* Found a wand, let's see if it has charges left */ 990 /* Found a wand, let's see if it has charges left */
977 at_least_one = 1; 991 at_least_one = 1;
983 if (!(--wand->stats.food)) 997 if (!(--wand->stats.food))
984 { 998 {
985 if (wand->arch) 999 if (wand->arch)
986 { 1000 {
987 CLEAR_FLAG (wand, FLAG_ANIMATE); 1001 CLEAR_FLAG (wand, FLAG_ANIMATE);
988 wand->face = wand->arch->clone.face; 1002 wand->face = wand->arch->face;
989 wand->set_speed (0); 1003 wand->set_speed (0);
990 } 1004 }
991 } 1005 }
992 /* Success */ 1006 /* Success */
993 return 1; 1007 return 1;
1012 } 1026 }
1013 1027
1014 if (at_least_one) 1028 if (at_least_one)
1015 return 0; 1029 return 0;
1016 1030
1017 LOG (llevError, "Error: Monster %s (%d) HAS_READY_RANG() without wand/horn/rod.\n", &head->name, head->count); 1031 LOG (llevError, "Error: Monster %s (%d) HAS_READY_RANGE() without wand/horn/rod.\n", &head->name, head->count);
1018 CLEAR_FLAG (head, FLAG_READY_RANGE); 1032 CLEAR_FLAG (head, FLAG_READY_RANGE);
1019 return 0; 1033 return 0;
1020} 1034}
1021 1035
1022int 1036int
1024{ 1038{
1025 object *owner; 1039 object *owner;
1026 1040
1027 if (!(dir = path_to_player (part, pl, 0))) 1041 if (!(dir = path_to_player (part, pl, 0)))
1028 return 0; 1042 return 0;
1043
1029 if (QUERY_FLAG (head, FLAG_CONFUSED)) 1044 if (QUERY_FLAG (head, FLAG_CONFUSED))
1030 dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2); 1045 dir = absdir (dir + rndm (3) + rndm (3) - 2);
1031 1046
1032 if (QUERY_FLAG (head, FLAG_FRIENDLY) && (owner = head->owner) != NULL) 1047 if (QUERY_FLAG (head, FLAG_FRIENDLY) && (owner = head->owner) != NULL)
1033 { 1048 {
1034 int dir2 = find_dir_2 (head->x - owner->x, head->y - owner->y); 1049 int dir2 = find_dir_2 (head->x - owner->x, head->y - owner->y);
1035 1050
1041 return fire_bow (head, part, NULL, dir, 0, part->x, part->y); 1056 return fire_bow (head, part, NULL, dir, 0, part->x, part->y);
1042 1057
1043} 1058}
1044 1059
1045/* Checks if putting on 'item' will make 'who' do more 1060/* Checks if putting on 'item' will make 'who' do more
1046 * damage. This is a very simplistic check - also checking things 1061 * damage. This is a very simplistic check - also checking things
1047 * like speed and ac are also relevant. 1062 * like speed and ac are also relevant.
1048 * 1063 *
1049 * return true if item is a better object. 1064 * return true if item is a better object.
1050 */ 1065 */
1051
1052int 1066int
1053check_good_weapon (object *who, object *item) 1067check_good_weapon (object *who, object *item)
1054{ 1068{
1055 object *other_weap; 1069 object *other_weap;
1056 int val = 0, i; 1070 int val = 0, i;
1057 1071
1058 for (other_weap = who->inv; other_weap != NULL; other_weap = other_weap->below) 1072 for (other_weap = who->inv; other_weap; other_weap = other_weap->below)
1059 if (other_weap->type == item->type && QUERY_FLAG (other_weap, FLAG_APPLIED)) 1073 if (other_weap->type == item->type && QUERY_FLAG (other_weap, FLAG_APPLIED))
1060 break; 1074 break;
1061 1075
1062 if (other_weap == NULL) /* No other weapons */ 1076 if (!other_weap) /* No other weapons */
1063 return 1; 1077 return 1;
1064 1078
1065 /* Rather than go through and apply the new one, and see if it is 1079 /* Rather than go through and apply the new one, and see if it is
1066 * better, just do some simple checks 1080 * better, just do some simple checks
1067 * Put some multipliers for things that hvae several effects, 1081 * Put some multipliers for things that hvae several effects,
1072 val += (item->magic - other_weap->magic) * 3; 1086 val += (item->magic - other_weap->magic) * 3;
1073 /* Monsters don't really get benefits from things like regen rates 1087 /* Monsters don't really get benefits from things like regen rates
1074 * from items. But the bonus for their stats are very important. 1088 * from items. But the bonus for their stats are very important.
1075 */ 1089 */
1076 for (i = 0; i < NUM_STATS; i++) 1090 for (i = 0; i < NUM_STATS; i++)
1077 val += (get_attr_value (&item->stats, i) - get_attr_value (&other_weap->stats, i)) * 2; 1091 val += item->stats.stat (i) - other_weap->stats.stat (i) * 2;
1078 1092
1079 if (val > 0) 1093 if (val > 0)
1080 return 1; 1094 return 1;
1081 else 1095 else
1082 return 0; 1096 return 0;
1083
1084} 1097}
1085 1098
1086int 1099int
1087check_good_armour (object *who, object *item) 1100check_good_armour (object *who, object *item)
1088{ 1101{
1089 object *other_armour; 1102 object *other_armour;
1090 int val = 0, i; 1103 int val = 0, i;
1091 1104
1092 for (other_armour = who->inv; other_armour != NULL; other_armour = other_armour->below) 1105 for (other_armour = who->inv; other_armour; other_armour = other_armour->below)
1093 if (other_armour->type == item->type && QUERY_FLAG (other_armour, FLAG_APPLIED)) 1106 if (other_armour->type == item->type && QUERY_FLAG (other_armour, FLAG_APPLIED))
1094 break; 1107 break;
1095 1108
1096 if (other_armour == NULL) /* No other armour, use the new */ 1109 if (other_armour == NULL) /* No other armour, use the new */
1097 return 1; 1110 return 1;
1119 1132
1120 if (val > 0) 1133 if (val > 0)
1121 return 1; 1134 return 1;
1122 else 1135 else
1123 return 0; 1136 return 0;
1124
1125} 1137}
1126 1138
1127/* 1139/*
1128 * monster_check_pickup(): checks for items that monster can pick up. 1140 * monster_check_pickup(): checks for items that monster can pick up.
1129 * 1141 *
1137 * This function was seen be continueing looping at one point (tmp->below 1149 * This function was seen be continueing looping at one point (tmp->below
1138 * became a recursive loop. It may be better to call monster_check_apply 1150 * became a recursive loop. It may be better to call monster_check_apply
1139 * after we pick everything up, since that function may call others which 1151 * after we pick everything up, since that function may call others which
1140 * affect stacking on this space. 1152 * affect stacking on this space.
1141 */ 1153 */
1142
1143void 1154void
1144monster_check_pickup (object *monster) 1155monster_check_pickup (object *monster)
1145{ 1156{
1146 object *tmp, *next; 1157 object *tmp, *next;
1147 1158
1166 * monster_can_pick(): If the monster is interested in picking up 1177 * monster_can_pick(): If the monster is interested in picking up
1167 * the item, then return 0. Otherwise 0. 1178 * the item, then return 0. Otherwise 0.
1168 * Instead of pick_up, flags for "greed", etc, should be used. 1179 * Instead of pick_up, flags for "greed", etc, should be used.
1169 * I've already utilized flags for bows, wands, rings, etc, etc. -Frank. 1180 * I've already utilized flags for bows, wands, rings, etc, etc. -Frank.
1170 */ 1181 */
1171
1172int 1182int
1173monster_can_pick (object *monster, object *item) 1183monster_can_pick (object *monster, object *item)
1174{ 1184{
1175 int flag = 0; 1185 int flag = 0;
1176 int i; 1186 int i;
1222 case ROD: 1232 case ROD:
1223 flag = QUERY_FLAG (monster, FLAG_USE_RANGE); 1233 flag = QUERY_FLAG (monster, FLAG_USE_RANGE);
1224 break; 1234 break;
1225 1235
1226 case SPELLBOOK: 1236 case SPELLBOOK:
1227 flag = (monster->arch != NULL && QUERY_FLAG ((&monster->arch->clone), FLAG_CAST_SPELL)); 1237 flag = monster->arch && QUERY_FLAG (monster->arch, FLAG_CAST_SPELL);
1228 break; 1238 break;
1229 1239
1230 case SCROLL: 1240 case SCROLL:
1231 flag = QUERY_FLAG (monster, FLAG_USE_SCROLL); 1241 flag = QUERY_FLAG (monster, FLAG_USE_SCROLL);
1232 break; 1242 break;
1234 case BOW: 1244 case BOW:
1235 case ARROW: 1245 case ARROW:
1236 flag = QUERY_FLAG (monster, FLAG_USE_BOW); 1246 flag = QUERY_FLAG (monster, FLAG_USE_BOW);
1237 break; 1247 break;
1238 } 1248 }
1249
1239 /* Simplistic check - if the monster has a location to equip it, he will 1250 /* Simplistic check - if the monster has a location to equip it, he will
1240 * pick it up. Note that this doesn't handle cases where an item may 1251 * pick it up. Note that this doesn't handle cases where an item may
1241 * use several locations. 1252 * use several locations.
1242 */ 1253 */
1243 for (i = 0; i < NUM_BODY_LOCATIONS; i++) 1254 for (i = 0; i < NUM_BODY_LOCATIONS; i++)
1244 { 1255 {
1245 if (monster->body_info[i] && item->body_info[i]) 1256 if (monster->slot[i].info && item->slot[i].info)
1246 { 1257 {
1247 flag = 1; 1258 flag = 1;
1248 break; 1259 break;
1249 } 1260 }
1250 } 1261 }
1251 1262
1252 if (((!(monster->pick_up & 32)) && flag) || ((monster->pick_up & 32) && (!flag))) 1263 if (((!(monster->pick_up & 32)) && flag) || ((monster->pick_up & 32) && (!flag)))
1253 return 1; 1264 return 1;
1265
1254 return 0; 1266 return 0;
1255} 1267}
1256 1268
1257/* 1269/*
1258 * monster_apply_below(): 1270 * monster_apply_below():
1259 * Vick's (vick@bern.docs.uu.se) @921107 -> If a monster who's 1271 * Vick's (vick@bern.docs.uu.se) @921107 -> If a monster who's
1260 * eager to apply things, encounters something apply-able, 1272 * eager to apply things, encounters something apply-able,
1261 * then make him apply it 1273 * then make him apply it
1262 */ 1274 */
1263
1264void 1275void
1265monster_apply_below (object *monster) 1276monster_apply_below (object *monster)
1266{ 1277{
1267 object *tmp, *next; 1278 object *tmp, *next;
1268 1279
1295 * a pointer to that object is returned, so it can be dropped. 1306 * a pointer to that object is returned, so it can be dropped.
1296 * (so that other monsters can pick it up and use it) 1307 * (so that other monsters can pick it up and use it)
1297 * Note that as things are now, monsters never drop something - 1308 * Note that as things are now, monsters never drop something -
1298 * they can pick up all that they can use. 1309 * they can pick up all that they can use.
1299 */ 1310 */
1300
1301/* Sept 96, fixed this so skills will be readied -b.t.*/ 1311/* Sept 96, fixed this so skills will be readied -b.t.*/
1302
1303void 1312void
1304monster_check_apply (object *mon, object *item) 1313monster_check_apply (object *mon, object *item)
1305{ 1314{
1306
1307 int flag = 0; 1315 int flag = 0;
1308 1316
1309 if (item->type == SPELLBOOK && mon->arch != NULL && (QUERY_FLAG ((&mon->arch->clone), FLAG_CAST_SPELL))) 1317 if (item->type == SPELLBOOK && mon->arch && (QUERY_FLAG (mon->arch, FLAG_CAST_SPELL)))
1310 { 1318 {
1311 SET_FLAG (mon, FLAG_CAST_SPELL); 1319 SET_FLAG (mon, FLAG_CAST_SPELL);
1312 return; 1320 return;
1313 } 1321 }
1314 1322
1323 if (QUERY_FLAG (mon, FLAG_USE_BOW) && item->type == ARROW) 1331 if (QUERY_FLAG (mon, FLAG_USE_BOW) && item->type == ARROW)
1324 { 1332 {
1325 /* Check for the right kind of bow */ 1333 /* Check for the right kind of bow */
1326 object *bow; 1334 object *bow;
1327 1335
1328 for (bow = mon->inv; bow != NULL; bow = bow->below) 1336 for (bow = mon->inv; bow; bow = bow->below)
1329 if (bow->type == BOW && bow->race == item->race) 1337 if (bow->type == BOW && bow->race == item->race)
1330 { 1338 {
1331 SET_FLAG (mon, FLAG_READY_BOW); 1339 SET_FLAG (mon, FLAG_READY_BOW);
1332 LOG (llevMonster, "Found correct bow for arrows.\n"); 1340 LOG (llevMonster, "Found correct bow for arrows.\n");
1333 return; /* nothing more to do for arrows */ 1341 return; /* nothing more to do for arrows */
1385 */ 1393 */
1386 SET_FLAG (mon, FLAG_READY_SKILL); 1394 SET_FLAG (mon, FLAG_READY_SKILL);
1387 return; 1395 return;
1388 } 1396 }
1389 1397
1390
1391 /* if we don't match one of the above types, return now. 1398 /* if we don't match one of the above types, return now.
1392 * can_apply_object will say that we can apply things like flesh, 1399 * can_apply_object will say that we can apply things like flesh,
1393 * bolts, and whatever else, because it only checks against the 1400 * bolts, and whatever else, because it only checks against the
1394 * body_info locations. 1401 * body_info locations.
1395 */ 1402 */
1406 /* should only be applying this item, not unapplying it. 1413 /* should only be applying this item, not unapplying it.
1407 * also, ignore status of curse so they can take off old armour. 1414 * also, ignore status of curse so they can take off old armour.
1408 * monsters have some advantages after all. 1415 * monsters have some advantages after all.
1409 */ 1416 */
1410 manual_apply (mon, item, AP_APPLY | AP_IGNORE_CURSE); 1417 manual_apply (mon, item, AP_APPLY | AP_IGNORE_CURSE);
1411
1412 return;
1413} 1418}
1414 1419
1415void 1420void
1416npc_call_help (object *op) 1421npc_call_help (object *op)
1417{ 1422{
1435 if (QUERY_FLAG (npc, FLAG_ALIVE) && QUERY_FLAG (npc, FLAG_UNAGGRESSIVE)) 1440 if (QUERY_FLAG (npc, FLAG_ALIVE) && QUERY_FLAG (npc, FLAG_UNAGGRESSIVE))
1436 npc->enemy = op->enemy; 1441 npc->enemy = op->enemy;
1437 } 1442 }
1438} 1443}
1439 1444
1440
1441int 1445int
1442dist_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv) 1446dist_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv)
1443{ 1447{
1444
1445 if (can_hit (part, enemy, rv)) 1448 if (can_hit (part, enemy, rv))
1446 return dir; 1449 return dir;
1450
1447 if (rv->distance < 10) 1451 if (rv->distance < 10)
1448 return absdir (dir + 4); 1452 return absdir (dir + 4);
1449 else if (rv->distance > 18) 1453 else if (rv->distance > 18)
1450 return dir; 1454 return dir;
1455
1451 return 0; 1456 return 0;
1452} 1457}
1453 1458
1454int 1459int
1455run_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv) 1460run_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv)
1456{ 1461{
1457
1458 if ((can_hit (part, enemy, rv) && ob->move_status < 20) || ob->move_status < 20) 1462 if ((can_hit (part, enemy, rv) && ob->move_status < 20) || ob->move_status < 20)
1459 { 1463 {
1460 ob->move_status++; 1464 ob->move_status++;
1461 return (dir); 1465 return (dir);
1462 } 1466 }
1463 else if (ob->move_status > 20) 1467 else if (ob->move_status > 20)
1464 ob->move_status = 0; 1468 ob->move_status = 0;
1469
1465 return absdir (dir + 4); 1470 return absdir (dir + 4);
1466} 1471}
1467 1472
1468int 1473int
1469hitrun_att (int dir, object *ob, object *enemy) 1474hitrun_att (int dir, object *ob, object *enemy)
1472 return dir; 1477 return dir;
1473 else if (ob->move_status < 50) 1478 else if (ob->move_status < 50)
1474 return absdir (dir + 4); 1479 return absdir (dir + 4);
1475 else 1480 else
1476 ob->move_status = 0; 1481 ob->move_status = 0;
1482
1477 return absdir (dir + 4); 1483 return absdir (dir + 4);
1478} 1484}
1479 1485
1480int 1486int
1481wait_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv) 1487wait_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv)
1490 return 0; 1496 return 0;
1491 else if (ob->move_status < 10) 1497 else if (ob->move_status < 10)
1492 return dir; 1498 return dir;
1493 else if (ob->move_status < 15) 1499 else if (ob->move_status < 15)
1494 return absdir (dir + 4); 1500 return absdir (dir + 4);
1501
1495 ob->move_status = 0; 1502 ob->move_status = 0;
1496 return 0; 1503 return 0;
1497} 1504}
1498 1505
1499int 1506int
1507 * at least one map has this set, and whatever the map contains, the 1514 * at least one map has this set, and whatever the map contains, the
1508 * server should try to be resilant enough to avoid the problem 1515 * server should try to be resilant enough to avoid the problem
1509 */ 1516 */
1510 if (ob->stats.maxhp && (ob->stats.hp * 100) / ob->stats.maxhp < ob->run_away) 1517 if (ob->stats.maxhp && (ob->stats.hp * 100) / ob->stats.maxhp < ob->run_away)
1511 return absdir (dir + 4); 1518 return absdir (dir + 4);
1519
1512 return dist_att (dir, ob, enemy, part, rv); 1520 return dist_att (dir, ob, enemy, part, rv);
1513} 1521}
1514 1522
1515int 1523int
1516wait_att2 (int dir, object *ob, object *enemy, object *part, rv_vector * rv) 1524wait_att2 (int dir, object *ob, object *enemy, object *part, rv_vector * rv)
1517{ 1525{
1518 if (rv->distance < 9) 1526 if (rv->distance < 9)
1519 return absdir (dir + 4); 1527 return absdir (dir + 4);
1528
1520 return 0; 1529 return 0;
1521} 1530}
1522 1531
1523void 1532void
1524circ1_move (object *ob) 1533circ1_move (object *ob)
1525{ 1534{
1526 static int circle[12] = { 3, 3, 4, 5, 5, 6, 7, 7, 8, 1, 1, 2 }; 1535 static int circle[12] = { 3, 3, 4, 5, 5, 6, 7, 7, 8, 1, 1, 2 };
1536
1527 if (++ob->move_status > 11) 1537 if (++ob->move_status > 11)
1528 ob->move_status = 0; 1538 ob->move_status = 0;
1539
1529 if (!(move_object (ob, circle[ob->move_status]))) 1540 if (!(move_object (ob, circle[ob->move_status])))
1530 (void) move_object (ob, RANDOM () % 8 + 1); 1541 move_object (ob, rndm (8) + 1);
1531} 1542}
1532 1543
1533void 1544void
1534circ2_move (object *ob) 1545circ2_move (object *ob)
1535{ 1546{
1536 static int circle[20] = { 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 1, 1, 1, 2, 2 }; 1547 static int circle[20] = { 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 1, 1, 1, 2, 2 };
1548
1537 if (++ob->move_status > 19) 1549 if (++ob->move_status > 19)
1538 ob->move_status = 0; 1550 ob->move_status = 0;
1551
1539 if (!(move_object (ob, circle[ob->move_status]))) 1552 if (!(move_object (ob, circle[ob->move_status])))
1540 (void) move_object (ob, RANDOM () % 8 + 1); 1553 move_object (ob, rndm (8) + 1);
1541} 1554}
1542 1555
1543void 1556void
1544pace_movev (object *ob) 1557pace_movev (object *ob)
1545{ 1558{
1546 if (ob->move_status++ > 6) 1559 if (ob->move_status++ > 6)
1547 ob->move_status = 0; 1560 ob->move_status = 0;
1561
1548 if (ob->move_status < 4) 1562 if (ob->move_status < 4)
1549 (void) move_object (ob, 5); 1563 move_object (ob, 5);
1550 else 1564 else
1551 (void) move_object (ob, 1); 1565 move_object (ob, 1);
1552} 1566}
1553 1567
1554void 1568void
1555pace_moveh (object *ob) 1569pace_moveh (object *ob)
1556{ 1570{
1557 if (ob->move_status++ > 6) 1571 if (ob->move_status++ > 6)
1558 ob->move_status = 0; 1572 ob->move_status = 0;
1573
1559 if (ob->move_status < 4) 1574 if (ob->move_status < 4)
1560 (void) move_object (ob, 3); 1575 move_object (ob, 3);
1561 else 1576 else
1562 (void) move_object (ob, 7); 1577 move_object (ob, 7);
1563} 1578}
1564 1579
1565void 1580void
1566pace2_movev (object *ob) 1581pace2_movev (object *ob)
1567{ 1582{
1568 if (ob->move_status++ > 16) 1583 if (ob->move_status++ > 16)
1569 ob->move_status = 0; 1584 ob->move_status = 0;
1585
1570 if (ob->move_status < 6) 1586 if (ob->move_status < 6)
1571 (void) move_object (ob, 5); 1587 move_object (ob, 5);
1572 else if (ob->move_status < 8) 1588 else if (ob->move_status < 8)
1573 return; 1589 return;
1574 else if (ob->move_status < 13) 1590 else if (ob->move_status < 13)
1575 (void) move_object (ob, 1); 1591 move_object (ob, 1);
1576 else 1592 else
1577 return; 1593 return;
1578} 1594}
1579 1595
1580void 1596void
1581pace2_moveh (object *ob) 1597pace2_moveh (object *ob)
1582{ 1598{
1583 if (ob->move_status++ > 16) 1599 if (ob->move_status++ > 16)
1584 ob->move_status = 0; 1600 ob->move_status = 0;
1601
1585 if (ob->move_status < 6) 1602 if (ob->move_status < 6)
1586 (void) move_object (ob, 3); 1603 move_object (ob, 3);
1587 else if (ob->move_status < 8) 1604 else if (ob->move_status < 8)
1588 return; 1605 return;
1589 else if (ob->move_status < 13) 1606 else if (ob->move_status < 13)
1590 (void) move_object (ob, 7); 1607 move_object (ob, 7);
1591 else 1608 else
1592 return; 1609 return;
1593} 1610}
1594 1611
1595void 1612void
1596rand_move (object *ob) 1613rand_move (object *ob)
1597{ 1614{
1598 int i;
1599
1600 if (ob->move_status < 1 || ob->move_status > 8 || !(move_object (ob, ob->move_status || !(RANDOM () % 9)))) 1615 if (ob->move_status < 1 || ob->move_status > 8 || !(move_object (ob, ob->move_status || !(rndm (9)))))
1601 for (i = 0; i < 5; i++) 1616 for (int i = 0; i < 5; i++)
1602 if (move_object (ob, ob->move_status = RANDOM () % 8 + 1)) 1617 if (move_object (ob, ob->move_status = rndm (8) + 1))
1603 return; 1618 return;
1604} 1619}
1605 1620
1606void 1621void
1607check_earthwalls (object *op, maptile *m, int x, int y) 1622check_earthwalls (object *op, maptile *m, int x, int y)
1608{ 1623{
1609 object *tmp;
1610
1611 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1624 for (object *tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above)
1612 {
1613 if (tmp->type == EARTHWALL) 1625 if (tmp->type == EARTHWALL)
1614 { 1626 {
1615 hit_player (tmp, op->stats.dam, op, AT_PHYSICAL, 1); 1627 hit_player (tmp, op->stats.dam, op, AT_PHYSICAL, 1);
1616 return; 1628 return;
1617 } 1629 }
1618 }
1619} 1630}
1620 1631
1621void 1632void
1622check_doors (object *op, maptile *m, int x, int y) 1633check_doors (object *op, maptile *m, int x, int y)
1623{ 1634{
1624 object *tmp;
1625
1626 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1635 for (object *tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above)
1627 {
1628 if (tmp->type == DOOR) 1636 if (tmp->type == DOOR)
1629 { 1637 {
1630 hit_player (tmp, 1000, op, AT_PHYSICAL, 1); 1638 hit_player (tmp, 1000, op, AT_PHYSICAL, 1);
1631 return; 1639 return;
1632 } 1640 }
1633 }
1634} 1641}
1635 1642
1636/* find_mon_throw_ob() - modeled on find_throw_ob 1643/* find_mon_throw_ob() - modeled on find_throw_ob
1637 * This is probably overly simplistic as it is now - We want 1644 * This is probably overly simplistic as it is now - We want
1638 * monsters to throw things like chairs and other pieces of 1645 * monsters to throw things like chairs and other pieces of
1639 * furniture, even if they are not good throwable objects. 1646 * furniture, even if they are not good throwable objects.
1640 * Probably better to have the monster throw a throwable object 1647 * Probably better to have the monster throw a throwable object
1641 * first, then throw any non equipped weapon. 1648 * first, then throw any non equipped weapon.
1642 */ 1649 */
1643
1644object * 1650object *
1645find_mon_throw_ob (object *op) 1651find_mon_throw_ob (object *op)
1646{ 1652{
1647 object *tmp = NULL; 1653 object *tmp = NULL;
1648 1654
1652 tmp = op; 1658 tmp = op;
1653 1659
1654 /* New throw code: look through the inventory. Grap the first legal is_thrown 1660 /* New throw code: look through the inventory. Grap the first legal is_thrown
1655 * marked item and throw it to the enemy. 1661 * marked item and throw it to the enemy.
1656 */ 1662 */
1657
1658 for (tmp = op->inv; tmp; tmp = tmp->below) 1663 for (tmp = op->inv; tmp; tmp = tmp->below)
1659 { 1664 {
1660
1661 /* Can't throw invisible objects or items that are applied */ 1665 /* Can't throw invisible objects or items that are applied */
1662 if (tmp->invisible || QUERY_FLAG (tmp, FLAG_APPLIED)) 1666 if (tmp->invisible || QUERY_FLAG (tmp, FLAG_APPLIED))
1663 continue; 1667 continue;
1664 1668
1665 if (QUERY_FLAG (tmp, FLAG_IS_THROWN)) 1669 if (QUERY_FLAG (tmp, FLAG_IS_THROWN))
1681 * properly. I also so odd code in place that checked for x distance 1685 * properly. I also so odd code in place that checked for x distance
1682 * OR y distance being within some range - that seemed wrong - both should 1686 * OR y distance being within some range - that seemed wrong - both should
1683 * be within the valid range. MSW 2001-08-05 1687 * be within the valid range. MSW 2001-08-05
1684 * Returns 0 if enemy can not be detected, 1 if it is detected 1688 * Returns 0 if enemy can not be detected, 1 if it is detected
1685 */ 1689 */
1686
1687int 1690int
1688can_detect_enemy (object *op, object *enemy, rv_vector * rv) 1691can_detect_enemy (object *op, object *enemy, rv_vector * rv)
1689{ 1692{
1690 int radius = MIN_MON_RADIUS, hide_discovery; 1693 int radius = MIN_MON_RADIUS, hide_discovery;
1691 1694
1698 return 0; 1701 return 0;
1699 1702
1700 get_rangevector (op, enemy, rv, 0); 1703 get_rangevector (op, enemy, rv, 0);
1701 1704
1702 /* Monsters always ignore the DM */ 1705 /* Monsters always ignore the DM */
1703 if ((op->type != PLAYER) && QUERY_FLAG (enemy, FLAG_WIZ)) 1706 if (op->type != PLAYER && QUERY_FLAG (enemy, FLAG_WIZ))
1704 return 0; 1707 return 0;
1705 1708
1706 /* simple check. Should probably put some range checks in here. */ 1709 /* simple check. Should probably put some range checks in here. */
1707 if (can_see_enemy (op, enemy)) 1710 if (can_see_enemy (op, enemy))
1708 return 1; 1711 return 1;
1721 1724
1722 /* use this for invis also */ 1725 /* use this for invis also */
1723 hide_discovery = op->stats.Int / 5; 1726 hide_discovery = op->stats.Int / 5;
1724 1727
1725 /* Determine Detection radii */ 1728 /* Determine Detection radii */
1726 if (!enemy->hide) /* to detect non-hidden (eg dark/invis enemy) */ 1729 if (!enemy->flag [FLAG_HIDDEN]) /* to detect non-hidden (eg dark/invis enemy) */
1727 radius = (op->stats.Wis / 5) + 1 > MIN_MON_RADIUS ? (op->stats.Wis / 5) + 1 : MIN_MON_RADIUS; 1730 radius = max (MIN_MON_RADIUS, op->stats.Wis / 5 + 1);
1728 else 1731 else
1729 { /* a level/INT/Dex adjustment for hiding */ 1732 { /* a level/INT/Dex adjustment for hiding */
1730 object *sk_hide;
1731 int bonus = (op->level / 2) + (op->stats.Int / 5); 1733 int bonus = op->level / 2 + op->stats.Int / 5;
1732 1734
1733 if (enemy->type == PLAYER) 1735 if (enemy->is_player ())
1734 { 1736 {
1735 if ((sk_hide = find_skill_by_number (enemy, SK_HIDING))) 1737 if (object *sk_hide = find_skill_by_number (enemy, SK_HIDING))
1736 bonus -= sk_hide->level; 1738 bonus -= sk_hide->level;
1737 else 1739 else
1738 { 1740 {
1739 LOG (llevError, "can_detect_enemy() got hidden player w/o hiding skill!\n"); 1741 LOG (llevError, "can_detect_enemy() got hidden player w/o hiding skill!\n");
1740 make_visible (enemy); 1742 make_visible (enemy);
1749 } /* else creature has modifiers for hiding */ 1751 } /* else creature has modifiers for hiding */
1750 1752
1751 /* Radii stealth adjustment. Only if you are stealthy 1753 /* Radii stealth adjustment. Only if you are stealthy
1752 * will you be able to sneak up closer to creatures */ 1754 * will you be able to sneak up closer to creatures */
1753 if (QUERY_FLAG (enemy, FLAG_STEALTH)) 1755 if (QUERY_FLAG (enemy, FLAG_STEALTH))
1754 radius = radius / 2, hide_discovery = hide_discovery / 3; 1756 {
1757 radius /= 2;
1758 hide_discovery /= 3;
1759 }
1755 1760
1756 /* Radii adjustment for enemy standing in the dark */ 1761 /* Radii adjustment for enemy standing in the dark */
1757 if (op->map->darkness > 0 && !stand_in_light (enemy)) 1762 if (op->map->darklevel () > 0 && !stand_in_light (enemy))
1758 { 1763 {
1759 /* on dark maps body heat can help indicate location with infravision 1764 /* on dark maps body heat can help indicate location with infravision
1760 * undead don't have body heat, so no benefit detecting them. 1765 * undead don't have body heat, so no benefit detecting them.
1761 */ 1766 */
1762 if (QUERY_FLAG (op, FLAG_SEE_IN_DARK) && !is_true_undead (enemy)) 1767 if (QUERY_FLAG (op, FLAG_SEE_IN_DARK) && !is_true_undead (enemy))
1763 radius += op->map->darkness / 2; 1768 radius += op->map->darklevel () / 2;
1764 else 1769 else
1765 radius -= op->map->darkness / 2; 1770 radius -= op->map->darklevel () / 2;
1766 1771
1767 /* op next to a monster (and not in complete darkness) 1772 /* op next to a monster (and not in complete darkness)
1768 * the monster should have a chance to see you. 1773 * the monster should have a chance to see you.
1769 */ 1774 */
1770 if (radius < MIN_MON_RADIUS && op->map->darkness < 5 && rv->distance <= 1) 1775 if (radius < MIN_MON_RADIUS && op->map->darklevel () < 5 && rv->distance <= 1)
1771 radius = MIN_MON_RADIUS; 1776 radius = MIN_MON_RADIUS;
1772 } /* if on dark map */ 1777 } /* if on dark map */
1773 1778
1774 /* Lets not worry about monsters that have incredible detection 1779 /* Lets not worry about monsters that have incredible detection
1775 * radii, we only need to worry here about things the player can 1780 * radii, we only need to worry here about things the player can
1777 * may have for their map - in that way, creatures at the edge will 1782 * may have for their map - in that way, creatures at the edge will
1778 * do something. Note that the distance field in the 1783 * do something. Note that the distance field in the
1779 * vector is real distance, so in theory this should be 18 to 1784 * vector is real distance, so in theory this should be 18 to
1780 * find that. 1785 * find that.
1781 */ 1786 */
1782 if (radius > 13) 1787 // note that the above reasoning was utter bullshit even at the time it was written
1783 radius = 13; 1788 // we use 25, lets see if we have the cpu time for it
1789 radius = min (25, radius);
1784 1790
1785 /* Enemy in range! Now test for detection */ 1791 /* Enemy in range! Now test for detection */
1786 if ((int) rv->distance <= radius) 1792 if (rv->distance <= radius)
1787 { 1793 {
1788 /* ah, we are within range, detected? take cases */ 1794 /* ah, we are within range, detected? take cases */
1789 if (!enemy->invisible) /* enemy in dark squares... are seen! */ 1795 if (!enemy->invisible) /* enemy in dark squares... are seen! */
1790 return 1; 1796 return 1;
1791 1797
1792 /* hidden or low-quality invisible */ 1798 /* hidden or low-quality invisible */
1793 if (enemy->hide && (rv->distance <= 1) && (RANDOM () % 100 <= hide_discovery)) 1799 if (enemy->flag [FLAG_HIDDEN] && rv->distance <= 1 && rndm (100) <= hide_discovery)
1794 { 1800 {
1795 make_visible (enemy); 1801 make_visible (enemy);
1802
1796 /* inform players of new status */ 1803 /* inform players of new status */
1797 if (enemy->type == PLAYER && player_can_view (enemy, op)) 1804 if (enemy->type == PLAYER && player_can_view (enemy, op))
1798 new_draw_info_format (NDI_UNIQUE, 0, enemy, "You are discovered by %s!", &op->name); 1805 new_draw_info_format (NDI_UNIQUE, 0, enemy, "You are discovered by %s!", &op->name);
1806
1799 return 1; /* detected enemy */ 1807 return 1; /* detected enemy */
1800 } 1808 }
1801 else if (enemy->invisible) 1809 else if (enemy->invisible)
1802 { 1810 {
1803 /* Change this around - instead of negating the invisible, just 1811 /* Change this around - instead of negating the invisible, just
1804 * return true so that the mosnter that managed to detect you can 1812 * return true so that the monster that managed to detect you can
1805 * do something to you. Decreasing the duration of invisible 1813 * do something to you. Decreasing the duration of invisible
1806 * doesn't make a lot of sense IMO, as a bunch of stupid creatures 1814 * doesn't make a lot of sense IMO, as a bunch of stupid creatures
1807 * can then basically negate the spell. The spell isn't negated - 1815 * can then basically negate the spell. The spell isn't negated -
1808 * they just know where you are! 1816 * they just know where you are!
1809 */ 1817 */
1810 if ((RANDOM () % 50) <= hide_discovery) 1818 if (rndm (50) <= hide_discovery)
1811 { 1819 {
1812 if (enemy->type == PLAYER) 1820 if (enemy->type == PLAYER)
1813 {
1814 new_draw_info_format (NDI_UNIQUE, 0, enemy, "You see %s noticing your position.", query_name (op)); 1821 new_draw_info_format (NDI_UNIQUE, 0, enemy, "You see %s noticing your position.", query_name (op));
1815 } 1822
1816 return 1; 1823 return 1;
1817 } 1824 }
1818 } 1825 }
1819 } /* within range */ 1826 } /* within range */
1820 1827
1825/* determine if op stands in a lighted square. This is not a very 1832/* determine if op stands in a lighted square. This is not a very
1826 * intellegent algorithm. For one thing, we ignore los here, SO it 1833 * intellegent algorithm. For one thing, we ignore los here, SO it
1827 * is possible for a bright light to illuminate a player on the 1834 * is possible for a bright light to illuminate a player on the
1828 * other side of a wall (!). 1835 * other side of a wall (!).
1829 */ 1836 */
1830
1831int 1837int
1832stand_in_light (object *op) 1838stand_in_light (object *op)
1833{ 1839{
1834 sint16 nx, ny;
1835 maptile *m;
1836
1837
1838 if (!op) 1840 if (op)
1839 return 0; 1841 {
1840 if (op->glow_radius > 0) 1842 if (op->glow_radius > 0)
1841 return 1; 1843 return 1;
1842 1844
1843 if (op->map) 1845 if (op->map)
1844 { 1846 unordered_mapwalk (op, -MAX_LIGHT_RADIUS, -MAX_LIGHT_RADIUS, MAX_LIGHT_RADIUS, MAX_LIGHT_RADIUS)
1845 int x, y, x1, y1; 1847 {
1846
1847
1848
1849 /* Check the spaces with the max light radius to see if any of them 1848 /* Check the spaces with the max light radius to see if any of them
1850 * have lights, and if any of them light the player enough, then return 1. 1849 * have lights, and if any of them light the player enough, then return 1.
1851 */
1852 for (x = op->x - MAX_LIGHT_RADII; x <= op->x + MAX_LIGHT_RADII; x++)
1853 {
1854 for (y = op->y - MAX_LIGHT_RADII; y <= op->y + MAX_LIGHT_RADII; y++)
1855 { 1850 */
1856 m = op->map; 1851 int light = m->at (nx, ny).light;
1857 nx = x;
1858 ny = y;
1859 1852
1860 if (get_map_flags (m, &m, nx, ny, &nx, &ny) & P_OUT_OF_MAP) 1853 if (expect_false (light > 0) && idistance (dx, dy) <= light)
1861 continue;
1862
1863 x1 = abs (x - op->x) * abs (x - op->x);
1864 y1 = abs (y - op->y) * abs (y - op->y);
1865 if (isqrt (x1 + y1) < GET_MAP_LIGHT (m, nx, ny))
1866 return 1; 1854 return 1;
1867 } 1855 }
1868 }
1869 } 1856 }
1857
1870 return 0; 1858 return 0;
1871} 1859}
1872
1873 1860
1874/* assuming no walls/barriers, lets check to see if its *possible* 1861/* assuming no walls/barriers, lets check to see if its *possible*
1875 * to see an enemy. Note, "detection" is different from "seeing". 1862 * to see an enemy. Note, "detection" is different from "seeing".
1876 * See can_detect_enemy() for more details. -b.t. 1863 * See can_detect_enemy() for more details. -b.t.
1877 * return 0 if can't be seen, 1 if can be 1864 * return 0 if can't be seen, 1 if can be
1878 */ 1865 */
1879
1880int 1866int
1881can_see_enemy (object *op, object *enemy) 1867can_see_enemy (object *op, object *enemy)
1882{ 1868{
1883 object *looker = op->head ? op->head : op; 1869 object *looker = op->head ? op->head : op;
1884 1870
1900 * However,if you carry any source of light, then the hidden 1886 * However,if you carry any source of light, then the hidden
1901 * creature is seeable (and stupid) */ 1887 * creature is seeable (and stupid) */
1902 1888
1903 if (has_carried_lights (enemy)) 1889 if (has_carried_lights (enemy))
1904 { 1890 {
1905 if (enemy->hide) 1891 if (enemy->flag [FLAG_HIDDEN])
1906 { 1892 {
1907 make_visible (enemy); 1893 make_visible (enemy);
1908 new_draw_info (NDI_UNIQUE, 0, enemy, "Your light reveals your hiding spot!"); 1894 new_draw_info (NDI_UNIQUE, 0, enemy, "Your light reveals your hiding spot!");
1909 } 1895 }
1896
1910 return 1; 1897 return 1;
1911 } 1898 }
1912 else if (enemy->hide) 1899 else if (enemy->flag [FLAG_HIDDEN])
1913 return 0; 1900 return 0;
1914 1901
1915 /* Invisible enemy. Break apart the check for invis undead/invis looker 1902 /* Invisible enemy. Break apart the check for invis undead/invis looker
1916 * into more simple checks - the QUERY_FLAG doesn't return 1/0 values, 1903 * into more simple checks - the QUERY_FLAG doesn't return 1/0 values,
1917 * and making it a conditional makes the code pretty ugly. 1904 * and making it a conditional makes the code pretty ugly.
1918 */ 1905 */
1919 if (!QUERY_FLAG (looker, FLAG_SEE_INVISIBLE)) 1906 if (!QUERY_FLAG (looker, FLAG_SEE_INVISIBLE))
1920 {
1921 if (makes_invisible_to (enemy, looker)) 1907 if (makes_invisible_to (enemy, looker))
1922 return 0; 1908 return 0;
1923 }
1924 } 1909 }
1925 else if (looker->type == PLAYER) /* for players, a (possible) shortcut */ 1910 else if (looker->is_player ()) /* for players, a (possible) shortcut */
1926 if (player_can_view (looker, enemy)) 1911 if (player_can_view (looker, enemy))
1927 return 1; 1912 return 1;
1928 1913
1929 /* ENEMY IN DARK MAP. Without infravision, the enemy is not seen 1914 /* ENEMY IN DARK MAP. Without infravision, the enemy is not seen
1930 * unless they carry a light or stand in light. Darkness doesnt 1915 * unless they carry a light or stand in light. Darkness doesnt
1933 * we care about the enemy maps status, not the looker. 1918 * we care about the enemy maps status, not the looker.
1934 * only relevant for tiled maps, but it is possible that the 1919 * only relevant for tiled maps, but it is possible that the
1935 * enemy is on a bright map and the looker on a dark - in that 1920 * enemy is on a bright map and the looker on a dark - in that
1936 * case, the looker can still see the enemy 1921 * case, the looker can still see the enemy
1937 */ 1922 */
1938 if (enemy->map->darkness > 0 && !stand_in_light (enemy) 1923 if (enemy->map->darklevel () > 0
1924 && !stand_in_light (enemy)
1939 && (!QUERY_FLAG (looker, FLAG_SEE_IN_DARK) || !is_true_undead (looker) || !QUERY_FLAG (looker, FLAG_XRAYS))) 1925 && (!QUERY_FLAG (looker, FLAG_SEE_IN_DARK) || !is_true_undead (looker) || !QUERY_FLAG (looker, FLAG_XRAYS)))
1940 return 0; 1926 return 0;
1941 1927
1942 return 1; 1928 return 1;
1943} 1929}
1930

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines