mirror of
https://github.com/XRPLF/rippled.git
synced 2025-12-06 17:27:55 +00:00
9329aafe53
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.
183 lines
4.2 KiB
C++
183 lines
4.2 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/ledger/ReadView.h>
|
|
#include <boost/optional.hpp>
|
|
|
|
namespace ripple {
|
|
|
|
class Rules::Impl
|
|
{
|
|
private:
|
|
std::unordered_set<uint256,
|
|
hardened_hash<>> set_;
|
|
boost::optional<uint256> digest_;
|
|
|
|
public:
|
|
Impl (DigestAwareReadView const& ledger)
|
|
{
|
|
auto const k = keylet::amendments();
|
|
digest_ = ledger.digest(k.key);
|
|
if (! digest_)
|
|
return;
|
|
auto const sle = ledger.read(k);
|
|
if (! sle)
|
|
{
|
|
// LogicError() ?
|
|
return;
|
|
}
|
|
|
|
for (auto const& item :
|
|
sle->getFieldV256(sfAmendments))
|
|
set_.insert(item);
|
|
}
|
|
|
|
bool
|
|
enabled (uint256 const& feature) const
|
|
{
|
|
return set_.count(feature) > 0;
|
|
}
|
|
|
|
bool
|
|
changed (DigestAwareReadView const& ledger) const
|
|
{
|
|
auto const digest =
|
|
ledger.digest(keylet::amendments().key);
|
|
if (! digest && ! digest_)
|
|
return false;
|
|
if (! digest || ! digest_)
|
|
return true;
|
|
return *digest != *digest_;
|
|
}
|
|
|
|
bool
|
|
operator== (Impl const& other) const
|
|
{
|
|
if (! digest_ && ! other.digest_)
|
|
return true;
|
|
if (! digest_ || ! other.digest_)
|
|
return false;
|
|
return *digest_ == *other.digest_;
|
|
}
|
|
};
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
Rules::Rules (DigestAwareReadView const& ledger)
|
|
: impl_(std::make_shared<Impl>(ledger))
|
|
{
|
|
}
|
|
|
|
bool
|
|
Rules::enabled (uint256 const& id,
|
|
std::unordered_set<uint256,
|
|
beast::uhash<>> const& presets) const
|
|
{
|
|
if (presets.count(id) > 0)
|
|
return true;
|
|
if (! impl_)
|
|
return false;
|
|
return impl_->enabled(id);
|
|
}
|
|
|
|
bool
|
|
Rules::changed (DigestAwareReadView const& ledger) const
|
|
{
|
|
if (! impl_)
|
|
return static_cast<bool>(
|
|
ledger.digest(keylet::amendments().key));
|
|
return impl_->changed(ledger);
|
|
}
|
|
|
|
bool
|
|
Rules::operator== (Rules const& other) const
|
|
{
|
|
#if 1
|
|
if (impl_.get() == other.impl_.get())
|
|
return true;
|
|
if (! impl_ || ! other.impl_)
|
|
return false;
|
|
return *impl_ == *other.impl_;
|
|
#else
|
|
return impl_.get() == other.impl_.get();
|
|
#endif
|
|
}
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
ReadView::sles_type::sles_type(
|
|
ReadView const& view)
|
|
: ReadViewFwdRange(view)
|
|
{
|
|
}
|
|
|
|
auto
|
|
ReadView::sles_type::begin() const ->
|
|
iterator
|
|
{
|
|
return iterator(view_, view_->slesBegin());
|
|
}
|
|
|
|
auto
|
|
ReadView::sles_type::end() const ->
|
|
iterator const&
|
|
{
|
|
if (! end_)
|
|
end_ = iterator(view_, view_->slesEnd());
|
|
return *end_;
|
|
}
|
|
|
|
auto
|
|
ReadView::sles_type::upper_bound(key_type const& key) const ->
|
|
iterator
|
|
{
|
|
return iterator(view_, view_->slesUpperBound(key));
|
|
}
|
|
|
|
ReadView::txs_type::txs_type(
|
|
ReadView const& view)
|
|
: ReadViewFwdRange(view)
|
|
{
|
|
}
|
|
|
|
bool
|
|
ReadView::txs_type::empty() const
|
|
{
|
|
return begin() == end();
|
|
}
|
|
|
|
auto
|
|
ReadView::txs_type::begin() const ->
|
|
iterator
|
|
{
|
|
return iterator(view_, view_->txsBegin());
|
|
}
|
|
|
|
auto
|
|
ReadView::txs_type::end() const ->
|
|
iterator const&
|
|
{
|
|
if (! end_)
|
|
end_ = iterator(view_, view_->txsEnd());
|
|
return *end_;
|
|
}
|
|
|
|
} // ripple
|