| /external/pdfium/fxbarcode/qrcode/ |
| BC_QRCoderECBlocksData.h | 14 uint8_t count1; member in struct:CBC_QRCoderECBlockData
|
| BC_QRCoderECBlocks.cpp | 37 return m_data.count1 + m_data.count2;
45 return m_data.count1 * (m_data.dataCodeWords1 + GetECCodeWordsPerBlock()) +
|
| /external/valgrind/drd/tests/ |
| pth_detached_sem.c | 43 const int count1 = argc > 1 ? atoi(argv[1]) : 100; local
45 int thread_arg[count1 > count2 ? count1 : count2];
50 for (i = 0; i < count1 || i < count2; i++)
60 // Create count1 detached threads by setting the "detached" property via
62 for (i = 0; i < count1; i++)
79 for (i = 0; i < count1 + count2; i++)
|
| pth_detached.c | 39 const int count1 = argc > 1 ? atoi(argv[1]) : 100; local
53 // Create count1 detached threads by setting the "detached" property via
55 for (i = 0; i < count1; i++)
73 while (s_finished_count < count1 + count2) {
|
| /art/runtime/arch/ |
| memcmp16_test.cc | 55 size_t count1, count2; local
63 count1 = (r.next() % max_length) + min_length;
68 count1 = (r.next() % max_length) + min_length;
73 count1 = 0U;
78 count1 = 0U;
88 if (count1 > 0U) {
89 s1 = new uint16_t[count1];
102 size_t min = count1 < count2 ? count1 : count2;
110 for (size_t i = min; i < count1; ++i)
[all...] |
| /art/runtime/ |
| jobject_comparator.cc | 47 const size_t count1 = obj1->SizeOf(); local
49 if (count1 != count2) {
50 return count1 < count2;
|
| barrier_test.cc | 30 CheckWaitTask(Barrier* barrier, AtomicInteger* count1, AtomicInteger* count2)
32 count1_(count1),
66 AtomicInteger count1(0);
69 thread_pool.AddTask(self, new CheckWaitTask(&barrier, &count1, &count2));
72 while (count1.LoadRelaxed() != num_threads) {
82 EXPECT_EQ(count1.LoadRelaxed(), num_threads);
|
| /art/test/133-static-invoke-super/src/ |
| Main.java | 41 int count1 = testBasis(50000000); local
46 System.out.println("basis: performed " + count1 + " iterations");
49 double basisMsec = (time1 - time0) / (double) count1 / 1000000;
|
| /packages/apps/Contacts/src/com/android/contacts/format/ |
| FormatUtils.java | 64 int count1 = array1.length; local
68 while (count1 > 0 && count2 > 0 && array1[count1 - 1] == array2[count2 - 1]) {
69 count1--;
74 for (int i = 0; i < count1; i++) {
75 if (i + size > count1) {
76 size = count1 - i;
|
| /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)
164 gBucketMgr.AddEvent(id, count1);
|
| /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 | 675 int count1 = 0; // Number of times in a row that first run won
687 count1 = 0;
692 count1++;
697 } while ((count1 | count2) < minGallop);
706 count1 = gallopRight((Comparable) a[cursor2], tmp, cursor1, len1, 0);
707 if (count1 != 0) {
708 System.arraycopy(tmp, cursor1, a, dest, count1);
709 dest += count1;
710 cursor1 += count1;
711 len1 -= count1;
[all...] |
| TimSort.java | 708 int count1 = 0; // Number of times in a row that first run won
720 count1 = 0;
725 count1++;
730 } while ((count1 | count2) < minGallop);
739 count1 = gallopRight(a[cursor2], tmp, cursor1, len1, 0, c);
740 if (count1 != 0) {
741 System.arraycopy(tmp, cursor1, a, dest, count1);
742 dest += count1;
743 cursor1 += count1;
744 len1 -= count1;
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/compression/ |
| DecompressionTest.java | 46 int count1 = 0, count2 = 0; local
48 count1 = myDecompressor.decompress(segment1, 0, segment1.length,
53 "decompressed into " + count1 + " chars");
57 logln(charBuffer, 0, count1);
58 s.append(charBuffer, 0, count1);
62 charBuffer, count1,
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
45 count1 = myDecompressor.decompress(segment1, 0, segment1.length,
50 "decompressed into " + count1 + " chars");
54 logln(charBuffer, 0, count1);
55 s.append(charBuffer, 0, count1);
59 charBuffer, count1,
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 | 61 count1=`echo $1 | wc -w`
64 if [ $count1 == $count2 ]; then
67 for (( i=0 ; i<$count1 ; i++ )); do
|
| /external/tensorflow/tensorflow/contrib/slim/python/slim/data/ |
| parallel_reader_test.py | 55 count1 = 0
69 count1 += 1
74 self.assertGreater(count1, 0)
76 self.assertEquals(count0 + count1 + count2, num_reads)
95 count1 = 0
113 count1 += 1
120 self.assertEquals(count1, num_records_per_file)
127 count0 + count1 + count2,
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_destroy/ |
| 2-1.c | 206 int count1; /* number of children currently waiting (1st pass) */ member in struct:__anon28585
231 td->count1++;
233 timed = td->count1 & 1;
261 td->count1--;
535 td->count1 = 0;
576 ch = td->count1;
590 ch = td->count1;
641 ch = td->count1;
655 ch = td->count1;
|
| /external/dng_sdk/source/ |
| dng_pixel_buffer.cpp | 45 uint32 &count1,
62 Abs_int32 (sStep1) * (count1 - 1) +
66 Abs_int32 (dStep1) * (count1 - 1) +
90 (((const uint8 *) sPtr) + (int32)(count1 - 1) * sStep1 * (int32)sPixelSize);
93 (((uint8 *) dPtr) + (int32)(count1 - 1) * dStep1 * (int32)dPixelSize);
141 (((const uint8 *) sPtr) + (int32)(count1 - 1) * sStep1 * (int32)sPixelSize);
144 (((uint8 *) dPtr) + (int32)(count1 - 1) * dStep1 * (int32)dPixelSize);
172 if (count1 == 1) step1 = 0xFFFFFFFF;
234 count [1] = count1;
238 count1 = count [index1]
[all...] |
| dng_utils.cpp | 456 uint32 count1 = tile.H (); local
466 count1,
476 for (uint32 row = 0; row < count1; row++)
589 uint32 count1 = tile.W (); local
613 count1,
636 for (uint32 index1 = 0; index1 < count1; index1++)
|
| /external/curl/lib/ |
| ftp.h | 72 FTP_PORT, /* generic state for PORT, LPRT and EPRT, check count1 */
74 FTP_PASV, /* generic state for PASV and EPSV, check count1 */
141 int count1; /* general purpose counter for the state machine */ member in struct:ftp_conn
|
| /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
515 // and then into the following count1 & count2 computations.
517 int count1 = count - count2; // number of minLength weights local
518 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) {
521 --count1;
522 assert((count1 + count2 * nextCountBytes) >= n);
527 if(count1 == 0) {
536 // splitRange, rangeCount, count1, count2)
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationWeights.java | 507 // Calculate how to split the range between minLength (count1) and minLength+1 (count2).
509 // count1 + count2 * nextCountBytes = n
510 // count1 + count2 = count
513 // and then into the following count1 & count2 computations.
515 int count1 = count - count2; // number of minLength weights local
516 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) {
519 --count1;
520 assert((count1 + count2 * nextCountBytes) >= n);
525 if(count1 == 0) {
534 // splitRange, rangeCount, count1, count2)
[all...] |
| /external/freetype/src/pshinter/ |
| pshrec.c | 379 FT_UInt count1 = mask1->num_bits; local
384 count = FT_MIN( count1, count2 );
428 FT_UInt count1 = mask1->num_bits; local
440 /* if "count2" is greater than "count1", we need to grow the */
442 if ( count2 > count1 )
448 for ( pos = count1; pos < count2; pos++ )
1003 FT_UInt count1 = dim[0].hints.num_hints; local
1008 if ( bit_count != count1 + count2 )
1012 bit_count, count1 + count2 ));
1019 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1,
1048 FT_UInt count1 = dim[0].hints.num_hints; local
[all...] |
| /external/guice/core/test/com/google/inject/ |
| ProvisionListenerTest.java | 215 final Counter count1 = new Counter(); local
219 bindListener(Matchers.any(), count1);
225 assertEquals(1, count1.count);
229 count1.count = 0;
231 assertEquals(0, count1.count);
235 final Counter count1 = new Counter(); local
240 bindListener(Matchers.any(), count1);
245 assertEquals(1, count1.count);
250 final Counter count1 = new Counter(); local
255 bindListener(Matchers.any(), count1, new FailBeforeProvision(), count2)
276 final Counter count1 = new Counter(); local
[all...] |
