1 | /*- |
---|
2 | * Copyright (c) 1991, 1993, 1994 |
---|
3 | * The Regents of the University of California. All rights reserved. |
---|
4 | * |
---|
5 | * This code is derived from software contributed to Berkeley by |
---|
6 | * Keith Muller of the University of California, San Diego and Lance |
---|
7 | * Visser of Convex Computer Corporation. |
---|
8 | * |
---|
9 | * Redistribution and use in source and binary forms, with or without |
---|
10 | * modification, are permitted provided that the following conditions |
---|
11 | * are met: |
---|
12 | * 1. Redistributions of source code must retain the above copyright |
---|
13 | * notice, this list of conditions and the following disclaimer. |
---|
14 | * 2. Redistributions in binary form must reproduce the above copyright |
---|
15 | * notice, this list of conditions and the following disclaimer in the |
---|
16 | * documentation and/or other materials provided with the distribution. |
---|
17 | * 4. Neither the name of the University nor the names of its contributors |
---|
18 | * may be used to endorse or promote products derived from this software |
---|
19 | * without specific prior written permission. |
---|
20 | * |
---|
21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
---|
22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
---|
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
---|
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
---|
25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
---|
26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
---|
27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
---|
28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
---|
29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
---|
30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
---|
31 | * SUCH DAMAGE. |
---|
32 | */ |
---|
33 | |
---|
34 | #ifndef lint |
---|
35 | #if 0 |
---|
36 | static char sccsid[] = "@(#)args.c 8.3 (Berkeley) 4/2/94"; |
---|
37 | #endif |
---|
38 | #endif /* not lint */ |
---|
39 | #include <sys/cdefs.h> |
---|
40 | __FBSDID("$FreeBSD: src/bin/dd/args.c,v 1.40 2004/08/15 19:10:05 rwatson Exp $"); |
---|
41 | |
---|
42 | #include <sys/types.h> |
---|
43 | |
---|
44 | #include <err.h> |
---|
45 | #include <errno.h> |
---|
46 | #include <inttypes.h> |
---|
47 | #include <limits.h> |
---|
48 | #include <stdlib.h> |
---|
49 | #include <string.h> |
---|
50 | |
---|
51 | #include "dd.h" |
---|
52 | #include "extern-dd.h" |
---|
53 | |
---|
54 | #define strtouq strtoul |
---|
55 | #define strtoq strtol |
---|
56 | |
---|
57 | static int c_arg(const void *, const void *); |
---|
58 | static int c_conv(const void *, const void *); |
---|
59 | static void f_bs(rtems_shell_dd_globals* globals, char *); |
---|
60 | static void f_cbs(rtems_shell_dd_globals* globals, char *); |
---|
61 | static void f_conv(rtems_shell_dd_globals* globals, char *); |
---|
62 | static void f_count(rtems_shell_dd_globals* globals, char *); |
---|
63 | static void f_files(rtems_shell_dd_globals* globals, char *); |
---|
64 | static void f_fillchar(rtems_shell_dd_globals* globals, char *); |
---|
65 | static void f_ibs(rtems_shell_dd_globals* globals, char *); |
---|
66 | static void f_if(rtems_shell_dd_globals* globals, char *); |
---|
67 | static void f_obs(rtems_shell_dd_globals* globals, char *); |
---|
68 | static void f_of(rtems_shell_dd_globals* globals, char *); |
---|
69 | static void f_seek(rtems_shell_dd_globals* globals, char *); |
---|
70 | static void f_skip(rtems_shell_dd_globals* globals, char *); |
---|
71 | static uintmax_t get_num(rtems_shell_dd_globals* globals, const char *); |
---|
72 | static off_t get_off_t(rtems_shell_dd_globals* globals, const char *); |
---|
73 | |
---|
74 | static const struct arg { |
---|
75 | const char *name; |
---|
76 | void (*f)(rtems_shell_dd_globals* globals, char *); |
---|
77 | uint_least32_t set, noset; |
---|
78 | } args[] = { |
---|
79 | { "bs", f_bs, C_BS, C_BS|C_IBS|C_OBS|C_OSYNC }, |
---|
80 | { "cbs", f_cbs, C_CBS, C_CBS }, |
---|
81 | { "conv", f_conv, 0, 0 }, |
---|
82 | { "count", f_count, C_COUNT, C_COUNT }, |
---|
83 | { "files", f_files, C_FILES, C_FILES }, |
---|
84 | { "fillchar", f_fillchar, C_FILL, C_FILL }, |
---|
85 | { "ibs", f_ibs, C_IBS, C_BS|C_IBS }, |
---|
86 | { "if", f_if, C_IF, C_IF }, |
---|
87 | { "iseek", f_skip, C_SKIP, C_SKIP }, |
---|
88 | { "obs", f_obs, C_OBS, C_BS|C_OBS }, |
---|
89 | { "of", f_of, C_OF, C_OF }, |
---|
90 | { "oseek", f_seek, C_SEEK, C_SEEK }, |
---|
91 | { "seek", f_seek, C_SEEK, C_SEEK }, |
---|
92 | { "skip", f_skip, C_SKIP, C_SKIP }, |
---|
93 | }; |
---|
94 | |
---|
95 | static char *oper; |
---|
96 | |
---|
97 | /* |
---|
98 | * args -- parse JCL syntax of dd. |
---|
99 | */ |
---|
100 | void |
---|
101 | jcl(rtems_shell_dd_globals* globals, char **argv) |
---|
102 | { |
---|
103 | struct arg *ap, tmp; |
---|
104 | char *arg; |
---|
105 | |
---|
106 | oper = NULL; |
---|
107 | |
---|
108 | in.dbsz = out.dbsz = 512; |
---|
109 | |
---|
110 | while ((oper = *++argv) != NULL) { |
---|
111 | // if ((oper = strdup(oper)) == NULL) |
---|
112 | // errx(exit_jump, 1, "unable to allocate space for the argument \"%s\"", *argv); |
---|
113 | if ((arg = strchr(oper, '=')) == NULL) |
---|
114 | errx(exit_jump, 1, "unknown operand %s", oper); |
---|
115 | *arg++ = '\0'; |
---|
116 | if (!*arg) |
---|
117 | errx(exit_jump, 1, "no value specified for %s", oper); |
---|
118 | tmp.name = oper; |
---|
119 | if (!(ap = (struct arg *)bsearch(&tmp, args, |
---|
120 | sizeof(args)/sizeof(struct arg), sizeof(struct arg), |
---|
121 | c_arg))) |
---|
122 | errx(exit_jump, 1, "unknown operand %s", tmp.name); |
---|
123 | if (ddflags & ap->noset) |
---|
124 | errx(exit_jump, 1, "%s: illegal argument combination or already set", |
---|
125 | tmp.name); |
---|
126 | ddflags |= ap->set; |
---|
127 | ap->f(globals, arg); |
---|
128 | } |
---|
129 | |
---|
130 | /* Final sanity checks. */ |
---|
131 | |
---|
132 | if (ddflags & C_BS) { |
---|
133 | /* |
---|
134 | * Bs is turned off by any conversion -- we assume the user |
---|
135 | * just wanted to set both the input and output block sizes |
---|
136 | * and didn't want the bs semantics, so we don't warn. |
---|
137 | */ |
---|
138 | if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE | |
---|
139 | C_UNBLOCK)) |
---|
140 | ddflags &= ~C_BS; |
---|
141 | |
---|
142 | /* Bs supersedes ibs and obs. */ |
---|
143 | if (ddflags & C_BS && ddflags & (C_IBS | C_OBS)) |
---|
144 | warnx("bs supersedes ibs and obs"); |
---|
145 | } |
---|
146 | |
---|
147 | /* |
---|
148 | * Ascii/ebcdic and cbs implies block/unblock. |
---|
149 | * Block/unblock requires cbs and vice-versa. |
---|
150 | */ |
---|
151 | if (ddflags & (C_BLOCK | C_UNBLOCK)) { |
---|
152 | if (!(ddflags & C_CBS)) |
---|
153 | errx(exit_jump, 1, "record operations require cbs"); |
---|
154 | if (cbsz == 0) |
---|
155 | errx(exit_jump, 1, "cbs cannot be zero"); |
---|
156 | cfunc = ddflags & C_BLOCK ? block : unblock; |
---|
157 | } else if (ddflags & C_CBS) { |
---|
158 | if (ddflags & (C_ASCII | C_EBCDIC)) { |
---|
159 | if (ddflags & C_ASCII) { |
---|
160 | ddflags |= C_UNBLOCK; |
---|
161 | cfunc = unblock; |
---|
162 | } else { |
---|
163 | ddflags |= C_BLOCK; |
---|
164 | cfunc = block; |
---|
165 | } |
---|
166 | } else |
---|
167 | errx(exit_jump, 1, "cbs meaningless if not doing record operations"); |
---|
168 | } else |
---|
169 | cfunc = def; |
---|
170 | |
---|
171 | /* |
---|
172 | * Bail out if the calculation of a file offset would overflow. |
---|
173 | */ |
---|
174 | if (in.offset > OFF_MAX / (ssize_t)in.dbsz || |
---|
175 | out.offset > OFF_MAX / (ssize_t)out.dbsz) |
---|
176 | errx(exit_jump, 1, "seek offsets cannot be larger than %jd", |
---|
177 | (intmax_t)OFF_MAX); |
---|
178 | } |
---|
179 | |
---|
180 | static int |
---|
181 | c_arg(const void *a, const void *b) |
---|
182 | { |
---|
183 | |
---|
184 | return (strcmp(((const struct arg *)a)->name, |
---|
185 | ((const struct arg *)b)->name)); |
---|
186 | } |
---|
187 | |
---|
188 | static void |
---|
189 | f_bs(rtems_shell_dd_globals* globals, char *arg) |
---|
190 | { |
---|
191 | uintmax_t res; |
---|
192 | |
---|
193 | res = get_num(globals, arg); |
---|
194 | if (res < 1 || res > SSIZE_MAX) |
---|
195 | errx(exit_jump, 1, "bs must be between 1 and %jd", (intmax_t)SSIZE_MAX); |
---|
196 | in.dbsz = out.dbsz = (size_t)res; |
---|
197 | } |
---|
198 | |
---|
199 | static void |
---|
200 | f_cbs(rtems_shell_dd_globals* globals, char *arg) |
---|
201 | { |
---|
202 | uintmax_t res; |
---|
203 | |
---|
204 | res = get_num(globals, arg); |
---|
205 | if (res < 1 || res > SSIZE_MAX) |
---|
206 | errx(exit_jump, 1, "cbs must be between 1 and %jd", (intmax_t)SSIZE_MAX); |
---|
207 | cbsz = (size_t)res; |
---|
208 | } |
---|
209 | |
---|
210 | static void |
---|
211 | f_count(rtems_shell_dd_globals* globals, char *arg) |
---|
212 | { |
---|
213 | intmax_t res; |
---|
214 | |
---|
215 | res = (intmax_t)get_num(globals, arg); |
---|
216 | if (res < 0) |
---|
217 | errx(exit_jump, 1, "count cannot be negative"); |
---|
218 | if (res == 0) |
---|
219 | cpy_cnt = (uintmax_t)-1; |
---|
220 | else |
---|
221 | cpy_cnt = (uintmax_t)res; |
---|
222 | } |
---|
223 | |
---|
224 | static void |
---|
225 | f_files(rtems_shell_dd_globals* globals, char *arg) |
---|
226 | { |
---|
227 | |
---|
228 | files_cnt = get_num(globals, arg); |
---|
229 | if (files_cnt < 1) |
---|
230 | errx(exit_jump, 1, "files must be between 1 and %jd", (uintmax_t)-1); |
---|
231 | } |
---|
232 | |
---|
233 | static void |
---|
234 | f_fillchar(rtems_shell_dd_globals* globals, char *arg) |
---|
235 | { |
---|
236 | |
---|
237 | if (strlen(arg) != 1) |
---|
238 | errx(exit_jump, 1, "need exactly one fill char"); |
---|
239 | |
---|
240 | fill_char = arg[0]; |
---|
241 | } |
---|
242 | |
---|
243 | static void |
---|
244 | f_ibs(rtems_shell_dd_globals* globals, char *arg) |
---|
245 | { |
---|
246 | uintmax_t res; |
---|
247 | |
---|
248 | if (!(ddflags & C_BS)) { |
---|
249 | res = get_num(globals, arg); |
---|
250 | if (res < 1 || res > SSIZE_MAX) |
---|
251 | errx(exit_jump, 1, "ibs must be between 1 and %jd", |
---|
252 | (intmax_t)SSIZE_MAX); |
---|
253 | in.dbsz = (size_t)res; |
---|
254 | } |
---|
255 | } |
---|
256 | |
---|
257 | static void |
---|
258 | f_if(rtems_shell_dd_globals* globals, char *arg) |
---|
259 | { |
---|
260 | |
---|
261 | in.name = strdup(arg); |
---|
262 | } |
---|
263 | |
---|
264 | static void |
---|
265 | f_obs(rtems_shell_dd_globals* globals, char *arg) |
---|
266 | { |
---|
267 | uintmax_t res; |
---|
268 | |
---|
269 | if (!(ddflags & C_BS)) { |
---|
270 | res = get_num(globals, arg); |
---|
271 | if (res < 1 || res > SSIZE_MAX) |
---|
272 | errx(exit_jump, 1, "obs must be between 1 and %jd", |
---|
273 | (intmax_t)SSIZE_MAX); |
---|
274 | out.dbsz = (size_t)res; |
---|
275 | } |
---|
276 | } |
---|
277 | |
---|
278 | static void |
---|
279 | f_of(rtems_shell_dd_globals* globals, char *arg) |
---|
280 | { |
---|
281 | |
---|
282 | out.name = strdup(arg); |
---|
283 | } |
---|
284 | |
---|
285 | static void |
---|
286 | f_seek(rtems_shell_dd_globals* globals, char *arg) |
---|
287 | { |
---|
288 | |
---|
289 | out.offset = get_off_t(globals, arg); |
---|
290 | } |
---|
291 | |
---|
292 | static void |
---|
293 | f_skip(rtems_shell_dd_globals* globals, char *arg) |
---|
294 | { |
---|
295 | |
---|
296 | in.offset = get_off_t(globals, arg); |
---|
297 | } |
---|
298 | |
---|
299 | static const struct conv { |
---|
300 | const char *name; |
---|
301 | uint_least32_t set, noset; |
---|
302 | const u_char *ctab_; |
---|
303 | } clist[] = { |
---|
304 | { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX }, |
---|
305 | { "block", C_BLOCK, C_UNBLOCK, NULL }, |
---|
306 | { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX }, |
---|
307 | { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX }, |
---|
308 | { "lcase", C_LCASE, C_UCASE, NULL }, |
---|
309 | { "noerror", C_NOERROR, 0, NULL }, |
---|
310 | { "notrunc", C_NOTRUNC, 0, NULL }, |
---|
311 | { "oldascii", C_ASCII, C_EBCDIC, e2a_32V }, |
---|
312 | { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V }, |
---|
313 | { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V }, |
---|
314 | { "osync", C_OSYNC, C_BS, NULL }, |
---|
315 | { "pareven", C_PAREVEN, C_PARODD|C_PARSET|C_PARNONE, NULL}, |
---|
316 | { "parnone", C_PARNONE, C_PARODD|C_PARSET|C_PAREVEN, NULL}, |
---|
317 | { "parodd", C_PARODD, C_PAREVEN|C_PARSET|C_PARNONE, NULL}, |
---|
318 | { "parset", C_PARSET, C_PARODD|C_PAREVEN|C_PARNONE, NULL}, |
---|
319 | { "sparse", C_SPARSE, 0, NULL }, |
---|
320 | { "swab", C_SWAB, 0, NULL }, |
---|
321 | { "sync", C_SYNC, 0, NULL }, |
---|
322 | { "ucase", C_UCASE, C_LCASE, NULL }, |
---|
323 | { "unblock", C_UNBLOCK, C_BLOCK, NULL }, |
---|
324 | }; |
---|
325 | |
---|
326 | static void |
---|
327 | f_conv(rtems_shell_dd_globals* globals, char *arg) |
---|
328 | { |
---|
329 | struct conv *cp, tmp; |
---|
330 | |
---|
331 | while (arg != NULL) { |
---|
332 | tmp.name = strsep(&arg, ","); |
---|
333 | cp = bsearch(&tmp, clist, sizeof(clist) / sizeof(struct conv), |
---|
334 | sizeof(struct conv), c_conv); |
---|
335 | if (cp == NULL) |
---|
336 | errx(exit_jump, 1, "unknown conversion %s", tmp.name); |
---|
337 | if (ddflags & cp->noset) |
---|
338 | errx(exit_jump, 1, "%s: illegal conversion combination", tmp.name); |
---|
339 | ddflags |= cp->set; |
---|
340 | if (cp->ctab_) |
---|
341 | ctab = cp->ctab_; |
---|
342 | } |
---|
343 | } |
---|
344 | |
---|
345 | static int |
---|
346 | c_conv(const void *a, const void *b) |
---|
347 | { |
---|
348 | |
---|
349 | return (strcmp(((const struct conv *)a)->name, |
---|
350 | ((const struct conv *)b)->name)); |
---|
351 | } |
---|
352 | |
---|
353 | /* |
---|
354 | * Convert an expression of the following forms to a uintmax_t. |
---|
355 | * 1) A positive decimal number. |
---|
356 | * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512). |
---|
357 | * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10). |
---|
358 | * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20). |
---|
359 | * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30). |
---|
360 | * 5) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int). |
---|
361 | * 6) Two or more positive decimal numbers (with/without [BbKkMmGgWw]) |
---|
362 | * separated by 'x' or 'X' (also '*' for backwards compatibility), |
---|
363 | * specifying the product of the indicated values. |
---|
364 | */ |
---|
365 | static uintmax_t |
---|
366 | get_num(rtems_shell_dd_globals* globals, const char *val) |
---|
367 | { |
---|
368 | uintmax_t num, mult, prevnum; |
---|
369 | char *expr; |
---|
370 | |
---|
371 | errno = 0; |
---|
372 | num = strtouq(val, &expr, 0); |
---|
373 | if (errno != 0) /* Overflow or underflow. */ |
---|
374 | err(exit_jump, 1, "%s", oper); |
---|
375 | |
---|
376 | if (expr == val) /* No valid digits. */ |
---|
377 | errx(exit_jump, 1, "%s: illegal numeric value", oper); |
---|
378 | |
---|
379 | mult = 0; |
---|
380 | switch (*expr) { |
---|
381 | case 'B': |
---|
382 | case 'b': |
---|
383 | mult = UINT32_C(512); |
---|
384 | break; |
---|
385 | case 'K': |
---|
386 | case 'k': |
---|
387 | mult = UINT32_C(1) << 10; |
---|
388 | break; |
---|
389 | case 'M': |
---|
390 | case 'm': |
---|
391 | mult = UINT32_C(1) << 20; |
---|
392 | break; |
---|
393 | case 'G': |
---|
394 | case 'g': |
---|
395 | mult = UINT32_C(1) << 30; |
---|
396 | break; |
---|
397 | case 'W': |
---|
398 | case 'w': |
---|
399 | mult = sizeof(int); |
---|
400 | break; |
---|
401 | default: |
---|
402 | ; |
---|
403 | } |
---|
404 | |
---|
405 | if (mult != 0) { |
---|
406 | prevnum = num; |
---|
407 | num *= mult; |
---|
408 | /* Check for overflow. */ |
---|
409 | if (num / mult != prevnum) |
---|
410 | goto erange; |
---|
411 | expr++; |
---|
412 | } |
---|
413 | |
---|
414 | switch (*expr) { |
---|
415 | case '\0': |
---|
416 | break; |
---|
417 | case '*': /* Backward compatible. */ |
---|
418 | case 'X': |
---|
419 | case 'x': |
---|
420 | mult = get_num(globals, expr + 1); |
---|
421 | prevnum = num; |
---|
422 | num *= mult; |
---|
423 | if (num / mult == prevnum) |
---|
424 | break; |
---|
425 | erange: |
---|
426 | errx(exit_jump, 1, "%s: %s", oper, strerror(ERANGE)); |
---|
427 | default: |
---|
428 | errx(exit_jump, 1, "%s: illegal numeric value", oper); |
---|
429 | } |
---|
430 | return (num); |
---|
431 | } |
---|
432 | |
---|
433 | /* |
---|
434 | * Convert an expression of the following forms to an off_t. This is the |
---|
435 | * same as get_num(), but it uses signed numbers. |
---|
436 | * |
---|
437 | * The major problem here is that an off_t may not necessarily be a intmax_t. |
---|
438 | */ |
---|
439 | static off_t |
---|
440 | get_off_t(rtems_shell_dd_globals* globals, const char *val) |
---|
441 | { |
---|
442 | intmax_t num, mult, prevnum; |
---|
443 | char *expr; |
---|
444 | |
---|
445 | errno = 0; |
---|
446 | num = strtoq(val, &expr, 0); |
---|
447 | if (errno != 0) /* Overflow or underflow. */ |
---|
448 | err(exit_jump, 1, "%s", oper); |
---|
449 | |
---|
450 | if (expr == val) /* No valid digits. */ |
---|
451 | errx(exit_jump, 1, "%s: illegal numeric value", oper); |
---|
452 | |
---|
453 | mult = 0; |
---|
454 | switch (*expr) { |
---|
455 | case 'B': |
---|
456 | case 'b': |
---|
457 | mult = UINT32_C(512); |
---|
458 | break; |
---|
459 | case 'K': |
---|
460 | case 'k': |
---|
461 | mult = UINT32_C(1) << 10; |
---|
462 | break; |
---|
463 | case 'M': |
---|
464 | case 'm': |
---|
465 | mult = UINT32_C(1) << 20; |
---|
466 | break; |
---|
467 | case 'G': |
---|
468 | case 'g': |
---|
469 | mult = UINT32_C(1) << 30; |
---|
470 | break; |
---|
471 | case 'W': |
---|
472 | case 'w': |
---|
473 | mult = sizeof(int); |
---|
474 | break; |
---|
475 | } |
---|
476 | |
---|
477 | if (mult != 0) { |
---|
478 | prevnum = num; |
---|
479 | num *= mult; |
---|
480 | /* Check for overflow. */ |
---|
481 | if ((prevnum > 0) != (num > 0) || num / mult != prevnum) |
---|
482 | goto erange; |
---|
483 | expr++; |
---|
484 | } |
---|
485 | |
---|
486 | switch (*expr) { |
---|
487 | case '\0': |
---|
488 | break; |
---|
489 | case '*': /* Backward compatible. */ |
---|
490 | case 'X': |
---|
491 | case 'x': |
---|
492 | mult = (intmax_t)get_off_t(globals, expr + 1); |
---|
493 | prevnum = num; |
---|
494 | num *= mult; |
---|
495 | if ((prevnum > 0) == (num > 0) && num / mult == prevnum) |
---|
496 | break; |
---|
497 | erange: |
---|
498 | errx(exit_jump, 1, "%s: %s", oper, strerror(ERANGE)); |
---|
499 | default: |
---|
500 | errx(exit_jump, 1, "%s: illegal numeric value", oper); |
---|
501 | } |
---|
502 | return (num); |
---|
503 | } |
---|