3bc4e69ba1
Implements btrfs usage using a double walking diff and counting the result. Walking gives the most accurate count and includes inode usage. Signed-off-by: Derek McGowan <derek@mcgstyle.net>
84 lines
1.5 KiB
Go
84 lines
1.5 KiB
Go
// +build !windows
|
|
|
|
package fs
|
|
|
|
import (
|
|
"context"
|
|
"os"
|
|
"path/filepath"
|
|
"syscall"
|
|
)
|
|
|
|
type inode struct {
|
|
// TODO(stevvooe): Can probably reduce memory usage by not tracking
|
|
// device, but we can leave this right for now.
|
|
dev, ino uint64
|
|
}
|
|
|
|
func diskUsage(roots ...string) (Usage, error) {
|
|
|
|
var (
|
|
size int64
|
|
inodes = map[inode]struct{}{} // expensive!
|
|
)
|
|
|
|
for _, root := range roots {
|
|
if err := filepath.Walk(root, func(path string, fi os.FileInfo, err error) error {
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
stat := fi.Sys().(*syscall.Stat_t)
|
|
|
|
inoKey := inode{dev: uint64(stat.Dev), ino: uint64(stat.Ino)}
|
|
if _, ok := inodes[inoKey]; !ok {
|
|
inodes[inoKey] = struct{}{}
|
|
size += fi.Size()
|
|
}
|
|
|
|
return nil
|
|
}); err != nil {
|
|
return Usage{}, err
|
|
}
|
|
}
|
|
|
|
return Usage{
|
|
Inodes: int64(len(inodes)),
|
|
Size: size,
|
|
}, nil
|
|
}
|
|
|
|
func diffUsage(ctx context.Context, a, b string) (Usage, error) {
|
|
var (
|
|
size int64
|
|
inodes = map[inode]struct{}{} // expensive!
|
|
)
|
|
|
|
if err := Changes(ctx, a, b, func(kind ChangeKind, _ string, fi os.FileInfo, err error) error {
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
if kind == ChangeKindAdd || kind == ChangeKindModify {
|
|
stat := fi.Sys().(*syscall.Stat_t)
|
|
|
|
inoKey := inode{dev: uint64(stat.Dev), ino: uint64(stat.Ino)}
|
|
if _, ok := inodes[inoKey]; !ok {
|
|
inodes[inoKey] = struct{}{}
|
|
size += fi.Size()
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
return nil
|
|
}); err != nil {
|
|
return Usage{}, err
|
|
}
|
|
|
|
return Usage{
|
|
Inodes: int64(len(inodes)),
|
|
Size: size,
|
|
}, nil
|
|
}
|