]>
Commit | Line | Data |
---|---|---|
b7080c8e A |
1 | /* |
2 | * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. | |
3 | * | |
4 | * @APPLE_LICENSE_HEADER_START@ | |
5 | * | |
a2c93a76 A |
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 | |
12 | * this file. | |
b7080c8e A |
13 | * |
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, | |
a2c93a76 A |
18 | * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the |
19 | * License for the specific language governing rights and limitations | |
20 | * under the License." | |
b7080c8e A |
21 | * |
22 | * @APPLE_LICENSE_HEADER_END@ | |
23 | */ | |
24 | /* | |
25 | * Copyright (c) 1983, 1993 | |
26 | * The Regents of the University of California. All rights reserved. | |
27 | * | |
28 | * Redistribution and use in source and binary forms, with or without | |
29 | * modification, are permitted provided that the following conditions | |
30 | * are met: | |
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. | |
43 | * | |
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 | |
54 | * SUCH DAMAGE. | |
55 | * | |
56 | * @(#)defs.h 8.1 (Berkeley) 6/5/93 | |
57 | */ | |
58 | ||
59 | ||
60 | /* | |
61 | * Routing Table Management Daemon | |
62 | */ | |
63 | #include "defs.h" | |
64 | ||
65 | extern struct interface *ifnet; | |
66 | ||
67 | /* | |
68 | * Find the interface with address addr. | |
69 | */ | |
70 | struct interface * | |
71 | if_ifwithaddr(addr) | |
72 | struct sockaddr *addr; | |
73 | { | |
74 | register struct interface *ifp; | |
75 | ||
76 | #define same(a1, a2) \ | |
77 | (memcmp((a1)->sa_data, (a2)->sa_data, 14) == 0) | |
78 | for (ifp = ifnet; ifp; ifp = ifp->int_next) { | |
79 | if (ifp->int_flags & IFF_REMOTE) | |
80 | continue; | |
81 | if (ifp->int_addr.sa_family != addr->sa_family) | |
82 | continue; | |
83 | if (same(&ifp->int_addr, addr)) | |
84 | break; | |
85 | if ((ifp->int_flags & IFF_BROADCAST) && | |
86 | same(&ifp->int_broadaddr, addr)) | |
87 | break; | |
88 | } | |
89 | return (ifp); | |
90 | } | |
91 | ||
92 | /* | |
93 | * Find the point-to-point interface with destination address addr. | |
94 | */ | |
95 | struct interface * | |
96 | if_ifwithdstaddr(addr) | |
97 | struct sockaddr *addr; | |
98 | { | |
99 | register struct interface *ifp; | |
100 | ||
101 | for (ifp = ifnet; ifp; ifp = ifp->int_next) { | |
102 | if ((ifp->int_flags & IFF_POINTOPOINT) == 0) | |
103 | continue; | |
104 | if (same(&ifp->int_dstaddr, addr)) | |
105 | break; | |
106 | } | |
107 | return (ifp); | |
108 | } | |
109 | ||
110 | /* | |
111 | * Find the interface on the network | |
112 | * of the specified address. | |
113 | */ | |
114 | struct interface * | |
115 | if_ifwithnet(addr) | |
116 | register struct sockaddr *addr; | |
117 | { | |
118 | register struct interface *ifp; | |
119 | register int af = addr->sa_family; | |
120 | register int (*netmatch)(); | |
121 | ||
122 | if (af >= af_max) | |
123 | return (0); | |
124 | netmatch = afswitch[af].af_netmatch; | |
125 | for (ifp = ifnet; ifp; ifp = ifp->int_next) { | |
126 | if (ifp->int_flags & IFF_REMOTE) | |
127 | continue; | |
128 | if (af != ifp->int_addr.sa_family) | |
129 | continue; | |
130 | if ((*netmatch)(addr, &ifp->int_addr)) | |
131 | break; | |
132 | } | |
133 | return (ifp); | |
134 | } | |
135 | ||
136 | /* | |
137 | * Find an interface from which the specified address | |
138 | * should have come from. Used for figuring out which | |
139 | * interface a packet came in on -- for tracing. | |
140 | */ | |
141 | struct interface * | |
142 | if_iflookup(addr) | |
143 | struct sockaddr *addr; | |
144 | { | |
145 | register struct interface *ifp, *maybe; | |
146 | register int af = addr->sa_family; | |
147 | register int (*netmatch)(); | |
148 | ||
149 | if (af >= af_max) | |
150 | return (0); | |
151 | maybe = 0; | |
152 | netmatch = afswitch[af].af_netmatch; | |
153 | for (ifp = ifnet; ifp; ifp = ifp->int_next) { | |
154 | if (ifp->int_addr.sa_family != af) | |
155 | continue; | |
156 | if (same(&ifp->int_addr, addr)) | |
157 | break; | |
158 | if ((ifp->int_flags & IFF_BROADCAST) && | |
159 | same(&ifp->int_broadaddr, addr)) | |
160 | break; | |
161 | if ((ifp->int_flags & IFF_POINTOPOINT) && | |
162 | same(&ifp->int_dstaddr, addr)) | |
163 | break; | |
164 | if (maybe == 0 && (*netmatch)(addr, &ifp->int_addr)) | |
165 | maybe = ifp; | |
166 | } | |
167 | if (ifp == 0) | |
168 | ifp = maybe; | |
169 | return (ifp); | |
170 | } |