portals.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
int	Portal_CheckBox (model_t *model, vec3_t eye, vec3_t a, vec3_t b)
int	Portal_CheckPolygon (model_t *model, vec3_t eye, float *polypoints, int numpoints)
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)

Function Documentation

Portal_CheckBox()

int Portal_CheckBox	(	model_t *	model,
		vec3_t	eye,
		vec3_t	a,
		vec3_t	b )

Definition at line 208 of file portals.c.

{
    if (eye[0] >= (a[0] - 1.0f) && eye[0] < (b[0] + 1.0f)
     && eye[1] >= (a[1] - 1.0f) && eye[1] < (b[1] + 1.0f)
     && eye[2] >= (a[2] - 1.0f) && eye[2] < (b[2] + 1.0f))
        return true;
 
    Portal_MinsBoxPolygon
    (
        0, a[0],
        a[0], a[1], a[2],
        a[0], b[1], a[2],
        a[0], b[1], b[2],
        a[0], a[1], b[2]
    );
    Portal_MaxsBoxPolygon
    (
        0, b[0],
        b[0], b[1], a[2],
        b[0], a[1], a[2],
        b[0], a[1], b[2],
        b[0], b[1], b[2]
    );
    Portal_MinsBoxPolygon
    (
        1, a[1],
        b[0], a[1], a[2],
        a[0], a[1], a[2],
        a[0], a[1], b[2],
        b[0], a[1], b[2]
    );
    Portal_MaxsBoxPolygon
    (
        1, b[1],
        a[0], b[1], a[2],
        b[0], b[1], a[2],
        b[0], b[1], b[2],
        a[0], b[1], b[2]
    );
    Portal_MinsBoxPolygon
    (
        2, a[2],
        a[0], a[1], a[2],
        b[0], a[1], a[2],
        b[0], b[1], a[2],
        a[0], b[1], a[2]
    );
    Portal_MaxsBoxPolygon
    (
        2, b[2],
        b[0], a[1], b[2],
        a[0], a[1], b[2],
        a[0], b[1], b[2],
        b[0], b[1], b[2]
    );
 
    return false;
}

References a, b, Portal_MaxsBoxPolygon, and Portal_MinsBoxPolygon.

Portal_CheckPolygon()

int Portal_CheckPolygon	(	model_t *	model,
		vec3_t	eye,
		float *	polypoints,
		int	numpoints )

Definition at line 131 of file portals.c.

{
    int i, prev, returnvalue;
    mleaf_t *eyeleaf;
    vec3_t center, v1, v2;
 
    // if there is no model, it can not block visibility
    if (model == NULL || !model->brush.PointInLeaf)
        return true;
 
    portal_markid++;
 
    Portal_PolygonRecursiveMarkLeafs(model->brush.data_nodes, polypoints, numpoints);
 
    eyeleaf = model->brush.PointInLeaf(model, eye);
 
    // find the center by averaging
    VectorClear(center);
    for (i = 0;i < numpoints;i++)
        VectorAdd(center, (&polypoints[i * 3]), center);
    // ixtable is a 1.0f / N table
    VectorScale(center, ixtable[numpoints], center);
 
    // calculate the planes, and make sure the polygon can see it's own center
    for (prev = numpoints - 1, i = 0;i < numpoints;prev = i, i++)
    {
        VectorSubtract(eye, (&polypoints[i * 3]), v1);
        VectorSubtract((&polypoints[prev * 3]), (&polypoints[i * 3]), v2);
        CrossProduct(v1, v2, portalplanes[i].normal);
        VectorNormalize(portalplanes[i].normal);
        portalplanes[i].dist = DotProduct(eye, portalplanes[i].normal);
        if (DotProduct(portalplanes[i].normal, center) <= portalplanes[i].dist)
        {
            // polygon can't see it's own center, discard
            return false;
        }
    }
 
    ranoutofportalplanes = false;
    ranoutofportals = false;
 
    returnvalue = Portal_RecursiveFlowSearch(eyeleaf, eye, 0, numpoints);
 
    if (ranoutofportalplanes)
        Con_Printf("Portal_RecursiveFlowSearch: ran out of %d plane stack when recursing through portals\n", MAXRECURSIVEPORTALPLANES);
    if (ranoutofportals)
        Con_Printf("Portal_RecursiveFlowSearch: ran out of %d portal stack when recursing through portals\n", MAXRECURSIVEPORTALS);
 
    return returnvalue;
}

