Searched refs:count2 (Results 1 - 25 of 74) sorted by relevance

123

/external/pdfium/fxbarcode/qrcode/
H A DBC_QRCoderECBlocksData.h16 uint8_t count2; member in struct:CBC_QRCoderECBlockData
H A DBC_QRCoderECBlocks.cpp37 return m_data.count1 + m_data.count2;
46 m_data.count2 * (m_data.dataCodeWords2 + GetECCodeWordsPerBlock());
/external/valgrind/drd/tests/
H A Dpth_detached_sem.c44 const int count2 = argc > 2 ? atoi(argv[2]) : 100; local
45 int thread_arg[count1 > count2 ? count1 : count2];
50 for (i = 0; i < count1 || i < count2; i++)
67 // Create count2 detached threads by letting the threads detach themselves.
71 for (i = 0; i < count2; i++)
79 for (i = 0; i < count1 + count2; i++)
H A Dpth_detached.c40 const int count2 = argc > 2 ? atoi(argv[2]) : 100; local
60 // Create count2 detached threads by letting the threads detach themselves.
64 for (i = 0; i < count2; i++)
73 while (s_finished_count < count1 + count2) {
/external/autotest/client/site_tests/hardware_PerfCallgraphVerification/src/
H A Dgraph.c20 float count2 = 0; local
29 count2 += count;
31 printf("%f", count2);
/external/tensorflow/tensorflow/contrib/slim/python/slim/data/
H A Dparallel_reader_test.py56 count2 = 0
71 count2 += 1
75 self.assertGreater(count2, 0)
76 self.assertEquals(count0 + count1 + count2, num_reads)
96 count2 = 0
115 count2 += 1
121 self.assertEquals(count2, num_records_per_file)
127 count0 + count1 + count2,
/external/mesa3d/src/gallium/drivers/swr/rasterizer/core/
H A Drdtsc_core.h101 void rdtscEvent(uint32_t bucketId, uint32_t count1, uint32_t count2);
109 #define RDTSC_EVENT(bucket, count1, count2) rdtscEvent(bucket, count1, count2)
116 #define RDTSC_EVENT(bucket, count1, count2)
161 INLINE void rdtscEvent(uint32_t bucketId, uint32_t count1, uint32_t count2) argument
/external/dng_sdk/source/
H A Ddng_utils.cpp457 uint32 count2 = tile.W (); local
467 count2,
482 for (uint32 col = 0; col < count2; col++)
498 for (uint32 col = 0; col < count2; col++)
590 uint32 count2 = fDstImage.Planes (); local
614 count2,
648 memcpy (dPtr1, sPtr1, count2 * (uint32) sizeof (real32));
660 for (uint32 index2 = 0; index2 < count2; index2++)
683 for (uint32 index2 = 0; index2 < count2; index2++)
705 for (uint32 index2 = 0; index2 < count2; index
[all...]
H A Ddng_pixel_buffer.cpp46 uint32 &count2,
63 Abs_int32 (sStep2) * (count2 - 1);
67 Abs_int32 (dStep2) * (count2 - 1);
104 (((const uint8 *) sPtr) + (int32)(count2 - 1) * sStep2 * (int32)sPixelSize);
107 (((uint8 *) dPtr) + (int32)(count2 - 1) * dStep2 * (int32)dPixelSize);
155 (((const uint8 *) sPtr) + (int32)(count2 - 1) * sStep2 * (int32)sPixelSize);
158 (((uint8 *) dPtr) + (int32)(count2 - 1) * dStep2 * (int32)dPixelSize);
173 if (count2 == 1) step2 = 0xFFFFFFFF;
235 count [2] = count2;
239 count2
40 OptimizeOrder(const void *&sPtr, void *&dPtr, uint32 sPixelSize, uint32 dPixelSize, uint32 &count0, uint32 &count1, uint32 &count2, int32 &sStep0, int32 &sStep1, int32 &sStep2, int32 &dStep0, int32 &dStep1, int32 &dStep2) argument
277 OptimizeOrder(const void *&sPtr, uint32 sPixelSize, uint32 &count0, uint32 &count1, uint32 &count2, int32 &sStep0, int32 &sStep1, int32 &sStep2) argument
311 OptimizeOrder(void *&dPtr, uint32 dPixelSize, uint32 &count0, uint32 &count1, uint32 &count2, int32 &dStep0, int32 &dStep1, int32 &dStep2) argument
[all...]
H A Ddng_fingerprint.h367 uint32 count2,
376 Process (data, count2);
378 fNextOffset += count2;
366 DoWrite(const void *data, uint32 count2, uint64 offset) argument
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/compression/
H A DDecompressionTest.java46 int count1 = 0, count2 = 0;
60 count2 = myDecompressor.decompress(segment2, 0, segment2.length,
66 "decompressed into " + count2 + " chars");
70 logln(charBuffer, count1, count2);
72 s.append(charBuffer, count1, count2);
75 logln(charBuffer, 0, count1 + count2);
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/compression/
H A DDecompressionTest.java43 int count1 = 0, count2 = 0;
57 count2 = myDecompressor.decompress(segment2, 0, segment2.length,
63 "decompressed into " + count2 + " chars");
67 logln(charBuffer, count1, count2);
69 s.append(charBuffer, count1, count2);
72 logln(charBuffer, 0, count1 + count2);
/external/eigen/bench/perf_monitoring/gemm/
H A Drun.sh62 count2=`echo $2 | wc -w`
64 if [ $count1 == $count2 ]; then
/external/freetype/src/pshinter/
H A Dpshrec.c380 FT_UInt count2 = mask2->num_bits; local
384 count = FT_MIN( count1, count2 );
429 FT_UInt count2 = mask2->num_bits; local
433 if ( count2 > 0 )
440 /* if "count2" is greater than "count1", we need to grow the */
442 if ( count2 > count1 )
444 error = ps_mask_ensure( mask1, count2, memory );
448 for ( pos = count1; pos < count2; pos++ )
455 pos = ( count2 + 7 ) >> 3;
1004 FT_UInt count2 local
1049 FT_UInt count2 = dim[1].hints.num_hints; local
[all...]
/external/curl/lib/
H A Dftp.h142 int count2; /* general purpose counter for the state machine */ member in struct:ftp_conn
/external/freetype/src/sfnt/
H A Dttkern.c266 FT_UInt count2; local
269 for ( count2 = num_pairs; count2 > 0; count2-- )
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
H A DCollationWeights.java509 // Calculate how to split the range between minLength (count1) and minLength+1 (count2).
511 // count1 + count2 * nextCountBytes = n
512 // count1 + count2 = count
514 // (count - count2) + count2 * nextCountBytes = n
515 // and then into the following count1 & count2 computations.
516 int count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened
517 int count1 = count - count2; // number of minLength weights
518 if(count2 == 0 || (count1 + count2 * nextCountByte
[all...]
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationWeights.java507 // Calculate how to split the range between minLength (count1) and minLength+1 (count2).
509 // count1 + count2 * nextCountBytes = n
510 // count1 + count2 = count
512 // (count - count2) + count2 * nextCountBytes = n
513 // and then into the following count1 & count2 computations.
514 int count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened
515 int count1 = count - count2; // number of minLength weights
516 if(count2 == 0 || (count1 + count2 * nextCountByte
[all...]
/external/icu/icu4c/source/test/intltest/
H A Dtchcfmt.cpp504 int32_t count2 = 0;
505 const double *limits2 = fmt2.getLimits(count2);
506 const UBool *closures2 = fmt2.getClosures(count2);
508 if((count2 != 6) || !limits2 || !closures2) {
511 for(i=0;i<count2;i++) {
513 i, count2,
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_destroy/
H A D2-1.c207 int count2; /* number of children currently waiting (2nd pass) */ member in struct:__anon15240
278 td->count2++;
280 timed = td->count2 & 1;
536 td->count2 = 0;
677 ch = td->count2;
691 ch = td->count2;
/external/icu/icu4c/source/i18n/
H A Dcollationweights.cpp446 // Calculate how to split the range between minLength (count1) and minLength+1 (count2).
448 // count1 + count2 * nextCountBytes = n
449 // count1 + count2 = count
451 // (count - count2) + count2 * nextCountBytes = n
452 // and then into the following count1 & count2 computations.
453 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened local
454 int32_t count1 = count - count2; // number of minLength weights
455 if(count2 == 0 || (count1 + count2 * nextCountByte
[all...]
/external/python/cpython2/Lib/bsddb/test/
H A Dtest_thread.py135 count2=count
143 count2-=1
144 if not count2 :
146 count2=count
262 count2=count
271 count2-=1
272 if not count2 :
274 count2=count
/external/pcre/dist2/src/
H A Dpcre2_substring.c375 int i, count, count2; local
386 count2 = 2*count;
391 for (i = 0; i < count2; i += 2)
414 for (i = 0; i < count2; i += 2)
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/net/
H A DExcludedProxyTest.java82 int count2 = 0;
83 while ((count2 = is2.read(b2)) > 0)
84 response2 += new String(b2, 0, count2);
/external/google-breakpad/src/testing/test/
H A Dgmock_stress_test.cc216 int count2 = 0; local
217 const Helper1Param param2 = { &foo, &count2 };
221 EXPECT_EQ(kRepeat, count1 + count2);

Completed in 1516 milliseconds

123