#include "curves.h"
#include "wad.h"
+#include <assert.h>
//cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128", "how large water polygons should be (smaller values produce more polygons which give better warping effects)"};
cvar_t mod_bsp_portalize = {0, "mod_bsp_portalize", "1", "enables portal generation from BSP tree (may take several seconds per map), used by r_drawportals, r_useportalculling, r_shadow_realtime_world_compileportalculling, sv_cullentities_portal"};
{
nodenum = nodestack[--nodestackpos];
node = bih->nodes + nodenum;
+ assert(node->type <= BIH_UNORDERED);
#if 1
if (!BoxesOverlap(start, start, node->mins, node->maxs))
continue;
#endif
- if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
+ if (node->type != BIH_UNORDERED)
{
+ if(nodestackpos > 1024 - 2)
+ //Out of stack
+ continue;
axis = node->type - BIH_SPLITX;
if (start[axis] >= node->frontmin)
nodestack[nodestackpos++] = node->front;
if (start[axis] <= node->backmax)
nodestack[nodestackpos++] = node->back;
}
- else if (node->type == BIH_UNORDERED)
+ else
{
for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
{
sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + 1;
if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs) && !collision_bih_fullrecursion.integer)
continue;
- if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
+ assert(node->type <= BIH_UNORDERED);
+ if (node->type != BIH_UNORDERED)
{
+ if(nodestackpos > 1024 - 2)
+ //Out of stack
+ continue;
// recurse children of the split
axis = node->type - BIH_SPLITX;
d1 = node->backmax - nodestart[axis];
break;
}
}
- else if (node->type == BIH_UNORDERED)
+ else
{
// calculate sweep bounds for this node
// copy node bounds into local variables
sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2] + 1;
if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
continue;
- if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
+ assert(node->type <= BIH_UNORDERED);
+ if (node->type != BIH_UNORDERED)
{
+ if(nodestackpos > 1024 - 2)
+ //Out of stack
+ continue;
// recurse children of the split
axis = node->type - BIH_SPLITX;
d1 = node->backmax - nodestart[axis] - mins[axis];
break;
}
}
- else if (node->type == BIH_UNORDERED)
+ else
{
// calculate sweep bounds for this node
// copy node bounds into local variables and expand to get Minkowski Sum of the two shapes