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>
48 #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;
71 SB_MAX * MCLBYTES / (MSIZE + MCLBYTES); /* adjusted sb_max */
73 static u_long sb_efficiency = 8; /* parameter for sbreserve() */
76 * Procedures to manipulate state flags of socket
77 * and do appropriate wakeups. Normal sequence from the
78 * active (originating) side is that soisconnecting() is
79 * called during processing of connect() call,
80 * resulting in an eventual call to soisconnected() if/when the
81 * connection is established. When the connection is torn down
82 * soisdisconnecting() is called during processing of disconnect() call,
83 * and soisdisconnected() is called when the connection to the peer
84 * is totally severed. The semantics of these routines are such that
85 * connectionless protocols can call soisconnected() and soisdisconnected()
86 * only, bypassing the in-progress calls when setting up a ``connection''
89 * From the passive side, a socket is created with
90 * two queues of sockets: so_incomp for connections in progress
91 * and so_comp for connections already made and awaiting user acceptance.
92 * As a protocol is preparing incoming connections, it creates a socket
93 * structure queued on so_incomp by calling sonewconn(). When the connection
94 * is established, soisconnected() is called, and transfers the
95 * socket structure to so_comp, making it available to accept().
97 * If a socket is closed with sockets on either
98 * so_incomp or so_comp, these sockets are dropped.
100 * If higher level protocols are implemented in
101 * the kernel, the wakeups done here will sometimes
102 * cause software-interrupt process scheduling.
107 register struct socket *so;
110 so->so_state &= ~(SS_ISCONNECTED|SS_ISDISCONNECTING);
111 so->so_state |= SS_ISCONNECTING;
118 struct socket *head = so->so_head;
120 so->so_state &= ~(SS_ISCONNECTING|SS_ISDISCONNECTING|SS_ISCONFIRMING);
121 so->so_state |= SS_ISCONNECTED;
122 if (head && (so->so_state & SS_INCOMP)) {
123 if ((so->so_options & SO_ACCEPTFILTER) != 0) {
124 so->so_upcall = head->so_accf->so_accept_filter->accf_callback;
125 so->so_upcallarg = head->so_accf->so_accept_filter_arg;
126 so->so_rcv.sb_flags |= SB_UPCALL;
127 so->so_options &= ~SO_ACCEPTFILTER;
128 so->so_upcall(so, so->so_upcallarg, 0);
131 TAILQ_REMOVE(&head->so_incomp, so, so_list);
133 so->so_state &= ~SS_INCOMP;
134 TAILQ_INSERT_TAIL(&head->so_comp, so, so_list);
136 so->so_state |= SS_COMP;
138 wakeup_one(&head->so_timeo);
140 wakeup(&so->so_timeo);
147 soisdisconnecting(so)
148 register struct socket *so;
151 so->so_state &= ~SS_ISCONNECTING;
152 so->so_state |= (SS_ISDISCONNECTING|SS_CANTRCVMORE|SS_CANTSENDMORE);
153 wakeup(&so->so_timeo);
160 register struct socket *so;
163 so->so_state &= ~(SS_ISCONNECTING|SS_ISCONNECTED|SS_ISDISCONNECTING);
164 so->so_state |= (SS_CANTRCVMORE|SS_CANTSENDMORE|SS_ISDISCONNECTED);
165 wakeup(&so->so_timeo);
166 sbdrop(&so->so_snd, so->so_snd.sb_cc);
172 * When an attempt at a new connection is noted on a socket
173 * which accepts connections, sonewconn is called. If the
174 * connection is possible (subject to space constraints, etc.)
175 * then we allocate a new structure, propoerly linked into the
176 * data structure of the original socket, and return this.
177 * Connstatus may be 0, or SO_ISCONFIRMING, or SO_ISCONNECTED.
179 * note: the ref count on the socket is 0 on return
182 sonewconn(head, connstatus)
183 register struct socket *head;
186 register struct socket *so;
188 if (head->so_qlen > 3 * head->so_qlimit / 2)
189 return ((struct socket *)0);
192 return ((struct socket *)0);
193 if ((head->so_options & SO_ACCEPTFILTER) != 0)
196 so->so_type = head->so_type;
197 so->so_options = head->so_options &~ SO_ACCEPTCONN;
198 so->so_linger = head->so_linger;
199 so->so_state = head->so_state | SS_NOFDREF;
200 so->so_proto = head->so_proto;
201 so->so_timeo = head->so_timeo;
202 so->so_cred = crhold(head->so_cred);
204 mac_create_socket_from_socket(head, so);
206 if (soreserve(so, head->so_snd.sb_hiwat, head->so_rcv.sb_hiwat) ||
207 (*so->so_proto->pr_usrreqs->pru_attach)(so, 0, NULL)) {
209 return ((struct socket *)0);
213 TAILQ_INSERT_TAIL(&head->so_comp, so, so_list);
214 so->so_state |= SS_COMP;
217 if (head->so_incqlen > head->so_qlimit) {
219 sp = TAILQ_FIRST(&head->so_incomp);
222 TAILQ_INSERT_TAIL(&head->so_incomp, so, so_list);
223 so->so_state |= SS_INCOMP;
228 wakeup(&head->so_timeo);
229 so->so_state |= connstatus;
235 * Socantsendmore indicates that no more data will be sent on the
236 * socket; it would normally be applied to a socket when the user
237 * informs the system that no more data is to be sent, by the protocol
238 * code (in case PRU_SHUTDOWN). Socantrcvmore indicates that no more data
239 * will be received, and will normally be applied to the socket by a
240 * protocol when it detects that the peer will send no more data.
241 * Data queued for reading in the socket may yet be read.
249 so->so_state |= SS_CANTSENDMORE;
258 so->so_state |= SS_CANTRCVMORE;
263 * Wait for data to arrive at/drain from a socket buffer.
270 sb->sb_flags |= SB_WAIT;
271 return (tsleep(&sb->sb_cc,
272 (sb->sb_flags & SB_NOINTR) ? PSOCK : PSOCK | PCATCH, "sbwait",
277 * Lock a sockbuf already known to be locked;
278 * return any error returned from sleep (EINTR).
282 register struct sockbuf *sb;
286 while (sb->sb_flags & SB_LOCK) {
287 sb->sb_flags |= SB_WANT;
288 error = tsleep(&sb->sb_flags,
289 (sb->sb_flags & SB_NOINTR) ? PSOCK : PSOCK|PCATCH,
294 sb->sb_flags |= SB_LOCK;
299 * Wakeup processes waiting on a socket buffer.
300 * Do asynchronous notification via SIGIO
301 * if the socket has the SS_ASYNC flag set.
305 register struct socket *so;
306 register struct sockbuf *sb;
309 selwakeup(&sb->sb_sel);
310 sb->sb_flags &= ~SB_SEL;
311 if (sb->sb_flags & SB_WAIT) {
312 sb->sb_flags &= ~SB_WAIT;
315 if ((so->so_state & SS_ASYNC) && so->so_sigio != NULL)
316 pgsigio(&so->so_sigio, SIGIO, 0);
317 if (sb->sb_flags & SB_UPCALL)
318 (*so->so_upcall)(so, so->so_upcallarg, M_DONTWAIT);
319 if (sb->sb_flags & SB_AIO)
321 KNOTE(&sb->sb_sel.si_note, 0);
325 * Socket buffer (struct sockbuf) utility routines.
327 * Each socket contains two socket buffers: one for sending data and
328 * one for receiving data. Each buffer contains a queue of mbufs,
329 * information about the number of mbufs and amount of data in the
330 * queue, and other fields allowing select() statements and notification
331 * on data availability to be implemented.
333 * Data stored in a socket buffer is maintained as a list of records.
334 * Each record is a list of mbufs chained together with the m_next
335 * field. Records are chained together with the m_nextpkt field. The upper
336 * level routine soreceive() expects the following conventions to be
337 * observed when placing information in the receive buffer:
339 * 1. If the protocol requires each message be preceded by the sender's
340 * name, then a record containing that name must be present before
341 * any associated data (mbuf's must be of type MT_SONAME).
342 * 2. If the protocol supports the exchange of ``access rights'' (really
343 * just additional data associated with the message), and there are
344 * ``rights'' to be received, then a record containing this data
345 * should be present (mbuf's must be of type MT_RIGHTS).
346 * 3. If a name or rights record exists, then it must be followed by
347 * a data record, perhaps of zero length.
349 * Before using a new socket structure it is first necessary to reserve
350 * buffer space to the socket, by calling sbreserve(). This should commit
351 * some of the available buffer space in the system buffer pool for the
352 * socket (currently, it does nothing but enforce limits). The space
353 * should be released by calling sbrelease() when the socket is destroyed.
357 soreserve(so, sndcc, rcvcc)
358 register struct socket *so;
361 struct thread *td = curthread;
363 if (sbreserve(&so->so_snd, sndcc, so, td) == 0)
365 if (sbreserve(&so->so_rcv, rcvcc, so, td) == 0)
367 if (so->so_rcv.sb_lowat == 0)
368 so->so_rcv.sb_lowat = 1;
369 if (so->so_snd.sb_lowat == 0)
370 so->so_snd.sb_lowat = MCLBYTES;
371 if (so->so_snd.sb_lowat > so->so_snd.sb_hiwat)
372 so->so_snd.sb_lowat = so->so_snd.sb_hiwat;
375 sbrelease(&so->so_snd, so);
381 sysctl_handle_sb_max(SYSCTL_HANDLER_ARGS)
384 u_long old_sb_max = sb_max;
386 error = SYSCTL_OUT(req, arg1, sizeof(int));
387 if (error || !req->newptr)
389 error = SYSCTL_IN(req, arg1, sizeof(int));
392 if (sb_max < MSIZE + MCLBYTES) {
396 sb_max_adj = (u_quad_t)sb_max * MCLBYTES / (MSIZE + MCLBYTES);
401 * Allot mbufs to a sockbuf.
402 * Attempt to scale mbmax so that mbcnt doesn't become limiting
403 * if buffering efficiency is near the normal case.
406 sbreserve(sb, cc, so, td)
414 * td will only be NULL when we're in an interrupt
415 * (e.g. in tcp_input())
419 if (!chgsbsize(so->so_cred->cr_uidinfo, &sb->sb_hiwat, cc,
420 td ? td->td_proc->p_rlimit[RLIMIT_SBSIZE].rlim_cur : RLIM_INFINITY)) {
423 sb->sb_mbmax = min(cc * sb_efficiency, sb_max);
424 if (sb->sb_lowat > sb->sb_hiwat)
425 sb->sb_lowat = sb->sb_hiwat;
430 * Free mbufs held by a socket, and reserved mbuf space.
439 (void)chgsbsize(so->so_cred->cr_uidinfo, &sb->sb_hiwat, 0,
445 * Routines to add and remove
446 * data from an mbuf queue.
448 * The routines sbappend() or sbappendrecord() are normally called to
449 * append new mbufs to a socket buffer, after checking that adequate
450 * space is available, comparing the function sbspace() with the amount
451 * of data to be added. sbappendrecord() differs from sbappend() in
452 * that data supplied is treated as the beginning of a new record.
453 * To place a sender's address, optional access rights, and data in a
454 * socket receive buffer, sbappendaddr() should be used. To place
455 * access rights and data in a socket receive buffer, sbappendrights()
456 * should be used. In either case, the new data begins a new record.
457 * Note that unlike sbappend() and sbappendrecord(), these routines check
458 * for the caller that there will be enough space to store the data.
459 * Each fails if there is not enough space, or if it cannot find mbufs
460 * to store additional information in.
462 * Reliable protocols may use the socket send buffer to hold data
463 * awaiting acknowledgement. Data is normally copied from a socket
464 * send buffer in a protocol with m_copy for output to a peer,
465 * and then removing the data from the socket buffer with sbdrop()
466 * or sbdroprecord() when the data is acknowledged by the peer.
470 * Append mbuf chain m to the last record in the
471 * socket buffer sb. The additional space associated
472 * the mbuf chain is recorded in sb. Empty mbufs are
473 * discarded and mbufs are compacted where possible.
480 register struct mbuf *n;
489 if (n->m_flags & M_EOR) {
490 sbappendrecord(sb, m); /* XXXXXX!!!! */
493 } while (n->m_next && (n = n->m_next));
495 sbcompress(sb, m, n);
505 u_long len = 0, mbcnt = 0;
507 for (m = sb->sb_mb; m; m = n) {
509 for (; m; m = m->m_next) {
512 if (m->m_flags & M_EXT) /*XXX*/ /* pretty sure this is bogus */
513 mbcnt += m->m_ext.ext_size;
516 if (len != sb->sb_cc || mbcnt != sb->sb_mbcnt) {
517 printf("cc %ld != %ld || mbcnt %ld != %ld\n", len, sb->sb_cc,
518 mbcnt, sb->sb_mbcnt);
525 * As above, except the mbuf chain
526 * begins a new record.
529 sbappendrecord(sb, m0)
530 register struct sockbuf *sb;
531 register struct mbuf *m0;
533 register struct mbuf *m;
542 * Put the first mbuf on the queue.
543 * Note this permits zero length records.
552 if (m && (m0->m_flags & M_EOR)) {
553 m0->m_flags &= ~M_EOR;
556 sbcompress(sb, m, m0);
560 * As above except that OOB data
561 * is inserted at the beginning of the sockbuf,
562 * but after any other OOB data.
566 register struct sockbuf *sb;
567 register struct mbuf *m0;
569 register struct mbuf *m;
570 register struct mbuf **mp;
574 for (mp = &sb->sb_mb; *mp ; mp = &((*mp)->m_nextpkt)) {
580 continue; /* WANT next train */
585 goto again; /* inspect THIS train further */
590 * Put the first mbuf on the queue.
591 * Note this permits zero length records.
598 if (m && (m0->m_flags & M_EOR)) {
599 m0->m_flags &= ~M_EOR;
602 sbcompress(sb, m, m0);
606 * Append address and data, and optionally, control (ancillary) data
607 * to the receive queue of a socket. If present,
608 * m0 must include a packet header with total length.
609 * Returns 0 if no space in sockbuf or insufficient mbufs.
612 sbappendaddr(sb, asa, m0, control)
614 struct sockaddr *asa;
615 struct mbuf *m0, *control;
618 int space = asa->sa_len;
620 if (m0 && (m0->m_flags & M_PKTHDR) == 0)
621 panic("sbappendaddr");
623 space += m0->m_pkthdr.len;
624 space += m_length(control, &n);
625 if (space > sbspace(sb))
627 if (asa->sa_len > MLEN)
629 MGET(m, M_DONTWAIT, MT_SONAME);
632 m->m_len = asa->sa_len;
633 bcopy(asa, mtod(m, caddr_t), asa->sa_len);
635 n->m_next = m0; /* concatenate data to control */
639 for (n = m; n; n = n->m_next)
652 sbappendcontrol(sb, m0, control)
654 struct mbuf *control, *m0;
660 panic("sbappendcontrol");
661 space = m_length(control, &n) + m_length(m0, NULL);
662 if (space > sbspace(sb))
664 n->m_next = m0; /* concatenate data to control */
665 for (m = control; m; m = m->m_next)
671 n->m_nextpkt = control;
678 * Compress mbuf chain m into the socket
679 * buffer sb following mbuf n. If n
680 * is null, the buffer is presumed empty.
684 register struct sockbuf *sb;
685 register struct mbuf *m, *n;
687 register int eor = 0;
688 register struct mbuf *o;
691 eor |= m->m_flags & M_EOR;
694 (((o = m->m_next) || (o = n)) &&
695 o->m_type == m->m_type))) {
699 if (n && (n->m_flags & M_EOR) == 0 &&
701 m->m_len <= MCLBYTES / 4 && /* XXX: Don't copy too much */
702 m->m_len <= M_TRAILINGSPACE(n) &&
703 n->m_type == m->m_type) {
704 bcopy(mtod(m, caddr_t), mtod(n, caddr_t) + n->m_len,
706 n->m_len += m->m_len;
707 sb->sb_cc += m->m_len;
717 m->m_flags &= ~M_EOR;
725 printf("semi-panic: sbcompress\n");
730 * Free all mbufs in a sockbuf.
731 * Check that all resources are reclaimed.
735 register struct sockbuf *sb;
738 if (sb->sb_flags & SB_LOCK)
739 panic("sbflush: locked");
740 while (sb->sb_mbcnt) {
742 * Don't call sbdrop(sb, 0) if the leading mbuf is non-empty:
743 * we would loop forever. Panic instead.
745 if (!sb->sb_cc && (sb->sb_mb == NULL || sb->sb_mb->m_len))
747 sbdrop(sb, (int)sb->sb_cc);
749 if (sb->sb_cc || sb->sb_mb || sb->sb_mbcnt)
750 panic("sbflush: cc %u || mb %p || mbcnt %u", sb->sb_cc, (void *)sb->sb_mb, sb->sb_mbcnt);
754 * Drop data from (the front of) a sockbuf.
758 register struct sockbuf *sb;
761 register struct mbuf *m;
764 next = (m = sb->sb_mb) ? m->m_nextpkt : 0;
773 if (m->m_len > len) {
783 while (m && m->m_len == 0) {
795 * Drop a record off the front of a sockbuf
796 * and move the next record to the front.
800 register struct sockbuf *sb;
802 register struct mbuf *m;
806 sb->sb_mb = m->m_nextpkt;
815 * Create a "control" mbuf containing the specified data
816 * with the specified type for presentation on a socket buffer.
819 sbcreatecontrol(p, size, type, level)
824 register struct cmsghdr *cp;
827 if (CMSG_SPACE((u_int)size) > MCLBYTES)
828 return ((struct mbuf *) NULL);
829 if ((m = m_get(M_DONTWAIT, MT_CONTROL)) == NULL)
830 return ((struct mbuf *) NULL);
831 if (CMSG_SPACE((u_int)size) > MLEN) {
832 MCLGET(m, M_DONTWAIT);
833 if ((m->m_flags & M_EXT) == 0) {
835 return ((struct mbuf *) NULL);
838 cp = mtod(m, struct cmsghdr *);
840 KASSERT(CMSG_SPACE((u_int)size) <= M_TRAILINGSPACE(m),
841 ("sbcreatecontrol: short mbuf"));
843 (void)memcpy(CMSG_DATA(cp), p, size);
844 m->m_len = CMSG_SPACE(size);
845 cp->cmsg_len = CMSG_LEN(size);
846 cp->cmsg_level = level;
847 cp->cmsg_type = type;
852 * Some routines that return EOPNOTSUPP for entry points that are not
853 * supported by a protocol. Fill in as needed.
856 pru_accept_notsupp(struct socket *so, struct sockaddr **nam)
862 pru_connect_notsupp(struct socket *so, struct sockaddr *nam, struct thread *td)
868 pru_connect2_notsupp(struct socket *so1, struct socket *so2)
874 pru_control_notsupp(struct socket *so, u_long cmd, caddr_t data,
875 struct ifnet *ifp, struct thread *td)
881 pru_listen_notsupp(struct socket *so, struct thread *td)
887 pru_rcvd_notsupp(struct socket *so, int flags)
893 pru_rcvoob_notsupp(struct socket *so, struct mbuf *m, int flags)
899 * This isn't really a ``null'' operation, but it's the default one
900 * and doesn't do anything destructive.
903 pru_sense_null(struct socket *so, struct stat *sb)
905 sb->st_blksize = so->so_snd.sb_hiwat;
910 * Make a copy of a sockaddr in a malloced buffer of type M_SONAME.
913 dup_sockaddr(sa, canwait)
917 struct sockaddr *sa2;
919 MALLOC(sa2, struct sockaddr *, sa->sa_len, M_SONAME,
920 canwait ? M_WAITOK : M_NOWAIT);
922 bcopy(sa, sa2, sa->sa_len);
927 * Create an external-format (``xsocket'') structure using the information
928 * in the kernel-format socket structure pointed to by so. This is done
929 * to reduce the spew of irrelevant information over this interface,
930 * to isolate user code from changes in the kernel structure, and
931 * potentially to provide information-hiding if we decide that
932 * some of this information should be hidden from users.
935 sotoxsocket(struct socket *so, struct xsocket *xso)
937 xso->xso_len = sizeof *xso;
939 xso->so_type = so->so_type;
940 xso->so_options = so->so_options;
941 xso->so_linger = so->so_linger;
942 xso->so_state = so->so_state;
943 xso->so_pcb = so->so_pcb;
944 xso->xso_protocol = so->so_proto->pr_protocol;
945 xso->xso_family = so->so_proto->pr_domain->dom_family;
946 xso->so_qlen = so->so_qlen;
947 xso->so_incqlen = so->so_incqlen;
948 xso->so_qlimit = so->so_qlimit;
949 xso->so_timeo = so->so_timeo;
950 xso->so_error = so->so_error;
951 xso->so_pgid = so->so_sigio ? so->so_sigio->sio_pgid : 0;
952 xso->so_oobmark = so->so_oobmark;
953 sbtoxsockbuf(&so->so_snd, &xso->so_snd);
954 sbtoxsockbuf(&so->so_rcv, &xso->so_rcv);
955 xso->so_uid = so->so_cred->cr_uid;
959 * This does the same for sockbufs. Note that the xsockbuf structure,
960 * since it is always embedded in a socket, does not include a self
961 * pointer nor a length. We make this entry point public in case
962 * some other mechanism needs it.
965 sbtoxsockbuf(struct sockbuf *sb, struct xsockbuf *xsb)
967 xsb->sb_cc = sb->sb_cc;
968 xsb->sb_hiwat = sb->sb_hiwat;
969 xsb->sb_mbcnt = sb->sb_mbcnt;
970 xsb->sb_mbmax = sb->sb_mbmax;
971 xsb->sb_lowat = sb->sb_lowat;
972 xsb->sb_flags = sb->sb_flags;
973 xsb->sb_timeo = sb->sb_timeo;
977 * Here is the definition of some of the basic objects in the kern.ipc
980 SYSCTL_NODE(_kern, KERN_IPC, ipc, CTLFLAG_RW, 0, "IPC");
982 /* This takes the place of kern.maxsockbuf, which moved to kern.ipc. */
984 SYSCTL_INT(_kern, KERN_DUMMY, dummy, CTLFLAG_RW, &dummy, 0, "");
985 SYSCTL_OID(_kern_ipc, KIPC_MAXSOCKBUF, maxsockbuf, CTLTYPE_INT|CTLFLAG_RW,
986 &sb_max, 0, sysctl_handle_sb_max, "I", "Maximum socket buffer size");
987 SYSCTL_INT(_kern_ipc, OID_AUTO, maxsockets, CTLFLAG_RD,
988 &maxsockets, 0, "Maximum number of sockets avaliable");
989 SYSCTL_INT(_kern_ipc, KIPC_SOCKBUF_WASTE, sockbuf_waste_factor, CTLFLAG_RW,
990 &sb_efficiency, 0, "");
993 * Initialise maxsockets
995 static void init_maxsockets(void *ignored)
997 TUNABLE_INT_FETCH("kern.ipc.maxsockets", &maxsockets);
998 maxsockets = imax(maxsockets, imax(maxfiles, nmbclusters));
1000 SYSINIT(param, SI_SUB_TUNABLES, SI_ORDER_ANY, init_maxsockets, NULL);