package restic import ( "path/filepath" "github.com/restic/restic/backend" "github.com/restic/restic/debug" "github.com/restic/restic/repository" ) type WalkTreeJob struct { Path string Error error Node *Node Tree *Tree } func walkTree(repo *repository.Repository, path string, treeID backend.ID, done chan struct{}, jobCh chan<- WalkTreeJob) { debug.Log("walkTree", "start on %q (%v)", path, treeID.Str()) t, err := LoadTree(repo, treeID) if err != nil { select { case jobCh <- WalkTreeJob{Path: path, Error: err}: case <-done: return } return } for _, node := range t.Nodes { p := filepath.Join(path, node.Name) if node.Type == "dir" { walkTree(repo, p, node.Subtree, done, jobCh) } else { select { case jobCh <- WalkTreeJob{Path: p, Node: node}: case <-done: return } } } select { case jobCh <- WalkTreeJob{Path: path, Tree: t}: case <-done: return } debug.Log("walkTree", "done for %q (%v)", path, treeID.Str()) } // WalkTree walks the tree specified by id recursively and sends a job for each // file and directory it finds. When the channel done is closed, processing // stops. func WalkTree(repo *repository.Repository, id backend.ID, done chan struct{}, jobCh chan<- WalkTreeJob) { debug.Log("WalkTree", "start on %v", id.Str()) walkTree(repo, "", id, done, jobCh) close(jobCh) debug.Log("WalkTree", "done") }