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).
9 * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
10 * Mark Evans, <evansmp@uhura.aston.ac.uk>
11 * Corey Minyard <wf-rch!minyard@relay.EU.net>
12 * Florian La Roche, <flla@stud.uni-sb.de>
13 * Charles Hedrick, <hedrick@klinzhai.rutgers.edu>
14 * Linus Torvalds, <torvalds@cs.helsinki.fi>
15 * Alan Cox, <gw4pts@gw4pts.ampr.org>
16 * Matthew Dillon, <dillon@apollo.west.oic.com>
17 * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
18 * Jorge Cwik, <jorge@laser.satlink.net>
21 * Alan Cox : Numerous verify_area() calls
22 * Alan Cox : Set the ACK bit on a reset
23 * Alan Cox : Stopped it crashing if it closed while
24 * sk->inuse=1 and was trying to connect
26 * Alan Cox : All icmp error handling was broken
27 * pointers passed where wrong and the
28 * socket was looked up backwards. Nobody
29 * tested any icmp error code obviously.
30 * Alan Cox : tcp_err() now handled properly. It
31 * wakes people on errors. poll
32 * behaves and the icmp error race
33 * has gone by moving it into sock.c
34 * Alan Cox : tcp_send_reset() fixed to work for
35 * everything not just packets for
37 * Alan Cox : tcp option processing.
38 * Alan Cox : Reset tweaked (still not 100%) [Had
40 * Herp Rosmanith : More reset fixes
41 * Alan Cox : No longer acks invalid rst frames.
42 * Acking any kind of RST is right out.
43 * Alan Cox : Sets an ignore me flag on an rst
44 * receive otherwise odd bits of prattle
46 * Alan Cox : Fixed another acking RST frame bug.
47 * Should stop LAN workplace lockups.
48 * Alan Cox : Some tidyups using the new skb list
50 * Alan Cox : sk->keepopen now seems to work
51 * Alan Cox : Pulls options out correctly on accepts
52 * Alan Cox : Fixed assorted sk->rqueue->next errors
53 * Alan Cox : PSH doesn't end a TCP read. Switched a
55 * Alan Cox : Tidied tcp_data to avoid a potential
57 * Alan Cox : Added some better commenting, as the
58 * tcp is hard to follow
59 * Alan Cox : Removed incorrect check for 20 * psh
60 * Michael O'Reilly : ack < copied bug fix.
61 * Johannes Stille : Misc tcp fixes (not all in yet).
62 * Alan Cox : FIN with no memory -> CRASH
63 * Alan Cox : Added socket option proto entries.
64 * Also added awareness of them to accept.
65 * Alan Cox : Added TCP options (SOL_TCP)
66 * Alan Cox : Switched wakeup calls to callbacks,
67 * so the kernel can layer network
69 * Alan Cox : Use ip_tos/ip_ttl settings.
70 * Alan Cox : Handle FIN (more) properly (we hope).
71 * Alan Cox : RST frames sent on unsynchronised
73 * Alan Cox : Put in missing check for SYN bit.
74 * Alan Cox : Added tcp_select_window() aka NET2E
75 * window non shrink trick.
76 * Alan Cox : Added a couple of small NET2E timer
78 * Charles Hedrick : TCP fixes
79 * Toomas Tamm : TCP window fixes
80 * Alan Cox : Small URG fix to rlogin ^C ack fight
81 * Charles Hedrick : Rewrote most of it to actually work
82 * Linus : Rewrote tcp_read() and URG handling
84 * Gerhard Koerting: Fixed some missing timer handling
85 * Matthew Dillon : Reworked TCP machine states as per RFC
86 * Gerhard Koerting: PC/TCP workarounds
87 * Adam Caldwell : Assorted timer/timing errors
88 * Matthew Dillon : Fixed another RST bug
89 * Alan Cox : Move to kernel side addressing changes.
90 * Alan Cox : Beginning work on TCP fastpathing
92 * Arnt Gulbrandsen: Turbocharged tcp_check() routine.
93 * Alan Cox : TCP fast path debugging
94 * Alan Cox : Window clamping
95 * Michael Riepe : Bug in tcp_check()
96 * Matt Dillon : More TCP improvements and RST bug fixes
97 * Matt Dillon : Yet more small nasties remove from the
98 * TCP code (Be very nice to this man if
99 * tcp finally works 100%) 8)
100 * Alan Cox : BSD accept semantics.
101 * Alan Cox : Reset on closedown bug.
102 * Peter De Schrijver : ENOTCONN check missing in tcp_sendto().
103 * Michael Pall : Handle poll() after URG properly in
105 * Michael Pall : Undo the last fix in tcp_read_urg()
106 * (multi URG PUSH broke rlogin).
107 * Michael Pall : Fix the multi URG PUSH problem in
108 * tcp_readable(), poll() after URG
110 * Michael Pall : recv(...,MSG_OOB) never blocks in the
112 * Alan Cox : Changed the semantics of sk->socket to
113 * fix a race and a signal problem with
114 * accept() and async I/O.
115 * Alan Cox : Relaxed the rules on tcp_sendto().
116 * Yury Shevchuk : Really fixed accept() blocking problem.
117 * Craig I. Hagan : Allow for BSD compatible TIME_WAIT for
118 * clients/servers which listen in on
120 * Alan Cox : Cleaned the above up and shrank it to
121 * a sensible code size.
122 * Alan Cox : Self connect lockup fix.
123 * Alan Cox : No connect to multicast.
124 * Ross Biro : Close unaccepted children on master
126 * Alan Cox : Reset tracing code.
127 * Alan Cox : Spurious resets on shutdown.
128 * Alan Cox : Giant 15 minute/60 second timer error
129 * Alan Cox : Small whoops in polling before an
131 * Alan Cox : Kept the state trace facility since
132 * it's handy for debugging.
133 * Alan Cox : More reset handler fixes.
134 * Alan Cox : Started rewriting the code based on
135 * the RFC's for other useful protocol
136 * references see: Comer, KA9Q NOS, and
137 * for a reference on the difference
138 * between specifications and how BSD
139 * works see the 4.4lite source.
140 * A.N.Kuznetsov : Don't time wait on completion of tidy
142 * Linus Torvalds : Fin/Shutdown & copied_seq changes.
143 * Linus Torvalds : Fixed BSD port reuse to work first syn
144 * Alan Cox : Reimplemented timers as per the RFC
145 * and using multiple timers for sanity.
146 * Alan Cox : Small bug fixes, and a lot of new
148 * Alan Cox : Fixed dual reader crash by locking
149 * the buffers (much like datagram.c)
150 * Alan Cox : Fixed stuck sockets in probe. A probe
151 * now gets fed up of retrying without
152 * (even a no space) answer.
153 * Alan Cox : Extracted closing code better
154 * Alan Cox : Fixed the closing state machine to
156 * Alan Cox : More 'per spec' fixes.
157 * Jorge Cwik : Even faster checksumming.
158 * Alan Cox : tcp_data() doesn't ack illegal PSH
159 * only frames. At least one pc tcp stack
161 * Alan Cox : Cache last socket.
162 * Alan Cox : Per route irtt.
163 * Matt Day : poll()->select() match BSD precisely on error
164 * Alan Cox : New buffers
165 * Marc Tamsky : Various sk->prot->retransmits and
166 * sk->retransmits misupdating fixed.
167 * Fixed tcp_write_timeout: stuck close,
168 * and TCP syn retries gets used now.
169 * Mark Yarvis : In tcp_read_wakeup(), don't send an
170 * ack if state is TCP_CLOSED.
171 * Alan Cox : Look up device on a retransmit - routes may
172 * change. Doesn't yet cope with MSS shrink right
174 * Marc Tamsky : Closing in closing fixes.
175 * Mike Shaver : RFC1122 verifications.
176 * Alan Cox : rcv_saddr errors.
177 * Alan Cox : Block double connect().
178 * Alan Cox : Small hooks for enSKIP.
179 * Alexey Kuznetsov: Path MTU discovery.
180 * Alan Cox : Support soft errors.
181 * Alan Cox : Fix MTU discovery pathological case
182 * when the remote claims no mtu!
183 * Marc Tamsky : TCP_CLOSE fix.
184 * Colin (G3TNE) : Send a reset on syn ack replies in
185 * window but wrong (fixes NT lpd problems)
186 * Pedro Roque : Better TCP window handling, delayed ack.
187 * Joerg Reuter : No modification of locked buffers in
188 * tcp_do_retransmit()
189 * Eric Schenk : Changed receiver side silly window
190 * avoidance algorithm to BSD style
191 * algorithm. This doubles throughput
192 * against machines running Solaris,
193 * and seems to result in general
195 * Stefan Magdalinski : adjusted tcp_readable() to fix FIONREAD
196 * Willy Konynenberg : Transparent proxying support.
197 * Mike McLagan : Routing by source
198 * Keith Owens : Do proper merging with partial SKB's in
199 * tcp_do_sendmsg to avoid burstiness.
200 * Eric Schenk : Fix fast close down bug with
201 * shutdown() followed by close().
202 * Andi Kleen : Make poll agree with SIGIO
203 * Salvatore Sanfilippo : Support SO_LINGER with linger == 1 and
204 * lingertime == 0 (RFC 793 ABORT Call)
205 * Hirokazu Takahashi : Use copy_from_user() instead of
206 * csum_and_copy_from_user() if possible.
208 * This program is free software; you can redistribute it and/or
209 * modify it under the terms of the GNU General Public License
210 * as published by the Free Software Foundation; either version
211 * 2 of the License, or(at your option) any later version.
213 * Description of States:
215 * TCP_SYN_SENT sent a connection request, waiting for ack
217 * TCP_SYN_RECV received a connection request, sent ack,
218 * waiting for final ack in three-way handshake.
220 * TCP_ESTABLISHED connection established
222 * TCP_FIN_WAIT1 our side has shutdown, waiting to complete
223 * transmission of remaining buffered data
225 * TCP_FIN_WAIT2 all buffered data sent, waiting for remote
228 * TCP_CLOSING both sides have shutdown but we still have
229 * data we have to finish sending
231 * TCP_TIME_WAIT timeout to catch resent junk before entering
232 * closed, can only be entered from FIN_WAIT2
233 * or CLOSING. Required because the other end
234 * may not have gotten our last ACK causing it
235 * to retransmit the data packet (which we ignore)
237 * TCP_CLOSE_WAIT remote side has shutdown and is waiting for
238 * us to finish writing our data and to shutdown
239 * (we have to close() to move on to LAST_ACK)
241 * TCP_LAST_ACK out side has shutdown after remote has
242 * shutdown. There may still be data in our
243 * buffer that we have to finish sending
245 * TCP_CLOSE socket is finished
248 #define pr_fmt(fmt) "TCP: " fmt
250 #include <linux/kernel.h>
251 #include <linux/module.h>
252 #include <linux/types.h>
253 #include <linux/fcntl.h>
254 #include <linux/poll.h>
255 #include <linux/init.h>
256 #include <linux/fs.h>
257 #include <linux/skbuff.h>
258 #include <linux/scatterlist.h>
259 #include <linux/splice.h>
260 #include <linux/net.h>
261 #include <linux/socket.h>
262 #include <linux/random.h>
263 #include <linux/bootmem.h>
264 #include <linux/highmem.h>
265 #include <linux/swap.h>
266 #include <linux/cache.h>
267 #include <linux/err.h>
268 #include <linux/crypto.h>
269 #include <linux/time.h>
270 #include <linux/slab.h>
272 #include <net/icmp.h>
273 #include <net/inet_common.h>
275 #include <net/xfrm.h>
277 #include <net/netdma.h>
278 #include <net/sock.h>
280 #include <asm/uaccess.h>
281 #include <asm/ioctls.h>
283 int sysctl_tcp_fin_timeout __read_mostly
= TCP_FIN_TIMEOUT
;
285 struct percpu_counter tcp_orphan_count
;
286 EXPORT_SYMBOL_GPL(tcp_orphan_count
);
288 int sysctl_tcp_wmem
[3] __read_mostly
;
289 int sysctl_tcp_rmem
[3] __read_mostly
;
291 EXPORT_SYMBOL(sysctl_tcp_rmem
);
292 EXPORT_SYMBOL(sysctl_tcp_wmem
);
294 atomic_long_t tcp_memory_allocated
; /* Current allocated memory. */
295 EXPORT_SYMBOL(tcp_memory_allocated
);
298 * Current number of TCP sockets.
300 struct percpu_counter tcp_sockets_allocated
;
301 EXPORT_SYMBOL(tcp_sockets_allocated
);
306 struct tcp_splice_state
{
307 struct pipe_inode_info
*pipe
;
313 * Pressure flag: try to collapse.
314 * Technical note: it is used by multiple contexts non atomically.
315 * All the __sk_mem_schedule() is of this nature: accounting
316 * is strict, actions are advisory and have some latency.
318 int tcp_memory_pressure __read_mostly
;
319 EXPORT_SYMBOL(tcp_memory_pressure
);
321 void tcp_enter_memory_pressure(struct sock
*sk
)
323 if (!tcp_memory_pressure
) {
324 NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPMEMORYPRESSURES
);
325 tcp_memory_pressure
= 1;
328 EXPORT_SYMBOL(tcp_enter_memory_pressure
);
330 /* Convert seconds to retransmits based on initial and max timeout */
331 static u8
secs_to_retrans(int seconds
, int timeout
, int rto_max
)
336 int period
= timeout
;
339 while (seconds
> period
&& res
< 255) {
342 if (timeout
> rto_max
)
350 /* Convert retransmits to seconds based on initial and max timeout */
351 static int retrans_to_secs(u8 retrans
, int timeout
, int rto_max
)
359 if (timeout
> rto_max
)
367 /* Address-family independent initialization for a tcp_sock.
369 * NOTE: A lot of things set to zero explicitly by call to
370 * sk_alloc() so need not be done here.
372 void tcp_init_sock(struct sock
*sk
)
374 struct inet_connection_sock
*icsk
= inet_csk(sk
);
375 struct tcp_sock
*tp
= tcp_sk(sk
);
377 skb_queue_head_init(&tp
->out_of_order_queue
);
378 tcp_init_xmit_timers(sk
);
379 tcp_prequeue_init(tp
);
380 INIT_LIST_HEAD(&tp
->tsq_node
);
382 icsk
->icsk_rto
= TCP_TIMEOUT_INIT
;
383 tp
->mdev
= TCP_TIMEOUT_INIT
;
385 /* So many TCP implementations out there (incorrectly) count the
386 * initial SYN frame in their delayed-ACK and congestion control
387 * algorithms that we must have the following bandaid to talk
388 * efficiently to them. -DaveM
390 tp
->snd_cwnd
= TCP_INIT_CWND
;
392 /* See draft-stevens-tcpca-spec-01 for discussion of the
393 * initialization of these values.
395 tp
->snd_ssthresh
= TCP_INFINITE_SSTHRESH
;
396 tp
->snd_cwnd_clamp
= ~0;
397 tp
->mss_cache
= TCP_MSS_DEFAULT
;
399 tp
->reordering
= sysctl_tcp_reordering
;
400 tcp_enable_early_retrans(tp
);
401 icsk
->icsk_ca_ops
= &tcp_init_congestion_ops
;
403 sk
->sk_state
= TCP_CLOSE
;
405 sk
->sk_write_space
= sk_stream_write_space
;
406 sock_set_flag(sk
, SOCK_USE_WRITE_QUEUE
);
408 icsk
->icsk_sync_mss
= tcp_sync_mss
;
410 /* TCP Cookie Transactions */
411 if (sysctl_tcp_cookie_size
> 0) {
412 /* Default, cookies without s_data_payload. */
414 kzalloc(sizeof(*tp
->cookie_values
),
416 if (tp
->cookie_values
!= NULL
)
417 kref_init(&tp
->cookie_values
->kref
);
419 /* Presumed zeroed, in order of appearance:
420 * cookie_in_always, cookie_out_never,
421 * s_data_constant, s_data_in, s_data_out
423 sk
->sk_sndbuf
= sysctl_tcp_wmem
[1];
424 sk
->sk_rcvbuf
= sysctl_tcp_rmem
[1];
427 sock_update_memcg(sk
);
428 sk_sockets_allocated_inc(sk
);
431 EXPORT_SYMBOL(tcp_init_sock
);
434 * Wait for a TCP event.
436 * Note that we don't need to lock the socket, as the upper poll layers
437 * take care of normal races (between the test and the event) and we don't
438 * go look at any of the socket buffers directly.
440 unsigned int tcp_poll(struct file
*file
, struct socket
*sock
, poll_table
*wait
)
443 struct sock
*sk
= sock
->sk
;
444 const struct tcp_sock
*tp
= tcp_sk(sk
);
446 sock_poll_wait(file
, sk_sleep(sk
), wait
);
447 if (sk
->sk_state
== TCP_LISTEN
)
448 return inet_csk_listen_poll(sk
);
450 /* Socket is not locked. We are protected from async events
451 * by poll logic and correct handling of state changes
452 * made by other threads is impossible in any case.
458 * POLLHUP is certainly not done right. But poll() doesn't
459 * have a notion of HUP in just one direction, and for a
460 * socket the read side is more interesting.
462 * Some poll() documentation says that POLLHUP is incompatible
463 * with the POLLOUT/POLLWR flags, so somebody should check this
464 * all. But careful, it tends to be safer to return too many
465 * bits than too few, and you can easily break real applications
466 * if you don't tell them that something has hung up!
470 * Check number 1. POLLHUP is _UNMASKABLE_ event (see UNIX98 and
471 * our fs/select.c). It means that after we received EOF,
472 * poll always returns immediately, making impossible poll() on write()
473 * in state CLOSE_WAIT. One solution is evident --- to set POLLHUP
474 * if and only if shutdown has been made in both directions.
475 * Actually, it is interesting to look how Solaris and DUX
476 * solve this dilemma. I would prefer, if POLLHUP were maskable,
477 * then we could set it on SND_SHUTDOWN. BTW examples given
478 * in Stevens' books assume exactly this behaviour, it explains
479 * why POLLHUP is incompatible with POLLOUT. --ANK
481 * NOTE. Check for TCP_CLOSE is added. The goal is to prevent
482 * blocking on fresh not-connected or disconnected socket. --ANK
484 if (sk
->sk_shutdown
== SHUTDOWN_MASK
|| sk
->sk_state
== TCP_CLOSE
)
486 if (sk
->sk_shutdown
& RCV_SHUTDOWN
)
487 mask
|= POLLIN
| POLLRDNORM
| POLLRDHUP
;
489 /* Connected or passive Fast Open socket? */
490 if (sk
->sk_state
!= TCP_SYN_SENT
&&
491 (sk
->sk_state
!= TCP_SYN_RECV
|| tp
->fastopen_rsk
!= NULL
)) {
492 int target
= sock_rcvlowat(sk
, 0, INT_MAX
);
494 if (tp
->urg_seq
== tp
->copied_seq
&&
495 !sock_flag(sk
, SOCK_URGINLINE
) &&
499 /* Potential race condition. If read of tp below will
500 * escape above sk->sk_state, we can be illegally awaken
501 * in SYN_* states. */
502 if (tp
->rcv_nxt
- tp
->copied_seq
>= target
)
503 mask
|= POLLIN
| POLLRDNORM
;
505 if (!(sk
->sk_shutdown
& SEND_SHUTDOWN
)) {
506 if (sk_stream_wspace(sk
) >= sk_stream_min_wspace(sk
)) {
507 mask
|= POLLOUT
| POLLWRNORM
;
508 } else { /* send SIGIO later */
509 set_bit(SOCK_ASYNC_NOSPACE
,
510 &sk
->sk_socket
->flags
);
511 set_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
);
513 /* Race breaker. If space is freed after
514 * wspace test but before the flags are set,
515 * IO signal will be lost.
517 if (sk_stream_wspace(sk
) >= sk_stream_min_wspace(sk
))
518 mask
|= POLLOUT
| POLLWRNORM
;
521 mask
|= POLLOUT
| POLLWRNORM
;
523 if (tp
->urg_data
& TCP_URG_VALID
)
526 /* This barrier is coupled with smp_wmb() in tcp_reset() */
533 EXPORT_SYMBOL(tcp_poll
);
535 int tcp_ioctl(struct sock
*sk
, int cmd
, unsigned long arg
)
537 struct tcp_sock
*tp
= tcp_sk(sk
);
542 if (sk
->sk_state
== TCP_LISTEN
)
546 if ((1 << sk
->sk_state
) & (TCPF_SYN_SENT
| TCPF_SYN_RECV
))
548 else if (sock_flag(sk
, SOCK_URGINLINE
) ||
550 before(tp
->urg_seq
, tp
->copied_seq
) ||
551 !before(tp
->urg_seq
, tp
->rcv_nxt
)) {
554 answ
= tp
->rcv_nxt
- tp
->copied_seq
;
556 /* Subtract 1, if FIN is in queue. */
557 skb
= skb_peek_tail(&sk
->sk_receive_queue
);
559 answ
-= tcp_hdr(skb
)->fin
;
561 answ
= tp
->urg_seq
- tp
->copied_seq
;
565 answ
= tp
->urg_data
&& tp
->urg_seq
== tp
->copied_seq
;
568 if (sk
->sk_state
== TCP_LISTEN
)
571 if ((1 << sk
->sk_state
) & (TCPF_SYN_SENT
| TCPF_SYN_RECV
))
574 answ
= tp
->write_seq
- tp
->snd_una
;
577 if (sk
->sk_state
== TCP_LISTEN
)
580 if ((1 << sk
->sk_state
) & (TCPF_SYN_SENT
| TCPF_SYN_RECV
))
583 answ
= tp
->write_seq
- tp
->snd_nxt
;
589 return put_user(answ
, (int __user
*)arg
);
591 EXPORT_SYMBOL(tcp_ioctl
);
593 static inline void tcp_mark_push(struct tcp_sock
*tp
, struct sk_buff
*skb
)
595 TCP_SKB_CB(skb
)->tcp_flags
|= TCPHDR_PSH
;
596 tp
->pushed_seq
= tp
->write_seq
;
599 static inline bool forced_push(const struct tcp_sock
*tp
)
601 return after(tp
->write_seq
, tp
->pushed_seq
+ (tp
->max_window
>> 1));
604 static inline void skb_entail(struct sock
*sk
, struct sk_buff
*skb
)
606 struct tcp_sock
*tp
= tcp_sk(sk
);
607 struct tcp_skb_cb
*tcb
= TCP_SKB_CB(skb
);
610 tcb
->seq
= tcb
->end_seq
= tp
->write_seq
;
611 tcb
->tcp_flags
= TCPHDR_ACK
;
613 skb_header_release(skb
);
614 tcp_add_write_queue_tail(sk
, skb
);
615 sk
->sk_wmem_queued
+= skb
->truesize
;
616 sk_mem_charge(sk
, skb
->truesize
);
617 if (tp
->nonagle
& TCP_NAGLE_PUSH
)
618 tp
->nonagle
&= ~TCP_NAGLE_PUSH
;
621 static inline void tcp_mark_urg(struct tcp_sock
*tp
, int flags
)
624 tp
->snd_up
= tp
->write_seq
;
627 static inline void tcp_push(struct sock
*sk
, int flags
, int mss_now
,
630 if (tcp_send_head(sk
)) {
631 struct tcp_sock
*tp
= tcp_sk(sk
);
633 if (!(flags
& MSG_MORE
) || forced_push(tp
))
634 tcp_mark_push(tp
, tcp_write_queue_tail(sk
));
636 tcp_mark_urg(tp
, flags
);
637 __tcp_push_pending_frames(sk
, mss_now
,
638 (flags
& MSG_MORE
) ? TCP_NAGLE_CORK
: nonagle
);
642 static int tcp_splice_data_recv(read_descriptor_t
*rd_desc
, struct sk_buff
*skb
,
643 unsigned int offset
, size_t len
)
645 struct tcp_splice_state
*tss
= rd_desc
->arg
.data
;
648 ret
= skb_splice_bits(skb
, offset
, tss
->pipe
, min(rd_desc
->count
, len
),
651 rd_desc
->count
-= ret
;
655 static int __tcp_splice_read(struct sock
*sk
, struct tcp_splice_state
*tss
)
657 /* Store TCP splice context information in read_descriptor_t. */
658 read_descriptor_t rd_desc
= {
663 return tcp_read_sock(sk
, &rd_desc
, tcp_splice_data_recv
);
667 * tcp_splice_read - splice data from TCP socket to a pipe
668 * @sock: socket to splice from
669 * @ppos: position (not valid)
670 * @pipe: pipe to splice to
671 * @len: number of bytes to splice
672 * @flags: splice modifier flags
675 * Will read pages from given socket and fill them into a pipe.
678 ssize_t
tcp_splice_read(struct socket
*sock
, loff_t
*ppos
,
679 struct pipe_inode_info
*pipe
, size_t len
,
682 struct sock
*sk
= sock
->sk
;
683 struct tcp_splice_state tss
= {
692 sock_rps_record_flow(sk
);
694 * We can't seek on a socket input
703 timeo
= sock_rcvtimeo(sk
, sock
->file
->f_flags
& O_NONBLOCK
);
705 ret
= __tcp_splice_read(sk
, &tss
);
711 if (sock_flag(sk
, SOCK_DONE
))
714 ret
= sock_error(sk
);
717 if (sk
->sk_shutdown
& RCV_SHUTDOWN
)
719 if (sk
->sk_state
== TCP_CLOSE
) {
721 * This occurs when user tries to read
722 * from never connected socket.
724 if (!sock_flag(sk
, SOCK_DONE
))
732 sk_wait_data(sk
, &timeo
);
733 if (signal_pending(current
)) {
734 ret
= sock_intr_errno(timeo
);
747 if (sk
->sk_err
|| sk
->sk_state
== TCP_CLOSE
||
748 (sk
->sk_shutdown
& RCV_SHUTDOWN
) ||
749 signal_pending(current
))
760 EXPORT_SYMBOL(tcp_splice_read
);
762 struct sk_buff
*sk_stream_alloc_skb(struct sock
*sk
, int size
, gfp_t gfp
)
766 /* The TCP header must be at least 32-bit aligned. */
767 size
= ALIGN(size
, 4);
769 skb
= alloc_skb_fclone(size
+ sk
->sk_prot
->max_header
, gfp
);
771 if (sk_wmem_schedule(sk
, skb
->truesize
)) {
772 skb_reserve(skb
, sk
->sk_prot
->max_header
);
774 * Make sure that we have exactly size bytes
775 * available to the caller, no more, no less.
777 skb
->avail_size
= size
;
782 sk
->sk_prot
->enter_memory_pressure(sk
);
783 sk_stream_moderate_sndbuf(sk
);
788 static unsigned int tcp_xmit_size_goal(struct sock
*sk
, u32 mss_now
,
791 struct tcp_sock
*tp
= tcp_sk(sk
);
792 u32 xmit_size_goal
, old_size_goal
;
794 xmit_size_goal
= mss_now
;
796 if (large_allowed
&& sk_can_gso(sk
)) {
797 xmit_size_goal
= ((sk
->sk_gso_max_size
- 1) -
798 inet_csk(sk
)->icsk_af_ops
->net_header_len
-
799 inet_csk(sk
)->icsk_ext_hdr_len
-
802 /* TSQ : try to have two TSO segments in flight */
803 xmit_size_goal
= min_t(u32
, xmit_size_goal
,
804 sysctl_tcp_limit_output_bytes
>> 1);
806 xmit_size_goal
= tcp_bound_to_half_wnd(tp
, xmit_size_goal
);
808 /* We try hard to avoid divides here */
809 old_size_goal
= tp
->xmit_size_goal_segs
* mss_now
;
811 if (likely(old_size_goal
<= xmit_size_goal
&&
812 old_size_goal
+ mss_now
> xmit_size_goal
)) {
813 xmit_size_goal
= old_size_goal
;
815 tp
->xmit_size_goal_segs
=
816 min_t(u16
, xmit_size_goal
/ mss_now
,
817 sk
->sk_gso_max_segs
);
818 xmit_size_goal
= tp
->xmit_size_goal_segs
* mss_now
;
822 return max(xmit_size_goal
, mss_now
);
825 static int tcp_send_mss(struct sock
*sk
, int *size_goal
, int flags
)
829 mss_now
= tcp_current_mss(sk
);
830 *size_goal
= tcp_xmit_size_goal(sk
, mss_now
, !(flags
& MSG_OOB
));
835 static ssize_t
do_tcp_sendpages(struct sock
*sk
, struct page
**pages
, int poffset
,
836 size_t psize
, int flags
)
838 struct tcp_sock
*tp
= tcp_sk(sk
);
839 int mss_now
, size_goal
;
842 long timeo
= sock_sndtimeo(sk
, flags
& MSG_DONTWAIT
);
844 /* Wait for a connection to finish. One exception is TCP Fast Open
845 * (passive side) where data is allowed to be sent before a connection
846 * is fully established.
848 if (((1 << sk
->sk_state
) & ~(TCPF_ESTABLISHED
| TCPF_CLOSE_WAIT
)) &&
849 !tcp_passive_fastopen(sk
)) {
850 if ((err
= sk_stream_wait_connect(sk
, &timeo
)) != 0)
854 clear_bit(SOCK_ASYNC_NOSPACE
, &sk
->sk_socket
->flags
);
856 mss_now
= tcp_send_mss(sk
, &size_goal
, flags
);
860 if (sk
->sk_err
|| (sk
->sk_shutdown
& SEND_SHUTDOWN
))
864 struct sk_buff
*skb
= tcp_write_queue_tail(sk
);
865 struct page
*page
= pages
[poffset
/ PAGE_SIZE
];
867 int offset
= poffset
% PAGE_SIZE
;
868 int size
= min_t(size_t, psize
, PAGE_SIZE
- offset
);
871 if (!tcp_send_head(sk
) || (copy
= size_goal
- skb
->len
) <= 0) {
873 if (!sk_stream_memory_free(sk
))
874 goto wait_for_sndbuf
;
876 skb
= sk_stream_alloc_skb(sk
, 0, sk
->sk_allocation
);
878 goto wait_for_memory
;
887 i
= skb_shinfo(skb
)->nr_frags
;
888 can_coalesce
= skb_can_coalesce(skb
, i
, page
, offset
);
889 if (!can_coalesce
&& i
>= MAX_SKB_FRAGS
) {
890 tcp_mark_push(tp
, skb
);
893 if (!sk_wmem_schedule(sk
, copy
))
894 goto wait_for_memory
;
897 skb_frag_size_add(&skb_shinfo(skb
)->frags
[i
- 1], copy
);
900 skb_fill_page_desc(skb
, i
, page
, offset
, copy
);
904 skb
->data_len
+= copy
;
905 skb
->truesize
+= copy
;
906 sk
->sk_wmem_queued
+= copy
;
907 sk_mem_charge(sk
, copy
);
908 skb
->ip_summed
= CHECKSUM_PARTIAL
;
909 tp
->write_seq
+= copy
;
910 TCP_SKB_CB(skb
)->end_seq
+= copy
;
911 skb_shinfo(skb
)->gso_segs
= 0;
914 TCP_SKB_CB(skb
)->tcp_flags
&= ~TCPHDR_PSH
;
918 if (!(psize
-= copy
))
921 if (skb
->len
< size_goal
|| (flags
& MSG_OOB
))
924 if (forced_push(tp
)) {
925 tcp_mark_push(tp
, skb
);
926 __tcp_push_pending_frames(sk
, mss_now
, TCP_NAGLE_PUSH
);
927 } else if (skb
== tcp_send_head(sk
))
928 tcp_push_one(sk
, mss_now
);
932 set_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
);
934 tcp_push(sk
, flags
& ~MSG_MORE
, mss_now
, TCP_NAGLE_PUSH
);
936 if ((err
= sk_stream_wait_memory(sk
, &timeo
)) != 0)
939 mss_now
= tcp_send_mss(sk
, &size_goal
, flags
);
943 if (copied
&& !(flags
& MSG_SENDPAGE_NOTLAST
))
944 tcp_push(sk
, flags
, mss_now
, tp
->nonagle
);
951 return sk_stream_error(sk
, flags
, err
);
954 int tcp_sendpage(struct sock
*sk
, struct page
*page
, int offset
,
955 size_t size
, int flags
)
959 if (!(sk
->sk_route_caps
& NETIF_F_SG
) ||
960 !(sk
->sk_route_caps
& NETIF_F_ALL_CSUM
))
961 return sock_no_sendpage(sk
->sk_socket
, page
, offset
, size
,
965 res
= do_tcp_sendpages(sk
, &page
, offset
, size
, flags
);
969 EXPORT_SYMBOL(tcp_sendpage
);
971 static inline int select_size(const struct sock
*sk
, bool sg
)
973 const struct tcp_sock
*tp
= tcp_sk(sk
);
974 int tmp
= tp
->mss_cache
;
977 if (sk_can_gso(sk
)) {
978 /* Small frames wont use a full page:
979 * Payload will immediately follow tcp header.
981 tmp
= SKB_WITH_OVERHEAD(2048 - MAX_TCP_HEADER
);
983 int pgbreak
= SKB_MAX_HEAD(MAX_TCP_HEADER
);
985 if (tmp
>= pgbreak
&&
986 tmp
<= pgbreak
+ (MAX_SKB_FRAGS
- 1) * PAGE_SIZE
)
994 void tcp_free_fastopen_req(struct tcp_sock
*tp
)
996 if (tp
->fastopen_req
!= NULL
) {
997 kfree(tp
->fastopen_req
);
998 tp
->fastopen_req
= NULL
;
1002 static int tcp_sendmsg_fastopen(struct sock
*sk
, struct msghdr
*msg
, int *size
)
1004 struct tcp_sock
*tp
= tcp_sk(sk
);
1007 if (!(sysctl_tcp_fastopen
& TFO_CLIENT_ENABLE
))
1009 if (tp
->fastopen_req
!= NULL
)
1010 return -EALREADY
; /* Another Fast Open is in progress */
1012 tp
->fastopen_req
= kzalloc(sizeof(struct tcp_fastopen_request
),
1014 if (unlikely(tp
->fastopen_req
== NULL
))
1016 tp
->fastopen_req
->data
= msg
;
1018 flags
= (msg
->msg_flags
& MSG_DONTWAIT
) ? O_NONBLOCK
: 0;
1019 err
= __inet_stream_connect(sk
->sk_socket
, msg
->msg_name
,
1020 msg
->msg_namelen
, flags
);
1021 *size
= tp
->fastopen_req
->copied
;
1022 tcp_free_fastopen_req(tp
);
1026 int tcp_sendmsg(struct kiocb
*iocb
, struct sock
*sk
, struct msghdr
*msg
,
1030 struct tcp_sock
*tp
= tcp_sk(sk
);
1031 struct sk_buff
*skb
;
1032 int iovlen
, flags
, err
, copied
= 0;
1033 int mss_now
= 0, size_goal
, copied_syn
= 0, offset
= 0;
1039 flags
= msg
->msg_flags
;
1040 if (flags
& MSG_FASTOPEN
) {
1041 err
= tcp_sendmsg_fastopen(sk
, msg
, &copied_syn
);
1042 if (err
== -EINPROGRESS
&& copied_syn
> 0)
1046 offset
= copied_syn
;
1049 timeo
= sock_sndtimeo(sk
, flags
& MSG_DONTWAIT
);
1051 /* Wait for a connection to finish. One exception is TCP Fast Open
1052 * (passive side) where data is allowed to be sent before a connection
1053 * is fully established.
1055 if (((1 << sk
->sk_state
) & ~(TCPF_ESTABLISHED
| TCPF_CLOSE_WAIT
)) &&
1056 !tcp_passive_fastopen(sk
)) {
1057 if ((err
= sk_stream_wait_connect(sk
, &timeo
)) != 0)
1061 if (unlikely(tp
->repair
)) {
1062 if (tp
->repair_queue
== TCP_RECV_QUEUE
) {
1063 copied
= tcp_send_rcvq(sk
, msg
, size
);
1068 if (tp
->repair_queue
== TCP_NO_QUEUE
)
1071 /* 'common' sending to sendq */
1074 /* This should be in poll */
1075 clear_bit(SOCK_ASYNC_NOSPACE
, &sk
->sk_socket
->flags
);
1077 mss_now
= tcp_send_mss(sk
, &size_goal
, flags
);
1079 /* Ok commence sending. */
1080 iovlen
= msg
->msg_iovlen
;
1085 if (sk
->sk_err
|| (sk
->sk_shutdown
& SEND_SHUTDOWN
))
1088 sg
= !!(sk
->sk_route_caps
& NETIF_F_SG
);
1090 while (--iovlen
>= 0) {
1091 size_t seglen
= iov
->iov_len
;
1092 unsigned char __user
*from
= iov
->iov_base
;
1095 if (unlikely(offset
> 0)) { /* Skip bytes copied in SYN */
1096 if (offset
>= seglen
) {
1105 while (seglen
> 0) {
1107 int max
= size_goal
;
1109 skb
= tcp_write_queue_tail(sk
);
1110 if (tcp_send_head(sk
)) {
1111 if (skb
->ip_summed
== CHECKSUM_NONE
)
1113 copy
= max
- skb
->len
;
1118 /* Allocate new segment. If the interface is SG,
1119 * allocate skb fitting to single page.
1121 if (!sk_stream_memory_free(sk
))
1122 goto wait_for_sndbuf
;
1124 skb
= sk_stream_alloc_skb(sk
,
1125 select_size(sk
, sg
),
1128 goto wait_for_memory
;
1131 * Check whether we can use HW checksum.
1133 if (sk
->sk_route_caps
& NETIF_F_ALL_CSUM
)
1134 skb
->ip_summed
= CHECKSUM_PARTIAL
;
1136 skb_entail(sk
, skb
);
1141 /* Try to append data to the end of skb. */
1145 /* Where to copy to? */
1146 if (skb_availroom(skb
) > 0) {
1147 /* We have some space in skb head. Superb! */
1148 copy
= min_t(int, copy
, skb_availroom(skb
));
1149 err
= skb_add_data_nocache(sk
, skb
, from
, copy
);
1154 int i
= skb_shinfo(skb
)->nr_frags
;
1155 struct page_frag
*pfrag
= sk_page_frag(sk
);
1157 if (!sk_page_frag_refill(sk
, pfrag
))
1158 goto wait_for_memory
;
1160 if (!skb_can_coalesce(skb
, i
, pfrag
->page
,
1162 if (i
== MAX_SKB_FRAGS
|| !sg
) {
1163 tcp_mark_push(tp
, skb
);
1169 copy
= min_t(int, copy
, pfrag
->size
- pfrag
->offset
);
1171 if (!sk_wmem_schedule(sk
, copy
))
1172 goto wait_for_memory
;
1174 err
= skb_copy_to_page_nocache(sk
, from
, skb
,
1181 /* Update the skb. */
1183 skb_frag_size_add(&skb_shinfo(skb
)->frags
[i
- 1], copy
);
1185 skb_fill_page_desc(skb
, i
, pfrag
->page
,
1186 pfrag
->offset
, copy
);
1187 get_page(pfrag
->page
);
1189 pfrag
->offset
+= copy
;
1193 TCP_SKB_CB(skb
)->tcp_flags
&= ~TCPHDR_PSH
;
1195 tp
->write_seq
+= copy
;
1196 TCP_SKB_CB(skb
)->end_seq
+= copy
;
1197 skb_shinfo(skb
)->gso_segs
= 0;
1201 if ((seglen
-= copy
) == 0 && iovlen
== 0)
1204 if (skb
->len
< max
|| (flags
& MSG_OOB
) || unlikely(tp
->repair
))
1207 if (forced_push(tp
)) {
1208 tcp_mark_push(tp
, skb
);
1209 __tcp_push_pending_frames(sk
, mss_now
, TCP_NAGLE_PUSH
);
1210 } else if (skb
== tcp_send_head(sk
))
1211 tcp_push_one(sk
, mss_now
);
1215 set_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
);
1217 if (copied
&& likely(!tp
->repair
))
1218 tcp_push(sk
, flags
& ~MSG_MORE
, mss_now
, TCP_NAGLE_PUSH
);
1220 if ((err
= sk_stream_wait_memory(sk
, &timeo
)) != 0)
1223 mss_now
= tcp_send_mss(sk
, &size_goal
, flags
);
1228 if (copied
&& likely(!tp
->repair
))
1229 tcp_push(sk
, flags
, mss_now
, tp
->nonagle
);
1231 return copied
+ copied_syn
;
1235 tcp_unlink_write_queue(skb
, sk
);
1236 /* It is the one place in all of TCP, except connection
1237 * reset, where we can be unlinking the send_head.
1239 tcp_check_send_head(sk
, skb
);
1240 sk_wmem_free_skb(sk
, skb
);
1244 if (copied
+ copied_syn
)
1247 err
= sk_stream_error(sk
, flags
, err
);
1251 EXPORT_SYMBOL(tcp_sendmsg
);
1254 * Handle reading urgent data. BSD has very simple semantics for
1255 * this, no blocking and very strange errors 8)
1258 static int tcp_recv_urg(struct sock
*sk
, struct msghdr
*msg
, int len
, int flags
)
1260 struct tcp_sock
*tp
= tcp_sk(sk
);
1262 /* No URG data to read. */
1263 if (sock_flag(sk
, SOCK_URGINLINE
) || !tp
->urg_data
||
1264 tp
->urg_data
== TCP_URG_READ
)
1265 return -EINVAL
; /* Yes this is right ! */
1267 if (sk
->sk_state
== TCP_CLOSE
&& !sock_flag(sk
, SOCK_DONE
))
1270 if (tp
->urg_data
& TCP_URG_VALID
) {
1272 char c
= tp
->urg_data
;
1274 if (!(flags
& MSG_PEEK
))
1275 tp
->urg_data
= TCP_URG_READ
;
1277 /* Read urgent data. */
1278 msg
->msg_flags
|= MSG_OOB
;
1281 if (!(flags
& MSG_TRUNC
))
1282 err
= memcpy_toiovec(msg
->msg_iov
, &c
, 1);
1285 msg
->msg_flags
|= MSG_TRUNC
;
1287 return err
? -EFAULT
: len
;
1290 if (sk
->sk_state
== TCP_CLOSE
|| (sk
->sk_shutdown
& RCV_SHUTDOWN
))
1293 /* Fixed the recv(..., MSG_OOB) behaviour. BSD docs and
1294 * the available implementations agree in this case:
1295 * this call should never block, independent of the
1296 * blocking state of the socket.
1297 * Mike <pall@rz.uni-karlsruhe.de>
1302 static int tcp_peek_sndq(struct sock
*sk
, struct msghdr
*msg
, int len
)
1304 struct sk_buff
*skb
;
1305 int copied
= 0, err
= 0;
1307 /* XXX -- need to support SO_PEEK_OFF */
1309 skb_queue_walk(&sk
->sk_write_queue
, skb
) {
1310 err
= skb_copy_datagram_iovec(skb
, 0, msg
->msg_iov
, skb
->len
);
1317 return err
?: copied
;
1320 /* Clean up the receive buffer for full frames taken by the user,
1321 * then send an ACK if necessary. COPIED is the number of bytes
1322 * tcp_recvmsg has given to the user so far, it speeds up the
1323 * calculation of whether or not we must ACK for the sake of
1326 void tcp_cleanup_rbuf(struct sock
*sk
, int copied
)
1328 struct tcp_sock
*tp
= tcp_sk(sk
);
1329 bool time_to_ack
= false;
1331 struct sk_buff
*skb
= skb_peek(&sk
->sk_receive_queue
);
1333 WARN(skb
&& !before(tp
->copied_seq
, TCP_SKB_CB(skb
)->end_seq
),
1334 "cleanup rbuf bug: copied %X seq %X rcvnxt %X\n",
1335 tp
->copied_seq
, TCP_SKB_CB(skb
)->end_seq
, tp
->rcv_nxt
);
1337 if (inet_csk_ack_scheduled(sk
)) {
1338 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
1339 /* Delayed ACKs frequently hit locked sockets during bulk
1341 if (icsk
->icsk_ack
.blocked
||
1342 /* Once-per-two-segments ACK was not sent by tcp_input.c */
1343 tp
->rcv_nxt
- tp
->rcv_wup
> icsk
->icsk_ack
.rcv_mss
||
1345 * If this read emptied read buffer, we send ACK, if
1346 * connection is not bidirectional, user drained
1347 * receive buffer and there was a small segment
1351 ((icsk
->icsk_ack
.pending
& ICSK_ACK_PUSHED2
) ||
1352 ((icsk
->icsk_ack
.pending
& ICSK_ACK_PUSHED
) &&
1353 !icsk
->icsk_ack
.pingpong
)) &&
1354 !atomic_read(&sk
->sk_rmem_alloc
)))
1358 /* We send an ACK if we can now advertise a non-zero window
1359 * which has been raised "significantly".
1361 * Even if window raised up to infinity, do not send window open ACK
1362 * in states, where we will not receive more. It is useless.
1364 if (copied
> 0 && !time_to_ack
&& !(sk
->sk_shutdown
& RCV_SHUTDOWN
)) {
1365 __u32 rcv_window_now
= tcp_receive_window(tp
);
1367 /* Optimize, __tcp_select_window() is not cheap. */
1368 if (2*rcv_window_now
<= tp
->window_clamp
) {
1369 __u32 new_window
= __tcp_select_window(sk
);
1371 /* Send ACK now, if this read freed lots of space
1372 * in our buffer. Certainly, new_window is new window.
1373 * We can advertise it now, if it is not less than current one.
1374 * "Lots" means "at least twice" here.
1376 if (new_window
&& new_window
>= 2 * rcv_window_now
)
1384 static void tcp_prequeue_process(struct sock
*sk
)
1386 struct sk_buff
*skb
;
1387 struct tcp_sock
*tp
= tcp_sk(sk
);
1389 NET_INC_STATS_USER(sock_net(sk
), LINUX_MIB_TCPPREQUEUED
);
1391 /* RX process wants to run with disabled BHs, though it is not
1394 while ((skb
= __skb_dequeue(&tp
->ucopy
.prequeue
)) != NULL
)
1395 sk_backlog_rcv(sk
, skb
);
1398 /* Clear memory counter. */
1399 tp
->ucopy
.memory
= 0;
1402 #ifdef CONFIG_NET_DMA
1403 static void tcp_service_net_dma(struct sock
*sk
, bool wait
)
1405 dma_cookie_t done
, used
;
1406 dma_cookie_t last_issued
;
1407 struct tcp_sock
*tp
= tcp_sk(sk
);
1409 if (!tp
->ucopy
.dma_chan
)
1412 last_issued
= tp
->ucopy
.dma_cookie
;
1413 dma_async_memcpy_issue_pending(tp
->ucopy
.dma_chan
);
1416 if (dma_async_memcpy_complete(tp
->ucopy
.dma_chan
,
1418 &used
) == DMA_SUCCESS
) {
1419 /* Safe to free early-copied skbs now */
1420 __skb_queue_purge(&sk
->sk_async_wait_queue
);
1423 struct sk_buff
*skb
;
1424 while ((skb
= skb_peek(&sk
->sk_async_wait_queue
)) &&
1425 (dma_async_is_complete(skb
->dma_cookie
, done
,
1426 used
) == DMA_SUCCESS
)) {
1427 __skb_dequeue(&sk
->sk_async_wait_queue
);
1435 static inline struct sk_buff
*tcp_recv_skb(struct sock
*sk
, u32 seq
, u32
*off
)
1437 struct sk_buff
*skb
;
1440 skb_queue_walk(&sk
->sk_receive_queue
, skb
) {
1441 offset
= seq
- TCP_SKB_CB(skb
)->seq
;
1442 if (tcp_hdr(skb
)->syn
)
1444 if (offset
< skb
->len
|| tcp_hdr(skb
)->fin
) {
1453 * This routine provides an alternative to tcp_recvmsg() for routines
1454 * that would like to handle copying from skbuffs directly in 'sendfile'
1457 * - It is assumed that the socket was locked by the caller.
1458 * - The routine does not block.
1459 * - At present, there is no support for reading OOB data
1460 * or for 'peeking' the socket using this routine
1461 * (although both would be easy to implement).
1463 int tcp_read_sock(struct sock
*sk
, read_descriptor_t
*desc
,
1464 sk_read_actor_t recv_actor
)
1466 struct sk_buff
*skb
;
1467 struct tcp_sock
*tp
= tcp_sk(sk
);
1468 u32 seq
= tp
->copied_seq
;
1472 if (sk
->sk_state
== TCP_LISTEN
)
1474 while ((skb
= tcp_recv_skb(sk
, seq
, &offset
)) != NULL
) {
1475 if (offset
< skb
->len
) {
1479 len
= skb
->len
- offset
;
1480 /* Stop reading if we hit a patch of urgent data */
1482 u32 urg_offset
= tp
->urg_seq
- seq
;
1483 if (urg_offset
< len
)
1488 used
= recv_actor(desc
, skb
, offset
, len
);
1493 } else if (used
<= len
) {
1499 * If recv_actor drops the lock (e.g. TCP splice
1500 * receive) the skb pointer might be invalid when
1501 * getting here: tcp_collapse might have deleted it
1502 * while aggregating skbs from the socket queue.
1504 skb
= tcp_recv_skb(sk
, seq
-1, &offset
);
1505 if (!skb
|| (offset
+1 != skb
->len
))
1508 if (tcp_hdr(skb
)->fin
) {
1509 sk_eat_skb(sk
, skb
, false);
1513 sk_eat_skb(sk
, skb
, false);
1516 tp
->copied_seq
= seq
;
1518 tp
->copied_seq
= seq
;
1520 tcp_rcv_space_adjust(sk
);
1522 /* Clean up data we have read: This will do ACK frames. */
1524 tcp_cleanup_rbuf(sk
, copied
);
1527 EXPORT_SYMBOL(tcp_read_sock
);
1530 * This routine copies from a sock struct into the user buffer.
1532 * Technical note: in 2.3 we work on _locked_ socket, so that
1533 * tricks with *seq access order and skb->users are not required.
1534 * Probably, code can be easily improved even more.
1537 int tcp_recvmsg(struct kiocb
*iocb
, struct sock
*sk
, struct msghdr
*msg
,
1538 size_t len
, int nonblock
, int flags
, int *addr_len
)
1540 struct tcp_sock
*tp
= tcp_sk(sk
);
1546 int target
; /* Read at least this many bytes */
1548 struct task_struct
*user_recv
= NULL
;
1549 bool copied_early
= false;
1550 struct sk_buff
*skb
;
1556 if (sk
->sk_state
== TCP_LISTEN
)
1559 timeo
= sock_rcvtimeo(sk
, nonblock
);
1561 /* Urgent data needs to be handled specially. */
1562 if (flags
& MSG_OOB
)
1565 if (unlikely(tp
->repair
)) {
1567 if (!(flags
& MSG_PEEK
))
1570 if (tp
->repair_queue
== TCP_SEND_QUEUE
)
1574 if (tp
->repair_queue
== TCP_NO_QUEUE
)
1577 /* 'common' recv queue MSG_PEEK-ing */
1580 seq
= &tp
->copied_seq
;
1581 if (flags
& MSG_PEEK
) {
1582 peek_seq
= tp
->copied_seq
;
1586 target
= sock_rcvlowat(sk
, flags
& MSG_WAITALL
, len
);
1588 #ifdef CONFIG_NET_DMA
1589 tp
->ucopy
.dma_chan
= NULL
;
1591 skb
= skb_peek_tail(&sk
->sk_receive_queue
);
1596 available
= TCP_SKB_CB(skb
)->seq
+ skb
->len
- (*seq
);
1597 if ((available
< target
) &&
1598 (len
> sysctl_tcp_dma_copybreak
) && !(flags
& MSG_PEEK
) &&
1599 !sysctl_tcp_low_latency
&&
1600 net_dma_find_channel()) {
1601 preempt_enable_no_resched();
1602 tp
->ucopy
.pinned_list
=
1603 dma_pin_iovec_pages(msg
->msg_iov
, len
);
1605 preempt_enable_no_resched();
1613 /* Are we at urgent data? Stop if we have read anything or have SIGURG pending. */
1614 if (tp
->urg_data
&& tp
->urg_seq
== *seq
) {
1617 if (signal_pending(current
)) {
1618 copied
= timeo
? sock_intr_errno(timeo
) : -EAGAIN
;
1623 /* Next get a buffer. */
1625 skb_queue_walk(&sk
->sk_receive_queue
, skb
) {
1626 /* Now that we have two receive queues this
1629 if (WARN(before(*seq
, TCP_SKB_CB(skb
)->seq
),
1630 "recvmsg bug: copied %X seq %X rcvnxt %X fl %X\n",
1631 *seq
, TCP_SKB_CB(skb
)->seq
, tp
->rcv_nxt
,
1635 offset
= *seq
- TCP_SKB_CB(skb
)->seq
;
1636 if (tcp_hdr(skb
)->syn
)
1638 if (offset
< skb
->len
)
1640 if (tcp_hdr(skb
)->fin
)
1642 WARN(!(flags
& MSG_PEEK
),
1643 "recvmsg bug 2: copied %X seq %X rcvnxt %X fl %X\n",
1644 *seq
, TCP_SKB_CB(skb
)->seq
, tp
->rcv_nxt
, flags
);
1647 /* Well, if we have backlog, try to process it now yet. */
1649 if (copied
>= target
&& !sk
->sk_backlog
.tail
)
1654 sk
->sk_state
== TCP_CLOSE
||
1655 (sk
->sk_shutdown
& RCV_SHUTDOWN
) ||
1657 signal_pending(current
))
1660 if (sock_flag(sk
, SOCK_DONE
))
1664 copied
= sock_error(sk
);
1668 if (sk
->sk_shutdown
& RCV_SHUTDOWN
)
1671 if (sk
->sk_state
== TCP_CLOSE
) {
1672 if (!sock_flag(sk
, SOCK_DONE
)) {
1673 /* This occurs when user tries to read
1674 * from never connected socket.
1687 if (signal_pending(current
)) {
1688 copied
= sock_intr_errno(timeo
);
1693 tcp_cleanup_rbuf(sk
, copied
);
1695 if (!sysctl_tcp_low_latency
&& tp
->ucopy
.task
== user_recv
) {
1696 /* Install new reader */
1697 if (!user_recv
&& !(flags
& (MSG_TRUNC
| MSG_PEEK
))) {
1698 user_recv
= current
;
1699 tp
->ucopy
.task
= user_recv
;
1700 tp
->ucopy
.iov
= msg
->msg_iov
;
1703 tp
->ucopy
.len
= len
;
1705 WARN_ON(tp
->copied_seq
!= tp
->rcv_nxt
&&
1706 !(flags
& (MSG_PEEK
| MSG_TRUNC
)));
1708 /* Ugly... If prequeue is not empty, we have to
1709 * process it before releasing socket, otherwise
1710 * order will be broken at second iteration.
1711 * More elegant solution is required!!!
1713 * Look: we have the following (pseudo)queues:
1715 * 1. packets in flight
1720 * Each queue can be processed only if the next ones
1721 * are empty. At this point we have empty receive_queue.
1722 * But prequeue _can_ be not empty after 2nd iteration,
1723 * when we jumped to start of loop because backlog
1724 * processing added something to receive_queue.
1725 * We cannot release_sock(), because backlog contains
1726 * packets arrived _after_ prequeued ones.
1728 * Shortly, algorithm is clear --- to process all
1729 * the queues in order. We could make it more directly,
1730 * requeueing packets from backlog to prequeue, if
1731 * is not empty. It is more elegant, but eats cycles,
1734 if (!skb_queue_empty(&tp
->ucopy
.prequeue
))
1737 /* __ Set realtime policy in scheduler __ */
1740 #ifdef CONFIG_NET_DMA
1741 if (tp
->ucopy
.dma_chan
)
1742 dma_async_memcpy_issue_pending(tp
->ucopy
.dma_chan
);
1744 if (copied
>= target
) {
1745 /* Do not sleep, just process backlog. */
1749 sk_wait_data(sk
, &timeo
);
1751 #ifdef CONFIG_NET_DMA
1752 tcp_service_net_dma(sk
, false); /* Don't block */
1753 tp
->ucopy
.wakeup
= 0;
1759 /* __ Restore normal policy in scheduler __ */
1761 if ((chunk
= len
- tp
->ucopy
.len
) != 0) {
1762 NET_ADD_STATS_USER(sock_net(sk
), LINUX_MIB_TCPDIRECTCOPYFROMBACKLOG
, chunk
);
1767 if (tp
->rcv_nxt
== tp
->copied_seq
&&
1768 !skb_queue_empty(&tp
->ucopy
.prequeue
)) {
1770 tcp_prequeue_process(sk
);
1772 if ((chunk
= len
- tp
->ucopy
.len
) != 0) {
1773 NET_ADD_STATS_USER(sock_net(sk
), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE
, chunk
);
1779 if ((flags
& MSG_PEEK
) &&
1780 (peek_seq
- copied
- urg_hole
!= tp
->copied_seq
)) {
1781 net_dbg_ratelimited("TCP(%s:%d): Application bug, race in MSG_PEEK\n",
1783 task_pid_nr(current
));
1784 peek_seq
= tp
->copied_seq
;
1789 /* Ok so how much can we use? */
1790 used
= skb
->len
- offset
;
1794 /* Do we have urgent data here? */
1796 u32 urg_offset
= tp
->urg_seq
- *seq
;
1797 if (urg_offset
< used
) {
1799 if (!sock_flag(sk
, SOCK_URGINLINE
)) {
1812 if (!(flags
& MSG_TRUNC
)) {
1813 #ifdef CONFIG_NET_DMA
1814 if (!tp
->ucopy
.dma_chan
&& tp
->ucopy
.pinned_list
)
1815 tp
->ucopy
.dma_chan
= net_dma_find_channel();
1817 if (tp
->ucopy
.dma_chan
) {
1818 tp
->ucopy
.dma_cookie
= dma_skb_copy_datagram_iovec(
1819 tp
->ucopy
.dma_chan
, skb
, offset
,
1821 tp
->ucopy
.pinned_list
);
1823 if (tp
->ucopy
.dma_cookie
< 0) {
1825 pr_alert("%s: dma_cookie < 0\n",
1828 /* Exception. Bailout! */
1834 dma_async_memcpy_issue_pending(tp
->ucopy
.dma_chan
);
1836 if ((offset
+ used
) == skb
->len
)
1837 copied_early
= true;
1842 err
= skb_copy_datagram_iovec(skb
, offset
,
1843 msg
->msg_iov
, used
);
1845 /* Exception. Bailout! */
1857 tcp_rcv_space_adjust(sk
);
1860 if (tp
->urg_data
&& after(tp
->copied_seq
, tp
->urg_seq
)) {
1862 tcp_fast_path_check(sk
);
1864 if (used
+ offset
< skb
->len
)
1867 if (tcp_hdr(skb
)->fin
)
1869 if (!(flags
& MSG_PEEK
)) {
1870 sk_eat_skb(sk
, skb
, copied_early
);
1871 copied_early
= false;
1876 /* Process the FIN. */
1878 if (!(flags
& MSG_PEEK
)) {
1879 sk_eat_skb(sk
, skb
, copied_early
);
1880 copied_early
= false;
1886 if (!skb_queue_empty(&tp
->ucopy
.prequeue
)) {
1889 tp
->ucopy
.len
= copied
> 0 ? len
: 0;
1891 tcp_prequeue_process(sk
);
1893 if (copied
> 0 && (chunk
= len
- tp
->ucopy
.len
) != 0) {
1894 NET_ADD_STATS_USER(sock_net(sk
), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE
, chunk
);
1900 tp
->ucopy
.task
= NULL
;
1904 #ifdef CONFIG_NET_DMA
1905 tcp_service_net_dma(sk
, true); /* Wait for queue to drain */
1906 tp
->ucopy
.dma_chan
= NULL
;
1908 if (tp
->ucopy
.pinned_list
) {
1909 dma_unpin_iovec_pages(tp
->ucopy
.pinned_list
);
1910 tp
->ucopy
.pinned_list
= NULL
;
1914 /* According to UNIX98, msg_name/msg_namelen are ignored
1915 * on connected socket. I was just happy when found this 8) --ANK
1918 /* Clean up data we have read: This will do ACK frames. */
1919 tcp_cleanup_rbuf(sk
, copied
);
1929 err
= tcp_recv_urg(sk
, msg
, len
, flags
);
1933 err
= tcp_peek_sndq(sk
, msg
, len
);
1936 EXPORT_SYMBOL(tcp_recvmsg
);
1938 void tcp_set_state(struct sock
*sk
, int state
)
1940 int oldstate
= sk
->sk_state
;
1943 case TCP_ESTABLISHED
:
1944 if (oldstate
!= TCP_ESTABLISHED
)
1945 TCP_INC_STATS(sock_net(sk
), TCP_MIB_CURRESTAB
);
1949 if (oldstate
== TCP_CLOSE_WAIT
|| oldstate
== TCP_ESTABLISHED
)
1950 TCP_INC_STATS(sock_net(sk
), TCP_MIB_ESTABRESETS
);
1952 sk
->sk_prot
->unhash(sk
);
1953 if (inet_csk(sk
)->icsk_bind_hash
&&
1954 !(sk
->sk_userlocks
& SOCK_BINDPORT_LOCK
))
1958 if (oldstate
== TCP_ESTABLISHED
)
1959 TCP_DEC_STATS(sock_net(sk
), TCP_MIB_CURRESTAB
);
1962 /* Change state AFTER socket is unhashed to avoid closed
1963 * socket sitting in hash tables.
1965 sk
->sk_state
= state
;
1968 SOCK_DEBUG(sk
, "TCP sk=%p, State %s -> %s\n", sk
, statename
[oldstate
], statename
[state
]);
1971 EXPORT_SYMBOL_GPL(tcp_set_state
);
1974 * State processing on a close. This implements the state shift for
1975 * sending our FIN frame. Note that we only send a FIN for some
1976 * states. A shutdown() may have already sent the FIN, or we may be
1980 static const unsigned char new_state
[16] = {
1981 /* current state: new state: action: */
1982 /* (Invalid) */ TCP_CLOSE
,
1983 /* TCP_ESTABLISHED */ TCP_FIN_WAIT1
| TCP_ACTION_FIN
,
1984 /* TCP_SYN_SENT */ TCP_CLOSE
,
1985 /* TCP_SYN_RECV */ TCP_FIN_WAIT1
| TCP_ACTION_FIN
,
1986 /* TCP_FIN_WAIT1 */ TCP_FIN_WAIT1
,
1987 /* TCP_FIN_WAIT2 */ TCP_FIN_WAIT2
,
1988 /* TCP_TIME_WAIT */ TCP_CLOSE
,
1989 /* TCP_CLOSE */ TCP_CLOSE
,
1990 /* TCP_CLOSE_WAIT */ TCP_LAST_ACK
| TCP_ACTION_FIN
,
1991 /* TCP_LAST_ACK */ TCP_LAST_ACK
,
1992 /* TCP_LISTEN */ TCP_CLOSE
,
1993 /* TCP_CLOSING */ TCP_CLOSING
,
1996 static int tcp_close_state(struct sock
*sk
)
1998 int next
= (int)new_state
[sk
->sk_state
];
1999 int ns
= next
& TCP_STATE_MASK
;
2001 tcp_set_state(sk
, ns
);
2003 return next
& TCP_ACTION_FIN
;
2007 * Shutdown the sending side of a connection. Much like close except
2008 * that we don't receive shut down or sock_set_flag(sk, SOCK_DEAD).
2011 void tcp_shutdown(struct sock
*sk
, int how
)
2013 /* We need to grab some memory, and put together a FIN,
2014 * and then put it into the queue to be sent.
2015 * Tim MacKenzie(tym@dibbler.cs.monash.edu.au) 4 Dec '92.
2017 if (!(how
& SEND_SHUTDOWN
))
2020 /* If we've already sent a FIN, or it's a closed state, skip this. */
2021 if ((1 << sk
->sk_state
) &
2022 (TCPF_ESTABLISHED
| TCPF_SYN_SENT
|
2023 TCPF_SYN_RECV
| TCPF_CLOSE_WAIT
)) {
2024 /* Clear out any half completed packets. FIN if needed. */
2025 if (tcp_close_state(sk
))
2029 EXPORT_SYMBOL(tcp_shutdown
);
2031 bool tcp_check_oom(struct sock
*sk
, int shift
)
2033 bool too_many_orphans
, out_of_socket_memory
;
2035 too_many_orphans
= tcp_too_many_orphans(sk
, shift
);
2036 out_of_socket_memory
= tcp_out_of_memory(sk
);
2038 if (too_many_orphans
)
2039 net_info_ratelimited("too many orphaned sockets\n");
2040 if (out_of_socket_memory
)
2041 net_info_ratelimited("out of memory -- consider tuning tcp_mem\n");
2042 return too_many_orphans
|| out_of_socket_memory
;
2045 void tcp_close(struct sock
*sk
, long timeout
)
2047 struct sk_buff
*skb
;
2048 int data_was_unread
= 0;
2052 sk
->sk_shutdown
= SHUTDOWN_MASK
;
2054 if (sk
->sk_state
== TCP_LISTEN
) {
2055 tcp_set_state(sk
, TCP_CLOSE
);
2058 inet_csk_listen_stop(sk
);
2060 goto adjudge_to_death
;
2063 /* We need to flush the recv. buffs. We do this only on the
2064 * descriptor close, not protocol-sourced closes, because the
2065 * reader process may not have drained the data yet!
2067 while ((skb
= __skb_dequeue(&sk
->sk_receive_queue
)) != NULL
) {
2068 u32 len
= TCP_SKB_CB(skb
)->end_seq
- TCP_SKB_CB(skb
)->seq
-
2070 data_was_unread
+= len
;
2076 /* If socket has been already reset (e.g. in tcp_reset()) - kill it. */
2077 if (sk
->sk_state
== TCP_CLOSE
)
2078 goto adjudge_to_death
;
2080 /* As outlined in RFC 2525, section 2.17, we send a RST here because
2081 * data was lost. To witness the awful effects of the old behavior of
2082 * always doing a FIN, run an older 2.1.x kernel or 2.0.x, start a bulk
2083 * GET in an FTP client, suspend the process, wait for the client to
2084 * advertise a zero window, then kill -9 the FTP client, wheee...
2085 * Note: timeout is always zero in such a case.
2087 if (unlikely(tcp_sk(sk
)->repair
)) {
2088 sk
->sk_prot
->disconnect(sk
, 0);
2089 } else if (data_was_unread
) {
2090 /* Unread data was tossed, zap the connection. */
2091 NET_INC_STATS_USER(sock_net(sk
), LINUX_MIB_TCPABORTONCLOSE
);
2092 tcp_set_state(sk
, TCP_CLOSE
);
2093 tcp_send_active_reset(sk
, sk
->sk_allocation
);
2094 } else if (sock_flag(sk
, SOCK_LINGER
) && !sk
->sk_lingertime
) {
2095 /* Check zero linger _after_ checking for unread data. */
2096 sk
->sk_prot
->disconnect(sk
, 0);
2097 NET_INC_STATS_USER(sock_net(sk
), LINUX_MIB_TCPABORTONDATA
);
2098 } else if (tcp_close_state(sk
)) {
2099 /* We FIN if the application ate all the data before
2100 * zapping the connection.
2103 /* RED-PEN. Formally speaking, we have broken TCP state
2104 * machine. State transitions:
2106 * TCP_ESTABLISHED -> TCP_FIN_WAIT1
2107 * TCP_SYN_RECV -> TCP_FIN_WAIT1 (forget it, it's impossible)
2108 * TCP_CLOSE_WAIT -> TCP_LAST_ACK
2110 * are legal only when FIN has been sent (i.e. in window),
2111 * rather than queued out of window. Purists blame.
2113 * F.e. "RFC state" is ESTABLISHED,
2114 * if Linux state is FIN-WAIT-1, but FIN is still not sent.
2116 * The visible declinations are that sometimes
2117 * we enter time-wait state, when it is not required really
2118 * (harmless), do not send active resets, when they are
2119 * required by specs (TCP_ESTABLISHED, TCP_CLOSE_WAIT, when
2120 * they look as CLOSING or LAST_ACK for Linux)
2121 * Probably, I missed some more holelets.
2123 * XXX (TFO) - To start off we don't support SYN+ACK+FIN
2124 * in a single packet! (May consider it later but will
2125 * probably need API support or TCP_CORK SYN-ACK until
2126 * data is written and socket is closed.)
2131 sk_stream_wait_close(sk
, timeout
);
2134 state
= sk
->sk_state
;
2138 /* It is the last release_sock in its life. It will remove backlog. */
2142 /* Now socket is owned by kernel and we acquire BH lock
2143 to finish close. No need to check for user refs.
2147 WARN_ON(sock_owned_by_user(sk
));
2149 percpu_counter_inc(sk
->sk_prot
->orphan_count
);
2151 /* Have we already been destroyed by a softirq or backlog? */
2152 if (state
!= TCP_CLOSE
&& sk
->sk_state
== TCP_CLOSE
)
2155 /* This is a (useful) BSD violating of the RFC. There is a
2156 * problem with TCP as specified in that the other end could
2157 * keep a socket open forever with no application left this end.
2158 * We use a 3 minute timeout (about the same as BSD) then kill
2159 * our end. If they send after that then tough - BUT: long enough
2160 * that we won't make the old 4*rto = almost no time - whoops
2163 * Nope, it was not mistake. It is really desired behaviour
2164 * f.e. on http servers, when such sockets are useless, but
2165 * consume significant resources. Let's do it with special
2166 * linger2 option. --ANK
2169 if (sk
->sk_state
== TCP_FIN_WAIT2
) {
2170 struct tcp_sock
*tp
= tcp_sk(sk
);
2171 if (tp
->linger2
< 0) {
2172 tcp_set_state(sk
, TCP_CLOSE
);
2173 tcp_send_active_reset(sk
, GFP_ATOMIC
);
2174 NET_INC_STATS_BH(sock_net(sk
),
2175 LINUX_MIB_TCPABORTONLINGER
);
2177 const int tmo
= tcp_fin_time(sk
);
2179 if (tmo
> TCP_TIMEWAIT_LEN
) {
2180 inet_csk_reset_keepalive_timer(sk
,
2181 tmo
- TCP_TIMEWAIT_LEN
);
2183 tcp_time_wait(sk
, TCP_FIN_WAIT2
, tmo
);
2188 if (sk
->sk_state
!= TCP_CLOSE
) {
2190 if (tcp_check_oom(sk
, 0)) {
2191 tcp_set_state(sk
, TCP_CLOSE
);
2192 tcp_send_active_reset(sk
, GFP_ATOMIC
);
2193 NET_INC_STATS_BH(sock_net(sk
),
2194 LINUX_MIB_TCPABORTONMEMORY
);
2198 if (sk
->sk_state
== TCP_CLOSE
) {
2199 struct request_sock
*req
= tcp_sk(sk
)->fastopen_rsk
;
2200 /* We could get here with a non-NULL req if the socket is
2201 * aborted (e.g., closed with unread data) before 3WHS
2205 reqsk_fastopen_remove(sk
, req
, false);
2206 inet_csk_destroy_sock(sk
);
2208 /* Otherwise, socket is reprieved until protocol close. */
2215 EXPORT_SYMBOL(tcp_close
);
2217 /* These states need RST on ABORT according to RFC793 */
2219 static inline bool tcp_need_reset(int state
)
2221 return (1 << state
) &
2222 (TCPF_ESTABLISHED
| TCPF_CLOSE_WAIT
| TCPF_FIN_WAIT1
|
2223 TCPF_FIN_WAIT2
| TCPF_SYN_RECV
);
2226 int tcp_disconnect(struct sock
*sk
, int flags
)
2228 struct inet_sock
*inet
= inet_sk(sk
);
2229 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2230 struct tcp_sock
*tp
= tcp_sk(sk
);
2232 int old_state
= sk
->sk_state
;
2234 if (old_state
!= TCP_CLOSE
)
2235 tcp_set_state(sk
, TCP_CLOSE
);
2237 /* ABORT function of RFC793 */
2238 if (old_state
== TCP_LISTEN
) {
2239 inet_csk_listen_stop(sk
);
2240 } else if (unlikely(tp
->repair
)) {
2241 sk
->sk_err
= ECONNABORTED
;
2242 } else if (tcp_need_reset(old_state
) ||
2243 (tp
->snd_nxt
!= tp
->write_seq
&&
2244 (1 << old_state
) & (TCPF_CLOSING
| TCPF_LAST_ACK
))) {
2245 /* The last check adjusts for discrepancy of Linux wrt. RFC
2248 tcp_send_active_reset(sk
, gfp_any());
2249 sk
->sk_err
= ECONNRESET
;
2250 } else if (old_state
== TCP_SYN_SENT
)
2251 sk
->sk_err
= ECONNRESET
;
2253 tcp_clear_xmit_timers(sk
);
2254 __skb_queue_purge(&sk
->sk_receive_queue
);
2255 tcp_write_queue_purge(sk
);
2256 __skb_queue_purge(&tp
->out_of_order_queue
);
2257 #ifdef CONFIG_NET_DMA
2258 __skb_queue_purge(&sk
->sk_async_wait_queue
);
2261 inet
->inet_dport
= 0;
2263 if (!(sk
->sk_userlocks
& SOCK_BINDADDR_LOCK
))
2264 inet_reset_saddr(sk
);
2266 sk
->sk_shutdown
= 0;
2267 sock_reset_flag(sk
, SOCK_DONE
);
2269 if ((tp
->write_seq
+= tp
->max_window
+ 2) == 0)
2271 icsk
->icsk_backoff
= 0;
2273 icsk
->icsk_probes_out
= 0;
2274 tp
->packets_out
= 0;
2275 tp
->snd_ssthresh
= TCP_INFINITE_SSTHRESH
;
2276 tp
->snd_cwnd_cnt
= 0;
2277 tp
->bytes_acked
= 0;
2278 tp
->window_clamp
= 0;
2279 tcp_set_ca_state(sk
, TCP_CA_Open
);
2280 tcp_clear_retrans(tp
);
2281 inet_csk_delack_init(sk
);
2282 tcp_init_send_head(sk
);
2283 memset(&tp
->rx_opt
, 0, sizeof(tp
->rx_opt
));
2286 WARN_ON(inet
->inet_num
&& !icsk
->icsk_bind_hash
);
2288 sk
->sk_error_report(sk
);
2291 EXPORT_SYMBOL(tcp_disconnect
);
2293 void tcp_sock_destruct(struct sock
*sk
)
2295 inet_sock_destruct(sk
);
2297 kfree(inet_csk(sk
)->icsk_accept_queue
.fastopenq
);
2300 static inline bool tcp_can_repair_sock(const struct sock
*sk
)
2302 return capable(CAP_NET_ADMIN
) &&
2303 ((1 << sk
->sk_state
) & (TCPF_CLOSE
| TCPF_ESTABLISHED
));
2306 static int tcp_repair_options_est(struct tcp_sock
*tp
,
2307 struct tcp_repair_opt __user
*optbuf
, unsigned int len
)
2309 struct tcp_repair_opt opt
;
2311 while (len
>= sizeof(opt
)) {
2312 if (copy_from_user(&opt
, optbuf
, sizeof(opt
)))
2318 switch (opt
.opt_code
) {
2320 tp
->rx_opt
.mss_clamp
= opt
.opt_val
;
2323 if (opt
.opt_val
> 14)
2326 tp
->rx_opt
.snd_wscale
= opt
.opt_val
;
2328 case TCPOPT_SACK_PERM
:
2329 if (opt
.opt_val
!= 0)
2332 tp
->rx_opt
.sack_ok
|= TCP_SACK_SEEN
;
2333 if (sysctl_tcp_fack
)
2334 tcp_enable_fack(tp
);
2336 case TCPOPT_TIMESTAMP
:
2337 if (opt
.opt_val
!= 0)
2340 tp
->rx_opt
.tstamp_ok
= 1;
2349 * Socket option code for TCP.
2351 static int do_tcp_setsockopt(struct sock
*sk
, int level
,
2352 int optname
, char __user
*optval
, unsigned int optlen
)
2354 struct tcp_sock
*tp
= tcp_sk(sk
);
2355 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2359 /* These are data/string values, all the others are ints */
2361 case TCP_CONGESTION
: {
2362 char name
[TCP_CA_NAME_MAX
];
2367 val
= strncpy_from_user(name
, optval
,
2368 min_t(long, TCP_CA_NAME_MAX
-1, optlen
));
2374 err
= tcp_set_congestion_control(sk
, name
);
2378 case TCP_COOKIE_TRANSACTIONS
: {
2379 struct tcp_cookie_transactions ctd
;
2380 struct tcp_cookie_values
*cvp
= NULL
;
2382 if (sizeof(ctd
) > optlen
)
2384 if (copy_from_user(&ctd
, optval
, sizeof(ctd
)))
2387 if (ctd
.tcpct_used
> sizeof(ctd
.tcpct_value
) ||
2388 ctd
.tcpct_s_data_desired
> TCP_MSS_DESIRED
)
2391 if (ctd
.tcpct_cookie_desired
== 0) {
2392 /* default to global value */
2393 } else if ((0x1 & ctd
.tcpct_cookie_desired
) ||
2394 ctd
.tcpct_cookie_desired
> TCP_COOKIE_MAX
||
2395 ctd
.tcpct_cookie_desired
< TCP_COOKIE_MIN
) {
2399 if (TCP_COOKIE_OUT_NEVER
& ctd
.tcpct_flags
) {
2400 /* Supercedes all other values */
2402 if (tp
->cookie_values
!= NULL
) {
2403 kref_put(&tp
->cookie_values
->kref
,
2404 tcp_cookie_values_release
);
2405 tp
->cookie_values
= NULL
;
2407 tp
->rx_opt
.cookie_in_always
= 0; /* false */
2408 tp
->rx_opt
.cookie_out_never
= 1; /* true */
2413 /* Allocate ancillary memory before locking.
2415 if (ctd
.tcpct_used
> 0 ||
2416 (tp
->cookie_values
== NULL
&&
2417 (sysctl_tcp_cookie_size
> 0 ||
2418 ctd
.tcpct_cookie_desired
> 0 ||
2419 ctd
.tcpct_s_data_desired
> 0))) {
2420 cvp
= kzalloc(sizeof(*cvp
) + ctd
.tcpct_used
,
2425 kref_init(&cvp
->kref
);
2428 tp
->rx_opt
.cookie_in_always
=
2429 (TCP_COOKIE_IN_ALWAYS
& ctd
.tcpct_flags
);
2430 tp
->rx_opt
.cookie_out_never
= 0; /* false */
2432 if (tp
->cookie_values
!= NULL
) {
2434 /* Changed values are recorded by a changed
2435 * pointer, ensuring the cookie will differ,
2436 * without separately hashing each value later.
2438 kref_put(&tp
->cookie_values
->kref
,
2439 tcp_cookie_values_release
);
2441 cvp
= tp
->cookie_values
;
2446 cvp
->cookie_desired
= ctd
.tcpct_cookie_desired
;
2448 if (ctd
.tcpct_used
> 0) {
2449 memcpy(cvp
->s_data_payload
, ctd
.tcpct_value
,
2451 cvp
->s_data_desired
= ctd
.tcpct_used
;
2452 cvp
->s_data_constant
= 1; /* true */
2454 /* No constant payload data. */
2455 cvp
->s_data_desired
= ctd
.tcpct_s_data_desired
;
2456 cvp
->s_data_constant
= 0; /* false */
2459 tp
->cookie_values
= cvp
;
2469 if (optlen
< sizeof(int))
2472 if (get_user(val
, (int __user
*)optval
))
2479 /* Values greater than interface MTU won't take effect. However
2480 * at the point when this call is done we typically don't yet
2481 * know which interface is going to be used */
2482 if (val
< TCP_MIN_MSS
|| val
> MAX_TCP_WINDOW
) {
2486 tp
->rx_opt
.user_mss
= val
;
2491 /* TCP_NODELAY is weaker than TCP_CORK, so that
2492 * this option on corked socket is remembered, but
2493 * it is not activated until cork is cleared.
2495 * However, when TCP_NODELAY is set we make
2496 * an explicit push, which overrides even TCP_CORK
2497 * for currently queued segments.
2499 tp
->nonagle
|= TCP_NAGLE_OFF
|TCP_NAGLE_PUSH
;
2500 tcp_push_pending_frames(sk
);
2502 tp
->nonagle
&= ~TCP_NAGLE_OFF
;
2506 case TCP_THIN_LINEAR_TIMEOUTS
:
2507 if (val
< 0 || val
> 1)
2513 case TCP_THIN_DUPACK
:
2514 if (val
< 0 || val
> 1)
2517 tp
->thin_dupack
= val
;
2518 if (tp
->thin_dupack
)
2519 tcp_disable_early_retrans(tp
);
2523 if (!tcp_can_repair_sock(sk
))
2525 else if (val
== 1) {
2527 sk
->sk_reuse
= SK_FORCE_REUSE
;
2528 tp
->repair_queue
= TCP_NO_QUEUE
;
2529 } else if (val
== 0) {
2531 sk
->sk_reuse
= SK_NO_REUSE
;
2532 tcp_send_window_probe(sk
);
2538 case TCP_REPAIR_QUEUE
:
2541 else if (val
< TCP_QUEUES_NR
)
2542 tp
->repair_queue
= val
;
2548 if (sk
->sk_state
!= TCP_CLOSE
)
2550 else if (tp
->repair_queue
== TCP_SEND_QUEUE
)
2551 tp
->write_seq
= val
;
2552 else if (tp
->repair_queue
== TCP_RECV_QUEUE
)
2558 case TCP_REPAIR_OPTIONS
:
2561 else if (sk
->sk_state
== TCP_ESTABLISHED
)
2562 err
= tcp_repair_options_est(tp
,
2563 (struct tcp_repair_opt __user
*)optval
,
2570 /* When set indicates to always queue non-full frames.
2571 * Later the user clears this option and we transmit
2572 * any pending partial frames in the queue. This is
2573 * meant to be used alongside sendfile() to get properly
2574 * filled frames when the user (for example) must write
2575 * out headers with a write() call first and then use
2576 * sendfile to send out the data parts.
2578 * TCP_CORK can be set together with TCP_NODELAY and it is
2579 * stronger than TCP_NODELAY.
2582 tp
->nonagle
|= TCP_NAGLE_CORK
;
2584 tp
->nonagle
&= ~TCP_NAGLE_CORK
;
2585 if (tp
->nonagle
&TCP_NAGLE_OFF
)
2586 tp
->nonagle
|= TCP_NAGLE_PUSH
;
2587 tcp_push_pending_frames(sk
);
2592 if (val
< 1 || val
> MAX_TCP_KEEPIDLE
)
2595 tp
->keepalive_time
= val
* HZ
;
2596 if (sock_flag(sk
, SOCK_KEEPOPEN
) &&
2597 !((1 << sk
->sk_state
) &
2598 (TCPF_CLOSE
| TCPF_LISTEN
))) {
2599 u32 elapsed
= keepalive_time_elapsed(tp
);
2600 if (tp
->keepalive_time
> elapsed
)
2601 elapsed
= tp
->keepalive_time
- elapsed
;
2604 inet_csk_reset_keepalive_timer(sk
, elapsed
);
2609 if (val
< 1 || val
> MAX_TCP_KEEPINTVL
)
2612 tp
->keepalive_intvl
= val
* HZ
;
2615 if (val
< 1 || val
> MAX_TCP_KEEPCNT
)
2618 tp
->keepalive_probes
= val
;
2621 if (val
< 1 || val
> MAX_TCP_SYNCNT
)
2624 icsk
->icsk_syn_retries
= val
;
2630 else if (val
> sysctl_tcp_fin_timeout
/ HZ
)
2633 tp
->linger2
= val
* HZ
;
2636 case TCP_DEFER_ACCEPT
:
2637 /* Translate value in seconds to number of retransmits */
2638 icsk
->icsk_accept_queue
.rskq_defer_accept
=
2639 secs_to_retrans(val
, TCP_TIMEOUT_INIT
/ HZ
,
2643 case TCP_WINDOW_CLAMP
:
2645 if (sk
->sk_state
!= TCP_CLOSE
) {
2649 tp
->window_clamp
= 0;
2651 tp
->window_clamp
= val
< SOCK_MIN_RCVBUF
/ 2 ?
2652 SOCK_MIN_RCVBUF
/ 2 : val
;
2657 icsk
->icsk_ack
.pingpong
= 1;
2659 icsk
->icsk_ack
.pingpong
= 0;
2660 if ((1 << sk
->sk_state
) &
2661 (TCPF_ESTABLISHED
| TCPF_CLOSE_WAIT
) &&
2662 inet_csk_ack_scheduled(sk
)) {
2663 icsk
->icsk_ack
.pending
|= ICSK_ACK_PUSHED
;
2664 tcp_cleanup_rbuf(sk
, 1);
2666 icsk
->icsk_ack
.pingpong
= 1;
2671 #ifdef CONFIG_TCP_MD5SIG
2673 /* Read the IP->Key mappings from userspace */
2674 err
= tp
->af_specific
->md5_parse(sk
, optval
, optlen
);
2677 case TCP_USER_TIMEOUT
:
2678 /* Cap the max timeout in ms TCP will retry/retrans
2679 * before giving up and aborting (ETIMEDOUT) a connection.
2684 icsk
->icsk_user_timeout
= msecs_to_jiffies(val
);
2688 if (val
>= 0 && ((1 << sk
->sk_state
) & (TCPF_CLOSE
|
2690 err
= fastopen_init_queue(sk
, val
);
2703 int tcp_setsockopt(struct sock
*sk
, int level
, int optname
, char __user
*optval
,
2704 unsigned int optlen
)
2706 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
2708 if (level
!= SOL_TCP
)
2709 return icsk
->icsk_af_ops
->setsockopt(sk
, level
, optname
,
2711 return do_tcp_setsockopt(sk
, level
, optname
, optval
, optlen
);
2713 EXPORT_SYMBOL(tcp_setsockopt
);
2715 #ifdef CONFIG_COMPAT
2716 int compat_tcp_setsockopt(struct sock
*sk
, int level
, int optname
,
2717 char __user
*optval
, unsigned int optlen
)
2719 if (level
!= SOL_TCP
)
2720 return inet_csk_compat_setsockopt(sk
, level
, optname
,
2722 return do_tcp_setsockopt(sk
, level
, optname
, optval
, optlen
);
2724 EXPORT_SYMBOL(compat_tcp_setsockopt
);
2727 /* Return information about state of tcp endpoint in API format. */
2728 void tcp_get_info(const struct sock
*sk
, struct tcp_info
*info
)
2730 const struct tcp_sock
*tp
= tcp_sk(sk
);
2731 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
2732 u32 now
= tcp_time_stamp
;
2734 memset(info
, 0, sizeof(*info
));
2736 info
->tcpi_state
= sk
->sk_state
;
2737 info
->tcpi_ca_state
= icsk
->icsk_ca_state
;
2738 info
->tcpi_retransmits
= icsk
->icsk_retransmits
;
2739 info
->tcpi_probes
= icsk
->icsk_probes_out
;
2740 info
->tcpi_backoff
= icsk
->icsk_backoff
;
2742 if (tp
->rx_opt
.tstamp_ok
)
2743 info
->tcpi_options
|= TCPI_OPT_TIMESTAMPS
;
2744 if (tcp_is_sack(tp
))
2745 info
->tcpi_options
|= TCPI_OPT_SACK
;
2746 if (tp
->rx_opt
.wscale_ok
) {
2747 info
->tcpi_options
|= TCPI_OPT_WSCALE
;
2748 info
->tcpi_snd_wscale
= tp
->rx_opt
.snd_wscale
;
2749 info
->tcpi_rcv_wscale
= tp
->rx_opt
.rcv_wscale
;
2752 if (tp
->ecn_flags
& TCP_ECN_OK
)
2753 info
->tcpi_options
|= TCPI_OPT_ECN
;
2754 if (tp
->ecn_flags
& TCP_ECN_SEEN
)
2755 info
->tcpi_options
|= TCPI_OPT_ECN_SEEN
;
2757 info
->tcpi_rto
= jiffies_to_usecs(icsk
->icsk_rto
);
2758 info
->tcpi_ato
= jiffies_to_usecs(icsk
->icsk_ack
.ato
);
2759 info
->tcpi_snd_mss
= tp
->mss_cache
;
2760 info
->tcpi_rcv_mss
= icsk
->icsk_ack
.rcv_mss
;
2762 if (sk
->sk_state
== TCP_LISTEN
) {
2763 info
->tcpi_unacked
= sk
->sk_ack_backlog
;
2764 info
->tcpi_sacked
= sk
->sk_max_ack_backlog
;
2766 info
->tcpi_unacked
= tp
->packets_out
;
2767 info
->tcpi_sacked
= tp
->sacked_out
;
2769 info
->tcpi_lost
= tp
->lost_out
;
2770 info
->tcpi_retrans
= tp
->retrans_out
;
2771 info
->tcpi_fackets
= tp
->fackets_out
;
2773 info
->tcpi_last_data_sent
= jiffies_to_msecs(now
- tp
->lsndtime
);
2774 info
->tcpi_last_data_recv
= jiffies_to_msecs(now
- icsk
->icsk_ack
.lrcvtime
);
2775 info
->tcpi_last_ack_recv
= jiffies_to_msecs(now
- tp
->rcv_tstamp
);
2777 info
->tcpi_pmtu
= icsk
->icsk_pmtu_cookie
;
2778 info
->tcpi_rcv_ssthresh
= tp
->rcv_ssthresh
;
2779 info
->tcpi_rtt
= jiffies_to_usecs(tp
->srtt
)>>3;
2780 info
->tcpi_rttvar
= jiffies_to_usecs(tp
->mdev
)>>2;
2781 info
->tcpi_snd_ssthresh
= tp
->snd_ssthresh
;
2782 info
->tcpi_snd_cwnd
= tp
->snd_cwnd
;
2783 info
->tcpi_advmss
= tp
->advmss
;
2784 info
->tcpi_reordering
= tp
->reordering
;
2786 info
->tcpi_rcv_rtt
= jiffies_to_usecs(tp
->rcv_rtt_est
.rtt
)>>3;
2787 info
->tcpi_rcv_space
= tp
->rcvq_space
.space
;
2789 info
->tcpi_total_retrans
= tp
->total_retrans
;
2791 EXPORT_SYMBOL_GPL(tcp_get_info
);
2793 static int do_tcp_getsockopt(struct sock
*sk
, int level
,
2794 int optname
, char __user
*optval
, int __user
*optlen
)
2796 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2797 struct tcp_sock
*tp
= tcp_sk(sk
);
2800 if (get_user(len
, optlen
))
2803 len
= min_t(unsigned int, len
, sizeof(int));
2810 val
= tp
->mss_cache
;
2811 if (!val
&& ((1 << sk
->sk_state
) & (TCPF_CLOSE
| TCPF_LISTEN
)))
2812 val
= tp
->rx_opt
.user_mss
;
2814 val
= tp
->rx_opt
.mss_clamp
;
2817 val
= !!(tp
->nonagle
&TCP_NAGLE_OFF
);
2820 val
= !!(tp
->nonagle
&TCP_NAGLE_CORK
);
2823 val
= keepalive_time_when(tp
) / HZ
;
2826 val
= keepalive_intvl_when(tp
) / HZ
;
2829 val
= keepalive_probes(tp
);
2832 val
= icsk
->icsk_syn_retries
? : sysctl_tcp_syn_retries
;
2837 val
= (val
? : sysctl_tcp_fin_timeout
) / HZ
;
2839 case TCP_DEFER_ACCEPT
:
2840 val
= retrans_to_secs(icsk
->icsk_accept_queue
.rskq_defer_accept
,
2841 TCP_TIMEOUT_INIT
/ HZ
, TCP_RTO_MAX
/ HZ
);
2843 case TCP_WINDOW_CLAMP
:
2844 val
= tp
->window_clamp
;
2847 struct tcp_info info
;
2849 if (get_user(len
, optlen
))
2852 tcp_get_info(sk
, &info
);
2854 len
= min_t(unsigned int, len
, sizeof(info
));
2855 if (put_user(len
, optlen
))
2857 if (copy_to_user(optval
, &info
, len
))
2862 val
= !icsk
->icsk_ack
.pingpong
;
2865 case TCP_CONGESTION
:
2866 if (get_user(len
, optlen
))
2868 len
= min_t(unsigned int, len
, TCP_CA_NAME_MAX
);
2869 if (put_user(len
, optlen
))
2871 if (copy_to_user(optval
, icsk
->icsk_ca_ops
->name
, len
))
2875 case TCP_COOKIE_TRANSACTIONS
: {
2876 struct tcp_cookie_transactions ctd
;
2877 struct tcp_cookie_values
*cvp
= tp
->cookie_values
;
2879 if (get_user(len
, optlen
))
2881 if (len
< sizeof(ctd
))
2884 memset(&ctd
, 0, sizeof(ctd
));
2885 ctd
.tcpct_flags
= (tp
->rx_opt
.cookie_in_always
?
2886 TCP_COOKIE_IN_ALWAYS
: 0)
2887 | (tp
->rx_opt
.cookie_out_never
?
2888 TCP_COOKIE_OUT_NEVER
: 0);
2891 ctd
.tcpct_flags
|= (cvp
->s_data_in
?
2893 | (cvp
->s_data_out
?
2894 TCP_S_DATA_OUT
: 0);
2896 ctd
.tcpct_cookie_desired
= cvp
->cookie_desired
;
2897 ctd
.tcpct_s_data_desired
= cvp
->s_data_desired
;
2899 memcpy(&ctd
.tcpct_value
[0], &cvp
->cookie_pair
[0],
2900 cvp
->cookie_pair_size
);
2901 ctd
.tcpct_used
= cvp
->cookie_pair_size
;
2904 if (put_user(sizeof(ctd
), optlen
))
2906 if (copy_to_user(optval
, &ctd
, sizeof(ctd
)))
2910 case TCP_THIN_LINEAR_TIMEOUTS
:
2913 case TCP_THIN_DUPACK
:
2914 val
= tp
->thin_dupack
;
2921 case TCP_REPAIR_QUEUE
:
2923 val
= tp
->repair_queue
;
2929 if (tp
->repair_queue
== TCP_SEND_QUEUE
)
2930 val
= tp
->write_seq
;
2931 else if (tp
->repair_queue
== TCP_RECV_QUEUE
)
2937 case TCP_USER_TIMEOUT
:
2938 val
= jiffies_to_msecs(icsk
->icsk_user_timeout
);
2941 return -ENOPROTOOPT
;
2944 if (put_user(len
, optlen
))
2946 if (copy_to_user(optval
, &val
, len
))
2951 int tcp_getsockopt(struct sock
*sk
, int level
, int optname
, char __user
*optval
,
2954 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2956 if (level
!= SOL_TCP
)
2957 return icsk
->icsk_af_ops
->getsockopt(sk
, level
, optname
,
2959 return do_tcp_getsockopt(sk
, level
, optname
, optval
, optlen
);
2961 EXPORT_SYMBOL(tcp_getsockopt
);
2963 #ifdef CONFIG_COMPAT
2964 int compat_tcp_getsockopt(struct sock
*sk
, int level
, int optname
,
2965 char __user
*optval
, int __user
*optlen
)
2967 if (level
!= SOL_TCP
)
2968 return inet_csk_compat_getsockopt(sk
, level
, optname
,
2970 return do_tcp_getsockopt(sk
, level
, optname
, optval
, optlen
);
2972 EXPORT_SYMBOL(compat_tcp_getsockopt
);
2975 struct sk_buff
*tcp_tso_segment(struct sk_buff
*skb
,
2976 netdev_features_t features
)
2978 struct sk_buff
*segs
= ERR_PTR(-EINVAL
);
2983 unsigned int oldlen
;
2986 if (!pskb_may_pull(skb
, sizeof(*th
)))
2990 thlen
= th
->doff
* 4;
2991 if (thlen
< sizeof(*th
))
2994 if (!pskb_may_pull(skb
, thlen
))
2997 oldlen
= (u16
)~skb
->len
;
2998 __skb_pull(skb
, thlen
);
3000 mss
= skb_shinfo(skb
)->gso_size
;
3001 if (unlikely(skb
->len
<= mss
))
3004 if (skb_gso_ok(skb
, features
| NETIF_F_GSO_ROBUST
)) {
3005 /* Packet is from an untrusted source, reset gso_segs. */
3006 int type
= skb_shinfo(skb
)->gso_type
;
3014 !(type
& (SKB_GSO_TCPV4
| SKB_GSO_TCPV6
))))
3017 skb_shinfo(skb
)->gso_segs
= DIV_ROUND_UP(skb
->len
, mss
);
3023 segs
= skb_segment(skb
, features
);
3027 delta
= htonl(oldlen
+ (thlen
+ mss
));
3031 seq
= ntohl(th
->seq
);
3034 th
->fin
= th
->psh
= 0;
3036 th
->check
= ~csum_fold((__force __wsum
)((__force u32
)th
->check
+
3037 (__force u32
)delta
));
3038 if (skb
->ip_summed
!= CHECKSUM_PARTIAL
)
3040 csum_fold(csum_partial(skb_transport_header(skb
),
3047 th
->seq
= htonl(seq
);
3049 } while (skb
->next
);
3051 delta
= htonl(oldlen
+ (skb
->tail
- skb
->transport_header
) +
3053 th
->check
= ~csum_fold((__force __wsum
)((__force u32
)th
->check
+
3054 (__force u32
)delta
));
3055 if (skb
->ip_summed
!= CHECKSUM_PARTIAL
)
3056 th
->check
= csum_fold(csum_partial(skb_transport_header(skb
),
3062 EXPORT_SYMBOL(tcp_tso_segment
);
3064 struct sk_buff
**tcp_gro_receive(struct sk_buff
**head
, struct sk_buff
*skb
)
3066 struct sk_buff
**pp
= NULL
;
3073 unsigned int mss
= 1;
3079 off
= skb_gro_offset(skb
);
3080 hlen
= off
+ sizeof(*th
);
3081 th
= skb_gro_header_fast(skb
, off
);
3082 if (skb_gro_header_hard(skb
, hlen
)) {
3083 th
= skb_gro_header_slow(skb
, hlen
, off
);
3088 thlen
= th
->doff
* 4;
3089 if (thlen
< sizeof(*th
))
3093 if (skb_gro_header_hard(skb
, hlen
)) {
3094 th
= skb_gro_header_slow(skb
, hlen
, off
);
3099 skb_gro_pull(skb
, thlen
);
3101 len
= skb_gro_len(skb
);
3102 flags
= tcp_flag_word(th
);
3104 for (; (p
= *head
); head
= &p
->next
) {
3105 if (!NAPI_GRO_CB(p
)->same_flow
)
3110 if (*(u32
*)&th
->source
^ *(u32
*)&th2
->source
) {
3111 NAPI_GRO_CB(p
)->same_flow
= 0;
3118 goto out_check_final
;
3121 flush
= NAPI_GRO_CB(p
)->flush
;
3122 flush
|= (__force
int)(flags
& TCP_FLAG_CWR
);
3123 flush
|= (__force
int)((flags
^ tcp_flag_word(th2
)) &
3124 ~(TCP_FLAG_CWR
| TCP_FLAG_FIN
| TCP_FLAG_PSH
));
3125 flush
|= (__force
int)(th
->ack_seq
^ th2
->ack_seq
);
3126 for (i
= sizeof(*th
); i
< thlen
; i
+= 4)
3127 flush
|= *(u32
*)((u8
*)th
+ i
) ^
3128 *(u32
*)((u8
*)th2
+ i
);
3130 mss
= skb_shinfo(p
)->gso_size
;
3132 flush
|= (len
- 1) >= mss
;
3133 flush
|= (ntohl(th2
->seq
) + skb_gro_len(p
)) ^ ntohl(th
->seq
);
3135 if (flush
|| skb_gro_receive(head
, skb
)) {
3137 goto out_check_final
;
3142 tcp_flag_word(th2
) |= flags
& (TCP_FLAG_FIN
| TCP_FLAG_PSH
);
3146 flush
|= (__force
int)(flags
& (TCP_FLAG_URG
| TCP_FLAG_PSH
|
3147 TCP_FLAG_RST
| TCP_FLAG_SYN
|
3150 if (p
&& (!NAPI_GRO_CB(skb
)->same_flow
|| flush
))
3154 NAPI_GRO_CB(skb
)->flush
|= flush
;
3158 EXPORT_SYMBOL(tcp_gro_receive
);
3160 int tcp_gro_complete(struct sk_buff
*skb
)
3162 struct tcphdr
*th
= tcp_hdr(skb
);
3164 skb
->csum_start
= skb_transport_header(skb
) - skb
->head
;
3165 skb
->csum_offset
= offsetof(struct tcphdr
, check
);
3166 skb
->ip_summed
= CHECKSUM_PARTIAL
;
3168 skb_shinfo(skb
)->gso_segs
= NAPI_GRO_CB(skb
)->count
;
3171 skb_shinfo(skb
)->gso_type
|= SKB_GSO_TCP_ECN
;
3175 EXPORT_SYMBOL(tcp_gro_complete
);
3177 #ifdef CONFIG_TCP_MD5SIG
3178 static unsigned long tcp_md5sig_users
;
3179 static struct tcp_md5sig_pool __percpu
*tcp_md5sig_pool
;
3180 static DEFINE_SPINLOCK(tcp_md5sig_pool_lock
);
3182 static void __tcp_free_md5sig_pool(struct tcp_md5sig_pool __percpu
*pool
)
3186 for_each_possible_cpu(cpu
) {
3187 struct tcp_md5sig_pool
*p
= per_cpu_ptr(pool
, cpu
);
3189 if (p
->md5_desc
.tfm
)
3190 crypto_free_hash(p
->md5_desc
.tfm
);
3195 void tcp_free_md5sig_pool(void)
3197 struct tcp_md5sig_pool __percpu
*pool
= NULL
;
3199 spin_lock_bh(&tcp_md5sig_pool_lock
);
3200 if (--tcp_md5sig_users
== 0) {
3201 pool
= tcp_md5sig_pool
;
3202 tcp_md5sig_pool
= NULL
;
3204 spin_unlock_bh(&tcp_md5sig_pool_lock
);
3206 __tcp_free_md5sig_pool(pool
);
3208 EXPORT_SYMBOL(tcp_free_md5sig_pool
);
3210 static struct tcp_md5sig_pool __percpu
*
3211 __tcp_alloc_md5sig_pool(struct sock
*sk
)
3214 struct tcp_md5sig_pool __percpu
*pool
;
3216 pool
= alloc_percpu(struct tcp_md5sig_pool
);
3220 for_each_possible_cpu(cpu
) {
3221 struct crypto_hash
*hash
;
3223 hash
= crypto_alloc_hash("md5", 0, CRYPTO_ALG_ASYNC
);
3224 if (!hash
|| IS_ERR(hash
))
3227 per_cpu_ptr(pool
, cpu
)->md5_desc
.tfm
= hash
;
3231 __tcp_free_md5sig_pool(pool
);
3235 struct tcp_md5sig_pool __percpu
*tcp_alloc_md5sig_pool(struct sock
*sk
)
3237 struct tcp_md5sig_pool __percpu
*pool
;
3241 spin_lock_bh(&tcp_md5sig_pool_lock
);
3242 pool
= tcp_md5sig_pool
;
3243 if (tcp_md5sig_users
++ == 0) {
3245 spin_unlock_bh(&tcp_md5sig_pool_lock
);
3248 spin_unlock_bh(&tcp_md5sig_pool_lock
);
3252 spin_unlock_bh(&tcp_md5sig_pool_lock
);
3255 /* we cannot hold spinlock here because this may sleep. */
3256 struct tcp_md5sig_pool __percpu
*p
;
3258 p
= __tcp_alloc_md5sig_pool(sk
);
3259 spin_lock_bh(&tcp_md5sig_pool_lock
);
3262 spin_unlock_bh(&tcp_md5sig_pool_lock
);
3265 pool
= tcp_md5sig_pool
;
3267 /* oops, it has already been assigned. */
3268 spin_unlock_bh(&tcp_md5sig_pool_lock
);
3269 __tcp_free_md5sig_pool(p
);
3271 tcp_md5sig_pool
= pool
= p
;
3272 spin_unlock_bh(&tcp_md5sig_pool_lock
);
3277 EXPORT_SYMBOL(tcp_alloc_md5sig_pool
);
3281 * tcp_get_md5sig_pool - get md5sig_pool for this user
3283 * We use percpu structure, so if we succeed, we exit with preemption
3284 * and BH disabled, to make sure another thread or softirq handling
3285 * wont try to get same context.
3287 struct tcp_md5sig_pool
*tcp_get_md5sig_pool(void)
3289 struct tcp_md5sig_pool __percpu
*p
;
3293 spin_lock(&tcp_md5sig_pool_lock
);
3294 p
= tcp_md5sig_pool
;
3297 spin_unlock(&tcp_md5sig_pool_lock
);
3300 return this_cpu_ptr(p
);
3305 EXPORT_SYMBOL(tcp_get_md5sig_pool
);
3307 void tcp_put_md5sig_pool(void)
3310 tcp_free_md5sig_pool();
3312 EXPORT_SYMBOL(tcp_put_md5sig_pool
);
3314 int tcp_md5_hash_header(struct tcp_md5sig_pool
*hp
,
3315 const struct tcphdr
*th
)
3317 struct scatterlist sg
;
3321 /* We are not allowed to change tcphdr, make a local copy */
3322 memcpy(&hdr
, th
, sizeof(hdr
));
3325 /* options aren't included in the hash */
3326 sg_init_one(&sg
, &hdr
, sizeof(hdr
));
3327 err
= crypto_hash_update(&hp
->md5_desc
, &sg
, sizeof(hdr
));
3330 EXPORT_SYMBOL(tcp_md5_hash_header
);
3332 int tcp_md5_hash_skb_data(struct tcp_md5sig_pool
*hp
,
3333 const struct sk_buff
*skb
, unsigned int header_len
)
3335 struct scatterlist sg
;
3336 const struct tcphdr
*tp
= tcp_hdr(skb
);
3337 struct hash_desc
*desc
= &hp
->md5_desc
;
3339 const unsigned int head_data_len
= skb_headlen(skb
) > header_len
?
3340 skb_headlen(skb
) - header_len
: 0;
3341 const struct skb_shared_info
*shi
= skb_shinfo(skb
);
3342 struct sk_buff
*frag_iter
;
3344 sg_init_table(&sg
, 1);
3346 sg_set_buf(&sg
, ((u8
*) tp
) + header_len
, head_data_len
);
3347 if (crypto_hash_update(desc
, &sg
, head_data_len
))
3350 for (i
= 0; i
< shi
->nr_frags
; ++i
) {
3351 const struct skb_frag_struct
*f
= &shi
->frags
[i
];
3352 struct page
*page
= skb_frag_page(f
);
3353 sg_set_page(&sg
, page
, skb_frag_size(f
), f
->page_offset
);
3354 if (crypto_hash_update(desc
, &sg
, skb_frag_size(f
)))
3358 skb_walk_frags(skb
, frag_iter
)
3359 if (tcp_md5_hash_skb_data(hp
, frag_iter
, 0))
3364 EXPORT_SYMBOL(tcp_md5_hash_skb_data
);
3366 int tcp_md5_hash_key(struct tcp_md5sig_pool
*hp
, const struct tcp_md5sig_key
*key
)
3368 struct scatterlist sg
;
3370 sg_init_one(&sg
, key
->key
, key
->keylen
);
3371 return crypto_hash_update(&hp
->md5_desc
, &sg
, key
->keylen
);
3373 EXPORT_SYMBOL(tcp_md5_hash_key
);
3377 /* Each Responder maintains up to two secret values concurrently for
3378 * efficient secret rollover. Each secret value has 4 states:
3380 * Generating. (tcp_secret_generating != tcp_secret_primary)
3381 * Generates new Responder-Cookies, but not yet used for primary
3382 * verification. This is a short-term state, typically lasting only
3383 * one round trip time (RTT).
3385 * Primary. (tcp_secret_generating == tcp_secret_primary)
3386 * Used both for generation and primary verification.
3388 * Retiring. (tcp_secret_retiring != tcp_secret_secondary)
3389 * Used for verification, until the first failure that can be
3390 * verified by the newer Generating secret. At that time, this
3391 * cookie's state is changed to Secondary, and the Generating
3392 * cookie's state is changed to Primary. This is a short-term state,
3393 * typically lasting only one round trip time (RTT).
3395 * Secondary. (tcp_secret_retiring == tcp_secret_secondary)
3396 * Used for secondary verification, after primary verification
3397 * failures. This state lasts no more than twice the Maximum Segment
3398 * Lifetime (2MSL). Then, the secret is discarded.
3400 struct tcp_cookie_secret
{
3401 /* The secret is divided into two parts. The digest part is the
3402 * equivalent of previously hashing a secret and saving the state,
3403 * and serves as an initialization vector (IV). The message part
3404 * serves as the trailing secret.
3406 u32 secrets
[COOKIE_WORKSPACE_WORDS
];
3407 unsigned long expires
;
3410 #define TCP_SECRET_1MSL (HZ * TCP_PAWS_MSL)
3411 #define TCP_SECRET_2MSL (HZ * TCP_PAWS_MSL * 2)
3412 #define TCP_SECRET_LIFE (HZ * 600)
3414 static struct tcp_cookie_secret tcp_secret_one
;
3415 static struct tcp_cookie_secret tcp_secret_two
;
3417 /* Essentially a circular list, without dynamic allocation. */
3418 static struct tcp_cookie_secret
*tcp_secret_generating
;
3419 static struct tcp_cookie_secret
*tcp_secret_primary
;
3420 static struct tcp_cookie_secret
*tcp_secret_retiring
;
3421 static struct tcp_cookie_secret
*tcp_secret_secondary
;
3423 static DEFINE_SPINLOCK(tcp_secret_locker
);
3425 /* Select a pseudo-random word in the cookie workspace.
3427 static inline u32
tcp_cookie_work(const u32
*ws
, const int n
)
3429 return ws
[COOKIE_DIGEST_WORDS
+ ((COOKIE_MESSAGE_WORDS
-1) & ws
[n
])];
3432 /* Fill bakery[COOKIE_WORKSPACE_WORDS] with generator, updating as needed.
3433 * Called in softirq context.
3434 * Returns: 0 for success.
3436 int tcp_cookie_generator(u32
*bakery
)
3438 unsigned long jiffy
= jiffies
;
3440 if (unlikely(time_after_eq(jiffy
, tcp_secret_generating
->expires
))) {
3441 spin_lock_bh(&tcp_secret_locker
);
3442 if (!time_after_eq(jiffy
, tcp_secret_generating
->expires
)) {
3443 /* refreshed by another */
3445 &tcp_secret_generating
->secrets
[0],
3446 COOKIE_WORKSPACE_WORDS
);
3448 /* still needs refreshing */
3449 get_random_bytes(bakery
, COOKIE_WORKSPACE_WORDS
);
3451 /* The first time, paranoia assumes that the
3452 * randomization function isn't as strong. But,
3453 * this secret initialization is delayed until
3454 * the last possible moment (packet arrival).
3455 * Although that time is observable, it is
3456 * unpredictably variable. Mash in the most
3457 * volatile clock bits available, and expire the
3458 * secret extra quickly.
3460 if (unlikely(tcp_secret_primary
->expires
==
3461 tcp_secret_secondary
->expires
)) {
3464 getnstimeofday(&tv
);
3465 bakery
[COOKIE_DIGEST_WORDS
+0] ^=
3468 tcp_secret_secondary
->expires
= jiffy
3470 + (0x0f & tcp_cookie_work(bakery
, 0));
3472 tcp_secret_secondary
->expires
= jiffy
3474 + (0xff & tcp_cookie_work(bakery
, 1));
3475 tcp_secret_primary
->expires
= jiffy
3477 + (0x1f & tcp_cookie_work(bakery
, 2));
3479 memcpy(&tcp_secret_secondary
->secrets
[0],
3480 bakery
, COOKIE_WORKSPACE_WORDS
);
3482 rcu_assign_pointer(tcp_secret_generating
,
3483 tcp_secret_secondary
);
3484 rcu_assign_pointer(tcp_secret_retiring
,
3485 tcp_secret_primary
);
3487 * Neither call_rcu() nor synchronize_rcu() needed.
3488 * Retiring data is not freed. It is replaced after
3489 * further (locked) pointer updates, and a quiet time
3490 * (minimum 1MSL, maximum LIFE - 2MSL).
3493 spin_unlock_bh(&tcp_secret_locker
);
3497 &rcu_dereference(tcp_secret_generating
)->secrets
[0],
3498 COOKIE_WORKSPACE_WORDS
);
3499 rcu_read_unlock_bh();
3503 EXPORT_SYMBOL(tcp_cookie_generator
);
3505 void tcp_done(struct sock
*sk
)
3507 struct request_sock
*req
= tcp_sk(sk
)->fastopen_rsk
;
3509 if (sk
->sk_state
== TCP_SYN_SENT
|| sk
->sk_state
== TCP_SYN_RECV
)
3510 TCP_INC_STATS_BH(sock_net(sk
), TCP_MIB_ATTEMPTFAILS
);
3512 tcp_set_state(sk
, TCP_CLOSE
);
3513 tcp_clear_xmit_timers(sk
);
3515 reqsk_fastopen_remove(sk
, req
, false);
3517 sk
->sk_shutdown
= SHUTDOWN_MASK
;
3519 if (!sock_flag(sk
, SOCK_DEAD
))
3520 sk
->sk_state_change(sk
);
3522 inet_csk_destroy_sock(sk
);
3524 EXPORT_SYMBOL_GPL(tcp_done
);
3526 extern struct tcp_congestion_ops tcp_reno
;
3528 static __initdata
unsigned long thash_entries
;
3529 static int __init
set_thash_entries(char *str
)
3536 ret
= kstrtoul(str
, 0, &thash_entries
);
3542 __setup("thash_entries=", set_thash_entries
);
3544 void tcp_init_mem(struct net
*net
)
3546 unsigned long limit
= nr_free_buffer_pages() / 8;
3547 limit
= max(limit
, 128UL);
3548 net
->ipv4
.sysctl_tcp_mem
[0] = limit
/ 4 * 3;
3549 net
->ipv4
.sysctl_tcp_mem
[1] = limit
;
3550 net
->ipv4
.sysctl_tcp_mem
[2] = net
->ipv4
.sysctl_tcp_mem
[0] * 2;
3553 void __init
tcp_init(void)
3555 struct sk_buff
*skb
= NULL
;
3556 unsigned long limit
;
3557 int max_rshare
, max_wshare
, cnt
;
3559 unsigned long jiffy
= jiffies
;
3561 BUILD_BUG_ON(sizeof(struct tcp_skb_cb
) > sizeof(skb
->cb
));
3563 percpu_counter_init(&tcp_sockets_allocated
, 0);
3564 percpu_counter_init(&tcp_orphan_count
, 0);
3565 tcp_hashinfo
.bind_bucket_cachep
=
3566 kmem_cache_create("tcp_bind_bucket",
3567 sizeof(struct inet_bind_bucket
), 0,
3568 SLAB_HWCACHE_ALIGN
|SLAB_PANIC
, NULL
);
3570 /* Size and allocate the main established and bind bucket
3573 * The methodology is similar to that of the buffer cache.
3575 tcp_hashinfo
.ehash
=
3576 alloc_large_system_hash("TCP established",
3577 sizeof(struct inet_ehash_bucket
),
3579 (totalram_pages
>= 128 * 1024) ?
3583 &tcp_hashinfo
.ehash_mask
,
3585 thash_entries
? 0 : 512 * 1024);
3586 for (i
= 0; i
<= tcp_hashinfo
.ehash_mask
; i
++) {
3587 INIT_HLIST_NULLS_HEAD(&tcp_hashinfo
.ehash
[i
].chain
, i
);
3588 INIT_HLIST_NULLS_HEAD(&tcp_hashinfo
.ehash
[i
].twchain
, i
);
3590 if (inet_ehash_locks_alloc(&tcp_hashinfo
))
3591 panic("TCP: failed to alloc ehash_locks");
3592 tcp_hashinfo
.bhash
=
3593 alloc_large_system_hash("TCP bind",
3594 sizeof(struct inet_bind_hashbucket
),
3595 tcp_hashinfo
.ehash_mask
+ 1,
3596 (totalram_pages
>= 128 * 1024) ?
3599 &tcp_hashinfo
.bhash_size
,
3603 tcp_hashinfo
.bhash_size
= 1U << tcp_hashinfo
.bhash_size
;
3604 for (i
= 0; i
< tcp_hashinfo
.bhash_size
; i
++) {
3605 spin_lock_init(&tcp_hashinfo
.bhash
[i
].lock
);
3606 INIT_HLIST_HEAD(&tcp_hashinfo
.bhash
[i
].chain
);
3610 cnt
= tcp_hashinfo
.ehash_mask
+ 1;
3612 tcp_death_row
.sysctl_max_tw_buckets
= cnt
/ 2;
3613 sysctl_tcp_max_orphans
= cnt
/ 2;
3614 sysctl_max_syn_backlog
= max(128, cnt
/ 256);
3616 tcp_init_mem(&init_net
);
3617 /* Set per-socket limits to no more than 1/128 the pressure threshold */
3618 limit
= nr_free_buffer_pages() << (PAGE_SHIFT
- 7);
3619 max_wshare
= min(4UL*1024*1024, limit
);
3620 max_rshare
= min(6UL*1024*1024, limit
);
3622 sysctl_tcp_wmem
[0] = SK_MEM_QUANTUM
;
3623 sysctl_tcp_wmem
[1] = 16*1024;
3624 sysctl_tcp_wmem
[2] = max(64*1024, max_wshare
);
3626 sysctl_tcp_rmem
[0] = SK_MEM_QUANTUM
;
3627 sysctl_tcp_rmem
[1] = 87380;
3628 sysctl_tcp_rmem
[2] = max(87380, max_rshare
);
3630 pr_info("Hash tables configured (established %u bind %u)\n",
3631 tcp_hashinfo
.ehash_mask
+ 1, tcp_hashinfo
.bhash_size
);
3635 tcp_register_congestion_control(&tcp_reno
);
3637 memset(&tcp_secret_one
.secrets
[0], 0, sizeof(tcp_secret_one
.secrets
));
3638 memset(&tcp_secret_two
.secrets
[0], 0, sizeof(tcp_secret_two
.secrets
));
3639 tcp_secret_one
.expires
= jiffy
; /* past due */
3640 tcp_secret_two
.expires
= jiffy
; /* past due */
3641 tcp_secret_generating
= &tcp_secret_one
;
3642 tcp_secret_primary
= &tcp_secret_one
;
3643 tcp_secret_retiring
= &tcp_secret_two
;
3644 tcp_secret_secondary
= &tcp_secret_two
;