| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/ |
| cond_dealtor.hpp | 51 template<typename Entry, typename _Alloc>
54 typedef rebind_traits<_Alloc, Entry> alloc_traits;
80 template<typename Entry, class _Alloc>
81 typename cond_dealtor<Entry, _Alloc>::entry_allocator
82 cond_dealtor<Entry, _Alloc>::s_alloc;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/ |
| cond_dealtor.hpp | 51 template<typename Entry, typename _Alloc>
54 typedef rebind_traits<_Alloc, Entry> alloc_traits;
80 template<typename Entry, class _Alloc>
81 typename cond_dealtor<Entry, _Alloc>::entry_allocator
82 cond_dealtor<Entry, _Alloc>::s_alloc;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| CostTable.h | 23 /// Cost Table Entry
33 auto I = find_if(Tbl, [=](const CostTblEntry &Entry) {
34 return ISD == Entry.ISD && Ty == Entry.Type;
39 // Could not find an entry.
56 auto I = find_if(Tbl, [=](const TypeConversionCostTblEntry &Entry) {
57 return ISD == Entry.ISD && Src == Entry.Src && Dst == Entry.Dst;
62 // Could not find an entry
[all...] |
| /src/sys/external/bsd/gnu-efi/dist/inc/ |
| efilink.h | 27 // List entry - doubly linked list
62 // PLIST_ENTRY Entry
66 #define _RemoveEntryList(Entry) { \
68 _Flink = (Entry)->Flink; \
69 _Blink = (Entry)->Blink; \
75 #define RemoveEntryList(Entry) \
76 _RemoveEntryList(Entry); \
77 (Entry)->Flink = (LIST_ENTRY *) BAD_POINTER; \
78 (Entry)->Blink = (LIST_ENTRY *) BAD_POINTER;
80 #define RemoveEntryList(Entry) \
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/gc/ |
| registry.d | 43 auto ptr = cast(Entry*)realloc(entries.ptr, (entries.length + 1) * Entry.sizeof);
45 entries[$ - 1] = Entry(name, factory);
60 foreach (entry; entries)
62 if (entry.name != name)
64 auto instance = entry.factory();
74 const(Entry[]) registeredGCFactories(scope int dummy=0) nothrow @nogc
81 struct Entry
87 __gshared Entry[] entries;
|
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| xray_basic_logging.h | 32 void basicLoggingHandleArg0RealTSC(int32_t FuncId, XRayEntryType Entry);
33 void basicLoggingHandleArg0EmulateTSC(int32_t FuncId, XRayEntryType Entry);
34 void basicLoggingHandleArg1RealTSC(int32_t FuncId, XRayEntryType Entry,
36 void basicLoggingHandleArg1EmulateTSC(int32_t FuncId, XRayEntryType Entry,
|
| xray_fdr_logging.h | 32 void fdrLoggingHandleArg0(int32_t FuncId, XRayEntryType Entry);
33 void fdrLoggingHandleArg1(int32_t FuncId, XRayEntryType Entry, uint64_t Arg1);
|
| /src/external/apache2/llvm/dist/clang/utils/TableGen/ |
| ClangDataCollectorsEmitter.cpp | 9 for (const auto &Entry : Defs) {
10 Record &R = *Entry.second;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/XCore/ |
| XCoreSelectionDAGInfo.cpp | 28 TargetLowering::ArgListEntry Entry;
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);
|
| /src/external/apache2/llvm/dist/llvm/tools/lli/ |
| ExecutionUtils.cpp | 71 // Entry Symbol File Size Previous Entry
82 outsv("{0,11} {1,24} {2,15} {3,14}\n", "Entry", "Symbol File", "Size",
83 "Previous Entry");
86 for (auto *Entry = Descriptor->first_entry; Entry; Entry = Entry->next_entry)
87 outsv("[{0,2}] {1:X16} {2:X16} {3,8:D} {4}\n", Idx++, Entry,
88 reinterpret_cast<const void *>(Entry->symfile_addr)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| NonRelocatableStringpool.cpp | 20 auto &Entry = I.first->second;
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});
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/ |
| NativeEnumInjectedSources.cpp | 36 const SrcHeaderBlockEntry &Entry;
41 NativeInjectedSource(const SrcHeaderBlockEntry &Entry,
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.Compression;
[all...] |
| InjectedSourceStream.cpp | 42 for (const auto& Entry : *this) {
43 if (Entry.second.Size != sizeof(SrcHeaderBlockEntry))
45 "Invalid headerbock entry size");
46 if (Entry.second.Version !=
49 "Invalid headerbock entry 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);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfStringPool.cpp | 28 auto &Entry = I.first->second;
30 Entry.Index = EntryTy::NotIndexed;
31 Entry.Offset = NumBytes;
32 Entry.Symbol = ShouldCreateSymbols ? Asm.createTempSymbol(Prefix) : nullptr;
61 // table. The header consists of an entry with the contribution's
95 for (const auto &Entry : Entries) {
96 assert(ShouldCreateSymbols == static_cast<bool>(Entry->getValue().Symbol) &&
97 "Mismatch between setting and entry");
101 Asm.OutStreamer->emitLabel(Entry->getValue().Symbol);
105 Twine(Entry->getValue().Offset))
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonSelectionDAGInfo.cpp | 35 TargetLowering::ArgListEntry Entry;
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);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| PredIteratorCache.h | 43 BasicBlock **&Entry = BlockToPredsMap[BB];
44 if (Entry)
45 return Entry;
52 Entry = Memory.Allocate<BasicBlock *>(PredCache.size());
53 std::copy(PredCache.begin(), PredCache.end(), Entry);
54 return Entry;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyFixIrreducibleControlFlow.cpp | 11 /// Irreducible control flow means multiple-entry loops, which this pass
12 /// transforms to have a single entry.
19 /// of blocks with a single entry and no branches back to that entry. A region
21 /// loop's body without branches back to the loop entry. In each region we fix
22 /// up multi-entry loops by adding a new block that can dispatch to each of the
26 /// single entry in the loop containing the previous multiple entries. After
81 // the region, and ignores branches to the region entry (for the case where
85 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks)
86 : Entry(Entry), Blocks(Blocks)
[all...] |
| WebAssemblyPrepareForLiveIntervals.cpp | 82 MachineBasicBlock &Entry = *MF.begin();
92 // uses provide a definition. Insert IMPLICIT_DEFs in the entry block to
108 BuildMI(Entry, Entry.begin(), DebugLoc(),
113 // Move ARGUMENT_* instructions to the top of the entry block, so that their
115 for (auto MII = Entry.begin(), MIE = Entry.end(); MII != MIE;) {
119 Entry.insert(Entry.begin(), &MI);
|
| /src/external/apache2/llvm/dist/clang/tools/diagtool/ |
| ListWarnings.cpp | 29 struct Entry {
33 Entry(llvm::StringRef diagN, llvm::StringRef flag)
36 bool operator<(const Entry &x) const { return DiagName < x.DiagName; }
40 static void printEntries(std::vector<Entry> &entries, llvm::raw_ostream &out) {
41 for (const Entry &E : entries) {
50 std::vector<Entry> Flagged, Unflagged;
62 Entry entry(DR.getName(), DiagnosticIDs::getWarningOptionForDiag(diagID));
64 if (entry.Flag.empty())
65 Unflagged.push_back(entry);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugRangeList.cpp | 38 RangeListEntry Entry;
39 Entry.SectionIndex = -1ULL;
42 Entry.StartAddress = data.getRelocatedAddress(offset_ptr);
43 Entry.EndAddress =
44 data.getRelocatedAddress(offset_ptr, &Entry.SectionIndex);
50 "invalid range list entry at offset 0x%" PRIx64,
53 if (Entry.isEndOfListEntry())
55 Entries.push_back(Entry);
74 // base address specifier entry - so use max-1.
88 // Base address of a range list entry is determined by the closest precedin
[all...] |
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| CacheMap.h | 56 struct Entry
61 Entry ()
71 Entry *getEntry (Key_t key);
76 Entry **chunks;
88 chunks = new Entry*[32];
90 chunks[nchunks++] = new Entry[cursize];
118 chunks[nchunks++] = new Entry[cursize];
122 Entry *newchunk = chunks[nchunks - 1];
127 Entry *oldchunk = chunks[i];
134 Entry *entry = getEntry (key) local
159 Entry *entry = getEntry (key); local
176 Entry *entry = getEntry (key); local
[all...] |
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| CacheMap.h | 56 struct Entry
61 Entry ()
71 Entry *getEntry (Key_t key);
76 Entry **chunks;
88 chunks = new Entry*[32];
90 chunks[nchunks++] = new Entry[cursize];
118 chunks[nchunks++] = new Entry[cursize];
122 Entry *newchunk = chunks[nchunks - 1];
127 Entry *oldchunk = chunks[i];
134 Entry *entry = getEntry (key) local
159 Entry *entry = getEntry (key); local
176 Entry *entry = getEntry (key); local
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 41 // Remove an entry from the free list in Bucket[Idx] and return it.
46 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);
55 // Add an entry to the free list at Bucket[Idx].
58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
61 Entry->Next = Bucket[Idx]
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| UniqueVector.h | 21 /// unique entry that is added. T is the type of entries in the vector. This
23 /// Entries can be fetched using operator[] with the entry ID.
31 // Map - Used to handle the correspondence of entry to ID.
38 /// insert - Append entry to the vector if it doesn't already exist. Returns
39 /// the entry's index + 1 to be used as a unique ID.
40 unsigned insert(const T &Entry) {
41 // Check if the entry is already in the map.
42 unsigned &Val = Map[Entry];
44 // See if entry exists, if so return prior ID.
47 // Compute ID for entry
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/ |
| RetireControlUnitStatistics.cpp | 62 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)
|
