| /external/llvm/test/CodeGen/X86/ |
| lsr-quadratic-expand.ll | 4 entry:
7 bb: ; preds = %bb, %entry
8 %z = phi i64 [ 0, %entry ], [ %z3, %bb ]
9 %z1 = phi i16 [ undef, %entry ], [ %z6, %bb ]
10 %z2 = phi i32 [ 0, %entry ], [ %z8, %bb ]
|
| /external/llvm/test/Transforms/IPConstantProp/ |
| global.ll | 6 entry:
11 if.then: ; preds = %entry
15 if.end: ; preds = %if.then, %entry
20 ; CHECK: entry:
23 entry:
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| 2003-12-10-RemoveInstrCrash.ll | 4 entry:
8 no_exit: ; preds = %no_exit, %entry
9 %j.0.pn = phi i32 [ %inc.3, %no_exit ], [ %inc.2, %entry ] ; <i32> [#uses=1]
10 %k.0.pn = phi i32 [ %inc.4, %no_exit ], [ 1, %entry ] ; <i32> [#uses=1]
15 loopexit: ; preds = %no_exit, %entry
|
| /external/llvm/test/Transforms/PlaceSafepoints/ |
| statepoint-frameescape.ll | 5 ; Do we insert the entry safepoint after the localescape intrinsic?
8 entry:
9 ; CHECK-LABEL: entry
23 ; CHECK-LABEL: entry
26 entry:
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| EntryTest.java | 35 Map.Entry e = new AbstractMap.SimpleEntry(k1, v1);
44 Map.Entry s = new AbstractMap.SimpleImmutableEntry(k1, v1);
50 * A new SimpleEntry(entry(k, v)) holds k, v.
53 Map.Entry e2 = new AbstractMap.SimpleEntry(k1, v1);
54 Map.Entry e = new AbstractMap.SimpleEntry(e2);
60 * A new SimpleImmutableEntry(entry(k, v)) holds k, v.
63 Map.Entry s2 = new AbstractMap.SimpleImmutableEntry(k1, v1);
64 Map.Entry s = new AbstractMap.SimpleImmutableEntry(s2);
74 Map.Entry e2 = new AbstractMap.SimpleEntry(k1, v1);
75 Map.Entry e = new AbstractMap.SimpleEntry(e2)
[all...] |
| /system/media/camera/docs/ |
| camera_metadata_tags.mako | 31 def annotated_type(entry):
32 if entry.enum:
35 type = entry.type
36 if entry.container == 'array':
78 % for idx,entry in enumerate(remove_synthetic(find_unique_entries(sec))):
80 ${entry.name + " = " | csym,ljust(50)}// ${annotated_type(entry) | ljust(12)} | ${entry.applied_visibility}
81 ${path_name(find_parent_section(entry)) | csym}_START,
83 ${entry.name + "," | csym,ljust(50)}// ${annotated_type(entry) | ljust(12)} | ${entry.applied_visibility
[all...] |
| /bionic/libc/malloc_debug/ |
| MapData.cpp | 60 MapEntry* entry = new MapEntry(start, end, offset, name, name_len); local
63 entry->load_base = 0;
64 entry->load_base_read = true;
66 return entry;
70 static inline bool get_val(MapEntry* entry, uintptr_t addr, T* store) {
71 if (addr < entry->start || addr + sizeof(T) > entry->end) {
82 static void read_loadbase(MapEntry* entry) {
83 entry->load_base = 0;
84 entry->load_base_read = true
121 MapEntry* entry = parse_line(buffer.data()); local
160 MapEntry *entry = *it; local
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/onetimeinitializer/ |
| GalleryWidgetMigrator.java | 33 import com.android.gallery3d.gadget.WidgetDatabaseHelper.Entry;
82 List<Entry> entries = dbHelper.getEntries(WidgetDatabaseHelper.TYPE_ALBUM);
85 // Check each entry's relativePath. If exists, update bucket id using relative
89 HashMap<Integer, Entry> localEntries = new HashMap<Integer, Entry>(entries.size());
90 for (Entry entry : entries) {
91 Path path = Path.fromString(entry.albumPath);
94 if (entry.relativePath != null && entry.relativePath.length() > 0)
140 Entry entry = entries.remove(oldBucketId); local
[all...] |
| /system/security/keystore/ |
| auth_token_table.cpp | 53 Entry new_entry(auth_token, clock_function_());
56 LOG_W("Auth token table filled up; replacing oldest entry", 0);
111 entries_, [&](Entry& e) { return e.token()->challenge == op_handle && !e.completed(); });
127 Entry* newest_match = NULL;
128 for (auto& entry : entries_)
129 if (entry.SatisfiesAuth(sids, auth_type) && entry.is_newer_than(newest_match))
130 newest_match = &entry;
153 void AuthTokenTable::RemoveEntriesSupersededBy(const Entry& entry) {
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| 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...] |
| /external/llvm/test/CodeGen/Thumb/ |
| fpconv.ll | 4 entry:
10 entry:
16 entry:
22 entry:
28 entry:
34 entry:
40 entry:
46 entry:
52 entry:
58 entry
[all...] |
| /external/v8/src/interpreter/ |
| handler-table-builder.cc | 24 Entry& entry = entries_[i]; local
26 entry.will_catch ? HandlerTable::CAUGHT : HandlerTable::UNCAUGHT;
27 table->SetRangeStart(i, static_cast<int>(entry.offset_start));
28 table->SetRangeEnd(i, static_cast<int>(entry.offset_end));
29 table->SetRangeHandler(i, static_cast<int>(entry.offset_target), pred);
30 table->SetRangeData(i, entry.context.index());
38 Entry entry = {0, 0, 0, Register(), false}; local
39 entries_.push_back(entry);
[all...] |
| /external/v8/src/profiler/ |
| cpu-profiler-inl.h | 19 code_map->AddCode(start, entry, size);
29 CodeEntry* entry = code_map->FindEntry(start); local
30 if (entry != NULL) {
31 entry->set_bailout_reason(bailout_reason);
37 CodeEntry* entry = code_map->FindEntry(start); local
38 if (entry != NULL) entry->set_deopt_info(deopt_reason, position, deopt_id);
43 CodeEntry* entry = code_map->FindEntry(start); local
44 if (!entry) {
49 entry->SetBuiltinId(builtin_id)
[all...] |
| /packages/experimental/LoaderApp/src/com/android/loaderapp/fragments/ |
| ContactFragment.java | 234 public void onPrimaryAction(ViewEntry entry);
235 public void onSecondaryAction(ViewEntry entry);
245 public void onPrimaryAction(ViewEntry entry) {
246 Intent intent = entry.intent;
256 public void onSecondaryAction(ViewEntry entry) {
257 Intent intent = entry.secondaryIntent;
274 ViewEntry entry = ViewAdapter.getEntry(mSections, position, SHOW_SEPARATORS); local
275 if (entry != null) {
276 mController.onPrimaryAction(entry);
371 final ViewEntry entry = ViewEntry.fromValues(context, mimeType, kind local
552 final ViewEntry entry = new ViewEntry(); local
655 ViewEntry entry; field in class:ContactFragment.ViewCache
665 ViewEntry entry = getEntry(mSections, position, false); local
[all...] |
| /external/emma/core/java12/com/vladium/util/ |
| IntSet.java | 59 m_buckets = new Entry [initialCapacity];
85 final Entry [] buckets = m_buckets;
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
91 if (key == entry.m_key)
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next
[all...] |
| /external/llvm/test/CodeGen/PowerPC/ |
| fast-isel-cmp-imm.ll | 7 entry:
15 if.then: ; preds = %entry
19 if.end: ; preds = %if.then, %entry
26 entry:
34 if.then: ; preds = %entry
38 if.end: ; preds = %if.then, %entry
43 entry:
51 if.then: ; preds = %entry
55 if.end: ; preds = %if.then, %entry
60 entry
[all...] |
| /external/webrtc/webrtc/base/ |
| diskcache.cc | 100 Entry* entry = GetOrCreateEntry(id, true); local
101 if (LS_LOCKED == entry->lock_state)
103 if ((LS_UNLOCKED == entry->lock_state) && (entry->accessors > 0))
109 entry->lock_state = LS_LOCKED;
114 Entry* entry = GetOrCreateEntry(id, false); local
115 if (LS_LOCKED != entry->lock_state)
121 ASSERT(previous_size <= entry->size)
142 Entry* entry = GetOrCreateEntry(id, false); local
158 const Entry* entry = GetEntry(id); local
174 const Entry* entry = GetEntry(id); local
179 const Entry* entry = GetEntry(id); local
189 Entry* entry = GetOrCreateEntry(id, false); local
317 const Entry* entry = GetEntry(id); local
[all...] |
| /external/wpa_supplicant_8/wpa_supplicant/dbus/ |
| dbus_dict_helpers.c | 188 * Add a string entry to the dict.
208 * Add a boolean entry to the dict.
226 * Add a 16-bit signed integer entry to the dict.
245 * Add a 16-bit unsigned integer entry to the dict.
283 * Add a 32-bit unsigned integer entry to the dict.
302 * Add a DBus object path entry to the dict.
323 * Add a byte array entry to the dict.
346 * Begin an array entry in the dict
404 * Add a single string element to a string array dict entry
409 * @param elem The string element to be added to the dict entry's string arra
[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/mesa3d/src/glsl/ |
| glsl_symbol_table.cpp | 33 void *entry = ralloc_size(ctx, size); local
34 assert(entry != NULL);
35 return entry;
39 static void operator delete(void *entry)
41 ralloc_free(entry);
90 * the current scope, just update the existing entry to include 'v'.
97 /* If not declared at this scope, add a new entry. But if an existing
98 * entry includes a function, propagate that to this block - otherwise
101 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(v); local
103 entry->f = existing->f
113 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(v); local
119 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(t); local
133 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(f); local
139 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(u); local
145 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(f); local
153 symbol_table_entry *entry = get_entry(name); local
159 symbol_table_entry *entry = get_entry(name); local
165 symbol_table_entry *entry = get_entry(name); local
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| SimpleImmutableEntryTest.java | 26 import java.util.Map.Entry;
35 static class NullEntry implements Entry {
53 Entry entryToPut = (Entry) map.entrySet().iterator().next();
54 Entry testEntry = new AbstractMap.SimpleImmutableEntry(entryToPut);
72 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test"); local
73 assertEquals(1, entry.getKey());
74 entry = new AbstractMap.SimpleImmutableEntry(null, null);
75 assertNull(entry.getKey())
79 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test"); local
86 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test"); local
104 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test"); local
[all...] |
| /art/runtime/jdwp/ |
| object_registry.cc | 91 ObjectRegistryEntry* entry = nullptr; local
92 if (ContainsLocked(soa.Self(), obj_h.Get(), identity_hash_code, &entry)) {
94 ++entry->reference_count;
96 entry = new ObjectRegistryEntry;
97 entry->jni_reference_type = JNIWeakGlobalRefType;
98 entry->jni_reference = nullptr;
99 entry->reference_count = 0;
100 entry->id = 0;
101 entry->identity_hash_code = identity_hash_code;
102 object_to_entry_.insert(std::make_pair(identity_hash_code, entry));
126 ObjectRegistryEntry* entry = it->second; local
157 const ObjectRegistryEntry* entry = pair.second; local
178 ObjectRegistryEntry& entry = *it->second; local
191 ObjectRegistryEntry& entry = *it->second; local
238 ObjectRegistryEntry& entry = *it->second; local
254 ObjectRegistryEntry* entry = it->second; local
[all...] |
| /external/dbus/dbus/ |
| dbus-hash.c | 138 * @brief Internal representation of a hash entry.
140 * A single entry (key-value pair) in the hash table.
145 DBusHashEntry *next; /**< Pointer to next entry in this
154 * Function used to find and optionally create a hash entry.
172 * element points to first entry in
214 DBusHashTable *table; /**< Pointer to table containing entry. */
216 * first entry in this entry's chain:
217 * used for deleting the entry.
219 DBusHashEntry *entry; /**< Current hash entry * member in struct:__anon8731
386 DBusHashEntry *entry; local
431 DBusHashEntry *entry; local
746 DBusHashEntry *entry; local
805 DBusHashEntry *entry; local
855 DBusHashEntry *entry; local
927 DBusHashEntry *entry; local
1052 DBusHashEntry *entry; local
1077 DBusHashEntry *entry; local
1102 DBusHashEntry *entry; local
1126 DBusHashEntry *entry; local
1154 DBusHashEntry *entry; local
1182 DBusHashEntry *entry; local
1252 DBusHashEntry *entry; local
1293 DBusHashEntry *entry; local
1324 DBusHashEntry *entry; local
1342 DBusHashEntry *entry; local
1371 DBusHashEntry *entry; local
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/piff/ |
| TfrfBox.java | 38 public List<Entry> entries = new ArrayList<Entry>();
60 for (Entry entry : entries) {
62 IsoTypeWriter.writeUInt64(byteBuffer, entry.fragmentAbsoluteTime);
63 IsoTypeWriter.writeUInt64(byteBuffer, entry.fragmentAbsoluteDuration);
65 IsoTypeWriter.writeUInt32(byteBuffer, entry.fragmentAbsoluteTime);
66 IsoTypeWriter.writeUInt32(byteBuffer, entry.fragmentAbsoluteDuration);
77 Entry entry = new Entry(); local
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue103/ |
| FakeMap.java | 33 class FakeEntry implements java.util.Map.Entry<K, V> {
59 ArrayList<java.util.Map.Entry<K, V>> entries = new ArrayList<Map.Entry<K, V>>();
66 for (java.util.Map.Entry<K, V> entry : entries) {
67 if (entry.getKey().equals(arg0))
74 for (java.util.Map.Entry<K, V> entry : entries) {
75 if (entry.getValue().equals(arg0))
81 public Set<java.util.Map.Entry<K, V>> entrySet()
112 java.util.Map.Entry<K, V> entry = iter.next(); local
[all...] |
