mirror of
https://github.com/Xahau/xahaud.git
synced 2025-11-20 10:35:50 +00:00
The first few transactions are added to the open ledger at the base fee (ie. 10 drops). Once enough transactions are added, the required fee will jump dramatically. If additional transactions are added, the fee will grow exponentially. Transactions that don't have a high enough fee to be applied to the ledger are added to the queue in order from highest fee to lowest. Whenever a new ledger is accepted as validated, transactions are first applied from the queue to the open ledger in fee order until either all transactions are applied or the fee again jumps too high for the remaining transactions. Current implementation is restricted to one transaction in the queue per account. Some groundwork has been laid to expand in the future. Note that this fee logic escalates independently of the load-based fee logic (ie. LoadFeeTrack). Submitted transactions must meet the load fee to be considered for the queue, and must meet both fees to be put into open ledger.
205 lines
5.6 KiB
C++
205 lines
5.6 KiB
C++
//------------------------------------------------------------------------------
|
|
/*
|
|
This file is part of rippled: https://github.com/ripple/rippled
|
|
Copyright (c) 2012, 2013 Ripple Labs Inc.
|
|
|
|
Permission to use, copy, modify, and/or distribute this software for any
|
|
purpose with or without fee is hereby granted, provided that the above
|
|
copyright notice and this permission notice appear in all copies.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
ANY SPECIAL , DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|
|
//==============================================================================
|
|
|
|
#include <BeastConfig.h>
|
|
#include <ripple/app/ledger/OpenLedger.h>
|
|
#include <ripple/app/tx/apply.h>
|
|
#include <ripple/ledger/CachedView.h>
|
|
#include <ripple/protocol/Feature.h>
|
|
#include <boost/range/adaptor/transformed.hpp>
|
|
|
|
namespace ripple {
|
|
|
|
OpenLedger::OpenLedger(std::shared_ptr<
|
|
Ledger const> const& ledger,
|
|
CachedSLEs& cache,
|
|
beast::Journal journal)
|
|
: j_ (journal)
|
|
, cache_ (cache)
|
|
, current_ (create(ledger->rules(), ledger))
|
|
{
|
|
}
|
|
|
|
bool
|
|
OpenLedger::empty() const
|
|
{
|
|
std::lock_guard<
|
|
std::mutex> lock(modify_mutex_);
|
|
return current_->txCount() == 0;
|
|
}
|
|
|
|
std::shared_ptr<OpenView const>
|
|
OpenLedger::current() const
|
|
{
|
|
std::lock_guard<
|
|
std::mutex> lock(
|
|
current_mutex_);
|
|
return current_;
|
|
}
|
|
|
|
bool
|
|
OpenLedger::modify (modify_type const& f)
|
|
{
|
|
std::lock_guard<
|
|
std::mutex> lock1(modify_mutex_);
|
|
auto next = std::make_shared<
|
|
OpenView>(*current_);
|
|
auto const changed = f(*next, j_);
|
|
if (changed)
|
|
{
|
|
std::lock_guard<
|
|
std::mutex> lock2(
|
|
current_mutex_);
|
|
current_ = std::move(next);
|
|
}
|
|
return changed;
|
|
}
|
|
|
|
void
|
|
OpenLedger::accept(Application& app, Rules const& rules,
|
|
std::shared_ptr<Ledger const> const& ledger,
|
|
OrderedTxs const& locals, bool retriesFirst,
|
|
OrderedTxs& retries, ApplyFlags flags,
|
|
std::string const& suffix,
|
|
modify_type const& f)
|
|
{
|
|
JLOG(j_.trace) <<
|
|
"accept ledger " << ledger->seq() << " " << suffix;
|
|
auto next = create(rules, ledger);
|
|
if (retriesFirst)
|
|
{
|
|
// Handle disputed tx, outside lock
|
|
using empty =
|
|
std::vector<std::shared_ptr<
|
|
STTx const>>;
|
|
apply (app, *next, *ledger, empty{},
|
|
retries, flags, j_);
|
|
}
|
|
// Block calls to modify, otherwise
|
|
// new tx going into the open ledger
|
|
// would get lost.
|
|
std::lock_guard<
|
|
std::mutex> lock1(modify_mutex_);
|
|
// Apply tx from the current open view
|
|
if (! current_->txs.empty())
|
|
apply (app, *next, *ledger,
|
|
boost::adaptors::transform(
|
|
current_->txs,
|
|
[](std::pair<std::shared_ptr<
|
|
STTx const>, std::shared_ptr<
|
|
STObject const>> const& p)
|
|
{
|
|
return p.first;
|
|
}),
|
|
retries, flags, j_);
|
|
// Apply local tx
|
|
for (auto const& item : locals)
|
|
ripple::apply(app, *next,
|
|
*item.second, flags, j_);
|
|
// Call the modifier
|
|
if (f)
|
|
f(*next, j_);
|
|
// Switch to the new open view
|
|
std::lock_guard<
|
|
std::mutex> lock2(current_mutex_);
|
|
current_ = std::move(next);
|
|
}
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
std::shared_ptr<OpenView>
|
|
OpenLedger::create (Rules const& rules,
|
|
std::shared_ptr<Ledger const> const& ledger)
|
|
{
|
|
return std::make_shared<OpenView>(
|
|
open_ledger, rules, std::make_shared<
|
|
CachedLedger const>(ledger,
|
|
cache_));
|
|
}
|
|
|
|
auto
|
|
OpenLedger::apply_one (Application& app, OpenView& view,
|
|
std::shared_ptr<STTx const> const& tx,
|
|
bool retry, ApplyFlags flags,
|
|
beast::Journal j) -> Result
|
|
{
|
|
if (retry)
|
|
flags = flags | tapRETRY;
|
|
auto const result = ripple::apply(
|
|
app, view, *tx, flags, j);
|
|
if (result.second)
|
|
return Result::success;
|
|
if (isTefFailure (result.first) ||
|
|
isTemMalformed (result.first) ||
|
|
isTelLocal (result.first))
|
|
return Result::failure;
|
|
return Result::retry;
|
|
}
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
std::string
|
|
debugTxstr (std::shared_ptr<STTx const> const& tx)
|
|
{
|
|
std::stringstream ss;
|
|
ss << tx->getTransactionID();
|
|
return ss.str().substr(0, 4);
|
|
}
|
|
|
|
std::string
|
|
debugTostr (OrderedTxs const& set)
|
|
{
|
|
std::stringstream ss;
|
|
for(auto const& item : set)
|
|
ss << debugTxstr(item.second) << ", ";
|
|
return ss.str();
|
|
}
|
|
|
|
std::string
|
|
debugTostr (SHAMap const& set)
|
|
{
|
|
std::stringstream ss;
|
|
for (auto const& item : set)
|
|
{
|
|
try
|
|
{
|
|
SerialIter sit(item.slice());
|
|
auto const tx = std::make_shared<
|
|
STTx const>(sit);
|
|
ss << debugTxstr(tx) << ", ";
|
|
}
|
|
catch(...)
|
|
{
|
|
ss << "THRO, ";
|
|
}
|
|
}
|
|
return ss.str();
|
|
}
|
|
|
|
std::string
|
|
debugTostr (std::shared_ptr<ReadView const> const& view)
|
|
{
|
|
std::stringstream ss;
|
|
for(auto const& item : view->txs)
|
|
ss << debugTxstr(item.first) << ", ";
|
|
return ss.str();
|
|
}
|
|
|
|
} // ripple
|