31  * p = # parity bits
39  * power-of-two bits for parity, the data bit number and the code bit
40  * number are offset by all the parity bits beforehand.
46  * so it's a parity bit.  2 is a power of two (2^1), so it's a parity bit.
51  * number of parity bits added.  This allows the function to start the
73 	 * would be _if_ it were bumped up by the parity bit.  Capice?  in calc_code_bit()
92  * parity = ocfs2_hamming_encode(0, buf1, 512 * 8, 0);
93  * parity = ocfs2_hamming_encode(parity, buf2, 512 * 8, 512 * 8);
97 u32 ocfs2_hamming_encode(u32 parity, void *data, unsigned int d, unsigned int nr)  in ocfs2_hamming_encode()  argument
122 		 * parity bits that are part of the bit number  in ocfs2_hamming_encode()
126 		 * In other words, the parity bit at position 2^k  in ocfs2_hamming_encode()
136 		parity ^= b;  in ocfs2_hamming_encode()
141 	return parity;  in ocfs2_hamming_encode()
164 	 * If the bit to fix has an hweight of 1, it's a parity bit.  One  in ocfs2_hamming_fix()
165 	 * busted parity bit is its own error.  Nothing to do here.  in ocfs2_hamming_fix()
189 		/* Skip past parity bits */  in ocfs2_hamming_fix()