231
232static int
233rtentry_zinit(void *mem, int size, int how)
234{
235 struct rtentry *rt = mem;
236
237 rt->rt_pksent = counter_u64_alloc(how);
238 if (rt->rt_pksent == NULL)
239 return (ENOMEM);
240
241 RT_LOCK_INIT(rt);
242
243 return (0);
244}
245
246static void
247rtentry_zfini(void *mem, int size)
248{
249 struct rtentry *rt = mem;
250
251 RT_LOCK_DESTROY(rt);
252 counter_u64_free(rt->rt_pksent);
253}
254
255static int
256rtentry_ctor(void *mem, int size, void *arg, int how)
257{
258 struct rtentry *rt = mem;
259
260 bzero(rt, offsetof(struct rtentry, rt_endzero));
261 counter_u64_zero(rt->rt_pksent);
262 rt->rt_chain = NULL;
263
264 return (0);
265}
266
267static void
268rtentry_dtor(void *mem, int size, void *arg)
269{
270 struct rtentry *rt = mem;
271
272 RT_UNLOCK_COND(rt);
273}
274
275static void
276vnet_route_init(const void *unused __unused)
277{
278 struct domain *dom;
279 struct rib_head **rnh;
280 int table;
281 int fam;
282
283 V_rt_tables = malloc(rt_numfibs * (AF_MAX+1) *
284 sizeof(struct rib_head *), M_RTABLE, M_WAITOK|M_ZERO);
285
286 V_rtzone = uma_zcreate("rtentry", sizeof(struct rtentry),
287 rtentry_ctor, rtentry_dtor,
288 rtentry_zinit, rtentry_zfini, UMA_ALIGN_PTR, 0);
289 for (dom = domains; dom; dom = dom->dom_next) {
290 if (dom->dom_rtattach == NULL)
291 continue;
292
293 for (table = 0; table < rt_numfibs; table++) {
294 fam = dom->dom_family;
295 if (table != 0 && fam != AF_INET6 && fam != AF_INET)
296 break;
297
298 rnh = rt_tables_get_rnh_ptr(table, fam);
299 if (rnh == NULL)
300 panic("%s: rnh NULL", __func__);
301 dom->dom_rtattach((void **)rnh, 0);
302 }
303 }
304}
305VNET_SYSINIT(vnet_route_init, SI_SUB_PROTO_DOMAIN, SI_ORDER_FOURTH,
306 vnet_route_init, 0);
307
308#ifdef VIMAGE
309static void
310vnet_route_uninit(const void *unused __unused)
311{
312 int table;
313 int fam;
314 struct domain *dom;
315 struct rib_head **rnh;
316
317 for (dom = domains; dom; dom = dom->dom_next) {
318 if (dom->dom_rtdetach == NULL)
319 continue;
320
321 for (table = 0; table < rt_numfibs; table++) {
322 fam = dom->dom_family;
323
324 if (table != 0 && fam != AF_INET6 && fam != AF_INET)
325 break;
326
327 rnh = rt_tables_get_rnh_ptr(table, fam);
328 if (rnh == NULL)
329 panic("%s: rnh NULL", __func__);
330 dom->dom_rtdetach((void **)rnh, 0);
331 }
332 }
333
334 free(V_rt_tables, M_RTABLE);
335 uma_zdestroy(V_rtzone);
336}
337VNET_SYSUNINIT(vnet_route_uninit, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST,
338 vnet_route_uninit, 0);
339#endif
340
341struct rib_head *
342rt_table_init(int offset)
343{
344 struct rib_head *rh;
345
346 rh = malloc(sizeof(struct rib_head), M_RTABLE, M_WAITOK | M_ZERO);
347
348 /* TODO: These details should be hidded inside radix.c */
349 /* Init masks tree */
350 rn_inithead_internal(&rh->head, rh->rnh_nodes, offset);
351 rn_inithead_internal(&rh->rmhead.head, rh->rmhead.mask_nodes, 0);
352 rh->head.rnh_masks = &rh->rmhead;
353
354 /* Init locks */
355 rw_init(&rh->rib_lock, "rib head lock");
356
357 /* Finally, set base callbacks */
358 rh->rnh_addaddr = rn_addroute;
359 rh->rnh_deladdr = rn_delete;
360 rh->rnh_matchaddr = rn_match;
361 rh->rnh_lookup = rn_lookup;
362 rh->rnh_walktree = rn_walktree;
363 rh->rnh_walktree_from = rn_walktree_from;
364
365 return (rh);
366}
367
368static int
369rt_freeentry(struct radix_node *rn, void *arg)
370{
371 struct radix_head * const rnh = arg;
372 struct radix_node *x;
373
374 x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);
375 if (x != NULL)
376 R_Free(x);
377 return (0);
378}
379
380void
381rt_table_destroy(struct rib_head *rh)
382{
383
384 rn_walktree(&rh->rmhead.head, rt_freeentry, &rh->rmhead.head);
385
386 /* Assume table is already empty */
387 rw_destroy(&rh->rib_lock);
388 free(rh, M_RTABLE);
389}
390
391
392#ifndef _SYS_SYSPROTO_H_
393struct setfib_args {
394 int fibnum;
395};
396#endif
397int
398sys_setfib(struct thread *td, struct setfib_args *uap)
399{
400 if (uap->fibnum < 0 || uap->fibnum >= rt_numfibs)
401 return EINVAL;
402 td->td_proc->p_fibnum = uap->fibnum;
403 return (0);
404}
405
406/*
407 * Packet routing routines.
408 */
409void
410rtalloc_ign_fib(struct route *ro, u_long ignore, u_int fibnum)
411{
412 struct rtentry *rt;
413
414 if ((rt = ro->ro_rt) != NULL) {
415 if (rt->rt_ifp != NULL && rt->rt_flags & RTF_UP)
416 return;
417 RTFREE(rt);
418 ro->ro_rt = NULL;
419 }
420 ro->ro_rt = rtalloc1_fib(&ro->ro_dst, 1, ignore, fibnum);
421 if (ro->ro_rt)
422 RT_UNLOCK(ro->ro_rt);
423}
424
425/*
426 * Look up the route that matches the address given
427 * Or, at least try.. Create a cloned route if needed.
428 *
429 * The returned route, if any, is locked.
430 */
431struct rtentry *
432rtalloc1(struct sockaddr *dst, int report, u_long ignflags)
433{
434
435 return (rtalloc1_fib(dst, report, ignflags, RT_DEFAULT_FIB));
436}
437
438struct rtentry *
439rtalloc1_fib(struct sockaddr *dst, int report, u_long ignflags,
440 u_int fibnum)
441{
442 struct rib_head *rh;
443 struct radix_node *rn;
444 struct rtentry *newrt;
445 struct rt_addrinfo info;
446 int err = 0, msgtype = RTM_MISS;
447
448 KASSERT((fibnum < rt_numfibs), ("rtalloc1_fib: bad fibnum"));
449 rh = rt_tables_get_rnh(fibnum, dst->sa_family);
450 newrt = NULL;
451 if (rh == NULL)
452 goto miss;
453
454 /*
455 * Look up the address in the table for that Address Family
456 */
457 if ((ignflags & RTF_RNH_LOCKED) == 0)
458 RIB_RLOCK(rh);
459#ifdef INVARIANTS
460 else
461 RIB_LOCK_ASSERT(rh);
462#endif
463 rn = rh->rnh_matchaddr(dst, &rh->head);
464 if (rn && ((rn->rn_flags & RNF_ROOT) == 0)) {
465 newrt = RNTORT(rn);
466 RT_LOCK(newrt);
467 RT_ADDREF(newrt);
468 if ((ignflags & RTF_RNH_LOCKED) == 0)
469 RIB_RUNLOCK(rh);
470 return (newrt);
471
472 } else if ((ignflags & RTF_RNH_LOCKED) == 0)
473 RIB_RUNLOCK(rh);
474 /*
475 * Either we hit the root or could not find any match,
476 * which basically means: "cannot get there from here".
477 */
478miss:
479 V_rtstat.rts_unreach++;
480
481 if (report) {
482 /*
483 * If required, report the failure to the supervising
484 * Authorities.
485 * For a delete, this is not an error. (report == 0)
486 */
487 bzero(&info, sizeof(info));
488 info.rti_info[RTAX_DST] = dst;
489 rt_missmsg_fib(msgtype, &info, 0, err, fibnum);
490 }
491 return (newrt);
492}
493
494/*
495 * Remove a reference count from an rtentry.
496 * If the count gets low enough, take it out of the routing table
497 */
498void
499rtfree(struct rtentry *rt)
500{
501 struct rib_head *rnh;
502
503 KASSERT(rt != NULL,("%s: NULL rt", __func__));
504 rnh = rt_tables_get_rnh(rt->rt_fibnum, rt_key(rt)->sa_family);
505 KASSERT(rnh != NULL,("%s: NULL rnh", __func__));
506
507 RT_LOCK_ASSERT(rt);
508
509 /*
510 * The callers should use RTFREE_LOCKED() or RTFREE(), so
511 * we should come here exactly with the last reference.
512 */
513 RT_REMREF(rt);
514 if (rt->rt_refcnt > 0) {
515 log(LOG_DEBUG, "%s: %p has %d refs\n", __func__, rt, rt->rt_refcnt);
516 goto done;
517 }
518
519 /*
520 * On last reference give the "close method" a chance
521 * to cleanup private state. This also permits (for
522 * IPv4 and IPv6) a chance to decide if the routing table
523 * entry should be purged immediately or at a later time.
524 * When an immediate purge is to happen the close routine
525 * typically calls rtexpunge which clears the RTF_UP flag
526 * on the entry so that the code below reclaims the storage.
527 */
528 if (rt->rt_refcnt == 0 && rnh->rnh_close)
529 rnh->rnh_close((struct radix_node *)rt, &rnh->head);
530
531 /*
532 * If we are no longer "up" (and ref == 0)
533 * then we can free the resources associated
534 * with the route.
535 */
536 if ((rt->rt_flags & RTF_UP) == 0) {
537 if (rt->rt_nodes->rn_flags & (RNF_ACTIVE | RNF_ROOT))
538 panic("rtfree 2");
539 /*
540 * the rtentry must have been removed from the routing table
541 * so it is represented in rttrash.. remove that now.
542 */
543 V_rttrash--;
544#ifdef DIAGNOSTIC
545 if (rt->rt_refcnt < 0) {
546 printf("rtfree: %p not freed (neg refs)\n", rt);
547 goto done;
548 }
549#endif
550 /*
551 * release references on items we hold them on..
552 * e.g other routes and ifaddrs.
553 */
554 if (rt->rt_ifa)
555 ifa_free(rt->rt_ifa);
556 /*
557 * The key is separatly alloc'd so free it (see rt_setgate()).
558 * This also frees the gateway, as they are always malloc'd
559 * together.
560 */
561 R_Free(rt_key(rt));
562
563 /*
564 * and the rtentry itself of course
565 */
566 uma_zfree(V_rtzone, rt);
567 return;
568 }
569done:
570 RT_UNLOCK(rt);
571}
572
573
574/*
575 * Force a routing table entry to the specified
576 * destination to go through the given gateway.
577 * Normally called as a result of a routing redirect
578 * message from the network layer.
579 */
580void
581rtredirect_fib(struct sockaddr *dst,
582 struct sockaddr *gateway,
583 struct sockaddr *netmask,
584 int flags,
585 struct sockaddr *src,
586 u_int fibnum)
587{
588 struct rtentry *rt;
589 int error = 0;
590 short *stat = NULL;
591 struct rt_addrinfo info;
592 struct ifaddr *ifa;
593 struct rib_head *rnh;
594
595 ifa = NULL;
596 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
597 if (rnh == NULL) {
598 error = EAFNOSUPPORT;
599 goto out;
600 }
601
602 /* verify the gateway is directly reachable */
603 if ((ifa = ifa_ifwithnet(gateway, 0, fibnum)) == NULL) {
604 error = ENETUNREACH;
605 goto out;
606 }
607 rt = rtalloc1_fib(dst, 0, 0UL, fibnum); /* NB: rt is locked */
608 /*
609 * If the redirect isn't from our current router for this dst,
610 * it's either old or wrong. If it redirects us to ourselves,
611 * we have a routing loop, perhaps as a result of an interface
612 * going down recently.
613 */
614 if (!(flags & RTF_DONE) && rt) {
615 if (!sa_equal(src, rt->rt_gateway)) {
616 error = EINVAL;
617 goto done;
618 }
619 if (rt->rt_ifa != ifa && ifa->ifa_addr->sa_family != AF_LINK) {
620 error = EINVAL;
621 goto done;
622 }
623 }
624 if ((flags & RTF_GATEWAY) && ifa_ifwithaddr_check(gateway)) {
625 error = EHOSTUNREACH;
626 goto done;
627 }
628 /*
629 * Create a new entry if we just got back a wildcard entry
630 * or the lookup failed. This is necessary for hosts
631 * which use routing redirects generated by smart gateways
632 * to dynamically build the routing tables.
633 */
634 if (rt == NULL || (rt_mask(rt) && rt_mask(rt)->sa_len < 2))
635 goto create;
636 /*
637 * Don't listen to the redirect if it's
638 * for a route to an interface.
639 */
640 if (rt->rt_flags & RTF_GATEWAY) {
641 if (((rt->rt_flags & RTF_HOST) == 0) && (flags & RTF_HOST)) {
642 /*
643 * Changing from route to net => route to host.
644 * Create new route, rather than smashing route to net.
645 */
646 create:
647 if (rt != NULL)
648 RTFREE_LOCKED(rt);
649
650 flags |= RTF_DYNAMIC;
651 bzero((caddr_t)&info, sizeof(info));
652 info.rti_info[RTAX_DST] = dst;
653 info.rti_info[RTAX_GATEWAY] = gateway;
654 info.rti_info[RTAX_NETMASK] = netmask;
655 info.rti_ifa = ifa;
656 info.rti_flags = flags;
657 error = rtrequest1_fib(RTM_ADD, &info, &rt, fibnum);
658 if (rt != NULL) {
659 RT_LOCK(rt);
660 flags = rt->rt_flags;
661 }
662
663 stat = &V_rtstat.rts_dynamic;
664 } else {
665
666 /*
667 * Smash the current notion of the gateway to
668 * this destination. Should check about netmask!!!
669 */
670 if ((flags & RTF_GATEWAY) == 0)
671 rt->rt_flags &= ~RTF_GATEWAY;
672 rt->rt_flags |= RTF_MODIFIED;
673 flags |= RTF_MODIFIED;
674 stat = &V_rtstat.rts_newgateway;
675 /*
676 * add the key and gateway (in one malloc'd chunk).
677 */
678 RT_UNLOCK(rt);
679 RIB_WLOCK(rnh);
680 RT_LOCK(rt);
681 rt_setgate(rt, rt_key(rt), gateway);
682 RIB_WUNLOCK(rnh);
683 }
684 } else
685 error = EHOSTUNREACH;
686done:
687 if (rt)
688 RTFREE_LOCKED(rt);
689out:
690 if (error)
691 V_rtstat.rts_badredirect++;
692 else if (stat != NULL)
693 (*stat)++;
694 bzero((caddr_t)&info, sizeof(info));
695 info.rti_info[RTAX_DST] = dst;
696 info.rti_info[RTAX_GATEWAY] = gateway;
697 info.rti_info[RTAX_NETMASK] = netmask;
698 info.rti_info[RTAX_AUTHOR] = src;
699 rt_missmsg_fib(RTM_REDIRECT, &info, flags, error, fibnum);
700 if (ifa != NULL)
701 ifa_free(ifa);
702}
703
704/*
705 * Routing table ioctl interface.
706 */
707int
708rtioctl_fib(u_long req, caddr_t data, u_int fibnum)
709{
710
711 /*
712 * If more ioctl commands are added here, make sure the proper
713 * super-user checks are being performed because it is possible for
714 * prison-root to make it this far if raw sockets have been enabled
715 * in jails.
716 */
717#ifdef INET
718 /* Multicast goop, grrr... */
719 return mrt_ioctl ? mrt_ioctl(req, data, fibnum) : EOPNOTSUPP;
720#else /* INET */
721 return ENXIO;
722#endif /* INET */
723}
724
725struct ifaddr *
726ifa_ifwithroute(int flags, const struct sockaddr *dst, struct sockaddr *gateway,
727 u_int fibnum)
728{
729 struct ifaddr *ifa;
730 int not_found = 0;
731
732 if ((flags & RTF_GATEWAY) == 0) {
733 /*
734 * If we are adding a route to an interface,
735 * and the interface is a pt to pt link
736 * we should search for the destination
737 * as our clue to the interface. Otherwise
738 * we can use the local address.
739 */
740 ifa = NULL;
741 if (flags & RTF_HOST)
742 ifa = ifa_ifwithdstaddr(dst, fibnum);
743 if (ifa == NULL)
744 ifa = ifa_ifwithaddr(gateway);
745 } else {
746 /*
747 * If we are adding a route to a remote net
748 * or host, the gateway may still be on the
749 * other end of a pt to pt link.
750 */
751 ifa = ifa_ifwithdstaddr(gateway, fibnum);
752 }
753 if (ifa == NULL)
754 ifa = ifa_ifwithnet(gateway, 0, fibnum);
755 if (ifa == NULL) {
756 struct rtentry *rt;
757
758 rt = rtalloc1_fib(gateway, 0, flags, fibnum);
759 if (rt == NULL)
760 return (NULL);
761 /*
762 * dismiss a gateway that is reachable only
763 * through the default router
764 */
765 switch (gateway->sa_family) {
766 case AF_INET:
767 if (satosin(rt_key(rt))->sin_addr.s_addr == INADDR_ANY)
768 not_found = 1;
769 break;
770 case AF_INET6:
771 if (IN6_IS_ADDR_UNSPECIFIED(&satosin6(rt_key(rt))->sin6_addr))
772 not_found = 1;
773 break;
774 default:
775 break;
776 }
777 if (!not_found && rt->rt_ifa != NULL) {
778 ifa = rt->rt_ifa;
779 ifa_ref(ifa);
780 }
781 RT_REMREF(rt);
782 RT_UNLOCK(rt);
783 if (not_found || ifa == NULL)
784 return (NULL);
785 }
786 if (ifa->ifa_addr->sa_family != dst->sa_family) {
787 struct ifaddr *oifa = ifa;
788 ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
789 if (ifa == NULL)
790 ifa = oifa;
791 else
792 ifa_free(oifa);
793 }
794 return (ifa);
795}
796
797/*
798 * Do appropriate manipulations of a routing tree given
799 * all the bits of info needed
800 */
801int
802rtrequest_fib(int req,
803 struct sockaddr *dst,
804 struct sockaddr *gateway,
805 struct sockaddr *netmask,
806 int flags,
807 struct rtentry **ret_nrt,
808 u_int fibnum)
809{
810 struct rt_addrinfo info;
811
812 if (dst->sa_len == 0)
813 return(EINVAL);
814
815 bzero((caddr_t)&info, sizeof(info));
816 info.rti_flags = flags;
817 info.rti_info[RTAX_DST] = dst;
818 info.rti_info[RTAX_GATEWAY] = gateway;
819 info.rti_info[RTAX_NETMASK] = netmask;
820 return rtrequest1_fib(req, &info, ret_nrt, fibnum);
821}
822
823
824/*
825 * Copy most of @rt data into @info.
826 *
827 * If @flags contains NHR_COPY, copies dst,netmask and gw to the
828 * pointers specified by @info structure. Assume such pointers
829 * are zeroed sockaddr-like structures with sa_len field initialized
830 * to reflect size of the provided buffer. if no NHR_COPY is specified,
831 * point dst,netmask and gw @info fields to appropriate @rt values.
832 *
833 * if @flags contains NHR_REF, do refcouting on rt_ifp.
834 *
835 * Returns 0 on success.
836 */
837int
838rt_exportinfo(struct rtentry *rt, struct rt_addrinfo *info, int flags)
839{
840 struct rt_metrics *rmx;
841 struct sockaddr *src, *dst;
842 int sa_len;
843
844 if (flags & NHR_COPY) {
845 /* Copy destination if dst is non-zero */
846 src = rt_key(rt);
847 dst = info->rti_info[RTAX_DST];
848 sa_len = src->sa_len;
849 if (dst != NULL) {
850 if (src->sa_len > dst->sa_len)
851 return (ENOMEM);
852 memcpy(dst, src, src->sa_len);
853 info->rti_addrs |= RTA_DST;
854 }
855
856 /* Copy mask if set && dst is non-zero */
857 src = rt_mask(rt);
858 dst = info->rti_info[RTAX_NETMASK];
859 if (src != NULL && dst != NULL) {
860
861 /*
862 * Radix stores different value in sa_len,
863 * assume rt_mask() to have the same length
864 * as rt_key()
865 */
866 if (sa_len > dst->sa_len)
867 return (ENOMEM);
868 memcpy(dst, src, src->sa_len);
869 info->rti_addrs |= RTA_NETMASK;
870 }
871
872 /* Copy gateway is set && dst is non-zero */
873 src = rt->rt_gateway;
874 dst = info->rti_info[RTAX_GATEWAY];
875 if ((rt->rt_flags & RTF_GATEWAY) && src != NULL && dst != NULL){
876 if (src->sa_len > dst->sa_len)
877 return (ENOMEM);
878 memcpy(dst, src, src->sa_len);
879 info->rti_addrs |= RTA_GATEWAY;
880 }
881 } else {
882 info->rti_info[RTAX_DST] = rt_key(rt);
883 info->rti_addrs |= RTA_DST;
884 if (rt_mask(rt) != NULL) {
885 info->rti_info[RTAX_NETMASK] = rt_mask(rt);
886 info->rti_addrs |= RTA_NETMASK;
887 }
888 if (rt->rt_flags & RTF_GATEWAY) {
889 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
890 info->rti_addrs |= RTA_GATEWAY;
891 }
892 }
893
894 rmx = info->rti_rmx;
895 if (rmx != NULL) {
896 info->rti_mflags |= RTV_MTU;
897 rmx->rmx_mtu = rt->rt_mtu;
898 }
899
900 info->rti_flags = rt->rt_flags;
901 info->rti_ifp = rt->rt_ifp;
902 info->rti_ifa = rt->rt_ifa;
903
904 if (flags & NHR_REF) {
905 /* Do 'traditional' refcouting */
906 if_ref(info->rti_ifp);
907 }
908
909 return (0);
910}
911
912/*
913 * Lookups up route entry for @dst in RIB database for fib @fibnum.
914 * Exports entry data to @info using rt_exportinfo().
915 *
916 * if @flags contains NHR_REF, refcouting is performed on rt_ifp.
917 * All references can be released later by calling rib_free_info()
918 *
919 * Returns 0 on success.
920 * Returns ENOENT for lookup failure, ENOMEM for export failure.
921 */
922int
923rib_lookup_info(uint32_t fibnum, const struct sockaddr *dst, uint32_t flags,
924 uint32_t flowid, struct rt_addrinfo *info)
925{
926 struct rib_head *rh;
927 struct radix_node *rn;
928 struct rtentry *rt;
929 int error;
930
931 KASSERT((fibnum < rt_numfibs), ("rib_lookup_rte: bad fibnum"));
932 rh = rt_tables_get_rnh(fibnum, dst->sa_family);
933 if (rh == NULL)
934 return (ENOENT);
935
936 RIB_RLOCK(rh);
937 rn = rh->rnh_matchaddr(__DECONST(void *, dst), &rh->head);
938 if (rn != NULL && ((rn->rn_flags & RNF_ROOT) == 0)) {
939 rt = RNTORT(rn);
940 /* Ensure route & ifp is UP */
941 if (RT_LINK_IS_UP(rt->rt_ifp)) {
942 flags = (flags & NHR_REF) | NHR_COPY;
943 error = rt_exportinfo(rt, info, flags);
944 RIB_RUNLOCK(rh);
945
946 return (error);
947 }
948 }
949 RIB_RUNLOCK(rh);
950
951 return (ENOENT);
952}
953
954/*
955 * Releases all references acquired by rib_lookup_info() when
956 * called with NHR_REF flags.
957 */
958void
959rib_free_info(struct rt_addrinfo *info)
960{
961
962 if_rele(info->rti_ifp);
963}
964
965/*
966 * Iterates over all existing fibs in system calling
967 * @setwa_f function prior to traversing each fib.
968 * Calls @wa_f function for each element in current fib.
969 * If af is not AF_UNSPEC, iterates over fibs in particular
970 * address family.
971 */
972void
973rt_foreach_fib_walk(int af, rt_setwarg_t *setwa_f, rt_walktree_f_t *wa_f,
974 void *arg)
975{
976 struct rib_head *rnh;
977 uint32_t fibnum;
978 int i;
979
980 for (fibnum = 0; fibnum < rt_numfibs; fibnum++) {
981 /* Do we want some specific family? */
982 if (af != AF_UNSPEC) {
983 rnh = rt_tables_get_rnh(fibnum, af);
984 if (rnh == NULL)
985 continue;
986 if (setwa_f != NULL)
987 setwa_f(rnh, fibnum, af, arg);
988
989 RIB_WLOCK(rnh);
990 rnh->rnh_walktree(&rnh->head, (walktree_f_t *)wa_f,arg);
991 RIB_WUNLOCK(rnh);
992 continue;
993 }
994
995 for (i = 1; i <= AF_MAX; i++) {
996 rnh = rt_tables_get_rnh(fibnum, i);
997 if (rnh == NULL)
998 continue;
999 if (setwa_f != NULL)
1000 setwa_f(rnh, fibnum, i, arg);
1001
1002 RIB_WLOCK(rnh);
1003 rnh->rnh_walktree(&rnh->head, (walktree_f_t *)wa_f,arg);
1004 RIB_WUNLOCK(rnh);
1005 }
1006 }
1007}
1008
1009struct rt_delinfo
1010{
1011 struct rt_addrinfo info;
1012 struct rib_head *rnh;
1013 struct rtentry *head;
1014};
1015
1016/*
1017 * Conditionally unlinks @rn from radix tree based
1018 * on info data passed in @arg.
1019 */
1020static int
1021rt_checkdelroute(struct radix_node *rn, void *arg)
1022{
1023 struct rt_delinfo *di;
1024 struct rt_addrinfo *info;
1025 struct rtentry *rt;
1026 int error;
1027
1028 di = (struct rt_delinfo *)arg;
1029 rt = (struct rtentry *)rn;
1030 info = &di->info;
1031 error = 0;
1032
1033 info->rti_info[RTAX_DST] = rt_key(rt);
1034 info->rti_info[RTAX_NETMASK] = rt_mask(rt);
1035 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1036
1037 rt = rt_unlinkrte(di->rnh, info, &error);
1038 if (rt == NULL) {
1039 /* Either not allowed or not matched. Skip entry */
1040 return (0);
1041 }
1042
1043 /* Entry was unlinked. Add to the list and return */
1044 rt->rt_chain = di->head;
1045 di->head = rt;
1046
1047 return (0);
1048}
1049
1050/*
1051 * Iterates over all existing fibs in system.
1052 * Deletes each element for which @filter_f function returned
1053 * non-zero value.
1054 * If @af is not AF_UNSPEC, iterates over fibs in particular
1055 * address family.
1056 */
1057void
1058rt_foreach_fib_walk_del(int af, rt_filter_f_t *filter_f, void *arg)
1059{
1060 struct rib_head *rnh;
1061 struct rt_delinfo di;
1062 struct rtentry *rt;
1063 uint32_t fibnum;
1064 int i, start, end;
1065
1066 bzero(&di, sizeof(di));
1067 di.info.rti_filter = filter_f;
1068 di.info.rti_filterdata = arg;
1069
1070 for (fibnum = 0; fibnum < rt_numfibs; fibnum++) {
1071 /* Do we want some specific family? */
1072 if (af != AF_UNSPEC) {
1073 start = af;
1074 end = af;
1075 } else {
1076 start = 1;
1077 end = AF_MAX;
1078 }
1079
1080 for (i = start; i <= end; i++) {
1081 rnh = rt_tables_get_rnh(fibnum, i);
1082 if (rnh == NULL)
1083 continue;
1084 di.rnh = rnh;
1085
1086 RIB_WLOCK(rnh);
1087 rnh->rnh_walktree(&rnh->head, rt_checkdelroute, &di);
1088 RIB_WUNLOCK(rnh);
1089
1090 if (di.head == NULL)
1091 continue;
1092
1093 /* We might have something to reclaim */
1094 while (di.head != NULL) {
1095 rt = di.head;
1096 di.head = rt->rt_chain;
1097 rt->rt_chain = NULL;
1098
1099 /* TODO std rt -> rt_addrinfo export */
1100 di.info.rti_info[RTAX_DST] = rt_key(rt);
1101 di.info.rti_info[RTAX_NETMASK] = rt_mask(rt);
1102
1103 rt_notifydelete(rt, &di.info);
1104 RTFREE_LOCKED(rt);
1105 }
1106
1107 }
1108 }
1109}
1110
1111/*
1112 * Delete Routes for a Network Interface
1113 *
1114 * Called for each routing entry via the rnh->rnh_walktree() call above
1115 * to delete all route entries referencing a detaching network interface.
1116 *
1117 * Arguments:
1118 * rt pointer to rtentry
1119 * arg argument passed to rnh->rnh_walktree() - detaching interface
1120 *
1121 * Returns:
1122 * 0 successful
1123 * errno failed - reason indicated
1124 */
1125static int
1126rt_ifdelroute(const struct rtentry *rt, void *arg)
1127{
1128 struct ifnet *ifp = arg;
1129
1130 if (rt->rt_ifp != ifp)
1131 return (0);
1132
1133 /*
1134 * Protect (sorta) against walktree recursion problems
1135 * with cloned routes
1136 */
1137 if ((rt->rt_flags & RTF_UP) == 0)
1138 return (0);
1139
1140 return (1);
1141}
1142
1143/*
1144 * Delete all remaining routes using this interface
1145 * Unfortuneatly the only way to do this is to slog through
1146 * the entire routing table looking for routes which point
1147 * to this interface...oh well...
1148 */
1149void
1150rt_flushifroutes_af(struct ifnet *ifp, int af)
1151{
1152 KASSERT((af >= 1 && af <= AF_MAX), ("%s: af %d not >= 1 and <= %d",
1153 __func__, af, AF_MAX));
1154
1155 rt_foreach_fib_walk_del(af, rt_ifdelroute, ifp);
1156}
1157
1158void
1159rt_flushifroutes(struct ifnet *ifp)
1160{
1161
1162 rt_foreach_fib_walk_del(AF_UNSPEC, rt_ifdelroute, ifp);
1163}
1164
1165/*
1166 * Conditionally unlinks rtentry matching data inside @info from @rnh.
1167 * Returns unlinked, locked and referenced @rtentry on success,
1168 * Returns NULL and sets @perror to:
1169 * ESRCH - if prefix was not found,
1170 * EADDRINUSE - if trying to delete PINNED route without appropriate flag.
1171 * ENOENT - if supplied filter function returned 0 (not matched).
1172 */
1173static struct rtentry *
1174rt_unlinkrte(struct rib_head *rnh, struct rt_addrinfo *info, int *perror)
1175{
1176 struct sockaddr *dst, *netmask;
1177 struct rtentry *rt;
1178 struct radix_node *rn;
1179
1180 dst = info->rti_info[RTAX_DST];
1181 netmask = info->rti_info[RTAX_NETMASK];
1182
1183 rt = (struct rtentry *)rnh->rnh_lookup(dst, netmask, &rnh->head);
1184 if (rt == NULL) {
1185 *perror = ESRCH;
1186 return (NULL);
1187 }
1188
1189 if ((info->rti_flags & RTF_PINNED) == 0) {
1190 /* Check if target route can be deleted */
1191 if (rt->rt_flags & RTF_PINNED) {
1192 *perror = EADDRINUSE;
1193 return (NULL);
1194 }
1195 }
1196
1197 if (info->rti_filter != NULL) {
1198 if (info->rti_filter(rt, info->rti_filterdata) == 0) {
1199 /* Not matched */
1200 *perror = ENOENT;
1201 return (NULL);
1202 }
1203
1204 /*
1205 * Filter function requested rte deletion.
1206 * Ease the caller work by filling in remaining info
1207 * from that particular entry.
1208 */
1209 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1210 }
1211
1212 /*
1213 * Remove the item from the tree and return it.
1214 * Complain if it is not there and do no more processing.
1215 */
1216 *perror = ESRCH;
1217#ifdef RADIX_MPATH
1218 if (rt_mpath_capable(rnh))
1219 rn = rt_mpath_unlink(rnh, info, rt, perror);
1220 else
1221#endif
1222 rn = rnh->rnh_deladdr(dst, netmask, &rnh->head);
1223 if (rn == NULL)
1224 return (NULL);
1225
1226 if (rn->rn_flags & (RNF_ACTIVE | RNF_ROOT))
1227 panic ("rtrequest delete");
1228
1229 rt = RNTORT(rn);
1230 RT_LOCK(rt);
1231 RT_ADDREF(rt);
1232 rt->rt_flags &= ~RTF_UP;
1233
1234 *perror = 0;
1235
1236 return (rt);
1237}
1238
1239static void
1240rt_notifydelete(struct rtentry *rt, struct rt_addrinfo *info)
1241{
1242 struct ifaddr *ifa;
1243
1244 /*
1245 * give the protocol a chance to keep things in sync.
1246 */
1247 ifa = rt->rt_ifa;
1248 if (ifa != NULL && ifa->ifa_rtrequest != NULL)
1249 ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1250
1251 /*
1252 * One more rtentry floating around that is not
1253 * linked to the routing table. rttrash will be decremented
1254 * when RTFREE(rt) is eventually called.
1255 */
1256 V_rttrash++;
1257}
1258
1259
1260/*
1261 * These (questionable) definitions of apparent local variables apply
1262 * to the next two functions. XXXXXX!!!
1263 */
1264#define dst info->rti_info[RTAX_DST]
1265#define gateway info->rti_info[RTAX_GATEWAY]
1266#define netmask info->rti_info[RTAX_NETMASK]
1267#define ifaaddr info->rti_info[RTAX_IFA]
1268#define ifpaddr info->rti_info[RTAX_IFP]
1269#define flags info->rti_flags
1270
1271/*
1272 * Look up rt_addrinfo for a specific fib. Note that if rti_ifa is defined,
1273 * it will be referenced so the caller must free it.
1274 */
1275int
1276rt_getifa_fib(struct rt_addrinfo *info, u_int fibnum)
1277{
1278 struct ifaddr *ifa;
1279 int error = 0;
1280
1281 /*
1282 * ifp may be specified by sockaddr_dl
1283 * when protocol address is ambiguous.
1284 */
1285 if (info->rti_ifp == NULL && ifpaddr != NULL &&
1286 ifpaddr->sa_family == AF_LINK &&
1287 (ifa = ifa_ifwithnet(ifpaddr, 0, fibnum)) != NULL) {
1288 info->rti_ifp = ifa->ifa_ifp;
1289 ifa_free(ifa);
1290 }
1291 if (info->rti_ifa == NULL && ifaaddr != NULL)
1292 info->rti_ifa = ifa_ifwithaddr(ifaaddr);
1293 if (info->rti_ifa == NULL) {
1294 struct sockaddr *sa;
1295
1296 sa = ifaaddr != NULL ? ifaaddr :
1297 (gateway != NULL ? gateway : dst);
1298 if (sa != NULL && info->rti_ifp != NULL)
1299 info->rti_ifa = ifaof_ifpforaddr(sa, info->rti_ifp);
1300 else if (dst != NULL && gateway != NULL)
1301 info->rti_ifa = ifa_ifwithroute(flags, dst, gateway,
1302 fibnum);
1303 else if (sa != NULL)
1304 info->rti_ifa = ifa_ifwithroute(flags, sa, sa,
1305 fibnum);
1306 }
1307 if ((ifa = info->rti_ifa) != NULL) {
1308 if (info->rti_ifp == NULL)
1309 info->rti_ifp = ifa->ifa_ifp;
1310 } else
1311 error = ENETUNREACH;
1312 return (error);
1313}
1314
1315static int
1316if_updatemtu_cb(struct radix_node *rn, void *arg)
1317{
1318 struct rtentry *rt;
1319 struct if_mtuinfo *ifmtu;
1320
1321 rt = (struct rtentry *)rn;
1322 ifmtu = (struct if_mtuinfo *)arg;
1323
1324 if (rt->rt_ifp != ifmtu->ifp)
1325 return (0);
1326
1327 if (rt->rt_mtu >= ifmtu->mtu) {
1328 /* We have to decrease mtu regardless of flags */
1329 rt->rt_mtu = ifmtu->mtu;
1330 return (0);
1331 }
1332
1333 /*
1334 * New MTU is bigger. Check if are allowed to alter it
1335 */
1336 if ((rt->rt_flags & (RTF_FIXEDMTU | RTF_GATEWAY | RTF_HOST)) != 0) {
1337
1338 /*
1339 * Skip routes with user-supplied MTU and
1340 * non-interface routes
1341 */
1342 return (0);
1343 }
1344
1345 /* We are safe to update route MTU */
1346 rt->rt_mtu = ifmtu->mtu;
1347
1348 return (0);
1349}
1350
1351void
1352rt_updatemtu(struct ifnet *ifp)
1353{
1354 struct if_mtuinfo ifmtu;
1355 struct rib_head *rnh;
1356 int i, j;
1357
1358 ifmtu.ifp = ifp;
1359
1360 /*
1361 * Try to update rt_mtu for all routes using this interface
1362 * Unfortunately the only way to do this is to traverse all
1363 * routing tables in all fibs/domains.
1364 */
1365 for (i = 1; i <= AF_MAX; i++) {
1366 ifmtu.mtu = if_getmtu_family(ifp, i);
1367 for (j = 0; j < rt_numfibs; j++) {
1368 rnh = rt_tables_get_rnh(j, i);
1369 if (rnh == NULL)
1370 continue;
1371 RIB_WLOCK(rnh);
1372 rnh->rnh_walktree(&rnh->head, if_updatemtu_cb, &ifmtu);
1373 RIB_WUNLOCK(rnh);
1374 }
1375 }
1376}
1377
1378
1379#if 0
1380int p_sockaddr(char *buf, int buflen, struct sockaddr *s);
1381int rt_print(char *buf, int buflen, struct rtentry *rt);
1382
1383int
1384p_sockaddr(char *buf, int buflen, struct sockaddr *s)
1385{
1386 void *paddr = NULL;
1387
1388 switch (s->sa_family) {
1389 case AF_INET:
1390 paddr = &((struct sockaddr_in *)s)->sin_addr;
1391 break;
1392 case AF_INET6:
1393 paddr = &((struct sockaddr_in6 *)s)->sin6_addr;
1394 break;
1395 }
1396
1397 if (paddr == NULL)
1398 return (0);
1399
1400 if (inet_ntop(s->sa_family, paddr, buf, buflen) == NULL)
1401 return (0);
1402
1403 return (strlen(buf));
1404}
1405
1406int
1407rt_print(char *buf, int buflen, struct rtentry *rt)
1408{
1409 struct sockaddr *addr, *mask;
1410 int i = 0;
1411
1412 addr = rt_key(rt);
1413 mask = rt_mask(rt);
1414
1415 i = p_sockaddr(buf, buflen, addr);
1416 if (!(rt->rt_flags & RTF_HOST)) {
1417 buf[i++] = '/';
1418 i += p_sockaddr(buf + i, buflen - i, mask);
1419 }
1420
1421 if (rt->rt_flags & RTF_GATEWAY) {
1422 buf[i++] = '>';
1423 i += p_sockaddr(buf + i, buflen - i, rt->rt_gateway);
1424 }
1425
1426 return (i);
1427}
1428#endif
1429
1430#ifdef RADIX_MPATH
1431/*
1432 * Deletes key for single-path routes, unlinks rtentry with
1433 * gateway specified in @info from multi-path routes.
1434 *
1435 * Returnes unlinked entry. In case of failure, returns NULL
1436 * and sets @perror to ESRCH.
1437 */
1438static struct radix_node *
1439rt_mpath_unlink(struct rib_head *rnh, struct rt_addrinfo *info,
1440 struct rtentry *rto, int *perror)
1441{
1442 /*
1443 * if we got multipath routes, we require users to specify
1444 * a matching RTAX_GATEWAY.
1445 */
1446 struct rtentry *rt; // *rto = NULL;
1447 struct radix_node *rn;
1448 struct sockaddr *gw;
1449
1450 gw = info->rti_info[RTAX_GATEWAY];
1451 rt = rt_mpath_matchgate(rto, gw);
1452 if (rt == NULL) {
1453 *perror = ESRCH;
1454 return (NULL);
1455 }
1456
1457 /*
1458 * this is the first entry in the chain
1459 */
1460 if (rto == rt) {
1461 rn = rn_mpath_next((struct radix_node *)rt);
1462 /*
1463 * there is another entry, now it's active
1464 */
1465 if (rn) {
1466 rto = RNTORT(rn);
1467 RT_LOCK(rto);
1468 rto->rt_flags |= RTF_UP;
1469 RT_UNLOCK(rto);
1470 } else if (rt->rt_flags & RTF_GATEWAY) {
1471 /*
1472 * For gateway routes, we need to
1473 * make sure that we we are deleting
1474 * the correct gateway.
1475 * rt_mpath_matchgate() does not
1476 * check the case when there is only
1477 * one route in the chain.
1478 */
1479 if (gw &&
1480 (rt->rt_gateway->sa_len != gw->sa_len ||
1481 memcmp(rt->rt_gateway, gw, gw->sa_len))) {
1482 *perror = ESRCH;
1483 return (NULL);
1484 }
1485 }
1486
1487 /*
1488 * use the normal delete code to remove
1489 * the first entry
1490 */
1491 rn = rnh->rnh_deladdr(dst, netmask, &rnh->head);
1492 *perror = 0;
1493 return (rn);
1494 }
1495
1496 /*
1497 * if the entry is 2nd and on up
1498 */
1499 if (rt_mpath_deldup(rto, rt) == 0)
1500 panic ("rtrequest1: rt_mpath_deldup");
1501 *perror = 0;
1502 rn = (struct radix_node *)rt;
1503 return (rn);
1504}
1505#endif
1506
1507#ifdef FLOWTABLE
1508static struct rtentry *
1509rt_flowtable_check_route(struct rib_head *rnh, struct rt_addrinfo *info)
1510{
1511#if defined(INET6) || defined(INET)
1512 struct radix_node *rn;
1513#endif
1514 struct rtentry *rt0;
1515
1516 rt0 = NULL;
1517 /* "flow-table" only supports IPv6 and IPv4 at the moment. */
1518 switch (dst->sa_family) {
1519#ifdef INET6
1520 case AF_INET6:
1521#endif
1522#ifdef INET
1523 case AF_INET:
1524#endif
1525#if defined(INET6) || defined(INET)
1526 rn = rnh->rnh_matchaddr(dst, &rnh->head);
1527 if (rn && ((rn->rn_flags & RNF_ROOT) == 0)) {
1528 struct sockaddr *mask;
1529 u_char *m, *n;
1530 int len;
1531
1532 /*
1533 * compare mask to see if the new route is
1534 * more specific than the existing one
1535 */
1536 rt0 = RNTORT(rn);
1537 RT_LOCK(rt0);
1538 RT_ADDREF(rt0);
1539 RT_UNLOCK(rt0);
1540 /*
1541 * A host route is already present, so
1542 * leave the flow-table entries as is.
1543 */
1544 if (rt0->rt_flags & RTF_HOST) {
1545 RTFREE(rt0);
1546 rt0 = NULL;
1547 } else if (!(flags & RTF_HOST) && netmask) {
1548 mask = rt_mask(rt0);
1549 len = mask->sa_len;
1550 m = (u_char *)mask;
1551 n = (u_char *)netmask;
1552 while (len-- > 0) {
1553 if (*n != *m)
1554 break;
1555 n++;
1556 m++;
1557 }
1558 if (len == 0 || (*n < *m)) {
1559 RTFREE(rt0);
1560 rt0 = NULL;
1561 }
1562 }
1563 }
1564#endif/* INET6 || INET */
1565 }
1566
1567 return (rt0);
1568}
1569#endif
1570
1571int
1572rtrequest1_fib(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt,
1573 u_int fibnum)
1574{
1575 int error = 0;
1576 struct rtentry *rt, *rt_old;
1577#ifdef FLOWTABLE
1578 struct rtentry *rt0;
1579#endif
1580 struct radix_node *rn;
1581 struct rib_head *rnh;
1582 struct ifaddr *ifa;
1583 struct sockaddr *ndst;
1584 struct sockaddr_storage mdst;
1585
1586 KASSERT((fibnum < rt_numfibs), ("rtrequest1_fib: bad fibnum"));
1587 KASSERT((flags & RTF_RNH_LOCKED) == 0, ("rtrequest1_fib: locked"));
1588 switch (dst->sa_family) {
1589 case AF_INET6:
1590 case AF_INET:
1591 /* We support multiple FIBs. */
1592 break;
1593 default:
1594 fibnum = RT_DEFAULT_FIB;
1595 break;
1596 }
1597
1598 /*
1599 * Find the correct routing tree to use for this Address Family
1600 */
1601 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
1602 if (rnh == NULL)
1603 return (EAFNOSUPPORT);
1604
1605 /*
1606 * If we are adding a host route then we don't want to put
1607 * a netmask in the tree, nor do we want to clone it.
1608 */
1609 if (flags & RTF_HOST)
1610 netmask = NULL;
1611
1612 switch (req) {
1613 case RTM_DELETE:
1614 if (netmask) {
1615 if (dst->sa_len > sizeof(mdst))
1616 return (EINVAL);
1617 rt_maskedcopy(dst, (struct sockaddr *)&mdst, netmask);
1618 dst = (struct sockaddr *)&mdst;
1619 }
1620
1621 RIB_WLOCK(rnh);
1622 rt = rt_unlinkrte(rnh, info, &error);
1623 RIB_WUNLOCK(rnh);
1624 if (error != 0)
1625 return (error);
1626
1627 rt_notifydelete(rt, info);
1628
1629 /*
1630 * If the caller wants it, then it can have it,
1631 * but it's up to it to free the rtentry as we won't be
1632 * doing it.
1633 */
1634 if (ret_nrt) {
1635 *ret_nrt = rt;
1636 RT_UNLOCK(rt);
1637 } else
1638 RTFREE_LOCKED(rt);
1639 break;
1640 case RTM_RESOLVE:
1641 /*
1642 * resolve was only used for route cloning
1643 * here for compat
1644 */
1645 break;
1646 case RTM_ADD:
1647 if ((flags & RTF_GATEWAY) && !gateway)
1648 return (EINVAL);
1649 if (dst && gateway && (dst->sa_family != gateway->sa_family) &&
1650 (gateway->sa_family != AF_UNSPEC) && (gateway->sa_family != AF_LINK))
1651 return (EINVAL);
1652
1653 if (info->rti_ifa == NULL) {
1654 error = rt_getifa_fib(info, fibnum);
1655 if (error)
1656 return (error);
1657 } else
1658 ifa_ref(info->rti_ifa);
1659 ifa = info->rti_ifa;
1660 rt = uma_zalloc(V_rtzone, M_NOWAIT);
1661 if (rt == NULL) {
1662 ifa_free(ifa);
1663 return (ENOBUFS);
1664 }
1665 rt->rt_flags = RTF_UP | flags;
1666 rt->rt_fibnum = fibnum;
1667 /*
1668 * Add the gateway. Possibly re-malloc-ing the storage for it.
1669 */
1670 if ((error = rt_setgate(rt, dst, gateway)) != 0) {
1671 ifa_free(ifa);
1672 uma_zfree(V_rtzone, rt);
1673 return (error);
1674 }
1675
1676 /*
1677 * point to the (possibly newly malloc'd) dest address.
1678 */
1679 ndst = (struct sockaddr *)rt_key(rt);
1680
1681 /*
1682 * make sure it contains the value we want (masked if needed).
1683 */
1684 if (netmask) {
1685 rt_maskedcopy(dst, ndst, netmask);
1686 } else
1687 bcopy(dst, ndst, dst->sa_len);
1688
1689 /*
1690 * We use the ifa reference returned by rt_getifa_fib().
1691 * This moved from below so that rnh->rnh_addaddr() can
1692 * examine the ifa and ifa->ifa_ifp if it so desires.
1693 */
1694 rt->rt_ifa = ifa;
1695 rt->rt_ifp = ifa->ifa_ifp;
1696 rt->rt_weight = 1;
1697
1698 rt_setmetrics(info, rt);
1699
1700 RIB_WLOCK(rnh);
1701 RT_LOCK(rt);
1702#ifdef RADIX_MPATH
1703 /* do not permit exactly the same dst/mask/gw pair */
1704 if (rt_mpath_capable(rnh) &&
1705 rt_mpath_conflict(rnh, rt, netmask)) {
1706 RIB_WUNLOCK(rnh);
1707
1708 ifa_free(rt->rt_ifa);
1709 R_Free(rt_key(rt));
1710 uma_zfree(V_rtzone, rt);
1711 return (EEXIST);
1712 }
1713#endif
1714
1715#ifdef FLOWTABLE
1716 rt0 = rt_flowtable_check_route(rnh, info);
1717#endif /* FLOWTABLE */
1718
1719 /* XXX mtu manipulation will be done in rnh_addaddr -- itojun */
1720 rn = rnh->rnh_addaddr(ndst, netmask, &rnh->head, rt->rt_nodes);
1721
1722 rt_old = NULL;
1723 if (rn == NULL && (info->rti_flags & RTF_PINNED) != 0) {
1724
1725 /*
1726 * Force removal and re-try addition
1727 * TODO: better multipath&pinned support
1728 */
1729 struct sockaddr *info_dst = info->rti_info[RTAX_DST];
1730 info->rti_info[RTAX_DST] = ndst;
1731 /* Do not delete existing PINNED(interface) routes */
1732 info->rti_flags &= ~RTF_PINNED;
1733 rt_old = rt_unlinkrte(rnh, info, &error);
1734 info->rti_flags |= RTF_PINNED;
1735 info->rti_info[RTAX_DST] = info_dst;
1736 if (rt_old != NULL)
1737 rn = rnh->rnh_addaddr(ndst, netmask, &rnh->head,
1738 rt->rt_nodes);
1739 }
1740 RIB_WUNLOCK(rnh);
1741
1742 if (rt_old != NULL)
1743 RT_UNLOCK(rt_old);
1744
1745 /*
1746 * If it still failed to go into the tree,
1747 * then un-make it (this should be a function)
1748 */
1749 if (rn == NULL) {
1750 ifa_free(rt->rt_ifa);
1751 R_Free(rt_key(rt));
1752 uma_zfree(V_rtzone, rt);
1753#ifdef FLOWTABLE
1754 if (rt0 != NULL)
1755 RTFREE(rt0);
1756#endif
1757 return (EEXIST);
1758 }
1759#ifdef FLOWTABLE
1760 else if (rt0 != NULL) {
1761 flowtable_route_flush(dst->sa_family, rt0);
1762 RTFREE(rt0);
1763 }
1764#endif
1765
1766 if (rt_old != NULL) {
1767 rt_notifydelete(rt_old, info);
1768 RTFREE(rt_old);
1769 }
1770
1771 /*
1772 * If this protocol has something to add to this then
1773 * allow it to do that as well.
1774 */
1775 if (ifa->ifa_rtrequest)
1776 ifa->ifa_rtrequest(req, rt, info);
1777
1778 /*
1779 * actually return a resultant rtentry and
1780 * give the caller a single reference.
1781 */
1782 if (ret_nrt) {
1783 *ret_nrt = rt;
1784 RT_ADDREF(rt);
1785 }
1786 rnh->rnh_gen++; /* Routing table updated */
1787 RT_UNLOCK(rt);
1788 break;
1789 case RTM_CHANGE:
1790 RIB_WLOCK(rnh);
1791 error = rtrequest1_fib_change(rnh, info, ret_nrt, fibnum);
1792 RIB_WUNLOCK(rnh);
1793 break;
1794 default:
1795 error = EOPNOTSUPP;
1796 }
1797
1798 return (error);
1799}
1800
1801#undef dst
1802#undef gateway
1803#undef netmask
1804#undef ifaaddr
1805#undef ifpaddr
1806#undef flags
1807
1808static int
1809rtrequest1_fib_change(struct rib_head *rnh, struct rt_addrinfo *info,
1810 struct rtentry **ret_nrt, u_int fibnum)
1811{
1812 struct rtentry *rt = NULL;
1813 int error = 0;
1814 int free_ifa = 0;
1815 int family, mtu;
1816 struct if_mtuinfo ifmtu;
1817
1818 rt = (struct rtentry *)rnh->rnh_lookup(info->rti_info[RTAX_DST],
1819 info->rti_info[RTAX_NETMASK], &rnh->head);
1820
1821 if (rt == NULL)
1822 return (ESRCH);
1823
1824#ifdef RADIX_MPATH
1825 /*
1826 * If we got multipath routes,
1827 * we require users to specify a matching RTAX_GATEWAY.
1828 */
1829 if (rt_mpath_capable(rnh)) {
1830 rt = rt_mpath_matchgate(rt, info->rti_info[RTAX_GATEWAY]);
1831 if (rt == NULL)
1832 return (ESRCH);
1833 }
1834#endif
1835
1836 RT_LOCK(rt);
1837
1838 rt_setmetrics(info, rt);
1839
1840 /*
1841 * New gateway could require new ifaddr, ifp;
1842 * flags may also be different; ifp may be specified
1843 * by ll sockaddr when protocol address is ambiguous
1844 */
1845 if (((rt->rt_flags & RTF_GATEWAY) &&
1846 info->rti_info[RTAX_GATEWAY] != NULL) ||
1847 info->rti_info[RTAX_IFP] != NULL ||
1848 (info->rti_info[RTAX_IFA] != NULL &&
1849 !sa_equal(info->rti_info[RTAX_IFA], rt->rt_ifa->ifa_addr))) {
1850 /*
1851 * XXX: Temporarily set RTF_RNH_LOCKED flag in the rti_flags
1852 * to avoid rlock in the ifa_ifwithroute().
1853 */
1854 info->rti_flags |= RTF_RNH_LOCKED;
1855 error = rt_getifa_fib(info, fibnum);
1856 info->rti_flags &= ~RTF_RNH_LOCKED;
1857 if (info->rti_ifa != NULL)
1858 free_ifa = 1;
1859
1860 if (error != 0)
1861 goto bad;
1862 }
1863
1864 /* Check if outgoing interface has changed */
1865 if (info->rti_ifa != NULL && info->rti_ifa != rt->rt_ifa &&
1866 rt->rt_ifa != NULL && rt->rt_ifa->ifa_rtrequest != NULL) {
1867 rt->rt_ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1868 ifa_free(rt->rt_ifa);
1869 }
1870 /* Update gateway address */
1871 if (info->rti_info[RTAX_GATEWAY] != NULL) {
1872 error = rt_setgate(rt, rt_key(rt), info->rti_info[RTAX_GATEWAY]);
1873 if (error != 0)
1874 goto bad;
1875
1876 rt->rt_flags &= ~RTF_GATEWAY;
1877 rt->rt_flags |= (RTF_GATEWAY & info->rti_flags);
1878 }
1879
1880 if (info->rti_ifa != NULL && info->rti_ifa != rt->rt_ifa) {
1881 ifa_ref(info->rti_ifa);
1882 rt->rt_ifa = info->rti_ifa;
1883 rt->rt_ifp = info->rti_ifp;
1884 }
1885 /* Allow some flags to be toggled on change. */
1886 rt->rt_flags &= ~RTF_FMASK;
1887 rt->rt_flags |= info->rti_flags & RTF_FMASK;
1888
1889 if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest != NULL)
1890 rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, info);
1891
1892 /* Alter route MTU if necessary */
1893 if (rt->rt_ifp != NULL) {
1894 family = info->rti_info[RTAX_DST]->sa_family;
1895 mtu = if_getmtu_family(rt->rt_ifp, family);
1896 /* Set default MTU */
1897 if (rt->rt_mtu == 0)
1898 rt->rt_mtu = mtu;
1899 if (rt->rt_mtu != mtu) {
1900 /* Check if we really need to update */
1901 ifmtu.ifp = rt->rt_ifp;
1902 ifmtu.mtu = mtu;
1903 if_updatemtu_cb(rt->rt_nodes, &ifmtu);
1904 }
1905 }
1906
1907 if (ret_nrt) {
1908 *ret_nrt = rt;
1909 RT_ADDREF(rt);
1910 }
1911bad:
1912 RT_UNLOCK(rt);
1913 if (free_ifa != 0)
1914 ifa_free(info->rti_ifa);
1915 return (error);
1916}
1917
1918static void
1919rt_setmetrics(const struct rt_addrinfo *info, struct rtentry *rt)
1920{
1921
1922 if (info->rti_mflags & RTV_MTU) {
1923 if (info->rti_rmx->rmx_mtu != 0) {
1924
1925 /*
1926 * MTU was explicitly provided by user.
1927 * Keep it.
1928 */
1929 rt->rt_flags |= RTF_FIXEDMTU;
1930 } else {
1931
1932 /*
1933 * User explicitly sets MTU to 0.
1934 * Assume rollback to default.
1935 */
1936 rt->rt_flags &= ~RTF_FIXEDMTU;
1937 }
1938 rt->rt_mtu = info->rti_rmx->rmx_mtu;
1939 }
1940 if (info->rti_mflags & RTV_WEIGHT)
1941 rt->rt_weight = info->rti_rmx->rmx_weight;
1942 /* Kernel -> userland timebase conversion. */
1943 if (info->rti_mflags & RTV_EXPIRE)
1944 rt->rt_expire = info->rti_rmx->rmx_expire ?
1945 info->rti_rmx->rmx_expire - time_second + time_uptime : 0;
1946}
1947
1948int
1949rt_setgate(struct rtentry *rt, struct sockaddr *dst, struct sockaddr *gate)
1950{
1951 /* XXX dst may be overwritten, can we move this to below */
1952 int dlen = SA_SIZE(dst), glen = SA_SIZE(gate);
1953
1954 /*
1955 * Prepare to store the gateway in rt->rt_gateway.
1956 * Both dst and gateway are stored one after the other in the same
1957 * malloc'd chunk. If we have room, we can reuse the old buffer,
1958 * rt_gateway already points to the right place.
1959 * Otherwise, malloc a new block and update the 'dst' address.
1960 */
1961 if (rt->rt_gateway == NULL || glen > SA_SIZE(rt->rt_gateway)) {
1962 caddr_t new;
1963
1964 R_Malloc(new, caddr_t, dlen + glen);
1965 if (new == NULL)
1966 return ENOBUFS;
1967 /*
1968 * XXX note, we copy from *dst and not *rt_key(rt) because
1969 * rt_setgate() can be called to initialize a newly
1970 * allocated route entry, in which case rt_key(rt) == NULL
1971 * (and also rt->rt_gateway == NULL).
1972 * Free()/free() handle a NULL argument just fine.
1973 */
1974 bcopy(dst, new, dlen);
1975 R_Free(rt_key(rt)); /* free old block, if any */
1976 rt_key(rt) = (struct sockaddr *)new;
1977 rt->rt_gateway = (struct sockaddr *)(new + dlen);
1978 }
1979
1980 /*
1981 * Copy the new gateway value into the memory chunk.
1982 */
1983 bcopy(gate, rt->rt_gateway, glen);
1984
1985 return (0);
1986}
1987
1988void
1989rt_maskedcopy(struct sockaddr *src, struct sockaddr *dst, struct sockaddr *netmask)
1990{
1991 u_char *cp1 = (u_char *)src;
1992 u_char *cp2 = (u_char *)dst;
1993 u_char *cp3 = (u_char *)netmask;
1994 u_char *cplim = cp2 + *cp3;
1995 u_char *cplim2 = cp2 + *cp1;
1996
1997 *cp2++ = *cp1++; *cp2++ = *cp1++; /* copies sa_len & sa_family */
1998 cp3 += 2;
1999 if (cplim > cplim2)
2000 cplim = cplim2;
2001 while (cp2 < cplim)
2002 *cp2++ = *cp1++ & *cp3++;
2003 if (cp2 < cplim2)
2004 bzero((caddr_t)cp2, (unsigned)(cplim2 - cp2));
2005}
2006
2007/*
2008 * Set up a routing table entry, normally
2009 * for an interface.
2010 */
2011#define _SOCKADDR_TMPSIZE 128 /* Not too big.. kernel stack size is limited */
2012static inline int
2013rtinit1(struct ifaddr *ifa, int cmd, int flags, int fibnum)
2014{
2015 struct sockaddr *dst;
2016 struct sockaddr *netmask;
2017 struct rtentry *rt = NULL;
2018 struct rt_addrinfo info;
2019 int error = 0;
2020 int startfib, endfib;
2021 char tempbuf[_SOCKADDR_TMPSIZE];
2022 int didwork = 0;
2023 int a_failure = 0;
2024 static struct sockaddr_dl null_sdl = {sizeof(null_sdl), AF_LINK};
2025 struct rib_head *rnh;
2026
2027 if (flags & RTF_HOST) {
2028 dst = ifa->ifa_dstaddr;
2029 netmask = NULL;
2030 } else {
2031 dst = ifa->ifa_addr;
2032 netmask = ifa->ifa_netmask;
2033 }
2034 if (dst->sa_len == 0)
2035 return(EINVAL);
2036 switch (dst->sa_family) {
2037 case AF_INET6:
2038 case AF_INET:
2039 /* We support multiple FIBs. */
2040 break;
2041 default:
2042 fibnum = RT_DEFAULT_FIB;
2043 break;
2044 }
2045 if (fibnum == RT_ALL_FIBS) {
2046 if (V_rt_add_addr_allfibs == 0 && cmd == (int)RTM_ADD)
2047 startfib = endfib = ifa->ifa_ifp->if_fib;
2048 else {
2049 startfib = 0;
2050 endfib = rt_numfibs - 1;
2051 }
2052 } else {
2053 KASSERT((fibnum < rt_numfibs), ("rtinit1: bad fibnum"));
2054 startfib = fibnum;
2055 endfib = fibnum;
2056 }
2057
2058 /*
2059 * If it's a delete, check that if it exists,
2060 * it's on the correct interface or we might scrub
2061 * a route to another ifa which would
2062 * be confusing at best and possibly worse.
2063 */
2064 if (cmd == RTM_DELETE) {
2065 /*
2066 * It's a delete, so it should already exist..
2067 * If it's a net, mask off the host bits
2068 * (Assuming we have a mask)
2069 * XXX this is kinda inet specific..
2070 */
2071 if (netmask != NULL) {
2072 rt_maskedcopy(dst, (struct sockaddr *)tempbuf, netmask);
2073 dst = (struct sockaddr *)tempbuf;
2074 }
2075 }
2076 /*
2077 * Now go through all the requested tables (fibs) and do the
2078 * requested action. Realistically, this will either be fib 0
2079 * for protocols that don't do multiple tables or all the
2080 * tables for those that do.
2081 */
2082 for ( fibnum = startfib; fibnum <= endfib; fibnum++) {
2083 if (cmd == RTM_DELETE) {
2084 struct radix_node *rn;
2085 /*
2086 * Look up an rtentry that is in the routing tree and
2087 * contains the correct info.
2088 */
2089 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
2090 if (rnh == NULL)
2091 /* this table doesn't exist but others might */
2092 continue;
2093 RIB_RLOCK(rnh);
2094 rn = rnh->rnh_lookup(dst, netmask, &rnh->head);
2095#ifdef RADIX_MPATH
2096 if (rt_mpath_capable(rnh)) {
2097
2098 if (rn == NULL)
2099 error = ESRCH;
2100 else {
2101 rt = RNTORT(rn);
2102 /*
2103 * for interface route the
2104 * rt->rt_gateway is sockaddr_intf
2105 * for cloning ARP entries, so
2106 * rt_mpath_matchgate must use the
2107 * interface address
2108 */
2109 rt = rt_mpath_matchgate(rt,
2110 ifa->ifa_addr);
2111 if (rt == NULL)
2112 error = ESRCH;
2113 }
2114 }
2115#endif
2116 error = (rn == NULL ||
2117 (rn->rn_flags & RNF_ROOT) ||
2118 RNTORT(rn)->rt_ifa != ifa);
2119 RIB_RUNLOCK(rnh);
2120 if (error) {
2121 /* this is only an error if bad on ALL tables */
2122 continue;
2123 }
2124 }
2125 /*
2126 * Do the actual request
2127 */
2128 bzero((caddr_t)&info, sizeof(info));
2129 info.rti_ifa = ifa;
2130 info.rti_flags = flags |
2131 (ifa->ifa_flags & ~IFA_RTSELF) | RTF_PINNED;
2132 info.rti_info[RTAX_DST] = dst;
2133 /*
2134 * doing this for compatibility reasons
2135 */
2136 if (cmd == RTM_ADD)
2137 info.rti_info[RTAX_GATEWAY] =
2138 (struct sockaddr *)&null_sdl;
2139 else
2140 info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
2141 info.rti_info[RTAX_NETMASK] = netmask;
2142 error = rtrequest1_fib(cmd, &info, &rt, fibnum);
2143
2144 if (error == 0 && rt != NULL) {
2145 /*
2146 * notify any listening routing agents of the change
2147 */
2148 RT_LOCK(rt);
2149#ifdef RADIX_MPATH
2150 /*
2151 * in case address alias finds the first address
2152 * e.g. ifconfig bge0 192.0.2.246/24
2153 * e.g. ifconfig bge0 192.0.2.247/24
2154 * the address set in the route is 192.0.2.246
2155 * so we need to replace it with 192.0.2.247
2156 */
2157 if (memcmp(rt->rt_ifa->ifa_addr,
2158 ifa->ifa_addr, ifa->ifa_addr->sa_len)) {
2159 ifa_free(rt->rt_ifa);
2160 ifa_ref(ifa);
2161 rt->rt_ifp = ifa->ifa_ifp;
2162 rt->rt_ifa = ifa;
2163 }
2164#endif
2165 /*
2166 * doing this for compatibility reasons
2167 */
2168 if (cmd == RTM_ADD) {
2169 ((struct sockaddr_dl *)rt->rt_gateway)->sdl_type =
2170 rt->rt_ifp->if_type;
2171 ((struct sockaddr_dl *)rt->rt_gateway)->sdl_index =
2172 rt->rt_ifp->if_index;
2173 }
2174 RT_ADDREF(rt);
2175 RT_UNLOCK(rt);
2176 rt_newaddrmsg_fib(cmd, ifa, error, rt, fibnum);
2177 RT_LOCK(rt);
2178 RT_REMREF(rt);
2179 if (cmd == RTM_DELETE) {
2180 /*
2181 * If we are deleting, and we found an entry,
2182 * then it's been removed from the tree..
2183 * now throw it away.
2184 */
2185 RTFREE_LOCKED(rt);
2186 } else {
2187 if (cmd == RTM_ADD) {
2188 /*
2189 * We just wanted to add it..
2190 * we don't actually need a reference.
2191 */
2192 RT_REMREF(rt);
2193 }
2194 RT_UNLOCK(rt);
2195 }
2196 didwork = 1;
2197 }
2198 if (error)
2199 a_failure = error;
2200 }
2201 if (cmd == RTM_DELETE) {
2202 if (didwork) {
2203 error = 0;
2204 } else {
2205 /* we only give an error if it wasn't in any table */
2206 error = ((flags & RTF_HOST) ?
2207 EHOSTUNREACH : ENETUNREACH);
2208 }
2209 } else {
2210 if (a_failure) {
2211 /* return an error if any of them failed */
2212 error = a_failure;
2213 }
2214 }
2215 return (error);
2216}
2217
2218/*
2219 * Set up a routing table entry, normally
2220 * for an interface.
2221 */
2222int
2223rtinit(struct ifaddr *ifa, int cmd, int flags)
2224{
2225 struct sockaddr *dst;
2226 int fib = RT_DEFAULT_FIB;
2227
2228 if (flags & RTF_HOST) {
2229 dst = ifa->ifa_dstaddr;
2230 } else {
2231 dst = ifa->ifa_addr;
2232 }
2233
2234 switch (dst->sa_family) {
2235 case AF_INET6:
2236 case AF_INET:
2237 /* We do support multiple FIBs. */
2238 fib = RT_ALL_FIBS;
2239 break;
2240 }
2241 return (rtinit1(ifa, cmd, flags, fib));
2242}
2243
2244/*
2245 * Announce interface address arrival/withdraw
2246 * Returns 0 on success.
2247 */
2248int
2249rt_addrmsg(int cmd, struct ifaddr *ifa, int fibnum)
2250{
2251
2252 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2253 ("unexpected cmd %d", cmd));
2254
2255 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2256 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2257
2258#if defined(INET) || defined(INET6)
2259#ifdef SCTP
2260 /*
2261 * notify the SCTP stack
2262 * this will only get called when an address is added/deleted
2263 * XXX pass the ifaddr struct instead if ifa->ifa_addr...
2264 */
2265 sctp_addr_change(ifa, cmd);
2266#endif /* SCTP */
2267#endif
2268 return (rtsock_addrmsg(cmd, ifa, fibnum));
2269}
2270
2271/*
2272 * Announce route addition/removal.
2273 * Users of this function MUST validate input data BEFORE calling.
2274 * However we have to be able to handle invalid data:
2275 * if some userland app sends us "invalid" route message (invalid mask,
2276 * no dst, wrong address families, etc...) we need to pass it back
2277 * to app (and any other rtsock consumers) with rtm_errno field set to
2278 * non-zero value.
2279 * Returns 0 on success.
2280 */
2281int
2282rt_routemsg(int cmd, struct ifnet *ifp, int error, struct rtentry *rt,
2283 int fibnum)
2284{
2285
2286 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2287 ("unexpected cmd %d", cmd));
2288
2289 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2290 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2291
2292 KASSERT(rt_key(rt) != NULL, (":%s: rt_key must be supplied", __func__));
2293
2294 return (rtsock_routemsg(cmd, ifp, error, rt, fibnum));
2295}
2296
2297void
2298rt_newaddrmsg(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt)
2299{
2300
2301 rt_newaddrmsg_fib(cmd, ifa, error, rt, RT_ALL_FIBS);
2302}
2303
2304/*
2305 * This is called to generate messages from the routing socket
2306 * indicating a network interface has had addresses associated with it.
2307 */
2308void
2309rt_newaddrmsg_fib(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt,
2310 int fibnum)
2311{
2312
2313 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2314 ("unexpected cmd %u", cmd));
2315 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2316 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2317
2318 if (cmd == RTM_ADD) {
2319 rt_addrmsg(cmd, ifa, fibnum);
2320 if (rt != NULL)
2321 rt_routemsg(cmd, ifa->ifa_ifp, error, rt, fibnum);
2322 } else {
2323 if (rt != NULL)
2324 rt_routemsg(cmd, ifa->ifa_ifp, error, rt, fibnum);
2325 rt_addrmsg(cmd, ifa, fibnum);
2326 }
2327}
2328
| 231
232static int
233rtentry_zinit(void *mem, int size, int how)
234{
235 struct rtentry *rt = mem;
236
237 rt->rt_pksent = counter_u64_alloc(how);
238 if (rt->rt_pksent == NULL)
239 return (ENOMEM);
240
241 RT_LOCK_INIT(rt);
242
243 return (0);
244}
245
246static void
247rtentry_zfini(void *mem, int size)
248{
249 struct rtentry *rt = mem;
250
251 RT_LOCK_DESTROY(rt);
252 counter_u64_free(rt->rt_pksent);
253}
254
255static int
256rtentry_ctor(void *mem, int size, void *arg, int how)
257{
258 struct rtentry *rt = mem;
259
260 bzero(rt, offsetof(struct rtentry, rt_endzero));
261 counter_u64_zero(rt->rt_pksent);
262 rt->rt_chain = NULL;
263
264 return (0);
265}
266
267static void
268rtentry_dtor(void *mem, int size, void *arg)
269{
270 struct rtentry *rt = mem;
271
272 RT_UNLOCK_COND(rt);
273}
274
275static void
276vnet_route_init(const void *unused __unused)
277{
278 struct domain *dom;
279 struct rib_head **rnh;
280 int table;
281 int fam;
282
283 V_rt_tables = malloc(rt_numfibs * (AF_MAX+1) *
284 sizeof(struct rib_head *), M_RTABLE, M_WAITOK|M_ZERO);
285
286 V_rtzone = uma_zcreate("rtentry", sizeof(struct rtentry),
287 rtentry_ctor, rtentry_dtor,
288 rtentry_zinit, rtentry_zfini, UMA_ALIGN_PTR, 0);
289 for (dom = domains; dom; dom = dom->dom_next) {
290 if (dom->dom_rtattach == NULL)
291 continue;
292
293 for (table = 0; table < rt_numfibs; table++) {
294 fam = dom->dom_family;
295 if (table != 0 && fam != AF_INET6 && fam != AF_INET)
296 break;
297
298 rnh = rt_tables_get_rnh_ptr(table, fam);
299 if (rnh == NULL)
300 panic("%s: rnh NULL", __func__);
301 dom->dom_rtattach((void **)rnh, 0);
302 }
303 }
304}
305VNET_SYSINIT(vnet_route_init, SI_SUB_PROTO_DOMAIN, SI_ORDER_FOURTH,
306 vnet_route_init, 0);
307
308#ifdef VIMAGE
309static void
310vnet_route_uninit(const void *unused __unused)
311{
312 int table;
313 int fam;
314 struct domain *dom;
315 struct rib_head **rnh;
316
317 for (dom = domains; dom; dom = dom->dom_next) {
318 if (dom->dom_rtdetach == NULL)
319 continue;
320
321 for (table = 0; table < rt_numfibs; table++) {
322 fam = dom->dom_family;
323
324 if (table != 0 && fam != AF_INET6 && fam != AF_INET)
325 break;
326
327 rnh = rt_tables_get_rnh_ptr(table, fam);
328 if (rnh == NULL)
329 panic("%s: rnh NULL", __func__);
330 dom->dom_rtdetach((void **)rnh, 0);
331 }
332 }
333
334 free(V_rt_tables, M_RTABLE);
335 uma_zdestroy(V_rtzone);
336}
337VNET_SYSUNINIT(vnet_route_uninit, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST,
338 vnet_route_uninit, 0);
339#endif
340
341struct rib_head *
342rt_table_init(int offset)
343{
344 struct rib_head *rh;
345
346 rh = malloc(sizeof(struct rib_head), M_RTABLE, M_WAITOK | M_ZERO);
347
348 /* TODO: These details should be hidded inside radix.c */
349 /* Init masks tree */
350 rn_inithead_internal(&rh->head, rh->rnh_nodes, offset);
351 rn_inithead_internal(&rh->rmhead.head, rh->rmhead.mask_nodes, 0);
352 rh->head.rnh_masks = &rh->rmhead;
353
354 /* Init locks */
355 rw_init(&rh->rib_lock, "rib head lock");
356
357 /* Finally, set base callbacks */
358 rh->rnh_addaddr = rn_addroute;
359 rh->rnh_deladdr = rn_delete;
360 rh->rnh_matchaddr = rn_match;
361 rh->rnh_lookup = rn_lookup;
362 rh->rnh_walktree = rn_walktree;
363 rh->rnh_walktree_from = rn_walktree_from;
364
365 return (rh);
366}
367
368static int
369rt_freeentry(struct radix_node *rn, void *arg)
370{
371 struct radix_head * const rnh = arg;
372 struct radix_node *x;
373
374 x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);
375 if (x != NULL)
376 R_Free(x);
377 return (0);
378}
379
380void
381rt_table_destroy(struct rib_head *rh)
382{
383
384 rn_walktree(&rh->rmhead.head, rt_freeentry, &rh->rmhead.head);
385
386 /* Assume table is already empty */
387 rw_destroy(&rh->rib_lock);
388 free(rh, M_RTABLE);
389}
390
391
392#ifndef _SYS_SYSPROTO_H_
393struct setfib_args {
394 int fibnum;
395};
396#endif
397int
398sys_setfib(struct thread *td, struct setfib_args *uap)
399{
400 if (uap->fibnum < 0 || uap->fibnum >= rt_numfibs)
401 return EINVAL;
402 td->td_proc->p_fibnum = uap->fibnum;
403 return (0);
404}
405
406/*
407 * Packet routing routines.
408 */
409void
410rtalloc_ign_fib(struct route *ro, u_long ignore, u_int fibnum)
411{
412 struct rtentry *rt;
413
414 if ((rt = ro->ro_rt) != NULL) {
415 if (rt->rt_ifp != NULL && rt->rt_flags & RTF_UP)
416 return;
417 RTFREE(rt);
418 ro->ro_rt = NULL;
419 }
420 ro->ro_rt = rtalloc1_fib(&ro->ro_dst, 1, ignore, fibnum);
421 if (ro->ro_rt)
422 RT_UNLOCK(ro->ro_rt);
423}
424
425/*
426 * Look up the route that matches the address given
427 * Or, at least try.. Create a cloned route if needed.
428 *
429 * The returned route, if any, is locked.
430 */
431struct rtentry *
432rtalloc1(struct sockaddr *dst, int report, u_long ignflags)
433{
434
435 return (rtalloc1_fib(dst, report, ignflags, RT_DEFAULT_FIB));
436}
437
438struct rtentry *
439rtalloc1_fib(struct sockaddr *dst, int report, u_long ignflags,
440 u_int fibnum)
441{
442 struct rib_head *rh;
443 struct radix_node *rn;
444 struct rtentry *newrt;
445 struct rt_addrinfo info;
446 int err = 0, msgtype = RTM_MISS;
447
448 KASSERT((fibnum < rt_numfibs), ("rtalloc1_fib: bad fibnum"));
449 rh = rt_tables_get_rnh(fibnum, dst->sa_family);
450 newrt = NULL;
451 if (rh == NULL)
452 goto miss;
453
454 /*
455 * Look up the address in the table for that Address Family
456 */
457 if ((ignflags & RTF_RNH_LOCKED) == 0)
458 RIB_RLOCK(rh);
459#ifdef INVARIANTS
460 else
461 RIB_LOCK_ASSERT(rh);
462#endif
463 rn = rh->rnh_matchaddr(dst, &rh->head);
464 if (rn && ((rn->rn_flags & RNF_ROOT) == 0)) {
465 newrt = RNTORT(rn);
466 RT_LOCK(newrt);
467 RT_ADDREF(newrt);
468 if ((ignflags & RTF_RNH_LOCKED) == 0)
469 RIB_RUNLOCK(rh);
470 return (newrt);
471
472 } else if ((ignflags & RTF_RNH_LOCKED) == 0)
473 RIB_RUNLOCK(rh);
474 /*
475 * Either we hit the root or could not find any match,
476 * which basically means: "cannot get there from here".
477 */
478miss:
479 V_rtstat.rts_unreach++;
480
481 if (report) {
482 /*
483 * If required, report the failure to the supervising
484 * Authorities.
485 * For a delete, this is not an error. (report == 0)
486 */
487 bzero(&info, sizeof(info));
488 info.rti_info[RTAX_DST] = dst;
489 rt_missmsg_fib(msgtype, &info, 0, err, fibnum);
490 }
491 return (newrt);
492}
493
494/*
495 * Remove a reference count from an rtentry.
496 * If the count gets low enough, take it out of the routing table
497 */
498void
499rtfree(struct rtentry *rt)
500{
501 struct rib_head *rnh;
502
503 KASSERT(rt != NULL,("%s: NULL rt", __func__));
504 rnh = rt_tables_get_rnh(rt->rt_fibnum, rt_key(rt)->sa_family);
505 KASSERT(rnh != NULL,("%s: NULL rnh", __func__));
506
507 RT_LOCK_ASSERT(rt);
508
509 /*
510 * The callers should use RTFREE_LOCKED() or RTFREE(), so
511 * we should come here exactly with the last reference.
512 */
513 RT_REMREF(rt);
514 if (rt->rt_refcnt > 0) {
515 log(LOG_DEBUG, "%s: %p has %d refs\n", __func__, rt, rt->rt_refcnt);
516 goto done;
517 }
518
519 /*
520 * On last reference give the "close method" a chance
521 * to cleanup private state. This also permits (for
522 * IPv4 and IPv6) a chance to decide if the routing table
523 * entry should be purged immediately or at a later time.
524 * When an immediate purge is to happen the close routine
525 * typically calls rtexpunge which clears the RTF_UP flag
526 * on the entry so that the code below reclaims the storage.
527 */
528 if (rt->rt_refcnt == 0 && rnh->rnh_close)
529 rnh->rnh_close((struct radix_node *)rt, &rnh->head);
530
531 /*
532 * If we are no longer "up" (and ref == 0)
533 * then we can free the resources associated
534 * with the route.
535 */
536 if ((rt->rt_flags & RTF_UP) == 0) {
537 if (rt->rt_nodes->rn_flags & (RNF_ACTIVE | RNF_ROOT))
538 panic("rtfree 2");
539 /*
540 * the rtentry must have been removed from the routing table
541 * so it is represented in rttrash.. remove that now.
542 */
543 V_rttrash--;
544#ifdef DIAGNOSTIC
545 if (rt->rt_refcnt < 0) {
546 printf("rtfree: %p not freed (neg refs)\n", rt);
547 goto done;
548 }
549#endif
550 /*
551 * release references on items we hold them on..
552 * e.g other routes and ifaddrs.
553 */
554 if (rt->rt_ifa)
555 ifa_free(rt->rt_ifa);
556 /*
557 * The key is separatly alloc'd so free it (see rt_setgate()).
558 * This also frees the gateway, as they are always malloc'd
559 * together.
560 */
561 R_Free(rt_key(rt));
562
563 /*
564 * and the rtentry itself of course
565 */
566 uma_zfree(V_rtzone, rt);
567 return;
568 }
569done:
570 RT_UNLOCK(rt);
571}
572
573
574/*
575 * Force a routing table entry to the specified
576 * destination to go through the given gateway.
577 * Normally called as a result of a routing redirect
578 * message from the network layer.
579 */
580void
581rtredirect_fib(struct sockaddr *dst,
582 struct sockaddr *gateway,
583 struct sockaddr *netmask,
584 int flags,
585 struct sockaddr *src,
586 u_int fibnum)
587{
588 struct rtentry *rt;
589 int error = 0;
590 short *stat = NULL;
591 struct rt_addrinfo info;
592 struct ifaddr *ifa;
593 struct rib_head *rnh;
594
595 ifa = NULL;
596 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
597 if (rnh == NULL) {
598 error = EAFNOSUPPORT;
599 goto out;
600 }
601
602 /* verify the gateway is directly reachable */
603 if ((ifa = ifa_ifwithnet(gateway, 0, fibnum)) == NULL) {
604 error = ENETUNREACH;
605 goto out;
606 }
607 rt = rtalloc1_fib(dst, 0, 0UL, fibnum); /* NB: rt is locked */
608 /*
609 * If the redirect isn't from our current router for this dst,
610 * it's either old or wrong. If it redirects us to ourselves,
611 * we have a routing loop, perhaps as a result of an interface
612 * going down recently.
613 */
614 if (!(flags & RTF_DONE) && rt) {
615 if (!sa_equal(src, rt->rt_gateway)) {
616 error = EINVAL;
617 goto done;
618 }
619 if (rt->rt_ifa != ifa && ifa->ifa_addr->sa_family != AF_LINK) {
620 error = EINVAL;
621 goto done;
622 }
623 }
624 if ((flags & RTF_GATEWAY) && ifa_ifwithaddr_check(gateway)) {
625 error = EHOSTUNREACH;
626 goto done;
627 }
628 /*
629 * Create a new entry if we just got back a wildcard entry
630 * or the lookup failed. This is necessary for hosts
631 * which use routing redirects generated by smart gateways
632 * to dynamically build the routing tables.
633 */
634 if (rt == NULL || (rt_mask(rt) && rt_mask(rt)->sa_len < 2))
635 goto create;
636 /*
637 * Don't listen to the redirect if it's
638 * for a route to an interface.
639 */
640 if (rt->rt_flags & RTF_GATEWAY) {
641 if (((rt->rt_flags & RTF_HOST) == 0) && (flags & RTF_HOST)) {
642 /*
643 * Changing from route to net => route to host.
644 * Create new route, rather than smashing route to net.
645 */
646 create:
647 if (rt != NULL)
648 RTFREE_LOCKED(rt);
649
650 flags |= RTF_DYNAMIC;
651 bzero((caddr_t)&info, sizeof(info));
652 info.rti_info[RTAX_DST] = dst;
653 info.rti_info[RTAX_GATEWAY] = gateway;
654 info.rti_info[RTAX_NETMASK] = netmask;
655 info.rti_ifa = ifa;
656 info.rti_flags = flags;
657 error = rtrequest1_fib(RTM_ADD, &info, &rt, fibnum);
658 if (rt != NULL) {
659 RT_LOCK(rt);
660 flags = rt->rt_flags;
661 }
662
663 stat = &V_rtstat.rts_dynamic;
664 } else {
665
666 /*
667 * Smash the current notion of the gateway to
668 * this destination. Should check about netmask!!!
669 */
670 if ((flags & RTF_GATEWAY) == 0)
671 rt->rt_flags &= ~RTF_GATEWAY;
672 rt->rt_flags |= RTF_MODIFIED;
673 flags |= RTF_MODIFIED;
674 stat = &V_rtstat.rts_newgateway;
675 /*
676 * add the key and gateway (in one malloc'd chunk).
677 */
678 RT_UNLOCK(rt);
679 RIB_WLOCK(rnh);
680 RT_LOCK(rt);
681 rt_setgate(rt, rt_key(rt), gateway);
682 RIB_WUNLOCK(rnh);
683 }
684 } else
685 error = EHOSTUNREACH;
686done:
687 if (rt)
688 RTFREE_LOCKED(rt);
689out:
690 if (error)
691 V_rtstat.rts_badredirect++;
692 else if (stat != NULL)
693 (*stat)++;
694 bzero((caddr_t)&info, sizeof(info));
695 info.rti_info[RTAX_DST] = dst;
696 info.rti_info[RTAX_GATEWAY] = gateway;
697 info.rti_info[RTAX_NETMASK] = netmask;
698 info.rti_info[RTAX_AUTHOR] = src;
699 rt_missmsg_fib(RTM_REDIRECT, &info, flags, error, fibnum);
700 if (ifa != NULL)
701 ifa_free(ifa);
702}
703
704/*
705 * Routing table ioctl interface.
706 */
707int
708rtioctl_fib(u_long req, caddr_t data, u_int fibnum)
709{
710
711 /*
712 * If more ioctl commands are added here, make sure the proper
713 * super-user checks are being performed because it is possible for
714 * prison-root to make it this far if raw sockets have been enabled
715 * in jails.
716 */
717#ifdef INET
718 /* Multicast goop, grrr... */
719 return mrt_ioctl ? mrt_ioctl(req, data, fibnum) : EOPNOTSUPP;
720#else /* INET */
721 return ENXIO;
722#endif /* INET */
723}
724
725struct ifaddr *
726ifa_ifwithroute(int flags, const struct sockaddr *dst, struct sockaddr *gateway,
727 u_int fibnum)
728{
729 struct ifaddr *ifa;
730 int not_found = 0;
731
732 if ((flags & RTF_GATEWAY) == 0) {
733 /*
734 * If we are adding a route to an interface,
735 * and the interface is a pt to pt link
736 * we should search for the destination
737 * as our clue to the interface. Otherwise
738 * we can use the local address.
739 */
740 ifa = NULL;
741 if (flags & RTF_HOST)
742 ifa = ifa_ifwithdstaddr(dst, fibnum);
743 if (ifa == NULL)
744 ifa = ifa_ifwithaddr(gateway);
745 } else {
746 /*
747 * If we are adding a route to a remote net
748 * or host, the gateway may still be on the
749 * other end of a pt to pt link.
750 */
751 ifa = ifa_ifwithdstaddr(gateway, fibnum);
752 }
753 if (ifa == NULL)
754 ifa = ifa_ifwithnet(gateway, 0, fibnum);
755 if (ifa == NULL) {
756 struct rtentry *rt;
757
758 rt = rtalloc1_fib(gateway, 0, flags, fibnum);
759 if (rt == NULL)
760 return (NULL);
761 /*
762 * dismiss a gateway that is reachable only
763 * through the default router
764 */
765 switch (gateway->sa_family) {
766 case AF_INET:
767 if (satosin(rt_key(rt))->sin_addr.s_addr == INADDR_ANY)
768 not_found = 1;
769 break;
770 case AF_INET6:
771 if (IN6_IS_ADDR_UNSPECIFIED(&satosin6(rt_key(rt))->sin6_addr))
772 not_found = 1;
773 break;
774 default:
775 break;
776 }
777 if (!not_found && rt->rt_ifa != NULL) {
778 ifa = rt->rt_ifa;
779 ifa_ref(ifa);
780 }
781 RT_REMREF(rt);
782 RT_UNLOCK(rt);
783 if (not_found || ifa == NULL)
784 return (NULL);
785 }
786 if (ifa->ifa_addr->sa_family != dst->sa_family) {
787 struct ifaddr *oifa = ifa;
788 ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
789 if (ifa == NULL)
790 ifa = oifa;
791 else
792 ifa_free(oifa);
793 }
794 return (ifa);
795}
796
797/*
798 * Do appropriate manipulations of a routing tree given
799 * all the bits of info needed
800 */
801int
802rtrequest_fib(int req,
803 struct sockaddr *dst,
804 struct sockaddr *gateway,
805 struct sockaddr *netmask,
806 int flags,
807 struct rtentry **ret_nrt,
808 u_int fibnum)
809{
810 struct rt_addrinfo info;
811
812 if (dst->sa_len == 0)
813 return(EINVAL);
814
815 bzero((caddr_t)&info, sizeof(info));
816 info.rti_flags = flags;
817 info.rti_info[RTAX_DST] = dst;
818 info.rti_info[RTAX_GATEWAY] = gateway;
819 info.rti_info[RTAX_NETMASK] = netmask;
820 return rtrequest1_fib(req, &info, ret_nrt, fibnum);
821}
822
823
824/*
825 * Copy most of @rt data into @info.
826 *
827 * If @flags contains NHR_COPY, copies dst,netmask and gw to the
828 * pointers specified by @info structure. Assume such pointers
829 * are zeroed sockaddr-like structures with sa_len field initialized
830 * to reflect size of the provided buffer. if no NHR_COPY is specified,
831 * point dst,netmask and gw @info fields to appropriate @rt values.
832 *
833 * if @flags contains NHR_REF, do refcouting on rt_ifp.
834 *
835 * Returns 0 on success.
836 */
837int
838rt_exportinfo(struct rtentry *rt, struct rt_addrinfo *info, int flags)
839{
840 struct rt_metrics *rmx;
841 struct sockaddr *src, *dst;
842 int sa_len;
843
844 if (flags & NHR_COPY) {
845 /* Copy destination if dst is non-zero */
846 src = rt_key(rt);
847 dst = info->rti_info[RTAX_DST];
848 sa_len = src->sa_len;
849 if (dst != NULL) {
850 if (src->sa_len > dst->sa_len)
851 return (ENOMEM);
852 memcpy(dst, src, src->sa_len);
853 info->rti_addrs |= RTA_DST;
854 }
855
856 /* Copy mask if set && dst is non-zero */
857 src = rt_mask(rt);
858 dst = info->rti_info[RTAX_NETMASK];
859 if (src != NULL && dst != NULL) {
860
861 /*
862 * Radix stores different value in sa_len,
863 * assume rt_mask() to have the same length
864 * as rt_key()
865 */
866 if (sa_len > dst->sa_len)
867 return (ENOMEM);
868 memcpy(dst, src, src->sa_len);
869 info->rti_addrs |= RTA_NETMASK;
870 }
871
872 /* Copy gateway is set && dst is non-zero */
873 src = rt->rt_gateway;
874 dst = info->rti_info[RTAX_GATEWAY];
875 if ((rt->rt_flags & RTF_GATEWAY) && src != NULL && dst != NULL){
876 if (src->sa_len > dst->sa_len)
877 return (ENOMEM);
878 memcpy(dst, src, src->sa_len);
879 info->rti_addrs |= RTA_GATEWAY;
880 }
881 } else {
882 info->rti_info[RTAX_DST] = rt_key(rt);
883 info->rti_addrs |= RTA_DST;
884 if (rt_mask(rt) != NULL) {
885 info->rti_info[RTAX_NETMASK] = rt_mask(rt);
886 info->rti_addrs |= RTA_NETMASK;
887 }
888 if (rt->rt_flags & RTF_GATEWAY) {
889 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
890 info->rti_addrs |= RTA_GATEWAY;
891 }
892 }
893
894 rmx = info->rti_rmx;
895 if (rmx != NULL) {
896 info->rti_mflags |= RTV_MTU;
897 rmx->rmx_mtu = rt->rt_mtu;
898 }
899
900 info->rti_flags = rt->rt_flags;
901 info->rti_ifp = rt->rt_ifp;
902 info->rti_ifa = rt->rt_ifa;
903
904 if (flags & NHR_REF) {
905 /* Do 'traditional' refcouting */
906 if_ref(info->rti_ifp);
907 }
908
909 return (0);
910}
911
912/*
913 * Lookups up route entry for @dst in RIB database for fib @fibnum.
914 * Exports entry data to @info using rt_exportinfo().
915 *
916 * if @flags contains NHR_REF, refcouting is performed on rt_ifp.
917 * All references can be released later by calling rib_free_info()
918 *
919 * Returns 0 on success.
920 * Returns ENOENT for lookup failure, ENOMEM for export failure.
921 */
922int
923rib_lookup_info(uint32_t fibnum, const struct sockaddr *dst, uint32_t flags,
924 uint32_t flowid, struct rt_addrinfo *info)
925{
926 struct rib_head *rh;
927 struct radix_node *rn;
928 struct rtentry *rt;
929 int error;
930
931 KASSERT((fibnum < rt_numfibs), ("rib_lookup_rte: bad fibnum"));
932 rh = rt_tables_get_rnh(fibnum, dst->sa_family);
933 if (rh == NULL)
934 return (ENOENT);
935
936 RIB_RLOCK(rh);
937 rn = rh->rnh_matchaddr(__DECONST(void *, dst), &rh->head);
938 if (rn != NULL && ((rn->rn_flags & RNF_ROOT) == 0)) {
939 rt = RNTORT(rn);
940 /* Ensure route & ifp is UP */
941 if (RT_LINK_IS_UP(rt->rt_ifp)) {
942 flags = (flags & NHR_REF) | NHR_COPY;
943 error = rt_exportinfo(rt, info, flags);
944 RIB_RUNLOCK(rh);
945
946 return (error);
947 }
948 }
949 RIB_RUNLOCK(rh);
950
951 return (ENOENT);
952}
953
954/*
955 * Releases all references acquired by rib_lookup_info() when
956 * called with NHR_REF flags.
957 */
958void
959rib_free_info(struct rt_addrinfo *info)
960{
961
962 if_rele(info->rti_ifp);
963}
964
965/*
966 * Iterates over all existing fibs in system calling
967 * @setwa_f function prior to traversing each fib.
968 * Calls @wa_f function for each element in current fib.
969 * If af is not AF_UNSPEC, iterates over fibs in particular
970 * address family.
971 */
972void
973rt_foreach_fib_walk(int af, rt_setwarg_t *setwa_f, rt_walktree_f_t *wa_f,
974 void *arg)
975{
976 struct rib_head *rnh;
977 uint32_t fibnum;
978 int i;
979
980 for (fibnum = 0; fibnum < rt_numfibs; fibnum++) {
981 /* Do we want some specific family? */
982 if (af != AF_UNSPEC) {
983 rnh = rt_tables_get_rnh(fibnum, af);
984 if (rnh == NULL)
985 continue;
986 if (setwa_f != NULL)
987 setwa_f(rnh, fibnum, af, arg);
988
989 RIB_WLOCK(rnh);
990 rnh->rnh_walktree(&rnh->head, (walktree_f_t *)wa_f,arg);
991 RIB_WUNLOCK(rnh);
992 continue;
993 }
994
995 for (i = 1; i <= AF_MAX; i++) {
996 rnh = rt_tables_get_rnh(fibnum, i);
997 if (rnh == NULL)
998 continue;
999 if (setwa_f != NULL)
1000 setwa_f(rnh, fibnum, i, arg);
1001
1002 RIB_WLOCK(rnh);
1003 rnh->rnh_walktree(&rnh->head, (walktree_f_t *)wa_f,arg);
1004 RIB_WUNLOCK(rnh);
1005 }
1006 }
1007}
1008
1009struct rt_delinfo
1010{
1011 struct rt_addrinfo info;
1012 struct rib_head *rnh;
1013 struct rtentry *head;
1014};
1015
1016/*
1017 * Conditionally unlinks @rn from radix tree based
1018 * on info data passed in @arg.
1019 */
1020static int
1021rt_checkdelroute(struct radix_node *rn, void *arg)
1022{
1023 struct rt_delinfo *di;
1024 struct rt_addrinfo *info;
1025 struct rtentry *rt;
1026 int error;
1027
1028 di = (struct rt_delinfo *)arg;
1029 rt = (struct rtentry *)rn;
1030 info = &di->info;
1031 error = 0;
1032
1033 info->rti_info[RTAX_DST] = rt_key(rt);
1034 info->rti_info[RTAX_NETMASK] = rt_mask(rt);
1035 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1036
1037 rt = rt_unlinkrte(di->rnh, info, &error);
1038 if (rt == NULL) {
1039 /* Either not allowed or not matched. Skip entry */
1040 return (0);
1041 }
1042
1043 /* Entry was unlinked. Add to the list and return */
1044 rt->rt_chain = di->head;
1045 di->head = rt;
1046
1047 return (0);
1048}
1049
1050/*
1051 * Iterates over all existing fibs in system.
1052 * Deletes each element for which @filter_f function returned
1053 * non-zero value.
1054 * If @af is not AF_UNSPEC, iterates over fibs in particular
1055 * address family.
1056 */
1057void
1058rt_foreach_fib_walk_del(int af, rt_filter_f_t *filter_f, void *arg)
1059{
1060 struct rib_head *rnh;
1061 struct rt_delinfo di;
1062 struct rtentry *rt;
1063 uint32_t fibnum;
1064 int i, start, end;
1065
1066 bzero(&di, sizeof(di));
1067 di.info.rti_filter = filter_f;
1068 di.info.rti_filterdata = arg;
1069
1070 for (fibnum = 0; fibnum < rt_numfibs; fibnum++) {
1071 /* Do we want some specific family? */
1072 if (af != AF_UNSPEC) {
1073 start = af;
1074 end = af;
1075 } else {
1076 start = 1;
1077 end = AF_MAX;
1078 }
1079
1080 for (i = start; i <= end; i++) {
1081 rnh = rt_tables_get_rnh(fibnum, i);
1082 if (rnh == NULL)
1083 continue;
1084 di.rnh = rnh;
1085
1086 RIB_WLOCK(rnh);
1087 rnh->rnh_walktree(&rnh->head, rt_checkdelroute, &di);
1088 RIB_WUNLOCK(rnh);
1089
1090 if (di.head == NULL)
1091 continue;
1092
1093 /* We might have something to reclaim */
1094 while (di.head != NULL) {
1095 rt = di.head;
1096 di.head = rt->rt_chain;
1097 rt->rt_chain = NULL;
1098
1099 /* TODO std rt -> rt_addrinfo export */
1100 di.info.rti_info[RTAX_DST] = rt_key(rt);
1101 di.info.rti_info[RTAX_NETMASK] = rt_mask(rt);
1102
1103 rt_notifydelete(rt, &di.info);
1104 RTFREE_LOCKED(rt);
1105 }
1106
1107 }
1108 }
1109}
1110
1111/*
1112 * Delete Routes for a Network Interface
1113 *
1114 * Called for each routing entry via the rnh->rnh_walktree() call above
1115 * to delete all route entries referencing a detaching network interface.
1116 *
1117 * Arguments:
1118 * rt pointer to rtentry
1119 * arg argument passed to rnh->rnh_walktree() - detaching interface
1120 *
1121 * Returns:
1122 * 0 successful
1123 * errno failed - reason indicated
1124 */
1125static int
1126rt_ifdelroute(const struct rtentry *rt, void *arg)
1127{
1128 struct ifnet *ifp = arg;
1129
1130 if (rt->rt_ifp != ifp)
1131 return (0);
1132
1133 /*
1134 * Protect (sorta) against walktree recursion problems
1135 * with cloned routes
1136 */
1137 if ((rt->rt_flags & RTF_UP) == 0)
1138 return (0);
1139
1140 return (1);
1141}
1142
1143/*
1144 * Delete all remaining routes using this interface
1145 * Unfortuneatly the only way to do this is to slog through
1146 * the entire routing table looking for routes which point
1147 * to this interface...oh well...
1148 */
1149void
1150rt_flushifroutes_af(struct ifnet *ifp, int af)
1151{
1152 KASSERT((af >= 1 && af <= AF_MAX), ("%s: af %d not >= 1 and <= %d",
1153 __func__, af, AF_MAX));
1154
1155 rt_foreach_fib_walk_del(af, rt_ifdelroute, ifp);
1156}
1157
1158void
1159rt_flushifroutes(struct ifnet *ifp)
1160{
1161
1162 rt_foreach_fib_walk_del(AF_UNSPEC, rt_ifdelroute, ifp);
1163}
1164
1165/*
1166 * Conditionally unlinks rtentry matching data inside @info from @rnh.
1167 * Returns unlinked, locked and referenced @rtentry on success,
1168 * Returns NULL and sets @perror to:
1169 * ESRCH - if prefix was not found,
1170 * EADDRINUSE - if trying to delete PINNED route without appropriate flag.
1171 * ENOENT - if supplied filter function returned 0 (not matched).
1172 */
1173static struct rtentry *
1174rt_unlinkrte(struct rib_head *rnh, struct rt_addrinfo *info, int *perror)
1175{
1176 struct sockaddr *dst, *netmask;
1177 struct rtentry *rt;
1178 struct radix_node *rn;
1179
1180 dst = info->rti_info[RTAX_DST];
1181 netmask = info->rti_info[RTAX_NETMASK];
1182
1183 rt = (struct rtentry *)rnh->rnh_lookup(dst, netmask, &rnh->head);
1184 if (rt == NULL) {
1185 *perror = ESRCH;
1186 return (NULL);
1187 }
1188
1189 if ((info->rti_flags & RTF_PINNED) == 0) {
1190 /* Check if target route can be deleted */
1191 if (rt->rt_flags & RTF_PINNED) {
1192 *perror = EADDRINUSE;
1193 return (NULL);
1194 }
1195 }
1196
1197 if (info->rti_filter != NULL) {
1198 if (info->rti_filter(rt, info->rti_filterdata) == 0) {
1199 /* Not matched */
1200 *perror = ENOENT;
1201 return (NULL);
1202 }
1203
1204 /*
1205 * Filter function requested rte deletion.
1206 * Ease the caller work by filling in remaining info
1207 * from that particular entry.
1208 */
1209 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1210 }
1211
1212 /*
1213 * Remove the item from the tree and return it.
1214 * Complain if it is not there and do no more processing.
1215 */
1216 *perror = ESRCH;
1217#ifdef RADIX_MPATH
1218 if (rt_mpath_capable(rnh))
1219 rn = rt_mpath_unlink(rnh, info, rt, perror);
1220 else
1221#endif
1222 rn = rnh->rnh_deladdr(dst, netmask, &rnh->head);
1223 if (rn == NULL)
1224 return (NULL);
1225
1226 if (rn->rn_flags & (RNF_ACTIVE | RNF_ROOT))
1227 panic ("rtrequest delete");
1228
1229 rt = RNTORT(rn);
1230 RT_LOCK(rt);
1231 RT_ADDREF(rt);
1232 rt->rt_flags &= ~RTF_UP;
1233
1234 *perror = 0;
1235
1236 return (rt);
1237}
1238
1239static void
1240rt_notifydelete(struct rtentry *rt, struct rt_addrinfo *info)
1241{
1242 struct ifaddr *ifa;
1243
1244 /*
1245 * give the protocol a chance to keep things in sync.
1246 */
1247 ifa = rt->rt_ifa;
1248 if (ifa != NULL && ifa->ifa_rtrequest != NULL)
1249 ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1250
1251 /*
1252 * One more rtentry floating around that is not
1253 * linked to the routing table. rttrash will be decremented
1254 * when RTFREE(rt) is eventually called.
1255 */
1256 V_rttrash++;
1257}
1258
1259
1260/*
1261 * These (questionable) definitions of apparent local variables apply
1262 * to the next two functions. XXXXXX!!!
1263 */
1264#define dst info->rti_info[RTAX_DST]
1265#define gateway info->rti_info[RTAX_GATEWAY]
1266#define netmask info->rti_info[RTAX_NETMASK]
1267#define ifaaddr info->rti_info[RTAX_IFA]
1268#define ifpaddr info->rti_info[RTAX_IFP]
1269#define flags info->rti_flags
1270
1271/*
1272 * Look up rt_addrinfo for a specific fib. Note that if rti_ifa is defined,
1273 * it will be referenced so the caller must free it.
1274 */
1275int
1276rt_getifa_fib(struct rt_addrinfo *info, u_int fibnum)
1277{
1278 struct ifaddr *ifa;
1279 int error = 0;
1280
1281 /*
1282 * ifp may be specified by sockaddr_dl
1283 * when protocol address is ambiguous.
1284 */
1285 if (info->rti_ifp == NULL && ifpaddr != NULL &&
1286 ifpaddr->sa_family == AF_LINK &&
1287 (ifa = ifa_ifwithnet(ifpaddr, 0, fibnum)) != NULL) {
1288 info->rti_ifp = ifa->ifa_ifp;
1289 ifa_free(ifa);
1290 }
1291 if (info->rti_ifa == NULL && ifaaddr != NULL)
1292 info->rti_ifa = ifa_ifwithaddr(ifaaddr);
1293 if (info->rti_ifa == NULL) {
1294 struct sockaddr *sa;
1295
1296 sa = ifaaddr != NULL ? ifaaddr :
1297 (gateway != NULL ? gateway : dst);
1298 if (sa != NULL && info->rti_ifp != NULL)
1299 info->rti_ifa = ifaof_ifpforaddr(sa, info->rti_ifp);
1300 else if (dst != NULL && gateway != NULL)
1301 info->rti_ifa = ifa_ifwithroute(flags, dst, gateway,
1302 fibnum);
1303 else if (sa != NULL)
1304 info->rti_ifa = ifa_ifwithroute(flags, sa, sa,
1305 fibnum);
1306 }
1307 if ((ifa = info->rti_ifa) != NULL) {
1308 if (info->rti_ifp == NULL)
1309 info->rti_ifp = ifa->ifa_ifp;
1310 } else
1311 error = ENETUNREACH;
1312 return (error);
1313}
1314
1315static int
1316if_updatemtu_cb(struct radix_node *rn, void *arg)
1317{
1318 struct rtentry *rt;
1319 struct if_mtuinfo *ifmtu;
1320
1321 rt = (struct rtentry *)rn;
1322 ifmtu = (struct if_mtuinfo *)arg;
1323
1324 if (rt->rt_ifp != ifmtu->ifp)
1325 return (0);
1326
1327 if (rt->rt_mtu >= ifmtu->mtu) {
1328 /* We have to decrease mtu regardless of flags */
1329 rt->rt_mtu = ifmtu->mtu;
1330 return (0);
1331 }
1332
1333 /*
1334 * New MTU is bigger. Check if are allowed to alter it
1335 */
1336 if ((rt->rt_flags & (RTF_FIXEDMTU | RTF_GATEWAY | RTF_HOST)) != 0) {
1337
1338 /*
1339 * Skip routes with user-supplied MTU and
1340 * non-interface routes
1341 */
1342 return (0);
1343 }
1344
1345 /* We are safe to update route MTU */
1346 rt->rt_mtu = ifmtu->mtu;
1347
1348 return (0);
1349}
1350
1351void
1352rt_updatemtu(struct ifnet *ifp)
1353{
1354 struct if_mtuinfo ifmtu;
1355 struct rib_head *rnh;
1356 int i, j;
1357
1358 ifmtu.ifp = ifp;
1359
1360 /*
1361 * Try to update rt_mtu for all routes using this interface
1362 * Unfortunately the only way to do this is to traverse all
1363 * routing tables in all fibs/domains.
1364 */
1365 for (i = 1; i <= AF_MAX; i++) {
1366 ifmtu.mtu = if_getmtu_family(ifp, i);
1367 for (j = 0; j < rt_numfibs; j++) {
1368 rnh = rt_tables_get_rnh(j, i);
1369 if (rnh == NULL)
1370 continue;
1371 RIB_WLOCK(rnh);
1372 rnh->rnh_walktree(&rnh->head, if_updatemtu_cb, &ifmtu);
1373 RIB_WUNLOCK(rnh);
1374 }
1375 }
1376}
1377
1378
1379#if 0
1380int p_sockaddr(char *buf, int buflen, struct sockaddr *s);
1381int rt_print(char *buf, int buflen, struct rtentry *rt);
1382
1383int
1384p_sockaddr(char *buf, int buflen, struct sockaddr *s)
1385{
1386 void *paddr = NULL;
1387
1388 switch (s->sa_family) {
1389 case AF_INET:
1390 paddr = &((struct sockaddr_in *)s)->sin_addr;
1391 break;
1392 case AF_INET6:
1393 paddr = &((struct sockaddr_in6 *)s)->sin6_addr;
1394 break;
1395 }
1396
1397 if (paddr == NULL)
1398 return (0);
1399
1400 if (inet_ntop(s->sa_family, paddr, buf, buflen) == NULL)
1401 return (0);
1402
1403 return (strlen(buf));
1404}
1405
1406int
1407rt_print(char *buf, int buflen, struct rtentry *rt)
1408{
1409 struct sockaddr *addr, *mask;
1410 int i = 0;
1411
1412 addr = rt_key(rt);
1413 mask = rt_mask(rt);
1414
1415 i = p_sockaddr(buf, buflen, addr);
1416 if (!(rt->rt_flags & RTF_HOST)) {
1417 buf[i++] = '/';
1418 i += p_sockaddr(buf + i, buflen - i, mask);
1419 }
1420
1421 if (rt->rt_flags & RTF_GATEWAY) {
1422 buf[i++] = '>';
1423 i += p_sockaddr(buf + i, buflen - i, rt->rt_gateway);
1424 }
1425
1426 return (i);
1427}
1428#endif
1429
1430#ifdef RADIX_MPATH
1431/*
1432 * Deletes key for single-path routes, unlinks rtentry with
1433 * gateway specified in @info from multi-path routes.
1434 *
1435 * Returnes unlinked entry. In case of failure, returns NULL
1436 * and sets @perror to ESRCH.
1437 */
1438static struct radix_node *
1439rt_mpath_unlink(struct rib_head *rnh, struct rt_addrinfo *info,
1440 struct rtentry *rto, int *perror)
1441{
1442 /*
1443 * if we got multipath routes, we require users to specify
1444 * a matching RTAX_GATEWAY.
1445 */
1446 struct rtentry *rt; // *rto = NULL;
1447 struct radix_node *rn;
1448 struct sockaddr *gw;
1449
1450 gw = info->rti_info[RTAX_GATEWAY];
1451 rt = rt_mpath_matchgate(rto, gw);
1452 if (rt == NULL) {
1453 *perror = ESRCH;
1454 return (NULL);
1455 }
1456
1457 /*
1458 * this is the first entry in the chain
1459 */
1460 if (rto == rt) {
1461 rn = rn_mpath_next((struct radix_node *)rt);
1462 /*
1463 * there is another entry, now it's active
1464 */
1465 if (rn) {
1466 rto = RNTORT(rn);
1467 RT_LOCK(rto);
1468 rto->rt_flags |= RTF_UP;
1469 RT_UNLOCK(rto);
1470 } else if (rt->rt_flags & RTF_GATEWAY) {
1471 /*
1472 * For gateway routes, we need to
1473 * make sure that we we are deleting
1474 * the correct gateway.
1475 * rt_mpath_matchgate() does not
1476 * check the case when there is only
1477 * one route in the chain.
1478 */
1479 if (gw &&
1480 (rt->rt_gateway->sa_len != gw->sa_len ||
1481 memcmp(rt->rt_gateway, gw, gw->sa_len))) {
1482 *perror = ESRCH;
1483 return (NULL);
1484 }
1485 }
1486
1487 /*
1488 * use the normal delete code to remove
1489 * the first entry
1490 */
1491 rn = rnh->rnh_deladdr(dst, netmask, &rnh->head);
1492 *perror = 0;
1493 return (rn);
1494 }
1495
1496 /*
1497 * if the entry is 2nd and on up
1498 */
1499 if (rt_mpath_deldup(rto, rt) == 0)
1500 panic ("rtrequest1: rt_mpath_deldup");
1501 *perror = 0;
1502 rn = (struct radix_node *)rt;
1503 return (rn);
1504}
1505#endif
1506
1507#ifdef FLOWTABLE
1508static struct rtentry *
1509rt_flowtable_check_route(struct rib_head *rnh, struct rt_addrinfo *info)
1510{
1511#if defined(INET6) || defined(INET)
1512 struct radix_node *rn;
1513#endif
1514 struct rtentry *rt0;
1515
1516 rt0 = NULL;
1517 /* "flow-table" only supports IPv6 and IPv4 at the moment. */
1518 switch (dst->sa_family) {
1519#ifdef INET6
1520 case AF_INET6:
1521#endif
1522#ifdef INET
1523 case AF_INET:
1524#endif
1525#if defined(INET6) || defined(INET)
1526 rn = rnh->rnh_matchaddr(dst, &rnh->head);
1527 if (rn && ((rn->rn_flags & RNF_ROOT) == 0)) {
1528 struct sockaddr *mask;
1529 u_char *m, *n;
1530 int len;
1531
1532 /*
1533 * compare mask to see if the new route is
1534 * more specific than the existing one
1535 */
1536 rt0 = RNTORT(rn);
1537 RT_LOCK(rt0);
1538 RT_ADDREF(rt0);
1539 RT_UNLOCK(rt0);
1540 /*
1541 * A host route is already present, so
1542 * leave the flow-table entries as is.
1543 */
1544 if (rt0->rt_flags & RTF_HOST) {
1545 RTFREE(rt0);
1546 rt0 = NULL;
1547 } else if (!(flags & RTF_HOST) && netmask) {
1548 mask = rt_mask(rt0);
1549 len = mask->sa_len;
1550 m = (u_char *)mask;
1551 n = (u_char *)netmask;
1552 while (len-- > 0) {
1553 if (*n != *m)
1554 break;
1555 n++;
1556 m++;
1557 }
1558 if (len == 0 || (*n < *m)) {
1559 RTFREE(rt0);
1560 rt0 = NULL;
1561 }
1562 }
1563 }
1564#endif/* INET6 || INET */
1565 }
1566
1567 return (rt0);
1568}
1569#endif
1570
1571int
1572rtrequest1_fib(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt,
1573 u_int fibnum)
1574{
1575 int error = 0;
1576 struct rtentry *rt, *rt_old;
1577#ifdef FLOWTABLE
1578 struct rtentry *rt0;
1579#endif
1580 struct radix_node *rn;
1581 struct rib_head *rnh;
1582 struct ifaddr *ifa;
1583 struct sockaddr *ndst;
1584 struct sockaddr_storage mdst;
1585
1586 KASSERT((fibnum < rt_numfibs), ("rtrequest1_fib: bad fibnum"));
1587 KASSERT((flags & RTF_RNH_LOCKED) == 0, ("rtrequest1_fib: locked"));
1588 switch (dst->sa_family) {
1589 case AF_INET6:
1590 case AF_INET:
1591 /* We support multiple FIBs. */
1592 break;
1593 default:
1594 fibnum = RT_DEFAULT_FIB;
1595 break;
1596 }
1597
1598 /*
1599 * Find the correct routing tree to use for this Address Family
1600 */
1601 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
1602 if (rnh == NULL)
1603 return (EAFNOSUPPORT);
1604
1605 /*
1606 * If we are adding a host route then we don't want to put
1607 * a netmask in the tree, nor do we want to clone it.
1608 */
1609 if (flags & RTF_HOST)
1610 netmask = NULL;
1611
1612 switch (req) {
1613 case RTM_DELETE:
1614 if (netmask) {
1615 if (dst->sa_len > sizeof(mdst))
1616 return (EINVAL);
1617 rt_maskedcopy(dst, (struct sockaddr *)&mdst, netmask);
1618 dst = (struct sockaddr *)&mdst;
1619 }
1620
1621 RIB_WLOCK(rnh);
1622 rt = rt_unlinkrte(rnh, info, &error);
1623 RIB_WUNLOCK(rnh);
1624 if (error != 0)
1625 return (error);
1626
1627 rt_notifydelete(rt, info);
1628
1629 /*
1630 * If the caller wants it, then it can have it,
1631 * but it's up to it to free the rtentry as we won't be
1632 * doing it.
1633 */
1634 if (ret_nrt) {
1635 *ret_nrt = rt;
1636 RT_UNLOCK(rt);
1637 } else
1638 RTFREE_LOCKED(rt);
1639 break;
1640 case RTM_RESOLVE:
1641 /*
1642 * resolve was only used for route cloning
1643 * here for compat
1644 */
1645 break;
1646 case RTM_ADD:
1647 if ((flags & RTF_GATEWAY) && !gateway)
1648 return (EINVAL);
1649 if (dst && gateway && (dst->sa_family != gateway->sa_family) &&
1650 (gateway->sa_family != AF_UNSPEC) && (gateway->sa_family != AF_LINK))
1651 return (EINVAL);
1652
1653 if (info->rti_ifa == NULL) {
1654 error = rt_getifa_fib(info, fibnum);
1655 if (error)
1656 return (error);
1657 } else
1658 ifa_ref(info->rti_ifa);
1659 ifa = info->rti_ifa;
1660 rt = uma_zalloc(V_rtzone, M_NOWAIT);
1661 if (rt == NULL) {
1662 ifa_free(ifa);
1663 return (ENOBUFS);
1664 }
1665 rt->rt_flags = RTF_UP | flags;
1666 rt->rt_fibnum = fibnum;
1667 /*
1668 * Add the gateway. Possibly re-malloc-ing the storage for it.
1669 */
1670 if ((error = rt_setgate(rt, dst, gateway)) != 0) {
1671 ifa_free(ifa);
1672 uma_zfree(V_rtzone, rt);
1673 return (error);
1674 }
1675
1676 /*
1677 * point to the (possibly newly malloc'd) dest address.
1678 */
1679 ndst = (struct sockaddr *)rt_key(rt);
1680
1681 /*
1682 * make sure it contains the value we want (masked if needed).
1683 */
1684 if (netmask) {
1685 rt_maskedcopy(dst, ndst, netmask);
1686 } else
1687 bcopy(dst, ndst, dst->sa_len);
1688
1689 /*
1690 * We use the ifa reference returned by rt_getifa_fib().
1691 * This moved from below so that rnh->rnh_addaddr() can
1692 * examine the ifa and ifa->ifa_ifp if it so desires.
1693 */
1694 rt->rt_ifa = ifa;
1695 rt->rt_ifp = ifa->ifa_ifp;
1696 rt->rt_weight = 1;
1697
1698 rt_setmetrics(info, rt);
1699
1700 RIB_WLOCK(rnh);
1701 RT_LOCK(rt);
1702#ifdef RADIX_MPATH
1703 /* do not permit exactly the same dst/mask/gw pair */
1704 if (rt_mpath_capable(rnh) &&
1705 rt_mpath_conflict(rnh, rt, netmask)) {
1706 RIB_WUNLOCK(rnh);
1707
1708 ifa_free(rt->rt_ifa);
1709 R_Free(rt_key(rt));
1710 uma_zfree(V_rtzone, rt);
1711 return (EEXIST);
1712 }
1713#endif
1714
1715#ifdef FLOWTABLE
1716 rt0 = rt_flowtable_check_route(rnh, info);
1717#endif /* FLOWTABLE */
1718
1719 /* XXX mtu manipulation will be done in rnh_addaddr -- itojun */
1720 rn = rnh->rnh_addaddr(ndst, netmask, &rnh->head, rt->rt_nodes);
1721
1722 rt_old = NULL;
1723 if (rn == NULL && (info->rti_flags & RTF_PINNED) != 0) {
1724
1725 /*
1726 * Force removal and re-try addition
1727 * TODO: better multipath&pinned support
1728 */
1729 struct sockaddr *info_dst = info->rti_info[RTAX_DST];
1730 info->rti_info[RTAX_DST] = ndst;
1731 /* Do not delete existing PINNED(interface) routes */
1732 info->rti_flags &= ~RTF_PINNED;
1733 rt_old = rt_unlinkrte(rnh, info, &error);
1734 info->rti_flags |= RTF_PINNED;
1735 info->rti_info[RTAX_DST] = info_dst;
1736 if (rt_old != NULL)
1737 rn = rnh->rnh_addaddr(ndst, netmask, &rnh->head,
1738 rt->rt_nodes);
1739 }
1740 RIB_WUNLOCK(rnh);
1741
1742 if (rt_old != NULL)
1743 RT_UNLOCK(rt_old);
1744
1745 /*
1746 * If it still failed to go into the tree,
1747 * then un-make it (this should be a function)
1748 */
1749 if (rn == NULL) {
1750 ifa_free(rt->rt_ifa);
1751 R_Free(rt_key(rt));
1752 uma_zfree(V_rtzone, rt);
1753#ifdef FLOWTABLE
1754 if (rt0 != NULL)
1755 RTFREE(rt0);
1756#endif
1757 return (EEXIST);
1758 }
1759#ifdef FLOWTABLE
1760 else if (rt0 != NULL) {
1761 flowtable_route_flush(dst->sa_family, rt0);
1762 RTFREE(rt0);
1763 }
1764#endif
1765
1766 if (rt_old != NULL) {
1767 rt_notifydelete(rt_old, info);
1768 RTFREE(rt_old);
1769 }
1770
1771 /*
1772 * If this protocol has something to add to this then
1773 * allow it to do that as well.
1774 */
1775 if (ifa->ifa_rtrequest)
1776 ifa->ifa_rtrequest(req, rt, info);
1777
1778 /*
1779 * actually return a resultant rtentry and
1780 * give the caller a single reference.
1781 */
1782 if (ret_nrt) {
1783 *ret_nrt = rt;
1784 RT_ADDREF(rt);
1785 }
1786 rnh->rnh_gen++; /* Routing table updated */
1787 RT_UNLOCK(rt);
1788 break;
1789 case RTM_CHANGE:
1790 RIB_WLOCK(rnh);
1791 error = rtrequest1_fib_change(rnh, info, ret_nrt, fibnum);
1792 RIB_WUNLOCK(rnh);
1793 break;
1794 default:
1795 error = EOPNOTSUPP;
1796 }
1797
1798 return (error);
1799}
1800
1801#undef dst
1802#undef gateway
1803#undef netmask
1804#undef ifaaddr
1805#undef ifpaddr
1806#undef flags
1807
1808static int
1809rtrequest1_fib_change(struct rib_head *rnh, struct rt_addrinfo *info,
1810 struct rtentry **ret_nrt, u_int fibnum)
1811{
1812 struct rtentry *rt = NULL;
1813 int error = 0;
1814 int free_ifa = 0;
1815 int family, mtu;
1816 struct if_mtuinfo ifmtu;
1817
1818 rt = (struct rtentry *)rnh->rnh_lookup(info->rti_info[RTAX_DST],
1819 info->rti_info[RTAX_NETMASK], &rnh->head);
1820
1821 if (rt == NULL)
1822 return (ESRCH);
1823
1824#ifdef RADIX_MPATH
1825 /*
1826 * If we got multipath routes,
1827 * we require users to specify a matching RTAX_GATEWAY.
1828 */
1829 if (rt_mpath_capable(rnh)) {
1830 rt = rt_mpath_matchgate(rt, info->rti_info[RTAX_GATEWAY]);
1831 if (rt == NULL)
1832 return (ESRCH);
1833 }
1834#endif
1835
1836 RT_LOCK(rt);
1837
1838 rt_setmetrics(info, rt);
1839
1840 /*
1841 * New gateway could require new ifaddr, ifp;
1842 * flags may also be different; ifp may be specified
1843 * by ll sockaddr when protocol address is ambiguous
1844 */
1845 if (((rt->rt_flags & RTF_GATEWAY) &&
1846 info->rti_info[RTAX_GATEWAY] != NULL) ||
1847 info->rti_info[RTAX_IFP] != NULL ||
1848 (info->rti_info[RTAX_IFA] != NULL &&
1849 !sa_equal(info->rti_info[RTAX_IFA], rt->rt_ifa->ifa_addr))) {
1850 /*
1851 * XXX: Temporarily set RTF_RNH_LOCKED flag in the rti_flags
1852 * to avoid rlock in the ifa_ifwithroute().
1853 */
1854 info->rti_flags |= RTF_RNH_LOCKED;
1855 error = rt_getifa_fib(info, fibnum);
1856 info->rti_flags &= ~RTF_RNH_LOCKED;
1857 if (info->rti_ifa != NULL)
1858 free_ifa = 1;
1859
1860 if (error != 0)
1861 goto bad;
1862 }
1863
1864 /* Check if outgoing interface has changed */
1865 if (info->rti_ifa != NULL && info->rti_ifa != rt->rt_ifa &&
1866 rt->rt_ifa != NULL && rt->rt_ifa->ifa_rtrequest != NULL) {
1867 rt->rt_ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1868 ifa_free(rt->rt_ifa);
1869 }
1870 /* Update gateway address */
1871 if (info->rti_info[RTAX_GATEWAY] != NULL) {
1872 error = rt_setgate(rt, rt_key(rt), info->rti_info[RTAX_GATEWAY]);
1873 if (error != 0)
1874 goto bad;
1875
1876 rt->rt_flags &= ~RTF_GATEWAY;
1877 rt->rt_flags |= (RTF_GATEWAY & info->rti_flags);
1878 }
1879
1880 if (info->rti_ifa != NULL && info->rti_ifa != rt->rt_ifa) {
1881 ifa_ref(info->rti_ifa);
1882 rt->rt_ifa = info->rti_ifa;
1883 rt->rt_ifp = info->rti_ifp;
1884 }
1885 /* Allow some flags to be toggled on change. */
1886 rt->rt_flags &= ~RTF_FMASK;
1887 rt->rt_flags |= info->rti_flags & RTF_FMASK;
1888
1889 if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest != NULL)
1890 rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, info);
1891
1892 /* Alter route MTU if necessary */
1893 if (rt->rt_ifp != NULL) {
1894 family = info->rti_info[RTAX_DST]->sa_family;
1895 mtu = if_getmtu_family(rt->rt_ifp, family);
1896 /* Set default MTU */
1897 if (rt->rt_mtu == 0)
1898 rt->rt_mtu = mtu;
1899 if (rt->rt_mtu != mtu) {
1900 /* Check if we really need to update */
1901 ifmtu.ifp = rt->rt_ifp;
1902 ifmtu.mtu = mtu;
1903 if_updatemtu_cb(rt->rt_nodes, &ifmtu);
1904 }
1905 }
1906
1907 if (ret_nrt) {
1908 *ret_nrt = rt;
1909 RT_ADDREF(rt);
1910 }
1911bad:
1912 RT_UNLOCK(rt);
1913 if (free_ifa != 0)
1914 ifa_free(info->rti_ifa);
1915 return (error);
1916}
1917
1918static void
1919rt_setmetrics(const struct rt_addrinfo *info, struct rtentry *rt)
1920{
1921
1922 if (info->rti_mflags & RTV_MTU) {
1923 if (info->rti_rmx->rmx_mtu != 0) {
1924
1925 /*
1926 * MTU was explicitly provided by user.
1927 * Keep it.
1928 */
1929 rt->rt_flags |= RTF_FIXEDMTU;
1930 } else {
1931
1932 /*
1933 * User explicitly sets MTU to 0.
1934 * Assume rollback to default.
1935 */
1936 rt->rt_flags &= ~RTF_FIXEDMTU;
1937 }
1938 rt->rt_mtu = info->rti_rmx->rmx_mtu;
1939 }
1940 if (info->rti_mflags & RTV_WEIGHT)
1941 rt->rt_weight = info->rti_rmx->rmx_weight;
1942 /* Kernel -> userland timebase conversion. */
1943 if (info->rti_mflags & RTV_EXPIRE)
1944 rt->rt_expire = info->rti_rmx->rmx_expire ?
1945 info->rti_rmx->rmx_expire - time_second + time_uptime : 0;
1946}
1947
1948int
1949rt_setgate(struct rtentry *rt, struct sockaddr *dst, struct sockaddr *gate)
1950{
1951 /* XXX dst may be overwritten, can we move this to below */
1952 int dlen = SA_SIZE(dst), glen = SA_SIZE(gate);
1953
1954 /*
1955 * Prepare to store the gateway in rt->rt_gateway.
1956 * Both dst and gateway are stored one after the other in the same
1957 * malloc'd chunk. If we have room, we can reuse the old buffer,
1958 * rt_gateway already points to the right place.
1959 * Otherwise, malloc a new block and update the 'dst' address.
1960 */
1961 if (rt->rt_gateway == NULL || glen > SA_SIZE(rt->rt_gateway)) {
1962 caddr_t new;
1963
1964 R_Malloc(new, caddr_t, dlen + glen);
1965 if (new == NULL)
1966 return ENOBUFS;
1967 /*
1968 * XXX note, we copy from *dst and not *rt_key(rt) because
1969 * rt_setgate() can be called to initialize a newly
1970 * allocated route entry, in which case rt_key(rt) == NULL
1971 * (and also rt->rt_gateway == NULL).
1972 * Free()/free() handle a NULL argument just fine.
1973 */
1974 bcopy(dst, new, dlen);
1975 R_Free(rt_key(rt)); /* free old block, if any */
1976 rt_key(rt) = (struct sockaddr *)new;
1977 rt->rt_gateway = (struct sockaddr *)(new + dlen);
1978 }
1979
1980 /*
1981 * Copy the new gateway value into the memory chunk.
1982 */
1983 bcopy(gate, rt->rt_gateway, glen);
1984
1985 return (0);
1986}
1987
1988void
1989rt_maskedcopy(struct sockaddr *src, struct sockaddr *dst, struct sockaddr *netmask)
1990{
1991 u_char *cp1 = (u_char *)src;
1992 u_char *cp2 = (u_char *)dst;
1993 u_char *cp3 = (u_char *)netmask;
1994 u_char *cplim = cp2 + *cp3;
1995 u_char *cplim2 = cp2 + *cp1;
1996
1997 *cp2++ = *cp1++; *cp2++ = *cp1++; /* copies sa_len & sa_family */
1998 cp3 += 2;
1999 if (cplim > cplim2)
2000 cplim = cplim2;
2001 while (cp2 < cplim)
2002 *cp2++ = *cp1++ & *cp3++;
2003 if (cp2 < cplim2)
2004 bzero((caddr_t)cp2, (unsigned)(cplim2 - cp2));
2005}
2006
2007/*
2008 * Set up a routing table entry, normally
2009 * for an interface.
2010 */
2011#define _SOCKADDR_TMPSIZE 128 /* Not too big.. kernel stack size is limited */
2012static inline int
2013rtinit1(struct ifaddr *ifa, int cmd, int flags, int fibnum)
2014{
2015 struct sockaddr *dst;
2016 struct sockaddr *netmask;
2017 struct rtentry *rt = NULL;
2018 struct rt_addrinfo info;
2019 int error = 0;
2020 int startfib, endfib;
2021 char tempbuf[_SOCKADDR_TMPSIZE];
2022 int didwork = 0;
2023 int a_failure = 0;
2024 static struct sockaddr_dl null_sdl = {sizeof(null_sdl), AF_LINK};
2025 struct rib_head *rnh;
2026
2027 if (flags & RTF_HOST) {
2028 dst = ifa->ifa_dstaddr;
2029 netmask = NULL;
2030 } else {
2031 dst = ifa->ifa_addr;
2032 netmask = ifa->ifa_netmask;
2033 }
2034 if (dst->sa_len == 0)
2035 return(EINVAL);
2036 switch (dst->sa_family) {
2037 case AF_INET6:
2038 case AF_INET:
2039 /* We support multiple FIBs. */
2040 break;
2041 default:
2042 fibnum = RT_DEFAULT_FIB;
2043 break;
2044 }
2045 if (fibnum == RT_ALL_FIBS) {
2046 if (V_rt_add_addr_allfibs == 0 && cmd == (int)RTM_ADD)
2047 startfib = endfib = ifa->ifa_ifp->if_fib;
2048 else {
2049 startfib = 0;
2050 endfib = rt_numfibs - 1;
2051 }
2052 } else {
2053 KASSERT((fibnum < rt_numfibs), ("rtinit1: bad fibnum"));
2054 startfib = fibnum;
2055 endfib = fibnum;
2056 }
2057
2058 /*
2059 * If it's a delete, check that if it exists,
2060 * it's on the correct interface or we might scrub
2061 * a route to another ifa which would
2062 * be confusing at best and possibly worse.
2063 */
2064 if (cmd == RTM_DELETE) {
2065 /*
2066 * It's a delete, so it should already exist..
2067 * If it's a net, mask off the host bits
2068 * (Assuming we have a mask)
2069 * XXX this is kinda inet specific..
2070 */
2071 if (netmask != NULL) {
2072 rt_maskedcopy(dst, (struct sockaddr *)tempbuf, netmask);
2073 dst = (struct sockaddr *)tempbuf;
2074 }
2075 }
2076 /*
2077 * Now go through all the requested tables (fibs) and do the
2078 * requested action. Realistically, this will either be fib 0
2079 * for protocols that don't do multiple tables or all the
2080 * tables for those that do.
2081 */
2082 for ( fibnum = startfib; fibnum <= endfib; fibnum++) {
2083 if (cmd == RTM_DELETE) {
2084 struct radix_node *rn;
2085 /*
2086 * Look up an rtentry that is in the routing tree and
2087 * contains the correct info.
2088 */
2089 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
2090 if (rnh == NULL)
2091 /* this table doesn't exist but others might */
2092 continue;
2093 RIB_RLOCK(rnh);
2094 rn = rnh->rnh_lookup(dst, netmask, &rnh->head);
2095#ifdef RADIX_MPATH
2096 if (rt_mpath_capable(rnh)) {
2097
2098 if (rn == NULL)
2099 error = ESRCH;
2100 else {
2101 rt = RNTORT(rn);
2102 /*
2103 * for interface route the
2104 * rt->rt_gateway is sockaddr_intf
2105 * for cloning ARP entries, so
2106 * rt_mpath_matchgate must use the
2107 * interface address
2108 */
2109 rt = rt_mpath_matchgate(rt,
2110 ifa->ifa_addr);
2111 if (rt == NULL)
2112 error = ESRCH;
2113 }
2114 }
2115#endif
2116 error = (rn == NULL ||
2117 (rn->rn_flags & RNF_ROOT) ||
2118 RNTORT(rn)->rt_ifa != ifa);
2119 RIB_RUNLOCK(rnh);
2120 if (error) {
2121 /* this is only an error if bad on ALL tables */
2122 continue;
2123 }
2124 }
2125 /*
2126 * Do the actual request
2127 */
2128 bzero((caddr_t)&info, sizeof(info));
2129 info.rti_ifa = ifa;
2130 info.rti_flags = flags |
2131 (ifa->ifa_flags & ~IFA_RTSELF) | RTF_PINNED;
2132 info.rti_info[RTAX_DST] = dst;
2133 /*
2134 * doing this for compatibility reasons
2135 */
2136 if (cmd == RTM_ADD)
2137 info.rti_info[RTAX_GATEWAY] =
2138 (struct sockaddr *)&null_sdl;
2139 else
2140 info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
2141 info.rti_info[RTAX_NETMASK] = netmask;
2142 error = rtrequest1_fib(cmd, &info, &rt, fibnum);
2143
2144 if (error == 0 && rt != NULL) {
2145 /*
2146 * notify any listening routing agents of the change
2147 */
2148 RT_LOCK(rt);
2149#ifdef RADIX_MPATH
2150 /*
2151 * in case address alias finds the first address
2152 * e.g. ifconfig bge0 192.0.2.246/24
2153 * e.g. ifconfig bge0 192.0.2.247/24
2154 * the address set in the route is 192.0.2.246
2155 * so we need to replace it with 192.0.2.247
2156 */
2157 if (memcmp(rt->rt_ifa->ifa_addr,
2158 ifa->ifa_addr, ifa->ifa_addr->sa_len)) {
2159 ifa_free(rt->rt_ifa);
2160 ifa_ref(ifa);
2161 rt->rt_ifp = ifa->ifa_ifp;
2162 rt->rt_ifa = ifa;
2163 }
2164#endif
2165 /*
2166 * doing this for compatibility reasons
2167 */
2168 if (cmd == RTM_ADD) {
2169 ((struct sockaddr_dl *)rt->rt_gateway)->sdl_type =
2170 rt->rt_ifp->if_type;
2171 ((struct sockaddr_dl *)rt->rt_gateway)->sdl_index =
2172 rt->rt_ifp->if_index;
2173 }
2174 RT_ADDREF(rt);
2175 RT_UNLOCK(rt);
2176 rt_newaddrmsg_fib(cmd, ifa, error, rt, fibnum);
2177 RT_LOCK(rt);
2178 RT_REMREF(rt);
2179 if (cmd == RTM_DELETE) {
2180 /*
2181 * If we are deleting, and we found an entry,
2182 * then it's been removed from the tree..
2183 * now throw it away.
2184 */
2185 RTFREE_LOCKED(rt);
2186 } else {
2187 if (cmd == RTM_ADD) {
2188 /*
2189 * We just wanted to add it..
2190 * we don't actually need a reference.
2191 */
2192 RT_REMREF(rt);
2193 }
2194 RT_UNLOCK(rt);
2195 }
2196 didwork = 1;
2197 }
2198 if (error)
2199 a_failure = error;
2200 }
2201 if (cmd == RTM_DELETE) {
2202 if (didwork) {
2203 error = 0;
2204 } else {
2205 /* we only give an error if it wasn't in any table */
2206 error = ((flags & RTF_HOST) ?
2207 EHOSTUNREACH : ENETUNREACH);
2208 }
2209 } else {
2210 if (a_failure) {
2211 /* return an error if any of them failed */
2212 error = a_failure;
2213 }
2214 }
2215 return (error);
2216}
2217
2218/*
2219 * Set up a routing table entry, normally
2220 * for an interface.
2221 */
2222int
2223rtinit(struct ifaddr *ifa, int cmd, int flags)
2224{
2225 struct sockaddr *dst;
2226 int fib = RT_DEFAULT_FIB;
2227
2228 if (flags & RTF_HOST) {
2229 dst = ifa->ifa_dstaddr;
2230 } else {
2231 dst = ifa->ifa_addr;
2232 }
2233
2234 switch (dst->sa_family) {
2235 case AF_INET6:
2236 case AF_INET:
2237 /* We do support multiple FIBs. */
2238 fib = RT_ALL_FIBS;
2239 break;
2240 }
2241 return (rtinit1(ifa, cmd, flags, fib));
2242}
2243
2244/*
2245 * Announce interface address arrival/withdraw
2246 * Returns 0 on success.
2247 */
2248int
2249rt_addrmsg(int cmd, struct ifaddr *ifa, int fibnum)
2250{
2251
2252 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2253 ("unexpected cmd %d", cmd));
2254
2255 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2256 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2257
2258#if defined(INET) || defined(INET6)
2259#ifdef SCTP
2260 /*
2261 * notify the SCTP stack
2262 * this will only get called when an address is added/deleted
2263 * XXX pass the ifaddr struct instead if ifa->ifa_addr...
2264 */
2265 sctp_addr_change(ifa, cmd);
2266#endif /* SCTP */
2267#endif
2268 return (rtsock_addrmsg(cmd, ifa, fibnum));
2269}
2270
2271/*
2272 * Announce route addition/removal.
2273 * Users of this function MUST validate input data BEFORE calling.
2274 * However we have to be able to handle invalid data:
2275 * if some userland app sends us "invalid" route message (invalid mask,
2276 * no dst, wrong address families, etc...) we need to pass it back
2277 * to app (and any other rtsock consumers) with rtm_errno field set to
2278 * non-zero value.
2279 * Returns 0 on success.
2280 */
2281int
2282rt_routemsg(int cmd, struct ifnet *ifp, int error, struct rtentry *rt,
2283 int fibnum)
2284{
2285
2286 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2287 ("unexpected cmd %d", cmd));
2288
2289 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2290 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2291
2292 KASSERT(rt_key(rt) != NULL, (":%s: rt_key must be supplied", __func__));
2293
2294 return (rtsock_routemsg(cmd, ifp, error, rt, fibnum));
2295}
2296
2297void
2298rt_newaddrmsg(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt)
2299{
2300
2301 rt_newaddrmsg_fib(cmd, ifa, error, rt, RT_ALL_FIBS);
2302}
2303
2304/*
2305 * This is called to generate messages from the routing socket
2306 * indicating a network interface has had addresses associated with it.
2307 */
2308void
2309rt_newaddrmsg_fib(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt,
2310 int fibnum)
2311{
2312
2313 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2314 ("unexpected cmd %u", cmd));
2315 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2316 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2317
2318 if (cmd == RTM_ADD) {
2319 rt_addrmsg(cmd, ifa, fibnum);
2320 if (rt != NULL)
2321 rt_routemsg(cmd, ifa->ifa_ifp, error, rt, fibnum);
2322 } else {
2323 if (rt != NULL)
2324 rt_routemsg(cmd, ifa->ifa_ifp, error, rt, fibnum);
2325 rt_addrmsg(cmd, ifa, fibnum);
2326 }
2327}
2328
|