contrib/gcc/reg-stack.c

90 	output operand.
113 	If any input operand uses the "f" constraint, all output reg
126 	appears in after an asm.  "=f" is not allowed: the operand
130       Since no 387 opcode uses a read/write operand, all output operands
499     if (GET_CODE (recog_data.operand[i]) == SUBREG
500 	&& REG_P (SUBREG_REG (recog_data.operand[i])))
501       recog_data.operand[i] = SUBREG_REG (recog_data.operand[i]);
530      operand constraints must select a class with a single reg.
537     if (STACK_REG_P (recog_data.operand[i]))
549 	      if (REGNO (recog_data.operand[i]) == REGNO (clobber_reg[j]))
557 	      reg_used_as_output[REGNO (recog_data.operand[i])] = 1;
584     if (STACK_REG_P (recog_data.operand[i]))
591 	  if (operands_match_p (clobber_reg[j], recog_data.operand[i]))
595 	  implicitly_dies[REGNO (recog_data.operand[i])] = 1;
615   /* Enforce rule #3: If any input operand uses the "f" constraint, all
627 	  if (operands_match_p (recog_data.operand[j], recog_data.operand[i]))
630 			     "output operand %d must use %<&%> constraint", j);
934   /* Place operand 1 at the top of stack.  */
947   /* Place operand 2 next on the stack.  */
1297   /* If the second operand dies, handle that.  But if the operands are
1318 	  /* The 386 can only represent death of the first operand in
1519 	    /* If either operand is not a stack register, then the dest
1526 		/* Both operands are REG.  If neither operand is already
1608 	    /* Keep operand 1 matching with destination.  */
1867 		   dies, it is safe to make it the destination operand by
1884 		    /* Reverse condition to compensate the operand swap.
1993     if (GET_CODE (recog_data.operand[i]) == SUBREG
1994 	&& REG_P (SUBREG_REG (recog_data.operand[i])))
1996 	recog_data.operand_loc[i] = & SUBREG_REG (recog_data.operand[i]);
1997 	recog_data.operand[i] = SUBREG_REG (recog_data.operand[i]);
2068     if (STACK_REG_P (recog_data.operand[i])
2073 	/* If an operand needs to be in a particular reg in
2076 	   reload guaranteed that operand[i] is already in that class,
2077 	   we can just use REGNO (recog_data.operand[i]) to know which
2078 	   actual reg this operand needs to be in.  */
2080 	int regno = get_hard_regnum (&temp_stack, recog_data.operand[i]);
2084 	if ((unsigned int) regno != REGNO (recog_data.operand[i]))
2086 	    /* recog_data.operand[i] is not in the right place.  Find
2088 	       K is where recog_data.operand[i] is now.  J is where it
2094 		 - (REGNO (recog_data.operand[i]) - FIRST_STACK_REG));
2111     if (STACK_REG_P (recog_data.operand[i]))
2113 	int regnum = get_hard_regnum (regstack, recog_data.operand[i]);
2149     if (STACK_REG_P (recog_data.operand[i]))
2156 	  if (operands_match_p (clobber_reg[j], recog_data.operand[i]))
2161 	    /* recog_data.operand[i] might not be at the top of stack.
2183 	if (STACK_REG_P (recog_data.operand[j])
2184 	    && REGNO (recog_data.operand[j]) == (unsigned) i)
2200     if (STACK_REG_P (recog_data.operand[i]))
2205 	  if (REGNO (recog_data.operand[i]) == REGNO (note_reg[j])
2208 	      insn = emit_pop_insn (insn, regstack, recog_data.operand[i],
2215     if (STACK_REG_P (recog_data.operand[i]))
2220 	  if (REGNO (recog_data.operand[i]) == REGNO (note_reg[j])
2223 				    REGNO (recog_data.operand[i])))
2225 	      insn = emit_pop_insn (insn, regstack, recog_data.operand[i],