Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
tree: 6846f47990
Fetching contributors…

Cannot retrieve contributors at this time

file 195 lines (163 sloc) 4.069 kb
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195
/*
* Copyright (c) 2011 Alex Hornung <alex@alexhornung.com>.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/

#if defined(__linux__)
#define _GNU_SOURCE
#define __USE_GNU
#endif

#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <inttypes.h>
#include <ctype.h>
#include <errno.h>

static const char prefixes[] = " KMGTPE";
int
_humanize_number(char *buf, size_t bufsz, uint64_t num)
{
const char *prefixp;
int ret;
uint64_t i, d;

prefixp = prefixes;
i = num;
d = 0;

while ((i > 1024) && (*prefixp != '\0')) {
d = (i % 1024)/10;
i /= 1024;
++prefixp;
}

if (d > 0)
ret = snprintf(buf, bufsz, "%"PRIu64".%"PRIu64" %c",
i, d, *prefixp);
else
ret = snprintf(buf, bufsz, "%"PRIu64" %c", i, *prefixp);


if ((ret < 0) || ((size_t)ret >= bufsz)) {
errno = ENOMEM;
return -1;
} else {
return 0;
}
}

int
_dehumanize_number(const char *buf, uint64_t *dest)
{
char *endptr;
uint64_t n, n_check, d;
uint64_t multiplier;
size_t len;

if (*buf == '\0') {
errno = EINVAL;
return -1;
}

len = strlen(buf);
if (tolower(buf[len-1]) == 'b')
--len;

multiplier = 1;

switch (tolower(buf[len-1])) {
case 'y':
multiplier *= 1024;
case 'z':
multiplier *= 1024;
case 'e':
multiplier *= 1024;
case 'p':
multiplier *= 1024;
case 't':
multiplier *= 1024;
case 'g':
multiplier *= 1024;
case 'm':
multiplier *= 1024;
case 'k':
multiplier *= 1024;
break;
default:
/*
* only set error if string ends in a character that
* is not a valid unit.
*/
if (isalpha(buf[len-1])) {
errno = EINVAL;
return -1;
}
}

d = 0;
n = n_check = strtoull(buf, &endptr, 10);
if (endptr) {
if ((*endptr != '.') && (*endptr != '\0') &&
(*endptr != ' ') && (endptr != &buf[len-1])) {
errno = EINVAL;
return -1;
}

if (*endptr == '.') {
d = strtoull(endptr+1, &endptr, 10);
if (endptr && (*endptr != '\0') &&
(*endptr != ' ') &&
(endptr != &buf[len-1])) {
errno = EINVAL;
return -1;
}
}
}

if (d != 0) {
while (d < 100)
d *= 10;

while (d > 1000)
d /= 10;
}

d *= (multiplier/1024);
n *= multiplier;

if ((uint64_t)(n/multiplier) != n_check) {
errno = ERANGE;
return -1;
}

n += d;
*dest = n;

return 0;
}

#ifdef __TEST_HUMANIZE__

#include <assert.h>
int main(int argc, char *argv[])
{
char buf[1024];
uint64_t n, out;
int err;

if (argc < 3)
return -1;

n = strtoull(argv[1], NULL, 10);

err = _humanize_number(buf, 1024, n);
assert(err == 0);

err = _dehumanize_number(buf, &out);
assert(err == 0);

printf("Converting: %"PRIu64" => %s => %"PRIu64"\n", n, buf, out);

err = _dehumanize_number(argv[2], &out);
assert (err == 0);

printf("Converting: %s => %"PRIu64"\n", argv[2], out);

return 0;
}

#endif
Something went wrong with that request. Please try again.