mirror of
https://github.com/minio/minio.git
synced 2024-12-24 06:05:55 -05:00
fb96779a8a
This PR implements an object layer which combines input erasure sets of XL layers into a unified namespace. This object layer extends the existing erasure coded implementation, it is assumed in this design that providing > 16 disks is a static configuration as well i.e if you started the setup with 32 disks with 4 sets 8 disks per pack then you would need to provide 4 sets always. Some design details and restrictions: - Objects are distributed using consistent ordering to a unique erasure coded layer. - Each pack has its own dsync so locks are synchronized properly at pack (erasure layer). - Each pack still has a maximum of 16 disks requirement, you can start with multiple such sets statically. - Static sets set of disks and cannot be changed, there is no elastic expansion allowed. - Static sets set of disks and cannot be changed, there is no elastic removal allowed. - ListObjects() across sets can be noticeably slower since List happens on all servers, and is merged at this sets layer. Fixes #5465 Fixes #5464 Fixes #5461 Fixes #5460 Fixes #5459 Fixes #5458 Fixes #5460 Fixes #5488 Fixes #5489 Fixes #5497 Fixes #5496
245 lines
3.6 KiB
Go
245 lines
3.6 KiB
Go
/*
|
|
* Minio Cloud Storage, (C) 2018 Minio, Inc.
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
package ellipses
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
)
|
|
|
|
// Test tests args with ellipses.
|
|
func TestHasEllipses(t *testing.T) {
|
|
testCases := []struct {
|
|
args []string
|
|
expectedOk bool
|
|
}{
|
|
// Tests for all args without ellipses.
|
|
{
|
|
[]string{"64"},
|
|
false,
|
|
},
|
|
// Found flower braces, still attempt to parse and throw an error.
|
|
{
|
|
[]string{"{1..64}"},
|
|
true,
|
|
},
|
|
{
|
|
[]string{"{1..2..}"},
|
|
true,
|
|
},
|
|
// Test for valid input.
|
|
{
|
|
[]string{"1...64"},
|
|
true,
|
|
},
|
|
{
|
|
[]string{"{1...2O}"},
|
|
true,
|
|
},
|
|
{
|
|
[]string{"..."},
|
|
true,
|
|
},
|
|
{
|
|
[]string{"{-1...1}"},
|
|
true,
|
|
},
|
|
{
|
|
[]string{"{0...-1}"},
|
|
true,
|
|
},
|
|
{
|
|
[]string{"{1....4}"},
|
|
true,
|
|
},
|
|
{
|
|
[]string{"{1...64}"},
|
|
true,
|
|
},
|
|
{
|
|
[]string{"{...}"},
|
|
true,
|
|
},
|
|
{
|
|
[]string{"{1...64}", "{65...128}"},
|
|
true,
|
|
},
|
|
{
|
|
[]string{"http://minio{2...3}/export/set{1...64}"},
|
|
true,
|
|
},
|
|
{
|
|
[]string{
|
|
"http://minio{2...3}/export/set{1...64}",
|
|
"http://minio{2...3}/export/set{65...128}",
|
|
},
|
|
true,
|
|
},
|
|
{
|
|
[]string{
|
|
"mydisk-{a...z}{1...20}",
|
|
},
|
|
true,
|
|
},
|
|
{
|
|
[]string{
|
|
"mydisk-{1...4}{1..2.}",
|
|
},
|
|
true,
|
|
},
|
|
}
|
|
|
|
for i, testCase := range testCases {
|
|
t.Run(fmt.Sprintf("Test%d", i+1), func(t *testing.T) {
|
|
gotOk := HasEllipses(testCase.args...)
|
|
if gotOk != testCase.expectedOk {
|
|
t.Errorf("Expected %t, got %t", testCase.expectedOk, gotOk)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
// Test tests find ellipses patterns.
|
|
func TestFindEllipsesPatterns(t *testing.T) {
|
|
testCases := []struct {
|
|
pattern string
|
|
success bool
|
|
expectedCount int
|
|
}{
|
|
// Tests for all invalid inputs
|
|
{
|
|
"{1..64}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"1...64",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"...",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"{1...",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"...64}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"{...}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"{-1...1}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"{0...-1}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"{1...2O}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"{64...1}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"{1....4}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"mydisk-{a...z}{1...20}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"mydisk-{1...4}{1..2.}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"{1..2.}-mydisk-{1...4}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"{{1...4}}",
|
|
false,
|
|
0,
|
|
},
|
|
{
|
|
"{4...02}",
|
|
false,
|
|
0,
|
|
},
|
|
// Test for valid input.
|
|
{
|
|
"{1...64}",
|
|
true,
|
|
64,
|
|
},
|
|
{
|
|
"{1...64} {65...128}",
|
|
true,
|
|
4096,
|
|
},
|
|
{
|
|
"{01...036}",
|
|
true,
|
|
36,
|
|
},
|
|
{
|
|
"{001...036}",
|
|
true,
|
|
36,
|
|
},
|
|
}
|
|
|
|
for i, testCase := range testCases {
|
|
t.Run(fmt.Sprintf("Test%d", i+1), func(t *testing.T) {
|
|
argP, err := FindEllipsesPatterns(testCase.pattern)
|
|
if err != nil && testCase.success {
|
|
t.Errorf("Expected success but failed instead %s", err)
|
|
}
|
|
if err == nil && !testCase.success {
|
|
t.Errorf("Expected failure but passed instead")
|
|
}
|
|
if err == nil {
|
|
gotCount := len(argP.Expand())
|
|
if gotCount != testCase.expectedCount {
|
|
t.Errorf("Expected %d, got %d", testCase.expectedCount, gotCount)
|
|
}
|
|
}
|
|
})
|
|
}
|
|
}
|