seaweedfs/weed/shell/command_fs_tree.go

118 lines
2.4 KiB
Go
Raw Normal View History

2019-03-28 15:05:04 +08:00
package shell
import (
"fmt"
"io"
"strings"
2019-12-13 16:22:37 +08:00
"github.com/seaweedfs/seaweedfs/weed/pb/filer_pb"
"github.com/seaweedfs/seaweedfs/weed/util"
2019-03-28 15:05:04 +08:00
)
func init() {
Commands = append(Commands, &commandFsTree{})
2019-03-28 15:05:04 +08:00
}
type commandFsTree struct {
}
func (c *commandFsTree) Name() string {
return "fs.tree"
}
func (c *commandFsTree) Help() string {
return `recursively list all files under a directory
fs.tree /some/dir
2019-03-28 15:05:04 +08:00
`
}
2024-09-30 01:38:22 +08:00
func (c *commandFsTree) HasTag(CommandTag) bool {
return false
}
func (c *commandFsTree) Do(args []string, commandEnv *CommandEnv, writer io.Writer) (err error) {
2019-03-28 15:05:04 +08:00
2020-03-24 12:26:15 +08:00
path, err := commandEnv.parseUrl(findInputDirectory(args))
2019-03-28 15:05:04 +08:00
if err != nil {
return err
}
2020-03-23 15:01:34 +08:00
dir, name := util.FullPath(path).DirAndName()
2019-03-28 15:05:04 +08:00
2020-03-24 12:26:15 +08:00
dirCount, fCount, terr := treeTraverseDirectory(writer, commandEnv, util.FullPath(dir), name, newPrefix(), -1)
2019-03-28 15:05:04 +08:00
2019-12-13 16:22:37 +08:00
if terr == nil {
fmt.Fprintf(writer, "%d directories, %d files\n", dirCount, fCount)
}
2019-03-28 15:05:04 +08:00
2019-12-13 16:22:37 +08:00
return terr
2019-03-28 15:05:04 +08:00
}
2020-03-23 15:01:34 +08:00
func treeTraverseDirectory(writer io.Writer, filerClient filer_pb.FilerClient, dir util.FullPath, name string, prefix *Prefix, level int) (directoryCount, fileCount int64, err error) {
2019-03-28 15:05:04 +08:00
2019-12-13 16:22:37 +08:00
prefix.addMarker(level)
2019-04-06 02:40:54 +08:00
err = filer_pb.ReadDirAllEntries(filerClient, dir, name, func(entry *filer_pb.Entry, isLast bool) error {
2019-12-13 16:22:37 +08:00
if level < 0 && name != "" {
if entry.Name != name {
return nil
2019-04-06 02:40:54 +08:00
}
2019-12-13 16:22:37 +08:00
}
2019-04-06 02:40:54 +08:00
2019-12-13 16:22:37 +08:00
fmt.Fprintf(writer, "%s%s\n", prefix.getPrefix(level, isLast), entry.Name)
2019-03-28 15:05:04 +08:00
2019-12-13 16:22:37 +08:00
if entry.IsDirectory {
directoryCount++
2020-01-20 15:59:46 +08:00
subDir := dir.Child(entry.Name)
2020-02-26 14:23:59 +08:00
dirCount, fCount, terr := treeTraverseDirectory(writer, filerClient, subDir, "", prefix, level+1)
2019-12-13 16:22:37 +08:00
directoryCount += dirCount
fileCount += fCount
err = terr
} else {
fileCount++
2019-03-28 15:05:04 +08:00
}
return nil
2019-12-13 16:22:37 +08:00
})
2019-03-28 15:05:04 +08:00
return
}
type Prefix struct {
markers map[int]bool
}
func newPrefix() *Prefix {
return &Prefix{
markers: make(map[int]bool),
}
}
func (p *Prefix) addMarker(marker int) {
p.markers[marker] = true
}
func (p *Prefix) removeMarker(marker int) {
delete(p.markers, marker)
}
func (p *Prefix) getPrefix(level int, isLastChild bool) string {
var sb strings.Builder
2019-04-06 02:40:54 +08:00
if level < 0 {
return ""
}
2019-03-28 15:05:04 +08:00
for i := 0; i < level; i++ {
if _, ok := p.markers[i]; ok {
sb.WriteString("│")
} else {
sb.WriteString(" ")
}
sb.WriteString(" ")
}
if isLastChild {
sb.WriteString("└──")
2019-03-31 14:09:16 +08:00
p.removeMarker(level)
2019-03-28 15:05:04 +08:00
} else {
sb.WriteString("├──")
}
return sb.String()
}