mirror of
https://github.com/Xahau/xahaud.git
synced 2026-07-26 00:20:20 +00:00
The Owner count could decrease while evaluating a strand, causing different behavior in forward passes and reverses passes. The fix treats a decreased owner count like a deferred credit. In some situations, deferred credits could cause an XRP balance to be calculated as negative, triggering some asserts. When XRP is used as a bridge currency, a path could be falsely marked as dry. This happens when the XRP/XXX offer recursively checks the XXX/XRP offer and the XXX/XRP offer could not satisfy the request in a single call. With a single strand and limit quality the old payment code incorrectly computed with multiquailty set to true. This could cause the total quality to go below the requested quality even if there was liquidity available above the requested quality value.
264 lines
7.2 KiB
C++
264 lines
7.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/PaymentSandbox.h>
|
|
#include <ripple/ledger/View.h>
|
|
|
|
#include <boost/optional.hpp>
|
|
|
|
#include <cassert>
|
|
|
|
namespace ripple {
|
|
|
|
namespace detail {
|
|
|
|
auto DeferredCredits::makeKey (AccountID const& a1,
|
|
AccountID const& a2,
|
|
Currency const& c) -> Key
|
|
{
|
|
if (a1 < a2)
|
|
return std::make_tuple(a1, a2, c);
|
|
else
|
|
return std::make_tuple(a2, a1, c);
|
|
}
|
|
|
|
void
|
|
DeferredCredits::credit (AccountID const& sender,
|
|
AccountID const& receiver,
|
|
STAmount const& amount,
|
|
STAmount const& preCreditSenderBalance)
|
|
{
|
|
assert (sender != receiver);
|
|
assert (!amount.negative());
|
|
|
|
auto const k = makeKey (sender, receiver, amount.getCurrency ());
|
|
auto i = credits_.find (k);
|
|
if (i == credits_.end ())
|
|
{
|
|
Value v;
|
|
|
|
if (sender < receiver)
|
|
{
|
|
v.highAcctCredits = amount;
|
|
v.lowAcctCredits = amount.zeroed ();
|
|
v.lowAcctOrigBalance = preCreditSenderBalance;
|
|
}
|
|
else
|
|
{
|
|
v.highAcctCredits = amount.zeroed ();
|
|
v.lowAcctCredits = amount;
|
|
v.lowAcctOrigBalance = -preCreditSenderBalance;
|
|
}
|
|
|
|
credits_[k] = v;
|
|
}
|
|
else
|
|
{
|
|
// only record the balance the first time, do not record it here
|
|
auto& v = i->second;
|
|
if (sender < receiver)
|
|
v.highAcctCredits += amount;
|
|
else
|
|
v.lowAcctCredits += amount;
|
|
}
|
|
}
|
|
|
|
void
|
|
DeferredCredits::ownerCount (AccountID const& id,
|
|
std::uint32_t cur,
|
|
std::uint32_t next)
|
|
{
|
|
auto const v = std::max (cur, next);
|
|
auto r = ownerCounts_.emplace (std::make_pair (id, v));
|
|
if (!r.second)
|
|
{
|
|
auto& mapVal = r.first->second;
|
|
mapVal = std::max (v, mapVal);
|
|
}
|
|
}
|
|
|
|
boost::optional<std::uint32_t>
|
|
DeferredCredits::ownerCount (AccountID const& id) const
|
|
{
|
|
auto i = ownerCounts_.find (id);
|
|
if (i != ownerCounts_.end ())
|
|
return i->second;
|
|
return boost::none;
|
|
}
|
|
|
|
// Get the adjustments for the balance between main and other.
|
|
auto
|
|
DeferredCredits::adjustments (AccountID const& main,
|
|
AccountID const& other,
|
|
Currency const& currency) const -> boost::optional<Adjustment>
|
|
{
|
|
boost::optional<Adjustment> result;
|
|
|
|
Key const k = makeKey (main, other, currency);
|
|
auto i = credits_.find (k);
|
|
if (i == credits_.end ())
|
|
return result;
|
|
|
|
auto const& v = i->second;
|
|
|
|
if (main < other)
|
|
{
|
|
result.emplace (v.highAcctCredits, v.lowAcctCredits, v.lowAcctOrigBalance);
|
|
return result;
|
|
}
|
|
else
|
|
{
|
|
result.emplace (v.lowAcctCredits, v.highAcctCredits, -v.lowAcctOrigBalance);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
void DeferredCredits::apply(
|
|
DeferredCredits& to)
|
|
{
|
|
for (auto const& i : credits_)
|
|
{
|
|
auto r = to.credits_.emplace (i);
|
|
if (!r.second)
|
|
{
|
|
auto& toVal = r.first->second;
|
|
auto const& fromVal = i.second;
|
|
toVal.lowAcctCredits += fromVal.lowAcctCredits;
|
|
toVal.highAcctCredits += fromVal.highAcctCredits;
|
|
// Do not update the orig balance, it's already correct
|
|
}
|
|
}
|
|
|
|
for (auto const& i : ownerCounts_)
|
|
{
|
|
auto r = to.ownerCounts_.emplace (i);
|
|
if (!r.second)
|
|
{
|
|
auto& toVal = r.first->second;
|
|
auto const& fromVal = i.second;
|
|
toVal = std::max (toVal, fromVal);
|
|
}
|
|
}
|
|
}
|
|
|
|
} // detail
|
|
|
|
STAmount
|
|
PaymentSandbox::balanceHook (AccountID const& account,
|
|
AccountID const& issuer,
|
|
STAmount const& amount) const
|
|
{
|
|
/*
|
|
There are two algorithms here. The pre-switchover algorithm takes the
|
|
current amount and subtracts the recorded credits. The post-switchover
|
|
algorithm remembers the original balance, and subtracts the debits. The
|
|
post-switchover algorithm should be more numerically stable. Consider a
|
|
large credit with a small initial balance. The pre-switchover algorithm
|
|
computes (B+C)-C (where B+C will the the amount passed in). The
|
|
post-switchover algorithm returns B. When B and C differ by large
|
|
magnitudes, (B+C)-C may not equal B.
|
|
*/
|
|
|
|
auto const currency = amount.getCurrency ();
|
|
auto const switchover = flowV2Switchover (info ().parentCloseTime);
|
|
|
|
auto adjustedAmt = amount;
|
|
if (switchover)
|
|
{
|
|
auto delta = amount.zeroed ();
|
|
auto lastBal = amount;
|
|
for (auto curSB = this; curSB; curSB = curSB->ps_)
|
|
{
|
|
if (auto adj = curSB->tab_.adjustments (account, issuer, currency))
|
|
{
|
|
delta += adj->debits;
|
|
lastBal = adj->origBalance;
|
|
}
|
|
}
|
|
adjustedAmt = std::min(amount, lastBal - delta);
|
|
}
|
|
else
|
|
{
|
|
for (auto curSB = this; curSB; curSB = curSB->ps_)
|
|
{
|
|
if (auto adj = curSB->tab_.adjustments (account, issuer, currency))
|
|
{
|
|
adjustedAmt -= adj->credits;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (isXRP(issuer) && adjustedAmt < beast::zero)
|
|
// A calculated negative XRP balance is not an error case. Consider a
|
|
// payment snippet that credits a large XRP amount and then debits the
|
|
// same amount. The credit can't be used but we subtract the debit and
|
|
// calculate a negative value. It's not an error case.
|
|
adjustedAmt.clear();
|
|
|
|
return adjustedAmt;
|
|
}
|
|
|
|
std::uint32_t
|
|
PaymentSandbox::ownerCountHook (AccountID const& account,
|
|
std::uint32_t count) const
|
|
{
|
|
std::uint32_t result = count;
|
|
for (auto curSB = this; curSB; curSB = curSB->ps_)
|
|
{
|
|
if (auto adj = curSB->tab_.ownerCount (account))
|
|
result = std::max (result, *adj);
|
|
}
|
|
return result;
|
|
}
|
|
|
|
void
|
|
PaymentSandbox::creditHook (AccountID const& from,
|
|
AccountID const& to,
|
|
STAmount const& amount,
|
|
STAmount const& preCreditBalance)
|
|
{
|
|
tab_.credit (from, to, amount, preCreditBalance);
|
|
}
|
|
|
|
void
|
|
PaymentSandbox::adjustOwnerCountHook (AccountID const& account,
|
|
std::uint32_t cur,
|
|
std::uint32_t next)
|
|
{
|
|
tab_.ownerCount (account, cur, next);
|
|
}
|
|
|
|
void
|
|
PaymentSandbox::apply (RawView& to)
|
|
{
|
|
assert(! ps_);
|
|
items_.apply(to);
|
|
}
|
|
|
|
void
|
|
PaymentSandbox::apply (PaymentSandbox& to)
|
|
{
|
|
assert(ps_ == &to);
|
|
items_.apply(to);
|
|
tab_.apply(to.tab_);
|
|
}
|
|
|
|
} // ripple
|