| /external/fec/ |
| D | peakval_av.c | 15 vector signed short smallest,largest; in peakval_av() local
18 largest = (vector signed short)(0); in peakval_av()
27 largest = vec_max(largest,x); in peakval_av()
35 largest = vec_max(largest,x); in peakval_av()
45 largest = vec_max(largest,x); in peakval_av()
48 largest = vec_max(largest,vec_abs(smallest)); in peakval_av()
51 largest = vec_max(largest,vec_sro(largest,s.cv)); in peakval_av()
54 largest = vec_max(largest,vec_sro(largest,s.cv)); in peakval_av()
57 largest = vec_max(largest,vec_sro(largest,s.cv)); in peakval_av()
59 s.hv = largest; in peakval_av()
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsLine.cpp | 52 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint() local
53 largest = SkTMax(largest, -tiniest); in nearPoint()
54 if (!AlmostEqualUlps_Pin(largest, largest + dist)) { // is the dist within ULPS tolerance? in nearPoint()
58 *unequal = (float) largest != (float) (largest + dist); in nearPoint()
76 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay() local
77 largest = SkTMax(largest, -tiniest); in nearRay()
78 return RoughlyEqualUlps(largest, largest + dist); // is the dist within ULPS tolerance? in nearRay()
108 double largest = SkTMax(SkTMax(y, left), right); in NearPointH() local
109 largest = SkTMax(largest, -tiniest); in NearPointH()
110 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? in NearPointH()
[all …]
|
| D | SkPathOpsPoint.h | 156 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyDEqual() local
157 largest = SkTMax(largest, -tiniest); in approximatelyDEqual()
158 return AlmostDequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyDEqual()
176 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyEqual() local
177 largest = SkTMax(largest, -tiniest); in approximatelyEqual()
178 return AlmostPequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyEqual()
199 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local
200 largest = SkTMax(largest, -tiniest); in ApproximatelyEqual()
201 return AlmostDequalUlps((double) largest, largest + dist); // is dist within ULPS tolerance? in ApproximatelyEqual()
237 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in roughlyEqual() local
[all …]
|
| D | SkPathOpsCommon.cpp | 16 SkScalar largest = 0; in ScaleFactor() local
19 largest = SkTMax(largest, SkScalarAbs(oneBounds[index])); in ScaleFactor()
23 while ((next = scale * twoTo10) < largest) { in ScaleFactor()
|
| D | SkPathOpsCurve.cpp | 48 double largest = SkTMax(SkTMax(maxX, maxY), -SkTMin(minX, minY)); in nearPoint() local
49 if (!AlmostEqualUlps_Pin(largest, largest + minDist)) { // is distance within ULPS tolerance? in nearPoint()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsLine.cpp | 52 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint() local
53 largest = SkTMax(largest, -tiniest); in nearPoint()
54 if (!AlmostEqualUlps_Pin(largest, largest + dist)) { // is the dist within ULPS tolerance? in nearPoint()
58 *unequal = (float) largest != (float) (largest + dist); in nearPoint()
76 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay() local
77 largest = SkTMax(largest, -tiniest); in nearRay()
78 return RoughlyEqualUlps(largest, largest + dist); // is the dist within ULPS tolerance? in nearRay()
108 double largest = SkTMax(SkTMax(y, left), right); in NearPointH() local
109 largest = SkTMax(largest, -tiniest); in NearPointH()
110 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? in NearPointH()
[all …]
|
| D | SkPathOpsPoint.h | 156 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyDEqual() local
157 largest = SkTMax(largest, -tiniest); in approximatelyDEqual()
158 return AlmostDequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyDEqual()
176 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyEqual() local
177 largest = SkTMax(largest, -tiniest); in approximatelyEqual()
178 return AlmostPequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyEqual()
199 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local
200 largest = SkTMax(largest, -tiniest); in ApproximatelyEqual()
201 return AlmostDequalUlps((double) largest, largest + dist); // is dist within ULPS tolerance? in ApproximatelyEqual()
237 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in roughlyEqual() local
[all …]
|
| D | SkPathOpsCommon.cpp | 16 SkScalar largest = 0; in ScaleFactor() local
19 largest = SkTMax(largest, SkScalarAbs(oneBounds[index])); in ScaleFactor()
23 while ((next = scale * twoTo10) < largest) { in ScaleFactor()
|
| D | SkPathOpsCurve.cpp | 48 double largest = SkTMax(SkTMax(maxX, maxY), -SkTMin(minX, minY)); in nearPoint() local
49 if (!AlmostEqualUlps_Pin(largest, largest + minDist)) { // is distance within ULPS tolerance? in nearPoint()
|
| D | SkPathOpsQuad.cpp | 186 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), in isLinear() local
188 largest = SkTMax(largest, -tiniest); in isLinear()
189 return approximately_zero_when_compared_to(distance, largest); in isLinear()
|
| /external/robolectric-shadows/robolectric/src/test/java/org/robolectric/shadows/ |
| D | ShadowDisplayManagerTest.java | 98 Point largest = new Point(); in changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight() local
100 ShadowDisplay.getDefaultDisplay().getCurrentSizeRange(smallest, largest); in changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
102 assertThat(largest).isEqualTo(new Point(470, 470)); in changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
109 ShadowDisplay.getDefaultDisplay().getCurrentSizeRange(smallest, largest); in changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
111 assertThat(largest).isEqualTo(new Point(460, 460)); in changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
117 Point largest = new Point(); in withQualifiers_changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight() local
120 display.getCurrentSizeRange(smallest, largest); in withQualifiers_changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
122 assertThat(largest).isEqualTo(new Point(470, 470)); in withQualifiers_changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
126 display.getCurrentSizeRange(smallest, largest); in withQualifiers_changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
128 assertThat(largest).isEqualTo(new Point(460, 460)); in withQualifiers_changeDisplay_shouldUpdateSmallestAndLargestNominalWidthAndHeight()
|
| /external/speex/libspeex/ |
| D | stereo.c | 151 spx_word32_t largest, smallest; in speex_encode_stereo_int() local
177 largest = e_left; in speex_encode_stereo_int()
181 largest = e_right; in speex_encode_stereo_int()
187 shift = spx_ilog2(largest)-15; in speex_encode_stereo_int()
188 largest = VSHR32(largest, shift-4); in speex_encode_stereo_int()
190 balance = DIV32(largest, ADD32(smallest, 1)); in speex_encode_stereo_int()
195 balance=(largest+1.)/(smallest+1.); in speex_encode_stereo_int()
|
| /external/llvm/test/Linker/ |
| D | comdat.ll | 5 $foo = comdat largest
12 $qux = comdat largest
22 ; CHECK: $qux = comdat largest
23 ; CHECK: $foo = comdat largest
|
| D | comdat9.ll | 13 $f2 = comdat largest
21 ; CHECK-DAG: $f2 = comdat largest
|
| /external/linux-kselftest/tools/testing/selftests/vm/ |
| D | thuge-gen.c | 198 unsigned long largest = getpagesize(); in sanity_checks() local
201 if (page_sizes[i] > largest) in sanity_checks()
202 largest = page_sizes[i]; in sanity_checks()
212 if (read_sysfs(0, "/proc/sys/kernel/shmmax") < NUM_PAGES * largest) { in sanity_checks()
213 printf("Please do echo %lu > /proc/sys/kernel/shmmax", largest * NUM_PAGES); in sanity_checks()
218 if (largest != 1U<<30) { in sanity_checks()
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_TopKV2.pbtxt | 22 The `k` largest elements along each last dimensional slice.
38 summary: "Finds values and indices of the `k` largest elements for the last dimension."
40 If the input is a vector (rank-1), finds the `k` largest entries in the vector
42 `j`-th largest entry in `input`, and its index is `indices[j]`.
|
| D | api_def_TopK.pbtxt | 12 The `k` largest elements along each last dimensional slice.
35 summary: "Finds values and indices of the `k` largest elements for the last dimension."
37 If the input is a vector (rank-1), finds the `k` largest entries in the vector
39 `j`-th largest entry in `input`, and its index is `indices[j]`.
|
| /external/icu/icu4c/source/i18n/ |
| D | digitinterval.h | 105 void setMostSignificantExclusive(int32_t largest) { in setMostSignificantExclusive() argument
106 fLargestExclusive = largest > 0 ? largest : 0; in setMostSignificantExclusive()
|
| /external/llvm/test/CodeGen/X86/ |
| D | coff-comdat.ll | 15 $f3 = comdat largest
53 $vftable = comdat largest
62 ; CHECK: .section .text,"xr",largest,_f3
90 ; CHECK: .section .rdata,"dr",largest,_vftable
|
| /external/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 184 double largest = SkTMax(fabs(allRoots[0]), fabs(allRoots[1])); in DEF_TEST() local
186 largest = SkTMax(largest, fabs(allRoots[2])); in DEF_TEST()
189 if (largest <= 1) { in DEF_TEST()
203 frexp(largest, &largeBits); in DEF_TEST()
|
| /external/skqp/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 184 double largest = SkTMax(fabs(allRoots[0]), fabs(allRoots[1])); in DEF_TEST() local
186 largest = SkTMax(largest, fabs(allRoots[2])); in DEF_TEST()
189 if (largest <= 1) { in DEF_TEST()
203 frexp(largest, &largeBits); in DEF_TEST()
|
| /external/llvm/test/Linker/Inputs/ |
| D | comdat.ll | 4 $foo = comdat largest
11 $qux = comdat largest
|
| /external/swiftshader/third_party/LLVM/lib/ExecutionEngine/JIT/ |
| D | JITMemoryManager.cpp | 336 uintptr_t largest = candidateBlock->BlockSize; in startFunctionBody() local
340 if (iter->BlockSize > largest) { in startFunctionBody()
341 largest = iter->BlockSize; in startFunctionBody()
347 largest = largest - sizeof(MemoryRangeHeader); in startFunctionBody()
351 if (largest < ActualSize || in startFunctionBody()
352 largest <= FreeRangeHeader::getMinBlockSize()) { in startFunctionBody()
|
| /external/llvm/test/CodeGen/AMDGPU/ |
| D | smrd.ll | 17 ; SMRD load with the largest possible immediate offset.
29 ; SMRD load with an offset greater than the largest possible immediate.
59 ; SMRD load with the largest possible immediate offset on VI
73 ; SMRD load with an offset greater than the largest possible immediate on VI
100 ; SMRD load using the load.const intrinsic with the largest possible immediate
130 ; SMRD load with the largest possible immediate offset on VI
145 ; SMRD load with an offset greater than the largest possible immediate on VI
|
| /external/robolectric-shadows/shadows/framework/src/main/java/org/robolectric/shadows/ |
| D | ShadowDisplayManager.java | 89 int largest = Math.max(displayInfo.appWidth, displayInfo.appHeight); in fixNominalDimens() local
93 displayInfo.largestNominalAppWidth = largest; in fixNominalDimens()
94 displayInfo.largestNominalAppHeight = largest; in fixNominalDimens()
|