struct vlist_node *node, *tmp;
avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
- if (node->version == tree->version)
+ if ((node->version == tree->version || node->version == -1) &&
+ tree->version != -1)
continue;
vlist_delete(tree, node);
void
vlist_flush_all(struct vlist_tree *tree)
{
- tree->version++;
+ tree->version = -1;
vlist_flush(tree);
}
struct vlist_simple_node *n, *tmp;
list_for_each_entry_safe(n, tmp, &tree->list, list) {
- if (n->version == tree->version)
+ if ((n->version == tree->version || n->version == -1) &&
+ tree->version != -1)
continue;
vlist_simple_delete(tree, n);
void
vlist_simple_flush_all(struct vlist_simple_tree *tree)
{
- tree->version++;
+ tree->version = -1;
vlist_simple_flush(tree);
}