1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 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>
20 class CRequestTracker;
23 extern int nBestHeight;
24 extern int nConnectTimeout;
28 inline unsigned int ReceiveBufferSize() { return 1000*GetArg("-maxreceivebuffer", 10*1000); }
29 inline unsigned int SendBufferSize() { return 1000*GetArg("-maxsendbuffer", 10*1000); }
30 static const unsigned int PUBLISH_HOPS = 5;
32 bool ConnectSocket(const CAddress& addrConnect, SOCKET& hSocketRet, int nTimeout=nConnectTimeout);
33 bool Lookup(const char *pszName, std::vector<CAddress>& vaddr, int nServices, int nMaxSolutions, bool fAllowLookup = false, int portDefault = 0, bool fAllowPort = false);
34 bool Lookup(const char *pszName, CAddress& addr, int nServices, bool fAllowLookup = false, int portDefault = 0, bool fAllowPort = false);
35 bool GetMyExternalIP(unsigned int& ipRet);
36 bool AddAddress(CAddress addr, int64 nTimePenalty=0, CAddrDB *pAddrDB=NULL);
37 void AddressCurrentlyConnected(const CAddress& addr);
38 CNode* FindNode(unsigned int ip);
39 CNode* ConnectNode(CAddress addrConnect, int64 nTimeout=0);
40 void AbandonRequests(void (*fn)(void*, CDataStream&), void* param1);
41 bool AnySubscribed(unsigned int nChannel);
42 void MapPort(bool fMapPort);
43 void DNSAddressSeed();
44 bool BindListenPort(std::string& strError=REF(std::string()));
45 void StartNode(void* parg);
57 void (*fn)(void*, CDataStream&);
60 explicit CRequestTracker(void (*fnIn)(void*, CDataStream&)=NULL, void* param1In=NULL)
77 extern bool fAllowDNS;
78 extern uint64 nLocalServices;
79 extern CAddress addrLocalHost;
80 extern uint64 nLocalHostNonce;
81 extern boost::array<int, 10> vnThreadsRunning;
83 extern std::vector<CNode*> vNodes;
84 extern CCriticalSection cs_vNodes;
85 extern std::map<std::vector<unsigned char>, CAddress> mapAddresses;
86 extern CCriticalSection cs_mapAddresses;
87 extern std::map<CInv, CDataStream> mapRelay;
88 extern std::deque<std::pair<int64, CInv> > vRelayExpiration;
89 extern CCriticalSection cs_mapRelay;
90 extern std::map<CInv, int64> mapAlreadyAskedFor;
94 extern CAddress addrProxy;
109 CCriticalSection cs_vSend;
110 CCriticalSection cs_vRecv;
113 int64 nLastSendEmpty;
114 int64 nTimeConnected;
115 unsigned int nHeaderStart;
116 unsigned int nMessageStart;
119 std::string strSubVer;
123 bool fSuccessfullyConnected;
128 // Denial-of-service detection/prevention
129 // Key is ip address, value is banned-until-time
130 static std::map<unsigned int, int64> setBanned;
131 static CCriticalSection cs_setBanned;
136 std::map<uint256, CRequestTracker> mapRequests;
137 CCriticalSection cs_mapRequests;
138 uint256 hashContinue;
139 CBlockIndex* pindexLastGetBlocksBegin;
140 uint256 hashLastGetBlocksEnd;
144 std::vector<CAddress> vAddrToSend;
145 std::set<CAddress> setAddrKnown;
147 std::set<uint256> setKnown;
149 // inventory based relay
150 std::set<CInv> setInventoryKnown;
151 std::vector<CInv> vInventoryToSend;
152 CCriticalSection cs_inventory;
153 std::multimap<int64, CInv> mapAskFor;
155 // publish and subscription
156 std::vector<char> vfSubscribe;
158 CNode(SOCKET hSocketIn, CAddress addrIn, bool fInboundIn=false)
162 vSend.SetType(SER_NETWORK);
164 vRecv.SetType(SER_NETWORK);
166 // Version 0.2 obsoletes 20 Feb 2012
167 if (GetTime() > 1329696000)
169 vSend.SetVersion(209);
170 vRecv.SetVersion(209);
174 nLastSendEmpty = GetTime();
175 nTimeConnected = GetTime();
181 fClient = false; // set by version message
182 fInbound = fInboundIn;
183 fNetworkNode = false;
184 fSuccessfullyConnected = false;
189 pindexLastGetBlocksBegin = 0;
190 hashLastGetBlocksEnd = 0;
191 nStartingHeight = -1;
193 vfSubscribe.assign(256, false);
196 // Be shy and don't send version until we hear
203 if (hSocket != INVALID_SOCKET)
205 closesocket(hSocket);
206 hSocket = INVALID_SOCKET;
212 void operator=(const CNode&);
218 return std::max(nRefCount, 0) + (GetTime() < nReleaseTime ? 1 : 0);
221 CNode* AddRef(int64 nTimeout=0)
224 nReleaseTime = std::max(nReleaseTime, GetTime() + nTimeout);
237 void AddAddressKnown(const CAddress& addr)
239 setAddrKnown.insert(addr);
242 void PushAddress(const CAddress& addr)
244 // Known checking here is only to save space from duplicates.
245 // SendMessages will filter it again for knowns that were added
246 // after addresses were pushed.
247 if (addr.IsValid() && !setAddrKnown.count(addr))
248 vAddrToSend.push_back(addr);
252 void AddInventoryKnown(const CInv& inv)
254 CRITICAL_BLOCK(cs_inventory)
255 setInventoryKnown.insert(inv);
258 void PushInventory(const CInv& inv)
260 CRITICAL_BLOCK(cs_inventory)
261 if (!setInventoryKnown.count(inv))
262 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;
275 nLastTime = nNow = std::max(nNow, ++nLastTime);
277 // Each retry is 2 minutes after the last
278 nRequestTime = std::max(nRequestTime + 2 * 60 * 1000000, nNow);
279 mapAskFor.insert(std::make_pair(nRequestTime, inv));
284 void BeginMessage(const char* pszCommand)
286 cs_vSend.Enter("cs_vSend", __FILE__, __LINE__);
287 if (nHeaderStart != -1)
289 nHeaderStart = vSend.size();
290 vSend << CMessageHeader(pszCommand, 0);
291 nMessageStart = vSend.size();
293 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
294 printf("sending: %s ", pszCommand);
300 if (nHeaderStart == -1)
302 vSend.resize(nHeaderStart);
308 printf("(aborted)\n");
313 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
315 printf("dropmessages DROPPING SEND MESSAGE\n");
320 if (nHeaderStart == -1)
324 unsigned int nSize = vSend.size() - nMessageStart;
325 memcpy((char*)&vSend[nHeaderStart] + offsetof(CMessageHeader, nMessageSize), &nSize, sizeof(nSize));
328 if (vSend.GetVersion() >= 209)
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));
338 printf("(%d bytes)\n", nSize);
346 void EndMessageAbortIfEmpty()
348 if (nHeaderStart == -1)
350 int nSize = vSend.size() - nMessageStart;
361 /// when NTP implemented, change to just nTime = GetAdjustedTime()
362 int64 nTime = (fInbound ? GetAdjustedTime() : GetTime());
363 CAddress addrYou = (fUseProxy ? CAddress("0.0.0.0") : addr);
364 CAddress addrMe = (fUseProxy ? CAddress("0.0.0.0") : addrLocalHost);
365 RAND_bytes((unsigned char*)&nLocalHostNonce, sizeof(nLocalHostNonce));
366 PushMessage("version", VERSION, nLocalServices, nTime, addrYou, addrMe,
367 nLocalHostNonce, std::string(pszSubVer), nBestHeight);
373 void PushMessage(const char* pszCommand)
377 BeginMessage(pszCommand);
387 template<typename T1>
388 void PushMessage(const char* pszCommand, const T1& a1)
392 BeginMessage(pszCommand);
403 template<typename T1, typename T2>
404 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2)
408 BeginMessage(pszCommand);
419 template<typename T1, typename T2, typename T3>
420 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3)
424 BeginMessage(pszCommand);
425 vSend << a1 << a2 << a3;
435 template<typename T1, typename T2, typename T3, typename T4>
436 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4)
440 BeginMessage(pszCommand);
441 vSend << a1 << a2 << a3 << a4;
451 template<typename T1, typename T2, typename T3, typename T4, typename T5>
452 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5)
456 BeginMessage(pszCommand);
457 vSend << a1 << a2 << a3 << a4 << a5;
467 template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
468 void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5, const T6& a6)
472 BeginMessage(pszCommand);
473 vSend << a1 << a2 << a3 << a4 << a5 << a6;
483 template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
484 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)
488 BeginMessage(pszCommand);
489 vSend << a1 << a2 << a3 << a4 << a5 << a6 << a7;
499 template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
500 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)
504 BeginMessage(pszCommand);
505 vSend << a1 << a2 << a3 << a4 << a5 << a6 << a7 << a8;
515 template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
516 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)
520 BeginMessage(pszCommand);
521 vSend << a1 << a2 << a3 << a4 << a5 << a6 << a7 << a8 << a9;
532 void PushRequest(const char* pszCommand,
533 void (*fn)(void*, CDataStream&), void* param1)
536 RAND_bytes((unsigned char*)&hashReply, sizeof(hashReply));
538 CRITICAL_BLOCK(cs_mapRequests)
539 mapRequests[hashReply] = CRequestTracker(fn, param1);
541 PushMessage(pszCommand, hashReply);
544 template<typename T1>
545 void PushRequest(const char* pszCommand, const T1& a1,
546 void (*fn)(void*, CDataStream&), void* param1)
549 RAND_bytes((unsigned char*)&hashReply, sizeof(hashReply));
551 CRITICAL_BLOCK(cs_mapRequests)
552 mapRequests[hashReply] = CRequestTracker(fn, param1);
554 PushMessage(pszCommand, hashReply, a1);
557 template<typename T1, typename T2>
558 void PushRequest(const char* pszCommand, const T1& a1, const T2& a2,
559 void (*fn)(void*, CDataStream&), void* param1)
562 RAND_bytes((unsigned char*)&hashReply, sizeof(hashReply));
564 CRITICAL_BLOCK(cs_mapRequests)
565 mapRequests[hashReply] = CRequestTracker(fn, param1);
567 PushMessage(pszCommand, hashReply, a1, a2);
572 void PushGetBlocks(CBlockIndex* pindexBegin, uint256 hashEnd);
573 bool IsSubscribed(unsigned int nChannel);
574 void Subscribe(unsigned int nChannel, unsigned int nHops=0);
575 void CancelSubscribe(unsigned int nChannel);
576 void CloseSocketDisconnect();
580 // Denial-of-service detection/prevention
581 // The idea is to detect peers that are behaving
582 // badly and disconnect/ban them, but do it in a
583 // one-coding-mistake-won't-shatter-the-entire-network
585 // IMPORTANT: There should be nothing I can give a
586 // node that it will forward on that will make that
587 // node's peers drop it. If there is, an attacker
588 // can isolate a node and/or try to split the network.
589 // Dropping a node for sending stuff that is invalid
590 // now but might be valid in a later version is also
591 // dangerous, because it can cause a network split
592 // between nodes running old code and nodes running
594 static void ClearBanned(); // needed for unit testing
595 static bool IsBanned(unsigned int ip);
596 bool Misbehaving(int howmuch); // 1 == a little, 100 == a lot
608 inline void RelayInventory(const CInv& inv)
610 // Put on lists to offer to the other nodes
611 CRITICAL_BLOCK(cs_vNodes)
612 BOOST_FOREACH(CNode* pnode, vNodes)
613 pnode->PushInventory(inv);
617 void RelayMessage(const CInv& inv, const T& a)
619 CDataStream ss(SER_NETWORK);
622 RelayMessage(inv, ss);
626 inline void RelayMessage<>(const CInv& inv, const CDataStream& ss)
628 CRITICAL_BLOCK(cs_mapRelay)
630 // Expire old relay messages
631 while (!vRelayExpiration.empty() && vRelayExpiration.front().first < GetTime())
633 mapRelay.erase(vRelayExpiration.front().second);
634 vRelayExpiration.pop_front();
637 // Save original serialized message so newer versions are preserved
639 vRelayExpiration.push_back(std::make_pair(GetTime() + 15 * 60, inv));
653 // Templates for the publish and subscription system.
654 // The object being published as T& obj needs to have:
655 // a set<unsigned int> setSources member
656 // specializations of AdvertInsert and AdvertErase
657 // Currently implemented for CTable and CProduct.
661 void AdvertStartPublish(CNode* pfrom, unsigned int nChannel, unsigned int nHops, T& obj)
664 obj.setSources.insert(pfrom->addr.ip);
666 if (!AdvertInsert(obj))
670 CRITICAL_BLOCK(cs_vNodes)
671 BOOST_FOREACH(CNode* pnode, vNodes)
672 if (pnode != pfrom && (nHops < PUBLISH_HOPS || pnode->IsSubscribed(nChannel)))
673 pnode->PushMessage("publish", nChannel, nHops, obj);
677 void AdvertStopPublish(CNode* pfrom, unsigned int nChannel, unsigned int nHops, T& obj)
679 uint256 hash = obj.GetHash();
681 CRITICAL_BLOCK(cs_vNodes)
682 BOOST_FOREACH(CNode* pnode, vNodes)
683 if (pnode != pfrom && (nHops < PUBLISH_HOPS || pnode->IsSubscribed(nChannel)))
684 pnode->PushMessage("pub-cancel", nChannel, nHops, hash);
690 void AdvertRemoveSource(CNode* pfrom, unsigned int nChannel, unsigned int nHops, T& obj)
693 obj.setSources.erase(pfrom->addr.ip);
695 // If no longer supported by any sources, cancel it
696 if (obj.setSources.empty())
697 AdvertStopPublish(pfrom, nChannel, nHops, obj);