| /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/node/deps/uv/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/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/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()
|
| D | PathOpsAngleIdeas.cpp | 53 int smallest = -1; in testArc() local
65 smallest = idx; in testArc()
69 REPORTER_ASSERT(reporter, smallest >= 0); in testArc()
71 return i[1][smallest]; in testArc()
|
| /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/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/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/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/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/vixl/test/aarch32/config/ |
| D | data-types.json | 2337 "0x0010000000000000", // The smallest normal value.
2364 // - The smallest subnormal value.
|
| /third_party/jerryscript/targets/curie_bsp/jerry_app/quark/ |
| D | memory_pool_list.def | 24 * value: pool with <index> 0 must have the smallest <size>.
|
| /third_party/jerryscript/targets/curie_bsp/jerry_app/arc/ |
| D | memory_pool_list.def | 24 * value: pool with <index> 0 must have the smallest <size>.
|
| /third_party/json/tests/src/ |
| D | unit-regression2.cpp | 521 constexpr auto smallest = (std::numeric_limits<int64_t>::min)(); variable
522 json j = smallest;
523 CHECK(j.dump() == std::to_string(smallest));
|
| /third_party/qrcodegen/python/ |
| D | Readme.markdown | 27 …maximum version numbers allowed, then library will automatically choose smallest version in the ra…
|
| /third_party/qrcodegen/cpp/ |
| D | Readme.markdown | 28 …maximum version numbers allowed, then library will automatically choose smallest version in the ra…
|
| /third_party/ffmpeg/doc/ |
| D | rate_distortion.txt | 5 given filesize OR we want to get the smallest filesize at a given quality
|
| /third_party/qrcodegen/rust/ |
| D | Readme.markdown | 27 …maximum version numbers allowed, then library will automatically choose smallest version in the ra…
|
| /third_party/qrcodegen/typescript-javascript/ |
| D | Readme.markdown | 27 …maximum version numbers allowed, then library will automatically choose smallest version in the ra…
|
| /third_party/python/Lib/test/decimaltestdata/ |
| D | ddEncode.decTest | 36 -- Emin = -383 (smallest exponent value)
123 -- next is smallest all-nines
180 -- next is smallest all-nines
|
| /third_party/qrcodegen/java/ |
| D | Readme.markdown | 27 …maximum version numbers allowed, then library will automatically choose smallest version in the ra…
|
| /third_party/qrcodegen/c/ |
| D | Readme.markdown | 29 …maximum version numbers allowed, then library will automatically choose smallest version in the ra…
|
| /third_party/qrcodegen/java-fast/ |
| D | Readme.markdown | 32 …maximum version numbers allowed, then library will automatically choose smallest version in the ra…
|
| /third_party/qrcodegen/rust-no-heap/ |
| D | Readme.markdown | 28 …maximum version numbers allowed, then library will automatically choose smallest version in the ra…
|