/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
H A D | AtomicExpandPass.cpp | 286 AtomicRMWInst::BinOp Op = RMWI->getOperation(); 496 static Value *performAtomicOp(AtomicRMWInst::BinOp Op, IRBuilder<> &Builder, 717 static Value *performMaskedAtomicOp(AtomicRMWInst::BinOp Op, 809 AtomicRMWInst::BinOp Op = AI->getOperation(); 989 AtomicRMWInst::BinOp RMWOp = AI->getOperation(); 1372 AtomicRMWInst::BinOp Op = RMWI->getOperation(); 1555 static ArrayRef<RTLIB::Libcall> GetRMWLibcall(AtomicRMWInst::BinOp Op) {
|
H A D | CodeGenPrepare.cpp | 4171 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst); local 4172 if (isa_and_nonnull<OverflowingBinaryOperator>(BinOp) && 4173 ((!IsSExt && BinOp->hasNoUnsignedWrap()) || 4174 (IsSExt && BinOp->hasNoSignedWrap()))) 7834 BinaryOperator *BinOp = dyn_cast<BinaryOperator>(I); local 7836 if (BinOp && (BinOp->getOpcode() == Instruction::And) && EnableAndCmpSinking) 7837 return sinkAndCmp0Expression(BinOp, *TLI, InsertedInsts); 7840 if (BinOp && (BinOp [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
H A D | AttributorAttributes.cpp | 7266 Attributor &A, BinaryOperator *BinOp, IntegerRangeState &T, 7269 Value *LHS = BinOp->getOperand(0); 7270 Value *RHS = BinOp->getOperand(1); 7287 auto AssumedRange = LHSAARange.binaryOp(BinOp->getOpcode(), RHSAARange); 7386 if (auto *BinOp = dyn_cast<BinaryOperator>(I)) { 7387 if (!calculateBinaryOperator(A, BinOp, T, CtxI, QuerriedAAs)) 7636 static APInt calculateBinaryOperator(const BinaryOperator *BinOp, argument 7639 Instruction::BinaryOps BinOpcode = BinOp->getOpcode(); 7694 bool calculateBinaryOperatorAndTakeUnion(const BinaryOperator *BinOp, argument 7699 calculateBinaryOperator(BinOp, LH 7265 calculateBinaryOperator( Attributor &A, BinaryOperator *BinOp, IntegerRangeState &T, const Instruction *CtxI, SmallVectorImpl<const AAValueConstantRange *> &QuerriedAAs) argument 7824 updateWithBinaryOperator(Attributor &A, BinaryOperator *BinOp) argument [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineCasts.cpp | 628 BinaryOperator *BinOp; 629 if (!match(Trunc.getOperand(0), m_OneUse(m_BinOp(BinOp)))) 632 Value *BinOp0 = BinOp->getOperand(0); 633 Value *BinOp1 = BinOp->getOperand(1); 634 switch (BinOp->getOpcode()) { 646 return BinaryOperator::Create(BinOp->getOpcode(), NarrowC, TruncX); 652 return BinaryOperator::Create(BinOp->getOpcode(), TruncX, NarrowC); 658 return BinaryOperator::Create(BinOp->getOpcode(), X, NarrowOp1); 663 return BinaryOperator::Create(BinOp->getOpcode(), NarrowOp0, X);
|
H A D | InstCombineAndOrXor.cpp | 111 Value *BinOp = Builder.CreateBinOp(I.getOpcode(), NewLHS, NewRHS); 114 return Builder.CreateCall(F, BinOp); 1853 BinaryOperator::BinaryOps BinOp = cast<BinaryOperator>(Op0)->getOpcode(); local 1858 return BinaryOperator::Create(BinOp, X, NewRHS); 1864 return BinaryOperator::Create(BinOp, NewLHS, Y); 1926 Value *BinOp; local 1929 BinOp = Builder.CreateBinOp(Op0I->getOpcode(), X, TruncC1); 1931 BinOp = Builder.CreateBinOp(Op0I->getOpcode(), TruncC1, X); 1933 auto *And = Builder.CreateAnd(BinOp, TruncC2); 2244 Value *BinOp [all...] |
/netbsd-current/external/apache2/llvm/dist/clang/lib/CodeGen/ |
H A D | CGBuilder.h | 143 CreateAtomicRMW(llvm::AtomicRMWInst::BinOp Op, llvm::Value *Ptr,
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/MCJIT/cached/ |
H A D | toy-jit.cpp | 498 int BinOp = CurTok; local 505 // If BinOp binds less tightly with RHS than the operator after RHS, let 514 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
H A D | toy.cpp | 505 int BinOp = CurTok; local 512 // If BinOp binds less tightly with RHS than the operator after RHS, let 521 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/MCJIT/initial/ |
H A D | toy.cpp | 482 int BinOp = CurTok; local 489 // If BinOp binds less tightly with RHS than the operator after RHS, let 498 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/MCJIT/lazy/ |
H A D | toy-jit.cpp | 483 int BinOp = CurTok; local 490 // If BinOp binds less tightly with RHS than the operator after RHS, let 499 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
H A D | toy.cpp | 484 int BinOp = CurTok; local 491 // If BinOp binds less tightly with RHS than the operator after RHS, let 500 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter3/ |
H A D | toy.cpp | 566 int BinOp = CurTok; local 574 // If BinOp binds less tightly with RHS than the operator after RHS, let 585 std::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter2/ |
H A D | toy.cpp | 566 int BinOp = CurTok; local 574 // If BinOp binds less tightly with RHS than the operator after RHS, let 585 std::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter1/ |
H A D | toy.cpp | 566 int BinOp = CurTok; local 574 // If BinOp binds less tightly with RHS than the operator after RHS, let 585 std::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter7/ |
H A D | toy.cpp | 571 int BinOp = CurTok; local 579 // If BinOp binds less tightly with RHS than the operator after RHS, let 590 std::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter8/ |
H A D | toy.cpp | 572 int BinOp = CurTok; local 580 // If BinOp binds less tightly with RHS than the operator after RHS, let 591 std::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter4/ |
H A D | toy.cpp | 549 int BinOp = CurTok; local 557 // If BinOp binds less tightly with RHS than the operator after RHS, let 568 std::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter6/ |
H A D | toy.cpp | 498 int BinOp = CurTok; local 506 // If BinOp binds less tightly with RHS than the operator after RHS, let 517 std::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter5/ |
H A D | toy.cpp | 448 int BinOp = CurTok; local 456 // If BinOp binds less tightly with RHS than the operator after RHS, let 467 std::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/ |
H A D | sumtype.d | 159 alias BinOp = Expr.Types[2]; 176 return new Expr(BinOp(op, lhs, rhs)); 179 // Convenience wrappers for creating BinOp expressions 191 (BinOp bop) 215 (BinOp bop) => "(%s %s %s)".format(
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
H A D | Instructions.h | 726 enum BinOp : unsigned { 769 typename Bitfield::Element<BinOp, Offset, 4, BinOp::LAST_BINOP>; 772 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val, Align Alignment, 775 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val, Align Alignment, 793 BinOp getOperation() const { return getSubclassData<OperationField>(); } 795 static StringRef getOperationName(BinOp Op); 797 static bool isFPOperation(BinOp Op) { 807 void setOperation(BinOp Operation) { 879 void Init(BinOp Operatio [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
H A D | PPCISelLowering.cpp | 13097 SDValue BinOp = BinOps.pop_back_val(); local 13099 if (!Visited.insert(BinOp.getNode()).second) 13102 PromOps.push_back(BinOp); 13104 for (unsigned i = 0, ie = BinOp.getNumOperands(); i != ie; ++i) { 13106 if (BinOp.getOpcode() == ISD::SELECT && i == 0) 13108 if (BinOp.getOpcode() == ISD::SELECT_CC && i != 2 && i != 3) 13111 if (((BinOp.getOperand(i).getOpcode() == ISD::SIGN_EXTEND || 13112 BinOp.getOperand(i).getOpcode() == ISD::ZERO_EXTEND || 13113 BinOp.getOperand(i).getOpcode() == ISD::ANY_EXTEND) && 13114 BinOp 13312 SDValue BinOp = BinOps.pop_back_val(); local [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/IR/ |
H A D | Core.cpp | 3592 static AtomicRMWInst::BinOp mapFromLLVMRMWBinOp(LLVMAtomicRMWBinOp BinOp) { 3593 switch (BinOp) { 3612 static LLVMAtomicRMWBinOp mapToLLVMRMWBinOp(AtomicRMWInst::BinOp BinOp) { 3613 switch (BinOp) { 3759 void LLVMSetAtomicRMWBinOp(LLVMValueRef Inst, LLVMAtomicRMWBinOp BinOp) { 3760 unwrap<AtomicRMWInst>(Inst)->setOperation(mapFromLLVMRMWBinOp(BinOp)); 3986 AtomicRMWInst::BinOp intop = mapFromLLVMRMWBinOp(op);
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/MCJIT/complete/ |
H A D | toy.cpp | 524 int BinOp = CurTok; local 531 // If BinOp binds less tightly with RHS than the operator after RHS, let 540 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
/netbsd-current/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter9/ |
H A D | toy.cpp | 683 int BinOp = CurTok; local 692 // If BinOp binds less tightly with RHS than the operator after RHS, let 702 LHS = std::make_unique<BinaryExprAST>(BinLoc, BinOp, std::move(LHS),
|