| /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/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 | 142 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyEqual() local
143 largest = SkTMax(largest, -tiniest); in approximatelyEqual()
144 return AlmostPequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyEqual()
165 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local
166 largest = SkTMax(largest, -tiniest); in ApproximatelyEqual()
167 return AlmostPequalUlps((double) largest, largest + dist); // is dist within ULPS tolerance? in ApproximatelyEqual()
203 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in roughlyEqual() local
204 largest = SkTMax(largest, -tiniest); in roughlyEqual()
205 return RoughlyEqualUlps(largest, largest + dist); // is the dist within ULPS tolerance? in roughlyEqual()
217 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); in RoughlyEqual() local
[all …]
|
| D | SkPathOpsQuad.cpp | 153 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), in isLinear() local
155 largest = SkTMax(largest, -tiniest); in isLinear()
156 return approximately_zero_when_compared_to(distance, largest); in isLinear()
|
| /external/skia/src/core/ |
| D | SkChunkAlloc.cpp | 89 Block* largest = fBlock; in rewind()
91 if (largest) { in rewind()
93 for (Block* cur = largest->fNext; cur; cur = next) { in rewind()
95 if (cur->blockSize() > largest->blockSize()) { in rewind()
96 sk_free(largest); in rewind()
97 largest = cur; in rewind()
103 largest->reset(); in rewind()
104 fTotalCapacity = largest->blockSize(); in rewind()
111 fBlock = largest; in rewind()
|
| /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
|
| D | comdat10.ll | 3 $c = comdat largest
|
| D | comdat12.ll | 3 $foo = comdat largest
|
| D | comdat7.ll | 3 $c1 = comdat largest
|
| /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/icu/icu4c/source/i18n/ |
| D | digitinterval.h | 103 void setMostSignificantExclusive(int32_t largest) { in setMostSignificantExclusive() argument
104 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
|
| D | coff-comdat3.ll | 6 $foo = comdat largest
|
| /external/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 182 double largest = SkTMax(fabs(allRoots[0]), fabs(allRoots[1])); in DEF_TEST() local
184 largest = SkTMax(largest, fabs(allRoots[2])); in DEF_TEST()
187 if (largest <= 1) { in DEF_TEST()
201 frexp(largest, &largeBits); in DEF_TEST()
|
| /external/llvm/test/Linker/Inputs/ |
| D | comdat.ll | 4 $foo = comdat largest
11 $qux = comdat largest
|
| D | comdat2.ll | 1 $foo = comdat largest
|
| D | comdat8.ll | 1 $c1 = comdat largest
|
| /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/piex/ |
| D | README | 1 The Preview Image Extractor (PIEX) is designed to find and extract the largest
|
| /external/llvm/test/Verifier/ |
| D | comdat3.ll | 5 $v = comdat largest
|
| /external/llvm/test/SymbolRewriter/ |
| D | rewrite.ll | 43 $source_comdat_variable = comdat largest
51 ; CHECK: $target_comdat_variable = comdat largest
|
| /external/llvm/test/CodeGen/SystemZ/ |
| D | atomicrmw-and-03.ll | 51 ; Check the largest useful NILL value.
69 ; Check the largest useful NILH value, which is one less than the above.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| D | LUDecompositionImpl.java | 117 double largest = Double.NEGATIVE_INFINITY; in LUDecompositionImpl() local
127 if (FastMath.abs(sum) > largest) { in LUDecompositionImpl()
128 largest = FastMath.abs(sum); in LUDecompositionImpl()
|
| /external/llvm/test/MC/COFF/ |
| D | linkonce.s | 30 .linkonce largest
|