07-06-2009
10 More Discussions You Might Find Interesting
1. 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
2. Shell Programming and Scripting
Dear Sir,
I am Shidlingayya India, i am new to unix script..my problem is
present-> I have to read the eeprom locations from 0 to 255 locations in separate file..i wrote the code for this as follows
@eep_save_all ;<filename> store eeprom data to intel hex file
kr 0,,02/n
wf %1,... (0 Replies)
Discussion started by: shidlingayya
0 Replies
3. UNIX for Advanced & Expert Users
Hi: I was setting up a modem on an Ultra5 running 2.6. (yes I know, how quaint)
There are 15 systems that are interlinked but not accessible to the outside world.
This will end soon with new updated sun systems but until then the system needs to be accessed by the outside world. Hence the... (1 Reply)
Discussion started by: mndavies
1 Replies
4. UNIX for Advanced & Expert Users
hello
i have sun machine and i need to reset EEPROM password where evrytime machine boot i should put password to start in booting
any one can help me how i can remove this password
Thanks (1 Reply)
Discussion started by: asafwat
1 Replies
5. Solaris
Hi ,
Am new to solaris can anyone tell me what is the use of setting the eeprom variable to true or false ... (5 Replies)
Discussion started by: rogerben
5 Replies
6. 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
7. UNIX for Advanced & Expert Users
Hello all,
I am currently trying to find a solution to replacing some 10 year old Solaris boxes because it is obvious that they are going to fail soon. The problem is that they are license servers, and I need the eeprom serial to transfer to a new computer. Now, I could request that we get new... (1 Reply)
Discussion started by: DeanCarlo
1 Replies
8. UNIX for Dummies Questions & Answers
Hi,
I need to get an output that is the same as "ethtool -e eth0"
But I need to use another method that does not use the eth port ID (ethX).
Does anyone know of any method?
Thanks!! (3 Replies)
Discussion started by: h0ujun
3 Replies
9. Solaris
Hi there,
In Solaris 8.
I have accidentally set the eeprom security-mode=command because I followed the CIS benchmark guideline. Initally, it was eeprom security-mode=none. I have tried to login with the correct password numerous time and it still say permission denied.
I have tried to login... (4 Replies)
Discussion started by: alvinoo
4 Replies
10. AIX
Does AIX (or even the ASMI interface) provide a method to obtain basic data from a SFP+ (aka 10Gb transceiver) installed in a NIC card ?
In this case, the machine is remote (to me), a Power8, with EN0S adapter (2 x 10GbE and 2 x 1Gb).
Specifically, just trying to determine basic things from... (2 Replies)
Discussion started by: The Doctor
2 Replies
LEARN ABOUT OPENDARWIN
sum
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.
DIAGNOSTICS
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