mirror of
https://github.com/Xahau/xahaud.git
synced 2025-12-06 17:27:52 +00:00
122a5cdf89
Add a new algorithm for finding the liquidity in a payment path. There is still a reverse and forward pass, but the forward pass starts at the limiting step rather than the payment source. This insures the limiting step is completely consumed rather than potentially leaving a 'dust' amount in the forward pass. Each step in a payment is either a book step, a direct step (account to account step), or an xrp endpoint. Each step in the existing implementation is a triple, where each element in the triple is either an account of a book, for a total of eight step types. Since accounts are considered in pairs, rather than triples, transfer fees are handled differently. In V1 of payments, in the payment path A -> gw ->B, if A redeems to gw, and gw issues to B, a transfer fee is changed. In the new code, a transfer fee is changed even if A issues to gw.
96 lines
2.7 KiB
C++
96 lines
2.7 KiB
C++
//------------------------------------------------------------------------------
|
|
/*
|
|
This file is part of rippled: https://github.com/ripple/rippled
|
|
Copyright (c) 2015 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_APP_PATHS_IMPL_STEP_CHECKS_H_INCLUDED
|
|
#define RIPPLE_APP_PATHS_IMPL_STEP_CHECKS_H_INCLUDED
|
|
|
|
#include <ripple/basics/Log.h>
|
|
#include <ripple/ledger/ReadView.h>
|
|
#include <ripple/protocol/AccountID.h>
|
|
#include <ripple/protocol/UintTypes.h>
|
|
|
|
#include <beast/beast/utility/Journal.h>
|
|
|
|
namespace ripple {
|
|
|
|
inline
|
|
TER
|
|
checkFreeze (
|
|
ReadView const& view,
|
|
AccountID const& src,
|
|
AccountID const& dst,
|
|
Currency const& currency)
|
|
{
|
|
assert (src != dst);
|
|
|
|
// check freeze
|
|
if (auto sle = view.read (keylet::account (dst)))
|
|
{
|
|
if (sle->isFlag (lsfGlobalFreeze))
|
|
{
|
|
return terNO_LINE;
|
|
}
|
|
}
|
|
|
|
if (auto sle = view.read (keylet::line (src, dst, currency)))
|
|
{
|
|
if (sle->isFlag ((dst > src) ? lsfHighFreeze : lsfLowFreeze))
|
|
{
|
|
return terNO_LINE;
|
|
}
|
|
}
|
|
|
|
return tesSUCCESS;
|
|
}
|
|
|
|
inline
|
|
TER
|
|
checkNoRipple (
|
|
ReadView const& view,
|
|
AccountID const& prev,
|
|
AccountID const& cur,
|
|
// This is the account whose constraints we are checking
|
|
AccountID const& next,
|
|
Currency const& currency,
|
|
beast::Journal j)
|
|
{
|
|
// fetch the ripple lines into and out of this node
|
|
auto sleIn = view.read (keylet::line (prev, cur, currency));
|
|
auto sleOut = view.read (keylet::line (cur, next, currency));
|
|
|
|
if (!sleIn || !sleOut)
|
|
return terNO_LINE;
|
|
|
|
if ((*sleIn)[sfFlags] &
|
|
((cur > prev) ? lsfHighNoRipple : lsfLowNoRipple) &&
|
|
(*sleOut)[sfFlags] &
|
|
((cur > next) ? lsfHighNoRipple : lsfLowNoRipple))
|
|
{
|
|
JLOG (j.info) << "Path violates noRipple constraint between " << prev
|
|
<< ", " << cur << " and " << next;
|
|
|
|
return terNO_RIPPLE;
|
|
}
|
|
return tesSUCCESS;
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|