1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
package shell
import (
"context"
"fmt"
"github.com/chrislusf/seaweedfs/weed/filer2"
"github.com/chrislusf/seaweedfs/weed/pb/filer_pb"
"io"
"strings"
)
func init() {
commands = append(commands, &commandFsTree{})
}
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 http://<filer_server>:<port>/dir/
`
}
func (c *commandFsTree) Do(args []string, commandEnv *commandEnv, writer io.Writer) (err error) {
filerServer, filerPort, path, err := parseFilerUrl(args[len(args)-1])
if err != nil {
return err
}
dir, name := filer2.FullPath(path).DirAndName()
if strings.HasSuffix(path, "/") {
if path == "/" {
dir, name = "/", ""
} else {
dir, name = path[0 : len(path)-1], ""
}
}
ctx := context.Background()
return commandEnv.withFilerClient(ctx, filerServer, filerPort, func(client filer_pb.SeaweedFilerClient) error {
return treeTraverseDirectory(ctx, writer, client, dir, name, 1000, newPrefix(), 0)
})
}
func treeTraverseDirectory(ctx context.Context, writer io.Writer, client filer_pb.SeaweedFilerClient, dir, name string, paginateSize int, prefix *Prefix, level int) (err error) {
paginatedCount := -1
startFromFileName := ""
for paginatedCount == -1 || paginatedCount == paginateSize {
resp, listErr := client.ListEntries(ctx, &filer_pb.ListEntriesRequest{
Directory: dir,
Prefix: name,
StartFromFileName: startFromFileName,
InclusiveStartFrom: false,
Limit: uint32(paginateSize),
})
if listErr != nil {
err = listErr
return
}
paginatedCount = len(resp.Entries)
if paginatedCount > 0 {
prefix.addMarker(level)
}
for i, entry := range resp.Entries {
// 0.1% wrong prefix here, but fixing it would need to paginate to the next batch first
isLast := paginatedCount < paginateSize && i == paginatedCount-1
fmt.Fprintf(writer, "%s%s\n", prefix.getPrefix(level, isLast), entry.Name)
if entry.IsDirectory {
subDir := fmt.Sprintf("%s/%s", dir, entry.Name)
if dir == "/" {
subDir = "/" + entry.Name
}
err = treeTraverseDirectory(ctx, writer, client, subDir, "", paginateSize, prefix, level+1)
} else {
}
startFromFileName = entry.Name
}
}
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
for i := 0; i < level; i++ {
if _, ok := p.markers[i]; ok {
sb.WriteString("│")
} else {
sb.WriteString(" ")
}
sb.WriteString(" ")
}
if isLastChild {
sb.WriteString("└──")
p.removeMarker(level);
} else {
sb.WriteString("├──")
}
return sb.String()
}
|
