mirror of
https://gitee.com/IrisVega/frp.git
synced 2024-11-01 22:31:29 +08:00
147 lines
2.7 KiB
Go
147 lines
2.7 KiB
Go
|
package reedsolomon
|
||
|
|
||
|
import (
|
||
|
"bytes"
|
||
|
"testing"
|
||
|
)
|
||
|
|
||
|
func TestVerifyEncMatrixVand(t *testing.T) {
|
||
|
a, err := genEncMatrixVand(4, 4)
|
||
|
if err != nil {
|
||
|
t.Fatal(err)
|
||
|
}
|
||
|
e := []byte{1, 0, 0, 0,
|
||
|
0, 1, 0, 0,
|
||
|
0, 0, 1, 0,
|
||
|
0, 0, 0, 1,
|
||
|
27, 28, 18, 20,
|
||
|
28, 27, 20, 18,
|
||
|
18, 20, 27, 28,
|
||
|
20, 18, 28, 27}
|
||
|
if !bytes.Equal(a, e) {
|
||
|
t.Fatal("mismatch")
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func TestVerifyEncMatrixCauchy(t *testing.T) {
|
||
|
a := genEncMatrixCauchy(4, 4)
|
||
|
e := []byte{1, 0, 0, 0,
|
||
|
0, 1, 0, 0,
|
||
|
0, 0, 1, 0,
|
||
|
0, 0, 0, 1,
|
||
|
71, 167, 122, 186,
|
||
|
167, 71, 186, 122,
|
||
|
122, 186, 71, 167,
|
||
|
186, 122, 167, 71}
|
||
|
if !bytes.Equal(a, e) {
|
||
|
t.Fatal("mismatch")
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func TestMatrixInvert(t *testing.T) {
|
||
|
testCases := []struct {
|
||
|
matrixData []byte
|
||
|
cols int
|
||
|
expect []byte
|
||
|
ok bool
|
||
|
expectedErr error
|
||
|
}{
|
||
|
{
|
||
|
[]byte{56, 23, 98,
|
||
|
3, 100, 200,
|
||
|
45, 201, 123},
|
||
|
3,
|
||
|
[]byte{175, 133, 33,
|
||
|
130, 13, 245,
|
||
|
112, 35, 126},
|
||
|
true,
|
||
|
nil,
|
||
|
},
|
||
|
{
|
||
|
[]byte{0, 23, 98,
|
||
|
3, 100, 200,
|
||
|
45, 201, 123},
|
||
|
3,
|
||
|
[]byte{245, 128, 152,
|
||
|
188, 64, 135,
|
||
|
231, 81, 239},
|
||
|
true,
|
||
|
nil,
|
||
|
},
|
||
|
{
|
||
|
[]byte{1, 0, 0, 0, 0,
|
||
|
0, 1, 0, 0, 0,
|
||
|
0, 0, 0, 1, 0,
|
||
|
0, 0, 0, 0, 1,
|
||
|
7, 7, 6, 6, 1},
|
||
|
5,
|
||
|
[]byte{1, 0, 0, 0, 0,
|
||
|
0, 1, 0, 0, 0,
|
||
|
123, 123, 1, 122, 122,
|
||
|
0, 0, 1, 0, 0,
|
||
|
0, 0, 0, 1, 0},
|
||
|
true,
|
||
|
nil,
|
||
|
},
|
||
|
{
|
||
|
[]byte{4, 2,
|
||
|
12, 6},
|
||
|
2,
|
||
|
nil,
|
||
|
false,
|
||
|
errSingular,
|
||
|
},
|
||
|
}
|
||
|
|
||
|
for i, c := range testCases {
|
||
|
m := matrix(c.matrixData)
|
||
|
raw := make([]byte, 2*c.cols*c.cols)
|
||
|
actual := make([]byte, c.cols*c.cols)
|
||
|
actualErr := m.invert(raw, c.cols, actual)
|
||
|
if actualErr != nil && c.ok {
|
||
|
t.Errorf("case.%d, expected to pass, but failed with: <ERROR> %s", i+1, actualErr.Error())
|
||
|
}
|
||
|
if actualErr == nil && !c.ok {
|
||
|
t.Errorf("case.%d, expected to fail with <ERROR> \"%s\", but passed", i+1, c.expectedErr)
|
||
|
}
|
||
|
if actualErr != nil && !c.ok {
|
||
|
if c.expectedErr != actualErr {
|
||
|
t.Errorf("case.%d, expected to fail with error \"%s\", but instead failed with error \"%s\"", i+1, c.expectedErr, actualErr)
|
||
|
}
|
||
|
}
|
||
|
if actualErr == nil && c.ok {
|
||
|
if !bytes.Equal(c.expect, actual) {
|
||
|
t.Errorf("case.%d, mismatch", i+1)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func benchmarkInvert(b *testing.B, size int) {
|
||
|
m := genEncMatrixCauchy(size, 2)
|
||
|
m.swap(0, size, size)
|
||
|
m.swap(1, size+1, size)
|
||
|
b.ResetTimer()
|
||
|
buf := make([]byte, 3*size*size)
|
||
|
raw := buf[:2*size*size]
|
||
|
r := buf[2*size*size:]
|
||
|
for i := 0; i < b.N; i++ {
|
||
|
err := m.invert(raw, size, r)
|
||
|
if err != nil {
|
||
|
b.Fatal(err)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func BenchmarkInvert5x5(b *testing.B) {
|
||
|
benchmarkInvert(b, 5)
|
||
|
}
|
||
|
|
||
|
func BenchmarkInvert10x10(b *testing.B) {
|
||
|
benchmarkInvert(b, 10)
|
||
|
}
|
||
|
|
||
|
func BenchmarkInvert20x20(b *testing.B) {
|
||
|
benchmarkInvert(b, 20)
|
||
|
}
|