mirror of
https://github.com/Xahau/xahaud.git
synced 2025-11-04 10:45:50 +00:00
2c71802e38
* Whenever a node downloads a new VL, send it to all peers that haven't already sent or received it. It also saves it to the database_dir as a Json text file named "cache." plus the public key of the list signer. Any files that exist for public keys provided in [validator_list_keys] will be loaded and processed if any download from [validator_list_sites] fails or no [validator_list_sites] are configured. * Whenever a node receives a broadcast VL message, it treats it as if it had downloaded it on it's own, broadcasting to other peers as described above. * Because nodes normally download the VL once every 5 minutes, a single node downloading a VL with an updated sequence number could potentially propagate across a large part of a well-connected network before any other nodes attempt to download, decreasing the amount of time that different parts of the network are using different VLs. * Send all of our current valid VLs to new peers on connection. This is probably the "noisiest" part of this change, but will give poorly connected or poorly networked nodes the best chance of syncing quickly. Nodes which have no http(s) access configured or available can get a VL with no extra effort. * Requests on the peer port to the /vl/<pubkey> endpoint will return that VL in the same JSON format as is used to download now, IF the node trusts and has a valid instance of that VL. * Upgrade protocol version to 2.1. VLs will only be sent to 2.1 and higher nodes. * Resolves #2953
129 lines
3.3 KiB
C++
129 lines
3.3 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.
|
|
*/
|
|
//==============================================================================
|
|
|
|
#ifndef RIPPLE_OVERLAY_PEER_H_INCLUDED
|
|
#define RIPPLE_OVERLAY_PEER_H_INCLUDED
|
|
|
|
#include <ripple/overlay/Message.h>
|
|
#include <ripple/basics/base_uint.h>
|
|
#include <ripple/json/json_value.h>
|
|
#include <ripple/protocol/PublicKey.h>
|
|
#include <ripple/beast/net/IPEndpoint.h>
|
|
|
|
namespace ripple {
|
|
|
|
namespace Resource {
|
|
class Charge;
|
|
}
|
|
|
|
// Maximum hops to attempt when crawling shards. cs = crawl shards
|
|
static constexpr std::uint32_t csHopLimit = 3;
|
|
|
|
enum class ProtocolFeature {
|
|
ValidatorListPropagation,
|
|
};
|
|
|
|
/** Represents a peer connection in the overlay. */
|
|
class Peer
|
|
{
|
|
public:
|
|
using ptr = std::shared_ptr<Peer>;
|
|
|
|
/** Uniquely identifies a peer.
|
|
This can be stored in tables to find the peer later. Callers
|
|
can discover if the peer is no longer connected and make
|
|
adjustments as needed.
|
|
*/
|
|
using id_t = std::uint32_t;
|
|
|
|
virtual ~Peer() = default;
|
|
|
|
//
|
|
// Network
|
|
//
|
|
|
|
virtual
|
|
void
|
|
send (std::shared_ptr<Message> const& m) = 0;
|
|
|
|
virtual
|
|
beast::IP::Endpoint
|
|
getRemoteAddress() const = 0;
|
|
|
|
/** Adjust this peer's load balance based on the type of load imposed. */
|
|
virtual
|
|
void
|
|
charge (Resource::Charge const& fee) = 0;
|
|
|
|
//
|
|
// Identity
|
|
//
|
|
|
|
virtual
|
|
id_t
|
|
id() const = 0;
|
|
|
|
/** Returns `true` if this connection is a member of the cluster. */
|
|
virtual
|
|
bool
|
|
cluster() const = 0;
|
|
|
|
virtual
|
|
bool
|
|
isHighLatency() const = 0;
|
|
|
|
virtual
|
|
int
|
|
getScore (bool) const = 0;
|
|
|
|
virtual
|
|
PublicKey const&
|
|
getNodePublic() const = 0;
|
|
|
|
virtual
|
|
Json::Value json() = 0;
|
|
|
|
virtual bool
|
|
supportsFeature(ProtocolFeature f) const = 0;
|
|
|
|
virtual
|
|
boost::optional<std::size_t>
|
|
publisherListSequence(PublicKey const&) const = 0;
|
|
|
|
virtual
|
|
void
|
|
setPublisherListSequence(PublicKey const&, std::size_t const) = 0;
|
|
|
|
//
|
|
// Ledger
|
|
//
|
|
|
|
virtual uint256 const& getClosedLedgerHash () const = 0;
|
|
virtual bool hasLedger (uint256 const& hash, std::uint32_t seq) const = 0;
|
|
virtual void ledgerRange (std::uint32_t& minSeq, std::uint32_t& maxSeq) const = 0;
|
|
virtual bool hasShard (std::uint32_t shardIndex) const = 0;
|
|
virtual bool hasTxSet (uint256 const& hash) const = 0;
|
|
virtual void cycleStatus () = 0;
|
|
virtual bool hasRange (std::uint32_t uMin, std::uint32_t uMax) = 0;
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|