mirror of
https://github.com/Xahau/xahaud.git
synced 2025-12-06 17:27:52 +00:00
76ad06ef47
Do not process a transaction received from a peer if it has
been processed within the past ten seconds.
Increase the number of transaction handlers that can be in
flight in the job queue and decrease the relative cost for
peers to share transaction and ledger data.
Additionally, make better use of resources by adjusting the
number of threads we initialize, by reverting commit
68b8ffdb63.
Performance counter modifications:
* Create and display counters to track:
1) Pending transaction limit overruns.
2) Total peer disconnections.
3) Peers disconnections due to resource consumption.
Avoid a potential double-free in Json library.
133 lines
3.5 KiB
C++
133 lines
3.5 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/app/misc/HashRouter.h>
|
|
|
|
namespace ripple {
|
|
|
|
auto
|
|
HashRouter::emplace (uint256 const& key)
|
|
-> std::pair<Entry&, bool>
|
|
{
|
|
auto iter = suppressionMap_.find (key);
|
|
|
|
if (iter != suppressionMap_.end ())
|
|
{
|
|
suppressionMap_.touch(iter);
|
|
return std::make_pair(
|
|
std::ref(iter->second), false);
|
|
}
|
|
|
|
// See if any supressions need to be expired
|
|
expire(suppressionMap_, holdTime_);
|
|
|
|
return std::make_pair(std::ref(
|
|
suppressionMap_.emplace (
|
|
key, Entry ()).first->second),
|
|
true);
|
|
}
|
|
|
|
void HashRouter::addSuppression (uint256 const& key)
|
|
{
|
|
std::lock_guard <std::mutex> lock (mutex_);
|
|
|
|
emplace (key);
|
|
}
|
|
|
|
bool HashRouter::addSuppressionPeer (uint256 const& key, PeerShortID peer)
|
|
{
|
|
std::lock_guard <std::mutex> lock (mutex_);
|
|
|
|
auto result = emplace(key);
|
|
result.first.addPeer(peer);
|
|
return result.second;
|
|
}
|
|
|
|
bool HashRouter::addSuppressionPeer (uint256 const& key, PeerShortID peer, int& flags)
|
|
{
|
|
std::lock_guard <std::mutex> lock (mutex_);
|
|
|
|
auto result = emplace(key);
|
|
auto& s = result.first;
|
|
s.addPeer (peer);
|
|
flags = s.getFlags ();
|
|
return result.second;
|
|
}
|
|
|
|
bool HashRouter::shouldProcess (uint256 const& key, PeerShortID peer,
|
|
int& flags, std::chrono::seconds tx_interval)
|
|
{
|
|
std::lock_guard <std::mutex> lock (mutex_);
|
|
|
|
auto result = emplace(key);
|
|
auto& s = result.first;
|
|
s.addPeer (peer);
|
|
flags = s.getFlags ();
|
|
return s.shouldProcess (suppressionMap_.clock().now(), tx_interval);
|
|
}
|
|
|
|
int HashRouter::getFlags (uint256 const& key)
|
|
{
|
|
std::lock_guard <std::mutex> lock (mutex_);
|
|
|
|
return emplace(key).first.getFlags ();
|
|
}
|
|
|
|
bool HashRouter::setFlags (uint256 const& key, int flags)
|
|
{
|
|
assert (flags != 0);
|
|
|
|
std::lock_guard <std::mutex> lock (mutex_);
|
|
|
|
auto& s = emplace(key).first;
|
|
|
|
if ((s.getFlags () & flags) == flags)
|
|
return false;
|
|
|
|
s.setFlags (flags);
|
|
return true;
|
|
}
|
|
|
|
auto
|
|
HashRouter::shouldRelay (uint256 const& key)
|
|
-> boost::optional<std::set<PeerShortID>>
|
|
{
|
|
std::lock_guard <std::mutex> lock (mutex_);
|
|
|
|
auto& s = emplace(key).first;
|
|
|
|
if (!s.shouldRelay(suppressionMap_.clock().now(), holdTime_))
|
|
return boost::none;
|
|
|
|
return s.releasePeerSet();
|
|
}
|
|
|
|
bool
|
|
HashRouter::shouldRecover(uint256 const& key)
|
|
{
|
|
std::lock_guard <std::mutex> lock(mutex_);
|
|
|
|
auto& s = emplace(key).first;
|
|
|
|
return s.shouldRecover(recoverLimit_);
|
|
}
|
|
|
|
} // ripple
|