epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 1 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2 | /* |
epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 3 | * Copyright 2006 The Android Open Source Project |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 4 | * |
epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 5 | * Use of this source code is governed by a BSD-style license that can be |
| 6 | * found in the LICENSE file. |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 7 | */ |
| 8 | |
epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 9 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 10 | #ifndef SkMath_DEFINED |
| 11 | #define SkMath_DEFINED |
| 12 | |
| 13 | #include "SkTypes.h" |
| 14 | |
reed@google.com | 57212f9 | 2013-12-30 14:40:38 +0000 | [diff] [blame] | 15 | // 64bit -> 32bit utilities |
| 16 | |
| 17 | /** |
| 18 | * Return true iff the 64bit value can exactly be represented in signed 32bits |
| 19 | */ |
| 20 | static inline bool sk_64_isS32(int64_t value) { |
| 21 | return (int32_t)value == value; |
| 22 | } |
| 23 | |
| 24 | /** |
| 25 | * Return the 64bit argument as signed 32bits, asserting in debug that the arg |
| 26 | * exactly fits in signed 32bits. In the release build, no checks are preformed |
| 27 | * and the return value if the arg does not fit is undefined. |
| 28 | */ |
| 29 | static inline int32_t sk_64_asS32(int64_t value) { |
| 30 | SkASSERT(sk_64_isS32(value)); |
| 31 | return (int32_t)value; |
| 32 | } |
| 33 | |
| 34 | // Handy util that can be passed two ints, and will automatically promote to |
| 35 | // 64bits before the multiply, so the caller doesn't have to remember to cast |
| 36 | // e.g. (int64_t)a * b; |
| 37 | static inline int64_t sk_64_mul(int64_t a, int64_t b) { |
| 38 | return a * b; |
| 39 | } |
| 40 | |
reed@google.com | 4b163ed | 2012-08-07 21:35:13 +0000 | [diff] [blame] | 41 | /////////////////////////////////////////////////////////////////////////////// |
| 42 | |
commit-bot@chromium.org | 0f1fef8 | 2014-04-19 22:12:35 +0000 | [diff] [blame] | 43 | /** |
| 44 | * Computes numer1 * numer2 / denom in full 64 intermediate precision. |
| 45 | * It is an error for denom to be 0. There is no special handling if |
| 46 | * the result overflows 32bits. |
| 47 | */ |
| 48 | static inline int32_t SkMulDiv(int32_t numer1, int32_t numer2, int32_t denom) { |
| 49 | SkASSERT(denom); |
skia.committer@gmail.com | f7927dd | 2014-04-20 03:04:55 +0000 | [diff] [blame] | 50 | |
commit-bot@chromium.org | 0f1fef8 | 2014-04-19 22:12:35 +0000 | [diff] [blame] | 51 | int64_t tmp = sk_64_mul(numer1, numer2) / denom; |
| 52 | return sk_64_asS32(tmp); |
| 53 | } |
| 54 | |
| 55 | /** |
commit-bot@chromium.org | 0f1fef8 | 2014-04-19 22:12:35 +0000 | [diff] [blame] | 56 | * Return the integer square root of value, with a bias of bitBias |
| 57 | */ |
| 58 | int32_t SkSqrtBits(int32_t value, int bitBias); |
| 59 | |
| 60 | /** Return the integer square root of n, treated as a SkFixed (16.16) |
| 61 | */ |
| 62 | #define SkSqrt32(n) SkSqrtBits(n, 15) |
| 63 | |
reed@google.com | 4b163ed | 2012-08-07 21:35:13 +0000 | [diff] [blame] | 64 | /** |
| 65 | * Returns (value < 0 ? 0 : value) efficiently (i.e. no compares or branches) |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 66 | */ |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 67 | static inline int SkClampPos(int value) { |
| 68 | return value & ~(value >> 31); |
| 69 | } |
| 70 | |
| 71 | /** Given an integer and a positive (max) integer, return the value |
reed@google.com | 4b163ed | 2012-08-07 21:35:13 +0000 | [diff] [blame] | 72 | * pinned against 0 and max, inclusive. |
| 73 | * @param value The value we want returned pinned between [0...max] |
| 74 | * @param max The positive max value |
| 75 | * @return 0 if value < 0, max if value > max, else value |
| 76 | */ |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 77 | static inline int SkClampMax(int value, int max) { |
| 78 | // ensure that max is positive |
| 79 | SkASSERT(max >= 0); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 80 | if (value < 0) { |
| 81 | value = 0; |
| 82 | } |
| 83 | if (value > max) { |
| 84 | value = max; |
| 85 | } |
| 86 | return value; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 87 | } |
| 88 | |
reed@google.com | 4b163ed | 2012-08-07 21:35:13 +0000 | [diff] [blame] | 89 | /** |
reed@google.com | 4b163ed | 2012-08-07 21:35:13 +0000 | [diff] [blame] | 90 | * Returns true if value is a power of 2. Does not explicitly check for |
| 91 | * value <= 0. |
reed@android.com | f2b98d6 | 2010-12-20 18:26:13 +0000 | [diff] [blame] | 92 | */ |
mtklein | 883c8ef | 2016-08-16 09:36:18 -0700 | [diff] [blame] | 93 | template <typename T> constexpr inline bool SkIsPow2(T value) { |
reed@android.com | f2b98d6 | 2010-12-20 18:26:13 +0000 | [diff] [blame] | 94 | return (value & (value - 1)) == 0; |
| 95 | } |
| 96 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 97 | /////////////////////////////////////////////////////////////////////////////// |
| 98 | |
reed@google.com | 4b163ed | 2012-08-07 21:35:13 +0000 | [diff] [blame] | 99 | /** |
reed@google.com | 4b163ed | 2012-08-07 21:35:13 +0000 | [diff] [blame] | 100 | * Return a*b/((1 << shift) - 1), rounding any fractional bits. |
| 101 | * Only valid if a and b are unsigned and <= 32767 and shift is > 0 and <= 8 |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 102 | */ |
reed@google.com | ea774d2 | 2013-04-22 20:21:56 +0000 | [diff] [blame] | 103 | static inline unsigned SkMul16ShiftRound(U16CPU a, U16CPU b, int shift) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 104 | SkASSERT(a <= 32767); |
| 105 | SkASSERT(b <= 32767); |
| 106 | SkASSERT(shift > 0 && shift <= 8); |
mtklein | 3848427 | 2015-08-07 08:48:12 -0700 | [diff] [blame] | 107 | unsigned prod = a*b + (1 << (shift - 1)); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 108 | return (prod + (prod >> shift)) >> shift; |
| 109 | } |
| 110 | |
reed@google.com | 4b163ed | 2012-08-07 21:35:13 +0000 | [diff] [blame] | 111 | /** |
reed@google.com | ea774d2 | 2013-04-22 20:21:56 +0000 | [diff] [blame] | 112 | * Return a*b/255, rounding any fractional bits. |
| 113 | * Only valid if a and b are unsigned and <= 32767. |
reed@android.com | a0f5d15 | 2009-06-22 17:38:10 +0000 | [diff] [blame] | 114 | */ |
reed@google.com | ea774d2 | 2013-04-22 20:21:56 +0000 | [diff] [blame] | 115 | static inline U8CPU SkMulDiv255Round(U16CPU a, U16CPU b) { |
| 116 | SkASSERT(a <= 32767); |
| 117 | SkASSERT(b <= 32767); |
mtklein | 3848427 | 2015-08-07 08:48:12 -0700 | [diff] [blame] | 118 | unsigned prod = a*b + 128; |
reed@android.com | a0f5d15 | 2009-06-22 17:38:10 +0000 | [diff] [blame] | 119 | return (prod + (prod >> 8)) >> 8; |
| 120 | } |
| 121 | |
commit-bot@chromium.org | 2c86fbb | 2013-09-26 19:22:54 +0000 | [diff] [blame] | 122 | /** |
| 123 | * Stores numer/denom and numer%denom into div and mod respectively. |
| 124 | */ |
| 125 | template <typename In, typename Out> |
| 126 | inline void SkTDivMod(In numer, In denom, Out* div, Out* mod) { |
mtklein | 3a2682a | 2014-06-03 12:07:31 -0700 | [diff] [blame] | 127 | #ifdef SK_CPU_ARM32 |
commit-bot@chromium.org | 2c86fbb | 2013-09-26 19:22:54 +0000 | [diff] [blame] | 128 | // If we wrote this as in the else branch, GCC won't fuse the two into one |
| 129 | // divmod call, but rather a div call followed by a divmod. Silly! This |
| 130 | // version is just as fast as calling __aeabi_[u]idivmod manually, but with |
| 131 | // prettier code. |
| 132 | // |
| 133 | // This benches as around 2x faster than the code in the else branch. |
| 134 | const In d = numer/denom; |
| 135 | *div = static_cast<Out>(d); |
| 136 | *mod = static_cast<Out>(numer-d*denom); |
| 137 | #else |
| 138 | // On x86 this will just be a single idiv. |
| 139 | *div = static_cast<Out>(numer/denom); |
| 140 | *mod = static_cast<Out>(numer%denom); |
mtklein | 3a2682a | 2014-06-03 12:07:31 -0700 | [diff] [blame] | 141 | #endif |
commit-bot@chromium.org | 2c86fbb | 2013-09-26 19:22:54 +0000 | [diff] [blame] | 142 | } |
| 143 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 144 | #endif |