| /external/pdfium/fxbarcode/qrcode/ |
| BC_QRCoderECBlocksData.h | 16 uint8_t count2; member in struct:CBC_QRCoderECBlockData
|
| BC_QRCoderECBlocks.cpp | 37 return m_data.count1 + m_data.count2;
46 m_data.count2 * (m_data.dataCodeWords2 + GetECCodeWordsPerBlock());
|
| /external/valgrind/drd/tests/ |
| pth_detached_sem.c | 44 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++)
|
| pth_detached.c | 40 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) {
|
| /art/runtime/arch/ |
| memcmp16_test.cc | 55 size_t count1, count2; local
64 count2 = (r.next() % max_length) + min_length;
69 count2 = 0U;
74 count2 = (r.next() % max_length) + min_length;
79 count2 = 0U;
95 if (count2 > 0U) {
96 s2 = new uint16_t[count2];
102 size_t min = count1 < count2 ? count1 : count2;
113 for (size_t i = min; i < count2; ++i)
[all...] |
| /art/runtime/ |
| jobject_comparator.cc | 48 const size_t count2 = obj2->SizeOf(); local
49 if (count1 != count2) {
50 return count1 < count2;
|
| barrier_test.cc | 30 CheckWaitTask(Barrier* barrier, AtomicInteger* count1, AtomicInteger* count2)
33 count2_(count2) {}
67 AtomicInteger count2(0);
69 thread_pool.AddTask(self, new CheckWaitTask(&barrier, &count1, &count2));
76 EXPECT_EQ(0, count2.LoadRelaxed());
83 EXPECT_EQ(count2.LoadRelaxed(), num_threads);
|
| /external/autotest/client/site_tests/hardware_PerfCallgraphVerification/src/ |
| graph.c | 20 float count2 = 0; local
29 count2 += count;
31 printf("%f", count2);
|
| /art/test/133-static-invoke-super/src/ |
| Main.java | 43 int count2 = testStatic(50000000); local
47 System.out.println("test1: performed " + count2 + " iterations");
50 double msec1 = (time2 - time1) / (double) count2 / 1000000;
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/util/leak/ |
| TrackedCollections.java | 86 private float ratePerHour(long uptime1, int count1, long uptime2, int count2) {
87 if (uptime1 >= uptime2 || count1 < 0 || count2 < 0) {
90 return ((float) count2 - count1) / (uptime2 - uptime1) * 60 * MILLIS_IN_MINUTE;
|
| /libcore/ojluni/src/main/java/java/util/ |
| ComparableTimSort.java | 676 int count2 = 0; // Number of times in a row that second run won
686 count2++;
693 count2 = 0;
697 } while ((count1 | count2) < minGallop);
719 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0);
720 if (count2 != 0) {
721 System.arraycopy(a, cursor2, a, dest, count2);
722 dest += count2;
723 cursor2 += count2;
724 len2 -= count2;
[all...] |
| TimSort.java | 709 int count2 = 0; // Number of times in a row that second run won
719 count2++;
726 count2 = 0;
730 } while ((count1 | count2) < minGallop);
752 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c);
753 if (count2 != 0) {
754 System.arraycopy(a, cursor2, a, dest, count2);
755 dest += count2;
756 cursor2 += count2;
757 len2 -= count2;
[all...] |
| /external/mesa3d/src/gallium/drivers/swr/rasterizer/core/ |
| rdtsc_core.h | 101 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)
|
| /packages/apps/Contacts/src/com/android/contacts/format/ |
| FormatUtils.java | 65 int count2 = array2.length; local
68 while (count1 > 0 && count2 > 0 && array1[count1 - 1] == array2[count2 - 1]) {
70 count2--;
73 int size = count2;
|
| /external/tensorflow/tensorflow/contrib/slim/python/slim/data/ |
| parallel_reader_test.py | 56 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/dng_sdk/source/ |
| dng_utils.cpp | 457 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; index2++
[all...] |
| dng_fingerprint.h | 367 uint32 count2,
376 Process (data, count2);
378 fNextOffset += count2;
|
| dng_pixel_buffer.cpp | 46 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 = count [index2]
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/compression/ |
| DecompressionTest.java | 46 int count1 = 0, count2 = 0; local
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/ |
| DecompressionTest.java | 43 int count1 = 0, count2 = 0; local
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/ |
| run.sh | 62 count2=`echo $2 | wc -w`
64 if [ $count1 == $count2 ]; then
|
| /external/freetype/src/pshinter/ |
| pshrec.c | 380 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 = dim[1].hints.num_hints local
1049 FT_UInt count2 = dim[1].hints.num_hints; local
[all...] |
| /external/curl/lib/ |
| ftp.h | 142 int count2; /* general purpose counter for the state machine */ member in struct:ftp_conn
|
| /external/freetype/src/sfnt/ |
| ttkern.c | 266 FT_UInt count2; local
269 for ( count2 = num_pairs; count2 > 0; count2-- )
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| CollationWeights.java | 509 // 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 local
517 int count1 = count - count2; // number of minLength weights
518 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n)
[all...] |
