]> git.saurik.com Git - apple/network_cmds.git/blob - routed.tproj/output.c
network_cmds-176.tar.gz
[apple/network_cmds.git] / routed.tproj / output.c
1 /*
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved.
7 *
8 * This file contains Original Code and/or Modifications of Original Code
9 * as defined in and that are subject to the Apple Public Source License
10 * Version 2.0 (the 'License'). You may not use this file except in
11 * compliance with the License. Please obtain a copy of the License at
12 * http://www.opensource.apple.com/apsl/ and read it before using this
13 * file.
14 *
15 * The Original Code and all software distributed under the License are
16 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
17 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
18 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
20 * Please see the License for the specific language governing rights and
21 * limitations under the License.
22 *
23 * @APPLE_LICENSE_HEADER_END@
24 */
25 /*
26 * Copyright (c) 1983, 1988, 1993
27 * The Regents of the University of California. All rights reserved.
28 *
29 * Redistribution and use in source and binary forms, with or without
30 * modification, are permitted provided that the following conditions
31 * are met:
32 * 1. Redistributions of source code must retain the above copyright
33 * notice, this list of conditions and the following disclaimer.
34 * 2. Redistributions in binary form must reproduce the above copyright
35 * notice, this list of conditions and the following disclaimer in the
36 * documentation and/or other materials provided with the distribution.
37 * 3. All advertising materials mentioning features or use of this software
38 * must display the following acknowledgment:
39 * This product includes software developed by the University of
40 * California, Berkeley and its contributors.
41 * 4. Neither the name of the University nor the names of its contributors
42 * may be used to endorse or promote products derived from this software
43 * without specific prior written permission.
44 *
45 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
46 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
47 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
48 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
49 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
50 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
51 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
52 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
53 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
54 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
55 * SUCH DAMAGE.
56 *
57 * @(#)defs.h 8.1 (Berkeley) 6/5/93
58 */
59
60
61 /*
62 * Routing Table Management Daemon
63 */
64 #include "defs.h"
65
66 /*
67 * Apply the function "f" to all non-passive
68 * interfaces. If the interface supports the
69 * use of broadcasting use it, otherwise address
70 * the output to the known router.
71 */
72 toall(f, rtstate, skipif)
73 int (*f)();
74 int rtstate;
75 struct interface *skipif;
76 {
77 register struct interface *ifp;
78 register struct sockaddr *dst;
79 register int flags;
80 extern struct interface *ifnet;
81
82 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
83 if (ifp->int_flags & IFF_PASSIVE || ifp == skipif)
84 continue;
85 dst = ifp->int_flags & IFF_BROADCAST ? &ifp->int_broadaddr :
86 ifp->int_flags & IFF_POINTOPOINT ? &ifp->int_dstaddr :
87 &ifp->int_addr;
88 flags = ifp->int_flags & IFF_INTERFACE ? MSG_DONTROUTE : 0;
89 (*f)(dst, flags, ifp, rtstate);
90 }
91 }
92
93 /*
94 * Output a preformed packet.
95 */
96 /*ARGSUSED*/
97 sndmsg(dst, flags, ifp, rtstate)
98 struct sockaddr *dst;
99 int flags;
100 struct interface *ifp;
101 int rtstate;
102 {
103
104 (*afswitch[dst->sa_family].af_output)(s, flags,
105 dst, sizeof (struct rip));
106 TRACE_OUTPUT(ifp, dst, sizeof (struct rip));
107 }
108
109 /*
110 * Supply dst with the contents of the routing tables.
111 * If this won't fit in one packet, chop it up into several.
112 */
113 supply(dst, flags, ifp, rtstate)
114 struct sockaddr *dst;
115 int flags;
116 register struct interface *ifp;
117 int rtstate;
118 {
119 register struct rt_entry *rt;
120 register struct netinfo *n = msg->rip_nets;
121 register struct rthash *rh;
122 struct rthash *base = hosthash;
123 int doinghost = 1, size;
124 int (*output)() = afswitch[dst->sa_family].af_output;
125 int (*sendroute)() = afswitch[dst->sa_family].af_sendroute;
126 int npackets = 0;
127
128 msg->rip_cmd = RIPCMD_RESPONSE;
129 msg->rip_vers = RIPVERSION;
130 memset(msg->rip_res1, 0, sizeof(msg->rip_res1));
131 again:
132 for (rh = base; rh < &base[ROUTEHASHSIZ]; rh++)
133 for (rt = rh->rt_forw; rt != (struct rt_entry *)rh; rt = rt->rt_forw) {
134 /*
135 * Don't resend the information on the network
136 * from which it was received (unless sending
137 * in response to a query).
138 */
139 if (ifp && rt->rt_ifp == ifp &&
140 (rt->rt_state & RTS_INTERFACE) == 0)
141 continue;
142 if (rt->rt_state & RTS_EXTERNAL)
143 continue;
144 /*
145 * For dynamic updates, limit update to routes
146 * with the specified state.
147 */
148 if (rtstate && (rt->rt_state & rtstate) == 0)
149 continue;
150 /*
151 * Limit the spread of subnet information
152 * to those who are interested.
153 */
154 if (doinghost == 0 && rt->rt_state & RTS_SUBNET) {
155 if (rt->rt_dst.sa_family != dst->sa_family)
156 continue;
157 if ((*sendroute)(rt, dst) == 0)
158 continue;
159 }
160 size = (char *)n - packet;
161 if (size > MAXPACKETSIZE - sizeof (struct netinfo)) {
162 TRACE_OUTPUT(ifp, dst, size);
163 (*output)(s, flags, dst, size);
164 /*
165 * If only sending to ourselves,
166 * one packet is enough to monitor interface.
167 */
168 if (ifp && (ifp->int_flags &
169 (IFF_BROADCAST | IFF_POINTOPOINT | IFF_REMOTE)) == 0)
170 return;
171 n = msg->rip_nets;
172 npackets++;
173 }
174 n->rip_dst = rt->rt_dst;
175 #if BSD < 198810
176 if (sizeof(n->rip_dst.sa_family) > 1) /* XXX */
177 n->rip_dst.sa_family = htons(n->rip_dst.sa_family);
178 #else
179 #define osa(x) ((struct osockaddr *)(&(x)))
180 osa(n->rip_dst)->sa_family = htons(n->rip_dst.sa_family);
181 #endif
182 n->rip_metric = htonl(rt->rt_metric);
183 n++;
184 }
185 if (doinghost) {
186 doinghost = 0;
187 base = nethash;
188 goto again;
189 }
190 if (n != msg->rip_nets || (npackets == 0 && rtstate == 0)) {
191 size = (char *)n - packet;
192 TRACE_OUTPUT(ifp, dst, size);
193 (*output)(s, flags, dst, size);
194 }
195 }