2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * From: @(#)if.c 5.6 (Berkeley) 6/1/90
36 * From: @(#)if.c 8.1 (Berkeley) 6/5/93
39 "$Id: if.c,v 1.5 1999/08/01 19:19:16 dholland Exp $";
42 * Routing Table Management Daemon
47 extern struct interface *ifnet;
51 same(struct sockaddr *a1, struct sockaddr *a2)
53 return !memcmp(a1->sa_data, a2->sa_data, 14);
57 * Find the interface with address addr.
60 struct interface *if_ifwithaddr(struct sockaddr *addr)
62 struct interface *ifp;
64 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
65 if (ifp->int_flags & IFF_REMOTE)
67 if (ifp->int_addr.sa_family != addr->sa_family)
69 if (same(&ifp->int_addr, addr))
71 if ((ifp->int_flags & IFF_BROADCAST) &&
72 same(&ifp->int_broadaddr, addr))
79 * Find the point-to-point interface with destination address addr.
81 struct interface *if_ifwithdstaddr(struct sockaddr *addr)
83 struct interface *ifp;
85 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
86 if ((ifp->int_flags & IFF_POINTOPOINT) == 0)
88 if (same(&ifp->int_dstaddr, addr))
95 * Find the interface on the network
96 * of the specified address.
99 struct interface *if_ifwithnet(struct sockaddr *addr)
101 struct interface *ifp;
102 int af = addr->sa_family;
103 int (*netmatch)(struct sockaddr *, struct sockaddr *);
107 netmatch = afswitch[af].af_netmatch;
108 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
109 if (ifp->int_flags & IFF_REMOTE)
111 if (af != ifp->int_addr.sa_family)
113 if ((*netmatch)(addr, &ifp->int_addr))
120 * Find an interface from which the specified address
121 * should have come from. Used for figuring out which
122 * interface a packet came in on -- for tracing.
124 struct interface *if_iflookup(struct sockaddr *addr)
126 struct interface *ifp, *maybe;
127 int af = addr->sa_family;
128 int (*netmatch)(struct sockaddr *, struct sockaddr *);
133 netmatch = afswitch[af].af_netmatch;
134 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
135 if (ifp->int_addr.sa_family != af)
137 if (same(&ifp->int_addr, addr))
139 if ((ifp->int_flags & IFF_BROADCAST) &&
140 same(&ifp->int_broadaddr, addr))
142 if ((ifp->int_flags & IFF_POINTOPOINT) &&
143 same(&ifp->int_dstaddr, addr))
145 if (maybe == 0 && (*netmatch)(addr, &ifp->int_addr))