#include <../ldlm/interval_tree.c>
#define dprintf(fmt, args...) //printf(fmt, ##args)
#include <../ldlm/interval_tree.c>
#define dprintf(fmt, args...) //printf(fmt, ##args)
__F(&n->node.in_extent));
interval_erase(&n->node, &root);
n->valid = 0;
__F(&n->node.in_extent));
interval_erase(&n->node, &root);
n->valid = 0;
dprintf("Adding a node "__S"\n",
__F(&n->node.in_extent));
n->valid = 1;
dprintf("Adding a node "__S"\n",
__F(&n->node.in_extent));
n->valid = 1;