1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * 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, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * 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 along |
18 | * You should have received a copy of the GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
|
|
25 | /* Nov 95 - inserted USE_LIGHTING code stuff in here - b.t. */ |
|
|
26 | |
23 | |
27 | #include <global.h> |
24 | #include <global.h> |
28 | #include <funcpoint.h> |
|
|
29 | #include <math.h> |
25 | #include <cmath> |
30 | |
26 | |
31 | /* Distance must be less than this for the object to be blocked. |
27 | #define SEE_IN_DARK_RADIUS 2 |
32 | * An object is 1.0 wide, so if set to 0.5, it means the object |
28 | #define MAX_VISION 10 // maximum visible radius |
33 | * that blocks half the view (0.0 is complete block) will |
|
|
34 | * block view in our tables. |
|
|
35 | * .4 or less lets you see through walls. .5 is about right. |
|
|
36 | */ |
|
|
37 | |
29 | |
38 | #define SPACE_BLOCK 0.5 |
30 | // los flags |
|
|
31 | enum { |
|
|
32 | FLG_XI = 0x01, // we have an x-parent |
|
|
33 | FLG_YI = 0x02, // we have an y-parent |
|
|
34 | FLG_BLOCKED = 0x04, // this space blocks the view |
|
|
35 | FLG_QUEUED = 0x80 // already queued in queue, or border |
|
|
36 | }; |
39 | |
37 | |
40 | typedef struct blstr |
38 | struct los_info |
41 | { |
39 | { |
42 | int x[4], y[4]; |
40 | uint8 flags; // FLG_xxx |
43 | int index; |
41 | uint8 culled; // culled from "tree" |
44 | } blocks; |
42 | uint8 visible; |
|
|
43 | uint8 pad0; |
45 | |
44 | |
46 | // 31/32 == a speed hack |
45 | sint8 xo, yo; // obscure angle |
47 | // we would like to use 32 for speed, but the code loops endlessly |
46 | sint8 xe, ye; // angle deviation |
48 | // then, reason not yet identified, so only make the array use 32, |
47 | }; |
49 | // not the define's. |
|
|
50 | blocks block[MAP_CLIENT_X][MAP_CLIENT_Y == 31 ? 32 : MAP_CLIENT_Y]; |
|
|
51 | |
48 | |
52 | static void expand_lighted_sight (object *op); |
49 | // temporary storage for the los algorithm, |
|
|
50 | // one los_info for each lightable map space |
|
|
51 | static los_info los[MAP_CLIENT_X][MAP_CLIENT_Y]; |
53 | |
52 | |
54 | /* |
53 | struct point |
55 | * Used to initialise the array used by the LOS routines. |
|
|
56 | * What this sets if that x,y blocks the view of bx,by |
|
|
57 | * This then sets up a relation - for example, something |
|
|
58 | * at 5,4 blocks view at 5,3 which blocks view at 5,2 |
|
|
59 | * etc. So when we check 5,4 and find it block, we have |
|
|
60 | * the data to know that 5,3 and 5,2 and 5,1 should also |
|
|
61 | * be blocked. |
|
|
62 | */ |
|
|
63 | |
|
|
64 | static void |
|
|
65 | set_block (int x, int y, int bx, int by) |
|
|
66 | { |
54 | { |
67 | int index = block[x][y].index, i; |
|
|
68 | |
|
|
69 | /* Due to flipping, we may get duplicates - better safe than sorry. |
|
|
70 | */ |
|
|
71 | for (i = 0; i < index; i++) |
|
|
72 | { |
|
|
73 | if (block[x][y].x[i] == bx && block[x][y].y[i] == by) |
|
|
74 | return; |
|
|
75 | } |
|
|
76 | |
|
|
77 | block[x][y].x[index] = bx; |
|
|
78 | block[x][y].y[index] = by; |
|
|
79 | block[x][y].index++; |
|
|
80 | #ifdef LOS_DEBUG |
|
|
81 | LOG (llevDebug, "setblock: added %d %d -> %d %d (%d)\n", x, y, bx, by, block[x][y].index); |
|
|
82 | #endif |
|
|
83 | } |
|
|
84 | |
|
|
85 | /* |
|
|
86 | * initialises the array used by the LOS routines. |
|
|
87 | */ |
|
|
88 | |
|
|
89 | /* since we are only doing the upper left quadrant, only |
|
|
90 | * these spaces could possibly get blocked, since these |
|
|
91 | * are the only ones further out that are still possibly in the |
|
|
92 | * sightline. |
|
|
93 | */ |
|
|
94 | |
|
|
95 | void |
|
|
96 | init_block (void) |
|
|
97 | { |
|
|
98 | int x, y, dx, dy, i; |
|
|
99 | static int block_x[3] = { -1, -1, 0 }, |
|
|
100 | block_y[3] = { -1, 0, -1 }; |
|
|
101 | |
|
|
102 | for (x = 0; x < MAP_CLIENT_X; x++) |
|
|
103 | for (y = 0; y < MAP_CLIENT_Y; y++) |
|
|
104 | block[x][y].index = 0; |
|
|
105 | |
|
|
106 | |
|
|
107 | /* The table should be symmetric, so only do the upper left |
|
|
108 | * quadrant - makes the processing easier. |
|
|
109 | */ |
|
|
110 | for (x = 1; x <= MAP_CLIENT_X / 2; x++) |
|
|
111 | { |
|
|
112 | for (y = 1; y <= MAP_CLIENT_Y / 2; y++) |
|
|
113 | { |
|
|
114 | for (i = 0; i < 3; i++) |
|
|
115 | { |
|
|
116 | dx = x + block_x[i]; |
|
|
117 | dy = y + block_y[i]; |
|
|
118 | |
|
|
119 | /* center space never blocks */ |
|
|
120 | if (x == MAP_CLIENT_X / 2 && y == MAP_CLIENT_Y / 2) |
|
|
121 | continue; |
|
|
122 | |
|
|
123 | /* If its a straight line, its blocked */ |
|
|
124 | if ((dx == x && x == MAP_CLIENT_X / 2) || (dy == y && y == MAP_CLIENT_Y / 2)) |
|
|
125 | { |
|
|
126 | /* For simplicity, we mirror the coordinates to block the other |
|
|
127 | * quadrants. |
|
|
128 | */ |
|
|
129 | set_block (x, y, dx, dy); |
|
|
130 | if (x == MAP_CLIENT_X / 2) |
|
|
131 | set_block (x, MAP_CLIENT_Y - y - 1, dx, MAP_CLIENT_Y - dy - 1); |
|
|
132 | else if (y == MAP_CLIENT_Y / 2) |
|
|
133 | set_block (MAP_CLIENT_X - x - 1, y, MAP_CLIENT_X - dx - 1, dy); |
|
|
134 | } |
|
|
135 | else |
|
|
136 | { |
|
|
137 | float d1, r, s, l; |
|
|
138 | |
|
|
139 | /* We use the algorihm that found out how close the point |
|
|
140 | * (x,y) is to the line from dx,dy to the center of the viewable |
|
|
141 | * area. l is the distance from x,y to the line. |
|
|
142 | * r is more a curiosity - it lets us know what direction (left/right) |
|
|
143 | * the line is off |
|
|
144 | */ |
|
|
145 | |
|
|
146 | d1 = (float) (pow (MAP_CLIENT_X / 2 - dx, 2.f) + pow (MAP_CLIENT_Y / 2 - dy, 2.f)); |
|
|
147 | r = (float) ((dy - y) * (dy - MAP_CLIENT_Y / 2) - (dx - x) * (MAP_CLIENT_X / 2 - dx)) / d1; |
|
|
148 | s = (float) ((dy - y) * (MAP_CLIENT_X / 2 - dx) - (dx - x) * (MAP_CLIENT_Y / 2 - dy)) / d1; |
|
|
149 | l = FABS (sqrt (d1) * s); |
|
|
150 | |
|
|
151 | if (l <= SPACE_BLOCK) |
|
|
152 | { |
|
|
153 | /* For simplicity, we mirror the coordinates to block the other |
|
|
154 | * quadrants. |
|
|
155 | */ |
|
|
156 | set_block (x, y, dx, dy); |
|
|
157 | set_block (MAP_CLIENT_X - x - 1, y, MAP_CLIENT_X - dx - 1, dy); |
|
|
158 | set_block (x, MAP_CLIENT_Y - y - 1, dx, MAP_CLIENT_Y - dy - 1); |
|
|
159 | set_block (MAP_CLIENT_X - x - 1, MAP_CLIENT_Y - y - 1, MAP_CLIENT_X - dx - 1, MAP_CLIENT_Y - dy - 1); |
|
|
160 | } |
|
|
161 | } |
|
|
162 | } |
|
|
163 | } |
|
|
164 | } |
|
|
165 | } |
|
|
166 | |
|
|
167 | /* |
|
|
168 | * Used to initialise the array used by the LOS routines. |
|
|
169 | * x,y are indexes into the blocked[][] array. |
|
|
170 | * This recursively sets the blocked line of sight view. |
|
|
171 | * From the blocked[][] array, we know for example |
|
|
172 | * that if some particular space is blocked, it blocks |
|
|
173 | * the view of the spaces 'behind' it, and those blocked |
|
|
174 | * spaces behind it may block other spaces, etc. |
|
|
175 | * In this way, the chain of visibility is set. |
|
|
176 | */ |
|
|
177 | static void |
|
|
178 | set_wall (object *op, int x, int y) |
|
|
179 | { |
|
|
180 | int i; |
|
|
181 | |
|
|
182 | for (i = 0; i < block[x][y].index; i++) |
|
|
183 | { |
|
|
184 | int dx = block[x][y].x[i], dy = block[x][y].y[i], ax, ay; |
|
|
185 | |
|
|
186 | /* ax, ay are the values as adjusted to be in the |
|
|
187 | * socket look structure. |
|
|
188 | */ |
|
|
189 | ax = dx - (MAP_CLIENT_X - op->contr->ns->mapx) / 2; |
|
|
190 | ay = dy - (MAP_CLIENT_Y - op->contr->ns->mapy) / 2; |
|
|
191 | |
|
|
192 | if (ax < 0 || ax >= op->contr->ns->mapx || ay < 0 || ay >= op->contr->ns->mapy) |
|
|
193 | continue; |
|
|
194 | #if 0 |
|
|
195 | LOG (llevDebug, "blocked %d %d -> %d %d\n", dx, dy, ax, ay); |
|
|
196 | #endif |
|
|
197 | /* we need to adjust to the fact that the socket |
|
|
198 | * code wants the los to start from the 0,0 |
|
|
199 | * and not be relative to middle of los array. |
|
|
200 | */ |
|
|
201 | op->contr->blocked_los[ax][ay] = 100; |
|
|
202 | set_wall (op, dx, dy); |
|
|
203 | } |
|
|
204 | } |
|
|
205 | |
|
|
206 | /* |
|
|
207 | * Used to initialise the array used by the LOS routines. |
|
|
208 | * op is the object, x and y values based on MAP_CLIENT_X and Y. |
|
|
209 | * this is because they index the blocked[][] arrays. |
|
|
210 | */ |
|
|
211 | |
|
|
212 | static void |
|
|
213 | check_wall (object *op, int x, int y) |
|
|
214 | { |
|
|
215 | int ax, ay; |
55 | sint8 x, y; |
|
|
56 | }; |
216 | |
57 | |
217 | if (!block[x][y].index) |
58 | // minimum size, but must be a power of two |
218 | return; |
59 | #define QUEUE_LENGTH ((MAP_CLIENT_X + MAP_CLIENT_Y) * 2) |
219 | |
60 | |
220 | /* ax, ay are coordinates as indexed into the look window */ |
61 | // a queue of spaces to calculate |
221 | ax = x - (MAP_CLIENT_X - op->contr->ns->mapx) / 2; |
62 | static point queue [QUEUE_LENGTH]; |
222 | ay = y - (MAP_CLIENT_Y - op->contr->ns->mapy) / 2; |
63 | static int q1, q2; // queue start, end |
223 | |
|
|
224 | /* If the converted coordinates are outside the viewable |
|
|
225 | * area for the client, return now. |
|
|
226 | */ |
|
|
227 | if (ax < 0 || ay < 0 || ax >= op->contr->ns->mapx || ay >= op->contr->ns->mapy) |
|
|
228 | return; |
|
|
229 | |
|
|
230 | #if 0 |
|
|
231 | LOG (llevDebug, "check_wall, ax,ay=%d, %d x,y = %d, %d blocksview = %d, %d\n", |
|
|
232 | ax, ay, x, y, op->x + x - MAP_CLIENT_X / 2, op->y + y - MAP_CLIENT_Y / 2); |
|
|
233 | #endif |
|
|
234 | |
|
|
235 | /* If this space is already blocked, prune the processing - presumably |
|
|
236 | * whatever has set this space to be blocked has done the work and already |
|
|
237 | * done the dependency chain. |
|
|
238 | */ |
|
|
239 | if (op->contr->blocked_los[ax][ay] == 100) |
|
|
240 | return; |
|
|
241 | |
|
|
242 | |
|
|
243 | if (get_map_flags (op->map, NULL, op->x + x - MAP_CLIENT_X / 2, op->y + y - MAP_CLIENT_Y / 2, NULL, NULL) & (P_BLOCKSVIEW | P_OUT_OF_MAP)) |
|
|
244 | set_wall (op, x, y); |
|
|
245 | } |
|
|
246 | |
64 | |
247 | /* |
65 | /* |
248 | * Clears/initialises the los-array associated to the player |
66 | * Clears/initialises the los-array associated to the player |
249 | * controlling the object. |
67 | * controlling the object. |
250 | */ |
68 | */ |
251 | |
|
|
252 | void |
69 | void |
253 | clear_los (player *pl) |
70 | player::clear_los (sint8 value) |
254 | { |
71 | { |
255 | /* This is safer than using the ns->mapx, mapy because |
72 | memset (los, value, sizeof (los)); |
256 | * 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 |
|
|
258 | * actually going to use |
|
|
259 | */ |
|
|
260 | memset (pl->blocked_los, 0, MAP_CLIENT_X * MAP_CLIENT_Y); |
|
|
261 | } |
73 | } |
262 | |
74 | |
263 | /* |
75 | // enqueue a single mapspace, but only if it hasn't |
264 | * expand_sight goes through the array of what the given player is |
76 | // been enqueued yet. |
265 | * able to see, and expands the visible area a bit, so the player will, |
|
|
266 | * to a certain degree, be able to see into corners. |
|
|
267 | * This is somewhat suboptimal, would be better to improve the formula. |
|
|
268 | */ |
|
|
269 | |
|
|
270 | static void |
77 | static void |
271 | expand_sight (object *op) |
78 | enqueue (sint8 dx, sint8 dy, uint8 flags = 0) |
272 | { |
79 | { |
273 | int i, x, y, dx, dy; |
80 | sint8 x = LOS_X0 + dx; |
|
|
81 | sint8 y = LOS_Y0 + dy; |
274 | |
82 | |
275 | for (x = 1; x < op->contr->ns->mapx - 1; x++) /* loop over inner squares */ |
83 | los_info &l = los[x][y]; |
276 | for (y = 1; y < op->contr->ns->mapy - 1; y++) |
84 | |
|
|
85 | l.flags |= flags; |
|
|
86 | |
|
|
87 | if (l.flags & FLG_QUEUED) |
|
|
88 | return; |
|
|
89 | |
|
|
90 | l.flags |= FLG_QUEUED; |
|
|
91 | |
|
|
92 | queue[q1].x = dx; |
|
|
93 | queue[q1].y = dy; |
|
|
94 | |
|
|
95 | q1 = (q1 + 1) & (QUEUE_LENGTH - 1); |
|
|
96 | } |
|
|
97 | |
|
|
98 | // run the los algorithm |
|
|
99 | // this is a variant of a spiral los algorithm taken from |
|
|
100 | // http://www.geocities.com/temerra/los_rays.html |
|
|
101 | // which has been simplified and changed considerably, but |
|
|
102 | // still is basically the same algorithm. |
|
|
103 | static void |
|
|
104 | calculate_los (player *pl) |
|
|
105 | { |
|
|
106 | { |
|
|
107 | memset (los, 0, sizeof (los)); |
|
|
108 | |
|
|
109 | // we keep one line for ourselves, for the border flag |
|
|
110 | // so the client area is actually MAP_CLIENT_(X|Y) - 2 |
|
|
111 | int half_x = min (LOS_X0 - 1, pl->ns->mapx / 2); |
|
|
112 | int half_y = min (LOS_Y0 - 1, pl->ns->mapy / 2); |
|
|
113 | |
|
|
114 | // create borders, the corners are not touched |
|
|
115 | for (int dx = -half_x; dx <= half_x; ++dx) |
|
|
116 | los [dx + LOS_X0][LOS_Y0 - (half_y + 1)].flags = |
|
|
117 | los [dx + LOS_X0][LOS_Y0 + (half_y + 1)].flags = FLG_QUEUED; |
|
|
118 | |
|
|
119 | for (int dy = -half_y; dy <= half_y; ++dy) |
|
|
120 | los [LOS_X0 - (half_x + 1)][dy + LOS_Y0].flags = |
|
|
121 | los [LOS_X0 + (half_x + 1)][dy + LOS_Y0].flags = FLG_QUEUED; |
|
|
122 | |
|
|
123 | // now reset the los area and also add blocked flags |
|
|
124 | // which supposedly is faster than doing it inside the |
|
|
125 | // spiral path algorithm below, except when very little |
|
|
126 | // area is visible, in which case it is slower. which evens |
|
|
127 | // out los calculation times between large and small los maps. |
|
|
128 | // apply_lights also iterates over this area, maybe these |
|
|
129 | // two passes could be combined somehow. |
|
|
130 | unordered_mapwalk (pl->observe, -half_x, -half_y, half_x, half_y) |
277 | { |
131 | { |
278 | if (!op->contr->blocked_los[x][y] && |
132 | los_info &l = los [LOS_X0 + dx][LOS_Y0 + dy]; |
279 | !(get_map_flags (op->map, NULL, |
133 | l.flags = m->at (nx, ny).flags () & P_BLOCKSVIEW ? FLG_BLOCKED : 0; |
280 | op->x - op->contr->ns->mapx / 2 + x, |
|
|
281 | op->y - op->contr->ns->mapy / 2 + y, NULL, NULL) & (P_BLOCKSVIEW | P_OUT_OF_MAP))) |
|
|
282 | { |
|
|
283 | |
|
|
284 | for (i = 1; i <= 8; i += 1) |
|
|
285 | { /* mark all directions */ |
|
|
286 | dx = x + freearr_x[i]; |
|
|
287 | dy = y + freearr_y[i]; |
|
|
288 | if (op->contr->blocked_los[dx][dy] > 0) /* for any square blocked */ |
|
|
289 | op->contr->blocked_los[dx][dy] = -1; |
|
|
290 | } |
|
|
291 | } |
|
|
292 | } |
134 | } |
|
|
135 | } |
293 | |
136 | |
294 | if (op->map->darkness > 0) /* player is on a dark map */ |
137 | q1 = 0; q2 = 0; // initialise queue, not strictly required |
295 | expand_lighted_sight (op); |
138 | enqueue (0, 0); // enqueue center |
296 | |
139 | |
297 | /* clear mark squares */ |
140 | // treat the origin specially |
298 | for (x = 0; x < op->contr->ns->mapx; x++) |
141 | los[LOS_X0][LOS_Y0].visible = 1; |
299 | for (y = 0; y < op->contr->ns->mapy; y++) |
142 | pl->los[LOS_X0][LOS_Y0] = 0; |
300 | if (op->contr->blocked_los[x][y] < 0) |
|
|
301 | op->contr->blocked_los[x][y] = 0; |
|
|
302 | } |
|
|
303 | |
143 | |
304 | /* returns true if op carries one or more lights |
144 | // loop over all enqueued points until the queue is empty |
305 | * This is a trivial function now days, but it used to |
145 | // the order in which this is done ensures that we |
306 | * be a bit longer. Probably better for callers to just |
146 | // never touch a mapspace whose input spaces we haven't checked |
307 | * check the op->glow_radius instead of calling this. |
147 | // yet. |
308 | */ |
148 | while (q1 != q2) |
309 | |
|
|
310 | int |
|
|
311 | has_carried_lights (const object *op) |
|
|
312 | { |
|
|
313 | /* op may glow! */ |
|
|
314 | if (op->glow_radius > 0) |
|
|
315 | return 1; |
|
|
316 | |
|
|
317 | return 0; |
|
|
318 | } |
|
|
319 | |
|
|
320 | static void |
|
|
321 | expand_lighted_sight (object *op) |
|
|
322 | { |
|
|
323 | int x, y, darklevel, ax, ay, basex, basey, mflags, light, x1, y1; |
|
|
324 | maptile *m = op->map; |
|
|
325 | sint16 nx, ny; |
|
|
326 | |
|
|
327 | darklevel = m->darkness; |
|
|
328 | |
|
|
329 | /* If the player can see in the dark, lower the darklevel for him */ |
|
|
330 | if (QUERY_FLAG (op, FLAG_SEE_IN_DARK)) |
|
|
331 | darklevel -= 2; |
|
|
332 | |
|
|
333 | /* add light, by finding all (non-null) nearby light sources, then |
|
|
334 | * mark those squares specially. If the darklevel<1, there is no |
|
|
335 | * reason to do this, so we skip this function |
|
|
336 | */ |
|
|
337 | |
|
|
338 | if (darklevel < 1) |
|
|
339 | return; |
|
|
340 | |
|
|
341 | /* Do a sanity check. If not valid, some code below may do odd |
|
|
342 | * things. |
|
|
343 | */ |
|
|
344 | if (darklevel > MAX_DARKNESS) |
|
|
345 | { |
149 | { |
346 | LOG (llevError, "Map darkness for %s on %s is too high (%d)\n", &op->name, &op->map->path, darklevel); |
150 | sint8 dx = queue[q2].x; |
347 | darklevel = MAX_DARKNESS; |
151 | sint8 dy = queue[q2].y; |
348 | } |
|
|
349 | |
152 | |
350 | /* First, limit player furthest (unlighted) vision */ |
153 | q2 = (q2 + 1) & (QUEUE_LENGTH - 1); |
351 | for (x = 0; x < op->contr->ns->mapx; x++) |
|
|
352 | for (y = 0; y < op->contr->ns->mapy; y++) |
|
|
353 | if (op->contr->blocked_los[x][y] != 100) |
|
|
354 | op->contr->blocked_los[x][y] = MAX_LIGHT_RADII; |
|
|
355 | |
154 | |
356 | /* the spaces[] darkness value contains the information we need. |
155 | sint8 x = LOS_X0 + dx; |
357 | * Only process the area of interest. |
156 | sint8 y = LOS_Y0 + dy; |
358 | * 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 |
|
|
360 | * value) than to recalculate them down below. |
|
|
361 | */ |
|
|
362 | for (x = (op->x - op->contr->ns->mapx / 2 - MAX_LIGHT_RADII), basex = -MAX_LIGHT_RADII; |
|
|
363 | x <= (op->x + op->contr->ns->mapx / 2 + MAX_LIGHT_RADII); x++, basex++) |
|
|
364 | { |
|
|
365 | |
157 | |
366 | for (y = (op->y - op->contr->ns->mapy / 2 - MAX_LIGHT_RADII), basey = -MAX_LIGHT_RADII; |
158 | los_info &l = los[x][y]; |
367 | y <= (op->y + op->contr->ns->mapy / 2 + MAX_LIGHT_RADII); y++, basey++) |
159 | |
|
|
160 | if (expect_true (l.flags & (FLG_XI | FLG_YI))) |
368 | { |
161 | { |
369 | m = op->map; |
162 | l.culled = 1; |
370 | nx = x; |
163 | l.xo = l.yo = l.xe = l.ye = 0; |
371 | ny = y; |
|
|
372 | |
164 | |
373 | mflags = get_map_flags (m, &m, nx, ny, &nx, &ny); |
165 | // check contributing spaces, first horizontal |
374 | |
166 | if (expect_true (l.flags & FLG_XI)) |
375 | if (mflags & P_OUT_OF_MAP) |
|
|
376 | continue; |
|
|
377 | |
|
|
378 | /* This space is providing light, so we need to brighten up the |
|
|
379 | * spaces around here. |
|
|
380 | */ |
|
|
381 | light = GET_MAP_LIGHT (m, nx, ny); |
|
|
382 | if (light != 0) |
|
|
383 | { |
167 | { |
384 | #if 0 |
168 | los_info *xi = &los[x - sign (dx)][y]; |
385 | LOG (llevDebug, "expand_lighted_sight: Found light at x=%d, y=%d, basex=%d, basey=%d\n", x, y, basex, basey); |
169 | |
386 | #endif |
170 | // don't cull unless obscured |
387 | for (ax = basex - light; ax <= basex + light; ax++) |
171 | l.culled &= !xi->visible; |
|
|
172 | |
|
|
173 | /* merge input space */ |
|
|
174 | if (expect_false (xi->xo || xi->yo)) |
388 | { |
175 | { |
389 | if (ax < 0 || ax >= op->contr->ns->mapx) |
176 | // The X input can provide two main pieces of information: |
390 | continue; |
177 | // 1. Progressive X obscurity. |
391 | |
178 | // 2. Recessive Y obscurity. |
392 | for (ay = basey - light; ay <= basey + light; ay++) |
179 | |
|
|
180 | // Progressive X obscurity, favouring recessive input angle |
|
|
181 | if (xi->xe > 0 && l.xo == 0) |
393 | { |
182 | { |
394 | if (ay < 0 || ay >= op->contr->ns->mapy) |
183 | l.xe = xi->xe - xi->yo; |
395 | continue; |
184 | l.ye = xi->ye + xi->yo; |
|
|
185 | l.xo = xi->xo; |
|
|
186 | l.yo = xi->yo; |
|
|
187 | } |
396 | |
188 | |
397 | /* If the space is fully blocked, do nothing. Otherwise, we |
189 | // Recessive Y obscurity |
398 | * brighten the space. The further the light is away from the |
190 | if (xi->ye <= 0 && xi->yo > 0 && xi->xe > 0) |
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) |
|
|
405 | { |
|
|
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 | } |
191 | { |
|
|
192 | l.ye = xi->yo + xi->ye; |
|
|
193 | l.xe = xi->xe - xi->yo; |
|
|
194 | l.xo = xi->xo; |
|
|
195 | l.yo = xi->yo; |
|
|
196 | } |
413 | } |
197 | } |
414 | } |
198 | } |
|
|
199 | |
|
|
200 | // check contributing spaces, last vertical, identical structure |
|
|
201 | if (expect_true (l.flags & FLG_YI)) |
|
|
202 | { |
|
|
203 | los_info *yi = &los[x][y - sign (dy)]; |
|
|
204 | |
|
|
205 | // don't cull unless obscured |
|
|
206 | l.culled &= !yi->visible; |
|
|
207 | |
|
|
208 | /* merge input space */ |
|
|
209 | if (expect_false (yi->yo || yi->xo)) |
|
|
210 | { |
|
|
211 | // The Y input can provide two main pieces of information: |
|
|
212 | // 1. Progressive Y obscurity. |
|
|
213 | // 2. Recessive X obscurity. |
|
|
214 | |
|
|
215 | // Progressive Y obscurity, favouring recessive input angle |
|
|
216 | if (yi->ye > 0 && l.yo == 0) |
|
|
217 | { |
|
|
218 | l.ye = yi->ye - yi->xo; |
|
|
219 | l.xe = yi->xe + yi->xo; |
|
|
220 | l.yo = yi->yo; |
|
|
221 | l.xo = yi->xo; |
|
|
222 | } |
|
|
223 | |
|
|
224 | // Recessive X obscurity |
|
|
225 | if (yi->xe <= 0 && yi->xo > 0 && yi->ye > 0) |
|
|
226 | { |
|
|
227 | l.xe = yi->xo + yi->xe; |
|
|
228 | l.ye = yi->ye - yi->xo; |
|
|
229 | l.yo = yi->yo; |
|
|
230 | l.xo = yi->xo; |
|
|
231 | } |
|
|
232 | } |
|
|
233 | } |
|
|
234 | |
|
|
235 | if (l.flags & FLG_BLOCKED) |
|
|
236 | { |
|
|
237 | l.xo = l.xe = abs (dx); |
|
|
238 | l.yo = l.ye = abs (dy); |
|
|
239 | |
|
|
240 | // we obscure dependents, but might be visible |
|
|
241 | // copy the los from the square towards the player, |
|
|
242 | // so outward diagonal corners are lit. |
|
|
243 | pl->los[x][y] = los[x - sign0 (dx)][y - sign0 (dy)].visible ? 0 : LOS_BLOCKED; |
|
|
244 | |
|
|
245 | l.visible = false; |
|
|
246 | } |
|
|
247 | else |
|
|
248 | { |
|
|
249 | // we are not blocked, so calculate visibility, by checking |
|
|
250 | // whether we are inside or outside the shadow |
|
|
251 | l.visible = (l.xe <= 0 || l.xe > l.xo) |
|
|
252 | && (l.ye <= 0 || l.ye > l.yo); |
|
|
253 | |
|
|
254 | pl->los[x][y] = l.culled ? LOS_BLOCKED |
|
|
255 | : l.visible ? 0 |
|
|
256 | : 3; |
|
|
257 | } |
|
|
258 | |
415 | } |
259 | } |
|
|
260 | |
|
|
261 | // Expands by the unit length in each component's current direction. |
|
|
262 | // If a component has no direction, then it is expanded in both of its |
|
|
263 | // positive and negative directions. |
|
|
264 | if (!l.culled) |
|
|
265 | { |
|
|
266 | if (dx >= 0) enqueue (dx + 1, dy, FLG_XI); |
|
|
267 | if (dx <= 0) enqueue (dx - 1, dy, FLG_XI); |
|
|
268 | if (dy >= 0) enqueue (dx, dy + 1, FLG_YI); |
|
|
269 | if (dy <= 0) enqueue (dx, dy - 1, FLG_YI); |
|
|
270 | } |
416 | } |
271 | } |
|
|
272 | } |
417 | |
273 | |
418 | /* Outdoor should never really be completely pitch black dark like |
274 | /* radius, distance => lightness adjust */ |
419 | * a dungeon, so let the player at least see a little around themselves |
275 | static sint8 light_atten[MAX_LIGHT_RADIUS * 2 + 1][MAX_LIGHT_RADIUS * 3 / 2 + 1]; |
|
|
276 | static sint8 vision_atten[MAX_VISION + 1][MAX_VISION * 3 / 2 + 1]; |
|
|
277 | |
|
|
278 | static struct los_init |
|
|
279 | { |
|
|
280 | los_init () |
|
|
281 | { |
|
|
282 | assert (("QUEUE_LENGTH, MAP_CLIENT_X and MAP_CLIENT_Y *must* be powers of two", |
|
|
283 | !(QUEUE_LENGTH & (QUEUE_LENGTH - 1)))); |
|
|
284 | |
|
|
285 | /* for lights */ |
|
|
286 | for (int radius = -MAX_LIGHT_RADIUS; radius <= MAX_LIGHT_RADIUS; ++radius) |
|
|
287 | for (int distance = 0; distance <= MAX_LIGHT_RADIUS * 3 / 2; ++distance) |
|
|
288 | { |
|
|
289 | // max intensity |
|
|
290 | int intensity = min (LOS_MAX, abs (radius) + 1); |
|
|
291 | |
|
|
292 | // actual intensity |
|
|
293 | intensity = max (0, lerp_ru (distance, 0, abs (radius) + 1, intensity, 0)); |
|
|
294 | |
|
|
295 | light_atten [radius + MAX_LIGHT_RADIUS][distance] = radius < 0 |
|
|
296 | ? min (3, intensity) |
|
|
297 | : LOS_MAX - intensity; |
|
|
298 | } |
|
|
299 | |
|
|
300 | /* for general vision */ |
|
|
301 | for (int radius = 0; radius <= MAX_VISION; ++radius) |
|
|
302 | for (int distance = 0; distance <= MAX_VISION * 3 / 2; ++distance) |
|
|
303 | vision_atten [radius][distance] = distance <= radius ? clamp (lerp (radius, 0, MAX_DARKNESS, 3, 0), 0, 3) : 4; |
|
|
304 | } |
|
|
305 | } los_init; |
|
|
306 | |
|
|
307 | sint8 |
|
|
308 | los_brighten (sint8 b, sint8 l) |
|
|
309 | { |
|
|
310 | return b == LOS_BLOCKED ? b : min (b, l); |
|
|
311 | } |
|
|
312 | |
|
|
313 | sint8 |
|
|
314 | los_darken (sint8 b, sint8 l) |
|
|
315 | { |
|
|
316 | return max (b, l); |
|
|
317 | } |
|
|
318 | |
|
|
319 | template<sint8 change_it (sint8, sint8)> |
|
|
320 | static void |
|
|
321 | apply_light (player *pl, int dx, int dy, int light, const sint8 *atten_table) |
|
|
322 | { |
|
|
323 | // min or max the circular area around basex, basey |
|
|
324 | dx += LOS_X0; |
|
|
325 | dy += LOS_Y0; |
|
|
326 | |
|
|
327 | int hx = pl->ns->mapx / 2; |
|
|
328 | int hy = pl->ns->mapy / 2; |
|
|
329 | |
|
|
330 | int ax0 = max (LOS_X0 - hx, dx - light); |
|
|
331 | int ay0 = max (LOS_Y0 - hy, dy - light); |
|
|
332 | int ax1 = min (dx + light, LOS_X0 + hx); |
|
|
333 | int ay1 = min (dy + light, LOS_Y0 + hy); |
|
|
334 | |
|
|
335 | for (int ax = ax0; ax <= ax1; ax++) |
|
|
336 | for (int ay = ay0; ay <= ay1; ay++) |
|
|
337 | pl->los[ax][ay] = |
|
|
338 | change_it (pl->los[ax][ay], atten_table [idistance (ax - dx, ay - dy)]); |
|
|
339 | } |
|
|
340 | |
|
|
341 | /* add light, by finding all (non-null) nearby light sources, then |
|
|
342 | * mark those squares specially. |
420 | */ |
343 | */ |
421 | if (op->map->outdoor && darklevel > (MAX_DARKNESS - 3)) |
344 | static void |
|
|
345 | apply_lights (player *pl) |
|
|
346 | { |
|
|
347 | object *op = pl->observe; |
|
|
348 | int darklevel = op->map->darklevel (); |
|
|
349 | |
|
|
350 | int half_x = pl->ns->mapx / 2; |
|
|
351 | int half_y = pl->ns->mapy / 2; |
|
|
352 | |
|
|
353 | int pass2 = 0; // negative lights have an extra pass |
|
|
354 | |
|
|
355 | maprect *rects = pl->observe->map->split_to_tiles ( |
|
|
356 | pl->observe->x - half_x - MAX_LIGHT_RADIUS, |
|
|
357 | pl->observe->y - half_y - MAX_LIGHT_RADIUS, |
|
|
358 | pl->observe->x + half_x + MAX_LIGHT_RADIUS + 1, |
|
|
359 | pl->observe->y + half_y + MAX_LIGHT_RADIUS + 1 |
|
|
360 | ); |
|
|
361 | |
|
|
362 | /* If the player can see in the dark, increase light/vision radius */ |
|
|
363 | int bonus = op->flag [FLAG_SEE_IN_DARK] ? SEE_IN_DARK_RADIUS : 0; |
|
|
364 | |
|
|
365 | if (!darklevel) |
|
|
366 | pass2 = 1; |
|
|
367 | else |
422 | { |
368 | { |
423 | if (op->contr->blocked_los[op->contr->ns->mapx / 2][op->contr->ns->mapy / 2] > (MAX_DARKNESS - 3)) |
369 | /* first, make everything totally dark */ |
424 | op->contr->blocked_los[op->contr->ns->mapx / 2][op->contr->ns->mapy / 2] = MAX_DARKNESS - 3; |
370 | for (int dx = -half_x; dx <= half_x; dx++) |
|
|
371 | for (int dy = -half_x; dy <= half_y; dy++) |
|
|
372 | max_it (pl->los[dx + LOS_X0][dy + LOS_Y0], LOS_MAX); |
425 | |
373 | |
426 | for (x = -1; x <= 1; x++) |
374 | /* |
427 | for (y = -1; y <= 1; y++) |
375 | * Only process the area of interest. |
|
|
376 | * the basex, basey values represent the position in the op->contr->los |
|
|
377 | * array. Its easier to just increment them here (and start with the right |
|
|
378 | * value) than to recalculate them down below. |
|
|
379 | */ |
|
|
380 | for (maprect *r = rects; r->m; ++r) |
|
|
381 | rect_mapwalk (r, 0, 0) |
428 | { |
382 | { |
429 | if (op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] > (MAX_DARKNESS - 2)) |
383 | mapspace &ms = m->at (nx, ny); |
430 | op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] = MAX_DARKNESS - 2; |
384 | ms.update (); |
|
|
385 | sint8 light = ms.light; |
|
|
386 | |
|
|
387 | if (expect_false (light)) |
|
|
388 | if (light < 0) |
|
|
389 | pass2 = 1; |
|
|
390 | else |
|
|
391 | { |
|
|
392 | light = clamp (light + bonus, 0, MAX_LIGHT_RADIUS); |
|
|
393 | apply_light<los_brighten> (pl, dx - pl->observe->x, dy - pl->observe->y, light, light_atten [light + MAX_LIGHT_RADIUS]); |
|
|
394 | } |
431 | } |
395 | } |
|
|
396 | |
|
|
397 | /* grant some vision to the player, based on outside, outdoor, and darklevel */ |
|
|
398 | { |
|
|
399 | int light; |
|
|
400 | |
|
|
401 | if (!op->map->outdoor) // not outdoor, darkness becomes light radius |
|
|
402 | light = MAX_DARKNESS - op->map->darkness; |
|
|
403 | else if (op->map->darkness > 0) // outdoor and darkness > 0 => use darkness as max radius |
|
|
404 | light = lerp_rd (maptile::outdoor_darkness + 0, 0, MAX_DARKNESS, MAX_DARKNESS - op->map->darkness, 0); |
|
|
405 | else // outdoor and darkness <= 0 => start wide and decrease quickly |
|
|
406 | light = lerp (maptile::outdoor_darkness + op->map->darkness, 0, MAX_DARKNESS, MAX_VISION, 2); |
|
|
407 | |
|
|
408 | light = clamp (light + bonus, 0, MAX_VISION); |
|
|
409 | |
|
|
410 | apply_light<los_brighten> (pl, 0, 0, light, vision_atten [light]); |
|
|
411 | } |
432 | } |
412 | } |
433 | |
413 | |
434 | /* grant some vision to the player, based on the darklevel */ |
414 | // possibly do 2nd pass for rare negative glow radii |
435 | for (x = darklevel - MAX_DARKNESS; x < MAX_DARKNESS + 1 - darklevel; x++) |
415 | // for effect, those are always considered to be stronger than anything else |
436 | for (y = darklevel - MAX_DARKNESS; y < MAX_DARKNESS + 1 - darklevel; y++) |
416 | // but they can't darken a place completely |
437 | if (!(op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] == 100)) |
417 | if (pass2) |
438 | op->contr->blocked_los[x + op->contr->ns->mapx / 2][y + op->contr->ns->mapy / 2] -= |
418 | for (maprect *r = rects; r->m; ++r) |
439 | MAX (0, 6 - darklevel - MAX (abs (x), abs (y))); |
419 | rect_mapwalk (r, 0, 0) |
440 | } |
420 | { |
|
|
421 | mapspace &ms = m->at (nx, ny); |
|
|
422 | ms.update (); |
|
|
423 | sint8 light = ms.light; |
441 | |
424 | |
|
|
425 | if (expect_false (light < 0)) |
|
|
426 | { |
|
|
427 | light = clamp (light - bonus, 0, MAX_DARKNESS); |
|
|
428 | apply_light<los_darken> (pl, dx - pl->observe->x, dy - pl->observe->y, -light, light_atten [light + MAX_LIGHT_RADIUS]); |
|
|
429 | } |
|
|
430 | } |
|
|
431 | } |
|
|
432 | |
442 | /* blinded_sight() - sets all veiwable squares to blocked except |
433 | /* blinded_sight() - sets all viewable squares to blocked except |
443 | * for the one the central one that the player occupies. A little |
434 | * 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 |
435 | * odd that you can see yourself (and what your standing on), but |
445 | * really need for any reasonable game play. |
436 | * really need for any reasonable game play. |
446 | */ |
437 | */ |
447 | static void |
438 | static void |
448 | blinded_sight (object *op) |
439 | blinded_sight (player *pl) |
449 | { |
440 | { |
450 | int x, y; |
441 | pl->los[LOS_X0][LOS_Y0] = 1; |
451 | |
|
|
452 | for (x = 0; x < op->contr->ns->mapx; x++) |
|
|
453 | for (y = 0; y < op->contr->ns->mapy; y++) |
|
|
454 | op->contr->blocked_los[x][y] = 100; |
|
|
455 | |
|
|
456 | op->contr->blocked_los[op->contr->ns->mapx / 2][op->contr->ns->mapy / 2] = 0; |
|
|
457 | } |
442 | } |
458 | |
443 | |
459 | /* |
444 | /* |
460 | * update_los() recalculates the array which specifies what is |
445 | * update_los() recalculates the array which specifies what is |
461 | * visible for the given player-object. |
446 | * visible for the given player-object. |
462 | */ |
447 | */ |
463 | void |
448 | void |
464 | update_los (object *op) |
449 | player::update_los () |
465 | { |
450 | { |
466 | int dx = op->contr->ns->mapx / 2, dy = op->contr->ns->mapy / 2, x, y; |
451 | if (ob->flag [FLAG_REMOVED])//D really needed? |
467 | |
|
|
468 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
469 | return; |
452 | return; |
470 | |
453 | |
471 | clear_los (op->contr); |
454 | if (ob->flag [FLAG_WIZLOOK]) |
472 | |
455 | clear_los (0); |
473 | if (QUERY_FLAG (op, FLAG_WIZ) /* ||XRAYS(op) */ ) |
456 | else if (observe->flag [FLAG_BLIND]) /* player is blind */ |
474 | return; |
457 | { |
475 | |
458 | clear_los (); |
476 | /* 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 |
|
|
478 | * be blocked by different spaces in front, this mean that a lot of spaces |
|
|
479 | * could be examined multile times, as each path would be looked at. |
|
|
480 | */ |
|
|
481 | for (x = (MAP_CLIENT_X - op->contr->ns->mapx) / 2 - 1; x < (MAP_CLIENT_X + op->contr->ns->mapx) / 2 + 1; x++) |
|
|
482 | for (y = (MAP_CLIENT_Y - op->contr->ns->mapy) / 2 - 1; y < (MAP_CLIENT_Y + op->contr->ns->mapy) / 2 + 1; y++) |
|
|
483 | check_wall (op, x, y); |
|
|
484 | |
|
|
485 | /* do the los of the player. 3 (potential) cases */ |
|
|
486 | if (QUERY_FLAG (op, FLAG_BLIND)) /* player is blind */ |
|
|
487 | blinded_sight (op); |
459 | blinded_sight (this); |
|
|
460 | } |
488 | else |
461 | else |
489 | expand_sight (op); |
462 | { |
|
|
463 | clear_los (); |
|
|
464 | calculate_los (this); |
|
|
465 | apply_lights (this); |
|
|
466 | } |
490 | |
467 | |
491 | //TODO: no range-checking whatsoever :( |
468 | if (observe->flag [FLAG_XRAYS]) |
492 | if (QUERY_FLAG (op, FLAG_XRAYS)) |
|
|
493 | for (int x = -2; x <= 2; x++) |
469 | for (int dx = -2; dx <= 2; dx++) |
494 | for (int y = -2; y <= 2; y++) |
470 | for (int dy = -2; dy <= 2; dy++) |
495 | op->contr->blocked_los[dx + x][dy + y] = 0; |
471 | min_it (los[dx + LOS_X0][dy + LOS_Y0], 1); |
496 | } |
472 | } |
497 | |
473 | |
498 | /* update all_map_los is like update_all_los below, |
474 | /* update all_map_los is like update_all_los below, |
499 | * but updates everyone on the map, no matter where they |
475 | * but updates everyone on the map, no matter where they |
500 | * are. This generally should not be used, as a per |
476 | * are. This generally should not be used, as a per |
… | |
… | |
507 | * change_map_light function |
483 | * change_map_light function |
508 | */ |
484 | */ |
509 | void |
485 | void |
510 | update_all_map_los (maptile *map) |
486 | update_all_map_los (maptile *map) |
511 | { |
487 | { |
512 | for_all_players (pl) |
488 | for_all_players_on_map (pl, map) |
513 | if (pl->ob && pl->ob->map == map) |
|
|
514 | pl->do_los = 1; |
489 | pl->do_los = 1; |
515 | } |
490 | } |
516 | |
491 | |
517 | /* |
492 | /* |
518 | * This function makes sure that update_los() will be called for all |
493 | * This function makes sure that update_los() will be called for all |
519 | * players on the given map within the next frame. |
494 | * players on the given map within the next frame. |
… | |
… | |
527 | * map is the map that changed, x and y are the coordinates. |
502 | * map is the map that changed, x and y are the coordinates. |
528 | */ |
503 | */ |
529 | void |
504 | void |
530 | update_all_los (const maptile *map, int x, int y) |
505 | update_all_los (const maptile *map, int x, int y) |
531 | { |
506 | { |
|
|
507 | map->at (x, y).invalidate (); |
|
|
508 | |
532 | for_all_players (pl) |
509 | for_all_players (pl) |
533 | { |
510 | { |
534 | /* Player should not have a null map, but do this |
511 | /* Player should not have a null map, but do this |
535 | * check as a safety |
512 | * check as a safety |
536 | */ |
513 | */ |
537 | if (!pl->ob || !pl->ob->map || !pl->ns) |
514 | if (!pl->ob || !pl->ob->map || !pl->ns) |
538 | continue; |
515 | continue; |
539 | |
516 | |
540 | /* Same map is simple case - see if pl is close enough. |
517 | rv_vector rv; |
541 | * Note in all cases, we did the check for same map first, |
518 | |
542 | * and then see if the player is close enough and update |
519 | get_rangevector_from_mapcoord (map, x, y, pl->ob, &rv); |
543 | * los if that is the case. If the player is on the |
|
|
544 | * corresponding map, but not close enough, then the |
|
|
545 | * player can't be on another map that may be closer, |
|
|
546 | * so by setting it up this way, we trim processing |
|
|
547 | * some. |
|
|
548 | */ |
520 | |
549 | if (pl->ob->map == map) |
521 | if ((abs (rv.distance_x) <= pl->ns->mapx / 2) && (abs (rv.distance_y) <= pl->ns->mapy / 2)) |
550 | { |
|
|
551 | if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) |
|
|
552 | pl->do_los = 1; |
522 | pl->do_los = 1; |
553 | } |
|
|
554 | |
|
|
555 | /* Now we check to see if player is on adjacent |
|
|
556 | * maps to the one that changed and also within |
|
|
557 | * view. The tile_maps[] could be null, but in that |
|
|
558 | * case it should never match the pl->ob->map, so |
|
|
559 | * we want ever try to dereference any of the data in it. |
|
|
560 | * |
|
|
561 | * The logic for 0 and 3 is to see how far the player is |
|
|
562 | * from the edge of the map (height/width) - pl->ob->(x,y) |
|
|
563 | * and to add current position on this map - that gives a |
|
|
564 | * distance. |
|
|
565 | * For 1 and 2, we check to see how far the given |
|
|
566 | * coordinate (x,y) is from the corresponding edge, |
|
|
567 | * and then add the players location, which gives |
|
|
568 | * a distance. |
|
|
569 | */ |
|
|
570 | else if (pl->ob->map == map->tile_map[0]) |
|
|
571 | { |
|
|
572 | if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (y + map->tile_map[0]->height - pl->ob->y) <= pl->ns->mapy / 2)) |
|
|
573 | pl->do_los = 1; |
|
|
574 | } |
|
|
575 | else if (pl->ob->map == map->tile_map[2]) |
|
|
576 | { |
|
|
577 | if ((abs (pl->ob->x - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y + map->height - y) <= pl->ns->mapy / 2)) |
|
|
578 | pl->do_los = 1; |
|
|
579 | } |
|
|
580 | else if (pl->ob->map == map->tile_map[1]) |
|
|
581 | { |
|
|
582 | if ((abs (pl->ob->x + map->width - x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) |
|
|
583 | pl->do_los = 1; |
|
|
584 | } |
|
|
585 | else if (pl->ob->map == map->tile_map[3]) |
|
|
586 | { |
|
|
587 | if ((abs (x + map->tile_map[3]->width - pl->ob->x) <= pl->ns->mapx / 2) && (abs (pl->ob->y - y) <= pl->ns->mapy / 2)) |
|
|
588 | pl->do_los = 1; |
|
|
589 | } |
|
|
590 | } |
523 | } |
591 | } |
524 | } |
592 | |
525 | |
|
|
526 | static const int season_darkness[5][HOURS_PER_DAY] = { |
|
|
527 | /*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 */ |
|
|
528 | { 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 }, |
|
|
529 | { 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 }, |
|
|
530 | { 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 }, |
|
|
531 | { 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 }, |
|
|
532 | { 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 } |
|
|
533 | }; |
|
|
534 | |
593 | /* |
535 | /* |
594 | * Debug-routine which dumps the array which specifies the visible |
536 | * Tell players the time and compute the darkness level for all maps in the game. |
595 | * area of a player. Triggered by the z key in DM mode. |
537 | * MUST be called exactly once per hour. |
596 | */ |
538 | */ |
597 | void |
539 | void |
598 | print_los (object *op) |
540 | maptile::adjust_daylight () |
599 | { |
541 | { |
600 | int x, y; |
542 | timeofday_t tod; |
601 | char buf[50], buf2[10]; |
|
|
602 | |
543 | |
603 | strcpy (buf, " "); |
544 | get_tod (&tod); |
604 | |
545 | |
605 | for (x = 0; x < op->contr->ns->mapx; x++) |
546 | // log the time to log-1 every hour, and to chat every day |
606 | { |
547 | { |
607 | sprintf (buf2, "%2d", x); |
548 | char todbuf[512]; |
608 | strcat (buf, buf2); |
549 | |
|
|
550 | format_tod (todbuf, sizeof (todbuf), &tod); |
|
|
551 | |
|
|
552 | for_all_players (pl) |
|
|
553 | pl->ns->send_msg (NDI_GREY, tod.hour == 15 ? CHAT_CHANNEL : LOG_CHANNEL, todbuf); |
609 | } |
554 | } |
610 | |
555 | |
611 | new_draw_info (NDI_UNIQUE, 0, op, buf); |
556 | /* If the light level isn't changing, no reason to do all |
|
|
557 | * the work below. |
|
|
558 | */ |
|
|
559 | sint8 new_darkness = season_darkness[tod.season][tod.hour]; |
612 | |
560 | |
613 | for (y = 0; y < op->contr->ns->mapy; y++) |
561 | if (new_darkness == maptile::outdoor_darkness) |
614 | { |
562 | return; |
615 | sprintf (buf, "%2d:", y); |
|
|
616 | |
563 | |
617 | for (x = 0; x < op->contr->ns->mapx; x++) |
564 | new_draw_info (NDI_GREY | NDI_UNIQUE | NDI_ALL, 1, 0, |
618 | { |
565 | new_darkness > maptile::outdoor_darkness |
619 | sprintf (buf2, " %1d", op->contr->blocked_los[x][y]); |
566 | ? "It becomes darker." |
620 | strcat (buf, buf2); |
567 | : "It becomes brighter."); |
621 | } |
|
|
622 | |
568 | |
623 | new_draw_info (NDI_UNIQUE, 0, op, buf); |
569 | maptile::outdoor_darkness = new_darkness; |
624 | } |
570 | |
|
|
571 | // we simply update the los for all players, which is unnecessarily |
|
|
572 | // costly, but should do for the moment. |
|
|
573 | for_all_players (pl) |
|
|
574 | pl->do_los = 1; |
625 | } |
575 | } |
626 | |
576 | |
627 | /* |
577 | /* |
628 | * make_sure_seen: The object is supposed to be visible through walls, thus |
578 | * make_sure_seen: The object is supposed to be visible through walls, thus |
629 | * check if any players are nearby, and edit their LOS array. |
579 | * check if any players are nearby, and edit their LOS array. |
630 | */ |
580 | */ |
631 | |
|
|
632 | void |
581 | void |
633 | make_sure_seen (const object *op) |
582 | make_sure_seen (const object *op) |
634 | { |
583 | { |
635 | for_all_players (pl) |
584 | for_all_players (pl) |
636 | if (pl->ob->map == op->map && |
585 | if (pl->ob->map == op->map && |
637 | pl->ob->y - pl->ns->mapy / 2 <= op->y && |
586 | 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) |
587 | 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->blocked_los[pl->ns->mapx / 2 + op->x - pl->ob->x][pl->ns->mapy / 2 + op->y - pl->ob->y] = 0; |
588 | pl->los[op->x - pl->ob->x + LOS_X0][op->y - pl->ob->y + LOS_Y0] = 0; |
640 | } |
589 | } |
641 | |
590 | |
642 | /* |
591 | /* |
643 | * make_sure_not_seen: The object which is supposed to be visible through |
592 | * make_sure_not_seen: The object which is supposed to be visible through |
644 | * walls has just been removed from the map, so update the los of any |
593 | * walls has just been removed from the map, so update the los of any |
645 | * players within its range |
594 | * players within its range |
646 | */ |
595 | */ |
647 | |
|
|
648 | void |
596 | void |
649 | make_sure_not_seen (const object *op) |
597 | make_sure_not_seen (const object *op) |
650 | { |
598 | { |
651 | for_all_players (pl) |
599 | for_all_players (pl) |
652 | if (pl->ob->map == op->map && |
600 | if (pl->ob->map == op->map && |
653 | pl->ob->y - pl->ns->mapy / 2 <= op->y && |
601 | pl->ob->y - pl->ns->mapy / 2 <= op->y && |
654 | 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->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) |
655 | pl->do_los = 1; |
603 | pl->do_los = 1; |
656 | } |
604 | } |
|
|
605 | |