| /third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/compression/ |
| D | DecompressionTest.java | 43 int count1 = 0, count2 = 0; in decompressTest() local
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/ |
| D | DecompressionTest.java | 46 int count1 = 0, count2 = 0; in decompressTest() local
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/skia/third_party/externals/tint/test/vk-gl-cts/graphicsfuzz/cov-inst-combine-and-or-xor-switch/ |
| D | 0-opt.spvasm | 12 OpName %count1 "count1"
45 %count1 = OpVariable %_ptr_Function_int Function
52 OpStore %count1 %31
76 %49 = OpLoad %int %count1
78 OpStore %count1 %50
88 %53 = OpLoad %int %count1
|
| D | 0-opt.wgsl | 14 var count1 : i32;
19 count1 = x_31;
37 let x_49 : i32 = count1;
38 count1 = (x_49 + 1);
49 let x_53 : i32 = count1;
|
| /third_party/toybox/toys/pending/ |
| D | vi.c | 28 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, char *unused) in vi_H() argument
[all …]
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/ |
| D | set_intersection.hpp | 134 int count1 = detail::iterator_range_size(first1, last1); in set_intersection() local
137 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_intersection()
138 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_intersection()
149 fill_n(tile_a.end()-1, 1, count1, queue); in set_intersection()
152 vector<value_type> temp_result(count1+count2, queue.get_context()); in set_intersection()
153 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_intersection()
|
| D | set_difference.hpp | 146 int count1 = detail::iterator_range_size(first1, last1); in set_difference() local
149 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_difference()
150 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_difference()
161 fill_n(tile_a.end()-1, 1, count1, queue); in set_difference()
164 vector<value_type> temp_result(count1+count2, queue.get_context()); in set_difference()
165 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_difference()
|
| D | set_symmetric_difference.hpp | 158 int count1 = detail::iterator_range_size(first1, last1); in set_symmetric_difference() local
161 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_symmetric_difference()
162 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_symmetric_difference()
173 fill_n(tile_a.end()-1, 1, count1, queue); in set_symmetric_difference()
176 vector<value_type> temp_result(count1+count2, queue.get_context()); in set_symmetric_difference()
177 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_symmetric_difference()
|
| D | set_union.hpp | 159 int count1 = detail::iterator_range_size(first1, last1); in set_union() local
162 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_union()
163 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_union()
174 fill_n(tile_a.end()-1, 1, count1, queue); in set_union()
177 vector<value_type> temp_result(count1+count2, queue.get_context()); in set_union()
178 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_union()
|
| D | includes.hpp | 129 size_t count1 = detail::iterator_range_size(first1, last1); in includes() local
132 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes()
133 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes()
144 fill_n(tile_a.end()-1, 1, static_cast<uint_>(count1), queue); in includes()
147 vector<uint_> result((count1+count2+tile_size-1)/tile_size, queue.get_context()); in includes()
|
| /third_party/boost/boost/compute/algorithm/ |
| D | set_intersection.hpp | 134 int count1 = detail::iterator_range_size(first1, last1); in set_intersection() local
137 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_intersection()
138 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_intersection()
149 fill_n(tile_a.end()-1, 1, count1, queue); in set_intersection()
152 vector<value_type> temp_result(count1+count2, queue.get_context()); in set_intersection()
153 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_intersection()
|
| D | set_difference.hpp | 146 int count1 = detail::iterator_range_size(first1, last1); in set_difference() local
149 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_difference()
150 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_difference()
161 fill_n(tile_a.end()-1, 1, count1, queue); in set_difference()
164 vector<value_type> temp_result(count1+count2, queue.get_context()); in set_difference()
165 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_difference()
|
| D | set_symmetric_difference.hpp | 158 int count1 = detail::iterator_range_size(first1, last1); in set_symmetric_difference() local
161 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_symmetric_difference()
162 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_symmetric_difference()
173 fill_n(tile_a.end()-1, 1, count1, queue); in set_symmetric_difference()
176 vector<value_type> temp_result(count1+count2, queue.get_context()); in set_symmetric_difference()
177 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_symmetric_difference()
|
| D | set_union.hpp | 159 int count1 = detail::iterator_range_size(first1, last1); in set_union() local
162 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_union()
163 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_union()
174 fill_n(tile_a.end()-1, 1, count1, queue); in set_union()
177 vector<value_type> temp_result(count1+count2, queue.get_context()); in set_union()
178 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_union()
|
| D | includes.hpp | 129 size_t count1 = detail::iterator_range_size(first1, last1); in includes() local
132 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes()
133 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes()
144 fill_n(tile_a.end()-1, 1, static_cast<uint_>(count1), queue); in includes()
147 vector<uint_> result((count1+count2+tile_size-1)/tile_size, queue.get_context()); in includes()
|
| /third_party/mesa3d/src/gallium/drivers/swr/rasterizer/core/ |
| D | rdtsc_core.h | 107 void rdtscEvent(BucketManager* pBucketMgr, uint32_t bucketId, uint32_t count1, uint32_t count2);
115 #define RDTSC_EVENT(pBucketMgr, bucket, count1, count2) rdtscEvent(pBucketMgr, bucket, count1, coun… argument
122 #define RDTSC_EVENT(pBucketMgr, bucket, count1, count2) argument
163 INLINE void rdtscEvent(BucketManager* pBucketMgr, uint32_t bucketId, uint32_t count1, uint32_t coun… in rdtscEvent() argument
166 pBucketMgr->AddEvent(id, count1); in rdtscEvent()
|
| /third_party/boost/boost/compute/algorithm/detail/ |
| D | merge_with_merge_path.hpp | 155 size_t count1 = iterator_range_size(first1, last1); in merge_with_merge_path() local
158 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in merge_with_merge_path()
159 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in merge_with_merge_path()
170 fill_n(tile_a.end()-1, 1, static_cast<uint_>(count1), queue); in merge_with_merge_path()
181 return result + static_cast<result_difference_type>(count1 + count2); in merge_with_merge_path()
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/detail/ |
| D | merge_with_merge_path.hpp | 155 size_t count1 = iterator_range_size(first1, last1); in merge_with_merge_path() local
158 vector<uint_> tile_a((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in merge_with_merge_path()
159 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in merge_with_merge_path()
170 fill_n(tile_a.end()-1, 1, static_cast<uint_>(count1), queue); in merge_with_merge_path()
181 return result + static_cast<result_difference_type>(count1 + count2); in merge_with_merge_path()
|
| /third_party/abseil-cpp/absl/strings/ |
| D | string_view.h | 417 int compare(size_type pos1, size_type count1, string_view v) const { in compare() argument
418 return substr(pos1, count1).compare(v); in compare()
423 int compare(size_type pos1, size_type count1, string_view v, size_type pos2, in compare() argument
425 return substr(pos1, count1).compare(v.substr(pos2, count2)); in compare()
434 int compare(size_type pos1, size_type count1, const char* s) const { in compare() argument
435 return substr(pos1, count1).compare(string_view(s)); in compare()
440 int compare(size_type pos1, size_type count1, const char* s, in compare() argument
442 return substr(pos1, count1).compare(string_view(s, count2)); in compare()
|
| /third_party/skia/third_party/externals/dng_sdk/source/ |
| D | dng_pixel_buffer.cpp | 45 uint32 &count1, in OptimizeOrder() argument
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 = count [index1]; in OptimizeOrder()
[all …]
|
| /third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_destroy/ |
| D | 2-1.c | 199 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/ |
| D | pshrec.c | 378 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
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; in ps_hints_t2counter() local
[all …]
|
| /third_party/freetype/src/pshinter/ |
| D | pshrec.c | 378 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
441 if ( count2 > count1 ) in ps_mask_table_merge()
447 for ( pos = count1; pos < count2; pos++ ) in ps_mask_table_merge()
1002 FT_UInt count1 = dim[0].hints.num_hints; in ps_hints_t2mask() local
1007 if ( bit_count != count1 + count2 ) in ps_hints_t2mask()
1011 bit_count, count1 + count2 )); in ps_hints_t2mask()
1018 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1, in ps_hints_t2mask()
1047 FT_UInt count1 = dim[0].hints.num_hints; in ps_hints_t2counter() local
[all …]
|
| /third_party/flutter/skia/third_party/externals/freetype/src/pshinter/ |
| D | pshrec.c | 379 FT_UInt count1 = mask1->num_bits; in ps_mask_table_test_intersect() local
384 count = FT_MIN( count1, count2 ); in ps_mask_table_test_intersect()
428 FT_UInt count1 = mask1->num_bits; in ps_mask_table_merge() local
442 if ( count2 > count1 ) in ps_mask_table_merge()
448 for ( pos = count1; pos < count2; pos++ ) in ps_mask_table_merge()
1003 FT_UInt count1 = dim[0].hints.num_hints; in ps_hints_t2mask() local
1008 if ( bit_count != count1 + count2 ) in ps_hints_t2mask()
1012 bit_count, count1 + count2 )); in ps_hints_t2mask()
1019 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1, in ps_hints_t2mask()
1048 FT_UInt count1 = dim[0].hints.num_hints; in ps_hints_t2counter() local
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/ |
| D | string_view.h | 422 constexpr int compare(size_type pos1, size_type count1, string_view v) const { in compare() argument
423 return substr(pos1, count1).compare(v); in compare()
428 constexpr int compare(size_type pos1, size_type count1, string_view v, in compare() argument
430 return substr(pos1, count1).compare(v.substr(pos2, count2)); in compare()
439 constexpr int compare(size_type pos1, size_type count1, const char* s) const { in compare() argument
440 return substr(pos1, count1).compare(string_view(s)); in compare()
445 constexpr int compare(size_type pos1, size_type count1, const char* s, in compare() argument
447 return substr(pos1, count1).compare(string_view(s, count2)); in compare()
|