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
|
/**
* slibc — Yet another C library
* Copyright © 2015, 2016 Mattias Andrée (maandree@member.fsf.org)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* 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, see <http://www.gnu.org/licenses/>.
*/
#include <slibc-human.h>
#include <slibc/internals.h>
#include <errno.h>
#include <stddef.h>
#include <stdint.h>
#include <ctype.h>
#include <string.h>
/**
* Get prefix-value.
*
* @param str Pointer to the string, will be updated to point to the end of the unit.
* @param mode How to parse ambiguous units.
* @return The multiple for the value, 0 on error.
*
* @throws EINVAL The prefix is unrecognised.
* @throws ERANGE The prefix is too large.
*/
__attribute__((nonnull))
static size_t prefix(char** restrict str, enum machinesize_mode mode)
{
#define P(A, B) case A: case B: power++
char* p = *str;
size_t power = 0;
size_t base = 0;
size_t rc = 1;
switch (*p++)
{
P('Y', 'y');
P('Z', 'z');
P('E', 'e');
P('P', 'p');
P('T', 't');
P('G', 'g');
P('M', 'm');
P('k', 'K');
case 'B': case 'b':
break;
default:
return errno = EINVAL, (size_t)0;
}
if (power == 0)
goto done;
if ((*p == 'i') || (*p == 'I'))
base = 1024, p++;
if ((*p == 'B') || (*p == 'b'))
{
p++;
if ((!base) && (mode == (MACHINESIZE_SI | MACHINESIZE_IEC)))
base = 1000;
}
if (!base)
base = (mode == MACHINESIZE_SI) ? 1000 : 1024;
while (power--)
OVERFLOW(umull, rc, base, &rc, ERANGE, (size_t)0);
done:
return *str = p, rc;
#undef P
}
/**
* Parses a human representation of storage size or file offset.
*
* If no unit is used, bytes are assumed. If you rather it be
* (for example) kilobytes, you can multiply it if
* `strpbrk(str, "qwertyuiopasdfghjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM") == NULL`.
*
* @etymology Convert to (machine)-representation: `(size)_t`.
*
* @param size Output parameter for the value, must not be `NULL`.
* @param str The value to parse, must not `NULL`.
* @param mode How to parse ambiguous strings, 0 for default.
* @param space Characters to ignore (thousand-group delimiters).
* Supports UTF-8. `NULL` for default. Default value
* is " '".
* @param point Decimal pointer chracters. Supports UTF-8. `NULL`
* for default. Default value is ",.".
* @return Zero on success, -1 on error.
*
* @throws EINVAL If `mode` is invalid.
* @throws EINVAL If `str` is not parseable.
* @throws ERANGE If the value is too range to fit in a `size_t`.
*
* @since Always.
*/
int machinesize(size_t* restrict size, const char* restrict str, enum machinesize_mode mode,
const char* restrict space, const char* restrict point)
{
size_t r = 0;
size_t word;
long double dword;
size_t u;
const char* p;
const char* q;
int started = 0;
int pluses = 0;
int have_unitless = 0;
size_t words = 0;
if (space == NULL) space = " '";
if (point == NULL) point = ".,";
if (mode == 0) mode = MACHINESIZE_SI | MACHINESIZE_IEC;
if (mode > 3) goto invalid;
for (p = str; *p;)
if (strchr(" \t+", *p))
{
if ((pluses += (*p++ == '+')) > 1)
goto invalid;
}
else if ((q = machinefloat(&dword, p, space, point)))
{
p = q, words++, pluses = 0, started = 1;
while (strchr(" \t-", *p))
p++;
if (isalpha(*p) == 0) u = 1, have_unitless = 1;
else u = prefix(&p, mode);
if (u == 0) return -1;
dword *= (long double)u;
if (dword > (long double)SIZE_MAX)
return errno = ERANGE, -1;
word = (size_t)dword;
OVERFLOW(uaddl, word, r, &r, ERANGE, -1);
}
else
return -1;
if ((!started) || (have_unitless && (words > 1)))
goto invalid;
return *size = r, 0;
invalid:
return errno = EINVAL, -1;
}
|
