|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. ! 3: * ! 4: * @APPLE_LICENSE_HEADER_START@ ! 5: * ! 6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights ! 7: * Reserved. This file contains Original Code and/or Modifications of ! 8: * Original Code as defined in and that are subject to the Apple Public ! 9: * Source License Version 1.1 (the "License"). You may not use this file ! 10: * except in compliance with the License. Please obtain a copy of the ! 11: * License at http://www.apple.com/publicsource and read it before using ! 12: * this file. ! 13: * ! 14: * The Original Code and all software distributed under the License are ! 15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER ! 16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, ! 17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, ! 18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the ! 19: * License for the specific language governing rights and limitations ! 20: * under the License. ! 21: * ! 22: * @APPLE_LICENSE_HEADER_END@ ! 23: */ ! 24: ! 25: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */ ! 26: /* ! 27: * Copyright (c) 1980, 1986, 1993 ! 28: * The Regents of the University of California. All rights reserved. ! 29: * ! 30: * Redistribution and use in source and binary forms, with or without ! 31: * modification, are permitted provided that the following conditions ! 32: * are met: ! 33: * 1. Redistributions of source code must retain the above copyright ! 34: * notice, this list of conditions and the following disclaimer. ! 35: * 2. Redistributions in binary form must reproduce the above copyright ! 36: * notice, this list of conditions and the following disclaimer in the ! 37: * documentation and/or other materials provided with the distribution. ! 38: * 3. All advertising materials mentioning features or use of this software ! 39: * must display the following acknowledgement: ! 40: * This product includes software developed by the University of ! 41: * California, Berkeley and its contributors. ! 42: * 4. Neither the name of the University nor the names of its contributors ! 43: * may be used to endorse or promote products derived from this software ! 44: * without specific prior written permission. ! 45: * ! 46: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ! 47: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE ! 48: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ! 49: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE ! 50: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL ! 51: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS ! 52: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ! 53: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT ! 54: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY ! 55: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF ! 56: * SUCH DAMAGE. ! 57: * ! 58: * @(#)raw_cb.c 8.1 (Berkeley) 6/10/93 ! 59: */ ! 60: ! 61: #include <sys/param.h> ! 62: #include <sys/systm.h> ! 63: #include <sys/mbuf.h> ! 64: #include <sys/socket.h> ! 65: #include <sys/socketvar.h> ! 66: #include <sys/domain.h> ! 67: #include <sys/protosw.h> ! 68: #include <sys/errno.h> ! 69: #include <sys/malloc.h> ! 70: ! 71: #include <net/if.h> ! 72: #include <net/route.h> ! 73: #include <net/raw_cb.h> ! 74: #include <netinet/in.h> ! 75: ! 76: /* ! 77: * Routines to manage the raw protocol control blocks. ! 78: * ! 79: * TODO: ! 80: * hash lookups by protocol family/protocol + address family ! 81: * take care of unique address problems per AF? ! 82: * redo address binding to allow wildcards ! 83: */ ! 84: ! 85: u_long raw_sendspace = RAWSNDQ; ! 86: u_long raw_recvspace = RAWRCVQ; ! 87: ! 88: /* ! 89: * Allocate a control block and a nominal amount ! 90: * of buffer space for the socket. ! 91: */ ! 92: int ! 93: raw_attach(so, proto) ! 94: register struct socket *so; ! 95: int proto; ! 96: { ! 97: register struct rawcb *rp = sotorawcb(so); ! 98: int error; ! 99: ! 100: /* ! 101: * It is assumed that raw_attach is called ! 102: * after space has been allocated for the ! 103: * rawcb. ! 104: */ ! 105: if (rp == 0) ! 106: return (ENOBUFS); ! 107: if ((error = soreserve(so, raw_sendspace, raw_recvspace))) ! 108: return (error); ! 109: rp->rcb_socket = so; ! 110: rp->rcb_proto.sp_family = so->so_proto->pr_domain->dom_family; ! 111: rp->rcb_proto.sp_protocol = proto; ! 112: insque((struct queue_entry *)rp, (struct queue_entry *)&rawcb); ! 113: return (0); ! 114: } ! 115: ! 116: /* ! 117: * Detach the raw connection block and discard ! 118: * socket resources. ! 119: */ ! 120: void ! 121: raw_detach(rp) ! 122: register struct rawcb *rp; ! 123: { ! 124: struct socket *so = rp->rcb_socket; ! 125: ! 126: so->so_pcb = 0; ! 127: sofree(so); ! 128: remque((struct queue_entry *)rp); ! 129: #ifdef notdef ! 130: if (rp->rcb_laddr) ! 131: m_freem(dtom(rp->rcb_laddr)); ! 132: rp->rcb_laddr = 0; ! 133: #endif ! 134: _FREE((caddr_t)(rp), M_PCB); ! 135: } ! 136: ! 137: /* ! 138: * Disconnect and possibly release resources. ! 139: */ ! 140: void ! 141: raw_disconnect(rp) ! 142: struct rawcb *rp; ! 143: { ! 144: ! 145: #ifdef notdef ! 146: if (rp->rcb_faddr) ! 147: m_freem(dtom(rp->rcb_faddr)); ! 148: rp->rcb_faddr = 0; ! 149: #endif ! 150: if (rp->rcb_socket->so_state & SS_NOFDREF) ! 151: raw_detach(rp); ! 152: } ! 153: ! 154: #ifdef notdef ! 155: int ! 156: raw_bind(so, nam) ! 157: register struct socket *so; ! 158: struct mbuf *nam; ! 159: { ! 160: struct sockaddr *addr = mtod(nam, struct sockaddr *); ! 161: register struct rawcb *rp; ! 162: ! 163: if (ifnet == 0) ! 164: return (EADDRNOTAVAIL); ! 165: rp = sotorawcb(so); ! 166: nam = m_copym(nam, 0, M_COPYALL, M_WAITOK); ! 167: rp->rcb_laddr = mtod(nam, struct sockaddr *); ! 168: return (0); ! 169: } ! 170: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.