xref: /openbsd/usr.sbin/smtpd/tree.h (revision fd4beb3e)
1*fd4beb3eSgilles /*	$OpenBSD: tree.h,v 1.1 2018/12/23 16:06:24 gilles Exp $	*/
2*fd4beb3eSgilles 
3*fd4beb3eSgilles /*
4*fd4beb3eSgilles  * Copyright (c) 2013 Eric Faurot <eric@openbsd.org>
5*fd4beb3eSgilles  * Copyright (c) 2011 Gilles Chehade <gilles@poolp.org>
6*fd4beb3eSgilles  *
7*fd4beb3eSgilles  * Permission to use, copy, modify, and distribute this software for any
8*fd4beb3eSgilles  * purpose with or without fee is hereby granted, provided that the above
9*fd4beb3eSgilles  * copyright notice and this permission notice appear in all copies.
10*fd4beb3eSgilles  *
11*fd4beb3eSgilles  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
12*fd4beb3eSgilles  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
13*fd4beb3eSgilles  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
14*fd4beb3eSgilles  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
15*fd4beb3eSgilles  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
16*fd4beb3eSgilles  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
17*fd4beb3eSgilles  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
18*fd4beb3eSgilles  */
19*fd4beb3eSgilles 
20*fd4beb3eSgilles #ifndef	_TREE_H_
21*fd4beb3eSgilles #define	_TREE_H_
22*fd4beb3eSgilles 
23*fd4beb3eSgilles SPLAY_HEAD(_tree, treeentry);
24*fd4beb3eSgilles 
25*fd4beb3eSgilles struct tree {
26*fd4beb3eSgilles 	struct _tree	tree;
27*fd4beb3eSgilles 	size_t		count;
28*fd4beb3eSgilles };
29*fd4beb3eSgilles 
30*fd4beb3eSgilles 
31*fd4beb3eSgilles /* tree.c */
32*fd4beb3eSgilles #define tree_init(t) do { SPLAY_INIT(&((t)->tree)); (t)->count = 0; } while(0)
33*fd4beb3eSgilles #define tree_empty(t) SPLAY_EMPTY(&((t)->tree))
34*fd4beb3eSgilles #define tree_count(t) ((t)->count)
35*fd4beb3eSgilles int tree_check(struct tree *, uint64_t);
36*fd4beb3eSgilles void *tree_set(struct tree *, uint64_t, void *);
37*fd4beb3eSgilles void tree_xset(struct tree *, uint64_t, void *);
38*fd4beb3eSgilles void *tree_get(struct tree *, uint64_t);
39*fd4beb3eSgilles void *tree_xget(struct tree *, uint64_t);
40*fd4beb3eSgilles void *tree_pop(struct tree *, uint64_t);
41*fd4beb3eSgilles void *tree_xpop(struct tree *, uint64_t);
42*fd4beb3eSgilles int tree_poproot(struct tree *, uint64_t *, void **);
43*fd4beb3eSgilles int tree_root(struct tree *, uint64_t *, void **);
44*fd4beb3eSgilles int tree_iter(struct tree *, void **, uint64_t *, void **);
45*fd4beb3eSgilles int tree_iterfrom(struct tree *, void **, uint64_t, uint64_t *, void **);
46*fd4beb3eSgilles void tree_merge(struct tree *, struct tree *);
47*fd4beb3eSgilles 
48*fd4beb3eSgilles #endif
49