You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
105 lines
3.1 KiB
105 lines
3.1 KiB
/*
|
|
This file is part of cpp-ethereum.
|
|
|
|
cpp-ethereum is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
cpp-ethereum 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 General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with cpp-ethereum. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file EthereumHost.h
|
|
* @author Gav Wood <i@gavwood.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <mutex>
|
|
#include <map>
|
|
#include <vector>
|
|
#include <set>
|
|
#include <memory>
|
|
#include <utility>
|
|
#include <thread>
|
|
#include <libethential/Guards.h>
|
|
#include <libethcore/CommonEth.h>
|
|
#include <libp2p/Common.h>
|
|
#include "CommonNet.h"
|
|
#include "EthereumPeer.h"
|
|
|
|
namespace eth
|
|
{
|
|
|
|
class RLPStream;
|
|
class TransactionQueue;
|
|
class BlockQueue;
|
|
|
|
/**
|
|
* @brief The EthereumHost class
|
|
* @warning None of this is thread-safe. You have been warned.
|
|
*/
|
|
class EthereumHost: public p2p::HostCapability<EthereumPeer>
|
|
{
|
|
friend class EthereumPeer;
|
|
|
|
public:
|
|
/// Start server, but don't listen.
|
|
EthereumHost(BlockChain const& _ch, u256 _networkId);
|
|
|
|
/// Will block on network process events.
|
|
virtual ~EthereumHost();
|
|
|
|
unsigned protocolVersion() const { return c_protocolVersion; }
|
|
u256 networkId() const { return m_networkId; }
|
|
|
|
/// Sync with the BlockChain. It might contain one of our mined blocks, we might have new candidates from the network.
|
|
bool sync(TransactionQueue&, BlockQueue& _bc);
|
|
|
|
private:
|
|
/// Session wants to pass us a block that we might not have.
|
|
/// @returns true if we didn't have it.
|
|
bool noteBlock(h256 _hash, bytesConstRef _data);
|
|
/// Session has finished getting the chain of hashes.
|
|
void noteHaveChain(EthereumPeer* _who);
|
|
/// Called when the peer can no longer provide us with any needed blocks.
|
|
void noteDoneBlocks();
|
|
|
|
void maintainTransactions(TransactionQueue& _tq, h256 _currentBlock);
|
|
void maintainBlocks(BlockQueue& _bq, h256 _currentBlock);
|
|
|
|
/// Get a bunch of needed blocks.
|
|
/// Removes them from our list of needed blocks.
|
|
/// @returns empty if there's no more blocks left to fetch, otherwise the blocks to fetch.
|
|
h256Set neededBlocks(h256Set const& _exclude);
|
|
|
|
/// Check to see if the network peer-state initialisation has happened.
|
|
virtual bool isInitialised() const { return m_latestBlockSent; }
|
|
|
|
/// Initialises the network peer-state, doing the stuff that needs to be once-only. @returns true if it really was first.
|
|
bool ensureInitialised(TransactionQueue& _tq);
|
|
|
|
BlockChain const* m_chain = nullptr;
|
|
|
|
u256 m_networkId;
|
|
|
|
mutable std::recursive_mutex m_incomingLock;
|
|
std::vector<bytes> m_incomingTransactions;
|
|
std::vector<bytes> m_incomingBlocks;
|
|
|
|
mutable std::mutex x_blocksNeeded;
|
|
u256 m_totalDifficultyOfNeeded;
|
|
h256s m_blocksNeeded;
|
|
h256Set m_blocksOnWay;
|
|
|
|
h256 m_latestBlockSent;
|
|
std::set<h256> m_transactionsSent;
|
|
};
|
|
|
|
}
|
|
|