| /external/swiftshader/third_party/llvm-7.0/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugMacro.cpp | 21 for (const Entry &E : Macros) {
59 // A macro list entry consists of:
60 Entry E;
72 // Push the corrupted entry to the list and halt parsing.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-mca/ |
| RegisterFile.h | 54 // one entry. Entry at index #0 is reserved. That entry describes a register
94 // This map contains one entry for each register defined by the target.
117 void allocatePhysRegs(const RegisterRenamingInfo &Entry,
122 void freePhysRegs(const RegisterRenamingInfo &Entry,
|
| /external/v8/src/ |
| address-map.h | 22 typedef base::TemplateHashMapEntry<uintptr_t, uint32_t> Entry;
31 Entry* entry = Lookup(key, Hash(key)); local
32 if (entry == nullptr) return Nothing<uint32_t>();
33 return Just(entry->value);
|
| /external/v8/src/compiler/ |
| node-cache.h | 37 // location in this cache that stores an entry for the key. If the location
40 // node. Otherwise it is the responsibility of the caller to fill the entry
42 // Note that a previous cache entry may be overwritten if the cache becomes
50 struct Entry;
52 Entry* entries_; // lazily-allocated hash entries.
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Library/DxeSmmPerformanceLib/ |
| DxeSmmPerformanceLib.c | 273 Attempts to retrieve a performance measurement log entry from the performance measurement log.
277 Attempts to retrieve the performance log entry specified by LogEntryKey. If LogEntryKey is
278 zero on entry, then an attempt is made to retrieve the first entry from the performance log,
279 and the key for the second entry in the log is returned. If the performance log is empty,
280 then no entry is retrieved and zero is returned. If LogEntryKey is not zero, then the performance
281 log entry associated with LogEntryKey is retrieved, and the key for the next entry in the log is
282 returned. If LogEntryKey is the key for the last entry in the log, then the last log entry is
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ConcurrentHashMultiset.java | 64 * the entry from the Map. If another operation sees a zero in the map, it knows that the entry is
108 * <p>If this {@link MapMaker} is configured to use entry eviction of any kind, this eviction
111 * stored in the map, so {@link MapMaker#expireAfterAccess} makes sense (evict the entry that
191 for (Multiset.Entry<E> entry : entrySet()) {
192 E element = entry.getElement();
193 for (int i = entry.getCount(); i > 0; i--) {
292 // Just CASed to 0; remove the entry to clean up the map. If the removal fails,
333 // Just CASed to 0; remove the entry to clean up the map. If the removal fails
[all...] |
| RegularImmutableBiMap.java | 53 * <p>This allows reuse of the entry objects from the array in the actual implementation.
65 TerminalEntry<K, V> entry = (TerminalEntry<K, V>) entriesToAdd[i]; local
66 K key = entry.getKey();
67 V value = entry.getValue();
77 checkNoConflict(!key.equals(keyEntry.getKey()), "key", entry, keyEntry);
82 checkNoConflict(!value.equals(valueEntry.getValue()), "value", entry, valueEntry);
86 ? entry
87 : new NonTerminalBiMapEntry<K, V>(entry, nextInKeyBucket, nextInValueBucket);
103 RegularImmutableBiMap(Entry<?, ?>[] entriesToAdd) {
114 Entry<K, V> entry = (Entry<K, V>) entriesToAdd[i] local
[all...] |
| ImmutableMultimap.java | 34 import java.util.Map.Entry;
74 * Returns an immutable multimap containing a single entry.
175 * Adds an entry to the built multimap.
179 public Builder<K, V> put(Entry<? extends K, ? extends V> entry) {
180 return put(entry.getKey(), entry.getValue());
193 "null key in entry: null=" + Iterables.toString(values));
223 for (Entry<? extends K, ? extends Collection<? extends V>> entry
523 Entry<?, ?> entry = (Entry<?, ?>) object; local
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SynchronizedNavigableMapTest.java | 34 import java.util.Map.Entry;
56 private final Entry<K, V> delegate;
59 TestEntry(Entry<K, V> delegate, Object mutex) {
64 @Override protected Entry<K, V> delegate() {
107 @Override public Entry<K, V> ceilingEntry(K key) {
127 @Override public Entry<K, V> firstEntry() {
132 @Override public Entry<K, V> floorEntry(K key) {
151 @Override public Entry<K, V> higherEntry(K key) {
161 @Override public Entry<K, V> lastEntry() {
166 @Override public Entry<K, V> lowerEntry(K key)
[all...] |
| LinkedListMultimapTest.java | 50 import java.util.Map.Entry;
67 protected ListMultimap<String, String> create(Entry<String, String>[] entries) {
69 for (Entry<String, String> entry : entries) {
70 multimap.put(entry.getKey(), entry.getValue());
281 Iterator<Map.Entry<String, Integer>> entries = map.entries().iterator();
282 Map.Entry<String, Integer> entry = entries.next(); local
283 assertEquals("bar", entry.getKey())
304 Map.Entry<String, Collection<Integer>> entry = entries.next(); local
[all...] |
| SimpleAbstractMultisetTest.java | 110 Iterator<Entry<E>> entryIterator() {
111 final Iterator<Map.Entry<E, Integer>> backingEntries = backingMap.entrySet().iterator();
112 return new UnmodifiableIterator<Multiset.Entry<E>>() {
119 public Multiset.Entry<E> next() {
120 final Map.Entry<E, Integer> mapEntry = backingEntries.next();
|
| /external/llvm/lib/CodeGen/ |
| MachineModuleInfo.cpp | 97 AddrLabelSymEntry &Entry = AddrLabelSymbols[BB];
99 // If we already had an entry for this block, just return it.
100 if (!Entry.Symbols.empty()) {
101 assert(BB->getParent() == Entry.Fn && "Parent changed");
102 return Entry.Symbols;
105 // Otherwise, this is a new entry, create a new symbol for it and add an
106 // entry to BBCallbacks so we can be notified if the BB is deleted or RAUWd.
109 Entry.Index = BBCallbacks.size() - 1;
110 Entry.Fn = BB->getParent();
111 Entry.Symbols.push_back(Context.createTempSymbol())
[all...] |
| /cts/tools/cts-api-coverage/src/com/android/cts/apicoverage/ |
| TestSuiteContentReport.java | 125 private static FileMetadata parseFileMetadata(Entry.Builder fEntry, File file)
128 fEntry.setType(Entry.EntryType.CONFIG);
131 fEntry.setType(Entry.EntryType.APK);
133 fEntry.setType(Entry.EntryType.JAR);
135 fEntry.setType(Entry.EntryType.SO);
138 fEntry.setType(Entry.EntryType.FILE);
189 ZipEntry entry = entries.nextElement(); local
191 if (entry.getName().endsWith(KNOWN_FAILURES_XML_FILE)) {
195 InputStream xmlStream = zip.getInputStream(entry);
207 private static Entry.Builder parseFolder(TestSuiteContent.Builder testSuiteContent, String fPath, String rPath
[all...] |
| /developers/build/prebuilts/gradle/DisplayingBitmaps/Application/src/main/java/com/example/android/displayingbitmaps/util/ |
| DiskLruCache.java | 59 * entry has a string key and a fixed number of values. Values are byte
75 * <p>Clients call {@link #edit} to create or update the values of an entry. An
76 * entry may have only one editor at one time; if a value is not available to be
79 * <li>When an entry is being <strong>created</strong> it is necessary to
82 * <li>When an entry is being <strong>edited</strong>, it is not necessary
90 * <p>Clients call {@link #get} to read a snapshot of an entry. The read will
136 * cache entry. Each line contains space-separated values: a state, a key,
138 * o DIRTY lines track that an entry is actively being created or updated.
142 * o CLEAN lines track a cache entry that has been successfully published
162 private final LinkedHashMap<String, Entry> lruEntrie
380 Entry entry = lruEntries.get(key); local
406 Entry entry = i.next(); local
476 Entry entry = lruEntries.get(key); local
520 Entry entry = lruEntries.get(key); local
566 Entry entry = editor.entry; local
634 Entry entry = lruEntries.get(key); local
775 private final Entry entry; field in class:DiskLruCache.Editor
[all...] |
| /developers/samples/android/ui/graphics/DisplayingBitmaps/Application/src/main/java/com/example/android/displayingbitmaps/util/ |
| DiskLruCache.java | 59 * entry has a string key and a fixed number of values. Values are byte
75 * <p>Clients call {@link #edit} to create or update the values of an entry. An
76 * entry may have only one editor at one time; if a value is not available to be
79 * <li>When an entry is being <strong>created</strong> it is necessary to
82 * <li>When an entry is being <strong>edited</strong>, it is not necessary
90 * <p>Clients call {@link #get} to read a snapshot of an entry. The read will
136 * cache entry. Each line contains space-separated values: a state, a key,
138 * o DIRTY lines track that an entry is actively being created or updated.
142 * o CLEAN lines track a cache entry that has been successfully published
162 private final LinkedHashMap<String, Entry> lruEntrie
380 Entry entry = lruEntries.get(key); local
406 Entry entry = i.next(); local
476 Entry entry = lruEntries.get(key); local
520 Entry entry = lruEntries.get(key); local
566 Entry entry = editor.entry; local
634 Entry entry = lruEntries.get(key); local
775 private final Entry entry; field in class:DiskLruCache.Editor
[all...] |
| /development/samples/browseable/DisplayingBitmaps/src/com.example.android.displayingbitmaps/util/ |
| DiskLruCache.java | 59 * entry has a string key and a fixed number of values. Values are byte
75 * <p>Clients call {@link #edit} to create or update the values of an entry. An
76 * entry may have only one editor at one time; if a value is not available to be
79 * <li>When an entry is being <strong>created</strong> it is necessary to
82 * <li>When an entry is being <strong>edited</strong>, it is not necessary
90 * <p>Clients call {@link #get} to read a snapshot of an entry. The read will
136 * cache entry. Each line contains space-separated values: a state, a key,
138 * o DIRTY lines track that an entry is actively being created or updated.
142 * o CLEAN lines track a cache entry that has been successfully published
162 private final LinkedHashMap<String, Entry> lruEntrie
380 Entry entry = lruEntries.get(key); local
406 Entry entry = i.next(); local
476 Entry entry = lruEntries.get(key); local
520 Entry entry = lruEntries.get(key); local
566 Entry entry = editor.entry; local
634 Entry entry = lruEntries.get(key); local
775 private final Entry entry; field in class:DiskLruCache.Editor
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| MicrosphereInterpolatingFunction.java | 73 private Map.Entry<RealVector, Double> brightestSample;
105 final Map.Entry<RealVector, Double> sample) {
124 Map.Entry<RealVector, Double> sample() {
198 for (Map.Entry<RealVector, Double> sd : samples.entrySet()) {
222 final Map.Entry<RealVector, Double> sd = md.sample();
|
| /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/ |
| TestBcp47Numbers.java | 5 import java.util.Map.Entry;
64 for (Entry<String, String> entry : info.getSupplementalDataInfo()
66 if (!entry.getKey().equals("nu")) {
70 entry.getKey(), entry.getValue()));
71 typeDescription.put(entry.getValue(), description);
76 for (Entry<String, String> entry : typeDescription.entrySet()) {
77 missing.remove(entry.getKey())
[all...] |
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| ChainedMap.java | 10 import java.util.Map.Entry;
21 public static class M3<K2, K1, V> extends ChainedMap implements Iterable<Map.Entry<K2, Map<K1, V>>> {
49 public Iterator<Entry<K2, Map<K1, V>>> iterator() {
50 return (Iterator<Entry<K2, Map<K1, V>>>) super.iterator();
56 for (Entry<Object, Object> entry0 : super.mapBase.entrySet()) {
57 for (Entry<Object, Object> entry1 : ((Map<Object, Object>) entry0.getValue()).entrySet()) {
71 public static class M4<K3, K2, K1, V> extends ChainedMap implements Iterable<Map.Entry<K3, Map<K2, Map<K1, V>>>> {
98 public Iterator<Entry<K3, Map<K2, Map<K1, V>>>> iterator() {
99 return (Iterator<Entry<K3, Map<K2, Map<K1, V>>>>) super.iterator();
105 for (Entry<Object, Object> entry0 : super.mapBase.entrySet())
[all...] |
| DictionaryStringByteConverter.java | 12 import java.util.Map.Entry;
37 for (Iterator<Entry<CharSequence, String>> m = dictionary.getMapping(); m.hasNext();) {
38 Entry<CharSequence, String> entry = m.next(); local
40 int bytesPerChar = entry.getValue().length() * byteMaker.getMaxBytesPerChar(); // all bytes are generated
118 for (Iterator<Entry<CharSequence, String>> m = dictionary.getMapping(); m.hasNext();) {
119 Entry<CharSequence, String> entry = m.next(); local
120 if (entry.getValue().length() != 0) {
121 if (!back.containsKey(entry.getValue())) {// may lose inf
[all...] |
| /external/glide/third_party/disklrucache/src/main/java/com/bumptech/glide/disklrucache/ |
| DiskLruCache.java | 43 * entry has a string key and a fixed number of values. Each key must match
60 * <p>Clients call {@link #edit} to create or update the values of an entry. An
61 * entry may have only one editor at one time; if a value is not available to be
64 * <li>When an entry is being <strong>created</strong> it is necessary to
67 * <li>When an entry is being <strong>edited</strong>, it is not necessary
75 * <p>Clients call {@link #get} to read a snapshot of an entry. The read will
119 * cache entry. Each line contains space-separated values: a state, a key,
121 * o DIRTY lines track that an entry is actively being created or updated.
125 * o CLEAN lines track a cache entry that has been successfully published
146 private final LinkedHashMap<String, Entry> lruEntries
300 Entry entry = lruEntries.get(key); local
327 Entry entry = i.next(); local
408 Entry entry = lruEntries.get(key); local
446 Entry entry = lruEntries.get(key); local
502 Entry entry = editor.entry; local
582 Entry entry = lruEntries.get(key); local
706 private final Entry entry; field in class:DiskLruCache.Editor
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| ListMultimapTestSuiteBuilder.java | 36 import java.util.Map.Entry;
69 OneSizeTestContainerGenerator<ListMultimap<K, V>, Entry<K, V>>> parentBuilder) {
81 OneSizeTestContainerGenerator<ListMultimap<K, V>, Entry<K, V>>> parentBuilder) {
112 OneSizeTestContainerGenerator<ListMultimap<K, V>, Entry<K, V>> multimapGenerator) {
127 OneSizeTestContainerGenerator<ListMultimap<K, V>, Entry<K, V>> multimapGenerator) {
|
| /external/llvm/test/MC/ARM/ |
| eh-directive-unwind_raw.s | 61 @ CHECK: Entry {
69 @ CHECK: Entry {
78 @ CHECK: Entry {
90 @ CHECK: Entry {
98 @ CHECK: Entry {
|
| /external/oauth/core/src/main/java/net/oauth/http/ |
| HttpMessage.java | 58 public final List<Map.Entry<String, String>> headers = new ArrayList<Map.Entry<String, String>>();
68 for (Map.Entry<String, String> header : headers) {
85 for (Iterator<Map.Entry<String, String>> i = headers.iterator(); i.hasNext();) {
86 Map.Entry<String, String> header = i.next();
146 /** The name of a dump entry whose value is the HTTP request. */
149 /** The name of a dump entry whose value is the HTTP response. */
|
| /external/protobuf/java/core/src/test/java/com/google/protobuf/ |
| SmallSortedMapTest.java | 50 private static class SimpleEntry<K, V> implements Map.Entry<K, V> {
82 if (!(o instanceof Map.Entry))
84 Map.Entry e = (Map.Entry) o;
219 Map.Entry<Integer, Integer> entry = map.getArrayEntryAt(i); local
220 assertEquals(new Integer(i), entry.getKey());
221 assertEquals(new Integer(i + 1), entry.getValue());
223 Iterator<Map.Entry<Integer, Integer>> it =
227 Map.Entry<Integer, Integer> entry = it.next() local
252 Map.Entry<Integer, Integer> entry = local
272 Map.Entry<Integer, Integer> entry = local
303 Map.Entry<Integer, Integer> entry = it.next(); local
332 Map.Entry<Integer, Integer> entry = it.next(); local
384 Map.Entry<Integer, Integer> entry = it.next(); local
[all...] |
