2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1991, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * Keith Muller of the University of California, San Diego and Lance
9 * Visser of Convex Computer Corporation.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 static char sccsid[] = "@(#)args.c 8.3 (Berkeley) 4/2/94";
41 #include <sys/cdefs.h>
42 __FBSDID("$FreeBSD$");
44 #include <sys/param.h>
58 static int c_arg(const void *, const void *);
59 static int c_conv(const void *, const void *);
60 static int c_iflag(const void *, const void *);
61 static int c_oflag(const void *, const void *);
62 static void f_bs(char *);
63 static void f_cbs(char *);
64 static void f_conv(char *);
65 static void f_count(char *);
66 static void f_files(char *);
67 static void f_fillchar(char *);
68 static void f_ibs(char *);
69 static void f_if(char *);
70 static void f_iflag(char *);
71 static void f_obs(char *);
72 static void f_of(char *);
73 static void f_oflag(char *);
74 static void f_seek(char *);
75 static void f_skip(char *);
76 static void f_speed(char *);
77 static void f_status(char *);
78 static uintmax_t get_num(const char *);
79 static off_t get_off_t(const char *);
81 static const struct arg {
86 { "bs", f_bs, C_BS, C_BS|C_IBS|C_OBS|C_OSYNC },
87 { "cbs", f_cbs, C_CBS, C_CBS },
88 { "conv", f_conv, 0, 0 },
89 { "count", f_count, C_COUNT, C_COUNT },
90 { "files", f_files, C_FILES, C_FILES },
91 { "fillchar", f_fillchar, C_FILL, C_FILL },
92 { "ibs", f_ibs, C_IBS, C_BS|C_IBS },
93 { "if", f_if, C_IF, C_IF },
94 { "iflag", f_iflag, 0, 0 },
95 { "iseek", f_skip, C_SKIP, C_SKIP },
96 { "obs", f_obs, C_OBS, C_BS|C_OBS },
97 { "of", f_of, C_OF, C_OF },
98 { "oflag", f_oflag, 0, 0 },
99 { "oseek", f_seek, C_SEEK, C_SEEK },
100 { "seek", f_seek, C_SEEK, C_SEEK },
101 { "skip", f_skip, C_SKIP, C_SKIP },
102 { "speed", f_speed, 0, 0 },
103 { "status", f_status, C_STATUS,C_STATUS },
109 * args -- parse JCL syntax of dd.
117 in.dbsz = out.dbsz = 512;
119 while ((oper = *++argv) != NULL) {
120 if ((oper = strdup(oper)) == NULL)
121 errx(1, "unable to allocate space for the argument \"%s\"", *argv);
122 if ((arg = strchr(oper, '=')) == NULL)
123 errx(1, "unknown operand %s", oper);
126 errx(1, "no value specified for %s", oper);
128 if (!(ap = (struct arg *)bsearch(&tmp, args,
129 sizeof(args)/sizeof(struct arg), sizeof(struct arg),
131 errx(1, "unknown operand %s", tmp.name);
132 if (ddflags & ap->noset)
133 errx(1, "%s: illegal argument combination or already set",
139 /* Final sanity checks. */
141 if (ddflags & C_BS) {
143 * Bs is turned off by any conversion -- we assume the user
144 * just wanted to set both the input and output block sizes
145 * and didn't want the bs semantics, so we don't warn.
147 if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE |
151 /* Bs supersedes ibs and obs. */
152 if (ddflags & C_BS && ddflags & (C_IBS | C_OBS))
153 warnx("bs supersedes ibs and obs");
157 * Ascii/ebcdic and cbs implies block/unblock.
158 * Block/unblock requires cbs and vice-versa.
160 if (ddflags & (C_BLOCK | C_UNBLOCK)) {
161 if (!(ddflags & C_CBS))
162 errx(1, "record operations require cbs");
164 errx(1, "cbs cannot be zero");
165 cfunc = ddflags & C_BLOCK ? block : unblock;
166 } else if (ddflags & C_CBS) {
167 if (ddflags & (C_ASCII | C_EBCDIC)) {
168 if (ddflags & C_ASCII) {
169 ddflags |= C_UNBLOCK;
176 errx(1, "cbs meaningless if not doing record operations");
182 c_arg(const void *a, const void *b)
185 return (strcmp(((const struct arg *)a)->name,
186 ((const struct arg *)b)->name));
195 if (res < 1 || res > SSIZE_MAX)
196 errx(1, "bs must be between 1 and %zd", (ssize_t)SSIZE_MAX);
197 in.dbsz = out.dbsz = (size_t)res;
206 if (res < 1 || res > SSIZE_MAX)
207 errx(1, "cbs must be between 1 and %zd", (ssize_t)SSIZE_MAX);
217 if (res == UINTMAX_MAX)
218 errc(1, ERANGE, "%s", oper);
220 cpy_cnt = UINTMAX_MAX;
229 files_cnt = get_num(arg);
231 errx(1, "files must be between 1 and %zu", SIZE_MAX);
235 f_fillchar(char *arg)
238 if (strlen(arg) != 1)
239 errx(1, "need exactly one fill char");
249 if (!(ddflags & C_BS)) {
251 if (res < 1 || res > SSIZE_MAX)
252 errx(1, "ibs must be between 1 and %zd",
254 in.dbsz = (size_t)res;
265 static const struct iflag {
269 { "fullblock", C_IFULLBLOCK, C_SYNC },
275 struct iflag *ip, tmp;
277 while (arg != NULL) {
278 tmp.name = strsep(&arg, ",");
279 ip = bsearch(&tmp, ilist, nitems(ilist), sizeof(struct iflag),
282 errx(1, "unknown iflag %s", tmp.name);
283 if (ddflags & ip->noset)
284 errx(1, "%s: illegal conversion combination", tmp.name);
290 c_iflag(const void *a, const void *b)
293 return (strcmp(((const struct iflag *)a)->name,
294 ((const struct iflag *)b)->name));
302 if (!(ddflags & C_BS)) {
304 if (res < 1 || res > SSIZE_MAX)
305 errx(1, "obs must be between 1 and %zd",
307 out.dbsz = (size_t)res;
322 out.offset = get_off_t(arg);
329 in.offset = get_off_t(arg);
336 speed = get_num(arg);
343 if (strcmp(arg, "none") == 0)
345 else if (strcmp(arg, "noxfer") == 0)
347 else if (strcmp(arg, "progress") == 0)
348 ddflags |= C_PROGRESS;
350 errx(1, "unknown status %s", arg);
353 static const struct conv {
358 { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX },
359 { "block", C_BLOCK, C_UNBLOCK, NULL },
360 { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX },
361 { "fdatasync", C_FDATASYNC, 0, NULL },
362 { "fsync", C_FSYNC, 0, NULL },
363 { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX },
364 { "lcase", C_LCASE, C_UCASE, NULL },
365 { "noerror", C_NOERROR, 0, NULL },
366 { "notrunc", C_NOTRUNC, 0, NULL },
367 { "oldascii", C_ASCII, C_EBCDIC, e2a_32V },
368 { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V },
369 { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V },
370 { "osync", C_OSYNC, C_BS, NULL },
371 { "pareven", C_PAREVEN, C_PARODD|C_PARSET|C_PARNONE, NULL},
372 { "parnone", C_PARNONE, C_PARODD|C_PARSET|C_PAREVEN, NULL},
373 { "parodd", C_PARODD, C_PAREVEN|C_PARSET|C_PARNONE, NULL},
374 { "parset", C_PARSET, C_PARODD|C_PAREVEN|C_PARNONE, NULL},
375 { "sparse", C_SPARSE, 0, NULL },
376 { "swab", C_SWAB, 0, NULL },
377 { "sync", C_SYNC, C_IFULLBLOCK, NULL },
378 { "ucase", C_UCASE, C_LCASE, NULL },
379 { "unblock", C_UNBLOCK, C_BLOCK, NULL },
385 struct conv *cp, tmp;
387 while (arg != NULL) {
388 tmp.name = strsep(&arg, ",");
389 cp = bsearch(&tmp, clist, nitems(clist), sizeof(struct conv),
392 errx(1, "unknown conversion %s", tmp.name);
393 if (ddflags & cp->noset)
394 errx(1, "%s: illegal conversion combination", tmp.name);
402 c_conv(const void *a, const void *b)
405 return (strcmp(((const struct conv *)a)->name,
406 ((const struct conv *)b)->name));
409 static const struct oflag {
413 { "fsync", C_OFSYNC },
414 { "sync", C_OFSYNC },
420 struct oflag *op, tmp;
422 while (arg != NULL) {
423 tmp.name = strsep(&arg, ",");
424 op = bsearch(&tmp, olist, nitems(olist), sizeof(struct oflag),
427 errx(1, "unknown open flag %s", tmp.name);
433 c_oflag(const void *a, const void *b)
436 return (strcmp(((const struct oflag *)a)->name,
437 ((const struct oflag *)b)->name));
441 postfix_to_mult(const char expr)
465 mult = (uintmax_t)1 << 40;
469 mult = (uintmax_t)1 << 50;
481 * Convert an expression of the following forms to a uintmax_t.
482 * 1) A positive decimal number.
483 * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512).
484 * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10).
485 * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20).
486 * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30).
487 * 6) A positive decimal number followed by a 't' or 'T' (mult by 1 << 40).
488 * 7) A positive decimal number followed by a 'p' or 'P' (mult by 1 << 50).
489 * 8) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int).
490 * 9) Two or more positive decimal numbers (with/without [BbKkMmGgWw])
491 * separated by 'x' or 'X' (also '*' for backwards compatibility),
492 * specifying the product of the indicated values.
495 get_num(const char *val)
497 uintmax_t num, mult, prevnum;
501 num = strtoumax(val, &expr, 0);
502 if (expr == val) /* No valid digits. */
503 errx(1, "%s: invalid numeric value", oper);
507 mult = postfix_to_mult(*expr);
512 /* Check for overflow. */
513 if (num / mult != prevnum)
521 case '*': /* Backward compatible. */
524 mult = get_num(expr + 1);
527 if (num / mult == prevnum)
530 errx(1, "%s: %s", oper, strerror(ERANGE));
532 errx(1, "%s: illegal numeric value", oper);
538 * Convert an expression of the following forms to an off_t. This is the
539 * same as get_num(), but it uses signed numbers.
541 * The major problem here is that an off_t may not necessarily be a intmax_t.
544 get_off_t(const char *val)
546 intmax_t num, mult, prevnum;
550 num = strtoimax(val, &expr, 0);
551 if (expr == val) /* No valid digits. */
552 errx(1, "%s: invalid numeric value", oper);
556 mult = postfix_to_mult(*expr);
561 /* Check for overflow. */
562 if ((prevnum > 0) != (num > 0) || num / mult != prevnum)
570 case '*': /* Backward compatible. */
573 mult = (intmax_t)get_off_t(expr + 1);
576 if ((prevnum > 0) == (num > 0) && num / mult == prevnum)
579 errx(1, "%s: %s", oper, strerror(ERANGE));
581 errx(1, "%s: illegal numeric value", oper);