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 * 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. 24 * 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 35 * SUCH DAMAGE. 36 */ 37 38 #ifndef lint 39 #if 0 40 static char sccsid[] = "@(#)args.c 8.3 (Berkeley) 4/2/94"; 41 #endif 42 static const char rcsid[] = 43 "$FreeBSD$"; 44 #endif /* not lint */ 45 46 #include <sys/types.h> 47 48 #include <err.h> 49 #include <errno.h> 50 #include <limits.h> 51 #include <stdlib.h> 52 #include <string.h> 53 54 #include "dd.h" 55 #include "extern.h" 56 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 quad_t get_num __P((char *)); 71 static off_t get_offset __P((char *)); 72 73 static const struct arg { 74 char *name; 75 void (*f) __P((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 { "ibs", f_ibs, C_IBS, C_BS|C_IBS }, 84 { "if", f_if, C_IF, C_IF }, 85 { "obs", f_obs, C_OBS, C_BS|C_OBS }, 86 { "of", f_of, C_OF, C_OF }, 87 { "seek", f_seek, C_SEEK, C_SEEK }, 88 { "skip", f_skip, C_SKIP, C_SKIP }, 89 }; 90 91 static char *oper; 92 93 /* 94 * args -- parse JCL syntax of dd. 95 */ 96 void 97 jcl(argv) 98 char **argv; 99 { 100 struct arg *ap, tmp; 101 char *arg; 102 103 in.dbsz = out.dbsz = 512; 104 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); 110 *arg++ = '\0'; 111 if (!*arg) 112 errx(1, "no value specified for %s", oper); 113 tmp.name = oper; 114 if (!(ap = (struct arg *)bsearch(&tmp, args, 115 sizeof(args)/sizeof(struct arg), sizeof(struct arg), 116 c_arg))) 117 errx(1, "unknown operand %s", tmp.name); 118 if (ddflags & ap->noset) 119 errx(1, "%s: illegal argument combination or already set", 120 tmp.name); 121 ddflags |= ap->set; 122 ap->f(arg); 123 } 124 125 /* Final sanity checks. */ 126 127 if (ddflags & C_BS) { 128 /* 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. 132 */ 133 if (ddflags & (C_BLOCK|C_LCASE|C_SWAB|C_UCASE|C_UNBLOCK)) 134 ddflags &= ~C_BS; 135 136 /* Bs supersedes ibs and obs. */ 137 if (ddflags & C_BS && ddflags & (C_IBS|C_OBS)) 138 warnx("bs supersedes ibs and obs"); 139 } 140 141 /* 142 * Ascii/ebcdic and cbs implies block/unblock. 143 * Block/unblock requires cbs and vice-versa. 144 */ 145 if (ddflags & (C_BLOCK | C_UNBLOCK)) { 146 if (!(ddflags & C_CBS)) 147 errx(1, "record operations require cbs"); 148 if (cbsz == 0) 149 errx(1, "cbs cannot be zero"); 150 cfunc = ddflags & C_BLOCK ? block : unblock; 151 } else if (ddflags & C_CBS) { 152 if (ddflags & (C_ASCII | C_EBCDIC)) { 153 if (ddflags & C_ASCII) { 154 ddflags |= C_UNBLOCK; 155 cfunc = unblock; 156 } else { 157 ddflags |= C_BLOCK; 158 cfunc = block; 159 } 160 } else 161 errx(1, "cbs meaningless if not doing record operations"); 162 } else 163 cfunc = def; 164 165 /* 166 * Bail out if the calculation of a file offset would overflow. 167 */ 168 if (in.offset > QUAD_MAX / in.dbsz || out.offset > QUAD_MAX / out.dbsz) 169 errx(1, "seek offsets cannot be larger than %qd", QUAD_MAX); 170 } 171 172 static int 173 c_arg(a, b) 174 const void *a, *b; 175 { 176 177 return (strcmp(((struct arg *)a)->name, ((struct arg *)b)->name)); 178 } 179 180 static void 181 f_bs(arg) 182 char *arg; 183 { 184 quad_t res; 185 186 res = get_num(arg); 187 if (res < 1 || res > SSIZE_MAX) 188 errx(1, "bs must be between 1 and %d", SSIZE_MAX); 189 in.dbsz = out.dbsz = (size_t)res; 190 } 191 192 static void 193 f_cbs(arg) 194 char *arg; 195 { 196 quad_t res; 197 198 res = get_num(arg); 199 if (res < 1 || res > SSIZE_MAX) 200 errx(1, "cbs must be between 1 and %d", SSIZE_MAX); 201 cbsz = (size_t)res; 202 } 203 204 static void 205 f_count(arg) 206 char *arg; 207 { 208 209 cpy_cnt = get_num(arg); 210 if (cpy_cnt < 0) 211 errx(1, "count cannot be negative"); 212 if (cpy_cnt == 0) 213 cpy_cnt = -1; 214 } 215 216 static void 217 f_files(arg) 218 char *arg; 219 { 220 221 files_cnt = get_num(arg); 222 if (files_cnt < 1) 223 errx(1, "files must be between 1 and %qd", QUAD_MAX); 224 } 225 226 static void 227 f_ibs(arg) 228 char *arg; 229 { 230 quad_t res; 231 232 if (!(ddflags & C_BS)) { 233 res = get_num(arg); 234 if (res < 1 || res > SSIZE_MAX) 235 errx(1, "ibs must be between 1 and %d", SSIZE_MAX); 236 in.dbsz = (size_t)res; 237 } 238 } 239 240 static void 241 f_if(arg) 242 char *arg; 243 { 244 245 in.name = arg; 246 } 247 248 static void 249 f_obs(arg) 250 char *arg; 251 { 252 quad_t res; 253 254 if (!(ddflags & C_BS)) { 255 res = get_num(arg); 256 if (res < 1 || res > SSIZE_MAX) 257 errx(1, "obs must be between 1 and %d", SSIZE_MAX); 258 out.dbsz = (size_t)res; 259 } 260 } 261 262 static void 263 f_of(arg) 264 char *arg; 265 { 266 267 out.name = arg; 268 } 269 270 static void 271 f_seek(arg) 272 char *arg; 273 { 274 275 out.offset = get_offset(arg); 276 } 277 278 static void 279 f_skip(arg) 280 char *arg; 281 { 282 283 in.offset = get_offset(arg); 284 } 285 286 static const struct conv { 287 char *name; 288 u_int set, noset; 289 const u_char *ctab; 290 } clist[] = { 291 { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX }, 292 { "block", C_BLOCK, C_UNBLOCK, NULL }, 293 { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX }, 294 { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX }, 295 { "lcase", C_LCASE, C_UCASE, NULL }, 296 { "noerror", C_NOERROR, 0, NULL }, 297 { "notrunc", C_NOTRUNC, 0, NULL }, 298 { "oldascii", C_ASCII, C_EBCDIC, e2a_32V }, 299 { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V }, 300 { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V }, 301 { "osync", C_OSYNC, C_BS, NULL }, 302 { "sparse", C_SPARSE, 0, NULL }, 303 { "swab", C_SWAB, 0, NULL }, 304 { "sync", C_SYNC, 0, NULL }, 305 { "ucase", C_UCASE, C_LCASE, NULL }, 306 { "unblock", C_UNBLOCK, C_BLOCK, NULL }, 307 }; 308 309 static void 310 f_conv(arg) 311 char *arg; 312 { 313 struct conv *cp, tmp; 314 315 while (arg != NULL) { 316 tmp.name = strsep(&arg, ","); 317 cp = bsearch(&tmp, clist, sizeof(clist) / sizeof(struct conv), 318 sizeof(struct conv), c_conv); 319 if (cp == NULL) 320 errx(1, "unknown conversion %s", tmp.name); 321 if (ddflags & cp->noset) 322 errx(1, "%s: illegal conversion combination", tmp.name); 323 ddflags |= cp->set; 324 if (cp->ctab) 325 ctab = cp->ctab; 326 } 327 } 328 329 static int 330 c_conv(a, b) 331 const void *a, *b; 332 { 333 334 return (strcmp(((struct conv *)a)->name, ((struct conv *)b)->name)); 335 } 336 337 /* 338 * Convert an expression of the following forms to a quad_t. 339 * 1) A positive decimal number. 340 * 2) A positive decimal number followed by a b (mult by 512.) 341 * 3) A positive decimal number followed by a k (mult by 1 << 10.) 342 * 4) A positive decimal number followed by a m (mult by 1 << 20.) 343 * 5) A positive decimal number followed by a g (mult by 1 << 30.) 344 * 5) A positive decimal number followed by a w (mult by sizeof int.) 345 * 6) Two or more positive decimal numbers (with/without [bkmgw]) 346 * separated by x (also * for backwards compatibility), specifying 347 * the product of the indicated values. 348 */ 349 static quad_t 350 get_num(val) 351 char *val; 352 { 353 quad_t num, t; 354 char *expr; 355 356 errno = 0; 357 num = strtoq(val, &expr, 0); 358 if (errno != 0) /* Overflow or underflow. */ 359 err(1, "%s", oper); 360 361 if (expr == val) /* No valid digits. */ 362 errx(1, "%s: illegal numeric value", oper); 363 364 switch (*expr) { 365 case 'b': 366 t = num; 367 num *= 512; 368 if (t > num) 369 goto erange; 370 ++expr; 371 break; 372 case 'k': 373 t = num; 374 num *= 1 << 10; 375 if (t > num) 376 goto erange; 377 ++expr; 378 break; 379 case 'm': 380 t = num; 381 num *= 1 << 20; 382 if (t > num) 383 goto erange; 384 ++expr; 385 break; 386 case 'g': 387 t = num; 388 num *= 1 << 30; 389 if (t > num) 390 goto erange; 391 ++expr; 392 break; 393 case 'w': 394 t = num; 395 num *= sizeof(int); 396 if (t > num) 397 goto erange; 398 ++expr; 399 break; 400 } 401 402 switch (*expr) { 403 case '\0': 404 break; 405 case '*': /* Backward compatible. */ 406 case 'x': 407 t = num; 408 num *= get_num(expr + 1); 409 if (t <= num) 410 break; 411 erange: 412 errx(1, "%s: %s", oper, strerror(ERANGE)); 413 default: 414 errx(1, "%s: illegal numeric value", oper); 415 } 416 return (num); 417 } 418 419 static off_t 420 get_offset(val) 421 char *val; 422 { 423 quad_t num; 424 425 num = get_num(val); 426 if (num > QUAD_MAX || num < 0) /* XXX quad_t != off_t */ 427 errx(1, "%s: illegal offset", oper); /* Too big/negative. */ 428 return ((off_t)num); 429 } 430