utils.c

   1 /*
   2  * netifd - network interface daemon
   3  * Copyright (C) 2012 Felix Fietkau <nbd@openwrt.org>
   4  *
   5  * This program is free software; you can redistribute it and/or modify
   6  * it under the terms of the GNU General Public License version 2
   7  * as published by the Free Software Foundation
   8  *
   9  * This program is distributed in the hope that it will be useful,
  10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12  * GNU General Public License for more details.
  13  */
  14 #include <string.h>
  15 #include <stdlib.h>
  16 #include "utils.h"
  17
  18 int
  19 avl_strcmp(const void *k1, const void *k2, void *ptr)
  20 {
  21         return strcmp(k1, k2);
  22 }
  23
  24 void
  25 vlist_init(struct vlist_tree *tree, avl_tree_comp cmp, vlist_update_cb update)
  26 {
  27         tree->update = update;
  28         tree->version = 1;
  29
  30         avl_init(&tree->avl, cmp, 0, tree);
  31 }
  32
  33 void
  34 vlist_delete(struct vlist_tree *tree, struct vlist_node *node)
  35 {
  36         if (!tree->no_delete)
  37                 avl_delete(&tree->avl, &node->avl);
  38         tree->update(tree, NULL, node);
  39 }
  40
  41 void
  42 vlist_add(struct vlist_tree *tree, struct vlist_node *node, void *key)
  43 {
  44         struct vlist_node *old_node = NULL;
  45         struct avl_node *anode;
  46
  47         node->avl.key = key;
  48         node->version = tree->version;
  49
  50         anode = avl_find(&tree->avl, key);
  51         if (anode) {
  52                 old_node = container_of(anode, struct vlist_node, avl);
  53                 if (tree->keep_old || tree->no_delete) {
  54                         old_node->version = tree->version;
  55                         goto update_only;
  56                 }
  57
  58                 avl_delete(&tree->avl, anode);
  59         }
  60
  61         avl_insert(&tree->avl, &node->avl);
  62
  63 update_only:
  64         tree->update(tree, node, old_node);
  65 }
  66
  67 void
  68 vlist_flush(struct vlist_tree *tree)
  69 {
  70         struct vlist_node *node, *tmp;
  71
  72         avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
  73                 if ((node->version == tree->version || node->version == -1) &&
  74                     tree->version != -1)
  75                         continue;
  76
  77                 vlist_delete(tree, node);
  78         }
  79 }
  80
  81 void
  82 vlist_flush_all(struct vlist_tree *tree)
  83 {
  84         tree->version = -1;
  85         vlist_flush(tree);
  86 }
  87
  88
  89 void
  90 __vlist_simple_init(struct vlist_simple_tree *tree, int offset)
  91 {
  92         INIT_LIST_HEAD(&tree->list);
  93         tree->version = 1;
  94         tree->head_offset = offset;
  95 }
  96
  97 void
  98 vlist_simple_delete(struct vlist_simple_tree *tree, struct vlist_simple_node *node)
  99 {
 100         char *ptr;
 101
 102         list_del(&node->list);
 103         ptr = (char *) node - tree->head_offset;
 104         free(ptr);
 105 }
 106
 107 void
 108 vlist_simple_flush(struct vlist_simple_tree *tree)
 109 {
 110         struct vlist_simple_node *n, *tmp;
 111
 112         list_for_each_entry_safe(n, tmp, &tree->list, list) {
 113                 if ((n->version == tree->version || n->version == -1) &&
 114                     tree->version != -1)
 115                         continue;
 116
 117                 vlist_simple_delete(tree, n);
 118         }
 119 }
 120
 121 void
 122 vlist_simple_replace(struct vlist_simple_tree *dest, struct vlist_simple_tree *old)
 123 {
 124         struct vlist_simple_node *n, *tmp;
 125
 126         vlist_simple_update(dest);
 127         list_for_each_entry_safe(n, tmp, &old->list, list) {
 128                 list_del(&n->list);
 129                 vlist_simple_add(dest, n);
 130         }
 131         vlist_simple_flush(dest);
 132 }
 133
 134 void
 135 vlist_simple_flush_all(struct vlist_simple_tree *tree)
 136 {
 137         tree->version = -1;
 138         vlist_simple_flush(tree);
 139 }