dd.c

   1 /* vi: set sw=4 ts=4: */
   2 /*
   3  * Mini dd implementation for busybox
   4  *
   5  *
   6  * Copyright (C) 2000 by Matt Kraai <kraai@alumni.carnegiemellon.edu>
   7  *
   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  *
  22  */
  23
  24 #include "busybox.h"
  25
  26 #include <sys/types.h>
  27 #include <fcntl.h>
  28
  29 static 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
  42 int dd_main(int argc, char **argv)
  43 {
  44         int i, ifd, ofd, oflag, sync = FALSE, trunc = TRUE;
  45         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;
  51
  52         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++;
  81                         }
  82                 } else
  83                         usage(dd_usage);
  84         }
  85
  86         buf = xmalloc(bs);
  87
  88         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";
  94         }
  95
  96         if (outfile != NULL) {
  97                 oflag = O_WRONLY | O_CREAT;
  98
  99                 if (!seek && trunc)
 100                         oflag |= O_TRUNC;
 101
 102                 if ((ofd = open(outfile, oflag, 0666)) < 0)
 103                         perror_msg_and_die("%s", outfile);
 104
 105                 if (seek && trunc) {
 106                         if (ftruncate(ofd, seek * bs) < 0)
 107                                 perror_msg_and_die("%s", outfile);
 108                 }
 109
 110                 statusfp = stdout;
 111         } else {
 112                 ofd = STDOUT_FILENO;
 113                 outfile = "standard output";
 114                 statusfp = stderr;
 115         }
 116
 117         if (skip) {
 118                 if (lseek(ifd, skip * bs, SEEK_CUR) < 0)
 119                         perror_msg_and_die("%s", infile);
 120         }
 121
 122         if (seek) {
 123                 if (lseek(ofd, seek * bs, SEEK_CUR) < 0)
 124                         perror_msg_and_die("%s", outfile);
 125         }
 126
 127         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)
 132                         break;
 133                 if (n == bs)
 134                         in_full++;
 135                 else
 136                         in_part++;
 137                 if (sync) {
 138                         memset(buf + n, '\0', bs - n);
 139                         n = bs;
 140                 }
 141                 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++;
 148         }
 149
 150         fprintf(statusfp, "%d+%d records in\n", in_full, in_part);
 151         fprintf(statusfp, "%d+%d records out\n", out_full, out_part);
 152
 153         return EXIT_SUCCESS;
 154 }