1 /* $OpenBSD: fmt_scaled.c,v 1.25 2026/06/06 23:53:59 djm Exp $ */
2
3 /*
4 * Copyright (c) 2001, 2002, 2003 Ian F. Darwin. All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29 /* OPENBSD ORIGINAL: lib/libutil/fmt_scaled.c */
30
31 /*
32 * fmt_scaled: Format numbers scaled for human comprehension
33 * scan_scaled: Scan numbers in this format.
34 *
35 * "Human-readable" output uses 4 digits max, and puts a unit suffix at
36 * the end. Makes output compact and easy-to-read esp. on huge disks.
37 * Formatting code was originally in OpenBSD "df", converted to library routine.
38 * Scanning code written for OpenBSD libutil.
39 */
40
41 #include "includes.h"
42
43 #ifndef HAVE_FMT_SCALED
44
45 #include <stdio.h>
46 #include <stdlib.h>
47 #include <errno.h>
48 #include <string.h>
49 #include <ctype.h>
50 #include <limits.h>
51
52 typedef enum {
53 NONE = 0, KILO = 1, MEGA = 2, GIGA = 3, TERA = 4, PETA = 5, EXA = 6
54 } unit_type;
55
56 /* These three arrays MUST be in sync! XXX make a struct */
57 static const unit_type units[] = { NONE, KILO, MEGA, GIGA, TERA, PETA, EXA };
58 static const char scale_chars[] = "BKMGTPE";
59 static const long long scale_factors[] = {
60 1LL,
61 1024LL,
62 1024LL*1024,
63 1024LL*1024*1024,
64 1024LL*1024*1024*1024,
65 1024LL*1024*1024*1024*1024,
66 1024LL*1024*1024*1024*1024*1024,
67 };
68 #define SCALE_LENGTH (sizeof(units)/sizeof(units[0]))
69
70 #define MAX_DIGITS (SCALE_LENGTH * 3) /* XXX strlen(sprintf("%lld", -1)? */
71
72 /* Convert the given input string "scaled" into numeric in "result".
73 * Return 0 on success, -1 and errno set on error.
74 */
75 int
scan_scaled(char * scaled,long long * result)76 scan_scaled(char *scaled, long long *result)
77 {
78 char *p = scaled;
79 int sign = 0;
80 unsigned int i, ndigits = 0, fract_digits = 0, muls = 0, divs = 0;
81 long long scale_fact = 1, whole = 0, fpart = 0;
82
83 /* Skip leading whitespace */
84 while (isascii((unsigned char)*p) && isspace((unsigned char)*p))
85 ++p;
86
87 /* Then at most one leading + or - */
88 while (*p == '-' || *p == '+') {
89 if (*p == '-') {
90 if (sign) {
91 errno = EINVAL;
92 return -1;
93 }
94 sign = -1;
95 ++p;
96 } else if (*p == '+') {
97 if (sign) {
98 errno = EINVAL;
99 return -1;
100 }
101 sign = +1;
102 ++p;
103 }
104 }
105
106 /* Main loop: Scan digits, find decimal point, if present.
107 * We don't allow exponentials, so no scientific notation
108 * (but note that E for Exa might look like e to some!).
109 * Advance 'p' to end, to get scale factor.
110 */
111 for (; isascii((unsigned char)*p) &&
112 (isdigit((unsigned char)*p) || *p=='.'); ++p) {
113 if (*p == '.') {
114 if (fract_digits > 0) { /* oops, more than one '.' */
115 errno = EINVAL;
116 return -1;
117 }
118 fract_digits = 1;
119 continue;
120 }
121
122 i = (*p) - '0'; /* whew! finally a digit we can use */
123 if (fract_digits > 0) {
124 if (fract_digits >= MAX_DIGITS-1)
125 /* ignore extra fractional digits */
126 continue;
127 fract_digits++; /* for later scaling */
128 if (fpart > LLONG_MAX / 10) {
129 errno = ERANGE;
130 return -1;
131 }
132 fpart *= 10;
133 if (i > LLONG_MAX - fpart) {
134 errno = ERANGE;
135 return -1;
136 }
137 fpart += i;
138 } else { /* normal digit */
139 if (++ndigits >= MAX_DIGITS) {
140 errno = ERANGE;
141 return -1;
142 }
143 if (whole > LLONG_MAX / 10) {
144 errno = ERANGE;
145 return -1;
146 }
147 whole *= 10;
148 if (i > LLONG_MAX - whole) {
149 errno = ERANGE;
150 return -1;
151 }
152 whole += i;
153 }
154 }
155
156 if (sign)
157 whole *= sign;
158
159 /* If no scale factor given, we're done. fraction is discarded. */
160 if (!*p) {
161 *result = whole;
162 return 0;
163 }
164
165 /* Validate scale factor, and scale whole and fraction by it. */
166 for (i = 0; i < SCALE_LENGTH; i++) {
167
168 /* Are we there yet? */
169 if (*p == scale_chars[i] ||
170 *p == tolower((unsigned char)scale_chars[i])) {
171
172 /* If it ends with alphanumerics after the scale char, bad. */
173 if (isalnum((unsigned char)*(p+1))) {
174 errno = EINVAL;
175 return -1;
176 }
177 scale_fact = scale_factors[i];
178
179 /* check for overflow and underflow after scaling */
180 if (whole > LLONG_MAX / scale_fact ||
181 whole < LLONG_MIN / scale_fact) {
182 errno = ERANGE;
183 return -1;
184 }
185
186 /* scale whole part */
187 whole *= scale_fact;
188
189 /*
190 * Scale fractional part: compute
191 * fpart * scale_fact / 10^(fract_digits-1)
192 * without intermediate overflow. scale_fact is 1024^i,
193 * i.e. a power of 1024 = 2^10. Interleave
194 * multiply-by-1024 with divide-by-10 so the running
195 * value stays within long long range while preserving
196 * precision.
197 */
198 muls = i;
199 divs = fract_digits > 0 ? fract_digits - 1 : 0;
200 while (muls > 0 && divs > 0) {
201 if (fpart <= LLONG_MAX / 1024) {
202 fpart *= 1024;
203 muls--;
204 } else {
205 fpart /= 10;
206 divs--;
207 }
208 }
209 while (muls > 0) {
210 fpart *= 1024;
211 muls--;
212 }
213 while (divs > 0) {
214 fpart /= 10;
215 divs--;
216 }
217 if (sign == -1)
218 whole -= fpart;
219 else
220 whole += fpart;
221 *result = whole;
222 return 0;
223 }
224 }
225
226 /* Invalid unit or character */
227 errno = EINVAL;
228 return -1;
229 }
230
231 /* Format the given "number" into human-readable form in "result".
232 * Result must point to an allocated buffer of length FMT_SCALED_STRSIZE.
233 * Return 0 on success, -1 and errno set if error.
234 */
235 int
fmt_scaled(long long number,char * result)236 fmt_scaled(long long number, char *result)
237 {
238 long long abval, fract = 0;
239 unsigned int i;
240 unit_type unit = NONE;
241
242 /* Not every negative long long has a positive representation. */
243 if (number == LLONG_MIN) {
244 errno = ERANGE;
245 return -1;
246 }
247
248 abval = llabs(number);
249
250 /* Also check for numbers that are just too darned big to format. */
251 if (abval / 1024 >= scale_factors[SCALE_LENGTH-1]) {
252 errno = ERANGE;
253 return -1;
254 }
255
256 /* scale whole part; get unscaled fraction */
257 for (i = 0; i < SCALE_LENGTH; i++) {
258 if (abval/1024 < scale_factors[i]) {
259 unit = units[i];
260 fract = (i == 0) ? 0 : abval % scale_factors[i];
261 number /= scale_factors[i];
262 if (i > 0)
263 fract /= scale_factors[i - 1];
264 break;
265 }
266 }
267
268 fract = (10 * fract + 512) / 1024;
269 /* if the result would be >= 10, round main number */
270 if (fract >= 10) {
271 if (number >= 0)
272 number++;
273 else
274 number--;
275 fract = 0;
276 } else if (fract < 0) {
277 /* shouldn't happen */
278 fract = 0;
279 }
280
281 if (number == 0)
282 strlcpy(result, "0B", FMT_SCALED_STRSIZE);
283 else if (unit == NONE || number >= 100 || number <= -100) {
284 if (fract >= 5) {
285 if (number >= 0)
286 number++;
287 else
288 number--;
289 }
290 (void)snprintf(result, FMT_SCALED_STRSIZE, "%lld%c",
291 number, scale_chars[unit]);
292 } else
293 (void)snprintf(result, FMT_SCALED_STRSIZE, "%lld.%1lld%c",
294 number, fract, scale_chars[unit]);
295
296 return 0;
297 }
298
299 #ifdef MAIN
300 /*
301 * This is the original version of the program in the man page.
302 * Copy-and-paste whatever you need from it.
303 */
304 int
main(int argc,char ** argv)305 main(int argc, char **argv)
306 {
307 char *cinput = "1.5K", buf[FMT_SCALED_STRSIZE];
308 long long ninput = 10483892, result;
309
310 if (scan_scaled(cinput, &result) == 0)
311 printf("\"%s\" -> %lld\n", cinput, result);
312 else
313 perror(cinput);
314
315 if (fmt_scaled(ninput, buf) == 0)
316 printf("%lld -> \"%s\"\n", ninput, buf);
317 else
318 fprintf(stderr, "%lld invalid (%s)\n", ninput, strerror(errno));
319
320 return 0;
321 }
322 #endif
323
324 #endif /* HAVE_FMT_SCALED */
325