request_sock.c 5.3 KB

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