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.
90 lines
3.7 KiB
90 lines
3.7 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 TransactionQueue.h
|
|
* @author Gav Wood <i@gavwood.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <functional>
|
|
#include <libdevcore/Common.h>
|
|
#include <libdevcore/Guards.h>
|
|
#include <libdevcore/Log.h>
|
|
#include <libethcore/Common.h>
|
|
#include "Transaction.h"
|
|
|
|
namespace dev
|
|
{
|
|
namespace eth
|
|
{
|
|
|
|
class BlockChain;
|
|
|
|
struct TransactionQueueChannel: public LogChannel { static const char* name(); static const int verbosity = 4; };
|
|
struct TransactionQueueTraceChannel: public LogChannel { static const char* name(); static const int verbosity = 7; };
|
|
#define ctxq dev::LogOutputStream<dev::eth::TransactionQueueTraceChannel, true>()
|
|
|
|
enum class IfDropped { Ignore, Retry };
|
|
|
|
/**
|
|
* @brief A queue of Transactions, each stored as RLP.
|
|
* @threadsafe
|
|
*/
|
|
class TransactionQueue
|
|
{
|
|
public:
|
|
using ImportCallback = std::function<void(ImportResult)>;
|
|
|
|
ImportResult import(Transaction const& _tx, ImportCallback const& _cb = ImportCallback(), IfDropped _ik = IfDropped::Ignore);
|
|
ImportResult import(bytes const& _tx, ImportCallback const& _cb = ImportCallback(), IfDropped _ik = IfDropped::Ignore) { return import(&_tx, _cb, _ik); }
|
|
ImportResult import(bytesConstRef _tx, ImportCallback const& _cb = ImportCallback(), IfDropped _ik = IfDropped::Ignore);
|
|
|
|
void drop(h256 const& _txHash);
|
|
|
|
unsigned waiting(Address const& _a) const;
|
|
std::unordered_map<h256, Transaction> transactions() const;
|
|
std::pair<unsigned, unsigned> items() const { ReadGuard l(m_lock); return std::make_pair(m_current.size(), m_future.size()); }
|
|
u256 maxNonce(Address const& _a) const;
|
|
|
|
void setFuture(std::pair<h256, Transaction> const& _t);
|
|
void noteGood(std::pair<h256, Transaction> const& _t);
|
|
|
|
void clear() { WriteGuard l(m_lock); m_senders.clear(); m_known.clear(); m_current.clear(); m_future.clear(); }
|
|
template <class T> Handler onReady(T const& _t) { return m_onReady.add(_t); }
|
|
|
|
private:
|
|
ImportResult check_WITH_LOCK(h256 const& _h, IfDropped _ik);
|
|
ImportResult manageImport_WITH_LOCK(h256 const& _h, Transaction const& _transaction, ImportCallback const& _cb);
|
|
|
|
void insertCurrent_WITH_LOCK(std::pair<h256, Transaction> const& _p);
|
|
bool remove_WITH_LOCK(h256 const& _txHash);
|
|
u256 maxNonce_WITH_LOCK(Address const& _a) const;
|
|
|
|
mutable SharedMutex m_lock; ///< General lock.
|
|
h256Hash m_known; ///< Hashes of transactions in both sets.
|
|
std::unordered_multimap<Address, h256> m_senders; ///< Mapping from the sender address to the transaction hash; useful for determining the nonce of a given sender.
|
|
std::unordered_map<h256, Transaction> m_current; ///< Map of SHA3(tx) to tx.
|
|
std::unordered_map<h256, Transaction> m_future; ///< For transactions that have a future nonce; we re-insert into current once the sender has a valid TX.
|
|
std::unordered_map<h256, std::function<void(ImportResult)>> m_callbacks; ///< Called once.
|
|
h256Hash m_dropped; ///< Transactions that have previously been dropped.
|
|
Signal m_onReady; ///< Called when a subsequent call to import transactions will return a non-empty container. Be nice and exit fast.
|
|
};
|
|
|
|
}
|
|
}
|
|
|
|
|