Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

List large directories as small batches #128

Merged
merged 3 commits into from
Jan 28, 2021
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
121 changes: 70 additions & 51 deletions pkg/meta/redis.go
Original file line number Diff line number Diff line change
Expand Up @@ -881,7 +881,7 @@ func (r *redisMeta) Mkdir(ctx Context, parent Ino, name string, mode uint16, cum

func (r *redisMeta) Create(ctx Context, parent Ino, name string, mode uint16, cumask uint16, inode *Ino, attr *Attr) syscall.Errno {
err := r.Mknod(ctx, parent, name, TypeFile, mode, cumask, 0, inode, attr)
if err == 0 {
if err == 0 && inode != nil {
r.Lock()
r.openFiles[*inode] = 1
r.Unlock()
Expand Down Expand Up @@ -1293,64 +1293,83 @@ func (r *redisMeta) Readdir(ctx Context, inode Ino, plus uint8, entries *[]*Entr
Attr: &Attr{Typ: TypeDirectory},
})
}
vals, err := r.rdb.HGetAll(ctx, r.entryKey(inode)).Result()
if err != nil {
return errno(err)
}
newEntries := make([]Entry, len(vals))
newAttrs := make([]Attr, len(newEntries))
var i int
for name, val := range vals {
typ, inode := r.parseEntry([]byte(val))
ent := newEntries[i]
ent.Inode = inode
ent.Name = []byte(name)
attr := newAttrs[i]
attr.Typ = typ
ent.Attr = &attr
*entries = append(*entries, &ent)
i++

var keys []string
var cursor uint64
var err error
for {
keys, cursor, err = r.rdb.HScan(ctx, r.entryKey(inode), cursor, "*", 10000).Result()
if err != nil {
return errno(err)
}
newEntries := make([]Entry, len(keys)/2)
newAttrs := make([]Attr, len(keys)/2)
for i := 0; i < len(keys); i += 2 {
typ, inode := r.parseEntry([]byte(keys[i+1]))
ent := &newEntries[i/2]
ent.Inode = inode
ent.Name = []byte(keys[i])
ent.Attr = &newAttrs[i/2]
ent.Attr.Typ = typ
*entries = append(*entries, ent)
}
if cursor == 0 {
break
}
}

if plus != 0 {
batchSize := 4096
if batchSize > len(*entries) {
batchSize = len(*entries)
}
nEntries := len(*entries)
indexCh := make(chan int, 10)
go func() {
for i := 0; i < nEntries; i += batchSize {
indexCh <- i
fillAttr := func(es []*Entry) error {
var keys = make([]string, len(es))
for i, e := range es {
keys[i] = r.inodeKey(e.Inode)
}
close(indexCh)
}()
var wg sync.WaitGroup
for i := 0; i < 2; i++ {
wg.Add(1)
go func() {
defer wg.Done()
keysBatch := make([]string, 0, batchSize)
for idx := range indexCh {
end := idx + batchSize
if end > len(*entries) {
end = len(*entries)
}
for _, e := range (*entries)[idx:end] {
keysBatch = append(keysBatch, r.inodeKey(e.Inode))
rs, err := r.rdb.MGet(ctx, keys...).Result()
if err != nil {
return err
}
for j, re := range rs {
if re != nil {
if a, ok := re.(string); ok {
r.parseAttr([]byte(a), es[j].Attr)
}
rs, _ := r.rdb.MGet(ctx, keysBatch...).Result()
for j, re := range rs {
if re != nil {
if a, ok := re.(string); ok {
r.parseAttr([]byte(a), (*entries)[idx+j].Attr)
}
}
}
return nil
}
batchSize := 4096
nEntries := len(*entries)
if nEntries <= batchSize {
err = fillAttr(*entries)
} else {
indexCh := make(chan []*Entry, 10)
var wg sync.WaitGroup
for i := 0; i < 2; i++ {
wg.Add(1)
go func() {
defer wg.Done()
for es := range indexCh {
e := fillAttr(es)
if e != nil {
err = e
break
}
}
keysBatch = keysBatch[:0]
}()
}
for i := 0; i < nEntries; i += batchSize {
if i+batchSize > nEntries {
indexCh <- (*entries)[i:]
} else {
indexCh <- (*entries)[i : i+batchSize]
}
}()
}
close(indexCh)
wg.Wait()
}
if err != nil {
return errno(err)
}
wg.Wait()
}
return 0
}
Expand Down
48 changes: 48 additions & 0 deletions pkg/meta/redis_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -423,3 +423,51 @@ func TestTruncateAndDelete(t *testing.T) {
t.Fatalf("number of chunks: %d != 1", len(keys))
}
}

func benchmarkReaddir(b *testing.B, n int) {
var conf RedisConfig
m, err := NewRedisMeta("redis://127.0.0.1/10", &conf)
if err != nil {
b.Logf("redis is not available: %s", err)
b.Skip()
}
ctx := Background
var inode Ino
dname := fmt.Sprintf("largedir%d", n)
var es []*Entry
if m.Lookup(ctx, 1, dname, &inode, nil) == 0 && m.Readdir(ctx, inode, 0, &es) == 0 && len(es) == n+2 {
} else {
_ = m.Rmr(ctx, 1, dname)
_ = m.Mkdir(ctx, 1, dname, 0755, 0, 0, &inode, nil)
for j := 0; j < n; j++ {
_ = m.Create(ctx, inode, fmt.Sprintf("d%d", j), 0755, 0, nil, nil)
}
}

b.ResetTimer()
for i := 0; i < b.N; i++ {
var entries []*Entry
if e := m.Readdir(ctx, inode, 1, &entries); e != 0 {
b.Fatalf("readdir: %s", e)
}
if len(entries) != n+2 {
b.Fatalf("files: %d != %d", len(entries), n+2)
}
}
}

func BenchmarkReaddir10(b *testing.B) {
benchmarkReaddir(b, 10)
}

func BenchmarkReaddir1k(b *testing.B) {
benchmarkReaddir(b, 1000)
}

func BenchmarkReaddir100k(b *testing.B) {
benchmarkReaddir(b, 100000)
}

func BenchmarkReaddir10m(b *testing.B) {
benchmarkReaddir(b, 10000000)
}