21 static struct rbnode *get_child(struct rbnode *n, uint8_t side)  in get_child()  function
89 		struct rbnode *ch = get_child(stack[sz - 1], side);  in find_and_stack()
106 	for (n = tree->root; (n != NULL) && (get_child(n, side) != NULL);  in z_rb_get_minmax()
107 			n = get_child(n, side)) {  in z_rb_get_minmax()
115 	CHECK(get_child(parent, 0U) == child || get_child(parent, 1U) == child);  in get_side()
117 	return (get_child(parent, 1U) == child) ? 1U : 0U;  in get_side()
137 	struct rbnode *a = get_child(child, side);  in rotate()
138 	struct rbnode *b = get_child(child, (side == 0U) ? 1U : 0U);  in rotate()
164 		CHECK((get_child(node, 0U) == NULL) ||  in fix_extra_red()
165 		      is_black(get_child(node, 0U)));  in fix_extra_red()
166 		CHECK((get_child(node, 1U) == NULL) ||  in fix_extra_red()
167 		      is_black(get_child(node, 1U)));  in fix_extra_red()
180 		struct rbnode *aunt = get_child(grandparent,  in fix_extra_red()
278 		struct rbnode *sib = get_child(parent,  in fix_missing_black()
297 			sib = get_child(parent, (n_side == 0U) ? 1U : 0U);  in fix_missing_black()
305 		c0 = get_child(sib, 0U);  in fix_missing_black()
306 		c1 = get_child(sib, 1U);  in fix_missing_black()
335 		outer = get_child(sib, (n_side == 0U) ? 1U : 0U);  in fix_missing_black()
337 			inner = get_child(sib, n_side);  in fix_missing_black()
350 			outer = get_child(sib, (n_side == 0U) ? 1U : 0U);  in fix_missing_black()
392 	if ((get_child(node, 0U) != NULL) && (get_child(node, 1U) != NULL)) {  in rb_remove()
395 		struct rbnode *node2 = get_child(node, 0U);  in rb_remove()
400 		while (get_child(node2, 1U) != NULL) {  in rb_remove()
401 			node2 = get_child(node2, 1U);  in rb_remove()
431 			set_child(node, 0U, get_child(node2, 0U));  in rb_remove()
435 			tmp = get_child(node, 0U);  in rb_remove()
436 			set_child(node, 0U, get_child(node2, 0U));  in rb_remove()
440 		set_child(node2, 1U, get_child(node, 1U));  in rb_remove()
453 	CHECK((get_child(node, 0U) == NULL) ||  in rb_remove()
454 	      (get_child(node, 1U) == NULL));  in rb_remove()
456 	struct rbnode *child = get_child(node, 0U);  in rb_remove()
459 		child = get_child(node, 1U);  in rb_remove()
507 		z_rb_walk(get_child(node, 0U), visit_fn, cookie);  in z_rb_walk()
509 		z_rb_walk(get_child(node, 1U), visit_fn, cookie);  in z_rb_walk()
516 	return get_child(node, side);  in z_rb_child()
529 		n = get_child(n, tree->lessthan_fn(n, node));  in rb_contains()
547 	for (n = get_child(n, 0U); n != NULL; n = get_child(n, 0U)) {  in stack_left_limb()
582 	n = get_child(f->stack[f->top], 1U);  in z_rb_foreach_next()