Function raxDefragNext

rax.c:2436–2514

Return the next node or data pointer in the defragmentation walk. * Return 1 if a new item was returned, 0 if the scan is finished or if * an out of memory error happened while extending the iterator state. * * The walk is preorder over the real nodes of the radix tree. Every node is * returned first as a NODE item. If the node also represents a key with * non-NULL associated data, the same

 * Inline leaves are returned only as DATA items, since there is no standalone
 * node allocation to relocate for them. */
int raxDefragNext(raxDefragIterator *it) {
    raxDefragFrame *frame;

    if (it->eof) return 0;
    if (it->pending_todel) {
        raxDefragDelChars(it,it->pending_todel);
        it->pending_todel = 0;
    }

    while((frame = raxDefragStackPeek(it)) != NULL) {
        raxNode *node = frame->node;
        int numchildren = node->iscompr ? 1 : node->size;

        if (frame->state == RAX_DEFRAG_STATE_EMIT_NODE) {
            frame->state = RAX_DEFRAG_STATE_EMIT_DATA;
            it->kind = RAX_DEFRAG_NODE;
            it->flags = raxDefragNodeFlags(it,node);
            it->size = raxNodeCurrentLength(node);
            it->ptr = node;
            it->node = node;
            it->node_child = frame->parent_child;
            return 1;
        } else if (frame->state == RAX_DEFRAG_STATE_EMIT_DATA) {
            frame->state = RAX_DEFRAG_STATE_CHILDREN;
            if (node->iskey && !node->isnull) {
                it->kind = RAX_DEFRAG_DATA;
                it->flags = raxDefragNodeFlags(it,node);
                it->size = 0;
                it->ptr = raxGetData(node);
                it->node = node;
                it->node_child = frame->parent_child;
                return 1;
            }
        } else {
            if (frame->child == (size_t)numchildren) {
                raxDefragStackPop(it);
                if (it->items == 0) {
                    it->eof = 1;
                    return 0;
                }
                raxNode *parent = raxDefragStackPeek(it)->node;
                raxDefragDelChars(it,parent->iscompr ? parent->size : 1);
                continue;
            }

            int childidx = frame->child++;
            raxNode **childfield = raxNodeFirstChildPtr(node)+childidx;
            size_t addlen = node->iscompr ? node->size : 1;
            unsigned char *s = node->iscompr ? node->data : node->data+childidx;

            if (raxIsInlineLeaf(node,childidx)) {
                void *value;
                memcpy(&value,childfield,sizeof(value));
                if (value == NULL) continue;
                if (!raxDefragAddChars(it,s,addlen)) return 0;
                it->pending_todel = addlen;
                it->kind = RAX_DEFRAG_DATA;
                it->flags = RAX_DEFRAG_F_KEY|RAX_DEFRAG_F_INLINE_DATA|