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

Comparing deliantra/server/common/los.C (file contents):
Revision 1.16 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs.
Revision 1.41 by root, Fri Dec 19 22:47:29 2008 UTC

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

Diff Legend

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

Comparing deliantra/server/common/los.C (file contents): Revision 1.16 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs. Revision 1.41 by root, Fri Dec 19 22:47:29 2008 UTC

Diff Legend

Comparing deliantra/server/common/los.C (file contents):
Revision 1.16 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs.
Revision 1.41 by root, Fri Dec 19 22:47:29 2008 UTC