INNER CODE UNIT · C
front
xonotic/darkplaces · bih.c:121
front = numchildren - back;
}
// we now have front and back children divided in leaflist...
node->type = (bih_nodetype_t)((int)BIH_SPLITX + axis);
node->front = BIH_BuildNode(bih, front, leaflist, frontmins, frontmaxs);
node->frontmin = frontmins[axis];
node->back = BIH_BuildNode(bih, back, leaflist + front, backmins, backmaxs);
node->backmax = backmaxs[axis];
return nodenum;
}
int BIH_Build(bih_t *bih, int numleafs, bih_leaf_t *leafs, int maxnodes, bih_node_t *nodes, int *temp_leafsort, int *temp_leafsortscratch)
{
int i;
memset(bih, 0, sizeof(*bih));
bih->numleafs = numleafs;