PageRenderTime 56ms CodeModel.GetById 22ms RepoModel.GetById 0ms app.codeStats 0ms

/Client/psiclient/3rdParty/polipo/io.c

https://bitbucket.org/psiphon/psiphon-circumvention-system/
C | 1170 lines | 1007 code | 120 blank | 43 comment | 307 complexity | dd015e010cd43c52592c2233127325a8 MD5 | raw file
Possible License(s): GPL-3.0
  1. /*
  2. Copyright (c) 2003-2006 by Juliusz Chroboczek
  3. Permission is hereby granted, free of charge, to any person obtaining a copy
  4. of this software and associated documentation files (the "Software"), to deal
  5. in the Software without restriction, including without limitation the rights
  6. to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  7. copies of the Software, and to permit persons to whom the Software is
  8. furnished to do so, subject to the following conditions:
  9. The above copyright notice and this permission notice shall be included in
  10. all copies or substantial portions of the Software.
  11. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  12. IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  13. FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  14. AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  15. LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  16. OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  17. THE SOFTWARE.
  18. */
  19. #include "polipo.h"
  20. extern int psiphonStats;
  21. #ifdef HAVE_IPv6
  22. #ifdef IPV6_PREFER_TEMPADDR
  23. #define HAVE_IPV6_PREFER_TEMPADDR 1
  24. #endif
  25. #endif
  26. #ifdef HAVE_IPV6_PREFER_TEMPADDR
  27. int useTemporarySourceAddress = 1;
  28. #endif
  29. void
  30. preinitIo()
  31. {
  32. #ifdef HAVE_IPV6_PREFER_TEMPADDR
  33. CONFIG_VARIABLE_SETTABLE(useTemporarySourceAddress, CONFIG_TRISTATE,
  34. configIntSetter,
  35. "Prefer IPv6 temporary source address.");
  36. #endif
  37. #ifdef HAVE_WINSOCK
  38. /* Load the winsock dll */
  39. WSADATA wsaData;
  40. WORD wVersionRequested = MAKEWORD(2, 2);
  41. int err = WSAStartup( wVersionRequested, &wsaData );
  42. if (err != 0) {
  43. do_log_error(L_ERROR, err, "Couldn't load winsock dll");
  44. exit(-1);
  45. }
  46. #endif
  47. return;
  48. }
  49. void
  50. initIo()
  51. {
  52. return;
  53. }
  54. FdEventHandlerPtr
  55. do_stream(int operation, int fd, int offset, char *buf, int len,
  56. int (*handler)(int, FdEventHandlerPtr, StreamRequestPtr),
  57. void *data)
  58. {
  59. assert(len > offset || (operation & (IO_END | IO_IMMEDIATE)));
  60. return schedule_stream(operation, fd, offset,
  61. NULL, 0, buf, len, NULL, 0, NULL, 0, NULL,
  62. handler, data);
  63. }
  64. FdEventHandlerPtr
  65. do_stream_2(int operation, int fd, int offset,
  66. char *buf, int len, char *buf2, int len2,
  67. int (*handler)(int, FdEventHandlerPtr, StreamRequestPtr),
  68. void *data)
  69. {
  70. assert(len + len2 > offset || (operation & (IO_END | IO_IMMEDIATE)));
  71. return schedule_stream(operation, fd, offset,
  72. NULL, 0, buf, len, buf2, len2, NULL, 0, NULL,
  73. handler, data);
  74. }
  75. FdEventHandlerPtr
  76. do_stream_3(int operation, int fd, int offset,
  77. char *buf, int len, char *buf2, int len2, char *buf3, int len3,
  78. int (*handler)(int, FdEventHandlerPtr, StreamRequestPtr),
  79. void *data)
  80. {
  81. assert(len + len2 > offset || (operation & (IO_END | IO_IMMEDIATE)));
  82. return schedule_stream(operation, fd, offset,
  83. NULL, 0, buf, len, buf2, len2, buf3, len3, NULL,
  84. handler, data);
  85. }
  86. FdEventHandlerPtr
  87. do_stream_h(int operation, int fd, int offset,
  88. char *header, int hlen, char *buf, int len,
  89. int (*handler)(int, FdEventHandlerPtr, StreamRequestPtr),
  90. void *data)
  91. {
  92. assert(hlen + len > offset || (operation & (IO_END | IO_IMMEDIATE)));
  93. return schedule_stream(operation, fd, offset,
  94. header, hlen, buf, len, NULL, 0, NULL, 0, NULL,
  95. handler, data);
  96. }
  97. FdEventHandlerPtr
  98. do_stream_buf(int operation, int fd, int offset, char **buf_location, int len,
  99. int (*handler)(int, FdEventHandlerPtr, StreamRequestPtr),
  100. void *data)
  101. {
  102. assert((len > offset || (operation & (IO_END | IO_IMMEDIATE)))
  103. && len <= CHUNK_SIZE);
  104. return schedule_stream(operation, fd, offset,
  105. NULL, 0, *buf_location, len,
  106. NULL, 0, NULL, 0, buf_location,
  107. handler, data);
  108. }
  109. static int
  110. chunkHeaderLen(int i)
  111. {
  112. if(i <= 0)
  113. return 0;
  114. if(i < 0x10)
  115. return 3;
  116. else if(i < 0x100)
  117. return 4;
  118. else if(i < 0x1000)
  119. return 5;
  120. else if(i < 0x10000)
  121. return 6;
  122. else
  123. abort();
  124. }
  125. static int
  126. chunkHeader(char *buf, int buflen, int i)
  127. {
  128. int n;
  129. if(i <= 0)
  130. return 0;
  131. n = snprintf(buf, buflen, "%x\r\n", i);
  132. return n;
  133. }
  134. FdEventHandlerPtr
  135. schedule_stream(int operation, int fd, int offset,
  136. char *header, int hlen,
  137. char *buf, int len, char *buf2, int len2, char *buf3, int len3,
  138. char **buf_location,
  139. int (*handler)(int, FdEventHandlerPtr, StreamRequestPtr),
  140. void *data)
  141. {
  142. StreamRequestRec request;
  143. FdEventHandlerPtr event;
  144. int done;
  145. request.operation = operation;
  146. request.fd = fd;
  147. if(len3) {
  148. assert(hlen == 0 && buf_location == NULL);
  149. request.u.b.len3 = len3;
  150. request.u.b.buf3 = buf3;
  151. request.operation |= IO_BUF3;
  152. } else if(buf_location) {
  153. assert(hlen == 0);
  154. request.u.l.buf_location = buf_location;
  155. request.operation |= IO_BUF_LOCATION;
  156. } else {
  157. request.u.h.hlen = hlen;
  158. request.u.h.header = header;
  159. }
  160. request.buf = buf;
  161. request.len = len;
  162. request.buf2 = buf2;
  163. request.len2 = len2;
  164. if((operation & IO_CHUNKED) ||
  165. (!(request.operation & (IO_BUF3 | IO_BUF_LOCATION)) && hlen > 0)) {
  166. assert(offset == 0);
  167. request.offset = -hlen;
  168. if(operation & IO_CHUNKED)
  169. request.offset += -chunkHeaderLen(len + len2);
  170. } else {
  171. request.offset = offset;
  172. }
  173. request.handler = handler;
  174. request.data = data;
  175. event = makeFdEvent(fd,
  176. (operation & IO_MASK) == IO_WRITE ?
  177. POLLOUT : POLLIN,
  178. do_scheduled_stream,
  179. sizeof(StreamRequestRec), &request);
  180. if(!event) {
  181. done = (*handler)(-ENOMEM, NULL, &request);
  182. assert(done);
  183. return NULL;
  184. }
  185. if(!(operation & IO_NOTNOW)) {
  186. done = event->handler(0, event);
  187. if(done) {
  188. free(event);
  189. return NULL;
  190. }
  191. }
  192. if(operation & IO_IMMEDIATE) {
  193. assert(hlen == 0 && !(operation & IO_CHUNKED));
  194. done = (*handler)(0, event, &request);
  195. if(done) {
  196. free(event);
  197. return NULL;
  198. }
  199. }
  200. event = registerFdEventHelper(event);
  201. return event;
  202. }
  203. static const char *endChunkTrailer = "\r\n0\r\n\r\n";
  204. /* PSIPHON */
  205. #include <time.h>
  206. int bytes_read = 0;
  207. time_t last_send_time = 0;
  208. int
  209. do_scheduled_stream(int status, FdEventHandlerPtr event)
  210. {
  211. StreamRequestPtr request = (StreamRequestPtr)&event->data;
  212. int rc, done, i;
  213. struct iovec iov[6];
  214. int chunk_header_len, chunk_trailer_len;
  215. char chunk_header[10];
  216. int len12 = request->len + request->len2;
  217. int len123 =
  218. request->len + request->len2 +
  219. ((request->operation & IO_BUF3) ? request->u.b.len3 : 0);
  220. if(status) {
  221. done = request->handler(status, event, request);
  222. return done;
  223. }
  224. i = 0;
  225. if(request->offset < 0) {
  226. assert((request->operation & (IO_MASK | IO_BUF3 | IO_BUF_LOCATION)) ==
  227. IO_WRITE);
  228. if(request->operation & IO_CHUNKED) {
  229. chunk_header_len = chunkHeaderLen(len123);
  230. chunk_trailer_len = 2;
  231. } else {
  232. chunk_header_len = 0;
  233. chunk_trailer_len = 0;
  234. }
  235. if(request->offset < -chunk_header_len) {
  236. assert(request->offset >= -(request->u.h.hlen + chunk_header_len));
  237. iov[i].iov_base = request->u.h.header;
  238. iov[i].iov_len = -request->offset - chunk_header_len;
  239. i++;
  240. }
  241. if(chunk_header_len > 0) {
  242. chunkHeader(chunk_header, 10, len123);
  243. if(request->offset < -chunk_header_len) {
  244. iov[i].iov_base = chunk_header;
  245. iov[i].iov_len = chunk_header_len;
  246. } else {
  247. iov[i].iov_base = chunk_header +
  248. chunk_header_len + request->offset;
  249. iov[i].iov_len = -request->offset;
  250. }
  251. i++;
  252. }
  253. }
  254. if(request->len > 0) {
  255. if(request->buf == NULL &&
  256. (request->operation & IO_BUF_LOCATION)) {
  257. assert(*request->u.l.buf_location == NULL);
  258. request->buf = *request->u.l.buf_location = get_chunk();
  259. if(request->buf == NULL) {
  260. done = request->handler(-ENOMEM, event, request);
  261. return done;
  262. }
  263. }
  264. if(request->offset <= 0) {
  265. iov[i].iov_base = request->buf;
  266. iov[i].iov_len = request->len;
  267. i++;
  268. } else if(request->offset < request->len) {
  269. iov[i].iov_base = request->buf + request->offset;
  270. iov[i].iov_len = request->len - request->offset;
  271. i++;
  272. }
  273. }
  274. if(request->len2 > 0) {
  275. if(request->offset <= request->len) {
  276. iov[i].iov_base = request->buf2;
  277. iov[i].iov_len = request->len2;
  278. i++;
  279. } else if(request->offset < request->len + request->len2) {
  280. iov[i].iov_base = request->buf2 + request->offset - request->len;
  281. iov[i].iov_len = request->len2 - request->offset + request->len;
  282. i++;
  283. }
  284. }
  285. if((request->operation & IO_BUF3) && request->u.b.len3 > 0) {
  286. if(request->offset <= len12) {
  287. iov[i].iov_base = request->u.b.buf3;
  288. iov[i].iov_len = request->u.b.len3;
  289. i++;
  290. } else if(request->offset < len12 + request->u.b.len3) {
  291. iov[i].iov_base = request->u.b.buf3 + request->offset - len12;
  292. iov[i].iov_len = request->u.b.len3 - request->offset + len12;
  293. i++;
  294. }
  295. }
  296. if((request->operation & IO_CHUNKED)) {
  297. int l;
  298. const char *trailer;
  299. if(request->operation & IO_END) {
  300. if(len123 == 0) {
  301. trailer = endChunkTrailer + 2;
  302. l = 5;
  303. } else {
  304. trailer = endChunkTrailer;
  305. l = 7;
  306. }
  307. } else {
  308. trailer = endChunkTrailer;
  309. l = 2;
  310. }
  311. if(request->offset <= len123) {
  312. iov[i].iov_base = (char*)trailer;
  313. iov[i].iov_len = l;
  314. i++;
  315. } else if(request->offset < len123 + l) {
  316. iov[i].iov_base =
  317. (char*)endChunkTrailer + request->offset - len123;
  318. iov[i].iov_len = l - request->offset + len123;
  319. i++;
  320. }
  321. }
  322. assert(i > 0);
  323. if((request->operation & IO_MASK) == IO_WRITE) {
  324. if(i > 1)
  325. rc = WRITEV(request->fd, iov, i);
  326. else
  327. rc = WRITE(request->fd, iov[0].iov_base, iov[0].iov_len);
  328. } else {
  329. if(i > 1)
  330. rc = READV(request->fd, iov, i);
  331. else
  332. rc = READ(request->fd, iov[0].iov_base, iov[0].iov_len);
  333. /* PSIPHON
  334. All proxied traffic gets read and written by the above calls, so
  335. counting one of them will give us a "total bytes proxied" value.
  336. Every so often we'll tell the Psiphon client this number so that
  337. it can update the stats. */
  338. if(psiphonStats && rc > 0)
  339. {
  340. const time_t SEND_INTERVAL_SECS = 5;
  341. //TODO: check for int overflow in the future
  342. bytes_read += rc;
  343. if (last_send_time+SEND_INTERVAL_SECS < time(NULL))
  344. {
  345. if(bytes_read > 0)
  346. {
  347. printf("PSIPHON-BYTES-TRANSFERRED:>>%d<<", bytes_read);
  348. fflush(NULL);
  349. }
  350. bytes_read = 0;
  351. last_send_time = time(NULL);
  352. }
  353. }
  354. }
  355. if(rc > 0) {
  356. request->offset += rc;
  357. if(request->offset < 0) return 0;
  358. done = request->handler(0, event, request);
  359. return done;
  360. } else if(rc == 0 || errno == EPIPE) {
  361. done = request->handler(1, event, request);
  362. } else if(errno == EAGAIN || errno == EINTR) {
  363. return 0;
  364. } else if(errno == EFAULT || errno == EBADF) {
  365. abort();
  366. } else {
  367. done = request->handler(-errno, event, request);
  368. }
  369. assert(done);
  370. return done;
  371. }
  372. int
  373. streamRequestDone(StreamRequestPtr request)
  374. {
  375. int len123 =
  376. request->len + request->len2 +
  377. ((request->operation & IO_BUF3) ? request->u.b.len3 : 0);
  378. if(request->offset < 0)
  379. return 0;
  380. else if(request->offset < len123)
  381. return 0;
  382. else if(request->operation & IO_CHUNKED) {
  383. if(request->operation & IO_END) {
  384. if(request->offset < len123 + (len123 ? 7 : 5))
  385. return 0;
  386. } else {
  387. if(request->offset < len123 + 2)
  388. return 0;
  389. }
  390. }
  391. return 1;
  392. }
  393. static int
  394. serverSocket(int af)
  395. {
  396. int fd, rc;
  397. if(af == 4) {
  398. fd = socket(PF_INET, SOCK_STREAM, 0);
  399. } else if(af == 6) {
  400. #ifdef HAVE_IPv6
  401. fd = socket(PF_INET6, SOCK_STREAM, 0);
  402. #else
  403. fd = -1;
  404. errno = EAFNOSUPPORT;
  405. #endif
  406. } else {
  407. abort();
  408. }
  409. if(fd >= 0) {
  410. rc = setNonblocking(fd, 1);
  411. if(rc < 0) {
  412. int errno_save = errno;
  413. CLOSE(fd);
  414. errno = errno_save;
  415. return -1;
  416. }
  417. #ifdef HAVE_IPV6_PREFER_TEMPADDR
  418. if (af == 6 && useTemporarySourceAddress != 1) {
  419. int value;
  420. value = (useTemporarySourceAddress == 2) ? 1 : 0;
  421. rc = setsockopt(fd, IPPROTO_IPV6, IPV6_PREFER_TEMPADDR,
  422. &value, sizeof(value));
  423. if (rc < 0) {
  424. /* no error, warning only */
  425. do_log_error(L_WARN, errno, "Couldn't set IPV6CTL_USETEMPADDR");
  426. }
  427. }
  428. #endif
  429. }
  430. return fd;
  431. }
  432. FdEventHandlerPtr
  433. do_connect(AtomPtr addr, int index, int port,
  434. int (*handler)(int, FdEventHandlerPtr, ConnectRequestPtr),
  435. void *data)
  436. {
  437. ConnectRequestRec request;
  438. FdEventHandlerPtr event;
  439. int done, fd, af;
  440. assert(addr->length > 0 && addr->string[0] == DNS_A);
  441. assert(addr->length % sizeof(HostAddressRec) == 1);
  442. if(index >= (addr->length - 1)/ sizeof(HostAddressRec))
  443. index = 0;
  444. request.firstindex = index;
  445. request.port = port;
  446. request.handler = handler;
  447. request.data = data;
  448. again:
  449. af = addr->string[1 + index * sizeof(HostAddressRec)];
  450. fd = serverSocket(af);
  451. request.fd = fd;
  452. request.af = af;
  453. request.addr = addr;
  454. request.index = index;
  455. if(fd < 0) {
  456. int n = (addr->length - 1) / sizeof(HostAddressRec);
  457. if(errno == EAFNOSUPPORT || errno == EPROTONOSUPPORT) {
  458. if((index + 1) % n != request.firstindex) {
  459. index = (index + 1) % n;
  460. goto again;
  461. }
  462. }
  463. do_log_error(L_ERROR, errno, "Couldn't create socket");
  464. done = (*handler)(-errno, NULL, &request);
  465. assert(done);
  466. return NULL;
  467. }
  468. /* POLLIN is apparently needed on Windows */
  469. event = registerFdEvent(fd, POLLIN | POLLOUT,
  470. do_scheduled_connect,
  471. sizeof(ConnectRequestRec), &request);
  472. if(event == NULL) {
  473. done = (*handler)(-ENOMEM, NULL, &request);
  474. assert(done);
  475. return NULL;
  476. }
  477. done = event->handler(0, event);
  478. if(done) {
  479. unregisterFdEvent(event);
  480. return NULL;
  481. }
  482. return event;
  483. }
  484. int
  485. do_scheduled_connect(int status, FdEventHandlerPtr event)
  486. {
  487. ConnectRequestPtr request = (ConnectRequestPtr)&event->data;
  488. AtomPtr addr = request->addr;
  489. int done;
  490. int rc;
  491. HostAddressPtr host;
  492. struct sockaddr_in servaddr;
  493. #ifdef HAVE_IPv6
  494. struct sockaddr_in6 servaddr6;
  495. #endif
  496. assert(addr->length > 0 && addr->string[0] == DNS_A);
  497. assert(addr->length % sizeof(HostAddressRec) == 1);
  498. assert(request->index < (addr->length - 1) / sizeof(HostAddressRec));
  499. if(status) {
  500. done = request->handler(status, event, request);
  501. if(done) {
  502. releaseAtom(addr);
  503. request->addr = NULL;
  504. return 1;
  505. }
  506. return 0;
  507. }
  508. again:
  509. host = (HostAddressPtr)&addr->string[1 +
  510. request->index *
  511. sizeof(HostAddressRec)];
  512. if(host->af != request->af) {
  513. int newfd;
  514. /* Ouch. Our socket has a different protocol than the host
  515. address. */
  516. CLOSE(request->fd);
  517. newfd = serverSocket(host->af);
  518. if(newfd < 0) {
  519. if(errno == EAFNOSUPPORT || errno == EPROTONOSUPPORT) {
  520. int n = request->addr->length / sizeof(HostAddressRec);
  521. if((request->index + 1) % n != request->firstindex) {
  522. request->index = (request->index + 1) % n;
  523. goto again;
  524. }
  525. }
  526. request->fd = -1;
  527. done = request->handler(-errno, event, request);
  528. assert(done);
  529. return 1;
  530. }
  531. if(newfd != request->fd) {
  532. request->fd = dup2(newfd, request->fd);
  533. CLOSE(newfd);
  534. if(request->fd < 0) {
  535. done = request->handler(-errno, event, request);
  536. assert(done);
  537. return 1;
  538. }
  539. }
  540. request->af = host->af;
  541. }
  542. switch(host->af) {
  543. case 4:
  544. memset(&servaddr, 0, sizeof(servaddr));
  545. servaddr.sin_family = AF_INET;
  546. servaddr.sin_port = htons(request->port);
  547. memcpy(&servaddr.sin_addr, &host->data, sizeof(struct in_addr));
  548. rc = connect(request->fd,
  549. (struct sockaddr*)&servaddr, sizeof(servaddr));
  550. break;
  551. case 6:
  552. #ifdef HAVE_IPv6
  553. memset(&servaddr6, 0, sizeof(servaddr6));
  554. servaddr6.sin6_family = AF_INET6;
  555. servaddr6.sin6_port = htons(request->port);
  556. memcpy(&servaddr6.sin6_addr, &host->data, sizeof(struct in6_addr));
  557. rc = connect(request->fd,
  558. (struct sockaddr*)&servaddr6, sizeof(servaddr6));
  559. #else
  560. rc = -1;
  561. errno = EAFNOSUPPORT;
  562. #endif
  563. break;
  564. default:
  565. abort();
  566. }
  567. if(rc >= 0 || errno == EISCONN) {
  568. done = request->handler(1, event, request);
  569. assert(done);
  570. releaseAtom(request->addr);
  571. request->addr = NULL;
  572. return 1;
  573. }
  574. if(errno == EINPROGRESS || errno == EINTR) {
  575. return 0;
  576. } else if(errno == EFAULT || errno == EBADF) {
  577. abort();
  578. } else {
  579. int n = request->addr->length / sizeof(HostAddressRec);
  580. if((request->index + 1) % n != request->firstindex) {
  581. request->index = (request->index + 1) % n;
  582. goto again;
  583. }
  584. done = request->handler(-errno, event, request);
  585. assert(done);
  586. releaseAtom(request->addr);
  587. request->addr = NULL;
  588. return 1;
  589. }
  590. }
  591. FdEventHandlerPtr
  592. do_accept(int fd,
  593. int (*handler)(int, FdEventHandlerPtr, AcceptRequestPtr),
  594. void *data)
  595. {
  596. FdEventHandlerPtr event;
  597. int done;
  598. event = schedule_accept(fd, handler, data);
  599. if(event == NULL) {
  600. done = (*handler)(-ENOMEM, NULL, NULL);
  601. assert(done);
  602. }
  603. /* But don't invoke it now - this will delay accept if under load. */
  604. return event;
  605. }
  606. FdEventHandlerPtr
  607. schedule_accept(int fd,
  608. int (*handler)(int, FdEventHandlerPtr, AcceptRequestPtr),
  609. void *data)
  610. {
  611. FdEventHandlerPtr event;
  612. AcceptRequestRec request;
  613. int done;
  614. request.fd = fd;
  615. request.handler = handler;
  616. request.data = data;
  617. event = registerFdEvent(fd, POLLOUT|POLLIN,
  618. do_scheduled_accept, sizeof(request), &request);
  619. if(!event) {
  620. done = (*handler)(-ENOMEM, NULL, NULL);
  621. assert(done);
  622. }
  623. return event;
  624. }
  625. int
  626. do_scheduled_accept(int status, FdEventHandlerPtr event)
  627. {
  628. AcceptRequestPtr request = (AcceptRequestPtr)&event->data;
  629. int rc, done;
  630. unsigned len;
  631. struct sockaddr_in addr;
  632. if(status) {
  633. done = request->handler(status, event, request);
  634. if(done) return done;
  635. }
  636. len = sizeof(struct sockaddr_in);
  637. rc = accept(request->fd, (struct sockaddr*)&addr, &len);
  638. if(rc >= 0)
  639. done = request->handler(rc, event, request);
  640. else
  641. done = request->handler(-errno, event, request);
  642. return done;
  643. }
  644. FdEventHandlerPtr
  645. create_listener(char *address, int port,
  646. int (*handler)(int, FdEventHandlerPtr, AcceptRequestPtr),
  647. void *data)
  648. {
  649. int fd, rc;
  650. int one = 1;
  651. int done;
  652. struct sockaddr_in addr;
  653. #ifdef HAVE_IPv6
  654. int inet6 = 1;
  655. struct sockaddr_in6 addr6;
  656. #else
  657. int inet6 = 0;
  658. #endif
  659. if(inet6 && address) {
  660. struct in_addr buf;
  661. rc = inet_aton(address, &buf);
  662. if(rc == 1)
  663. inet6 = 0;
  664. }
  665. fd = -1;
  666. errno = EAFNOSUPPORT;
  667. #ifdef HAVE_IPv6
  668. if(inet6) {
  669. fd = socket(PF_INET6, SOCK_STREAM, 0);
  670. }
  671. #endif
  672. if(fd < 0 && (errno == EPROTONOSUPPORT || errno == EAFNOSUPPORT)) {
  673. inet6 = 0;
  674. fd = socket(PF_INET, SOCK_STREAM, 0);
  675. }
  676. if(fd < 0) {
  677. done = (*handler)(-errno, NULL, NULL);
  678. assert(done);
  679. return NULL;
  680. }
  681. rc = setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, (char *)&one, sizeof(one));
  682. if(rc < 0) do_log_error(L_WARN, errno, "Couldn't set SO_REUSEADDR");
  683. if(inet6) {
  684. #ifdef HAVE_IPv6
  685. rc = setV6only(fd, 0);
  686. if(rc < 0)
  687. /* Reportedly OpenBSD returns an error for that. So only
  688. log it as a debugging message. */
  689. do_log_error(D_CLIENT_CONN, errno, "Couldn't reset IPV6_V6ONLY");
  690. memset(&addr6, 0, sizeof(addr6));
  691. rc = inet_pton(AF_INET6, address, &addr6.sin6_addr);
  692. if(rc != 1) {
  693. done = (*handler)(rc == 0 ? -ESYNTAX : -errno, NULL, NULL);
  694. assert(done);
  695. return NULL;
  696. }
  697. addr6.sin6_family = AF_INET6;
  698. addr6.sin6_port = htons(port);
  699. rc = bind(fd, (struct sockaddr*)&addr6, sizeof(addr6));
  700. #else
  701. rc = -1;
  702. errno = EAFNOSUPPORT;
  703. #endif
  704. } else {
  705. memset(&addr, 0, sizeof(addr));
  706. rc = inet_aton(address, &addr.sin_addr);
  707. if(rc != 1) {
  708. done = (*handler)(rc == 0 ? -ESYNTAX : -errno, NULL, NULL);
  709. assert(done);
  710. return NULL;
  711. }
  712. addr.sin_family = AF_INET;
  713. addr.sin_port = htons(port);
  714. rc = bind(fd, (struct sockaddr*)&addr, sizeof(addr));
  715. }
  716. if(rc < 0) {
  717. do_log_error(L_ERROR, errno, "Couldn't bind");
  718. CLOSE(fd);
  719. done = (*handler)(-errno, NULL, NULL);
  720. assert(done);
  721. return NULL;
  722. }
  723. rc = setNonblocking(fd, 1);
  724. if(rc < 0) {
  725. do_log_error(L_ERROR, errno, "Couldn't set non blocking mode");
  726. CLOSE(fd);
  727. done = (*handler)(-errno, NULL, NULL);
  728. assert(done);
  729. return NULL;
  730. }
  731. rc = listen(fd, 32);
  732. if(rc < 0) {
  733. do_log_error(L_ERROR, errno, "Couldn't listen");
  734. CLOSE(fd);
  735. done = (*handler)(-errno, NULL, NULL);
  736. assert(done);
  737. return NULL;
  738. }
  739. do_log(L_INFO, "Established listening socket on port %d.\n", port);
  740. return schedule_accept(fd, handler, data);
  741. }
  742. #ifndef SOL_TCP
  743. /* BSD */
  744. #define SOL_TCP IPPROTO_TCP
  745. #endif
  746. int
  747. setNonblocking(int fd, int nonblocking)
  748. {
  749. #ifdef MINGW
  750. return mingw_setnonblocking(fd, nonblocking);
  751. #else
  752. int rc;
  753. rc = fcntl(fd, F_GETFL, 0);
  754. if(rc < 0)
  755. return -1;
  756. rc = fcntl(fd, F_SETFL, nonblocking?(rc | O_NONBLOCK):(rc & ~O_NONBLOCK));
  757. if(rc < 0)
  758. return -1;
  759. return 0;
  760. #endif
  761. }
  762. int
  763. setNodelay(int fd, int nodelay)
  764. {
  765. int val = nodelay ? 1 : 0;
  766. int rc;
  767. rc = setsockopt(fd, SOL_TCP, TCP_NODELAY, (char *)&val, sizeof(val));
  768. if(rc < 0)
  769. return -1;
  770. return 0;
  771. }
  772. #ifdef IPV6_V6ONLY
  773. int
  774. setV6only(int fd, int v6only)
  775. {
  776. int val = v6only ? 1 : 0;
  777. int rc;
  778. rc = setsockopt(fd, IPPROTO_IPV6, IPV6_V6ONLY, (char *)&val, sizeof(val));
  779. if(rc < 0)
  780. return -1;
  781. return 0;
  782. }
  783. #else
  784. int
  785. setV6only(int fd, int v6only)
  786. {
  787. return 0;
  788. }
  789. #endif
  790. typedef struct _LingeringClose {
  791. int fd;
  792. FdEventHandlerPtr handler;
  793. TimeEventHandlerPtr timeout;
  794. } LingeringCloseRec, *LingeringClosePtr;
  795. static int
  796. lingeringCloseTimeoutHandler(TimeEventHandlerPtr event)
  797. {
  798. LingeringClosePtr l = *(LingeringClosePtr*)event->data;
  799. assert(l->timeout == event);
  800. l->timeout = NULL;
  801. if(l->handler)
  802. pokeFdEvent(l->fd, -ESHUTDOWN, POLLIN | POLLOUT);
  803. else {
  804. CLOSE(l->fd);
  805. free(l);
  806. }
  807. return 1;
  808. }
  809. static int
  810. lingeringCloseHandler(int status, FdEventHandlerPtr event)
  811. {
  812. LingeringClosePtr l = *(LingeringClosePtr*)event->data;
  813. char buf[17];
  814. int rc;
  815. assert(l->handler == event);
  816. l->handler = NULL;
  817. if(status && status != -EDOGRACEFUL)
  818. goto done;
  819. rc = READ(l->fd, &buf, 17);
  820. if(rc == 0 || (rc < 0 && errno != EAGAIN && errno != EINTR))
  821. goto done;
  822. /* The client is still sending data. Ignore it in order to let
  823. TCP's flow control do its work. The timeout will close the
  824. connection. */
  825. return 1;
  826. done:
  827. if(l->timeout) {
  828. cancelTimeEvent(l->timeout);
  829. l->timeout = NULL;
  830. }
  831. CLOSE(l->fd);
  832. free(l);
  833. return 1;
  834. }
  835. int
  836. lingeringClose(int fd)
  837. {
  838. int rc;
  839. LingeringClosePtr l;
  840. rc = shutdown(fd, 1);
  841. if(rc < 0) {
  842. if(errno != ENOTCONN) {
  843. do_log_error(L_ERROR, errno, "Shutdown failed");
  844. } else if(errno == EFAULT || errno == EBADF) {
  845. abort();
  846. }
  847. CLOSE(fd);
  848. return 1;
  849. }
  850. l = malloc(sizeof(LingeringCloseRec));
  851. if(l == NULL)
  852. goto fail;
  853. l->fd = fd;
  854. l->handler = NULL;
  855. l->timeout = NULL;
  856. l->timeout = scheduleTimeEvent(10, lingeringCloseTimeoutHandler,
  857. sizeof(LingeringClosePtr), &l);
  858. if(l->timeout == NULL) {
  859. free(l);
  860. goto fail;
  861. }
  862. l->handler = registerFdEvent(fd, POLLIN,
  863. lingeringCloseHandler,
  864. sizeof(LingeringClosePtr), &l);
  865. if(l->handler == NULL) {
  866. do_log(L_ERROR, "Couldn't schedule lingering close handler.\n");
  867. /* But don't close -- the timeout will do its work. */
  868. }
  869. return 1;
  870. fail:
  871. do_log(L_ERROR, "Couldn't schedule lingering close.\n");
  872. CLOSE(fd);
  873. return 1;
  874. }
  875. NetAddressPtr
  876. parseNetAddress(AtomListPtr list)
  877. {
  878. NetAddressPtr nl;
  879. int i, rc, rc6;
  880. char buf[100];
  881. struct in_addr ina;
  882. #ifdef HAVE_IPv6
  883. struct in6_addr ina6;
  884. #endif
  885. nl = malloc((list->length + 1) * sizeof(NetAddressRec));
  886. if(nl == NULL) {
  887. do_log(L_ERROR, "Couldn't allocate network list.\n");
  888. return NULL;
  889. }
  890. for(i = 0; i < list->length; i++) {
  891. int prefix;
  892. char *s = list->list[i]->string, *p;
  893. int n = list->list[i]->length;
  894. char *suffix;
  895. while(*s == ' ' || *s == '\t') {
  896. s++;
  897. n--;
  898. }
  899. if(n >= 100) {
  900. do_log(L_ERROR, "Network name too long.\n");
  901. goto fail;
  902. }
  903. p = memchr(s, '/', n);
  904. if(p) {
  905. memcpy(buf, s, p - s);
  906. buf[p - s] = '\0';
  907. prefix = strtol(p + 1, &suffix, 10);
  908. } else {
  909. char *s1, *s2;
  910. prefix = -1;
  911. strcpy(buf, s);
  912. s1 = strchr(s, ' ');
  913. s2 = strchr(s, '\t');
  914. if(s1 == NULL) suffix = s2;
  915. else if(s2 == NULL) suffix = s1;
  916. else if(s1 < s2) suffix = s1;
  917. else suffix = s2;
  918. if(suffix == NULL)
  919. suffix = s + n;
  920. }
  921. if(!isWhitespace(suffix)) {
  922. do_log(L_ERROR, "Couldn't parse network %s.\n", buf);
  923. goto fail;
  924. }
  925. rc = 0; rc6 = 0;
  926. rc = inet_aton(buf, &ina);
  927. #ifdef HAVE_IPv6
  928. if(rc == 0) {
  929. rc6 = inet_pton(AF_INET6, buf, &ina6);
  930. }
  931. #endif
  932. if(rc == 0 && rc6 == 0) {
  933. do_log(L_ERROR, "Couldn't parse network %s.\n", buf);
  934. goto fail;
  935. }
  936. nl[i].prefix = prefix;
  937. if(rc) {
  938. nl[i].af = 4;
  939. memcpy(nl[i].data, &ina, 4);
  940. } else {
  941. #ifdef HAVE_IPv6
  942. nl[i].af = 6;
  943. memcpy(nl[i].data, &ina6, 16);
  944. #else
  945. abort();
  946. #endif
  947. }
  948. }
  949. nl[i].af = 0;
  950. return nl;
  951. fail:
  952. free(nl);
  953. return NULL;
  954. }
  955. /* Returns 1 if the first n bits of a and b are equal */
  956. static int
  957. bitmatch(const unsigned char *a, const unsigned char *b, int n)
  958. {
  959. if(n >= 8) {
  960. if(memcmp(a, b, n / 8) != 0)
  961. return 0;
  962. }
  963. if(n % 8 != 0) {
  964. int mask = (~0) << (8 - n % 8);
  965. if((a[n / 8] & mask) != (b[n / 8] & mask))
  966. return 0;
  967. }
  968. return 1;
  969. }
  970. /* Returns 1 if the address in data is in list */
  971. static int
  972. match(int af, unsigned char *data, NetAddressPtr list)
  973. {
  974. int i;
  975. #ifdef HAVE_IPv6
  976. static const unsigned char v6mapped[] =
  977. { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xFF, 0xFF };
  978. #endif
  979. i = 0;
  980. while(list[i].af != 0) {
  981. if(af == 4 && list[i].af == 4) {
  982. if(bitmatch(data, list[i].data,
  983. list[i].prefix >= 0 ? list[i].prefix : 32))
  984. return 1;
  985. #ifdef HAVE_IPv6
  986. } else if(af == 6 && list[i].af == 6) {
  987. if(bitmatch(data, list[i].data,
  988. list[i].prefix >= 0 ? list[i].prefix : 128))
  989. return 1;
  990. } else if(af == 6 && list[i].af == 4) {
  991. if(bitmatch(data, v6mapped, 96)) {
  992. if(bitmatch(data + 12, list[i].data,
  993. list[i].prefix >= 0 ? list[i].prefix : 32))
  994. return 1;
  995. }
  996. } else if(af == 4 && list[i].af == 6) {
  997. if(bitmatch(list[i].data, v6mapped, 96)) {
  998. if(bitmatch(data, list[i].data + 12,
  999. list[i].prefix >= 96 ?
  1000. list[i].prefix - 96 : 32))
  1001. return 1;
  1002. }
  1003. #endif
  1004. } else {
  1005. abort();
  1006. }
  1007. i++;
  1008. }
  1009. return 0;
  1010. }
  1011. int
  1012. netAddressMatch(int fd, NetAddressPtr list)
  1013. {
  1014. int rc;
  1015. unsigned int len;
  1016. struct sockaddr_in sain;
  1017. #ifdef HAVE_IPv6
  1018. struct sockaddr_in6 sain6;
  1019. #endif
  1020. len = sizeof(sain);
  1021. rc = getpeername(fd, (struct sockaddr*)&sain, &len);
  1022. if(rc < 0) {
  1023. do_log_error(L_ERROR, errno, "Couldn't get peer name");
  1024. return -1;
  1025. }
  1026. if(sain.sin_family == AF_INET) {
  1027. return match(4, (unsigned char*)&sain.sin_addr, list);
  1028. #ifdef HAVE_IPv6
  1029. } else if(sain.sin_family == AF_INET6) {
  1030. len = sizeof(sain6);
  1031. rc = getpeername(fd, (struct sockaddr*)&sain6, &len);
  1032. if(rc < 0) {
  1033. do_log_error(L_ERROR, errno, "Couldn't get peer name");
  1034. return -1;
  1035. }
  1036. if(sain6.sin6_family != AF_INET6) {
  1037. do_log(L_ERROR, "Inconsistent peer name");
  1038. return -1;
  1039. }
  1040. return match(6, (unsigned char*)&sain6.sin6_addr, list);
  1041. #endif
  1042. } else {
  1043. do_log(L_ERROR, "Unknown address family %d\n", sain.sin_family);
  1044. return -1;
  1045. }
  1046. return 0;
  1047. }