543 	f->top++;  in stack_left_limb()
544 	f->stack[f->top] = n;  in stack_left_limb()
545 	f->is_left[f->top] = 0U;  in stack_left_limb()
548 		f->top++;  in stack_left_limb()
549 		f->stack[f->top] = n;  in stack_left_limb()
550 		f->is_left[f->top] = 1;  in stack_left_limb()
553 	return f->stack[f->top];  in stack_left_limb()
575 	if (f->top == -1) {  in z_rb_foreach_next()
582 	n = get_child(f->stack[f->top], 1U);  in z_rb_foreach_next()
592 	if (f->is_left[f->top] != 0U) {  in z_rb_foreach_next()
593 		return f->stack[--f->top];  in z_rb_foreach_next()
600 	while ((f->top > 0) && (f->is_left[f->top] == 0U)) {  in z_rb_foreach_next()
601 		f->top--;  in z_rb_foreach_next()
604 	f->top--;  in z_rb_foreach_next()
605 	return (f->top >= 0) ? f->stack[f->top] : NULL;  in z_rb_foreach_next()