0eaf43120b
ClassifySegmentPieces uses custom set implementation instead map. Side note, for custom set implementation I also checked int8 bit set but it didn't give better performance so I used simpler implementation. Benchmark results (compared against part 2 optimization change): name old time/op new time/op delta RemoteSegment/healthy_segment-8 21.7µs ± 8% 15.4µs ±16% -29.38% (p=0.008 n=5+5) name old alloc/op new alloc/op delta RemoteSegment/healthy_segment-8 7.41kB ± 0% 1.87kB ± 0% -74.83% (p=0.000 n=5+4) name old allocs/op new allocs/op delta RemoteSegment/healthy_segment-8 150 ± 0% 130 ± 0% -13.33% (p=0.008 n=5+5) Change-Id: I21feca9ec6ac0a2558ac5ce8894451c54f69e52d
189 lines
6.3 KiB
Go
189 lines
6.3 KiB
Go
// Copyright (C) 2023 Storj Labs, Inc.
|
|
// See LICENSE for copying information.
|
|
|
|
package repair
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
|
|
"storj.io/common/identity/testidentity"
|
|
"storj.io/common/storj"
|
|
"storj.io/common/storj/location"
|
|
"storj.io/storj/satellite/metabase"
|
|
"storj.io/storj/satellite/nodeselection"
|
|
"storj.io/storj/satellite/overlay"
|
|
)
|
|
|
|
func TestClassifySegmentPieces(t *testing.T) {
|
|
getNodes := func(nodes []nodeselection.SelectedNode, pieces metabase.Pieces) (res []nodeselection.SelectedNode) {
|
|
for _, piece := range pieces {
|
|
for _, node := range nodes {
|
|
if node.ID == piece.StorageNode {
|
|
res = append(res, node)
|
|
break
|
|
}
|
|
}
|
|
|
|
}
|
|
return res
|
|
}
|
|
t.Run("all online", func(t *testing.T) {
|
|
var selectedNodes = generateNodes(5, func(ix int) bool {
|
|
return true
|
|
}, func(ix int, node *nodeselection.SelectedNode) {
|
|
|
|
})
|
|
|
|
c := &overlay.ConfigurablePlacementRule{}
|
|
require.NoError(t, c.Set(""))
|
|
parsed, err := c.Parse()
|
|
require.NoError(t, err)
|
|
|
|
pieces := createPieces(selectedNodes, 0, 1, 2, 3, 4)
|
|
result := ClassifySegmentPieces(pieces, getNodes(selectedNodes, pieces), map[location.CountryCode]struct{}{}, true, false, parsed.CreateFilters(0), piecesToNodeIDs(pieces))
|
|
|
|
require.Equal(t, 0, result.Missing.Size())
|
|
require.Equal(t, 0, result.Clumped.Size())
|
|
require.Equal(t, 0, result.OutOfPlacement.Size())
|
|
require.Equal(t, 0, result.UnhealthyRetrievable.Size())
|
|
})
|
|
|
|
t.Run("out of placement", func(t *testing.T) {
|
|
var selectedNodes = generateNodes(10, func(ix int) bool {
|
|
return true
|
|
}, func(ix int, node *nodeselection.SelectedNode) {
|
|
if ix < 4 {
|
|
node.CountryCode = location.Germany
|
|
} else {
|
|
node.CountryCode = location.UnitedKingdom
|
|
}
|
|
|
|
})
|
|
|
|
c, err := overlay.ConfigurablePlacementRule{
|
|
PlacementRules: `10:country("GB")`,
|
|
}.Parse()
|
|
require.NoError(t, err)
|
|
|
|
pieces := createPieces(selectedNodes, 1, 2, 3, 4, 7, 8)
|
|
result := ClassifySegmentPieces(pieces, getNodes(selectedNodes, pieces), map[location.CountryCode]struct{}{}, true, false, c.CreateFilters(10), piecesToNodeIDs(pieces))
|
|
|
|
require.Equal(t, 0, result.Missing.Size())
|
|
require.Equal(t, 0, result.Clumped.Size())
|
|
// 1,2,3 are in Germany instead of GB
|
|
require.Equal(t, 3, result.OutOfPlacement.Size())
|
|
require.Equal(t, 3, result.UnhealthyRetrievable.Size())
|
|
})
|
|
|
|
t.Run("out of placement and offline", func(t *testing.T) {
|
|
// all nodes are in wrong region and half of them are offline
|
|
var selectedNodes = generateNodes(10, func(ix int) bool {
|
|
return ix < 5
|
|
}, func(ix int, node *nodeselection.SelectedNode) {
|
|
node.CountryCode = location.Germany
|
|
})
|
|
|
|
c, err := overlay.ConfigurablePlacementRule{
|
|
PlacementRules: `10:country("GB")`,
|
|
}.Parse()
|
|
require.NoError(t, err)
|
|
|
|
pieces := createPieces(selectedNodes, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9)
|
|
result := ClassifySegmentPieces(pieces, getNodes(selectedNodes, pieces), map[location.CountryCode]struct{}{}, true, false, c.CreateFilters(10), piecesToNodeIDs(pieces))
|
|
|
|
// offline nodes
|
|
require.Equal(t, 5, result.Missing.Size())
|
|
require.Equal(t, 0, result.Clumped.Size())
|
|
require.Equal(t, 10, result.OutOfPlacement.Size())
|
|
require.Equal(t, 5, result.UnhealthyRetrievable.Size())
|
|
numHealthy := len(pieces) - result.Missing.Size() - result.UnhealthyRetrievable.Size()
|
|
require.Equal(t, 0, numHealthy)
|
|
|
|
})
|
|
|
|
t.Run("normal declumping (subnet check)", func(t *testing.T) {
|
|
var selectedNodes = generateNodes(10, func(ix int) bool {
|
|
return ix < 5
|
|
}, func(ix int, node *nodeselection.SelectedNode) {
|
|
node.LastNet = fmt.Sprintf("127.0.%d.0", ix/2)
|
|
})
|
|
|
|
c := overlay.NewPlacementDefinitions()
|
|
|
|
// first 5: online, 2 in each subnet --> healthy: one from (0,1) (2,3) (4), offline: (5,6) but 5 is in the same subnet as 6
|
|
pieces := createPieces(selectedNodes, 0, 1, 2, 3, 4, 5, 6)
|
|
result := ClassifySegmentPieces(pieces, getNodes(selectedNodes, pieces), map[location.CountryCode]struct{}{}, true, true, c.CreateFilters(0), piecesToNodeIDs(pieces))
|
|
|
|
// offline nodes
|
|
require.Equal(t, 2, result.Missing.Size())
|
|
require.Equal(t, 3, result.Clumped.Size())
|
|
require.Equal(t, 0, result.OutOfPlacement.Size())
|
|
require.Equal(t, 2, result.UnhealthyRetrievable.Size())
|
|
numHealthy := len(pieces) - result.Missing.Size() - result.UnhealthyRetrievable.Size()
|
|
require.Equal(t, 3, numHealthy)
|
|
|
|
})
|
|
|
|
t.Run("declumping but with no subnet filter", func(t *testing.T) {
|
|
var selectedNodes = generateNodes(10, func(ix int) bool {
|
|
return ix < 5
|
|
}, func(ix int, node *nodeselection.SelectedNode) {
|
|
node.LastNet = fmt.Sprintf("127.0.%d.0", ix/2)
|
|
node.CountryCode = location.UnitedKingdom
|
|
})
|
|
|
|
c, err := overlay.ConfigurablePlacementRule{
|
|
PlacementRules: fmt.Sprintf(`10:annotated(country("GB"),annotation("%s","%s"))`, nodeselection.AutoExcludeSubnet, nodeselection.AutoExcludeSubnetOFF),
|
|
}.Parse()
|
|
require.NoError(t, err)
|
|
|
|
// first 5: online, 2 in each subnet --> healthy: one from (0,1) (2,3) (4), offline: (5,6) but 5 is in the same subnet as 6
|
|
pieces := createPieces(selectedNodes, 0, 1, 2, 3, 4, 5, 6)
|
|
result := ClassifySegmentPieces(pieces, getNodes(selectedNodes, pieces), map[location.CountryCode]struct{}{}, true, true, c.CreateFilters(10), piecesToNodeIDs(pieces))
|
|
|
|
// offline nodes
|
|
require.Equal(t, 2, result.Missing.Size())
|
|
require.Equal(t, 0, result.Clumped.Size())
|
|
require.Equal(t, 0, result.OutOfPlacement.Size())
|
|
require.Equal(t, 0, result.UnhealthyRetrievable.Size())
|
|
numHealthy := len(pieces) - result.Missing.Size() - result.UnhealthyRetrievable.Size()
|
|
require.Equal(t, 5, numHealthy)
|
|
|
|
})
|
|
|
|
}
|
|
|
|
func generateNodes(num int, isOnline func(i int) bool, config func(ix int, node *nodeselection.SelectedNode)) (selectedNodes []nodeselection.SelectedNode) {
|
|
for i := 0; i < num; i++ {
|
|
node := nodeselection.SelectedNode{
|
|
ID: testidentity.MustPregeneratedIdentity(i, storj.LatestIDVersion()).ID,
|
|
Online: isOnline(i),
|
|
}
|
|
config(i, &node)
|
|
selectedNodes = append(selectedNodes, node)
|
|
}
|
|
return
|
|
}
|
|
|
|
func createPieces(selectedNodes []nodeselection.SelectedNode, indexes ...int) (res metabase.Pieces) {
|
|
for _, index := range indexes {
|
|
piece := metabase.Piece{
|
|
Number: uint16(index),
|
|
}
|
|
piece.StorageNode = selectedNodes[index].ID
|
|
res = append(res, piece)
|
|
}
|
|
return
|
|
}
|
|
|
|
func piecesToNodeIDs(pieces metabase.Pieces) []storj.NodeID {
|
|
ids := make([]storj.NodeID, len(pieces))
|
|
for i, piece := range pieces {
|
|
ids[i] = piece.StorageNode
|
|
}
|
|
return ids
|
|
}
|