| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-arm/ |
| thumb-entry.d | 2 Entry point address: 0x8001
|
| /external/google-breakpad/src/common/ |
| simple_string_dictionary.cc | 38 // property to ensure that Entry remains POD.
40 NonAllocatingMap<1, 1, 1>::Entry Compile_Assert__entry_must_be_pod;
|
| /frameworks/base/core/java/android/os/ |
| DropBoxManager.aidl | 19 parcelable DropBoxManager.Entry;
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-pe/ |
| tlssec32.d | 2 Entry 9 00003000 00000018 Thread Storage Directory \[\.tls\]
|
| tlssec64.d | 2 Entry 9 0000000000003000 00000028 Thread Storage Directory \[\.tls\]
|
| /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_;
|
| /external/skia/src/effects/gradients/ |
| SkGradientBitmapCache.h | 27 struct Entry;
28 mutable Entry* fHead;
29 mutable Entry* fTail;
31 inline Entry* detach(Entry*) const;
32 inline void attachToHead(Entry*) const;
|
| /frameworks/base/libs/hwui/ |
| LayerUpdateQueue.h | 34 struct Entry {
35 Entry(RenderNode* renderNode, const Rect& damage)
45 const std::vector<Entry>& entries() const { return mEntries; }
47 std::vector<Entry> mEntries;
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| TestStringMapGenerator.java | 23 import java.util.Map.Entry;
38 public SampleElements<Map.Entry<String, String>> samples() {
39 return new SampleElements<Map.Entry<String, String>>(
51 Entry<String, String>[] array = new Entry[entries.length];
55 Entry<String, String> e = (Entry<String, String>) o;
62 Entry<String, String>[] entries);
66 public final Entry<String, String>[] createArray(int length) {
67 return new Entry[length]
[all...] |
| TestMapEntrySetGenerator.java | 32 implements TestSetGenerator<Map.Entry<K, V>> {
43 public SampleElements<Map.Entry<K, V>> samples() {
48 public Set<Map.Entry<K, V>> create(Object... elements) {
49 Map.Entry<K, V>[] entries = createArray(elements.length);
54 public abstract Set<Map.Entry<K, V>> createFromEntries(
55 Map.Entry<K, V>[] entries);
59 public Map.Entry<K, V>[] createArray(int length) {
60 return new Map.Entry[length];
65 public List<Map.Entry<K, V>> order(List<Map.Entry<K, V>> insertionOrder)
[all...] |
| TestEnumMapGenerator.java | 25 import java.util.Map.Entry;
37 public SampleElements<Entry<AnEnum, String>> samples() {
38 return new SampleElements<Entry<AnEnum, String>>(
50 Entry<AnEnum, String>[] array = new Entry[entries.length];
54 Entry<AnEnum, String> e = (Entry<AnEnum, String>) o;
61 Entry<AnEnum, String>[] entries);
65 public final Entry<AnEnum, String>[] createArray(int length) {
66 return new Entry[length]
[all...] |
| /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) {
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ |
| cond_dealtor.hpp | 49 template<typename Entry, typename _Alloc>
52 typedef typename _Alloc::template rebind<Entry> __rebind_e;
78 template<typename Entry, class _Alloc>
79 typename cond_dealtor<Entry, _Alloc>::entry_allocator
80 cond_dealtor<Entry, _Alloc>::s_alloc;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ |
| cond_dealtor.hpp | 49 template<typename Entry, typename _Alloc>
52 typedef typename _Alloc::template rebind<Entry> __rebind_e;
78 template<typename Entry, class _Alloc>
79 typename cond_dealtor<Entry, _Alloc>::entry_allocator
80 cond_dealtor<Entry, _Alloc>::s_alloc;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/ |
| cond_dealtor.hpp | 49 template<typename Entry, typename _Alloc>
52 typedef typename _Alloc::template rebind<Entry> __rebind_e;
78 template<typename Entry, class _Alloc>
79 typename cond_dealtor<Entry, _Alloc>::entry_allocator
80 cond_dealtor<Entry, _Alloc>::s_alloc;
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/ |
| cond_dealtor.hpp | 49 template<typename Entry, typename _Alloc>
52 typedef typename _Alloc::template rebind<Entry> __rebind_e;
78 template<typename Entry, class _Alloc>
79 typename cond_dealtor<Entry, _Alloc>::entry_allocator
80 cond_dealtor<Entry, _Alloc>::s_alloc;
|
| /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...] |
| /external/llvm/include/llvm/Target/ |
| CostTable.h | 23 /// Cost Table Entry
34 [=](const CostTblEntry &Entry) {
35 return ISD == Entry.ISD && Ty == Entry.Type; });
39 // Could not find an entry.
57 [=](const TypeConversionCostTblEntry &Entry) {
58 return ISD == Entry.ISD && Src == Entry.Src &&
59 Dst == Entry.Dst;
64 // Could not find an entry
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfStringPool.cpp | 26 auto &Entry = I.first->second;
27 Entry.Index = Pool.size() - 1;
28 Entry.Offset = NumBytes;
29 Entry.Symbol = ShouldCreateSymbols ? Asm.createTempSymbol(Prefix) : nullptr;
32 assert(NumBytes > Entry.Offset && "Unexpected overflow");
52 for (const auto &Entry : Entries) {
53 assert(ShouldCreateSymbols == static_cast<bool>(Entry->getValue().Symbol) &&
54 "Mismatch between setting and entry");
58 Asm.OutStreamer->EmitLabel(Entry->getValue().Symbol);
62 Twine(Entry->getValue().Offset))
[all...] |
| /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;
|
| /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 public Entry(int workaround_id, String address) {
47 private static List<Entry> entries = null;
63 entries = new ArrayList<Entry>();
66 entries.add(new Entry(INTEROP_MAP_ASCIIONLY, "00:26:e8"));
78 for (Entry entry : entries) {
79 if (entry.workaround_id == workaround_id &&
80 entry.address.startsWith(address.toLowerCase()))
[all...] |
| /external/clang/test/CodeGen/ |
| pointer-signext.c | 26 MEMORY_MAP *Entry;
30 Entry = CR (Link, MEMORY_MAP, Link);
31 return (int) Entry->Signature;
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| TestStringBiMapGenerator.java | 26 import java.util.Map.Entry;
42 public SampleElements<Map.Entry<String, String>> samples() {
43 return new SampleElements<Map.Entry<String, String>>(
55 Entry<String, String>[] array = new Entry[entries.length];
59 Entry<String, String> e = (Entry<String, String>) o;
66 Entry<String, String>[] entries);
70 public final Entry<String, String>[] createArray(int length) {
71 return new Entry[length]
[all...] |
| TestStringListMultimapGenerator.java | 27 import java.util.Map.Entry;
39 public SampleElements<Map.Entry<String, String>> samples() {
40 return new SampleElements<Map.Entry<String, String>>(
66 Entry<String, String>[] array = new Entry[entries.length];
70 Entry<String, String> e = (Entry<String, String>) o;
77 Entry<String, String>[] entries);
81 public final Entry<String, String>[] createArray(int length) {
82 return new Entry[length]
[all...] |
| TestStringSetMultimapGenerator.java | 26 import java.util.Map.Entry;
38 public SampleElements<Map.Entry<String, String>> samples() {
39 return new SampleElements<Map.Entry<String, String>>(
65 Entry<String, String>[] array = new Entry[entries.length];
69 Entry<String, String> e = (Entry<String, String>) o;
76 Entry<String, String>[] entries);
80 public final Entry<String, String>[] createArray(int length) {
81 return new Entry[length]
[all...] |
