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) 1982, 1986, 1988, 1990, 1993
36 * The Regents of the University of California. All rights reserved.
38 * Redistribution and use in source and binary forms, with or without
39 * modification, are permitted provided that the following conditions
41 * 1. Redistributions of source code must retain the above copyright
42 * notice, this list of conditions and the following disclaimer.
43 * 2. Redistributions in binary form must reproduce the above copyright
44 * notice, this list of conditions and the following disclaimer in the
45 * documentation and/or other materials provided with the distribution.
46 * 3. All advertising materials mentioning features or use of this software
47 * must display the following acknowledgement:
48 * This product includes software developed by the University of
49 * California, Berkeley and its contributors.
50 * 4. Neither the name of the University nor the names of its contributors
51 * may be used to endorse or promote products derived from this software
52 * without specific prior written permission.
54 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
55 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
56 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
57 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
58 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
59 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
61 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
62 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
63 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
66 * @(#)uipc_socket.c 8.3 (Berkeley) 4/15/94
67 * $FreeBSD: src/sys/kern/uipc_socket.c,v 1.68.2.24 2003/11/11 17:18:18 silby Exp $
73 #include <sys/param.h>
74 #include <sys/systm.h>
75 #include <sys/fcntl.h>
76 #include <sys/malloc.h>
78 #include <sys/domain.h>
79 #include <sys/file.h> /* for struct knote */
80 #include <sys/kernel.h>
81 #include <sys/event.h>
83 #include <sys/protosw.h>
84 #include <sys/socket.h>
85 #include <sys/socketvar.h>
86 #include <sys/socketops.h>
87 #include <sys/resourcevar.h>
88 #include <sys/signalvar.h>
89 #include <sys/sysctl.h>
92 #include <vm/vm_zone.h>
95 #include <sys/thread2.h>
96 #include <sys/socketvar2.h>
98 #include <machine/limits.h>
100 extern int tcp_sosnd_agglim;
101 extern int tcp_sosnd_async;
104 static int do_setopt_accept_filter(struct socket *so, struct sockopt *sopt);
107 static void filt_sordetach(struct knote *kn);
108 static int filt_soread(struct knote *kn, long hint);
109 static void filt_sowdetach(struct knote *kn);
110 static int filt_sowrite(struct knote *kn, long hint);
111 static int filt_solisten(struct knote *kn, long hint);
113 static struct filterops solisten_filtops =
114 { FILTEROP_ISFD|FILTEROP_MPSAFE, NULL, filt_sordetach, filt_solisten };
115 static struct filterops soread_filtops =
116 { FILTEROP_ISFD|FILTEROP_MPSAFE, NULL, filt_sordetach, filt_soread };
117 static struct filterops sowrite_filtops =
118 { FILTEROP_ISFD|FILTEROP_MPSAFE, NULL, filt_sowdetach, filt_sowrite };
119 static struct filterops soexcept_filtops =
120 { FILTEROP_ISFD|FILTEROP_MPSAFE, NULL, filt_sordetach, filt_soread };
122 MALLOC_DEFINE(M_SOCKET, "socket", "socket struct");
123 MALLOC_DEFINE(M_SONAME, "soname", "socket name");
124 MALLOC_DEFINE(M_PCB, "pcb", "protocol control block");
127 static int somaxconn = SOMAXCONN;
128 SYSCTL_INT(_kern_ipc, KIPC_SOMAXCONN, somaxconn, CTLFLAG_RW,
129 &somaxconn, 0, "Maximum pending socket connection queue size");
132 * Socket operation routines.
133 * These routines are called by the routines in
134 * sys_socket.c or from a system process, and
135 * implement the semantics of socket operations by
136 * switching out to the protocol specific routines.
140 * Get a socket structure, and initialize it.
141 * Note that it would probably be better to allocate socket
142 * and PCB at the same time, but I'm not convinced that all
143 * the protocols can be easily modified to do this.
151 waitmask = waitok ? M_WAITOK : M_NOWAIT;
152 so = kmalloc(sizeof(struct socket), M_SOCKET, M_ZERO|waitmask);
154 /* XXX race condition for reentrant kernel */
155 TAILQ_INIT(&so->so_aiojobq);
156 TAILQ_INIT(&so->so_rcv.ssb_kq.ki_mlist);
157 TAILQ_INIT(&so->so_snd.ssb_kq.ki_mlist);
158 lwkt_token_init(&so->so_rcv.ssb_token, "rcvtok");
159 lwkt_token_init(&so->so_snd.ssb_token, "sndtok");
160 so->so_state = SS_NOFDREF;
167 socreate(int dom, struct socket **aso, int type,
168 int proto, struct thread *td)
170 struct proc *p = td->td_proc;
173 struct pru_attach_info ai;
177 prp = pffindproto(dom, proto, type);
179 prp = pffindtype(dom, type);
181 if (prp == 0 || prp->pr_usrreqs->pru_attach == 0)
182 return (EPROTONOSUPPORT);
184 if (p->p_ucred->cr_prison && jail_socket_unixiproute_only &&
185 prp->pr_domain->dom_family != PF_LOCAL &&
186 prp->pr_domain->dom_family != PF_INET &&
187 prp->pr_domain->dom_family != PF_INET6 &&
188 prp->pr_domain->dom_family != PF_ROUTE) {
189 return (EPROTONOSUPPORT);
192 if (prp->pr_type != type)
194 so = soalloc(p != 0);
199 * Callers of socreate() presumably will connect up a descriptor
200 * and call soclose() if they cannot. This represents our so_refs
201 * (which should be 1) from soalloc().
203 soclrstate(so, SS_NOFDREF);
206 * Set a default port for protocol processing. No action will occur
207 * on the socket on this port until an inpcb is attached to it and
208 * is able to match incoming packets, or until the socket becomes
209 * available to userland.
211 * We normally default the socket to the protocol thread on cpu 0.
212 * If PR_SYNC_PORT is set (unix domain sockets) there is no protocol
213 * thread and all pr_*()/pru_*() calls are executed synchronously.
215 if (prp->pr_flags & PR_SYNC_PORT)
216 so->so_port = &netisr_sync_port;
218 so->so_port = cpu_portfn(0);
220 TAILQ_INIT(&so->so_incomp);
221 TAILQ_INIT(&so->so_comp);
223 so->so_cred = crhold(p->p_ucred);
225 ai.sb_rlimit = &p->p_rlimit[RLIMIT_SBSIZE];
226 ai.p_ucred = p->p_ucred;
227 ai.fd_rdir = p->p_fd->fd_rdir;
230 * Auto-sizing of socket buffers is managed by the protocols and
231 * the appropriate flags must be set in the pru_attach function.
233 error = so_pru_attach(so, proto, &ai);
235 sosetstate(so, SS_NOFDREF);
236 sofree(so); /* from soalloc */
241 * NOTE: Returns referenced socket.
248 sobind(struct socket *so, struct sockaddr *nam, struct thread *td)
252 error = so_pru_bind(so, nam, td);
257 sodealloc(struct socket *so)
259 if (so->so_rcv.ssb_hiwat)
260 (void)chgsbsize(so->so_cred->cr_uidinfo,
261 &so->so_rcv.ssb_hiwat, 0, RLIM_INFINITY);
262 if (so->so_snd.ssb_hiwat)
263 (void)chgsbsize(so->so_cred->cr_uidinfo,
264 &so->so_snd.ssb_hiwat, 0, RLIM_INFINITY);
266 /* remove accept filter if present */
267 if (so->so_accf != NULL)
268 do_setopt_accept_filter(so, NULL);
275 solisten(struct socket *so, int backlog, struct thread *td)
279 short oldopt, oldqlimit;
282 if (so->so_state & (SS_ISCONNECTED | SS_ISCONNECTING))
286 oldopt = so->so_options;
287 oldqlimit = so->so_qlimit;
290 lwkt_gettoken(&so->so_rcv.ssb_token);
291 if (TAILQ_EMPTY(&so->so_comp))
292 so->so_options |= SO_ACCEPTCONN;
293 lwkt_reltoken(&so->so_rcv.ssb_token);
294 if (backlog < 0 || backlog > somaxconn)
296 so->so_qlimit = backlog;
297 /* SCTP needs to look at tweak both the inbound backlog parameter AND
298 * the so_options (UDP model both connect's and gets inbound
299 * connections .. implicitly).
301 error = so_pru_listen(so, td);
304 /* Restore the params */
305 so->so_options = oldopt;
306 so->so_qlimit = oldqlimit;
314 * Destroy a disconnected socket. This routine is a NOP if entities
315 * still have a reference on the socket:
317 * so_pcb - The protocol stack still has a reference
318 * SS_NOFDREF - There is no longer a file pointer reference
321 sofree(struct socket *so)
326 * This is a bit hackish at the moment. We need to interlock
327 * any accept queue we are on before we potentially lose the
328 * last reference to avoid races against a re-reference from
329 * someone operating on the queue.
331 while ((head = so->so_head) != NULL) {
332 lwkt_getpooltoken(head);
333 if (so->so_head == head)
335 lwkt_relpooltoken(head);
339 * Arbitrage the last free.
341 KKASSERT(so->so_refs > 0);
342 if (atomic_fetchadd_int(&so->so_refs, -1) != 1) {
344 lwkt_relpooltoken(head);
348 KKASSERT(so->so_pcb == NULL && (so->so_state & SS_NOFDREF));
349 KKASSERT((so->so_state & SS_ASSERTINPROG) == 0);
352 * We're done, remove ourselves from the accept queue we are
353 * on, if we are on one.
356 if (so->so_state & SS_INCOMP) {
357 TAILQ_REMOVE(&head->so_incomp, so, so_list);
359 } else if (so->so_state & SS_COMP) {
361 * We must not decommission a socket that's
362 * on the accept(2) queue. If we do, then
363 * accept(2) may hang after select(2) indicated
364 * that the listening socket was ready.
366 lwkt_relpooltoken(head);
369 panic("sofree: not queued");
371 soclrstate(so, SS_INCOMP);
373 lwkt_relpooltoken(head);
375 ssb_release(&so->so_snd, so);
381 * Close a socket on last file table reference removal.
382 * Initiate disconnect if connected.
383 * Free socket when disconnect complete.
386 soclose(struct socket *so, int fflag)
390 funsetown(&so->so_sigio);
391 if (so->so_pcb == NULL)
393 if (so->so_state & SS_ISCONNECTED) {
394 if ((so->so_state & SS_ISDISCONNECTING) == 0) {
395 error = sodisconnect(so);
399 if (so->so_options & SO_LINGER) {
400 if ((so->so_state & SS_ISDISCONNECTING) &&
403 while (so->so_state & SS_ISCONNECTED) {
404 error = tsleep(&so->so_timeo, PCATCH,
405 "soclos", so->so_linger * hz);
415 error2 = so_pru_detach(so);
420 lwkt_getpooltoken(so);
421 if (so->so_options & SO_ACCEPTCONN) {
424 while ((sp = TAILQ_FIRST(&so->so_incomp)) != NULL) {
425 TAILQ_REMOVE(&so->so_incomp, sp, so_list);
426 soclrstate(sp, SS_INCOMP);
431 while ((sp = TAILQ_FIRST(&so->so_comp)) != NULL) {
432 TAILQ_REMOVE(&so->so_comp, sp, so_list);
433 soclrstate(sp, SS_COMP);
439 lwkt_relpooltoken(so);
440 if (so->so_state & SS_NOFDREF)
441 panic("soclose: NOFDREF");
442 sosetstate(so, SS_NOFDREF); /* take ref */
444 /* Make sure all asychronous sending are done */
446 sofree(so); /* dispose of ref */
451 * Abort and destroy a socket. Only one abort can be in progress
452 * at any given moment.
455 soabort(struct socket *so)
462 soaborta(struct socket *so)
469 soabort_oncpu(struct socket *so)
472 so_pru_abort_oncpu(so);
476 * so is passed in ref'd, which becomes owned by
477 * the cleared SS_NOFDREF flag.
480 soaccept(struct socket *so, struct sockaddr **nam)
484 if ((so->so_state & SS_NOFDREF) == 0)
485 panic("soaccept: !NOFDREF");
486 soclrstate(so, SS_NOFDREF); /* owned by lack of SS_NOFDREF */
487 error = so_pru_accept_direct(so, nam);
492 soconnect(struct socket *so, struct sockaddr *nam, struct thread *td)
496 if (so->so_options & SO_ACCEPTCONN)
499 * If protocol is connection-based, can only connect once.
500 * Otherwise, if connected, try to disconnect first.
501 * This allows user to disconnect by connecting to, e.g.,
504 if (so->so_state & (SS_ISCONNECTED|SS_ISCONNECTING) &&
505 ((so->so_proto->pr_flags & PR_CONNREQUIRED) ||
506 (error = sodisconnect(so)))) {
510 * Prevent accumulated error from previous connection
514 error = so_pru_connect(so, nam, td);
520 soconnect2(struct socket *so1, struct socket *so2)
524 error = so_pru_connect2(so1, so2);
529 sodisconnect(struct socket *so)
533 if ((so->so_state & SS_ISCONNECTED) == 0) {
537 if (so->so_state & SS_ISDISCONNECTING) {
541 error = so_pru_disconnect(so);
546 #define SBLOCKWAIT(f) (((f) & MSG_DONTWAIT) ? M_NOWAIT : M_WAITOK)
549 * If send must go all at once and message is larger than
550 * send buffering, then hard error.
551 * Lock against other senders.
552 * If must go all at once and not enough room now, then
553 * inform user that this would block and do nothing.
554 * Otherwise, if nonblocking, send as much as possible.
555 * The data to be sent is described by "uio" if nonzero,
556 * otherwise by the mbuf chain "top" (which must be null
557 * if uio is not). Data provided in mbuf chain must be small
558 * enough to send all at once.
560 * Returns nonzero on error, timeout or signal; callers
561 * must check for short counts if EINTR/ERESTART are returned.
562 * Data and control buffers are freed on return.
565 sosend(struct socket *so, struct sockaddr *addr, struct uio *uio,
566 struct mbuf *top, struct mbuf *control, int flags,
573 int clen = 0, error, dontroute, mlen;
574 int atomic = sosendallatonce(so) || top;
578 resid = uio->uio_resid;
580 resid = (size_t)top->m_pkthdr.len;
583 for (m = top; m; m = m->m_next)
585 KKASSERT(top->m_pkthdr.len == len);
590 * WARNING! resid is unsigned, space and len are signed. space
591 * can wind up negative if the sockbuf is overcommitted.
593 * Also check to make sure that MSG_EOR isn't used on SOCK_STREAM
594 * type sockets since that's an error.
596 if (so->so_type == SOCK_STREAM && (flags & MSG_EOR)) {
602 (flags & MSG_DONTROUTE) && (so->so_options & SO_DONTROUTE) == 0 &&
603 (so->so_proto->pr_flags & PR_ATOMIC);
604 if (td->td_lwp != NULL)
605 td->td_lwp->lwp_ru.ru_msgsnd++;
607 clen = control->m_len;
608 #define gotoerr(errcode) { error = errcode; goto release; }
611 error = ssb_lock(&so->so_snd, SBLOCKWAIT(flags));
616 if (so->so_state & SS_CANTSENDMORE)
619 error = so->so_error;
623 if ((so->so_state & SS_ISCONNECTED) == 0) {
625 * `sendto' and `sendmsg' is allowed on a connection-
626 * based socket if it supports implied connect.
627 * Return ENOTCONN if not connected and no address is
630 if ((so->so_proto->pr_flags & PR_CONNREQUIRED) &&
631 (so->so_proto->pr_flags & PR_IMPLOPCL) == 0) {
632 if ((so->so_state & SS_ISCONFIRMING) == 0 &&
633 !(resid == 0 && clen != 0))
635 } else if (addr == 0)
636 gotoerr(so->so_proto->pr_flags & PR_CONNREQUIRED ?
637 ENOTCONN : EDESTADDRREQ);
639 if ((atomic && resid > so->so_snd.ssb_hiwat) ||
640 clen > so->so_snd.ssb_hiwat) {
643 space = ssb_space(&so->so_snd);
646 if ((space < 0 || (size_t)space < resid + clen) && uio &&
647 (atomic || space < so->so_snd.ssb_lowat || space < clen)) {
648 if (flags & (MSG_FNONBLOCKING|MSG_DONTWAIT))
649 gotoerr(EWOULDBLOCK);
650 ssb_unlock(&so->so_snd);
651 error = ssb_wait(&so->so_snd);
661 * Data is prepackaged in "top".
665 top->m_flags |= M_EOR;
669 m = m_getl((int)resid, MB_WAIT, MT_DATA,
670 top == NULL ? M_PKTHDR : 0, &mlen);
673 m->m_pkthdr.rcvif = NULL;
675 len = imin((int)szmin(mlen, resid), space);
676 if (resid < MINCLSIZE) {
678 * For datagram protocols, leave room
679 * for protocol headers in first mbuf.
681 if (atomic && top == 0 && len < mlen)
685 error = uiomove(mtod(m, caddr_t), (size_t)len, uio);
686 resid = uio->uio_resid;
689 top->m_pkthdr.len += len;
695 top->m_flags |= M_EOR;
698 } while (space > 0 && atomic);
700 so->so_options |= SO_DONTROUTE;
701 if (flags & MSG_OOB) {
702 pru_flags = PRUS_OOB;
703 } else if ((flags & MSG_EOF) &&
704 (so->so_proto->pr_flags & PR_IMPLOPCL) &&
707 * If the user set MSG_EOF, the protocol
708 * understands this flag and nothing left to
709 * send then use PRU_SEND_EOF instead of PRU_SEND.
711 pru_flags = PRUS_EOF;
712 } else if (resid > 0 && space > 0) {
713 /* If there is more to send, set PRUS_MORETOCOME */
714 pru_flags = PRUS_MORETOCOME;
719 * XXX all the SS_CANTSENDMORE checks previously
720 * done could be out of date. We could have recieved
721 * a reset packet in an interrupt or maybe we slept
722 * while doing page faults in uiomove() etc. We could
723 * probably recheck again inside the splnet() protection
724 * here, but there are probably other places that this
725 * also happens. We must rethink this.
727 error = so_pru_send(so, pru_flags, top, addr, control, td);
729 so->so_options &= ~SO_DONTROUTE;
736 } while (resid && space > 0);
740 ssb_unlock(&so->so_snd);
750 * A specialization of sosend() for UDP based on protocol-specific knowledge:
751 * so->so_proto->pr_flags has the PR_ATOMIC field set. This means that
752 * sosendallatonce() returns true,
753 * the "atomic" variable is true,
754 * and sosendudp() blocks until space is available for the entire send.
755 * so->so_proto->pr_flags does not have the PR_CONNREQUIRED or
756 * PR_IMPLOPCL flags set.
757 * UDP has no out-of-band data.
758 * UDP has no control data.
759 * UDP does not support MSG_EOR.
762 sosendudp(struct socket *so, struct sockaddr *addr, struct uio *uio,
763 struct mbuf *top, struct mbuf *control, int flags, struct thread *td)
765 boolean_t dontroute; /* temporary SO_DONTROUTE setting */
770 if (td->td_lwp != NULL)
771 td->td_lwp->lwp_ru.ru_msgsnd++;
775 KASSERT((uio && !top) || (top && !uio), ("bad arguments to sosendudp"));
776 resid = uio ? uio->uio_resid : (size_t)top->m_pkthdr.len;
779 error = ssb_lock(&so->so_snd, SBLOCKWAIT(flags));
783 if (so->so_state & SS_CANTSENDMORE)
786 error = so->so_error;
790 if (!(so->so_state & SS_ISCONNECTED) && addr == NULL)
791 gotoerr(EDESTADDRREQ);
792 if (resid > so->so_snd.ssb_hiwat)
794 space = ssb_space(&so->so_snd);
795 if (uio && (space < 0 || (size_t)space < resid)) {
796 if (flags & (MSG_FNONBLOCKING|MSG_DONTWAIT))
797 gotoerr(EWOULDBLOCK);
798 ssb_unlock(&so->so_snd);
799 error = ssb_wait(&so->so_snd);
806 top = m_uiomove(uio);
811 dontroute = (flags & MSG_DONTROUTE) && !(so->so_options & SO_DONTROUTE);
813 so->so_options |= SO_DONTROUTE;
815 error = so_pru_send(so, 0, top, addr, NULL, td);
816 top = NULL; /* sent or freed in lower layer */
819 so->so_options &= ~SO_DONTROUTE;
822 ssb_unlock(&so->so_snd);
830 sosendtcp(struct socket *so, struct sockaddr *addr, struct uio *uio,
831 struct mbuf *top, struct mbuf *control, int flags,
843 KKASSERT(top == NULL);
845 resid = uio->uio_resid;
848 resid = (size_t)top->m_pkthdr.len;
851 for (m = top; m; m = m->m_next)
853 KKASSERT(top->m_pkthdr.len == len);
858 * WARNING! resid is unsigned, space and len are signed. space
859 * can wind up negative if the sockbuf is overcommitted.
861 * Also check to make sure that MSG_EOR isn't used on TCP
863 if (flags & MSG_EOR) {
869 /* TCP doesn't do control messages (rights, creds, etc) */
870 if (control->m_len) {
874 m_freem(control); /* empty control, just free it */
878 if (td->td_lwp != NULL)
879 td->td_lwp->lwp_ru.ru_msgsnd++;
881 #define gotoerr(errcode) { error = errcode; goto release; }
884 error = ssb_lock(&so->so_snd, SBLOCKWAIT(flags));
889 if (so->so_state & SS_CANTSENDMORE)
892 error = so->so_error;
896 if ((so->so_state & SS_ISCONNECTED) == 0 &&
897 (so->so_state & SS_ISCONFIRMING) == 0)
899 if (allatonce && resid > so->so_snd.ssb_hiwat)
902 space = ssb_space(&so->so_snd);
905 if ((space < 0 || (size_t)space < resid) && !allatonce &&
906 space < so->so_snd.ssb_lowat) {
907 if (flags & (MSG_FNONBLOCKING|MSG_DONTWAIT))
908 gotoerr(EWOULDBLOCK);
909 ssb_unlock(&so->so_snd);
910 error = ssb_wait(&so->so_snd);
917 int cnt = 0, async = 0;
921 * Data is prepackaged in "top".
927 m = m_getl((int)resid, MB_WAIT, MT_DATA,
928 top == NULL ? M_PKTHDR : 0, &mlen);
931 m->m_pkthdr.rcvif = NULL;
933 len = imin((int)szmin(mlen, resid), space);
935 error = uiomove(mtod(m, caddr_t), (size_t)len, uio);
936 resid = uio->uio_resid;
939 top->m_pkthdr.len += len;
946 } while (space > 0 && cnt < tcp_sosnd_agglim);
951 if (flags & MSG_OOB) {
952 pru_flags = PRUS_OOB;
954 } else if ((flags & MSG_EOF) && resid == 0) {
955 pru_flags = PRUS_EOF;
956 } else if (resid > 0 && space > 0) {
957 /* If there is more to send, set PRUS_MORETOCOME */
958 pru_flags = PRUS_MORETOCOME;
964 if (flags & MSG_SYNC)
968 * XXX all the SS_CANTSENDMORE checks previously
969 * done could be out of date. We could have recieved
970 * a reset packet in an interrupt or maybe we slept
971 * while doing page faults in uiomove() etc. We could
972 * probably recheck again inside the splnet() protection
973 * here, but there are probably other places that this
974 * also happens. We must rethink this.
977 error = so_pru_send(so, pru_flags, top,
980 so_pru_send_async(so, pru_flags, top,
989 } while (resid && space > 0);
993 ssb_unlock(&so->so_snd);
1003 * Implement receive operations on a socket.
1005 * We depend on the way that records are added to the signalsockbuf
1006 * by sbappend*. In particular, each record (mbufs linked through m_next)
1007 * must begin with an address if the protocol so specifies,
1008 * followed by an optional mbuf or mbufs containing ancillary data,
1009 * and then zero or more mbufs of data.
1011 * Although the signalsockbuf is locked, new data may still be appended.
1012 * A token inside the ssb_lock deals with MP issues and still allows
1013 * the network to access the socket if we block in a uio.
1015 * The caller may receive the data as a single mbuf chain by supplying
1016 * an mbuf **mp0 for use in returning the chain. The uio is then used
1017 * only for the count in uio_resid.
1020 soreceive(struct socket *so, struct sockaddr **psa, struct uio *uio,
1021 struct sockbuf *sio, struct mbuf **controlp, int *flagsp)
1024 struct mbuf *free_chain = NULL;
1025 int flags, len, error, offset;
1026 struct protosw *pr = so->so_proto;
1028 size_t resid, orig_resid;
1031 resid = uio->uio_resid;
1033 resid = (size_t)(sio->sb_climit - sio->sb_cc);
1041 flags = *flagsp &~ MSG_EOR;
1044 if (flags & MSG_OOB) {
1045 m = m_get(MB_WAIT, MT_DATA);
1048 error = so_pru_rcvoob(so, m, flags & MSG_PEEK);
1054 KKASSERT(resid >= (size_t)m->m_len);
1055 resid -= (size_t)m->m_len;
1056 } while (resid > 0 && m);
1059 uio->uio_resid = resid;
1060 error = uiomove(mtod(m, caddr_t),
1061 (int)szmin(resid, m->m_len),
1063 resid = uio->uio_resid;
1065 } while (uio->uio_resid && error == 0 && m);
1072 if ((so->so_state & SS_ISCONFIRMING) && resid)
1076 * The token interlocks against the protocol thread while
1077 * ssb_lock is a blocking lock against other userland entities.
1079 lwkt_gettoken(&so->so_rcv.ssb_token);
1081 error = ssb_lock(&so->so_rcv, SBLOCKWAIT(flags));
1085 m = so->so_rcv.ssb_mb;
1087 * If we have less data than requested, block awaiting more
1088 * (subject to any timeout) if:
1089 * 1. the current count is less than the low water mark, or
1090 * 2. MSG_WAITALL is set, and it is possible to do the entire
1091 * receive operation at once if we block (resid <= hiwat).
1092 * 3. MSG_DONTWAIT is not set
1093 * If MSG_WAITALL is set but resid is larger than the receive buffer,
1094 * we have to do the receive in sections, and thus risk returning
1095 * a short count if a timeout or signal occurs after we start.
1097 if (m == NULL || (((flags & MSG_DONTWAIT) == 0 &&
1098 (size_t)so->so_rcv.ssb_cc < resid) &&
1099 (so->so_rcv.ssb_cc < so->so_rcv.ssb_lowat ||
1100 ((flags & MSG_WAITALL) && resid <= (size_t)so->so_rcv.ssb_hiwat)) &&
1101 m->m_nextpkt == 0 && (pr->pr_flags & PR_ATOMIC) == 0)) {
1102 KASSERT(m != NULL || !so->so_rcv.ssb_cc, ("receive 1"));
1106 error = so->so_error;
1107 if ((flags & MSG_PEEK) == 0)
1111 if (so->so_state & SS_CANTRCVMORE) {
1117 for (; m; m = m->m_next) {
1118 if (m->m_type == MT_OOBDATA || (m->m_flags & M_EOR)) {
1119 m = so->so_rcv.ssb_mb;
1123 if ((so->so_state & (SS_ISCONNECTED|SS_ISCONNECTING)) == 0 &&
1124 (pr->pr_flags & PR_CONNREQUIRED)) {
1130 if (flags & (MSG_FNONBLOCKING|MSG_DONTWAIT)) {
1131 error = EWOULDBLOCK;
1134 ssb_unlock(&so->so_rcv);
1135 error = ssb_wait(&so->so_rcv);
1141 if (uio && uio->uio_td && uio->uio_td->td_proc)
1142 uio->uio_td->td_lwp->lwp_ru.ru_msgrcv++;
1145 * note: m should be == sb_mb here. Cache the next record while
1146 * cleaning up. Note that calling m_free*() will break out critical
1149 KKASSERT(m == so->so_rcv.ssb_mb);
1152 * Skip any address mbufs prepending the record.
1154 if (pr->pr_flags & PR_ADDR) {
1155 KASSERT(m->m_type == MT_SONAME, ("receive 1a"));
1158 *psa = dup_sockaddr(mtod(m, struct sockaddr *));
1159 if (flags & MSG_PEEK)
1162 m = sbunlinkmbuf(&so->so_rcv.sb, m, &free_chain);
1166 * Skip any control mbufs prepending the record.
1169 if (pr->pr_flags & PR_ADDR_OPT) {
1171 * For SCTP we may be getting a
1172 * whole message OR a partial delivery.
1174 if (m && m->m_type == MT_SONAME) {
1177 *psa = dup_sockaddr(mtod(m, struct sockaddr *));
1178 if (flags & MSG_PEEK)
1181 m = sbunlinkmbuf(&so->so_rcv.sb, m, &free_chain);
1185 while (m && m->m_type == MT_CONTROL && error == 0) {
1186 if (flags & MSG_PEEK) {
1188 *controlp = m_copy(m, 0, m->m_len);
1189 m = m->m_next; /* XXX race */
1192 n = sbunlinkmbuf(&so->so_rcv.sb, m, NULL);
1193 if (pr->pr_domain->dom_externalize &&
1194 mtod(m, struct cmsghdr *)->cmsg_type ==
1196 error = (*pr->pr_domain->dom_externalize)(m);
1200 m = sbunlinkmbuf(&so->so_rcv.sb, m, &free_chain);
1203 if (controlp && *controlp) {
1205 controlp = &(*controlp)->m_next;
1214 if (type == MT_OOBDATA)
1219 * Copy to the UIO or mbuf return chain (*mp).
1223 while (m && resid > 0 && error == 0) {
1224 if (m->m_type == MT_OOBDATA) {
1225 if (type != MT_OOBDATA)
1227 } else if (type == MT_OOBDATA)
1230 KASSERT(m->m_type == MT_DATA || m->m_type == MT_HEADER,
1232 soclrstate(so, SS_RCVATMARK);
1233 len = (resid > INT_MAX) ? INT_MAX : resid;
1234 if (so->so_oobmark && len > so->so_oobmark - offset)
1235 len = so->so_oobmark - offset;
1236 if (len > m->m_len - moff)
1237 len = m->m_len - moff;
1240 * Copy out to the UIO or pass the mbufs back to the SIO.
1241 * The SIO is dealt with when we eat the mbuf, but deal
1242 * with the resid here either way.
1245 uio->uio_resid = resid;
1246 error = uiomove(mtod(m, caddr_t) + moff, len, uio);
1247 resid = uio->uio_resid;
1251 resid -= (size_t)len;
1255 * Eat the entire mbuf or just a piece of it
1257 if (len == m->m_len - moff) {
1258 if (m->m_flags & M_EOR)
1261 if (m->m_flags & M_NOTIFICATION)
1262 flags |= MSG_NOTIFICATION;
1264 if (flags & MSG_PEEK) {
1269 n = sbunlinkmbuf(&so->so_rcv.sb, m, NULL);
1273 m = sbunlinkmbuf(&so->so_rcv.sb, m, &free_chain);
1277 if (flags & MSG_PEEK) {
1281 n = m_copym(m, 0, len, MB_WAIT);
1287 so->so_rcv.ssb_cc -= len;
1290 if (so->so_oobmark) {
1291 if ((flags & MSG_PEEK) == 0) {
1292 so->so_oobmark -= len;
1293 if (so->so_oobmark == 0) {
1294 sosetstate(so, SS_RCVATMARK);
1299 if (offset == so->so_oobmark)
1303 if (flags & MSG_EOR)
1306 * If the MSG_WAITALL flag is set (for non-atomic socket),
1307 * we must not quit until resid == 0 or an error
1308 * termination. If a signal/timeout occurs, return
1309 * with a short count but without error.
1310 * Keep signalsockbuf locked against other readers.
1312 while ((flags & MSG_WAITALL) && m == NULL &&
1313 resid > 0 && !sosendallatonce(so) &&
1314 so->so_rcv.ssb_mb == NULL) {
1315 if (so->so_error || so->so_state & SS_CANTRCVMORE)
1318 * The window might have closed to zero, make
1319 * sure we send an ack now that we've drained
1320 * the buffer or we might end up blocking until
1321 * the idle takes over (5 seconds).
1323 if (pr->pr_flags & PR_WANTRCVD && so->so_pcb)
1324 so_pru_rcvd(so, flags);
1325 error = ssb_wait(&so->so_rcv);
1327 ssb_unlock(&so->so_rcv);
1331 m = so->so_rcv.ssb_mb;
1336 * If an atomic read was requested but unread data still remains
1337 * in the record, set MSG_TRUNC.
1339 if (m && pr->pr_flags & PR_ATOMIC)
1343 * Cleanup. If an atomic read was requested drop any unread data.
1345 if ((flags & MSG_PEEK) == 0) {
1346 if (m && (pr->pr_flags & PR_ATOMIC))
1347 sbdroprecord(&so->so_rcv.sb);
1348 if ((pr->pr_flags & PR_WANTRCVD) && so->so_pcb)
1349 so_pru_rcvd(so, flags);
1352 if (orig_resid == resid && orig_resid &&
1353 (flags & MSG_EOR) == 0 && (so->so_state & SS_CANTRCVMORE) == 0) {
1354 ssb_unlock(&so->so_rcv);
1361 ssb_unlock(&so->so_rcv);
1363 lwkt_reltoken(&so->so_rcv.ssb_token);
1365 m_freem(free_chain);
1370 * Shut a socket down. Note that we do not get a frontend lock as we
1371 * want to be able to shut the socket down even if another thread is
1372 * blocked in a read(), thus waking it up.
1375 soshutdown(struct socket *so, int how)
1377 if (!(how == SHUT_RD || how == SHUT_WR || how == SHUT_RDWR))
1380 if (how != SHUT_WR) {
1381 /*ssb_lock(&so->so_rcv, M_WAITOK);*/
1383 /*ssb_unlock(&so->so_rcv);*/
1386 return (so_pru_shutdown(so));
1391 sorflush(struct socket *so)
1393 struct signalsockbuf *ssb = &so->so_rcv;
1394 struct protosw *pr = so->so_proto;
1395 struct signalsockbuf asb;
1397 atomic_set_int(&ssb->ssb_flags, SSB_NOINTR);
1399 lwkt_gettoken(&ssb->ssb_token);
1404 * Can't just blow up the ssb structure here
1406 bzero(&ssb->sb, sizeof(ssb->sb));
1411 atomic_clear_int(&ssb->ssb_flags, SSB_CLEAR_MASK);
1413 if ((pr->pr_flags & PR_RIGHTS) && pr->pr_domain->dom_dispose)
1414 (*pr->pr_domain->dom_dispose)(asb.ssb_mb);
1415 ssb_release(&asb, so);
1417 lwkt_reltoken(&ssb->ssb_token);
1422 do_setopt_accept_filter(struct socket *so, struct sockopt *sopt)
1424 struct accept_filter_arg *afap = NULL;
1425 struct accept_filter *afp;
1426 struct so_accf *af = so->so_accf;
1429 /* do not set/remove accept filters on non listen sockets */
1430 if ((so->so_options & SO_ACCEPTCONN) == 0) {
1435 /* removing the filter */
1438 if (af->so_accept_filter != NULL &&
1439 af->so_accept_filter->accf_destroy != NULL) {
1440 af->so_accept_filter->accf_destroy(so);
1442 if (af->so_accept_filter_str != NULL) {
1443 FREE(af->so_accept_filter_str, M_ACCF);
1448 so->so_options &= ~SO_ACCEPTFILTER;
1451 /* adding a filter */
1452 /* must remove previous filter first */
1457 /* don't put large objects on the kernel stack */
1458 MALLOC(afap, struct accept_filter_arg *, sizeof(*afap), M_TEMP, M_WAITOK);
1459 error = sooptcopyin(sopt, afap, sizeof *afap, sizeof *afap);
1460 afap->af_name[sizeof(afap->af_name)-1] = '\0';
1461 afap->af_arg[sizeof(afap->af_arg)-1] = '\0';
1464 afp = accept_filt_get(afap->af_name);
1469 MALLOC(af, struct so_accf *, sizeof(*af), M_ACCF, M_WAITOK | M_ZERO);
1470 if (afp->accf_create != NULL) {
1471 if (afap->af_name[0] != '\0') {
1472 int len = strlen(afap->af_name) + 1;
1474 MALLOC(af->so_accept_filter_str, char *, len, M_ACCF, M_WAITOK);
1475 strcpy(af->so_accept_filter_str, afap->af_name);
1477 af->so_accept_filter_arg = afp->accf_create(so, afap->af_arg);
1478 if (af->so_accept_filter_arg == NULL) {
1479 FREE(af->so_accept_filter_str, M_ACCF);
1486 af->so_accept_filter = afp;
1488 so->so_options |= SO_ACCEPTFILTER;
1497 * Perhaps this routine, and sooptcopyout(), below, ought to come in
1498 * an additional variant to handle the case where the option value needs
1499 * to be some kind of integer, but not a specific size.
1500 * In addition to their use here, these functions are also called by the
1501 * protocol-level pr_ctloutput() routines.
1504 sooptcopyin(struct sockopt *sopt, void *buf, size_t len, size_t minlen)
1506 return soopt_to_kbuf(sopt, buf, len, minlen);
1510 soopt_to_kbuf(struct sockopt *sopt, void *buf, size_t len, size_t minlen)
1514 KKASSERT(!sopt->sopt_val || kva_p(sopt->sopt_val));
1515 KKASSERT(kva_p(buf));
1518 * If the user gives us more than we wanted, we ignore it,
1519 * but if we don't get the minimum length the caller
1520 * wants, we return EINVAL. On success, sopt->sopt_valsize
1521 * is set to however much we actually retrieved.
1523 if ((valsize = sopt->sopt_valsize) < minlen)
1526 sopt->sopt_valsize = valsize = len;
1528 bcopy(sopt->sopt_val, buf, valsize);
1534 sosetopt(struct socket *so, struct sockopt *sopt)
1540 struct signalsockbuf *sotmp;
1543 sopt->sopt_dir = SOPT_SET;
1544 if (sopt->sopt_level != SOL_SOCKET) {
1545 if (so->so_proto && so->so_proto->pr_ctloutput) {
1546 return (so_pr_ctloutput(so, sopt));
1548 error = ENOPROTOOPT;
1550 switch (sopt->sopt_name) {
1552 case SO_ACCEPTFILTER:
1553 error = do_setopt_accept_filter(so, sopt);
1559 error = sooptcopyin(sopt, &l, sizeof l, sizeof l);
1563 so->so_linger = l.l_linger;
1565 so->so_options |= SO_LINGER;
1567 so->so_options &= ~SO_LINGER;
1573 case SO_USELOOPBACK:
1579 error = sooptcopyin(sopt, &optval, sizeof optval,
1584 so->so_options |= sopt->sopt_name;
1586 so->so_options &= ~sopt->sopt_name;
1593 error = sooptcopyin(sopt, &optval, sizeof optval,
1599 * Values < 1 make no sense for any of these
1600 * options, so disallow them.
1607 switch (sopt->sopt_name) {
1610 if (ssb_reserve(sopt->sopt_name == SO_SNDBUF ?
1611 &so->so_snd : &so->so_rcv, (u_long)optval,
1613 &curproc->p_rlimit[RLIMIT_SBSIZE]) == 0) {
1617 sotmp = (sopt->sopt_name == SO_SNDBUF) ?
1618 &so->so_snd : &so->so_rcv;
1619 atomic_clear_int(&sotmp->ssb_flags,
1624 * Make sure the low-water is never greater than
1628 so->so_snd.ssb_lowat =
1629 (optval > so->so_snd.ssb_hiwat) ?
1630 so->so_snd.ssb_hiwat : optval;
1631 atomic_clear_int(&so->so_snd.ssb_flags,
1635 so->so_rcv.ssb_lowat =
1636 (optval > so->so_rcv.ssb_hiwat) ?
1637 so->so_rcv.ssb_hiwat : optval;
1638 atomic_clear_int(&so->so_rcv.ssb_flags,
1646 error = sooptcopyin(sopt, &tv, sizeof tv,
1651 /* assert(hz > 0); */
1652 if (tv.tv_sec < 0 || tv.tv_sec > INT_MAX / hz ||
1653 tv.tv_usec < 0 || tv.tv_usec >= 1000000) {
1657 /* assert(tick > 0); */
1658 /* assert(ULONG_MAX - INT_MAX >= 1000000); */
1659 val = (u_long)(tv.tv_sec * hz) + tv.tv_usec / ustick;
1660 if (val > INT_MAX) {
1664 if (val == 0 && tv.tv_usec != 0)
1667 switch (sopt->sopt_name) {
1669 so->so_snd.ssb_timeo = val;
1672 so->so_rcv.ssb_timeo = val;
1677 error = ENOPROTOOPT;
1680 if (error == 0 && so->so_proto && so->so_proto->pr_ctloutput) {
1681 (void) so_pr_ctloutput(so, sopt);
1688 /* Helper routine for getsockopt */
1690 sooptcopyout(struct sockopt *sopt, const void *buf, size_t len)
1692 soopt_from_kbuf(sopt, buf, len);
1697 soopt_from_kbuf(struct sockopt *sopt, const void *buf, size_t len)
1702 sopt->sopt_valsize = 0;
1706 KKASSERT(!sopt->sopt_val || kva_p(sopt->sopt_val));
1707 KKASSERT(kva_p(buf));
1710 * Documented get behavior is that we always return a value,
1711 * possibly truncated to fit in the user's buffer.
1712 * Traditional behavior is that we always tell the user
1713 * precisely how much we copied, rather than something useful
1714 * like the total amount we had available for her.
1715 * Note that this interface is not idempotent; the entire answer must
1716 * generated ahead of time.
1718 valsize = szmin(len, sopt->sopt_valsize);
1719 sopt->sopt_valsize = valsize;
1720 if (sopt->sopt_val != 0) {
1721 bcopy(buf, sopt->sopt_val, valsize);
1726 sogetopt(struct socket *so, struct sockopt *sopt)
1733 struct accept_filter_arg *afap;
1737 sopt->sopt_dir = SOPT_GET;
1738 if (sopt->sopt_level != SOL_SOCKET) {
1739 if (so->so_proto && so->so_proto->pr_ctloutput) {
1740 return (so_pr_ctloutput(so, sopt));
1742 return (ENOPROTOOPT);
1744 switch (sopt->sopt_name) {
1746 case SO_ACCEPTFILTER:
1747 if ((so->so_options & SO_ACCEPTCONN) == 0)
1749 MALLOC(afap, struct accept_filter_arg *, sizeof(*afap),
1750 M_TEMP, M_WAITOK | M_ZERO);
1751 if ((so->so_options & SO_ACCEPTFILTER) != 0) {
1752 strcpy(afap->af_name, so->so_accf->so_accept_filter->accf_name);
1753 if (so->so_accf->so_accept_filter_str != NULL)
1754 strcpy(afap->af_arg, so->so_accf->so_accept_filter_str);
1756 error = sooptcopyout(sopt, afap, sizeof(*afap));
1762 l.l_onoff = so->so_options & SO_LINGER;
1763 l.l_linger = so->so_linger;
1764 error = sooptcopyout(sopt, &l, sizeof l);
1767 case SO_USELOOPBACK:
1776 optval = so->so_options & sopt->sopt_name;
1778 error = sooptcopyout(sopt, &optval, sizeof optval);
1782 optval = so->so_type;
1786 optval = so->so_error;
1791 optval = so->so_snd.ssb_hiwat;
1795 optval = so->so_rcv.ssb_hiwat;
1799 optval = so->so_snd.ssb_lowat;
1803 optval = so->so_rcv.ssb_lowat;
1808 optval = (sopt->sopt_name == SO_SNDTIMEO ?
1809 so->so_snd.ssb_timeo : so->so_rcv.ssb_timeo);
1811 tv.tv_sec = optval / hz;
1812 tv.tv_usec = (optval % hz) * ustick;
1813 error = sooptcopyout(sopt, &tv, sizeof tv);
1817 optval_l = ssb_space(&so->so_snd);
1818 error = sooptcopyout(sopt, &optval_l, sizeof(optval_l));
1822 error = ENOPROTOOPT;
1829 /* XXX; prepare mbuf for (__FreeBSD__ < 3) routines. */
1831 soopt_getm(struct sockopt *sopt, struct mbuf **mp)
1833 struct mbuf *m, *m_prev;
1834 int sopt_size = sopt->sopt_valsize, msize;
1836 m = m_getl(sopt_size, sopt->sopt_td ? MB_WAIT : MB_DONTWAIT, MT_DATA,
1840 m->m_len = min(msize, sopt_size);
1841 sopt_size -= m->m_len;
1845 while (sopt_size > 0) {
1846 m = m_getl(sopt_size, sopt->sopt_td ? MB_WAIT : MB_DONTWAIT,
1847 MT_DATA, 0, &msize);
1852 m->m_len = min(msize, sopt_size);
1853 sopt_size -= m->m_len;
1860 /* XXX; copyin sopt data into mbuf chain for (__FreeBSD__ < 3) routines. */
1862 soopt_mcopyin(struct sockopt *sopt, struct mbuf *m)
1864 soopt_to_mbuf(sopt, m);
1869 soopt_to_mbuf(struct sockopt *sopt, struct mbuf *m)
1874 KKASSERT(!sopt->sopt_val || kva_p(sopt->sopt_val));
1876 if (sopt->sopt_val == NULL)
1878 val = sopt->sopt_val;
1879 valsize = sopt->sopt_valsize;
1880 while (m != NULL && valsize >= m->m_len) {
1881 bcopy(val, mtod(m, char *), m->m_len);
1882 valsize -= m->m_len;
1883 val = (caddr_t)val + m->m_len;
1886 if (m != NULL) /* should be allocated enoughly at ip6_sooptmcopyin() */
1887 panic("ip6_sooptmcopyin");
1890 /* XXX; copyout mbuf chain data into soopt for (__FreeBSD__ < 3) routines. */
1892 soopt_mcopyout(struct sockopt *sopt, struct mbuf *m)
1894 return soopt_from_mbuf(sopt, m);
1898 soopt_from_mbuf(struct sockopt *sopt, struct mbuf *m)
1900 struct mbuf *m0 = m;
1905 KKASSERT(!sopt->sopt_val || kva_p(sopt->sopt_val));
1907 if (sopt->sopt_val == NULL)
1909 val = sopt->sopt_val;
1910 maxsize = sopt->sopt_valsize;
1911 while (m != NULL && maxsize >= m->m_len) {
1912 bcopy(mtod(m, char *), val, m->m_len);
1913 maxsize -= m->m_len;
1914 val = (caddr_t)val + m->m_len;
1915 valsize += m->m_len;
1919 /* enough soopt buffer should be given from user-land */
1923 sopt->sopt_valsize = valsize;
1928 sohasoutofband(struct socket *so)
1930 if (so->so_sigio != NULL)
1931 pgsigio(so->so_sigio, SIGURG, 0);
1932 KNOTE(&so->so_rcv.ssb_kq.ki_note, NOTE_OOB);
1936 sokqfilter(struct file *fp, struct knote *kn)
1938 struct socket *so = (struct socket *)kn->kn_fp->f_data;
1939 struct signalsockbuf *ssb;
1941 switch (kn->kn_filter) {
1943 if (so->so_options & SO_ACCEPTCONN)
1944 kn->kn_fop = &solisten_filtops;
1946 kn->kn_fop = &soread_filtops;
1950 kn->kn_fop = &sowrite_filtops;
1954 kn->kn_fop = &soexcept_filtops;
1958 return (EOPNOTSUPP);
1961 knote_insert(&ssb->ssb_kq.ki_note, kn);
1962 atomic_set_int(&ssb->ssb_flags, SSB_KNOTE);
1967 filt_sordetach(struct knote *kn)
1969 struct socket *so = (struct socket *)kn->kn_fp->f_data;
1971 knote_remove(&so->so_rcv.ssb_kq.ki_note, kn);
1972 if (SLIST_EMPTY(&so->so_rcv.ssb_kq.ki_note))
1973 atomic_clear_int(&so->so_rcv.ssb_flags, SSB_KNOTE);
1978 filt_soread(struct knote *kn, long hint)
1980 struct socket *so = (struct socket *)kn->kn_fp->f_data;
1982 if (kn->kn_sfflags & NOTE_OOB) {
1983 if ((so->so_oobmark || (so->so_state & SS_RCVATMARK))) {
1984 kn->kn_fflags |= NOTE_OOB;
1989 kn->kn_data = so->so_rcv.ssb_cc;
1991 if (so->so_state & SS_CANTRCVMORE) {
1993 * Only set NODATA if all data has been exhausted.
1995 if (kn->kn_data == 0)
1996 kn->kn_flags |= EV_NODATA;
1997 kn->kn_flags |= EV_EOF;
1998 kn->kn_fflags = so->so_error;
2001 if (so->so_error) /* temporary udp error */
2003 if (kn->kn_sfflags & NOTE_LOWAT)
2004 return (kn->kn_data >= kn->kn_sdata);
2005 return ((kn->kn_data >= so->so_rcv.ssb_lowat) ||
2006 !TAILQ_EMPTY(&so->so_comp));
2010 filt_sowdetach(struct knote *kn)
2012 struct socket *so = (struct socket *)kn->kn_fp->f_data;
2014 knote_remove(&so->so_snd.ssb_kq.ki_note, kn);
2015 if (SLIST_EMPTY(&so->so_snd.ssb_kq.ki_note))
2016 atomic_clear_int(&so->so_snd.ssb_flags, SSB_KNOTE);
2021 filt_sowrite(struct knote *kn, long hint)
2023 struct socket *so = (struct socket *)kn->kn_fp->f_data;
2025 kn->kn_data = ssb_space(&so->so_snd);
2026 if (so->so_state & SS_CANTSENDMORE) {
2027 kn->kn_flags |= (EV_EOF | EV_NODATA);
2028 kn->kn_fflags = so->so_error;
2031 if (so->so_error) /* temporary udp error */
2033 if (((so->so_state & SS_ISCONNECTED) == 0) &&
2034 (so->so_proto->pr_flags & PR_CONNREQUIRED))
2036 if (kn->kn_sfflags & NOTE_LOWAT)
2037 return (kn->kn_data >= kn->kn_sdata);
2038 return (kn->kn_data >= so->so_snd.ssb_lowat);
2043 filt_solisten(struct knote *kn, long hint)
2045 struct socket *so = (struct socket *)kn->kn_fp->f_data;
2047 kn->kn_data = so->so_qlen;
2048 return (! TAILQ_EMPTY(&so->so_comp));