contrib/gcc/regclass.c

987       if (GET_CODE (recog_data.operand[i]) == SUBREG)
988 	recog_data.operand[i] = SUBREG_REG (recog_data.operand[i]);
990       if (MEM_P (recog_data.operand[i]))
991 	record_address_regs (GET_MODE (recog_data.operand[i]),
992 			     XEXP (recog_data.operand[i], 0),
996 	record_address_regs (VOIDmode, recog_data.operand[i], 0, ADDRESS,
1001      have been initialized.  We must do this even if one operand
1019 			    recog_data.operand, modes,
1024 		      recog_data.operand, modes,
1093       && CONSTANT_P (recog_data.operand[1])
1094       && ! rtx_equal_p (recog_data.operand[0], recog_data.operand[1])
1095       && ! rtx_equal_p (recog_data.operand[0], recog_data.operand[2])
1096       && REG_P (recog_data.operand[0])
1097       && MODES_TIEABLE_P (GET_MODE (recog_data.operand[0]),
1103 		       recog_data.operand[0]);
1105 	= emit_insn_before (gen_move_insn (dest, recog_data.operand[1]), insn);
1121       REG_N_SETS (REGNO (recog_data.operand[0]))++;
1122       REG_N_REFS (REGNO (recog_data.operand[0]))++;
1123       REG_FREQ (REGNO (recog_data.operand[0])) += frequency;
1125       *recog_data.operand_loc[1] = recog_data.operand[0];
1126       REG_N_REFS (REGNO (recog_data.operand[0]))++;
1127       REG_FREQ (REGNO (recog_data.operand[0])) += frequency;
1131 	    *recog_data.dup_loc[i] = recog_data.operand[0];
1132 	    REG_N_REFS (REGNO (recog_data.operand[0]))++;
1133 	    REG_FREQ (REGNO (recog_data.operand[0])) += frequency;
1141   /* Now add the cost for each operand to the total costs for
1145     if (REG_P (recog_data.operand[i])
1146 	&& REGNO (recog_data.operand[i]) >= FIRST_PSEUDO_REGISTER)
1148 	int regno = REGNO (recog_data.operand[i]);
1302 	      /* Ignore classes that are too small for this operand or
1303 		 invalid for an operand that was auto-incremented.  */
1398    we compute for each operand that is a pseudo-register, the cost of
1415   /* Process each alternative, each time minimizing an operand's cost with
1416      the cost for each operand in that alternative.  */
1440 	  /* If this operand has no constraints at all, we can conclude
1451 	  /* If this alternative is only relevant when this operand
1452 	     matches a previous operand, we do different things depending
1453 	     on whether this operand is a pseudo-reg or not.  We must process
1454 	     any modifiers for the operand before we can make this test.  */
1470 		  /* If this matches the other operand, we have no added
1475 		  /* If we can put the other operand into a register, add to
1477 		     operand to the register used for the other operand.  */
1490 		  /* If we can't put the other operand into a register, this
1497 		     to copy the other operand to the register used for this
1498 		     operand.  */
1505 		  /* The costs of this operand are not the same as the other
1506 		     operand since move costs are not symmetric.  Moreover,
1549 		     for this operand, so skip to the end of the
1559 	  /* Scan all the constraint letters.  See if the operand matches
1561 	     and see if this operand accepts memory.  */
1584 		  /* We know this operand is an address, so we want it to be
1698 		      /* We know this operand is an address, so we want it to
1715 	  /* How we account for this operand now depends on whether it is  a
1726 		  /* We must always fail if the operand is a REG, but
1824   /* If this insn is a single set copying operand 1 to operand 0
1825      and one operand is a pseudo with the other a hard reg or a pseudo
1997 	   be in the first operand.  */
2014 	/* If the second operand is a constant integer, it doesn't change
2015 	   what class the first operand must be.  */
2020 	/* If the second operand is a symbolic constant, the first operand
2047 	/* If one operand is known to be a pointer, it must be the base
2048 	   with the other operand the index.  Likewise if the other operand
2095 	 if it ends up in the wrong place.  If the operand is a pseudo,