- if (!tree->no_delete)
- avl_delete(&tree->avl, &node->avl);
- tree->update(tree, NULL, node);
+ struct vlist_simple_node *n, *tmp;
+
+ list_for_each_entry_safe(n, tmp, &tree->list, list) {
+ if ((n->version == tree->version || n->version == -1) &&
+ tree->version != -1)
+ continue;
+
+ vlist_simple_delete(tree, n);
+ }
+}
+
+void
+vlist_simple_replace(struct vlist_simple_tree *dest, struct vlist_simple_tree *old)
+{
+ struct vlist_simple_node *n, *tmp;
+
+ vlist_simple_update(dest);
+ list_for_each_entry_safe(n, tmp, &old->list, list) {
+ list_del(&n->list);
+ vlist_simple_add(dest, n);
+ }
+ vlist_simple_flush(dest);