Searched refs:n1 (Results 1 - 11 of 11) sorted by relevance

/system/extras/tests/binder/benchmarks/
H A DbinderAddInts.cpp224 for (unsigned int n1 = 0; n1 < str.size(); n1++) {
225 if ((str[n1] > 0x20) && (str[n1] < 0x80)) {
226 stream << (char) str[n1];
237 for (unsigned int n1 = 0; n1 < CPU_SETSIZE; n1++) {
238 if (CPU_ISSET(n1,
240 stream << n1; local
[all...]
/system/core/include/utils/
H A DUnicode.h41 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2);
44 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2);
/system/extras/tests/wifi/stress/
H A DwifiLoadScanAssoc.c390 unsigned int n1; local
403 for (n1 = 0; n1 < CPU_SETSIZE; n1++) {
404 if (CPU_ISSET(n1, &availCPU)) { numAvailCPU++; }
/system/extras/simpleperf/
H A Dcallchain.cpp110 static bool CompareNodeByPeriod(const std::unique_ptr<CallChainNode>& n1, argument
112 uint64_t period1 = n1->period + n1->children_period;
/system/core/libutils/
H A DUnicode.cpp311 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2) argument
313 const char16_t* e1 = s1+n1;
323 return n1 < n2
325 : (n1 > n2
330 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2) argument
332 const char16_t* e1 = s1H+n1;
344 return n1 < n2
346 : (n1 > n2
/system/bt/stack/smp/
H A Dsmp_int.h384 UINT8 *key_id, UINT8 *n1,
387 extern void smp_f5_calc_chk (UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2,
389 extern void smp_f6_calc_chk (UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *r,
523 extern BOOLEAN smp_calculate_f5(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2,
526 UINT8 *key_id, UINT8 *n1, UINT8 *n2, UINT8 *a1,
529 extern BOOLEAN smp_calculate_f6(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *r, UINT8 *iocap,
H A Dsmp_keys.c1479 BOOLEAN smp_calculate_f5(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2, argument
1508 p_prnt = n1;
1528 if (!smp_calculate_f5_mackey_or_long_term_key(t, counter_mac_key, key_id, n1, n2, a1, a2,
1539 if (!smp_calculate_f5_mackey_or_long_term_key(t, counter_ltk, key_id, n1, n2, a1, a2,
1586 UINT8 *key_id, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2,
1609 p_prnt = n1;
1632 ARRAY_TO_STREAM(p, n1, BT_OCTET16_LEN);
1828 BOOLEAN smp_calculate_f6(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *r, UINT8 *iocap, UINT8 *a1, argument
1844 p_print = n1;
1874 ARRAY_TO_STREAM(p, n1, BT_OCTET16_LE
1585 smp_calculate_f5_mackey_or_long_term_key(UINT8 *t, UINT8 *counter, UINT8 *key_id, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2, UINT8 *length, UINT8 *mac) argument
[all...]
H A Daes.c235 { uint_8t p1 = x, p2 = BPOLY, n1 = hibit(x), n2 = 0x80, v1 = 1, v2 = 0; local
242 if(n1)
243 while(n2 >= n1) /* divide polynomial p2 by p1 */
245 n2 /= n1; /* shift smaller polynomial left */
254 while(n1 >= n2)
256 n1 /= n2;
257 p1 ^= p2 * n1;
258 v1 ^= v2 * n1;
259 n1 = hibit(p1);
/system/core/include/mincrypt/
H A Dp256.h138 const p256_int *n1, const p256_int *n2,
/system/core/fs_mgr/
H A Dfs_mgr.c250 char *n1; local
254 n1 = strdup(in1);
257 remove_trailing_slashes(n1);
260 ret = !strcmp(n1, n2);
262 free(n1);
/system/core/libmincrypt/
H A Dp256_ec.c1239 /* p256_points_mul_vartime sets {out_x,out_y} = n1*G + n2*{in_x,in_y}, where
1240 * n1 and n2 are < the order of the group.
1246 const p256_int* n1, const p256_int* n2, const p256_int* in_x,
1251 if (p256_is_zero(n1) != 0 && p256_is_zero(n2) != 0) {
1259 scalar_base_mult(x1, y1, z1, n1);
1265 } else if (p256_is_zero(n1) != 0) {
1266 /* If n1 == 0, then {x1,y1,z1} is zero and the result is just
1245 p256_points_mul_vartime( const p256_int* n1, const p256_int* n2, const p256_int* in_x, const p256_int* in_y, p256_int* out_x, p256_int* out_y) argument

Completed in 291 milliseconds