1 |
/* |
2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
* |
4 |
* Copyright (©) 2005,2006,2007,2008 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 |
* |
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 |
10 |
* the Free Software Foundation, either version 3 of the License, or |
11 |
* (at your option) any later version. |
12 |
* |
13 |
* This program is distributed in the hope that it will be useful, |
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
* GNU General Public License for more details. |
17 |
* |
18 |
* You should have received a copy of the GNU General Public License |
19 |
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 |
* |
21 |
* The authors can be reached via e-mail to <support@deliantra.net> |
22 |
*/ |
23 |
|
24 |
#include <global.h> |
25 |
#include <cmath> |
26 |
|
27 |
// los flags |
28 |
enum { |
29 |
FLG_XI = 0x01, // we have an x-parent |
30 |
FLG_YI = 0x02, // we have an y-parent |
31 |
FLG_BLOCKED = 0x04, // this space blocks the view |
32 |
FLG_QUEUED = 0x80 // already queued in queue, or border |
33 |
}; |
34 |
|
35 |
struct los_info |
36 |
{ |
37 |
uint8 flags; // FLG_xxx |
38 |
uint8 culled; // culled from "tree" |
39 |
uint8 visible; |
40 |
uint8 pad0; |
41 |
|
42 |
sint8 xo, yo; // obscure angle |
43 |
sint8 xe, ye; // angle deviation |
44 |
}; |
45 |
|
46 |
// temporary storage for the los algorithm, |
47 |
// one los_info for each lightable map space |
48 |
static los_info los[MAP_CLIENT_X][MAP_CLIENT_Y]; |
49 |
|
50 |
struct point |
51 |
{ |
52 |
sint8 x, y; |
53 |
}; |
54 |
|
55 |
// minimum size, but must be a power of two |
56 |
#define QUEUE_LENGTH ((MAP_CLIENT_X + MAP_CLIENT_Y) * 2) |
57 |
|
58 |
// a queue of spaces to calculate |
59 |
static point queue [QUEUE_LENGTH]; |
60 |
static int q1, q2; // queue start, end |
61 |
|
62 |
/* |
63 |
* Clears/initialises the los-array associated to the player |
64 |
* controlling the object. |
65 |
*/ |
66 |
void |
67 |
player::clear_los (sint8 value) |
68 |
{ |
69 |
memset (los, value, sizeof (los)); |
70 |
} |
71 |
|
72 |
// enqueue a single mapspace, but only if it hasn't |
73 |
// been enqueued yet. |
74 |
static void |
75 |
enqueue (sint8 dx, sint8 dy, uint8 flags = 0) |
76 |
{ |
77 |
sint8 x = LOS_X0 + dx; |
78 |
sint8 y = LOS_Y0 + dy; |
79 |
|
80 |
los_info &l = los[x][y]; |
81 |
|
82 |
l.flags |= flags; |
83 |
|
84 |
if (l.flags & FLG_QUEUED) |
85 |
return; |
86 |
|
87 |
l.flags |= FLG_QUEUED; |
88 |
|
89 |
queue[q1].x = dx; |
90 |
queue[q1].y = dy; |
91 |
|
92 |
q1 = (q1 + 1) & (QUEUE_LENGTH - 1); |
93 |
} |
94 |
|
95 |
// run the los algorithm |
96 |
// this is a variant of a spiral los algorithm taken from |
97 |
// http://www.geocities.com/temerra/los_rays.html |
98 |
// which has been simplified and changed considerably, but |
99 |
// still is basically the same algorithm. |
100 |
static void |
101 |
calculate_los (player *pl) |
102 |
{ |
103 |
{ |
104 |
// we keep one line for ourselves, for the border flag |
105 |
// so the client area is actually MAP_CLIENT_(X|Y) - 2 |
106 |
int half_x = min (LOS_X0 - 1, pl->ns->mapx / 2); |
107 |
int half_y = min (LOS_Y0 - 1, pl->ns->mapy / 2); |
108 |
|
109 |
// create borders, the corners are not touched |
110 |
for (int dx = -half_x; dx <= half_x; ++dx) |
111 |
los [dx + LOS_X0][LOS_Y0 - (half_y + 1)].flags = |
112 |
los [dx + LOS_X0][LOS_Y0 + (half_y + 1)].flags = FLG_QUEUED; |
113 |
|
114 |
for (int dy = -half_y; dy <= half_y; ++dy) |
115 |
los [LOS_X0 - (half_x + 1)][dy + LOS_Y0].flags = |
116 |
los [LOS_X0 + (half_x + 1)][dy + LOS_Y0].flags = FLG_QUEUED; |
117 |
|
118 |
// now reset the los area and also add blocked flags |
119 |
// which supposedly is faster than doing it inside the |
120 |
// spiral path algorithm below, except when very little |
121 |
// area is visible, in which case it is slower, evening |
122 |
// out los calculation times between large and small los maps. |
123 |
// apply_lights also iterates over this area, maybe these |
124 |
// two passes could be combined somehow. |
125 |
rectangular_mapspace_iterate_begin (pl->observe, -half_x, half_x, -half_y, half_y) |
126 |
los_info &l = los [LOS_X0 + dx][LOS_Y0 + dy]; |
127 |
l.flags = m && m->at (nx, ny).flags () & P_BLOCKSVIEW ? FLG_BLOCKED : 0; |
128 |
rectangular_mapspace_iterate_end |
129 |
} |
130 |
|
131 |
q1 = 0; q2 = 0; // initialise queue, not strictly required |
132 |
enqueue (0, 0); // enqueue center |
133 |
|
134 |
// treat the origin specially |
135 |
los[LOS_X0][LOS_Y0].visible = 1; |
136 |
pl->los[LOS_X0][LOS_Y0] = 0; |
137 |
|
138 |
// loop over all enqueued points until the queue is empty |
139 |
// the order in which this is done ensures that we |
140 |
// never touch a mapspace whose input spaces we haven't checked |
141 |
// yet. |
142 |
while (q1 != q2) |
143 |
{ |
144 |
sint8 dx = queue[q2].x; |
145 |
sint8 dy = queue[q2].y; |
146 |
|
147 |
q2 = (q2 + 1) & (QUEUE_LENGTH - 1); |
148 |
|
149 |
sint8 x = LOS_X0 + dx; |
150 |
sint8 y = LOS_Y0 + dy; |
151 |
|
152 |
los_info &l = los[x][y]; |
153 |
|
154 |
if (expect_true (l.flags & (FLG_XI | FLG_YI))) |
155 |
{ |
156 |
l.culled = 1; |
157 |
l.xo = l.yo = l.xe = l.ye = 0; |
158 |
|
159 |
// check contributing spaces, first horizontal |
160 |
if (expect_true (l.flags & FLG_XI)) |
161 |
{ |
162 |
los_info *xi = &los[x - sign (dx)][y]; |
163 |
|
164 |
// don't cull unless obscured |
165 |
l.culled &= !xi->visible; |
166 |
|
167 |
/* merge input space */ |
168 |
if (expect_false (xi->xo || xi->yo)) |
169 |
{ |
170 |
// The X input can provide two main pieces of information: |
171 |
// 1. Progressive X obscurity. |
172 |
// 2. Recessive Y obscurity. |
173 |
|
174 |
// Progressive X obscurity, favouring recessive input angle |
175 |
if (xi->xe > 0 && l.xo == 0) |
176 |
{ |
177 |
l.xe = xi->xe - xi->yo; |
178 |
l.ye = xi->ye + xi->yo; |
179 |
l.xo = xi->xo; |
180 |
l.yo = xi->yo; |
181 |
} |
182 |
|
183 |
// Recessive Y obscurity |
184 |
if (xi->ye <= 0 && xi->yo > 0 && xi->xe > 0) |
185 |
{ |
186 |
l.ye = xi->yo + xi->ye; |
187 |
l.xe = xi->xe - xi->yo; |
188 |
l.xo = xi->xo; |
189 |
l.yo = xi->yo; |
190 |
} |
191 |
} |
192 |
} |
193 |
|
194 |
// check contributing spaces, last vertical, identical structure |
195 |
if (expect_true (l.flags & FLG_YI)) |
196 |
{ |
197 |
los_info *yi = &los[x][y - sign (dy)]; |
198 |
|
199 |
// don't cull unless obscured |
200 |
l.culled &= !yi->visible; |
201 |
|
202 |
/* merge input space */ |
203 |
if (expect_false (yi->yo || yi->xo)) |
204 |
{ |
205 |
// The Y input can provide two main pieces of information: |
206 |
// 1. Progressive Y obscurity. |
207 |
// 2. Recessive X obscurity. |
208 |
|
209 |
// Progressive Y obscurity, favouring recessive input angle |
210 |
if (yi->ye > 0 && l.yo == 0) |
211 |
{ |
212 |
l.ye = yi->ye - yi->xo; |
213 |
l.xe = yi->xe + yi->xo; |
214 |
l.yo = yi->yo; |
215 |
l.xo = yi->xo; |
216 |
} |
217 |
|
218 |
// Recessive X obscurity |
219 |
if (yi->xe <= 0 && yi->xo > 0 && yi->ye > 0) |
220 |
{ |
221 |
l.xe = yi->xo + yi->xe; |
222 |
l.ye = yi->ye - yi->xo; |
223 |
l.yo = yi->yo; |
224 |
l.xo = yi->xo; |
225 |
} |
226 |
} |
227 |
} |
228 |
|
229 |
if (l.flags & FLG_BLOCKED) |
230 |
{ |
231 |
l.xo = l.xe = abs (dx); |
232 |
l.yo = l.ye = abs (dy); |
233 |
|
234 |
// we obscure dependents, but might be visible |
235 |
// copy the los from the square towards the player, |
236 |
// so outward diagonal corners are lit. |
237 |
pl->los[x][y] = los[x - sign0 (dx)][y - sign0 (dy)].visible ? 0 : LOS_BLOCKED; |
238 |
|
239 |
l.visible = false; |
240 |
} |
241 |
else |
242 |
{ |
243 |
// we are not blocked, so calculate visibility, by checking |
244 |
// whether we are inside or outside the shadow |
245 |
l.visible = (l.xe <= 0 || l.xe > l.xo) |
246 |
&& (l.ye <= 0 || l.ye > l.yo); |
247 |
|
248 |
pl->los[x][y] = l.culled ? LOS_BLOCKED |
249 |
: l.visible ? 0 |
250 |
: 3; |
251 |
} |
252 |
|
253 |
} |
254 |
|
255 |
// Expands by the unit length in each component's current direction. |
256 |
// If a component has no direction, then it is expanded in both of its |
257 |
// positive and negative directions. |
258 |
if (!l.culled) |
259 |
{ |
260 |
if (dx >= 0) enqueue (dx + 1, dy, FLG_XI); |
261 |
if (dx <= 0) enqueue (dx - 1, dy, FLG_XI); |
262 |
if (dy >= 0) enqueue (dx, dy + 1, FLG_YI); |
263 |
if (dy <= 0) enqueue (dx, dy - 1, FLG_YI); |
264 |
} |
265 |
} |
266 |
} |
267 |
|
268 |
/* returns true if op carries one or more lights |
269 |
* This is a trivial function now days, but it used to |
270 |
* be a bit longer. Probably better for callers to just |
271 |
* check the op->glow_radius instead of calling this. |
272 |
*/ |
273 |
int |
274 |
has_carried_lights (const object *op) |
275 |
{ |
276 |
/* op may glow! */ |
277 |
if (op->glow_radius > 0) |
278 |
return 1; |
279 |
|
280 |
return 0; |
281 |
} |
282 |
|
283 |
/* radius, distance => lightness adjust */ |
284 |
static sint8 light_atten[MAX_LIGHT_RADIUS * 2 + 1][MAX_LIGHT_RADIUS * 3 / 2 + 1]; |
285 |
static sint8 vision_atten[MAX_DARKNESS + 1][MAX_DARKNESS * 3 / 2 + 1]; |
286 |
|
287 |
static struct los_init |
288 |
{ |
289 |
los_init () |
290 |
{ |
291 |
assert (("QUEUE_LENGTH, MAP_CLIENT_X and MAP_CLIENT_Y *must* be powers of two", |
292 |
!(QUEUE_LENGTH & (QUEUE_LENGTH - 1)))); |
293 |
|
294 |
/* for lights */ |
295 |
for (int radius = -MAX_LIGHT_RADIUS; radius <= MAX_LIGHT_RADIUS; ++radius) |
296 |
for (int distance = 0; distance <= MAX_LIGHT_RADIUS * 3 / 2; ++distance) |
297 |
{ |
298 |
// max intensity |
299 |
int intensity = min (LOS_MAX, abs (radius) + 1); |
300 |
|
301 |
// actual intensity |
302 |
intensity = max (0, lerp_rd (distance, 0, abs (radius) + 1, intensity, 0)); |
303 |
|
304 |
light_atten [radius + MAX_LIGHT_RADIUS][distance] = radius < 0 |
305 |
? min (3, intensity) |
306 |
: LOS_MAX - intensity; |
307 |
} |
308 |
|
309 |
/* for general vision */ |
310 |
for (int radius = 0; radius <= MAX_DARKNESS; ++radius) |
311 |
for (int distance = 0; distance <= MAX_DARKNESS * 3 / 2; ++distance) |
312 |
{ |
313 |
vision_atten [radius][distance] = distance <= radius ? 3 : 4; |
314 |
} |
315 |
} |
316 |
} los_init; |
317 |
|
318 |
sint8 |
319 |
los_brighten (sint8 b, sint8 l) |
320 |
{ |
321 |
return b == LOS_BLOCKED ? b : min (b, l); |
322 |
} |
323 |
|
324 |
sint8 |
325 |
los_darken (sint8 b, sint8 l) |
326 |
{ |
327 |
return max (b, l); |
328 |
} |
329 |
|
330 |
template<sint8 change_it (sint8, sint8)> |
331 |
static void |
332 |
apply_light (player *pl, int dx, int dy, int light, const sint8 *atten_table) |
333 |
{ |
334 |
// min or max the circular area around basex, basey |
335 |
dx += LOS_X0; |
336 |
dy += LOS_Y0; |
337 |
|
338 |
int hx = pl->ns->mapx / 2; |
339 |
int hy = pl->ns->mapy / 2; |
340 |
|
341 |
int ax0 = max (LOS_X0 - hx, dx - light); |
342 |
int ay0 = max (LOS_Y0 - hy, dy - light); |
343 |
int ax1 = min (dx + light, LOS_X0 + hx); |
344 |
int ay1 = min (dy + light, LOS_Y0 + hy); |
345 |
|
346 |
for (int ax = ax0; ax <= ax1; ax++) |
347 |
for (int ay = ay0; ay <= ay1; ay++) |
348 |
pl->los[ax][ay] = |
349 |
change_it (pl->los[ax][ay], atten_table [idistance (ax - dx, ay - dy)]); |
350 |
} |
351 |
|
352 |
/* add light, by finding all (non-null) nearby light sources, then |
353 |
* mark those squares specially. |
354 |
*/ |
355 |
static void |
356 |
apply_lights (player *pl) |
357 |
{ |
358 |
object *op = pl->observe; |
359 |
int darklevel = op->map->darklevel (); |
360 |
|
361 |
/* If the player can see in the dark, lower the darklevel for him */ |
362 |
if (op->flag [FLAG_SEE_IN_DARK]) |
363 |
darklevel = max (0, darklevel - 2); |
364 |
|
365 |
int half_x = pl->ns->mapx / 2; |
366 |
int half_y = pl->ns->mapy / 2; |
367 |
|
368 |
int pass2 = 0; // negative lights have an extra pass |
369 |
|
370 |
if (!darklevel) |
371 |
pass2 = 1; |
372 |
else |
373 |
{ |
374 |
/* first, make everything totally dark */ |
375 |
for (int dx = -half_x; dx <= half_x; dx++) |
376 |
for (int dy = -half_x; dy <= half_y; dy++) |
377 |
max_it (pl->los[dx + LOS_X0][dy + LOS_Y0], LOS_MAX); |
378 |
|
379 |
/* |
380 |
* Only process the area of interest. |
381 |
* the basex, basey values represent the position in the op->contr->los |
382 |
* array. Its easier to just increment them here (and start with the right |
383 |
* value) than to recalculate them down below. |
384 |
*/ |
385 |
rectangular_mapspace_iterate_begin (pl->observe, -half_x - MAX_LIGHT_RADIUS, half_x + MAX_LIGHT_RADIUS, -half_y - MAX_LIGHT_RADIUS, half_y + MAX_LIGHT_RADIUS) |
386 |
if (m) |
387 |
{ |
388 |
mapspace &ms = m->at (nx, ny); |
389 |
ms.update (); |
390 |
sint8 light = ms.light; |
391 |
|
392 |
if (expect_false (light)) |
393 |
if (light < 0) |
394 |
pass2 = 1; |
395 |
else |
396 |
apply_light<los_brighten> (pl, dx, dy, light, light_atten [light + MAX_LIGHT_RADIUS]); |
397 |
} |
398 |
rectangular_mapspace_iterate_end |
399 |
|
400 |
/* grant some vision to the player, based on the darklevel */ |
401 |
{ |
402 |
int light = clamp (MAX_DARKNESS - darklevel, 0, MAX_DARKNESS); |
403 |
|
404 |
apply_light<los_brighten> (pl, 0, 0, light, vision_atten [light]); |
405 |
} |
406 |
} |
407 |
|
408 |
// possibly do 2nd pass for rare negative glow radii |
409 |
// for effect, those are always considered to be stronger than anything else |
410 |
// but they can't darken a place completely |
411 |
if (pass2) |
412 |
rectangular_mapspace_iterate_begin (pl->observe, -half_x - MAX_LIGHT_RADIUS, half_x + MAX_LIGHT_RADIUS, -half_y - MAX_LIGHT_RADIUS, half_y + MAX_LIGHT_RADIUS) |
413 |
if (m) |
414 |
{ |
415 |
mapspace &ms = m->at (nx, ny); |
416 |
ms.update (); |
417 |
sint8 light = ms.light; |
418 |
|
419 |
if (expect_false (light < 0)) |
420 |
apply_light<los_darken> (pl, dx, dy, -light, light_atten [light + MAX_LIGHT_RADIUS]); |
421 |
} |
422 |
rectangular_mapspace_iterate_end |
423 |
} |
424 |
|
425 |
/* blinded_sight() - sets all viewable squares to blocked except |
426 |
* for the one the central one that the player occupies. A little |
427 |
* odd that you can see yourself (and what your standing on), but |
428 |
* really need for any reasonable game play. |
429 |
*/ |
430 |
static void |
431 |
blinded_sight (player *pl) |
432 |
{ |
433 |
pl->los[LOS_X0][LOS_Y0] = 1; |
434 |
} |
435 |
|
436 |
/* |
437 |
* update_los() recalculates the array which specifies what is |
438 |
* visible for the given player-object. |
439 |
*/ |
440 |
void |
441 |
player::update_los () |
442 |
{ |
443 |
if (ob->flag [FLAG_REMOVED])//D really needed? |
444 |
return; |
445 |
|
446 |
if (ob->flag [FLAG_WIZLOOK]) |
447 |
clear_los (0); |
448 |
else if (observe->flag [FLAG_BLIND]) /* player is blind */ |
449 |
{ |
450 |
clear_los (); |
451 |
blinded_sight (this); |
452 |
} |
453 |
else |
454 |
{ |
455 |
clear_los (); |
456 |
calculate_los (this); |
457 |
apply_lights (this); |
458 |
} |
459 |
|
460 |
if (observe->flag [FLAG_XRAYS]) |
461 |
for (int dx = -2; dx <= 2; dx++) |
462 |
for (int dy = -2; dy <= 2; dy++) |
463 |
min_it (los[dx + LOS_X0][dy + LOS_Y0], 1); |
464 |
} |
465 |
|
466 |
/* update all_map_los is like update_all_los below, |
467 |
* but updates everyone on the map, no matter where they |
468 |
* are. This generally should not be used, as a per |
469 |
* specific map change doesn't make much sense when tiling |
470 |
* is considered (lowering darkness would certainly be a |
471 |
* strange effect if done on a tile map, as it makes |
472 |
* the distinction between maps much more obvious to the |
473 |
* players, which is should not be. |
474 |
* Currently, this function is called from the |
475 |
* change_map_light function |
476 |
*/ |
477 |
void |
478 |
update_all_map_los (maptile *map) |
479 |
{ |
480 |
for_all_players_on_map (pl, map) |
481 |
pl->do_los = 1; |
482 |
} |
483 |
|
484 |
/* |
485 |
* This function makes sure that update_los() will be called for all |
486 |
* players on the given map within the next frame. |
487 |
* It is triggered by removal or inserting of objects which blocks |
488 |
* the sight in the map. |
489 |
* Modified by MSW 2001-07-12 to take a coordinate of the changed |
490 |
* position, and to also take map tiling into account. This change |
491 |
* means that just being on the same map is not sufficient - the |
492 |
* space that changes must be withing your viewable area. |
493 |
* |
494 |
* map is the map that changed, x and y are the coordinates. |
495 |
*/ |
496 |
void |
497 |
update_all_los (const maptile *map, int x, int y) |
498 |
{ |
499 |
map->at (x, y).invalidate (); |
500 |
|
501 |
for_all_players (pl) |
502 |
{ |
503 |
/* Player should not have a null map, but do this |
504 |
* check as a safety |
505 |
*/ |
506 |
if (!pl->ob || !pl->ob->map || !pl->ns) |
507 |
continue; |
508 |
|
509 |
/* Same map is simple case - see if pl is close enough. |
510 |
* Note in all cases, we did the check for same map first, |
511 |
* and then see if the player is close enough and update |
512 |
* los if that is the case. If the player is on the |
513 |
* corresponding map, but not close enough, then the |
514 |
* player can't be on another map that may be closer, |
515 |
* so by setting it up this way, we trim processing |
516 |
* some. |
517 |
*/ |
518 |
if (pl->ob->map == map) |
519 |
{ |
520 |
if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) |
521 |
pl->do_los = 1; |
522 |
} |
523 |
|
524 |
/* Now we check to see if player is on adjacent |
525 |
* maps to the one that changed and also within |
526 |
* view. The tile_maps[] could be null, but in that |
527 |
* case it should never match the pl->ob->map, so |
528 |
* we want ever try to dereference any of the data in it. |
529 |
* |
530 |
* The logic for 0 and 3 is to see how far the player is |
531 |
* from the edge of the map (height/width) - pl->ob->(x,y) |
532 |
* and to add current position on this map - that gives a |
533 |
* distance. |
534 |
* For 1 and 2, we check to see how far the given |
535 |
* coordinate (x,y) is from the corresponding edge, |
536 |
* and then add the players location, which gives |
537 |
* a distance. |
538 |
*/ |
539 |
else if (pl->ob->map == map->tile_map[0]) |
540 |
{ |
541 |
if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (y + map->tile_map[0]->height - pl->ob->y) <= pl->ns->mapy / 2)) |
542 |
pl->do_los = 1; |
543 |
} |
544 |
else if (pl->ob->map == map->tile_map[2]) |
545 |
{ |
546 |
if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y + map->height - y) <= pl->ns->mapy / 2)) |
547 |
pl->do_los = 1; |
548 |
} |
549 |
else if (pl->ob->map == map->tile_map[1]) |
550 |
{ |
551 |
if ((abs (pl->ob->x + map->width - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) |
552 |
pl->do_los = 1; |
553 |
} |
554 |
else if (pl->ob->map == map->tile_map[3]) |
555 |
{ |
556 |
if ((abs (x + map->tile_map[3]->width - pl->ob->x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) |
557 |
pl->do_los = 1; |
558 |
} |
559 |
} |
560 |
} |
561 |
|
562 |
static const int season_darkness[5][HOURS_PER_DAY] = { |
563 |
/*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 */ |
564 |
{ 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 }, |
565 |
{ 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 }, |
566 |
{ 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 }, |
567 |
{ 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 }, |
568 |
{ 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 } |
569 |
}; |
570 |
|
571 |
/* |
572 |
* Tell players the time and compute the darkness level for all maps in the game. |
573 |
* MUST be called exactly once per hour. |
574 |
*/ |
575 |
void |
576 |
maptile::adjust_daylight () |
577 |
{ |
578 |
timeofday_t tod; |
579 |
|
580 |
get_tod (&tod); |
581 |
|
582 |
// log the time to log-1 every hour, and to chat every day |
583 |
{ |
584 |
char todbuf[512]; |
585 |
|
586 |
format_tod (todbuf, sizeof (todbuf), &tod); |
587 |
|
588 |
for_all_players (pl) |
589 |
pl->ns->send_msg (NDI_GREY, tod.hour == 15 ? CHAT_CHANNEL : LOG_CHANNEL, todbuf); |
590 |
} |
591 |
|
592 |
/* If the light level isn't changing, no reason to do all |
593 |
* the work below. |
594 |
*/ |
595 |
sint8 new_darkness = season_darkness[tod.season][tod.hour]; |
596 |
|
597 |
if (new_darkness == maptile::outdoor_darkness) |
598 |
return; |
599 |
|
600 |
new_draw_info (NDI_GREY | NDI_UNIQUE | NDI_ALL, 1, 0, |
601 |
new_darkness > maptile::outdoor_darkness |
602 |
? "It becomes darker." |
603 |
: "It becomes brighter."); |
604 |
|
605 |
maptile::outdoor_darkness = new_darkness; |
606 |
|
607 |
// we simply update the los for all players, which is unnecessarily |
608 |
// costly, but should do for the moment. |
609 |
for_all_players (pl) |
610 |
pl->do_los = 1; |
611 |
} |
612 |
|
613 |
/* |
614 |
* make_sure_seen: The object is supposed to be visible through walls, thus |
615 |
* check if any players are nearby, and edit their LOS array. |
616 |
*/ |
617 |
void |
618 |
make_sure_seen (const object *op) |
619 |
{ |
620 |
for_all_players (pl) |
621 |
if (pl->ob->map == op->map && |
622 |
pl->ob->y - pl->ns->mapy / 2 <= op->y && |
623 |
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) |
624 |
pl->los[op->x - pl->ob->x + LOS_X0][op->y - pl->ob->y + LOS_Y0] = 0; |
625 |
} |
626 |
|
627 |
/* |
628 |
* make_sure_not_seen: The object which is supposed to be visible through |
629 |
* walls has just been removed from the map, so update the los of any |
630 |
* players within its range |
631 |
*/ |
632 |
void |
633 |
make_sure_not_seen (const object *op) |
634 |
{ |
635 |
for_all_players (pl) |
636 |
if (pl->ob->map == op->map && |
637 |
pl->ob->y - pl->ns->mapy / 2 <= op->y && |
638 |
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) |
639 |
pl->do_los = 1; |
640 |
} |