HomeSort by relevance Sort by last modified time
    Searched full:sizes (Results 1 - 25 of 2441) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/dropbear/libtommath/
bn_mp_prime_rabin_miller_trials.c 21 } sizes[] = { variable in typeref:struct:__anon6142
37 for (x = 0; x < (int)(sizeof(sizes)/(sizeof(sizes[0]))); x++) {
38 if (sizes[x].k == size) {
39 return sizes[x].t;
40 } else if (sizes[x].k > size) {
41 return (x == 0) ? sizes[0].t : sizes[x - 1].t;
44 return sizes[x-1].t + 1;
  /external/dropbear/libtommath/etc/
2kprime.c 5 int sizes[] = {256, 512, 768, 1024, 1536, 2048, 3072, 4096}; variable
19 for (x = 0; x < (int)(sizeof(sizes) / sizeof(sizes[0])); x++) {
21 mp_2expt(&q, sizes[x]);
31 printf("No primes of size %d found\n", sizes[x]);
65 ++sizes[x];
70 printf("\n\n%d-bits (k = %lu) = %s\n", sizes[x], z, buf);
71 fprintf(out, "%d-bits (k = %lu) = %s\n", sizes[x], z, buf); fflush(out);
drprime.c 4 int sizes[] = { 1+256/DIGIT_BIT, 1+512/DIGIT_BIT, 1+768/DIGIT_BIT, 1+1024/DIGIT_BIT, 1+2048/DIGIT_BIT, 1+4096/DIGIT_BIT }; variable
16 for (x = 0; x < (int)(sizeof(sizes)/sizeof(sizes[0])); x++) {
18 printf("Seeking a %d-bit safe prime\n", sizes[x] * DIGIT_BIT);
19 mp_grow(&a, sizes[x]);
21 for (y = 1; y < sizes[x]; y++) {
27 a.used = sizes[x];
46 printf("Error not DR modulus\n"); sizes[x] += 1; goto top;
  /external/dropbear/libtomcrypt/testprof/
ecc_test.c 5 static int sizes[] = { variable
47 for (x = 0; x < (int)(sizeof(sizes)/sizeof(sizes[0])); x++) {
50 if (sizes[z] < ltc_ecc_sets[z].size) break;
64 LTC_ARGCHK(yarrow_read(buf, sizes[x], &yarrow_prng) == sizes[x]);
65 DO(mp_read_unsigned_bin(rA, buf, sizes[x]));
66 LTC_ARGCHK(yarrow_read(buf, sizes[x], &yarrow_prng) == sizes[x]);
67 DO(mp_read_unsigned_bin(rB, buf, sizes[x]))
    [all...]
  /external/e2fsprogs/tests/f_16384_block/
expect.1 1 Pass 1: Checking inodes, blocks, and sizes
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_8192_block/
expect.1 1 Pass 1: Checking inodes, blocks, and sizes
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_bad_disconnected_inode/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_bad_local_jnl/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_badbblocks/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_baddir/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_baddir2/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_baddotdir/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_badinode/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_badjour_indblks/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_badjourblks/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_badorphan/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_badprimary/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_badroot/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_badsymlinks/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_badtable/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_bbfile/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_bbinode/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes
  /external/e2fsprogs/tests/f_big_sparse/
expect.2 1 Pass 1: Checking inodes, blocks, and sizes

Completed in 80 milliseconds

1 2 3 4 5 6 7 8 91011>>