Lines Matching refs:And
916 /// And X is checking that some bit in that same mask is zero.
931 assert(CxtI.getOpcode() == Instruction::And);
981 // And the other icmp needs to be decomposable into a bit test.
1416 assert((Opcode == Instruction::And || Opcode == Instruction::Or) &&
1428 FCmpInst::Predicate NanPred = Opcode == Instruction::And ? FCmpInst::FCMP_ORD
1461 assert((Opcode == Instruction::And || Opcode == Instruction::Or) &&
1465 Opcode = (Opcode == Instruction::And) ? Instruction::Or : Instruction::And;
1583 Value *Res = LogicOpc == Instruction::And ? foldAndOfICmps(ICmp0, ICmp1, I)
1595 if (Value *R = foldLogicOfFCmps(FCmp0, FCmp1, LogicOpc == Instruction::And))
1603 assert(I.getOpcode() == Instruction::And);
1681 Instruction *InstCombiner::narrowMaskedBinOp(BinaryOperator &And) {
1687 Value *Op0 = And.getOperand(0), *Op1 = And.getOperand(1);
1700 Type *Ty = And.getType();
1766 Value *And = Builder.CreateAnd(X, Op1);
1767 And->takeName(Op0);
1768 return BinaryOperator::CreateXor(And, NewC);
1780 Value *And = Builder.CreateAnd(X, ConstantInt::get(I.getType(),
1782 And->takeName(Op0);
1783 return BinaryOperator::CreateOr(And, ConstantInt::get(I.getType(),
1839 auto *And = Builder.CreateAnd(BinOp, TruncC2);
1840 return new ZExtInst(And, I.getType());
2854 if (Value *AndICmp = SimplifyBinOp(Instruction::And, LHS, RHS, SQ)) {
3027 if (NotVal->getOpcode() == Instruction::And ||
3038 if (NotVal->getOpcode() == Instruction::And)
3080 Value *And = Builder.CreateAnd(X, ConstantExpr::getNot(C2));
3081 return BinaryOperator::CreateXor(And, ConstantExpr::getNot(C1));