HomeSort by relevance Sort by last modified time
    Searched defs:Entry (Results 51 - 75 of 1665) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/libchrome/base/trace_event/
heap_profiler_heap_dump_writer.h 40 // An entry in the "entries" array as described in https://goo.gl/KY7zVE.
41 struct BASE_EXPORT Entry {
54 // Comparison operator to enable putting |Entry| in a |std::set|.
55 BASE_EXPORT bool operator<(Entry lhs, Entry rhs);
58 BASE_EXPORT std::unique_ptr<TracedValue> Serialize(const std::set<Entry>& dump);
79 const std::set<Entry>& Summarize(
83 // Inserts an |Entry| for |Bucket| into |entries_|. Returns false if the
84 // entry was present before, true if it was not.
92 std::set<Entry> entries_
    [all...]
  /external/llvm/include/llvm/DebugInfo/DWARF/
DWARFDebugLoc.h 23 struct Entry {
38 SmallVector<Entry, 2> Entries;
60 struct Entry {
68 SmallVector<Entry, 2> Entries;
DWARFDebugMacro.h 22 /// A single macro entry within a macro list.
23 struct Entry {
24 /// The type of the macro entry.
34 /// The string (name, value) of the macro entry.
43 typedef SmallVector<Entry, 4> MacroList;
  /external/llvm/include/llvm/IR/
PredIteratorCache.h 44 BasicBlock **&Entry = BlockToPredsMap[BB];
45 if (Entry)
46 return Entry;
53 Entry = Memory.Allocate<BasicBlock *>(PredCache.size());
54 std::copy(PredCache.begin(), PredCache.end(), Entry);
55 return Entry;
  /external/llvm/lib/Target/AArch64/
AArch64SelectionDAGInfo.cpp 23 // Check to see if there is a specialized entry-point for memory zeroing.
38 TargetLowering::ArgListEntry Entry;
39 Entry.Node = Dst;
40 Entry.Ty = IntPtrTy;
41 Args.push_back(Entry);
42 Entry.Node = Size;
43 Args.push_back(Entry);
  /external/llvm/lib/Target/WebAssembly/
WebAssemblyPrepareForLiveIntervals.cpp 91 MachineBasicBlock &Entry = *MF.begin();
101 // uses provide a definition. Insert IMPLICIT_DEFs in the entry block to
117 BuildMI(Entry, Entry.begin(), DebugLoc(),
122 // Move ARGUMENT_* instructions to the top of the entry block, so that their
124 for (auto MII = Entry.begin(), MIE = Entry.end(); MII != MIE; ) {
128 Entry.insert(Entry.begin(), MI);
  /external/llvm/unittests/Bitcode/
BitstreamReaderTest.cpp 221 BitstreamEntry Entry =
223 ASSERT_EQ(BitstreamEntry::SubBlock, Entry.Kind);
224 ASSERT_EQ(BlockID, Entry.ID);
228 Entry = Stream.advance();
229 ASSERT_EQ(BitstreamEntry::Record, Entry.Kind);
230 ASSERT_EQ(AbbrevID, Entry.ID);
235 ASSERT_EQ(RecordID, Stream.readRecord(Entry.ID, Record, &BlobOut));
  /external/skia/src/gpu/gl/
GrGLGpuProgramCache.cpp 25 struct GrGLGpu::ProgramCache::Entry {
26 Entry(sk_sp<GrGLProgram> program)
82 std::unique_ptr<Entry>* entry = fMap.find(desc); local
83 if (!entry) {
88 entry = fMap.find(desc);
90 if (!entry) {
99 entry = fMap.insert(desc, std::unique_ptr<Entry>(new Entry(sk_sp<GrGLProgram>(program))))
    [all...]
  /external/skqp/src/gpu/gl/
GrGLGpuProgramCache.cpp 25 struct GrGLGpu::ProgramCache::Entry {
26 Entry(sk_sp<GrGLProgram> program)
82 std::unique_ptr<Entry>* entry = fMap.find(desc); local
83 if (!entry) {
88 entry = fMap.find(desc);
90 if (!entry) {
99 entry = fMap.insert(desc, std::unique_ptr<Entry>(new Entry(sk_sp<GrGLProgram>(program))))
    [all...]
  /external/swiftshader/third_party/LLVM/unittests/VMCore/
VerifierTest.cpp 29 BasicBlock *Entry = BasicBlock::Create(C, "entry", F.get());
37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry);
  /external/syslinux/efi32/include/efi/
efiui.h 20 entry contains all zeros.
50 UI_STRING_ENTRY *Entry;
  /external/syslinux/efi64/include/efi/
efiui.h 20 entry contains all zeros.
50 UI_STRING_ENTRY *Entry;
  /external/syslinux/gnu-efi/gnu-efi-3.0/inc/
efiui.h 20 entry contains all zeros.
50 UI_STRING_ENTRY *Entry;
  /external/tensorflow/tensorflow/stream_executor/
executor_cache.cc 26 // In the fast path case, the cache already has an entry and we can just
34 Entry* entry = nullptr; local
37 entry = &cache_[config.ordinal];
38 // Release the map lock; the address of 'entry' is stable because
42 // Acquire the per-Entry mutex without holding the map mutex. Initializing
45 mutex_lock lock{entry->configurations_mutex};
46 for (const auto& iter : entry->configurations) {
58 // If construction failed, leave the cache Entry around, but with a null
62 entry->configurations.emplace_back(config, std::move(result.ValueOrDie()))
68 Entry* entry = nullptr; local
    [all...]
  /external/v8/src/interpreter/
handler-table-builder.h 31 // Creates a new handler table entry and returns a {hander_id} identifying the
32 // entry, so that it can be referenced by below setter functions.
35 // Setter functions that modify certain values within the handler table entry
45 struct Entry {
54 ZoneVector<Entry> entries_;
  /external/v8/src/profiler/
circular-queue.h 43 // Reserved values for the entry marker.
50 struct V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry {
51 Entry() : marker(kEmpty) {}
56 Entry* Next(Entry* entry);
58 Entry buffer_[Length];
59 V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry* enqueue_pos_;
60 V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry* dequeue_pos_;
  /frameworks/base/libs/services/include/android/os/
DropBoxManager.h 50 // Create a new entry with plain text contents.
53 // Create a new Entry with byte array contents. Makes a copy of the data.
56 // Create a new Entry from a file. The file will be opened in this process
61 // Create a new Entry from an already opened file. Takes ownership of the
65 class Entry : public virtual RefBase, public Parcelable {
67 Entry();
68 virtual ~Entry();
79 Entry(const String16& tag, int32_t flags);
80 Entry(const String16& tag, int32_t flags, int fd);
92 // Get the next entry from the drop box after the specified time
    [all...]
  /frameworks/native/libs/binder/include/binder/
PermissionCache.h 44 struct Entry {
48 inline bool operator < (const Entry& e) const {
57 SortedVector< Entry > mCache;
  /packages/apps/Bluetooth/src/com/android/bluetooth/util/
Interop.java 30 * Simple interop entry consisting of a workarond id (see below)
34 private static class Entry {
38 Entry(int workaroundId, String address) {
47 private static List<Entry> sEntries = null;
65 sEntries = new ArrayList<Entry>();
68 sEntries.add(new Entry(INTEROP_MAP_ASCIIONLY, "00:26:e8"));
82 for (Entry entry : sEntries) {
83 if (entry.workaround_id == workaroundId && entry.address.startsWith
    [all...]
  /packages/apps/Gallery2/gallerycommon/src/com/android/gallery3d/common/
Entry.java 24 public abstract class Entry {
31 // The primary key of the entry.
  /packages/services/Car/procfs-inspector/server/
directory.h 32 class Entry {
34 Entry(std::string parent = "", std::string child = "");
54 Entry next(unsigned char type = DT_UNKNOWN);
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/
DWARFDebugLoc.h 24 struct Entry {
39 SmallVector<Entry, 2> Entries;
63 struct Entry {
71 SmallVector<Entry, 2> Entries;
DWARFDebugMacro.h 22 /// A single macro entry within a macro list.
23 struct Entry {
24 /// The type of the macro entry.
34 /// The string (name, value) of the macro entry.
43 typedef SmallVector<Entry, 4> MacroList;
DWARFDebugPubTable.h 26 struct Entry {
30 /// An entry of the various gnu_pub* debug sections.
59 std::vector<Entry> Entries;
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/
PredIteratorCache.h 44 BasicBlock **&Entry = BlockToPredsMap[BB];
45 if (Entry)
46 return Entry;
53 Entry = Memory.Allocate<BasicBlock *>(PredCache.size());
54 std::copy(PredCache.begin(), PredCache.end(), Entry);
55 return Entry;

Completed in 377 milliseconds

1 23 4 5 6 7 8 91011>>