utils.c

   1 #include <string.h>
   2 #include "utils.h"
   3
   4 int
   5 avl_strcmp(const void *k1, const void *k2, void *ptr)
   6 {
   7         return strcmp(k1, k2);
   8 }
   9
  10 void
  11 __vlist_init(struct vlist_tree *tree, avl_tree_comp cmp,
  12              vlist_update_cb update, int offset)
  13 {
  14         tree->key_offset = offset;
  15         tree->update = update;
  16         tree->version = 1;
  17
  18         avl_init(&tree->avl, cmp, 0, tree);
  19 }
  20
  21 void
  22 vlist_delete(struct vlist_tree *tree, struct vlist_node *node)
  23 {
  24         if (!tree->no_delete)
  25                 avl_delete(&tree->avl, &node->avl);
  26         tree->update(tree, NULL, node);
  27 }
  28
  29 void
  30 vlist_add(struct vlist_tree *tree, struct vlist_node *node)
  31 {
  32         struct vlist_node *old_node = NULL;
  33         struct avl_node *anode;
  34         void *key = (char *) node + tree->key_offset;
  35
  36         node->avl.key = key;
  37         node->version = tree->version;
  38
  39         anode = avl_find(&tree->avl, key);
  40         if (anode) {
  41                 old_node = container_of(anode, struct vlist_node, avl);
  42                 if (tree->keep_old || !tree->no_delete)
  43                         goto update_only;
  44
  45                 avl_delete(&tree->avl, anode);
  46         }
  47
  48         avl_insert(&tree->avl, &node->avl);
  49
  50 update_only:
  51         tree->update(tree, node, old_node);
  52 }
  53
  54 void
  55 vlist_flush(struct vlist_tree *tree)
  56 {
  57         struct vlist_node *node, *tmp;
  58
  59         avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
  60                 if (node->version == tree->version)
  61                         continue;
  62
  63                 vlist_delete(tree, node);
  64         }
  65 }
  66
  67 void
  68 vlist_flush_all(struct vlist_tree *tree)
  69 {
  70         tree->version++;
  71         vlist_flush(tree);
  72 }