proofpool.h

Go to the documentation of this file.

// Copyright (c) 2021 The Bitcoin developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
 
#ifndef BITCOIN_AVALANCHE_PROOFPOOL_H
#define BITCOIN_AVALANCHE_PROOFPOOL_H
 
#include <avalanche/proof.h>
#include <avalanche/proofcomparator.h>
#include <avalanche/proofid.h>
#include <primitives/transaction.h>
 
#include <boost/multi_index/hashed_index.hpp>
#include <boost/multi_index/mem_fun.hpp>
#include <boost/multi_index/member.hpp>
#include <boost/multi_index/ordered_index.hpp>
#include <boost/multi_index_container.hpp>
 
#include <cstdint>
#include <unordered_set>
 
namespace avalanche {
 
class PeerManager;
 
struct ProofPoolEntry {
    size_t utxoIndex;
    ProofRef proof;
 
    const COutPoint &getUTXO() const {
        return proof->getStakes().at(utxoIndex).getStake().getUTXO();
    }
 
    ProofPoolEntry(size_t _utxoIndex, ProofRef _proof)
        : utxoIndex(_utxoIndex), proof(std::move(_proof)) {}
};
 
struct by_utxo;
struct by_proofid;
struct by_proof_score;
 
struct ProofPoolEntryProofIdKeyExtractor {
    using result_type = ProofId;
    result_type operator()(const ProofPoolEntry &entry) const {
        return entry.proof->getId();
    }
};
 
namespace bmi = boost::multi_index;
 
using ProofIdSet = std::unordered_set<ProofId, SaltedProofIdHasher>;
 
class ProofPool {
    boost::multi_index_container<
        ProofPoolEntry,
        bmi::indexed_by<
            // index by utxo
            bmi::hashed_unique<
                bmi::tag<by_utxo>,
                bmi::const_mem_fun<ProofPoolEntry, const COutPoint &,
                                   &ProofPoolEntry::getUTXO>,
                SaltedOutpointHasher>,
            // index by proofid
            bmi::hashed_non_unique<bmi::tag<by_proofid>,
                                   ProofPoolEntryProofIdKeyExtractor,
                                   SaltedProofIdHasher>,
            // index by proof score
            bmi::ordered_non_unique<
                bmi::tag<by_proof_score>,
                bmi::member<ProofPoolEntry, ProofRef, &ProofPoolEntry::proof>,
                ProofComparatorByScore>>>
        pool;
 
    mutable bool cacheClean = true;
    mutable size_t cacheProofCount = 0;
 
public:
    enum AddProofStatus {
        REJECTED = 0,   
        SUCCEED = 1,    
        DUPLICATED = 2, 
    };
 
    using ConflictingProofSet = std::set<ProofRef, ConflictingProofComparator>;
 
    AddProofStatus addProofIfNoConflict(const ProofRef &proof,
                                        ConflictingProofSet &conflictingProofs);
    AddProofStatus addProofIfNoConflict(const ProofRef &proof) {
        ConflictingProofSet dummy;
        return addProofIfNoConflict(proof, dummy);
    }
 
    AddProofStatus addProofIfPreferred(const ProofRef &proof,
                                       ConflictingProofSet &conflictingProofs);
    AddProofStatus addProofIfPreferred(const ProofRef &proof) {
        ConflictingProofSet dummy;
        return addProofIfPreferred(proof, dummy);
    }
 
    bool removeProof(ProofId proofid);
 
    std::unordered_set<ProofRef, SaltedProofHasher>
    rescan(PeerManager &peerManager);
 
    template <typename Callable> void forEachProof(Callable &&func) const {
        ProofId lastProofId;
        auto &poolView = pool.get<by_proofid>();
        for (auto it = poolView.begin(); it != poolView.end(); it++) {
            const ProofId &proofId = it->proof->getId();
            if (lastProofId != proofId) {
                func(it->proof);
                lastProofId = proofId;
            }
        }
    }
 
    ProofIdSet getProofIds() const;
    ProofRef getProof(const ProofId &proofid) const;
    ProofRef getProof(const COutPoint &outpoint) const;
    ProofRef getLowestScoreProof() const;
 
    size_t size() const { return pool.size(); }
    size_t countProofs() const;
};
 
} // namespace avalanche
 
#endif // BITCOIN_AVALANCHE_PROOFPOOL_H