2016-11-09 01:01:56 +00:00
|
|
|
// Copyright 2016 The go-ethereum Authors
|
2016-10-14 03:51:29 +00:00
|
|
|
// This file is part of the go-ethereum library.
|
|
|
|
//
|
|
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
|
|
// (at your option) any later version.
|
|
|
|
//
|
|
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
// GNU Lesser General Public License for more details.
|
|
|
|
//
|
|
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
|
|
|
package les
|
|
|
|
|
|
|
|
import (
|
2017-10-24 13:19:09 +00:00
|
|
|
"crypto/ecdsa"
|
|
|
|
"errors"
|
2016-10-14 03:51:29 +00:00
|
|
|
"fmt"
|
|
|
|
"io"
|
|
|
|
"math/big"
|
|
|
|
|
|
|
|
"github.com/ethereum/go-ethereum/common"
|
2017-10-24 13:19:09 +00:00
|
|
|
"github.com/ethereum/go-ethereum/crypto"
|
2020-04-09 09:55:32 +00:00
|
|
|
lpc "github.com/ethereum/go-ethereum/les/lespay/client"
|
all: new p2p node representation (#17643)
Package p2p/enode provides a generalized representation of p2p nodes
which can contain arbitrary information in key/value pairs. It is also
the new home for the node database. The "v4" identity scheme is also
moved here from p2p/enr to remove the dependency on Ethereum crypto from
that package.
Record signature handling is changed significantly. The identity scheme
registry is removed and acceptable schemes must be passed to any method
that needs identity. This means records must now be validated explicitly
after decoding.
The enode API is designed to make signature handling easy and safe: most
APIs around the codebase work with enode.Node, which is a wrapper around
a valid record. Going from enr.Record to enode.Node requires a valid
signature.
* p2p/discover: port to p2p/enode
This ports the discovery code to the new node representation in
p2p/enode. The wire protocol is unchanged, this can be considered a
refactoring change. The Kademlia table can now deal with nodes using an
arbitrary identity scheme. This requires a few incompatible API changes:
- Table.Lookup is not available anymore. It used to take a public key
as argument because v4 protocol requires one. Its replacement is
LookupRandom.
- Table.Resolve takes *enode.Node instead of NodeID. This is also for
v4 protocol compatibility because nodes cannot be looked up by ID
alone.
- Types Node and NodeID are gone. Further commits in the series will be
fixes all over the the codebase to deal with those removals.
* p2p: port to p2p/enode and discovery changes
This adapts package p2p to the changes in p2p/discover. All uses of
discover.Node and discover.NodeID are replaced by their equivalents from
p2p/enode.
New API is added to retrieve the enode.Node instance of a peer. The
behavior of Server.Self with discovery disabled is improved. It now
tries much harder to report a working IP address, falling back to
127.0.0.1 if no suitable address can be determined through other means.
These changes were needed for tests of other packages later in the
series.
* p2p/simulations, p2p/testing: port to p2p/enode
No surprises here, mostly replacements of discover.Node, discover.NodeID
with their new equivalents. The 'interesting' API changes are:
- testing.ProtocolSession tracks complete nodes, not just their IDs.
- adapters.NodeConfig has a new method to create a complete node.
These changes were needed to make swarm tests work.
Note that the NodeID change makes the code incompatible with old
simulation snapshots.
* whisper/whisperv5, whisper/whisperv6: port to p2p/enode
This port was easy because whisper uses []byte for node IDs and
URL strings in the API.
* eth: port to p2p/enode
Again, easy to port because eth uses strings for node IDs and doesn't
care about node information in any way.
* les: port to p2p/enode
Apart from replacing discover.NodeID with enode.ID, most changes are in
the server pool code. It now deals with complete nodes instead
of (Pubkey, IP, Port) triples. The database format is unchanged for now,
but we should probably change it to use the node database later.
* node: port to p2p/enode
This change simply replaces discover.Node and discover.NodeID with their
new equivalents.
* swarm/network: port to p2p/enode
Swarm has its own node address representation, BzzAddr, containing both
an overlay address (the hash of a secp256k1 public key) and an underlay
address (enode:// URL).
There are no changes to the BzzAddr format in this commit, but certain
operations such as creating a BzzAddr from a node ID are now impossible
because node IDs aren't public keys anymore.
Most swarm-related changes in the series remove uses of
NewAddrFromNodeID, replacing it with NewAddr which takes a complete node
as argument. ToOverlayAddr is removed because we can just use the node
ID directly.
2018-09-24 22:59:00 +00:00
|
|
|
"github.com/ethereum/go-ethereum/p2p/enode"
|
2016-10-14 03:51:29 +00:00
|
|
|
"github.com/ethereum/go-ethereum/rlp"
|
|
|
|
)
|
|
|
|
|
|
|
|
// Constants to match up protocol versions and messages
|
|
|
|
const (
|
2017-10-24 13:19:09 +00:00
|
|
|
lpv2 = 2
|
2019-05-30 18:51:13 +00:00
|
|
|
lpv3 = 3
|
2016-10-14 03:51:29 +00:00
|
|
|
)
|
|
|
|
|
2017-10-24 13:19:09 +00:00
|
|
|
// Supported versions of the les protocol (first is primary)
|
|
|
|
var (
|
2019-05-30 18:51:13 +00:00
|
|
|
ClientProtocolVersions = []uint{lpv2, lpv3}
|
|
|
|
ServerProtocolVersions = []uint{lpv2, lpv3}
|
2018-01-22 12:38:34 +00:00
|
|
|
AdvertiseProtocolVersions = []uint{lpv2} // clients are searching for the first advertised protocol in the list
|
2017-10-24 13:19:09 +00:00
|
|
|
)
|
2016-10-14 03:51:29 +00:00
|
|
|
|
|
|
|
// Number of implemented message corresponding to different protocol versions.
|
2019-05-30 18:51:13 +00:00
|
|
|
var ProtocolLengths = map[uint]uint64{lpv2: 22, lpv3: 24}
|
2016-10-14 03:51:29 +00:00
|
|
|
|
|
|
|
const (
|
|
|
|
NetworkId = 1
|
|
|
|
ProtocolMaxMsgSize = 10 * 1024 * 1024 // Maximum cap on the size of a protocol message
|
|
|
|
)
|
|
|
|
|
|
|
|
// les protocol message codes
|
|
|
|
const (
|
2019-04-05 15:01:51 +00:00
|
|
|
// Protocol messages inherited from LPV1
|
2016-10-14 03:51:29 +00:00
|
|
|
StatusMsg = 0x00
|
|
|
|
AnnounceMsg = 0x01
|
|
|
|
GetBlockHeadersMsg = 0x02
|
|
|
|
BlockHeadersMsg = 0x03
|
|
|
|
GetBlockBodiesMsg = 0x04
|
|
|
|
BlockBodiesMsg = 0x05
|
|
|
|
GetReceiptsMsg = 0x06
|
|
|
|
ReceiptsMsg = 0x07
|
|
|
|
GetCodeMsg = 0x0a
|
|
|
|
CodeMsg = 0x0b
|
2019-04-05 15:01:51 +00:00
|
|
|
// Protocol messages introduced in LPV2
|
2017-10-24 13:19:09 +00:00
|
|
|
GetProofsV2Msg = 0x0f
|
|
|
|
ProofsV2Msg = 0x10
|
|
|
|
GetHelperTrieProofsMsg = 0x11
|
|
|
|
HelperTrieProofsMsg = 0x12
|
|
|
|
SendTxV2Msg = 0x13
|
|
|
|
GetTxStatusMsg = 0x14
|
|
|
|
TxStatusMsg = 0x15
|
2019-05-30 18:51:13 +00:00
|
|
|
// Protocol messages introduced in LPV3
|
|
|
|
StopMsg = 0x16
|
|
|
|
ResumeMsg = 0x17
|
2016-10-14 03:51:29 +00:00
|
|
|
)
|
|
|
|
|
2019-02-26 11:32:48 +00:00
|
|
|
type requestInfo struct {
|
2020-04-09 09:55:32 +00:00
|
|
|
name string
|
|
|
|
maxCount uint64
|
|
|
|
refBasketFirst, refBasketRest float64
|
2019-02-26 11:32:48 +00:00
|
|
|
}
|
|
|
|
|
2020-04-09 09:55:32 +00:00
|
|
|
// reqMapping maps an LES request to one or two lespay service vector entries.
|
|
|
|
// If rest != -1 and the request type is used with amounts larger than one then the
|
|
|
|
// first one of the multi-request is mapped to first while the rest is mapped to rest.
|
|
|
|
type reqMapping struct {
|
|
|
|
first, rest int
|
|
|
|
}
|
|
|
|
|
|
|
|
var (
|
|
|
|
// requests describes the available LES request types and their initializing amounts
|
|
|
|
// in the lespay/client.ValueTracker reference basket. Initial values are estimates
|
|
|
|
// based on the same values as the server's default cost estimates (reqAvgTimeCost).
|
|
|
|
requests = map[uint64]requestInfo{
|
|
|
|
GetBlockHeadersMsg: {"GetBlockHeaders", MaxHeaderFetch, 10, 1000},
|
|
|
|
GetBlockBodiesMsg: {"GetBlockBodies", MaxBodyFetch, 1, 0},
|
|
|
|
GetReceiptsMsg: {"GetReceipts", MaxReceiptFetch, 1, 0},
|
|
|
|
GetCodeMsg: {"GetCode", MaxCodeFetch, 1, 0},
|
|
|
|
GetProofsV2Msg: {"GetProofsV2", MaxProofsFetch, 10, 0},
|
|
|
|
GetHelperTrieProofsMsg: {"GetHelperTrieProofs", MaxHelperTrieProofsFetch, 10, 100},
|
|
|
|
SendTxV2Msg: {"SendTxV2", MaxTxSend, 1, 0},
|
|
|
|
GetTxStatusMsg: {"GetTxStatus", MaxTxStatus, 10, 0},
|
|
|
|
}
|
|
|
|
requestList []lpc.RequestInfo
|
|
|
|
requestMapping map[uint32]reqMapping
|
|
|
|
)
|
|
|
|
|
|
|
|
// init creates a request list and mapping between protocol message codes and lespay
|
|
|
|
// service vector indices.
|
|
|
|
func init() {
|
|
|
|
requestMapping = make(map[uint32]reqMapping)
|
|
|
|
for code, req := range requests {
|
|
|
|
cost := reqAvgTimeCost[code]
|
|
|
|
rm := reqMapping{len(requestList), -1}
|
|
|
|
requestList = append(requestList, lpc.RequestInfo{
|
|
|
|
Name: req.name + ".first",
|
|
|
|
InitAmount: req.refBasketFirst,
|
|
|
|
InitValue: float64(cost.baseCost + cost.reqCost),
|
|
|
|
})
|
|
|
|
if req.refBasketRest != 0 {
|
|
|
|
rm.rest = len(requestList)
|
|
|
|
requestList = append(requestList, lpc.RequestInfo{
|
|
|
|
Name: req.name + ".rest",
|
|
|
|
InitAmount: req.refBasketRest,
|
|
|
|
InitValue: float64(cost.reqCost),
|
|
|
|
})
|
|
|
|
}
|
|
|
|
requestMapping[uint32(code)] = rm
|
|
|
|
}
|
2019-02-26 11:32:48 +00:00
|
|
|
}
|
|
|
|
|
2016-10-14 03:51:29 +00:00
|
|
|
type errCode int
|
|
|
|
|
|
|
|
const (
|
|
|
|
ErrMsgTooLarge = iota
|
|
|
|
ErrDecode
|
|
|
|
ErrInvalidMsgCode
|
|
|
|
ErrProtocolVersionMismatch
|
|
|
|
ErrNetworkIdMismatch
|
|
|
|
ErrGenesisBlockMismatch
|
|
|
|
ErrNoStatusMsg
|
|
|
|
ErrExtraStatusMsg
|
|
|
|
ErrSuspendedPeer
|
|
|
|
ErrUselessPeer
|
|
|
|
ErrRequestRejected
|
|
|
|
ErrUnexpectedResponse
|
|
|
|
ErrInvalidResponse
|
|
|
|
ErrTooManyTimeouts
|
2017-10-24 13:19:09 +00:00
|
|
|
ErrMissingKey
|
2016-10-14 03:51:29 +00:00
|
|
|
)
|
|
|
|
|
|
|
|
func (e errCode) String() string {
|
|
|
|
return errorToString[int(e)]
|
|
|
|
}
|
|
|
|
|
|
|
|
// XXX change once legacy code is out
|
|
|
|
var errorToString = map[int]string{
|
|
|
|
ErrMsgTooLarge: "Message too long",
|
|
|
|
ErrDecode: "Invalid message",
|
|
|
|
ErrInvalidMsgCode: "Invalid message code",
|
|
|
|
ErrProtocolVersionMismatch: "Protocol version mismatch",
|
|
|
|
ErrNetworkIdMismatch: "NetworkId mismatch",
|
|
|
|
ErrGenesisBlockMismatch: "Genesis block mismatch",
|
|
|
|
ErrNoStatusMsg: "No status message",
|
|
|
|
ErrExtraStatusMsg: "Extra status message",
|
|
|
|
ErrSuspendedPeer: "Suspended peer",
|
|
|
|
ErrRequestRejected: "Request rejected",
|
|
|
|
ErrUnexpectedResponse: "Unexpected response",
|
|
|
|
ErrInvalidResponse: "Invalid response",
|
|
|
|
ErrTooManyTimeouts: "Too many request timeouts",
|
2017-10-24 13:19:09 +00:00
|
|
|
ErrMissingKey: "Key missing from list",
|
|
|
|
}
|
|
|
|
|
2016-10-14 03:51:29 +00:00
|
|
|
// announceData is the network packet for the block announcements.
|
|
|
|
type announceData struct {
|
|
|
|
Hash common.Hash // Hash of one particular block being announced
|
|
|
|
Number uint64 // Number of one particular block being announced
|
|
|
|
Td *big.Int // Total difficulty of one particular block being announced
|
|
|
|
ReorgDepth uint64
|
|
|
|
Update keyValueList
|
|
|
|
}
|
|
|
|
|
2019-07-08 09:42:22 +00:00
|
|
|
// sanityCheck verifies that the values are reasonable, as a DoS protection
|
|
|
|
func (a *announceData) sanityCheck() error {
|
|
|
|
if tdlen := a.Td.BitLen(); tdlen > 100 {
|
|
|
|
return fmt.Errorf("too large block TD: bitlen %d", tdlen)
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2017-10-24 13:19:09 +00:00
|
|
|
// sign adds a signature to the block announcement by the given privKey
|
|
|
|
func (a *announceData) sign(privKey *ecdsa.PrivateKey) {
|
2020-10-21 08:56:33 +00:00
|
|
|
rlp, _ := rlp.EncodeToBytes(blockInfo{a.Hash, a.Number, a.Td})
|
2017-10-24 13:19:09 +00:00
|
|
|
sig, _ := crypto.Sign(crypto.Keccak256(rlp), privKey)
|
|
|
|
a.Update = a.Update.add("sign", sig)
|
|
|
|
}
|
|
|
|
|
|
|
|
// checkSignature verifies if the block announcement has a valid signature by the given pubKey
|
2019-02-26 11:32:48 +00:00
|
|
|
func (a *announceData) checkSignature(id enode.ID, update keyValueMap) error {
|
2017-10-24 13:19:09 +00:00
|
|
|
var sig []byte
|
2019-02-26 11:32:48 +00:00
|
|
|
if err := update.get("sign", &sig); err != nil {
|
2017-10-24 13:19:09 +00:00
|
|
|
return err
|
|
|
|
}
|
2020-10-21 08:56:33 +00:00
|
|
|
rlp, _ := rlp.EncodeToBytes(blockInfo{a.Hash, a.Number, a.Td})
|
all: new p2p node representation (#17643)
Package p2p/enode provides a generalized representation of p2p nodes
which can contain arbitrary information in key/value pairs. It is also
the new home for the node database. The "v4" identity scheme is also
moved here from p2p/enr to remove the dependency on Ethereum crypto from
that package.
Record signature handling is changed significantly. The identity scheme
registry is removed and acceptable schemes must be passed to any method
that needs identity. This means records must now be validated explicitly
after decoding.
The enode API is designed to make signature handling easy and safe: most
APIs around the codebase work with enode.Node, which is a wrapper around
a valid record. Going from enr.Record to enode.Node requires a valid
signature.
* p2p/discover: port to p2p/enode
This ports the discovery code to the new node representation in
p2p/enode. The wire protocol is unchanged, this can be considered a
refactoring change. The Kademlia table can now deal with nodes using an
arbitrary identity scheme. This requires a few incompatible API changes:
- Table.Lookup is not available anymore. It used to take a public key
as argument because v4 protocol requires one. Its replacement is
LookupRandom.
- Table.Resolve takes *enode.Node instead of NodeID. This is also for
v4 protocol compatibility because nodes cannot be looked up by ID
alone.
- Types Node and NodeID are gone. Further commits in the series will be
fixes all over the the codebase to deal with those removals.
* p2p: port to p2p/enode and discovery changes
This adapts package p2p to the changes in p2p/discover. All uses of
discover.Node and discover.NodeID are replaced by their equivalents from
p2p/enode.
New API is added to retrieve the enode.Node instance of a peer. The
behavior of Server.Self with discovery disabled is improved. It now
tries much harder to report a working IP address, falling back to
127.0.0.1 if no suitable address can be determined through other means.
These changes were needed for tests of other packages later in the
series.
* p2p/simulations, p2p/testing: port to p2p/enode
No surprises here, mostly replacements of discover.Node, discover.NodeID
with their new equivalents. The 'interesting' API changes are:
- testing.ProtocolSession tracks complete nodes, not just their IDs.
- adapters.NodeConfig has a new method to create a complete node.
These changes were needed to make swarm tests work.
Note that the NodeID change makes the code incompatible with old
simulation snapshots.
* whisper/whisperv5, whisper/whisperv6: port to p2p/enode
This port was easy because whisper uses []byte for node IDs and
URL strings in the API.
* eth: port to p2p/enode
Again, easy to port because eth uses strings for node IDs and doesn't
care about node information in any way.
* les: port to p2p/enode
Apart from replacing discover.NodeID with enode.ID, most changes are in
the server pool code. It now deals with complete nodes instead
of (Pubkey, IP, Port) triples. The database format is unchanged for now,
but we should probably change it to use the node database later.
* node: port to p2p/enode
This change simply replaces discover.Node and discover.NodeID with their
new equivalents.
* swarm/network: port to p2p/enode
Swarm has its own node address representation, BzzAddr, containing both
an overlay address (the hash of a secp256k1 public key) and an underlay
address (enode:// URL).
There are no changes to the BzzAddr format in this commit, but certain
operations such as creating a BzzAddr from a node ID are now impossible
because node IDs aren't public keys anymore.
Most swarm-related changes in the series remove uses of
NewAddrFromNodeID, replacing it with NewAddr which takes a complete node
as argument. ToOverlayAddr is removed because we can just use the node
ID directly.
2018-09-24 22:59:00 +00:00
|
|
|
recPubkey, err := crypto.SigToPub(crypto.Keccak256(rlp), sig)
|
2017-10-24 13:19:09 +00:00
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
all: new p2p node representation (#17643)
Package p2p/enode provides a generalized representation of p2p nodes
which can contain arbitrary information in key/value pairs. It is also
the new home for the node database. The "v4" identity scheme is also
moved here from p2p/enr to remove the dependency on Ethereum crypto from
that package.
Record signature handling is changed significantly. The identity scheme
registry is removed and acceptable schemes must be passed to any method
that needs identity. This means records must now be validated explicitly
after decoding.
The enode API is designed to make signature handling easy and safe: most
APIs around the codebase work with enode.Node, which is a wrapper around
a valid record. Going from enr.Record to enode.Node requires a valid
signature.
* p2p/discover: port to p2p/enode
This ports the discovery code to the new node representation in
p2p/enode. The wire protocol is unchanged, this can be considered a
refactoring change. The Kademlia table can now deal with nodes using an
arbitrary identity scheme. This requires a few incompatible API changes:
- Table.Lookup is not available anymore. It used to take a public key
as argument because v4 protocol requires one. Its replacement is
LookupRandom.
- Table.Resolve takes *enode.Node instead of NodeID. This is also for
v4 protocol compatibility because nodes cannot be looked up by ID
alone.
- Types Node and NodeID are gone. Further commits in the series will be
fixes all over the the codebase to deal with those removals.
* p2p: port to p2p/enode and discovery changes
This adapts package p2p to the changes in p2p/discover. All uses of
discover.Node and discover.NodeID are replaced by their equivalents from
p2p/enode.
New API is added to retrieve the enode.Node instance of a peer. The
behavior of Server.Self with discovery disabled is improved. It now
tries much harder to report a working IP address, falling back to
127.0.0.1 if no suitable address can be determined through other means.
These changes were needed for tests of other packages later in the
series.
* p2p/simulations, p2p/testing: port to p2p/enode
No surprises here, mostly replacements of discover.Node, discover.NodeID
with their new equivalents. The 'interesting' API changes are:
- testing.ProtocolSession tracks complete nodes, not just their IDs.
- adapters.NodeConfig has a new method to create a complete node.
These changes were needed to make swarm tests work.
Note that the NodeID change makes the code incompatible with old
simulation snapshots.
* whisper/whisperv5, whisper/whisperv6: port to p2p/enode
This port was easy because whisper uses []byte for node IDs and
URL strings in the API.
* eth: port to p2p/enode
Again, easy to port because eth uses strings for node IDs and doesn't
care about node information in any way.
* les: port to p2p/enode
Apart from replacing discover.NodeID with enode.ID, most changes are in
the server pool code. It now deals with complete nodes instead
of (Pubkey, IP, Port) triples. The database format is unchanged for now,
but we should probably change it to use the node database later.
* node: port to p2p/enode
This change simply replaces discover.Node and discover.NodeID with their
new equivalents.
* swarm/network: port to p2p/enode
Swarm has its own node address representation, BzzAddr, containing both
an overlay address (the hash of a secp256k1 public key) and an underlay
address (enode:// URL).
There are no changes to the BzzAddr format in this commit, but certain
operations such as creating a BzzAddr from a node ID are now impossible
because node IDs aren't public keys anymore.
Most swarm-related changes in the series remove uses of
NewAddrFromNodeID, replacing it with NewAddr which takes a complete node
as argument. ToOverlayAddr is removed because we can just use the node
ID directly.
2018-09-24 22:59:00 +00:00
|
|
|
if id == enode.PubkeyToIDV4(recPubkey) {
|
2017-10-24 13:19:09 +00:00
|
|
|
return nil
|
|
|
|
}
|
all: new p2p node representation (#17643)
Package p2p/enode provides a generalized representation of p2p nodes
which can contain arbitrary information in key/value pairs. It is also
the new home for the node database. The "v4" identity scheme is also
moved here from p2p/enr to remove the dependency on Ethereum crypto from
that package.
Record signature handling is changed significantly. The identity scheme
registry is removed and acceptable schemes must be passed to any method
that needs identity. This means records must now be validated explicitly
after decoding.
The enode API is designed to make signature handling easy and safe: most
APIs around the codebase work with enode.Node, which is a wrapper around
a valid record. Going from enr.Record to enode.Node requires a valid
signature.
* p2p/discover: port to p2p/enode
This ports the discovery code to the new node representation in
p2p/enode. The wire protocol is unchanged, this can be considered a
refactoring change. The Kademlia table can now deal with nodes using an
arbitrary identity scheme. This requires a few incompatible API changes:
- Table.Lookup is not available anymore. It used to take a public key
as argument because v4 protocol requires one. Its replacement is
LookupRandom.
- Table.Resolve takes *enode.Node instead of NodeID. This is also for
v4 protocol compatibility because nodes cannot be looked up by ID
alone.
- Types Node and NodeID are gone. Further commits in the series will be
fixes all over the the codebase to deal with those removals.
* p2p: port to p2p/enode and discovery changes
This adapts package p2p to the changes in p2p/discover. All uses of
discover.Node and discover.NodeID are replaced by their equivalents from
p2p/enode.
New API is added to retrieve the enode.Node instance of a peer. The
behavior of Server.Self with discovery disabled is improved. It now
tries much harder to report a working IP address, falling back to
127.0.0.1 if no suitable address can be determined through other means.
These changes were needed for tests of other packages later in the
series.
* p2p/simulations, p2p/testing: port to p2p/enode
No surprises here, mostly replacements of discover.Node, discover.NodeID
with their new equivalents. The 'interesting' API changes are:
- testing.ProtocolSession tracks complete nodes, not just their IDs.
- adapters.NodeConfig has a new method to create a complete node.
These changes were needed to make swarm tests work.
Note that the NodeID change makes the code incompatible with old
simulation snapshots.
* whisper/whisperv5, whisper/whisperv6: port to p2p/enode
This port was easy because whisper uses []byte for node IDs and
URL strings in the API.
* eth: port to p2p/enode
Again, easy to port because eth uses strings for node IDs and doesn't
care about node information in any way.
* les: port to p2p/enode
Apart from replacing discover.NodeID with enode.ID, most changes are in
the server pool code. It now deals with complete nodes instead
of (Pubkey, IP, Port) triples. The database format is unchanged for now,
but we should probably change it to use the node database later.
* node: port to p2p/enode
This change simply replaces discover.Node and discover.NodeID with their
new equivalents.
* swarm/network: port to p2p/enode
Swarm has its own node address representation, BzzAddr, containing both
an overlay address (the hash of a secp256k1 public key) and an underlay
address (enode:// URL).
There are no changes to the BzzAddr format in this commit, but certain
operations such as creating a BzzAddr from a node ID are now impossible
because node IDs aren't public keys anymore.
Most swarm-related changes in the series remove uses of
NewAddrFromNodeID, replacing it with NewAddr which takes a complete node
as argument. ToOverlayAddr is removed because we can just use the node
ID directly.
2018-09-24 22:59:00 +00:00
|
|
|
return errors.New("wrong signature")
|
2017-10-24 13:19:09 +00:00
|
|
|
}
|
|
|
|
|
2016-10-14 03:51:29 +00:00
|
|
|
type blockInfo struct {
|
|
|
|
Hash common.Hash // Hash of one particular block being announced
|
|
|
|
Number uint64 // Number of one particular block being announced
|
|
|
|
Td *big.Int // Total difficulty of one particular block being announced
|
|
|
|
}
|
|
|
|
|
|
|
|
// getBlockHeadersData represents a block header query.
|
|
|
|
type getBlockHeadersData struct {
|
|
|
|
Origin hashOrNumber // Block from which to retrieve headers
|
|
|
|
Amount uint64 // Maximum number of headers to retrieve
|
|
|
|
Skip uint64 // Blocks to skip between consecutive headers
|
|
|
|
Reverse bool // Query direction (false = rising towards latest, true = falling towards genesis)
|
|
|
|
}
|
|
|
|
|
|
|
|
// hashOrNumber is a combined field for specifying an origin block.
|
|
|
|
type hashOrNumber struct {
|
|
|
|
Hash common.Hash // Block hash from which to retrieve headers (excludes Number)
|
|
|
|
Number uint64 // Block hash from which to retrieve headers (excludes Hash)
|
|
|
|
}
|
|
|
|
|
|
|
|
// EncodeRLP is a specialized encoder for hashOrNumber to encode only one of the
|
|
|
|
// two contained union fields.
|
|
|
|
func (hn *hashOrNumber) EncodeRLP(w io.Writer) error {
|
|
|
|
if hn.Hash == (common.Hash{}) {
|
|
|
|
return rlp.Encode(w, hn.Number)
|
|
|
|
}
|
|
|
|
if hn.Number != 0 {
|
|
|
|
return fmt.Errorf("both origin hash (%x) and number (%d) provided", hn.Hash, hn.Number)
|
|
|
|
}
|
|
|
|
return rlp.Encode(w, hn.Hash)
|
|
|
|
}
|
|
|
|
|
|
|
|
// DecodeRLP is a specialized decoder for hashOrNumber to decode the contents
|
|
|
|
// into either a block hash or a block number.
|
|
|
|
func (hn *hashOrNumber) DecodeRLP(s *rlp.Stream) error {
|
|
|
|
_, size, _ := s.Kind()
|
|
|
|
origin, err := s.Raw()
|
|
|
|
if err == nil {
|
|
|
|
switch {
|
|
|
|
case size == 32:
|
|
|
|
err = rlp.DecodeBytes(origin, &hn.Hash)
|
|
|
|
case size <= 8:
|
|
|
|
err = rlp.DecodeBytes(origin, &hn.Number)
|
|
|
|
default:
|
|
|
|
err = fmt.Errorf("invalid input size %d for origin", size)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
// CodeData is the network response packet for a node data retrieval.
|
|
|
|
type CodeData []struct {
|
|
|
|
Value []byte
|
|
|
|
}
|