Searched defs:Entry (Results 1 - 7 of 7) sorted by relevance

/system/keymaster/
H A Doperation_table.cpp28 OperationTable::Entry::~Entry() {
37 table_.reset(new (std::nothrow) Entry[table_size_]);
H A Doperation_table.h32 struct Entry { struct in class:keymaster::OperationTable
33 Entry() { function in struct:keymaster::OperationTable::Entry
37 ~Entry();
47 UniquePtr<Entry[]> table_;
/system/security/keystore/
H A Dauth_token_table.h105 class Entry { class in class:keymaster::AuthTokenTable
107 Entry(const hw_auth_token_t* token, time_t current_time);
108 Entry(Entry&& entry) { *this = std::move(entry); } function in class:keymaster::AuthTokenTable::Entry
110 void operator=(Entry&& rhs) {
117 bool operator<(const Entry& rhs) const { return last_use_ < rhs.last_use_; }
121 bool Supersedes(const Entry& entry) const;
124 bool is_newer_than(const Entry* entry) {
153 void RemoveEntriesSupersededBy(const Entry& entry);
154 bool IsSupersededBySomeEntry(const Entry
[all...]
H A Dauth_token_table.cpp53 Entry new_entry(auth_token, clock_function_());
111 entries_, [&](Entry& e) { return e.token()->challenge == op_handle && !e.completed(); });
127 Entry* newest_match = NULL;
153 void AuthTokenTable::RemoveEntriesSupersededBy(const Entry& entry) {
154 entries_.erase(remove_if(entries_, [&](Entry& e) { return entry.Supersedes(e); }),
162 bool AuthTokenTable::IsSupersededBySomeEntry(const Entry& entry) {
164 [&](Entry& e) { return e.Supersedes(entry); });
168 auto found = find_if(entries_, [&](Entry& e) { return e.token()->challenge == op_handle; });
179 AuthTokenTable::Entry::Entry(cons function in class:AuthTokenTable::Entry
[all...]
/system/core/include/utils/
H A DLruCache.h59 struct Entry { struct in class:android::LruCache
62 Entry* parent;
63 Entry* child;
65 Entry(TKey key_, TValue value_) : key(key_), value(value_), parent(NULL), child(NULL) { function in struct:android::LruCache::Entry
70 struct HashForEntry : public std::unary_function<Entry*, hash_t> {
71 size_t operator() (const Entry* entry) const {
76 struct EqualityForHashedEntries : public std::unary_function<Entry*, hash_t> {
77 bool operator() (const Entry* lhs, const Entry* rhs) const {
82 typedef std::unordered_set<Entry*, HashForEntr
[all...]
/system/core/libcutils/
H A Dhashmap.c26 typedef struct Entry Entry; typedef in typeref:struct:Entry
27 struct Entry { struct
31 Entry* next;
35 Entry** buckets;
61 map->buckets = calloc(map->bucketCount, sizeof(Entry*));
109 Entry** newBuckets = calloc(newBucketCount, sizeof(Entry*));
118 Entry* entry = map->buckets[i];
120 Entry* nex
[all...]
/system/media/camera/docs/
H A Dmetadata_model.py24 Entry: A node corresponding to <entry> elements.
211 self._entries_ordered = [] # list of ordered Entry/Clone instances
296 Entry#__init__ for the keys required/optional.
302 e = Entry(**entry)
359 entry: an Entry object
374 Generate the graph recursively, after which all Entry nodes will be
785 entries: A sequence of Entry/Clone children.
885 entries: A sequence of Entry/Clone children.
1011 parent: An edge to the parent, always an Entry instance.
1037 class Entry(Nod class in inherits:Node
[all...]

Completed in 384 milliseconds