[ViewVC] Diff of: cvs/deliantra/server/common/los.C

Comparing deliantra/server/common/los.C (file contents):
Revision 1.40 by root, Fri Dec 19 17:52:50 2008 UTC vs.
Revision 1.63 by root, Tue Nov 3 23:44:20 2009 UTC

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

Diff Legend

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

Comparing deliantra/server/common/los.C (file contents): Revision 1.40 by root, Fri Dec 19 17:52:50 2008 UTC vs. Revision 1.63 by root, Tue Nov 3 23:44:20 2009 UTC

Diff Legend

Comparing deliantra/server/common/los.C (file contents):
Revision 1.40 by root, Fri Dec 19 17:52:50 2008 UTC vs.
Revision 1.63 by root, Tue Nov 3 23:44:20 2009 UTC