input.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733
  1. /*
  2. * net/dccp/input.c
  3. *
  4. * An implementation of the DCCP protocol
  5. * Arnaldo Carvalho de Melo <acme@conectiva.com.br>
  6. *
  7. * This program is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU General Public License
  9. * as published by the Free Software Foundation; either version
  10. * 2 of the License, or (at your option) any later version.
  11. */
  12. #include <linux/dccp.h>
  13. #include <linux/skbuff.h>
  14. #include <linux/slab.h>
  15. #include <net/sock.h>
  16. #include "ackvec.h"
  17. #include "ccid.h"
  18. #include "dccp.h"
  19. /* rate-limit for syncs in reply to sequence-invalid packets; RFC 4340, 7.5.4 */
  20. int sysctl_dccp_sync_ratelimit __read_mostly = HZ / 8;
  21. static void dccp_enqueue_skb(struct sock *sk, struct sk_buff *skb)
  22. {
  23. __skb_pull(skb, dccp_hdr(skb)->dccph_doff * 4);
  24. __skb_queue_tail(&sk->sk_receive_queue, skb);
  25. skb_set_owner_r(skb, sk);
  26. sk->sk_data_ready(sk);
  27. }
  28. static void dccp_fin(struct sock *sk, struct sk_buff *skb)
  29. {
  30. /*
  31. * On receiving Close/CloseReq, both RD/WR shutdown are performed.
  32. * RFC 4340, 8.3 says that we MAY send further Data/DataAcks after
  33. * receiving the closing segment, but there is no guarantee that such
  34. * data will be processed at all.
  35. */
  36. sk->sk_shutdown = SHUTDOWN_MASK;
  37. sock_set_flag(sk, SOCK_DONE);
  38. dccp_enqueue_skb(sk, skb);
  39. }
  40. static int dccp_rcv_close(struct sock *sk, struct sk_buff *skb)
  41. {
  42. int queued = 0;
  43. switch (sk->sk_state) {
  44. /*
  45. * We ignore Close when received in one of the following states:
  46. * - CLOSED (may be a late or duplicate packet)
  47. * - PASSIVE_CLOSEREQ (the peer has sent a CloseReq earlier)
  48. * - RESPOND (already handled by dccp_check_req)
  49. */
  50. case DCCP_CLOSING:
  51. /*
  52. * Simultaneous-close: receiving a Close after sending one. This
  53. * can happen if both client and server perform active-close and
  54. * will result in an endless ping-pong of crossing and retrans-
  55. * mitted Close packets, which only terminates when one of the
  56. * nodes times out (min. 64 seconds). Quicker convergence can be
  57. * achieved when one of the nodes acts as tie-breaker.
  58. * This is ok as both ends are done with data transfer and each
  59. * end is just waiting for the other to acknowledge termination.
  60. */
  61. if (dccp_sk(sk)->dccps_role != DCCP_ROLE_CLIENT)
  62. break;
  63. /* fall through */
  64. case DCCP_REQUESTING:
  65. case DCCP_ACTIVE_CLOSEREQ:
  66. dccp_send_reset(sk, DCCP_RESET_CODE_CLOSED);
  67. dccp_done(sk);
  68. break;
  69. case DCCP_OPEN:
  70. case DCCP_PARTOPEN:
  71. /* Give waiting application a chance to read pending data */
  72. queued = 1;
  73. dccp_fin(sk, skb);
  74. dccp_set_state(sk, DCCP_PASSIVE_CLOSE);
  75. /* fall through */
  76. case DCCP_PASSIVE_CLOSE:
  77. /*
  78. * Retransmitted Close: we have already enqueued the first one.
  79. */
  80. sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_HUP);
  81. }
  82. return queued;
  83. }
  84. static int dccp_rcv_closereq(struct sock *sk, struct sk_buff *skb)
  85. {
  86. int queued = 0;
  87. /*
  88. * Step 7: Check for unexpected packet types
  89. * If (S.is_server and P.type == CloseReq)
  90. * Send Sync packet acknowledging P.seqno
  91. * Drop packet and return
  92. */
  93. if (dccp_sk(sk)->dccps_role != DCCP_ROLE_CLIENT) {
  94. dccp_send_sync(sk, DCCP_SKB_CB(skb)->dccpd_seq, DCCP_PKT_SYNC);
  95. return queued;
  96. }
  97. /* Step 13: process relevant Client states < CLOSEREQ */
  98. switch (sk->sk_state) {
  99. case DCCP_REQUESTING:
  100. dccp_send_close(sk, 0);
  101. dccp_set_state(sk, DCCP_CLOSING);
  102. break;
  103. case DCCP_OPEN:
  104. case DCCP_PARTOPEN:
  105. /* Give waiting application a chance to read pending data */
  106. queued = 1;
  107. dccp_fin(sk, skb);
  108. dccp_set_state(sk, DCCP_PASSIVE_CLOSEREQ);
  109. /* fall through */
  110. case DCCP_PASSIVE_CLOSEREQ:
  111. sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_HUP);
  112. }
  113. return queued;
  114. }
  115. static u16 dccp_reset_code_convert(const u8 code)
  116. {
  117. const u16 error_code[] = {
  118. [DCCP_RESET_CODE_CLOSED] = 0, /* normal termination */
  119. [DCCP_RESET_CODE_UNSPECIFIED] = 0, /* nothing known */
  120. [DCCP_RESET_CODE_ABORTED] = ECONNRESET,
  121. [DCCP_RESET_CODE_NO_CONNECTION] = ECONNREFUSED,
  122. [DCCP_RESET_CODE_CONNECTION_REFUSED] = ECONNREFUSED,
  123. [DCCP_RESET_CODE_TOO_BUSY] = EUSERS,
  124. [DCCP_RESET_CODE_AGGRESSION_PENALTY] = EDQUOT,
  125. [DCCP_RESET_CODE_PACKET_ERROR] = ENOMSG,
  126. [DCCP_RESET_CODE_BAD_INIT_COOKIE] = EBADR,
  127. [DCCP_RESET_CODE_BAD_SERVICE_CODE] = EBADRQC,
  128. [DCCP_RESET_CODE_OPTION_ERROR] = EILSEQ,
  129. [DCCP_RESET_CODE_MANDATORY_ERROR] = EOPNOTSUPP,
  130. };
  131. return code >= DCCP_MAX_RESET_CODES ? 0 : error_code[code];
  132. }
  133. static void dccp_rcv_reset(struct sock *sk, struct sk_buff *skb)
  134. {
  135. u16 err = dccp_reset_code_convert(dccp_hdr_reset(skb)->dccph_reset_code);
  136. sk->sk_err = err;
  137. /* Queue the equivalent of TCP fin so that dccp_recvmsg exits the loop */
  138. dccp_fin(sk, skb);
  139. if (err && !sock_flag(sk, SOCK_DEAD))
  140. sk_wake_async(sk, SOCK_WAKE_IO, POLL_ERR);
  141. dccp_time_wait(sk, DCCP_TIME_WAIT, 0);
  142. }
  143. static void dccp_handle_ackvec_processing(struct sock *sk, struct sk_buff *skb)
  144. {
  145. struct dccp_ackvec *av = dccp_sk(sk)->dccps_hc_rx_ackvec;
  146. if (av == NULL)
  147. return;
  148. if (DCCP_SKB_CB(skb)->dccpd_ack_seq != DCCP_PKT_WITHOUT_ACK_SEQ)
  149. dccp_ackvec_clear_state(av, DCCP_SKB_CB(skb)->dccpd_ack_seq);
  150. dccp_ackvec_input(av, skb);
  151. }
  152. static void dccp_deliver_input_to_ccids(struct sock *sk, struct sk_buff *skb)
  153. {
  154. const struct dccp_sock *dp = dccp_sk(sk);
  155. /* Don't deliver to RX CCID when node has shut down read end. */
  156. if (!(sk->sk_shutdown & RCV_SHUTDOWN))
  157. ccid_hc_rx_packet_recv(dp->dccps_hc_rx_ccid, sk, skb);
  158. /*
  159. * Until the TX queue has been drained, we can not honour SHUT_WR, since
  160. * we need received feedback as input to adjust congestion control.
  161. */
  162. if (sk->sk_write_queue.qlen > 0 || !(sk->sk_shutdown & SEND_SHUTDOWN))
  163. ccid_hc_tx_packet_recv(dp->dccps_hc_tx_ccid, sk, skb);
  164. }
  165. static int dccp_check_seqno(struct sock *sk, struct sk_buff *skb)
  166. {
  167. const struct dccp_hdr *dh = dccp_hdr(skb);
  168. struct dccp_sock *dp = dccp_sk(sk);
  169. u64 lswl, lawl, seqno = DCCP_SKB_CB(skb)->dccpd_seq,
  170. ackno = DCCP_SKB_CB(skb)->dccpd_ack_seq;
  171. /*
  172. * Step 5: Prepare sequence numbers for Sync
  173. * If P.type == Sync or P.type == SyncAck,
  174. * If S.AWL <= P.ackno <= S.AWH and P.seqno >= S.SWL,
  175. * / * P is valid, so update sequence number variables
  176. * accordingly. After this update, P will pass the tests
  177. * in Step 6. A SyncAck is generated if necessary in
  178. * Step 15 * /
  179. * Update S.GSR, S.SWL, S.SWH
  180. * Otherwise,
  181. * Drop packet and return
  182. */
  183. if (dh->dccph_type == DCCP_PKT_SYNC ||
  184. dh->dccph_type == DCCP_PKT_SYNCACK) {
  185. if (between48(ackno, dp->dccps_awl, dp->dccps_awh) &&
  186. dccp_delta_seqno(dp->dccps_swl, seqno) >= 0)
  187. dccp_update_gsr(sk, seqno);
  188. else
  189. return -1;
  190. }
  191. /*
  192. * Step 6: Check sequence numbers
  193. * Let LSWL = S.SWL and LAWL = S.AWL
  194. * If P.type == CloseReq or P.type == Close or P.type == Reset,
  195. * LSWL := S.GSR + 1, LAWL := S.GAR
  196. * If LSWL <= P.seqno <= S.SWH
  197. * and (P.ackno does not exist or LAWL <= P.ackno <= S.AWH),
  198. * Update S.GSR, S.SWL, S.SWH
  199. * If P.type != Sync,
  200. * Update S.GAR
  201. */
  202. lswl = dp->dccps_swl;
  203. lawl = dp->dccps_awl;
  204. if (dh->dccph_type == DCCP_PKT_CLOSEREQ ||
  205. dh->dccph_type == DCCP_PKT_CLOSE ||
  206. dh->dccph_type == DCCP_PKT_RESET) {
  207. lswl = ADD48(dp->dccps_gsr, 1);
  208. lawl = dp->dccps_gar;
  209. }
  210. if (between48(seqno, lswl, dp->dccps_swh) &&
  211. (ackno == DCCP_PKT_WITHOUT_ACK_SEQ ||
  212. between48(ackno, lawl, dp->dccps_awh))) {
  213. dccp_update_gsr(sk, seqno);
  214. if (dh->dccph_type != DCCP_PKT_SYNC &&
  215. ackno != DCCP_PKT_WITHOUT_ACK_SEQ &&
  216. after48(ackno, dp->dccps_gar))
  217. dp->dccps_gar = ackno;
  218. } else {
  219. unsigned long now = jiffies;
  220. /*
  221. * Step 6: Check sequence numbers
  222. * Otherwise,
  223. * If P.type == Reset,
  224. * Send Sync packet acknowledging S.GSR
  225. * Otherwise,
  226. * Send Sync packet acknowledging P.seqno
  227. * Drop packet and return
  228. *
  229. * These Syncs are rate-limited as per RFC 4340, 7.5.4:
  230. * at most 1 / (dccp_sync_rate_limit * HZ) Syncs per second.
  231. */
  232. if (time_before(now, (dp->dccps_rate_last +
  233. sysctl_dccp_sync_ratelimit)))
  234. return -1;
  235. DCCP_WARN("Step 6 failed for %s packet, "
  236. "(LSWL(%llu) <= P.seqno(%llu) <= S.SWH(%llu)) and "
  237. "(P.ackno %s or LAWL(%llu) <= P.ackno(%llu) <= S.AWH(%llu), "
  238. "sending SYNC...\n", dccp_packet_name(dh->dccph_type),
  239. (unsigned long long) lswl, (unsigned long long) seqno,
  240. (unsigned long long) dp->dccps_swh,
  241. (ackno == DCCP_PKT_WITHOUT_ACK_SEQ) ? "doesn't exist"
  242. : "exists",
  243. (unsigned long long) lawl, (unsigned long long) ackno,
  244. (unsigned long long) dp->dccps_awh);
  245. dp->dccps_rate_last = now;
  246. if (dh->dccph_type == DCCP_PKT_RESET)
  247. seqno = dp->dccps_gsr;
  248. dccp_send_sync(sk, seqno, DCCP_PKT_SYNC);
  249. return -1;
  250. }
  251. return 0;
  252. }
  253. static int __dccp_rcv_established(struct sock *sk, struct sk_buff *skb,
  254. const struct dccp_hdr *dh, const unsigned int len)
  255. {
  256. struct dccp_sock *dp = dccp_sk(sk);
  257. switch (dccp_hdr(skb)->dccph_type) {
  258. case DCCP_PKT_DATAACK:
  259. case DCCP_PKT_DATA:
  260. /*
  261. * FIXME: schedule DATA_DROPPED (RFC 4340, 11.7.2) if and when
  262. * - sk_shutdown == RCV_SHUTDOWN, use Code 1, "Not Listening"
  263. * - sk_receive_queue is full, use Code 2, "Receive Buffer"
  264. */
  265. dccp_enqueue_skb(sk, skb);
  266. return 0;
  267. case DCCP_PKT_ACK:
  268. goto discard;
  269. case DCCP_PKT_RESET:
  270. /*
  271. * Step 9: Process Reset
  272. * If P.type == Reset,
  273. * Tear down connection
  274. * S.state := TIMEWAIT
  275. * Set TIMEWAIT timer
  276. * Drop packet and return
  277. */
  278. dccp_rcv_reset(sk, skb);
  279. return 0;
  280. case DCCP_PKT_CLOSEREQ:
  281. if (dccp_rcv_closereq(sk, skb))
  282. return 0;
  283. goto discard;
  284. case DCCP_PKT_CLOSE:
  285. if (dccp_rcv_close(sk, skb))
  286. return 0;
  287. goto discard;
  288. case DCCP_PKT_REQUEST:
  289. /* Step 7
  290. * or (S.is_server and P.type == Response)
  291. * or (S.is_client and P.type == Request)
  292. * or (S.state >= OPEN and P.type == Request
  293. * and P.seqno >= S.OSR)
  294. * or (S.state >= OPEN and P.type == Response
  295. * and P.seqno >= S.OSR)
  296. * or (S.state == RESPOND and P.type == Data),
  297. * Send Sync packet acknowledging P.seqno
  298. * Drop packet and return
  299. */
  300. if (dp->dccps_role != DCCP_ROLE_LISTEN)
  301. goto send_sync;
  302. goto check_seq;
  303. case DCCP_PKT_RESPONSE:
  304. if (dp->dccps_role != DCCP_ROLE_CLIENT)
  305. goto send_sync;
  306. check_seq:
  307. if (dccp_delta_seqno(dp->dccps_osr,
  308. DCCP_SKB_CB(skb)->dccpd_seq) >= 0) {
  309. send_sync:
  310. dccp_send_sync(sk, DCCP_SKB_CB(skb)->dccpd_seq,
  311. DCCP_PKT_SYNC);
  312. }
  313. break;
  314. case DCCP_PKT_SYNC:
  315. dccp_send_sync(sk, DCCP_SKB_CB(skb)->dccpd_seq,
  316. DCCP_PKT_SYNCACK);
  317. /*
  318. * From RFC 4340, sec. 5.7
  319. *
  320. * As with DCCP-Ack packets, DCCP-Sync and DCCP-SyncAck packets
  321. * MAY have non-zero-length application data areas, whose
  322. * contents receivers MUST ignore.
  323. */
  324. goto discard;
  325. }
  326. DCCP_INC_STATS_BH(DCCP_MIB_INERRS);
  327. discard:
  328. __kfree_skb(skb);
  329. return 0;
  330. }
  331. int dccp_rcv_established(struct sock *sk, struct sk_buff *skb,
  332. const struct dccp_hdr *dh, const unsigned int len)
  333. {
  334. if (dccp_check_seqno(sk, skb))
  335. goto discard;
  336. if (dccp_parse_options(sk, NULL, skb))
  337. return 1;
  338. dccp_handle_ackvec_processing(sk, skb);
  339. dccp_deliver_input_to_ccids(sk, skb);
  340. return __dccp_rcv_established(sk, skb, dh, len);
  341. discard:
  342. __kfree_skb(skb);
  343. return 0;
  344. }
  345. EXPORT_SYMBOL_GPL(dccp_rcv_established);
  346. static int dccp_rcv_request_sent_state_process(struct sock *sk,
  347. struct sk_buff *skb,
  348. const struct dccp_hdr *dh,
  349. const unsigned int len)
  350. {
  351. /*
  352. * Step 4: Prepare sequence numbers in REQUEST
  353. * If S.state == REQUEST,
  354. * If (P.type == Response or P.type == Reset)
  355. * and S.AWL <= P.ackno <= S.AWH,
  356. * / * Set sequence number variables corresponding to the
  357. * other endpoint, so P will pass the tests in Step 6 * /
  358. * Set S.GSR, S.ISR, S.SWL, S.SWH
  359. * / * Response processing continues in Step 10; Reset
  360. * processing continues in Step 9 * /
  361. */
  362. if (dh->dccph_type == DCCP_PKT_RESPONSE) {
  363. const struct inet_connection_sock *icsk = inet_csk(sk);
  364. struct dccp_sock *dp = dccp_sk(sk);
  365. long tstamp = dccp_timestamp();
  366. if (!between48(DCCP_SKB_CB(skb)->dccpd_ack_seq,
  367. dp->dccps_awl, dp->dccps_awh)) {
  368. dccp_pr_debug("invalid ackno: S.AWL=%llu, "
  369. "P.ackno=%llu, S.AWH=%llu\n",
  370. (unsigned long long)dp->dccps_awl,
  371. (unsigned long long)DCCP_SKB_CB(skb)->dccpd_ack_seq,
  372. (unsigned long long)dp->dccps_awh);
  373. goto out_invalid_packet;
  374. }
  375. /*
  376. * If option processing (Step 8) failed, return 1 here so that
  377. * dccp_v4_do_rcv() sends a Reset. The Reset code depends on
  378. * the option type and is set in dccp_parse_options().
  379. */
  380. if (dccp_parse_options(sk, NULL, skb))
  381. return 1;
  382. /* Obtain usec RTT sample from SYN exchange (used by TFRC). */
  383. if (likely(dp->dccps_options_received.dccpor_timestamp_echo))
  384. dp->dccps_syn_rtt = dccp_sample_rtt(sk, 10 * (tstamp -
  385. dp->dccps_options_received.dccpor_timestamp_echo));
  386. /* Stop the REQUEST timer */
  387. inet_csk_clear_xmit_timer(sk, ICSK_TIME_RETRANS);
  388. WARN_ON(sk->sk_send_head == NULL);
  389. kfree_skb(sk->sk_send_head);
  390. sk->sk_send_head = NULL;
  391. /*
  392. * Set ISR, GSR from packet. ISS was set in dccp_v{4,6}_connect
  393. * and GSS in dccp_transmit_skb(). Setting AWL/AWH and SWL/SWH
  394. * is done as part of activating the feature values below, since
  395. * these settings depend on the local/remote Sequence Window
  396. * features, which were undefined or not confirmed until now.
  397. */
  398. dp->dccps_gsr = dp->dccps_isr = DCCP_SKB_CB(skb)->dccpd_seq;
  399. dccp_sync_mss(sk, icsk->icsk_pmtu_cookie);
  400. /*
  401. * Step 10: Process REQUEST state (second part)
  402. * If S.state == REQUEST,
  403. * / * If we get here, P is a valid Response from the
  404. * server (see Step 4), and we should move to
  405. * PARTOPEN state. PARTOPEN means send an Ack,
  406. * don't send Data packets, retransmit Acks
  407. * periodically, and always include any Init Cookie
  408. * from the Response * /
  409. * S.state := PARTOPEN
  410. * Set PARTOPEN timer
  411. * Continue with S.state == PARTOPEN
  412. * / * Step 12 will send the Ack completing the
  413. * three-way handshake * /
  414. */
  415. dccp_set_state(sk, DCCP_PARTOPEN);
  416. /*
  417. * If feature negotiation was successful, activate features now;
  418. * an activation failure means that this host could not activate
  419. * one ore more features (e.g. insufficient memory), which would
  420. * leave at least one feature in an undefined state.
  421. */
  422. if (dccp_feat_activate_values(sk, &dp->dccps_featneg))
  423. goto unable_to_proceed;
  424. /* Make sure socket is routed, for correct metrics. */
  425. icsk->icsk_af_ops->rebuild_header(sk);
  426. if (!sock_flag(sk, SOCK_DEAD)) {
  427. sk->sk_state_change(sk);
  428. sk_wake_async(sk, SOCK_WAKE_IO, POLL_OUT);
  429. }
  430. if (sk->sk_write_pending || icsk->icsk_ack.pingpong ||
  431. icsk->icsk_accept_queue.rskq_defer_accept) {
  432. /* Save one ACK. Data will be ready after
  433. * several ticks, if write_pending is set.
  434. *
  435. * It may be deleted, but with this feature tcpdumps
  436. * look so _wonderfully_ clever, that I was not able
  437. * to stand against the temptation 8) --ANK
  438. */
  439. /*
  440. * OK, in DCCP we can as well do a similar trick, its
  441. * even in the draft, but there is no need for us to
  442. * schedule an ack here, as dccp_sendmsg does this for
  443. * us, also stated in the draft. -acme
  444. */
  445. __kfree_skb(skb);
  446. return 0;
  447. }
  448. dccp_send_ack(sk);
  449. return -1;
  450. }
  451. out_invalid_packet:
  452. /* dccp_v4_do_rcv will send a reset */
  453. DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_PACKET_ERROR;
  454. return 1;
  455. unable_to_proceed:
  456. DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_ABORTED;
  457. /*
  458. * We mark this socket as no longer usable, so that the loop in
  459. * dccp_sendmsg() terminates and the application gets notified.
  460. */
  461. dccp_set_state(sk, DCCP_CLOSED);
  462. sk->sk_err = ECOMM;
  463. return 1;
  464. }
  465. static int dccp_rcv_respond_partopen_state_process(struct sock *sk,
  466. struct sk_buff *skb,
  467. const struct dccp_hdr *dh,
  468. const unsigned int len)
  469. {
  470. struct dccp_sock *dp = dccp_sk(sk);
  471. u32 sample = dp->dccps_options_received.dccpor_timestamp_echo;
  472. int queued = 0;
  473. switch (dh->dccph_type) {
  474. case DCCP_PKT_RESET:
  475. inet_csk_clear_xmit_timer(sk, ICSK_TIME_DACK);
  476. break;
  477. case DCCP_PKT_DATA:
  478. if (sk->sk_state == DCCP_RESPOND)
  479. break;
  480. case DCCP_PKT_DATAACK:
  481. case DCCP_PKT_ACK:
  482. /*
  483. * FIXME: we should be resetting the PARTOPEN (DELACK) timer
  484. * here but only if we haven't used the DELACK timer for
  485. * something else, like sending a delayed ack for a TIMESTAMP
  486. * echo, etc, for now were not clearing it, sending an extra
  487. * ACK when there is nothing else to do in DELACK is not a big
  488. * deal after all.
  489. */
  490. /* Stop the PARTOPEN timer */
  491. if (sk->sk_state == DCCP_PARTOPEN)
  492. inet_csk_clear_xmit_timer(sk, ICSK_TIME_DACK);
  493. /* Obtain usec RTT sample from SYN exchange (used by TFRC). */
  494. if (likely(sample)) {
  495. long delta = dccp_timestamp() - sample;
  496. dp->dccps_syn_rtt = dccp_sample_rtt(sk, 10 * delta);
  497. }
  498. dp->dccps_osr = DCCP_SKB_CB(skb)->dccpd_seq;
  499. dccp_set_state(sk, DCCP_OPEN);
  500. if (dh->dccph_type == DCCP_PKT_DATAACK ||
  501. dh->dccph_type == DCCP_PKT_DATA) {
  502. __dccp_rcv_established(sk, skb, dh, len);
  503. queued = 1; /* packet was queued
  504. (by __dccp_rcv_established) */
  505. }
  506. break;
  507. }
  508. return queued;
  509. }
  510. int dccp_rcv_state_process(struct sock *sk, struct sk_buff *skb,
  511. struct dccp_hdr *dh, unsigned int len)
  512. {
  513. struct dccp_sock *dp = dccp_sk(sk);
  514. struct dccp_skb_cb *dcb = DCCP_SKB_CB(skb);
  515. const int old_state = sk->sk_state;
  516. int queued = 0;
  517. /*
  518. * Step 3: Process LISTEN state
  519. *
  520. * If S.state == LISTEN,
  521. * If P.type == Request or P contains a valid Init Cookie option,
  522. * (* Must scan the packet's options to check for Init
  523. * Cookies. Only Init Cookies are processed here,
  524. * however; other options are processed in Step 8. This
  525. * scan need only be performed if the endpoint uses Init
  526. * Cookies *)
  527. * (* Generate a new socket and switch to that socket *)
  528. * Set S := new socket for this port pair
  529. * S.state = RESPOND
  530. * Choose S.ISS (initial seqno) or set from Init Cookies
  531. * Initialize S.GAR := S.ISS
  532. * Set S.ISR, S.GSR, S.SWL, S.SWH from packet or Init
  533. * Cookies Continue with S.state == RESPOND
  534. * (* A Response packet will be generated in Step 11 *)
  535. * Otherwise,
  536. * Generate Reset(No Connection) unless P.type == Reset
  537. * Drop packet and return
  538. */
  539. if (sk->sk_state == DCCP_LISTEN) {
  540. if (dh->dccph_type == DCCP_PKT_REQUEST) {
  541. if (inet_csk(sk)->icsk_af_ops->conn_request(sk,
  542. skb) < 0)
  543. return 1;
  544. consume_skb(skb);
  545. return 0;
  546. }
  547. if (dh->dccph_type == DCCP_PKT_RESET)
  548. goto discard;
  549. /* Caller (dccp_v4_do_rcv) will send Reset */
  550. dcb->dccpd_reset_code = DCCP_RESET_CODE_NO_CONNECTION;
  551. return 1;
  552. } else if (sk->sk_state == DCCP_CLOSED) {
  553. dcb->dccpd_reset_code = DCCP_RESET_CODE_NO_CONNECTION;
  554. return 1;
  555. }
  556. /* Step 6: Check sequence numbers (omitted in LISTEN/REQUEST state) */
  557. if (sk->sk_state != DCCP_REQUESTING && dccp_check_seqno(sk, skb))
  558. goto discard;
  559. /*
  560. * Step 7: Check for unexpected packet types
  561. * If (S.is_server and P.type == Response)
  562. * or (S.is_client and P.type == Request)
  563. * or (S.state == RESPOND and P.type == Data),
  564. * Send Sync packet acknowledging P.seqno
  565. * Drop packet and return
  566. */
  567. if ((dp->dccps_role != DCCP_ROLE_CLIENT &&
  568. dh->dccph_type == DCCP_PKT_RESPONSE) ||
  569. (dp->dccps_role == DCCP_ROLE_CLIENT &&
  570. dh->dccph_type == DCCP_PKT_REQUEST) ||
  571. (sk->sk_state == DCCP_RESPOND && dh->dccph_type == DCCP_PKT_DATA)) {
  572. dccp_send_sync(sk, dcb->dccpd_seq, DCCP_PKT_SYNC);
  573. goto discard;
  574. }
  575. /* Step 8: Process options */
  576. if (dccp_parse_options(sk, NULL, skb))
  577. return 1;
  578. /*
  579. * Step 9: Process Reset
  580. * If P.type == Reset,
  581. * Tear down connection
  582. * S.state := TIMEWAIT
  583. * Set TIMEWAIT timer
  584. * Drop packet and return
  585. */
  586. if (dh->dccph_type == DCCP_PKT_RESET) {
  587. dccp_rcv_reset(sk, skb);
  588. return 0;
  589. } else if (dh->dccph_type == DCCP_PKT_CLOSEREQ) { /* Step 13 */
  590. if (dccp_rcv_closereq(sk, skb))
  591. return 0;
  592. goto discard;
  593. } else if (dh->dccph_type == DCCP_PKT_CLOSE) { /* Step 14 */
  594. if (dccp_rcv_close(sk, skb))
  595. return 0;
  596. goto discard;
  597. }
  598. switch (sk->sk_state) {
  599. case DCCP_REQUESTING:
  600. queued = dccp_rcv_request_sent_state_process(sk, skb, dh, len);
  601. if (queued >= 0)
  602. return queued;
  603. __kfree_skb(skb);
  604. return 0;
  605. case DCCP_PARTOPEN:
  606. /* Step 8: if using Ack Vectors, mark packet acknowledgeable */
  607. dccp_handle_ackvec_processing(sk, skb);
  608. dccp_deliver_input_to_ccids(sk, skb);
  609. /* fall through */
  610. case DCCP_RESPOND:
  611. queued = dccp_rcv_respond_partopen_state_process(sk, skb,
  612. dh, len);
  613. break;
  614. }
  615. if (dh->dccph_type == DCCP_PKT_ACK ||
  616. dh->dccph_type == DCCP_PKT_DATAACK) {
  617. switch (old_state) {
  618. case DCCP_PARTOPEN:
  619. sk->sk_state_change(sk);
  620. sk_wake_async(sk, SOCK_WAKE_IO, POLL_OUT);
  621. break;
  622. }
  623. } else if (unlikely(dh->dccph_type == DCCP_PKT_SYNC)) {
  624. dccp_send_sync(sk, dcb->dccpd_seq, DCCP_PKT_SYNCACK);
  625. goto discard;
  626. }
  627. if (!queued) {
  628. discard:
  629. __kfree_skb(skb);
  630. }
  631. return 0;
  632. }
  633. EXPORT_SYMBOL_GPL(dccp_rcv_state_process);
  634. /**
  635. * dccp_sample_rtt - Validate and finalise computation of RTT sample
  636. * @delta: number of microseconds between packet and acknowledgment
  637. *
  638. * The routine is kept generic to work in different contexts. It should be
  639. * called immediately when the ACK used for the RTT sample arrives.
  640. */
  641. u32 dccp_sample_rtt(struct sock *sk, long delta)
  642. {
  643. /* dccpor_elapsed_time is either zeroed out or set and > 0 */
  644. delta -= dccp_sk(sk)->dccps_options_received.dccpor_elapsed_time * 10;
  645. if (unlikely(delta <= 0)) {
  646. DCCP_WARN("unusable RTT sample %ld, using min\n", delta);
  647. return DCCP_SANE_RTT_MIN;
  648. }
  649. if (unlikely(delta > DCCP_SANE_RTT_MAX)) {
  650. DCCP_WARN("RTT sample %ld too large, using max\n", delta);
  651. return DCCP_SANE_RTT_MAX;
  652. }
  653. return delta;
  654. }