busybox/coreutils/dd.c

205 lines
4.4 KiB
C
Raw Normal View History

/* vi: set sw=4 ts=4: */
1999-10-05 21:54:54 +05:30
/*
1999-10-21 03:38:37 +05:30
* Mini dd implementation for busybox
*
*
* Copyright (C) 2000,2001 Matt Kraai
1999-10-21 03:38:37 +05:30
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
1999-10-05 21:54:54 +05:30
*/
2000-12-19 03:08:57 +05:30
#include <sys/types.h>
#include <sys/stat.h>
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <string.h>
1999-10-13 03:56:06 +05:30
#include <fcntl.h>
#include "busybox.h"
1999-10-05 21:54:54 +05:30
static const struct suffix_mult dd_suffixes[] = {
2000-12-19 03:08:57 +05:30
{ "c", 1 },
{ "w", 2 },
{ "b", 512 },
{ "kD", 1000 },
{ "k", 1024 },
{ "MD", 1000000 },
{ "M", 1048576 },
{ "GD", 1000000000 },
{ "G", 1073741824 },
{ NULL, 0 }
};
int dd_main(int argc, char **argv)
1999-10-13 03:56:06 +05:30
{
2002-11-28 16:35:28 +05:30
size_t out_full = 0;
size_t out_part = 0;
size_t in_full = 0;
size_t in_part = 0;
size_t count = -1;
size_t bs = 512;
2000-12-19 03:08:57 +05:30
ssize_t n;
2002-11-28 16:35:28 +05:30
off_t seek = 0;
off_t skip = 0;
int sync_flag = FALSE;
int noerror = FALSE;
int trunc = TRUE;
int oflag;
int ifd;
int ofd;
int i;
char *infile = NULL;
char *outfile = NULL;
char *buf;
2000-12-19 03:08:57 +05:30
for (i = 1; i < argc; i++) {
if (strncmp("bs=", argv[i], 3) == 0)
bs = parse_number(argv[i]+3, dd_suffixes);
else if (strncmp("count=", argv[i], 6) == 0)
count = parse_number(argv[i]+6, dd_suffixes);
else if (strncmp("seek=", argv[i], 5) == 0)
seek = parse_number(argv[i]+5, dd_suffixes);
else if (strncmp("skip=", argv[i], 5) == 0)
skip = parse_number(argv[i]+5, dd_suffixes);
else if (strncmp("if=", argv[i], 3) == 0)
infile = argv[i]+3;
else if (strncmp("of=", argv[i], 3) == 0)
outfile = argv[i]+3;
else if (strncmp("conv=", argv[i], 5) == 0) {
buf = argv[i]+5;
while (1) {
if (strncmp("notrunc", buf, 7) == 0) {
trunc = FALSE;
buf += 7;
} else if (strncmp("sync", buf, 4) == 0) {
sync_flag = TRUE;
2000-12-19 03:08:57 +05:30
buf += 4;
2002-04-27 07:01:43 +05:30
} else if (strncmp("noerror", buf, 7) == 0) {
noerror = TRUE;
buf += 7;
2000-12-19 03:08:57 +05:30
} else {
error_msg_and_die("invalid conversion `%s'", argv[i]+5);
2000-12-19 03:08:57 +05:30
}
if (buf[0] == '\0')
break;
if (buf[0] == ',')
buf++;
}
2000-12-19 03:08:57 +05:30
} else
show_usage();
}
1999-10-05 21:54:54 +05:30
2000-12-19 03:08:57 +05:30
buf = xmalloc(bs);
2000-03-23 06:39:18 +05:30
2000-12-19 03:08:57 +05:30
if (infile != NULL) {
2002-11-28 16:35:28 +05:30
if ((ifd = open(infile, O_RDONLY)) < 0) {
2000-12-19 03:08:57 +05:30
perror_msg_and_die("%s", infile);
2002-11-28 16:35:28 +05:30
}
2000-12-19 03:08:57 +05:30
} else {
ifd = STDIN_FILENO;
infile = "standard input";
1999-10-13 06:23:55 +05:30
}
2000-12-19 03:08:57 +05:30
if (outfile != NULL) {
2001-01-17 05:51:05 +05:30
oflag = O_WRONLY | O_CREAT;
2002-11-28 16:35:28 +05:30
if (!seek && trunc) {
2001-01-17 05:51:05 +05:30
oflag |= O_TRUNC;
2002-11-28 16:35:28 +05:30
}
2001-01-17 05:51:05 +05:30
2002-11-28 16:35:28 +05:30
if ((ofd = open(outfile, oflag, 0666)) < 0) {
2000-12-19 03:08:57 +05:30
perror_msg_and_die("%s", outfile);
2002-11-28 16:35:28 +05:30
}
2001-01-17 05:51:05 +05:30
if (seek && trunc) {
if (ftruncate(ofd, seek * bs) < 0) {
struct stat st;
if (fstat (ofd, &st) < 0 || S_ISREG (st.st_mode) ||
2002-11-28 16:35:28 +05:30
S_ISDIR (st.st_mode)) {
perror_msg_and_die("%s", outfile);
2002-11-28 16:35:28 +05:30
}
}
2001-01-17 05:51:05 +05:30
}
2000-12-19 03:08:57 +05:30
} else {
ofd = STDOUT_FILENO;
outfile = "standard output";
}
2000-03-23 06:39:18 +05:30
2000-12-19 03:08:57 +05:30
if (skip) {
2002-11-28 16:35:28 +05:30
if (lseek(ifd, skip * bs, SEEK_CUR) < 0) {
2000-12-19 03:08:57 +05:30
perror_msg_and_die("%s", infile);
2002-11-28 16:35:28 +05:30
}
1999-10-13 03:56:06 +05:30
}
2000-12-19 03:08:57 +05:30
if (seek) {
2002-11-28 16:35:28 +05:30
if (lseek(ofd, seek * bs, SEEK_CUR) < 0) {
2000-12-19 03:08:57 +05:30
perror_msg_and_die("%s", outfile);
2002-11-28 16:35:28 +05:30
}
2000-12-19 03:08:57 +05:30
}
2000-12-19 03:08:57 +05:30
while (in_full + in_part != count) {
2002-04-27 07:01:43 +05:30
if (noerror) {
/* Pre-zero the buffer when doing the noerror thing */
memset(buf, '\0', bs);
}
2000-12-19 03:08:57 +05:30
n = safe_read(ifd, buf, bs);
2002-04-27 07:01:43 +05:30
if (n < 0) {
if (noerror) {
n = bs;
perror_msg("%s", infile);
} else {
perror_msg_and_die("%s", infile);
}
}
2002-11-28 16:35:28 +05:30
if (n == 0) {
break;
2002-11-28 16:35:28 +05:30
}
if (n == bs) {
2000-12-19 03:08:57 +05:30
in_full++;
2002-11-28 16:35:28 +05:30
} else {
2000-12-19 03:08:57 +05:30
in_part++;
2002-11-28 16:35:28 +05:30
}
if (sync_flag) {
2000-12-19 03:08:57 +05:30
memset(buf + n, '\0', bs - n);
n = bs;
}
2000-12-19 03:08:57 +05:30
n = full_write(ofd, buf, n);
2002-11-28 16:35:28 +05:30
if (n < 0) {
2000-12-19 03:08:57 +05:30
perror_msg_and_die("%s", outfile);
2002-11-28 16:35:28 +05:30
}
if (n == bs) {
2000-12-19 03:08:57 +05:30
out_full++;
2002-11-28 16:35:28 +05:30
} else {
2000-12-19 03:08:57 +05:30
out_part++;
2002-11-28 16:35:28 +05:30
}
}
2002-11-28 16:35:28 +05:30
if (close (ifd) < 0) {
perror_msg_and_die("%s", infile);
2002-11-28 16:35:28 +05:30
}
2002-11-28 16:35:28 +05:30
if (close (ofd) < 0) {
perror_msg_and_die("%s", outfile);
2002-11-28 16:35:28 +05:30
}
2002-11-28 16:35:28 +05:30
fprintf(stderr, "%ld+%ld records in\n", (long)in_full, (long)in_part);
fprintf(stderr, "%ld+%ld records out\n", (long)out_full, (long)out_part);
1999-10-05 21:54:54 +05:30
2000-12-19 03:08:57 +05:30
return EXIT_SUCCESS;
1999-10-05 21:54:54 +05:30
}