4 * Generic datagram handling routines. These are generic for all
5 * protocols. Possibly a generic IP version on top of these would
6 * make sense. Not tonight however 8-).
7 * This is used because UDP, RAW, PACKET, DDP, IPX, AX.25 and
8 * NetROM layer all have identical poll code and mostly
9 * identical recvmsg() code. So we share it here. The poll was
10 * shared before but buried in udp.c so I moved it.
12 * Authors: Alan Cox <alan@lxorguk.ukuu.org.uk>. (datagram_poll() from old
16 * Alan Cox : NULL return from skb_peek_copy()
18 * Alan Cox : Rewrote skb_read_datagram to avoid the
19 * skb_peek_copy stuff.
20 * Alan Cox : Added support for SOCK_SEQPACKET.
21 * IPX can no longer use the SO_TYPE hack
22 * but AX.25 now works right, and SPX is
24 * Alan Cox : Fixed write poll of non IP protocol
26 * Florian La Roche: Changed for my new skbuff handling.
27 * Darryl Miles : Fixed non-blocking SOCK_SEQPACKET.
28 * Linus Torvalds : BSD semantic fixes.
29 * Alan Cox : Datagram iovec handling
30 * Darryl Miles : Fixed non-blocking SOCK_STREAM.
31 * Alan Cox : POSIXisms
32 * Pete Wyckoff : Unconnected accept() fix.
36 #include <linux/module.h>
37 #include <linux/types.h>
38 #include <linux/kernel.h>
39 #include <asm/uaccess.h>
40 #include <asm/system.h>
42 #include <linux/interrupt.h>
43 #include <linux/errno.h>
44 #include <linux/sched.h>
45 #include <linux/inet.h>
46 #include <linux/netdevice.h>
47 #include <linux/rtnetlink.h>
48 #include <linux/poll.h>
49 #include <linux/highmem.h>
50 #include <linux/spinlock.h>
51 #include <linux/slab.h>
53 #include <net/protocol.h>
54 #include <linux/skbuff.h>
56 #include <net/checksum.h>
58 #include <net/tcp_states.h>
59 #include <trace/events/skb.h>
62 * Is a socket 'connection oriented' ?
64 static inline int connection_based(struct sock *sk)
66 return sk->sk_type == SOCK_SEQPACKET || sk->sk_type == SOCK_STREAM;
69 static int receiver_wake_function(wait_queue_t *wait, unsigned mode, int sync,
72 unsigned long bits = (unsigned long)key;
75 * Avoid a wakeup if event not interesting for us
77 if (bits && !(bits & (POLLIN | POLLERR)))
79 return autoremove_wake_function(wait, mode, sync, key);
84 static int wait_for_packet(struct sock *sk, int *err, long *timeo_p)
87 DEFINE_WAIT_FUNC(wait, receiver_wake_function);
89 prepare_to_wait_exclusive(sk_sleep(sk), &wait, TASK_INTERRUPTIBLE);
92 error = sock_error(sk);
96 if (!skb_queue_empty(&sk->sk_receive_queue))
99 /* Socket shut down? */
100 if (sk->sk_shutdown & RCV_SHUTDOWN)
103 /* Sequenced packets can come disconnected.
104 * If so we report the problem
107 if (connection_based(sk) &&
108 !(sk->sk_state == TCP_ESTABLISHED || sk->sk_state == TCP_LISTEN))
112 if (signal_pending(current))
116 *timeo_p = schedule_timeout(*timeo_p);
118 finish_wait(sk_sleep(sk), &wait);
121 error = sock_intr_errno(*timeo_p);
132 * __skb_recv_datagram - Receive a datagram skbuff
135 * @peeked: returns non-zero if this packet has been seen before
136 * @err: error code returned
138 * Get a datagram skbuff, understands the peeking, nonblocking wakeups
139 * and possible races. This replaces identical code in packet, raw and
140 * udp, as well as the IPX AX.25 and Appletalk. It also finally fixes
141 * the long standing peek and read race for datagram sockets. If you
142 * alter this routine remember it must be re-entrant.
144 * This function will lock the socket if a skb is returned, so the caller
145 * needs to unlock the socket in that case (usually by calling
148 * * It does not lock socket since today. This function is
149 * * free of race conditions. This measure should/can improve
150 * * significantly datagram socket latencies at high loads,
151 * * when data copying to user space takes lots of time.
152 * * (BTW I've just killed the last cli() in IP/IPv6/core/netlink/packet
156 * The order of the tests when we find no data waiting are specified
157 * quite explicitly by POSIX 1003.1g, don't change them without having
158 * the standard around please.
160 struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags,
161 int *peeked, int *err)
166 * Caller is allowed not to check sk->sk_err before skb_recv_datagram()
168 int error = sock_error(sk);
173 timeo = sock_rcvtimeo(sk, flags & MSG_DONTWAIT);
176 /* Again only user level code calls this function, so nothing
177 * interrupt level will suddenly eat the receive_queue.
179 * Look at current nfs client by the way...
180 * However, this function was corrent in any case. 8)
182 unsigned long cpu_flags;
184 spin_lock_irqsave(&sk->sk_receive_queue.lock, cpu_flags);
185 skb = skb_peek(&sk->sk_receive_queue);
187 *peeked = skb->peeked;
188 if (flags & MSG_PEEK) {
190 atomic_inc(&skb->users);
192 __skb_unlink(skb, &sk->sk_receive_queue);
194 spin_unlock_irqrestore(&sk->sk_receive_queue.lock, cpu_flags);
199 /* User doesn't want to wait */
204 } while (!wait_for_packet(sk, err, &timeo));
212 EXPORT_SYMBOL(__skb_recv_datagram);
214 struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
215 int noblock, int *err)
219 return __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0),
223 void skb_free_datagram(struct sock *sk, struct sk_buff *skb)
226 sk_mem_reclaim_partial(sk);
228 EXPORT_SYMBOL(skb_free_datagram);
230 void skb_free_datagram_locked(struct sock *sk, struct sk_buff *skb)
234 sk_mem_reclaim_partial(sk);
237 /* skb is now orphaned, might be freed outside of locked section */
240 EXPORT_SYMBOL(skb_free_datagram_locked);
243 * skb_kill_datagram - Free a datagram skbuff forcibly
245 * @skb: datagram skbuff
248 * This function frees a datagram skbuff that was received by
249 * skb_recv_datagram. The flags argument must match the one
250 * used for skb_recv_datagram.
252 * If the MSG_PEEK flag is set, and the packet is still on the
253 * receive queue of the socket, it will be taken off the queue
254 * before it is freed.
256 * This function currently only disables BH when acquiring the
257 * sk_receive_queue lock. Therefore it must not be used in a
258 * context where that lock is acquired in an IRQ context.
260 * It returns 0 if the packet was removed by us.
263 int skb_kill_datagram(struct sock *sk, struct sk_buff *skb, unsigned int flags)
267 if (flags & MSG_PEEK) {
269 spin_lock_bh(&sk->sk_receive_queue.lock);
270 if (skb == skb_peek(&sk->sk_receive_queue)) {
271 __skb_unlink(skb, &sk->sk_receive_queue);
272 atomic_dec(&skb->users);
275 spin_unlock_bh(&sk->sk_receive_queue.lock);
279 atomic_inc(&sk->sk_drops);
280 sk_mem_reclaim_partial(sk);
285 EXPORT_SYMBOL(skb_kill_datagram);
288 * skb_copy_datagram_iovec - Copy a datagram to an iovec.
289 * @skb: buffer to copy
290 * @offset: offset in the buffer to start copying from
291 * @to: io vector to copy to
292 * @len: amount of data to copy from buffer to iovec
294 * Note: the iovec is modified during the copy.
296 int skb_copy_datagram_iovec(const struct sk_buff *skb, int offset,
297 struct iovec *to, int len)
299 int start = skb_headlen(skb);
300 int i, copy = start - offset;
301 struct sk_buff *frag_iter;
303 trace_skb_copy_datagram_iovec(skb, len);
309 if (memcpy_toiovec(to, skb->data + offset, copy))
311 if ((len -= copy) == 0)
316 /* Copy paged appendix. Hmm... why does this look so complicated? */
317 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
320 WARN_ON(start > offset + len);
322 end = start + skb_shinfo(skb)->frags[i].size;
323 if ((copy = end - offset) > 0) {
326 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
327 struct page *page = frag->page;
332 err = memcpy_toiovec(to, vaddr + frag->page_offset +
333 offset - start, copy);
344 skb_walk_frags(skb, frag_iter) {
347 WARN_ON(start > offset + len);
349 end = start + frag_iter->len;
350 if ((copy = end - offset) > 0) {
353 if (skb_copy_datagram_iovec(frag_iter,
357 if ((len -= copy) == 0)
371 * skb_copy_datagram_const_iovec - Copy a datagram to an iovec.
372 * @skb: buffer to copy
373 * @offset: offset in the buffer to start copying from
374 * @to: io vector to copy to
375 * @to_offset: offset in the io vector to start copying to
376 * @len: amount of data to copy from buffer to iovec
378 * Returns 0 or -EFAULT.
379 * Note: the iovec is not modified during the copy.
381 int skb_copy_datagram_const_iovec(const struct sk_buff *skb, int offset,
382 const struct iovec *to, int to_offset,
385 int start = skb_headlen(skb);
386 int i, copy = start - offset;
387 struct sk_buff *frag_iter;
393 if (memcpy_toiovecend(to, skb->data + offset, to_offset, copy))
395 if ((len -= copy) == 0)
401 /* Copy paged appendix. Hmm... why does this look so complicated? */
402 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
405 WARN_ON(start > offset + len);
407 end = start + skb_shinfo(skb)->frags[i].size;
408 if ((copy = end - offset) > 0) {
411 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
412 struct page *page = frag->page;
417 err = memcpy_toiovecend(to, vaddr + frag->page_offset +
418 offset - start, to_offset, copy);
430 skb_walk_frags(skb, frag_iter) {
433 WARN_ON(start > offset + len);
435 end = start + frag_iter->len;
436 if ((copy = end - offset) > 0) {
439 if (skb_copy_datagram_const_iovec(frag_iter,
444 if ((len -= copy) == 0)
457 EXPORT_SYMBOL(skb_copy_datagram_const_iovec);
460 * skb_copy_datagram_from_iovec - Copy a datagram from an iovec.
461 * @skb: buffer to copy
462 * @offset: offset in the buffer to start copying to
463 * @from: io vector to copy to
464 * @from_offset: offset in the io vector to start copying from
465 * @len: amount of data to copy to buffer from iovec
467 * Returns 0 or -EFAULT.
468 * Note: the iovec is not modified during the copy.
470 int skb_copy_datagram_from_iovec(struct sk_buff *skb, int offset,
471 const struct iovec *from, int from_offset,
474 int start = skb_headlen(skb);
475 int i, copy = start - offset;
476 struct sk_buff *frag_iter;
482 if (memcpy_fromiovecend(skb->data + offset, from, from_offset,
485 if ((len -= copy) == 0)
491 /* Copy paged appendix. Hmm... why does this look so complicated? */
492 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
495 WARN_ON(start > offset + len);
497 end = start + skb_shinfo(skb)->frags[i].size;
498 if ((copy = end - offset) > 0) {
501 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
502 struct page *page = frag->page;
507 err = memcpy_fromiovecend(vaddr + frag->page_offset +
509 from, from_offset, copy);
522 skb_walk_frags(skb, frag_iter) {
525 WARN_ON(start > offset + len);
527 end = start + frag_iter->len;
528 if ((copy = end - offset) > 0) {
531 if (skb_copy_datagram_from_iovec(frag_iter,
537 if ((len -= copy) == 0)
550 EXPORT_SYMBOL(skb_copy_datagram_from_iovec);
552 static int skb_copy_and_csum_datagram(const struct sk_buff *skb, int offset,
553 u8 __user *to, int len,
556 int start = skb_headlen(skb);
557 int i, copy = start - offset;
558 struct sk_buff *frag_iter;
566 *csump = csum_and_copy_to_user(skb->data + offset, to, copy,
570 if ((len -= copy) == 0)
577 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
580 WARN_ON(start > offset + len);
582 end = start + skb_shinfo(skb)->frags[i].size;
583 if ((copy = end - offset) > 0) {
587 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
588 struct page *page = frag->page;
593 csum2 = csum_and_copy_to_user(vaddr +
600 *csump = csum_block_add(*csump, csum2, pos);
610 skb_walk_frags(skb, frag_iter) {
613 WARN_ON(start > offset + len);
615 end = start + frag_iter->len;
616 if ((copy = end - offset) > 0) {
620 if (skb_copy_and_csum_datagram(frag_iter,
625 *csump = csum_block_add(*csump, csum2, pos);
626 if ((len -= copy) == 0)
641 __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len)
645 sum = csum_fold(skb_checksum(skb, 0, len, skb->csum));
647 if (unlikely(skb->ip_summed == CHECKSUM_COMPLETE))
648 netdev_rx_csum_fault(skb->dev);
649 skb->ip_summed = CHECKSUM_UNNECESSARY;
653 EXPORT_SYMBOL(__skb_checksum_complete_head);
655 __sum16 __skb_checksum_complete(struct sk_buff *skb)
657 return __skb_checksum_complete_head(skb, skb->len);
659 EXPORT_SYMBOL(__skb_checksum_complete);
662 * skb_copy_and_csum_datagram_iovec - Copy and checkum skb to user iovec.
664 * @hlen: hardware length
667 * Caller _must_ check that skb will fit to this iovec.
669 * Returns: 0 - success.
670 * -EINVAL - checksum failure.
671 * -EFAULT - fault during copy. Beware, in this case iovec
674 int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
675 int hlen, struct iovec *iov)
678 int chunk = skb->len - hlen;
683 /* Skip filled elements.
684 * Pretty silly, look at memcpy_toiovec, though 8)
686 while (!iov->iov_len)
689 if (iov->iov_len < chunk) {
690 if (__skb_checksum_complete(skb))
692 if (skb_copy_datagram_iovec(skb, hlen, iov, chunk))
695 csum = csum_partial(skb->data, hlen, skb->csum);
696 if (skb_copy_and_csum_datagram(skb, hlen, iov->iov_base,
701 if (unlikely(skb->ip_summed == CHECKSUM_COMPLETE))
702 netdev_rx_csum_fault(skb->dev);
703 iov->iov_len -= chunk;
704 iov->iov_base += chunk;
714 * datagram_poll - generic datagram poll
719 * Datagram poll: Again totally generic. This also handles
720 * sequenced packet sockets providing the socket receive queue
721 * is only ever holding data ready to receive.
723 * Note: when you _don't_ use this routine for this protocol,
724 * and you use a different write policy from sock_writeable()
725 * then please supply your own write_space callback.
727 unsigned int datagram_poll(struct file *file, struct socket *sock,
730 struct sock *sk = sock->sk;
733 sock_poll_wait(file, sk_sleep(sk), wait);
736 /* exceptional events? */
737 if (sk->sk_err || !skb_queue_empty(&sk->sk_error_queue))
739 if (sk->sk_shutdown & RCV_SHUTDOWN)
741 if (sk->sk_shutdown == SHUTDOWN_MASK)
745 if (!skb_queue_empty(&sk->sk_receive_queue) ||
746 (sk->sk_shutdown & RCV_SHUTDOWN))
747 mask |= POLLIN | POLLRDNORM;
749 /* Connection-based need to check for termination and startup */
750 if (connection_based(sk)) {
751 if (sk->sk_state == TCP_CLOSE)
753 /* connection hasn't started yet? */
754 if (sk->sk_state == TCP_SYN_SENT)
759 if (sock_writeable(sk))
760 mask |= POLLOUT | POLLWRNORM | POLLWRBAND;
762 set_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
767 EXPORT_SYMBOL(datagram_poll);
768 EXPORT_SYMBOL(skb_copy_and_csum_datagram_iovec);
769 EXPORT_SYMBOL(skb_copy_datagram_iovec);
770 EXPORT_SYMBOL(skb_recv_datagram);