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

Comparing deliantra/server/common/los.C (file contents):
Revision 1.10 by root, Thu Dec 21 23:37:05 2006 UTC vs.
Revision 1.24 by root, Sun Mar 11 02:12:44 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * This program 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 2 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, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 23 */
23 24
24/* Nov 95 - inserted USE_LIGHTING code stuff in here - b.t. */ 25/* Nov 95 - inserted USE_LIGHTING code stuff in here - b.t. */
25 26
26#include <global.h> 27#include <global.h>
27#include <funcpoint.h> 28#include <funcpoint.h>
28#include <math.h> 29#include <math.h>
29
30 30
31/* Distance must be less than this for the object to be blocked. 31/* Distance must be less than this for the object to be blocked.
32 * An object is 1.0 wide, so if set to 0.5, it means the object 32 * An object is 1.0 wide, so if set to 0.5, it means the object
33 * that blocks half the view (0.0 is complete block) will 33 * that blocks half the view (0.0 is complete block) will
34 * block view in our tables. 34 * block view in our tables.
… …
41{ 41{
42 int x[4], y[4]; 42 int x[4], y[4];
43 int index; 43 int index;
44} blocks; 44} blocks;
45 45
46// 31/32 == a speed hack
47// we would like to use 32 for speed, but the code loops endlessly
48// then, reason not yet identified, so only make the array use 32,
49// not the define's.
46blocks block[MAP_CLIENT_X][MAP_CLIENT_Y]; 50blocks block[MAP_CLIENT_X][MAP_CLIENT_Y == 31 ? 32 : MAP_CLIENT_Y];
47 51
48static void expand_lighted_sight (object *op); 52static void expand_lighted_sight (object *op);
49 53
50/* 54/*
51 * Used to initialise the array used by the LOS routines. 55 * Used to initialise the array used by the LOS routines.
… …
90 94
91void 95void
92init_block (void) 96init_block (void)
93{ 97{
94 int x, y, dx, dy, i; 98 int x, y, dx, dy, i;
95 static int block_x[3] = { -1, -1, 0 }, block_y[3] = 99 static int block_x[3] = { -1, -1, 0 },
96 { 100 block_y[3] = { -1, 0, -1 };
97 -1, 0, -1};
98 101
99 for (x = 0; x < MAP_CLIENT_X; x++) 102 for (x = 0; x < MAP_CLIENT_X; x++)
100 for (y = 0; y < MAP_CLIENT_Y; y++) 103 for (y = 0; y < MAP_CLIENT_Y; y++)
101 {
102 block[x][y].index = 0; 104 block[x][y].index = 0;
103 }
104 105
105 106
106 /* The table should be symmetric, so only do the upper left 107 /* The table should be symmetric, so only do the upper left
107 * quadrant - makes the processing easier. 108 * quadrant - makes the processing easier.
108 */ 109 */
… …
125 /* For simplicity, we mirror the coordinates to block the other 126 /* For simplicity, we mirror the coordinates to block the other
126 * quadrants. 127 * quadrants.
127 */ 128 */
128 set_block (x, y, dx, dy); 129 set_block (x, y, dx, dy);
129 if (x == MAP_CLIENT_X / 2) 130 if (x == MAP_CLIENT_X / 2)
130 {
131 set_block (x, MAP_CLIENT_Y - y - 1, dx, MAP_CLIENT_Y - dy - 1); 131 set_block (x, MAP_CLIENT_Y - y - 1, dx, MAP_CLIENT_Y - dy - 1);
132 }
133 else if (y == MAP_CLIENT_Y / 2) 132 else if (y == MAP_CLIENT_Y / 2)
134 {
135 set_block (MAP_CLIENT_X - x - 1, y, MAP_CLIENT_X - dx - 1, dy); 133 set_block (MAP_CLIENT_X - x - 1, y, MAP_CLIENT_X - dx - 1, dy);
136 }
137 } 134 }
138 else 135 else
139 { 136 {
140 float d1, r, s, l; 137 float d1, r, s, l;
141 138
… …
175 * that if some particular space is blocked, it blocks 172 * that if some particular space is blocked, it blocks
176 * the view of the spaces 'behind' it, and those blocked 173 * the view of the spaces 'behind' it, and those blocked
177 * spaces behind it may block other spaces, etc. 174 * spaces behind it may block other spaces, etc.
178 * In this way, the chain of visibility is set. 175 * In this way, the chain of visibility is set.
179 */ 176 */
180
181static void 177static void
182set_wall (object *op, int x, int y) 178set_wall (object *op, int x, int y)
183{ 179{
184 int i; 180 int i;
185 181
… …
293 op->contr->blocked_los[dx][dy] = -1; 289 op->contr->blocked_los[dx][dy] = -1;
294 } 290 }
295 } 291 }
296 } 292 }
297 293
298 if (MAP_DARKNESS (op->map) > 0) /* player is on a dark map */ 294 if (op->map->darkness > 0) /* player is on a dark map */
299 expand_lighted_sight (op); 295 expand_lighted_sight (op);
300
301 296
302 /* clear mark squares */ 297 /* clear mark squares */
303 for (x = 0; x < op->contr->ns->mapx; x++) 298 for (x = 0; x < op->contr->ns->mapx; x++)
304 for (y = 0; y < op->contr->ns->mapy; y++) 299 for (y = 0; y < op->contr->ns->mapy; y++)
305 if (op->contr->blocked_los[x][y] < 0) 300 if (op->contr->blocked_los[x][y] < 0)
306 op->contr->blocked_los[x][y] = 0; 301 op->contr->blocked_los[x][y] = 0;
307} 302}
308 303
309
310
311
312/* returns true if op carries one or more lights 304/* returns true if op carries one or more lights
313 * This is a trivial function now days, but it used to 305 * This is a trivial function now days, but it used to
314 * be a bit longer. Probably better for callers to just 306 * be a bit longer. Probably better for callers to just
315 * check the op->glow_radius instead of calling this. 307 * check the op->glow_radius instead of calling this.
316 */ 308 */
… …
330{ 322{
331 int x, y, darklevel, ax, ay, basex, basey, mflags, light, x1, y1; 323 int x, y, darklevel, ax, ay, basex, basey, mflags, light, x1, y1;
332 maptile *m = op->map; 324 maptile *m = op->map;
333 sint16 nx, ny; 325 sint16 nx, ny;
334 326
335 darklevel = MAP_DARKNESS (m); 327 darklevel = m->darkness;
336 328
337 /* If the player can see in the dark, lower the darklevel for him */ 329 /* If the player can see in the dark, lower the darklevel for him */
338 if (QUERY_FLAG (op, FLAG_SEE_IN_DARK)) 330 if (QUERY_FLAG (op, FLAG_SEE_IN_DARK))
339 darklevel -= 2; 331 darklevel -= 2;
340 332
… …
349 /* Do a sanity check. If not valid, some code below may do odd 341 /* Do a sanity check. If not valid, some code below may do odd
350 * things. 342 * things.
351 */ 343 */
352 if (darklevel > MAX_DARKNESS) 344 if (darklevel > MAX_DARKNESS)
353 { 345 {
354 LOG (llevError, "Map darkness for %s on %s is too high (%d)\n", &op->name, op->map->path, darklevel); 346 LOG (llevError, "Map darkness for %s on %s is too high (%d)\n", &op->name, &op->map->path, darklevel);
355 darklevel = MAX_DARKNESS; 347 darklevel = MAX_DARKNESS;
356 } 348 }
357 349
358 /* First, limit player furthest (unlighted) vision */ 350 /* First, limit player furthest (unlighted) vision */
359 for (x = 0; x < op->contr->ns->mapx; x++) 351 for (x = 0; x < op->contr->ns->mapx; x++)
… …
394#endif 386#endif
395 for (ax = basex - light; ax <= basex + light; ax++) 387 for (ax = basex - light; ax <= basex + light; ax++)
396 { 388 {
397 if (ax < 0 || ax >= op->contr->ns->mapx) 389 if (ax < 0 || ax >= op->contr->ns->mapx)
398 continue; 390 continue;
391
399 for (ay = basey - light; ay <= basey + light; ay++) 392 for (ay = basey - light; ay <= basey + light; ay++)
400 { 393 {
401 if (ay < 0 || ay >= op->contr->ns->mapy) 394 if (ay < 0 || ay >= op->contr->ns->mapy)
402 continue; 395 continue;
403 396
… …
410 */ 403 */
411 if (op->contr->blocked_los[ax][ay] != 100) 404 if (op->contr->blocked_los[ax][ay] != 100)
412 { 405 {
413 x1 = abs (basex - ax) * abs (basex - ax); 406 x1 = abs (basex - ax) * abs (basex - ax);
414 y1 = abs (basey - ay) * abs (basey - ay); 407 y1 = abs (basey - ay) * abs (basey - ay);
415 if (light > 0) 408
416 op->contr->blocked_los[ax][ay] -= MAX ((light - isqrt (x1 + y1)), 0); 409 if (light > 0) op->contr->blocked_los[ax][ay] -= max (light - isqrt (x1 + y1), 0);
417 if (light < 0)
418 op->contr->blocked_los[ax][ay] -= MIN ((light + isqrt (x1 + y1)), 0); 410 if (light < 0) op->contr->blocked_los[ax][ay] -= min (light + isqrt (x1 + y1), 0);
419 } 411 }
420 } /* for ay */ 412 }
421 } /* for ax */ 413 }
422 } /* if this space is providing light */ 414 }
423 } /* for y */ 415 }
424 } /* for x */ 416 }
425 417
426 /* Outdoor should never really be completely pitch black dark like 418 /* Outdoor should never really be completely pitch black dark like
427 * a dungeon, so let the player at least see a little around themselves 419 * a dungeon, so let the player at least see a little around themselves
428 */ 420 */
429 if (op->map->outdoor && darklevel > (MAX_DARKNESS - 3)) 421 if (op->map->outdoor && darklevel > (MAX_DARKNESS - 3))
… …
436 { 428 {
437 if (op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] > (MAX_DARKNESS - 2)) 429 if (op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] > (MAX_DARKNESS - 2))
438 op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] = MAX_DARKNESS - 2; 430 op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] = MAX_DARKNESS - 2;
439 } 431 }
440 } 432 }
433
441 /* grant some vision to the player, based on the darklevel */ 434 /* grant some vision to the player, based on the darklevel */
442 for (x = darklevel - MAX_DARKNESS; x < MAX_DARKNESS + 1 - darklevel; x++) 435 for (x = darklevel - MAX_DARKNESS; x < MAX_DARKNESS + 1 - darklevel; x++)
443 for (y = darklevel - MAX_DARKNESS; y < MAX_DARKNESS + 1 - darklevel; y++) 436 for (y = darklevel - MAX_DARKNESS; y < MAX_DARKNESS + 1 - darklevel; y++)
444 if (!(op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] == 100)) 437 if (!(op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] == 100))
445 op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] -= 438 op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] -=
… …
449/* blinded_sight() - sets all veiwable squares to blocked except 442/* blinded_sight() - sets all veiwable squares to blocked except
450 * for the one the central one that the player occupies. A little 443 * for the one the central one that the player occupies. A little
451 * odd that you can see yourself (and what your standing on), but 444 * odd that you can see yourself (and what your standing on), but
452 * really need for any reasonable game play. 445 * really need for any reasonable game play.
453 */ 446 */
454
455static void 447static void
456blinded_sight (object *op) 448blinded_sight (object *op)
457{ 449{
458 int x, y; 450 int x, y;
459 451
… …
487 * could be examined multile times, as each path would be looked at. 479 * could be examined multile times, as each path would be looked at.
488 */ 480 */
489 for (x = (MAP_CLIENT_X - op->contr->ns->mapx) / 2 - 1; x < (MAP_CLIENT_X + op->contr->ns->mapx) / 2 + 1; x++) 481 for (x = (MAP_CLIENT_X - op->contr->ns->mapx) / 2 - 1; x < (MAP_CLIENT_X + op->contr->ns->mapx) / 2 + 1; x++)
490 for (y = (MAP_CLIENT_Y - op->contr->ns->mapy) / 2 - 1; y < (MAP_CLIENT_Y + op->contr->ns->mapy) / 2 + 1; y++) 482 for (y = (MAP_CLIENT_Y - op->contr->ns->mapy) / 2 - 1; y < (MAP_CLIENT_Y + op->contr->ns->mapy) / 2 + 1; y++)
491 check_wall (op, x, y); 483 check_wall (op, x, y);
492
493 484
494 /* do the los of the player. 3 (potential) cases */ 485 /* do the los of the player. 3 (potential) cases */
495 if (QUERY_FLAG (op, FLAG_BLIND)) /* player is blind */ 486 if (QUERY_FLAG (op, FLAG_BLIND)) /* player is blind */
496 blinded_sight (op); 487 blinded_sight (op);
497 else 488 else
498 expand_sight (op); 489 expand_sight (op);
499 490
491 //TODO: no range-checking whatsoever :(
500 if (QUERY_FLAG (op, FLAG_XRAYS)) 492 if (QUERY_FLAG (op, FLAG_XRAYS))
501 {
502 int x, y;
503
504 for (x = -2; x <= 2; x++) 493 for (int x = -2; x <= 2; x++)
505 for (y = -2; y <= 2; y++) 494 for (int y = -2; y <= 2; y++)
506 op->contr->blocked_los[dx + x][dy + y] = 0; 495 op->contr->blocked_los[dx + x][dy + y] = 0;
507 }
508} 496}
509 497
510/* update all_map_los is like update_all_los below, 498/* update all_map_los is like update_all_los below,
511 * but updates everyone on the map, no matter where they 499 * but updates everyone on the map, no matter where they
512 * are. This generally should not be used, as a per 500 * are. This generally should not be used, as a per
513 * specific map change doesn't make much sense when tiling 501 * specific map change doesn't make much sense when tiling
514 * is considered (lowering darkness would certainly be a 502 * is considered (lowering darkness would certainly be a
515 * strange effect if done on a tile map, as it makes 503 * strange effect if done on a tile map, as it makes
516 * the distinction between maps much more obvious to the 504 * the distinction between maps much more obvious to the
517 * players, which is should not be. 505 * players, which is should not be.
… …
519 * change_map_light function 507 * change_map_light function
520 */ 508 */
521void 509void
522update_all_map_los (maptile *map) 510update_all_map_los (maptile *map)
523{ 511{
524 player *pl; 512 for_all_players (pl)
525
526 for (pl = first_player; pl != NULL; pl = pl->next)
527 {
528 if (pl->ob->map == map) 513 if (pl->ob && pl->ob->map == map)
529 pl->do_los = 1; 514 pl->do_los = 1;
530 }
531} 515}
532
533 516
534/* 517/*
535 * This function makes sure that update_los() will be called for all 518 * This function makes sure that update_los() will be called for all
536 * players on the given map within the next frame. 519 * players on the given map within the next frame.
537 * It is triggered by removal or inserting of objects which blocks 520 * It is triggered by removal or inserting of objects which blocks
… …
541 * means that just being on the same map is not sufficient - the 524 * means that just being on the same map is not sufficient - the
542 * space that changes must be withing your viewable area. 525 * space that changes must be withing your viewable area.
543 * 526 *
544 * map is the map that changed, x and y are the coordinates. 527 * map is the map that changed, x and y are the coordinates.
545 */ 528 */
546
547void 529void
548update_all_los (const maptile *map, int x, int y) 530update_all_los (const maptile *map, int x, int y)
549{ 531{
550 player *pl; 532 for_all_players (pl)
551
552 for (pl = first_player; pl; pl = pl->next)
553 { 533 {
554 /* Player should not have a null map, but do this 534 /* Player should not have a null map, but do this
555 * check as a safety 535 * check as a safety
556 */ 536 */
557 if (!pl->ob->map) 537 if (!pl->ob || !pl->ob->map || !pl->ns)
558 continue; 538 continue;
559 539
560 /* Same map is simple case - see if pl is close enough. 540 /* Same map is simple case - see if pl is close enough.
561 * Note in all cases, we did the check for same map first, 541 * Note in all cases, we did the check for same map first,
562 * and then see if the player is close enough and update 542 * and then see if the player is close enough and update
… …
569 if (pl->ob->map == map) 549 if (pl->ob->map == map)
570 { 550 {
571 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) 551 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2))
572 pl->do_los = 1; 552 pl->do_los = 1;
573 } 553 }
554
574 /* Now we check to see if player is on adjacent 555 /* Now we check to see if player is on adjacent
575 * maps to the one that changed and also within 556 * maps to the one that changed and also within
576 * view. The tile_maps[] could be null, but in that 557 * view. The tile_maps[] could be null, but in that
577 * case it should never match the pl->ob->map, so 558 * case it should never match the pl->ob->map, so
578 * we want ever try to dereference any of the data in it. 559 * we want ever try to dereference any of the data in it.
579 */ 560 *
580
581 /* The logic for 0 and 3 is to see how far the player is 561 * The logic for 0 and 3 is to see how far the player is
582 * from the edge of the map (height/width) - pl->ob->(x,y) 562 * from the edge of the map (height/width) - pl->ob->(x,y)
583 * and to add current position on this map - that gives a 563 * and to add current position on this map - that gives a
584 * distance. 564 * distance.
585 * For 1 and 2, we check to see how far the given 565 * For 1 and 2, we check to see how far the given
586 * coordinate (x,y) is from the corresponding edge, 566 * coordinate (x,y) is from the corresponding edge,
587 * and then add the players location, which gives 567 * and then add the players location, which gives
588 * a distance. 568 * a distance.
589 */ 569 */
590 else if (pl->ob->map == map->tile_map[0]) 570 else if (pl->ob->map == map->tile_map[0])
591 { 571 {
592 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (y + MAP_HEIGHT (map->tile_map[0]) - pl->ob->y) <= pl->ns->mapy / 2)) 572 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (y + map->tile_map[0]->height - pl->ob->y) <= pl->ns->mapy / 2))
593 pl->do_los = 1; 573 pl->do_los = 1;
594 } 574 }
595 else if (pl->ob->map == map->tile_map[2]) 575 else if (pl->ob->map == map->tile_map[2])
596 { 576 {
597 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y + MAP_HEIGHT (map) - y) <= pl->ns->mapy / 2)) 577 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y + map->height - y) <= pl->ns->mapy / 2))
598 pl->do_los = 1; 578 pl->do_los = 1;
599 } 579 }
600 else if (pl->ob->map == map->tile_map[1]) 580 else if (pl->ob->map == map->tile_map[1])
601 { 581 {
602 if ((abs (pl->ob->x + MAP_WIDTH (map) - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) 582 if ((abs (pl->ob->x + map->width - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2))
603 pl->do_los = 1; 583 pl->do_los = 1;
604 } 584 }
605 else if (pl->ob->map == map->tile_map[3]) 585 else if (pl->ob->map == map->tile_map[3])
606 { 586 {
607 if ((abs (x + MAP_WIDTH (map->tile_map[3]) - pl->ob->x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) 587 if ((abs (x + map->tile_map[3]->width - pl->ob->x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2))
608 pl->do_los = 1; 588 pl->do_los = 1;
609 } 589 }
610 } 590 }
611} 591}
612 592
613/* 593/*
614 * Debug-routine which dumps the array which specifies the visible 594 * Debug-routine which dumps the array which specifies the visible
615 * area of a player. Triggered by the z key in DM mode. 595 * area of a player. Triggered by the z key in DM mode.
616 */ 596 */
617
618void 597void
619print_los (object *op) 598print_los (object *op)
620{ 599{
621 int x, y; 600 int x, y;
622 char buf[50], buf2[10]; 601 char buf[50], buf2[10];
623 602
624 strcpy (buf, " "); 603 strcpy (buf, " ");
604
625 for (x = 0; x < op->contr->ns->mapx; x++) 605 for (x = 0; x < op->contr->ns->mapx; x++)
626 { 606 {
627 sprintf (buf2, "%2d", x); 607 sprintf (buf2, "%2d", x);
628 strcat (buf, buf2); 608 strcat (buf, buf2);
629 } 609 }
610
630 new_draw_info (NDI_UNIQUE, 0, op, buf); 611 new_draw_info (NDI_UNIQUE, 0, op, buf);
612
631 for (y = 0; y < op->contr->ns->mapy; y++) 613 for (y = 0; y < op->contr->ns->mapy; y++)
632 { 614 {
633 sprintf (buf, "%2d:", y); 615 sprintf (buf, "%2d:", y);
616
634 for (x = 0; x < op->contr->ns->mapx; x++) 617 for (x = 0; x < op->contr->ns->mapx; x++)
635 { 618 {
636 sprintf (buf2, " %1d", op->contr->blocked_los[x][y]); 619 sprintf (buf2, " %1d", op->contr->blocked_los[x][y]);
637 strcat (buf, buf2); 620 strcat (buf, buf2);
638 } 621 }
622
639 new_draw_info (NDI_UNIQUE, 0, op, buf); 623 new_draw_info (NDI_UNIQUE, 0, op, buf);
640 } 624 }
641} 625}
642 626
643/* 627/*
… …
646 */ 630 */
647 631
648void 632void
649make_sure_seen (const object *op) 633make_sure_seen (const object *op)
650{ 634{
651 player *pl; 635 for_all_players (pl)
652
653 for (pl = first_player; pl; pl = pl->next)
654 if (pl->ob->map == op->map && 636 if (pl->ob->map == op->map &&
655 pl->ob->y - pl->ns->mapy / 2 <= op->y && 637 pl->ob->y - pl->ns->mapy / 2 <= op->y &&
656 pl->ob->y + pl->ns->mapy / 2 >= op->y && pl->ob->x - pl->ns->mapx / 2 <= op->x && pl->ob->x + pl->ns->mapx / 2 >= op->x) 638 pl->ob->y + pl->ns->mapy / 2 >= op->y && pl->ob->x - pl->ns->mapx / 2 <= op->x && pl->ob->x + pl->ns->mapx / 2 >= op->x)
657 pl->blocked_los[pl->ns->mapx / 2 + op->x - pl->ob->x][pl->ns->mapy / 2 + op->y - pl->ob->y] = 0; 639 pl->blocked_los[pl->ns->mapx / 2 + op->x - pl->ob->x][pl->ns->mapy / 2 + op->y - pl->ob->y] = 0;
658} 640}
… …
664 */ 646 */
665 647
666void 648void
667make_sure_not_seen (const object *op) 649make_sure_not_seen (const object *op)
668{ 650{
669 player *pl; 651 for_all_players (pl)
670
671 for (pl = first_player; pl; pl = pl->next)
672 if (pl->ob->map == op->map && 652 if (pl->ob->map == op->map &&
673 pl->ob->y - pl->ns->mapy / 2 <= op->y && 653 pl->ob->y - pl->ns->mapy / 2 <= op->y &&
674 pl->ob->y + pl->ns->mapy / 2 >= op->y && pl->ob->x - pl->ns->mapx / 2 <= op->x && pl->ob->x + pl->ns->mapx / 2 >= op->x) 654 pl->ob->y + pl->ns->mapy / 2 >= op->y && pl->ob->x - pl->ns->mapx / 2 <= op->x && pl->ob->x + pl->ns->mapx / 2 >= op->x)
675 pl->do_los = 1; 655 pl->do_los = 1;
676} 656}

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines