minisocks.c 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322
  1. /*
  2. * net/dccp/minisocks.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/kernel.h>
  14. #include <linux/skbuff.h>
  15. #include <linux/timer.h>
  16. #include <net/sock.h>
  17. #include <net/xfrm.h>
  18. #include <net/inet_timewait_sock.h>
  19. #include "ackvec.h"
  20. #include "ccid.h"
  21. #include "dccp.h"
  22. #include "feat.h"
  23. struct inet_timewait_death_row dccp_death_row = {
  24. .sysctl_max_tw_buckets = NR_FILE * 2,
  25. .period = DCCP_TIMEWAIT_LEN / INET_TWDR_TWKILL_SLOTS,
  26. .death_lock = __SPIN_LOCK_UNLOCKED(dccp_death_row.death_lock),
  27. .hashinfo = &dccp_hashinfo,
  28. .tw_timer = TIMER_INITIALIZER(inet_twdr_hangman, 0,
  29. (unsigned long)&dccp_death_row),
  30. .twkill_work = __WORK_INITIALIZER(dccp_death_row.twkill_work,
  31. inet_twdr_twkill_work),
  32. /* Short-time timewait calendar */
  33. .twcal_hand = -1,
  34. .twcal_timer = TIMER_INITIALIZER(inet_twdr_twcal_tick, 0,
  35. (unsigned long)&dccp_death_row),
  36. };
  37. EXPORT_SYMBOL_GPL(dccp_death_row);
  38. void dccp_minisock_init(struct dccp_minisock *dmsk)
  39. {
  40. dmsk->dccpms_sequence_window = sysctl_dccp_feat_sequence_window;
  41. dmsk->dccpms_rx_ccid = sysctl_dccp_feat_rx_ccid;
  42. dmsk->dccpms_tx_ccid = sysctl_dccp_feat_tx_ccid;
  43. dmsk->dccpms_ack_ratio = sysctl_dccp_feat_ack_ratio;
  44. dmsk->dccpms_send_ack_vector = sysctl_dccp_feat_send_ack_vector;
  45. dmsk->dccpms_send_ndp_count = sysctl_dccp_feat_send_ndp_count;
  46. }
  47. void dccp_time_wait(struct sock *sk, int state, int timeo)
  48. {
  49. struct inet_timewait_sock *tw = NULL;
  50. if (dccp_death_row.tw_count < dccp_death_row.sysctl_max_tw_buckets)
  51. tw = inet_twsk_alloc(sk, state);
  52. if (tw != NULL) {
  53. const struct inet_connection_sock *icsk = inet_csk(sk);
  54. const int rto = (icsk->icsk_rto << 2) - (icsk->icsk_rto >> 1);
  55. #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
  56. if (tw->tw_family == PF_INET6) {
  57. const struct ipv6_pinfo *np = inet6_sk(sk);
  58. struct inet6_timewait_sock *tw6;
  59. tw->tw_ipv6_offset = inet6_tw_offset(sk->sk_prot);
  60. tw6 = inet6_twsk((struct sock *)tw);
  61. ipv6_addr_copy(&tw6->tw_v6_daddr, &np->daddr);
  62. ipv6_addr_copy(&tw6->tw_v6_rcv_saddr, &np->rcv_saddr);
  63. tw->tw_ipv6only = np->ipv6only;
  64. }
  65. #endif
  66. /* Linkage updates. */
  67. __inet_twsk_hashdance(tw, sk, &dccp_hashinfo);
  68. /* Get the TIME_WAIT timeout firing. */
  69. if (timeo < rto)
  70. timeo = rto;
  71. tw->tw_timeout = DCCP_TIMEWAIT_LEN;
  72. if (state == DCCP_TIME_WAIT)
  73. timeo = DCCP_TIMEWAIT_LEN;
  74. inet_twsk_schedule(tw, &dccp_death_row, timeo,
  75. DCCP_TIMEWAIT_LEN);
  76. inet_twsk_put(tw);
  77. } else {
  78. /* Sorry, if we're out of memory, just CLOSE this
  79. * socket up. We've got bigger problems than
  80. * non-graceful socket closings.
  81. */
  82. DCCP_WARN("time wait bucket table overflow\n");
  83. }
  84. dccp_done(sk);
  85. }
  86. struct sock *dccp_create_openreq_child(struct sock *sk,
  87. const struct request_sock *req,
  88. const struct sk_buff *skb)
  89. {
  90. /*
  91. * Step 3: Process LISTEN state
  92. *
  93. * (* Generate a new socket and switch to that socket *)
  94. * Set S := new socket for this port pair
  95. */
  96. struct sock *newsk = inet_csk_clone(sk, req, GFP_ATOMIC);
  97. if (newsk != NULL) {
  98. const struct dccp_request_sock *dreq = dccp_rsk(req);
  99. struct inet_connection_sock *newicsk = inet_csk(newsk);
  100. struct dccp_sock *newdp = dccp_sk(newsk);
  101. struct dccp_minisock *newdmsk = dccp_msk(newsk);
  102. newdp->dccps_role = DCCP_ROLE_SERVER;
  103. newdp->dccps_hc_rx_ackvec = NULL;
  104. newdp->dccps_service_list = NULL;
  105. newdp->dccps_service = dreq->dreq_service;
  106. newdp->dccps_timestamp_echo = dreq->dreq_timestamp_echo;
  107. newdp->dccps_timestamp_time = dreq->dreq_timestamp_time;
  108. newicsk->icsk_rto = DCCP_TIMEOUT_INIT;
  109. INIT_LIST_HEAD(&newdp->dccps_featneg);
  110. if (dccp_feat_clone(sk, newsk))
  111. goto out_free;
  112. if (newdmsk->dccpms_send_ack_vector) {
  113. newdp->dccps_hc_rx_ackvec =
  114. dccp_ackvec_alloc(GFP_ATOMIC);
  115. if (unlikely(newdp->dccps_hc_rx_ackvec == NULL))
  116. goto out_free;
  117. }
  118. newdp->dccps_hc_rx_ccid =
  119. ccid_hc_rx_new(newdmsk->dccpms_rx_ccid,
  120. newsk, GFP_ATOMIC);
  121. newdp->dccps_hc_tx_ccid =
  122. ccid_hc_tx_new(newdmsk->dccpms_tx_ccid,
  123. newsk, GFP_ATOMIC);
  124. if (unlikely(newdp->dccps_hc_rx_ccid == NULL ||
  125. newdp->dccps_hc_tx_ccid == NULL)) {
  126. dccp_ackvec_free(newdp->dccps_hc_rx_ackvec);
  127. ccid_hc_rx_delete(newdp->dccps_hc_rx_ccid, newsk);
  128. ccid_hc_tx_delete(newdp->dccps_hc_tx_ccid, newsk);
  129. out_free:
  130. /* It is still raw copy of parent, so invalidate
  131. * destructor and make plain sk_free() */
  132. newsk->sk_destruct = NULL;
  133. sk_free(newsk);
  134. return NULL;
  135. }
  136. /*
  137. * Step 3: Process LISTEN state
  138. *
  139. * Choose S.ISS (initial seqno) or set from Init Cookies
  140. * Initialize S.GAR := S.ISS
  141. * Set S.ISR, S.GSR, S.SWL, S.SWH from packet or Init Cookies
  142. */
  143. /* See dccp_v4_conn_request */
  144. newdmsk->dccpms_sequence_window = req->rcv_wnd;
  145. newdp->dccps_gar = newdp->dccps_iss = dreq->dreq_iss;
  146. dccp_update_gss(newsk, dreq->dreq_iss);
  147. newdp->dccps_isr = dreq->dreq_isr;
  148. dccp_update_gsr(newsk, dreq->dreq_isr);
  149. /*
  150. * SWL and AWL are initially adjusted so that they are not less than
  151. * the initial Sequence Numbers received and sent, respectively:
  152. * SWL := max(GSR + 1 - floor(W/4), ISR),
  153. * AWL := max(GSS - W' + 1, ISS).
  154. * These adjustments MUST be applied only at the beginning of the
  155. * connection.
  156. */
  157. dccp_set_seqno(&newdp->dccps_swl,
  158. max48(newdp->dccps_swl, newdp->dccps_isr));
  159. dccp_set_seqno(&newdp->dccps_awl,
  160. max48(newdp->dccps_awl, newdp->dccps_iss));
  161. dccp_init_xmit_timers(newsk);
  162. DCCP_INC_STATS_BH(DCCP_MIB_PASSIVEOPENS);
  163. }
  164. return newsk;
  165. }
  166. EXPORT_SYMBOL_GPL(dccp_create_openreq_child);
  167. /*
  168. * Process an incoming packet for RESPOND sockets represented
  169. * as an request_sock.
  170. */
  171. struct sock *dccp_check_req(struct sock *sk, struct sk_buff *skb,
  172. struct request_sock *req,
  173. struct request_sock **prev)
  174. {
  175. struct sock *child = NULL;
  176. struct dccp_request_sock *dreq = dccp_rsk(req);
  177. /* Check for retransmitted REQUEST */
  178. if (dccp_hdr(skb)->dccph_type == DCCP_PKT_REQUEST) {
  179. if (after48(DCCP_SKB_CB(skb)->dccpd_seq, dreq->dreq_isr)) {
  180. dccp_pr_debug("Retransmitted REQUEST\n");
  181. dreq->dreq_isr = DCCP_SKB_CB(skb)->dccpd_seq;
  182. /*
  183. * Send another RESPONSE packet
  184. * To protect against Request floods, increment retrans
  185. * counter (backoff, monitored by dccp_response_timer).
  186. */
  187. req->retrans++;
  188. req->rsk_ops->rtx_syn_ack(sk, req);
  189. }
  190. /* Network Duplicate, discard packet */
  191. return NULL;
  192. }
  193. DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_PACKET_ERROR;
  194. if (dccp_hdr(skb)->dccph_type != DCCP_PKT_ACK &&
  195. dccp_hdr(skb)->dccph_type != DCCP_PKT_DATAACK)
  196. goto drop;
  197. /* Invalid ACK */
  198. if (DCCP_SKB_CB(skb)->dccpd_ack_seq != dreq->dreq_iss) {
  199. dccp_pr_debug("Invalid ACK number: ack_seq=%llu, "
  200. "dreq_iss=%llu\n",
  201. (unsigned long long)
  202. DCCP_SKB_CB(skb)->dccpd_ack_seq,
  203. (unsigned long long) dreq->dreq_iss);
  204. goto drop;
  205. }
  206. if (dccp_parse_options(sk, dreq, skb))
  207. goto drop;
  208. child = inet_csk(sk)->icsk_af_ops->syn_recv_sock(sk, skb, req, NULL);
  209. if (child == NULL)
  210. goto listen_overflow;
  211. inet_csk_reqsk_queue_unlink(sk, req, prev);
  212. inet_csk_reqsk_queue_removed(sk, req);
  213. inet_csk_reqsk_queue_add(sk, req, child);
  214. out:
  215. return child;
  216. listen_overflow:
  217. dccp_pr_debug("listen_overflow!\n");
  218. DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_TOO_BUSY;
  219. drop:
  220. if (dccp_hdr(skb)->dccph_type != DCCP_PKT_RESET)
  221. req->rsk_ops->send_reset(sk, skb);
  222. inet_csk_reqsk_queue_drop(sk, req, prev);
  223. goto out;
  224. }
  225. EXPORT_SYMBOL_GPL(dccp_check_req);
  226. /*
  227. * Queue segment on the new socket if the new socket is active,
  228. * otherwise we just shortcircuit this and continue with
  229. * the new socket.
  230. */
  231. int dccp_child_process(struct sock *parent, struct sock *child,
  232. struct sk_buff *skb)
  233. {
  234. int ret = 0;
  235. const int state = child->sk_state;
  236. if (!sock_owned_by_user(child)) {
  237. ret = dccp_rcv_state_process(child, skb, dccp_hdr(skb),
  238. skb->len);
  239. /* Wakeup parent, send SIGIO */
  240. if (state == DCCP_RESPOND && child->sk_state != state)
  241. parent->sk_data_ready(parent, 0);
  242. } else {
  243. /* Alas, it is possible again, because we do lookup
  244. * in main socket hash table and lock on listening
  245. * socket does not protect us more.
  246. */
  247. sk_add_backlog(child, skb);
  248. }
  249. bh_unlock_sock(child);
  250. sock_put(child);
  251. return ret;
  252. }
  253. EXPORT_SYMBOL_GPL(dccp_child_process);
  254. void dccp_reqsk_send_ack(struct sock *sk, struct sk_buff *skb,
  255. struct request_sock *rsk)
  256. {
  257. DCCP_BUG("DCCP-ACK packets are never sent in LISTEN/RESPOND state");
  258. }
  259. EXPORT_SYMBOL_GPL(dccp_reqsk_send_ack);
  260. int dccp_reqsk_init(struct request_sock *req,
  261. struct dccp_sock const *dp, struct sk_buff const *skb)
  262. {
  263. struct dccp_request_sock *dreq = dccp_rsk(req);
  264. inet_rsk(req)->rmt_port = dccp_hdr(skb)->dccph_sport;
  265. inet_rsk(req)->acked = 0;
  266. req->rcv_wnd = sysctl_dccp_feat_sequence_window;
  267. dreq->dreq_timestamp_echo = 0;
  268. /* inherit feature negotiation options from listening socket */
  269. return dccp_feat_clone_list(&dp->dccps_featneg, &dreq->dreq_featneg);
  270. }
  271. EXPORT_SYMBOL_GPL(dccp_reqsk_init);