Bootcache.h

//------------------------------------------------------------------------------
/*
    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_PEERFINDER_BOOTCACHE_H_INCLUDED
#define RIPPLE_PEERFINDER_BOOTCACHE_H_INCLUDED
 
#include <xrpld/peerfinder/PeerfinderManager.h>
#include <xrpld/peerfinder/detail/Store.h>
 
#include <xrpl/basics/comparators.h>
#include <xrpl/beast/utility/Journal.h>
#include <xrpl/beast/utility/PropertyStream.h>
 
#include <boost/bimap.hpp>
#include <boost/bimap/multiset_of.hpp>
#include <boost/bimap/unordered_set_of.hpp>
#include <boost/iterator/transform_iterator.hpp>
 
namespace ripple {
namespace PeerFinder {
 
class Bootcache
{
private:
    class Entry
    {
    public:
        Entry(int valence) : m_valence(valence)
        {
        }
 
        int&
        valence()
        {
            return m_valence;
        }
 
        int
        valence() const
        {
            return m_valence;
        }
 
        friend bool
        operator<(Entry const& lhs, Entry const& rhs)
        {
            if (lhs.valence() > rhs.valence())
                return true;
            return false;
        }
 
    private:
        int m_valence;
    };
 
    using left_t = boost::bimaps::unordered_set_of<
        beast::IP::Endpoint,
        boost::hash<beast::IP::Endpoint>,
        ripple::equal_to<beast::IP::Endpoint>>;
    using right_t = boost::bimaps::multiset_of<Entry, ripple::less<Entry>>;
    using map_type = boost::bimap<left_t, right_t>;
    using value_type = map_type::value_type;
 
    struct Transform
    {
        using first_argument_type =
            map_type::right_map::const_iterator::value_type const&;
        using result_type = beast::IP::Endpoint const&;
 
        explicit Transform() = default;
 
        beast::IP::Endpoint const&
        operator()(
            map_type::right_map::const_iterator::value_type const& v) const
        {
            return v.get_left();
        }
    };
 
private:
    map_type m_map;
 
    Store& m_store;
    clock_type& m_clock;
    beast::Journal m_journal;
 
    // Time after which we can update the database again
    clock_type::time_point m_whenUpdate;
 
    // Set to true when a database update is needed
    bool m_needsUpdate;
 
public:
    static constexpr int staticValence = 32;
 
    using iterator = boost::
        transform_iterator<Transform, map_type::right_map::const_iterator>;
 
    using const_iterator = iterator;
 
    Bootcache(Store& store, clock_type& clock, beast::Journal journal);
 
    ~Bootcache();
 
    bool
    empty() const;
 
    map_type::size_type
    size() const;
 
    const_iterator
    begin() const;
    const_iterator
    cbegin() const;
    const_iterator
    end() const;
    const_iterator
    cend() const;
    void
    clear();
    void
    load();
 
    bool
    insert(beast::IP::Endpoint const& endpoint);
 
    bool
    insertStatic(beast::IP::Endpoint const& endpoint);
 
    void
    on_success(beast::IP::Endpoint const& endpoint);
 
    void
    on_failure(beast::IP::Endpoint const& endpoint);
 
    void
    periodicActivity();
 
    void
    onWrite(beast::PropertyStream::Map& map);
 
private:
    void
    prune();
    void
    update();
    void
    checkUpdate();
    void
    flagForUpdate();
};
 
}  // namespace PeerFinder
}  // namespace ripple
 
#endif