Searched defs:count1 (Results 1 - 25 of 52) sorted by relevance

123

/external/valgrind/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/freetype/src/pshinter/
H A Dpshglob.c476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
H A Dpshrec.c379 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/google-breakpad/src/testing/test/
H A Dgmock_stress_test.cc211 int count1 = 0; local
212 const Helper1Param param = { &foo, &count1 };
221 EXPECT_EQ(kRepeat, count1 + count2);
/external/googletest/googlemock/test/
H A Dgmock_stress_test.cc211 int count1 = 0; local
212 const Helper1Param param = { &foo, &count1 };
221 EXPECT_EQ(kRepeat, count1 + count2);
/external/icu/icu4c/source/i18n/
H A Dcollationweights.cpp446 // Calculate how to split the range between minLength (count1) and minLength+1 (count2).
448 // count1 + count2 * nextCountBytes = n
449 // count1 + count2 = count
452 // and then into the following count1 & count2 computations.
454 int32_t count1 = count - count2; // number of minLength weights local
455 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) {
458 --count1;
459 U_ASSERT((count1 + count2 * nextCountBytes) >= n);
464 if(count1 == 0) {
474 splitRange, rangeCount, count1, count
[all...]
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_segmentation.c243 const int count1 = temporal_predictor_count[i][1]; local
245 t_nopred_prob[i] = get_binary_prob(count0, count1);
249 count1 * vp9_cost_one(t_nopred_prob[i]);
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_destroy/
H A D2-1.c206 int count1; /* number of children currently waiting (1st pass) */ member in struct:__anon13884
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/pdfium/third_party/freetype/src/pshinter/
H A Dpshglob.c476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
H A Dpshrec.c379 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/v8/testing/gmock/test/
H A Dgmock_stress_test.cc211 int count1 = 0; local
212 const Helper1Param param = { &foo, &count1 };
221 EXPECT_EQ(kRepeat, count1 + count2);
/external/curl/lib/
H A Dftp.h72 FTP_PORT, /* generic state for PORT, LPRT and EPRT, check count1 */
74 FTP_PASV, /* generic state for PASV and EPSV, check count1 */
139 int count1; /* general purpose counter for the state machine */ member in struct:ftp_conn
/external/icu/icu4c/source/test/intltest/
H A Dmsfmrgts.cpp769 int32_t count1 = 0; local
771 Formattable *newobjs = mf->parse(result, pp, count1);
/external/mesa3d/src/mesa/main/
H A Datifragshader.c427 GLuint count1 = curProg->Instructions[j][i].ArgCount[1]; local
429 op1, op1_enum, count1);
/external/deqp/external/vulkancts/modules/vulkan/geometry/
H A DvktGeometryBasicGeometryShaderTests.cpp1144 inline vector<int> createPattern (int count0, int count1) argument
1148 pattern.push_back(count1);
/external/dng_sdk/source/
H A Ddng_pixel_buffer.cpp45 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
40 OptimizeOrder(const void *&sPtr, void *&dPtr, uint32 sPixelSize, uint32 dPixelSize, uint32 &count0, uint32 &count1, uint32 &count2, int32 &sStep0, int32 &sStep1, int32 &sStep2, int32 &dStep0, int32 &dStep1, int32 &dStep2) argument
277 OptimizeOrder(const void *&sPtr, uint32 sPixelSize, uint32 &count0, uint32 &count1, uint32 &count2, int32 &sStep0, int32 &sStep1, int32 &sStep2) argument
311 OptimizeOrder(void *&dPtr, uint32 dPixelSize, uint32 &count0, uint32 &count1, uint32 &count2, int32 &dStep0, int32 &dStep1, int32 &dStep2) argument
[all...]
H A Ddng_utils.cpp456 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++)
H A Ddng_bottlenecks.h560 uint32 count1,
1692 uint32 count1,
1702 count1,
1690 DoMapArea16(uint16 *dPtr, uint32 count0, uint32 count1, uint32 count2, int32 step0, int32 step1, int32 step2, const uint16 *map) argument
H A Ddng_reference.cpp2617 uint32 count1,
2633 for (uint32 index1 = 0; index1 < count1; index1++)
2755 for (uint32 index1 = 0; index1 < count1; index1++)
2615 RefMapArea16(uint16 *dPtr, uint32 count0, uint32 count1, uint32 count2, int32 step0, int32 step1, int32 step2, const uint16 *map) argument
/external/icu/icu4c/source/common/
H A Duhash.c858 int32_t count1, count2, pos, i; local
884 count1 = uhash_count(hash1);
886 if(count1!=count2){
891 for(i=0; i<count1; i++){
/external/iproute2/misc/
H A Dnstat.c181 int count1, count2, skip = 0; local
186 count1 = count_spaces(buf);
216 if (count2 > count1)
217 skip = count2 - count1;
/external/pdfium/third_party/freetype/src/cff/
H A Dcf2intrp.c1301 CF2_UInt count, count1 = cf2_stack_count( opStack ); local
1308 count = count1 & ~2U;
1309 index += count1 - count;
1346 CF2_UInt count, count1 = cf2_stack_count( opStack ); local
1353 count = count1 & ~2U;
1354 index += count1 - count;
1392 CF2_UInt count, count1 = cf2_stack_count( opStack ); local
1402 count = count1 & ~2U;
1403 index += count1 - count;
/external/freetype/src/base/
H A Dftstroke.c2019 FT_UInt count1, count2, num_points = 0; local
2031 &count1, &count2 );
2040 num_points = count1 + count3;
/external/freetype/src/cff/
H A Dcf2intrp.c1633 CF2_UInt count, count1 = cf2_stack_count( opStack ); local
1640 count = count1 & ~2U;
1641 index += count1 - count;
1678 CF2_UInt count, count1 = cf2_stack_count( opStack ); local
1685 count = count1 & ~2U;
1686 index += count1 - count;
1724 CF2_UInt count, count1 = cf2_stack_count( opStack ); local
1734 count = count1 & ~2U;
1735 index += count1 - count;

Completed in 1256 milliseconds

123