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(&ip6_null_entry.u.dst);
47 return &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 pol_lookup_t lookup = arg->lookup_ptr;
57 switch (rule->action) {
60 case FR_ACT_UNREACHABLE:
64 case FR_ACT_BLACKHOLE:
65 rt = &ip6_blk_hole_entry;
68 rt = &ip6_prohibit_entry;
72 table = fib6_get_table(rule->fr_net, rule->table);
74 rt = lookup(table, flp, flags);
76 if (rt != &ip6_null_entry) {
77 struct fib6_rule *r = (struct fib6_rule *)rule;
80 * If we need to find a source address for this traffic,
81 * we check the result if it meets requirement of the rule.
83 if ((rule->flags & FIB_RULE_FIND_SADDR) &&
84 r->src.plen && !(flags & RT6_LOOKUP_F_HAS_SADDR)) {
85 struct in6_addr saddr;
86 if (ipv6_dev_get_saddr(ip6_dst_idev(&rt->u.dst)->dev,
87 &flp->fl6_dst, &saddr))
89 if (!ipv6_prefix_equal(&saddr, &r->src.addr,
92 ipv6_addr_copy(&flp->fl6_src, &saddr);
97 dst_release(&rt->u.dst);
102 dst_hold(&rt->u.dst);
105 return rt == NULL ? -EAGAIN : 0;
109 static int fib6_rule_match(struct fib_rule *rule, struct flowi *fl, int flags)
111 struct fib6_rule *r = (struct fib6_rule *) rule;
114 !ipv6_prefix_equal(&fl->fl6_dst, &r->dst.addr, r->dst.plen))
118 * If FIB_RULE_FIND_SADDR is set and we do not have a
119 * source address for the traffic, we defer check for
123 if (flags & RT6_LOOKUP_F_HAS_SADDR) {
124 if (!ipv6_prefix_equal(&fl->fl6_src, &r->src.addr,
127 } else if (!(r->common.flags & FIB_RULE_FIND_SADDR))
131 if (r->tclass && r->tclass != ((ntohl(fl->fl6_flowlabel) >> 20) & 0xff))
137 static const struct nla_policy fib6_rule_policy[FRA_MAX+1] = {
141 static int fib6_rule_configure(struct fib_rule *rule, struct sk_buff *skb,
142 struct nlmsghdr *nlh, struct fib_rule_hdr *frh,
146 struct net *net = skb->sk->sk_net;
147 struct fib6_rule *rule6 = (struct fib6_rule *) rule;
149 if (rule->action == FR_ACT_TO_TBL) {
150 if (rule->table == RT6_TABLE_UNSPEC)
153 if (fib6_new_table(net, rule->table) == NULL) {
160 nla_memcpy(&rule6->src.addr, tb[FRA_SRC],
161 sizeof(struct in6_addr));
164 nla_memcpy(&rule6->dst.addr, tb[FRA_DST],
165 sizeof(struct in6_addr));
167 rule6->src.plen = frh->src_len;
168 rule6->dst.plen = frh->dst_len;
169 rule6->tclass = frh->tos;
176 static int fib6_rule_compare(struct fib_rule *rule, struct fib_rule_hdr *frh,
179 struct fib6_rule *rule6 = (struct fib6_rule *) rule;
181 if (frh->src_len && (rule6->src.plen != frh->src_len))
184 if (frh->dst_len && (rule6->dst.plen != frh->dst_len))
187 if (frh->tos && (rule6->tclass != frh->tos))
191 nla_memcmp(tb[FRA_SRC], &rule6->src.addr, sizeof(struct in6_addr)))
195 nla_memcmp(tb[FRA_DST], &rule6->dst.addr, sizeof(struct in6_addr)))
201 static int fib6_rule_fill(struct fib_rule *rule, struct sk_buff *skb,
202 struct nlmsghdr *nlh, struct fib_rule_hdr *frh)
204 struct fib6_rule *rule6 = (struct fib6_rule *) rule;
206 frh->family = AF_INET6;
207 frh->dst_len = rule6->dst.plen;
208 frh->src_len = rule6->src.plen;
209 frh->tos = rule6->tclass;
212 NLA_PUT(skb, FRA_DST, sizeof(struct in6_addr),
216 NLA_PUT(skb, FRA_SRC, sizeof(struct in6_addr),
225 static u32 fib6_rule_default_pref(struct fib_rules_ops *ops)
230 static size_t fib6_rule_nlmsg_payload(struct fib_rule *rule)
232 return nla_total_size(16) /* dst */
233 + nla_total_size(16); /* src */
236 static struct fib_rules_ops fib6_rules_ops_template = {
238 .rule_size = sizeof(struct fib6_rule),
239 .addr_size = sizeof(struct in6_addr),
240 .action = fib6_rule_action,
241 .match = fib6_rule_match,
242 .configure = fib6_rule_configure,
243 .compare = fib6_rule_compare,
244 .fill = fib6_rule_fill,
245 .default_pref = fib6_rule_default_pref,
246 .nlmsg_payload = fib6_rule_nlmsg_payload,
247 .nlgroup = RTNLGRP_IPV6_RULE,
248 .policy = fib6_rule_policy,
249 .owner = THIS_MODULE,
250 .fro_net = &init_net,
253 static int fib6_rules_net_init(struct net *net)
257 net->ipv6.fib6_rules_ops = kmemdup(&fib6_rules_ops_template,
258 sizeof(*net->ipv6.fib6_rules_ops),
260 if (!net->ipv6.fib6_rules_ops)
263 net->ipv6.fib6_rules_ops->fro_net = net;
264 INIT_LIST_HEAD(&net->ipv6.fib6_rules_ops->rules_list);
266 err = fib_default_rule_add(net->ipv6.fib6_rules_ops, 0,
267 RT6_TABLE_LOCAL, FIB_RULE_PERMANENT);
269 goto out_fib6_rules_ops;
271 err = fib_default_rule_add(net->ipv6.fib6_rules_ops,
272 0x7FFE, RT6_TABLE_MAIN, 0);
274 goto out_fib6_default_rule_add;
276 err = fib_rules_register(net->ipv6.fib6_rules_ops);
278 goto out_fib6_default_rule_add;
282 out_fib6_default_rule_add:
283 fib_rules_cleanup_ops(net->ipv6.fib6_rules_ops);
285 kfree(net->ipv6.fib6_rules_ops);
289 static void fib6_rules_net_exit(struct net *net)
291 fib_rules_unregister(net->ipv6.fib6_rules_ops);
292 kfree(net->ipv6.fib6_rules_ops);
295 static struct pernet_operations fib6_rules_net_ops = {
296 .init = fib6_rules_net_init,
297 .exit = fib6_rules_net_exit,
300 int __init fib6_rules_init(void)
302 return register_pernet_subsys(&fib6_rules_net_ops);
306 void fib6_rules_cleanup(void)
308 return unregister_pernet_subsys(&fib6_rules_net_ops);