]> git.saurik.com Git - apple/network_cmds.git/blame - routed.tproj/if.c
network_cmds-176.tar.gz
[apple/network_cmds.git] / routed.tproj / if.c
CommitLineData
b7080c8e
A
1/*
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
ac2f15b3
A
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.
b7080c8e
A
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,
ac2f15b3
A
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.
b7080c8e
A
22 *
23 * @APPLE_LICENSE_HEADER_END@
24 */
25/*
26 * Copyright (c) 1983, 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
66extern struct interface *ifnet;
67
68/*
69 * Find the interface with address addr.
70 */
71struct interface *
72if_ifwithaddr(addr)
73 struct sockaddr *addr;
74{
75 register struct interface *ifp;
76
77#define same(a1, a2) \
78 (memcmp((a1)->sa_data, (a2)->sa_data, 14) == 0)
79 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
80 if (ifp->int_flags & IFF_REMOTE)
81 continue;
82 if (ifp->int_addr.sa_family != addr->sa_family)
83 continue;
84 if (same(&ifp->int_addr, addr))
85 break;
86 if ((ifp->int_flags & IFF_BROADCAST) &&
87 same(&ifp->int_broadaddr, addr))
88 break;
89 }
90 return (ifp);
91}
92
93/*
94 * Find the point-to-point interface with destination address addr.
95 */
96struct interface *
97if_ifwithdstaddr(addr)
98 struct sockaddr *addr;
99{
100 register struct interface *ifp;
101
102 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
103 if ((ifp->int_flags & IFF_POINTOPOINT) == 0)
104 continue;
105 if (same(&ifp->int_dstaddr, addr))
106 break;
107 }
108 return (ifp);
109}
110
111/*
112 * Find the interface on the network
113 * of the specified address.
114 */
115struct interface *
116if_ifwithnet(addr)
117 register struct sockaddr *addr;
118{
119 register struct interface *ifp;
120 register int af = addr->sa_family;
121 register int (*netmatch)();
122
123 if (af >= af_max)
124 return (0);
125 netmatch = afswitch[af].af_netmatch;
126 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
127 if (ifp->int_flags & IFF_REMOTE)
128 continue;
129 if (af != ifp->int_addr.sa_family)
130 continue;
131 if ((*netmatch)(addr, &ifp->int_addr))
132 break;
133 }
134 return (ifp);
135}
136
137/*
138 * Find an interface from which the specified address
139 * should have come from. Used for figuring out which
140 * interface a packet came in on -- for tracing.
141 */
142struct interface *
143if_iflookup(addr)
144 struct sockaddr *addr;
145{
146 register struct interface *ifp, *maybe;
147 register int af = addr->sa_family;
148 register int (*netmatch)();
149
150 if (af >= af_max)
151 return (0);
152 maybe = 0;
153 netmatch = afswitch[af].af_netmatch;
154 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
155 if (ifp->int_addr.sa_family != af)
156 continue;
157 if (same(&ifp->int_addr, addr))
158 break;
159 if ((ifp->int_flags & IFF_BROADCAST) &&
160 same(&ifp->int_broadaddr, addr))
161 break;
162 if ((ifp->int_flags & IFF_POINTOPOINT) &&
163 same(&ifp->int_dstaddr, addr))
164 break;
165 if (maybe == 0 && (*netmatch)(addr, &ifp->int_addr))
166 maybe = ifp;
167 }
168 if (ifp == 0)
169 ifp = maybe;
170 return (ifp);
171}