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
38 #include "opt_param.h"
40 #include <sys/param.h>
41 #include <sys/aio.h> /* for aio_swake proto */
42 #include <sys/domain.h>
43 #include <sys/event.h>
44 #include <sys/file.h> /* for maxfiles */
45 #include <sys/kernel.h>
47 #include <sys/malloc.h>
50 #include <sys/mutex.h>
52 #include <sys/protosw.h>
53 #include <sys/resourcevar.h>
54 #include <sys/signalvar.h>
55 #include <sys/socket.h>
56 #include <sys/socketvar.h>
58 #include <sys/sysctl.h>
59 #include <sys/systm.h>
63 void (*aio_swake)(struct socket *, struct sockbuf *);
66 * Primitive routines for operating on sockets and socket buffers
69 u_long sb_max = SB_MAX; /* XXX should be static */
71 static u_long sb_efficiency = 8; /* parameter for sbreserve() */
74 * Procedures to manipulate state flags of socket
75 * and do appropriate wakeups. Normal sequence from the
76 * active (originating) side is that soisconnecting() is
77 * called during processing of connect() call,
78 * resulting in an eventual call to soisconnected() if/when the
79 * connection is established. When the connection is torn down
80 * soisdisconnecting() is called during processing of disconnect() call,
81 * and soisdisconnected() is called when the connection to the peer
82 * is totally severed. The semantics of these routines are such that
83 * connectionless protocols can call soisconnected() and soisdisconnected()
84 * only, bypassing the in-progress calls when setting up a ``connection''
87 * From the passive side, a socket is created with
88 * two queues of sockets: so_incomp for connections in progress
89 * and so_comp for connections already made and awaiting user acceptance.
90 * As a protocol is preparing incoming connections, it creates a socket
91 * structure queued on so_incomp by calling sonewconn(). When the connection
92 * is established, soisconnected() is called, and transfers the
93 * socket structure to so_comp, making it available to accept().
95 * If a socket is closed with sockets on either
96 * so_incomp or so_comp, these sockets are dropped.
98 * If higher level protocols are implemented in
99 * the kernel, the wakeups done here will sometimes
100 * cause software-interrupt process scheduling.
105 register struct socket *so;
108 so->so_state &= ~(SS_ISCONNECTED|SS_ISDISCONNECTING);
109 so->so_state |= SS_ISCONNECTING;
116 struct socket *head = so->so_head;
118 so->so_state &= ~(SS_ISCONNECTING|SS_ISDISCONNECTING|SS_ISCONFIRMING);
119 so->so_state |= SS_ISCONNECTED;
120 if (head && (so->so_state & SS_INCOMP)) {
121 if ((so->so_options & SO_ACCEPTFILTER) != 0) {
122 so->so_upcall = head->so_accf->so_accept_filter->accf_callback;
123 so->so_upcallarg = head->so_accf->so_accept_filter_arg;
124 so->so_rcv.sb_flags |= SB_UPCALL;
125 so->so_options &= ~SO_ACCEPTFILTER;
126 so->so_upcall(so, so->so_upcallarg, 0);
129 TAILQ_REMOVE(&head->so_incomp, so, so_list);
131 so->so_state &= ~SS_INCOMP;
132 TAILQ_INSERT_TAIL(&head->so_comp, so, so_list);
134 so->so_state |= SS_COMP;
136 wakeup_one(&head->so_timeo);
138 wakeup(&so->so_timeo);
145 soisdisconnecting(so)
146 register struct socket *so;
149 so->so_state &= ~SS_ISCONNECTING;
150 so->so_state |= (SS_ISDISCONNECTING|SS_CANTRCVMORE|SS_CANTSENDMORE);
151 wakeup(&so->so_timeo);
158 register struct socket *so;
161 so->so_state &= ~(SS_ISCONNECTING|SS_ISCONNECTED|SS_ISDISCONNECTING);
162 so->so_state |= (SS_CANTRCVMORE|SS_CANTSENDMORE|SS_ISDISCONNECTED);
163 wakeup(&so->so_timeo);
164 sbdrop(&so->so_snd, so->so_snd.sb_cc);
170 * When an attempt at a new connection is noted on a socket
171 * which accepts connections, sonewconn is called. If the
172 * connection is possible (subject to space constraints, etc.)
173 * then we allocate a new structure, propoerly linked into the
174 * data structure of the original socket, and return this.
175 * Connstatus may be 0, or SO_ISCONFIRMING, or SO_ISCONNECTED.
177 * note: the ref count on the socket is 0 on return
180 sonewconn(head, connstatus)
181 register struct socket *head;
184 register struct socket *so;
186 if (head->so_qlen > 3 * head->so_qlimit / 2)
187 return ((struct socket *)0);
190 return ((struct socket *)0);
191 if ((head->so_options & SO_ACCEPTFILTER) != 0)
194 so->so_type = head->so_type;
195 so->so_options = head->so_options &~ SO_ACCEPTCONN;
196 so->so_linger = head->so_linger;
197 so->so_state = head->so_state | SS_NOFDREF;
198 so->so_proto = head->so_proto;
199 so->so_timeo = head->so_timeo;
200 so->so_cred = crhold(head->so_cred);
202 mac_create_socket_from_socket(head, so);
204 if (soreserve(so, head->so_snd.sb_hiwat, head->so_rcv.sb_hiwat) ||
205 (*so->so_proto->pr_usrreqs->pru_attach)(so, 0, NULL)) {
207 return ((struct socket *)0);
211 TAILQ_INSERT_TAIL(&head->so_comp, so, so_list);
212 so->so_state |= SS_COMP;
215 if (head->so_incqlen > head->so_qlimit) {
217 sp = TAILQ_FIRST(&head->so_incomp);
220 TAILQ_INSERT_TAIL(&head->so_incomp, so, so_list);
221 so->so_state |= SS_INCOMP;
226 wakeup(&head->so_timeo);
227 so->so_state |= connstatus;
233 * Socantsendmore indicates that no more data will be sent on the
234 * socket; it would normally be applied to a socket when the user
235 * informs the system that no more data is to be sent, by the protocol
236 * code (in case PRU_SHUTDOWN). Socantrcvmore indicates that no more data
237 * will be received, and will normally be applied to the socket by a
238 * protocol when it detects that the peer will send no more data.
239 * Data queued for reading in the socket may yet be read.
247 so->so_state |= SS_CANTSENDMORE;
256 so->so_state |= SS_CANTRCVMORE;
261 * Wait for data to arrive at/drain from a socket buffer.
268 sb->sb_flags |= SB_WAIT;
269 return (tsleep(&sb->sb_cc,
270 (sb->sb_flags & SB_NOINTR) ? PSOCK : PSOCK | PCATCH, "sbwait",
275 * Lock a sockbuf already known to be locked;
276 * return any error returned from sleep (EINTR).
280 register struct sockbuf *sb;
284 while (sb->sb_flags & SB_LOCK) {
285 sb->sb_flags |= SB_WANT;
286 error = tsleep(&sb->sb_flags,
287 (sb->sb_flags & SB_NOINTR) ? PSOCK : PSOCK|PCATCH,
292 sb->sb_flags |= SB_LOCK;
297 * Wakeup processes waiting on a socket buffer.
298 * Do asynchronous notification via SIGIO
299 * if the socket has the SS_ASYNC flag set.
303 register struct socket *so;
304 register struct sockbuf *sb;
307 selwakeup(&sb->sb_sel);
308 sb->sb_flags &= ~SB_SEL;
309 if (sb->sb_flags & SB_WAIT) {
310 sb->sb_flags &= ~SB_WAIT;
313 if ((so->so_state & SS_ASYNC) && so->so_sigio != NULL)
314 pgsigio(&so->so_sigio, SIGIO, 0);
315 if (sb->sb_flags & SB_UPCALL)
316 (*so->so_upcall)(so, so->so_upcallarg, M_DONTWAIT);
317 if (sb->sb_flags & SB_AIO)
319 KNOTE(&sb->sb_sel.si_note, 0);
323 * Socket buffer (struct sockbuf) utility routines.
325 * Each socket contains two socket buffers: one for sending data and
326 * one for receiving data. Each buffer contains a queue of mbufs,
327 * information about the number of mbufs and amount of data in the
328 * queue, and other fields allowing select() statements and notification
329 * on data availability to be implemented.
331 * Data stored in a socket buffer is maintained as a list of records.
332 * Each record is a list of mbufs chained together with the m_next
333 * field. Records are chained together with the m_nextpkt field. The upper
334 * level routine soreceive() expects the following conventions to be
335 * observed when placing information in the receive buffer:
337 * 1. If the protocol requires each message be preceded by the sender's
338 * name, then a record containing that name must be present before
339 * any associated data (mbuf's must be of type MT_SONAME).
340 * 2. If the protocol supports the exchange of ``access rights'' (really
341 * just additional data associated with the message), and there are
342 * ``rights'' to be received, then a record containing this data
343 * should be present (mbuf's must be of type MT_RIGHTS).
344 * 3. If a name or rights record exists, then it must be followed by
345 * a data record, perhaps of zero length.
347 * Before using a new socket structure it is first necessary to reserve
348 * buffer space to the socket, by calling sbreserve(). This should commit
349 * some of the available buffer space in the system buffer pool for the
350 * socket (currently, it does nothing but enforce limits). The space
351 * should be released by calling sbrelease() when the socket is destroyed.
355 soreserve(so, sndcc, rcvcc)
356 register struct socket *so;
359 struct thread *td = curthread;
361 if (sbreserve(&so->so_snd, sndcc, so, td) == 0)
363 if (sbreserve(&so->so_rcv, rcvcc, so, td) == 0)
365 if (so->so_rcv.sb_lowat == 0)
366 so->so_rcv.sb_lowat = 1;
367 if (so->so_snd.sb_lowat == 0)
368 so->so_snd.sb_lowat = MCLBYTES;
369 if (so->so_snd.sb_lowat > so->so_snd.sb_hiwat)
370 so->so_snd.sb_lowat = so->so_snd.sb_hiwat;
373 sbrelease(&so->so_snd, so);
379 * Allot mbufs to a sockbuf.
380 * Attempt to scale mbmax so that mbcnt doesn't become limiting
381 * if buffering efficiency is near the normal case.
384 sbreserve(sb, cc, so, td)
392 * td will only be NULL when we're in an interrupt
393 * (e.g. in tcp_input())
395 if ((u_quad_t)cc > (u_quad_t)sb_max * MCLBYTES / (MSIZE + MCLBYTES))
397 if (!chgsbsize(so->so_cred->cr_uidinfo, &sb->sb_hiwat, cc,
398 td ? td->td_proc->p_rlimit[RLIMIT_SBSIZE].rlim_cur : RLIM_INFINITY)) {
401 sb->sb_mbmax = min(cc * sb_efficiency, sb_max);
402 if (sb->sb_lowat > sb->sb_hiwat)
403 sb->sb_lowat = sb->sb_hiwat;
408 * Free mbufs held by a socket, and reserved mbuf space.
417 (void)chgsbsize(so->so_cred->cr_uidinfo, &sb->sb_hiwat, 0,
423 * Routines to add and remove
424 * data from an mbuf queue.
426 * The routines sbappend() or sbappendrecord() are normally called to
427 * append new mbufs to a socket buffer, after checking that adequate
428 * space is available, comparing the function sbspace() with the amount
429 * of data to be added. sbappendrecord() differs from sbappend() in
430 * that data supplied is treated as the beginning of a new record.
431 * To place a sender's address, optional access rights, and data in a
432 * socket receive buffer, sbappendaddr() should be used. To place
433 * access rights and data in a socket receive buffer, sbappendrights()
434 * should be used. In either case, the new data begins a new record.
435 * Note that unlike sbappend() and sbappendrecord(), these routines check
436 * for the caller that there will be enough space to store the data.
437 * Each fails if there is not enough space, or if it cannot find mbufs
438 * to store additional information in.
440 * Reliable protocols may use the socket send buffer to hold data
441 * awaiting acknowledgement. Data is normally copied from a socket
442 * send buffer in a protocol with m_copy for output to a peer,
443 * and then removing the data from the socket buffer with sbdrop()
444 * or sbdroprecord() when the data is acknowledged by the peer.
448 * Append mbuf chain m to the last record in the
449 * socket buffer sb. The additional space associated
450 * the mbuf chain is recorded in sb. Empty mbufs are
451 * discarded and mbufs are compacted where possible.
458 register struct mbuf *n;
467 if (n->m_flags & M_EOR) {
468 sbappendrecord(sb, m); /* XXXXXX!!!! */
471 } while (n->m_next && (n = n->m_next));
473 sbcompress(sb, m, n);
479 register struct sockbuf *sb;
481 register struct mbuf *m;
482 register struct mbuf *n = 0;
483 register u_long len = 0, mbcnt = 0;
485 for (m = sb->sb_mb; m; m = n) {
487 for (; m; m = m->m_next) {
490 if (m->m_flags & M_EXT) /*XXX*/ /* pretty sure this is bogus */
491 mbcnt += m->m_ext.ext_size;
494 if (len != sb->sb_cc || mbcnt != sb->sb_mbcnt) {
495 printf("cc %ld != %ld || mbcnt %ld != %ld\n", len, sb->sb_cc,
496 mbcnt, sb->sb_mbcnt);
503 * As above, except the mbuf chain
504 * begins a new record.
507 sbappendrecord(sb, m0)
508 register struct sockbuf *sb;
509 register struct mbuf *m0;
511 register struct mbuf *m;
520 * Put the first mbuf on the queue.
521 * Note this permits zero length records.
530 if (m && (m0->m_flags & M_EOR)) {
531 m0->m_flags &= ~M_EOR;
534 sbcompress(sb, m, m0);
538 * As above except that OOB data
539 * is inserted at the beginning of the sockbuf,
540 * but after any other OOB data.
544 register struct sockbuf *sb;
545 register struct mbuf *m0;
547 register struct mbuf *m;
548 register struct mbuf **mp;
552 for (mp = &sb->sb_mb; *mp ; mp = &((*mp)->m_nextpkt)) {
558 continue; /* WANT next train */
563 goto again; /* inspect THIS train further */
568 * Put the first mbuf on the queue.
569 * Note this permits zero length records.
576 if (m && (m0->m_flags & M_EOR)) {
577 m0->m_flags &= ~M_EOR;
580 sbcompress(sb, m, m0);
584 * Append address and data, and optionally, control (ancillary) data
585 * to the receive queue of a socket. If present,
586 * m0 must include a packet header with total length.
587 * Returns 0 if no space in sockbuf or insufficient mbufs.
590 sbappendaddr(sb, asa, m0, control)
591 register struct sockbuf *sb;
592 struct sockaddr *asa;
593 struct mbuf *m0, *control;
595 register struct mbuf *m, *n;
596 int space = asa->sa_len;
598 if (m0 && (m0->m_flags & M_PKTHDR) == 0)
599 panic("sbappendaddr");
601 space += m0->m_pkthdr.len;
602 for (n = control; n; n = n->m_next) {
604 if (n->m_next == 0) /* keep pointer to last control buf */
607 if (space > sbspace(sb))
609 if (asa->sa_len > MLEN)
611 MGET(m, M_DONTWAIT, MT_SONAME);
614 m->m_len = asa->sa_len;
615 bcopy(asa, mtod(m, caddr_t), asa->sa_len);
617 n->m_next = m0; /* concatenate data to control */
621 for (n = m; n; n = n->m_next)
634 sbappendcontrol(sb, m0, control)
636 struct mbuf *control, *m0;
638 register struct mbuf *m, *n;
642 panic("sbappendcontrol");
643 for (m = control; ; m = m->m_next) {
648 n = m; /* save pointer to last control buffer */
649 for (m = m0; m; m = m->m_next)
651 if (space > sbspace(sb))
653 n->m_next = m0; /* concatenate data to control */
654 for (m = control; m; m = m->m_next)
660 n->m_nextpkt = control;
667 * Compress mbuf chain m into the socket
668 * buffer sb following mbuf n. If n
669 * is null, the buffer is presumed empty.
673 register struct sockbuf *sb;
674 register struct mbuf *m, *n;
676 register int eor = 0;
677 register struct mbuf *o;
680 eor |= m->m_flags & M_EOR;
683 (((o = m->m_next) || (o = n)) &&
684 o->m_type == m->m_type))) {
688 if (n && (n->m_flags & M_EOR) == 0 &&
690 m->m_len <= MCLBYTES / 4 && /* XXX: Don't copy too much */
691 m->m_len <= M_TRAILINGSPACE(n) &&
692 n->m_type == m->m_type) {
693 bcopy(mtod(m, caddr_t), mtod(n, caddr_t) + n->m_len,
695 n->m_len += m->m_len;
696 sb->sb_cc += m->m_len;
706 m->m_flags &= ~M_EOR;
714 printf("semi-panic: sbcompress\n");
719 * Free all mbufs in a sockbuf.
720 * Check that all resources are reclaimed.
724 register struct sockbuf *sb;
727 if (sb->sb_flags & SB_LOCK)
728 panic("sbflush: locked");
729 while (sb->sb_mbcnt) {
731 * Don't call sbdrop(sb, 0) if the leading mbuf is non-empty:
732 * we would loop forever. Panic instead.
734 if (!sb->sb_cc && (sb->sb_mb == NULL || sb->sb_mb->m_len))
736 sbdrop(sb, (int)sb->sb_cc);
738 if (sb->sb_cc || sb->sb_mb || sb->sb_mbcnt)
739 panic("sbflush: cc %u || mb %p || mbcnt %u", sb->sb_cc, (void *)sb->sb_mb, sb->sb_mbcnt);
743 * Drop data from (the front of) a sockbuf.
747 register struct sockbuf *sb;
750 register struct mbuf *m;
753 next = (m = sb->sb_mb) ? m->m_nextpkt : 0;
762 if (m->m_len > len) {
772 while (m && m->m_len == 0) {
784 * Drop a record off the front of a sockbuf
785 * and move the next record to the front.
789 register struct sockbuf *sb;
791 register struct mbuf *m;
795 sb->sb_mb = m->m_nextpkt;
804 * Create a "control" mbuf containing the specified data
805 * with the specified type for presentation on a socket buffer.
808 sbcreatecontrol(p, size, type, level)
813 register struct cmsghdr *cp;
816 if (CMSG_SPACE((u_int)size) > MCLBYTES)
817 return ((struct mbuf *) NULL);
818 if ((m = m_get(M_DONTWAIT, MT_CONTROL)) == NULL)
819 return ((struct mbuf *) NULL);
820 if (CMSG_SPACE((u_int)size) > MLEN) {
821 MCLGET(m, M_DONTWAIT);
822 if ((m->m_flags & M_EXT) == 0) {
824 return ((struct mbuf *) NULL);
827 cp = mtod(m, struct cmsghdr *);
829 KASSERT(CMSG_SPACE((u_int)size) <= M_TRAILINGSPACE(m),
830 ("sbcreatecontrol: short mbuf"));
832 (void)memcpy(CMSG_DATA(cp), p, size);
833 m->m_len = CMSG_SPACE(size);
834 cp->cmsg_len = CMSG_LEN(size);
835 cp->cmsg_level = level;
836 cp->cmsg_type = type;
841 * Some routines that return EOPNOTSUPP for entry points that are not
842 * supported by a protocol. Fill in as needed.
845 pru_accept_notsupp(struct socket *so, struct sockaddr **nam)
851 pru_connect_notsupp(struct socket *so, struct sockaddr *nam, struct thread *td)
857 pru_connect2_notsupp(struct socket *so1, struct socket *so2)
863 pru_control_notsupp(struct socket *so, u_long cmd, caddr_t data,
864 struct ifnet *ifp, struct thread *td)
870 pru_listen_notsupp(struct socket *so, struct thread *td)
876 pru_rcvd_notsupp(struct socket *so, int flags)
882 pru_rcvoob_notsupp(struct socket *so, struct mbuf *m, int flags)
888 * This isn't really a ``null'' operation, but it's the default one
889 * and doesn't do anything destructive.
892 pru_sense_null(struct socket *so, struct stat *sb)
894 sb->st_blksize = so->so_snd.sb_hiwat;
899 * Make a copy of a sockaddr in a malloced buffer of type M_SONAME.
902 dup_sockaddr(sa, canwait)
906 struct sockaddr *sa2;
908 MALLOC(sa2, struct sockaddr *, sa->sa_len, M_SONAME,
909 canwait ? M_WAITOK : M_NOWAIT);
911 bcopy(sa, sa2, sa->sa_len);
916 * Create an external-format (``xsocket'') structure using the information
917 * in the kernel-format socket structure pointed to by so. This is done
918 * to reduce the spew of irrelevant information over this interface,
919 * to isolate user code from changes in the kernel structure, and
920 * potentially to provide information-hiding if we decide that
921 * some of this information should be hidden from users.
924 sotoxsocket(struct socket *so, struct xsocket *xso)
926 xso->xso_len = sizeof *xso;
928 xso->so_type = so->so_type;
929 xso->so_options = so->so_options;
930 xso->so_linger = so->so_linger;
931 xso->so_state = so->so_state;
932 xso->so_pcb = so->so_pcb;
933 xso->xso_protocol = so->so_proto->pr_protocol;
934 xso->xso_family = so->so_proto->pr_domain->dom_family;
935 xso->so_qlen = so->so_qlen;
936 xso->so_incqlen = so->so_incqlen;
937 xso->so_qlimit = so->so_qlimit;
938 xso->so_timeo = so->so_timeo;
939 xso->so_error = so->so_error;
940 xso->so_pgid = so->so_sigio ? so->so_sigio->sio_pgid : 0;
941 xso->so_oobmark = so->so_oobmark;
942 sbtoxsockbuf(&so->so_snd, &xso->so_snd);
943 sbtoxsockbuf(&so->so_rcv, &xso->so_rcv);
944 xso->so_uid = so->so_cred->cr_uid;
948 * This does the same for sockbufs. Note that the xsockbuf structure,
949 * since it is always embedded in a socket, does not include a self
950 * pointer nor a length. We make this entry point public in case
951 * some other mechanism needs it.
954 sbtoxsockbuf(struct sockbuf *sb, struct xsockbuf *xsb)
956 xsb->sb_cc = sb->sb_cc;
957 xsb->sb_hiwat = sb->sb_hiwat;
958 xsb->sb_mbcnt = sb->sb_mbcnt;
959 xsb->sb_mbmax = sb->sb_mbmax;
960 xsb->sb_lowat = sb->sb_lowat;
961 xsb->sb_flags = sb->sb_flags;
962 xsb->sb_timeo = sb->sb_timeo;
966 * Here is the definition of some of the basic objects in the kern.ipc
969 SYSCTL_NODE(_kern, KERN_IPC, ipc, CTLFLAG_RW, 0, "IPC");
971 /* This takes the place of kern.maxsockbuf, which moved to kern.ipc. */
973 SYSCTL_INT(_kern, KERN_DUMMY, dummy, CTLFLAG_RW, &dummy, 0, "");
975 SYSCTL_INT(_kern_ipc, KIPC_MAXSOCKBUF, maxsockbuf, CTLFLAG_RW,
976 &sb_max, 0, "Maximum socket buffer size");
977 SYSCTL_INT(_kern_ipc, OID_AUTO, maxsockets, CTLFLAG_RD,
978 &maxsockets, 0, "Maximum number of sockets avaliable");
979 SYSCTL_INT(_kern_ipc, KIPC_SOCKBUF_WASTE, sockbuf_waste_factor, CTLFLAG_RW,
980 &sb_efficiency, 0, "");
983 * Initialise maxsockets
985 static void init_maxsockets(void *ignored)
987 TUNABLE_INT_FETCH("kern.ipc.maxsockets", &maxsockets);
988 maxsockets = imax(maxsockets, imax(maxfiles, nmbclusters));
990 SYSINIT(param, SI_SUB_TUNABLES, SI_ORDER_ANY, init_maxsockets, NULL);