u32 _h = HASH_FN(v, id, id##_KEY((node))); \
HASH_TYPE(v) *_n, **_nn = (v).data + _h; \
\
- log(L_WARN "hash: %u", _h); \
- \
while ((*_nn) && (*_nn != (node))) \
- { \
- log(L_WARN "_nn: %p", *_nn); \
_nn = &(id##_NEXT((*_nn))); \
- } \
\
if (_n = *_nn) \
- { \
- log(L_WARN "Success %p", _n); \
HASH_DO_REMOVE(v,id,_nn); \
- } \
_n; \
})
}
if (node->bucket == NULL)
- {
node->bucket = node->parent->bucket;
- }
for (int i = 0; i < 2; i++)
{
}
if (node->child[0])
- {
first_pass_new(node->child[0], trie_slab);
- log("Entering first pass with node %p", node->child[0]);
- }
if (node->child[1])
- {
first_pass_new(node->child[1], trie_slab);
- log("Entering first pass with node %p", node->child[1]);
- }
node->bucket = NULL;
}