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 * 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.
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
36 static char const copyright[] =
37 "@(#) Copyright (c) 1991, 1993, 1994\n\
38 The Regents of the University of California. All rights reserved.\n";
42 static char sccsid[] = "@(#)dd.c 8.5 (Berkeley) 4/2/94";
45 #include <sys/cdefs.h>
46 __FBSDID("$FreeBSD$");
48 #include <sys/param.h>
51 #include <sys/disklabel.h>
52 #include <sys/filio.h>
71 static void dd_close(void);
72 static void dd_in(void);
73 static void getfdtype(IO *);
74 static void setup(void);
76 IO in, out; /* input/output state */
77 STAT st; /* statistics */
78 void (*cfunc)(void); /* conversion function */
79 uintmax_t cpy_cnt; /* # of blocks to copy */
80 static off_t pending = 0; /* pending seek if sparse */
81 u_int ddflags = 0; /* conversion options */
82 size_t cbsz; /* conversion block size */
83 uintmax_t files_cnt = 1; /* # of files to copy */
84 const u_char *ctab; /* conversion table */
85 char fill_char; /* Character to fill with if defined */
86 size_t speed = 0; /* maximum speed, in bytes per second */
87 volatile sig_atomic_t need_summary;
88 volatile sig_atomic_t need_progress;
91 main(int argc __unused, char *argv[])
93 struct itimerval itv = { { 1, 0 }, { 1, 0 } }; /* SIGALARM every second, if needed */
95 (void)setlocale(LC_CTYPE, "");
99 (void)signal(SIGINFO, siginfo_handler);
100 if (ddflags & C_PROGRESS) {
101 (void)signal(SIGALRM, sigalarm_handler);
102 setitimer(ITIMER_REAL, &itv, NULL);
104 (void)signal(SIGINT, terminate);
113 * Some devices such as cfi(4) may perform significant amounts
114 * of work when a write descriptor is closed. Close the out
115 * descriptor explicitly so that the summary handler (called
116 * from an atexit() hook) includes this work.
127 i = c ^ (c >> 1) ^ (c >> 2) ^ (c >> 3) ^
128 (c >> 4) ^ (c >> 5) ^ (c >> 6) ^ (c >> 7);
137 if (in.name == NULL) {
139 in.fd = STDIN_FILENO;
141 in.fd = open(in.name, O_RDONLY, 0);
143 err(1, "%s", in.name);
148 if (files_cnt > 1 && !(in.flags & ISTAPE))
149 errx(1, "files is not supported for non-tape devices");
151 if (out.name == NULL) {
152 /* No way to check for read access here. */
153 out.fd = STDOUT_FILENO;
157 (O_CREAT | (ddflags & (C_SEEK | C_NOTRUNC) ? 0 : O_TRUNC))
158 out.fd = open(out.name, O_RDWR | OFLAGS, DEFFILEMODE);
160 * May not have read access, so try again with write only.
161 * Without read we may have a problem if output also does
165 out.fd = open(out.name, O_WRONLY | OFLAGS, DEFFILEMODE);
169 err(1, "%s", out.name);
175 * Allocate space for the input and output buffers. If not doing
176 * record oriented I/O, only need a single buffer.
178 if (!(ddflags & (C_BLOCK | C_UNBLOCK))) {
179 if ((in.db = malloc(out.dbsz + in.dbsz - 1)) == NULL)
180 err(1, "input buffer");
182 } else if ((in.db = malloc(MAX(in.dbsz, cbsz) + cbsz)) == NULL ||
183 (out.db = malloc(out.dbsz + cbsz)) == NULL)
184 err(1, "output buffer");
186 /* dbp is the first free position in each buffer. */
190 /* Position the input/output streams. */
197 * Truncate the output file. If it fails on a type of output file
198 * that it should _not_ fail on, error out.
200 if ((ddflags & (C_OF | C_SEEK | C_NOTRUNC)) == (C_OF | C_SEEK) &&
202 if (ftruncate(out.fd, out.offset * out.dbsz) == -1)
203 err(1, "truncating %s", out.name);
205 if (ddflags & (C_LCASE | C_UCASE | C_ASCII | C_EBCDIC | C_PARITY)) {
207 for (cnt = 0; cnt <= 0377; ++cnt)
208 casetab[cnt] = ctab[cnt];
210 for (cnt = 0; cnt <= 0377; ++cnt)
213 if ((ddflags & C_PARITY) && !(ddflags & C_ASCII)) {
215 * If the input is not EBCDIC, and we do parity
216 * processing, strip input parity.
218 for (cnt = 200; cnt <= 0377; ++cnt)
219 casetab[cnt] = casetab[cnt & 0x7f];
221 if (ddflags & C_LCASE) {
222 for (cnt = 0; cnt <= 0377; ++cnt)
223 casetab[cnt] = tolower(casetab[cnt]);
224 } else if (ddflags & C_UCASE) {
225 for (cnt = 0; cnt <= 0377; ++cnt)
226 casetab[cnt] = toupper(casetab[cnt]);
228 if ((ddflags & C_PARITY)) {
230 * This should strictly speaking be a no-op, but I
231 * wonder what funny LANG settings could get us.
233 for (cnt = 0; cnt <= 0377; ++cnt)
234 casetab[cnt] = casetab[cnt] & 0x7f;
236 if ((ddflags & C_PARSET)) {
237 for (cnt = 0; cnt <= 0377; ++cnt)
238 casetab[cnt] = casetab[cnt] | 0x80;
240 if ((ddflags & C_PAREVEN)) {
241 for (cnt = 0; cnt <= 0377; ++cnt)
242 if (parity(casetab[cnt]))
243 casetab[cnt] = casetab[cnt] | 0x80;
245 if ((ddflags & C_PARODD)) {
246 for (cnt = 0; cnt <= 0377; ++cnt)
247 if (!parity(casetab[cnt]))
248 casetab[cnt] = casetab[cnt] | 0x80;
254 if (clock_gettime(CLOCK_MONOTONIC, &st.start))
255 err(1, "clock_gettime");
264 if (fstat(io->fd, &sb) == -1)
265 err(1, "%s", io->name);
266 if (S_ISREG(sb.st_mode))
267 io->flags |= ISTRUNC;
268 if (S_ISCHR(sb.st_mode) || S_ISBLK(sb.st_mode)) {
269 if (ioctl(io->fd, FIODTYPE, &type) == -1) {
270 err(1, "%s", io->name);
274 else if (type & (D_DISK | D_MEM))
276 if (S_ISCHR(sb.st_mode) && (type & D_TAPE) == 0)
282 if (lseek(io->fd, (off_t)0, SEEK_CUR) == -1 && errno == ESPIPE)
289 * Limit the speed by adding a delay before every block read.
290 * The delay (t_usleep) is equal to the time computed from block
291 * size and the specified speed limit (t_target) minus the time
292 * spent on actual read and write operations (t_io).
297 static double t_prev, t_usleep;
298 double t_now, t_io, t_target;
300 t_now = secs_elapsed();
301 t_io = t_now - t_prev - t_usleep;
302 t_target = (double)in.dbsz / (double)speed;
303 t_usleep = t_target - t_io;
305 usleep(t_usleep * 1000000);
312 swapbytes(void *v, size_t len)
314 unsigned char *p = v;
333 case -1: /* count=0 was specified */
338 if (st.in_full + st.in_part >= (uintmax_t)cpy_cnt)
347 * Zero the buffer first if sync; if doing block operations,
350 if (ddflags & C_SYNC) {
351 if (ddflags & C_FILL)
352 memset(in.dbp, fill_char, in.dbsz);
353 else if (ddflags & (C_BLOCK | C_UNBLOCK))
354 memset(in.dbp, ' ', in.dbsz);
356 memset(in.dbp, 0, in.dbsz);
359 n = read(in.fd, in.dbp, in.dbsz);
368 * If noerror not specified, die. POSIX requires that
369 * the warning message be followed by an I/O display.
371 if (!(ddflags & C_NOERROR))
372 err(1, "%s", in.name);
377 * If it's a seekable file descriptor, seek past the
378 * error. If your OS doesn't do the right thing for
379 * raw disks this section should be modified to re-read
380 * in sector size chunks.
382 if (in.flags & ISSEEK &&
383 lseek(in.fd, (off_t)in.dbsz, SEEK_CUR))
386 /* If sync not specified, omit block and continue. */
387 if (!(ddflags & C_SYNC))
390 /* Read errors count as full blocks. */
391 in.dbcnt += in.dbrcnt = in.dbsz;
394 /* Handle full input blocks. */
395 } else if ((size_t)n == in.dbsz) {
396 in.dbcnt += in.dbrcnt = n;
399 /* Handle partial input blocks. */
401 /* If sync, use the entire block. */
402 if (ddflags & C_SYNC)
403 in.dbcnt += in.dbrcnt = in.dbsz;
405 in.dbcnt += in.dbrcnt = n;
410 * POSIX states that if bs is set and no other conversions
411 * than noerror, notrunc or sync are specified, the block
412 * is output without buffering as it is read.
414 if ((ddflags & ~(C_NOERROR | C_NOTRUNC | C_SYNC)) == C_BS) {
415 out.dbcnt = in.dbcnt;
421 if (ddflags & C_SWAB) {
422 if ((n = in.dbrcnt) & 1) {
426 swapbytes(in.dbp, (size_t)n);
439 * Clean up any remaining I/O and flush output. If necessary, the output file
447 else if (cfunc == block)
449 else if (cfunc == unblock)
451 if (ddflags & C_OSYNC && out.dbcnt && out.dbcnt < out.dbsz) {
452 if (ddflags & C_FILL)
453 memset(out.dbp, fill_char, out.dbsz - out.dbcnt);
454 else if (ddflags & (C_BLOCK | C_UNBLOCK))
455 memset(out.dbp, ' ', out.dbsz - out.dbcnt);
457 memset(out.dbp, 0, out.dbsz - out.dbcnt);
458 out.dbcnt = out.dbsz;
460 if (out.dbcnt || pending)
464 * If the file ends with a hole, ftruncate it to extend its size
465 * up to the end of the hole (without having to write any data).
467 if (out.seek_offset > 0 && (out.flags & ISTRUNC)) {
468 if (ftruncate(out.fd, out.seek_offset) == -1)
469 err(1, "truncating %s", out.name);
483 * Write one or more blocks out. The common case is writing a full
484 * output block in a single write; increment the full block stats.
485 * Otherwise, we're into partial block writes. If a partial write,
486 * and it's a character device, just warn. If a tape device, quit.
488 * The partial writes represent two cases. 1: Where the input block
489 * was less than expected so the output block was less than expected.
490 * 2: Where the input block was the right size but we were forced to
491 * write the block in multiple chunks. The original versions of dd(1)
492 * never wrote a block in more than a single write, so the latter case
495 * One special case is if we're forced to do the write -- in that case
496 * we play games with the buffer size, and it's usually a partial write.
501 * If force, first try to write all pending data, else try to write
502 * just one block. Subsequently always write data one full block at
505 for (n = force ? out.dbcnt : out.dbsz;; n = out.dbsz) {
509 if (ddflags & C_SPARSE) {
510 /* Is buffer sparse? */
511 sparse = BISZERO(outp, cnt);
513 if (sparse && !force) {
519 * Seek past hole. Note that we need to record the
520 * reached offset, because we might have no more data
521 * to write, in which case we'll need to call
522 * ftruncate to extend the file size.
524 out.seek_offset = lseek(out.fd, pending, SEEK_CUR);
525 if (out.seek_offset == -1)
526 err(2, "%s: seek error creating sparse file",
531 nw = write(out.fd, outp, cnt);
540 errx(1, "%s: end of device", out.name);
542 err(1, "%s", out.name);
549 if ((size_t)nw == n && n == out.dbsz)
554 if ((size_t) nw != cnt) {
555 if (out.flags & ISTAPE)
556 errx(1, "%s: short write on tape device",
558 if (out.flags & ISCHR && !warned) {
560 warnx("%s: short write on character device",
568 if ((out.dbcnt -= n) < out.dbsz)
572 /* Reassemble the output block. */
574 (void)memmove(out.db, out.dbp - out.dbcnt, out.dbcnt);
575 out.dbp = out.db + out.dbcnt;