| /third_party/flutter/skia/third_party/externals/libpng/intel/ |
| D | filter_sse2_intrinsics.c | 257 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth3_sse2() local
275 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2()
278 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
279 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
294 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth3_sse2() local
311 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2()
314 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
315 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
346 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth4_sse2() local
373 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth4_sse2()
[all …]
|
| /third_party/libpng/intel/ |
| D | filter_sse2_intrinsics.c | 257 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth3_sse2() local
275 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2()
278 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
279 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
294 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth3_sse2() local
311 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2()
314 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
315 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
346 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth4_sse2() local
373 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth4_sse2()
[all …]
|
| /third_party/skia/third_party/externals/libpng/intel/ |
| D | filter_sse2_intrinsics.c | 257 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth3_sse2() local
275 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2()
278 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
279 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
294 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth3_sse2() local
311 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2()
314 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
315 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
346 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth4_sse2() local
373 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth4_sse2()
[all …]
|
| /third_party/libuv/src/ |
| D | heap-inl.h | 153 struct heap_node* smallest; in HEAP_EXPORT() local
221 smallest = child; in HEAP_EXPORT()
222 if (child->left != NULL && less_than(child->left, smallest)) in HEAP_EXPORT()
223 smallest = child->left; in HEAP_EXPORT()
224 if (child->right != NULL && less_than(child->right, smallest)) in HEAP_EXPORT()
225 smallest = child->right; in HEAP_EXPORT()
226 if (smallest == child) in HEAP_EXPORT()
228 heap_node_swap(heap, child, smallest); in HEAP_EXPORT()
|
| /third_party/mesa3d/src/gallium/drivers/svga/ |
| D | svga_draw_arrays.c | 131 unsigned smallest = 0; in retrieve_or_generate_indices() local
136 smallest = i; in retrieve_or_generate_indices()
139 else if (hwtnl->index_cache[prim][i].gen_nr < smallest) { in retrieve_or_generate_indices()
140 smallest = i; in retrieve_or_generate_indices()
145 assert(smallest != IDX_CACHE_MAX); in retrieve_or_generate_indices()
147 pipe_resource_reference(&hwtnl->index_cache[prim][smallest].buffer, in retrieve_or_generate_indices()
152 smallest, smallest_size); in retrieve_or_generate_indices()
154 i = smallest; in retrieve_or_generate_indices()
|
| /third_party/boost/libs/numeric/conversion/test/ |
| D | bounds_test.cpp | 33 T smallest = bounds<T>::smallest() ; in test_bounds() local
43 BOOST_CHECK_MESSAGE ( smallest == expected_smallest, in test_bounds()
44 …"bounds<" << typeid(T).name() << ">::smallest() = " << printable(smallest) << ". Expected " << pri… in test_bounds()
|
| /third_party/boost/libs/numeric/conversion/doc/ |
| D | bounds.qbk | 36 static N smallest() { return implementation_defined; }
51 [: `smallest()` ]
53 Returns the smallest positive normalized value for floating point types with
80 std::cout << "The smallest positive value for float:\n";
81 std::cout << boost::numeric::bounds<float>::smallest() << "\n";
|
| /third_party/boost/libs/hana/example/ |
| D | maximum.cpp | 21 auto smallest = hana::maximum(hana::tuple_c<int, -1, 0, 2, -4, 6, 9>, [](auto x, auto y) { in main() local
24 BOOST_HANA_CONSTANT_CHECK(smallest == hana::int_c<-4>); in main()
|
| /third_party/flutter/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 195 double smallest = SkTMin(allRoots[0], allRoots[1]); in DEF_TEST() local
197 smallest = SkTMin(smallest, allRoots[2]); in DEF_TEST()
199 SkASSERT_RELEASE(smallest < 0); in DEF_TEST()
200 SkASSERT_RELEASE(smallest >= -1); in DEF_TEST()
|
| /third_party/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 195 double smallest = std::min(allRoots[0], allRoots[1]); in DEF_TEST() local
197 smallest = std::min(smallest, allRoots[2]); in DEF_TEST()
199 SkASSERT_RELEASE(smallest < 0); in DEF_TEST()
200 SkASSERT_RELEASE(smallest >= -1); in DEF_TEST()
|
| /third_party/boost/libs/hana/include/boost/hana/detail/ |
| D | algorithm.hpp | 177 ForwardIt smallest = first; in min_element() local
180 if (*first < *smallest) in min_element()
181 smallest = first; in min_element()
182 return smallest; in min_element()
|
| /third_party/boost/boost/hana/detail/ |
| D | algorithm.hpp | 177 ForwardIt smallest = first; in min_element() local
180 if (*first < *smallest) in min_element()
181 smallest = first; in min_element()
182 return smallest; in min_element()
|
| /third_party/boost/boost/numeric/conversion/detail/ |
| D | bounds.hpp | 28 static N smallest() { return static_cast<N>(1); } in smallest() function in boost::numeric::boundsdetail::Integral
40 static N smallest() { return limits::min BOOST_PREVENT_MACRO_SUBSTITUTION (); } in smallest() function in boost::numeric::boundsdetail::Float
|
| /third_party/flutter/flutter/packages/flutter/test/rendering/ |
| D | repaint_boundary_test.dart | 108 size = constraints.smallest;
119 size = constraints.smallest;
135 size = constraints.smallest;
146 size = constraints.smallest;
|
| /third_party/boost/libs/hana/example/tutorial/ |
| D | type.cpp | 181 struct smallest struct
191 using smallest_t = typename smallest<T...>::type;
208 auto smallest = hana::minimum(hana::make_tuple(hana::type_c<T>...), [](auto t, auto u) { in __anon698e64c90602() variable
213 using smallest_t = typename decltype(smallest<T...>)::type;
|
| /third_party/ffmpeg/libavfilter/ |
| D | vf_deshake.c | 126 int smallest = INT_MAX; in find_block_motion() local
137 if (diff < smallest) { in find_block_motion()
138 smallest = diff; in find_block_motion()
149 if (diff < smallest) { in find_block_motion()
150 smallest = diff; in find_block_motion()
167 if (diff < smallest) { in find_block_motion()
168 smallest = diff; in find_block_motion()
176 if (smallest > 512) { in find_block_motion()
|
| /third_party/python/Doc/library/ |
| D | heapq.rst | 24 smallest element is always the root, ``heap[0]``.
29 since Python uses zero-based indexing. (b) Our pop method returns the smallest
34 surprises: ``heap[0]`` is the smallest item, and ``heap.sort()`` maintains the
50 Pop and return the smallest item from the *heap*, maintaining the heap
52 smallest item without popping it, use ``heap[0]``.
57 Push *item* on the heap, then pop and return the smallest item from the
69 Pop and return the smallest item from the *heap*, and also push the new *item*.
94 streams is already sorted (smallest to largest).
105 be sorted from largest to smallest.
122 Return a list with the *n* smallest elements from the dataset defined by
[all …]
|
| /third_party/lz4/examples/ |
| D | HCStreaming_ringBuffer.c | 146 size_t smallest = r0; in compare() local
147 if (r1<r0) smallest = r1; in compare()
148 result += smallest; in compare()
|
| /third_party/ffmpeg/libavcodec/ |
| D | 4xm.c | 663 int smallest[2] = { 0, 0 }; in read_huffman_tables() local
671 smallest[1] = smallest[0]; in read_huffman_tables()
673 smallest[0] = i; in read_huffman_tables()
676 smallest[1] = i; in read_huffman_tables()
684 flag[smallest[0]] = 0; in read_huffman_tables()
685 flag[smallest[1]] = 1; in read_huffman_tables()
686 up[smallest[0]] = in read_huffman_tables()
687 up[smallest[1]] = j; in read_huffman_tables()
688 frequency[smallest[0]] = frequency[smallest[1]] = 0; in read_huffman_tables()
|
| /third_party/boost/libs/icl/doc/ |
| D | functions_range.qbk | 30 [[`interval_type hull(const T&)`] [__S __M] [`hull(x)` returns the smallest interval that cont…
31 [[`T hull(const T&, const T&)`] [__S __M] [`hull(i,j)` returns the smallest interval that co…
|
| /third_party/json/test/src/ |
| D | unit-regression2.cpp | 355 constexpr auto smallest = (std::numeric_limits<int64_t>::min)(); variable
356 json j = smallest;
357 CHECK(j.dump() == std::to_string(smallest));
|
| /third_party/python/Lib/test/ |
| D | test_ttk_textonly.py | 262 smallest = ttk._format_layoutlist([('a', None)], indent=0)
263 self.assertEqual(smallest,
265 self.assertEqual(smallest[0], 'a')
|
| /third_party/boost/libs/type_traits/doc/ |
| D | alignment_traits.qbk | 11 specific alignment properties. The template `__type_with_alignment` finds the smallest
|
| /third_party/flutter/flutter/packages/flutter/lib/src/widgets/ |
| D | constants.dart | 10 /// kMinInteractiveDimension x kMinInteractiveDimension is the smallest
|
| /third_party/flutter/flutter/packages/flutter/lib/src/cupertino/ |
| D | constants.dart | 10 /// kMinInteractiveDimension x kMinInteractiveDimension is the smallest
|