2 * net/ipv6/fib6_rules.c IPv6 Routing Policy Rules
4 * Copyright (C)2003-2006 Helsinki University of Technology
5 * Copyright (C)2003-2006 USAGI/WIDE Project
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License as
9 * published by the Free Software Foundation, version 2.
12 * Thomas Graf <tgraf@suug.ch>
13 * Ville Nuorvala <vnuorval@tcs.hut.fi>
16 #include <linux/netdevice.h>
18 #include <net/fib_rules.h>
20 #include <net/addrconf.h>
21 #include <net/ip6_route.h>
22 #include <net/netlink.h>
26 struct fib_rule common;
32 struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi *fl,
33 int flags, pol_lookup_t lookup)
35 struct fib_lookup_arg arg = {
39 fib_rules_lookup(net->ipv6.fib6_rules_ops, fl, flags, &arg);
41 fib_rule_put(arg.rule);
46 dst_hold(&net->ipv6.ip6_null_entry->u.dst);
47 return &net->ipv6.ip6_null_entry->u.dst;
50 static int fib6_rule_action(struct fib_rule *rule, struct flowi *flp,
51 int flags, struct fib_lookup_arg *arg)
53 struct rt6_info *rt = NULL;
54 struct fib6_table *table;
55 struct net *net = rule->fr_net;
56 pol_lookup_t lookup = arg->lookup_ptr;
58 switch (rule->action) {
61 case FR_ACT_UNREACHABLE:
62 rt = net->ipv6.ip6_null_entry;
65 case FR_ACT_BLACKHOLE:
66 rt = net->ipv6.ip6_blk_hole_entry;
69 rt = net->ipv6.ip6_prohibit_entry;
73 table = fib6_get_table(net, rule->table);
75 rt = lookup(net, table, flp, flags);
77 if (rt != net->ipv6.ip6_null_entry) {
78 struct fib6_rule *r = (struct fib6_rule *)rule;
81 * If we need to find a source address for this traffic,
82 * we check the result if it meets requirement of the rule.
84 if ((rule->flags & FIB_RULE_FIND_SADDR) &&
85 r->src.plen && !(flags & RT6_LOOKUP_F_HAS_SADDR)) {
86 struct in6_addr saddr;
87 if (ipv6_dev_get_saddr(ip6_dst_idev(&rt->u.dst)->dev,
88 &flp->fl6_dst, &saddr))
90 if (!ipv6_prefix_equal(&saddr, &r->src.addr,
93 ipv6_addr_copy(&flp->fl6_src, &saddr);
98 dst_release(&rt->u.dst);
103 dst_hold(&rt->u.dst);
106 return rt == NULL ? -EAGAIN : 0;
110 static int fib6_rule_match(struct fib_rule *rule, struct flowi *fl, int flags)
112 struct fib6_rule *r = (struct fib6_rule *) rule;
115 !ipv6_prefix_equal(&fl->fl6_dst, &r->dst.addr, r->dst.plen))
119 * If FIB_RULE_FIND_SADDR is set and we do not have a
120 * source address for the traffic, we defer check for
124 if (flags & RT6_LOOKUP_F_HAS_SADDR) {
125 if (!ipv6_prefix_equal(&fl->fl6_src, &r->src.addr,
128 } else if (!(r->common.flags & FIB_RULE_FIND_SADDR))
132 if (r->tclass && r->tclass != ((ntohl(fl->fl6_flowlabel) >> 20) & 0xff))
138 static const struct nla_policy fib6_rule_policy[FRA_MAX+1] = {
142 static int fib6_rule_configure(struct fib_rule *rule, struct sk_buff *skb,
143 struct nlmsghdr *nlh, struct fib_rule_hdr *frh,
147 struct net *net = skb->sk->sk_net;
148 struct fib6_rule *rule6 = (struct fib6_rule *) rule;
150 if (rule->action == FR_ACT_TO_TBL) {
151 if (rule->table == RT6_TABLE_UNSPEC)
154 if (fib6_new_table(net, rule->table) == NULL) {
161 nla_memcpy(&rule6->src.addr, tb[FRA_SRC],
162 sizeof(struct in6_addr));
165 nla_memcpy(&rule6->dst.addr, tb[FRA_DST],
166 sizeof(struct in6_addr));
168 rule6->src.plen = frh->src_len;
169 rule6->dst.plen = frh->dst_len;
170 rule6->tclass = frh->tos;
177 static int fib6_rule_compare(struct fib_rule *rule, struct fib_rule_hdr *frh,
180 struct fib6_rule *rule6 = (struct fib6_rule *) rule;
182 if (frh->src_len && (rule6->src.plen != frh->src_len))
185 if (frh->dst_len && (rule6->dst.plen != frh->dst_len))
188 if (frh->tos && (rule6->tclass != frh->tos))
192 nla_memcmp(tb[FRA_SRC], &rule6->src.addr, sizeof(struct in6_addr)))
196 nla_memcmp(tb[FRA_DST], &rule6->dst.addr, sizeof(struct in6_addr)))
202 static int fib6_rule_fill(struct fib_rule *rule, struct sk_buff *skb,
203 struct nlmsghdr *nlh, struct fib_rule_hdr *frh)
205 struct fib6_rule *rule6 = (struct fib6_rule *) rule;
207 frh->family = AF_INET6;
208 frh->dst_len = rule6->dst.plen;
209 frh->src_len = rule6->src.plen;
210 frh->tos = rule6->tclass;
213 NLA_PUT(skb, FRA_DST, sizeof(struct in6_addr),
217 NLA_PUT(skb, FRA_SRC, sizeof(struct in6_addr),
226 static u32 fib6_rule_default_pref(struct fib_rules_ops *ops)
231 static size_t fib6_rule_nlmsg_payload(struct fib_rule *rule)
233 return nla_total_size(16) /* dst */
234 + nla_total_size(16); /* src */
237 static struct fib_rules_ops fib6_rules_ops_template = {
239 .rule_size = sizeof(struct fib6_rule),
240 .addr_size = sizeof(struct in6_addr),
241 .action = fib6_rule_action,
242 .match = fib6_rule_match,
243 .configure = fib6_rule_configure,
244 .compare = fib6_rule_compare,
245 .fill = fib6_rule_fill,
246 .default_pref = fib6_rule_default_pref,
247 .nlmsg_payload = fib6_rule_nlmsg_payload,
248 .nlgroup = RTNLGRP_IPV6_RULE,
249 .policy = fib6_rule_policy,
250 .owner = THIS_MODULE,
251 .fro_net = &init_net,
254 static int fib6_rules_net_init(struct net *net)
258 net->ipv6.fib6_rules_ops = kmemdup(&fib6_rules_ops_template,
259 sizeof(*net->ipv6.fib6_rules_ops),
261 if (!net->ipv6.fib6_rules_ops)
264 net->ipv6.fib6_rules_ops->fro_net = net;
265 INIT_LIST_HEAD(&net->ipv6.fib6_rules_ops->rules_list);
267 err = fib_default_rule_add(net->ipv6.fib6_rules_ops, 0,
268 RT6_TABLE_LOCAL, FIB_RULE_PERMANENT);
270 goto out_fib6_rules_ops;
272 err = fib_default_rule_add(net->ipv6.fib6_rules_ops,
273 0x7FFE, RT6_TABLE_MAIN, 0);
275 goto out_fib6_default_rule_add;
277 err = fib_rules_register(net->ipv6.fib6_rules_ops);
279 goto out_fib6_default_rule_add;
283 out_fib6_default_rule_add:
284 fib_rules_cleanup_ops(net->ipv6.fib6_rules_ops);
286 kfree(net->ipv6.fib6_rules_ops);
290 static void fib6_rules_net_exit(struct net *net)
292 fib_rules_unregister(net->ipv6.fib6_rules_ops);
293 kfree(net->ipv6.fib6_rules_ops);
296 static struct pernet_operations fib6_rules_net_ops = {
297 .init = fib6_rules_net_init,
298 .exit = fib6_rules_net_exit,
301 int __init fib6_rules_init(void)
303 return register_pernet_subsys(&fib6_rules_net_ops);
307 void fib6_rules_cleanup(void)
309 return unregister_pernet_subsys(&fib6_rules_net_ops);