Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 49) sorted by relevance

12

/lib/rsa/
A Drsa-keyprop.c120 uint32_t k, c; in BIT_LENGTH() local
122 k = NEQ(x, 0); in BIT_LENGTH()
128 return k; in BIT_LENGTH()
262 size_t k; in br_i32_encode() local
291 k --; in br_i32_encode()
297 while (k > 0) { in br_i32_encode()
299 k --; in br_i32_encode()
401 int k; in br_divrem() local
406 for (k = 31; k > 0; k --) { in br_divrem()
410 j = 32 - k; in br_divrem()
[all …]
A Drsa-mod-exp.c186 int j, k; in pow_mod() local
203 if (0 != num_public_exponent_bits(key, &k)) in pow_mod()
206 if (k < 2) { in pow_mod()
208 k); in pow_mod()
222 for (j = k - 2; j > 0; --j) { in pow_mod()
/lib/bzip2/
A Dbzlib_blocksort.c306 k = fmap[i] - H; if (k < 0) k += nblock; in fallbackSort()
316 while (ISSET_BH(k) && UNALIGNED_BH(k)) k++; in fallbackSort()
318 while (WORD_BH(k) == 0xffffffff) k += 32; in fallbackSort()
319 while (ISSET_BH(k)) k++; in fallbackSort()
323 while (!ISSET_BH(k) && UNALIGNED_BH(k)) k++; in fallbackSort()
325 while (WORD_BH(k) == 0x00000000) k += 32; in fallbackSort()
326 while (!ISSET_BH(k)) k++; in fallbackSort()
390 Int32 k; in mainGtU() local
499 k -= 8; in mainGtU()
955 k = ptr[j]-1; if (k < 0) k += nblock; in mainSort()
[all …]
A Dbzlib_huffman.c111 Int32 nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
156 k = i; in BZ2_hbMakeCodeLengths()
157 while (parent[k] >= 0) { k = parent[k]; j++; } in BZ2_hbMakeCodeLengths()
/lib/mbedtls/external/mbedtls/scripts/
A Dgenerate_psa_constants.py264 return ''.join([make(k, d[k]) for k in sorted(d.keys())])
269 return ''.join([make(k, d[k]) for k in sorted(d.keys())])
292 return ''.join([make(k, d[k]) for k in sorted(d.keys())])
/lib/lwip/lwip/src/netif/ppp/polarssl/
A Darc4.c50 int i, j, k, a; in arc4_setup() local
60 j = k = 0; in arc4_setup()
62 for( i = 0; i < 256; i++, k++ ) in arc4_setup()
64 if( k >= keylen ) k = 0; in arc4_setup()
67 j = ( j + a + key[k] ) & 0xFF; in arc4_setup()
/lib/lwip/lwip/test/unit/tcp/
A Dtest_tcp_oos.c463 int i, k; in START_TEST() local
492 for(i = TCP_MSS, k = 0; i < TCP_WND; i += TCP_MSS, k++) { in START_TEST()
506 EXPECT_OOSEQ(count == k+1); in START_TEST()
550 int i, k; in START_TEST() local
579 for(i = TCP_MSS, k = 0; i < TCP_WND; i += TCP_MSS, k++) { in START_TEST()
636 int i, k; in START_TEST() local
664 for(k = 1, i = 1; k < TCP_OOSEQ_MAX_BYTES; k += TCP_MSS, i++) { in START_TEST()
685 p_ovr = tcp_create_rx_segment(pcb, &data_full_wnd[k+1], 1, k+1, 0, TCP_ACK); in START_TEST()
808 int i, k; in test_tcp_recv_ooseq_double_FINs() local
836 k = 1; in test_tcp_recv_ooseq_double_FINs()
[all …]
/lib/lwip/lwip/test/unit/etharp/
A Dtest_etharp.c80 int k; in create_arp_response() local
103 k = 6; in create_arp_response()
104 while(k > 0) { in create_arp_response()
105 k--; in create_arp_response()
107 etharphdr->shwaddr.addr[k] = test_ethaddr2.addr[k]; in create_arp_response()
108 etharphdr->dhwaddr.addr[k] = test_ethaddr.addr[k]; in create_arp_response()
110 ethhdr->dest.addr[k] = test_ethaddr.addr[k]; in create_arp_response()
111 ethhdr->src.addr[k] = test_ethaddr2.addr[k]; in create_arp_response()
/lib/
A Doid_registry.c34 unsigned i, j, k, hash; in look_up_OID() local
50 k = OID__NR; in look_up_OID()
51 while (i < k) { in look_up_OID()
52 j = (i + k) / 2; in look_up_OID()
56 k = j; in look_up_OID()
67 k = j; in look_up_OID()
82 k = j; in look_up_OID()
A Dbch.c434 int k, pp = -1; in compute_error_locator_polynomial() local
447 k = 2*i-pp; in compute_error_locator_polynomial()
488 k = 0; in solve_linear_system()
494 p = c-k; in solve_linear_system()
521 if (k > 0) { in solve_linear_system()
522 p = k; in solve_linear_system()
561 int i, j, k; in find_affine4_roots() local
575 k += 2; in find_affine4_roots()
582 for (k = 0; k < 16; k = (k+j+1) & ~j) { in find_affine4_roots()
583 t = ((rows[k] >> j)^rows[k+j]) & mask; in find_affine4_roots()
[all …]
A Dqsort.c28 size_t wgap, i, j, k; in qsort() local
55 k = width; in qsort()
60 } while (--k); in qsort()
A Drc4.c14 unsigned char s[256], k[256], temp; in rc4_encode() local
22 k[i] = key[j]; in rc4_encode()
28 j = (j + s[i] + k[i]) % 256; in rc4_encode()
A Dcrc32.c65 int n, k; in make_crc_table() local
79 for (k = 0; k < 8; k++) in make_crc_table()
/lib/mbedtls/external/mbedtls/programs/random/
A Dgen_entropy.c30 int i, k, ret = 1; in main() local
47 for (i = 0, k = 768; i < k; i++) { in main()
59 (long) (sizeof(buf) * k / 1024), in main()
61 (100 * (float) (i + 1)) / k); in main()
A Dgen_random_ctr_drbg.c33 int i, k, ret = 1; in main() local
79 for (i = 0, k = 768; i < k; i++) { in main()
90 (long) (sizeof(buf) * k / 1024), in main()
92 (100 * (float) (i + 1)) / k); in main()
/lib/mbedtls/external/mbedtls/library/
A Daria.c279 a = p[0] ^ k[0]; in aria_fo_xor()
280 b = p[1] ^ k[1]; in aria_fo_xor()
281 c = p[2] ^ k[2]; in aria_fo_xor()
282 d = p[3] ^ k[3]; in aria_fo_xor()
301 a = p[0] ^ k[0]; in aria_fe_xor()
302 b = p[1] ^ k[1]; in aria_fe_xor()
303 c = p[2] ^ k[2]; in aria_fe_xor()
304 d = p[3] ^ k[3]; in aria_fe_xor()
412 int i, j, k, ret; in mbedtls_aria_setkey_dec() local
421 for (k = 0; k < 4; k++) { in mbedtls_aria_setkey_dec()
[all …]
A Dbignum.c660 size_t i, j, k; in mbedtls_mpi_write_string() local
672 k = 1; in mbedtls_mpi_write_string()
1396 size_t i, n, t, k; in mbedtls_mpi_div_mpi() local
1436 if (k < biL - 1) { in mbedtls_mpi_div_mpi()
1437 k = biL - 1 - k; in mbedtls_mpi_div_mpi()
1441 k = 0; in mbedtls_mpi_div_mpi()
2037 size_t i, j, k, s; in mpi_miller_rabin() local
2063 if (j > k) { in mpi_miller_rabin()
2171 size_t k, n; in mbedtls_mpi_gen_prime() local
2209 k = n * biL; in mbedtls_mpi_gen_prime()
[all …]
A Decdsa.c76 mbedtls_mpi k; /* per-signature random */ member
92 mbedtls_mpi_init(&ctx->k); in ecdsa_restart_sig_init()
106 mbedtls_mpi_free(&ctx->k); in ecdsa_restart_sig_free()
254 mbedtls_mpi k, e, t; in mbedtls_ecdsa_sign_restartable() local
255 mbedtls_mpi *pk = &k, *pr = r; in mbedtls_ecdsa_sign_restartable()
268 mbedtls_mpi_init(&k); mbedtls_mpi_init(&e); mbedtls_mpi_init(&t); in mbedtls_ecdsa_sign_restartable()
277 pk = &rs_ctx->sig->k; in mbedtls_ecdsa_sign_restartable()
370 mbedtls_mpi_free(&k); mbedtls_mpi_free(&e); mbedtls_mpi_free(&t); in mbedtls_ecdsa_sign_restartable()
/lib/mbedtls/external/mbedtls/tests/suites/
A Dtest_suite_pkcs7.function68 size_t buflen, i, k, cnt = 0, n_crts = 1;
95 for (k = i; k < strlen(crt_files); k++) {
96 if (crt_files[k] == ' ') {
100 TEST_CALLOC(crt_files_arr[cnt], (k-i)+1);
101 crt_files_arr[cnt][k-i] = '\0';
102 memcpy(crt_files_arr[cnt++], crt_files + i, k-i);
103 i = k;
/lib/mbedtls/external/mbedtls/tests/src/
A Drandom.c108 uint32_t i, *k, sum, delta = 0x9E3779B9; in mbedtls_test_rnd_pseudo_rand() local
115 k = info->key; in mbedtls_test_rnd_pseudo_rand()
123 + info->v1) ^ (sum + k[sum & 3]); in mbedtls_test_rnd_pseudo_rand()
126 + info->v0) ^ (sum + k[(sum>>11) & 3]); in mbedtls_test_rnd_pseudo_rand()
/lib/lwip/lwip/src/core/
A Dmem.c100 u16_t k; in mem_overflow_check_raw() local
105 for (k = 0; k < MEM_SANITY_REGION_AFTER_ALIGNED; k++) { in mem_overflow_check_raw()
106 if (m[k] != 0xcd) { in mem_overflow_check_raw()
116 for (k = 0; k < MEM_SANITY_REGION_BEFORE_ALIGNED; k++) { in mem_overflow_check_raw()
117 if (m[k] != 0xcd) { in mem_overflow_check_raw()
/lib/mbedtls/external/mbedtls/3rdparty/p256-m/p256-m/
A Dp256-m.c1337 uint32_t xr[8], k[8], t3[8], t4[8]; in p256_ecdsa_sign() local
1343 ret = scalar_gen_with_pub(kb, k, xr, t3); /* xr = x_coord(k * G) */ in p256_ecdsa_sign()
1346 m256_prep(k, &p256_n); in p256_ecdsa_sign()
1376 m256_inv(k, k, &p256_n); /* k^-1 */ in p256_ecdsa_sign()
1379 m256_mul(t4, k, t4, &p256_n); /* t4 = s = k^-1 * (e + r * dU) */ in p256_ecdsa_sign()
1380 zeroize(k, sizeof k); in p256_ecdsa_sign()
/lib/lwip/lwip/contrib/apps/LwipMibCompiler/SharpSnmpLib/Mib/
A DLexer.cs484 for (int k=i+1; k<result.Count; k++) in DecodeRanges()
486 …startSymbol.Assert(!result[i].IntersectsWith(result[k]), "Invalid range declaration! Overlapping o… in DecodeRanges()
/lib/zlib/
A Dtrees.c146 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
458 local void pqdownheap(s, tree, k) in pqdownheap() argument
461 int k; /* node to move down */
463 int v = s->heap[k];
464 int j = k << 1; /* left son of k */
475 s->heap[k] = s->heap[j]; k = j;
480 s->heap[k] = v;
/lib/mbedtls/external/mbedtls/tests/data_files/parse_input/
A Dcrl-rsa-pss-sha384.pem13 y9o/ghYF/shKU4mewK3DeM9gQiTcH5A4ISXR87hBQ08AKJRAG1CLvTyzqWiUUY+k

Completed in 459 milliseconds

12