HomeSort by relevance Sort by last modified time
    Searched refs:sizes (Results 1 - 25 of 325) 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:__anon7196
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/webkit/Source/WebCore/platform/chromium/
SSLKeyGeneratorChromium.cpp 43 void getSupportedKeySizes(Vector<String>& sizes)
45 sizes.resize(2);
46 sizes[0] = keygenMenuHighGradeKeySize();
47 sizes[1] = keygenMenuMediumGradeKeySize();
  /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/webkit/Source/WebCore/platform/
SSLKeyGenerator.h 36 // Returns strings representing key sizes that may be used
39 void getSupportedKeySizes(Vector<String>& sizes);
  /external/openssl/crypto/bn/
bnspeed.c 165 static int sizes[NUM_SIZES]={128,256,512,1024,2048}; variable
166 /*static int sizes[NUM_SIZES]={59,179,299,419,539}; */
193 BN_rand(a,sizes[i],1,0);
196 BN_rand(b,sizes[j],1,0);
201 printf("mul %4d x %4d -> %8.3fms\n",sizes[i],sizes[j],tm*1000.0/num);
209 BN_rand(a,sizes[i],1,0);
214 printf("sqr %4d x %4d -> %8.3fms\n",sizes[i],sizes[i],tm*1000.0/num);
221 BN_rand(a,sizes[i]-1,1,0)
    [all...]
expspeed.c 194 static int sizes[NUM_SIZES]={128,256,512,1024,2048,4096,8192}; variable
196 /*static int sizes[NUM_SIZES]={59,179,299,419,539}; */
245 if (!BN_generate_prime(c,sizes[i],0,ADD,REM,genprime_cb,NULL)) goto err;
254 if (!BN_pseudo_rand(a,sizes[i],1,0)) goto err;
256 if (!BN_pseudo_rand(b,sizes[i],1,0)) goto err;
259 if (!BN_pseudo_rand(c,sizes[i],1,1)) goto err;
328 sizes[i],sizes[i],sizes[i],tm*1000.0/num,tm*mul_c[i]/num, num);
  /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/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/mdat/
