Searched defs:largest (Results 1 - 25 of 35) sorted by relevance

12

/external/fec/
H A Dpeakval_av.c1 /* 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
[all...]
/external/skia/src/pathops/
H A DSkPathOpsCurve.cpp48 double largest = SkTMax(SkTMax(maxX, maxY), -SkTMin(minX, minY)); local
49 if (!AlmostEqualUlps_Pin(largest, largest + minDist)) { // is distance within ULPS tolerance?
H A DSkPathOpsLine.cpp50 // 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 local
108 double largest = SkTMax(SkTMax(y, left), right); local
143 double largest = SkTMax(SkTMax(x, top), bottom); local
[all...]
H A DSkPathOpsCommon.cpp16 SkScalar largest = 0; local
19 largest = SkTMax(largest, SkScalarAbs(oneBounds[index]));
23 while ((next = scale * twoTo10) < largest) {
H A DSkPathOpsPoint.h156 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
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...]
H A DSkPathOpsCubic.cpp221 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), local
223 largest = SkTMax(largest, -tiniest);
225 if (!approximately_zero_when_compared_to(distance, largest)) {
229 return approximately_zero_when_compared_to(distance, largest);
H A DSkPathOpsQuad.cpp186 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), local
188 largest = SkTMax(largest, -tiniest);
189 return approximately_zero_when_compared_to(distance, largest);
H A DSkPathOpsTSect.h972 // so that each quad sect has a pointer to the largest, and can update it as spans
977 SkTSpan<TCurve, OppCurve>* largest = fHead; local
978 bool lCollapsed = largest->fCollapsed;
982 largest->fBoundsMax < test->fBoundsMax)) {
983 largest = test;
987 return largest;
2170 // find the largest bounds
/external/skqp/src/pathops/
H A DSkPathOpsCurve.cpp48 double largest = SkTMax(SkTMax(maxX, maxY), -SkTMin(minX, minY)); local
49 if (!AlmostEqualUlps_Pin(largest, largest + minDist)) { // is distance within ULPS tolerance?
H A DSkPathOpsLine.cpp50 // 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 local
108 double largest = SkTMax(SkTMax(y, left), right); local
143 double largest = SkTMax(SkTMax(x, top), bottom); local
[all...]
H A DSkPathOpsCommon.cpp16 SkScalar largest = 0; local
19 largest = SkTMax(largest, SkScalarAbs(oneBounds[index]));
23 while ((next = scale * twoTo10) < largest) {
H A DSkPathOpsPoint.h156 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
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...]
H A DSkPathOpsCubic.cpp221 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), local
223 largest = SkTMax(largest, -tiniest);
225 if (!approximately_zero_when_compared_to(distance, largest)) {
229 return approximately_zero_when_compared_to(distance, largest);
H A DSkPathOpsQuad.cpp183 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);
H A DSkPathOpsTSect.h972 // so that each quad sect has a pointer to the largest, and can update it as spans
977 SkTSpan<TCurve, OppCurve>* largest = fHead; local
978 bool lCollapsed = largest->fCollapsed;
982 largest->fBoundsMax < test->fBoundsMax)) {
983 largest = test;
987 return largest;
2170 // find the largest bounds
/external/speex/libspeex/
H A Dstereo.c151 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);*/
/external/linux-kselftest/tools/testing/selftests/vm/
H A Dthuge-gen.c198 unsigned long largest = getpagesize(); local
201 if (page_sizes[i] > largest)
202 largest = page_sizes[i];
212 if (read_sysfs(0, "/proc/sys/kernel/shmmax") < NUM_PAGES * largest) {
213 printf("Please do echo %lu > /proc/sys/kernel/shmmax", largest * NUM_PAGES);
218 if (largest != 1U<<30) {
/external/skia/tests/
H A DPathOpsCubicLineIntersectionIdeas.cpp184 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);
H A DMatrixTest.cpp468 SkScalar largest = (b > a) ? b : a; local
470 if (diff <= largest*tolerance) {
/external/skqp/tests/
H A DPathOpsCubicLineIntersectionIdeas.cpp184 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);
H A DMatrixTest.cpp468 SkScalar largest = (b > a) ? b : a; local
470 if (diff <= largest*tolerance) {
/external/swiftshader/third_party/LLVM/lib/ExecutionEngine/JIT/
H A DJITMemoryManager.cpp336 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/python/cpython2/Modules/
H A D_struct.c302 /* ulargest is the largest unsigned value with f->size bytes.
318 const Py_ssize_t largest = (Py_ssize_t)(ulargest >> 1); local
322 ~ largest,
323 largest);
/external/python/cpython3/Modules/
H A D_struct.c311 /* ulargest is the largest unsigned value with f->size bytes.
327 const Py_ssize_t largest = (Py_ssize_t)(ulargest >> 1); local
331 ~ largest,
332 largest);
/external/libvpx/libvpx/vp9/decoder/
H A Dvp9_decodeframe.c1597 // Rearrange the tile buffers such that the largest, and
1601 const TileBuffer largest = pbi->tile_buffers[0]; local
1604 pbi->tile_buffers[tile_cols - 1] = largest;

Completed in 2992 milliseconds

12