Searched refs:Entry (Results 1 - 25 of 500) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DCostTable.h23 /// Cost Table Entry
33 auto I = find_if(Tbl, [=](const CostTblEntry &Entry) {
34 return ISD == Entry.ISD && Ty == Entry.Type;
56 auto I = find_if(Tbl, [=](const TypeConversionCostTblEntry &Entry) {
57 return ISD == Entry.ISD && Src == Entry.Src && Dst == Entry.Dst;
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_basic_logging.h31 void basicLoggingHandleArg0RealTSC(int32_t FuncId, XRayEntryType Entry);
32 void basicLoggingHandleArg0EmulateTSC(int32_t FuncId, XRayEntryType Entry);
33 void basicLoggingHandleArg1RealTSC(int32_t FuncId, XRayEntryType Entry,
35 void basicLoggingHandleArg1EmulateTSC(int32_t FuncId, XRayEntryType Entry,
H A Dxray_fdr_logging.h31 void fdrLoggingHandleArg0(int32_t FuncId, XRayEntryType Entry);
32 void fdrLoggingHandleArg1(int32_t FuncId, XRayEntryType Entry, uint64_t Arg1);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/XCore/
H A DXCoreSelectionDAGInfo.cpp28 TargetLowering::ArgListEntry Entry; local
29 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext());
30 Entry.Node = Dst; Args.push_back(Entry);
31 Entry.Node = Src; Args.push_back(Entry);
32 Entry.Node = Size; Args.push_back(Entry);
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFDeclContext.h25 struct Entry { struct in class:DWARFDeclContext
26 Entry() : tag(llvm::dwarf::DW_TAG_null), name(nullptr) {} function in struct:DWARFDeclContext::Entry
27 Entry(dw_tag_t t, const char *n) : tag(t), name(n) {} function in struct:DWARFDeclContext::Entry
29 bool NameMatches(const Entry &rhs) const {
47 m_entries.push_back(Entry(tag, name));
54 Entry &operator[](uint32_t idx) {
59 const Entry &operator[](uint32_t idx) const {
82 typedef std::vector<Entry> collection;
/freebsd-11-stable/contrib/llvm-project/clang/utils/TableGen/
H A DClangDataCollectorsEmitter.cpp9 for (const auto &Entry : Defs) {
10 Record &R = *Entry.second;
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/Process/elf-core/
H A DRegisterUtilities.cpp17 for (const auto &Entry : RegsetDescs) {
18 if (Entry.OS != Triple.getOS())
20 if (Entry.Arch != llvm::Triple::UnknownArch &&
21 Entry.Arch != Triple.getArch())
23 return Entry.Note;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfStringPool.cpp29 auto &Entry = I.first->second; local
31 Entry.Index = EntryTy::NotIndexed;
32 Entry.Offset = NumBytes;
33 Entry.Symbol = ShouldCreateSymbols ? Asm.createTempSymbol(Prefix) : nullptr;
36 assert(NumBytes > Entry.Offset && "Unexpected overflow");
97 for (const auto &Entry : Entries) {
98 assert(ShouldCreateSymbols == static_cast<bool>(Entry->getValue().Symbol) &&
103 Asm.OutStreamer->EmitLabel(Entry->getValue().Symbol);
107 Twine(Entry->getValue().Offset));
109 StringRef(Entry
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DNonRelocatableStringpool.cpp20 auto &Entry = I.first->second; local
21 if (I.second || !Entry.isIndexed()) {
22 Entry.Index = NumEntries++;
23 Entry.Offset = CurrentEndOffset;
24 Entry.Symbol = nullptr;
31 DwarfStringPoolEntry Entry{nullptr, 0, DwarfStringPoolEntry::NotIndexed};
36 auto InsertResult = Strings.insert({S, Entry});
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Interpreter/
H A DOptionValueFormatEntity.h46 FormatEntity::Entry &GetCurrentValue() { return m_current_entry; }
48 const FormatEntity::Entry &GetCurrentValue() const { return m_current_entry; }
50 void SetCurrentValue(const FormatEntity::Entry &value) {
54 FormatEntity::Entry &GetDefaultValue() { return m_default_entry; }
56 const FormatEntity::Entry &GetDefaultValue() const { return m_default_entry; }
61 FormatEntity::Entry m_current_entry;
62 FormatEntity::Entry m_default_entry;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/
H A DNativeEnumInjectedSources.cpp36 const SrcHeaderBlockEntry &Entry; member in class:llvm::pdb::__anon1856::final
41 NativeInjectedSource(const SrcHeaderBlockEntry &Entry, argument
43 : Entry(Entry), Strings(Strings), File(File) {}
45 uint32_t getCrc32() const override { return Entry.CRC; }
46 uint64_t getCodeByteSize() const override { return Entry.FileSize; }
49 StringRef Ret = cantFail(Strings.getStringForID(Entry.FileNI),
55 StringRef Ret = cantFail(Strings.getStringForID(Entry.ObjNI),
61 StringRef Ret = cantFail(Strings.getStringForID(Entry.VFileNI),
66 uint32_t getCompression() const override { return Entry
[all...]
H A DInjectedSourceStream.cpp42 for (const auto& Entry : *this) {
43 if (Entry.second.Size != sizeof(SrcHeaderBlockEntry))
46 if (Entry.second.Version !=
52 auto Name = Strings.getStringForID(Entry.second.FileNI);
55 auto ObjName = Strings.getStringForID(Entry.second.ObjNI);
58 auto VName = Strings.getStringForID(Entry.second.VFileNI);
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/
H A Dcond_dealtor.hpp57 template<typename Entry, class Allocator>
61 Entry, \
64 template<typename Entry, class Allocator>
69 typename Allocator::template rebind<Entry>::other
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Core/
H A DUniqueCStringMap.h28 struct Entry { struct in class:lldb_private::UniqueCStringMap
29 Entry(ConstString cstr, const T &v) : cstring(cstr), value(v) {} function in struct:lldb_private::UniqueCStringMap::Entry
39 m_map.push_back(typename UniqueCStringMap<T>::Entry(unique_cstr, value));
42 void Append(const Entry &e) { m_map.push_back(e); }
94 const Entry *FindFirstValueForName(ConstString unique_cstr) const {
102 // returned Entry pointer. nullptr will be returned if there is no subsequent
107 const Entry *FindNextValueForName(const Entry *entry_ptr) const {
109 const Entry *first_entry = &m_map[0];
110 const Entry *after_last_entr
[all...]
/freebsd-11-stable/contrib/llvm-project/lldb/source/DataFormatters/
H A DFormatCache.cpp18 FormatCache::Entry::Entry() function in class:FormatCache::Entry
22 bool FormatCache::Entry::IsFormatCached() { return m_format_cached; }
24 bool FormatCache::Entry::IsSummaryCached() { return m_summary_cached; }
26 bool FormatCache::Entry::IsSyntheticCached() { return m_synthetic_cached; }
28 void FormatCache::Entry::Get(lldb::TypeFormatImplSP &retval) {
32 void FormatCache::Entry::Get(lldb::TypeSummaryImplSP &retval) {
36 void FormatCache::Entry::Get(lldb::SyntheticChildrenSP &retval) {
40 void FormatCache::Entry::Set(lldb::TypeFormatImplSP format_sp) {
45 void FormatCache::Entry
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonSelectionDAGInfo.cpp35 TargetLowering::ArgListEntry Entry; local
36 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext());
37 Entry.Node = Dst;
38 Args.push_back(Entry);
39 Entry.Node = Src;
40 Args.push_back(Entry);
41 Entry.Node = Size;
42 Args.push_back(Entry);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugMacro.h22 struct Entry { struct in class:llvm::DWARFDebugMacro
42 using MacroList = SmallVector<Entry, 4>;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DPredIteratorCache.h43 BasicBlock **&Entry = BlockToPredsMap[BB]; local
44 if (Entry)
45 return Entry;
52 Entry = Memory.Allocate<BasicBlock *>(PredCache.size());
53 std::copy(PredCache.begin(), PredCache.end(), Entry);
54 return Entry;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp74 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks) argument
75 : Entry(Entry), Blocks(Blocks) {
79 if (MBB != Entry) {
113 MachineBasicBlock *Entry; member in class:__anon2438::ReachabilityGraph
133 if (Succ != Entry && inRegion(Succ)) {
143 assert(inRegion(MBB) && Succ != Entry && inRegion(Succ));
144 if (MBB != Entry) {
161 assert(!Loopers.count(Entry));
182 LoopBlocks(MachineBasicBlock *Entry, cons argument
190 MachineBasicBlock *Entry; member in class:__anon2438::LoopBlocks
241 processRegion( MachineBasicBlock *Entry, BlockSet &Blocks, MachineFunction &MF) argument
[all...]
H A DWebAssemblyPrepareForLiveIntervals.cpp82 MachineBasicBlock &Entry = *MF.begin(); local
108 BuildMI(Entry, Entry.begin(), DebugLoc(),
115 for (auto MII = Entry.begin(), MIE = Entry.end(); MII != MIE;) {
119 Entry.insert(Entry.begin(), &MI);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugRangeList.cpp38 RangeListEntry Entry; local
39 Entry.SectionIndex = -1ULL;
42 Entry.StartAddress = data.getRelocatedAddress(offset_ptr);
43 Entry.EndAddress =
44 data.getRelocatedAddress(offset_ptr, &Entry.SectionIndex);
53 if (Entry.isEndOfListEntry())
55 Entries.push_back(Entry);
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/scudo/
H A Dscudo_utils.cpp93 struct { uptr Tag; uptr Value; } Entry = { 0, 0 }; local
95 uptr N = internal_read(F, &Entry, sizeof(Entry));
96 if (internal_iserror(N) || N != sizeof(Entry) ||
97 (Entry.Tag == 0 && Entry.Value == 0) || Entry.Tag == AT_HWCAP)
101 return (Entry.Tag == AT_HWCAP && (Entry.Value & HWCAP_CRC32) != 0);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DArrayRecycler.h46 FreeList *Entry = Bucket[Idx];
47 if (!Entry)
49 __asan_unpoison_memory_region(Entry, Capacity::get(Idx).getSize());
50 Bucket[Idx] = Entry->Next;
51 __msan_allocated_memory(Entry, Capacity::get(Idx).getSize());
52 return reinterpret_cast<T*>(Entry);
58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr); local
61 Entry->Next = Bucket[Idx];
62 Bucket[Idx] = Entry;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DUniqueVector.h40 unsigned insert(const T &Entry) { argument
42 unsigned &Val = Map[Entry];
51 Vector.push_back(Entry);
57 unsigned idFor(const T &Entry) const {
59 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DRetireControlUnitStatistics.cpp62 for (const std::pair<const unsigned, unsigned> &Entry : RetiredPerCycle) {
63 TempStream << " " << Entry.first;
64 if (Entry.first < 10)
68 TempStream << Entry.second << " ("
69 << format("%.1f", ((double)Entry.second / NumCycles) * 100.0)

Completed in 366 milliseconds

1234567891011>>