/
fov_permissive2.c
260 lines (243 loc) · 8.79 KB
/
fov_permissive2.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
/* BSD 3-Clause License
*
* Copyright © 2008-2020, Jice and the libtcod contributors.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include "fov.h"
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "libtcod_int.h"
#include "utility.h"
/* The size of each square in units */
#define STEP_SIZE 16
/* Jonathon Duerig enhanced permissive FOV */
typedef struct {
int xi,yi,xf,yf;
} line_t;
/* Defines the parameters of the permissiveness */
/* Derived values defining the actual part of the square used as a range. */
static int offset;
static int limit;
typedef struct _viewbump_t {
int x,y;
int refcount;
struct _viewbump_t *parent;
} viewbump_t;
typedef struct {
line_t shallow_line;
line_t steep_line;
viewbump_t *shallow_bump;
viewbump_t *steep_bump;
} view_t;
static view_t **current_view=NULL;
static view_t *views=NULL;
static viewbump_t *bumps=NULL;
static int bumpidx=0;
#define RELATIVE_SLOPE(l,x,y) (((l)->yf-(l)->yi)*((l)->xf-(x)) - ((l)->xf-(l)->xi)*((l)->yf-(y)))
#define BELOW(l,x,y) (RELATIVE_SLOPE(l,x,y) > 0)
#define BELOW_OR_COLINEAR(l,x,y) (RELATIVE_SLOPE(l,x,y) >= 0)
#define ABOVE(l,x,y) (RELATIVE_SLOPE(l,x,y) < 0)
#define ABOVE_OR_COLINEAR(l,x,y) (RELATIVE_SLOPE(l,x,y) <= 0)
#define COLINEAR(l,x,y) (RELATIVE_SLOPE(l,x,y) == 0)
#define LINE_COLINEAR(l,l2) (COLINEAR(l,(l2)->xi,(l2)->yi) && COLINEAR(l,(l2)->xf,(l2)->yf))
static bool is_blocked(struct TCOD_Map *map, view_t *view, int startX, int startY, int x, int y, int dx, int dy, bool light_walls) {
int posx=x*dx/STEP_SIZE+startX;
int posy=y*dy/STEP_SIZE+startY;
int offset=posx + (posy)*map->width;
bool blocked=!map->cells[offset].transparent;
if (! blocked || light_walls) map->cells[offset].fov=1;
return blocked;
}
static void add_shallow_bump(int x, int y, view_t *view) {
viewbump_t *shallow, *curbump;
view->shallow_line.xf=x;
view->shallow_line.yf=y;
shallow= &bumps[bumpidx++];
shallow->x=x;
shallow->y=y;
shallow->parent=view->shallow_bump;
view->shallow_bump=shallow;
curbump=view->steep_bump;
while ( curbump ) {
if ( ABOVE(&view->shallow_line,curbump->x,curbump->y)) {
view->shallow_line.xi=curbump->x;
view->shallow_line.yi=curbump->y;
}
curbump=curbump->parent;
}
}
static void add_steep_bump(int x, int y, view_t *view) {
viewbump_t *steep, *curbump;
view->steep_line.xf=x;
view->steep_line.yf=y;
steep=&bumps[bumpidx++];
steep->x=x;
steep->y=y;
steep->parent=view->steep_bump;
view->steep_bump=steep;
curbump=view->shallow_bump;
while ( curbump ) {
if ( BELOW(&view->steep_line,curbump->x,curbump->y)) {
view->steep_line.xi=curbump->x;
view->steep_line.yi=curbump->y;
}
curbump=curbump->parent;
}
}
static bool check_view(TCOD_list_t active_views, view_t **it) {
view_t *view=*it;
line_t *shallow_line=&view->shallow_line;
line_t *steep_line=&view->steep_line;
if (LINE_COLINEAR(shallow_line,steep_line)
&& (COLINEAR(shallow_line,offset,limit)
|| COLINEAR(shallow_line,limit,offset)) ){
/*printf ("deleting view %x\n",it); */
/* slow ! */
TCOD_list_remove_iterator(active_views,(void **)it);
return false;
}
return true;
}
static void visit_coords(struct TCOD_Map *m,int startX, int startY, int x, int y, int dx, int dy,
TCOD_list_t active_views, bool light_walls) {
/* top left */
int tlx=x, tly=y+STEP_SIZE;
/* bottom right */
int brx=x+STEP_SIZE, bry=y;
view_t *view=NULL;
while (current_view != (view_t **)TCOD_list_end(active_views)) {
view=*current_view;
if ( ! BELOW_OR_COLINEAR(&view->steep_line,brx,bry) ) {
break;
}
current_view++;
}
if ( current_view == (view_t **)TCOD_list_end(active_views) || ABOVE_OR_COLINEAR(&view->shallow_line,tlx,tly)) {
/* no more active view */
return;
}
if ( !is_blocked(m,view,startX,startY,x,y,dx,dy,light_walls) ) return;
if ( ABOVE(&view->shallow_line,brx,bry)
&& BELOW(&view->steep_line,tlx,tly)) {
/* view blocked */
/* slow ! */
TCOD_list_remove_iterator(active_views,(void **)current_view);
} else if ( ABOVE(&view->shallow_line,brx,bry)) {
/* shallow bump */
add_shallow_bump(tlx,tly,view);
check_view(active_views,current_view);
} else if (BELOW(&view->steep_line,tlx,tly)) {
/* steep bump */
add_steep_bump(brx,bry,view);
check_view(active_views,current_view);
} else {
/* view split */
int offset=startX+x*dx/STEP_SIZE + (startY+y*dy/STEP_SIZE)*m->width;
view_t *shallower_view= & views[offset];
int view_index=(int)(current_view - (view_t **)TCOD_list_begin(active_views));
view_t **shallower_view_it;
view_t **steeper_view_it;
*shallower_view=**current_view;
/* slow ! */
shallower_view_it = (view_t **)TCOD_list_insert_before(active_views,shallower_view,view_index);
steeper_view_it=shallower_view_it+1;
current_view=shallower_view_it;
add_steep_bump(brx,bry,shallower_view);
if (!check_view(active_views,shallower_view_it)) steeper_view_it--;
add_shallow_bump(tlx,tly,*steeper_view_it);
check_view(active_views,steeper_view_it);
if ( view_index > TCOD_list_size(active_views)) current_view=(view_t **)TCOD_list_end(active_views);
}
}
static void check_quadrant(struct TCOD_Map *m,int startX,int startY,int dx, int dy, int extentX,int extentY, bool light_walls) {
TCOD_list_t active_views=TCOD_list_new();
line_t shallow_line={offset,limit,extentX*STEP_SIZE,0};
line_t steep_line={limit,offset,0,extentY*STEP_SIZE};
int maxI=extentX+extentY,i=1;
view_t *view= &views[startX+startY*m->width];
view->shallow_line=shallow_line;
view->steep_line=steep_line;
view->shallow_bump=NULL;
view->steep_bump=NULL;
TCOD_list_push(active_views,view);
current_view=(view_t **)TCOD_list_begin(active_views);
while ( i != maxI+1 && ! TCOD_list_is_empty(active_views) ) {
int startJ=MAX(i-extentX,0);
int maxJ=MIN(i,extentY);
int j=startJ;
while ( j != maxJ+1 && ! TCOD_list_is_empty(active_views) && current_view != (view_t **)TCOD_list_end(active_views) ) {
int x=(i - j)*STEP_SIZE;
int y=j*STEP_SIZE;
visit_coords(m,startX,startY,x,y,dx,dy,active_views, light_walls);
j++;
}
i++;
current_view=(view_t **)TCOD_list_begin(active_views);
}
TCOD_list_delete(active_views);
}
void TCOD_map_compute_fov_permissive2(TCOD_map_t map, int player_x, int player_y, int max_radius, bool light_walls, int fovType) {
int c,minx,maxx,miny,maxy;
struct TCOD_Map *m = (struct TCOD_Map *)map;
if ( (unsigned)fovType>8 ) TCOD_fatal("Bad permissiveness %d for FOV_PERMISSIVE. Accepted range is [0,8].\n",fovType);
offset=8-fovType;
limit=8+fovType;
/* clean the map */
for (c=m->nbcells-1; c >= 0; c--) {
m->cells[c].fov=0;
}
m->cells[player_x+player_y*m->width].fov=1;
/* preallocate views and bumps */
views=(view_t *)calloc(sizeof(view_t),m->width*m->height);
bumps=(viewbump_t *)calloc(sizeof(viewbump_t),m->width*m->height);
/* set the fov range */
if ( max_radius > 0 ) {
minx=MIN(player_x,max_radius);
maxx=MIN(m->width-player_x-1,max_radius);
miny=MIN(player_y,max_radius);
maxy=MIN(m->height-player_y-1,max_radius);
} else {
minx=player_x;
maxx=m->width-player_x-1;
miny=player_y;
maxy=m->height-player_y-1;
}
/* calculate fov. precise permissive field of view */
bumpidx=0;
check_quadrant(m,player_x,player_y,1,1,maxx,maxy, light_walls);
bumpidx=0;
check_quadrant(m,player_x,player_y,1,-1,maxx,miny, light_walls);
bumpidx=0;
check_quadrant(m,player_x,player_y,-1,-1,minx,miny, light_walls);
bumpidx=0;
check_quadrant(m,player_x,player_y,-1,1,minx,maxy, light_walls);
free(bumps);
free(views);
}