1 /* A more useful interface to strtol.
3 Copyright (C) 1995-1996, 1998-2001, 2003-2007, 2009-2010 Free Software
6 This program is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>. */
19 /* Written by Jim Meyering. */
22 # define __strtol strtol
23 # define __strtol_t long int
24 # define __xstrtol xstrtol
25 # define STRTOL_T_MINIMUM LONG_MIN
26 # define STRTOL_T_MAXIMUM LONG_MAX
33 /* Some pre-ANSI implementations (e.g. SunOS 4)
34 need stderr defined if assertion checking is enabled. */
47 bkm_scale (__strtol_t *x, int scale_factor)
49 if (TYPE_SIGNED (__strtol_t) && *x < STRTOL_T_MINIMUM / scale_factor)
51 *x = STRTOL_T_MINIMUM;
52 return LONGINT_OVERFLOW;
54 if (STRTOL_T_MAXIMUM / scale_factor < *x)
56 *x = STRTOL_T_MAXIMUM;
57 return LONGINT_OVERFLOW;
64 bkm_scale_by_power (__strtol_t *x, int base, int power)
66 strtol_error err = LONGINT_OK;
68 err |= bkm_scale (x, base);
75 __xstrtol (const char *s, char **ptr, int strtol_base,
76 __strtol_t *val, const char *valid_suffixes)
81 strtol_error err = LONGINT_OK;
83 assert (0 <= strtol_base && strtol_base <= 36);
85 p = (ptr ? ptr : &t_ptr);
87 if (! TYPE_SIGNED (__strtol_t))
90 unsigned char ch = *q;
94 return LONGINT_INVALID;
98 tmp = __strtol (s, p, strtol_base);
102 /* If there is no number but there is a valid suffix, assume the
103 number is 1. The string is invalid otherwise. */
104 if (valid_suffixes && **p && strchr (valid_suffixes, **p))
107 return LONGINT_INVALID;
112 return LONGINT_INVALID;
113 err = LONGINT_OVERFLOW;
116 /* Let valid_suffixes == NULL mean `allow any suffix'. */
117 /* FIXME: update all callers except the ones that allow suffixes
118 after the number, changing last parameter NULL to `""'. */
129 strtol_error overflow;
131 if (!strchr (valid_suffixes, **p))
134 return err | LONGINT_INVALID_SUFFIX_CHAR;
137 if (strchr (valid_suffixes, '0'))
139 /* The ``valid suffix'' '0' is a special flag meaning that
140 an optional second suffix is allowed, which can change
141 the base. A suffix "B" (e.g. "100MB") stands for a power
142 of 1000, whereas a suffix "iB" (e.g. "100MiB") stands for
143 a power of 1024. If no suffix (e.g. "100M"), assume
154 case 'D': /* 'D' is obsolescent */
164 overflow = bkm_scale (&tmp, 512);
168 overflow = bkm_scale (&tmp, 1024);
175 case 'E': /* exa or exbi */
176 overflow = bkm_scale_by_power (&tmp, base, 6);
179 case 'G': /* giga or gibi */
180 case 'g': /* 'g' is undocumented; for compatibility only */
181 overflow = bkm_scale_by_power (&tmp, base, 3);
186 overflow = bkm_scale_by_power (&tmp, base, 1);
189 case 'M': /* mega or mebi */
190 case 'm': /* 'm' is undocumented; for compatibility only */
191 overflow = bkm_scale_by_power (&tmp, base, 2);
194 case 'P': /* peta or pebi */
195 overflow = bkm_scale_by_power (&tmp, base, 5);
198 case 'T': /* tera or tebi */
199 case 't': /* 't' is undocumented; for compatibility only */
200 overflow = bkm_scale_by_power (&tmp, base, 4);
204 overflow = bkm_scale (&tmp, 2);
207 case 'Y': /* yotta or 2**80 */
208 overflow = bkm_scale_by_power (&tmp, base, 8);
211 case 'Z': /* zetta or 2**70 */
212 overflow = bkm_scale_by_power (&tmp, base, 7);
217 return err | LONGINT_INVALID_SUFFIX_CHAR;
223 err |= LONGINT_INVALID_SUFFIX_CHAR;