]>
git.saurik.com Git - apple/network_cmds.git/blob - routed.tproj/output.c
de7691a3b4bedef10883a4453c5a2cb7653d7cb4
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
4 * @APPLE_LICENSE_HEADER_START@
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.0 (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
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
22 * @APPLE_LICENSE_HEADER_END@
25 * Copyright (c) 1983, 1988, 1993
26 * The Regents of the University of California. All rights reserved.
28 * Redistribution and use in source and binary forms, with or without
29 * modification, are permitted provided that the following conditions
31 * 1. Redistributions of source code must retain the above copyright
32 * notice, this list of conditions and the following disclaimer.
33 * 2. Redistributions in binary form must reproduce the above copyright
34 * notice, this list of conditions and the following disclaimer in the
35 * documentation and/or other materials provided with the distribution.
36 * 3. All advertising materials mentioning features or use of this software
37 * must display the following acknowledgment:
38 * This product includes software developed by the University of
39 * California, Berkeley and its contributors.
40 * 4. Neither the name of the University nor the names of its contributors
41 * may be used to endorse or promote products derived from this software
42 * without specific prior written permission.
44 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
45 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
46 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
47 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
48 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
49 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
50 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
51 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
52 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
53 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
56 * @(#)defs.h 8.1 (Berkeley) 6/5/93
61 * Routing Table Management Daemon
66 * Apply the function "f" to all non-passive
67 * interfaces. If the interface supports the
68 * use of broadcasting use it, otherwise address
69 * the output to the known router.
72 toall(f
, rtstate
, skipif
)
75 struct interface
*skipif
;
77 register struct interface
*ifp
;
78 register struct sockaddr
*dst
;
80 extern struct interface
*ifnet
;
82 for (ifp
= ifnet
; ifp
; ifp
= ifp
->int_next
) {
83 if (ifp
->int_flags
& IFF_PASSIVE
|| ifp
== skipif
)
85 dst
= ifp
->int_flags
& IFF_BROADCAST
? &ifp
->int_broadaddr
:
86 ifp
->int_flags
& IFF_POINTOPOINT
? &ifp
->int_dstaddr
:
88 flags
= ifp
->int_flags
& IFF_INTERFACE
? MSG_DONTROUTE
: 0;
89 (*f
)(dst
, flags
, ifp
, rtstate
);
94 * Output a preformed packet.
98 sndmsg(dst
, flags
, ifp
, rtstate
)
101 struct interface
*ifp
;
105 (*afswitch
[dst
->sa_family
].af_output
)(s
, flags
,
106 dst
, sizeof (struct rip
));
107 TRACE_OUTPUT(ifp
, dst
, sizeof (struct rip
));
111 * Supply dst with the contents of the routing tables.
112 * If this won't fit in one packet, chop it up into several.
115 supply(dst
, flags
, ifp
, rtstate
)
116 struct sockaddr
*dst
;
118 register struct interface
*ifp
;
121 register struct rt_entry
*rt
;
122 register struct netinfo
*n
= msg
->rip_nets
;
123 register struct rthash
*rh
;
124 struct rthash
*base
= hosthash
;
125 int doinghost
= 1, size
;
126 int (*output
)() = afswitch
[dst
->sa_family
].af_output
;
127 int (*sendroute
)() = afswitch
[dst
->sa_family
].af_sendroute
;
130 msg
->rip_cmd
= RIPCMD_RESPONSE
;
131 msg
->rip_vers
= RIPVERSION
;
132 memset(msg
->rip_res1
, 0, sizeof(msg
->rip_res1
));
134 for (rh
= base
; rh
< &base
[ROUTEHASHSIZ
]; rh
++)
135 for (rt
= rh
->rt_forw
; rt
!= (struct rt_entry
*)rh
; rt
= rt
->rt_forw
) {
137 * Don't resend the information on the network
138 * from which it was received (unless sending
139 * in response to a query).
141 if (ifp
&& rt
->rt_ifp
== ifp
&&
142 (rt
->rt_state
& RTS_INTERFACE
) == 0)
144 if (rt
->rt_state
& RTS_EXTERNAL
)
147 * For dynamic updates, limit update to routes
148 * with the specified state.
150 if (rtstate
&& (rt
->rt_state
& rtstate
) == 0)
153 * Limit the spread of subnet information
154 * to those who are interested.
156 if (doinghost
== 0 && rt
->rt_state
& RTS_SUBNET
) {
157 if (rt
->rt_dst
.sa_family
!= dst
->sa_family
)
159 if ((*sendroute
)(rt
, dst
) == 0)
162 size
= (char *)n
- packet
;
163 if (size
> MAXPACKETSIZE
- sizeof (struct netinfo
)) {
164 TRACE_OUTPUT(ifp
, dst
, size
);
165 (*output
)(s
, flags
, dst
, size
);
167 * If only sending to ourselves,
168 * one packet is enough to monitor interface.
170 if (ifp
&& (ifp
->int_flags
&
171 (IFF_BROADCAST
| IFF_POINTOPOINT
| IFF_REMOTE
)) == 0)
176 n
->rip_dst
= rt
->rt_dst
;
177 n
->rip_metric
= htonl(rt
->rt_metric
);
185 if (n
!= msg
->rip_nets
|| (npackets
== 0 && rtstate
== 0)) {
186 size
= (char *)n
- packet
;
187 TRACE_OUTPUT(ifp
, dst
, size
);
188 (*output
)(s
, flags
, dst
, size
);