![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to ns_output.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Apple XNU] / XNU / bsd / netns|
Return to ns_output.c CVS log | Up to [Apple XNU] / XNU / bsd / netns |
1.1 root 1: /*
2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * The contents of this file constitute Original Code as defined in and
7: * are subject to the Apple Public Source License Version 1.1 (the
8: * "License"). You may not use this file except in compliance with the
9: * License. Please obtain a copy of the License at
10: * http://www.apple.com/publicsource and read it before using this file.
11: *
12: * This Original Code and all software distributed under the License are
13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17: * License for the specific language governing rights and limitations
18: * under the License.
19: *
20: * @APPLE_LICENSE_HEADER_END@
21: */
22: /*
23: * Copyright (c) 1984, 1985, 1986, 1987, 1993
24: * The Regents of the University of California. All rights reserved.
25: *
26: * Redistribution and use in source and binary forms, with or without
27: * modification, are permitted provided that the following conditions
28: * are met:
29: * 1. Redistributions of source code must retain the above copyright
30: * notice, this list of conditions and the following disclaimer.
31: * 2. Redistributions in binary form must reproduce the above copyright
32: * notice, this list of conditions and the following disclaimer in the
33: * documentation and/or other materials provided with the distribution.
34: * 3. All advertising materials mentioning features or use of this software
35: * must display the following acknowledgement:
36: * This product includes software developed by the University of
37: * California, Berkeley and its contributors.
38: * 4. Neither the name of the University nor the names of its contributors
39: * may be used to endorse or promote products derived from this software
40: * without specific prior written permission.
41: *
42: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
43: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
44: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
45: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
46: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
47: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
48: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
49: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
50: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
51: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
52: * SUCH DAMAGE.
53: *
54: * @(#)ns_output.c 8.1 (Berkeley) 6/10/93
55: */
56:
57: #include <sys/param.h>
58: #include <sys/malloc.h>
59: #include <sys/mbuf.h>
60: #include <sys/errno.h>
61: #include <sys/socket.h>
62: #include <sys/socketvar.h>
63:
64: #include <net/if.h>
65: #include <net/route.h>
66:
67: #include <netns/ns.h>
68: #include <netns/ns_if.h>
69: #include <netns/idp.h>
70: #include <netns/idp_var.h>
71:
72: #ifdef vax
73: #include <machine/mtpr.h>
74: #endif
75: int ns_hold_output = 0;
76: int ns_copy_output = 0;
77: int ns_output_cnt = 0;
78: struct mbuf *ns_lastout;
79:
80: ns_output(m0, ro, flags)
81: struct mbuf *m0;
82: struct route *ro;
83: int flags;
84: {
85: register struct idp *idp = mtod(m0, struct idp *);
86: register struct ifnet *ifp = 0;
87: int error = 0;
88: struct route idproute;
89: struct sockaddr_ns *dst;
90: extern int idpcksum;
91:
92: if (ns_hold_output) {
93: if (ns_lastout) {
94: (void)m_free(ns_lastout);
95: }
96: ns_lastout = m_copy(m0, 0, (int)M_COPYALL);
97: }
98: /*
99: * Route packet.
100: */
101: if (ro == 0) {
102: ro = &idproute;
103: bzero((caddr_t)ro, sizeof (*ro));
104: }
105: dst = (struct sockaddr_ns *)&ro->ro_dst;
106: if (ro->ro_rt == 0) {
107: dst->sns_family = AF_NS;
108: dst->sns_len = sizeof (*dst);
109: dst->sns_addr = idp->idp_dna;
110: dst->sns_addr.x_port = 0;
111: /*
112: * If routing to interface only,
113: * short circuit routing lookup.
114: */
115: if (flags & NS_ROUTETOIF) {
116: struct ns_ifaddr *ia = ns_iaonnetof(&idp->idp_dna);
117:
118: if (ia == 0) {
119: error = ENETUNREACH;
120: goto bad;
121: }
122: ifp = ia->ia_ifp;
123: goto gotif;
124: }
125: rtalloc(ro);
126: } else if ((ro->ro_rt->rt_flags & RTF_UP) == 0) {
127: /*
128: * The old route has gone away; try for a new one.
129: */
130: rtfree(ro->ro_rt);
131: ro->ro_rt = NULL;
132: rtalloc(ro);
133: }
134: if (ro->ro_rt == 0 || (ifp = ro->ro_rt->rt_ifp) == 0) {
135: error = ENETUNREACH;
136: goto bad;
137: }
138: ro->ro_rt->rt_use++;
139: if (ro->ro_rt->rt_flags & (RTF_GATEWAY|RTF_HOST))
140: dst = (struct sockaddr_ns *)ro->ro_rt->rt_gateway;
141: gotif:
142:
143: /*
144: * Look for multicast addresses and
145: * and verify user is allowed to send
146: * such a packet.
147: */
148: if (dst->sns_addr.x_host.c_host[0]&1) {
149: if ((ifp->if_flags & IFF_BROADCAST) == 0) {
150: error = EADDRNOTAVAIL;
151: goto bad;
152: }
153: if ((flags & NS_ALLOWBROADCAST) == 0) {
154: error = EACCES;
155: goto bad;
156: }
157: }
158:
159: if (htons(idp->idp_len) <= ifp->if_mtu) {
160: ns_output_cnt++;
161: if (ns_copy_output) {
162: ns_watch_output(m0, ifp);
163: }
164: error = (*ifp->if_output)(ifp, m0,
165: (struct sockaddr *)dst, ro->ro_rt);
166: goto done;
167: } else error = EMSGSIZE;
168:
169:
170: bad:
171: if (ns_copy_output) {
172: ns_watch_output(m0, ifp);
173: }
174: m_freem(m0);
175: done:
176: if (ro == &idproute && (flags & NS_ROUTETOIF) == 0 && ro->ro_rt) {
177: RTFREE(ro->ro_rt);
178: ro->ro_rt = 0;
179: }
180: return (error);
181: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.