Searched defs:Entry (Results 1 - 7 of 7) sorted by relevance
/system/keymaster/ |
H A D | operation_table.cpp | 28 OperationTable::Entry::~Entry() { 37 table_.reset(new (std::nothrow) Entry[table_size_]);
|
H A D | operation_table.h | 32 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 D | auth_token_table.h | 111 class Entry { class in class:keymaster::AuthTokenTable 113 Entry(const hw_auth_token_t* token, time_t current_time); 114 Entry(Entry&& entry) { *this = std::move(entry); } function in class:keymaster::AuthTokenTable::Entry 116 void operator=(Entry&& rhs) { 123 bool operator<(const Entry& rhs) const { return last_use_ < rhs.last_use_; } 127 bool Supersedes(const Entry& entry) const; 130 bool is_newer_than(const Entry* entry) { 159 void RemoveEntriesSupersededBy(const Entry& entry); 160 bool IsSupersededBySomeEntry(const Entry [all...] |
H A D | auth_token_table.cpp | 53 Entry new_entry(auth_token, clock_function_()); 111 entries_, [&](Entry& e) { return e.token()->challenge == op_handle && !e.completed(); }); 127 Entry* newest_match = NULL; 160 void AuthTokenTable::RemoveEntriesSupersededBy(const Entry& entry) { 161 entries_.erase(remove_if(entries_, [&](Entry& e) { return entry.Supersedes(e); }), 173 bool AuthTokenTable::IsSupersededBySomeEntry(const Entry& entry) { 175 [&](Entry& e) { return e.Supersedes(entry); }); 179 auto found = find_if(entries_, [&](Entry& e) { return e.token()->challenge == op_handle; }); 190 AuthTokenTable::Entry::Entry(cons function in class:AuthTokenTable::Entry [all...] |
/system/core/include/utils/ |
H A D | LruCache.h | 59 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 D | hashmap.c | 26 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 D | metadata_model.py | 24 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 129 milliseconds