2bf3d7f61aec68e99c64ac85f03cb95b8bca6d35
1 /* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
6 * Checksum and ECC codes for the OCFS2 userspace library.
8 * Copyright (C) 2006, 2008 Oracle. All rights reserved.
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public
12 * License, version 2, as published by the Free Software Foundation.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * General Public License for more details.
20 #include <linux/kernel.h>
21 #include <linux/types.h>
22 #include <linux/crc32.h>
23 #include <linux/buffer_head.h>
24 #include <linux/bitops.h>
25 #include <asm/byteorder.h>
29 #include "blockcheck.h"
34 * We use the following conventions:
38 * c = # total code bits (d + p)
40 static int calc_parity_bits(unsigned int d
)
45 * Bits required for Single Error Correction is as follows:
49 * We're restricting ourselves to 31 bits of parity, that should be
52 for (p
= 1; p
< 32; p
++)
54 if ((d
+ p
+ 1) <= (1 << p
))
62 * Calculate the bit offset in the hamming code buffer based on the bit's
63 * offset in the data buffer. Since the hamming code reserves all
64 * power-of-two bits for parity, the data bit number and the code bit
65 * number are offest by all the parity bits beforehand.
67 * Recall that bit numbers in hamming code are 1-based. This function
68 * takes the 0-based data bit from the caller.
70 * An example. Take bit 1 of the data buffer. 1 is a power of two (2^0),
71 * so it's a parity bit. 2 is a power of two (2^1), so it's a parity bit.
72 * 3 is not a power of two. So bit 1 of the data buffer ends up as bit 3
75 static unsigned int calc_code_bit(unsigned int i
)
80 * Data bits are 0-based, but we're talking code bits, which
86 * For every power of two below our bit number, bump our bit.
88 * We compare with (b + 1) becuase we have to compare with what b
89 * would be _if_ it were bumped up by the parity bit. Capice?
91 for (p
= 0; (1 << p
) < (b
+ 1); p
++)
98 * This is the low level encoder function. It can be called across
99 * multiple hunks just like the crc32 code. 'd' is the number of bits
100 * _in_this_hunk_. nr is the bit offset of this hunk. So, if you had
101 * two 512B buffers, you would do it like so:
103 * parity = ocfs2_hamming_encode(0, buf1, 512 * 8, 0);
104 * parity = ocfs2_hamming_encode(parity, buf2, 512 * 8, 512 * 8);
106 * If you just have one buffer, use ocfs2_hamming_encode_block().
108 u32
ocfs2_hamming_encode(u32 parity
, void *data
, unsigned int d
, unsigned int nr
)
110 unsigned int p
= calc_parity_bits(nr
+ d
);
111 unsigned int i
, j
, b
;
116 * b is the hamming code bit number. Hamming code specifies a
117 * 1-based array, but C uses 0-based. So 'i' is for C, and 'b' is
120 * The i++ in the for loop is so that the start offset passed
121 * to ocfs2_find_next_bit_set() is one greater than the previously
124 for (i
= 0; (i
= ocfs2_find_next_bit(data
, d
, i
)) < d
; i
++)
127 * i is the offset in this hunk, nr + i is the total bit
130 b
= calc_code_bit(nr
+ i
);
132 for (j
= 0; j
< p
; j
++)
135 * Data bits in the resultant code are checked by
136 * parity bits that are part of the bit number
137 * representation. Huh?
139 * <wikipedia href="http://en.wikipedia.org/wiki/Hamming_code">
140 * In other words, the parity bit at position 2^k
141 * checks bits in positions having bit k set in
142 * their binary representation. Conversely, for
143 * instance, bit 13, i.e. 1101(2), is checked by
144 * bits 1000(2) = 8, 0100(2)=4 and 0001(2) = 1.
147 * Note that 'k' is the _code_ bit number. 'b' in
155 /* While the data buffer was treated as little endian, the
156 * return value is in host endian. */
160 u32
ocfs2_hamming_encode_block(void *data
, unsigned int blocksize
)
162 return ocfs2_hamming_encode(0, data
, blocksize
* 8, 0);
166 * Like ocfs2_hamming_encode(), this can handle hunks. nr is the bit
167 * offset of the current hunk. If bit to be fixed is not part of the
168 * current hunk, this does nothing.
170 * If you only have one hunk, use ocfs2_hamming_fix_block().
172 void ocfs2_hamming_fix(void *data
, unsigned int d
, unsigned int nr
,
175 unsigned int p
= calc_parity_bits(nr
+ d
);
181 * If the bit to fix has an hweight of 1, it's a parity bit. One
182 * busted parity bit is its own error. Nothing to do here.
184 if (hweight32(fix
) == 1)
188 * nr + d is the bit right past the data hunk we're looking at.
189 * If fix after that, nothing to do
191 if (fix
>= calc_code_bit(nr
+ d
))
195 * nr is the offset in the data hunk we're starting at. Let's
196 * start b at the offset in the code buffer. See hamming_encode()
197 * for a more detailed description of 'b'.
199 b
= calc_code_bit(nr
);
200 /* If the fix is before this hunk, nothing to do */
204 for (i
= 0; i
< d
; i
++, b
++)
206 /* Skip past parity bits */
207 while (hweight32(b
) == 1)
211 * i is the offset in this data hunk.
212 * nr + i is the offset in the total data buffer.
213 * b is the offset in the total code buffer.
215 * Thus, when b == fix, bit i in the current hunk needs
220 if (ocfs2_test_bit(i
, data
))
221 ocfs2_clear_bit(i
, data
);
223 ocfs2_set_bit(i
, data
);
229 void ocfs2_hamming_fix_block(void *data
, unsigned int blocksize
,
232 ocfs2_hamming_fix(data
, blocksize
* 8, 0, fix
);
236 * This function generates check information for a block.
237 * data is the block to be checked. bc is a pointer to the
238 * ocfs2_block_check structure describing the crc32 and the ecc.
240 * bc should be a pointer inside data, as the function will
241 * take care of zeroing it before calculating the check information. If
242 * bc does not point inside data, the caller must make sure any inline
243 * ocfs2_block_check structures are zeroed.
245 * The data buffer must be in on-disk endian (little endian for ocfs2).
246 * bc will be filled with little-endian values and will be ready to go to
249 void ocfs2_block_check_compute(void *data
, size_t blocksize
,
250 struct ocfs2_block_check
*bc
)
255 memset(bc
, 0, sizeof(struct ocfs2_block_check
));
257 crc
= crc32_le(~0, data
, blocksize
);
258 ecc
= ocfs2_hamming_encode_block(data
, blocksize
);
261 * No ecc'd ocfs2 structure is larger than 4K, so ecc will be no
262 * larger than 16 bits.
264 BUG_ON(ecc
> USHORT_MAX
);
266 bc
->bc_crc32e
= cpu_to_le32(crc
);
267 bc
->bc_ecc
= cpu_to_le16((u16
)ecc
);
271 * This function validates existing check information. Like _compute,
272 * the function will take care of zeroing bc before calculating check codes.
273 * If bc is not a pointer inside data, the caller must have zeroed any
274 * inline ocfs2_block_check structures.
276 * Again, the data passed in should be the on-disk endian.
278 int ocfs2_block_check_validate(void *data
, size_t blocksize
,
279 struct ocfs2_block_check
*bc
)
282 struct ocfs2_block_check check
;
285 check
.bc_crc32e
= le32_to_cpu(bc
->bc_crc32e
);
286 check
.bc_ecc
= le16_to_cpu(bc
->bc_ecc
);
288 memset(bc
, 0, sizeof(struct ocfs2_block_check
));
290 /* Fast path - if the crc32 validates, we're good to go */
291 crc
= crc32_le(~0, data
, blocksize
);
292 if (crc
== check
.bc_crc32e
)
295 /* Ok, try ECC fixups */
296 ecc
= ocfs2_hamming_encode_block(data
, blocksize
);
297 ocfs2_hamming_fix_block(data
, blocksize
, ecc
^ check
.bc_ecc
);
299 /* And check the crc32 again */
300 crc
= crc32_le(~0, data
, blocksize
);
301 if (crc
== check
.bc_crc32e
)
307 bc
->bc_crc32e
= cpu_to_le32(check
.bc_crc32e
);
308 bc
->bc_ecc
= cpu_to_le16(check
.bc_ecc
);
314 * This function generates check information for a list of buffer_heads.
315 * bhs is the blocks to be checked. bc is a pointer to the
316 * ocfs2_block_check structure describing the crc32 and the ecc.
318 * bc should be a pointer inside data, as the function will
319 * take care of zeroing it before calculating the check information. If
320 * bc does not point inside data, the caller must make sure any inline
321 * ocfs2_block_check structures are zeroed.
323 * The data buffer must be in on-disk endian (little endian for ocfs2).
324 * bc will be filled with little-endian values and will be ready to go to
327 void ocfs2_block_check_compute_bhs(struct buffer_head
**bhs
, int nr
,
328 struct ocfs2_block_check
*bc
)
338 memset(bc
, 0, sizeof(struct ocfs2_block_check
));
340 for (i
= 0, crc
= ~0, ecc
= 0; i
< nr
; i
++) {
341 crc
= crc32_le(crc
, bhs
[i
]->b_data
, bhs
[i
]->b_size
);
343 * The number of bits in a buffer is obviously b_size*8.
344 * The offset of this buffer is b_size*i, so the bit offset
345 * of this buffer is b_size*8*i.
347 ecc
= (u16
)ocfs2_hamming_encode(ecc
, bhs
[i
]->b_data
,
349 bhs
[i
]->b_size
* 8 * i
);
353 * No ecc'd ocfs2 structure is larger than 4K, so ecc will be no
354 * larger than 16 bits.
356 BUG_ON(ecc
> USHORT_MAX
);
358 bc
->bc_crc32e
= cpu_to_le32(crc
);
359 bc
->bc_ecc
= cpu_to_le16((u16
)ecc
);
363 * This function validates existing check information on a list of
364 * buffer_heads. Like _compute_bhs, the function will take care of
365 * zeroing bc before calculating check codes. If bc is not a pointer
366 * inside data, the caller must have zeroed any inline
367 * ocfs2_block_check structures.
369 * Again, the data passed in should be the on-disk endian.
371 int ocfs2_block_check_validate_bhs(struct buffer_head
**bhs
, int nr
,
372 struct ocfs2_block_check
*bc
)
375 struct ocfs2_block_check check
;
383 check
.bc_crc32e
= le32_to_cpu(bc
->bc_crc32e
);
384 check
.bc_ecc
= le16_to_cpu(bc
->bc_ecc
);
386 memset(bc
, 0, sizeof(struct ocfs2_block_check
));
388 /* Fast path - if the crc32 validates, we're good to go */
389 for (i
= 0, crc
= ~0; i
< nr
; i
++)
390 crc
= crc32_le(crc
, bhs
[i
]->b_data
, bhs
[i
]->b_size
);
391 if (crc
== check
.bc_crc32e
)
395 "CRC32 failed: stored: %u, computed %u. Applying ECC.\n",
396 (unsigned int)check
.bc_crc32e
, (unsigned int)crc
);
398 /* Ok, try ECC fixups */
399 for (i
= 0, ecc
= 0; i
< nr
; i
++) {
401 * The number of bits in a buffer is obviously b_size*8.
402 * The offset of this buffer is b_size*i, so the bit offset
403 * of this buffer is b_size*8*i.
405 ecc
= (u16
)ocfs2_hamming_encode(ecc
, bhs
[i
]->b_data
,
407 bhs
[i
]->b_size
* 8 * i
);
409 fix
= ecc
^ check
.bc_ecc
;
410 for (i
= 0; i
< nr
; i
++) {
412 * Try the fix against each buffer. It will only affect
415 ocfs2_hamming_fix(bhs
[i
]->b_data
, bhs
[i
]->b_size
* 8,
416 bhs
[i
]->b_size
* 8 * i
, fix
);
419 /* And check the crc32 again */
420 for (i
= 0, crc
= ~0; i
< nr
; i
++)
421 crc
= crc32_le(crc
, bhs
[i
]->b_data
, bhs
[i
]->b_size
);
422 if (crc
== check
.bc_crc32e
)
425 mlog(ML_ERROR
, "Fixed CRC32 failed: stored: %u, computed %u\n",
426 (unsigned int)check
.bc_crc32e
, (unsigned int)crc
);
431 bc
->bc_crc32e
= cpu_to_le32(check
.bc_crc32e
);
432 bc
->bc_ecc
= cpu_to_le16(check
.bc_ecc
);
438 * These are the main API. They check the superblock flag before
439 * calling the underlying operations.
441 * They expect the buffer(s) to be in disk format.
443 void ocfs2_compute_meta_ecc(struct super_block
*sb
, void *data
,
444 struct ocfs2_block_check
*bc
)
446 if (ocfs2_meta_ecc(OCFS2_SB(sb
)))
447 ocfs2_block_check_compute(data
, sb
->s_blocksize
, bc
);
450 int ocfs2_validate_meta_ecc(struct super_block
*sb
, void *data
,
451 struct ocfs2_block_check
*bc
)
455 if (ocfs2_meta_ecc(OCFS2_SB(sb
)))
456 rc
= ocfs2_block_check_validate(data
, sb
->s_blocksize
, bc
);
461 void ocfs2_compute_meta_ecc_bhs(struct super_block
*sb
,
462 struct buffer_head
**bhs
, int nr
,
463 struct ocfs2_block_check
*bc
)
465 if (ocfs2_meta_ecc(OCFS2_SB(sb
)))
466 ocfs2_block_check_compute_bhs(bhs
, nr
, bc
);
469 int ocfs2_validate_meta_ecc_bhs(struct super_block
*sb
,
470 struct buffer_head
**bhs
, int nr
,
471 struct ocfs2_block_check
*bc
)
475 if (ocfs2_meta_ecc(OCFS2_SB(sb
)))
476 rc
= ocfs2_block_check_validate_bhs(bhs
, nr
, bc
);
This page took 0.041023 seconds and 4 git commands to generate.