| /external/fec/ |
| peakval_av.c | 1 /* Return the largest absolute value of a vector of signed shorts
15 vector signed short smallest,largest; local
18 largest = (vector signed short)(0);
27 largest = vec_max(largest,x);
35 largest = vec_max(largest,x);
45 largest = vec_max(largest,x);
48 largest = vec_max(largest,vec_abs(smallest))
[all...] |
| /external/skia/src/pathops/ |
| SkPathOpsLine.cpp | 50 // find the ordinal in the original line with the largest unsigned exponent
52 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); local
53 largest = SkTMax(largest, -tiniest);
54 if (!AlmostEqualUlps_Pin(largest, largest + dist)) { // is the dist within ULPS tolerance?
58 *unequal = (float) largest != (float) (largest + dist);
74 // find the ordinal in the original line with the largest unsigned exponent
76 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY) local
108 double largest = SkTMax(SkTMax(y, left), right); local
143 double largest = SkTMax(SkTMax(x, top), bottom); local
[all...] |
| SkPathOpsPoint.h | 156 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local
157 largest = SkTMax(largest, -tiniest);
158 return AlmostDequalUlps(largest, largest + dist); // is the dist within ULPS tolerance?
176 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local
177 largest = SkTMax(largest, -tiniest);
178 return AlmostPequalUlps(largest, largest + dist); // is the dist within ULPS tolerance
199 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); local
237 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local
251 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); local
[all...] |
| SkPathOpsCommon.cpp | 16 SkScalar largest = 0; local
19 largest = SkTMax(largest, SkScalarAbs(oneBounds[index]));
23 while ((next = scale * twoTo10) < largest) {
|
| SkPathOpsCurve.cpp | 48 double largest = SkTMax(SkTMax(maxX, maxY), -SkTMin(minX, minY)); local
49 if (!AlmostEqualUlps_Pin(largest, largest + minDist)) { // is distance within ULPS tolerance?
|
| SkPathOpsQuad.cpp | 183 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), local
185 largest = SkTMax(largest, -tiniest);
186 return approximately_zero_when_compared_to(distance, largest);
|
| /external/icu/icu4c/source/i18n/ |
| digitinterval.h | 102 * Sets the most significant exclusive value to largest.
103 * If largest <= 0 then most significant exclusive value becomes 0.
105 void setMostSignificantExclusive(int32_t largest) {
106 fLargestExclusive = largest > 0 ? largest : 0;
|
| /external/llvm/test/MC/COFF/ |
| linkonce.s | 30 .linkonce largest
140 // CHECK: Selection: Largest (0x6)
|
| section-comdat.s | 32 .section SecName, "dr", largest, "Symbol6"
174 // CHECK: Selection: Largest
|
| /external/speex/libspeex/ |
| stereo.c | 151 spx_word32_t largest, smallest; local
177 largest = e_left;
181 largest = e_right;
187 shift = spx_ilog2(largest)-15;
188 largest = VSHR32(largest, shift-4);
190 balance = DIV32(largest, ADD32(smallest, 1));
195 balance=(largest+1.)/(smallest+1.);
216 /*fprintf (stderr, "%d %d %d %d\n", largest, smallest, balance_id, e_ratio);*/
|
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/EfiCommonLib/Ia32/ |
| GetPowerOfTwo.asm | 18 ; Calculates the largest integer that is both
37 ; Calculates the largest integer that is both
46 ; the largest integer that is both a power of
|
| Log2.asm | 45 ; The largest integer that is less than or equal
|
| /external/linux-kselftest/tools/testing/selftests/vm/ |
| thuge-gen.c | 197 unsigned long largest = getpagesize(); local
200 if (page_sizes[i] > largest)
201 largest = page_sizes[i];
211 if (read_sysfs(0, "/proc/sys/kernel/shmmax") < NUM_PAGES * largest) {
212 printf("Please do echo %lu > /proc/sys/kernel/shmmax", largest * NUM_PAGES);
217 if (largest != 1U<<30) {
|
| /prebuilts/go/darwin-x86/test/ |
| string_lit.go | 99 r = 0x10ffff // largest rune value
101 assert(s, "\xf4\x8f\xbf\xbf", "largest rune")
117 s = string(0x10ffff) // largest rune value
118 assert(s, "\xf4\x8f\xbf\xbf", "largest rune constant")
|
| /prebuilts/go/linux-x86/test/ |
| string_lit.go | 99 r = 0x10ffff // largest rune value
101 assert(s, "\xf4\x8f\xbf\xbf", "largest rune")
117 s = string(0x10ffff) // largest rune value
118 assert(s, "\xf4\x8f\xbf\xbf", "largest rune constant")
|
| /external/skia/tests/ |
| PathOpsCubicLineIntersectionIdeas.cpp | 184 double largest = SkTMax(fabs(allRoots[0]), fabs(allRoots[1])); local
186 largest = SkTMax(largest, fabs(allRoots[2]));
189 if (largest <= 1) {
203 frexp(largest, &largeBits);
|
| /packages/apps/Settings/src/com/android/settings/datausage/ |
| DataUsageList.java | 317 long largest = 0; local
340 largest = accumulate(managedKey, knownItems, entry, AppItem.CATEGORY_USER,
341 items, largest);
365 largest = accumulate(collapseKey, knownItems, entry, category, items, largest);
389 final int percentTotal = largest != 0 ? (int) (items.get(i).total * 100 / largest) : 0;
422 NetworkStats.Entry entry, int itemCategory, ArrayList<AppItem> items, long largest) {
433 return Math.max(largest, item.total);
|
| /prebuilts/go/darwin-x86/src/math/ |
| const.go | 26 // Max is the largest finite value representable by the type.
|
| /prebuilts/go/linux-x86/src/math/ |
| const.go | 26 // Max is the largest finite value representable by the type.
|
| /prebuilts/go/darwin-x86/src/hash/adler32/ |
| adler32.go | 18 // mod is the largest prime that is less than 65536.
20 // nmax is the largest n such that
|
| /prebuilts/go/linux-x86/src/hash/adler32/ |
| adler32.go | 18 // mod is the largest prime that is less than 65536.
20 // nmax is the largest n such that
|
| /packages/apps/Camera2/src/com/android/camera/settings/ |
| ResolutionUtil.java | 84 * This is a sorted list of sizes, going from largest to smallest.
90 public Size largest; field in class:ResolutionUtil.ResolutionBucket
92 * This is the area of the largest size, used for sorting
121 * sDesiredAspectRatios, and the largest full sensor ratio. T his guarantees
138 // Now go through the buckets from largest mp to smallest, adding
175 * spaced out options. It starts with the largest, then tries to find one at
184 Size largest = sizes.get(0); local
185 result.add(largest);
186 Size lastSize = largest;
188 double targetArea = Math.pow(.5, result.size()) * area(largest);
[all...] |
| /external/swiftshader/third_party/LLVM/lib/ExecutionEngine/JIT/ |
| JITMemoryManager.cpp | 336 uintptr_t largest = candidateBlock->BlockSize; local
338 // Search for the largest free block
340 if (iter->BlockSize > largest) {
341 largest = iter->BlockSize;
347 largest = largest - sizeof(MemoryRangeHeader);
351 if (largest < ActualSize ||
352 largest <= FreeRangeHeader::getMinBlockSize()) {
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| LUDecompositionImpl.java | 117 double largest = Double.NEGATIVE_INFINITY; local
127 if (FastMath.abs(sum) > largest) {
128 largest = FastMath.abs(sum);
|
| /prebuilts/go/darwin-x86/src/cmd/nm/ |
| doc.go | 37 // size orders from largest to smallest
|
