minisocks.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289
  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_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. DCCP_WARN("time wait bucket table overflow\n");
  74. }
  75. dccp_done(sk);
  76. }
  77. struct sock *dccp_create_openreq_child(struct sock *sk,
  78. const struct request_sock *req,
  79. const struct sk_buff *skb)
  80. {
  81. /*
  82. * Step 3: Process LISTEN state
  83. *
  84. * (* Generate a new socket and switch to that socket *)
  85. * Set S := new socket for this port pair
  86. */
  87. struct sock *newsk = inet_csk_clone(sk, req, GFP_ATOMIC);
  88. if (newsk != NULL) {
  89. struct dccp_request_sock *dreq = dccp_rsk(req);
  90. struct inet_connection_sock *newicsk = inet_csk(newsk);
  91. struct dccp_sock *newdp = dccp_sk(newsk);
  92. newdp->dccps_role = DCCP_ROLE_SERVER;
  93. newdp->dccps_hc_rx_ackvec = NULL;
  94. newdp->dccps_service_list = NULL;
  95. newdp->dccps_service = dreq->dreq_service;
  96. newdp->dccps_timestamp_echo = dreq->dreq_timestamp_echo;
  97. newdp->dccps_timestamp_time = dreq->dreq_timestamp_time;
  98. newicsk->icsk_rto = DCCP_TIMEOUT_INIT;
  99. INIT_LIST_HEAD(&newdp->dccps_featneg);
  100. /*
  101. * Step 3: Process LISTEN state
  102. *
  103. * Choose S.ISS (initial seqno) or set from Init Cookies
  104. * Initialize S.GAR := S.ISS
  105. * Set S.ISR, S.GSR, S.SWL, S.SWH from packet or Init Cookies
  106. */
  107. newdp->dccps_gar = newdp->dccps_iss = dreq->dreq_iss;
  108. dccp_update_gss(newsk, dreq->dreq_iss);
  109. newdp->dccps_isr = dreq->dreq_isr;
  110. dccp_update_gsr(newsk, dreq->dreq_isr);
  111. /*
  112. * SWL and AWL are initially adjusted so that they are not less than
  113. * the initial Sequence Numbers received and sent, respectively:
  114. * SWL := max(GSR + 1 - floor(W/4), ISR),
  115. * AWL := max(GSS - W' + 1, ISS).
  116. * These adjustments MUST be applied only at the beginning of the
  117. * connection.
  118. */
  119. dccp_set_seqno(&newdp->dccps_swl,
  120. max48(newdp->dccps_swl, newdp->dccps_isr));
  121. dccp_set_seqno(&newdp->dccps_awl,
  122. max48(newdp->dccps_awl, newdp->dccps_iss));
  123. /*
  124. * Activate features after initialising the sequence numbers,
  125. * since CCID initialisation may depend on GSS, ISR, ISS etc.
  126. */
  127. if (dccp_feat_activate_values(newsk, &dreq->dreq_featneg)) {
  128. /* It is still raw copy of parent, so invalidate
  129. * destructor and make plain sk_free() */
  130. newsk->sk_destruct = NULL;
  131. sk_free(newsk);
  132. return NULL;
  133. }
  134. dccp_init_xmit_timers(newsk);
  135. DCCP_INC_STATS_BH(DCCP_MIB_PASSIVEOPENS);
  136. }
  137. return newsk;
  138. }
  139. EXPORT_SYMBOL_GPL(dccp_create_openreq_child);
  140. /*
  141. * Process an incoming packet for RESPOND sockets represented
  142. * as an request_sock.
  143. */
  144. struct sock *dccp_check_req(struct sock *sk, struct sk_buff *skb,
  145. struct request_sock *req,
  146. struct request_sock **prev)
  147. {
  148. struct sock *child = NULL;
  149. struct dccp_request_sock *dreq = dccp_rsk(req);
  150. /* Check for retransmitted REQUEST */
  151. if (dccp_hdr(skb)->dccph_type == DCCP_PKT_REQUEST) {
  152. if (after48(DCCP_SKB_CB(skb)->dccpd_seq, dreq->dreq_isr)) {
  153. dccp_pr_debug("Retransmitted REQUEST\n");
  154. dreq->dreq_isr = DCCP_SKB_CB(skb)->dccpd_seq;
  155. /*
  156. * Send another RESPONSE packet
  157. * To protect against Request floods, increment retrans
  158. * counter (backoff, monitored by dccp_response_timer).
  159. */
  160. req->retrans++;
  161. req->rsk_ops->rtx_syn_ack(sk, req);
  162. }
  163. /* Network Duplicate, discard packet */
  164. return NULL;
  165. }
  166. DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_PACKET_ERROR;
  167. if (dccp_hdr(skb)->dccph_type != DCCP_PKT_ACK &&
  168. dccp_hdr(skb)->dccph_type != DCCP_PKT_DATAACK)
  169. goto drop;
  170. /* Invalid ACK */
  171. if (DCCP_SKB_CB(skb)->dccpd_ack_seq != dreq->dreq_iss) {
  172. dccp_pr_debug("Invalid ACK number: ack_seq=%llu, "
  173. "dreq_iss=%llu\n",
  174. (unsigned long long)
  175. DCCP_SKB_CB(skb)->dccpd_ack_seq,
  176. (unsigned long long) dreq->dreq_iss);
  177. goto drop;
  178. }
  179. if (dccp_parse_options(sk, dreq, skb))
  180. goto drop;
  181. child = inet_csk(sk)->icsk_af_ops->syn_recv_sock(sk, skb, req, NULL);
  182. if (child == NULL)
  183. goto listen_overflow;
  184. inet_csk_reqsk_queue_unlink(sk, req, prev);
  185. inet_csk_reqsk_queue_removed(sk, req);
  186. inet_csk_reqsk_queue_add(sk, req, child);
  187. out:
  188. return child;
  189. listen_overflow:
  190. dccp_pr_debug("listen_overflow!\n");
  191. DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_TOO_BUSY;
  192. drop:
  193. if (dccp_hdr(skb)->dccph_type != DCCP_PKT_RESET)
  194. req->rsk_ops->send_reset(sk, skb);
  195. inet_csk_reqsk_queue_drop(sk, req, prev);
  196. goto out;
  197. }
  198. EXPORT_SYMBOL_GPL(dccp_check_req);
  199. /*
  200. * Queue segment on the new socket if the new socket is active,
  201. * otherwise we just shortcircuit this and continue with
  202. * the new socket.
  203. */
  204. int dccp_child_process(struct sock *parent, struct sock *child,
  205. struct sk_buff *skb)
  206. {
  207. int ret = 0;
  208. const int state = child->sk_state;
  209. if (!sock_owned_by_user(child)) {
  210. ret = dccp_rcv_state_process(child, skb, dccp_hdr(skb),
  211. skb->len);
  212. /* Wakeup parent, send SIGIO */
  213. if (state == DCCP_RESPOND && child->sk_state != state)
  214. parent->sk_data_ready(parent, 0);
  215. } else {
  216. /* Alas, it is possible again, because we do lookup
  217. * in main socket hash table and lock on listening
  218. * socket does not protect us more.
  219. */
  220. sk_add_backlog(child, skb);
  221. }
  222. bh_unlock_sock(child);
  223. sock_put(child);
  224. return ret;
  225. }
  226. EXPORT_SYMBOL_GPL(dccp_child_process);
  227. void dccp_reqsk_send_ack(struct sock *sk, struct sk_buff *skb,
  228. struct request_sock *rsk)
  229. {
  230. DCCP_BUG("DCCP-ACK packets are never sent in LISTEN/RESPOND state");
  231. }
  232. EXPORT_SYMBOL_GPL(dccp_reqsk_send_ack);
  233. int dccp_reqsk_init(struct request_sock *req,
  234. struct dccp_sock const *dp, struct sk_buff const *skb)
  235. {
  236. struct dccp_request_sock *dreq = dccp_rsk(req);
  237. inet_rsk(req)->rmt_port = dccp_hdr(skb)->dccph_sport;
  238. inet_rsk(req)->loc_port = dccp_hdr(skb)->dccph_dport;
  239. inet_rsk(req)->acked = 0;
  240. dreq->dreq_timestamp_echo = 0;
  241. /* inherit feature negotiation options from listening socket */
  242. return dccp_feat_clone_list(&dp->dccps_featneg, &dreq->dreq_featneg);
  243. }
  244. EXPORT_SYMBOL_GPL(dccp_reqsk_init);