Home
last modified time | relevance | path

Searched refs:Entries (Results 1 - 25 of 87) sorted by relevance

1234

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocStream.h49 SmallVector<Entry, 32> Entries; member in llvm::DebugLocStream
82 Lists.emplace_back(CU, Entries.size()); in startList()
99 Entries.push_back({BeginSym, EndSym, DWARFBytes.size(), Comments.size()}); in startEntry()
112 return makeArrayRef(Entries) in getEntries()
119 .slice(Entries[EI].ByteOffset, getNumBytes(EI)); in getBytes()
124 .slice(Entries[EI].CommentOffset, getNumComments(EI)); in getComments()
134 assert(&Entries.front() <= &E && &E <= &Entries.back() && in getIndex()
136 return &E - &Entries.front(); in getIndex()
140 return Entries in getNumEntries()
[all...]
H A DDbgEntityHistoryCalculator.cpp59 auto &Entries = VarEntries[Var]; in startDbgValue() local
60 if (!Entries.empty() && Entries.back().isDbgValue() && in startDbgValue()
61 !Entries.back().isClosed() && in startDbgValue()
62 Entries.back().getInstr()->isIdenticalTo(MI)) { in startDbgValue()
64 << "\t" << Entries.back().getInstr() << "\t" << MI in startDbgValue()
68 Entries.emplace_back(&MI, Entry::DbgValue); in startDbgValue()
69 NewIndex = Entries.size() - 1; in startDbgValue()
75 auto &Entries = VarEntries[Var]; in startClobber() local
78 if (Entries in startClobber()
344 const Entries &Entries = VarRangePair.second; dump() local
[all...]
H A DDwarfStringPool.cpp86 SmallVector<const StringMapEntry<EntryTy> *, 64> Entries; in emit() local
87 Entries.reserve(Pool.size()); in emit()
90 Entries.push_back(&E); in emit()
92 llvm::sort(Entries, [](const StringMapEntry<EntryTy> *A, in emit()
97 for (const auto &Entry : Entries) { in emit()
116 Entries.resize(NumIndexedStrings); in emit()
119 Entries[Entry.getValue().Index] = &Entry; in emit()
124 for (const auto &Entry : Entries) in emit()
H A DDebugLocStream.cpp16 if (Lists.back().EntryOffset == Entries.size()) { in finalizeList()
28 if (Entries.back().ByteOffset != DWARFBytes.size()) in finalizeEntry()
32 Comments.erase(Comments.begin() + Entries.back().CommentOffset, in finalizeEntry()
34 Entries.pop_back(); in finalizeEntry()
36 assert(Lists.back().EntryOffset <= Entries.size() && in finalizeEntry()
H A DDebugHandlerBase.cpp213 const auto &Entries = I.second; in beginFunction() local
214 if (Entries.empty()) in beginFunction()
231 Entries.front().getInstr()->getDebugVariable(); in beginFunction()
234 if (!IsDescribedByReg(Entries.front().getInstr())) in beginFunction()
235 LabelsBeforeInsn[Entries.front().getInstr()] = Asm->getFunctionBegin(); in beginFunction()
236 if (Entries.front().getInstr()->getDebugExpression()->isFragment()) { in beginFunction()
238 for (auto I = Entries.begin(); I != Entries.end(); ++I) { in beginFunction()
242 if (std::any_of(Entries.begin(), I, in beginFunction()
260 for (const auto &Entry : Entries) { in beginFunction()
[all...]
H A DAddressPool.cpp64 SmallVector<const MCExpr *, 64> Entries(Pool.size()); in emit()
67 Entries[I.second.Number] = in emit()
72 for (const MCExpr *Entry : Entries) in emit()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGSort.cpp274 SmallVector<Entry, 4> Entries; in sortBlocks() local
282 Entries.push_back(Entry(R)); in sortBlocks()
286 for (Entry &E : Entries) in sortBlocks()
290 while (!Entries.empty() && Entries.back().NumBlocksLeft == 0) in sortBlocks()
291 Entries.pop_back(); in sortBlocks()
311 if (!Entries.empty() && in sortBlocks()
312 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) { in sortBlocks()
313 Entries.back().Deferred.push_back(Next); in sortBlocks()
342 if (!Entries in sortBlocks()
[all...]
H A DWebAssemblyFixIrreducibleControlFlow.cpp233 void makeSingleEntryLoop(BlockSet &Entries, BlockSet &Blocks,
323 BlockSet &Entries, BlockSet &Blocks, MachineFunction &MF, in makeSingleEntryLoop()
325 assert(Entries.size() >= 2); in makeSingleEntryLoop()
328 BlockVector SortedEntries(Entries.begin(), Entries.end()); in makeSingleEntryLoop()
396 if (!Entries.count(Entry)) in makeSingleEntryLoop()
411 if (Entries.count(Entry) && Pred->isLayoutSuccessor(Entry)) in makeSingleEntryLoop()
422 if (!Entries.count(Entry) || in makeSingleEntryLoop()
459 if (!Entries.count(Succ)) in makeSingleEntryLoop()
322 makeSingleEntryLoop( BlockSet &Entries, BlockSet &Blocks, MachineFunction &MF, const ReachabilityGraph &Graph) makeSingleEntryLoop() argument
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/CodeView/
H A DDebugInlineeLinesSubsection.cpp71 Size += Entries.size() * sizeof(InlineeSourceLineHeader); in calculateSerializedSize()
74 Size += Entries.size() * sizeof(uint32_t); in calculateSerializedSize()
91 for (const auto &E : Entries) { in commit()
110 auto &Entry = Entries.back(); in addExtraFile()
120 Entries.emplace_back(); in addInlineSite()
121 auto &Entry = Entries.back(); in addInlineSite()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MCA/HardwareUnits/
H A DRetireControlUnit.cpp43 unsigned Entries = normalizeQuantity(Inst.getNumMicroOps()); in dispatch() local
44 assert((AvailableEntries >= Entries) && "Reorder Buffer unavailable!"); in dispatch()
47 Queue[NextAvailableSlotIdx] = {IR, Entries, false}; in dispatch()
48 NextAvailableSlotIdx += std::max(1U, Entries); in dispatch()
51 AvailableEntries -= Entries; in dispatch()
94 dbgs() << "Retire Unit: { Total ROB Entries =" << NumROBEntries in dump()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MC/
H A DConstantPools.cpp27 if (Entries.empty()) in emitEntries()
30 for (const ConstantPoolEntry &Entry : Entries) { in emitEntries()
36 Entries.clear(); in emitEntries()
50 Entries.push_back(ConstantPoolEntry(CPEntryLabel, Value, Size, Loc)); in addEntry()
57 bool ConstantPool::empty() { return Entries.empty(); } in empty()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugRangeList.cpp22 Entries.clear(); in clear()
55 Entries.push_back(Entry); in extract()
61 for (const RangeListEntry &RLE : Entries) { in dump()
73 for (const RangeListEntry &RLE : Entries) { in getAbsoluteRanges()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DInterferenceCache.cpp64 Entries[i].clear(mf, indexes, lis); in init()
69 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) { in get()
70 if (!Entries[E].valid(LIUArray, TRI)) in get()
71 Entries[E].revalidate(LIUArray, TRI); in get()
72 return &Entries[E]; in get()
80 if (Entries[E].hasRefs()) { in get()
85 Entries[E].reset(PhysReg, LIUArray, TRI, MF); in get()
87 return &Entries[E]; in get()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DTimeProfiler.cpp77 assert((Entries.empty() || in end()
79 Entries.back().getFlameGraphStartUs(StartTime) + in end()
80 Entries.back().getFlameGraphDurUs())) && in end()
88 Entries.emplace_back(E); in end()
115 for (const auto &E : Entries) { in Write()
182 SmallVector<Entry, 128> Entries; member
H A DYAMLTraits.cpp210 return SQ->Entries.size(); in beginSequence()
231 CurrentNode = SQ->Entries[Index].get(); in preflightElement()
248 CurrentNode = SQ->Entries[index].get(); in preflightFlowElement()
293 BitValuesUsed.insert(BitValuesUsed.begin(), SQ->Entries.size(), false); in beginBitSetScalar()
306 for (auto &N : SQ->Entries) { in bitSetMatch()
327 assert(BitValuesUsed.size() == SQ->Entries.size()); in endBitSetScalar()
328 for (unsigned i = 0; i < SQ->Entries.size(); ++i) { in endBitSetScalar()
330 setError(SQ->Entries[i].get(), "unknown bit value"); in endBitSetScalar()
389 SQHNode->Entries.push_back(std::move(Entry)); in createHNodes()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugFrame.h270 std::vector<std::unique_ptr<dwarf::FrameEntry>> Entries; member in llvm::DWARFDebugFrame
271 using iterator = pointee_iterator<decltype(Entries)::const_iterator>;
294 bool empty() const { return Entries.empty(); } in empty()
297 iterator begin() const { return Entries.begin(); } in begin()
298 iterator end() const { return Entries.end(); } in end()
300 return iterator_range<iterator>(Entries.begin(), Entries.end()); in entries()
H A DDWARFListTable.h43 ListEntries Entries; member in llvm::DWARFListType
46 const ListEntries &getEntries() const { return Entries; } in getEntries()
47 bool empty() const { return Entries.empty(); } in empty()
48 void clear() { Entries.clear(); } in clear()
226 Entries.clear(); in extract()
231 Entries.push_back(Entry); in extract()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp162 // in Entries and one return block.
163 unsigned GetNumInlinedBlocks() const { return Entries.size() + 1; } in GetNumInlinedBlocks()
167 SmallVector<BasicBlock *, 4> Entries; member
175 // The set of blocks in Entries that that are predecessors to ReturnBlock
614 OutliningInfo->Entries.push_back(CurrEntry); in computeOutliningInfo()
628 OutliningInfo->Entries.push_back(CurrEntry); in computeOutliningInfo()
638 assert(OutliningInfo->Entries[0] == &F->front() && in computeOutliningInfo()
639 "Function Entry must be the first in Entries vector"); in computeOutliningInfo()
640 DenseSet<BasicBlock *> Entries; in computeOutliningInfo() local
641 for (BasicBlock *E : OutliningInfo->Entries) in computeOutliningInfo()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DDbgEntityHistoryCalculator.h74 using Entries = SmallVector<Entry, 4>;
76 using EntriesMap = MapVector<InlinedEntity, Entries>;
87 auto &Entries = VarEntries[Var]; in getEntry() local
88 return Entries[Index]; in getEntry()
/third_party/typescript/tests/baselines/reference/
H A DquickinfoTypeAtReturnPositionsInaccurate.js28 class SimpleStore<Entries extends { [index: string]: NumClass<number> | StrClass<string> }> {
29 private entries = { } as Entries;
31 public get<EntryId extends keyof Entries>(entryId: EntryId): Entries[EntryId] {
41 return entry; // type is Entries[EntryId] - all fine
145 return entry; // type is Entries[EntryId] - all fine
/third_party/ninja/src/
H A Dbuild_log.h93 typedef ExternalStringHashMap<LogEntry*>::Type Entries; typedef
94 const Entries& entries() const { return entries_; } in entries()
101 Entries entries_;
H A Dbuild_log.cc151 Entries::iterator i = entries_.find(path); in RecordCommand()
157 entries_.insert(Entries::value_type(log_entry->output, log_entry)); in RecordCommand()
341 Entries::iterator i = entries_.find(output); in Load()
346 entries_.insert(Entries::value_type(entry->output, entry)); in Load()
380 Entries::iterator i = entries_.find(path); in LookupByOutput()
411 for (Entries::iterator i = entries_.begin(); i != entries_.end(); ++i) { in Recompact()
460 for (Entries::iterator i = entries_.begin(); i != entries_.end(); ++i) { in Restat()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Instrumentation/
H A DAddressSanitizer.h55 auto Pos = Entries.find(G); in get()
56 return (Pos != Entries.end()) ? Pos->second : Entry(); in get()
71 DenseMap<GlobalVariable *, Entry> Entries; member in llvm::GlobalsMetadata
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ObjectYAML/
H A DDWARFYAML.cpp31 if (!DWARF.PubNames.Entries.empty() || !IO.outputting()) in mapping()
33 if (!DWARF.PubTypes.Entries.empty() || !IO.outputting()) in mapping()
35 if (!DWARF.GNUPubNames.Entries.empty() || !IO.outputting()) in mapping()
37 if (!DWARF.GNUPubTypes.Entries.empty() || !IO.outputting()) in mapping()
93 IO.mapRequired("Entries", Section.Entries); in mapping()
105 IO.mapOptional("Entries", Unit.Entries); in mapping()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/CodeView/
H A DDebugInlineeLinesSubsection.h111 std::vector<Entry>::const_iterator begin() const { return Entries.begin(); } in begin()
112 std::vector<Entry>::const_iterator end() const { return Entries.end(); } in end()
118 std::vector<Entry> Entries; member in llvm::codeview::final

Completed in 13 milliseconds

1234