request_sock.c 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /*
  3. * NET Generic infrastructure for Network protocols.
  4. *
  5. * Authors: Arnaldo Carvalho de Melo <acme@conectiva.com.br>
  6. *
  7. * From code originally in include/net/tcp.h
  8. */
  9. #include <linux/module.h>
  10. #include <linux/random.h>
  11. #include <linux/slab.h>
  12. #include <linux/string.h>
  13. #include <linux/tcp.h>
  14. #include <linux/vmalloc.h>
  15. #include <net/request_sock.h>
  16. /*
  17. * Maximum number of SYN_RECV sockets in queue per LISTEN socket.
  18. * One SYN_RECV socket costs about 80bytes on a 32bit machine.
  19. * It would be better to replace it with a global counter for all sockets
  20. * but then some measure against one socket starving all other sockets
  21. * would be needed.
  22. *
  23. * The minimum value of it is 128. Experiments with real servers show that
  24. * it is absolutely not enough even at 100conn/sec. 256 cures most
  25. * of problems.
  26. * This value is adjusted to 128 for low memory machines,
  27. * and it will increase in proportion to the memory of machine.
  28. * Note : Dont forget somaxconn that may limit backlog too.
  29. */
  30. void reqsk_queue_alloc(struct request_sock_queue *queue)
  31. {
  32. queue->fastopenq.rskq_rst_head = NULL;
  33. queue->fastopenq.rskq_rst_tail = NULL;
  34. queue->fastopenq.qlen = 0;
  35. queue->rskq_accept_head = NULL;
  36. }
  37. /*
  38. * This function is called to set a Fast Open socket's "fastopen_rsk" field
  39. * to NULL when a TFO socket no longer needs to access the request_sock.
  40. * This happens only after 3WHS has been either completed or aborted (e.g.,
  41. * RST is received).
  42. *
  43. * Before TFO, a child socket is created only after 3WHS is completed,
  44. * hence it never needs to access the request_sock. things get a lot more
  45. * complex with TFO. A child socket, accepted or not, has to access its
  46. * request_sock for 3WHS processing, e.g., to retransmit SYN-ACK pkts,
  47. * until 3WHS is either completed or aborted. Afterwards the req will stay
  48. * until either the child socket is accepted, or in the rare case when the
  49. * listener is closed before the child is accepted.
  50. *
  51. * In short, a request socket is only freed after BOTH 3WHS has completed
  52. * (or aborted) and the child socket has been accepted (or listener closed).
  53. * When a child socket is accepted, its corresponding req->sk is set to
  54. * NULL since it's no longer needed. More importantly, "req->sk == NULL"
  55. * will be used by the code below to determine if a child socket has been
  56. * accepted or not, and the check is protected by the fastopenq->lock
  57. * described below.
  58. *
  59. * Note that fastopen_rsk is only accessed from the child socket's context
  60. * with its socket lock held. But a request_sock (req) can be accessed by
  61. * both its child socket through fastopen_rsk, and a listener socket through
  62. * icsk_accept_queue.rskq_accept_head. To protect the access a simple spin
  63. * lock per listener "icsk->icsk_accept_queue.fastopenq->lock" is created.
  64. * only in the rare case when both the listener and the child locks are held,
  65. * e.g., in inet_csk_listen_stop() do we not need to acquire the lock.
  66. * The lock also protects other fields such as fastopenq->qlen, which is
  67. * decremented by this function when fastopen_rsk is no longer needed.
  68. *
  69. * Note that another solution was to simply use the existing socket lock
  70. * from the listener. But first socket lock is difficult to use. It is not
  71. * a simple spin lock - one must consider sock_owned_by_user() and arrange
  72. * to use sk_add_backlog() stuff. But what really makes it infeasible is the
  73. * locking hierarchy violation. E.g., inet_csk_listen_stop() may try to
  74. * acquire a child's lock while holding listener's socket lock. A corner
  75. * case might also exist in tcp_v4_hnd_req() that will trigger this locking
  76. * order.
  77. *
  78. * This function also sets "treq->tfo_listener" to false.
  79. * treq->tfo_listener is used by the listener so it is protected by the
  80. * fastopenq->lock in this function.
  81. */
  82. void reqsk_fastopen_remove(struct sock *sk, struct request_sock *req,
  83. bool reset)
  84. {
  85. struct sock *lsk = req->rsk_listener;
  86. struct fastopen_queue *fastopenq;
  87. fastopenq = &inet_csk(lsk)->icsk_accept_queue.fastopenq;
  88. RCU_INIT_POINTER(tcp_sk(sk)->fastopen_rsk, NULL);
  89. spin_lock_bh(&fastopenq->lock);
  90. fastopenq->qlen--;
  91. tcp_rsk(req)->tfo_listener = false;
  92. if (req->sk) /* the child socket hasn't been accepted yet */
  93. goto out;
  94. if (!reset || lsk->sk_state != TCP_LISTEN) {
  95. /* If the listener has been closed don't bother with the
  96. * special RST handling below.
  97. */
  98. spin_unlock_bh(&fastopenq->lock);
  99. reqsk_put(req);
  100. return;
  101. }
  102. /* Wait for 60secs before removing a req that has triggered RST.
  103. * This is a simple defense against TFO spoofing attack - by
  104. * counting the req against fastopen.max_qlen, and disabling
  105. * TFO when the qlen exceeds max_qlen.
  106. *
  107. * For more details see CoNext'11 "TCP Fast Open" paper.
  108. */
  109. req->rsk_timer.expires = jiffies + 60*HZ;
  110. if (fastopenq->rskq_rst_head == NULL)
  111. fastopenq->rskq_rst_head = req;
  112. else
  113. fastopenq->rskq_rst_tail->dl_next = req;
  114. req->dl_next = NULL;
  115. fastopenq->rskq_rst_tail = req;
  116. fastopenq->qlen++;
  117. out:
  118. spin_unlock_bh(&fastopenq->lock);
  119. }