2018-06-04 10:19:50 +02:00
|
|
|
// Copyright 2015-2018 Parity Technologies (UK) Ltd.
|
2018-04-13 17:34:27 +02:00
|
|
|
// This file is part of Parity.
|
|
|
|
|
|
|
|
// Parity 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.
|
|
|
|
|
|
|
|
// Parity 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 Parity. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
|
|
|
//! Transaction Pool
|
|
|
|
|
2018-06-12 08:22:54 +02:00
|
|
|
use ethereum_types::{U256, H256, Address};
|
2018-04-13 17:34:27 +02:00
|
|
|
use heapsize::HeapSizeOf;
|
|
|
|
use transaction;
|
|
|
|
use txpool;
|
|
|
|
|
|
|
|
mod listener;
|
|
|
|
mod queue;
|
|
|
|
mod ready;
|
|
|
|
mod scoring;
|
|
|
|
|
|
|
|
pub mod client;
|
|
|
|
pub mod local_transactions;
|
|
|
|
pub mod verifier;
|
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
|
mod tests;
|
|
|
|
|
|
|
|
pub use self::queue::{TransactionQueue, Status as QueueStatus};
|
|
|
|
pub use self::txpool::{VerifiedTransaction as PoolVerifiedTransaction, Options};
|
|
|
|
|
|
|
|
/// How to prioritize transactions in the pool
|
|
|
|
///
|
|
|
|
/// TODO [ToDr] Implement more strategies.
|
|
|
|
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
|
|
|
|
pub enum PrioritizationStrategy {
|
|
|
|
/// Simple gas-price based prioritization.
|
|
|
|
GasPriceOnly,
|
|
|
|
}
|
|
|
|
|
2018-06-12 08:22:54 +02:00
|
|
|
/// Transaction ordering when requesting pending set.
|
|
|
|
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
|
|
|
|
pub enum PendingOrdering {
|
|
|
|
/// Get pending transactions ordered by their priority (potentially expensive)
|
|
|
|
Priority,
|
|
|
|
/// Get pending transactions without any care of particular ordering (cheaper).
|
|
|
|
Unordered,
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Pending set query settings
|
|
|
|
#[derive(Debug, Clone)]
|
|
|
|
pub struct PendingSettings {
|
|
|
|
/// Current block number (affects readiness of some transactions).
|
|
|
|
pub block_number: u64,
|
|
|
|
/// Current timestamp (affects readiness of some transactions).
|
|
|
|
pub current_timestamp: u64,
|
|
|
|
/// Nonce cap (for dust protection; EIP-168)
|
|
|
|
pub nonce_cap: Option<U256>,
|
|
|
|
/// Maximal number of transactions in pending the set.
|
|
|
|
pub max_len: usize,
|
|
|
|
/// Ordering of transactions.
|
|
|
|
pub ordering: PendingOrdering,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl PendingSettings {
|
|
|
|
/// Get all transactions (no cap or len limit) prioritized.
|
|
|
|
pub fn all_prioritized(block_number: u64, current_timestamp: u64) -> Self {
|
|
|
|
PendingSettings {
|
|
|
|
block_number,
|
|
|
|
current_timestamp,
|
|
|
|
nonce_cap: None,
|
|
|
|
max_len: usize::max_value(),
|
|
|
|
ordering: PendingOrdering::Priority,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-04-13 17:34:27 +02:00
|
|
|
/// Transaction priority.
|
|
|
|
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
|
|
|
|
pub(crate) enum Priority {
|
|
|
|
/// Local transactions (high priority)
|
|
|
|
///
|
|
|
|
/// Transactions either from a local account or
|
|
|
|
/// submitted over local RPC connection via `eth_sendRawTransaction`
|
|
|
|
Local,
|
|
|
|
/// Transactions from retracted blocks (medium priority)
|
|
|
|
///
|
|
|
|
/// When block becomes non-canonical we re-import the transactions it contains
|
|
|
|
/// to the queue and boost their priority.
|
|
|
|
Retracted,
|
|
|
|
/// Regular transactions received over the network. (no priority boost)
|
|
|
|
Regular,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Priority {
|
|
|
|
fn is_local(&self) -> bool {
|
|
|
|
match *self {
|
|
|
|
Priority::Local => true,
|
|
|
|
_ => false,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Verified transaction stored in the pool.
|
|
|
|
#[derive(Debug, PartialEq, Eq)]
|
|
|
|
pub struct VerifiedTransaction {
|
|
|
|
transaction: transaction::PendingTransaction,
|
|
|
|
// TODO [ToDr] hash and sender should go directly from the transaction
|
|
|
|
hash: H256,
|
|
|
|
sender: Address,
|
|
|
|
priority: Priority,
|
|
|
|
insertion_id: usize,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl VerifiedTransaction {
|
|
|
|
/// Create `VerifiedTransaction` directly from `SignedTransaction`.
|
|
|
|
///
|
|
|
|
/// This method should be used only:
|
|
|
|
/// 1. for tests
|
|
|
|
/// 2. In case we are converting pending block transactions that are already in the queue to match the function signature.
|
|
|
|
pub fn from_pending_block_transaction(tx: transaction::SignedTransaction) -> Self {
|
|
|
|
let hash = tx.hash();
|
|
|
|
let sender = tx.sender();
|
|
|
|
VerifiedTransaction {
|
|
|
|
transaction: tx.into(),
|
|
|
|
hash,
|
|
|
|
sender,
|
|
|
|
priority: Priority::Retracted,
|
|
|
|
insertion_id: 0,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Gets transaction priority.
|
|
|
|
pub(crate) fn priority(&self) -> Priority {
|
|
|
|
self.priority
|
|
|
|
}
|
|
|
|
|
2018-05-02 09:31:06 +02:00
|
|
|
/// Gets transaction insertion id.
|
|
|
|
pub(crate) fn insertion_id(&self) -> usize {
|
|
|
|
self.insertion_id
|
|
|
|
}
|
|
|
|
|
2018-04-13 17:34:27 +02:00
|
|
|
/// Gets wrapped `SignedTransaction`
|
|
|
|
pub fn signed(&self) -> &transaction::SignedTransaction {
|
|
|
|
&self.transaction
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Gets wrapped `PendingTransaction`
|
|
|
|
pub fn pending(&self) -> &transaction::PendingTransaction {
|
|
|
|
&self.transaction
|
|
|
|
}
|
2018-05-02 09:31:06 +02:00
|
|
|
|
2018-04-13 17:34:27 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
impl txpool::VerifiedTransaction for VerifiedTransaction {
|
2018-05-02 09:31:06 +02:00
|
|
|
type Hash = H256;
|
|
|
|
type Sender = Address;
|
|
|
|
|
2018-04-13 17:34:27 +02:00
|
|
|
fn hash(&self) -> &H256 {
|
|
|
|
&self.hash
|
|
|
|
}
|
|
|
|
|
|
|
|
fn mem_usage(&self) -> usize {
|
|
|
|
self.transaction.heap_size_of_children()
|
|
|
|
}
|
|
|
|
|
|
|
|
fn sender(&self) -> &Address {
|
|
|
|
&self.sender
|
|
|
|
}
|
|
|
|
}
|