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 <boost/filesystem.hpp>
11 #include <boost/filesystem/fstream.hpp>
14 using namespace boost;
20 CCriticalSection cs_setpwalletRegistered;
21 set<CWallet*> setpwalletRegistered;
23 CCriticalSection cs_main;
25 static map<uint256, CTransaction> mapTransactions;
26 CCriticalSection cs_mapTransactions;
27 unsigned int nTransactionsUpdated = 0;
28 map<COutPoint, CInPoint> mapNextTx;
30 map<uint256, CBlockIndex*> mapBlockIndex;
31 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
32 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 CBlockIndex* pindexGenesisBlock = NULL;
35 CBigNum bnBestChainWork = 0;
36 CBigNum bnBestInvalidWork = 0;
37 uint256 hashBestChain = 0;
38 CBlockIndex* pindexBest = NULL;
39 int64 nTimeBestReceived = 0;
41 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
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;
67 //////////////////////////////////////////////////////////////////////////////
69 // dispatching functions
72 // These functions dispatch to one or all registered wallets
75 void RegisterWallet(CWallet* pwalletIn)
77 CRITICAL_BLOCK(cs_setpwalletRegistered)
79 setpwalletRegistered.insert(pwalletIn);
83 void UnregisterWallet(CWallet* pwalletIn)
85 CRITICAL_BLOCK(cs_setpwalletRegistered)
87 setpwalletRegistered.erase(pwalletIn);
91 // check whether the passed transaction is from us
92 bool static IsFromMe(CTransaction& tx)
94 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
95 if (pwallet->IsFromMe(tx))
100 // get the wallet transaction with the given hash (if it exists)
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 // erases transaction with the given hash from all wallets
110 void static EraseFromWallets(uint256 hash)
112 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
113 pwallet->EraseFromWallet(hash);
116 // make sure all wallets know about the given transaction, in the given block
117 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
119 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
120 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
123 // notify wallets about a new best chain
124 void static SetBestChain(const CBlockLocator& loc)
126 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
127 pwallet->SetBestChain(loc);
130 // notify wallets about an updated transaction
131 void static UpdatedTransaction(const uint256& hashTx)
133 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
134 pwallet->UpdatedTransaction(hashTx);
138 void static PrintWallets(const CBlock& block)
140 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
141 pwallet->PrintWallet(block);
144 // notify wallets about an incoming inventory (for request counts)
145 void static Inventory(const uint256& hash)
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->Inventory(hash);
151 // ask wallets to resend their transactions
152 void static ResendWalletTransactions()
154 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
155 pwallet->ResendWalletTransactions();
164 //////////////////////////////////////////////////////////////////////////////
166 // mapOrphanTransactions
169 void static AddOrphanTx(const CDataStream& vMsg)
172 CDataStream(vMsg) >> tx;
173 uint256 hash = tx.GetHash();
174 if (mapOrphanTransactions.count(hash))
176 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
177 BOOST_FOREACH(const CTxIn& txin, tx.vin)
178 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
181 void static EraseOrphanTx(uint256 hash)
183 if (!mapOrphanTransactions.count(hash))
185 const CDataStream* pvMsg = mapOrphanTransactions[hash];
187 CDataStream(*pvMsg) >> tx;
188 BOOST_FOREACH(const CTxIn& txin, tx.vin)
190 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
191 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
193 if ((*mi).second == pvMsg)
194 mapOrphanTransactionsByPrev.erase(mi++);
200 mapOrphanTransactions.erase(hash);
210 //////////////////////////////////////////////////////////////////////////////
212 // CTransaction and CTxIndex
215 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
218 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
220 if (!ReadFromDisk(txindexRet.pos))
222 if (prevout.n >= vout.size())
230 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
233 return ReadFromDisk(txdb, prevout, txindex);
236 bool CTransaction::ReadFromDisk(COutPoint prevout)
240 return ReadFromDisk(txdb, prevout, txindex);
245 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
257 // Load the block this tx is in
259 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
261 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
266 // Update the tx's hashBlock
267 hashBlock = pblock->GetHash();
269 // Locate the transaction
270 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
271 if (pblock->vtx[nIndex] == *(CTransaction*)this)
273 if (nIndex == pblock->vtx.size())
275 vMerkleBranch.clear();
277 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
281 // Fill in merkle branch
282 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
285 // Is the tx in a block that's in the main chain
286 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
287 if (mi == mapBlockIndex.end())
289 CBlockIndex* pindex = (*mi).second;
290 if (!pindex || !pindex->IsInMainChain())
293 return pindexBest->nHeight - pindex->nHeight + 1;
302 bool CTransaction::CheckTransaction() const
304 // Basic checks that don't depend on any context
306 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
308 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
310 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
311 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
313 // Check for negative or overflow output values
315 BOOST_FOREACH(const CTxOut& txout, vout)
317 if (txout.nValue < 0)
318 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
319 if (txout.nValue > MAX_MONEY)
320 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
321 nValueOut += txout.nValue;
322 if (!MoneyRange(nValueOut))
323 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
326 // Check for duplicate inputs
327 set<COutPoint> vInOutPoints;
328 BOOST_FOREACH(const CTxIn& txin, vin)
330 if (vInOutPoints.count(txin.prevout))
332 vInOutPoints.insert(txin.prevout);
337 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
338 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
342 BOOST_FOREACH(const CTxIn& txin, vin)
343 if (txin.prevout.IsNull())
344 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
350 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
353 *pfMissingInputs = false;
355 if (!CheckTransaction())
356 return error("AcceptToMemoryPool() : CheckTransaction failed");
358 // Coinbase is only valid in a block, not as a loose transaction
360 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
362 // To help v0.1.5 clients who would see it as a negative number
363 if ((int64)nLockTime > INT_MAX)
364 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
367 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
368 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
369 // attacks disallow transactions with more than one SigOp per 34 bytes.
370 // 34 bytes because a TxOut is:
371 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
372 if (GetSigOpCount() > nSize / 34 || nSize < 100)
373 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
375 // Rather not work on nonstandard transactions (unless -testnet)
376 if (!fTestNet && !IsStandard())
377 return error("AcceptToMemoryPool() : nonstandard transaction type");
379 // Do we already have it?
380 uint256 hash = GetHash();
381 CRITICAL_BLOCK(cs_mapTransactions)
382 if (mapTransactions.count(hash))
385 if (txdb.ContainsTx(hash))
388 // Check for conflicts with in-memory transactions
389 CTransaction* ptxOld = NULL;
390 for (int i = 0; i < vin.size(); i++)
392 COutPoint outpoint = vin[i].prevout;
393 if (mapNextTx.count(outpoint))
395 // Disable replacement feature for now
398 // Allow replacing with a newer version of the same transaction
401 ptxOld = mapNextTx[outpoint].ptx;
402 if (ptxOld->IsFinal())
404 if (!IsNewerThan(*ptxOld))
406 for (int i = 0; i < vin.size(); i++)
408 COutPoint outpoint = vin[i].prevout;
409 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
418 // Check against previous transactions
419 map<uint256, CTxIndex> mapUnused;
421 bool fInvalid = false;
422 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false, 0, fInvalid))
425 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
426 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
429 // Don't accept it if it can't get into a block
430 if (nFees < GetMinFee(1000, true, true))
431 return error("AcceptToMemoryPool() : not enough fees");
433 // Continuously rate-limit free transactions
434 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
435 // be annoying or make other's transactions take longer to confirm.
436 if (nFees < MIN_RELAY_TX_FEE)
438 static CCriticalSection cs;
439 static double dFreeCount;
440 static int64 nLastTime;
441 int64 nNow = GetTime();
445 // Use an exponentially decaying ~10-minute window:
446 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
448 // -limitfreerelay unit is thousand-bytes-per-minute
449 // At default rate it would take over a month to fill 1GB
450 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
451 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
453 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
459 // Store transaction in memory
460 CRITICAL_BLOCK(cs_mapTransactions)
464 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
465 ptxOld->RemoveFromMemoryPool();
467 AddToMemoryPoolUnchecked();
470 ///// are we sure this is ok when loading transactions or restoring block txes
471 // If updated, erase old tx from wallet
473 EraseFromWallets(ptxOld->GetHash());
475 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
479 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
482 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
485 bool CTransaction::AddToMemoryPoolUnchecked()
487 // Add to memory pool without checking anything. Don't call this directly,
488 // call AcceptToMemoryPool to properly check the transaction first.
489 CRITICAL_BLOCK(cs_mapTransactions)
491 uint256 hash = GetHash();
492 mapTransactions[hash] = *this;
493 for (int i = 0; i < vin.size(); i++)
494 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
495 nTransactionsUpdated++;
501 bool CTransaction::RemoveFromMemoryPool()
503 // Remove transaction from memory pool
504 CRITICAL_BLOCK(cs_mapTransactions)
506 BOOST_FOREACH(const CTxIn& txin, vin)
507 mapNextTx.erase(txin.prevout);
508 mapTransactions.erase(GetHash());
509 nTransactionsUpdated++;
519 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
521 if (hashBlock == 0 || nIndex == -1)
524 // Find the block it claims to be in
525 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
526 if (mi == mapBlockIndex.end())
528 CBlockIndex* pindex = (*mi).second;
529 if (!pindex || !pindex->IsInMainChain())
532 // Make sure the merkle branch connects to this block
533 if (!fMerkleVerified)
535 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
537 fMerkleVerified = true;
540 nHeightRet = pindex->nHeight;
541 return pindexBest->nHeight - pindex->nHeight + 1;
545 int CMerkleTx::GetBlocksToMaturity() const
549 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
553 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
557 if (!IsInMainChain() && !ClientConnectInputs())
559 return CTransaction::AcceptToMemoryPool(txdb, false);
563 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
567 bool CMerkleTx::AcceptToMemoryPool()
570 return AcceptToMemoryPool(txdb);
575 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
577 CRITICAL_BLOCK(cs_mapTransactions)
579 // Add previous supporting transactions first
580 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
582 if (!tx.IsCoinBase())
584 uint256 hash = tx.GetHash();
585 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
586 tx.AcceptToMemoryPool(txdb, fCheckInputs);
589 return AcceptToMemoryPool(txdb, fCheckInputs);
594 bool CWalletTx::AcceptWalletTransaction()
597 return AcceptWalletTransaction(txdb);
600 int CTxIndex::GetDepthInMainChain() const
604 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
606 // Find the block in the index
607 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
608 if (mi == mapBlockIndex.end())
610 CBlockIndex* pindex = (*mi).second;
611 if (!pindex || !pindex->IsInMainChain())
613 return 1 + nBestHeight - pindex->nHeight;
625 //////////////////////////////////////////////////////////////////////////////
627 // CBlock and CBlockIndex
630 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
632 if (!fReadTransactions)
634 *this = pindex->GetBlockHeader();
637 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
639 if (GetHash() != pindex->GetBlockHash())
640 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
644 uint256 static GetOrphanRoot(const CBlock* pblock)
646 // Work back to the first block in the orphan chain
647 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
648 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
649 return pblock->GetHash();
652 int64 static GetBlockValue(int nHeight, int64 nFees)
654 int64 nSubsidy = 50 * COIN;
656 // Subsidy is cut in half every 4 years
657 nSubsidy >>= (nHeight / 210000);
659 return nSubsidy + nFees;
662 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
663 static const int64 nTargetSpacing = 10 * 60;
664 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
667 // minimum amount of work that could possibly be required nTime after
668 // minimum work required was nBase
670 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
672 // Testnet has min-difficulty blocks
673 // after nTargetSpacing*2 time between blocks:
674 if (fTestNet && nTime > nTargetSpacing*2)
675 return bnProofOfWorkLimit.GetCompact();
678 bnResult.SetCompact(nBase);
679 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
681 // Maximum 400% adjustment...
683 // ... in best-case exactly 4-times-normal target time
684 nTime -= nTargetTimespan*4;
686 if (bnResult > bnProofOfWorkLimit)
687 bnResult = bnProofOfWorkLimit;
688 return bnResult.GetCompact();
691 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
693 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
696 if (pindexLast == NULL)
697 return nProofOfWorkLimit;
699 // Only change once per interval
700 if ((pindexLast->nHeight+1) % nInterval != 0)
702 // Special rules for testnet after 15 Feb 2012:
703 if (fTestNet && pblock->nTime > 1329264000)
705 // If the new block's timestamp is more than 2* 10 minutes
706 // then allow mining of a min-difficulty block.
707 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
708 return nProofOfWorkLimit;
711 // Return the last non-special-min-difficulty-rules-block
712 const CBlockIndex* pindex = pindexLast;
713 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
714 pindex = pindex->pprev;
715 return pindex->nBits;
719 return pindexLast->nBits;
722 // Go back by what we want to be 14 days worth of blocks
723 const CBlockIndex* pindexFirst = pindexLast;
724 for (int i = 0; pindexFirst && i < nInterval-1; i++)
725 pindexFirst = pindexFirst->pprev;
728 // Limit adjustment step
729 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
730 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
731 if (nActualTimespan < nTargetTimespan/4)
732 nActualTimespan = nTargetTimespan/4;
733 if (nActualTimespan > nTargetTimespan*4)
734 nActualTimespan = nTargetTimespan*4;
738 bnNew.SetCompact(pindexLast->nBits);
739 bnNew *= nActualTimespan;
740 bnNew /= nTargetTimespan;
742 if (bnNew > bnProofOfWorkLimit)
743 bnNew = bnProofOfWorkLimit;
746 printf("GetNextWorkRequired RETARGET\n");
747 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
748 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
749 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
751 return bnNew.GetCompact();
754 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
757 bnTarget.SetCompact(nBits);
760 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
761 return error("CheckProofOfWork() : nBits below minimum work");
763 // Check proof of work matches claimed amount
764 if (hash > bnTarget.getuint256())
765 return error("CheckProofOfWork() : hash doesn't match nBits");
770 // Return maximum amount of blocks that other nodes claim to have
771 int GetNumBlocksOfPeers()
773 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
776 bool IsInitialBlockDownload()
778 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
780 static int64 nLastUpdate;
781 static CBlockIndex* pindexLastBest;
782 if (pindexBest != pindexLastBest)
784 pindexLastBest = pindexBest;
785 nLastUpdate = GetTime();
787 return (GetTime() - nLastUpdate < 10 &&
788 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
791 void static InvalidChainFound(CBlockIndex* pindexNew)
793 if (pindexNew->bnChainWork > bnBestInvalidWork)
795 bnBestInvalidWork = pindexNew->bnChainWork;
796 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
799 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());
800 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
801 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
802 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
815 bool CTransaction::DisconnectInputs(CTxDB& txdb)
817 // Relinquish previous transactions' spent pointers
820 BOOST_FOREACH(const CTxIn& txin, vin)
822 COutPoint prevout = txin.prevout;
824 // Get prev txindex from disk
826 if (!txdb.ReadTxIndex(prevout.hash, txindex))
827 return error("DisconnectInputs() : ReadTxIndex failed");
829 if (prevout.n >= txindex.vSpent.size())
830 return error("DisconnectInputs() : prevout.n out of range");
832 // Mark outpoint as not spent
833 txindex.vSpent[prevout.n].SetNull();
836 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
837 return error("DisconnectInputs() : UpdateTxIndex failed");
841 // Remove transaction from index
842 if (!txdb.EraseTxIndex(*this))
843 return error("DisconnectInputs() : EraseTxPos failed");
849 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
850 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee,
853 // FetchInputs can return false either because we just haven't seen some inputs
854 // (in which case the transaction should be stored as an orphan)
855 // or because the transaction is malformed (in which case the transaction should
856 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
859 // Take over previous transactions' spent pointers
860 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
861 // fMiner is true when called from the internal bitcoin miner
862 // ... both are false when called from CTransaction::AcceptToMemoryPool
866 for (int i = 0; i < vin.size(); i++)
868 COutPoint prevout = vin[i].prevout;
873 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
875 // Get txindex from current proposed changes
876 txindex = mapTestPool[prevout.hash];
880 // Read txindex from txdb
881 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
883 if (!fFound && (fBlock || fMiner))
884 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());
888 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
890 // Get prev tx from single transactions in memory
891 CRITICAL_BLOCK(cs_mapTransactions)
893 if (!mapTransactions.count(prevout.hash))
894 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
895 txPrev = mapTransactions[prevout.hash];
898 txindex.vSpent.resize(txPrev.vout.size());
902 // Get prev tx from disk
903 if (!txPrev.ReadFromDisk(txindex.pos))
904 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
907 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
909 // Revisit this if/when transaction replacement is implemented and allows
912 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()));
915 // If prev is coinbase, check that it's matured
916 if (txPrev.IsCoinBase())
917 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
918 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
919 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
921 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
922 // before the last blockchain checkpoint. This is safe because block merkle hashes are
923 // still computed and checked, and any change will be caught at the next checkpoint.
924 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
926 if (!VerifySignature(txPrev, *this, i))
927 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
929 // Check for conflicts (double-spend)
930 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
931 // for an attacker to attempt to split the network.
932 if (!txindex.vSpent[prevout.n].IsNull())
933 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());
935 // Check for negative or overflow input values
936 nValueIn += txPrev.vout[prevout.n].nValue;
937 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
938 return DoS(100, error("ConnectInputs() : txin values out of range"));
940 // Mark outpoints as spent
941 txindex.vSpent[prevout.n] = posThisTx;
944 if (fBlock || fMiner)
946 mapTestPool[prevout.hash] = txindex;
950 if (nValueIn < GetValueOut())
951 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
953 // Tally transaction fees
954 int64 nTxFee = nValueIn - GetValueOut();
956 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
957 if (nTxFee < nMinFee)
960 if (!MoneyRange(nFees))
961 return DoS(100, error("ConnectInputs() : nFees out of range"));
966 // Add transaction to changes
967 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
971 // Add transaction to test pool
972 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
979 bool CTransaction::ClientConnectInputs()
984 // Take over previous transactions' spent pointers
985 CRITICAL_BLOCK(cs_mapTransactions)
988 for (int i = 0; i < vin.size(); i++)
990 // Get prev tx from single transactions in memory
991 COutPoint prevout = vin[i].prevout;
992 if (!mapTransactions.count(prevout.hash))
994 CTransaction& txPrev = mapTransactions[prevout.hash];
996 if (prevout.n >= txPrev.vout.size())
1000 if (!VerifySignature(txPrev, *this, i))
1001 return error("ConnectInputs() : VerifySignature failed");
1003 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1004 ///// this has to go away now that posNext is gone
1005 // // Check for conflicts
1006 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1007 // return error("ConnectInputs() : prev tx already used");
1009 // // Flag outpoints as used
1010 // txPrev.vout[prevout.n].posNext = posThisTx;
1012 nValueIn += txPrev.vout[prevout.n].nValue;
1014 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1015 return error("ClientConnectInputs() : txin values out of range");
1017 if (GetValueOut() > nValueIn)
1027 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1029 // Disconnect in reverse order
1030 for (int i = vtx.size()-1; i >= 0; i--)
1031 if (!vtx[i].DisconnectInputs(txdb))
1034 // Update block index on disk without changing it in memory.
1035 // The memory index structure will be changed after the db commits.
1038 CDiskBlockIndex blockindexPrev(pindex->pprev);
1039 blockindexPrev.hashNext = 0;
1040 if (!txdb.WriteBlockIndex(blockindexPrev))
1041 return error("DisconnectBlock() : WriteBlockIndex failed");
1047 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1049 // Check it again in case a previous version let a bad block in
1053 //// issue here: it doesn't know the version
1054 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1056 map<uint256, CTxIndex> mapQueuedChanges;
1058 BOOST_FOREACH(CTransaction& tx, vtx)
1060 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1061 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1064 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false, 0, fInvalid))
1067 // Write queued txindex changes
1068 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1070 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1071 return error("ConnectBlock() : UpdateTxIndex failed");
1074 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1077 // Update block index on disk without changing it in memory.
1078 // The memory index structure will be changed after the db commits.
1081 CDiskBlockIndex blockindexPrev(pindex->pprev);
1082 blockindexPrev.hashNext = pindex->GetBlockHash();
1083 if (!txdb.WriteBlockIndex(blockindexPrev))
1084 return error("ConnectBlock() : WriteBlockIndex failed");
1087 // Watch for transactions paying to me
1088 BOOST_FOREACH(CTransaction& tx, vtx)
1089 SyncWithWallets(tx, this, true);
1094 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1096 printf("REORGANIZE\n");
1099 CBlockIndex* pfork = pindexBest;
1100 CBlockIndex* plonger = pindexNew;
1101 while (pfork != plonger)
1103 while (plonger->nHeight > pfork->nHeight)
1104 if (!(plonger = plonger->pprev))
1105 return error("Reorganize() : plonger->pprev is null");
1106 if (pfork == plonger)
1108 if (!(pfork = pfork->pprev))
1109 return error("Reorganize() : pfork->pprev is null");
1112 // List of what to disconnect
1113 vector<CBlockIndex*> vDisconnect;
1114 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1115 vDisconnect.push_back(pindex);
1117 // List of what to connect
1118 vector<CBlockIndex*> vConnect;
1119 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1120 vConnect.push_back(pindex);
1121 reverse(vConnect.begin(), vConnect.end());
1123 // Disconnect shorter branch
1124 vector<CTransaction> vResurrect;
1125 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1128 if (!block.ReadFromDisk(pindex))
1129 return error("Reorganize() : ReadFromDisk for disconnect failed");
1130 if (!block.DisconnectBlock(txdb, pindex))
1131 return error("Reorganize() : DisconnectBlock failed");
1133 // Queue memory transactions to resurrect
1134 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1135 if (!tx.IsCoinBase())
1136 vResurrect.push_back(tx);
1139 // Connect longer branch
1140 vector<CTransaction> vDelete;
1141 for (int i = 0; i < vConnect.size(); i++)
1143 CBlockIndex* pindex = vConnect[i];
1145 if (!block.ReadFromDisk(pindex))
1146 return error("Reorganize() : ReadFromDisk for connect failed");
1147 if (!block.ConnectBlock(txdb, pindex))
1151 return error("Reorganize() : ConnectBlock failed");
1154 // Queue memory transactions to delete
1155 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1156 vDelete.push_back(tx);
1158 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1159 return error("Reorganize() : WriteHashBestChain failed");
1161 // Make sure it's successfully written to disk before changing memory structure
1162 if (!txdb.TxnCommit())
1163 return error("Reorganize() : TxnCommit failed");
1165 // Disconnect shorter branch
1166 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1168 pindex->pprev->pnext = NULL;
1170 // Connect longer branch
1171 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1173 pindex->pprev->pnext = pindex;
1175 // Resurrect memory transactions that were in the disconnected branch
1176 BOOST_FOREACH(CTransaction& tx, vResurrect)
1177 tx.AcceptToMemoryPool(txdb, false);
1179 // Delete redundant memory transactions that are in the connected branch
1180 BOOST_FOREACH(CTransaction& tx, vDelete)
1181 tx.RemoveFromMemoryPool();
1187 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1189 uint256 hash = GetHash();
1192 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1194 txdb.WriteHashBestChain(hash);
1195 if (!txdb.TxnCommit())
1196 return error("SetBestChain() : TxnCommit failed");
1197 pindexGenesisBlock = pindexNew;
1199 else if (hashPrevBlock == hashBestChain)
1201 // Adding to current best branch
1202 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1205 InvalidChainFound(pindexNew);
1206 return error("SetBestChain() : ConnectBlock failed");
1208 if (!txdb.TxnCommit())
1209 return error("SetBestChain() : TxnCommit failed");
1211 // Add to current best branch
1212 pindexNew->pprev->pnext = pindexNew;
1214 // Delete redundant memory transactions
1215 BOOST_FOREACH(CTransaction& tx, vtx)
1216 tx.RemoveFromMemoryPool();
1221 if (!Reorganize(txdb, pindexNew))
1224 InvalidChainFound(pindexNew);
1225 return error("SetBestChain() : Reorganize failed");
1229 // Update best block in wallet (so we can detect restored wallets)
1230 if (!IsInitialBlockDownload())
1232 const CBlockLocator locator(pindexNew);
1233 ::SetBestChain(locator);
1237 hashBestChain = hash;
1238 pindexBest = pindexNew;
1239 nBestHeight = pindexBest->nHeight;
1240 bnBestChainWork = pindexNew->bnChainWork;
1241 nTimeBestReceived = GetTime();
1242 nTransactionsUpdated++;
1243 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1249 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1251 // Check for duplicate
1252 uint256 hash = GetHash();
1253 if (mapBlockIndex.count(hash))
1254 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1256 // Construct new block index object
1257 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1259 return error("AddToBlockIndex() : new CBlockIndex failed");
1260 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1261 pindexNew->phashBlock = &((*mi).first);
1262 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1263 if (miPrev != mapBlockIndex.end())
1265 pindexNew->pprev = (*miPrev).second;
1266 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1268 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1272 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1273 if (!txdb.TxnCommit())
1277 if (pindexNew->bnChainWork > bnBestChainWork)
1278 if (!SetBestChain(txdb, pindexNew))
1283 if (pindexNew == pindexBest)
1285 // Notify UI to display prev block's coinbase if it was ours
1286 static uint256 hashPrevBestCoinBase;
1287 UpdatedTransaction(hashPrevBestCoinBase);
1288 hashPrevBestCoinBase = vtx[0].GetHash();
1298 bool CBlock::CheckBlock() const
1300 // These are checks that are independent of context
1301 // that can be verified before saving an orphan block.
1304 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1305 return DoS(100, error("CheckBlock() : size limits failed"));
1307 // Check proof of work matches claimed amount
1308 if (!CheckProofOfWork(GetHash(), nBits))
1309 return DoS(50, error("CheckBlock() : proof of work failed"));
1312 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1313 return error("CheckBlock() : block timestamp too far in the future");
1315 // First transaction must be coinbase, the rest must not be
1316 if (vtx.empty() || !vtx[0].IsCoinBase())
1317 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1318 for (int i = 1; i < vtx.size(); i++)
1319 if (vtx[i].IsCoinBase())
1320 return DoS(100, error("CheckBlock() : more than one coinbase"));
1322 // Check transactions
1323 BOOST_FOREACH(const CTransaction& tx, vtx)
1324 if (!tx.CheckTransaction())
1325 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1327 // Check that it's not full of nonstandard transactions
1328 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1329 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1332 if (hashMerkleRoot != BuildMerkleTree())
1333 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1338 bool CBlock::AcceptBlock()
1340 // Check for duplicate
1341 uint256 hash = GetHash();
1342 if (mapBlockIndex.count(hash))
1343 return error("AcceptBlock() : block already in mapBlockIndex");
1345 // Get prev block index
1346 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1347 if (mi == mapBlockIndex.end())
1348 return DoS(10, error("AcceptBlock() : prev block not found"));
1349 CBlockIndex* pindexPrev = (*mi).second;
1350 int nHeight = pindexPrev->nHeight+1;
1352 // Check proof of work
1353 if (nBits != GetNextWorkRequired(pindexPrev, this))
1354 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1356 // Check timestamp against prev
1357 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1358 return error("AcceptBlock() : block's timestamp is too early");
1360 // Check that all transactions are finalized
1361 BOOST_FOREACH(const CTransaction& tx, vtx)
1362 if (!tx.IsFinal(nHeight, GetBlockTime()))
1363 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1365 // Check that the block chain matches the known block chain up to a checkpoint
1366 if (!Checkpoints::CheckBlock(nHeight, hash))
1367 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1369 // Write block to history file
1370 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1371 return error("AcceptBlock() : out of disk space");
1372 unsigned int nFile = -1;
1373 unsigned int nBlockPos = 0;
1374 if (!WriteToDisk(nFile, nBlockPos))
1375 return error("AcceptBlock() : WriteToDisk failed");
1376 if (!AddToBlockIndex(nFile, nBlockPos))
1377 return error("AcceptBlock() : AddToBlockIndex failed");
1379 // Relay inventory, but don't relay old inventory during initial block download
1380 if (hashBestChain == hash)
1381 CRITICAL_BLOCK(cs_vNodes)
1382 BOOST_FOREACH(CNode* pnode, vNodes)
1383 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1384 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1389 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1391 // Check for duplicate
1392 uint256 hash = pblock->GetHash();
1393 if (mapBlockIndex.count(hash))
1394 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1395 if (mapOrphanBlocks.count(hash))
1396 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1398 // Preliminary checks
1399 if (!pblock->CheckBlock())
1400 return error("ProcessBlock() : CheckBlock FAILED");
1402 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1403 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1405 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1406 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1409 pfrom->Misbehaving(100);
1410 return error("ProcessBlock() : block with timestamp before last checkpoint");
1413 bnNewBlock.SetCompact(pblock->nBits);
1415 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1416 if (bnNewBlock > bnRequired)
1418 pfrom->Misbehaving(100);
1419 return error("ProcessBlock() : block with too little proof-of-work");
1424 // If don't already have its previous block, shunt it off to holding area until we get it
1425 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1427 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1428 CBlock* pblock2 = new CBlock(*pblock);
1429 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1430 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1432 // Ask this guy to fill in what we're missing
1434 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1439 if (!pblock->AcceptBlock())
1440 return error("ProcessBlock() : AcceptBlock FAILED");
1442 // Recursively process any orphan blocks that depended on this one
1443 vector<uint256> vWorkQueue;
1444 vWorkQueue.push_back(hash);
1445 for (int i = 0; i < vWorkQueue.size(); i++)
1447 uint256 hashPrev = vWorkQueue[i];
1448 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1449 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1452 CBlock* pblockOrphan = (*mi).second;
1453 if (pblockOrphan->AcceptBlock())
1454 vWorkQueue.push_back(pblockOrphan->GetHash());
1455 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1456 delete pblockOrphan;
1458 mapOrphanBlocksByPrev.erase(hashPrev);
1461 printf("ProcessBlock: ACCEPTED\n");
1472 bool CheckDiskSpace(uint64 nAdditionalBytes)
1474 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1476 // Check for 15MB because database could create another 10MB log file at any time
1477 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1480 string strMessage = _("Warning: Disk space is low ");
1481 strMiscWarning = strMessage;
1482 printf("*** %s\n", strMessage.c_str());
1483 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1484 CreateThread(Shutdown, NULL);
1490 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1494 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1497 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1499 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1508 static unsigned int nCurrentBlockFile = 1;
1510 FILE* AppendBlockFile(unsigned int& nFileRet)
1515 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1518 if (fseek(file, 0, SEEK_END) != 0)
1520 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1521 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1523 nFileRet = nCurrentBlockFile;
1527 nCurrentBlockFile++;
1531 bool LoadBlockIndex(bool fAllowNew)
1535 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1536 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1537 pchMessageStart[0] = 0xfa;
1538 pchMessageStart[1] = 0xbf;
1539 pchMessageStart[2] = 0xb5;
1540 pchMessageStart[3] = 0xda;
1547 if (!txdb.LoadBlockIndex())
1552 // Init with genesis block
1554 if (mapBlockIndex.empty())
1560 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1561 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1562 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1563 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1564 // vMerkleTree: 4a5e1e
1567 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1569 txNew.vin.resize(1);
1570 txNew.vout.resize(1);
1571 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1572 txNew.vout[0].nValue = 50 * COIN;
1573 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1575 block.vtx.push_back(txNew);
1576 block.hashPrevBlock = 0;
1577 block.hashMerkleRoot = block.BuildMerkleTree();
1579 block.nTime = 1231006505;
1580 block.nBits = 0x1d00ffff;
1581 block.nNonce = 2083236893;
1585 block.nTime = 1296688602;
1586 block.nBits = 0x1d07fff8;
1587 block.nNonce = 384568319;
1591 printf("%s\n", block.GetHash().ToString().c_str());
1592 printf("%s\n", hashGenesisBlock.ToString().c_str());
1593 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1594 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1596 assert(block.GetHash() == hashGenesisBlock);
1598 // Start new block file
1600 unsigned int nBlockPos;
1601 if (!block.WriteToDisk(nFile, nBlockPos))
1602 return error("LoadBlockIndex() : writing genesis block to disk failed");
1603 if (!block.AddToBlockIndex(nFile, nBlockPos))
1604 return error("LoadBlockIndex() : genesis block not accepted");
1612 void PrintBlockTree()
1614 // precompute tree structure
1615 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1616 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1618 CBlockIndex* pindex = (*mi).second;
1619 mapNext[pindex->pprev].push_back(pindex);
1621 //while (rand() % 3 == 0)
1622 // mapNext[pindex->pprev].push_back(pindex);
1625 vector<pair<int, CBlockIndex*> > vStack;
1626 vStack.push_back(make_pair(0, pindexGenesisBlock));
1629 while (!vStack.empty())
1631 int nCol = vStack.back().first;
1632 CBlockIndex* pindex = vStack.back().second;
1635 // print split or gap
1636 if (nCol > nPrevCol)
1638 for (int i = 0; i < nCol-1; i++)
1642 else if (nCol < nPrevCol)
1644 for (int i = 0; i < nCol; i++)
1651 for (int i = 0; i < nCol; i++)
1656 block.ReadFromDisk(pindex);
1657 printf("%d (%u,%u) %s %s tx %d",
1661 block.GetHash().ToString().substr(0,20).c_str(),
1662 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1665 PrintWallets(block);
1667 // put the main timechain first
1668 vector<CBlockIndex*>& vNext = mapNext[pindex];
1669 for (int i = 0; i < vNext.size(); i++)
1671 if (vNext[i]->pnext)
1673 swap(vNext[0], vNext[i]);
1679 for (int i = 0; i < vNext.size(); i++)
1680 vStack.push_back(make_pair(nCol+i, vNext[i]));
1693 //////////////////////////////////////////////////////////////////////////////
1698 map<uint256, CAlert> mapAlerts;
1699 CCriticalSection cs_mapAlerts;
1701 string GetWarnings(string strFor)
1704 string strStatusBar;
1706 if (GetBoolArg("-testsafemode"))
1709 // Misc warnings like out of disk space and clock is wrong
1710 if (strMiscWarning != "")
1713 strStatusBar = strMiscWarning;
1716 // Longer invalid proof-of-work chain
1717 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1720 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1724 CRITICAL_BLOCK(cs_mapAlerts)
1726 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1728 const CAlert& alert = item.second;
1729 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1731 nPriority = alert.nPriority;
1732 strStatusBar = alert.strStatusBar;
1737 if (strFor == "statusbar")
1738 return strStatusBar;
1739 else if (strFor == "rpc")
1741 assert(!"GetWarnings() : invalid parameter");
1745 bool CAlert::ProcessAlert()
1747 if (!CheckSignature())
1752 CRITICAL_BLOCK(cs_mapAlerts)
1754 // Cancel previous alerts
1755 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1757 const CAlert& alert = (*mi).second;
1760 printf("cancelling alert %d\n", alert.nID);
1761 mapAlerts.erase(mi++);
1763 else if (!alert.IsInEffect())
1765 printf("expiring alert %d\n", alert.nID);
1766 mapAlerts.erase(mi++);
1772 // Check if this alert has been cancelled
1773 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1775 const CAlert& alert = item.second;
1776 if (alert.Cancels(*this))
1778 printf("alert already cancelled by %d\n", alert.nID);
1784 mapAlerts.insert(make_pair(GetHash(), *this));
1787 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1799 //////////////////////////////////////////////////////////////////////////////
1805 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1809 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1810 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1812 // Don't know what it is, just say we already got one
1819 // The message start string is designed to be unlikely to occur in normal data.
1820 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1821 // a large 4-byte int at any alignment.
1822 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1825 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1827 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1828 RandAddSeedPerfmon();
1830 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1831 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1833 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1835 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1843 if (strCommand == "version")
1845 // Each connection can only send one version message
1846 if (pfrom->nVersion != 0)
1848 pfrom->Misbehaving(1);
1856 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1857 if (pfrom->nVersion == 10300)
1858 pfrom->nVersion = 300;
1859 if (pfrom->nVersion >= 106 && !vRecv.empty())
1860 vRecv >> addrFrom >> nNonce;
1861 if (pfrom->nVersion >= 106 && !vRecv.empty())
1862 vRecv >> pfrom->strSubVer;
1863 if (pfrom->nVersion >= 209 && !vRecv.empty())
1864 vRecv >> pfrom->nStartingHeight;
1866 if (pfrom->nVersion == 0)
1869 // Disconnect if we connected to ourself
1870 if (nNonce == nLocalHostNonce && nNonce > 1)
1872 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1873 pfrom->fDisconnect = true;
1877 // Be shy and don't send version until we hear
1878 if (pfrom->fInbound)
1879 pfrom->PushVersion();
1881 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1883 AddTimeData(pfrom->addr.ip, nTime);
1886 if (pfrom->nVersion >= 209)
1887 pfrom->PushMessage("verack");
1888 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1889 if (pfrom->nVersion < 209)
1890 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1892 if (!pfrom->fInbound)
1894 // Advertise our address
1895 if (addrLocalHost.IsRoutable() && !fUseProxy)
1897 CAddress addr(addrLocalHost);
1898 addr.nTime = GetAdjustedTime();
1899 pfrom->PushAddress(addr);
1902 // Get recent addresses
1903 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1905 pfrom->PushMessage("getaddr");
1906 pfrom->fGetAddr = true;
1910 // Ask the first connected node for block updates
1911 static int nAskedForBlocks;
1912 if (!pfrom->fClient &&
1913 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1914 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1917 pfrom->PushGetBlocks(pindexBest, uint256(0));
1921 CRITICAL_BLOCK(cs_mapAlerts)
1922 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1923 item.second.RelayTo(pfrom);
1925 pfrom->fSuccessfullyConnected = true;
1927 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1929 cPeerBlockCounts.input(pfrom->nStartingHeight);
1933 else if (pfrom->nVersion == 0)
1935 // Must have a version message before anything else
1936 pfrom->Misbehaving(1);
1941 else if (strCommand == "verack")
1943 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1947 else if (strCommand == "addr")
1949 vector<CAddress> vAddr;
1952 // Don't want addr from older versions unless seeding
1953 if (pfrom->nVersion < 209)
1955 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1957 if (vAddr.size() > 1000)
1959 pfrom->Misbehaving(20);
1960 return error("message addr size() = %d", vAddr.size());
1963 // Store the new addresses
1966 int64 nNow = GetAdjustedTime();
1967 int64 nSince = nNow - 10 * 60;
1968 BOOST_FOREACH(CAddress& addr, vAddr)
1972 // ignore IPv6 for now, since it isn't implemented anyway
1975 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1976 addr.nTime = nNow - 5 * 24 * 60 * 60;
1977 AddAddress(addr, 2 * 60 * 60, &addrDB);
1978 pfrom->AddAddressKnown(addr);
1979 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1981 // Relay to a limited number of other nodes
1982 CRITICAL_BLOCK(cs_vNodes)
1984 // Use deterministic randomness to send to the same nodes for 24 hours
1985 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1986 static uint256 hashSalt;
1988 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1989 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1990 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1991 multimap<uint256, CNode*> mapMix;
1992 BOOST_FOREACH(CNode* pnode, vNodes)
1994 if (pnode->nVersion < 31402)
1996 unsigned int nPointer;
1997 memcpy(&nPointer, &pnode, sizeof(nPointer));
1998 uint256 hashKey = hashRand ^ nPointer;
1999 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2000 mapMix.insert(make_pair(hashKey, pnode));
2002 int nRelayNodes = 2;
2003 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2004 ((*mi).second)->PushAddress(addr);
2008 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2009 if (vAddr.size() < 1000)
2010 pfrom->fGetAddr = false;
2014 else if (strCommand == "inv")
2018 if (vInv.size() > 50000)
2020 pfrom->Misbehaving(20);
2021 return error("message inv size() = %d", vInv.size());
2025 BOOST_FOREACH(const CInv& inv, vInv)
2029 pfrom->AddInventoryKnown(inv);
2031 bool fAlreadyHave = AlreadyHave(txdb, inv);
2033 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2037 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2038 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2040 // Track requests for our stuff
2041 Inventory(inv.hash);
2046 else if (strCommand == "getdata")
2050 if (vInv.size() > 50000)
2052 pfrom->Misbehaving(20);
2053 return error("message getdata size() = %d", vInv.size());
2056 BOOST_FOREACH(const CInv& inv, vInv)
2060 printf("received getdata for: %s\n", inv.ToString().c_str());
2062 if (inv.type == MSG_BLOCK)
2064 // Send block from disk
2065 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2066 if (mi != mapBlockIndex.end())
2069 block.ReadFromDisk((*mi).second);
2070 pfrom->PushMessage("block", block);
2072 // Trigger them to send a getblocks request for the next batch of inventory
2073 if (inv.hash == pfrom->hashContinue)
2075 // Bypass PushInventory, this must send even if redundant,
2076 // and we want it right after the last block so they don't
2077 // wait for other stuff first.
2079 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2080 pfrom->PushMessage("inv", vInv);
2081 pfrom->hashContinue = 0;
2085 else if (inv.IsKnownType())
2087 // Send stream from relay memory
2088 CRITICAL_BLOCK(cs_mapRelay)
2090 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2091 if (mi != mapRelay.end())
2092 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2096 // Track requests for our stuff
2097 Inventory(inv.hash);
2102 else if (strCommand == "getblocks")
2104 CBlockLocator locator;
2106 vRecv >> locator >> hashStop;
2108 // Find the last block the caller has in the main chain
2109 CBlockIndex* pindex = locator.GetBlockIndex();
2111 // Send the rest of the chain
2113 pindex = pindex->pnext;
2114 int nLimit = 500 + locator.GetDistanceBack();
2115 unsigned int nBytes = 0;
2116 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2117 for (; pindex; pindex = pindex->pnext)
2119 if (pindex->GetBlockHash() == hashStop)
2121 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2124 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2126 block.ReadFromDisk(pindex, true);
2127 nBytes += block.GetSerializeSize(SER_NETWORK);
2128 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2130 // When this block is requested, we'll send an inv that'll make them
2131 // getblocks the next batch of inventory.
2132 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2133 pfrom->hashContinue = pindex->GetBlockHash();
2140 else if (strCommand == "getheaders")
2142 CBlockLocator locator;
2144 vRecv >> locator >> hashStop;
2146 CBlockIndex* pindex = NULL;
2147 if (locator.IsNull())
2149 // If locator is null, return the hashStop block
2150 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2151 if (mi == mapBlockIndex.end())
2153 pindex = (*mi).second;
2157 // Find the last block the caller has in the main chain
2158 pindex = locator.GetBlockIndex();
2160 pindex = pindex->pnext;
2163 vector<CBlock> vHeaders;
2164 int nLimit = 2000 + locator.GetDistanceBack();
2165 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2166 for (; pindex; pindex = pindex->pnext)
2168 vHeaders.push_back(pindex->GetBlockHeader());
2169 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2172 pfrom->PushMessage("headers", vHeaders);
2176 else if (strCommand == "tx")
2178 vector<uint256> vWorkQueue;
2179 CDataStream vMsg(vRecv);
2183 CInv inv(MSG_TX, tx.GetHash());
2184 pfrom->AddInventoryKnown(inv);
2186 bool fMissingInputs = false;
2187 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2189 SyncWithWallets(tx, NULL, true);
2190 RelayMessage(inv, vMsg);
2191 mapAlreadyAskedFor.erase(inv);
2192 vWorkQueue.push_back(inv.hash);
2194 // Recursively process any orphan transactions that depended on this one
2195 for (int i = 0; i < vWorkQueue.size(); i++)
2197 uint256 hashPrev = vWorkQueue[i];
2198 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2199 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2202 const CDataStream& vMsg = *((*mi).second);
2204 CDataStream(vMsg) >> tx;
2205 CInv inv(MSG_TX, tx.GetHash());
2207 if (tx.AcceptToMemoryPool(true))
2209 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2210 SyncWithWallets(tx, NULL, true);
2211 RelayMessage(inv, vMsg);
2212 mapAlreadyAskedFor.erase(inv);
2213 vWorkQueue.push_back(inv.hash);
2218 BOOST_FOREACH(uint256 hash, vWorkQueue)
2219 EraseOrphanTx(hash);
2221 else if (fMissingInputs)
2223 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2226 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2230 else if (strCommand == "block")
2235 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2238 CInv inv(MSG_BLOCK, block.GetHash());
2239 pfrom->AddInventoryKnown(inv);
2241 if (ProcessBlock(pfrom, &block))
2242 mapAlreadyAskedFor.erase(inv);
2243 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2247 else if (strCommand == "getaddr")
2249 // Nodes rebroadcast an addr every 24 hours
2250 pfrom->vAddrToSend.clear();
2251 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2252 CRITICAL_BLOCK(cs_mapAddresses)
2254 unsigned int nCount = 0;
2255 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2257 const CAddress& addr = item.second;
2258 if (addr.nTime > nSince)
2261 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2263 const CAddress& addr = item.second;
2264 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2265 pfrom->PushAddress(addr);
2271 else if (strCommand == "checkorder")
2276 if (!GetBoolArg("-allowreceivebyip"))
2278 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2285 /// we have a chance to check the order here
2287 // Keep giving the same key to the same ip until they use it
2288 if (!mapReuseKey.count(pfrom->addr.ip))
2289 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2291 // Send back approval of order and pubkey to use
2292 CScript scriptPubKey;
2293 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2294 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2298 else if (strCommand == "reply")
2303 CRequestTracker tracker;
2304 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2306 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2307 if (mi != pfrom->mapRequests.end())
2309 tracker = (*mi).second;
2310 pfrom->mapRequests.erase(mi);
2313 if (!tracker.IsNull())
2314 tracker.fn(tracker.param1, vRecv);
2318 else if (strCommand == "ping")
2323 else if (strCommand == "alert")
2328 if (alert.ProcessAlert())
2331 pfrom->setKnown.insert(alert.GetHash());
2332 CRITICAL_BLOCK(cs_vNodes)
2333 BOOST_FOREACH(CNode* pnode, vNodes)
2334 alert.RelayTo(pnode);
2341 // Ignore unknown commands for extensibility
2345 // Update the last seen time for this node's address
2346 if (pfrom->fNetworkNode)
2347 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2348 AddressCurrentlyConnected(pfrom->addr);
2354 bool ProcessMessages(CNode* pfrom)
2356 CDataStream& vRecv = pfrom->vRecv;
2360 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2364 // (4) message start
2373 // Scan for message start
2374 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2375 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2376 if (vRecv.end() - pstart < nHeaderSize)
2378 if (vRecv.size() > nHeaderSize)
2380 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2381 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2385 if (pstart - vRecv.begin() > 0)
2386 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2387 vRecv.erase(vRecv.begin(), pstart);
2390 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2395 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2398 string strCommand = hdr.GetCommand();
2401 unsigned int nMessageSize = hdr.nMessageSize;
2402 if (nMessageSize > MAX_SIZE)
2404 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2407 if (nMessageSize > vRecv.size())
2409 // Rewind and wait for rest of message
2410 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2415 if (vRecv.GetVersion() >= 209)
2417 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2418 unsigned int nChecksum = 0;
2419 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2420 if (nChecksum != hdr.nChecksum)
2422 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2423 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2428 // Copy message to its own buffer
2429 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2430 vRecv.ignore(nMessageSize);
2436 CRITICAL_BLOCK(cs_main)
2437 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2441 catch (std::ios_base::failure& e)
2443 if (strstr(e.what(), "end of data"))
2445 // Allow exceptions from underlength message on vRecv
2446 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());
2448 else if (strstr(e.what(), "size too large"))
2450 // Allow exceptions from overlong size
2451 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2455 PrintExceptionContinue(&e, "ProcessMessage()");
2458 catch (std::exception& e) {
2459 PrintExceptionContinue(&e, "ProcessMessage()");
2461 PrintExceptionContinue(NULL, "ProcessMessage()");
2465 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2473 bool SendMessages(CNode* pto, bool fSendTrickle)
2475 CRITICAL_BLOCK(cs_main)
2477 // Don't send anything until we get their version message
2478 if (pto->nVersion == 0)
2482 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2483 pto->PushMessage("ping");
2485 // Resend wallet transactions that haven't gotten in a block yet
2486 ResendWalletTransactions();
2488 // Address refresh broadcast
2489 static int64 nLastRebroadcast;
2490 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2492 nLastRebroadcast = GetTime();
2493 CRITICAL_BLOCK(cs_vNodes)
2495 BOOST_FOREACH(CNode* pnode, vNodes)
2497 // Periodically clear setAddrKnown to allow refresh broadcasts
2498 pnode->setAddrKnown.clear();
2500 // Rebroadcast our address
2501 if (addrLocalHost.IsRoutable() && !fUseProxy)
2503 CAddress addr(addrLocalHost);
2504 addr.nTime = GetAdjustedTime();
2505 pnode->PushAddress(addr);
2511 // Clear out old addresses periodically so it's not too much work at once
2512 static int64 nLastClear;
2513 if (nLastClear == 0)
2514 nLastClear = GetTime();
2515 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2517 nLastClear = GetTime();
2518 CRITICAL_BLOCK(cs_mapAddresses)
2521 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2522 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2523 mi != mapAddresses.end();)
2525 const CAddress& addr = (*mi).second;
2526 if (addr.nTime < nSince)
2528 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2530 addrdb.EraseAddress(addr);
2531 mapAddresses.erase(mi++);
2545 vector<CAddress> vAddr;
2546 vAddr.reserve(pto->vAddrToSend.size());
2547 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2549 // returns true if wasn't already contained in the set
2550 if (pto->setAddrKnown.insert(addr).second)
2552 vAddr.push_back(addr);
2553 // receiver rejects addr messages larger than 1000
2554 if (vAddr.size() >= 1000)
2556 pto->PushMessage("addr", vAddr);
2561 pto->vAddrToSend.clear();
2563 pto->PushMessage("addr", vAddr);
2568 // Message: inventory
2571 vector<CInv> vInvWait;
2572 CRITICAL_BLOCK(pto->cs_inventory)
2574 vInv.reserve(pto->vInventoryToSend.size());
2575 vInvWait.reserve(pto->vInventoryToSend.size());
2576 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2578 if (pto->setInventoryKnown.count(inv))
2581 // trickle out tx inv to protect privacy
2582 if (inv.type == MSG_TX && !fSendTrickle)
2584 // 1/4 of tx invs blast to all immediately
2585 static uint256 hashSalt;
2587 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2588 uint256 hashRand = inv.hash ^ hashSalt;
2589 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2590 bool fTrickleWait = ((hashRand & 3) != 0);
2592 // always trickle our own transactions
2596 if (GetTransaction(inv.hash, wtx))
2598 fTrickleWait = true;
2603 vInvWait.push_back(inv);
2608 // returns true if wasn't already contained in the set
2609 if (pto->setInventoryKnown.insert(inv).second)
2611 vInv.push_back(inv);
2612 if (vInv.size() >= 1000)
2614 pto->PushMessage("inv", vInv);
2619 pto->vInventoryToSend = vInvWait;
2622 pto->PushMessage("inv", vInv);
2628 vector<CInv> vGetData;
2629 int64 nNow = GetTime() * 1000000;
2631 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2633 const CInv& inv = (*pto->mapAskFor.begin()).second;
2634 if (!AlreadyHave(txdb, inv))
2636 printf("sending getdata: %s\n", inv.ToString().c_str());
2637 vGetData.push_back(inv);
2638 if (vGetData.size() >= 1000)
2640 pto->PushMessage("getdata", vGetData);
2644 mapAlreadyAskedFor[inv] = nNow;
2645 pto->mapAskFor.erase(pto->mapAskFor.begin());
2647 if (!vGetData.empty())
2648 pto->PushMessage("getdata", vGetData);
2667 //////////////////////////////////////////////////////////////////////////////
2672 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2674 unsigned char* pdata = (unsigned char*)pbuffer;
2675 unsigned int blocks = 1 + ((len + 8) / 64);
2676 unsigned char* pend = pdata + 64 * blocks;
2677 memset(pdata + len, 0, 64 * blocks - len);
2679 unsigned int bits = len * 8;
2680 pend[-1] = (bits >> 0) & 0xff;
2681 pend[-2] = (bits >> 8) & 0xff;
2682 pend[-3] = (bits >> 16) & 0xff;
2683 pend[-4] = (bits >> 24) & 0xff;
2687 static const unsigned int pSHA256InitState[8] =
2688 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2690 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2693 unsigned char data[64];
2697 for (int i = 0; i < 16; i++)
2698 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2700 for (int i = 0; i < 8; i++)
2701 ctx.h[i] = ((uint32_t*)pinit)[i];
2703 SHA256_Update(&ctx, data, sizeof(data));
2704 for (int i = 0; i < 8; i++)
2705 ((uint32_t*)pstate)[i] = ctx.h[i];
2709 // ScanHash scans nonces looking for a hash with at least some zero bits.
2710 // It operates on big endian data. Caller does the byte reversing.
2711 // All input buffers are 16-byte aligned. nNonce is usually preserved
2712 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2713 // the block is rebuilt and nNonce starts over at zero.
2715 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2717 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2721 // Hash pdata using pmidstate as the starting state into
2722 // preformatted buffer phash1, then hash phash1 into phash
2724 SHA256Transform(phash1, pdata, pmidstate);
2725 SHA256Transform(phash, phash1, pSHA256InitState);
2727 // Return the nonce if the hash has at least some zero bits,
2728 // caller will check if it has enough to reach the target
2729 if (((unsigned short*)phash)[14] == 0)
2732 // If nothing found after trying for a while, return -1
2733 if ((nNonce & 0xffff) == 0)
2735 nHashesDone = 0xffff+1;
2741 // Some explaining would be appreciated
2746 set<uint256> setDependsOn;
2749 COrphan(CTransaction* ptxIn)
2757 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2758 BOOST_FOREACH(uint256 hash, setDependsOn)
2759 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2764 CBlock* CreateNewBlock(CReserveKey& reservekey)
2766 CBlockIndex* pindexPrev = pindexBest;
2769 auto_ptr<CBlock> pblock(new CBlock());
2773 // Create coinbase tx
2775 txNew.vin.resize(1);
2776 txNew.vin[0].prevout.SetNull();
2777 txNew.vout.resize(1);
2778 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2780 // Add our coinbase tx as first transaction
2781 pblock->vtx.push_back(txNew);
2783 // Collect memory pool transactions into the block
2785 CRITICAL_BLOCK(cs_main)
2786 CRITICAL_BLOCK(cs_mapTransactions)
2790 // Priority order to process transactions
2791 list<COrphan> vOrphan; // list memory doesn't move
2792 map<uint256, vector<COrphan*> > mapDependers;
2793 multimap<double, CTransaction*> mapPriority;
2794 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2796 CTransaction& tx = (*mi).second;
2797 if (tx.IsCoinBase() || !tx.IsFinal())
2800 COrphan* porphan = NULL;
2801 double dPriority = 0;
2802 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2804 // Read prev transaction
2805 CTransaction txPrev;
2807 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2809 // Has to wait for dependencies
2812 // Use list for automatic deletion
2813 vOrphan.push_back(COrphan(&tx));
2814 porphan = &vOrphan.back();
2816 mapDependers[txin.prevout.hash].push_back(porphan);
2817 porphan->setDependsOn.insert(txin.prevout.hash);
2820 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2822 // Read block header
2823 int nConf = txindex.GetDepthInMainChain();
2825 dPriority += (double)nValueIn * nConf;
2827 if (fDebug && GetBoolArg("-printpriority"))
2828 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2831 // Priority is sum(valuein * age) / txsize
2832 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2835 porphan->dPriority = dPriority;
2837 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2839 if (fDebug && GetBoolArg("-printpriority"))
2841 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2848 // Collect transactions into block
2849 map<uint256, CTxIndex> mapTestPool;
2850 uint64 nBlockSize = 1000;
2851 int nBlockSigOps = 100;
2852 while (!mapPriority.empty())
2854 // Take highest priority transaction off priority queue
2855 double dPriority = -(*mapPriority.begin()).first;
2856 CTransaction& tx = *(*mapPriority.begin()).second;
2857 mapPriority.erase(mapPriority.begin());
2860 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2861 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2863 int nTxSigOps = tx.GetSigOpCount();
2864 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2867 // Transaction fee required depends on block size
2868 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2869 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
2871 // Connecting shouldn't fail due to dependency on other memory pool transactions
2872 // because we're already processing them in order of dependency
2873 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2875 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee, fInvalid))
2877 swap(mapTestPool, mapTestPoolTmp);
2880 pblock->vtx.push_back(tx);
2881 nBlockSize += nTxSize;
2882 nBlockSigOps += nTxSigOps;
2884 // Add transactions that depend on this one to the priority queue
2885 uint256 hash = tx.GetHash();
2886 if (mapDependers.count(hash))
2888 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2890 if (!porphan->setDependsOn.empty())
2892 porphan->setDependsOn.erase(hash);
2893 if (porphan->setDependsOn.empty())
2894 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2900 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2903 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2904 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2905 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2906 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
2909 return pblock.release();
2913 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2915 // Update nExtraNonce
2916 static uint256 hashPrevBlock;
2917 if (hashPrevBlock != pblock->hashPrevBlock)
2920 hashPrevBlock = pblock->hashPrevBlock;
2923 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2924 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2928 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2931 // Prebuild hash buffers
2938 uint256 hashPrevBlock;
2939 uint256 hashMerkleRoot;
2942 unsigned int nNonce;
2945 unsigned char pchPadding0[64];
2947 unsigned char pchPadding1[64];
2950 memset(&tmp, 0, sizeof(tmp));
2952 tmp.block.nVersion = pblock->nVersion;
2953 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2954 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2955 tmp.block.nTime = pblock->nTime;
2956 tmp.block.nBits = pblock->nBits;
2957 tmp.block.nNonce = pblock->nNonce;
2959 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2960 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2962 // Byte swap all the input buffer
2963 for (int i = 0; i < sizeof(tmp)/4; i++)
2964 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2966 // Precalc the first half of the first hash, which stays constant
2967 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2969 memcpy(pdata, &tmp.block, 128);
2970 memcpy(phash1, &tmp.hash1, 64);
2974 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2976 uint256 hash = pblock->GetHash();
2977 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2979 if (hash > hashTarget)
2983 printf("BitcoinMiner:\n");
2984 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2986 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2987 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2990 CRITICAL_BLOCK(cs_main)
2992 if (pblock->hashPrevBlock != hashBestChain)
2993 return error("BitcoinMiner : generated block is stale");
2995 // Remove key from key pool
2996 reservekey.KeepKey();
2998 // Track how many getdata requests this block gets
2999 CRITICAL_BLOCK(wallet.cs_wallet)
3000 wallet.mapRequestCount[pblock->GetHash()] = 0;
3002 // Process this block the same as if we had received it from another node
3003 if (!ProcessBlock(NULL, pblock))
3004 return error("BitcoinMiner : ProcessBlock, block not accepted");
3010 void static ThreadBitcoinMiner(void* parg);
3012 void static BitcoinMiner(CWallet *pwallet)
3014 printf("BitcoinMiner started\n");
3015 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3017 // Each thread has its own key and counter
3018 CReserveKey reservekey(pwallet);
3019 unsigned int nExtraNonce = 0;
3021 while (fGenerateBitcoins)
3023 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3027 while (vNodes.empty() || IsInitialBlockDownload())
3032 if (!fGenerateBitcoins)
3040 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3041 CBlockIndex* pindexPrev = pindexBest;
3043 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3046 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3048 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3052 // Prebuild hash buffers
3054 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3055 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3056 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3058 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3060 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3061 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3067 int64 nStart = GetTime();
3068 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3070 uint256& hash = *alignup<16>(hashbuf);
3073 unsigned int nHashesDone = 0;
3074 unsigned int nNonceFound;
3077 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3078 (char*)&hash, nHashesDone);
3080 // Check if something found
3081 if (nNonceFound != -1)
3083 for (int i = 0; i < sizeof(hash)/4; i++)
3084 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3086 if (hash <= hashTarget)
3089 pblock->nNonce = ByteReverse(nNonceFound);
3090 assert(hash == pblock->GetHash());
3092 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3093 CheckWork(pblock.get(), *pwalletMain, reservekey);
3094 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3100 static int64 nHashCounter;
3101 if (nHPSTimerStart == 0)
3103 nHPSTimerStart = GetTimeMillis();
3107 nHashCounter += nHashesDone;
3108 if (GetTimeMillis() - nHPSTimerStart > 4000)
3110 static CCriticalSection cs;
3113 if (GetTimeMillis() - nHPSTimerStart > 4000)
3115 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3116 nHPSTimerStart = GetTimeMillis();
3118 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3119 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3120 static int64 nLogTime;
3121 if (GetTime() - nLogTime > 30 * 60)
3123 nLogTime = GetTime();
3124 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3125 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3131 // Check for stop or if block needs to be rebuilt
3134 if (!fGenerateBitcoins)
3136 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3140 if (nBlockNonce >= 0xffff0000)
3142 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3144 if (pindexPrev != pindexBest)
3147 // Update nTime every few seconds
3148 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3149 nBlockTime = ByteReverse(pblock->nTime);
3154 void static ThreadBitcoinMiner(void* parg)
3156 CWallet* pwallet = (CWallet*)parg;
3159 vnThreadsRunning[3]++;
3160 BitcoinMiner(pwallet);
3161 vnThreadsRunning[3]--;
3163 catch (std::exception& e) {
3164 vnThreadsRunning[3]--;
3165 PrintException(&e, "ThreadBitcoinMiner()");
3167 vnThreadsRunning[3]--;
3168 PrintException(NULL, "ThreadBitcoinMiner()");
3170 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3172 if (vnThreadsRunning[3] == 0)
3174 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3178 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3180 if (fGenerateBitcoins != fGenerate)
3182 fGenerateBitcoins = fGenerate;
3183 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3186 if (fGenerateBitcoins)
3188 int nProcessors = boost::thread::hardware_concurrency();
3189 printf("%d processors\n", nProcessors);
3190 if (nProcessors < 1)
3192 if (fLimitProcessors && nProcessors > nLimitProcessors)
3193 nProcessors = nLimitProcessors;
3194 int nAddThreads = nProcessors - vnThreadsRunning[3];
3195 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3196 for (int i = 0; i < nAddThreads; i++)
3198 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3199 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");