minisocks.c 7.5 KB

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