Revert of Fix UB in SkDivBits

src/core/SkMath.cpp

Index: src/core/SkMath.cpp
diff --git a/src/core/SkMath.cpp b/src/core/SkMath.cpp
index c5d468dd83867776532b2c9e00f5d978e14518af..af93d7ecb2cf850f00745c01783ca123621606e4 100644
--- a/src/core/SkMath.cpp
+++ b/src/core/SkMath.cpp
@@ -45,32 +45,21 @@
 
 ///////////////////////////////////////////////////////////////////////////////
 
+#define DIVBITS_ITER(n)                                 \
+    case n:                                             \
+        if ((numer = (numer << 1) - denom) >= 0)        \
+            result |= 1 << (n - 1); else numer += denom
 
-#define DIVBITS_ITER(k)                    \
-    case k:                                \
-        if (numer*2 >= denom) {            \
-            numer = numer*2 - denom;       \
-            result |= 1 << (k-1);          \
-        } else {                           \
-            numer *= 2;                    \
-        }
-
-// NOTE: if you're thinking of editing this method, consider replacing it with
-// a simple shift and divide.  This legacy method predated reliable hardware division.
-int32_t SkDivBits(int32_t n, int32_t d, int shift_bias) {
-    SkASSERT(d != 0);
-    if (n == 0) {
+int32_t SkDivBits(int32_t numer, int32_t denom, int shift_bias) {
+    SkASSERT(denom != 0);
+    if (numer == 0) {
         return 0;
     }
 
-    // Make numer and denom positive, and sign hold the resulting sign
-    // We'll be left-shifting numer, so it's important it's a uint32_t.
-    // We put denom in a uint32_t just to keep things simple.
-    int32_t sign = SkExtractSign(n ^ d);
-    uint32_t numer = SkAbs32(n);
-    uint32_t denom = SkAbs32(d);
-
-    // It's probably a bug to use n or d below here.
+    // make numer and denom positive, and sign hold the resulting sign
+    int32_t sign = SkExtractSign(numer ^ denom);
+    numer = SkAbs32(numer);
+    denom = SkAbs32(denom);
 
     int nbits = SkCLZ(numer) - 1;
     int dbits = SkCLZ(denom) - 1;
@@ -89,9 +78,10 @@
     SkFixed result = 0;
 
     // do the first one
-    if (numer >= denom) {
-        numer -= denom;
+    if ((numer -= denom) >= 0) {
         result = 1;
+    } else {
+        numer += denom;
     }
 
     // Now fall into our switch statement if there are more bits to compute