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 void f_speed(char *);
70 static void f_status(char *);
71 static uintmax_t get_num(const char *);
72 static off_t get_off_t(const char *);
74 static const struct arg {
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 { "speed", f_speed, 0, 0 },
94 { "status", f_status, C_STATUS,C_STATUS },
100 * args -- parse JCL syntax of dd.
108 in.dbsz = out.dbsz = 512;
110 while ((oper = *++argv) != NULL) {
111 if ((oper = strdup(oper)) == NULL)
112 errx(1, "unable to allocate space for the argument \"%s\"", *argv);
113 if ((arg = strchr(oper, '=')) == NULL)
114 errx(1, "unknown operand %s", oper);
117 errx(1, "no value specified for %s", oper);
119 if (!(ap = (struct arg *)bsearch(&tmp, args,
120 sizeof(args)/sizeof(struct arg), sizeof(struct arg),
122 errx(1, "unknown operand %s", tmp.name);
123 if (ddflags & ap->noset)
124 errx(1, "%s: illegal argument combination or already set",
130 /* Final sanity checks. */
132 if (ddflags & C_BS) {
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.
138 if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE |
142 /* Bs supersedes ibs and obs. */
143 if (ddflags & C_BS && ddflags & (C_IBS | C_OBS))
144 warnx("bs supersedes ibs and obs");
148 * Ascii/ebcdic and cbs implies block/unblock.
149 * Block/unblock requires cbs and vice-versa.
151 if (ddflags & (C_BLOCK | C_UNBLOCK)) {
152 if (!(ddflags & C_CBS))
153 errx(1, "record operations require cbs");
155 errx(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;
167 errx(1, "cbs meaningless if not doing record operations");
173 c_arg(const void *a, const void *b)
176 return (strcmp(((const struct arg *)a)->name,
177 ((const struct arg *)b)->name));
186 if (res < 1 || res > SSIZE_MAX)
187 errx(1, "bs must be between 1 and %jd", (intmax_t)SSIZE_MAX);
188 in.dbsz = out.dbsz = (size_t)res;
197 if (res < 1 || res > SSIZE_MAX)
198 errx(1, "cbs must be between 1 and %jd", (intmax_t)SSIZE_MAX);
207 res = (intmax_t)get_num(arg);
209 errx(1, "count cannot be negative");
211 cpy_cnt = (uintmax_t)-1;
213 cpy_cnt = (uintmax_t)res;
220 files_cnt = get_num(arg);
222 errx(1, "files must be between 1 and %jd", (uintmax_t)-1);
226 f_fillchar(char *arg)
229 if (strlen(arg) != 1)
230 errx(1, "need exactly one fill char");
240 if (!(ddflags & C_BS)) {
242 if (res < 1 || res > SSIZE_MAX)
243 errx(1, "ibs must be between 1 and %jd",
244 (intmax_t)SSIZE_MAX);
245 in.dbsz = (size_t)res;
261 if (!(ddflags & C_BS)) {
263 if (res < 1 || res > SSIZE_MAX)
264 errx(1, "obs must be between 1 and %jd",
265 (intmax_t)SSIZE_MAX);
266 out.dbsz = (size_t)res;
281 out.offset = get_off_t(arg);
288 in.offset = get_off_t(arg);
295 speed = get_num(arg);
302 if (strcmp(arg, "none") == 0)
304 else if (strcmp(arg, "noxfer") == 0)
306 else if (strcmp(arg, "progress") == 0)
307 ddflags |= C_PROGRESS;
309 errx(1, "unknown status %s", arg);
312 static const struct conv {
317 { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX },
318 { "block", C_BLOCK, C_UNBLOCK, NULL },
319 { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX },
320 { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX },
321 { "lcase", C_LCASE, C_UCASE, NULL },
322 { "noerror", C_NOERROR, 0, NULL },
323 { "notrunc", C_NOTRUNC, 0, NULL },
324 { "oldascii", C_ASCII, C_EBCDIC, e2a_32V },
325 { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V },
326 { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V },
327 { "osync", C_OSYNC, C_BS, NULL },
328 { "pareven", C_PAREVEN, C_PARODD|C_PARSET|C_PARNONE, NULL},
329 { "parnone", C_PARNONE, C_PARODD|C_PARSET|C_PAREVEN, NULL},
330 { "parodd", C_PARODD, C_PAREVEN|C_PARSET|C_PARNONE, NULL},
331 { "parset", C_PARSET, C_PARODD|C_PAREVEN|C_PARNONE, NULL},
332 { "sparse", C_SPARSE, 0, NULL },
333 { "swab", C_SWAB, 0, NULL },
334 { "sync", C_SYNC, 0, NULL },
335 { "ucase", C_UCASE, C_LCASE, NULL },
336 { "unblock", C_UNBLOCK, C_BLOCK, NULL },
342 struct conv *cp, tmp;
344 while (arg != NULL) {
345 tmp.name = strsep(&arg, ",");
346 cp = bsearch(&tmp, clist, sizeof(clist) / sizeof(struct conv),
347 sizeof(struct conv), c_conv);
349 errx(1, "unknown conversion %s", tmp.name);
350 if (ddflags & cp->noset)
351 errx(1, "%s: illegal conversion combination", tmp.name);
359 c_conv(const void *a, const void *b)
362 return (strcmp(((const struct conv *)a)->name,
363 ((const struct conv *)b)->name));
367 postfix_to_mult(const char expr)
391 mult = (uintmax_t)1 << 40;
395 mult = (uintmax_t)1 << 50;
407 * Convert an expression of the following forms to a uintmax_t.
408 * 1) A positive decimal number.
409 * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512).
410 * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10).
411 * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20).
412 * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30).
413 * 6) A positive decimal number followed by a 't' or 'T' (mult by 1 << 40).
414 * 7) A positive decimal number followed by a 'p' or 'P' (mult by 1 << 50).
415 * 8) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int).
416 * 9) Two or more positive decimal numbers (with/without [BbKkMmGgWw])
417 * separated by 'x' or 'X' (also '*' for backwards compatibility),
418 * specifying the product of the indicated values.
421 get_num(const char *val)
423 uintmax_t num, mult, prevnum;
427 num = strtoumax(val, &expr, 0);
428 if (expr == val) /* No valid digits. */
429 errx(1, "%s: invalid numeric value", oper);
433 mult = postfix_to_mult(*expr);
438 /* Check for overflow. */
439 if (num / mult != prevnum)
447 case '*': /* Backward compatible. */
450 mult = get_num(expr + 1);
453 if (num / mult == prevnum)
456 errx(1, "%s: %s", oper, strerror(ERANGE));
458 errx(1, "%s: illegal numeric value", oper);
464 * Convert an expression of the following forms to an off_t. This is the
465 * same as get_num(), but it uses signed numbers.
467 * The major problem here is that an off_t may not necessarily be a intmax_t.
470 get_off_t(const char *val)
472 intmax_t num, mult, prevnum;
476 num = strtoimax(val, &expr, 0);
477 if (expr == val) /* No valid digits. */
478 errx(1, "%s: invalid numeric value", oper);
482 mult = postfix_to_mult(*expr);
487 /* Check for overflow. */
488 if ((prevnum > 0) != (num > 0) || num / mult != prevnum)
496 case '*': /* Backward compatible. */
499 mult = (intmax_t)get_off_t(expr + 1);
502 if ((prevnum > 0) == (num > 0) && num / mult == prevnum)
505 errx(1, "%s: %s", oper, strerror(ERANGE));
507 errx(1, "%s: illegal numeric value", oper);