]> git.saurik.com Git - apple/network_cmds.git/blob - routed.tproj/if.c
b732a4bcc52a46deca9d0b09b0830b66a6ed04c9
[apple/network_cmds.git] / routed.tproj / if.c
1 /*
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. Please obtain a copy of the License at
10 * http://www.opensource.apple.com/apsl/ and read it before using this
11 * file.
12 *
13 * The Original Code and all software distributed under the License are
14 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
15 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
16 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
18 * Please see the License for the specific language governing rights and
19 * limitations under the License.
20 *
21 * @APPLE_LICENSE_HEADER_END@
22 */
23 /*
24 * Copyright (c) 1983, 1993
25 * The Regents of the University of California. All rights reserved.
26 *
27 * Redistribution and use in source and binary forms, with or without
28 * modification, are permitted provided that the following conditions
29 * are met:
30 * 1. Redistributions of source code must retain the above copyright
31 * notice, this list of conditions and the following disclaimer.
32 * 2. Redistributions in binary form must reproduce the above copyright
33 * notice, this list of conditions and the following disclaimer in the
34 * documentation and/or other materials provided with the distribution.
35 * 3. All advertising materials mentioning features or use of this software
36 * must display the following acknowledgment:
37 * This product includes software developed by the University of
38 * California, Berkeley and its contributors.
39 * 4. Neither the name of the University nor the names of its contributors
40 * may be used to endorse or promote products derived from this software
41 * without specific prior written permission.
42 *
43 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
44 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
45 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
46 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
47 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
48 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
49 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
50 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
51 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
52 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53 * SUCH DAMAGE.
54 *
55 * @(#)defs.h 8.1 (Berkeley) 6/5/93
56 */
57
58
59 /*
60 * Routing Table Management Daemon
61 */
62 #include "defs.h"
63
64 extern struct interface *ifnet;
65
66 /*
67 * Find the interface with address addr.
68 */
69 struct interface *
70 if_ifwithaddr(addr)
71 struct sockaddr *addr;
72 {
73 register struct interface *ifp;
74
75 #define same(a1, a2) \
76 (memcmp((a1)->sa_data, (a2)->sa_data, 14) == 0)
77 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
78 if (ifp->int_flags & IFF_REMOTE)
79 continue;
80 if (ifp->int_addr.sa_family != addr->sa_family)
81 continue;
82 if (same(&ifp->int_addr, addr))
83 break;
84 if ((ifp->int_flags & IFF_BROADCAST) &&
85 same(&ifp->int_broadaddr, addr))
86 break;
87 }
88 return (ifp);
89 }
90
91 /*
92 * Find the point-to-point interface with destination address addr.
93 */
94 struct interface *
95 if_ifwithdstaddr(addr)
96 struct sockaddr *addr;
97 {
98 register struct interface *ifp;
99
100 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
101 if ((ifp->int_flags & IFF_POINTOPOINT) == 0)
102 continue;
103 if (same(&ifp->int_dstaddr, addr))
104 break;
105 }
106 return (ifp);
107 }
108
109 /*
110 * Find the interface on the network
111 * of the specified address.
112 */
113 struct interface *
114 if_ifwithnet(addr)
115 register struct sockaddr *addr;
116 {
117 register struct interface *ifp;
118 register int af = addr->sa_family;
119 register int (*netmatch)();
120
121 if (af >= af_max)
122 return (0);
123 netmatch = afswitch[af].af_netmatch;
124 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
125 if (ifp->int_flags & IFF_REMOTE)
126 continue;
127 if (af != ifp->int_addr.sa_family)
128 continue;
129 if ((*netmatch)(addr, &ifp->int_addr))
130 break;
131 }
132 return (ifp);
133 }
134
135 /*
136 * Find an interface from which the specified address
137 * should have come from. Used for figuring out which
138 * interface a packet came in on -- for tracing.
139 */
140 struct interface *
141 if_iflookup(addr)
142 struct sockaddr *addr;
143 {
144 register struct interface *ifp, *maybe;
145 register int af = addr->sa_family;
146 register int (*netmatch)();
147
148 if (af >= af_max)
149 return (0);
150 maybe = 0;
151 netmatch = afswitch[af].af_netmatch;
152 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
153 if (ifp->int_addr.sa_family != af)
154 continue;
155 if (same(&ifp->int_addr, addr))
156 break;
157 if ((ifp->int_flags & IFF_BROADCAST) &&
158 same(&ifp->int_broadaddr, addr))
159 break;
160 if ((ifp->int_flags & IFF_POINTOPOINT) &&
161 same(&ifp->int_dstaddr, addr))
162 break;
163 if (maybe == 0 && (*netmatch)(addr, &ifp->int_addr))
164 maybe = ifp;
165 }
166 if (ifp == 0)
167 ifp = maybe;
168 return (ifp);
169 }