Cluster.cpp

//------------------------------------------------------------------------------
/*
    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 <xrpld/core/Config.h>
#include <xrpld/core/TimeKeeper.h>
#include <xrpld/overlay/Cluster.h>
#include <xrpld/overlay/ClusterNode.h>
 
#include <xrpl/basics/Log.h>
#include <xrpl/basics/StringUtilities.h>
#include <xrpl/protocol/tokens.h>
 
#include <boost/regex.hpp>
 
namespace ripple {
 
Cluster::Cluster(beast::Journal j) : j_(j)
{
}
 
std::optional<std::string>
Cluster::member(PublicKey const& identity) const
{
    std::lock_guard lock(mutex_);
 
    auto iter = nodes_.find(identity);
    if (iter == nodes_.end())
        return std::nullopt;
    return iter->name();
}
 
std::size_t
Cluster::size() const
{
    std::lock_guard lock(mutex_);
 
    return nodes_.size();
}
 
bool
Cluster::update(
    PublicKey const& identity,
    std::string name,
    std::uint32_t loadFee,
    NetClock::time_point reportTime)
{
    std::lock_guard lock(mutex_);
 
    auto iter = nodes_.find(identity);
 
    if (iter != nodes_.end())
    {
        if (reportTime <= iter->getReportTime())
            return false;
 
        if (name.empty())
            name = iter->name();
 
        iter = nodes_.erase(iter);
    }
 
    nodes_.emplace_hint(iter, identity, name, loadFee, reportTime);
    return true;
}
 
void
Cluster::for_each(std::function<void(ClusterNode const&)> func) const
{
    std::lock_guard lock(mutex_);
    for (auto const& ni : nodes_)
        func(ni);
}
 
bool
Cluster::load(Section const& nodes)
{
    static boost::regex const re(
        "[[:space:]]*"       // skip leading whitespace
        "([[:alnum:]]+)"     // node identity
        "(?:"                // begin optional comment block
        "[[:space:]]+"       // (skip all leading whitespace)
        "(?:"                // begin optional comment
        "(.*[^[:space:]]+)"  // the comment
        "[[:space:]]*"       // (skip all trailing whitespace)
        ")?"                 // end optional comment
        ")?"                 // end optional comment block
    );
 
    for (auto const& n : nodes.values())
    {
        boost::smatch match;
 
        if (!boost::regex_match(n, match, re))
        {
            JLOG(j_.error()) << "Malformed entry: '" << n << "'";
            return false;
        }
 
        auto const id =
            parseBase58<PublicKey>(TokenType::NodePublic, match[1].str());
 
        if (!id)
        {
            JLOG(j_.error()) << "Invalid node identity: " << match[1];
            return false;
        }
 
        if (member(*id))
        {
            JLOG(j_.warn()) << "Duplicate node identity: " << match[1];
            continue;
        }
 
        update(*id, trim_whitespace(match[2]));
    }
 
    return true;
}
 
}  // namespace ripple