110 typedef void (*rb_visit_t)(struct rbnode *node, void *cookie);
112 struct rbnode *z_rb_child(struct rbnode *node, uint8_t side);
113 int z_rb_is_black(struct rbnode *node);
115 void z_rb_walk(struct rbnode *node, rb_visit_t visit_fn, void *cookie);
122 void rb_insert(struct rbtree *tree, struct rbnode *node);
127 void rb_remove(struct rbtree *tree, struct rbnode *node);
154 bool rb_contains(struct rbtree *tree, struct rbnode *node);
179 #define _RB_FOREACH_INIT(tree, node) {					\  argument
185 #define _RB_FOREACH_INIT(tree, node) {					\  argument
216 #define RB_FOR_EACH(tree, node) \  argument
217 	for (struct _rb_foreach __f = _RB_FOREACH_INIT(tree, node);	\
218 	     ((node) = z_rb_foreach_next((tree), &__f));		\
231 #define RB_FOR_EACH_CONTAINER(tree, node, field)		           \  argument
232 	for (struct _rb_foreach __f = _RB_FOREACH_INIT(tree, node);	   \
234 			 (node) = n ? CONTAINER_OF(n, __typeof__(*(node)),   \
235 					 field) : NULL; (node); }) != NULL;        \