| /external/llvm/include/llvm/CodeGen/ |
| IntrinsicLowering.h | 22 class CallInst;
50 void LowerIntrinsicCall(CallInst *CI);
55 static bool LowerToByteSwap(CallInst *CI);
|
| FunctionLoweringInfo.h | 34 class CallInst;
220 void ComputeUsesVAFloatArgument(const CallInst &I, MachineModuleInfo *MMI);
224 void AddCatchInfo(const CallInst &I,
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SimplifyLibCalls.h | 20 class CallInst;
45 Value *optimizeCall(CallInst *CI);
|
| /external/llvm/tools/bugpoint-passes/ |
| TestPasses.cpp | 38 if (isa<CallInst>(*I))
61 if (CallInst *CI = dyn_cast<CallInst>(I)) {
|
| /external/llvm/include/llvm/IR/ |
| AutoUpgrade.h | 20 class CallInst;
37 void UpgradeIntrinsicCall(CallInst *CI, Function *NewFn);
|
| CallSite.h | 36 class CallInst;
43 typename CallTy = const CallInst,
70 /// isCall - true if a CallInst is enclosed.
164 /// CallInst can be tail call optimized.
166 return isCall() && cast<CallInst>(getInstruction())->isMustTailCall();
171 return isCall() && cast<CallInst>(getInstruction())->isTailCall();
177 ? cast<CallInst>(II)->METHOD \
183 cast<CallInst>(II)->METHOD; \
325 return cast<CallInst>(getInstruction())->op_end() - 1;
332 CallInst, InvokeInst, User::op_iterator>
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| MemoryBuiltins.h | 28 class CallInst;
76 /// extractMallocCall - Returns the corresponding CallInst if the instruction
77 /// is a malloc call. Since CallInst::CreateMalloc() only creates calls, we
79 const CallInst *extractMallocCall(const Value *I, const TargetLibraryInfo *TLI);
80 static inline CallInst *extractMallocCall(Value *I,
82 return const_cast<CallInst*>(extractMallocCall((const Value*)I, TLI));
85 /// isArrayMalloc - Returns the corresponding CallInst if the instruction
88 const CallInst *isArrayMalloc(const Value *I, const DataLayout *DL,
96 PointerType *getMallocType(const CallInst *CI, const TargetLibraryInfo *TLI);
103 Type *getMallocAllocatedType(const CallInst *CI, const TargetLibraryInfo *TLI)
[all...] |
| /art/compiler/llvm/ |
| runtime_support_builder_x86.cc | 32 using ::llvm::CallInst;
48 CallInst* thread = irb_.CreateCall(func);
60 CallInst* result = irb_.CreateCall(func);
73 CallInst* call_inst = irb_.CreateCall(func, value);
|
| runtime_support_builder_arm.cc | 31 using ::llvm::CallInst;
65 CallInst* thread = irb_.CreateCall(func);
79 CallInst* result = irb_.CreateCall(func);
94 CallInst* call_inst = irb_.CreateCall(func, value);
108 CallInst* old_thread_register = irb_.CreateCall(func);
|
| /external/llvm/lib/Analysis/ |
| CodeMetrics.cpp | 32 if (isa<CallInst>(II) || isa<InvokeInst>(II)) {
67 if (const CallInst *CI = dyn_cast<CallInst>(II))
|
| /external/llvm/unittests/IR/ |
| WaymarkTest.cpp | 33 const CallInst *A = CallInst::Create(F, makeArrayRef(values));
34 ASSERT_NE(A, (const CallInst*)nullptr);
|
| /external/llvm/lib/IR/ |
| IRBuilder.cpp | 55 static CallInst *createCallHelper(Value *Callee, ArrayRef<Value *> Ops,
57 CallInst *CI = CallInst::Create(Callee, Ops, "");
63 CallInst *IRBuilderBase::
72 CallInst *CI = createCallHelper(TheFn, Ops, this);
81 CallInst *IRBuilderBase::
92 CallInst *CI = createCallHelper(TheFn, Ops, this);
105 CallInst *IRBuilderBase::
116 CallInst *CI = createCallHelper(TheFn, Ops, this);
125 CallInst *IRBuilderBase::CreateLifetimeStart(Value *Ptr, ConstantInt *Size)
[all...] |
| Instruction.cpp | 286 if (const CallInst *CI = dyn_cast<CallInst>(I1))
287 return CI->isTailCall() == cast<CallInst>(I2)->isTailCall() &&
288 CI->getCallingConv() == cast<CallInst>(I2)->getCallingConv() &&
289 CI->getAttributes() == cast<CallInst>(I2)->getAttributes();
413 return !cast<CallInst>(this)->doesNotAccessMemory();
433 return !cast<CallInst>(this)->onlyReadsMemory();
442 if (const CallInst *CI = dyn_cast<CallInst>(this))
448 if (const CallInst *CI = dyn_cast<CallInst>(this)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LowerExpectIntrinsic.cpp | 62 CallInst *CI = dyn_cast<CallInst>(SI->getCondition());
106 CallInst *CI;
110 CI = dyn_cast<CallInst>(BI->getCondition());
114 CI = dyn_cast<CallInst>(CmpI->getOperand(0));
165 CallInst *CI = dyn_cast<CallInst>(BI++);
|
| LowerInvoke.cpp | 60 CallInst *NewCall = CallInst::Create(II->getCalledValue(),
|
| SimplifyLibCalls.cpp | 60 virtual Value *callOptimizer(Function *Callee, CallInst *CI, IRBuilder<> &B)
67 Value *optimizeCall(CallInst *CI, const DataLayout *DL,
117 static bool callHasFloatingPointArgument(const CallInst *CI) {
118 for (CallInst::const_op_iterator it = CI->op_begin(), e = CI->op_end();
152 CallInst *CI;
178 Value *callOptimizer(Function *Callee, CallInst *CI,
202 Value *callOptimizer(Function *Callee, CallInst *CI,
226 Value *callOptimizer(Function *Callee, CallInst *CI,
251 Value *callOptimizer(Function *Callee, CallInst *CI,
297 Value *callOptimizer(Function *Callee, CallInst *CI
[all...] |
| /external/llvm/examples/Fibonacci/ |
| fibonacci.cpp | 72 CallInst *CallFibX1 = CallInst::Create(FibF, Sub, "fibx1", RecurseBB);
77 CallInst *CallFibX2 = CallInst::Create(FibF, Sub, "fibx2", RecurseBB);
|
| /external/llvm/lib/Transforms/Scalar/ |
| PartiallyInlineLibCalls.cpp | 44 bool optimizeSQRT(CallInst *Call, Function *CalledFunc,
70 CallInst *Call = dyn_cast<CallInst>(&*II);
102 bool PartiallyInlineLibCalls::optimizeSQRT(CallInst *Call,
|
| TailRecursionElimination.cpp | 103 CallInst *FindTRECandidate(Instruction *I,
105 bool EliminateRecursiveTailCall(CallInst *CI, ReturnInst *Ret,
119 bool CanMoveAboveCall(Instruction *I, CallInst *CI);
120 Value *CanTransformAccumulatorRecursion(Instruction *I, CallInst *CI);
290 SmallVector<CallInst *, 32> DeferredTails;
299 CallInst *CI = dyn_cast<CallInst>(&I);
365 for (CallInst *CI : DeferredTails) {
440 bool TailCallElim::CanMoveAboveCall(Instruction *I, CallInst *CI) {
478 static bool isDynamicConstant(Value *V, CallInst *CI, ReturnInst *RI)
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 116 if (CallInst *CI = dyn_cast<CallInst>(I)) {
181 CallInst *Call = CallInst::Create(II->getCalledValue(), Args, "", II);
211 if (CallInst *CI = dyn_cast<CallInst>(I++))
243 if (CallInst *CI = dyn_cast<CallInst>(I)) {
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARC.h | 204 if (const CallInst *CI = dyn_cast<CallInst>(V)) {
226 V = cast<CallInst>(V)->getArgOperand(0);
240 V = cast<CallInst>(V)->getArgOperand(0);
253 V = cast<CallInst>(V)->getArgOperand(0);
262 return StripPointerCastsAndObjCCalls(cast<CallInst>(Inst)->getArgOperand(0));
283 Value *OldArg = cast<CallInst>(CI)->getArgOperand(0);
367 if (isa<CallInst>(V) || isa<InvokeInst>(V) ||
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.h | 34 class CallInst;
337 /// put the relevant callinst into the stack protector check success
344 /// implying one could not create a DAG Combine to move the callinst.
375 /// returninst or if there is a callinst that could potentially be
413 const CallInst &StackProtCheckCall) {
629 std::pair<SDValue, SDValue> LowerCallOperands(const CallInst &CI,
750 void visitCall(const CallInst &I);
751 bool visitMemCmpCall(const CallInst &I);
752 bool visitMemChrCall(const CallInst &I);
753 bool visitStrCpyCall(const CallInst &I, bool isStpcpy)
[all...] |
| /external/llvm/lib/Target/R600/ |
| SIAnnotateControlFlow.cpp | 193 Value *Ret = CallInst::Create(If, Term->getCondition(), "", Term);
200 Value *Ret = CallInst::Create(Else, popSaved(), "", Term);
236 CallInst *OldEnd = dyn_cast<CallInst>(Parent->getFirstInsertionPt());
239 Ret = CallInst::Create(ElseBreak, Args, "", OldEnd);
244 Value *PhiArg = CallInst::Create(Break, Broken, "", Insert);
254 return CallInst::Create(IfBreak, Args, "", Insert);
278 Term->setCondition(CallInst::Create(Loop, Arg, "", Term));
284 CallInst::Create(EndCf, popSaved(), "", BB->getFirstInsertionPt());
|
| /external/lldb/include/lldb/Expression/ |
| IRDynamicChecks.h | 18 class CallInst;
|
| /external/llvm/lib/CodeGen/ |
| DwarfEHPrepare.cpp | 142 CallInst *CI = CallInst::Create(RewindFunction, ExnObj, "", UnwindBB);
169 CallInst *CI = CallInst::Create(RewindFunction, PN, "", UnwindBB);
|
