| /external/clang/test/CodeGen/ |
| uint128_t.c | 5 extern uint64_t denom;
14 tmp /= denom;
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkMath.cpp | 50 int32_t SkMulDiv(int32_t numer1, int32_t numer2, int32_t denom) {
51 SkASSERT(denom);
55 tmp.div(denom, Sk64::kTrunc_DivOption);
236 if ((numer = (numer << 1) - denom) >= 0) \
237 result |= 1 << (n - 1); else numer += denom
239 int32_t SkDivBits(int32_t numer, int32_t denom, int shift_bias) {
240 SkASSERT(denom != 0);
245 // make numer and denom positive, and sign hold the resulting sign
246 int32_t sign = SkExtractSign(numer ^ denom);
248 denom = SkAbs32(denom)
[all...] |
| Sk64.cpp | 190 void Sk64::div(int32_t denom, DivOptions option)
192 SkASSERT(denom);
196 int sign = denom ^ hi;
198 denom = SkAbs32(denom);
205 if (option == kRound_DivOption) // add denom/2
207 uint32_t newLo = lo + (denom >> 1);
214 if (lo < (uint32_t)denom)
218 this->set(0, lo / denom);
228 int dbits = SkCLZ(denom);
[all...] |
| /external/skia/src/core/ |
| SkMath.cpp | 50 int32_t SkMulDiv(int32_t numer1, int32_t numer2, int32_t denom) {
51 SkASSERT(denom);
55 tmp.div(denom, Sk64::kTrunc_DivOption);
236 if ((numer = (numer << 1) - denom) >= 0) \
237 result |= 1 << (n - 1); else numer += denom
239 int32_t SkDivBits(int32_t numer, int32_t denom, int shift_bias) {
240 SkASSERT(denom != 0);
245 // make numer and denom positive, and sign hold the resulting sign
246 int32_t sign = SkExtractSign(numer ^ denom);
248 denom = SkAbs32(denom)
[all...] |
| Sk64.cpp | 190 void Sk64::div(int32_t denom, DivOptions option)
192 SkASSERT(denom);
196 int sign = denom ^ hi;
198 denom = SkAbs32(denom);
205 if (option == kRound_DivOption) // add denom/2
207 uint32_t newLo = lo + (denom >> 1);
214 if (lo < (uint32_t)denom)
218 this->set(0, lo / denom);
228 int dbits = SkCLZ(denom);
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkMath.h | 16 * Computes numer1 * numer2 / denom in full 64 intermediate precision.
17 * It is an error for denom to be 0. There is no special handling if
20 int32_t SkMulDiv(int32_t numer1, int32_t numer2, int32_t denom);
23 * Computes (numer1 << shift) / denom in full 64 intermediate precision.
24 * It is an error for denom to be 0. There is no special handling if
27 int32_t SkDivBits(int32_t numer, int32_t denom, int shift);
177 * Stores numer/denom and numer%denom into div and mod respectively.
180 inline void SkTDivMod(In numer, In denom, Out* div, Out* mod) {
188 const In d = numer/denom;
[all...] |
| /external/skia/include/core/ |
| SkMath.h | 16 * Computes numer1 * numer2 / denom in full 64 intermediate precision.
17 * It is an error for denom to be 0. There is no special handling if
20 int32_t SkMulDiv(int32_t numer1, int32_t numer2, int32_t denom);
23 * Computes (numer1 << shift) / denom in full 64 intermediate precision.
24 * It is an error for denom to be 0. There is no special handling if
27 int32_t SkDivBits(int32_t numer, int32_t denom, int shift);
177 * Stores numer/denom and numer%denom into div and mod respectively.
180 inline void SkTDivMod(In numer, In denom, Out* div, Out* mod) {
188 const In d = numer/denom;
[all...] |
| /bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
| imaxdiv.c | 34 imaxdiv(intmax_t numer, intmax_t denom)
38 retval.quot = numer / denom;
39 retval.rem = numer % denom;
42 retval.rem -= denom;
|
| /bionic/libc/upstream-netbsd/libc/stdlib/ |
| div.c | 47 div(int num, int denom)
51 r.quot = num / denom;
52 r.rem = num % denom;
62 * r.rem will have the same sign as denom and the opposite
68 * If both are num and denom are positive, r will always
74 * subtract denom from r.rem.
78 r.rem -= denom;
|
| ldiv.c | 47 ldiv(long num, long denom)
53 r.quot = num / denom;
54 r.rem = num % denom;
57 r.rem -= denom;
|
| lldiv.c | 53 lldiv(long long int num, long long int denom)
59 r.quot = num / denom;
60 r.rem = num % denom;
63 r.rem -= denom;
|
| /external/chromium_org/third_party/skia/src/effects/gradients/ |
| SkSweepGradient.cpp | 67 const double DENOM = N - 1;
71 double arg = i / DENOM;
73 int iv = (int)round(v * DENOM * 2 / PI);
94 // divide numer/denom, with a bias of 6bits. Assumes numer <= denom
95 // and denom != 0. Since our table is 6bits big (+1), this is a nice fit.
96 // Same as (but faster than) SkFixedDiv(numer, denom) >> 10
98 //unsigned div_64(int numer, int denom);
100 static unsigned div_64(int numer, int denom) {
101 SkASSERT(numer <= denom);
[all...] |
| /external/skia/src/effects/gradients/ |
| SkSweepGradient.cpp | 67 const double DENOM = N - 1;
71 double arg = i / DENOM;
73 int iv = (int)round(v * DENOM * 2 / PI);
94 // divide numer/denom, with a bias of 6bits. Assumes numer <= denom
95 // and denom != 0. Since our table is 6bits big (+1), this is a nice fit.
96 // Same as (but faster than) SkFixedDiv(numer, denom) >> 10
98 //unsigned div_64(int numer, int denom);
100 static unsigned div_64(int numer, int denom) {
101 SkASSERT(numer <= denom);
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_ctanhf.c | 43 float t, beta, s, rho, denom; local
73 denom = 1 + beta * s * s;
74 return (cpackf((beta * rho * s) / denom, t / denom));
|
| /external/compiler-rt/test/timing/ |
| timing.h | 23 conversion = (double) freq * (1e-9 * (double) info.numer / (double) info.denom);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/src/ |
| chrono.cpp | 54 // mach_absolute_time() * MachInfo.numer / MachInfo.denom is the number of
55 // nanoseconds since the computer booted up. MachInfo.numer and MachInfo.denom
59 // MachInfo.numer / MachInfo.denom is often 1 on the latest equipment. Specialize
77 return static_cast<double>(MachInfo.numer) / MachInfo.denom;
96 if (MachInfo.numer == MachInfo.denom)
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| grad.rs | 62 float denom = (y2 * y2 - 2 * y1 * y2 + x2 * x2 - 2 * x1 * x2 + y1 * y1 + x1 * x1);
63 if (denom == 0) {
66 grads[k].dy = (y1 - y2) / denom;
67 grads[k].dx = (x1 - x2) / denom;
68 grads[k].off = (y2 * y2 + x2 * x2 - x1 * x2 - y1 * y2) / denom;
|
| /external/chromium_org/ui/gfx/ |
| skbitmap_operations.cc | 381 const int32_t denom = 65536; local
382 int32_t s_numer = static_cast<int32_t>(hsl_shift.s * 2 * denom);
398 // Use denom * L to avoid rounding.
399 int32_t denom_l = (vmax + vmin) * (denom / 2);
402 r = (denom_l + r * s_numer - s_numer_l) / denom;
403 g = (denom_l + g * s_numer - s_numer_l) / denom;
404 b = (denom_l + b * s_numer - s_numer_l) / denom;
418 // Can't be too big since we need room for denom*denom and a bit for sign.
419 const int32_t denom = 1024 local
458 const int32_t denom = 1024; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_format_rgb9e5.h | 108 double denom; local
119 denom = pow(2, exp_shared - RGB9E5_EXP_BIAS - RGB9E5_MANTISSA_BITS);
121 maxm = (int) floor(maxrgb / denom + 0.5);
123 denom *= 2;
130 rm = (int) floor(rc / denom + 0.5);
131 gm = (int) floor(gc / denom + 0.5);
132 bm = (int) floor(bc / denom + 0.5);
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_format_rgb9e5.h | 108 double denom; local
119 denom = pow(2, exp_shared - RGB9E5_EXP_BIAS - RGB9E5_MANTISSA_BITS);
121 maxm = (int) floor(maxrgb / denom + 0.5);
123 denom *= 2;
130 rm = (int) floor(rc / denom + 0.5);
131 gm = (int) floor(gc / denom + 0.5);
132 bm = (int) floor(bc / denom + 0.5);
|
| /external/skia/tests/ |
| MathTest.cpp | 530 SkFixed denom = rand.nextS(); local
531 SkFixed result = SkFixedDiv(numer, denom);
532 SkLONGLONG check = ((SkLONGLONG)numer << 16) / denom;
535 (void)SkCLZ(denom);
545 result = SkFractDiv(numer, denom);
546 check = ((SkLONGLONG)numer << 30) / denom;
558 denom = denom << 8 >> 8;
560 result = SkFixedMul(numer, denom);
561 SkFixed r2 = symmetric_fixmul(numer, denom);
692 T denom; member in struct:__anon28905
706 const T denom = kEdgeCases[i].denom; local
716 T denom = 0; local
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkDLineIntersection.cpp | 19 double denom = byLen * axLen - ayLen * bxLen; local
20 SkASSERT(denom);
24 p.fX = (term1 * bxLen - axLen * term2) / denom;
25 p.fY = (term1 * byLen - ayLen * term2) / denom;
69 /* Slopes match when denom goes to zero:
73 byLen * axLen - ayLen * bxLen == 0 ( == denom )
75 double denom = bLen.fY * aLen.fX - aLen.fY * bLen.fX; local
79 numerA /= denom;
80 numerB /= denom;
82 if (!approximately_zero(denom)) {
144 double denom = axByLen - ayBxLen; local
[all...] |
| /external/skia/src/pathops/ |
| SkDLineIntersection.cpp | 19 double denom = byLen * axLen - ayLen * bxLen; local
20 SkASSERT(denom);
24 p.fX = (term1 * bxLen - axLen * term2) / denom;
25 p.fY = (term1 * byLen - ayLen * term2) / denom;
69 /* Slopes match when denom goes to zero:
73 byLen * axLen - ayLen * bxLen == 0 ( == denom )
75 double denom = bLen.fY * aLen.fX - aLen.fY * bLen.fX; local
79 numerA /= denom;
80 numerB /= denom;
82 if (!approximately_zero(denom)) {
144 double denom = axByLen - ayBxLen; local
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| DivZeroChecker.cpp | 60 SVal Denom = C.getState()->getSVal(B->getRHS(), C.getLocationContext());
61 Optional<DefinedSVal> DV = Denom.getAs<DefinedSVal>();
85 // If we get here, then the denom should not be zero. We abandon the implicit
86 // zero denom case for now.
|
| /frameworks/base/services/common_time/ |
| common_clock.cpp | 49 uint64_t denom = local_freq; local
51 LinearTransform::reduce(&numer, &denom);
52 if ((numer > UINT32_MAX) || (denom > UINT32_MAX)) {
61 static_cast<uint32_t>(denom);
|
