allow coexistance of N build and AC build.
[tomato.git] / release / src-rt-6.x / linux / linux-2.6 / net / core / datagram.c
blobe932ec34e7765a52193f95c8c9bb7f7374f083c5
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@redhat.com>. (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>
52 #include <net/protocol.h>
53 #include <linux/skbuff.h>
55 #include <net/checksum.h>
56 #include <net/sock.h>
57 #include <net/tcp_states.h>
60 * Is a socket 'connection oriented' ?
62 static inline int connection_based(struct sock *sk)
64 return sk->sk_type == SOCK_SEQPACKET || sk->sk_type == SOCK_STREAM;
68 * Wait for a packet..
70 static int wait_for_packet(struct sock *sk, int *err, long *timeo_p)
72 int error;
73 DEFINE_WAIT(wait);
75 prepare_to_wait_exclusive(sk->sk_sleep, &wait, TASK_INTERRUPTIBLE);
77 /* Socket errors? */
78 error = sock_error(sk);
79 if (error)
80 goto out_err;
82 if (!skb_queue_empty(&sk->sk_receive_queue))
83 goto out;
85 /* Socket shut down? */
86 if (sk->sk_shutdown & RCV_SHUTDOWN)
87 goto out_noerr;
89 /* Sequenced packets can come disconnected.
90 * If so we report the problem
92 error = -ENOTCONN;
93 if (connection_based(sk) &&
94 !(sk->sk_state == TCP_ESTABLISHED || sk->sk_state == TCP_LISTEN))
95 goto out_err;
97 /* handle signals */
98 if (signal_pending(current))
99 goto interrupted;
101 error = 0;
102 *timeo_p = schedule_timeout(*timeo_p);
103 out:
104 finish_wait(sk->sk_sleep, &wait);
105 return error;
106 interrupted:
107 error = sock_intr_errno(*timeo_p);
108 out_err:
109 *err = error;
110 goto out;
111 out_noerr:
112 *err = 0;
113 error = 1;
114 goto out;
118 * skb_recv_datagram - Receive a datagram skbuff
119 * @sk: socket
120 * @flags: MSG_ flags
121 * @noblock: blocking operation?
122 * @err: error code returned
124 * Get a datagram skbuff, understands the peeking, nonblocking wakeups
125 * and possible races. This replaces identical code in packet, raw and
126 * udp, as well as the IPX AX.25 and Appletalk. It also finally fixes
127 * the long standing peek and read race for datagram sockets. If you
128 * alter this routine remember it must be re-entrant.
130 * This function will lock the socket if a skb is returned, so the caller
131 * needs to unlock the socket in that case (usually by calling
132 * skb_free_datagram)
134 * * It does not lock socket since today. This function is
135 * * free of race conditions. This measure should/can improve
136 * * significantly datagram socket latencies at high loads,
137 * * when data copying to user space takes lots of time.
138 * * (BTW I've just killed the last cli() in IP/IPv6/core/netlink/packet
139 * * 8) Great win.)
140 * * --ANK (980729)
142 * The order of the tests when we find no data waiting are specified
143 * quite explicitly by POSIX 1003.1g, don't change them without having
144 * the standard around please.
146 struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
147 int noblock, int *err)
149 struct sk_buff *skb;
150 long timeo;
152 * Caller is allowed not to check sk->sk_err before skb_recv_datagram()
154 int error = sock_error(sk);
156 if (error)
157 goto no_packet;
159 timeo = sock_rcvtimeo(sk, noblock);
161 do {
162 /* Again only user level code calls this function, so nothing
163 * interrupt level will suddenly eat the receive_queue.
165 * Look at current nfs client by the way...
166 * However, this function was corrent in any case. 8)
168 if (flags & MSG_PEEK) {
169 unsigned long cpu_flags;
171 spin_lock_irqsave(&sk->sk_receive_queue.lock,
172 cpu_flags);
173 skb = skb_peek(&sk->sk_receive_queue);
174 if (skb)
175 atomic_inc(&skb->users);
176 spin_unlock_irqrestore(&sk->sk_receive_queue.lock,
177 cpu_flags);
178 } else
179 skb = skb_dequeue(&sk->sk_receive_queue);
181 if (skb)
182 return skb;
184 /* User doesn't want to wait */
185 error = -EAGAIN;
186 if (!timeo)
187 goto no_packet;
189 } while (!wait_for_packet(sk, err, &timeo));
191 return NULL;
193 no_packet:
194 *err = error;
195 return NULL;
198 void skb_free_datagram(struct sock *sk, struct sk_buff *skb)
200 kfree_skb(skb);
202 EXPORT_SYMBOL(skb_free_datagram);
204 void skb_free_datagram_locked(struct sock *sk, struct sk_buff *skb)
206 lock_sock(sk);
207 skb_free_datagram(sk, skb);
208 release_sock(sk);
210 EXPORT_SYMBOL(skb_free_datagram_locked);
213 * skb_kill_datagram - Free a datagram skbuff forcibly
214 * @sk: socket
215 * @skb: datagram skbuff
216 * @flags: MSG_ flags
218 * This function frees a datagram skbuff that was received by
219 * skb_recv_datagram. The flags argument must match the one
220 * used for skb_recv_datagram.
222 * If the MSG_PEEK flag is set, and the packet is still on the
223 * receive queue of the socket, it will be taken off the queue
224 * before it is freed.
226 * This function currently only disables BH when acquiring the
227 * sk_receive_queue lock. Therefore it must not be used in a
228 * context where that lock is acquired in an IRQ context.
231 void skb_kill_datagram(struct sock *sk, struct sk_buff *skb, unsigned int flags)
233 if (flags & MSG_PEEK) {
234 spin_lock_bh(&sk->sk_receive_queue.lock);
235 if (skb == skb_peek(&sk->sk_receive_queue)) {
236 __skb_unlink(skb, &sk->sk_receive_queue);
237 atomic_dec(&skb->users);
239 spin_unlock_bh(&sk->sk_receive_queue.lock);
242 kfree_skb(skb);
245 EXPORT_SYMBOL(skb_kill_datagram);
248 * skb_copy_datagram_iovec - Copy a datagram to an iovec.
249 * @skb: buffer to copy
250 * @offset: offset in the buffer to start copying from
251 * @to: io vector to copy to
252 * @len: amount of data to copy from buffer to iovec
254 * Note: the iovec is modified during the copy.
256 int skb_copy_datagram_iovec(const struct sk_buff *skb, int offset,
257 struct iovec *to, int len)
259 int start = skb_headlen(skb);
260 int i, copy = start - offset;
262 /* Copy header. */
263 if (copy > 0) {
264 if (copy > len)
265 copy = len;
266 if (memcpy_toiovec(to, skb->data + offset, copy))
267 goto fault;
268 if ((len -= copy) == 0)
269 return 0;
270 offset += copy;
273 /* Copy paged appendix. Hmm... why does this look so complicated? */
274 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
275 int end;
277 BUG_TRAP(start <= offset + len);
279 end = start + skb_shinfo(skb)->frags[i].size;
280 if ((copy = end - offset) > 0) {
281 int err;
282 u8 *vaddr;
283 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
284 struct page *page = frag->page;
286 if (copy > len)
287 copy = len;
288 vaddr = kmap(page);
289 err = memcpy_toiovec(to, vaddr + frag->page_offset +
290 offset - start, copy);
291 kunmap(page);
292 if (err)
293 goto fault;
294 if (!(len -= copy))
295 return 0;
296 offset += copy;
298 start = end;
301 if (skb_shinfo(skb)->frag_list) {
302 struct sk_buff *list = skb_shinfo(skb)->frag_list;
304 for (; list; list = list->next) {
305 int end;
307 BUG_TRAP(start <= offset + len);
309 end = start + list->len;
310 if ((copy = end - offset) > 0) {
311 if (copy > len)
312 copy = len;
313 if (skb_copy_datagram_iovec(list,
314 offset - start,
315 to, copy))
316 goto fault;
317 if ((len -= copy) == 0)
318 return 0;
319 offset += copy;
321 start = end;
324 if (!len)
325 return 0;
327 fault:
328 return -EFAULT;
331 static int skb_copy_and_csum_datagram(const struct sk_buff *skb, int offset,
332 u8 __user *to, int len,
333 __wsum *csump)
335 int start = skb_headlen(skb);
336 int pos = 0;
337 int i, copy = start - offset;
339 /* Copy header. */
340 if (copy > 0) {
341 int err = 0;
342 if (copy > len)
343 copy = len;
344 *csump = csum_and_copy_to_user(skb->data + offset, to, copy,
345 *csump, &err);
346 if (err)
347 goto fault;
348 if ((len -= copy) == 0)
349 return 0;
350 offset += copy;
351 to += copy;
352 pos = copy;
355 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
356 int end;
358 BUG_TRAP(start <= offset + len);
360 end = start + skb_shinfo(skb)->frags[i].size;
361 if ((copy = end - offset) > 0) {
362 __wsum csum2;
363 int err = 0;
364 u8 *vaddr;
365 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
366 struct page *page = frag->page;
368 if (copy > len)
369 copy = len;
370 vaddr = kmap(page);
371 csum2 = csum_and_copy_to_user(vaddr +
372 frag->page_offset +
373 offset - start,
374 to, copy, 0, &err);
375 kunmap(page);
376 if (err)
377 goto fault;
378 *csump = csum_block_add(*csump, csum2, pos);
379 if (!(len -= copy))
380 return 0;
381 offset += copy;
382 to += copy;
383 pos += copy;
385 start = end;
388 if (skb_shinfo(skb)->frag_list) {
389 struct sk_buff *list = skb_shinfo(skb)->frag_list;
391 for (; list; list=list->next) {
392 int end;
394 BUG_TRAP(start <= offset + len);
396 end = start + list->len;
397 if ((copy = end - offset) > 0) {
398 __wsum csum2 = 0;
399 if (copy > len)
400 copy = len;
401 if (skb_copy_and_csum_datagram(list,
402 offset - start,
403 to, copy,
404 &csum2))
405 goto fault;
406 *csump = csum_block_add(*csump, csum2, pos);
407 if ((len -= copy) == 0)
408 return 0;
409 offset += copy;
410 to += copy;
411 pos += copy;
413 start = end;
416 if (!len)
417 return 0;
419 fault:
420 return -EFAULT;
423 __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len)
425 __sum16 sum;
427 sum = csum_fold(skb_checksum(skb, 0, len, skb->csum));
428 if (likely(!sum)) {
429 if (unlikely(skb->ip_summed == CHECKSUM_COMPLETE))
430 netdev_rx_csum_fault(skb->dev);
431 skb->ip_summed = CHECKSUM_UNNECESSARY;
433 return sum;
435 EXPORT_SYMBOL(__skb_checksum_complete_head);
437 __sum16 __skb_checksum_complete(struct sk_buff *skb)
439 return __skb_checksum_complete_head(skb, skb->len);
441 EXPORT_SYMBOL(__skb_checksum_complete);
444 * skb_copy_and_csum_datagram_iovec - Copy and checkum skb to user iovec.
445 * @skb: skbuff
446 * @hlen: hardware length
447 * @iov: io vector
449 * Caller _must_ check that skb will fit to this iovec.
451 * Returns: 0 - success.
452 * -EINVAL - checksum failure.
453 * -EFAULT - fault during copy. Beware, in this case iovec
454 * can be modified!
456 int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
457 int hlen, struct iovec *iov)
459 __wsum csum;
460 int chunk = skb->len - hlen;
462 if (!chunk)
463 return 0;
465 /* Skip filled elements.
466 * Pretty silly, look at memcpy_toiovec, though 8)
468 while (!iov->iov_len)
469 iov++;
471 if (iov->iov_len < chunk) {
472 if (__skb_checksum_complete(skb))
473 goto csum_error;
474 if (skb_copy_datagram_iovec(skb, hlen, iov, chunk))
475 goto fault;
476 } else {
477 csum = csum_partial(skb->data, hlen, skb->csum);
478 if (skb_copy_and_csum_datagram(skb, hlen, iov->iov_base,
479 chunk, &csum))
480 goto fault;
481 if (csum_fold(csum))
482 goto csum_error;
483 if (unlikely(skb->ip_summed == CHECKSUM_COMPLETE))
484 netdev_rx_csum_fault(skb->dev);
485 iov->iov_len -= chunk;
486 iov->iov_base += chunk;
488 return 0;
489 csum_error:
490 return -EINVAL;
491 fault:
492 return -EFAULT;
496 * datagram_poll - generic datagram poll
497 * @file: file struct
498 * @sock: socket
499 * @wait: poll table
501 * Datagram poll: Again totally generic. This also handles
502 * sequenced packet sockets providing the socket receive queue
503 * is only ever holding data ready to receive.
505 * Note: when you _don't_ use this routine for this protocol,
506 * and you use a different write policy from sock_writeable()
507 * then please supply your own write_space callback.
509 unsigned int datagram_poll(struct file *file, struct socket *sock,
510 poll_table *wait)
512 struct sock *sk = sock->sk;
513 unsigned int mask;
515 poll_wait(file, sk->sk_sleep, wait);
516 mask = 0;
518 /* exceptional events? */
519 if (sk->sk_err || !skb_queue_empty(&sk->sk_error_queue))
520 mask |= POLLERR;
521 if (sk->sk_shutdown & RCV_SHUTDOWN)
522 mask |= POLLRDHUP | POLLIN | POLLRDNORM;
523 if (sk->sk_shutdown == SHUTDOWN_MASK)
524 mask |= POLLHUP;
526 /* readable? */
527 if (!skb_queue_empty(&sk->sk_receive_queue))
528 mask |= POLLIN | POLLRDNORM;
530 /* Connection-based need to check for termination and startup */
531 if (connection_based(sk)) {
532 if (sk->sk_state == TCP_CLOSE)
533 mask |= POLLHUP;
534 /* connection hasn't started yet? */
535 if (sk->sk_state == TCP_SYN_SENT)
536 return mask;
539 /* writable? */
540 if (sock_writeable(sk))
541 mask |= POLLOUT | POLLWRNORM | POLLWRBAND;
542 else
543 set_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
545 return mask;
548 EXPORT_SYMBOL(datagram_poll);
549 EXPORT_SYMBOL(skb_copy_and_csum_datagram_iovec);
550 EXPORT_SYMBOL(skb_copy_datagram_iovec);
551 EXPORT_SYMBOL(skb_recv_datagram);