request_sock.h 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230
  1. /*
  2. * NET Generic infrastructure for Network protocols.
  3. *
  4. * Definitions for request_sock
  5. *
  6. * Authors: Arnaldo Carvalho de Melo <acme@conectiva.com.br>
  7. *
  8. * From code originally in include/net/tcp.h
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public License
  12. * as published by the Free Software Foundation; either version
  13. * 2 of the License, or (at your option) any later version.
  14. */
  15. #ifndef _REQUEST_SOCK_H
  16. #define _REQUEST_SOCK_H
  17. #include <linux/slab.h>
  18. #include <linux/spinlock.h>
  19. #include <linux/types.h>
  20. #include <linux/bug.h>
  21. #include <net/sock.h>
  22. struct request_sock;
  23. struct sk_buff;
  24. struct dst_entry;
  25. struct proto;
  26. struct request_sock_ops {
  27. int family;
  28. int obj_size;
  29. struct kmem_cache *slab;
  30. char *slab_name;
  31. int (*rtx_syn_ack)(const struct sock *sk,
  32. struct request_sock *req);
  33. void (*send_ack)(const struct sock *sk, struct sk_buff *skb,
  34. struct request_sock *req);
  35. void (*send_reset)(const struct sock *sk,
  36. struct sk_buff *skb);
  37. void (*destructor)(struct request_sock *req);
  38. void (*syn_ack_timeout)(const struct request_sock *req);
  39. };
  40. int inet_rtx_syn_ack(const struct sock *parent, struct request_sock *req);
  41. /* struct request_sock - mini sock to represent a connection request
  42. */
  43. struct request_sock {
  44. struct sock_common __req_common;
  45. #define rsk_refcnt __req_common.skc_refcnt
  46. #define rsk_hash __req_common.skc_hash
  47. #define rsk_listener __req_common.skc_listener
  48. #define rsk_window_clamp __req_common.skc_window_clamp
  49. #define rsk_rcv_wnd __req_common.skc_rcv_wnd
  50. struct request_sock *dl_next;
  51. u16 mss;
  52. u8 num_retrans; /* number of retransmits */
  53. u8 cookie_ts:1; /* syncookie: encode tcpopts in timestamp */
  54. u8 num_timeout:7; /* number of timeouts */
  55. u32 ts_recent;
  56. struct timer_list rsk_timer;
  57. const struct request_sock_ops *rsk_ops;
  58. struct sock *sk;
  59. u32 *saved_syn;
  60. u32 secid;
  61. u32 peer_secid;
  62. };
  63. static inline struct request_sock *inet_reqsk(const struct sock *sk)
  64. {
  65. return (struct request_sock *)sk;
  66. }
  67. static inline struct sock *req_to_sk(struct request_sock *req)
  68. {
  69. return (struct sock *)req;
  70. }
  71. static inline struct request_sock *
  72. reqsk_alloc(const struct request_sock_ops *ops, struct sock *sk_listener,
  73. bool attach_listener)
  74. {
  75. struct request_sock *req;
  76. req = kmem_cache_alloc(ops->slab, GFP_ATOMIC | __GFP_NOWARN);
  77. if (!req)
  78. return NULL;
  79. req->rsk_listener = NULL;
  80. if (attach_listener) {
  81. if (unlikely(!atomic_inc_not_zero(&sk_listener->sk_refcnt))) {
  82. kmem_cache_free(ops->slab, req);
  83. return NULL;
  84. }
  85. req->rsk_listener = sk_listener;
  86. }
  87. req->rsk_ops = ops;
  88. req_to_sk(req)->sk_prot = sk_listener->sk_prot;
  89. sk_node_init(&req_to_sk(req)->sk_node);
  90. sk_tx_queue_clear(req_to_sk(req));
  91. req->saved_syn = NULL;
  92. atomic_set(&req->rsk_refcnt, 0);
  93. return req;
  94. }
  95. static inline void reqsk_free(struct request_sock *req)
  96. {
  97. /* temporary debugging */
  98. WARN_ON_ONCE(atomic_read(&req->rsk_refcnt) != 0);
  99. req->rsk_ops->destructor(req);
  100. if (req->rsk_listener)
  101. sock_put(req->rsk_listener);
  102. kfree(req->saved_syn);
  103. kmem_cache_free(req->rsk_ops->slab, req);
  104. }
  105. static inline void reqsk_put(struct request_sock *req)
  106. {
  107. if (atomic_dec_and_test(&req->rsk_refcnt))
  108. reqsk_free(req);
  109. }
  110. extern int sysctl_max_syn_backlog;
  111. /*
  112. * For a TCP Fast Open listener -
  113. * lock - protects the access to all the reqsk, which is co-owned by
  114. * the listener and the child socket.
  115. * qlen - pending TFO requests (still in TCP_SYN_RECV).
  116. * max_qlen - max TFO reqs allowed before TFO is disabled.
  117. *
  118. * XXX (TFO) - ideally these fields can be made as part of "listen_sock"
  119. * structure above. But there is some implementation difficulty due to
  120. * listen_sock being part of request_sock_queue hence will be freed when
  121. * a listener is stopped. But TFO related fields may continue to be
  122. * accessed even after a listener is closed, until its sk_refcnt drops
  123. * to 0 implying no more outstanding TFO reqs. One solution is to keep
  124. * listen_opt around until sk_refcnt drops to 0. But there is some other
  125. * complexity that needs to be resolved. E.g., a listener can be disabled
  126. * temporarily through shutdown()->tcp_disconnect(), and re-enabled later.
  127. */
  128. struct fastopen_queue {
  129. struct request_sock *rskq_rst_head; /* Keep track of past TFO */
  130. struct request_sock *rskq_rst_tail; /* requests that caused RST.
  131. * This is part of the defense
  132. * against spoofing attack.
  133. */
  134. spinlock_t lock;
  135. int qlen; /* # of pending (TCP_SYN_RECV) reqs */
  136. int max_qlen; /* != 0 iff TFO is currently enabled */
  137. };
  138. /** struct request_sock_queue - queue of request_socks
  139. *
  140. * @rskq_accept_head - FIFO head of established children
  141. * @rskq_accept_tail - FIFO tail of established children
  142. * @rskq_defer_accept - User waits for some data after accept()
  143. *
  144. */
  145. struct request_sock_queue {
  146. spinlock_t rskq_lock;
  147. u8 rskq_defer_accept;
  148. u32 synflood_warned;
  149. atomic_t qlen;
  150. atomic_t young;
  151. struct request_sock *rskq_accept_head;
  152. struct request_sock *rskq_accept_tail;
  153. struct fastopen_queue fastopenq; /* Check max_qlen != 0 to determine
  154. * if TFO is enabled.
  155. */
  156. };
  157. void reqsk_queue_alloc(struct request_sock_queue *queue);
  158. void reqsk_fastopen_remove(struct sock *sk, struct request_sock *req,
  159. bool reset);
  160. static inline bool reqsk_queue_empty(const struct request_sock_queue *queue)
  161. {
  162. return queue->rskq_accept_head == NULL;
  163. }
  164. static inline struct request_sock *reqsk_queue_remove(struct request_sock_queue *queue,
  165. struct sock *parent)
  166. {
  167. struct request_sock *req;
  168. spin_lock_bh(&queue->rskq_lock);
  169. req = queue->rskq_accept_head;
  170. if (req) {
  171. sk_acceptq_removed(parent);
  172. queue->rskq_accept_head = req->dl_next;
  173. if (queue->rskq_accept_head == NULL)
  174. queue->rskq_accept_tail = NULL;
  175. }
  176. spin_unlock_bh(&queue->rskq_lock);
  177. return req;
  178. }
  179. static inline void reqsk_queue_removed(struct request_sock_queue *queue,
  180. const struct request_sock *req)
  181. {
  182. if (req->num_timeout == 0)
  183. atomic_dec(&queue->young);
  184. atomic_dec(&queue->qlen);
  185. }
  186. static inline void reqsk_queue_added(struct request_sock_queue *queue)
  187. {
  188. atomic_inc(&queue->young);
  189. atomic_inc(&queue->qlen);
  190. }
  191. static inline int reqsk_queue_len(const struct request_sock_queue *queue)
  192. {
  193. return atomic_read(&queue->qlen);
  194. }
  195. static inline int reqsk_queue_len_young(const struct request_sock_queue *queue)
  196. {
  197. return atomic_read(&queue->young);
  198. }
  199. #endif /* _REQUEST_SOCK_H */