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.42 by root, Sat Dec 20 02:32:31 2008 UTC vs.
Revision 1.65 by root, Wed Nov 4 18:17:57 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/* Nov 95 - inserted USE_LIGHTING code stuff in here - b.t. */
25
26#include <global.h> 23#include <global.h>
27#include <cmath> 24#include <cmath>
28 25
29static void expand_lighted_sight (object *op); 26#define SEE_IN_DARK_RADIUS 2
27#define MAX_VISION 10 // maximum visible radius
30 28
29// los flags
31enum { 30enum {
32 LOS_XI = 0x01, 31 FLG_XI = 0x01, // we have an x-parent
33 LOS_YI = 0x02, 32 FLG_YI = 0x02, // we have an y-parent
33 FLG_BLOCKED = 0x04, // this space blocks the view
34 FLG_QUEUED = 0x80 // already queued in queue, or border
34}; 35};
35 36
36struct los_info 37struct los_info
37{ 38{
38 sint8 xo, yo; // obscure angle 39 uint8 flags; // FLG_xxx
39 sint8 xe, ye; // angle deviation 40 uint8 culled; // culled from "tree"
40 uint8 culled;
41 uint8 queued;
42 uint8 visible; 41 uint8 visible;
43 uint8 flags; 42 uint8 pad0;
43
44 sint8 xo, yo; // obscure angle
45 sint8 xe, ye; // angle deviation
44}; 46};
45 47
46// temporary storage for the los algorithm, 48// temporary storage for the los algorithm,
47// one los_info for each lightable map space 49// one los_info for each lightable map space
48static los_info los[MAP_CLIENT_X][MAP_CLIENT_Y]; 50static los_info los[MAP_CLIENT_X][MAP_CLIENT_Y];
… …
75enqueue (sint8 dx, sint8 dy, uint8 flags = 0) 77enqueue (sint8 dx, sint8 dy, uint8 flags = 0)
76{ 78{
77 sint8 x = LOS_X0 + dx; 79 sint8 x = LOS_X0 + dx;
78 sint8 y = LOS_Y0 + dy; 80 sint8 y = LOS_Y0 + dy;
79 81
80 if (x < 0 || x >= MAP_CLIENT_X) return;
81 if (y < 0 || y >= MAP_CLIENT_Y) return;
82
83 los_info &l = los[x][y]; 82 los_info &l = los[x][y];
84 83
85 l.flags |= flags; 84 l.flags |= flags;
86 85
87 if (l.queued) 86 if (l.flags & FLG_QUEUED)
88 return; 87 return;
89 88
90 l.queued = 1; 89 l.flags |= FLG_QUEUED;
91 90
92 queue[q1].x = dx; 91 queue[q1].x = dx;
93 queue[q1].y = dy; 92 queue[q1].y = dy;
94 93
95 q1 = (q1 + 1) & (QUEUE_LENGTH - 1); 94 q1 = (q1 + 1) & (QUEUE_LENGTH - 1);
… …
99// this is a variant of a spiral los algorithm taken from 98// this is a variant of a spiral los algorithm taken from
100// http://www.geocities.com/temerra/los_rays.html 99// http://www.geocities.com/temerra/los_rays.html
101// which has been simplified and changed considerably, but 100// which has been simplified and changed considerably, but
102// still is basically the same algorithm. 101// still is basically the same algorithm.
103static void 102static void
104do_los (object *op) 103calculate_los (player *pl)
105{ 104{
106 player *pl = op->contr; 105 {
107
108 int max_radius = max (pl->ns->mapx, pl->ns->mapy) / 2;
109
110 memset (los, 0, sizeof (los)); 106 memset (los, 0, sizeof (los));
107
108 // we keep one line for ourselves, for the border flag
109 // so the client area is actually MAP_CLIENT_(X|Y) - 2
110 int half_x = min (LOS_X0 - 1, pl->ns->mapx / 2);
111 int half_y = min (LOS_Y0 - 1, pl->ns->mapy / 2);
112
113 // create borders, the corners are not touched
114 for (int dx = -half_x; dx <= half_x; ++dx)
115 los [dx + LOS_X0][LOS_Y0 - (half_y + 1)].flags =
116 los [dx + LOS_X0][LOS_Y0 + (half_y + 1)].flags = FLG_QUEUED;
117
118 for (int dy = -half_y; dy <= half_y; ++dy)
119 los [LOS_X0 - (half_x + 1)][dy + LOS_Y0].flags =
120 los [LOS_X0 + (half_x + 1)][dy + LOS_Y0].flags = FLG_QUEUED;
121
122 // now reset the los area and also add blocked flags
123 // which supposedly is faster than doing it inside the
124 // spiral path algorithm below, except when very little
125 // area is visible, in which case it is slower. which evens
126 // out los calculation times between large and small los maps.
127 // apply_lights also iterates over this area, maybe these
128 // two passes could be combined somehow.
129 unordered_mapwalk (pl->viewpoint, -half_x, -half_y, half_x, half_y)
130 {
131 los_info &l = los [LOS_X0 + dx][LOS_Y0 + dy];
132 l.flags = m->at (nx, ny).flags () & P_BLOCKSVIEW ? FLG_BLOCKED : 0;
133 }
134 }
111 135
112 q1 = 0; q2 = 0; // initialise queue, not strictly required 136 q1 = 0; q2 = 0; // initialise queue, not strictly required
113 enqueue (0, 0); // enqueue center 137 enqueue (0, 0); // enqueue center
114 138
115 // treat the origin specially 139 // treat the origin specially
… …
128 q2 = (q2 + 1) & (QUEUE_LENGTH - 1); 152 q2 = (q2 + 1) & (QUEUE_LENGTH - 1);
129 153
130 sint8 x = LOS_X0 + dx; 154 sint8 x = LOS_X0 + dx;
131 sint8 y = LOS_Y0 + dy; 155 sint8 y = LOS_Y0 + dy;
132 156
133 //int distance = idistance (dx, dy); if (distance > max_radius) continue;//D
134 int distance = 0;//D
135
136 los_info &l = los[x][y]; 157 los_info &l = los[x][y];
137 158
138 if (expect_true (l.flags & (LOS_XI | LOS_YI))) 159 if (expect_true (l.flags & (FLG_XI | FLG_YI)))
139 { 160 {
140 l.culled = 1; 161 l.culled = 1;
162 l.xo = l.yo = l.xe = l.ye = 0;
141 163
142 // check contributing spaces, first horizontal 164 // check contributing spaces, first horizontal
143 if (expect_true (l.flags & LOS_XI)) 165 if (expect_true (l.flags & FLG_XI))
144 { 166 {
145 los_info *xi = &los[x - sign (dx)][y]; 167 los_info *xi = &los[x - sign (dx)][y];
146 168
147 // don't cull unless obscured 169 // don't cull unless obscured
148 l.culled &= !xi->visible; 170 l.culled &= !xi->visible;
… …
173 } 195 }
174 } 196 }
175 } 197 }
176 198
177 // check contributing spaces, last vertical, identical structure 199 // check contributing spaces, last vertical, identical structure
178 if (expect_true (l.flags & LOS_YI)) 200 if (expect_true (l.flags & FLG_YI))
179 { 201 {
180 los_info *yi = &los[x][y - sign (dy)]; 202 los_info *yi = &los[x][y - sign (dy)];
181 203
182 // don't cull unless obscured 204 // don't cull unless obscured
183 l.culled &= !yi->visible; 205 l.culled &= !yi->visible;
… …
207 l.xo = yi->xo; 229 l.xo = yi->xo;
208 } 230 }
209 } 231 }
210 } 232 }
211 233
212 // check whether this space blocks the view 234 if (l.flags & FLG_BLOCKED)
213 maptile *m = op->map;
214 sint16 nx = op->x + dx;
215 sint16 ny = op->y + dy;
216
217 if (expect_true (!xy_normalise (m, nx, ny))
218 || expect_false (m->at (nx, ny).flags () & P_BLOCKSVIEW))
219 { 235 {
220 l.xo = l.xe = abs (dx); 236 l.xo = l.xe = abs (dx);
221 l.yo = l.ye = abs (dy); 237 l.yo = l.ye = abs (dy);
222 238
223 // we obscure dependents, but might be visible 239 // we obscure dependents, but might be visible
224 // copy the los from the square towards the player, 240 // copy the los from the square towards the player,
225 // so outward diagonal corners are lit. 241 // so outward diagonal corners are lit.
226 pl->los[x][y] = los[x - sign0 (dx)][y - sign0 (dy)].visible ? 0 : LOS_BLOCKED; 242 pl->los[x][y] = los[x - sign0 (dx)][y - sign0 (dy)].visible ? 0 : LOS_BLOCKED;
243
227 l.visible = false; 244 l.visible = false;
228 } 245 }
229 else 246 else
230 { 247 {
231 // we are not blocked, so calculate visibility, by checking 248 // we are not blocked, so calculate visibility, by checking
232 // whether we are inside or outside the shadow 249 // whether we are inside or outside the shadow
233 l.visible = (l.xe <= 0 || l.xe > l.xo) 250 l.visible = (l.xe <= 0 || l.xe > l.xo)
234 && (l.ye <= 0 || l.ye > l.yo); 251 && (l.ye <= 0 || l.ye > l.yo);
235 252
236 pl->los[x][y] = l.culled ? LOS_BLOCKED 253 pl->los[x][y] = l.culled ? LOS_BLOCKED
237 : l.visible ? max (0, 2 - max_radius + distance) 254 : l.visible ? 0
238 : 3; 255 : 3;
239 } 256 }
240 257
241 } 258 }
242 259
243 // Expands by the unit length in each component's current direction. 260 // Expands by the unit length in each component's current direction.
244 // If a component has no direction, then it is expanded in both of its 261 // If a component has no direction, then it is expanded in both of its
245 // positive and negative directions. 262 // positive and negative directions.
246 if (!l.culled) 263 if (!l.culled)
247 { 264 {
248 if (dx >= 0) enqueue (dx + 1, dy, LOS_XI); 265 if (dx >= 0) enqueue (dx + 1, dy, FLG_XI);
249 if (dx <= 0) enqueue (dx - 1, dy, LOS_XI); 266 if (dx <= 0) enqueue (dx - 1, dy, FLG_XI);
250 if (dy >= 0) enqueue (dx, dy + 1, LOS_YI); 267 if (dy >= 0) enqueue (dx, dy + 1, FLG_YI);
251 if (dy <= 0) enqueue (dx, dy - 1, LOS_YI); 268 if (dy <= 0) enqueue (dx, dy - 1, FLG_YI);
252 } 269 }
253 } 270 }
254} 271}
255 272
256/* returns true if op carries one or more lights
257 * This is a trivial function now days, but it used to
258 * be a bit longer. Probably better for callers to just
259 * check the op->glow_radius instead of calling this.
260 */
261int
262has_carried_lights (const object *op)
263{
264 /* op may glow! */
265 if (op->glow_radius > 0)
266 return 1;
267
268 return 0;
269}
270
271/* radius, distance => lightness adjust */ 273/* radius, distance => lightness adjust */
272static sint8 darkness[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_VISION + 1][MAX_VISION * 3 / 2 + 1];
273 276
274static struct darkness_init 277static struct los_init
275{ 278{
276 darkness_init () 279 los_init ()
277 { 280 {
281 assert (("QUEUE_LENGTH, MAP_CLIENT_X and MAP_CLIENT_Y *must* be powers of two",
282 !(QUEUE_LENGTH & (QUEUE_LENGTH - 1))));
283
284 /* for lights */
278 for (int radius = -MAX_LIGHT_RADIUS; radius <= MAX_LIGHT_RADIUS; ++radius) 285 for (int radius = -MAX_LIGHT_RADIUS; radius <= MAX_LIGHT_RADIUS; ++radius)
279 for (int distance = 0; distance <= MAX_LIGHT_RADIUS * 3 / 2; ++distance) 286 for (int distance = 0; distance <= MAX_LIGHT_RADIUS * 3 / 2; ++distance)
280 { 287 {
281 // max intensity 288 // max intensity
282 int intensity = min (LOS_MAX, abs (radius) + 1); 289 int intensity = min (LOS_MAX, abs (radius) + 1);
283 290
284 // actual intensity 291 // actual intensity
285 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));
286 293
287 darkness [radius + MAX_LIGHT_RADIUS][distance] = radius < 0 294 light_atten [radius + MAX_LIGHT_RADIUS][distance] = radius < 0
288 ? min (3, intensity) 295 ? min (3, intensity)
289 : LOS_MAX - intensity; 296 : LOS_MAX - intensity;
290 } 297 }
298
299 /* for general vision */
300 for (int radius = 0; radius <= MAX_VISION; ++radius)
301 for (int distance = 0; distance <= MAX_VISION * 3 / 2; ++distance)
302 vision_atten [radius][distance] = distance <= radius ? clamp (lerp (radius, 0, MAX_DARKNESS, 3, 0), 0, 3) : 4;
291 } 303 }
292} darkness_init; 304} los_init;
293 305
306// brighten area, ignore los
307sint8
308los_brighten_nolos (sint8 b, sint8 l)
309{
310 return min (b, l);
311}
312
313// brighten area, but respect los
294sint8 314sint8
295los_brighten (sint8 b, sint8 l) 315los_brighten (sint8 b, sint8 l)
296{ 316{
297 return b == LOS_BLOCKED ? b : min (b, l); 317 return b == LOS_BLOCKED ? b : min (b, l);
298} 318}
299 319
320// darken area, respect los
300sint8 321sint8
301los_darken (sint8 b, sint8 l) 322los_darken (sint8 b, sint8 l)
302{ 323{
303 return max (b, l); 324 return max (b, l);
304} 325}
305 326
306template<sint8 change_it (sint8, sint8)> 327template<sint8 change_it (sint8, sint8)>
307static void 328static void
308apply_light (object *op, int dx, int dy, int light, const sint8 *darkness_table) 329apply_light (player *pl, int dx, int dy, int light, const sint8 *atten_table)
309{ 330{
310 // min or max the circular area around basex, basey 331 // min or max the circular area around basex, basey
311 player *pl = op->contr;
312
313 dx += LOS_X0; 332 dx += LOS_X0;
314 dy += LOS_Y0; 333 dy += LOS_Y0;
315 334
316 int hx = op->contr->ns->mapx / 2; 335 int hx = pl->ns->mapx / 2;
317 int hy = op->contr->ns->mapy / 2; 336 int hy = pl->ns->mapy / 2;
318 337
319 int ax0 = max (LOS_X0 - hx, dx - light); 338 int ax0 = max (LOS_X0 - hx, dx - light);
320 int ay0 = max (LOS_Y0 - hy, dy - light); 339 int ay0 = max (LOS_Y0 - hy, dy - light);
321 int ax1 = min (dx + light, LOS_X0 + hx); 340 int ax1 = min (dx + light, LOS_X0 + hx);
322 int ay1 = min (dy + light, LOS_Y0 + hy); 341 int ay1 = min (dy + light, LOS_Y0 + hy);
323 342
324 for (int ax = ax0; ax <= ax1; ax++) 343 for (int ax = ax0; ax <= ax1; ax++)
325 for (int ay = ay0; ay <= ay1; ay++) 344 for (int ay = ay0; ay <= ay1; ay++)
326 pl->los[ax][ay] = 345 pl->los[ax][ay] =
327 change_it (pl->los[ax][ay], darkness_table [idistance (ax - dx, ay - dy)]); 346 change_it (pl->los[ax][ay], atten_table [idistance (ax - dx, ay - dy)]);
328} 347}
329 348
330/* add light, by finding all (non-null) nearby light sources, then 349/* add light, by finding all (non-null) nearby light sources, then
331 * mark those squares specially. 350 * mark those squares specially.
332 */ 351 */
333static void 352static void
334apply_lights (object *op) 353apply_lights (player *pl)
335{ 354{
336 int darklevel, mflags, light, x1, y1; 355 object *op = pl->viewpoint;
337 maptile *m = op->map; 356 int darklevel = op->map->darklevel ();
338 sint16 nx, ny;
339 357
340 darklevel = m->darkness;
341
342 /* If the player can see in the dark, lower the darklevel for him */
343 if (QUERY_FLAG (op, FLAG_SEE_IN_DARK))
344 darklevel -= LOS_MAX / 2;
345
346 /* Do a sanity check. If not valid, some code below may do odd
347 * things.
348 */
349 if (darklevel > MAX_DARKNESS)
350 {
351 LOG (llevError, "Map darkness for %s on %s is too high (%d)\n", &op->name, &op->map->path, darklevel);
352 darklevel = MAX_DARKNESS;
353 }
354
355 int half_x = op->contr->ns->mapx / 2; 358 int half_x = pl->ns->mapx / 2;
356 int half_y = op->contr->ns->mapy / 2; 359 int half_y = pl->ns->mapy / 2;
357
358 int min_x = op->x - half_x - MAX_LIGHT_RADIUS;
359 int min_y = op->y - half_y - MAX_LIGHT_RADIUS;
360 int max_x = op->x + half_x + MAX_LIGHT_RADIUS;
361 int max_y = op->y + half_y + MAX_LIGHT_RADIUS;
362 360
363 int pass2 = 0; // negative lights have an extra pass 361 int pass2 = 0; // negative lights have an extra pass
364 362
363 maprect *rects = pl->viewpoint->map->split_to_tiles (
364 pl->viewpoint->x - half_x - MAX_LIGHT_RADIUS,
365 pl->viewpoint->y - half_y - MAX_LIGHT_RADIUS,
366 pl->viewpoint->x + half_x + MAX_LIGHT_RADIUS + 1,
367 pl->viewpoint->y + half_y + MAX_LIGHT_RADIUS + 1
368 );
369
370 /* If the player can see in the dark, increase light/vision radius */
371 int bonus = op->flag [FLAG_SEE_IN_DARK] ? SEE_IN_DARK_RADIUS : 0;
372
365 if (darklevel < 1) 373 if (!darklevel)
366 pass2 = 1; 374 pass2 = 1;
367 else 375 else
368 { 376 {
369 /* first, make everything totally dark */ 377 /* first, make everything totally dark */
370 for (int dx = -half_x; dx <= half_x; dx++) 378 for (int dx = -half_x; dx <= half_x; dx++)
371 for (int dy = -half_x; dy <= half_y; dy++) 379 for (int dy = -half_x; dy <= half_y; dy++)
372 if (op->contr->los[dx + LOS_X0][dy + LOS_Y0] != LOS_BLOCKED)
373 op->contr->los[dx + LOS_X0][dy + LOS_Y0] = LOS_MAX; 380 max_it (pl->los[dx + LOS_X0][dy + LOS_Y0], LOS_MAX);
374 381
375 /* 382 /*
376 * Only process the area of interest. 383 * Only process the area of interest.
377 * the basex, basey values represent the position in the op->contr->los 384 * the basex, basey values represent the position in the op->contr->los
378 * array. Its easier to just increment them here (and start with the right 385 * array. Its easier to just increment them here (and start with the right
379 * value) than to recalculate them down below. 386 * value) than to recalculate them down below.
380 */ 387 */
381 for (int x = min_x; x <= max_x; x++) 388 for (maprect *r = rects; r->m; ++r)
382 for (int y = min_y; y <= max_y; y++) 389 rect_mapwalk (r, 0, 0)
383 { 390 {
384 maptile *m = op->map;
385 sint16 nx = x;
386 sint16 ny = y;
387
388 if (!xy_normalise (m, nx, ny))
389 continue;
390
391 mapspace &ms = m->at (nx, ny); 391 mapspace &ms = m->at (nx, ny);
392 ms.update (); 392 ms.update ();
393 sint8 light = ms.light; 393 sint8 light = ms.light;
394 394
395 if (expect_false (light)) 395 if (expect_false (light))
396 if (light < 0) 396 if (light < 0)
397 pass2 = 1; 397 pass2 = 1;
398 else 398 else
399 {
400 light = clamp (light + bonus, 0, MAX_LIGHT_RADIUS);
399 apply_light<los_brighten> (op, x - op->x, y - op->y, light, darkness [light + MAX_LIGHT_RADIUS]); 401 apply_light<los_brighten> (pl, dx - pl->viewpoint->x, dy - pl->viewpoint->y, light, light_atten [light + MAX_LIGHT_RADIUS]);
402 }
400 } 403 }
401 404
402 /* grant some vision to the player, based on the darklevel */ 405 /* grant some vision to the player, based on outside, outdoor, and darklevel */
403 /* for outdoor maps, ensure some mininum visibility radius */
404 { 406 {
405 int light = clamp (MAX_DARKNESS - darklevel, op->map->outdoor ? 2 : 0, MAX_LIGHT_RADIUS); 407 int light;
406 408
409 if (!op->map->outdoor) // not outdoor, darkness becomes light radius
410 light = MAX_DARKNESS - op->map->darkness;
411 else if (op->map->darkness > 0) // outdoor and darkness > 0 => use darkness as max radius
412 light = lerp_rd (maptile::outdoor_darkness + 0, 0, MAX_DARKNESS, MAX_DARKNESS - op->map->darkness, 0);
413 else // outdoor and darkness <= 0 => start wide and decrease quickly
414 light = lerp (maptile::outdoor_darkness + op->map->darkness, 0, MAX_DARKNESS, MAX_VISION, 2);
415
416 light = clamp (light + bonus, 0, MAX_VISION);
417
407 apply_light<los_brighten> (op, 0, 0, light, darkness [light + MAX_LIGHT_RADIUS]); 418 apply_light<los_brighten> (pl, 0, 0, light, vision_atten [light]);
408 } 419 }
409 } 420 }
421
422 // when we fly high, we have some minimum viewable area around us, like x-ray
423 if (op->move_type & MOVE_FLY_HIGH)
424 apply_light<los_brighten_nolos> (pl, 0, 0, 9, vision_atten [9]);
410 425
411 // possibly do 2nd pass for rare negative glow radii 426 // possibly do 2nd pass for rare negative glow radii
412 // for effect, those are always considered to be stronger than anything else 427 // for effect, those are always considered to be stronger than anything else
413 // but they can't darken a place completely 428 // but they can't darken a place completely
414 if (pass2) 429 if (pass2)
415 for (int x = min_x; x <= max_x; x++) 430 for (maprect *r = rects; r->m; ++r)
416 for (int y = min_y; y <= max_y; y++) 431 rect_mapwalk (r, 0, 0)
417 { 432 {
418 maptile *m = op->map;
419 sint16 nx = x;
420 sint16 ny = y;
421
422 if (!xy_normalise (m, nx, ny))
423 continue;
424
425 mapspace &ms = m->at (nx, ny); 433 mapspace &ms = m->at (nx, ny);
426 ms.update (); 434 ms.update ();
427 sint8 light = ms.light; 435 sint8 light = ms.light;
428 436
429 if (expect_false (light < 0)) 437 if (expect_false (light < 0))
438 {
439 light = clamp (light - bonus, 0, MAX_DARKNESS);
430 apply_light<los_darken> (op, x - op->x, y - op->y, -light, darkness [light + MAX_LIGHT_RADIUS]); 440 apply_light<los_darken> (pl, dx - pl->viewpoint->x, dy - pl->viewpoint->y, -light, light_atten [light + MAX_LIGHT_RADIUS]);
441 }
431 } 442 }
432} 443}
433 444
434/* blinded_sight() - sets all viewable squares to blocked except 445/* blinded_sight() - sets all viewable squares to blocked except
435 * for the one the central one that the player occupies. A little 446 * for the one the central one that the player occupies. A little
436 * odd that you can see yourself (and what your standing on), but 447 * odd that you can see yourself (and what your standing on), but
437 * really need for any reasonable game play. 448 * really need for any reasonable game play.
438 */ 449 */
439static void 450static void
440blinded_sight (object *op) 451blinded_sight (player *pl)
441{ 452{
442 op->contr->los[LOS_X0][LOS_Y0] = 3; 453 pl->los[LOS_X0][LOS_Y0] = 1;
443} 454}
444 455
445/* 456/*
446 * update_los() recalculates the array which specifies what is 457 * update_los() recalculates the array which specifies what is
447 * visible for the given player-object. 458 * visible for the given player-object.
448 */ 459 */
449void 460void
450update_los (object *op) 461player::update_los ()
451{ 462{
452 if (QUERY_FLAG (op, FLAG_REMOVED)) 463 if (ob->flag [FLAG_REMOVED])//D really needed?
453 return; 464 return;
454 465
455 op->contr->clear_los (); 466 if (ob->flag [FLAG_WIZLOOK])
456 467 clear_los (0);
457 if (QUERY_FLAG (op, FLAG_WIZ) /* ||XRAYS(op) */ )
458 memset (op->contr->los, 0, sizeof (op->contr->los));
459 else if (QUERY_FLAG (op, FLAG_BLIND)) /* player is blind */ 468 else if (viewpoint->flag [FLAG_BLIND]) /* player is blind */
469 {
470 clear_los ();
460 blinded_sight (op); 471 blinded_sight (this);
472 }
461 else 473 else
462 { 474 {
463 do_los (op); 475 clear_los ();
476 calculate_los (this);
464 apply_lights (op); 477 apply_lights (this);
465 } 478 }
466 479
467 if (QUERY_FLAG (op, FLAG_XRAYS)) 480 if (viewpoint->flag [FLAG_XRAYS])
468 for (int dx = -2; dx <= 2; dx++) 481 for (int dx = -2; dx <= 2; dx++)
469 for (int dy = -2; dy <= 2; dy++) 482 for (int dy = -2; dy <= 2; dy++)
470 op->contr->los[dx + LOS_X0][dy + LOS_X0] = 0; 483 min_it (los[dx + LOS_X0][dy + LOS_Y0], 1);
471} 484}
472 485
473/* update all_map_los is like update_all_los below, 486/* update all_map_los is like update_all_los below,
474 * but updates everyone on the map, no matter where they 487 * but updates everyone on the map, no matter where they
475 * are. This generally should not be used, as a per 488 * are. This generally should not be used, as a per
… …
482 * change_map_light function 495 * change_map_light function
483 */ 496 */
484void 497void
485update_all_map_los (maptile *map) 498update_all_map_los (maptile *map)
486{ 499{
487 for_all_players (pl) 500 for_all_players_on_map (pl, map)
488 if (pl->ob && pl->ob->map == map)
489 pl->do_los = 1; 501 pl->do_los = 1;
490} 502}
491 503
492/* 504/*
493 * This function makes sure that update_los() will be called for all 505 * This function makes sure that update_los() will be called for all
494 * players on the given map within the next frame. 506 * players on the given map within the next frame.
… …
502 * map is the map that changed, x and y are the coordinates. 514 * map is the map that changed, x and y are the coordinates.
503 */ 515 */
504void 516void
505update_all_los (const maptile *map, int x, int y) 517update_all_los (const maptile *map, int x, int y)
506{ 518{
519 map->at (x, y).invalidate ();
520
507 for_all_players (pl) 521 for_all_players (pl)
508 { 522 {
509 /* Player should not have a null map, but do this 523 /* Player should not have a null map, but do this
510 * check as a safety 524 * check as a safety
511 */ 525 */
512 if (!pl->ob || !pl->ob->map || !pl->ns) 526 if (!pl->ob || !pl->ob->map || !pl->ns)
513 continue; 527 continue;
514 528
515 /* Same map is simple case - see if pl is close enough. 529 rv_vector rv;
516 * Note in all cases, we did the check for same map first, 530
517 * and then see if the player is close enough and update 531 get_rangevector_from_mapcoord (map, x, y, pl->ob, &rv);
518 * los if that is the case. If the player is on the
519 * corresponding map, but not close enough, then the
520 * player can't be on another map that may be closer,
521 * so by setting it up this way, we trim processing
522 * some.
523 */ 532
524 if (pl->ob->map == map) 533 if ((abs (rv.distance_x) <= pl->ns->mapx / 2) && (abs (rv.distance_y) <= pl->ns->mapy / 2))
525 {
526 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2))
527 pl->do_los = 1; 534 pl->do_los = 1;
528 }
529
530 /* Now we check to see if player is on adjacent
531 * maps to the one that changed and also within
532 * view. The tile_maps[] could be null, but in that
533 * case it should never match the pl->ob->map, so
534 * we want ever try to dereference any of the data in it.
535 *
536 * The logic for 0 and 3 is to see how far the player is
537 * from the edge of the map (height/width) - pl->ob->(x,y)
538 * and to add current position on this map - that gives a
539 * distance.
540 * For 1 and 2, we check to see how far the given
541 * coordinate (x,y) is from the corresponding edge,
542 * and then add the players location, which gives
543 * a distance.
544 */
545 else if (pl->ob->map == map->tile_map[0])
546 {
547 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (y + map->tile_map[0]->height - pl->ob->y) <= pl->ns->mapy / 2))
548 pl->do_los = 1;
549 }
550 else if (pl->ob->map == map->tile_map[2])
551 {
552 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y + map->height - y) <= pl->ns->mapy / 2))
553 pl->do_los = 1;
554 }
555 else if (pl->ob->map == map->tile_map[1])
556 {
557 if ((abs (pl->ob->x + map->width - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2))
558 pl->do_los = 1;
559 }
560 else if (pl->ob->map == map->tile_map[3])
561 {
562 if ((abs (x + map->tile_map[3]->width - pl->ob->x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2))
563 pl->do_los = 1;
564 }
565 } 535 }
536}
537
538static const int season_darkness[5][HOURS_PER_DAY] = {
539 /*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 */
540 { 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 0, 0, 0, 0, 1, 2, 2, 2, 3, 3, 4, 4, 5 },
541 { 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4 },
542 { 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 4, 4 },
543 { 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 4 },
544 { 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4 }
545};
546
547/*
548 * Tell players the time and compute the darkness level for all maps in the game.
549 * MUST be called exactly once per hour.
550 */
551void
552maptile::adjust_daylight ()
553{
554 timeofday_t tod;
555
556 get_tod (&tod);
557
558 // log the time to log-1 every hour, and to chat every day
559 {
560 char todbuf[512];
561
562 format_tod (todbuf, sizeof (todbuf), &tod);
563
564 for_all_players (pl)
565 pl->ns->send_msg (NDI_GREY, tod.hour == 15 ? CHAT_CHANNEL : LOG_CHANNEL, todbuf);
566 }
567
568 /* If the light level isn't changing, no reason to do all
569 * the work below.
570 */
571 sint8 new_darkness = season_darkness[tod.season][tod.hour];
572
573 if (new_darkness == maptile::outdoor_darkness)
574 return;
575
576 new_draw_info (NDI_GREY | NDI_UNIQUE | NDI_ALL, 1, 0,
577 new_darkness > maptile::outdoor_darkness
578 ? "It becomes darker."
579 : "It becomes brighter.");
580
581 maptile::outdoor_darkness = new_darkness;
582
583 // we simply update the los for all players, which is unnecessarily
584 // costly, but should do for the moment.
585 for_all_players (pl)
586 pl->do_los = 1;
566} 587}
567 588
568/* 589/*
569 * make_sure_seen: The object is supposed to be visible through walls, thus 590 * make_sure_seen: The object is supposed to be visible through walls, thus
570 * check if any players are nearby, and edit their LOS array. 591 * check if any players are nearby, and edit their LOS array.
… …
574{ 595{
575 for_all_players (pl) 596 for_all_players (pl)
576 if (pl->ob->map == op->map && 597 if (pl->ob->map == op->map &&
577 pl->ob->y - pl->ns->mapy / 2 <= op->y && 598 pl->ob->y - pl->ns->mapy / 2 <= op->y &&
578 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) 599 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)
579 pl->los[op->x - pl->ob->x + LOS_X0][op->y - pl->ob->y + LOS_X0] = 0; 600 pl->los[op->x - pl->ob->x + LOS_X0][op->y - pl->ob->y + LOS_Y0] = 0;
580} 601}
581 602
582/* 603/*
583 * make_sure_not_seen: The object which is supposed to be visible through 604 * make_sure_not_seen: The object which is supposed to be visible through
584 * walls has just been removed from the map, so update the los of any 605 * walls has just been removed from the map, so update the los of any
… …
591 if (pl->ob->map == op->map && 612 if (pl->ob->map == op->map &&
592 pl->ob->y - pl->ns->mapy / 2 <= op->y && 613 pl->ob->y - pl->ns->mapy / 2 <= op->y &&
593 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) 614 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)
594 pl->do_los = 1; 615 pl->do_los = 1;
595} 616}
617

Diff Legend

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