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>
54 static int c_arg(const void *, const void *);
55 static int c_conv(const void *, const void *);
56 static void f_bs(char *);
57 static void f_cbs(char *);
58 static void f_conv(char *);
59 static void f_count(char *);
60 static void f_files(char *);
61 static void f_fillchar(char *);
62 static void f_ibs(char *);
63 static void f_if(char *);
64 static void f_obs(char *);
65 static void f_of(char *);
66 static void f_seek(char *);
67 static void f_skip(char *);
68 static uintmax_t get_num(const char *);
69 static off_t get_off_t(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 },
95 * args -- parse JCL syntax of dd.
103 in.dbsz = out.dbsz = 512;
105 while ((oper = *++argv) != NULL) {
106 if ((oper = strdup(oper)) == NULL)
107 errx(1, "unable to allocate space for the argument \"%s\"", *argv);
108 if ((arg = strchr(oper, '=')) == NULL)
109 errx(1, "unknown operand %s", oper);
112 errx(1, "no value specified for %s", oper);
114 if (!(ap = (struct arg *)bsearch(&tmp, args,
115 sizeof(args)/sizeof(struct arg), sizeof(struct arg),
117 errx(1, "unknown operand %s", tmp.name);
118 if (ddflags & ap->noset)
119 errx(1, "%s: illegal argument combination or already set",
125 /* Final sanity checks. */
127 if (ddflags & C_BS) {
129 * Bs is turned off by any conversion -- we assume the user
130 * just wanted to set both the input and output block sizes
131 * and didn't want the bs semantics, so we don't warn.
133 if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE |
137 /* Bs supersedes ibs and obs. */
138 if (ddflags & C_BS && ddflags & (C_IBS | C_OBS))
139 warnx("bs supersedes ibs and obs");
143 * Ascii/ebcdic and cbs implies block/unblock.
144 * Block/unblock requires cbs and vice-versa.
146 if (ddflags & (C_BLOCK | C_UNBLOCK)) {
147 if (!(ddflags & C_CBS))
148 errx(1, "record operations require cbs");
150 errx(1, "cbs cannot be zero");
151 cfunc = ddflags & C_BLOCK ? block : unblock;
152 } else if (ddflags & C_CBS) {
153 if (ddflags & (C_ASCII | C_EBCDIC)) {
154 if (ddflags & C_ASCII) {
155 ddflags |= C_UNBLOCK;
162 errx(1, "cbs meaningless if not doing record operations");
167 * Bail out if the calculation of a file offset would overflow.
169 if (in.offset > OFF_MAX / (ssize_t)in.dbsz ||
170 out.offset > OFF_MAX / (ssize_t)out.dbsz)
171 errx(1, "seek offsets cannot be larger than %jd",
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 %jd", (intmax_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 %jd", (intmax_t)SSIZE_MAX);
210 res = (intmax_t)get_num(arg);
212 errx(1, "count cannot be negative");
214 cpy_cnt = (uintmax_t)-1;
216 cpy_cnt = (uintmax_t)res;
223 files_cnt = get_num(arg);
225 errx(1, "files must be between 1 and %jd", (uintmax_t)-1);
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 %jd",
247 (intmax_t)SSIZE_MAX);
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 %jd",
268 (intmax_t)SSIZE_MAX);
269 out.dbsz = (size_t)res;
284 out.offset = get_off_t(arg);
291 in.offset = get_off_t(arg);
294 static const struct conv {
299 { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX },
300 { "block", C_BLOCK, C_UNBLOCK, NULL },
301 { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX },
302 { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX },
303 { "lcase", C_LCASE, C_UCASE, NULL },
304 { "noerror", C_NOERROR, 0, NULL },
305 { "notrunc", C_NOTRUNC, 0, NULL },
306 { "oldascii", C_ASCII, C_EBCDIC, e2a_32V },
307 { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V },
308 { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V },
309 { "osync", C_OSYNC, C_BS, NULL },
310 { "pareven", C_PAREVEN, C_PARODD|C_PARSET|C_PARNONE, NULL},
311 { "parnone", C_PARNONE, C_PARODD|C_PARSET|C_PAREVEN, NULL},
312 { "parodd", C_PARODD, C_PAREVEN|C_PARSET|C_PARNONE, NULL},
313 { "parset", C_PARSET, C_PARODD|C_PAREVEN|C_PARNONE, NULL},
314 { "sparse", C_SPARSE, 0, NULL },
315 { "swab", C_SWAB, 0, NULL },
316 { "sync", C_SYNC, 0, NULL },
317 { "ucase", C_UCASE, C_LCASE, NULL },
318 { "unblock", C_UNBLOCK, C_BLOCK, NULL },
324 struct conv *cp, tmp;
326 while (arg != NULL) {
327 tmp.name = strsep(&arg, ",");
328 cp = bsearch(&tmp, clist, sizeof(clist) / sizeof(struct conv),
329 sizeof(struct conv), c_conv);
331 errx(1, "unknown conversion %s", tmp.name);
332 if (ddflags & cp->noset)
333 errx(1, "%s: illegal conversion combination", tmp.name);
341 c_conv(const void *a, const void *b)
344 return (strcmp(((const struct conv *)a)->name,
345 ((const struct conv *)b)->name));
349 * Convert an expression of the following forms to a uintmax_t.
350 * 1) A positive decimal number.
351 * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512).
352 * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10).
353 * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20).
354 * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30).
355 * 5) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int).
356 * 6) Two or more positive decimal numbers (with/without [BbKkMmGgWw])
357 * separated by 'x' or 'X' (also '*' for backwards compatibility),
358 * specifying the product of the indicated values.
361 get_num(const char *val)
363 uintmax_t num, mult, prevnum;
367 num = strtouq(val, &expr, 0);
368 if (errno != 0) /* Overflow or underflow. */
371 if (expr == val) /* No valid digits. */
372 errx(1, "%s: illegal numeric value", oper);
403 /* Check for overflow. */
404 if (num / mult != prevnum)
412 case '*': /* Backward compatible. */
415 mult = get_num(expr + 1);
418 if (num / mult == prevnum)
421 errx(1, "%s: %s", oper, strerror(ERANGE));
423 errx(1, "%s: illegal numeric value", oper);
429 * Convert an expression of the following forms to an off_t. This is the
430 * same as get_num(), but it uses signed numbers.
432 * The major problem here is that an off_t may not necessarily be a intmax_t.
435 get_off_t(const char *val)
437 intmax_t num, mult, prevnum;
441 num = strtoq(val, &expr, 0);
442 if (errno != 0) /* Overflow or underflow. */
445 if (expr == val) /* No valid digits. */
446 errx(1, "%s: illegal numeric value", oper);
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);