07-30-2002
Thanks so far
I appreciate your help.
I did a file comparison using a compare tool called: TSBinComp
which is freeware I downloaded from
http://www.screaminet.com/~tswirsky/bincomp.htm
this tool told me that the only differences in the file occur in bytes 223 and 224. If this isn't a reliable tool could someone recomend another one for me?
My next question is, How would I go about removing these two bytes so that I could cksum the two files.
I also did a bdiff and founs that the problem occurs on line fourteen, if it isn't possible to remove those two bytes how would I be able to remove this line or a certain part of this line?
thanks again for your help
crazykelso
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hello, I'm trying to retreive certain bits of info from a file.
the file contains a list like this
info1:info2:info3:info4
info1:info2:info3:info4
info1:info2:info3:info4
info1:info2:info3:info4
how do i pick out only info2 or only info3 without the others?
Thanks (11 Replies)
Discussion started by: bebop1111116
11 Replies
2. Shell Programming and Scripting
Hello,
I have a XML file as below and i would like to extract all the lines between <JOB & </JOB> for every such occurance. The number of lines between them is not fixed.
Anyways to do this awk?
============
<JOB APR="1" AUG="1" DEC="1" FEB="1" JAN="1" JUL="1" JUN="1" MAR="1" MAY="1"... (3 Replies)
Discussion started by: srivat79
3 Replies
3. Shell Programming and Scripting
How do I split a file into many parts but with different amounts of lines per part? I looked at the split command but that only splits evenly.
I'd like a range specified to determine how many lines each output file should have.
For example, if the input file has 1000 lines and the range is... (1 Reply)
Discussion started by: revax
1 Replies
4. Shell Programming and Scripting
find . -type f | xargs cksum
this command is failing for the files which has a space in between them
any quick solution ? preferably one liner (2 Replies)
Discussion started by: reldb
2 Replies
5. UNIX for Dummies Questions & Answers
I have a number of files that a structured like this: Eg.
file_name.ext1
another file name with spaces.ext2
yatf with .ext3
also a file (plus).ext4
I would like to swap the
part with the descriptive_file_name part, so that it looks like this:
Eg.
file_name .ext1
I know (or... (4 Replies)
Discussion started by: invenio
4 Replies
6. Shell Programming and Scripting
I have a logfile from which i need to extract certain pattern based on the time but the problem here is the time is not same for all days.
Input file:
Mon 12:34:56 abvjingjgg
Mon 12:34:57 ofjhjgjhgh
.
.
.
Mon 22:30:00 kkfng
.
.
.
Mon 23:12:23 kjgsdafhkljf
.
.
.
Tue 01:04:54... (8 Replies)
Discussion started by: gpk_newbie
8 Replies
7. Shell Programming and Scripting
Hello All,
I have a file like this
Define schema flat_file_schema
(
a varchar(20)
,b varchar(30)
,c varchar(40)
);
(Insert into table (
a
,b
,c
) values
(
1
,2
,3
); (4 Replies)
Discussion started by: nnani
4 Replies
8. Shell Programming and Scripting
Hello All,
I have a file like this
APPLY
( 'INSERT INTO brdcst_media_cntnt (
cntnt_id
,brdcst_media_cntnt_cd
,cntnt_prvdr_cd
,data_src_type_cd
,cntnt_titl_nm
,cntnt_desc
,batch_dt
,batch_id
) VALUES
(
:cntnt_id (3 Replies)
Discussion started by: nnani
3 Replies
9. Shell Programming and Scripting
I have number in file which contains date and serial number:
2013101000.
The last two digits are serial number (00). So maximum of serial number is 100.
After reaching 100 it becomes 00 with incrementing 10 which is day with max 31.
after reaching 31 it becomes 00 and increments 10... (31 Replies)
Discussion started by: Natalie
31 Replies
10. Shell Programming and Scripting
Hi all:
I have a 5-column tab-separated file.
The only thing that I want to do with it is to split it.
However, I want to split it with a 80/20 proportion -- randomized, if possible.
I know that something like :
awk '{print $0 ""> "file" NR}' RS='' input-file
will work, but it only... (6 Replies)
Discussion started by: owwow14
6 Replies
LEARN ABOUT OPENDARWIN
cksum
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