// Package scan does concurrent scanning of an Fs building up a directory tree. package scan import ( "path" "sync" "github.com/ncw/rclone/fs" "github.com/pkg/errors" ) // Dir represents a directory found in the remote type Dir struct { parent *Dir path string mu sync.Mutex count int64 size int64 complete bool entries fs.DirEntries dirs map[string]*Dir offset int // current listing offset entry int // current listing entry } // Parent returns the directory above this one func (d *Dir) Parent() *Dir { // no locking needed since these are write once in newDir() return d.parent } // Path returns the position of the dir in the filesystem func (d *Dir) Path() string { // no locking needed since these are write once in newDir() return d.path } // make a new directory func newDir(parent *Dir, dirPath string, entries fs.DirEntries) *Dir { d := &Dir{ parent: parent, path: dirPath, entries: entries, dirs: make(map[string]*Dir), } // Count size in this dir for _, entry := range entries { if o, ok := entry.(fs.Object); ok { d.count++ d.size += o.Size() } } // Set my directory entry in parent if parent != nil { parent.mu.Lock() leaf := path.Base(dirPath) d.parent.dirs[leaf] = d parent.mu.Unlock() } // Accumulate counts in parents for ; parent != nil; parent = parent.parent { parent.mu.Lock() parent.count += d.count parent.size += d.size parent.mu.Unlock() } return d } // Entries returns a copy of the entries in the directory func (d *Dir) Entries() fs.DirEntries { return append(fs.DirEntries(nil), d.entries...) } // gets the directory of the i-th entry // // returns nil if it is a file // returns a flag as to whether is directory or not // // Call with d.mu held func (d *Dir) getDir(i int) (subDir *Dir, isDir bool) { obj := d.entries[i] dir, ok := obj.(fs.Directory) if !ok { return nil, false } leaf := path.Base(dir.Remote()) subDir = d.dirs[leaf] return subDir, true } // GetDir returns the Dir of the i-th entry // // returns nil if it is a file // returns a flag as to whether is directory or not func (d *Dir) GetDir(i int) (subDir *Dir, isDir bool) { d.mu.Lock() defer d.mu.Unlock() return d.getDir(i) } // Attr returns the size and count for the directory func (d *Dir) Attr() (size int64, count int64) { d.mu.Lock() defer d.mu.Unlock() return d.size, d.count } // AttrI returns the size, count and flags for the i-th directory entry func (d *Dir) AttrI(i int) (size int64, count int64, isDir bool, readable bool) { d.mu.Lock() defer d.mu.Unlock() subDir, isDir := d.getDir(i) if !isDir { return d.entries[i].Size(), 0, false, true } if subDir == nil { return 0, 0, true, false } size, count = subDir.Attr() return size, count, true, true } // Scan the Fs passed in, returning a root directory channel and an // error channel func Scan(f fs.Fs) (chan *Dir, chan error, chan struct{}) { root := make(chan *Dir, 1) errChan := make(chan error, 1) updated := make(chan struct{}, 1) go func() { parents := map[string]*Dir{} err := fs.Walk(f, "", false, fs.Config.MaxDepth, func(dirPath string, entries fs.DirEntries, err error) error { if err != nil { return err // FIXME mark directory as errored instead of aborting } var parent *Dir if dirPath != "" { parentPath := path.Dir(dirPath) if parentPath == "." { parentPath = "" } var ok bool parent, ok = parents[parentPath] if !ok { errChan <- errors.Errorf("couldn't find parent for %q", dirPath) } } d := newDir(parent, dirPath, entries) parents[dirPath] = d if dirPath == "" { root <- d } // Mark updated select { case updated <- struct{}{}: default: break } return nil }) if err != nil { errChan <- errors.Wrap(err, "ncdu listing failed") } errChan <- nil }() return root, errChan, updated }