vlist.h File Reference

#include "avl.h"

Go to the source code of this file.

Data Structures
struct	vlist_tree
struct	vlist_node

Macros
#define	VLIST_TREE_INIT(_name, _comp, _update, _keep_old, _no_delete)
#define	VLIST_TREE(_name, ...)
#define	vlist_find(tree, name, element, node_member)    avl_find_element(&(tree)->avl, name, element, node_member.avl)
#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)

Typedefs
typedef void(*	vlist_update_cb) (struct vlist_tree *tree, struct vlist_node *node_new, struct vlist_node *node_old)

Functions
void	vlist_init (struct vlist_tree *tree, avl_tree_comp cmp, vlist_update_cb update)
static void	vlist_update (struct vlist_tree *tree)
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)

Macro Definition Documentation

vlist_find

#define vlist_find	(		tree,
			name,
			element,
			node_member
	)		avl_find_element(&(tree)->avl, name, element, node_member.avl)

Definition at line 59 of file vlist.h.

vlist_for_each_element

#define vlist_for_each_element	(		tree,
			element,
			node_member
	)		avl_for_each_element(&(tree)->avl, element, node_member.avl)

Definition at line 72 of file vlist.h.

vlist_for_each_element_reverse

#define vlist_for_each_element_reverse	(		tree,
			element,
			node_member
	)		avl_for_each_element_reverse(&(tree)->avl, element, node_member.avl)

Definition at line 78 of file vlist.h.

vlist_for_each_element_safe

#define vlist_for_each_element_safe	(		tree,
			element,
			node_member,
			ptr
	)		avl_for_each_element_safe(&(tree)->avl, element, node_member.avl, ptr)

Definition at line 75 of file vlist.h.

vlist_for_element_to_last

#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)

Definition at line 87 of file vlist.h.

vlist_for_element_to_last_reverse

#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)

Definition at line 90 of file vlist.h.

vlist_for_first_to_element

#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)

Definition at line 81 of file vlist.h.

vlist_for_first_to_element_reverse

#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)

Definition at line 84 of file vlist.h.

VLIST_TREE

#define VLIST_TREE	(		_name,
			...
	)

Value:

        struct vlist_tree _name =                                       \
                VLIST_TREE_INIT(_name, __VA_ARGS__)

Definition at line 53 of file vlist.h.

VLIST_TREE_INIT

#define VLIST_TREE_INIT	(		_name,
			_comp,
			_update,
			_keep_old,
			_no_delete
	)

Value:

        {                                                               \
                .avl = AVL_TREE_INIT(_name.avl, _comp, false, NULL),    \
                .update = _update,                                      \
                .version = 1,                                           \
                .keep_old = _keep_old,                                  \
                .no_delete = _no_delete,                                \
        }

Definition at line 44 of file vlist.h.

Typedef Documentation

vlist_update_cb

typedef void(* vlist_update_cb) (struct vlist_tree *tree, struct vlist_node *node_new, struct vlist_node *node_old)

Definition at line 25 of file vlist.h.

Function Documentation

vlist_add()

void vlist_add	(	struct vlist_tree *	tree,
		struct vlist_node *	node,
		const void *	key
	)

Definition at line 36 of file vlist.c.

{
        struct vlist_node *old_node = NULL;
        struct avl_node *anode;
 
        node->avl.key = key;
        node->version = tree->version;
 
        anode = avl_find(&tree->avl, key);
        if (anode) {
                old_node = container_of(anode, struct vlist_node, avl);
                if (tree->keep_old || tree->no_delete) {
                        old_node->version = tree->version;
                        goto update_only;
                }
 
                avl_delete(&tree->avl, anode);
        }
 
        avl_insert(&tree->avl, &node->avl);
 
update_only:
        tree->update(tree, node, old_node);
}

Here is the call graph for this function:

vlist_delete()

void vlist_delete	(	struct vlist_tree *	tree,
		struct vlist_node *	node
	)

Definition at line 28 of file vlist.c.

{
        if (!tree->no_delete)
                avl_delete(&tree->avl, &node->avl);
        tree->update(tree, NULL, node);
}

Here is the call graph for this function:

Here is the caller graph for this function:

vlist_flush()

void vlist_flush

(

struct vlist_tree *

tree

)

Definition at line 62 of file vlist.c.

{
        struct vlist_node *node, *tmp;
 
        avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
                if ((node->version == tree->version || node->version == -1) &&
                    tree->version != -1)
                        continue;
 
                vlist_delete(tree, node);
        }
}

Here is the call graph for this function:

Here is the caller graph for this function:

vlist_flush_all()

void vlist_flush_all

(

struct vlist_tree *

tree

)

Definition at line 76 of file vlist.c.

{
        tree->version = -1;
        vlist_flush(tree);
}

Here is the call graph for this function:

vlist_init()

void vlist_init	(	struct vlist_tree *	tree,
		avl_tree_comp	cmp,
		vlist_update_cb	update
	)

Definition at line 19 of file vlist.c.

{
        tree->update = update;
        tree->version = 1;
 
        avl_init(&tree->avl, cmp, 0, tree);
}

Here is the call graph for this function:

vlist_update()

static void vlist_update ( struct vlist_tree *  tree )

inlinestatic

Definition at line 62 of file vlist.h.

{
        tree->version++;
}