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.55 by root, Tue Jan 6 19:17:06 2009 UTC vs.
Revision 1.63 by root, Tue Nov 3 23:44:20 2009 UTC

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>
25#include <cmath> 24#include <cmath>
26 25
27#define SEE_IN_DARK_RADIUS 3 26#define SEE_IN_DARK_RADIUS 2
27#define MAX_VISION 10 // maximum visible radius
28 28
29// los flags 29// los flags
30enum { 30enum {
31 FLG_XI = 0x01, // we have an x-parent 31 FLG_XI = 0x01, // we have an x-parent
32 FLG_YI = 0x02, // we have an y-parent 32 FLG_YI = 0x02, // we have an y-parent
… …
270 } 270 }
271} 271}
272 272
273/* radius, distance => lightness adjust */ 273/* radius, distance => lightness adjust */
274static sint8 light_atten[MAX_LIGHT_RADIUS * 2 + 1][MAX_LIGHT_RADIUS * 3 / 2 + 1]; 274static sint8 light_atten[MAX_LIGHT_RADIUS * 2 + 1][MAX_LIGHT_RADIUS * 3 / 2 + 1];
275static sint8 vision_atten[MAX_DARKNESS + SEE_IN_DARK_RADIUS + 1][(MAX_DARKNESS + SEE_IN_DARK_RADIUS) * 3 / 2 + 1]; 275static sint8 vision_atten[MAX_VISION + 1][MAX_VISION * 3 / 2 + 1];
276 276
277static struct los_init 277static struct los_init
278{ 278{
279 los_init () 279 los_init ()
280 { 280 {
… …
287 { 287 {
288 // max intensity 288 // max intensity
289 int intensity = min (LOS_MAX, abs (radius) + 1); 289 int intensity = min (LOS_MAX, abs (radius) + 1);
290 290
291 // actual intensity 291 // actual intensity
292 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));
293 293
294 light_atten [radius + MAX_LIGHT_RADIUS][distance] = radius < 0 294 light_atten [radius + MAX_LIGHT_RADIUS][distance] = radius < 0
295 ? min (3, intensity) 295 ? min (3, intensity)
296 : LOS_MAX - intensity; 296 : LOS_MAX - intensity;
297 } 297 }
298 298
299 /* for general vision */ 299 /* for general vision */
300 for (int radius = 0; radius <= MAX_DARKNESS + SEE_IN_DARK_RADIUS; ++radius) 300 for (int radius = 0; radius <= MAX_VISION; ++radius)
301 for (int distance = 0; distance <= (MAX_DARKNESS + SEE_IN_DARK_RADIUS) * 3 / 2; ++distance) 301 for (int distance = 0; distance <= MAX_VISION * 3 / 2; ++distance)
302 vision_atten [radius][distance] = distance <= radius ? 3 : 4; 302 vision_atten [radius][distance] = distance <= radius ? clamp (lerp (radius, 0, MAX_DARKNESS, 3, 0), 0, 3) : 4;
303 } 303 }
304} los_init; 304} los_init;
305 305
306sint8 306sint8
307los_brighten (sint8 b, sint8 l) 307los_brighten (sint8 b, sint8 l)
… …
355 pl->observe->x - half_x - MAX_LIGHT_RADIUS, 355 pl->observe->x - half_x - MAX_LIGHT_RADIUS,
356 pl->observe->y - half_y - MAX_LIGHT_RADIUS, 356 pl->observe->y - half_y - MAX_LIGHT_RADIUS,
357 pl->observe->x + half_x + MAX_LIGHT_RADIUS + 1, 357 pl->observe->x + half_x + MAX_LIGHT_RADIUS + 1,
358 pl->observe->y + half_y + MAX_LIGHT_RADIUS + 1 358 pl->observe->y + half_y + MAX_LIGHT_RADIUS + 1
359 ); 359 );
360
361 /* If the player can see in the dark, increase light/vision radius */
362 int bonus = op->flag [FLAG_SEE_IN_DARK] ? SEE_IN_DARK_RADIUS : 0;
360 363
361 if (!darklevel) 364 if (!darklevel)
362 pass2 = 1; 365 pass2 = 1;
363 else 366 else
364 { 367 {
… …
382 385
383 if (expect_false (light)) 386 if (expect_false (light))
384 if (light < 0) 387 if (light < 0)
385 pass2 = 1; 388 pass2 = 1;
386 else 389 else
390 {
391 light = clamp (light + bonus, 0, MAX_LIGHT_RADIUS);
387 apply_light<los_brighten> (pl, dx - pl->observe->x, dy - pl->observe->y, light, light_atten [light + MAX_LIGHT_RADIUS]); 392 apply_light<los_brighten> (pl, dx - pl->observe->x, dy - pl->observe->y, light, light_atten [light + MAX_LIGHT_RADIUS]);
393 }
388 } 394 }
389 395
390 /* grant some vision to the player, based on the darklevel */ 396 /* grant some vision to the player, based on outside, outdoor, and darklevel */
391 { 397 {
392 int light = clamp (MAX_DARKNESS - darklevel, 0, MAX_DARKNESS); 398 int light;
393 399
394 /* If the player can see in the dark, lower the darklevel for him */ 400 if (!op->map->outdoor) // not outdoor, darkness becomes light radius
395 if (op->flag [FLAG_SEE_IN_DARK]) 401 light = MAX_DARKNESS - op->map->darkness;
396 light += SEE_IN_DARK_RADIUS; 402 else if (op->map->darkness > 0) // outdoor and darkness > 0 => use darkness as max radius
403 light = lerp_rd (maptile::outdoor_darkness + 0, 0, MAX_DARKNESS, MAX_DARKNESS - op->map->darkness, 0);
404 else // outdoor and darkness <= 0 => start wide and decrease quickly
405 light = lerp (maptile::outdoor_darkness + op->map->darkness, 0, MAX_DARKNESS, MAX_VISION, 2);
406
407 light = clamp (light + bonus, 0, MAX_VISION);
397 408
398 apply_light<los_brighten> (pl, 0, 0, light, vision_atten [light]); 409 apply_light<los_brighten> (pl, 0, 0, light, vision_atten [light]);
399 } 410 }
400 } 411 }
401 412
… …
409 mapspace &ms = m->at (nx, ny); 420 mapspace &ms = m->at (nx, ny);
410 ms.update (); 421 ms.update ();
411 sint8 light = ms.light; 422 sint8 light = ms.light;
412 423
413 if (expect_false (light < 0)) 424 if (expect_false (light < 0))
425 {
426 light = clamp (light - bonus, 0, MAX_DARKNESS);
414 apply_light<los_darken> (pl, dx - pl->observe->x, dy - pl->observe->y, -light, light_atten [light + MAX_LIGHT_RADIUS]); 427 apply_light<los_darken> (pl, dx - pl->observe->x, dy - pl->observe->y, -light, light_atten [light + MAX_LIGHT_RADIUS]);
428 }
415 } 429 }
416} 430}
417 431
418/* blinded_sight() - sets all viewable squares to blocked except 432/* blinded_sight() - sets all viewable squares to blocked except
419 * for the one the central one that the player occupies. A little 433 * for the one the central one that the player occupies. A little
… …
487 * 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.
488 */ 502 */
489void 503void
490update_all_los (const maptile *map, int x, int y) 504update_all_los (const maptile *map, int x, int y)
491{ 505{
492 // no need to do anything if we don't have darkness
493 if (map->darklevel () <= 0)
494 return;
495
496 map->at (x, y).invalidate (); 506 map->at (x, y).invalidate ();
497 507
498 for_all_players (pl) 508 for_all_players (pl)
499 { 509 {
500 /* Player should not have a null map, but do this 510 /* Player should not have a null map, but do this
501 * check as a safety 511 * check as a safety
502 */ 512 */
503 if (!pl->ob || !pl->ob->map || !pl->ns) 513 if (!pl->ob || !pl->ob->map || !pl->ns)
504 continue; 514 continue;
505 515
506 /* Same map is simple case - see if pl is close enough. 516 rv_vector rv;
507 * Note in all cases, we did the check for same map first, 517
508 * and then see if the player is close enough and update 518 get_rangevector_from_mapcoord (map, x, y, pl->ob, &rv);
509 * los if that is the case. If the player is on the
510 * corresponding map, but not close enough, then the
511 * player can't be on another map that may be closer,
512 * so by setting it up this way, we trim processing
513 * some.
514 */ 519
515 if (pl->ob->map == map) 520 if ((abs (rv.distance_x) <= pl->ns->mapx / 2) && (abs (rv.distance_y) <= pl->ns->mapy / 2))
516 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2))
517 pl->do_los = 1; 521 pl->do_los = 1;
518
519 /* Now we check to see if player is on adjacent
520 * maps to the one that changed and also within
521 * view. The tile_maps[] could be null, but in that
522 * case it should never match the pl->ob->map, so
523 * we want ever try to dereference any of the data in it.
524 *
525 * The logic for 0 and 3 is to see how far the player is
526 * from the edge of the map (height/width) - pl->ob->(x,y)
527 * and to add current position on this map - that gives a
528 * distance.
529 * For 1 and 2, we check to see how far the given
530 * coordinate (x,y) is from the corresponding edge,
531 * and then add the players location, which gives
532 * a distance.
533 */
534 else if (pl->ob->map == map->tile_map[0])
535 {
536 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (y + map->tile_map[0]->height - pl->ob->y) <= pl->ns->mapy / 2))
537 pl->do_los = 1;
538 }
539 else if (pl->ob->map == map->tile_map[2])
540 {
541 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y + map->height - y) <= pl->ns->mapy / 2))
542 pl->do_los = 1;
543 }
544 else if (pl->ob->map == map->tile_map[1])
545 {
546 if ((abs (pl->ob->x + map->width - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2))
547 pl->do_los = 1;
548 }
549 else if (pl->ob->map == map->tile_map[3])
550 {
551 if ((abs (x + map->tile_map[3]->width - pl->ob->x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2))
552 pl->do_los = 1;
553 }
554 } 522 }
555} 523}
556 524
557static const int season_darkness[5][HOURS_PER_DAY] = { 525static const int season_darkness[5][HOURS_PER_DAY] = {
558 /*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 */

Diff Legend

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