mirror of
https://github.com/Xahau/xahaud.git
synced 2025-12-06 17:27:52 +00:00
27620af1bf
* Rename many variables. * Make most of PathState private. * Extract out common Node::isAccount() code. * Rename bConsumed to allLiquidityConsumed_. * Extract out code into PathState::clear().
121 lines
3.7 KiB
C++
121 lines
3.7 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 <ripple/module/app/paths/Calculators.h>
|
|
#include <ripple/module/app/paths/RippleCalc.h>
|
|
#include <ripple/module/app/paths/Tuning.h>
|
|
|
|
namespace ripple {
|
|
namespace path {
|
|
|
|
// Called to drive the from the first offer node in a chain.
|
|
//
|
|
// - Offer input is in issuer/limbo.
|
|
// - Current offers consumed.
|
|
// - Current offer owners debited.
|
|
// - Transfer fees credited to issuer.
|
|
// - Payout to issuer or limbo.
|
|
// - Deliver is set without transfer fees.
|
|
TER nodeOfferFwd (
|
|
RippleCalc& rippleCalc,
|
|
const unsigned int nodeIndex,
|
|
PathState& pathState,
|
|
const bool bMultiQuality
|
|
)
|
|
{
|
|
TER resultCode;
|
|
auto& previousNode = pathState.nodes() [nodeIndex - 1];
|
|
|
|
if (!!previousNode.uAccountID)
|
|
{
|
|
// Previous is an account node, resolve its deliver.
|
|
STAmount saInAct;
|
|
STAmount saInFees;
|
|
|
|
resultCode = nodeDeliverFwd (
|
|
rippleCalc,
|
|
nodeIndex,
|
|
pathState,
|
|
bMultiQuality,
|
|
previousNode.uAccountID,
|
|
previousNode.saFwdDeliver, // Previous is sending this much.
|
|
saInAct,
|
|
saInFees);
|
|
|
|
assert (resultCode != tesSUCCESS ||
|
|
previousNode.saFwdDeliver == saInAct + saInFees);
|
|
}
|
|
else
|
|
{
|
|
// Previous is an offer. Deliver has already been resolved.
|
|
resultCode = tesSUCCESS;
|
|
}
|
|
|
|
return resultCode;
|
|
|
|
}
|
|
|
|
// Called to drive from the last offer node in a chain.
|
|
TER nodeOfferRev (
|
|
RippleCalc& rippleCalc,
|
|
const unsigned int nodeIndex,
|
|
PathState& pathState,
|
|
const bool bMultiQuality)
|
|
{
|
|
TER resultCode;
|
|
|
|
auto& node = pathState.nodes() [nodeIndex];
|
|
auto& nextNode = pathState.nodes() [nodeIndex + 1];
|
|
|
|
if (!!nextNode.uAccountID)
|
|
{
|
|
// Next is an account node, resolve current offer node's deliver.
|
|
STAmount saDeliverAct;
|
|
|
|
WriteLog (lsTRACE, RippleCalc)
|
|
<< "nodeOfferRev: OFFER --> account:"
|
|
<< " nodeIndex=" << nodeIndex
|
|
<< " saRevDeliver=" << node.saRevDeliver;
|
|
|
|
resultCode = nodeDeliverRev (
|
|
rippleCalc,
|
|
nodeIndex,
|
|
pathState,
|
|
bMultiQuality,
|
|
nextNode.uAccountID,
|
|
|
|
// The next node wants the current node to deliver this much:
|
|
node.saRevDeliver,
|
|
saDeliverAct);
|
|
}
|
|
else
|
|
{
|
|
WriteLog (lsTRACE, RippleCalc)
|
|
<< "nodeOfferRev: OFFER --> offer: nodeIndex=" << nodeIndex;
|
|
|
|
// Next is an offer. Deliver has already been resolved.
|
|
resultCode = tesSUCCESS;
|
|
}
|
|
|
|
return resultCode;
|
|
}
|
|
|
|
} // path
|
|
} // ripple
|