roysc/plugeth
1
0
Fork 0
forked from cerc-io/plugeth
Code Pull Requests Activity

Removed debugging

Browse Source
This commit is contained in:
obscuren 2015-04-04 18:29:11 +02:00
parent 7a18a39351
commit eff6a43419
2 changed files with 0 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
blockpool/blockpool.go
View File

@ -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 {

7
core/chain_manager.go
View File

@ -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
}