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

Comparing deliantra/server/common/los.C (file contents):
Revision 1.4 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.71 by root, Sat Apr 23 04:56:46 2011 UTC

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

Diff Legend

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

Comparing deliantra/server/common/los.C (file contents): Revision 1.4 by root, Sun Sep 10 16:00:23 2006 UTC vs. Revision 1.71 by root, Sat Apr 23 04:56:46 2011 UTC

Diff Legend

Comparing deliantra/server/common/los.C (file contents):
Revision 1.4 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.71 by root, Sat Apr 23 04:56:46 2011 UTC