Commit Graph

4 Commits (2ddcee17711b37fe9fca7d2350f275789a014f86)

Author SHA1 Message Date
Theodore Ts'o 838e773e7a Change e2fsck to use a red/black tree in pass1b, to remove O(n**2)
algorithms.  Makes e2fsck much, much faster in certain rare cases
where the filesystem is severely corrupted.
2002-08-01 12:37:00 -04:00
Theodore Ts'o 8b25041ede ChangeLog, expect.1, expect.2, image.gz:
f_expand: Make test case better by testing increasing the size of
  	lost+found where an indirect block must be created.  Also add checks
  	to see what happens when directories are disconnected because their
  	containing directory is destroyed (turned into a socket :-)
  f_dupfsblks: Add additional test cases where files share duplicate
  	blocks with both other files and filesystem metadata.
1999-09-14 19:54:39 +00:00
Theodore Ts'o 74becf3c0a Many files:
Checkin of e2fsprogs 1.02.
1997-04-26 14:37:06 +00:00
Theodore Ts'o a418d3ad81 Many files:
Checked in e2fsprogs 0.5c
1997-04-26 14:00:26 +00:00