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 static char const copyright[] = 40 "@(#) Copyright (c) 1991, 1993, 1994\n\ 41 The Regents of the University of California. All rights reserved.\n"; 42 #endif /* not lint */ 43 44 #ifndef lint 45 #if 0 46 static char sccsid[] = "@(#)dd.c 8.5 (Berkeley) 4/2/94"; 47 #endif 48 static const char rcsid[] = 49 "$FreeBSD$"; 50 #endif /* not lint */ 51 52 #include <sys/param.h> 53 #include <sys/stat.h> 54 #include <sys/conf.h> 55 #include <sys/filio.h> 56 57 #include <ctype.h> 58 #include <err.h> 59 #include <errno.h> 60 #include <fcntl.h> 61 #include <locale.h> 62 #include <stdio.h> 63 #include <stdlib.h> 64 #include <string.h> 65 #include <unistd.h> 66 67 #include "dd.h" 68 #include "extern.h" 69 70 static void dd_close __P((void)); 71 static void dd_in __P((void)); 72 static void getfdtype __P((IO *)); 73 static void setup __P((void)); 74 75 IO in, out; /* input/output state */ 76 STAT st; /* statistics */ 77 void (*cfunc) __P((void)); /* conversion function */ 78 quad_t cpy_cnt; /* # of blocks to copy */ 79 off_t pending = 0; /* pending seek if sparse */ 80 u_int ddflags; /* conversion options */ 81 size_t cbsz; /* conversion block size */ 82 quad_t files_cnt = 1; /* # of files to copy */ 83 const u_char *ctab; /* conversion table */ 84 85 int 86 main(argc, argv) 87 int argc; 88 char *argv[]; 89 { 90 (void)setlocale(LC_CTYPE, ""); 91 jcl(argv); 92 setup(); 93 94 (void)signal(SIGINFO, summaryx); 95 (void)signal(SIGINT, terminate); 96 97 atexit(summary); 98 99 while (files_cnt--) 100 dd_in(); 101 102 dd_close(); 103 exit(0); 104 } 105 106 static void 107 setup() 108 { 109 u_int cnt; 110 struct timeval tv; 111 112 if (in.name == NULL) { 113 in.name = "stdin"; 114 in.fd = STDIN_FILENO; 115 } else { 116 in.fd = open(in.name, O_RDONLY, 0); 117 if (in.fd == -1) 118 err(1, "%s", in.name); 119 } 120 121 getfdtype(&in); 122 123 if (files_cnt > 1 && !(in.flags & ISTAPE)) 124 errx(1, "files is not supported for non-tape devices"); 125 126 if (out.name == NULL) { 127 /* No way to check for read access here. */ 128 out.fd = STDOUT_FILENO; 129 out.name = "stdout"; 130 } else { 131 #define OFLAGS \ 132 (O_CREAT | (ddflags & (C_SEEK | C_NOTRUNC) ? 0 : O_TRUNC)) 133 out.fd = open(out.name, O_RDWR | OFLAGS, DEFFILEMODE); 134 /* 135 * May not have read access, so try again with write only. 136 * Without read we may have a problem if output also does 137 * not support seeks. 138 */ 139 if (out.fd == -1) { 140 out.fd = open(out.name, O_WRONLY | OFLAGS, DEFFILEMODE); 141 out.flags |= NOREAD; 142 } 143 if (out.fd == -1) 144 err(1, "%s", out.name); 145 } 146 147 getfdtype(&out); 148 149 /* 150 * Allocate space for the input and output buffers. If not doing 151 * record oriented I/O, only need a single buffer. 152 */ 153 if (!(ddflags & (C_BLOCK | C_UNBLOCK))) { 154 if ((in.db = malloc(out.dbsz + in.dbsz - 1)) == NULL) 155 err(1, "input buffer"); 156 out.db = in.db; 157 } else if ((in.db = malloc(MAX(in.dbsz, cbsz) + cbsz)) == NULL || 158 (out.db = malloc(out.dbsz + cbsz)) == NULL) 159 err(1, "output buffer"); 160 in.dbp = in.db; 161 out.dbp = out.db; 162 163 /* Position the input/output streams. */ 164 if (in.offset) 165 pos_in(); 166 if (out.offset) 167 pos_out(); 168 169 /* 170 * Truncate the output file; ignore errors because it fails on some 171 * kinds of output files, tapes, for example. 172 */ 173 if ((ddflags & (C_OF | C_SEEK | C_NOTRUNC)) == (C_OF | C_SEEK)) 174 (void)ftruncate(out.fd, out.offset * out.dbsz); 175 176 /* 177 * If converting case at the same time as another conversion, build a 178 * table that does both at once. If just converting case, use the 179 * built-in tables. 180 */ 181 if (ddflags & (C_LCASE | C_UCASE)) { 182 if (ddflags & (C_ASCII | C_EBCDIC)) { 183 if (ddflags & C_LCASE) { 184 for (cnt = 0; cnt <= 0377; ++cnt) 185 casetab[cnt] = tolower(ctab[cnt]); 186 } else { 187 for (cnt = 0; cnt <= 0377; ++cnt) 188 casetab[cnt] = toupper(ctab[cnt]); 189 } 190 } else { 191 if (ddflags & C_LCASE) { 192 for (cnt = 0; cnt <= 0377; ++cnt) 193 casetab[cnt] = tolower(cnt); 194 } else { 195 for (cnt = 0; cnt <= 0377; ++cnt) 196 casetab[cnt] = toupper(cnt); 197 } 198 } 199 ctab = casetab; 200 } 201 202 (void)gettimeofday(&tv, (struct timezone *)NULL); 203 st.start = tv.tv_sec + tv.tv_usec * 1e-6; 204 } 205 206 static void 207 getfdtype(io) 208 IO *io; 209 { 210 struct stat sb; 211 int type; 212 213 if (fstat(io->fd, &sb) == -1) 214 err(1, "%s", io->name); 215 if (S_ISCHR(sb.st_mode) || S_ISBLK(sb.st_mode)) { 216 if (ioctl(io->fd, FIODTYPE, &type) == -1) { 217 err(1, "%s", io->name); 218 } else { 219 if (type & D_TAPE) 220 io->flags |= ISTAPE; 221 else if (type & (D_DISK | D_MEM)) 222 io->flags |= ISSEEK; 223 if (S_ISCHR(sb.st_mode) && (type & D_TAPE) == 0) 224 io->flags |= ISCHR; 225 } 226 return; 227 } 228 errno = 0; 229 if (lseek(io->fd, (off_t)0, SEEK_CUR) == -1 && errno == ESPIPE) 230 io->flags |= ISPIPE; 231 else 232 io->flags |= ISSEEK; 233 } 234 235 static void 236 dd_in() 237 { 238 ssize_t n; 239 240 for (;;) { 241 switch (cpy_cnt) { 242 case -1: /* count=0 was specified */ 243 return; 244 case 0: 245 break; 246 default: 247 if (st.in_full + st.in_part >= cpy_cnt) 248 return; 249 break; 250 } 251 252 /* 253 * Zero the buffer first if sync; if doing block operations, 254 * use spaces. 255 */ 256 if (ddflags & C_SYNC) { 257 if (ddflags & (C_BLOCK | C_UNBLOCK)) 258 memset(in.dbp, ' ', in.dbsz); 259 else 260 memset(in.dbp, 0, in.dbsz); 261 } 262 263 n = read(in.fd, in.dbp, in.dbsz); 264 if (n == 0) { 265 in.dbrcnt = 0; 266 return; 267 } 268 269 /* Read error. */ 270 if (n == -1) { 271 /* 272 * If noerror not specified, die. POSIX requires that 273 * the warning message be followed by an I/O display. 274 */ 275 if (!(ddflags & C_NOERROR)) 276 err(1, "%s", in.name); 277 warn("%s", in.name); 278 summary(); 279 280 /* 281 * If it's a seekable file descriptor, seek past the 282 * error. If your OS doesn't do the right thing for 283 * raw disks this section should be modified to re-read 284 * in sector size chunks. 285 */ 286 if (in.flags & ISSEEK && 287 lseek(in.fd, (off_t)in.dbsz, SEEK_CUR)) 288 warn("%s", in.name); 289 290 /* If sync not specified, omit block and continue. */ 291 if (!(ddflags & C_SYNC)) 292 continue; 293 294 /* Read errors count as full blocks. */ 295 in.dbcnt += in.dbrcnt = in.dbsz; 296 ++st.in_full; 297 298 /* Handle full input blocks. */ 299 } else if (n == in.dbsz) { 300 in.dbcnt += in.dbrcnt = n; 301 ++st.in_full; 302 303 /* Handle partial input blocks. */ 304 } else { 305 /* If sync, use the entire block. */ 306 if (ddflags & C_SYNC) 307 in.dbcnt += in.dbrcnt = in.dbsz; 308 else 309 in.dbcnt += in.dbrcnt = n; 310 ++st.in_part; 311 } 312 313 /* 314 * POSIX states that if bs is set and no other conversions 315 * than noerror, notrunc or sync are specified, the block 316 * is output without buffering as it is read. 317 */ 318 if (ddflags & C_BS) { 319 out.dbcnt = in.dbcnt; 320 dd_out(1); 321 in.dbcnt = 0; 322 continue; 323 } 324 325 if (ddflags & C_SWAB) { 326 if ((n = in.dbrcnt) & 1) { 327 ++st.swab; 328 --n; 329 } 330 swab(in.dbp, in.dbp, n); 331 } 332 333 in.dbp += in.dbrcnt; 334 (*cfunc)(); 335 } 336 } 337 338 /* 339 * Clean up any remaining I/O and flush output. If necessary, the output file 340 * is truncated. 341 */ 342 static void 343 dd_close() 344 { 345 if (cfunc == def) 346 def_close(); 347 else if (cfunc == block) 348 block_close(); 349 else if (cfunc == unblock) 350 unblock_close(); 351 if (ddflags & C_OSYNC && out.dbcnt && out.dbcnt < out.dbsz) { 352 if (ddflags & (C_BLOCK | C_UNBLOCK)) 353 memset(out.dbp, ' ', out.dbsz - out.dbcnt); 354 else 355 memset(out.dbp, 0, out.dbsz - out.dbcnt); 356 out.dbcnt = out.dbsz; 357 } 358 if (out.dbcnt || pending) 359 dd_out(1); 360 } 361 362 void 363 dd_out(force) 364 int force; 365 { 366 u_char *outp; 367 size_t cnt, i, n; 368 ssize_t nw; 369 static int warned; 370 int sparse; 371 372 /* 373 * Write one or more blocks out. The common case is writing a full 374 * output block in a single write; increment the full block stats. 375 * Otherwise, we're into partial block writes. If a partial write, 376 * and it's a character device, just warn. If a tape device, quit. 377 * 378 * The partial writes represent two cases. 1: Where the input block 379 * was less than expected so the output block was less than expected. 380 * 2: Where the input block was the right size but we were forced to 381 * write the block in multiple chunks. The original versions of dd(1) 382 * never wrote a block in more than a single write, so the latter case 383 * never happened. 384 * 385 * One special case is if we're forced to do the write -- in that case 386 * we play games with the buffer size, and it's usually a partial write. 387 */ 388 outp = out.db; 389 for (n = force ? out.dbcnt : out.dbsz;; n = out.dbsz) { 390 for (cnt = n;; cnt -= nw) { 391 sparse = 0; 392 if (ddflags & C_SPARSE) { 393 sparse = 1; /* Is buffer sparse? */ 394 for (i = 0; i < cnt; i++) 395 if (outp[i] != 0) { 396 sparse = 0; 397 break; 398 } 399 } 400 if (sparse && !force) { 401 pending += cnt; 402 nw = cnt; 403 } else { 404 if (pending != 0) { 405 if (force) 406 pending--; 407 if (lseek(out.fd, pending, SEEK_CUR) == 408 -1) 409 err(2, "%s: seek error creating sparse file", 410 out.name); 411 if (force) 412 write(out.fd, outp, 1); 413 pending = 0; 414 } 415 if (cnt) 416 nw = write(out.fd, outp, cnt); 417 else 418 return; 419 } 420 421 if (nw <= 0) { 422 if (nw == 0) 423 errx(1, "%s: end of device", out.name); 424 if (errno != EINTR) 425 err(1, "%s", out.name); 426 nw = 0; 427 } 428 outp += nw; 429 st.bytes += nw; 430 if (nw == n) { 431 if (n != out.dbsz) 432 ++st.out_part; 433 else 434 ++st.out_full; 435 break; 436 } 437 ++st.out_part; 438 if (nw == cnt) 439 break; 440 if (out.flags & ISTAPE) 441 errx(1, "%s: short write on tape device", 442 out.name); 443 if (out.flags & ISCHR && !warned) { 444 warned = 1; 445 warnx("%s: short write on character device", 446 out.name); 447 } 448 } 449 if ((out.dbcnt -= n) < out.dbsz) 450 break; 451 } 452 453 /* Reassemble the output block. */ 454 if (out.dbcnt) 455 (void)memmove(out.db, out.dbp - out.dbcnt, out.dbcnt); 456 out.dbp = out.db + out.dbcnt; 457 } 458