Loading...
1// SPDX-License-Identifier: GPL-2.0
2#include <linux/tcp.h>
3#include <net/tcp.h>
4
5static u32 tcp_rack_reo_wnd(const struct sock *sk)
6{
7 const struct tcp_sock *tp = tcp_sk(sk);
8
9 if (!tp->reord_seen) {
10 /* If reordering has not been observed, be aggressive during
11 * the recovery or starting the recovery by DUPACK threshold.
12 */
13 if (inet_csk(sk)->icsk_ca_state >= TCP_CA_Recovery)
14 return 0;
15
16 if (tp->sacked_out >= tp->reordering &&
17 !(READ_ONCE(sock_net(sk)->ipv4.sysctl_tcp_recovery) &
18 TCP_RACK_NO_DUPTHRESH))
19 return 0;
20 }
21
22 /* To be more reordering resilient, allow min_rtt/4 settling delay.
23 * Use min_rtt instead of the smoothed RTT because reordering is
24 * often a path property and less related to queuing or delayed ACKs.
25 * Upon receiving DSACKs, linearly increase the window up to the
26 * smoothed RTT.
27 */
28 return min((tcp_min_rtt(tp) >> 2) * tp->rack.reo_wnd_steps,
29 tp->srtt_us >> 3);
30}
31
32s32 tcp_rack_skb_timeout(struct tcp_sock *tp, struct sk_buff *skb, u32 reo_wnd)
33{
34 return tp->rack.rtt_us + reo_wnd -
35 tcp_stamp_us_delta(tp->tcp_mstamp, tcp_skb_timestamp_us(skb));
36}
37
38/* RACK loss detection (IETF draft draft-ietf-tcpm-rack-01):
39 *
40 * Marks a packet lost, if some packet sent later has been (s)acked.
41 * The underlying idea is similar to the traditional dupthresh and FACK
42 * but they look at different metrics:
43 *
44 * dupthresh: 3 OOO packets delivered (packet count)
45 * FACK: sequence delta to highest sacked sequence (sequence space)
46 * RACK: sent time delta to the latest delivered packet (time domain)
47 *
48 * The advantage of RACK is it applies to both original and retransmitted
49 * packet and therefore is robust against tail losses. Another advantage
50 * is being more resilient to reordering by simply allowing some
51 * "settling delay", instead of tweaking the dupthresh.
52 *
53 * When tcp_rack_detect_loss() detects some packets are lost and we
54 * are not already in the CA_Recovery state, either tcp_rack_reo_timeout()
55 * or tcp_time_to_recover()'s "Trick#1: the loss is proven" code path will
56 * make us enter the CA_Recovery state.
57 */
58static void tcp_rack_detect_loss(struct sock *sk, u32 *reo_timeout)
59{
60 struct tcp_sock *tp = tcp_sk(sk);
61 struct sk_buff *skb, *n;
62 u32 reo_wnd;
63
64 *reo_timeout = 0;
65 reo_wnd = tcp_rack_reo_wnd(sk);
66 list_for_each_entry_safe(skb, n, &tp->tsorted_sent_queue,
67 tcp_tsorted_anchor) {
68 struct tcp_skb_cb *scb = TCP_SKB_CB(skb);
69 s32 remaining;
70
71 /* Skip ones marked lost but not yet retransmitted */
72 if ((scb->sacked & TCPCB_LOST) &&
73 !(scb->sacked & TCPCB_SACKED_RETRANS))
74 continue;
75
76 if (!tcp_skb_sent_after(tp->rack.mstamp,
77 tcp_skb_timestamp_us(skb),
78 tp->rack.end_seq, scb->end_seq))
79 break;
80
81 /* A packet is lost if it has not been s/acked beyond
82 * the recent RTT plus the reordering window.
83 */
84 remaining = tcp_rack_skb_timeout(tp, skb, reo_wnd);
85 if (remaining <= 0) {
86 tcp_mark_skb_lost(sk, skb);
87 list_del_init(&skb->tcp_tsorted_anchor);
88 } else {
89 /* Record maximum wait time */
90 *reo_timeout = max_t(u32, *reo_timeout, remaining);
91 }
92 }
93}
94
95bool tcp_rack_mark_lost(struct sock *sk)
96{
97 struct tcp_sock *tp = tcp_sk(sk);
98 u32 timeout;
99
100 if (!tp->rack.advanced)
101 return false;
102
103 /* Reset the advanced flag to avoid unnecessary queue scanning */
104 tp->rack.advanced = 0;
105 tcp_rack_detect_loss(sk, &timeout);
106 if (timeout) {
107 timeout = usecs_to_jiffies(timeout + TCP_TIMEOUT_MIN_US);
108 inet_csk_reset_xmit_timer(sk, ICSK_TIME_REO_TIMEOUT,
109 timeout, inet_csk(sk)->icsk_rto);
110 }
111 return !!timeout;
112}
113
114/* Record the most recently (re)sent time among the (s)acked packets
115 * This is "Step 3: Advance RACK.xmit_time and update RACK.RTT" from
116 * draft-cheng-tcpm-rack-00.txt
117 */
118void tcp_rack_advance(struct tcp_sock *tp, u8 sacked, u32 end_seq,
119 u64 xmit_time)
120{
121 u32 rtt_us;
122
123 rtt_us = tcp_stamp_us_delta(tp->tcp_mstamp, xmit_time);
124 if (rtt_us < tcp_min_rtt(tp) && (sacked & TCPCB_RETRANS)) {
125 /* If the sacked packet was retransmitted, it's ambiguous
126 * whether the retransmission or the original (or the prior
127 * retransmission) was sacked.
128 *
129 * If the original is lost, there is no ambiguity. Otherwise
130 * we assume the original can be delayed up to aRTT + min_rtt.
131 * the aRTT term is bounded by the fast recovery or timeout,
132 * so it's at least one RTT (i.e., retransmission is at least
133 * an RTT later).
134 */
135 return;
136 }
137 tp->rack.advanced = 1;
138 tp->rack.rtt_us = rtt_us;
139 if (tcp_skb_sent_after(xmit_time, tp->rack.mstamp,
140 end_seq, tp->rack.end_seq)) {
141 tp->rack.mstamp = xmit_time;
142 tp->rack.end_seq = end_seq;
143 }
144}
145
146/* We have waited long enough to accommodate reordering. Mark the expired
147 * packets lost and retransmit them.
148 */
149void tcp_rack_reo_timeout(struct sock *sk)
150{
151 struct tcp_sock *tp = tcp_sk(sk);
152 u32 timeout, prior_inflight;
153 u32 lost = tp->lost;
154
155 prior_inflight = tcp_packets_in_flight(tp);
156 tcp_rack_detect_loss(sk, &timeout);
157 if (prior_inflight != tcp_packets_in_flight(tp)) {
158 if (inet_csk(sk)->icsk_ca_state != TCP_CA_Recovery) {
159 tcp_enter_recovery(sk, false);
160 if (!inet_csk(sk)->icsk_ca_ops->cong_control)
161 tcp_cwnd_reduction(sk, 1, tp->lost - lost, 0);
162 }
163 tcp_xmit_retransmit_queue(sk);
164 }
165 if (inet_csk(sk)->icsk_pending != ICSK_TIME_RETRANS)
166 tcp_rearm_rto(sk);
167}
168
169/* Updates the RACK's reo_wnd based on DSACK and no. of recoveries.
170 *
171 * If a DSACK is received that seems like it may have been due to reordering
172 * triggering fast recovery, increment reo_wnd by min_rtt/4 (upper bounded
173 * by srtt), since there is possibility that spurious retransmission was
174 * due to reordering delay longer than reo_wnd.
175 *
176 * Persist the current reo_wnd value for TCP_RACK_RECOVERY_THRESH (16)
177 * no. of successful recoveries (accounts for full DSACK-based loss
178 * recovery undo). After that, reset it to default (min_rtt/4).
179 *
180 * At max, reo_wnd is incremented only once per rtt. So that the new
181 * DSACK on which we are reacting, is due to the spurious retx (approx)
182 * after the reo_wnd has been updated last time.
183 *
184 * reo_wnd is tracked in terms of steps (of min_rtt/4), rather than
185 * absolute value to account for change in rtt.
186 */
187void tcp_rack_update_reo_wnd(struct sock *sk, struct rate_sample *rs)
188{
189 struct tcp_sock *tp = tcp_sk(sk);
190
191 if ((READ_ONCE(sock_net(sk)->ipv4.sysctl_tcp_recovery) &
192 TCP_RACK_STATIC_REO_WND) ||
193 !rs->prior_delivered)
194 return;
195
196 /* Disregard DSACK if a rtt has not passed since we adjusted reo_wnd */
197 if (before(rs->prior_delivered, tp->rack.last_delivered))
198 tp->rack.dsack_seen = 0;
199
200 /* Adjust the reo_wnd if update is pending */
201 if (tp->rack.dsack_seen) {
202 tp->rack.reo_wnd_steps = min_t(u32, 0xFF,
203 tp->rack.reo_wnd_steps + 1);
204 tp->rack.dsack_seen = 0;
205 tp->rack.last_delivered = tp->delivered;
206 tp->rack.reo_wnd_persist = TCP_RACK_RECOVERY_THRESH;
207 } else if (!tp->rack.reo_wnd_persist) {
208 tp->rack.reo_wnd_steps = 1;
209 }
210}
211
212/* RFC6582 NewReno recovery for non-SACK connection. It simply retransmits
213 * the next unacked packet upon receiving
214 * a) three or more DUPACKs to start the fast recovery
215 * b) an ACK acknowledging new data during the fast recovery.
216 */
217void tcp_newreno_mark_lost(struct sock *sk, bool snd_una_advanced)
218{
219 const u8 state = inet_csk(sk)->icsk_ca_state;
220 struct tcp_sock *tp = tcp_sk(sk);
221
222 if ((state < TCP_CA_Recovery && tp->sacked_out >= tp->reordering) ||
223 (state == TCP_CA_Recovery && snd_una_advanced)) {
224 struct sk_buff *skb = tcp_rtx_queue_head(sk);
225 u32 mss;
226
227 if (TCP_SKB_CB(skb)->sacked & TCPCB_LOST)
228 return;
229
230 mss = tcp_skb_mss(skb);
231 if (tcp_skb_pcount(skb) > 1 && skb->len > mss)
232 tcp_fragment(sk, TCP_FRAG_IN_RTX_QUEUE, skb,
233 mss, mss, GFP_ATOMIC);
234
235 tcp_mark_skb_lost(sk, skb);
236 }
237}
1// SPDX-License-Identifier: GPL-2.0
2#include <linux/tcp.h>
3#include <net/tcp.h>
4
5void tcp_mark_skb_lost(struct sock *sk, struct sk_buff *skb)
6{
7 struct tcp_sock *tp = tcp_sk(sk);
8
9 tcp_skb_mark_lost_uncond_verify(tp, skb);
10 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) {
11 /* Account for retransmits that are lost again */
12 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
13 tp->retrans_out -= tcp_skb_pcount(skb);
14 NET_ADD_STATS(sock_net(sk), LINUX_MIB_TCPLOSTRETRANSMIT,
15 tcp_skb_pcount(skb));
16 }
17}
18
19static bool tcp_rack_sent_after(u64 t1, u64 t2, u32 seq1, u32 seq2)
20{
21 return t1 > t2 || (t1 == t2 && after(seq1, seq2));
22}
23
24static u32 tcp_rack_reo_wnd(const struct sock *sk)
25{
26 struct tcp_sock *tp = tcp_sk(sk);
27
28 if (!tp->reord_seen) {
29 /* If reordering has not been observed, be aggressive during
30 * the recovery or starting the recovery by DUPACK threshold.
31 */
32 if (inet_csk(sk)->icsk_ca_state >= TCP_CA_Recovery)
33 return 0;
34
35 if (tp->sacked_out >= tp->reordering &&
36 !(sock_net(sk)->ipv4.sysctl_tcp_recovery & TCP_RACK_NO_DUPTHRESH))
37 return 0;
38 }
39
40 /* To be more reordering resilient, allow min_rtt/4 settling delay.
41 * Use min_rtt instead of the smoothed RTT because reordering is
42 * often a path property and less related to queuing or delayed ACKs.
43 * Upon receiving DSACKs, linearly increase the window up to the
44 * smoothed RTT.
45 */
46 return min((tcp_min_rtt(tp) >> 2) * tp->rack.reo_wnd_steps,
47 tp->srtt_us >> 3);
48}
49
50s32 tcp_rack_skb_timeout(struct tcp_sock *tp, struct sk_buff *skb, u32 reo_wnd)
51{
52 return tp->rack.rtt_us + reo_wnd -
53 tcp_stamp_us_delta(tp->tcp_mstamp, tcp_skb_timestamp_us(skb));
54}
55
56/* RACK loss detection (IETF draft draft-ietf-tcpm-rack-01):
57 *
58 * Marks a packet lost, if some packet sent later has been (s)acked.
59 * The underlying idea is similar to the traditional dupthresh and FACK
60 * but they look at different metrics:
61 *
62 * dupthresh: 3 OOO packets delivered (packet count)
63 * FACK: sequence delta to highest sacked sequence (sequence space)
64 * RACK: sent time delta to the latest delivered packet (time domain)
65 *
66 * The advantage of RACK is it applies to both original and retransmitted
67 * packet and therefore is robust against tail losses. Another advantage
68 * is being more resilient to reordering by simply allowing some
69 * "settling delay", instead of tweaking the dupthresh.
70 *
71 * When tcp_rack_detect_loss() detects some packets are lost and we
72 * are not already in the CA_Recovery state, either tcp_rack_reo_timeout()
73 * or tcp_time_to_recover()'s "Trick#1: the loss is proven" code path will
74 * make us enter the CA_Recovery state.
75 */
76static void tcp_rack_detect_loss(struct sock *sk, u32 *reo_timeout)
77{
78 struct tcp_sock *tp = tcp_sk(sk);
79 struct sk_buff *skb, *n;
80 u32 reo_wnd;
81
82 *reo_timeout = 0;
83 reo_wnd = tcp_rack_reo_wnd(sk);
84 list_for_each_entry_safe(skb, n, &tp->tsorted_sent_queue,
85 tcp_tsorted_anchor) {
86 struct tcp_skb_cb *scb = TCP_SKB_CB(skb);
87 s32 remaining;
88
89 /* Skip ones marked lost but not yet retransmitted */
90 if ((scb->sacked & TCPCB_LOST) &&
91 !(scb->sacked & TCPCB_SACKED_RETRANS))
92 continue;
93
94 if (!tcp_rack_sent_after(tp->rack.mstamp,
95 tcp_skb_timestamp_us(skb),
96 tp->rack.end_seq, scb->end_seq))
97 break;
98
99 /* A packet is lost if it has not been s/acked beyond
100 * the recent RTT plus the reordering window.
101 */
102 remaining = tcp_rack_skb_timeout(tp, skb, reo_wnd);
103 if (remaining <= 0) {
104 tcp_mark_skb_lost(sk, skb);
105 list_del_init(&skb->tcp_tsorted_anchor);
106 } else {
107 /* Record maximum wait time */
108 *reo_timeout = max_t(u32, *reo_timeout, remaining);
109 }
110 }
111}
112
113void tcp_rack_mark_lost(struct sock *sk)
114{
115 struct tcp_sock *tp = tcp_sk(sk);
116 u32 timeout;
117
118 if (!tp->rack.advanced)
119 return;
120
121 /* Reset the advanced flag to avoid unnecessary queue scanning */
122 tp->rack.advanced = 0;
123 tcp_rack_detect_loss(sk, &timeout);
124 if (timeout) {
125 timeout = usecs_to_jiffies(timeout) + TCP_TIMEOUT_MIN;
126 inet_csk_reset_xmit_timer(sk, ICSK_TIME_REO_TIMEOUT,
127 timeout, inet_csk(sk)->icsk_rto);
128 }
129}
130
131/* Record the most recently (re)sent time among the (s)acked packets
132 * This is "Step 3: Advance RACK.xmit_time and update RACK.RTT" from
133 * draft-cheng-tcpm-rack-00.txt
134 */
135void tcp_rack_advance(struct tcp_sock *tp, u8 sacked, u32 end_seq,
136 u64 xmit_time)
137{
138 u32 rtt_us;
139
140 rtt_us = tcp_stamp_us_delta(tp->tcp_mstamp, xmit_time);
141 if (rtt_us < tcp_min_rtt(tp) && (sacked & TCPCB_RETRANS)) {
142 /* If the sacked packet was retransmitted, it's ambiguous
143 * whether the retransmission or the original (or the prior
144 * retransmission) was sacked.
145 *
146 * If the original is lost, there is no ambiguity. Otherwise
147 * we assume the original can be delayed up to aRTT + min_rtt.
148 * the aRTT term is bounded by the fast recovery or timeout,
149 * so it's at least one RTT (i.e., retransmission is at least
150 * an RTT later).
151 */
152 return;
153 }
154 tp->rack.advanced = 1;
155 tp->rack.rtt_us = rtt_us;
156 if (tcp_rack_sent_after(xmit_time, tp->rack.mstamp,
157 end_seq, tp->rack.end_seq)) {
158 tp->rack.mstamp = xmit_time;
159 tp->rack.end_seq = end_seq;
160 }
161}
162
163/* We have waited long enough to accommodate reordering. Mark the expired
164 * packets lost and retransmit them.
165 */
166void tcp_rack_reo_timeout(struct sock *sk)
167{
168 struct tcp_sock *tp = tcp_sk(sk);
169 u32 timeout, prior_inflight;
170
171 prior_inflight = tcp_packets_in_flight(tp);
172 tcp_rack_detect_loss(sk, &timeout);
173 if (prior_inflight != tcp_packets_in_flight(tp)) {
174 if (inet_csk(sk)->icsk_ca_state != TCP_CA_Recovery) {
175 tcp_enter_recovery(sk, false);
176 if (!inet_csk(sk)->icsk_ca_ops->cong_control)
177 tcp_cwnd_reduction(sk, 1, 0);
178 }
179 tcp_xmit_retransmit_queue(sk);
180 }
181 if (inet_csk(sk)->icsk_pending != ICSK_TIME_RETRANS)
182 tcp_rearm_rto(sk);
183}
184
185/* Updates the RACK's reo_wnd based on DSACK and no. of recoveries.
186 *
187 * If DSACK is received, increment reo_wnd by min_rtt/4 (upper bounded
188 * by srtt), since there is possibility that spurious retransmission was
189 * due to reordering delay longer than reo_wnd.
190 *
191 * Persist the current reo_wnd value for TCP_RACK_RECOVERY_THRESH (16)
192 * no. of successful recoveries (accounts for full DSACK-based loss
193 * recovery undo). After that, reset it to default (min_rtt/4).
194 *
195 * At max, reo_wnd is incremented only once per rtt. So that the new
196 * DSACK on which we are reacting, is due to the spurious retx (approx)
197 * after the reo_wnd has been updated last time.
198 *
199 * reo_wnd is tracked in terms of steps (of min_rtt/4), rather than
200 * absolute value to account for change in rtt.
201 */
202void tcp_rack_update_reo_wnd(struct sock *sk, struct rate_sample *rs)
203{
204 struct tcp_sock *tp = tcp_sk(sk);
205
206 if (sock_net(sk)->ipv4.sysctl_tcp_recovery & TCP_RACK_STATIC_REO_WND ||
207 !rs->prior_delivered)
208 return;
209
210 /* Disregard DSACK if a rtt has not passed since we adjusted reo_wnd */
211 if (before(rs->prior_delivered, tp->rack.last_delivered))
212 tp->rack.dsack_seen = 0;
213
214 /* Adjust the reo_wnd if update is pending */
215 if (tp->rack.dsack_seen) {
216 tp->rack.reo_wnd_steps = min_t(u32, 0xFF,
217 tp->rack.reo_wnd_steps + 1);
218 tp->rack.dsack_seen = 0;
219 tp->rack.last_delivered = tp->delivered;
220 tp->rack.reo_wnd_persist = TCP_RACK_RECOVERY_THRESH;
221 } else if (!tp->rack.reo_wnd_persist) {
222 tp->rack.reo_wnd_steps = 1;
223 }
224}
225
226/* RFC6582 NewReno recovery for non-SACK connection. It simply retransmits
227 * the next unacked packet upon receiving
228 * a) three or more DUPACKs to start the fast recovery
229 * b) an ACK acknowledging new data during the fast recovery.
230 */
231void tcp_newreno_mark_lost(struct sock *sk, bool snd_una_advanced)
232{
233 const u8 state = inet_csk(sk)->icsk_ca_state;
234 struct tcp_sock *tp = tcp_sk(sk);
235
236 if ((state < TCP_CA_Recovery && tp->sacked_out >= tp->reordering) ||
237 (state == TCP_CA_Recovery && snd_una_advanced)) {
238 struct sk_buff *skb = tcp_rtx_queue_head(sk);
239 u32 mss;
240
241 if (TCP_SKB_CB(skb)->sacked & TCPCB_LOST)
242 return;
243
244 mss = tcp_skb_mss(skb);
245 if (tcp_skb_pcount(skb) > 1 && skb->len > mss)
246 tcp_fragment(sk, TCP_FRAG_IN_RTX_QUEUE, skb,
247 mss, mss, GFP_ATOMIC);
248
249 tcp_skb_mark_lost_uncond_verify(tp, skb);
250 }
251}