969826c249
- Removed of reference node and replaced with decentralized quorums that pick the masternodes who get paid each block. - Made a budgeting system, where masternodes can vote on individual budgets and the data is stored perminently on each clients computer
143 lines
4.0 KiB
C++
143 lines
4.0 KiB
C++
// Copyright (c) 2014-2015 The Dash developers
|
|
// Distributed under the MIT/X11 software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#ifndef MASTERNODEMAN_H
|
|
#define MASTERNODEMAN_H
|
|
|
|
#include "sync.h"
|
|
#include "net.h"
|
|
#include "key.h"
|
|
#include "util.h"
|
|
#include "base58.h"
|
|
#include "main.h"
|
|
#include "masternode.h"
|
|
|
|
#define MASTERNODES_DUMP_SECONDS (15*60)
|
|
#define MASTERNODES_DSEG_SECONDS (3*60*60)
|
|
|
|
using namespace std;
|
|
|
|
class CMasternodeMan;
|
|
|
|
// Keep track of all broadcasts I've seen
|
|
extern map<uint256, CMasternodeBroadcast> mapSeenMasternodeBroadcast;
|
|
|
|
// Keep track of all pings I've seen
|
|
extern map<uint256, CMasternodePing> mapSeenMasternodePing;
|
|
|
|
extern CMasternodeMan mnodeman;
|
|
void DumpMasternodes();
|
|
|
|
/** Access to the MN database (mncache.dat)
|
|
*/
|
|
class CMasternodeDB
|
|
{
|
|
private:
|
|
boost::filesystem::path pathMN;
|
|
std::string strMagicMessage;
|
|
public:
|
|
enum ReadResult {
|
|
Ok,
|
|
FileError,
|
|
HashReadError,
|
|
IncorrectHash,
|
|
IncorrectMagicMessage,
|
|
IncorrectMagicNumber,
|
|
IncorrectFormat
|
|
};
|
|
|
|
CMasternodeDB();
|
|
bool Write(const CMasternodeMan &mnodemanToSave);
|
|
ReadResult Read(CMasternodeMan& mnodemanToLoad);
|
|
};
|
|
|
|
class CMasternodeMan
|
|
{
|
|
private:
|
|
// critical section to protect the inner data structures
|
|
mutable CCriticalSection cs;
|
|
|
|
// map to hold all MNs
|
|
std::vector<CMasternode> vMasternodes;
|
|
// who's asked for the Masternode list and the last time
|
|
std::map<CNetAddr, int64_t> mAskedUsForMasternodeList;
|
|
// who we asked for the Masternode list and the last time
|
|
std::map<CNetAddr, int64_t> mWeAskedForMasternodeList;
|
|
// which Masternodes we've asked for
|
|
std::map<COutPoint, int64_t> mWeAskedForMasternodeListEntry;
|
|
|
|
public:
|
|
// keep track of dsq count to prevent masternodes from gaming darksend queue
|
|
int64_t nDsqCount;
|
|
|
|
ADD_SERIALIZE_METHODS;
|
|
|
|
template <typename Stream, typename Operation>
|
|
inline void SerializationOp(Stream& s, Operation ser_action, int nType, int nVersion) {
|
|
LOCK(cs);
|
|
READWRITE(vMasternodes);
|
|
READWRITE(mAskedUsForMasternodeList);
|
|
READWRITE(mWeAskedForMasternodeList);
|
|
READWRITE(mWeAskedForMasternodeListEntry);
|
|
READWRITE(nDsqCount);
|
|
}
|
|
|
|
CMasternodeMan();
|
|
CMasternodeMan(CMasternodeMan& other);
|
|
|
|
/// Add an entry
|
|
bool Add(CMasternode &mn);
|
|
|
|
/// Check all Masternodes
|
|
void Check();
|
|
|
|
/// Check all Masternodes and remove inactive
|
|
void CheckAndRemove();
|
|
|
|
/// Clear Masternode vector
|
|
void Clear();
|
|
|
|
int CountEnabled();
|
|
|
|
int CountMasternodesAboveProtocol(int protocolVersion);
|
|
|
|
void DsegUpdate(CNode* pnode);
|
|
|
|
/// Find an entry
|
|
CMasternode* Find(const CTxIn& vin);
|
|
CMasternode* Find(const CPubKey& pubKeyMasternode);
|
|
|
|
/// Find an entry thta do not match every entry provided vector
|
|
CMasternode* FindOldestNotInVec(const std::vector<CTxIn> &vVins, int nMinimumAge);
|
|
|
|
/// Find a random entry
|
|
CMasternode* FindRandom();
|
|
|
|
/// Decrement all masternode nVotedTimes, called 1/6 blocks (allowing for 100 votes each day)
|
|
void DecrementVotedTimes();
|
|
|
|
/// Get the current winner for this block
|
|
CMasternode* GetCurrentMasterNode(int mod=1, int64_t nBlockHeight=0, int minProtocol=0);
|
|
|
|
std::vector<CMasternode> GetFullMasternodeVector() { Check(); return vMasternodes; }
|
|
|
|
std::vector<pair<int, CMasternode> > GetMasternodeRanks(int64_t nBlockHeight, int minProtocol=0);
|
|
int GetMasternodeRank(const CTxIn &vin, int64_t nBlockHeight, int minProtocol=0, bool fOnlyActive=true);
|
|
CMasternode* GetMasternodeByRank(int nRank, int64_t nBlockHeight, int minProtocol=0, bool fOnlyActive=true);
|
|
|
|
void ProcessMasternodeConnections();
|
|
|
|
void ProcessMessage(CNode* pfrom, std::string& strCommand, CDataStream& vRecv);
|
|
|
|
/// Return the number of (unique) Masternodes
|
|
int size() { return vMasternodes.size(); }
|
|
|
|
std::string ToString() const;
|
|
|
|
void Remove(CTxIn vin);
|
|
|
|
};
|
|
|
|
#endif
|