diff options
| -rw-r--r-- | blockpool/blockpool.go | 2 | ||||
| -rw-r--r-- | core/chain_manager.go | 7 |
2 files changed, 0 insertions, 9 deletions
diff --git a/blockpool/blockpool.go b/blockpool/blockpool.go index 79b6f8cc0..e65032fb5 100644 --- a/blockpool/blockpool.go +++ b/blockpool/blockpool.go @@ -622,8 +622,6 @@ func (self *BlockPool) AddBlock(block *types.Block, peerId string) { entry := self.get(hash) - fmt.Println("block number", block.Number()) - defer fmt.Println("AddBlock done") // a peer's current head block is appearing the first time if hash == sender.currentBlockHash { if sender.currentBlock == nil { diff --git a/core/chain_manager.go b/core/chain_manager.go index 2a5d2f2c5..b7b6279ca 100644 --- a/core/chain_manager.go +++ b/core/chain_manager.go @@ -447,11 +447,6 @@ func (self *ChainManager) procFutureBlocks() { } func (self *ChainManager) InsertChain(chain types.Blocks) error { - if len(chain) > 0 { - fmt.Println("insert chain", len(chain)) - defer fmt.Println("insert chain done") - } - // A queued approach to delivering events. This is generally faster than direct delivery and requires much less mutex acquiring. var queue = make([]interface{}, len(chain)) var queueEvent = queueEvent{queue: queue} @@ -471,13 +466,11 @@ func (self *ChainManager) InsertChain(chain types.Blocks) error { // Do not penelise on future block. We'll need a block queue eventually that will queue // future block for future use if err == BlockFutureErr { - fmt.Println("added future block", block.Number()) self.futureBlocks.Push(block) continue } if IsParentErr(err) && self.futureBlocks.Has(block.ParentHash()) { - fmt.Println("added future block 2", block.Number()) self.futureBlocks.Push(block) continue } |