| /freebsd-12.1/contrib/llvm/tools/lldb/source/DataFormatters/ |
| H A D | FormatCache.cpp | 19 FormatCache::Entry::Entry() in Entry() function in FormatCache::Entry 24 FormatCache::Entry::Entry(lldb::TypeFormatImplSP format_sp) in Entry() function in FormatCache::Entry 31 FormatCache::Entry::Entry(lldb::TypeSummaryImplSP summary_sp) in Entry() function in FormatCache::Entry 38 FormatCache::Entry::Entry(lldb::SyntheticChildrenSP synthetic_sp) in Entry() function in FormatCache::Entry 45 FormatCache::Entry::Entry(lldb::TypeValidatorImplSP validator_sp) in Entry() function in FormatCache::Entry 52 FormatCache::Entry::Entry(lldb::TypeFormatImplSP format_sp, in Entry() function in FormatCache::Entry 62 bool FormatCache::Entry::IsFormatCached() { return m_format_cached; } in IsFormatCached() 72 lldb::TypeSummaryImplSP FormatCache::Entry::GetSummary() { in GetSummary() 76 lldb::SyntheticChildrenSP FormatCache::Entry::GetSynthetic() { in GetSynthetic() 80 lldb::TypeValidatorImplSP FormatCache::Entry::GetValidator() { in GetValidator() [all …]
|
| /freebsd-12.1/contrib/compiler-rt/lib/esan/ |
| H A D | esan_hashtable.h | 111 *Entry; variable 154 InternalFree(Entry); in ~HashTable() 155 Entry = Next; in ~HashTable() 182 for (; Entry != nullptr; Entry = Entry->Next) { in lookup() 226 for (; Entry != nullptr; Entry = Entry->Next) { in add() 259 for (; Entry != nullptr; Prev = Entry, Entry = Entry->Next) { in remove() 320 return HashPair(Entry->Key, Entry->Payload); 329 if (Entry != nullptr) 330 Entry = Entry->Next; 355 return Cmp.Table == Table && Cmp.Idx == Idx && Cmp.Entry == Entry; [all …]
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | DwarfStringPool.cpp | 30 auto &Entry = I.first->second; in getEntryImpl() local 32 Entry.Index = EntryTy::NotIndexed; in getEntryImpl() 33 Entry.Offset = NumBytes; in getEntryImpl() 37 assert(NumBytes > Entry.Offset && "Unexpected overflow"); in getEntryImpl() 98 for (const auto &Entry : Entries) { in emit() local 110 StringRef(Entry->getKeyData(), Entry->getKeyLength() + 1)); in emit() 118 for (const auto &Entry : Pool) { in emit() local 119 if (Entry.getValue().isIndexed()) in emit() 120 Entries[Entry.getValue().Index] = &Entry; in emit() 125 for (const auto &Entry : Entries) in emit() local [all …]
|
| /freebsd-12.1/contrib/llvm/tools/lldb/source/Plugins/Process/gdb-remote/ |
| H A D | GDBRemoteCommunicationHistory.cpp | 76 const Entry &entry = m_packets[idx]; in Dump() 96 const Entry &entry = m_packets[idx]; in Dump() 123 GDBRemoteCommunicationHistory::Entry::BinaryData &Val) { in input() 129 IO &io, GDBRemoteCommunicationHistory::Entry &Entry) { in mapping() argument 130 io.mapRequired("packet", Entry.packet); in mapping() 131 io.mapRequired("type", Entry.type); in mapping() 132 io.mapRequired("bytes", Entry.bytes_transmitted); in mapping() 133 io.mapRequired("index", Entry.packet_idx); in mapping() 134 io.mapRequired("tid", Entry.tid); in mapping() 138 IO &io, GDBRemoteCommunicationHistory::Entry &Entry) { in validate() argument [all …]
|
| H A D | GDBRemoteCommunicationHistory.h | 33 struct Entry { struct 34 Entry() in Entry() function 101 std::vector<Entry> m_packets; 112 lldb_private::process_gdb_remote::GDBRemoteCommunicationHistory::Entry) in LLVM_YAML_IS_DOCUMENT_LIST_VECTOR() argument 127 GDBRemoteCommunicationHistory::Entry::BinaryData> { in LLVM_YAML_IS_DOCUMENT_LIST_VECTOR() 129 GDBRemoteCommunicationHistory::Entry::BinaryData &, in LLVM_YAML_IS_DOCUMENT_LIST_VECTOR() 134 lldb_private::process_gdb_remote::GDBRemoteCommunicationHistory::Entry:: in LLVM_YAML_IS_DOCUMENT_LIST_VECTOR() 142 lldb_private::process_gdb_remote::GDBRemoteCommunicationHistory::Entry> { in LLVM_YAML_IS_DOCUMENT_LIST_VECTOR() 145 lldb_private::process_gdb_remote::GDBRemoteCommunicationHistory::Entry in LLVM_YAML_IS_DOCUMENT_LIST_VECTOR() 146 &Entry); in LLVM_YAML_IS_DOCUMENT_LIST_VECTOR() [all …]
|
| /freebsd-12.1/contrib/llvm/tools/lldb/include/lldb/Core/ |
| H A D | RangeMap.h | 141 typedef Range<B, S> Entry; typedef 266 static bool BaseLessThan(const Entry &lhs, const Entry &rhs) { in BaseLessThan() 275 Entry entry(addr, 1); in FindEntryIndexThatContains() 315 const Entry *FindEntryThatContains(const Entry &range) const { in FindEntryThatContains() 501 static bool BaseLessThan(const Entry &lhs, const Entry &rhs) { in BaseLessThan() 550 const Entry *FindEntryThatContains(const Entry &range) const { in FindEntryThatContains() 721 static bool BaseLessThan(const Entry &lhs, const Entry &rhs) { in BaseLessThan() 757 const Entry *FindEntryThatContains(const Entry &range) const { in FindEntryThatContains() 905 static bool BaseLessThan(const Entry &lhs, const Entry &rhs) { in BaseLessThan() 914 Entry entry; in FindEntry() [all …]
|
| H A D | UniqueCStringMap.h | 31 struct Entry { struct 32 Entry() {} in Entry() function 40 bool operator<(const Entry &rhs) const { 70 void Insert(const Entry &e) { in Insert() 115 Entry search_entry(unique_cstr); in Find() 133 Entry search_entry(unique_cstr); in FindFirstValueForName() 149 const Entry *FindNextValueForName(const Entry *entry_ptr) const { in FindNextValueForName() 151 const Entry *first_entry = &m_map[0]; in FindNextValueForName() 165 Entry search_entry(unique_cstr); in GetValues() 238 Entry search_entry(unique_cstr); in Erase() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Target/Mips/ |
| H A D | MicroMipsSizeReduction.cpp | 345 if (!InRange(offset, Entry.Shift(), Entry.LBound(), Entry.HBound())) in ImmInRange() 433 Entry != Range.second; ++Entry) { in ReduceMI() 444 const ReduceEntry &Entry = Arguments->Entry; in ReduceXWtoXWSP() local 457 const ReduceEntry &Entry = Arguments->Entry; in ReduceXWtoXWP() local 499 const ReduceEntry &Entry = Arguments->Entry; in ReduceArithmeticInstructions() local 513 const ReduceEntry &Entry = Arguments->Entry; in ReduceADDIUToADDIUR1SP() local 527 const ReduceEntry &Entry = Arguments->Entry; in ReduceADDIUToADDIUSP() local 545 const ReduceEntry &Entry = Arguments->Entry; in ReduceLXUtoLXU16() local 560 const ReduceEntry &Entry = Arguments->Entry; in ReduceSXtoSX16() local 614 const ReduceEntry &Entry = Arguments->Entry; in ReduceMoveToMovep() local [all …]
|
| H A D | MipsOptimizePICCall.cpp | 106 unsigned getCount(ValueType Entry); 110 unsigned getReg(ValueType Entry); 237 ValueType Entry; in visitNode() local 240 if (!isCallViaRegister(*I, Reg, Entry)) in visitNode() 244 unsigned N = getCount(Entry); in visitNode() 259 if (Entry) in visitNode() 260 incCntAndSetReg(Entry, Reg); in visitNode() 306 return ScopedHT.lookup(Entry).first; in getCount() 309 unsigned OptimizePICCall::getReg(ValueType Entry) { in getReg() argument 310 unsigned Reg = ScopedHT.lookup(Entry).second; in getReg() [all …]
|
| /freebsd-12.1/contrib/llvm/tools/lldb/source/Core/ |
| H A D | FormatEntity.cpp | 282 FormatEntity::Entry::Entry(llvm::StringRef s) in Entry() function in FormatEntity::Entry 287 FormatEntity::Entry::Entry(char ch) in Entry() function in FormatEntity::Entry 1083 FormatEntity::Entry root; in FormatStringRef() 1116 case Entry::Type::Invalid: in Format() 1125 case Entry::Type::Root: in Format() 1134 case Entry::Type::String: in Format() 1138 case Entry::Type::Scope: { in Format() 1390 case Entry::Type::File: in Format() 1401 case Entry::Type::Lang: in Format() 2028 Entry scope_entry(Entry::Type::Scope); in ParseInternal() [all …]
|
| /freebsd-12.1/contrib/llvm/tools/llvm-mca/Views/ |
| H A D | TimelineView.cpp | 133 const WaitTimeEntry &Entry, in printWaitTimeEntry() argument 141 AverageTime2 = (double)Entry.CyclesSpentInSQWhileReady / Executions; in printWaitTimeEntry() 204 assert(Entry.CycleDispatched >= 0 && "Invalid TimelineViewEntry!"); in printTimelineViewEntry() 209 if (CycleDispatched != Entry.CycleExecuted) { in printTimelineViewEntry() 214 if (Entry.CycleIssued == Entry.CycleExecuted) in printTimelineViewEntry() 217 if (CycleDispatched != Entry.CycleIssued) in printTimelineViewEntry() 219 for (unsigned I = Entry.CycleIssued + 1, E = Entry.CycleExecuted; I < E; in printTimelineViewEntry() 226 for (unsigned I = Entry.CycleExecuted + 1, E = Entry.CycleRetired; I < E; ++I) in printTimelineViewEntry() 272 const TimelineViewEntry &Entry = Timeline[IID]; in printTimeline() local 273 if (Entry.CycleRetired == 0) in printTimeline() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Target/ARM/ |
| H A D | Thumb2SizeReduction.cpp | 415 unsigned Opc = Entry.NarrowOpc1; in ReduceLoadStore() 417 uint8_t ImmLimit = Entry.Imm1Limit; in ReduceLoadStore() 419 switch (Entry.WideOpc) { in ReduceLoadStore() 425 Opc = Entry.NarrowOpc2; in ReduceLoadStore() 426 ImmLimit = Entry.Imm2Limit; in ReduceLoadStore() 587 if (Entry.WideOpc == ARM::t2STMIA) in ReduceLoadStore() 780 if (Entry.Imm2Limit) { in ReduceTo2Addr() 863 if (Entry.Imm1Limit) in ReduceToNarrow() 1014 if (Entry.Special) in ReduceMI() 1018 if (Entry.NarrowOpc2 && in ReduceMI() [all …]
|
| H A D | ARMSelectionDAGInfo.cpp | 78 Entry.Node = Dst; in EmitSpecializedLibcall() 79 Args.push_back(Entry); in EmitSpecializedLibcall() 81 Entry.Node = Size; in EmitSpecializedLibcall() 82 Args.push_back(Entry); in EmitSpecializedLibcall() 87 Entry.Node = Size; in EmitSpecializedLibcall() 88 Args.push_back(Entry); in EmitSpecializedLibcall() 96 Entry.Node = Src; in EmitSpecializedLibcall() 98 Entry.IsSExt = false; in EmitSpecializedLibcall() 99 Args.push_back(Entry); in EmitSpecializedLibcall() 101 Entry.Node = Src; in EmitSpecializedLibcall() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Object/ |
| H A D | WindowsResource.cpp | 151 Data.push_back(Entry.getData()); in parse() 180 NameNode.addLanguageNode(Entry); in addEntry() 217 if (Entry.checkTypeString()) in addTypeNode() 220 return addChild(Entry.getTypeID()); in addTypeNode() 226 if (Entry.checkNameString()) in addNameNode() 234 const ResourceEntryRef &Entry) { in addLanguageNode() argument 235 return addChild(Entry.getLanguage(), true, Entry.getMajorVersion(), in addLanguageNode() 236 Entry.getMinorVersion(), Entry.getCharacteristics()); in addLanguageNode() 412 for (auto const &Entry : Data) { in performSectionTwoLayout() local 659 Entry->Codepage = 0; in writeDirectoryTree() [all …]
|
| /freebsd-12.1/contrib/llvm/include/llvm/DebugInfo/DWARF/ |
| H A D | DWARFAcceleratorTable.h | 39 class Entry { 43 Entry() = default; 46 Entry(const Entry &) = default; 47 Entry(Entry &&) = default; 48 Entry &operator=(const Entry &) = default; 49 Entry &operator=(Entry &&) = default; 50 ~Entry() = default; 117 class Entry final : public DWARFAcceleratorTable::Entry { 120 Entry(const HeaderData &Data); 121 Entry() = default; [all …]
|
| /freebsd-12.1/contrib/llvm/tools/lldb/include/lldb/DataFormatters/ |
| H A D | FormatCache.h | 23 struct Entry { struct 36 Entry(); argument 37 Entry(lldb::TypeFormatImplSP); 38 Entry(lldb::TypeSummaryImplSP); 39 Entry(lldb::SyntheticChildrenSP); 40 Entry(lldb::TypeValidatorImplSP); 41 Entry(lldb::TypeFormatImplSP, lldb::TypeSummaryImplSP, 68 typedef std::map<ConstString, Entry> CacheMap; 75 Entry &GetEntry(const ConstString &type);
|
| /freebsd-12.1/contrib/llvm/tools/lldb/source/Plugins/SymbolFile/DWARF/ |
| H A D | DWARFDeclContext.h | 28 struct Entry { struct 29 Entry() : tag(0), name(NULL) {} in Entry() function 30 Entry(dw_tag_t t, const char *n) : tag(t), name(n) {} in Entry() argument 32 bool NameMatches(const Entry &rhs) const { in NameMatches() argument 50 m_entries.push_back(Entry(tag, name)); in AppendDeclContext() argument 57 Entry &operator[](uint32_t idx) { 62 const Entry &operator[](uint32_t idx) const { 85 typedef std::vector<Entry> collection;
|
| /freebsd-12.1/contrib/llvm/lib/Target/XCore/ |
| H A D | XCoreSelectionDAGInfo.cpp | 29 TargetLowering::ArgListEntry Entry; in EmitTargetCodeForMemcpy() local 30 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext()); in EmitTargetCodeForMemcpy() 31 Entry.Node = Dst; Args.push_back(Entry); in EmitTargetCodeForMemcpy() 32 Entry.Node = Src; Args.push_back(Entry); in EmitTargetCodeForMemcpy() 33 Entry.Node = Size; Args.push_back(Entry); in EmitTargetCodeForMemcpy()
|
| /freebsd-12.1/contrib/compiler-rt/lib/scudo/ |
| H A D | scudo_utils.cpp | 94 struct { uptr Tag; uptr Value; } Entry = { 0, 0 }; in hasHardwareCRC32ARMPosix() local 96 uptr N = internal_read(F, &Entry, sizeof(Entry)); in hasHardwareCRC32ARMPosix() 97 if (internal_iserror(N) || N != sizeof(Entry) || in hasHardwareCRC32ARMPosix() 98 (Entry.Tag == 0 && Entry.Value == 0) || Entry.Tag == AT_HWCAP) in hasHardwareCRC32ARMPosix() 102 return (Entry.Tag == AT_HWCAP && (Entry.Value & HWCAP_CRC32) != 0); in hasHardwareCRC32ARMPosix()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/ |
| H A D | Consumed.cpp | 524 return Entry->second; in getInfo() 629 if (Entry == PropagationMap.end() || Entry->second.isTest()) in handleCall() 644 if (!(Entry->second.isVar() || Entry->second.isTmp())) in handleCall() 766 if (Entry != PropagationMap.end() && !Entry->second.isTest()) { in VisitCXXBindTemporaryExpr() 907 if (Entry->second.isTest()) in VisitUnaryOperator() 1025 if (Entry) { in addInfo() 1039 if (Entry) { in addInfo() 1117 if (Entry != VarMap.end()) in getState() 1118 return Entry->second; in getState() 1127 if (Entry != TmpMap.end()) in getState() [all …]
|
| /freebsd-12.1/contrib/llvm/include/llvm/Support/ |
| H A D | ArrayRecycler.h | 47 FreeList *Entry = Bucket[Idx]; in pop() local 48 if (!Entry) in pop() 50 __asan_unpoison_memory_region(Entry, Capacity::get(Idx).getSize()); in pop() 51 Bucket[Idx] = Entry->Next; in pop() 52 __msan_allocated_memory(Entry, Capacity::get(Idx).getSize()); in pop() 53 return reinterpret_cast<T*>(Entry); in pop() 59 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr); in push() local 62 Entry->Next = Bucket[Idx]; in push() 63 Bucket[Idx] = Entry; in push()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Basic/ |
| H A D | SourceManager.cpp | 398 if (Entry) return Entry; in getOrCreateContentCache() 421 return Entry; in getOrCreateContentCache() 431 new (Entry) ContentCache(); in createMemBufferContentCache() 434 return Entry; in createMemBufferContentCache() 1387 const LineEntry *Entry = in getFileCharacteristic() local 1391 if (!Entry) in getFileCharacteristic() 1394 return Entry->FileKind; in getFileCharacteristic() 1659 if (Entry && in translateFile() 1695 if (!Entry.isFile()) in translateLineCol() 1768 if (Entry.isFile()) { in computeMacroArgsCache() [all …]
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | CostTable.h | 34 auto I = find_if(Tbl, [=](const CostTblEntry &Entry) { in CostTableLookup() 35 return ISD == Entry.ISD && Ty == Entry.Type; in CostTableLookup() 57 auto I = find_if(Tbl, [=](const TypeConversionCostTblEntry &Entry) { in ConvertCostTableLookup() 58 return ISD == Entry.ISD && Src == Entry.Src && Dst == Entry.Dst; in ConvertCostTableLookup()
|
| /freebsd-12.1/contrib/llvm/lib/Target/Hexagon/ |
| H A D | HexagonSelectionDAGInfo.cpp | 36 TargetLowering::ArgListEntry Entry; in EmitTargetCodeForMemcpy() local 37 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext()); in EmitTargetCodeForMemcpy() 38 Entry.Node = Dst; in EmitTargetCodeForMemcpy() 39 Args.push_back(Entry); in EmitTargetCodeForMemcpy() 40 Entry.Node = Src; in EmitTargetCodeForMemcpy() 41 Args.push_back(Entry); in EmitTargetCodeForMemcpy() 42 Entry.Node = Size; in EmitTargetCodeForMemcpy() 43 Args.push_back(Entry); in EmitTargetCodeForMemcpy()
|
| /freebsd-12.1/contrib/llvm/lib/IR/ |
| H A D | Value.cpp | 773 AddToExistingUseList(&Entry); in AddToUseList() 787 AddToExistingUseList(&Entry); in AddToUseList() 850 for (ValueHandleBase Iterator(Assert, *Entry); Entry; Entry = Iterator.Next) { in ValueIsDeleted() 852 Iterator.AddToExistingUseListAfter(Entry); in ValueIsDeleted() 855 switch (Entry->getKind()) { in ValueIsDeleted() 862 Entry->operator=(nullptr); in ValueIsDeleted() 902 for (ValueHandleBase Iterator(Assert, *Entry); Entry; Entry = Iterator.Next) { in ValueIsRAUWd() 907 switch (Entry->getKind()) { in ValueIsRAUWd() 914 Entry->operator=(New); in ValueIsRAUWd() 927 for (Entry = pImpl->ValueHandles[Old]; Entry; Entry = Entry->Next) in ValueIsRAUWd() [all …]
|