/external/tensorflow/tensorflow/stream_executor/ |
executor_cache.h | 54 // Each Entry contains zero or more cached executors for a device ordinal. 55 struct Entry { 56 ~Entry(); 58 // Mutex that locks the contents of each entry. The 'mutex_' of the 60 // Entry, but not the Entry's contents. 'configurations_mutex' protects the 61 // contents of the entry after 'mutex_' has been dropped. 74 std::map<int, Entry> cache_ GUARDED_BY(mutex_);
|
/frameworks/base/core/java/com/android/internal/os/ |
KernelWakelockStats.java | 23 public class KernelWakelockStats extends HashMap<String, KernelWakelockStats.Entry> { 24 public static class Entry { 29 Entry(int count, long totalTime, int version) {
|
/frameworks/base/libs/hwui/ |
LayerUpdateQueue.h | 36 struct Entry { 37 Entry(RenderNode* renderNode, const Rect& damage) 46 const std::vector<Entry>& entries() const { return mEntries; } 49 std::vector<Entry> mEntries;
|
/packages/services/Car/procfs-inspector/server/ |
directory.cpp | 28 bool procfsinspector::Directory::Entry::isEmpty() const { 32 procfsinspector::Directory::Entry::Entry(std::string parent, std::string child) : 41 std::string procfsinspector::Directory::Entry::str() { 45 uid_t procfsinspector::Directory::Entry::getOwnerUserId() { 50 // fill in stat info for this entry, or return invalid UID on failure 57 procfsinspector::Directory::Entry procfsinspector::Directory::next(unsigned char type) { 59 dirent *entry = readdir(dir); local 60 if (entry) { 62 // but always return UNKNOWN entries as it is an allowed wildcard entry [all...] |
/external/libmojo/mojo/edk/system/ |
handle_table.cc | 25 handles_.insert(std::make_pair(handle, Entry(std::move(dispatcher)))); 46 std::make_pair(handle, Entry(dispatchers[i].dispatcher))); 121 for (const auto& entry : handles_) 122 handles->push_back(entry.first); 125 HandleTable::Entry::Entry() {} 127 HandleTable::Entry::Entry(scoped_refptr<Dispatcher> dispatcher) 130 HandleTable::Entry::Entry(const Entry& other) = default [all...] |
/external/skia/src/shaders/gradients/ |
SkGradientBitmapCache.cpp | 13 struct SkGradientBitmapCache::Entry { 14 Entry* fPrev; 15 Entry* fNext; 21 Entry(const void* buffer, size_t size, const SkBitmap& bm) 30 ~Entry() { sk_free(fBuffer); } 47 Entry* entry = fHead; local 48 while (entry) { 49 Entry* next = entry->fNext 87 Entry* entry = fHead; local 112 Entry* entry = new Entry(buffer, len, bm); local 134 Entry* entry = fHead; local [all...] |
/external/skqp/src/shaders/gradients/ |
SkGradientBitmapCache.cpp | 13 struct SkGradientBitmapCache::Entry { 14 Entry* fPrev; 15 Entry* fNext; 21 Entry(const void* buffer, size_t size, const SkBitmap& bm) 30 ~Entry() { sk_free(fBuffer); } 47 Entry* entry = fHead; local 48 while (entry) { 49 Entry* next = entry->fNext 87 Entry* entry = fHead; local 112 Entry* entry = new Entry(buffer, len, bm); local 134 Entry* entry = fHead; local [all...] |
/frameworks/compile/mclinker/include/mcld/Target/ |
GOT.h | 34 class Entry : public TargetFragment { 39 Entry(uint64_t pValue, SectionData* pParent) 42 virtual ~Entry() {}
|
PLT.h | 22 * \brief PLTEntryDefaultBase provides the default interface for PLT Entry 51 class Entry : public EntryBase { 56 explicit Entry(SectionData& pParent) : EntryBase(pParent) {} 58 virtual ~Entry() {}
|
/frameworks/base/libs/services/src/os/ |
DropBoxManager.cpp | 34 DropBoxManager::Entry::Entry() 44 DropBoxManager::Entry::Entry(const String16& tag, int32_t flags) 53 DropBoxManager::Entry::Entry(const String16& tag, int32_t flags, int fd) 62 DropBoxManager::Entry::~Entry() 67 DropBoxManager::Entry::writeToParcel(Parcel* out) const 105 DropBoxManager::Entry::readFromParcel(const Parcel* in [all...] |
/art/compiler/utils/arm/ |
jni_macro_assembler_arm_vixl.h | 161 // that can be used to avoid loading the handle scope entry to see if the value is 175 // src holds a handle scope entry (Object**) load this into dst. 213 vixl32::Label* Entry() { return &exception_entry_; }
|
/art/compiler/utils/arm64/ |
jni_macro_assembler_arm64.h | 143 // that can be used to avoid loading the handle scope entry to see if the value is 157 // src holds a handle scope entry (Object**) load this into dst. 189 vixl::aarch64::Label* Entry() { return &exception_entry_; }
|
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Framework/Protocol/SmmStandbyButtonDispatch/ |
SmmStandbyButtonDispatch.h | 47 Entry,
|
/device/linaro/bootloader/edk2/IntelFsp2Pkg/FspSecCore/ |
SecFsp.c | 30 UINT32 Entry;
38 Entry = (IdtGateDescriptor->Bits.OffsetHigh << 16) | IdtGateDescriptor->Bits.OffsetLow;
39 Entry = FspInfoHeader->ImageBase + FspInfoHeader->ImageSize - (~Entry + 1);
40 IdtGateDescriptor->Bits.OffsetHigh = (UINT16)(Entry >> 16);
41 IdtGateDescriptor->Bits.OffsetLow = (UINT16)Entry;
94 // This is the performance data for InitTempMemory API entry/exit
|
/device/linaro/bootloader/edk2/MdeModulePkg/Universal/Disk/RamDiskDxe/ |
RamDiskDriver.c | 2 The driver entry point for RamDiskDxe driver.
61 LIST_ENTRY *Entry;
101 EFI_LIST_FOR_EACH (Entry, &RegisteredRamDisks) {
102 PrivateData = RAM_DISK_PRIVATE_FROM_THIS (Entry);
109 The entry point for RamDiskDxe driver.
115 @retval EFI_OUT_OF_RESOURCES Fail to execute entry point due to lack of
|
/device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/Ip4Dxe/ |
Ip4Common.c | 76 LIST_ENTRY *Entry;
90 NET_LIST_FOR_EACH (Entry, &IpSb->Interfaces) {
91 IpIf = NET_LIST_USER_STRUCT (Entry, IP4_INTERFACE, Link);
142 LIST_ENTRY *Entry;
145 NET_LIST_FOR_EACH (Entry, &IpSb->Interfaces) {
146 IpIf = NET_LIST_USER_STRUCT (Entry, IP4_INTERFACE, Link);
172 LIST_ENTRY *Entry;
175 NET_LIST_FOR_EACH (Entry, &IpSb->Interfaces) {
176 IpIf = NET_LIST_USER_STRUCT (Entry, IP4_INTERFACE, Link);
204 LIST_ENTRY *Entry;
[all...] |
/device/linaro/bootloader/edk2/NetworkPkg/IpSecDxe/ |
IkePacket.c | 59 LIST_ENTRY *Entry;
84 for (Entry = (IkePacket)->PayloadList.ForwardLink; Entry != &(IkePacket)->PayloadList;) {
85 IkePayload = IKE_PAYLOAD_BY_PACKET (Entry);
86 Entry = Entry->ForwardLink;
196 LIST_ENTRY *Entry;
245 NET_LIST_FOR_EACH (Entry, &(IkePacket)->PayloadList) {
246 IkePayload = IKE_PAYLOAD_BY_PACKET (Entry);
|
IpSecMain.c | 66 LIST_ENTRY *Entry;
113 // Check the spd entry if the packet is accessible.
121 NET_LIST_FOR_EACH (Entry, SpdList) {
122 SpdEntry = IPSEC_SPD_ENTRY_FROM_LIST (Entry);
136 NET_LIST_FOR_EACH (Entry, SpdList) {
138 // For outbound and non-ipsec Inbound traffic: check the spd entry.
140 SpdEntry = IPSEC_SPD_ENTRY_FROM_LIST (Entry);
163 // For outbound traffic, lookup the sad entry.
178 // Process the packet by the found sad entry.
201 // although no sad entry associated with protect spd entry. [all...] |
/external/clang/lib/Analysis/ |
CFGStmtMap.cpp | 57 CFGBlock *&Entry = SM[CS->getStmt()]; 58 // If 'Entry' is already initialized (e.g., a terminator was already), 60 if (Entry) 63 Entry = B;
|
/external/clang/lib/Frontend/Rewrite/ |
HTMLPrint.cpp | 68 const FileEntry* Entry = R.getSourceMgr().getFileEntryForID(FID); 71 // there is no entry. Fall back to the memory buffer for a name in those 73 if (Entry) 74 Name = Entry->getName();
|
/external/clang/lib/Index/ |
SimpleFormatContext.h | 51 const FileEntry *Entry = Files.getFile(Name); 52 assert(Entry != nullptr); 53 return Sources.createFileID(Entry, SourceLocation(), SrcMgr::C_User);
|
/external/clang/tools/diagtool/ |
ListWarnings.cpp | 31 struct Entry { 35 Entry(llvm::StringRef diagN, llvm::StringRef flag) 38 bool operator<(const Entry &x) const { return DiagName < x.DiagName; } 42 static void printEntries(std::vector<Entry> &entries, llvm::raw_ostream &out) { 43 for (std::vector<Entry>::iterator it = entries.begin(), ei = entries.end(); 53 std::vector<Entry> Flagged, Unflagged; 69 Entry entry(di->getName(), 72 if (entry.Flag.empty()) 73 Unflagged.push_back(entry); [all...] |
/external/deqp/framework/common/ |
tcuFunctionLibrary.hpp | 54 struct Entry 60 StaticFunctionLibrary (const Entry* entries, int numEntries);
|
/external/dng_sdk/source/ |
dng_opcode_list.h | 94 dng_opcode & Entry (uint32 index) 102 const dng_opcode & Entry (uint32 index) const
|
/external/javassist/src/main/javassist/bytecode/analysis/ |
IntQueue.java | 20 private static class Entry { 21 private IntQueue.Entry next; 23 private Entry(int value) { 27 private IntQueue.Entry head; 29 private IntQueue.Entry tail; 32 IntQueue.Entry entry = new Entry(value); local 34 tail.next = entry; 35 tail = entry; [all...] |