eliminated model->meshlist, replaced with an embedded model->surfmesh to cut down...
[divverent/darkplaces.git] / portals.c
1
2 #include "quakedef.h"
3 #include "polygon.h"
4
5 #define MAXRECURSIVEPORTALPLANES 1024
6 #define MAXRECURSIVEPORTALS 256
7
8 static tinyplane_t portalplanes[MAXRECURSIVEPORTALPLANES];
9 static int ranoutofportalplanes;
10 static int ranoutofportals;
11 static float portaltemppoints[2][256][3];
12 static float portaltemppoints2[256][3];
13 static int portal_markid = 0;
14 static float boxpoints[4*3];
15
16 static int Portal_PortalThroughPortalPlanes(tinyplane_t *clipplanes, int clipnumplanes, float *targpoints, int targnumpoints, float *out, int maxpoints)
17 {
18         int numpoints, i;
19         if (targnumpoints < 3)
20                 return targnumpoints;
21         if (maxpoints < 3)
22                 return -1;
23         numpoints = targnumpoints;
24         memcpy(&portaltemppoints[0][0][0], targpoints, numpoints * 3 * sizeof(float));
25         for (i = 0;i < clipnumplanes;i++)
26         {
27                 PolygonF_Divide(numpoints, &portaltemppoints[0][0][0], clipplanes[i].normal[0], clipplanes[i].normal[1], clipplanes[i].normal[2], clipplanes[i].dist, 1.0f/32.0f, 256, &portaltemppoints[1][0][0], &numpoints, 0, NULL, NULL, NULL);
28                 if (numpoints < 3)
29                         return numpoints;
30                 memcpy(&portaltemppoints[0][0][0], &portaltemppoints[1][0][0], numpoints * 3 * sizeof(float));
31         }
32         if (numpoints > maxpoints)
33                 return -1;
34         memcpy(out, &portaltemppoints[0][0][0], numpoints * 3 * sizeof(float));
35         return numpoints;
36 }
37
38 static int Portal_RecursiveFlowSearch (mleaf_t *leaf, vec3_t eye, int firstclipplane, int numclipplanes)
39 {
40         mportal_t *p;
41         int newpoints, i, prev;
42         vec3_t center, v1, v2;
43         tinyplane_t *newplanes;
44
45         if (leaf->portalmarkid == portal_markid)
46                 return true;
47
48         // follow portals into other leafs
49         for (p = leaf->portals;p;p = p->next)
50         {
51                 // only flow through portals facing away from the viewer
52                 if (PlaneDiff(eye, (&p->plane)) < 0)
53                 {
54                         newpoints = Portal_PortalThroughPortalPlanes(&portalplanes[firstclipplane], numclipplanes, (float *) p->points, p->numpoints, &portaltemppoints2[0][0], 256);
55                         if (newpoints < 3)
56                                 continue;
57                         else if (firstclipplane + numclipplanes + newpoints > MAXRECURSIVEPORTALPLANES)
58                                 ranoutofportalplanes = true;
59                         else
60                         {
61                                 // find the center by averaging
62                                 VectorClear(center);
63                                 for (i = 0;i < newpoints;i++)
64                                         VectorAdd(center, portaltemppoints2[i], center);
65                                 // ixtable is a 1.0f / N table
66                                 VectorScale(center, ixtable[newpoints], center);
67                                 // calculate the planes, and make sure the polygon can see it's own center
68                                 newplanes = &portalplanes[firstclipplane + numclipplanes];
69                                 for (prev = newpoints - 1, i = 0;i < newpoints;prev = i, i++)
70                                 {
71                                         VectorSubtract(eye, portaltemppoints2[i], v1);
72                                         VectorSubtract(portaltemppoints2[prev], portaltemppoints2[i], v2);
73                                         CrossProduct(v1, v2, newplanes[i].normal);
74                                         VectorNormalize(newplanes[i].normal);
75                                         newplanes[i].dist = DotProduct(eye, newplanes[i].normal);
76                                         if (DotProduct(newplanes[i].normal, center) <= newplanes[i].dist)
77                                         {
78                                                 // polygon can't see it's own center, discard and use parent portal
79                                                 break;
80                                         }
81                                 }
82                                 if (i == newpoints)
83                                 {
84                                         if (Portal_RecursiveFlowSearch(p->past, eye, firstclipplane + numclipplanes, newpoints))
85                                                 return true;
86                                 }
87                                 else
88                                 {
89                                         if (Portal_RecursiveFlowSearch(p->past, eye, firstclipplane, numclipplanes))
90                                                 return true;
91                                 }
92                         }
93                 }
94         }
95
96         return false;
97 }
98
99 static void Portal_PolygonRecursiveMarkLeafs(mnode_t *node, float *polypoints, int numpoints)
100 {
101         int i, front;
102         float *p;
103
104 loc0:
105         if (!node->plane)
106         {
107                 ((mleaf_t *)node)->portalmarkid = portal_markid;
108                 return;
109         }
110
111         front = 0;
112         for (i = 0, p = polypoints;i < numpoints;i++, p += 3)
113         {
114                 if (DotProduct(p, node->plane->normal) > node->plane->dist)
115                         front++;
116         }
117         if (front > 0)
118         {
119                 if (front == numpoints)
120                 {
121                         node = node->children[0];
122                         goto loc0;
123                 }
124                 else
125                         Portal_PolygonRecursiveMarkLeafs(node->children[0], polypoints, numpoints);
126         }
127         node = node->children[1];
128         goto loc0;
129 }
130
131 int Portal_CheckPolygon(model_t *model, vec3_t eye, float *polypoints, int numpoints)
132 {
133         int i, prev, returnvalue;
134         mleaf_t *eyeleaf;
135         vec3_t center, v1, v2;
136
137         // if there is no model, it can not block visibility
138         if (model == NULL || !model->brush.PointInLeaf)
139                 return true;
140
141         portal_markid++;
142
143         Portal_PolygonRecursiveMarkLeafs(model->brush.data_nodes, polypoints, numpoints);
144
145         eyeleaf = model->brush.PointInLeaf(model, eye);
146
147         // find the center by averaging
148         VectorClear(center);
149         for (i = 0;i < numpoints;i++)
150                 VectorAdd(center, (&polypoints[i * 3]), center);
151         // ixtable is a 1.0f / N table
152         VectorScale(center, ixtable[numpoints], center);
153
154         // calculate the planes, and make sure the polygon can see it's own center
155         for (prev = numpoints - 1, i = 0;i < numpoints;prev = i, i++)
156         {
157                 VectorSubtract(eye, (&polypoints[i * 3]), v1);
158                 VectorSubtract((&polypoints[prev * 3]), (&polypoints[i * 3]), v2);
159                 CrossProduct(v1, v2, portalplanes[i].normal);
160                 VectorNormalize(portalplanes[i].normal);
161                 portalplanes[i].dist = DotProduct(eye, portalplanes[i].normal);
162                 if (DotProduct(portalplanes[i].normal, center) <= portalplanes[i].dist)
163                 {
164                         // polygon can't see it's own center, discard
165                         return false;
166                 }
167         }
168
169         ranoutofportalplanes = false;
170         ranoutofportals = false;
171
172         returnvalue = Portal_RecursiveFlowSearch(eyeleaf, eye, 0, numpoints);
173
174         if (ranoutofportalplanes)
175                 Con_Printf("Portal_RecursiveFlowSearch: ran out of %d plane stack when recursing through portals\n", MAXRECURSIVEPORTALPLANES);
176         if (ranoutofportals)
177                 Con_Printf("Portal_RecursiveFlowSearch: ran out of %d portal stack when recursing through portals\n", MAXRECURSIVEPORTALS);
178
179         return returnvalue;
180 }
181
182 #define Portal_MinsBoxPolygon(axis, axisvalue, x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) \
183 {\
184         if (eye[(axis)] < ((axisvalue) - 0.5f))\
185         {\
186                 boxpoints[ 0] = x1;boxpoints[ 1] = y1;boxpoints[ 2] = z1;\
187                 boxpoints[ 3] = x2;boxpoints[ 4] = y2;boxpoints[ 5] = z2;\
188                 boxpoints[ 6] = x3;boxpoints[ 7] = y3;boxpoints[ 8] = z3;\
189                 boxpoints[ 9] = x4;boxpoints[10] = y4;boxpoints[11] = z4;\
190                 if (Portal_CheckPolygon(model, eye, boxpoints, 4))\
191                         return true;\
192         }\
193 }
194
195 #define Portal_MaxsBoxPolygon(axis, axisvalue, x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) \
196 {\
197         if (eye[(axis)] > ((axisvalue) + 0.5f))\
198         {\
199                 boxpoints[ 0] = x1;boxpoints[ 1] = y1;boxpoints[ 2] = z1;\
200                 boxpoints[ 3] = x2;boxpoints[ 4] = y2;boxpoints[ 5] = z2;\
201                 boxpoints[ 6] = x3;boxpoints[ 7] = y3;boxpoints[ 8] = z3;\
202                 boxpoints[ 9] = x4;boxpoints[10] = y4;boxpoints[11] = z4;\
203                 if (Portal_CheckPolygon(model, eye, boxpoints, 4))\
204                         return true;\
205         }\
206 }
207
208 int Portal_CheckBox(model_t *model, vec3_t eye, vec3_t a, vec3_t b)
209 {
210         if (eye[0] >= (a[0] - 1.0f) && eye[0] < (b[0] + 1.0f)
211          && eye[1] >= (a[1] - 1.0f) && eye[1] < (b[1] + 1.0f)
212          && eye[2] >= (a[2] - 1.0f) && eye[2] < (b[2] + 1.0f))
213                 return true;
214
215         Portal_MinsBoxPolygon
216         (
217                 0, a[0],
218                 a[0], a[1], a[2],
219                 a[0], b[1], a[2],
220                 a[0], b[1], b[2],
221                 a[0], a[1], b[2]
222         );
223         Portal_MaxsBoxPolygon
224         (
225                 0, b[0],
226                 b[0], b[1], a[2],
227                 b[0], a[1], a[2],
228                 b[0], a[1], b[2],
229                 b[0], b[1], b[2]
230         );
231         Portal_MinsBoxPolygon
232         (
233                 1, a[1],
234                 b[0], a[1], a[2],
235                 a[0], a[1], a[2],
236                 a[0], a[1], b[2],
237                 b[0], a[1], b[2]
238         );
239         Portal_MaxsBoxPolygon
240         (
241                 1, b[1],
242                 a[0], b[1], a[2],
243                 b[0], b[1], a[2],
244                 b[0], b[1], b[2],
245                 a[0], b[1], b[2]
246         );
247         Portal_MinsBoxPolygon
248         (
249                 2, a[2],
250                 a[0], a[1], a[2],
251                 b[0], a[1], a[2],
252                 b[0], b[1], a[2],
253                 a[0], b[1], a[2]
254         );
255         Portal_MaxsBoxPolygon
256         (
257                 2, b[2],
258                 b[0], a[1], b[2],
259                 a[0], a[1], b[2],
260                 a[0], b[1], b[2],
261                 b[0], b[1], b[2]
262         );
263
264         return false;
265 }
266
267 typedef struct portalrecursioninfo_s
268 {
269         int exact;
270         int numfrustumplanes;
271         vec3_t boxmins;
272         vec3_t boxmaxs;
273         int numsurfaces;
274         int *surfacelist;
275         unsigned char *surfacepvs;
276         int numleafs;
277         int *leaflist;
278         unsigned char *leafpvs;
279         model_t *model;
280         vec3_t eye;
281         float *updateleafsmins;
282         float *updateleafsmaxs;
283 }
284 portalrecursioninfo_t;
285
286 static void Portal_RecursiveFlow (portalrecursioninfo_t *info, mleaf_t *leaf, int firstclipplane, int numclipplanes)
287 {
288         mportal_t *p;
289         int newpoints, i, prev;
290         float dist;
291         vec3_t center;
292         tinyplane_t *newplanes;
293
294         for (i = 0;i < 3;i++)
295         {
296                 if (info->updateleafsmins && info->updateleafsmins[i] > leaf->mins[i]) info->updateleafsmins[i] = leaf->mins[i];
297                 if (info->updateleafsmaxs && info->updateleafsmaxs[i] < leaf->maxs[i]) info->updateleafsmaxs[i] = leaf->maxs[i];
298         }
299
300
301         if (info->leafpvs)
302         {
303                 int leafindex = leaf - info->model->brush.data_leafs;
304                 if (!CHECKPVSBIT(info->leafpvs, leafindex))
305                 {
306                         SETPVSBIT(info->leafpvs, leafindex);
307                         info->leaflist[info->numleafs++] = leafindex;
308                 }
309         }
310
311         // mark surfaces in leaf that can be seen through portal
312         if (leaf->numleafsurfaces && info->surfacepvs)
313         {
314                 for (i = 0;i < leaf->numleafsurfaces;i++)
315                 {
316                         int surfaceindex = leaf->firstleafsurface[i];
317                         if (!CHECKPVSBIT(info->surfacepvs, surfaceindex))
318                         {
319                                 msurface_t *surface = info->model->data_surfaces + surfaceindex;
320                                 if (BoxesOverlap(surface->mins, surface->maxs, info->boxmins, info->boxmaxs))
321                                 {
322                                         if (info->exact)
323                                         {
324                                                 int j;
325                                                 const int *elements;
326                                                 const float *vertex3f;
327                                                 float v[9], trimins[3], trimaxs[3];
328                                                 vertex3f = info->model->surfmesh.data_vertex3f;
329                                                 elements = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle);
330                                                 for (j = 0;j < surface->num_triangles;j++, elements += 3)
331                                                 {
332                                                         VectorCopy(vertex3f + elements[0] * 3, v + 0);
333                                                         VectorCopy(vertex3f + elements[1] * 3, v + 3);
334                                                         VectorCopy(vertex3f + elements[2] * 3, v + 6);
335                                                         if (PointInfrontOfTriangle(info->eye, v + 0, v + 3, v + 6))
336                                                         {
337                                                                 trimins[0] = min(v[0], min(v[3], v[6]));
338                                                                 trimaxs[0] = max(v[0], max(v[3], v[6]));
339                                                                 trimins[1] = min(v[1], min(v[4], v[7]));
340                                                                 trimaxs[1] = max(v[1], max(v[4], v[7]));
341                                                                 trimins[2] = min(v[2], min(v[5], v[8]));
342                                                                 trimaxs[2] = max(v[2], max(v[5], v[8]));
343                                                                 if (BoxesOverlap(trimins, trimaxs, info->boxmins, info->boxmaxs) && Portal_PortalThroughPortalPlanes(&portalplanes[firstclipplane], numclipplanes, v, 3, &portaltemppoints2[0][0], 256) >= 3)
344                                                                 {
345                                                                         SETPVSBIT(info->surfacepvs, surfaceindex);
346                                                                         info->surfacelist[info->numsurfaces++] = surfaceindex;
347                                                                         break;
348                                                                 }
349                                                         }
350                                                 }
351                                         }
352                                         else
353                                         {
354                                                 SETPVSBIT(info->surfacepvs, surfaceindex);
355                                                 info->surfacelist[info->numsurfaces++] = surfaceindex;
356                                         }
357                                 }
358                         }
359                 }
360         }
361
362         // follow portals into other leafs
363         for (p = leaf->portals;p;p = p->next)
364         {
365                 // only flow through portals facing the viewer
366                 dist = PlaneDiff(info->eye, (&p->plane));
367                 if (dist < 0 && BoxesOverlap(p->past->mins, p->past->maxs, info->boxmins, info->boxmaxs))
368                 {
369                         newpoints = Portal_PortalThroughPortalPlanes(&portalplanes[firstclipplane], numclipplanes, (float *) p->points, p->numpoints, &portaltemppoints2[0][0], 256);
370                         if (newpoints < 3)
371                                 continue;
372                         else if (firstclipplane + numclipplanes + newpoints > MAXRECURSIVEPORTALPLANES)
373                                 ranoutofportalplanes = true;
374                         else
375                         {
376                                 // find the center by averaging
377                                 VectorClear(center);
378                                 for (i = 0;i < newpoints;i++)
379                                         VectorAdd(center, portaltemppoints2[i], center);
380                                 // ixtable is a 1.0f / N table
381                                 VectorScale(center, ixtable[newpoints], center);
382                                 // calculate the planes, and make sure the polygon can see its own center
383                                 newplanes = &portalplanes[firstclipplane + numclipplanes];
384                                 for (prev = newpoints - 1, i = 0;i < newpoints;prev = i, i++)
385                                 {
386                                         TriangleNormal(portaltemppoints2[prev], portaltemppoints2[i], info->eye, newplanes[i].normal);
387                                         VectorNormalize(newplanes[i].normal);
388                                         newplanes[i].dist = DotProduct(info->eye, newplanes[i].normal);
389                                         if (DotProduct(newplanes[i].normal, center) <= newplanes[i].dist)
390                                         {
391                                                 // polygon can't see its own center, discard and use parent portal
392                                                 break;
393                                         }
394                                 }
395                                 if (i == newpoints)
396                                         Portal_RecursiveFlow(info, p->past, firstclipplane + numclipplanes, newpoints);
397                                 else
398                                         Portal_RecursiveFlow(info, p->past, firstclipplane, numclipplanes);
399                         }
400                 }
401         }
402 }
403
404 static void Portal_RecursiveFindLeafForFlow(portalrecursioninfo_t *info, mnode_t *node)
405 {
406         if (node->plane)
407         {
408                 float f = DotProduct(info->eye, node->plane->normal) - node->plane->dist;
409                 if (f > -0.1)
410                         Portal_RecursiveFindLeafForFlow(info, node->children[0]);
411                 if (f < 0.1)
412                         Portal_RecursiveFindLeafForFlow(info, node->children[1]);
413         }
414         else
415         {
416                 mleaf_t *leaf = (mleaf_t *)node;
417                 if (leaf->clusterindex >= 0)
418                         Portal_RecursiveFlow(info, leaf, 0, info->numfrustumplanes);
419         }
420 }
421
422 void Portal_Visibility(model_t *model, const vec3_t eye, int *leaflist, unsigned char *leafpvs, int *numleafspointer, int *surfacelist, unsigned char *surfacepvs, int *numsurfacespointer, const mplane_t *frustumplanes, int numfrustumplanes, int exact, const float *boxmins, const float *boxmaxs, float *updateleafsmins, float *updateleafsmaxs)
423 {
424         int i;
425         portalrecursioninfo_t info;
426
427         // if there is no model, it can not block visibility
428         if (model == NULL)
429         {
430                 Con_Print("Portal_Visibility: NULL model\n");
431                 return;
432         }
433
434         if (!model->brush.data_nodes)
435         {
436                 Con_Print("Portal_Visibility: not a brush model\n");
437                 return;
438         }
439
440         // put frustum planes (if any) into tinyplane format at start of buffer
441         for (i = 0;i < numfrustumplanes;i++)
442         {
443                 VectorCopy(frustumplanes[i].normal, portalplanes[i].normal);
444                 portalplanes[i].dist = frustumplanes[i].dist;
445         }
446
447         ranoutofportalplanes = false;
448         ranoutofportals = false;
449
450         VectorCopy(boxmins, info.boxmins);
451         VectorCopy(boxmaxs, info.boxmaxs);
452         info.exact = exact;
453         info.numsurfaces = 0;
454         info.surfacelist = surfacelist;
455         info.surfacepvs = surfacepvs;
456         info.numleafs = 0;
457         info.leaflist = leaflist;
458         info.leafpvs = leafpvs;
459         info.model = model;
460         VectorCopy(eye, info.eye);
461         info.numfrustumplanes = numfrustumplanes;
462         info.updateleafsmins = updateleafsmins;
463         info.updateleafsmaxs = updateleafsmaxs;
464
465         Portal_RecursiveFindLeafForFlow(&info, model->brush.data_nodes);
466
467         if (ranoutofportalplanes)
468                 Con_Printf("Portal_RecursiveFlow: ran out of %d plane stack when recursing through portals\n", MAXRECURSIVEPORTALPLANES);
469         if (ranoutofportals)
470                 Con_Printf("Portal_RecursiveFlow: ran out of %d portal stack when recursing through portals\n", MAXRECURSIVEPORTALS);
471         if (numsurfacespointer)
472                 *numsurfacespointer = info.numsurfaces;
473         if (numleafspointer)
474                 *numleafspointer = info.numleafs;
475 }
476