1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Copyright (c) 2011 The PPCoin developers
4 // Distributed under the MIT/X11 software license, see the accompanying
5 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 CCriticalSection cs_setpwalletRegistered;
22 set<CWallet*> setpwalletRegistered;
24 CCriticalSection cs_main;
26 static map<uint256, CTransaction> mapTransactions;
27 CCriticalSection cs_mapTransactions;
28 unsigned int nTransactionsUpdated = 0;
29 map<COutPoint, CInPoint> mapNextTx;
31 map<uint256, CBlockIndex*> mapBlockIndex;
32 uint256 hashGenesisBlock("0x00000000b00cf820bc2b23ec0aad05da6c58af7fd71c34a6f21a747fd0f5620b");
33 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 CBlockIndex* pindexGenesisBlock = NULL;
37 uint64 nBestChainTrust = 0;
38 uint64 nBestInvalidTrust = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
43 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
45 map<uint256, CBlock*> mapOrphanBlocks;
46 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
48 map<uint256, CDataStream*> mapOrphanTransactions;
49 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
56 int fGenerateBitcoins = false;
57 int64 nTransactionFee = MIN_TX_FEE;
58 int fLimitProcessors = false;
59 int nLimitProcessors = 1;
60 int fMinimizeToTray = true;
61 int fMinimizeOnClose = true;
69 //////////////////////////////////////////////////////////////////////////////
71 // dispatching functions
74 // These functions dispatch to one or all registered wallets
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 // check whether the passed transaction is from us
94 bool static IsFromMe(CTransaction& tx)
96 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
97 if (pwallet->IsFromMe(tx))
102 // get the wallet transaction with the given hash (if it exists)
103 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
105 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
106 if (pwallet->GetTransaction(hashTx,wtx))
111 // erases transaction with the given hash from all wallets
112 void static EraseFromWallets(uint256 hash)
114 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
115 pwallet->EraseFromWallet(hash);
118 // make sure all wallets know about the given transaction, in the given block
119 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
121 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
122 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
125 // notify wallets about a new best chain
126 void static SetBestChain(const CBlockLocator& loc)
128 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
129 pwallet->SetBestChain(loc);
132 // notify wallets about an updated transaction
133 void static UpdatedTransaction(const uint256& hashTx)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->UpdatedTransaction(hashTx);
140 void static PrintWallets(const CBlock& block)
142 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
143 pwallet->PrintWallet(block);
146 // notify wallets about an incoming inventory (for request counts)
147 void static Inventory(const uint256& hash)
149 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
150 pwallet->Inventory(hash);
153 // ask wallets to resend their transactions
154 void static ResendWalletTransactions()
156 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
157 pwallet->ResendWalletTransactions();
166 //////////////////////////////////////////////////////////////////////////////
168 // mapOrphanTransactions
171 void static AddOrphanTx(const CDataStream& vMsg)
174 CDataStream(vMsg) >> tx;
175 uint256 hash = tx.GetHash();
176 if (mapOrphanTransactions.count(hash))
178 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
179 BOOST_FOREACH(const CTxIn& txin, tx.vin)
180 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
183 void static EraseOrphanTx(uint256 hash)
185 if (!mapOrphanTransactions.count(hash))
187 const CDataStream* pvMsg = mapOrphanTransactions[hash];
189 CDataStream(*pvMsg) >> tx;
190 BOOST_FOREACH(const CTxIn& txin, tx.vin)
192 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
193 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
195 if ((*mi).second == pvMsg)
196 mapOrphanTransactionsByPrev.erase(mi++);
202 mapOrphanTransactions.erase(hash);
212 //////////////////////////////////////////////////////////////////////////////
214 // CTransaction and CTxIndex
217 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
220 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
222 if (!ReadFromDisk(txindexRet.pos))
224 if (prevout.n >= vout.size())
232 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
235 return ReadFromDisk(txdb, prevout, txindex);
238 bool CTransaction::ReadFromDisk(COutPoint prevout)
242 return ReadFromDisk(txdb, prevout, txindex);
247 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
259 // Load the block this tx is in
261 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
263 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
268 // Update the tx's hashBlock
269 hashBlock = pblock->GetHash();
271 // Locate the transaction
272 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
273 if (pblock->vtx[nIndex] == *(CTransaction*)this)
275 if (nIndex == pblock->vtx.size())
277 vMerkleBranch.clear();
279 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
283 // Fill in merkle branch
284 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
287 // Is the tx in a block that's in the main chain
288 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
289 if (mi == mapBlockIndex.end())
291 CBlockIndex* pindex = (*mi).second;
292 if (!pindex || !pindex->IsInMainChain())
295 return pindexBest->nHeight - pindex->nHeight + 1;
304 bool CTransaction::CheckTransaction() const
306 // Basic checks that don't depend on any context
308 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
310 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
312 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
313 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
315 // Check for negative or overflow output values
317 BOOST_FOREACH(const CTxOut& txout, vout)
319 if (txout.nValue < 0)
320 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
321 if (txout.nValue > MAX_MONEY)
322 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
323 nValueOut += txout.nValue;
324 if (!MoneyRange(nValueOut))
325 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
328 // Check for duplicate inputs
329 set<COutPoint> vInOutPoints;
330 BOOST_FOREACH(const CTxIn& txin, vin)
332 if (vInOutPoints.count(txin.prevout))
334 vInOutPoints.insert(txin.prevout);
339 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
340 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
344 BOOST_FOREACH(const CTxIn& txin, vin)
345 if (txin.prevout.IsNull())
346 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
352 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
355 *pfMissingInputs = false;
357 if (!CheckTransaction())
358 return error("AcceptToMemoryPool() : CheckTransaction failed");
360 // Coinbase is only valid in a block, not as a loose transaction
362 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
364 // To help v0.1.5 clients who would see it as a negative number
365 if ((int64)nLockTime > INT_MAX)
366 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
369 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
370 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
371 // attacks disallow transactions with more than one SigOp per 34 bytes.
372 // 34 bytes because a TxOut is:
373 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
374 if (GetSigOpCount() > nSize / 34 || nSize < 100)
375 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
377 // Rather not work on nonstandard transactions (unless -testnet)
378 if (!fTestNet && !IsStandard())
379 return error("AcceptToMemoryPool() : nonstandard transaction type");
381 // Do we already have it?
382 uint256 hash = GetHash();
383 CRITICAL_BLOCK(cs_mapTransactions)
384 if (mapTransactions.count(hash))
387 if (txdb.ContainsTx(hash))
390 // Check for conflicts with in-memory transactions
391 CTransaction* ptxOld = NULL;
392 for (int i = 0; i < vin.size(); i++)
394 COutPoint outpoint = vin[i].prevout;
395 if (mapNextTx.count(outpoint))
397 // Disable replacement feature for now
400 // Allow replacing with a newer version of the same transaction
403 ptxOld = mapNextTx[outpoint].ptx;
404 if (ptxOld->IsFinal())
406 if (!IsNewerThan(*ptxOld))
408 for (int i = 0; i < vin.size(); i++)
410 COutPoint outpoint = vin[i].prevout;
411 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
420 // Check against previous transactions
421 map<uint256, CTxIndex> mapUnused;
423 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
426 *pfMissingInputs = true;
427 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
430 // Don't accept it if it can't get into a block
431 if (nFees < GetMinFee(1000, false, true))
432 return error("AcceptToMemoryPool() : not enough fees");
434 // Continuously rate-limit free transactions
435 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
436 // be annoying or make other's transactions take longer to confirm.
437 if (nFees < MIN_RELAY_TX_FEE)
439 static CCriticalSection cs;
440 static double dFreeCount;
441 static int64 nLastTime;
442 int64 nNow = GetTime();
446 // Use an exponentially decaying ~10-minute window:
447 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
449 // -limitfreerelay unit is thousand-bytes-per-minute
450 // At default rate it would take over a month to fill 1GB
451 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
452 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
454 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
460 // Store transaction in memory
461 CRITICAL_BLOCK(cs_mapTransactions)
465 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
466 ptxOld->RemoveFromMemoryPool();
468 AddToMemoryPoolUnchecked();
471 ///// are we sure this is ok when loading transactions or restoring block txes
472 // If updated, erase old tx from wallet
474 EraseFromWallets(ptxOld->GetHash());
476 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
480 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
483 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
486 bool CTransaction::AddToMemoryPoolUnchecked()
488 // Add to memory pool without checking anything. Don't call this directly,
489 // call AcceptToMemoryPool to properly check the transaction first.
490 CRITICAL_BLOCK(cs_mapTransactions)
492 uint256 hash = GetHash();
493 mapTransactions[hash] = *this;
494 for (int i = 0; i < vin.size(); i++)
495 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
496 nTransactionsUpdated++;
502 bool CTransaction::RemoveFromMemoryPool()
504 // Remove transaction from memory pool
505 CRITICAL_BLOCK(cs_mapTransactions)
507 BOOST_FOREACH(const CTxIn& txin, vin)
508 mapNextTx.erase(txin.prevout);
509 mapTransactions.erase(GetHash());
510 nTransactionsUpdated++;
520 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
522 if (hashBlock == 0 || nIndex == -1)
525 // Find the block it claims to be in
526 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
527 if (mi == mapBlockIndex.end())
529 CBlockIndex* pindex = (*mi).second;
530 if (!pindex || !pindex->IsInMainChain())
533 // Make sure the merkle branch connects to this block
534 if (!fMerkleVerified)
536 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
538 fMerkleVerified = true;
541 nHeightRet = pindex->nHeight;
542 return pindexBest->nHeight - pindex->nHeight + 1;
546 int CMerkleTx::GetBlocksToMaturity() const
550 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
554 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
558 if (!IsInMainChain() && !ClientConnectInputs())
560 return CTransaction::AcceptToMemoryPool(txdb, false);
564 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
568 bool CMerkleTx::AcceptToMemoryPool()
571 return AcceptToMemoryPool(txdb);
576 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
578 CRITICAL_BLOCK(cs_mapTransactions)
580 // Add previous supporting transactions first
581 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
583 if (!tx.IsCoinBase())
585 uint256 hash = tx.GetHash();
586 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
587 tx.AcceptToMemoryPool(txdb, fCheckInputs);
590 return AcceptToMemoryPool(txdb, fCheckInputs);
595 bool CWalletTx::AcceptWalletTransaction()
598 return AcceptWalletTransaction(txdb);
601 int CTxIndex::GetDepthInMainChain() const
605 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
607 // Find the block in the index
608 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
609 if (mi == mapBlockIndex.end())
611 CBlockIndex* pindex = (*mi).second;
612 if (!pindex || !pindex->IsInMainChain())
614 return 1 + nBestHeight - pindex->nHeight;
626 //////////////////////////////////////////////////////////////////////////////
628 // CBlock and CBlockIndex
631 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
633 if (!fReadTransactions)
635 *this = pindex->GetBlockHeader();
638 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
640 if (GetHash() != pindex->GetBlockHash())
641 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
645 uint256 static GetOrphanRoot(const CBlock* pblock)
647 // Work back to the first block in the orphan chain
648 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
649 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
650 return pblock->GetHash();
653 int64 static GetBlockValue(int nHeight, int64 nFees)
655 int64 nSubsidy = 50 * COIN;
657 // Subsidy is cut in half every 4 years
658 nSubsidy >>= (nHeight / 210000);
660 return nSubsidy + nFees;
663 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
664 static const int64 nTargetSpacing = 10 * 60;
665 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
668 // minimum amount of work that could possibly be required nTime after
669 // minimum work required was nBase
671 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
674 bnResult.SetCompact(nBase);
675 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
677 // Maximum 400% adjustment...
679 // ... in best-case exactly 4-times-normal target time
680 nTime -= nTargetTimespan*4;
682 if (bnResult > bnProofOfWorkLimit)
683 bnResult = bnProofOfWorkLimit;
684 return bnResult.GetCompact();
687 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
689 // Genesis block and first block
690 if (pindexLast == NULL || pindexLast->pprev == NULL)
691 return bnProofOfWorkLimit.GetCompact();
693 int64 nActualSpacing = pindexLast->GetBlockTime() - pindexLast->pprev->GetBlockTime();
695 // ppcoin: target change every block
696 // ppcoin: retarget with exponential moving toward target spacing
698 bnNew.SetCompact(pindexLast->nBits);
699 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
700 bnNew /= ((nInterval + 1) * nTargetSpacing);
702 if (bnNew > bnProofOfWorkLimit)
703 bnNew = bnProofOfWorkLimit;
705 return bnNew.GetCompact();
708 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
711 bnTarget.SetCompact(nBits);
714 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
715 return error("CheckProofOfWork() : nBits below minimum work");
717 // Check proof of work matches claimed amount
718 if (hash > bnTarget.getuint256())
719 return error("CheckProofOfWork() : hash doesn't match nBits");
724 // Return maximum amount of blocks that other nodes claim to have
725 int GetNumBlocksOfPeers()
727 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
730 bool IsInitialBlockDownload()
732 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
734 static int64 nLastUpdate;
735 static CBlockIndex* pindexLastBest;
736 if (pindexBest != pindexLastBest)
738 pindexLastBest = pindexBest;
739 nLastUpdate = GetTime();
741 return (GetTime() - nLastUpdate < 10 &&
742 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
745 void static InvalidChainFound(CBlockIndex* pindexNew)
747 if (pindexNew->nChainTrust > nBestInvalidTrust)
749 nBestInvalidTrust = pindexNew->nChainTrust;
750 CTxDB().WriteBestInvalidTrust(nBestInvalidTrust);
753 printf("InvalidChainFound: invalid block=%s height=%d trust=%s\n", pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight, CBigNum(pindexNew->nChainTrust).ToString().c_str());
754 printf("InvalidChainFound: current best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str());
755 if (pindexBest && nBestInvalidTrust > nBestChainTrust + pindexBest->GetBlockTrust() * 6)
756 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
769 bool CTransaction::DisconnectInputs(CTxDB& txdb)
771 // Relinquish previous transactions' spent pointers
774 BOOST_FOREACH(const CTxIn& txin, vin)
776 COutPoint prevout = txin.prevout;
778 // Get prev txindex from disk
780 if (!txdb.ReadTxIndex(prevout.hash, txindex))
781 return error("DisconnectInputs() : ReadTxIndex failed");
783 if (prevout.n >= txindex.vSpent.size())
784 return error("DisconnectInputs() : prevout.n out of range");
786 // Mark outpoint as not spent
787 txindex.vSpent[prevout.n].SetNull();
790 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
791 return error("DisconnectInputs() : UpdateTxIndex failed");
795 // Remove transaction from index
796 if (!txdb.EraseTxIndex(*this))
797 return error("DisconnectInputs() : EraseTxPos failed");
803 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
804 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
806 // Take over previous transactions' spent pointers
807 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
808 // fMiner is true when called from the internal bitcoin miner
809 // ... both are false when called from CTransaction::AcceptToMemoryPool
813 for (int i = 0; i < vin.size(); i++)
815 COutPoint prevout = vin[i].prevout;
820 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
822 // Get txindex from current proposed changes
823 txindex = mapTestPool[prevout.hash];
827 // Read txindex from txdb
828 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
830 if (!fFound && (fBlock || fMiner))
831 return fMiner ? false : error("ConnectInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
835 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
837 // Get prev tx from single transactions in memory
838 CRITICAL_BLOCK(cs_mapTransactions)
840 if (!mapTransactions.count(prevout.hash))
841 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
842 txPrev = mapTransactions[prevout.hash];
845 txindex.vSpent.resize(txPrev.vout.size());
849 // Get prev tx from disk
850 if (!txPrev.ReadFromDisk(txindex.pos))
851 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
854 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
855 return DoS(100, error("ConnectInputs() : %s prevout.n out of range %d %d %d prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
857 // If prev is coinbase, check that it's matured
858 if (txPrev.IsCoinBase())
859 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
860 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
861 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
863 // ppcoin: check transaction timestamp
864 if (txPrev.nTime > nTime)
865 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
867 // Skip ECDSA signature verification when connecting blocks (fBlock=true) during initial download
868 // (before the last blockchain checkpoint). This is safe because block merkle hashes are
869 // still computed and checked, and any change will be caught at the next checkpoint.
870 if (!(fBlock && IsInitialBlockDownload()))
872 if (!VerifySignature(txPrev, *this, i))
873 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
875 // Check for conflicts (double-spend)
876 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
877 // for an attacker to attempt to split the network.
878 if (!txindex.vSpent[prevout.n].IsNull())
879 return fMiner ? false : error("ConnectInputs() : %s prev tx already used at %s", GetHash().ToString().substr(0,10).c_str(), txindex.vSpent[prevout.n].ToString().c_str());
881 // Check for negative or overflow input values
882 nValueIn += txPrev.vout[prevout.n].nValue;
883 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
884 return DoS(100, error("ConnectInputs() : txin values out of range"));
886 // Mark outpoints as spent
887 txindex.vSpent[prevout.n] = posThisTx;
890 if (fBlock || fMiner)
892 mapTestPool[prevout.hash] = txindex;
896 if (nValueIn < GetValueOut())
897 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
899 // Tally transaction fees
900 int64 nTxFee = nValueIn - GetValueOut();
902 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
903 if (nTxFee < nMinFee)
906 if (!MoneyRange(nFees))
907 return DoS(100, error("ConnectInputs() : nFees out of range"));
912 // Add transaction to changes
913 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
917 // Add transaction to test pool
918 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
925 bool CTransaction::ClientConnectInputs()
930 // Take over previous transactions' spent pointers
931 CRITICAL_BLOCK(cs_mapTransactions)
934 for (int i = 0; i < vin.size(); i++)
936 // Get prev tx from single transactions in memory
937 COutPoint prevout = vin[i].prevout;
938 if (!mapTransactions.count(prevout.hash))
940 CTransaction& txPrev = mapTransactions[prevout.hash];
942 if (prevout.n >= txPrev.vout.size())
946 if (!VerifySignature(txPrev, *this, i))
947 return error("ConnectInputs() : VerifySignature failed");
949 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
950 ///// this has to go away now that posNext is gone
951 // // Check for conflicts
952 // if (!txPrev.vout[prevout.n].posNext.IsNull())
953 // return error("ConnectInputs() : prev tx already used");
955 // // Flag outpoints as used
956 // txPrev.vout[prevout.n].posNext = posThisTx;
958 nValueIn += txPrev.vout[prevout.n].nValue;
960 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
961 return error("ClientConnectInputs() : txin values out of range");
963 if (GetValueOut() > nValueIn)
973 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
975 // Disconnect in reverse order
976 for (int i = vtx.size()-1; i >= 0; i--)
977 if (!vtx[i].DisconnectInputs(txdb))
980 // Update block index on disk without changing it in memory.
981 // The memory index structure will be changed after the db commits.
984 CDiskBlockIndex blockindexPrev(pindex->pprev);
985 blockindexPrev.hashNext = 0;
986 if (!txdb.WriteBlockIndex(blockindexPrev))
987 return error("DisconnectBlock() : WriteBlockIndex failed");
993 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
995 // Check it again in case a previous version let a bad block in
999 //// issue here: it doesn't know the version
1000 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1002 map<uint256, CTxIndex> mapQueuedChanges;
1004 BOOST_FOREACH(CTransaction& tx, vtx)
1006 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1007 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1009 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
1012 // Write queued txindex changes
1013 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1015 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1016 return error("ConnectBlock() : UpdateTxIndex failed");
1019 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1022 // Update block index on disk without changing it in memory.
1023 // The memory index structure will be changed after the db commits.
1026 CDiskBlockIndex blockindexPrev(pindex->pprev);
1027 blockindexPrev.hashNext = pindex->GetBlockHash();
1028 if (!txdb.WriteBlockIndex(blockindexPrev))
1029 return error("ConnectBlock() : WriteBlockIndex failed");
1032 // Watch for transactions paying to me
1033 BOOST_FOREACH(CTransaction& tx, vtx)
1034 SyncWithWallets(tx, this, true);
1039 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1041 printf("REORGANIZE\n");
1044 CBlockIndex* pfork = pindexBest;
1045 CBlockIndex* plonger = pindexNew;
1046 while (pfork != plonger)
1048 while (plonger->nHeight > pfork->nHeight)
1049 if (!(plonger = plonger->pprev))
1050 return error("Reorganize() : plonger->pprev is null");
1051 if (pfork == plonger)
1053 if (!(pfork = pfork->pprev))
1054 return error("Reorganize() : pfork->pprev is null");
1057 // List of what to disconnect
1058 vector<CBlockIndex*> vDisconnect;
1059 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1060 vDisconnect.push_back(pindex);
1062 // List of what to connect
1063 vector<CBlockIndex*> vConnect;
1064 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1065 vConnect.push_back(pindex);
1066 reverse(vConnect.begin(), vConnect.end());
1068 // Disconnect shorter branch
1069 vector<CTransaction> vResurrect;
1070 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1073 if (!block.ReadFromDisk(pindex))
1074 return error("Reorganize() : ReadFromDisk for disconnect failed");
1075 if (!block.DisconnectBlock(txdb, pindex))
1076 return error("Reorganize() : DisconnectBlock failed");
1078 // Queue memory transactions to resurrect
1079 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1080 if (!tx.IsCoinBase())
1081 vResurrect.push_back(tx);
1084 // Connect longer branch
1085 vector<CTransaction> vDelete;
1086 for (int i = 0; i < vConnect.size(); i++)
1088 CBlockIndex* pindex = vConnect[i];
1090 if (!block.ReadFromDisk(pindex))
1091 return error("Reorganize() : ReadFromDisk for connect failed");
1092 if (!block.ConnectBlock(txdb, pindex))
1096 return error("Reorganize() : ConnectBlock failed");
1099 // Queue memory transactions to delete
1100 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1101 vDelete.push_back(tx);
1103 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1104 return error("Reorganize() : WriteHashBestChain failed");
1105 if (!txdb.WriteAutoCheckpoint(pindexNew->nCheckpoint))
1106 return error("Reorganize() : WriteAutoCheckpoint failed");
1108 // Make sure it's successfully written to disk before changing memory structure
1109 if (!txdb.TxnCommit())
1110 return error("Reorganize() : TxnCommit failed");
1112 // Disconnect shorter branch
1113 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1115 pindex->pprev->pnext = NULL;
1117 // Connect longer branch
1118 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1120 pindex->pprev->pnext = pindex;
1122 // Resurrect memory transactions that were in the disconnected branch
1123 BOOST_FOREACH(CTransaction& tx, vResurrect)
1124 tx.AcceptToMemoryPool(txdb, false);
1126 // Delete redundant memory transactions that are in the connected branch
1127 BOOST_FOREACH(CTransaction& tx, vDelete)
1128 tx.RemoveFromMemoryPool();
1134 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1136 uint256 hash = GetHash();
1139 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1141 txdb.WriteHashBestChain(hash);
1142 txdb.WriteAutoCheckpoint(pindexNew->nCheckpoint);
1143 if (!txdb.TxnCommit())
1144 return error("SetBestChain() : TxnCommit failed");
1145 pindexGenesisBlock = pindexNew;
1147 else if (hashPrevBlock == hashBestChain)
1149 // Adding to current best branch
1150 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash) || !txdb.WriteAutoCheckpoint(pindexNew->nCheckpoint))
1153 InvalidChainFound(pindexNew);
1154 return error("SetBestChain() : ConnectBlock failed");
1156 if (!txdb.TxnCommit())
1157 return error("SetBestChain() : TxnCommit failed");
1159 // Add to current best branch
1160 pindexNew->pprev->pnext = pindexNew;
1162 // Delete redundant memory transactions
1163 BOOST_FOREACH(CTransaction& tx, vtx)
1164 tx.RemoveFromMemoryPool();
1169 if (!Reorganize(txdb, pindexNew))
1172 InvalidChainFound(pindexNew);
1173 return error("SetBestChain() : Reorganize failed");
1177 // Update best block in wallet (so we can detect restored wallets)
1178 if (!IsInitialBlockDownload())
1180 const CBlockLocator locator(pindexNew);
1181 ::SetBestChain(locator);
1185 hashBestChain = hash;
1186 pindexBest = pindexNew;
1187 nBestHeight = pindexBest->nHeight;
1188 nBestChainTrust = pindexNew->nChainTrust;
1189 nTimeBestReceived = GetTime();
1190 nTransactionsUpdated++;
1191 Checkpoints::AdvanceAutoCheckpoint(pindexBest->nCheckpoint);
1192 printf("SetBestChain: new best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str());
1198 // ppcoin: total coin age spent in block, in the unit of coin-days.
1199 uint64 CBlock::GetBlockCoinAge()
1201 uint64 nCoinAge = 0;
1203 BOOST_FOREACH(const CTransaction& tx, vtx)
1205 if (tx.IsCoinBase())
1208 BOOST_FOREACH(const CTxIn& txin, tx.vin)
1210 // First try finding the previous transaction in database
1211 CTransaction txPrev;
1212 if (!txPrev.ReadFromDisk(txin.prevout))
1214 // If database lookup fails try memory pool
1215 CRITICAL_BLOCK(cs_mapTransactions)
1217 if (!mapTransactions.count(txin.prevout.hash))
1218 return 0; // Neither found in database nor memory pool
1219 txPrev = mapTransactions[txin.prevout.hash];
1223 if (tx.nTime < txPrev.nTime)
1224 return 0; // Transaction timestamp violation
1226 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
1227 CBigNum bnTxInCoinAge = CBigNum(nValueIn) * (tx.nTime - txPrev.nTime) / COIN / (24 * 60 * 60);
1228 nCoinAge += bnTxInCoinAge.getuint64();
1230 if (fDebug && GetBoolArg("-printcoinage"))
1231 printf("coin age nValueIn=%-12I64d nTimeDiff=%d nCoinAge=%"PRI64d"\n", nValueIn, tx.nTime - txPrev.nTime, nCoinAge);
1242 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1244 // Check for duplicate
1245 uint256 hash = GetHash();
1246 if (mapBlockIndex.count(hash))
1247 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1249 // Construct new block index object
1250 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1252 return error("AddToBlockIndex() : new CBlockIndex failed");
1253 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1255 pindexNew->phashBlock = &((*mi).first);
1256 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1257 if (miPrev != mapBlockIndex.end())
1259 pindexNew->pprev = (*miPrev).second;
1260 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1262 // ppcoin: compute chain checkpoint
1263 pindexNew->nCheckpoint = Checkpoints::GetNextChainCheckpoint(pindexNew->pprev);
1264 assert (pindexNew->nCheckpoint >= pindexNew->pprev->nCheckpoint);
1267 // ppcoin: compute chain trust score
1268 uint64 nCoinAge = GetBlockCoinAge();
1270 return error("AddToBlockIndex() : invalid or orphaned transaction in block");
1271 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + nCoinAge;
1275 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1276 if (!txdb.TxnCommit())
1280 if (pindexNew->nChainTrust > nBestChainTrust)
1281 if (!SetBestChain(txdb, pindexNew))
1286 if (pindexNew == pindexBest)
1288 // Notify UI to display prev block's coinbase if it was ours
1289 static uint256 hashPrevBestCoinBase;
1290 UpdatedTransaction(hashPrevBestCoinBase);
1291 hashPrevBestCoinBase = vtx[0].GetHash();
1301 bool CBlock::CheckBlock() const
1303 // These are checks that are independent of context
1304 // that can be verified before saving an orphan block.
1307 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1308 return DoS(100, error("CheckBlock() : size limits failed"));
1310 // Check proof of work matches claimed amount
1311 if (!CheckProofOfWork(GetHash(), nBits))
1312 return DoS(50, error("CheckBlock() : proof of work failed"));
1315 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1316 return error("CheckBlock() : block timestamp too far in the future");
1318 // First transaction must be coinbase, the rest must not be
1319 if (vtx.empty() || !vtx[0].IsCoinBase())
1320 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1321 for (int i = 1; i < vtx.size(); i++)
1322 if (vtx[i].IsCoinBase())
1323 return DoS(100, error("CheckBlock() : more than one coinbase"));
1325 // Check transactions
1326 BOOST_FOREACH(const CTransaction& tx, vtx)
1328 if (!tx.CheckTransaction())
1329 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1330 // ppcoin: check transaction timestamp
1331 if (GetBlockTime() < (int64)tx.nTime)
1332 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
1335 // Check that it's not full of nonstandard transactions
1336 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1337 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1340 if (hashMerkleRoot != BuildMerkleTree())
1341 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1346 bool CBlock::AcceptBlock()
1348 // Check for duplicate
1349 uint256 hash = GetHash();
1350 if (mapBlockIndex.count(hash))
1351 return error("AcceptBlock() : block already in mapBlockIndex");
1353 // Get prev block index
1354 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1355 if (mi == mapBlockIndex.end())
1356 return DoS(10, error("AcceptBlock() : prev block not found"));
1357 CBlockIndex* pindexPrev = (*mi).second;
1358 int nHeight = pindexPrev->nHeight+1;
1360 // Check proof of work
1361 if (nBits != GetNextWorkRequired(pindexPrev))
1362 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1364 // Check timestamp against prev
1365 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1366 return error("AcceptBlock() : block's timestamp is too early");
1368 // Check that all transactions are finalized
1369 BOOST_FOREACH(const CTransaction& tx, vtx)
1370 if (!tx.IsFinal(nHeight, GetBlockTime()))
1371 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1373 // Check that the block chain matches the known block chain up to a hardened checkpoint
1374 if (!Checkpoints::CheckHardened(nHeight, hash))
1375 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lockin at %d", nHeight));
1377 // ppcoin: check that the block satisfies automatic checkpoint
1378 if (!Checkpoints::CheckAuto(pindexPrev))
1379 return DoS(100, error("AcceptBlock() : rejected by automatic checkpoint at %d", Checkpoints::nAutoCheckpoint));
1381 // Write block to history file
1382 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1383 return error("AcceptBlock() : out of disk space");
1384 unsigned int nFile = -1;
1385 unsigned int nBlockPos = 0;
1386 if (!WriteToDisk(nFile, nBlockPos))
1387 return error("AcceptBlock() : WriteToDisk failed");
1388 if (!AddToBlockIndex(nFile, nBlockPos))
1389 return error("AcceptBlock() : AddToBlockIndex failed");
1391 // Relay inventory, but don't relay old inventory during initial block download
1392 if (hashBestChain == hash)
1393 CRITICAL_BLOCK(cs_vNodes)
1394 BOOST_FOREACH(CNode* pnode, vNodes)
1395 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1396 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1401 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1403 // Check for duplicate
1404 uint256 hash = pblock->GetHash();
1405 if (mapBlockIndex.count(hash))
1406 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1407 if (mapOrphanBlocks.count(hash))
1408 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1410 // Preliminary checks
1411 if (!pblock->CheckBlock())
1412 return error("ProcessBlock() : CheckBlock FAILED");
1414 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1415 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1417 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1418 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1421 pfrom->Misbehaving(100);
1422 return error("ProcessBlock() : block with timestamp before last checkpoint");
1425 bnNewBlock.SetCompact(pblock->nBits);
1427 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1428 if (bnNewBlock > bnRequired)
1430 pfrom->Misbehaving(100);
1431 return error("ProcessBlock() : block with too little proof-of-work");
1436 // If don't already have its previous block, shunt it off to holding area until we get it
1437 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1439 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1440 CBlock* pblock2 = new CBlock(*pblock);
1441 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1442 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1444 // Ask this guy to fill in what we're missing
1446 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1451 if (!pblock->AcceptBlock())
1452 return error("ProcessBlock() : AcceptBlock FAILED");
1454 // Recursively process any orphan blocks that depended on this one
1455 vector<uint256> vWorkQueue;
1456 vWorkQueue.push_back(hash);
1457 for (int i = 0; i < vWorkQueue.size(); i++)
1459 uint256 hashPrev = vWorkQueue[i];
1460 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1461 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1464 CBlock* pblockOrphan = (*mi).second;
1465 if (pblockOrphan->AcceptBlock())
1466 vWorkQueue.push_back(pblockOrphan->GetHash());
1467 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1468 delete pblockOrphan;
1470 mapOrphanBlocksByPrev.erase(hashPrev);
1473 printf("ProcessBlock: ACCEPTED\n");
1484 bool CheckDiskSpace(uint64 nAdditionalBytes)
1486 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1488 // Check for 15MB because database could create another 10MB log file at any time
1489 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1492 string strMessage = _("Warning: Disk space is low ");
1493 strMiscWarning = strMessage;
1494 printf("*** %s\n", strMessage.c_str());
1495 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1496 CreateThread(Shutdown, NULL);
1502 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1506 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1509 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1511 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1520 static unsigned int nCurrentBlockFile = 1;
1522 FILE* AppendBlockFile(unsigned int& nFileRet)
1527 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1530 if (fseek(file, 0, SEEK_END) != 0)
1532 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1533 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1535 nFileRet = nCurrentBlockFile;
1539 nCurrentBlockFile++;
1543 bool LoadBlockIndex(bool fAllowNew)
1547 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1548 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1549 pchMessageStart[0] = 0xfa;
1550 pchMessageStart[1] = 0xbf;
1551 pchMessageStart[2] = 0xb5;
1552 pchMessageStart[3] = 0xda;
1559 if (!txdb.LoadBlockIndex())
1564 // Init with genesis block
1566 if (mapBlockIndex.empty())
1572 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1573 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1574 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1575 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1576 // vMerkleTree: 4a5e1e
1579 const char* pszTimestamp = "MarketWatch 07/Nov/2011 Gold tops $1,790 to end at over six-week high";
1581 txNew.nTime = 1324698231;
1582 txNew.vin.resize(1);
1583 txNew.vout.resize(1);
1584 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1585 txNew.vout[0].nValue = 50 * COIN;
1586 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1588 block.vtx.push_back(txNew);
1589 block.hashPrevBlock = 0;
1590 block.hashMerkleRoot = block.BuildMerkleTree();
1592 block.nTime = 1324707839;
1593 block.nBits = 0x1d00ffff;
1594 block.nNonce = 486102291;
1598 block.nTime = 1296688602;
1599 block.nBits = 0x1d07fff8;
1600 block.nNonce = 384568319;
1604 printf("%s\n", block.GetHash().ToString().c_str());
1605 printf("%s\n", hashGenesisBlock.ToString().c_str());
1606 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1607 assert(block.hashMerkleRoot == uint256("0x487e83bd2b5a5196a2a6b87998d779a162101cb02cc64bf9ac33289dd0c22352"));
1609 assert(block.GetHash() == hashGenesisBlock);
1611 // Start new block file
1613 unsigned int nBlockPos;
1614 if (!block.WriteToDisk(nFile, nBlockPos))
1615 return error("LoadBlockIndex() : writing genesis block to disk failed");
1616 if (!block.AddToBlockIndex(nFile, nBlockPos))
1617 return error("LoadBlockIndex() : genesis block not accepted");
1625 void PrintBlockTree()
1627 // precompute tree structure
1628 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1629 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1631 CBlockIndex* pindex = (*mi).second;
1632 mapNext[pindex->pprev].push_back(pindex);
1634 //while (rand() % 3 == 0)
1635 // mapNext[pindex->pprev].push_back(pindex);
1638 vector<pair<int, CBlockIndex*> > vStack;
1639 vStack.push_back(make_pair(0, pindexGenesisBlock));
1642 while (!vStack.empty())
1644 int nCol = vStack.back().first;
1645 CBlockIndex* pindex = vStack.back().second;
1648 // print split or gap
1649 if (nCol > nPrevCol)
1651 for (int i = 0; i < nCol-1; i++)
1655 else if (nCol < nPrevCol)
1657 for (int i = 0; i < nCol; i++)
1664 for (int i = 0; i < nCol; i++)
1669 block.ReadFromDisk(pindex);
1670 printf("%d (%u,%u) %s %s tx %d",
1674 block.GetHash().ToString().substr(0,20).c_str(),
1675 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1678 PrintWallets(block);
1680 // put the main timechain first
1681 vector<CBlockIndex*>& vNext = mapNext[pindex];
1682 for (int i = 0; i < vNext.size(); i++)
1684 if (vNext[i]->pnext)
1686 swap(vNext[0], vNext[i]);
1692 for (int i = 0; i < vNext.size(); i++)
1693 vStack.push_back(make_pair(nCol+i, vNext[i]));
1706 //////////////////////////////////////////////////////////////////////////////
1711 map<uint256, CAlert> mapAlerts;
1712 CCriticalSection cs_mapAlerts;
1714 string GetWarnings(string strFor)
1717 string strStatusBar;
1719 if (GetBoolArg("-testsafemode"))
1722 // Misc warnings like out of disk space and clock is wrong
1723 if (strMiscWarning != "")
1726 strStatusBar = strMiscWarning;
1729 // Longer invalid proof-of-work chain
1730 if (pindexBest && nBestInvalidTrust > nBestChainTrust + pindexBest->GetBlockTrust() * 6)
1733 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1737 CRITICAL_BLOCK(cs_mapAlerts)
1739 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1741 const CAlert& alert = item.second;
1742 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1744 nPriority = alert.nPriority;
1745 strStatusBar = alert.strStatusBar;
1750 if (strFor == "statusbar")
1751 return strStatusBar;
1752 else if (strFor == "rpc")
1754 assert(!"GetWarnings() : invalid parameter");
1758 bool CAlert::ProcessAlert()
1760 if (!CheckSignature())
1765 CRITICAL_BLOCK(cs_mapAlerts)
1767 // Cancel previous alerts
1768 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1770 const CAlert& alert = (*mi).second;
1773 printf("cancelling alert %d\n", alert.nID);
1774 mapAlerts.erase(mi++);
1776 else if (!alert.IsInEffect())
1778 printf("expiring alert %d\n", alert.nID);
1779 mapAlerts.erase(mi++);
1785 // Check if this alert has been cancelled
1786 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1788 const CAlert& alert = item.second;
1789 if (alert.Cancels(*this))
1791 printf("alert already cancelled by %d\n", alert.nID);
1797 mapAlerts.insert(make_pair(GetHash(), *this));
1800 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1812 //////////////////////////////////////////////////////////////////////////////
1818 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1822 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1823 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1825 // Don't know what it is, just say we already got one
1832 // The message start string is designed to be unlikely to occur in normal data.
1833 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1834 // a large 4-byte int at any alignment.
1835 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1838 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1840 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1841 RandAddSeedPerfmon();
1843 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1844 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1846 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1848 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1856 if (strCommand == "version")
1858 // Each connection can only send one version message
1859 if (pfrom->nVersion != 0)
1861 pfrom->Misbehaving(1);
1869 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1870 if (pfrom->nVersion == 10300)
1871 pfrom->nVersion = 300;
1872 if (pfrom->nVersion >= 106 && !vRecv.empty())
1873 vRecv >> addrFrom >> nNonce;
1874 if (pfrom->nVersion >= 106 && !vRecv.empty())
1875 vRecv >> pfrom->strSubVer;
1876 if (pfrom->nVersion >= 209 && !vRecv.empty())
1877 vRecv >> pfrom->nStartingHeight;
1879 if (pfrom->nVersion == 0)
1882 // Disconnect if we connected to ourself
1883 if (nNonce == nLocalHostNonce && nNonce > 1)
1885 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1886 pfrom->fDisconnect = true;
1890 // Be shy and don't send version until we hear
1891 if (pfrom->fInbound)
1892 pfrom->PushVersion();
1894 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1896 AddTimeData(pfrom->addr.ip, nTime);
1899 if (pfrom->nVersion >= 209)
1900 pfrom->PushMessage("verack");
1901 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1902 if (pfrom->nVersion < 209)
1903 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1905 if (!pfrom->fInbound)
1907 // Advertise our address
1908 if (addrLocalHost.IsRoutable() && !fUseProxy)
1910 CAddress addr(addrLocalHost);
1911 addr.nTime = GetAdjustedTime();
1912 pfrom->PushAddress(addr);
1915 // Get recent addresses
1916 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1918 pfrom->PushMessage("getaddr");
1919 pfrom->fGetAddr = true;
1923 // Ask the first connected node for block updates
1924 static int nAskedForBlocks;
1925 if (!pfrom->fClient &&
1926 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1927 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1930 pfrom->PushGetBlocks(pindexBest, uint256(0));
1934 CRITICAL_BLOCK(cs_mapAlerts)
1935 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1936 item.second.RelayTo(pfrom);
1938 pfrom->fSuccessfullyConnected = true;
1940 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1942 cPeerBlockCounts.input(pfrom->nStartingHeight);
1946 else if (pfrom->nVersion == 0)
1948 // Must have a version message before anything else
1949 pfrom->Misbehaving(1);
1954 else if (strCommand == "verack")
1956 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1960 else if (strCommand == "addr")
1962 vector<CAddress> vAddr;
1965 // Don't want addr from older versions unless seeding
1966 if (pfrom->nVersion < 209)
1968 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1970 if (vAddr.size() > 1000)
1972 pfrom->Misbehaving(20);
1973 return error("message addr size() = %d", vAddr.size());
1976 // Store the new addresses
1979 int64 nNow = GetAdjustedTime();
1980 int64 nSince = nNow - 10 * 60;
1981 BOOST_FOREACH(CAddress& addr, vAddr)
1985 // ignore IPv6 for now, since it isn't implemented anyway
1988 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1989 addr.nTime = nNow - 5 * 24 * 60 * 60;
1990 AddAddress(addr, 2 * 60 * 60, &addrDB);
1991 pfrom->AddAddressKnown(addr);
1992 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1994 // Relay to a limited number of other nodes
1995 CRITICAL_BLOCK(cs_vNodes)
1997 // Use deterministic randomness to send to the same nodes for 24 hours
1998 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1999 static uint256 hashSalt;
2001 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2002 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2003 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2004 multimap<uint256, CNode*> mapMix;
2005 BOOST_FOREACH(CNode* pnode, vNodes)
2007 if (pnode->nVersion < 31402)
2009 unsigned int nPointer;
2010 memcpy(&nPointer, &pnode, sizeof(nPointer));
2011 uint256 hashKey = hashRand ^ nPointer;
2012 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2013 mapMix.insert(make_pair(hashKey, pnode));
2015 int nRelayNodes = 2;
2016 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2017 ((*mi).second)->PushAddress(addr);
2021 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2022 if (vAddr.size() < 1000)
2023 pfrom->fGetAddr = false;
2027 else if (strCommand == "inv")
2031 if (vInv.size() > 50000)
2033 pfrom->Misbehaving(20);
2034 return error("message inv size() = %d", vInv.size());
2038 BOOST_FOREACH(const CInv& inv, vInv)
2042 pfrom->AddInventoryKnown(inv);
2044 bool fAlreadyHave = AlreadyHave(txdb, inv);
2046 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2050 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2051 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2053 // Track requests for our stuff
2054 Inventory(inv.hash);
2059 else if (strCommand == "getdata")
2063 if (vInv.size() > 50000)
2065 pfrom->Misbehaving(20);
2066 return error("message getdata size() = %d", vInv.size());
2069 BOOST_FOREACH(const CInv& inv, vInv)
2073 printf("received getdata for: %s\n", inv.ToString().c_str());
2075 if (inv.type == MSG_BLOCK)
2077 // Send block from disk
2078 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2079 if (mi != mapBlockIndex.end())
2082 block.ReadFromDisk((*mi).second);
2083 pfrom->PushMessage("block", block);
2085 // Trigger them to send a getblocks request for the next batch of inventory
2086 if (inv.hash == pfrom->hashContinue)
2088 // Bypass PushInventory, this must send even if redundant,
2089 // and we want it right after the last block so they don't
2090 // wait for other stuff first.
2092 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2093 pfrom->PushMessage("inv", vInv);
2094 pfrom->hashContinue = 0;
2098 else if (inv.IsKnownType())
2100 // Send stream from relay memory
2101 CRITICAL_BLOCK(cs_mapRelay)
2103 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2104 if (mi != mapRelay.end())
2105 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2109 // Track requests for our stuff
2110 Inventory(inv.hash);
2115 else if (strCommand == "getblocks")
2117 CBlockLocator locator;
2119 vRecv >> locator >> hashStop;
2121 // Find the last block the caller has in the main chain
2122 CBlockIndex* pindex = locator.GetBlockIndex();
2124 // Send the rest of the chain
2126 pindex = pindex->pnext;
2127 int nLimit = 500 + locator.GetDistanceBack();
2128 unsigned int nBytes = 0;
2129 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2130 for (; pindex; pindex = pindex->pnext)
2132 if (pindex->GetBlockHash() == hashStop)
2134 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2137 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2139 block.ReadFromDisk(pindex, true);
2140 nBytes += block.GetSerializeSize(SER_NETWORK);
2141 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2143 // When this block is requested, we'll send an inv that'll make them
2144 // getblocks the next batch of inventory.
2145 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2146 pfrom->hashContinue = pindex->GetBlockHash();
2153 else if (strCommand == "getheaders")
2155 CBlockLocator locator;
2157 vRecv >> locator >> hashStop;
2159 CBlockIndex* pindex = NULL;
2160 if (locator.IsNull())
2162 // If locator is null, return the hashStop block
2163 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2164 if (mi == mapBlockIndex.end())
2166 pindex = (*mi).second;
2170 // Find the last block the caller has in the main chain
2171 pindex = locator.GetBlockIndex();
2173 pindex = pindex->pnext;
2176 vector<CBlock> vHeaders;
2177 int nLimit = 2000 + locator.GetDistanceBack();
2178 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2179 for (; pindex; pindex = pindex->pnext)
2181 vHeaders.push_back(pindex->GetBlockHeader());
2182 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2185 pfrom->PushMessage("headers", vHeaders);
2189 else if (strCommand == "tx")
2191 vector<uint256> vWorkQueue;
2192 CDataStream vMsg(vRecv);
2196 CInv inv(MSG_TX, tx.GetHash());
2197 pfrom->AddInventoryKnown(inv);
2199 bool fMissingInputs = false;
2200 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2202 SyncWithWallets(tx, NULL, true);
2203 RelayMessage(inv, vMsg);
2204 mapAlreadyAskedFor.erase(inv);
2205 vWorkQueue.push_back(inv.hash);
2207 // Recursively process any orphan transactions that depended on this one
2208 for (int i = 0; i < vWorkQueue.size(); i++)
2210 uint256 hashPrev = vWorkQueue[i];
2211 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2212 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2215 const CDataStream& vMsg = *((*mi).second);
2217 CDataStream(vMsg) >> tx;
2218 CInv inv(MSG_TX, tx.GetHash());
2220 if (tx.AcceptToMemoryPool(true))
2222 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2223 SyncWithWallets(tx, NULL, true);
2224 RelayMessage(inv, vMsg);
2225 mapAlreadyAskedFor.erase(inv);
2226 vWorkQueue.push_back(inv.hash);
2231 BOOST_FOREACH(uint256 hash, vWorkQueue)
2232 EraseOrphanTx(hash);
2234 else if (fMissingInputs)
2236 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2239 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2243 else if (strCommand == "block")
2248 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2251 CInv inv(MSG_BLOCK, block.GetHash());
2252 pfrom->AddInventoryKnown(inv);
2254 if (ProcessBlock(pfrom, &block))
2255 mapAlreadyAskedFor.erase(inv);
2256 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2260 else if (strCommand == "getaddr")
2262 // Nodes rebroadcast an addr every 24 hours
2263 pfrom->vAddrToSend.clear();
2264 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2265 CRITICAL_BLOCK(cs_mapAddresses)
2267 unsigned int nCount = 0;
2268 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2270 const CAddress& addr = item.second;
2271 if (addr.nTime > nSince)
2274 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2276 const CAddress& addr = item.second;
2277 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2278 pfrom->PushAddress(addr);
2284 else if (strCommand == "checkorder")
2289 if (!GetBoolArg("-allowreceivebyip"))
2291 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2298 /// we have a chance to check the order here
2300 // Keep giving the same key to the same ip until they use it
2301 if (!mapReuseKey.count(pfrom->addr.ip))
2302 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2304 // Send back approval of order and pubkey to use
2305 CScript scriptPubKey;
2306 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2307 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2311 else if (strCommand == "reply")
2316 CRequestTracker tracker;
2317 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2319 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2320 if (mi != pfrom->mapRequests.end())
2322 tracker = (*mi).second;
2323 pfrom->mapRequests.erase(mi);
2326 if (!tracker.IsNull())
2327 tracker.fn(tracker.param1, vRecv);
2331 else if (strCommand == "ping")
2336 else if (strCommand == "alert")
2341 if (alert.ProcessAlert())
2344 pfrom->setKnown.insert(alert.GetHash());
2345 CRITICAL_BLOCK(cs_vNodes)
2346 BOOST_FOREACH(CNode* pnode, vNodes)
2347 alert.RelayTo(pnode);
2354 // Ignore unknown commands for extensibility
2358 // Update the last seen time for this node's address
2359 if (pfrom->fNetworkNode)
2360 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2361 AddressCurrentlyConnected(pfrom->addr);
2367 bool ProcessMessages(CNode* pfrom)
2369 CDataStream& vRecv = pfrom->vRecv;
2373 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2377 // (4) message start
2386 // Scan for message start
2387 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2388 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2389 if (vRecv.end() - pstart < nHeaderSize)
2391 if (vRecv.size() > nHeaderSize)
2393 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2394 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2398 if (pstart - vRecv.begin() > 0)
2399 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2400 vRecv.erase(vRecv.begin(), pstart);
2403 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2408 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2411 string strCommand = hdr.GetCommand();
2414 unsigned int nMessageSize = hdr.nMessageSize;
2415 if (nMessageSize > MAX_SIZE)
2417 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2420 if (nMessageSize > vRecv.size())
2422 // Rewind and wait for rest of message
2423 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2428 if (vRecv.GetVersion() >= 209)
2430 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2431 unsigned int nChecksum = 0;
2432 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2433 if (nChecksum != hdr.nChecksum)
2435 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2436 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2441 // Copy message to its own buffer
2442 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2443 vRecv.ignore(nMessageSize);
2449 CRITICAL_BLOCK(cs_main)
2450 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2454 catch (std::ios_base::failure& e)
2456 if (strstr(e.what(), "end of data"))
2458 // Allow exceptions from underlength message on vRecv
2459 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
2461 else if (strstr(e.what(), "size too large"))
2463 // Allow exceptions from overlong size
2464 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2468 PrintExceptionContinue(&e, "ProcessMessage()");
2471 catch (std::exception& e) {
2472 PrintExceptionContinue(&e, "ProcessMessage()");
2474 PrintExceptionContinue(NULL, "ProcessMessage()");
2478 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2486 bool SendMessages(CNode* pto, bool fSendTrickle)
2488 CRITICAL_BLOCK(cs_main)
2490 // Don't send anything until we get their version message
2491 if (pto->nVersion == 0)
2495 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2496 pto->PushMessage("ping");
2498 // Resend wallet transactions that haven't gotten in a block yet
2499 ResendWalletTransactions();
2501 // Address refresh broadcast
2502 static int64 nLastRebroadcast;
2503 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2505 nLastRebroadcast = GetTime();
2506 CRITICAL_BLOCK(cs_vNodes)
2508 BOOST_FOREACH(CNode* pnode, vNodes)
2510 // Periodically clear setAddrKnown to allow refresh broadcasts
2511 pnode->setAddrKnown.clear();
2513 // Rebroadcast our address
2514 if (addrLocalHost.IsRoutable() && !fUseProxy)
2516 CAddress addr(addrLocalHost);
2517 addr.nTime = GetAdjustedTime();
2518 pnode->PushAddress(addr);
2524 // Clear out old addresses periodically so it's not too much work at once
2525 static int64 nLastClear;
2526 if (nLastClear == 0)
2527 nLastClear = GetTime();
2528 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2530 nLastClear = GetTime();
2531 CRITICAL_BLOCK(cs_mapAddresses)
2534 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2535 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2536 mi != mapAddresses.end();)
2538 const CAddress& addr = (*mi).second;
2539 if (addr.nTime < nSince)
2541 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2543 addrdb.EraseAddress(addr);
2544 mapAddresses.erase(mi++);
2558 vector<CAddress> vAddr;
2559 vAddr.reserve(pto->vAddrToSend.size());
2560 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2562 // returns true if wasn't already contained in the set
2563 if (pto->setAddrKnown.insert(addr).second)
2565 vAddr.push_back(addr);
2566 // receiver rejects addr messages larger than 1000
2567 if (vAddr.size() >= 1000)
2569 pto->PushMessage("addr", vAddr);
2574 pto->vAddrToSend.clear();
2576 pto->PushMessage("addr", vAddr);
2581 // Message: inventory
2584 vector<CInv> vInvWait;
2585 CRITICAL_BLOCK(pto->cs_inventory)
2587 vInv.reserve(pto->vInventoryToSend.size());
2588 vInvWait.reserve(pto->vInventoryToSend.size());
2589 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2591 if (pto->setInventoryKnown.count(inv))
2594 // trickle out tx inv to protect privacy
2595 if (inv.type == MSG_TX && !fSendTrickle)
2597 // 1/4 of tx invs blast to all immediately
2598 static uint256 hashSalt;
2600 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2601 uint256 hashRand = inv.hash ^ hashSalt;
2602 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2603 bool fTrickleWait = ((hashRand & 3) != 0);
2605 // always trickle our own transactions
2609 if (GetTransaction(inv.hash, wtx))
2611 fTrickleWait = true;
2616 vInvWait.push_back(inv);
2621 // returns true if wasn't already contained in the set
2622 if (pto->setInventoryKnown.insert(inv).second)
2624 vInv.push_back(inv);
2625 if (vInv.size() >= 1000)
2627 pto->PushMessage("inv", vInv);
2632 pto->vInventoryToSend = vInvWait;
2635 pto->PushMessage("inv", vInv);
2641 vector<CInv> vGetData;
2642 int64 nNow = GetTime() * 1000000;
2644 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2646 const CInv& inv = (*pto->mapAskFor.begin()).second;
2647 if (!AlreadyHave(txdb, inv))
2649 printf("sending getdata: %s\n", inv.ToString().c_str());
2650 vGetData.push_back(inv);
2651 if (vGetData.size() >= 1000)
2653 pto->PushMessage("getdata", vGetData);
2657 mapAlreadyAskedFor[inv] = nNow;
2658 pto->mapAskFor.erase(pto->mapAskFor.begin());
2660 if (!vGetData.empty())
2661 pto->PushMessage("getdata", vGetData);
2680 //////////////////////////////////////////////////////////////////////////////
2685 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2687 unsigned char* pdata = (unsigned char*)pbuffer;
2688 unsigned int blocks = 1 + ((len + 8) / 64);
2689 unsigned char* pend = pdata + 64 * blocks;
2690 memset(pdata + len, 0, 64 * blocks - len);
2692 unsigned int bits = len * 8;
2693 pend[-1] = (bits >> 0) & 0xff;
2694 pend[-2] = (bits >> 8) & 0xff;
2695 pend[-3] = (bits >> 16) & 0xff;
2696 pend[-4] = (bits >> 24) & 0xff;
2700 static const unsigned int pSHA256InitState[8] =
2701 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2703 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2706 unsigned char data[64];
2710 for (int i = 0; i < 16; i++)
2711 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2713 for (int i = 0; i < 8; i++)
2714 ctx.h[i] = ((uint32_t*)pinit)[i];
2716 SHA256_Update(&ctx, data, sizeof(data));
2717 for (int i = 0; i < 8; i++)
2718 ((uint32_t*)pstate)[i] = ctx.h[i];
2722 // ScanHash scans nonces looking for a hash with at least some zero bits.
2723 // It operates on big endian data. Caller does the byte reversing.
2724 // All input buffers are 16-byte aligned. nNonce is usually preserved
2725 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2726 // the block is rebuilt and nNonce starts over at zero.
2728 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2730 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2734 // Hash pdata using pmidstate as the starting state into
2735 // preformatted buffer phash1, then hash phash1 into phash
2737 SHA256Transform(phash1, pdata, pmidstate);
2738 SHA256Transform(phash, phash1, pSHA256InitState);
2740 // Return the nonce if the hash has at least some zero bits,
2741 // caller will check if it has enough to reach the target
2742 if (((unsigned short*)phash)[14] == 0)
2745 // If nothing found after trying for a while, return -1
2746 if ((nNonce & 0xffff) == 0)
2748 nHashesDone = 0xffff+1;
2754 // Some explaining would be appreciated
2759 set<uint256> setDependsOn;
2762 COrphan(CTransaction* ptxIn)
2770 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2771 BOOST_FOREACH(uint256 hash, setDependsOn)
2772 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2777 CBlock* CreateNewBlock(CReserveKey& reservekey)
2779 CBlockIndex* pindexPrev = pindexBest;
2782 auto_ptr<CBlock> pblock(new CBlock());
2786 // Create coinbase tx
2788 txNew.vin.resize(1);
2789 txNew.vin[0].prevout.SetNull();
2790 txNew.vout.resize(1);
2791 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2793 // Add our coinbase tx as first transaction
2794 pblock->vtx.push_back(txNew);
2796 // Collect memory pool transactions into the block
2798 CRITICAL_BLOCK(cs_main)
2799 CRITICAL_BLOCK(cs_mapTransactions)
2803 // Priority order to process transactions
2804 list<COrphan> vOrphan; // list memory doesn't move
2805 map<uint256, vector<COrphan*> > mapDependers;
2806 multimap<double, CTransaction*> mapPriority;
2807 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2809 CTransaction& tx = (*mi).second;
2810 if (tx.IsCoinBase() || !tx.IsFinal())
2813 COrphan* porphan = NULL;
2814 double dPriority = 0;
2815 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2817 // Read prev transaction
2818 CTransaction txPrev;
2820 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2822 // Has to wait for dependencies
2825 // Use list for automatic deletion
2826 vOrphan.push_back(COrphan(&tx));
2827 porphan = &vOrphan.back();
2829 mapDependers[txin.prevout.hash].push_back(porphan);
2830 porphan->setDependsOn.insert(txin.prevout.hash);
2833 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2835 // Read block header
2836 int nConf = txindex.GetDepthInMainChain();
2838 dPriority += (double)nValueIn * nConf;
2840 if (fDebug && GetBoolArg("-printpriority"))
2841 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2844 // Priority is sum(valuein * age) / txsize
2845 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2848 porphan->dPriority = dPriority;
2850 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2852 if (fDebug && GetBoolArg("-printpriority"))
2854 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2861 // Collect transactions into block
2862 map<uint256, CTxIndex> mapTestPool;
2863 uint64 nBlockSize = 1000;
2864 int nBlockSigOps = 100;
2865 while (!mapPriority.empty())
2867 // Take highest priority transaction off priority queue
2868 double dPriority = -(*mapPriority.begin()).first;
2869 CTransaction& tx = *(*mapPriority.begin()).second;
2870 mapPriority.erase(mapPriority.begin());
2873 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2874 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2876 int nTxSigOps = tx.GetSigOpCount();
2877 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2881 if (tx.nTime > GetAdjustedTime())
2884 // ppcoin: simplify transaction fee - allow free = false
2885 int64 nMinFee = tx.GetMinFee(nBlockSize, false, true);
2887 // Connecting shouldn't fail due to dependency on other memory pool transactions
2888 // because we're already processing them in order of dependency
2889 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2890 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2892 swap(mapTestPool, mapTestPoolTmp);
2895 pblock->vtx.push_back(tx);
2896 nBlockSize += nTxSize;
2897 nBlockSigOps += nTxSigOps;
2899 // Add transactions that depend on this one to the priority queue
2900 uint256 hash = tx.GetHash();
2901 if (mapDependers.count(hash))
2903 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2905 if (!porphan->setDependsOn.empty())
2907 porphan->setDependsOn.erase(hash);
2908 if (porphan->setDependsOn.empty())
2909 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2915 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2918 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2919 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2920 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2921 pblock->nTime = max(pblock->GetBlockTime(), pblock->GetMaxTransactionTime());
2922 pblock->nBits = GetNextWorkRequired(pindexPrev);
2925 return pblock.release();
2929 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2931 // Update nExtraNonce
2932 static uint256 hashPrevBlock;
2933 if (hashPrevBlock != pblock->hashPrevBlock)
2936 hashPrevBlock = pblock->hashPrevBlock;
2939 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2940 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2944 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2947 // Prebuild hash buffers
2954 uint256 hashPrevBlock;
2955 uint256 hashMerkleRoot;
2958 unsigned int nNonce;
2961 unsigned char pchPadding0[64];
2963 unsigned char pchPadding1[64];
2966 memset(&tmp, 0, sizeof(tmp));
2968 tmp.block.nVersion = pblock->nVersion;
2969 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2970 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2971 tmp.block.nTime = pblock->nTime;
2972 tmp.block.nBits = pblock->nBits;
2973 tmp.block.nNonce = pblock->nNonce;
2975 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2976 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2978 // Byte swap all the input buffer
2979 for (int i = 0; i < sizeof(tmp)/4; i++)
2980 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2982 // Precalc the first half of the first hash, which stays constant
2983 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2985 memcpy(pdata, &tmp.block, 128);
2986 memcpy(phash1, &tmp.hash1, 64);
2990 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2992 uint256 hash = pblock->GetHash();
2993 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2995 if (hash > hashTarget)
2999 printf("BitcoinMiner:\n");
3000 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3002 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3003 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3006 CRITICAL_BLOCK(cs_main)
3008 if (pblock->hashPrevBlock != hashBestChain)
3009 return error("BitcoinMiner : generated block is stale");
3011 // Remove key from key pool
3012 reservekey.KeepKey();
3014 // Track how many getdata requests this block gets
3015 CRITICAL_BLOCK(wallet.cs_wallet)
3016 wallet.mapRequestCount[pblock->GetHash()] = 0;
3018 // Process this block the same as if we had received it from another node
3019 if (!ProcessBlock(NULL, pblock))
3020 return error("BitcoinMiner : ProcessBlock, block not accepted");
3026 void static ThreadBitcoinMiner(void* parg);
3028 void static BitcoinMiner(CWallet *pwallet)
3030 printf("BitcoinMiner started\n");
3031 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3033 // Each thread has its own key and counter
3034 CReserveKey reservekey(pwallet);
3035 unsigned int nExtraNonce = 0;
3037 while (fGenerateBitcoins)
3039 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3043 while (vNodes.empty() || IsInitialBlockDownload())
3048 if (!fGenerateBitcoins)
3056 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3057 CBlockIndex* pindexPrev = pindexBest;
3059 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3062 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3064 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3068 // Prebuild hash buffers
3070 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3071 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3072 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3074 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3076 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3077 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3083 int64 nStart = GetTime();
3084 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3086 uint256& hash = *alignup<16>(hashbuf);
3089 unsigned int nHashesDone = 0;
3090 unsigned int nNonceFound;
3093 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3094 (char*)&hash, nHashesDone);
3096 // Check if something found
3097 if (nNonceFound != -1)
3099 for (int i = 0; i < sizeof(hash)/4; i++)
3100 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3102 if (hash <= hashTarget)
3105 pblock->nNonce = ByteReverse(nNonceFound);
3106 assert(hash == pblock->GetHash());
3108 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3109 CheckWork(pblock.get(), *pwalletMain, reservekey);
3110 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3116 static int64 nHashCounter;
3117 if (nHPSTimerStart == 0)
3119 nHPSTimerStart = GetTimeMillis();
3123 nHashCounter += nHashesDone;
3124 if (GetTimeMillis() - nHPSTimerStart > 4000)
3126 static CCriticalSection cs;
3129 if (GetTimeMillis() - nHPSTimerStart > 4000)
3131 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3132 nHPSTimerStart = GetTimeMillis();
3134 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3135 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3136 static int64 nLogTime;
3137 if (GetTime() - nLogTime > 30 * 60)
3139 nLogTime = GetTime();
3140 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3141 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3147 // Check for stop or if block needs to be rebuilt
3150 if (!fGenerateBitcoins)
3152 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3156 if (nBlockNonce >= 0xffff0000)
3158 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3160 if (pindexPrev != pindexBest)
3163 // Update nTime every few seconds
3164 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3165 pblock->nTime = max(pblock->GetBlockTime(), pblock->GetMaxTransactionTime());
3166 nBlockTime = ByteReverse(pblock->nTime);
3171 void static ThreadBitcoinMiner(void* parg)
3173 CWallet* pwallet = (CWallet*)parg;
3176 vnThreadsRunning[3]++;
3177 BitcoinMiner(pwallet);
3178 vnThreadsRunning[3]--;
3180 catch (std::exception& e) {
3181 vnThreadsRunning[3]--;
3182 PrintException(&e, "ThreadBitcoinMiner()");
3184 vnThreadsRunning[3]--;
3185 PrintException(NULL, "ThreadBitcoinMiner()");
3187 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3189 if (vnThreadsRunning[3] == 0)
3191 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3195 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3197 if (fGenerateBitcoins != fGenerate)
3199 fGenerateBitcoins = fGenerate;
3200 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3203 if (fGenerateBitcoins)
3205 int nProcessors = boost::thread::hardware_concurrency();
3206 printf("%d processors\n", nProcessors);
3207 if (nProcessors < 1)
3209 if (fLimitProcessors && nProcessors > nLimitProcessors)
3210 nProcessors = nLimitProcessors;
3211 int nAddThreads = nProcessors - vnThreadsRunning[3];
3212 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3213 for (int i = 0; i < nAddThreads; i++)
3215 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3216 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");