Searched refs:n2 (Results 1 - 10 of 10) sorted by relevance

/system/core/include/utils/
H A DUnicode.h40 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2);
43 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2);
/system/core/libutils/
H A DUnicode.cpp287 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2) argument
290 const char16_t* e2 = s2+n2;
299 return n1 < n2
301 : (n1 > n2
306 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2) argument
309 const char16_t* e2 = s2N+n2;
320 return n1 < n2
322 : (n1 > n2
/system/bt/stack/smp/
H A Dsmp_int.h384 UINT8 *n2, UINT8 *a1, UINT8 *a2,
386 extern void smp_f5_calc_chk (UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2,
388 extern void smp_f6_calc_chk (UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *r,
522 extern BOOLEAN smp_calculate_f5(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2,
525 UINT8 *key_id, UINT8 *n1, UINT8 *n2, UINT8 *a1,
528 extern BOOLEAN smp_calculate_f6(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *r, UINT8 *iocap,
H A Dsmp_keys.c1498 BOOLEAN smp_calculate_f5(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2, argument
1529 p_prnt = n2;
1547 if (!smp_calculate_f5_mackey_or_long_term_key(t, counter_mac_key, key_id, n1, n2, a1, a2,
1558 if (!smp_calculate_f5_mackey_or_long_term_key(t, counter_ltk, key_id, n1, n2, a1, a2,
1605 UINT8 *key_id, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2,
1630 p_prnt = n2;
1650 ARRAY_TO_STREAM(p, n2, BT_OCTET16_LEN);
1847 BOOLEAN smp_calculate_f6(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *r, UINT8 *iocap, UINT8 *a1, argument
1865 p_print = n2;
1892 ARRAY_TO_STREAM(p, n2, BT_OCTET16_LE
1604 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
243 while(n2 >= n1) /* divide polynomial p2 by p1 */
245 n2 /= n1; /* shift smaller polynomial left */
246 p2 ^= (p1 * n2) & 0xff; /* and remove from larger one */
247 v2 ^= (v1 * n2); /* shift accumulated value and */
248 n2 = hibit(p2); /* add into result */
253 if(n2) /* repeat with values swapped */
254 while(n1 >= n2)
256 n1 /= n2;
/system/core/include/mincrypt/
H A Dp256.h136 // {out_x,out_y} := n1G + n2{in_x,in_y}
138 const p256_int *n1, const p256_int *n2,
/system/core/fs_mgr/
H A Dfs_mgr.c246 char *n2; local
250 n2 = strdup(in2);
253 remove_trailing_slashes(n2);
255 ret = !strcmp(n1, n2);
258 free(n2);
/system/bt/stack/rfcomm/
H A Drfc_int.h97 UINT8 n2; member in struct:__anon1249::__anon1250::__anon1251
H A Drfc_ts_frames.c755 p_rx_frame->u.pn.n2 = *p_data++;
/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) {
1260 scalar_mult(x2, y2, z2, px, py, n2);
1262 if (p256_is_zero(n2) != 0) {
1263 /* If n2 == 0, then {x2,y2,z2} 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 214 milliseconds