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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 #include <netinet/in_systm.h>
34 #include <netinet/ip.h>
35 #include <netinet/ip_icmp.h>
39 #elif defined(__FreeBSD__)
42 __RCSID("$Revision: 2.27 $");
43 #ident "$Revision: 2.27 $"
46 /* router advertisement ICMP packet */
48 u_int8_t icmp_type; /* type of message */
49 u_int8_t icmp_code; /* type sub code */
50 u_int16_t icmp_cksum; /* ones complement cksum of struct */
51 u_int8_t icmp_ad_num; /* # of following router addresses */
52 u_int8_t icmp_ad_asize; /* 2--words in each advertisement */
53 u_int16_t icmp_ad_life; /* seconds of validity */
60 /* router solicitation ICMP packet */
62 u_int8_t icmp_type; /* type of message */
63 u_int8_t icmp_code; /* type sub code */
64 u_int16_t icmp_cksum; /* ones complement cksum of struct */
75 int rdisc_sock = -1; /* router-discovery raw socket */
76 struct interface *rdisc_sock_mcast; /* current multicast interface */
78 struct timeval rdisc_timer;
79 int rdisc_ok; /* using solicited route */
82 #define MAX_ADS 16 /* at least one per interface */
83 struct dr { /* accumulated advertisements */
84 struct interface *dr_ifp;
85 naddr dr_gate; /* gateway */
86 time_t dr_ts; /* when received */
87 time_t dr_life; /* lifetime in host byte order */
88 n_long dr_recv_pref; /* received but biased preference */
89 n_long dr_pref; /* preference adjusted by metric */
90 } *cur_drp, drs[MAX_ADS];
92 /* convert between signed, balanced around zero,
93 * and unsigned zero-based preferences */
94 #define SIGN_PREF(p) ((p) ^ MIN_PreferenceLevel)
95 #define UNSIGN_PREF(p) SIGN_PREF(p)
96 /* adjust unsigned preference by interface metric,
97 * without driving it to infinity */
98 #define PREF(p, ifp) ((int)(p) <= ((ifp)->int_metric+(ifp)->int_adj_outmetric)\
99 ? ((p) != 0 ? 1 : 0) \
100 : (p) - ((ifp)->int_metric+(ifp)->int_adj_outmetric))
102 static void rdisc_sort(void);
105 /* dump an ICMP Router Discovery Advertisement Message
108 trace_rdisc(const char *act,
111 struct interface *ifp,
119 if (!TRACEPACKETS || ftrace == 0)
124 if (p->icmp.icmp_type == ICMP_ROUTERADVERT) {
125 (void)fprintf(ftrace, "%s Router Ad"
126 " from %s to %s via %s life=%d\n",
127 act, naddr_ntoa(from), naddr_ntoa(to),
128 ifp ? ifp->int_name : "?",
129 ntohs(p->ad.icmp_ad_life));
133 wp = &p->ad.icmp_ad_info[0].icmp_ad_addr;
134 lim = &wp[(len - sizeof(p->ad)) / sizeof(*wp)];
135 for (i = 0; i < p->ad.icmp_ad_num && wp <= lim; i++) {
136 (void)fprintf(ftrace, "\t%s preference=%d",
137 naddr_ntoa(wp[0]), (int)ntohl(wp[1]));
138 wp += p->ad.icmp_ad_asize;
140 (void)fputc('\n',ftrace);
143 trace_act("%s Router Solic. from %s to %s via %s value=%#x",
144 act, naddr_ntoa(from), naddr_ntoa(to),
145 ifp ? ifp->int_name : "?",
146 (int)ntohl(p->so.icmp_so_rsvd));
150 /* prepare Router Discovery socket.
155 if (rdisc_sock < 0) {
156 rdisc_sock = socket(AF_INET, SOCK_RAW, IPPROTO_ICMP);
158 BADERR(1,"rdisc_sock = socket()");
159 fix_sock(rdisc_sock,"rdisc_sock");
165 /* Pick multicast group for router-discovery socket
168 set_rdisc_mg(struct interface *ifp,
169 int on) /* 0=turn it off */
172 struct sockaddr_in *sin;
174 if (rdisc_sock < 0) {
175 /* Create the raw socket so that we can hear at least
176 * broadcast router discovery packets.
178 if ((ifp->int_state & IS_NO_RDISC) == IS_NO_RDISC
184 if (!(ifp->int_if_flags & IFF_MULTICAST)) {
185 ifp->int_state &= ~(IS_ALL_HOSTS | IS_ALL_ROUTERS);
189 memset(&gr, 0, sizeof(gr));
190 gr.gr_interface = ifp->int_index;
191 sin = (struct sockaddr_in *)&gr.gr_group;
192 sin->sin_family = AF_INET;
194 sin->sin_len = sizeof(struct sockaddr_in);
198 || (ifp->int_state & IS_NO_ADV_IN)
200 /* stop listening to advertisements
202 if (ifp->int_state & IS_ALL_HOSTS) {
203 sin->sin_addr.s_addr = htonl(INADDR_ALLHOSTS_GROUP);
204 if (setsockopt(rdisc_sock, IPPROTO_IP,
206 &gr, sizeof(gr)) < 0)
207 LOGERR("MCAST_LEAVE_GROUP ALLHOSTS");
208 ifp->int_state &= ~IS_ALL_HOSTS;
211 } else if (!(ifp->int_state & IS_ALL_HOSTS)) {
212 /* start listening to advertisements
214 sin->sin_addr.s_addr = htonl(INADDR_ALLHOSTS_GROUP);
215 if (setsockopt(rdisc_sock, IPPROTO_IP, MCAST_JOIN_GROUP,
216 &gr, sizeof(gr)) < 0) {
217 LOGERR("MCAST_JOIN_GROUP ALLHOSTS");
219 ifp->int_state |= IS_ALL_HOSTS;
224 || (ifp->int_state & IS_NO_ADV_OUT)
226 /* stop listening to solicitations
228 if (ifp->int_state & IS_ALL_ROUTERS) {
229 sin->sin_addr.s_addr = htonl(INADDR_ALLROUTERS_GROUP);
230 if (setsockopt(rdisc_sock, IPPROTO_IP,
232 &gr, sizeof(gr)) < 0)
233 LOGERR("MCAST_LEAVE_GROUP ALLROUTERS");
234 ifp->int_state &= ~IS_ALL_ROUTERS;
237 } else if (!(ifp->int_state & IS_ALL_ROUTERS)) {
238 /* start hearing solicitations
240 sin->sin_addr.s_addr = htonl(INADDR_ALLROUTERS_GROUP);
241 if (setsockopt(rdisc_sock, IPPROTO_IP, MCAST_JOIN_GROUP,
242 &gr, sizeof(gr)) < 0) {
243 LOGERR("MCAST_JOIN_GROUP ALLROUTERS");
245 ifp->int_state |= IS_ALL_ROUTERS;
251 /* start supplying routes
256 struct interface *ifp;
262 trace_act("start supplying routes");
264 /* Forget discovered routes.
266 for (drp = drs; drp < &drs[MAX_ADS]; drp++) {
267 drp->dr_recv_pref = 0;
275 /* Do not start advertising until we have heard some RIP routes */
276 LIM_SEC(rdisc_timer, now.tv_sec+MIN_WAITTIME);
278 /* Switch router discovery multicast groups from soliciting
281 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
282 if (ifp->int_state & IS_BROKE)
284 ifp->int_rdisc_cnt = 0;
285 ifp->int_rdisc_timer.tv_usec = rdisc_timer.tv_usec;
286 ifp->int_rdisc_timer.tv_sec = now.tv_sec+MIN_WAITTIME;
287 set_rdisc_mg(ifp, 1);
290 /* get rid of any redirects */
295 /* age discovered routes and find the best one
298 rdisc_age(naddr bad_gate)
304 /* If only advertising, then do only that. */
306 /* If switching from client to server, get rid of old
315 /* If we are being told about a bad router,
316 * then age the discovered default route, and if there is
317 * no alternative, solicit a replacement.
320 /* Look for the bad discovered default route.
321 * Age it and note its interface.
323 for (drp = drs; drp < &drs[MAX_ADS]; drp++) {
327 /* When we find the bad router, then age the route
328 * to at most SUPPLY_INTERVAL.
329 * This is contrary to RFC 1256, but defends against
332 if (drp->dr_gate == bad_gate) {
333 sec = (now.tv_sec - drp->dr_life
335 if (drp->dr_ts > sec) {
336 trace_act("age 0.0.0.0 --> %s via %s",
337 naddr_ntoa(drp->dr_gate),
338 drp->dr_ifp->int_name);
349 /* Delete old redirected routes to keep the kernel table small,
350 * and to prevent black holes. Check that the kernel table
351 * matches the daemon table (i.e. has the default route).
352 * But only if RIP is not running and we are not dealing with
353 * a bad gateway, since otherwise age() will be called.
355 if (rip_sock < 0 && bad_gate == 0)
360 /* Zap all routes discovered via an interface that has gone bad
361 * This should only be called when !(ifp->int_state & IS_ALIAS)
364 if_bad_rdisc(struct interface *ifp)
368 for (drp = drs; drp < &drs[MAX_ADS]; drp++) {
369 if (drp->dr_ifp != ifp)
371 drp->dr_recv_pref = 0;
376 /* make a note to re-solicit, turn RIP on or off, etc. */
377 rdisc_timer.tv_sec = 0;
381 /* mark an interface ok for router discovering.
384 if_ok_rdisc(struct interface *ifp)
386 set_rdisc_mg(ifp, 1);
388 ifp->int_rdisc_cnt = 0;
389 ifp->int_rdisc_timer.tv_sec = now.tv_sec + (supplier
391 : MAX_SOLICITATION_DELAY);
392 if (timercmp(&rdisc_timer, &ifp->int_rdisc_timer, >))
393 rdisc_timer = ifp->int_rdisc_timer;
397 /* get rid of a dead discovered router
400 del_rdisc(struct dr *drp)
402 struct interface *ifp;
407 del_redirects(gate = drp->dr_gate, 0);
412 /* Count the other discovered routes on the interface.
416 for (drp = drs; drp < &drs[MAX_ADS]; drp++) {
418 && drp->dr_ifp == ifp)
422 /* If that was the last good discovered router on the interface,
423 * then solicit a new one.
424 * This is contrary to RFC 1256, but defends against black holes.
427 trace_act("discovered router %s via %s"
428 " is bad--have %d remaining",
429 naddr_ntoa(gate), ifp->int_name, i);
430 } else if (ifp->int_rdisc_cnt >= MAX_SOLICITATIONS) {
431 trace_act("last discovered router %s via %s"
432 " is bad--re-solicit",
433 naddr_ntoa(gate), ifp->int_name);
434 ifp->int_rdisc_cnt = 0;
435 ifp->int_rdisc_timer.tv_sec = 0;
438 trace_act("last discovered router %s via %s"
439 " is bad--wait to solicit",
440 naddr_ntoa(gate), ifp->int_name);
445 /* Find the best discovered route,
446 * and discard stale routers.
451 struct dr *drp, *new_drp;
454 struct interface *ifp;
459 /* Find the best discovered route.
462 for (drp = drs; drp < &drs[MAX_ADS]; drp++) {
467 /* Get rid of expired discovered routers.
469 if (drp->dr_ts + drp->dr_life <= now.tv_sec) {
474 LIM_SEC(rdisc_timer, drp->dr_ts+drp->dr_life+1);
476 /* Update preference with possibly changed interface
479 drp->dr_pref = PREF(drp->dr_recv_pref, ifp);
481 /* Prefer the current route to prevent thrashing.
482 * Prefer shorter lifetimes to speed the detection of
484 * Avoid sick interfaces.
487 || (!((new_st ^ drp->dr_ifp->int_state) & IS_SICK)
488 && (new_pref < drp->dr_pref
489 || (new_pref == drp->dr_pref
491 || (new_drp != cur_drp
492 && new_drp->dr_life > drp->dr_life)))))
493 || ((new_st & IS_SICK)
494 && !(drp->dr_ifp->int_state & IS_SICK))) {
496 new_st = drp->dr_ifp->int_state;
497 new_pref = drp->dr_pref;
501 /* switch to a better default route
503 if (new_drp != cur_drp) {
504 rt = rtget(RIP_DEFAULT, 0);
506 /* Stop using discovered routes if they are all bad
509 trace_act("turn off Router Discovery client");
513 && (rt->rt_state & RS_RDISC)) {
514 new = rt->rt_spares[0];
515 new.rts_metric = HOPCNT_INFINITY;
516 new.rts_time = now.tv_sec - GARBAGE_TIME;
517 rtchange(rt, rt->rt_state & ~RS_RDISC,
524 trace_act("turn on Router Discovery client"
526 naddr_ntoa(new_drp->dr_gate),
527 new_drp->dr_ifp->int_name);
531 trace_act("switch Router Discovery from"
532 " %s via %s to %s via %s",
533 naddr_ntoa(cur_drp->dr_gate),
534 cur_drp->dr_ifp->int_name,
535 naddr_ntoa(new_drp->dr_gate),
536 new_drp->dr_ifp->int_name);
539 memset(&new, 0, sizeof(new));
540 new.rts_ifp = new_drp->dr_ifp;
541 new.rts_gate = new_drp->dr_gate;
542 new.rts_router = new_drp->dr_gate;
543 new.rts_metric = HOPCNT_INFINITY-1;
544 new.rts_time = now.tv_sec;
546 rtchange(rt, rt->rt_state | RS_RDISC, &new, 0);
548 rtadd(RIP_DEFAULT, 0, RS_RDISC, &new);
555 /* turn RIP on or off */
556 if (!rdisc_ok || rip_interfaces > 1) {
564 /* handle a single address in an advertisement
569 n_long pref, /* signed and in network order */
570 u_short life, /* in host byte order */
571 struct interface *ifp)
573 static struct msg_limit bad_gate;
574 struct dr *drp, *new_drp;
577 if (gate == RIP_DEFAULT
578 || !check_dst(gate)) {
579 msglim(&bad_gate, from,"router %s advertising bad gateway %s",
585 /* ignore pointers to ourself and routes via unreachable networks
587 if (ifwithaddr(gate, 1, 0) != 0) {
588 trace_pkt(" discard Router Discovery Ad pointing at us");
591 if (!on_net(gate, ifp->int_net, ifp->int_mask)) {
592 trace_pkt(" discard Router Discovery Ad"
593 " toward unreachable net");
597 /* Convert preference to an unsigned value
598 * and later bias it by the metric of the interface.
600 pref = UNSIGN_PREF(ntohl(pref));
602 if (pref == 0 || life < MinMaxAdvertiseInterval) {
607 for (new_drp = 0, drp = drs; drp < &drs[MAX_ADS]; drp++) {
608 /* accept new info for a familiar entry
610 if (drp->dr_gate == gate) {
616 continue; /* do not worry about dead ads */
618 if (drp->dr_ts == 0) {
619 new_drp = drp; /* use unused entry */
621 } else if (new_drp == 0) {
622 /* look for an entry worse than the new one to
625 if ((!(ifp->int_state & IS_SICK)
626 && (drp->dr_ifp->int_state & IS_SICK))
627 || (pref > drp->dr_pref
628 && !((ifp->int_state ^ drp->dr_ifp->int_state)
632 } else if (new_drp->dr_ts != 0) {
633 /* look for the least valuable entry to reuse
635 if ((!(new_drp->dr_ifp->int_state & IS_SICK)
636 && (drp->dr_ifp->int_state & IS_SICK))
637 || (new_drp->dr_pref > drp->dr_pref
638 && !((new_drp->dr_ifp->int_state
639 ^ drp->dr_ifp->int_state)
645 /* forget it if all of the current entries are better */
649 new_drp->dr_ifp = ifp;
650 new_drp->dr_gate = gate;
651 new_drp->dr_ts = now.tv_sec;
652 new_drp->dr_life = life;
653 new_drp->dr_recv_pref = pref;
654 /* bias functional preference by metric of the interface */
655 new_drp->dr_pref = PREF(pref,ifp);
657 /* after hearing a good advertisement, stop asking
659 if (!(ifp->int_state & IS_SICK))
660 ifp->int_rdisc_cnt = MAX_SOLICITATIONS;
664 /* Compute the IP checksum
665 * This assumes the packet is less than 32K long.
672 int nwords = len >> 1;
674 while (nwords-- != 0)
680 /* end-around-carry */
681 sum = (sum >> 16) + (sum & 0xffff);
687 /* Send a router discovery advertisement or solicitation ICMP packet.
690 send_rdisc(union ad_u *p,
692 struct interface *ifp,
693 naddr dst, /* 0 or unicast destination */
694 int type) /* 0=unicast, 1=bcast, 2=mcast */
696 struct sockaddr_in rsin;
701 memset(&rsin, 0, sizeof(rsin));
702 rsin.sin_addr.s_addr = dst;
703 rsin.sin_family = AF_INET;
705 rsin.sin_len = sizeof(rsin);
707 flags = MSG_DONTROUTE;
710 case 0: /* unicast */
715 case 1: /* broadcast */
716 if (ifp->int_if_flags & IFF_POINTOPOINT) {
717 msg = "Send pt-to-pt";
718 rsin.sin_addr.s_addr = ifp->int_dstaddr;
720 msg = "Send broadcast";
721 rsin.sin_addr.s_addr = ifp->int_brdaddr;
725 case 2: /* multicast */
726 msg = "Send multicast";
727 if (ifp->int_state & IS_DUP) {
728 trace_act("abort multicast output via %s"
729 " with duplicate address",
733 if (rdisc_sock_mcast != ifp) {
734 /* select the right interface. */
735 struct ip_mreqn mreqn;
737 memset(&mreqn, 0, sizeof(struct ip_mreqn));
738 mreqn.imr_ifindex = ifp->int_index;
739 if (0 > setsockopt(rdisc_sock,
740 IPPROTO_IP, IP_MULTICAST_IF,
743 LOGERR("setsockopt(rdisc_sock,"
745 rdisc_sock_mcast = 0;
748 rdisc_sock_mcast = ifp;
757 trace_rdisc(msg, ifp->int_addr, rsin.sin_addr.s_addr, ifp,
760 if (0 > sendto(rdisc_sock, p, p_size, flags,
761 (struct sockaddr *)&rsin, sizeof(rsin))) {
762 if (ifp == 0 || !(ifp->int_state & IS_BROKE))
763 msglog("sendto(%s%s%s): %s",
764 ifp != 0 ? ifp->int_name : "",
765 ifp != 0 ? ", " : "",
766 inet_ntoa(rsin.sin_addr),
774 /* Send an advertisement
777 send_adv(struct interface *ifp,
778 naddr dst, /* 0 or unicast destination */
779 int type) /* 0=unicast, 1=bcast, 2=mcast */
785 memset(&u, 0, sizeof(u.ad));
787 u.ad.icmp_type = ICMP_ROUTERADVERT;
788 u.ad.icmp_ad_num = 1;
789 u.ad.icmp_ad_asize = sizeof(u.ad.icmp_ad_info[0])/4;
791 u.ad.icmp_ad_life = stopint ? 0 : htons(ifp->int_rdisc_int*3);
793 /* Convert the configured preference to an unsigned value,
794 * bias it by the interface metric, and then send it as a
795 * signed, network byte order value.
797 pref = UNSIGN_PREF(ifp->int_rdisc_pref);
798 u.ad.icmp_ad_info[0].icmp_ad_pref = htonl(SIGN_PREF(PREF(pref, ifp)));
800 u.ad.icmp_ad_info[0].icmp_ad_addr = ifp->int_addr;
802 u.ad.icmp_cksum = in_cksum((u_short*)&u.ad, sizeof(u.ad));
804 send_rdisc(&u, sizeof(u.ad), ifp, dst, type);
808 /* Advertise for Router Discovery
813 struct interface *ifp;
818 rdisc_timer.tv_sec = now.tv_sec + NEVER;
820 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
821 if (0 != (ifp->int_state & (IS_NO_ADV_OUT | IS_BROKE)))
824 if (!timercmp(&ifp->int_rdisc_timer, &now, >)
826 send_adv(ifp, htonl(INADDR_ALLHOSTS_GROUP),
827 (ifp->int_state&IS_BCAST_RDISC) ? 1 : 2);
828 ifp->int_rdisc_cnt++;
830 intvl_random(&ifp->int_rdisc_timer,
831 (ifp->int_rdisc_int*3)/4,
833 if (ifp->int_rdisc_cnt < MAX_INITIAL_ADVERTS
834 && (ifp->int_rdisc_timer.tv_sec
835 > MAX_INITIAL_ADVERT_INTERVAL)) {
836 ifp->int_rdisc_timer.tv_sec
837 = MAX_INITIAL_ADVERT_INTERVAL;
839 timevaladd(&ifp->int_rdisc_timer, &now);
842 if (timercmp(&rdisc_timer, &ifp->int_rdisc_timer, >))
843 rdisc_timer = ifp->int_rdisc_timer;
848 /* Solicit for Router Discovery
853 struct interface *ifp;
860 rdisc_timer.tv_sec = now.tv_sec + NEVER;
862 for (ifp = ifnet; ifp; ifp = ifp->int_next) {
863 if (0 != (ifp->int_state & (IS_NO_SOL_OUT | IS_BROKE))
864 || ifp->int_rdisc_cnt >= MAX_SOLICITATIONS)
867 if (!timercmp(&ifp->int_rdisc_timer, &now, >)) {
868 memset(&u, 0, sizeof(u.so));
869 u.so.icmp_type = ICMP_ROUTERSOLICIT;
870 u.so.icmp_cksum = in_cksum((u_short*)&u.so,
872 send_rdisc(&u, sizeof(u.so), ifp,
873 htonl(INADDR_ALLROUTERS_GROUP),
874 ((ifp->int_state&IS_BCAST_RDISC) ? 1 : 2));
876 if (++ifp->int_rdisc_cnt >= MAX_SOLICITATIONS)
879 ifp->int_rdisc_timer.tv_sec = SOLICITATION_INTERVAL;
880 ifp->int_rdisc_timer.tv_usec = 0;
881 timevaladd(&ifp->int_rdisc_timer, &now);
884 if (timercmp(&rdisc_timer, &ifp->int_rdisc_timer, >))
885 rdisc_timer = ifp->int_rdisc_timer;
890 /* check the IP header of a possible Router Discovery ICMP packet */
891 static struct interface * /* 0 if bad */
892 ck_icmp(const char *act,
894 struct interface *ifp,
902 if (p->icmp.icmp_type == ICMP_ROUTERADVERT) {
903 type = "advertisement";
904 } else if (p->icmp.icmp_type == ICMP_ROUTERSOLICIT) {
905 type = "solicitation";
910 if (p->icmp.icmp_code != 0) {
911 trace_pkt("unrecognized ICMP Router %s code=%d from %s to %s",
912 type, p->icmp.icmp_code,
913 naddr_ntoa(from), naddr_ntoa(to));
917 trace_rdisc(act, from, to, ifp, p, len);
920 trace_pkt("unknown interface for router-discovery %s"
922 type, naddr_ntoa(from), naddr_ntoa(to));
928 /* read packets from the router discovery socket
933 static struct msg_limit bad_asize, bad_len;
934 #ifdef USE_PASSIFNAME
935 static struct msg_limit bad_name;
937 struct sockaddr_in from;
938 int n, fromlen, cc, hlen;
940 #ifdef USE_PASSIFNAME
941 char ifname[IFNAMSIZ];
951 struct interface *ifp;
955 fromlen = sizeof(from);
956 cc = recvfrom(rdisc_sock, &buf, sizeof(buf), 0,
957 (struct sockaddr*)&from,
960 if (cc < 0 && errno != EWOULDBLOCK)
961 LOGERR("recvfrom(rdisc_sock)");
964 if (fromlen != sizeof(struct sockaddr_in))
965 logbad(1,"impossible recvfrom(rdisc_sock) fromlen=%d",
967 #ifdef USE_PASSIFNAME
968 if ((cc -= sizeof(buf.ifname)) < 0)
969 logbad(0,"missing USE_PASSIFNAME; only %d bytes",
970 cc+sizeof(buf.ifname));
973 hlen = buf.pkt.ip.ip_hl << 2;
974 if (cc < hlen + ICMP_MINLEN)
976 p = (union ad_u *)&buf.pkt.b[hlen];
979 #ifdef USE_PASSIFNAME
980 ifp = ifwithname(buf.ifname, 0);
982 msglim(&bad_name, from.sin_addr.s_addr,
983 "impossible rdisc if_ name %.*s",
984 IFNAMSIZ, buf.ifname);
986 /* If we could tell the interface on which a packet from
987 * address 0 arrived, we could deal with such solicitations.
989 ifp = ((from.sin_addr.s_addr == 0)
990 ? 0 : iflookup(from.sin_addr.s_addr));
992 ifp = ck_icmp("Recv", from.sin_addr.s_addr, ifp,
993 buf.pkt.ip.ip_dst.s_addr, p, cc);
996 if (ifwithaddr(from.sin_addr.s_addr, 0, 0)) {
998 "discard our own Router Discovery message");
1002 switch (p->icmp.icmp_type) {
1003 case ICMP_ROUTERADVERT:
1004 if (p->ad.icmp_ad_asize*4
1005 < (int)sizeof(p->ad.icmp_ad_info[0])) {
1006 msglim(&bad_asize, from.sin_addr.s_addr,
1007 "intolerable rdisc address size=%d",
1008 p->ad.icmp_ad_asize);
1011 if (p->ad.icmp_ad_num == 0) {
1012 trace_pkt(" empty?");
1015 if (cc != (int)(sizeof(p->ad)
1016 - sizeof(p->ad.icmp_ad_info)
1017 + (p->ad.icmp_ad_num
1018 * sizeof(p->ad.icmp_ad_info[0])))) {
1019 msglim(&bad_len, from.sin_addr.s_addr,
1020 "rdisc length %d does not match ad_num"
1021 " %d", cc, p->ad.icmp_ad_num);
1026 if (ifp->int_state & IS_NO_ADV_IN)
1029 wp = &p->ad.icmp_ad_info[0].icmp_ad_addr;
1030 for (n = 0; n < p->ad.icmp_ad_num; n++) {
1031 parse_ad(from.sin_addr.s_addr,
1033 ntohs(p->ad.icmp_ad_life),
1035 wp += p->ad.icmp_ad_asize;
1040 case ICMP_ROUTERSOLICIT:
1043 if (ifp->int_state & IS_NO_ADV_OUT)
1049 * We should handle messages from address 0.
1052 /* Respond with a point-to-point advertisement */
1053 send_adv(ifp, from.sin_addr.s_addr, 0);