Lines Matching refs:rbnode

58 struct rbnode {  struct
60 	struct rbnode *children[2];  argument
86 typedef bool (*rb_lessthan_t)(struct rbnode *a, struct rbnode *b);
93 	struct rbnode *root;
99 	struct rbnode *iter_stack[Z_MAX_RBTREE_DEPTH];
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);
117 struct rbnode *z_rb_get_minmax(struct rbtree *tree, uint8_t side);
122 void rb_insert(struct rbtree *tree, struct rbnode *node);
127 void rb_remove(struct rbtree *tree, struct rbnode *node);
132 static inline struct rbnode *rb_get_min(struct rbtree *tree)  in rb_get_min()
140 static inline struct rbnode *rb_get_max(struct rbtree *tree)  in rb_get_max()
154 bool rb_contains(struct rbtree *tree, struct rbnode *node);
173 	struct rbnode **stack;
186 	.stack   = (struct rbnode **)					\
187 			alloca((tree)->max_depth * sizeof(struct rbnode *)), \
193 struct rbnode *z_rb_foreach_next(struct rbtree *tree, struct _rb_foreach *f);
233 			({struct rbnode *n = z_rb_foreach_next(tree, &__f); \