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 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 static char sccsid[] = "@(#)args.c 8.3 (Berkeley) 4/2/94";
42 static const char rcsid[] =
43 "$Id: args.c,v 1.12 1998/05/06 06:51:29 charnier Exp $";
46 #include <sys/types.h>
57 static int c_arg __P((const void *, const void *));
58 static int c_conv __P((const void *, const void *));
59 static void f_bs __P((char *));
60 static void f_cbs __P((char *));
61 static void f_conv __P((char *));
62 static void f_count __P((char *));
63 static void f_files __P((char *));
64 static void f_ibs __P((char *));
65 static void f_if __P((char *));
66 static void f_obs __P((char *));
67 static void f_of __P((char *));
68 static void f_seek __P((char *));
69 static void f_skip __P((char *));
70 static u_long get_bsz __P((char *));
74 void (*f) __P((char *));
77 { "bs", f_bs, C_BS, C_BS|C_IBS|C_OBS|C_OSYNC },
78 { "cbs", f_cbs, C_CBS, C_CBS },
79 { "conv", f_conv, 0, 0 },
80 { "count", f_count, C_COUNT, C_COUNT },
81 { "files", f_files, C_FILES, C_FILES },
82 { "ibs", f_ibs, C_IBS, C_BS|C_IBS },
83 { "if", f_if, C_IF, C_IF },
84 { "obs", f_obs, C_OBS, C_BS|C_OBS },
85 { "of", f_of, C_OF, C_OF },
86 { "seek", f_seek, C_SEEK, C_SEEK },
87 { "skip", f_skip, C_SKIP, C_SKIP },
93 * args -- parse JCL syntax of dd.
102 in.dbsz = out.dbsz = 512;
104 while ((oper = *++argv) != NULL) {
105 if ((oper = strdup(oper)) == NULL)
106 errx(1, "unable to allocate space for the argument \"%s\"", *argv);
107 if ((arg = strchr(oper, '=')) == NULL)
108 errx(1, "unknown operand %s", oper);
111 errx(1, "no value specified for %s", oper);
113 if (!(ap = (struct arg *)bsearch(&tmp, args,
114 sizeof(args)/sizeof(struct arg), sizeof(struct arg),
116 errx(1, "unknown operand %s", tmp.name);
117 if (ddflags & ap->noset)
118 errx(1, "%s: illegal argument combination or already set",
124 /* Final sanity checks. */
126 if (ddflags & C_BS) {
128 * Bs is turned off by any conversion -- we assume the user
129 * just wanted to set both the input and output block sizes
130 * and didn't want the bs semantics, so we don't warn.
132 if (ddflags & (C_BLOCK|C_LCASE|C_SWAB|C_UCASE|C_UNBLOCK))
135 /* Bs supersedes ibs and obs. */
136 if (ddflags & C_BS && ddflags & (C_IBS|C_OBS))
137 warnx("bs supersedes ibs and obs");
141 * Ascii/ebcdic and cbs implies block/unblock.
142 * Block/unblock requires cbs and vice-versa.
144 if (ddflags & (C_BLOCK|C_UNBLOCK)) {
145 if (!(ddflags & C_CBS))
146 errx(1, "record operations require cbs");
148 errx(1, "cbs cannot be zero");
149 cfunc = ddflags & C_BLOCK ? block : unblock;
150 } else if (ddflags & C_CBS) {
151 if (ddflags & (C_ASCII|C_EBCDIC)) {
152 if (ddflags & C_ASCII) {
153 ddflags |= C_UNBLOCK;
160 errx(1, "cbs meaningless if not doing record operations");
162 errx(1, "cbs cannot be zero");
166 if (in.dbsz == 0 || out.dbsz == 0)
167 errx(1, "buffer sizes cannot be zero");
170 * Read, write and seek calls take ints as arguments. Seek sizes
171 * could be larger if we wanted to do it in stages or check only
172 * regular files, but it's probably not worth it.
174 if (in.dbsz > INT_MAX || out.dbsz > INT_MAX)
175 errx(1, "buffer sizes cannot be greater than %d", INT_MAX);
176 if (in.offset > INT_MAX / in.dbsz || out.offset > INT_MAX / out.dbsz)
177 errx(1, "seek offsets cannot be larger than %d", INT_MAX);
185 return (strcmp(((struct arg *)a)->name, ((struct arg *)b)->name));
193 in.dbsz = out.dbsz = (int)get_bsz(arg);
201 cbsz = (int)get_bsz(arg);
209 cpy_cnt = (u_int)get_bsz(arg);
219 files_cnt = (int)get_bsz(arg);
227 if (!(ddflags & C_BS))
228 in.dbsz = (int)get_bsz(arg);
244 if (!(ddflags & C_BS))
245 out.dbsz = (int)get_bsz(arg);
261 out.offset = (u_int)get_bsz(arg);
269 in.offset = (u_int)get_bsz(arg);
277 { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX },
278 { "block", C_BLOCK, C_UNBLOCK, NULL },
279 { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX },
280 { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX },
281 { "lcase", C_LCASE, C_UCASE, NULL },
282 { "noerror", C_NOERROR, 0, NULL },
283 { "notrunc", C_NOTRUNC, 0, NULL },
284 { "oldascii", C_ASCII, C_EBCDIC, e2a_32V },
285 { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V },
286 { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V },
287 { "osync", C_OSYNC, C_BS, NULL },
288 { "sparse", C_SPARSE, 0, NULL },
289 { "swab", C_SWAB, 0, NULL },
290 { "sync", C_SYNC, 0, NULL },
291 { "ucase", C_UCASE, C_LCASE, NULL },
292 { "unblock", C_UNBLOCK, C_BLOCK, NULL },
299 struct conv *cp, tmp;
301 while (arg != NULL) {
302 tmp.name = strsep(&arg, ",");
303 if (!(cp = (struct conv *)bsearch(&tmp, clist,
304 sizeof(clist)/sizeof(struct conv), sizeof(struct conv),
306 errx(1, "unknown conversion %s", tmp.name);
307 if (ddflags & cp->noset)
308 errx(1, "%s: illegal conversion combination", tmp.name);
320 return (strcmp(((struct conv *)a)->name, ((struct conv *)b)->name));
324 * Convert an expression of the following forms to an unsigned long.
325 * 1) A positive decimal number.
326 * 2) A positive decimal number followed by a b (mult by 512).
327 * 3) A positive decimal number followed by a k (mult by 1024).
328 * 4) A positive decimal number followed by a m (mult by 512).
329 * 5) A positive decimal number followed by a w (mult by sizeof int)
330 * 6) Two or more positive decimal numbers (with/without k,b or w).
331 * seperated by x (also * for backwards compatibility), specifying
332 * the product of the indicated values.
341 num = strtoul(val, &expr, 0);
342 if (num == ULONG_MAX) /* Overflow. */
344 if (expr == val) /* No digits. */
345 errx(1, "%s: illegal numeric value", oper);
381 case '*': /* Backward compatible. */
384 num *= get_bsz(expr + 1);
386 erange: errx(1, "%s: %s", oper, strerror(ERANGE));
389 errx(1, "%s: illegal numeric value", oper);