Revert "Fix a ton of compiler warnings."

base/third_party/dmg_fp/dtoa.cc

 /****************************************************************
  *
  * The author of this software is David M. Gay.
  *
  * Copyright (c) 1991, 2000, 2001 by Lucent Technologies.
  *
  * Permission to use, copy, modify, and distribute this software for any
  * purpose without fee is hereby granted, provided that this entire notice
  * is included in all copies of any software which is or includes a copy
  * or modification of this software and in all copies of the supporting
@@ skipping 1541 matching lines @@
 #ifdef KR_headers
         (rvp, sp) U *rvp; CONST char **sp;
 #else
         (U *rvp, CONST char **sp)
 #endif
 {
         ULong c, x[2];
         CONST char *s;
         int c1, havedig, udx0, xshift;
 
-        if (!hexdig[static_cast<int>('0')])
+        if (!hexdig['0'])
                 hexdig_init();
         x[0] = x[1] = 0;
         havedig = xshift = 0;
         udx0 = 1;
         s = *sp;
         /* allow optional initial 0x or 0X */
         while((c = *(CONST unsigned char*)(s+1)) && c <= ' ')
                 ++s;
         if (s[1] == '0' && (s[2] == 'x' || s[2] == 'X'))
                 s += 2;
@@ skipping 1703 matching lines @@
                                 word1(&rv) = Big1;
                                 goto cont;
                                 }
                         else
                                 word0(&rv) += P*Exp_msk1;
                         }
                 else {
 #ifdef Avoid_Underflow
                         if (bc.scale && y <= 2*P*Exp_msk1) {
                                 if (aadj <= 0x7fffffff) {
-                                        if ((z = static_cast<ULong>(aadj)) <= 0)
+                                        if ((z = aadj) <= 0)
                                                 z = 1;
                                         aadj = z;
                                         aadj1 = bc.dsign ? aadj : -aadj;
                                         }
                                 dval(&aadj2) = aadj1;
                                 word0(&aadj2) += (2*P+1)*Exp_msk1 - y;
                                 aadj1 = dval(&aadj2);
                                 }
                         adj.d = aadj1 * ulp(&rv);
                         dval(&rv) += adj.d;
@@ skipping 533 matching lines @@
                                 goto no_digits;
                         goto fast_failed;
                         }
 #ifndef No_leftright
                 if (leftright) {
                         /* Use Steele & White method of only
                          * generating digits needed.
                          */
                         dval(&eps) = 0.5/tens[ilim-1] - dval(&eps);
                         for(i = 0;;) {
-                                L = static_cast<long>(dval(&u));
+                                L = dval(&u);
                                 dval(&u) -= L;
                                 *s++ = '0' + (int)L;
                                 if (dval(&u) < dval(&eps))
                                         goto ret1;
                                 if (1. - dval(&u) < dval(&eps))
                                         goto bump_up;
                                 if (++i >= ilim)
                                         break;
                                 dval(&eps) *= 10.;
                                 dval(&u) *= 10.;
@@ skipping 349 matching lines @@
 #endif
         Bfree(b);
         *s = 0;
         *decpt = k + 1;
         if (rve)
                 *rve = s;
         return s0;
         }
 
 }  // namespace dmg_fp