You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
111 lines
3.3 KiB
111 lines
3.3 KiB
package main
|
|
|
|
import (
|
|
"fmt"
|
|
"math/rand"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
"github.com/stretchr/testify/require"
|
|
e2e "github.com/tendermint/tendermint/test/e2e/pkg"
|
|
)
|
|
|
|
func TestGenerator(t *testing.T) {
|
|
manifests, err := Generate(rand.New(rand.NewSource(randomSeed)), Options{P2P: MixedP2PMode})
|
|
require.NoError(t, err)
|
|
require.True(t, len(manifests) >= 64, "insufficient combinations")
|
|
|
|
// this just means that the numbers reported by the test
|
|
// failures map to the test cases that you'd see locally.
|
|
e2e.SortManifests(manifests, false /* ascending */)
|
|
|
|
for idx, m := range manifests {
|
|
t.Run(fmt.Sprintf("Case%04d", idx), func(t *testing.T) {
|
|
numStateSyncs := 0
|
|
for name, node := range m.Nodes {
|
|
if node.StateSync != e2e.StateSyncDisabled {
|
|
numStateSyncs++
|
|
}
|
|
t.Run(name, func(t *testing.T) {
|
|
if node.StartAt > m.InitialHeight+5 && !node.Stateless() {
|
|
require.NotEqual(t, node.StateSync, e2e.StateSyncDisabled)
|
|
}
|
|
if node.StateSync != e2e.StateSyncDisabled {
|
|
require.Zero(t, node.Seeds, node.StateSync)
|
|
require.True(t, len(node.PersistentPeers) >= 2)
|
|
require.Equal(t, "v0", node.BlockSync)
|
|
}
|
|
|
|
})
|
|
}
|
|
require.True(t, numStateSyncs <= 2)
|
|
})
|
|
}
|
|
|
|
t.Run("Hybrid", func(t *testing.T) {
|
|
manifests, err := Generate(rand.New(rand.NewSource(randomSeed)), Options{P2P: HybridP2PMode})
|
|
require.NoError(t, err)
|
|
require.True(t, len(manifests) >= 16, "insufficient combinations: %d", len(manifests))
|
|
|
|
// failures map to the test cases that you'd see locally.
|
|
e2e.SortManifests(manifests, false /* ascending */)
|
|
|
|
for idx, m := range manifests {
|
|
t.Run(fmt.Sprintf("Case%04d", idx), func(t *testing.T) {
|
|
require.True(t, len(m.Nodes) > 1)
|
|
|
|
var numLegacy, numNew int
|
|
for _, node := range m.Nodes {
|
|
if node.UseLegacyP2P {
|
|
numLegacy++
|
|
} else {
|
|
numNew++
|
|
}
|
|
}
|
|
|
|
assert.True(t, numLegacy >= 1, "not enough legacy nodes [%d/%d]",
|
|
numLegacy, len(m.Nodes))
|
|
assert.True(t, numNew >= 1, "not enough new nodes [%d/%d]",
|
|
numNew, len(m.Nodes))
|
|
})
|
|
}
|
|
})
|
|
t.Run("UnmixedP2P", func(t *testing.T) {
|
|
t.Run("New", func(t *testing.T) {
|
|
manifests, err := Generate(rand.New(rand.NewSource(randomSeed)), Options{P2P: NewP2PMode})
|
|
require.NoError(t, err)
|
|
require.True(t, len(manifests) >= 16, "insufficient combinations: %d", len(manifests))
|
|
|
|
// failures map to the test cases that you'd see locally.
|
|
e2e.SortManifests(manifests, false /* ascending */)
|
|
|
|
for idx, m := range manifests {
|
|
t.Run(fmt.Sprintf("Case%04d", idx), func(t *testing.T) {
|
|
for name, node := range m.Nodes {
|
|
t.Run(name, func(t *testing.T) {
|
|
require.False(t, node.UseLegacyP2P)
|
|
})
|
|
}
|
|
})
|
|
}
|
|
})
|
|
t.Run("Legacy", func(t *testing.T) {
|
|
manifests, err := Generate(rand.New(rand.NewSource(randomSeed)), Options{P2P: LegacyP2PMode})
|
|
require.NoError(t, err)
|
|
require.True(t, len(manifests) >= 16, "insufficient combinations: %d", len(manifests))
|
|
|
|
// failures map to the test cases that you'd see locally.
|
|
e2e.SortManifests(manifests, false /* ascending */)
|
|
|
|
for idx, m := range manifests {
|
|
t.Run(fmt.Sprintf("Case%04d", idx), func(t *testing.T) {
|
|
for name, node := range m.Nodes {
|
|
t.Run(name, func(t *testing.T) {
|
|
require.True(t, node.UseLegacyP2P)
|
|
})
|
|
}
|
|
})
|
|
}
|
|
})
|
|
})
|
|
}
|