good morning!!!!
Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
B
bor
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Iterations
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package registry
Container registry
Harbor Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
open
bor
Commits
e1b4acfb
Unverified
Commit
e1b4acfb
authored
Nov 1, 2016
by
Péter Szilágyi
Browse files
Options
Downloads
Patches
Plain Diff
eth/downloader: clear pending requests when switching trie root
parent
8ecee175
No related branches found
No related tags found
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
eth/downloader/queue.go
+18
-9
18 additions, 9 deletions
eth/downloader/queue.go
with
18 additions
and
9 deletions
eth/downloader/queue.go
+
18
−
9
View file @
e1b4acfb
...
@@ -362,20 +362,20 @@ func (q *queue) Schedule(headers []*types.Header, from uint64) []*types.Header {
...
@@ -362,20 +362,20 @@ func (q *queue) Schedule(headers []*types.Header, from uint64) []*types.Header {
// Make sure chain order is honoured and preserved throughout
// Make sure chain order is honoured and preserved throughout
hash
:=
header
.
Hash
()
hash
:=
header
.
Hash
()
if
header
.
Number
==
nil
||
header
.
Number
.
Uint64
()
!=
from
{
if
header
.
Number
==
nil
||
header
.
Number
.
Uint64
()
!=
from
{
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Header #%v [%x] broke chain ordering, expected %d"
,
header
.
Number
,
hash
[
:
4
],
from
)
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Header #%v [%x
…
] broke chain ordering, expected %d"
,
header
.
Number
,
hash
[
:
4
],
from
)
break
break
}
}
if
q
.
headerHead
!=
(
common
.
Hash
{})
&&
q
.
headerHead
!=
header
.
ParentHash
{
if
q
.
headerHead
!=
(
common
.
Hash
{})
&&
q
.
headerHead
!=
header
.
ParentHash
{
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Header #%v [%x] broke chain ancestry"
,
header
.
Number
,
hash
[
:
4
])
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Header #%v [%x
…
] broke chain ancestry"
,
header
.
Number
,
hash
[
:
4
])
break
break
}
}
// Make sure no duplicate requests are executed
// Make sure no duplicate requests are executed
if
_
,
ok
:=
q
.
blockTaskPool
[
hash
];
ok
{
if
_
,
ok
:=
q
.
blockTaskPool
[
hash
];
ok
{
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Header #%d [%x] already scheduled for block fetch"
,
header
.
Number
.
Uint64
(),
hash
[
:
4
])
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Header #%d [%x
…
] already scheduled for block fetch"
,
header
.
Number
.
Uint64
(),
hash
[
:
4
])
continue
continue
}
}
if
_
,
ok
:=
q
.
receiptTaskPool
[
hash
];
ok
{
if
_
,
ok
:=
q
.
receiptTaskPool
[
hash
];
ok
{
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Header #%d [%x] already scheduled for receipt fetch"
,
header
.
Number
.
Uint64
(),
hash
[
:
4
])
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Header #%d [%x
…
] already scheduled for receipt fetch"
,
header
.
Number
.
Uint64
(),
hash
[
:
4
])
continue
continue
}
}
// Queue the header for content retrieval
// Queue the header for content retrieval
...
@@ -388,7 +388,16 @@ func (q *queue) Schedule(headers []*types.Header, from uint64) []*types.Header {
...
@@ -388,7 +388,16 @@ func (q *queue) Schedule(headers []*types.Header, from uint64) []*types.Header {
q
.
receiptTaskQueue
.
Push
(
header
,
-
float32
(
header
.
Number
.
Uint64
()))
q
.
receiptTaskQueue
.
Push
(
header
,
-
float32
(
header
.
Number
.
Uint64
()))
}
}
if
q
.
mode
==
FastSync
&&
header
.
Number
.
Uint64
()
==
q
.
fastSyncPivot
{
if
q
.
mode
==
FastSync
&&
header
.
Number
.
Uint64
()
==
q
.
fastSyncPivot
{
// Pivoting point of the fast sync, retrieve the state tries
// Pivoting point of the fast sync, switch the state retrieval to this
glog
.
V
(
logger
.
Debug
)
.
Infof
(
"Switching state downloads to %d [%x…]"
,
header
.
Number
.
Uint64
(),
header
.
Hash
()
.
Bytes
()[
:
4
])
q
.
stateTaskIndex
=
0
q
.
stateTaskPool
=
make
(
map
[
common
.
Hash
]
int
)
q
.
stateTaskQueue
.
Reset
()
for
_
,
req
:=
range
q
.
statePendPool
{
req
.
Hashes
=
make
(
map
[
common
.
Hash
]
int
)
// Make sure executing requests fail, but don't disappear
}
q
.
stateSchedLock
.
Lock
()
q
.
stateSchedLock
.
Lock
()
q
.
stateScheduler
=
state
.
NewStateSync
(
header
.
Root
,
q
.
stateDatabase
)
q
.
stateScheduler
=
state
.
NewStateSync
(
header
.
Root
,
q
.
stateDatabase
)
q
.
stateSchedLock
.
Unlock
()
q
.
stateSchedLock
.
Unlock
()
...
@@ -866,10 +875,10 @@ func (q *queue) DeliverHeaders(id string, headers []*types.Header, headerProcCh
...
@@ -866,10 +875,10 @@ func (q *queue) DeliverHeaders(id string, headers []*types.Header, headerProcCh
accepted
:=
len
(
headers
)
==
MaxHeaderFetch
accepted
:=
len
(
headers
)
==
MaxHeaderFetch
if
accepted
{
if
accepted
{
if
headers
[
0
]
.
Number
.
Uint64
()
!=
request
.
From
{
if
headers
[
0
]
.
Number
.
Uint64
()
!=
request
.
From
{
glog
.
V
(
logger
.
Detail
)
.
Infof
(
"Peer %s: first header #%v [%x] broke chain ordering, expected %d"
,
id
,
headers
[
0
]
.
Number
,
headers
[
0
]
.
Hash
()
.
Bytes
()[
:
4
],
request
.
From
)
glog
.
V
(
logger
.
Detail
)
.
Infof
(
"Peer %s: first header #%v [%x
…
] broke chain ordering, expected %d"
,
id
,
headers
[
0
]
.
Number
,
headers
[
0
]
.
Hash
()
.
Bytes
()[
:
4
],
request
.
From
)
accepted
=
false
accepted
=
false
}
else
if
headers
[
len
(
headers
)
-
1
]
.
Hash
()
!=
target
{
}
else
if
headers
[
len
(
headers
)
-
1
]
.
Hash
()
!=
target
{
glog
.
V
(
logger
.
Detail
)
.
Infof
(
"Peer %s: last header #%v [%x] broke skeleton structure, expected %x"
,
id
,
headers
[
len
(
headers
)
-
1
]
.
Number
,
headers
[
len
(
headers
)
-
1
]
.
Hash
()
.
Bytes
()[
:
4
],
target
[
:
4
])
glog
.
V
(
logger
.
Detail
)
.
Infof
(
"Peer %s: last header #%v [%x
…
] broke skeleton structure, expected %x"
,
id
,
headers
[
len
(
headers
)
-
1
]
.
Number
,
headers
[
len
(
headers
)
-
1
]
.
Hash
()
.
Bytes
()[
:
4
],
target
[
:
4
])
accepted
=
false
accepted
=
false
}
}
}
}
...
@@ -877,12 +886,12 @@ func (q *queue) DeliverHeaders(id string, headers []*types.Header, headerProcCh
...
@@ -877,12 +886,12 @@ func (q *queue) DeliverHeaders(id string, headers []*types.Header, headerProcCh
for
i
,
header
:=
range
headers
[
1
:
]
{
for
i
,
header
:=
range
headers
[
1
:
]
{
hash
:=
header
.
Hash
()
hash
:=
header
.
Hash
()
if
want
:=
request
.
From
+
1
+
uint64
(
i
);
header
.
Number
.
Uint64
()
!=
want
{
if
want
:=
request
.
From
+
1
+
uint64
(
i
);
header
.
Number
.
Uint64
()
!=
want
{
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Peer %s: header #%v [%x] broke chain ordering, expected %d"
,
id
,
header
.
Number
,
hash
[
:
4
],
want
)
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Peer %s: header #%v [%x
…
] broke chain ordering, expected %d"
,
id
,
header
.
Number
,
hash
[
:
4
],
want
)
accepted
=
false
accepted
=
false
break
break
}
}
if
headers
[
i
]
.
Hash
()
!=
header
.
ParentHash
{
if
headers
[
i
]
.
Hash
()
!=
header
.
ParentHash
{
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Peer %s: header #%v [%x] broke chain ancestry"
,
id
,
header
.
Number
,
hash
[
:
4
])
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"Peer %s: header #%v [%x
…
] broke chain ancestry"
,
id
,
header
.
Number
,
hash
[
:
4
])
accepted
=
false
accepted
=
false
break
break
}
}
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment