| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/tests/ |
| nasmpp-nested.asm | 19 %ASSIGN %%count2 4
20 %error %%count1 %%count2
22 %REP %%count2
|
| /external/valgrind/main/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 | 54 size_t count1, count2; local
63 count2 = (r.next() % max_length) + min_length;
68 count2 = 0U;
73 count2 = (r.next() % max_length) + min_length;
78 count2 = 0U;
94 if (count2 > 0U) {
95 s2 = new uint16_t[count2];
101 size_t min = count1 < count2 ? count1 : count2;
112 for (size_t i = min; i < count2; ++i)
[all...] |
| /art/runtime/ |
| jobject_comparator.cc | 47 size_t count2 = obj2->SizeOf(); local
48 if (count1 != count2) {
49 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/chromium_org/third_party/icu/source/i18n/ |
| ucol_wgt.h | 30 uint32_t count2; member in struct:WeightRange
|
| ucol_wgt.cpp | 129 range->count2*=countBytes;
366 /* set the length2 and count2 fields */
369 ranges[i].count2=(uint32_t)ranges[i].count;
380 lengthCounts[ranges[i].length2]+=ranges[i].count2;
389 maxCount+=ranges[rangeCount].count2;
396 } else if(n<=ranges[0].count2*countBytes) {
398 uint32_t count1, count2, power_1, power; local
402 /* calculate how to split the range between maxLength-1 (count1) and maxLength (count2) */
405 count2=(n+power-1)/power;
406 count1=ranges[0].count-count2;
[all...] |
| /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;
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/tests/ |
| bp_signal.c | 115 long long count1, count2; local
141 * - fd2 event breakpoint hit -> count2 == 1
169 count2 = bp_count(fd2);
174 pr_debug("count1 %lld, count2 %lld, overflow %d\n",
175 count1, count2, overflows);
187 if (count2 != 1)
190 return count1 == 1 && overflows == 1 && count2 == 1 ?
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| Intersections.h | 33 SkDEBUGCODE(int count2 = 0;)
40 ++count2;
44 SkASSERT(count == count2);
|
| /external/skia/experimental/Intersection/ |
| Intersections.h | 33 SkDEBUGCODE(int count2 = 0;)
40 ++count2;
44 SkASSERT(count == count2);
|
| /libcore/luni/src/main/java/java/util/ |
| ComparableTimSort.java | 642 int count2 = 0; // Number of times in a row that second run won
652 count2++;
659 count2 = 0;
663 } while ((count1 | count2) < minGallop);
685 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0);
686 if (count2 != 0) {
687 System.arraycopy(a, cursor2, a, dest, count2);
688 dest += count2;
689 cursor2 += count2;
690 len2 -= count2;
[all...] |
| TimSort.java | 675 int count2 = 0; // Number of times in a row that second run won
685 count2++;
692 count2 = 0;
696 } while ((count1 | count2) < minGallop);
718 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c);
719 if (count2 != 0) {
720 System.arraycopy(a, cursor2, a, dest, count2);
721 dest += count2;
722 cursor2 += count2;
723 len2 -= count2;
794 int count2 = 0; \/\/ Number of times in a row that second run won local
[all...] |
| /packages/apps/ContactsCommon/src/com/android/contacts/common/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/qemu/distrib/sdl-1.2.15/src/joystick/macos/ |
| SDL_sysjoystick.c | 154 UInt32 count, gotCount, count2; local
158 count2 = 0;
183 count2 += gotCount;
190 &(joystick->hwdata->refs[count2]));
194 count2 += gotCount;
201 &(joystick->hwdata->refs[count2]));
205 count2 += gotCount;
|
| /external/chromium_org/tools/idl_parser/ |
| idl_lexer_test.py | 54 count2 = len(tokens2)
55 self.assertEqual(count1, count2)
|
| /external/skia/src/gpu/ |
| GrTextStrike.cpp | 172 int count2 = 0; local
175 count2 += 1;
178 SkASSERT(count == count2);
180 count2 = 0;
183 count2 += 1;
186 SkASSERT(count == count2);
|
| /external/chromium_org/ppapi/generators/ |
| idl_lexer.py | 278 count2 = len(values2)
279 if count1 != count2:
280 print "Size mismatch original %d vs %d\n" % (count1, count2)
281 if count1 > count2: count1 = count2
|
| /external/srec/srec/crec/ |
| srec_debug.c | 80 int count, count2; local
87 count2 = count_fsmarc_token_list(rec, rec->active_fsmarc_tokens);
88 printf("number active: %d fsmnodes %d fsmarcs\n", count, count2);
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrTextStrike.cpp | 179 int count2 = 0; local
182 count2 += 1;
185 SkASSERT(count == count2);
187 count2 = 0;
190 count2 += 1;
193 SkASSERT(count == count2);
|
| /external/icu/icu4c/source/i18n/ |
| collationweights.cpp | 419 // Calculate how to split the range between minLength (count1) and minLength+1 (count2).
421 // count1 + count2 * nextCountBytes = n
422 // count1 + count2 = count
424 // (count - count2) + count2 * nextCountBytes = n
425 // and then into the following count1 & count2 computations.
426 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened local
427 int32_t count1 = count - count2; // number of minLength weights
428 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n)
[all...] |
| /external/chromium_org/third_party/freetype/src/pshinter/ |
| pshrec.c | 383 FT_UInt count2 = mask2->num_bits; local
387 count = FT_MIN( count1, count2 );
430 FT_UInt count2 = mask2->num_bits; local
434 if ( count2 > 0 )
441 /* if "count2" is greater than "count1", we need to grow the */
443 if ( count2 > count1 )
445 error = ps_mask_ensure( mask1, count2, memory );
449 for ( pos = count1; pos < count2; pos++ )
456 pos = (FT_UInt)( ( count2 + 7 ) >> 3 );
1009 FT_UInt count2 = dim[1].hints.num_hints local
1054 FT_UInt count2 = dim[1].hints.num_hints; local
[all...] |
| /external/freetype/src/pshinter/ |
| pshrec.c | 383 FT_UInt count2 = mask2->num_bits; local
387 count = FT_MIN( count1, count2 );
430 FT_UInt count2 = mask2->num_bits; local
434 if ( count2 > 0 )
441 /* if "count2" is greater than "count1", we need to grow the */
443 if ( count2 > count1 )
445 error = ps_mask_ensure( mask1, count2, memory );
449 for ( pos = count1; pos < count2; pos++ )
456 pos = (FT_UInt)( ( count2 + 7 ) >> 3 );
1009 FT_UInt count2 = dim[1].hints.num_hints local
1054 FT_UInt count2 = dim[1].hints.num_hints; local
[all...] |
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/pshinter/ |
| pshrec.c | 383 FT_UInt count2 = mask2->num_bits; local
387 count = FT_MIN( count1, count2 );
430 FT_UInt count2 = mask2->num_bits; local
434 if ( count2 > 0 )
441 /* if "count2" is greater than "count1", we need to grow the */
443 if ( count2 > count1 )
445 error = ps_mask_ensure( mask1, count2, memory );
449 for ( pos = count1; pos < count2; pos++ )
456 pos = (FT_UInt)( ( count2 + 7 ) >> 3 );
1009 FT_UInt count2 = dim[1].hints.num_hints local
1054 FT_UInt count2 = dim[1].hints.num_hints; local
[all...] |
