|
5 | 5 | #include <net/tcp.h> |
6 | 6 | #include <net/busy_poll.h> |
7 | 7 |
|
| 8 | +/* |
| 9 | + * This function is called to set a Fast Open socket's "fastopen_rsk" field |
| 10 | + * to NULL when a TFO socket no longer needs to access the request_sock. |
| 11 | + * This happens only after 3WHS has been either completed or aborted (e.g., |
| 12 | + * RST is received). |
| 13 | + * |
| 14 | + * Before TFO, a child socket is created only after 3WHS is completed, |
| 15 | + * hence it never needs to access the request_sock. things get a lot more |
| 16 | + * complex with TFO. A child socket, accepted or not, has to access its |
| 17 | + * request_sock for 3WHS processing, e.g., to retransmit SYN-ACK pkts, |
| 18 | + * until 3WHS is either completed or aborted. Afterwards the req will stay |
| 19 | + * until either the child socket is accepted, or in the rare case when the |
| 20 | + * listener is closed before the child is accepted. |
| 21 | + * |
| 22 | + * In short, a request socket is only freed after BOTH 3WHS has completed |
| 23 | + * (or aborted) and the child socket has been accepted (or listener closed). |
| 24 | + * When a child socket is accepted, its corresponding req->sk is set to |
| 25 | + * NULL since it's no longer needed. More importantly, "req->sk == NULL" |
| 26 | + * will be used by the code below to determine if a child socket has been |
| 27 | + * accepted or not, and the check is protected by the fastopenq->lock |
| 28 | + * described below. |
| 29 | + * |
| 30 | + * Note that fastopen_rsk is only accessed from the child socket's context |
| 31 | + * with its socket lock held. But a request_sock (req) can be accessed by |
| 32 | + * both its child socket through fastopen_rsk, and a listener socket through |
| 33 | + * icsk_accept_queue.rskq_accept_head. To protect the access a simple spin |
| 34 | + * lock per listener "icsk->icsk_accept_queue.fastopenq->lock" is created. |
| 35 | + * only in the rare case when both the listener and the child locks are held, |
| 36 | + * e.g., in inet_csk_listen_stop() do we not need to acquire the lock. |
| 37 | + * The lock also protects other fields such as fastopenq->qlen, which is |
| 38 | + * decremented by this function when fastopen_rsk is no longer needed. |
| 39 | + * |
| 40 | + * Note that another solution was to simply use the existing socket lock |
| 41 | + * from the listener. But first socket lock is difficult to use. It is not |
| 42 | + * a simple spin lock - one must consider sock_owned_by_user() and arrange |
| 43 | + * to use sk_add_backlog() stuff. But what really makes it infeasible is the |
| 44 | + * locking hierarchy violation. E.g., inet_csk_listen_stop() may try to |
| 45 | + * acquire a child's lock while holding listener's socket lock. |
| 46 | + * |
| 47 | + * This function also sets "treq->tfo_listener" to false. |
| 48 | + * treq->tfo_listener is used by the listener so it is protected by the |
| 49 | + * fastopenq->lock in this function. |
| 50 | + */ |
| 51 | +void reqsk_fastopen_remove(struct sock *sk, struct request_sock *req, |
| 52 | + bool reset) |
| 53 | +{ |
| 54 | + struct sock *lsk = req->rsk_listener; |
| 55 | + struct fastopen_queue *fastopenq; |
| 56 | + |
| 57 | + fastopenq = &inet_csk(lsk)->icsk_accept_queue.fastopenq; |
| 58 | + |
| 59 | + RCU_INIT_POINTER(tcp_sk(sk)->fastopen_rsk, NULL); |
| 60 | + spin_lock_bh(&fastopenq->lock); |
| 61 | + fastopenq->qlen--; |
| 62 | + tcp_rsk(req)->tfo_listener = false; |
| 63 | + if (req->sk) /* the child socket hasn't been accepted yet */ |
| 64 | + goto out; |
| 65 | + |
| 66 | + if (!reset || lsk->sk_state != TCP_LISTEN) { |
| 67 | + /* If the listener has been closed don't bother with the |
| 68 | + * special RST handling below. |
| 69 | + */ |
| 70 | + spin_unlock_bh(&fastopenq->lock); |
| 71 | + reqsk_put(req); |
| 72 | + return; |
| 73 | + } |
| 74 | + /* Wait for 60secs before removing a req that has triggered RST. |
| 75 | + * This is a simple defense against TFO spoofing attack - by |
| 76 | + * counting the req against fastopen.max_qlen, and disabling |
| 77 | + * TFO when the qlen exceeds max_qlen. |
| 78 | + * |
| 79 | + * For more details see CoNext'11 "TCP Fast Open" paper. |
| 80 | + */ |
| 81 | + req->rsk_timer.expires = jiffies + 60*HZ; |
| 82 | + if (fastopenq->rskq_rst_head == NULL) |
| 83 | + fastopenq->rskq_rst_head = req; |
| 84 | + else |
| 85 | + fastopenq->rskq_rst_tail->dl_next = req; |
| 86 | + |
| 87 | + req->dl_next = NULL; |
| 88 | + fastopenq->rskq_rst_tail = req; |
| 89 | + fastopenq->qlen++; |
| 90 | +out: |
| 91 | + spin_unlock_bh(&fastopenq->lock); |
| 92 | +} |
| 93 | + |
8 | 94 | void tcp_fastopen_init_key_once(struct net *net) |
9 | 95 | { |
10 | 96 | u8 key[TCP_FASTOPEN_KEY_LENGTH]; |
|
0 commit comments