Searched refs:count1 (Results 1 - 25 of 58) sorted by relevance

123

/external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/tests/
H A Dnasmpp-nested.asm2 %ASSIGN %%count1 4
3 %error %%count1
4 %REP %%count1
9 %ASSIGN %%count1 4
10 %error %%count1
11 %REP %%count1
18 %ASSIGN %%count1 4
20 %error %%count1 %%count2
21 %REP %%count1
/external/valgrind/main/drd/tests/
H A Dpth_detached_sem.c43 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++)
H A Dpth_detached.c39 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) {
/external/linux-tools-perf/perf-3.12.0/tools/perf/tests/
H A Dbp_signal.c115 long long count1, count2; local
139 * - fd1 event breakpoint hit -> count1 == 1
168 count1 = bp_count(fd1);
174 pr_debug("count1 %lld, count2 %lld, overflow %d\n",
175 count1, count2, overflows);
177 if (count1 != 1) {
178 if (count1 == 11)
181 pr_debug("failed: wrong count for bp1%lld\n", count1);
190 return count1 == 1 && overflows == 1 && count2 == 1 ?
/external/stlport/test/unit/
H A Dcount_test.cpp16 CPPUNIT_TEST(count1);
22 void count1();
44 void CountTest::count1() function in class:CountTest
/external/chromium_org/tools/idl_parser/
H A Didl_lexer_test.py53 count1 = len(tokens1)
55 self.assertEqual(count1, count2)
57 for i in range(count1):
/external/chromium_org/ppapi/generators/
H A Didl_lexer.py277 count1 = len(values1)
279 if count1 != count2:
280 print "Size mismatch original %d vs %d\n" % (count1, count2)
281 if count1 > count2: count1 = count2
283 for i in range(count1):
/external/chromium_org/content/test/data/indexeddb/
H A Dcursor_prefetch.js278 count1 = 0;
284 shouldBe("count1", "kNumberOfItems");
293 if (cursor1.key !== count1)
294 shouldBe("cursor1.key", "count1");
295 if (cursor1.value !== count1)
296 shouldBe("cursor1.value", "count1");
298 ++count1;
300 if (count1 % 20 === 0) {
/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
425 // and then into the following count1 & count2 computations.
427 int32_t count1 = count - count2; // number of minLength weights local
428 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) {
431 --count1;
432 U_ASSERT((count1 + count2 * nextCountBytes) >= n);
437 if(count1 == 0) {
447 splitRange, rangeCount, count1, count
[all...]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/resources/
H A Dsunspider-compare-results.js28 var count1 = output1.length;
32 itemTotals1.length = count1;
96 for (var i = 0; i < count1; i++) {
301 var df = count1 + count2 - 2;
326 return result + pad(diffSummary, 18) + formatMean(meanWidth1, mean1, stdErr1, count1) + " " + formatMean(meanWidth2, mean2, stdErr2, count2) + diffDetail;
370 mean1 = computeMeans(count1, total1, categoryTotals1, categoryMeans1, testTotalsByCategory1, testMeansByCategory1);
376 stdErr1 = computeStdErrors(count1, stdDev1, categoryStdErrs1, categoryStdDevs1, testStdErrsByCategory1, testStdDevsByCategory1);
/external/chromium_org/third_party/freetype/src/pshinter/
H A Dpshrec.c382 FT_UInt count1 = mask1->num_bits; local
387 count = FT_MIN( count1, count2 );
429 FT_UInt count1 = mask1->num_bits; local
441 /* if "count2" is greater than "count1", we need to grow the */
443 if ( count2 > count1 )
449 for ( pos = count1; pos < count2; pos++ )
1008 FT_UInt count1 = dim[0].hints.num_hints; local
1013 if ( bit_count != count1 + count2 )
1017 bit_count, count1 + count2 ));
1024 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1,
1053 FT_UInt count1 = dim[0].hints.num_hints; local
[all...]
H A Dpshglob.c476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
/external/freetype/src/pshinter/
H A Dpshrec.c382 FT_UInt count1 = mask1->num_bits; local
387 count = FT_MIN( count1, count2 );
429 FT_UInt count1 = mask1->num_bits; local
441 /* if "count2" is greater than "count1", we need to grow the */
443 if ( count2 > count1 )
449 for ( pos = count1; pos < count2; pos++ )
1008 FT_UInt count1 = dim[0].hints.num_hints; local
1013 if ( bit_count != count1 + count2 )
1017 bit_count, count1 + count2 ));
1024 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1,
1053 FT_UInt count1 = dim[0].hints.num_hints; local
[all...]
H A Dpshglob.c476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/pshinter/
H A Dpshrec.c382 FT_UInt count1 = mask1->num_bits; local
387 count = FT_MIN( count1, count2 );
429 FT_UInt count1 = mask1->num_bits; local
441 /* if "count2" is greater than "count1", we need to grow the */
443 if ( count2 > count1 )
449 for ( pos = count1; pos < count2; pos++ )
1008 FT_UInt count1 = dim[0].hints.num_hints; local
1013 if ( bit_count != count1 + count2 )
1017 bit_count, count1 + count2 ));
1024 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1,
1053 FT_UInt count1 = dim[0].hints.num_hints; local
[all...]
H A Dpshglob.c484 FT_UInt count1, count2; local
501 count1 = normal->count;
503 for ( ; count1 > 0; count1--, zone1++ )
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/speech_rules/
H A Dbase_rule_store.js330 var count1 = this.countMatchingDynamicConstraintValues_(dynamic, r1);
333 if (count1 > count2) {
337 if (count2 > count1) {
/external/chromium_org/third_party/icu/source/i18n/
H A Ducol_wgt.cpp398 uint32_t count1, count2, power_1, power; local
402 /* calculate how to split the range between maxLength-1 (count1) and maxLength (count2) */
406 count1=ranges[0].count-count2;
410 printf("split the first range %ld:%ld\n", count1, count2);
412 if(count1<1) {
427 /* set the end of the first range according to count1 */
429 byte=getWeightByte(ranges[0].start, i)+count1-1;
432 * ranges[0].count and count1 may be >countBytes
451 ranges[0].count=count1;
454 ranges[0].count2=count1*power_
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_segmentation.c257 const int count1 = temporal_predictor_count[i][1]; local
259 t_nopred_prob[i] = get_binary_prob(count0, count1);
263 count1 * vp9_cost_one(t_nopred_prob[i]);
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_segmentation.c273 const int count1 = temporal_predictor_count[i][1]; local
275 t_nopred_prob[i] = get_binary_prob(count0, count1);
279 count1 * vp9_cost_one(t_nopred_prob[i]);
/external/pdfium/core/src/fxge/Microsoft SDK/include/
H A DGdiPlusPath.h1319 INT count1; local
1322 (GpPathGradient*) nativeBrush, &count1));
1327 if((*count < count1) || (count1 <= 0))
1330 ARGB* argbs = (ARGB*) new ARGB[count1];
1335 (GpPathGradient*)nativeBrush, argbs, &count1));
1339 for(INT i = 0; i < count1; i++)
1343 *count = count1;
1358 INT count1 = GetPointCount(); local
1360 if((*count > count1) || (count
[all...]
/external/pdfium/core/src/fpdftext/
H A Dfpdf_text.cpp357 int count1 = order.GetAt(j - 1); local
359 for(int i = start + count1 - 1; i >= start; i--) {
369 int end = start + count1 ;
386 int count1 = order.GetAt(n - 1); local
387 int end = start + count1 ;
401 int count1 = order.GetAt(j + 1); local
425 int end = start + count1 ;
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dapicoll.cpp1031 int32_t count1, count2; local
1036 const Locale* list = Collator::getAvailableLocales(count1);
1037 for (int32_t i = 0; i < count1; ++i) {
1045 if (count1 == 0 || list == NULL) {
1065 if (count1 != count2) {
1066 errln("getAvailableLocales(int&) returned %d and getAvailableLocales() returned %d", count1, count2);
1070 count1 = 0;
1076 count1++;
1078 if (count1 != count2) {
1079 errln("getAvailableLocales(3rd time) returned %d and getAvailableLocales(2nd time) returned %d", count1, count
[all...]
/external/icu/icu4c/source/test/intltest/
H A Dapicoll.cpp1016 int32_t count1, count2; local
1021 const Locale* list = Collator::getAvailableLocales(count1);
1022 for (int32_t i = 0; i < count1; ++i) {
1030 if (count1 == 0 || list == NULL) {
1050 if (count1 != count2) {
1051 errln("getAvailableLocales(int&) returned %d and getAvailableLocales() returned %d", count1, count2);
1055 count1 = 0;
1061 count1++;
1063 if (count1 != count2) {
1064 errln("getAvailableLocales(3rd time) returned %d and getAvailableLocales(2nd time) returned %d", count1, count
[all...]
/external/chromium_org/third_party/skia/gm/
H A Dtechtalk1.cpp95 int count1 = d1.getPoints(pts1, SK_ARRAY_COUNT(pts1)); local
96 SkASSERT(count == count1);

Completed in 656 milliseconds

123