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

1234567891011>>

/external/google-breakpad/src/common/
H A Dsimple_string_dictionary.cc38 // property to ensure that Entry remains POD.
40 NonAllocatingMap<1, 1, 1>::Entry Compile_Assert__entry_must_be_pod;
/external/v8/src/profiler/
H A Dcircular-queue.h50 struct V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry {
51 Entry() : marker(kEmpty) {} function
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/shaders/gradients/
H A DSkGradientBitmapCache.h26 struct Entry;
27 mutable Entry* fHead;
28 mutable Entry* fTail;
30 inline Entry* release(Entry*) const;
31 inline void attachToHead(Entry*) const;
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DTestStringMapGenerator.java23 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[lengt
61 create( Entry<String, String>[] entries) argument
[all...]
H A DTestMapEntrySetGenerator.java32 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<
[all...]
H A DTestEnumMapGenerator.java25 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[lengt
60 create( Entry<AnEnum, String>[] entries) argument
[all...]
H A DTestSortedMapGenerator.java38 Map.Entry<K, V> belowSamplesLesser();
44 Map.Entry<K, V> belowSamplesGreater();
50 Map.Entry<K, V> aboveSamplesLesser();
56 Map.Entry<K, V> aboveSamplesGreater();
/external/javassist/src/main/javassist/bytecode/analysis/
H A DIntQueue.java20 private static class Entry { class in class:IntQueue
21 private IntQueue.Entry next;
23 private Entry(int value) { method in class:IntQueue.Entry
27 private IntQueue.Entry head;
29 private IntQueue.Entry tail;
32 IntQueue.Entry entry = new Entry(value);
/external/llvm/include/llvm/Target/
H A DCostTable.h23 /// Cost Table Entry
34 [=](const CostTblEntry &Entry) {
35 return ISD == Entry.ISD && Ty == Entry.Type; });
57 [=](const TypeConversionCostTblEntry &Entry) {
58 return ISD == Entry.ISD && Src == Entry.Src &&
59 Dst == Entry.Dst;
/external/syslinux/efi32/include/efi/
H A Defilink.h60 // PLIST_ENTRY Entry
64 #define _RemoveEntryList(Entry) { \
66 _Flink = (Entry)->Flink; \
67 _Blink = (Entry)->Blink; \
73 #define RemoveEntryList(Entry) \
74 _RemoveEntryList(Entry); \
75 (Entry)->Flink = (LIST_ENTRY *) BAD_POINTER; \
76 (Entry)->Blink = (LIST_ENTRY *) BAD_POINTER;
78 #define RemoveEntryList(Entry) \
79 _RemoveEntryList(Entry);
[all...]
/external/syslinux/efi64/include/efi/
H A Defilink.h60 // PLIST_ENTRY Entry
64 #define _RemoveEntryList(Entry) { \
66 _Flink = (Entry)->Flink; \
67 _Blink = (Entry)->Blink; \
73 #define RemoveEntryList(Entry) \
74 _RemoveEntryList(Entry); \
75 (Entry)->Flink = (LIST_ENTRY *) BAD_POINTER; \
76 (Entry)->Blink = (LIST_ENTRY *) BAD_POINTER;
78 #define RemoveEntryList(Entry) \
79 _RemoveEntryList(Entry);
[all...]
/external/syslinux/gnu-efi/gnu-efi-3.0/inc/
H A Defilink.h60 // PLIST_ENTRY Entry
64 #define _RemoveEntryList(Entry) { \
66 _Flink = (Entry)->Flink; \
67 _Blink = (Entry)->Blink; \
73 #define RemoveEntryList(Entry) \
74 _RemoveEntryList(Entry); \
75 (Entry)->Flink = (LIST_ENTRY *) BAD_POINTER; \
76 (Entry)->Blink = (LIST_ENTRY *) BAD_POINTER;
78 #define RemoveEntryList(Entry) \
79 _RemoveEntryList(Entry);
[all...]
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfStringPool.cpp26 auto &Entry = I.first->second; local
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) &&
58 Asm.OutStreamer->EmitLabel(Entry->getValue().Symbol);
62 Twine(Entry->getValue().Offset));
64 StringRef(Entry
[all...]
/external/skia/src/core/
H A DSkLRUCache.h21 struct Entry { struct in class:SkLRUCache
22 Entry(const K& key, V&& value) function in struct:SkLRUCache::Entry
29 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Entry);
37 Entry* node = fLRU.head();
46 Entry** value = fMap.find(key);
50 Entry* entry = *value;
59 Entry* entry = new Entry(key, std::move(value));
74 typename SkTInternalLList<Entry>::Iter iter;
75 for (Entry*
[all...]
/external/swiftshader/third_party/LLVM/include/llvm/Support/
H A DPredIteratorCache.h43 BasicBlock **&Entry = BlockToPredsMap[BB]; local
44 if (Entry) return Entry;
51 Entry = Memory.Allocate<BasicBlock*>(PredCache.size());
52 std::copy(PredCache.begin(), PredCache.end(), Entry);
53 return Entry;
/external/clang/test/CodeGen/
H A Dpointer-signext.c26 MEMORY_MAP *Entry; local
30 Entry = CR (Link, MEMORY_MAP, Link);
31 return (int) Entry->Signature;
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/
H A DTestStringBiMapGenerator.java26 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[lengt
65 create( Entry<String, String>[] entries) argument
[all...]
H A DTestStringListMultimapGenerator.java27 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[lengt
76 create( Entry<String, String>[] entries) argument
[all...]
H A DTestStringSetMultimapGenerator.java26 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[lengt
75 create( Entry<String, String>[] entries) argument
[all...]
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/
H A DSortIndex.java30 private class Entry implements Comparable<Entry> { class in class:SortIndex
36 Entry(final int idx, final T item) { method in class:SortIndex.Entry
41 public int compareTo(final Entry o) {
47 private final List<Entry> list = new ArrayList<Entry>();
71 final Entry entry = new Entry(idx++, i);
79 for (final Entry e : this.list) {
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/
H A DProgressiveDownloadInformationBox.java15 List<Entry> entries = Collections.emptyList();
29 for (Entry entry : entries) {
35 public List<Entry> getEntries() {
39 public void setEntries(List<Entry> entries) {
46 entries = new LinkedList<Entry>();
48 Entry entry = new Entry(IsoTypeReader.readUInt32(content), IsoTypeReader.readUInt32(content));
54 public static class Entry { class in class:ProgressiveDownloadInformationBox
58 public Entry(long rate, long initialDelay) { method in class:ProgressiveDownloadInformationBox.Entry
81 return "Entry{"
[all...]
/external/emma/core/java12/com/vladium/util/
H A DIntObjectMap.java61 m_buckets = new Entry [initialCapacity];
87 final Entry [] buckets = m_buckets;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
112 final Entry [] buckets = m_buckets;
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
156 Entry currentKeyEntry = null;
164 Entry [] buckets = m_buckets;
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
191 final Entry bucketListHea
222 private static final class Entry implements Serializable class in class:IntObjectMap
224 Entry (final int key, final Object value, final Entry next) method in class:IntObjectMap.Entry
[all...]
H A DIntSet.java59 m_buckets = new Entry [initialCapacity];
85 final Entry [] buckets = m_buckets;
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
137 Entry currentKeyEntry = null;
145 Entry [] buckets = m_buckets;
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
163 final Entry bucketListHead = buckets [bucketIndex];
164 final Entry newEntr
196 private static final class Entry class in class:IntSet
198 Entry (final int key, final Entry next) method in class:IntSet.Entry
[all...]
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/
H A DDivideTimeScaleTrack.java43 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() {
47 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() {
55 public List<SampleDependencyTypeBox.Entry> getSampleDependencies() {
90 List<CompositionTimeToSample.Entry> adjustCtts() {
91 List<CompositionTimeToSample.Entry> origCtts = this.source.getCompositionTimeEntries();
93 List<CompositionTimeToSample.Entry> entries2 = new ArrayList<CompositionTimeToSample.Entry>(origCtts.size());
94 for (CompositionTimeToSample.Entry entry : origCtts) {
95 entries2.add(new CompositionTimeToSample.Entry(entry.getCount(), entry.getOffset() / timeScaleDivisor));
103 List<TimeToSampleBox.Entry> adjustTt
[all...]
H A DMultiplyTimeScaleTrack.java49 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() {
53 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() {
61 public List<SampleDependencyTypeBox.Entry> getSampleDependencies() {
96 static List<CompositionTimeToSample.Entry> adjustCtts(List<CompositionTimeToSample.Entry> source, int timeScaleFactor) {
98 List<CompositionTimeToSample.Entry> entries2 = new ArrayList<CompositionTimeToSample.Entry>(source.size());
99 for (CompositionTimeToSample.Entry entry : source) {
100 entries2.add(new CompositionTimeToSample.Entry(entry.getCount(), timeScaleFactor * entry.getOffset()));
108 static List<TimeToSampleBox.Entry> adjustTt
[all...]

Completed in 714 milliseconds

1234567891011>>