1 /* -*- buffer-read-only: t -*- vi: set ro: */
2 /* DO NOT EDIT! GENERATED AUTOMATICALLY! */
3 /* A more useful interface to strtol.
5 Copyright (C) 1995-1996, 1998-2001, 2003-2007, 2009-2010 Free Software
8 This program is free software: you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
21 /* Written by Jim Meyering. */
24 # define __strtol strtol
25 # define __strtol_t long int
26 # define __xstrtol xstrtol
27 # define STRTOL_T_MINIMUM LONG_MIN
28 # define STRTOL_T_MAXIMUM LONG_MAX
35 /* Some pre-ANSI implementations (e.g. SunOS 4)
36 need stderr defined if assertion checking is enabled. */
49 bkm_scale (__strtol_t *x, int scale_factor)
51 if (TYPE_SIGNED (__strtol_t) && *x < STRTOL_T_MINIMUM / scale_factor)
53 *x = STRTOL_T_MINIMUM;
54 return LONGINT_OVERFLOW;
56 if (STRTOL_T_MAXIMUM / scale_factor < *x)
58 *x = STRTOL_T_MAXIMUM;
59 return LONGINT_OVERFLOW;
66 bkm_scale_by_power (__strtol_t *x, int base, int power)
68 strtol_error err = LONGINT_OK;
70 err |= bkm_scale (x, base);
77 __xstrtol (const char *s, char **ptr, int strtol_base,
78 __strtol_t *val, const char *valid_suffixes)
83 strtol_error err = LONGINT_OK;
85 assert (0 <= strtol_base && strtol_base <= 36);
87 p = (ptr ? ptr : &t_ptr);
89 if (! TYPE_SIGNED (__strtol_t))
92 unsigned char ch = *q;
96 return LONGINT_INVALID;
100 tmp = __strtol (s, p, strtol_base);
104 /* If there is no number but there is a valid suffix, assume the
105 number is 1. The string is invalid otherwise. */
106 if (valid_suffixes && **p && strchr (valid_suffixes, **p))
109 return LONGINT_INVALID;
114 return LONGINT_INVALID;
115 err = LONGINT_OVERFLOW;
118 /* Let valid_suffixes == NULL mean `allow any suffix'. */
119 /* FIXME: update all callers except the ones that allow suffixes
120 after the number, changing last parameter NULL to `""'. */
131 strtol_error overflow;
133 if (!strchr (valid_suffixes, **p))
136 return err | LONGINT_INVALID_SUFFIX_CHAR;
139 if (strchr (valid_suffixes, '0'))
141 /* The ``valid suffix'' '0' is a special flag meaning that
142 an optional second suffix is allowed, which can change
143 the base. A suffix "B" (e.g. "100MB") stands for a power
144 of 1000, whereas a suffix "iB" (e.g. "100MiB") stands for
145 a power of 1024. If no suffix (e.g. "100M"), assume
156 case 'D': /* 'D' is obsolescent */
166 overflow = bkm_scale (&tmp, 512);
170 overflow = bkm_scale (&tmp, 1024);
177 case 'E': /* exa or exbi */
178 overflow = bkm_scale_by_power (&tmp, base, 6);
181 case 'G': /* giga or gibi */
182 case 'g': /* 'g' is undocumented; for compatibility only */
183 overflow = bkm_scale_by_power (&tmp, base, 3);
188 overflow = bkm_scale_by_power (&tmp, base, 1);
191 case 'M': /* mega or mebi */
192 case 'm': /* 'm' is undocumented; for compatibility only */
193 overflow = bkm_scale_by_power (&tmp, base, 2);
196 case 'P': /* peta or pebi */
197 overflow = bkm_scale_by_power (&tmp, base, 5);
200 case 'T': /* tera or tebi */
201 case 't': /* 't' is undocumented; for compatibility only */
202 overflow = bkm_scale_by_power (&tmp, base, 4);
206 overflow = bkm_scale (&tmp, 2);
209 case 'Y': /* yotta or 2**80 */
210 overflow = bkm_scale_by_power (&tmp, base, 8);
213 case 'Z': /* zetta or 2**70 */
214 overflow = bkm_scale_by_power (&tmp, base, 7);
219 return err | LONGINT_INVALID_SUFFIX_CHAR;
225 err |= LONGINT_INVALID_SUFFIX_CHAR;