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 36 static char sccsid[] = "@(#)args.c 8.3 (Berkeley) 4/2/94"; 37 #endif 38 #endif /* not lint */ 39 #include <sys/cdefs.h> 40 __FBSDID("$FreeBSD$"); 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 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_speed(char *); 70 static void f_status(char *); 71 static uintmax_t get_num(const char *); 72 static off_t get_off_t(const char *); 73 74 static const struct arg { 75 const char *name; 76 void (*f)(char *); 77 u_int set, noset; 78 } args[] = { 79 { "bs", f_bs, C_BS, C_BS|C_IBS|C_OBS|C_OSYNC }, 80 { "cbs", f_cbs, C_CBS, C_CBS }, 81 { "conv", f_conv, 0, 0 }, 82 { "count", f_count, C_COUNT, C_COUNT }, 83 { "files", f_files, C_FILES, C_FILES }, 84 { "fillchar", f_fillchar, C_FILL, C_FILL }, 85 { "ibs", f_ibs, C_IBS, C_BS|C_IBS }, 86 { "if", f_if, C_IF, C_IF }, 87 { "iseek", f_skip, C_SKIP, C_SKIP }, 88 { "obs", f_obs, C_OBS, C_BS|C_OBS }, 89 { "of", f_of, C_OF, C_OF }, 90 { "oseek", f_seek, C_SEEK, C_SEEK }, 91 { "seek", f_seek, C_SEEK, C_SEEK }, 92 { "skip", f_skip, C_SKIP, C_SKIP }, 93 { "speed", f_speed, 0, 0 }, 94 { "status", f_status, C_STATUS,C_STATUS }, 95 }; 96 97 static char *oper; 98 99 /* 100 * args -- parse JCL syntax of dd. 101 */ 102 void 103 jcl(char **argv) 104 { 105 struct arg *ap, tmp; 106 char *arg; 107 108 in.dbsz = out.dbsz = 512; 109 110 while ((oper = *++argv) != NULL) { 111 if ((oper = strdup(oper)) == NULL) 112 errx(1, "unable to allocate space for the argument \"%s\"", *argv); 113 if ((arg = strchr(oper, '=')) == NULL) 114 errx(1, "unknown operand %s", oper); 115 *arg++ = '\0'; 116 if (!*arg) 117 errx(1, "no value specified for %s", oper); 118 tmp.name = oper; 119 if (!(ap = (struct arg *)bsearch(&tmp, args, 120 sizeof(args)/sizeof(struct arg), sizeof(struct arg), 121 c_arg))) 122 errx(1, "unknown operand %s", tmp.name); 123 if (ddflags & ap->noset) 124 errx(1, "%s: illegal argument combination or already set", 125 tmp.name); 126 ddflags |= ap->set; 127 ap->f(arg); 128 } 129 130 /* Final sanity checks. */ 131 132 if (ddflags & C_BS) { 133 /* 134 * Bs is turned off by any conversion -- we assume the user 135 * just wanted to set both the input and output block sizes 136 * and didn't want the bs semantics, so we don't warn. 137 */ 138 if (ddflags & (C_BLOCK | C_LCASE | C_SWAB | C_UCASE | 139 C_UNBLOCK)) 140 ddflags &= ~C_BS; 141 142 /* Bs supersedes ibs and obs. */ 143 if (ddflags & C_BS && ddflags & (C_IBS | C_OBS)) 144 warnx("bs supersedes ibs and obs"); 145 } 146 147 /* 148 * Ascii/ebcdic and cbs implies block/unblock. 149 * Block/unblock requires cbs and vice-versa. 150 */ 151 if (ddflags & (C_BLOCK | C_UNBLOCK)) { 152 if (!(ddflags & C_CBS)) 153 errx(1, "record operations require cbs"); 154 if (cbsz == 0) 155 errx(1, "cbs cannot be zero"); 156 cfunc = ddflags & C_BLOCK ? block : unblock; 157 } else if (ddflags & C_CBS) { 158 if (ddflags & (C_ASCII | C_EBCDIC)) { 159 if (ddflags & C_ASCII) { 160 ddflags |= C_UNBLOCK; 161 cfunc = unblock; 162 } else { 163 ddflags |= C_BLOCK; 164 cfunc = block; 165 } 166 } else 167 errx(1, "cbs meaningless if not doing record operations"); 168 } else 169 cfunc = def; 170 171 /* 172 * Bail out if the calculation of a file offset would overflow. 173 */ 174 if (in.offset > OFF_MAX / (ssize_t)in.dbsz || 175 out.offset > OFF_MAX / (ssize_t)out.dbsz) 176 errx(1, "seek offsets cannot be larger than %jd", 177 (intmax_t)OFF_MAX); 178 } 179 180 static int 181 c_arg(const void *a, const void *b) 182 { 183 184 return (strcmp(((const struct arg *)a)->name, 185 ((const struct arg *)b)->name)); 186 } 187 188 static void 189 f_bs(char *arg) 190 { 191 uintmax_t res; 192 193 res = get_num(arg); 194 if (res < 1 || res > SSIZE_MAX) 195 errx(1, "bs must be between 1 and %jd", (intmax_t)SSIZE_MAX); 196 in.dbsz = out.dbsz = (size_t)res; 197 } 198 199 static void 200 f_cbs(char *arg) 201 { 202 uintmax_t res; 203 204 res = get_num(arg); 205 if (res < 1 || res > SSIZE_MAX) 206 errx(1, "cbs must be between 1 and %jd", (intmax_t)SSIZE_MAX); 207 cbsz = (size_t)res; 208 } 209 210 static void 211 f_count(char *arg) 212 { 213 intmax_t res; 214 215 res = (intmax_t)get_num(arg); 216 if (res < 0) 217 errx(1, "count cannot be negative"); 218 if (res == 0) 219 cpy_cnt = (uintmax_t)-1; 220 else 221 cpy_cnt = (uintmax_t)res; 222 } 223 224 static void 225 f_files(char *arg) 226 { 227 228 files_cnt = get_num(arg); 229 if (files_cnt < 1) 230 errx(1, "files must be between 1 and %jd", (uintmax_t)-1); 231 } 232 233 static void 234 f_fillchar(char *arg) 235 { 236 237 if (strlen(arg) != 1) 238 errx(1, "need exactly one fill char"); 239 240 fill_char = arg[0]; 241 } 242 243 static void 244 f_ibs(char *arg) 245 { 246 uintmax_t res; 247 248 if (!(ddflags & C_BS)) { 249 res = get_num(arg); 250 if (res < 1 || res > SSIZE_MAX) 251 errx(1, "ibs must be between 1 and %jd", 252 (intmax_t)SSIZE_MAX); 253 in.dbsz = (size_t)res; 254 } 255 } 256 257 static void 258 f_if(char *arg) 259 { 260 261 in.name = arg; 262 } 263 264 static void 265 f_obs(char *arg) 266 { 267 uintmax_t res; 268 269 if (!(ddflags & C_BS)) { 270 res = get_num(arg); 271 if (res < 1 || res > SSIZE_MAX) 272 errx(1, "obs must be between 1 and %jd", 273 (intmax_t)SSIZE_MAX); 274 out.dbsz = (size_t)res; 275 } 276 } 277 278 static void 279 f_of(char *arg) 280 { 281 282 out.name = arg; 283 } 284 285 static void 286 f_seek(char *arg) 287 { 288 289 out.offset = get_off_t(arg); 290 } 291 292 static void 293 f_skip(char *arg) 294 { 295 296 in.offset = get_off_t(arg); 297 } 298 299 static void 300 f_speed(char *arg) 301 { 302 303 speed = get_num(arg); 304 } 305 306 static void 307 f_status(char *arg) 308 { 309 310 if (strcmp(arg, "none") == 0) 311 ddflags |= C_NOINFO; 312 else if (strcmp(arg, "noxfer") == 0) 313 ddflags |= C_NOXFER; 314 else 315 errx(1, "unknown status %s", arg); 316 } 317 318 static const struct conv { 319 const char *name; 320 u_int set, noset; 321 const u_char *ctab; 322 } clist[] = { 323 { "ascii", C_ASCII, C_EBCDIC, e2a_POSIX }, 324 { "block", C_BLOCK, C_UNBLOCK, NULL }, 325 { "ebcdic", C_EBCDIC, C_ASCII, a2e_POSIX }, 326 { "ibm", C_EBCDIC, C_ASCII, a2ibm_POSIX }, 327 { "lcase", C_LCASE, C_UCASE, NULL }, 328 { "noerror", C_NOERROR, 0, NULL }, 329 { "notrunc", C_NOTRUNC, 0, NULL }, 330 { "oldascii", C_ASCII, C_EBCDIC, e2a_32V }, 331 { "oldebcdic", C_EBCDIC, C_ASCII, a2e_32V }, 332 { "oldibm", C_EBCDIC, C_ASCII, a2ibm_32V }, 333 { "osync", C_OSYNC, C_BS, NULL }, 334 { "pareven", C_PAREVEN, C_PARODD|C_PARSET|C_PARNONE, NULL}, 335 { "parnone", C_PARNONE, C_PARODD|C_PARSET|C_PAREVEN, NULL}, 336 { "parodd", C_PARODD, C_PAREVEN|C_PARSET|C_PARNONE, NULL}, 337 { "parset", C_PARSET, C_PARODD|C_PAREVEN|C_PARNONE, NULL}, 338 { "sparse", C_SPARSE, 0, NULL }, 339 { "swab", C_SWAB, 0, NULL }, 340 { "sync", C_SYNC, 0, NULL }, 341 { "ucase", C_UCASE, C_LCASE, NULL }, 342 { "unblock", C_UNBLOCK, C_BLOCK, NULL }, 343 }; 344 345 static void 346 f_conv(char *arg) 347 { 348 struct conv *cp, tmp; 349 350 while (arg != NULL) { 351 tmp.name = strsep(&arg, ","); 352 cp = bsearch(&tmp, clist, sizeof(clist) / sizeof(struct conv), 353 sizeof(struct conv), c_conv); 354 if (cp == NULL) 355 errx(1, "unknown conversion %s", tmp.name); 356 if (ddflags & cp->noset) 357 errx(1, "%s: illegal conversion combination", tmp.name); 358 ddflags |= cp->set; 359 if (cp->ctab) 360 ctab = cp->ctab; 361 } 362 } 363 364 static int 365 c_conv(const void *a, const void *b) 366 { 367 368 return (strcmp(((const struct conv *)a)->name, 369 ((const struct conv *)b)->name)); 370 } 371 372 static intmax_t 373 postfix_to_mult(const char expr) 374 { 375 intmax_t mult; 376 377 mult = 0; 378 switch (expr) { 379 case 'B': 380 case 'b': 381 mult = 512; 382 break; 383 case 'K': 384 case 'k': 385 mult = 1 << 10; 386 break; 387 case 'M': 388 case 'm': 389 mult = 1 << 20; 390 break; 391 case 'G': 392 case 'g': 393 mult = 1 << 30; 394 break; 395 case 'T': 396 case 't': 397 mult = (uintmax_t)1 << 40; 398 break; 399 case 'P': 400 case 'p': 401 mult = (uintmax_t)1 << 50; 402 break; 403 case 'W': 404 case 'w': 405 mult = sizeof(int); 406 break; 407 } 408 409 return (mult); 410 } 411 412 /* 413 * Convert an expression of the following forms to a uintmax_t. 414 * 1) A positive decimal number. 415 * 2) A positive decimal number followed by a 'b' or 'B' (mult by 512). 416 * 3) A positive decimal number followed by a 'k' or 'K' (mult by 1 << 10). 417 * 4) A positive decimal number followed by a 'm' or 'M' (mult by 1 << 20). 418 * 5) A positive decimal number followed by a 'g' or 'G' (mult by 1 << 30). 419 * 6) A positive decimal number followed by a 't' or 'T' (mult by 1 << 40). 420 * 7) A positive decimal number followed by a 'p' or 'P' (mult by 1 << 50). 421 * 8) A positive decimal number followed by a 'w' or 'W' (mult by sizeof int). 422 * 9) Two or more positive decimal numbers (with/without [BbKkMmGgWw]) 423 * separated by 'x' or 'X' (also '*' for backwards compatibility), 424 * specifying the product of the indicated values. 425 */ 426 static uintmax_t 427 get_num(const char *val) 428 { 429 uintmax_t num, mult, prevnum; 430 char *expr; 431 432 errno = 0; 433 num = strtoumax(val, &expr, 0); 434 if (expr == val) /* No valid digits. */ 435 errx(1, "%s: invalid numeric value", oper); 436 if (errno != 0) 437 err(1, "%s", oper); 438 439 mult = postfix_to_mult(*expr); 440 441 if (mult != 0) { 442 prevnum = num; 443 num *= mult; 444 /* Check for overflow. */ 445 if (num / mult != prevnum) 446 goto erange; 447 expr++; 448 } 449 450 switch (*expr) { 451 case '\0': 452 break; 453 case '*': /* Backward compatible. */ 454 case 'X': 455 case 'x': 456 mult = get_num(expr + 1); 457 prevnum = num; 458 num *= mult; 459 if (num / mult == prevnum) 460 break; 461 erange: 462 errx(1, "%s: %s", oper, strerror(ERANGE)); 463 default: 464 errx(1, "%s: illegal numeric value", oper); 465 } 466 return (num); 467 } 468 469 /* 470 * Convert an expression of the following forms to an off_t. This is the 471 * same as get_num(), but it uses signed numbers. 472 * 473 * The major problem here is that an off_t may not necessarily be a intmax_t. 474 */ 475 static off_t 476 get_off_t(const char *val) 477 { 478 intmax_t num, mult, prevnum; 479 char *expr; 480 481 errno = 0; 482 num = strtoimax(val, &expr, 0); 483 if (expr == val) /* No valid digits. */ 484 errx(1, "%s: invalid numeric value", oper); 485 if (errno != 0) 486 err(1, "%s", oper); 487 488 mult = postfix_to_mult(*expr); 489 490 if (mult != 0) { 491 prevnum = num; 492 num *= mult; 493 /* Check for overflow. */ 494 if ((prevnum > 0) != (num > 0) || num / mult != prevnum) 495 goto erange; 496 expr++; 497 } 498 499 switch (*expr) { 500 case '\0': 501 break; 502 case '*': /* Backward compatible. */ 503 case 'X': 504 case 'x': 505 mult = (intmax_t)get_off_t(expr + 1); 506 prevnum = num; 507 num *= mult; 508 if ((prevnum > 0) == (num > 0) && num / mult == prevnum) 509 break; 510 erange: 511 errx(1, "%s: %s", oper, strerror(ERANGE)); 512 default: 513 errx(1, "%s: illegal numeric value", oper); 514 } 515 return (num); 516 } 517