Lines Matching refs:rp4

45 byte   0:  bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0   rp0 rp2 rp4 ... rp14
46 byte   1:  bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0   rp1 rp2 rp4 ... rp14
47 byte   2:  bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0   rp0 rp3 rp4 ... rp14
48 byte   3:  bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0   rp1 rp3 rp4 ... rp14
83 - for rp4 the rule is cover 4 bytes, skip 4 bytes, cover 4 bytes, skip 4 etc.
85   so rp4 calculates parity over bytes 0, 1, 2, 3, 8, 9, 10, 11, 16, ...)
139       rp4 = bit7 ^ bit6 ^ bit5 ^ bit4 ^ bit3 ^ bit2 ^ bit1 ^ bit0 ^ rp4;
217       unsigned char rp0, rp1, rp2, rp3, rp4, rp5, rp6, rp7;
223       rp4 = 0; rp5 = 0; rp6 = 0; rp7 = 0;
233           if (i & 0x04) rp5 ^= cur; else rp4 ^= cur;
244           (parity[rp4] << 4) |
328       unsigned long rp0, rp1, rp2, rp3, rp4, rp5, rp6, rp7;
334       rp4 = 0; rp5 = 0; rp6 = 0; rp7 = 0;
342           if (i & 0x01) rp5 ^= cur; else rp4 ^= cur;
352          we'll bring rp4 to 15 back to single byte entities by shifting and
355       rp4 ^= (rp4 >> 16); rp4 ^= (rp4 >> 8); rp4 &= 0xff;
378           (parity[rp4] << 4) |
422 Of course the same thing holds for rp4/5, rp6/7, rp8/9, rp10/11 and rp12/13.
433           if (i & 0x01) rp5 ^= cur; else rp4 ^= cur;
451           rp4  = par ^ rp5;
486         rp4 ^= cur;
515 bytes and rp4 and rp5 each contain the xor of half of the bytes.
516 So in effect par = rp4 ^ rp5. But as xor is commutative we can also say
517 that rp5 = par ^ rp4. So no need to keep both rp4 and rp5 around. We can
518 eliminate rp5 (or rp4, but I already foresaw another optimisation).
529     rp5 = par ^ rp4;
554         cur = *bp++; tmppar  = cur; rp4 ^= cur;
556         cur = *bp++; tmppar ^= cur; rp4 ^= cur;
559         cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp6 ^= cur;
561         cur = *bp++; tmppar ^= cur; rp4 ^= cur;
564         cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp6 ^= cur; rp8 ^= cur;
566         cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp8 ^= cur;
569         cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp6 ^= cur;
571         cur = *bp++; tmppar ^= cur; rp4 ^= cur;
585 rp4 ^= cur; rp6 ^= cur;
603 	rp4 ^= cur; rp6 ^= cur;
609 	rp4 ^= rp4_6;
627         cur = *bp++; tmppar  = cur; rp4 ^= cur;
629         cur = *bp++; tmppar ^= cur; rp4 ^= cur;
634         cur = *bp++; tmppar ^= cur; rp4 ^= cur;
640         cur = *bp++; tmppar ^= cur; rp4 ^= cur;
646         cur = *bp++; tmppar ^= cur; rp4 ^= cur;
653     rp4 ^= rp4_6;
683 We can simply calculate the total parity. If this is 0 then rp4 = rp5
684 etc. If the parity is 1, then rp4 = !rp5;
686 But if rp4 = rp5 we do not need rp5 etc. We can just write the even bits