Home
last modified time | relevance | path

Searched refs:Entries (Results 1 – 25 of 204) sorted by relevance

123456789

/openbsd-src/gnu/llvm/clang/lib/CodeGen/
H A DSwiftCallingConv.cpp281 if (Entries.empty() || Entries.back().End <= begin) { in addEntry()
282 Entries.push_back({begin, end, type}); in addEntry()
288 size_t index = Entries.size() - 1; in addEntry()
290 if (Entries[index - 1].End <= begin) break; in addEntry()
296 if (Entries[index].Begin >= end) { in addEntry()
300 Entries.insert(Entries.begin() + index, {begin, end, type}); in addEntry()
309 if (Entries[index].Begin == begin && Entries[index].End == end) { in addEntry()
311 if (Entries[index].Type == type) return; in addEntry()
314 if (Entries[index].Type == nullptr) { in addEntry()
317 Entries[index].Type = nullptr; in addEntry()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocStream.h49 SmallVector<Entry, 32> Entries; variable
82 Lists.emplace_back(CU, Entries.size()); in startList()
99 Entries.push_back({BeginSym, EndSym, DWARFBytes.size(), Comments.size()}); in startEntry()
112 return ArrayRef(Entries).slice(Lists[LI].EntryOffset, getNumEntries(LI)); in getEntries()
118 .slice(Entries[EI].ByteOffset, getNumBytes(EI)); in getBytes()
122 return ArrayRef(Comments).slice(Entries[EI].CommentOffset, in getComments()
133 assert(&Entries.front() <= &E && &E <= &Entries.back() && in getIndex()
135 return &E - &Entries.front(); in getIndex()
139 return Entries.size() - Lists[LI].EntryOffset; in getNumEntries()
143 if (EI + 1 == Entries.size()) in getNumBytes()
[all …]
H A DDwarfStringPool.cpp84 SmallVector<const StringMapEntry<EntryTy> *, 64> Entries; in emit() local
85 Entries.reserve(Pool.size()); in emit()
88 Entries.push_back(&E); in emit()
90 llvm::sort(Entries, [](const StringMapEntry<EntryTy> *A, in emit()
95 for (const auto &Entry : Entries) { in emit()
114 Entries.resize(NumIndexedStrings); in emit()
117 Entries[Entry.getValue().Index] = &Entry; in emit()
122 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 DDbgEntityHistoryCalculator.cpp76 auto &Entries = VarEntries[Var]; in startDbgValue() local
77 if (!Entries.empty() && Entries.back().isDbgValue() && in startDbgValue()
78 !Entries.back().isClosed() && in startDbgValue()
79 Entries.back().getInstr()->isEquivalentDbgInstr(MI)) { in startDbgValue()
81 << "\t" << Entries.back().getInstr() << "\t" << MI in startDbgValue()
85 Entries.emplace_back(&MI, Entry::DbgValue); in startDbgValue()
86 NewIndex = Entries.size() - 1; in startDbgValue()
92 auto &Entries = VarEntries[Var]; in startClobber() local
95 if (Entries.back().isClobber() && Entries.back().getInstr() == &MI) in startClobber()
96 return Entries.size() - 1; in startClobber()
[all …]
H A DDebugHandlerBase.cpp280 const auto &Entries = I.second; in beginFunction() local
281 if (Entries.empty()) in beginFunction()
299 Entries.front().getInstr()->getDebugVariable(); in beginFunction()
302 if (!IsDescribedByReg(Entries.front().getInstr())) in beginFunction()
303 LabelsBeforeInsn[Entries.front().getInstr()] = Asm->getFunctionBegin(); in beginFunction()
304 if (Entries.front().getInstr()->getDebugExpression()->isFragment()) { in beginFunction()
306 for (const auto *I = Entries.begin(); I != Entries.end(); ++I) { in beginFunction()
310 if (std::any_of(Entries.begin(), I, in beginFunction()
328 for (const auto &Entry : Entries) { in beginFunction()
/openbsd-src/gnu/llvm/llvm/lib/Target/DirectX/
H A DDXILResource.cpp326 SmallVector<Metadata *> Entries; in write() local
328 Entries.emplace_back( in write()
330 Entries.emplace_back(ConstantAsMetadata::get( in write()
333 if (Entries.empty()) in write()
335 return MDNode::get(Ctx, Entries); in write()
339 MutableArrayRef<Metadata *> Entries) const { in write()
341 Entries[0] = ConstantAsMetadata::get(B.getInt32(ID)); in write()
342 Entries[1] = ConstantAsMetadata::get(GV); in write()
343 Entries[2] = MDString::get(Ctx, Name); in write()
344 Entries[3] = ConstantAsMetadata::get(B.getInt32(Space)); in write()
[all …]
/openbsd-src/gnu/llvm/llvm/utils/TableGen/
H A DSequenceToOffsetTable.h69 unsigned Entries; variable
77 SequenceToOffsetTable() : Entries(0) {} in SequenceToOffsetTable()
82 assert(Entries == 0 && "Cannot call add() after layout()"); in add()
100 assert((empty() || Entries) && "Call layout() before size()"); in size()
101 return Entries; in size()
106 assert(Entries == 0 && "Can only call layout() once"); in layout()
110 I->second = Entries; in layout()
112 Entries += I->first.size() + 1; in layout()
118 assert(Entries && "Call layout() before get()"); in get()
130 assert(Entries && "Call layout() before emitStringLiteralDef()"); in emitStringLiteralDef()
[all …]
H A DSearchableTableEmitter.cpp48 std::vector<std::unique_ptr<Entry>> Entries; member
76 std::vector<Record *> Entries; member
298 for (const auto &Entry : Enum.Entries) in emitGenericEnum()
321 IndexRows = Table.Entries; in emitLookupFunction()
334 std::vector<std::pair<Record *, unsigned>> Entries; in emitLookupFunction() local
335 Entries.reserve(Table.Entries.size()); in emitLookupFunction()
336 for (unsigned i = 0; i < Table.Entries.size(); ++i) in emitLookupFunction()
337 Entries.emplace_back(Table.Entries[i], i); in emitLookupFunction()
339 llvm::stable_sort(Entries, [&](const std::pair<Record *, unsigned> &LHS, in emitLookupFunction()
344 IndexRowsStorage.reserve(Entries.size()); in emitLookupFunction()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/DebugInfo/LogicalView/Core/
H A DLVStringPool.h34 std::vector<ValueType *> Entries; variable
47 size_t getSize() const { return Entries.size() - 1; } in getSize()
62 size_t Value = Entries.size(); in getIndex()
65 Entries.push_back(Entry); in getIndex()
71 return (Index >= Entries.size()) ? StringRef() : Entries[Index]->getKey(); in getString()
75 if (!Entries.empty()) { in print()
77 for (const ValueType *Entry : Entries) in print()
/openbsd-src/gnu/llvm/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGSort.cpp224 SmallVector<Entry, 4> Entries; in sortBlocks() local
232 Entries.push_back(Entry(R)); in sortBlocks()
236 for (Entry &E : Entries) in sortBlocks()
240 while (!Entries.empty() && Entries.back().NumBlocksLeft == 0) in sortBlocks()
241 Entries.pop_back(); in sortBlocks()
266 for (Entry &E : Entries) { in sortBlocks()
287 if (!Entries.empty() && in sortBlocks()
288 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) { in sortBlocks()
289 Entries.back().Deferred.push_back(Next); in sortBlocks()
318 if (!Entries.empty() && in sortBlocks()
[all …]
H A DWebAssemblyFixIrreducibleControlFlow.cpp70 static BlockVector getSortedEntries(const BlockSet &Entries) { in getSortedEntries() argument
71 BlockVector SortedEntries(Entries.begin(), Entries.end()); in getSortedEntries()
243 void makeSingleEntryLoop(BlockSet &Entries, BlockSet &Blocks,
338 BlockSet &Entries, BlockSet &Blocks, MachineFunction &MF, in makeSingleEntryLoop() argument
340 assert(Entries.size() >= 2); in makeSingleEntryLoop()
343 BlockVector SortedEntries = getSortedEntries(Entries); in makeSingleEntryLoop()
405 if (!Entries.count(Entry)) in makeSingleEntryLoop()
421 if (Entries.count(Entry) && Pred->isLayoutSuccessor(Entry)) in makeSingleEntryLoop()
434 if (!Entries.count(Entry) || Map.count({Entry, PredInLoop})) in makeSingleEntryLoop()
470 if (!Entries.count(Succ)) in makeSingleEntryLoop()
/openbsd-src/gnu/llvm/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_interceptors_ioctl_netbsd.inc45 /* Entries from file: altq/altq_afmap.h */
50 /* Entries from file: altq/altq.h */
54 /* Entries from file: altq/altq_blue.h */
59 /* Entries from file: altq/altq_cbq.h */
66 /* Entries from file: altq/altq_cdnr.h */
80 /* Entries from file: altq/altq_fifoq.h */
83 /* Entries from file: altq/altq_hfsc.h */
87 /* Entries from file: altq/altq_jobs.h */
95 /* Entries from file: altq/altq_priq.h */
104 /* Entries from file: altq/altq_red.h */
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/ExecutionEngine/JITLink/
H A DTableManager.h35 auto EntryI = Entries.find(Target.getName()); in getEntryForTarget()
38 if (EntryI == Entries.end()) { in getEntryForTarget()
44 EntryI = Entries.insert(std::make_pair(Target.getName(), &Entry)).first; in getEntryForTarget()
47 assert(EntryI != Entries.end() && "Could not get entry symbol"); in getEntryForTarget()
57 DenseMap<StringRef, Symbol *> Entries; variable
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DGenericCycleInfo.h63 SmallVector<BlockT *, 1> Entries; variable
80 Entries.clear(); in clear()
87 void appendEntry(BlockT *Block) { Entries.push_back(Block); } in appendEntry()
99 bool isReducible() const { return Entries.size() == 1; } in isReducible()
101 BlockT *getHeader() const { return Entries[0]; } in getHeader()
104 return Entries; in getEntries()
109 return is_contained(Entries, Block); in isEntry()
193 size_t getNumEntries() const { return Entries.size(); } in getNumEntries()
195 return llvm::make_range(Entries.begin(), Entries.end()); in entries()
202 for (auto *Entry : Entries) { in printEntries()
/openbsd-src/gnu/llvm/llvm/lib/DebugInfo/CodeView/
H A DDebugInlineeLinesSubsection.cpp72 Size += Entries.size() * sizeof(InlineeSourceLineHeader); in calculateSerializedSize()
75 Size += Entries.size() * sizeof(uint32_t); in calculateSerializedSize()
92 for (const auto &E : Entries) { in commit()
111 auto &Entry = Entries.back(); in addExtraFile()
121 Entries.emplace_back(); in addInlineSite()
122 auto &Entry = Entries.back(); in addInlineSite()
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DDbgEntityHistoryCalculator.h95 using Entries = SmallVector<Entry, 4>; variable
97 using EntriesMap = MapVector<InlinedEntity, Entries>;
108 auto &Entries = VarEntries[Var]; in getEntry() local
109 return Entries[Index]; in getEntry()
114 bool hasNonEmptyLocation(const Entries &Entries) const;
/openbsd-src/gnu/llvm/llvm/lib/MCA/HardwareUnits/
H A DRetireControlUnit.cpp45 unsigned Entries = normalizeQuantity(Inst.getNumMicroOps()); in dispatch() local
46 assert((AvailableEntries >= Entries) && "Reorder Buffer unavailable!"); in dispatch()
49 Queue[NextAvailableSlotIdx] = {IR, Entries, false}; in dispatch()
50 NextAvailableSlotIdx += std::max(1U, Entries); in dispatch()
54 AvailableEntries -= Entries; in dispatch()
/openbsd-src/gnu/llvm/compiler-rt/lib/scudo/standalone/
H A Dsecondary.h207 if (Entries[I].CommitBase) in store()
210 Entries[I] = Entries[0]; in store()
211 Entries[0] = Entry; in store()
241 const uptr CommitBase = Entries[I].CommitBase; in retrieve()
244 const uptr CommitSize = Entries[I].CommitSize; in retrieve()
255 Entry = Entries[I]; in retrieve()
256 Entries[I].CommitBase = 0; in retrieve()
329 if (Entries[I].CommitBase) in disableMemoryTagging()
330 setMemoryPermission(Entries[I].CommitBase, Entries[I].CommitSize, 0, in disableMemoryTagging()
331 &Entries[I].Data); in disableMemoryTagging()
[all …]
/openbsd-src/gnu/llvm/libunwind/src/
H A DFrameHeaderCache.hpp50 CacheEntry Entries[kCacheEntryCount]; member in FrameHeaderCache
57 Unused = &Entries[0]; in resetCache()
59 Entries[i].Next = &Entries[i + 1]; in resetCache()
61 Entries[kCacheEntryCount - 1].Next = nullptr; in resetCache()
/openbsd-src/gnu/llvm/llvm/tools/dsymutil/
H A DDebugMap.cpp62 std::vector<Entry> Entries; in print() local
63 Entries.reserve(Symbols.getNumItems()); in print()
65 Entries.push_back(std::make_pair(Sym.getKey(), Sym.getValue())); in print()
66 llvm::sort(Entries, llvm::less_first()); in print()
67 for (const auto &Sym : Entries) { in print()
159 std::vector<dsymutil::DebugMapObject::YAMLSymbolMapping> Entries; member
175 io.mapRequired("symbols", Norm->Entries); in mapping()
228 Entries.reserve(Obj.Symbols.size()); in YamlDMO()
230 Entries.push_back( in YamlDMO()
279 for (auto &Entry : Entries) { in denormalize()
/openbsd-src/gnu/llvm/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()
60 Entries.push_back(ConstantPoolEntry(CPEntryLabel, Value, Size, Loc)); in addEntry()
69 bool ConstantPool::empty() { return Entries.empty(); } in empty()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DInterferenceCache.cpp59 for (Entry &E : Entries) in init()
65 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) { in get()
66 if (!Entries[E].valid(LIUArray, TRI)) in get()
67 Entries[E].revalidate(LIUArray, TRI); in get()
68 return &Entries[E]; in get()
76 if (Entries[E].hasRefs()) { in get()
81 Entries[E].reset(PhysReg, LIUArray, TRI, MF); in get()
83 return &Entries[E]; in get()
/openbsd-src/gnu/llvm/llvm/lib/Target/CSKY/MCTargetDesc/
H A DCSKYTargetStreamer.cpp24 if (Entries.empty()) in emitAll()
31 for (const ConstantPoolEntry &Entry : Entries) { in emitAll()
39 Entries.clear(); in emitAll()
68 Entries.push_back(ConstantPoolEntry(CPEntryLabel, Value, Size, Loc)); in addEntry()
75 bool CSKYConstantPool::empty() { return Entries.empty(); } in empty()
/openbsd-src/gnu/llvm/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVLocation.cpp581 if (!Entries) in addObject()
582 Entries = new LVAutoOperations(); in addObject()
583 Entries->emplace_back(new LVOperation(Opcode, Operand1, Operand2)); in addObject()
608 if (Entries && Entries->size() == 1) { in updateKind()
609 LVOperation *Operation = Entries->front(); in updateKind()
616 if (Entries) in printRawExtra()
617 for (const LVOperation *Operation : *Entries) in printRawExtra()
660 if (Full && Entries) { in printExtra()
664 for (LVOperation *Operation : *Entries) { in printExtra()

123456789