Lines Matching refs:rp14
40 byte 0: bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0 rp0 rp2 rp4 ... rp14
41 byte 1: bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0 rp1 rp2 rp4 ... rp14
42 byte 2: bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0 rp0 rp3 rp4 ... rp14
43 byte 3: bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0 rp1 rp3 rp4 ... rp14
44 byte 4: bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0 rp0 rp2 rp5 ... rp14
83 rp14 covers 128 bytes then skips 128
90 ECC 1 rp15 rp14 rp13 rp12 rp11 rp10 rp09 rp08
138 rp14 = bit7 ^ bit6 ^ bit5 ^ bit4 ^ bit3 ^ bit2 ^ bit1 ^ bit0 ^ rp14;
195 unsigned char rp8, rp9, rp10, rp11, rp12, rp13, rp14, rp15;
202 rp12 = 0; rp13 = 0; rp14 = 0; rp15 = 0;
215 if (i & 0x80) rp15 ^= cur; else rp14 ^= cur;
228 (parity[rp14] << 6) |
304 unsigned long rp8, rp9, rp10, rp11, rp12, rp13, rp14, rp15;
311 rp12 = 0; rp13 = 0; rp14 = 0; rp15 = 0;
322 if (i & 0x20) rp15 ^= cur; else rp14 ^= cur;
340 rp14 ^= (rp14 >> 16); rp14 ^= (rp14 >> 8); rp14 &= 0xff;
360 (parity[rp14] << 6) |
391 If we look at e.g. rp14 and rp15 we see that we either xor our data with
392 rp14 or with rp15. However we also have par which goes over all data.
393 This means there is no need to calculate rp14 as it can be calculated from
394 rp15 through rp14 = par ^ rp15;
396 rp14). That is why some places refer to inverse parity.
412 if (i & 0x20) rp15 ^= cur; else rp14 ^= cur;
427 rp14 = par ^ rp15;
462 if (i & 0x2) rp15 ^= cur; else rp14 ^= cur;
487 The same holds for rp6/7, rp8/9, rp10/11 rp12/13 and rp14/15.
542 if ((i & 0x2) == 0) rp14 ^= tmppar;
547 to rp12 and rp14.
613 if ((i & 0x2) == 0) rp14 ^= tmppar;