summaryrefslogtreecommitdiff
path: root/kern/rbtree.h
diff options
context:
space:
mode:
authorJustus Winter <4winter@informatik.uni-hamburg.de>2015-07-21 19:34:47 +0200
committerJustus Winter <4winter@informatik.uni-hamburg.de>2015-07-21 19:34:47 +0200
commita2952398e5de8746a761a59686619d08d376bce3 (patch)
treedf2373bb1119468873c667624769455c36dc3786 /kern/rbtree.h
parentba1b3afd50913473f3036a63b4a82d7ba5c42009 (diff)
parent92e98a7f4d4fa75b286a067e1d1caef514fccb0d (diff)
Merge branch 'master' into master-gdb_stubs
Diffstat (limited to 'kern/rbtree.h')
-rw-r--r--kern/rbtree.h10
1 files changed, 3 insertions, 7 deletions
diff --git a/kern/rbtree.h b/kern/rbtree.h
index 5a65d1ef..16ef2736 100644
--- a/kern/rbtree.h
+++ b/kern/rbtree.h
@@ -31,13 +31,9 @@
#include <stddef.h>
#include <kern/assert.h>
-#include <kern/macro_help.h>
-#include <kern/rbtree.h>
+#include <kern/macros.h>
#include <sys/types.h>
-#define structof(ptr, type, member) \
- ((type *)((char *)ptr - offsetof(type, member)))
-
/*
* Indexes of the left and right nodes in the children array of a node.
*/
@@ -178,8 +174,8 @@ MACRO_END
* This macro performs a standard lookup to obtain the insertion point of
* the given node in the tree (it is assumed that the inserted node never
* compares equal to any other entry in the tree) and links the node. It
- * then It then checks red-black rules violations, and rebalances the tree
- * if necessary.
+ * then checks red-black rules violations, and rebalances the tree if
+ * necessary.
*
* Unlike rbtree_lookup(), the cmp_fn parameter must compare two complete
* entries, so it is suggested to use two different comparison inline