Import Lite2's src/usr.bin/cksum. The Makefile is still on the vendor
branch and will temporarily give bogus hard links cksum[.1] -> sum[.1].
This commit is contained in:
parent
5500fdcd4f
commit
2cad40fdac
Notes:
svn2git
2020-12-20 02:59:44 +00:00
svn path=/vendor/CSRG/dist/; revision=27219
8
usr.bin/cksum/Makefile
Normal file
8
usr.bin/cksum/Makefile
Normal file
@ -0,0 +1,8 @@
|
||||
# @(#)Makefile 8.2 (Berkeley) 4/28/95
|
||||
|
||||
PROG= cksum
|
||||
SRCS= cksum.c crc.c print.c sum1.c sum2.c
|
||||
LINKS= ${BINDIR}/cksum ${BINDIR}/sum
|
||||
MLINKS= cksum.1 sum.1
|
||||
|
||||
.include <bsd.prog.mk>
|
176
usr.bin/cksum/cksum.1
Normal file
176
usr.bin/cksum/cksum.1
Normal file
@ -0,0 +1,176 @@
|
||||
.\" Copyright (c) 1991, 1993
|
||||
.\" The Regents of the University of California. All rights reserved.
|
||||
.\"
|
||||
.\" This code is derived from software contributed to Berkeley by
|
||||
.\" the Institute of Electrical and Electronics Engineers, Inc.
|
||||
.\"
|
||||
.\" Redistribution and use in source and binary forms, with or without
|
||||
.\" modification, are permitted provided that the following conditions
|
||||
.\" are met:
|
||||
.\" 1. Redistributions of source code must retain the above copyright
|
||||
.\" notice, this list of conditions and the following disclaimer.
|
||||
.\" 2. Redistributions in binary form must reproduce the above copyright
|
||||
.\" notice, this list of conditions and the following disclaimer in the
|
||||
.\" documentation and/or other materials provided with the distribution.
|
||||
.\" 3. All advertising materials mentioning features or use of this software
|
||||
.\" must display the following acknowledgement:
|
||||
.\" This product includes software developed by the University of
|
||||
.\" California, Berkeley and its contributors.
|
||||
.\" 4. Neither the name of the University nor the names of its contributors
|
||||
.\" may be used to endorse or promote products derived from this software
|
||||
.\" without specific prior written permission.
|
||||
.\"
|
||||
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
||||
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
||||
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
.\" SUCH DAMAGE.
|
||||
.\"
|
||||
.\" @(#)cksum.1 8.2 (Berkeley) 4/28/95
|
||||
.\"
|
||||
.Dd April 28, 1995
|
||||
.Dt CKSUM 1
|
||||
.Os BSD 4.4
|
||||
.Sh NAME
|
||||
.Nm cksum
|
||||
.Nd display file checksums and block counts
|
||||
.Sh SYNOPSIS
|
||||
.Nm cksum
|
||||
.Op Fl o Op \&1 \&| \&2
|
||||
.Op Ar file ...
|
||||
.Nm sum
|
||||
.Op Ar file ...
|
||||
.Sh DESCRIPTION
|
||||
The
|
||||
.Nm cksum
|
||||
utility writes to the standard output three whitespace separated
|
||||
fields for each input file.
|
||||
These fields are a checksum
|
||||
.Tn CRC ,
|
||||
the total number of octets in the file and the file name.
|
||||
If no file name is specified, the standard input is used and no file name
|
||||
is written.
|
||||
.Pp
|
||||
The
|
||||
.Nm sum
|
||||
utility is identical to the
|
||||
.Nm cksum
|
||||
utility, except that it defaults to using historic algorithm 1, as
|
||||
described below.
|
||||
It is provided for compatibility only.
|
||||
.Pp
|
||||
The options are as follows:
|
||||
.Bl -tag -width indent
|
||||
.It Fl o
|
||||
Use historic algorithms instead of the (superior) default one.
|
||||
.Pp
|
||||
Algorithm 1 is the algorithm used by historic
|
||||
.Bx
|
||||
systems as the
|
||||
.Xr sum 1
|
||||
algorithm and by historic
|
||||
.At V
|
||||
systems as the
|
||||
.Xr sum
|
||||
algorithm when using the
|
||||
.Fl r
|
||||
option.
|
||||
This is a 16-bit checksum, with a right rotation before each addition;
|
||||
overflow is discarded.
|
||||
.Pp
|
||||
Algorithm 2 is the algorithm used by historic
|
||||
.At V
|
||||
systems as the
|
||||
default
|
||||
.Xr sum
|
||||
algorithm.
|
||||
This is a 32-bit checksum, and is defined as follows:
|
||||
.Bd -unfilled -offset indent
|
||||
s = sum of all bytes;
|
||||
r = s % 2^16 + (s % 2^32) / 2^16;
|
||||
cksum = (r % 2^16) + r / 2^16;
|
||||
.Ed
|
||||
.Pp
|
||||
Both algorithm 1 and 2 write to the standard output the same fields as
|
||||
the default algorithm except that the size of the file in bytes is
|
||||
replaced with the size of the file in blocks.
|
||||
For historic reasons, the block size is 1024 for algorithm 1 and 512
|
||||
for algorithm 2.
|
||||
Partial blocks are rounded up.
|
||||
.El
|
||||
.Pp
|
||||
The default
|
||||
.Tn CRC
|
||||
used is based on the polynomial used for
|
||||
.Tn CRC
|
||||
error checking
|
||||
in the networking standard
|
||||
.St -iso8802-3
|
||||
The
|
||||
.Tn CRC
|
||||
checksum encoding is defined by the generating polynomial:
|
||||
.Pp
|
||||
.Bd -unfilled -offset indent
|
||||
G(x) = x^32 + x^26 + x^23 + x^22 + x^16 + x^12 +
|
||||
x^11 + x^10 + x^8 + x^7 + x^5 + x^4 + x^2 + x + 1
|
||||
.Ed
|
||||
.Pp
|
||||
Mathematically, the
|
||||
.Tn CRC
|
||||
value corresponding to a given file is defined by
|
||||
the following procedure:
|
||||
.Bd -filled -offset indent
|
||||
The
|
||||
.Ar n
|
||||
bits to be evaluated are considered to be the coefficients of a mod 2
|
||||
polynomial M(x) of degree
|
||||
.Ar n Ns \-1 .
|
||||
These
|
||||
.Ar n
|
||||
bits are the bits from the file, with the most significant bit being the most
|
||||
significant bit of the first octet of the file and the last bit being the least
|
||||
significant bit of the last octet, padded with zero bits (if necessary) to
|
||||
achieve an integral number of octets, followed by one or more octets
|
||||
representing the length of the file as a binary value, least significant octet
|
||||
first.
|
||||
The smallest number of octets capable of representing this integer are used.
|
||||
.Pp
|
||||
M(x) is multiplied by x^32 (i.e., shifted left 32 bits) and divided by
|
||||
G(x) using mod 2 division, producing a remainder R(x) of degree <= 31.
|
||||
.Pp
|
||||
The coefficients of R(x) are considered to be a 32-bit sequence.
|
||||
.Pp
|
||||
The bit sequence is complemented and the result is the CRC.
|
||||
.Ed
|
||||
.Pp
|
||||
The
|
||||
.Nm cksum
|
||||
and
|
||||
.Nm sum
|
||||
utilities exit 0 on success, and >0 if an error occurs.
|
||||
.Sh SEE ALSO
|
||||
The default calculation is identical to that given in pseudo-code
|
||||
in the following
|
||||
.Tn ACM
|
||||
article.
|
||||
.Rs
|
||||
.%T "Computation of Cyclic Redundancy Checks Via Table Lookup"
|
||||
.%A Dilip V. Sarwate
|
||||
.%J "Communications of the \\*(tNACM\\*(sP"
|
||||
.%D "August 1988"
|
||||
.Re
|
||||
.Sh STANDARDS
|
||||
The
|
||||
.Nm cksum
|
||||
utility is expected to be POSIX 1003.2 compatible.
|
||||
.Sh HISTORY
|
||||
The
|
||||
.Nm cksum
|
||||
utility appears in
|
||||
.Bx 4.4 .
|
133
usr.bin/cksum/cksum.c
Normal file
133
usr.bin/cksum/cksum.c
Normal file
@ -0,0 +1,133 @@
|
||||
/*-
|
||||
* Copyright (c) 1991, 1993
|
||||
* The Regents of the University of California. All rights reserved.
|
||||
*
|
||||
* This code is derived from software contributed to Berkeley by
|
||||
* James W. Williams of NASA Goddard Space Flight Center.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#ifndef lint
|
||||
static char copyright[] =
|
||||
"@(#) Copyright (c) 1991, 1993\n\
|
||||
The Regents of the University of California. All rights reserved.\n";
|
||||
#endif /* not lint */
|
||||
|
||||
#ifndef lint
|
||||
static char sccsid[] = "@(#)cksum.c 8.2 (Berkeley) 4/28/95";
|
||||
#endif /* not lint */
|
||||
|
||||
#include <sys/cdefs.h>
|
||||
#include <sys/types.h>
|
||||
|
||||
#include <err.h>
|
||||
#include <errno.h>
|
||||
#include <fcntl.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <unistd.h>
|
||||
|
||||
#include "extern.h"
|
||||
|
||||
void usage __P((void));
|
||||
|
||||
int
|
||||
main(argc, argv)
|
||||
int argc;
|
||||
char **argv;
|
||||
{
|
||||
register int ch, fd, rval;
|
||||
u_long len, val;
|
||||
char *fn, *p;
|
||||
int (*cfncn) __P((int, unsigned long *, unsigned long *));
|
||||
void (*pfncn) __P((char *, unsigned long, unsigned long));
|
||||
|
||||
if ((p = rindex(argv[0], '/')) == NULL)
|
||||
p = argv[0];
|
||||
else
|
||||
++p;
|
||||
if (*p == 'c') {
|
||||
cfncn = crc;
|
||||
pfncn = pcrc;
|
||||
} else {
|
||||
cfncn = csum1;
|
||||
pfncn = psum1;
|
||||
}
|
||||
|
||||
while ((ch = getopt(argc, argv, "o:")) != -1)
|
||||
switch (ch) {
|
||||
case 'o':
|
||||
if (!strcmp(optarg, "1")) {
|
||||
cfncn = csum1;
|
||||
pfncn = psum1;
|
||||
} else if (!strcmp(optarg, "2")) {
|
||||
cfncn = csum2;
|
||||
pfncn = psum2;
|
||||
} else {
|
||||
warnx("illegal argument to -o option");
|
||||
usage();
|
||||
}
|
||||
break;
|
||||
case '?':
|
||||
default:
|
||||
usage();
|
||||
}
|
||||
argc -= optind;
|
||||
argv += optind;
|
||||
|
||||
fd = STDIN_FILENO;
|
||||
fn = NULL;
|
||||
rval = 0;
|
||||
do {
|
||||
if (*argv) {
|
||||
fn = *argv++;
|
||||
if ((fd = open(fn, O_RDONLY, 0)) < 0) {
|
||||
warn("%s", fn);
|
||||
rval = 1;
|
||||
continue;
|
||||
}
|
||||
}
|
||||
if (cfncn(fd, &val, &len)) {
|
||||
warn("%s", fn ? fn : "stdin");
|
||||
rval = 1;
|
||||
} else
|
||||
pfncn(fn, val, len);
|
||||
(void)close(fd);
|
||||
} while (*argv);
|
||||
exit(rval);
|
||||
}
|
||||
|
||||
void
|
||||
usage()
|
||||
{
|
||||
(void)fprintf(stderr, "usage: cksum [-o 1 | 2] [file ...]\n");
|
||||
exit(1);
|
||||
}
|
Loading…
Reference in New Issue
Block a user