15f0525941b9b31792dc3a467f720cea7e1f9df2
5 avl_strcmp(const void *k1
, const void *k2
, void *ptr
)
11 vlist_cmp(const void *k1
, const void *k2
, void *ptr
)
13 struct vlist_tree
*vl
= ptr
;
14 return memcmp(k1
, k2
, vl
->data_len
);
18 __vlist_init(struct vlist_tree
*tree
, vlist_update_cb update
, int offset
, int len
)
20 tree
->data_offset
= offset
;
22 tree
->update
= update
;
25 avl_init(&tree
->avl
, vlist_cmp
, 0, tree
);
29 vlist_delete(struct vlist_tree
*tree
, struct vlist_node
*node
)
31 avl_delete(&tree
->avl
, &node
->avl
);
32 tree
->update(tree
, NULL
, node
);
36 vlist_add(struct vlist_tree
*tree
, struct vlist_node
*node
)
38 struct vlist_node
*old_node
= NULL
;
39 struct avl_node
*anode
;
41 node
->avl
.key
= (char *) node
+ tree
->data_offset
;
42 node
->version
= tree
->version
;
44 anode
= avl_find(&tree
->avl
, (char *) node
+ tree
->data_offset
);
46 old_node
= container_of(anode
, struct vlist_node
, avl
);
47 avl_delete(&tree
->avl
, anode
);
50 avl_insert(&tree
->avl
, &node
->avl
);
51 tree
->update(tree
, node
, old_node
);
55 vlist_flush(struct vlist_tree
*tree
)
57 struct vlist_node
*node
, *tmp
;
59 avl_for_each_element_safe(&tree
->avl
, node
, avl
, tmp
) {
60 if (node
->version
== tree
->version
)
63 vlist_delete(tree
, node
);
68 vlist_flush_all(struct vlist_tree
*tree
)