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
2cffd4ff
Commit
2cffd4ff
authored
Jul 30, 2018
by
Ha ĐANG
Committed by
Péter Szilágyi
Jul 30, 2018
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
core: fix some small typos on comment code (#17278)
parent
7b1aa642
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
3 additions
and
3 deletions
+3
-3
blockchain.go
core/blockchain.go
+1
-1
headerchain.go
core/headerchain.go
+1
-1
tx_list.go
core/tx_list.go
+1
-1
No files found.
core/blockchain.go
View file @
2cffd4ff
...
...
@@ -1016,7 +1016,7 @@ func (bc *BlockChain) insertChain(chain types.Blocks) (int, []interface{}, []*ty
// Do a sanity check that the provided chain is actually ordered and linked
for
i
:=
1
;
i
<
len
(
chain
);
i
++
{
if
chain
[
i
]
.
NumberU64
()
!=
chain
[
i
-
1
]
.
NumberU64
()
+
1
||
chain
[
i
]
.
ParentHash
()
!=
chain
[
i
-
1
]
.
Hash
()
{
// Chain broke ancestry, log a messge (programming error) and skip insertion
// Chain broke ancestry, log a mess
a
ge (programming error) and skip insertion
log
.
Error
(
"Non contiguous block insert"
,
"number"
,
chain
[
i
]
.
Number
(),
"hash"
,
chain
[
i
]
.
Hash
(),
"parent"
,
chain
[
i
]
.
ParentHash
(),
"prevnumber"
,
chain
[
i
-
1
]
.
Number
(),
"prevhash"
,
chain
[
i
-
1
]
.
Hash
())
...
...
core/headerchain.go
View file @
2cffd4ff
...
...
@@ -208,7 +208,7 @@ func (hc *HeaderChain) ValidateHeaderChain(chain []*types.Header, checkFreq int)
// Do a sanity check that the provided chain is actually ordered and linked
for
i
:=
1
;
i
<
len
(
chain
);
i
++
{
if
chain
[
i
]
.
Number
.
Uint64
()
!=
chain
[
i
-
1
]
.
Number
.
Uint64
()
+
1
||
chain
[
i
]
.
ParentHash
!=
chain
[
i
-
1
]
.
Hash
()
{
// Chain broke ancestry, log a messge (programming error) and skip insertion
// Chain broke ancestry, log a mess
a
ge (programming error) and skip insertion
log
.
Error
(
"Non contiguous header insert"
,
"number"
,
chain
[
i
]
.
Number
,
"hash"
,
chain
[
i
]
.
Hash
(),
"parent"
,
chain
[
i
]
.
ParentHash
,
"prevnumber"
,
chain
[
i
-
1
]
.
Number
,
"prevhash"
,
chain
[
i
-
1
]
.
Hash
())
...
...
core/tx_list.go
View file @
2cffd4ff
...
...
@@ -436,7 +436,7 @@ func (l *txPricedList) Removed() {
}
// Cap finds all the transactions below the given price threshold, drops them
// from the priced list and returs them for further removal from the entire pool.
// from the priced list and retur
n
s them for further removal from the entire pool.
func
(
l
*
txPricedList
)
Cap
(
threshold
*
big
.
Int
,
local
*
accountSet
)
types
.
Transactions
{
drop
:=
make
(
types
.
Transactions
,
0
,
128
)
// Remote underpriced transactions to drop
save
:=
make
(
types
.
Transactions
,
0
,
64
)
// Local underpriced transactions to keep
...
...
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