udptrs.cpp 44 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196
  1. /*##############################################################################
  2. HPCC SYSTEMS software Copyright (C) 2012 HPCC Systems®.
  3. Licensed under the Apache License, Version 2.0 (the "License");
  4. you may not use this file except in compliance with the License.
  5. You may obtain a copy of the License at
  6. http://www.apache.org/licenses/LICENSE-2.0
  7. Unless required by applicable law or agreed to in writing, software
  8. distributed under the License is distributed on an "AS IS" BASIS,
  9. WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  10. See the License for the specific language governing permissions and
  11. limitations under the License.
  12. ############################################################################## */
  13. #include "udplib.hpp"
  14. #include "udpsha.hpp"
  15. #include "udptrs.hpp"
  16. #include "udpipmap.hpp"
  17. #include "jsocket.hpp"
  18. #include "jlog.hpp"
  19. #include "jencrypt.hpp"
  20. #include "jsecrets.hpp"
  21. #include "roxie.hpp"
  22. #ifdef _WIN32
  23. #include <winsock.h>
  24. #else
  25. #include <sys/socket.h>
  26. #include <sys/time.h>
  27. #include <sys/resource.h>
  28. #endif
  29. #include <math.h>
  30. #include <atomic>
  31. unsigned udpOutQsPriority = 0;
  32. unsigned udpMaxRetryTimedoutReqs = 0; // 0 means off (keep retrying forever)
  33. unsigned udpRequestToSendTimeout = 0; // value in milliseconds - 0 means calculate from query timeouts
  34. unsigned udpRequestToSendAckTimeout = 10; // value in milliseconds
  35. #ifdef _DEBUG
  36. //#define TEST_DROPPED_PACKETS
  37. #endif
  38. using roxiemem::DataBuffer;
  39. /*
  40. *
  41. * There are 3 threads running to manage the data transfer from agent back to server:
  42. * send_resend_flow
  43. * - checks periodically that nothing is waiting for a "request to send" that timed out
  44. * send_receive_flow
  45. * - waits on socket receiving "ok_to_send" packets from servers
  46. * - updates state of relevant receivers
  47. * - pushes permission tokens to a queue
  48. * send_data
  49. * - waits on queue of permission tokens
  50. * - broadcasts "busy"
  51. * - writes data to server
  52. * - broadcasts "no longer "
  53. * - sends "completed" or "completed but I want to send more" flow message to server
  54. *
  55. * Queueing up data packets is done by the agent worker threads.
  56. * *
  57. *
  58. * Data races to watch for
  59. * 1. Two agent threads add data at same time - only one should sent rts (use atomic_inc for the count)
  60. * 2. We check for timeout and resend rts or fail just as permission comes in
  61. * - resend rts is harmless ?
  62. * - fail is acceptable
  63. * 3. After sending data, we need to decide whether to set state to 'pending' (and send rts) or empty. If we read count, decide it's zero
  64. * and then (before we set state) someone adds data (and sends rts), we must not set state to empty. CAS to set state empty only if
  65. * it's sending_data perhaps?
  66. * 4. While sending data, someone adds new data. They need to send rts and set state to pending whether empty or sending_data
  67. * 5. Do we need sending_data state? Is it the same as empty, really? Is empty the same as 'count==0' ? Do we even need state?
  68. * - send rts whenever incrementing count from zero
  69. * - resend rts if count is non-zero and timed out
  70. * - resend rts if we send data but there is some remaining
  71. */
  72. // UdpResentList keeps a copy of up to TRACKER_BITS previously sent packets so we can send them again
  73. RelaxedAtomic<unsigned> packetsResent;
  74. RelaxedAtomic<unsigned> flowRequestsSent;
  75. RelaxedAtomic<unsigned> flowPermitsReceived;
  76. RelaxedAtomic<unsigned> dataPacketsSent;
  77. unsigned udpResendTimeout; // in millseconds
  78. bool udpResendLostPackets;
  79. bool udpAssumeSequential;
  80. static unsigned lastResentReport = 0;
  81. static unsigned lastPacketsResent = 0;
  82. static unsigned lastFlowRequestsSent = 0;
  83. static unsigned lastFlowPermitsReceived = 0;
  84. static unsigned lastDataPacketsSent = 0;
  85. class UdpResendList
  86. {
  87. private:
  88. DataBuffer *entries[TRACKER_BITS] = { nullptr };
  89. unsigned timeSent[TRACKER_BITS] = { 0 };
  90. sequence_t first = 0;
  91. unsigned count = 0; // number of non-null entries
  92. public:
  93. void append(DataBuffer *buf)
  94. {
  95. UdpPacketHeader *header = (UdpPacketHeader*) buf->data;
  96. sequence_t seq = header->sendSeq;
  97. header->pktSeq |= UDP_PACKET_RESENT;
  98. if (!count)
  99. {
  100. first = seq;
  101. }
  102. else if (seq - first >= TRACKER_BITS)
  103. {
  104. // This shouldn't happen if we have steps in place to block ending new until we are sure old have been delivered.
  105. throwUnexpected();
  106. }
  107. unsigned idx = seq % TRACKER_BITS;
  108. assert(entries[idx] == nullptr);
  109. entries[idx] = buf;
  110. timeSent[idx] = msTick();
  111. count++;
  112. }
  113. // This function does two things:
  114. // 1. Updates the circular buffer to release any packets that are confirmed delivered
  115. // 2. Appends any packets that need resending to the toSend list
  116. void noteRead(const PacketTracker &seen, std::vector<DataBuffer *> &toSend, unsigned space, unsigned nextSendSequence)
  117. {
  118. if (!count)
  119. return;
  120. unsigned now = msTick();
  121. sequence_t seq = first;
  122. unsigned checked = 0;
  123. bool released = false;
  124. while (checked < count && space)
  125. {
  126. unsigned idx = seq % TRACKER_BITS;
  127. if (entries[idx])
  128. {
  129. UdpPacketHeader *header = (UdpPacketHeader*) entries[idx]->data;
  130. assert(seq == header->sendSeq);
  131. if (seen.hasSeen(header->sendSeq))
  132. {
  133. ::Release(entries[idx]);
  134. entries[idx] = nullptr;
  135. count--;
  136. released = true;
  137. }
  138. else
  139. {
  140. // The current table entry is not marked as seen by receiver. Should we resend it?
  141. if (now-timeSent[idx] >= udpResendTimeout || // Note that this will block us from sending newer packets, if we have reached limit of tracking.
  142. (udpAssumeSequential && (int)(seq - seen.lastSeen()) < 0)) // so we (optionally) assume any packet not received that is EARLIER than one that HAS been received is lost.
  143. {
  144. if (udpTraceLevel > 1)
  145. DBGLOG("Resending %" SEQF "u last sent %u ms ago", seq, now-timeSent[idx]);
  146. timeSent[idx] = now;
  147. packetsResent++;
  148. toSend.push_back(entries[idx]);
  149. space--;
  150. }
  151. checked++;
  152. }
  153. }
  154. seq++;
  155. }
  156. if (released && count)
  157. {
  158. while (entries[first % TRACKER_BITS] == nullptr)
  159. first++;
  160. }
  161. }
  162. unsigned firstTracked() const
  163. {
  164. assert(count); // Meaningless to call this if count is 0
  165. return first;
  166. }
  167. unsigned numActive() const
  168. {
  169. return count;
  170. }
  171. bool canRecord(unsigned seq) const
  172. {
  173. return (count==0 || seq - first < TRACKER_BITS);
  174. }
  175. };
  176. class UdpReceiverEntry : public IUdpReceiverEntry
  177. {
  178. UdpReceiverEntry() = delete;
  179. UdpReceiverEntry ( const UdpReceiverEntry & ) = delete;
  180. private:
  181. queue_t *output_queue = nullptr;
  182. bool initialized = false;
  183. const bool isLocal = false;
  184. const bool encrypted = false;
  185. ISocket *send_flow_socket = nullptr;
  186. ISocket *data_socket = nullptr;
  187. const unsigned numQueues;
  188. int current_q = 0;
  189. int currentQNumPkts = 0; // Current Queue Number of Consecutive Processed Packets.
  190. int *maxPktsPerQ = nullptr; // to minimise power function re-calc for every packet
  191. void sendRequest(UdpRequestToSendMsg &msg)
  192. {
  193. try
  194. {
  195. if (udpTraceLevel > 3 || udpTraceFlow)
  196. {
  197. StringBuffer s;
  198. DBGLOG("UdpSender: sending flowType::%s msg %" SEQF "u flowSeq %" SEQF "u to node=%s", flowType::name(msg.cmd), msg.sendSeq, msg.flowSeq, ip.getIpText(s).str());
  199. }
  200. send_flow_socket->write(&msg, sizeof(UdpRequestToSendMsg));
  201. flowRequestsSent++;
  202. }
  203. catch(IException *e)
  204. {
  205. StringBuffer s;
  206. DBGLOG("UdpSender: sendRequest write failed - %s", e->errorMessage(s).str());
  207. e->Release();
  208. }
  209. catch (...)
  210. {
  211. DBGLOG("UdpSender: sendRequest write failed - unknown error");
  212. }
  213. }
  214. const IpAddress sourceIP;
  215. UdpResendList *resendList = nullptr;
  216. public:
  217. const IpAddress ip;
  218. unsigned timeouts = 0; // Number of consecutive timeouts
  219. std::atomic<unsigned> requestExpiryTime = { 0 }; // Updated by send_flow thread, read by send_resend thread and send_data thread
  220. static bool comparePacket(const void *pkData, const void *key)
  221. {
  222. UdpPacketHeader *dataHdr = (UdpPacketHeader*) ((DataBuffer*)pkData)->data;
  223. UdpPacketHeader *keyHdr = (UdpPacketHeader*) key;
  224. return ( (dataHdr->ruid == keyHdr->ruid) && (dataHdr->msgId == keyHdr->msgId) );
  225. }
  226. std::atomic<unsigned> packetsQueued = { 0 };
  227. std::atomic<sequence_t> nextSendSequence = {0};
  228. std::atomic<sequence_t> activeFlowSequence = {0};
  229. CriticalSection activeCrit;
  230. void sendDone(unsigned packets)
  231. {
  232. //This function has a potential race condition with requestToSendNew:
  233. //packetsQueued must be checked within the critical section to ensure that requestToSend hasn't been called
  234. //between retrieving the count and entering the critical section, otherwise this function will set
  235. //requestExpiryTime to 0 (and indicate the operation is done)even though there packetsQueued is non-zero.
  236. CriticalBlock b(activeCrit);
  237. bool dataRemaining;
  238. if (resendList)
  239. dataRemaining = (packetsQueued.load(std::memory_order_relaxed) && resendList->canRecord(nextSendSequence)) || resendList->numActive();
  240. else
  241. dataRemaining = packetsQueued.load(std::memory_order_relaxed);
  242. // If dataRemaining says 0, but someone adds a row in this window, the request_to_send will be sent BEFORE the send_completed
  243. // So long as receiver handles that, are we good?
  244. UdpRequestToSendMsg msg;
  245. msg.packets = packets; // Note this is how many we sent
  246. msg.sendSeq = nextSendSequence;
  247. msg.sourceNode = sourceIP;
  248. if (dataRemaining && requestExpiryTime) // requestExpiryTime will be non-zero UNLESS someone called abort() just before I got here
  249. {
  250. msg.flowSeq = activeFlowSequence++;
  251. msg.cmd = flowType::request_to_send_more;
  252. requestExpiryTime = msTick() + udpRequestToSendAckTimeout;
  253. }
  254. else
  255. {
  256. msg.flowSeq = activeFlowSequence;
  257. msg.cmd = flowType::send_completed;
  258. requestExpiryTime = 0;
  259. }
  260. sendRequest(msg);
  261. timeouts = 0;
  262. }
  263. void requestToSendNew()
  264. {
  265. //See comment in sendDone() on a potential race condition.
  266. CriticalBlock b(activeCrit);
  267. // This is called from data thread when new data added to a previously-empty list
  268. if (!requestExpiryTime)
  269. {
  270. // If there's already an active request - no need to create a new one
  271. UdpRequestToSendMsg msg;
  272. msg.cmd = flowType::request_to_send;
  273. msg.packets = 0;
  274. msg.sendSeq = nextSendSequence;
  275. msg.flowSeq = ++activeFlowSequence;
  276. msg.sourceNode = sourceIP;
  277. requestExpiryTime = msTick() + udpRequestToSendAckTimeout;
  278. sendRequest(msg);
  279. }
  280. }
  281. void resendRequestToSend()
  282. {
  283. // This is called from timeout thread when a previously-send request has had no response
  284. timeouts++;
  285. if (udpTraceLevel || udpTraceFlow || udpTraceTimeouts)
  286. {
  287. StringBuffer s;
  288. EXCLOG(MCoperatorError,"ERROR: UdpSender: timed out %i times (max=%i) waiting ok_to_send msg from node=%s",
  289. timeouts, udpMaxRetryTimedoutReqs, ip.getIpText(s).str());
  290. }
  291. // 0 (zero) value of udpMaxRetryTimedoutReqs means NO limit on retries
  292. CriticalBlock b(activeCrit);
  293. if (udpMaxRetryTimedoutReqs && (timeouts >= udpMaxRetryTimedoutReqs))
  294. {
  295. abort();
  296. return;
  297. }
  298. if (requestExpiryTime)
  299. {
  300. UdpRequestToSendMsg msg;
  301. msg.cmd = flowType::request_to_send;
  302. msg.packets = 0;
  303. msg.sendSeq = nextSendSequence;
  304. msg.flowSeq = activeFlowSequence;
  305. msg.sourceNode = sourceIP;
  306. requestExpiryTime = msTick() + udpRequestToSendAckTimeout;
  307. sendRequest(msg);
  308. }
  309. }
  310. void requestAcknowledged()
  311. {
  312. CriticalBlock b(activeCrit);
  313. if (requestExpiryTime)
  314. requestExpiryTime = msTick() + udpRequestToSendTimeout;
  315. }
  316. unsigned sendData(const UdpPermitToSendMsg &permit, TokenBucket *bucket)
  317. {
  318. #ifdef _DEBUG
  319. // Consistency check
  320. if (permit.destNode.getIpAddress().ipcompare(ip) != 0)
  321. {
  322. StringBuffer p, s;
  323. DBGLOG("UdpFlow: permit ip %s does not match receiver table ip %s", permit.destNode.getTraceText(p).str(), ip.getIpText(s).str());
  324. printStackReport();
  325. }
  326. #endif
  327. if (permit.flowSeq != activeFlowSequence)
  328. {
  329. if (udpTraceLevel>1 || udpTraceFlow)
  330. {
  331. StringBuffer s;
  332. DBGLOG("UdpFlow: ignoring out-of-date permit_to_send seq %" SEQF "u (expected %" SEQF "u) to node %s", permit.flowSeq, activeFlowSequence+0, permit.destNode.getTraceText(s).str());
  333. }
  334. return 0;
  335. }
  336. unsigned maxPackets = permit.max_data;
  337. std::vector<DataBuffer *> toSend;
  338. unsigned totalSent = 0;
  339. unsigned resending = 0;
  340. if (resendList)
  341. {
  342. resendList->noteRead(permit.seen, toSend, maxPackets, nextSendSequence.load(std::memory_order_relaxed));
  343. resending = toSend.size();
  344. maxPackets -= resending;
  345. // Don't send any packet that would end up overwriting an active packet in our resend list
  346. if (resendList->numActive())
  347. {
  348. unsigned inflight = nextSendSequence - resendList->firstTracked();
  349. assert(inflight <= TRACKER_BITS);
  350. if (maxPackets > TRACKER_BITS-inflight)
  351. {
  352. maxPackets = TRACKER_BITS-inflight;
  353. if (udpTraceLevel>2 || maxPackets == 0)
  354. DBGLOG("Can't send more than %d new packets or we will overwrite unreceived packets (%u in flight, %u active %u resending now)", maxPackets, inflight, resendList->numActive(), resending);
  355. // Note that this may mean we can't send any packets, despite having asked for permission to do so
  356. // We will keep on asking.
  357. }
  358. }
  359. }
  360. if (udpTraceLevel>2)
  361. DBGLOG("Resending %u packets", (unsigned) toSend.size());
  362. while (maxPackets && packetsQueued.load(std::memory_order_relaxed))
  363. {
  364. DataBuffer *buffer = popQueuedData();
  365. if (!buffer)
  366. break; // Suggests data was aborted before we got to pop it
  367. UdpPacketHeader *header = (UdpPacketHeader*) buffer->data;
  368. header->sendSeq = nextSendSequence++;
  369. toSend.push_back(buffer);
  370. maxPackets--;
  371. totalSent += header->length;
  372. #if defined(__linux__) || defined(__APPLE__)
  373. if (isLocal && (totalSent> 100000)) // Avoids sending too fast to local node, for reasons lost in the mists of time
  374. break;
  375. #endif
  376. }
  377. MemoryBuffer encryptBuffer;
  378. for (DataBuffer *buffer: toSend)
  379. {
  380. UdpPacketHeader *header = (UdpPacketHeader*) buffer->data;
  381. unsigned length = header->length;
  382. if (bucket)
  383. {
  384. MTIME_SECTION(queryActiveTimer(), "bucket_wait");
  385. bucket->wait((length / 1024)+1);
  386. }
  387. try
  388. {
  389. #ifdef TEST_DROPPED_PACKETS
  390. if (((header->pktSeq & UDP_PACKET_RESENT)==0) && (header->pktSeq==0 || header->pktSeq==10 || ((header->pktSeq&UDP_PACKET_COMPLETE) != 0)))
  391. DBGLOG("Deliberately dropping packet %" SEQF "u", header->sendSeq);
  392. else
  393. #endif
  394. if (encrypted)
  395. {
  396. encryptBuffer.clear();
  397. encryptBuffer.append(sizeof(UdpPacketHeader), header); // We don't encrypt the header
  398. length -= sizeof(UdpPacketHeader);
  399. const char *data = buffer->data + sizeof(UdpPacketHeader);
  400. const MemoryAttr &udpkey = getSecretUdpKey(true);
  401. aesEncrypt(udpkey.get(), udpkey.length(), data, length, encryptBuffer);
  402. header->length = encryptBuffer.length();
  403. encryptBuffer.writeDirect(0, sizeof(UdpPacketHeader), header); // Only really need length updating
  404. assert(length <= DATA_PAYLOAD);
  405. if (udpTraceLevel > 5)
  406. DBGLOG("ENCRYPT: Writing %u bytes to data socket", encryptBuffer.length());
  407. data_socket->write(encryptBuffer.toByteArray(), encryptBuffer.length());
  408. }
  409. else
  410. data_socket->write(buffer->data, length);
  411. dataPacketsSent++;
  412. }
  413. catch(IException *e)
  414. {
  415. StringBuffer s;
  416. DBGLOG("UdpSender: write exception - write(%p, %u) - %s", buffer->data, length, e->errorMessage(s).str());
  417. e->Release();
  418. }
  419. catch(...)
  420. {
  421. DBGLOG("UdpSender: write exception - unknown exception");
  422. }
  423. if (resendList)
  424. {
  425. if (resending)
  426. resending--; //Don't add the ones I am resending back onto list - they are still there!
  427. else
  428. resendList->append(buffer);
  429. }
  430. else
  431. ::Release(buffer);
  432. }
  433. sendDone(toSend.size());
  434. return totalSent;
  435. }
  436. bool dataQueued(const UdpPacketHeader &key)
  437. {
  438. // Used when a retry packet is received, to determine whether the query is in fact completed
  439. // but just stuck in transit queues
  440. if (packetsQueued.load(std::memory_order_relaxed))
  441. {
  442. for (unsigned i = 0; i < numQueues; i++)
  443. {
  444. if (output_queue[i].dataQueued(&key, &comparePacket))
  445. return true;
  446. }
  447. }
  448. return false;
  449. }
  450. bool removeData(void *key, PKT_CMP_FUN pkCmpFn)
  451. {
  452. // Used after receiving an abort, to avoid sending data that is no longer required
  453. // Note that we don't attempt to remove packets that have already been sent from the resend list
  454. unsigned removed = 0;
  455. if (packetsQueued.load(std::memory_order_relaxed))
  456. {
  457. for (unsigned i = 0; i < numQueues; i++)
  458. {
  459. removed += output_queue[i].removeData(key, pkCmpFn);
  460. }
  461. packetsQueued -= removed;
  462. }
  463. return removed > 0;
  464. }
  465. void abort()
  466. {
  467. // Called if too many timeouts on a request to send
  468. if (udpTraceLevel > 3)
  469. {
  470. StringBuffer s;
  471. DBGLOG("UdpSender: abort sending queued data to node=%s", ip.getIpText(s).str());
  472. }
  473. timeouts = 0;
  474. requestExpiryTime = 0;
  475. removeData(nullptr, nullptr);
  476. }
  477. inline void pushData(unsigned queue, DataBuffer *buffer)
  478. {
  479. output_queue[queue].free_slots(); // block until at least one free space
  480. output_queue[queue].pushOwn(buffer);
  481. if (!packetsQueued++)
  482. requestToSendNew();
  483. }
  484. DataBuffer *popQueuedData()
  485. {
  486. DataBuffer *buffer;
  487. for (unsigned i = 0; i < numQueues; i++)
  488. {
  489. if (udpOutQsPriority)
  490. {
  491. buffer = output_queue[current_q].pop(false);
  492. if (!buffer)
  493. {
  494. if (udpTraceLevel >= 5)
  495. DBGLOG("UdpSender: ---------- Empty Q %d", current_q);
  496. currentQNumPkts = 0;
  497. current_q = (current_q + 1) % numQueues;
  498. }
  499. else
  500. {
  501. currentQNumPkts++;
  502. if (udpTraceLevel >= 5)
  503. DBGLOG("UdpSender: ---------- Packet from Q %d", current_q);
  504. if (currentQNumPkts >= maxPktsPerQ[current_q])
  505. {
  506. currentQNumPkts = 0;
  507. current_q = (current_q + 1) % numQueues;
  508. }
  509. packetsQueued--;
  510. return buffer;
  511. }
  512. }
  513. else
  514. {
  515. current_q = (current_q + 1) % numQueues;
  516. buffer = output_queue[current_q].pop(false);
  517. if (buffer)
  518. {
  519. packetsQueued--;
  520. return buffer;
  521. }
  522. }
  523. }
  524. // If we get here, it suggests we were told to get a buffer but no queue has one.
  525. // This should be rare but possible if data gets removed following an abort, as
  526. // there is a window in abort() between the remove and the decrement of packetsQueued.
  527. return nullptr;
  528. }
  529. UdpReceiverEntry(const IpAddress _ip, unsigned _numQueues, unsigned _queueSize, unsigned _sendFlowPort, unsigned _dataPort, bool _encrypted)
  530. : ip (_ip), sourceIP(myNode.getIpAddress()), numQueues(_numQueues), isLocal(_ip.isLocal()), encrypted(_encrypted)
  531. {
  532. assert(!initialized);
  533. assert(numQueues > 0);
  534. if (!ip.isNull())
  535. {
  536. try
  537. {
  538. SocketEndpoint sendFlowEp(_sendFlowPort, ip);
  539. SocketEndpoint dataEp(_dataPort, ip);
  540. send_flow_socket = ISocket::udp_connect(sendFlowEp);
  541. data_socket = ISocket::udp_connect(dataEp);
  542. if (isLocal)
  543. {
  544. data_socket->set_send_buffer_size(udpLocalWriteSocketSize);
  545. if (udpTraceLevel > 0)
  546. DBGLOG("UdpSender: sendbuffer set for local socket (size=%d)", udpLocalWriteSocketSize);
  547. }
  548. }
  549. catch(IException *e)
  550. {
  551. StringBuffer error, ipstr;
  552. DBGLOG("UdpSender: udp_connect failed %s %s", ip.getIpText(ipstr).str(), e->errorMessage(error).str());
  553. throw;
  554. }
  555. catch(...)
  556. {
  557. StringBuffer ipstr;
  558. DBGLOG("UdpSender: udp_connect failed %s %s", ip.getIpText(ipstr).str(), "Unknown error");
  559. throw;
  560. }
  561. output_queue = new queue_t[numQueues];
  562. maxPktsPerQ = new int[numQueues];
  563. for (unsigned j = 0; j < numQueues; j++)
  564. {
  565. output_queue[j].set_queue_size(_queueSize);
  566. maxPktsPerQ[j] = (int) pow((double)udpOutQsPriority, (double)numQueues - j - 1);
  567. }
  568. initialized = true;
  569. if (udpTraceLevel > 0)
  570. {
  571. StringBuffer ipStr;
  572. DBGLOG("UdpSender: added entry for ip=%s to receivers table - send_flow_port=%d", ip.getIpText(ipStr).str(), _sendFlowPort);
  573. }
  574. }
  575. if (udpResendLostPackets)
  576. {
  577. DBGLOG("UdpSender: created resend list with %u entries", TRACKER_BITS);
  578. resendList = new UdpResendList;
  579. }
  580. else
  581. DBGLOG("UdpSender: resend list disabled");
  582. }
  583. ~UdpReceiverEntry()
  584. {
  585. if (send_flow_socket) send_flow_socket->Release();
  586. if (data_socket) data_socket->Release();
  587. if (output_queue) delete [] output_queue;
  588. if (maxPktsPerQ) delete [] maxPktsPerQ;
  589. delete resendList;
  590. }
  591. };
  592. class CSendManager : implements ISendManager, public CInterface
  593. {
  594. class StartedThread : public Thread
  595. {
  596. private:
  597. Semaphore started;
  598. virtual int run()
  599. {
  600. started.signal();
  601. return doRun();
  602. }
  603. protected:
  604. bool running;
  605. public:
  606. StartedThread(const char *name) : Thread(name)
  607. {
  608. running = false;
  609. }
  610. ~StartedThread()
  611. {
  612. running = false;
  613. join();
  614. }
  615. virtual void start()
  616. {
  617. running = true;
  618. Thread::start();
  619. started.wait();
  620. }
  621. virtual int doRun() = 0;
  622. };
  623. class send_resend_flow : public StartedThread
  624. {
  625. // Check if any senders have timed out
  626. CSendManager &parent;
  627. Semaphore terminated;
  628. virtual int doRun() override
  629. {
  630. if (udpTraceLevel > 0)
  631. DBGLOG("UdpSender: send_resend_flow started");
  632. unsigned timeout = udpRequestToSendTimeout;
  633. while (running)
  634. {
  635. if (terminated.wait(timeout) || !running)
  636. break;
  637. unsigned now = msTick();
  638. timeout = udpRequestToSendTimeout;
  639. for (auto&& dest: parent.receiversTable)
  640. {
  641. #ifdef _DEBUG
  642. // Consistency check
  643. UdpReceiverEntry &receiverInfo = parent.receiversTable[dest.ip];
  644. if (&receiverInfo != &dest)
  645. {
  646. StringBuffer s;
  647. DBGLOG("UdpSender: table entry %s does not find itself", dest.ip.getIpText(s).str());
  648. printStackReport();
  649. }
  650. #endif
  651. unsigned expireTime = dest.requestExpiryTime;
  652. if (expireTime)
  653. {
  654. int timeToGo = expireTime-now;
  655. if (timeToGo <= 0)
  656. dest.resendRequestToSend();
  657. else if ((unsigned) timeToGo < timeout)
  658. timeout = timeToGo;
  659. }
  660. }
  661. if (udpStatsReportInterval && (now-lastResentReport > udpStatsReportInterval))
  662. {
  663. // MORE - some of these should really be tracked per destination
  664. lastResentReport = now;
  665. if (packetsResent > lastPacketsResent)
  666. {
  667. DBGLOG("%u more packets resent by this agent (%u total)", packetsResent-lastPacketsResent, packetsResent-0);
  668. lastPacketsResent = packetsResent;
  669. }
  670. if (flowRequestsSent > lastFlowRequestsSent)
  671. {
  672. DBGLOG("%u more flow request packets sent by this agent (%u total)", flowRequestsSent - lastFlowRequestsSent, flowRequestsSent-0);
  673. lastFlowRequestsSent = flowRequestsSent;
  674. }
  675. if (flowPermitsReceived > lastFlowPermitsReceived)
  676. {
  677. DBGLOG("%u more flow control packets recived by this agent (%u total)", flowPermitsReceived - lastFlowPermitsReceived, flowPermitsReceived-0);
  678. lastFlowPermitsReceived = flowPermitsReceived;
  679. }
  680. if (dataPacketsSent > lastDataPacketsSent)
  681. {
  682. DBGLOG("%u more data packets sent by this agent (%u total)", dataPacketsSent - lastDataPacketsSent, dataPacketsSent-0);
  683. lastDataPacketsSent = dataPacketsSent;
  684. }
  685. }
  686. }
  687. return 0;
  688. }
  689. public:
  690. send_resend_flow(CSendManager &_parent)
  691. : StartedThread("UdpLib::send_resend_flow"), parent(_parent)
  692. {
  693. start();
  694. }
  695. ~send_resend_flow()
  696. {
  697. running = false;
  698. terminated.signal();
  699. join();
  700. }
  701. };
  702. class send_receive_flow : public StartedThread
  703. {
  704. CSendManager &parent;
  705. int receive_port;
  706. Owned<ISocket> flow_socket;
  707. public:
  708. send_receive_flow(CSendManager &_parent, int r_port) : StartedThread("UdpLib::send_receive_flow"), parent(_parent)
  709. {
  710. receive_port = r_port;
  711. if (check_max_socket_read_buffer(udpFlowSocketsSize) < 0)
  712. throw MakeStringException(ROXIE_UDP_ERROR, "System Socket max read buffer is less than %i", udpFlowSocketsSize);
  713. flow_socket.setown(ISocket::udp_create(receive_port));
  714. flow_socket->set_receive_buffer_size(udpFlowSocketsSize);
  715. size32_t actualSize = flow_socket->get_receive_buffer_size();
  716. DBGLOG("UdpSender: rcv_flow_socket created port=%d sockbuffsize=%d actualsize=%d", receive_port, udpFlowSocketsSize, actualSize);
  717. start();
  718. }
  719. ~send_receive_flow()
  720. {
  721. running = false;
  722. if (flow_socket)
  723. flow_socket->close();
  724. join();
  725. }
  726. virtual int doRun()
  727. {
  728. if (udpTraceLevel > 0)
  729. DBGLOG("UdpSender: send_receive_flow started");
  730. #ifdef __linux__
  731. setLinuxThreadPriority(2);
  732. #endif
  733. while(running)
  734. {
  735. UdpPermitToSendMsg f = { flowType::ok_to_send, 0, { } };
  736. unsigned readsize = udpResendLostPackets ? sizeof(UdpPermitToSendMsg) : offsetof(UdpPermitToSendMsg, seen);
  737. while (running)
  738. {
  739. try
  740. {
  741. unsigned int res;
  742. flow_socket->read(&f, readsize, readsize, res, 5);
  743. flowPermitsReceived++;
  744. assert(res==readsize);
  745. switch (f.cmd)
  746. {
  747. case flowType::ok_to_send:
  748. if (udpTraceLevel > 2 || udpTraceFlow)
  749. {
  750. StringBuffer s;
  751. DBGLOG("UdpSender: received ok_to_send msg max %d packets from node=%s seq %" SEQF "u", f.max_data, f.destNode.getTraceText(s).str(), f.flowSeq);
  752. }
  753. parent.data->ok_to_send(f);
  754. break;
  755. case flowType::request_received:
  756. if (udpTraceLevel > 2 || udpTraceFlow)
  757. {
  758. StringBuffer s;
  759. DBGLOG("UdpSender: received request_received msg from node=%s seq %" SEQF "u", f.destNode.getTraceText(s).str(), f.flowSeq);
  760. }
  761. parent.receiversTable[f.destNode].requestAcknowledged();
  762. break;
  763. default:
  764. DBGLOG("UdpSender: received unknown flow message type=%d", f.cmd);
  765. }
  766. }
  767. catch (IException *e)
  768. {
  769. if (running && e->errorCode() != JSOCKERR_timeout_expired)
  770. {
  771. StringBuffer s;
  772. DBGLOG("UdpSender: send_receive_flow::read failed port=%i %s", receive_port, e->errorMessage(s).str());
  773. }
  774. e->Release();
  775. }
  776. catch (...)
  777. {
  778. if (running)
  779. DBGLOG("UdpSender: send_receive_flow::unknown exception");
  780. MilliSleep(0);
  781. }
  782. }
  783. }
  784. return 0;
  785. }
  786. };
  787. class send_data : public StartedThread
  788. {
  789. CSendManager &parent;
  790. simple_queue<UdpPermitToSendMsg> send_queue;
  791. Linked<TokenBucket> bucket;
  792. public:
  793. send_data(CSendManager &_parent, TokenBucket *_bucket)
  794. : StartedThread("UdpLib::send_data"), parent(_parent), bucket(_bucket), send_queue(100) // MORE - send q size should be configurable and/or related to size of cluster?
  795. {
  796. if (check_max_socket_write_buffer(udpLocalWriteSocketSize) < 0)
  797. throw MakeStringException(ROXIE_UDP_ERROR, "System Socket max write buffer is less than %i", udpLocalWriteSocketSize);
  798. start();
  799. }
  800. ~send_data()
  801. {
  802. running = false;
  803. UdpPermitToSendMsg dummy = {};
  804. send_queue.push(dummy);
  805. join();
  806. }
  807. bool ok_to_send(const UdpPermitToSendMsg &msg)
  808. {
  809. if (send_queue.push(msg, 15))
  810. return true;
  811. else
  812. {
  813. StringBuffer s;
  814. DBGLOG("UdpSender: push() failed - ignored ok_to_send msg - node=%s, maxData=%u", msg.destNode.getTraceText(s).str(), msg.max_data);
  815. return false;
  816. }
  817. }
  818. virtual int doRun()
  819. {
  820. if (udpTraceLevel > 0)
  821. DBGLOG("UdpSender: send_data started");
  822. #ifdef __linux__
  823. setLinuxThreadPriority(1); // MORE - windows? Is this even a good idea? Must not send faster than receiver can pull off the socket
  824. #endif
  825. UdpPermitToSendMsg permit;
  826. while (running)
  827. {
  828. send_queue.pop(permit);
  829. if (!running)
  830. return 0;
  831. UdpReceiverEntry &receiverInfo = parent.receiversTable[permit.destNode];
  832. unsigned payload = receiverInfo.sendData(permit, bucket);
  833. if (udpTraceLevel > 2)
  834. {
  835. StringBuffer s;
  836. DBGLOG("UdpSender: sent %u bytes to node=%s under permit %" SEQF "u", payload, permit.destNode.getTraceText(s).str(), permit.flowSeq);
  837. }
  838. }
  839. if (udpTraceLevel > 0)
  840. DBGLOG("UdpSender: send_data stopped");
  841. return 0;
  842. }
  843. };
  844. friend class send_resend_flow;
  845. friend class send_receive_flow;
  846. friend class send_data;
  847. unsigned numQueues;
  848. IpAddress myIP;
  849. IpMapOf<UdpReceiverEntry> receiversTable;
  850. send_resend_flow *resend_flow;
  851. send_receive_flow *receive_flow;
  852. send_data *data;
  853. Linked<TokenBucket> bucket;
  854. bool encrypted;
  855. std::atomic<unsigned> msgSeq{0};
  856. inline unsigned getNextMessageSequence()
  857. {
  858. unsigned res;
  859. do
  860. {
  861. res = ++msgSeq;
  862. } while (unlikely(!res));
  863. return res;
  864. }
  865. public:
  866. IMPLEMENT_IINTERFACE;
  867. CSendManager(int server_flow_port, int data_port, int client_flow_port, int q_size, int _numQueues, const IpAddress &_myIP, TokenBucket *_bucket, bool _encrypted)
  868. : bucket(_bucket),
  869. myIP(_myIP),
  870. receiversTable([_numQueues, q_size, server_flow_port, data_port, _encrypted](const ServerIdentifier ip) { return new UdpReceiverEntry(ip.getIpAddress(), _numQueues, q_size, server_flow_port, data_port, _encrypted);}),
  871. encrypted(_encrypted)
  872. {
  873. #ifndef _WIN32
  874. setpriority(PRIO_PROCESS, 0, -3);
  875. #endif
  876. numQueues = _numQueues;
  877. data = new send_data(*this, bucket);
  878. resend_flow = new send_resend_flow(*this);
  879. receive_flow = new send_receive_flow(*this, client_flow_port);
  880. }
  881. ~CSendManager()
  882. {
  883. delete resend_flow;
  884. delete receive_flow;
  885. delete data;
  886. }
  887. // Interface ISendManager
  888. virtual void writeOwn(IUdpReceiverEntry &receiver, DataBuffer *buffer, unsigned len, unsigned queue) override
  889. {
  890. // NOTE: takes ownership of the DataBuffer
  891. assert(queue < numQueues);
  892. assert(buffer);
  893. static_cast<UdpReceiverEntry &>(receiver).pushData(queue, buffer);
  894. }
  895. virtual IMessagePacker *createMessagePacker(ruid_t ruid, unsigned sequence, const void *messageHeader, unsigned headerSize, const ServerIdentifier &destNode, int queue) override
  896. {
  897. return ::createMessagePacker(ruid, sequence, messageHeader, headerSize, *this, receiversTable[destNode], myIP, getNextMessageSequence(), queue, encrypted);
  898. }
  899. virtual bool dataQueued(ruid_t ruid, unsigned msgId, const ServerIdentifier &destNode) override
  900. {
  901. UdpPacketHeader pkHdr;
  902. pkHdr.ruid = ruid;
  903. pkHdr.msgId = msgId;
  904. return receiversTable[destNode].dataQueued(pkHdr);
  905. }
  906. virtual bool abortData(ruid_t ruid, unsigned msgId, const ServerIdentifier &destNode)
  907. {
  908. UdpPacketHeader pkHdr;
  909. pkHdr.ruid = ruid;
  910. pkHdr.msgId = msgId;
  911. return receiversTable[destNode].removeData((void*) &pkHdr, &UdpReceiverEntry::comparePacket);
  912. }
  913. virtual bool allDone()
  914. {
  915. // Used for some timing tests only
  916. for (auto&& dest: receiversTable)
  917. {
  918. if (dest.packetsQueued.load(std::memory_order_relaxed))
  919. return false;
  920. }
  921. return true;
  922. }
  923. };
  924. ISendManager *createSendManager(int server_flow_port, int data_port, int client_flow_port, int queue_size_pr_server, int queues_pr_server, TokenBucket *rateLimiter, bool encryptionInTransit)
  925. {
  926. assertex(!myNode.getIpAddress().isNull());
  927. return new CSendManager(server_flow_port, data_port, client_flow_port, queue_size_pr_server, queues_pr_server, myNode.getIpAddress(), rateLimiter, encryptionInTransit);
  928. }
  929. class CMessagePacker : implements IMessagePacker, public CInterface
  930. {
  931. ISendManager &parent;
  932. IUdpReceiverEntry &receiver;
  933. UdpPacketHeader package_header;
  934. DataBuffer *part_buffer;
  935. const unsigned data_buffer_size;
  936. unsigned data_used;
  937. void *mem_buffer;
  938. unsigned mem_buffer_size;
  939. unsigned totalSize;
  940. bool packed_request;
  941. MemoryBuffer metaInfo;
  942. bool last_message_done;
  943. int queue_number;
  944. public:
  945. IMPLEMENT_IINTERFACE;
  946. CMessagePacker(ruid_t ruid, unsigned msgId, const void *messageHeader, unsigned headerSize, ISendManager &_parent, IUdpReceiverEntry &_receiver, const IpAddress & _sourceNode, unsigned _msgSeq, unsigned _queue, bool _encrypted)
  947. : parent(_parent), receiver(_receiver), data_buffer_size(DATA_PAYLOAD - sizeof(UdpPacketHeader) - (_encrypted ? 16 : 0))
  948. {
  949. queue_number = _queue;
  950. package_header.length = 0; // filled in with proper value later
  951. package_header.metalength = 0;
  952. package_header.ruid = ruid;
  953. package_header.msgId = msgId;
  954. package_header.pktSeq = 0;
  955. package_header.node.setIp(_sourceNode);
  956. package_header.msgSeq = _msgSeq;
  957. packed_request = false;
  958. part_buffer = bufferManager->allocate();
  959. assertex(data_buffer_size >= headerSize + sizeof(unsigned short));
  960. *(unsigned short *) (&part_buffer->data[sizeof(UdpPacketHeader)]) = headerSize;
  961. memcpy(&part_buffer->data[sizeof(UdpPacketHeader)+sizeof(unsigned short)], messageHeader, headerSize);
  962. data_used = headerSize + sizeof(unsigned short);
  963. mem_buffer = 0;
  964. mem_buffer_size = 0;
  965. last_message_done = false;
  966. totalSize = 0;
  967. }
  968. ~CMessagePacker()
  969. {
  970. if (part_buffer)
  971. part_buffer->Release();
  972. if (mem_buffer) free (mem_buffer);
  973. }
  974. virtual void *getBuffer(unsigned len, bool variable) override
  975. {
  976. if (variable)
  977. len += sizeof(RecordLengthType);
  978. if (data_buffer_size < len)
  979. {
  980. // Won't fit in one, so allocate temp location
  981. if (mem_buffer_size < len)
  982. {
  983. free(mem_buffer);
  984. mem_buffer = checked_malloc(len, ROXIE_MEMORY_ERROR);
  985. mem_buffer_size = len;
  986. }
  987. packed_request = false;
  988. if (variable)
  989. return ((char *) mem_buffer) + sizeof(RecordLengthType);
  990. else
  991. return mem_buffer;
  992. }
  993. if (part_buffer && ((data_buffer_size - data_used) < len))
  994. flush(false); // Note that we never span records that are small enough to fit - this can result in significant wastage if record just over DATA_PAYLOAD/2
  995. if (!part_buffer)
  996. {
  997. part_buffer = bufferManager->allocate();
  998. }
  999. packed_request = true;
  1000. if (variable)
  1001. return &part_buffer->data[data_used + sizeof(UdpPacketHeader) + sizeof(RecordLengthType)];
  1002. else
  1003. return &part_buffer->data[data_used + sizeof(UdpPacketHeader)];
  1004. }
  1005. virtual void putBuffer(const void *buf, unsigned len, bool variable) override
  1006. {
  1007. if (variable)
  1008. {
  1009. assertex(len < MAX_RECORD_LENGTH);
  1010. buf = ((char *) buf) - sizeof(RecordLengthType);
  1011. *(RecordLengthType *) buf = len;
  1012. len += sizeof(RecordLengthType);
  1013. }
  1014. totalSize += len;
  1015. if (packed_request)
  1016. {
  1017. assert(len <= (data_buffer_size - data_used));
  1018. data_used += len;
  1019. }
  1020. else
  1021. {
  1022. while (len)
  1023. {
  1024. if (!part_buffer)
  1025. {
  1026. part_buffer = bufferManager->allocate();
  1027. data_used = 0;
  1028. }
  1029. unsigned chunkLen = data_buffer_size - data_used;
  1030. if (chunkLen > len)
  1031. chunkLen = len;
  1032. memcpy(&part_buffer->data[sizeof(UdpPacketHeader)+data_used], buf, chunkLen);
  1033. data_used += chunkLen;
  1034. len -= chunkLen;
  1035. buf = &(((char*)buf)[chunkLen]);
  1036. if (len)
  1037. flush(false);
  1038. }
  1039. }
  1040. }
  1041. virtual void sendMetaInfo(const void *buf, unsigned len) override {
  1042. metaInfo.append(len, buf);
  1043. }
  1044. virtual void flush() override { flush(true); }
  1045. virtual unsigned size() const override
  1046. {
  1047. return totalSize;
  1048. }
  1049. private:
  1050. void flush(bool last_msg)
  1051. {
  1052. if (!last_message_done && last_msg)
  1053. {
  1054. last_message_done = true;
  1055. if (!part_buffer)
  1056. part_buffer = bufferManager->allocate();
  1057. const char *metaData = metaInfo.toByteArray();
  1058. unsigned metaLength = metaInfo.length();
  1059. unsigned maxMetaLength = data_buffer_size - data_used;
  1060. while (metaLength > maxMetaLength)
  1061. {
  1062. memcpy(&part_buffer->data[sizeof(UdpPacketHeader)+data_used], metaData, maxMetaLength);
  1063. put_package(part_buffer, data_used, maxMetaLength);
  1064. metaLength -= maxMetaLength;
  1065. metaData += maxMetaLength;
  1066. data_used = 0;
  1067. maxMetaLength = data_buffer_size;
  1068. part_buffer = bufferManager->allocate();
  1069. }
  1070. if (metaLength)
  1071. memcpy(&part_buffer->data[sizeof(UdpPacketHeader)+data_used], metaData, metaLength);
  1072. package_header.pktSeq |= UDP_PACKET_COMPLETE;
  1073. put_package(part_buffer, data_used, metaLength);
  1074. }
  1075. else if (part_buffer)
  1076. {
  1077. // Just flush current - used when no room for current row
  1078. if (data_used)
  1079. put_package(part_buffer, data_used, 0); // buffer released in put_package
  1080. else
  1081. part_buffer->Release(); // If NO data in buffer, release buffer back to pool
  1082. }
  1083. part_buffer = 0;
  1084. data_used = 0;
  1085. }
  1086. void put_package(DataBuffer *dataBuff, unsigned datalength, unsigned metalength)
  1087. {
  1088. package_header.length = datalength + metalength + sizeof(UdpPacketHeader);
  1089. package_header.metalength = metalength;
  1090. memcpy(dataBuff->data, &package_header, sizeof(package_header));
  1091. parent.writeOwn(receiver, dataBuff, package_header.length, queue_number);
  1092. package_header.pktSeq++;
  1093. }
  1094. };
  1095. extern UDPLIB_API IMessagePacker *createMessagePacker(ruid_t ruid, unsigned msgId, const void *messageHeader, unsigned headerSize, ISendManager &_parent, IUdpReceiverEntry &_receiver, const IpAddress & _sourceNode, unsigned _msgSeq, unsigned _queue, bool _encrypted)
  1096. {
  1097. return new CMessagePacker(ruid, msgId, messageHeader, headerSize, _parent, _receiver, _sourceNode, _msgSeq, _queue, _encrypted);
  1098. }