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

Comparing deliantra/server/common/los.C (file contents):
Revision 1.30 by root, Mon Apr 21 23:35:24 2008 UTC vs.
Revision 1.50 by root, Tue Dec 23 22:04:17 2008 UTC

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

Diff Legend

Comparing deliantra/server/common/los.C (file contents):
Revision 1.30 by root, Mon Apr 21 23:35:24 2008 UTC vs.
Revision 1.50 by root, Tue Dec 23 22:04:17 2008 UTC