/external/llvm/include/llvm/CodeGen/ |
IntrinsicLowering.h | 22 class CallInst; 50 void LowerIntrinsicCall(CallInst *CI); 55 static bool LowerToByteSwap(CallInst *CI);
|
FunctionLoweringInfo.h | 35 class CallInst; 214 void ComputeUsesVAFloatArgument(const CallInst &I, MachineModuleInfo *MMI); 218 void AddCatchInfo(const CallInst &I,
|
/external/llvm/include/llvm/ |
AutoUpgrade.h | 21 class CallInst; 31 void UpgradeIntrinsicCall(CallInst *CI, Function *NewFn);
|
/external/llvm/include/llvm/Transforms/Utils/ |
SimplifyLibCalls.h | 20 class CallInst; 44 Value *optimizeCall(CallInst *CI);
|
Cloning.h | 36 class CallInst; 193 bool InlineFunction(CallInst *C, InlineFunctionInfo &IFI, bool InsertLifetime = true);
|
/external/llvm/tools/bugpoint-passes/ |
TestPasses.cpp | 38 if (isa<CallInst>(*I)) 61 if (CallInst *CI = dyn_cast<CallInst>(I)) {
|
/external/llvm/include/llvm/Analysis/ |
MemoryBuiltins.h | 28 class CallInst; 72 /// extractMallocCall - Returns the corresponding CallInst if the instruction 73 /// is a malloc call. Since CallInst::CreateMalloc() only creates calls, we 75 const CallInst *extractMallocCall(const Value *I, const TargetLibraryInfo *TLI); 76 static inline CallInst *extractMallocCall(Value *I, 78 return const_cast<CallInst*>(extractMallocCall((const Value*)I, TLI)); 81 /// isArrayMalloc - Returns the corresponding CallInst if the instruction 84 const CallInst *isArrayMalloc(const Value *I, const DataLayout *TD, 92 PointerType *getMallocType(const CallInst *CI, const TargetLibraryInfo *TLI); 99 Type *getMallocAllocatedType(const CallInst *CI, const TargetLibraryInfo *TLI) [all...] |
/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 | 32 const CallInst *A = CallInst::Create(F, makeArrayRef(values)); 33 ASSERT_NE(A, (const CallInst*)NULL);
|
/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 | 296 if (const CallInst *CI = dyn_cast<CallInst>(this)) 297 return CI->isTailCall() == cast<CallInst>(I)->isTailCall() && 298 CI->getCallingConv() == cast<CallInst>(I)->getCallingConv() && 299 CI->getAttributes() == cast<CallInst>(I)->getAttributes(); 369 if (const CallInst *CI = dyn_cast<CallInst>(this)) 370 return CI->isTailCall() == cast<CallInst>(I)->isTailCall() && 371 CI->getCallingConv() == cast<CallInst>(I)->getCallingConv() && 372 CI->getAttributes() == cast<CallInst>(I)->getAttributes() [all...] |
/external/llvm/lib/Transforms/Utils/ |
LowerExpectIntrinsic.cpp | 61 CallInst *CI = dyn_cast<CallInst>(SI->getCondition()); 105 CallInst *CI = dyn_cast<CallInst>(CmpI->getOperand(0)); 151 CallInst *CI = dyn_cast<CallInst>(BI++);
|
SimplifyLibCalls.cpp | 53 virtual Value *callOptimizer(Function *Callee, CallInst *CI, IRBuilder<> &B) 60 Value *optimizeCall(CallInst *CI, const DataLayout *TD, 112 static bool callHasFloatingPointArgument(const CallInst *CI) { 113 for (CallInst::const_op_iterator it = CI->op_begin(), e = CI->op_end(); 132 CallInst *CI; 157 virtual Value *callOptimizer(Function *Callee, CallInst *CI, IRBuilder<> &B) { 180 virtual Value *callOptimizer(Function *Callee, CallInst *CI, IRBuilder<> &B) { 203 virtual Value *callOptimizer(Function *Callee, CallInst *CI, IRBuilder<> &B) { 227 virtual Value *callOptimizer(Function *Callee, CallInst *CI, IRBuilder<> &B) { 272 virtual Value *callOptimizer(Function *Callee, CallInst *CI, IRBuilder<> &B) [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/include/llvm/Support/ |
CallSite.h | 37 class CallInst; 44 typename CallTy = const CallInst, 71 /// isCall - true if a CallInst is enclosed. 159 ? cast<CallInst>(II)->METHOD \ 165 cast<CallInst>(II)->METHOD; \ 275 return cast<CallInst>(getInstruction())->op_end() - 1; 282 CallInst, InvokeInst, User::op_iterator> { 284 CallInst, InvokeInst, User::op_iterator> Base; 289 CallSite(CallInst *CI) : Base(CI) {} 308 ImmutableCallSite(const CallInst *CI) : Base(CI) { [all...] |
/external/llvm/lib/Transforms/Scalar/ |
TailRecursionElimination.cpp | 95 CallInst *FindTRECandidate(Instruction *I, 97 bool EliminateRecursiveTailCall(CallInst *CI, ReturnInst *Ret, 111 bool CanMoveAboveCall(Instruction *I, CallInst *CI); 112 Value *CanTransformAccumulatorRecursion(Instruction *I, CallInst *CI); 232 if (CallInst *CI = dyn_cast<CallInst>(I)) { 245 bool TailCallElim::CanMoveAboveCall(Instruction *I, CallInst *CI) { 283 static bool isDynamicConstant(Value *V, CallInst *CI, ReturnInst *RI) { 318 static Value *getCommonReturnValue(ReturnInst *IgnoreRI, CallInst *CI) { 346 CallInst *CI) [all...] |
SimplifyCFGPass.cpp | 84 CallInst *CallTrap = CallInst::Create(TrapFn, "", I); 101 CallInst *NewCall = CallInst::Create(II->getCalledValue(), Args, "", II); 130 if (CallInst *CI = dyn_cast<CallInst>(BBI)) {
|
/external/llvm/lib/Transforms/IPO/ |
PruneEH.cpp | 115 if (CallInst *CI = dyn_cast<CallInst>(I)) { 182 CallInst *Call = CallInst::Create(II->getCalledValue(), Args, "", II); 212 if (CallInst *CI = dyn_cast<CallInst>(I++)) 244 if (CallInst *CI = dyn_cast<CallInst>(I)) {
|
/external/llvm/lib/Transforms/ObjCARC/ |
ObjCARC.h | 198 if (const CallInst *CI = dyn_cast<CallInst>(V)) { 220 V = cast<CallInst>(V)->getArgOperand(0); 234 V = cast<CallInst>(V)->getArgOperand(0); 247 V = cast<CallInst>(V)->getArgOperand(0); 256 return StripPointerCastsAndObjCCalls(cast<CallInst>(Inst)->getArgOperand(0)); 277 Value *OldArg = cast<CallInst>(CI)->getArgOperand(0); 358 if (isa<CallInst>(V) || isa<InvokeInst>(V) ||
|
ObjCARCContract.cpp | 77 SmallPtrSet<CallInst *, 8> StoreStrongCalls; 187 CallInst *Retain = 0; 203 Retain = dyn_cast_or_null<CallInst>(*DependingInstructions.begin()); 303 CallInst *StoreStrong = 304 CallInst::Create(getStoreStrongCallee(BB->getParent()->getParent()), 424 CallInst::Create(IA, "", Inst); 431 CallInst *CI = cast<CallInst>(Inst); 464 const Value *Arg = cast<CallInst>(Inst)->getArgOperand(0); 531 for (SmallPtrSet<CallInst *, 8>::iterator I = StoreStrongCalls.begin() [all...] |
ObjCARCOpts.cpp | 148 cast<CallInst>(Arg)->getArgOperand(0)); [all...] |
/external/llvm/lib/Target/R600/ |
SIAnnotateControlFlow.cpp | 190 Value *Ret = CallInst::Create(If, Term->getCondition(), "", Term); 197 Value *Ret = CallInst::Create(Else, popSaved(), "", Term); 227 CallInst *OldEnd = dyn_cast<CallInst>(Parent->getFirstInsertionPt()); 233 Value *Ret = CallInst::Create(ElseBreak, Args, "", OldEnd); 241 Value *Ret = CallInst::Create(Break, Arg, "", Insert); 250 Value *Ret = CallInst::Create(IfBreak, Args, "", Insert); 278 Term->setCondition(CallInst::Create(Loop, Arg, "", Term)); 284 CallInst::Create(EndCf, popSaved(), "", BB->getFirstInsertionPt());
|
AMDILPeepholeOptimizer.cpp | 93 bool expandBFI(CallInst *CI); 96 bool expandBFM(CallInst *CI); 100 bool isSigned24BitOps(CallInst *CI); 101 void expandSigned24BitOps(CallInst *CI); 105 bool isRWGLocalOpt(CallInst *CI); 109 bool convertAccurateDivide(CallInst *CI); 110 void expandAccurateDivide(CallInst *CI); 119 bool propagateSamplerInst(CallInst *CI); 137 SmallVector< std::pair<CallInst *, Function *>, 16> atomicFuncs; 138 SmallVector<CallInst *, 16> isConstVec [all...] |
/external/llvm/lib/CodeGen/ |
DwarfEHPrepare.cpp | 145 CallInst *CI = CallInst::Create(RewindFunction, ExnObj, "", UnwindBB); 172 CallInst *CI = CallInst::Create(RewindFunction, PN, "", UnwindBB);
|
/external/llvm/examples/BrainF/ |
BrainF.cpp | 87 ptr_arr = CallInst::CreateMalloc(BB, IntPtrTy, Int8Ty, allocsize, val_mem, 101 CallInst *memset_call = builder-> 125 endbb->getInstList().push_back(CallInst::CreateFree(ptr_arr, endbb)); 172 CallInst *puts_call = 173 CallInst::Create(puts_func, 204 CallInst *getchar_call = builder->CreateCall(getchar_func, tapereg); 230 CallInst *putchar_call = builder->
|