[ARM] pxa/colibri270: Refactor board definition file
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / net / core / datagram.c
blobf5b6f43a4c2e61e34e0d02053458b9a8c4dfdf89
1 /*
2 * SUCS NET3:
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
13 * udp.c code)
15 * Fixes:
16 * Alan Cox : NULL return from skb_peek_copy()
17 * understood
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
23 * feasible.
24 * Alan Cox : Fixed write poll of non IP protocol
25 * crash.
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>
41 #include <linux/mm.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>
57 #include <net/sock.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,
70 void *key)
72 unsigned long bits = (unsigned long)key;
75 * Avoid a wakeup if event not interesting for us
77 if (bits && !(bits & (POLLIN | POLLERR)))
78 return 0;
79 return autoremove_wake_function(wait, mode, sync, key);
82 * Wait for a packet..
84 static int wait_for_packet(struct sock *sk, int *err, long *timeo_p)
86 int error;
87 DEFINE_WAIT_FUNC(wait, receiver_wake_function);
89 prepare_to_wait_exclusive(sk_sleep(sk), &wait, TASK_INTERRUPTIBLE);
91 /* Socket errors? */
92 error = sock_error(sk);
93 if (error)
94 goto out_err;
96 if (!skb_queue_empty(&sk->sk_receive_queue))
97 goto out;
99 /* Socket shut down? */
100 if (sk->sk_shutdown & RCV_SHUTDOWN)
101 goto out_noerr;
103 /* Sequenced packets can come disconnected.
104 * If so we report the problem
106 error = -ENOTCONN;
107 if (connection_based(sk) &&
108 !(sk->sk_state == TCP_ESTABLISHED || sk->sk_state == TCP_LISTEN))
109 goto out_err;
111 /* handle signals */
112 if (signal_pending(current))
113 goto interrupted;
115 error = 0;
116 *timeo_p = schedule_timeout(*timeo_p);
117 out:
118 finish_wait(sk_sleep(sk), &wait);
119 return error;
120 interrupted:
121 error = sock_intr_errno(*timeo_p);
122 out_err:
123 *err = error;
124 goto out;
125 out_noerr:
126 *err = 0;
127 error = 1;
128 goto out;
132 * __skb_recv_datagram - Receive a datagram skbuff
133 * @sk: socket
134 * @flags: MSG_ flags
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
146 * skb_free_datagram)
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
153 * * 8) Great win.)
154 * * --ANK (980729)
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)
163 struct sk_buff *skb;
164 long timeo;
166 * Caller is allowed not to check sk->sk_err before skb_recv_datagram()
168 int error = sock_error(sk);
170 if (error)
171 goto no_packet;
173 timeo = sock_rcvtimeo(sk, flags & MSG_DONTWAIT);
175 do {
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);
186 if (skb) {
187 *peeked = skb->peeked;
188 if (flags & MSG_PEEK) {
189 skb->peeked = 1;
190 atomic_inc(&skb->users);
191 } else
192 __skb_unlink(skb, &sk->sk_receive_queue);
194 spin_unlock_irqrestore(&sk->sk_receive_queue.lock, cpu_flags);
196 if (skb)
197 return skb;
199 /* User doesn't want to wait */
200 error = -EAGAIN;
201 if (!timeo)
202 goto no_packet;
204 } while (!wait_for_packet(sk, err, &timeo));
206 return NULL;
208 no_packet:
209 *err = error;
210 return NULL;
212 EXPORT_SYMBOL(__skb_recv_datagram);
214 struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
215 int noblock, int *err)
217 int peeked;
219 return __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0),
220 &peeked, err);
223 void skb_free_datagram(struct sock *sk, struct sk_buff *skb)
225 consume_skb(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)
232 bool slow;
234 if (likely(atomic_read(&skb->users) == 1))
235 smp_rmb();
236 else if (likely(!atomic_dec_and_test(&skb->users)))
237 return;
239 slow = lock_sock_fast(sk);
240 skb_orphan(skb);
241 sk_mem_reclaim_partial(sk);
242 unlock_sock_fast(sk, slow);
244 /* skb is now orphaned, can be freed outside of locked section */
245 __kfree_skb(skb);
247 EXPORT_SYMBOL(skb_free_datagram_locked);
250 * skb_kill_datagram - Free a datagram skbuff forcibly
251 * @sk: socket
252 * @skb: datagram skbuff
253 * @flags: MSG_ flags
255 * This function frees a datagram skbuff that was received by
256 * skb_recv_datagram. The flags argument must match the one
257 * used for skb_recv_datagram.
259 * If the MSG_PEEK flag is set, and the packet is still on the
260 * receive queue of the socket, it will be taken off the queue
261 * before it is freed.
263 * This function currently only disables BH when acquiring the
264 * sk_receive_queue lock. Therefore it must not be used in a
265 * context where that lock is acquired in an IRQ context.
267 * It returns 0 if the packet was removed by us.
270 int skb_kill_datagram(struct sock *sk, struct sk_buff *skb, unsigned int flags)
272 int err = 0;
274 if (flags & MSG_PEEK) {
275 err = -ENOENT;
276 spin_lock_bh(&sk->sk_receive_queue.lock);
277 if (skb == skb_peek(&sk->sk_receive_queue)) {
278 __skb_unlink(skb, &sk->sk_receive_queue);
279 atomic_dec(&skb->users);
280 err = 0;
282 spin_unlock_bh(&sk->sk_receive_queue.lock);
285 kfree_skb(skb);
286 atomic_inc(&sk->sk_drops);
287 sk_mem_reclaim_partial(sk);
289 return err;
292 EXPORT_SYMBOL(skb_kill_datagram);
295 * skb_copy_datagram_iovec - Copy a datagram to an iovec.
296 * @skb: buffer to copy
297 * @offset: offset in the buffer to start copying from
298 * @to: io vector to copy to
299 * @len: amount of data to copy from buffer to iovec
301 * Note: the iovec is modified during the copy.
303 int skb_copy_datagram_iovec(const struct sk_buff *skb, int offset,
304 struct iovec *to, int len)
306 int start = skb_headlen(skb);
307 int i, copy = start - offset;
308 struct sk_buff *frag_iter;
310 trace_skb_copy_datagram_iovec(skb, len);
312 /* Copy header. */
313 if (copy > 0) {
314 if (copy > len)
315 copy = len;
316 if (memcpy_toiovec(to, skb->data + offset, copy))
317 goto fault;
318 if ((len -= copy) == 0)
319 return 0;
320 offset += copy;
323 /* Copy paged appendix. Hmm... why does this look so complicated? */
324 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
325 int end;
327 WARN_ON(start > offset + len);
329 end = start + skb_shinfo(skb)->frags[i].size;
330 if ((copy = end - offset) > 0) {
331 int err;
332 u8 *vaddr;
333 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
334 struct page *page = frag->page;
336 if (copy > len)
337 copy = len;
338 vaddr = kmap(page);
339 err = memcpy_toiovec(to, vaddr + frag->page_offset +
340 offset - start, copy);
341 kunmap(page);
342 if (err)
343 goto fault;
344 if (!(len -= copy))
345 return 0;
346 offset += copy;
348 start = end;
351 skb_walk_frags(skb, frag_iter) {
352 int end;
354 WARN_ON(start > offset + len);
356 end = start + frag_iter->len;
357 if ((copy = end - offset) > 0) {
358 if (copy > len)
359 copy = len;
360 if (skb_copy_datagram_iovec(frag_iter,
361 offset - start,
362 to, copy))
363 goto fault;
364 if ((len -= copy) == 0)
365 return 0;
366 offset += copy;
368 start = end;
370 if (!len)
371 return 0;
373 fault:
374 return -EFAULT;
378 * skb_copy_datagram_const_iovec - Copy a datagram to an iovec.
379 * @skb: buffer to copy
380 * @offset: offset in the buffer to start copying from
381 * @to: io vector to copy to
382 * @to_offset: offset in the io vector to start copying to
383 * @len: amount of data to copy from buffer to iovec
385 * Returns 0 or -EFAULT.
386 * Note: the iovec is not modified during the copy.
388 int skb_copy_datagram_const_iovec(const struct sk_buff *skb, int offset,
389 const struct iovec *to, int to_offset,
390 int len)
392 int start = skb_headlen(skb);
393 int i, copy = start - offset;
394 struct sk_buff *frag_iter;
396 /* Copy header. */
397 if (copy > 0) {
398 if (copy > len)
399 copy = len;
400 if (memcpy_toiovecend(to, skb->data + offset, to_offset, copy))
401 goto fault;
402 if ((len -= copy) == 0)
403 return 0;
404 offset += copy;
405 to_offset += copy;
408 /* Copy paged appendix. Hmm... why does this look so complicated? */
409 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
410 int end;
412 WARN_ON(start > offset + len);
414 end = start + skb_shinfo(skb)->frags[i].size;
415 if ((copy = end - offset) > 0) {
416 int err;
417 u8 *vaddr;
418 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
419 struct page *page = frag->page;
421 if (copy > len)
422 copy = len;
423 vaddr = kmap(page);
424 err = memcpy_toiovecend(to, vaddr + frag->page_offset +
425 offset - start, to_offset, copy);
426 kunmap(page);
427 if (err)
428 goto fault;
429 if (!(len -= copy))
430 return 0;
431 offset += copy;
432 to_offset += copy;
434 start = end;
437 skb_walk_frags(skb, frag_iter) {
438 int end;
440 WARN_ON(start > offset + len);
442 end = start + frag_iter->len;
443 if ((copy = end - offset) > 0) {
444 if (copy > len)
445 copy = len;
446 if (skb_copy_datagram_const_iovec(frag_iter,
447 offset - start,
448 to, to_offset,
449 copy))
450 goto fault;
451 if ((len -= copy) == 0)
452 return 0;
453 offset += copy;
454 to_offset += copy;
456 start = end;
458 if (!len)
459 return 0;
461 fault:
462 return -EFAULT;
464 EXPORT_SYMBOL(skb_copy_datagram_const_iovec);
467 * skb_copy_datagram_from_iovec - Copy a datagram from an iovec.
468 * @skb: buffer to copy
469 * @offset: offset in the buffer to start copying to
470 * @from: io vector to copy to
471 * @from_offset: offset in the io vector to start copying from
472 * @len: amount of data to copy to buffer from iovec
474 * Returns 0 or -EFAULT.
475 * Note: the iovec is not modified during the copy.
477 int skb_copy_datagram_from_iovec(struct sk_buff *skb, int offset,
478 const struct iovec *from, int from_offset,
479 int len)
481 int start = skb_headlen(skb);
482 int i, copy = start - offset;
483 struct sk_buff *frag_iter;
485 /* Copy header. */
486 if (copy > 0) {
487 if (copy > len)
488 copy = len;
489 if (memcpy_fromiovecend(skb->data + offset, from, from_offset,
490 copy))
491 goto fault;
492 if ((len -= copy) == 0)
493 return 0;
494 offset += copy;
495 from_offset += copy;
498 /* Copy paged appendix. Hmm... why does this look so complicated? */
499 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
500 int end;
502 WARN_ON(start > offset + len);
504 end = start + skb_shinfo(skb)->frags[i].size;
505 if ((copy = end - offset) > 0) {
506 int err;
507 u8 *vaddr;
508 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
509 struct page *page = frag->page;
511 if (copy > len)
512 copy = len;
513 vaddr = kmap(page);
514 err = memcpy_fromiovecend(vaddr + frag->page_offset +
515 offset - start,
516 from, from_offset, copy);
517 kunmap(page);
518 if (err)
519 goto fault;
521 if (!(len -= copy))
522 return 0;
523 offset += copy;
524 from_offset += copy;
526 start = end;
529 skb_walk_frags(skb, frag_iter) {
530 int end;
532 WARN_ON(start > offset + len);
534 end = start + frag_iter->len;
535 if ((copy = end - offset) > 0) {
536 if (copy > len)
537 copy = len;
538 if (skb_copy_datagram_from_iovec(frag_iter,
539 offset - start,
540 from,
541 from_offset,
542 copy))
543 goto fault;
544 if ((len -= copy) == 0)
545 return 0;
546 offset += copy;
547 from_offset += copy;
549 start = end;
551 if (!len)
552 return 0;
554 fault:
555 return -EFAULT;
557 EXPORT_SYMBOL(skb_copy_datagram_from_iovec);
559 static int skb_copy_and_csum_datagram(const struct sk_buff *skb, int offset,
560 u8 __user *to, int len,
561 __wsum *csump)
563 int start = skb_headlen(skb);
564 int i, copy = start - offset;
565 struct sk_buff *frag_iter;
566 int pos = 0;
568 /* Copy header. */
569 if (copy > 0) {
570 int err = 0;
571 if (copy > len)
572 copy = len;
573 *csump = csum_and_copy_to_user(skb->data + offset, to, copy,
574 *csump, &err);
575 if (err)
576 goto fault;
577 if ((len -= copy) == 0)
578 return 0;
579 offset += copy;
580 to += copy;
581 pos = copy;
584 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
585 int end;
587 WARN_ON(start > offset + len);
589 end = start + skb_shinfo(skb)->frags[i].size;
590 if ((copy = end - offset) > 0) {
591 __wsum csum2;
592 int err = 0;
593 u8 *vaddr;
594 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
595 struct page *page = frag->page;
597 if (copy > len)
598 copy = len;
599 vaddr = kmap(page);
600 csum2 = csum_and_copy_to_user(vaddr +
601 frag->page_offset +
602 offset - start,
603 to, copy, 0, &err);
604 kunmap(page);
605 if (err)
606 goto fault;
607 *csump = csum_block_add(*csump, csum2, pos);
608 if (!(len -= copy))
609 return 0;
610 offset += copy;
611 to += copy;
612 pos += copy;
614 start = end;
617 skb_walk_frags(skb, frag_iter) {
618 int end;
620 WARN_ON(start > offset + len);
622 end = start + frag_iter->len;
623 if ((copy = end - offset) > 0) {
624 __wsum csum2 = 0;
625 if (copy > len)
626 copy = len;
627 if (skb_copy_and_csum_datagram(frag_iter,
628 offset - start,
629 to, copy,
630 &csum2))
631 goto fault;
632 *csump = csum_block_add(*csump, csum2, pos);
633 if ((len -= copy) == 0)
634 return 0;
635 offset += copy;
636 to += copy;
637 pos += copy;
639 start = end;
641 if (!len)
642 return 0;
644 fault:
645 return -EFAULT;
648 __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len)
650 __sum16 sum;
652 sum = csum_fold(skb_checksum(skb, 0, len, skb->csum));
653 if (likely(!sum)) {
654 if (unlikely(skb->ip_summed == CHECKSUM_COMPLETE))
655 netdev_rx_csum_fault(skb->dev);
656 skb->ip_summed = CHECKSUM_UNNECESSARY;
658 return sum;
660 EXPORT_SYMBOL(__skb_checksum_complete_head);
662 __sum16 __skb_checksum_complete(struct sk_buff *skb)
664 return __skb_checksum_complete_head(skb, skb->len);
666 EXPORT_SYMBOL(__skb_checksum_complete);
669 * skb_copy_and_csum_datagram_iovec - Copy and checkum skb to user iovec.
670 * @skb: skbuff
671 * @hlen: hardware length
672 * @iov: io vector
674 * Caller _must_ check that skb will fit to this iovec.
676 * Returns: 0 - success.
677 * -EINVAL - checksum failure.
678 * -EFAULT - fault during copy. Beware, in this case iovec
679 * can be modified!
681 int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
682 int hlen, struct iovec *iov)
684 __wsum csum;
685 int chunk = skb->len - hlen;
687 if (!chunk)
688 return 0;
690 /* Skip filled elements.
691 * Pretty silly, look at memcpy_toiovec, though 8)
693 while (!iov->iov_len)
694 iov++;
696 if (iov->iov_len < chunk) {
697 if (__skb_checksum_complete(skb))
698 goto csum_error;
699 if (skb_copy_datagram_iovec(skb, hlen, iov, chunk))
700 goto fault;
701 } else {
702 csum = csum_partial(skb->data, hlen, skb->csum);
703 if (skb_copy_and_csum_datagram(skb, hlen, iov->iov_base,
704 chunk, &csum))
705 goto fault;
706 if (csum_fold(csum))
707 goto csum_error;
708 if (unlikely(skb->ip_summed == CHECKSUM_COMPLETE))
709 netdev_rx_csum_fault(skb->dev);
710 iov->iov_len -= chunk;
711 iov->iov_base += chunk;
713 return 0;
714 csum_error:
715 return -EINVAL;
716 fault:
717 return -EFAULT;
721 * datagram_poll - generic datagram poll
722 * @file: file struct
723 * @sock: socket
724 * @wait: poll table
726 * Datagram poll: Again totally generic. This also handles
727 * sequenced packet sockets providing the socket receive queue
728 * is only ever holding data ready to receive.
730 * Note: when you _don't_ use this routine for this protocol,
731 * and you use a different write policy from sock_writeable()
732 * then please supply your own write_space callback.
734 unsigned int datagram_poll(struct file *file, struct socket *sock,
735 poll_table *wait)
737 struct sock *sk = sock->sk;
738 unsigned int mask;
740 sock_poll_wait(file, sk_sleep(sk), wait);
741 mask = 0;
743 /* exceptional events? */
744 if (sk->sk_err || !skb_queue_empty(&sk->sk_error_queue))
745 mask |= POLLERR;
746 if (sk->sk_shutdown & RCV_SHUTDOWN)
747 mask |= POLLRDHUP;
748 if (sk->sk_shutdown == SHUTDOWN_MASK)
749 mask |= POLLHUP;
751 /* readable? */
752 if (!skb_queue_empty(&sk->sk_receive_queue) ||
753 (sk->sk_shutdown & RCV_SHUTDOWN))
754 mask |= POLLIN | POLLRDNORM;
756 /* Connection-based need to check for termination and startup */
757 if (connection_based(sk)) {
758 if (sk->sk_state == TCP_CLOSE)
759 mask |= POLLHUP;
760 /* connection hasn't started yet? */
761 if (sk->sk_state == TCP_SYN_SENT)
762 return mask;
765 /* writable? */
766 if (sock_writeable(sk))
767 mask |= POLLOUT | POLLWRNORM | POLLWRBAND;
768 else
769 set_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
771 return mask;
774 EXPORT_SYMBOL(datagram_poll);
775 EXPORT_SYMBOL(skb_copy_and_csum_datagram_iovec);
776 EXPORT_SYMBOL(skb_copy_datagram_iovec);
777 EXPORT_SYMBOL(skb_recv_datagram);