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

123

/external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/tests/
H A Dnasmpp-nested.asm19 %ASSIGN %%count2 4
20 %error %%count1 %%count2
22 %REP %%count2
/external/valgrind/main/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/chromium_org/third_party/icu/source/i18n/
H A Ducol_wgt.h30 uint32_t count2; member in struct:WeightRange
H A Ducol_wgt.cpp129 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...]
/external/linux-tools-perf/perf-3.12.0/tools/perf/tests/
H A Dbp_signal.c115 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/
H A DIntersections.h33 SkDEBUGCODE(int count2 = 0;)
40 ++count2;
44 SkASSERT(count == count2);
/external/skia/experimental/Intersection/
H A DIntersections.h33 SkDEBUGCODE(int count2 = 0;)
40 ++count2;
44 SkASSERT(count == count2);
/external/qemu/distrib/sdl-1.2.15/src/joystick/macos/
H A DSDL_sysjoystick.c154 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/
H A Didl_lexer_test.py54 count2 = len(tokens2)
55 self.assertEqual(count1, count2)
/external/skia/src/gpu/
H A DGrTextStrike.cpp172 int count2 = 0; local
175 count2 += 1;
178 SkASSERT(count == count2);
180 count2 = 0;
183 count2 += 1;
186 SkASSERT(count == count2);
/external/chromium_org/content/test/data/indexeddb/
H A Dcursor_prefetch.js279 count2 = 0;
316 shouldBe("count2", "kNumberOfItems");
324 if (cursor2.key !== count2)
325 shouldBe("cursor2.key", "count2");
326 if (cursor2.value !== count2)
327 shouldBe("cursor2.value", "count2");
329 ++count2;
331 if (count2 % 20 === 0) {
/external/chromium_org/ppapi/generators/
H A Didl_lexer.py278 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/
H A Dsrec_debug.c80 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/
H A DGrTextStrike.cpp179 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/
H A Dcollationweights.cpp419 // 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 * nextCountByte
[all...]
/external/chromium_org/third_party/freetype/src/pshinter/
H A Dpshrec.c383 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 local
1054 FT_UInt count2 = dim[1].hints.num_hints; local
[all...]
/external/freetype/src/pshinter/
H A Dpshrec.c383 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 local
1054 FT_UInt count2 = dim[1].hints.num_hints; local
[all...]
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/pshinter/
H A Dpshrec.c383 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 local
1054 FT_UInt count2 = dim[1].hints.num_hints; local
[all...]
/external/chromium_org/third_party/freetype/src/sfnt/
H A Dttkern.c261 FT_UInt count2; local
264 for ( count2 = num_pairs; count2 > 0; count2-- )
/external/freetype/src/sfnt/
H A Dttkern.c261 FT_UInt count2; local
264 for ( count2 = num_pairs; count2 > 0; count2-- )
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/sfnt/
H A Dttkern.c261 FT_UInt count2; local
264 for ( count2 = num_pairs; count2 > 0; count2-- )
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/resources/
H A Dsunspider-compare-results.js29 var count2 = output2.length;
51 itemTotals2.length = count2;
131 for (var i = 0; i < count2; i++) {
301 var df = count1 + count2 - 2;
326 return result + pad(diffSummary, 18) + formatMean(meanWidth1, mean1, stdErr1, count1) + " " + formatMean(meanWidth2, mean2, stdErr2, count2) + diffDetail;
371 mean2 = computeMeans(count2, total2, categoryTotals2, categoryMeans2, testTotalsByCategory2, testMeansByCategory2);
377 stdErr2 = computeStdErrors(count2, stdDev2, categoryStdErrs2, categoryStdDevs2, testStdErrsByCategory2, testStdDevsByCategory2);
/external/qemu/android/utils/
H A Dstralloc.c303 int count2; local
314 count2 = 4 + 3*(max_count - count);
315 stralloc_readyplus( s, count2 );
316 memset( s->s + s->n, ' ', count2 );
317 s->n += count2;
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dtchcfmt.cpp503 int32_t count2 = 0;
504 const double *limits2 = fmt2.getLimits(count2);
505 const UBool *closures2 = fmt2.getClosures(count2);
507 if((count2 != 6) || !limits2 || !closures2) {
510 for(i=0;i<count2;i++) {
512 i, count2,

Completed in 1706 milliseconds

123