Function xClumpColl_ForAllLineLeafNodeIntersections

src/SB/Core/x/xClumpColl.cpp:124–373

}

xClumpCollBSPTree*
xClumpColl_ForAllLineLeafNodeIntersections(xClumpCollBSPTree* tree, RwLine* line,
                                           xClumpCollV3dGradient* grad,
                                           xClumpCollIntersectionCallback callBack, void* data)
{
    S32 nStack;
    nodeInfo nodeStack[33];
    nodeInfo node;
    RwLine lineStack[33];
    RwLine currLine;

    node.type = tree->branchNodes ? 2 : 1;
    node.index = 0;
    currLine = *line;
    nStack = 0;

    while (nStack >= 0)
    {
        if (node.type == 1)
        {
            xClumpCollBSPTriangle* tris = tree->triangles + node.index;
            if (!callBack(tris, data))
                return NULL;

            node = nodeStack[nStack];
            currLine = lineStack[nStack];
            nStack--;
        }
        else
        {
            RwSplitBits lStart, lEnd, rStart, rEnd;
            xClumpCollBSPBranchNode* branch = tree->branchNodes + node.index;

            lStart.nReal =
                *(RwReal*)((U8*)&currLine.start + (branch->leftInfo & 0xC)) - branch->leftValue;
            lEnd.nReal =
                *(RwReal*)((U8*)&currLine.end + (branch->leftInfo & 0xC)) - branch->leftValue;
            rStart.nReal =
                *(RwReal*)((U8*)&currLine.start + (branch->leftInfo & 0xC)) - branch->rightValue;
            rEnd.nReal =
                *(RwReal*)((U8*)&currLine.end + (branch->leftInfo & 0xC)) - branch->rightValue;

            if (rStart.nInt < 0 && rEnd.nInt < 0)
            {
                node.type = branch->leftInfo & 0x3;
                node.index = branch->leftInfo >> 12;
            }
            else if (lStart.nInt >= 0 && lEnd.nInt >= 0)
            {
                node.type = branch->rightInfo & 0x3;
                node.index = branch->rightInfo >> 12;
            }
            else if (!((lStart.nInt ^ lEnd.nInt) & 0x80000000) &&
                     !((rStart.nInt ^ rEnd.nInt) & 0x80000000))
            {
                if (rStart.nInt < rEnd.nInt)
                {
                    nStack++;