Working towards -Wextra...

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 3845 matching lines @@
                         dval(&eps) *= tens[ilim-1];
                         for(i = 1;; i++, dval(&u) *= 10.) {
                                 L = (Long)(dval(&u));
                                 if (!(dval(&u) -= L))
                                         ilim = i;
                                 *s++ = '0' + (int)L;
                                 if (i == ilim) {
                                         if (dval(&u) > 0.5 + dval(&eps))
                                                 goto bump_up;
                                         else if (dval(&u) < 0.5 - dval(&eps)) {
-                                                while(*--s == '0');
+                                                while(*--s == '0') {}
                                                 s++;
                                                 goto ret1;
                                                 }
                                         break;
                                         }
                                 }
 #ifndef No_leftright
                         }
 #endif
  fast_failed:
@@ skipping 292 matching lines @@
                                 k++;
                                 *s++ = '1';
                                 goto ret;
                                 }
                 ++*s++;
                 }
         else {
 #ifdef Honor_FLT_ROUNDS
  trimzeros:
 #endif
-                while(*--s == '0');
+                while(*--s == '0') {}
                 s++;
                 }
  ret:
         Bfree(S);
         if (mhi) {
                 if (mlo && mlo != mhi)
                         Bfree(mlo);
                 Bfree(mhi);
                 }
  ret1:
@@ skipping 10 matching lines @@
 #endif
         Bfree(b);
         *s = 0;
         *decpt = k + 1;
         if (rve)
                 *rve = s;
         return s0;
         }
 
 }  // namespace dmg_fp