mirror of
https://github.com/morgan9e/systemd
synced 2026-04-15 00:47:10 +09:00
01afd0f7f5
Also, - drop unnecessary +1 from buffer size, as IF_NAMESIZE or IFNAMSIZ includes the nul at the end. - format_ifname() does not update buffer on failure, - introduces format_ifname_alloc(), FORMAT_IFNAME(), and their friends.
102 lines
3.7 KiB
C
102 lines
3.7 KiB
C
/* SPDX-License-Identifier: LGPL-2.1-or-later */
|
|
|
|
#include "format-util.h"
|
|
#include "memory-util.h"
|
|
#include "stdio-util.h"
|
|
#include "strxcpyx.h"
|
|
|
|
assert_cc(STRLEN("%") + DECIMAL_STR_MAX(int) <= IF_NAMESIZE);
|
|
int format_ifname_full(int ifindex, FormatIfnameFlag flag, char buf[static IF_NAMESIZE]) {
|
|
if (ifindex <= 0)
|
|
return -EINVAL;
|
|
|
|
if (if_indextoname(ifindex, buf))
|
|
return 0;
|
|
|
|
if (!FLAGS_SET(flag, FORMAT_IFNAME_IFINDEX))
|
|
return -errno;
|
|
|
|
if (FLAGS_SET(flag, FORMAT_IFNAME_IFINDEX_WITH_PERCENT))
|
|
assert(snprintf_ok(buf, IF_NAMESIZE, "%%%d", ifindex));
|
|
else
|
|
assert(snprintf_ok(buf, IF_NAMESIZE, "%d", ifindex));
|
|
|
|
return 0;
|
|
}
|
|
|
|
int format_ifname_full_alloc(int ifindex, FormatIfnameFlag flag, char **ret) {
|
|
char buf[IF_NAMESIZE], *copy;
|
|
int r;
|
|
|
|
assert(ret);
|
|
|
|
r = format_ifname_full(ifindex, flag, buf);
|
|
if (r < 0)
|
|
return r;
|
|
|
|
copy = strdup(buf);
|
|
if (!copy)
|
|
return -ENOMEM;
|
|
|
|
*ret = copy;
|
|
return 0;
|
|
}
|
|
|
|
char *format_bytes_full(char *buf, size_t l, uint64_t t, FormatBytesFlag flag) {
|
|
typedef struct {
|
|
const char *suffix;
|
|
uint64_t factor;
|
|
} suffix_table;
|
|
static const suffix_table table_iec[] = {
|
|
{ "E", UINT64_C(1024)*UINT64_C(1024)*UINT64_C(1024)*UINT64_C(1024)*UINT64_C(1024)*UINT64_C(1024) },
|
|
{ "P", UINT64_C(1024)*UINT64_C(1024)*UINT64_C(1024)*UINT64_C(1024)*UINT64_C(1024) },
|
|
{ "T", UINT64_C(1024)*UINT64_C(1024)*UINT64_C(1024)*UINT64_C(1024) },
|
|
{ "G", UINT64_C(1024)*UINT64_C(1024)*UINT64_C(1024) },
|
|
{ "M", UINT64_C(1024)*UINT64_C(1024) },
|
|
{ "K", UINT64_C(1024) },
|
|
}, table_si[] = {
|
|
{ "E", UINT64_C(1000)*UINT64_C(1000)*UINT64_C(1000)*UINT64_C(1000)*UINT64_C(1000)*UINT64_C(1000) },
|
|
{ "P", UINT64_C(1000)*UINT64_C(1000)*UINT64_C(1000)*UINT64_C(1000)*UINT64_C(1000) },
|
|
{ "T", UINT64_C(1000)*UINT64_C(1000)*UINT64_C(1000)*UINT64_C(1000) },
|
|
{ "G", UINT64_C(1000)*UINT64_C(1000)*UINT64_C(1000) },
|
|
{ "M", UINT64_C(1000)*UINT64_C(1000) },
|
|
{ "K", UINT64_C(1000) },
|
|
};
|
|
const suffix_table *table;
|
|
size_t n;
|
|
|
|
assert_cc(ELEMENTSOF(table_iec) == ELEMENTSOF(table_si));
|
|
|
|
if (t == UINT64_MAX)
|
|
return NULL;
|
|
|
|
table = flag & FORMAT_BYTES_USE_IEC ? table_iec : table_si;
|
|
n = ELEMENTSOF(table_iec);
|
|
|
|
for (size_t i = 0; i < n; i++)
|
|
if (t >= table[i].factor) {
|
|
if (flag & FORMAT_BYTES_BELOW_POINT) {
|
|
(void) snprintf(buf, l,
|
|
"%" PRIu64 ".%" PRIu64 "%s",
|
|
t / table[i].factor,
|
|
i != n - 1 ?
|
|
(t / table[i + 1].factor * UINT64_C(10) / table[n - 1].factor) % UINT64_C(10):
|
|
(t * UINT64_C(10) / table[i].factor) % UINT64_C(10),
|
|
table[i].suffix);
|
|
} else
|
|
(void) snprintf(buf, l,
|
|
"%" PRIu64 "%s",
|
|
t / table[i].factor,
|
|
table[i].suffix);
|
|
|
|
goto finish;
|
|
}
|
|
|
|
(void) snprintf(buf, l, "%" PRIu64 "%s", t, flag & FORMAT_BYTES_TRAILING_B ? "B" : "");
|
|
|
|
finish:
|
|
buf[l-1] = 0;
|
|
return buf;
|
|
|
|
}
|