Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
whqwjb
go-ethereum
提交
d68865f3
G
go-ethereum
项目概览
whqwjb
/
go-ethereum
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
G
go-ethereum
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
d68865f3
编写于
7月 26, 2016
作者:
P
Péter Szilágyi
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
eth/downloader: fewer headers and futures too un ancestor lookup
上级
a724952f
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
17 addition
and
9 deletion
+17
-9
eth/downloader/downloader.go
eth/downloader/downloader.go
+17
-9
未找到文件。
eth/downloader/downloader.go
浏览文件 @
d68865f3
...
...
@@ -558,11 +558,17 @@ func (d *Downloader) findAncestor(p *peer, height uint64) (uint64, error) {
if
head
>
height
{
head
=
height
}
from
:=
int64
(
head
)
-
int64
(
MaxHeaderFetch
)
+
1
from
:=
int64
(
head
)
-
int64
(
MaxHeaderFetch
)
if
from
<
0
{
from
=
0
}
go
p
.
getAbsHeaders
(
uint64
(
from
),
MaxHeaderFetch
,
0
,
false
)
// Span out with 15 block gaps into the future to catch bad head reports
limit
:=
2
*
MaxHeaderFetch
/
16
count
:=
1
+
int
((
int64
(
ceil
)
-
from
)
/
16
)
if
count
>
limit
{
count
=
limit
}
go
p
.
getAbsHeaders
(
uint64
(
from
),
count
,
15
,
false
)
// Wait for the remote response to the head fetch
number
,
hash
:=
uint64
(
0
),
common
.
Hash
{}
...
...
@@ -587,12 +593,8 @@ func (d *Downloader) findAncestor(p *peer, height uint64) (uint64, error) {
}
// Make sure the peer's reply conforms to the request
for
i
:=
0
;
i
<
len
(
headers
);
i
++
{
if
number
:=
headers
[
i
]
.
Number
.
Int64
();
number
!=
from
+
int64
(
i
)
{
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"%v: head header set (item %d) broke chain ordering: requested %d, got %d"
,
p
,
i
,
from
+
int64
(
i
),
number
)
return
0
,
errInvalidChain
}
if
i
>
0
&&
headers
[
i
-
1
]
.
Hash
()
!=
headers
[
i
]
.
ParentHash
{
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"%v: head header set (item %d) broke chain ancestry: expected [%x], got [%x]"
,
p
,
i
,
headers
[
i
-
1
]
.
Hash
()
.
Bytes
()[
:
4
],
headers
[
i
]
.
ParentHash
[
:
4
])
if
number
:=
headers
[
i
]
.
Number
.
Int64
();
number
!=
from
+
int64
(
i
)
*
16
{
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"%v: head header set (item %d) broke chain ordering: requested %d, got %d"
,
p
,
i
,
from
+
int64
(
i
)
*
16
,
number
)
return
0
,
errInvalidChain
}
}
...
...
@@ -600,12 +602,18 @@ func (d *Downloader) findAncestor(p *peer, height uint64) (uint64, error) {
finished
=
true
for
i
:=
len
(
headers
)
-
1
;
i
>=
0
;
i
--
{
// Skip any headers that underflow/overflow our requested set
if
headers
[
i
]
.
Number
.
Int64
()
<
from
||
headers
[
i
]
.
Number
.
Uint64
()
>
head
{
if
headers
[
i
]
.
Number
.
Int64
()
<
from
||
headers
[
i
]
.
Number
.
Uint64
()
>
ceil
{
continue
}
// Otherwise check if we already know the header or not
if
(
d
.
mode
==
FullSync
&&
d
.
hasBlockAndState
(
headers
[
i
]
.
Hash
()))
||
(
d
.
mode
!=
FullSync
&&
d
.
hasHeader
(
headers
[
i
]
.
Hash
()))
{
number
,
hash
=
headers
[
i
]
.
Number
.
Uint64
(),
headers
[
i
]
.
Hash
()
// If every header is known, even future ones, the peer straight out lied about its head
if
number
>
height
&&
i
==
limit
-
1
{
glog
.
V
(
logger
.
Warn
)
.
Infof
(
"%v: lied about chain head: reported %d, found above %d"
,
p
,
height
,
number
)
return
0
,
errStallingPeer
}
break
}
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录