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/types.h>
58 static int c_arg(const void *, const void *);
59 static int c_conv(const void *, const void *);
60 static void f_bs(char *);
61 static void f_cbs(char *);
62 static void f_conv(char *);
63 static void f_count(char *);
64 static void f_files(char *);
65 static void f_fillchar(char *);
66 static void f_ibs(char *);
67 static void f_if(char *);
68 static void f_obs(char *);
69 static void f_of(char *);
70 static void f_seek(char *);
71 static void f_skip(char *);
72 static void f_speed(char *);
73 static void f_status(char *);
74 static uintmax_t get_num(const char *);
75 static off_t get_off_t(const char *);
77 static const struct arg {
82 { "bs", f_bs, C_BS, C_BS|C_IBS|C_OBS|C_OSYNC },
83 { "cbs", f_cbs, C_CBS, C_CBS },
84 { "conv", f_conv, 0, 0 },
85 { "count", f_count, C_COUNT, C_COUNT },
86 { "files", f_files, C_FILES, C_FILES },
87 { "fillchar", f_fillchar, C_FILL, C_FILL },
88 { "ibs", f_ibs, C_IBS, C_BS|C_IBS },
89 { "if", f_if, C_IF, C_IF },
90 { "iseek", f_skip, C_SKIP, C_SKIP },
91 { "obs", f_obs, C_OBS, C_BS|C_OBS },
92 { "of", f_of, C_OF, C_OF },
93 { "oseek", f_seek, C_SEEK, C_SEEK },
94 { "seek", f_seek, C_SEEK, C_SEEK },
95 { "skip", f_skip, C_SKIP, C_SKIP },
96 { "speed", f_speed, 0, 0 },
97 { "status", f_status, C_STATUS,C_STATUS },
103 * args -- parse JCL syntax of dd.
111 in.dbsz = out.dbsz = 512;
113 while ((oper = *++argv) != NULL) {
114 if ((oper = strdup(oper)) == NULL)
115 errx(1, "unable to allocate space for the argument \"%s\"", *argv);
116 if ((arg = strchr(oper, '=')) == NULL)
117 errx(1, "unknown operand %s", oper);
120 errx(1, "no value specified for %s", oper);
122 if (!(ap = (struct arg *)bsearch(&tmp, args,
123 sizeof(args)/sizeof(struct arg), sizeof(struct arg),
125 errx(1, "unknown operand %s", tmp.name);
126 if (ddflags & ap->noset)
127 errx(1, "%s: illegal argument combination or already set",
133 /* Final sanity checks. */
135 if (ddflags & C_BS) {
137 * Bs is turned off by any conversion -- we assume the user
138 * just wanted to set both the input and output block sizes
139 * and didn't want the bs semantics, so we don't warn.
141 if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE |
145 /* Bs supersedes ibs and obs. */
146 if (ddflags & C_BS && ddflags & (C_IBS | C_OBS))
147 warnx("bs supersedes ibs and obs");
151 * Ascii/ebcdic and cbs implies block/unblock.
152 * Block/unblock requires cbs and vice-versa.
154 if (ddflags & (C_BLOCK | C_UNBLOCK)) {
155 if (!(ddflags & C_CBS))
156 errx(1, "record operations require cbs");
158 errx(1, "cbs cannot be zero");
159 cfunc = ddflags & C_BLOCK ? block : unblock;
160 } else if (ddflags & C_CBS) {
161 if (ddflags & (C_ASCII | C_EBCDIC)) {
162 if (ddflags & C_ASCII) {
163 ddflags |= C_UNBLOCK;
170 errx(1, "cbs meaningless if not doing record operations");
176 c_arg(const void *a, const void *b)
179 return (strcmp(((const struct arg *)a)->name,
180 ((const struct arg *)b)->name));
189 if (res < 1 || res > SSIZE_MAX)
190 errx(1, "bs must be between 1 and %zd", (ssize_t)SSIZE_MAX);
191 in.dbsz = out.dbsz = (size_t)res;
200 if (res < 1 || res > SSIZE_MAX)
201 errx(1, "cbs must be between 1 and %zd", (ssize_t)SSIZE_MAX);
211 if (res == UINTMAX_MAX)
212 errc(1, ERANGE, "%s", oper);
214 cpy_cnt = UINTMAX_MAX;
223 files_cnt = get_num(arg);
225 errx(1, "files must be between 1 and %zu", SIZE_MAX);
229 f_fillchar(char *arg)
232 if (strlen(arg) != 1)
233 errx(1, "need exactly one fill char");
243 if (!(ddflags & C_BS)) {
245 if (res < 1 || res > SSIZE_MAX)
246 errx(1, "ibs must be between 1 and %zd",
248 in.dbsz = (size_t)res;
264 if (!(ddflags & C_BS)) {
266 if (res < 1 || res > SSIZE_MAX)
267 errx(1, "obs must be between 1 and %zd",
269 out.dbsz = (size_t)res;
284 out.offset = get_off_t(arg);
291 in.offset = get_off_t(arg);
298 speed = get_num(arg);
305 if (strcmp(arg, "none") == 0)
307 else if (strcmp(arg, "noxfer") == 0)
309 else if (strcmp(arg, "progress") == 0)
310 ddflags |= C_PROGRESS;
312 errx(1, "unknown status %s", arg);
315 static const struct conv {
320 { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX },
321 { "block", C_BLOCK, C_UNBLOCK, NULL },
322 { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX },
323 { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX },
324 { "lcase", C_LCASE, C_UCASE, NULL },
325 { "noerror", C_NOERROR, 0, NULL },
326 { "notrunc", C_NOTRUNC, 0, NULL },
327 { "oldascii", C_ASCII, C_EBCDIC, e2a_32V },
328 { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V },
329 { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V },
330 { "osync", C_OSYNC, C_BS, NULL },
331 { "pareven", C_PAREVEN, C_PARODD|C_PARSET|C_PARNONE, NULL},
332 { "parnone", C_PARNONE, C_PARODD|C_PARSET|C_PAREVEN, NULL},
333 { "parodd", C_PARODD, C_PAREVEN|C_PARSET|C_PARNONE, NULL},
334 { "parset", C_PARSET, C_PARODD|C_PAREVEN|C_PARNONE, NULL},
335 { "sparse", C_SPARSE, 0, NULL },
336 { "swab", C_SWAB, 0, NULL },
337 { "sync", C_SYNC, 0, NULL },
338 { "ucase", C_UCASE, C_LCASE, NULL },
339 { "unblock", C_UNBLOCK, C_BLOCK, NULL },
345 struct conv *cp, tmp;
347 while (arg != NULL) {
348 tmp.name = strsep(&arg, ",");
349 cp = bsearch(&tmp, clist, sizeof(clist) / sizeof(struct conv),
350 sizeof(struct conv), c_conv);
352 errx(1, "unknown conversion %s", tmp.name);
353 if (ddflags & cp->noset)
354 errx(1, "%s: illegal conversion combination", tmp.name);
362 c_conv(const void *a, const void *b)
365 return (strcmp(((const struct conv *)a)->name,
366 ((const struct conv *)b)->name));
370 postfix_to_mult(const char expr)
394 mult = (uintmax_t)1 << 40;
398 mult = (uintmax_t)1 << 50;
410 * Convert an expression of the following forms to a uintmax_t.
411 * 1) A positive decimal number.
412 * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512).
413 * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10).
414 * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20).
415 * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30).
416 * 6) A positive decimal number followed by a 't' or 'T' (mult by 1 << 40).
417 * 7) A positive decimal number followed by a 'p' or 'P' (mult by 1 << 50).
418 * 8) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int).
419 * 9) Two or more positive decimal numbers (with/without [BbKkMmGgWw])
420 * separated by 'x' or 'X' (also '*' for backwards compatibility),
421 * specifying the product of the indicated values.
424 get_num(const char *val)
426 uintmax_t num, mult, prevnum;
430 num = strtoumax(val, &expr, 0);
431 if (expr == val) /* No valid digits. */
432 errx(1, "%s: invalid numeric value", oper);
436 mult = postfix_to_mult(*expr);
441 /* Check for overflow. */
442 if (num / mult != prevnum)
450 case '*': /* Backward compatible. */
453 mult = get_num(expr + 1);
456 if (num / mult == prevnum)
459 errx(1, "%s: %s", oper, strerror(ERANGE));
461 errx(1, "%s: illegal numeric value", oper);
467 * Convert an expression of the following forms to an off_t. This is the
468 * same as get_num(), but it uses signed numbers.
470 * The major problem here is that an off_t may not necessarily be a intmax_t.
473 get_off_t(const char *val)
475 intmax_t num, mult, prevnum;
479 num = strtoimax(val, &expr, 0);
480 if (expr == val) /* No valid digits. */
481 errx(1, "%s: invalid numeric value", oper);
485 mult = postfix_to_mult(*expr);
490 /* Check for overflow. */
491 if ((prevnum > 0) != (num > 0) || num / mult != prevnum)
499 case '*': /* Backward compatible. */
502 mult = (intmax_t)get_off_t(expr + 1);
505 if ((prevnum > 0) == (num > 0) && num / mult == prevnum)
508 errx(1, "%s: %s", oper, strerror(ERANGE));
510 errx(1, "%s: illegal numeric value", oper);