command_fs_tree.go 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118
  1. package shell
  2. import (
  3. "context"
  4. "fmt"
  5. "io"
  6. "strings"
  7. "github.com/seaweedfs/seaweedfs/weed/pb/filer_pb"
  8. "github.com/seaweedfs/seaweedfs/weed/util"
  9. )
  10. func init() {
  11. Commands = append(Commands, &commandFsTree{})
  12. }
  13. type commandFsTree struct {
  14. }
  15. func (c *commandFsTree) Name() string {
  16. return "fs.tree"
  17. }
  18. func (c *commandFsTree) Help() string {
  19. return `recursively list all files under a directory
  20. fs.tree /some/dir
  21. `
  22. }
  23. func (c *commandFsTree) HasTag(CommandTag) bool {
  24. return false
  25. }
  26. func (c *commandFsTree) Do(args []string, commandEnv *CommandEnv, writer io.Writer) (err error) {
  27. path, err := commandEnv.parseUrl(findInputDirectory(args))
  28. if err != nil {
  29. return err
  30. }
  31. dir, name := util.FullPath(path).DirAndName()
  32. dirCount, fCount, terr := treeTraverseDirectory(writer, commandEnv, util.FullPath(dir), name, newPrefix(), -1)
  33. if terr == nil {
  34. fmt.Fprintf(writer, "%d directories, %d files\n", dirCount, fCount)
  35. }
  36. return terr
  37. }
  38. func treeTraverseDirectory(writer io.Writer, filerClient filer_pb.FilerClient, dir util.FullPath, name string, prefix *Prefix, level int) (directoryCount, fileCount int64, err error) {
  39. prefix.addMarker(level)
  40. err = filer_pb.ReadDirAllEntries(context.Background(), filerClient, dir, name, func(entry *filer_pb.Entry, isLast bool) error {
  41. if level < 0 && name != "" {
  42. if entry.Name != name {
  43. return nil
  44. }
  45. }
  46. fmt.Fprintf(writer, "%s%s\n", prefix.getPrefix(level, isLast), entry.Name)
  47. if entry.IsDirectory {
  48. directoryCount++
  49. subDir := dir.Child(entry.Name)
  50. dirCount, fCount, terr := treeTraverseDirectory(writer, filerClient, subDir, "", prefix, level+1)
  51. directoryCount += dirCount
  52. fileCount += fCount
  53. err = terr
  54. } else {
  55. fileCount++
  56. }
  57. return nil
  58. })
  59. return
  60. }
  61. type Prefix struct {
  62. markers map[int]bool
  63. }
  64. func newPrefix() *Prefix {
  65. return &Prefix{
  66. markers: make(map[int]bool),
  67. }
  68. }
  69. func (p *Prefix) addMarker(marker int) {
  70. p.markers[marker] = true
  71. }
  72. func (p *Prefix) removeMarker(marker int) {
  73. delete(p.markers, marker)
  74. }
  75. func (p *Prefix) getPrefix(level int, isLastChild bool) string {
  76. var sb strings.Builder
  77. if level < 0 {
  78. return ""
  79. }
  80. for i := 0; i < level; i++ {
  81. if _, ok := p.markers[i]; ok {
  82. sb.WriteString("│")
  83. } else {
  84. sb.WriteString(" ")
  85. }
  86. sb.WriteString(" ")
  87. }
  88. if isLastChild {
  89. sb.WriteString("└──")
  90. p.removeMarker(level)
  91. } else {
  92. sb.WriteString("├──")
  93. }
  94. return sb.String()
  95. }