1/*-
2 * Copyright (c) 1980, 1986, 1993
3 * The Regents of the University of California. 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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * @(#)raw_cb.c 8.1 (Berkeley) 6/10/93
| 1/*-
2 * Copyright (c) 1980, 1986, 1993
3 * The Regents of the University of California. 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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * @(#)raw_cb.c 8.1 (Berkeley) 6/10/93
|
31 */
32
33#include <sys/param.h>
34#include <sys/domain.h>
35#include <sys/lock.h>
36#include <sys/malloc.h>
37#include <sys/mutex.h>
38#include <sys/protosw.h>
39#include <sys/socket.h>
40#include <sys/socketvar.h>
41#include <sys/systm.h>
42
43#include <net/raw_cb.h>
44
45/*
46 * Routines to manage the raw protocol control blocks.
47 *
48 * TODO:
49 * hash lookups by protocol family/protocol + address family
50 * take care of unique address problems per AF?
51 * redo address binding to allow wildcards
52 */
53
54struct mtx rawcb_mtx;
55struct rawcb_list_head rawcb_list;
56
57const static u_long raw_sendspace = RAWSNDQ;
58const static u_long raw_recvspace = RAWRCVQ;
59
60/*
61 * Allocate a control block and a nominal amount
62 * of buffer space for the socket.
63 */
64int
65raw_attach(so, proto)
66 register struct socket *so;
67 int proto;
68{
69 register struct rawcb *rp = sotorawcb(so);
70 int error;
71
72 /*
73 * It is assumed that raw_attach is called
74 * after space has been allocated for the
75 * rawcb.
76 */
77 if (rp == 0)
78 return (ENOBUFS);
79 error = soreserve(so, raw_sendspace, raw_recvspace);
80 if (error)
81 return (error);
82 rp->rcb_socket = so;
83 rp->rcb_proto.sp_family = so->so_proto->pr_domain->dom_family;
84 rp->rcb_proto.sp_protocol = proto;
85 mtx_lock(&rawcb_mtx);
86 LIST_INSERT_HEAD(&rawcb_list, rp, list);
87 mtx_unlock(&rawcb_mtx);
88 return (0);
89}
90
91/*
92 * Detach the raw connection block and discard
93 * socket resources.
94 */
95void
96raw_detach(rp)
97 register struct rawcb *rp;
98{
99 struct socket *so = rp->rcb_socket;
100
101 KASSERT(so->so_pcb == rp, ("raw_detach: so_pcb != rp"));
102
103 so->so_pcb = NULL;
104 mtx_lock(&rawcb_mtx);
105 LIST_REMOVE(rp, list);
106 mtx_unlock(&rawcb_mtx);
107#ifdef notdef
108 if (rp->rcb_laddr)
109 m_freem(dtom(rp->rcb_laddr));
110 rp->rcb_laddr = 0;
111#endif
112 free((caddr_t)(rp), M_PCB);
113}
114
115/*
116 * Disconnect raw socket.
117 */
118void
119raw_disconnect(rp)
120 struct rawcb *rp;
121{
122
123#ifdef notdef
124 if (rp->rcb_faddr)
125 m_freem(dtom(rp->rcb_faddr));
126 rp->rcb_faddr = 0;
127#endif
128}
129
130#ifdef notdef
131#include <sys/mbuf.h>
132
133int
134raw_bind(so, nam)
135 register struct socket *so;
136 struct mbuf *nam;
137{
138 struct sockaddr *addr = mtod(nam, struct sockaddr *);
139 register struct rawcb *rp;
140
141 if (ifnet == 0)
142 return (EADDRNOTAVAIL);
143 rp = sotorawcb(so);
| 31 */
32
33#include <sys/param.h>
34#include <sys/domain.h>
35#include <sys/lock.h>
36#include <sys/malloc.h>
37#include <sys/mutex.h>
38#include <sys/protosw.h>
39#include <sys/socket.h>
40#include <sys/socketvar.h>
41#include <sys/systm.h>
42
43#include <net/raw_cb.h>
44
45/*
46 * Routines to manage the raw protocol control blocks.
47 *
48 * TODO:
49 * hash lookups by protocol family/protocol + address family
50 * take care of unique address problems per AF?
51 * redo address binding to allow wildcards
52 */
53
54struct mtx rawcb_mtx;
55struct rawcb_list_head rawcb_list;
56
57const static u_long raw_sendspace = RAWSNDQ;
58const static u_long raw_recvspace = RAWRCVQ;
59
60/*
61 * Allocate a control block and a nominal amount
62 * of buffer space for the socket.
63 */
64int
65raw_attach(so, proto)
66 register struct socket *so;
67 int proto;
68{
69 register struct rawcb *rp = sotorawcb(so);
70 int error;
71
72 /*
73 * It is assumed that raw_attach is called
74 * after space has been allocated for the
75 * rawcb.
76 */
77 if (rp == 0)
78 return (ENOBUFS);
79 error = soreserve(so, raw_sendspace, raw_recvspace);
80 if (error)
81 return (error);
82 rp->rcb_socket = so;
83 rp->rcb_proto.sp_family = so->so_proto->pr_domain->dom_family;
84 rp->rcb_proto.sp_protocol = proto;
85 mtx_lock(&rawcb_mtx);
86 LIST_INSERT_HEAD(&rawcb_list, rp, list);
87 mtx_unlock(&rawcb_mtx);
88 return (0);
89}
90
91/*
92 * Detach the raw connection block and discard
93 * socket resources.
94 */
95void
96raw_detach(rp)
97 register struct rawcb *rp;
98{
99 struct socket *so = rp->rcb_socket;
100
101 KASSERT(so->so_pcb == rp, ("raw_detach: so_pcb != rp"));
102
103 so->so_pcb = NULL;
104 mtx_lock(&rawcb_mtx);
105 LIST_REMOVE(rp, list);
106 mtx_unlock(&rawcb_mtx);
107#ifdef notdef
108 if (rp->rcb_laddr)
109 m_freem(dtom(rp->rcb_laddr));
110 rp->rcb_laddr = 0;
111#endif
112 free((caddr_t)(rp), M_PCB);
113}
114
115/*
116 * Disconnect raw socket.
117 */
118void
119raw_disconnect(rp)
120 struct rawcb *rp;
121{
122
123#ifdef notdef
124 if (rp->rcb_faddr)
125 m_freem(dtom(rp->rcb_faddr));
126 rp->rcb_faddr = 0;
127#endif
128}
129
130#ifdef notdef
131#include <sys/mbuf.h>
132
133int
134raw_bind(so, nam)
135 register struct socket *so;
136 struct mbuf *nam;
137{
138 struct sockaddr *addr = mtod(nam, struct sockaddr *);
139 register struct rawcb *rp;
140
141 if (ifnet == 0)
142 return (EADDRNOTAVAIL);
143 rp = sotorawcb(so);
|
144 nam = m_copym(nam, 0, M_COPYALL, M_TRYWAIT);
| 144 nam = m_copym(nam, 0, M_COPYALL, M_WAIT);
|