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.
6 * Implementation of the Transmission Control Protocol(TCP).
8 * Version: $Id: tcp_output.c,v 1.146 2002/02/01 22:01:04 davem Exp $
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>
24 * Changes: Pedro Roque : Retransmit queue handled by TCP.
25 * : Fragmentation on mtu decrease
26 * : Segment collapse on retransmit
29 * Linus Torvalds : send_delayed_ack
30 * David S. Miller : Charge memory using the right skb
31 * during syn/ack processing.
32 * David S. Miller : Output engine completely rewritten.
33 * Andrea Arcangeli: SYNACK carry ts_recent in tsecr.
34 * Cacophonix Gaul : draft-minshall-nagle-01
35 * J Hadi Salim : ECN support
41 #include <linux/compiler.h>
42 #include <linux/module.h>
43 #include <linux/smp_lock.h>
45 /* People can turn this off for buggy TCP's found in printers etc. */
46 int sysctl_tcp_retrans_collapse __read_mostly = 1;
48 /* People can turn this on to work with those rare, broken TCPs that
49 * interpret the window field as a signed quantity.
51 int sysctl_tcp_workaround_signed_windows __read_mostly = 0;
53 /* This limits the percentage of the congestion window which we
54 * will allow a single TSO frame to consume. Building TSO frames
55 * which are too large can cause TCP streams to be bursty.
57 int sysctl_tcp_tso_win_divisor __read_mostly = 3;
59 int sysctl_tcp_mtu_probing __read_mostly = 0;
60 int sysctl_tcp_base_mss __read_mostly = 512;
62 /* By default, RFC2861 behavior. */
63 int sysctl_tcp_slow_start_after_idle __read_mostly = 1;
65 static void update_send_head(struct sock *sk, struct sk_buff *skb)
67 struct tcp_sock *tp = tcp_sk(sk);
69 tcp_advance_send_head(sk, skb);
70 tp->snd_nxt = TCP_SKB_CB(skb)->end_seq;
71 tcp_packets_out_inc(sk, skb);
74 /* SND.NXT, if window was not shrunk.
75 * If window has been shrunk, what should we make? It is not clear at all.
76 * Using SND.UNA we will fail to open window, SND.NXT is out of window. :-(
77 * Anything in between SND.UNA...SND.UNA+SND.WND also can be already
78 * invalid. OK, let's make this for now:
80 static inline __u32 tcp_acceptable_seq(struct sock *sk)
82 struct tcp_sock *tp = tcp_sk(sk);
84 if (!before(tp->snd_una+tp->snd_wnd, tp->snd_nxt))
87 return tp->snd_una+tp->snd_wnd;
90 /* Calculate mss to advertise in SYN segment.
91 * RFC1122, RFC1063, draft-ietf-tcpimpl-pmtud-01 state that:
93 * 1. It is independent of path mtu.
94 * 2. Ideally, it is maximal possible segment size i.e. 65535-40.
95 * 3. For IPv4 it is reasonable to calculate it from maximal MTU of
96 * attached devices, because some buggy hosts are confused by
98 * 4. We do not make 3, we advertise MSS, calculated from first
99 * hop device mtu, but allow to raise it to ip_rt_min_advmss.
100 * This may be overridden via information stored in routing table.
101 * 5. Value 65535 for MSS is valid in IPv6 and means "as large as possible,
102 * probably even Jumbo".
104 static __u16 tcp_advertise_mss(struct sock *sk)
106 struct tcp_sock *tp = tcp_sk(sk);
107 struct dst_entry *dst = __sk_dst_get(sk);
108 int mss = tp->advmss;
110 if (dst && dst_metric(dst, RTAX_ADVMSS) < mss) {
111 mss = dst_metric(dst, RTAX_ADVMSS);
118 /* RFC2861. Reset CWND after idle period longer RTO to "restart window".
119 * This is the first part of cwnd validation mechanism. */
120 static void tcp_cwnd_restart(struct sock *sk, struct dst_entry *dst)
122 struct tcp_sock *tp = tcp_sk(sk);
123 s32 delta = tcp_time_stamp - tp->lsndtime;
124 u32 restart_cwnd = tcp_init_cwnd(tp, dst);
125 u32 cwnd = tp->snd_cwnd;
127 tcp_ca_event(sk, CA_EVENT_CWND_RESTART);
129 tp->snd_ssthresh = tcp_current_ssthresh(sk);
130 restart_cwnd = min(restart_cwnd, cwnd);
132 while ((delta -= inet_csk(sk)->icsk_rto) > 0 && cwnd > restart_cwnd)
134 tp->snd_cwnd = max(cwnd, restart_cwnd);
135 tp->snd_cwnd_stamp = tcp_time_stamp;
136 tp->snd_cwnd_used = 0;
139 static void tcp_event_data_sent(struct tcp_sock *tp,
140 struct sk_buff *skb, struct sock *sk)
142 struct inet_connection_sock *icsk = inet_csk(sk);
143 const u32 now = tcp_time_stamp;
145 if (sysctl_tcp_slow_start_after_idle &&
146 (!tp->packets_out && (s32)(now - tp->lsndtime) > icsk->icsk_rto))
147 tcp_cwnd_restart(sk, __sk_dst_get(sk));
151 /* If it is a reply for ato after last received
152 * packet, enter pingpong mode.
154 if ((u32)(now - icsk->icsk_ack.lrcvtime) < icsk->icsk_ack.ato)
155 icsk->icsk_ack.pingpong = 1;
158 static inline void tcp_event_ack_sent(struct sock *sk, unsigned int pkts)
160 tcp_dec_quickack_mode(sk, pkts);
161 inet_csk_clear_xmit_timer(sk, ICSK_TIME_DACK);
164 /* Determine a window scaling and initial window to offer.
165 * Based on the assumption that the given amount of space
166 * will be offered. Store the results in the tp structure.
167 * NOTE: for smooth operation initial space offering should
168 * be a multiple of mss if possible. We assume here that mss >= 1.
169 * This MUST be enforced by all callers.
171 void tcp_select_initial_window(int __space, __u32 mss,
172 __u32 *rcv_wnd, __u32 *window_clamp,
173 int wscale_ok, __u8 *rcv_wscale)
175 unsigned int space = (__space < 0 ? 0 : __space);
177 /* If no clamp set the clamp to the max possible scaled window */
178 if (*window_clamp == 0)
179 (*window_clamp) = (65535 << 14);
180 space = min(*window_clamp, space);
182 /* Quantize space offering to a multiple of mss if possible. */
184 space = (space / mss) * mss;
186 /* NOTE: offering an initial window larger than 32767
187 * will break some buggy TCP stacks. If the admin tells us
188 * it is likely we could be speaking with such a buggy stack
189 * we will truncate our initial window offering to 32K-1
190 * unless the remote has sent us a window scaling option,
191 * which we interpret as a sign the remote TCP is not
192 * misinterpreting the window field as a signed quantity.
194 if (sysctl_tcp_workaround_signed_windows)
195 (*rcv_wnd) = min(space, MAX_TCP_WINDOW);
201 /* Set window scaling on max possible window
202 * See RFC1323 for an explanation of the limit to 14
204 space = max_t(u32, sysctl_tcp_rmem[2], sysctl_rmem_max);
205 space = min_t(u32, space, *window_clamp);
206 while (space > 65535 && (*rcv_wscale) < 14) {
212 /* Set initial window to value enough for senders,
213 * following RFC2414. Senders, not following this RFC,
214 * will be satisfied with 2.
216 if (mss > (1<<*rcv_wscale)) {
222 if (*rcv_wnd > init_cwnd*mss)
223 *rcv_wnd = init_cwnd*mss;
226 /* Set the clamp no higher than max representable value */
227 (*window_clamp) = min(65535U << (*rcv_wscale), *window_clamp);
230 /* Chose a new window to advertise, update state in tcp_sock for the
231 * socket, and return result with RFC1323 scaling applied. The return
232 * value can be stuffed directly into th->window for an outgoing
235 static u16 tcp_select_window(struct sock *sk)
237 struct tcp_sock *tp = tcp_sk(sk);
238 u32 cur_win = tcp_receive_window(tp);
239 u32 new_win = __tcp_select_window(sk);
241 /* Never shrink the offered window */
242 if (new_win < cur_win) {
243 /* Danger Will Robinson!
244 * Don't update rcv_wup/rcv_wnd here or else
245 * we will not be able to advertise a zero
246 * window in time. --DaveM
248 * Relax Will Robinson.
252 tp->rcv_wnd = new_win;
253 tp->rcv_wup = tp->rcv_nxt;
255 /* Make sure we do not exceed the maximum possible
258 if (!tp->rx_opt.rcv_wscale && sysctl_tcp_workaround_signed_windows)
259 new_win = min(new_win, MAX_TCP_WINDOW);
261 new_win = min(new_win, (65535U << tp->rx_opt.rcv_wscale));
263 /* RFC1323 scaling applied */
264 new_win >>= tp->rx_opt.rcv_wscale;
266 /* If we advertise zero window, disable fast path. */
273 static void tcp_build_and_update_options(__be32 *ptr, struct tcp_sock *tp,
274 __u32 tstamp, __u8 **md5_hash)
276 if (tp->rx_opt.tstamp_ok) {
277 *ptr++ = htonl((TCPOPT_NOP << 24) |
279 (TCPOPT_TIMESTAMP << 8) |
281 *ptr++ = htonl(tstamp);
282 *ptr++ = htonl(tp->rx_opt.ts_recent);
284 if (tp->rx_opt.eff_sacks) {
285 struct tcp_sack_block *sp = tp->rx_opt.dsack ? tp->duplicate_sack : tp->selective_acks;
288 *ptr++ = htonl((TCPOPT_NOP << 24) |
291 (TCPOLEN_SACK_BASE + (tp->rx_opt.eff_sacks *
292 TCPOLEN_SACK_PERBLOCK)));
294 for (this_sack = 0; this_sack < tp->rx_opt.eff_sacks; this_sack++) {
295 *ptr++ = htonl(sp[this_sack].start_seq);
296 *ptr++ = htonl(sp[this_sack].end_seq);
299 if (tp->rx_opt.dsack) {
300 tp->rx_opt.dsack = 0;
301 tp->rx_opt.eff_sacks--;
304 #ifdef CONFIG_TCP_MD5SIG
306 *ptr++ = htonl((TCPOPT_NOP << 24) |
308 (TCPOPT_MD5SIG << 8) |
310 *md5_hash = (__u8 *)ptr;
315 /* Construct a tcp options header for a SYN or SYN_ACK packet.
316 * If this is every changed make sure to change the definition of
317 * MAX_SYN_SIZE to match the new maximum number of options that you
320 * Note - that with the RFC2385 TCP option, we make room for the
321 * 16 byte MD5 hash. This will be filled in later, so the pointer for the
322 * location to be filled is passed back up.
324 static void tcp_syn_build_options(__be32 *ptr, int mss, int ts, int sack,
325 int offer_wscale, int wscale, __u32 tstamp,
326 __u32 ts_recent, __u8 **md5_hash)
328 /* We always get an MSS option.
329 * The option bytes which will be seen in normal data
330 * packets should timestamps be used, must be in the MSS
331 * advertised. But we subtract them from tp->mss_cache so
332 * that calculations in tcp_sendmsg are simpler etc.
333 * So account for this fact here if necessary. If we
334 * don't do this correctly, as a receiver we won't
335 * recognize data packets as being full sized when we
336 * should, and thus we won't abide by the delayed ACK
338 * SACKs don't matter, we never delay an ACK when we
339 * have any of those going out.
341 *ptr++ = htonl((TCPOPT_MSS << 24) | (TCPOLEN_MSS << 16) | mss);
344 *ptr++ = htonl((TCPOPT_SACK_PERM << 24) |
345 (TCPOLEN_SACK_PERM << 16) |
346 (TCPOPT_TIMESTAMP << 8) |
349 *ptr++ = htonl((TCPOPT_NOP << 24) |
351 (TCPOPT_TIMESTAMP << 8) |
353 *ptr++ = htonl(tstamp); /* TSVAL */
354 *ptr++ = htonl(ts_recent); /* TSECR */
356 *ptr++ = htonl((TCPOPT_NOP << 24) |
358 (TCPOPT_SACK_PERM << 8) |
361 *ptr++ = htonl((TCPOPT_NOP << 24) |
362 (TCPOPT_WINDOW << 16) |
363 (TCPOLEN_WINDOW << 8) |
365 #ifdef CONFIG_TCP_MD5SIG
367 * If MD5 is enabled, then we set the option, and include the size
368 * (always 18). The actual MD5 hash is added just before the
372 *ptr++ = htonl((TCPOPT_NOP << 24) |
374 (TCPOPT_MD5SIG << 8) |
376 *md5_hash = (__u8 *) ptr;
381 /* This routine actually transmits TCP packets queued in by
382 * tcp_do_sendmsg(). This is used by both the initial
383 * transmission and possible later retransmissions.
384 * All SKB's seen here are completely headerless. It is our
385 * job to build the TCP header, and pass the packet down to
386 * IP so it can do the same plus pass the packet off to the
389 * We are working here with either a clone of the original
390 * SKB, or a fresh unique copy made by the retransmit engine.
392 static int tcp_transmit_skb(struct sock *sk, struct sk_buff *skb, int clone_it, gfp_t gfp_mask)
394 const struct inet_connection_sock *icsk = inet_csk(sk);
395 struct inet_sock *inet;
397 struct tcp_skb_cb *tcb;
399 #ifdef CONFIG_TCP_MD5SIG
400 struct tcp_md5sig_key *md5;
401 __u8 *md5_hash_location;
407 BUG_ON(!skb || !tcp_skb_pcount(skb));
409 /* If congestion control is doing timestamping, we must
410 * take such a timestamp before we potentially clone/copy.
412 if (icsk->icsk_ca_ops->flags & TCP_CONG_RTT_STAMP)
413 __net_timestamp(skb);
415 if (likely(clone_it)) {
416 if (unlikely(skb_cloned(skb)))
417 skb = pskb_copy(skb, gfp_mask);
419 skb = skb_clone(skb, gfp_mask);
426 tcb = TCP_SKB_CB(skb);
427 tcp_header_size = tp->tcp_header_len;
429 #define SYSCTL_FLAG_TSTAMPS 0x1
430 #define SYSCTL_FLAG_WSCALE 0x2
431 #define SYSCTL_FLAG_SACK 0x4
434 if (unlikely(tcb->flags & TCPCB_FLAG_SYN)) {
435 tcp_header_size = sizeof(struct tcphdr) + TCPOLEN_MSS;
436 if (sysctl_tcp_timestamps) {
437 tcp_header_size += TCPOLEN_TSTAMP_ALIGNED;
438 sysctl_flags |= SYSCTL_FLAG_TSTAMPS;
440 if (sysctl_tcp_window_scaling) {
441 tcp_header_size += TCPOLEN_WSCALE_ALIGNED;
442 sysctl_flags |= SYSCTL_FLAG_WSCALE;
444 if (sysctl_tcp_sack) {
445 sysctl_flags |= SYSCTL_FLAG_SACK;
446 if (!(sysctl_flags & SYSCTL_FLAG_TSTAMPS))
447 tcp_header_size += TCPOLEN_SACKPERM_ALIGNED;
449 } else if (unlikely(tp->rx_opt.eff_sacks)) {
450 /* A SACK is 2 pad bytes, a 2 byte header, plus
451 * 2 32-bit sequence numbers for each SACK block.
453 tcp_header_size += (TCPOLEN_SACK_BASE_ALIGNED +
454 (tp->rx_opt.eff_sacks *
455 TCPOLEN_SACK_PERBLOCK));
458 if (tcp_packets_in_flight(tp) == 0)
459 tcp_ca_event(sk, CA_EVENT_TX_START);
461 #ifdef CONFIG_TCP_MD5SIG
463 * Are we doing MD5 on this segment? If so - make
466 md5 = tp->af_specific->md5_lookup(sk, sk);
468 tcp_header_size += TCPOLEN_MD5SIG_ALIGNED;
471 skb_push(skb, tcp_header_size);
472 skb_reset_transport_header(skb);
473 skb_set_owner_w(skb, sk);
475 /* Build TCP header and checksum it. */
477 th->source = inet->sport;
478 th->dest = inet->dport;
479 th->seq = htonl(tcb->seq);
480 th->ack_seq = htonl(tp->rcv_nxt);
481 *(((__be16 *)th) + 6) = htons(((tcp_header_size >> 2) << 12) |
484 if (unlikely(tcb->flags & TCPCB_FLAG_SYN)) {
485 /* RFC1323: The window in SYN & SYN/ACK segments
488 th->window = htons(min(tp->rcv_wnd, 65535U));
490 th->window = htons(tcp_select_window(sk));
495 if (unlikely(tp->urg_mode &&
496 between(tp->snd_up, tcb->seq+1, tcb->seq+0xFFFF))) {
497 th->urg_ptr = htons(tp->snd_up-tcb->seq);
501 if (unlikely(tcb->flags & TCPCB_FLAG_SYN)) {
502 tcp_syn_build_options((__be32 *)(th + 1),
503 tcp_advertise_mss(sk),
504 (sysctl_flags & SYSCTL_FLAG_TSTAMPS),
505 (sysctl_flags & SYSCTL_FLAG_SACK),
506 (sysctl_flags & SYSCTL_FLAG_WSCALE),
507 tp->rx_opt.rcv_wscale,
509 tp->rx_opt.ts_recent,
511 #ifdef CONFIG_TCP_MD5SIG
512 md5 ? &md5_hash_location :
516 tcp_build_and_update_options((__be32 *)(th + 1),
518 #ifdef CONFIG_TCP_MD5SIG
519 md5 ? &md5_hash_location :
522 TCP_ECN_send(sk, skb, tcp_header_size);
525 #ifdef CONFIG_TCP_MD5SIG
526 /* Calculate the MD5 hash, as we have all we need now */
528 tp->af_specific->calc_md5_hash(md5_hash_location,
537 icsk->icsk_af_ops->send_check(sk, skb->len, skb);
539 if (likely(tcb->flags & TCPCB_FLAG_ACK))
540 tcp_event_ack_sent(sk, tcp_skb_pcount(skb));
542 if (skb->len != tcp_header_size)
543 tcp_event_data_sent(tp, skb, sk);
545 if (after(tcb->end_seq, tp->snd_nxt) || tcb->seq == tcb->end_seq)
546 TCP_INC_STATS(TCP_MIB_OUTSEGS);
548 err = icsk->icsk_af_ops->queue_xmit(skb, 0);
549 if (likely(err <= 0))
552 tcp_enter_cwr(sk, 1);
554 return net_xmit_eval(err);
556 #undef SYSCTL_FLAG_TSTAMPS
557 #undef SYSCTL_FLAG_WSCALE
558 #undef SYSCTL_FLAG_SACK
562 /* This routine just queue's the buffer
564 * NOTE: probe0 timer is not checked, do not forget tcp_push_pending_frames,
565 * otherwise socket can stall.
567 static void tcp_queue_skb(struct sock *sk, struct sk_buff *skb)
569 struct tcp_sock *tp = tcp_sk(sk);
571 /* Advance write_seq and place onto the write_queue. */
572 tp->write_seq = TCP_SKB_CB(skb)->end_seq;
573 skb_header_release(skb);
574 tcp_add_write_queue_tail(sk, skb);
575 sk_charge_skb(sk, skb);
578 static void tcp_set_skb_tso_segs(struct sock *sk, struct sk_buff *skb, unsigned int mss_now)
580 if (skb->len <= mss_now || !sk_can_gso(sk)) {
581 /* Avoid the costly divide in the normal
584 skb_shinfo(skb)->gso_segs = 1;
585 skb_shinfo(skb)->gso_size = 0;
586 skb_shinfo(skb)->gso_type = 0;
590 factor = skb->len + (mss_now - 1);
592 skb_shinfo(skb)->gso_segs = factor;
593 skb_shinfo(skb)->gso_size = mss_now;
594 skb_shinfo(skb)->gso_type = sk->sk_gso_type;
598 /* Function to create two new TCP segments. Shrinks the given segment
599 * to the specified size and appends a new segment with the rest of the
600 * packet to the list. This won't be called frequently, I hope.
601 * Remember, these are still headerless SKBs at this point.
603 int tcp_fragment(struct sock *sk, struct sk_buff *skb, u32 len, unsigned int mss_now)
605 struct tcp_sock *tp = tcp_sk(sk);
606 struct sk_buff *buff;
607 int nsize, old_factor;
611 BUG_ON(len > skb->len);
613 clear_all_retrans_hints(tp);
614 nsize = skb_headlen(skb) - len;
618 if (skb_cloned(skb) &&
619 skb_is_nonlinear(skb) &&
620 pskb_expand_head(skb, 0, 0, GFP_ATOMIC))
623 /* Get a new skb... force flag on. */
624 buff = sk_stream_alloc_skb(sk, nsize, GFP_ATOMIC);
626 return -ENOMEM; /* We'll just try again later. */
628 sk_charge_skb(sk, buff);
629 nlen = skb->len - len - nsize;
630 buff->truesize += nlen;
631 skb->truesize -= nlen;
633 /* Correct the sequence numbers. */
634 TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len;
635 TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq;
636 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq;
638 /* PSH and FIN should only be set in the second packet. */
639 flags = TCP_SKB_CB(skb)->flags;
640 TCP_SKB_CB(skb)->flags = flags & ~(TCPCB_FLAG_FIN|TCPCB_FLAG_PSH);
641 TCP_SKB_CB(buff)->flags = flags;
642 TCP_SKB_CB(buff)->sacked = TCP_SKB_CB(skb)->sacked;
643 TCP_SKB_CB(skb)->sacked &= ~TCPCB_AT_TAIL;
645 if (!skb_shinfo(skb)->nr_frags && skb->ip_summed != CHECKSUM_PARTIAL) {
646 /* Copy and checksum data tail into the new buffer. */
647 buff->csum = csum_partial_copy_nocheck(skb->data + len, skb_put(buff, nsize),
652 skb->csum = csum_block_sub(skb->csum, buff->csum, len);
654 skb->ip_summed = CHECKSUM_PARTIAL;
655 skb_split(skb, buff, len);
658 buff->ip_summed = skb->ip_summed;
660 /* Looks stupid, but our code really uses when of
661 * skbs, which it never sent before. --ANK
663 TCP_SKB_CB(buff)->when = TCP_SKB_CB(skb)->when;
664 buff->tstamp = skb->tstamp;
666 old_factor = tcp_skb_pcount(skb);
668 /* Fix up tso_factor for both original and new SKB. */
669 tcp_set_skb_tso_segs(sk, skb, mss_now);
670 tcp_set_skb_tso_segs(sk, buff, mss_now);
672 /* If this packet has been sent out already, we must
673 * adjust the various packet counters.
675 if (!before(tp->snd_nxt, TCP_SKB_CB(buff)->end_seq)) {
676 int diff = old_factor - tcp_skb_pcount(skb) -
677 tcp_skb_pcount(buff);
679 tp->packets_out -= diff;
681 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)
682 tp->sacked_out -= diff;
683 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS)
684 tp->retrans_out -= diff;
686 if (TCP_SKB_CB(skb)->sacked & TCPCB_LOST) {
687 tp->lost_out -= diff;
688 tp->left_out -= diff;
692 /* Adjust Reno SACK estimate. */
693 if (!tp->rx_opt.sack_ok) {
694 tp->sacked_out -= diff;
695 if ((int)tp->sacked_out < 0)
697 tcp_sync_left_out(tp);
700 tp->fackets_out -= diff;
701 if ((int)tp->fackets_out < 0)
706 /* Link BUFF into the send queue. */
707 skb_header_release(buff);
708 tcp_insert_write_queue_after(skb, buff, sk);
713 /* This is similar to __pskb_pull_head() (it will go to core/skbuff.c
714 * eventually). The difference is that pulled data not copied, but
715 * immediately discarded.
717 static void __pskb_trim_head(struct sk_buff *skb, int len)
723 for (i=0; i<skb_shinfo(skb)->nr_frags; i++) {
724 if (skb_shinfo(skb)->frags[i].size <= eat) {
725 put_page(skb_shinfo(skb)->frags[i].page);
726 eat -= skb_shinfo(skb)->frags[i].size;
728 skb_shinfo(skb)->frags[k] = skb_shinfo(skb)->frags[i];
730 skb_shinfo(skb)->frags[k].page_offset += eat;
731 skb_shinfo(skb)->frags[k].size -= eat;
737 skb_shinfo(skb)->nr_frags = k;
739 skb_reset_tail_pointer(skb);
740 skb->data_len -= len;
741 skb->len = skb->data_len;
744 int tcp_trim_head(struct sock *sk, struct sk_buff *skb, u32 len)
746 if (skb_cloned(skb) &&
747 pskb_expand_head(skb, 0, 0, GFP_ATOMIC))
750 /* If len == headlen, we avoid __skb_pull to preserve alignment. */
751 if (unlikely(len < skb_headlen(skb)))
752 __skb_pull(skb, len);
754 __pskb_trim_head(skb, len - skb_headlen(skb));
756 TCP_SKB_CB(skb)->seq += len;
757 skb->ip_summed = CHECKSUM_PARTIAL;
759 skb->truesize -= len;
760 sk->sk_wmem_queued -= len;
761 sk->sk_forward_alloc += len;
762 sock_set_flag(sk, SOCK_QUEUE_SHRUNK);
764 /* Any change of skb->len requires recalculation of tso
767 if (tcp_skb_pcount(skb) > 1)
768 tcp_set_skb_tso_segs(sk, skb, tcp_current_mss(sk, 1));
773 /* Not accounting for SACKs here. */
774 int tcp_mtu_to_mss(struct sock *sk, int pmtu)
776 struct tcp_sock *tp = tcp_sk(sk);
777 struct inet_connection_sock *icsk = inet_csk(sk);
780 /* Calculate base mss without TCP options:
781 It is MMS_S - sizeof(tcphdr) of rfc1122
783 mss_now = pmtu - icsk->icsk_af_ops->net_header_len - sizeof(struct tcphdr);
785 /* Clamp it (mss_clamp does not include tcp options) */
786 if (mss_now > tp->rx_opt.mss_clamp)
787 mss_now = tp->rx_opt.mss_clamp;
789 /* Now subtract optional transport overhead */
790 mss_now -= icsk->icsk_ext_hdr_len;
792 /* Then reserve room for full set of TCP options and 8 bytes of data */
796 /* Now subtract TCP options size, not including SACKs */
797 mss_now -= tp->tcp_header_len - sizeof(struct tcphdr);
802 /* Inverse of above */
803 int tcp_mss_to_mtu(struct sock *sk, int mss)
805 struct tcp_sock *tp = tcp_sk(sk);
806 struct inet_connection_sock *icsk = inet_csk(sk);
811 icsk->icsk_ext_hdr_len +
812 icsk->icsk_af_ops->net_header_len;
817 void tcp_mtup_init(struct sock *sk)
819 struct tcp_sock *tp = tcp_sk(sk);
820 struct inet_connection_sock *icsk = inet_csk(sk);
822 icsk->icsk_mtup.enabled = sysctl_tcp_mtu_probing > 1;
823 icsk->icsk_mtup.search_high = tp->rx_opt.mss_clamp + sizeof(struct tcphdr) +
824 icsk->icsk_af_ops->net_header_len;
825 icsk->icsk_mtup.search_low = tcp_mss_to_mtu(sk, sysctl_tcp_base_mss);
826 icsk->icsk_mtup.probe_size = 0;
829 /* This function synchronize snd mss to current pmtu/exthdr set.
831 tp->rx_opt.user_mss is mss set by user by TCP_MAXSEG. It does NOT counts
832 for TCP options, but includes only bare TCP header.
834 tp->rx_opt.mss_clamp is mss negotiated at connection setup.
835 It is minimum of user_mss and mss received with SYN.
836 It also does not include TCP options.
838 inet_csk(sk)->icsk_pmtu_cookie is last pmtu, seen by this function.
840 tp->mss_cache is current effective sending mss, including
841 all tcp options except for SACKs. It is evaluated,
842 taking into account current pmtu, but never exceeds
843 tp->rx_opt.mss_clamp.
845 NOTE1. rfc1122 clearly states that advertised MSS
846 DOES NOT include either tcp or ip options.
848 NOTE2. inet_csk(sk)->icsk_pmtu_cookie and tp->mss_cache
849 are READ ONLY outside this function. --ANK (980731)
852 unsigned int tcp_sync_mss(struct sock *sk, u32 pmtu)
854 struct tcp_sock *tp = tcp_sk(sk);
855 struct inet_connection_sock *icsk = inet_csk(sk);
858 if (icsk->icsk_mtup.search_high > pmtu)
859 icsk->icsk_mtup.search_high = pmtu;
861 mss_now = tcp_mtu_to_mss(sk, pmtu);
863 /* Bound mss with half of window */
864 if (tp->max_window && mss_now > (tp->max_window>>1))
865 mss_now = max((tp->max_window>>1), 68U - tp->tcp_header_len);
867 /* And store cached results */
868 icsk->icsk_pmtu_cookie = pmtu;
869 if (icsk->icsk_mtup.enabled)
870 mss_now = min(mss_now, tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_low));
871 tp->mss_cache = mss_now;
876 /* Compute the current effective MSS, taking SACKs and IP options,
877 * and even PMTU discovery events into account.
879 * LARGESEND note: !urg_mode is overkill, only frames up to snd_up
880 * cannot be large. However, taking into account rare use of URG, this
883 unsigned int tcp_current_mss(struct sock *sk, int large_allowed)
885 struct tcp_sock *tp = tcp_sk(sk);
886 struct dst_entry *dst = __sk_dst_get(sk);
891 mss_now = tp->mss_cache;
893 if (large_allowed && sk_can_gso(sk) && !tp->urg_mode)
897 u32 mtu = dst_mtu(dst);
898 if (mtu != inet_csk(sk)->icsk_pmtu_cookie)
899 mss_now = tcp_sync_mss(sk, mtu);
902 if (tp->rx_opt.eff_sacks)
903 mss_now -= (TCPOLEN_SACK_BASE_ALIGNED +
904 (tp->rx_opt.eff_sacks * TCPOLEN_SACK_PERBLOCK));
906 #ifdef CONFIG_TCP_MD5SIG
907 if (tp->af_specific->md5_lookup(sk, sk))
908 mss_now -= TCPOLEN_MD5SIG_ALIGNED;
911 xmit_size_goal = mss_now;
914 xmit_size_goal = (65535 -
915 inet_csk(sk)->icsk_af_ops->net_header_len -
916 inet_csk(sk)->icsk_ext_hdr_len -
919 if (tp->max_window &&
920 (xmit_size_goal > (tp->max_window >> 1)))
921 xmit_size_goal = max((tp->max_window >> 1),
922 68U - tp->tcp_header_len);
924 xmit_size_goal -= (xmit_size_goal % mss_now);
926 tp->xmit_size_goal = xmit_size_goal;
931 /* Congestion window validation. (RFC2861) */
933 static void tcp_cwnd_validate(struct sock *sk)
935 struct tcp_sock *tp = tcp_sk(sk);
936 __u32 packets_out = tp->packets_out;
938 if (packets_out >= tp->snd_cwnd) {
939 /* Network is feed fully. */
940 tp->snd_cwnd_used = 0;
941 tp->snd_cwnd_stamp = tcp_time_stamp;
943 /* Network starves. */
944 if (tp->packets_out > tp->snd_cwnd_used)
945 tp->snd_cwnd_used = tp->packets_out;
947 if (sysctl_tcp_slow_start_after_idle &&
948 (s32)(tcp_time_stamp - tp->snd_cwnd_stamp) >= inet_csk(sk)->icsk_rto)
949 tcp_cwnd_application_limited(sk);
953 static unsigned int tcp_window_allows(struct tcp_sock *tp, struct sk_buff *skb, unsigned int mss_now, unsigned int cwnd)
955 u32 window, cwnd_len;
957 window = (tp->snd_una + tp->snd_wnd - TCP_SKB_CB(skb)->seq);
958 cwnd_len = mss_now * cwnd;
959 return min(window, cwnd_len);
962 /* Can at least one segment of SKB be sent right now, according to the
963 * congestion window rules? If so, return how many segments are allowed.
965 static inline unsigned int tcp_cwnd_test(struct tcp_sock *tp, struct sk_buff *skb)
969 /* Don't be strict about the congestion window for the final FIN. */
970 if ((TCP_SKB_CB(skb)->flags & TCPCB_FLAG_FIN) &&
971 tcp_skb_pcount(skb) == 1)
974 in_flight = tcp_packets_in_flight(tp);
976 if (in_flight < cwnd)
977 return (cwnd - in_flight);
982 /* This must be invoked the first time we consider transmitting
985 static int tcp_init_tso_segs(struct sock *sk, struct sk_buff *skb, unsigned int mss_now)
987 int tso_segs = tcp_skb_pcount(skb);
991 tcp_skb_mss(skb) != mss_now)) {
992 tcp_set_skb_tso_segs(sk, skb, mss_now);
993 tso_segs = tcp_skb_pcount(skb);
998 static inline int tcp_minshall_check(const struct tcp_sock *tp)
1000 return after(tp->snd_sml,tp->snd_una) &&
1001 !after(tp->snd_sml, tp->snd_nxt);
1004 /* Return 0, if packet can be sent now without violation Nagle's rules:
1005 * 1. It is full sized.
1006 * 2. Or it contains FIN. (already checked by caller)
1007 * 3. Or TCP_NODELAY was set.
1008 * 4. Or TCP_CORK is not set, and all sent packets are ACKed.
1009 * With Minshall's modification: all sent small packets are ACKed.
1012 static inline int tcp_nagle_check(const struct tcp_sock *tp,
1013 const struct sk_buff *skb,
1014 unsigned mss_now, int nonagle)
1016 return (skb->len < mss_now &&
1017 ((nonagle&TCP_NAGLE_CORK) ||
1020 tcp_minshall_check(tp))));
1023 /* Return non-zero if the Nagle test allows this packet to be
1026 static inline int tcp_nagle_test(struct tcp_sock *tp, struct sk_buff *skb,
1027 unsigned int cur_mss, int nonagle)
1029 /* Nagle rule does not apply to frames, which sit in the middle of the
1030 * write_queue (they have no chances to get new data).
1032 * This is implemented in the callers, where they modify the 'nonagle'
1033 * argument based upon the location of SKB in the send queue.
1035 if (nonagle & TCP_NAGLE_PUSH)
1038 /* Don't use the nagle rule for urgent data (or for the final FIN). */
1040 (TCP_SKB_CB(skb)->flags & TCPCB_FLAG_FIN))
1043 if (!tcp_nagle_check(tp, skb, cur_mss, nonagle))
1049 /* Does at least the first segment of SKB fit into the send window? */
1050 static inline int tcp_snd_wnd_test(struct tcp_sock *tp, struct sk_buff *skb, unsigned int cur_mss)
1052 u32 end_seq = TCP_SKB_CB(skb)->end_seq;
1054 if (skb->len > cur_mss)
1055 end_seq = TCP_SKB_CB(skb)->seq + cur_mss;
1057 return !after(end_seq, tp->snd_una + tp->snd_wnd);
1060 /* This checks if the data bearing packet SKB (usually tcp_send_head(sk))
1061 * should be put on the wire right now. If so, it returns the number of
1062 * packets allowed by the congestion window.
1064 static unsigned int tcp_snd_test(struct sock *sk, struct sk_buff *skb,
1065 unsigned int cur_mss, int nonagle)
1067 struct tcp_sock *tp = tcp_sk(sk);
1068 unsigned int cwnd_quota;
1070 tcp_init_tso_segs(sk, skb, cur_mss);
1072 if (!tcp_nagle_test(tp, skb, cur_mss, nonagle))
1075 cwnd_quota = tcp_cwnd_test(tp, skb);
1077 !tcp_snd_wnd_test(tp, skb, cur_mss))
1083 int tcp_may_send_now(struct sock *sk)
1085 struct tcp_sock *tp = tcp_sk(sk);
1086 struct sk_buff *skb = tcp_send_head(sk);
1089 tcp_snd_test(sk, skb, tcp_current_mss(sk, 1),
1090 (tcp_skb_is_last(sk, skb) ?
1095 /* Trim TSO SKB to LEN bytes, put the remaining data into a new packet
1096 * which is put after SKB on the list. It is very much like
1097 * tcp_fragment() except that it may make several kinds of assumptions
1098 * in order to speed up the splitting operation. In particular, we
1099 * know that all the data is in scatter-gather pages, and that the
1100 * packet has never been sent out before (and thus is not cloned).
1102 static int tso_fragment(struct sock *sk, struct sk_buff *skb, unsigned int len, unsigned int mss_now)
1104 struct sk_buff *buff;
1105 int nlen = skb->len - len;
1108 /* All of a TSO frame must be composed of paged data. */
1109 if (skb->len != skb->data_len)
1110 return tcp_fragment(sk, skb, len, mss_now);
1112 buff = sk_stream_alloc_pskb(sk, 0, 0, GFP_ATOMIC);
1113 if (unlikely(buff == NULL))
1116 sk_charge_skb(sk, buff);
1117 buff->truesize += nlen;
1118 skb->truesize -= nlen;
1120 /* Correct the sequence numbers. */
1121 TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len;
1122 TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq;
1123 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq;
1125 /* PSH and FIN should only be set in the second packet. */
1126 flags = TCP_SKB_CB(skb)->flags;
1127 TCP_SKB_CB(skb)->flags = flags & ~(TCPCB_FLAG_FIN|TCPCB_FLAG_PSH);
1128 TCP_SKB_CB(buff)->flags = flags;
1130 /* This packet was never sent out yet, so no SACK bits. */
1131 TCP_SKB_CB(buff)->sacked = 0;
1133 buff->ip_summed = skb->ip_summed = CHECKSUM_PARTIAL;
1134 skb_split(skb, buff, len);
1136 /* Fix up tso_factor for both original and new SKB. */
1137 tcp_set_skb_tso_segs(sk, skb, mss_now);
1138 tcp_set_skb_tso_segs(sk, buff, mss_now);
1140 /* Link BUFF into the send queue. */
1141 skb_header_release(buff);
1142 tcp_insert_write_queue_after(skb, buff, sk);
1147 /* Try to defer sending, if possible, in order to minimize the amount
1148 * of TSO splitting we do. View it as a kind of TSO Nagle test.
1150 * This algorithm is from John Heffner.
1152 static int tcp_tso_should_defer(struct sock *sk, struct sk_buff *skb)
1154 struct tcp_sock *tp = tcp_sk(sk);
1155 const struct inet_connection_sock *icsk = inet_csk(sk);
1156 u32 send_win, cong_win, limit, in_flight;
1158 if (TCP_SKB_CB(skb)->flags & TCPCB_FLAG_FIN)
1161 if (icsk->icsk_ca_state != TCP_CA_Open)
1164 /* Defer for less than two clock ticks. */
1165 if (!tp->tso_deferred && ((jiffies<<1)>>1) - (tp->tso_deferred>>1) > 1)
1168 in_flight = tcp_packets_in_flight(tp);
1170 BUG_ON(tcp_skb_pcount(skb) <= 1 ||
1171 (tp->snd_cwnd <= in_flight));
1173 send_win = (tp->snd_una + tp->snd_wnd) - TCP_SKB_CB(skb)->seq;
1175 /* From in_flight test above, we know that cwnd > in_flight. */
1176 cong_win = (tp->snd_cwnd - in_flight) * tp->mss_cache;
1178 limit = min(send_win, cong_win);
1180 /* If a full-sized TSO skb can be sent, do it. */
1184 if (sysctl_tcp_tso_win_divisor) {
1185 u32 chunk = min(tp->snd_wnd, tp->snd_cwnd * tp->mss_cache);
1187 /* If at least some fraction of a window is available,
1190 chunk /= sysctl_tcp_tso_win_divisor;
1194 /* Different approach, try not to defer past a single
1195 * ACK. Receiver should ACK every other full sized
1196 * frame, so if we have space for more than 3 frames
1199 if (limit > tcp_max_burst(tp) * tp->mss_cache)
1203 /* Ok, it looks like it is advisable to defer. */
1204 tp->tso_deferred = 1 | (jiffies<<1);
1209 tp->tso_deferred = 0;
1213 /* Create a new MTU probe if we are ready.
1214 * Returns 0 if we should wait to probe (no cwnd available),
1215 * 1 if a probe was sent,
1217 static int tcp_mtu_probe(struct sock *sk)
1219 struct tcp_sock *tp = tcp_sk(sk);
1220 struct inet_connection_sock *icsk = inet_csk(sk);
1221 struct sk_buff *skb, *nskb, *next;
1228 /* Not currently probing/verifying,
1230 * have enough cwnd, and
1231 * not SACKing (the variable headers throw things off) */
1232 if (!icsk->icsk_mtup.enabled ||
1233 icsk->icsk_mtup.probe_size ||
1234 inet_csk(sk)->icsk_ca_state != TCP_CA_Open ||
1235 tp->snd_cwnd < 11 ||
1236 tp->rx_opt.eff_sacks)
1239 /* Very simple search strategy: just double the MSS. */
1240 mss_now = tcp_current_mss(sk, 0);
1241 probe_size = 2*tp->mss_cache;
1242 if (probe_size > tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_high)) {
1243 /* TODO: set timer for probe_converge_event */
1247 /* Have enough data in the send queue to probe? */
1249 if ((skb = tcp_send_head(sk)) == NULL)
1251 while ((len += skb->len) < probe_size && !tcp_skb_is_last(sk, skb))
1252 skb = tcp_write_queue_next(sk, skb);
1253 if (len < probe_size)
1256 /* Receive window check. */
1257 if (after(TCP_SKB_CB(skb)->seq + probe_size, tp->snd_una + tp->snd_wnd)) {
1258 if (tp->snd_wnd < probe_size)
1264 /* Do we need to wait to drain cwnd? */
1265 pif = tcp_packets_in_flight(tp);
1266 if (pif + 2 > tp->snd_cwnd) {
1267 /* With no packets in flight, don't stall. */
1274 /* We're allowed to probe. Build it now. */
1275 if ((nskb = sk_stream_alloc_skb(sk, probe_size, GFP_ATOMIC)) == NULL)
1277 sk_charge_skb(sk, nskb);
1279 skb = tcp_send_head(sk);
1280 tcp_insert_write_queue_before(nskb, skb, sk);
1281 tcp_advance_send_head(sk, skb);
1283 TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(skb)->seq;
1284 TCP_SKB_CB(nskb)->end_seq = TCP_SKB_CB(skb)->seq + probe_size;
1285 TCP_SKB_CB(nskb)->flags = TCPCB_FLAG_ACK;
1286 TCP_SKB_CB(nskb)->sacked = 0;
1288 nskb->ip_summed = skb->ip_summed;
1291 while (len < probe_size) {
1292 next = tcp_write_queue_next(sk, skb);
1294 copy = min_t(int, skb->len, probe_size - len);
1295 if (nskb->ip_summed)
1296 skb_copy_bits(skb, 0, skb_put(nskb, copy), copy);
1298 nskb->csum = skb_copy_and_csum_bits(skb, 0,
1299 skb_put(nskb, copy), copy, nskb->csum);
1301 if (skb->len <= copy) {
1302 /* We've eaten all the data from this skb.
1304 TCP_SKB_CB(nskb)->flags |= TCP_SKB_CB(skb)->flags;
1305 tcp_unlink_write_queue(skb, sk);
1306 sk_stream_free_skb(sk, skb);
1308 TCP_SKB_CB(nskb)->flags |= TCP_SKB_CB(skb)->flags &
1309 ~(TCPCB_FLAG_FIN|TCPCB_FLAG_PSH);
1310 if (!skb_shinfo(skb)->nr_frags) {
1311 skb_pull(skb, copy);
1312 if (skb->ip_summed != CHECKSUM_PARTIAL)
1313 skb->csum = csum_partial(skb->data, skb->len, 0);
1315 __pskb_trim_head(skb, copy);
1316 tcp_set_skb_tso_segs(sk, skb, mss_now);
1318 TCP_SKB_CB(skb)->seq += copy;
1324 tcp_init_tso_segs(sk, nskb, nskb->len);
1326 /* We're ready to send. If this fails, the probe will
1327 * be resegmented into mss-sized pieces by tcp_write_xmit(). */
1328 TCP_SKB_CB(nskb)->when = tcp_time_stamp;
1329 if (!tcp_transmit_skb(sk, nskb, 1, GFP_ATOMIC)) {
1330 /* Decrement cwnd here because we are sending
1331 * effectively two packets. */
1333 update_send_head(sk, nskb);
1335 icsk->icsk_mtup.probe_size = tcp_mss_to_mtu(sk, nskb->len);
1336 tp->mtu_probe.probe_seq_start = TCP_SKB_CB(nskb)->seq;
1337 tp->mtu_probe.probe_seq_end = TCP_SKB_CB(nskb)->end_seq;
1346 /* This routine writes packets to the network. It advances the
1347 * send_head. This happens as incoming acks open up the remote
1350 * Returns 1, if no segments are in flight and we have queued segments, but
1351 * cannot send anything now because of SWS or another problem.
1353 static int tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle)
1355 struct tcp_sock *tp = tcp_sk(sk);
1356 struct sk_buff *skb;
1357 unsigned int tso_segs, sent_pkts;
1361 /* If we are closed, the bytes will have to remain here.
1362 * In time closedown will finish, we empty the write queue and all
1365 if (unlikely(sk->sk_state == TCP_CLOSE))
1370 /* Do MTU probing. */
1371 if ((result = tcp_mtu_probe(sk)) == 0) {
1373 } else if (result > 0) {
1377 while ((skb = tcp_send_head(sk))) {
1380 tso_segs = tcp_init_tso_segs(sk, skb, mss_now);
1383 cwnd_quota = tcp_cwnd_test(tp, skb);
1387 if (unlikely(!tcp_snd_wnd_test(tp, skb, mss_now)))
1390 if (tso_segs == 1) {
1391 if (unlikely(!tcp_nagle_test(tp, skb, mss_now,
1392 (tcp_skb_is_last(sk, skb) ?
1393 nonagle : TCP_NAGLE_PUSH))))
1396 if (tcp_tso_should_defer(sk, skb))
1402 limit = tcp_window_allows(tp, skb,
1403 mss_now, cwnd_quota);
1405 if (skb->len < limit) {
1406 unsigned int trim = skb->len % mss_now;
1409 limit = skb->len - trim;
1413 if (skb->len > limit &&
1414 unlikely(tso_fragment(sk, skb, limit, mss_now)))
1417 TCP_SKB_CB(skb)->when = tcp_time_stamp;
1419 if (unlikely(tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC)))
1422 /* Advance the send_head. This one is sent out.
1423 * This call will increment packets_out.
1425 update_send_head(sk, skb);
1427 tcp_minshall_update(tp, mss_now, skb);
1431 if (likely(sent_pkts)) {
1432 tcp_cwnd_validate(sk);
1435 return !tp->packets_out && tcp_send_head(sk);
1438 /* Push out any pending frames which were held back due to
1439 * TCP_CORK or attempt at coalescing tiny packets.
1440 * The socket must be locked by the caller.
1442 void __tcp_push_pending_frames(struct sock *sk, unsigned int cur_mss,
1445 struct sk_buff *skb = tcp_send_head(sk);
1448 if (tcp_write_xmit(sk, cur_mss, nonagle))
1449 tcp_check_probe_timer(sk);
1453 /* Send _single_ skb sitting at the send head. This function requires
1454 * true push pending frames to setup probe timer etc.
1456 void tcp_push_one(struct sock *sk, unsigned int mss_now)
1458 struct tcp_sock *tp = tcp_sk(sk);
1459 struct sk_buff *skb = tcp_send_head(sk);
1460 unsigned int tso_segs, cwnd_quota;
1462 BUG_ON(!skb || skb->len < mss_now);
1464 tso_segs = tcp_init_tso_segs(sk, skb, mss_now);
1465 cwnd_quota = tcp_snd_test(sk, skb, mss_now, TCP_NAGLE_PUSH);
1467 if (likely(cwnd_quota)) {
1474 limit = tcp_window_allows(tp, skb,
1475 mss_now, cwnd_quota);
1477 if (skb->len < limit) {
1478 unsigned int trim = skb->len % mss_now;
1481 limit = skb->len - trim;
1485 if (skb->len > limit &&
1486 unlikely(tso_fragment(sk, skb, limit, mss_now)))
1489 /* Send it out now. */
1490 TCP_SKB_CB(skb)->when = tcp_time_stamp;
1492 if (likely(!tcp_transmit_skb(sk, skb, 1, sk->sk_allocation))) {
1493 update_send_head(sk, skb);
1494 tcp_cwnd_validate(sk);
1500 /* This function returns the amount that we can raise the
1501 * usable window based on the following constraints
1503 * 1. The window can never be shrunk once it is offered (RFC 793)
1504 * 2. We limit memory per socket
1507 * "the suggested [SWS] avoidance algorithm for the receiver is to keep
1508 * RECV.NEXT + RCV.WIN fixed until:
1509 * RCV.BUFF - RCV.USER - RCV.WINDOW >= min(1/2 RCV.BUFF, MSS)"
1511 * i.e. don't raise the right edge of the window until you can raise
1512 * it at least MSS bytes.
1514 * Unfortunately, the recommended algorithm breaks header prediction,
1515 * since header prediction assumes th->window stays fixed.
1517 * Strictly speaking, keeping th->window fixed violates the receiver
1518 * side SWS prevention criteria. The problem is that under this rule
1519 * a stream of single byte packets will cause the right side of the
1520 * window to always advance by a single byte.
1522 * Of course, if the sender implements sender side SWS prevention
1523 * then this will not be a problem.
1525 * BSD seems to make the following compromise:
1527 * If the free space is less than the 1/4 of the maximum
1528 * space available and the free space is less than 1/2 mss,
1529 * then set the window to 0.
1530 * [ Actually, bsd uses MSS and 1/4 of maximal _window_ ]
1531 * Otherwise, just prevent the window from shrinking
1532 * and from being larger than the largest representable value.
1534 * This prevents incremental opening of the window in the regime
1535 * where TCP is limited by the speed of the reader side taking
1536 * data out of the TCP receive queue. It does nothing about
1537 * those cases where the window is constrained on the sender side
1538 * because the pipeline is full.
1540 * BSD also seems to "accidentally" limit itself to windows that are a
1541 * multiple of MSS, at least until the free space gets quite small.
1542 * This would appear to be a side effect of the mbuf implementation.
1543 * Combining these two algorithms results in the observed behavior
1544 * of having a fixed window size at almost all times.
1546 * Below we obtain similar behavior by forcing the offered window to
1547 * a multiple of the mss when it is feasible to do so.
1549 * Note, we don't "adjust" for TIMESTAMP or SACK option bytes.
1550 * Regular options like TIMESTAMP are taken into account.
1552 u32 __tcp_select_window(struct sock *sk)
1554 struct inet_connection_sock *icsk = inet_csk(sk);
1555 struct tcp_sock *tp = tcp_sk(sk);
1556 /* MSS for the peer's data. Previous versions used mss_clamp
1557 * here. I don't know if the value based on our guesses
1558 * of peer's MSS is better for the performance. It's more correct
1559 * but may be worse for the performance because of rcv_mss
1560 * fluctuations. --SAW 1998/11/1
1562 int mss = icsk->icsk_ack.rcv_mss;
1563 int free_space = tcp_space(sk);
1564 int full_space = min_t(int, tp->window_clamp, tcp_full_space(sk));
1567 if (mss > full_space)
1570 if (free_space < full_space/2) {
1571 icsk->icsk_ack.quick = 0;
1573 if (tcp_memory_pressure)
1574 tp->rcv_ssthresh = min(tp->rcv_ssthresh, 4U*tp->advmss);
1576 if (free_space < mss)
1580 if (free_space > tp->rcv_ssthresh)
1581 free_space = tp->rcv_ssthresh;
1583 /* Don't do rounding if we are using window scaling, since the
1584 * scaled window will not line up with the MSS boundary anyway.
1586 window = tp->rcv_wnd;
1587 if (tp->rx_opt.rcv_wscale) {
1588 window = free_space;
1590 /* Advertise enough space so that it won't get scaled away.
1591 * Import case: prevent zero window announcement if
1592 * 1<<rcv_wscale > mss.
1594 if (((window >> tp->rx_opt.rcv_wscale) << tp->rx_opt.rcv_wscale) != window)
1595 window = (((window >> tp->rx_opt.rcv_wscale) + 1)
1596 << tp->rx_opt.rcv_wscale);
1598 /* Get the largest window that is a nice multiple of mss.
1599 * Window clamp already applied above.
1600 * If our current window offering is within 1 mss of the
1601 * free space we just keep it. This prevents the divide
1602 * and multiply from happening most of the time.
1603 * We also don't do any window rounding when the free space
1606 if (window <= free_space - mss || window > free_space)
1607 window = (free_space/mss)*mss;
1608 else if (mss == full_space &&
1609 free_space > window + full_space/2)
1610 window = free_space;
1616 /* Attempt to collapse two adjacent SKB's during retransmission. */
1617 static void tcp_retrans_try_collapse(struct sock *sk, struct sk_buff *skb, int mss_now)
1619 struct tcp_sock *tp = tcp_sk(sk);
1620 struct sk_buff *next_skb = tcp_write_queue_next(sk, skb);
1622 /* The first test we must make is that neither of these two
1623 * SKB's are still referenced by someone else.
1625 if (!skb_cloned(skb) && !skb_cloned(next_skb)) {
1626 int skb_size = skb->len, next_skb_size = next_skb->len;
1627 u16 flags = TCP_SKB_CB(skb)->flags;
1629 /* Also punt if next skb has been SACK'd. */
1630 if (TCP_SKB_CB(next_skb)->sacked & TCPCB_SACKED_ACKED)
1633 /* Next skb is out of window. */
1634 if (after(TCP_SKB_CB(next_skb)->end_seq, tp->snd_una+tp->snd_wnd))
1637 /* Punt if not enough space exists in the first SKB for
1638 * the data in the second, or the total combined payload
1639 * would exceed the MSS.
1641 if ((next_skb_size > skb_tailroom(skb)) ||
1642 ((skb_size + next_skb_size) > mss_now))
1645 BUG_ON(tcp_skb_pcount(skb) != 1 ||
1646 tcp_skb_pcount(next_skb) != 1);
1648 /* changing transmit queue under us so clear hints */
1649 clear_all_retrans_hints(tp);
1651 /* Ok. We will be able to collapse the packet. */
1652 tcp_unlink_write_queue(next_skb, sk);
1654 skb_copy_from_linear_data(next_skb,
1655 skb_put(skb, next_skb_size),
1658 if (next_skb->ip_summed == CHECKSUM_PARTIAL)
1659 skb->ip_summed = CHECKSUM_PARTIAL;
1661 if (skb->ip_summed != CHECKSUM_PARTIAL)
1662 skb->csum = csum_block_add(skb->csum, next_skb->csum, skb_size);
1664 /* Update sequence range on original skb. */
1665 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(next_skb)->end_seq;
1667 /* Merge over control information. */
1668 flags |= TCP_SKB_CB(next_skb)->flags; /* This moves PSH/FIN etc. over */
1669 TCP_SKB_CB(skb)->flags = flags;
1671 /* All done, get rid of second SKB and account for it so
1672 * packet counting does not break.
1674 TCP_SKB_CB(skb)->sacked |= TCP_SKB_CB(next_skb)->sacked&(TCPCB_EVER_RETRANS|TCPCB_AT_TAIL);
1675 if (TCP_SKB_CB(next_skb)->sacked&TCPCB_SACKED_RETRANS)
1676 tp->retrans_out -= tcp_skb_pcount(next_skb);
1677 if (TCP_SKB_CB(next_skb)->sacked&TCPCB_LOST) {
1678 tp->lost_out -= tcp_skb_pcount(next_skb);
1679 tp->left_out -= tcp_skb_pcount(next_skb);
1681 /* Reno case is special. Sigh... */
1682 if (!tp->rx_opt.sack_ok && tp->sacked_out) {
1683 tcp_dec_pcount_approx(&tp->sacked_out, next_skb);
1684 tp->left_out -= tcp_skb_pcount(next_skb);
1687 /* Not quite right: it can be > snd.fack, but
1688 * it is better to underestimate fackets.
1690 tcp_dec_pcount_approx(&tp->fackets_out, next_skb);
1691 tcp_packets_out_dec(tp, next_skb);
1692 sk_stream_free_skb(sk, next_skb);
1696 /* Do a simple retransmit without using the backoff mechanisms in
1697 * tcp_timer. This is used for path mtu discovery.
1698 * The socket is already locked here.
1700 void tcp_simple_retransmit(struct sock *sk)
1702 const struct inet_connection_sock *icsk = inet_csk(sk);
1703 struct tcp_sock *tp = tcp_sk(sk);
1704 struct sk_buff *skb;
1705 unsigned int mss = tcp_current_mss(sk, 0);
1708 tcp_for_write_queue(skb, sk) {
1709 if (skb == tcp_send_head(sk))
1711 if (skb->len > mss &&
1712 !(TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_ACKED)) {
1713 if (TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_RETRANS) {
1714 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
1715 tp->retrans_out -= tcp_skb_pcount(skb);
1717 if (!(TCP_SKB_CB(skb)->sacked&TCPCB_LOST)) {
1718 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1719 tp->lost_out += tcp_skb_pcount(skb);
1725 clear_all_retrans_hints(tp);
1730 tcp_sync_left_out(tp);
1732 /* Don't muck with the congestion window here.
1733 * Reason is that we do not increase amount of _data_
1734 * in network, but units changed and effective
1735 * cwnd/ssthresh really reduced now.
1737 if (icsk->icsk_ca_state != TCP_CA_Loss) {
1738 tp->high_seq = tp->snd_nxt;
1739 tp->snd_ssthresh = tcp_current_ssthresh(sk);
1740 tp->prior_ssthresh = 0;
1741 tp->undo_marker = 0;
1742 tcp_set_ca_state(sk, TCP_CA_Loss);
1744 tcp_xmit_retransmit_queue(sk);
1747 /* This retransmits one SKB. Policy decisions and retransmit queue
1748 * state updates are done by the caller. Returns non-zero if an
1749 * error occurred which prevented the send.
1751 int tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb)
1753 struct tcp_sock *tp = tcp_sk(sk);
1754 struct inet_connection_sock *icsk = inet_csk(sk);
1755 unsigned int cur_mss = tcp_current_mss(sk, 0);
1758 /* Inconslusive MTU probe */
1759 if (icsk->icsk_mtup.probe_size) {
1760 icsk->icsk_mtup.probe_size = 0;
1763 /* Do not sent more than we queued. 1/4 is reserved for possible
1764 * copying overhead: fragmentation, tunneling, mangling etc.
1766 if (atomic_read(&sk->sk_wmem_alloc) >
1767 min(sk->sk_wmem_queued + (sk->sk_wmem_queued >> 2), sk->sk_sndbuf))
1770 if (before(TCP_SKB_CB(skb)->seq, tp->snd_una)) {
1771 if (before(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
1773 if (tcp_trim_head(sk, skb, tp->snd_una - TCP_SKB_CB(skb)->seq))
1777 /* If receiver has shrunk his window, and skb is out of
1778 * new window, do not retransmit it. The exception is the
1779 * case, when window is shrunk to zero. In this case
1780 * our retransmit serves as a zero window probe.
1782 if (!before(TCP_SKB_CB(skb)->seq, tp->snd_una+tp->snd_wnd)
1783 && TCP_SKB_CB(skb)->seq != tp->snd_una)
1786 if (skb->len > cur_mss) {
1787 if (tcp_fragment(sk, skb, cur_mss, cur_mss))
1788 return -ENOMEM; /* We'll try again later. */
1791 /* Collapse two adjacent packets if worthwhile and we can. */
1792 if (!(TCP_SKB_CB(skb)->flags & TCPCB_FLAG_SYN) &&
1793 (skb->len < (cur_mss >> 1)) &&
1794 (tcp_write_queue_next(sk, skb) != tcp_send_head(sk)) &&
1795 (!tcp_skb_is_last(sk, skb)) &&
1796 (skb_shinfo(skb)->nr_frags == 0 && skb_shinfo(tcp_write_queue_next(sk, skb))->nr_frags == 0) &&
1797 (tcp_skb_pcount(skb) == 1 && tcp_skb_pcount(tcp_write_queue_next(sk, skb)) == 1) &&
1798 (sysctl_tcp_retrans_collapse != 0))
1799 tcp_retrans_try_collapse(sk, skb, cur_mss);
1801 if (inet_csk(sk)->icsk_af_ops->rebuild_header(sk))
1802 return -EHOSTUNREACH; /* Routing failure or similar. */
1804 /* Some Solaris stacks overoptimize and ignore the FIN on a
1805 * retransmit when old data is attached. So strip it off
1806 * since it is cheap to do so and saves bytes on the network.
1809 (TCP_SKB_CB(skb)->flags & TCPCB_FLAG_FIN) &&
1810 tp->snd_una == (TCP_SKB_CB(skb)->end_seq - 1)) {
1811 if (!pskb_trim(skb, 0)) {
1812 TCP_SKB_CB(skb)->seq = TCP_SKB_CB(skb)->end_seq - 1;
1813 skb_shinfo(skb)->gso_segs = 1;
1814 skb_shinfo(skb)->gso_size = 0;
1815 skb_shinfo(skb)->gso_type = 0;
1816 skb->ip_summed = CHECKSUM_NONE;
1821 /* Make a copy, if the first transmission SKB clone we made
1822 * is still in somebody's hands, else make a clone.
1824 TCP_SKB_CB(skb)->when = tcp_time_stamp;
1826 err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
1829 /* Update global TCP statistics. */
1830 TCP_INC_STATS(TCP_MIB_RETRANSSEGS);
1832 tp->total_retrans++;
1834 #if FASTRETRANS_DEBUG > 0
1835 if (TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_RETRANS) {
1836 if (net_ratelimit())
1837 printk(KERN_DEBUG "retrans_out leaked.\n");
1840 TCP_SKB_CB(skb)->sacked |= TCPCB_RETRANS;
1841 tp->retrans_out += tcp_skb_pcount(skb);
1843 /* Save stamp of the first retransmit. */
1844 if (!tp->retrans_stamp)
1845 tp->retrans_stamp = TCP_SKB_CB(skb)->when;
1849 /* snd_nxt is stored to detect loss of retransmitted segment,
1850 * see tcp_input.c tcp_sacktag_write_queue().
1852 TCP_SKB_CB(skb)->ack_seq = tp->snd_nxt;
1857 /* This gets called after a retransmit timeout, and the initially
1858 * retransmitted data is acknowledged. It tries to continue
1859 * resending the rest of the retransmit queue, until either
1860 * we've sent it all or the congestion window limit is reached.
1861 * If doing SACK, the first ACK which comes back for a timeout
1862 * based retransmit packet might feed us FACK information again.
1863 * If so, we use it to avoid unnecessarily retransmissions.
1865 void tcp_xmit_retransmit_queue(struct sock *sk)
1867 const struct inet_connection_sock *icsk = inet_csk(sk);
1868 struct tcp_sock *tp = tcp_sk(sk);
1869 struct sk_buff *skb;
1872 if (tp->retransmit_skb_hint) {
1873 skb = tp->retransmit_skb_hint;
1874 packet_cnt = tp->retransmit_cnt_hint;
1876 skb = tcp_write_queue_head(sk);
1880 /* First pass: retransmit lost packets. */
1882 tcp_for_write_queue_from(skb, sk) {
1883 __u8 sacked = TCP_SKB_CB(skb)->sacked;
1885 if (skb == tcp_send_head(sk))
1887 /* we could do better than to assign each time */
1888 tp->retransmit_skb_hint = skb;
1889 tp->retransmit_cnt_hint = packet_cnt;
1891 /* Assume this retransmit will generate
1892 * only one packet for congestion window
1893 * calculation purposes. This works because
1894 * tcp_retransmit_skb() will chop up the
1895 * packet to be MSS sized and all the
1896 * packet counting works out.
1898 if (tcp_packets_in_flight(tp) >= tp->snd_cwnd)
1901 if (sacked & TCPCB_LOST) {
1902 if (!(sacked&(TCPCB_SACKED_ACKED|TCPCB_SACKED_RETRANS))) {
1903 if (tcp_retransmit_skb(sk, skb)) {
1904 tp->retransmit_skb_hint = NULL;
1907 if (icsk->icsk_ca_state != TCP_CA_Loss)
1908 NET_INC_STATS_BH(LINUX_MIB_TCPFASTRETRANS);
1910 NET_INC_STATS_BH(LINUX_MIB_TCPSLOWSTARTRETRANS);
1912 if (skb == tcp_write_queue_head(sk))
1913 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
1914 inet_csk(sk)->icsk_rto,
1918 packet_cnt += tcp_skb_pcount(skb);
1919 if (packet_cnt >= tp->lost_out)
1925 /* OK, demanded retransmission is finished. */
1927 /* Forward retransmissions are possible only during Recovery. */
1928 if (icsk->icsk_ca_state != TCP_CA_Recovery)
1931 /* No forward retransmissions in Reno are possible. */
1932 if (!tp->rx_opt.sack_ok)
1935 /* Yeah, we have to make difficult choice between forward transmission
1936 * and retransmission... Both ways have their merits...
1938 * For now we do not retransmit anything, while we have some new
1942 if (tcp_may_send_now(sk))
1945 if (tp->forward_skb_hint) {
1946 skb = tp->forward_skb_hint;
1947 packet_cnt = tp->forward_cnt_hint;
1949 skb = tcp_write_queue_head(sk);
1953 tcp_for_write_queue_from(skb, sk) {
1954 if (skb == tcp_send_head(sk))
1956 tp->forward_cnt_hint = packet_cnt;
1957 tp->forward_skb_hint = skb;
1959 /* Similar to the retransmit loop above we
1960 * can pretend that the retransmitted SKB
1961 * we send out here will be composed of one
1962 * real MSS sized packet because tcp_retransmit_skb()
1963 * will fragment it if necessary.
1965 if (++packet_cnt > tp->fackets_out)
1968 if (tcp_packets_in_flight(tp) >= tp->snd_cwnd)
1971 if (TCP_SKB_CB(skb)->sacked & TCPCB_TAGBITS)
1974 /* Ok, retransmit it. */
1975 if (tcp_retransmit_skb(sk, skb)) {
1976 tp->forward_skb_hint = NULL;
1980 if (skb == tcp_write_queue_head(sk))
1981 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
1982 inet_csk(sk)->icsk_rto,
1985 NET_INC_STATS_BH(LINUX_MIB_TCPFORWARDRETRANS);
1990 /* Send a fin. The caller locks the socket for us. This cannot be
1991 * allowed to fail queueing a FIN frame under any circumstances.
1993 void tcp_send_fin(struct sock *sk)
1995 struct tcp_sock *tp = tcp_sk(sk);
1996 struct sk_buff *skb = tcp_write_queue_tail(sk);
1999 /* Optimization, tack on the FIN if we have a queue of
2000 * unsent frames. But be careful about outgoing SACKS
2003 mss_now = tcp_current_mss(sk, 1);
2005 if (tcp_send_head(sk) != NULL) {
2006 TCP_SKB_CB(skb)->flags |= TCPCB_FLAG_FIN;
2007 TCP_SKB_CB(skb)->end_seq++;
2010 /* Socket is locked, keep trying until memory is available. */
2012 skb = alloc_skb_fclone(MAX_TCP_HEADER, GFP_KERNEL);
2018 /* Reserve space for headers and prepare control bits. */
2019 skb_reserve(skb, MAX_TCP_HEADER);
2021 TCP_SKB_CB(skb)->flags = (TCPCB_FLAG_ACK | TCPCB_FLAG_FIN);
2022 TCP_SKB_CB(skb)->sacked = 0;
2023 skb_shinfo(skb)->gso_segs = 1;
2024 skb_shinfo(skb)->gso_size = 0;
2025 skb_shinfo(skb)->gso_type = 0;
2027 /* FIN eats a sequence byte, write_seq advanced by tcp_queue_skb(). */
2028 TCP_SKB_CB(skb)->seq = tp->write_seq;
2029 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(skb)->seq + 1;
2030 tcp_queue_skb(sk, skb);
2032 __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_OFF);
2035 /* We get here when a process closes a file descriptor (either due to
2036 * an explicit close() or as a byproduct of exit()'ing) and there
2037 * was unread data in the receive queue. This behavior is recommended
2038 * by RFC 2525, section 2.17. -DaveM
2040 void tcp_send_active_reset(struct sock *sk, gfp_t priority)
2042 struct sk_buff *skb;
2044 /* NOTE: No TCP options attached and we never retransmit this. */
2045 skb = alloc_skb(MAX_TCP_HEADER, priority);
2047 NET_INC_STATS(LINUX_MIB_TCPABORTFAILED);
2051 /* Reserve space for headers and prepare control bits. */
2052 skb_reserve(skb, MAX_TCP_HEADER);
2054 TCP_SKB_CB(skb)->flags = (TCPCB_FLAG_ACK | TCPCB_FLAG_RST);
2055 TCP_SKB_CB(skb)->sacked = 0;
2056 skb_shinfo(skb)->gso_segs = 1;
2057 skb_shinfo(skb)->gso_size = 0;
2058 skb_shinfo(skb)->gso_type = 0;
2061 TCP_SKB_CB(skb)->seq = tcp_acceptable_seq(sk);
2062 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(skb)->seq;
2063 TCP_SKB_CB(skb)->when = tcp_time_stamp;
2064 if (tcp_transmit_skb(sk, skb, 0, priority))
2065 NET_INC_STATS(LINUX_MIB_TCPABORTFAILED);
2068 /* WARNING: This routine must only be called when we have already sent
2069 * a SYN packet that crossed the incoming SYN that caused this routine
2070 * to get called. If this assumption fails then the initial rcv_wnd
2071 * and rcv_wscale values will not be correct.
2073 int tcp_send_synack(struct sock *sk)
2075 struct sk_buff* skb;
2077 skb = tcp_write_queue_head(sk);
2078 if (skb == NULL || !(TCP_SKB_CB(skb)->flags&TCPCB_FLAG_SYN)) {
2079 printk(KERN_DEBUG "tcp_send_synack: wrong queue state\n");
2082 if (!(TCP_SKB_CB(skb)->flags&TCPCB_FLAG_ACK)) {
2083 if (skb_cloned(skb)) {
2084 struct sk_buff *nskb = skb_copy(skb, GFP_ATOMIC);
2087 tcp_unlink_write_queue(skb, sk);
2088 skb_header_release(nskb);
2089 __tcp_add_write_queue_head(sk, nskb);
2090 sk_stream_free_skb(sk, skb);
2091 sk_charge_skb(sk, nskb);
2095 TCP_SKB_CB(skb)->flags |= TCPCB_FLAG_ACK;
2096 TCP_ECN_send_synack(tcp_sk(sk), skb);
2098 TCP_SKB_CB(skb)->when = tcp_time_stamp;
2099 return tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
2103 * Prepare a SYN-ACK.
2105 struct sk_buff * tcp_make_synack(struct sock *sk, struct dst_entry *dst,
2106 struct request_sock *req)
2108 struct inet_request_sock *ireq = inet_rsk(req);
2109 struct tcp_sock *tp = tcp_sk(sk);
2111 int tcp_header_size;
2112 struct sk_buff *skb;
2113 #ifdef CONFIG_TCP_MD5SIG
2114 struct tcp_md5sig_key *md5;
2115 __u8 *md5_hash_location;
2118 skb = sock_wmalloc(sk, MAX_TCP_HEADER + 15, 1, GFP_ATOMIC);
2122 /* Reserve space for headers. */
2123 skb_reserve(skb, MAX_TCP_HEADER);
2125 skb->dst = dst_clone(dst);
2127 tcp_header_size = (sizeof(struct tcphdr) + TCPOLEN_MSS +
2128 (ireq->tstamp_ok ? TCPOLEN_TSTAMP_ALIGNED : 0) +
2129 (ireq->wscale_ok ? TCPOLEN_WSCALE_ALIGNED : 0) +
2130 /* SACK_PERM is in the place of NOP NOP of TS */
2131 ((ireq->sack_ok && !ireq->tstamp_ok) ? TCPOLEN_SACKPERM_ALIGNED : 0));
2133 #ifdef CONFIG_TCP_MD5SIG
2134 /* Are we doing MD5 on this segment? If so - make room for it */
2135 md5 = tcp_rsk(req)->af_specific->md5_lookup(sk, req);
2137 tcp_header_size += TCPOLEN_MD5SIG_ALIGNED;
2139 skb_push(skb, tcp_header_size);
2140 skb_reset_transport_header(skb);
2143 memset(th, 0, sizeof(struct tcphdr));
2146 TCP_ECN_make_synack(req, th);
2147 th->source = inet_sk(sk)->sport;
2148 th->dest = ireq->rmt_port;
2149 TCP_SKB_CB(skb)->seq = tcp_rsk(req)->snt_isn;
2150 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(skb)->seq + 1;
2151 TCP_SKB_CB(skb)->sacked = 0;
2152 skb_shinfo(skb)->gso_segs = 1;
2153 skb_shinfo(skb)->gso_size = 0;
2154 skb_shinfo(skb)->gso_type = 0;
2155 th->seq = htonl(TCP_SKB_CB(skb)->seq);
2156 th->ack_seq = htonl(tcp_rsk(req)->rcv_isn + 1);
2157 if (req->rcv_wnd == 0) { /* ignored for retransmitted syns */
2159 /* Set this up on the first call only */
2160 req->window_clamp = tp->window_clamp ? : dst_metric(dst, RTAX_WINDOW);
2161 /* tcp_full_space because it is guaranteed to be the first packet */
2162 tcp_select_initial_window(tcp_full_space(sk),
2163 dst_metric(dst, RTAX_ADVMSS) - (ireq->tstamp_ok ? TCPOLEN_TSTAMP_ALIGNED : 0),
2168 ireq->rcv_wscale = rcv_wscale;
2171 /* RFC1323: The window in SYN & SYN/ACK segments is never scaled. */
2172 th->window = htons(min(req->rcv_wnd, 65535U));
2174 TCP_SKB_CB(skb)->when = tcp_time_stamp;
2175 tcp_syn_build_options((__be32 *)(th + 1), dst_metric(dst, RTAX_ADVMSS), ireq->tstamp_ok,
2176 ireq->sack_ok, ireq->wscale_ok, ireq->rcv_wscale,
2177 TCP_SKB_CB(skb)->when,
2180 #ifdef CONFIG_TCP_MD5SIG
2181 md5 ? &md5_hash_location :
2187 th->doff = (tcp_header_size >> 2);
2188 TCP_INC_STATS(TCP_MIB_OUTSEGS);
2190 #ifdef CONFIG_TCP_MD5SIG
2191 /* Okay, we have all we need - do the md5 hash if needed */
2193 tp->af_specific->calc_md5_hash(md5_hash_location,
2196 tcp_hdr(skb), sk->sk_protocol,
2205 * Do all connect socket setups that can be done AF independent.
2207 static void tcp_connect_init(struct sock *sk)
2209 struct dst_entry *dst = __sk_dst_get(sk);
2210 struct tcp_sock *tp = tcp_sk(sk);
2213 /* We'll fix this up when we get a response from the other end.
2214 * See tcp_input.c:tcp_rcv_state_process case TCP_SYN_SENT.
2216 tp->tcp_header_len = sizeof(struct tcphdr) +
2217 (sysctl_tcp_timestamps ? TCPOLEN_TSTAMP_ALIGNED : 0);
2219 #ifdef CONFIG_TCP_MD5SIG
2220 if (tp->af_specific->md5_lookup(sk, sk) != NULL)
2221 tp->tcp_header_len += TCPOLEN_MD5SIG_ALIGNED;
2224 /* If user gave his TCP_MAXSEG, record it to clamp */
2225 if (tp->rx_opt.user_mss)
2226 tp->rx_opt.mss_clamp = tp->rx_opt.user_mss;
2229 tcp_sync_mss(sk, dst_mtu(dst));
2231 if (!tp->window_clamp)
2232 tp->window_clamp = dst_metric(dst, RTAX_WINDOW);
2233 tp->advmss = dst_metric(dst, RTAX_ADVMSS);
2234 tcp_initialize_rcv_mss(sk);
2236 tcp_select_initial_window(tcp_full_space(sk),
2237 tp->advmss - (tp->rx_opt.ts_recent_stamp ? tp->tcp_header_len - sizeof(struct tcphdr) : 0),
2240 sysctl_tcp_window_scaling,
2243 tp->rx_opt.rcv_wscale = rcv_wscale;
2244 tp->rcv_ssthresh = tp->rcv_wnd;
2247 sock_reset_flag(sk, SOCK_DONE);
2249 tcp_init_wl(tp, tp->write_seq, 0);
2250 tp->snd_una = tp->write_seq;
2251 tp->snd_sml = tp->write_seq;
2256 inet_csk(sk)->icsk_rto = TCP_TIMEOUT_INIT;
2257 inet_csk(sk)->icsk_retransmits = 0;
2258 tcp_clear_retrans(tp);
2262 * Build a SYN and send it off.
2264 int tcp_connect(struct sock *sk)
2266 struct tcp_sock *tp = tcp_sk(sk);
2267 struct sk_buff *buff;
2269 tcp_connect_init(sk);
2271 buff = alloc_skb_fclone(MAX_TCP_HEADER + 15, sk->sk_allocation);
2272 if (unlikely(buff == NULL))
2275 /* Reserve space for headers. */
2276 skb_reserve(buff, MAX_TCP_HEADER);
2278 TCP_SKB_CB(buff)->flags = TCPCB_FLAG_SYN;
2279 TCP_ECN_send_syn(sk, buff);
2280 TCP_SKB_CB(buff)->sacked = 0;
2281 skb_shinfo(buff)->gso_segs = 1;
2282 skb_shinfo(buff)->gso_size = 0;
2283 skb_shinfo(buff)->gso_type = 0;
2285 tp->snd_nxt = tp->write_seq;
2286 TCP_SKB_CB(buff)->seq = tp->write_seq++;
2287 TCP_SKB_CB(buff)->end_seq = tp->write_seq;
2290 TCP_SKB_CB(buff)->when = tcp_time_stamp;
2291 tp->retrans_stamp = TCP_SKB_CB(buff)->when;
2292 skb_header_release(buff);
2293 __tcp_add_write_queue_tail(sk, buff);
2294 sk_charge_skb(sk, buff);
2295 tp->packets_out += tcp_skb_pcount(buff);
2296 tcp_transmit_skb(sk, buff, 1, GFP_KERNEL);
2298 /* We change tp->snd_nxt after the tcp_transmit_skb() call
2299 * in order to make this packet get counted in tcpOutSegs.
2301 tp->snd_nxt = tp->write_seq;
2302 tp->pushed_seq = tp->write_seq;
2303 TCP_INC_STATS(TCP_MIB_ACTIVEOPENS);
2305 /* Timer for repeating the SYN until an answer. */
2306 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
2307 inet_csk(sk)->icsk_rto, TCP_RTO_MAX);
2311 /* Send out a delayed ack, the caller does the policy checking
2312 * to see if we should even be here. See tcp_input.c:tcp_ack_snd_check()
2315 void tcp_send_delayed_ack(struct sock *sk)
2317 struct inet_connection_sock *icsk = inet_csk(sk);
2318 int ato = icsk->icsk_ack.ato;
2319 unsigned long timeout;
2321 if (ato > TCP_DELACK_MIN) {
2322 const struct tcp_sock *tp = tcp_sk(sk);
2325 if (icsk->icsk_ack.pingpong || (icsk->icsk_ack.pending & ICSK_ACK_PUSHED))
2326 max_ato = TCP_DELACK_MAX;
2328 /* Slow path, intersegment interval is "high". */
2330 /* If some rtt estimate is known, use it to bound delayed ack.
2331 * Do not use inet_csk(sk)->icsk_rto here, use results of rtt measurements
2335 int rtt = max(tp->srtt>>3, TCP_DELACK_MIN);
2341 ato = min(ato, max_ato);
2344 /* Stay within the limit we were given */
2345 timeout = jiffies + ato;
2347 /* Use new timeout only if there wasn't a older one earlier. */
2348 if (icsk->icsk_ack.pending & ICSK_ACK_TIMER) {
2349 /* If delack timer was blocked or is about to expire,
2352 if (icsk->icsk_ack.blocked ||
2353 time_before_eq(icsk->icsk_ack.timeout, jiffies + (ato >> 2))) {
2358 if (!time_before(timeout, icsk->icsk_ack.timeout))
2359 timeout = icsk->icsk_ack.timeout;
2361 icsk->icsk_ack.pending |= ICSK_ACK_SCHED | ICSK_ACK_TIMER;
2362 icsk->icsk_ack.timeout = timeout;
2363 sk_reset_timer(sk, &icsk->icsk_delack_timer, timeout);
2366 /* This routine sends an ack and also updates the window. */
2367 void tcp_send_ack(struct sock *sk)
2369 /* If we have been reset, we may not send again. */
2370 if (sk->sk_state != TCP_CLOSE) {
2371 struct sk_buff *buff;
2373 /* We are not putting this on the write queue, so
2374 * tcp_transmit_skb() will set the ownership to this
2377 buff = alloc_skb(MAX_TCP_HEADER, GFP_ATOMIC);
2379 inet_csk_schedule_ack(sk);
2380 inet_csk(sk)->icsk_ack.ato = TCP_ATO_MIN;
2381 inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK,
2382 TCP_DELACK_MAX, TCP_RTO_MAX);
2386 /* Reserve space for headers and prepare control bits. */
2387 skb_reserve(buff, MAX_TCP_HEADER);
2389 TCP_SKB_CB(buff)->flags = TCPCB_FLAG_ACK;
2390 TCP_SKB_CB(buff)->sacked = 0;
2391 skb_shinfo(buff)->gso_segs = 1;
2392 skb_shinfo(buff)->gso_size = 0;
2393 skb_shinfo(buff)->gso_type = 0;
2395 /* Send it off, this clears delayed acks for us. */
2396 TCP_SKB_CB(buff)->seq = TCP_SKB_CB(buff)->end_seq = tcp_acceptable_seq(sk);
2397 TCP_SKB_CB(buff)->when = tcp_time_stamp;
2398 tcp_transmit_skb(sk, buff, 0, GFP_ATOMIC);
2402 /* This routine sends a packet with an out of date sequence
2403 * number. It assumes the other end will try to ack it.
2405 * Question: what should we make while urgent mode?
2406 * 4.4BSD forces sending single byte of data. We cannot send
2407 * out of window data, because we have SND.NXT==SND.MAX...
2409 * Current solution: to send TWO zero-length segments in urgent mode:
2410 * one is with SEG.SEQ=SND.UNA to deliver urgent pointer, another is
2411 * out-of-date with SND.UNA-1 to probe window.
2413 static int tcp_xmit_probe_skb(struct sock *sk, int urgent)
2415 struct tcp_sock *tp = tcp_sk(sk);
2416 struct sk_buff *skb;
2418 /* We don't queue it, tcp_transmit_skb() sets ownership. */
2419 skb = alloc_skb(MAX_TCP_HEADER, GFP_ATOMIC);
2423 /* Reserve space for headers and set control bits. */
2424 skb_reserve(skb, MAX_TCP_HEADER);
2426 TCP_SKB_CB(skb)->flags = TCPCB_FLAG_ACK;
2427 TCP_SKB_CB(skb)->sacked = urgent;
2428 skb_shinfo(skb)->gso_segs = 1;
2429 skb_shinfo(skb)->gso_size = 0;
2430 skb_shinfo(skb)->gso_type = 0;
2432 /* Use a previous sequence. This should cause the other
2433 * end to send an ack. Don't queue or clone SKB, just
2436 TCP_SKB_CB(skb)->seq = urgent ? tp->snd_una : tp->snd_una - 1;
2437 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(skb)->seq;
2438 TCP_SKB_CB(skb)->when = tcp_time_stamp;
2439 return tcp_transmit_skb(sk, skb, 0, GFP_ATOMIC);
2442 int tcp_write_wakeup(struct sock *sk)
2444 if (sk->sk_state != TCP_CLOSE) {
2445 struct tcp_sock *tp = tcp_sk(sk);
2446 struct sk_buff *skb;
2448 if ((skb = tcp_send_head(sk)) != NULL &&
2449 before(TCP_SKB_CB(skb)->seq, tp->snd_una+tp->snd_wnd)) {
2451 unsigned int mss = tcp_current_mss(sk, 0);
2452 unsigned int seg_size = tp->snd_una+tp->snd_wnd-TCP_SKB_CB(skb)->seq;
2454 if (before(tp->pushed_seq, TCP_SKB_CB(skb)->end_seq))
2455 tp->pushed_seq = TCP_SKB_CB(skb)->end_seq;
2457 /* We are probing the opening of a window
2458 * but the window size is != 0
2459 * must have been a result SWS avoidance ( sender )
2461 if (seg_size < TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq ||
2463 seg_size = min(seg_size, mss);
2464 TCP_SKB_CB(skb)->flags |= TCPCB_FLAG_PSH;
2465 if (tcp_fragment(sk, skb, seg_size, mss))
2467 } else if (!tcp_skb_pcount(skb))
2468 tcp_set_skb_tso_segs(sk, skb, mss);
2470 TCP_SKB_CB(skb)->flags |= TCPCB_FLAG_PSH;
2471 TCP_SKB_CB(skb)->when = tcp_time_stamp;
2472 err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
2474 update_send_head(sk, skb);
2479 between(tp->snd_up, tp->snd_una+1, tp->snd_una+0xFFFF))
2480 tcp_xmit_probe_skb(sk, TCPCB_URG);
2481 return tcp_xmit_probe_skb(sk, 0);
2487 /* A window probe timeout has occurred. If window is not closed send
2488 * a partial packet else a zero probe.
2490 void tcp_send_probe0(struct sock *sk)
2492 struct inet_connection_sock *icsk = inet_csk(sk);
2493 struct tcp_sock *tp = tcp_sk(sk);
2496 err = tcp_write_wakeup(sk);
2498 if (tp->packets_out || !tcp_send_head(sk)) {
2499 /* Cancel probe timer, if it is not required. */
2500 icsk->icsk_probes_out = 0;
2501 icsk->icsk_backoff = 0;
2506 if (icsk->icsk_backoff < sysctl_tcp_retries2)
2507 icsk->icsk_backoff++;
2508 icsk->icsk_probes_out++;
2509 inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
2510 min(icsk->icsk_rto << icsk->icsk_backoff, TCP_RTO_MAX),
2513 /* If packet was not sent due to local congestion,
2514 * do not backoff and do not remember icsk_probes_out.
2515 * Let local senders to fight for local resources.
2517 * Use accumulated backoff yet.
2519 if (!icsk->icsk_probes_out)
2520 icsk->icsk_probes_out = 1;
2521 inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
2522 min(icsk->icsk_rto << icsk->icsk_backoff,
2523 TCP_RESOURCE_PROBE_INTERVAL),
2528 EXPORT_SYMBOL(tcp_connect);
2529 EXPORT_SYMBOL(tcp_make_synack);
2530 EXPORT_SYMBOL(tcp_simple_retransmit);
2531 EXPORT_SYMBOL(tcp_sync_mss);
2532 EXPORT_SYMBOL(sysctl_tcp_tso_win_divisor);
2533 EXPORT_SYMBOL(tcp_mtup_init);