| /third_party/skia/src/pathops/ |
| D | SkPathOpsLine.cpp | 52 double largest = std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint() local
53 largest = std::max(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 = std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay() local
77 largest = std::max(largest, -tiniest); in nearRay()
78 return RoughlyEqualUlps(largest, largest + dist); // is the dist within ULPS tolerance? in nearRay()
108 double largest = std::max(std::max(y, left), right); in NearPointH() local
109 largest = std::max(largest, -tiniest); in NearPointH()
110 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? in NearPointH()
[all …]
|
| D | SkPathOpsPoint.h | 164 double largest = std::max(std::max(std::max(fX, a.fX), fY), a.fY); in approximatelyDEqual() local
165 largest = std::max(largest, -tiniest); in approximatelyDEqual()
166 return AlmostDequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyDEqual()
184 double largest = std::max(std::max(std::max(fX, a.fX), fY), a.fY); in approximatelyEqual() local
185 largest = std::max(largest, -tiniest); in approximatelyEqual()
186 return AlmostPequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyEqual()
207 float largest = std::max(std::max(std::max(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local
208 largest = std::max(largest, -tiniest); in ApproximatelyEqual()
209 return AlmostDequalUlps((double) largest, largest + dist); // is dist within ULPS tolerance? in ApproximatelyEqual()
245 double largest = std::max(std::max(std::max(fX, a.fX), fY), a.fY); in roughlyEqual() local
[all …]
|
| D | SkPathOpsCurve.cpp | 48 double largest = std::max(std::max(maxX, maxY), -std::min(minX, minY)); in nearPoint() local
49 if (!AlmostEqualUlps_Pin(largest, largest + minDist)) { // is distance within ULPS tolerance? in nearPoint()
|
| D | SkPathOpsQuad.cpp | 193 double largest = std::max(std::max(std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), in isLinear() local
195 largest = std::max(largest, -tiniest); in isLinear()
196 return approximately_zero_when_compared_to(distance, largest); in isLinear()
|
| D | SkPathOpsCubic.cpp | 221 …double largest = std::max(std::max(std::max(std::max(std::max(std::max(std::max(fPts[0].fX, fPts[0… in isLinear() local
223 largest = std::max(largest, -tiniest); in isLinear()
225 if (!approximately_zero_when_compared_to(distance, largest)) { in isLinear()
229 return approximately_zero_when_compared_to(distance, largest); in isLinear()
|
| /third_party/ltp/testcases/kernel/watchqueue/ |
| D | common.h | 141 size_t largest, len; in wqueue_consumer() local
143 largest = end - p; in wqueue_consumer()
144 if (largest > 128) in wqueue_consumer()
145 largest = 128; in wqueue_consumer()
147 if (largest < sizeof(struct watch_notification)) in wqueue_consumer()
148 tst_brk(TBROK, "Short message header: %zu", largest); in wqueue_consumer()
150 memcpy(&n, p, largest); in wqueue_consumer()
156 if (len < sizeof(n.n) || len > largest) in wqueue_consumer()
157 tst_brk(TBROK, "Bad message length: %zu/%zu", len, largest); in wqueue_consumer()
|
| /third_party/skia/docs/examples/ |
| D | Rect_isFinite.cpp | 7 SkRect largest = { SK_ScalarMin, SK_ScalarMin, SK_ScalarMax, SK_ScalarMax }; in draw() local
8 SkDebugf("largest is finite: %s\n", largest.isFinite() ? "true" : "false"); in draw()
9 SkDebugf("large width %g\n", largest.width()); in draw()
10 SkRect widest = SkRect::MakeWH(largest.width(), largest.height()); in draw()
|
| /third_party/curl/tests/libtest/ |
| D | lib1556.c | 31 size_t largest; member
40 if(headersize > info->largest) in header()
42 info->largest = headersize; in header()
72 printf("Max = %ld\n", (long)info.largest); in test()
|
| /third_party/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 184 double largest = std::max(fabs(allRoots[0]), fabs(allRoots[1])); in DEF_TEST() local
186 largest = std::max(largest, fabs(allRoots[2])); in DEF_TEST()
189 if (largest <= 1) { in DEF_TEST()
203 frexp(largest, &largeBits); in DEF_TEST()
|
| /third_party/ffmpeg/libavcodec/tests/ |
| D | celp_math.c | 27 float largest = (absb > absa) ? absb : absa; in IsAlmostEqual() local
28 av_assert0(diff <= largest * epsilon); in IsAlmostEqual()
|
| /third_party/ffmpeg/libavcodec/ |
| D | dvenc.c | 648 int largest = size[0] % 5; /* 'random' number */ in dv_guess_qnos_hd() local
654 if (qlevels[i] < qlevels[largest]) in dv_guess_qnos_hd()
655 largest = i; in dv_guess_qnos_hd()
658 i = largest; in dv_guess_qnos_hd()
660 largest = (largest+1) % 5; in dv_guess_qnos_hd()
690 int largest = size[0] % 5; /* 'random' number */ in dv_guess_qnos_hd() local
700 if (qlevels[i] > min_qlevel[i] && qlevels[i] > qlevels[largest]) in dv_guess_qnos_hd()
701 largest = i; in dv_guess_qnos_hd()
704 i = largest; in dv_guess_qnos_hd()
707 largest = (largest+1) % 5; in dv_guess_qnos_hd()
|
| /third_party/node/test/parallel/ |
| D | test-priority-queue.js | 92 const largest = { value: 15, position: null }; variable
93 queue.insert(largest);
96 assert.strictEqual(largest.position, 5);
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/gl/glx/ |
| D | PbufferSurfaceGLX.cpp | 21 bool largest, in PbufferSurfaceGLX() argument
27 mLargest(largest), in PbufferSurfaceGLX()
|
| D | PbufferSurfaceGLX.h | 26 bool largest,
|
| /third_party/skia/third_party/externals/opengl-registry/extensions/ATI/ |
| D | ATI_meminfo.txt | 84 largest pool available, total auxilliary pool available, and largest
135 param[1] - largest available free block in the pool
137 param[3] - largest auxiliary free block
|
| /third_party/openGLES/extensions/ATI/ |
| D | ATI_meminfo.txt | 84 largest pool available, total auxilliary pool available, and largest
135 param[1] - largest available free block in the pool
137 param[3] - largest auxiliary free block
|
| /third_party/openssl/crypto/ |
| D | README-sparse_array.md | 31 accommodate the largest index added to the data structure.
33 The largest index used to add a value to the array determines the tree height:
150 largest element. The base of the logarithm is `SA_BLOCK_MAX`, so for moderately
|
| /third_party/node/deps/openssl/openssl/crypto/ |
| D | README-sparse_array.md | 31 accommodate the largest index added to the data structure.
33 The largest index used to add a value to the array determines the tree height:
150 largest element. The base of the logarithm is `SA_BLOCK_MAX`, so for moderately
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/gl/wgl/ |
| D | PbufferSurfaceWGL.cpp | 24 bool largest, in PbufferSurfaceWGL() argument
31 mLargest(largest), in PbufferSurfaceWGL()
|
| D | PbufferSurfaceWGL.h | 29 bool largest,
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
| D | DebugInfoFlags.def | 69 // NOTE: always must be equal to largest flag, check this when adding new flag
97 // NOTE: Always must be equal to largest flag, check this when adding new flags.
|
| /third_party/skia/third_party/externals/piex/ |
| D | README | 1 The Preview Image Extractor (PIEX) is designed to find and extract the largest
|
| /third_party/openssl/doc/man7/ |
| D | EVP_KEYEXCH-DH.pod | 22 largest possible secret size.
25 the largest possible secret size.
|
| /third_party/vixl/test/aarch32/config/ |
| D | data-types.json | 2346 "0x7fefffffffffffff", // The largest finite value.
2362 // - The largest subnormal value.
|
| /third_party/skia/third_party/externals/dawn/src/dawn_native/metal/ |
| D | BufferMTL.mm | 26 // largest alignment of supported data types
78 // buffer must be aligned to the largest alignment of its members.
|