Page MenuHomePhabricator
Differential D11450 Diff 33525 src/avalanche/peermanager.h

Changeset View

Standalone View

View Options

src/avalanche/peermanager.h

// Copyright (c) 2020 The Bitcoin developers // Copyright (c) 2020 The Bitcoin developers
// Distributed under the MIT software license, see the accompanying // Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php. // file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef BITCOIN_AVALANCHE_PEERMANAGER_H #ifndef BITCOIN_AVALANCHE_PEERMANAGER_H
#define BITCOIN_AVALANCHE_PEERMANAGER_H #define BITCOIN_AVALANCHE_PEERMANAGER_H
#include <avalanche/node.h> #include <avalanche/node.h>
#include <avalanche/proof.h> #include <avalanche/proof.h>
#include <avalanche/proofpool.h> #include <avalanche/proofpool.h>
#include <coins.h> #include <coins.h>
#include <consensus/validation.h> #include <consensus/validation.h>
#include <pubkey.h> #include <pubkey.h>
#include <radix.h>
#include <rcu.h>
#include <salteduint256hasher.h> #include <salteduint256hasher.h>
#include <util/time.h> #include <util/time.h>
#include <boost/multi_index/composite_key.hpp> #include <boost/multi_index/composite_key.hpp>
#include <boost/multi_index/hashed_index.hpp> #include <boost/multi_index/hashed_index.hpp>
#include <boost/multi_index/mem_fun.hpp> #include <boost/multi_index/mem_fun.hpp>
#include <boost/multi_index/member.hpp> #include <boost/multi_index/member.hpp>
#include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/ordered_index.hpp>
▲ Show 20 Lines • Show All 128 Lines • ▼ Show 20 Linesclass PeerManager {
PeerId nextPeerId = 0; PeerId nextPeerId = 0;
PeerSet peers; PeerSet peers;
ProofPool validProofPool; ProofPool validProofPool;
ProofPool conflictingProofPool; ProofPool conflictingProofPool;
ProofPool orphanProofPool; ProofPool orphanProofPool;
struct ProofIdKeyAdapter {
FabienAuthorUnsubmitted
Done
Inline Actions

This needs to move or get abstracted somehow so we don't have to know the underlying of the radix tree everywhere

Fabien: This needs to move or get abstracted somehow so we don't have to know the underlying of the…
Uint256KeyWrapper getId(const Proof &proof) const {
return proof.getId();
}
};
RadixTree<const Proof, ProofIdKeyAdapter> shareableProofs;
using NodeSet = boost::multi_index_container< using NodeSet = boost::multi_index_container<
Node, Node,
bmi::indexed_by< bmi::indexed_by<
// index by nodeid // index by nodeid
bmi::hashed_unique<bmi::member<Node, NodeId, &Node::nodeid>>, bmi::hashed_unique<bmi::member<Node, NodeId, &Node::nodeid>>,
// sorted by peerid/nextRequestTime // sorted by peerid/nextRequestTime
bmi::ordered_non_unique< bmi::ordered_non_unique<
bmi::tag<next_request_time>, bmi::tag<next_request_time>,
▲ Show 20 Lines • Show All 185 Lines • ▼ Show 20 Linespublic:
uint64_t getSlotCount() const { return slotCount; } uint64_t getSlotCount() const { return slotCount; }
uint64_t getFragmentation() const { return fragmentation; } uint64_t getFragmentation() const { return fragmentation; }
ProofRef getProof(const ProofId &proofid) const; ProofRef getProof(const ProofId &proofid) const;
bool isBoundToPeer(const ProofId &proofid) const; bool isBoundToPeer(const ProofId &proofid) const;
bool isOrphan(const ProofId &proofid) const; bool isOrphan(const ProofId &proofid) const;
bool isInConflictingPool(const ProofId &proofid) const; bool isInConflictingPool(const ProofId &proofid) const;
using TreeType = decltype(shareableProofs);
std::unique_ptr<TreeType, void (*)(TreeType *)>
getShareableProofsSnapshot() const {
return std::unique_ptr<TreeType, void (*)(TreeType *)>(
new TreeType(shareableProofs), [](TreeType *t) {
delete t;
RCULock::synchronize();
});
}
private: private:
template <typename ProofContainer> template <typename ProofContainer>
void moveToConflictingPool(const ProofContainer &proofs); void moveToConflictingPool(const ProofContainer &proofs);
bool addOrUpdateNode(const PeerSet::iterator &it, NodeId nodeid); bool addOrUpdateNode(const PeerSet::iterator &it, NodeId nodeid);
bool addNodeToPeer(const PeerSet::iterator &it); bool addNodeToPeer(const PeerSet::iterator &it);
bool removeNodeFromPeer(const PeerSet::iterator &it, uint32_t count = 1); bool removeNodeFromPeer(const PeerSet::iterator &it, uint32_t count = 1);
Show All 12 Lines