| /system/core/libcutils/ |
| D | hashmap.cpp | 26 typedef struct Entry Entry; typedef
27 struct Entry { struct
31 Entry* next; argument
35 Entry** buckets;
61 map->buckets = static_cast<Entry**>(calloc(map->bucketCount, sizeof(Entry*))); in hashmapCreate()
105 Entry** newBuckets = static_cast<Entry**>(calloc(newBucketCount, sizeof(Entry*))); in expandIfNecessary()
114 Entry* entry = map->buckets[i]; in expandIfNecessary()
116 Entry* next = entry->next; in expandIfNecessary()
142 Entry* entry = map->buckets[i]; in hashmapFree()
144 Entry* next = entry->next; in hashmapFree()
[all …]
|
| /system/security/keystore/ |
| D | auth_token_table.h | 106 class Entry {
108 Entry(HardwareAuthToken&& token, time_t current_time);
109 Entry(Entry&& entry) noexcept { *this = std::move(entry); } in Entry() function
111 void operator=(Entry&& rhs) noexcept {
118 bool operator<(const Entry& rhs) const { return last_use_ < rhs.last_use_; }
122 bool Supersedes(const Entry& entry) const;
125 bool is_newer_than(const Entry* entry) const { in is_newer_than()
161 void RemoveEntriesSupersededBy(const Entry& entry);
162 bool IsSupersededBySomeEntry(const Entry& entry);
169 std::vector<Entry> entries_;
|
| D | auth_token_table.cpp | 81 Entry new_entry(std::move(auth_token), clock_function_()); in AddAuthenticationToken()
139 entries_, [&](Entry& e) { return e.token().challenge == op_handle && !e.completed(); }); in FindAuthPerOpAuthorization()
152 Entry* newest_match = nullptr; in FindTimedAuthorization()
187 entries_, [&](Entry& e) { return e.token().challenge == challenge && !e.completed(); }); in FindAuthorizationForCredstore()
208 Entry* newest_match = nullptr; in FindAuthorizationForCredstore()
237 void AuthTokenTable::RemoveEntriesSupersededBy(const Entry& entry) { in RemoveEntriesSupersededBy()
238 entries_.erase(remove_if(entries_, [&](Entry& e) { return entry.Supersedes(e); }), in RemoveEntriesSupersededBy()
257 bool AuthTokenTable::IsSupersededBySomeEntry(const Entry& entry) { in IsSupersededBySomeEntry()
259 [&](Entry& e) { return e.Supersedes(entry); }); in IsSupersededBySomeEntry()
265 auto found = find_if(entries_, [&](Entry& e) { return e.token().challenge == op_handle; }); in MarkCompleted()
[all …]
|
| /system/core/libutils/include/utils/ |
| D | LruCache.h | 67 class Entry final : public KeyedEntry {
71 Entry* parent;
72 Entry* child;
74 … Entry(TKey _key, TValue _value) : key(_key), value(_value), parent(nullptr), child(nullptr) { in Entry() function
103 void attachToCache(Entry& entry);
104 void detachFromCache(Entry& entry);
114 Entry* mOldest;
115 Entry* mYoungest;
148 return reinterpret_cast<Entry *>(*mIterator)->value; in value()
197 Entry *entry = reinterpret_cast<Entry*>(*find_result); in get()
[all …]
|
| /system/timezone/input_tools/android/tzlookup_generator/src/main/java/com/android/libcore/timezone/tzlookup/zonetree/ |
| D | CountryZoneUsage.java | 28 private final Map<String, Entry> zoneIdEntryMap = new HashMap<>();
43 zoneIdEntryMap.put(zoneId, new Entry(zoneId, notUsedAfterInstant, notUsedReplacementId)); in addEntry()
51 Entry entry = zoneIdEntryMap.get(zoneId); in getNotUsedAfterInstant()
60 Entry entry = zoneIdEntryMap.get(zoneId); in getNotUsedReplacementId()
68 private static class Entry { class in CountryZoneUsage
73 Entry(String zoneId, Instant notUsedAfter, String notUsedReplacementId) { in Entry() method in CountryZoneUsage.Entry
|
| D | CountryZoneTree.java | 398 for (Map.Entry<ZonePeriodsKey, List<ZoneInfo>> newSetEntry : newSetsMap.entrySet()) { in growTree()
|
| /system/media/camera/docs/ |
| D | metadata_model_test.py | 16 entry1 = Entry(name="entry1", type="int32", kind="static",
18 entry2 = Entry(name="entry2", type="int32", kind="static",
20 entry3 = Entry(name="entry3", type="int32", kind="static",
62 entry1 = Entry(name="entry1", type="int32", kind="static",
64 entry2 = Entry(name="entry2", type="int32", kind="static",
96 entry1 = Entry(name="entry1", type="int32", kind="static",
98 entry2 = Entry(name="entry2", type="int32", kind="static",
100 entry3 = Entry(name="entry3", type="int32", kind="static",
|
| D | html.mako | 56 /* Entry flair */
60 /* Entry type flair */
76 /* Entry tags flair */
79 /* Entry details (full docs) flair */
83 /* Entry spacer flair */
|
| D | ACameraMetadata.mako | 22 …% if section.find_first(lambda x: isinstance(x, metadata_model.Entry) and x.kind == kind_name) and…
|
| D | metadata_model.py | 302 e = Entry(**entry)
1093 class Entry(Node): class
1512 class Clone(Entry):
1594 class MergedEntry(Entry):
|
| D | CameraMetadataEnums.mako | 60 …% if section.find_first(lambda x: isinstance(x, metadata_model.Entry) and x.kind == xml_name) and \
|
| D | CameraMetadataKeys.mako | 79 …% if section.find_first(lambda x: isinstance(x, metadata_model.Entry) and x.kind == xml_name) and \
|
| D | metadata_helpers.py | 457 if not isinstance(entry, metadata_model.Entry):
|
| /system/core/init/ |
| D | keychords.h | 67 struct Entry { struct
68 Entry();
89 std::map<const std::vector<int>, Entry> entries_; argument
|
| D | keychords.cpp | 111 Keychords::Entry::Entry() : notified(false) {} in Entry() function in android::init::Keychords::Entry
283 entries_.try_emplace(keycodes, Entry()); in Register()
|
| /system/media/audio_utils/include/audio_utils/ |
| D | ErrorLog.h | 161 struct Entry { struct
162 Entry() in Entry() function
189 std::vector<Entry> mEntries; // circular buffer of error entries. argument
|
| /system/timezone/input_tools/android/tzlookup_generator/src/main/java/com/android/libcore/timezone/tzlookup/ |
| D | BackwardFile.java | 89 for (Map.Entry<String, String> entry : links.entrySet()) { in getAllAlternativeIds()
|
| /system/tools/xsdc/tests/src/com/android/xsdc/tests/ |
| D | TestHelper.java | 113 for (Map.Entry<String, StringBuffer> entry : fileOutputMap.entrySet()) { in parseXsdAndCompile()
|
| /system/teeui/tools/framebufferizer/src/com/android/framebufferizer/utils/ |
| D | FrameBufferBuffer.java | 329 Map.Entry<String, Object> element = (Map.Entry) iterator.next(); in setDefaultValues()
|
| /system/core/logd/ |
| D | README.replay.md | 24 1. Log Entry Count
|
| /system/memory/libmemunreachable/ |
| D | README.md | 77 - `MemUnreachable.cpp`: Entry points, implements the sequencing described above.
|