Lines Matching defs:Any
233 /// Whether any complex addressing has a base register.
236 /// The scale of any complex addressing.
470 // Handle the trivial case, which works for any SCEV type.
744 // Fow now, consider any other type of expression (div/mul/min/max) high cost.
748 /// DeleteTriviallyDeadInstructions - If any of the instructions is the
749 /// specified set are trivially dead, delete them and see if this makes any of
810 // Once any of the metrics loses, they must all remain losers.
898 /// before, rate it. Optional LoserRegs provides a way to declare any formula
1173 /// WidestFixupType - This records the widest use type for any fixup using
1560 // hasIncs - Returns true if this chain contains any increments.
2213 // Basic uses can't accept any offset, for example.
2289 // there aren't going to be any others. Since we declined it, we
2402 /// NULL for any constant. Returning the expression itself is
2470 /// any IV users that keep the IV live across increments (the Users set should
2717 // Remove this instruction from any NearUsers set it may be in.
2745 // Remove any unprofitable chains.
3547 // Group the registers by their value without any added constant offset.
3764 bool Any = false;
3829 Any = true;
3833 if (Any)
3884 bool Any = false;
3902 Any = true;
3918 Any = true;
3925 if (Any)
3989 bool Any = false;
3999 Any = true;
4003 if (Any)
4036 /// to be profitable, and then in any use which has any reference to that
4071 // In any use with formulae which references this register, delete formulae
4077 bool Any = false;
4085 Any = true;
4091 if (Any)
4130 // If this use references any register that's already a part of the
4146 // Ignore formulae which do not use any of the required registers.
4290 // expanding replacement. These must be dominated by any operands that
4305 // The expansion must also be dominated by the increment positions of any
4672 // Clean up after ourselves. This must be done before deleting any
4903 // Remove any extra phis created by processing inner loops.
