| 1 | /* |
1 | /* |
| 2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 | * |
3 | * |
| 4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
| 7 | * |
5 | * |
| 8 | * Deliantra is free software: you can redistribute it and/or modify |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
| 9 | * it under the terms of the GNU General Public License as published by |
7 | * the terms of the Affero GNU General Public License as published by the |
| 10 | * the Free Software Foundation, either version 3 of the License, or |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
| 11 | * (at your option) any later version. |
9 | * option) any later version. |
| 12 | * |
10 | * |
| 13 | * This program is distributed in the hope that it will be useful, |
11 | * This program is distributed in the hope that it will be useful, |
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 | * GNU General Public License for more details. |
14 | * GNU General Public License for more details. |
| 17 | * |
15 | * |
| 18 | * You should have received a copy of the GNU General Public License |
16 | * You should have received a copy of the Affero GNU General Public License |
| 19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
17 | * and the GNU General Public License along with this program. If not, see |
|
|
18 | * <http://www.gnu.org/licenses/>. |
| 20 | * |
19 | * |
| 21 | * The authors can be reached via e-mail to <support@deliantra.net> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 22 | */ |
21 | */ |
| 23 | |
22 | |
| 24 | #include <global.h> |
23 | #include <global.h> |
| … | |
… | |
| 288 | { |
287 | { |
| 289 | // max intensity |
288 | // max intensity |
| 290 | int intensity = min (LOS_MAX, abs (radius) + 1); |
289 | int intensity = min (LOS_MAX, abs (radius) + 1); |
| 291 | |
290 | |
| 292 | // actual intensity |
291 | // actual intensity |
| 293 | intensity = max (0, lerp_rd (distance, 0, abs (radius) + 1, intensity, 0)); |
292 | intensity = max (0, lerp_ru (distance, 0, abs (radius) + 1, intensity, 0)); |
| 294 | |
293 | |
| 295 | light_atten [radius + MAX_LIGHT_RADIUS][distance] = radius < 0 |
294 | light_atten [radius + MAX_LIGHT_RADIUS][distance] = radius < 0 |
| 296 | ? min (3, intensity) |
295 | ? min (3, intensity) |
| 297 | : LOS_MAX - intensity; |
296 | : LOS_MAX - intensity; |
| 298 | } |
297 | } |
| … | |
… | |
| 403 | else if (op->map->darkness > 0) // outdoor and darkness > 0 => use darkness as max radius |
402 | else if (op->map->darkness > 0) // outdoor and darkness > 0 => use darkness as max radius |
| 404 | light = lerp_rd (maptile::outdoor_darkness + 0, 0, MAX_DARKNESS, MAX_DARKNESS - op->map->darkness, 0); |
403 | light = lerp_rd (maptile::outdoor_darkness + 0, 0, MAX_DARKNESS, MAX_DARKNESS - op->map->darkness, 0); |
| 405 | else // outdoor and darkness <= 0 => start wide and decrease quickly |
404 | else // outdoor and darkness <= 0 => start wide and decrease quickly |
| 406 | light = lerp (maptile::outdoor_darkness + op->map->darkness, 0, MAX_DARKNESS, MAX_VISION, 2); |
405 | light = lerp (maptile::outdoor_darkness + op->map->darkness, 0, MAX_DARKNESS, MAX_VISION, 2); |
| 407 | |
406 | |
| 408 | light = clamp (light, 0, MAX_VISION); |
407 | light = clamp (light + bonus, 0, MAX_VISION); |
| 409 | |
408 | |
| 410 | apply_light<los_brighten> (pl, 0, 0, light, vision_atten [light]); |
409 | apply_light<los_brighten> (pl, 0, 0, light, vision_atten [light]); |
| 411 | } |
410 | } |
| 412 | } |
411 | } |
| 413 | |
412 | |
| … | |
… | |
| 502 | * map is the map that changed, x and y are the coordinates. |
501 | * map is the map that changed, x and y are the coordinates. |
| 503 | */ |
502 | */ |
| 504 | void |
503 | void |
| 505 | update_all_los (const maptile *map, int x, int y) |
504 | update_all_los (const maptile *map, int x, int y) |
| 506 | { |
505 | { |
| 507 | // no need to do anything if we don't have darkness |
|
|
| 508 | if (map->darklevel () <= 0) |
|
|
| 509 | return; |
|
|
| 510 | |
|
|
| 511 | map->at (x, y).invalidate (); |
506 | map->at (x, y).invalidate (); |
| 512 | |
507 | |
| 513 | for_all_players (pl) |
508 | for_all_players (pl) |
| 514 | { |
509 | { |
| 515 | /* Player should not have a null map, but do this |
510 | /* Player should not have a null map, but do this |
| 516 | * check as a safety |
511 | * check as a safety |
| 517 | */ |
512 | */ |
| 518 | if (!pl->ob || !pl->ob->map || !pl->ns) |
513 | if (!pl->ob || !pl->ob->map || !pl->ns) |
| 519 | continue; |
514 | continue; |
| 520 | |
515 | |
| 521 | /* Same map is simple case - see if pl is close enough. |
516 | rv_vector rv; |
| 522 | * Note in all cases, we did the check for same map first, |
517 | |
| 523 | * and then see if the player is close enough and update |
518 | get_rangevector_from_mapcoord (map, x, y, pl->ob, &rv); |
| 524 | * los if that is the case. If the player is on the |
|
|
| 525 | * corresponding map, but not close enough, then the |
|
|
| 526 | * player can't be on another map that may be closer, |
|
|
| 527 | * so by setting it up this way, we trim processing |
|
|
| 528 | * some. |
|
|
| 529 | */ |
519 | |
| 530 | if (pl->ob->map == map) |
520 | if ((abs (rv.distance_x) <= pl->ns->mapx / 2) && (abs (rv.distance_y) <= pl->ns->mapy / 2)) |
| 531 | if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) |
|
|
| 532 | pl->do_los = 1; |
521 | pl->do_los = 1; |
| 533 | |
|
|
| 534 | /* Now we check to see if player is on adjacent |
|
|
| 535 | * maps to the one that changed and also within |
|
|
| 536 | * view. The tile_maps[] could be null, but in that |
|
|
| 537 | * case it should never match the pl->ob->map, so |
|
|
| 538 | * we want ever try to dereference any of the data in it. |
|
|
| 539 | * |
|
|
| 540 | * The logic for 0 and 3 is to see how far the player is |
|
|
| 541 | * from the edge of the map (height/width) - pl->ob->(x,y) |
|
|
| 542 | * and to add current position on this map - that gives a |
|
|
| 543 | * distance. |
|
|
| 544 | * For 1 and 2, we check to see how far the given |
|
|
| 545 | * coordinate (x,y) is from the corresponding edge, |
|
|
| 546 | * and then add the players location, which gives |
|
|
| 547 | * a distance. |
|
|
| 548 | */ |
|
|
| 549 | else if (pl->ob->map == map->tile_map[0]) |
|
|
| 550 | { |
|
|
| 551 | if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (y + map->tile_map[0]->height - pl->ob->y) <= pl->ns->mapy / 2)) |
|
|
| 552 | pl->do_los = 1; |
|
|
| 553 | } |
|
|
| 554 | else if (pl->ob->map == map->tile_map[2]) |
|
|
| 555 | { |
|
|
| 556 | if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y + map->height - y) <= pl->ns->mapy / 2)) |
|
|
| 557 | pl->do_los = 1; |
|
|
| 558 | } |
|
|
| 559 | else if (pl->ob->map == map->tile_map[1]) |
|
|
| 560 | { |
|
|
| 561 | if ((abs (pl->ob->x + map->width - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) |
|
|
| 562 | pl->do_los = 1; |
|
|
| 563 | } |
|
|
| 564 | else if (pl->ob->map == map->tile_map[3]) |
|
|
| 565 | { |
|
|
| 566 | if ((abs (x + map->tile_map[3]->width - pl->ob->x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) |
|
|
| 567 | pl->do_los = 1; |
|
|
| 568 | } |
|
|
| 569 | } |
522 | } |
| 570 | } |
523 | } |
| 571 | |
524 | |
| 572 | static const int season_darkness[5][HOURS_PER_DAY] = { |
525 | static const int season_darkness[5][HOURS_PER_DAY] = { |
| 573 | /*0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 1 2 3 4 5 6 7 8 9 10 11 12 13 */ |
526 | /*0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 1 2 3 4 5 6 7 8 9 10 11 12 13 */ |
