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->node_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         avl_delete(&tree->avl, &node->avl);
  25         tree->update(tree, NULL, node);
  26 }
  27
  28 void
  29 vlist_add(struct vlist_tree *tree, struct vlist_node *node)
  30 {
  31         struct vlist_node *old_node = NULL;
  32         struct avl_node *anode;
  33         void *key = (char *) node - tree->node_offset;
  34
  35         node->avl.key = key;
  36         node->version = tree->version;
  37
  38         anode = avl_find(&tree->avl, key);
  39         if (anode) {
  40                 old_node = container_of(anode, struct vlist_node, avl);
  41                 avl_delete(&tree->avl, anode);
  42         }
  43
  44         avl_insert(&tree->avl, &node->avl);
  45         tree->update(tree, node, old_node);
  46 }
  47
  48 void
  49 vlist_flush(struct vlist_tree *tree)
  50 {
  51         struct vlist_node *node, *tmp;
  52
  53         avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
  54                 if (node->version == tree->version)
  55                         continue;
  56
  57                 vlist_delete(tree, node);
  58         }
  59 }
  60
  61 void
  62 vlist_flush_all(struct vlist_tree *tree)
  63 {
  64         tree->version++;
  65         vlist_flush(tree);
  66 }