2 * Copyright (c) 1991, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
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.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
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.
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
36 static char sccsid[] = "@(#)args.c 8.3 (Berkeley) 4/2/94";
39 #include <sys/cdefs.h>
40 __FBSDID("$FreeBSD$");
42 #include <sys/types.h>
55 static int c_arg(const void *, const void *);
56 static int c_conv(const void *, const void *);
57 static void f_bs(char *);
58 static void f_cbs(char *);
59 static void f_conv(char *);
60 static void f_count(char *);
61 static void f_files(char *);
62 static void f_fillchar(char *);
63 static void f_ibs(char *);
64 static void f_if(char *);
65 static void f_obs(char *);
66 static void f_of(char *);
67 static void f_seek(char *);
68 static void f_skip(char *);
69 static uintmax_t get_num(const char *);
70 static off_t get_off_t(const char *);
72 static const struct arg {
77 { "bs", f_bs, C_BS, C_BS|C_IBS|C_OBS|C_OSYNC },
78 { "cbs", f_cbs, C_CBS, C_CBS },
79 { "conv", f_conv, 0, 0 },
80 { "count", f_count, C_COUNT, C_COUNT },
81 { "files", f_files, C_FILES, C_FILES },
82 { "fillchar", f_fillchar, C_FILL, C_FILL },
83 { "ibs", f_ibs, C_IBS, C_BS|C_IBS },
84 { "if", f_if, C_IF, C_IF },
85 { "iseek", f_skip, C_SKIP, C_SKIP },
86 { "obs", f_obs, C_OBS, C_BS|C_OBS },
87 { "of", f_of, C_OF, C_OF },
88 { "oseek", f_seek, C_SEEK, C_SEEK },
89 { "seek", f_seek, C_SEEK, C_SEEK },
90 { "skip", f_skip, C_SKIP, C_SKIP },
96 * args -- parse JCL syntax of dd.
104 in.dbsz = out.dbsz = 512;
106 while ((oper = *++argv) != NULL) {
107 if ((oper = strdup(oper)) == NULL)
108 errx(1, "unable to allocate space for the argument \"%s\"", *argv);
109 if ((arg = strchr(oper, '=')) == NULL)
110 errx(1, "unknown operand %s", oper);
113 errx(1, "no value specified for %s", oper);
115 if (!(ap = (struct arg *)bsearch(&tmp, args,
116 sizeof(args)/sizeof(struct arg), sizeof(struct arg),
118 errx(1, "unknown operand %s", tmp.name);
119 if (ddflags & ap->noset)
120 errx(1, "%s: illegal argument combination or already set",
126 /* Final sanity checks. */
128 if (ddflags & C_BS) {
130 * Bs is turned off by any conversion -- we assume the user
131 * just wanted to set both the input and output block sizes
132 * and didn't want the bs semantics, so we don't warn.
134 if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE |
138 /* Bs supersedes ibs and obs. */
139 if (ddflags & C_BS && ddflags & (C_IBS | C_OBS))
140 warnx("bs supersedes ibs and obs");
144 * Ascii/ebcdic and cbs implies block/unblock.
145 * Block/unblock requires cbs and vice-versa.
147 if (ddflags & (C_BLOCK | C_UNBLOCK)) {
148 if (!(ddflags & C_CBS))
149 errx(1, "record operations require cbs");
151 errx(1, "cbs cannot be zero");
152 cfunc = ddflags & C_BLOCK ? block : unblock;
153 } else if (ddflags & C_CBS) {
154 if (ddflags & (C_ASCII | C_EBCDIC)) {
155 if (ddflags & C_ASCII) {
156 ddflags |= C_UNBLOCK;
163 errx(1, "cbs meaningless if not doing record operations");
168 * Bail out if the calculation of a file offset would overflow.
170 if (in.offset > OFF_MAX / (ssize_t)in.dbsz ||
171 out.offset > OFF_MAX / (ssize_t)out.dbsz)
172 errx(1, "seek offsets cannot be larger than %jd",
177 c_arg(const void *a, const void *b)
180 return (strcmp(((const struct arg *)a)->name,
181 ((const struct arg *)b)->name));
190 if (res < 1 || res > SSIZE_MAX)
191 errx(1, "bs must be between 1 and %jd", (intmax_t)SSIZE_MAX);
192 in.dbsz = out.dbsz = (size_t)res;
201 if (res < 1 || res > SSIZE_MAX)
202 errx(1, "cbs must be between 1 and %jd", (intmax_t)SSIZE_MAX);
211 res = (intmax_t)get_num(arg);
213 errx(1, "count cannot be negative");
215 cpy_cnt = (uintmax_t)-1;
217 cpy_cnt = (uintmax_t)res;
224 files_cnt = get_num(arg);
226 errx(1, "files must be between 1 and %jd", (uintmax_t)-1);
230 f_fillchar(char *arg)
233 if (strlen(arg) != 1)
234 errx(1, "need exactly one fill char");
244 if (!(ddflags & C_BS)) {
246 if (res < 1 || res > SSIZE_MAX)
247 errx(1, "ibs must be between 1 and %jd",
248 (intmax_t)SSIZE_MAX);
249 in.dbsz = (size_t)res;
265 if (!(ddflags & C_BS)) {
267 if (res < 1 || res > SSIZE_MAX)
268 errx(1, "obs must be between 1 and %jd",
269 (intmax_t)SSIZE_MAX);
270 out.dbsz = (size_t)res;
285 out.offset = get_off_t(arg);
292 in.offset = get_off_t(arg);
295 static const struct conv {
300 { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX },
301 { "block", C_BLOCK, C_UNBLOCK, NULL },
302 { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX },
303 { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX },
304 { "lcase", C_LCASE, C_UCASE, NULL },
305 { "noerror", C_NOERROR, 0, NULL },
306 { "notrunc", C_NOTRUNC, 0, NULL },
307 { "oldascii", C_ASCII, C_EBCDIC, e2a_32V },
308 { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V },
309 { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V },
310 { "osync", C_OSYNC, C_BS, NULL },
311 { "pareven", C_PAREVEN, C_PARODD|C_PARSET|C_PARNONE, NULL},
312 { "parnone", C_PARNONE, C_PARODD|C_PARSET|C_PAREVEN, NULL},
313 { "parodd", C_PARODD, C_PAREVEN|C_PARSET|C_PARNONE, NULL},
314 { "parset", C_PARSET, C_PARODD|C_PAREVEN|C_PARNONE, NULL},
315 { "sparse", C_SPARSE, 0, NULL },
316 { "swab", C_SWAB, 0, NULL },
317 { "sync", C_SYNC, 0, NULL },
318 { "ucase", C_UCASE, C_LCASE, NULL },
319 { "unblock", C_UNBLOCK, C_BLOCK, NULL },
325 struct conv *cp, tmp;
327 while (arg != NULL) {
328 tmp.name = strsep(&arg, ",");
329 cp = bsearch(&tmp, clist, sizeof(clist) / sizeof(struct conv),
330 sizeof(struct conv), c_conv);
332 errx(1, "unknown conversion %s", tmp.name);
333 if (ddflags & cp->noset)
334 errx(1, "%s: illegal conversion combination", tmp.name);
342 c_conv(const void *a, const void *b)
345 return (strcmp(((const struct conv *)a)->name,
346 ((const struct conv *)b)->name));
350 * Convert an expression of the following forms to a uintmax_t.
351 * 1) A positive decimal number.
352 * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512).
353 * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10).
354 * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20).
355 * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30).
356 * 5) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int).
357 * 6) Two or more positive decimal numbers (with/without [BbKkMmGgWw])
358 * separated by 'x' or 'X' (also '*' for backwards compatibility),
359 * specifying the product of the indicated values.
362 get_num(const char *val)
364 uintmax_t num, mult, prevnum;
368 num = strtouq(val, &expr, 0);
369 if (errno != 0) /* Overflow or underflow. */
372 if (expr == val) /* No valid digits. */
373 errx(1, "%s: illegal numeric value", oper);
404 /* Check for overflow. */
405 if (num / mult != prevnum)
413 case '*': /* Backward compatible. */
416 mult = get_num(expr + 1);
419 if (num / mult == prevnum)
422 errx(1, "%s: %s", oper, strerror(ERANGE));
424 errx(1, "%s: illegal numeric value", oper);
430 * Convert an expression of the following forms to an off_t. This is the
431 * same as get_num(), but it uses signed numbers.
433 * The major problem here is that an off_t may not necessarily be a intmax_t.
436 get_off_t(const char *val)
438 intmax_t num, mult, prevnum;
442 num = strtoq(val, &expr, 0);
443 if (errno != 0) /* Overflow or underflow. */
446 if (expr == val) /* No valid digits. */
447 errx(1, "%s: illegal numeric value", oper);
476 /* Check for overflow. */
477 if ((prevnum > 0) != (num > 0) || num / mult != prevnum)
485 case '*': /* Backward compatible. */
488 mult = (intmax_t)get_off_t(expr + 1);
491 if ((prevnum > 0) == (num > 0) && num / mult == prevnum)
494 errx(1, "%s: %s", oper, strerror(ERANGE));
496 errx(1, "%s: illegal numeric value", oper);