Refactor #includes and headers

[fio.git] / lib / num2str.c

diff --git a/lib/num2str.c b/lib/num2str.c
index ed3545d95634553640d3ccaf537e0e436d432ac2..387c5d7b322dc1947d095c9eeed03a8b3fae75a4 100644 (file)
--- a/lib/num2str.c
+++ b/lib/num2str.c
@@ -1,16 +1,20 @@
+#include <assert.h>
 #include <stdlib.h>
 #include <stdio.h>
 #include <string.h>
 
-#include "../fio.h"
+#include "../compiler/compiler.h"
+#include "num2str.h"
+
+#define ARRAY_SIZE(x)    (sizeof((x)) / (sizeof((x)[0])))
 
 /**
  * num2str() - Cheesy number->string conversion, complete with carry rounding error.
  * @num: quantity (e.g., number of blocks, bytes or bits)
- * @maxlen: max number of digits in the output string (not counting prefix and units)
+ * @maxlen: max number of digits in the output string (not counting prefix and units, but counting .)
  * @base: multiplier for num (e.g., if num represents Ki, use 1024)
  * @pow2: select unit prefix - 0=power-of-10 decimal SI, nonzero=power-of-2 binary IEC
- * @units: select units - N2S_* macros defined in fio.h
+ * @units: select units - N2S_* macros defined in num2str.h
  * @returns a malloc'd buffer containing "number[<unit prefix>][<units>]"
  */
 char *num2str(uint64_t num, int maxlen, int base, int pow2, int units)
@@ -20,9 +24,9 @@ char *num2str(uint64_t num, int maxlen, int base, int pow2, int units)
        const char **unitprefix;
        const char *unitstr[] = { "", "/s", "B", "bit", "B/s", "bit/s" };
        const unsigned int thousand[] = { 1000, 1024 };
-       unsigned int modulo, decimals;
+       unsigned int modulo;
        int unit_index = 0, post_index, carry = 0;
-       char tmp[32];
+       char tmp[32], fmt[32];
        char *buf;
 
        compiletime_assert(sizeof(sistr) == sizeof(iecstr), "unit prefix arrays must be identical sizes");
@@ -59,6 +63,9 @@ char *num2str(uint64_t num, int maxlen, int base, int pow2, int units)
                break;
        }
 
+       /*
+        * Divide by K/Ki until string length of num <= maxlen.
+        */
        modulo = -1U;
        while (post_index < sizeof(sistr)) {
                sprintf(tmp, "%llu", (unsigned long long) num);
@@ -71,6 +78,9 @@ char *num2str(uint64_t num, int maxlen, int base, int pow2, int units)
                post_index++;
        }
 
+       /*
+        * If no modulo, then we're done.
+        */
        if (modulo == -1U) {
 done:
                if (post_index >= ARRAY_SIZE(sistr))
@@ -81,23 +91,25 @@ done:
                return buf;
        }
 
+       /*
+        * If no room for decimals, then we're done.
+        */
        sprintf(tmp, "%llu", (unsigned long long) num);
-       decimals = maxlen - strlen(tmp);
-       if (decimals <= 1) {
+       if ((int)(maxlen - strlen(tmp)) <= 1) {
                if (carry)
                        num++;
                goto done;
        }
 
-       do {
-               sprintf(tmp, "%u", modulo);
-               if (strlen(tmp) <= decimals - 1)
-                       break;
-
-               modulo = (modulo + 9) / 10;
-       } while (1);
+       /*
+        * Fill in everything and return the result.
+        */
+       assert(maxlen - strlen(tmp) - 1 > 0);
+       assert(modulo < thousand[!!pow2]);
+       sprintf(fmt, "%%.%df", (int)(maxlen - strlen(tmp) - 1));
+       sprintf(tmp, fmt, (double)modulo / (double)thousand[!!pow2]);
 
-       sprintf(buf, "%llu.%u%s%s", (unsigned long long) num, modulo,
+       sprintf(buf, "%llu.%s%s%s", (unsigned long long) num, &tmp[2],
                        unitprefix[post_index], unitstr[unit_index]);
        return buf;
 }