dist/gcc/reg-stack.c

2555 change_stack (rtx_insn *insn, stack_ptr old, stack_ptr new_stack,
2570       BLOCK_INFO (current_block)->stack_in = *new_stack;
2572       *old = *new_stack;
2588     if (TEST_HARD_REG_BIT (new_stack->reg_set, i)
2602   if (new_stack->top > 0)
2609       for (reg = 0; reg <= new_stack->top; reg++)
2610 	slots[reg] = TEST_HARD_REG_BIT (new_stack->reg_set, old->reg[reg]);
2614       for (reg = old->top; reg > new_stack->top; reg--)
2615 	if (TEST_HARD_REG_BIT (new_stack->reg_set, old->reg[reg]))
2618 	    for (next = 0; next <= new_stack->top; next++)
2619 	      if (!slots[next] && new_stack->reg[next] == old->reg[reg])
2623                   if (next == new_stack->top)
2640 	for (reg = 0; reg < new_stack->top; reg++)
2644 	      slots[new_stack->top] = false;
2650       next = new_stack->top;
2651       for (reg = old->top; reg > new_stack->top; reg--)
2674         if (TEST_HARD_REG_BIT (new_stack->reg_set, old->reg[reg]))
2679         if (TEST_HARD_REG_BIT (new_stack->reg_set, old->reg[old->top]))
2681 	    while (TEST_HARD_REG_BIT (new_stack->reg_set, old->reg[next]))
2691   if (new_stack->top == -2)
2696       new_stack->top = old->top;
2697       memcpy (new_stack->reg, old->reg, sizeof (new_stack->reg));
2707       gcc_assert (old->reg_set == new_stack->reg_set);
2708       gcc_assert (old->top == new_stack->top);
2710       /* If the stack is not empty (new_stack->top != -1), loop here emitting
2719       if (new_stack->top != -1)
2725 	    while (old->reg[old->top] != new_stack->reg[new_stack->top])
2727 		for (reg = new_stack->top; reg >= 0; reg--)
2728 		  if (new_stack->reg[reg] == old->reg[old->top])
2741 	    for (reg = new_stack->top; reg >= 0; reg--)
2742 	      if (new_stack->reg[reg] != old->reg[reg])
2753 	gcc_assert (old->reg[reg] == new_stack->reg[reg]);