| /system/bt/service/ipc/binder/ |
| D | remote_callback_map.h | 37 template <typename K, typename V>
53 virtual void OnRemoteCallbackRemoved(const K& key) = 0;
63 bool Register(const K& key, const android::sp<V>& callback,
68 bool Unregister(const K& key);
72 android::sp<V> Get(const K& key);
76 android::sp<V> Remove(const K& key);
84 CallbackDeathRecipient(const K& key, const android::sp<V>& callback,
85 RemoteCallbackMap<K, V>* owner, Delegate* delegate);
93 K key_;
95 RemoteCallbackMap<K, V>* owner_; // weak
[all …]
|
| /system/libhidl/transport/include/hidl/ |
| D | ConcurrentMap.h | 25 template<typename K, typename V>
28 using size_type = typename std::map<K, V>::size_type;
29 using iterator = typename std::map<K, V>::iterator;
30 using const_iterator = typename std::map<K, V>::const_iterator;
33 void set(K &&k, V &&v) { in set()
35 mMap[std::forward<K>(k)] = std::forward<V>(v); in set()
39 const V &get(const K &k, const V &def) const { in get()
48 size_type erase(const K &k) { in erase()
55 std::map<K, V> mMap;
|
| /system/libvintf/include/vintf/ |
| D | MapValueIterator.h | 29 using K = typename Map::key_type; member
103 template<typename K, typename V>
104 using ConstMapValueIterable = typename MapIterTypes<std::map<K, V>>::ConstValueIterable;
105 template<typename K, typename V>
106 using ConstMultiMapValueIterable = typename MapIterTypes<std::multimap<K, V>>::ConstValueIterable;
108 template<typename K, typename V>
109 ConstMapValueIterable<K, V> iterateValues(const std::map<K, V> &map) { in iterateValues() argument
112 template<typename K, typename V>
113 ConstMultiMapValueIterable<K, V> iterateValues(const std::multimap<K, V> &map) { in iterateValues() argument
|
| /system/core/libutils/include/utils/ |
| D | TypeHelpers.h | 279 template <typename K, typename V>
280 struct trait_trivial_ctor< key_value_pair_t<K, V> >
281 { enum { value = aggregate_traits<K,V>::has_trivial_ctor }; };
282 template <typename K, typename V>
283 struct trait_trivial_dtor< key_value_pair_t<K, V> >
284 { enum { value = aggregate_traits<K,V>::has_trivial_dtor }; };
285 template <typename K, typename V>
286 struct trait_trivial_copy< key_value_pair_t<K, V> >
287 { enum { value = aggregate_traits<K,V>::has_trivial_copy }; };
288 template <typename K, typename V>
[all …]
|
| D | LruCache.h | 179 template<typename K, typename V>
180 void LruCache<K, V>::setOnEntryRemovedListener(OnEntryRemoved<K, V>* listener) { in setOnEntryRemovedListener() argument
|
| /system/bt/embdrv/sbc/decoder/srce/ |
| D | synthesis-dct8.c | 91 #define FLOAT_MULT_DCT(K, sample) (FIX(K, 20) * sample) in float_dct2_8() argument
254 #define FIX_MULT_DCT(K, x) (MUL_32S_32S_HI(K, x) << 2) in dct2_8() argument
|
| D | synthesis-sbc.c | 244 #define LONG_MULT_DCT(K, sample) (MUL_16S_32S_HI(K, sample) << 2) argument
|
| /system/core/logd/ |
| D | README.property | 35 default false, logd.size 64K instead
36 of 256K.
66 - number - support multipliers (K or M) for convenience. Range is limited
67 to between 64K and 256M for log buffer sizes. Individual log buffer ids
|
| /system/update_engine/ |
| D | unittest_key.pem | 3 hHNF96s5wEn8RDtrdLocm0a+SqXXf7KycFRTZxLdDbqWAMUlPXOaPI+PZLWkB7/K
|
| /system/ca-certificates/files/ |
| D | 418595b9.0 | 36 …\xBC - UEKAE, OU=Kamu Sertifikasyon Merkezi, CN=T\xC3\x9CB\xC4\xB0TAK UEKAE K\xC3\xB6k Sertifika H…
40 …\xBC - UEKAE, OU=Kamu Sertifikasyon Merkezi, CN=T\xC3\x9CB\xC4\xB0TAK UEKAE K\xC3\xB6k Sertifika H…
|
| D | 27af790d.0 | 16 rD6ogRLQy7rQkgu2npaqBA+K
|
| D | 85cde254.0 | 20 8n/Uqgr/Qh037ZTlZFkSIHc40zI+OIF1lnP6aI+xy84fxez6nH7PfrHxBy22/L/K
|
| D | fac084d7.0 | 7 j6UG3mii24aZS2QNcfAKBZuOquHMLtJqO8F6tJdhjYq+xpqcBrSGUeQ3DnR4fl+K
|
| D | 7672ac4b.0 | 11 rP5pqZ56XjUl+rSnSTV3lqc2W+HN3yNw2F1MpQiD8aYkOBOo7C+ooWfHpi2GR+6K
|
| D | ee90b008.0 | 20 BQADggIBAHNXPyzVlTJ+N9uWkusZXn5T50HsEbZH77Xe7XRcxfGOSeD8bpkTzZ+K
|
| D | dbc54cab.0 | 9 +jjeRFcV5fiMyNlI4g0WJx0eyIOFJbe6qlVBzAMiSy2RjYvmia9mx+n/K+k8rNrS
|
| /system/ca-certificates/google/files/ |
| D | 27af790d.0 | 16 rD6ogRLQy7rQkgu2npaqBA+K
|
| D | 85cde254.0 | 20 8n/Uqgr/Qh037ZTlZFkSIHc40zI+OIF1lnP6aI+xy84fxez6nH7PfrHxBy22/L/K
|
| D | dbc54cab.0 | 9 +jjeRFcV5fiMyNlI4g0WJx0eyIOFJbe6qlVBzAMiSy2RjYvmia9mx+n/K+k8rNrS
|
| /system/chre/external/flatbuffers/include/flatbuffers/ |
| D | flatbuffers.h | 447 template<typename K> return_type LookupByKey(K key) const {
449 IndirectHelper<T>::element_stride, KeyCompare<K>);
468 template<typename K> static int KeyCompare(const void *ap, const void *bp) {
469 const K *key = reinterpret_cast<const K *>(ap);
|
| /system/core/libsync/tests/ |
| D | sync_test.cpp | 561 template <typename K, typename V> using dict = unordered_map<K,V>;
|
| /system/extras/simpleperf/ |
| D | README.md | 91 4,692,338 branch-misses # 468.118 K/sec (100%)
120 91,721 cache-misses # 102.918 K/sec (87%)
121 45,735 cache-misses:u # 51.327 K/sec (87%)
122 38,447 cache-misses:k # 43.131 K/sec (87%)
569 Note that kernel can’t dump user stack >= 64K, so the dwarf based call graph
570 doesn’t contain call chains consuming >= 64K stack. What’s more, because we
|
| /system/ca-certificates/google/ |
| D | roots.pem | 1110 8n/Uqgr/Qh037ZTlZFkSIHc40zI+OIF1lnP6aI+xy84fxez6nH7PfrHxBy22/L/K
1321 rD6ogRLQy7rQkgu2npaqBA+K
1842 +jjeRFcV5fiMyNlI4g0WJx0eyIOFJbe6qlVBzAMiSy2RjYvmia9mx+n/K+k8rNrS
|
| /system/tpm/trunks/generator/ |
| D | raw_commands_fixed.txt | 14928 a) set K, L, and E to be Empty Buffers.
14931 d) set K ≔ [ds] (x2, y2)
14949 if K is not an Empty Buffer, set L ≔ [r] (x2, y2)
14951 k) if K, L, or E is the point at infinity, return TPM_RC_NO_RESULT
14974 n) output K, L, E and counter
14977 Depending on the input parameters K and L may be Empty Buffers or E may be an Empty Buffer
15064 K
15066 ECC point K ≔ [ds](x2, y2)
15132 K, L or E was a point at infinity; or failed to generate r value
15418 result = CryptCommitCompute(&out->K.t.point,
[all …]
|
| D | raw_structures_fixed.txt | 7478 K, A, P
7534 K, A, P
7570 K, A, P
7579 K, A, P
7628 K – a Primary Seed
|