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_status(char *);
70 static uintmax_t get_num(const char *);
71 static off_t get_off_t(const char *);
73 static const struct arg {
78 { "bs", f_bs, C_BS, C_BS|C_IBS|C_OBS|C_OSYNC },
79 { "cbs", f_cbs, C_CBS, C_CBS },
80 { "conv", f_conv, 0, 0 },
81 { "count", f_count, C_COUNT, C_COUNT },
82 { "files", f_files, C_FILES, C_FILES },
83 { "fillchar", f_fillchar, C_FILL, C_FILL },
84 { "ibs", f_ibs, C_IBS, C_BS|C_IBS },
85 { "if", f_if, C_IF, C_IF },
86 { "iseek", f_skip, C_SKIP, C_SKIP },
87 { "obs", f_obs, C_OBS, C_BS|C_OBS },
88 { "of", f_of, C_OF, C_OF },
89 { "oseek", f_seek, C_SEEK, C_SEEK },
90 { "seek", f_seek, C_SEEK, C_SEEK },
91 { "skip", f_skip, C_SKIP, C_SKIP },
92 { "status", f_status, C_STATUS,C_STATUS },
98 * args -- parse JCL syntax of dd.
106 in.dbsz = out.dbsz = 512;
108 while ((oper = *++argv) != NULL) {
109 if ((oper = strdup(oper)) == NULL)
110 errx(1, "unable to allocate space for the argument \"%s\"", *argv);
111 if ((arg = strchr(oper, '=')) == NULL)
112 errx(1, "unknown operand %s", oper);
115 errx(1, "no value specified for %s", oper);
117 if (!(ap = (struct arg *)bsearch(&tmp, args,
118 sizeof(args)/sizeof(struct arg), sizeof(struct arg),
120 errx(1, "unknown operand %s", tmp.name);
121 if (ddflags & ap->noset)
122 errx(1, "%s: illegal argument combination or already set",
128 /* Final sanity checks. */
130 if (ddflags & C_BS) {
132 * Bs is turned off by any conversion -- we assume the user
133 * just wanted to set both the input and output block sizes
134 * and didn't want the bs semantics, so we don't warn.
136 if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE |
140 /* Bs supersedes ibs and obs. */
141 if (ddflags & C_BS && ddflags & (C_IBS | C_OBS))
142 warnx("bs supersedes ibs and obs");
146 * Ascii/ebcdic and cbs implies block/unblock.
147 * Block/unblock requires cbs and vice-versa.
149 if (ddflags & (C_BLOCK | C_UNBLOCK)) {
150 if (!(ddflags & C_CBS))
151 errx(1, "record operations require cbs");
153 errx(1, "cbs cannot be zero");
154 cfunc = ddflags & C_BLOCK ? block : unblock;
155 } else if (ddflags & C_CBS) {
156 if (ddflags & (C_ASCII | C_EBCDIC)) {
157 if (ddflags & C_ASCII) {
158 ddflags |= C_UNBLOCK;
165 errx(1, "cbs meaningless if not doing record operations");
170 * Bail out if the calculation of a file offset would overflow.
172 if (in.offset > OFF_MAX / (ssize_t)in.dbsz ||
173 out.offset > OFF_MAX / (ssize_t)out.dbsz)
174 errx(1, "seek offsets cannot be larger than %jd",
179 c_arg(const void *a, const void *b)
182 return (strcmp(((const struct arg *)a)->name,
183 ((const struct arg *)b)->name));
192 if (res < 1 || res > SSIZE_MAX)
193 errx(1, "bs must be between 1 and %jd", (intmax_t)SSIZE_MAX);
194 in.dbsz = out.dbsz = (size_t)res;
203 if (res < 1 || res > SSIZE_MAX)
204 errx(1, "cbs must be between 1 and %jd", (intmax_t)SSIZE_MAX);
213 res = (intmax_t)get_num(arg);
215 errx(1, "count cannot be negative");
217 cpy_cnt = (uintmax_t)-1;
219 cpy_cnt = (uintmax_t)res;
226 files_cnt = get_num(arg);
228 errx(1, "files must be between 1 and %jd", (uintmax_t)-1);
232 f_fillchar(char *arg)
235 if (strlen(arg) != 1)
236 errx(1, "need exactly one fill char");
246 if (!(ddflags & C_BS)) {
248 if (res < 1 || res > SSIZE_MAX)
249 errx(1, "ibs must be between 1 and %jd",
250 (intmax_t)SSIZE_MAX);
251 in.dbsz = (size_t)res;
267 if (!(ddflags & C_BS)) {
269 if (res < 1 || res > SSIZE_MAX)
270 errx(1, "obs must be between 1 and %jd",
271 (intmax_t)SSIZE_MAX);
272 out.dbsz = (size_t)res;
287 out.offset = get_off_t(arg);
294 in.offset = get_off_t(arg);
301 if (strcmp(arg, "none") == 0)
303 else if (strcmp(arg, "noxfer") == 0)
306 errx(1, "unknown status %s", arg);
309 static const struct conv {
314 { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX },
315 { "block", C_BLOCK, C_UNBLOCK, NULL },
316 { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX },
317 { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX },
318 { "lcase", C_LCASE, C_UCASE, NULL },
319 { "noerror", C_NOERROR, 0, NULL },
320 { "notrunc", C_NOTRUNC, 0, NULL },
321 { "oldascii", C_ASCII, C_EBCDIC, e2a_32V },
322 { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V },
323 { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V },
324 { "osync", C_OSYNC, C_BS, NULL },
325 { "pareven", C_PAREVEN, C_PARODD|C_PARSET|C_PARNONE, NULL},
326 { "parnone", C_PARNONE, C_PARODD|C_PARSET|C_PAREVEN, NULL},
327 { "parodd", C_PARODD, C_PAREVEN|C_PARSET|C_PARNONE, NULL},
328 { "parset", C_PARSET, C_PARODD|C_PAREVEN|C_PARNONE, NULL},
329 { "sparse", C_SPARSE, 0, NULL },
330 { "swab", C_SWAB, 0, NULL },
331 { "sync", C_SYNC, 0, NULL },
332 { "ucase", C_UCASE, C_LCASE, NULL },
333 { "unblock", C_UNBLOCK, C_BLOCK, NULL },
339 struct conv *cp, tmp;
341 while (arg != NULL) {
342 tmp.name = strsep(&arg, ",");
343 cp = bsearch(&tmp, clist, sizeof(clist) / sizeof(struct conv),
344 sizeof(struct conv), c_conv);
346 errx(1, "unknown conversion %s", tmp.name);
347 if (ddflags & cp->noset)
348 errx(1, "%s: illegal conversion combination", tmp.name);
356 c_conv(const void *a, const void *b)
359 return (strcmp(((const struct conv *)a)->name,
360 ((const struct conv *)b)->name));
364 * Convert an expression of the following forms to a uintmax_t.
365 * 1) A positive decimal number.
366 * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512).
367 * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10).
368 * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20).
369 * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30).
370 * 5) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int).
371 * 6) Two or more positive decimal numbers (with/without [BbKkMmGgWw])
372 * separated by 'x' or 'X' (also '*' for backwards compatibility),
373 * specifying the product of the indicated values.
376 get_num(const char *val)
378 uintmax_t num, mult, prevnum;
382 num = strtouq(val, &expr, 0);
383 if (errno != 0) /* Overflow or underflow. */
386 if (expr == val) /* No valid digits. */
387 errx(1, "%s: illegal numeric value", oper);
418 /* Check for overflow. */
419 if (num / mult != prevnum)
427 case '*': /* Backward compatible. */
430 mult = get_num(expr + 1);
433 if (num / mult == prevnum)
436 errx(1, "%s: %s", oper, strerror(ERANGE));
438 errx(1, "%s: illegal numeric value", oper);
444 * Convert an expression of the following forms to an off_t. This is the
445 * same as get_num(), but it uses signed numbers.
447 * The major problem here is that an off_t may not necessarily be a intmax_t.
450 get_off_t(const char *val)
452 intmax_t num, mult, prevnum;
456 num = strtoq(val, &expr, 0);
457 if (errno != 0) /* Overflow or underflow. */
460 if (expr == val) /* No valid digits. */
461 errx(1, "%s: illegal numeric value", oper);
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);