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.

191 lines
4.9 KiB

10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
10 years ago
  1. package types
  2. import (
  3. "io/ioutil"
  4. "testing"
  5. "github.com/stretchr/testify/assert"
  6. "github.com/stretchr/testify/require"
  7. "github.com/tendermint/tendermint/crypto/merkle"
  8. tmrand "github.com/tendermint/tendermint/libs/rand"
  9. )
  10. const (
  11. testPartSize = 65536 // 64KB ... 4096 // 4KB
  12. )
  13. func TestBasicPartSet(t *testing.T) {
  14. // Construct random data of size partSize * 100
  15. data := tmrand.Bytes(testPartSize * 100)
  16. partSet := NewPartSetFromData(data, testPartSize)
  17. assert.NotEmpty(t, partSet.Hash())
  18. assert.EqualValues(t, 100, partSet.Total())
  19. assert.Equal(t, 100, partSet.BitArray().Size())
  20. assert.True(t, partSet.HashesTo(partSet.Hash()))
  21. assert.True(t, partSet.IsComplete())
  22. assert.EqualValues(t, 100, partSet.Count())
  23. // Test adding parts to a new partSet.
  24. partSet2 := NewPartSetFromHeader(partSet.Header())
  25. assert.True(t, partSet2.HasHeader(partSet.Header()))
  26. for i := 0; i < int(partSet.Total()); i++ {
  27. part := partSet.GetPart(i)
  28. //t.Logf("\n%v", part)
  29. added, err := partSet2.AddPart(part)
  30. if !added || err != nil {
  31. t.Errorf("failed to add part %v, error: %v", i, err)
  32. }
  33. }
  34. // adding part with invalid index
  35. added, err := partSet2.AddPart(&Part{Index: 10000})
  36. assert.False(t, added)
  37. assert.Error(t, err)
  38. // adding existing part
  39. added, err = partSet2.AddPart(partSet2.GetPart(0))
  40. assert.False(t, added)
  41. assert.Nil(t, err)
  42. assert.Equal(t, partSet.Hash(), partSet2.Hash())
  43. assert.EqualValues(t, 100, partSet2.Total())
  44. assert.True(t, partSet2.IsComplete())
  45. // Reconstruct data, assert that they are equal.
  46. data2Reader := partSet2.GetReader()
  47. data2, err := ioutil.ReadAll(data2Reader)
  48. require.NoError(t, err)
  49. assert.Equal(t, data, data2)
  50. }
  51. func TestWrongProof(t *testing.T) {
  52. // Construct random data of size partSize * 100
  53. data := tmrand.Bytes(testPartSize * 100)
  54. partSet := NewPartSetFromData(data, testPartSize)
  55. // Test adding a part with wrong data.
  56. partSet2 := NewPartSetFromHeader(partSet.Header())
  57. // Test adding a part with wrong trail.
  58. part := partSet.GetPart(0)
  59. part.Proof.Aunts[0][0] += byte(0x01)
  60. added, err := partSet2.AddPart(part)
  61. if added || err == nil {
  62. t.Errorf("expected to fail adding a part with bad trail.")
  63. }
  64. // Test adding a part with wrong bytes.
  65. part = partSet.GetPart(1)
  66. part.Bytes[0] += byte(0x01)
  67. added, err = partSet2.AddPart(part)
  68. if added || err == nil {
  69. t.Errorf("expected to fail adding a part with bad bytes.")
  70. }
  71. }
  72. func TestPartSetHeaderValidateBasic(t *testing.T) {
  73. testCases := []struct {
  74. testName string
  75. malleatePartSetHeader func(*PartSetHeader)
  76. expectErr bool
  77. }{
  78. {"Good PartSet", func(psHeader *PartSetHeader) {}, false},
  79. {"Invalid Hash", func(psHeader *PartSetHeader) { psHeader.Hash = make([]byte, 1) }, true},
  80. }
  81. for _, tc := range testCases {
  82. tc := tc
  83. t.Run(tc.testName, func(t *testing.T) {
  84. data := tmrand.Bytes(testPartSize * 100)
  85. ps := NewPartSetFromData(data, testPartSize)
  86. psHeader := ps.Header()
  87. tc.malleatePartSetHeader(&psHeader)
  88. assert.Equal(t, tc.expectErr, psHeader.ValidateBasic() != nil, "Validate Basic had an unexpected result")
  89. })
  90. }
  91. }
  92. func TestPartValidateBasic(t *testing.T) {
  93. testCases := []struct {
  94. testName string
  95. malleatePart func(*Part)
  96. expectErr bool
  97. }{
  98. {"Good Part", func(pt *Part) {}, false},
  99. {"Too big part", func(pt *Part) { pt.Bytes = make([]byte, BlockPartSizeBytes+1) }, true},
  100. {"Too big proof", func(pt *Part) {
  101. pt.Proof = merkle.Proof{
  102. Total: 1,
  103. Index: 1,
  104. LeafHash: make([]byte, 1024*1024),
  105. }
  106. }, true},
  107. }
  108. for _, tc := range testCases {
  109. tc := tc
  110. t.Run(tc.testName, func(t *testing.T) {
  111. data := tmrand.Bytes(testPartSize * 100)
  112. ps := NewPartSetFromData(data, testPartSize)
  113. part := ps.GetPart(0)
  114. tc.malleatePart(part)
  115. assert.Equal(t, tc.expectErr, part.ValidateBasic() != nil, "Validate Basic had an unexpected result")
  116. })
  117. }
  118. }
  119. func TestParSetHeaderProtoBuf(t *testing.T) {
  120. testCases := []struct {
  121. msg string
  122. ps1 *PartSetHeader
  123. expPass bool
  124. }{
  125. {"success empty", &PartSetHeader{}, true},
  126. {"success",
  127. &PartSetHeader{Total: 1, Hash: []byte("hash")}, true},
  128. }
  129. for _, tc := range testCases {
  130. protoBlockID := tc.ps1.ToProto()
  131. psh, err := PartSetHeaderFromProto(&protoBlockID)
  132. if tc.expPass {
  133. require.Equal(t, tc.ps1, psh, tc.msg)
  134. } else {
  135. require.Error(t, err, tc.msg)
  136. }
  137. }
  138. }
  139. func TestPartProtoBuf(t *testing.T) {
  140. proof := merkle.Proof{
  141. Total: 1,
  142. Index: 1,
  143. LeafHash: tmrand.Bytes(32),
  144. }
  145. testCases := []struct {
  146. msg string
  147. ps1 *Part
  148. expPass bool
  149. }{
  150. {"failure empty", &Part{}, false},
  151. {"failure nil", nil, false},
  152. {"success",
  153. &Part{Index: 1, Bytes: tmrand.Bytes(32), Proof: proof}, true},
  154. }
  155. for _, tc := range testCases {
  156. proto, err := tc.ps1.ToProto()
  157. if tc.expPass {
  158. require.NoError(t, err, tc.msg)
  159. }
  160. p, err := PartFromProto(proto)
  161. if tc.expPass {
  162. require.NoError(t, err)
  163. require.Equal(t, tc.ps1, p, tc.msg)
  164. }
  165. }
  166. }