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.8 2004/03/06 01:58:54 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>
60 * Primitive routines for operating on sockets and socket buffers
63 u_long sb_max = SB_MAX;
65 SB_MAX * MCLBYTES / (MSIZE + MCLBYTES); /* adjusted sb_max */
67 static u_long sb_efficiency = 8; /* parameter for sbreserve() */
70 * Procedures to manipulate state flags of socket
71 * and do appropriate wakeups. Normal sequence from the
72 * active (originating) side is that soisconnecting() is
73 * called during processing of connect() call,
74 * resulting in an eventual call to soisconnected() if/when the
75 * connection is established. When the connection is torn down
76 * soisdisconnecting() is called during processing of disconnect() call,
77 * and soisdisconnected() is called when the connection to the peer
78 * is totally severed. The semantics of these routines are such that
79 * connectionless protocols can call soisconnected() and soisdisconnected()
80 * only, bypassing the in-progress calls when setting up a ``connection''
83 * From the passive side, a socket is created with
84 * two queues of sockets: so_incomp for connections in progress
85 * and so_comp for connections already made and awaiting user acceptance.
86 * As a protocol is preparing incoming connections, it creates a socket
87 * structure queued on so_incomp by calling sonewconn(). When the connection
88 * is established, soisconnected() is called, and transfers the
89 * socket structure to so_comp, making it available to accept().
91 * If a socket is closed with sockets on either
92 * so_incomp or so_comp, these sockets are dropped.
94 * If higher level protocols are implemented in
95 * the kernel, the wakeups done here will sometimes
96 * cause software-interrupt process scheduling.
104 so->so_state &= ~(SS_ISCONNECTED|SS_ISDISCONNECTING);
105 so->so_state |= SS_ISCONNECTING;
112 struct socket *head = so->so_head;
114 so->so_state &= ~(SS_ISCONNECTING|SS_ISDISCONNECTING|SS_ISCONFIRMING);
115 so->so_state |= SS_ISCONNECTED;
116 if (head && (so->so_state & SS_INCOMP)) {
117 if ((so->so_options & SO_ACCEPTFILTER) != 0) {
118 so->so_upcall = head->so_accf->so_accept_filter->accf_callback;
119 so->so_upcallarg = head->so_accf->so_accept_filter_arg;
120 so->so_rcv.sb_flags |= SB_UPCALL;
121 so->so_options &= ~SO_ACCEPTFILTER;
122 so->so_upcall(so, so->so_upcallarg, 0);
125 TAILQ_REMOVE(&head->so_incomp, so, so_list);
127 so->so_state &= ~SS_INCOMP;
128 TAILQ_INSERT_TAIL(&head->so_comp, so, so_list);
130 so->so_state |= SS_COMP;
132 wakeup_one(&head->so_timeo);
134 wakeup(&so->so_timeo);
141 soisdisconnecting(so)
145 so->so_state &= ~SS_ISCONNECTING;
146 so->so_state |= (SS_ISDISCONNECTING|SS_CANTRCVMORE|SS_CANTSENDMORE);
147 wakeup((caddr_t)&so->so_timeo);
157 so->so_state &= ~(SS_ISCONNECTING|SS_ISCONNECTED|SS_ISDISCONNECTING);
158 so->so_state |= (SS_CANTRCVMORE|SS_CANTSENDMORE|SS_ISDISCONNECTED);
159 wakeup((caddr_t)&so->so_timeo);
160 sbdrop(&so->so_snd, so->so_snd.sb_cc);
166 * When an attempt at a new connection is noted on a socket
167 * which accepts connections, sonewconn is called. If the
168 * connection is possible (subject to space constraints, etc.)
169 * then we allocate a new structure, propoerly linked into the
170 * data structure of the original socket, and return this.
171 * Connstatus may be 0, or SO_ISCONFIRMING, or SO_ISCONNECTED.
174 sonewconn(struct socket *head, int connstatus)
177 struct pru_attach_info ai;
179 if (head->so_qlen > 3 * head->so_qlimit / 2)
180 return ((struct socket *)0);
183 return ((struct socket *)0);
184 if ((head->so_options & SO_ACCEPTFILTER) != 0)
187 so->so_type = head->so_type;
188 so->so_options = head->so_options &~ SO_ACCEPTCONN;
189 so->so_linger = head->so_linger;
190 so->so_state = head->so_state | SS_NOFDREF;
191 so->so_proto = head->so_proto;
192 so->so_timeo = head->so_timeo;
193 so->so_cred = crhold(head->so_cred);
196 ai.fd_rdir = NULL; /* jail code cruft XXX JH */
197 if (soreserve(so, head->so_snd.sb_hiwat, head->so_rcv.sb_hiwat, NULL) ||
198 /* Directly call function since we're already at protocol level. */
199 (*so->so_proto->pr_usrreqs->pru_attach)(so, 0, &ai)) {
201 return ((struct socket *)0);
205 TAILQ_INSERT_TAIL(&head->so_comp, so, so_list);
206 so->so_state |= SS_COMP;
209 if (head->so_incqlen > head->so_qlimit) {
211 sp = TAILQ_FIRST(&head->so_incomp);
214 TAILQ_INSERT_TAIL(&head->so_incomp, so, so_list);
215 so->so_state |= SS_INCOMP;
220 wakeup((caddr_t)&head->so_timeo);
221 so->so_state |= connstatus;
227 * Socantsendmore indicates that no more data will be sent on the
228 * socket; it would normally be applied to a socket when the user
229 * informs the system that no more data is to be sent, by the protocol
230 * code (in case PRU_SHUTDOWN). Socantrcvmore indicates that no more data
231 * will be received, and will normally be applied to the socket by a
232 * protocol when it detects that the peer will send no more data.
233 * Data queued for reading in the socket may yet be read.
241 so->so_state |= SS_CANTSENDMORE;
250 so->so_state |= SS_CANTRCVMORE;
255 * Wait for data to arrive at/drain from a socket buffer.
262 sb->sb_flags |= SB_WAIT;
263 return (tsleep((caddr_t)&sb->sb_cc,
264 ((sb->sb_flags & SB_NOINTR) ? 0 : PCATCH),
270 * Lock a sockbuf already known to be locked;
271 * return any error returned from sleep (EINTR).
279 while (sb->sb_flags & SB_LOCK) {
280 sb->sb_flags |= SB_WANT;
281 error = tsleep((caddr_t)&sb->sb_flags,
282 ((sb->sb_flags & SB_NOINTR) ? 0 : PCATCH),
287 sb->sb_flags |= SB_LOCK;
292 * Wakeup processes waiting on a socket buffer.
293 * Do asynchronous notification via SIGIO
294 * if the socket has the SS_ASYNC flag set.
301 selwakeup(&sb->sb_sel);
302 sb->sb_flags &= ~SB_SEL;
303 if (sb->sb_flags & SB_WAIT) {
304 sb->sb_flags &= ~SB_WAIT;
305 wakeup((caddr_t)&sb->sb_cc);
307 if ((so->so_state & SS_ASYNC) && so->so_sigio != NULL)
308 pgsigio(so->so_sigio, SIGIO, 0);
309 if (sb->sb_flags & SB_UPCALL)
310 (*so->so_upcall)(so, so->so_upcallarg, M_DONTWAIT);
311 if (sb->sb_flags & SB_AIO)
313 KNOTE(&sb->sb_sel.si_note, 0);
317 * Socket buffer (struct sockbuf) utility routines.
319 * Each socket contains two socket buffers: one for sending data and
320 * one for receiving data. Each buffer contains a queue of mbufs,
321 * information about the number of mbufs and amount of data in the
322 * queue, and other fields allowing select() statements and notification
323 * on data availability to be implemented.
325 * Data stored in a socket buffer is maintained as a list of records.
326 * Each record is a list of mbufs chained together with the m_next
327 * field. Records are chained together with the m_nextpkt field. The upper
328 * level routine soreceive() expects the following conventions to be
329 * observed when placing information in the receive buffer:
331 * 1. If the protocol requires each message be preceded by the sender's
332 * name, then a record containing that name must be present before
333 * any associated data (mbuf's must be of type MT_SONAME).
334 * 2. If the protocol supports the exchange of ``access rights'' (really
335 * just additional data associated with the message), and there are
336 * ``rights'' to be received, then a record containing this data
337 * should be present (mbuf's must be of type MT_RIGHTS).
338 * 3. If a name or rights record exists, then it must be followed by
339 * a data record, perhaps of zero length.
341 * Before using a new socket structure it is first necessary to reserve
342 * buffer space to the socket, by calling sbreserve(). This should commit
343 * some of the available buffer space in the system buffer pool for the
344 * socket (currently, it does nothing but enforce limits). The space
345 * should be released by calling sbrelease() when the socket is destroyed.
349 soreserve(struct socket *so, u_long sndcc, u_long rcvcc, struct rlimit *rl)
351 if (sbreserve(&so->so_snd, sndcc, so, rl) == 0)
353 if (sbreserve(&so->so_rcv, rcvcc, so, rl) == 0)
355 if (so->so_rcv.sb_lowat == 0)
356 so->so_rcv.sb_lowat = 1;
357 if (so->so_snd.sb_lowat == 0)
358 so->so_snd.sb_lowat = MCLBYTES;
359 if (so->so_snd.sb_lowat > so->so_snd.sb_hiwat)
360 so->so_snd.sb_lowat = so->so_snd.sb_hiwat;
363 sbrelease(&so->so_snd, so);
369 sysctl_handle_sb_max(SYSCTL_HANDLER_ARGS)
372 u_long old_sb_max = sb_max;
374 error = SYSCTL_OUT(req, arg1, sizeof(int));
375 if (error || !req->newptr)
377 error = SYSCTL_IN(req, arg1, sizeof(int));
380 if (sb_max < MSIZE + MCLBYTES) {
384 sb_max_adj = (u_quad_t)sb_max * MCLBYTES / (MSIZE + MCLBYTES);
389 * Allot mbufs to a sockbuf.
390 * Attempt to scale mbmax so that mbcnt doesn't become limiting
391 * if buffering efficiency is near the normal case.
394 sbreserve(struct sockbuf *sb, u_long cc, struct socket *so, struct rlimit *rl)
398 * rl will only be NULL when we're in an interrupt (eg, in tcp_input)
399 * or when called from netgraph (ie, ngd_attach)
403 if (!chgsbsize(so->so_cred->cr_uidinfo, &sb->sb_hiwat, cc,
404 rl ? rl->rlim_cur : RLIM_INFINITY)) {
407 sb->sb_mbmax = min(cc * sb_efficiency, sb_max);
408 if (sb->sb_lowat > sb->sb_hiwat)
409 sb->sb_lowat = sb->sb_hiwat;
414 * Free mbufs held by a socket, and reserved mbuf space.
423 (void)chgsbsize(so->so_cred->cr_uidinfo, &sb->sb_hiwat, 0,
429 * Routines to add and remove
430 * data from an mbuf queue.
432 * The routines sbappend() or sbappendrecord() are normally called to
433 * append new mbufs to a socket buffer, after checking that adequate
434 * space is available, comparing the function sbspace() with the amount
435 * of data to be added. sbappendrecord() differs from sbappend() in
436 * that data supplied is treated as the beginning of a new record.
437 * To place a sender's address, optional access rights, and data in a
438 * socket receive buffer, sbappendaddr() should be used. To place
439 * access rights and data in a socket receive buffer, sbappendrights()
440 * should be used. In either case, the new data begins a new record.
441 * Note that unlike sbappend() and sbappendrecord(), these routines check
442 * for the caller that there will be enough space to store the data.
443 * Each fails if there is not enough space, or if it cannot find mbufs
444 * to store additional information in.
446 * Reliable protocols may use the socket send buffer to hold data
447 * awaiting acknowledgement. Data is normally copied from a socket
448 * send buffer in a protocol with m_copy for output to a peer,
449 * and then removing the data from the socket buffer with sbdrop()
450 * or sbdroprecord() when the data is acknowledged by the peer.
454 * Append mbuf chain m to the last record in the
455 * socket buffer sb. The additional space associated
456 * the mbuf chain is recorded in sb. Empty mbufs are
457 * discarded and mbufs are compacted where possible.
473 if (n->m_flags & M_EOR) {
474 sbappendrecord(sb, m); /* XXXXXX!!!! */
477 } while (n->m_next && (n = n->m_next));
479 sbcompress(sb, m, n);
489 u_long len = 0, mbcnt = 0;
491 for (m = sb->sb_mb; m; m = n) {
493 for (; m; m = m->m_next) {
496 if (m->m_flags & M_EXT) /*XXX*/ /* pretty sure this is bogus */
497 mbcnt += m->m_ext.ext_size;
500 if (len != sb->sb_cc || mbcnt != sb->sb_mbcnt) {
501 printf("cc %ld != %ld || mbcnt %ld != %ld\n", len, sb->sb_cc,
502 mbcnt, sb->sb_mbcnt);
509 * As above, except the mbuf chain
510 * begins a new record.
513 sbappendrecord(sb, m0)
526 * Put the first mbuf on the queue.
527 * Note this permits zero length records.
536 if (m && (m0->m_flags & M_EOR)) {
537 m0->m_flags &= ~M_EOR;
540 sbcompress(sb, m, m0);
544 * As above except that OOB data
545 * is inserted at the beginning of the sockbuf,
546 * but after any other OOB data.
558 for (mp = &sb->sb_mb; *mp ; mp = &((*mp)->m_nextpkt)) {
564 continue; /* WANT next train */
569 goto again; /* inspect THIS train further */
574 * Put the first mbuf on the queue.
575 * Note this permits zero length records.
582 if (m && (m0->m_flags & M_EOR)) {
583 m0->m_flags &= ~M_EOR;
586 sbcompress(sb, m, m0);
590 * Append address and data, and optionally, control (ancillary) data
591 * to the receive queue of a socket. If present,
592 * m0 must include a packet header with total length.
593 * Returns 0 if no space in sockbuf or insufficient mbufs.
596 sbappendaddr(sb, asa, m0, control)
598 struct sockaddr *asa;
599 struct mbuf *m0, *control;
602 int space = asa->sa_len;
604 if (m0 && (m0->m_flags & M_PKTHDR) == 0)
605 panic("sbappendaddr");
608 space += m0->m_pkthdr.len;
609 for (n = control; n; n = n->m_next) {
611 if (n->m_next == 0) /* keep pointer to last control buf */
614 if (space > sbspace(sb))
616 if (asa->sa_len > MLEN)
618 MGET(m, M_DONTWAIT, MT_SONAME);
621 m->m_len = asa->sa_len;
622 bcopy((caddr_t)asa, mtod(m, caddr_t), asa->sa_len);
624 n->m_next = m0; /* concatenate data to control */
628 for (n = m; n; n = n->m_next)
641 sbappendcontrol(sb, m0, control)
643 struct mbuf *control, *m0;
649 panic("sbappendcontrol");
650 for (m = control; ; m = m->m_next) {
655 n = m; /* save pointer to last control buffer */
656 for (m = m0; m; m = m->m_next)
658 if (space > sbspace(sb))
660 n->m_next = m0; /* concatenate data to control */
661 for (m = control; m; m = m->m_next)
667 n->m_nextpkt = control;
674 * Compress mbuf chain m into the socket
675 * buffer sb following mbuf n. If n
676 * is null, the buffer is presumed empty.
687 eor |= m->m_flags & M_EOR;
690 (((o = m->m_next) || (o = n)) &&
691 o->m_type == m->m_type))) {
695 if (n && (n->m_flags & M_EOR) == 0 &&
697 m->m_len <= MCLBYTES / 4 && /* XXX: Don't copy too much */
698 m->m_len <= M_TRAILINGSPACE(n) &&
699 n->m_type == m->m_type) {
700 bcopy(mtod(m, caddr_t), mtod(n, caddr_t) + n->m_len,
702 n->m_len += m->m_len;
703 sb->sb_cc += m->m_len;
713 m->m_flags &= ~M_EOR;
721 printf("semi-panic: sbcompress\n");
726 * Free all mbufs in a sockbuf.
727 * Check that all resources are reclaimed.
734 if (sb->sb_flags & SB_LOCK)
735 panic("sbflush: locked");
736 while (sb->sb_mbcnt) {
738 * Don't call sbdrop(sb, 0) if the leading mbuf is non-empty:
739 * we would loop forever. Panic instead.
741 if (!sb->sb_cc && (sb->sb_mb == NULL || sb->sb_mb->m_len))
743 sbdrop(sb, (int)sb->sb_cc);
745 if (sb->sb_cc || sb->sb_mb || sb->sb_mbcnt)
746 panic("sbflush: cc %ld || mb %p || mbcnt %ld", sb->sb_cc, (void *)sb->sb_mb, sb->sb_mbcnt);
750 * Drop data from (the front of) a sockbuf.
760 next = (m = sb->sb_mb) ? m->m_nextpkt : 0;
769 if (m->m_len > len) {
779 while (m && m->m_len == 0) {
791 * Drop a record off the front of a sockbuf
792 * and move the next record to the front.
802 sb->sb_mb = m->m_nextpkt;
811 * Create a "control" mbuf containing the specified data
812 * with the specified type for presentation on a socket buffer.
815 sbcreatecontrol(p, size, type, level)
823 if (CMSG_SPACE((u_int)size) > MCLBYTES)
824 return ((struct mbuf *) NULL);
825 if ((m = m_get(M_DONTWAIT, MT_CONTROL)) == NULL)
826 return ((struct mbuf *) NULL);
827 if (CMSG_SPACE((u_int)size) > MLEN) {
828 MCLGET(m, M_DONTWAIT);
829 if ((m->m_flags & M_EXT) == 0) {
831 return ((struct mbuf *) NULL);
834 cp = mtod(m, struct cmsghdr *);
836 KASSERT(CMSG_SPACE((u_int)size) <= M_TRAILINGSPACE(m),
837 ("sbcreatecontrol: short mbuf"));
839 (void)memcpy(CMSG_DATA(cp), p, size);
840 m->m_len = CMSG_SPACE(size);
841 cp->cmsg_len = CMSG_LEN(size);
842 cp->cmsg_level = level;
843 cp->cmsg_type = type;
848 * Some routines that return EOPNOTSUPP for entry points that are not
849 * supported by a protocol. Fill in as needed.
852 pru_accept_notsupp(struct socket *so, struct sockaddr **nam)
858 pru_connect_notsupp(struct socket *so, struct sockaddr *nam, struct thread *td)
864 pru_connect2_notsupp(struct socket *so1, struct socket *so2)
870 pru_control_notsupp(struct socket *so, u_long cmd, caddr_t data,
871 struct ifnet *ifp, struct thread *td)
877 pru_listen_notsupp(struct socket *so, struct thread *td)
883 pru_rcvd_notsupp(struct socket *so, int flags)
889 pru_rcvoob_notsupp(struct socket *so, struct mbuf *m, int flags)
895 * This isn't really a ``null'' operation, but it's the default one
896 * and doesn't do anything destructive.
899 pru_sense_null(struct socket *so, struct stat *sb)
901 sb->st_blksize = so->so_snd.sb_hiwat;
906 * Make a copy of a sockaddr in a malloced buffer of type M_SONAME.
909 dup_sockaddr(sa, canwait)
913 struct sockaddr *sa2;
915 MALLOC(sa2, struct sockaddr *, sa->sa_len, M_SONAME,
916 canwait ? M_WAITOK : M_NOWAIT);
918 bcopy(sa, sa2, sa->sa_len);
923 * Create an external-format (``xsocket'') structure using the information
924 * in the kernel-format socket structure pointed to by so. This is done
925 * to reduce the spew of irrelevant information over this interface,
926 * to isolate user code from changes in the kernel structure, and
927 * potentially to provide information-hiding if we decide that
928 * some of this information should be hidden from users.
931 sotoxsocket(struct socket *so, struct xsocket *xso)
933 xso->xso_len = sizeof *xso;
935 xso->so_type = so->so_type;
936 xso->so_options = so->so_options;
937 xso->so_linger = so->so_linger;
938 xso->so_state = so->so_state;
939 xso->so_pcb = so->so_pcb;
940 xso->xso_protocol = so->so_proto->pr_protocol;
941 xso->xso_family = so->so_proto->pr_domain->dom_family;
942 xso->so_qlen = so->so_qlen;
943 xso->so_incqlen = so->so_incqlen;
944 xso->so_qlimit = so->so_qlimit;
945 xso->so_timeo = so->so_timeo;
946 xso->so_error = so->so_error;
947 xso->so_pgid = so->so_sigio ? so->so_sigio->sio_pgid : 0;
948 xso->so_oobmark = so->so_oobmark;
949 sbtoxsockbuf(&so->so_snd, &xso->so_snd);
950 sbtoxsockbuf(&so->so_rcv, &xso->so_rcv);
951 xso->so_uid = so->so_cred->cr_uid;
955 * This does the same for sockbufs. Note that the xsockbuf structure,
956 * since it is always embedded in a socket, does not include a self
957 * pointer nor a length. We make this entry point public in case
958 * some other mechanism needs it.
961 sbtoxsockbuf(struct sockbuf *sb, struct xsockbuf *xsb)
963 xsb->sb_cc = sb->sb_cc;
964 xsb->sb_hiwat = sb->sb_hiwat;
965 xsb->sb_mbcnt = sb->sb_mbcnt;
966 xsb->sb_mbmax = sb->sb_mbmax;
967 xsb->sb_lowat = sb->sb_lowat;
968 xsb->sb_flags = sb->sb_flags;
969 xsb->sb_timeo = sb->sb_timeo;
973 * Here is the definition of some of the basic objects in the kern.ipc
976 SYSCTL_NODE(_kern, KERN_IPC, ipc, CTLFLAG_RW, 0, "IPC");
978 /* This takes the place of kern.maxsockbuf, which moved to kern.ipc. */
980 SYSCTL_INT(_kern, KERN_DUMMY, dummy, CTLFLAG_RW, &dummy, 0, "");
981 SYSCTL_OID(_kern_ipc, KIPC_MAXSOCKBUF, maxsockbuf, CTLTYPE_INT|CTLFLAG_RW,
982 &sb_max, 0, sysctl_handle_sb_max, "I", "Maximum socket buffer size");
983 SYSCTL_INT(_kern_ipc, OID_AUTO, maxsockets, CTLFLAG_RD,
984 &maxsockets, 0, "Maximum number of sockets avaliable");
985 SYSCTL_INT(_kern_ipc, KIPC_SOCKBUF_WASTE, sockbuf_waste_factor, CTLFLAG_RW,
986 &sb_efficiency, 0, "");
989 * Initialise maxsockets
991 static void init_maxsockets(void *ignored)
993 TUNABLE_INT_FETCH("kern.ipc.maxsockets", &maxsockets);
994 maxsockets = imax(maxsockets, imax(maxfiles, nmbclusters));
996 SYSINIT(param, SI_SUB_TUNABLES, SI_ORDER_ANY, init_maxsockets, NULL);