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.45 by root, Sun Dec 21 23:29:27 2008 UTC vs.
Revision 1.56 by root, Thu Jan 8 19:23:44 2009 UTC

… …
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24/* Nov 95 - inserted USE_LIGHTING code stuff in here - b.t. */
25
26#include <global.h> 24#include <global.h>
27#include <cmath> 25#include <cmath>
28 26
29static void expand_lighted_sight (object *op); 27#define SEE_IN_DARK_RADIUS 2
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{
39 uint8 flags; // FLG_xxx
40 uint8 culled; // culled from "tree"
41 uint8 visible;
42 uint8 pad0;
43
38 sint8 xo, yo; // obscure angle 44 sint8 xo, yo; // obscure angle
39 sint8 xe, ye; // angle deviation 45 sint8 xe, ye; // angle deviation
40 uint8 culled; // culled from "tree"
41 uint8 queued; // already queued
42 uint8 visible;
43 uint8 flags; // LOS_XI/YI
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->observe, -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 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];
273static sint8 vision_atten[MAX_DARKNESS + 1][MAX_DARKNESS * 3 / 2 + 1]; 275static sint8 vision_atten[MAX_DARKNESS + SEE_IN_DARK_RADIUS + 1][(MAX_DARKNESS + SEE_IN_DARK_RADIUS) * 3 / 2 + 1];
274 276
275static struct los_init 277static struct los_init
276{ 278{
277 los_init () 279 los_init ()
278 { 280 {
281 assert (("QUEUE_LENGTH, MAP_CLIENT_X and MAP_CLIENT_Y *must* be powers of two",
282 !(QUEUE_LENGTH & (QUEUE_LENGTH - 1))));
283
279 /* for lights */ 284 /* for lights */
280 for (int radius = -MAX_LIGHT_RADIUS; radius <= MAX_LIGHT_RADIUS; ++radius) 285 for (int radius = -MAX_LIGHT_RADIUS; radius <= MAX_LIGHT_RADIUS; ++radius)
281 for (int distance = 0; distance <= MAX_LIGHT_RADIUS * 3 / 2; ++distance) 286 for (int distance = 0; distance <= MAX_LIGHT_RADIUS * 3 / 2; ++distance)
282 { 287 {
283 // max intensity 288 // max intensity
… …
290 ? min (3, intensity) 295 ? min (3, intensity)
291 : LOS_MAX - intensity; 296 : LOS_MAX - intensity;
292 } 297 }
293 298
294 /* for general vision */ 299 /* for general vision */
295 for (int radius = 0; radius <= MAX_DARKNESS; ++radius) 300 for (int radius = 0; radius <= MAX_DARKNESS + SEE_IN_DARK_RADIUS; ++radius)
296 for (int distance = 0; distance <= MAX_DARKNESS * 3 / 2; ++distance) 301 for (int distance = 0; distance <= (MAX_DARKNESS + SEE_IN_DARK_RADIUS) * 3 / 2; ++distance)
297 {
298 vision_atten [radius][distance] = distance <= radius ? 3 : 4; 302 vision_atten [radius][distance] = distance <= radius ? 3 : 4;
299 }
300 } 303 }
301} los_init; 304} los_init;
302 305
303sint8 306sint8
304los_brighten (sint8 b, sint8 l) 307los_brighten (sint8 b, sint8 l)
… …
312 return max (b, l); 315 return max (b, l);
313} 316}
314 317
315template<sint8 change_it (sint8, sint8)> 318template<sint8 change_it (sint8, sint8)>
316static void 319static void
317apply_light (object *op, int dx, int dy, int light, const sint8 *atten_table) 320apply_light (player *pl, int dx, int dy, int light, const sint8 *atten_table)
318{ 321{
319 // min or max the circular area around basex, basey 322 // min or max the circular area around basex, basey
320 player *pl = op->contr;
321
322 dx += LOS_X0; 323 dx += LOS_X0;
323 dy += LOS_Y0; 324 dy += LOS_Y0;
324 325
325 int hx = op->contr->ns->mapx / 2; 326 int hx = pl->ns->mapx / 2;
326 int hy = op->contr->ns->mapy / 2; 327 int hy = pl->ns->mapy / 2;
327 328
328 int ax0 = max (LOS_X0 - hx, dx - light); 329 int ax0 = max (LOS_X0 - hx, dx - light);
329 int ay0 = max (LOS_Y0 - hy, dy - light); 330 int ay0 = max (LOS_Y0 - hy, dy - light);
330 int ax1 = min (dx + light, LOS_X0 + hx); 331 int ax1 = min (dx + light, LOS_X0 + hx);
331 int ay1 = min (dy + light, LOS_Y0 + hy); 332 int ay1 = min (dy + light, LOS_Y0 + hy);
… …
338 339
339/* add light, by finding all (non-null) nearby light sources, then 340/* add light, by finding all (non-null) nearby light sources, then
340 * mark those squares specially. 341 * mark those squares specially.
341 */ 342 */
342static void 343static void
343apply_lights (object *op) 344apply_lights (player *pl)
344{ 345{
345 int darklevel, mflags, light, x1, y1; 346 object *op = pl->observe;
346 maptile *m = op->map; 347 int darklevel = op->map->darklevel ();
347 sint16 nx, ny;
348 348
349 darklevel = m->darkness;
350
351 /* If the player can see in the dark, lower the darklevel for him */
352 if (QUERY_FLAG (op, FLAG_SEE_IN_DARK))
353 darklevel -= LOS_MAX / 2;
354
355 /* Do a sanity check. If not valid, some code below may do odd
356 * things.
357 */
358 if (darklevel > MAX_DARKNESS)
359 {
360 LOG (llevError, "Map darkness for %s on %s is too high (%d)\n", &op->name, &op->map->path, darklevel);
361 darklevel = MAX_DARKNESS;
362 }
363
364 int half_x = op->contr->ns->mapx / 2; 349 int half_x = pl->ns->mapx / 2;
365 int half_y = op->contr->ns->mapy / 2; 350 int half_y = pl->ns->mapy / 2;
366
367 int min_x = op->x - half_x - MAX_LIGHT_RADIUS;
368 int min_y = op->y - half_y - MAX_LIGHT_RADIUS;
369 int max_x = op->x + half_x + MAX_LIGHT_RADIUS;
370 int max_y = op->y + half_y + MAX_LIGHT_RADIUS;
371 351
372 int pass2 = 0; // negative lights have an extra pass 352 int pass2 = 0; // negative lights have an extra pass
373 353
354 maprect *rects = pl->observe->map->split_to_tiles (
355 pl->observe->x - half_x - MAX_LIGHT_RADIUS,
356 pl->observe->y - half_y - MAX_LIGHT_RADIUS,
357 pl->observe->x + half_x + MAX_LIGHT_RADIUS + 1,
358 pl->observe->y + half_y + MAX_LIGHT_RADIUS + 1
359 );
360
374 if (darklevel < 1) 361 if (!darklevel)
375 pass2 = 1; 362 pass2 = 1;
376 else 363 else
377 { 364 {
378 /* first, make everything totally dark */ 365 /* first, make everything totally dark */
379 for (int dx = -half_x; dx <= half_x; dx++) 366 for (int dx = -half_x; dx <= half_x; dx++)
380 for (int dy = -half_x; dy <= half_y; dy++) 367 for (int dy = -half_x; dy <= half_y; dy++)
381 if (op->contr->los[dx + LOS_X0][dy + LOS_Y0] != LOS_BLOCKED)
382 op->contr->los[dx + LOS_X0][dy + LOS_Y0] = LOS_MAX; 368 max_it (pl->los[dx + LOS_X0][dy + LOS_Y0], LOS_MAX);
383 369
384 /* 370 /*
385 * Only process the area of interest. 371 * Only process the area of interest.
386 * the basex, basey values represent the position in the op->contr->los 372 * the basex, basey values represent the position in the op->contr->los
387 * array. Its easier to just increment them here (and start with the right 373 * array. Its easier to just increment them here (and start with the right
388 * value) than to recalculate them down below. 374 * value) than to recalculate them down below.
389 */ 375 */
390 for (int x = min_x; x <= max_x; x++) 376 for (maprect *r = rects; r->m; ++r)
391 for (int y = min_y; y <= max_y; y++) 377 rect_mapwalk (r, 0, 0)
392 { 378 {
393 maptile *m = op->map;
394 sint16 nx = x;
395 sint16 ny = y;
396
397 if (!xy_normalise (m, nx, ny))
398 continue;
399
400 mapspace &ms = m->at (nx, ny); 379 mapspace &ms = m->at (nx, ny);
401 ms.update (); 380 ms.update ();
402 sint8 light = ms.light; 381 sint8 light = ms.light;
403 382
404 if (expect_false (light)) 383 if (expect_false (light))
405 if (light < 0) 384 if (light < 0)
406 pass2 = 1; 385 pass2 = 1;
407 else 386 else
408 apply_light<los_brighten> (op, x - op->x, y - op->y, light, light_atten [light + MAX_LIGHT_RADIUS]); 387 apply_light<los_brighten> (pl, dx - pl->observe->x, dy - pl->observe->y, light, light_atten [light + MAX_LIGHT_RADIUS]);
409 } 388 }
410 389
411 /* grant some vision to the player, based on the darklevel */ 390 /* grant some vision to the player, based on the darklevel */
412 { 391 {
413 int light = clamp (MAX_DARKNESS - darklevel, 0, MAX_DARKNESS); 392 int light = clamp (MAX_DARKNESS - darklevel, 0, MAX_DARKNESS);
414 393
394 /* If the player can see in the dark, lower the darklevel for him */
395 if (op->flag [FLAG_SEE_IN_DARK])
396 light += SEE_IN_DARK_RADIUS;
397
415 apply_light<los_brighten> (op, 0, 0, light, vision_atten [light]); 398 apply_light<los_brighten> (pl, 0, 0, light, vision_atten [light]);
416 } 399 }
417 } 400 }
418 401
419 // possibly do 2nd pass for rare negative glow radii 402 // possibly do 2nd pass for rare negative glow radii
420 // for effect, those are always considered to be stronger than anything else 403 // for effect, those are always considered to be stronger than anything else
421 // but they can't darken a place completely 404 // but they can't darken a place completely
422 if (pass2) 405 if (pass2)
423 for (int x = min_x; x <= max_x; x++) 406 for (maprect *r = rects; r->m; ++r)
424 for (int y = min_y; y <= max_y; y++) 407 rect_mapwalk (r, 0, 0)
425 { 408 {
426 maptile *m = op->map;
427 sint16 nx = x;
428 sint16 ny = y;
429
430 if (!xy_normalise (m, nx, ny))
431 continue;
432
433 mapspace &ms = m->at (nx, ny); 409 mapspace &ms = m->at (nx, ny);
434 ms.update (); 410 ms.update ();
435 sint8 light = ms.light; 411 sint8 light = ms.light;
436 412
437 if (expect_false (light < 0)) 413 if (expect_false (light < 0))
438 apply_light<los_darken> (op, x - op->x, y - op->y, -light, light_atten [light + MAX_LIGHT_RADIUS]); 414 apply_light<los_darken> (pl, dx - pl->observe->x, dy - pl->observe->y, -light, light_atten [light + MAX_LIGHT_RADIUS]);
439 } 415 }
440} 416}
441 417
442/* blinded_sight() - sets all viewable squares to blocked except 418/* blinded_sight() - sets all viewable squares to blocked except
443 * for the one the central one that the player occupies. A little 419 * 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 420 * odd that you can see yourself (and what your standing on), but
445 * really need for any reasonable game play. 421 * really need for any reasonable game play.
446 */ 422 */
447static void 423static void
448blinded_sight (object *op) 424blinded_sight (player *pl)
449{ 425{
450 op->contr->los[LOS_X0][LOS_Y0] = 1; 426 pl->los[LOS_X0][LOS_Y0] = 1;
451} 427}
452 428
453/* 429/*
454 * update_los() recalculates the array which specifies what is 430 * update_los() recalculates the array which specifies what is
455 * visible for the given player-object. 431 * visible for the given player-object.
456 */ 432 */
457void 433void
458update_los (object *op) 434player::update_los ()
459{ 435{
460 if (QUERY_FLAG (op, FLAG_REMOVED)) 436 if (ob->flag [FLAG_REMOVED])//D really needed?
461 return; 437 return;
462 438
463 op->contr->clear_los (); 439 if (ob->flag [FLAG_WIZLOOK])
464 440 clear_los (0);
465 if (QUERY_FLAG (op, FLAG_WIZ) /* ||XRAYS(op) */ )
466 memset (op->contr->los, 0, sizeof (op->contr->los));
467 else if (QUERY_FLAG (op, FLAG_BLIND)) /* player is blind */ 441 else if (observe->flag [FLAG_BLIND]) /* player is blind */
442 {
443 clear_los ();
468 blinded_sight (op); 444 blinded_sight (this);
445 }
469 else 446 else
470 { 447 {
471 do_los (op); 448 clear_los ();
449 calculate_los (this);
472 apply_lights (op); 450 apply_lights (this);
473 } 451 }
474 452
475 if (QUERY_FLAG (op, FLAG_XRAYS)) 453 if (observe->flag [FLAG_XRAYS])
476 for (int dx = -2; dx <= 2; dx++) 454 for (int dx = -2; dx <= 2; dx++)
477 for (int dy = -2; dy <= 2; dy++) 455 for (int dy = -2; dy <= 2; dy++)
478 op->contr->los[dx + LOS_X0][dy + LOS_X0] = 0; 456 min_it (los[dx + LOS_X0][dy + LOS_Y0], 1);
479} 457}
480 458
481/* update all_map_los is like update_all_los below, 459/* update all_map_los is like update_all_los below,
482 * but updates everyone on the map, no matter where they 460 * but updates everyone on the map, no matter where they
483 * are. This generally should not be used, as a per 461 * are. This generally should not be used, as a per
… …
490 * change_map_light function 468 * change_map_light function
491 */ 469 */
492void 470void
493update_all_map_los (maptile *map) 471update_all_map_los (maptile *map)
494{ 472{
495 for_all_players (pl) 473 for_all_players_on_map (pl, map)
496 if (pl->ob && pl->ob->map == map)
497 pl->do_los = 1; 474 pl->do_los = 1;
498} 475}
499 476
500/* 477/*
501 * This function makes sure that update_los() will be called for all 478 * This function makes sure that update_los() will be called for all
502 * players on the given map within the next frame. 479 * players on the given map within the next frame.
… …
510 * map is the map that changed, x and y are the coordinates. 487 * map is the map that changed, x and y are the coordinates.
511 */ 488 */
512void 489void
513update_all_los (const maptile *map, int x, int y) 490update_all_los (const maptile *map, int x, int y)
514{ 491{
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 ();
497
515 for_all_players (pl) 498 for_all_players (pl)
516 { 499 {
517 /* Player should not have a null map, but do this 500 /* Player should not have a null map, but do this
518 * check as a safety 501 * check as a safety
519 */ 502 */
… …
528 * player can't be on another map that may be closer, 511 * player can't be on another map that may be closer,
529 * so by setting it up this way, we trim processing 512 * so by setting it up this way, we trim processing
530 * some. 513 * some.
531 */ 514 */
532 if (pl->ob->map == map) 515 if (pl->ob->map == map)
533 {
534 if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - 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))
535 pl->do_los = 1; 517 pl->do_los = 1;
536 }
537 518
538 /* Now we check to see if player is on adjacent 519 /* Now we check to see if player is on adjacent
539 * maps to the one that changed and also within 520 * maps to the one that changed and also within
540 * view. The tile_maps[] could be null, but in that 521 * view. The tile_maps[] could be null, but in that
541 * case it should never match the pl->ob->map, so 522 * case it should never match the pl->ob->map, so
… …
571 pl->do_los = 1; 552 pl->do_los = 1;
572 } 553 }
573 } 554 }
574} 555}
575 556
557static 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 */
559 { 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 },
560 { 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 },
561 { 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 },
562 { 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 },
563 { 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 }
564};
565
566/*
567 * Tell players the time and compute the darkness level for all maps in the game.
568 * MUST be called exactly once per hour.
569 */
570void
571maptile::adjust_daylight ()
572{
573 timeofday_t tod;
574
575 get_tod (&tod);
576
577 // log the time to log-1 every hour, and to chat every day
578 {
579 char todbuf[512];
580
581 format_tod (todbuf, sizeof (todbuf), &tod);
582
583 for_all_players (pl)
584 pl->ns->send_msg (NDI_GREY, tod.hour == 15 ? CHAT_CHANNEL : LOG_CHANNEL, todbuf);
585 }
586
587 /* If the light level isn't changing, no reason to do all
588 * the work below.
589 */
590 sint8 new_darkness = season_darkness[tod.season][tod.hour];
591
592 if (new_darkness == maptile::outdoor_darkness)
593 return;
594
595 new_draw_info (NDI_GREY | NDI_UNIQUE | NDI_ALL, 1, 0,
596 new_darkness > maptile::outdoor_darkness
597 ? "It becomes darker."
598 : "It becomes brighter.");
599
600 maptile::outdoor_darkness = new_darkness;
601
602 // we simply update the los for all players, which is unnecessarily
603 // costly, but should do for the moment.
604 for_all_players (pl)
605 pl->do_los = 1;
606}
607
576/* 608/*
577 * make_sure_seen: The object is supposed to be visible through walls, thus 609 * make_sure_seen: The object is supposed to be visible through walls, thus
578 * check if any players are nearby, and edit their LOS array. 610 * check if any players are nearby, and edit their LOS array.
579 */ 611 */
580void 612void
… …
582{ 614{
583 for_all_players (pl) 615 for_all_players (pl)
584 if (pl->ob->map == op->map && 616 if (pl->ob->map == op->map &&
585 pl->ob->y - pl->ns->mapy / 2 <= op->y && 617 pl->ob->y - pl->ns->mapy / 2 <= op->y &&
586 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) 618 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)
587 pl->los[op->x - pl->ob->x + LOS_X0][op->y - pl->ob->y + LOS_X0] = 0; 619 pl->los[op->x - pl->ob->x + LOS_X0][op->y - pl->ob->y + LOS_Y0] = 0;
588} 620}
589 621
590/* 622/*
591 * make_sure_not_seen: The object which is supposed to be visible through 623 * make_sure_not_seen: The object which is supposed to be visible through
592 * walls has just been removed from the map, so update the los of any 624 * walls has just been removed from the map, so update the los of any
… …
599 if (pl->ob->map == op->map && 631 if (pl->ob->map == op->map &&
600 pl->ob->y - pl->ns->mapy / 2 <= op->y && 632 pl->ob->y - pl->ns->mapy / 2 <= op->y &&
601 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) 633 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)
602 pl->do_los = 1; 634 pl->do_los = 1;
603} 635}
636

Diff Legend

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