2 * Copyright (c) 2004 Jeffrey M. Hsu. All rights reserved.
3 * Copyright (c) 2004 The DragonFly Project. All rights reserved.
5 * This code is derived from software contributed to The DragonFly Project
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of The DragonFly Project nor the names of its
17 * contributors may be used to endorse or promote products derived
18 * from this software without specific, prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
24 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
25 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
27 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
28 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
29 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
30 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * Copyright (c) 2004 Jeffrey M. Hsu. All rights reserved.
37 * License terms: all terms for the DragonFly license above plus the following:
39 * 4. All advertising materials mentioning features or use of this software
40 * must display the following acknowledgement:
42 * This product includes software developed by Jeffrey M. Hsu
43 * for the DragonFly Project.
45 * This requirement may be waived with permission from Jeffrey Hsu.
46 * This requirement will sunset and may be removed on July 8 2005,
47 * after which the standard DragonFly license (as shown above) will
52 * Copyright (c) 1982, 1986, 1988, 1990, 1993
53 * The Regents of the University of California. All rights reserved.
55 * Redistribution and use in source and binary forms, with or without
56 * modification, are permitted provided that the following conditions
58 * 1. Redistributions of source code must retain the above copyright
59 * notice, this list of conditions and the following disclaimer.
60 * 2. Redistributions in binary form must reproduce the above copyright
61 * notice, this list of conditions and the following disclaimer in the
62 * documentation and/or other materials provided with the distribution.
63 * 3. All advertising materials mentioning features or use of this software
64 * must display the following acknowledgement:
65 * This product includes software developed by the University of
66 * California, Berkeley and its contributors.
67 * 4. Neither the name of the University nor the names of its contributors
68 * may be used to endorse or promote products derived from this software
69 * without specific prior written permission.
71 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
72 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
73 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
74 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
75 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
76 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
77 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
78 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
79 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
80 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
83 * @(#)uipc_socket.c 8.3 (Berkeley) 4/15/94
84 * $FreeBSD: src/sys/kern/uipc_socket.c,v 1.68.2.24 2003/11/11 17:18:18 silby Exp $
85 * $DragonFly: src/sys/kern/uipc_socket.c,v 1.38 2006/06/13 08:12:03 dillon Exp $
91 #include <sys/param.h>
92 #include <sys/systm.h>
93 #include <sys/fcntl.h>
94 #include <sys/malloc.h>
96 #include <sys/domain.h>
97 #include <sys/file.h> /* for struct knote */
98 #include <sys/kernel.h>
99 #include <sys/malloc.h>
100 #include <sys/event.h>
101 #include <sys/poll.h>
102 #include <sys/proc.h>
103 #include <sys/protosw.h>
104 #include <sys/socket.h>
105 #include <sys/socketvar.h>
106 #include <sys/socketops.h>
107 #include <sys/resourcevar.h>
108 #include <sys/signalvar.h>
109 #include <sys/sysctl.h>
111 #include <sys/jail.h>
112 #include <vm/vm_zone.h>
114 #include <sys/thread2.h>
116 #include <machine/limits.h>
119 static int do_setopt_accept_filter(struct socket *so, struct sockopt *sopt);
122 static void filt_sordetach(struct knote *kn);
123 static int filt_soread(struct knote *kn, long hint);
124 static void filt_sowdetach(struct knote *kn);
125 static int filt_sowrite(struct knote *kn, long hint);
126 static int filt_solisten(struct knote *kn, long hint);
128 static struct filterops solisten_filtops =
129 { 1, NULL, filt_sordetach, filt_solisten };
130 static struct filterops soread_filtops =
131 { 1, NULL, filt_sordetach, filt_soread };
132 static struct filterops sowrite_filtops =
133 { 1, NULL, filt_sowdetach, filt_sowrite };
135 struct vm_zone *socket_zone;
137 MALLOC_DEFINE(M_SONAME, "soname", "socket name");
138 MALLOC_DEFINE(M_PCB, "pcb", "protocol control block");
141 static int somaxconn = SOMAXCONN;
142 SYSCTL_INT(_kern_ipc, KIPC_SOMAXCONN, somaxconn, CTLFLAG_RW,
143 &somaxconn, 0, "Maximum pending socket connection queue size");
146 * Socket operation routines.
147 * These routines are called by the routines in
148 * sys_socket.c or from a system process, and
149 * implement the semantics of socket operations by
150 * switching out to the protocol specific routines.
154 * Get a socket structure from our zone, and initialize it.
155 * We don't implement `waitok' yet (see comments in uipc_domain.c).
156 * Note that it would probably be better to allocate socket
157 * and PCB at the same time, but I'm not convinced that all
158 * the protocols can be easily modified to do this.
166 so = zalloc(socket_zone);
168 /* XXX race condition for reentrant kernel */
169 bzero(so, sizeof *so);
170 TAILQ_INIT(&so->so_aiojobq);
171 TAILQ_INIT(&so->so_rcv.sb_sel.si_mlist);
172 TAILQ_INIT(&so->so_snd.sb_sel.si_mlist);
178 socreate(int dom, struct socket **aso, int type,
179 int proto, struct thread *td)
181 struct proc *p = td->td_proc;
184 struct pru_attach_info ai;
188 prp = pffindproto(dom, proto, type);
190 prp = pffindtype(dom, type);
192 if (prp == 0 || prp->pr_usrreqs->pru_attach == 0)
193 return (EPROTONOSUPPORT);
195 if (p->p_ucred->cr_prison && jail_socket_unixiproute_only &&
196 prp->pr_domain->dom_family != PF_LOCAL &&
197 prp->pr_domain->dom_family != PF_INET &&
198 prp->pr_domain->dom_family != PF_ROUTE) {
199 return (EPROTONOSUPPORT);
202 if (prp->pr_type != type)
204 so = soalloc(p != 0);
208 TAILQ_INIT(&so->so_incomp);
209 TAILQ_INIT(&so->so_comp);
211 so->so_cred = crhold(p->p_ucred);
213 ai.sb_rlimit = &p->p_rlimit[RLIMIT_SBSIZE];
214 ai.p_ucred = p->p_ucred;
215 ai.fd_rdir = p->p_fd->fd_rdir;
216 error = so_pru_attach(so, proto, &ai);
218 so->so_state |= SS_NOFDREF;
227 sobind(struct socket *so, struct sockaddr *nam, struct thread *td)
232 error = so_pru_bind(so, nam, td);
238 sodealloc(struct socket *so)
240 if (so->so_rcv.sb_hiwat)
241 (void)chgsbsize(so->so_cred->cr_uidinfo,
242 &so->so_rcv.sb_hiwat, 0, RLIM_INFINITY);
243 if (so->so_snd.sb_hiwat)
244 (void)chgsbsize(so->so_cred->cr_uidinfo,
245 &so->so_snd.sb_hiwat, 0, RLIM_INFINITY);
247 /* remove accept filter if present */
248 if (so->so_accf != NULL)
249 do_setopt_accept_filter(so, NULL);
252 zfree(socket_zone, so);
256 solisten(struct socket *so, int backlog, struct thread *td)
260 short oldopt, oldqlimit;
264 if (so->so_state & (SS_ISCONNECTED | SS_ISCONNECTING)) {
270 oldopt = so->so_options;
271 oldqlimit = so->so_qlimit;
274 if (TAILQ_EMPTY(&so->so_comp))
275 so->so_options |= SO_ACCEPTCONN;
276 if (backlog < 0 || backlog > somaxconn)
278 so->so_qlimit = backlog;
279 /* SCTP needs to look at tweak both the inbound backlog parameter AND
280 * the so_options (UDP model both connect's and gets inbound
281 * connections .. implicitly).
283 error = so_pru_listen(so, td);
286 /* Restore the params */
287 so->so_options = oldopt;
288 so->so_qlimit = oldqlimit;
298 sofree(struct socket *so)
300 struct socket *head = so->so_head;
302 if (so->so_pcb || (so->so_state & SS_NOFDREF) == 0)
305 if (so->so_state & SS_INCOMP) {
306 TAILQ_REMOVE(&head->so_incomp, so, so_list);
308 } else if (so->so_state & SS_COMP) {
310 * We must not decommission a socket that's
311 * on the accept(2) queue. If we do, then
312 * accept(2) may hang after select(2) indicated
313 * that the listening socket was ready.
317 panic("sofree: not queued");
319 so->so_state &= ~SS_INCOMP;
322 sbrelease(&so->so_snd, so);
328 * Close a socket on last file table reference removal.
329 * Initiate disconnect if connected.
330 * Free socket when disconnect complete.
333 soclose(struct socket *so, int fflag)
338 funsetown(so->so_sigio);
339 if (so->so_pcb == NULL)
341 if (so->so_state & SS_ISCONNECTED) {
342 if ((so->so_state & SS_ISDISCONNECTING) == 0) {
343 error = sodisconnect(so);
347 if (so->so_options & SO_LINGER) {
348 if ((so->so_state & SS_ISDISCONNECTING) &&
351 while (so->so_state & SS_ISCONNECTED) {
352 error = tsleep((caddr_t)&so->so_timeo,
353 PCATCH, "soclos", so->so_linger * hz);
363 error2 = so_pru_detach(so);
368 if (so->so_options & SO_ACCEPTCONN) {
369 struct socket *sp, *sonext;
371 sp = TAILQ_FIRST(&so->so_incomp);
372 for (; sp != NULL; sp = sonext) {
373 sonext = TAILQ_NEXT(sp, so_list);
376 for (sp = TAILQ_FIRST(&so->so_comp); sp != NULL; sp = sonext) {
377 sonext = TAILQ_NEXT(sp, so_list);
378 /* Dequeue from so_comp since sofree() won't do it */
379 TAILQ_REMOVE(&so->so_comp, sp, so_list);
381 sp->so_state &= ~SS_COMP;
386 if (so->so_state & SS_NOFDREF)
387 panic("soclose: NOFDREF");
388 so->so_state |= SS_NOFDREF;
395 * Must be called from a critical section.
403 error = so_pru_abort(so);
412 soaccept(struct socket *so, struct sockaddr **nam)
417 if ((so->so_state & SS_NOFDREF) == 0)
418 panic("soaccept: !NOFDREF");
419 so->so_state &= ~SS_NOFDREF;
420 error = so_pru_accept(so, nam);
426 soconnect(struct socket *so, struct sockaddr *nam, struct thread *td)
430 if (so->so_options & SO_ACCEPTCONN)
434 * If protocol is connection-based, can only connect once.
435 * Otherwise, if connected, try to disconnect first.
436 * This allows user to disconnect by connecting to, e.g.,
439 if (so->so_state & (SS_ISCONNECTED|SS_ISCONNECTING) &&
440 ((so->so_proto->pr_flags & PR_CONNREQUIRED) ||
441 (error = sodisconnect(so)))) {
445 * Prevent accumulated error from previous connection
449 error = so_pru_connect(so, nam, td);
456 soconnect2(struct socket *so1, struct socket *so2)
461 error = so_pru_connect2(so1, so2);
467 sodisconnect(struct socket *so)
472 if ((so->so_state & SS_ISCONNECTED) == 0) {
476 if (so->so_state & SS_ISDISCONNECTING) {
480 error = so_pru_disconnect(so);
486 #define SBLOCKWAIT(f) (((f) & MSG_DONTWAIT) ? M_NOWAIT : M_WAITOK)
489 * If send must go all at once and message is larger than
490 * send buffering, then hard error.
491 * Lock against other senders.
492 * If must go all at once and not enough room now, then
493 * inform user that this would block and do nothing.
494 * Otherwise, if nonblocking, send as much as possible.
495 * The data to be sent is described by "uio" if nonzero,
496 * otherwise by the mbuf chain "top" (which must be null
497 * if uio is not). Data provided in mbuf chain must be small
498 * enough to send all at once.
500 * Returns nonzero on error, timeout or signal; callers
501 * must check for short counts if EINTR/ERESTART are returned.
502 * Data and control buffers are freed on return.
505 sosend(struct socket *so, struct sockaddr *addr, struct uio *uio,
506 struct mbuf *top, struct mbuf *control, int flags,
511 long space, len, resid;
512 int clen = 0, error, dontroute, mlen;
513 int atomic = sosendallatonce(so) || top;
517 resid = uio->uio_resid;
519 resid = top->m_pkthdr.len;
521 * In theory resid should be unsigned.
522 * However, space must be signed, as it might be less than 0
523 * if we over-committed, and we must use a signed comparison
524 * of space and resid. On the other hand, a negative resid
525 * causes us to loop sending 0-length segments to the protocol.
527 * Also check to make sure that MSG_EOR isn't used on SOCK_STREAM
528 * type sockets since that's an error.
530 if (resid < 0 || (so->so_type == SOCK_STREAM && (flags & MSG_EOR))) {
536 (flags & MSG_DONTROUTE) && (so->so_options & SO_DONTROUTE) == 0 &&
537 (so->so_proto->pr_flags & PR_ATOMIC);
538 if (td->td_proc && td->td_proc->p_stats)
539 td->td_proc->p_stats->p_ru.ru_msgsnd++;
541 clen = control->m_len;
542 #define gotoerr(errno) { error = errno; crit_exit(); goto release; }
545 error = sblock(&so->so_snd, SBLOCKWAIT(flags));
550 if (so->so_state & SS_CANTSENDMORE)
553 error = so->so_error;
558 if ((so->so_state & SS_ISCONNECTED) == 0) {
560 * `sendto' and `sendmsg' is allowed on a connection-
561 * based socket if it supports implied connect.
562 * Return ENOTCONN if not connected and no address is
565 if ((so->so_proto->pr_flags & PR_CONNREQUIRED) &&
566 (so->so_proto->pr_flags & PR_IMPLOPCL) == 0) {
567 if ((so->so_state & SS_ISCONFIRMING) == 0 &&
568 !(resid == 0 && clen != 0))
570 } else if (addr == 0)
571 gotoerr(so->so_proto->pr_flags & PR_CONNREQUIRED ?
572 ENOTCONN : EDESTADDRREQ);
574 space = sbspace(&so->so_snd);
577 if ((atomic && resid > so->so_snd.sb_hiwat) ||
578 clen > so->so_snd.sb_hiwat)
580 if (space < resid + clen && uio &&
581 (atomic || space < so->so_snd.sb_lowat || space < clen)) {
582 if (flags & (MSG_FNONBLOCKING|MSG_DONTWAIT))
583 gotoerr(EWOULDBLOCK);
584 sbunlock(&so->so_snd);
585 error = sbwait(&so->so_snd);
597 * Data is prepackaged in "top".
601 top->m_flags |= M_EOR;
603 m = m_getl(resid, MB_WAIT, MT_DATA,
604 top == NULL ? M_PKTHDR : 0, &mlen);
607 m->m_pkthdr.rcvif = (struct ifnet *)0;
609 len = min(min(mlen, resid), space);
610 if (resid < MINCLSIZE) {
612 * For datagram protocols, leave room
613 * for protocol headers in first mbuf.
615 if (atomic && top == 0 && len < mlen)
619 error = uiomove(mtod(m, caddr_t), (int)len, uio);
620 resid = uio->uio_resid;
623 top->m_pkthdr.len += len;
629 top->m_flags |= M_EOR;
632 } while (space > 0 && atomic);
634 so->so_options |= SO_DONTROUTE;
635 if (flags & MSG_OOB) {
636 pru_flags = PRUS_OOB;
637 } else if ((flags & MSG_EOF) &&
638 (so->so_proto->pr_flags & PR_IMPLOPCL) &&
641 * If the user set MSG_EOF, the protocol
642 * understands this flag and nothing left to
643 * send then use PRU_SEND_EOF instead of PRU_SEND.
645 pru_flags = PRUS_EOF;
646 } else if (resid > 0 && space > 0) {
647 /* If there is more to send, set PRUS_MORETOCOME */
648 pru_flags = PRUS_MORETOCOME;
654 * XXX all the SS_CANTSENDMORE checks previously
655 * done could be out of date. We could have recieved
656 * a reset packet in an interrupt or maybe we slept
657 * while doing page faults in uiomove() etc. We could
658 * probably recheck again inside the splnet() protection
659 * here, but there are probably other places that this
660 * also happens. We must rethink this.
662 error = so_pru_send(so, pru_flags, top, addr, control, td);
665 so->so_options &= ~SO_DONTROUTE;
672 } while (resid && space > 0);
676 sbunlock(&so->so_snd);
686 * A specialization of sosend() for UDP based on protocol-specific knowledge:
687 * so->so_proto->pr_flags has the PR_ATOMIC field set. This means that
688 * sosendallatonce() returns true,
689 * the "atomic" variable is true,
690 * and sosendudp() blocks until space is available for the entire send.
691 * so->so_proto->pr_flags does not have the PR_CONNREQUIRED or
692 * PR_IMPLOPCL flags set.
693 * UDP has no out-of-band data.
694 * UDP has no control data.
695 * UDP does not support MSG_EOR.
698 sosendudp(struct socket *so, struct sockaddr *addr, struct uio *uio,
699 struct mbuf *top, struct mbuf *control, int flags, struct thread *td)
702 boolean_t dontroute; /* temporary SO_DONTROUTE setting */
704 if (td->td_proc && td->td_proc->p_stats)
705 td->td_proc->p_stats->p_ru.ru_msgsnd++;
709 KASSERT((uio && !top) || (top && !uio), ("bad arguments to sosendudp"));
710 resid = uio ? uio->uio_resid : top->m_pkthdr.len;
713 error = sblock(&so->so_snd, SBLOCKWAIT(flags));
718 if (so->so_state & SS_CANTSENDMORE)
721 error = so->so_error;
726 if (!(so->so_state & SS_ISCONNECTED) && addr == NULL)
727 gotoerr(EDESTADDRREQ);
728 if (resid > so->so_snd.sb_hiwat)
730 if (uio && sbspace(&so->so_snd) < resid) {
731 if (flags & (MSG_FNONBLOCKING|MSG_DONTWAIT))
732 gotoerr(EWOULDBLOCK);
733 sbunlock(&so->so_snd);
734 error = sbwait(&so->so_snd);
743 top = m_uiomove(uio);
748 dontroute = (flags & MSG_DONTROUTE) && !(so->so_options & SO_DONTROUTE);
750 so->so_options |= SO_DONTROUTE;
752 error = so_pru_send(so, 0, top, addr, NULL, td);
753 top = NULL; /* sent or freed in lower layer */
756 so->so_options &= ~SO_DONTROUTE;
759 sbunlock(&so->so_snd);
767 * Implement receive operations on a socket.
768 * We depend on the way that records are added to the sockbuf
769 * by sbappend*. In particular, each record (mbufs linked through m_next)
770 * must begin with an address if the protocol so specifies,
771 * followed by an optional mbuf or mbufs containing ancillary data,
772 * and then zero or more mbufs of data.
773 * In order to avoid blocking network interrupts for the entire time here,
774 * we exit the critical section while doing the actual copy to user space.
775 * Although the sockbuf is locked, new data may still be appended,
776 * and thus we must maintain consistency of the sockbuf during that time.
778 * The caller may receive the data as a single mbuf chain by supplying
779 * an mbuf **mp0 for use in returning the chain. The uio is then used
780 * only for the count in uio_resid.
783 soreceive(so, psa, uio, mp0, controlp, flagsp)
785 struct sockaddr **psa;
788 struct mbuf **controlp;
791 struct mbuf *m, *n, **mp;
792 struct mbuf *free_chain = NULL;
793 int flags, len, error, offset;
794 struct protosw *pr = so->so_proto;
796 int orig_resid = uio->uio_resid;
804 flags = *flagsp &~ MSG_EOR;
807 if (flags & MSG_OOB) {
808 m = m_get(MB_WAIT, MT_DATA);
811 error = so_pru_rcvoob(so, m, flags & MSG_PEEK);
815 error = uiomove(mtod(m, caddr_t),
816 (int) min(uio->uio_resid, m->m_len), uio);
818 } while (uio->uio_resid && error == 0 && m);
826 if (so->so_state & SS_ISCONFIRMING && uio->uio_resid)
831 error = sblock(&so->so_rcv, SBLOCKWAIT(flags));
835 m = so->so_rcv.sb_mb;
837 * If we have less data than requested, block awaiting more
838 * (subject to any timeout) if:
839 * 1. the current count is less than the low water mark, or
840 * 2. MSG_WAITALL is set, and it is possible to do the entire
841 * receive operation at once if we block (resid <= hiwat).
842 * 3. MSG_DONTWAIT is not set
843 * If MSG_WAITALL is set but resid is larger than the receive buffer,
844 * we have to do the receive in sections, and thus risk returning
845 * a short count if a timeout or signal occurs after we start.
847 if (m == NULL || (((flags & MSG_DONTWAIT) == 0 &&
848 so->so_rcv.sb_cc < uio->uio_resid) &&
849 (so->so_rcv.sb_cc < so->so_rcv.sb_lowat ||
850 ((flags & MSG_WAITALL) && uio->uio_resid <= so->so_rcv.sb_hiwat)) &&
851 m->m_nextpkt == 0 && (pr->pr_flags & PR_ATOMIC) == 0)) {
852 KASSERT(m != NULL || !so->so_rcv.sb_cc, ("receive 1"));
856 error = so->so_error;
857 if ((flags & MSG_PEEK) == 0)
861 if (so->so_state & SS_CANTRCVMORE) {
867 for (; m; m = m->m_next) {
868 if (m->m_type == MT_OOBDATA || (m->m_flags & M_EOR)) {
869 m = so->so_rcv.sb_mb;
873 if ((so->so_state & (SS_ISCONNECTED|SS_ISCONNECTING)) == 0 &&
874 (pr->pr_flags & PR_CONNREQUIRED)) {
878 if (uio->uio_resid == 0)
880 if (flags & (MSG_FNONBLOCKING|MSG_DONTWAIT)) {
884 sbunlock(&so->so_rcv);
885 error = sbwait(&so->so_rcv);
892 if (uio->uio_td && uio->uio_td->td_proc)
893 uio->uio_td->td_proc->p_stats->p_ru.ru_msgrcv++;
896 * note: m should be == sb_mb here. Cache the next record while
897 * cleaning up. Note that calling m_free*() will break out critical
900 KKASSERT(m == so->so_rcv.sb_mb);
903 * Skip any address mbufs prepending the record.
905 if (pr->pr_flags & PR_ADDR) {
906 KASSERT(m->m_type == MT_SONAME, ("receive 1a"));
909 *psa = dup_sockaddr(mtod(m, struct sockaddr *));
910 if (flags & MSG_PEEK)
913 m = sbunlinkmbuf(&so->so_rcv, m, &free_chain);
917 * Skip any control mbufs prepending the record.
920 if (pr->pr_flags & PR_ADDR_OPT) {
922 * For SCTP we may be getting a
923 * whole message OR a partial delivery.
925 if (m && m->m_type == MT_SONAME) {
928 *psa = dup_sockaddr(mtod(m, struct sockaddr *));
929 if (flags & MSG_PEEK)
932 m = sbunlinkmbuf(&so->so_rcv, m, &free_chain);
936 while (m && m->m_type == MT_CONTROL && error == 0) {
937 if (flags & MSG_PEEK) {
939 *controlp = m_copy(m, 0, m->m_len);
940 m = m->m_next; /* XXX race */
943 n = sbunlinkmbuf(&so->so_rcv, m, NULL);
944 if (pr->pr_domain->dom_externalize &&
945 mtod(m, struct cmsghdr *)->cmsg_type ==
947 error = (*pr->pr_domain->dom_externalize)(m);
951 m = sbunlinkmbuf(&so->so_rcv, m, &free_chain);
954 if (controlp && *controlp) {
956 controlp = &(*controlp)->m_next;
965 if (type == MT_OOBDATA)
970 * Copy to the UIO or mbuf return chain (*mp).
974 while (m && uio->uio_resid > 0 && error == 0) {
975 if (m->m_type == MT_OOBDATA) {
976 if (type != MT_OOBDATA)
978 } else if (type == MT_OOBDATA)
981 KASSERT(m->m_type == MT_DATA || m->m_type == MT_HEADER,
983 so->so_state &= ~SS_RCVATMARK;
984 len = uio->uio_resid;
985 if (so->so_oobmark && len > so->so_oobmark - offset)
986 len = so->so_oobmark - offset;
987 if (len > m->m_len - moff)
988 len = m->m_len - moff;
990 * If mp is set, just pass back the mbufs.
991 * Otherwise copy them out via the uio, then free.
992 * Sockbuf must be consistent here (points to current mbuf,
993 * it points to next record) when we drop priority;
994 * we must note any additions to the sockbuf when we
995 * block interrupts again.
999 error = uiomove(mtod(m, caddr_t) + moff, (int)len, uio);
1004 uio->uio_resid -= len;
1008 * Eat the entire mbuf or just a piece of it
1010 if (len == m->m_len - moff) {
1011 if (m->m_flags & M_EOR)
1014 if (m->m_flags & M_NOTIFICATION)
1015 flags |= MSG_NOTIFICATION;
1017 if (flags & MSG_PEEK) {
1022 n = sbunlinkmbuf(&so->so_rcv, m, NULL);
1027 m = sbunlinkmbuf(&so->so_rcv, m, &free_chain);
1031 if (flags & MSG_PEEK) {
1035 *mp = m_copym(m, 0, len, MB_WAIT);
1038 so->so_rcv.sb_cc -= len;
1041 if (so->so_oobmark) {
1042 if ((flags & MSG_PEEK) == 0) {
1043 so->so_oobmark -= len;
1044 if (so->so_oobmark == 0) {
1045 so->so_state |= SS_RCVATMARK;
1050 if (offset == so->so_oobmark)
1054 if (flags & MSG_EOR)
1057 * If the MSG_WAITALL flag is set (for non-atomic socket),
1058 * we must not quit until "uio->uio_resid == 0" or an error
1059 * termination. If a signal/timeout occurs, return
1060 * with a short count but without error.
1061 * Keep sockbuf locked against other readers.
1063 while (flags & MSG_WAITALL && m == NULL &&
1064 uio->uio_resid > 0 && !sosendallatonce(so) &&
1065 so->so_rcv.sb_mb == NULL) {
1066 if (so->so_error || so->so_state & SS_CANTRCVMORE)
1069 * The window might have closed to zero, make
1070 * sure we send an ack now that we've drained
1071 * the buffer or we might end up blocking until
1072 * the idle takes over (5 seconds).
1074 if (pr->pr_flags & PR_WANTRCVD && so->so_pcb)
1075 so_pru_rcvd(so, flags);
1076 error = sbwait(&so->so_rcv);
1078 sbunlock(&so->so_rcv);
1082 m = so->so_rcv.sb_mb;
1087 * If an atomic read was requested but unread data still remains
1088 * in the record, set MSG_TRUNC.
1090 if (m && pr->pr_flags & PR_ATOMIC)
1094 * Cleanup. If an atomic read was requested drop any unread data.
1096 if ((flags & MSG_PEEK) == 0) {
1097 if (m && (pr->pr_flags & PR_ATOMIC))
1098 sbdroprecord(&so->so_rcv);
1099 if ((pr->pr_flags & PR_WANTRCVD) && so->so_pcb)
1100 so_pru_rcvd(so, flags);
1103 if (orig_resid == uio->uio_resid && orig_resid &&
1104 (flags & MSG_EOR) == 0 && (so->so_state & SS_CANTRCVMORE) == 0) {
1105 sbunlock(&so->so_rcv);
1113 sbunlock(&so->so_rcv);
1117 m_freem(free_chain);
1126 if (!(how == SHUT_RD || how == SHUT_WR || how == SHUT_RDWR))
1132 return (so_pru_shutdown(so));
1140 struct sockbuf *sb = &so->so_rcv;
1141 struct protosw *pr = so->so_proto;
1144 sb->sb_flags |= SB_NOINTR;
1145 (void) sblock(sb, M_WAITOK);
1151 bzero((caddr_t)sb, sizeof (*sb));
1152 if (asb.sb_flags & SB_KNOTE) {
1153 sb->sb_sel.si_note = asb.sb_sel.si_note;
1154 sb->sb_flags = SB_KNOTE;
1158 if (pr->pr_flags & PR_RIGHTS && pr->pr_domain->dom_dispose)
1159 (*pr->pr_domain->dom_dispose)(asb.sb_mb);
1160 sbrelease(&asb, so);
1165 do_setopt_accept_filter(so, sopt)
1167 struct sockopt *sopt;
1169 struct accept_filter_arg *afap = NULL;
1170 struct accept_filter *afp;
1171 struct so_accf *af = so->so_accf;
1174 /* do not set/remove accept filters on non listen sockets */
1175 if ((so->so_options & SO_ACCEPTCONN) == 0) {
1180 /* removing the filter */
1183 if (af->so_accept_filter != NULL &&
1184 af->so_accept_filter->accf_destroy != NULL) {
1185 af->so_accept_filter->accf_destroy(so);
1187 if (af->so_accept_filter_str != NULL) {
1188 FREE(af->so_accept_filter_str, M_ACCF);
1193 so->so_options &= ~SO_ACCEPTFILTER;
1196 /* adding a filter */
1197 /* must remove previous filter first */
1202 /* don't put large objects on the kernel stack */
1203 MALLOC(afap, struct accept_filter_arg *, sizeof(*afap), M_TEMP, M_WAITOK);
1204 error = sooptcopyin(sopt, afap, sizeof *afap, sizeof *afap);
1205 afap->af_name[sizeof(afap->af_name)-1] = '\0';
1206 afap->af_arg[sizeof(afap->af_arg)-1] = '\0';
1209 afp = accept_filt_get(afap->af_name);
1214 MALLOC(af, struct so_accf *, sizeof(*af), M_ACCF, M_WAITOK);
1215 bzero(af, sizeof(*af));
1216 if (afp->accf_create != NULL) {
1217 if (afap->af_name[0] != '\0') {
1218 int len = strlen(afap->af_name) + 1;
1220 MALLOC(af->so_accept_filter_str, char *, len, M_ACCF, M_WAITOK);
1221 strcpy(af->so_accept_filter_str, afap->af_name);
1223 af->so_accept_filter_arg = afp->accf_create(so, afap->af_arg);
1224 if (af->so_accept_filter_arg == NULL) {
1225 FREE(af->so_accept_filter_str, M_ACCF);
1232 af->so_accept_filter = afp;
1234 so->so_options |= SO_ACCEPTFILTER;
1243 * Perhaps this routine, and sooptcopyout(), below, ought to come in
1244 * an additional variant to handle the case where the option value needs
1245 * to be some kind of integer, but not a specific size.
1246 * In addition to their use here, these functions are also called by the
1247 * protocol-level pr_ctloutput() routines.
1250 sooptcopyin(sopt, buf, len, minlen)
1251 struct sockopt *sopt;
1259 * If the user gives us more than we wanted, we ignore it,
1260 * but if we don't get the minimum length the caller
1261 * wants, we return EINVAL. On success, sopt->sopt_valsize
1262 * is set to however much we actually retrieved.
1264 if ((valsize = sopt->sopt_valsize) < minlen)
1267 sopt->sopt_valsize = valsize = len;
1269 if (sopt->sopt_td != NULL)
1270 return (copyin(sopt->sopt_val, buf, valsize));
1272 bcopy(sopt->sopt_val, buf, valsize);
1279 struct sockopt *sopt;
1287 sopt->sopt_dir = SOPT_SET;
1288 if (sopt->sopt_level != SOL_SOCKET) {
1289 if (so->so_proto && so->so_proto->pr_ctloutput) {
1290 return (so_pr_ctloutput(so, sopt));
1292 error = ENOPROTOOPT;
1294 switch (sopt->sopt_name) {
1296 case SO_ACCEPTFILTER:
1297 error = do_setopt_accept_filter(so, sopt);
1303 error = sooptcopyin(sopt, &l, sizeof l, sizeof l);
1307 so->so_linger = l.l_linger;
1309 so->so_options |= SO_LINGER;
1311 so->so_options &= ~SO_LINGER;
1317 case SO_USELOOPBACK:
1323 error = sooptcopyin(sopt, &optval, sizeof optval,
1328 so->so_options |= sopt->sopt_name;
1330 so->so_options &= ~sopt->sopt_name;
1337 error = sooptcopyin(sopt, &optval, sizeof optval,
1343 * Values < 1 make no sense for any of these
1344 * options, so disallow them.
1351 switch (sopt->sopt_name) {
1354 if (sbreserve(sopt->sopt_name == SO_SNDBUF ?
1355 &so->so_snd : &so->so_rcv, (u_long)optval,
1357 &curproc->p_rlimit[RLIMIT_SBSIZE]) == 0) {
1364 * Make sure the low-water is never greater than
1368 so->so_snd.sb_lowat =
1369 (optval > so->so_snd.sb_hiwat) ?
1370 so->so_snd.sb_hiwat : optval;
1373 so->so_rcv.sb_lowat =
1374 (optval > so->so_rcv.sb_hiwat) ?
1375 so->so_rcv.sb_hiwat : optval;
1382 error = sooptcopyin(sopt, &tv, sizeof tv,
1387 /* assert(hz > 0); */
1388 if (tv.tv_sec < 0 || tv.tv_sec > SHRT_MAX / hz ||
1389 tv.tv_usec < 0 || tv.tv_usec >= 1000000) {
1393 /* assert(tick > 0); */
1394 /* assert(ULONG_MAX - SHRT_MAX >= 1000000); */
1395 val = (u_long)(tv.tv_sec * hz) + tv.tv_usec / tick;
1396 if (val > SHRT_MAX) {
1400 if (val == 0 && tv.tv_usec != 0)
1403 switch (sopt->sopt_name) {
1405 so->so_snd.sb_timeo = val;
1408 so->so_rcv.sb_timeo = val;
1413 error = ENOPROTOOPT;
1416 if (error == 0 && so->so_proto && so->so_proto->pr_ctloutput) {
1417 (void) so_pr_ctloutput(so, sopt);
1424 /* Helper routine for getsockopt */
1426 sooptcopyout(struct sockopt *sopt, const void *buf, size_t len)
1434 * Documented get behavior is that we always return a value,
1435 * possibly truncated to fit in the user's buffer.
1436 * Traditional behavior is that we always tell the user
1437 * precisely how much we copied, rather than something useful
1438 * like the total amount we had available for her.
1439 * Note that this interface is not idempotent; the entire answer must
1440 * generated ahead of time.
1442 valsize = min(len, sopt->sopt_valsize);
1443 sopt->sopt_valsize = valsize;
1444 if (sopt->sopt_val != 0) {
1445 if (sopt->sopt_td != NULL)
1446 error = copyout(buf, sopt->sopt_val, valsize);
1448 bcopy(buf, sopt->sopt_val, valsize);
1456 struct sockopt *sopt;
1462 struct accept_filter_arg *afap;
1466 sopt->sopt_dir = SOPT_GET;
1467 if (sopt->sopt_level != SOL_SOCKET) {
1468 if (so->so_proto && so->so_proto->pr_ctloutput) {
1469 return (so_pr_ctloutput(so, sopt));
1471 return (ENOPROTOOPT);
1473 switch (sopt->sopt_name) {
1475 case SO_ACCEPTFILTER:
1476 if ((so->so_options & SO_ACCEPTCONN) == 0)
1478 MALLOC(afap, struct accept_filter_arg *, sizeof(*afap),
1480 bzero(afap, sizeof(*afap));
1481 if ((so->so_options & SO_ACCEPTFILTER) != 0) {
1482 strcpy(afap->af_name, so->so_accf->so_accept_filter->accf_name);
1483 if (so->so_accf->so_accept_filter_str != NULL)
1484 strcpy(afap->af_arg, so->so_accf->so_accept_filter_str);
1486 error = sooptcopyout(sopt, afap, sizeof(*afap));
1492 l.l_onoff = so->so_options & SO_LINGER;
1493 l.l_linger = so->so_linger;
1494 error = sooptcopyout(sopt, &l, sizeof l);
1497 case SO_USELOOPBACK:
1506 optval = so->so_options & sopt->sopt_name;
1508 error = sooptcopyout(sopt, &optval, sizeof optval);
1512 optval = so->so_type;
1516 optval = so->so_error;
1521 optval = so->so_snd.sb_hiwat;
1525 optval = so->so_rcv.sb_hiwat;
1529 optval = so->so_snd.sb_lowat;
1533 optval = so->so_rcv.sb_lowat;
1538 optval = (sopt->sopt_name == SO_SNDTIMEO ?
1539 so->so_snd.sb_timeo : so->so_rcv.sb_timeo);
1541 tv.tv_sec = optval / hz;
1542 tv.tv_usec = (optval % hz) * tick;
1543 error = sooptcopyout(sopt, &tv, sizeof tv);
1547 error = ENOPROTOOPT;
1554 /* XXX; prepare mbuf for (__FreeBSD__ < 3) routines. */
1556 soopt_getm(struct sockopt *sopt, struct mbuf **mp)
1558 struct mbuf *m, *m_prev;
1559 int sopt_size = sopt->sopt_valsize, msize;
1561 m = m_getl(sopt_size, sopt->sopt_td ? MB_WAIT : MB_DONTWAIT, MT_DATA,
1565 m->m_len = min(msize, sopt_size);
1566 sopt_size -= m->m_len;
1570 while (sopt_size > 0) {
1571 m = m_getl(sopt_size, sopt->sopt_td ? MB_WAIT : MB_DONTWAIT,
1572 MT_DATA, 0, &msize);
1577 m->m_len = min(msize, sopt_size);
1578 sopt_size -= m->m_len;
1585 /* XXX; copyin sopt data into mbuf chain for (__FreeBSD__ < 3) routines. */
1587 soopt_mcopyin(struct sockopt *sopt, struct mbuf *m)
1589 struct mbuf *m0 = m;
1591 if (sopt->sopt_val == NULL)
1593 while (m != NULL && sopt->sopt_valsize >= m->m_len) {
1594 if (sopt->sopt_td != NULL) {
1597 error = copyin(sopt->sopt_val, mtod(m, char *),
1604 bcopy(sopt->sopt_val, mtod(m, char *), m->m_len);
1605 sopt->sopt_valsize -= m->m_len;
1606 sopt->sopt_val = (caddr_t)sopt->sopt_val + m->m_len;
1609 if (m != NULL) /* should be allocated enoughly at ip6_sooptmcopyin() */
1610 panic("ip6_sooptmcopyin");
1614 /* XXX; copyout mbuf chain data into soopt for (__FreeBSD__ < 3) routines. */
1616 soopt_mcopyout(struct sockopt *sopt, struct mbuf *m)
1618 struct mbuf *m0 = m;
1621 if (sopt->sopt_val == NULL)
1623 while (m != NULL && sopt->sopt_valsize >= m->m_len) {
1624 if (sopt->sopt_td != NULL) {
1627 error = copyout(mtod(m, char *), sopt->sopt_val,
1634 bcopy(mtod(m, char *), sopt->sopt_val, m->m_len);
1635 sopt->sopt_valsize -= m->m_len;
1636 sopt->sopt_val = (caddr_t)sopt->sopt_val + m->m_len;
1637 valsize += m->m_len;
1641 /* enough soopt buffer should be given from user-land */
1645 sopt->sopt_valsize = valsize;
1653 if (so->so_sigio != NULL)
1654 pgsigio(so->so_sigio, SIGURG, 0);
1655 selwakeup(&so->so_rcv.sb_sel);
1659 sopoll(struct socket *so, int events, struct ucred *cred, struct thread *td)
1665 if (events & (POLLIN | POLLRDNORM))
1667 revents |= events & (POLLIN | POLLRDNORM);
1669 if (events & POLLINIGNEOF)
1670 if (so->so_rcv.sb_cc >= so->so_rcv.sb_lowat ||
1671 !TAILQ_EMPTY(&so->so_comp) || so->so_error)
1672 revents |= POLLINIGNEOF;
1674 if (events & (POLLOUT | POLLWRNORM))
1675 if (sowriteable(so))
1676 revents |= events & (POLLOUT | POLLWRNORM);
1678 if (events & (POLLPRI | POLLRDBAND))
1679 if (so->so_oobmark || (so->so_state & SS_RCVATMARK))
1680 revents |= events & (POLLPRI | POLLRDBAND);
1684 (POLLIN | POLLINIGNEOF | POLLPRI | POLLRDNORM |
1686 selrecord(td, &so->so_rcv.sb_sel);
1687 so->so_rcv.sb_flags |= SB_SEL;
1690 if (events & (POLLOUT | POLLWRNORM)) {
1691 selrecord(td, &so->so_snd.sb_sel);
1692 so->so_snd.sb_flags |= SB_SEL;
1701 sokqfilter(struct file *fp, struct knote *kn)
1703 struct socket *so = (struct socket *)kn->kn_fp->f_data;
1706 switch (kn->kn_filter) {
1708 if (so->so_options & SO_ACCEPTCONN)
1709 kn->kn_fop = &solisten_filtops;
1711 kn->kn_fop = &soread_filtops;
1715 kn->kn_fop = &sowrite_filtops;
1723 SLIST_INSERT_HEAD(&sb->sb_sel.si_note, kn, kn_selnext);
1724 sb->sb_flags |= SB_KNOTE;
1730 filt_sordetach(struct knote *kn)
1732 struct socket *so = (struct socket *)kn->kn_fp->f_data;
1735 SLIST_REMOVE(&so->so_rcv.sb_sel.si_note, kn, knote, kn_selnext);
1736 if (SLIST_EMPTY(&so->so_rcv.sb_sel.si_note))
1737 so->so_rcv.sb_flags &= ~SB_KNOTE;
1743 filt_soread(struct knote *kn, long hint)
1745 struct socket *so = (struct socket *)kn->kn_fp->f_data;
1747 kn->kn_data = so->so_rcv.sb_cc;
1748 if (so->so_state & SS_CANTRCVMORE) {
1749 kn->kn_flags |= EV_EOF;
1750 kn->kn_fflags = so->so_error;
1753 if (so->so_error) /* temporary udp error */
1755 if (kn->kn_sfflags & NOTE_LOWAT)
1756 return (kn->kn_data >= kn->kn_sdata);
1757 return (kn->kn_data >= so->so_rcv.sb_lowat);
1761 filt_sowdetach(struct knote *kn)
1763 struct socket *so = (struct socket *)kn->kn_fp->f_data;
1766 SLIST_REMOVE(&so->so_snd.sb_sel.si_note, kn, knote, kn_selnext);
1767 if (SLIST_EMPTY(&so->so_snd.sb_sel.si_note))
1768 so->so_snd.sb_flags &= ~SB_KNOTE;
1774 filt_sowrite(struct knote *kn, long hint)
1776 struct socket *so = (struct socket *)kn->kn_fp->f_data;
1778 kn->kn_data = sbspace(&so->so_snd);
1779 if (so->so_state & SS_CANTSENDMORE) {
1780 kn->kn_flags |= EV_EOF;
1781 kn->kn_fflags = so->so_error;
1784 if (so->so_error) /* temporary udp error */
1786 if (((so->so_state & SS_ISCONNECTED) == 0) &&
1787 (so->so_proto->pr_flags & PR_CONNREQUIRED))
1789 if (kn->kn_sfflags & NOTE_LOWAT)
1790 return (kn->kn_data >= kn->kn_sdata);
1791 return (kn->kn_data >= so->so_snd.sb_lowat);
1796 filt_solisten(struct knote *kn, long hint)
1798 struct socket *so = (struct socket *)kn->kn_fp->f_data;
1800 kn->kn_data = so->so_qlen;
1801 return (! TAILQ_EMPTY(&so->so_comp));