185 lines
5.4 KiB
Go
185 lines
5.4 KiB
Go
|
// Copyright (C) 2020 Storj Labs, Inc.
|
||
|
// See LICENSE for copying information.
|
||
|
|
||
|
package metabase_test
|
||
|
|
||
|
import (
|
||
|
"sort"
|
||
|
"testing"
|
||
|
"time"
|
||
|
|
||
|
"storj.io/common/testcontext"
|
||
|
"storj.io/common/uuid"
|
||
|
"storj.io/storj/satellite/metainfo/metabase"
|
||
|
)
|
||
|
|
||
|
func TestIterateObjects(t *testing.T) {
|
||
|
All(t, func(ctx *testcontext.Context, t *testing.T, db *metabase.DB) {
|
||
|
t.Run("BucketName missing", func(t *testing.T) {
|
||
|
defer DeleteAll{}.Check(ctx, t, db)
|
||
|
IterateObjects{
|
||
|
Opts: metabase.IterateObjects{
|
||
|
ProjectID: uuid.UUID{1},
|
||
|
BucketName: "",
|
||
|
Recursive: true,
|
||
|
},
|
||
|
ErrClass: &metabase.ErrInvalidRequest,
|
||
|
ErrText: "BucketName missing",
|
||
|
}.Check(ctx, t, db)
|
||
|
Verify{}.Check(ctx, t, db)
|
||
|
})
|
||
|
t.Run("ProjectID missing", func(t *testing.T) {
|
||
|
defer DeleteAll{}.Check(ctx, t, db)
|
||
|
IterateObjects{
|
||
|
Opts: metabase.IterateObjects{
|
||
|
ProjectID: uuid.UUID{},
|
||
|
BucketName: "sj://mybucket",
|
||
|
Recursive: true,
|
||
|
},
|
||
|
ErrClass: &metabase.ErrInvalidRequest,
|
||
|
ErrText: "ProjectID missing",
|
||
|
}.Check(ctx, t, db)
|
||
|
Verify{}.Check(ctx, t, db)
|
||
|
})
|
||
|
t.Run("Limit is negative", func(t *testing.T) {
|
||
|
defer DeleteAll{}.Check(ctx, t, db)
|
||
|
IterateObjects{
|
||
|
Opts: metabase.IterateObjects{
|
||
|
ProjectID: uuid.UUID{1},
|
||
|
BucketName: "mybucket",
|
||
|
BatchSize: -1,
|
||
|
Recursive: true,
|
||
|
},
|
||
|
ErrClass: &metabase.ErrInvalidRequest,
|
||
|
ErrText: "BatchSize is negative",
|
||
|
}.Check(ctx, t, db)
|
||
|
Verify{}.Check(ctx, t, db)
|
||
|
})
|
||
|
|
||
|
t.Run("List empty bucket", func(t *testing.T) {
|
||
|
defer DeleteAll{}.Check(ctx, t, db)
|
||
|
objects := createObjects(ctx, t, db, 2, uuid.UUID{1}, "mybucket")
|
||
|
IterateObjects{
|
||
|
Opts: metabase.IterateObjects{
|
||
|
ProjectID: uuid.UUID{1},
|
||
|
BucketName: "myemptybucket",
|
||
|
BatchSize: 10,
|
||
|
Recursive: true,
|
||
|
},
|
||
|
Result: nil,
|
||
|
}.Check(ctx, t, db)
|
||
|
Verify{Objects: objects}.Check(ctx, t, db)
|
||
|
})
|
||
|
|
||
|
t.Run("List less objects than limit", func(t *testing.T) {
|
||
|
defer DeleteAll{}.Check(ctx, t, db)
|
||
|
numberOfObjects := 3
|
||
|
limit := 10
|
||
|
expected := make([]metabase.ObjectEntry, numberOfObjects)
|
||
|
objects := createObjects(ctx, t, db, numberOfObjects, uuid.UUID{1}, "mybucket")
|
||
|
for i, obj := range objects {
|
||
|
expected[i] = metabase.ObjectEntry(obj)
|
||
|
}
|
||
|
IterateObjects{
|
||
|
Opts: metabase.IterateObjects{
|
||
|
ProjectID: uuid.UUID{1},
|
||
|
BucketName: "mybucket",
|
||
|
Recursive: true,
|
||
|
BatchSize: limit,
|
||
|
},
|
||
|
Result: expected,
|
||
|
}.Check(ctx, t, db)
|
||
|
Verify{Objects: objects}.Check(ctx, t, db)
|
||
|
})
|
||
|
|
||
|
t.Run("List more objects than limit", func(t *testing.T) {
|
||
|
defer DeleteAll{}.Check(ctx, t, db)
|
||
|
numberOfObjects := 10
|
||
|
limit := 3
|
||
|
expected := make([]metabase.ObjectEntry, numberOfObjects)
|
||
|
objects := createObjects(ctx, t, db, numberOfObjects, uuid.UUID{1}, "mybucket")
|
||
|
for i, obj := range objects {
|
||
|
expected[i] = metabase.ObjectEntry(obj)
|
||
|
}
|
||
|
IterateObjects{
|
||
|
Opts: metabase.IterateObjects{
|
||
|
ProjectID: uuid.UUID{1},
|
||
|
BucketName: "mybucket",
|
||
|
Recursive: true,
|
||
|
BatchSize: limit,
|
||
|
},
|
||
|
Result: expected,
|
||
|
}.Check(ctx, t, db)
|
||
|
Verify{Objects: objects}.Check(ctx, t, db)
|
||
|
})
|
||
|
|
||
|
t.Run("List objects in one bucket in project with 2 buckets", func(t *testing.T) {
|
||
|
defer DeleteAll{}.Check(ctx, t, db)
|
||
|
numberOfObjectsPerBucket := 5
|
||
|
batchSize := 10
|
||
|
expected := make([]metabase.ObjectEntry, numberOfObjectsPerBucket)
|
||
|
objectsBucketA := createObjects(ctx, t, db, numberOfObjectsPerBucket, uuid.UUID{1}, "bucket-a")
|
||
|
objectsBucketB := createObjects(ctx, t, db, numberOfObjectsPerBucket, uuid.UUID{1}, "bucket-b")
|
||
|
for i, obj := range objectsBucketA {
|
||
|
expected[i] = metabase.ObjectEntry(obj)
|
||
|
}
|
||
|
IterateObjects{
|
||
|
Opts: metabase.IterateObjects{
|
||
|
ProjectID: uuid.UUID{1},
|
||
|
BucketName: "bucket-a",
|
||
|
Recursive: true,
|
||
|
BatchSize: batchSize,
|
||
|
},
|
||
|
Result: expected,
|
||
|
}.Check(ctx, t, db)
|
||
|
Verify{Objects: append(objectsBucketA, objectsBucketB...)}.Check(ctx, t, db)
|
||
|
})
|
||
|
|
||
|
t.Run("List objects in one bucket with same bucketName in another project", func(t *testing.T) {
|
||
|
defer DeleteAll{}.Check(ctx, t, db)
|
||
|
numberOfObjectsPerBucket := 5
|
||
|
batchSize := 10
|
||
|
expected := make([]metabase.ObjectEntry, numberOfObjectsPerBucket)
|
||
|
objectsProject1 := createObjects(ctx, t, db, numberOfObjectsPerBucket, uuid.UUID{1}, "mybucket")
|
||
|
objectsProject2 := createObjects(ctx, t, db, numberOfObjectsPerBucket, uuid.UUID{2}, "mybucket")
|
||
|
for i, obj := range objectsProject1 {
|
||
|
expected[i] = metabase.ObjectEntry(obj)
|
||
|
}
|
||
|
IterateObjects{
|
||
|
Opts: metabase.IterateObjects{
|
||
|
ProjectID: uuid.UUID{1},
|
||
|
BucketName: "mybucket",
|
||
|
Recursive: true,
|
||
|
BatchSize: batchSize,
|
||
|
},
|
||
|
Result: expected,
|
||
|
}.Check(ctx, t, db)
|
||
|
Verify{Objects: append(objectsProject1, objectsProject2...)}.Check(ctx, t, db)
|
||
|
})
|
||
|
})
|
||
|
}
|
||
|
|
||
|
func createObjects(ctx *testcontext.Context, t *testing.T, db *metabase.DB, numberOfObjects int, projectID uuid.UUID, bucketName string) []metabase.RawObject {
|
||
|
|
||
|
objects := make([]metabase.RawObject, numberOfObjects)
|
||
|
for i := 0; i < numberOfObjects; i++ {
|
||
|
obj := randObjectStream()
|
||
|
obj.ProjectID = projectID
|
||
|
obj.BucketName = bucketName
|
||
|
now := time.Now()
|
||
|
|
||
|
createObject(ctx, t, db, obj, 0)
|
||
|
|
||
|
objects[i] = metabase.RawObject{
|
||
|
ObjectStream: obj,
|
||
|
CreatedAt: now,
|
||
|
Status: metabase.Committed,
|
||
|
Encryption: defaultTestEncryption,
|
||
|
}
|
||
|
}
|
||
|
sort.SliceStable(objects, func(i, j int) bool {
|
||
|
return objects[i].ObjectKey < objects[j].ObjectKey
|
||
|
})
|
||
|
return objects
|
||
|
}
|