Fix more MSVC warnings, this time mostly about possible value truncation (fixed

base/third_party/dmg_fp/msvc_warnings.patch

-Index: dtoa.cc
---- dtoa.cc    (old copy)
-+++ dtoa.cc    (working copy)
+diff --git a/base/third_party/dmg_fp/dtoa.cc b/base/third_party/dmg_fp/dtoa.cc
+index 3312fa4..502c16c 100644
+--- a/base/third_party/dmg_fp/dtoa.cc
++++ b/base/third_party/dmg_fp/dtoa.cc
 @@ -548,8 +548,10 @@ Balloc
         ACQUIRE_DTOA_LOCK(0);
         /* The k > Kmax case does not need ACQUIRE_DTOA_LOCK(0), */
         /* but this case seems very unlikely. */
 -       if (k <= Kmax && (rv = freelist[k]))
 +       if (k <= Kmax && freelist[k]) {
 +               rv = freelist[k];
                 freelist[k] = rv->next;
 +               }
         else {
                 x = 1 << k;
  #ifdef Omit_Private_Memory
+@@ -650,7 +652,7 @@ multadd
+                        Bfree(b);
+                        b = b1;
+                        }
+-               b->x[wds++] = carry;
++               b->x[wds++] = (ULong)carry;
+                b->wds = wds;
+                }
+        return b;
 @@ -834,7 +836,8 @@ mult
         xc0 = c->x;
  #ifdef ULLong
         for(; xb < xbe; xc0++) {
 -               if ((y = *xb++)) {
 +               y = *xb++;
 +               if (y) {
                         x = xa;
                         xc = xc0;
                         carry = 0;
+@@ -844,7 +847,7 @@ mult
+                                *xc++ = z & FFFFFFFF;
+                                }
+                                while(x < xae);
+-                       *xc = carry;
++                       *xc = (ULong)carry;
+                        }
+                }
+ #else
 @@ -916,16 +919,19 @@ pow5mult
         int i;
         static int p05[3] = { 5, 25, 125 };
  
 -       if ((i = k & 3))
 +       i = k & 3;
 +       if (i)
                 b = multadd(b, p05[i-1], 0);
  
         if (!(k >>= 2))
