Home
last modified time | relevance | path

Searched refs:smallest (Results 1 – 25 of 209) sorted by relevance

123456789

/external/fec/
Dpeakval_av.c15 vector signed short smallest,largest; in peakval_av() local
17 smallest = (vector signed short)(0); in peakval_av()
26 smallest = vec_min(smallest,x); in peakval_av()
34 smallest = vec_min(smallest,x); in peakval_av()
44 smallest = vec_min(smallest,x); in peakval_av()
48 largest = vec_max(largest,vec_abs(smallest)); in peakval_av()
/external/libpng/intel/
Dfilter_sse2_intrinsics.c272 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth3_sse2() local
290 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2()
293 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
294 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
309 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth3_sse2() local
326 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2()
329 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
330 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
361 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth4_sse2() local
388 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth4_sse2()
[all …]
/external/robolectric-shadows/robolectric/src/test/java/org/robolectric/shadows/
DShadowDisplayManagerTest.java111 Point smallest = new Point(); in changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight() local
114 ShadowDisplay.getDefaultDisplay().getCurrentSizeRange(smallest, largest); in changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
115 assertThat(smallest).isEqualTo(new Point(320, 320)); in changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
123 ShadowDisplay.getDefaultDisplay().getCurrentSizeRange(smallest, largest); in changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
124 assertThat(smallest).isEqualTo(new Point(310, 310)); in changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
130 Point smallest = new Point(); in withQualifiers_changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight() local
134 display.getCurrentSizeRange(smallest, largest); in withQualifiers_changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
135 assertThat(smallest).isEqualTo(new Point(320, 320)); in withQualifiers_changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
140 display.getCurrentSizeRange(smallest, largest); in withQualifiers_changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
141 assertThat(smallest).isEqualTo(new Point(310, 310)); in withQualifiers_changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
/external/mesa3d/src/gallium/drivers/svga/
Dsvga_draw_arrays.c131 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()
/external/pdfium/third_party/libpng16/contrib/intel/
Dfilter_sse2_intrinsics.c267 __m128i smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2() local
270 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
271 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
302 __m128i smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2() local
305 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
306 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
361 __m128i smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth4_sse2() local
364 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth4_sse2()
365 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth4_sse2()
/external/libpng/contrib/intel/
Dfilter_sse2_intrinsics.c267 __m128i smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2() local
270 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
271 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
302 __m128i smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2() local
305 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
306 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
361 __m128i smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth4_sse2() local
364 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth4_sse2()
365 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth4_sse2()
/external/ltp/testcases/kernel/sched/eas/
Dutil.c161 unsigned int cap, smallest = -1; in find_cpus_with_capacity() local
170 if (cap < smallest) { in find_cpus_with_capacity()
171 smallest = cap; in find_cpus_with_capacity()
174 } else if (cap == smallest) { in find_cpus_with_capacity()
/external/skqp/tests/
DPathOpsCubicLineIntersectionIdeas.cpp195 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()
/external/skia/tests/
DPathOpsCubicLineIntersectionIdeas.cpp195 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()
/external/tensorflow/tensorflow/core/kernels/
Dtopk_op_gpu.h164 int smallest = node;
165 if (left < k && is_above(left, smallest)) {
166 smallest = left;
168 if (right < k && is_above(right, smallest)) {
169 smallest = right;
171 if (smallest == node) {
174 swap(smallest, node);
175 node = smallest;
/external/python/cpython3/Doc/library/
Dheapq.rst24 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 …]
/external/python/cpython2/Doc/library/
Dheapq.rst25 smallest element is always the root, ``heap[0]``.
30 since Python uses zero-based indexing. (b) Our pop method returns the smallest
35 surprises: ``heap[0]`` is the smallest item, and ``heap.sort()`` maintains the
51 Pop and return the smallest item from the *heap*, maintaining the heap
53 smallest item without popping it, use ``heap[0]``.
57 Push *item* on the heap, then pop and return the smallest item from the
70 Pop and return the smallest item from the *heap*, and also push the new *item*.
95 streams is already sorted (smallest to largest).
116 Return a list with the *n* smallest elements from the dataset defined by
137 pushing all values onto a heap and then popping off the smallest values one at a
[all …]
/external/lz4/examples/
DHCStreaming_ringBuffer.c143 size_t smallest = r0; in compare() local
144 if (r1<r0) smallest = r1; in compare()
145 result += smallest; in compare()
/external/robolectric-shadows/shadows/framework/src/main/java/org/robolectric/shadows/
DShadowDisplayManager.java88 int smallest = Math.min(displayInfo.appWidth, displayInfo.appHeight); in fixNominalDimens() local
91 displayInfo.smallestNominalAppWidth = smallest; in fixNominalDimens()
92 displayInfo.smallestNominalAppHeight = smallest; in fixNominalDimens()
/external/tensorflow/tensorflow/core/api_def/base_api/
Dapi_def_NthElement.pbtxt31 If the input is a vector (rank-1), finds the entries which is the nth-smallest
35 nth-smallest value in each row (resp. vector along the last dimension). Thus,
Dapi_def_Ceil.pbtxt3 summary: "Returns element-wise smallest integer not less than x."
Dapi_def_OrderedMapUnstageNoKey.pbtxt3 summary: "Op removes and returns the (key, value) element with the smallest"
Dapi_def_ArgMin.pbtxt11 summary: "Returns the index with the smallest value across dimensions of a tensor."
Dapi_def_EncodePng.pbtxt33 the smallest output, but is slower.
/external/swiftshader/third_party/llvm-7.0/llvm/test/Assembler/
Dinvalid-inttype.ll3 ; i16777216 is the smallest integer type that can't be represented in LLVM IR
/external/python/cpython3/Lib/tkinter/test/test_ttk/
Dtest_functions.py258 smallest = ttk._format_layoutlist([('a', None)], indent=0)
259 self.assertEqual(smallest,
261 self.assertEqual(smallest[0], 'a')
/external/python/cpython2/Lib/lib-tk/test/test_ttk/
Dtest_functions.py257 smallest = ttk._format_layoutlist([('a', None)], indent=0)
258 self.assertEqual(smallest,
260 self.assertEqual(smallest[0], 'a')
/external/python/cpython3/Lib/
Drandom.py707 smallest = 1e10
714 smallest = min(x, smallest)
721 (avg, stddev, smallest, largest))
/external/python/cpython2/Lib/
Drandom.py846 smallest = 1e10
853 smallest = min(x, smallest)
860 (avg, stddev, smallest, largest)
/external/u-boot/doc/
DREADME.fuse13 A fuse word is the smallest group of fuses that can be read at once from the
16 A fuse bank is the smallest group of fuse words having a common ID, as defined

123456789