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
35 * @(#)args.c 8.3 (Berkeley) 4/2/94
36 * $FreeBSD: head/bin/dd/args.c 337505 2018-08-08 21:37:02Z kevans $
39 #include <sys/types.h>
51 static int c_arg(const void *, const void *);
52 static int c_conv(const void *, const void *);
53 static void f_bs(char *);
54 static void f_cbs(char *);
55 static void f_conv(char *);
56 static void f_count(char *);
57 static void f_files(char *);
58 static void f_fillchar(char *);
59 static void f_ibs(char *);
60 static void f_if(char *);
61 static void f_obs(char *);
62 static void f_of(char *);
63 static void f_seek(char *);
64 static void f_skip(char *);
65 static void f_speed(char *);
66 static void f_status(char *);
67 static uintmax_t get_num(const char *);
68 static off_t get_off_t(const char *);
69 static intmax_t postfix_to_mult(const char);
71 static const struct arg {
76 { "bs", f_bs, C_BS, C_BS|C_IBS|C_OBS|C_OSYNC },
77 { "cbs", f_cbs, C_CBS, C_CBS },
78 { "conv", f_conv, 0, 0 },
79 { "count", f_count, C_COUNT, C_COUNT },
80 { "files", f_files, C_FILES, C_FILES },
81 { "fillchar", f_fillchar, C_FILL, C_FILL },
82 { "ibs", f_ibs, C_IBS, C_BS|C_IBS },
83 { "if", f_if, C_IF, C_IF },
84 { "iseek", f_skip, C_SKIP, C_SKIP },
85 { "obs", f_obs, C_OBS, C_BS|C_OBS },
86 { "of", f_of, C_OF, C_OF },
87 { "oseek", f_seek, C_SEEK, C_SEEK },
88 { "seek", f_seek, C_SEEK, C_SEEK },
89 { "skip", f_skip, C_SKIP, C_SKIP },
90 { "speed", f_speed, 0, 0 },
91 { "status", f_status, C_STATUS,C_STATUS },
97 * args -- parse JCL syntax of dd.
105 in.dbsz = out.dbsz = 512;
107 while ((oper = *++argv) != NULL) {
108 if ((oper = strdup(oper)) == NULL)
109 errx(1, "unable to allocate space for the argument \"%s\"", *argv);
110 if ((arg = strchr(oper, '=')) == NULL)
111 errx(1, "unknown operand %s", oper);
114 errx(1, "no value specified for %s", oper);
116 if (!(ap = (struct arg *)bsearch(&tmp, args,
117 sizeof(args)/sizeof(struct arg), sizeof(struct arg),
119 errx(1, "unknown operand %s", tmp.name);
120 if (ddflags & ap->noset)
121 errx(1, "%s: illegal argument combination or already set",
127 /* Final sanity checks. */
129 if (ddflags & C_BS) {
131 * Bs is turned off by any conversion -- we assume the user
132 * just wanted to set both the input and output block sizes
133 * and didn't want the bs semantics, so we don't warn.
135 if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE |
139 /* Bs supersedes ibs and obs. */
140 if (ddflags & C_BS && ddflags & (C_IBS | C_OBS))
141 warnx("bs supersedes ibs and obs");
145 * Ascii/ebcdic and cbs implies block/unblock.
146 * Block/unblock requires cbs and vice-versa.
148 if (ddflags & (C_BLOCK | C_UNBLOCK)) {
149 if (!(ddflags & C_CBS))
150 errx(1, "record operations require cbs");
152 errx(1, "cbs cannot be zero");
153 cfunc = ddflags & C_BLOCK ? block : unblock;
154 } else if (ddflags & C_CBS) {
155 if (ddflags & (C_ASCII | C_EBCDIC)) {
156 if (ddflags & C_ASCII) {
157 ddflags |= C_UNBLOCK;
164 errx(1, "cbs meaningless if not doing record operations");
172 c_arg(const void *a, const void *b)
174 return (strcmp(((const struct arg *)a)->name,
175 ((const struct arg *)b)->name));
184 if (res < 1 || res > SSIZE_MAX)
185 errx(1, "bs must be between 1 and %zd", SSIZE_MAX);
186 in.dbsz = out.dbsz = (size_t)res;
195 if (res < 1 || res > SSIZE_MAX)
196 errx(1, "cbs must be between 1 and %zd", SSIZE_MAX);
206 if (res == UINTMAX_MAX)
207 errc(1, ERANGE, "%s", oper);
209 cpy_cnt = UINTMAX_MAX;
217 files_cnt = get_num(arg);
219 errx(1, "files must be between 1 and %zu", SIZE_MAX);
223 f_fillchar(char *arg)
225 if (strlen(arg) != 1)
226 errx(1, "need exactly one fill char");
236 if (!(ddflags & C_BS)) {
238 if (res < 1 || res > SSIZE_MAX)
239 errx(1, "ibs must be between 1 and %zd", SSIZE_MAX);
240 in.dbsz = (size_t)res;
255 if (!(ddflags & C_BS)) {
257 if (res < 1 || res > SSIZE_MAX)
258 errx(1, "obs must be between 1 and %zd", SSIZE_MAX);
259 out.dbsz = (size_t)res;
272 out.offset = get_off_t(arg);
278 in.offset = get_off_t(arg);
284 speed = get_num(arg);
290 if (strcmp(arg, "none") == 0)
292 else if (strcmp(arg, "noxfer") == 0)
294 else if (strcmp(arg, "progress") == 0)
295 ddflags |= C_PROGRESS;
297 errx(1, "unknown status %s", arg);
300 static const struct conv {
305 { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX },
306 { "block", C_BLOCK, C_UNBLOCK, NULL },
307 { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX },
308 { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX },
309 { "lcase", C_LCASE, C_UCASE, NULL },
310 { "noerror", C_NOERROR, 0, NULL },
311 { "notrunc", C_NOTRUNC, 0, NULL },
312 { "oldascii", C_ASCII, C_EBCDIC, e2a_32V },
313 { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V },
314 { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V },
315 { "osync", C_OSYNC, C_BS, NULL },
316 { "pareven", C_PAREVEN, C_PARODD|C_PARSET|C_PARNONE, NULL},
317 { "parnone", C_PARNONE, C_PARODD|C_PARSET|C_PAREVEN, NULL},
318 { "parodd", C_PARODD, C_PAREVEN|C_PARSET|C_PARNONE, NULL},
319 { "parset", C_PARSET, C_PARODD|C_PAREVEN|C_PARNONE, NULL},
320 { "sparse", C_SPARSE, 0, NULL },
321 { "swab", C_SWAB, 0, NULL },
322 { "sync", C_SYNC, 0, NULL },
323 { "ucase", C_UCASE, C_LCASE, NULL },
324 { "unblock", C_UNBLOCK, C_BLOCK, NULL },
330 struct conv *cp, tmp;
332 while (arg != NULL) {
333 tmp.name = strsep(&arg, ",");
334 cp = bsearch(&tmp, clist, sizeof(clist) / sizeof(struct conv),
335 sizeof(struct conv), c_conv);
337 errx(1, "unknown conversion %s", tmp.name);
338 if (ddflags & cp->noset)
339 errx(1, "%s: illegal conversion combination", tmp.name);
347 c_conv(const void *a, const void *b)
349 return (strcmp(((const struct conv *)a)->name,
350 ((const struct conv *)b)->name));
354 postfix_to_mult(const char expr)
378 mult = (uintmax_t)1 << 40;
382 mult = (uintmax_t)1 << 50;
394 * Convert an expression of the following forms to a uintmax_t.
395 * 1) A positive decimal number.
396 * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512).
397 * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10).
398 * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20).
399 * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30).
400 * 6) A positive decimal number followed by a 't' or 'T' (mult by 1 << 40).
401 * 7) A positive decimal number followed by a 'p' or 'P' (mult by 1 << 50).
402 * 8) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int).
403 * 9) Two or more positive decimal numbers (with/without [BbKkMmGgWw])
404 * separated by 'x' or 'X' (also '*' for backwards compatibility),
405 * specifying the product of the indicated values.
408 get_num(const char *val)
410 uintmax_t num, mult, prevnum;
414 num = strtoumax(val, &expr, 0);
415 if (expr == val) /* No valid digits. */
416 errx(1, "%s: invalid numeric value", oper);
420 mult = postfix_to_mult(*expr);
425 /* Check for overflow. */
426 if (num / mult != prevnum)
434 case '*': /* Backward compatible. */
437 mult = get_num(expr + 1);
440 if (num / mult == prevnum)
443 errx(1, "%s: %s", oper, strerror(ERANGE));
445 errx(1, "%s: illegal numeric value", oper);
452 * Convert an expression to an off_t. This is the same as get_num(), but it
453 * uses signed numbers. The supported forms are also similar to get_num().
455 * The major problem here is that an off_t may not necessarily be a intmax_t.
458 get_off_t(const char *val)
460 intmax_t num, mult, prevnum;
464 num = strtoimax(val, &expr, 0);
465 if (expr == val) /* No valid digits. */
466 errx(1, "%s: invalid numeric value", oper);
470 mult = postfix_to_mult(*expr);
475 /* Check for overflow. */
476 if ((prevnum > 0) != (num > 0) || num / mult != prevnum)
484 case '*': /* Backward compatible. */
487 mult = (intmax_t)get_off_t(expr + 1);
490 if ((prevnum > 0) == (num > 0) && num / mult == prevnum)
493 errx(1, "%s: %s", oper, strerror(ERANGE));
495 errx(1, "%s: illegal numeric value", oper);