Deleted Added
full compact
args.c (295260) args.c (295261)
1/*-
2 * Copyright (c) 1991, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
4 *
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.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
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.
20 *
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
31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
35#if 0
36static char sccsid[] = "@(#)args.c 8.3 (Berkeley) 4/2/94";
37#endif
38#endif /* not lint */
39#include <sys/cdefs.h>
1/*-
2 * Copyright (c) 1991, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
4 *
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.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
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.
20 *
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
31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
35#if 0
36static char sccsid[] = "@(#)args.c 8.3 (Berkeley) 4/2/94";
37#endif
38#endif /* not lint */
39#include <sys/cdefs.h>
40__FBSDID("$FreeBSD: head/bin/dd/args.c 295260 2016-02-04 15:10:08Z trasz $");
40__FBSDID("$FreeBSD: head/bin/dd/args.c 295261 2016-02-04 15:21:01Z trasz $");
41
42#include <sys/types.h>
43
44#include <err.h>
45#include <errno.h>
46#include <inttypes.h>
47#include <limits.h>
48#include <signal.h>
49#include <stdlib.h>
50#include <string.h>
51
52#include "dd.h"
53#include "extern.h"
54
55static int c_arg(const void *, const void *);
56static int c_conv(const void *, const void *);
57static void f_bs(char *);
58static void f_cbs(char *);
59static void f_conv(char *);
60static void f_count(char *);
61static void f_files(char *);
62static void f_fillchar(char *);
63static void f_ibs(char *);
64static void f_if(char *);
65static void f_obs(char *);
66static void f_of(char *);
67static void f_seek(char *);
68static void f_skip(char *);
69static void f_status(char *);
70static uintmax_t get_num(const char *);
71static off_t get_off_t(const char *);
72
73static const struct arg {
74 const char *name;
75 void (*f)(char *);
76 u_int set, noset;
77} args[] = {
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 },
93};
94
95static char *oper;
96
97/*
98 * args -- parse JCL syntax of dd.
99 */
100void
101jcl(char **argv)
102{
103 struct arg *ap, tmp;
104 char *arg;
105
106 in.dbsz = out.dbsz = 512;
107
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);
113 *arg++ = '\0';
114 if (!*arg)
115 errx(1, "no value specified for %s", oper);
116 tmp.name = oper;
117 if (!(ap = (struct arg *)bsearch(&tmp, args,
118 sizeof(args)/sizeof(struct arg), sizeof(struct arg),
119 c_arg)))
120 errx(1, "unknown operand %s", tmp.name);
121 if (ddflags & ap->noset)
122 errx(1, "%s: illegal argument combination or already set",
123 tmp.name);
124 ddflags |= ap->set;
125 ap->f(arg);
126 }
127
128 /* Final sanity checks. */
129
130 if (ddflags & C_BS) {
131 /*
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.
135 */
136 if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE |
137 C_UNBLOCK))
138 ddflags &= ~C_BS;
139
140 /* Bs supersedes ibs and obs. */
141 if (ddflags & C_BS && ddflags & (C_IBS | C_OBS))
142 warnx("bs supersedes ibs and obs");
143 }
144
145 /*
146 * Ascii/ebcdic and cbs implies block/unblock.
147 * Block/unblock requires cbs and vice-versa.
148 */
149 if (ddflags & (C_BLOCK | C_UNBLOCK)) {
150 if (!(ddflags & C_CBS))
151 errx(1, "record operations require cbs");
152 if (cbsz == 0)
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;
159 cfunc = unblock;
160 } else {
161 ddflags |= C_BLOCK;
162 cfunc = block;
163 }
164 } else
165 errx(1, "cbs meaningless if not doing record operations");
166 } else
167 cfunc = def;
168
169 /*
170 * Bail out if the calculation of a file offset would overflow.
171 */
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",
175 (intmax_t)OFF_MAX);
176}
177
178static int
179c_arg(const void *a, const void *b)
180{
181
182 return (strcmp(((const struct arg *)a)->name,
183 ((const struct arg *)b)->name));
184}
185
186static void
187f_bs(char *arg)
188{
189 uintmax_t res;
190
191 res = get_num(arg);
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;
195}
196
197static void
198f_cbs(char *arg)
199{
200 uintmax_t res;
201
202 res = get_num(arg);
203 if (res < 1 || res > SSIZE_MAX)
204 errx(1, "cbs must be between 1 and %jd", (intmax_t)SSIZE_MAX);
205 cbsz = (size_t)res;
206}
207
208static void
209f_count(char *arg)
210{
211 intmax_t res;
212
213 res = (intmax_t)get_num(arg);
214 if (res < 0)
215 errx(1, "count cannot be negative");
216 if (res == 0)
217 cpy_cnt = (uintmax_t)-1;
218 else
219 cpy_cnt = (uintmax_t)res;
220}
221
222static void
223f_files(char *arg)
224{
225
226 files_cnt = get_num(arg);
227 if (files_cnt < 1)
228 errx(1, "files must be between 1 and %jd", (uintmax_t)-1);
229}
230
231static void
232f_fillchar(char *arg)
233{
234
235 if (strlen(arg) != 1)
236 errx(1, "need exactly one fill char");
237
238 fill_char = arg[0];
239}
240
241static void
242f_ibs(char *arg)
243{
244 uintmax_t res;
245
246 if (!(ddflags & C_BS)) {
247 res = get_num(arg);
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;
252 }
253}
254
255static void
256f_if(char *arg)
257{
258
259 in.name = arg;
260}
261
262static void
263f_obs(char *arg)
264{
265 uintmax_t res;
266
267 if (!(ddflags & C_BS)) {
268 res = get_num(arg);
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;
273 }
274}
275
276static void
277f_of(char *arg)
278{
279
280 out.name = arg;
281}
282
283static void
284f_seek(char *arg)
285{
286
287 out.offset = get_off_t(arg);
288}
289
290static void
291f_skip(char *arg)
292{
293
294 in.offset = get_off_t(arg);
295}
296
297static void
298f_status(char *arg)
299{
300
301 if (strcmp(arg, "none") == 0)
302 ddflags |= C_NOINFO;
303 else if (strcmp(arg, "noxfer") == 0)
304 ddflags |= C_NOXFER;
305 else
306 errx(1, "unknown status %s", arg);
307}
308
309static const struct conv {
310 const char *name;
311 u_int set, noset;
312 const u_char *ctab;
313} clist[] = {
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 },
334};
335
336static void
337f_conv(char *arg)
338{
339 struct conv *cp, tmp;
340
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);
345 if (cp == NULL)
346 errx(1, "unknown conversion %s", tmp.name);
347 if (ddflags & cp->noset)
348 errx(1, "%s: illegal conversion combination", tmp.name);
349 ddflags |= cp->set;
350 if (cp->ctab)
351 ctab = cp->ctab;
352 }
353}
354
355static int
356c_conv(const void *a, const void *b)
357{
358
359 return (strcmp(((const struct conv *)a)->name,
360 ((const struct conv *)b)->name));
361}
362
363static uintmax_t
364postfix_to_mult(const char expr)
365{
366 uintmax_t mult;
367
368 mult = 0;
369 switch (expr) {
370 case 'B':
371 case 'b':
372 mult = 512;
373 break;
374 case 'K':
375 case 'k':
376 mult = 1 << 10;
377 break;
378 case 'M':
379 case 'm':
380 mult = 1 << 20;
381 break;
382 case 'G':
383 case 'g':
384 mult = 1 << 30;
385 break;
41
42#include <sys/types.h>
43
44#include <err.h>
45#include <errno.h>
46#include <inttypes.h>
47#include <limits.h>
48#include <signal.h>
49#include <stdlib.h>
50#include <string.h>
51
52#include "dd.h"
53#include "extern.h"
54
55static int c_arg(const void *, const void *);
56static int c_conv(const void *, const void *);
57static void f_bs(char *);
58static void f_cbs(char *);
59static void f_conv(char *);
60static void f_count(char *);
61static void f_files(char *);
62static void f_fillchar(char *);
63static void f_ibs(char *);
64static void f_if(char *);
65static void f_obs(char *);
66static void f_of(char *);
67static void f_seek(char *);
68static void f_skip(char *);
69static void f_status(char *);
70static uintmax_t get_num(const char *);
71static off_t get_off_t(const char *);
72
73static const struct arg {
74 const char *name;
75 void (*f)(char *);
76 u_int set, noset;
77} args[] = {
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 },
93};
94
95static char *oper;
96
97/*
98 * args -- parse JCL syntax of dd.
99 */
100void
101jcl(char **argv)
102{
103 struct arg *ap, tmp;
104 char *arg;
105
106 in.dbsz = out.dbsz = 512;
107
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);
113 *arg++ = '\0';
114 if (!*arg)
115 errx(1, "no value specified for %s", oper);
116 tmp.name = oper;
117 if (!(ap = (struct arg *)bsearch(&tmp, args,
118 sizeof(args)/sizeof(struct arg), sizeof(struct arg),
119 c_arg)))
120 errx(1, "unknown operand %s", tmp.name);
121 if (ddflags & ap->noset)
122 errx(1, "%s: illegal argument combination or already set",
123 tmp.name);
124 ddflags |= ap->set;
125 ap->f(arg);
126 }
127
128 /* Final sanity checks. */
129
130 if (ddflags & C_BS) {
131 /*
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.
135 */
136 if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE |
137 C_UNBLOCK))
138 ddflags &= ~C_BS;
139
140 /* Bs supersedes ibs and obs. */
141 if (ddflags & C_BS && ddflags & (C_IBS | C_OBS))
142 warnx("bs supersedes ibs and obs");
143 }
144
145 /*
146 * Ascii/ebcdic and cbs implies block/unblock.
147 * Block/unblock requires cbs and vice-versa.
148 */
149 if (ddflags & (C_BLOCK | C_UNBLOCK)) {
150 if (!(ddflags & C_CBS))
151 errx(1, "record operations require cbs");
152 if (cbsz == 0)
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;
159 cfunc = unblock;
160 } else {
161 ddflags |= C_BLOCK;
162 cfunc = block;
163 }
164 } else
165 errx(1, "cbs meaningless if not doing record operations");
166 } else
167 cfunc = def;
168
169 /*
170 * Bail out if the calculation of a file offset would overflow.
171 */
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",
175 (intmax_t)OFF_MAX);
176}
177
178static int
179c_arg(const void *a, const void *b)
180{
181
182 return (strcmp(((const struct arg *)a)->name,
183 ((const struct arg *)b)->name));
184}
185
186static void
187f_bs(char *arg)
188{
189 uintmax_t res;
190
191 res = get_num(arg);
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;
195}
196
197static void
198f_cbs(char *arg)
199{
200 uintmax_t res;
201
202 res = get_num(arg);
203 if (res < 1 || res > SSIZE_MAX)
204 errx(1, "cbs must be between 1 and %jd", (intmax_t)SSIZE_MAX);
205 cbsz = (size_t)res;
206}
207
208static void
209f_count(char *arg)
210{
211 intmax_t res;
212
213 res = (intmax_t)get_num(arg);
214 if (res < 0)
215 errx(1, "count cannot be negative");
216 if (res == 0)
217 cpy_cnt = (uintmax_t)-1;
218 else
219 cpy_cnt = (uintmax_t)res;
220}
221
222static void
223f_files(char *arg)
224{
225
226 files_cnt = get_num(arg);
227 if (files_cnt < 1)
228 errx(1, "files must be between 1 and %jd", (uintmax_t)-1);
229}
230
231static void
232f_fillchar(char *arg)
233{
234
235 if (strlen(arg) != 1)
236 errx(1, "need exactly one fill char");
237
238 fill_char = arg[0];
239}
240
241static void
242f_ibs(char *arg)
243{
244 uintmax_t res;
245
246 if (!(ddflags & C_BS)) {
247 res = get_num(arg);
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;
252 }
253}
254
255static void
256f_if(char *arg)
257{
258
259 in.name = arg;
260}
261
262static void
263f_obs(char *arg)
264{
265 uintmax_t res;
266
267 if (!(ddflags & C_BS)) {
268 res = get_num(arg);
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;
273 }
274}
275
276static void
277f_of(char *arg)
278{
279
280 out.name = arg;
281}
282
283static void
284f_seek(char *arg)
285{
286
287 out.offset = get_off_t(arg);
288}
289
290static void
291f_skip(char *arg)
292{
293
294 in.offset = get_off_t(arg);
295}
296
297static void
298f_status(char *arg)
299{
300
301 if (strcmp(arg, "none") == 0)
302 ddflags |= C_NOINFO;
303 else if (strcmp(arg, "noxfer") == 0)
304 ddflags |= C_NOXFER;
305 else
306 errx(1, "unknown status %s", arg);
307}
308
309static const struct conv {
310 const char *name;
311 u_int set, noset;
312 const u_char *ctab;
313} clist[] = {
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 },
334};
335
336static void
337f_conv(char *arg)
338{
339 struct conv *cp, tmp;
340
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);
345 if (cp == NULL)
346 errx(1, "unknown conversion %s", tmp.name);
347 if (ddflags & cp->noset)
348 errx(1, "%s: illegal conversion combination", tmp.name);
349 ddflags |= cp->set;
350 if (cp->ctab)
351 ctab = cp->ctab;
352 }
353}
354
355static int
356c_conv(const void *a, const void *b)
357{
358
359 return (strcmp(((const struct conv *)a)->name,
360 ((const struct conv *)b)->name));
361}
362
363static uintmax_t
364postfix_to_mult(const char expr)
365{
366 uintmax_t mult;
367
368 mult = 0;
369 switch (expr) {
370 case 'B':
371 case 'b':
372 mult = 512;
373 break;
374 case 'K':
375 case 'k':
376 mult = 1 << 10;
377 break;
378 case 'M':
379 case 'm':
380 mult = 1 << 20;
381 break;
382 case 'G':
383 case 'g':
384 mult = 1 << 30;
385 break;
386 case 'T':
387 case 't':
388 mult = (uintmax_t)1 << 40;
389 break;
390 case 'P':
391 case 'p':
392 mult = (uintmax_t)1 << 50;
393 break;
386 case 'W':
387 case 'w':
388 mult = sizeof(int);
389 break;
390 }
391
392 return (mult);
393}
394
395/*
396 * Convert an expression of the following forms to a uintmax_t.
397 * 1) A positive decimal number.
398 * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512).
399 * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10).
400 * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20).
401 * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30).
402 * 5) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int).
403 * 6) 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.
406 */
407static uintmax_t
408get_num(const char *val)
409{
410 uintmax_t num, mult, prevnum;
411 char *expr;
412
413 errno = 0;
414 num = strtouq(val, &expr, 0);
415 if (errno != 0) /* Overflow or underflow. */
416 err(1, "%s", oper);
417
418 if (expr == val) /* No valid digits. */
419 errx(1, "%s: illegal numeric value", oper);
420
421 mult = postfix_to_mult(*expr);
422
423 if (mult != 0) {
424 prevnum = num;
425 num *= mult;
426 /* Check for overflow. */
427 if (num / mult != prevnum)
428 goto erange;
429 expr++;
430 }
431
432 switch (*expr) {
433 case '\0':
434 break;
435 case '*': /* Backward compatible. */
436 case 'X':
437 case 'x':
438 mult = get_num(expr + 1);
439 prevnum = num;
440 num *= mult;
441 if (num / mult == prevnum)
442 break;
443erange:
444 errx(1, "%s: %s", oper, strerror(ERANGE));
445 default:
446 errx(1, "%s: illegal numeric value", oper);
447 }
448 return (num);
449}
450
451/*
452 * Convert an expression of the following forms to an off_t. This is the
453 * same as get_num(), but it uses signed numbers.
454 *
455 * The major problem here is that an off_t may not necessarily be a intmax_t.
456 */
457static off_t
458get_off_t(const char *val)
459{
460 intmax_t num, mult, prevnum;
461 char *expr;
462
463 errno = 0;
464 num = strtoq(val, &expr, 0);
465 if (errno != 0) /* Overflow or underflow. */
466 err(1, "%s", oper);
467
468 if (expr == val) /* No valid digits. */
469 errx(1, "%s: illegal numeric value", oper);
470
471 mult = postfix_to_mult(*expr);
472
473 if (mult != 0) {
474 prevnum = num;
475 num *= mult;
476 /* Check for overflow. */
477 if ((prevnum > 0) != (num > 0) || num / mult != prevnum)
478 goto erange;
479 expr++;
480 }
481
482 switch (*expr) {
483 case '\0':
484 break;
485 case '*': /* Backward compatible. */
486 case 'X':
487 case 'x':
488 mult = (intmax_t)get_off_t(expr + 1);
489 prevnum = num;
490 num *= mult;
491 if ((prevnum > 0) == (num > 0) && num / mult == prevnum)
492 break;
493erange:
494 errx(1, "%s: %s", oper, strerror(ERANGE));
495 default:
496 errx(1, "%s: illegal numeric value", oper);
497 }
498 return (num);
499}
394 case 'W':
395 case 'w':
396 mult = sizeof(int);
397 break;
398 }
399
400 return (mult);
401}
402
403/*
404 * Convert an expression of the following forms to a uintmax_t.
405 * 1) A positive decimal number.
406 * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512).
407 * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10).
408 * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20).
409 * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30).
410 * 5) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int).
411 * 6) Two or more positive decimal numbers (with/without [BbKkMmGgWw])
412 * separated by 'x' or 'X' (also '*' for backwards compatibility),
413 * specifying the product of the indicated values.
414 */
415static uintmax_t
416get_num(const char *val)
417{
418 uintmax_t num, mult, prevnum;
419 char *expr;
420
421 errno = 0;
422 num = strtouq(val, &expr, 0);
423 if (errno != 0) /* Overflow or underflow. */
424 err(1, "%s", oper);
425
426 if (expr == val) /* No valid digits. */
427 errx(1, "%s: illegal numeric value", oper);
428
429 mult = postfix_to_mult(*expr);
430
431 if (mult != 0) {
432 prevnum = num;
433 num *= mult;
434 /* Check for overflow. */
435 if (num / mult != prevnum)
436 goto erange;
437 expr++;
438 }
439
440 switch (*expr) {
441 case '\0':
442 break;
443 case '*': /* Backward compatible. */
444 case 'X':
445 case 'x':
446 mult = get_num(expr + 1);
447 prevnum = num;
448 num *= mult;
449 if (num / mult == prevnum)
450 break;
451erange:
452 errx(1, "%s: %s", oper, strerror(ERANGE));
453 default:
454 errx(1, "%s: illegal numeric value", oper);
455 }
456 return (num);
457}
458
459/*
460 * Convert an expression of the following forms to an off_t. This is the
461 * same as get_num(), but it uses signed numbers.
462 *
463 * The major problem here is that an off_t may not necessarily be a intmax_t.
464 */
465static off_t
466get_off_t(const char *val)
467{
468 intmax_t num, mult, prevnum;
469 char *expr;
470
471 errno = 0;
472 num = strtoq(val, &expr, 0);
473 if (errno != 0) /* Overflow or underflow. */
474 err(1, "%s", oper);
475
476 if (expr == val) /* No valid digits. */
477 errx(1, "%s: illegal numeric value", oper);
478
479 mult = postfix_to_mult(*expr);
480
481 if (mult != 0) {
482 prevnum = num;
483 num *= mult;
484 /* Check for overflow. */
485 if ((prevnum > 0) != (num > 0) || num / mult != prevnum)
486 goto erange;
487 expr++;
488 }
489
490 switch (*expr) {
491 case '\0':
492 break;
493 case '*': /* Backward compatible. */
494 case 'X':
495 case 'x':
496 mult = (intmax_t)get_off_t(expr + 1);
497 prevnum = num;
498 num *= mult;
499 if ((prevnum > 0) == (num > 0) && num / mult == prevnum)
500 break;
501erange:
502 errx(1, "%s: %s", oper, strerror(ERANGE));
503 default:
504 errx(1, "%s: illegal numeric value", oper);
505 }
506 return (num);
507}