eth/downloader: put back hashes on block overflow error
This commit is contained in:
parent
493181ea09
commit
f2a2b2ac70
@ -1,6 +1,7 @@
|
|||||||
package downloader
|
package downloader
|
||||||
|
|
||||||
import (
|
import (
|
||||||
|
"fmt"
|
||||||
"math"
|
"math"
|
||||||
"sync"
|
"sync"
|
||||||
"time"
|
"time"
|
||||||
@ -102,17 +103,6 @@ func (c *queue) has(hash common.Hash) bool {
|
|||||||
return c.hashPool.Has(hash) || c.fetchPool.Has(hash) || c.blockHashes.Has(hash)
|
return c.hashPool.Has(hash) || c.fetchPool.Has(hash) || c.blockHashes.Has(hash)
|
||||||
}
|
}
|
||||||
|
|
||||||
func (c *queue) addBlock(id string, block *types.Block) {
|
|
||||||
c.mu.Lock()
|
|
||||||
defer c.mu.Unlock()
|
|
||||||
|
|
||||||
// when adding a block make sure it doesn't already exist
|
|
||||||
if !c.blockHashes.Has(block.Hash()) {
|
|
||||||
c.hashPool.Remove(block.Hash())
|
|
||||||
c.blocks = append(c.blocks, block)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (c *queue) getBlock(hash common.Hash) *types.Block {
|
func (c *queue) getBlock(hash common.Hash) *types.Block {
|
||||||
c.mu.Lock()
|
c.mu.Lock()
|
||||||
defer c.mu.Unlock()
|
defer c.mu.Unlock()
|
||||||
@ -130,7 +120,7 @@ func (c *queue) getBlock(hash common.Hash) *types.Block {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// deliver delivers a chunk to the queue that was requested of the peer
|
// deliver delivers a chunk to the queue that was requested of the peer
|
||||||
func (c *queue) deliver(id string, blocks []*types.Block) error {
|
func (c *queue) deliver(id string, blocks []*types.Block) (err error) {
|
||||||
c.mu.Lock()
|
c.mu.Lock()
|
||||||
defer c.mu.Unlock()
|
defer c.mu.Unlock()
|
||||||
|
|
||||||
@ -145,25 +135,30 @@ func (c *queue) deliver(id string, blocks []*types.Block) error {
|
|||||||
chunk.peer.ignored.Merge(chunk.hashes)
|
chunk.peer.ignored.Merge(chunk.hashes)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Add the blocks
|
||||||
|
for i, block := range blocks {
|
||||||
|
// See (1) for future limitation
|
||||||
|
n := int(block.NumberU64()) - c.blockOffset
|
||||||
|
if n > len(c.blocks) || n < 0 {
|
||||||
|
// set the error and set the blocks which could be processed
|
||||||
|
// abort the rest of the blocks (FIXME this could be improved)
|
||||||
|
err = fmt.Errorf("received block which overflow (N=%v O=%v)", block.Number(), c.blockOffset)
|
||||||
|
blocks = blocks[:i]
|
||||||
|
break
|
||||||
|
}
|
||||||
|
c.blocks[n] = block
|
||||||
|
}
|
||||||
// seperate the blocks and the hashes
|
// seperate the blocks and the hashes
|
||||||
blockHashes := chunk.fetchedHashes(blocks)
|
blockHashes := chunk.fetchedHashes(blocks)
|
||||||
// merge block hashes
|
// merge block hashes
|
||||||
c.blockHashes.Merge(blockHashes)
|
c.blockHashes.Merge(blockHashes)
|
||||||
// Add the blocks
|
|
||||||
for _, block := range blocks {
|
|
||||||
// See (1) for future limitation
|
|
||||||
n := int(block.NumberU64()) - c.blockOffset
|
|
||||||
if n > len(c.blocks) || n < 0 {
|
|
||||||
return errBlockNumberOverflow
|
|
||||||
}
|
|
||||||
c.blocks[n] = block
|
|
||||||
}
|
|
||||||
// Add back whatever couldn't be delivered
|
// Add back whatever couldn't be delivered
|
||||||
c.hashPool.Merge(chunk.hashes)
|
c.hashPool.Merge(chunk.hashes)
|
||||||
|
// Remove the hashes from the fetch pool
|
||||||
c.fetchPool.Separate(chunk.hashes)
|
c.fetchPool.Separate(chunk.hashes)
|
||||||
}
|
}
|
||||||
|
|
||||||
return nil
|
return
|
||||||
}
|
}
|
||||||
|
|
||||||
func (c *queue) alloc(offset, size int) {
|
func (c *queue) alloc(offset, size int) {
|
||||||
|
Loading…
Reference in New Issue
Block a user