HI ALL,
i have a problem when i do a sort sum with many fields.
Is there a limit for fields?
Do you know a solution?
thanks in advance.
the shell is:
# SORT1
SORT1_rcode=777
if ; then
echo "USE $DARSEQ/OTPU.FTPEPREC RECORD F,1000 " > $DARPARSRT/TPEKL508.SORT1_$$.srt
... (6 Replies)
Hi,
I has created the shell script in HP_UX 11.23 and using the command, echo $(date +%Y%m%d%H%M%S) > $DIR/alert, placing the time of running the script into a file alert.
I want to compare the time in the above file alert with the current time.If difference is more than 5 min, then print the... (7 Replies)
hello dont know if this is the correct forum for this post but i have a question.
i am revising for a exam on operating systems and i have the question...
A system has a 32bit virtual address divided into 2kbyte pages and each entry in the page table is 6 bytes in length.
what is the size... (0 Replies)
Hello all,
I have a problem with a skript of mine:
My input has the following format
1,33296 transcript_id"ENSRNOT00000018629" 0 1,33296 0
0 transcript_id"ENSRNOT00000029014" 0
0,907392 transcript_id"ENSRNOT00000016905" 0,907392
0 transcript_id"ENSRNOT00000053370" 0
0... (0 Replies)
Hi all,
I have following scenario to perform sum aggregation on certain columns
Node Allocated_Space Pool_Name CS_Group Utilized Space
-------- ---------------- ---------- --------- --------------
bdw1a_lun01 300 bdw_p0 ... (2 Replies)
Hi All,
I have the following time stamp data in 2 columns
Date TimeStamp(also with milliseconds)
05/23/2012 08:30:11.250
05/23/2012 08:30:15.500
05/23/2012 08:31.15.500
.
.
etc
From this data I need the following output.
0.00( row1-row1 in seconds)
04.25( row2-row1 in... (5 Replies)
Hi there,
I have 2 files in following format
cat file_1
Storage Group Name: aaaa
HBA UID SP Name SPPort
------- ------- ------
0 21
Storage Group Name: bbbb
HBA UID... (2 Replies)
I'm trying to sum each field of the second column over many different files.
For example:
file1: file2:
1 5 1 5
2 6 2 4
3 5 3 3
To get:
file3
1 10
2 10
3 8
I found answer when there are only 2 files as... (10 Replies)
Hi all,
I have the following code in a shell script.
Code:
if
then
echo "##"
echo "##"
echo "##################################"
for fn in `find "$1" -maxdepth 1 -iname \*"$2"* -type f`
do
echo "$fn"
... (2 Replies)
In the awk below I am trying to add a penalty to a score to each matching $1 in file2 based on the sum of $3+$4 (variable TL) from file1. Then the $4 value in file1 is divided by TL and multiplied by 100 (this valvue is variable S). Finally, $2 in file2 - S gives the updated $2 result in file2.... (2 Replies)
Discussion started by: cmccabe
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