mirror of
https://github.com/kdave/btrfs-progs
synced 2025-02-27 07:20:53 +00:00
af56460de8
There are various parsing helpers scattered everywhere, unify them to one file and start with helpers already in utils.c. Signed-off-by: David Sterba <dsterba@suse.com>
128 lines
2.9 KiB
C
128 lines
2.9 KiB
C
/*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public
|
|
* License v2 as published by the Free Software Foundation.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public
|
|
* License along with this program; if not, write to the
|
|
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
* Boston, MA 021110-1307, USA.
|
|
*/
|
|
|
|
#include "kerncompat.h"
|
|
#include <limits.h>
|
|
#include <ctype.h>
|
|
#include "common/parse-utils.h"
|
|
#include "common/messages.h"
|
|
|
|
u64 parse_size_from_string(const char *s)
|
|
{
|
|
char c;
|
|
char *endptr;
|
|
u64 mult = 1;
|
|
u64 ret;
|
|
|
|
if (!s) {
|
|
error("size value is empty");
|
|
exit(1);
|
|
}
|
|
if (s[0] == '-') {
|
|
error("size value '%s' is less equal than 0", s);
|
|
exit(1);
|
|
}
|
|
ret = strtoull(s, &endptr, 10);
|
|
if (endptr == s) {
|
|
error("size value '%s' is invalid", s);
|
|
exit(1);
|
|
}
|
|
if (endptr[0] && endptr[1]) {
|
|
error("illegal suffix contains character '%c' in wrong position",
|
|
endptr[1]);
|
|
exit(1);
|
|
}
|
|
/*
|
|
* strtoll returns LLONG_MAX when overflow, if this happens,
|
|
* need to call strtoull to get the real size
|
|
*/
|
|
if (errno == ERANGE && ret == ULLONG_MAX) {
|
|
error("size value '%s' is too large for u64", s);
|
|
exit(1);
|
|
}
|
|
if (endptr[0]) {
|
|
c = tolower(endptr[0]);
|
|
switch (c) {
|
|
case 'e':
|
|
mult *= 1024;
|
|
/* fallthrough */
|
|
case 'p':
|
|
mult *= 1024;
|
|
/* fallthrough */
|
|
case 't':
|
|
mult *= 1024;
|
|
/* fallthrough */
|
|
case 'g':
|
|
mult *= 1024;
|
|
/* fallthrough */
|
|
case 'm':
|
|
mult *= 1024;
|
|
/* fallthrough */
|
|
case 'k':
|
|
mult *= 1024;
|
|
/* fallthrough */
|
|
case 'b':
|
|
break;
|
|
default:
|
|
error("unknown size descriptor '%c'", c);
|
|
exit(1);
|
|
}
|
|
}
|
|
/* Check whether ret * mult overflow */
|
|
if (fls64(ret) + fls64(mult) - 1 > 64) {
|
|
error("size value '%s' is too large for u64", s);
|
|
exit(1);
|
|
}
|
|
ret *= mult;
|
|
return ret;
|
|
}
|
|
|
|
enum btrfs_csum_type parse_csum_type(const char *s)
|
|
{
|
|
if (strcasecmp(s, "crc32c") == 0) {
|
|
return BTRFS_CSUM_TYPE_CRC32;
|
|
} else if (strcasecmp(s, "xxhash64") == 0 ||
|
|
strcasecmp(s, "xxhash") == 0) {
|
|
return BTRFS_CSUM_TYPE_XXHASH;
|
|
} else if (strcasecmp(s, "sha256") == 0) {
|
|
return BTRFS_CSUM_TYPE_SHA256;
|
|
} else if (strcasecmp(s, "blake2b") == 0 ||
|
|
strcasecmp(s, "blake2") == 0) {
|
|
return BTRFS_CSUM_TYPE_BLAKE2;
|
|
} else {
|
|
error("unknown csum type %s", s);
|
|
exit(1);
|
|
}
|
|
/* not reached */
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Find last set bit in a 64-bit word. Returns 0 if value is 0 or the position
|
|
* of the last set bit if value is nonzero. The last (most significant) bit is
|
|
* at position 64.
|
|
*/
|
|
int fls64(u64 x)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < 64; i++)
|
|
if (x << i & (1ULL << 63))
|
|
return 64 - i;
|
|
return 64 - i;
|
|
}
|
|
|