Home
last modified time | relevance | path

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

123

/third_party/skia/third_party/externals/freetype/src/pshinter/
H A Dpshrec.c379 FT_UInt count2 = mask2->num_bits; in ps_mask_table_test_intersect() local
383 count = FT_MIN( count1, count2 ); in ps_mask_table_test_intersect()
428 FT_UInt count2 = mask2->num_bits; in ps_mask_table_merge() local
432 if ( count2 > 0 ) in ps_mask_table_merge()
439 /* if "count2" is greater than "count1", we need to grow the */ in ps_mask_table_merge()
441 if ( count2 > count1 ) in ps_mask_table_merge()
443 error = ps_mask_ensure( mask1, count2, memory ); in ps_mask_table_merge()
447 for ( pos = count1; pos < count2; pos++ ) in ps_mask_table_merge()
454 pos = ( count2 + 7 ) >> 3; in ps_mask_table_merge()
998 FT_UInt count2 in ps_hints_t2mask() local
1043 FT_UInt count2 = dim[1].hints.num_hints; ps_hints_t2counter() local
[all...]
/third_party/skia/third_party/externals/dng_sdk/source/
H A Ddng_utils.cpp439 uint32 count2 = tile.W (); in HistogramArea() local
449 count2, in HistogramArea()
464 for (uint32 col = 0; col < count2; col++) in HistogramArea()
480 for (uint32 col = 0; col < count2; col++) in HistogramArea()
572 uint32 count2 = fDstImage.Planes (); in Process() local
596 count2, in Process()
630 memcpy (dPtr1, sPtr1, count2 * (uint32) sizeof (real32)); in Process()
642 for (uint32 index2 = 0; index2 < count2; index2++) in Process()
665 for (uint32 index2 = 0; index2 < count2; index2++) in Process()
687 for (uint32 index2 = 0; index2 < count2; index in Process()
[all...]
H A Ddng_pixel_buffer.cpp46 uint32 &count2, in OptimizeOrder()
63 Abs_int32 (sStep2) * (count2 - 1); in OptimizeOrder()
67 Abs_int32 (dStep2) * (count2 - 1); in OptimizeOrder()
104 (((const uint8 *) sPtr) + (int32)(count2 - 1) * sStep2 * (int32)sPixelSize); in OptimizeOrder()
107 (((uint8 *) dPtr) + (int32)(count2 - 1) * dStep2 * (int32)dPixelSize); in OptimizeOrder()
155 (((const uint8 *) sPtr) + (int32)(count2 - 1) * sStep2 * (int32)sPixelSize); in OptimizeOrder()
158 (((uint8 *) dPtr) + (int32)(count2 - 1) * dStep2 * (int32)dPixelSize); in OptimizeOrder()
173 if (count2 == 1) step2 = 0xFFFFFFFF; in OptimizeOrder()
235 count [2] = count2; in OptimizeOrder()
239 count2 in OptimizeOrder()
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) OptimizeOrder() argument
277 OptimizeOrder(const void *&sPtr, uint32 sPixelSize, uint32 &count0, uint32 &count1, uint32 &count2, int32 &sStep0, int32 &sStep1, int32 &sStep2) OptimizeOrder() argument
311 OptimizeOrder(void *&dPtr, uint32 dPixelSize, uint32 &count0, uint32 &count1, uint32 &count2, int32 &dStep0, int32 &dStep1, int32 &dStep2) OptimizeOrder() argument
[all...]
H A Ddng_fingerprint.h367 uint32 count2, in DoWrite()
376 Process (data, count2); in DoWrite()
378 fNextOffset += count2; in DoWrite()
366 DoWrite(const void *data, uint32 count2, uint64 offset) DoWrite() argument
/third_party/skia/tests/
H A DGrFinishedFlushTest.cpp125 int count2 = 0; in DEF_GPUTEST_FOR_RENDERING_CONTEXTS() local
131 flushInfoFinishedProc.fFinishedContext = (void*)&count2; in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
134 REPORTER_ASSERT(reporter, count <= 1 && count2 <= count); in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
140 REPORTER_ASSERT(reporter, count == count2); in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
/third_party/ltp/testcases/kernel/security/integrity/ima/tests/
H A Dima_violations.sh70 local count2 i num_violations_new
74 count2="$(get_count $search)"
76 if [ $count2 -gt $count ]; then
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/compression/
H A DDecompressionTest.java43 int count1 = 0, count2 = 0; in decompressTest()
57 count2 = myDecompressor.decompress(segment2, 0, segment2.length, in decompressTest()
63 "decompressed into " + count2 + " chars"); in decompressTest()
67 logln(charBuffer, count1, count2); in decompressTest()
69 s.append(charBuffer, count1, count2); in decompressTest()
72 logln(charBuffer, 0, count1 + count2); in decompressTest()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/compression/
H A DDecompressionTest.java46 int count1 = 0, count2 = 0; in decompressTest()
60 count2 = myDecompressor.decompress(segment2, 0, segment2.length, in decompressTest()
66 "decompressed into " + count2 + " chars"); in decompressTest()
70 logln(charBuffer, count1, count2); in decompressTest()
72 s.append(charBuffer, count1, count2); in decompressTest()
75 logln(charBuffer, 0, count1 + count2); in decompressTest()
/third_party/icu/icu4c/source/i18n/
H A Dcollationweights.cpp446 // Calculate how to split the range between minLength (count1) and minLength+1 (count2). in allocWeightsInMinLengthRanges()
448 // count1 + count2 * nextCountBytes = n in allocWeightsInMinLengthRanges()
449 // count1 + count2 = count in allocWeightsInMinLengthRanges()
451 // (count - count2) + count2 * nextCountBytes = n in allocWeightsInMinLengthRanges()
452 // and then into the following count1 & count2 computations. in allocWeightsInMinLengthRanges()
453 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges() local
454 int32_t count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
455 if(count2 == 0 || (count1 + count2 * nextCountByte in allocWeightsInMinLengthRanges()
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dcollationweights.cpp446 // Calculate how to split the range between minLength (count1) and minLength+1 (count2). in allocWeightsInMinLengthRanges()
448 // count1 + count2 * nextCountBytes = n in allocWeightsInMinLengthRanges()
449 // count1 + count2 = count in allocWeightsInMinLengthRanges()
451 // (count - count2) + count2 * nextCountBytes = n in allocWeightsInMinLengthRanges()
452 // and then into the following count1 & count2 computations. in allocWeightsInMinLengthRanges()
453 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges() local
454 int32_t count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
455 if(count2 == 0 || (count1 + count2 * nextCountByte in allocWeightsInMinLengthRanges()
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dcollationweights.cpp446 // Calculate how to split the range between minLength (count1) and minLength+1 (count2). in allocWeightsInMinLengthRanges()
448 // count1 + count2 * nextCountBytes = n in allocWeightsInMinLengthRanges()
449 // count1 + count2 = count in allocWeightsInMinLengthRanges()
451 // (count - count2) + count2 * nextCountBytes = n in allocWeightsInMinLengthRanges()
452 // and then into the following count1 & count2 computations. in allocWeightsInMinLengthRanges()
453 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges() local
454 int32_t count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
455 if(count2 == 0 || (count1 + count2 * nextCountByte in allocWeightsInMinLengthRanges()
[all...]
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationWeights.java507 // Calculate how to split the range between minLength (count1) and minLength+1 (count2). in allocWeightsInMinLengthRanges()
509 // count1 + count2 * nextCountBytes = n in allocWeightsInMinLengthRanges()
510 // count1 + count2 = count in allocWeightsInMinLengthRanges()
512 // (count - count2) + count2 * nextCountBytes = n in allocWeightsInMinLengthRanges()
513 // and then into the following count1 & count2 computations. in allocWeightsInMinLengthRanges()
514 int count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges()
515 int count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
516 if(count2 == 0 || (count1 + count2 * nextCountByte in allocWeightsInMinLengthRanges()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/
H A DCollationWeights.java509 // Calculate how to split the range between minLength (count1) and minLength+1 (count2). in allocWeightsInMinLengthRanges()
511 // count1 + count2 * nextCountBytes = n in allocWeightsInMinLengthRanges()
512 // count1 + count2 = count in allocWeightsInMinLengthRanges()
514 // (count - count2) + count2 * nextCountBytes = n in allocWeightsInMinLengthRanges()
515 // and then into the following count1 & count2 computations. in allocWeightsInMinLengthRanges()
516 int count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges()
517 int count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
518 if(count2 == 0 || (count1 + count2 * nextCountByte in allocWeightsInMinLengthRanges()
[all...]
/third_party/skia/third_party/externals/freetype/src/sfnt/
H A Dttkern.c265 FT_UInt count2; in FT_LOCAL_DEF() local
268 for ( count2 = num_pairs; count2 > 0; count2-- ) in FT_LOCAL_DEF()
/third_party/littlefs/scripts/
H A Dprefix.py23 name, count2 = re.subn('\\b'+from_prefix.upper(), to_prefix.upper(), name)
26 return name, count1+count2+count3
/third_party/googletest/googlemock/test/
H A Dgmock_stress_test.cc127 int count2 = 0; in TestConcurrentCallsOnSameObject() local
128 const Helper1Param param2 = {&foo, &count2}; in TestConcurrentCallsOnSameObject()
132 EXPECT_EQ(kRepeat, count1 + count2); in TestConcurrentCallsOnSameObject()
/third_party/ltp/testcases/kernel/mce-test/hwpoison/
H A Dtsoftinj.c161 unsigned count2 = hardware_corrupted(); in check() local
162 unsigned diff = count2 - *count; in check()
170 *count = count2; in check()
/third_party/ltp/testcases/kernel/mce-test/tsrc/
H A Dtsoftinj.c161 unsigned count2 = hardware_corrupted(); in check() local
162 unsigned diff = count2 - *count; in check()
170 *count = count2; in check()
/third_party/ffmpeg/libavcodec/mips/
H A Daaccoder_mips.c471 int curidx1, curidx2, sign1, count1, sign2, count2; in quantize_and_encode_band_cost_UPAIR7_mips() local
516 "slt %[count2], $zero, %[qc3] \n\t" in quantize_and_encode_band_cost_UPAIR7_mips()
519 "addu %[count2], %[count2], %[t2] \n\t" in quantize_and_encode_band_cost_UPAIR7_mips()
526 [sign2]"=&r"(sign2), [count2]"=&r"(count2), in quantize_and_encode_band_cost_UPAIR7_mips()
544 v_codes = (p_codes[curidx2] << count2) | sign2; in quantize_and_encode_band_cost_UPAIR7_mips()
545 v_bits = p_bits[curidx2] + count2; in quantize_and_encode_band_cost_UPAIR7_mips()
589 int curidx1, curidx2, sign1, count1, sign2, count2; in quantize_and_encode_band_cost_UPAIR12_mips() local
634 "slt %[count2], in quantize_and_encode_band_cost_UPAIR12_mips()
708 int curidx, curidx2, sign1, count1, sign2, count2; quantize_and_encode_band_cost_ESC_mips() local
803 int curidx, curidx2, sign1, count1, sign2, count2; quantize_and_encode_band_cost_ESC_mips() local
1886 int curidx, curidx2, sign1, count1, sign2, count2; get_band_cost_UPAIR7_mips() local
2026 int sign1, count1, sign2, count2; get_band_cost_UPAIR12_mips() local
[all...]
/third_party/icu/icu4c/source/test/intltest/
H A Dtchcfmt.cpp504 int32_t count2 = 0; in TestClosures()
505 const double *limits2 = fmt2.getLimits(count2); in TestClosures()
506 const UBool *closures2 = fmt2.getClosures(count2); in TestClosures()
508 if((count2 != 6) || !limits2 || !closures2) { in TestClosures()
511 for(i=0;i<count2;i++) { in TestClosures()
513 i, count2, in TestClosures()
/third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_destroy/
H A D2-1.c200 int count2; /* number of children currently waiting (2nd pass) */ member
271 td->count2++; in child()
273 timed = td->count2 & 1; in child()
529 td->count2 = 0; in main()
670 ch = td->count2; in main()
684 ch = td->count2; in main()
/third_party/pcre2/pcre2/src/
H A Dpcre2_substring.c375 int i, count, count2; in pcre2_substring_list_get() local
386 count2 = 2*count; in pcre2_substring_list_get()
391 for (i = 0; i < count2; i += 2) in pcre2_substring_list_get()
414 for (i = 0; i < count2; i += 2) in pcre2_substring_list_get()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/lib/Support/
H A Dregcomp.c313 int count2; in p_ere_exp() local
454 count2 = p_count(p); in p_ere_exp()
455 REQUIRE(count <= count2, REG_BADBR); in p_ere_exp()
457 count2 = INFINITY; in p_ere_exp()
459 count2 = count; in p_ere_exp()
460 repeat(p, pos, count, count2); in p_ere_exp()
537 int count2; in p_simp_re() local
625 count2 = p_count(p); in p_simp_re()
626 REQUIRE(count <= count2, REG_BADBR); in p_simp_re()
628 count2 in p_simp_re()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A Dregcomp.c441 int count2; in p_ere_exp() local
582 count2 = p_count(p); in p_ere_exp()
583 REQUIRE(count <= count2, REG_BADBR); in p_ere_exp()
585 count2 = INFINITY; in p_ere_exp()
587 count2 = count; in p_ere_exp()
588 repeat(p, pos, count, count2); in p_ere_exp()
665 int count2; in p_simp_re() local
753 count2 = p_count(p); in p_simp_re()
754 REQUIRE(count <= count2, REG_BADBR); in p_simp_re()
756 count2 in p_simp_re()
[all...]
/third_party/skia/third_party/externals/freetype/src/otvalid/
H A Dotvcommn.c995 FT_UInt count1, count2; in otv_u_x_Ox_y_Oy_z_Oz_p_sp() local
1030 count2 = FT_NEXT_USHORT( p ); in otv_u_x_Ox_y_Oy_z_Oz_p_sp()
1032 OTV_TRACE(( " (Count = %d)\n", count2 )); in otv_u_x_Ox_y_Oy_z_Oz_p_sp()
1034 OTV_LIMIT_CHECK( count2 * 4 ); in otv_u_x_Ox_y_Oy_z_Oz_p_sp()
1036 for ( ; count2 > 0; count2-- ) in otv_u_x_Ox_y_Oy_z_Oz_p_sp()

Completed in 20 milliseconds

123