On Wed, 2006-11-15 at 23:22 -0800, Andrew Morton wrote:
On Wed, 15 Nov 2006 22:55:43 -0800
Mingming Cao [EMAIL PROTECTED] wrote:
Hmm, maxblocks, in bitmap_search_next_usable_block(), is the end block
number of the range to search, not the lengh of the range. maxblocks
get passed to
On Thu, 16 Nov 2006 00:49:20 -0800
Mingming Cao [EMAIL PROTECTED] wrote:
On Wed, 2006-11-15 at 23:22 -0800, Andrew Morton wrote:
On Wed, 15 Nov 2006 22:55:43 -0800
Mingming Cao [EMAIL PROTECTED] wrote:
Hmm, maxblocks, in bitmap_search_next_usable_block(), is the end block
number
On Thu, 16 Nov 2006 12:15:16 -0800
Mingming Cao [EMAIL PROTECTED] wrote:
On Thu, 2006-11-16 at 01:13 -0800, Andrew Morton wrote:
On Thu, 16 Nov 2006 00:49:20 -0800
Mingming Cao [EMAIL PROTECTED] wrote:
On Wed, 2006-11-15 at 23:22 -0800, Andrew Morton wrote:
On Wed, 15 Nov 2006
Andreas Dilger wrote:
On Nov 16, 2006 11:50 -0500, Jeff Mahoney wrote:
Currently, if a corrupted directory entry with rec_len=0 is encountered,
we still trust that the data is valid. This can cause an infinite loop
in htree_dirblock_to_tree() since the iteration loop will never make any
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Andreas Dilger wrote:
On Nov 16, 2006 11:50 -0500, Jeff Mahoney wrote:
Currently, if a corrupted directory entry with rec_len=0 is encountered,
we still trust that the data is valid. This can cause an infinite loop
in htree_dirblock_to_tree()