2007-12-08 23:42:33 +01:00
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
//
|
|
|
|
/// \file util.c
|
|
|
|
/// \brief Miscellaneous utility functions
|
|
|
|
//
|
2009-04-13 10:27:40 +02:00
|
|
|
// Author: Lasse Collin
|
2007-12-08 23:42:33 +01:00
|
|
|
//
|
2009-04-13 10:27:40 +02:00
|
|
|
// This file has been put into the public domain.
|
|
|
|
// You can do whatever you want with this file.
|
2007-12-08 23:42:33 +01:00
|
|
|
//
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
#include "private.h"
|
2010-01-24 15:57:40 +01:00
|
|
|
#include <stdarg.h>
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
extern void *
|
|
|
|
xrealloc(void *ptr, size_t size)
|
|
|
|
{
|
|
|
|
assert(size > 0);
|
|
|
|
|
|
|
|
ptr = realloc(ptr, size);
|
|
|
|
if (ptr == NULL)
|
|
|
|
message_fatal("%s", strerror(errno));
|
|
|
|
|
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
extern char *
|
|
|
|
xstrdup(const char *src)
|
|
|
|
{
|
|
|
|
assert(src != NULL);
|
|
|
|
const size_t size = strlen(src) + 1;
|
|
|
|
char *dest = xmalloc(size);
|
|
|
|
return memcpy(dest, src, size);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-12-08 23:42:33 +01:00
|
|
|
extern uint64_t
|
|
|
|
str_to_uint64(const char *name, const char *value, uint64_t min, uint64_t max)
|
|
|
|
{
|
|
|
|
uint64_t result = 0;
|
|
|
|
|
|
|
|
// Skip blanks.
|
|
|
|
while (*value == ' ' || *value == '\t')
|
|
|
|
++value;
|
|
|
|
|
2009-05-21 16:22:01 +02:00
|
|
|
// Accept special value "max". Supporting "min" doesn't seem useful.
|
|
|
|
if (strcmp(value, "max") == 0)
|
|
|
|
return max;
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
if (*value < '0' || *value > '9')
|
|
|
|
message_fatal(_("%s: Value is not a non-negative "
|
|
|
|
"decimal integer"), value);
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
do {
|
|
|
|
// Don't overflow.
|
|
|
|
if (result > (UINT64_MAX - 9) / 10)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
result *= 10;
|
|
|
|
result += *value - '0';
|
|
|
|
++value;
|
|
|
|
} while (*value >= '0' && *value <= '9');
|
|
|
|
|
|
|
|
if (*value != '\0') {
|
|
|
|
// Look for suffix.
|
|
|
|
static const struct {
|
2008-06-11 14:08:44 +02:00
|
|
|
const char name[4];
|
2007-12-08 23:42:33 +01:00
|
|
|
uint64_t multiplier;
|
|
|
|
} suffixes[] = {
|
2008-06-11 14:08:44 +02:00
|
|
|
{ "k", UINT64_C(1000) },
|
|
|
|
{ "kB", UINT64_C(1000) },
|
|
|
|
{ "M", UINT64_C(1000000) },
|
|
|
|
{ "MB", UINT64_C(1000000) },
|
|
|
|
{ "G", UINT64_C(1000000000) },
|
|
|
|
{ "GB", UINT64_C(1000000000) },
|
|
|
|
{ "Ki", UINT64_C(1024) },
|
|
|
|
{ "KiB", UINT64_C(1024) },
|
|
|
|
{ "Mi", UINT64_C(1048576) },
|
|
|
|
{ "MiB", UINT64_C(1048576) },
|
|
|
|
{ "Gi", UINT64_C(1073741824) },
|
|
|
|
{ "GiB", UINT64_C(1073741824) }
|
2007-12-08 23:42:33 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
uint64_t multiplier = 0;
|
2008-06-11 14:08:44 +02:00
|
|
|
for (size_t i = 0; i < ARRAY_SIZE(suffixes); ++i) {
|
2007-12-08 23:42:33 +01:00
|
|
|
if (strcmp(value, suffixes[i].name) == 0) {
|
|
|
|
multiplier = suffixes[i].multiplier;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (multiplier == 0) {
|
2008-11-19 19:46:52 +01:00
|
|
|
message(V_ERROR, _("%s: Invalid multiplier suffix. "
|
2007-12-08 23:42:33 +01:00
|
|
|
"Valid suffixes:"), value);
|
2008-11-19 19:46:52 +01:00
|
|
|
message_fatal("`k' (10^3), `M' (10^6), `G' (10^9) "
|
2007-12-08 23:42:33 +01:00
|
|
|
"`Ki' (2^10), `Mi' (2^20), "
|
|
|
|
"`Gi' (2^30)");
|
|
|
|
}
|
|
|
|
|
|
|
|
// Don't overflow here either.
|
|
|
|
if (result > UINT64_MAX / multiplier)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
result *= multiplier;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (result < min || result > max)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
return result;
|
|
|
|
|
|
|
|
error:
|
2008-11-19 19:46:52 +01:00
|
|
|
message_fatal(_("Value of the option `%s' must be in the range "
|
2009-02-05 08:12:57 +01:00
|
|
|
"[%" PRIu64 ", %" PRIu64 "]"),
|
|
|
|
name, min, max);
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-01-31 17:17:50 +01:00
|
|
|
extern uint64_t
|
|
|
|
round_up_to_mib(uint64_t n)
|
|
|
|
{
|
|
|
|
return (n >> 20) + ((n & ((UINT32_C(1) << 20) - 1)) != 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-06-26 19:36:45 +02:00
|
|
|
extern const char *
|
|
|
|
uint64_to_str(uint64_t value, uint32_t slot)
|
|
|
|
{
|
|
|
|
// 2^64 with thousand separators is 26 bytes plus trailing '\0'.
|
|
|
|
static char bufs[4][32];
|
|
|
|
|
|
|
|
assert(slot < ARRAY_SIZE(bufs));
|
|
|
|
|
2009-08-29 13:43:52 +02:00
|
|
|
static enum { UNKNOWN, WORKS, BROKEN } thousand = UNKNOWN;
|
|
|
|
if (thousand == UNKNOWN) {
|
|
|
|
bufs[slot][0] = '\0';
|
|
|
|
snprintf(bufs[slot], sizeof(bufs[slot]), "%'" PRIu64,
|
|
|
|
UINT64_C(1));
|
|
|
|
thousand = bufs[slot][0] == '1' ? WORKS : BROKEN;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (thousand == WORKS)
|
|
|
|
snprintf(bufs[slot], sizeof(bufs[slot]), "%'" PRIu64, value);
|
|
|
|
else
|
|
|
|
snprintf(bufs[slot], sizeof(bufs[slot]), "%" PRIu64, value);
|
|
|
|
|
2009-06-26 19:36:45 +02:00
|
|
|
return bufs[slot];
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-01-24 15:57:40 +01:00
|
|
|
extern const char *
|
|
|
|
uint64_to_nicestr(uint64_t value, enum nicestr_unit unit_min,
|
|
|
|
enum nicestr_unit unit_max, bool always_also_bytes,
|
|
|
|
uint32_t slot)
|
|
|
|
{
|
|
|
|
assert(unit_min <= unit_max);
|
|
|
|
assert(unit_max <= NICESTR_TIB);
|
|
|
|
|
|
|
|
enum nicestr_unit unit = NICESTR_B;
|
|
|
|
const char *str;
|
|
|
|
|
|
|
|
if ((unit_min == NICESTR_B && value < 10000)
|
|
|
|
|| unit_max == NICESTR_B) {
|
|
|
|
// The value is shown as bytes.
|
|
|
|
str = uint64_to_str(value, slot);
|
|
|
|
} else {
|
|
|
|
// Scale the value to a nicer unit. Unless unit_min and
|
|
|
|
// unit_max limit us, we will show at most five significant
|
|
|
|
// digits with one decimal place.
|
|
|
|
double d = (double)(value);
|
|
|
|
do {
|
|
|
|
d /= 1024.0;
|
|
|
|
++unit;
|
|
|
|
} while (unit < unit_min || (d > 9999.9 && unit < unit_max));
|
|
|
|
|
|
|
|
str = double_to_str(d);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const char suffix[5][4] = { "B", "KiB", "MiB", "GiB", "TiB" };
|
|
|
|
|
|
|
|
// Minimum buffer size:
|
2010-01-26 14:42:24 +01:00
|
|
|
// 26 2^64 with thousand separators
|
|
|
|
// 4 " KiB"
|
2010-01-24 15:57:40 +01:00
|
|
|
// 2 " ("
|
|
|
|
// 26 2^64 with thousand separators
|
|
|
|
// 3 " B)"
|
|
|
|
// 1 '\0'
|
2010-01-26 14:42:24 +01:00
|
|
|
// 62 Total
|
|
|
|
static char buf[4][64];
|
2010-01-24 15:57:40 +01:00
|
|
|
char *pos = buf[slot];
|
|
|
|
size_t left = sizeof(buf[slot]);
|
|
|
|
my_snprintf(&pos, &left, "%s %s", str, suffix[unit]);
|
|
|
|
|
|
|
|
if (always_also_bytes && value >= 10000)
|
|
|
|
snprintf(pos, left, " (%s B)", uint64_to_str(value, slot));
|
|
|
|
|
|
|
|
return buf[slot];
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-06-26 19:36:45 +02:00
|
|
|
extern const char *
|
|
|
|
double_to_str(double value)
|
|
|
|
{
|
|
|
|
static char buf[64];
|
|
|
|
|
2009-08-29 13:43:52 +02:00
|
|
|
static enum { UNKNOWN, WORKS, BROKEN } thousand = UNKNOWN;
|
|
|
|
if (thousand == UNKNOWN) {
|
|
|
|
buf[0] = '\0';
|
|
|
|
snprintf(buf, sizeof(buf), "%'.1f", 2.0);
|
|
|
|
thousand = buf[0] == '2' ? WORKS : BROKEN;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (thousand == WORKS)
|
|
|
|
snprintf(buf, sizeof(buf), "%'.1f", value);
|
|
|
|
else
|
|
|
|
snprintf(buf, sizeof(buf), "%.1f", value);
|
|
|
|
|
2009-06-26 19:36:45 +02:00
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-01-24 15:57:40 +01:00
|
|
|
extern void
|
|
|
|
my_snprintf(char **pos, size_t *left, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
const int len = vsnprintf(*pos, *left, fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
|
|
|
|
// If an error occurred, we want the caller to think that the whole
|
|
|
|
// buffer was used. This way no more data will be written to the
|
|
|
|
// buffer. We don't need better error handling here.
|
|
|
|
if (len < 0 || (size_t)(len) >= *left) {
|
|
|
|
*left = 0;
|
|
|
|
} else {
|
|
|
|
*pos += len;
|
|
|
|
*left -= len;
|
|
|
|
}
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-12-08 23:42:33 +01:00
|
|
|
/*
|
|
|
|
/// \brief Simple quoting to get rid of ASCII control characters
|
|
|
|
///
|
|
|
|
/// This is not so cool and locale-dependent, but should be good enough
|
|
|
|
/// At least we don't print any control characters on the terminal.
|
|
|
|
///
|
|
|
|
extern char *
|
|
|
|
str_quote(const char *str)
|
|
|
|
{
|
|
|
|
size_t dest_len = 0;
|
|
|
|
bool has_ctrl = false;
|
|
|
|
|
|
|
|
while (str[dest_len] != '\0')
|
|
|
|
if (*(unsigned char *)(str + dest_len++) < 0x20)
|
|
|
|
has_ctrl = true;
|
|
|
|
|
|
|
|
char *dest = malloc(dest_len + 1);
|
|
|
|
if (dest != NULL) {
|
|
|
|
if (has_ctrl) {
|
|
|
|
for (size_t i = 0; i < dest_len; ++i)
|
|
|
|
if (*(unsigned char *)(str + i) < 0x20)
|
|
|
|
dest[i] = '?';
|
|
|
|
else
|
|
|
|
dest[i] = str[i];
|
|
|
|
|
|
|
|
dest[dest_len] = '\0';
|
|
|
|
|
|
|
|
} else {
|
|
|
|
// Usually there are no control characters,
|
|
|
|
// so we can optimize.
|
|
|
|
memcpy(dest, str, dest_len + 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
extern bool
|
|
|
|
is_empty_filename(const char *filename)
|
|
|
|
{
|
|
|
|
if (filename[0] == '\0') {
|
2008-11-19 19:46:52 +01:00
|
|
|
message_error(_("Empty filename, skipping"));
|
2007-12-08 23:42:33 +01:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
2008-11-19 19:46:52 +01:00
|
|
|
|
|
|
|
|
|
|
|
extern bool
|
|
|
|
is_tty_stdin(void)
|
|
|
|
{
|
|
|
|
const bool ret = isatty(STDIN_FILENO);
|
|
|
|
|
|
|
|
if (ret)
|
2010-01-13 18:10:25 +01:00
|
|
|
message_error(_("Compressed data cannot be read from "
|
|
|
|
"a terminal"));
|
2008-11-19 19:46:52 +01:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
extern bool
|
|
|
|
is_tty_stdout(void)
|
|
|
|
{
|
|
|
|
const bool ret = isatty(STDOUT_FILENO);
|
|
|
|
|
|
|
|
if (ret)
|
2010-01-13 18:10:25 +01:00
|
|
|
message_error(_("Compressed data cannot be written to "
|
|
|
|
"a terminal"));
|
2008-11-19 19:46:52 +01:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|