2000-02-09 01:28:47 +05:30
|
|
|
/* 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
|
|
|
|
*
|
2000-04-13 06:48:56 +05:30
|
|
|
* Copyright (C) 1999, 2000 by Lineo, inc.
|
1999-10-21 03:38:37 +05:30
|
|
|
* Written by Erik Andersen <andersen@lineo.com>, <andersee@debian.org>
|
|
|
|
*
|
2000-04-13 06:48:56 +05:30
|
|
|
* Based in part on code taken from sash.
|
|
|
|
* Copyright (c) 1999 by David I. Bell
|
|
|
|
* Permission is granted to use, distribute, or modify this source,
|
|
|
|
* provided that this copyright notice remains intact.
|
1999-10-05 21:54:54 +05:30
|
|
|
*
|
|
|
|
* Permission to distribute this code under the GPL has been granted.
|
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
|
|
|
*/
|
|
|
|
|
1999-10-21 03:38:37 +05:30
|
|
|
|
1999-10-05 21:54:54 +05:30
|
|
|
#include "internal.h"
|
1999-11-22 13:11:00 +05:30
|
|
|
#include <features.h>
|
1999-10-13 03:56:06 +05:30
|
|
|
#include <stdio.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <errno.h>
|
1999-12-18 00:14:15 +05:30
|
|
|
#if (__GLIBC__ >= 2) && (__GLIBC_MINOR__ >= 1)
|
1999-11-19 11:01:45 +05:30
|
|
|
#include <inttypes.h>
|
1999-11-22 13:11:00 +05:30
|
|
|
#else
|
|
|
|
typedef unsigned long long int uintmax_t;
|
|
|
|
#endif
|
1999-10-05 21:54:54 +05:30
|
|
|
|
1999-10-20 01:33:34 +05:30
|
|
|
static const char dd_usage[] =
|
2000-05-10 10:35:45 +05:30
|
|
|
"dd [if=FILE] [of=FILE] [bs=N] [count=N] [skip=N] [seek=N]\n"
|
|
|
|
#ifndef BB_FEATURE_TRIVIAL_HELP
|
|
|
|
"\nCopy a file, converting and formatting according to options\n\n"
|
2000-02-09 01:28:47 +05:30
|
|
|
"\tif=FILE\tread from FILE instead of stdin\n"
|
|
|
|
"\tof=FILE\twrite to FILE instead of stdout\n"
|
2000-05-10 10:35:45 +05:30
|
|
|
"\tbs=N\tread and write N bytes at a time\n"
|
|
|
|
"\tcount=N\tcopy only N input blocks\n"
|
|
|
|
"\tskip=N\tskip N input blocks\n"
|
|
|
|
"\tseek=N\tskip N output blocks\n"
|
2000-02-09 01:28:47 +05:30
|
|
|
"\n"
|
2000-05-10 10:35:45 +05:30
|
|
|
"Numbers may be suffixed by w (x2), k (x1024), b (x512), or M (x1024^2)\n"
|
|
|
|
#endif
|
|
|
|
;
|
1999-10-05 21:54:54 +05:30
|
|
|
|
|
|
|
|
2000-02-09 01:28:47 +05:30
|
|
|
|
|
|
|
extern int dd_main(int argc, char **argv)
|
1999-10-13 03:56:06 +05:30
|
|
|
{
|
2000-03-24 06:24:46 +05:30
|
|
|
char *inFile = NULL;
|
|
|
|
char *outFile = NULL;
|
2000-02-09 01:28:47 +05:30
|
|
|
char *cp;
|
|
|
|
int inFd;
|
|
|
|
int outFd;
|
|
|
|
int inCc = 0;
|
|
|
|
int outCc;
|
|
|
|
long blockSize = 512;
|
|
|
|
uintmax_t skipBlocks = 0;
|
|
|
|
uintmax_t seekBlocks = 0;
|
|
|
|
uintmax_t count = (uintmax_t) - 1;
|
|
|
|
uintmax_t intotal;
|
|
|
|
uintmax_t outTotal;
|
|
|
|
unsigned char *buf;
|
|
|
|
|
|
|
|
argc--;
|
|
|
|
argv++;
|
2000-02-07 10:59:42 +05:30
|
|
|
|
2000-02-09 01:28:47 +05:30
|
|
|
/* Parse any options */
|
|
|
|
while (argc) {
|
|
|
|
if (inFile == NULL && (strncmp(*argv, "if", 2) == 0))
|
|
|
|
inFile = ((strchr(*argv, '=')) + 1);
|
|
|
|
else if (outFile == NULL && (strncmp(*argv, "of", 2) == 0))
|
|
|
|
outFile = ((strchr(*argv, '=')) + 1);
|
|
|
|
else if (strncmp("count", *argv, 5) == 0) {
|
|
|
|
count = getNum((strchr(*argv, '=')) + 1);
|
|
|
|
if (count <= 0) {
|
2000-07-14 07:21:25 +05:30
|
|
|
errorMsg("Bad count value %s\n", *argv);
|
2000-02-09 01:28:47 +05:30
|
|
|
goto usage;
|
|
|
|
}
|
|
|
|
} else if (strncmp(*argv, "bs", 2) == 0) {
|
|
|
|
blockSize = getNum((strchr(*argv, '=')) + 1);
|
|
|
|
if (blockSize <= 0) {
|
2000-07-14 07:21:25 +05:30
|
|
|
errorMsg("Bad block size value %s\n", *argv);
|
2000-02-09 01:28:47 +05:30
|
|
|
goto usage;
|
|
|
|
}
|
|
|
|
} else if (strncmp(*argv, "skip", 4) == 0) {
|
|
|
|
skipBlocks = getNum((strchr(*argv, '=')) + 1);
|
|
|
|
if (skipBlocks <= 0) {
|
2000-07-14 07:21:25 +05:30
|
|
|
errorMsg("Bad skip value %s\n", *argv);
|
2000-02-09 01:28:47 +05:30
|
|
|
goto usage;
|
|
|
|
}
|
|
|
|
|
|
|
|
} else if (strncmp(*argv, "seek", 4) == 0) {
|
|
|
|
seekBlocks = getNum((strchr(*argv, '=')) + 1);
|
|
|
|
if (seekBlocks <= 0) {
|
2000-07-14 07:21:25 +05:30
|
|
|
errorMsg("Bad seek value %s\n", *argv);
|
2000-02-09 01:28:47 +05:30
|
|
|
goto usage;
|
|
|
|
}
|
|
|
|
|
|
|
|
} else {
|
|
|
|
goto usage;
|
|
|
|
}
|
|
|
|
argc--;
|
|
|
|
argv++;
|
2000-02-07 10:59:42 +05:30
|
|
|
}
|
1999-10-05 21:54:54 +05:30
|
|
|
|
2000-03-22 04:02:57 +05:30
|
|
|
buf = xmalloc(blockSize);
|
2000-02-09 01:28:47 +05:30
|
|
|
|
|
|
|
intotal = 0;
|
|
|
|
outTotal = 0;
|
|
|
|
|
|
|
|
if (inFile == NULL)
|
|
|
|
inFd = fileno(stdin);
|
|
|
|
else
|
|
|
|
inFd = open(inFile, 0);
|
|
|
|
|
|
|
|
if (inFd < 0) {
|
2000-03-23 06:39:18 +05:30
|
|
|
/* Note that we are not freeing buf or closing
|
|
|
|
* files here to save a few bytes. This exits
|
|
|
|
* here anyways... */
|
|
|
|
|
|
|
|
/* free(buf); */
|
|
|
|
fatalError( inFile);
|
1999-10-13 06:23:55 +05:30
|
|
|
}
|
2000-02-09 01:28:47 +05:30
|
|
|
|
|
|
|
if (outFile == NULL)
|
|
|
|
outFd = fileno(stdout);
|
|
|
|
else
|
|
|
|
outFd = open(outFile, O_WRONLY | O_CREAT | O_TRUNC, 0666);
|
|
|
|
|
|
|
|
if (outFd < 0) {
|
2000-03-23 06:39:18 +05:30
|
|
|
/* Note that we are not freeing buf or closing
|
|
|
|
* files here to save a few bytes. This exits
|
|
|
|
* here anyways... */
|
|
|
|
|
|
|
|
/* close(inFd);
|
|
|
|
free(buf); */
|
|
|
|
fatalError( outFile);
|
1999-10-13 03:56:06 +05:30
|
|
|
}
|
2000-02-09 01:28:47 +05:30
|
|
|
|
|
|
|
lseek(inFd, skipBlocks * blockSize, SEEK_SET);
|
|
|
|
lseek(outFd, seekBlocks * blockSize, SEEK_SET);
|
|
|
|
//
|
|
|
|
//TODO: Convert to using fullRead & fullWrite
|
|
|
|
// from utility.c
|
|
|
|
// -Erik
|
|
|
|
while (outTotal < count * blockSize) {
|
|
|
|
inCc = read(inFd, buf, blockSize);
|
|
|
|
if (inCc < 0) {
|
|
|
|
perror(inFile);
|
|
|
|
goto cleanup;
|
|
|
|
} else if (inCc == 0) {
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
intotal += inCc;
|
|
|
|
cp = buf;
|
|
|
|
|
|
|
|
while (intotal > outTotal) {
|
|
|
|
if (outTotal + inCc > count * blockSize)
|
|
|
|
inCc = count * blockSize - outTotal;
|
|
|
|
outCc = write(outFd, cp, inCc);
|
|
|
|
if (outCc < 0) {
|
|
|
|
perror(outFile);
|
|
|
|
goto cleanup;
|
|
|
|
} else if (outCc == 0) {
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
|
|
|
inCc -= outCc;
|
|
|
|
cp += outCc;
|
|
|
|
outTotal += outCc;
|
|
|
|
}
|
1999-10-13 03:56:06 +05:30
|
|
|
}
|
1999-10-05 21:54:54 +05:30
|
|
|
|
2000-02-09 01:28:47 +05:30
|
|
|
if (inCc < 0)
|
|
|
|
perror(inFile);
|
1999-10-05 21:54:54 +05:30
|
|
|
|
1999-10-13 03:56:06 +05:30
|
|
|
cleanup:
|
2000-03-23 06:39:18 +05:30
|
|
|
/* Note that we are not freeing memory or closing
|
|
|
|
* files here, to save a few bytes. */
|
|
|
|
#if 0
|
2000-02-09 01:28:47 +05:30
|
|
|
close(inFd);
|
|
|
|
close(outFd);
|
|
|
|
free(buf);
|
2000-03-23 06:39:18 +05:30
|
|
|
#endif
|
2000-02-09 01:28:47 +05:30
|
|
|
|
|
|
|
printf("%ld+%d records in\n", (long) (intotal / blockSize),
|
|
|
|
(intotal % blockSize) != 0);
|
|
|
|
printf("%ld+%d records out\n", (long) (outTotal / blockSize),
|
|
|
|
(outTotal % blockSize) != 0);
|
|
|
|
exit(TRUE);
|
1999-10-13 03:56:06 +05:30
|
|
|
usage:
|
1999-10-05 21:54:54 +05:30
|
|
|
|
2000-02-09 01:28:47 +05:30
|
|
|
usage(dd_usage);
|
1999-10-05 21:54:54 +05:30
|
|
|
}
|