if.c revision 1.5 1 1.1 cgd /*
2 1.5 mycroft * Copyright (c) 1983, 1993
3 1.5 mycroft * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.5 mycroft /*static char sccsid[] = "from: @(#)if.c 8.1 (Berkeley) 6/5/93";*/
36 1.5 mycroft static char *rcsid = "$Id: if.c,v 1.5 1994/05/13 08:04:35 mycroft Exp $";
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.1 cgd /*
40 1.1 cgd * Routing Table Management Daemon
41 1.1 cgd */
42 1.1 cgd #include "defs.h"
43 1.1 cgd
44 1.1 cgd extern struct interface *ifnet;
45 1.1 cgd
46 1.1 cgd /*
47 1.1 cgd * Find the interface with address addr.
48 1.1 cgd */
49 1.1 cgd struct interface *
50 1.1 cgd if_ifwithaddr(addr)
51 1.1 cgd struct sockaddr *addr;
52 1.1 cgd {
53 1.1 cgd register struct interface *ifp;
54 1.1 cgd
55 1.1 cgd #define same(a1, a2) \
56 1.1 cgd (bcmp((caddr_t)((a1)->sa_data), (caddr_t)((a2)->sa_data), 14) == 0)
57 1.1 cgd for (ifp = ifnet; ifp; ifp = ifp->int_next) {
58 1.1 cgd if (ifp->int_flags & IFF_REMOTE)
59 1.1 cgd continue;
60 1.1 cgd if (ifp->int_addr.sa_family != addr->sa_family)
61 1.1 cgd continue;
62 1.1 cgd if (same(&ifp->int_addr, addr))
63 1.1 cgd break;
64 1.1 cgd if ((ifp->int_flags & IFF_BROADCAST) &&
65 1.1 cgd same(&ifp->int_broadaddr, addr))
66 1.1 cgd break;
67 1.1 cgd }
68 1.1 cgd return (ifp);
69 1.1 cgd }
70 1.1 cgd
71 1.1 cgd /*
72 1.1 cgd * Find the point-to-point interface with destination address addr.
73 1.1 cgd */
74 1.1 cgd struct interface *
75 1.1 cgd if_ifwithdstaddr(addr)
76 1.1 cgd struct sockaddr *addr;
77 1.1 cgd {
78 1.1 cgd register struct interface *ifp;
79 1.1 cgd
80 1.1 cgd for (ifp = ifnet; ifp; ifp = ifp->int_next) {
81 1.1 cgd if ((ifp->int_flags & IFF_POINTOPOINT) == 0)
82 1.1 cgd continue;
83 1.1 cgd if (same(&ifp->int_dstaddr, addr))
84 1.1 cgd break;
85 1.1 cgd }
86 1.1 cgd return (ifp);
87 1.1 cgd }
88 1.1 cgd
89 1.1 cgd /*
90 1.1 cgd * Find the interface on the network
91 1.1 cgd * of the specified address.
92 1.1 cgd */
93 1.1 cgd struct interface *
94 1.1 cgd if_ifwithnet(addr)
95 1.1 cgd register struct sockaddr *addr;
96 1.1 cgd {
97 1.1 cgd register struct interface *ifp;
98 1.1 cgd register int af = addr->sa_family;
99 1.1 cgd register int (*netmatch)();
100 1.1 cgd
101 1.1 cgd if (af >= af_max)
102 1.1 cgd return (0);
103 1.1 cgd netmatch = afswitch[af].af_netmatch;
104 1.1 cgd for (ifp = ifnet; ifp; ifp = ifp->int_next) {
105 1.1 cgd if (ifp->int_flags & IFF_REMOTE)
106 1.1 cgd continue;
107 1.1 cgd if (af != ifp->int_addr.sa_family)
108 1.1 cgd continue;
109 1.1 cgd if ((*netmatch)(addr, &ifp->int_addr))
110 1.1 cgd break;
111 1.1 cgd }
112 1.1 cgd return (ifp);
113 1.1 cgd }
114 1.1 cgd
115 1.1 cgd /*
116 1.1 cgd * Find an interface from which the specified address
117 1.1 cgd * should have come from. Used for figuring out which
118 1.1 cgd * interface a packet came in on -- for tracing.
119 1.1 cgd */
120 1.1 cgd struct interface *
121 1.1 cgd if_iflookup(addr)
122 1.1 cgd struct sockaddr *addr;
123 1.1 cgd {
124 1.1 cgd register struct interface *ifp, *maybe;
125 1.1 cgd register int af = addr->sa_family;
126 1.1 cgd register int (*netmatch)();
127 1.1 cgd
128 1.1 cgd if (af >= af_max)
129 1.1 cgd return (0);
130 1.1 cgd maybe = 0;
131 1.1 cgd netmatch = afswitch[af].af_netmatch;
132 1.1 cgd for (ifp = ifnet; ifp; ifp = ifp->int_next) {
133 1.1 cgd if (ifp->int_addr.sa_family != af)
134 1.1 cgd continue;
135 1.1 cgd if (same(&ifp->int_addr, addr))
136 1.1 cgd break;
137 1.1 cgd if ((ifp->int_flags & IFF_BROADCAST) &&
138 1.1 cgd same(&ifp->int_broadaddr, addr))
139 1.1 cgd break;
140 1.1 cgd if ((ifp->int_flags & IFF_POINTOPOINT) &&
141 1.1 cgd same(&ifp->int_dstaddr, addr))
142 1.1 cgd break;
143 1.1 cgd if (maybe == 0 && (*netmatch)(addr, &ifp->int_addr))
144 1.1 cgd maybe = ifp;
145 1.1 cgd }
146 1.1 cgd if (ifp == 0)
147 1.1 cgd ifp = maybe;
148 1.1 cgd return (ifp);
149 1.1 cgd }
150