aboutsummaryrefslogtreecommitdiff
path: root/fsck.go
diff options
context:
space:
mode:
authorJakob Unterwurzacher2018-07-01 19:14:00 +0200
committerJakob Unterwurzacher2018-07-01 21:48:51 +0200
commit2d68b06f9dab66b2a0a6c29c8d5450e2b1d43fae (patch)
tree77f1b55fca2cf58595b33e8d062cf6437f85f283 /fsck.go
parente951043084937c42421debf457e33b3db3b5bac4 (diff)
fsck: handle sparse files efficiently, fix xfstests generic/285
If we encounter a 128KB block of zeros, try to skip to the next data section by calling File.SeekData(). This fixes xfstests generic/285, which creates a 17TB sparse file, and runs fsck afterwards. Without this optimization, fsck would take ages.
Diffstat (limited to 'fsck.go')
-rw-r--r--fsck.go11
1 files changed, 11 insertions, 0 deletions
diff --git a/fsck.go b/fsck.go
index 37157cb..59bb2f0 100644
--- a/fsck.go
+++ b/fsck.go
@@ -1,6 +1,7 @@
package main
import (
+ "bytes"
"fmt"
"os"
"path/filepath"
@@ -115,6 +116,7 @@ func (ck *fsckObj) file(path string) {
return
}
defer f.Release()
+ allZero := make([]byte, fuse.MAX_KERNEL_WRITE)
buf := make([]byte, fuse.MAX_KERNEL_WRITE)
var off int64
// Read() through the whole file and catch transparently mitigated corruptions
@@ -132,6 +134,15 @@ func (ck *fsckObj) file(path string) {
return
}
off += int64(result.Size())
+ // If we seem to be in the middle of a file hole, try to skip to the next
+ // data section.
+ if bytes.Equal(buf, allZero) {
+ f2 := f.(*fusefrontend.File)
+ nextOff, err := f2.SeekData(off)
+ if err == nil {
+ off = nextOff
+ }
+ }
}
}