| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | DwarfStringPoolEntry.h | 73 assert(getEntry().Symbol && "No symbol available!"); in getSymbol() 74 return getEntry().Symbol; in getSymbol() 78 uint64_t getOffset() const { return getEntry().Offset; } in getOffset() 82 assert(getEntry().isIndexed() && "Index is not set!"); in getIndex() 83 return getEntry().Index; in getIndex() 95 const DwarfStringPoolEntry &getEntry() const { in getEntry() function
|
| 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 | DbgEntityHistoryCalculator.h | 107 Entry &getEntry(InlinedEntity Var, EntryIndex Index) { in getEntry() function
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanCFG.h | 55 return R->getEntry(); in deref() 119 BlockTy getEntry() { return Entry; } in getEntry() function 132 return N.getEntry(); 151 return N.getEntry(); 170 BlockTy getEntry() { return Entry; } 178 return N.getEntry(); 197 return N.getEntry(); 295 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); } 298 return nodes_iterator::begin(N->getEntry()); 304 return nodes_iterator::end(N->getEntry());
|
| H A D | VPlanVerifier.cpp | 47 for (const VPBlockBase *VPB : vp_depth_first_shallow(Region->getEntry())) { in verifyBlocksInRegion() 98 const VPBlockBase *Entry = Region->getEntry(); in verifyRegion() 118 df_iterator<const VPBlockBase *>::begin(Region->getEntry()), in verifyRegionRec() 255 auto Iter = vp_depth_first_deep(Plan.getEntry()); in verifyPlanIsValid() 266 const VPBasicBlock *Entry = dyn_cast<VPBasicBlock>(TopRegion->getEntry()); in verifyPlanIsValid() 300 vp_depth_first_deep(Plan.getEntry()))) { in verifyPlanIsValid() 301 if (Region->getEntry()->getNumPredecessors() != 0) { in verifyPlanIsValid()
|
| H A D | VPlanTransforms.cpp | 32 Plan->getEntry()); in VPInstructionsToVPRecipes() 110 auto Iter = vp_depth_first_deep(Plan.getEntry()); in sinkScalarOperands() 199 auto *EntryBB = dyn_cast<VPBasicBlock>(R->getEntry()); in getPredicatedMask() 209 auto *EntryBB = cast<VPBasicBlock>(R->getEntry()); in getPredicatedThenBlock() 235 vp_depth_first_deep(Plan.getEntry()))) { in mergeReplicateRegionsIntoSuccessors() 318 vp_depth_first_deep(Plan.getEntry()))) { in mergeBlocksIntoPredecessors() 409 Plan.getEntry()); in removeDeadRecipes() 474 make_early_inc_range(*Plan.getEntry()->getEntryBasicBlock())) { in removeRedundantExpandSCEVRecipes()
|
| H A D | VPlan.cpp | 151 Block = Region->getEntry(); in getEntryBasicBlock() 158 Block = Region->getEntry(); in getEntryBasicBlock() 163 assert(ParentPlan->getEntry() == this && in setPlan() 194 assert(Parent->getEntry() == this && in getEnclosingBlockWithPredecessors() 760 for (const VPBlockBase *Block : vp_depth_first_shallow(getEntry())) { in print() 885 for (const VPBlockBase *Block : vp_depth_first_shallow(Plan.getEntry())) in dump() 969 assert(Region->getEntry() && "Region contains no inner blocks."); in dumpRegion() 970 for (const VPBlockBase *Block : vp_depth_first_shallow(Region->getEntry())) in dumpRegion() 1040 RPOT(Region->getEntry()); in visitRegion() 1103 RPOT(VPBlockDeepTraversalWrapper<const VPBlockBase *>(Plan.getEntry())); in assignSlots() [all …]
|
| H A D | VPlanDominatorTree.h | 31 static NodePtr getEntryNode(ParentPtr Parent) { return Parent->getEntry(); }
|
| /openbsd-src/gnu/llvm/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 | 68 BlockT *OldEntry = getEntry(); in replaceEntryRecursive() 77 if (Child->getEntry() == OldEntry) in replaceEntryRecursive() 108 BlockT *entry = getEntry(), *exit = getExit(); in contains() 166 BlockT *entry = getEntry(); in getEnteringBlock() 220 if (getEntry()->getName().empty()) { in getNameStr() 223 getEntry()->printAsOperand(OS, false); in getNameStr() 225 entryName = std::string(getEntry()->getName()); in getNameStr() 245 BlockT *entry = getEntry(), *exit = getExit(); in verifyBBInRegion() 288 verifyWalk(getEntry(), &visited); in verifyRegion() 338 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();
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 438 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() 855 Order.back()->getEntry(); in getNextFlow() 872 BasicBlock *Entry = PrevNode->getEntry(); in needPrefix() 909 BBPredicates &Preds = Predicates[Node->getEntry()]; in dominatesPredicates() 917 BBPredicates &Preds = Predicates[Node->getEntry()]; in isPredictableTrue() 931 if (!Dominated && DT->dominates(BB, PrevNode->getEntry())) in isPredictableTrue() [all …]
|
| /openbsd-src/gnu/llvm/lldb/source/Plugins/SymbolFile/DWARF/ |
| H A D | DebugNamesDWARFIndex.cpp | 111 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables() 112 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() 276 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetFunctions() 277 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetFunctions()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUMachineCFGStructurizer.cpp | 397 MachineBasicBlock *getEntry(); 552 MachineBasicBlock *getEntry() { in getEntry() function in __anonf8f2b3930211::RegionMRT 554 return (Tree->isRegion()) ? Tree->getRegionMRT()->getEntry() in getEntry() 905 while (Current != nullptr && Current->getEntry() != nullptr) { in replaceRegister() 927 O.getParent()->getParent() == getEntry()); in replaceRegister() 970 MachineBasicBlock *LinearizedRegion::getEntry() { return Entry; } in getEntry() function in LinearizedRegion 1012 LLVM_DEBUG(this->getEntry()->getParent()->dump()); in removeFalseRegisterKills() 1227 MachineBasicBlock *Entry = Region->getEntry(); in regionIsSimpleIf() 1249 MachineBasicBlock *Entry = Region->getEntry(); in transformSimpleIfRegion() 1648 auto Entry = Region->getEntry(); in rewriteRegionEntryPHIs() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | RegionPass.cpp | 94 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 D | RegionPrinter.cpp | 77 if (R->getParent()->getEntry() == destBB) in getEdgeAttributes() 82 if (R && R->getEntry() == destBB && R->contains(srcBB)) in getEdgeAttributes() 223 llvm::Function *F = RI->getTopLevelRegion()->getEntry()->getParent(); in viewRegionInfo()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/DebugInfo/LogicalView/Core/ |
| H A D | LVRange.h | 68 LVScope *getEntry(LVAddress Address) const; 69 LVScope *getEntry(LVAddress LowerAddress, LVAddress UpperAddress) const;
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-exegesis/lib/ |
| H A D | SnippetRepetitor.cpp | 31 auto Entry = Filler.getEntry(); in Repeat() 62 auto Entry = Filler.getEntry(); in Repeat()
|
| H A D | Assembler.h | 69 BasicBlockFiller getEntry() { return Entry; } in getEntry() function
|
| /openbsd-src/gnu/llvm/llvm/lib/DebugInfo/LogicalView/Core/ |
| H A D | LVRange.cpp | 83 LVScope *LVRange::getEntry(LVAddress Address) const { in getEntry() function in LVRange 109 LVScope *LVRange::getEntry(LVAddress LowerAddress, in getEntry() function in LVRange
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Instrumentation/ |
| H A D | ControlHeightReduction.cpp | 162 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 …]
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | DwarfStringPool.h | 56 EntryRef getEntry(AsmPrinter &Asm, StringRef Str);
|
| H A D | DbgEntityHistoryCalculator.cpp | 336 auto &Entry = HistMap.getEntry(Var, Index); in clobberRegEntries() 376 auto &Entry = HistMap.getEntry(Var, Index); in handleNewDebugValue() 545 DbgValueHistoryMap::Entry &Ent = DbgValues.getEntry(Pair.first, Idx); in calculateDbgEntityHistory()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | NonRelocatableStringpool.cpp | 14 DwarfStringPoolEntryRef NonRelocatableStringpool::getEntry(StringRef S) { in getEntry() function in llvm::NonRelocatableStringpool
|
| /openbsd-src/gnu/llvm/clang/lib/Analysis/ |
| H A D | UninitializedValues.cpp | 565 if (B == &cfg.getEntry()) in getUninitUse() 932 const CFGBlock &entry = cfg.getEntry(); in runUninitializedVariablesAnalysis() 942 worklist.enqueueSuccessors(&cfg.getEntry()); in runUninitializedVariablesAnalysis() 944 wasAnalyzed[cfg.getEntry().getBlockID()] = true; in runUninitializedVariablesAnalysis()
|