01-17-2006
Hi Jim,
I have just found a sed command that removes all the ^M's in the file tucked away in a function. So that solves the mystery thanks for you help mate.
regards
bob.....
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
hello all.
I'm not asking about the algorithm - or how it goes about computing the checksum - I'm asking how it views/looks at the files it does the cksum on.
For instance:
Say you had a directory named "dir_A"
And within this directory you had some files.
So:
dir_A
- file1
-... (5 Replies)
Discussion started by: kapolani
5 Replies
2. Shell Programming and Scripting
Hi,
I have a working script, well it works on my machine but when I try it on others the cksum section does not work properly (I know the scripting is not of a high quality but I'm just trying to get it working)
Heres the script:
#!/bin/sh
case $# in
0) echo "usage: enshar filename... (7 Replies)
Discussion started by: Dim-Wit
7 Replies
3. Shell Programming and Scripting
hi,
I am trying to use the cksum feature in unix. when i make a call to it i get returned something along the lines of:
4603435 14 file3
how do i get the first part of this response only; i.e:
4603435
I'm trying to use at a way without the use of sed and creating temp... (4 Replies)
Discussion started by: leeRoberts2007
4 Replies
4. UNIX for Advanced & Expert Users
Hi,
On what factors does the cksum depend.
If i build 2 machines exactly the same, then can i get the checksum of 2 compiled files same.
Thanks (3 Replies)
Discussion started by: vibhor_agarwali
3 Replies
5. UNIX for Dummies Questions & Answers
Hi guys,
I have a service directory with a lot of files in.
I have to cksum the whole directory and compare it to a release note document.
However the problem I have is the files are listed in different lines when running cksum as they are in the release doc. Therefore cksum shows... (1 Reply)
Discussion started by: Stin
1 Replies
6. UNIX for Dummies Questions & Answers
Hi all,
So I have a binary file and I need to generate an expected EEPROM checksum for it. Ideally, I would like to input the file (with the path) and output a computed checksum. Ive been using (cksum file1) with no avail and I was just curious as to whether there is such thing as EEPROM... (1 Reply)
Discussion started by: TeamUSA
1 Replies
7. Shell Programming and Scripting
Hi all,
So I have a binary file and I need to generate an expected EEPROM checksum for it. Ideally, I would like to input the file (with the path) and output a computed checksum. Ive been using (cksum file1) with no avail and I was just curious as to whether there is such thing as EEPROM cksum,... (1 Reply)
Discussion started by: TeamUSA
1 Replies
8. UNIX for Dummies Questions & Answers
Is cksum the right command to calculate the crc32 checksum value? I tried it for a number of files now and every time the results dont match. So there is nothing wrong with the file. Also, cksum gives me an all numerical value while crc32 is alpha numeric. What am I doing wrong?
Thanks (9 Replies)
Discussion started by: utamav
9 Replies
9. Solaris
Hi
I have 2 ZFS filesystems (Sun M3000 server connected to Clariion external storage vie 2 X HBA's) - ZFS filesytems (1 X mirror - 100GB X2) and the 2nd ZFS is 2 concatenated disks - 100GB + 50GB.
Both ZPOOLS are reporting CKSUM errors only - no READ or WRITE errors. I have cleared the... (5 Replies)
Discussion started by: samruthroy
5 Replies
CKSUM(1) BSD General Commands Manual CKSUM(1)
NAME
cksum, sum -- display file checksums and block counts
SYNOPSIS
cksum [-o 1 | 2 | 3] [file ...]
sum [file ...]
DESCRIPTION
The cksum utility writes to the standard output three whitespace separated fields for each input file. These fields are a checksum 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.
The sum utility is identical to the cksum utility, except that it defaults to using historic algorithm 1, as described below. It is provided
for compatibility only.
The options are as follows:
-o Use historic algorithms instead of the (superior) default one.
Algorithm 1 is the algorithm used by historic BSD systems as the sum(1) algorithm and by historic AT&T System V UNIX systems as the
sum(1) algorithm when using the -r option. This is a 16-bit checksum, with a right rotation before each addition; overflow is dis-
carded.
Algorithm 2 is the algorithm used by historic AT&T System V UNIX systems as the default sum(1) algorithm. This is a 32-bit checksum,
and is defined as follows:
s = sum of all bytes;
r = s % 2^16 + (s % 2^32) / 2^16;
cksum = (r % 2^16) + r / 2^16;
Algorithm 3 is what is commonly called the '32bit CRC' algorithm. This is a 32-bit checksum.
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.
The default CRC used is based on the polynomial used for CRC error checking in the networking standard ISO/IEC 8802-3:1989. The CRC checksum
encoding is defined by the generating polynomial:
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
Mathematically, the CRC value corresponding to a given file is defined by the following procedure:
The n bits to be evaluated are considered to be the coefficients of a mod 2 polynomial M(x) of degree n-1. These 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.
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.
The coefficients of R(x) are considered to be a 32-bit sequence.
The bit sequence is complemented and the result is the CRC.
EXIT STATUS
The cksum and sum utilities exit 0 on success, and >0 if an error occurs.
SEE ALSO
md5(1)
The default calculation is identical to that given in pseudo-code in the following ACM article.
Dilip V. Sarwate, "Computation of Cyclic Redundancy Checks Via Table Lookup", Communications of the ACM, August 1988.
STANDARDS
The cksum utility is expected to conform to IEEE Std 1003.2-1992 (``POSIX.2'').
HISTORY
The cksum utility appeared in 4.4BSD.
BSD
April 28, 1995 BSD