/external/llvm/include/llvm/Analysis/ |
H A D | SparsePropagation.h | 195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs, 200 void visitTerminatorInst(TerminatorInst &TI);
|
/external/llvm/lib/Analysis/ |
H A D | LoopInfo.cpp | 243 TerminatorInst *TI = (*I)->getTerminator(); local 247 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) { 248 if (TI->getSuccessor(i) == H) { 249 MD = TI->getMetadata(LoopMDName); 280 TerminatorInst *TI = (*I)->getTerminator(); local 281 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) { 282 if (TI->getSuccessor(i) == H) 283 TI->setMetadata(LoopMDName, LoopID);
|
/external/llvm/lib/CodeGen/ |
H A D | DwarfEHPrepare.cpp | 112 TerminatorInst *TI = I->getTerminator(); local 113 if (ResumeInst *RI = dyn_cast<ResumeInst>(TI))
|
H A D | ShadowStackGC.cpp | 119 TerminatorInst *TI = CurBB->getTerminator(); local 120 if (!isa<ReturnInst>(TI) && !isa<ResumeInst>(TI)) 123 Builder.SetInsertPoint(TI->getParent(), TI);
|
/external/llvm/lib/IR/ |
H A D | Pass.cpp | 187 const PassInfo *Pass::lookupPassInfo(const void *TI) { argument 188 return PassRegistry::getPassRegistry()->getPassInfo(TI);
|
H A D | PassRegistry.cpp | 42 const PassInfo *PassRegistry::getPassInfo(const void *TI) const { 44 MapType::const_iterator I = PassInfoMap.find(TI);
|
H A D | Dominators.cpp | 42 const TerminatorInst *TI = Start->getTerminator(); local 44 for (unsigned int i = 0, n = TI->getNumSuccessors(); i < n; ++i) { 45 if (TI->getSuccessor(i) == End)
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | SampleProfile.cpp | 925 TerminatorInst *TI = B->getTerminator(); local 926 if (TI->getNumSuccessors() == 1) 928 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI)) 932 << TI->getDebugLoc().getLine() << ".\n"); 935 for (unsigned I = 0; I < TI->getNumSuccessors(); ++I) { 936 BasicBlock *Succ = TI->getSuccessor(I); 949 TI->setMetadata(llvm::LLVMContext::MD_prof,
|
H A D | LoopDeletion.cpp | 191 TerminatorInst *TI = preheader->getTerminator(); local 192 TI->replaceUsesOfWith(L->getHeader(), exitBlock);
|
H A D | TailRecursionElimination.cpp | 568 TailCallElim::FindTRECandidate(Instruction *TI, argument 570 BasicBlock *BB = TI->getParent(); 573 if (&BB->front() == TI) // Make sure there is something before the terminator. 579 BasicBlock::iterator BBI = TI; 601 FirstNonDbg(std::next(BB->begin())) == TI &&
|
H A D | LoopRotation.cpp | 426 TerminatorInst *TI = OrigHeader->getTerminator(); local 427 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 428 for (BasicBlock::iterator BI = TI->getSuccessor(i)->begin();
|
/external/llvm/utils/TableGen/ |
H A D | SubtargetEmitter.cpp | 854 TI = SCI->Transitions.begin(), TE = SCI->Transitions.end(); 855 TI != TE; ++TI) { 856 if (TI->ProcIndices[0] == 0) { 860 IdxIter PIPos = std::find(TI->ProcIndices.begin(), 861 TI->ProcIndices.end(), ProcModel.Index); 862 if (PIPos != TI->ProcIndices.end()) { 1324 TI = SC.Transitions.begin(), TE = SC.Transitions.end(); 1325 TI != TE; ++TI) { [all...] |
H A D | FastISelEmitter.cpp | 602 for (TypeRetPredMap::const_iterator TI = TM.begin(), TE = TM.end(); 603 TI != TE; ++TI) { 604 MVT::SimpleValueType VT = TI->first; 605 const RetPredMap &RM = TI->second; 776 for (TypeRetPredMap::const_iterator TI = TM.begin(), TE = TM.end(); 777 TI != TE; ++TI) { 778 MVT::SimpleValueType VT = TI->first;
|
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | DependencyAnalysis.cpp | 254 const TerminatorInst *TI = cast<TerminatorInst>(&BB->back()); local 255 for (succ_const_iterator SI(TI), SE(TI, false); SI != SE; ++SI) {
|
/external/llvm/lib/Transforms/Utils/ |
H A D | SimplifyCFG.cpp | 96 Value *isValueEqualityComparison(TerminatorInst *TI); 97 BasicBlock *GetValueEqualityComparisonCases(TerminatorInst *TI, 99 bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI, 102 bool FoldValueComparisonIntoPredecessors(TerminatorInst *TI, 454 static void EraseTerminatorInstAndDCECond(TerminatorInst *TI) { argument 456 if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) { 458 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { 461 } else if (IndirectBrInst *IBI = dyn_cast<IndirectBrInst>(TI)) { 465 TI->eraseFromParent(); 471 Value *SimplifyCFGOpt::isValueEqualityComparison(TerminatorInst *TI) { argument 499 GetValueEqualityComparisonCases(TerminatorInst *TI, std::vector<ValueEqualityComparisonCase> &Cases) argument 569 SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI, BasicBlock *Pred, IRBuilder<> &Builder) argument 737 GetBranchWeights(TerminatorInst *TI, SmallVectorImpl<uint64_t> &Weights) argument 771 FoldValueComparisonIntoPredecessors(TerminatorInst *TI, IRBuilder<> &Builder) argument 3030 TerminatorInst *TI = Preds[i]->getTerminator(); local [all...] |
H A D | LoopSimplify.cpp | 451 TerminatorInst *TI = BackedgeBlocks[i]->getTerminator(); local 452 for (unsigned Op = 0, e = TI->getNumSuccessors(); Op != e; ++Op) 453 if (TI->getSuccessor(Op) == Header) 454 TI->setSuccessor(Op, BEBlock); 509 TerminatorInst *TI = (*I)->getTerminator(); local 510 TI->replaceAllUsesWith(UndefValue::get(TI->getType()));
|
/external/strace/linux/ia64/ |
H A D | syscallent.h | 900 { 3, TI, sys_semget, "semget" }, /* 1106 */ 901 { 3, TI, printargs, "semop" }, /* 1107 */ 902 { 4, TI, sys_semctl, "semctl" }, /* 1108 */ 903 { 2, TI, sys_msgget, "msgget" }, /* 1109 */ 904 { 4, TI, sys_msgsnd, "msgsnd" }, /* 1110 */ 905 { 5, TI, sys_msgrcv, "msgrcv" }, /* 1111 */ 906 { 3, TI, sys_msgctl, "msgctl" }, /* 1112 */ 907 { 3, TI, sys_shmget, "shmget" }, /* 1113 */ 908 { 3, TI|TM|SI, sys_shmat, "shmat" }, /* 1114 */ 909 { 1, TI|T [all...] |
/external/clang/lib/ASTMatchers/Dynamic/ |
H A D | Registry.cpp | 416 for (std::set<ASTNodeKind>::iterator TI = TypeSet.begin(), 418 TI != TE; ++TI) { 421 if (I->second->isConvertibleTo(*TI, &Specificity, &LeastDerivedKind)) { 426 I->second->getArgKinds(*TI, Arg, ArgsKinds[Arg]);
|
/external/clang/lib/Sema/ |
H A D | JumpDiagnostics.cpp | 604 TI = TargetScopes.begin(), TE = TargetScopes.end(); TI != TE; ++TI) { 605 unsigned TargetScope = TI->first; 606 LabelDecl *TargetLabel = TI->second;
|
/external/llvm/lib/TableGen/ |
H A D | Record.cpp | 227 Init *IntRecTy::convertValue(TypedInit *TI) { argument 228 if (TI->getType()->typeIsConvertibleTo(this)) 229 return TI; // Accept variable if already of the right type! 264 Init *StringRecTy::convertValue(TypedInit *TI) { argument 265 if (isa<StringRecTy>(TI->getType())) 266 return TI; // Accept variable if already of the right type! 291 Init *ListRecTy::convertValue(TypedInit *TI) { argument 292 // Ensure that TI is compatible with our class. 293 if (ListRecTy *LRT = dyn_cast<ListRecTy>(TI->getType())) 295 return TI; 305 convertValue(TypedInit *TI) argument 349 convertValue(TypedInit *TI) argument [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | ImmutableSet.h | 443 typename TreeTy::iterator& TI, 446 for ( ; I!=E ; ++I, ++TI) { 447 if (TI == TE || !I->isElementEqual(*TI)) 624 typename TreeTy::iterator TI = T->begin(), TE = T->end(); local 625 if (!compareTreeWithSection(TNew, TI, TE)) 627 if (TI != TE) 442 compareTreeWithSection(TreeTy* T, typename TreeTy::iterator& TI, typename TreeTy::iterator& TE) argument
|
/external/llvm/include/llvm/ |
H A D | Pass.h | 184 static const PassInfo *lookupPassInfo(const void *TI);
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGDumper.cpp | 425 } else if (const TargetIndexSDNode *TI = dyn_cast<TargetIndexSDNode>(this)) { 426 OS << "<" << TI->getIndex() << '+' << TI->getOffset() << ">"; 427 if (unsigned TF = TI->getTargetFlags())
|
/external/clang/lib/Lex/ |
H A D | PPExpressions.cpp | 292 const TargetInfo &TI = PP.getTargetInfo(); local 295 NumBits = TI.getIntWidth(); 297 NumBits = TI.getWCharWidth(); 299 NumBits = TI.getChar16Width(); 301 NumBits = TI.getChar32Width(); 303 NumBits = TI.getCharWidth();
|
/external/llvm/include/llvm/TableGen/ |
H A D | Record.h | 123 virtual Init *convertValue( TypedInit *TI) { return nullptr; } argument 165 Init *convertValue( TypedInit *TI) override; 204 Init *convertValue( TypedInit *TI) override; 241 Init *convertValue( TypedInit *TI) override; 280 Init *convertValue( TypedInit *TI) override; 319 Init *convertValue( TypedInit *TI) override; 357 Init *convertValue( TypedInit *TI) override; 1094 TypedInit *TI; member in class:llvm::VarBitInit 1097 VarBitInit(TypedInit *T, unsigned B) : Init(IK_VarBitInit), TI(T), Bit(B) { 1118 Init *getBitVar() const override { return TI; } [all...] |