Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
G
Geth-Modification
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
张蕾
Geth-Modification
Commits
eff6a434
Commit
eff6a434
authored
Apr 04, 2015
by
obscuren
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Removed debugging
parent
7a18a393
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
0 additions
and
9 deletions
+0
-9
blockpool.go
blockpool/blockpool.go
+0
-2
chain_manager.go
core/chain_manager.go
+0
-7
No files found.
blockpool/blockpool.go
View file @
eff6a434
...
...
@@ -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
{
...
...
core/chain_manager.go
View file @
eff6a434
...
...
@@ -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
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment