cce5e35127
Yet another macro wrapper around the corresponding avl_* macro. This new macro makes it possible to iterate over vlists in ways which may have destructive consequences without being punished by segfault. Signed-off-by: Daniel Golle <daniel@makrotopia.org>
93 lines
3.2 KiB
C
93 lines
3.2 KiB
C
/*
|
|
* Copyright (C) 2012 Felix Fietkau <nbd@openwrt.org>
|
|
*
|
|
* Permission to use, copy, modify, and/or distribute this software for any
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
* copyright notice and this permission notice appear in all copies.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|
|
|
|
#ifndef __LIBUBOX_VLIST_H
|
|
#define __LIBUBOX_VLIST_H
|
|
|
|
#include "avl.h"
|
|
|
|
struct vlist_tree;
|
|
struct vlist_node;
|
|
|
|
typedef void (*vlist_update_cb)(struct vlist_tree *tree,
|
|
struct vlist_node *node_new,
|
|
struct vlist_node *node_old);
|
|
|
|
struct vlist_tree {
|
|
struct avl_tree avl;
|
|
|
|
vlist_update_cb update;
|
|
bool keep_old;
|
|
bool no_delete;
|
|
|
|
int version;
|
|
};
|
|
|
|
struct vlist_node {
|
|
struct avl_node avl;
|
|
int version;
|
|
};
|
|
|
|
#define VLIST_TREE_INIT(_name, _comp, _update, _keep_old, _no_delete) \
|
|
{ \
|
|
.avl = AVL_TREE_INIT(_name.avl, _comp, false, NULL), \
|
|
.update = _update, \
|
|
.version = 1, \
|
|
.keep_old = _keep_old, \
|
|
.no_delete = _no_delete, \
|
|
}
|
|
|
|
#define VLIST_TREE(_name, ...) \
|
|
struct vlist_tree _name = \
|
|
VLIST_TREE_INIT(_name, __VA_ARGS__)
|
|
|
|
void vlist_init(struct vlist_tree *tree, avl_tree_comp cmp, vlist_update_cb update);
|
|
|
|
#define vlist_find(tree, name, element, node_member) \
|
|
avl_find_element(&(tree)->avl, name, element, node_member.avl)
|
|
|
|
static inline void vlist_update(struct vlist_tree *tree)
|
|
{
|
|
tree->version++;
|
|
}
|
|
|
|
void vlist_add(struct vlist_tree *tree, struct vlist_node *node, const void *key);
|
|
void vlist_delete(struct vlist_tree *tree, struct vlist_node *node);
|
|
void vlist_flush(struct vlist_tree *tree);
|
|
void vlist_flush_all(struct vlist_tree *tree);
|
|
|
|
#define vlist_for_each_element(tree, element, node_member) \
|
|
avl_for_each_element(&(tree)->avl, element, node_member.avl)
|
|
|
|
#define vlist_for_each_element_safe(tree, element, node_member, ptr) \
|
|
avl_for_each_element_safe(&(tree)->avl, element, node_member.avl, ptr)
|
|
|
|
#define vlist_for_each_element_reverse(tree, element, node_member) \
|
|
avl_for_each_element_reverse(&(tree)->avl, element, node_member.avl)
|
|
|
|
#define vlist_for_first_to_element(tree, last, element, node_member) \
|
|
avl_for_element_range(avl_first_element(&(tree)->avl, element, node_member.avl), last, element, node_member.avl)
|
|
|
|
#define vlist_for_first_to_element_reverse(tree, last, element, node_member) \
|
|
avl_for_element_range_reverse(avl_first_element(&(tree)->avl, element, node_member.avl), last, element, node_member.avl)
|
|
|
|
#define vlist_for_element_to_last(tree, first, element, node_member) \
|
|
avl_for_element_range(first, avl_last_element(&(tree)->avl, element, node_member.avl), element, node_member.avl)
|
|
|
|
#define vlist_for_element_to_last_reverse(tree, first, element, node_member) \
|
|
avl_for_element_range_reverse(first, avl_last_element(&(tree)->avl, element, node_member.avl), element, node_member.avl)
|
|
|
|
#endif
|