static void print_type_size(Visitor *v, const char *name, uint64_t *obj,

                            Error **errp)

{

    StringOutputVisitor *sov = to_sov(v);

    static const char suffixes[] = { 'B', 'K', 'M', 'G', 'T', 'P', 'E' };

    uint64_t div, val;

    char *out;

    int i;



    if (!sov->human) {

        out = g_strdup_printf("%"PRIu64, *obj);

        string_output_set(sov, out);

        return;

    }



    val = *obj;



    /* The exponent (returned in i) minus one gives us

     * floor(log2(val * 1024 / 1000).  The correction makes us

     * switch to the higher power when the integer part is >= 1000.

     */

    frexp(val / (1000.0 / 1024.0), &i);

    i = (i - 1) / 10;

    assert(i < ARRAY_SIZE(suffixes));

    div = 1ULL << (i * 10);



    out = g_strdup_printf("%"PRIu64" (%0.3g %c%s)", val,

                          (double)val/div, suffixes[i], i ? "iB" : "");

    string_output_set(sov, out);

}

static void print_type_size(Visitor *v, const char *name, uint64_t *obj,

                            Error **errp)

{

    StringOutputVisitor *sov = to_sov(v);

    static const char suffixes[] = { 'B', 'K', 'M', 'G', 'T', 'P', 'E' };

    uint64_t div, val;

    char *out;

    int i;



    if (!sov->human) {

        out = g_strdup_printf("%"PRIu64, *obj);

        string_output_set(sov, out);

        return;

    }



    val = *obj;



    







    frexp(val / (1000.0 / 1024.0), &i);

    i = (i - 1) / 10;

    assert(i < ARRAY_SIZE(suffixes));

    div = 1ULL << (i * 10);



    out = g_strdup_printf("%"PRIu64" (%0.3g %c%s)", val,

                          (double)val/div, suffixes[i], i ? "iB" : "");

    string_output_set(sov, out);

}

    static const char suffixes[] = { 'B', 'K', 'M', 'G', 'T', 'P', 'E' };     uint64_t div, val;     char *out;     int i;     frexp(val / (1000.0 / 1024.0), &i);     i = (i - 1) / 10;     assert(i < ARRAY_SIZE(suffixes));     div = 1ULL << (i * 10);     out = g_strdup_printf("%"PRIu64" (%0.3g %c%s)", val,                           (double)val/div, suffixes[i], i ? "iB" : "");
static void FUNC_0(Visitor *VAR_0, const char *VAR_1, uint64_t *VAR_2,

                            Error **VAR_3)

{

    StringOutputVisitor *sov = to_sov(VAR_0);

    static const char VAR_4[] = { 'B', 'K', 'M', 'G', 'T', 'P', 'E' };

    uint64_t div, val;

    char *VAR_5;

    int VAR_6;



    if (!sov->human) {

        VAR_5 = g_strdup_printf("%"PRIu64, *VAR_2);

        string_output_set(sov, VAR_5);

        return;

    }



    val = *VAR_2;



    







    frexp(val / (1000.0 / 1024.0), &VAR_6);

    VAR_6 = (VAR_6 - 1) / 10;

    assert(VAR_6 < ARRAY_SIZE(VAR_4));

    div = 1ULL << (VAR_6 * 10);



    VAR_5 = g_strdup_printf("%"PRIu64" (%0.3g %c%s)", val,

                          (double)val/div, VAR_4[VAR_6], VAR_6 ? "iB" : "");

    string_output_set(sov, VAR_5);

}

static void FUNC_0(Visitor *VAR_0, const char *VAR_1, uint64_t *VAR_2,
Error **VAR_3)
{ StringOutputVisitor *sov = to_sov(VAR_0); static const char VAR_4[] = { 'B', 'K', 'M', 'G', 'T', 'P', 'E' }; uint64_t div, val; char *VAR_5; int VAR_6; if (!sov->human) { VAR_5 = g_strdup_printf("%"PRIu64, *VAR_2); string_output_set(sov, VAR_5); return; } val = *VAR_2; frexp(val / (1000.0 / 1024.0), &VAR_6); VAR_6 = (VAR_6 - 1) / 10; assert(VAR_6 < ARRAY_SIZE(VAR_4)); div = 1ULL << (VAR_6 * 10); VAR_5 = g_strdup_printf("%"PRIu64" (%0.3g %c%s)", val,
(double)val/div, VAR_4[VAR_6], VAR_6 ? "iB" : ""); string_output_set(sov, VAR_5); }