epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 1 | |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 2 | /* |
epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 3 | * Copyright 2011 Google Inc. |
| 4 | * |
| 5 | * Use of this source code is governed by a BSD-style license that can be |
| 6 | * found in the LICENSE file. |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 7 | */ |
| 8 | |
epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 9 | |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 10 | #include "SkClampRange.h" |
| 11 | |
| 12 | /* |
| 13 | * returns [0..count] for the number of steps (<= count) for which x0 <= edge |
| 14 | * given each step is followed by x0 += dx |
| 15 | */ |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 16 | 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] | 17 | SkASSERT(dx > 0); |
| 18 | SkASSERT(count >= 0); |
| 19 | |
| 20 | if (x0 >= edge) { |
| 21 | return 0; |
| 22 | } |
| 23 | if (x1 <= edge) { |
| 24 | return count; |
| 25 | } |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 26 | int64_t n = (edge - x0 + dx - 1) / dx; |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 27 | SkASSERT(n >= 0); |
| 28 | SkASSERT(n <= count); |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 29 | return (int)n; |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 30 | } |
| 31 | |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 32 | void SkClampRange::initFor1(SkGradFixed fx) { |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 33 | fCount0 = fCount1 = fCount2 = 0; |
| 34 | if (fx <= 0) { |
| 35 | fCount0 = 1; |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 36 | } else if (fx < kFracMax_SkGradFixed) { |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 37 | fCount1 = 1; |
| 38 | fFx1 = fx; |
| 39 | } else { |
| 40 | fCount2 = 1; |
| 41 | } |
| 42 | } |
| 43 | |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 44 | 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] | 45 | SkASSERT(count > 0); |
| 46 | |
| 47 | fV0 = v0; |
| 48 | fV1 = v1; |
| 49 | |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 50 | // special case 1 == count, as it is slightly common for skia |
| 51 | // and avoids us ever calling divide or 64bit multiply |
| 52 | if (1 == count) { |
| 53 | this->initFor1(fx0); |
| 54 | return; |
reed@google.com | 63c1ad8 | 2011-04-18 14:15:36 +0000 | [diff] [blame] | 55 | } |
| 56 | |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 57 | int64_t fx = fx0; |
| 58 | int64_t dx = dx0; |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 59 | |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 60 | // start with ex equal to the last computed value |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 61 | int64_t ex = fx + (count - 1) * dx; |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 62 | |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 63 | if ((uint64_t)(fx | ex) <= kFracMax_SkGradFixed) { |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 64 | fCount0 = fCount2 = 0; |
| 65 | fCount1 = count; |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 66 | fFx1 = fx0; |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 67 | return; |
| 68 | } |
| 69 | if (fx <= 0 && ex <= 0) { |
| 70 | fCount1 = fCount2 = 0; |
| 71 | fCount0 = count; |
| 72 | return; |
| 73 | } |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 74 | if (fx >= kFracMax_SkGradFixed && ex >= kFracMax_SkGradFixed) { |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 75 | fCount0 = fCount1 = 0; |
| 76 | fCount2 = count; |
| 77 | return; |
| 78 | } |
| 79 | |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 80 | int extraCount = 0; |
| 81 | |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 82 | // now make ex be 1 past the last computed value |
| 83 | ex += dx; |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 84 | |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 85 | bool doSwap = dx < 0; |
| 86 | |
| 87 | if (doSwap) { |
| 88 | ex -= dx; |
| 89 | fx -= dx; |
| 90 | SkTSwap(fx, ex); |
| 91 | dx = -dx; |
| 92 | } |
| 93 | |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 94 | |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 95 | fCount0 = chop(fx, 0, ex, dx, count); |
| 96 | count -= fCount0; |
| 97 | fx += fCount0 * dx; |
| 98 | SkASSERT(fx >= 0); |
| 99 | SkASSERT(fCount0 == 0 || (fx - dx) < 0); |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 100 | fCount1 = chop(fx, kFracMax_SkGradFixed, ex, dx, count); |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 101 | count -= fCount1; |
| 102 | fCount2 = count; |
| 103 | |
| 104 | #ifdef SK_DEBUG |
| 105 | fx += fCount1 * dx; |
| 106 | SkASSERT(fx <= ex); |
| 107 | if (fCount2 > 0) { |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 108 | SkASSERT(fx >= kFracMax_SkGradFixed); |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 109 | if (fCount1 > 0) { |
reed | caf7e93 | 2014-12-18 12:43:08 -0800 | [diff] [blame] | 110 | SkASSERT(fx - dx < kFracMax_SkGradFixed); |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 111 | } |
| 112 | } |
| 113 | #endif |
| 114 | |
| 115 | if (doSwap) { |
| 116 | SkTSwap(fCount0, fCount2); |
| 117 | SkTSwap(fV0, fV1); |
reed@google.com | 63c1ad8 | 2011-04-18 14:15:36 +0000 | [diff] [blame] | 118 | dx = -dx; |
| 119 | } |
| 120 | |
| 121 | if (fCount1 > 0) { |
reed | 438b0d7 | 2014-12-19 07:40:26 -0800 | [diff] [blame] | 122 | fFx1 = fx0 + fCount0 * dx; |
reed@google.com | 13659f1 | 2011-04-18 19:59:38 +0000 | [diff] [blame] | 123 | } |
| 124 | |
| 125 | if (dx > 0) { |
| 126 | fCount2 += extraCount; |
| 127 | } else { |
| 128 | fCount0 += extraCount; |
mike@reedtribe.org | 676d69b | 2011-04-15 03:43:23 +0000 | [diff] [blame] | 129 | } |
| 130 | } |