Lines Matching refs:Or
174 return 0; // Otherwise it's a global or constant, rank 0.
189 // If this is a not or neg instruction, do not count it for rank. This
227 // linearize it as well. Besides that case, this does not recurse into A,B, or
296 // Neither the LHS or RHS as part of the tree, thus this is a leaf. As
439 // non-instruction value) or right after the definition. These negates will
475 // Don't bother to break this up unless either the LHS is an associable add or
476 // subtract or if this is only used by one.
491 /// BreakUpSubtract - If we have (X-Y), and if either X is an add, or if this is
517 /// ConvertShiftToMul - If this is a shift of a reassociable multiply or is used
522 // If an operand of this shift is a reassociable multiply, or if the shift
523 // is used by a reassociable multiply or add, turn into a multiply.
658 /// OptimizeAndOrXor - Optimize a series of operands to an 'and', 'or', or 'xor'
676 if (Opcode == Instruction::Or) // ...|X|~X = -1
685 if (Opcode == Instruction::And || Opcode == Instruction::Or) {
686 // Drop duplicate values for And and Or.
926 case Instruction::Or:
943 case Instruction::Or:
987 // SimplifyCFG has folded to AND/OR expressions. If the expression
