| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 431 Loops[Exit] = N->getEntry(); in analyzeLoops()
460 BasicBlock *BB = N->getEntry(); in gatherPredicates()
506 BasicBlock *Entry = R->getEntry(); in gatherPredicates()
530 << RN->getEntry()->getName() << "\n"); in collectInfos()
536 Visited.insert(RN->getEntry()); in collectInfos()
736 Order.back()->getEntry(); in getNextFlow()
746 BasicBlock *Entry = PrevNode->getEntry(); in needPrefix()
783 BBPredicates &Preds = Predicates[Node->getEntry()]; in dominatesPredicates()
791 BBPredicates &Preds = Predicates[Node->getEntry()]; in isPredictableTrue()
805 if (!Dominated && DT->dominates(BB, PrevNode->getEntry())) in isPredictableTrue()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | RegionIterator.h | 111 BItor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
114 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator()
124 BItor(BlockTraits::child_end(node->getEntry())) {} in RNSuccIterator()
150 while (BItor != BlockTraits::child_end(getNode()->getEntry())
191 : Node(node), Itor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
197 while (BlockTraits::child_end(Node->getEntry()) != Itor && in RNSuccIterator()
204 : Node(node), Itor(BlockTraits::child_end(node->getEntry())) { in RNSuccIterator()
235 while (Itor != succ_end(Node->getEntry())
294 return R->getNode(R->getEntry()); \
310 return R->getBBNode(R->getEntry()); \
|
| H A D | RegionInfoImpl.h | 70 BlockT *OldEntry = getEntry(); in replaceEntryRecursive()
79 if (Child->getEntry() == OldEntry) in replaceEntryRecursive()
110 BlockT *entry = getEntry(), *exit = getExit(); in contains()
164 BlockT *entry = getEntry(); in getEnteringBlock()
234 if (getEntry()->getName().empty()) { in getNameStr()
237 getEntry()->printAsOperand(OS, false); in getNameStr()
239 entryName = std::string(getEntry()->getName()); in getNameStr()
259 BlockT *entry = getEntry(), *exit = getExit(); in verifyBBInRegion()
302 verifyWalk(getEntry(), &visited); in verifyRegion()
352 if (R->getEntry() != BB) in getSubRegionNode()
[all …]
|
| H A D | RegionInfo.h | 174 inline BlockT *getEntry() const { return entry.getPointer(); }
322 BlockT *getEntry() const {
323 return RegionNodeBase<Tr>::getEntry();
459 return contains(SubRegion->getEntry()) &&
609 block_iterator block_begin() { return block_iterator(getEntry(), getExit()); }
614 return const_block_iterator(getEntry(), getExit());
998 return getEntry();
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanPredicator.cpp | 188 VPBasicBlock *EntryBlock = cast<VPBasicBlock>(Region->getEntry()); in predicateRegionRec()
208 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry()); in linearizeRegionRec()
236 predicateRegionRec(cast<VPRegionBlock>(Plan.getEntry())); in predicate()
239 linearizeRegionRec(cast<VPRegionBlock>(Plan.getEntry())); in predicate()
247 VPDomTree.recalculate(*(cast<VPRegionBlock>(Plan.getEntry()))); in VPlanPredicator()
|
| H A D | VPlanVerifier.cpp | 47 make_range(df_iterator<const VPBlockBase *>::begin(Region->getEntry()), in verifyBlocksInRegion()
96 const VPBlockBase *Entry = Region->getEntry(); in verifyRegion()
115 make_range(df_iterator<const VPBlockBase *>::begin(Region->getEntry()), in verifyRegionRec()
|
| H A D | VPlan.cpp | 143 Block = Region->getEntry(); in getEntryBasicBlock()
150 Block = Region->getEntry(); in getEntryBasicBlock()
155 assert(ParentPlan->getEntry() == this && in setPlan()
186 assert(Parent->getEntry() == this && in getEnclosingBlockWithPredecessors()
767 for (const VPBlockBase *Block : depth_first(getEntry())) { in print()
854 for (const VPBlockBase *Block : depth_first(Plan.getEntry())) in dump()
938 assert(Region->getEntry() && "Region contains no inner blocks."); in dumpRegion()
939 for (const VPBlockBase *Block : depth_first(Region->getEntry())) in dumpRegion()
1196 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry()); in visitRegion()
1238 visitRegion(cast<VPRegionBlock>(Plan.getEntry()), Old2New, IAI); in VPInterleavedAccessInfo()
[all …]
|
| H A D | VPlanTransforms.cpp | 24 auto *TopRegion = cast<VPRegionBlock>(Plan->getEntry()); in VPInstructionsToVPRecipes()
25 ReversePostOrderTraversal<VPBlockBase *> RPOT(TopRegion->getEntry()); in VPInstructionsToVPRecipes()
|
| H A D | VPlan.h | 1640 const VPBlockBase *getEntry() const { return Entry; } in getEntry() function
1641 VPBlockBase *getEntry() { return Entry; } in getEntry() function
1762 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1765 return nodes_iterator::begin(N->getEntry());
1781 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1784 return nodes_iterator::begin(N->getEntry());
1842 return R->getEntry();
1899 BlockTy getEntry() { return Entry; }
1914 return N.getEntry();
1933 return N.getEntry();
[all …]
|
| /netbsd-src/external/gpl3/binutils/dist/gprofng/src/ |
| H A D | CacheMap.h | 71 Entry *getEntry (Key_t key);
134 Entry *entry = getEntry (key); in put()
142 CacheMap<Key_t, Value_t>::getEntry (Key_t key) in getEntry() function
159 Entry *entry = getEntry (key); in get()
176 Entry *entry = getEntry (key); in remove()
|
| /netbsd-src/external/gpl3/binutils.old/dist/gprofng/src/ |
| H A D | CacheMap.h | 71 Entry *getEntry (Key_t key);
134 Entry *entry = getEntry (key); in put()
142 CacheMap<Key_t, Value_t>::getEntry (Key_t key) in getEntry() function
159 Entry *entry = getEntry (key); in get()
176 Entry *entry = getEntry (key); in remove()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| H A D | NonRelocatableStringpool.h | 35 EmptyString = getEntry(""); in Translator()
38 DwarfStringPoolEntryRef getEntry(StringRef S);
42 uint64_t getStringOffset(StringRef S) { return getEntry(S).getOffset(); } in getStringOffset()
|
| H A D | DwarfStringPoolEntry.h | 59 DwarfStringPoolEntry getEntry() const { return getMapEntry()->getValue(); } in getEntry() function
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUMachineCFGStructurizer.cpp | 397 MachineBasicBlock *getEntry();
552 MachineBasicBlock *getEntry() { in getEntry() function in __anon8dbf25c70211::RegionMRT
554 return (Tree->isRegion()) ? Tree->getRegionMRT()->getEntry() in getEntry()
907 while (Current != nullptr && Current->getEntry() != nullptr) { in replaceRegister()
929 O.getParent()->getParent() == getEntry()); in replaceRegister()
972 MachineBasicBlock *LinearizedRegion::getEntry() { return Entry; } in getEntry() function in LinearizedRegion
1014 LLVM_DEBUG(this->getEntry()->getParent()->dump()); in removeFalseRegisterKills()
1232 MachineBasicBlock *Entry = Region->getEntry(); in regionIsSimpleIf()
1258 MachineBasicBlock *Entry = Region->getEntry(); in transformSimpleIfRegion()
1662 auto Entry = Region->getEntry(); in rewriteRegionEntryPHIs()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | RegionPass.cpp | 92 PassManagerPrettyStackEntry X(P, *CurrentRegion->getEntry()); in runOnFunction()
280 Function &F = *R.getEntry()->getParent(); in skipRegion()
287 if (R.getEntry() == &F.getEntryBlock()) in skipRegion()
|
| H A D | RegionPrinter.cpp | 89 if (R->getParent()->getEntry() == destBB) in getEdgeAttributes()
94 if (R && R->getEntry() == destBB && R->contains(srcBB)) in getEdgeAttributes()
234 llvm::Function *F = RI->getTopLevelRegion()->getEntry()->getParent(); in viewRegionInfo()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/ |
| H A D | SnippetRepetitor.cpp | 30 auto Entry = Filler.getEntry(); in Repeat()
60 auto Entry = Filler.getEntry(); in Repeat()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| H A D | ControlHeightReduction.cpp | 193 return RegInfos.front().R->getEntry(); in getEntryBlock()
712 BasicBlock *EntryBB = R->getEntry(); in getBranchInsertPoint()
748 BasicBlock *Entry = R->getEntry(); in findScope()
822 BasicBlock *BB = E->getEntry(); in findScope()
890 BasicBlock *EntryBB = R->getEntry(); in checkScopeHoistable()
1042 auto *BI = cast<BranchInst>(RI.R->getEntry()->getTerminator()); in getCHRConditionValuesForRegion()
1186 RI.R->getEntry()->getTerminator()) in splitScope()
1222 RI.R->getEntry()->getTerminator()) in splitScope()
1351 Scope->RegInfos[0].R->getEntry()->getTerminator()) in filterScopes()
1404 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in setCHRRegions()
[all …]
|
| /netbsd-src/external/bsd/openldap/dist/contrib/ldapc++/src/ |
| H A D | LDAPSearchResult.h | 42 const LDAPEntry* getEntry() const;
|
| H A D | LDAPSearchResult.cpp | 48 const LDAPEntry* LDAPSearchResult::getEntry() const{ in getEntry() function in LDAPSearchResult
|
| H A D | LDAPSearchResults.cpp | 30 entryList.addEntry(*((LDAPSearchResult*)res)->getEntry()); in readMessageQueue()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/tools/opt/ |
| H A D | PassPrinters.cpp | 173 << R->getEntry()->getParent()->getName() << "':\n"; in runOnRegion()
176 .print(Out, R->getEntry()->getParent()->getParent()); in runOnRegion()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | DwarfStringPool.h | 56 EntryRef getEntry(AsmPrinter &Asm, StringRef Str);
|
| H A D | DbgEntityHistoryCalculator.cpp | 337 auto &Entry = HistMap.getEntry(Var, Index); in clobberRegEntries()
377 auto &Entry = HistMap.getEntry(Var, Index); in handleNewDebugValue()
546 DbgValueHistoryMap::Entry &Ent = DbgValues.getEntry(Pair.first, Idx); in calculateDbgEntityHistory()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | NonRelocatableStringpool.cpp | 13 DwarfStringPoolEntryRef NonRelocatableStringpool::getEntry(StringRef S) { in getEntry() function in llvm::NonRelocatableStringpool
|