Home
last modified time | relevance | path

Searched refs:Entry (Results 1 – 19 of 19) sorted by relevance

/system/core/libcutils/
Dhashmap.cpp26 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/
Dauth_token_table.h104 class Entry {
106 Entry(HardwareAuthToken&& token, time_t current_time);
107 Entry(Entry&& entry) noexcept { *this = std::move(entry); } in Entry() function
109 void operator=(Entry&& rhs) noexcept {
116 bool operator<(const Entry& rhs) const { return last_use_ < rhs.last_use_; }
120 bool Supersedes(const Entry& entry) const;
123 bool is_newer_than(const Entry* entry) const { in is_newer_than()
159 void RemoveEntriesSupersededBy(const Entry& entry);
160 bool IsSupersededBySomeEntry(const Entry& entry);
167 std::vector<Entry> entries_;
Dauth_token_table.cpp81 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()
183 void AuthTokenTable::RemoveEntriesSupersededBy(const Entry& entry) { in RemoveEntriesSupersededBy()
184 entries_.erase(remove_if(entries_, [&](Entry& e) { return entry.Supersedes(e); }), in RemoveEntriesSupersededBy()
203 bool AuthTokenTable::IsSupersededBySomeEntry(const Entry& entry) { in IsSupersededBySomeEntry()
205 [&](Entry& e) { return e.Supersedes(entry); }); in IsSupersededBySomeEntry()
211 auto found = find_if(entries_, [&](Entry& e) { return e.token().challenge == op_handle; }); in MarkCompleted()
220 AuthTokenTable::Entry::Entry(HardwareAuthToken&& token, time_t current_time) in Entry() function in keystore::AuthTokenTable::Entry
224 bool AuthTokenTable::Entry::SatisfiesAuth(const std::vector<uint64_t>& sids, in SatisfiesAuth()
[all …]
/system/core/libutils/include/utils/
DLruCache.h67 class Entry final : public KeyedEntry {
71 Entry* parent;
72 Entry* child;
74Entry(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/tzlookup_generator/src/main/java/com/android/libcore/timezone/tzlookup/zonetree/
DCountryZoneUsage.java27 private final Map<String, Entry> zoneIdEntryMap = new HashMap<>();
42 zoneIdEntryMap.put(zoneId, new Entry(zoneId, notUsedAfterInstant)); in addEntry()
50 Entry entry = zoneIdEntryMap.get(zoneId); in getNotUsedAfterInstant()
58 private static class Entry { class in CountryZoneUsage
62 Entry(String zoneId, Instant notUsedAfter) { in Entry() method in CountryZoneUsage.Entry
DCountryZoneTree.java398 for (Map.Entry<ZonePeriodsKey, List<ZoneInfo>> newSetEntry : newSetsMap.entrySet()) { in growTree()
/system/media/camera/docs/
Dmetadata_model_test.py16 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",
Dhtml.mako56 /* Entry flair */
60 /* Entry type flair */
76 /* Entry tags flair */
79 /* Entry details (full docs) flair */
83 /* Entry spacer flair */
DACameraMetadata.mako22 …% if section.find_first(lambda x: isinstance(x, metadata_model.Entry) and x.kind == kind_name) and…
Dmetadata_model.py302 e = Entry(**entry)
1093 class Entry(Node): class
1512 class Clone(Entry):
1594 class MergedEntry(Entry):
DCameraMetadataEnums.mako60 …% if section.find_first(lambda x: isinstance(x, metadata_model.Entry) and x.kind == xml_name) and \
DCameraMetadataKeys.mako79 …% if section.find_first(lambda x: isinstance(x, metadata_model.Entry) and x.kind == xml_name) and \
Dmetadata_helpers.py457 if not isinstance(entry, metadata_model.Entry):
/system/netd/resolv/
Dres_cache.cpp927 typedef struct Entry { struct
929 struct Entry* hlink; /* next in collision chain */ argument
930 struct Entry* mru_prev; argument
931 struct Entry* mru_next; argument
939 } Entry; argument
1034 static void entry_free(Entry* e) { in entry_free()
1041 static void entry_mru_remove(Entry* e) { in entry_mru_remove()
1046 static void entry_mru_add(Entry* e, Entry* list) { in entry_mru_add()
1047 Entry* first = list->mru_next; in entry_mru_add()
1058 static unsigned entry_hash(const Entry* e) { in entry_hash()
[all …]
/system/core/init/
Dkeychords.h67 struct Entry { struct
68 Entry();
89 std::map<const std::vector<int>, Entry> entries_; argument
Dkeychords.cpp111 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/
DErrorLog.h161 struct Entry { struct
162 Entry() in Entry() function
189 std::vector<Entry> mEntries; // circular buffer of error entries. argument
/system/tools/xsdc/tests/src/com/android/xsdc/tests/
DTestHelper.java113 for (Map.Entry<String, StringBuffer> entry : fileOutputMap.entrySet()) { in parseXsdAndCompile()
/system/core/libmemunreachable/
DREADME.md77 - `MemUnreachable.cpp`: Entry points, implements the sequencing described above.