SampleList.java 19 long[] sizes; field in class:SampleList
55 sizes = new long[l2i(sampleSizeBox.getSampleCount())];
56 Arrays.fill(sizes, sampleSizeBox.getSampleSize());
58 sizes = sampleSizeBox.getSampleSizes();
60 offsets = new long[sizes.length];
66 long sampleSize = sizes[sampleIndex];
90 if (sizes == null || offsets == null) {
91 sizes = new long[0];
98 // We have now a map from all sample offsets to their sizes
105 long[] nuSizes = new long[sizes.length + keys.size()]
    [all...]
  /external/chromium/chrome/common/
web_apps_unittest.cc 167 // Sizes.
174 std::vector<gfx::Size> sizes; local
175 bool result = web_apps::ParseIconSizes(ASCIIToUTF16(data[i].input), &sizes,
180 ASSERT_EQ(data[i].expected_size_count, sizes.size());
181 if (!sizes.empty()) {
182 ASSERT_EQ(data[i].width1, sizes[0].width());
183 ASSERT_EQ(data[i].height1, sizes[0].height());
185 if (sizes.size() > 1) {
186 ASSERT_EQ(data[i].width2, sizes[1].width());
187 ASSERT_EQ(data[i].height2, sizes[1].height())
    [all...]
  /external/regex-re2/benchlog/
mktable 21 @sizes = (
48 for(my $i=0; $i<@sizes; $i++) {
49 my $key = sprintf("%s%s/%s", $name, $who, $sizes[$i]);
62 my $n = @sizes;
65 for($i=0; $i<@sizes; $i+=3) {
66 printf JGR " hash_at $i hash_label at $i : $sizes[$i]\n";
  /external/skia/tests/
StreamTest.cpp 105 const size_t sizes[] = { local
114 char buffer[sizeof(sizes) * 4];
117 for (i = 0; i < SK_ARRAY_COUNT(sizes); ++i) {
118 bool success = wstream.writePackedUInt(sizes[i]);
124 for (i = 0; i < SK_ARRAY_COUNT(sizes); ++i) {
126 if (sizes[i] != n) {
127 SkDebugf("-- %d: sizes:%x n:%x\n", i, sizes[i], n);
129 REPORTER_ASSERT(reporter, sizes[i] == n);
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/ui/
IconButton.java 127 int[] sizes = getGoodIconSideSize(); local
128 if (sizes != null && sizes.length >= 2 && sizes[0] > 0 && sizes[1] > 0) {
129 return setImageIcon(makeImageIcon(image, sizes[0], sizes[1]));
  /frameworks/base/core/tests/coretests/src/android/text/
DynamicLayoutBlocksTest.java 69 private void assertState(int[] sizes, int[] indices) {
72 assertEquals(sizes.length, dl.getNumberOfBlocks());
75 int[] ends = new int[sizes.length];
77 ends[i] = i == 0 ? (sizes[0] == 0 ? 0 : sizes[0] - 1) : ends[i - 1] + sizes[i];
86 private void assertState(int[] sizes) {
87 int[] ids = new int[sizes.length];
88 for (int i = 0; i < sizes.length; i++) {
91 assertState(sizes, ids)
    [all...]
  /build/tools/
compare_fileslist.py 47 for fn,sizes in data.iteritems():
50 if sizes.has_key(i):
51 row.append(sizes[i])
check_builds.sh 28 # test-builds/sizes.html that has a pretty chart of which files are
30 # that are missing are red, and rows where the file sizes are not all
68 build/tools/compare_fileslist.py $inputs > $TEST_BUILD_DIR/sizes.html
90 build/tools/compare_fileslist.py $inputs > $TEST_BUILD_DIR/sizes.html
  /ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.gslice.array/gslice.array.assign/
gslice_array.pass.cpp 33 typedef std::valarray<std::size_t> sizes; typedef
35 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
37 = v2[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
  /external/clang/lib/AST/
ExternalASTSource.cpp 62 void ExternalASTSource::getMemoryBufferSizes(MemoryBufferSizes &sizes) const { }
  /external/eigen/test/
geo_alignedbox.cpp 105 VERIFY_IS_APPROX(sides, box.sizes() );
106 VERIFY_IS_APPROX(sides[1], box.sizes()[1] );
107 VERIFY_IS_APPROX(sides[1], box.sizes().maxCoeff() );
108 VERIFY_IS_APPROX(sides[0], box.sizes().minCoeff() );
132 VERIFY_IS_APPROX(sides, box.sizes() );
133 VERIFY_IS_APPROX(sides[1], box.sizes()[1] );
134 VERIFY_IS_APPROX(sides[1], box.sizes().maxCoeff() );
135 VERIFY_IS_APPROX(sides[0], box.sizes().minCoeff() );
  /ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.gslice.array/gslice.array.fill/
assign_value.pass.cpp 28 typedef std::valarray<std::size_t> sizes; typedef
30 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
  /ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.assign/
gslice_array_assign.pass.cpp 28 typedef std::valarray<std::size_t> sizes; typedef
31 v = v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
  /ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.cons/
gslice_array.pass.cpp 28 typedef std::valarray<std::size_t> sizes; typedef
30 std::valarray<int> v(v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
  /ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.sub/
gslice_non_const.pass.cpp 28 typedef std::valarray<std::size_t> sizes; typedef
30 std::valarray<int> v(v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
  /external/v8/test/mjsunit/
large-object-literal.js 28 // Test that we can create object literals of various sizes.
49 // The sizes to test.
50 var sizes = [0, 1, 2, 100, 200, 400, 1000]; variable
53 for (var i = 0; i < sizes.length; i++) {
54 testLiteral(sizes[i]);
  /external/eigen/Eigen/src/SparseCore/
SparsePermutation.h 60 VectorXi sizes(m_matrix.outerSize());
64 sizes[((Side==OnTheLeft) ^ Transposed) ? jp : j] = m_matrix.innerVector(((Side==OnTheRight) ^ Transposed) ? jp : j).size();
66 tmp.reserve(sizes);
80 VectorXi sizes(tmp.outerSize());
81 sizes.setZero();
90 sizes[perm.indices().coeff(it.index())]++;
91 tmp.reserve(sizes);

Completed in 363 milliseconds

1 2 3 4 5 6 7 8 91011>>