Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DDwarfStringPoolEntry.h76 assert(getEntry().Symbol && "No symbol available!");
77 return getEntry().Symbol;
81 uint64_t getOffset() const { return getEntry().Offset; } in getIndex()
85 assert(getEntry().isIndexed() && "Index is not set!");
86 return getEntry().Index;
98 const DwarfStringPoolEntry &getEntry() const { in getEntry()
95 const DwarfStringPoolEntry &getEntry() const { getEntry() function
H A DNonRelocatableStringpool.h32 getEntry("");
35 DwarfStringPoolEntryRef getEntry(StringRef S);
39 uint64_t getStringOffset(StringRef S) { return getEntry(S).getOffset(); } in getStringOffset()
H A DDbgEntityHistoryCalculator.h107 Entry &getEntry(InlinedEntity Var, EntryIndex Index) { in getEntry() function
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h56 return R->getEntry(); in deref()
120 BlockTy getEntry() { return Entry; } in getEntry() function
133 return N.getEntry();
152 return N.getEntry();
171 BlockTy getEntry() { return Entry; }
179 return N.getEntry();
198 return N.getEntry();
296 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
299 return nodes_iterator::begin(N->getEntry());
305 return nodes_iterator::end(N->getEntry());
H A DVPlanVerifier.cpp251 for (const VPBlockBase *VPB : vp_depth_first_shallow(Region->getEntry())) { in verifyBlocksInRegion()
265 const VPBlockBase *Entry = Region->getEntry(); in verifyRegion()
284 all_of(vp_depth_first_shallow(Region->getEntry()), in verifyRegionRec()
292 if (any_of(vp_depth_first_shallow(Plan.getEntry()), in verify()
305 const VPBasicBlock *Entry = dyn_cast<VPBasicBlock>(TopRegion->getEntry()); in verify()
H A DVPlan.cpp158 Block = Region->getEntry(); in getEntryBasicBlock()
165 Block = Region->getEntry(); in getEntryBasicBlock()
171 (ParentPlan->getEntry() == this || ParentPlan->getPreheader() == this) && in setPlan()
202 assert(Parent->getEntry() == this && in getEnclosingBlockWithPredecessors()
714 const auto &[NewEntry, NewExiting] = cloneFrom(getEntry()); in clone()
790 for (VPBlockBase *Block : vp_depth_first_shallow(getEntry())) in cost()
811 VPBasicBlock *Then = cast<VPBasicBlock>(getEntry()->getSuccessors()[0]); in cost()
1135 for (const VPBlockBase *Block : vp_depth_first_shallow(getEntry())) { in print()
1308 for (const VPBlockBase *Block : vp_depth_first_shallow(Plan.getEntry())) in dump()
1392 assert(Region->getEntry() && "Region contains no inner blocks."); in dumpRegion()
[all …]
H A DVPlanTransforms.cpp105 auto Iter = vp_depth_first_deep(Plan.getEntry()); in sinkScalarOperands()
185 auto *EntryBB = dyn_cast<VPBasicBlock>(R->getEntry()); in getPredicatedMask()
195 auto *EntryBB = cast<VPBasicBlock>(R->getEntry()); in getPredicatedThenBlock()
224 vp_depth_first_deep(Plan.getEntry()))) { in mergeReplicateRegionsIntoSuccessors()
342 vp_depth_first_deep(Plan.getEntry()))) { in addReplicateRegions()
372 vp_depth_first_deep(Plan.getEntry()))) { in mergeBlocksIntoPredecessors()
510 Plan.getEntry()); in removeDeadRecipes()
640 make_early_inc_range(*Plan.getEntry()->getEntryBasicBlock())) { in removeRedundantExpandSCEVRecipes()
825 Plan.getVectorLoopRegion()->getEntry()->getEntryBasicBlock()->phis()) in adjustFixedOrderRecurrences()
1071 Plan.getEntry()); in simplifyRecipes()
[all …]
H A DVPlanDominatorTree.h31 static NodePtr getEntryNode(ParentPtr Parent) { return Parent->getEntry(); }
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DRegionIterator.h111 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 DRegionInfoImpl.h68 BlockT *OldEntry = getEntry(); in replaceEntryRecursive()
77 if (Child->getEntry() == OldEntry) in replaceEntryRecursive()
108 BlockT *entry = getEntry(), *exit = getExit(); in contains()
166 return find_singleton<BlockT>(llvm::inverse_children<BlockT *>(getEntry()), in getEnteringBlock()
214 if (getEntry()->getName().empty()) {
217 getEntry()->printAsOperand(OS, false); in getNameStr()
219 entryName = std::string(getEntry()->getName()); in getNameStr()
239 BlockT *entry = getEntry(), *exit = getExit();
281 verifyWalk(getEntry(), &visited);
331 if (R->getEntry() ! in getSubRegionNode()
[all...]
H A DRegionInfo.h174 inline BlockT *getEntry() const { return entry.getPointer(); }
322 BlockT *getEntry() const {
323 return RegionNodeBase<Tr>::getEntry();
390 /// @return A region also starting at getEntry(), but reaching to the next
391 /// basic block that forms with getEntry() a (non-canonical) region.
459 return contains(SubRegion->getEntry()) &&
609 block_iterator block_begin() { return block_iterator(getEntry(), getExit()); }
614 return const_block_iterator(getEntry(), getExit());
1001 return getEntry();
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp438 Loops[Exit] = N->getEntry(); in analyzeLoops()
467 BasicBlock *BB = N->getEntry(); in gatherPredicates()
513 BasicBlock *Entry = R->getEntry(); in gatherPredicates()
537 << RN->getEntry()->getName() << "\n"); in collectInfos()
543 Visited.insert(RN->getEntry()); in collectInfos()
853 Order.back()->getEntry(); in getNextFlow()
870 BasicBlock *Entry = PrevNode->getEntry(); in needPrefix()
907 BBPredicates &Preds = Predicates[Node->getEntry()]; in dominatesPredicates()
915 BBPredicates &Preds = Predicates[Node->getEntry()]; in isPredictableTrue()
929 if (!Dominated && DT->dominates(BB, PrevNode->getEntry())) in isPredictableTrue()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUMachineCFGStructurizer.cpp397 MachineBasicBlock *getEntry();
552 MachineBasicBlock *getEntry() { in getEntry() function in __anon3d3c1dbc0211::RegionMRT
554 return (Tree->isRegion()) ? Tree->getRegionMRT()->getEntry() in getEntry()
903 while (Current != nullptr && Current->getEntry() != nullptr) { in replaceRegister()
925 O.getParent()->getParent() == getEntry()); in replaceRegister()
968 MachineBasicBlock *LinearizedRegion::getEntry() { return Entry; } in getEntry() function in LinearizedRegion
1010 LLVM_DEBUG(this->getEntry()->getParent()->dump()); in removeFalseRegisterKills()
1225 MachineBasicBlock *Entry = Region->getEntry(); in regionIsSimpleIf()
1247 MachineBasicBlock *Entry = Region->getEntry(); in transformSimpleIfRegion()
1646 auto Entry = Region->getEntry(); in rewriteRegionEntryPHIs()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DRegionPass.cpp94 PassManagerPrettyStackEntry X(P, *CurrentRegion->getEntry()); in runOnFunction()
192 if (!isFunctionInPrintList(R->getEntry()->getParent()->getName())) in runOnRegion()
284 Function &F = *R.getEntry()->getParent(); in skipRegion()
292 if (R.getEntry() == &F.getEntryBlock()) in skipRegion()
H A DRegionPrinter.cpp76 if (R->getParent()->getEntry() == destBB) in getEdgeAttributes()
81 if (R && R->getEntry() == destBB && R->contains(srcBB)) in getEdgeAttributes()
222 llvm::Function *F = RI->getTopLevelRegion()->getEntry()->getParent(); in viewRegionInfo()
/freebsd/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/
H A DDebugNamesDWARFIndex.cpp203 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables()
204 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables()
236 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables()
237 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables()
481 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetFunctions()
482 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetFunctions()
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/LogicalView/Core/
H A DLVRange.h68 LVScope *getEntry(LVAddress Address) const;
69 LVScope *getEntry(LVAddress LowerAddress, LVAddress UpperAddress) const;
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVRange.cpp83 LVScope *LVRange::getEntry(LVAddress Address) const { in getEntry() function in LVRange
109 LVScope *LVRange::getEntry(LVAddress LowerAddress, in getEntry() function in LVRange
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp162 return RegInfos.front().R->getEntry(); in getEntryBlock()
681 BasicBlock *EntryBB = R->getEntry(); in getBranchInsertPoint()
717 BasicBlock *Entry = R->getEntry(); in findScope()
808 BasicBlock *BB = E->getEntry(); in findScope()
876 BasicBlock *EntryBB = R->getEntry(); in checkScopeHoistable()
1028 auto *BI = cast<BranchInst>(RI.R->getEntry()->getTerminator()); in getCHRConditionValuesForRegion()
1172 RI.R->getEntry()->getTerminator()) in splitScope()
1208 RI.R->getEntry()->getTerminator()) in splitScope()
1337 Scope->RegInfos[0].R->getEntry()->getTerminator()) in filterScopes()
1390 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in setCHRRegions()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfStringPool.h56 EntryRef getEntry(AsmPrinter &Asm, StringRef Str);
H A DDbgEntityHistoryCalculator.cpp343 auto &Entry = HistMap.getEntry(Var, Index); in clobberRegEntries()
383 auto &Entry = HistMap.getEntry(Var, Index); in handleNewDebugValue()
552 DbgValueHistoryMap::Entry &Ent = DbgValues.getEntry(Pair.first, Idx); in calculateDbgEntityHistory()
H A DDwarfStringPool.cpp39 DwarfStringPool::EntryRef DwarfStringPool::getEntry(AsmPrinter &Asm, in getEntry() function in DwarfStringPool
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DNonRelocatableStringpool.cpp14 DwarfStringPoolEntryRef NonRelocatableStringpool::getEntry(StringRef S) { in getEntry() function in llvm::NonRelocatableStringpool
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DUninitializedValues.cpp583 if (B == &cfg.getEntry()) in getUninitUse()
929 const CFGBlock &entry = cfg.getEntry(); in runUninitializedVariablesAnalysis()
939 worklist.enqueueSuccessors(&cfg.getEntry()); in runUninitializedVariablesAnalysis()
941 wasAnalyzed[cfg.getEntry().getBlockID()] = true; in runUninitializedVariablesAnalysis()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h93 return &F->getEntry(); in getEntryNode()

123