Searched refs:getEntry (Results 1 - 25 of 52) sorted by relevance

123

/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DNonRelocatableStringpool.h35 EmptyString = getEntry("");
38 DwarfStringPoolEntryRef getEntry(StringRef S);
42 uint32_t getStringOffset(StringRef S) { return getEntry(S).getOffset(); }
H A DDwarfStringPoolEntry.h59 DwarfStringPoolEntry getEntry() const { return getMapEntry()->getValue(); } function in class:llvm::DwarfStringPoolEntryRef
H A DDbgEntityHistoryCalculator.h87 Entry &getEntry(InlinedEntity Var, EntryIndex Index) { function in class:llvm::DbgValueHistoryMap
H A DMachineRegionInfo.h115 return getEntry();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp47 make_range(df_iterator<const VPBlockBase *>::begin(Region->getEntry()),
100 const VPBlockBase *Entry = Region->getEntry();
119 make_range(df_iterator<const VPBlockBase *>::begin(Region->getEntry()),
H A DVPlanPredicator.cpp188 VPBasicBlock *EntryBlock = cast<VPBasicBlock>(Region->getEntry());
208 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry());
236 predicateRegionRec(cast<VPRegionBlock>(Plan.getEntry()));
239 linearizeRegionRec(cast<VPRegionBlock>(Plan.getEntry()));
247 VPDomTree.recalculate(*(cast<VPRegionBlock>(Plan.getEntry())));
H A DVPlanTransforms.cpp24 auto *TopRegion = cast<VPRegionBlock>(Plan->getEntry());
25 ReversePostOrderTraversal<VPBlockBase *> RPOT(TopRegion->getEntry());
H A DVPlan.cpp96 Block = Region->getEntry();
103 Block = Region->getEntry();
108 assert(ParentPlan->getEntry() == this &&
139 assert(Parent->getEntry() == this &&
614 for (const VPBlockBase *Block : depth_first(Plan.getEntry()))
710 assert(Region->getEntry() && "Region contains no inner blocks.");
711 for (const VPBlockBase *Block : depth_first(Region->getEntry()))
883 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry());
923 visitRegion(cast<VPRegionBlock>(Plan.getEntry()), Old2New, IAI);
946 ReversePostOrderTraversal<const VPBlockBase *> RPOT(Region->getEntry());
[all...]
H A DVPlan.h1373 const VPBlockBase *getEntry() const { return Entry; }
1374 VPBlockBase *getEntry() { return Entry; }
1481 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1484 return nodes_iterator::begin(N->getEntry());
1500 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1503 return nodes_iterator::begin(N->getEntry());
1595 VPBlockBase *getEntry() { return Entry; }
1596 const VPBlockBase *getEntry() const { return Entry; }
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DRegionIterator.h107 BItor(BlockTraits::child_begin(node->getEntry())) {
110 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor))
120 BItor(BlockTraits::child_end(node->getEntry())) {}
146 while (BItor != BlockTraits::child_end(getNode()->getEntry())
184 : Node(node), Itor(BlockTraits::child_begin(node->getEntry())) {
190 while (BlockTraits::child_end(Node->getEntry()) != Itor &&
197 : Node(node), Itor(BlockTraits::child_end(node->getEntry())) {
228 while (Itor != succ_end(Node->getEntry())
287 return R->getNode(R->getEntry()); \
303 return R->getBBNode(R->getEntry()); \
[all...]
H A DRegionInfoImpl.h70 BlockT *OldEntry = getEntry();
79 if (Child->getEntry() == OldEntry)
110 BlockT *entry = getEntry(), *exit = getExit();
164 BlockT *entry = getEntry();
234 if (getEntry()->getName().empty()) {
237 getEntry()->printAsOperand(OS, false);
239 entryName = std::string(getEntry()->getName());
259 BlockT *entry = getEntry(), *exit = getExit();
302 verifyWalk(getEntry(), &visited);
352 if (R->getEntry() !
[all...]
H A DRegionInfo.h175 inline BlockT *getEntry() const { return entry.getPointer(); } function in class:llvm::RegionNodeBase
323 BlockT *getEntry() const { function in class:llvm::RegionBase
324 return RegionNodeBase<Tr>::getEntry();
391 /// @return A region also starting at getEntry(), but reaching to the next
392 /// basic block that forms with getEntry() a (non-canonical) region.
460 return contains(SubRegion->getEntry()) &&
610 block_iterator block_begin() { return block_iterator(getEntry(), getExit()); }
615 return const_block_iterator(getEntry(), getExit());
1001 return getEntry();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfStringPool.h56 EntryRef getEntry(AsmPrinter &Asm, StringRef Str);
58 /// Same as getEntry, except that you can use EntryRef::getIndex to obtain a
H A DDbgEntityHistoryCalculator.cpp146 auto &Entry = HistMap.getEntry(Var, Index);
173 auto &Entry = HistMap.getEntry(Var, Index);
328 DbgValueHistoryMap::Entry &Ent = DbgValues.getEntry(Pair.first, Idx);
H A DDwarfStringPool.cpp41 DwarfStringPool::EntryRef DwarfStringPool::getEntry(AsmPrinter &Asm, function in class:DwarfStringPool
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp354 LLVMContext &Context = R->getEntry()->getContext();
426 Loops[Exit] = N->getEntry();
455 BasicBlock *BB = N->getEntry();
501 BasicBlock *Entry = R->getEntry();
525 << RN->getEntry()->getName() << "\n");
531 Visited.insert(RN->getEntry());
734 Order.back()->getEntry();
744 BasicBlock *Entry = PrevNode->getEntry();
781 BBPredicates &Preds = Predicates[Node->getEntry()];
789 BBPredicates &Preds = Predicates[Node->getEntry()];
[all...]
/freebsd-13-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/
H A DDebugNamesDWARFIndex.cpp109 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset);
110 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) {
131 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset);
132 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) {
270 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset);
271 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DNonRelocatableStringpool.cpp13 DwarfStringPoolEntryRef NonRelocatableStringpool::getEntry(StringRef S) { function in class:llvm::NonRelocatableStringpool
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DRegionPass.cpp94 PassManagerPrettyStackEntry X(P, *CurrentRegion->getEntry());
286 Function &F = *R.getEntry()->getParent();
293 if (R.getEntry() == &F.getEntryBlock())
H A DRegionPrinter.cpp89 if (R->getParent()->getEntry() == destBB)
94 if (R && R->getEntry() == destBB && R->contains(srcBB))
234 llvm::Function *F = RI->getTopLevelRegion()->getEntry()->getParent();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUMachineCFGStructurizer.cpp416 MachineBasicBlock *getEntry();
571 MachineBasicBlock *getEntry() {
573 return (Tree->isRegion()) ? Tree->getRegionMRT()->getEntry()
925 while (Current != nullptr && Current->getEntry() != nullptr) {
947 O.getParent()->getParent() == getEntry());
990 MachineBasicBlock *LinearizedRegion::getEntry() { return Entry; }
1032 LLVM_DEBUG(this->getEntry()->getParent()->dump());
1250 MachineBasicBlock *Entry = Region->getEntry();
1276 MachineBasicBlock *Entry = Region->getEntry();
1684 auto Entry = Region->getEntry();
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/tools/opt/
H A DPassPrinters.cpp173 << R->getEntry()->getParent()->getName() << "':\n";
176 .print(Out, R->getEntry()->getParent()->getParent());
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Object/
H A DELF.h135 Expected<const T *> getEntry(uint32_t Section, uint32_t Entry) const;
137 Expected<const T *> getEntry(const Elf_Shdr *Section, uint32_t Entry) const;
513 return getEntry<Elf_Sym>(SymTab, Index);
603 Expected<const T *> ELFFile<ELFT>::getEntry(uint32_t Section, function in class:llvm::object::ELFFile
608 return getEntry<T>(*SecOrErr, Entry);
613 Expected<const T *> ELFFile<ELFT>::getEntry(const Elf_Shdr *Section, function in class:llvm::object::ELFFile
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp192 return RegInfos.front().R->getEntry();
712 BasicBlock *EntryBB = R->getEntry();
748 BasicBlock *Entry = R->getEntry();
822 BasicBlock *BB = E->getEntry();
890 BasicBlock *EntryBB = R->getEntry();
1043 auto *BI = cast<BranchInst>(RI.R->getEntry()->getTerminator());
1187 RI.R->getEntry()->getTerminator())
1223 RI.R->getEntry()->getTerminator())
1352 Scope->RegInfos[0].R->getEntry()->getTerminator())
1405 auto *BI = cast<BranchInst>(R->getEntry()
[all...]
/freebsd-13-stable/contrib/llvm-project/clang/lib/Analysis/
H A DUninitializedValues.cpp568 if (B == &cfg.getEntry())
927 const CFGBlock &entry = cfg.getEntry();
937 worklist.enqueueSuccessors(&cfg.getEntry());
939 wasAnalyzed[cfg.getEntry().getBlockID()] = true;

Completed in 298 milliseconds

123