|
|
1.1 root 1: /*
2: * Copyright (c) 1982, 1986, 1990 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms, with or without
6: * modification, are permitted provided that the following conditions
7: * are met:
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.
20: *
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
31: * SUCH DAMAGE.
32: *
33: * @(#)sys_socket.c 7.11 (Berkeley) 4/16/91
34: */
35:
36: #include "param.h"
37: #include "systm.h"
38: #include "file.h"
39: #include "mbuf.h"
40: #include "protosw.h"
41: #include "socket.h"
42: #include "socketvar.h"
43: #include "ioctl.h"
44: #include "stat.h"
45:
46: #include "net/if.h"
47: #include "net/route.h"
48:
49: struct fileops socketops =
50: { soo_read, soo_write, soo_ioctl, soo_select, soo_close };
51:
52: /* ARGSUSED */
53: soo_read(fp, uio, cred)
54: struct file *fp;
55: struct uio *uio;
56: struct ucred *cred;
57: {
58:
59: return (soreceive((struct socket *)fp->f_data, (struct mbuf **)0,
60: uio, (struct mbuf **)0, (struct mbuf **)0, (int *)0));
61: }
62:
63: /* ARGSUSED */
64: soo_write(fp, uio, cred)
65: struct file *fp;
66: struct uio *uio;
67: struct ucred *cred;
68: {
69:
70: return (sosend((struct socket *)fp->f_data, (struct mbuf *)0,
71: uio, (struct mbuf *)0, (struct mbuf *)0, 0));
72: }
73:
74: soo_ioctl(fp, cmd, data, p)
75: struct file *fp;
76: int cmd;
77: register caddr_t data;
78: struct proc *p;
79: {
80: register struct socket *so = (struct socket *)fp->f_data;
81:
82: switch (cmd) {
83:
84: case FIONBIO:
85: if (*(int *)data)
86: so->so_state |= SS_NBIO;
87: else
88: so->so_state &= ~SS_NBIO;
89: return (0);
90:
91: case FIOASYNC:
92: if (*(int *)data) {
93: so->so_state |= SS_ASYNC;
94: so->so_rcv.sb_flags |= SB_ASYNC;
95: so->so_snd.sb_flags |= SB_ASYNC;
96: } else {
97: so->so_state &= ~SS_ASYNC;
98: so->so_rcv.sb_flags &= ~SB_ASYNC;
99: so->so_snd.sb_flags &= ~SB_ASYNC;
100: }
101: return (0);
102:
103: case FIONREAD:
104: *(int *)data = so->so_rcv.sb_cc;
105: return (0);
106:
107: case SIOCSPGRP:
108: so->so_pgid = *(int *)data;
109: return (0);
110:
111: case SIOCGPGRP:
112: *(int *)data = so->so_pgid;
113: return (0);
114:
115: case SIOCATMARK:
116: *(int *)data = (so->so_state&SS_RCVATMARK) != 0;
117: return (0);
118: }
119: /*
120: * Interface/routing/protocol specific ioctls:
121: * interface and routing ioctls should have a
122: * different entry since a socket's unnecessary
123: */
124: if (IOCGROUP(cmd) == 'i')
125: return (ifioctl(so, cmd, data, p));
126: if (IOCGROUP(cmd) == 'r')
127: return (rtioctl(cmd, data, p));
128: return ((*so->so_proto->pr_usrreq)(so, PRU_CONTROL,
129: (struct mbuf *)cmd, (struct mbuf *)data, (struct mbuf *)0));
130: }
131:
132: soo_select(fp, which, p)
133: struct file *fp;
134: int which;
135: struct proc *p;
136: {
137: register struct socket *so = (struct socket *)fp->f_data;
138: register int s = splnet();
139:
140: switch (which) {
141:
142: case FREAD:
143: if (soreadable(so)) {
144: splx(s);
145: return (1);
146: }
147: sbselqueue(&so->so_rcv, p);
148: break;
149:
150: case FWRITE:
151: if (sowriteable(so)) {
152: splx(s);
153: return (1);
154: }
155: sbselqueue(&so->so_snd, p);
156: break;
157:
158: case 0:
159: if (so->so_oobmark ||
160: (so->so_state & SS_RCVATMARK)) {
161: splx(s);
162: return (1);
163: }
164: sbselqueue(&so->so_rcv, p);
165: break;
166: }
167: splx(s);
168: return (0);
169: }
170:
171: soo_stat(so, ub)
172: register struct socket *so;
173: register struct stat *ub;
174: {
175:
176: bzero((caddr_t)ub, sizeof (*ub));
177: return ((*so->so_proto->pr_usrreq)(so, PRU_SENSE,
178: (struct mbuf *)ub, (struct mbuf *)0,
179: (struct mbuf *)0));
180: }
181:
182: /* ARGSUSED */
183: soo_close(fp, p)
184: struct file *fp;
185: struct proc *p;
186: {
187: int error = 0;
188:
189: if (fp->f_data)
190: error = soclose((struct socket *)fp->f_data);
191: fp->f_data = 0;
192: return (error);
193: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.