2 * Copyright (c) 1982, 1986, 1988, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)uipc_socket2.c 8.1 (Berkeley) 6/10/93
34 * $FreeBSD: src/sys/kern/uipc_socket2.c,v 1.55.2.17 2002/08/31 19:04:55 dwmalone Exp $
35 * $DragonFly: src/sys/kern/uipc_socket2.c,v 1.9 2004/04/10 00:48:06 hsu Exp $
38 #include "opt_param.h"
39 #include <sys/param.h>
40 #include <sys/systm.h>
41 #include <sys/domain.h>
42 #include <sys/file.h> /* for maxfiles */
43 #include <sys/kernel.h>
45 #include <sys/malloc.h>
47 #include <sys/protosw.h>
48 #include <sys/resourcevar.h>
50 #include <sys/socket.h>
51 #include <sys/socketvar.h>
52 #include <sys/signalvar.h>
53 #include <sys/sysctl.h>
54 #include <sys/aio.h> /* for aio_swake proto */
55 #include <sys/event.h>
57 #include <sys/thread2.h>
58 #include <sys/msgport2.h>
63 * Primitive routines for operating on sockets and socket buffers
66 u_long sb_max = SB_MAX;
68 SB_MAX * MCLBYTES / (MSIZE + MCLBYTES); /* adjusted sb_max */
70 static u_long sb_efficiency = 8; /* parameter for sbreserve() */
73 * Procedures to manipulate state flags of socket
74 * and do appropriate wakeups. Normal sequence from the
75 * active (originating) side is that soisconnecting() is
76 * called during processing of connect() call,
77 * resulting in an eventual call to soisconnected() if/when the
78 * connection is established. When the connection is torn down
79 * soisdisconnecting() is called during processing of disconnect() call,
80 * and soisdisconnected() is called when the connection to the peer
81 * is totally severed. The semantics of these routines are such that
82 * connectionless protocols can call soisconnected() and soisdisconnected()
83 * only, bypassing the in-progress calls when setting up a ``connection''
86 * From the passive side, a socket is created with
87 * two queues of sockets: so_incomp for connections in progress
88 * and so_comp for connections already made and awaiting user acceptance.
89 * As a protocol is preparing incoming connections, it creates a socket
90 * structure queued on so_incomp by calling sonewconn(). When the connection
91 * is established, soisconnected() is called, and transfers the
92 * socket structure to so_comp, making it available to accept().
94 * If a socket is closed with sockets on either
95 * so_incomp or so_comp, these sockets are dropped.
97 * If higher level protocols are implemented in
98 * the kernel, the wakeups done here will sometimes
99 * cause software-interrupt process scheduling.
107 so->so_state &= ~(SS_ISCONNECTED|SS_ISDISCONNECTING);
108 so->so_state |= SS_ISCONNECTING;
115 struct socket *head = so->so_head;
117 so->so_state &= ~(SS_ISCONNECTING|SS_ISDISCONNECTING|SS_ISCONFIRMING);
118 so->so_state |= SS_ISCONNECTED;
119 if (head && (so->so_state & SS_INCOMP)) {
120 if ((so->so_options & SO_ACCEPTFILTER) != 0) {
121 so->so_upcall = head->so_accf->so_accept_filter->accf_callback;
122 so->so_upcallarg = head->so_accf->so_accept_filter_arg;
123 so->so_rcv.sb_flags |= SB_UPCALL;
124 so->so_options &= ~SO_ACCEPTFILTER;
125 so->so_upcall(so, so->so_upcallarg, 0);
128 TAILQ_REMOVE(&head->so_incomp, so, so_list);
130 so->so_state &= ~SS_INCOMP;
131 TAILQ_INSERT_TAIL(&head->so_comp, so, so_list);
133 so->so_state |= SS_COMP;
135 wakeup_one(&head->so_timeo);
137 wakeup(&so->so_timeo);
144 soisdisconnecting(so)
148 so->so_state &= ~SS_ISCONNECTING;
149 so->so_state |= (SS_ISDISCONNECTING|SS_CANTRCVMORE|SS_CANTSENDMORE);
150 wakeup((caddr_t)&so->so_timeo);
160 so->so_state &= ~(SS_ISCONNECTING|SS_ISCONNECTED|SS_ISDISCONNECTING);
161 so->so_state |= (SS_CANTRCVMORE|SS_CANTSENDMORE|SS_ISDISCONNECTED);
162 wakeup((caddr_t)&so->so_timeo);
163 sbdrop(&so->so_snd, so->so_snd.sb_cc);
169 * When an attempt at a new connection is noted on a socket
170 * which accepts connections, sonewconn is called. If the
171 * connection is possible (subject to space constraints, etc.)
172 * then we allocate a new structure, propoerly linked into the
173 * data structure of the original socket, and return this.
174 * Connstatus may be 0, or SO_ISCONFIRMING, or SO_ISCONNECTED.
177 sonewconn(struct socket *head, int connstatus)
180 struct pru_attach_info ai;
182 if (head->so_qlen > 3 * head->so_qlimit / 2)
183 return ((struct socket *)0);
186 return ((struct socket *)0);
187 if ((head->so_options & SO_ACCEPTFILTER) != 0)
190 so->so_type = head->so_type;
191 so->so_options = head->so_options &~ SO_ACCEPTCONN;
192 so->so_linger = head->so_linger;
193 so->so_state = head->so_state | SS_NOFDREF;
194 so->so_proto = head->so_proto;
195 so->so_timeo = head->so_timeo;
196 so->so_cred = crhold(head->so_cred);
199 ai.fd_rdir = NULL; /* jail code cruft XXX JH */
200 if (soreserve(so, head->so_snd.sb_hiwat, head->so_rcv.sb_hiwat, NULL) ||
201 /* Directly call function since we're already at protocol level. */
202 (*so->so_proto->pr_usrreqs->pru_attach)(so, 0, &ai)) {
204 return ((struct socket *)0);
208 TAILQ_INSERT_TAIL(&head->so_comp, so, so_list);
209 so->so_state |= SS_COMP;
212 if (head->so_incqlen > head->so_qlimit) {
214 sp = TAILQ_FIRST(&head->so_incomp);
217 TAILQ_INSERT_TAIL(&head->so_incomp, so, so_list);
218 so->so_state |= SS_INCOMP;
223 wakeup((caddr_t)&head->so_timeo);
224 so->so_state |= connstatus;
230 * Socantsendmore indicates that no more data will be sent on the
231 * socket; it would normally be applied to a socket when the user
232 * informs the system that no more data is to be sent, by the protocol
233 * code (in case PRU_SHUTDOWN). Socantrcvmore indicates that no more data
234 * will be received, and will normally be applied to the socket by a
235 * protocol when it detects that the peer will send no more data.
236 * Data queued for reading in the socket may yet be read.
244 so->so_state |= SS_CANTSENDMORE;
253 so->so_state |= SS_CANTRCVMORE;
258 * Wait for data to arrive at/drain from a socket buffer.
265 sb->sb_flags |= SB_WAIT;
266 return (tsleep((caddr_t)&sb->sb_cc,
267 ((sb->sb_flags & SB_NOINTR) ? 0 : PCATCH),
273 * Lock a sockbuf already known to be locked;
274 * return any error returned from sleep (EINTR).
282 while (sb->sb_flags & SB_LOCK) {
283 sb->sb_flags |= SB_WANT;
284 error = tsleep((caddr_t)&sb->sb_flags,
285 ((sb->sb_flags & SB_NOINTR) ? 0 : PCATCH),
290 sb->sb_flags |= SB_LOCK;
295 * Wakeup processes waiting on a socket buffer.
296 * Do asynchronous notification via SIGIO
297 * if the socket has the SS_ASYNC flag set.
304 struct selinfo *selinfo = &sb->sb_sel;
307 sb->sb_flags &= ~SB_SEL;
308 if (sb->sb_flags & SB_WAIT) {
309 sb->sb_flags &= ~SB_WAIT;
310 wakeup((caddr_t)&sb->sb_cc);
312 if ((so->so_state & SS_ASYNC) && so->so_sigio != NULL)
313 pgsigio(so->so_sigio, SIGIO, 0);
314 if (sb->sb_flags & SB_UPCALL)
315 (*so->so_upcall)(so, so->so_upcallarg, M_DONTWAIT);
316 if (sb->sb_flags & SB_AIO)
318 KNOTE(&selinfo->si_note, 0);
319 if (sb->sb_flags & SB_MEVENT) {
320 struct netmsg_so_notify *msg, *nmsg;
322 TAILQ_FOREACH_MUTABLE(msg, &selinfo->si_mlist, nm_list, nmsg) {
323 if (msg->nm_predicate((struct netmsg *)msg)) {
324 struct lwkt_msg *lmsg = &msg->nm_lmsg;
326 lwkt_replymsg(lmsg, lmsg->ms_error);
327 TAILQ_REMOVE(&selinfo->si_mlist, msg, nm_list);
331 if (TAILQ_EMPTY(&sb->sb_sel.si_mlist))
332 sb->sb_flags &= ~SB_MEVENT;
337 * Socket buffer (struct sockbuf) utility routines.
339 * Each socket contains two socket buffers: one for sending data and
340 * one for receiving data. Each buffer contains a queue of mbufs,
341 * information about the number of mbufs and amount of data in the
342 * queue, and other fields allowing select() statements and notification
343 * on data availability to be implemented.
345 * Data stored in a socket buffer is maintained as a list of records.
346 * Each record is a list of mbufs chained together with the m_next
347 * field. Records are chained together with the m_nextpkt field. The upper
348 * level routine soreceive() expects the following conventions to be
349 * observed when placing information in the receive buffer:
351 * 1. If the protocol requires each message be preceded by the sender's
352 * name, then a record containing that name must be present before
353 * any associated data (mbuf's must be of type MT_SONAME).
354 * 2. If the protocol supports the exchange of ``access rights'' (really
355 * just additional data associated with the message), and there are
356 * ``rights'' to be received, then a record containing this data
357 * should be present (mbuf's must be of type MT_RIGHTS).
358 * 3. If a name or rights record exists, then it must be followed by
359 * a data record, perhaps of zero length.
361 * Before using a new socket structure it is first necessary to reserve
362 * buffer space to the socket, by calling sbreserve(). This should commit
363 * some of the available buffer space in the system buffer pool for the
364 * socket (currently, it does nothing but enforce limits). The space
365 * should be released by calling sbrelease() when the socket is destroyed.
369 soreserve(struct socket *so, u_long sndcc, u_long rcvcc, struct rlimit *rl)
371 if (sbreserve(&so->so_snd, sndcc, so, rl) == 0)
373 if (sbreserve(&so->so_rcv, rcvcc, so, rl) == 0)
375 if (so->so_rcv.sb_lowat == 0)
376 so->so_rcv.sb_lowat = 1;
377 if (so->so_snd.sb_lowat == 0)
378 so->so_snd.sb_lowat = MCLBYTES;
379 if (so->so_snd.sb_lowat > so->so_snd.sb_hiwat)
380 so->so_snd.sb_lowat = so->so_snd.sb_hiwat;
383 sbrelease(&so->so_snd, so);
389 sysctl_handle_sb_max(SYSCTL_HANDLER_ARGS)
392 u_long old_sb_max = sb_max;
394 error = SYSCTL_OUT(req, arg1, sizeof(int));
395 if (error || !req->newptr)
397 error = SYSCTL_IN(req, arg1, sizeof(int));
400 if (sb_max < MSIZE + MCLBYTES) {
404 sb_max_adj = (u_quad_t)sb_max * MCLBYTES / (MSIZE + MCLBYTES);
409 * Allot mbufs to a sockbuf.
410 * Attempt to scale mbmax so that mbcnt doesn't become limiting
411 * if buffering efficiency is near the normal case.
414 sbreserve(struct sockbuf *sb, u_long cc, struct socket *so, struct rlimit *rl)
418 * rl will only be NULL when we're in an interrupt (eg, in tcp_input)
419 * or when called from netgraph (ie, ngd_attach)
423 if (!chgsbsize(so->so_cred->cr_uidinfo, &sb->sb_hiwat, cc,
424 rl ? rl->rlim_cur : RLIM_INFINITY)) {
427 sb->sb_mbmax = min(cc * sb_efficiency, sb_max);
428 if (sb->sb_lowat > sb->sb_hiwat)
429 sb->sb_lowat = sb->sb_hiwat;
434 * Free mbufs held by a socket, and reserved mbuf space.
443 (void)chgsbsize(so->so_cred->cr_uidinfo, &sb->sb_hiwat, 0,
449 * Routines to add and remove
450 * data from an mbuf queue.
452 * The routines sbappend() or sbappendrecord() are normally called to
453 * append new mbufs to a socket buffer, after checking that adequate
454 * space is available, comparing the function sbspace() with the amount
455 * of data to be added. sbappendrecord() differs from sbappend() in
456 * that data supplied is treated as the beginning of a new record.
457 * To place a sender's address, optional access rights, and data in a
458 * socket receive buffer, sbappendaddr() should be used. To place
459 * access rights and data in a socket receive buffer, sbappendrights()
460 * should be used. In either case, the new data begins a new record.
461 * Note that unlike sbappend() and sbappendrecord(), these routines check
462 * for the caller that there will be enough space to store the data.
463 * Each fails if there is not enough space, or if it cannot find mbufs
464 * to store additional information in.
466 * Reliable protocols may use the socket send buffer to hold data
467 * awaiting acknowledgement. Data is normally copied from a socket
468 * send buffer in a protocol with m_copy for output to a peer,
469 * and then removing the data from the socket buffer with sbdrop()
470 * or sbdroprecord() when the data is acknowledged by the peer.
474 * Append mbuf chain m to the last record in the
475 * socket buffer sb. The additional space associated
476 * the mbuf chain is recorded in sb. Empty mbufs are
477 * discarded and mbufs are compacted where possible.
493 if (n->m_flags & M_EOR) {
494 sbappendrecord(sb, m); /* XXXXXX!!!! */
497 } while (n->m_next && (n = n->m_next));
499 sbcompress(sb, m, n);
509 u_long len = 0, mbcnt = 0;
511 for (m = sb->sb_mb; m; m = n) {
513 for (; m; m = m->m_next) {
516 if (m->m_flags & M_EXT) /*XXX*/ /* pretty sure this is bogus */
517 mbcnt += m->m_ext.ext_size;
520 if (len != sb->sb_cc || mbcnt != sb->sb_mbcnt) {
521 printf("cc %ld != %ld || mbcnt %ld != %ld\n", len, sb->sb_cc,
522 mbcnt, sb->sb_mbcnt);
529 * As above, except the mbuf chain
530 * begins a new record.
533 sbappendrecord(sb, m0)
546 * Put the first mbuf on the queue.
547 * Note this permits zero length records.
556 if (m && (m0->m_flags & M_EOR)) {
557 m0->m_flags &= ~M_EOR;
560 sbcompress(sb, m, m0);
564 * As above except that OOB data
565 * is inserted at the beginning of the sockbuf,
566 * but after any other OOB data.
578 for (mp = &sb->sb_mb; *mp ; mp = &((*mp)->m_nextpkt)) {
584 continue; /* WANT next train */
589 goto again; /* inspect THIS train further */
594 * Put the first mbuf on the queue.
595 * Note this permits zero length records.
602 if (m && (m0->m_flags & M_EOR)) {
603 m0->m_flags &= ~M_EOR;
606 sbcompress(sb, m, m0);
610 * Append address and data, and optionally, control (ancillary) data
611 * to the receive queue of a socket. If present,
612 * m0 must include a packet header with total length.
613 * Returns 0 if no space in sockbuf or insufficient mbufs.
616 sbappendaddr(sb, asa, m0, control)
618 struct sockaddr *asa;
619 struct mbuf *m0, *control;
622 int space = asa->sa_len;
624 if (m0 && (m0->m_flags & M_PKTHDR) == 0)
625 panic("sbappendaddr");
628 space += m0->m_pkthdr.len;
629 for (n = control; n; n = n->m_next) {
631 if (n->m_next == 0) /* keep pointer to last control buf */
634 if (space > sbspace(sb))
636 if (asa->sa_len > MLEN)
638 MGET(m, M_DONTWAIT, MT_SONAME);
641 m->m_len = asa->sa_len;
642 bcopy((caddr_t)asa, mtod(m, caddr_t), asa->sa_len);
644 n->m_next = m0; /* concatenate data to control */
648 for (n = m; n; n = n->m_next)
661 sbappendcontrol(sb, m0, control)
663 struct mbuf *control, *m0;
669 panic("sbappendcontrol");
670 for (m = control; ; m = m->m_next) {
675 n = m; /* save pointer to last control buffer */
676 for (m = m0; m; m = m->m_next)
678 if (space > sbspace(sb))
680 n->m_next = m0; /* concatenate data to control */
681 for (m = control; m; m = m->m_next)
687 n->m_nextpkt = control;
694 * Compress mbuf chain m into the socket
695 * buffer sb following mbuf n. If n
696 * is null, the buffer is presumed empty.
707 eor |= m->m_flags & M_EOR;
710 (((o = m->m_next) || (o = n)) &&
711 o->m_type == m->m_type))) {
715 if (n && (n->m_flags & M_EOR) == 0 &&
717 m->m_len <= MCLBYTES / 4 && /* XXX: Don't copy too much */
718 m->m_len <= M_TRAILINGSPACE(n) &&
719 n->m_type == m->m_type) {
720 bcopy(mtod(m, caddr_t), mtod(n, caddr_t) + n->m_len,
722 n->m_len += m->m_len;
723 sb->sb_cc += m->m_len;
733 m->m_flags &= ~M_EOR;
741 printf("semi-panic: sbcompress\n");
746 * Free all mbufs in a sockbuf.
747 * Check that all resources are reclaimed.
754 if (sb->sb_flags & SB_LOCK)
755 panic("sbflush: locked");
756 while (sb->sb_mbcnt) {
758 * Don't call sbdrop(sb, 0) if the leading mbuf is non-empty:
759 * we would loop forever. Panic instead.
761 if (!sb->sb_cc && (sb->sb_mb == NULL || sb->sb_mb->m_len))
763 sbdrop(sb, (int)sb->sb_cc);
765 if (sb->sb_cc || sb->sb_mb || sb->sb_mbcnt)
766 panic("sbflush: cc %ld || mb %p || mbcnt %ld", sb->sb_cc, (void *)sb->sb_mb, sb->sb_mbcnt);
770 * Drop data from (the front of) a sockbuf.
780 next = (m = sb->sb_mb) ? m->m_nextpkt : 0;
789 if (m->m_len > len) {
799 while (m && m->m_len == 0) {
811 * Drop a record off the front of a sockbuf
812 * and move the next record to the front.
822 sb->sb_mb = m->m_nextpkt;
831 * Create a "control" mbuf containing the specified data
832 * with the specified type for presentation on a socket buffer.
835 sbcreatecontrol(p, size, type, level)
843 if (CMSG_SPACE((u_int)size) > MCLBYTES)
844 return ((struct mbuf *) NULL);
845 if ((m = m_get(M_DONTWAIT, MT_CONTROL)) == NULL)
846 return ((struct mbuf *) NULL);
847 if (CMSG_SPACE((u_int)size) > MLEN) {
848 MCLGET(m, M_DONTWAIT);
849 if ((m->m_flags & M_EXT) == 0) {
851 return ((struct mbuf *) NULL);
854 cp = mtod(m, struct cmsghdr *);
856 KASSERT(CMSG_SPACE((u_int)size) <= M_TRAILINGSPACE(m),
857 ("sbcreatecontrol: short mbuf"));
859 (void)memcpy(CMSG_DATA(cp), p, size);
860 m->m_len = CMSG_SPACE(size);
861 cp->cmsg_len = CMSG_LEN(size);
862 cp->cmsg_level = level;
863 cp->cmsg_type = type;
868 * Some routines that return EOPNOTSUPP for entry points that are not
869 * supported by a protocol. Fill in as needed.
872 pru_accept_notsupp(struct socket *so, struct sockaddr **nam)
878 pru_connect_notsupp(struct socket *so, struct sockaddr *nam, struct thread *td)
884 pru_connect2_notsupp(struct socket *so1, struct socket *so2)
890 pru_control_notsupp(struct socket *so, u_long cmd, caddr_t data,
891 struct ifnet *ifp, struct thread *td)
897 pru_listen_notsupp(struct socket *so, struct thread *td)
903 pru_rcvd_notsupp(struct socket *so, int flags)
909 pru_rcvoob_notsupp(struct socket *so, struct mbuf *m, int flags)
915 * This isn't really a ``null'' operation, but it's the default one
916 * and doesn't do anything destructive.
919 pru_sense_null(struct socket *so, struct stat *sb)
921 sb->st_blksize = so->so_snd.sb_hiwat;
926 * Make a copy of a sockaddr in a malloced buffer of type M_SONAME.
929 dup_sockaddr(sa, canwait)
933 struct sockaddr *sa2;
935 MALLOC(sa2, struct sockaddr *, sa->sa_len, M_SONAME,
936 canwait ? M_WAITOK : M_NOWAIT);
938 bcopy(sa, sa2, sa->sa_len);
943 * Create an external-format (``xsocket'') structure using the information
944 * in the kernel-format socket structure pointed to by so. This is done
945 * to reduce the spew of irrelevant information over this interface,
946 * to isolate user code from changes in the kernel structure, and
947 * potentially to provide information-hiding if we decide that
948 * some of this information should be hidden from users.
951 sotoxsocket(struct socket *so, struct xsocket *xso)
953 xso->xso_len = sizeof *xso;
955 xso->so_type = so->so_type;
956 xso->so_options = so->so_options;
957 xso->so_linger = so->so_linger;
958 xso->so_state = so->so_state;
959 xso->so_pcb = so->so_pcb;
960 xso->xso_protocol = so->so_proto->pr_protocol;
961 xso->xso_family = so->so_proto->pr_domain->dom_family;
962 xso->so_qlen = so->so_qlen;
963 xso->so_incqlen = so->so_incqlen;
964 xso->so_qlimit = so->so_qlimit;
965 xso->so_timeo = so->so_timeo;
966 xso->so_error = so->so_error;
967 xso->so_pgid = so->so_sigio ? so->so_sigio->sio_pgid : 0;
968 xso->so_oobmark = so->so_oobmark;
969 sbtoxsockbuf(&so->so_snd, &xso->so_snd);
970 sbtoxsockbuf(&so->so_rcv, &xso->so_rcv);
971 xso->so_uid = so->so_cred->cr_uid;
975 * This does the same for sockbufs. Note that the xsockbuf structure,
976 * since it is always embedded in a socket, does not include a self
977 * pointer nor a length. We make this entry point public in case
978 * some other mechanism needs it.
981 sbtoxsockbuf(struct sockbuf *sb, struct xsockbuf *xsb)
983 xsb->sb_cc = sb->sb_cc;
984 xsb->sb_hiwat = sb->sb_hiwat;
985 xsb->sb_mbcnt = sb->sb_mbcnt;
986 xsb->sb_mbmax = sb->sb_mbmax;
987 xsb->sb_lowat = sb->sb_lowat;
988 xsb->sb_flags = sb->sb_flags;
989 xsb->sb_timeo = sb->sb_timeo;
993 * Here is the definition of some of the basic objects in the kern.ipc
996 SYSCTL_NODE(_kern, KERN_IPC, ipc, CTLFLAG_RW, 0, "IPC");
998 /* This takes the place of kern.maxsockbuf, which moved to kern.ipc. */
1000 SYSCTL_INT(_kern, KERN_DUMMY, dummy, CTLFLAG_RW, &dummy, 0, "");
1001 SYSCTL_OID(_kern_ipc, KIPC_MAXSOCKBUF, maxsockbuf, CTLTYPE_INT|CTLFLAG_RW,
1002 &sb_max, 0, sysctl_handle_sb_max, "I", "Maximum socket buffer size");
1003 SYSCTL_INT(_kern_ipc, OID_AUTO, maxsockets, CTLFLAG_RD,
1004 &maxsockets, 0, "Maximum number of sockets avaliable");
1005 SYSCTL_INT(_kern_ipc, KIPC_SOCKBUF_WASTE, sockbuf_waste_factor, CTLFLAG_RW,
1006 &sb_efficiency, 0, "");
1009 * Initialise maxsockets
1011 static void init_maxsockets(void *ignored)
1013 TUNABLE_INT_FETCH("kern.ipc.maxsockets", &maxsockets);
1014 maxsockets = imax(maxsockets, imax(maxfiles, nmbclusters));
1016 SYSINIT(param, SI_SUB_TUNABLES, SI_ORDER_ANY, init_maxsockets, NULL);