mirror of
https://github.com/sheumann/hush.git
synced 2024-08-26 12:29:04 +00:00
This change retains "or later" state! No licensing _changes_ here, only form is adjusted (article, space between "GPL" and "v2" and so on). Signed-off-by: Denys Vlasenko <vda.linux@googlemail.com>
196 lines
4.9 KiB
C
196 lines
4.9 KiB
C
/*
|
|
*
|
|
* Licensed under GPLv2, see file LICENSE in this source tree.
|
|
*/
|
|
/*
|
|
You need to define the following (example):
|
|
|
|
#define type long
|
|
#define xstrtou(rest) xstrtoul##rest
|
|
#define xstrto(rest) xstrtol##rest
|
|
#define xatou(rest) xatoul##rest
|
|
#define xato(rest) xatol##rest
|
|
#define XSTR_UTYPE_MAX ULONG_MAX
|
|
#define XSTR_TYPE_MAX LONG_MAX
|
|
#define XSTR_TYPE_MIN LONG_MIN
|
|
#define XSTR_STRTOU strtoul
|
|
*/
|
|
|
|
unsigned type FAST_FUNC xstrtou(_range_sfx)(const char *numstr, int base,
|
|
unsigned type lower,
|
|
unsigned type upper,
|
|
const struct suffix_mult *suffixes)
|
|
{
|
|
unsigned type r;
|
|
int old_errno;
|
|
char *e;
|
|
|
|
/* Disallow '-' and any leading whitespace. */
|
|
if (*numstr == '-' || *numstr == '+' || isspace(*numstr))
|
|
goto inval;
|
|
|
|
/* Since this is a lib function, we're not allowed to reset errno to 0.
|
|
* Doing so could break an app that is deferring checking of errno.
|
|
* So, save the old value so that we can restore it if successful. */
|
|
old_errno = errno;
|
|
errno = 0;
|
|
r = XSTR_STRTOU(numstr, &e, base);
|
|
/* Do the initial validity check. Note: The standards do not
|
|
* guarantee that errno is set if no digits were found. So we
|
|
* must test for this explicitly. */
|
|
if (errno || numstr == e)
|
|
goto inval; /* error / no digits / illegal trailing chars */
|
|
|
|
errno = old_errno; /* Ok. So restore errno. */
|
|
|
|
/* Do optional suffix parsing. Allow 'empty' suffix tables.
|
|
* Note that we also allow nul suffixes with associated multipliers,
|
|
* to allow for scaling of the numstr by some default multiplier. */
|
|
if (suffixes) {
|
|
while (suffixes->mult) {
|
|
if (strcmp(suffixes->suffix, e) == 0) {
|
|
if (XSTR_UTYPE_MAX / suffixes->mult < r)
|
|
goto range; /* overflow! */
|
|
r *= suffixes->mult;
|
|
goto chk_range;
|
|
}
|
|
++suffixes;
|
|
}
|
|
}
|
|
|
|
/* Note: trailing space is an error.
|
|
It would be easy enough to allow though if desired. */
|
|
if (*e)
|
|
goto inval;
|
|
chk_range:
|
|
/* Finally, check for range limits. */
|
|
if (r >= lower && r <= upper)
|
|
return r;
|
|
range:
|
|
bb_error_msg_and_die("number %s is not in %llu..%llu range",
|
|
numstr, (unsigned long long)lower,
|
|
(unsigned long long)upper);
|
|
inval:
|
|
bb_error_msg_and_die("invalid number '%s'", numstr);
|
|
}
|
|
|
|
unsigned type FAST_FUNC xstrtou(_range)(const char *numstr, int base,
|
|
unsigned type lower,
|
|
unsigned type upper)
|
|
{
|
|
return xstrtou(_range_sfx)(numstr, base, lower, upper, NULL);
|
|
}
|
|
|
|
unsigned type FAST_FUNC xstrtou(_sfx)(const char *numstr, int base,
|
|
const struct suffix_mult *suffixes)
|
|
{
|
|
return xstrtou(_range_sfx)(numstr, base, 0, XSTR_UTYPE_MAX, suffixes);
|
|
}
|
|
|
|
unsigned type FAST_FUNC xstrtou()(const char *numstr, int base)
|
|
{
|
|
return xstrtou(_range_sfx)(numstr, base, 0, XSTR_UTYPE_MAX, NULL);
|
|
}
|
|
|
|
unsigned type FAST_FUNC xatou(_range_sfx)(const char *numstr,
|
|
unsigned type lower,
|
|
unsigned type upper,
|
|
const struct suffix_mult *suffixes)
|
|
{
|
|
return xstrtou(_range_sfx)(numstr, 10, lower, upper, suffixes);
|
|
}
|
|
|
|
unsigned type FAST_FUNC xatou(_range)(const char *numstr,
|
|
unsigned type lower,
|
|
unsigned type upper)
|
|
{
|
|
return xstrtou(_range_sfx)(numstr, 10, lower, upper, NULL);
|
|
}
|
|
|
|
unsigned type FAST_FUNC xatou(_sfx)(const char *numstr,
|
|
const struct suffix_mult *suffixes)
|
|
{
|
|
return xstrtou(_range_sfx)(numstr, 10, 0, XSTR_UTYPE_MAX, suffixes);
|
|
}
|
|
|
|
unsigned type FAST_FUNC xatou()(const char *numstr)
|
|
{
|
|
return xatou(_sfx)(numstr, NULL);
|
|
}
|
|
|
|
/* Signed ones */
|
|
|
|
type FAST_FUNC xstrto(_range_sfx)(const char *numstr, int base,
|
|
type lower,
|
|
type upper,
|
|
const struct suffix_mult *suffixes)
|
|
{
|
|
unsigned type u = XSTR_TYPE_MAX;
|
|
type r;
|
|
const char *p = numstr;
|
|
|
|
/* NB: if you'll decide to disallow '+':
|
|
* at least renice applet needs to allow it */
|
|
if (p[0] == '+' || p[0] == '-') {
|
|
++p;
|
|
if (p[0] == '-')
|
|
++u; /* = <type>_MIN (01111... + 1 == 10000...) */
|
|
}
|
|
|
|
r = xstrtou(_range_sfx)(p, base, 0, u, suffixes);
|
|
|
|
if (*numstr == '-') {
|
|
r = -r;
|
|
}
|
|
|
|
if (r < lower || r > upper) {
|
|
bb_error_msg_and_die("number %s is not in %lld..%lld range",
|
|
numstr, (long long)lower, (long long)upper);
|
|
}
|
|
|
|
return r;
|
|
}
|
|
|
|
type FAST_FUNC xstrto(_range)(const char *numstr, int base, type lower, type upper)
|
|
{
|
|
return xstrto(_range_sfx)(numstr, base, lower, upper, NULL);
|
|
}
|
|
|
|
type FAST_FUNC xstrto()(const char *numstr, int base)
|
|
{
|
|
return xstrto(_range_sfx)(numstr, base, XSTR_TYPE_MIN, XSTR_TYPE_MAX, NULL);
|
|
}
|
|
|
|
type FAST_FUNC xato(_range_sfx)(const char *numstr,
|
|
type lower,
|
|
type upper,
|
|
const struct suffix_mult *suffixes)
|
|
{
|
|
return xstrto(_range_sfx)(numstr, 10, lower, upper, suffixes);
|
|
}
|
|
|
|
type FAST_FUNC xato(_range)(const char *numstr, type lower, type upper)
|
|
{
|
|
return xstrto(_range_sfx)(numstr, 10, lower, upper, NULL);
|
|
}
|
|
|
|
type FAST_FUNC xato(_sfx)(const char *numstr, const struct suffix_mult *suffixes)
|
|
{
|
|
return xstrto(_range_sfx)(numstr, 10, XSTR_TYPE_MIN, XSTR_TYPE_MAX, suffixes);
|
|
}
|
|
|
|
type FAST_FUNC xato()(const char *numstr)
|
|
{
|
|
return xstrto(_range_sfx)(numstr, 10, XSTR_TYPE_MIN, XSTR_TYPE_MAX, NULL);
|
|
}
|
|
|
|
#undef type
|
|
#undef xstrtou
|
|
#undef xstrto
|
|
#undef xatou
|
|
#undef xato
|
|
#undef XSTR_UTYPE_MAX
|
|
#undef XSTR_TYPE_MAX
|
|
#undef XSTR_TYPE_MIN
|
|
#undef XSTR_STRTOU
|