References Con_Printf(), CrossProduct, tinyplane_t::dist, DotProduct, i, ixtable, MAXRECURSIVEPORTALPLANES, MAXRECURSIVEPORTALS, model, normal, NULL, portal_markid, Portal_PolygonRecursiveMarkLeafs(), Portal_RecursiveFlowSearch(), portalplanes, ranoutofportalplanes, ranoutofportals, v1, v2, VectorAdd, VectorClear, VectorNormalize, VectorScale, and VectorSubtract.

Portal_Visibility()

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 )

Definition at line 423 of file portals.c.

{
    int i;
    portalrecursioninfo_t info;
 
    // if there is no model, it can not block visibility
    if (model == NULL)
    {
        Con_Print("Portal_Visibility: NULL model\n");
        return;
    }
 
    if (!model->brush.data_nodes)
    {
        Con_Print("Portal_Visibility: not a brush model\n");
        return;
    }
 
    // put frustum planes (if any) into tinyplane format at start of buffer
    for (i = 0;i < numfrustumplanes;i++)
    {
        VectorCopy(frustumplanes[i].normal, portalplanes[i].normal);
        portalplanes[i].dist = frustumplanes[i].dist;
    }
 
    ranoutofportalplanes = false;
    ranoutofportals = false;
 
    VectorCopy(boxmins, info.boxmins);
    VectorCopy(boxmaxs, info.boxmaxs);
    info.exact = exact;
    info.numsurfaces = 0;
    info.surfacelist = surfacelist;
    info.surfacepvs = surfacepvs;
    info.numleafs = 0;
    info.visitingleafpvs = visitingleafpvs;
    info.leaflist = leaflist;
    info.leafpvs = leafpvs;
    info.model = model;
    VectorCopy(eye, info.eye);
    info.numfrustumplanes = numfrustumplanes;
    info.updateleafsmins = updateleafsmins;
    info.updateleafsmaxs = updateleafsmaxs;
    info.shadowtrispvs = shadowtrispvs;
    info.lighttrispvs = lighttrispvs;
 
    Portal_RecursiveFindLeafForFlow(&info, model->brush.data_nodes);
 
    if (ranoutofportalplanes)
        Con_Printf("Portal_RecursiveFlow: ran out of %d plane stack when recursing through portals\n", MAXRECURSIVEPORTALPLANES);
    if (ranoutofportals)
        Con_Printf("Portal_RecursiveFlow: ran out of %d portal stack when recursing through portals\n", MAXRECURSIVEPORTALS);
    if (numsurfacespointer)
        *numsurfacespointer = info.numsurfaces;
    if (numleafspointer)
        *numleafspointer = info.numleafs;
}

References portalrecursioninfo_t::boxmaxs, portalrecursioninfo_t::boxmins, Con_Print(), Con_Printf(), mplane_t::dist, tinyplane_t::dist, portalrecursioninfo_t::exact, portalrecursioninfo_t::eye, i, portalrecursioninfo_t::leaflist, portalrecursioninfo_t::leafpvs, portalrecursioninfo_t::lighttrispvs, MAXRECURSIVEPORTALPLANES, MAXRECURSIVEPORTALS, model, portalrecursioninfo_t::model, normal, NULL, portalrecursioninfo_t::numfrustumplanes, portalrecursioninfo_t::numleafs, portalrecursioninfo_t::numsurfaces, Portal_RecursiveFindLeafForFlow(), portalplanes, ranoutofportalplanes, ranoutofportals, portalrecursioninfo_t::shadowtrispvs, portalrecursioninfo_t::surfacelist, portalrecursioninfo_t::surfacepvs, portalrecursioninfo_t::updateleafsmaxs, portalrecursioninfo_t::updateleafsmins, VectorCopy, and portalrecursioninfo_t::visitingleafpvs.

Referenced by R_Mod_GetLightInfo().