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.25 by root, Thu May 17 21:32:08 2007 UTC vs.
Revision 1.32 by root, Thu Dec 4 03:48:19 2008 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 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.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25/* Nov 95 - inserted USE_LIGHTING code stuff in here - b.t. */ 24/* Nov 95 - inserted USE_LIGHTING code stuff in here - b.t. */
26 25
27#include <global.h> 26#include <global.h>
28#include <funcpoint.h>
29#include <math.h> 27#include <math.h>
30 28
31/* Distance must be less than this for the object to be blocked. 29/* 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 30 * 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 31 * that blocks half the view (0.0 is complete block) will
34 * block view in our tables. 32 * block view in our tables.
35 * .4 or less lets you see through walls. .5 is about right. 33 * .4 or less lets you see through walls. .5 is about right.
36 */ 34 */
37 35
38#define SPACE_BLOCK 0.5 36#define SPACE_BLOCK 0.5
37#define MAX_DARKNESS_LOS 4 /* 4 == totally dark */
39 38
40typedef struct blstr 39typedef struct blstr
41{ 40{
42 int x[4], y[4]; 41 int x[4], y[4];
43 int index; 42 int index;
… …
248 * Clears/initialises the los-array associated to the player 247 * Clears/initialises the los-array associated to the player
249 * controlling the object. 248 * controlling the object.
250 */ 249 */
251 250
252void 251void
253clear_los (object *op) 252clear_los (player *pl)
254{ 253{
255 /* This is safer than using the ns->mapx, mapy because 254 /* This is safer than using the ns->mapx, mapy because
256 * we index the blocked_los as a 2 way array, so clearing 255 * we index the blocked_los as a 2 way array, so clearing
257 * the first z spaces may not not cover the spaces we are 256 * the first z spaces may not not cover the spaces we are
258 * actually going to use 257 * actually going to use
259 */ 258 */
260 (void) memset ((void *) op->contr->blocked_los, 0, MAP_CLIENT_X * MAP_CLIENT_Y); 259 memset (pl->blocked_los, 0, MAP_CLIENT_X * MAP_CLIENT_Y);
261} 260}
262 261
263/* 262/*
264 * expand_sight goes through the array of what the given player is 263 * expand_sight goes through the array of what the given player is
265 * able to see, and expands the visible area a bit, so the player will, 264 * able to see, and expands the visible area a bit, so the player will,
… …
315 return 1; 314 return 1;
316 315
317 return 0; 316 return 0;
318} 317}
319 318
319/* radius, distance => lightness adjust */
320static sint8 darkness[MAX_LIGHT_RADIUS * 2 + 1][MAX_LIGHT_RADIUS + 1];
321
322static struct darkness_init
323{
324 darkness_init ()
325 {
326 for (int radius = -MAX_LIGHT_RADIUS; radius <= MAX_LIGHT_RADIUS; ++radius)
327 for (int distance = 0; distance <= MAX_LIGHT_RADIUS; ++distance)
328 {
329 // max intensity
330 int intensity = min (MAX_DARKNESS_LOS, abs (radius) + 1);
331
332 // actual intensity
333 intensity = max (0, lerp_rd (distance, 0, abs (radius) + 1, intensity, 0));
334
335 darkness [radius + MAX_LIGHT_RADIUS][distance] = radius < 0
336 ? intensity
337 : MAX_DARKNESS_LOS - intensity;
338 }
339 }
340} darkness_init;
341
320static void 342static void
321expand_lighted_sight (object *op) 343expand_lighted_sight (object *op)
322{ 344{
323 int x, y, darklevel, ax, ay, basex, basey, mflags, light, x1, y1; 345 int x, y, darklevel, basex, basey, mflags, light, x1, y1;
324 maptile *m = op->map; 346 maptile *m = op->map;
325 sint16 nx, ny; 347 sint16 nx, ny;
326 348
327 darklevel = m->darkness; 349 darklevel = m->darkness;
350 darklevel = MAX_DARKNESS;//D
328 351
329 /* If the player can see in the dark, lower the darklevel for him */ 352 /* If the player can see in the dark, lower the darklevel for him */
330 if (QUERY_FLAG (op, FLAG_SEE_IN_DARK)) 353 if (QUERY_FLAG (op, FLAG_SEE_IN_DARK))
331 darklevel -= 2; 354 darklevel -= MAX_DARKNESS_LOS / 2;
332 355
333 /* add light, by finding all (non-null) nearby light sources, then 356 /* add light, by finding all (non-null) nearby light sources, then
334 * mark those squares specially. If the darklevel<1, there is no 357 * mark those squares specially. If the darklevel<1, there is no
335 * reason to do this, so we skip this function 358 * reason to do this, so we skip this function
336 */ 359 */
… …
345 { 368 {
346 LOG (llevError, "Map darkness for %s on %s is too high (%d)\n", &op->name, &op->map->path, darklevel); 369 LOG (llevError, "Map darkness for %s on %s is too high (%d)\n", &op->name, &op->map->path, darklevel);
347 darklevel = MAX_DARKNESS; 370 darklevel = MAX_DARKNESS;
348 } 371 }
349 372
350 /* First, limit player furthest (unlighted) vision */ 373 /* first, make everything totally dark */
351 for (x = 0; x < op->contr->ns->mapx; x++) 374 for (x = 0; x < op->contr->ns->mapx; x++)
352 for (y = 0; y < op->contr->ns->mapy; y++) 375 for (y = 0; y < op->contr->ns->mapy; y++)
353 if (op->contr->blocked_los[x][y] != 100) 376 if (op->contr->blocked_los[x][y] != 100)
354 op->contr->blocked_los[x][y] = MAX_LIGHT_RADII; 377 op->contr->blocked_los[x][y] = MAX_DARKNESS_LOS;
355 378
356 /* the spaces[] darkness value contains the information we need. 379 int half_x = op->contr->ns->mapx / 2;
380 int half_y = op->contr->ns->mapy / 2;
381
382 int min_x = op->x - half_x - MAX_LIGHT_RADIUS;
383 int min_y = op->y - half_y - MAX_LIGHT_RADIUS;
384 int max_x = op->x + half_x + MAX_LIGHT_RADIUS;
385 int max_y = op->y + half_y + MAX_LIGHT_RADIUS;
386
387 int pass2 = 0; // negative lights have an extra pass
388
389 /*
357 * Only process the area of interest. 390 * Only process the area of interest.
358 * the basex, basey values represent the position in the op->contr->blocked_los 391 * the basex, basey values represent the position in the op->contr->blocked_los
359 * array. Its easier to just increment them here (and start with the right 392 * array. Its easier to just increment them here (and start with the right
360 * value) than to recalculate them down below. 393 * value) than to recalculate them down below.
361 */ 394 */
362 for (x = (op->x - op->contr->ns->mapx / 2 - MAX_LIGHT_RADII), basex = -MAX_LIGHT_RADII; 395 for (int x = min_x, basex = -MAX_LIGHT_RADIUS; x <= max_x; x++, basex++)
363 x <= (op->x + op->contr->ns->mapx / 2 + MAX_LIGHT_RADII); x++, basex++) 396 for (int y = min_y, basey = -MAX_LIGHT_RADIUS; y <= max_y; y++, basey++)
364 {
365
366 for (y = (op->y - op->contr->ns->mapy / 2 - MAX_LIGHT_RADII), basey = -MAX_LIGHT_RADII;
367 y <= (op->y + op->contr->ns->mapy / 2 + MAX_LIGHT_RADII); y++, basey++)
368 { 397 {
398 maptile *m = op->map;
399 sint16 nx = x;
400 sint16 ny = y;
401
402 if (!xy_normalise (m, nx, ny))
403 continue;
404
405 mapspace &ms = m->at (nx, ny);
406 ms.update ();
407 sint8 light = ms.light;
408
409 if (expect_false (light))
410 if (light < 0)
411 pass2 = 1;
412 else
413 {
414 /* This space is providing light, so we need to brighten up the
415 * spaces around here.
416 */
417 const sint8 *darkness_table = darkness [light + MAX_LIGHT_RADIUS];
418
419 for (int ax = max (0, basex - light); ax <= min (basex + light, op->contr->ns->mapx - 1); ax++)
420 for (int ay = max (0, basey - light); ay <= min (basey + light, op->contr->ns->mapy - 1); ay++)
421 if (op->contr->blocked_los[ax][ay] != 100)
422 min_it (op->contr->blocked_los[ax][ay], darkness_table [idistance (ax - basex, ay - basey)]);
423 }
424 }
425
426 // psosibly do 2nd pass for rare negative glow radii
427 if (pass2)
428 for (x = min_x, basex = -MAX_LIGHT_RADIUS; x <= max_x; x++, basex++)
429 for (y = min_y, basey = -MAX_LIGHT_RADIUS; y <= max_y; y++, basey++)
430 {
369 m = op->map; 431 maptile *m = op->map;
370 nx = x; 432 sint16 nx = x;
371 ny = y; 433 sint16 ny = y;
372 434
373 mflags = get_map_flags (m, &m, nx, ny, &nx, &ny); 435 if (!xy_normalise (m, nx, ny))
374
375 if (mflags & P_OUT_OF_MAP)
376 continue; 436 continue;
377 437
378 /* This space is providing light, so we need to brighten up the 438 mapspace &ms = m->at (nx, ny);
379 * spaces around here. 439 ms.update ();
380 */ 440 sint8 light = ms.light;
381 light = GET_MAP_LIGHT (m, nx, ny); 441
382 if (light != 0) 442 if (expect_false (light < 0))
383 { 443 {
384#if 0 444 const sint8 *darkness_table = darkness [light + MAX_LIGHT_RADIUS];
385 LOG (llevDebug, "expand_lighted_sight: Found light at x=%d, y=%d, basex=%d, basey=%d\n", x, y, basex, basey);
386#endif
387 for (ax = basex - light; ax <= basex + light; ax++)
388 {
389 if (ax < 0 || ax >= op->contr->ns->mapx)
390 continue;
391 445
392 for (ay = basey - light; ay <= basey + light; ay++) 446 for (int ax = max (0, basex + light); ax <= min (basex - light, op->contr->ns->mapx - 1); ax++)
393 { 447 for (int ay = max (0, basey + light); ay <= min (basey - light, op->contr->ns->mapy - 1); ay++)
394 if (ay < 0 || ay >= op->contr->ns->mapy)
395 continue;
396
397 /* If the space is fully blocked, do nothing. Otherwise, we
398 * brighten the space. The further the light is away from the
399 * source (basex-x), the less effect it has. Though light used
400 * to dim in a square manner, it now dims in a circular manner
401 * using the the pythagorean theorem. glow_radius still
402 * represents the radius
403 */
404 if (op->contr->blocked_los[ax][ay] != 100) 448 if (op->contr->blocked_los[ax][ay] != 100)
405 { 449 max_it (op->contr->blocked_los[ax][ay], darkness_table [idistance (ax - basex, ay - basey)]);
406 x1 = abs (basex - ax) * abs (basex - ax);
407 y1 = abs (basey - ay) * abs (basey - ay);
408
409 if (light > 0) op->contr->blocked_los[ax][ay] -= max (light - isqrt (x1 + y1), 0);
410 if (light < 0) op->contr->blocked_los[ax][ay] -= min (light + isqrt (x1 + y1), 0);
411 }
412 }
413 }
414 } 450 }
415 } 451 }
416 }
417 452
418 /* Outdoor should never really be completely pitch black dark like 453 /* Outdoor should never really be completely pitch black dark like
419 * a dungeon, so let the player at least see a little around themselves 454 * a dungeon, so let the player at least see a little around themselves
420 */ 455 */
421 if (op->map->outdoor && darklevel > (MAX_DARKNESS - 3)) 456 if (op->map->outdoor && darklevel > MAX_DARKNESS - 3)
422 { 457 {
423 if (op->contr->blocked_los[op->contr->ns->mapx / 2][op->contr->ns->mapy / 2] > (MAX_DARKNESS - 3)) 458 if (op->contr->blocked_los[op->contr->ns->mapx / 2][op->contr->ns->mapy / 2] > (MAX_DARKNESS - 3))
424 op->contr->blocked_los[op->contr->ns->mapx / 2][op->contr->ns->mapy / 2] = MAX_DARKNESS - 3; 459 op->contr->blocked_los[op->contr->ns->mapx / 2][op->contr->ns->mapy / 2] = MAX_DARKNESS - 3;
425 460
426 for (x = -1; x <= 1; x++) 461 for (x = -1; x <= 1; x++)
… …
434 /* grant some vision to the player, based on the darklevel */ 469 /* grant some vision to the player, based on the darklevel */
435 for (x = darklevel - MAX_DARKNESS; x < MAX_DARKNESS + 1 - darklevel; x++) 470 for (x = darklevel - MAX_DARKNESS; x < MAX_DARKNESS + 1 - darklevel; x++)
436 for (y = darklevel - MAX_DARKNESS; y < MAX_DARKNESS + 1 - darklevel; y++) 471 for (y = darklevel - MAX_DARKNESS; y < MAX_DARKNESS + 1 - darklevel; y++)
437 if (!(op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] == 100)) 472 if (!(op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] == 100))
438 op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] -= 473 op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] -=
439 MAX (0, 6 - darklevel - MAX (abs (x), abs (y))); 474 max (0, 6 - darklevel - max (abs (x), abs (y)));
440} 475}
441 476
442/* blinded_sight() - sets all veiwable squares to blocked except 477/* blinded_sight() - sets all viewable squares to blocked except
443 * for the one the central one that the player occupies. A little 478 * for the one the central one that the player occupies. A little
444 * odd that you can see yourself (and what your standing on), but 479 * odd that you can see yourself (and what your standing on), but
445 * really need for any reasonable game play. 480 * really need for any reasonable game play.
446 */ 481 */
447static void 482static void
… …
458 493
459/* 494/*
460 * update_los() recalculates the array which specifies what is 495 * update_los() recalculates the array which specifies what is
461 * visible for the given player-object. 496 * visible for the given player-object.
462 */ 497 */
463
464void 498void
465update_los (object *op) 499update_los (object *op)
466{ 500{
467 int dx = op->contr->ns->mapx / 2, dy = op->contr->ns->mapy / 2, x, y; 501 int dx = op->contr->ns->mapx / 2, dy = op->contr->ns->mapy / 2, x, y;
468 502
469 if (QUERY_FLAG (op, FLAG_REMOVED)) 503 if (QUERY_FLAG (op, FLAG_REMOVED))
470 return; 504 return;
471 505
472 clear_los (op); 506 clear_los (op->contr);
507
473 if (QUERY_FLAG (op, FLAG_WIZ) /* ||XRAYS(op) */ ) 508 if (QUERY_FLAG (op, FLAG_WIZ) /* ||XRAYS(op) */ )
474 return; 509 return;
475 510
476 /* For larger maps, this is more efficient than the old way which 511 /* For larger maps, this is more efficient than the old way which
477 * used the chaining of the block array. Since many space views could 512 * used the chaining of the block array. Since many space views could

Diff Legend

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