ndk-busybox/coreutils/dd.c

195 lines
4.5 KiB
C
Raw Normal View History

1999-10-05 16:24:54 +00:00
/*
1999-10-20 22:08:37 +00:00
* Mini dd implementation for busybox
*
* Copyright (C) 1999 by Lineo, inc.
* Written by Erik Andersen <andersen@lineo.com>, <andersee@debian.org>
* based in part on code taken from sash.
*
1999-10-05 16:24:54 +00:00
* Copyright (c) 1999 by David I. Bell
* Permission is granted to use, distribute, or modify this source,
* provided that this copyright notice remains intact.
*
* Permission to distribute this code under the GPL has been granted.
1999-10-20 22:08:37 +00:00
*
* 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 16:24:54 +00:00
*/
1999-10-20 22:08:37 +00:00
1999-10-05 16:24:54 +00:00
#include "internal.h"
1999-11-22 07:41:00 +00:00
#include <features.h>
1999-10-12 22:26:06 +00:00
#include <stdio.h>
#include <fcntl.h>
#include <errno.h>
#if (__GLIBC__ >= 2) && (__GLIBC_MINOR__ >= 1)
1999-11-19 05:31:45 +00:00
#include <inttypes.h>
1999-11-22 07:41:00 +00:00
#else
typedef unsigned long long int uintmax_t;
#endif
1999-10-05 16:24:54 +00:00
static const char dd_usage[] =
"dd [if=name] [of=name] [bs=n] [count=n]\n\n"
1999-10-20 22:08:37 +00:00
"Copy a file, converting and formatting according to options\n\n"
"\tif=FILE\tread from FILE instead of stdin\n"
"\tof=FILE\twrite to FILE instead of stout\n"
"\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"
"\n"
"BYTES may be suffixed by w (x2), k (x1024), b (x512), or m (x1024^2).\n";
1999-10-05 16:24:54 +00:00
1999-10-12 22:26:06 +00:00
extern int dd_main (int argc, char **argv)
{
1999-11-19 05:31:45 +00:00
const char *inFile = NULL;
const char *outFile = NULL;
1999-10-12 22:26:06 +00:00
char *cp;
int inFd;
int outFd;
int inCc = 0;
int outCc;
1999-11-19 05:31:45 +00:00
size_t blockSize = 512;
//uintmax_t skipBlocks = 0;
uintmax_t count = (uintmax_t)-1;
uintmax_t intotal;
uintmax_t outTotal;
1999-10-12 22:26:06 +00:00
unsigned char *buf;
argc--;
argv++;
/* Parse any options */
while (argc) {
1999-10-13 00:53:55 +00:00
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);
1999-10-12 22:26:06 +00:00
else if (strncmp("count", *argv, 5) == 0) {
1999-10-13 00:53:55 +00:00
count = getNum ((strchr(*argv, '='))+1);
1999-10-12 22:26:06 +00:00
if (count <= 0) {
1999-11-19 05:31:45 +00:00
fprintf (stderr, "Bad count value %s\n", *argv);
1999-10-12 22:26:06 +00:00
goto usage;
}
1999-10-05 16:24:54 +00:00
}
1999-10-13 00:53:55 +00:00
else if (strncmp(*argv, "bs", 2) == 0) {
blockSize = getNum ((strchr(*argv, '='))+1);
1999-10-12 22:26:06 +00:00
if (blockSize <= 0) {
1999-11-19 05:31:45 +00:00
fprintf (stderr, "Bad block size value %s\n", *argv);
1999-10-12 22:26:06 +00:00
goto usage;
}
1999-10-05 16:24:54 +00:00
}
1999-10-20 22:08:37 +00:00
#if 0
1999-10-13 00:53:55 +00:00
else if (strncmp(*argv, "skip", 4) == 0) {
1999-10-12 22:26:06 +00:00
skipBlocks = atoi( *argv);
if (skipBlocks <= 0) {
fprintf (stderr, "Bad skip value %d\n", skipBlocks);
goto usage;
}
1999-10-05 16:24:54 +00:00
}
1999-10-20 22:08:37 +00:00
#endif
1999-10-12 22:26:06 +00:00
else {
goto usage;
1999-10-13 00:53:55 +00:00
}
1999-10-12 22:26:06 +00:00
argc--;
argv++;
}
buf = malloc (blockSize);
if (buf == NULL) {
fprintf (stderr, "Cannot allocate buffer\n");
1999-10-13 00:53:55 +00:00
exit( FALSE);
1999-10-12 22:26:06 +00:00
}
intotal = 0;
outTotal = 0;
1999-11-19 05:31:45 +00:00
if (inFile == NULL)
1999-11-19 02:38:58 +00:00
inFd = fileno(stdin);
1999-10-12 22:26:06 +00:00
else
inFd = open (inFile, 0);
if (inFd < 0) {
perror (inFile);
free (buf);
1999-10-13 00:53:55 +00:00
exit( FALSE);
1999-10-12 22:26:06 +00:00
}
1999-10-13 00:53:55 +00:00
if (outFile == NULL)
1999-11-19 02:38:58 +00:00
outFd = fileno(stdout);
1999-10-12 22:26:06 +00:00
else
outFd = creat (outFile, 0666);
if (outFd < 0) {
perror (outFile);
close (inFd);
free (buf);
1999-10-13 00:53:55 +00:00
exit( FALSE);
1999-10-12 22:26:06 +00:00
}
1999-10-13 00:53:55 +00:00
//lseek(inFd, skipBlocks*blockSize, SEEK_SET);
1999-12-03 09:19:54 +00:00
//
//TODO: Convert to using fullRead & fullWrite
// from utilitity.c
// -Erik
1999-10-12 22:26:06 +00:00
while (outTotal < count * blockSize) {
inCc = read (inFd, buf, blockSize);
if (inCc < 0) {
perror (inFile);
goto cleanup;
1999-11-19 02:38:58 +00:00
} else if (inCc == 0) {
goto cleanup;
1999-10-12 22:26:06 +00:00
}
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;
1999-11-19 02:38:58 +00:00
} else if (outCc == 0) {
goto cleanup;
1999-10-12 22:26:06 +00:00
}
inCc -= outCc;
cp += outCc;
outTotal += outCc;
}
}
1999-10-05 16:24:54 +00:00
1999-10-12 22:26:06 +00:00
if (inCc < 0)
perror (inFile);
1999-10-05 16:24:54 +00:00
1999-10-12 22:26:06 +00:00
cleanup:
close (inFd);
close (outFd);
free (buf);
1999-10-05 16:24:54 +00:00
1999-11-19 05:31:45 +00:00
printf ("%ld+%d records in\n", (long)(intotal / blockSize),
1999-10-12 22:26:06 +00:00
(intotal % blockSize) != 0);
1999-11-19 05:31:45 +00:00
printf ("%ld+%d records out\n", (long)(outTotal / blockSize),
1999-10-12 22:26:06 +00:00
(outTotal % blockSize) != 0);
exit( TRUE);
usage:
1999-10-05 16:24:54 +00:00
usage( dd_usage);
1999-10-05 16:24:54 +00:00
}