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.
9 #include <boost/array.hpp>
10 #include <boost/foreach.hpp>
11 #include <openssl/rand.h>
14 #include <arpa/inet.h>
23 class CRequestTracker;
26 extern int nBestHeight;
30 inline unsigned int ReceiveBufferSize() { return 1000*GetArg("-maxreceivebuffer", 10*1000); }
31 inline unsigned int SendBufferSize() { return 1000*GetArg("-maxsendbuffer", 10*1000); }
33 bool RecvLine(SOCKET hSocket, std::string& strLine);
34 bool GetMyExternalIP(CNetAddr& ipRet);
35 void AddressCurrentlyConnected(const CService& addr);
36 CNode* FindNode(const CNetAddr& ip);
37 CNode* FindNode(const CService& ip);
38 CNode* ConnectNode(CAddress addrConnect, int64 nTimeout=0);
39 void MapPort(bool fMapPort);
40 bool BindListenPort(std::string& strError=REF(std::string()));
41 void StartNode(void* parg);
53 void (*fn)(void*, CDataStream&);
56 explicit CRequestTracker(void (*fnIn)(void*, CDataStream&)=NULL, void* param1In=NULL)
73 THREAD_OPENCONNECTIONS,
74 THREAD_MESSAGEHANDLER,
79 THREAD_ADDEDCONNECTIONS,
86 extern bool fAllowDNS;
87 extern uint64 nLocalServices;
88 extern CAddress addrLocalHost;
89 extern uint64 nLocalHostNonce;
90 extern boost::array<int, THREAD_MAX> vnThreadsRunning;
91 extern CAddrMan addrman;
93 extern std::vector<CNode*> vNodes;
94 extern CCriticalSection cs_vNodes;
95 extern std::map<CInv, CDataStream> mapRelay;
96 extern std::deque<std::pair<int64, CInv> > vRelayExpiration;
97 extern CCriticalSection cs_mapRelay;
98 extern std::map<CInv, int64> mapAlreadyAskedFor;
105 /** Information about a peer */
114 CCriticalSection cs_vSend;
115 CCriticalSection cs_vRecv;
118 int64 nLastSendEmpty;
119 int64 nTimeConnected;
120 unsigned int nHeaderStart;
121 unsigned int nMessageStart;
124 std::string strSubVer;
128 bool fSuccessfullyConnected;
133 // Denial-of-service detection/prevention
134 // Key is ip address, value is banned-until-time
135 static std::map<CNetAddr, int64> setBanned;
136 static CCriticalSection cs_setBanned;
141 std::map<uint256, CRequestTracker> mapRequests;
142 CCriticalSection cs_mapRequests;
143 uint256 hashContinue;
144 CBlockIndex* pindexLastGetBlocksBegin;
145 uint256 hashLastGetBlocksEnd;
149 std::vector<CAddress> vAddrToSend;
150 std::set<CAddress> setAddrKnown;
152 std::set<uint256> setKnown;
154 // inventory based relay
155 mruset<CInv> setInventoryKnown;
156 std::vector<CInv> vInventoryToSend;
157 CCriticalSection cs_inventory;
158 std::multimap<int64, CInv> mapAskFor;
160 CNode(SOCKET hSocketIn, CAddress addrIn, bool fInboundIn=false)
164 vSend.SetType(SER_NETWORK);
165 vRecv.SetType(SER_NETWORK);
166 vSend.SetVersion(209);
167 vRecv.SetVersion(209);
170 nLastSendEmpty = GetTime();
171 nTimeConnected = GetTime();
177 fClient = false; // set by version message
178 fInbound = fInboundIn;
179 fNetworkNode = false;
180 fSuccessfullyConnected = false;
185 pindexLastGetBlocksBegin = 0;
186 hashLastGetBlocksEnd = 0;
187 nStartingHeight = -1;
190 setInventoryKnown.max_size(SendBufferSize() / 1000);
192 // Be shy and don't send version until we hear
199 if (hSocket != INVALID_SOCKET)
201 closesocket(hSocket);
202 hSocket = INVALID_SOCKET;
208 void operator=(const CNode&);
214 return std::max(nRefCount, 0) + (GetTime() < nReleaseTime ? 1 : 0);
217 CNode* AddRef(int64 nTimeout=0)
220 nReleaseTime = std::max(nReleaseTime, GetTime() + nTimeout);
233 void AddAddressKnown(const CAddress& addr)
235 setAddrKnown.insert(addr);
238 void PushAddress(const CAddress& addr)
240 // Known checking here is only to save space from duplicates.
241 // SendMessages will filter it again for knowns that were added
242 // after addresses were pushed.
243 if (addr.IsValid() && !setAddrKnown.count(addr))
244 vAddrToSend.push_back(addr);
248 void AddInventoryKnown(const CInv& inv)
252 setInventoryKnown.insert(inv);
256 void PushInventory(const CInv& inv)
260 if (!setInventoryKnown.count(inv))
261 vInventoryToSend.push_back(inv);
265 void AskFor(const CInv& inv)
267 // We're using mapAskFor as a priority queue,
268 // the key is the earliest time the request can be sent
269 int64& nRequestTime = mapAlreadyAskedFor[inv];
270 printf("askfor %s %"PRI64d"\n", inv.ToString().c_str(), nRequestTime);
272 // Make sure not to reuse time indexes to keep things in the same order
273 int64 nNow = (GetTime() - 1) * 1000000;
274 static int64 nLastTime;
276 nNow = std::max(nNow, nLastTime);
279 // Each retry is 2 minutes after the last
280 nRequestTime = std::max(nRequestTime + 2 * 60 * 1000000, nNow);
281 mapAskFor.insert(std::make_pair(nRequestTime, inv));
286 void BeginMessage(const char* pszCommand)
288 ENTER_CRITICAL_SECTION(cs_vSend);
289 if (nHeaderStart != -1)
291 nHeaderStart = vSend.size();
292 vSend << CMessageHeader(pszCommand, 0);
293 nMessageStart = vSend.size();
295 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
296 printf("sending: %s ", pszCommand);
302 if (nHeaderStart == -1)
304 vSend.resize(nHeaderStart);
307 LEAVE_CRITICAL_SECTION(cs_vSend);
310 printf("(aborted)\n");
315 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
317 printf("dropmessages DROPPING SEND MESSAGE\n");
322 if (nHeaderStart == -1)
326 unsigned int nSize = vSend.size() - nMessageStart;
327 memcpy((char*)&vSend[nHeaderStart] + offsetof(CMessageHeader, nMessageSize), &nSize, sizeof(nSize));
330 uint256 hash = Hash(vSend.begin() + nMessageStart, vSend.end());
331 unsigned int nChecksum = 0;
332 memcpy(&nChecksum, &hash, sizeof(nChecksum));
333 assert(nMessageStart - nHeaderStart >= offsetof(CMessageHeader, nChecksum) + sizeof(nChecksum));
334 memcpy((char*)&vSend[nHeaderStart] + offsetof(CMessageHeader, nChecksum), &nChecksum, sizeof(nChecksum));
337 printf("(%d bytes)\n", nSize);
342 LEAVE_CRITICAL_SECTION(cs_vSend);
345 void EndMessageAbortIfEmpty()
347 if (nHeaderStart == -1)
349 int nSize = vSend.size() - nMessageStart;
361 void PushMessage(const char* pszCommand)
365 BeginMessage(pszCommand);
375 template<typename T1>
376 void PushMessage(const char* pszCommand, const T1& a1)
380 BeginMessage(pszCommand);
391 template<typename T1, typename T2>
392 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2)
396 BeginMessage(pszCommand);
407 template<typename T1, typename T2, typename T3>
408 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3)
412 BeginMessage(pszCommand);
413 vSend << a1 << a2 << a3;
423 template<typename T1, typename T2, typename T3, typename T4>
424 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4)
428 BeginMessage(pszCommand);
429 vSend << a1 << a2 << a3 << a4;
439 template<typename T1, typename T2, typename T3, typename T4, typename T5>
440 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5)
444 BeginMessage(pszCommand);
445 vSend << a1 << a2 << a3 << a4 << a5;
455 template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
456 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5, const T6& a6)
460 BeginMessage(pszCommand);
461 vSend << a1 << a2 << a3 << a4 << a5 << a6;
471 template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
472 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5, const T6& a6, const T7& a7)
476 BeginMessage(pszCommand);
477 vSend << a1 << a2 << a3 << a4 << a5 << a6 << a7;
487 template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
488 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5, const T6& a6, const T7& a7, const T8& a8)
492 BeginMessage(pszCommand);
493 vSend << a1 << a2 << a3 << a4 << a5 << a6 << a7 << a8;
503 template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
504 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5, const T6& a6, const T7& a7, const T8& a8, const T9& a9)
508 BeginMessage(pszCommand);
509 vSend << a1 << a2 << a3 << a4 << a5 << a6 << a7 << a8 << a9;
520 void PushRequest(const char* pszCommand,
521 void (*fn)(void*, CDataStream&), void* param1)
524 RAND_bytes((unsigned char*)&hashReply, sizeof(hashReply));
527 LOCK(cs_mapRequests);
528 mapRequests[hashReply] = CRequestTracker(fn, param1);
531 PushMessage(pszCommand, hashReply);
534 template<typename T1>
535 void PushRequest(const char* pszCommand, const T1& a1,
536 void (*fn)(void*, CDataStream&), void* param1)
539 RAND_bytes((unsigned char*)&hashReply, sizeof(hashReply));
542 LOCK(cs_mapRequests);
543 mapRequests[hashReply] = CRequestTracker(fn, param1);
546 PushMessage(pszCommand, hashReply, a1);
549 template<typename T1, typename T2>
550 void PushRequest(const char* pszCommand, const T1& a1, const T2& a2,
551 void (*fn)(void*, CDataStream&), void* param1)
554 RAND_bytes((unsigned char*)&hashReply, sizeof(hashReply));
557 LOCK(cs_mapRequests);
558 mapRequests[hashReply] = CRequestTracker(fn, param1);
561 PushMessage(pszCommand, hashReply, a1, a2);
566 void PushGetBlocks(CBlockIndex* pindexBegin, uint256 hashEnd);
567 bool IsSubscribed(unsigned int nChannel);
568 void Subscribe(unsigned int nChannel, unsigned int nHops=0);
569 void CancelSubscribe(unsigned int nChannel);
570 void CloseSocketDisconnect();
574 // Denial-of-service detection/prevention
575 // The idea is to detect peers that are behaving
576 // badly and disconnect/ban them, but do it in a
577 // one-coding-mistake-won't-shatter-the-entire-network
579 // IMPORTANT: There should be nothing I can give a
580 // node that it will forward on that will make that
581 // node's peers drop it. If there is, an attacker
582 // can isolate a node and/or try to split the network.
583 // Dropping a node for sending stuff that is invalid
584 // now but might be valid in a later version is also
585 // dangerous, because it can cause a network split
586 // between nodes running old code and nodes running
588 static void ClearBanned(); // needed for unit testing
589 static bool IsBanned(CNetAddr ip);
590 bool Misbehaving(int howmuch); // 1 == a little, 100 == a lot
602 inline void RelayInventory(const CInv& inv)
604 // Put on lists to offer to the other nodes
607 BOOST_FOREACH(CNode* pnode, vNodes)
608 pnode->PushInventory(inv);
613 void RelayMessage(const CInv& inv, const T& a)
615 CDataStream ss(SER_NETWORK);
618 RelayMessage(inv, ss);
622 inline void RelayMessage<>(const CInv& inv, const CDataStream& ss)
626 // Expire old relay messages
627 while (!vRelayExpiration.empty() && vRelayExpiration.front().first < GetTime())
629 mapRelay.erase(vRelayExpiration.front().second);
630 vRelayExpiration.pop_front();
633 // Save original serialized message so newer versions are preserved
635 vRelayExpiration.push_back(std::make_pair(GetTime() + 15 * 60, inv));