cfilters.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802
  1. /***************************************************************************
  2. * _ _ ____ _
  3. * Project ___| | | | _ \| |
  4. * / __| | | | |_) | |
  5. * | (__| |_| | _ <| |___
  6. * \___|\___/|_| \_\_____|
  7. *
  8. * Copyright (C) Daniel Stenberg, <daniel@haxx.se>, et al.
  9. *
  10. * This software is licensed as described in the file COPYING, which
  11. * you should have received as part of this distribution. The terms
  12. * are also available at https://curl.se/docs/copyright.html.
  13. *
  14. * You may opt to use, copy, modify, merge, publish, distribute and/or sell
  15. * copies of the Software, and permit persons to whom the Software is
  16. * furnished to do so, under the terms of the COPYING file.
  17. *
  18. * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
  19. * KIND, either express or implied.
  20. *
  21. * SPDX-License-Identifier: curl
  22. *
  23. ***************************************************************************/
  24. #include "curl_setup.h"
  25. #include "urldata.h"
  26. #include "strerror.h"
  27. #include "cfilters.h"
  28. #include "connect.h"
  29. #include "url.h" /* for Curl_safefree() */
  30. #include "sendf.h"
  31. #include "sockaddr.h" /* required for Curl_sockaddr_storage */
  32. #include "multiif.h"
  33. #include "progress.h"
  34. #include "select.h"
  35. #include "warnless.h"
  36. /* The last 3 #include files should be in this order */
  37. #include "curl_printf.h"
  38. #include "curl_memory.h"
  39. #include "memdebug.h"
  40. #ifndef ARRAYSIZE
  41. #define ARRAYSIZE(A) (sizeof(A)/sizeof((A)[0]))
  42. #endif
  43. #ifdef DEBUGBUILD
  44. /* used by unit2600.c */
  45. void Curl_cf_def_close(struct Curl_cfilter *cf, struct Curl_easy *data)
  46. {
  47. cf->connected = FALSE;
  48. if(cf->next)
  49. cf->next->cft->do_close(cf->next, data);
  50. }
  51. #endif
  52. static void conn_report_connect_stats(struct Curl_easy *data,
  53. struct connectdata *conn);
  54. void Curl_cf_def_get_host(struct Curl_cfilter *cf, struct Curl_easy *data,
  55. const char **phost, const char **pdisplay_host,
  56. int *pport)
  57. {
  58. if(cf->next)
  59. cf->next->cft->get_host(cf->next, data, phost, pdisplay_host, pport);
  60. else {
  61. *phost = cf->conn->host.name;
  62. *pdisplay_host = cf->conn->host.dispname;
  63. *pport = cf->conn->port;
  64. }
  65. }
  66. void Curl_cf_def_adjust_pollset(struct Curl_cfilter *cf,
  67. struct Curl_easy *data,
  68. struct easy_pollset *ps)
  69. {
  70. /* NOP */
  71. (void)cf;
  72. (void)data;
  73. (void)ps;
  74. }
  75. bool Curl_cf_def_data_pending(struct Curl_cfilter *cf,
  76. const struct Curl_easy *data)
  77. {
  78. return cf->next?
  79. cf->next->cft->has_data_pending(cf->next, data) : FALSE;
  80. }
  81. ssize_t Curl_cf_def_send(struct Curl_cfilter *cf, struct Curl_easy *data,
  82. const void *buf, size_t len, CURLcode *err)
  83. {
  84. return cf->next?
  85. cf->next->cft->do_send(cf->next, data, buf, len, err) :
  86. CURLE_RECV_ERROR;
  87. }
  88. ssize_t Curl_cf_def_recv(struct Curl_cfilter *cf, struct Curl_easy *data,
  89. char *buf, size_t len, CURLcode *err)
  90. {
  91. return cf->next?
  92. cf->next->cft->do_recv(cf->next, data, buf, len, err) :
  93. CURLE_SEND_ERROR;
  94. }
  95. bool Curl_cf_def_conn_is_alive(struct Curl_cfilter *cf,
  96. struct Curl_easy *data,
  97. bool *input_pending)
  98. {
  99. return cf->next?
  100. cf->next->cft->is_alive(cf->next, data, input_pending) :
  101. FALSE; /* pessimistic in absence of data */
  102. }
  103. CURLcode Curl_cf_def_conn_keep_alive(struct Curl_cfilter *cf,
  104. struct Curl_easy *data)
  105. {
  106. return cf->next?
  107. cf->next->cft->keep_alive(cf->next, data) :
  108. CURLE_OK;
  109. }
  110. CURLcode Curl_cf_def_query(struct Curl_cfilter *cf,
  111. struct Curl_easy *data,
  112. int query, int *pres1, void *pres2)
  113. {
  114. return cf->next?
  115. cf->next->cft->query(cf->next, data, query, pres1, pres2) :
  116. CURLE_UNKNOWN_OPTION;
  117. }
  118. void Curl_conn_cf_discard_chain(struct Curl_cfilter **pcf,
  119. struct Curl_easy *data)
  120. {
  121. struct Curl_cfilter *cfn, *cf = *pcf;
  122. if(cf) {
  123. *pcf = NULL;
  124. while(cf) {
  125. cfn = cf->next;
  126. /* prevent destroying filter to mess with its sub-chain, since
  127. * we have the reference now and will call destroy on it.
  128. */
  129. cf->next = NULL;
  130. cf->cft->destroy(cf, data);
  131. free(cf);
  132. cf = cfn;
  133. }
  134. }
  135. }
  136. void Curl_conn_cf_discard_all(struct Curl_easy *data,
  137. struct connectdata *conn, int index)
  138. {
  139. Curl_conn_cf_discard_chain(&conn->cfilter[index], data);
  140. }
  141. void Curl_conn_close(struct Curl_easy *data, int index)
  142. {
  143. struct Curl_cfilter *cf;
  144. DEBUGASSERT(data->conn);
  145. /* it is valid to call that without filters being present */
  146. cf = data->conn->cfilter[index];
  147. if(cf) {
  148. cf->cft->do_close(cf, data);
  149. }
  150. }
  151. ssize_t Curl_conn_recv(struct Curl_easy *data, int num, char *buf,
  152. size_t len, CURLcode *code)
  153. {
  154. struct Curl_cfilter *cf;
  155. DEBUGASSERT(data);
  156. DEBUGASSERT(data->conn);
  157. cf = data->conn->cfilter[num];
  158. while(cf && !cf->connected) {
  159. cf = cf->next;
  160. }
  161. if(cf) {
  162. return cf->cft->do_recv(cf, data, buf, len, code);
  163. }
  164. failf(data, "recv: no filter connected");
  165. *code = CURLE_FAILED_INIT;
  166. return -1;
  167. }
  168. ssize_t Curl_conn_send(struct Curl_easy *data, int num,
  169. const void *mem, size_t len, CURLcode *code)
  170. {
  171. struct Curl_cfilter *cf;
  172. DEBUGASSERT(data);
  173. DEBUGASSERT(data->conn);
  174. cf = data->conn->cfilter[num];
  175. while(cf && !cf->connected) {
  176. cf = cf->next;
  177. }
  178. if(cf) {
  179. return cf->cft->do_send(cf, data, mem, len, code);
  180. }
  181. failf(data, "send: no filter connected");
  182. DEBUGASSERT(0);
  183. *code = CURLE_FAILED_INIT;
  184. return -1;
  185. }
  186. CURLcode Curl_cf_create(struct Curl_cfilter **pcf,
  187. const struct Curl_cftype *cft,
  188. void *ctx)
  189. {
  190. struct Curl_cfilter *cf;
  191. CURLcode result = CURLE_OUT_OF_MEMORY;
  192. DEBUGASSERT(cft);
  193. cf = calloc(1, sizeof(*cf));
  194. if(!cf)
  195. goto out;
  196. cf->cft = cft;
  197. cf->ctx = ctx;
  198. result = CURLE_OK;
  199. out:
  200. *pcf = cf;
  201. return result;
  202. }
  203. void Curl_conn_cf_add(struct Curl_easy *data,
  204. struct connectdata *conn,
  205. int index,
  206. struct Curl_cfilter *cf)
  207. {
  208. (void)data;
  209. DEBUGASSERT(conn);
  210. DEBUGASSERT(!cf->conn);
  211. DEBUGASSERT(!cf->next);
  212. cf->next = conn->cfilter[index];
  213. cf->conn = conn;
  214. cf->sockindex = index;
  215. conn->cfilter[index] = cf;
  216. CURL_TRC_CF(data, cf, "added");
  217. }
  218. void Curl_conn_cf_insert_after(struct Curl_cfilter *cf_at,
  219. struct Curl_cfilter *cf_new)
  220. {
  221. struct Curl_cfilter *tail, **pnext;
  222. DEBUGASSERT(cf_at);
  223. DEBUGASSERT(cf_new);
  224. DEBUGASSERT(!cf_new->conn);
  225. tail = cf_at->next;
  226. cf_at->next = cf_new;
  227. do {
  228. cf_new->conn = cf_at->conn;
  229. cf_new->sockindex = cf_at->sockindex;
  230. pnext = &cf_new->next;
  231. cf_new = cf_new->next;
  232. } while(cf_new);
  233. *pnext = tail;
  234. }
  235. bool Curl_conn_cf_discard_sub(struct Curl_cfilter *cf,
  236. struct Curl_cfilter *discard,
  237. struct Curl_easy *data,
  238. bool destroy_always)
  239. {
  240. struct Curl_cfilter **pprev = &cf->next;
  241. bool found = FALSE;
  242. /* remove from sub-chain and destroy */
  243. DEBUGASSERT(cf);
  244. while(*pprev) {
  245. if(*pprev == cf) {
  246. *pprev = discard->next;
  247. discard->next = NULL;
  248. found = TRUE;
  249. break;
  250. }
  251. pprev = &((*pprev)->next);
  252. }
  253. if(found || destroy_always) {
  254. discard->next = NULL;
  255. discard->cft->destroy(discard, data);
  256. free(discard);
  257. }
  258. return found;
  259. }
  260. CURLcode Curl_conn_cf_connect(struct Curl_cfilter *cf,
  261. struct Curl_easy *data,
  262. bool blocking, bool *done)
  263. {
  264. if(cf)
  265. return cf->cft->do_connect(cf, data, blocking, done);
  266. return CURLE_FAILED_INIT;
  267. }
  268. void Curl_conn_cf_close(struct Curl_cfilter *cf, struct Curl_easy *data)
  269. {
  270. if(cf)
  271. cf->cft->do_close(cf, data);
  272. }
  273. ssize_t Curl_conn_cf_send(struct Curl_cfilter *cf, struct Curl_easy *data,
  274. const void *buf, size_t len, CURLcode *err)
  275. {
  276. if(cf)
  277. return cf->cft->do_send(cf, data, buf, len, err);
  278. *err = CURLE_SEND_ERROR;
  279. return -1;
  280. }
  281. ssize_t Curl_conn_cf_recv(struct Curl_cfilter *cf, struct Curl_easy *data,
  282. char *buf, size_t len, CURLcode *err)
  283. {
  284. if(cf)
  285. return cf->cft->do_recv(cf, data, buf, len, err);
  286. *err = CURLE_RECV_ERROR;
  287. return -1;
  288. }
  289. CURLcode Curl_conn_connect(struct Curl_easy *data,
  290. int sockindex,
  291. bool blocking,
  292. bool *done)
  293. {
  294. struct Curl_cfilter *cf;
  295. CURLcode result = CURLE_OK;
  296. DEBUGASSERT(data);
  297. DEBUGASSERT(data->conn);
  298. cf = data->conn->cfilter[sockindex];
  299. DEBUGASSERT(cf);
  300. if(!cf)
  301. return CURLE_FAILED_INIT;
  302. *done = cf->connected;
  303. if(!*done) {
  304. result = cf->cft->do_connect(cf, data, blocking, done);
  305. if(!result && *done) {
  306. Curl_conn_ev_update_info(data, data->conn);
  307. conn_report_connect_stats(data, data->conn);
  308. data->conn->keepalive = Curl_now();
  309. }
  310. else if(result) {
  311. conn_report_connect_stats(data, data->conn);
  312. }
  313. }
  314. return result;
  315. }
  316. bool Curl_conn_is_connected(struct connectdata *conn, int sockindex)
  317. {
  318. struct Curl_cfilter *cf;
  319. cf = conn->cfilter[sockindex];
  320. return cf && cf->connected;
  321. }
  322. bool Curl_conn_is_ip_connected(struct Curl_easy *data, int sockindex)
  323. {
  324. struct Curl_cfilter *cf;
  325. cf = data->conn->cfilter[sockindex];
  326. while(cf) {
  327. if(cf->connected)
  328. return TRUE;
  329. if(cf->cft->flags & CF_TYPE_IP_CONNECT)
  330. return FALSE;
  331. cf = cf->next;
  332. }
  333. return FALSE;
  334. }
  335. bool Curl_conn_cf_is_ssl(struct Curl_cfilter *cf)
  336. {
  337. for(; cf; cf = cf->next) {
  338. if(cf->cft->flags & CF_TYPE_SSL)
  339. return TRUE;
  340. if(cf->cft->flags & CF_TYPE_IP_CONNECT)
  341. return FALSE;
  342. }
  343. return FALSE;
  344. }
  345. bool Curl_conn_is_ssl(struct connectdata *conn, int sockindex)
  346. {
  347. return conn? Curl_conn_cf_is_ssl(conn->cfilter[sockindex]) : FALSE;
  348. }
  349. bool Curl_conn_is_multiplex(struct connectdata *conn, int sockindex)
  350. {
  351. struct Curl_cfilter *cf = conn? conn->cfilter[sockindex] : NULL;
  352. for(; cf; cf = cf->next) {
  353. if(cf->cft->flags & CF_TYPE_MULTIPLEX)
  354. return TRUE;
  355. if(cf->cft->flags & CF_TYPE_IP_CONNECT
  356. || cf->cft->flags & CF_TYPE_SSL)
  357. return FALSE;
  358. }
  359. return FALSE;
  360. }
  361. bool Curl_conn_data_pending(struct Curl_easy *data, int sockindex)
  362. {
  363. struct Curl_cfilter *cf;
  364. (void)data;
  365. DEBUGASSERT(data);
  366. DEBUGASSERT(data->conn);
  367. cf = data->conn->cfilter[sockindex];
  368. while(cf && !cf->connected) {
  369. cf = cf->next;
  370. }
  371. if(cf) {
  372. return cf->cft->has_data_pending(cf, data);
  373. }
  374. return FALSE;
  375. }
  376. void Curl_conn_cf_adjust_pollset(struct Curl_cfilter *cf,
  377. struct Curl_easy *data,
  378. struct easy_pollset *ps)
  379. {
  380. /* Get the lowest not-connected filter, if there are any */
  381. while(cf && !cf->connected && cf->next && !cf->next->connected)
  382. cf = cf->next;
  383. /* From there on, give all filters a chance to adjust the pollset.
  384. * Lower filters are called later, so they may override */
  385. while(cf) {
  386. cf->cft->adjust_pollset(cf, data, ps);
  387. cf = cf->next;
  388. }
  389. }
  390. void Curl_conn_adjust_pollset(struct Curl_easy *data,
  391. struct easy_pollset *ps)
  392. {
  393. int i;
  394. DEBUGASSERT(data);
  395. DEBUGASSERT(data->conn);
  396. for(i = 0; i < 2; ++i) {
  397. Curl_conn_cf_adjust_pollset(data->conn->cfilter[i], data, ps);
  398. }
  399. }
  400. void Curl_conn_get_host(struct Curl_easy *data, int sockindex,
  401. const char **phost, const char **pdisplay_host,
  402. int *pport)
  403. {
  404. struct Curl_cfilter *cf;
  405. DEBUGASSERT(data->conn);
  406. cf = data->conn->cfilter[sockindex];
  407. if(cf) {
  408. cf->cft->get_host(cf, data, phost, pdisplay_host, pport);
  409. }
  410. else {
  411. /* Some filter ask during shutdown for this, mainly for debugging
  412. * purposes. We hand out the defaults, however this is not always
  413. * accurate, as the connection might be tunneled, etc. But all that
  414. * state is already gone here. */
  415. *phost = data->conn->host.name;
  416. *pdisplay_host = data->conn->host.dispname;
  417. *pport = data->conn->remote_port;
  418. }
  419. }
  420. CURLcode Curl_cf_def_cntrl(struct Curl_cfilter *cf,
  421. struct Curl_easy *data,
  422. int event, int arg1, void *arg2)
  423. {
  424. (void)cf;
  425. (void)data;
  426. (void)event;
  427. (void)arg1;
  428. (void)arg2;
  429. return CURLE_OK;
  430. }
  431. CURLcode Curl_conn_cf_cntrl(struct Curl_cfilter *cf,
  432. struct Curl_easy *data,
  433. bool ignore_result,
  434. int event, int arg1, void *arg2)
  435. {
  436. CURLcode result = CURLE_OK;
  437. for(; cf; cf = cf->next) {
  438. if(Curl_cf_def_cntrl == cf->cft->cntrl)
  439. continue;
  440. result = cf->cft->cntrl(cf, data, event, arg1, arg2);
  441. if(!ignore_result && result)
  442. break;
  443. }
  444. return result;
  445. }
  446. curl_socket_t Curl_conn_cf_get_socket(struct Curl_cfilter *cf,
  447. struct Curl_easy *data)
  448. {
  449. curl_socket_t sock;
  450. if(cf && !cf->cft->query(cf, data, CF_QUERY_SOCKET, NULL, &sock))
  451. return sock;
  452. return CURL_SOCKET_BAD;
  453. }
  454. curl_socket_t Curl_conn_get_socket(struct Curl_easy *data, int sockindex)
  455. {
  456. struct Curl_cfilter *cf;
  457. cf = data->conn? data->conn->cfilter[sockindex] : NULL;
  458. /* if the top filter has not connected, ask it (and its sub-filters)
  459. * for the socket. Otherwise conn->sock[sockindex] should have it.
  460. */
  461. if(cf && !cf->connected)
  462. return Curl_conn_cf_get_socket(cf, data);
  463. return data->conn? data->conn->sock[sockindex] : CURL_SOCKET_BAD;
  464. }
  465. void Curl_conn_forget_socket(struct Curl_easy *data, int sockindex)
  466. {
  467. if(data->conn) {
  468. struct Curl_cfilter *cf = data->conn->cfilter[sockindex];
  469. if(cf)
  470. (void)Curl_conn_cf_cntrl(cf, data, TRUE,
  471. CF_CTRL_FORGET_SOCKET, 0, NULL);
  472. fake_sclose(data->conn->sock[sockindex]);
  473. data->conn->sock[sockindex] = CURL_SOCKET_BAD;
  474. }
  475. }
  476. static CURLcode cf_cntrl_all(struct connectdata *conn,
  477. struct Curl_easy *data,
  478. bool ignore_result,
  479. int event, int arg1, void *arg2)
  480. {
  481. CURLcode result = CURLE_OK;
  482. size_t i;
  483. for(i = 0; i < ARRAYSIZE(conn->cfilter); ++i) {
  484. result = Curl_conn_cf_cntrl(conn->cfilter[i], data, ignore_result,
  485. event, arg1, arg2);
  486. if(!ignore_result && result)
  487. break;
  488. }
  489. return result;
  490. }
  491. void Curl_conn_ev_data_attach(struct connectdata *conn,
  492. struct Curl_easy *data)
  493. {
  494. cf_cntrl_all(conn, data, TRUE, CF_CTRL_DATA_ATTACH, 0, NULL);
  495. }
  496. void Curl_conn_ev_data_detach(struct connectdata *conn,
  497. struct Curl_easy *data)
  498. {
  499. cf_cntrl_all(conn, data, TRUE, CF_CTRL_DATA_DETACH, 0, NULL);
  500. }
  501. CURLcode Curl_conn_ev_data_setup(struct Curl_easy *data)
  502. {
  503. return cf_cntrl_all(data->conn, data, FALSE,
  504. CF_CTRL_DATA_SETUP, 0, NULL);
  505. }
  506. CURLcode Curl_conn_ev_data_idle(struct Curl_easy *data)
  507. {
  508. return cf_cntrl_all(data->conn, data, FALSE,
  509. CF_CTRL_DATA_IDLE, 0, NULL);
  510. }
  511. /**
  512. * Notify connection filters that the transfer represented by `data`
  513. * is donw with sending data (e.g. has uploaded everything).
  514. */
  515. void Curl_conn_ev_data_done_send(struct Curl_easy *data)
  516. {
  517. cf_cntrl_all(data->conn, data, TRUE, CF_CTRL_DATA_DONE_SEND, 0, NULL);
  518. }
  519. /**
  520. * Notify connection filters that the transfer represented by `data`
  521. * is finished - eventually premature, e.g. before being complete.
  522. */
  523. void Curl_conn_ev_data_done(struct Curl_easy *data, bool premature)
  524. {
  525. cf_cntrl_all(data->conn, data, TRUE, CF_CTRL_DATA_DONE, premature, NULL);
  526. }
  527. CURLcode Curl_conn_ev_data_pause(struct Curl_easy *data, bool do_pause)
  528. {
  529. return cf_cntrl_all(data->conn, data, FALSE,
  530. CF_CTRL_DATA_PAUSE, do_pause, NULL);
  531. }
  532. void Curl_conn_ev_update_info(struct Curl_easy *data,
  533. struct connectdata *conn)
  534. {
  535. cf_cntrl_all(conn, data, TRUE, CF_CTRL_CONN_INFO_UPDATE, 0, NULL);
  536. }
  537. /**
  538. * Update connection statistics
  539. */
  540. static void conn_report_connect_stats(struct Curl_easy *data,
  541. struct connectdata *conn)
  542. {
  543. struct Curl_cfilter *cf = conn->cfilter[FIRSTSOCKET];
  544. if(cf) {
  545. struct curltime connected;
  546. struct curltime appconnected;
  547. memset(&connected, 0, sizeof(connected));
  548. cf->cft->query(cf, data, CF_QUERY_TIMER_CONNECT, NULL, &connected);
  549. if(connected.tv_sec || connected.tv_usec)
  550. Curl_pgrsTimeWas(data, TIMER_CONNECT, connected);
  551. memset(&appconnected, 0, sizeof(appconnected));
  552. cf->cft->query(cf, data, CF_QUERY_TIMER_APPCONNECT, NULL, &appconnected);
  553. if(appconnected.tv_sec || appconnected.tv_usec)
  554. Curl_pgrsTimeWas(data, TIMER_APPCONNECT, appconnected);
  555. }
  556. }
  557. bool Curl_conn_is_alive(struct Curl_easy *data, struct connectdata *conn,
  558. bool *input_pending)
  559. {
  560. struct Curl_cfilter *cf = conn->cfilter[FIRSTSOCKET];
  561. return cf && !cf->conn->bits.close &&
  562. cf->cft->is_alive(cf, data, input_pending);
  563. }
  564. CURLcode Curl_conn_keep_alive(struct Curl_easy *data,
  565. struct connectdata *conn,
  566. int sockindex)
  567. {
  568. struct Curl_cfilter *cf = conn->cfilter[sockindex];
  569. return cf? cf->cft->keep_alive(cf, data) : CURLE_OK;
  570. }
  571. size_t Curl_conn_get_max_concurrent(struct Curl_easy *data,
  572. struct connectdata *conn,
  573. int sockindex)
  574. {
  575. CURLcode result;
  576. int n = 0;
  577. struct Curl_cfilter *cf = conn->cfilter[sockindex];
  578. result = cf? cf->cft->query(cf, data, CF_QUERY_MAX_CONCURRENT,
  579. &n, NULL) : CURLE_UNKNOWN_OPTION;
  580. return (result || n <= 0)? 1 : (size_t)n;
  581. }
  582. void Curl_pollset_reset(struct Curl_easy *data,
  583. struct easy_pollset *ps)
  584. {
  585. size_t i;
  586. (void)data;
  587. memset(ps, 0, sizeof(*ps));
  588. for(i = 0; i< MAX_SOCKSPEREASYHANDLE; i++)
  589. ps->sockets[i] = CURL_SOCKET_BAD;
  590. }
  591. /**
  592. *
  593. */
  594. void Curl_pollset_change(struct Curl_easy *data,
  595. struct easy_pollset *ps, curl_socket_t sock,
  596. int add_flags, int remove_flags)
  597. {
  598. unsigned int i;
  599. (void)data;
  600. DEBUGASSERT(VALID_SOCK(sock));
  601. if(!VALID_SOCK(sock))
  602. return;
  603. DEBUGASSERT(add_flags <= (CURL_POLL_IN|CURL_POLL_OUT));
  604. DEBUGASSERT(remove_flags <= (CURL_POLL_IN|CURL_POLL_OUT));
  605. DEBUGASSERT((add_flags&remove_flags) == 0); /* no overlap */
  606. for(i = 0; i < ps->num; ++i) {
  607. if(ps->sockets[i] == sock) {
  608. ps->actions[i] &= (unsigned char)(~remove_flags);
  609. ps->actions[i] |= (unsigned char)add_flags;
  610. /* all gone? remove socket */
  611. if(!ps->actions[i]) {
  612. if((i + 1) < ps->num) {
  613. memmove(&ps->sockets[i], &ps->sockets[i + 1],
  614. (ps->num - (i + 1)) * sizeof(ps->sockets[0]));
  615. memmove(&ps->actions[i], &ps->actions[i + 1],
  616. (ps->num - (i + 1)) * sizeof(ps->actions[0]));
  617. }
  618. --ps->num;
  619. }
  620. return;
  621. }
  622. }
  623. /* not present */
  624. if(add_flags) {
  625. /* Having more SOCKETS per easy handle than what is defined
  626. * is a programming error. This indicates that we need
  627. * to raise this limit, making easy_pollset larger.
  628. * Since we use this in tight loops, we do not want to make
  629. * the pollset dynamic unnecessarily.
  630. * The current maximum in practise is HTTP/3 eyeballing where
  631. * we have up to 4 sockets involved in connection setup.
  632. */
  633. DEBUGASSERT(i < MAX_SOCKSPEREASYHANDLE);
  634. if(i < MAX_SOCKSPEREASYHANDLE) {
  635. ps->sockets[i] = sock;
  636. ps->actions[i] = (unsigned char)add_flags;
  637. ps->num = i + 1;
  638. }
  639. }
  640. }
  641. void Curl_pollset_set(struct Curl_easy *data,
  642. struct easy_pollset *ps, curl_socket_t sock,
  643. bool do_in, bool do_out)
  644. {
  645. Curl_pollset_change(data, ps, sock,
  646. (do_in?CURL_POLL_IN:0)|(do_out?CURL_POLL_OUT:0),
  647. (!do_in?CURL_POLL_IN:0)|(!do_out?CURL_POLL_OUT:0));
  648. }
  649. static void ps_add(struct Curl_easy *data, struct easy_pollset *ps,
  650. int bitmap, curl_socket_t *socks)
  651. {
  652. if(bitmap) {
  653. int i;
  654. for(i = 0; i < MAX_SOCKSPEREASYHANDLE; ++i) {
  655. if(!(bitmap & GETSOCK_MASK_RW(i)) || !VALID_SOCK((socks[i]))) {
  656. break;
  657. }
  658. if(bitmap & GETSOCK_READSOCK(i)) {
  659. if(bitmap & GETSOCK_WRITESOCK(i))
  660. Curl_pollset_add_inout(data, ps, socks[i]);
  661. else
  662. /* is READ, since we checked MASK_RW above */
  663. Curl_pollset_add_in(data, ps, socks[i]);
  664. }
  665. else
  666. Curl_pollset_add_out(data, ps, socks[i]);
  667. }
  668. }
  669. }
  670. void Curl_pollset_add_socks(struct Curl_easy *data,
  671. struct easy_pollset *ps,
  672. int (*get_socks_cb)(struct Curl_easy *data,
  673. struct connectdata *conn,
  674. curl_socket_t *socks))
  675. {
  676. curl_socket_t socks[MAX_SOCKSPEREASYHANDLE];
  677. int bitmap;
  678. DEBUGASSERT(data->conn);
  679. bitmap = get_socks_cb(data, data->conn, socks);
  680. ps_add(data, ps, bitmap, socks);
  681. }
  682. void Curl_pollset_add_socks2(struct Curl_easy *data,
  683. struct easy_pollset *ps,
  684. int (*get_socks_cb)(struct Curl_easy *data,
  685. curl_socket_t *socks))
  686. {
  687. curl_socket_t socks[MAX_SOCKSPEREASYHANDLE];
  688. int bitmap;
  689. bitmap = get_socks_cb(data, socks);
  690. ps_add(data, ps, bitmap, socks);
  691. }
  692. void Curl_pollset_check(struct Curl_easy *data,
  693. struct easy_pollset *ps, curl_socket_t sock,
  694. bool *pwant_read, bool *pwant_write)
  695. {
  696. unsigned int i;
  697. (void)data;
  698. DEBUGASSERT(VALID_SOCK(sock));
  699. for(i = 0; i < ps->num; ++i) {
  700. if(ps->sockets[i] == sock) {
  701. *pwant_read = !!(ps->actions[i] & CURL_POLL_IN);
  702. *pwant_write = !!(ps->actions[i] & CURL_POLL_OUT);
  703. return;
  704. }
  705. }
  706. *pwant_read = *pwant_write = FALSE;
  707. }