minisocks.c 7.9 KB

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