vif.c revision 1.6 1 1.6 mycroft /* $NetBSD: vif.c,v 1.6 1995/12/10 10:07:19 mycroft Exp $ */
2 1.5 thorpej
3 1.1 brezak /*
4 1.1 brezak * The mrouted program is covered by the license in the accompanying file
5 1.1 brezak * named "LICENSE". Use of the mrouted program represents acceptance of
6 1.1 brezak * the terms and conditions listed in that file.
7 1.1 brezak *
8 1.1 brezak * The mrouted program is COPYRIGHT 1989 by The Board of Trustees of
9 1.1 brezak * Leland Stanford Junior University.
10 1.1 brezak */
11 1.1 brezak
12 1.1 brezak
13 1.1 brezak #include "defs.h"
14 1.6 mycroft #include <fcntl.h>
15 1.1 brezak
16 1.1 brezak /*
17 1.1 brezak * Exported variables.
18 1.1 brezak */
19 1.6 mycroft struct uvif uvifs[MAXVIFS]; /* array of virtual interfaces */
20 1.6 mycroft vifi_t numvifs; /* number of vifs in use */
21 1.6 mycroft int vifs_down; /* 1=>some interfaces are down */
22 1.6 mycroft int phys_vif; /* An enabled vif */
23 1.1 brezak int udp_socket; /* Since the honkin' kernel doesn't support */
24 1.1 brezak /* ioctls on raw IP sockets, we need a UDP */
25 1.1 brezak /* socket as well as our IGMP (raw) socket. */
26 1.1 brezak /* How dumb. */
27 1.4 mycroft int vifs_with_neighbors; /* == 1 if I am a leaf */
28 1.1 brezak
29 1.6 mycroft typedef struct {
30 1.6 mycroft vifi_t vifi;
31 1.6 mycroft struct listaddr *g;
32 1.6 mycroft int q_time;
33 1.6 mycroft } cbk_t;
34 1.6 mycroft
35 1.1 brezak /*
36 1.1 brezak * Forward declarations.
37 1.1 brezak */
38 1.6 mycroft static void start_vif __P((vifi_t vifi));
39 1.6 mycroft static void start_vif2 __P((vifi_t vifi));
40 1.6 mycroft static void stop_vif __P((vifi_t vifi));
41 1.6 mycroft static void age_old_hosts __P((void));
42 1.6 mycroft static void send_probe_on_vif __P((struct uvif *v));
43 1.6 mycroft static int info_version __P((char *p));
44 1.6 mycroft static void DelVif __P((void *arg));
45 1.6 mycroft static int SetTimer __P((int vifi, struct listaddr *g));
46 1.6 mycroft static int DeleteTimer __P((int id));
47 1.6 mycroft static void SendQuery __P((void *arg));
48 1.6 mycroft static int SetQueryTimer __P((struct listaddr *g, vifi_t vifi, int to_expire,
49 1.6 mycroft int q_time));
50 1.6 mycroft
51 1.1 brezak
52 1.1 brezak /*
53 1.6 mycroft * Initialize the virtual interfaces, but do not install
54 1.6 mycroft * them in the kernel. Start routing on all vifs that are
55 1.6 mycroft * not down or disabled.
56 1.1 brezak */
57 1.4 mycroft void
58 1.4 mycroft init_vifs()
59 1.1 brezak {
60 1.1 brezak vifi_t vifi;
61 1.1 brezak struct uvif *v;
62 1.1 brezak int enabled_vifs, enabled_phyints;
63 1.4 mycroft extern char *configfilename;
64 1.1 brezak
65 1.1 brezak numvifs = 0;
66 1.6 mycroft vifs_with_neighbors = 0;
67 1.1 brezak vifs_down = FALSE;
68 1.1 brezak
69 1.1 brezak /*
70 1.1 brezak * Configure the vifs based on the interface configuration of the
71 1.1 brezak * the kernel and the contents of the configuration file.
72 1.1 brezak * (Open a UDP socket for ioctl use in the config procedures.)
73 1.1 brezak */
74 1.1 brezak if ((udp_socket = socket(AF_INET, SOCK_DGRAM, 0)) < 0)
75 1.1 brezak log(LOG_ERR, errno, "UDP socket");
76 1.4 mycroft log(LOG_INFO,0,"Getting vifs from kernel interfaces");
77 1.1 brezak config_vifs_from_kernel();
78 1.4 mycroft log(LOG_INFO,0,"Getting vifs from %s",configfilename);
79 1.1 brezak config_vifs_from_file();
80 1.1 brezak
81 1.1 brezak /*
82 1.1 brezak * Quit if there are fewer than two enabled vifs.
83 1.1 brezak */
84 1.1 brezak enabled_vifs = 0;
85 1.1 brezak enabled_phyints = 0;
86 1.6 mycroft phys_vif = -1;
87 1.1 brezak for (vifi = 0, v = uvifs; vifi < numvifs; ++vifi, ++v) {
88 1.1 brezak if (!(v->uv_flags & VIFF_DISABLED)) {
89 1.1 brezak ++enabled_vifs;
90 1.6 mycroft if (!(v->uv_flags & VIFF_TUNNEL)) {
91 1.6 mycroft if (phys_vif == -1)
92 1.6 mycroft phys_vif = vifi;
93 1.1 brezak ++enabled_phyints;
94 1.6 mycroft }
95 1.1 brezak }
96 1.1 brezak }
97 1.1 brezak if (enabled_vifs < 2)
98 1.1 brezak log(LOG_ERR, 0, "can't forward: %s",
99 1.1 brezak enabled_vifs == 0 ? "no enabled vifs" : "only one enabled vif");
100 1.1 brezak
101 1.1 brezak if (enabled_phyints == 0)
102 1.1 brezak log(LOG_WARNING, 0,
103 1.1 brezak "no enabled interfaces, forwarding via tunnels only");
104 1.1 brezak
105 1.6 mycroft log(LOG_INFO, 0, "Installing vifs in mrouted...");
106 1.1 brezak for (vifi = 0, v = uvifs; vifi < numvifs; ++vifi, ++v) {
107 1.1 brezak if (!(v->uv_flags & VIFF_DISABLED)) {
108 1.4 mycroft if (!(v->uv_flags & VIFF_DOWN)) {
109 1.4 mycroft if (v->uv_flags & VIFF_TUNNEL)
110 1.6 mycroft log(LOG_INFO, 0, "vif #%d, tunnel %s -> %s", vifi,
111 1.6 mycroft inet_fmt(v->uv_lcl_addr, s1),
112 1.6 mycroft inet_fmt(v->uv_rmt_addr, s2));
113 1.4 mycroft else
114 1.6 mycroft log(LOG_INFO, 0, "vif #%d, phyint %s", vifi,
115 1.6 mycroft inet_fmt(v->uv_lcl_addr, s1));
116 1.6 mycroft start_vif2(vifi);
117 1.4 mycroft } else log(LOG_INFO, 0,
118 1.4 mycroft "%s is not yet up; vif #%u not in service",
119 1.4 mycroft v->uv_name, vifi);
120 1.1 brezak }
121 1.1 brezak }
122 1.1 brezak }
123 1.1 brezak
124 1.6 mycroft /*
125 1.6 mycroft * Start routing on all virtual interfaces that are not down or
126 1.6 mycroft * administratively disabled.
127 1.6 mycroft */
128 1.6 mycroft void
129 1.6 mycroft init_installvifs()
130 1.6 mycroft {
131 1.6 mycroft vifi_t vifi;
132 1.6 mycroft struct uvif *v;
133 1.6 mycroft
134 1.6 mycroft log(LOG_INFO, 0, "Installing vifs in kernel...");
135 1.6 mycroft for (vifi = 0, v = uvifs; vifi < numvifs; ++vifi, ++v) {
136 1.6 mycroft if (!(v->uv_flags & VIFF_DISABLED)) {
137 1.6 mycroft if (!(v->uv_flags & VIFF_DOWN)) {
138 1.6 mycroft if (v->uv_flags & VIFF_TUNNEL)
139 1.6 mycroft log(LOG_INFO, 0, "vif #%d, tunnel %s -> %s", vifi,
140 1.6 mycroft inet_fmt(v->uv_lcl_addr, s1),
141 1.6 mycroft inet_fmt(v->uv_rmt_addr, s2));
142 1.6 mycroft else
143 1.6 mycroft log(LOG_INFO, 0, "vif #%d, phyint %s", vifi,
144 1.6 mycroft inet_fmt(v->uv_lcl_addr, s1));
145 1.6 mycroft k_add_vif(vifi, &uvifs[vifi]);
146 1.6 mycroft } else log(LOG_INFO, 0,
147 1.6 mycroft "%s is not yet up; vif #%u not in service",
148 1.6 mycroft v->uv_name, vifi);
149 1.6 mycroft }
150 1.6 mycroft }
151 1.6 mycroft }
152 1.1 brezak
153 1.1 brezak /*
154 1.1 brezak * See if any interfaces have changed from up state to down, or vice versa,
155 1.1 brezak * including any non-multicast-capable interfaces that are in use as local
156 1.1 brezak * tunnel end-points. Ignore interfaces that have been administratively
157 1.1 brezak * disabled.
158 1.1 brezak */
159 1.4 mycroft void
160 1.4 mycroft check_vif_state()
161 1.1 brezak {
162 1.1 brezak register vifi_t vifi;
163 1.1 brezak register struct uvif *v;
164 1.1 brezak struct ifreq ifr;
165 1.1 brezak
166 1.1 brezak vifs_down = FALSE;
167 1.1 brezak for (vifi = 0, v = uvifs; vifi < numvifs; ++vifi, ++v) {
168 1.1 brezak
169 1.1 brezak if (v->uv_flags & VIFF_DISABLED) continue;
170 1.1 brezak
171 1.1 brezak strncpy(ifr.ifr_name, v->uv_name, IFNAMSIZ);
172 1.1 brezak if (ioctl(udp_socket, SIOCGIFFLAGS, (char *)&ifr) < 0)
173 1.1 brezak log(LOG_ERR, errno,
174 1.1 brezak "ioctl SIOCGIFFLAGS for %s", ifr.ifr_name);
175 1.1 brezak
176 1.1 brezak if (v->uv_flags & VIFF_DOWN) {
177 1.1 brezak if (ifr.ifr_flags & IFF_UP) {
178 1.1 brezak v->uv_flags &= ~VIFF_DOWN;
179 1.1 brezak start_vif(vifi);
180 1.1 brezak log(LOG_INFO, 0,
181 1.1 brezak "%s has come up; vif #%u now in service",
182 1.1 brezak v->uv_name, vifi);
183 1.1 brezak }
184 1.1 brezak else vifs_down = TRUE;
185 1.1 brezak }
186 1.1 brezak else {
187 1.1 brezak if (!(ifr.ifr_flags & IFF_UP)) {
188 1.1 brezak stop_vif(vifi);
189 1.1 brezak v->uv_flags |= VIFF_DOWN;
190 1.1 brezak log(LOG_INFO, 0,
191 1.1 brezak "%s has gone down; vif #%u taken out of service",
192 1.1 brezak v->uv_name, vifi);
193 1.1 brezak vifs_down = TRUE;
194 1.1 brezak }
195 1.1 brezak }
196 1.1 brezak }
197 1.1 brezak }
198 1.1 brezak
199 1.4 mycroft /*
200 1.4 mycroft * Send a probe message on vif v
201 1.4 mycroft */
202 1.6 mycroft static void
203 1.4 mycroft send_probe_on_vif(v)
204 1.4 mycroft register struct uvif *v;
205 1.4 mycroft {
206 1.4 mycroft register char *p;
207 1.4 mycroft register int datalen = 0;
208 1.4 mycroft struct listaddr *nbr;
209 1.4 mycroft int i;
210 1.4 mycroft
211 1.4 mycroft p = send_buf + MIN_IP_HEADER_LEN + IGMP_MINLEN;
212 1.4 mycroft
213 1.4 mycroft for (i = 0; i < 4; i++)
214 1.4 mycroft *p++ = ((char *)&(dvmrp_genid))[i];
215 1.4 mycroft datalen += 4;
216 1.4 mycroft
217 1.4 mycroft /*
218 1.4 mycroft * add the neighbor list on the interface to the message
219 1.4 mycroft */
220 1.4 mycroft nbr = v->uv_neighbors;
221 1.4 mycroft
222 1.4 mycroft while (nbr) {
223 1.4 mycroft for (i = 0; i < 4; i++)
224 1.4 mycroft *p++ = ((char *)&nbr->al_addr)[i];
225 1.4 mycroft datalen +=4;
226 1.4 mycroft nbr = nbr->al_next;
227 1.4 mycroft }
228 1.4 mycroft
229 1.4 mycroft send_igmp(v->uv_lcl_addr,
230 1.4 mycroft (v->uv_flags & VIFF_TUNNEL) ? v->uv_rmt_addr
231 1.4 mycroft : dvmrp_group,
232 1.4 mycroft IGMP_DVMRP, DVMRP_PROBE,
233 1.4 mycroft htonl(MROUTED_LEVEL |
234 1.4 mycroft ((v->uv_flags & VIFF_LEAF) ? 0 : LEAF_FLAGS)),
235 1.4 mycroft datalen);
236 1.4 mycroft }
237 1.1 brezak
238 1.1 brezak /*
239 1.6 mycroft * Add a vifi to the kernel and start routing on it.
240 1.1 brezak */
241 1.4 mycroft static void
242 1.4 mycroft start_vif(vifi)
243 1.1 brezak vifi_t vifi;
244 1.1 brezak {
245 1.6 mycroft /*
246 1.6 mycroft * Install the interface in the kernel's vif structure.
247 1.6 mycroft */
248 1.6 mycroft k_add_vif(vifi, &uvifs[vifi]);
249 1.6 mycroft
250 1.6 mycroft start_vif2(vifi);
251 1.6 mycroft }
252 1.6 mycroft
253 1.6 mycroft /*
254 1.6 mycroft * Add a vifi to all the user-level data structures but don't add
255 1.6 mycroft * it to the kernel yet.
256 1.6 mycroft */
257 1.6 mycroft static void
258 1.6 mycroft start_vif2(vifi)
259 1.6 mycroft vifi_t vifi;
260 1.6 mycroft {
261 1.1 brezak struct uvif *v;
262 1.4 mycroft u_int32_t src;
263 1.4 mycroft struct phaddr *p;
264 1.1 brezak
265 1.1 brezak v = &uvifs[vifi];
266 1.1 brezak src = v->uv_lcl_addr;
267 1.1 brezak
268 1.1 brezak /*
269 1.1 brezak * Update the existing route entries to take into account the new vif.
270 1.1 brezak */
271 1.1 brezak add_vif_to_routes(vifi);
272 1.1 brezak
273 1.1 brezak if (!(v->uv_flags & VIFF_TUNNEL)) {
274 1.1 brezak /*
275 1.1 brezak * Join the DVMRP multicast group on the interface.
276 1.1 brezak * (This is not strictly necessary, since the kernel promiscuously
277 1.1 brezak * receives IGMP packets addressed to ANY IP multicast group while
278 1.1 brezak * multicast routing is enabled. However, joining the group allows
279 1.1 brezak * this host to receive non-IGMP packets as well, such as 'pings'.)
280 1.1 brezak */
281 1.1 brezak k_join(dvmrp_group, src);
282 1.1 brezak
283 1.1 brezak /*
284 1.4 mycroft * Join the ALL-ROUTERS multicast group on the interface.
285 1.4 mycroft * This allows mtrace requests to loop back if they are run
286 1.4 mycroft * on the multicast router.
287 1.4 mycroft */
288 1.4 mycroft k_join(allrtrs_group, src);
289 1.4 mycroft
290 1.4 mycroft /*
291 1.1 brezak * Install an entry in the routing table for the subnet to which
292 1.1 brezak * the interface is connected.
293 1.1 brezak */
294 1.1 brezak start_route_updates();
295 1.1 brezak update_route(v->uv_subnet, v->uv_subnetmask, 0, 0, vifi);
296 1.4 mycroft for (p = v->uv_addrs; p; p = p->pa_next) {
297 1.4 mycroft start_route_updates();
298 1.6 mycroft update_route(p->pa_subnet, p->pa_subnetmask, 0, 0, vifi);
299 1.4 mycroft }
300 1.1 brezak
301 1.1 brezak /*
302 1.1 brezak * Until neighbors are discovered, assume responsibility for sending
303 1.1 brezak * periodic group membership queries to the subnet. Send the first
304 1.1 brezak * query.
305 1.1 brezak */
306 1.1 brezak v->uv_flags |= VIFF_QUERIER;
307 1.4 mycroft send_igmp(src, allhosts_group, IGMP_HOST_MEMBERSHIP_QUERY,
308 1.6 mycroft (v->uv_flags & VIFF_IGMPV1) ? 0 :
309 1.6 mycroft IGMP_MAX_HOST_REPORT_DELAY * IGMP_TIMER_SCALE, 0, 0);
310 1.4 mycroft age_old_hosts();
311 1.1 brezak }
312 1.1 brezak
313 1.4 mycroft v->uv_leaf_timer = LEAF_CONFIRMATION_TIME;
314 1.4 mycroft
315 1.1 brezak /*
316 1.1 brezak * Send a probe via the new vif to look for neighbors.
317 1.1 brezak */
318 1.4 mycroft send_probe_on_vif(v);
319 1.1 brezak }
320 1.1 brezak
321 1.1 brezak /*
322 1.1 brezak * Stop routing on the specified virtual interface.
323 1.1 brezak */
324 1.4 mycroft static void
325 1.4 mycroft stop_vif(vifi)
326 1.1 brezak vifi_t vifi;
327 1.1 brezak {
328 1.1 brezak struct uvif *v;
329 1.1 brezak struct listaddr *a;
330 1.4 mycroft struct phaddr *p;
331 1.1 brezak
332 1.1 brezak v = &uvifs[vifi];
333 1.1 brezak
334 1.1 brezak if (!(v->uv_flags & VIFF_TUNNEL)) {
335 1.1 brezak /*
336 1.1 brezak * Depart from the DVMRP multicast group on the interface.
337 1.1 brezak */
338 1.1 brezak k_leave(dvmrp_group, v->uv_lcl_addr);
339 1.1 brezak
340 1.1 brezak /*
341 1.4 mycroft * Depart from the ALL-ROUTERS multicast group on the interface.
342 1.4 mycroft */
343 1.4 mycroft k_leave(allrtrs_group, v->uv_lcl_addr);
344 1.4 mycroft
345 1.4 mycroft /*
346 1.1 brezak * Update the entry in the routing table for the subnet to which
347 1.1 brezak * the interface is connected, to take into account the interface
348 1.1 brezak * failure.
349 1.1 brezak */
350 1.1 brezak start_route_updates();
351 1.1 brezak update_route(v->uv_subnet, v->uv_subnetmask, UNREACHABLE, 0, vifi);
352 1.4 mycroft for (p = v->uv_addrs; p; p = p->pa_next) {
353 1.4 mycroft start_route_updates();
354 1.6 mycroft update_route(p->pa_subnet, p->pa_subnetmask, UNREACHABLE, 0, vifi);
355 1.4 mycroft }
356 1.1 brezak
357 1.1 brezak /*
358 1.1 brezak * Discard all group addresses. (No need to tell kernel;
359 1.1 brezak * the k_del_vif() call, below, will clean up kernel state.)
360 1.1 brezak */
361 1.1 brezak while (v->uv_groups != NULL) {
362 1.1 brezak a = v->uv_groups;
363 1.1 brezak v->uv_groups = a->al_next;
364 1.1 brezak free((char *)a);
365 1.1 brezak }
366 1.1 brezak
367 1.1 brezak v->uv_flags &= ~VIFF_QUERIER;
368 1.1 brezak }
369 1.1 brezak
370 1.1 brezak /*
371 1.1 brezak * Update the existing route entries to take into account the vif failure.
372 1.1 brezak */
373 1.1 brezak delete_vif_from_routes(vifi);
374 1.1 brezak
375 1.1 brezak /*
376 1.1 brezak * Delete the interface from the kernel's vif structure.
377 1.1 brezak */
378 1.1 brezak k_del_vif(vifi);
379 1.1 brezak
380 1.1 brezak /*
381 1.1 brezak * Discard all neighbor addresses.
382 1.1 brezak */
383 1.4 mycroft if (v->uv_neighbors)
384 1.4 mycroft vifs_with_neighbors--;
385 1.4 mycroft
386 1.1 brezak while (v->uv_neighbors != NULL) {
387 1.1 brezak a = v->uv_neighbors;
388 1.1 brezak v->uv_neighbors = a->al_next;
389 1.1 brezak free((char *)a);
390 1.1 brezak }
391 1.1 brezak }
392 1.1 brezak
393 1.1 brezak
394 1.1 brezak /*
395 1.4 mycroft * stop routing on all vifs
396 1.4 mycroft */
397 1.4 mycroft void
398 1.4 mycroft stop_all_vifs()
399 1.4 mycroft {
400 1.4 mycroft vifi_t vifi;
401 1.4 mycroft struct uvif *v;
402 1.4 mycroft struct listaddr *a;
403 1.4 mycroft struct vif_acl *acl;
404 1.4 mycroft
405 1.4 mycroft for (vifi = 0; vifi < numvifs; vifi++) {
406 1.4 mycroft v = &uvifs[vifi];
407 1.4 mycroft while (v->uv_groups != NULL) {
408 1.4 mycroft a = v->uv_groups;
409 1.4 mycroft v->uv_groups = a->al_next;
410 1.4 mycroft free((char *)a);
411 1.4 mycroft }
412 1.4 mycroft while (v->uv_neighbors != NULL) {
413 1.4 mycroft a = v->uv_neighbors;
414 1.4 mycroft v->uv_neighbors = a->al_next;
415 1.4 mycroft free((char *)a);
416 1.4 mycroft }
417 1.4 mycroft while (v->uv_acl != NULL) {
418 1.4 mycroft acl = v->uv_acl;
419 1.4 mycroft v->uv_acl = acl->acl_next;
420 1.4 mycroft free((char *)acl);
421 1.4 mycroft }
422 1.4 mycroft }
423 1.4 mycroft }
424 1.4 mycroft
425 1.4 mycroft
426 1.4 mycroft /*
427 1.1 brezak * Find the virtual interface from which an incoming packet arrived,
428 1.1 brezak * based on the packet's source and destination IP addresses.
429 1.1 brezak */
430 1.4 mycroft vifi_t
431 1.4 mycroft find_vif(src, dst)
432 1.4 mycroft register u_int32_t src;
433 1.4 mycroft register u_int32_t dst;
434 1.1 brezak {
435 1.1 brezak register vifi_t vifi;
436 1.1 brezak register struct uvif *v;
437 1.4 mycroft register struct phaddr *p;
438 1.1 brezak
439 1.1 brezak for (vifi = 0, v = uvifs; vifi < numvifs; ++vifi, ++v) {
440 1.1 brezak if (!(v->uv_flags & (VIFF_DOWN|VIFF_DISABLED))) {
441 1.1 brezak if (v->uv_flags & VIFF_TUNNEL) {
442 1.1 brezak if (src == v->uv_rmt_addr && dst == v->uv_lcl_addr)
443 1.1 brezak return(vifi);
444 1.1 brezak }
445 1.1 brezak else {
446 1.1 brezak if ((src & v->uv_subnetmask) == v->uv_subnet &&
447 1.6 mycroft ((v->uv_subnetmask == 0xffffffff) ||
448 1.6 mycroft (src != v->uv_subnetbcast)))
449 1.1 brezak return(vifi);
450 1.4 mycroft for (p=v->uv_addrs; p; p=p->pa_next) {
451 1.6 mycroft if ((src & p->pa_subnetmask) == p->pa_subnet &&
452 1.6 mycroft ((p->pa_subnetmask == 0xffffffff) ||
453 1.6 mycroft (src != p->pa_subnetbcast)))
454 1.4 mycroft return(vifi);
455 1.4 mycroft }
456 1.1 brezak }
457 1.1 brezak }
458 1.1 brezak }
459 1.1 brezak return (NO_VIF);
460 1.1 brezak }
461 1.1 brezak
462 1.4 mycroft static void
463 1.4 mycroft age_old_hosts()
464 1.4 mycroft {
465 1.4 mycroft register vifi_t vifi;
466 1.4 mycroft register struct uvif *v;
467 1.4 mycroft register struct listaddr *g;
468 1.6 mycroft
469 1.6 mycroft /*
470 1.6 mycroft * Decrement the old-hosts-present timer for each
471 1.6 mycroft * active group on each vif.
472 1.6 mycroft */
473 1.6 mycroft for (vifi = 0, v = uvifs; vifi < numvifs; vifi++, v++)
474 1.6 mycroft for (g = v->uv_groups; g != NULL; g = g->al_next)
475 1.6 mycroft if (g->al_old)
476 1.6 mycroft g->al_old--;
477 1.4 mycroft }
478 1.4 mycroft
479 1.1 brezak
480 1.1 brezak /*
481 1.1 brezak * Send group membership queries to all subnets for which I am querier.
482 1.1 brezak */
483 1.4 mycroft void
484 1.4 mycroft query_groups()
485 1.1 brezak {
486 1.1 brezak register vifi_t vifi;
487 1.1 brezak register struct uvif *v;
488 1.1 brezak
489 1.1 brezak for (vifi = 0, v = uvifs; vifi < numvifs; vifi++, v++) {
490 1.1 brezak if (v->uv_flags & VIFF_QUERIER) {
491 1.1 brezak send_igmp(v->uv_lcl_addr, allhosts_group,
492 1.4 mycroft IGMP_HOST_MEMBERSHIP_QUERY,
493 1.6 mycroft (v->uv_flags & VIFF_IGMPV1) ? 0 :
494 1.4 mycroft IGMP_MAX_HOST_REPORT_DELAY * IGMP_TIMER_SCALE, 0, 0);
495 1.1 brezak }
496 1.1 brezak }
497 1.4 mycroft age_old_hosts();
498 1.1 brezak }
499 1.1 brezak
500 1.4 mycroft /*
501 1.4 mycroft * Process an incoming host membership query
502 1.4 mycroft */
503 1.4 mycroft void
504 1.4 mycroft accept_membership_query(src, dst, group, tmo)
505 1.4 mycroft u_int32_t src, dst, group;
506 1.4 mycroft int tmo;
507 1.4 mycroft {
508 1.4 mycroft register vifi_t vifi;
509 1.4 mycroft register struct uvif *v;
510 1.4 mycroft
511 1.4 mycroft if ((vifi = find_vif(src, dst)) == NO_VIF ||
512 1.4 mycroft (uvifs[vifi].uv_flags & VIFF_TUNNEL)) {
513 1.4 mycroft log(LOG_INFO, 0,
514 1.4 mycroft "ignoring group membership query from non-adjacent host %s",
515 1.4 mycroft inet_fmt(src, s1));
516 1.4 mycroft return;
517 1.4 mycroft }
518 1.4 mycroft
519 1.4 mycroft v = &uvifs[vifi];
520 1.4 mycroft
521 1.6 mycroft /*
522 1.6 mycroft * If we consider ourselves the querier for this vif, but hear a
523 1.4 mycroft * query from a router with a lower IP address, yield to them.
524 1.4 mycroft *
525 1.4 mycroft * This is done here as well as in the neighbor discovery in case
526 1.4 mycroft * there is a querier that doesn't speak DVMRP.
527 1.6 mycroft *
528 1.6 mycroft * XXX If this neighbor doesn't speak DVMRP, then we need to create
529 1.6 mycroft * some neighbor state for him so that we can time him out!
530 1.4 mycroft */
531 1.4 mycroft if ((v->uv_flags & VIFF_QUERIER) &&
532 1.4 mycroft (ntohl(src) < ntohl(v->uv_lcl_addr))) {
533 1.6 mycroft v->uv_flags &= ~VIFF_QUERIER;
534 1.4 mycroft
535 1.4 mycroft }
536 1.4 mycroft }
537 1.1 brezak
538 1.1 brezak /*
539 1.1 brezak * Process an incoming group membership report.
540 1.1 brezak */
541 1.4 mycroft void
542 1.4 mycroft accept_group_report(src, dst, group, r_type)
543 1.4 mycroft u_int32_t src, dst, group;
544 1.4 mycroft int r_type;
545 1.1 brezak {
546 1.1 brezak register vifi_t vifi;
547 1.1 brezak register struct uvif *v;
548 1.1 brezak register struct listaddr *g;
549 1.1 brezak
550 1.1 brezak if ((vifi = find_vif(src, dst)) == NO_VIF ||
551 1.1 brezak (uvifs[vifi].uv_flags & VIFF_TUNNEL)) {
552 1.1 brezak log(LOG_INFO, 0,
553 1.1 brezak "ignoring group membership report from non-adjacent host %s",
554 1.1 brezak inet_fmt(src, s1));
555 1.1 brezak return;
556 1.1 brezak }
557 1.1 brezak
558 1.1 brezak v = &uvifs[vifi];
559 1.1 brezak
560 1.1 brezak /*
561 1.1 brezak * Look for the group in our group list; if found, reset its timer.
562 1.1 brezak */
563 1.1 brezak for (g = v->uv_groups; g != NULL; g = g->al_next) {
564 1.1 brezak if (group == g->al_addr) {
565 1.6 mycroft if (r_type == IGMP_v1_HOST_MEMBERSHIP_REPORT)
566 1.6 mycroft g->al_old = OLD_AGE_THRESHOLD;
567 1.6 mycroft #ifdef SNMP
568 1.6 mycroft g->al_genid = src;
569 1.6 mycroft #endif /* SNMP */
570 1.4 mycroft
571 1.6 mycroft /** delete old timers, set a timer for expiration **/
572 1.6 mycroft g->al_timer = GROUP_EXPIRE_TIME;
573 1.4 mycroft if (g->al_query)
574 1.4 mycroft g->al_query = DeleteTimer(g->al_query);
575 1.4 mycroft if (g->al_timerid)
576 1.4 mycroft g->al_timerid = DeleteTimer(g->al_timerid);
577 1.4 mycroft g->al_timerid = SetTimer(vifi, g);
578 1.1 brezak break;
579 1.1 brezak }
580 1.1 brezak }
581 1.1 brezak
582 1.1 brezak /*
583 1.4 mycroft * If not found, add it to the list and update kernel cache.
584 1.1 brezak */
585 1.1 brezak if (g == NULL) {
586 1.1 brezak g = (struct listaddr *)malloc(sizeof(struct listaddr));
587 1.1 brezak if (g == NULL)
588 1.1 brezak log(LOG_ERR, 0, "ran out of memory"); /* fatal */
589 1.1 brezak
590 1.1 brezak g->al_addr = group;
591 1.6 mycroft if (r_type == IGMP_v2_HOST_MEMBERSHIP_REPORT)
592 1.4 mycroft g->al_old = 0;
593 1.6 mycroft else
594 1.6 mycroft g->al_old = OLD_AGE_THRESHOLD;
595 1.6 mycroft #ifdef SNMP
596 1.6 mycroft g->al_genid = src;
597 1.6 mycroft #endif
598 1.4 mycroft
599 1.4 mycroft /** set a timer for expiration **/
600 1.4 mycroft g->al_query = 0;
601 1.4 mycroft g->al_timer = GROUP_EXPIRE_TIME;
602 1.4 mycroft time(&g->al_ctime);
603 1.4 mycroft g->al_timerid = SetTimer(vifi, g);
604 1.1 brezak g->al_next = v->uv_groups;
605 1.1 brezak v->uv_groups = g;
606 1.1 brezak
607 1.4 mycroft update_lclgrp(vifi, group);
608 1.4 mycroft }
609 1.4 mycroft
610 1.4 mycroft /*
611 1.4 mycroft * Check if a graft is necessary for this group
612 1.4 mycroft */
613 1.4 mycroft chkgrp_graft(vifi, group);
614 1.4 mycroft }
615 1.4 mycroft
616 1.4 mycroft
617 1.4 mycroft void
618 1.6 mycroft accept_leave_message(src, dst, group)
619 1.4 mycroft u_int32_t src, dst, group;
620 1.4 mycroft {
621 1.4 mycroft register vifi_t vifi;
622 1.4 mycroft register struct uvif *v;
623 1.4 mycroft register struct listaddr *g;
624 1.4 mycroft
625 1.4 mycroft if ((vifi = find_vif(src, dst)) == NO_VIF ||
626 1.4 mycroft (uvifs[vifi].uv_flags & VIFF_TUNNEL)) {
627 1.4 mycroft log(LOG_INFO, 0,
628 1.4 mycroft "ignoring group leave report from non-adjacent host %s",
629 1.4 mycroft inet_fmt(src, s1));
630 1.4 mycroft return;
631 1.4 mycroft }
632 1.4 mycroft
633 1.4 mycroft v = &uvifs[vifi];
634 1.4 mycroft
635 1.6 mycroft if (!(v->uv_flags & VIFF_QUERIER) || (v->uv_flags & VIFF_IGMPV1))
636 1.4 mycroft return;
637 1.4 mycroft
638 1.4 mycroft /*
639 1.4 mycroft * Look for the group in our group list in order to set up a short-timeout
640 1.4 mycroft * query.
641 1.4 mycroft */
642 1.4 mycroft for (g = v->uv_groups; g != NULL; g = g->al_next) {
643 1.4 mycroft if (group == g->al_addr) {
644 1.4 mycroft log(LOG_DEBUG, 0,
645 1.4 mycroft "[vif.c, _accept_leave_message] %d %d \n",
646 1.4 mycroft g->al_old, g->al_query);
647 1.4 mycroft
648 1.4 mycroft /* Ignore the leave message if there are old hosts present */
649 1.4 mycroft if (g->al_old)
650 1.4 mycroft return;
651 1.4 mycroft
652 1.4 mycroft /* still waiting for a reply to a query, ignore the leave */
653 1.4 mycroft if (g->al_query)
654 1.4 mycroft return;
655 1.4 mycroft
656 1.4 mycroft /** delete old timer set a timer for expiration **/
657 1.4 mycroft if (g->al_timerid)
658 1.4 mycroft g->al_timerid = DeleteTimer(g->al_timerid);
659 1.4 mycroft
660 1.4 mycroft /** send a group specific querry **/
661 1.4 mycroft g->al_timer = LEAVE_EXPIRE_TIME;
662 1.4 mycroft send_igmp(v->uv_lcl_addr, g->al_addr,
663 1.4 mycroft IGMP_HOST_MEMBERSHIP_QUERY,
664 1.4 mycroft LEAVE_EXPIRE_TIME / 3 * IGMP_TIMER_SCALE,
665 1.4 mycroft g->al_addr, 0);
666 1.4 mycroft g->al_query = SetQueryTimer(g, vifi, g->al_timer / 3,
667 1.4 mycroft LEAVE_EXPIRE_TIME / 3 * IGMP_TIMER_SCALE);
668 1.4 mycroft g->al_timerid = SetTimer(vifi, g);
669 1.4 mycroft break;
670 1.4 mycroft }
671 1.1 brezak }
672 1.1 brezak }
673 1.1 brezak
674 1.1 brezak
675 1.1 brezak /*
676 1.4 mycroft * Send a periodic probe on all vifs.
677 1.4 mycroft * Useful to determine one-way interfaces.
678 1.4 mycroft * Detect neighbor loss faster.
679 1.1 brezak */
680 1.4 mycroft void
681 1.4 mycroft probe_for_neighbors()
682 1.1 brezak {
683 1.1 brezak register vifi_t vifi;
684 1.1 brezak register struct uvif *v;
685 1.1 brezak
686 1.1 brezak for (vifi = 0, v = uvifs; vifi < numvifs; vifi++, v++) {
687 1.4 mycroft if (!(v->uv_flags & (VIFF_DOWN|VIFF_DISABLED))) {
688 1.4 mycroft send_probe_on_vif(v);
689 1.1 brezak }
690 1.1 brezak }
691 1.1 brezak }
692 1.1 brezak
693 1.1 brezak
694 1.1 brezak /*
695 1.1 brezak * Send a list of all of our neighbors to the requestor, `src'.
696 1.1 brezak */
697 1.4 mycroft void
698 1.4 mycroft accept_neighbor_request(src, dst)
699 1.4 mycroft u_int32_t src, dst;
700 1.1 brezak {
701 1.1 brezak vifi_t vifi;
702 1.1 brezak struct uvif *v;
703 1.1 brezak u_char *p, *ncount;
704 1.1 brezak struct listaddr *la;
705 1.1 brezak int datalen;
706 1.4 mycroft u_int32_t temp_addr, us, them = src;
707 1.1 brezak
708 1.1 brezak /* Determine which of our addresses to use as the source of our response
709 1.1 brezak * to this query.
710 1.1 brezak */
711 1.1 brezak if (IN_MULTICAST(ntohl(dst))) { /* query sent to a multicast group */
712 1.1 brezak int udp; /* find best interface to reply on */
713 1.1 brezak struct sockaddr_in addr;
714 1.1 brezak int addrlen = sizeof(addr);
715 1.1 brezak
716 1.1 brezak addr.sin_family = AF_INET;
717 1.4 mycroft #if (defined(BSD) && (BSD >= 199103))
718 1.4 mycroft addr.sin_len = sizeof addr;
719 1.4 mycroft #endif
720 1.1 brezak addr.sin_addr.s_addr = dst;
721 1.1 brezak addr.sin_port = htons(2000); /* any port over 1024 will do... */
722 1.1 brezak if ((udp = socket(AF_INET, SOCK_DGRAM, 0)) < 0
723 1.1 brezak || connect(udp, (struct sockaddr *) &addr, sizeof(addr)) < 0
724 1.1 brezak || getsockname(udp, (struct sockaddr *) &addr, &addrlen) < 0) {
725 1.1 brezak log(LOG_WARNING, errno, "Determining local address");
726 1.1 brezak close(udp);
727 1.1 brezak return;
728 1.1 brezak }
729 1.1 brezak close(udp);
730 1.1 brezak us = addr.sin_addr.s_addr;
731 1.1 brezak } else /* query sent to us alone */
732 1.1 brezak us = dst;
733 1.1 brezak
734 1.1 brezak #define PUT_ADDR(a) temp_addr = ntohl(a); \
735 1.1 brezak *p++ = temp_addr >> 24; \
736 1.1 brezak *p++ = (temp_addr >> 16) & 0xFF; \
737 1.1 brezak *p++ = (temp_addr >> 8) & 0xFF; \
738 1.1 brezak *p++ = temp_addr & 0xFF;
739 1.1 brezak
740 1.1 brezak p = (u_char *) (send_buf + MIN_IP_HEADER_LEN + IGMP_MINLEN);
741 1.1 brezak datalen = 0;
742 1.1 brezak
743 1.1 brezak for (vifi = 0, v = uvifs; vifi < numvifs; vifi++, v++) {
744 1.1 brezak if (v->uv_flags & VIFF_DISABLED)
745 1.1 brezak continue;
746 1.1 brezak
747 1.1 brezak ncount = 0;
748 1.1 brezak
749 1.1 brezak for (la = v->uv_neighbors; la; la = la->al_next) {
750 1.1 brezak
751 1.1 brezak /* Make sure that there's room for this neighbor... */
752 1.1 brezak if (datalen + (ncount == 0 ? 4 + 3 + 4 : 4) > MAX_DVMRP_DATA_LEN) {
753 1.1 brezak send_igmp(us, them, IGMP_DVMRP, DVMRP_NEIGHBORS,
754 1.1 brezak htonl(MROUTED_LEVEL), datalen);
755 1.1 brezak p = (u_char *) (send_buf + MIN_IP_HEADER_LEN + IGMP_MINLEN);
756 1.1 brezak datalen = 0;
757 1.1 brezak ncount = 0;
758 1.1 brezak }
759 1.1 brezak
760 1.1 brezak /* Put out the header for this neighbor list... */
761 1.1 brezak if (ncount == 0) {
762 1.1 brezak PUT_ADDR(v->uv_lcl_addr);
763 1.1 brezak *p++ = v->uv_metric;
764 1.1 brezak *p++ = v->uv_threshold;
765 1.1 brezak ncount = p;
766 1.1 brezak *p++ = 0;
767 1.1 brezak datalen += 4 + 3;
768 1.1 brezak }
769 1.1 brezak
770 1.1 brezak PUT_ADDR(la->al_addr);
771 1.1 brezak datalen += 4;
772 1.1 brezak (*ncount)++;
773 1.1 brezak }
774 1.1 brezak }
775 1.1 brezak
776 1.1 brezak if (datalen != 0)
777 1.1 brezak send_igmp(us, them, IGMP_DVMRP, DVMRP_NEIGHBORS, htonl(MROUTED_LEVEL),
778 1.1 brezak datalen);
779 1.1 brezak }
780 1.1 brezak
781 1.1 brezak /*
782 1.1 brezak * Send a list of all of our neighbors to the requestor, `src'.
783 1.1 brezak */
784 1.4 mycroft void
785 1.4 mycroft accept_neighbor_request2(src, dst)
786 1.4 mycroft u_int32_t src, dst;
787 1.1 brezak {
788 1.1 brezak vifi_t vifi;
789 1.1 brezak struct uvif *v;
790 1.1 brezak u_char *p, *ncount;
791 1.1 brezak struct listaddr *la;
792 1.1 brezak int datalen;
793 1.4 mycroft u_int32_t us, them = src;
794 1.1 brezak
795 1.1 brezak /* Determine which of our addresses to use as the source of our response
796 1.1 brezak * to this query.
797 1.1 brezak */
798 1.1 brezak if (IN_MULTICAST(ntohl(dst))) { /* query sent to a multicast group */
799 1.1 brezak int udp; /* find best interface to reply on */
800 1.1 brezak struct sockaddr_in addr;
801 1.1 brezak int addrlen = sizeof(addr);
802 1.1 brezak
803 1.1 brezak addr.sin_family = AF_INET;
804 1.4 mycroft #if (defined(BSD) && (BSD >= 199103))
805 1.4 mycroft addr.sin_len = sizeof addr;
806 1.4 mycroft #endif
807 1.1 brezak addr.sin_addr.s_addr = dst;
808 1.1 brezak addr.sin_port = htons(2000); /* any port over 1024 will do... */
809 1.1 brezak if ((udp = socket(AF_INET, SOCK_DGRAM, 0)) < 0
810 1.1 brezak || connect(udp, (struct sockaddr *) &addr, sizeof(addr)) < 0
811 1.1 brezak || getsockname(udp, (struct sockaddr *) &addr, &addrlen) < 0) {
812 1.1 brezak log(LOG_WARNING, errno, "Determining local address");
813 1.1 brezak close(udp);
814 1.1 brezak return;
815 1.1 brezak }
816 1.1 brezak close(udp);
817 1.1 brezak us = addr.sin_addr.s_addr;
818 1.1 brezak } else /* query sent to us alone */
819 1.1 brezak us = dst;
820 1.1 brezak
821 1.1 brezak p = (u_char *) (send_buf + MIN_IP_HEADER_LEN + IGMP_MINLEN);
822 1.1 brezak datalen = 0;
823 1.1 brezak
824 1.1 brezak for (vifi = 0, v = uvifs; vifi < numvifs; vifi++, v++) {
825 1.1 brezak register u_short vflags = v->uv_flags;
826 1.1 brezak register u_char rflags = 0;
827 1.1 brezak if (vflags & VIFF_TUNNEL)
828 1.1 brezak rflags |= DVMRP_NF_TUNNEL;
829 1.3 brezak if (vflags & VIFF_SRCRT)
830 1.3 brezak rflags |= DVMRP_NF_SRCRT;
831 1.1 brezak if (vflags & VIFF_DOWN)
832 1.1 brezak rflags |= DVMRP_NF_DOWN;
833 1.1 brezak if (vflags & VIFF_DISABLED)
834 1.1 brezak rflags |= DVMRP_NF_DISABLED;
835 1.1 brezak if (vflags & VIFF_QUERIER)
836 1.1 brezak rflags |= DVMRP_NF_QUERIER;
837 1.4 mycroft if (vflags & VIFF_LEAF)
838 1.4 mycroft rflags |= DVMRP_NF_LEAF;
839 1.1 brezak ncount = 0;
840 1.1 brezak la = v->uv_neighbors;
841 1.1 brezak if (la == NULL) {
842 1.4 mycroft /*
843 1.4 mycroft * include down & disabled interfaces and interfaces on
844 1.4 mycroft * leaf nets.
845 1.4 mycroft */
846 1.4 mycroft if (rflags & DVMRP_NF_TUNNEL)
847 1.4 mycroft rflags |= DVMRP_NF_DOWN;
848 1.4 mycroft if (datalen > MAX_DVMRP_DATA_LEN - 12) {
849 1.4 mycroft send_igmp(us, them, IGMP_DVMRP, DVMRP_NEIGHBORS2,
850 1.4 mycroft htonl(MROUTED_LEVEL), datalen);
851 1.4 mycroft p = (u_char *) (send_buf + MIN_IP_HEADER_LEN + IGMP_MINLEN);
852 1.4 mycroft datalen = 0;
853 1.4 mycroft }
854 1.4 mycroft *(u_int*)p = v->uv_lcl_addr;
855 1.4 mycroft p += 4;
856 1.4 mycroft *p++ = v->uv_metric;
857 1.4 mycroft *p++ = v->uv_threshold;
858 1.4 mycroft *p++ = rflags;
859 1.4 mycroft *p++ = 1;
860 1.4 mycroft *(u_int*)p = v->uv_rmt_addr;
861 1.4 mycroft p += 4;
862 1.4 mycroft datalen += 12;
863 1.1 brezak } else {
864 1.1 brezak for ( ; la; la = la->al_next) {
865 1.1 brezak /* Make sure that there's room for this neighbor... */
866 1.1 brezak if (datalen + (ncount == 0 ? 4+4+4 : 4) > MAX_DVMRP_DATA_LEN) {
867 1.1 brezak send_igmp(us, them, IGMP_DVMRP, DVMRP_NEIGHBORS2,
868 1.1 brezak htonl(MROUTED_LEVEL), datalen);
869 1.1 brezak p = (u_char *) (send_buf + MIN_IP_HEADER_LEN + IGMP_MINLEN);
870 1.1 brezak datalen = 0;
871 1.1 brezak ncount = 0;
872 1.1 brezak }
873 1.1 brezak /* Put out the header for this neighbor list... */
874 1.1 brezak if (ncount == 0) {
875 1.1 brezak *(u_int*)p = v->uv_lcl_addr;
876 1.1 brezak p += 4;
877 1.1 brezak *p++ = v->uv_metric;
878 1.1 brezak *p++ = v->uv_threshold;
879 1.1 brezak *p++ = rflags;
880 1.1 brezak ncount = p;
881 1.1 brezak *p++ = 0;
882 1.1 brezak datalen += 4 + 4;
883 1.1 brezak }
884 1.1 brezak *(u_int*)p = la->al_addr;
885 1.1 brezak p += 4;
886 1.1 brezak datalen += 4;
887 1.1 brezak (*ncount)++;
888 1.1 brezak }
889 1.1 brezak }
890 1.1 brezak }
891 1.1 brezak if (datalen != 0)
892 1.1 brezak send_igmp(us, them, IGMP_DVMRP, DVMRP_NEIGHBORS2, htonl(MROUTED_LEVEL),
893 1.1 brezak datalen);
894 1.1 brezak }
895 1.1 brezak
896 1.6 mycroft void
897 1.6 mycroft accept_info_request(src, dst, p, datalen)
898 1.6 mycroft u_int32_t src, dst;
899 1.6 mycroft u_char *p;
900 1.6 mycroft int datalen;
901 1.6 mycroft {
902 1.6 mycroft u_char *q;
903 1.6 mycroft int len;
904 1.6 mycroft int outlen = 0;
905 1.6 mycroft
906 1.6 mycroft q = (u_char *) (send_buf + MIN_IP_HEADER_LEN + IGMP_MINLEN);
907 1.6 mycroft
908 1.6 mycroft /* To be general, this must deal properly with breaking up over-sized
909 1.6 mycroft * packets. That implies passing a length to each function, and
910 1.6 mycroft * allowing each function to request to be called again. Right now,
911 1.6 mycroft * we're only implementing the one thing we are positive will fit into
912 1.6 mycroft * a single packet, so we wimp out.
913 1.6 mycroft */
914 1.6 mycroft while (datalen > 0) {
915 1.6 mycroft len = 0;
916 1.6 mycroft switch (*p) {
917 1.6 mycroft case DVMRP_INFO_VERSION:
918 1.6 mycroft len = info_version(q);
919 1.6 mycroft break;
920 1.6 mycroft
921 1.6 mycroft case DVMRP_INFO_NEIGHBORS:
922 1.6 mycroft default:
923 1.6 mycroft log(LOG_INFO, 0, "ignoring unknown info type %d", *p);
924 1.6 mycroft break;
925 1.6 mycroft }
926 1.6 mycroft *(q+1) = len++;
927 1.6 mycroft outlen += len * 4;
928 1.6 mycroft q += len * 4;
929 1.6 mycroft len = (*(p+1) + 1) * 4;
930 1.6 mycroft p += len;
931 1.6 mycroft datalen -= len;
932 1.6 mycroft }
933 1.6 mycroft
934 1.6 mycroft if (outlen != 0)
935 1.6 mycroft send_igmp(INADDR_ANY, src, IGMP_DVMRP, DVMRP_INFO_REPLY,
936 1.6 mycroft htonl(MROUTED_LEVEL), outlen);
937 1.6 mycroft }
938 1.6 mycroft
939 1.6 mycroft /*
940 1.6 mycroft * Information response -- return version string
941 1.6 mycroft */
942 1.6 mycroft static int
943 1.6 mycroft info_version(p)
944 1.6 mycroft char *p;
945 1.6 mycroft {
946 1.6 mycroft int len;
947 1.6 mycroft extern char versionstring[];
948 1.6 mycroft
949 1.6 mycroft *p++ = DVMRP_INFO_VERSION;
950 1.6 mycroft p++; /* skip over length */
951 1.6 mycroft *p++ = 0; /* zero out */
952 1.6 mycroft *p++ = 0; /* reserved fields */
953 1.6 mycroft strcpy(p, versionstring); /* XXX strncpy!!! */
954 1.6 mycroft
955 1.6 mycroft len = strlen(versionstring);
956 1.6 mycroft return ((len + 3) / 4);
957 1.6 mycroft }
958 1.1 brezak
959 1.1 brezak /*
960 1.1 brezak * Process an incoming neighbor-list message.
961 1.1 brezak */
962 1.4 mycroft void
963 1.4 mycroft accept_neighbors(src, dst, p, datalen, level)
964 1.4 mycroft u_int32_t src, dst, level;
965 1.6 mycroft u_char *p;
966 1.1 brezak int datalen;
967 1.1 brezak {
968 1.1 brezak log(LOG_INFO, 0, "ignoring spurious DVMRP neighbor list from %s to %s",
969 1.1 brezak inet_fmt(src, s1), inet_fmt(dst, s2));
970 1.1 brezak }
971 1.1 brezak
972 1.4 mycroft
973 1.1 brezak /*
974 1.1 brezak * Process an incoming neighbor-list message.
975 1.1 brezak */
976 1.4 mycroft void
977 1.4 mycroft accept_neighbors2(src, dst, p, datalen, level)
978 1.4 mycroft u_int32_t src, dst, level;
979 1.6 mycroft u_char *p;
980 1.1 brezak int datalen;
981 1.1 brezak {
982 1.1 brezak log(LOG_INFO, 0, "ignoring spurious DVMRP neighbor list2 from %s to %s",
983 1.1 brezak inet_fmt(src, s1), inet_fmt(dst, s2));
984 1.1 brezak }
985 1.1 brezak
986 1.6 mycroft /*
987 1.6 mycroft * Process an incoming info reply message.
988 1.6 mycroft */
989 1.6 mycroft void
990 1.6 mycroft accept_info_reply(src, dst, p, datalen)
991 1.6 mycroft u_int32_t src, dst;
992 1.6 mycroft u_char *p;
993 1.6 mycroft int datalen;
994 1.6 mycroft {
995 1.6 mycroft log(LOG_INFO, 0, "ignoring spurious DVMRP info reply from %s to %s",
996 1.6 mycroft inet_fmt(src, s1), inet_fmt(dst, s2));
997 1.6 mycroft }
998 1.6 mycroft
999 1.1 brezak
1000 1.1 brezak /*
1001 1.1 brezak * Update the neighbor entry for neighbor 'addr' on vif 'vifi'.
1002 1.1 brezak * 'msgtype' is the type of DVMRP message received from the neighbor.
1003 1.1 brezak * Return TRUE if 'addr' is a valid neighbor, FALSE otherwise.
1004 1.1 brezak */
1005 1.4 mycroft int
1006 1.4 mycroft update_neighbor(vifi, addr, msgtype, p, datalen, level)
1007 1.1 brezak vifi_t vifi;
1008 1.4 mycroft u_int32_t addr;
1009 1.1 brezak int msgtype;
1010 1.4 mycroft char *p;
1011 1.4 mycroft int datalen;
1012 1.4 mycroft u_int32_t level;
1013 1.1 brezak {
1014 1.1 brezak register struct uvif *v;
1015 1.1 brezak register struct listaddr *n;
1016 1.4 mycroft u_int32_t genid = 0;
1017 1.4 mycroft u_int32_t router;
1018 1.6 mycroft u_int32_t send_tables = 0;
1019 1.6 mycroft int do_reset = FALSE;
1020 1.4 mycroft int nflags;
1021 1.1 brezak
1022 1.1 brezak v = &uvifs[vifi];
1023 1.4 mycroft nflags = (level >> 16) & 0xff;
1024 1.1 brezak
1025 1.1 brezak /*
1026 1.1 brezak * Confirm that 'addr' is a valid neighbor address on vif 'vifi'.
1027 1.1 brezak * IT IS ASSUMED that this was preceded by a call to find_vif(), which
1028 1.1 brezak * checks that 'addr' is either a valid remote tunnel endpoint or a
1029 1.1 brezak * non-broadcast address belonging to a directly-connected subnet.
1030 1.1 brezak * Therefore, here we check only that 'addr' is not our own address
1031 1.1 brezak * (due to an impostor or erroneous loopback) or an address of the form
1032 1.1 brezak * {subnet,0} ("the unknown host"). These checks are not performed in
1033 1.1 brezak * find_vif() because those types of address are acceptable for some
1034 1.1 brezak * types of IGMP message (such as group membership reports).
1035 1.1 brezak */
1036 1.1 brezak if (!(v->uv_flags & VIFF_TUNNEL) &&
1037 1.1 brezak (addr == v->uv_lcl_addr ||
1038 1.1 brezak addr == v->uv_subnet )) {
1039 1.1 brezak log(LOG_WARNING, 0,
1040 1.1 brezak "received DVMRP message from 'the unknown host' or self: %s",
1041 1.1 brezak inet_fmt(addr, s1));
1042 1.1 brezak return (FALSE);
1043 1.1 brezak }
1044 1.1 brezak
1045 1.1 brezak /*
1046 1.6 mycroft * Look for addr in list of neighbors.
1047 1.6 mycroft */
1048 1.6 mycroft for (n = v->uv_neighbors; n != NULL; n = n->al_next) {
1049 1.6 mycroft if (addr == n->al_addr) {
1050 1.6 mycroft break;
1051 1.6 mycroft }
1052 1.6 mycroft }
1053 1.6 mycroft
1054 1.6 mycroft /*
1055 1.6 mycroft * Found it. Reset its timer, and check for a version change
1056 1.1 brezak */
1057 1.6 mycroft if (n) {
1058 1.6 mycroft n->al_timer = 0;
1059 1.6 mycroft
1060 1.6 mycroft /*
1061 1.6 mycroft * update the neighbors version and protocol number
1062 1.6 mycroft * if changed => router went down and came up,
1063 1.6 mycroft * so take action immediately.
1064 1.6 mycroft */
1065 1.6 mycroft if ((n->al_pv != (level & 0xff)) ||
1066 1.6 mycroft (n->al_mv != ((level >> 8) & 0xff))) {
1067 1.6 mycroft
1068 1.6 mycroft do_reset = TRUE;
1069 1.6 mycroft log(LOG_DEBUG, 0,
1070 1.6 mycroft "version change neighbor %s [old:%d.%d, new:%d.%d]",
1071 1.6 mycroft inet_fmt(addr, s1),
1072 1.6 mycroft n->al_pv, n->al_mv, level&0xff, (level >> 8) & 0xff);
1073 1.6 mycroft
1074 1.6 mycroft n->al_pv = level & 0xff;
1075 1.6 mycroft n->al_mv = (level >> 8) & 0xff;
1076 1.6 mycroft }
1077 1.6 mycroft } else {
1078 1.6 mycroft /*
1079 1.6 mycroft * If not found, add it to the list. If the neighbor has a lower
1080 1.6 mycroft * IP address than me, yield querier duties to it.
1081 1.6 mycroft */
1082 1.6 mycroft log(LOG_DEBUG, 0, "New neighbor %s on vif %d v%d.%d nf 0x%02x",
1083 1.6 mycroft inet_fmt(addr, s1), vifi, level & 0xff, (level >> 8) & 0xff,
1084 1.6 mycroft (level >> 16) & 0xff);
1085 1.6 mycroft
1086 1.6 mycroft n = (struct listaddr *)malloc(sizeof(struct listaddr));
1087 1.6 mycroft if (n == NULL)
1088 1.6 mycroft log(LOG_ERR, 0, "ran out of memory"); /* fatal */
1089 1.6 mycroft
1090 1.6 mycroft n->al_addr = addr;
1091 1.6 mycroft n->al_pv = level & 0xff;
1092 1.6 mycroft n->al_mv = (level >> 8) & 0xff;
1093 1.6 mycroft n->al_genid = 0;
1094 1.6 mycroft
1095 1.6 mycroft time(&n->al_ctime);
1096 1.6 mycroft n->al_timer = 0;
1097 1.6 mycroft n->al_next = v->uv_neighbors;
1098 1.1 brezak
1099 1.6 mycroft /*
1100 1.6 mycroft * If we thought that we had no neighbors on this vif, send a route
1101 1.6 mycroft * report to the vif. If this is just a new neighbor on the same
1102 1.6 mycroft * vif, send the route report just to the new neighbor.
1103 1.6 mycroft */
1104 1.6 mycroft if (v->uv_neighbors == NULL) {
1105 1.6 mycroft send_tables = (v->uv_flags & VIFF_TUNNEL) ? addr : dvmrp_group;
1106 1.6 mycroft vifs_with_neighbors++;
1107 1.6 mycroft } else {
1108 1.6 mycroft send_tables = addr;
1109 1.6 mycroft }
1110 1.6 mycroft
1111 1.6 mycroft v->uv_neighbors = n;
1112 1.6 mycroft
1113 1.6 mycroft if (!(v->uv_flags & VIFF_TUNNEL) &&
1114 1.6 mycroft ntohl(addr) < ntohl(v->uv_lcl_addr))
1115 1.6 mycroft v->uv_flags &= ~VIFF_QUERIER;
1116 1.6 mycroft }
1117 1.1 brezak
1118 1.1 brezak /*
1119 1.6 mycroft * Check if the router gen-ids are the same.
1120 1.4 mycroft * Need to reset the prune state of the router if not.
1121 1.6 mycroft * Also check for one-way interfaces by seeing if we are in our
1122 1.6 mycroft * neighbor's list of known routers.
1123 1.4 mycroft */
1124 1.4 mycroft if (msgtype == DVMRP_PROBE) {
1125 1.4 mycroft
1126 1.4 mycroft /* Check genid neighbor flag. Also check version number; 3.3 and
1127 1.4 mycroft * 3.4 didn't set this flag. */
1128 1.4 mycroft if ((((level >> 16) & 0xff) & NF_GENID) ||
1129 1.4 mycroft (((level & 0xff) == 3) && (((level >> 8) & 0xff) > 2))) {
1130 1.4 mycroft
1131 1.4 mycroft int i;
1132 1.4 mycroft
1133 1.4 mycroft if (datalen < 4) {
1134 1.4 mycroft log(LOG_WARNING, 0,
1135 1.4 mycroft "received truncated probe message from %s (len %d)",
1136 1.4 mycroft inet_fmt(addr, s1), datalen);
1137 1.4 mycroft return (FALSE);
1138 1.4 mycroft }
1139 1.4 mycroft
1140 1.4 mycroft for (i = 0; i < 4; i++)
1141 1.4 mycroft ((char *)&genid)[i] = *p++;
1142 1.6 mycroft datalen -= 4;
1143 1.6 mycroft
1144 1.6 mycroft if (n->al_genid == 0)
1145 1.6 mycroft n->al_genid = genid;
1146 1.6 mycroft else if (n->al_genid != genid) {
1147 1.6 mycroft log(LOG_DEBUG, 0,
1148 1.6 mycroft "new genid neigbor %s on vif %d [old:%x, new:%x]",
1149 1.6 mycroft inet_fmt(addr, s1), vifi, n->al_genid, genid);
1150 1.6 mycroft
1151 1.6 mycroft n->al_genid = genid;
1152 1.6 mycroft do_reset = TRUE;
1153 1.6 mycroft }
1154 1.4 mycroft
1155 1.4 mycroft /*
1156 1.4 mycroft * loop through router list and check for one-way ifs.
1157 1.4 mycroft */
1158 1.4 mycroft
1159 1.6 mycroft v->uv_flags |= VIFF_ONEWAY;
1160 1.4 mycroft
1161 1.4 mycroft while (datalen > 0) {
1162 1.4 mycroft if (datalen < 4) {
1163 1.4 mycroft log(LOG_WARNING, 0,
1164 1.4 mycroft "received truncated probe message from %s (len %d)",
1165 1.4 mycroft inet_fmt(addr, s1), datalen);
1166 1.4 mycroft return (FALSE);
1167 1.4 mycroft }
1168 1.4 mycroft for (i = 0; i < 4; i++)
1169 1.4 mycroft ((char *)&router)[i] = *p++;
1170 1.4 mycroft datalen -= 4;
1171 1.4 mycroft if (router == v->uv_lcl_addr) {
1172 1.6 mycroft v->uv_flags &= ~VIFF_ONEWAY;
1173 1.4 mycroft break;
1174 1.4 mycroft }
1175 1.4 mycroft }
1176 1.4 mycroft }
1177 1.4 mycroft }
1178 1.6 mycroft if (n->al_flags != nflags) {
1179 1.6 mycroft n->al_flags = nflags;
1180 1.4 mycroft
1181 1.6 mycroft if (n->al_flags & NF_LEAF) {
1182 1.6 mycroft /*XXX If we have non-leaf neighbors then we know we shouldn't
1183 1.6 mycroft * mark this vif as a leaf. For now we just count on other
1184 1.6 mycroft * probes and/or reports resetting the timer. */
1185 1.6 mycroft if (!v->uv_leaf_timer)
1186 1.6 mycroft v->uv_leaf_timer = LEAF_CONFIRMATION_TIME;
1187 1.6 mycroft } else {
1188 1.6 mycroft /* If we get a leaf to non-leaf transition, we *must* update
1189 1.6 mycroft * the routing table. */
1190 1.6 mycroft if (v->uv_flags & VIFF_LEAF && send_tables == 0)
1191 1.6 mycroft send_tables = addr;
1192 1.6 mycroft v->uv_flags &= ~VIFF_LEAF;
1193 1.6 mycroft v->uv_leaf_timer = 0;
1194 1.1 brezak }
1195 1.1 brezak }
1196 1.6 mycroft if (do_reset) {
1197 1.6 mycroft reset_neighbor_state(vifi, addr);
1198 1.6 mycroft if (!send_tables)
1199 1.6 mycroft send_tables = addr;
1200 1.4 mycroft }
1201 1.6 mycroft if (send_tables)
1202 1.6 mycroft report(ALL_ROUTES, vifi, send_tables);
1203 1.4 mycroft
1204 1.1 brezak return (TRUE);
1205 1.1 brezak }
1206 1.1 brezak
1207 1.1 brezak
1208 1.1 brezak /*
1209 1.1 brezak * On every timer interrupt, advance the timer in each neighbor and
1210 1.1 brezak * group entry on every vif.
1211 1.1 brezak */
1212 1.4 mycroft void
1213 1.4 mycroft age_vifs()
1214 1.1 brezak {
1215 1.1 brezak register vifi_t vifi;
1216 1.1 brezak register struct uvif *v;
1217 1.1 brezak register struct listaddr *a, *prev_a, *n;
1218 1.4 mycroft register u_int32_t addr;
1219 1.1 brezak
1220 1.1 brezak for (vifi = 0, v = uvifs; vifi < numvifs; ++vifi, ++v ) {
1221 1.4 mycroft if (v->uv_leaf_timer && (v->uv_leaf_timer -= TIMER_INTERVAL == 0)) {
1222 1.4 mycroft v->uv_flags |= VIFF_LEAF;
1223 1.4 mycroft }
1224 1.1 brezak
1225 1.1 brezak for (prev_a = (struct listaddr *)&(v->uv_neighbors),
1226 1.1 brezak a = v->uv_neighbors;
1227 1.1 brezak a != NULL;
1228 1.1 brezak prev_a = a, a = a->al_next) {
1229 1.1 brezak
1230 1.1 brezak if ((a->al_timer += TIMER_INTERVAL) < NEIGHBOR_EXPIRE_TIME)
1231 1.1 brezak continue;
1232 1.1 brezak
1233 1.1 brezak /*
1234 1.1 brezak * Neighbor has expired; delete it from the neighbor list,
1235 1.1 brezak * delete it from the 'dominants' and 'subordinates arrays of
1236 1.1 brezak * any route entries and assume querier duties unless there is
1237 1.1 brezak * another neighbor with a lower IP address than mine.
1238 1.1 brezak */
1239 1.1 brezak addr = a->al_addr;
1240 1.1 brezak prev_a->al_next = a->al_next;
1241 1.1 brezak free((char *)a);
1242 1.1 brezak a = prev_a;
1243 1.1 brezak
1244 1.1 brezak delete_neighbor_from_routes(addr, vifi);
1245 1.1 brezak
1246 1.4 mycroft if (v->uv_neighbors == NULL)
1247 1.4 mycroft vifs_with_neighbors--;
1248 1.4 mycroft
1249 1.4 mycroft v->uv_leaf_timer = LEAF_CONFIRMATION_TIME;
1250 1.4 mycroft
1251 1.1 brezak if (!(v->uv_flags & VIFF_TUNNEL)) {
1252 1.1 brezak v->uv_flags |= VIFF_QUERIER;
1253 1.1 brezak for (n = v->uv_neighbors; n != NULL; n = n->al_next) {
1254 1.1 brezak if (ntohl(n->al_addr) < ntohl(v->uv_lcl_addr)) {
1255 1.1 brezak v->uv_flags &= ~VIFF_QUERIER;
1256 1.4 mycroft }
1257 1.4 mycroft if (!(n->al_flags & NF_LEAF)) {
1258 1.4 mycroft v->uv_leaf_timer = 0;
1259 1.1 brezak }
1260 1.1 brezak }
1261 1.1 brezak }
1262 1.1 brezak }
1263 1.4 mycroft }
1264 1.4 mycroft }
1265 1.1 brezak
1266 1.4 mycroft /*
1267 1.4 mycroft * Returns the neighbor info struct for a given neighbor
1268 1.4 mycroft */
1269 1.4 mycroft struct listaddr *
1270 1.4 mycroft neighbor_info(vifi, addr)
1271 1.4 mycroft vifi_t vifi;
1272 1.4 mycroft u_int32_t addr;
1273 1.4 mycroft {
1274 1.4 mycroft struct listaddr *u;
1275 1.4 mycroft
1276 1.4 mycroft for (u = uvifs[vifi].uv_neighbors; u; u = u->al_next)
1277 1.4 mycroft if (u->al_addr == addr)
1278 1.4 mycroft return u;
1279 1.1 brezak
1280 1.4 mycroft return NULL;
1281 1.4 mycroft }
1282 1.1 brezak
1283 1.4 mycroft /*
1284 1.1 brezak * Print the contents of the uvifs array on file 'fp'.
1285 1.1 brezak */
1286 1.4 mycroft void
1287 1.4 mycroft dump_vifs(fp)
1288 1.1 brezak FILE *fp;
1289 1.1 brezak {
1290 1.1 brezak register vifi_t vifi;
1291 1.1 brezak register struct uvif *v;
1292 1.1 brezak register struct listaddr *a;
1293 1.4 mycroft register struct phaddr *p;
1294 1.4 mycroft struct sioc_vif_req v_req;
1295 1.4 mycroft
1296 1.4 mycroft fprintf(fp, "vifs_with_neighbors = %d\n", vifs_with_neighbors);
1297 1.4 mycroft
1298 1.4 mycroft if (vifs_with_neighbors == 1)
1299 1.4 mycroft fprintf(fp,"[This host is a leaf]\n\n");
1300 1.1 brezak
1301 1.1 brezak fprintf(fp,
1302 1.1 brezak "\nVirtual Interface Table\n%s",
1303 1.4 mycroft "Vif Name Local-Address ");
1304 1.4 mycroft fprintf(fp,
1305 1.4 mycroft "M Thr Rate Flags\n");
1306 1.1 brezak
1307 1.1 brezak for (vifi = 0, v = uvifs; vifi < numvifs; vifi++, v++) {
1308 1.1 brezak
1309 1.4 mycroft fprintf(fp, "%2u %6s %-15s %6s: %-18s %2u %3u %5u ",
1310 1.1 brezak vifi,
1311 1.4 mycroft v->uv_name,
1312 1.1 brezak inet_fmt(v->uv_lcl_addr, s1),
1313 1.1 brezak (v->uv_flags & VIFF_TUNNEL) ?
1314 1.1 brezak "tunnel":
1315 1.1 brezak "subnet",
1316 1.1 brezak (v->uv_flags & VIFF_TUNNEL) ?
1317 1.1 brezak inet_fmt(v->uv_rmt_addr, s2) :
1318 1.1 brezak inet_fmts(v->uv_subnet, v->uv_subnetmask, s3),
1319 1.1 brezak v->uv_metric,
1320 1.4 mycroft v->uv_threshold,
1321 1.4 mycroft v->uv_rate_limit);
1322 1.1 brezak
1323 1.4 mycroft if (v->uv_flags & VIFF_ONEWAY) fprintf(fp, " one-way");
1324 1.1 brezak if (v->uv_flags & VIFF_DOWN) fprintf(fp, " down");
1325 1.1 brezak if (v->uv_flags & VIFF_DISABLED) fprintf(fp, " disabled");
1326 1.1 brezak if (v->uv_flags & VIFF_QUERIER) fprintf(fp, " querier");
1327 1.3 brezak if (v->uv_flags & VIFF_SRCRT) fprintf(fp, " src-rt");
1328 1.4 mycroft if (v->uv_flags & VIFF_LEAF) fprintf(fp, " leaf");
1329 1.6 mycroft if (v->uv_flags & VIFF_IGMPV1) fprintf(fp, " IGMPv1");
1330 1.1 brezak fprintf(fp, "\n");
1331 1.1 brezak
1332 1.4 mycroft if (v->uv_addrs != NULL) {
1333 1.4 mycroft fprintf(fp, " alternate subnets: %s\n",
1334 1.6 mycroft inet_fmts(v->uv_addrs->pa_subnet, v->uv_addrs->pa_subnetmask, s1));
1335 1.4 mycroft for (p = v->uv_addrs->pa_next; p; p = p->pa_next) {
1336 1.4 mycroft fprintf(fp, " %s\n",
1337 1.6 mycroft inet_fmts(p->pa_subnet, p->pa_subnetmask, s1));
1338 1.4 mycroft }
1339 1.4 mycroft }
1340 1.4 mycroft
1341 1.1 brezak if (v->uv_neighbors != NULL) {
1342 1.4 mycroft fprintf(fp, " peers: %s (%d.%d) (0x%x)\n",
1343 1.4 mycroft inet_fmt(v->uv_neighbors->al_addr, s1),
1344 1.4 mycroft v->uv_neighbors->al_pv, v->uv_neighbors->al_mv,
1345 1.4 mycroft v->uv_neighbors->al_flags);
1346 1.1 brezak for (a = v->uv_neighbors->al_next; a != NULL; a = a->al_next) {
1347 1.4 mycroft fprintf(fp, " %s (%d.%d) (0x%x)\n",
1348 1.4 mycroft inet_fmt(a->al_addr, s1), a->al_pv, a->al_mv,
1349 1.4 mycroft a->al_flags);
1350 1.1 brezak }
1351 1.1 brezak }
1352 1.1 brezak
1353 1.1 brezak if (v->uv_groups != NULL) {
1354 1.4 mycroft fprintf(fp, " groups: %-15s\n",
1355 1.1 brezak inet_fmt(v->uv_groups->al_addr, s1));
1356 1.1 brezak for (a = v->uv_groups->al_next; a != NULL; a = a->al_next) {
1357 1.4 mycroft fprintf(fp, " %-15s\n",
1358 1.1 brezak inet_fmt(a->al_addr, s1));
1359 1.1 brezak }
1360 1.1 brezak }
1361 1.4 mycroft if (v->uv_acl != NULL) {
1362 1.4 mycroft struct vif_acl *acl;
1363 1.4 mycroft
1364 1.4 mycroft fprintf(fp, " boundaries: %-18s\n",
1365 1.4 mycroft inet_fmts(v->uv_acl->acl_addr, v->uv_acl->acl_mask, s1));
1366 1.4 mycroft for (acl = v->uv_acl->acl_next; acl != NULL; acl = acl->acl_next) {
1367 1.4 mycroft fprintf(fp, " : %-18s\n",
1368 1.4 mycroft inet_fmts(acl->acl_addr, acl->acl_mask, s1));
1369 1.4 mycroft }
1370 1.4 mycroft }
1371 1.4 mycroft v_req.vifi = vifi;
1372 1.4 mycroft if (ioctl(udp_socket, SIOCGETVIFCNT, (char *)&v_req) < 0) {
1373 1.4 mycroft log(LOG_WARNING, 0,
1374 1.4 mycroft "SIOCGETVIFCNT fails");
1375 1.4 mycroft }
1376 1.4 mycroft else {
1377 1.6 mycroft fprintf(fp, " pkts in : %ld\n",
1378 1.4 mycroft v_req.icount);
1379 1.6 mycroft fprintf(fp, " pkts out: %ld\n",
1380 1.4 mycroft v_req.ocount);
1381 1.4 mycroft }
1382 1.4 mycroft fprintf(fp, "\n");
1383 1.1 brezak }
1384 1.1 brezak fprintf(fp, "\n");
1385 1.4 mycroft }
1386 1.4 mycroft
1387 1.6 mycroft /*
1388 1.6 mycroft * Time out record of a group membership on a vif
1389 1.6 mycroft */
1390 1.6 mycroft static void
1391 1.6 mycroft DelVif(arg)
1392 1.6 mycroft void *arg;
1393 1.6 mycroft {
1394 1.6 mycroft cbk_t *cbk = (cbk_t *)arg;
1395 1.6 mycroft vifi_t vifi = cbk->vifi;
1396 1.6 mycroft struct uvif *v = &uvifs[vifi];
1397 1.6 mycroft struct listaddr *a, **anp, *g = cbk->g;
1398 1.6 mycroft
1399 1.6 mycroft /*
1400 1.6 mycroft * Group has expired
1401 1.6 mycroft * delete all kernel cache entries with this group
1402 1.6 mycroft */
1403 1.6 mycroft if (g->al_query)
1404 1.6 mycroft DeleteTimer(g->al_query);
1405 1.4 mycroft
1406 1.6 mycroft delete_lclgrp(vifi, g->al_addr);
1407 1.4 mycroft
1408 1.6 mycroft anp = &(v->uv_groups);
1409 1.6 mycroft while ((a = *anp) != NULL) {
1410 1.6 mycroft if (a == g) {
1411 1.6 mycroft *anp = a->al_next;
1412 1.6 mycroft free((char *)a);
1413 1.6 mycroft } else {
1414 1.6 mycroft anp = &a->al_next;
1415 1.6 mycroft }
1416 1.6 mycroft }
1417 1.4 mycroft
1418 1.6 mycroft free(cbk);
1419 1.6 mycroft }
1420 1.4 mycroft
1421 1.6 mycroft /*
1422 1.6 mycroft * Set a timer to delete the record of a group membership on a vif.
1423 1.6 mycroft */
1424 1.6 mycroft static int
1425 1.6 mycroft SetTimer(vifi, g)
1426 1.6 mycroft vifi_t vifi;
1427 1.6 mycroft struct listaddr *g;
1428 1.4 mycroft {
1429 1.6 mycroft cbk_t *cbk;
1430 1.4 mycroft
1431 1.6 mycroft cbk = (cbk_t *) malloc(sizeof(cbk_t));
1432 1.6 mycroft cbk->g = g;
1433 1.6 mycroft cbk->vifi = vifi;
1434 1.6 mycroft return timer_setTimer(g->al_timer, (cfunc_t)DelVif, (void *)cbk);
1435 1.4 mycroft }
1436 1.4 mycroft
1437 1.6 mycroft /*
1438 1.6 mycroft * Delete a timer that was set above.
1439 1.6 mycroft */
1440 1.6 mycroft static int
1441 1.6 mycroft DeleteTimer(id)
1442 1.6 mycroft int id;
1443 1.4 mycroft {
1444 1.6 mycroft timer_clearTimer(id);
1445 1.6 mycroft return 0;
1446 1.4 mycroft }
1447 1.4 mycroft
1448 1.6 mycroft /*
1449 1.6 mycroft * Send a group-specific query.
1450 1.6 mycroft */
1451 1.6 mycroft static void
1452 1.6 mycroft SendQuery(arg)
1453 1.6 mycroft void *arg;
1454 1.4 mycroft {
1455 1.6 mycroft cbk_t *cbk = (cbk_t *)arg;
1456 1.6 mycroft register struct uvif *v = &uvifs[cbk->vifi];
1457 1.6 mycroft
1458 1.6 mycroft send_igmp(v->uv_lcl_addr, cbk->g->al_addr,
1459 1.6 mycroft IGMP_HOST_MEMBERSHIP_QUERY,
1460 1.6 mycroft cbk->q_time, cbk->g->al_addr, 0);
1461 1.6 mycroft cbk->g->al_query = 0;
1462 1.6 mycroft free(cbk);
1463 1.4 mycroft }
1464 1.4 mycroft
1465 1.6 mycroft /*
1466 1.6 mycroft * Set a timer to send a group-specific query.
1467 1.6 mycroft */
1468 1.6 mycroft static int
1469 1.6 mycroft SetQueryTimer(g, vifi, to_expire, q_time)
1470 1.6 mycroft struct listaddr *g;
1471 1.6 mycroft vifi_t vifi;
1472 1.6 mycroft int to_expire, q_time;
1473 1.4 mycroft {
1474 1.6 mycroft cbk_t *cbk;
1475 1.4 mycroft
1476 1.6 mycroft cbk = (cbk_t *) malloc(sizeof(cbk_t));
1477 1.6 mycroft cbk->g = g;
1478 1.6 mycroft cbk->q_time = q_time;
1479 1.6 mycroft cbk->vifi = vifi;
1480 1.6 mycroft return timer_setTimer(to_expire, (cfunc_t)SendQuery, (void *)cbk);
1481 1.1 brezak }
1482