summaryrefslogtreecommitdiff
path: root/usr.bin/sudo/redblack.h
diff options
context:
space:
mode:
authorTodd C. Miller <millert@cvs.openbsd.org>2008-11-14 11:58:09 +0000
committerTodd C. Miller <millert@cvs.openbsd.org>2008-11-14 11:58:09 +0000
commit4dcc6f61d2ac432522cb0d8249ced4b2437da0a5 (patch)
tree7b176ffeeb7bda768ae52a14198616c2982e1231 /usr.bin/sudo/redblack.h
parentb947682bc3ae9dc4a24d5a2c48e88d01ecd53b63 (diff)
Upgrade to sudo 1.7. See the WHATSNEW files for details.
Diffstat (limited to 'usr.bin/sudo/redblack.h')
-rw-r--r--usr.bin/sudo/redblack.h60
1 files changed, 60 insertions, 0 deletions
diff --git a/usr.bin/sudo/redblack.h b/usr.bin/sudo/redblack.h
new file mode 100644
index 00000000000..8c7ead71cd2
--- /dev/null
+++ b/usr.bin/sudo/redblack.h
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2004, 2007 Todd C. Miller <Todd.Miller@courtesan.com>
+ *
+ * Permission to use, copy, modify, and 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.
+ *
+ * $Sudo: redblack.h,v 1.4 2008/11/09 14:13:12 millert Exp $
+ */
+
+#ifndef _SUDO_REDBLACK_H
+#define _SUDO_REDBLACK_H
+
+enum rbcolor {
+ red,
+ black
+};
+
+enum rbtraversal {
+ preorder,
+ inorder,
+ postorder
+};
+
+struct rbnode {
+ struct rbnode *left, *right, *parent;
+ void *data;
+ enum rbcolor color;
+};
+
+struct rbtree {
+ int (*compar) __P((const void *, const void *));
+ struct rbnode root;
+ struct rbnode nil;
+};
+
+#define rbapply(t, f, c, o) rbapply_node((t), (t)->root.left, (f), (c), (o))
+#define rbisempty(t) ((t)->root.left == &(t)->nil && (t)->root.right == &(t)->nil)
+#define rbfirst(t) ((t)->root.left)
+#define rbroot(t) (&(t)->root)
+#define rbnil(t) (&(t)->nil)
+
+void *rbdelete __P((struct rbtree *, struct rbnode *));
+int rbapply_node __P((struct rbtree *, struct rbnode *,
+ int (*)(void *, void *), void *,
+ enum rbtraversal));
+struct rbnode *rbfind __P((struct rbtree *, void *));
+struct rbnode *rbinsert __P((struct rbtree *, void *));
+struct rbtree *rbcreate __P((int (*)(const void *, const void *)));
+void rbdestroy __P((struct rbtree *, void (*)(void *)));
+
+#endif /* _SUDO_REDBLACK_H */