mirror of
https://github.com/chrislusf/seaweedfs
synced 2024-08-20 00:30:52 +02:00
104 lines
3.6 KiB
Go
104 lines
3.6 KiB
Go
package filer
|
|
|
|
import (
|
|
"context"
|
|
"github.com/chrislusf/seaweedfs/weed/util"
|
|
"math"
|
|
"path/filepath"
|
|
"strings"
|
|
)
|
|
|
|
func splitPattern(pattern string) (prefix string, restPattern string) {
|
|
position := strings.Index(pattern, "*")
|
|
if position >= 0 {
|
|
return pattern[:position], pattern[position:]
|
|
}
|
|
position = strings.Index(pattern, "?")
|
|
if position >= 0 {
|
|
return pattern[:position], pattern[position:]
|
|
}
|
|
return "", restPattern
|
|
}
|
|
|
|
// For now, prefix and namePattern are mutually exclusive
|
|
func (f *Filer) ListDirectoryEntries(ctx context.Context, p util.FullPath, startFileName string, inclusive bool, limit int64, prefix string, namePattern string, namePatternExclude string) (entries []*Entry, hasMore bool, err error) {
|
|
|
|
if limit > math.MaxInt32-1 {
|
|
limit = math.MaxInt32 - 1
|
|
}
|
|
|
|
_, err = f.StreamListDirectoryEntries(ctx, p, startFileName, inclusive, limit+1, prefix, namePattern, namePatternExclude, func(entry *Entry) bool {
|
|
entries = append(entries, entry)
|
|
return true
|
|
})
|
|
|
|
hasMore = int64(len(entries)) >= limit+1
|
|
if hasMore {
|
|
entries = entries[:limit]
|
|
}
|
|
|
|
return entries, hasMore, err
|
|
}
|
|
|
|
// For now, prefix and namePattern are mutually exclusive
|
|
func (f *Filer) StreamListDirectoryEntries(ctx context.Context, p util.FullPath, startFileName string, inclusive bool, limit int64, prefix string, namePattern string, namePatternExclude string, eachEntryFunc ListEachEntryFunc) (lastFileName string, err error) {
|
|
if strings.HasSuffix(string(p), "/") && len(p) > 1 {
|
|
p = p[0 : len(p)-1]
|
|
}
|
|
|
|
prefixInNamePattern, restNamePattern := splitPattern(namePattern)
|
|
if prefixInNamePattern != "" {
|
|
prefix = prefixInNamePattern
|
|
}
|
|
var missedCount int64
|
|
|
|
missedCount, lastFileName, err = f.doListPatternMatchedEntries(ctx, p, startFileName, inclusive, limit, prefix, restNamePattern, namePatternExclude, eachEntryFunc)
|
|
|
|
for missedCount > 0 && err == nil {
|
|
missedCount, lastFileName, err = f.doListPatternMatchedEntries(ctx, p, lastFileName, false, missedCount, prefix, restNamePattern, namePatternExclude, eachEntryFunc)
|
|
}
|
|
|
|
return
|
|
}
|
|
|
|
func (f *Filer) doListPatternMatchedEntries(ctx context.Context, p util.FullPath, startFileName string, inclusive bool, limit int64, prefix, restNamePattern string, namePatternExclude string, eachEntryFunc ListEachEntryFunc) (missedCount int64, lastFileName string, err error) {
|
|
|
|
if len(restNamePattern) == 0 && len(namePatternExclude) == 0 {
|
|
lastFileName, err = f.doListValidEntries(ctx, p, startFileName, inclusive, limit, prefix, eachEntryFunc)
|
|
return 0, lastFileName, err
|
|
}
|
|
|
|
lastFileName, err = f.doListValidEntries(ctx, p, startFileName, inclusive, limit, prefix, func(entry *Entry) bool {
|
|
nameToTest := entry.Name()
|
|
if len(namePatternExclude) > 0 {
|
|
if matched, matchErr := filepath.Match(namePatternExclude, nameToTest); matchErr == nil && matched {
|
|
missedCount++
|
|
return true
|
|
}
|
|
}
|
|
if len(restNamePattern) > 0 {
|
|
if matched, matchErr := filepath.Match(restNamePattern, nameToTest[len(prefix):]); matchErr == nil && !matched {
|
|
missedCount++
|
|
return true
|
|
}
|
|
}
|
|
if !eachEntryFunc(entry) {
|
|
return false
|
|
}
|
|
return true
|
|
})
|
|
if err != nil {
|
|
return
|
|
}
|
|
return
|
|
}
|
|
|
|
func (f *Filer) doListValidEntries(ctx context.Context, p util.FullPath, startFileName string, inclusive bool, limit int64, prefix string, eachEntryFunc ListEachEntryFunc) (lastFileName string, err error) {
|
|
var expiredCount int64
|
|
expiredCount, lastFileName, err = f.doListDirectoryEntries(ctx, p, startFileName, inclusive, limit, prefix, eachEntryFunc)
|
|
for expiredCount > 0 && err == nil {
|
|
expiredCount, lastFileName, err = f.doListDirectoryEntries(ctx, p, lastFileName, false, expiredCount, prefix, eachEntryFunc)
|
|
}
|
|
return
|
|
}
|