[TCP]: tcp_simple_retransmit can cause S+L
[linux-2.6.git] / net / ipv4 / tcp_input.c
1 /*
2  * INET         An implementation of the TCP/IP protocol suite for the LINUX
3  *              operating system.  INET is implemented using the  BSD Socket
4  *              interface as the means of communication with the user level.
5  *
6  *              Implementation of the Transmission Control Protocol(TCP).
7  *
8  * Version:     $Id: tcp_input.c,v 1.243 2002/02/01 22:01:04 davem Exp $
9  *
10  * Authors:     Ross Biro
11  *              Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
12  *              Mark Evans, <evansmp@uhura.aston.ac.uk>
13  *              Corey Minyard <wf-rch!minyard@relay.EU.net>
14  *              Florian La Roche, <flla@stud.uni-sb.de>
15  *              Charles Hedrick, <hedrick@klinzhai.rutgers.edu>
16  *              Linus Torvalds, <torvalds@cs.helsinki.fi>
17  *              Alan Cox, <gw4pts@gw4pts.ampr.org>
18  *              Matthew Dillon, <dillon@apollo.west.oic.com>
19  *              Arnt Gulbrandsen, <agulbra@nvg.unit.no>
20  *              Jorge Cwik, <jorge@laser.satlink.net>
21  */
22
23 /*
24  * Changes:
25  *              Pedro Roque     :       Fast Retransmit/Recovery.
26  *                                      Two receive queues.
27  *                                      Retransmit queue handled by TCP.
28  *                                      Better retransmit timer handling.
29  *                                      New congestion avoidance.
30  *                                      Header prediction.
31  *                                      Variable renaming.
32  *
33  *              Eric            :       Fast Retransmit.
34  *              Randy Scott     :       MSS option defines.
35  *              Eric Schenk     :       Fixes to slow start algorithm.
36  *              Eric Schenk     :       Yet another double ACK bug.
37  *              Eric Schenk     :       Delayed ACK bug fixes.
38  *              Eric Schenk     :       Floyd style fast retrans war avoidance.
39  *              David S. Miller :       Don't allow zero congestion window.
40  *              Eric Schenk     :       Fix retransmitter so that it sends
41  *                                      next packet on ack of previous packet.
42  *              Andi Kleen      :       Moved open_request checking here
43  *                                      and process RSTs for open_requests.
44  *              Andi Kleen      :       Better prune_queue, and other fixes.
45  *              Andrey Savochkin:       Fix RTT measurements in the presence of
46  *                                      timestamps.
47  *              Andrey Savochkin:       Check sequence numbers correctly when
48  *                                      removing SACKs due to in sequence incoming
49  *                                      data segments.
50  *              Andi Kleen:             Make sure we never ack data there is not
51  *                                      enough room for. Also make this condition
52  *                                      a fatal error if it might still happen.
53  *              Andi Kleen:             Add tcp_measure_rcv_mss to make
54  *                                      connections with MSS<min(MTU,ann. MSS)
55  *                                      work without delayed acks.
56  *              Andi Kleen:             Process packets with PSH set in the
57  *                                      fast path.
58  *              J Hadi Salim:           ECN support
59  *              Andrei Gurtov,
60  *              Pasi Sarolahti,
61  *              Panu Kuhlberg:          Experimental audit of TCP (re)transmission
62  *                                      engine. Lots of bugs are found.
63  *              Pasi Sarolahti:         F-RTO for dealing with spurious RTOs
64  */
65
66 #include <linux/mm.h>
67 #include <linux/module.h>
68 #include <linux/sysctl.h>
69 #include <net/tcp.h>
70 #include <net/inet_common.h>
71 #include <linux/ipsec.h>
72 #include <asm/unaligned.h>
73 #include <net/netdma.h>
74
75 int sysctl_tcp_timestamps __read_mostly = 1;
76 int sysctl_tcp_window_scaling __read_mostly = 1;
77 int sysctl_tcp_sack __read_mostly = 1;
78 int sysctl_tcp_fack __read_mostly = 1;
79 int sysctl_tcp_reordering __read_mostly = TCP_FASTRETRANS_THRESH;
80 int sysctl_tcp_ecn __read_mostly;
81 int sysctl_tcp_dsack __read_mostly = 1;
82 int sysctl_tcp_app_win __read_mostly = 31;
83 int sysctl_tcp_adv_win_scale __read_mostly = 2;
84
85 int sysctl_tcp_stdurg __read_mostly;
86 int sysctl_tcp_rfc1337 __read_mostly;
87 int sysctl_tcp_max_orphans __read_mostly = NR_FILE;
88 int sysctl_tcp_frto __read_mostly = 2;
89 int sysctl_tcp_frto_response __read_mostly;
90 int sysctl_tcp_nometrics_save __read_mostly;
91
92 int sysctl_tcp_moderate_rcvbuf __read_mostly = 1;
93 int sysctl_tcp_abc __read_mostly;
94
95 #define FLAG_DATA               0x01 /* Incoming frame contained data.          */
96 #define FLAG_WIN_UPDATE         0x02 /* Incoming ACK was a window update.       */
97 #define FLAG_DATA_ACKED         0x04 /* This ACK acknowledged new data.         */
98 #define FLAG_RETRANS_DATA_ACKED 0x08 /* "" "" some of which was retransmitted.  */
99 #define FLAG_SYN_ACKED          0x10 /* This ACK acknowledged SYN.              */
100 #define FLAG_DATA_SACKED        0x20 /* New SACK.                               */
101 #define FLAG_ECE                0x40 /* ECE in this ACK                         */
102 #define FLAG_DATA_LOST          0x80 /* SACK detected data lossage.             */
103 #define FLAG_SLOWPATH           0x100 /* Do not skip RFC checks for window update.*/
104 #define FLAG_ONLY_ORIG_SACKED   0x200 /* SACKs only non-rexmit sent before RTO */
105 #define FLAG_SND_UNA_ADVANCED   0x400 /* Snd_una was changed (!= FLAG_DATA_ACKED) */
106 #define FLAG_DSACKING_ACK       0x800 /* SACK blocks contained D-SACK info */
107 #define FLAG_NONHEAD_RETRANS_ACKED      0x1000 /* Non-head rexmitted data was ACKed */
108 #define FLAG_SACK_RENEGING      0x2000 /* snd_una advanced to a sacked seq */
109
110 #define FLAG_ACKED              (FLAG_DATA_ACKED|FLAG_SYN_ACKED)
111 #define FLAG_NOT_DUP            (FLAG_DATA|FLAG_WIN_UPDATE|FLAG_ACKED)
112 #define FLAG_CA_ALERT           (FLAG_DATA_SACKED|FLAG_ECE)
113 #define FLAG_FORWARD_PROGRESS   (FLAG_ACKED|FLAG_DATA_SACKED)
114 #define FLAG_ANY_PROGRESS       (FLAG_FORWARD_PROGRESS|FLAG_SND_UNA_ADVANCED)
115
116 #define IsSackFrto() (sysctl_tcp_frto == 0x2)
117
118 #define TCP_REMNANT (TCP_FLAG_FIN|TCP_FLAG_URG|TCP_FLAG_SYN|TCP_FLAG_PSH)
119 #define TCP_HP_BITS (~(TCP_RESERVED_BITS|TCP_FLAG_PSH))
120
121 /* Adapt the MSS value used to make delayed ack decision to the
122  * real world.
123  */
124 static void tcp_measure_rcv_mss(struct sock *sk, const struct sk_buff *skb)
125 {
126         struct inet_connection_sock *icsk = inet_csk(sk);
127         const unsigned int lss = icsk->icsk_ack.last_seg_size;
128         unsigned int len;
129
130         icsk->icsk_ack.last_seg_size = 0;
131
132         /* skb->len may jitter because of SACKs, even if peer
133          * sends good full-sized frames.
134          */
135         len = skb_shinfo(skb)->gso_size ? : skb->len;
136         if (len >= icsk->icsk_ack.rcv_mss) {
137                 icsk->icsk_ack.rcv_mss = len;
138         } else {
139                 /* Otherwise, we make more careful check taking into account,
140                  * that SACKs block is variable.
141                  *
142                  * "len" is invariant segment length, including TCP header.
143                  */
144                 len += skb->data - skb_transport_header(skb);
145                 if (len >= TCP_MIN_RCVMSS + sizeof(struct tcphdr) ||
146                     /* If PSH is not set, packet should be
147                      * full sized, provided peer TCP is not badly broken.
148                      * This observation (if it is correct 8)) allows
149                      * to handle super-low mtu links fairly.
150                      */
151                     (len >= TCP_MIN_MSS + sizeof(struct tcphdr) &&
152                      !(tcp_flag_word(tcp_hdr(skb)) & TCP_REMNANT))) {
153                         /* Subtract also invariant (if peer is RFC compliant),
154                          * tcp header plus fixed timestamp option length.
155                          * Resulting "len" is MSS free of SACK jitter.
156                          */
157                         len -= tcp_sk(sk)->tcp_header_len;
158                         icsk->icsk_ack.last_seg_size = len;
159                         if (len == lss) {
160                                 icsk->icsk_ack.rcv_mss = len;
161                                 return;
162                         }
163                 }
164                 if (icsk->icsk_ack.pending & ICSK_ACK_PUSHED)
165                         icsk->icsk_ack.pending |= ICSK_ACK_PUSHED2;
166                 icsk->icsk_ack.pending |= ICSK_ACK_PUSHED;
167         }
168 }
169
170 static void tcp_incr_quickack(struct sock *sk)
171 {
172         struct inet_connection_sock *icsk = inet_csk(sk);
173         unsigned quickacks = tcp_sk(sk)->rcv_wnd / (2 * icsk->icsk_ack.rcv_mss);
174
175         if (quickacks == 0)
176                 quickacks = 2;
177         if (quickacks > icsk->icsk_ack.quick)
178                 icsk->icsk_ack.quick = min(quickacks, TCP_MAX_QUICKACKS);
179 }
180
181 void tcp_enter_quickack_mode(struct sock *sk)
182 {
183         struct inet_connection_sock *icsk = inet_csk(sk);
184         tcp_incr_quickack(sk);
185         icsk->icsk_ack.pingpong = 0;
186         icsk->icsk_ack.ato = TCP_ATO_MIN;
187 }
188
189 /* Send ACKs quickly, if "quick" count is not exhausted
190  * and the session is not interactive.
191  */
192
193 static inline int tcp_in_quickack_mode(const struct sock *sk)
194 {
195         const struct inet_connection_sock *icsk = inet_csk(sk);
196         return icsk->icsk_ack.quick && !icsk->icsk_ack.pingpong;
197 }
198
199 static inline void TCP_ECN_queue_cwr(struct tcp_sock *tp)
200 {
201         if (tp->ecn_flags & TCP_ECN_OK)
202                 tp->ecn_flags |= TCP_ECN_QUEUE_CWR;
203 }
204
205 static inline void TCP_ECN_accept_cwr(struct tcp_sock *tp, struct sk_buff *skb)
206 {
207         if (tcp_hdr(skb)->cwr)
208                 tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR;
209 }
210
211 static inline void TCP_ECN_withdraw_cwr(struct tcp_sock *tp)
212 {
213         tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR;
214 }
215
216 static inline void TCP_ECN_check_ce(struct tcp_sock *tp, struct sk_buff *skb)
217 {
218         if (tp->ecn_flags & TCP_ECN_OK) {
219                 if (INET_ECN_is_ce(TCP_SKB_CB(skb)->flags))
220                         tp->ecn_flags |= TCP_ECN_DEMAND_CWR;
221                 /* Funny extension: if ECT is not set on a segment,
222                  * it is surely retransmit. It is not in ECN RFC,
223                  * but Linux follows this rule. */
224                 else if (INET_ECN_is_not_ect((TCP_SKB_CB(skb)->flags)))
225                         tcp_enter_quickack_mode((struct sock *)tp);
226         }
227 }
228
229 static inline void TCP_ECN_rcv_synack(struct tcp_sock *tp, struct tcphdr *th)
230 {
231         if ((tp->ecn_flags & TCP_ECN_OK) && (!th->ece || th->cwr))
232                 tp->ecn_flags &= ~TCP_ECN_OK;
233 }
234
235 static inline void TCP_ECN_rcv_syn(struct tcp_sock *tp, struct tcphdr *th)
236 {
237         if ((tp->ecn_flags & TCP_ECN_OK) && (!th->ece || !th->cwr))
238                 tp->ecn_flags &= ~TCP_ECN_OK;
239 }
240
241 static inline int TCP_ECN_rcv_ecn_echo(struct tcp_sock *tp, struct tcphdr *th)
242 {
243         if (th->ece && !th->syn && (tp->ecn_flags & TCP_ECN_OK))
244                 return 1;
245         return 0;
246 }
247
248 /* Buffer size and advertised window tuning.
249  *
250  * 1. Tuning sk->sk_sndbuf, when connection enters established state.
251  */
252
253 static void tcp_fixup_sndbuf(struct sock *sk)
254 {
255         int sndmem = tcp_sk(sk)->rx_opt.mss_clamp + MAX_TCP_HEADER + 16 +
256                      sizeof(struct sk_buff);
257
258         if (sk->sk_sndbuf < 3 * sndmem)
259                 sk->sk_sndbuf = min(3 * sndmem, sysctl_tcp_wmem[2]);
260 }
261
262 /* 2. Tuning advertised window (window_clamp, rcv_ssthresh)
263  *
264  * All tcp_full_space() is split to two parts: "network" buffer, allocated
265  * forward and advertised in receiver window (tp->rcv_wnd) and
266  * "application buffer", required to isolate scheduling/application
267  * latencies from network.
268  * window_clamp is maximal advertised window. It can be less than
269  * tcp_full_space(), in this case tcp_full_space() - window_clamp
270  * is reserved for "application" buffer. The less window_clamp is
271  * the smoother our behaviour from viewpoint of network, but the lower
272  * throughput and the higher sensitivity of the connection to losses. 8)
273  *
274  * rcv_ssthresh is more strict window_clamp used at "slow start"
275  * phase to predict further behaviour of this connection.
276  * It is used for two goals:
277  * - to enforce header prediction at sender, even when application
278  *   requires some significant "application buffer". It is check #1.
279  * - to prevent pruning of receive queue because of misprediction
280  *   of receiver window. Check #2.
281  *
282  * The scheme does not work when sender sends good segments opening
283  * window and then starts to feed us spaghetti. But it should work
284  * in common situations. Otherwise, we have to rely on queue collapsing.
285  */
286
287 /* Slow part of check#2. */
288 static int __tcp_grow_window(const struct sock *sk, const struct sk_buff *skb)
289 {
290         struct tcp_sock *tp = tcp_sk(sk);
291         /* Optimize this! */
292         int truesize = tcp_win_from_space(skb->truesize) >> 1;
293         int window = tcp_win_from_space(sysctl_tcp_rmem[2]) >> 1;
294
295         while (tp->rcv_ssthresh <= window) {
296                 if (truesize <= skb->len)
297                         return 2 * inet_csk(sk)->icsk_ack.rcv_mss;
298
299                 truesize >>= 1;
300                 window >>= 1;
301         }
302         return 0;
303 }
304
305 static void tcp_grow_window(struct sock *sk, struct sk_buff *skb)
306 {
307         struct tcp_sock *tp = tcp_sk(sk);
308
309         /* Check #1 */
310         if (tp->rcv_ssthresh < tp->window_clamp &&
311             (int)tp->rcv_ssthresh < tcp_space(sk) &&
312             !tcp_memory_pressure) {
313                 int incr;
314
315                 /* Check #2. Increase window, if skb with such overhead
316                  * will fit to rcvbuf in future.
317                  */
318                 if (tcp_win_from_space(skb->truesize) <= skb->len)
319                         incr = 2 * tp->advmss;
320                 else
321                         incr = __tcp_grow_window(sk, skb);
322
323                 if (incr) {
324                         tp->rcv_ssthresh = min(tp->rcv_ssthresh + incr,
325                                                tp->window_clamp);
326                         inet_csk(sk)->icsk_ack.quick |= 1;
327                 }
328         }
329 }
330
331 /* 3. Tuning rcvbuf, when connection enters established state. */
332
333 static void tcp_fixup_rcvbuf(struct sock *sk)
334 {
335         struct tcp_sock *tp = tcp_sk(sk);
336         int rcvmem = tp->advmss + MAX_TCP_HEADER + 16 + sizeof(struct sk_buff);
337
338         /* Try to select rcvbuf so that 4 mss-sized segments
339          * will fit to window and corresponding skbs will fit to our rcvbuf.
340          * (was 3; 4 is minimum to allow fast retransmit to work.)
341          */
342         while (tcp_win_from_space(rcvmem) < tp->advmss)
343                 rcvmem += 128;
344         if (sk->sk_rcvbuf < 4 * rcvmem)
345                 sk->sk_rcvbuf = min(4 * rcvmem, sysctl_tcp_rmem[2]);
346 }
347
348 /* 4. Try to fixup all. It is made immediately after connection enters
349  *    established state.
350  */
351 static void tcp_init_buffer_space(struct sock *sk)
352 {
353         struct tcp_sock *tp = tcp_sk(sk);
354         int maxwin;
355
356         if (!(sk->sk_userlocks & SOCK_RCVBUF_LOCK))
357                 tcp_fixup_rcvbuf(sk);
358         if (!(sk->sk_userlocks & SOCK_SNDBUF_LOCK))
359                 tcp_fixup_sndbuf(sk);
360
361         tp->rcvq_space.space = tp->rcv_wnd;
362
363         maxwin = tcp_full_space(sk);
364
365         if (tp->window_clamp >= maxwin) {
366                 tp->window_clamp = maxwin;
367
368                 if (sysctl_tcp_app_win && maxwin > 4 * tp->advmss)
369                         tp->window_clamp = max(maxwin -
370                                                (maxwin >> sysctl_tcp_app_win),
371                                                4 * tp->advmss);
372         }
373
374         /* Force reservation of one segment. */
375         if (sysctl_tcp_app_win &&
376             tp->window_clamp > 2 * tp->advmss &&
377             tp->window_clamp + tp->advmss > maxwin)
378                 tp->window_clamp = max(2 * tp->advmss, maxwin - tp->advmss);
379
380         tp->rcv_ssthresh = min(tp->rcv_ssthresh, tp->window_clamp);
381         tp->snd_cwnd_stamp = tcp_time_stamp;
382 }
383
384 /* 5. Recalculate window clamp after socket hit its memory bounds. */
385 static void tcp_clamp_window(struct sock *sk)
386 {
387         struct tcp_sock *tp = tcp_sk(sk);
388         struct inet_connection_sock *icsk = inet_csk(sk);
389
390         icsk->icsk_ack.quick = 0;
391
392         if (sk->sk_rcvbuf < sysctl_tcp_rmem[2] &&
393             !(sk->sk_userlocks & SOCK_RCVBUF_LOCK) &&
394             !tcp_memory_pressure &&
395             atomic_read(&tcp_memory_allocated) < sysctl_tcp_mem[0]) {
396                 sk->sk_rcvbuf = min(atomic_read(&sk->sk_rmem_alloc),
397                                     sysctl_tcp_rmem[2]);
398         }
399         if (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf)
400                 tp->rcv_ssthresh = min(tp->window_clamp, 2U * tp->advmss);
401 }
402
403 /* Initialize RCV_MSS value.
404  * RCV_MSS is an our guess about MSS used by the peer.
405  * We haven't any direct information about the MSS.
406  * It's better to underestimate the RCV_MSS rather than overestimate.
407  * Overestimations make us ACKing less frequently than needed.
408  * Underestimations are more easy to detect and fix by tcp_measure_rcv_mss().
409  */
410 void tcp_initialize_rcv_mss(struct sock *sk)
411 {
412         struct tcp_sock *tp = tcp_sk(sk);
413         unsigned int hint = min_t(unsigned int, tp->advmss, tp->mss_cache);
414
415         hint = min(hint, tp->rcv_wnd / 2);
416         hint = min(hint, TCP_MIN_RCVMSS);
417         hint = max(hint, TCP_MIN_MSS);
418
419         inet_csk(sk)->icsk_ack.rcv_mss = hint;
420 }
421
422 /* Receiver "autotuning" code.
423  *
424  * The algorithm for RTT estimation w/o timestamps is based on
425  * Dynamic Right-Sizing (DRS) by Wu Feng and Mike Fisk of LANL.
426  * <http://www.lanl.gov/radiant/website/pubs/drs/lacsi2001.ps>
427  *
428  * More detail on this code can be found at
429  * <http://www.psc.edu/~jheffner/senior_thesis.ps>,
430  * though this reference is out of date.  A new paper
431  * is pending.
432  */
433 static void tcp_rcv_rtt_update(struct tcp_sock *tp, u32 sample, int win_dep)
434 {
435         u32 new_sample = tp->rcv_rtt_est.rtt;
436         long m = sample;
437
438         if (m == 0)
439                 m = 1;
440
441         if (new_sample != 0) {
442                 /* If we sample in larger samples in the non-timestamp
443                  * case, we could grossly overestimate the RTT especially
444                  * with chatty applications or bulk transfer apps which
445                  * are stalled on filesystem I/O.
446                  *
447                  * Also, since we are only going for a minimum in the
448                  * non-timestamp case, we do not smooth things out
449                  * else with timestamps disabled convergence takes too
450                  * long.
451                  */
452                 if (!win_dep) {
453                         m -= (new_sample >> 3);
454                         new_sample += m;
455                 } else if (m < new_sample)
456                         new_sample = m << 3;
457         } else {
458                 /* No previous measure. */
459                 new_sample = m << 3;
460         }
461
462         if (tp->rcv_rtt_est.rtt != new_sample)
463                 tp->rcv_rtt_est.rtt = new_sample;
464 }
465
466 static inline void tcp_rcv_rtt_measure(struct tcp_sock *tp)
467 {
468         if (tp->rcv_rtt_est.time == 0)
469                 goto new_measure;
470         if (before(tp->rcv_nxt, tp->rcv_rtt_est.seq))
471                 return;
472         tcp_rcv_rtt_update(tp, jiffies - tp->rcv_rtt_est.time, 1);
473
474 new_measure:
475         tp->rcv_rtt_est.seq = tp->rcv_nxt + tp->rcv_wnd;
476         tp->rcv_rtt_est.time = tcp_time_stamp;
477 }
478
479 static inline void tcp_rcv_rtt_measure_ts(struct sock *sk,
480                                           const struct sk_buff *skb)
481 {
482         struct tcp_sock *tp = tcp_sk(sk);
483         if (tp->rx_opt.rcv_tsecr &&
484             (TCP_SKB_CB(skb)->end_seq -
485              TCP_SKB_CB(skb)->seq >= inet_csk(sk)->icsk_ack.rcv_mss))
486                 tcp_rcv_rtt_update(tp, tcp_time_stamp - tp->rx_opt.rcv_tsecr, 0);
487 }
488
489 /*
490  * This function should be called every time data is copied to user space.
491  * It calculates the appropriate TCP receive buffer space.
492  */
493 void tcp_rcv_space_adjust(struct sock *sk)
494 {
495         struct tcp_sock *tp = tcp_sk(sk);
496         int time;
497         int space;
498
499         if (tp->rcvq_space.time == 0)
500                 goto new_measure;
501
502         time = tcp_time_stamp - tp->rcvq_space.time;
503         if (time < (tp->rcv_rtt_est.rtt >> 3) || tp->rcv_rtt_est.rtt == 0)
504                 return;
505
506         space = 2 * (tp->copied_seq - tp->rcvq_space.seq);
507
508         space = max(tp->rcvq_space.space, space);
509
510         if (tp->rcvq_space.space != space) {
511                 int rcvmem;
512
513                 tp->rcvq_space.space = space;
514
515                 if (sysctl_tcp_moderate_rcvbuf &&
516                     !(sk->sk_userlocks & SOCK_RCVBUF_LOCK)) {
517                         int new_clamp = space;
518
519                         /* Receive space grows, normalize in order to
520                          * take into account packet headers and sk_buff
521                          * structure overhead.
522                          */
523                         space /= tp->advmss;
524                         if (!space)
525                                 space = 1;
526                         rcvmem = (tp->advmss + MAX_TCP_HEADER +
527                                   16 + sizeof(struct sk_buff));
528                         while (tcp_win_from_space(rcvmem) < tp->advmss)
529                                 rcvmem += 128;
530                         space *= rcvmem;
531                         space = min(space, sysctl_tcp_rmem[2]);
532                         if (space > sk->sk_rcvbuf) {
533                                 sk->sk_rcvbuf = space;
534
535                                 /* Make the window clamp follow along.  */
536                                 tp->window_clamp = new_clamp;
537                         }
538                 }
539         }
540
541 new_measure:
542         tp->rcvq_space.seq = tp->copied_seq;
543         tp->rcvq_space.time = tcp_time_stamp;
544 }
545
546 /* There is something which you must keep in mind when you analyze the
547  * behavior of the tp->ato delayed ack timeout interval.  When a
548  * connection starts up, we want to ack as quickly as possible.  The
549  * problem is that "good" TCP's do slow start at the beginning of data
550  * transmission.  The means that until we send the first few ACK's the
551  * sender will sit on his end and only queue most of his data, because
552  * he can only send snd_cwnd unacked packets at any given time.  For
553  * each ACK we send, he increments snd_cwnd and transmits more of his
554  * queue.  -DaveM
555  */
556 static void tcp_event_data_recv(struct sock *sk, struct sk_buff *skb)
557 {
558         struct tcp_sock *tp = tcp_sk(sk);
559         struct inet_connection_sock *icsk = inet_csk(sk);
560         u32 now;
561
562         inet_csk_schedule_ack(sk);
563
564         tcp_measure_rcv_mss(sk, skb);
565
566         tcp_rcv_rtt_measure(tp);
567
568         now = tcp_time_stamp;
569
570         if (!icsk->icsk_ack.ato) {
571                 /* The _first_ data packet received, initialize
572                  * delayed ACK engine.
573                  */
574                 tcp_incr_quickack(sk);
575                 icsk->icsk_ack.ato = TCP_ATO_MIN;
576         } else {
577                 int m = now - icsk->icsk_ack.lrcvtime;
578
579                 if (m <= TCP_ATO_MIN / 2) {
580                         /* The fastest case is the first. */
581                         icsk->icsk_ack.ato = (icsk->icsk_ack.ato >> 1) + TCP_ATO_MIN / 2;
582                 } else if (m < icsk->icsk_ack.ato) {
583                         icsk->icsk_ack.ato = (icsk->icsk_ack.ato >> 1) + m;
584                         if (icsk->icsk_ack.ato > icsk->icsk_rto)
585                                 icsk->icsk_ack.ato = icsk->icsk_rto;
586                 } else if (m > icsk->icsk_rto) {
587                         /* Too long gap. Apparently sender failed to
588                          * restart window, so that we send ACKs quickly.
589                          */
590                         tcp_incr_quickack(sk);
591                         sk_mem_reclaim(sk);
592                 }
593         }
594         icsk->icsk_ack.lrcvtime = now;
595
596         TCP_ECN_check_ce(tp, skb);
597
598         if (skb->len >= 128)
599                 tcp_grow_window(sk, skb);
600 }
601
602 static u32 tcp_rto_min(struct sock *sk)
603 {
604         struct dst_entry *dst = __sk_dst_get(sk);
605         u32 rto_min = TCP_RTO_MIN;
606
607         if (dst && dst_metric_locked(dst, RTAX_RTO_MIN))
608                 rto_min = dst->metrics[RTAX_RTO_MIN - 1];
609         return rto_min;
610 }
611
612 /* Called to compute a smoothed rtt estimate. The data fed to this
613  * routine either comes from timestamps, or from segments that were
614  * known _not_ to have been retransmitted [see Karn/Partridge
615  * Proceedings SIGCOMM 87]. The algorithm is from the SIGCOMM 88
616  * piece by Van Jacobson.
617  * NOTE: the next three routines used to be one big routine.
618  * To save cycles in the RFC 1323 implementation it was better to break
619  * it up into three procedures. -- erics
620  */
621 static void tcp_rtt_estimator(struct sock *sk, const __u32 mrtt)
622 {
623         struct tcp_sock *tp = tcp_sk(sk);
624         long m = mrtt; /* RTT */
625
626         /*      The following amusing code comes from Jacobson's
627          *      article in SIGCOMM '88.  Note that rtt and mdev
628          *      are scaled versions of rtt and mean deviation.
629          *      This is designed to be as fast as possible
630          *      m stands for "measurement".
631          *
632          *      On a 1990 paper the rto value is changed to:
633          *      RTO = rtt + 4 * mdev
634          *
635          * Funny. This algorithm seems to be very broken.
636          * These formulae increase RTO, when it should be decreased, increase
637          * too slowly, when it should be increased quickly, decrease too quickly
638          * etc. I guess in BSD RTO takes ONE value, so that it is absolutely
639          * does not matter how to _calculate_ it. Seems, it was trap
640          * that VJ failed to avoid. 8)
641          */
642         if (m == 0)
643                 m = 1;
644         if (tp->srtt != 0) {
645                 m -= (tp->srtt >> 3);   /* m is now error in rtt est */
646                 tp->srtt += m;          /* rtt = 7/8 rtt + 1/8 new */
647                 if (m < 0) {
648                         m = -m;         /* m is now abs(error) */
649                         m -= (tp->mdev >> 2);   /* similar update on mdev */
650                         /* This is similar to one of Eifel findings.
651                          * Eifel blocks mdev updates when rtt decreases.
652                          * This solution is a bit different: we use finer gain
653                          * for mdev in this case (alpha*beta).
654                          * Like Eifel it also prevents growth of rto,
655                          * but also it limits too fast rto decreases,
656                          * happening in pure Eifel.
657                          */
658                         if (m > 0)
659                                 m >>= 3;
660                 } else {
661                         m -= (tp->mdev >> 2);   /* similar update on mdev */
662                 }
663                 tp->mdev += m;          /* mdev = 3/4 mdev + 1/4 new */
664                 if (tp->mdev > tp->mdev_max) {
665                         tp->mdev_max = tp->mdev;
666                         if (tp->mdev_max > tp->rttvar)
667                                 tp->rttvar = tp->mdev_max;
668                 }
669                 if (after(tp->snd_una, tp->rtt_seq)) {
670                         if (tp->mdev_max < tp->rttvar)
671                                 tp->rttvar -= (tp->rttvar - tp->mdev_max) >> 2;
672                         tp->rtt_seq = tp->snd_nxt;
673                         tp->mdev_max = tcp_rto_min(sk);
674                 }
675         } else {
676                 /* no previous measure. */
677                 tp->srtt = m << 3;      /* take the measured time to be rtt */
678                 tp->mdev = m << 1;      /* make sure rto = 3*rtt */
679                 tp->mdev_max = tp->rttvar = max(tp->mdev, tcp_rto_min(sk));
680                 tp->rtt_seq = tp->snd_nxt;
681         }
682 }
683
684 /* Calculate rto without backoff.  This is the second half of Van Jacobson's
685  * routine referred to above.
686  */
687 static inline void tcp_set_rto(struct sock *sk)
688 {
689         const struct tcp_sock *tp = tcp_sk(sk);
690         /* Old crap is replaced with new one. 8)
691          *
692          * More seriously:
693          * 1. If rtt variance happened to be less 50msec, it is hallucination.
694          *    It cannot be less due to utterly erratic ACK generation made
695          *    at least by solaris and freebsd. "Erratic ACKs" has _nothing_
696          *    to do with delayed acks, because at cwnd>2 true delack timeout
697          *    is invisible. Actually, Linux-2.4 also generates erratic
698          *    ACKs in some circumstances.
699          */
700         inet_csk(sk)->icsk_rto = (tp->srtt >> 3) + tp->rttvar;
701
702         /* 2. Fixups made earlier cannot be right.
703          *    If we do not estimate RTO correctly without them,
704          *    all the algo is pure shit and should be replaced
705          *    with correct one. It is exactly, which we pretend to do.
706          */
707 }
708
709 /* NOTE: clamping at TCP_RTO_MIN is not required, current algo
710  * guarantees that rto is higher.
711  */
712 static inline void tcp_bound_rto(struct sock *sk)
713 {
714         if (inet_csk(sk)->icsk_rto > TCP_RTO_MAX)
715                 inet_csk(sk)->icsk_rto = TCP_RTO_MAX;
716 }
717
718 /* Save metrics learned by this TCP session.
719    This function is called only, when TCP finishes successfully
720    i.e. when it enters TIME-WAIT or goes from LAST-ACK to CLOSE.
721  */
722 void tcp_update_metrics(struct sock *sk)
723 {
724         struct tcp_sock *tp = tcp_sk(sk);
725         struct dst_entry *dst = __sk_dst_get(sk);
726
727         if (sysctl_tcp_nometrics_save)
728                 return;
729
730         dst_confirm(dst);
731
732         if (dst && (dst->flags & DST_HOST)) {
733                 const struct inet_connection_sock *icsk = inet_csk(sk);
734                 int m;
735
736                 if (icsk->icsk_backoff || !tp->srtt) {
737                         /* This session failed to estimate rtt. Why?
738                          * Probably, no packets returned in time.
739                          * Reset our results.
740                          */
741                         if (!(dst_metric_locked(dst, RTAX_RTT)))
742                                 dst->metrics[RTAX_RTT - 1] = 0;
743                         return;
744                 }
745
746                 m = dst_metric(dst, RTAX_RTT) - tp->srtt;
747
748                 /* If newly calculated rtt larger than stored one,
749                  * store new one. Otherwise, use EWMA. Remember,
750                  * rtt overestimation is always better than underestimation.
751                  */
752                 if (!(dst_metric_locked(dst, RTAX_RTT))) {
753                         if (m <= 0)
754                                 dst->metrics[RTAX_RTT - 1] = tp->srtt;
755                         else
756                                 dst->metrics[RTAX_RTT - 1] -= (m >> 3);
757                 }
758
759                 if (!(dst_metric_locked(dst, RTAX_RTTVAR))) {
760                         if (m < 0)
761                                 m = -m;
762
763                         /* Scale deviation to rttvar fixed point */
764                         m >>= 1;
765                         if (m < tp->mdev)
766                                 m = tp->mdev;
767
768                         if (m >= dst_metric(dst, RTAX_RTTVAR))
769                                 dst->metrics[RTAX_RTTVAR - 1] = m;
770                         else
771                                 dst->metrics[RTAX_RTTVAR-1] -=
772                                         (dst->metrics[RTAX_RTTVAR-1] - m)>>2;
773                 }
774
775                 if (tp->snd_ssthresh >= 0xFFFF) {
776                         /* Slow start still did not finish. */
777                         if (dst_metric(dst, RTAX_SSTHRESH) &&
778                             !dst_metric_locked(dst, RTAX_SSTHRESH) &&
779                             (tp->snd_cwnd >> 1) > dst_metric(dst, RTAX_SSTHRESH))
780                                 dst->metrics[RTAX_SSTHRESH-1] = tp->snd_cwnd >> 1;
781                         if (!dst_metric_locked(dst, RTAX_CWND) &&
782                             tp->snd_cwnd > dst_metric(dst, RTAX_CWND))
783                                 dst->metrics[RTAX_CWND - 1] = tp->snd_cwnd;
784                 } else if (tp->snd_cwnd > tp->snd_ssthresh &&
785                            icsk->icsk_ca_state == TCP_CA_Open) {
786                         /* Cong. avoidance phase, cwnd is reliable. */
787                         if (!dst_metric_locked(dst, RTAX_SSTHRESH))
788                                 dst->metrics[RTAX_SSTHRESH-1] =
789                                         max(tp->snd_cwnd >> 1, tp->snd_ssthresh);
790                         if (!dst_metric_locked(dst, RTAX_CWND))
791                                 dst->metrics[RTAX_CWND-1] = (dst->metrics[RTAX_CWND-1] + tp->snd_cwnd) >> 1;
792                 } else {
793                         /* Else slow start did not finish, cwnd is non-sense,
794                            ssthresh may be also invalid.
795                          */
796                         if (!dst_metric_locked(dst, RTAX_CWND))
797                                 dst->metrics[RTAX_CWND-1] = (dst->metrics[RTAX_CWND-1] + tp->snd_ssthresh) >> 1;
798                         if (dst->metrics[RTAX_SSTHRESH-1] &&
799                             !dst_metric_locked(dst, RTAX_SSTHRESH) &&
800                             tp->snd_ssthresh > dst->metrics[RTAX_SSTHRESH-1])
801                                 dst->metrics[RTAX_SSTHRESH-1] = tp->snd_ssthresh;
802                 }
803
804                 if (!dst_metric_locked(dst, RTAX_REORDERING)) {
805                         if (dst->metrics[RTAX_REORDERING-1] < tp->reordering &&
806                             tp->reordering != sysctl_tcp_reordering)
807                                 dst->metrics[RTAX_REORDERING-1] = tp->reordering;
808                 }
809         }
810 }
811
812 /* Numbers are taken from RFC3390.
813  *
814  * John Heffner states:
815  *
816  *      The RFC specifies a window of no more than 4380 bytes
817  *      unless 2*MSS > 4380.  Reading the pseudocode in the RFC
818  *      is a bit misleading because they use a clamp at 4380 bytes
819  *      rather than use a multiplier in the relevant range.
820  */
821 __u32 tcp_init_cwnd(struct tcp_sock *tp, struct dst_entry *dst)
822 {
823         __u32 cwnd = (dst ? dst_metric(dst, RTAX_INITCWND) : 0);
824
825         if (!cwnd) {
826                 if (tp->mss_cache > 1460)
827                         cwnd = 2;
828                 else
829                         cwnd = (tp->mss_cache > 1095) ? 3 : 4;
830         }
831         return min_t(__u32, cwnd, tp->snd_cwnd_clamp);
832 }
833
834 /* Set slow start threshold and cwnd not falling to slow start */
835 void tcp_enter_cwr(struct sock *sk, const int set_ssthresh)
836 {
837         struct tcp_sock *tp = tcp_sk(sk);
838         const struct inet_connection_sock *icsk = inet_csk(sk);
839
840         tp->prior_ssthresh = 0;
841         tp->bytes_acked = 0;
842         if (icsk->icsk_ca_state < TCP_CA_CWR) {
843                 tp->undo_marker = 0;
844                 if (set_ssthresh)
845                         tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
846                 tp->snd_cwnd = min(tp->snd_cwnd,
847                                    tcp_packets_in_flight(tp) + 1U);
848                 tp->snd_cwnd_cnt = 0;
849                 tp->high_seq = tp->snd_nxt;
850                 tp->snd_cwnd_stamp = tcp_time_stamp;
851                 TCP_ECN_queue_cwr(tp);
852
853                 tcp_set_ca_state(sk, TCP_CA_CWR);
854         }
855 }
856
857 /*
858  * Packet counting of FACK is based on in-order assumptions, therefore TCP
859  * disables it when reordering is detected
860  */
861 static void tcp_disable_fack(struct tcp_sock *tp)
862 {
863         /* RFC3517 uses different metric in lost marker => reset on change */
864         if (tcp_is_fack(tp))
865                 tp->lost_skb_hint = NULL;
866         tp->rx_opt.sack_ok &= ~2;
867 }
868
869 /* Take a notice that peer is sending D-SACKs */
870 static void tcp_dsack_seen(struct tcp_sock *tp)
871 {
872         tp->rx_opt.sack_ok |= 4;
873 }
874
875 /* Initialize metrics on socket. */
876
877 static void tcp_init_metrics(struct sock *sk)
878 {
879         struct tcp_sock *tp = tcp_sk(sk);
880         struct dst_entry *dst = __sk_dst_get(sk);
881
882         if (dst == NULL)
883                 goto reset;
884
885         dst_confirm(dst);
886
887         if (dst_metric_locked(dst, RTAX_CWND))
888                 tp->snd_cwnd_clamp = dst_metric(dst, RTAX_CWND);
889         if (dst_metric(dst, RTAX_SSTHRESH)) {
890                 tp->snd_ssthresh = dst_metric(dst, RTAX_SSTHRESH);
891                 if (tp->snd_ssthresh > tp->snd_cwnd_clamp)
892                         tp->snd_ssthresh = tp->snd_cwnd_clamp;
893         }
894         if (dst_metric(dst, RTAX_REORDERING) &&
895             tp->reordering != dst_metric(dst, RTAX_REORDERING)) {
896                 tcp_disable_fack(tp);
897                 tp->reordering = dst_metric(dst, RTAX_REORDERING);
898         }
899
900         if (dst_metric(dst, RTAX_RTT) == 0)
901                 goto reset;
902
903         if (!tp->srtt && dst_metric(dst, RTAX_RTT) < (TCP_TIMEOUT_INIT << 3))
904                 goto reset;
905
906         /* Initial rtt is determined from SYN,SYN-ACK.
907          * The segment is small and rtt may appear much
908          * less than real one. Use per-dst memory
909          * to make it more realistic.
910          *
911          * A bit of theory. RTT is time passed after "normal" sized packet
912          * is sent until it is ACKed. In normal circumstances sending small
913          * packets force peer to delay ACKs and calculation is correct too.
914          * The algorithm is adaptive and, provided we follow specs, it
915          * NEVER underestimate RTT. BUT! If peer tries to make some clever
916          * tricks sort of "quick acks" for time long enough to decrease RTT
917          * to low value, and then abruptly stops to do it and starts to delay
918          * ACKs, wait for troubles.
919          */
920         if (dst_metric(dst, RTAX_RTT) > tp->srtt) {
921                 tp->srtt = dst_metric(dst, RTAX_RTT);
922                 tp->rtt_seq = tp->snd_nxt;
923         }
924         if (dst_metric(dst, RTAX_RTTVAR) > tp->mdev) {
925                 tp->mdev = dst_metric(dst, RTAX_RTTVAR);
926                 tp->mdev_max = tp->rttvar = max(tp->mdev, tcp_rto_min(sk));
927         }
928         tcp_set_rto(sk);
929         tcp_bound_rto(sk);
930         if (inet_csk(sk)->icsk_rto < TCP_TIMEOUT_INIT && !tp->rx_opt.saw_tstamp)
931                 goto reset;
932         tp->snd_cwnd = tcp_init_cwnd(tp, dst);
933         tp->snd_cwnd_stamp = tcp_time_stamp;
934         return;
935
936 reset:
937         /* Play conservative. If timestamps are not
938          * supported, TCP will fail to recalculate correct
939          * rtt, if initial rto is too small. FORGET ALL AND RESET!
940          */
941         if (!tp->rx_opt.saw_tstamp && tp->srtt) {
942                 tp->srtt = 0;
943                 tp->mdev = tp->mdev_max = tp->rttvar = TCP_TIMEOUT_INIT;
944                 inet_csk(sk)->icsk_rto = TCP_TIMEOUT_INIT;
945         }
946 }
947
948 static void tcp_update_reordering(struct sock *sk, const int metric,
949                                   const int ts)
950 {
951         struct tcp_sock *tp = tcp_sk(sk);
952         if (metric > tp->reordering) {
953                 tp->reordering = min(TCP_MAX_REORDERING, metric);
954
955                 /* This exciting event is worth to be remembered. 8) */
956                 if (ts)
957                         NET_INC_STATS_BH(LINUX_MIB_TCPTSREORDER);
958                 else if (tcp_is_reno(tp))
959                         NET_INC_STATS_BH(LINUX_MIB_TCPRENOREORDER);
960                 else if (tcp_is_fack(tp))
961                         NET_INC_STATS_BH(LINUX_MIB_TCPFACKREORDER);
962                 else
963                         NET_INC_STATS_BH(LINUX_MIB_TCPSACKREORDER);
964 #if FASTRETRANS_DEBUG > 1
965                 printk(KERN_DEBUG "Disorder%d %d %u f%u s%u rr%d\n",
966                        tp->rx_opt.sack_ok, inet_csk(sk)->icsk_ca_state,
967                        tp->reordering,
968                        tp->fackets_out,
969                        tp->sacked_out,
970                        tp->undo_marker ? tp->undo_retrans : 0);
971 #endif
972                 tcp_disable_fack(tp);
973         }
974 }
975
976 /* This procedure tags the retransmission queue when SACKs arrive.
977  *
978  * We have three tag bits: SACKED(S), RETRANS(R) and LOST(L).
979  * Packets in queue with these bits set are counted in variables
980  * sacked_out, retrans_out and lost_out, correspondingly.
981  *
982  * Valid combinations are:
983  * Tag  InFlight        Description
984  * 0    1               - orig segment is in flight.
985  * S    0               - nothing flies, orig reached receiver.
986  * L    0               - nothing flies, orig lost by net.
987  * R    2               - both orig and retransmit are in flight.
988  * L|R  1               - orig is lost, retransmit is in flight.
989  * S|R  1               - orig reached receiver, retrans is still in flight.
990  * (L|S|R is logically valid, it could occur when L|R is sacked,
991  *  but it is equivalent to plain S and code short-curcuits it to S.
992  *  L|S is logically invalid, it would mean -1 packet in flight 8))
993  *
994  * These 6 states form finite state machine, controlled by the following events:
995  * 1. New ACK (+SACK) arrives. (tcp_sacktag_write_queue())
996  * 2. Retransmission. (tcp_retransmit_skb(), tcp_xmit_retransmit_queue())
997  * 3. Loss detection event of one of three flavors:
998  *      A. Scoreboard estimator decided the packet is lost.
999  *         A'. Reno "three dupacks" marks head of queue lost.
1000  *         A''. Its FACK modfication, head until snd.fack is lost.
1001  *      B. SACK arrives sacking data transmitted after never retransmitted
1002  *         hole was sent out.
1003  *      C. SACK arrives sacking SND.NXT at the moment, when the
1004  *         segment was retransmitted.
1005  * 4. D-SACK added new rule: D-SACK changes any tag to S.
1006  *
1007  * It is pleasant to note, that state diagram turns out to be commutative,
1008  * so that we are allowed not to be bothered by order of our actions,
1009  * when multiple events arrive simultaneously. (see the function below).
1010  *
1011  * Reordering detection.
1012  * --------------------
1013  * Reordering metric is maximal distance, which a packet can be displaced
1014  * in packet stream. With SACKs we can estimate it:
1015  *
1016  * 1. SACK fills old hole and the corresponding segment was not
1017  *    ever retransmitted -> reordering. Alas, we cannot use it
1018  *    when segment was retransmitted.
1019  * 2. The last flaw is solved with D-SACK. D-SACK arrives
1020  *    for retransmitted and already SACKed segment -> reordering..
1021  * Both of these heuristics are not used in Loss state, when we cannot
1022  * account for retransmits accurately.
1023  *
1024  * SACK block validation.
1025  * ----------------------
1026  *
1027  * SACK block range validation checks that the received SACK block fits to
1028  * the expected sequence limits, i.e., it is between SND.UNA and SND.NXT.
1029  * Note that SND.UNA is not included to the range though being valid because
1030  * it means that the receiver is rather inconsistent with itself reporting
1031  * SACK reneging when it should advance SND.UNA. Such SACK block this is
1032  * perfectly valid, however, in light of RFC2018 which explicitly states
1033  * that "SACK block MUST reflect the newest segment.  Even if the newest
1034  * segment is going to be discarded ...", not that it looks very clever
1035  * in case of head skb. Due to potentional receiver driven attacks, we
1036  * choose to avoid immediate execution of a walk in write queue due to
1037  * reneging and defer head skb's loss recovery to standard loss recovery
1038  * procedure that will eventually trigger (nothing forbids us doing this).
1039  *
1040  * Implements also blockage to start_seq wrap-around. Problem lies in the
1041  * fact that though start_seq (s) is before end_seq (i.e., not reversed),
1042  * there's no guarantee that it will be before snd_nxt (n). The problem
1043  * happens when start_seq resides between end_seq wrap (e_w) and snd_nxt
1044  * wrap (s_w):
1045  *
1046  *         <- outs wnd ->                          <- wrapzone ->
1047  *         u     e      n                         u_w   e_w  s n_w
1048  *         |     |      |                          |     |   |  |
1049  * |<------------+------+----- TCP seqno space --------------+---------->|
1050  * ...-- <2^31 ->|                                           |<--------...
1051  * ...---- >2^31 ------>|                                    |<--------...
1052  *
1053  * Current code wouldn't be vulnerable but it's better still to discard such
1054  * crazy SACK blocks. Doing this check for start_seq alone closes somewhat
1055  * similar case (end_seq after snd_nxt wrap) as earlier reversed check in
1056  * snd_nxt wrap -> snd_una region will then become "well defined", i.e.,
1057  * equal to the ideal case (infinite seqno space without wrap caused issues).
1058  *
1059  * With D-SACK the lower bound is extended to cover sequence space below
1060  * SND.UNA down to undo_marker, which is the last point of interest. Yet
1061  * again, D-SACK block must not to go across snd_una (for the same reason as
1062  * for the normal SACK blocks, explained above). But there all simplicity
1063  * ends, TCP might receive valid D-SACKs below that. As long as they reside
1064  * fully below undo_marker they do not affect behavior in anyway and can
1065  * therefore be safely ignored. In rare cases (which are more or less
1066  * theoretical ones), the D-SACK will nicely cross that boundary due to skb
1067  * fragmentation and packet reordering past skb's retransmission. To consider
1068  * them correctly, the acceptable range must be extended even more though
1069  * the exact amount is rather hard to quantify. However, tp->max_window can
1070  * be used as an exaggerated estimate.
1071  */
1072 static int tcp_is_sackblock_valid(struct tcp_sock *tp, int is_dsack,
1073                                   u32 start_seq, u32 end_seq)
1074 {
1075         /* Too far in future, or reversed (interpretation is ambiguous) */
1076         if (after(end_seq, tp->snd_nxt) || !before(start_seq, end_seq))
1077                 return 0;
1078
1079         /* Nasty start_seq wrap-around check (see comments above) */
1080         if (!before(start_seq, tp->snd_nxt))
1081                 return 0;
1082
1083         /* In outstanding window? ...This is valid exit for D-SACKs too.
1084          * start_seq == snd_una is non-sensical (see comments above)
1085          */
1086         if (after(start_seq, tp->snd_una))
1087                 return 1;
1088
1089         if (!is_dsack || !tp->undo_marker)
1090                 return 0;
1091
1092         /* ...Then it's D-SACK, and must reside below snd_una completely */
1093         if (!after(end_seq, tp->snd_una))
1094                 return 0;
1095
1096         if (!before(start_seq, tp->undo_marker))
1097                 return 1;
1098
1099         /* Too old */
1100         if (!after(end_seq, tp->undo_marker))
1101                 return 0;
1102
1103         /* Undo_marker boundary crossing (overestimates a lot). Known already:
1104          *   start_seq < undo_marker and end_seq >= undo_marker.
1105          */
1106         return !before(start_seq, end_seq - tp->max_window);
1107 }
1108
1109 /* Check for lost retransmit. This superb idea is borrowed from "ratehalving".
1110  * Event "C". Later note: FACK people cheated me again 8), we have to account
1111  * for reordering! Ugly, but should help.
1112  *
1113  * Search retransmitted skbs from write_queue that were sent when snd_nxt was
1114  * less than what is now known to be received by the other end (derived from
1115  * highest SACK block). Also calculate the lowest snd_nxt among the remaining
1116  * retransmitted skbs to avoid some costly processing per ACKs.
1117  */
1118 static void tcp_mark_lost_retrans(struct sock *sk)
1119 {
1120         const struct inet_connection_sock *icsk = inet_csk(sk);
1121         struct tcp_sock *tp = tcp_sk(sk);
1122         struct sk_buff *skb;
1123         int cnt = 0;
1124         u32 new_low_seq = tp->snd_nxt;
1125         u32 received_upto = tcp_highest_sack_seq(tp);
1126
1127         if (!tcp_is_fack(tp) || !tp->retrans_out ||
1128             !after(received_upto, tp->lost_retrans_low) ||
1129             icsk->icsk_ca_state != TCP_CA_Recovery)
1130                 return;
1131
1132         tcp_for_write_queue(skb, sk) {
1133                 u32 ack_seq = TCP_SKB_CB(skb)->ack_seq;
1134
1135                 if (skb == tcp_send_head(sk))
1136                         break;
1137                 if (cnt == tp->retrans_out)
1138                         break;
1139                 if (!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
1140                         continue;
1141
1142                 if (!(TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS))
1143                         continue;
1144
1145                 if (after(received_upto, ack_seq) &&
1146                     (tcp_is_fack(tp) ||
1147                      !before(received_upto,
1148                              ack_seq + tp->reordering * tp->mss_cache))) {
1149                         TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
1150                         tp->retrans_out -= tcp_skb_pcount(skb);
1151
1152                         /* clear lost hint */
1153                         tp->retransmit_skb_hint = NULL;
1154
1155                         if (!(TCP_SKB_CB(skb)->sacked & (TCPCB_LOST|TCPCB_SACKED_ACKED))) {
1156                                 tp->lost_out += tcp_skb_pcount(skb);
1157                                 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1158                         }
1159                         NET_INC_STATS_BH(LINUX_MIB_TCPLOSTRETRANSMIT);
1160                 } else {
1161                         if (before(ack_seq, new_low_seq))
1162                                 new_low_seq = ack_seq;
1163                         cnt += tcp_skb_pcount(skb);
1164                 }
1165         }
1166
1167         if (tp->retrans_out)
1168                 tp->lost_retrans_low = new_low_seq;
1169 }
1170
1171 static int tcp_check_dsack(struct tcp_sock *tp, struct sk_buff *ack_skb,
1172                            struct tcp_sack_block_wire *sp, int num_sacks,
1173                            u32 prior_snd_una)
1174 {
1175         u32 start_seq_0 = ntohl(get_unaligned(&sp[0].start_seq));
1176         u32 end_seq_0 = ntohl(get_unaligned(&sp[0].end_seq));
1177         int dup_sack = 0;
1178
1179         if (before(start_seq_0, TCP_SKB_CB(ack_skb)->ack_seq)) {
1180                 dup_sack = 1;
1181                 tcp_dsack_seen(tp);
1182                 NET_INC_STATS_BH(LINUX_MIB_TCPDSACKRECV);
1183         } else if (num_sacks > 1) {
1184                 u32 end_seq_1 = ntohl(get_unaligned(&sp[1].end_seq));
1185                 u32 start_seq_1 = ntohl(get_unaligned(&sp[1].start_seq));
1186
1187                 if (!after(end_seq_0, end_seq_1) &&
1188                     !before(start_seq_0, start_seq_1)) {
1189                         dup_sack = 1;
1190                         tcp_dsack_seen(tp);
1191                         NET_INC_STATS_BH(LINUX_MIB_TCPDSACKOFORECV);
1192                 }
1193         }
1194
1195         /* D-SACK for already forgotten data... Do dumb counting. */
1196         if (dup_sack &&
1197             !after(end_seq_0, prior_snd_una) &&
1198             after(end_seq_0, tp->undo_marker))
1199                 tp->undo_retrans--;
1200
1201         return dup_sack;
1202 }
1203
1204 /* Check if skb is fully within the SACK block. In presence of GSO skbs,
1205  * the incoming SACK may not exactly match but we can find smaller MSS
1206  * aligned portion of it that matches. Therefore we might need to fragment
1207  * which may fail and creates some hassle (caller must handle error case
1208  * returns).
1209  */
1210 static int tcp_match_skb_to_sack(struct sock *sk, struct sk_buff *skb,
1211                                  u32 start_seq, u32 end_seq)
1212 {
1213         int in_sack, err;
1214         unsigned int pkt_len;
1215
1216         in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq) &&
1217                   !before(end_seq, TCP_SKB_CB(skb)->end_seq);
1218
1219         if (tcp_skb_pcount(skb) > 1 && !in_sack &&
1220             after(TCP_SKB_CB(skb)->end_seq, start_seq)) {
1221
1222                 in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq);
1223
1224                 if (!in_sack)
1225                         pkt_len = start_seq - TCP_SKB_CB(skb)->seq;
1226                 else
1227                         pkt_len = end_seq - TCP_SKB_CB(skb)->seq;
1228                 err = tcp_fragment(sk, skb, pkt_len, skb_shinfo(skb)->gso_size);
1229                 if (err < 0)
1230                         return err;
1231         }
1232
1233         return in_sack;
1234 }
1235
1236 static int tcp_sacktag_one(struct sk_buff *skb, struct sock *sk,
1237                            int *reord, int dup_sack, int fack_count)
1238 {
1239         struct tcp_sock *tp = tcp_sk(sk);
1240         u8 sacked = TCP_SKB_CB(skb)->sacked;
1241         int flag = 0;
1242
1243         /* Account D-SACK for retransmitted packet. */
1244         if (dup_sack && (sacked & TCPCB_RETRANS)) {
1245                 if (after(TCP_SKB_CB(skb)->end_seq, tp->undo_marker))
1246                         tp->undo_retrans--;
1247                 if (sacked & TCPCB_SACKED_ACKED)
1248                         *reord = min(fack_count, *reord);
1249         }
1250
1251         /* Nothing to do; acked frame is about to be dropped (was ACKed). */
1252         if (!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
1253                 return flag;
1254
1255         if (!(sacked & TCPCB_SACKED_ACKED)) {
1256                 if (sacked & TCPCB_SACKED_RETRANS) {
1257                         /* If the segment is not tagged as lost,
1258                          * we do not clear RETRANS, believing
1259                          * that retransmission is still in flight.
1260                          */
1261                         if (sacked & TCPCB_LOST) {
1262                                 TCP_SKB_CB(skb)->sacked &=
1263                                         ~(TCPCB_LOST|TCPCB_SACKED_RETRANS);
1264                                 tp->lost_out -= tcp_skb_pcount(skb);
1265                                 tp->retrans_out -= tcp_skb_pcount(skb);
1266
1267                                 /* clear lost hint */
1268                                 tp->retransmit_skb_hint = NULL;
1269                         }
1270                 } else {
1271                         if (!(sacked & TCPCB_RETRANS)) {
1272                                 /* New sack for not retransmitted frame,
1273                                  * which was in hole. It is reordering.
1274                                  */
1275                                 if (before(TCP_SKB_CB(skb)->seq,
1276                                            tcp_highest_sack_seq(tp)))
1277                                         *reord = min(fack_count, *reord);
1278
1279                                 /* SACK enhanced F-RTO (RFC4138; Appendix B) */
1280                                 if (!after(TCP_SKB_CB(skb)->end_seq, tp->frto_highmark))
1281                                         flag |= FLAG_ONLY_ORIG_SACKED;
1282                         }
1283
1284                         if (sacked & TCPCB_LOST) {
1285                                 TCP_SKB_CB(skb)->sacked &= ~TCPCB_LOST;
1286                                 tp->lost_out -= tcp_skb_pcount(skb);
1287
1288                                 /* clear lost hint */
1289                                 tp->retransmit_skb_hint = NULL;
1290                         }
1291                 }
1292
1293                 TCP_SKB_CB(skb)->sacked |= TCPCB_SACKED_ACKED;
1294                 flag |= FLAG_DATA_SACKED;
1295                 tp->sacked_out += tcp_skb_pcount(skb);
1296
1297                 fack_count += tcp_skb_pcount(skb);
1298
1299                 /* Lost marker hint past SACKed? Tweak RFC3517 cnt */
1300                 if (!tcp_is_fack(tp) && (tp->lost_skb_hint != NULL) &&
1301                     before(TCP_SKB_CB(skb)->seq,
1302                            TCP_SKB_CB(tp->lost_skb_hint)->seq))
1303                         tp->lost_cnt_hint += tcp_skb_pcount(skb);
1304
1305                 if (fack_count > tp->fackets_out)
1306                         tp->fackets_out = fack_count;
1307
1308                 if (!before(TCP_SKB_CB(skb)->seq, tcp_highest_sack_seq(tp)))
1309                         tcp_advance_highest_sack(sk, skb);
1310         }
1311
1312         /* D-SACK. We can detect redundant retransmission in S|R and plain R
1313          * frames and clear it. undo_retrans is decreased above, L|R frames
1314          * are accounted above as well.
1315          */
1316         if (dup_sack && (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS)) {
1317                 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
1318                 tp->retrans_out -= tcp_skb_pcount(skb);
1319                 tp->retransmit_skb_hint = NULL;
1320         }
1321
1322         return flag;
1323 }
1324
1325 static struct sk_buff *tcp_sacktag_walk(struct sk_buff *skb, struct sock *sk,
1326                                         struct tcp_sack_block *next_dup,
1327                                         u32 start_seq, u32 end_seq,
1328                                         int dup_sack_in, int *fack_count,
1329                                         int *reord, int *flag)
1330 {
1331         tcp_for_write_queue_from(skb, sk) {
1332                 int in_sack = 0;
1333                 int dup_sack = dup_sack_in;
1334
1335                 if (skb == tcp_send_head(sk))
1336                         break;
1337
1338                 /* queue is in-order => we can short-circuit the walk early */
1339                 if (!before(TCP_SKB_CB(skb)->seq, end_seq))
1340                         break;
1341
1342                 if ((next_dup != NULL) &&
1343                     before(TCP_SKB_CB(skb)->seq, next_dup->end_seq)) {
1344                         in_sack = tcp_match_skb_to_sack(sk, skb,
1345                                                         next_dup->start_seq,
1346                                                         next_dup->end_seq);
1347                         if (in_sack > 0)
1348                                 dup_sack = 1;
1349                 }
1350
1351                 if (in_sack <= 0)
1352                         in_sack = tcp_match_skb_to_sack(sk, skb, start_seq,
1353                                                         end_seq);
1354                 if (unlikely(in_sack < 0))
1355                         break;
1356
1357                 if (in_sack)
1358                         *flag |= tcp_sacktag_one(skb, sk, reord, dup_sack,
1359                                                  *fack_count);
1360
1361                 *fack_count += tcp_skb_pcount(skb);
1362         }
1363         return skb;
1364 }
1365
1366 /* Avoid all extra work that is being done by sacktag while walking in
1367  * a normal way
1368  */
1369 static struct sk_buff *tcp_sacktag_skip(struct sk_buff *skb, struct sock *sk,
1370                                         u32 skip_to_seq, int *fack_count)
1371 {
1372         tcp_for_write_queue_from(skb, sk) {
1373                 if (skb == tcp_send_head(sk))
1374                         break;
1375
1376                 if (!before(TCP_SKB_CB(skb)->end_seq, skip_to_seq))
1377                         break;
1378
1379                 *fack_count += tcp_skb_pcount(skb);
1380         }
1381         return skb;
1382 }
1383
1384 static struct sk_buff *tcp_maybe_skipping_dsack(struct sk_buff *skb,
1385                                                 struct sock *sk,
1386                                                 struct tcp_sack_block *next_dup,
1387                                                 u32 skip_to_seq,
1388                                                 int *fack_count, int *reord,
1389                                                 int *flag)
1390 {
1391         if (next_dup == NULL)
1392                 return skb;
1393
1394         if (before(next_dup->start_seq, skip_to_seq)) {
1395                 skb = tcp_sacktag_skip(skb, sk, next_dup->start_seq, fack_count);
1396                 tcp_sacktag_walk(skb, sk, NULL,
1397                                  next_dup->start_seq, next_dup->end_seq,
1398                                  1, fack_count, reord, flag);
1399         }
1400
1401         return skb;
1402 }
1403
1404 static int tcp_sack_cache_ok(struct tcp_sock *tp, struct tcp_sack_block *cache)
1405 {
1406         return cache < tp->recv_sack_cache + ARRAY_SIZE(tp->recv_sack_cache);
1407 }
1408
1409 static int
1410 tcp_sacktag_write_queue(struct sock *sk, struct sk_buff *ack_skb,
1411                         u32 prior_snd_una)
1412 {
1413         const struct inet_connection_sock *icsk = inet_csk(sk);
1414         struct tcp_sock *tp = tcp_sk(sk);
1415         unsigned char *ptr = (skb_transport_header(ack_skb) +
1416                               TCP_SKB_CB(ack_skb)->sacked);
1417         struct tcp_sack_block_wire *sp_wire = (struct tcp_sack_block_wire *)(ptr+2);
1418         struct tcp_sack_block sp[4];
1419         struct tcp_sack_block *cache;
1420         struct sk_buff *skb;
1421         int num_sacks = (ptr[1] - TCPOLEN_SACK_BASE) >> 3;
1422         int used_sacks;
1423         int reord = tp->packets_out;
1424         int flag = 0;
1425         int found_dup_sack = 0;
1426         int fack_count;
1427         int i, j;
1428         int first_sack_index;
1429
1430         if (!tp->sacked_out) {
1431                 if (WARN_ON(tp->fackets_out))
1432                         tp->fackets_out = 0;
1433                 tcp_highest_sack_reset(sk);
1434         }
1435
1436         found_dup_sack = tcp_check_dsack(tp, ack_skb, sp_wire,
1437                                          num_sacks, prior_snd_una);
1438         if (found_dup_sack)
1439                 flag |= FLAG_DSACKING_ACK;
1440
1441         /* Eliminate too old ACKs, but take into
1442          * account more or less fresh ones, they can
1443          * contain valid SACK info.
1444          */
1445         if (before(TCP_SKB_CB(ack_skb)->ack_seq, prior_snd_una - tp->max_window))
1446                 return 0;
1447
1448         if (!tp->packets_out)
1449                 goto out;
1450
1451         used_sacks = 0;
1452         first_sack_index = 0;
1453         for (i = 0; i < num_sacks; i++) {
1454                 int dup_sack = !i && found_dup_sack;
1455
1456                 sp[used_sacks].start_seq = ntohl(get_unaligned(&sp_wire[i].start_seq));
1457                 sp[used_sacks].end_seq = ntohl(get_unaligned(&sp_wire[i].end_seq));
1458
1459                 if (!tcp_is_sackblock_valid(tp, dup_sack,
1460                                             sp[used_sacks].start_seq,
1461                                             sp[used_sacks].end_seq)) {
1462                         if (dup_sack) {
1463                                 if (!tp->undo_marker)
1464                                         NET_INC_STATS_BH(LINUX_MIB_TCPDSACKIGNOREDNOUNDO);
1465                                 else
1466                                         NET_INC_STATS_BH(LINUX_MIB_TCPDSACKIGNOREDOLD);
1467                         } else {
1468                                 /* Don't count olds caused by ACK reordering */
1469                                 if ((TCP_SKB_CB(ack_skb)->ack_seq != tp->snd_una) &&
1470                                     !after(sp[used_sacks].end_seq, tp->snd_una))
1471                                         continue;
1472                                 NET_INC_STATS_BH(LINUX_MIB_TCPSACKDISCARD);
1473                         }
1474                         if (i == 0)
1475                                 first_sack_index = -1;
1476                         continue;
1477                 }
1478
1479                 /* Ignore very old stuff early */
1480                 if (!after(sp[used_sacks].end_seq, prior_snd_una))
1481                         continue;
1482
1483                 used_sacks++;
1484         }
1485
1486         /* order SACK blocks to allow in order walk of the retrans queue */
1487         for (i = used_sacks - 1; i > 0; i--) {
1488                 for (j = 0; j < i; j++) {
1489                         if (after(sp[j].start_seq, sp[j + 1].start_seq)) {
1490                                 struct tcp_sack_block tmp;
1491
1492                                 tmp = sp[j];
1493                                 sp[j] = sp[j + 1];
1494                                 sp[j + 1] = tmp;
1495
1496                                 /* Track where the first SACK block goes to */
1497                                 if (j == first_sack_index)
1498                                         first_sack_index = j + 1;
1499                         }
1500                 }
1501         }
1502
1503         skb = tcp_write_queue_head(sk);
1504         fack_count = 0;
1505         i = 0;
1506
1507         if (!tp->sacked_out) {
1508                 /* It's already past, so skip checking against it */
1509                 cache = tp->recv_sack_cache + ARRAY_SIZE(tp->recv_sack_cache);
1510         } else {
1511                 cache = tp->recv_sack_cache;
1512                 /* Skip empty blocks in at head of the cache */
1513                 while (tcp_sack_cache_ok(tp, cache) && !cache->start_seq &&
1514                        !cache->end_seq)
1515                         cache++;
1516         }
1517
1518         while (i < used_sacks) {
1519                 u32 start_seq = sp[i].start_seq;
1520                 u32 end_seq = sp[i].end_seq;
1521                 int dup_sack = (found_dup_sack && (i == first_sack_index));
1522                 struct tcp_sack_block *next_dup = NULL;
1523
1524                 if (found_dup_sack && ((i + 1) == first_sack_index))
1525                         next_dup = &sp[i + 1];
1526
1527                 /* Event "B" in the comment above. */
1528                 if (after(end_seq, tp->high_seq))
1529                         flag |= FLAG_DATA_LOST;
1530
1531                 /* Skip too early cached blocks */
1532                 while (tcp_sack_cache_ok(tp, cache) &&
1533                        !before(start_seq, cache->end_seq))
1534                         cache++;
1535
1536                 /* Can skip some work by looking recv_sack_cache? */
1537                 if (tcp_sack_cache_ok(tp, cache) && !dup_sack &&
1538                     after(end_seq, cache->start_seq)) {
1539
1540                         /* Head todo? */
1541                         if (before(start_seq, cache->start_seq)) {
1542                                 skb = tcp_sacktag_skip(skb, sk, start_seq,
1543                                                        &fack_count);
1544                                 skb = tcp_sacktag_walk(skb, sk, next_dup,
1545                                                        start_seq,
1546                                                        cache->start_seq,
1547                                                        dup_sack, &fack_count,
1548                                                        &reord, &flag);
1549                         }
1550
1551                         /* Rest of the block already fully processed? */
1552                         if (!after(end_seq, cache->end_seq))
1553                                 goto advance_sp;
1554
1555                         skb = tcp_maybe_skipping_dsack(skb, sk, next_dup,
1556                                                        cache->end_seq,
1557                                                        &fack_count, &reord,
1558                                                        &flag);
1559
1560                         /* ...tail remains todo... */
1561                         if (tcp_highest_sack_seq(tp) == cache->end_seq) {
1562                                 /* ...but better entrypoint exists! */
1563                                 skb = tcp_highest_sack(sk);
1564                                 if (skb == NULL)
1565                                         break;
1566                                 fack_count = tp->fackets_out;
1567                                 cache++;
1568                                 goto walk;
1569                         }
1570
1571                         skb = tcp_sacktag_skip(skb, sk, cache->end_seq,
1572                                                &fack_count);
1573                         /* Check overlap against next cached too (past this one already) */
1574                         cache++;
1575                         continue;
1576                 }
1577
1578                 if (!before(start_seq, tcp_highest_sack_seq(tp))) {
1579                         skb = tcp_highest_sack(sk);
1580                         if (skb == NULL)
1581                                 break;
1582                         fack_count = tp->fackets_out;
1583                 }
1584                 skb = tcp_sacktag_skip(skb, sk, start_seq, &fack_count);
1585
1586 walk:
1587                 skb = tcp_sacktag_walk(skb, sk, next_dup, start_seq, end_seq,
1588                                        dup_sack, &fack_count, &reord, &flag);
1589
1590 advance_sp:
1591                 /* SACK enhanced FRTO (RFC4138, Appendix B): Clearing correct
1592                  * due to in-order walk
1593                  */
1594                 if (after(end_seq, tp->frto_highmark))
1595                         flag &= ~FLAG_ONLY_ORIG_SACKED;
1596
1597                 i++;
1598         }
1599
1600         /* Clear the head of the cache sack blocks so we can skip it next time */
1601         for (i = 0; i < ARRAY_SIZE(tp->recv_sack_cache) - used_sacks; i++) {
1602                 tp->recv_sack_cache[i].start_seq = 0;
1603                 tp->recv_sack_cache[i].end_seq = 0;
1604         }
1605         for (j = 0; j < used_sacks; j++)
1606                 tp->recv_sack_cache[i++] = sp[j];
1607
1608         tcp_mark_lost_retrans(sk);
1609
1610         tcp_verify_left_out(tp);
1611
1612         if ((reord < tp->fackets_out) &&
1613             ((icsk->icsk_ca_state != TCP_CA_Loss) || tp->undo_marker) &&
1614             (!tp->frto_highmark || after(tp->snd_una, tp->frto_highmark)))
1615                 tcp_update_reordering(sk, tp->fackets_out - reord, 0);
1616
1617 out:
1618
1619 #if FASTRETRANS_DEBUG > 0
1620         BUG_TRAP((int)tp->sacked_out >= 0);
1621         BUG_TRAP((int)tp->lost_out >= 0);
1622         BUG_TRAP((int)tp->retrans_out >= 0);
1623         BUG_TRAP((int)tcp_packets_in_flight(tp) >= 0);
1624 #endif
1625         return flag;
1626 }
1627
1628 /* Limits sacked_out so that sum with lost_out isn't ever larger than
1629  * packets_out. Returns zero if sacked_out adjustement wasn't necessary.
1630  */
1631 int tcp_limit_reno_sacked(struct tcp_sock *tp)
1632 {
1633         u32 holes;
1634
1635         holes = max(tp->lost_out, 1U);
1636         holes = min(holes, tp->packets_out);
1637
1638         if ((tp->sacked_out + holes) > tp->packets_out) {
1639                 tp->sacked_out = tp->packets_out - holes;
1640                 return 1;
1641         }
1642         return 0;
1643 }
1644
1645 /* If we receive more dupacks than we expected counting segments
1646  * in assumption of absent reordering, interpret this as reordering.
1647  * The only another reason could be bug in receiver TCP.
1648  */
1649 static void tcp_check_reno_reordering(struct sock *sk, const int addend)
1650 {
1651         struct tcp_sock *tp = tcp_sk(sk);
1652         if (tcp_limit_reno_sacked(tp))
1653                 tcp_update_reordering(sk, tp->packets_out + addend, 0);
1654 }
1655
1656 /* Emulate SACKs for SACKless connection: account for a new dupack. */
1657
1658 static void tcp_add_reno_sack(struct sock *sk)
1659 {
1660         struct tcp_sock *tp = tcp_sk(sk);
1661         tp->sacked_out++;
1662         tcp_check_reno_reordering(sk, 0);
1663         tcp_verify_left_out(tp);
1664 }
1665
1666 /* Account for ACK, ACKing some data in Reno Recovery phase. */
1667
1668 static void tcp_remove_reno_sacks(struct sock *sk, int acked)
1669 {
1670         struct tcp_sock *tp = tcp_sk(sk);
1671
1672         if (acked > 0) {
1673                 /* One ACK acked hole. The rest eat duplicate ACKs. */
1674                 if (acked - 1 >= tp->sacked_out)
1675                         tp->sacked_out = 0;
1676                 else
1677                         tp->sacked_out -= acked - 1;
1678         }
1679         tcp_check_reno_reordering(sk, acked);
1680         tcp_verify_left_out(tp);
1681 }
1682
1683 static inline void tcp_reset_reno_sack(struct tcp_sock *tp)
1684 {
1685         tp->sacked_out = 0;
1686 }
1687
1688 /* F-RTO can only be used if TCP has never retransmitted anything other than
1689  * head (SACK enhanced variant from Appendix B of RFC4138 is more robust here)
1690  */
1691 int tcp_use_frto(struct sock *sk)
1692 {
1693         const struct tcp_sock *tp = tcp_sk(sk);
1694         struct sk_buff *skb;
1695
1696         if (!sysctl_tcp_frto)
1697                 return 0;
1698
1699         if (IsSackFrto())
1700                 return 1;
1701
1702         /* Avoid expensive walking of rexmit queue if possible */
1703         if (tp->retrans_out > 1)
1704                 return 0;
1705
1706         skb = tcp_write_queue_head(sk);
1707         skb = tcp_write_queue_next(sk, skb);    /* Skips head */
1708         tcp_for_write_queue_from(skb, sk) {
1709                 if (skb == tcp_send_head(sk))
1710                         break;
1711                 if (TCP_SKB_CB(skb)->sacked & TCPCB_RETRANS)
1712                         return 0;
1713                 /* Short-circuit when first non-SACKed skb has been checked */
1714                 if (!(TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED))
1715                         break;
1716         }
1717         return 1;
1718 }
1719
1720 /* RTO occurred, but do not yet enter Loss state. Instead, defer RTO
1721  * recovery a bit and use heuristics in tcp_process_frto() to detect if
1722  * the RTO was spurious. Only clear SACKED_RETRANS of the head here to
1723  * keep retrans_out counting accurate (with SACK F-RTO, other than head
1724  * may still have that bit set); TCPCB_LOST and remaining SACKED_RETRANS
1725  * bits are handled if the Loss state is really to be entered (in
1726  * tcp_enter_frto_loss).
1727  *
1728  * Do like tcp_enter_loss() would; when RTO expires the second time it
1729  * does:
1730  *  "Reduce ssthresh if it has not yet been made inside this window."
1731  */
1732 void tcp_enter_frto(struct sock *sk)
1733 {
1734         const struct inet_connection_sock *icsk = inet_csk(sk);
1735         struct tcp_sock *tp = tcp_sk(sk);
1736         struct sk_buff *skb;
1737
1738         if ((!tp->frto_counter && icsk->icsk_ca_state <= TCP_CA_Disorder) ||
1739             tp->snd_una == tp->high_seq ||
1740             ((icsk->icsk_ca_state == TCP_CA_Loss || tp->frto_counter) &&
1741              !icsk->icsk_retransmits)) {
1742                 tp->prior_ssthresh = tcp_current_ssthresh(sk);
1743                 /* Our state is too optimistic in ssthresh() call because cwnd
1744                  * is not reduced until tcp_enter_frto_loss() when previous F-RTO
1745                  * recovery has not yet completed. Pattern would be this: RTO,
1746                  * Cumulative ACK, RTO (2xRTO for the same segment does not end
1747                  * up here twice).
1748                  * RFC4138 should be more specific on what to do, even though
1749                  * RTO is quite unlikely to occur after the first Cumulative ACK
1750                  * due to back-off and complexity of triggering events ...
1751                  */
1752                 if (tp->frto_counter) {
1753                         u32 stored_cwnd;
1754                         stored_cwnd = tp->snd_cwnd;
1755                         tp->snd_cwnd = 2;
1756                         tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
1757                         tp->snd_cwnd = stored_cwnd;
1758                 } else {
1759                         tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
1760                 }
1761                 /* ... in theory, cong.control module could do "any tricks" in
1762                  * ssthresh(), which means that ca_state, lost bits and lost_out
1763                  * counter would have to be faked before the call occurs. We
1764                  * consider that too expensive, unlikely and hacky, so modules
1765                  * using these in ssthresh() must deal these incompatibility
1766                  * issues if they receives CA_EVENT_FRTO and frto_counter != 0
1767                  */
1768                 tcp_ca_event(sk, CA_EVENT_FRTO);
1769         }
1770
1771         tp->undo_marker = tp->snd_una;
1772         tp->undo_retrans = 0;
1773
1774         skb = tcp_write_queue_head(sk);
1775         if (TCP_SKB_CB(skb)->sacked & TCPCB_RETRANS)
1776                 tp->undo_marker = 0;
1777         if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) {
1778                 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
1779                 tp->retrans_out -= tcp_skb_pcount(skb);
1780         }
1781         tcp_verify_left_out(tp);
1782
1783         /* Too bad if TCP was application limited */
1784         tp->snd_cwnd = min(tp->snd_cwnd, tcp_packets_in_flight(tp) + 1);
1785
1786         /* Earlier loss recovery underway (see RFC4138; Appendix B).
1787          * The last condition is necessary at least in tp->frto_counter case.
1788          */
1789         if (IsSackFrto() && (tp->frto_counter ||
1790             ((1 << icsk->icsk_ca_state) & (TCPF_CA_Recovery|TCPF_CA_Loss))) &&
1791             after(tp->high_seq, tp->snd_una)) {
1792                 tp->frto_highmark = tp->high_seq;
1793         } else {
1794                 tp->frto_highmark = tp->snd_nxt;
1795         }
1796         tcp_set_ca_state(sk, TCP_CA_Disorder);
1797         tp->high_seq = tp->snd_nxt;
1798         tp->frto_counter = 1;
1799 }
1800
1801 /* Enter Loss state after F-RTO was applied. Dupack arrived after RTO,
1802  * which indicates that we should follow the traditional RTO recovery,
1803  * i.e. mark everything lost and do go-back-N retransmission.
1804  */
1805 static void tcp_enter_frto_loss(struct sock *sk, int allowed_segments, int flag)
1806 {
1807         struct tcp_sock *tp = tcp_sk(sk);
1808         struct sk_buff *skb;
1809
1810         tp->lost_out = 0;
1811         tp->retrans_out = 0;
1812         if (tcp_is_reno(tp))
1813                 tcp_reset_reno_sack(tp);
1814
1815         tcp_for_write_queue(skb, sk) {
1816                 if (skb == tcp_send_head(sk))
1817                         break;
1818
1819                 TCP_SKB_CB(skb)->sacked &= ~TCPCB_LOST;
1820                 /*
1821                  * Count the retransmission made on RTO correctly (only when
1822                  * waiting for the first ACK and did not get it)...
1823                  */
1824                 if ((tp->frto_counter == 1) && !(flag & FLAG_DATA_ACKED)) {
1825                         /* For some reason this R-bit might get cleared? */
1826                         if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS)
1827                                 tp->retrans_out += tcp_skb_pcount(skb);
1828                         /* ...enter this if branch just for the first segment */
1829                         flag |= FLAG_DATA_ACKED;
1830                 } else {
1831                         if (TCP_SKB_CB(skb)->sacked & TCPCB_RETRANS)
1832                                 tp->undo_marker = 0;
1833                         TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
1834                 }
1835
1836                 /* Don't lost mark skbs that were fwd transmitted after RTO */
1837                 if (!(TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED) &&
1838                     !after(TCP_SKB_CB(skb)->end_seq, tp->frto_highmark)) {
1839                         TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1840                         tp->lost_out += tcp_skb_pcount(skb);
1841                 }
1842         }
1843         tcp_verify_left_out(tp);
1844
1845         tp->snd_cwnd = tcp_packets_in_flight(tp) + allowed_segments;
1846         tp->snd_cwnd_cnt = 0;
1847         tp->snd_cwnd_stamp = tcp_time_stamp;
1848         tp->frto_counter = 0;
1849         tp->bytes_acked = 0;
1850
1851         tp->reordering = min_t(unsigned int, tp->reordering,
1852                                sysctl_tcp_reordering);
1853         tcp_set_ca_state(sk, TCP_CA_Loss);
1854         tp->high_seq = tp->frto_highmark;
1855         TCP_ECN_queue_cwr(tp);
1856
1857         tcp_clear_retrans_hints_partial(tp);
1858 }
1859
1860 static void tcp_clear_retrans_partial(struct tcp_sock *tp)
1861 {
1862         tp->retrans_out = 0;
1863         tp->lost_out = 0;
1864
1865         tp->undo_marker = 0;
1866         tp->undo_retrans = 0;
1867 }
1868
1869 void tcp_clear_retrans(struct tcp_sock *tp)
1870 {
1871         tcp_clear_retrans_partial(tp);
1872
1873         tp->fackets_out = 0;
1874         tp->sacked_out = 0;
1875 }
1876
1877 /* Enter Loss state. If "how" is not zero, forget all SACK information
1878  * and reset tags completely, otherwise preserve SACKs. If receiver
1879  * dropped its ofo queue, we will know this due to reneging detection.
1880  */
1881 void tcp_enter_loss(struct sock *sk, int how)
1882 {
1883         const struct inet_connection_sock *icsk = inet_csk(sk);
1884         struct tcp_sock *tp = tcp_sk(sk);
1885         struct sk_buff *skb;
1886
1887         /* Reduce ssthresh if it has not yet been made inside this window. */
1888         if (icsk->icsk_ca_state <= TCP_CA_Disorder || tp->snd_una == tp->high_seq ||
1889             (icsk->icsk_ca_state == TCP_CA_Loss && !icsk->icsk_retransmits)) {
1890                 tp->prior_ssthresh = tcp_current_ssthresh(sk);
1891                 tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
1892                 tcp_ca_event(sk, CA_EVENT_LOSS);
1893         }
1894         tp->snd_cwnd       = 1;
1895         tp->snd_cwnd_cnt   = 0;
1896         tp->snd_cwnd_stamp = tcp_time_stamp;
1897
1898         tp->bytes_acked = 0;
1899         tcp_clear_retrans_partial(tp);
1900
1901         if (tcp_is_reno(tp))
1902                 tcp_reset_reno_sack(tp);
1903
1904         if (!how) {
1905                 /* Push undo marker, if it was plain RTO and nothing
1906                  * was retransmitted. */
1907                 tp->undo_marker = tp->snd_una;
1908                 tcp_clear_retrans_hints_partial(tp);
1909         } else {
1910                 tp->sacked_out = 0;
1911                 tp->fackets_out = 0;
1912                 tcp_clear_all_retrans_hints(tp);
1913         }
1914
1915         tcp_for_write_queue(skb, sk) {
1916                 if (skb == tcp_send_head(sk))
1917                         break;
1918
1919                 if (TCP_SKB_CB(skb)->sacked & TCPCB_RETRANS)
1920                         tp->undo_marker = 0;
1921                 TCP_SKB_CB(skb)->sacked &= (~TCPCB_TAGBITS)|TCPCB_SACKED_ACKED;
1922                 if (!(TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_ACKED) || how) {
1923                         TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_ACKED;
1924                         TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1925                         tp->lost_out += tcp_skb_pcount(skb);
1926                 }
1927         }
1928         tcp_verify_left_out(tp);
1929
1930         tp->reordering = min_t(unsigned int, tp->reordering,
1931                                sysctl_tcp_reordering);
1932         tcp_set_ca_state(sk, TCP_CA_Loss);
1933         tp->high_seq = tp->snd_nxt;
1934         TCP_ECN_queue_cwr(tp);
1935         /* Abort F-RTO algorithm if one is in progress */
1936         tp->frto_counter = 0;
1937 }
1938
1939 /* If ACK arrived pointing to a remembered SACK, it means that our
1940  * remembered SACKs do not reflect real state of receiver i.e.
1941  * receiver _host_ is heavily congested (or buggy).
1942  *
1943  * Do processing similar to RTO timeout.
1944  */
1945 static int tcp_check_sack_reneging(struct sock *sk, int flag)
1946 {
1947         if (flag & FLAG_SACK_RENEGING) {
1948                 struct inet_connection_sock *icsk = inet_csk(sk);
1949                 NET_INC_STATS_BH(LINUX_MIB_TCPSACKRENEGING);
1950
1951                 tcp_enter_loss(sk, 1);
1952                 icsk->icsk_retransmits++;
1953                 tcp_retransmit_skb(sk, tcp_write_queue_head(sk));
1954                 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
1955                                           icsk->icsk_rto, TCP_RTO_MAX);
1956                 return 1;
1957         }
1958         return 0;
1959 }
1960
1961 static inline int tcp_fackets_out(struct tcp_sock *tp)
1962 {
1963         return tcp_is_reno(tp) ? tp->sacked_out + 1 : tp->fackets_out;
1964 }
1965
1966 /* Heurestics to calculate number of duplicate ACKs. There's no dupACKs
1967  * counter when SACK is enabled (without SACK, sacked_out is used for
1968  * that purpose).
1969  *
1970  * Instead, with FACK TCP uses fackets_out that includes both SACKed
1971  * segments up to the highest received SACK block so far and holes in
1972  * between them.
1973  *
1974  * With reordering, holes may still be in flight, so RFC3517 recovery
1975  * uses pure sacked_out (total number of SACKed segments) even though
1976  * it violates the RFC that uses duplicate ACKs, often these are equal
1977  * but when e.g. out-of-window ACKs or packet duplication occurs,
1978  * they differ. Since neither occurs due to loss, TCP should really
1979  * ignore them.
1980  */
1981 static inline int tcp_dupack_heurestics(struct tcp_sock *tp)
1982 {
1983         return tcp_is_fack(tp) ? tp->fackets_out : tp->sacked_out + 1;
1984 }
1985
1986 static inline int tcp_skb_timedout(struct sock *sk, struct sk_buff *skb)
1987 {
1988         return (tcp_time_stamp - TCP_SKB_CB(skb)->when > inet_csk(sk)->icsk_rto);
1989 }
1990
1991 static inline int tcp_head_timedout(struct sock *sk)
1992 {
1993         struct tcp_sock *tp = tcp_sk(sk);
1994
1995         return tp->packets_out &&
1996                tcp_skb_timedout(sk, tcp_write_queue_head(sk));
1997 }
1998
1999 /* Linux NewReno/SACK/FACK/ECN state machine.
2000  * --------------------------------------
2001  *
2002  * "Open"       Normal state, no dubious events, fast path.
2003  * "Disorder"   In all the respects it is "Open",
2004  *              but requires a bit more attention. It is entered when
2005  *              we see some SACKs or dupacks. It is split of "Open"
2006  *              mainly to move some processing from fast path to slow one.
2007  * "CWR"        CWND was reduced due to some Congestion Notification event.
2008  *              It can be ECN, ICMP source quench, local device congestion.
2009  * "Recovery"   CWND was reduced, we are fast-retransmitting.
2010  * "Loss"       CWND was reduced due to RTO timeout or SACK reneging.
2011  *
2012  * tcp_fastretrans_alert() is entered:
2013  * - each incoming ACK, if state is not "Open"
2014  * - when arrived ACK is unusual, namely:
2015  *      * SACK
2016  *      * Duplicate ACK.
2017  *      * ECN ECE.
2018  *
2019  * Counting packets in flight is pretty simple.
2020  *
2021  *      in_flight = packets_out - left_out + retrans_out
2022  *
2023  *      packets_out is SND.NXT-SND.UNA counted in packets.
2024  *
2025  *      retrans_out is number of retransmitted segments.
2026  *
2027  *      left_out is number of segments left network, but not ACKed yet.
2028  *
2029  *              left_out = sacked_out + lost_out
2030  *
2031  *     sacked_out: Packets, which arrived to receiver out of order
2032  *                 and hence not ACKed. With SACKs this number is simply
2033  *                 amount of SACKed data. Even without SACKs
2034  *                 it is easy to give pretty reliable estimate of this number,
2035  *                 counting duplicate ACKs.
2036  *
2037  *       lost_out: Packets lost by network. TCP has no explicit
2038  *                 "loss notification" feedback from network (for now).
2039  *                 It means that this number can be only _guessed_.
2040  *                 Actually, it is the heuristics to predict lossage that
2041  *                 distinguishes different algorithms.
2042  *
2043  *      F.e. after RTO, when all the queue is considered as lost,
2044  *      lost_out = packets_out and in_flight = retrans_out.
2045  *
2046  *              Essentially, we have now two algorithms counting
2047  *              lost packets.
2048  *
2049  *              FACK: It is the simplest heuristics. As soon as we decided
2050  *              that something is lost, we decide that _all_ not SACKed
2051  *              packets until the most forward SACK are lost. I.e.
2052  *              lost_out = fackets_out - sacked_out and left_out = fackets_out.
2053  *              It is absolutely correct estimate, if network does not reorder
2054  *              packets. And it loses any connection to reality when reordering
2055  *              takes place. We use FACK by default until reordering
2056  *              is suspected on the path to this destination.
2057  *
2058  *              NewReno: when Recovery is entered, we assume that one segment
2059  *              is lost (classic Reno). While we are in Recovery and
2060  *              a partial ACK arrives, we assume that one more packet
2061  *              is lost (NewReno). This heuristics are the same in NewReno
2062  *              and SACK.
2063  *
2064  *  Imagine, that's all! Forget about all this shamanism about CWND inflation
2065  *  deflation etc. CWND is real congestion window, never inflated, changes
2066  *  only according to classic VJ rules.
2067  *
2068  * Really tricky (and requiring careful tuning) part of algorithm
2069  * is hidden in functions tcp_time_to_recover() and tcp_xmit_retransmit_queue().
2070  * The first determines the moment _when_ we should reduce CWND and,
2071  * hence, slow down forward transmission. In fact, it determines the moment
2072  * when we decide that hole is caused by loss, rather than by a reorder.
2073  *
2074  * tcp_xmit_retransmit_queue() decides, _what_ we should retransmit to fill
2075  * holes, caused by lost packets.
2076  *
2077  * And the most logically complicated part of algorithm is undo
2078  * heuristics. We detect false retransmits due to both too early
2079  * fast retransmit (reordering) and underestimated RTO, analyzing
2080  * timestamps and D-SACKs. When we detect that some segments were
2081  * retransmitted by mistake and CWND reduction was wrong, we undo
2082  * window reduction and abort recovery phase. This logic is hidden
2083  * inside several functions named tcp_try_undo_<something>.
2084  */
2085
2086 /* This function decides, when we should leave Disordered state
2087  * and enter Recovery phase, reducing congestion window.
2088  *
2089  * Main question: may we further continue forward transmission
2090  * with the same cwnd?
2091  */
2092 static int tcp_time_to_recover(struct sock *sk)
2093 {
2094         struct tcp_sock *tp = tcp_sk(sk);
2095         __u32 packets_out;
2096
2097         /* Do not perform any recovery during F-RTO algorithm */
2098         if (tp->frto_counter)
2099                 return 0;
2100
2101         /* Trick#1: The loss is proven. */
2102         if (tp->lost_out)
2103                 return 1;
2104
2105         /* Not-A-Trick#2 : Classic rule... */
2106         if (tcp_dupack_heurestics(tp) > tp->reordering)
2107                 return 1;
2108
2109         /* Trick#3 : when we use RFC2988 timer restart, fast
2110          * retransmit can be triggered by timeout of queue head.
2111          */
2112         if (tcp_is_fack(tp) && tcp_head_timedout(sk))
2113                 return 1;
2114
2115         /* Trick#4: It is still not OK... But will it be useful to delay
2116          * recovery more?
2117          */
2118         packets_out = tp->packets_out;
2119         if (packets_out <= tp->reordering &&
2120             tp->sacked_out >= max_t(__u32, packets_out/2, sysctl_tcp_reordering) &&
2121             !tcp_may_send_now(sk)) {
2122                 /* We have nothing to send. This connection is limited
2123                  * either by receiver window or by application.
2124                  */
2125                 return 1;
2126         }
2127
2128         return 0;
2129 }
2130
2131 /* RFC: This is from the original, I doubt that this is necessary at all:
2132  * clear xmit_retrans hint if seq of this skb is beyond hint. How could we
2133  * retransmitted past LOST markings in the first place? I'm not fully sure
2134  * about undo and end of connection cases, which can cause R without L?
2135  */
2136 static void tcp_verify_retransmit_hint(struct tcp_sock *tp, struct sk_buff *skb)
2137 {
2138         if ((tp->retransmit_skb_hint != NULL) &&
2139             before(TCP_SKB_CB(skb)->seq,
2140                    TCP_SKB_CB(tp->retransmit_skb_hint)->seq))
2141                 tp->retransmit_skb_hint = NULL;
2142 }
2143
2144 /* Mark head of queue up as lost. With RFC3517 SACK, the packets is
2145  * is against sacked "cnt", otherwise it's against facked "cnt"
2146  */
2147 static void tcp_mark_head_lost(struct sock *sk, int packets)
2148 {
2149         struct tcp_sock *tp = tcp_sk(sk);
2150         struct sk_buff *skb;
2151         int cnt, oldcnt;
2152         int err;
2153         unsigned int mss;
2154
2155         BUG_TRAP(packets <= tp->packets_out);
2156         if (tp->lost_skb_hint) {
2157                 skb = tp->lost_skb_hint;
2158                 cnt = tp->lost_cnt_hint;
2159         } else {
2160                 skb = tcp_write_queue_head(sk);
2161                 cnt = 0;
2162         }
2163
2164         tcp_for_write_queue_from(skb, sk) {
2165                 if (skb == tcp_send_head(sk))
2166                         break;
2167                 /* TODO: do this better */
2168                 /* this is not the most efficient way to do this... */
2169                 tp->lost_skb_hint = skb;
2170                 tp->lost_cnt_hint = cnt;
2171
2172                 if (after(TCP_SKB_CB(skb)->end_seq, tp->high_seq))
2173                         break;
2174
2175                 oldcnt = cnt;
2176                 if (tcp_is_fack(tp) || tcp_is_reno(tp) ||
2177                     (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED))
2178                         cnt += tcp_skb_pcount(skb);
2179
2180                 if (cnt > packets) {
2181                         if (tcp_is_sack(tp) || (oldcnt >= packets))
2182                                 break;
2183
2184                         mss = skb_shinfo(skb)->gso_size;
2185                         err = tcp_fragment(sk, skb, (packets - oldcnt) * mss, mss);
2186                         if (err < 0)
2187                                 break;
2188                         cnt = packets;
2189                 }
2190
2191                 if (!(TCP_SKB_CB(skb)->sacked & (TCPCB_SACKED_ACKED|TCPCB_LOST))) {
2192                         TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
2193                         tp->lost_out += tcp_skb_pcount(skb);
2194                         tcp_verify_retransmit_hint(tp, skb);
2195                 }
2196         }
2197         tcp_verify_left_out(tp);
2198 }
2199
2200 /* Account newly detected lost packet(s) */
2201
2202 static void tcp_update_scoreboard(struct sock *sk, int fast_rexmit)
2203 {
2204         struct tcp_sock *tp = tcp_sk(sk);
2205
2206         if (tcp_is_reno(tp)) {
2207                 tcp_mark_head_lost(sk, 1);
2208         } else if (tcp_is_fack(tp)) {
2209                 int lost = tp->fackets_out - tp->reordering;
2210                 if (lost <= 0)
2211                         lost = 1;
2212                 tcp_mark_head_lost(sk, lost);
2213         } else {
2214                 int sacked_upto = tp->sacked_out - tp->reordering;
2215                 if (sacked_upto < fast_rexmit)
2216                         sacked_upto = fast_rexmit;
2217                 tcp_mark_head_lost(sk, sacked_upto);
2218         }
2219
2220         /* New heuristics: it is possible only after we switched
2221          * to restart timer each time when something is ACKed.
2222          * Hence, we can detect timed out packets during fast
2223          * retransmit without falling to slow start.
2224          */
2225         if (tcp_is_fack(tp) && tcp_head_timedout(sk)) {
2226                 struct sk_buff *skb;
2227
2228                 skb = tp->scoreboard_skb_hint ? tp->scoreboard_skb_hint
2229                         : tcp_write_queue_head(sk);
2230
2231                 tcp_for_write_queue_from(skb, sk) {
2232                         if (skb == tcp_send_head(sk))
2233                                 break;
2234                         if (!tcp_skb_timedout(sk, skb))
2235                                 break;
2236
2237                         if (!(TCP_SKB_CB(skb)->sacked & (TCPCB_SACKED_ACKED|TCPCB_LOST))) {
2238                                 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
2239                                 tp->lost_out += tcp_skb_pcount(skb);
2240                                 tcp_verify_retransmit_hint(tp, skb);
2241                         }
2242                 }
2243
2244                 tp->scoreboard_skb_hint = skb;
2245
2246                 tcp_verify_left_out(tp);
2247         }
2248 }
2249
2250 /* CWND moderation, preventing bursts due to too big ACKs
2251  * in dubious situations.
2252  */
2253 static inline void tcp_moderate_cwnd(struct tcp_sock *tp)
2254 {
2255         tp->snd_cwnd = min(tp->snd_cwnd,
2256                            tcp_packets_in_flight(tp) + tcp_max_burst(tp));
2257         tp->snd_cwnd_stamp = tcp_time_stamp;
2258 }
2259
2260 /* Lower bound on congestion window is slow start threshold
2261  * unless congestion avoidance choice decides to overide it.
2262  */
2263 static inline u32 tcp_cwnd_min(const struct sock *sk)
2264 {
2265         const struct tcp_congestion_ops *ca_ops = inet_csk(sk)->icsk_ca_ops;
2266
2267         return ca_ops->min_cwnd ? ca_ops->min_cwnd(sk) : tcp_sk(sk)->snd_ssthresh;
2268 }
2269
2270 /* Decrease cwnd each second ack. */
2271 static void tcp_cwnd_down(struct sock *sk, int flag)
2272 {
2273         struct tcp_sock *tp = tcp_sk(sk);
2274         int decr = tp->snd_cwnd_cnt + 1;
2275
2276         if ((flag & (FLAG_ANY_PROGRESS | FLAG_DSACKING_ACK)) ||
2277             (tcp_is_reno(tp) && !(flag & FLAG_NOT_DUP))) {
2278                 tp->snd_cwnd_cnt = decr & 1;
2279                 decr >>= 1;
2280
2281                 if (decr && tp->snd_cwnd > tcp_cwnd_min(sk))
2282                         tp->snd_cwnd -= decr;
2283
2284                 tp->snd_cwnd = min(tp->snd_cwnd, tcp_packets_in_flight(tp) + 1);
2285                 tp->snd_cwnd_stamp = tcp_time_stamp;
2286         }
2287 }
2288
2289 /* Nothing was retransmitted or returned timestamp is less
2290  * than timestamp of the first retransmission.
2291  */
2292 static inline int tcp_packet_delayed(struct tcp_sock *tp)
2293 {
2294         return !tp->retrans_stamp ||
2295                 (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
2296                  (__s32)(tp->rx_opt.rcv_tsecr - tp->retrans_stamp) < 0);
2297 }
2298
2299 /* Undo procedures. */
2300
2301 #if FASTRETRANS_DEBUG > 1
2302 static void DBGUNDO(struct sock *sk, const char *msg)
2303 {
2304         struct tcp_sock *tp = tcp_sk(sk);
2305         struct inet_sock *inet = inet_sk(sk);
2306
2307         printk(KERN_DEBUG "Undo %s %u.%u.%u.%u/%u c%u l%u ss%u/%u p%u\n",
2308                msg,
2309                NIPQUAD(inet->daddr), ntohs(inet->dport),
2310                tp->snd_cwnd, tcp_left_out(tp),
2311                tp->snd_ssthresh, tp->prior_ssthresh,
2312                tp->packets_out);
2313 }
2314 #else
2315 #define DBGUNDO(x...) do { } while (0)
2316 #endif
2317
2318 static void tcp_undo_cwr(struct sock *sk, const int undo)
2319 {
2320         struct tcp_sock *tp = tcp_sk(sk);
2321
2322         if (tp->prior_ssthresh) {
2323                 const struct inet_connection_sock *icsk = inet_csk(sk);
2324
2325                 if (icsk->icsk_ca_ops->undo_cwnd)
2326                         tp->snd_cwnd = icsk->icsk_ca_ops->undo_cwnd(sk);
2327                 else
2328                         tp->snd_cwnd = max(tp->snd_cwnd, tp->snd_ssthresh << 1);
2329
2330                 if (undo && tp->prior_ssthresh > tp->snd_ssthresh) {
2331                         tp->snd_ssthresh = tp->prior_ssthresh;
2332                         TCP_ECN_withdraw_cwr(tp);
2333                 }
2334         } else {
2335                 tp->snd_cwnd = max(tp->snd_cwnd, tp->snd_ssthresh);
2336         }
2337         tcp_moderate_cwnd(tp);
2338         tp->snd_cwnd_stamp = tcp_time_stamp;
2339
2340         /* There is something screwy going on with the retrans hints after
2341            an undo */
2342         tcp_clear_all_retrans_hints(tp);
2343 }
2344
2345 static inline int tcp_may_undo(struct tcp_sock *tp)
2346 {
2347         return tp->undo_marker && (!tp->undo_retrans || tcp_packet_delayed(tp));
2348 }
2349
2350 /* People celebrate: "We love our President!" */
2351 static int tcp_try_undo_recovery(struct sock *sk)
2352 {
2353         struct tcp_sock *tp = tcp_sk(sk);
2354
2355         if (tcp_may_undo(tp)) {
2356                 /* Happy end! We did not retransmit anything
2357                  * or our original transmission succeeded.
2358                  */
2359                 DBGUNDO(sk, inet_csk(sk)->icsk_ca_state == TCP_CA_Loss ? "loss" : "retrans");
2360                 tcp_undo_cwr(sk, 1);
2361                 if (inet_csk(sk)->icsk_ca_state == TCP_CA_Loss)
2362                         NET_INC_STATS_BH(LINUX_MIB_TCPLOSSUNDO);
2363                 else
2364                         NET_INC_STATS_BH(LINUX_MIB_TCPFULLUNDO);
2365                 tp->undo_marker = 0;
2366         }
2367         if (tp->snd_una == tp->high_seq && tcp_is_reno(tp)) {
2368                 /* Hold old state until something *above* high_seq
2369                  * is ACKed. For Reno it is MUST to prevent false
2370                  * fast retransmits (RFC2582). SACK TCP is safe. */
2371                 tcp_moderate_cwnd(tp);
2372                 return 1;
2373         }
2374         tcp_set_ca_state(sk, TCP_CA_Open);
2375         return 0;
2376 }
2377
2378 /* Try to undo cwnd reduction, because D-SACKs acked all retransmitted data */
2379 static void tcp_try_undo_dsack(struct sock *sk)
2380 {
2381         struct tcp_sock *tp = tcp_sk(sk);
2382
2383         if (tp->undo_marker && !tp->undo_retrans) {
2384                 DBGUNDO(sk, "D-SACK");
2385                 tcp_undo_cwr(sk, 1);
2386                 tp->undo_marker = 0;
2387                 NET_INC_STATS_BH(LINUX_MIB_TCPDSACKUNDO);
2388         }
2389 }
2390
2391 /* Undo during fast recovery after partial ACK. */
2392
2393 static int tcp_try_undo_partial(struct sock *sk, int acked)
2394 {
2395         struct tcp_sock *tp = tcp_sk(sk);
2396         /* Partial ACK arrived. Force Hoe's retransmit. */
2397         int failed = tcp_is_reno(tp) || (tcp_fackets_out(tp) > tp->reordering);
2398
2399         if (tcp_may_undo(tp)) {
2400                 /* Plain luck! Hole if filled with delayed
2401                  * packet, rather than with a retransmit.
2402                  */
2403                 if (tp->retrans_out == 0)
2404                         tp->retrans_stamp = 0;
2405
2406                 tcp_update_reordering(sk, tcp_fackets_out(tp) + acked, 1);
2407
2408                 DBGUNDO(sk, "Hoe");
2409                 tcp_undo_cwr(sk, 0);
2410                 NET_INC_STATS_BH(LINUX_MIB_TCPPARTIALUNDO);
2411
2412                 /* So... Do not make Hoe's retransmit yet.
2413                  * If the first packet was delayed, the rest
2414                  * ones are most probably delayed as well.
2415                  */
2416                 failed = 0;
2417         }
2418         return failed;
2419 }
2420
2421 /* Undo during loss recovery after partial ACK. */
2422 static int tcp_try_undo_loss(struct sock *sk)
2423 {
2424         struct tcp_sock *tp = tcp_sk(sk);
2425
2426         if (tcp_may_undo(tp)) {
2427                 struct sk_buff *skb;
2428                 tcp_for_write_queue(skb, sk) {
2429                         if (skb == tcp_send_head(sk))
2430                                 break;
2431                         TCP_SKB_CB(skb)->sacked &= ~TCPCB_LOST;
2432                 }
2433
2434                 tcp_clear_all_retrans_hints(tp);
2435
2436                 DBGUNDO(sk, "partial loss");
2437                 tp->lost_out = 0;
2438                 tcp_undo_cwr(sk, 1);
2439                 NET_INC_STATS_BH(LINUX_MIB_TCPLOSSUNDO);
2440                 inet_csk(sk)->icsk_retransmits = 0;
2441                 tp->undo_marker = 0;
2442                 if (tcp_is_sack(tp))
2443                         tcp_set_ca_state(sk, TCP_CA_Open);
2444                 return 1;
2445         }
2446         return 0;
2447 }
2448
2449 static inline void tcp_complete_cwr(struct sock *sk)
2450 {
2451         struct tcp_sock *tp = tcp_sk(sk);
2452         tp->snd_cwnd = min(tp->snd_cwnd, tp->snd_ssthresh);
2453         tp->snd_cwnd_stamp = tcp_time_stamp;
2454         tcp_ca_event(sk, CA_EVENT_COMPLETE_CWR);
2455 }
2456
2457 static void tcp_try_to_open(struct sock *sk, int flag)
2458 {
2459         struct tcp_sock *tp = tcp_sk(sk);
2460
2461         tcp_verify_left_out(tp);
2462
2463         if (tp->retrans_out == 0)
2464                 tp->retrans_stamp = 0;
2465
2466         if (flag & FLAG_ECE)
2467                 tcp_enter_cwr(sk, 1);
2468
2469         if (inet_csk(sk)->icsk_ca_state != TCP_CA_CWR) {
2470                 int state = TCP_CA_Open;
2471
2472                 if (tcp_left_out(tp) || tp->retrans_out || tp->undo_marker)
2473                         state = TCP_CA_Disorder;
2474
2475                 if (inet_csk(sk)->icsk_ca_state != state) {
2476                         tcp_set_ca_state(sk, state);
2477                         tp->high_seq = tp->snd_nxt;
2478                 }
2479                 tcp_moderate_cwnd(tp);
2480         } else {
2481                 tcp_cwnd_down(sk, flag);
2482         }
2483 }
2484
2485 static void tcp_mtup_probe_failed(struct sock *sk)
2486 {
2487         struct inet_connection_sock *icsk = inet_csk(sk);
2488
2489         icsk->icsk_mtup.search_high = icsk->icsk_mtup.probe_size - 1;
2490         icsk->icsk_mtup.probe_size = 0;
2491 }
2492
2493 static void tcp_mtup_probe_success(struct sock *sk, struct sk_buff *skb)
2494 {
2495         struct tcp_sock *tp = tcp_sk(sk);
2496         struct inet_connection_sock *icsk = inet_csk(sk);
2497
2498         /* FIXME: breaks with very large cwnd */
2499         tp->prior_ssthresh = tcp_current_ssthresh(sk);
2500         tp->snd_cwnd = tp->snd_cwnd *
2501                        tcp_mss_to_mtu(sk, tp->mss_cache) /
2502                        icsk->icsk_mtup.probe_size;
2503         tp->snd_cwnd_cnt = 0;
2504         tp->snd_cwnd_stamp = tcp_time_stamp;
2505         tp->rcv_ssthresh = tcp_current_ssthresh(sk);
2506
2507         icsk->icsk_mtup.search_low = icsk->icsk_mtup.probe_size;
2508         icsk->icsk_mtup.probe_size = 0;
2509         tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
2510 }
2511
2512 /* Process an event, which can update packets-in-flight not trivially.
2513  * Main goal of this function is to calculate new estimate for left_out,
2514  * taking into account both packets sitting in receiver's buffer and
2515  * packets lost by network.
2516  *
2517  * Besides that it does CWND reduction, when packet loss is detected
2518  * and changes state of machine.
2519  *
2520  * It does _not_ decide what to send, it is made in function
2521  * tcp_xmit_retransmit_queue().
2522  */
2523 static void tcp_fastretrans_alert(struct sock *sk, int pkts_acked, int flag)
2524 {
2525         struct inet_connection_sock *icsk = inet_csk(sk);
2526         struct tcp_sock *tp = tcp_sk(sk);
2527         int is_dupack = !(flag & (FLAG_SND_UNA_ADVANCED | FLAG_NOT_DUP));
2528         int do_lost = is_dupack || ((flag & FLAG_DATA_SACKED) &&
2529                                     (tcp_fackets_out(tp) > tp->reordering));
2530         int fast_rexmit = 0;
2531
2532         if (WARN_ON(!tp->packets_out && tp->sacked_out))
2533                 tp->sacked_out = 0;
2534         if (WARN_ON(!tp->sacked_out && tp->fackets_out))
2535                 tp->fackets_out = 0;
2536
2537         /* Now state machine starts.
2538          * A. ECE, hence prohibit cwnd undoing, the reduction is required. */
2539         if (flag & FLAG_ECE)
2540                 tp->prior_ssthresh = 0;
2541
2542         /* B. In all the states check for reneging SACKs. */
2543         if (tcp_check_sack_reneging(sk, flag))
2544                 return;
2545
2546         /* C. Process data loss notification, provided it is valid. */
2547         if (tcp_is_fack(tp) && (flag & FLAG_DATA_LOST) &&
2548             before(tp->snd_una, tp->high_seq) &&
2549             icsk->icsk_ca_state != TCP_CA_Open &&
2550             tp->fackets_out > tp->reordering) {
2551                 tcp_mark_head_lost(sk, tp->fackets_out - tp->reordering);
2552                 NET_INC_STATS_BH(LINUX_MIB_TCPLOSS);
2553         }
2554
2555         /* D. Check consistency of the current state. */
2556         tcp_verify_left_out(tp);
2557
2558         /* E. Check state exit conditions. State can be terminated
2559          *    when high_seq is ACKed. */
2560         if (icsk->icsk_ca_state == TCP_CA_Open) {
2561                 BUG_TRAP(tp->retrans_out == 0);
2562                 tp->retrans_stamp = 0;
2563         } else if (!before(tp->snd_una, tp->high_seq)) {
2564                 switch (icsk->icsk_ca_state) {
2565                 case TCP_CA_Loss:
2566                         icsk->icsk_retransmits = 0;
2567                         if (tcp_try_undo_recovery(sk))
2568                                 return;
2569                         break;
2570
2571                 case TCP_CA_CWR:
2572                         /* CWR is to be held something *above* high_seq
2573                          * is ACKed for CWR bit to reach receiver. */
2574                         if (tp->snd_una != tp->high_seq) {
2575                                 tcp_complete_cwr(sk);
2576                                 tcp_set_ca_state(sk, TCP_CA_Open);
2577                         }
2578                         break;
2579
2580                 case TCP_CA_Disorder:
2581                         tcp_try_undo_dsack(sk);
2582                         if (!tp->undo_marker ||
2583                             /* For SACK case do not Open to allow to undo
2584                              * catching for all duplicate ACKs. */
2585                             tcp_is_reno(tp) || tp->snd_una != tp->high_seq) {
2586                                 tp->undo_marker = 0;
2587                                 tcp_set_ca_state(sk, TCP_CA_Open);
2588                         }
2589                         break;
2590
2591                 case TCP_CA_Recovery:
2592                         if (tcp_is_reno(tp))
2593                                 tcp_reset_reno_sack(tp);
2594                         if (tcp_try_undo_recovery(sk))
2595                                 return;
2596                         tcp_complete_cwr(sk);
2597                         break;
2598                 }
2599         }
2600
2601         /* F. Process state. */
2602         switch (icsk->icsk_ca_state) {
2603         case TCP_CA_Recovery:
2604                 if (!(flag & FLAG_SND_UNA_ADVANCED)) {
2605                         if (tcp_is_reno(tp) && is_dupack)
2606                                 tcp_add_reno_sack(sk);
2607                 } else
2608                         do_lost = tcp_try_undo_partial(sk, pkts_acked);
2609                 break;
2610         case TCP_CA_Loss:
2611                 if (flag & FLAG_DATA_ACKED)
2612                         icsk->icsk_retransmits = 0;
2613                 if (tcp_is_reno(tp) && flag & FLAG_SND_UNA_ADVANCED)
2614                         tcp_reset_reno_sack(tp);
2615                 if (!tcp_try_undo_loss(sk)) {
2616                         tcp_moderate_cwnd(tp);
2617                         tcp_xmit_retransmit_queue(sk);
2618                         return;
2619                 }
2620                 if (icsk->icsk_ca_state != TCP_CA_Open)
2621                         return;
2622                 /* Loss is undone; fall through to processing in Open state. */
2623         default:
2624                 if (tcp_is_reno(tp)) {
2625                         if (flag & FLAG_SND_UNA_ADVANCED)
2626                                 tcp_reset_reno_sack(tp);
2627                         if (is_dupack)
2628                                 tcp_add_reno_sack(sk);
2629                 }
2630
2631                 if (icsk->icsk_ca_state == TCP_CA_Disorder)
2632                         tcp_try_undo_dsack(sk);
2633
2634                 if (!tcp_time_to_recover(sk)) {
2635                         tcp_try_to_open(sk, flag);
2636                         return;
2637                 }
2638
2639                 /* MTU probe failure: don't reduce cwnd */
2640                 if (icsk->icsk_ca_state < TCP_CA_CWR &&
2641                     icsk->icsk_mtup.probe_size &&
2642                     tp->snd_una == tp->mtu_probe.probe_seq_start) {
2643                         tcp_mtup_probe_failed(sk);
2644                         /* Restores the reduction we did in tcp_mtup_probe() */
2645                         tp->snd_cwnd++;
2646                         tcp_simple_retransmit(sk);
2647                         return;
2648                 }
2649
2650                 /* Otherwise enter Recovery state */
2651
2652                 if (tcp_is_reno(tp))
2653                         NET_INC_STATS_BH(LINUX_MIB_TCPRENORECOVERY);
2654                 else
2655                         NET_INC_STATS_BH(LINUX_MIB_TCPSACKRECOVERY);
2656
2657                 tp->high_seq = tp->snd_nxt;
2658                 tp->prior_ssthresh = 0;
2659                 tp->undo_marker = tp->snd_una;
2660                 tp->undo_retrans = tp->retrans_out;
2661
2662                 if (icsk->icsk_ca_state < TCP_CA_CWR) {
2663                         if (!(flag & FLAG_ECE))
2664                                 tp->prior_ssthresh = tcp_current_ssthresh(sk);
2665                         tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
2666                         TCP_ECN_queue_cwr(tp);
2667                 }
2668
2669                 tp->bytes_acked = 0;
2670                 tp->snd_cwnd_cnt = 0;
2671                 tcp_set_ca_state(sk, TCP_CA_Recovery);
2672                 fast_rexmit = 1;
2673         }
2674
2675         if (do_lost || (tcp_is_fack(tp) && tcp_head_timedout(sk)))
2676                 tcp_update_scoreboard(sk, fast_rexmit);
2677         tcp_cwnd_down(sk, flag);
2678         tcp_xmit_retransmit_queue(sk);
2679 }
2680
2681 /* Read draft-ietf-tcplw-high-performance before mucking
2682  * with this code. (Supersedes RFC1323)
2683  */
2684 static void tcp_ack_saw_tstamp(struct sock *sk, int flag)
2685 {
2686         /* RTTM Rule: A TSecr value received in a segment is used to
2687          * update the averaged RTT measurement only if the segment
2688          * acknowledges some new data, i.e., only if it advances the
2689          * left edge of the send window.
2690          *
2691          * See draft-ietf-tcplw-high-performance-00, section 3.3.
2692          * 1998/04/10 Andrey V. Savochkin <saw@msu.ru>
2693          *
2694          * Changed: reset backoff as soon as we see the first valid sample.
2695          * If we do not, we get strongly overestimated rto. With timestamps
2696          * samples are accepted even from very old segments: f.e., when rtt=1
2697          * increases to 8, we retransmit 5 times and after 8 seconds delayed
2698          * answer arrives rto becomes 120 seconds! If at least one of segments
2699          * in window is lost... Voila.                          --ANK (010210)
2700          */
2701         struct tcp_sock *tp = tcp_sk(sk);
2702         const __u32 seq_rtt = tcp_time_stamp - tp->rx_opt.rcv_tsecr;
2703         tcp_rtt_estimator(sk, seq_rtt);
2704         tcp_set_rto(sk);
2705         inet_csk(sk)->icsk_backoff = 0;
2706         tcp_bound_rto(sk);
2707 }
2708
2709 static void tcp_ack_no_tstamp(struct sock *sk, u32 seq_rtt, int flag)
2710 {
2711         /* We don't have a timestamp. Can only use
2712          * packets that are not retransmitted to determine
2713          * rtt estimates. Also, we must not reset the
2714          * backoff for rto until we get a non-retransmitted
2715          * packet. This allows us to deal with a situation
2716          * where the network delay has increased suddenly.
2717          * I.e. Karn's algorithm. (SIGCOMM '87, p5.)
2718          */
2719
2720         if (flag & FLAG_RETRANS_DATA_ACKED)
2721                 return;
2722
2723         tcp_rtt_estimator(sk, seq_rtt);
2724         tcp_set_rto(sk);
2725         inet_csk(sk)->icsk_backoff = 0;
2726         tcp_bound_rto(sk);
2727 }
2728
2729 static inline void tcp_ack_update_rtt(struct sock *sk, const int flag,
2730                                       const s32 seq_rtt)
2731 {
2732         const struct tcp_sock *tp = tcp_sk(sk);
2733         /* Note that peer MAY send zero echo. In this case it is ignored. (rfc1323) */
2734         if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr)
2735                 tcp_ack_saw_tstamp(sk, flag);
2736         else if (seq_rtt >= 0)
2737                 tcp_ack_no_tstamp(sk, seq_rtt, flag);
2738 }
2739
2740 static void tcp_cong_avoid(struct sock *sk, u32 ack, u32 in_flight)
2741 {
2742         const struct inet_connection_sock *icsk = inet_csk(sk);
2743         icsk->icsk_ca_ops->cong_avoid(sk, ack, in_flight);
2744         tcp_sk(sk)->snd_cwnd_stamp = tcp_time_stamp;
2745 }
2746
2747 /* Restart timer after forward progress on connection.
2748  * RFC2988 recommends to restart timer to now+rto.
2749  */
2750 static void tcp_rearm_rto(struct sock *sk)
2751 {
2752         struct tcp_sock *tp = tcp_sk(sk);
2753
2754         if (!tp->packets_out) {
2755                 inet_csk_clear_xmit_timer(sk, ICSK_TIME_RETRANS);
2756         } else {
2757                 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
2758                                           inet_csk(sk)->icsk_rto, TCP_RTO_MAX);
2759         }
2760 }
2761
2762 /* If we get here, the whole TSO packet has not been acked. */
2763 static u32 tcp_tso_acked(struct sock *sk, struct sk_buff *skb)
2764 {
2765         struct tcp_sock *tp = tcp_sk(sk);
2766         u32 packets_acked;
2767
2768         BUG_ON(!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una));
2769
2770         packets_acked = tcp_skb_pcount(skb);
2771         if (tcp_trim_head(sk, skb, tp->snd_una - TCP_SKB_CB(skb)->seq))
2772                 return 0;
2773         packets_acked -= tcp_skb_pcount(skb);
2774
2775         if (packets_acked) {
2776                 BUG_ON(tcp_skb_pcount(skb) == 0);
2777                 BUG_ON(!before(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq));
2778         }
2779
2780         return packets_acked;
2781 }
2782
2783 /* Remove acknowledged frames from the retransmission queue. If our packet
2784  * is before the ack sequence we can discard it as it's confirmed to have
2785  * arrived at the other end.
2786  */
2787 static int tcp_clean_rtx_queue(struct sock *sk, int prior_fackets)
2788 {
2789         struct tcp_sock *tp = tcp_sk(sk);
2790         const struct inet_connection_sock *icsk = inet_csk(sk);
2791         struct sk_buff *skb;
2792         u32 now = tcp_time_stamp;
2793         int fully_acked = 1;
2794         int flag = 0;
2795         u32 pkts_acked = 0;
2796         u32 reord = tp->packets_out;
2797         s32 seq_rtt = -1;
2798         s32 ca_seq_rtt = -1;
2799         ktime_t last_ackt = net_invalid_timestamp();
2800
2801         while ((skb = tcp_write_queue_head(sk)) && skb != tcp_send_head(sk)) {
2802                 struct tcp_skb_cb *scb = TCP_SKB_CB(skb);
2803                 u32 end_seq;
2804                 u32 acked_pcount;
2805                 u8 sacked = scb->sacked;
2806
2807                 /* Determine how many packets and what bytes were acked, tso and else */
2808                 if (after(scb->end_seq, tp->snd_una)) {
2809                         if (tcp_skb_pcount(skb) == 1 ||
2810                             !after(tp->snd_una, scb->seq))
2811                                 break;
2812
2813                         acked_pcount = tcp_tso_acked(sk, skb);
2814                         if (!acked_pcount)
2815                                 break;
2816
2817                         fully_acked = 0;
2818                         end_seq = tp->snd_una;
2819                 } else {
2820                         acked_pcount = tcp_skb_pcount(skb);
2821                         end_seq = scb->end_seq;
2822                 }
2823
2824                 /* MTU probing checks */
2825                 if (fully_acked && icsk->icsk_mtup.probe_size &&
2826                     !after(tp->mtu_probe.probe_seq_end, scb->end_seq)) {
2827                         tcp_mtup_probe_success(sk, skb);
2828                 }
2829
2830                 if (sacked & TCPCB_RETRANS) {
2831                         if (sacked & TCPCB_SACKED_RETRANS)
2832                                 tp->retrans_out -= acked_pcount;
2833                         flag |= FLAG_RETRANS_DATA_ACKED;
2834                         ca_seq_rtt = -1;
2835                         seq_rtt = -1;
2836                         if ((flag & FLAG_DATA_ACKED) || (acked_pcount > 1))
2837                                 flag |= FLAG_NONHEAD_RETRANS_ACKED;
2838                 } else {
2839                         ca_seq_rtt = now - scb->when;
2840                         last_ackt = skb->tstamp;
2841                         if (seq_rtt < 0) {
2842                                 seq_rtt = ca_seq_rtt;
2843                         }
2844                         if (!(sacked & TCPCB_SACKED_ACKED))
2845                                 reord = min(pkts_acked, reord);
2846                 }
2847
2848                 if (sacked & TCPCB_SACKED_ACKED)
2849                         tp->sacked_out -= acked_pcount;
2850                 if (sacked & TCPCB_LOST)
2851                         tp->lost_out -= acked_pcount;
2852
2853                 if (unlikely(tp->urg_mode && !before(end_seq, tp->snd_up)))
2854                         tp->urg_mode = 0;
2855
2856                 tp->packets_out -= acked_pcount;
2857                 pkts_acked += acked_pcount;
2858
2859                 /* Initial outgoing SYN's get put onto the write_queue
2860                  * just like anything else we transmit.  It is not
2861                  * true data, and if we misinform our callers that
2862                  * this ACK acks real data, we will erroneously exit
2863                  * connection startup slow start one packet too
2864                  * quickly.  This is severely frowned upon behavior.
2865                  */
2866                 if (!(scb->flags & TCPCB_FLAG_SYN)) {
2867                         flag |= FLAG_DATA_ACKED;
2868                 } else {
2869                         flag |= FLAG_SYN_ACKED;
2870                         tp->retrans_stamp = 0;
2871                 }
2872
2873                 if (!fully_acked)
2874                         break;
2875
2876                 tcp_unlink_write_queue(skb, sk);
2877                 sk_wmem_free_skb(sk, skb);
2878                 tcp_clear_all_retrans_hints(tp);
2879         }
2880
2881         if (skb && (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED))
2882                 flag |= FLAG_SACK_RENEGING;
2883
2884         if (flag & FLAG_ACKED) {
2885                 const struct tcp_congestion_ops *ca_ops
2886                         = inet_csk(sk)->icsk_ca_ops;
2887
2888                 tcp_ack_update_rtt(sk, flag, seq_rtt);
2889                 tcp_rearm_rto(sk);
2890
2891                 if (tcp_is_reno(tp)) {
2892                         tcp_remove_reno_sacks(sk, pkts_acked);
2893                 } else {
2894                         /* Non-retransmitted hole got filled? That's reordering */
2895                         if (reord < prior_fackets)
2896                                 tcp_update_reordering(sk, tp->fackets_out - reord, 0);
2897                 }
2898
2899                 tp->fackets_out -= min(pkts_acked, tp->fackets_out);
2900
2901                 if (ca_ops->pkts_acked) {
2902                         s32 rtt_us = -1;
2903
2904                         /* Is the ACK triggering packet unambiguous? */
2905                         if (!(flag & FLAG_RETRANS_DATA_ACKED)) {
2906                                 /* High resolution needed and available? */
2907                                 if (ca_ops->flags & TCP_CONG_RTT_STAMP &&
2908                                     !ktime_equal(last_ackt,
2909                                                  net_invalid_timestamp()))
2910                                         rtt_us = ktime_us_delta(ktime_get_real(),
2911                                                                 last_ackt);
2912                                 else if (ca_seq_rtt > 0)
2913                                         rtt_us = jiffies_to_usecs(ca_seq_rtt);
2914                         }
2915
2916                         ca_ops->pkts_acked(sk, pkts_acked, rtt_us);
2917                 }
2918         }
2919
2920 #if FASTRETRANS_DEBUG > 0
2921         BUG_TRAP((int)tp->sacked_out >= 0);
2922         BUG_TRAP((int)tp->lost_out >= 0);
2923         BUG_TRAP((int)tp->retrans_out >= 0);
2924         if (!tp->packets_out && tcp_is_sack(tp)) {
2925                 icsk = inet_csk(sk);
2926                 if (tp->lost_out) {
2927                         printk(KERN_DEBUG "Leak l=%u %d\n",
2928                                tp->lost_out, icsk->icsk_ca_state);
2929                         tp->lost_out = 0;
2930                 }
2931                 if (tp->sacked_out) {
2932                         printk(KERN_DEBUG "Leak s=%u %d\n",
2933                                tp->sacked_out, icsk->icsk_ca_state);
2934                         tp->sacked_out = 0;
2935                 }
2936                 if (tp->retrans_out) {
2937                         printk(KERN_DEBUG "Leak r=%u %d\n",
2938                                tp->retrans_out, icsk->icsk_ca_state);
2939                         tp->retrans_out = 0;
2940                 }
2941         }
2942 #endif
2943         return flag;
2944 }
2945
2946 static void tcp_ack_probe(struct sock *sk)
2947 {
2948         const struct tcp_sock *tp = tcp_sk(sk);
2949         struct inet_connection_sock *icsk = inet_csk(sk);
2950
2951         /* Was it a usable window open? */
2952
2953         if (!after(TCP_SKB_CB(tcp_send_head(sk))->end_seq, tcp_wnd_end(tp))) {
2954                 icsk->icsk_backoff = 0;
2955                 inet_csk_clear_xmit_timer(sk, ICSK_TIME_PROBE0);
2956                 /* Socket must be waked up by subsequent tcp_data_snd_check().
2957                  * This function is not for random using!
2958                  */
2959         } else {
2960                 inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
2961                                           min(icsk->icsk_rto << icsk->icsk_backoff, TCP_RTO_MAX),
2962                                           TCP_RTO_MAX);
2963         }
2964 }
2965
2966 static inline int tcp_ack_is_dubious(const struct sock *sk, const int flag)
2967 {
2968         return (!(flag & FLAG_NOT_DUP) || (flag & FLAG_CA_ALERT) ||
2969                 inet_csk(sk)->icsk_ca_state != TCP_CA_Open);
2970 }
2971
2972 static inline int tcp_may_raise_cwnd(const struct sock *sk, const int flag)
2973 {
2974         const struct tcp_sock *tp = tcp_sk(sk);
2975         return (!(flag & FLAG_ECE) || tp->snd_cwnd < tp->snd_ssthresh) &&
2976                 !((1 << inet_csk(sk)->icsk_ca_state) & (TCPF_CA_Recovery | TCPF_CA_CWR));
2977 }
2978
2979 /* Check that window update is acceptable.
2980  * The function assumes that snd_una<=ack<=snd_next.
2981  */
2982 static inline int tcp_may_update_window(const struct tcp_sock *tp,
2983                                         const u32 ack, const u32 ack_seq,
2984                                         const u32 nwin)
2985 {
2986         return (after(ack, tp->snd_una) ||
2987                 after(ack_seq, tp->snd_wl1) ||
2988                 (ack_seq == tp->snd_wl1 && nwin > tp->snd_wnd));
2989 }
2990
2991 /* Update our send window.
2992  *
2993  * Window update algorithm, described in RFC793/RFC1122 (used in linux-2.2
2994  * and in FreeBSD. NetBSD's one is even worse.) is wrong.
2995  */
2996 static int tcp_ack_update_window(struct sock *sk, struct sk_buff *skb, u32 ack,
2997                                  u32 ack_seq)
2998 {
2999         struct tcp_sock *tp = tcp_sk(sk);
3000         int flag = 0;
3001         u32 nwin = ntohs(tcp_hdr(skb)->window);
3002
3003         if (likely(!tcp_hdr(skb)->syn))
3004                 nwin <<= tp->rx_opt.snd_wscale;
3005
3006         if (tcp_may_update_window(tp, ack, ack_seq, nwin)) {
3007                 flag |= FLAG_WIN_UPDATE;
3008                 tcp_update_wl(tp, ack, ack_seq);
3009
3010                 if (tp->snd_wnd != nwin) {
3011                         tp->snd_wnd = nwin;
3012
3013                         /* Note, it is the only place, where
3014                          * fast path is recovered for sending TCP.
3015                          */
3016                         tp->pred_flags = 0;
3017                         tcp_fast_path_check(sk);
3018
3019                         if (nwin > tp->max_window) {
3020                                 tp->max_window = nwin;
3021                                 tcp_sync_mss(sk, inet_csk(sk)->icsk_pmtu_cookie);
3022                         }
3023                 }
3024         }
3025
3026         tp->snd_una = ack;
3027
3028         return flag;
3029 }
3030
3031 /* A very conservative spurious RTO response algorithm: reduce cwnd and
3032  * continue in congestion avoidance.
3033  */
3034 static void tcp_conservative_spur_to_response(struct tcp_sock *tp)
3035 {
3036         tp->snd_cwnd = min(tp->snd_cwnd, tp->snd_ssthresh);
3037         tp->snd_cwnd_cnt = 0;
3038         tp->bytes_acked = 0;
3039         TCP_ECN_queue_cwr(tp);
3040         tcp_moderate_cwnd(tp);
3041 }
3042
3043 /* A conservative spurious RTO response algorithm: reduce cwnd using
3044  * rate halving and continue in congestion avoidance.
3045  */
3046 static void tcp_ratehalving_spur_to_response(struct sock *sk)
3047 {
3048         tcp_enter_cwr(sk, 0);
3049 }
3050
3051 static void tcp_undo_spur_to_response(struct sock *sk, int flag)
3052 {
3053         if (flag & FLAG_ECE)
3054                 tcp_ratehalving_spur_to_response(sk);
3055         else
3056                 tcp_undo_cwr(sk, 1);
3057 }
3058
3059 /* F-RTO spurious RTO detection algorithm (RFC4138)
3060  *
3061  * F-RTO affects during two new ACKs following RTO (well, almost, see inline
3062  * comments). State (ACK number) is kept in frto_counter. When ACK advances
3063  * window (but not to or beyond highest sequence sent before RTO):
3064  *   On First ACK,  send two new segments out.
3065  *   On Second ACK, RTO was likely spurious. Do spurious response (response
3066  *                  algorithm is not part of the F-RTO detection algorithm
3067  *                  given in RFC4138 but can be selected separately).
3068  * Otherwise (basically on duplicate ACK), RTO was (likely) caused by a loss
3069  * and TCP falls back to conventional RTO recovery. F-RTO allows overriding
3070  * of Nagle, this is done using frto_counter states 2 and 3, when a new data
3071  * segment of any size sent during F-RTO, state 2 is upgraded to 3.
3072  *
3073  * Rationale: if the RTO was spurious, new ACKs should arrive from the
3074  * original window even after we transmit two new data segments.
3075  *
3076  * SACK version:
3077  *   on first step, wait until first cumulative ACK arrives, then move to
3078  *   the second step. In second step, the next ACK decides.
3079  *
3080  * F-RTO is implemented (mainly) in four functions:
3081  *   - tcp_use_frto() is used to determine if TCP is can use F-RTO
3082  *   - tcp_enter_frto() prepares TCP state on RTO if F-RTO is used, it is
3083  *     called when tcp_use_frto() showed green light
3084  *   - tcp_process_frto() handles incoming ACKs during F-RTO algorithm
3085  *   - tcp_enter_frto_loss() is called if there is not enough evidence
3086  *     to prove that the RTO is indeed spurious. It transfers the control
3087  *     from F-RTO to the conventional RTO recovery
3088  */
3089 static int tcp_process_frto(struct sock *sk, int flag)
3090 {
3091         struct tcp_sock *tp = tcp_sk(sk);
3092
3093         tcp_verify_left_out(tp);
3094
3095         /* Duplicate the behavior from Loss state (fastretrans_alert) */
3096         if (flag & FLAG_DATA_ACKED)
3097                 inet_csk(sk)->icsk_retransmits = 0;
3098
3099         if ((flag & FLAG_NONHEAD_RETRANS_ACKED) ||
3100             ((tp->frto_counter >= 2) && (flag & FLAG_RETRANS_DATA_ACKED)))
3101                 tp->undo_marker = 0;
3102
3103         if (!before(tp->snd_una, tp->frto_highmark)) {
3104                 tcp_enter_frto_loss(sk, (tp->frto_counter == 1 ? 2 : 3), flag);
3105                 return 1;
3106         }
3107
3108         if (!IsSackFrto() || tcp_is_reno(tp)) {
3109                 /* RFC4138 shortcoming in step 2; should also have case c):
3110                  * ACK isn't duplicate nor advances window, e.g., opposite dir
3111                  * data, winupdate
3112                  */
3113                 if (!(flag & FLAG_ANY_PROGRESS) && (flag & FLAG_NOT_DUP))
3114                         return 1;
3115
3116                 if (!(flag & FLAG_DATA_ACKED)) {
3117                         tcp_enter_frto_loss(sk, (tp->frto_counter == 1 ? 0 : 3),
3118                                             flag);
3119                         return 1;
3120                 }
3121         } else {
3122                 if (!(flag & FLAG_DATA_ACKED) && (tp->frto_counter == 1)) {
3123                         /* Prevent sending of new data. */
3124                         tp->snd_cwnd = min(tp->snd_cwnd,
3125                                            tcp_packets_in_flight(tp));
3126                         return 1;
3127                 }
3128
3129                 if ((tp->frto_counter >= 2) &&
3130                     (!(flag & FLAG_FORWARD_PROGRESS) ||
3131                      ((flag & FLAG_DATA_SACKED) &&
3132                       !(flag & FLAG_ONLY_ORIG_SACKED)))) {
3133                         /* RFC4138 shortcoming (see comment above) */
3134                         if (!(flag & FLAG_FORWARD_PROGRESS) &&
3135                             (flag & FLAG_NOT_DUP))
3136                                 return 1;
3137
3138                         tcp_enter_frto_loss(sk, 3, flag);
3139                         return 1;
3140                 }
3141         }
3142
3143         if (tp->frto_counter == 1) {
3144                 /* tcp_may_send_now needs to see updated state */
3145                 tp->snd_cwnd = tcp_packets_in_flight(tp) + 2;
3146                 tp->frto_counter = 2;
3147
3148                 if (!tcp_may_send_now(sk))
3149                         tcp_enter_frto_loss(sk, 2, flag);
3150
3151                 return 1;
3152         } else {
3153                 switch (sysctl_tcp_frto_response) {
3154                 case 2:
3155                         tcp_undo_spur_to_response(sk, flag);
3156                         break;
3157                 case 1:
3158                         tcp_conservative_spur_to_response(tp);
3159                         break;
3160                 default:
3161                         tcp_ratehalving_spur_to_response(sk);
3162                         break;
3163                 }
3164                 tp->frto_counter = 0;
3165                 tp->undo_marker = 0;
3166                 NET_INC_STATS_BH(LINUX_MIB_TCPSPURIOUSRTOS);
3167         }
3168         return 0;
3169 }
3170
3171 /* This routine deals with incoming acks, but not outgoing ones. */
3172 static int tcp_ack(struct sock *sk, struct sk_buff *skb, int flag)
3173 {
3174         struct inet_connection_sock *icsk = inet_csk(sk);
3175         struct tcp_sock *tp = tcp_sk(sk);
3176         u32 prior_snd_una = tp->snd_una;
3177         u32 ack_seq = TCP_SKB_CB(skb)->seq;
3178         u32 ack = TCP_SKB_CB(skb)->ack_seq;
3179         u32 prior_in_flight;
3180         u32 prior_fackets;
3181         int prior_packets;
3182         int frto_cwnd = 0;
3183
3184         /* If the ack is newer than sent or older than previous acks
3185          * then we can probably ignore it.
3186          */
3187         if (after(ack, tp->snd_nxt))
3188                 goto uninteresting_ack;
3189
3190         if (before(ack, prior_snd_una))
3191                 goto old_ack;
3192
3193         if (after(ack, prior_snd_una))
3194                 flag |= FLAG_SND_UNA_ADVANCED;
3195
3196         if (sysctl_tcp_abc) {
3197                 if (icsk->icsk_ca_state < TCP_CA_CWR)
3198                         tp->bytes_acked += ack - prior_snd_una;
3199                 else if (icsk->icsk_ca_state == TCP_CA_Loss)
3200                         /* we assume just one segment left network */
3201                         tp->bytes_acked += min(ack - prior_snd_una,
3202                                                tp->mss_cache);
3203         }
3204
3205         prior_fackets = tp->fackets_out;
3206         prior_in_flight = tcp_packets_in_flight(tp);
3207
3208         if (!(flag & FLAG_SLOWPATH) && after(ack, prior_snd_una)) {
3209                 /* Window is constant, pure forward advance.
3210                  * No more checks are required.
3211                  * Note, we use the fact that SND.UNA>=SND.WL2.
3212                  */
3213                 tcp_update_wl(tp, ack, ack_seq);
3214                 tp->snd_una = ack;
3215                 flag |= FLAG_WIN_UPDATE;
3216
3217                 tcp_ca_event(sk, CA_EVENT_FAST_ACK);
3218
3219                 NET_INC_STATS_BH(LINUX_MIB_TCPHPACKS);
3220         } else {
3221                 if (ack_seq != TCP_SKB_CB(skb)->end_seq)
3222                         flag |= FLAG_DATA;
3223                 else
3224                         NET_INC_STATS_BH(LINUX_MIB_TCPPUREACKS);
3225
3226                 flag |= tcp_ack_update_window(sk, skb, ack, ack_seq);
3227
3228                 if (TCP_SKB_CB(skb)->sacked)
3229                         flag |= tcp_sacktag_write_queue(sk, skb, prior_snd_una);
3230
3231                 if (TCP_ECN_rcv_ecn_echo(tp, tcp_hdr(skb)))
3232                         flag |= FLAG_ECE;
3233
3234                 tcp_ca_event(sk, CA_EVENT_SLOW_ACK);
3235         }
3236
3237         /* We passed data and got it acked, remove any soft error
3238          * log. Something worked...
3239          */
3240         sk->sk_err_soft = 0;
3241         tp->rcv_tstamp = tcp_time_stamp;
3242         prior_packets = tp->packets_out;
3243         if (!prior_packets)
3244                 goto no_queue;
3245
3246         /* See if we can take anything off of the retransmit queue. */
3247         flag |= tcp_clean_rtx_queue(sk, prior_fackets);
3248
3249         if (tp->frto_counter)
3250                 frto_cwnd = tcp_process_frto(sk, flag);
3251         /* Guarantee sacktag reordering detection against wrap-arounds */
3252         if (before(tp->frto_highmark, tp->snd_una))
3253                 tp->frto_highmark = 0;
3254
3255         if (tcp_ack_is_dubious(sk, flag)) {
3256                 /* Advance CWND, if state allows this. */
3257                 if ((flag & FLAG_DATA_ACKED) && !frto_cwnd &&
3258                     tcp_may_raise_cwnd(sk, flag))
3259                         tcp_cong_avoid(sk, ack, prior_in_flight);
3260                 tcp_fastretrans_alert(sk, prior_packets - tp->packets_out,
3261                                       flag);
3262         } else {
3263                 if ((flag & FLAG_DATA_ACKED) && !frto_cwnd)
3264                         tcp_cong_avoid(sk, ack, prior_in_flight);
3265         }
3266
3267         if ((flag & FLAG_FORWARD_PROGRESS) || !(flag & FLAG_NOT_DUP))
3268                 dst_confirm(sk->sk_dst_cache);
3269
3270         return 1;
3271
3272 no_queue:
3273         icsk->icsk_probes_out = 0;
3274
3275         /* If this ack opens up a zero window, clear backoff.  It was
3276          * being used to time the probes, and is probably far higher than
3277          * it needs to be for normal retransmission.
3278          */
3279         if (tcp_send_head(sk))
3280                 tcp_ack_probe(sk);
3281         return 1;
3282
3283 old_ack:
3284         if (TCP_SKB_CB(skb)->sacked)
3285                 tcp_sacktag_write_queue(sk, skb, prior_snd_una);
3286
3287 uninteresting_ack:
3288         SOCK_DEBUG(sk, "Ack %u out of %u:%u\n", ack, tp->snd_una, tp->snd_nxt);
3289         return 0;
3290 }
3291
3292 /* Look for tcp options. Normally only called on SYN and SYNACK packets.
3293  * But, this can also be called on packets in the established flow when
3294  * the fast version below fails.
3295  */
3296 void tcp_parse_options(struct sk_buff *skb, struct tcp_options_received *opt_rx,
3297                        int estab)
3298 {
3299         unsigned char *ptr;
3300         struct tcphdr *th = tcp_hdr(skb);
3301         int length = (th->doff * 4) - sizeof(struct tcphdr);
3302
3303         ptr = (unsigned char *)(th + 1);
3304         opt_rx->saw_tstamp = 0;
3305
3306         while (length > 0) {
3307                 int opcode = *ptr++;
3308                 int opsize;
3309
3310                 switch (opcode) {
3311                 case TCPOPT_EOL:
3312                         return;
3313                 case TCPOPT_NOP:        /* Ref: RFC 793 section 3.1 */
3314                         length--;
3315                         continue;
3316                 default:
3317                         opsize = *ptr++;
3318                         if (opsize < 2) /* "silly options" */
3319                                 return;
3320                         if (opsize > length)
3321                                 return; /* don't parse partial options */
3322                         switch (opcode) {
3323                         case TCPOPT_MSS:
3324                                 if (opsize == TCPOLEN_MSS && th->syn && !estab) {
3325                                         u16 in_mss = ntohs(get_unaligned((__be16 *)ptr));
3326                                         if (in_mss) {
3327                                                 if (opt_rx->user_mss &&
3328                                                     opt_rx->user_mss < in_mss)
3329                                                         in_mss = opt_rx->user_mss;
3330                                                 opt_rx->mss_clamp = in_mss;
3331                                         }
3332                                 }
3333                                 break;
3334                         case TCPOPT_WINDOW:
3335                                 if (opsize == TCPOLEN_WINDOW && th->syn &&
3336                                     !estab && sysctl_tcp_window_scaling) {
3337                                         __u8 snd_wscale = *(__u8 *)ptr;
3338                                         opt_rx->wscale_ok = 1;
3339                                         if (snd_wscale > 14) {
3340                                                 if (net_ratelimit())
3341                                                         printk(KERN_INFO "tcp_parse_options: Illegal window "
3342                                                                "scaling value %d >14 received.\n",
3343                                                                snd_wscale);
3344                                                 snd_wscale = 14;
3345                                         }
3346                                         opt_rx->snd_wscale = snd_wscale;
3347                                 }
3348                                 break;
3349                         case TCPOPT_TIMESTAMP:
3350                                 if ((opsize == TCPOLEN_TIMESTAMP) &&
3351                                     ((estab && opt_rx->tstamp_ok) ||
3352                                      (!estab && sysctl_tcp_timestamps))) {
3353                                         opt_rx->saw_tstamp = 1;
3354                                         opt_rx->rcv_tsval = ntohl(get_unaligned((__be32 *)ptr));
3355                                         opt_rx->rcv_tsecr = ntohl(get_unaligned((__be32 *)(ptr+4)));
3356                                 }
3357                                 break;
3358                         case TCPOPT_SACK_PERM:
3359                                 if (opsize == TCPOLEN_SACK_PERM && th->syn &&
3360                                     !estab && sysctl_tcp_sack) {
3361                                         opt_rx->sack_ok = 1;
3362                                         tcp_sack_reset(opt_rx);
3363                                 }
3364                                 break;
3365
3366                         case TCPOPT_SACK:
3367                                 if ((opsize >= (TCPOLEN_SACK_BASE + TCPOLEN_SACK_PERBLOCK)) &&
3368                                    !((opsize - TCPOLEN_SACK_BASE) % TCPOLEN_SACK_PERBLOCK) &&
3369                                    opt_rx->sack_ok) {
3370                                         TCP_SKB_CB(skb)->sacked = (ptr - 2) - (unsigned char *)th;
3371                                 }
3372                                 break;
3373 #ifdef CONFIG_TCP_MD5SIG
3374                         case TCPOPT_MD5SIG:
3375                                 /*
3376                                  * The MD5 Hash has already been
3377                                  * checked (see tcp_v{4,6}_do_rcv()).
3378                                  */
3379                                 break;
3380 #endif
3381                         }
3382
3383                         ptr += opsize-2;
3384                         length -= opsize;
3385                 }
3386         }
3387 }
3388
3389 /* Fast parse options. This hopes to only see timestamps.
3390  * If it is wrong it falls back on tcp_parse_options().
3391  */
3392 static int tcp_fast_parse_options(struct sk_buff *skb, struct tcphdr *th,
3393                                   struct tcp_sock *tp)
3394 {
3395         if (th->doff == sizeof(struct tcphdr) >> 2) {
3396                 tp->rx_opt.saw_tstamp = 0;
3397                 return 0;
3398         } else if (tp->rx_opt.tstamp_ok &&
3399                    th->doff == (sizeof(struct tcphdr)>>2)+(TCPOLEN_TSTAMP_ALIGNED>>2)) {
3400                 __be32 *ptr = (__be32 *)(th + 1);
3401                 if (*ptr == htonl((TCPOPT_NOP << 24) | (TCPOPT_NOP << 16)
3402                                   | (TCPOPT_TIMESTAMP << 8) | TCPOLEN_TIMESTAMP)) {
3403                         tp->rx_opt.saw_tstamp = 1;
3404                         ++ptr;
3405                         tp->rx_opt.rcv_tsval = ntohl(*ptr);
3406                         ++ptr;
3407                         tp->rx_opt.rcv_tsecr = ntohl(*ptr);
3408                         return 1;
3409                 }
3410         }
3411         tcp_parse_options(skb, &tp->rx_opt, 1);
3412         return 1;
3413 }
3414
3415 static inline void tcp_store_ts_recent(struct tcp_sock *tp)
3416 {
3417         tp->rx_opt.ts_recent = tp->rx_opt.rcv_tsval;
3418         tp->rx_opt.ts_recent_stamp = get_seconds();
3419 }
3420
3421 static inline void tcp_replace_ts_recent(struct tcp_sock *tp, u32 seq)
3422 {
3423         if (tp->rx_opt.saw_tstamp && !after(seq, tp->rcv_wup)) {
3424                 /* PAWS bug workaround wrt. ACK frames, the PAWS discard
3425                  * extra check below makes sure this can only happen
3426                  * for pure ACK frames.  -DaveM
3427                  *
3428                  * Not only, also it occurs for expired timestamps.
3429                  */
3430
3431                 if ((s32)(tp->rx_opt.rcv_tsval - tp->rx_opt.ts_recent) >= 0 ||
3432                    get_seconds() >= tp->rx_opt.ts_recent_stamp + TCP_PAWS_24DAYS)
3433                         tcp_store_ts_recent(tp);
3434         }
3435 }
3436
3437 /* Sorry, PAWS as specified is broken wrt. pure-ACKs -DaveM
3438  *
3439  * It is not fatal. If this ACK does _not_ change critical state (seqs, window)
3440  * it can pass through stack. So, the following predicate verifies that
3441  * this segment is not used for anything but congestion avoidance or
3442  * fast retransmit. Moreover, we even are able to eliminate most of such
3443  * second order effects, if we apply some small "replay" window (~RTO)
3444  * to timestamp space.
3445  *
3446  * All these measures still do not guarantee that we reject wrapped ACKs
3447  * on networks with high bandwidth, when sequence space is recycled fastly,
3448  * but it guarantees that such events will be very rare and do not affect
3449  * connection seriously. This doesn't look nice, but alas, PAWS is really
3450  * buggy extension.
3451  *
3452  * [ Later note. Even worse! It is buggy for segments _with_ data. RFC
3453  * states that events when retransmit arrives after original data are rare.
3454  * It is a blatant lie. VJ forgot about fast retransmit! 8)8) It is
3455  * the biggest problem on large power networks even with minor reordering.
3456  * OK, let's give it small replay window. If peer clock is even 1hz, it is safe
3457  * up to bandwidth of 18Gigabit/sec. 8) ]
3458  */
3459
3460 static int tcp_disordered_ack(const struct sock *sk, const struct sk_buff *skb)
3461 {
3462         struct tcp_sock *tp = tcp_sk(sk);
3463         struct tcphdr *th = tcp_hdr(skb);
3464         u32 seq = TCP_SKB_CB(skb)->seq;
3465         u32 ack = TCP_SKB_CB(skb)->ack_seq;
3466
3467         return (/* 1. Pure ACK with correct sequence number. */
3468                 (th->ack && seq == TCP_SKB_CB(skb)->end_seq && seq == tp->rcv_nxt) &&
3469
3470                 /* 2. ... and duplicate ACK. */
3471                 ack == tp->snd_una &&
3472
3473                 /* 3. ... and does not update window. */
3474                 !tcp_may_update_window(tp, ack, seq, ntohs(th->window) << tp->rx_opt.snd_wscale) &&
3475
3476                 /* 4. ... and sits in replay window. */
3477                 (s32)(tp->rx_opt.ts_recent - tp->rx_opt.rcv_tsval) <= (inet_csk(sk)->icsk_rto * 1024) / HZ);
3478 }
3479
3480 static inline int tcp_paws_discard(const struct sock *sk,
3481                                    const struct sk_buff *skb)
3482 {
3483         const struct tcp_sock *tp = tcp_sk(sk);
3484         return ((s32)(tp->rx_opt.ts_recent - tp->rx_opt.rcv_tsval) > TCP_PAWS_WINDOW &&
3485                 get_seconds() < tp->rx_opt.ts_recent_stamp + TCP_PAWS_24DAYS &&
3486                 !tcp_disordered_ack(sk, skb));
3487 }
3488
3489 /* Check segment sequence number for validity.
3490  *
3491  * Segment controls are considered valid, if the segment
3492  * fits to the window after truncation to the window. Acceptability
3493  * of data (and SYN, FIN, of course) is checked separately.
3494  * See tcp_data_queue(), for example.
3495  *
3496  * Also, controls (RST is main one) are accepted using RCV.WUP instead
3497  * of RCV.NXT. Peer still did not advance his SND.UNA when we
3498  * delayed ACK, so that hisSND.UNA<=ourRCV.WUP.
3499  * (borrowed from freebsd)
3500  */
3501
3502 static inline int tcp_sequence(struct tcp_sock *tp, u32 seq, u32 end_seq)
3503 {
3504         return  !before(end_seq, tp->rcv_wup) &&
3505                 !after(seq, tp->rcv_nxt + tcp_receive_window(tp));
3506 }
3507
3508 /* When we get a reset we do this. */
3509 static void tcp_reset(struct sock *sk)
3510 {
3511         /* We want the right error as BSD sees it (and indeed as we do). */
3512         switch (sk->sk_state) {
3513         case TCP_SYN_SENT:
3514                 sk->sk_err = ECONNREFUSED;
3515                 break;
3516         case TCP_CLOSE_WAIT:
3517                 sk->sk_err = EPIPE;
3518                 break;
3519         case TCP_CLOSE:
3520                 return;
3521         default:
3522                 sk->sk_err = ECONNRESET;
3523         }
3524
3525         if (!sock_flag(sk, SOCK_DEAD))
3526                 sk->sk_error_report(sk);
3527
3528         tcp_done(sk);
3529 }
3530
3531 /*
3532  *      Process the FIN bit. This now behaves as it is supposed to work
3533  *      and the FIN takes effect when it is validly part of sequence
3534  *      space. Not before when we get holes.
3535  *
3536  *      If we are ESTABLISHED, a received fin moves us to CLOSE-WAIT
3537  *      (and thence onto LAST-ACK and finally, CLOSE, we never enter
3538  *      TIME-WAIT)
3539  *
3540  *      If we are in FINWAIT-1, a received FIN indicates simultaneous
3541  *      close and we go into CLOSING (and later onto TIME-WAIT)
3542  *
3543  *      If we are in FINWAIT-2, a received FIN moves us to TIME-WAIT.
3544  */
3545 static void tcp_fin(struct sk_buff *skb, struct sock *sk, struct tcphdr *th)
3546 {
3547         struct tcp_sock *tp = tcp_sk(sk);
3548
3549         inet_csk_schedule_ack(sk);
3550
3551         sk->sk_shutdown |= RCV_SHUTDOWN;
3552         sock_set_flag(sk, SOCK_DONE);
3553
3554         switch (sk->sk_state) {
3555         case TCP_SYN_RECV:
3556         case TCP_ESTABLISHED:
3557                 /* Move to CLOSE_WAIT */
3558                 tcp_set_state(sk, TCP_CLOSE_WAIT);
3559                 inet_csk(sk)->icsk_ack.pingpong = 1;
3560                 break;
3561
3562         case TCP_CLOSE_WAIT:
3563         case TCP_CLOSING:
3564                 /* Received a retransmission of the FIN, do
3565                  * nothing.
3566                  */
3567                 break;
3568         case TCP_LAST_ACK:
3569                 /* RFC793: Remain in the LAST-ACK state. */
3570                 break;
3571
3572         case TCP_FIN_WAIT1:
3573                 /* This case occurs when a simultaneous close
3574                  * happens, we must ack the received FIN and
3575                  * enter the CLOSING state.
3576                  */
3577                 tcp_send_ack(sk);
3578                 tcp_set_state(sk, TCP_CLOSING);
3579                 break;
3580         case TCP_FIN_WAIT2:
3581                 /* Received a FIN -- send ACK and enter TIME_WAIT. */
3582                 tcp_send_ack(sk);
3583                 tcp_time_wait(sk, TCP_TIME_WAIT, 0);
3584                 break;
3585         default:
3586                 /* Only TCP_LISTEN and TCP_CLOSE are left, in these
3587                  * cases we should never reach this piece of code.
3588                  */
3589                 printk(KERN_ERR "%s: Impossible, sk->sk_state=%d\n",
3590                        __FUNCTION__, sk->sk_state);
3591                 break;
3592         }
3593
3594         /* It _is_ possible, that we have something out-of-order _after_ FIN.
3595          * Probably, we should reset in this case. For now drop them.
3596          */
3597         __skb_queue_purge(&tp->out_of_order_queue);
3598         if (tcp_is_sack(tp))
3599                 tcp_sack_reset(&tp->rx_opt);
3600         sk_mem_reclaim(sk);
3601
3602         if (!sock_flag(sk, SOCK_DEAD)) {
3603                 sk->sk_state_change(sk);
3604
3605                 /* Do not send POLL_HUP for half duplex close. */
3606                 if (sk->sk_shutdown == SHUTDOWN_MASK ||
3607                     sk->sk_state == TCP_CLOSE)
3608                         sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_HUP);
3609                 else
3610                         sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_IN);
3611         }
3612 }
3613
3614 static inline int tcp_sack_extend(struct tcp_sack_block *sp, u32 seq,
3615                                   u32 end_seq)
3616 {
3617         if (!after(seq, sp->end_seq) && !after(sp->start_seq, end_seq)) {
3618                 if (before(seq, sp->start_seq))
3619                         sp->start_seq = seq;
3620                 if (after(end_seq, sp->end_seq))
3621                         sp->end_seq = end_seq;
3622                 return 1;
3623         }
3624         return 0;
3625 }
3626
3627 static void tcp_dsack_set(struct tcp_sock *tp, u32 seq, u32 end_seq)
3628 {
3629         if (tcp_is_sack(tp) && sysctl_tcp_dsack) {
3630                 if (before(seq, tp->rcv_nxt))
3631                         NET_INC_STATS_BH(LINUX_MIB_TCPDSACKOLDSENT);
3632                 else
3633                         NET_INC_STATS_BH(LINUX_MIB_TCPDSACKOFOSENT);
3634
3635                 tp->rx_opt.dsack = 1;
3636                 tp->duplicate_sack[0].start_seq = seq;
3637                 tp->duplicate_sack[0].end_seq = end_seq;
3638                 tp->rx_opt.eff_sacks = min(tp->rx_opt.num_sacks + 1,
3639                                            4 - tp->rx_opt.tstamp_ok);
3640         }
3641 }
3642
3643 static void tcp_dsack_extend(struct tcp_sock *tp, u32 seq, u32 end_seq)
3644 {
3645         if (!tp->rx_opt.dsack)
3646                 tcp_dsack_set(tp, seq, end_seq);
3647         else
3648                 tcp_sack_extend(tp->duplicate_sack, seq, end_seq);
3649 }
3650
3651 static void tcp_send_dupack(struct sock *sk, struct sk_buff *skb)
3652 {
3653         struct tcp_sock *tp = tcp_sk(sk);
3654
3655         if (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
3656             before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
3657                 NET_INC_STATS_BH(LINUX_MIB_DELAYEDACKLOST);
3658                 tcp_enter_quickack_mode(sk);
3659
3660                 if (tcp_is_sack(tp) && sysctl_tcp_dsack) {
3661                         u32 end_seq = TCP_SKB_CB(skb)->end_seq;
3662
3663                         if (after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt))
3664                                 end_seq = tp->rcv_nxt;
3665                         tcp_dsack_set(tp, TCP_SKB_CB(skb)->seq, end_seq);
3666                 }
3667         }
3668
3669         tcp_send_ack(sk);
3670 }
3671
3672 /* These routines update the SACK block as out-of-order packets arrive or
3673  * in-order packets close up the sequence space.
3674  */
3675 static void tcp_sack_maybe_coalesce(struct tcp_sock *tp)
3676 {
3677         int this_sack;
3678         struct tcp_sack_block *sp = &tp->selective_acks[0];
3679         struct tcp_sack_block *swalk = sp + 1;
3680
3681         /* See if the recent change to the first SACK eats into
3682          * or hits the sequence space of other SACK blocks, if so coalesce.
3683          */
3684         for (this_sack = 1; this_sack < tp->rx_opt.num_sacks;) {
3685                 if (tcp_sack_extend(sp, swalk->start_seq, swalk->end_seq)) {
3686                         int i;
3687
3688                         /* Zap SWALK, by moving every further SACK up by one slot.
3689                          * Decrease num_sacks.
3690                          */
3691                         tp->rx_opt.num_sacks--;
3692                         tp->rx_opt.eff_sacks = min(tp->rx_opt.num_sacks +
3693                                                    tp->rx_opt.dsack,
3694                                                    4 - tp->rx_opt.tstamp_ok);
3695                         for (i = this_sack; i < tp->rx_opt.num_sacks; i++)
3696                                 sp[i] = sp[i + 1];
3697                         continue;
3698                 }
3699                 this_sack++, swalk++;
3700         }
3701 }
3702
3703 static inline void tcp_sack_swap(struct tcp_sack_block *sack1,
3704                                  struct tcp_sack_block *sack2)
3705 {
3706         __u32 tmp;
3707
3708         tmp = sack1->start_seq;
3709         sack1->start_seq = sack2->start_seq;
3710         sack2->start_seq = tmp;
3711
3712         tmp = sack1->end_seq;
3713         sack1->end_seq = sack2->end_seq;
3714         sack2->end_seq = tmp;
3715 }
3716
3717 static void tcp_sack_new_ofo_skb(struct sock *sk, u32 seq, u32 end_seq)
3718 {
3719         struct tcp_sock *tp = tcp_sk(sk);
3720         struct tcp_sack_block *sp = &tp->selective_acks[0];
3721         int cur_sacks = tp->rx_opt.num_sacks;
3722         int this_sack;
3723
3724         if (!cur_sacks)
3725                 goto new_sack;
3726
3727         for (this_sack = 0; this_sack < cur_sacks; this_sack++, sp++) {
3728                 if (tcp_sack_extend(sp, seq, end_seq)) {
3729                         /* Rotate this_sack to the first one. */
3730                         for (; this_sack > 0; this_sack--, sp--)
3731                                 tcp_sack_swap(sp, sp - 1);
3732                         if (cur_sacks > 1)
3733                                 tcp_sack_maybe_coalesce(tp);
3734                         return;
3735                 }
3736         }
3737
3738         /* Could not find an adjacent existing SACK, build a new one,
3739          * put it at the front, and shift everyone else down.  We
3740          * always know there is at least one SACK present already here.
3741          *
3742          * If the sack array is full, forget about the last one.
3743          */
3744         if (this_sack >= 4) {
3745                 this_sack--;
3746                 tp->rx_opt.num_sacks--;
3747                 sp--;
3748         }
3749         for (; this_sack > 0; this_sack--, sp--)
3750                 *sp = *(sp - 1);
3751
3752 new_sack:
3753         /* Build the new head SACK, and we're done. */
3754         sp->start_seq = seq;
3755         sp->end_seq = end_seq;
3756         tp->rx_opt.num_sacks++;
3757         tp->rx_opt.eff_sacks = min(tp->rx_opt.num_sacks + tp->rx_opt.dsack,
3758                                    4 - tp->rx_opt.tstamp_ok);
3759 }
3760
3761 /* RCV.NXT advances, some SACKs should be eaten. */
3762
3763 static void tcp_sack_remove(struct tcp_sock *tp)
3764 {
3765         struct tcp_sack_block *sp = &tp->selective_acks[0];
3766         int num_sacks = tp->rx_opt.num_sacks;
3767         int this_sack;
3768
3769         /* Empty ofo queue, hence, all the SACKs are eaten. Clear. */
3770         if (skb_queue_empty(&tp->out_of_order_queue)) {
3771                 tp->rx_opt.num_sacks = 0;
3772                 tp->rx_opt.eff_sacks = tp->rx_opt.dsack;
3773                 return;
3774         }
3775
3776         for (this_sack = 0; this_sack < num_sacks;) {
3777                 /* Check if the start of the sack is covered by RCV.NXT. */
3778                 if (!before(tp->rcv_nxt, sp->start_seq)) {
3779                         int i;
3780
3781                         /* RCV.NXT must cover all the block! */
3782                         BUG_TRAP(!before(tp->rcv_nxt, sp->end_seq));
3783
3784                         /* Zap this SACK, by moving forward any other SACKS. */
3785                         for (i=this_sack+1; i < num_sacks; i++)
3786                                 tp->selective_acks[i-1] = tp->selective_acks[i];
3787                         num_sacks--;
3788                         continue;
3789                 }
3790                 this_sack++;
3791                 sp++;
3792         }
3793         if (num_sacks != tp->rx_opt.num_sacks) {
3794                 tp->rx_opt.num_sacks = num_sacks;
3795                 tp->rx_opt.eff_sacks = min(tp->rx_opt.num_sacks +
3796                                            tp->rx_opt.dsack,
3797                                            4 - tp->rx_opt.tstamp_ok);
3798         }
3799 }
3800
3801 /* This one checks to see if we can put data from the
3802  * out_of_order queue into the receive_queue.
3803  */
3804 static void tcp_ofo_queue(struct sock *sk)
3805 {
3806         struct tcp_sock *tp = tcp_sk(sk);
3807         __u32 dsack_high = tp->rcv_nxt;
3808         struct sk_buff *skb;
3809
3810         while ((skb = skb_peek(&tp->out_of_order_queue)) != NULL) {
3811                 if (after(TCP_SKB_CB(skb)->seq, tp->rcv_nxt))
3812                         break;
3813
3814                 if (before(TCP_SKB_CB(skb)->seq, dsack_high)) {
3815                         __u32 dsack = dsack_high;
3816                         if (before(TCP_SKB_CB(skb)->end_seq, dsack_high))
3817                                 dsack_high = TCP_SKB_CB(skb)->end_seq;
3818                         tcp_dsack_extend(tp, TCP_SKB_CB(skb)->seq, dsack);
3819                 }
3820
3821                 if (!after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt)) {
3822                         SOCK_DEBUG(sk, "ofo packet was already received \n");
3823                         __skb_unlink(skb, &tp->out_of_order_queue);
3824                         __kfree_skb(skb);
3825                         continue;
3826                 }
3827                 SOCK_DEBUG(sk, "ofo requeuing : rcv_next %X seq %X - %X\n",
3828                            tp->rcv_nxt, TCP_SKB_CB(skb)->seq,
3829                            TCP_SKB_CB(skb)->end_seq);
3830
3831                 __skb_unlink(skb, &tp->out_of_order_queue);
3832                 __skb_queue_tail(&sk->sk_receive_queue, skb);
3833                 tp->rcv_nxt = TCP_SKB_CB(skb)->end_seq;
3834                 if (tcp_hdr(skb)->fin)
3835                         tcp_fin(skb, sk, tcp_hdr(skb));
3836         }
3837 }
3838
3839 static int tcp_prune_queue(struct sock *sk);
3840
3841 static void tcp_data_queue(struct sock *sk, struct sk_buff *skb)
3842 {
3843         struct tcphdr *th = tcp_hdr(skb);
3844         struct tcp_sock *tp = tcp_sk(sk);
3845         int eaten = -1;
3846
3847         if (TCP_SKB_CB(skb)->seq == TCP_SKB_CB(skb)->end_seq)
3848                 goto drop;
3849
3850         __skb_pull(skb, th->doff * 4);
3851
3852         TCP_ECN_accept_cwr(tp, skb);
3853
3854         if (tp->rx_opt.dsack) {
3855                 tp->rx_opt.dsack = 0;
3856                 tp->rx_opt.eff_sacks = min_t(unsigned int, tp->rx_opt.num_sacks,
3857                                              4 - tp->rx_opt.tstamp_ok);
3858         }
3859
3860         /*  Queue data for delivery to the user.
3861          *  Packets in sequence go to the receive queue.
3862          *  Out of sequence packets to the out_of_order_queue.
3863          */
3864         if (TCP_SKB_CB(skb)->seq == tp->rcv_nxt) {
3865                 if (tcp_receive_window(tp) == 0)
3866                         goto out_of_window;
3867
3868                 /* Ok. In sequence. In window. */
3869                 if (tp->ucopy.task == current &&
3870                     tp->copied_seq == tp->rcv_nxt && tp->ucopy.len &&
3871                     sock_owned_by_user(sk) && !tp->urg_data) {
3872                         int chunk = min_t(unsigned int, skb->len,
3873                                           tp->ucopy.len);
3874
3875                         __set_current_state(TASK_RUNNING);
3876
3877                         local_bh_enable();
3878                         if (!skb_copy_datagram_iovec(skb, 0, tp->ucopy.iov, chunk)) {
3879                                 tp->ucopy.len -= chunk;
3880                                 tp->copied_seq += chunk;
3881                                 eaten = (chunk == skb->len && !th->fin);
3882                                 tcp_rcv_space_adjust(sk);
3883                         }
3884                         local_bh_disable();
3885                 }
3886
3887                 if (eaten <= 0) {
3888 queue_and_out:
3889                         if (eaten < 0 &&
3890                             (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf ||
3891                              !sk_rmem_schedule(sk, skb->truesize))) {
3892                                 if (tcp_prune_queue(sk) < 0 ||
3893                                     !sk_rmem_schedule(sk, skb->truesize))
3894                                         goto drop;
3895                         }
3896                         skb_set_owner_r(skb, sk);
3897                         __skb_queue_tail(&sk->sk_receive_queue, skb);
3898                 }
3899                 tp->rcv_nxt = TCP_SKB_CB(skb)->end_seq;
3900                 if (skb->len)
3901                         tcp_event_data_recv(sk, skb);
3902                 if (th->fin)
3903                         tcp_fin(skb, sk, th);
3904
3905                 if (!skb_queue_empty(&tp->out_of_order_queue)) {
3906                         tcp_ofo_queue(sk);
3907
3908                         /* RFC2581. 4.2. SHOULD send immediate ACK, when
3909                          * gap in queue is filled.
3910                          */
3911                         if (skb_queue_empty(&tp->out_of_order_queue))
3912                                 inet_csk(sk)->icsk_ack.pingpong = 0;
3913                 }
3914
3915                 if (tp->rx_opt.num_sacks)
3916                         tcp_sack_remove(tp);
3917
3918                 tcp_fast_path_check(sk);
3919
3920                 if (eaten > 0)
3921                         __kfree_skb(skb);
3922                 else if (!sock_flag(sk, SOCK_DEAD))
3923                         sk->sk_data_ready(sk, 0);
3924                 return;
3925         }
3926
3927         if (!after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt)) {
3928                 /* A retransmit, 2nd most common case.  Force an immediate ack. */
3929                 NET_INC_STATS_BH(LINUX_MIB_DELAYEDACKLOST);
3930                 tcp_dsack_set(tp, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq);
3931
3932 out_of_window:
3933                 tcp_enter_quickack_mode(sk);
3934                 inet_csk_schedule_ack(sk);
3935 drop:
3936                 __kfree_skb(skb);
3937                 return;
3938         }
3939
3940         /* Out of window. F.e. zero window probe. */
3941         if (!before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt + tcp_receive_window(tp)))
3942                 goto out_of_window;
3943
3944         tcp_enter_quickack_mode(sk);
3945
3946         if (before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
3947                 /* Partial packet, seq < rcv_next < end_seq */
3948                 SOCK_DEBUG(sk, "partial packet: rcv_next %X seq %X - %X\n",
3949                            tp->rcv_nxt, TCP_SKB_CB(skb)->seq,
3950                            TCP_SKB_CB(skb)->end_seq);
3951
3952                 tcp_dsack_set(tp, TCP_SKB_CB(skb)->seq, tp->rcv_nxt);
3953
3954                 /* If window is closed, drop tail of packet. But after
3955                  * remembering D-SACK for its head made in previous line.
3956                  */
3957                 if (!tcp_receive_window(tp))
3958                         goto out_of_window;
3959                 goto queue_and_out;
3960         }
3961
3962         TCP_ECN_check_ce(tp, skb);
3963
3964         if (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf ||
3965             !sk_rmem_schedule(sk, skb->truesize)) {
3966                 if (tcp_prune_queue(sk) < 0 ||
3967                     !sk_rmem_schedule(sk, skb->truesize))
3968                         goto drop;
3969         }
3970
3971         /* Disable header prediction. */
3972         tp->pred_flags = 0;
3973         inet_csk_schedule_ack(sk);
3974
3975         SOCK_DEBUG(sk, "out of order segment: rcv_next %X seq %X - %X\n",
3976                    tp->rcv_nxt, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq);
3977
3978         skb_set_owner_r(skb, sk);
3979
3980         if (!skb_peek(&tp->out_of_order_queue)) {
3981                 /* Initial out of order segment, build 1 SACK. */
3982                 if (tcp_is_sack(tp)) {
3983                         tp->rx_opt.num_sacks = 1;
3984                         tp->rx_opt.dsack     = 0;
3985                         tp->rx_opt.eff_sacks = 1;
3986                         tp->selective_acks[0].start_seq = TCP_SKB_CB(skb)->seq;
3987                         tp->selective_acks[0].end_seq =
3988                                                 TCP_SKB_CB(skb)->end_seq;
3989                 }
3990                 __skb_queue_head(&tp->out_of_order_queue, skb);
3991         } else {
3992                 struct sk_buff *skb1 = tp->out_of_order_queue.prev;
3993                 u32 seq = TCP_SKB_CB(skb)->seq;
3994                 u32 end_seq = TCP_SKB_CB(skb)->end_seq;
3995
3996                 if (seq == TCP_SKB_CB(skb1)->end_seq) {
3997                         __skb_append(skb1, skb, &tp->out_of_order_queue);
3998
3999                         if (!tp->rx_opt.num_sacks ||
4000                             tp->selective_acks[0].end_seq != seq)
4001                                 goto add_sack;
4002
4003                         /* Common case: data arrive in order after hole. */
4004                         tp->selective_acks[0].end_seq = end_seq;
4005                         return;
4006                 }
4007
4008                 /* Find place to insert this segment. */
4009                 do {
4010                         if (!after(TCP_SKB_CB(skb1)->seq, seq))
4011                                 break;
4012                 } while ((skb1 = skb1->prev) !=
4013                          (struct sk_buff *)&tp->out_of_order_queue);
4014
4015                 /* Do skb overlap to previous one? */
4016                 if (skb1 != (struct sk_buff *)&tp->out_of_order_queue &&
4017                     before(seq, TCP_SKB_CB(skb1)->end_seq)) {
4018                         if (!after(end_seq, TCP_SKB_CB(skb1)->end_seq)) {
4019                                 /* All the bits are present. Drop. */
4020                                 __kfree_skb(skb);
4021                                 tcp_dsack_set(tp, seq, end_seq);
4022                                 goto add_sack;
4023                         }
4024                         if (after(seq, TCP_SKB_CB(skb1)->seq)) {
4025                                 /* Partial overlap. */
4026                                 tcp_dsack_set(tp, seq,
4027                                               TCP_SKB_CB(skb1)->end_seq);
4028                         } else {
4029                                 skb1 = skb1->prev;
4030                         }
4031                 }
4032                 __skb_insert(skb, skb1, skb1->next, &tp->out_of_order_queue);
4033
4034                 /* And clean segments covered by new one as whole. */
4035                 while ((skb1 = skb->next) !=
4036                        (struct sk_buff *)&tp->out_of_order_queue &&
4037                        after(end_seq, TCP_SKB_CB(skb1)->seq)) {
4038                         if (before(end_seq, TCP_SKB_CB(skb1)->end_seq)) {
4039                                 tcp_dsack_extend(tp, TCP_SKB_CB(skb1)->seq,
4040                                                  end_seq);
4041                                 break;
4042                         }
4043                         __skb_unlink(skb1, &tp->out_of_order_queue);
4044                         tcp_dsack_extend(tp, TCP_SKB_CB(skb1)->seq,
4045                                          TCP_SKB_CB(skb1)->end_seq);
4046                         __kfree_skb(skb1);
4047                 }
4048
4049 add_sack:
4050                 if (tcp_is_sack(tp))
4051                         tcp_sack_new_ofo_skb(sk, seq, end_seq);
4052         }
4053 }
4054
4055 /* Collapse contiguous sequence of skbs head..tail with
4056  * sequence numbers start..end.
4057  * Segments with FIN/SYN are not collapsed (only because this
4058  * simplifies code)
4059  */
4060 static void
4061 tcp_collapse(struct sock *sk, struct sk_buff_head *list,
4062              struct sk_buff *head, struct sk_buff *tail,
4063              u32 start, u32 end)
4064 {
4065         struct sk_buff *skb;
4066
4067         /* First, check that queue is collapsible and find
4068          * the point where collapsing can be useful. */
4069         for (skb = head; skb != tail;) {
4070                 /* No new bits? It is possible on ofo queue. */
4071                 if (!before(start, TCP_SKB_CB(skb)->end_seq)) {
4072                         struct sk_buff *next = skb->next;
4073                         __skb_unlink(skb, list);
4074                         __kfree_skb(skb);
4075                         NET_INC_STATS_BH(LINUX_MIB_TCPRCVCOLLAPSED);
4076                         skb = next;
4077                         continue;
4078                 }
4079
4080                 /* The first skb to collapse is:
4081                  * - not SYN/FIN and
4082                  * - bloated or contains data before "start" or
4083                  *   overlaps to the next one.
4084                  */
4085                 if (!tcp_hdr(skb)->syn && !tcp_hdr(skb)->fin &&
4086                     (tcp_win_from_space(skb->truesize) > skb->len ||
4087                      before(TCP_SKB_CB(skb)->seq, start) ||
4088                      (skb->next != tail &&
4089                       TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb->next)->seq)))
4090                         break;
4091
4092                 /* Decided to skip this, advance start seq. */
4093                 start = TCP_SKB_CB(skb)->end_seq;
4094                 skb = skb->next;
4095         }
4096         if (skb == tail || tcp_hdr(skb)->syn || tcp_hdr(skb)->fin)
4097                 return;
4098
4099         while (before(start, end)) {
4100                 struct sk_buff *nskb;
4101                 unsigned int header = skb_headroom(skb);
4102                 int copy = SKB_MAX_ORDER(header, 0);
4103
4104                 /* Too big header? This can happen with IPv6. */
4105                 if (copy < 0)
4106                         return;
4107                 if (end - start < copy)
4108                         copy = end - start;
4109                 nskb = alloc_skb(copy + header, GFP_ATOMIC);
4110                 if (!nskb)
4111                         return;
4112
4113                 skb_set_mac_header(nskb, skb_mac_header(skb) - skb->head);
4114                 skb_set_network_header(nskb, (skb_network_header(skb) -
4115                                               skb->head));
4116                 skb_set_transport_header(nskb, (skb_transport_header(skb) -
4117                                                 skb->head));
4118                 skb_reserve(nskb, header);
4119                 memcpy(nskb->head, skb->head, header);
4120                 memcpy(nskb->cb, skb->cb, sizeof(skb->cb));
4121                 TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(nskb)->end_seq = start;
4122                 __skb_insert(nskb, skb->prev, skb, list);
4123                 skb_set_owner_r(nskb, sk);
4124
4125                 /* Copy data, releasing collapsed skbs. */
4126                 while (copy > 0) {
4127                         int offset = start - TCP_SKB_CB(skb)->seq;
4128                         int size = TCP_SKB_CB(skb)->end_seq - start;
4129
4130                         BUG_ON(offset < 0);
4131                         if (size > 0) {
4132                                 size = min(copy, size);
4133                                 if (skb_copy_bits(skb, offset, skb_put(nskb, size), size))
4134                                         BUG();
4135                                 TCP_SKB_CB(nskb)->end_seq += size;
4136                                 copy -= size;
4137                                 start += size;
4138                         }
4139                         if (!before(start, TCP_SKB_CB(skb)->end_seq)) {
4140                                 struct sk_buff *next = skb->next;
4141                                 __skb_unlink(skb, list);
4142                                 __kfree_skb(skb);
4143                                 NET_INC_STATS_BH(LINUX_MIB_TCPRCVCOLLAPSED);
4144                                 skb = next;
4145                                 if (skb == tail ||
4146                                     tcp_hdr(skb)->syn ||
4147                                     tcp_hdr(skb)->fin)
4148                                         return;
4149                         }
4150                 }
4151         }
4152 }
4153
4154 /* Collapse ofo queue. Algorithm: select contiguous sequence of skbs
4155  * and tcp_collapse() them until all the queue is collapsed.
4156  */
4157 static void tcp_collapse_ofo_queue(struct sock *sk)
4158 {
4159         struct tcp_sock *tp = tcp_sk(sk);
4160         struct sk_buff *skb = skb_peek(&tp->out_of_order_queue);
4161         struct sk_buff *head;
4162         u32 start, end;
4163
4164         if (skb == NULL)
4165                 return;
4166
4167         start = TCP_SKB_CB(skb)->seq;
4168         end = TCP_SKB_CB(skb)->end_seq;
4169         head = skb;
4170
4171         for (;;) {
4172                 skb = skb->next;
4173
4174                 /* Segment is terminated when we see gap or when
4175                  * we are at the end of all the queue. */
4176                 if (skb == (struct sk_buff *)&tp->out_of_order_queue ||
4177                     after(TCP_SKB_CB(skb)->seq, end) ||
4178                     before(TCP_SKB_CB(skb)->end_seq, start)) {
4179                         tcp_collapse(sk, &tp->out_of_order_queue,
4180                                      head, skb, start, end);
4181                         head = skb;
4182                         if (skb == (struct sk_buff *)&tp->out_of_order_queue)
4183                                 break;
4184                         /* Start new segment */
4185                         start = TCP_SKB_CB(skb)->seq;
4186                         end = TCP_SKB_CB(skb)->end_seq;
4187                 } else {
4188                         if (before(TCP_SKB_CB(skb)->seq, start))
4189                                 start = TCP_SKB_CB(skb)->seq;
4190                         if (after(TCP_SKB_CB(skb)->end_seq, end))
4191                                 end = TCP_SKB_CB(skb)->end_seq;
4192                 }
4193         }
4194 }
4195
4196 /* Reduce allocated memory if we can, trying to get
4197  * the socket within its memory limits again.
4198  *
4199  * Return less than zero if we should start dropping frames
4200  * until the socket owning process reads some of the data
4201  * to stabilize the situation.
4202  */
4203 static int tcp_prune_queue(struct sock *sk)
4204 {
4205         struct tcp_sock *tp = tcp_sk(sk);
4206
4207         SOCK_DEBUG(sk, "prune_queue: c=%x\n", tp->copied_seq);
4208
4209         NET_INC_STATS_BH(LINUX_MIB_PRUNECALLED);
4210
4211         if (atomic_read(&sk->sk_rmem_alloc) >= sk->sk_rcvbuf)
4212                 tcp_clamp_window(sk);
4213         else if (tcp_memory_pressure)
4214                 tp->rcv_ssthresh = min(tp->rcv_ssthresh, 4U * tp->advmss);
4215
4216         tcp_collapse_ofo_queue(sk);
4217         tcp_collapse(sk, &sk->sk_receive_queue,
4218                      sk->sk_receive_queue.next,
4219                      (struct sk_buff *)&sk->sk_receive_queue,
4220                      tp->copied_seq, tp->rcv_nxt);
4221         sk_mem_reclaim(sk);
4222
4223         if (atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf)
4224                 return 0;
4225
4226         /* Collapsing did not help, destructive actions follow.
4227          * This must not ever occur. */
4228
4229         /* First, purge the out_of_order queue. */
4230         if (!skb_queue_empty(&tp->out_of_order_queue)) {
4231                 NET_INC_STATS_BH(LINUX_MIB_OFOPRUNED);
4232                 __skb_queue_purge(&tp->out_of_order_queue);
4233
4234                 /* Reset SACK state.  A conforming SACK implementation will
4235                  * do the same at a timeout based retransmit.  When a connection
4236                  * is in a sad state like this, we care only about integrity
4237                  * of the connection not performance.
4238                  */
4239                 if (tcp_is_sack(tp))
4240                         tcp_sack_reset(&tp->rx_opt);
4241                 sk_mem_reclaim(sk);
4242         }
4243
4244         if (atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf)
4245                 return 0;
4246
4247         /* If we are really being abused, tell the caller to silently
4248          * drop receive data on the floor.  It will get retransmitted
4249          * and hopefully then we'll have sufficient space.
4250          */
4251         NET_INC_STATS_BH(LINUX_MIB_RCVPRUNED);
4252
4253         /* Massive buffer overcommit. */
4254         tp->pred_flags = 0;
4255         return -1;
4256 }
4257
4258 /* RFC2861, slow part. Adjust cwnd, after it was not full during one rto.
4259  * As additional protections, we do not touch cwnd in retransmission phases,
4260  * and if application hit its sndbuf limit recently.
4261  */
4262 void tcp_cwnd_application_limited(struct sock *sk)
4263 {
4264         struct tcp_sock *tp = tcp_sk(sk);
4265
4266         if (inet_csk(sk)->icsk_ca_state == TCP_CA_Open &&
4267             sk->sk_socket && !test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
4268                 /* Limited by application or receiver window. */
4269                 u32 init_win = tcp_init_cwnd(tp, __sk_dst_get(sk));
4270                 u32 win_used = max(tp->snd_cwnd_used, init_win);
4271                 if (win_used < tp->snd_cwnd) {
4272                         tp->snd_ssthresh = tcp_current_ssthresh(sk);
4273                         tp->snd_cwnd = (tp->snd_cwnd + win_used) >> 1;
4274                 }
4275                 tp->snd_cwnd_used = 0;
4276         }
4277         tp->snd_cwnd_stamp = tcp_time_stamp;
4278 }
4279
4280 static int tcp_should_expand_sndbuf(struct sock *sk)
4281 {
4282         struct tcp_sock *tp = tcp_sk(sk);
4283
4284         /* If the user specified a specific send buffer setting, do
4285          * not modify it.
4286          */
4287         if (sk->sk_userlocks & SOCK_SNDBUF_LOCK)
4288                 return 0;
4289
4290         /* If we are under global TCP memory pressure, do not expand.  */
4291         if (tcp_memory_pressure)
4292                 return 0;
4293
4294         /* If we are under soft global TCP memory pressure, do not expand.  */
4295         if (atomic_read(&tcp_memory_allocated) >= sysctl_tcp_mem[0])
4296                 return 0;
4297
4298         /* If we filled the congestion window, do not expand.  */
4299         if (tp->packets_out >= tp->snd_cwnd)
4300                 return 0;
4301
4302         return 1;
4303 }
4304
4305 /* When incoming ACK allowed to free some skb from write_queue,
4306  * we remember this event in flag SOCK_QUEUE_SHRUNK and wake up socket
4307  * on the exit from tcp input handler.
4308  *
4309  * PROBLEM: sndbuf expansion does not work well with largesend.
4310  */
4311 static void tcp_new_space(struct sock *sk)
4312 {
4313         struct tcp_sock *tp = tcp_sk(sk);
4314
4315         if (tcp_should_expand_sndbuf(sk)) {
4316                 int sndmem = max_t(u32, tp->rx_opt.mss_clamp, tp->mss_cache) +
4317                         MAX_TCP_HEADER + 16 + sizeof(struct sk_buff),
4318                     demanded = max_t(unsigned int, tp->snd_cwnd,
4319                                      tp->reordering + 1);
4320                 sndmem *= 2 * demanded;
4321                 if (sndmem > sk->sk_sndbuf)
4322                         sk->sk_sndbuf = min(sndmem, sysctl_tcp_wmem[2]);
4323                 tp->snd_cwnd_stamp = tcp_time_stamp;
4324         }
4325
4326         sk->sk_write_space(sk);
4327 }
4328
4329 static void tcp_check_space(struct sock *sk)
4330 {
4331         if (sock_flag(sk, SOCK_QUEUE_SHRUNK)) {
4332                 sock_reset_flag(sk, SOCK_QUEUE_SHRUNK);
4333                 if (sk->sk_socket &&
4334                     test_bit(SOCK_NOSPACE, &sk->sk_socket->flags))
4335                         tcp_new_space(sk);
4336         }
4337 }
4338
4339 static inline void tcp_data_snd_check(struct sock *sk)
4340 {
4341         tcp_push_pending_frames(sk);
4342         tcp_check_space(sk);
4343 }
4344
4345 /*
4346  * Check if sending an ack is needed.
4347  */
4348 static void __tcp_ack_snd_check(struct sock *sk, int ofo_possible)
4349 {
4350         struct tcp_sock *tp = tcp_sk(sk);
4351
4352             /* More than one full frame received... */
4353         if (((tp->rcv_nxt - tp->rcv_wup) > inet_csk(sk)->icsk_ack.rcv_mss
4354              /* ... and right edge of window advances far enough.
4355               * (tcp_recvmsg() will send ACK otherwise). Or...
4356               */
4357              && __tcp_select_window(sk) >= tp->rcv_wnd) ||
4358             /* We ACK each frame or... */
4359             tcp_in_quickack_mode(sk) ||
4360             /* We have out of order data. */
4361             (ofo_possible && skb_peek(&tp->out_of_order_queue))) {
4362                 /* Then ack it now */
4363                 tcp_send_ack(sk);
4364         } else {
4365                 /* Else, send delayed ack. */
4366                 tcp_send_delayed_ack(sk);
4367         }
4368 }
4369
4370 static inline void tcp_ack_snd_check(struct sock *sk)
4371 {
4372         if (!inet_csk_ack_scheduled(sk)) {
4373                 /* We sent a data segment already. */
4374                 return;
4375         }
4376         __tcp_ack_snd_check(sk, 1);
4377 }
4378
4379 /*
4380  *      This routine is only called when we have urgent data
4381  *      signaled. Its the 'slow' part of tcp_urg. It could be
4382  *      moved inline now as tcp_urg is only called from one
4383  *      place. We handle URGent data wrong. We have to - as
4384  *      BSD still doesn't use the correction from RFC961.
4385  *      For 1003.1g we should support a new option TCP_STDURG to permit
4386  *      either form (or just set the sysctl tcp_stdurg).
4387  */
4388
4389 static void tcp_check_urg(struct sock *sk, struct tcphdr *th)
4390 {
4391         struct tcp_sock *tp = tcp_sk(sk);
4392         u32 ptr = ntohs(th->urg_ptr);
4393
4394         if (ptr && !sysctl_tcp_stdurg)
4395                 ptr--;
4396         ptr += ntohl(th->seq);
4397
4398         /* Ignore urgent data that we've already seen and read. */
4399         if (after(tp->copied_seq, ptr))
4400                 return;
4401
4402         /* Do not replay urg ptr.
4403          *
4404          * NOTE: interesting situation not covered by specs.
4405          * Misbehaving sender may send urg ptr, pointing to segment,
4406          * which we already have in ofo queue. We are not able to fetch
4407          * such data and will stay in TCP_URG_NOTYET until will be eaten
4408          * by recvmsg(). Seems, we are not obliged to handle such wicked
4409          * situations. But it is worth to think about possibility of some
4410          * DoSes using some hypothetical application level deadlock.
4411          */
4412         if (before(ptr, tp->rcv_nxt))
4413                 return;
4414
4415         /* Do we already have a newer (or duplicate) urgent pointer? */
4416         if (tp->urg_data && !after(ptr, tp->urg_seq))
4417                 return;
4418
4419         /* Tell the world about our new urgent pointer. */
4420         sk_send_sigurg(sk);
4421
4422         /* We may be adding urgent data when the last byte read was
4423          * urgent. To do this requires some care. We cannot just ignore
4424          * tp->copied_seq since we would read the last urgent byte again
4425          * as data, nor can we alter copied_seq until this data arrives
4426          * or we break the semantics of SIOCATMARK (and thus sockatmark())
4427          *
4428          * NOTE. Double Dutch. Rendering to plain English: author of comment
4429          * above did something sort of  send("A", MSG_OOB); send("B", MSG_OOB);
4430          * and expect that both A and B disappear from stream. This is _wrong_.
4431          * Though this happens in BSD with high probability, this is occasional.
4432          * Any application relying on this is buggy. Note also, that fix "works"
4433          * only in this artificial test. Insert some normal data between A and B and we will
4434          * decline of BSD again. Verdict: it is better to remove to trap
4435          * buggy users.
4436          */
4437         if (tp->urg_seq == tp->copied_seq && tp->urg_data &&
4438             !sock_flag(sk, SOCK_URGINLINE) && tp->copied_seq != tp->rcv_nxt) {
4439                 struct sk_buff *skb = skb_peek(&sk->sk_receive_queue);
4440                 tp->copied_seq++;
4441                 if (skb && !before(tp->copied_seq, TCP_SKB_CB(skb)->end_seq)) {
4442                         __skb_unlink(skb, &sk->sk_receive_queue);
4443                         __kfree_skb(skb);
4444                 }
4445         }
4446
4447         tp->urg_data = TCP_URG_NOTYET;
4448         tp->urg_seq = ptr;
4449
4450         /* Disable header prediction. */
4451         tp->pred_flags = 0;
4452 }
4453
4454 /* This is the 'fast' part of urgent handling. */
4455 static void tcp_urg(struct sock *sk, struct sk_buff *skb, struct tcphdr *th)
4456 {
4457         struct tcp_sock *tp = tcp_sk(sk);
4458
4459         /* Check if we get a new urgent pointer - normally not. */
4460         if (th->urg)
4461                 tcp_check_urg(sk, th);
4462
4463         /* Do we wait for any urgent data? - normally not... */
4464         if (tp->urg_data == TCP_URG_NOTYET) {
4465                 u32 ptr = tp->urg_seq - ntohl(th->seq) + (th->doff * 4) -
4466                           th->syn;
4467
4468                 /* Is the urgent pointer pointing into this packet? */
4469                 if (ptr < skb->len) {
4470                         u8 tmp;
4471                         if (skb_copy_bits(skb, ptr, &tmp, 1))
4472                                 BUG();
4473                         tp->urg_data = TCP_URG_VALID | tmp;
4474                         if (!sock_flag(sk, SOCK_DEAD))
4475                                 sk->sk_data_ready(sk, 0);
4476                 }
4477         }
4478 }
4479
4480 static int tcp_copy_to_iovec(struct sock *sk, struct sk_buff *skb, int hlen)
4481 {
4482         struct tcp_sock *tp = tcp_sk(sk);
4483         int chunk = skb->len - hlen;
4484         int err;
4485
4486         local_bh_enable();
4487         if (skb_csum_unnecessary(skb))
4488                 err = skb_copy_datagram_iovec(skb, hlen, tp->ucopy.iov, chunk);
4489         else
4490                 err = skb_copy_and_csum_datagram_iovec(skb, hlen,
4491                                                        tp->ucopy.iov);
4492
4493         if (!err) {
4494                 tp->ucopy.len -= chunk;
4495                 tp->copied_seq += chunk;
4496                 tcp_rcv_space_adjust(sk);
4497         }
4498
4499         local_bh_disable();
4500         return err;
4501 }
4502
4503 static __sum16 __tcp_checksum_complete_user(struct sock *sk,
4504                                             struct sk_buff *skb)
4505 {
4506         __sum16 result;
4507
4508         if (sock_owned_by_user(sk)) {
4509                 local_bh_enable();
4510                 result = __tcp_checksum_complete(skb);
4511                 local_bh_disable();
4512         } else {
4513                 result = __tcp_checksum_complete(skb);
4514         }
4515         return result;
4516 }
4517
4518 static inline int tcp_checksum_complete_user(struct sock *sk,
4519                                              struct sk_buff *skb)
4520 {
4521         return !skb_csum_unnecessary(skb) &&
4522                __tcp_checksum_complete_user(sk, skb);
4523 }
4524
4525 #ifdef CONFIG_NET_DMA
4526 static int tcp_dma_try_early_copy(struct sock *sk, struct sk_buff *skb,
4527                                   int hlen)
4528 {
4529         struct tcp_sock *tp = tcp_sk(sk);
4530         int chunk = skb->len - hlen;
4531         int dma_cookie;
4532         int copied_early = 0;
4533
4534         if (tp->ucopy.wakeup)
4535                 return 0;
4536
4537         if (!tp->ucopy.dma_chan && tp->ucopy.pinned_list)
4538                 tp->ucopy.dma_chan = get_softnet_dma();
4539
4540         if (tp->ucopy.dma_chan && skb_csum_unnecessary(skb)) {
4541
4542                 dma_cookie = dma_skb_copy_datagram_iovec(tp->ucopy.dma_chan,
4543                                                          skb, hlen,
4544                                                          tp->ucopy.iov, chunk,
4545                                                          tp->ucopy.pinned_list);
4546
4547                 if (dma_cookie < 0)
4548                         goto out;
4549
4550                 tp->ucopy.dma_cookie = dma_cookie;
4551                 copied_early = 1;
4552
4553                 tp->ucopy.len -= chunk;
4554                 tp->copied_seq += chunk;
4555                 tcp_rcv_space_adjust(sk);
4556
4557                 if ((tp->ucopy.len == 0) ||
4558                     (tcp_flag_word(tcp_hdr(skb)) & TCP_FLAG_PSH) ||
4559                     (atomic_read(&sk->sk_rmem_alloc) > (sk->sk_rcvbuf >> 1))) {
4560                         tp->ucopy.wakeup = 1;
4561                         sk->sk_data_ready(sk, 0);
4562                 }
4563         } else if (chunk > 0) {
4564                 tp->ucopy.wakeup = 1;
4565                 sk->sk_data_ready(sk, 0);
4566         }
4567 out:
4568         return copied_early;
4569 }
4570 #endif /* CONFIG_NET_DMA */
4571
4572 /*
4573  *      TCP receive function for the ESTABLISHED state.
4574  *
4575  *      It is split into a fast path and a slow path. The fast path is
4576  *      disabled when:
4577  *      - A zero window was announced from us - zero window probing
4578  *        is only handled properly in the slow path.
4579  *      - Out of order segments arrived.
4580  *      - Urgent data is expected.
4581  *      - There is no buffer space left
4582  *      - Unexpected TCP flags/window values/header lengths are received
4583  *        (detected by checking the TCP header against pred_flags)
4584  *      - Data is sent in both directions. Fast path only supports pure senders
4585  *        or pure receivers (this means either the sequence number or the ack
4586  *        value must stay constant)
4587  *      - Unexpected TCP option.
4588  *
4589  *      When these conditions are not satisfied it drops into a standard
4590  *      receive procedure patterned after RFC793 to handle all cases.
4591  *      The first three cases are guaranteed by proper pred_flags setting,
4592  *      the rest is checked inline. Fast processing is turned on in
4593  *      tcp_data_queue when everything is OK.
4594  */
4595 int tcp_rcv_established(struct sock *sk, struct sk_buff *skb,
4596                         struct tcphdr *th, unsigned len)
4597 {
4598         struct tcp_sock *tp = tcp_sk(sk);
4599
4600         /*
4601          *      Header prediction.
4602          *      The code loosely follows the one in the famous
4603          *      "30 instruction TCP receive" Van Jacobson mail.
4604          *
4605          *      Van's trick is to deposit buffers into socket queue
4606          *      on a device interrupt, to call tcp_recv function
4607          *      on the receive process context and checksum and copy
4608          *      the buffer to user space. smart...
4609          *
4610          *      Our current scheme is not silly either but we take the
4611          *      extra cost of the net_bh soft interrupt processing...
4612          *      We do checksum and copy also but from device to kernel.
4613          */
4614
4615         tp->rx_opt.saw_tstamp = 0;
4616
4617         /*      pred_flags is 0xS?10 << 16 + snd_wnd
4618          *      if header_prediction is to be made
4619          *      'S' will always be tp->tcp_header_len >> 2
4620          *      '?' will be 0 for the fast path, otherwise pred_flags is 0 to
4621          *  turn it off (when there are holes in the receive
4622          *       space for instance)
4623          *      PSH flag is ignored.
4624          */
4625
4626         if ((tcp_flag_word(th) & TCP_HP_BITS) == tp->pred_flags &&
4627             TCP_SKB_CB(skb)->seq == tp->rcv_nxt) {
4628                 int tcp_header_len = tp->tcp_header_len;
4629
4630                 /* Timestamp header prediction: tcp_header_len
4631                  * is automatically equal to th->doff*4 due to pred_flags
4632                  * match.
4633                  */
4634
4635                 /* Check timestamp */
4636                 if (tcp_header_len == sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) {
4637                         __be32 *ptr = (__be32 *)(th + 1);
4638
4639                         /* No? Slow path! */
4640                         if (*ptr != htonl((TCPOPT_NOP << 24) | (TCPOPT_NOP << 16)
4641                                           | (TCPOPT_TIMESTAMP << 8) | TCPOLEN_TIMESTAMP))
4642                                 goto slow_path;
4643
4644                         tp->rx_opt.saw_tstamp = 1;
4645                         ++ptr;
4646                         tp->rx_opt.rcv_tsval = ntohl(*ptr);
4647                         ++ptr;
4648                         tp->rx_opt.rcv_tsecr = ntohl(*ptr);
4649
4650                         /* If PAWS failed, check it more carefully in slow path */
4651                         if ((s32)(tp->rx_opt.rcv_tsval - tp->rx_opt.ts_recent) < 0)
4652                                 goto slow_path;
4653
4654                         /* DO NOT update ts_recent here, if checksum fails
4655                          * and timestamp was corrupted part, it will result
4656                          * in a hung connection since we will drop all
4657                          * future packets due to the PAWS test.
4658                          */
4659                 }
4660
4661                 if (len <= tcp_header_len) {
4662                         /* Bulk data transfer: sender */
4663                         if (len == tcp_header_len) {
4664                                 /* Predicted packet is in window by definition.
4665                                  * seq == rcv_nxt and rcv_wup <= rcv_nxt.
4666                                  * Hence, check seq<=rcv_wup reduces to:
4667                                  */
4668                                 if (tcp_header_len ==
4669                                     (sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) &&
4670                                     tp->rcv_nxt == tp->rcv_wup)
4671                                         tcp_store_ts_recent(tp);
4672
4673                                 /* We know that such packets are checksummed
4674                                  * on entry.
4675                                  */
4676                                 tcp_ack(sk, skb, 0);
4677                                 __kfree_skb(skb);
4678                                 tcp_data_snd_check(sk);
4679                                 return 0;
4680                         } else { /* Header too small */
4681                                 TCP_INC_STATS_BH(TCP_MIB_INERRS);
4682                                 goto discard;
4683                         }
4684                 } else {
4685                         int eaten = 0;
4686                         int copied_early = 0;
4687
4688                         if (tp->copied_seq == tp->rcv_nxt &&
4689                             len - tcp_header_len <= tp->ucopy.len) {
4690 #ifdef CONFIG_NET_DMA
4691                                 if (tcp_dma_try_early_copy(sk, skb, tcp_header_len)) {
4692                                         copied_early = 1;
4693                                         eaten = 1;
4694                                 }
4695 #endif
4696                                 if (tp->ucopy.task == current &&
4697                                     sock_owned_by_user(sk) && !copied_early) {
4698                                         __set_current_state(TASK_RUNNING);
4699
4700                                         if (!tcp_copy_to_iovec(sk, skb, tcp_header_len))
4701                                                 eaten = 1;
4702                                 }
4703                                 if (eaten) {
4704                                         /* Predicted packet is in window by definition.
4705                                          * seq == rcv_nxt and rcv_wup <= rcv_nxt.
4706                                          * Hence, check seq<=rcv_wup reduces to:
4707                                          */
4708                                         if (tcp_header_len ==
4709                                             (sizeof(struct tcphdr) +
4710                                              TCPOLEN_TSTAMP_ALIGNED) &&
4711                                             tp->rcv_nxt == tp->rcv_wup)
4712                                                 tcp_store_ts_recent(tp);
4713
4714                                         tcp_rcv_rtt_measure_ts(sk, skb);
4715
4716                                         __skb_pull(skb, tcp_header_len);
4717                                         tp->rcv_nxt = TCP_SKB_CB(skb)->end_seq;
4718                                         NET_INC_STATS_BH(LINUX_MIB_TCPHPHITSTOUSER);
4719                                 }
4720                                 if (copied_early)
4721                                         tcp_cleanup_rbuf(sk, skb->len);
4722                         }
4723                         if (!eaten) {
4724                                 if (tcp_checksum_complete_user(sk, skb))
4725                                         goto csum_error;
4726
4727                                 /* Predicted packet is in window by definition.
4728                                  * seq == rcv_nxt and rcv_wup <= rcv_nxt.
4729                                  * Hence, check seq<=rcv_wup reduces to:
4730                                  */
4731                                 if (tcp_header_len ==
4732                                     (sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) &&
4733                                     tp->rcv_nxt == tp->rcv_wup)
4734                                         tcp_store_ts_recent(tp);
4735
4736                                 tcp_rcv_rtt_measure_ts(sk, skb);
4737
4738                                 if ((int)skb->truesize > sk->sk_forward_alloc)
4739                                         goto step5;
4740
4741                                 NET_INC_STATS_BH(LINUX_MIB_TCPHPHITS);
4742
4743                                 /* Bulk data transfer: receiver */
4744                                 __skb_pull(skb, tcp_header_len);
4745                                 __skb_queue_tail(&sk->sk_receive_queue, skb);
4746                                 skb_set_owner_r(skb, sk);
4747                                 tp->rcv_nxt = TCP_SKB_CB(skb)->end_seq;
4748                         }
4749
4750                         tcp_event_data_recv(sk, skb);
4751
4752                         if (TCP_SKB_CB(skb)->ack_seq != tp->snd_una) {
4753                                 /* Well, only one small jumplet in fast path... */
4754                                 tcp_ack(sk, skb, FLAG_DATA);
4755                                 tcp_data_snd_check(sk);
4756                                 if (!inet_csk_ack_scheduled(sk))
4757                                         goto no_ack;
4758                         }
4759
4760                         __tcp_ack_snd_check(sk, 0);
4761 no_ack:
4762 #ifdef CONFIG_NET_DMA
4763                         if (copied_early)
4764                                 __skb_queue_tail(&sk->sk_async_wait_queue, skb);
4765                         else
4766 #endif
4767                         if (eaten)
4768                                 __kfree_skb(skb);
4769                         else
4770                                 sk->sk_data_ready(sk, 0);
4771                         return 0;
4772                 }
4773         }
4774
4775 slow_path:
4776         if (len < (th->doff << 2) || tcp_checksum_complete_user(sk, skb))
4777                 goto csum_error;
4778
4779         /*
4780          * RFC1323: H1. Apply PAWS check first.
4781          */
4782         if (tcp_fast_parse_options(skb, th, tp) && tp->rx_opt.saw_tstamp &&
4783             tcp_paws_discard(sk, skb)) {
4784                 if (!th->rst) {
4785                         NET_INC_STATS_BH(LINUX_MIB_PAWSESTABREJECTED);
4786                         tcp_send_dupack(sk, skb);
4787                         goto discard;
4788                 }
4789                 /* Resets are accepted even if PAWS failed.
4790
4791                    ts_recent update must be made after we are sure
4792                    that the packet is in window.
4793                  */
4794         }
4795
4796         /*
4797          *      Standard slow path.
4798          */
4799
4800         if (!tcp_sequence(tp, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq)) {
4801                 /* RFC793, page 37: "In all states except SYN-SENT, all reset
4802                  * (RST) segments are validated by checking their SEQ-fields."
4803                  * And page 69: "If an incoming segment is not acceptable,
4804                  * an acknowledgment should be sent in reply (unless the RST bit
4805                  * is set, if so drop the segment and return)".
4806                  */
4807                 if (!th->rst)
4808                         tcp_send_dupack(sk, skb);
4809                 goto discard;
4810         }
4811
4812         if (th->rst) {
4813                 tcp_reset(sk);
4814                 goto discard;
4815         }
4816
4817         tcp_replace_ts_recent(tp, TCP_SKB_CB(skb)->seq);
4818
4819         if (th->syn && !before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
4820                 TCP_INC_STATS_BH(TCP_MIB_INERRS);
4821                 NET_INC_STATS_BH(LINUX_MIB_TCPABORTONSYN);
4822                 tcp_reset(sk);
4823                 return 1;
4824         }
4825
4826 step5:
4827         if (th->ack)
4828                 tcp_ack(sk, skb, FLAG_SLOWPATH);
4829
4830         tcp_rcv_rtt_measure_ts(sk, skb);
4831
4832         /* Process urgent data. */
4833         tcp_urg(sk, skb, th);
4834
4835         /* step 7: process the segment text */
4836         tcp_data_queue(sk, skb);
4837
4838         tcp_data_snd_check(sk);
4839         tcp_ack_snd_check(sk);
4840         return 0;
4841
4842 csum_error:
4843         TCP_INC_STATS_BH(TCP_MIB_INERRS);
4844
4845 discard:
4846         __kfree_skb(skb);
4847         return 0;
4848 }
4849
4850 static int tcp_rcv_synsent_state_process(struct sock *sk, struct sk_buff *skb,
4851                                          struct tcphdr *th, unsigned len)
4852 {
4853         struct tcp_sock *tp = tcp_sk(sk);
4854         struct inet_connection_sock *icsk = inet_csk(sk);
4855         int saved_clamp = tp->rx_opt.mss_clamp;
4856
4857         tcp_parse_options(skb, &tp->rx_opt, 0);
4858
4859         if (th->ack) {
4860                 /* rfc793:
4861                  * "If the state is SYN-SENT then
4862                  *    first check the ACK bit
4863                  *      If the ACK bit is set
4864                  *        If SEG.ACK =< ISS, or SEG.ACK > SND.NXT, send
4865                  *        a reset (unless the RST bit is set, if so drop
4866                  *        the segment and return)"
4867                  *
4868                  *  We do not send data with SYN, so that RFC-correct
4869                  *  test reduces to:
4870                  */
4871                 if (TCP_SKB_CB(skb)->ack_seq != tp->snd_nxt)
4872                         goto reset_and_undo;
4873
4874                 if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
4875                     !between(tp->rx_opt.rcv_tsecr, tp->retrans_stamp,
4876                              tcp_time_stamp)) {
4877                         NET_INC_STATS_BH(LINUX_MIB_PAWSACTIVEREJECTED);
4878                         goto reset_and_undo;
4879                 }
4880
4881                 /* Now ACK is acceptable.
4882                  *
4883                  * "If the RST bit is set
4884                  *    If the ACK was acceptable then signal the user "error:
4885                  *    connection reset", drop the segment, enter CLOSED state,
4886                  *    delete TCB, and return."
4887                  */
4888
4889                 if (th->rst) {
4890                         tcp_reset(sk);
4891                         goto discard;
4892                 }
4893
4894                 /* rfc793:
4895                  *   "fifth, if neither of the SYN or RST bits is set then
4896                  *    drop the segment and return."
4897                  *
4898                  *    See note below!
4899                  *                                        --ANK(990513)
4900                  */
4901                 if (!th->syn)
4902                         goto discard_and_undo;
4903
4904                 /* rfc793:
4905                  *   "If the SYN bit is on ...
4906                  *    are acceptable then ...
4907                  *    (our SYN has been ACKed), change the connection
4908                  *    state to ESTABLISHED..."
4909                  */
4910
4911                 TCP_ECN_rcv_synack(tp, th);
4912
4913                 tp->snd_wl1 = TCP_SKB_CB(skb)->seq;
4914                 tcp_ack(sk, skb, FLAG_SLOWPATH);
4915
4916                 /* Ok.. it's good. Set up sequence numbers and
4917                  * move to established.
4918                  */
4919                 tp->rcv_nxt = TCP_SKB_CB(skb)->seq + 1;
4920                 tp->rcv_wup = TCP_SKB_CB(skb)->seq + 1;
4921
4922                 /* RFC1323: The window in SYN & SYN/ACK segments is
4923                  * never scaled.
4924                  */
4925                 tp->snd_wnd = ntohs(th->window);
4926                 tcp_init_wl(tp, TCP_SKB_CB(skb)->ack_seq, TCP_SKB_CB(skb)->seq);
4927
4928                 if (!tp->rx_opt.wscale_ok) {
4929                         tp->rx_opt.snd_wscale = tp->rx_opt.rcv_wscale = 0;
4930                         tp->window_clamp = min(tp->window_clamp, 65535U);
4931                 }
4932
4933                 if (tp->rx_opt.saw_tstamp) {
4934                         tp->rx_opt.tstamp_ok       = 1;
4935                         tp->tcp_header_len =
4936                                 sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED;
4937                         tp->advmss          -= TCPOLEN_TSTAMP_ALIGNED;
4938                         tcp_store_ts_recent(tp);
4939                 } else {
4940                         tp->tcp_header_len = sizeof(struct tcphdr);
4941                 }
4942
4943                 if (tcp_is_sack(tp) && sysctl_tcp_fack)
4944                         tcp_enable_fack(tp);
4945
4946                 tcp_mtup_init(sk);
4947                 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
4948                 tcp_initialize_rcv_mss(sk);
4949
4950                 /* Remember, tcp_poll() does not lock socket!
4951                  * Change state from SYN-SENT only after copied_seq
4952                  * is initialized. */
4953                 tp->copied_seq = tp->rcv_nxt;
4954                 smp_mb();
4955                 tcp_set_state(sk, TCP_ESTABLISHED);
4956
4957                 security_inet_conn_established(sk, skb);
4958
4959                 /* Make sure socket is routed, for correct metrics.  */
4960                 icsk->icsk_af_ops->rebuild_header(sk);
4961
4962                 tcp_init_metrics(sk);
4963
4964                 tcp_init_congestion_control(sk);
4965
4966                 /* Prevent spurious tcp_cwnd_restart() on first data
4967                  * packet.
4968                  */
4969                 tp->lsndtime = tcp_time_stamp;
4970
4971                 tcp_init_buffer_space(sk);
4972
4973                 if (sock_flag(sk, SOCK_KEEPOPEN))
4974                         inet_csk_reset_keepalive_timer(sk, keepalive_time_when(tp));
4975
4976                 if (!tp->rx_opt.snd_wscale)
4977                         __tcp_fast_path_on(tp, tp->snd_wnd);
4978                 else
4979                         tp->pred_flags = 0;
4980
4981                 if (!sock_flag(sk, SOCK_DEAD)) {
4982                         sk->sk_state_change(sk);
4983                         sk_wake_async(sk, SOCK_WAKE_IO, POLL_OUT);
4984                 }
4985
4986                 if (sk->sk_write_pending ||
4987                     icsk->icsk_accept_queue.rskq_defer_accept ||
4988                     icsk->icsk_ack.pingpong) {
4989                         /* Save one ACK. Data will be ready after
4990                          * several ticks, if write_pending is set.
4991                          *
4992                          * It may be deleted, but with this feature tcpdumps
4993                          * look so _wonderfully_ clever, that I was not able
4994                          * to stand against the temptation 8)     --ANK
4995                          */
4996                         inet_csk_schedule_ack(sk);
4997                         icsk->icsk_ack.lrcvtime = tcp_time_stamp;
4998                         icsk->icsk_ack.ato       = TCP_ATO_MIN;
4999                         tcp_incr_quickack(sk);
5000                         tcp_enter_quickack_mode(sk);
5001                         inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK,
5002                                                   TCP_DELACK_MAX, TCP_RTO_MAX);
5003
5004 discard:
5005                         __kfree_skb(skb);
5006                         return 0;
5007                 } else {
5008                         tcp_send_ack(sk);
5009                 }
5010                 return -1;
5011         }
5012
5013         /* No ACK in the segment */
5014
5015         if (th->rst) {
5016                 /* rfc793:
5017                  * "If the RST bit is set
5018                  *
5019                  *      Otherwise (no ACK) drop the segment and return."
5020                  */
5021
5022                 goto discard_and_undo;
5023         }
5024
5025         /* PAWS check. */
5026         if (tp->rx_opt.ts_recent_stamp && tp->rx_opt.saw_tstamp &&
5027             tcp_paws_check(&tp->rx_opt, 0))
5028                 goto discard_and_undo;
5029
5030         if (th->syn) {
5031                 /* We see SYN without ACK. It is attempt of
5032                  * simultaneous connect with crossed SYNs.
5033                  * Particularly, it can be connect to self.
5034                  */
5035                 tcp_set_state(sk, TCP_SYN_RECV);
5036
5037                 if (tp->rx_opt.saw_tstamp) {
5038                         tp->rx_opt.tstamp_ok = 1;
5039                         tcp_store_ts_recent(tp);
5040                         tp->tcp_header_len =
5041                                 sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED;
5042                 } else {
5043                         tp->tcp_header_len = sizeof(struct tcphdr);
5044                 }
5045
5046                 tp->rcv_nxt = TCP_SKB_CB(skb)->seq + 1;
5047                 tp->rcv_wup = TCP_SKB_CB(skb)->seq + 1;
5048
5049                 /* RFC1323: The window in SYN & SYN/ACK segments is
5050                  * never scaled.
5051                  */
5052                 tp->snd_wnd    = ntohs(th->window);
5053                 tp->snd_wl1    = TCP_SKB_CB(skb)->seq;
5054                 tp->max_window = tp->snd_wnd;
5055
5056                 TCP_ECN_rcv_syn(tp, th);
5057
5058                 tcp_mtup_init(sk);
5059                 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
5060                 tcp_initialize_rcv_mss(sk);
5061
5062                 tcp_send_synack(sk);
5063 #if 0
5064                 /* Note, we could accept data and URG from this segment.
5065                  * There are no obstacles to make this.
5066                  *
5067                  * However, if we ignore data in ACKless segments sometimes,
5068                  * we have no reasons to accept it sometimes.
5069                  * Also, seems the code doing it in step6 of tcp_rcv_state_process
5070                  * is not flawless. So, discard packet for sanity.
5071                  * Uncomment this return to process the data.
5072                  */
5073                 return -1;
5074 #else
5075                 goto discard;
5076 #endif
5077         }
5078         /* "fifth, if neither of the SYN or RST bits is set then
5079          * drop the segment and return."
5080          */
5081
5082 discard_and_undo:
5083         tcp_clear_options(&tp->rx_opt);
5084         tp->rx_opt.mss_clamp = saved_clamp;
5085         goto discard;
5086
5087 reset_and_undo:
5088         tcp_clear_options(&tp->rx_opt);
5089         tp->rx_opt.mss_clamp = saved_clamp;
5090         return 1;
5091 }
5092
5093 /*
5094  *      This function implements the receiving procedure of RFC 793 for
5095  *      all states except ESTABLISHED and TIME_WAIT.
5096  *      It's called from both tcp_v4_rcv and tcp_v6_rcv and should be
5097  *      address independent.
5098  */
5099
5100 int tcp_rcv_state_process(struct sock *sk, struct sk_buff *skb,
5101                           struct tcphdr *th, unsigned len)
5102 {
5103         struct tcp_sock *tp = tcp_sk(sk);
5104         struct inet_connection_sock *icsk = inet_csk(sk);
5105         int queued = 0;
5106
5107         tp->rx_opt.saw_tstamp = 0;
5108
5109         switch (sk->sk_state) {
5110         case TCP_CLOSE:
5111                 goto discard;
5112
5113         case TCP_LISTEN:
5114                 if (th->ack)
5115                         return 1;
5116
5117                 if (th->rst)
5118                         goto discard;
5119
5120                 if (th->syn) {
5121                         if (icsk->icsk_af_ops->conn_request(sk, skb) < 0)
5122                                 return 1;
5123
5124                         /* Now we have several options: In theory there is
5125                          * nothing else in the frame. KA9Q has an option to
5126                          * send data with the syn, BSD accepts data with the
5127                          * syn up to the [to be] advertised window and
5128                          * Solaris 2.1 gives you a protocol error. For now
5129                          * we just ignore it, that fits the spec precisely
5130                          * and avoids incompatibilities. It would be nice in
5131                          * future to drop through and process the data.
5132                          *
5133                          * Now that TTCP is starting to be used we ought to
5134                          * queue this data.
5135                          * But, this leaves one open to an easy denial of
5136                          * service attack, and SYN cookies can't defend
5137                          * against this problem. So, we drop the data
5138                          * in the interest of security over speed unless
5139                          * it's still in use.
5140                          */
5141                         kfree_skb(skb);
5142                         return 0;
5143                 }
5144                 goto discard;
5145
5146         case TCP_SYN_SENT:
5147                 queued = tcp_rcv_synsent_state_process(sk, skb, th, len);
5148                 if (queued >= 0)
5149                         return queued;
5150
5151                 /* Do step6 onward by hand. */
5152                 tcp_urg(sk, skb, th);
5153                 __kfree_skb(skb);
5154                 tcp_data_snd_check(sk);
5155                 return 0;
5156         }
5157
5158         if (tcp_fast_parse_options(skb, th, tp) && tp->rx_opt.saw_tstamp &&
5159             tcp_paws_discard(sk, skb)) {
5160                 if (!th->rst) {
5161                         NET_INC_STATS_BH(LINUX_MIB_PAWSESTABREJECTED);
5162                         tcp_send_dupack(sk, skb);
5163                         goto discard;
5164                 }
5165                 /* Reset is accepted even if it did not pass PAWS. */
5166         }
5167
5168         /* step 1: check sequence number */
5169         if (!tcp_sequence(tp, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq)) {
5170                 if (!th->rst)
5171                         tcp_send_dupack(sk, skb);
5172                 goto discard;
5173         }
5174
5175         /* step 2: check RST bit */
5176         if (th->rst) {
5177                 tcp_reset(sk);
5178                 goto discard;
5179         }
5180
5181         tcp_replace_ts_recent(tp, TCP_SKB_CB(skb)->seq);
5182
5183         /* step 3: check security and precedence [ignored] */
5184
5185         /*      step 4:
5186          *
5187          *      Check for a SYN in window.
5188          */
5189         if (th->syn && !before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
5190                 NET_INC_STATS_BH(LINUX_MIB_TCPABORTONSYN);
5191                 tcp_reset(sk);
5192                 return 1;
5193         }
5194
5195         /* step 5: check the ACK field */
5196         if (th->ack) {
5197                 int acceptable = tcp_ack(sk, skb, FLAG_SLOWPATH);
5198
5199                 switch (sk->sk_state) {
5200                 case TCP_SYN_RECV:
5201                         if (acceptable) {
5202                                 tp->copied_seq = tp->rcv_nxt;
5203                                 smp_mb();
5204                                 tcp_set_state(sk, TCP_ESTABLISHED);
5205                                 sk->sk_state_change(sk);
5206
5207                                 /* Note, that this wakeup is only for marginal
5208                                  * crossed SYN case. Passively open sockets
5209                                  * are not waked up, because sk->sk_sleep ==
5210                                  * NULL and sk->sk_socket == NULL.
5211                                  */
5212                                 if (sk->sk_socket)
5213                                         sk_wake_async(sk,
5214                                                       SOCK_WAKE_IO, POLL_OUT);
5215
5216                                 tp->snd_una = TCP_SKB_CB(skb)->ack_seq;
5217                                 tp->snd_wnd = ntohs(th->window) <<
5218                                               tp->rx_opt.snd_wscale;
5219                                 tcp_init_wl(tp, TCP_SKB_CB(skb)->ack_seq,
5220                                             TCP_SKB_CB(skb)->seq);
5221
5222                                 /* tcp_ack considers this ACK as duplicate
5223                                  * and does not calculate rtt.
5224                                  * Fix it at least with timestamps.
5225                                  */
5226                                 if (tp->rx_opt.saw_tstamp &&
5227                                     tp->rx_opt.rcv_tsecr && !tp->srtt)
5228                                         tcp_ack_saw_tstamp(sk, 0);
5229
5230                                 if (tp->rx_opt.tstamp_ok)
5231                                         tp->advmss -= TCPOLEN_TSTAMP_ALIGNED;
5232
5233                                 /* Make sure socket is routed, for
5234                                  * correct metrics.
5235                                  */
5236                                 icsk->icsk_af_ops->rebuild_header(sk);
5237
5238                                 tcp_init_metrics(sk);
5239
5240                                 tcp_init_congestion_control(sk);
5241
5242                                 /* Prevent spurious tcp_cwnd_restart() on
5243                                  * first data packet.
5244                                  */
5245                                 tp->lsndtime = tcp_time_stamp;
5246
5247                                 tcp_mtup_init(sk);
5248                                 tcp_initialize_rcv_mss(sk);
5249                                 tcp_init_buffer_space(sk);
5250                                 tcp_fast_path_on(tp);
5251                         } else {
5252                                 return 1;
5253                         }
5254                         break;
5255
5256                 case TCP_FIN_WAIT1:
5257                         if (tp->snd_una == tp->write_seq) {
5258                                 tcp_set_state(sk, TCP_FIN_WAIT2);
5259                                 sk->sk_shutdown |= SEND_SHUTDOWN;
5260                                 dst_confirm(sk->sk_dst_cache);
5261
5262                                 if (!sock_flag(sk, SOCK_DEAD))
5263                                         /* Wake up lingering close() */
5264                                         sk->sk_state_change(sk);
5265                                 else {
5266                                         int tmo;
5267
5268                                         if (tp->linger2 < 0 ||
5269                                             (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
5270                                              after(TCP_SKB_CB(skb)->end_seq - th->fin, tp->rcv_nxt))) {
5271                                                 tcp_done(sk);
5272                                                 NET_INC_STATS_BH(LINUX_MIB_TCPABORTONDATA);
5273                                                 return 1;
5274                                         }
5275
5276                                         tmo = tcp_fin_time(sk);
5277                                         if (tmo > TCP_TIMEWAIT_LEN) {
5278                                                 inet_csk_reset_keepalive_timer(sk, tmo - TCP_TIMEWAIT_LEN);
5279                                         } else if (th->fin || sock_owned_by_user(sk)) {
5280                                                 /* Bad case. We could lose such FIN otherwise.
5281                                                  * It is not a big problem, but it looks confusing
5282                                                  * and not so rare event. We still can lose it now,
5283                                                  * if it spins in bh_lock_sock(), but it is really
5284                                                  * marginal case.
5285                                                  */
5286                                                 inet_csk_reset_keepalive_timer(sk, tmo);
5287                                         } else {
5288                                                 tcp_time_wait(sk, TCP_FIN_WAIT2, tmo);
5289                                                 goto discard;
5290                                         }
5291                                 }
5292                         }
5293                         break;
5294
5295                 case TCP_CLOSING:
5296                         if (tp->snd_una == tp->write_seq) {
5297                                 tcp_time_wait(sk, TCP_TIME_WAIT, 0);
5298                                 goto discard;
5299                         }
5300                         break;
5301
5302                 case TCP_LAST_ACK:
5303                         if (tp->snd_una == tp->write_seq) {
5304                                 tcp_update_metrics(sk);
5305                                 tcp_done(sk);
5306                                 goto discard;
5307                         }
5308                         break;
5309                 }
5310         } else
5311                 goto discard;
5312
5313         /* step 6: check the URG bit */
5314         tcp_urg(sk, skb, th);
5315
5316         /* step 7: process the segment text */
5317         switch (sk->sk_state) {
5318         case TCP_CLOSE_WAIT:
5319         case TCP_CLOSING:
5320         case TCP_LAST_ACK:
5321                 if (!before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt))
5322                         break;
5323         case TCP_FIN_WAIT1:
5324         case TCP_FIN_WAIT2:
5325                 /* RFC 793 says to queue data in these states,
5326                  * RFC 1122 says we MUST send a reset.
5327                  * BSD 4.4 also does reset.
5328                  */
5329                 if (sk->sk_shutdown & RCV_SHUTDOWN) {
5330                         if (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
5331                             after(TCP_SKB_CB(skb)->end_seq - th->fin, tp->rcv_nxt)) {
5332                                 NET_INC_STATS_BH(LINUX_MIB_TCPABORTONDATA);
5333                                 tcp_reset(sk);
5334                                 return 1;
5335                         }
5336                 }
5337                 /* Fall through */
5338         case TCP_ESTABLISHED:
5339                 tcp_data_queue(sk, skb);
5340                 queued = 1;
5341                 break;
5342         }
5343
5344         /* tcp_data could move socket to TIME-WAIT */
5345         if (sk->sk_state != TCP_CLOSE) {
5346                 tcp_data_snd_check(sk);
5347                 tcp_ack_snd_check(sk);
5348         }
5349
5350         if (!queued) {
5351 discard:
5352                 __kfree_skb(skb);
5353         }
5354         return 0;
5355 }
5356
5357 EXPORT_SYMBOL(sysctl_tcp_ecn);
5358 EXPORT_SYMBOL(sysctl_tcp_reordering);
5359 EXPORT_SYMBOL(tcp_parse_options);
5360 EXPORT_SYMBOL(tcp_rcv_established);
5361 EXPORT_SYMBOL(tcp_rcv_state_process);
5362 EXPORT_SYMBOL(tcp_initialize_rcv_mss);