forked from cerc-io/plugeth
c2003ed63b
This change - implements concurrent LES request serving even for a single peer. - replaces the request cost estimation method with a cost table based on benchmarks which gives much more consistent results. Until now the allowed number of light peers was just a guess which probably contributed a lot to the fluctuating quality of available service. Everything related to request cost is implemented in a single object, the 'cost tracker'. It uses a fixed cost table with a global 'correction factor'. Benchmark code is included and can be run at any time to adapt costs to low-level implementation changes. - reimplements flowcontrol.ClientManager in a cleaner and more efficient way, with added capabilities: There is now control over bandwidth, which allows using the flow control parameters for client prioritization. Target utilization over 100 percent is now supported to model concurrent request processing. Total serving bandwidth is reduced during block processing to prevent database contention. - implements an RPC API for the LES servers allowing server operators to assign priority bandwidth to certain clients and change prioritized status even while the client is connected. The new API is meant for cases where server operators charge for LES using an off-protocol mechanism. - adds a unit test for the new client manager. - adds an end-to-end test using the network simulator that tests bandwidth control functions through the new API.
178 lines
5.4 KiB
Go
178 lines
5.4 KiB
Go
// Copyright 2015 The go-ethereum Authors
|
|
// 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 light
|
|
|
|
import (
|
|
"context"
|
|
"errors"
|
|
"math/big"
|
|
|
|
"github.com/ethereum/go-ethereum/common"
|
|
"github.com/ethereum/go-ethereum/core"
|
|
"github.com/ethereum/go-ethereum/core/rawdb"
|
|
"github.com/ethereum/go-ethereum/core/types"
|
|
"github.com/ethereum/go-ethereum/ethdb"
|
|
)
|
|
|
|
// NoOdr is the default context passed to an ODR capable function when the ODR
|
|
// service is not required.
|
|
var NoOdr = context.Background()
|
|
|
|
// ErrNoPeers is returned if no peers capable of serving a queued request are available
|
|
var ErrNoPeers = errors.New("no suitable peers available")
|
|
|
|
// OdrBackend is an interface to a backend service that handles ODR retrievals type
|
|
type OdrBackend interface {
|
|
Database() ethdb.Database
|
|
ChtIndexer() *core.ChainIndexer
|
|
BloomTrieIndexer() *core.ChainIndexer
|
|
BloomIndexer() *core.ChainIndexer
|
|
Retrieve(ctx context.Context, req OdrRequest) error
|
|
IndexerConfig() *IndexerConfig
|
|
}
|
|
|
|
// OdrRequest is an interface for retrieval requests
|
|
type OdrRequest interface {
|
|
StoreResult(db ethdb.Database)
|
|
}
|
|
|
|
// TrieID identifies a state or account storage trie
|
|
type TrieID struct {
|
|
BlockHash, Root common.Hash
|
|
BlockNumber uint64
|
|
AccKey []byte
|
|
}
|
|
|
|
// StateTrieID returns a TrieID for a state trie belonging to a certain block
|
|
// header.
|
|
func StateTrieID(header *types.Header) *TrieID {
|
|
return &TrieID{
|
|
BlockHash: header.Hash(),
|
|
BlockNumber: header.Number.Uint64(),
|
|
AccKey: nil,
|
|
Root: header.Root,
|
|
}
|
|
}
|
|
|
|
// StorageTrieID returns a TrieID for a contract storage trie at a given account
|
|
// of a given state trie. It also requires the root hash of the trie for
|
|
// checking Merkle proofs.
|
|
func StorageTrieID(state *TrieID, addrHash, root common.Hash) *TrieID {
|
|
return &TrieID{
|
|
BlockHash: state.BlockHash,
|
|
BlockNumber: state.BlockNumber,
|
|
AccKey: addrHash[:],
|
|
Root: root,
|
|
}
|
|
}
|
|
|
|
// TrieRequest is the ODR request type for state/storage trie entries
|
|
type TrieRequest struct {
|
|
OdrRequest
|
|
Id *TrieID
|
|
Key []byte
|
|
Proof *NodeSet
|
|
}
|
|
|
|
// StoreResult stores the retrieved data in local database
|
|
func (req *TrieRequest) StoreResult(db ethdb.Database) {
|
|
req.Proof.Store(db)
|
|
}
|
|
|
|
// CodeRequest is the ODR request type for retrieving contract code
|
|
type CodeRequest struct {
|
|
OdrRequest
|
|
Id *TrieID // references storage trie of the account
|
|
Hash common.Hash
|
|
Data []byte
|
|
}
|
|
|
|
// StoreResult stores the retrieved data in local database
|
|
func (req *CodeRequest) StoreResult(db ethdb.Database) {
|
|
db.Put(req.Hash[:], req.Data)
|
|
}
|
|
|
|
// BlockRequest is the ODR request type for retrieving block bodies
|
|
type BlockRequest struct {
|
|
OdrRequest
|
|
Hash common.Hash
|
|
Number uint64
|
|
Rlp []byte
|
|
}
|
|
|
|
// StoreResult stores the retrieved data in local database
|
|
func (req *BlockRequest) StoreResult(db ethdb.Database) {
|
|
rawdb.WriteBodyRLP(db, req.Hash, req.Number, req.Rlp)
|
|
}
|
|
|
|
// ReceiptsRequest is the ODR request type for retrieving block bodies
|
|
type ReceiptsRequest struct {
|
|
OdrRequest
|
|
Hash common.Hash
|
|
Number uint64
|
|
Receipts types.Receipts
|
|
}
|
|
|
|
// StoreResult stores the retrieved data in local database
|
|
func (req *ReceiptsRequest) StoreResult(db ethdb.Database) {
|
|
rawdb.WriteReceipts(db, req.Hash, req.Number, req.Receipts)
|
|
}
|
|
|
|
// ChtRequest is the ODR request type for state/storage trie entries
|
|
type ChtRequest struct {
|
|
OdrRequest
|
|
Config *IndexerConfig
|
|
ChtNum, BlockNum uint64
|
|
ChtRoot common.Hash
|
|
Header *types.Header
|
|
Td *big.Int
|
|
Proof *NodeSet
|
|
}
|
|
|
|
// StoreResult stores the retrieved data in local database
|
|
func (req *ChtRequest) StoreResult(db ethdb.Database) {
|
|
hash, num := req.Header.Hash(), req.Header.Number.Uint64()
|
|
|
|
rawdb.WriteHeader(db, req.Header)
|
|
rawdb.WriteTd(db, hash, num, req.Td)
|
|
rawdb.WriteCanonicalHash(db, hash, num)
|
|
}
|
|
|
|
// BloomRequest is the ODR request type for retrieving bloom filters from a CHT structure
|
|
type BloomRequest struct {
|
|
OdrRequest
|
|
Config *IndexerConfig
|
|
BloomTrieNum uint64
|
|
BitIdx uint
|
|
SectionIndexList []uint64
|
|
BloomTrieRoot common.Hash
|
|
BloomBits [][]byte
|
|
Proofs *NodeSet
|
|
}
|
|
|
|
// StoreResult stores the retrieved data in local database
|
|
func (req *BloomRequest) StoreResult(db ethdb.Database) {
|
|
for i, sectionIdx := range req.SectionIndexList {
|
|
sectionHead := rawdb.ReadCanonicalHash(db, (sectionIdx+1)*req.Config.BloomTrieSize-1)
|
|
// if we don't have the canonical hash stored for this section head number, we'll still store it under
|
|
// a key with a zero sectionHead. GetBloomBits will look there too if we still don't have the canonical
|
|
// hash. In the unlikely case we've retrieved the section head hash since then, we'll just retrieve the
|
|
// bit vector again from the network.
|
|
rawdb.WriteBloomBits(db, req.BitIdx, sectionIdx, sectionHead, req.BloomBits[i])
|
|
}
|
|
}
|