Lines Matching defs:Z*
208 // Use left distributivity, i.e. "X op' (Y op Z) = (X op' Y) op (X op' Z)".
231 // Use right distributivity, i.e. "(X op Y) op' Z = (X op' Z) op (Y op' Z)".
401 // For example, select (cond, X, X & Z) & Z -> X & Z.
786 // (X + Y) - Z -> X + (Y - Z) or Y + (X - Z) if everything simplifies.
788 Value *Y = 0, *Z = Op1;
789 if (MaxRecurse && match(Op0, m_Add(m_Value(X), m_Value(Y)))) { // (X + Y) - Z
790 // See if "V === Y - Z" simplifies.
791 if (Value *V = SimplifyBinOp(Instruction::Sub, Y, Z, Q, MaxRecurse-1))
798 // See if "V === X - Z" simplifies.
799 if (Value *V = SimplifyBinOp(Instruction::Sub, X, Z, Q, MaxRecurse-1))
808 // X - (Y + Z) -> (X - Y) - Z or (X - Z) - Y if everything simplifies.
811 if (MaxRecurse && match(Op1, m_Add(m_Value(Y), m_Value(Z)))) { // X - (Y + Z)
814 // It does! Now see if "V - Z" simplifies.
815 if (Value *W = SimplifyBinOp(Instruction::Sub, V, Z, Q, MaxRecurse-1)) {
820 // See if "V === X - Z" simplifies.
821 if (Value *V = SimplifyBinOp(Instruction::Sub, X, Z, Q, MaxRecurse-1))
830 // Z - (X - Y) -> (Z - X) + Y if everything simplifies.
832 Z = Op0;
833 if (MaxRecurse && match(Op1, m_Sub(m_Value(X), m_Value(Y)))) // Z - (X - Y)
834 // See if "V === Z - X" simplifies.
835 if (Value *V = SimplifyBinOp(Instruction::Sub, Z, X, Q, MaxRecurse-1))
1896 if (isa<ZExtInst>(LHS)) {
1899 if (ZExtInst *RI = dyn_cast<ZExtInst>(RHS)) {
1913 Constant *RExt = ConstantExpr::getCast(CastInst::ZExt, Trunc, DstTy);
2064 // icmp (X+Y), (X+Z) -> icmp Y,Z for equalities or if there is no overflow.
2067 // Determine Y and Z in the form icmp (X+Y), (X+Z).
2069 Value *Z = (C == A || C == B) ? D : C;
2070 if (Value *V = SimplifyICmpInst(Pred, Y, Z, Q, MaxRecurse-1))