1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include "cryptopp/sha.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("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
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 CBigNum bnBestChainWork = 0;
38 CBigNum bnBestInvalidWork = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
43 map<uint256, CBlock*> mapOrphanBlocks;
44 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
46 map<uint256, CDataStream*> mapOrphanTransactions;
47 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
54 int fGenerateBitcoins = false;
55 int64 nTransactionFee = 0;
56 int fLimitProcessors = false;
57 int nLimitProcessors = 1;
58 int fMinimizeToTray = true;
59 int fMinimizeOnClose = true;
72 //////////////////////////////////////////////////////////////////////////////
74 // dispatching functions
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 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 void static EraseFromWallets(uint256 hash)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 pwallet->EraseFromWallet(hash);
115 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
117 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
118 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
121 void static SetBestChain(const CBlockLocator& loc)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->SetBestChain(loc);
127 void static UpdatedTransaction(const uint256& hashTx)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 void static Inventory(const uint256& hash)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->Inventory(hash);
145 void static ResendWalletTransactions()
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->ResendWalletTransactions();
157 //////////////////////////////////////////////////////////////////////////////
159 // mapOrphanTransactions
162 void AddOrphanTx(const CDataStream& vMsg)
165 CDataStream(vMsg) >> tx;
166 uint256 hash = tx.GetHash();
167 if (mapOrphanTransactions.count(hash))
170 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
171 BOOST_FOREACH(const CTxIn& txin, tx.vin)
172 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
175 void static EraseOrphanTx(uint256 hash)
177 if (!mapOrphanTransactions.count(hash))
179 const CDataStream* pvMsg = mapOrphanTransactions[hash];
181 CDataStream(*pvMsg) >> tx;
182 BOOST_FOREACH(const CTxIn& txin, tx.vin)
184 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
185 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
187 if ((*mi).second == pvMsg)
188 mapOrphanTransactionsByPrev.erase(mi++);
194 mapOrphanTransactions.erase(hash);
197 int LimitOrphanTxSize(int nMaxOrphans)
200 while (mapOrphanTransactions.size() > nMaxOrphans)
202 // Evict a random orphan:
203 std::vector<unsigned char> randbytes(32);
204 RAND_bytes(&randbytes[0], 32);
205 uint256 randomhash(randbytes);
206 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
207 if (it == mapOrphanTransactions.end())
208 it = mapOrphanTransactions.begin();
209 EraseOrphanTx(it->first);
221 //////////////////////////////////////////////////////////////////////////////
223 // CTransaction and CTxIndex
226 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
229 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
231 if (!ReadFromDisk(txindexRet.pos))
233 if (prevout.n >= vout.size())
241 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
244 return ReadFromDisk(txdb, prevout, txindex);
247 bool CTransaction::ReadFromDisk(COutPoint prevout)
251 return ReadFromDisk(txdb, prevout, txindex);
256 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
268 // Load the block this tx is in
270 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
272 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
277 // Update the tx's hashBlock
278 hashBlock = pblock->GetHash();
280 // Locate the transaction
281 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
282 if (pblock->vtx[nIndex] == *(CTransaction*)this)
284 if (nIndex == pblock->vtx.size())
286 vMerkleBranch.clear();
288 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
292 // Fill in merkle branch
293 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
296 // Is the tx in a block that's in the main chain
297 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
298 if (mi == mapBlockIndex.end())
300 CBlockIndex* pindex = (*mi).second;
301 if (!pindex || !pindex->IsInMainChain())
304 return pindexBest->nHeight - pindex->nHeight + 1;
313 bool CTransaction::CheckTransaction() const
315 // Basic checks that don't depend on any context
317 return error("CTransaction::CheckTransaction() : vin empty");
319 return error("CTransaction::CheckTransaction() : vout empty");
321 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
322 return error("CTransaction::CheckTransaction() : size limits failed");
324 // Check for negative or overflow output values
326 BOOST_FOREACH(const CTxOut& txout, vout)
328 if (txout.nValue < 0)
329 return error("CTransaction::CheckTransaction() : txout.nValue negative");
330 if (txout.nValue > MAX_MONEY)
331 return error("CTransaction::CheckTransaction() : txout.nValue too high");
332 nValueOut += txout.nValue;
333 if (!MoneyRange(nValueOut))
334 return error("CTransaction::CheckTransaction() : txout total out of range");
337 // Check for duplicate inputs
338 set<COutPoint> vInOutPoints;
339 BOOST_FOREACH(const CTxIn& txin, vin)
341 if (vInOutPoints.count(txin.prevout))
343 vInOutPoints.insert(txin.prevout);
348 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
349 return error("CTransaction::CheckTransaction() : coinbase script size");
353 BOOST_FOREACH(const CTxIn& txin, vin)
354 if (txin.prevout.IsNull())
355 return error("CTransaction::CheckTransaction() : prevout is null");
361 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
364 *pfMissingInputs = false;
366 if (!CheckTransaction())
367 return error("AcceptToMemoryPool() : CheckTransaction failed");
369 // Coinbase is only valid in a block, not as a loose transaction
371 return error("AcceptToMemoryPool() : coinbase as individual tx");
373 // To help v0.1.5 clients who would see it as a negative number
374 if ((int64)nLockTime > INT_MAX)
375 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
378 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
379 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
380 // attacks disallow transactions with more than one SigOp per 34 bytes.
381 // 34 bytes because a TxOut is:
382 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
383 if (GetSigOpCount() > nSize / 34 || nSize < 100)
384 return error("AcceptToMemoryPool() : nonstandard transaction");
386 // Rather not work on nonstandard transactions (unless -testnet)
387 if (!fTestNet && !IsStandard())
388 return error("AcceptToMemoryPool() : nonstandard transaction type");
390 // Do we already have it?
391 uint256 hash = GetHash();
392 CRITICAL_BLOCK(cs_mapTransactions)
393 if (mapTransactions.count(hash))
396 if (txdb.ContainsTx(hash))
399 // Check for conflicts with in-memory transactions
400 CTransaction* ptxOld = NULL;
401 for (int i = 0; i < vin.size(); i++)
403 COutPoint outpoint = vin[i].prevout;
404 if (mapNextTx.count(outpoint))
406 // Disable replacement feature for now
409 // Allow replacing with a newer version of the same transaction
412 ptxOld = mapNextTx[outpoint].ptx;
413 if (ptxOld->IsFinal())
415 if (!IsNewerThan(*ptxOld))
417 for (int i = 0; i < vin.size(); i++)
419 COutPoint outpoint = vin[i].prevout;
420 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
429 // Check against previous transactions
430 map<uint256, CTxIndex> mapUnused;
432 bool fInvalid = false;
433 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false, 0, fInvalid))
436 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
437 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
440 // Don't accept it if it can't get into a block
441 if (nFees < GetMinFee(1000, true, true))
442 return error("AcceptToMemoryPool() : not enough fees");
444 // Continuously rate-limit free transactions
445 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
446 // be annoying or make other's transactions take longer to confirm.
447 if (nFees < MIN_RELAY_TX_FEE)
449 static CCriticalSection cs;
450 static double dFreeCount;
451 static int64 nLastTime;
452 int64 nNow = GetTime();
456 // Use an exponentially decaying ~10-minute window:
457 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
459 // -limitfreerelay unit is thousand-bytes-per-minute
460 // At default rate it would take over a month to fill 1GB
461 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
462 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
464 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
470 // Store transaction in memory
471 CRITICAL_BLOCK(cs_mapTransactions)
475 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
476 ptxOld->RemoveFromMemoryPool();
478 AddToMemoryPoolUnchecked();
481 ///// are we sure this is ok when loading transactions or restoring block txes
482 // If updated, erase old tx from wallet
484 EraseFromWallets(ptxOld->GetHash());
486 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
490 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
493 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
496 bool CTransaction::AddToMemoryPoolUnchecked()
498 // Add to memory pool without checking anything. Don't call this directly,
499 // call AcceptToMemoryPool to properly check the transaction first.
500 CRITICAL_BLOCK(cs_mapTransactions)
502 uint256 hash = GetHash();
503 mapTransactions[hash] = *this;
504 for (int i = 0; i < vin.size(); i++)
505 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
506 nTransactionsUpdated++;
512 bool CTransaction::RemoveFromMemoryPool()
514 // Remove transaction from memory pool
515 CRITICAL_BLOCK(cs_mapTransactions)
517 BOOST_FOREACH(const CTxIn& txin, vin)
518 mapNextTx.erase(txin.prevout);
519 mapTransactions.erase(GetHash());
520 nTransactionsUpdated++;
530 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
532 if (hashBlock == 0 || nIndex == -1)
535 // Find the block it claims to be in
536 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
537 if (mi == mapBlockIndex.end())
539 CBlockIndex* pindex = (*mi).second;
540 if (!pindex || !pindex->IsInMainChain())
543 // Make sure the merkle branch connects to this block
544 if (!fMerkleVerified)
546 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
548 fMerkleVerified = true;
551 nHeightRet = pindex->nHeight;
552 return pindexBest->nHeight - pindex->nHeight + 1;
556 int CMerkleTx::GetBlocksToMaturity() const
560 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
564 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
568 if (!IsInMainChain() && !ClientConnectInputs())
570 return CTransaction::AcceptToMemoryPool(txdb, false);
574 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
578 bool CMerkleTx::AcceptToMemoryPool()
581 return AcceptToMemoryPool(txdb);
586 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
588 CRITICAL_BLOCK(cs_mapTransactions)
590 // Add previous supporting transactions first
591 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
593 if (!tx.IsCoinBase())
595 uint256 hash = tx.GetHash();
596 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
597 tx.AcceptToMemoryPool(txdb, fCheckInputs);
600 return AcceptToMemoryPool(txdb, fCheckInputs);
605 bool CWalletTx::AcceptWalletTransaction()
608 return AcceptWalletTransaction(txdb);
611 int CTxIndex::GetDepthInMainChain() const
615 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
617 // Find the block in the index
618 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
619 if (mi == mapBlockIndex.end())
621 CBlockIndex* pindex = (*mi).second;
622 if (!pindex || !pindex->IsInMainChain())
624 return 1 + nBestHeight - pindex->nHeight;
636 //////////////////////////////////////////////////////////////////////////////
638 // CBlock and CBlockIndex
641 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
643 if (!fReadTransactions)
645 *this = pindex->GetBlockHeader();
648 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
650 if (GetHash() != pindex->GetBlockHash())
651 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
655 uint256 static GetOrphanRoot(const CBlock* pblock)
657 // Work back to the first block in the orphan chain
658 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
659 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
660 return pblock->GetHash();
663 int64 static GetBlockValue(int nHeight, int64 nFees)
665 int64 nSubsidy = 50 * COIN;
667 // Subsidy is cut in half every 4 years
668 nSubsidy >>= (nHeight / 210000);
670 return nSubsidy + nFees;
673 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
674 static const int64 nTargetSpacing = 10 * 60;
675 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
678 // minimum amount of work that could possibly be required nTime after
679 // minimum work required was nBase
681 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
683 // Testnet has min-difficulty blocks
684 // after nTargetSpacing*2 time between blocks:
685 if (fTestNet && nTime > nTargetSpacing*2)
686 return bnProofOfWorkLimit.GetCompact();
689 bnResult.SetCompact(nBase);
690 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
692 // Maximum 400% adjustment...
694 // ... in best-case exactly 4-times-normal target time
695 nTime -= nTargetTimespan*4;
697 if (bnResult > bnProofOfWorkLimit)
698 bnResult = bnProofOfWorkLimit;
699 return bnResult.GetCompact();
702 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
704 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
707 if (pindexLast == NULL)
708 return nProofOfWorkLimit;
710 // Only change once per interval
711 if ((pindexLast->nHeight+1) % nInterval != 0)
713 // Special rules for testnet after 15 Feb 2012:
714 if (fTestNet && pblock->nTime > 1329264000)
716 // If the new block's timestamp is more than 2* 10 minutes
717 // then allow mining of a min-difficulty block.
718 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
719 return nProofOfWorkLimit;
722 // Return the last non-special-min-difficulty-rules-block
723 const CBlockIndex* pindex = pindexLast;
724 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
725 pindex = pindex->pprev;
726 return pindex->nBits;
730 return pindexLast->nBits;
733 // Go back by what we want to be 14 days worth of blocks
734 const CBlockIndex* pindexFirst = pindexLast;
735 for (int i = 0; pindexFirst && i < nInterval-1; i++)
736 pindexFirst = pindexFirst->pprev;
739 // Limit adjustment step
740 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
741 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
742 if (nActualTimespan < nTargetTimespan/4)
743 nActualTimespan = nTargetTimespan/4;
744 if (nActualTimespan > nTargetTimespan*4)
745 nActualTimespan = nTargetTimespan*4;
749 bnNew.SetCompact(pindexLast->nBits);
750 bnNew *= nActualTimespan;
751 bnNew /= nTargetTimespan;
753 if (bnNew > bnProofOfWorkLimit)
754 bnNew = bnProofOfWorkLimit;
757 printf("GetNextWorkRequired RETARGET\n");
758 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
759 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
760 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
762 return bnNew.GetCompact();
765 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
768 bnTarget.SetCompact(nBits);
771 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
772 return error("CheckProofOfWork() : nBits below minimum work");
774 // Check proof of work matches claimed amount
775 if (hash > bnTarget.getuint256())
776 return error("CheckProofOfWork() : hash doesn't match nBits");
781 bool IsInitialBlockDownload()
783 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
785 static int64 nLastUpdate;
786 static CBlockIndex* pindexLastBest;
787 if (pindexBest != pindexLastBest)
789 pindexLastBest = pindexBest;
790 nLastUpdate = GetTime();
792 return (GetTime() - nLastUpdate < 10 &&
793 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
796 void static InvalidChainFound(CBlockIndex* pindexNew)
798 if (pindexNew->bnChainWork > bnBestInvalidWork)
800 bnBestInvalidWork = pindexNew->bnChainWork;
801 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
804 printf("InvalidChainFound: invalid block=%s height=%d work=%s\n", pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight, pindexNew->bnChainWork.ToString().c_str());
805 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
806 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
807 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
810 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
812 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
814 // Updating time can change work required on testnet:
816 nBits = GetNextWorkRequired(pindexPrev, this);
829 bool CTransaction::DisconnectInputs(CTxDB& txdb)
831 // Relinquish previous transactions' spent pointers
834 BOOST_FOREACH(const CTxIn& txin, vin)
836 COutPoint prevout = txin.prevout;
838 // Get prev txindex from disk
840 if (!txdb.ReadTxIndex(prevout.hash, txindex))
841 return error("DisconnectInputs() : ReadTxIndex failed");
843 if (prevout.n >= txindex.vSpent.size())
844 return error("DisconnectInputs() : prevout.n out of range");
846 // Mark outpoint as not spent
847 txindex.vSpent[prevout.n].SetNull();
850 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
851 return error("DisconnectInputs() : UpdateTxIndex failed");
855 // Remove transaction from index
856 // This can fail if a duplicate of this transaction was in a chain that got
857 // reorganized away. This is only possible if this transaction was completely
858 // spent, so erasing it would be a no-op anway.
859 txdb.EraseTxIndex(*this);
865 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
866 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee,
869 // FetchInputs can return false either because we just haven't seen some inputs
870 // (in which case the transaction should be stored as an orphan)
871 // or because the transaction is malformed (in which case the transaction should
872 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
875 // Take over previous transactions' spent pointers
879 for (int i = 0; i < vin.size(); i++)
881 COutPoint prevout = vin[i].prevout;
886 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
888 // Get txindex from current proposed changes
889 txindex = mapTestPool[prevout.hash];
893 // Read txindex from txdb
894 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
896 if (!fFound && (fBlock || fMiner))
897 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());
901 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
903 // Get prev tx from single transactions in memory
904 CRITICAL_BLOCK(cs_mapTransactions)
906 if (!mapTransactions.count(prevout.hash))
907 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
908 txPrev = mapTransactions[prevout.hash];
911 txindex.vSpent.resize(txPrev.vout.size());
915 // Get prev tx from disk
916 if (!txPrev.ReadFromDisk(txindex.pos))
917 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
920 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
922 // Revisit this if/when transaction replacement is implemented and allows
925 return 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());
928 // If prev is coinbase, check that it's matured
929 if (txPrev.IsCoinBase())
930 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
931 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
932 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
935 if (!VerifySignature(txPrev, *this, i))
936 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
938 // Check for conflicts
939 if (!txindex.vSpent[prevout.n].IsNull())
940 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());
942 // Check for negative or overflow input values
943 nValueIn += txPrev.vout[prevout.n].nValue;
944 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
945 return error("ConnectInputs() : txin values out of range");
947 // Mark outpoints as spent
948 txindex.vSpent[prevout.n] = posThisTx;
951 if (fBlock || fMiner)
953 mapTestPool[prevout.hash] = txindex;
957 if (nValueIn < GetValueOut())
958 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
960 // Tally transaction fees
961 int64 nTxFee = nValueIn - GetValueOut();
963 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
964 if (nTxFee < nMinFee)
967 if (!MoneyRange(nFees))
968 return error("ConnectInputs() : nFees out of range");
973 // Add transaction to changes
974 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
978 // Add transaction to test pool
979 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
986 bool CTransaction::ClientConnectInputs()
991 // Take over previous transactions' spent pointers
992 CRITICAL_BLOCK(cs_mapTransactions)
995 for (int i = 0; i < vin.size(); i++)
997 // Get prev tx from single transactions in memory
998 COutPoint prevout = vin[i].prevout;
999 if (!mapTransactions.count(prevout.hash))
1001 CTransaction& txPrev = mapTransactions[prevout.hash];
1003 if (prevout.n >= txPrev.vout.size())
1007 if (!VerifySignature(txPrev, *this, i))
1008 return error("ConnectInputs() : VerifySignature failed");
1010 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1011 ///// this has to go away now that posNext is gone
1012 // // Check for conflicts
1013 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1014 // return error("ConnectInputs() : prev tx already used");
1016 // // Flag outpoints as used
1017 // txPrev.vout[prevout.n].posNext = posThisTx;
1019 nValueIn += txPrev.vout[prevout.n].nValue;
1021 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1022 return error("ClientConnectInputs() : txin values out of range");
1024 if (GetValueOut() > nValueIn)
1034 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1036 // Disconnect in reverse order
1037 for (int i = vtx.size()-1; i >= 0; i--)
1038 if (!vtx[i].DisconnectInputs(txdb))
1041 // Update block index on disk without changing it in memory.
1042 // The memory index structure will be changed after the db commits.
1045 CDiskBlockIndex blockindexPrev(pindex->pprev);
1046 blockindexPrev.hashNext = 0;
1047 if (!txdb.WriteBlockIndex(blockindexPrev))
1048 return error("DisconnectBlock() : WriteBlockIndex failed");
1054 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1056 // Check it again in case a previous version let a bad block in
1060 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1061 // unless those are already completely spent.
1062 // If such overwrites are allowed, coinbases and transactions depending upon those
1063 // can be duplicated to remove the ability to spend the first instance -- even after
1064 // being sent to another address.
1065 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1066 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1067 // already refuses previously-known transaction id's entirely.
1068 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1069 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1070 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1071 BOOST_FOREACH(CTransaction& tx, vtx)
1073 CTxIndex txindexOld;
1074 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1075 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1080 //// issue here: it doesn't know the version
1081 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1083 map<uint256, CTxIndex> mapQueuedChanges;
1085 BOOST_FOREACH(CTransaction& tx, vtx)
1087 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1088 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1091 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false, 0, fInvalid))
1094 // Write queued txindex changes
1095 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1097 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1098 return error("ConnectBlock() : UpdateTxIndex failed");
1101 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1104 // Update block index on disk without changing it in memory.
1105 // The memory index structure will be changed after the db commits.
1108 CDiskBlockIndex blockindexPrev(pindex->pprev);
1109 blockindexPrev.hashNext = pindex->GetBlockHash();
1110 if (!txdb.WriteBlockIndex(blockindexPrev))
1111 return error("ConnectBlock() : WriteBlockIndex failed");
1114 // Watch for transactions paying to me
1115 BOOST_FOREACH(CTransaction& tx, vtx)
1116 SyncWithWallets(tx, this, true);
1121 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1123 printf("REORGANIZE\n");
1126 CBlockIndex* pfork = pindexBest;
1127 CBlockIndex* plonger = pindexNew;
1128 while (pfork != plonger)
1130 while (plonger->nHeight > pfork->nHeight)
1131 if (!(plonger = plonger->pprev))
1132 return error("Reorganize() : plonger->pprev is null");
1133 if (pfork == plonger)
1135 if (!(pfork = pfork->pprev))
1136 return error("Reorganize() : pfork->pprev is null");
1139 // List of what to disconnect
1140 vector<CBlockIndex*> vDisconnect;
1141 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1142 vDisconnect.push_back(pindex);
1144 // List of what to connect
1145 vector<CBlockIndex*> vConnect;
1146 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1147 vConnect.push_back(pindex);
1148 reverse(vConnect.begin(), vConnect.end());
1150 // Disconnect shorter branch
1151 vector<CTransaction> vResurrect;
1152 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1155 if (!block.ReadFromDisk(pindex))
1156 return error("Reorganize() : ReadFromDisk for disconnect failed");
1157 if (!block.DisconnectBlock(txdb, pindex))
1158 return error("Reorganize() : DisconnectBlock failed");
1160 // Queue memory transactions to resurrect
1161 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1162 if (!tx.IsCoinBase())
1163 vResurrect.push_back(tx);
1166 // Connect longer branch
1167 vector<CTransaction> vDelete;
1168 for (int i = 0; i < vConnect.size(); i++)
1170 CBlockIndex* pindex = vConnect[i];
1172 if (!block.ReadFromDisk(pindex))
1173 return error("Reorganize() : ReadFromDisk for connect failed");
1174 if (!block.ConnectBlock(txdb, pindex))
1178 return error("Reorganize() : ConnectBlock failed");
1181 // Queue memory transactions to delete
1182 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1183 vDelete.push_back(tx);
1185 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1186 return error("Reorganize() : WriteHashBestChain failed");
1188 // Make sure it's successfully written to disk before changing memory structure
1189 if (!txdb.TxnCommit())
1190 return error("Reorganize() : TxnCommit failed");
1192 // Disconnect shorter branch
1193 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1195 pindex->pprev->pnext = NULL;
1197 // Connect longer branch
1198 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1200 pindex->pprev->pnext = pindex;
1202 // Resurrect memory transactions that were in the disconnected branch
1203 BOOST_FOREACH(CTransaction& tx, vResurrect)
1204 tx.AcceptToMemoryPool(txdb, false);
1206 // Delete redundant memory transactions that are in the connected branch
1207 BOOST_FOREACH(CTransaction& tx, vDelete)
1208 tx.RemoveFromMemoryPool();
1214 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1216 uint256 hash = GetHash();
1219 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1221 txdb.WriteHashBestChain(hash);
1222 if (!txdb.TxnCommit())
1223 return error("SetBestChain() : TxnCommit failed");
1224 pindexGenesisBlock = pindexNew;
1226 else if (hashPrevBlock == hashBestChain)
1228 // Adding to current best branch
1229 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1232 InvalidChainFound(pindexNew);
1233 return error("SetBestChain() : ConnectBlock failed");
1235 if (!txdb.TxnCommit())
1236 return error("SetBestChain() : TxnCommit failed");
1238 // Add to current best branch
1239 pindexNew->pprev->pnext = pindexNew;
1241 // Delete redundant memory transactions
1242 BOOST_FOREACH(CTransaction& tx, vtx)
1243 tx.RemoveFromMemoryPool();
1248 if (!Reorganize(txdb, pindexNew))
1251 InvalidChainFound(pindexNew);
1252 return error("SetBestChain() : Reorganize failed");
1256 // Update best block in wallet (so we can detect restored wallets)
1257 if (!IsInitialBlockDownload())
1259 const CBlockLocator locator(pindexNew);
1260 ::SetBestChain(locator);
1264 hashBestChain = hash;
1265 pindexBest = pindexNew;
1266 nBestHeight = pindexBest->nHeight;
1267 bnBestChainWork = pindexNew->bnChainWork;
1268 nTimeBestReceived = GetTime();
1269 nTransactionsUpdated++;
1270 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1276 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1278 // Check for duplicate
1279 uint256 hash = GetHash();
1280 if (mapBlockIndex.count(hash))
1281 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1283 // Construct new block index object
1284 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1286 return error("AddToBlockIndex() : new CBlockIndex failed");
1287 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1288 pindexNew->phashBlock = &((*mi).first);
1289 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1290 if (miPrev != mapBlockIndex.end())
1292 pindexNew->pprev = (*miPrev).second;
1293 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1295 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1299 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1300 if (!txdb.TxnCommit())
1304 if (pindexNew->bnChainWork > bnBestChainWork)
1305 if (!SetBestChain(txdb, pindexNew))
1310 if (pindexNew == pindexBest)
1312 // Notify UI to display prev block's coinbase if it was ours
1313 static uint256 hashPrevBestCoinBase;
1314 UpdatedTransaction(hashPrevBestCoinBase);
1315 hashPrevBestCoinBase = vtx[0].GetHash();
1325 bool CBlock::CheckBlock() const
1327 // These are checks that are independent of context
1328 // that can be verified before saving an orphan block.
1331 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1332 return error("CheckBlock() : size limits failed");
1334 // Check proof of work matches claimed amount
1335 if (!CheckProofOfWork(GetHash(), nBits))
1336 return error("CheckBlock() : proof of work failed");
1339 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1340 return error("CheckBlock() : block timestamp too far in the future");
1342 // First transaction must be coinbase, the rest must not be
1343 if (vtx.empty() || !vtx[0].IsCoinBase())
1344 return error("CheckBlock() : first tx is not coinbase");
1345 for (int i = 1; i < vtx.size(); i++)
1346 if (vtx[i].IsCoinBase())
1347 return error("CheckBlock() : more than one coinbase");
1349 // Check transactions
1350 BOOST_FOREACH(const CTransaction& tx, vtx)
1351 if (!tx.CheckTransaction())
1352 return error("CheckBlock() : CheckTransaction failed");
1354 // Check that it's not full of nonstandard transactions
1355 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1356 return error("CheckBlock() : too many nonstandard transactions");
1359 if (hashMerkleRoot != BuildMerkleTree())
1360 return error("CheckBlock() : hashMerkleRoot mismatch");
1365 bool CBlock::AcceptBlock()
1367 // Check for duplicate
1368 uint256 hash = GetHash();
1369 if (mapBlockIndex.count(hash))
1370 return error("AcceptBlock() : block already in mapBlockIndex");
1372 // Get prev block index
1373 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1374 if (mi == mapBlockIndex.end())
1375 return error("AcceptBlock() : prev block not found");
1376 CBlockIndex* pindexPrev = (*mi).second;
1377 int nHeight = pindexPrev->nHeight+1;
1379 // Check proof of work
1380 if (nBits != GetNextWorkRequired(pindexPrev, this))
1381 return error("AcceptBlock() : incorrect proof of work");
1383 // Check timestamp against prev
1384 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1385 return error("AcceptBlock() : block's timestamp is too early");
1387 // Check that all transactions are finalized
1388 BOOST_FOREACH(const CTransaction& tx, vtx)
1389 if (!tx.IsFinal(nHeight, GetBlockTime()))
1390 return error("AcceptBlock() : contains a non-final transaction");
1392 // Check that the block chain matches the known block chain up to a checkpoint
1393 if (!Checkpoints::CheckBlock(nHeight, hash))
1394 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1396 // Write block to history file
1397 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1398 return error("AcceptBlock() : out of disk space");
1399 unsigned int nFile = -1;
1400 unsigned int nBlockPos = 0;
1401 if (!WriteToDisk(nFile, nBlockPos))
1402 return error("AcceptBlock() : WriteToDisk failed");
1403 if (!AddToBlockIndex(nFile, nBlockPos))
1404 return error("AcceptBlock() : AddToBlockIndex failed");
1406 // Relay inventory, but don't relay old inventory during initial block download
1407 if (hashBestChain == hash)
1408 CRITICAL_BLOCK(cs_vNodes)
1409 BOOST_FOREACH(CNode* pnode, vNodes)
1410 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1411 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1416 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1418 // Check for duplicate
1419 uint256 hash = pblock->GetHash();
1420 if (mapBlockIndex.count(hash))
1421 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1422 if (mapOrphanBlocks.count(hash))
1423 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1425 // Preliminary checks
1426 if (!pblock->CheckBlock())
1427 return error("ProcessBlock() : CheckBlock FAILED");
1429 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1430 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1432 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1433 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1436 return error("ProcessBlock() : block with timestamp before last checkpoint");
1439 bnNewBlock.SetCompact(pblock->nBits);
1441 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1442 if (bnNewBlock > bnRequired)
1444 return error("ProcessBlock() : block with too little proof-of-work");
1449 // If don't already have its previous block, shunt it off to holding area until we get it
1450 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1452 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1453 CBlock* pblock2 = new CBlock(*pblock);
1454 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1455 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1457 // Ask this guy to fill in what we're missing
1459 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1464 if (!pblock->AcceptBlock())
1465 return error("ProcessBlock() : AcceptBlock FAILED");
1467 // Recursively process any orphan blocks that depended on this one
1468 vector<uint256> vWorkQueue;
1469 vWorkQueue.push_back(hash);
1470 for (int i = 0; i < vWorkQueue.size(); i++)
1472 uint256 hashPrev = vWorkQueue[i];
1473 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1474 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1477 CBlock* pblockOrphan = (*mi).second;
1478 if (pblockOrphan->AcceptBlock())
1479 vWorkQueue.push_back(pblockOrphan->GetHash());
1480 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1481 delete pblockOrphan;
1483 mapOrphanBlocksByPrev.erase(hashPrev);
1486 printf("ProcessBlock: ACCEPTED\n");
1497 bool CheckDiskSpace(uint64 nAdditionalBytes)
1499 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1501 // Check for 15MB because database could create another 10MB log file at any time
1502 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1505 string strMessage = _("Warning: Disk space is low ");
1506 strMiscWarning = strMessage;
1507 printf("*** %s\n", strMessage.c_str());
1508 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1509 CreateThread(Shutdown, NULL);
1515 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1519 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1522 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1524 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1533 static unsigned int nCurrentBlockFile = 1;
1535 FILE* AppendBlockFile(unsigned int& nFileRet)
1540 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1543 if (fseek(file, 0, SEEK_END) != 0)
1545 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1546 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1548 nFileRet = nCurrentBlockFile;
1552 nCurrentBlockFile++;
1556 bool LoadBlockIndex(bool fAllowNew)
1560 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1561 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1562 pchMessageStart[0] = 0xfa;
1563 pchMessageStart[1] = 0xbf;
1564 pchMessageStart[2] = 0xb5;
1565 pchMessageStart[3] = 0xda;
1572 if (!txdb.LoadBlockIndex())
1577 // Init with genesis block
1579 if (mapBlockIndex.empty())
1585 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1586 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1587 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1588 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1589 // vMerkleTree: 4a5e1e
1592 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1594 txNew.vin.resize(1);
1595 txNew.vout.resize(1);
1596 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1597 txNew.vout[0].nValue = 50 * COIN;
1598 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1600 block.vtx.push_back(txNew);
1601 block.hashPrevBlock = 0;
1602 block.hashMerkleRoot = block.BuildMerkleTree();
1604 block.nTime = 1231006505;
1605 block.nBits = 0x1d00ffff;
1606 block.nNonce = 2083236893;
1610 block.nTime = 1296688602;
1611 block.nBits = 0x1d07fff8;
1612 block.nNonce = 384568319;
1616 printf("%s\n", block.GetHash().ToString().c_str());
1617 printf("%s\n", hashGenesisBlock.ToString().c_str());
1618 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1619 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1621 assert(block.GetHash() == hashGenesisBlock);
1623 // Start new block file
1625 unsigned int nBlockPos;
1626 if (!block.WriteToDisk(nFile, nBlockPos))
1627 return error("LoadBlockIndex() : writing genesis block to disk failed");
1628 if (!block.AddToBlockIndex(nFile, nBlockPos))
1629 return error("LoadBlockIndex() : genesis block not accepted");
1637 void PrintBlockTree()
1639 // precompute tree structure
1640 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1641 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1643 CBlockIndex* pindex = (*mi).second;
1644 mapNext[pindex->pprev].push_back(pindex);
1646 //while (rand() % 3 == 0)
1647 // mapNext[pindex->pprev].push_back(pindex);
1650 vector<pair<int, CBlockIndex*> > vStack;
1651 vStack.push_back(make_pair(0, pindexGenesisBlock));
1654 while (!vStack.empty())
1656 int nCol = vStack.back().first;
1657 CBlockIndex* pindex = vStack.back().second;
1660 // print split or gap
1661 if (nCol > nPrevCol)
1663 for (int i = 0; i < nCol-1; i++)
1667 else if (nCol < nPrevCol)
1669 for (int i = 0; i < nCol; i++)
1676 for (int i = 0; i < nCol; i++)
1681 block.ReadFromDisk(pindex);
1682 printf("%d (%u,%u) %s %s tx %d",
1686 block.GetHash().ToString().substr(0,20).c_str(),
1687 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1690 PrintWallets(block);
1692 // put the main timechain first
1693 vector<CBlockIndex*>& vNext = mapNext[pindex];
1694 for (int i = 0; i < vNext.size(); i++)
1696 if (vNext[i]->pnext)
1698 swap(vNext[0], vNext[i]);
1704 for (int i = 0; i < vNext.size(); i++)
1705 vStack.push_back(make_pair(nCol+i, vNext[i]));
1718 //////////////////////////////////////////////////////////////////////////////
1723 map<uint256, CAlert> mapAlerts;
1724 CCriticalSection cs_mapAlerts;
1726 string GetWarnings(string strFor)
1729 string strStatusBar;
1731 if (GetBoolArg("-testsafemode"))
1734 // Misc warnings like out of disk space and clock is wrong
1735 if (strMiscWarning != "")
1738 strStatusBar = strMiscWarning;
1741 // Longer invalid proof-of-work chain
1742 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1745 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1749 CRITICAL_BLOCK(cs_mapAlerts)
1751 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1753 const CAlert& alert = item.second;
1754 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1756 nPriority = alert.nPriority;
1757 strStatusBar = alert.strStatusBar;
1762 if (strFor == "statusbar")
1763 return strStatusBar;
1764 else if (strFor == "rpc")
1766 assert(!"GetWarnings() : invalid parameter");
1770 bool CAlert::ProcessAlert()
1772 if (!CheckSignature())
1777 CRITICAL_BLOCK(cs_mapAlerts)
1779 // Cancel previous alerts
1780 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1782 const CAlert& alert = (*mi).second;
1785 printf("cancelling alert %d\n", alert.nID);
1786 mapAlerts.erase(mi++);
1788 else if (!alert.IsInEffect())
1790 printf("expiring alert %d\n", alert.nID);
1791 mapAlerts.erase(mi++);
1797 // Check if this alert has been cancelled
1798 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1800 const CAlert& alert = item.second;
1801 if (alert.Cancels(*this))
1803 printf("alert already cancelled by %d\n", alert.nID);
1809 mapAlerts.insert(make_pair(GetHash(), *this));
1812 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1824 //////////////////////////////////////////////////////////////////////////////
1830 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1834 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1835 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1837 // Don't know what it is, just say we already got one
1844 // The message start string is designed to be unlikely to occur in normal data.
1845 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1846 // a large 4-byte int at any alignment.
1847 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1850 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1852 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1853 RandAddSeedPerfmon();
1855 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1856 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1858 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1860 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1868 if (strCommand == "version")
1870 // Each connection can only send one version message
1871 if (pfrom->nVersion != 0)
1878 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1879 if (pfrom->nVersion == 10300)
1880 pfrom->nVersion = 300;
1881 if (pfrom->nVersion >= 106 && !vRecv.empty())
1882 vRecv >> addrFrom >> nNonce;
1883 if (pfrom->nVersion >= 106 && !vRecv.empty())
1884 vRecv >> pfrom->strSubVer;
1885 if (pfrom->nVersion >= 209 && !vRecv.empty())
1886 vRecv >> pfrom->nStartingHeight;
1888 if (pfrom->nVersion == 0)
1891 // Disconnect if we connected to ourself
1892 if (nNonce == nLocalHostNonce && nNonce > 1)
1894 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1895 pfrom->fDisconnect = true;
1899 // Be shy and don't send version until we hear
1900 if (pfrom->fInbound)
1901 pfrom->PushVersion();
1903 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1905 AddTimeData(pfrom->addr.ip, nTime);
1908 if (pfrom->nVersion >= 209)
1909 pfrom->PushMessage("verack");
1910 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1911 if (pfrom->nVersion < 209)
1912 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1914 if (!pfrom->fInbound)
1916 // Advertise our address
1917 if (addrLocalHost.IsRoutable() && !fUseProxy)
1919 CAddress addr(addrLocalHost);
1920 addr.nTime = GetAdjustedTime();
1921 pfrom->PushAddress(addr);
1924 // Get recent addresses
1925 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1927 pfrom->PushMessage("getaddr");
1928 pfrom->fGetAddr = true;
1932 // Ask the first connected node for block updates
1933 static int nAskedForBlocks = 0;
1934 if (!pfrom->fClient &&
1935 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1936 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1939 pfrom->PushGetBlocks(pindexBest, uint256(0));
1943 CRITICAL_BLOCK(cs_mapAlerts)
1944 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1945 item.second.RelayTo(pfrom);
1947 pfrom->fSuccessfullyConnected = true;
1949 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1953 else if (pfrom->nVersion == 0)
1955 // Must have a version message before anything else
1960 else if (strCommand == "verack")
1962 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1966 else if (strCommand == "addr")
1968 vector<CAddress> vAddr;
1971 // Don't want addr from older versions unless seeding
1972 if (pfrom->nVersion < 209)
1974 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1976 if (vAddr.size() > 1000)
1977 return error("message addr size() = %d", vAddr.size());
1979 // Store the new addresses
1982 int64 nNow = GetAdjustedTime();
1983 int64 nSince = nNow - 10 * 60;
1984 BOOST_FOREACH(CAddress& addr, vAddr)
1988 // ignore IPv6 for now, since it isn't implemented anyway
1991 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1992 addr.nTime = nNow - 5 * 24 * 60 * 60;
1993 AddAddress(addr, 2 * 60 * 60, &addrDB);
1994 pfrom->AddAddressKnown(addr);
1995 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1997 // Relay to a limited number of other nodes
1998 CRITICAL_BLOCK(cs_vNodes)
2000 // Use deterministic randomness to send to the same nodes for 24 hours
2001 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2002 static uint256 hashSalt;
2004 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2005 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2006 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2007 multimap<uint256, CNode*> mapMix;
2008 BOOST_FOREACH(CNode* pnode, vNodes)
2010 if (pnode->nVersion < 31402)
2012 unsigned int nPointer;
2013 memcpy(&nPointer, &pnode, sizeof(nPointer));
2014 uint256 hashKey = hashRand ^ nPointer;
2015 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2016 mapMix.insert(make_pair(hashKey, pnode));
2018 int nRelayNodes = 2;
2019 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2020 ((*mi).second)->PushAddress(addr);
2024 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2025 if (vAddr.size() < 1000)
2026 pfrom->fGetAddr = false;
2030 else if (strCommand == "inv")
2034 if (vInv.size() > 50000)
2035 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)
2064 return error("message getdata size() = %d", vInv.size());
2066 BOOST_FOREACH(const CInv& inv, vInv)
2070 printf("received getdata for: %s\n", inv.ToString().c_str());
2072 if (inv.type == MSG_BLOCK)
2074 // Send block from disk
2075 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2076 if (mi != mapBlockIndex.end())
2079 block.ReadFromDisk((*mi).second);
2080 pfrom->PushMessage("block", block);
2082 // Trigger them to send a getblocks request for the next batch of inventory
2083 if (inv.hash == pfrom->hashContinue)
2085 // Bypass PushInventory, this must send even if redundant,
2086 // and we want it right after the last block so they don't
2087 // wait for other stuff first.
2089 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2090 pfrom->PushMessage("inv", vInv);
2091 pfrom->hashContinue = 0;
2095 else if (inv.IsKnownType())
2097 // Send stream from relay memory
2098 CRITICAL_BLOCK(cs_mapRelay)
2100 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2101 if (mi != mapRelay.end())
2102 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2106 // Track requests for our stuff
2107 Inventory(inv.hash);
2112 else if (strCommand == "getblocks")
2114 CBlockLocator locator;
2116 vRecv >> locator >> hashStop;
2118 // Find the last block the caller has in the main chain
2119 CBlockIndex* pindex = locator.GetBlockIndex();
2121 // Send the rest of the chain
2123 pindex = pindex->pnext;
2124 int nLimit = 500 + locator.GetDistanceBack();
2125 unsigned int nBytes = 0;
2126 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2127 for (; pindex; pindex = pindex->pnext)
2129 if (pindex->GetBlockHash() == hashStop)
2131 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2134 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2136 block.ReadFromDisk(pindex, true);
2137 nBytes += block.GetSerializeSize(SER_NETWORK);
2138 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2140 // When this block is requested, we'll send an inv that'll make them
2141 // getblocks the next batch of inventory.
2142 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2143 pfrom->hashContinue = pindex->GetBlockHash();
2150 else if (strCommand == "getheaders")
2152 CBlockLocator locator;
2154 vRecv >> locator >> hashStop;
2156 CBlockIndex* pindex = NULL;
2157 if (locator.IsNull())
2159 // If locator is null, return the hashStop block
2160 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2161 if (mi == mapBlockIndex.end())
2163 pindex = (*mi).second;
2167 // Find the last block the caller has in the main chain
2168 pindex = locator.GetBlockIndex();
2170 pindex = pindex->pnext;
2173 vector<CBlock> vHeaders;
2174 int nLimit = 2000 + locator.GetDistanceBack();
2175 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2176 for (; pindex; pindex = pindex->pnext)
2178 vHeaders.push_back(pindex->GetBlockHeader());
2179 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2182 pfrom->PushMessage("headers", vHeaders);
2186 else if (strCommand == "tx")
2188 vector<uint256> vWorkQueue;
2189 CDataStream vMsg(vRecv);
2193 CInv inv(MSG_TX, tx.GetHash());
2194 pfrom->AddInventoryKnown(inv);
2196 bool fMissingInputs = false;
2197 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2199 SyncWithWallets(tx, NULL, true);
2200 RelayMessage(inv, vMsg);
2201 mapAlreadyAskedFor.erase(inv);
2202 vWorkQueue.push_back(inv.hash);
2204 // Recursively process any orphan transactions that depended on this one
2205 for (int i = 0; i < vWorkQueue.size(); i++)
2207 uint256 hashPrev = vWorkQueue[i];
2208 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2209 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2212 const CDataStream& vMsg = *((*mi).second);
2214 CDataStream(vMsg) >> tx;
2215 CInv inv(MSG_TX, tx.GetHash());
2217 if (tx.AcceptToMemoryPool(true))
2219 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2220 SyncWithWallets(tx, NULL, true);
2221 RelayMessage(inv, vMsg);
2222 mapAlreadyAskedFor.erase(inv);
2223 vWorkQueue.push_back(inv.hash);
2228 BOOST_FOREACH(uint256 hash, vWorkQueue)
2229 EraseOrphanTx(hash);
2231 else if (fMissingInputs)
2233 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2236 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2237 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2239 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2244 else if (strCommand == "block")
2249 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2252 CInv inv(MSG_BLOCK, block.GetHash());
2253 pfrom->AddInventoryKnown(inv);
2255 if (ProcessBlock(pfrom, &block))
2256 mapAlreadyAskedFor.erase(inv);
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 using CryptoPP::ByteReverse;
2702 static const unsigned int pSHA256InitState[8] =
2703 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2705 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2707 memcpy(pstate, pinit, 32);
2708 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2712 // ScanHash scans nonces looking for a hash with at least some zero bits.
2713 // It operates on big endian data. Caller does the byte reversing.
2714 // All input buffers are 16-byte aligned. nNonce is usually preserved
2715 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2716 // the block is rebuilt and nNonce starts over at zero.
2718 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2720 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2724 // Hash pdata using pmidstate as the starting state into
2725 // preformatted buffer phash1, then hash phash1 into phash
2727 SHA256Transform(phash1, pdata, pmidstate);
2728 SHA256Transform(phash, phash1, pSHA256InitState);
2730 // Return the nonce if the hash has at least some zero bits,
2731 // caller will check if it has enough to reach the target
2732 if (((unsigned short*)phash)[14] == 0)
2735 // If nothing found after trying for a while, return -1
2736 if ((nNonce & 0xffff) == 0)
2738 nHashesDone = 0xffff+1;
2744 // Some explaining would be appreciated
2749 set<uint256> setDependsOn;
2752 COrphan(CTransaction* ptxIn)
2760 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2761 BOOST_FOREACH(uint256 hash, setDependsOn)
2762 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2767 CBlock* CreateNewBlock(CReserveKey& reservekey)
2769 CBlockIndex* pindexPrev = pindexBest;
2772 auto_ptr<CBlock> pblock(new CBlock());
2776 // Create coinbase tx
2778 txNew.vin.resize(1);
2779 txNew.vin[0].prevout.SetNull();
2780 txNew.vout.resize(1);
2781 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2783 // Add our coinbase tx as first transaction
2784 pblock->vtx.push_back(txNew);
2786 // Collect memory pool transactions into the block
2788 CRITICAL_BLOCK(cs_main)
2789 CRITICAL_BLOCK(cs_mapTransactions)
2793 // Priority order to process transactions
2794 list<COrphan> vOrphan; // list memory doesn't move
2795 map<uint256, vector<COrphan*> > mapDependers;
2796 multimap<double, CTransaction*> mapPriority;
2797 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2799 CTransaction& tx = (*mi).second;
2800 if (tx.IsCoinBase() || !tx.IsFinal())
2803 COrphan* porphan = NULL;
2804 double dPriority = 0;
2805 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2807 // Read prev transaction
2808 CTransaction txPrev;
2810 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2812 // Has to wait for dependencies
2815 // Use list for automatic deletion
2816 vOrphan.push_back(COrphan(&tx));
2817 porphan = &vOrphan.back();
2819 mapDependers[txin.prevout.hash].push_back(porphan);
2820 porphan->setDependsOn.insert(txin.prevout.hash);
2823 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2825 // Read block header
2826 int nConf = txindex.GetDepthInMainChain();
2828 dPriority += (double)nValueIn * nConf;
2830 if (fDebug && GetBoolArg("-printpriority"))
2831 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2834 // Priority is sum(valuein * age) / txsize
2835 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2838 porphan->dPriority = dPriority;
2840 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2842 if (fDebug && GetBoolArg("-printpriority"))
2844 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2851 // Collect transactions into block
2852 map<uint256, CTxIndex> mapTestPool;
2853 uint64 nBlockSize = 1000;
2854 int nBlockSigOps = 100;
2855 while (!mapPriority.empty())
2857 // Take highest priority transaction off priority queue
2858 double dPriority = -(*mapPriority.begin()).first;
2859 CTransaction& tx = *(*mapPriority.begin()).second;
2860 mapPriority.erase(mapPriority.begin());
2863 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2864 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2866 int nTxSigOps = tx.GetSigOpCount();
2867 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2870 // Transaction fee required depends on block size
2871 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2872 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
2874 // Connecting shouldn't fail due to dependency on other memory pool transactions
2875 // because we're already processing them in order of dependency
2876 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2878 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee, fInvalid))
2880 swap(mapTestPool, mapTestPoolTmp);
2883 pblock->vtx.push_back(tx);
2884 nBlockSize += nTxSize;
2885 nBlockSigOps += nTxSigOps;
2887 // Add transactions that depend on this one to the priority queue
2888 uint256 hash = tx.GetHash();
2889 if (mapDependers.count(hash))
2891 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2893 if (!porphan->setDependsOn.empty())
2895 porphan->setDependsOn.erase(hash);
2896 if (porphan->setDependsOn.empty())
2897 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2903 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2906 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2907 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2908 pblock->UpdateTime(pindexPrev);
2909 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
2912 return pblock.release();
2916 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2918 // Update nExtraNonce
2919 static uint256 hashPrevBlock;
2920 if (hashPrevBlock != pblock->hashPrevBlock)
2923 hashPrevBlock = pblock->hashPrevBlock;
2926 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2927 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2931 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2934 // Prebuild hash buffers
2941 uint256 hashPrevBlock;
2942 uint256 hashMerkleRoot;
2945 unsigned int nNonce;
2948 unsigned char pchPadding0[64];
2950 unsigned char pchPadding1[64];
2953 memset(&tmp, 0, sizeof(tmp));
2955 tmp.block.nVersion = pblock->nVersion;
2956 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2957 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2958 tmp.block.nTime = pblock->nTime;
2959 tmp.block.nBits = pblock->nBits;
2960 tmp.block.nNonce = pblock->nNonce;
2962 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2963 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2965 // Byte swap all the input buffer
2966 for (int i = 0; i < sizeof(tmp)/4; i++)
2967 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2969 // Precalc the first half of the first hash, which stays constant
2970 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2972 memcpy(pdata, &tmp.block, 128);
2973 memcpy(phash1, &tmp.hash1, 64);
2977 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2979 uint256 hash = pblock->GetHash();
2980 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2982 if (hash > hashTarget)
2986 printf("BitcoinMiner:\n");
2987 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2989 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2990 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2993 CRITICAL_BLOCK(cs_main)
2995 if (pblock->hashPrevBlock != hashBestChain)
2996 return error("BitcoinMiner : generated block is stale");
2998 // Remove key from key pool
2999 reservekey.KeepKey();
3001 // Track how many getdata requests this block gets
3002 CRITICAL_BLOCK(wallet.cs_wallet)
3003 wallet.mapRequestCount[pblock->GetHash()] = 0;
3005 // Process this block the same as if we had received it from another node
3006 if (!ProcessBlock(NULL, pblock))
3007 return error("BitcoinMiner : ProcessBlock, block not accepted");
3014 void static ThreadBitcoinMiner(void* parg);
3016 void static BitcoinMiner(CWallet *pwallet)
3018 printf("BitcoinMiner started\n");
3019 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3021 // Each thread has its own key and counter
3022 CReserveKey reservekey(pwallet);
3023 unsigned int nExtraNonce = 0;
3025 while (fGenerateBitcoins)
3027 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3031 while (vNodes.empty() || IsInitialBlockDownload())
3036 if (!fGenerateBitcoins)
3044 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3045 CBlockIndex* pindexPrev = pindexBest;
3047 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3050 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3052 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3056 // Prebuild hash buffers
3058 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3059 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3060 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3062 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3064 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3065 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3066 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3072 int64 nStart = GetTime();
3073 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3075 uint256& hash = *alignup<16>(hashbuf);
3078 unsigned int nHashesDone = 0;
3079 unsigned int nNonceFound;
3082 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3083 (char*)&hash, nHashesDone);
3085 // Check if something found
3086 if (nNonceFound != -1)
3088 for (int i = 0; i < sizeof(hash)/4; i++)
3089 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3091 if (hash <= hashTarget)
3094 pblock->nNonce = ByteReverse(nNonceFound);
3095 assert(hash == pblock->GetHash());
3097 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3098 CheckWork(pblock.get(), *pwalletMain, reservekey);
3099 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3105 static int64 nHashCounter;
3106 if (nHPSTimerStart == 0)
3108 nHPSTimerStart = GetTimeMillis();
3112 nHashCounter += nHashesDone;
3113 if (GetTimeMillis() - nHPSTimerStart > 4000)
3115 static CCriticalSection cs;
3118 if (GetTimeMillis() - nHPSTimerStart > 4000)
3120 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3121 nHPSTimerStart = GetTimeMillis();
3123 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3124 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3125 static int64 nLogTime;
3126 if (GetTime() - nLogTime > 30 * 60)
3128 nLogTime = GetTime();
3129 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3130 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3136 // Check for stop or if block needs to be rebuilt
3139 if (!fGenerateBitcoins)
3141 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3145 if (nBlockNonce >= 0xffff0000)
3147 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3149 if (pindexPrev != pindexBest)
3152 // Update nTime every few seconds
3153 pblock->UpdateTime(pindexPrev);
3154 nBlockTime = ByteReverse(pblock->nTime);
3157 // Changing pblock->nTime can change work required on testnet:
3158 nBlockBits = ByteReverse(pblock->nBits);
3159 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3165 void static ThreadBitcoinMiner(void* parg)
3167 CWallet* pwallet = (CWallet*)parg;
3170 vnThreadsRunning[3]++;
3171 BitcoinMiner(pwallet);
3172 vnThreadsRunning[3]--;
3174 catch (std::exception& e) {
3175 vnThreadsRunning[3]--;
3176 PrintException(&e, "ThreadBitcoinMiner()");
3178 vnThreadsRunning[3]--;
3179 PrintException(NULL, "ThreadBitcoinMiner()");
3181 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3183 if (vnThreadsRunning[3] == 0)
3185 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3189 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3191 if (fGenerateBitcoins != fGenerate)
3193 fGenerateBitcoins = fGenerate;
3194 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3197 if (fGenerateBitcoins)
3199 int nProcessors = boost::thread::hardware_concurrency();
3200 printf("%d processors\n", nProcessors);
3201 if (nProcessors < 1)
3203 if (fLimitProcessors && nProcessors > nLimitProcessors)
3204 nProcessors = nLimitProcessors;
3205 int nAddThreads = nProcessors - vnThreadsRunning[3];
3206 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3207 for (int i = 0; i < nAddThreads; i++)
3209 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3210 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");