X-Git-Url: http://git.xonotic.org/?p=xonotic%2Fdarkplaces.git;a=blobdiff_plain;f=portals.c;h=e831466a6fc98a8e57754da2ba00e74afa0603e5;hp=2f7fa32ee9f9e5739601ca6785f845d59950436a;hb=4d34e0a632cbc401712f46e10bb9864438b0881f;hpb=f97ea4ccdc26e5c6a416a3bbd9e7db2430421928 diff --git a/portals.c b/portals.c index 2f7fa32e..e831466a 100644 --- a/portals.c +++ b/portals.c @@ -1,6 +1,7 @@ #include "quakedef.h" #include "polygon.h" +#include "portals.h" #define MAXRECURSIVEPORTALPLANES 1024 #define MAXRECURSIVEPORTALS 256 @@ -273,6 +274,7 @@ typedef struct portalrecursioninfo_s int *surfacelist; unsigned char *surfacepvs; int numleafs; + unsigned char *visitingleafpvs; // used to prevent infinite loops int *leaflist; unsigned char *leafpvs; unsigned char *shadowtrispvs; @@ -291,6 +293,12 @@ static void Portal_RecursiveFlow (portalrecursioninfo_t *info, mleaf_t *leaf, in float dist; vec3_t center; tinyplane_t *newplanes; + int leafindex = leaf - info->model->brush.data_leafs; + + if (CHECKPVSBIT(info->visitingleafpvs, leafindex)) + return; // recursive loop of leafs (cmc.bsp for megatf coop) + + SETPVSBIT(info->visitingleafpvs, leafindex); for (i = 0;i < 3;i++) { @@ -301,7 +309,6 @@ static void Portal_RecursiveFlow (portalrecursioninfo_t *info, mleaf_t *leaf, in if (info->leafpvs) { - int leafindex = leaf - info->model->brush.data_leafs; if (!CHECKPVSBIT(info->leafpvs, leafindex)) { SETPVSBIT(info->leafpvs, leafindex); @@ -318,8 +325,8 @@ static void Portal_RecursiveFlow (portalrecursioninfo_t *info, mleaf_t *leaf, in msurface_t *surface = info->model->data_surfaces + surfaceindex; if (BoxesOverlap(surface->mins, surface->maxs, info->boxmins, info->boxmaxs)) { - qboolean insidebox = BoxInsideBox(surface->mins, surface->maxs, info->boxmins, info->boxmaxs); - qboolean addedtris = false; + qbool insidebox = BoxInsideBox(surface->mins, surface->maxs, info->boxmins, info->boxmaxs); + qbool addedtris = false; int t, tend; const int *elements; const float *vertex3f; @@ -332,7 +339,7 @@ static void Portal_RecursiveFlow (portalrecursioninfo_t *info, mleaf_t *leaf, in VectorCopy(vertex3f + elements[1] * 3, v + 3); VectorCopy(vertex3f + elements[2] * 3, v + 6); if (PointInfrontOfTriangle(info->eye, v + 0, v + 3, v + 6) - && (insidebox || TriangleOverlapsBox(v, v + 3, v + 6, info->boxmins, info->boxmaxs)) + && (insidebox || TriangleBBoxOverlapsBox(v, v + 3, v + 6, info->boxmins, info->boxmaxs)) && (!info->exact || Portal_PortalThroughPortalPlanes(&portalplanes[firstclipplane], numclipplanes, v, 3, &portaltemppoints2[0][0], 256) > 0)) { addedtris = true; @@ -391,6 +398,8 @@ static void Portal_RecursiveFlow (portalrecursioninfo_t *info, mleaf_t *leaf, in } } } + + CLEARPVSBIT(info->visitingleafpvs, leafindex); } static void Portal_RecursiveFindLeafForFlow(portalrecursioninfo_t *info, mnode_t *node) @@ -411,7 +420,7 @@ static void Portal_RecursiveFindLeafForFlow(portalrecursioninfo_t *info, mnode_t } } -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, unsigned char *shadowtrispvs, unsigned char *lighttrispvs) +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, unsigned char *shadowtrispvs, unsigned char *lighttrispvs, unsigned char *visitingleafpvs) { int i; portalrecursioninfo_t info; @@ -446,6 +455,7 @@ void Portal_Visibility(model_t *model, const vec3_t eye, int *leaflist, unsigned info.surfacelist = surfacelist; info.surfacepvs = surfacepvs; info.numleafs = 0; + info.visitingleafpvs = visitingleafpvs; info.leaflist = leaflist; info.leafpvs = leafpvs; info.model = model;