// 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. #include "masternodeman.h" #include "masternode.h" #include "activemasternode.h" #include "darksend.h" #include "util.h" #include "addrman.h" #include "spork.h" #include #include /** Masternode manager */ CMasternodeMan mnodeman; struct CompareLastPaid { bool operator()(const pair& t1, const pair& t2) const { return t1.first < t2.first; } }; struct CompareScoreTxIn { bool operator()(const pair& t1, const pair& t2) const { return t1.first < t2.first; } }; struct CompareScoreMN { bool operator()(const pair& t1, const pair& t2) const { return t1.first < t2.first; } }; // // CMasternodeDB // CMasternodeDB::CMasternodeDB() { pathMN = GetDataDir() / "mncache.dat"; strMagicMessage = "MasternodeCache"; } bool CMasternodeDB::Write(const CMasternodeMan& mnodemanToSave) { int64_t nStart = GetTimeMillis(); // serialize, checksum data up to that point, then append checksum CDataStream ssMasternodes(SER_DISK, CLIENT_VERSION); ssMasternodes << strMagicMessage; // masternode cache file specific magic message ssMasternodes << FLATDATA(Params().MessageStart()); // network specific magic number ssMasternodes << mnodemanToSave; uint256 hash = Hash(ssMasternodes.begin(), ssMasternodes.end()); ssMasternodes << hash; // open output file, and associate with CAutoFile FILE *file = fopen(pathMN.string().c_str(), "wb"); CAutoFile fileout(file, SER_DISK, CLIENT_VERSION); if (fileout.IsNull()) return error("%s : Failed to open file %s", __func__, pathMN.string()); // Write and commit header, data try { fileout << ssMasternodes; } catch (std::exception &e) { return error("%s : Serialize or I/O error - %s", __func__, e.what()); } // FileCommit(fileout); fileout.fclose(); LogPrintf("Written info to mncache.dat %dms\n", GetTimeMillis() - nStart); LogPrintf(" %s\n", mnodemanToSave.ToString()); return true; } CMasternodeDB::ReadResult CMasternodeDB::Read(CMasternodeMan& mnodemanToLoad, bool fDryRun) { int64_t nStart = GetTimeMillis(); // open input file, and associate with CAutoFile FILE *file = fopen(pathMN.string().c_str(), "rb"); CAutoFile filein(file, SER_DISK, CLIENT_VERSION); if (filein.IsNull()) { error("%s : Failed to open file %s", __func__, pathMN.string()); return FileError; } // use file size to size memory buffer int fileSize = boost::filesystem::file_size(pathMN); int dataSize = fileSize - sizeof(uint256); // Don't try to resize to a negative number if file is small if (dataSize < 0) dataSize = 0; vector vchData; vchData.resize(dataSize); uint256 hashIn; // read data and checksum from file try { filein.read((char *)&vchData[0], dataSize); filein >> hashIn; } catch (std::exception &e) { error("%s : Deserialize or I/O error - %s", __func__, e.what()); return HashReadError; } filein.fclose(); CDataStream ssMasternodes(vchData, SER_DISK, CLIENT_VERSION); // verify stored checksum matches input data uint256 hashTmp = Hash(ssMasternodes.begin(), ssMasternodes.end()); if (hashIn != hashTmp) { error("%s : Checksum mismatch, data corrupted", __func__); return IncorrectHash; } unsigned char pchMsgTmp[4]; std::string strMagicMessageTmp; try { // de-serialize file header (masternode cache file specific magic message) and .. ssMasternodes >> strMagicMessageTmp; // ... verify the message matches predefined one if (strMagicMessage != strMagicMessageTmp) { error("%s : Invalid masternode cache magic message", __func__); return IncorrectMagicMessage; } // de-serialize file header (network specific magic number) and .. ssMasternodes >> FLATDATA(pchMsgTmp); // ... verify the network matches ours if (memcmp(pchMsgTmp, Params().MessageStart(), sizeof(pchMsgTmp))) { error("%s : Invalid network magic number", __func__); return IncorrectMagicNumber; } // de-serialize data into CMasternodeMan object ssMasternodes >> mnodemanToLoad; } catch (std::exception &e) { mnodemanToLoad.Clear(); error("%s : Deserialize or I/O error - %s", __func__, e.what()); return IncorrectFormat; } LogPrintf("Loaded info from mncache.dat %dms\n", GetTimeMillis() - nStart); LogPrintf(" %s\n", mnodemanToLoad.ToString()); if(!fDryRun) { LogPrintf("Masternode manager - cleaning....\n"); mnodemanToLoad.CheckAndRemove(true); LogPrintf("Masternode manager - result:\n"); LogPrintf(" %s\n", mnodemanToLoad.ToString()); } return Ok; } void DumpMasternodes() { int64_t nStart = GetTimeMillis(); CMasternodeDB mndb; CMasternodeMan tempMnodeman; LogPrintf("Verifying mncache.dat format...\n"); CMasternodeDB::ReadResult readResult = mndb.Read(tempMnodeman, true); // there was an error and it was not an error on file opening => do not proceed if (readResult == CMasternodeDB::FileError) LogPrintf("Missing masternode cache file - mncache.dat, will try to recreate\n"); else if (readResult != CMasternodeDB::Ok) { LogPrintf("Error reading mncache.dat: "); if(readResult == CMasternodeDB::IncorrectFormat) LogPrintf("magic is ok but data has invalid format, will try to recreate\n"); else { LogPrintf("file format is unknown or invalid, please fix it manually\n"); return; } } LogPrintf("Writting info to mncache.dat...\n"); mndb.Write(mnodeman); LogPrintf("Masternode dump finished %dms\n", GetTimeMillis() - nStart); } CMasternodeMan::CMasternodeMan() { nDsqCount = 0; } bool CMasternodeMan::Add(CMasternode &mn) { LOCK(cs); if (!mn.IsEnabled()) return false; CMasternode *pmn = Find(mn.vin); if (pmn == NULL) { LogPrint("masnernode", "CMasternodeMan: Adding new Masternode %s - %i now\n", mn.addr.ToString(), size() + 1); vMasternodes.push_back(mn); return true; } return false; } void CMasternodeMan::Check() { LOCK(cs); BOOST_FOREACH(CMasternode& mn, vMasternodes) { mn.Check(); } } void CMasternodeMan::CheckAndRemove(bool forceExpiredRemoval) { Check(); LOCK(cs); //remove inactive and outdated vector::iterator it = vMasternodes.begin(); while(it != vMasternodes.end()){ if((*it).activeState == CMasternode::MASTERNODE_REMOVE || (*it).activeState == CMasternode::MASTERNODE_VIN_SPENT || (forceExpiredRemoval && (*it).activeState == CMasternode::MASTERNODE_EXPIRED) || (*it).protocolVersion < masternodePayments.GetMinMasternodePaymentsProto()) { LogPrint("masnernode", "CMasternodeMan: Removing inactive Masternode %s - %i now\n", (*it).addr.ToString(), size() - 1); //erase all of the broadcasts we've seen from this vin // -- if we missed a few pings and the node was removed, this will allow is to get it back without them // sending a brand new mnb map::iterator it3 = mapSeenMasternodeBroadcast.begin(); while(it3 != mapSeenMasternodeBroadcast.end()){ if((*it3).second.vin == (*it).vin){ masternodeSync.mapSeenSyncMNB.erase((*it3).first); mapSeenMasternodeBroadcast.erase(it3++); } else { ++it3; } } // allow us to ask for this masternode again if we see another ping map::iterator it2 = mWeAskedForMasternodeListEntry.begin(); while(it2 != mWeAskedForMasternodeListEntry.end()){ if((*it2).first == (*it).vin.prevout){ mWeAskedForMasternodeListEntry.erase(it2++); } else { ++it2; } } it = vMasternodes.erase(it); } else { ++it; } } // check who's asked for the Masternode list map::iterator it1 = mAskedUsForMasternodeList.begin(); while(it1 != mAskedUsForMasternodeList.end()){ if((*it1).second < GetTime()) { mAskedUsForMasternodeList.erase(it1++); } else { ++it1; } } // check who we asked for the Masternode list it1 = mWeAskedForMasternodeList.begin(); while(it1 != mWeAskedForMasternodeList.end()){ if((*it1).second < GetTime()){ mWeAskedForMasternodeList.erase(it1++); } else { ++it1; } } // check which Masternodes we've asked for map::iterator it2 = mWeAskedForMasternodeListEntry.begin(); while(it2 != mWeAskedForMasternodeListEntry.end()){ if((*it2).second < GetTime()){ mWeAskedForMasternodeListEntry.erase(it2++); } else { ++it2; } } } void CMasternodeMan::Clear() { LOCK(cs); vMasternodes.clear(); mAskedUsForMasternodeList.clear(); mWeAskedForMasternodeList.clear(); mWeAskedForMasternodeListEntry.clear(); nDsqCount = 0; } int CMasternodeMan::CountEnabled(int protocolVersion) { int i = 0; protocolVersion = protocolVersion == -1 ? masternodePayments.GetMinMasternodePaymentsProto() : protocolVersion; BOOST_FOREACH(CMasternode& mn, vMasternodes) { mn.Check(); if(mn.protocolVersion < protocolVersion || !mn.IsEnabled()) continue; i++; } return i; } void CMasternodeMan::DsegUpdate(CNode* pnode) { LOCK(cs); if(Params().NetworkID() == CBaseChainParams::MAIN) { if(!(pnode->addr.IsRFC1918() || pnode->addr.IsLocal())){ std::map::iterator it = mWeAskedForMasternodeList.find(pnode->addr); if (it != mWeAskedForMasternodeList.end()) { if (GetTime() < (*it).second) { LogPrintf("dseg - we already asked %s for the list; skipping...\n", pnode->addr.ToString()); return; } } } } pnode->PushMessage("dseg", CTxIn()); int64_t askAgain = GetTime() + MASTERNODES_DSEG_SECONDS; mWeAskedForMasternodeList[pnode->addr] = askAgain; } CMasternode *CMasternodeMan::Find(const CScript &payee) { LOCK(cs); CScript payee2; BOOST_FOREACH(CMasternode& mn, vMasternodes) { payee2 = GetScriptForDestination(mn.pubkey.GetID()); if(payee2 == payee) return &mn; } return NULL; } CMasternode *CMasternodeMan::Find(const CTxIn &vin) { LOCK(cs); BOOST_FOREACH(CMasternode& mn, vMasternodes) { if(mn.vin.prevout == vin.prevout) return &mn; } return NULL; } CMasternode *CMasternodeMan::Find(const CPubKey &pubKeyMasternode) { LOCK(cs); BOOST_FOREACH(CMasternode& mn, vMasternodes) { if(mn.pubkey2 == pubKeyMasternode) return &mn; } return NULL; } // // Deterministically select the oldest/best masternode to pay on the network // CMasternode* CMasternodeMan::GetNextMasternodeInQueueForPayment(int nBlockHeight, bool fFilterSigTime) { LOCK(cs); CMasternode *pBestMasternode = NULL; std::vector > vecMasternodeLastPaid; /* Make a vector with all of the last paid times */ int nMnCount = CountEnabled(); BOOST_FOREACH(CMasternode &mn, vMasternodes) { mn.Check(); if(!mn.IsEnabled()) continue; // //check protocol version if(mn.protocolVersion < masternodePayments.GetMinMasternodePaymentsProto()) continue; //it's in the list (up to 8 entries ahead of current block to allow propagation) -- so let's skip it if(masternodePayments.IsScheduled(mn, nBlockHeight)) continue; //it's too new, wait for a cycle if(fFilterSigTime && mn.sigTime + (nMnCount*2.6*60) > GetAdjustedTime()) continue; //make sure it has as many confirmations as there are masternodes if(mn.GetMasternodeInputAge() < nMnCount) continue; vecMasternodeLastPaid.push_back(make_pair(mn.SecondsSincePayment(), mn.vin)); } // Sort them low to high sort(vecMasternodeLastPaid.rbegin(), vecMasternodeLastPaid.rend(), CompareLastPaid()); // Look at 1/10 of the oldest nodes (by last payment), calculate their scores and pay the best one // -- This doesn't look at who is being paid in the +8-10 blocks, allowing for double payments very rarely // -- 1/100 payments should be a double payment on mainnet - (1/(3000/10))*2 // -- (chance per block * chances before IsScheduled will fire) int nTenthNetwork = mnodeman.CountEnabled()/10; int nCount = 0; uint256 nHigh = 0; BOOST_FOREACH (PAIRTYPE(int64_t, CTxIn)& s, vecMasternodeLastPaid){ CMasternode* pmn = mnodeman.Find(s.second); if(!pmn) break; uint256 n = pmn->CalculateScore(1, nBlockHeight-100); if(n > nHigh){ nHigh = n; pBestMasternode = pmn; } nCount++; if(nCount >= nTenthNetwork) break; } return pBestMasternode; } CMasternode *CMasternodeMan::FindRandomNotInVec(std::vector &vecToExclude, int protocolVersion) { LOCK(cs); protocolVersion = protocolVersion == -1 ? masternodePayments.GetMinMasternodePaymentsProto() : protocolVersion; int nCountEnabled = CountEnabled(protocolVersion); LogPrintf("CMasternodeMan::FindRandomNotInVec - nCountEnabled - vecToExclude.size() %d\n", nCountEnabled - vecToExclude.size()); if(nCountEnabled - vecToExclude.size() < 1) return NULL; int rand = GetRandInt(nCountEnabled - vecToExclude.size()); LogPrintf("CMasternodeMan::FindRandomNotInVec - rand %d\n", rand); bool found; BOOST_FOREACH(CMasternode &mn, vMasternodes) { if(mn.protocolVersion < protocolVersion || !mn.IsEnabled()) continue; found = false; BOOST_FOREACH(CTxIn &usedVin, vecToExclude) { if(mn.vin.prevout == usedVin.prevout) { found = true; break; } } if(found) continue; if(--rand < 1) { return &mn; } } return NULL; } CMasternode* CMasternodeMan::GetCurrentMasterNode(int mod, int64_t nBlockHeight, int minProtocol) { int64_t score = 0; CMasternode* winner = NULL; // scan for winner BOOST_FOREACH(CMasternode& mn, vMasternodes) { mn.Check(); if(mn.protocolVersion < minProtocol || !mn.IsEnabled()) continue; // calculate the score for each Masternode uint256 n = mn.CalculateScore(mod, nBlockHeight); int64_t n2 = n.GetCompact(false); // determine the winner if(n2 > score){ score = n2; winner = &mn; } } return winner; } int CMasternodeMan::GetMasternodeRank(const CTxIn& vin, int64_t nBlockHeight, int minProtocol, bool fOnlyActive) { std::vector > vecMasternodeScores; //make sure we know about this block uint256 hash = 0; if(!GetBlockHash(hash, nBlockHeight)) return -1; // scan for winner BOOST_FOREACH(CMasternode& mn, vMasternodes) { if(mn.protocolVersion < minProtocol) continue; if(fOnlyActive) { mn.Check(); if(!mn.IsEnabled()) continue; } uint256 n = mn.CalculateScore(1, nBlockHeight); int64_t n2 = n.GetCompact(false); vecMasternodeScores.push_back(make_pair(n2, mn.vin)); } sort(vecMasternodeScores.rbegin(), vecMasternodeScores.rend(), CompareScoreTxIn()); int rank = 0; BOOST_FOREACH (PAIRTYPE(int64_t, CTxIn)& s, vecMasternodeScores){ rank++; if(s.second.prevout == vin.prevout) { return rank; } } return -1; } std::vector > CMasternodeMan::GetMasternodeRanks(int64_t nBlockHeight, int minProtocol) { std::vector > vecMasternodeScores; std::vector > vecMasternodeRanks; //make sure we know about this block uint256 hash = 0; if(!GetBlockHash(hash, nBlockHeight)) return vecMasternodeRanks; // scan for winner BOOST_FOREACH(CMasternode& mn, vMasternodes) { mn.Check(); if(mn.protocolVersion < minProtocol) continue; if(!mn.IsEnabled()) { continue; } uint256 n = mn.CalculateScore(1, nBlockHeight); int64_t n2 = n.GetCompact(false); vecMasternodeScores.push_back(make_pair(n2, mn)); } sort(vecMasternodeScores.rbegin(), vecMasternodeScores.rend(), CompareScoreMN()); int rank = 0; BOOST_FOREACH (PAIRTYPE(int64_t, CMasternode)& s, vecMasternodeScores){ rank++; vecMasternodeRanks.push_back(make_pair(rank, s.second)); } return vecMasternodeRanks; } CMasternode* CMasternodeMan::GetMasternodeByRank(int nRank, int64_t nBlockHeight, int minProtocol, bool fOnlyActive) { std::vector > vecMasternodeScores; // scan for winner BOOST_FOREACH(CMasternode& mn, vMasternodes) { if(mn.protocolVersion < minProtocol) continue; if(fOnlyActive) { mn.Check(); if(!mn.IsEnabled()) continue; } uint256 n = mn.CalculateScore(1, nBlockHeight); int64_t n2 = n.GetCompact(false); vecMasternodeScores.push_back(make_pair(n2, mn.vin)); } sort(vecMasternodeScores.rbegin(), vecMasternodeScores.rend(), CompareScoreTxIn()); int rank = 0; BOOST_FOREACH (PAIRTYPE(int64_t, CTxIn)& s, vecMasternodeScores){ rank++; if(rank == nRank) { return Find(s.second); } } return NULL; } void CMasternodeMan::ProcessMasternodeConnections() { //we don't care about this for regtest if(Params().NetworkID() == CBaseChainParams::REGTEST) return; if(!darkSendPool.pSubmittedToMasternode) return; CNode* pnode = FindNode(darkSendPool.pSubmittedToMasternode->addr); if(pnode != NULL) { if(pnode->fDarkSendMaster){ LogPrintf("Closing Masternode connection %s \n", pnode->addr.ToString()); pnode->fDisconnect = true; } } } void CMasternodeMan::ProcessMessage(CNode* pfrom, std::string& strCommand, CDataStream& vRecv) { if(fLiteMode) return; //disable all Darksend/Masternode related functionality if(IsInitialBlockDownload()) return; LOCK(cs_process_message); if (strCommand == "mnb") { //Masternode Broadcast CMasternodeBroadcast mnb; vRecv >> mnb; if(mnodeman.mapSeenMasternodeBroadcast.count(mnb.GetHash())) { //seen masternodeSync.AddedMasternodeList(mnb.GetHash()); return; } mnodeman.mapSeenMasternodeBroadcast.insert(make_pair(mnb.GetHash(), mnb)); int nDoS = 0; if(!mnb.CheckAndUpdate(nDoS)){ if(nDoS > 0) Misbehaving(pfrom->GetId(), nDoS); //failed return; } // make sure the vout that was signed is related to the transaction that spawned the Masternode // - this is expensive, so it's only done once per Masternode if(!darkSendSigner.IsVinAssociatedWithPubkey(mnb.vin, mnb.pubkey)) { LogPrintf("mnb - Got mismatched pubkey and vin\n"); Misbehaving(pfrom->GetId(), 33); return; } // make sure it's still unspent // - this is checked later by .check() in many places and by ThreadCheckDarkSendPool() if(mnb.CheckInputsAndAdd(nDoS)) { // use this as a peer addrman.Add(CAddress(mnb.addr), pfrom->addr, 2*60*60); masternodeSync.AddedMasternodeList(mnb.GetHash()); } else { LogPrintf("mnb - Rejected Masternode entry %s\n", mnb.addr.ToString()); if (nDoS > 0) Misbehaving(pfrom->GetId(), nDoS); } } else if (strCommand == "mnp") { //Masternode Ping CMasternodePing mnp; vRecv >> mnp; LogPrint("masnernode", "mnp - Masternode ping, vin: %s\n", mnp.vin.ToString()); if(mnodeman.mapSeenMasternodePing.count(mnp.GetHash())) return; //seen mnodeman.mapSeenMasternodePing.insert(make_pair(mnp.GetHash(), mnp)); int nDoS = 0; if(mnp.CheckAndUpdate(nDoS)) return; if(nDoS > 0) { // if anything significant failed, mark that node and return Misbehaving(pfrom->GetId(), nDoS); return; } //search existing Masternode list, if it's known -- don't ask for the mnb CMasternode* pmn = mnodeman.Find(mnp.vin); if(pmn != NULL) return; // we wasn't able to accept mnp but nothing significant happened, // we might just have to ask for a masternode entry once std::map::iterator i = mWeAskedForMasternodeListEntry.find(mnp.vin.prevout); if (i != mWeAskedForMasternodeListEntry.end()) { int64_t t = (*i).second; if (GetTime() < t) return; // we've asked recently } // ask for the mnb info once from the node that sent mnp LogPrintf("mnp - Asking source node for missing entry, vin: %s\n", mnp.vin.ToString()); pfrom->PushMessage("dseg", mnp.vin); int64_t askAgain = GetTime() + MASTERNODE_MIN_MNP_SECONDS; mWeAskedForMasternodeListEntry[mnp.vin.prevout] = askAgain; } else if (strCommand == "dseg") { //Get Masternode list or specific entry CTxIn vin; vRecv >> vin; if(vin == CTxIn()) { //only should ask for this once //local network bool isLocal = (pfrom->addr.IsRFC1918() || pfrom->addr.IsLocal()); if(!isLocal && Params().NetworkID() == CBaseChainParams::MAIN) { std::map::iterator i = mAskedUsForMasternodeList.find(pfrom->addr); if (i != mAskedUsForMasternodeList.end()){ int64_t t = (*i).second; if (GetTime() < t) { Misbehaving(pfrom->GetId(), 34); LogPrintf("dseg - peer already asked me for the list\n"); return; } } int64_t askAgain = GetTime() + MASTERNODES_DSEG_SECONDS; mAskedUsForMasternodeList[pfrom->addr] = askAgain; } } //else, asking for a specific node which is ok std::vector vInv; int i = 0; BOOST_FOREACH(CMasternode& mn, vMasternodes) { if(mn.addr.IsRFC1918()) continue; //local network if(mn.IsEnabled()) { LogPrint("masnernode", "dseg - Sending Masternode entry - %s \n", mn.addr.ToString()); if(vin == CTxIn() || vin == mn.vin){ CInv inv(MSG_MASTERNODE_ANNOUNCE, CMasternodeBroadcast(mn).GetHash()); vInv.push_back(inv); if(vin == mn.vin) { LogPrintf("dseg - Sent 1 Masternode entries to %s\n", pfrom->addr.ToString()); break; } } i++; } } if(vin == CTxIn()) pfrom->PushMessage("ssc", MASTERNODE_SYNC_LIST, (int)vInv.size()); if(vInv.size() > 0) pfrom->PushMessage("inv", vInv); LogPrintf("dseg - Sent %d Masternode entries to %s\n", i, pfrom->addr.ToString()); } } void CMasternodeMan::Remove(CTxIn vin) { LOCK(cs); vector::iterator it = vMasternodes.begin(); while(it != vMasternodes.end()){ if((*it).vin == vin){ LogPrint("masnernode", "CMasternodeMan: Removing Masternode %s - %i now\n", (*it).addr.ToString(), size() - 1); vMasternodes.erase(it); break; } ++it; } } std::string CMasternodeMan::ToString() const { std::ostringstream info; info << "Masternodes: " << (int)vMasternodes.size() << ", peers who asked us for Masternode list: " << (int)mAskedUsForMasternodeList.size() << ", peers we asked for Masternode list: " << (int)mWeAskedForMasternodeList.size() << ", entries in Masternode list we asked for: " << (int)mWeAskedForMasternodeListEntry.size() << ", nDsqCount: " << (int)nDsqCount; return info.str(); }