Official Go implementation of the Bytom protocol
Revision | 68dd4068236efb0b2eab7b22c098e512af035b11 (tree) |
---|---|
Time | 2019-08-13 12:42:57 |
Author | Yahtoo Ma <yahtoo.ma@gmai...> |
Commiter | Yahtoo Ma |
fix the orphan issue
@@ -24,7 +24,7 @@ type OrphanBlock struct { | ||
24 | 24 | |
25 | 25 | func NewOrphanBlock(block *types.Block, expiration time.Time) *OrphanBlock { |
26 | 26 | return &OrphanBlock{ |
27 | - Block: block, | |
27 | + Block: block, | |
28 | 28 | expiration: expiration, |
29 | 29 | } |
30 | 30 | } |
@@ -70,8 +70,8 @@ func (o *OrphanManage) Add(block *types.Block) { | ||
70 | 70 | } |
71 | 71 | |
72 | 72 | if len(o.orphan) >= numOrphanBlockLimit { |
73 | + o.deleteLRU() | |
73 | 74 | log.WithFields(log.Fields{"module": logModule, "hash": blockHash.String(), "height": block.Height}).Info("the number of orphan blocks exceeds the limit") |
74 | - return | |
75 | 75 | } |
76 | 76 | |
77 | 77 | o.orphan[blockHash] = &OrphanBlock{block, time.Now().Add(orphanBlockTTL)} |
@@ -137,13 +137,27 @@ func (o *OrphanManage) delete(hash *bc.Hash) { | ||
137 | 137 | } |
138 | 138 | |
139 | 139 | for i, preOrphan := range prevOrphans { |
140 | - if preOrphan == hash { | |
140 | + if *preOrphan == *hash { | |
141 | 141 | o.prevOrphans[block.Block.PreviousBlockHash] = append(prevOrphans[:i], prevOrphans[i+1:]...) |
142 | 142 | return |
143 | 143 | } |
144 | 144 | } |
145 | 145 | } |
146 | 146 | |
147 | +func (o *OrphanManage) deleteLRU() { | |
148 | + var deleteBlock *OrphanBlock | |
149 | + for _, orphan := range o.orphan { | |
150 | + if deleteBlock == nil || orphan.expiration.Before(deleteBlock.expiration) { | |
151 | + deleteBlock = orphan | |
152 | + } | |
153 | + } | |
154 | + | |
155 | + if deleteBlock != nil { | |
156 | + blockHash := deleteBlock.Block.Hash() | |
157 | + o.delete(&blockHash) | |
158 | + } | |
159 | +} | |
160 | + | |
147 | 161 | func (o *OrphanManage) orphanExpireWorker() { |
148 | 162 | ticker := time.NewTicker(orphanExpireWorkInterval) |
149 | 163 | for now := range ticker.C { |
@@ -10,15 +10,15 @@ import ( | ||
10 | 10 | ) |
11 | 11 | |
12 | 12 | var testBlocks = []*types.Block{ |
13 | - &types.Block{BlockHeader: types.BlockHeader{ | |
13 | + {BlockHeader: types.BlockHeader{ | |
14 | 14 | PreviousBlockHash: bc.Hash{V0: 1}, |
15 | 15 | Nonce: 0, |
16 | 16 | }}, |
17 | - &types.Block{BlockHeader: types.BlockHeader{ | |
17 | + {BlockHeader: types.BlockHeader{ | |
18 | 18 | PreviousBlockHash: bc.Hash{V0: 1}, |
19 | 19 | Nonce: 1, |
20 | 20 | }}, |
21 | - &types.Block{BlockHeader: types.BlockHeader{ | |
21 | + {BlockHeader: types.BlockHeader{ | |
22 | 22 | PreviousBlockHash: bc.Hash{V0: 2}, |
23 | 23 | Nonce: 3, |
24 | 24 | }}, |
@@ -32,6 +32,65 @@ func init() { | ||
32 | 32 | } |
33 | 33 | } |
34 | 34 | |
35 | +func TestDeleteLRU(t *testing.T) { | |
36 | + now := time.Now() | |
37 | + cases := []struct { | |
38 | + before *OrphanManage | |
39 | + after *OrphanManage | |
40 | + }{ | |
41 | + { | |
42 | + before: &OrphanManage{ | |
43 | + orphan: map[bc.Hash]*OrphanBlock{ | |
44 | + blockHashes[0]: {testBlocks[0], now}, | |
45 | + }, | |
46 | + prevOrphans: map[bc.Hash][]*bc.Hash{ | |
47 | + {V0: 1}: {&blockHashes[0]}, | |
48 | + }, | |
49 | + }, | |
50 | + after: &OrphanManage{ | |
51 | + orphan: map[bc.Hash]*OrphanBlock{}, | |
52 | + prevOrphans: map[bc.Hash][]*bc.Hash{}, | |
53 | + }, | |
54 | + }, | |
55 | + { | |
56 | + before: &OrphanManage{ | |
57 | + orphan: map[bc.Hash]*OrphanBlock{}, | |
58 | + prevOrphans: map[bc.Hash][]*bc.Hash{}, | |
59 | + }, | |
60 | + after: &OrphanManage{ | |
61 | + orphan: map[bc.Hash]*OrphanBlock{}, | |
62 | + prevOrphans: map[bc.Hash][]*bc.Hash{}, | |
63 | + }, | |
64 | + }, | |
65 | + { | |
66 | + before: &OrphanManage{ | |
67 | + orphan: map[bc.Hash]*OrphanBlock{ | |
68 | + blockHashes[0]: {testBlocks[0], now.Add(2)}, | |
69 | + blockHashes[1]: {testBlocks[1], now.Add(1)}, | |
70 | + }, | |
71 | + prevOrphans: map[bc.Hash][]*bc.Hash{ | |
72 | + {V0: 1}: {&blockHashes[0], &blockHashes[1]}, | |
73 | + }, | |
74 | + }, | |
75 | + after: &OrphanManage{ | |
76 | + orphan: map[bc.Hash]*OrphanBlock{ | |
77 | + blockHashes[0]: {testBlocks[0], now.Add(2)}, | |
78 | + }, | |
79 | + prevOrphans: map[bc.Hash][]*bc.Hash{ | |
80 | + {V0: 1}: {&blockHashes[0]}, | |
81 | + }, | |
82 | + }, | |
83 | + }, | |
84 | + } | |
85 | + | |
86 | + for i, c := range cases { | |
87 | + c.before.deleteLRU() | |
88 | + if !testutil.DeepEqual(c.before, c.after) { | |
89 | + t.Errorf("case %d: got %v want %v", i, c.before, c.after) | |
90 | + } | |
91 | + } | |
92 | +} | |
93 | + | |
35 | 94 | func TestOrphanManageAdd(t *testing.T) { |
36 | 95 | cases := []struct { |
37 | 96 | before *OrphanManage |
@@ -45,10 +104,10 @@ func TestOrphanManageAdd(t *testing.T) { | ||
45 | 104 | }, |
46 | 105 | after: &OrphanManage{ |
47 | 106 | orphan: map[bc.Hash]*OrphanBlock{ |
48 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
107 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
49 | 108 | }, |
50 | 109 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
51 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
110 | + {V0: 1}: {&blockHashes[0]}, | |
52 | 111 | }, |
53 | 112 | }, |
54 | 113 | addOrphan: testBlocks[0], |
@@ -56,18 +115,18 @@ func TestOrphanManageAdd(t *testing.T) { | ||
56 | 115 | { |
57 | 116 | before: &OrphanManage{ |
58 | 117 | orphan: map[bc.Hash]*OrphanBlock{ |
59 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
118 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
60 | 119 | }, |
61 | 120 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
62 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
121 | + {V0: 1}: {&blockHashes[0]}, | |
63 | 122 | }, |
64 | 123 | }, |
65 | 124 | after: &OrphanManage{ |
66 | 125 | orphan: map[bc.Hash]*OrphanBlock{ |
67 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
126 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
68 | 127 | }, |
69 | 128 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
70 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
129 | + {V0: 1}: {&blockHashes[0]}, | |
71 | 130 | }, |
72 | 131 | }, |
73 | 132 | addOrphan: testBlocks[0], |
@@ -75,19 +134,19 @@ func TestOrphanManageAdd(t *testing.T) { | ||
75 | 134 | { |
76 | 135 | before: &OrphanManage{ |
77 | 136 | orphan: map[bc.Hash]*OrphanBlock{ |
78 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
137 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
79 | 138 | }, |
80 | 139 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
81 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
140 | + {V0: 1}: {&blockHashes[0]}, | |
82 | 141 | }, |
83 | 142 | }, |
84 | 143 | after: &OrphanManage{ |
85 | 144 | orphan: map[bc.Hash]*OrphanBlock{ |
86 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
87 | - blockHashes[1]: &OrphanBlock{testBlocks[1], time.Time{}}, | |
145 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
146 | + blockHashes[1]: {testBlocks[1], time.Time{}}, | |
88 | 147 | }, |
89 | 148 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
90 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0], &blockHashes[1]}, | |
149 | + {V0: 1}: {&blockHashes[0], &blockHashes[1]}, | |
91 | 150 | }, |
92 | 151 | }, |
93 | 152 | addOrphan: testBlocks[1], |
@@ -95,20 +154,20 @@ func TestOrphanManageAdd(t *testing.T) { | ||
95 | 154 | { |
96 | 155 | before: &OrphanManage{ |
97 | 156 | orphan: map[bc.Hash]*OrphanBlock{ |
98 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
157 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
99 | 158 | }, |
100 | 159 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
101 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
160 | + {V0: 1}: {&blockHashes[0]}, | |
102 | 161 | }, |
103 | 162 | }, |
104 | 163 | after: &OrphanManage{ |
105 | 164 | orphan: map[bc.Hash]*OrphanBlock{ |
106 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
107 | - blockHashes[2]: &OrphanBlock{testBlocks[2], time.Time{}}, | |
165 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
166 | + blockHashes[2]: {testBlocks[2], time.Time{}}, | |
108 | 167 | }, |
109 | 168 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
110 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
111 | - bc.Hash{V0: 2}: []*bc.Hash{&blockHashes[2]}, | |
169 | + {V0: 1}: {&blockHashes[0]}, | |
170 | + {V0: 2}: {&blockHashes[2]}, | |
112 | 171 | }, |
113 | 172 | }, |
114 | 173 | addOrphan: testBlocks[2], |
@@ -135,18 +194,18 @@ func TestOrphanManageDelete(t *testing.T) { | ||
135 | 194 | { |
136 | 195 | before: &OrphanManage{ |
137 | 196 | orphan: map[bc.Hash]*OrphanBlock{ |
138 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
197 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
139 | 198 | }, |
140 | 199 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
141 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
200 | + {V0: 1}: {&blockHashes[0]}, | |
142 | 201 | }, |
143 | 202 | }, |
144 | 203 | after: &OrphanManage{ |
145 | 204 | orphan: map[bc.Hash]*OrphanBlock{ |
146 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
205 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
147 | 206 | }, |
148 | 207 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
149 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
208 | + {V0: 1}: {&blockHashes[0]}, | |
150 | 209 | }, |
151 | 210 | }, |
152 | 211 | remove: &blockHashes[1], |
@@ -154,10 +213,10 @@ func TestOrphanManageDelete(t *testing.T) { | ||
154 | 213 | { |
155 | 214 | before: &OrphanManage{ |
156 | 215 | orphan: map[bc.Hash]*OrphanBlock{ |
157 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
216 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
158 | 217 | }, |
159 | 218 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
160 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
219 | + {V0: 1}: {&blockHashes[0]}, | |
161 | 220 | }, |
162 | 221 | }, |
163 | 222 | after: &OrphanManage{ |
@@ -169,19 +228,19 @@ func TestOrphanManageDelete(t *testing.T) { | ||
169 | 228 | { |
170 | 229 | before: &OrphanManage{ |
171 | 230 | orphan: map[bc.Hash]*OrphanBlock{ |
172 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
173 | - blockHashes[1]: &OrphanBlock{testBlocks[1], time.Time{}}, | |
231 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
232 | + blockHashes[1]: {testBlocks[1], time.Time{}}, | |
174 | 233 | }, |
175 | 234 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
176 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0], &blockHashes[1]}, | |
235 | + {V0: 1}: {&blockHashes[0], &blockHashes[1]}, | |
177 | 236 | }, |
178 | 237 | }, |
179 | 238 | after: &OrphanManage{ |
180 | 239 | orphan: map[bc.Hash]*OrphanBlock{ |
181 | - blockHashes[0]: &OrphanBlock{testBlocks[0], time.Time{}}, | |
240 | + blockHashes[0]: {testBlocks[0], time.Time{}}, | |
182 | 241 | }, |
183 | 242 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
184 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
243 | + {V0: 1}: {&blockHashes[0]}, | |
185 | 244 | }, |
186 | 245 | }, |
187 | 246 | remove: &blockHashes[1], |
@@ -204,13 +263,13 @@ func TestOrphanManageExpire(t *testing.T) { | ||
204 | 263 | { |
205 | 264 | before: &OrphanManage{ |
206 | 265 | orphan: map[bc.Hash]*OrphanBlock{ |
207 | - blockHashes[0]: &OrphanBlock{ | |
266 | + blockHashes[0]: { | |
208 | 267 | testBlocks[0], |
209 | 268 | time.Unix(1633479700, 0), |
210 | 269 | }, |
211 | 270 | }, |
212 | 271 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
213 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
272 | + {V0: 1}: {&blockHashes[0]}, | |
214 | 273 | }, |
215 | 274 | }, |
216 | 275 | after: &OrphanManage{ |
@@ -221,24 +280,24 @@ func TestOrphanManageExpire(t *testing.T) { | ||
221 | 280 | { |
222 | 281 | before: &OrphanManage{ |
223 | 282 | orphan: map[bc.Hash]*OrphanBlock{ |
224 | - blockHashes[0]: &OrphanBlock{ | |
283 | + blockHashes[0]: { | |
225 | 284 | testBlocks[0], |
226 | 285 | time.Unix(1633479702, 0), |
227 | 286 | }, |
228 | 287 | }, |
229 | 288 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
230 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
289 | + {V0: 1}: {&blockHashes[0]}, | |
231 | 290 | }, |
232 | 291 | }, |
233 | 292 | after: &OrphanManage{ |
234 | 293 | orphan: map[bc.Hash]*OrphanBlock{ |
235 | - blockHashes[0]: &OrphanBlock{ | |
294 | + blockHashes[0]: { | |
236 | 295 | testBlocks[0], |
237 | 296 | time.Unix(1633479702, 0), |
238 | 297 | }, |
239 | 298 | }, |
240 | 299 | prevOrphans: map[bc.Hash][]*bc.Hash{ |
241 | - bc.Hash{V0: 1}: []*bc.Hash{&blockHashes[0]}, | |
300 | + {V0: 1}: {&blockHashes[0]}, | |
242 | 301 | }, |
243 | 302 | }, |
244 | 303 | }, |
@@ -253,24 +312,24 @@ func TestOrphanManageExpire(t *testing.T) { | ||
253 | 312 | } |
254 | 313 | |
255 | 314 | func TestOrphanManageNumLimit(t *testing.T) { |
256 | - cases := []struct{ | |
257 | - addOrphanBlockNum int | |
315 | + cases := []struct { | |
316 | + addOrphanBlockNum int | |
258 | 317 | expectOrphanBlockNum int |
259 | 318 | }{ |
260 | 319 | { |
261 | - addOrphanBlockNum: 10, | |
320 | + addOrphanBlockNum: 10, | |
262 | 321 | expectOrphanBlockNum: 10, |
263 | 322 | }, |
264 | 323 | { |
265 | - addOrphanBlockNum: numOrphanBlockLimit, | |
324 | + addOrphanBlockNum: numOrphanBlockLimit, | |
266 | 325 | expectOrphanBlockNum: numOrphanBlockLimit, |
267 | 326 | }, |
268 | 327 | { |
269 | - addOrphanBlockNum: numOrphanBlockLimit + 1, | |
328 | + addOrphanBlockNum: numOrphanBlockLimit + 1, | |
270 | 329 | expectOrphanBlockNum: numOrphanBlockLimit, |
271 | 330 | }, |
272 | 331 | { |
273 | - addOrphanBlockNum: numOrphanBlockLimit + 10, | |
332 | + addOrphanBlockNum: numOrphanBlockLimit + 10, | |
274 | 333 | expectOrphanBlockNum: numOrphanBlockLimit, |
275 | 334 | }, |
276 | 335 | } |
@@ -283,7 +342,7 @@ func TestOrphanManageNumLimit(t *testing.T) { | ||
283 | 342 | for num := 0; num < c.addOrphanBlockNum; num++ { |
284 | 343 | orphanManage.Add(&types.Block{BlockHeader: types.BlockHeader{Height: uint64(num)}}) |
285 | 344 | } |
286 | - if (len(orphanManage.orphan) != c.expectOrphanBlockNum) { | |
345 | + if len(orphanManage.orphan) != c.expectOrphanBlockNum { | |
287 | 346 | t.Errorf("case %d: got %d want %d", i, len(orphanManage.orphan), c.expectOrphanBlockNum) |
288 | 347 | } |
289 | 348 | } |