Function raxRecursiveFree

rax.c:1469–1494

This is the core of raxFree(): performs a depth-first scan of the * tree and releases all the nodes found. */

/* This is the core of raxFree(): performs a depth-first scan of the
 * tree and releases all the nodes found. */
void raxRecursiveFree(rax *rax, raxNode *n, void (*free_callback)(void*)) {
    debugnode("free traversing",n);
    int numchildren = n->iscompr ? 1 : n->size;
    raxNode **cp = raxNodeLastChildPtr(n);
    while(numchildren--) {
        if (raxIsInlineLeaf(n,numchildren)) {
            /* Inline leaf: the slot contains a value, not a node pointer.
             * Call the free callback on the value but don't recurse. */
            if (free_callback) {
                void *val;
                memcpy(&val,cp,sizeof(val));
                if (val != NULL) free_callback(val);
            }
        } else {
            raxNode *child;
            memcpy(&child,cp,sizeof(child));
            raxRecursiveFree(rax,child,free_callback);
        }
        cp--;
    }
    debugnode("free depth-first",n);
    if (free_callback && n->iskey && !n->isnull)
        free_callback(raxGetData(n));
    rax_free(n);
    rax->numnodes--;
}

/* Free a whole radix tree, calling the specified callback in order to
 * free the auxiliary data. */