H A D | route.c | 107 int strict); 415 const struct sk_buff *skb, int strict) in fib6_select_path() 452 if (rt6_score_route(nh, sibling->fib6_flags, oif, strict) < 0) in fib6_select_path() 711 int strict) in rt6_score_route() 718 if (!m && (strict & RT6_LOOKUP_F_IFACE)) in rt6_score_route() 723 if ((strict & RT6_LOOKUP_F_REACHABLE) && in rt6_score_route() 733 int oif, int strict, int *mpri, bool *do_rr) in find_match() 744 !(strict & RT6_LOOKUP_F_IGNORE_LINKSTATE)) in find_match() 747 m = rt6_score_route(nh, fib6_flags, oif, strict); in find_match() 755 if (strict in find_match() 413 fib6_select_path(const struct net *net, struct fib6_result *res, struct flowi6 *fl6, int oif, bool have_oif_match, const struct sk_buff *skb, int strict) fib6_select_path() argument 710 rt6_score_route(const struct fib6_nh *nh, u32 fib6_flags, int oif, int strict) rt6_score_route() argument 732 find_match(struct fib6_nh *nh, u32 fib6_flags, int oif, int strict, int *mpri, bool *do_rr) find_match() argument 771 int strict; global() member 786 __find_rr_leaf(struct fib6_info *f6i_start, struct fib6_info *nomatch, u32 metric, struct fib6_result *res, struct fib6_info **cont, int oif, int strict, bool *do_rr, int *mpri) __find_rr_leaf() argument 843 find_rr_leaf(struct fib6_node *fn, struct fib6_info *leaf, struct fib6_info *rr_head, int oif, int strict, bool *do_rr, struct fib6_result *res) find_rr_leaf() argument 864 rt6_select(struct net *net, struct fib6_node *fn, int oif, struct fib6_result *res, int strict) rt6_select() argument 1263 rt6_lookup(struct net *net, const struct in6_addr *daddr, const struct in6_addr *saddr, int oif, const struct sk_buff *skb, int strict) rt6_lookup() argument 2174 fib6_table_lookup(struct net *net, struct fib6_table *table, int oif, struct flowi6 *fl6, struct fib6_result *res, int strict) fib6_table_lookup() argument 2207 int strict = 0; ip6_pol_route() local [all...] |