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");
820 bool CTransaction::DisconnectInputs(CTxDB& txdb)
822 // Relinquish previous transactions' spent pointers
825 BOOST_FOREACH(const CTxIn& txin, vin)
827 COutPoint prevout = txin.prevout;
829 // Get prev txindex from disk
831 if (!txdb.ReadTxIndex(prevout.hash, txindex))
832 return error("DisconnectInputs() : ReadTxIndex failed");
834 if (prevout.n >= txindex.vSpent.size())
835 return error("DisconnectInputs() : prevout.n out of range");
837 // Mark outpoint as not spent
838 txindex.vSpent[prevout.n].SetNull();
841 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
842 return error("DisconnectInputs() : UpdateTxIndex failed");
846 // Remove transaction from index
847 // This can fail if a duplicate of this transaction was in a chain that got
848 // reorganized away. This is only possible if this transaction was completely
849 // spent, so erasing it would be a no-op anway.
850 txdb.EraseTxIndex(*this);
856 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
857 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee,
860 // FetchInputs can return false either because we just haven't seen some inputs
861 // (in which case the transaction should be stored as an orphan)
862 // or because the transaction is malformed (in which case the transaction should
863 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
866 // Take over previous transactions' spent pointers
870 for (int i = 0; i < vin.size(); i++)
872 COutPoint prevout = vin[i].prevout;
877 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
879 // Get txindex from current proposed changes
880 txindex = mapTestPool[prevout.hash];
884 // Read txindex from txdb
885 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
887 if (!fFound && (fBlock || fMiner))
888 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());
892 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
894 // Get prev tx from single transactions in memory
895 CRITICAL_BLOCK(cs_mapTransactions)
897 if (!mapTransactions.count(prevout.hash))
898 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
899 txPrev = mapTransactions[prevout.hash];
902 txindex.vSpent.resize(txPrev.vout.size());
906 // Get prev tx from disk
907 if (!txPrev.ReadFromDisk(txindex.pos))
908 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
911 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
913 // Revisit this if/when transaction replacement is implemented and allows
916 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());
919 // If prev is coinbase, check that it's matured
920 if (txPrev.IsCoinBase())
921 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
922 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
923 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
926 if (!VerifySignature(txPrev, *this, i))
927 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
929 // Check for conflicts
930 if (!txindex.vSpent[prevout.n].IsNull())
931 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());
933 // Check for negative or overflow input values
934 nValueIn += txPrev.vout[prevout.n].nValue;
935 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
936 return error("ConnectInputs() : txin values out of range");
938 // Mark outpoints as spent
939 txindex.vSpent[prevout.n] = posThisTx;
942 if (fBlock || fMiner)
944 mapTestPool[prevout.hash] = txindex;
948 if (nValueIn < GetValueOut())
949 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
951 // Tally transaction fees
952 int64 nTxFee = nValueIn - GetValueOut();
954 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
955 if (nTxFee < nMinFee)
958 if (!MoneyRange(nFees))
959 return error("ConnectInputs() : nFees out of range");
964 // Add transaction to changes
965 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
969 // Add transaction to test pool
970 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
977 bool CTransaction::ClientConnectInputs()
982 // Take over previous transactions' spent pointers
983 CRITICAL_BLOCK(cs_mapTransactions)
986 for (int i = 0; i < vin.size(); i++)
988 // Get prev tx from single transactions in memory
989 COutPoint prevout = vin[i].prevout;
990 if (!mapTransactions.count(prevout.hash))
992 CTransaction& txPrev = mapTransactions[prevout.hash];
994 if (prevout.n >= txPrev.vout.size())
998 if (!VerifySignature(txPrev, *this, i))
999 return error("ConnectInputs() : VerifySignature failed");
1001 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1002 ///// this has to go away now that posNext is gone
1003 // // Check for conflicts
1004 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1005 // return error("ConnectInputs() : prev tx already used");
1007 // // Flag outpoints as used
1008 // txPrev.vout[prevout.n].posNext = posThisTx;
1010 nValueIn += txPrev.vout[prevout.n].nValue;
1012 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1013 return error("ClientConnectInputs() : txin values out of range");
1015 if (GetValueOut() > nValueIn)
1025 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1027 // Disconnect in reverse order
1028 for (int i = vtx.size()-1; i >= 0; i--)
1029 if (!vtx[i].DisconnectInputs(txdb))
1032 // Update block index on disk without changing it in memory.
1033 // The memory index structure will be changed after the db commits.
1036 CDiskBlockIndex blockindexPrev(pindex->pprev);
1037 blockindexPrev.hashNext = 0;
1038 if (!txdb.WriteBlockIndex(blockindexPrev))
1039 return error("DisconnectBlock() : WriteBlockIndex failed");
1045 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1047 // Check it again in case a previous version let a bad block in
1051 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1052 // unless those are already completely spent.
1053 // If such overwrites are allowed, coinbases and transactions depending upon those
1054 // can be duplicated to remove the ability to spend the first instance -- even after
1055 // being sent to another address.
1056 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1057 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1058 // already refuses previously-known transaction id's entirely.
1059 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1060 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1061 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1062 BOOST_FOREACH(CTransaction& tx, vtx)
1064 CTxIndex txindexOld;
1065 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1066 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1071 //// issue here: it doesn't know the version
1072 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1074 map<uint256, CTxIndex> mapQueuedChanges;
1076 BOOST_FOREACH(CTransaction& tx, vtx)
1078 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1079 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1082 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false, 0, fInvalid))
1085 // Write queued txindex changes
1086 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1088 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1089 return error("ConnectBlock() : UpdateTxIndex failed");
1092 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1095 // Update block index on disk without changing it in memory.
1096 // The memory index structure will be changed after the db commits.
1099 CDiskBlockIndex blockindexPrev(pindex->pprev);
1100 blockindexPrev.hashNext = pindex->GetBlockHash();
1101 if (!txdb.WriteBlockIndex(blockindexPrev))
1102 return error("ConnectBlock() : WriteBlockIndex failed");
1105 // Watch for transactions paying to me
1106 BOOST_FOREACH(CTransaction& tx, vtx)
1107 SyncWithWallets(tx, this, true);
1112 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1114 printf("REORGANIZE\n");
1117 CBlockIndex* pfork = pindexBest;
1118 CBlockIndex* plonger = pindexNew;
1119 while (pfork != plonger)
1121 while (plonger->nHeight > pfork->nHeight)
1122 if (!(plonger = plonger->pprev))
1123 return error("Reorganize() : plonger->pprev is null");
1124 if (pfork == plonger)
1126 if (!(pfork = pfork->pprev))
1127 return error("Reorganize() : pfork->pprev is null");
1130 // List of what to disconnect
1131 vector<CBlockIndex*> vDisconnect;
1132 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1133 vDisconnect.push_back(pindex);
1135 // List of what to connect
1136 vector<CBlockIndex*> vConnect;
1137 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1138 vConnect.push_back(pindex);
1139 reverse(vConnect.begin(), vConnect.end());
1141 // Disconnect shorter branch
1142 vector<CTransaction> vResurrect;
1143 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1146 if (!block.ReadFromDisk(pindex))
1147 return error("Reorganize() : ReadFromDisk for disconnect failed");
1148 if (!block.DisconnectBlock(txdb, pindex))
1149 return error("Reorganize() : DisconnectBlock failed");
1151 // Queue memory transactions to resurrect
1152 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1153 if (!tx.IsCoinBase())
1154 vResurrect.push_back(tx);
1157 // Connect longer branch
1158 vector<CTransaction> vDelete;
1159 for (int i = 0; i < vConnect.size(); i++)
1161 CBlockIndex* pindex = vConnect[i];
1163 if (!block.ReadFromDisk(pindex))
1164 return error("Reorganize() : ReadFromDisk for connect failed");
1165 if (!block.ConnectBlock(txdb, pindex))
1169 return error("Reorganize() : ConnectBlock failed");
1172 // Queue memory transactions to delete
1173 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1174 vDelete.push_back(tx);
1176 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1177 return error("Reorganize() : WriteHashBestChain failed");
1179 // Make sure it's successfully written to disk before changing memory structure
1180 if (!txdb.TxnCommit())
1181 return error("Reorganize() : TxnCommit failed");
1183 // Disconnect shorter branch
1184 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1186 pindex->pprev->pnext = NULL;
1188 // Connect longer branch
1189 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1191 pindex->pprev->pnext = pindex;
1193 // Resurrect memory transactions that were in the disconnected branch
1194 BOOST_FOREACH(CTransaction& tx, vResurrect)
1195 tx.AcceptToMemoryPool(txdb, false);
1197 // Delete redundant memory transactions that are in the connected branch
1198 BOOST_FOREACH(CTransaction& tx, vDelete)
1199 tx.RemoveFromMemoryPool();
1205 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1207 uint256 hash = GetHash();
1210 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1212 txdb.WriteHashBestChain(hash);
1213 if (!txdb.TxnCommit())
1214 return error("SetBestChain() : TxnCommit failed");
1215 pindexGenesisBlock = pindexNew;
1217 else if (hashPrevBlock == hashBestChain)
1219 // Adding to current best branch
1220 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1223 InvalidChainFound(pindexNew);
1224 return error("SetBestChain() : ConnectBlock failed");
1226 if (!txdb.TxnCommit())
1227 return error("SetBestChain() : TxnCommit failed");
1229 // Add to current best branch
1230 pindexNew->pprev->pnext = pindexNew;
1232 // Delete redundant memory transactions
1233 BOOST_FOREACH(CTransaction& tx, vtx)
1234 tx.RemoveFromMemoryPool();
1239 if (!Reorganize(txdb, pindexNew))
1242 InvalidChainFound(pindexNew);
1243 return error("SetBestChain() : Reorganize failed");
1247 // Update best block in wallet (so we can detect restored wallets)
1248 if (!IsInitialBlockDownload())
1250 const CBlockLocator locator(pindexNew);
1251 ::SetBestChain(locator);
1255 hashBestChain = hash;
1256 pindexBest = pindexNew;
1257 nBestHeight = pindexBest->nHeight;
1258 bnBestChainWork = pindexNew->bnChainWork;
1259 nTimeBestReceived = GetTime();
1260 nTransactionsUpdated++;
1261 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1267 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1269 // Check for duplicate
1270 uint256 hash = GetHash();
1271 if (mapBlockIndex.count(hash))
1272 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1274 // Construct new block index object
1275 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1277 return error("AddToBlockIndex() : new CBlockIndex failed");
1278 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1279 pindexNew->phashBlock = &((*mi).first);
1280 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1281 if (miPrev != mapBlockIndex.end())
1283 pindexNew->pprev = (*miPrev).second;
1284 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1286 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1290 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1291 if (!txdb.TxnCommit())
1295 if (pindexNew->bnChainWork > bnBestChainWork)
1296 if (!SetBestChain(txdb, pindexNew))
1301 if (pindexNew == pindexBest)
1303 // Notify UI to display prev block's coinbase if it was ours
1304 static uint256 hashPrevBestCoinBase;
1305 UpdatedTransaction(hashPrevBestCoinBase);
1306 hashPrevBestCoinBase = vtx[0].GetHash();
1316 bool CBlock::CheckBlock() const
1318 // These are checks that are independent of context
1319 // that can be verified before saving an orphan block.
1322 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1323 return error("CheckBlock() : size limits failed");
1325 // Check proof of work matches claimed amount
1326 if (!CheckProofOfWork(GetHash(), nBits))
1327 return error("CheckBlock() : proof of work failed");
1330 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1331 return error("CheckBlock() : block timestamp too far in the future");
1333 // First transaction must be coinbase, the rest must not be
1334 if (vtx.empty() || !vtx[0].IsCoinBase())
1335 return error("CheckBlock() : first tx is not coinbase");
1336 for (int i = 1; i < vtx.size(); i++)
1337 if (vtx[i].IsCoinBase())
1338 return error("CheckBlock() : more than one coinbase");
1340 // Check transactions
1341 BOOST_FOREACH(const CTransaction& tx, vtx)
1342 if (!tx.CheckTransaction())
1343 return error("CheckBlock() : CheckTransaction failed");
1345 // Check that it's not full of nonstandard transactions
1346 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1347 return error("CheckBlock() : too many nonstandard transactions");
1350 if (hashMerkleRoot != BuildMerkleTree())
1351 return error("CheckBlock() : hashMerkleRoot mismatch");
1356 bool CBlock::AcceptBlock()
1358 // Check for duplicate
1359 uint256 hash = GetHash();
1360 if (mapBlockIndex.count(hash))
1361 return error("AcceptBlock() : block already in mapBlockIndex");
1363 // Get prev block index
1364 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1365 if (mi == mapBlockIndex.end())
1366 return error("AcceptBlock() : prev block not found");
1367 CBlockIndex* pindexPrev = (*mi).second;
1368 int nHeight = pindexPrev->nHeight+1;
1370 // Check proof of work
1371 if (nBits != GetNextWorkRequired(pindexPrev, this))
1372 return error("AcceptBlock() : incorrect proof of work");
1374 // Check timestamp against prev
1375 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1376 return error("AcceptBlock() : block's timestamp is too early");
1378 // Check that all transactions are finalized
1379 BOOST_FOREACH(const CTransaction& tx, vtx)
1380 if (!tx.IsFinal(nHeight, GetBlockTime()))
1381 return error("AcceptBlock() : contains a non-final transaction");
1383 // Check that the block chain matches the known block chain up to a checkpoint
1384 if (!Checkpoints::CheckBlock(nHeight, hash))
1385 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1387 // Write block to history file
1388 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1389 return error("AcceptBlock() : out of disk space");
1390 unsigned int nFile = -1;
1391 unsigned int nBlockPos = 0;
1392 if (!WriteToDisk(nFile, nBlockPos))
1393 return error("AcceptBlock() : WriteToDisk failed");
1394 if (!AddToBlockIndex(nFile, nBlockPos))
1395 return error("AcceptBlock() : AddToBlockIndex failed");
1397 // Relay inventory, but don't relay old inventory during initial block download
1398 if (hashBestChain == hash)
1399 CRITICAL_BLOCK(cs_vNodes)
1400 BOOST_FOREACH(CNode* pnode, vNodes)
1401 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1402 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1407 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1409 // Check for duplicate
1410 uint256 hash = pblock->GetHash();
1411 if (mapBlockIndex.count(hash))
1412 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1413 if (mapOrphanBlocks.count(hash))
1414 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1416 // Preliminary checks
1417 if (!pblock->CheckBlock())
1418 return error("ProcessBlock() : CheckBlock FAILED");
1420 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1421 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1423 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1424 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1427 return error("ProcessBlock() : block with timestamp before last checkpoint");
1430 bnNewBlock.SetCompact(pblock->nBits);
1432 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1433 if (bnNewBlock > bnRequired)
1435 return error("ProcessBlock() : block with too little proof-of-work");
1440 // If don't already have its previous block, shunt it off to holding area until we get it
1441 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1443 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1444 CBlock* pblock2 = new CBlock(*pblock);
1445 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1446 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1448 // Ask this guy to fill in what we're missing
1450 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1455 if (!pblock->AcceptBlock())
1456 return error("ProcessBlock() : AcceptBlock FAILED");
1458 // Recursively process any orphan blocks that depended on this one
1459 vector<uint256> vWorkQueue;
1460 vWorkQueue.push_back(hash);
1461 for (int i = 0; i < vWorkQueue.size(); i++)
1463 uint256 hashPrev = vWorkQueue[i];
1464 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1465 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1468 CBlock* pblockOrphan = (*mi).second;
1469 if (pblockOrphan->AcceptBlock())
1470 vWorkQueue.push_back(pblockOrphan->GetHash());
1471 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1472 delete pblockOrphan;
1474 mapOrphanBlocksByPrev.erase(hashPrev);
1477 printf("ProcessBlock: ACCEPTED\n");
1488 bool CheckDiskSpace(uint64 nAdditionalBytes)
1490 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1492 // Check for 15MB because database could create another 10MB log file at any time
1493 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1496 string strMessage = _("Warning: Disk space is low ");
1497 strMiscWarning = strMessage;
1498 printf("*** %s\n", strMessage.c_str());
1499 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1500 CreateThread(Shutdown, NULL);
1506 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1510 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1513 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1515 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1524 static unsigned int nCurrentBlockFile = 1;
1526 FILE* AppendBlockFile(unsigned int& nFileRet)
1531 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1534 if (fseek(file, 0, SEEK_END) != 0)
1536 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1537 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1539 nFileRet = nCurrentBlockFile;
1543 nCurrentBlockFile++;
1547 bool LoadBlockIndex(bool fAllowNew)
1551 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1552 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1553 pchMessageStart[0] = 0xfa;
1554 pchMessageStart[1] = 0xbf;
1555 pchMessageStart[2] = 0xb5;
1556 pchMessageStart[3] = 0xda;
1563 if (!txdb.LoadBlockIndex())
1568 // Init with genesis block
1570 if (mapBlockIndex.empty())
1576 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1577 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1578 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1579 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1580 // vMerkleTree: 4a5e1e
1583 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1585 txNew.vin.resize(1);
1586 txNew.vout.resize(1);
1587 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1588 txNew.vout[0].nValue = 50 * COIN;
1589 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1591 block.vtx.push_back(txNew);
1592 block.hashPrevBlock = 0;
1593 block.hashMerkleRoot = block.BuildMerkleTree();
1595 block.nTime = 1231006505;
1596 block.nBits = 0x1d00ffff;
1597 block.nNonce = 2083236893;
1601 block.nTime = 1296688602;
1602 block.nBits = 0x1d07fff8;
1603 block.nNonce = 384568319;
1607 printf("%s\n", block.GetHash().ToString().c_str());
1608 printf("%s\n", hashGenesisBlock.ToString().c_str());
1609 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1610 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1612 assert(block.GetHash() == hashGenesisBlock);
1614 // Start new block file
1616 unsigned int nBlockPos;
1617 if (!block.WriteToDisk(nFile, nBlockPos))
1618 return error("LoadBlockIndex() : writing genesis block to disk failed");
1619 if (!block.AddToBlockIndex(nFile, nBlockPos))
1620 return error("LoadBlockIndex() : genesis block not accepted");
1628 void PrintBlockTree()
1630 // precompute tree structure
1631 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1632 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1634 CBlockIndex* pindex = (*mi).second;
1635 mapNext[pindex->pprev].push_back(pindex);
1637 //while (rand() % 3 == 0)
1638 // mapNext[pindex->pprev].push_back(pindex);
1641 vector<pair<int, CBlockIndex*> > vStack;
1642 vStack.push_back(make_pair(0, pindexGenesisBlock));
1645 while (!vStack.empty())
1647 int nCol = vStack.back().first;
1648 CBlockIndex* pindex = vStack.back().second;
1651 // print split or gap
1652 if (nCol > nPrevCol)
1654 for (int i = 0; i < nCol-1; i++)
1658 else if (nCol < nPrevCol)
1660 for (int i = 0; i < nCol; i++)
1667 for (int i = 0; i < nCol; i++)
1672 block.ReadFromDisk(pindex);
1673 printf("%d (%u,%u) %s %s tx %d",
1677 block.GetHash().ToString().substr(0,20).c_str(),
1678 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1681 PrintWallets(block);
1683 // put the main timechain first
1684 vector<CBlockIndex*>& vNext = mapNext[pindex];
1685 for (int i = 0; i < vNext.size(); i++)
1687 if (vNext[i]->pnext)
1689 swap(vNext[0], vNext[i]);
1695 for (int i = 0; i < vNext.size(); i++)
1696 vStack.push_back(make_pair(nCol+i, vNext[i]));
1709 //////////////////////////////////////////////////////////////////////////////
1714 map<uint256, CAlert> mapAlerts;
1715 CCriticalSection cs_mapAlerts;
1717 string GetWarnings(string strFor)
1720 string strStatusBar;
1722 if (GetBoolArg("-testsafemode"))
1725 // Misc warnings like out of disk space and clock is wrong
1726 if (strMiscWarning != "")
1729 strStatusBar = strMiscWarning;
1732 // Longer invalid proof-of-work chain
1733 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1736 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1740 CRITICAL_BLOCK(cs_mapAlerts)
1742 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1744 const CAlert& alert = item.second;
1745 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1747 nPriority = alert.nPriority;
1748 strStatusBar = alert.strStatusBar;
1753 if (strFor == "statusbar")
1754 return strStatusBar;
1755 else if (strFor == "rpc")
1757 assert(!"GetWarnings() : invalid parameter");
1761 bool CAlert::ProcessAlert()
1763 if (!CheckSignature())
1768 CRITICAL_BLOCK(cs_mapAlerts)
1770 // Cancel previous alerts
1771 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1773 const CAlert& alert = (*mi).second;
1776 printf("cancelling alert %d\n", alert.nID);
1777 mapAlerts.erase(mi++);
1779 else if (!alert.IsInEffect())
1781 printf("expiring alert %d\n", alert.nID);
1782 mapAlerts.erase(mi++);
1788 // Check if this alert has been cancelled
1789 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1791 const CAlert& alert = item.second;
1792 if (alert.Cancels(*this))
1794 printf("alert already cancelled by %d\n", alert.nID);
1800 mapAlerts.insert(make_pair(GetHash(), *this));
1803 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1815 //////////////////////////////////////////////////////////////////////////////
1821 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1825 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1826 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1828 // Don't know what it is, just say we already got one
1835 // The message start string is designed to be unlikely to occur in normal data.
1836 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1837 // a large 4-byte int at any alignment.
1838 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1841 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1843 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1844 RandAddSeedPerfmon();
1846 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1847 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1849 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1851 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1859 if (strCommand == "version")
1861 // Each connection can only send one version message
1862 if (pfrom->nVersion != 0)
1869 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1870 if (pfrom->nVersion == 10300)
1871 pfrom->nVersion = 300;
1872 if (pfrom->nVersion >= 106 && !vRecv.empty())
1873 vRecv >> addrFrom >> nNonce;
1874 if (pfrom->nVersion >= 106 && !vRecv.empty())
1875 vRecv >> pfrom->strSubVer;
1876 if (pfrom->nVersion >= 209 && !vRecv.empty())
1877 vRecv >> pfrom->nStartingHeight;
1879 if (pfrom->nVersion == 0)
1882 // Disconnect if we connected to ourself
1883 if (nNonce == nLocalHostNonce && nNonce > 1)
1885 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1886 pfrom->fDisconnect = true;
1890 // Be shy and don't send version until we hear
1891 if (pfrom->fInbound)
1892 pfrom->PushVersion();
1894 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1896 AddTimeData(pfrom->addr.ip, nTime);
1899 if (pfrom->nVersion >= 209)
1900 pfrom->PushMessage("verack");
1901 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1902 if (pfrom->nVersion < 209)
1903 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1905 if (!pfrom->fInbound)
1907 // Advertise our address
1908 if (addrLocalHost.IsRoutable() && !fUseProxy)
1910 CAddress addr(addrLocalHost);
1911 addr.nTime = GetAdjustedTime();
1912 pfrom->PushAddress(addr);
1915 // Get recent addresses
1916 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1918 pfrom->PushMessage("getaddr");
1919 pfrom->fGetAddr = true;
1923 // Ask the first connected node for block updates
1924 static int nAskedForBlocks;
1925 if (!pfrom->fClient &&
1926 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1927 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1930 pfrom->PushGetBlocks(pindexBest, uint256(0));
1934 CRITICAL_BLOCK(cs_mapAlerts)
1935 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1936 item.second.RelayTo(pfrom);
1938 pfrom->fSuccessfullyConnected = true;
1940 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1944 else if (pfrom->nVersion == 0)
1946 // Must have a version message before anything else
1951 else if (strCommand == "verack")
1953 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1957 else if (strCommand == "addr")
1959 vector<CAddress> vAddr;
1962 // Don't want addr from older versions unless seeding
1963 if (pfrom->nVersion < 209)
1965 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1967 if (vAddr.size() > 1000)
1968 return error("message addr size() = %d", vAddr.size());
1970 // Store the new addresses
1973 int64 nNow = GetAdjustedTime();
1974 int64 nSince = nNow - 10 * 60;
1975 BOOST_FOREACH(CAddress& addr, vAddr)
1979 // ignore IPv6 for now, since it isn't implemented anyway
1982 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1983 addr.nTime = nNow - 5 * 24 * 60 * 60;
1984 AddAddress(addr, 2 * 60 * 60, &addrDB);
1985 pfrom->AddAddressKnown(addr);
1986 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1988 // Relay to a limited number of other nodes
1989 CRITICAL_BLOCK(cs_vNodes)
1991 // Use deterministic randomness to send to the same nodes for 24 hours
1992 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1993 static uint256 hashSalt;
1995 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1996 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1997 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1998 multimap<uint256, CNode*> mapMix;
1999 BOOST_FOREACH(CNode* pnode, vNodes)
2001 if (pnode->nVersion < 31402)
2003 unsigned int nPointer;
2004 memcpy(&nPointer, &pnode, sizeof(nPointer));
2005 uint256 hashKey = hashRand ^ nPointer;
2006 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2007 mapMix.insert(make_pair(hashKey, pnode));
2009 int nRelayNodes = 2;
2010 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2011 ((*mi).second)->PushAddress(addr);
2015 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2016 if (vAddr.size() < 1000)
2017 pfrom->fGetAddr = false;
2021 else if (strCommand == "inv")
2025 if (vInv.size() > 50000)
2026 return error("message inv size() = %d", vInv.size());
2029 BOOST_FOREACH(const CInv& inv, vInv)
2033 pfrom->AddInventoryKnown(inv);
2035 bool fAlreadyHave = AlreadyHave(txdb, inv);
2037 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2041 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2042 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2044 // Track requests for our stuff
2045 Inventory(inv.hash);
2050 else if (strCommand == "getdata")
2054 if (vInv.size() > 50000)
2055 return error("message getdata size() = %d", vInv.size());
2057 BOOST_FOREACH(const CInv& inv, vInv)
2061 printf("received getdata for: %s\n", inv.ToString().c_str());
2063 if (inv.type == MSG_BLOCK)
2065 // Send block from disk
2066 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2067 if (mi != mapBlockIndex.end())
2070 block.ReadFromDisk((*mi).second);
2071 pfrom->PushMessage("block", block);
2073 // Trigger them to send a getblocks request for the next batch of inventory
2074 if (inv.hash == pfrom->hashContinue)
2076 // Bypass PushInventory, this must send even if redundant,
2077 // and we want it right after the last block so they don't
2078 // wait for other stuff first.
2080 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2081 pfrom->PushMessage("inv", vInv);
2082 pfrom->hashContinue = 0;
2086 else if (inv.IsKnownType())
2088 // Send stream from relay memory
2089 CRITICAL_BLOCK(cs_mapRelay)
2091 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2092 if (mi != mapRelay.end())
2093 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2097 // Track requests for our stuff
2098 Inventory(inv.hash);
2103 else if (strCommand == "getblocks")
2105 CBlockLocator locator;
2107 vRecv >> locator >> hashStop;
2109 // Find the last block the caller has in the main chain
2110 CBlockIndex* pindex = locator.GetBlockIndex();
2112 // Send the rest of the chain
2114 pindex = pindex->pnext;
2115 int nLimit = 500 + locator.GetDistanceBack();
2116 unsigned int nBytes = 0;
2117 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2118 for (; pindex; pindex = pindex->pnext)
2120 if (pindex->GetBlockHash() == hashStop)
2122 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2125 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2127 block.ReadFromDisk(pindex, true);
2128 nBytes += block.GetSerializeSize(SER_NETWORK);
2129 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2131 // When this block is requested, we'll send an inv that'll make them
2132 // getblocks the next batch of inventory.
2133 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2134 pfrom->hashContinue = pindex->GetBlockHash();
2141 else if (strCommand == "getheaders")
2143 CBlockLocator locator;
2145 vRecv >> locator >> hashStop;
2147 CBlockIndex* pindex = NULL;
2148 if (locator.IsNull())
2150 // If locator is null, return the hashStop block
2151 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2152 if (mi == mapBlockIndex.end())
2154 pindex = (*mi).second;
2158 // Find the last block the caller has in the main chain
2159 pindex = locator.GetBlockIndex();
2161 pindex = pindex->pnext;
2164 vector<CBlock> vHeaders;
2165 int nLimit = 2000 + locator.GetDistanceBack();
2166 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2167 for (; pindex; pindex = pindex->pnext)
2169 vHeaders.push_back(pindex->GetBlockHeader());
2170 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2173 pfrom->PushMessage("headers", vHeaders);
2177 else if (strCommand == "tx")
2179 vector<uint256> vWorkQueue;
2180 CDataStream vMsg(vRecv);
2184 CInv inv(MSG_TX, tx.GetHash());
2185 pfrom->AddInventoryKnown(inv);
2187 bool fMissingInputs = false;
2188 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2190 SyncWithWallets(tx, NULL, true);
2191 RelayMessage(inv, vMsg);
2192 mapAlreadyAskedFor.erase(inv);
2193 vWorkQueue.push_back(inv.hash);
2195 // Recursively process any orphan transactions that depended on this one
2196 for (int i = 0; i < vWorkQueue.size(); i++)
2198 uint256 hashPrev = vWorkQueue[i];
2199 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2200 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2203 const CDataStream& vMsg = *((*mi).second);
2205 CDataStream(vMsg) >> tx;
2206 CInv inv(MSG_TX, tx.GetHash());
2208 if (tx.AcceptToMemoryPool(true))
2210 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2211 SyncWithWallets(tx, NULL, true);
2212 RelayMessage(inv, vMsg);
2213 mapAlreadyAskedFor.erase(inv);
2214 vWorkQueue.push_back(inv.hash);
2219 BOOST_FOREACH(uint256 hash, vWorkQueue)
2220 EraseOrphanTx(hash);
2222 else if (fMissingInputs)
2224 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2227 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2228 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2230 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2235 else if (strCommand == "block")
2240 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2243 CInv inv(MSG_BLOCK, block.GetHash());
2244 pfrom->AddInventoryKnown(inv);
2246 if (ProcessBlock(pfrom, &block))
2247 mapAlreadyAskedFor.erase(inv);
2251 else if (strCommand == "getaddr")
2253 // Nodes rebroadcast an addr every 24 hours
2254 pfrom->vAddrToSend.clear();
2255 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2256 CRITICAL_BLOCK(cs_mapAddresses)
2258 unsigned int nCount = 0;
2259 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2261 const CAddress& addr = item.second;
2262 if (addr.nTime > nSince)
2265 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2267 const CAddress& addr = item.second;
2268 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2269 pfrom->PushAddress(addr);
2275 else if (strCommand == "checkorder")
2280 if (!GetBoolArg("-allowreceivebyip"))
2282 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2289 /// we have a chance to check the order here
2291 // Keep giving the same key to the same ip until they use it
2292 if (!mapReuseKey.count(pfrom->addr.ip))
2293 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2295 // Send back approval of order and pubkey to use
2296 CScript scriptPubKey;
2297 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2298 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2302 else if (strCommand == "reply")
2307 CRequestTracker tracker;
2308 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2310 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2311 if (mi != pfrom->mapRequests.end())
2313 tracker = (*mi).second;
2314 pfrom->mapRequests.erase(mi);
2317 if (!tracker.IsNull())
2318 tracker.fn(tracker.param1, vRecv);
2322 else if (strCommand == "ping")
2327 else if (strCommand == "alert")
2332 if (alert.ProcessAlert())
2335 pfrom->setKnown.insert(alert.GetHash());
2336 CRITICAL_BLOCK(cs_vNodes)
2337 BOOST_FOREACH(CNode* pnode, vNodes)
2338 alert.RelayTo(pnode);
2345 // Ignore unknown commands for extensibility
2349 // Update the last seen time for this node's address
2350 if (pfrom->fNetworkNode)
2351 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2352 AddressCurrentlyConnected(pfrom->addr);
2358 bool ProcessMessages(CNode* pfrom)
2360 CDataStream& vRecv = pfrom->vRecv;
2364 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2368 // (4) message start
2377 // Scan for message start
2378 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2379 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2380 if (vRecv.end() - pstart < nHeaderSize)
2382 if (vRecv.size() > nHeaderSize)
2384 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2385 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2389 if (pstart - vRecv.begin() > 0)
2390 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2391 vRecv.erase(vRecv.begin(), pstart);
2394 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2399 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2402 string strCommand = hdr.GetCommand();
2405 unsigned int nMessageSize = hdr.nMessageSize;
2406 if (nMessageSize > MAX_SIZE)
2408 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2411 if (nMessageSize > vRecv.size())
2413 // Rewind and wait for rest of message
2414 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2419 if (vRecv.GetVersion() >= 209)
2421 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2422 unsigned int nChecksum = 0;
2423 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2424 if (nChecksum != hdr.nChecksum)
2426 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2427 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2432 // Copy message to its own buffer
2433 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2434 vRecv.ignore(nMessageSize);
2440 CRITICAL_BLOCK(cs_main)
2441 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2445 catch (std::ios_base::failure& e)
2447 if (strstr(e.what(), "end of data"))
2449 // Allow exceptions from underlength message on vRecv
2450 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());
2452 else if (strstr(e.what(), "size too large"))
2454 // Allow exceptions from overlong size
2455 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2459 PrintExceptionContinue(&e, "ProcessMessage()");
2462 catch (std::exception& e) {
2463 PrintExceptionContinue(&e, "ProcessMessage()");
2465 PrintExceptionContinue(NULL, "ProcessMessage()");
2469 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2477 bool SendMessages(CNode* pto, bool fSendTrickle)
2479 CRITICAL_BLOCK(cs_main)
2481 // Don't send anything until we get their version message
2482 if (pto->nVersion == 0)
2486 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2487 pto->PushMessage("ping");
2489 // Resend wallet transactions that haven't gotten in a block yet
2490 ResendWalletTransactions();
2492 // Address refresh broadcast
2493 static int64 nLastRebroadcast;
2494 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2496 nLastRebroadcast = GetTime();
2497 CRITICAL_BLOCK(cs_vNodes)
2499 BOOST_FOREACH(CNode* pnode, vNodes)
2501 // Periodically clear setAddrKnown to allow refresh broadcasts
2502 pnode->setAddrKnown.clear();
2504 // Rebroadcast our address
2505 if (addrLocalHost.IsRoutable() && !fUseProxy)
2507 CAddress addr(addrLocalHost);
2508 addr.nTime = GetAdjustedTime();
2509 pnode->PushAddress(addr);
2515 // Clear out old addresses periodically so it's not too much work at once
2516 static int64 nLastClear;
2517 if (nLastClear == 0)
2518 nLastClear = GetTime();
2519 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2521 nLastClear = GetTime();
2522 CRITICAL_BLOCK(cs_mapAddresses)
2525 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2526 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2527 mi != mapAddresses.end();)
2529 const CAddress& addr = (*mi).second;
2530 if (addr.nTime < nSince)
2532 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2534 addrdb.EraseAddress(addr);
2535 mapAddresses.erase(mi++);
2549 vector<CAddress> vAddr;
2550 vAddr.reserve(pto->vAddrToSend.size());
2551 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2553 // returns true if wasn't already contained in the set
2554 if (pto->setAddrKnown.insert(addr).second)
2556 vAddr.push_back(addr);
2557 // receiver rejects addr messages larger than 1000
2558 if (vAddr.size() >= 1000)
2560 pto->PushMessage("addr", vAddr);
2565 pto->vAddrToSend.clear();
2567 pto->PushMessage("addr", vAddr);
2572 // Message: inventory
2575 vector<CInv> vInvWait;
2576 CRITICAL_BLOCK(pto->cs_inventory)
2578 vInv.reserve(pto->vInventoryToSend.size());
2579 vInvWait.reserve(pto->vInventoryToSend.size());
2580 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2582 if (pto->setInventoryKnown.count(inv))
2585 // trickle out tx inv to protect privacy
2586 if (inv.type == MSG_TX && !fSendTrickle)
2588 // 1/4 of tx invs blast to all immediately
2589 static uint256 hashSalt;
2591 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2592 uint256 hashRand = inv.hash ^ hashSalt;
2593 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2594 bool fTrickleWait = ((hashRand & 3) != 0);
2596 // always trickle our own transactions
2600 if (GetTransaction(inv.hash, wtx))
2602 fTrickleWait = true;
2607 vInvWait.push_back(inv);
2612 // returns true if wasn't already contained in the set
2613 if (pto->setInventoryKnown.insert(inv).second)
2615 vInv.push_back(inv);
2616 if (vInv.size() >= 1000)
2618 pto->PushMessage("inv", vInv);
2623 pto->vInventoryToSend = vInvWait;
2626 pto->PushMessage("inv", vInv);
2632 vector<CInv> vGetData;
2633 int64 nNow = GetTime() * 1000000;
2635 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2637 const CInv& inv = (*pto->mapAskFor.begin()).second;
2638 if (!AlreadyHave(txdb, inv))
2640 printf("sending getdata: %s\n", inv.ToString().c_str());
2641 vGetData.push_back(inv);
2642 if (vGetData.size() >= 1000)
2644 pto->PushMessage("getdata", vGetData);
2648 mapAlreadyAskedFor[inv] = nNow;
2649 pto->mapAskFor.erase(pto->mapAskFor.begin());
2651 if (!vGetData.empty())
2652 pto->PushMessage("getdata", vGetData);
2671 //////////////////////////////////////////////////////////////////////////////
2676 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2678 unsigned char* pdata = (unsigned char*)pbuffer;
2679 unsigned int blocks = 1 + ((len + 8) / 64);
2680 unsigned char* pend = pdata + 64 * blocks;
2681 memset(pdata + len, 0, 64 * blocks - len);
2683 unsigned int bits = len * 8;
2684 pend[-1] = (bits >> 0) & 0xff;
2685 pend[-2] = (bits >> 8) & 0xff;
2686 pend[-3] = (bits >> 16) & 0xff;
2687 pend[-4] = (bits >> 24) & 0xff;
2691 using CryptoPP::ByteReverse;
2693 static const unsigned int pSHA256InitState[8] =
2694 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2696 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2698 memcpy(pstate, pinit, 32);
2699 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2703 // ScanHash scans nonces looking for a hash with at least some zero bits.
2704 // It operates on big endian data. Caller does the byte reversing.
2705 // All input buffers are 16-byte aligned. nNonce is usually preserved
2706 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2707 // the block is rebuilt and nNonce starts over at zero.
2709 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2711 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2715 // Hash pdata using pmidstate as the starting state into
2716 // preformatted buffer phash1, then hash phash1 into phash
2718 SHA256Transform(phash1, pdata, pmidstate);
2719 SHA256Transform(phash, phash1, pSHA256InitState);
2721 // Return the nonce if the hash has at least some zero bits,
2722 // caller will check if it has enough to reach the target
2723 if (((unsigned short*)phash)[14] == 0)
2726 // If nothing found after trying for a while, return -1
2727 if ((nNonce & 0xffff) == 0)
2729 nHashesDone = 0xffff+1;
2735 // Some explaining would be appreciated
2740 set<uint256> setDependsOn;
2743 COrphan(CTransaction* ptxIn)
2751 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2752 BOOST_FOREACH(uint256 hash, setDependsOn)
2753 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2758 CBlock* CreateNewBlock(CReserveKey& reservekey)
2760 CBlockIndex* pindexPrev = pindexBest;
2763 auto_ptr<CBlock> pblock(new CBlock());
2767 // Create coinbase tx
2769 txNew.vin.resize(1);
2770 txNew.vin[0].prevout.SetNull();
2771 txNew.vout.resize(1);
2772 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2774 // Add our coinbase tx as first transaction
2775 pblock->vtx.push_back(txNew);
2777 // Collect memory pool transactions into the block
2779 CRITICAL_BLOCK(cs_main)
2780 CRITICAL_BLOCK(cs_mapTransactions)
2784 // Priority order to process transactions
2785 list<COrphan> vOrphan; // list memory doesn't move
2786 map<uint256, vector<COrphan*> > mapDependers;
2787 multimap<double, CTransaction*> mapPriority;
2788 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2790 CTransaction& tx = (*mi).second;
2791 if (tx.IsCoinBase() || !tx.IsFinal())
2794 COrphan* porphan = NULL;
2795 double dPriority = 0;
2796 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2798 // Read prev transaction
2799 CTransaction txPrev;
2801 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2803 // Has to wait for dependencies
2806 // Use list for automatic deletion
2807 vOrphan.push_back(COrphan(&tx));
2808 porphan = &vOrphan.back();
2810 mapDependers[txin.prevout.hash].push_back(porphan);
2811 porphan->setDependsOn.insert(txin.prevout.hash);
2814 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2816 // Read block header
2817 int nConf = txindex.GetDepthInMainChain();
2819 dPriority += (double)nValueIn * nConf;
2821 if (fDebug && GetBoolArg("-printpriority"))
2822 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2825 // Priority is sum(valuein * age) / txsize
2826 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2829 porphan->dPriority = dPriority;
2831 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2833 if (fDebug && GetBoolArg("-printpriority"))
2835 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2842 // Collect transactions into block
2843 map<uint256, CTxIndex> mapTestPool;
2844 uint64 nBlockSize = 1000;
2845 int nBlockSigOps = 100;
2846 while (!mapPriority.empty())
2848 // Take highest priority transaction off priority queue
2849 double dPriority = -(*mapPriority.begin()).first;
2850 CTransaction& tx = *(*mapPriority.begin()).second;
2851 mapPriority.erase(mapPriority.begin());
2854 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2855 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2857 int nTxSigOps = tx.GetSigOpCount();
2858 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2861 // Transaction fee required depends on block size
2862 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2863 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
2865 // Connecting shouldn't fail due to dependency on other memory pool transactions
2866 // because we're already processing them in order of dependency
2867 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2869 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee, fInvalid))
2871 swap(mapTestPool, mapTestPoolTmp);
2874 pblock->vtx.push_back(tx);
2875 nBlockSize += nTxSize;
2876 nBlockSigOps += nTxSigOps;
2878 // Add transactions that depend on this one to the priority queue
2879 uint256 hash = tx.GetHash();
2880 if (mapDependers.count(hash))
2882 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2884 if (!porphan->setDependsOn.empty())
2886 porphan->setDependsOn.erase(hash);
2887 if (porphan->setDependsOn.empty())
2888 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2894 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2897 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2898 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2899 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2900 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
2903 return pblock.release();
2907 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2909 // Update nExtraNonce
2910 static uint256 hashPrevBlock;
2911 if (hashPrevBlock != pblock->hashPrevBlock)
2914 hashPrevBlock = pblock->hashPrevBlock;
2917 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2918 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2922 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2925 // Prebuild hash buffers
2932 uint256 hashPrevBlock;
2933 uint256 hashMerkleRoot;
2936 unsigned int nNonce;
2939 unsigned char pchPadding0[64];
2941 unsigned char pchPadding1[64];
2944 memset(&tmp, 0, sizeof(tmp));
2946 tmp.block.nVersion = pblock->nVersion;
2947 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2948 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2949 tmp.block.nTime = pblock->nTime;
2950 tmp.block.nBits = pblock->nBits;
2951 tmp.block.nNonce = pblock->nNonce;
2953 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2954 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2956 // Byte swap all the input buffer
2957 for (int i = 0; i < sizeof(tmp)/4; i++)
2958 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2960 // Precalc the first half of the first hash, which stays constant
2961 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2963 memcpy(pdata, &tmp.block, 128);
2964 memcpy(phash1, &tmp.hash1, 64);
2968 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2970 uint256 hash = pblock->GetHash();
2971 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2973 if (hash > hashTarget)
2977 printf("BitcoinMiner:\n");
2978 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2980 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2981 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2984 CRITICAL_BLOCK(cs_main)
2986 if (pblock->hashPrevBlock != hashBestChain)
2987 return error("BitcoinMiner : generated block is stale");
2989 // Remove key from key pool
2990 reservekey.KeepKey();
2992 // Track how many getdata requests this block gets
2993 CRITICAL_BLOCK(wallet.cs_wallet)
2994 wallet.mapRequestCount[pblock->GetHash()] = 0;
2996 // Process this block the same as if we had received it from another node
2997 if (!ProcessBlock(NULL, pblock))
2998 return error("BitcoinMiner : ProcessBlock, block not accepted");
3005 void static ThreadBitcoinMiner(void* parg);
3007 void static BitcoinMiner(CWallet *pwallet)
3009 printf("BitcoinMiner started\n");
3010 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3012 // Each thread has its own key and counter
3013 CReserveKey reservekey(pwallet);
3014 unsigned int nExtraNonce = 0;
3016 while (fGenerateBitcoins)
3018 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3022 while (vNodes.empty() || IsInitialBlockDownload())
3027 if (!fGenerateBitcoins)
3035 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3036 CBlockIndex* pindexPrev = pindexBest;
3038 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3041 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3043 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3047 // Prebuild hash buffers
3049 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3050 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3051 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3053 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3055 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3056 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3062 int64 nStart = GetTime();
3063 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3065 uint256& hash = *alignup<16>(hashbuf);
3068 unsigned int nHashesDone = 0;
3069 unsigned int nNonceFound;
3072 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3073 (char*)&hash, nHashesDone);
3075 // Check if something found
3076 if (nNonceFound != -1)
3078 for (int i = 0; i < sizeof(hash)/4; i++)
3079 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3081 if (hash <= hashTarget)
3084 pblock->nNonce = ByteReverse(nNonceFound);
3085 assert(hash == pblock->GetHash());
3087 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3088 CheckWork(pblock.get(), *pwalletMain, reservekey);
3089 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3095 static int64 nHashCounter;
3096 if (nHPSTimerStart == 0)
3098 nHPSTimerStart = GetTimeMillis();
3102 nHashCounter += nHashesDone;
3103 if (GetTimeMillis() - nHPSTimerStart > 4000)
3105 static CCriticalSection cs;
3108 if (GetTimeMillis() - nHPSTimerStart > 4000)
3110 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3111 nHPSTimerStart = GetTimeMillis();
3113 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3114 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3115 static int64 nLogTime;
3116 if (GetTime() - nLogTime > 30 * 60)
3118 nLogTime = GetTime();
3119 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3120 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3126 // Check for stop or if block needs to be rebuilt
3129 if (!fGenerateBitcoins)
3131 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3135 if (nBlockNonce >= 0xffff0000)
3137 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3139 if (pindexPrev != pindexBest)
3142 // Update nTime every few seconds
3143 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3144 nBlockTime = ByteReverse(pblock->nTime);
3149 void static ThreadBitcoinMiner(void* parg)
3151 CWallet* pwallet = (CWallet*)parg;
3154 vnThreadsRunning[3]++;
3155 BitcoinMiner(pwallet);
3156 vnThreadsRunning[3]--;
3158 catch (std::exception& e) {
3159 vnThreadsRunning[3]--;
3160 PrintException(&e, "ThreadBitcoinMiner()");
3162 vnThreadsRunning[3]--;
3163 PrintException(NULL, "ThreadBitcoinMiner()");
3165 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3167 if (vnThreadsRunning[3] == 0)
3169 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3173 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3175 if (fGenerateBitcoins != fGenerate)
3177 fGenerateBitcoins = fGenerate;
3178 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3181 if (fGenerateBitcoins)
3183 int nProcessors = boost::thread::hardware_concurrency();
3184 printf("%d processors\n", nProcessors);
3185 if (nProcessors < 1)
3187 if (fLimitProcessors && nProcessors > nLimitProcessors)
3188 nProcessors = nLimitProcessors;
3189 int nAddThreads = nProcessors - vnThreadsRunning[3];
3190 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3191 for (int i = 0; i < nAddThreads; i++)
3193 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3194 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");