mirror of
https://github.com/Xahau/xahaud.git
synced 2025-12-06 17:27:52 +00:00
Replace Taker.cpp with calls to the payment flow() code. This change required a number of tweaks in the payment flow code. These tweaks are conditionalized on whether or not offer crossing is taking place. The flag is explicitly passed as a parameter to the flow code. For testing, a class was added that identifies differences in the contents of two PaymentSandboxes. That code may be reusable in the future. None of the Taker offer crossing code is removed. Both versions of the code are co-resident to support an amendment cut-over. The code that identifies differences between Taker and Flow offer crossing is enabled by a feature. That makes it easy to enable or disable difference logging by changing the config file. This approach models what was done with the payment flow code. The differencing code should never be enabled on a production server. Extensive offer crossing unit tests are added to examine and verify the behavior of corner cases. The tests are currently configured to run against both Taker and Flow offer crossing. This gives us confidence that most cases run identically and some of the (few) differences in behavior are documented.
291 lines
7.6 KiB
C++
291 lines
7.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.
|
|
*/
|
|
//==============================================================================
|
|
|
|
#ifndef RIPPLE_PROTOCOL_QUALITY_H_INCLUDED
|
|
#define RIPPLE_PROTOCOL_QUALITY_H_INCLUDED
|
|
|
|
#include <ripple/protocol/AmountConversions.h>
|
|
#include <ripple/protocol/IOUAmount.h>
|
|
#include <ripple/protocol/STAmount.h>
|
|
#include <ripple/protocol/XRPAmount.h>
|
|
|
|
#include <cstdint>
|
|
#include <ostream>
|
|
|
|
namespace ripple {
|
|
|
|
/** Represents a pair of input and output currencies.
|
|
|
|
The input currency can be converted to the output
|
|
currency by multiplying by the rate, represented by
|
|
Quality.
|
|
|
|
For offers, "in" is always TakerPays and "out" is
|
|
always TakerGets.
|
|
*/
|
|
template<class In, class Out>
|
|
struct TAmounts
|
|
{
|
|
TAmounts() = default;
|
|
|
|
TAmounts (beast::Zero, beast::Zero)
|
|
: in (beast::zero)
|
|
, out (beast::zero)
|
|
{
|
|
}
|
|
|
|
TAmounts (In const& in_, Out const& out_)
|
|
: in (in_)
|
|
, out (out_)
|
|
{
|
|
}
|
|
|
|
/** Returns `true` if either quantity is not positive. */
|
|
bool
|
|
empty() const noexcept
|
|
{
|
|
return in <= zero || out <= zero;
|
|
}
|
|
|
|
TAmounts& operator+=(TAmounts const& rhs)
|
|
{
|
|
in += rhs.in;
|
|
out += rhs.out;
|
|
return *this;
|
|
}
|
|
|
|
TAmounts& operator-=(TAmounts const& rhs)
|
|
{
|
|
in -= rhs.in;
|
|
out -= rhs.out;
|
|
return *this;
|
|
}
|
|
|
|
In in;
|
|
Out out;
|
|
};
|
|
|
|
template<class In, class Out>
|
|
TAmounts<In, Out> make_Amounts(In const& in, Out const& out)
|
|
{
|
|
return TAmounts<In, Out>(in, out);
|
|
}
|
|
|
|
using Amounts = TAmounts<STAmount, STAmount>;
|
|
|
|
template<class In, class Out>
|
|
bool
|
|
operator== (
|
|
TAmounts<In, Out> const& lhs,
|
|
TAmounts<In, Out> const& rhs) noexcept
|
|
{
|
|
return lhs.in == rhs.in && lhs.out == rhs.out;
|
|
}
|
|
|
|
template<class In, class Out>
|
|
bool
|
|
operator!= (
|
|
TAmounts<In, Out> const& lhs,
|
|
TAmounts<In, Out> const& rhs) noexcept
|
|
{
|
|
return ! (lhs == rhs);
|
|
}
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
// Ripple specific constant used for parsing qualities and other things
|
|
#define QUALITY_ONE 1000000000
|
|
|
|
/** Represents the logical ratio of output currency to input currency.
|
|
Internally this is stored using a custom floating point representation,
|
|
as the inverse of the ratio, so that quality will be descending in
|
|
a sequence of actual values that represent qualities.
|
|
*/
|
|
class Quality
|
|
{
|
|
public:
|
|
// Type of the internal representation. Higher qualities
|
|
// have lower unsigned integer representations.
|
|
using value_type = std::uint64_t;
|
|
|
|
static const int minTickSize = 3;
|
|
static const int maxTickSize = 16;
|
|
|
|
private:
|
|
value_type m_value;
|
|
|
|
public:
|
|
Quality() = default;
|
|
|
|
/** Create a quality from the integer encoding of an STAmount */
|
|
explicit
|
|
Quality (std::uint64_t value);
|
|
|
|
/** Create a quality from the ratio of two amounts. */
|
|
explicit
|
|
Quality (Amounts const& amount);
|
|
|
|
/** Create a quality from the ratio of two amounts. */
|
|
template<class In, class Out>
|
|
Quality (Out const& out, In const& in)
|
|
: Quality (Amounts (toSTAmount (in),
|
|
toSTAmount (out)))
|
|
{}
|
|
|
|
/** Advances to the next higher quality level. */
|
|
/** @{ */
|
|
Quality&
|
|
operator++();
|
|
|
|
Quality
|
|
operator++ (int);
|
|
/** @} */
|
|
|
|
/** Advances to the next lower quality level. */
|
|
/** @{ */
|
|
Quality&
|
|
operator--();
|
|
|
|
Quality
|
|
operator-- (int);
|
|
/** @} */
|
|
|
|
/** Returns the quality as STAmount. */
|
|
STAmount
|
|
rate () const
|
|
{
|
|
return amountFromQuality (m_value);
|
|
}
|
|
|
|
/** Returns the quality rounded up to the specified number
|
|
of decimal digits.
|
|
*/
|
|
Quality
|
|
round (int tickSize) const;
|
|
|
|
/** Returns the scaled amount with in capped.
|
|
Math is avoided if the result is exact. The output is clamped
|
|
to prevent money creation.
|
|
*/
|
|
Amounts
|
|
ceil_in (Amounts const& amount, STAmount const& limit) const;
|
|
|
|
template<class In, class Out>
|
|
TAmounts<In, Out>
|
|
ceil_in (TAmounts<In, Out> const& amount, In const& limit) const
|
|
{
|
|
if (amount.in <= limit)
|
|
return amount;
|
|
|
|
// Use the existing STAmount implementation for now, but consider
|
|
// replacing with code specific to IOUAMount and XRPAmount
|
|
Amounts stAmt (toSTAmount (amount.in), toSTAmount (amount.out));
|
|
STAmount stLim (toSTAmount (limit));
|
|
auto const stRes = ceil_in (stAmt, stLim);
|
|
return TAmounts<In, Out> (toAmount<In> (stRes.in), toAmount<Out> (stRes.out));
|
|
}
|
|
|
|
/** Returns the scaled amount with out capped.
|
|
Math is avoided if the result is exact. The input is clamped
|
|
to prevent money creation.
|
|
*/
|
|
Amounts
|
|
ceil_out (Amounts const& amount, STAmount const& limit) const;
|
|
|
|
template<class In, class Out>
|
|
TAmounts<In, Out>
|
|
ceil_out (TAmounts<In, Out> const& amount, Out const& limit) const
|
|
{
|
|
if (amount.out <= limit)
|
|
return amount;
|
|
|
|
// Use the existing STAmount implementation for now, but consider
|
|
// replacing with code specific to IOUAMount and XRPAmount
|
|
Amounts stAmt (toSTAmount (amount.in), toSTAmount (amount.out));
|
|
STAmount stLim (toSTAmount (limit));
|
|
auto const stRes = ceil_out (stAmt, stLim);
|
|
return TAmounts<In, Out> (toAmount<In> (stRes.in), toAmount<Out> (stRes.out));
|
|
}
|
|
|
|
/** Returns `true` if lhs is lower quality than `rhs`.
|
|
Lower quality means the taker receives a worse deal.
|
|
Higher quality is better for the taker.
|
|
*/
|
|
friend
|
|
bool
|
|
operator< (Quality const& lhs, Quality const& rhs) noexcept
|
|
{
|
|
return lhs.m_value > rhs.m_value;
|
|
}
|
|
|
|
friend
|
|
bool
|
|
operator> (Quality const& lhs, Quality const& rhs) noexcept
|
|
{
|
|
return lhs.m_value < rhs.m_value;
|
|
}
|
|
|
|
friend
|
|
bool
|
|
operator<= (Quality const& lhs, Quality const& rhs) noexcept
|
|
{
|
|
return !(lhs > rhs);
|
|
}
|
|
|
|
friend
|
|
bool
|
|
operator>= (Quality const& lhs, Quality const& rhs) noexcept
|
|
{
|
|
return !(lhs < rhs);
|
|
}
|
|
|
|
friend
|
|
bool
|
|
operator== (Quality const& lhs, Quality const& rhs) noexcept
|
|
{
|
|
return lhs.m_value == rhs.m_value;
|
|
}
|
|
|
|
friend
|
|
bool
|
|
operator!= (Quality const& lhs, Quality const& rhs) noexcept
|
|
{
|
|
return ! (lhs == rhs);
|
|
}
|
|
|
|
friend
|
|
std::ostream&
|
|
operator<< (std::ostream& os, Quality const& quality)
|
|
{
|
|
os << quality.m_value;
|
|
return os;
|
|
}
|
|
};
|
|
|
|
/** Calculate the quality of a two-hop path given the two hops.
|
|
@param lhs The first leg of the path: input to intermediate.
|
|
@param rhs The second leg of the path: intermediate to output.
|
|
*/
|
|
Quality
|
|
composed_quality (Quality const& lhs, Quality const& rhs);
|
|
|
|
}
|
|
|
|
#endif
|