1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
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 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. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
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> |
… | |
… | |
248 | * Clears/initialises the los-array associated to the player |
247 | * Clears/initialises the los-array associated to the player |
249 | * controlling the object. |
248 | * controlling the object. |
250 | */ |
249 | */ |
251 | |
250 | |
252 | void |
251 | void |
253 | clear_los (object *op) |
252 | clear_los (player *pl) |
254 | { |
253 | { |
255 | /* This is safer than using the ns->mapx, mapy because |
254 | /* This is safer than using the ns->mapx, mapy because |
256 | * we index the blocked_los as a 2 way array, so clearing |
255 | * we index the blocked_los as a 2 way array, so clearing |
257 | * the first z spaces may not not cover the spaces we are |
256 | * the first z spaces may not not cover the spaces we are |
258 | * actually going to use |
257 | * actually going to use |
259 | */ |
258 | */ |
260 | (void) memset ((void *) op->contr->blocked_los, 0, MAP_CLIENT_X * MAP_CLIENT_Y); |
259 | memset (pl->blocked_los, 0, MAP_CLIENT_X * MAP_CLIENT_Y); |
261 | } |
260 | } |
262 | |
261 | |
263 | /* |
262 | /* |
264 | * expand_sight goes through the array of what the given player is |
263 | * expand_sight goes through the array of what the given player is |
265 | * able to see, and expands the visible area a bit, so the player will, |
264 | * able to see, and expands the visible area a bit, so the player will, |
… | |
… | |
458 | |
457 | |
459 | /* |
458 | /* |
460 | * update_los() recalculates the array which specifies what is |
459 | * update_los() recalculates the array which specifies what is |
461 | * visible for the given player-object. |
460 | * visible for the given player-object. |
462 | */ |
461 | */ |
463 | |
|
|
464 | void |
462 | void |
465 | update_los (object *op) |
463 | update_los (object *op) |
466 | { |
464 | { |
467 | int dx = op->contr->ns->mapx / 2, dy = op->contr->ns->mapy / 2, x, y; |
465 | int dx = op->contr->ns->mapx / 2, dy = op->contr->ns->mapy / 2, x, y; |
468 | |
466 | |
469 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
467 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
470 | return; |
468 | return; |
471 | |
469 | |
472 | clear_los (op); |
470 | clear_los (op->contr); |
|
|
471 | |
473 | if (QUERY_FLAG (op, FLAG_WIZ) /* ||XRAYS(op) */ ) |
472 | if (QUERY_FLAG (op, FLAG_WIZ) /* ||XRAYS(op) */ ) |
474 | return; |
473 | return; |
475 | |
474 | |
476 | /* For larger maps, this is more efficient than the old way which |
475 | /* For larger maps, this is more efficient than the old way which |
477 | * used the chaining of the block array. Since many space views could |
476 | * used the chaining of the block array. Since many space views could |