mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 1 | /* |
epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 2 | * Copyright 2011 Google Inc. |
| 3 | * |
| 4 | * Use of this source code is governed by a BSD-style license that can be |
| 5 | * found in the LICENSE file. |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 6 | */ |
| 7 | |
| 8 | #include "SkClampRange.h" |
halcanary | 4dbbd04 | 2016-06-07 17:21:10 -0700 | [diff] [blame] | 9 | #include "SkMathPriv.h" |
reed | 9d91eb3 | 2015-01-28 11:44:48 -0800 | [diff] [blame] | 10 | |
| 11 | static int SkCLZ64(uint64_t value) { |
| 12 | int count = 0; |
| 13 | if (value >> 32) { |
| 14 | value >>= 32; |
| 15 | } else { |
| 16 | count += 32; |
| 17 | } |
| 18 | return count + SkCLZ(SkToU32(value)); |
| 19 | } |
| 20 | |
Florin Malita | 72245c5 | 2016-12-13 09:42:20 -0500 | [diff] [blame] | 21 | static bool sk_64_smul_check(int64_t count, int64_t dx, int64_t* result) { |
reed | 9d91eb3 | 2015-01-28 11:44:48 -0800 | [diff] [blame] | 22 | // Do it the slow way until we have some assembly. |
Florin Malita | 72245c5 | 2016-12-13 09:42:20 -0500 | [diff] [blame] | 23 | if (dx == std::numeric_limits<int64_t>::min()) { |
| 24 | return false; // SkTAbs overflow |
| 25 | } |
| 26 | |
| 27 | SkASSERT(count >= 0); |
| 28 | uint64_t ucount = static_cast<uint64_t>(count); |
| 29 | uint64_t udx = static_cast<uint64_t>(SkTAbs(dx)); |
| 30 | int zeros = SkCLZ64(ucount) + SkCLZ64(udx); |
reed | 9d91eb3 | 2015-01-28 11:44:48 -0800 | [diff] [blame] | 31 | // this is a conservative check: it may return false when in fact it would not have overflowed. |
| 32 | // Hackers Delight uses 34 as its convervative check, but that is for 32x32 multiplies. |
| 33 | // Since we are looking at 64x64 muls, we add 32 to the check. |
| 34 | if (zeros < (32 + 34)) { |
| 35 | return false; |
| 36 | } |
Florin Malita | 72245c5 | 2016-12-13 09:42:20 -0500 | [diff] [blame] | 37 | *result = count * dx; |
reed | 9d91eb3 | 2015-01-28 11:44:48 -0800 | [diff] [blame] | 38 | return true; |
| 39 | } |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 40 | |
Florin Malita | d956966 | 2017-02-09 16:41:34 -0500 | [diff] [blame] | 41 | static bool sk_64_sadd_check(int64_t a, int64_t b, int64_t* result) { |
| 42 | if (a > 0) { |
| 43 | if (b > std::numeric_limits<int64_t>::max() - a) { |
| 44 | return false; |
| 45 | } |
| 46 | } else { |
| 47 | if (b < std::numeric_limits<int64_t>::min() - a) { |
| 48 | return false; |
| 49 | } |
| 50 | } |
| 51 | |
| 52 | *result = a + b; |
| 53 | return true; |
| 54 | } |
| 55 | |
| 56 | |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 57 | /* |
| 58 | * returns [0..count] for the number of steps (<= count) for which x0 <= edge |
| 59 | * given each step is followed by x0 += dx |
| 60 | */ |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 61 | static int chop(int64_t x0, SkGradFixed edge, int64_t x1, int64_t dx, int count) { |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 62 | SkASSERT(dx > 0); |
| 63 | SkASSERT(count >= 0); |
| 64 | |
| 65 | if (x0 >= edge) { |
| 66 | return 0; |
| 67 | } |
| 68 | if (x1 <= edge) { |
| 69 | return count; |
| 70 | } |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 71 | int64_t n = (edge - x0 + dx - 1) / dx; |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 72 | SkASSERT(n >= 0); |
| 73 | SkASSERT(n <= count); |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 74 | return (int)n; |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 75 | } |
| 76 | |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 77 | void SkClampRange::initFor1(SkGradFixed fx) { |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 78 | fCount0 = fCount1 = fCount2 = 0; |
| 79 | if (fx <= 0) { |
| 80 | fCount0 = 1; |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 81 | } else if (fx < kFracMax_SkGradFixed) { |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 82 | fCount1 = 1; |
| 83 | fFx1 = fx; |
| 84 | } else { |
| 85 | fCount2 = 1; |
| 86 | } |
| 87 | } |
| 88 | |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 89 | void SkClampRange::init(SkGradFixed fx0, SkGradFixed dx0, int count, int v0, int v1) { |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 90 | SkASSERT(count > 0); |
| 91 | |
| 92 | fV0 = v0; |
| 93 | fV1 = v1; |
| 94 | |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 95 | // special case 1 == count, as it is slightly common for skia |
| 96 | // and avoids us ever calling divide or 64bit multiply |
| 97 | if (1 == count) { |
| 98 | this->initFor1(fx0); |
| 99 | return; |
reed@google.com | 63c1ad8 | 2011-04-18 14:15:36 +0000 | [diff] [blame] | 100 | } |
| 101 | |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 102 | int64_t fx = fx0; |
| 103 | int64_t dx = dx0; |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 104 | |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 105 | // start with ex equal to the last computed value |
Florin Malita | d956966 | 2017-02-09 16:41:34 -0500 | [diff] [blame] | 106 | int64_t count_times_dx, ex; |
| 107 | if (!sk_64_smul_check(count - 1, dx, &count_times_dx) || |
| 108 | !sk_64_sadd_check(fx, count_times_dx, &ex)) { |
reed | 9d91eb3 | 2015-01-28 11:44:48 -0800 | [diff] [blame] | 109 | // we can't represent the computed end in 32.32, so just draw something (first color) |
| 110 | fCount1 = fCount2 = 0; |
| 111 | fCount0 = count; |
| 112 | return; |
| 113 | } |
| 114 | |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 115 | if ((uint64_t)(fx | ex) <= kFracMax_SkGradFixed) { |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 116 | fCount0 = fCount2 = 0; |
| 117 | fCount1 = count; |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 118 | fFx1 = fx0; |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 119 | return; |
| 120 | } |
| 121 | if (fx <= 0 && ex <= 0) { |
| 122 | fCount1 = fCount2 = 0; |
| 123 | fCount0 = count; |
| 124 | return; |
| 125 | } |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 126 | if (fx >= kFracMax_SkGradFixed && ex >= kFracMax_SkGradFixed) { |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 127 | fCount0 = fCount1 = 0; |
| 128 | fCount2 = count; |
| 129 | return; |
| 130 | } |
| 131 | |
| 132 | // now make ex be 1 past the last computed value |
| 133 | ex += dx; |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 134 | |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 135 | bool doSwap = dx < 0; |
| 136 | |
| 137 | if (doSwap) { |
| 138 | ex -= dx; |
| 139 | fx -= dx; |
| 140 | SkTSwap(fx, ex); |
| 141 | dx = -dx; |
| 142 | } |
| 143 | |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 144 | |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 145 | fCount0 = chop(fx, 0, ex, dx, count); |
reed | 9d91eb3 | 2015-01-28 11:44:48 -0800 | [diff] [blame] | 146 | SkASSERT(fCount0 >= 0); |
| 147 | SkASSERT(fCount0 <= count); |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 148 | count -= fCount0; |
| 149 | fx += fCount0 * dx; |
| 150 | SkASSERT(fx >= 0); |
| 151 | SkASSERT(fCount0 == 0 || (fx - dx) < 0); |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 152 | fCount1 = chop(fx, kFracMax_SkGradFixed, ex, dx, count); |
reed | 9d91eb3 | 2015-01-28 11:44:48 -0800 | [diff] [blame] | 153 | SkASSERT(fCount1 >= 0); |
| 154 | SkASSERT(fCount1 <= count); |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 155 | count -= fCount1; |
| 156 | fCount2 = count; |
| 157 | |
| 158 | #ifdef SK_DEBUG |
| 159 | fx += fCount1 * dx; |
| 160 | SkASSERT(fx <= ex); |
| 161 | if (fCount2 > 0) { |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 162 | SkASSERT(fx >= kFracMax_SkGradFixed); |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 163 | if (fCount1 > 0) { |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 164 | SkASSERT(fx - dx < kFracMax_SkGradFixed); |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 165 | } |
| 166 | } |
| 167 | #endif |
| 168 | |
| 169 | if (doSwap) { |
| 170 | SkTSwap(fCount0, fCount2); |
| 171 | SkTSwap(fV0, fV1); |
reed@google.com | 63c1ad8 | 2011-04-18 14:15:36 +0000 | [diff] [blame] | 172 | dx = -dx; |
| 173 | } |
| 174 | |
| 175 | if (fCount1 > 0) { |
reed | 438b0d7 | 2014-12-19 07:40:26 -0800 | [diff] [blame] | 176 | fFx1 = fx0 + fCount0 * dx; |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 177 | } |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 178 | } |