2016-11-25 05:50:30 +00:00
|
|
|
// Copyright 2016 The go-ethereum Authors
|
2016-06-20 14:47:10 +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 implements the Light Ethereum Subprotocol.
|
|
|
|
package les
|
|
|
|
|
|
|
|
import (
|
|
|
|
"errors"
|
|
|
|
"fmt"
|
|
|
|
"math/big"
|
|
|
|
"sync"
|
2017-05-01 11:09:48 +00:00
|
|
|
"time"
|
2016-06-20 14:47:10 +00:00
|
|
|
|
|
|
|
"github.com/ethereum/go-ethereum/common"
|
|
|
|
"github.com/ethereum/go-ethereum/core/types"
|
|
|
|
"github.com/ethereum/go-ethereum/eth"
|
|
|
|
"github.com/ethereum/go-ethereum/les/flowcontrol"
|
2018-01-15 20:26:41 +00:00
|
|
|
"github.com/ethereum/go-ethereum/light"
|
2016-06-20 14:47:10 +00:00
|
|
|
"github.com/ethereum/go-ethereum/p2p"
|
|
|
|
"github.com/ethereum/go-ethereum/rlp"
|
|
|
|
)
|
|
|
|
|
|
|
|
var (
|
2018-09-25 08:55:54 +00:00
|
|
|
errClosed = errors.New("peer set is closed")
|
|
|
|
errAlreadyRegistered = errors.New("peer is already registered")
|
|
|
|
errNotRegistered = errors.New("peer is not registered")
|
|
|
|
errInvalidHelpTrieReq = errors.New("invalid help trie request")
|
2016-06-20 14:47:10 +00:00
|
|
|
)
|
|
|
|
|
2017-10-10 09:38:49 +00:00
|
|
|
const maxResponseErrors = 50 // number of invalid responses tolerated (makes the protocol less brittle but still avoids spam)
|
2016-06-20 14:47:10 +00:00
|
|
|
|
2019-06-09 07:24:20 +00:00
|
|
|
// if the total encoded size of a sent transaction batch is over txSizeCostLimit
|
|
|
|
// per transaction then the request cost is calculated as proportional to the
|
|
|
|
// encoded size instead of the transaction count
|
|
|
|
const txSizeCostLimit = 0x4000
|
|
|
|
|
2018-01-15 20:26:41 +00:00
|
|
|
const (
|
|
|
|
announceTypeNone = iota
|
|
|
|
announceTypeSimple
|
|
|
|
announceTypeSigned
|
|
|
|
)
|
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
type peer struct {
|
|
|
|
*p2p.Peer
|
|
|
|
|
|
|
|
rw p2p.MsgReadWriter
|
|
|
|
|
2017-05-01 11:09:48 +00:00
|
|
|
version int // Protocol version negotiated
|
|
|
|
network uint64 // Network ID being on
|
2016-06-20 14:47:10 +00:00
|
|
|
|
2018-10-16 11:27:11 +00:00
|
|
|
announceType uint64
|
2018-01-15 20:26:41 +00:00
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
id string
|
|
|
|
|
2017-05-01 11:09:48 +00:00
|
|
|
headInfo *announceData
|
|
|
|
lock sync.RWMutex
|
2016-06-20 14:47:10 +00:00
|
|
|
|
2016-11-25 05:50:30 +00:00
|
|
|
announceChn chan announceData
|
2017-05-01 11:09:48 +00:00
|
|
|
sendQueue *execQueue
|
|
|
|
|
|
|
|
poolEntry *poolEntry
|
2018-11-14 07:03:58 +00:00
|
|
|
hasBlock func(common.Hash, uint64, bool) bool
|
2017-05-01 11:09:48 +00:00
|
|
|
responseErrors int
|
2016-06-20 14:47:10 +00:00
|
|
|
|
2016-07-26 02:54:35 +00:00
|
|
|
fcClient *flowcontrol.ClientNode // nil if the peer is server only
|
|
|
|
fcServer *flowcontrol.ServerNode // nil if the peer is client only
|
|
|
|
fcServerParams *flowcontrol.ServerParams
|
|
|
|
fcCosts requestCostTable
|
2018-10-16 11:27:11 +00:00
|
|
|
|
|
|
|
isTrusted bool
|
|
|
|
isOnlyAnnounce bool
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
|
2018-10-16 11:27:11 +00:00
|
|
|
func newPeer(version int, network uint64, isTrusted bool, p *p2p.Peer, rw p2p.MsgReadWriter) *peer {
|
2016-06-20 14:47:10 +00:00
|
|
|
id := p.ID()
|
|
|
|
|
|
|
|
return &peer{
|
2016-11-25 05:50:30 +00:00
|
|
|
Peer: p,
|
|
|
|
rw: rw,
|
|
|
|
version: version,
|
|
|
|
network: network,
|
|
|
|
id: fmt.Sprintf("%x", id[:8]),
|
|
|
|
announceChn: make(chan announceData, 20),
|
2018-10-16 11:27:11 +00:00
|
|
|
isTrusted: isTrusted,
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-05-01 11:09:48 +00:00
|
|
|
func (p *peer) canQueue() bool {
|
|
|
|
return p.sendQueue.canQueue()
|
|
|
|
}
|
|
|
|
|
|
|
|
func (p *peer) queueSend(f func()) {
|
|
|
|
p.sendQueue.queue(f)
|
|
|
|
}
|
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
// Info gathers and returns a collection of metadata known about a peer.
|
|
|
|
func (p *peer) Info() *eth.PeerInfo {
|
|
|
|
return ð.PeerInfo{
|
|
|
|
Version: p.version,
|
|
|
|
Difficulty: p.Td(),
|
|
|
|
Head: fmt.Sprintf("%x", p.Head()),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Head retrieves a copy of the current head (most recent) hash of the peer.
|
|
|
|
func (p *peer) Head() (hash common.Hash) {
|
|
|
|
p.lock.RLock()
|
|
|
|
defer p.lock.RUnlock()
|
|
|
|
|
2016-07-03 19:44:31 +00:00
|
|
|
copy(hash[:], p.headInfo.Hash[:])
|
2016-06-20 14:47:10 +00:00
|
|
|
return hash
|
|
|
|
}
|
|
|
|
|
2016-09-08 09:45:12 +00:00
|
|
|
func (p *peer) HeadAndTd() (hash common.Hash, td *big.Int) {
|
|
|
|
p.lock.RLock()
|
|
|
|
defer p.lock.RUnlock()
|
|
|
|
|
|
|
|
copy(hash[:], p.headInfo.Hash[:])
|
|
|
|
return hash, p.headInfo.Td
|
|
|
|
}
|
|
|
|
|
2016-07-03 19:44:31 +00:00
|
|
|
func (p *peer) headBlockInfo() blockInfo {
|
|
|
|
p.lock.RLock()
|
|
|
|
defer p.lock.RUnlock()
|
|
|
|
|
2016-07-26 02:54:35 +00:00
|
|
|
return blockInfo{Hash: p.headInfo.Hash, Number: p.headInfo.Number, Td: p.headInfo.Td}
|
|
|
|
}
|
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
// Td retrieves the current total difficulty of a peer.
|
|
|
|
func (p *peer) Td() *big.Int {
|
|
|
|
p.lock.RLock()
|
|
|
|
defer p.lock.RUnlock()
|
|
|
|
|
2016-07-03 19:44:31 +00:00
|
|
|
return new(big.Int).Set(p.headInfo.Td)
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
|
2017-05-01 11:09:48 +00:00
|
|
|
// waitBefore implements distPeer interface
|
|
|
|
func (p *peer) waitBefore(maxCost uint64) (time.Duration, float64) {
|
|
|
|
return p.fcServer.CanSend(maxCost)
|
|
|
|
}
|
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
func sendRequest(w p2p.MsgWriter, msgcode, reqID, cost uint64, data interface{}) error {
|
|
|
|
type req struct {
|
|
|
|
ReqID uint64
|
|
|
|
Data interface{}
|
|
|
|
}
|
|
|
|
return p2p.Send(w, msgcode, req{reqID, data})
|
|
|
|
}
|
|
|
|
|
|
|
|
func sendResponse(w p2p.MsgWriter, msgcode, reqID, bv uint64, data interface{}) error {
|
|
|
|
type resp struct {
|
|
|
|
ReqID, BV uint64
|
|
|
|
Data interface{}
|
|
|
|
}
|
|
|
|
return p2p.Send(w, msgcode, resp{reqID, bv, data})
|
|
|
|
}
|
|
|
|
|
|
|
|
func (p *peer) GetRequestCost(msgcode uint64, amount int) uint64 {
|
2017-05-01 11:09:48 +00:00
|
|
|
p.lock.RLock()
|
|
|
|
defer p.lock.RUnlock()
|
|
|
|
|
2019-06-09 07:24:20 +00:00
|
|
|
costs := p.fcCosts[msgcode]
|
|
|
|
if costs == nil {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
cost := costs.baseCost + costs.reqCost*uint64(amount)
|
|
|
|
if cost > p.fcServerParams.BufLimit {
|
|
|
|
cost = p.fcServerParams.BufLimit
|
|
|
|
}
|
|
|
|
return cost
|
|
|
|
}
|
|
|
|
|
|
|
|
func (p *peer) GetTxRelayCost(amount, size int) uint64 {
|
|
|
|
p.lock.RLock()
|
|
|
|
defer p.lock.RUnlock()
|
|
|
|
|
|
|
|
var msgcode uint64
|
|
|
|
switch p.version {
|
|
|
|
case lpv1:
|
|
|
|
msgcode = SendTxMsg
|
|
|
|
case lpv2:
|
|
|
|
msgcode = SendTxV2Msg
|
|
|
|
default:
|
|
|
|
panic(nil)
|
|
|
|
}
|
|
|
|
|
|
|
|
costs := p.fcCosts[msgcode]
|
|
|
|
if costs == nil {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
cost := costs.baseCost + costs.reqCost*uint64(amount)
|
|
|
|
sizeCost := costs.baseCost + costs.reqCost*uint64(size)/txSizeCostLimit
|
|
|
|
if sizeCost > cost {
|
|
|
|
cost = sizeCost
|
|
|
|
}
|
|
|
|
|
2016-07-26 02:54:35 +00:00
|
|
|
if cost > p.fcServerParams.BufLimit {
|
|
|
|
cost = p.fcServerParams.BufLimit
|
|
|
|
}
|
|
|
|
return cost
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
|
2017-05-01 11:09:48 +00:00
|
|
|
// HasBlock checks if the peer has a given block
|
2018-11-14 07:03:58 +00:00
|
|
|
func (p *peer) HasBlock(hash common.Hash, number uint64, hasState bool) bool {
|
2017-05-01 11:09:48 +00:00
|
|
|
p.lock.RLock()
|
2017-08-04 16:14:17 +00:00
|
|
|
hasBlock := p.hasBlock
|
2017-05-01 11:09:48 +00:00
|
|
|
p.lock.RUnlock()
|
2018-11-14 07:03:58 +00:00
|
|
|
return hasBlock != nil && hasBlock(hash, number, hasState)
|
2017-05-01 11:09:48 +00:00
|
|
|
}
|
|
|
|
|
2016-11-25 05:50:30 +00:00
|
|
|
// SendAnnounce announces the availability of a number of blocks through
|
2016-07-03 19:44:31 +00:00
|
|
|
// a hash notification.
|
2016-11-25 05:50:30 +00:00
|
|
|
func (p *peer) SendAnnounce(request announceData) error {
|
|
|
|
return p2p.Send(p.rw, AnnounceMsg, request)
|
2016-07-03 19:44:31 +00:00
|
|
|
}
|
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
// SendBlockHeaders sends a batch of block headers to the remote peer.
|
2016-07-03 19:44:31 +00:00
|
|
|
func (p *peer) SendBlockHeaders(reqID, bv uint64, headers []*types.Header) error {
|
2016-06-20 14:47:10 +00:00
|
|
|
return sendResponse(p.rw, BlockHeadersMsg, reqID, bv, headers)
|
|
|
|
}
|
|
|
|
|
|
|
|
// SendBlockBodiesRLP sends a batch of block contents to the remote peer from
|
|
|
|
// an already RLP encoded format.
|
|
|
|
func (p *peer) SendBlockBodiesRLP(reqID, bv uint64, bodies []rlp.RawValue) error {
|
|
|
|
return sendResponse(p.rw, BlockBodiesMsg, reqID, bv, bodies)
|
|
|
|
}
|
|
|
|
|
|
|
|
// SendCodeRLP sends a batch of arbitrary internal data, corresponding to the
|
|
|
|
// hashes requested.
|
|
|
|
func (p *peer) SendCode(reqID, bv uint64, data [][]byte) error {
|
|
|
|
return sendResponse(p.rw, CodeMsg, reqID, bv, data)
|
|
|
|
}
|
|
|
|
|
|
|
|
// SendReceiptsRLP sends a batch of transaction receipts, corresponding to the
|
|
|
|
// ones requested from an already RLP encoded format.
|
|
|
|
func (p *peer) SendReceiptsRLP(reqID, bv uint64, receipts []rlp.RawValue) error {
|
|
|
|
return sendResponse(p.rw, ReceiptsMsg, reqID, bv, receipts)
|
|
|
|
}
|
|
|
|
|
2018-01-15 20:26:41 +00:00
|
|
|
// SendProofs sends a batch of legacy LES/1 merkle proofs, corresponding to the ones requested.
|
2016-06-20 14:47:10 +00:00
|
|
|
func (p *peer) SendProofs(reqID, bv uint64, proofs proofsData) error {
|
2018-01-15 20:26:41 +00:00
|
|
|
return sendResponse(p.rw, ProofsV1Msg, reqID, bv, proofs)
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
|
2018-01-15 20:26:41 +00:00
|
|
|
// SendProofsV2 sends a batch of merkle proofs, corresponding to the ones requested.
|
|
|
|
func (p *peer) SendProofsV2(reqID, bv uint64, proofs light.NodeList) error {
|
|
|
|
return sendResponse(p.rw, ProofsV2Msg, reqID, bv, proofs)
|
|
|
|
}
|
|
|
|
|
|
|
|
// SendHeaderProofs sends a batch of legacy LES/1 header proofs, corresponding to the ones requested.
|
2016-07-26 02:54:35 +00:00
|
|
|
func (p *peer) SendHeaderProofs(reqID, bv uint64, proofs []ChtResp) error {
|
|
|
|
return sendResponse(p.rw, HeaderProofsMsg, reqID, bv, proofs)
|
|
|
|
}
|
|
|
|
|
2018-01-15 20:26:41 +00:00
|
|
|
// SendHelperTrieProofs sends a batch of HelperTrie proofs, corresponding to the ones requested.
|
|
|
|
func (p *peer) SendHelperTrieProofs(reqID, bv uint64, resp HelperTrieResps) error {
|
|
|
|
return sendResponse(p.rw, HelperTrieProofsMsg, reqID, bv, resp)
|
|
|
|
}
|
|
|
|
|
|
|
|
// SendTxStatus sends a batch of transaction status records, corresponding to the ones requested.
|
|
|
|
func (p *peer) SendTxStatus(reqID, bv uint64, stats []txStatus) error {
|
|
|
|
return sendResponse(p.rw, TxStatusMsg, reqID, bv, stats)
|
|
|
|
}
|
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
// RequestHeadersByHash fetches a batch of blocks' headers corresponding to the
|
|
|
|
// specified header query, based on the hash of an origin block.
|
|
|
|
func (p *peer) RequestHeadersByHash(reqID, cost uint64, origin common.Hash, amount int, skip int, reverse bool) error {
|
2017-05-01 11:09:48 +00:00
|
|
|
p.Log().Debug("Fetching batch of headers", "count", amount, "fromhash", origin, "skip", skip, "reverse", reverse)
|
2016-06-20 14:47:10 +00:00
|
|
|
return sendRequest(p.rw, GetBlockHeadersMsg, reqID, cost, &getBlockHeadersData{Origin: hashOrNumber{Hash: origin}, Amount: uint64(amount), Skip: uint64(skip), Reverse: reverse})
|
|
|
|
}
|
|
|
|
|
|
|
|
// RequestHeadersByNumber fetches a batch of blocks' headers corresponding to the
|
|
|
|
// specified header query, based on the number of an origin block.
|
|
|
|
func (p *peer) RequestHeadersByNumber(reqID, cost, origin uint64, amount int, skip int, reverse bool) error {
|
2017-05-01 11:09:48 +00:00
|
|
|
p.Log().Debug("Fetching batch of headers", "count", amount, "fromnum", origin, "skip", skip, "reverse", reverse)
|
2016-06-20 14:47:10 +00:00
|
|
|
return sendRequest(p.rw, GetBlockHeadersMsg, reqID, cost, &getBlockHeadersData{Origin: hashOrNumber{Number: origin}, Amount: uint64(amount), Skip: uint64(skip), Reverse: reverse})
|
|
|
|
}
|
|
|
|
|
|
|
|
// RequestBodies fetches a batch of blocks' bodies corresponding to the hashes
|
|
|
|
// specified.
|
|
|
|
func (p *peer) RequestBodies(reqID, cost uint64, hashes []common.Hash) error {
|
2017-05-01 11:09:48 +00:00
|
|
|
p.Log().Debug("Fetching batch of block bodies", "count", len(hashes))
|
2016-06-20 14:47:10 +00:00
|
|
|
return sendRequest(p.rw, GetBlockBodiesMsg, reqID, cost, hashes)
|
|
|
|
}
|
|
|
|
|
|
|
|
// RequestCode fetches a batch of arbitrary data from a node's known state
|
|
|
|
// data, corresponding to the specified hashes.
|
2018-01-15 20:26:41 +00:00
|
|
|
func (p *peer) RequestCode(reqID, cost uint64, reqs []CodeReq) error {
|
2017-05-01 11:09:48 +00:00
|
|
|
p.Log().Debug("Fetching batch of codes", "count", len(reqs))
|
2016-06-20 14:47:10 +00:00
|
|
|
return sendRequest(p.rw, GetCodeMsg, reqID, cost, reqs)
|
|
|
|
}
|
|
|
|
|
|
|
|
// RequestReceipts fetches a batch of transaction receipts from a remote node.
|
|
|
|
func (p *peer) RequestReceipts(reqID, cost uint64, hashes []common.Hash) error {
|
2017-05-01 11:09:48 +00:00
|
|
|
p.Log().Debug("Fetching batch of receipts", "count", len(hashes))
|
2016-06-20 14:47:10 +00:00
|
|
|
return sendRequest(p.rw, GetReceiptsMsg, reqID, cost, hashes)
|
|
|
|
}
|
|
|
|
|
|
|
|
// RequestProofs fetches a batch of merkle proofs from a remote node.
|
2018-01-15 20:26:41 +00:00
|
|
|
func (p *peer) RequestProofs(reqID, cost uint64, reqs []ProofReq) error {
|
2017-05-01 11:09:48 +00:00
|
|
|
p.Log().Debug("Fetching batch of proofs", "count", len(reqs))
|
2018-01-15 20:26:41 +00:00
|
|
|
switch p.version {
|
|
|
|
case lpv1:
|
|
|
|
return sendRequest(p.rw, GetProofsV1Msg, reqID, cost, reqs)
|
|
|
|
case lpv2:
|
|
|
|
return sendRequest(p.rw, GetProofsV2Msg, reqID, cost, reqs)
|
|
|
|
default:
|
|
|
|
panic(nil)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// RequestHelperTrieProofs fetches a batch of HelperTrie merkle proofs from a remote node.
|
2018-09-25 08:55:54 +00:00
|
|
|
func (p *peer) RequestHelperTrieProofs(reqID, cost uint64, data interface{}) error {
|
2018-01-15 20:26:41 +00:00
|
|
|
switch p.version {
|
|
|
|
case lpv1:
|
2018-09-25 08:55:54 +00:00
|
|
|
reqs, ok := data.([]ChtReq)
|
|
|
|
if !ok {
|
|
|
|
return errInvalidHelpTrieReq
|
2018-01-15 20:26:41 +00:00
|
|
|
}
|
2018-09-25 08:55:54 +00:00
|
|
|
p.Log().Debug("Fetching batch of header proofs", "count", len(reqs))
|
|
|
|
return sendRequest(p.rw, GetHeaderProofsMsg, reqID, cost, reqs)
|
2018-01-15 20:26:41 +00:00
|
|
|
case lpv2:
|
2018-09-25 08:55:54 +00:00
|
|
|
reqs, ok := data.([]HelperTrieReq)
|
|
|
|
if !ok {
|
|
|
|
return errInvalidHelpTrieReq
|
|
|
|
}
|
|
|
|
p.Log().Debug("Fetching batch of HelperTrie proofs", "count", len(reqs))
|
2018-01-15 20:26:41 +00:00
|
|
|
return sendRequest(p.rw, GetHelperTrieProofsMsg, reqID, cost, reqs)
|
|
|
|
default:
|
|
|
|
panic(nil)
|
|
|
|
}
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
|
2018-01-15 20:26:41 +00:00
|
|
|
// RequestTxStatus fetches a batch of transaction status records from a remote node.
|
|
|
|
func (p *peer) RequestTxStatus(reqID, cost uint64, txHashes []common.Hash) error {
|
|
|
|
p.Log().Debug("Requesting transaction status", "count", len(txHashes))
|
|
|
|
return sendRequest(p.rw, GetTxStatusMsg, reqID, cost, txHashes)
|
2016-07-26 02:54:35 +00:00
|
|
|
}
|
|
|
|
|
2019-06-09 07:24:20 +00:00
|
|
|
// SendTxs sends a batch of transactions to be added to the remote transaction pool.
|
|
|
|
func (p *peer) SendTxs(reqID, cost uint64, txs rlp.RawValue) error {
|
|
|
|
p.Log().Debug("Fetching batch of transactions", "size", len(txs))
|
2018-01-15 20:26:41 +00:00
|
|
|
switch p.version {
|
|
|
|
case lpv1:
|
|
|
|
return p2p.Send(p.rw, SendTxMsg, txs) // old message format does not include reqID
|
|
|
|
case lpv2:
|
|
|
|
return sendRequest(p.rw, SendTxV2Msg, reqID, cost, txs)
|
|
|
|
default:
|
|
|
|
panic(nil)
|
|
|
|
}
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
|
2016-07-26 02:54:35 +00:00
|
|
|
type keyValueEntry struct {
|
|
|
|
Key string
|
2016-06-20 14:47:10 +00:00
|
|
|
Value rlp.RawValue
|
|
|
|
}
|
|
|
|
type keyValueList []keyValueEntry
|
|
|
|
type keyValueMap map[string]rlp.RawValue
|
|
|
|
|
|
|
|
func (l keyValueList) add(key string, val interface{}) keyValueList {
|
|
|
|
var entry keyValueEntry
|
|
|
|
entry.Key = key
|
|
|
|
if val == nil {
|
|
|
|
val = uint64(0)
|
|
|
|
}
|
|
|
|
enc, err := rlp.EncodeToBytes(val)
|
|
|
|
if err == nil {
|
|
|
|
entry.Value = enc
|
|
|
|
}
|
|
|
|
return append(l, entry)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (l keyValueList) decode() keyValueMap {
|
|
|
|
m := make(keyValueMap)
|
|
|
|
for _, entry := range l {
|
|
|
|
m[entry.Key] = entry.Value
|
|
|
|
}
|
|
|
|
return m
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m keyValueMap) get(key string, val interface{}) error {
|
|
|
|
enc, ok := m[key]
|
|
|
|
if !ok {
|
2018-01-15 20:26:41 +00:00
|
|
|
return errResp(ErrMissingKey, "%s", key)
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
if val == nil {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
return rlp.DecodeBytes(enc, val)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (p *peer) sendReceiveHandshake(sendList keyValueList) (keyValueList, error) {
|
|
|
|
// Send out own handshake in a new thread
|
|
|
|
errc := make(chan error, 1)
|
|
|
|
go func() {
|
|
|
|
errc <- p2p.Send(p.rw, StatusMsg, sendList)
|
|
|
|
}()
|
|
|
|
// In the mean time retrieve the remote status message
|
|
|
|
msg, err := p.rw.ReadMsg()
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
if msg.Code != StatusMsg {
|
|
|
|
return nil, errResp(ErrNoStatusMsg, "first msg has code %x (!= %x)", msg.Code, StatusMsg)
|
|
|
|
}
|
|
|
|
if msg.Size > ProtocolMaxMsgSize {
|
|
|
|
return nil, errResp(ErrMsgTooLarge, "%v > %v", msg.Size, ProtocolMaxMsgSize)
|
|
|
|
}
|
|
|
|
// Decode the handshake
|
|
|
|
var recvList keyValueList
|
|
|
|
if err := msg.Decode(&recvList); err != nil {
|
|
|
|
return nil, errResp(ErrDecode, "msg %v: %v", msg, err)
|
|
|
|
}
|
|
|
|
if err := <-errc; err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
return recvList, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Handshake executes the les protocol handshake, negotiating version number,
|
|
|
|
// network IDs, difficulties, head and genesis blocks.
|
2016-07-03 19:44:31 +00:00
|
|
|
func (p *peer) Handshake(td *big.Int, head common.Hash, headNum uint64, genesis common.Hash, server *LesServer) error {
|
2016-06-20 14:47:10 +00:00
|
|
|
p.lock.Lock()
|
|
|
|
defer p.lock.Unlock()
|
|
|
|
|
|
|
|
var send keyValueList
|
|
|
|
send = send.add("protocolVersion", uint64(p.version))
|
2018-01-15 20:26:41 +00:00
|
|
|
send = send.add("networkId", p.network)
|
2016-07-03 19:44:31 +00:00
|
|
|
send = send.add("headTd", td)
|
|
|
|
send = send.add("headHash", head)
|
|
|
|
send = send.add("headNum", headNum)
|
2016-06-20 14:47:10 +00:00
|
|
|
send = send.add("genesisHash", genesis)
|
|
|
|
if server != nil {
|
2018-10-16 11:27:11 +00:00
|
|
|
if !server.onlyAnnounce {
|
|
|
|
//only announce server. It sends only announse requests
|
|
|
|
send = send.add("serveHeaders", nil)
|
|
|
|
send = send.add("serveChainSince", uint64(0))
|
|
|
|
send = send.add("serveStateSince", uint64(0))
|
|
|
|
send = send.add("txRelay", nil)
|
|
|
|
}
|
2016-06-20 14:47:10 +00:00
|
|
|
send = send.add("flowControl/BL", server.defParams.BufLimit)
|
|
|
|
send = send.add("flowControl/MRR", server.defParams.MinRecharge)
|
|
|
|
list := server.fcCostStats.getCurrentList()
|
|
|
|
send = send.add("flowControl/MRC", list)
|
|
|
|
p.fcCosts = list.decode()
|
2018-01-15 20:26:41 +00:00
|
|
|
} else {
|
2018-10-16 11:27:11 +00:00
|
|
|
//on client node
|
|
|
|
p.announceType = announceTypeSimple
|
|
|
|
if p.isTrusted {
|
|
|
|
p.announceType = announceTypeSigned
|
|
|
|
}
|
|
|
|
send = send.add("announceType", p.announceType)
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
2018-10-16 11:27:11 +00:00
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
recvList, err := p.sendReceiveHandshake(send)
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
2018-10-16 11:27:11 +00:00
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
recv := recvList.decode()
|
2016-07-26 02:54:35 +00:00
|
|
|
|
2016-07-03 19:44:31 +00:00
|
|
|
var rGenesis, rHash common.Hash
|
|
|
|
var rVersion, rNetwork, rNum uint64
|
2016-06-20 14:47:10 +00:00
|
|
|
var rTd *big.Int
|
|
|
|
|
|
|
|
if err := recv.get("protocolVersion", &rVersion); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
if err := recv.get("networkId", &rNetwork); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
2016-07-03 19:44:31 +00:00
|
|
|
if err := recv.get("headTd", &rTd); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
if err := recv.get("headHash", &rHash); err != nil {
|
2016-06-20 14:47:10 +00:00
|
|
|
return err
|
|
|
|
}
|
2016-07-03 19:44:31 +00:00
|
|
|
if err := recv.get("headNum", &rNum); err != nil {
|
2016-06-20 14:47:10 +00:00
|
|
|
return err
|
|
|
|
}
|
|
|
|
if err := recv.get("genesisHash", &rGenesis); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
2016-07-26 02:54:35 +00:00
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
if rGenesis != genesis {
|
2017-05-01 11:09:48 +00:00
|
|
|
return errResp(ErrGenesisBlockMismatch, "%x (!= %x)", rGenesis[:8], genesis[:8])
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
2017-05-01 11:09:48 +00:00
|
|
|
if rNetwork != p.network {
|
2016-06-20 14:47:10 +00:00
|
|
|
return errResp(ErrNetworkIdMismatch, "%d (!= %d)", rNetwork, p.network)
|
|
|
|
}
|
|
|
|
if int(rVersion) != p.version {
|
|
|
|
return errResp(ErrProtocolVersionMismatch, "%d (!= %d)", rVersion, p.version)
|
|
|
|
}
|
2018-10-16 11:27:11 +00:00
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
if server != nil {
|
2017-05-01 11:09:48 +00:00
|
|
|
// until we have a proper peer connectivity API, allow LES connection to other servers
|
|
|
|
/*if recv.get("serveStateSince", nil) == nil {
|
2016-06-20 14:47:10 +00:00
|
|
|
return errResp(ErrUselessPeer, "wanted client, got server")
|
2017-05-01 11:09:48 +00:00
|
|
|
}*/
|
2018-01-15 20:26:41 +00:00
|
|
|
if recv.get("announceType", &p.announceType) != nil {
|
2018-10-16 11:27:11 +00:00
|
|
|
//set default announceType on server side
|
2018-01-15 20:26:41 +00:00
|
|
|
p.announceType = announceTypeSimple
|
|
|
|
}
|
2016-06-20 14:47:10 +00:00
|
|
|
p.fcClient = flowcontrol.NewClientNode(server.fcManager, server.defParams)
|
|
|
|
} else {
|
2018-10-16 11:27:11 +00:00
|
|
|
//mark OnlyAnnounce server if "serveHeaders", "serveChainSince", "serveStateSince" or "txRelay" fields don't exist
|
2016-06-20 14:47:10 +00:00
|
|
|
if recv.get("serveChainSince", nil) != nil {
|
2018-10-16 11:27:11 +00:00
|
|
|
p.isOnlyAnnounce = true
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
if recv.get("serveStateSince", nil) != nil {
|
2018-10-16 11:27:11 +00:00
|
|
|
p.isOnlyAnnounce = true
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
if recv.get("txRelay", nil) != nil {
|
2018-10-16 11:27:11 +00:00
|
|
|
p.isOnlyAnnounce = true
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
2018-10-16 11:27:11 +00:00
|
|
|
|
|
|
|
if p.isOnlyAnnounce && !p.isTrusted {
|
|
|
|
return errResp(ErrUselessPeer, "peer cannot serve requests")
|
|
|
|
}
|
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
params := &flowcontrol.ServerParams{}
|
|
|
|
if err := recv.get("flowControl/BL", ¶ms.BufLimit); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
if err := recv.get("flowControl/MRR", ¶ms.MinRecharge); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
var MRC RequestCostList
|
|
|
|
if err := recv.get("flowControl/MRC", &MRC); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
2016-07-26 02:54:35 +00:00
|
|
|
p.fcServerParams = params
|
2016-06-20 14:47:10 +00:00
|
|
|
p.fcServer = flowcontrol.NewServerNode(params)
|
|
|
|
p.fcCosts = MRC.decode()
|
2019-06-09 07:24:20 +00:00
|
|
|
var checkList []uint64
|
|
|
|
switch p.version {
|
|
|
|
case lpv1:
|
|
|
|
checkList = reqListV1
|
|
|
|
case lpv2:
|
|
|
|
checkList = reqListV2
|
|
|
|
default:
|
|
|
|
panic(nil)
|
|
|
|
}
|
|
|
|
for _, msgCode := range checkList {
|
|
|
|
if p.fcCosts[msgCode] == nil {
|
|
|
|
return errResp(ErrUselessPeer, "peer does not support message %d", msgCode)
|
|
|
|
}
|
|
|
|
}
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
2019-06-09 07:24:20 +00:00
|
|
|
|
2017-05-01 11:09:48 +00:00
|
|
|
p.headInfo = &announceData{Td: rTd, Hash: rHash, Number: rNum}
|
2016-06-20 14:47:10 +00:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// String implements fmt.Stringer.
|
|
|
|
func (p *peer) String() string {
|
|
|
|
return fmt.Sprintf("Peer %s [%s]", p.id,
|
|
|
|
fmt.Sprintf("les/%d", p.version),
|
|
|
|
)
|
|
|
|
}
|
|
|
|
|
2017-08-04 16:14:17 +00:00
|
|
|
// peerSetNotify is a callback interface to notify services about added or
|
|
|
|
// removed peers
|
|
|
|
type peerSetNotify interface {
|
|
|
|
registerPeer(*peer)
|
|
|
|
unregisterPeer(*peer)
|
|
|
|
}
|
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
// peerSet represents the collection of active peers currently participating in
|
|
|
|
// the Light Ethereum sub-protocol.
|
|
|
|
type peerSet struct {
|
2017-08-04 16:14:17 +00:00
|
|
|
peers map[string]*peer
|
|
|
|
lock sync.RWMutex
|
|
|
|
notifyList []peerSetNotify
|
|
|
|
closed bool
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// newPeerSet creates a new peer set to track the active participants.
|
|
|
|
func newPeerSet() *peerSet {
|
|
|
|
return &peerSet{
|
|
|
|
peers: make(map[string]*peer),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-08-04 16:14:17 +00:00
|
|
|
// notify adds a service to be notified about added or removed peers
|
|
|
|
func (ps *peerSet) notify(n peerSetNotify) {
|
|
|
|
ps.lock.Lock()
|
|
|
|
ps.notifyList = append(ps.notifyList, n)
|
2018-01-15 20:26:41 +00:00
|
|
|
peers := make([]*peer, 0, len(ps.peers))
|
2017-08-04 16:14:17 +00:00
|
|
|
for _, p := range ps.peers {
|
2018-01-15 20:26:41 +00:00
|
|
|
peers = append(peers, p)
|
|
|
|
}
|
|
|
|
ps.lock.Unlock()
|
|
|
|
|
|
|
|
for _, p := range peers {
|
|
|
|
n.registerPeer(p)
|
2017-08-04 16:14:17 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-06-20 14:47:10 +00:00
|
|
|
// Register injects a new peer into the working set, or returns an error if the
|
|
|
|
// peer is already known.
|
|
|
|
func (ps *peerSet) Register(p *peer) error {
|
2018-04-24 15:50:26 +00:00
|
|
|
ps.lock.Lock()
|
|
|
|
if ps.closed {
|
|
|
|
ps.lock.Unlock()
|
|
|
|
return errClosed
|
|
|
|
}
|
|
|
|
if _, ok := ps.peers[p.id]; ok {
|
|
|
|
ps.lock.Unlock()
|
|
|
|
return errAlreadyRegistered
|
|
|
|
}
|
|
|
|
ps.peers[p.id] = p
|
|
|
|
p.sendQueue = newExecQueue(100)
|
|
|
|
peers := make([]peerSetNotify, len(ps.notifyList))
|
|
|
|
copy(peers, ps.notifyList)
|
|
|
|
ps.lock.Unlock()
|
|
|
|
|
2018-01-15 20:26:41 +00:00
|
|
|
for _, n := range peers {
|
|
|
|
n.registerPeer(p)
|
2017-08-04 16:14:17 +00:00
|
|
|
}
|
2016-06-20 14:47:10 +00:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Unregister removes a remote peer from the active set, disabling any further
|
2017-08-04 16:14:17 +00:00
|
|
|
// actions to/from that particular entity. It also initiates disconnection at the networking layer.
|
2016-06-20 14:47:10 +00:00
|
|
|
func (ps *peerSet) Unregister(id string) error {
|
|
|
|
ps.lock.Lock()
|
2017-05-01 11:09:48 +00:00
|
|
|
if p, ok := ps.peers[id]; !ok {
|
2018-01-15 20:26:41 +00:00
|
|
|
ps.lock.Unlock()
|
2016-06-20 14:47:10 +00:00
|
|
|
return errNotRegistered
|
2017-05-01 11:09:48 +00:00
|
|
|
} else {
|
2018-01-15 20:26:41 +00:00
|
|
|
delete(ps.peers, id)
|
|
|
|
peers := make([]peerSetNotify, len(ps.notifyList))
|
|
|
|
copy(peers, ps.notifyList)
|
|
|
|
ps.lock.Unlock()
|
|
|
|
|
|
|
|
for _, n := range peers {
|
|
|
|
n.unregisterPeer(p)
|
2017-08-04 16:14:17 +00:00
|
|
|
}
|
2018-10-16 11:27:11 +00:00
|
|
|
|
2017-05-01 11:09:48 +00:00
|
|
|
p.sendQueue.quit()
|
2017-08-04 16:14:17 +00:00
|
|
|
p.Peer.Disconnect(p2p.DiscUselessPeer)
|
2018-10-16 11:27:11 +00:00
|
|
|
|
2018-01-15 20:26:41 +00:00
|
|
|
return nil
|
2016-06-20 14:47:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// AllPeerIDs returns a list of all registered peer IDs
|
|
|
|
func (ps *peerSet) AllPeerIDs() []string {
|
|
|
|
ps.lock.RLock()
|
|
|
|
defer ps.lock.RUnlock()
|
|
|
|
|
|
|
|
res := make([]string, len(ps.peers))
|
|
|
|
idx := 0
|
2017-02-23 00:22:43 +00:00
|
|
|
for id := range ps.peers {
|
2016-06-20 14:47:10 +00:00
|
|
|
res[idx] = id
|
|
|
|
idx++
|
|
|
|
}
|
|
|
|
return res
|
|
|
|
}
|
|
|
|
|
|
|
|
// Peer retrieves the registered peer with the given id.
|
|
|
|
func (ps *peerSet) Peer(id string) *peer {
|
|
|
|
ps.lock.RLock()
|
|
|
|
defer ps.lock.RUnlock()
|
|
|
|
|
|
|
|
return ps.peers[id]
|
|
|
|
}
|
|
|
|
|
|
|
|
// Len returns if the current number of peers in the set.
|
|
|
|
func (ps *peerSet) Len() int {
|
|
|
|
ps.lock.RLock()
|
|
|
|
defer ps.lock.RUnlock()
|
|
|
|
|
|
|
|
return len(ps.peers)
|
|
|
|
}
|
|
|
|
|
|
|
|
// BestPeer retrieves the known peer with the currently highest total difficulty.
|
|
|
|
func (ps *peerSet) BestPeer() *peer {
|
|
|
|
ps.lock.RLock()
|
|
|
|
defer ps.lock.RUnlock()
|
|
|
|
|
|
|
|
var (
|
|
|
|
bestPeer *peer
|
|
|
|
bestTd *big.Int
|
|
|
|
)
|
|
|
|
for _, p := range ps.peers {
|
|
|
|
if td := p.Td(); bestPeer == nil || td.Cmp(bestTd) > 0 {
|
|
|
|
bestPeer, bestTd = p, td
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return bestPeer
|
|
|
|
}
|
|
|
|
|
|
|
|
// AllPeers returns all peers in a list
|
|
|
|
func (ps *peerSet) AllPeers() []*peer {
|
|
|
|
ps.lock.RLock()
|
|
|
|
defer ps.lock.RUnlock()
|
|
|
|
|
|
|
|
list := make([]*peer, len(ps.peers))
|
|
|
|
i := 0
|
|
|
|
for _, peer := range ps.peers {
|
|
|
|
list[i] = peer
|
|
|
|
i++
|
|
|
|
}
|
|
|
|
return list
|
|
|
|
}
|
|
|
|
|
|
|
|
// Close disconnects all peers.
|
|
|
|
// No new peers can be registered after Close has returned.
|
|
|
|
func (ps *peerSet) Close() {
|
|
|
|
ps.lock.Lock()
|
|
|
|
defer ps.lock.Unlock()
|
|
|
|
|
|
|
|
for _, p := range ps.peers {
|
|
|
|
p.Disconnect(p2p.DiscQuitting)
|
|
|
|
}
|
|
|
|
ps.closed = true
|
|
|
|
}
|