You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

125 lines
2.8 KiB

6 years ago
6 years ago
  1. package shell
  2. import (
  3. "context"
  4. "fmt"
  5. "github.com/chrislusf/seaweedfs/weed/filer2"
  6. "github.com/chrislusf/seaweedfs/weed/pb/filer_pb"
  7. "io"
  8. "strings"
  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 http://<filer_server>:<port>/dir/
  21. `
  22. }
  23. func (c *commandFsTree) Do(args []string, commandEnv *commandEnv, writer io.Writer) (err error) {
  24. filerServer, filerPort, path, err := commandEnv.parseUrl(findInputDirectory(args))
  25. if err != nil {
  26. return err
  27. }
  28. dir, name := filer2.FullPath(path).DirAndName()
  29. ctx := context.Background()
  30. return commandEnv.withFilerClient(ctx, filerServer, filerPort, func(client filer_pb.SeaweedFilerClient) error {
  31. return treeTraverseDirectory(ctx, writer, client, dir, name, 1000, newPrefix(), 0)
  32. })
  33. }
  34. func treeTraverseDirectory(ctx context.Context, writer io.Writer, client filer_pb.SeaweedFilerClient, dir, name string, paginateSize int, prefix *Prefix, level int) (err error) {
  35. paginatedCount := -1
  36. startFromFileName := ""
  37. for paginatedCount == -1 || paginatedCount == paginateSize {
  38. resp, listErr := client.ListEntries(ctx, &filer_pb.ListEntriesRequest{
  39. Directory: dir,
  40. Prefix: name,
  41. StartFromFileName: startFromFileName,
  42. InclusiveStartFrom: false,
  43. Limit: uint32(paginateSize),
  44. })
  45. if listErr != nil {
  46. err = listErr
  47. return
  48. }
  49. paginatedCount = len(resp.Entries)
  50. if paginatedCount > 0 {
  51. prefix.addMarker(level)
  52. }
  53. for i, entry := range resp.Entries {
  54. // 0.1% wrong prefix here, but fixing it would need to paginate to the next batch first
  55. isLast := paginatedCount < paginateSize && i == paginatedCount-1
  56. fmt.Fprintf(writer, "%s%s\n", prefix.getPrefix(level, isLast), entry.Name)
  57. if entry.IsDirectory {
  58. subDir := fmt.Sprintf("%s/%s", dir, entry.Name)
  59. if dir == "/" {
  60. subDir = "/" + entry.Name
  61. }
  62. err = treeTraverseDirectory(ctx, writer, client, subDir, "", paginateSize, prefix, level+1)
  63. } else {
  64. }
  65. startFromFileName = entry.Name
  66. }
  67. }
  68. return
  69. }
  70. type Prefix struct {
  71. markers map[int]bool
  72. }
  73. func newPrefix() *Prefix {
  74. return &Prefix{
  75. markers: make(map[int]bool),
  76. }
  77. }
  78. func (p *Prefix) addMarker(marker int) {
  79. p.markers[marker] = true
  80. }
  81. func (p *Prefix) removeMarker(marker int) {
  82. delete(p.markers, marker)
  83. }
  84. func (p *Prefix) getPrefix(level int, isLastChild bool) string {
  85. var sb strings.Builder
  86. for i := 0; i < level; i++ {
  87. if _, ok := p.markers[i]; ok {
  88. sb.WriteString("│")
  89. } else {
  90. sb.WriteString(" ")
  91. }
  92. sb.WriteString(" ")
  93. }
  94. if isLastChild {
  95. sb.WriteString("└──")
  96. p.removeMarker(level)
  97. } else {
  98. sb.WriteString("├──")
  99. }
  100. return sb.String()
  101. }