21 static struct rbnode *get_child(struct rbnode *n, uint8_t side)  in get_child()  argument
24 	if (side != 0U) {  in get_child()
34 static void set_child(struct rbnode *n, uint8_t side, void *val)  in set_child()  argument
37 	if (side != 0U) {  in set_child()
87 		uint8_t side = tree->lessthan_fn(node, stack[sz - 1]) ? 0U : 1U;  in find_and_stack()  local
88 		struct rbnode *ch = get_child(stack[sz - 1], side);  in find_and_stack()
100 struct rbnode *z_rb_get_minmax(struct rbtree *tree, uint8_t side)  in z_rb_get_minmax()  argument
104 	for (n = tree->root; (n != NULL) && (get_child(n, side) != NULL);  in z_rb_get_minmax()
105 			n = get_child(n, side)) {  in z_rb_get_minmax()
121  * its mirror if N is on the other side of P, of course):
134 	uint8_t side = get_side(parent, child);  in rotate()  local
135 	struct rbnode *a = get_child(child, side);  in rotate()
136 	struct rbnode *b = get_child(child, (side == 0U) ? 1U : 0U);  in rotate()
144 	set_child(child, side, a);  in rotate()
145 	set_child(child, (side == 0U) ? 1U : 0U, parent);  in rotate()
146 	set_child(parent, side, b);  in rotate()
177 		uint8_t side = get_side(grandparent, parent);  in fix_extra_red()  local
179 						(side == 0U) ? 1U : 0U);  in fix_extra_red()
195 		 * make sure that node is on the same side of parent  in fix_extra_red()
200 		if (parent_side != side) {  in fix_extra_red()
239 	uint8_t side = tree->lessthan_fn(node, parent) ? 0U : 1U;  in rb_insert()  local
241 	set_child(parent, side, node);  in rb_insert()
329 		 * opposite side from N) is definitely red.  in fix_missing_black()
383 	 * have two then pick the "biggest" child of side 0 (smallest  in rb_remove()
507 struct rbnode *z_rb_child(struct rbnode *node, uint8_t side)  in z_rb_child()  argument
509 	return get_child(node, side);  in z_rb_child()
528 /* Pushes the node and its chain of left-side children onto the stack
551  * is thus stack[top-1]).  The side of each stacked node from its