| /system/bt/stack/crypto_toolbox/ |
| D | crypto_toolbox.cc | 57 const Octet16& n2, uint8_t* a1, in calculate_mac_key_or_ltk() argument
68 it = std::copy(n2.begin(), n2.end(), it); in calculate_mac_key_or_ltk()
76 void f5(const uint8_t* w, const Octet16& n1, const Octet16& n2, uint8_t* a1, in f5() argument
80 << ", N2=" << HexEncode(n2.data(), n2.size()) in f5()
92 *mac_key = calculate_mac_key_or_ltk(t, 0, key_id, n1, n2, a1, a2, length); in f5()
94 *ltk = calculate_mac_key_or_ltk(t, 1, key_id, n1, n2, a1, a2, length); in f5()
100 Octet16 f6(const Octet16& w, const Octet16& n1, const Octet16& n2, in f6() argument
109 << ", N2=" << HexEncode(n2.data(), n2.size()) in f6()
120 it = std::copy(n2.begin(), n2.end(), it); in f6()
|
| D | crypto_toolbox.h | 28 extern void f5(const uint8_t* w, const Octet16& n1, const Octet16& n2,
30 extern Octet16 f6(const Octet16& w, const Octet16& n1, const Octet16& n2,
|
| D | aes.cc | 256 uint_8t p1 = x, p2 = BPOLY, n1 = hibit(x), n2 = 0x80, v1 = 1, v2 = 0; in gf_inv() local
262 while (n2 >= n1) /* divide polynomial p2 by p1 */ in gf_inv()
264 n2 /= n1; /* shift smaller polynomial left */ in gf_inv()
265 p2 ^= (p1 * n2) & 0xff; /* and remove from larger one */ in gf_inv()
266 v2 ^= (v1 * n2); /* shift accumulated value and */ in gf_inv()
267 n2 = hibit(p2); /* add into result */ in gf_inv()
272 if (n2) /* repeat with values swapped */ in gf_inv()
273 while (n1 >= n2) { in gf_inv()
274 n1 /= n2; in gf_inv()
|
| /system/bt/gd/crypto_toolbox/ |
| D | crypto_toolbox.cc | 58 const Octet16& n2, in calculate_mac_key_or_ltk() argument
70 it = std::copy(n2.begin(), n2.end(), it); in calculate_mac_key_or_ltk()
78 void f5(uint8_t* w, const Octet16& n1, const Octet16& n2, uint8_t* a1, uint8_t* a2, Octet16* mac_ke… in f5() argument
91 *mac_key = calculate_mac_key_or_ltk(t, 0, key_id, n1, n2, a1, a2, length); in f5()
93 *ltk = calculate_mac_key_or_ltk(t, 1, key_id, n1, n2, a1, a2, length); in f5()
100 f6(const Octet16& w, const Octet16& n1, const Octet16& n2, const Octet16& r, uint8_t* iocap, uint8_… in f6() argument
114 it = std::copy(n2.begin(), n2.end(), it); in f6()
|
| D | crypto_toolbox_test.cc | 166 …Octet16 n2{0xa6, 0xe8, 0xe7, 0xcc, 0x25, 0xa7, 0x5f, 0x6e, 0x21, 0x65, 0x83, 0xf7, 0xff, 0x3d, 0xc… in TEST() local
177 std::reverse(std::begin(n2), std::end(n2)); in TEST()
184 f5(dhkey_w.data(), n1, n2, a1.data(), a2.data(), &mac_key, <k); in TEST()
193 …Octet16 n2{0xa6, 0xe8, 0xe7, 0xcc, 0x25, 0xa7, 0x5f, 0x6e, 0x21, 0x65, 0x83, 0xf7, 0xff, 0x3d, 0xc… in TEST() local
206 std::reverse(std::begin(n2), std::end(n2)); in TEST()
214 Octet16 aes_cmac = f6(MacKey, n1, n2, r, IOcap.data(), a1.data(), a2.data()); in TEST()
|
| D | crypto_toolbox.h | 42 …uint8_t* w, const Octet16& n1, const Octet16& n2, uint8_t* a1, uint8_t* a2, Octet16* mac_key, Octe…
44 …const Octet16& w, const Octet16& n1, const Octet16& n2, const Octet16& r, uint8_t* iocap, uint8_t*…
|
| D | aes.cc | 208 uint_8t p1 = x, p2 = BPOLY, n1 = hibit(x), n2 = 0x80, v1 = 1, v2 = 0; in gf_inv() local
214 while (n2 >= n1) /* divide polynomial p2 by p1 */ in gf_inv()
216 n2 /= n1; /* shift smaller polynomial left */ in gf_inv()
217 p2 ^= (p1 * n2) & 0xff; /* and remove from larger one */ in gf_inv()
218 v2 ^= (v1 * n2); /* shift accumulated value and */ in gf_inv()
219 n2 = hibit(p2); /* add into result */ in gf_inv()
224 if (n2) /* repeat with values swapped */ in gf_inv()
225 while (n1 >= n2) { in gf_inv()
226 n1 /= n2; in gf_inv()
|
| /system/bt/stack/smp/ |
| D | crypto_toolbox.h | 29 extern void smp_calculate_f5(uint8_t* w, const Octet16& n1, const Octet16& n2,
33 const Octet16& n2, const Octet16& r,
|
| /system/bt/stack/test/ |
| D | crypto_toolbox_test.cc | 190 Octet16 n2{0xa6, 0xe8, 0xe7, 0xcc, 0x25, 0xa7, 0x5f, 0x6e, in TEST() local
203 std::reverse(std::begin(n2), std::end(n2)); in TEST()
210 f5(dhkey_w.data(), n1, n2, a1.data(), a2.data(), &mac_key, <k); in TEST()
220 Octet16 n2{0xa6, 0xe8, 0xe7, 0xcc, 0x25, 0xa7, 0x5f, 0x6e, in TEST() local
236 std::reverse(std::begin(n2), std::end(n2)); in TEST()
244 Octet16 aes_cmac = f6(MacKey, n1, n2, r, IOcap.data(), a1.data(), a2.data()); in TEST()
|
| /system/extras/simpleperf/ |
| D | callchain.h | 154 const std::unique_ptr<NodeT>& n2) { in CompareNodeByPeriod()
156 uint64_t period2 = n2->period + n2->children_period; in CompareNodeByPeriod()
|
| D | CallChainJoiner.cpp | 104 bool LRUCache::CacheNodeEqual(const CacheNode* n1, const CacheNode* n2) { in CacheNodeEqual() argument
105 return n1->tid == n2->tid && n1->ip == n2->ip && n1->sp == n2->sp; in CacheNodeEqual()
|
| D | CallChainJoiner.h | 89 static bool CacheNodeEqual(const CacheNode* n1, const CacheNode* n2);
|
| /system/core/libutils/ |
| D | Unicode.cpp | 309 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2) in strzcmp16() argument
312 const char16_t* e2 = s2+n2; in strzcmp16()
321 return n1 < n2 in strzcmp16()
323 : (n1 > n2 in strzcmp16()
|
| /system/core/libutils/include/utils/ |
| D | Unicode.h | 40 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2);
|
| /system/core/init/ |
| D | perfboot.py | 332 n2 = n / 2
333 return (data[n2 - 1] + data[n2]) / 2.0
|
| /system/bt/stack/rfcomm/ |
| D | rfc_int.h | 103 uint8_t n2; member
|
| D | rfc_ts_frames.cc | 704 p_rx_frame->u.pn.n2 = *p_data++; in rfc_process_mx_message()
|