Home
last modified time | relevance | path

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

123

/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()
45 count1 = myDecompressor.decompress(segment1, 0, segment1.length, in decompressTest()
50 "decompressed into " + count1 + " chars"); in decompressTest()
54 logln(charBuffer, 0, count1); in decompressTest()
55 s.append(charBuffer, 0, count1); in decompressTest()
59 charBuffer, count1, 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()
48 count1 = myDecompressor.decompress(segment1, 0, segment1.length, in decompressTest()
53 "decompressed into " + count1 + " chars"); in decompressTest()
57 logln(charBuffer, 0, count1); in decompressTest()
58 s.append(charBuffer, 0, count1); in decompressTest()
62 charBuffer, count1, 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/toybox/toys/pending/
H A Dvi.c28 int count0, count1, vi_mov_flag;
702 static int cur_left(int count0, int count1, char *unused) in cur_left() argument
704 int count = count0*count1; in cur_left()
714 static int cur_right(int count0, int count1, char *unused) in cur_right() argument
716 int count = count0*count1, len, width = 0; in cur_right()
741 static int cur_up(int count0, int count1, char *unused) in cur_up() argument
743 int count = count0*count1; in cur_up()
752 static int cur_down(int count0, int count1, char *unused) in cur_down() argument
754 int count = count0*count1; in cur_down()
760 static int vi_H(int count0, int count1, cha argument
766 vi_L(int count0, int count1, char *unused) vi_L() argument
773 vi_M(int count0, int count1, char *unused) vi_M() argument
794 vi_yy(char reg, int count0, int count1) vi_yy() argument
808 vi_dd(char reg, int count0, int count1) vi_dd() argument
821 vi_x(char reg, int count0, int count1) vi_x() argument
839 vi_movw(int count0, int count1, char *unused) vi_movw() argument
872 vi_movb(int count0, int count1, char *unused) vi_movb() argument
913 vi_move(int count0, int count1, char *unused) vi_move() argument
946 vi_zero(int count0, int count1, char *unused) vi_zero() argument
954 vi_dollar(int count0, int count1, char *unused) vi_dollar() argument
1008 vi_push(char reg, int count0, int count1) vi_push() argument
1032 vi_find_c(int count0, int count1, char *symbol) vi_find_c() argument
1040 vi_find_cb(int count0, int count1, char *symbol) vi_find_cb() argument
1049 vi_go(int count0, int count1, char *symbol) vi_go() argument
1070 vi_o(char reg, int count0, int count1) vi_o() argument
1079 vi_O(char reg, int count0, int count1) vi_O() argument
1085 vi_D(char reg, int count0, int count1) vi_D() argument
1097 vi_I(char reg, int count0, int count1) vi_I() argument
1104 vi_join(char reg, int count0, int count1) vi_join() argument
1116 vi_find_next(char reg, int count0, int count1) vi_find_next() argument
[all...]
/third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_destroy/
H A D2-1.c199 int count1; /* number of children currently waiting (1st pass) */ member
224 td->count1++; in child()
226 timed = td->count1 & 1; in child()
254 td->count1--; in child()
528 td->count1 = 0; in main()
569 ch = td->count1; in main()
583 ch = td->count1; in main()
634 ch = td->count1; in main()
648 ch = td->count1; in main()
/third_party/skia/third_party/externals/freetype/src/pshinter/
H A Dpshrec.c378 FT_UInt count1 = mask1->num_bits; in ps_mask_table_test_intersect() local
383 count = FT_MIN( count1, count2 ); in ps_mask_table_test_intersect()
427 FT_UInt count1 = mask1->num_bits; in ps_mask_table_merge() local
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()
447 for ( pos = count1; pos < count2; pos++ ) in ps_mask_table_merge()
997 FT_UInt count1 = dim[0].hints.num_hints; in ps_hints_t2mask() local
1002 if ( bit_count != count1 + count2 ) in ps_hints_t2mask()
1006 bit_count, count1 + count2 )); in ps_hints_t2mask()
1013 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1, in ps_hints_t2mask()
1042 FT_UInt count1 = dim[0].hints.num_hints; ps_hints_t2counter() local
[all...]
/third_party/skia/third_party/externals/dng_sdk/source/
H A Ddng_pixel_buffer.cpp45 uint32 &count1, in OptimizeOrder()
62 Abs_int32 (sStep1) * (count1 - 1) + in OptimizeOrder()
66 Abs_int32 (dStep1) * (count1 - 1) + in OptimizeOrder()
90 (((const uint8 *) sPtr) + (int32)(count1 - 1) * sStep1 * (int32)sPixelSize); in OptimizeOrder()
93 (((uint8 *) dPtr) + (int32)(count1 - 1) * dStep1 * (int32)dPixelSize); in OptimizeOrder()
141 (((const uint8 *) sPtr) + (int32)(count1 - 1) * sStep1 * (int32)sPixelSize); in OptimizeOrder()
144 (((uint8 *) dPtr) + (int32)(count1 - 1) * dStep1 * (int32)dPixelSize); in OptimizeOrder()
172 if (count1 == 1) step1 = 0xFFFFFFFF; in OptimizeOrder()
234 count [1] = count1; in OptimizeOrder()
238 count1 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_utils.cpp438 uint32 count1 = tile.H (); in HistogramArea() local
448 count1, in HistogramArea()
458 for (uint32 row = 0; row < count1; row++) in HistogramArea()
571 uint32 count1 = tile.W (); in Process() local
595 count1, in Process()
618 for (uint32 index1 = 0; index1 < count1; index1++) in Process()
H A Ddng_pixel_buffer.h39 uint32 &count1,
51 uint32 &count1,
60 uint32 &count1,
/third_party/alsa-utils/alsaloop/
H A Dpcmjob.c511 snd_pcm_uframes_t count, count1, cpos, ppos;
519 count1 = count;
520 if (count1 + cpos > capt->buf_size)
521 count1 = capt->buf_size - cpos;
522 if (count1 > buf_avail(play))
523 count1 = buf_avail(play);
524 if (count1 + ppos > play->buf_size)
525 count1 = play->buf_size - ppos;
526 if (count1 == 0)
530 count1 * cap
548 snd_pcm_uframes_t count, pos, count1, pos1; buf_add_src() local
[all...]
/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()
452 // and then into the following count1 & count2 computations. in allocWeightsInMinLengthRanges()
454 int32_t count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges() local
455 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
458 --count1; in allocWeightsInMinLengthRanges()
459 U_ASSERT((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
464 if(count1 == 0) { in allocWeightsInMinLengthRanges()
474 splitRange, rangeCount, count1, count 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()
452 // and then into the following count1 & count2 computations. in allocWeightsInMinLengthRanges()
454 int32_t count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges() local
455 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
458 --count1; in allocWeightsInMinLengthRanges()
459 U_ASSERT((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
464 if(count1 == 0) { in allocWeightsInMinLengthRanges()
474 splitRange, rangeCount, count1, count 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()
452 // and then into the following count1 & count2 computations. in allocWeightsInMinLengthRanges()
454 int32_t count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges() local
455 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
458 --count1; in allocWeightsInMinLengthRanges()
459 U_ASSERT((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
464 if(count1 == 0) { in allocWeightsInMinLengthRanges()
474 splitRange, rangeCount, count1, count in allocWeightsInMinLengthRanges()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/
H A Dstring_view.h422 constexpr int compare(size_type pos1, size_type count1, string_view v) const {
423 return substr(pos1, count1).compare(v);
428 constexpr int compare(size_type pos1, size_type count1, string_view v,
430 return substr(pos1, count1).compare(v.substr(pos2, count2));
439 constexpr int compare(size_type pos1, size_type count1, const char* s) const {
440 return substr(pos1, count1).compare(string_view(s));
445 constexpr int compare(size_type pos1, size_type count1, const char* s,
447 return substr(pos1, count1).compare(string_view(s, count2));
/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()
513 // and then into the following count1 & count2 computations. in allocWeightsInMinLengthRanges()
515 int count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
516 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
519 --count1; in allocWeightsInMinLengthRanges()
520 assert((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
525 if(count1 == 0) { in allocWeightsInMinLengthRanges()
534 // splitRange, rangeCount, count1, count 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()
515 // and then into the following count1 & count2 computations. in allocWeightsInMinLengthRanges()
517 int count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
518 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
521 --count1; in allocWeightsInMinLengthRanges()
522 assert((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
527 if(count1 == 0) { in allocWeightsInMinLengthRanges()
536 // splitRange, rangeCount, count1, count in allocWeightsInMinLengthRanges()
[all...]
/third_party/ntfs-3g/ntfsprogs/
H A Dntfscmp.c603 s64 count1 = 0, count2; in cmp_attribute_data() local
607 for (pos = 0; pos <= na1->data_size; pos += count1) { in cmp_attribute_data()
609 count1 = ntfs_attr_pread(na1, pos, NTFS_BUF_SIZE, buf1); in cmp_attribute_data()
612 if (count1 != count2) { in cmp_attribute_data()
618 (long long)count1, (long long)count2); in cmp_attribute_data()
623 if (count1 == -1) { in cmp_attribute_data()
631 if (count1 == 0) { in cmp_attribute_data()
633 if (pos + count1 == na1->data_size) in cmp_attribute_data()
638 printf("%lld != %lld\n", (long long)pos + count1, in cmp_attribute_data()
643 if (cmp_buffer(buf1, buf2, count1, na in cmp_attribute_data()
[all...]
/third_party/skia/third_party/externals/freetype/src/otvalid/
H A Dotvcommn.c902 FT_UInt GlyphCount, Count, count1; in otv_u_x_y_Ox_sy() local
918 for ( count1 = GlyphCount; count1 > 0; count1-- ) in otv_u_x_y_Ox_sy()
995 FT_UInt count1, count2; in otv_u_x_Ox_y_Oy_z_Oz_p_sp() local
1018 for ( count1 = InputGlyphCount; count1 > 0; count1-- ) in otv_u_x_Ox_y_Oy_z_Oz_p_sp()
H A Dotvgpos.c63 FT_UInt Count, count1, table_size; in otv_x_sxy() local
79 for ( count1 = otvalid->extra1; count1 > 0; count1-- ) in otv_x_sxy()
/third_party/littlefs/scripts/
H A Dprefix.py22 name, count1 = re.subn('\\b'+from_prefix, to_prefix, name)
26 return name, count1+count2+count3
H A Dchangeprefix.py38 line, count1 = re.subn(
50 return line, count1+count2+count3
/third_party/googletest/googlemock/test/
H A Dgmock_stress_test.cc122 int count1 = 0; in TestConcurrentCallsOnSameObject() local
123 const Helper1Param param = {&foo, &count1}; in TestConcurrentCallsOnSameObject()
132 EXPECT_EQ(kRepeat, count1 + count2); in TestConcurrentCallsOnSameObject()
/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
514 "slt %[count1], $zero, %[qc1] \n\t" in quantize_and_encode_band_cost_UPAIR7_mips()
518 "addu %[count1], %[count1], %[t1] \n\t" in quantize_and_encode_band_cost_UPAIR7_mips()
525 [sign1]"=&r"(sign1), [count1]"=&r"(count1), in quantize_and_encode_band_cost_UPAIR7_mips()
537 v_codes = (p_codes[curidx1] << count1) | sign1; in quantize_and_encode_band_cost_UPAIR7_mips()
538 v_bits = p_bits[curidx1] + count1; 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
632 "slt %[count1], 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/protobuf/src/google/protobuf/util/
H A Dmessage_differencer.cc926 const int count1 = reflection1->FieldSize(message1, repeated_field); in CompareRepeatedField() local
933 if (count1 != count2 && reporter_ == NULL && !treated_as_subset) { in CompareRepeatedField()
937 if (count1 > count2 && reporter_ == NULL) { in CompareRepeatedField()
972 for (int i = 0; i < count1; i++) { in CompareRepeatedField()
1040 if (simple_list && i < count1) continue; in CompareRepeatedField()
1053 for (int i = 0; i < count1; ++i) { in CompareRepeatedField()
1472 // a node on the right side. count1 is the number of nodes on the left side
1480 MaximumMatcher(int count1, int count2, NodeMatchCallback callback,
1505 MaximumMatcher::MaximumMatcher(int count1, int count2, in MaximumMatcher() argument
1509 : count1_(count1), in MaximumMatcher()
1587 const int count1 = MatchRepeatedFieldIndices() local
[all...]
/third_party/mesa3d/src/mesa/vbo/
H A Dvbo_exec.c174 unsigned *count0, unsigned count1, in vbo_merge_draws()
247 *count0 += count1; in vbo_merge_draws()
171 vbo_merge_draws(struct gl_context *ctx, bool in_dlist, GLubyte mode0, GLubyte mode1, unsigned start0, unsigned start1, unsigned *count0, unsigned count1, unsigned basevertex0, unsigned basevertex1, bool *end0, bool begin1, bool end1) vbo_merge_draws() argument
/third_party/lame/libmp3lame/
H A Dl3side.h55 int count1; member

Completed in 25 milliseconds

123