| /third_party/boost/libs/compute/include/boost/compute/algorithm/ |
| D | set_intersection.hpp | 135 int count2 = detail::iterator_range_size(first2, last2); 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()
150 fill_n(tile_b.end()-1, 1, count2, 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 | 147 int count2 = detail::iterator_range_size(first2, last2); 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()
162 fill_n(tile_b.end()-1, 1, count2, 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 | 159 int count2 = detail::iterator_range_size(first2, last2); 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()
174 fill_n(tile_b.end()-1, 1, count2, 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 | 160 int count2 = detail::iterator_range_size(first2, last2); 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()
175 fill_n(tile_b.end()-1, 1, count2, 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 | 130 size_t count2 = detail::iterator_range_size(first2, last2); 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()
145 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), 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 | 135 int count2 = detail::iterator_range_size(first2, last2); 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()
150 fill_n(tile_b.end()-1, 1, count2, 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 | 147 int count2 = detail::iterator_range_size(first2, last2); 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()
162 fill_n(tile_b.end()-1, 1, count2, 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 | 159 int count2 = detail::iterator_range_size(first2, last2); 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()
174 fill_n(tile_b.end()-1, 1, count2, 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 | 160 int count2 = detail::iterator_range_size(first2, last2); 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()
175 fill_n(tile_b.end()-1, 1, count2, 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 | 130 size_t count2 = detail::iterator_range_size(first2, last2); 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()
145 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in includes()
147 vector<uint_> result((count1+count2+tile_size-1)/tile_size, queue.get_context()); in includes()
|
| /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
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/ |
| D | DecompressionTest.java | 46 int count1 = 0, count2 = 0; in decompressTest() local
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/skia/third_party/externals/dng_sdk/source/ |
| D | dng_utils.cpp | 439 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; index2++) in Process()
|
| D | dng_pixel_buffer.cpp | 46 uint32 &count2, in OptimizeOrder() argument
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 = count [index2]; in OptimizeOrder()
[all …]
|
| /third_party/boost/libs/thread/test/ |
| D | test_8557.cpp | 49 void* count2(void*) { in count2() function
99 pthread_create(&thrd1, &attr, &count2, 0); in main()
104 pthread_create(&thrd2, &attr, &count2, 0); in main()
109 pthread_create(&thrd3, &attr, &count2, 0); in main()
|
| /third_party/skia/third_party/externals/freetype/src/pshinter/ |
| D | pshrec.c | 379 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()
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 = dim[1].hints.num_hints; in ps_hints_t2mask() local
1002 if ( bit_count != count1 + count2 ) in ps_hints_t2mask()
[all …]
|
| /third_party/freetype/src/pshinter/ |
| D | pshrec.c | 379 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()
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()
1003 FT_UInt count2 = dim[1].hints.num_hints; in ps_hints_t2mask() local
1007 if ( bit_count != count1 + count2 ) in ps_hints_t2mask()
[all …]
|
| /third_party/flutter/skia/third_party/externals/freetype/src/pshinter/ |
| D | pshrec.c | 380 FT_UInt count2 = mask2->num_bits; in ps_mask_table_test_intersect() local
384 count = FT_MIN( count1, count2 ); in ps_mask_table_test_intersect()
429 FT_UInt count2 = mask2->num_bits; in ps_mask_table_merge() local
433 if ( count2 > 0 ) in ps_mask_table_merge()
442 if ( count2 > count1 ) in ps_mask_table_merge()
444 error = ps_mask_ensure( mask1, count2, memory ); in ps_mask_table_merge()
448 for ( pos = count1; pos < count2; pos++ ) in ps_mask_table_merge()
455 pos = ( count2 + 7 ) >> 3; in ps_mask_table_merge()
1004 FT_UInt count2 = dim[1].hints.num_hints; in ps_hints_t2mask() local
1008 if ( bit_count != count1 + count2 ) in ps_hints_t2mask()
[all …]
|
| /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 …INE void rdtscEvent(BucketManager* pBucketMgr, uint32_t bucketId, uint32_t count1, uint32_t count2) in rdtscEvent() argument
|
| /third_party/boost/boost/compute/algorithm/detail/ |
| D | merge_with_merge_path.hpp | 156 size_t count2 = iterator_range_size(first2, last2); 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()
171 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), 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 | 156 size_t count2 = iterator_range_size(first2, last2); 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()
171 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in merge_with_merge_path()
181 return result + static_cast<result_difference_type>(count1 + count2); in merge_with_merge_path()
|
| /third_party/flutter/skia/tests/ |
| D | GrFinishedFlushTest.cpp | 113 int count2 = 0; in DEF_GPUTEST_FOR_RENDERING_CONTEXTS() local
118 flushInfoFinishedProc.fFinishedContext = (void*)&count2; in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
120 REPORTER_ASSERT(reporter, count <= 1 && count2 <= count); in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
125 REPORTER_ASSERT(reporter, count == count2); in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
|
| /third_party/skia/tests/ |
| D | GrFinishedFlushTest.cpp | 125 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/ |
| D | ima_violations.sh | 74 local count2 i num_violations_new
78 count2="$(get_count $search)"
80 if [ $count2 -gt $count ]; then
|
| /third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| D | CollationWeights.java | 514 int count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges() local
515 int count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
516 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
518 ++count2; in allocWeightsInMinLengthRanges()
520 assert((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
546 ranges[1].count = count2; // *countBytes when lengthened in allocWeightsInMinLengthRanges()
|