@@ skipping 59 matching lines @@
 +               x[1] = z;
 +               b->wds = x[1] ? 2 : 1;
  #ifndef Sudden_Underflow
 -               i =
 +               i = b->wds;
  #endif
 -                   b->wds = (x[1] = z) ? 2 : 1;
                 }
         else {
                 k = lo0bits(&z);
+@@ -1498,7 +1511,7 @@ htinit(unsigned char *h, unsigned char *s, int inc)
+ {
+        int i, j;
+        for(i = 0; (j = s[i]) !=0; i++)
+-               h[j] = i + inc;
++               h[j] = (unsigned char)(i + inc);
+        }
+ 
+  static void
 @@ -1536,7 +1549,7 @@ match
         int c, d;
         CONST char *s = *sp;
  
 -       while((d = *t++)) {
 +       for(d = *t++; d; d = *t++) {
                 if ((c = *++s) >= 'A' && c <= 'Z')
                         c += 'a' - 'A';
                 if (c != d)
 @@ -1566,12 +1579,13 @@ hexnan
@@ skipping 66 matching lines @@
 @@ -2805,7 +2824,8 @@ strtod
                 }
         else if (e1 < 0) {
                 e1 = -e1;
 -               if ((i = e1 & 15))
 +               i = e1 & 15;
 +               if (i)
                         dval(&rv) /= tens[i];
                 if (e1 >>= 4) {
                         if (e1 >= 1 << n_bigtens)
-@@ -3456,7 +3476,7 @@ nrv_alloc(CONST char *s, char **rve, int
+@@ -3283,7 +3303,7 @@ strtod
+ #ifdef Avoid_Underflow
+                        if (bc.scale && y <= 2*P*Exp_msk1) {
+                                if (aadj <= 0x7fffffff) {
+-                                       if ((z = aadj) <= 0)
++                                       if ((z = (ULong)aadj) <= 0)
+                                                z = 1;
+                                        aadj = z;
+                                        aadj1 = bc.dsign ? aadj : -aadj;
+@@ -3456,7 +3476,7 @@ nrv_alloc(CONST char *s, char **rve, int n)
         char *rv, *t;
  
         t = rv = rv_alloc(n);
 -       while((*t = *s++)) t++;
 +       for(*t = *s++; *t; *t = *s++) t++;
         if (rve)
                 *rve = t;
         return rv;
 @@ -3569,7 +3589,7 @@ dtoa
         int denorm;
@@ skipping 34 matching lines @@
 +                               dval(&u) *= tens[j1 & 0xf];
 +                               for(j = j1 >> 4; j; j >>= 1, i++)
 +                                       if (j & 1) {
 +                                               ieps++;
 +                                               dval(&u) *= bigtens[i];
 +                                               }
 +                               }
                         }
                 if (k_check && dval(&u) < 1. && ilim > 0) {
                         if (ilim1 <= 0)
+@@ -3837,9 +3859,9 @@ dtoa
+                         */
+                        dval(&eps) = 0.5/tens[ilim-1] - dval(&eps);
+                        for(i = 0;;) {
+-                               L = dval(&u);
++                               L = (long)dval(&u);
+                                dval(&u) -= L;
+-                               *s++ = '0' + (int)L;
++                               *s++ = '0' + (char)L;
+                                if (dval(&u) < dval(&eps))
+                                        goto ret1;
+                                if (1. - dval(&u) < dval(&eps))
+@@ -3858,7 +3880,7 @@ dtoa
+                                L = (Long)(dval(&u));
+                                if (!(dval(&u) -= L))
+                                        ilim = i;
+-                               *s++ = '0' + (int)L;
++                               *s++ = '0' + (char)L;
+                                if (i == ilim) {
+                                        if (dval(&u) > 0.5 + dval(&eps))
+                                                goto bump_up;
+@@ -3901,7 +3923,7 @@ dtoa
+                                dval(&u) += ds;
+                                }
+ #endif
+-                       *s++ = '0' + (int)L;
++                       *s++ = '0' + (char)L;
+                        if (!dval(&u)) {
+ #ifdef SET_INEXACT
+                                inexact = 0;
 @@ -3964,7 +3986,8 @@ dtoa
                                 Bfree(b);
                                 b = b1;
                                 }
 -                       if ((j = b5 - m5))
 +                       j = b5 - m5;
 +                       if (j)
                                 b = pow5mult(b, j);
                         }
                 else
 @@ -4002,7 +4025,8 @@ dtoa
          * can do shifts and ors to compute the numerator for q.
          */
  #ifdef Pack_32
 -       if ((i = ((s5 ? 32 - hi0bits(S->x[S->wds-1]) : 1) + s2) & 0x1f))
 +       i = ((s5 ? 32 - hi0bits(S->x[S->wds-1]) : 1) + s2) & 0x1f;
 +       if (i)
                 i = 32 - i;
  #define iInc 28
  #else
-Index: g_fmt.cc
---- g_fmt.cc    (old copy)
-+++ g_fmt.cc    (working copy)
+@@ -4077,7 +4101,7 @@ dtoa
+                                else if (!b->x[0] && b->wds <= 1)
+                                        inexact = 0;
+ #endif
+-                               *s++ = dig;
++                               *s++ = (char)dig;
+                                goto ret;
+                                }
+ #endif
+@@ -4107,7 +4131,7 @@ dtoa
+                                                goto round_9_up;
+                                        }
+  accept_dig:
+-                               *s++ = dig;
++                               *s++ = (char)dig;
+                                goto ret;
+                                }
+                        if (j1 > 0) {
+@@ -4120,13 +4144,13 @@ dtoa
+                                        *s++ = '9';
+                                        goto roundoff;
+                                        }
+-                               *s++ = dig + 1;
++                               *s++ = (char)dig + 1;
+                                goto ret;
+                                }
+ #ifdef Honor_FLT_ROUNDS
+  keep_dig:
+ #endif
+-                       *s++ = dig;
++                       *s++ = (char)dig;
+                        if (i == ilim)
+                                break;
+                        b = multadd(b, 10, 0);
+@@ -4140,7 +4164,8 @@ dtoa
+                }
+        else
+                for(i = 1;; i++) {
+-                       *s++ = dig = quorem(b,S) + '0';
++                       dig = quorem(b,S) + '0';
++                       *s++ = (char)dig;
+                        if (!b->x[0] && b->wds <= 1) {
+ #ifdef SET_INEXACT
+                                inexact = 0;
+diff --git a/base/third_party/dmg_fp/g_fmt.cc b/base/third_party/dmg_fp/g_fmt.cc
+index d864eb7..bfa358d 100644
+--- a/base/third_party/dmg_fp/g_fmt.cc
++++ b/base/third_party/dmg_fp/g_fmt.cc
 @@ -46,14 +46,14 @@ g_fmt(register char *b, double x)
         if (sign)
                 *b++ = '-';
         if (decpt == 9999) /* Infinity or Nan */ {
 -               while((*b++ = *s++)) {}
 +               for(*b = *s++; *b++; *b = *s++) {}
                 goto done0;
                 }
         if (decpt <= -4 || decpt > se - s + 5) {
                 *b++ = *s++;
                 if (*s) {
                         *b++ = '.';
 -                       while((*b = *s++))
 +                       for(*b = *s++; *b; *b = *s++)
                                 b++;
                         }
                 *b++ = 'e';
+@@ -67,7 +67,7 @@ g_fmt(register char *b, double x)
+                for(j = 2, k = 10; 10*k <= decpt; j++, k *= 10) {}
+                for(;;) {
+                        i = decpt / k;
+-                       *b++ = i + '0';
++                       *b++ = (char)i + '0';
+                        if (--j <= 0)
+                                break;
+                        decpt -= i*k;
 @@ -79,10 +79,10 @@ g_fmt(register char *b, double x)
                 *b++ = '.';
                 for(; decpt < 0; decpt++)
                         *b++ = '0';
 -               while((*b++ = *s++)) {}
 +               for(*b = *s++; *b++; *b = *s++) {}
                 }
         else {
 -               while((*b = *s++)) {
 +               for(*b = *s++; *b; *b = *s++) {
                         b++;
                         if (--decpt == 0 && *s)
                                 *b++ = '.';