Home
last modified time | relevance | path

Searched refs:getEntry (Results 1 – 25 of 44) sorted by relevance

12

/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp315 return LI->getLoopFor(RN->getEntry()); in getAdjustedLoop()
325 return LI->getLoopDepth(RN->getEntry()); in getAdjustedLoopDepth()
385 Loops[Exit] = N->getEntry(); in analyzeLoops()
447 BasicBlock *BB = N->getEntry(); in gatherPredicates()
493 BasicBlock *Entry = R->getEntry(); in gatherPredicates()
524 Visited.insert(RN->getEntry()); in collectInfos()
734 BasicBlock *Entry = PrevNode->getEntry(); in needPrefix()
805 Visited.insert(Node->getEntry()); in wireFlow()
818 BasicBlock *Entry = Node->getEntry(); in wireFlow()
850 LoopEnd = Loops[Node->getEntry()]; in handleLoops()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DRegionIterator.h108 BItor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
111 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator()
121 BItor(BlockTraits::child_end(node->getEntry())) {} in RNSuccIterator()
147 while (BItor != BlockTraits::child_end(getNode()->getEntry())
185 : Node(node), Itor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
191 while (BlockTraits::child_end(Node->getEntry()) != Itor && in RNSuccIterator()
198 : Node(node), Itor(BlockTraits::child_end(node->getEntry())) { in RNSuccIterator()
229 while (Itor != succ_end(Node->getEntry())
288 return R->getNode(R->getEntry()); \
304 return R->getBBNode(R->getEntry()); \
H A DRegionInfoImpl.h71 BlockT *OldEntry = getEntry(); in replaceEntryRecursive()
80 if (Child->getEntry() == OldEntry) in replaceEntryRecursive()
111 BlockT *entry = getEntry(), *exit = getExit(); in contains()
165 BlockT *entry = getEntry(); in getEnteringBlock()
235 if (getEntry()->getName().empty()) { in getNameStr()
238 getEntry()->printAsOperand(OS, false); in getNameStr()
240 entryName = getEntry()->getName(); in getNameStr()
303 verifyWalk(getEntry(), &visited); in verifyRegion()
353 if (R->getEntry() != BB) in getSubRegionNode()
468 if (R->getEntry() != exit) { in getExpandedRegion()
[all …]
H A DRegionInfo.h176 inline BlockT *getEntry() const { return entry.getPointer(); }
324 BlockT *getEntry() const {
325 return RegionNodeBase<Tr>::getEntry();
461 return contains(SubRegion->getEntry()) &&
612 block_iterator block_begin() { return block_iterator(getEntry(), getExit()); }
617 return const_block_iterator(getEntry(), getExit());
1003 return getEntry();
/freebsd-12.1/contrib/llvm/tools/lldb/source/Plugins/SymbolFile/DWARF/
H A DDebugNamesDWARFIndex.cpp115 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables()
116 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables()
135 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables()
136 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables()
258 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetFunctions()
259 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetFunctions()
/freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp46 make_range(df_iterator<const VPBlockBase *>::begin(Region->getEntry()), in verifyBlocksInRegion()
99 const VPBlockBase *Entry = Region->getEntry(); in verifyRegion()
118 make_range(df_iterator<const VPBlockBase *>::begin(Region->getEntry()), in verifyRegionRec()
H A DVPlan.cpp63 Block = Region->getEntry(); in getEntryBasicBlock()
70 Block = Region->getEntry(); in getEntryBasicBlock()
100 assert(Parent->getEntry() == this && in getEnclosingBlockWithPredecessors()
513 for (VPBlockBase *Block : depth_first(Plan.getEntry())) in dump()
593 assert(Region->getEntry() && "Region contains no inner blocks."); in dumpRegion()
594 for (const VPBlockBase *Block : depth_first(Region->getEntry())) in dumpRegion()
700 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry()); in visitRegion()
739 visitRegion(cast<VPRegionBlock>(Plan.getEntry()), Old2New, IAI); in VPInterleavedAccessInfo()
H A DVPlanHCFGTransforms.cpp25 VPRegionBlock *TopRegion = dyn_cast<VPRegionBlock>(Plan->getEntry()); in VPInstructionsToVPRecipes()
26 ReversePostOrderTraversal<VPBlockBase *> RPOT(TopRegion->getEntry()); in VPInstructionsToVPRecipes()
H A DVPlan.h1086 const VPBlockBase *getEntry() const { return Entry; } in getEntry() function
1087 VPBlockBase *getEntry() { return Entry; } in getEntry() function
1184 VPBlockBase *getEntry() { return Entry; } in getEntry() function
1185 const VPBlockBase *getEntry() const { return Entry; } in getEntry() function
1377 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1380 return nodes_iterator::begin(N->getEntry());
1396 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1399 return nodes_iterator::begin(N->getEntry());
/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DAMDGPUMachineCFGStructurizer.cpp416 MachineBasicBlock *getEntry();
571 MachineBasicBlock *getEntry() { in getEntry() function in __anon98c1c4210211::RegionMRT
1248 MachineBasicBlock *Entry = Region->getEntry(); in regionIsSimpleIf()
1274 MachineBasicBlock *Entry = Region->getEntry(); in transformSimpleIfRegion()
1682 auto Entry = Region->getEntry(); in rewriteRegionEntryPHIs()
2380 bool isEntry = CurrentRegion->getEntry() == InnerRegion->getEntry(); in createIfRegion()
2542 MachineBasicBlock *Entry = LRegion->getEntry(); in splitEntry()
2572 LRegion->setEntry(Region->getEntry()); in initLinearizedRegion()
2733 if (isFunctionEntryBlock(LRegion->getEntry())) { in structurizeComplexRegion()
2734 resolvePHIInfos(LRegion->getEntry()); in structurizeComplexRegion()
[all …]
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DRegionPass.cpp95 PassManagerPrettyStackEntry X(P, *CurrentRegion->getEntry()); in runOnFunction()
283 Function &F = *R.getEntry()->getParent(); in skipRegion()
289 if (R.getEntry() == &F.getEntryBlock()) in skipRegion()
H A DRegionPrinter.cpp89 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()
/freebsd-12.1/contrib/llvm/include/llvm/Object/
H A DELF.h100 Expected<const T *> getEntry(uint32_t Section, uint32_t Entry) const;
102 Expected<const T *> getEntry(const Elf_Shdr *Section, uint32_t Entry) const;
429 return getEntry<Elf_Sym>(SymTab, Index); in getRelocationSymbol()
495 Expected<const T *> ELFFile<ELFT>::getEntry(uint32_t Section, in getEntry() function
500 return getEntry<T>(*SecOrErr, Entry); in getEntry()
505 Expected<const T *> ELFFile<ELFT>::getEntry(const Elf_Shdr *Section, in getEntry() function
/freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp191 return RegInfos.front().R->getEntry(); in getEntryBlock()
696 BasicBlock *EntryBB = R->getEntry(); in getBranchInsertPoint()
732 BasicBlock *Entry = R->getEntry(); in findScope()
806 BasicBlock *BB = E->getEntry(); in findScope()
874 BasicBlock *EntryBB = R->getEntry(); in checkScopeHoistable()
1331 Scope->RegInfos[0].R->getEntry()->getTerminator()) in filterScopes()
1384 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in setCHRRegions()
1467 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in hoistScopeConditions()
1632 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in assertBranchOrSelectConditionHoisted()
1664 BasicBlock *EntryBlock = FirstRegion->getEntry(); in transformScopes()
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/
H A DUninitializedValues.cpp233 assert(*PO_I == &cfg.getEntry()); in DataflowWorklist()
609 if (B == &cfg.getEntry()) in getUninitUse()
903 const CFGBlock &entry = cfg.getEntry(); in runUninitializedVariablesAnalysis()
913 worklist.enqueueSuccessors(&cfg.getEntry()); in runUninitializedVariablesAnalysis()
915 wasAnalyzed[cfg.getEntry().getBlockID()] = true; in runUninitializedVariablesAnalysis()
/freebsd-12.1/contrib/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfStringPool.h57 EntryRef getEntry(AsmPrinter &Asm, StringRef Str);
H A DDwarfStringPool.cpp42 DwarfStringPool::EntryRef DwarfStringPool::getEntry(AsmPrinter &Asm, in getEntry() function in DwarfStringPool
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DDwarfStringPoolEntry.h60 DwarfStringPoolEntry getEntry() const { return getMapEntry()->getValue(); } in getEntry() function
H A DMachineRegionInfo.h116 return getEntry();
/freebsd-12.1/contrib/llvm/tools/opt/
H A DPassPrinters.cpp184 << R->getEntry()->getParent()->getName() << "':\n"; in runOnRegion()
188 .print(Out, R->getEntry()->getParent()->getParent()); in runOnRegion()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCFG.h1093 CFGBlock & getEntry() { return *Entry; } in getEntry() function
1094 const CFGBlock & getEntry() const { return *Entry; } in getEntry() function
1288 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getEntry(); }
1298 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getEntry(); }
H A DProgramPoint.h647 const CFGBlock *getEntry() const { in getEntry() function
650 return &(CalleeCFG->getEntry()); in getEntry()
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DCoreEngine.cpp86 const CFGBlock *Entry = &(L->getCFG()->getEntry()); in ExecuteWorkList()
392 NodeBuilderContext BuilderCtx(*this, CE.getEntry(), Pred); in HandleCallEnter()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Sema/
H A DAnalysisBasedWarnings.cpp213 WorkList.push_back(&cfg->getEntry()); in checkForRecursiveFunctionCall()
305 clang::reachable_code::ScanReachableFromBlock(&BodyCFG->getEntry(), Reachable); in visitReachableThrows()
387 unsigned count = reachable_code::ScanReachableFromBlock(&cfg->getEntry(), in CheckFallThrough()
1039 ReachableBlocks.insert(&Cfg->getEntry()); in fillReachableBlocks()
1040 BlockQueue.push_back(&Cfg->getEntry()); in fillReachableBlocks()
2102 if (cra->isReachable(&AC.getCFG()->getEntry(), block)) in IssueWarnings()
/freebsd-12.1/contrib/llvm/lib/DebugInfo/DWARF/
H A DDWARFAcceleratorTable.cpp599 DWARFDebugNames::NameIndex::getEntry(uint32_t *Offset) const { in getEntry() function in DWARFDebugNames::NameIndex
657 auto EntryOr = getEntry(Offset); in dumpEntry()
814 auto EntryOr = CurrentIndex->getEntry(&DataOffset); in getEntryAtCurrentOffset()

12