1.\" Copyright (c) 1991, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" This code is derived from software contributed to Berkeley by 5.\" the Institute of Electrical and Electronics Engineers, Inc. 6.\" 7.\" Redistribution and use in source and binary forms, with or without 8.\" modification, are permitted provided that the following conditions 9.\" are met: 10.\" 1. Redistributions of source code must retain the above copyright 11.\" notice, this list of conditions and the following disclaimer. 12.\" 2. Redistributions in binary form must reproduce the above copyright 13.\" notice, this list of conditions and the following disclaimer in the 14.\" documentation and/or other materials provided with the distribution. 15.\" 3. All advertising materials mentioning features or use of this software 16.\" must display the following acknowledgement: 17.\" This product includes software developed by the University of 18.\" California, Berkeley and its contributors. 19.\" 4. Neither the name of the University nor the names of its contributors 20.\" may be used to endorse or promote products derived from this software 21.\" without specific prior written permission. 22.\" 23.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33.\" SUCH DAMAGE. 34.\" 35.\" @(#)cksum.1 8.2 (Berkeley) 4/28/95 36.\" $Id: cksum.1,v 1.5 1997/07/06 03:03:06 bde Exp $ 37.\" 38.Dd April 28, 1995 39.Dt CKSUM 1 40.Os BSD 4.4 41.Sh NAME 42.Nm cksum 43.Nd display file checksums and block counts 44.Sh SYNOPSIS 45.Nm cksum 46.Op Fl o Ar \&1 No \&| Ar \&2 47.Op Ar file ... 48.Nm sum 49.Op Ar file ... 50.Sh DESCRIPTION 51The 52.Nm cksum 53utility writes to the standard output three whitespace separated 54fields for each input file. 55These fields are a checksum 56.Tn CRC , 57the total number of octets in the file and the file name. 58If no file name is specified, the standard input is used and no file name 59is written. 60.Pp 61The 62.Nm sum 63utility is identical to the 64.Nm cksum 65utility, except that it defaults to using historic algorithm 1, as 66described below. 67It is provided for compatibility only. 68.Pp 69The options are as follows: 70.Bl -tag -width indent 71.It Fl o 72Use historic algorithms instead of the (superior) default one. 73.Pp 74Algorithm 1 is the algorithm used by historic 75.Bx 76systems as the 77.Xr sum 1 78algorithm and by historic 79.At V 80systems as the 81.Xr sum 82algorithm when using the 83.Fl r 84option. 85This is a 16-bit checksum, with a right rotation before each addition; 86overflow is discarded. 87.Pp 88Algorithm 2 is the algorithm used by historic 89.At V 90systems as the 91default 92.Xr sum 93algorithm. 94This is a 32-bit checksum, and is defined as follows: 95.Bd -unfilled -offset indent 96s = sum of all bytes; 97r = s % 2^16 + (s % 2^32) / 2^16; 98cksum = (r % 2^16) + r / 2^16; 99.Ed 100.Pp 101Algorithm 3 is what is commonly called the 102.Ql 32bit CRC 103algorithm. 104This is a 32-bit checksum. 105.Pp 106Both algorithm 1 and 2 write to the standard output the same fields as 107the default algorithm except that the size of the file in bytes is 108replaced with the size of the file in blocks. 109For historic reasons, the block size is 1024 for algorithm 1 and 512 110for algorithm 2. 111Partial blocks are rounded up. 112.El 113.Pp 114The default 115.Tn CRC 116used is based on the polynomial used for 117.Tn CRC 118error checking 119in the networking standard 120.St -iso8802-3 121The 122.Tn CRC 123checksum encoding is defined by the generating polynomial: 124.Pp 125.Bd -unfilled -offset indent 126G(x) = x^32 + x^26 + x^23 + x^22 + x^16 + x^12 + 127 x^11 + x^10 + x^8 + x^7 + x^5 + x^4 + x^2 + x + 1 128.Ed 129.Pp 130Mathematically, the 131.Tn CRC 132value corresponding to a given file is defined by 133the following procedure: 134.Bd -filled -offset indent 135The 136.Ar n 137bits to be evaluated are considered to be the coefficients of a mod 2 138polynomial M(x) of degree 139.Ar n Ns \-1 . 140These 141.Ar n 142bits are the bits from the file, with the most significant bit being the most 143significant bit of the first octet of the file and the last bit being the least 144significant bit of the last octet, padded with zero bits (if necessary) to 145achieve an integral number of octets, followed by one or more octets 146representing the length of the file as a binary value, least significant octet 147first. 148The smallest number of octets capable of representing this integer are used. 149.Pp 150M(x) is multiplied by x^32 (i.e., shifted left 32 bits) and divided by 151G(x) using mod 2 division, producing a remainder R(x) of degree <= 31. 152.Pp 153The coefficients of R(x) are considered to be a 32-bit sequence. 154.Pp 155The bit sequence is complemented and the result is the CRC. 156.Ed 157.Pp 158The 159.Nm cksum 160and 161.Nm sum 162utilities exit 0 on success, and >0 if an error occurs. 163.Sh SEE ALSO 164.Xr md5 1 165.Rs 166The default calculation is identical to that given in pseudo-code 167in the following 168.Tn ACM 169article. 170.Rs 171.%T "Computation of Cyclic Redundancy Checks Via Table Lookup" 172.%A Dilip V. Sarwate 173.%J "Communications of the \\*(tNACM\\*(sP" 174.%D "August 1988" 175.Re 176.Sh STANDARDS 177The 178.Nm cksum 179utility is expected to conform to 180.St -p1003.2-92 . 181.Sh HISTORY 182The 183.Nm cksum 184utility appeared in 185.Bx 4.4 . 186