blob: 32eeb661cf3aaef32a9f4c961e589d6c0d4b3739 [file] [log] [blame]
Erik Andersene49d5ec2000-02-08 19:58:47 +00001/* vi: set sw=4 ts=4: */
Eric Andersencc8ed391999-10-05 16:24:54 +00002/*
Eric Andersenc4996011999-10-20 22:08:37 +00003 * Mini dd implementation for busybox
4 *
Eric Andersenc4996011999-10-20 22:08:37 +00005 *
Matt Kraai24ac0172000-12-18 21:38:57 +00006 * Copyright (C) 2000 by Matt Kraai <kraai@alumni.carnegiemellon.edu>
Eric Andersenc4996011999-10-20 22:08:37 +00007 *
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21 *
Eric Andersencc8ed391999-10-05 16:24:54 +000022 */
23
Eric Andersen3570a342000-09-25 21:45:58 +000024#include "busybox.h"
Matt Kraai24ac0172000-12-18 21:38:57 +000025
26#include <sys/types.h>
Eric Andersen3cf52d11999-10-12 22:26:06 +000027#include <fcntl.h>
Eric Andersencc8ed391999-10-05 16:24:54 +000028
Matt Kraai24ac0172000-12-18 21:38:57 +000029static struct suffix_mult dd_suffixes[] = {
30 { "c", 1 },
31 { "w", 2 },
32 { "b", 512 },
33 { "kD", 1000 },
34 { "k", 1024 },
35 { "MD", 1000000 },
36 { "M", 1048576 },
37 { "GD", 1000000000 },
38 { "G", 1073741824 },
39 { NULL, 0 }
40};
41
42int dd_main(int argc, char **argv)
Eric Andersen3cf52d11999-10-12 22:26:06 +000043{
Matt Kraaic9acf8c2001-01-17 00:21:05 +000044 int i, ifd, ofd, oflag, sync = FALSE, trunc = TRUE;
Matt Kraai24ac0172000-12-18 21:38:57 +000045 size_t in_full = 0, in_part = 0, out_full = 0, out_part = 0;
46 size_t bs = 512, count = -1;
47 ssize_t n;
48 off_t seek = 0, skip = 0;
49 FILE *statusfp;
50 char *infile = NULL, *outfile = NULL, *buf;
Eric Andersenddea3682000-11-29 22:33:02 +000051
Matt Kraai24ac0172000-12-18 21:38:57 +000052 for (i = 1; i < argc; i++) {
53 if (strncmp("bs=", argv[i], 3) == 0)
54 bs = parse_number(argv[i]+3, dd_suffixes);
55 else if (strncmp("count=", argv[i], 6) == 0)
56 count = parse_number(argv[i]+6, dd_suffixes);
57 else if (strncmp("seek=", argv[i], 5) == 0)
58 seek = parse_number(argv[i]+5, dd_suffixes);
59 else if (strncmp("skip=", argv[i], 5) == 0)
60 skip = parse_number(argv[i]+5, dd_suffixes);
61 else if (strncmp("if=", argv[i], 3) == 0)
62 infile = argv[i]+3;
63 else if (strncmp("of=", argv[i], 3) == 0)
64 outfile = argv[i]+3;
65 else if (strncmp("conv=", argv[i], 5) == 0) {
66 buf = argv[i]+5;
67 while (1) {
68 if (strncmp("notrunc", buf, 7) == 0) {
69 trunc = FALSE;
70 buf += 7;
71 } else if (strncmp("sync", buf, 4) == 0) {
72 sync = TRUE;
73 buf += 4;
74 } else {
75 error_msg_and_die("invalid conversion `%s'\n", argv[i]+5);
76 }
77 if (buf[0] == '\0')
78 break;
79 if (buf[0] == ',')
80 buf++;
Erik Andersene49d5ec2000-02-08 19:58:47 +000081 }
Matt Kraai24ac0172000-12-18 21:38:57 +000082 } else
83 usage(dd_usage);
Eric Andersen3cf52d11999-10-12 22:26:06 +000084 }
Eric Andersen3cf52d11999-10-12 22:26:06 +000085
Matt Kraai24ac0172000-12-18 21:38:57 +000086 buf = xmalloc(bs);
Erik Andersene49d5ec2000-02-08 19:58:47 +000087
Matt Kraai24ac0172000-12-18 21:38:57 +000088 if (infile != NULL) {
89 if ((ifd = open(infile, O_RDONLY)) < 0)
90 perror_msg_and_die("%s", infile);
91 } else {
92 ifd = STDIN_FILENO;
93 infile = "standard input";
Erik Andersene49d5ec2000-02-08 19:58:47 +000094 }
95
Matt Kraai24ac0172000-12-18 21:38:57 +000096 if (outfile != NULL) {
Matt Kraaic9acf8c2001-01-17 00:21:05 +000097 oflag = O_WRONLY | O_CREAT;
98
99 if (!seek && trunc)
100 oflag |= O_TRUNC;
101
102 if ((ofd = open(outfile, oflag, 0666)) < 0)
Matt Kraai24ac0172000-12-18 21:38:57 +0000103 perror_msg_and_die("%s", outfile);
Matt Kraaic9acf8c2001-01-17 00:21:05 +0000104
105 if (seek && trunc) {
106 if (ftruncate(ofd, seek * bs) < 0)
107 perror_msg_and_die("%s", outfile);
108 }
109
Matt Kraai24ac0172000-12-18 21:38:57 +0000110 statusfp = stdout;
111 } else {
112 ofd = STDOUT_FILENO;
113 outfile = "standard output";
114 statusfp = stderr;
Erik Andersene49d5ec2000-02-08 19:58:47 +0000115 }
116
Matt Kraai24ac0172000-12-18 21:38:57 +0000117 if (skip) {
118 if (lseek(ifd, skip * bs, SEEK_CUR) < 0)
119 perror_msg_and_die("%s", infile);
120 }
Eric Andersenddea3682000-11-29 22:33:02 +0000121
Matt Kraai24ac0172000-12-18 21:38:57 +0000122 if (seek) {
123 if (lseek(ofd, seek * bs, SEEK_CUR) < 0)
124 perror_msg_and_die("%s", outfile);
125 }
Eric Andersenddea3682000-11-29 22:33:02 +0000126
Matt Kraai24ac0172000-12-18 21:38:57 +0000127 while (in_full + in_part != count) {
128 n = safe_read(ifd, buf, bs);
129 if (n < 0)
130 perror_msg_and_die("%s", infile);
131 if (n == 0)
Glenn L McGrath06aeb6c2000-08-25 03:50:10 +0000132 break;
Matt Kraai24ac0172000-12-18 21:38:57 +0000133 if (n == bs)
134 in_full++;
135 else
136 in_part++;
137 if (sync) {
138 memset(buf + n, '\0', bs - n);
139 n = bs;
Eric Andersenddea3682000-11-29 22:33:02 +0000140 }
Matt Kraai24ac0172000-12-18 21:38:57 +0000141 n = full_write(ofd, buf, n);
142 if (n < 0)
143 perror_msg_and_die("%s", outfile);
144 if (n == bs)
145 out_full++;
146 else
147 out_part++;
Glenn L McGrathf0b073f2000-09-11 00:32:13 +0000148 }
Eric Andersen3cf52d11999-10-12 22:26:06 +0000149
Matt Kraai24ac0172000-12-18 21:38:57 +0000150 fprintf(statusfp, "%d+%d records in\n", in_full, in_part);
151 fprintf(statusfp, "%d+%d records out\n", out_full, out_part);
152
Matt Kraai3e856ce2000-12-01 02:55:13 +0000153 return EXIT_SUCCESS;
Eric Andersen3cf52d11999-10-12 22:26:06 +0000154}