120 /* Swaps the position of the two nodes at the top of the provided
153 /* The node at the top of the provided stack is red, and its parent is
259 /* Called for a node N (at the top of the stack) which after a
346 			/* Restore stack state to have N on the top  in fix_missing_black()
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()
557  * alloca().  The current node is found in stack[top] (and its parent
558  * is thus stack[top-1]).  The side of each stacked node from its
559  * parent is stored in is_left[] (i.e. if is_left[top] is true, then
560  * node/stack[top] is the left child of stack[top-1]).  The special
561  * case of top == -1 indicates that the stack is uninitialized and we
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()