fib6_rules.c 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321
  1. /*
  2. * net/ipv6/fib6_rules.c IPv6 Routing Policy Rules
  3. *
  4. * Copyright (C)2003-2006 Helsinki University of Technology
  5. * Copyright (C)2003-2006 USAGI/WIDE Project
  6. *
  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.
  10. *
  11. * Authors
  12. * Thomas Graf <tgraf@suug.ch>
  13. * Ville Nuorvala <vnuorval@tcs.hut.fi>
  14. */
  15. #include <linux/netdevice.h>
  16. #include <net/fib_rules.h>
  17. #include <net/ipv6.h>
  18. #include <net/addrconf.h>
  19. #include <net/ip6_route.h>
  20. #include <net/netlink.h>
  21. struct fib6_rule
  22. {
  23. struct fib_rule common;
  24. struct rt6key src;
  25. struct rt6key dst;
  26. u8 tclass;
  27. };
  28. struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi *fl,
  29. int flags, pol_lookup_t lookup)
  30. {
  31. struct fib_lookup_arg arg = {
  32. .lookup_ptr = lookup,
  33. };
  34. fib_rules_lookup(net->ipv6.fib6_rules_ops, fl, flags, &arg);
  35. if (arg.rule)
  36. fib_rule_put(arg.rule);
  37. if (arg.result)
  38. return arg.result;
  39. dst_hold(&net->ipv6.ip6_null_entry->u.dst);
  40. return &net->ipv6.ip6_null_entry->u.dst;
  41. }
  42. static int fib6_rule_action(struct fib_rule *rule, struct flowi *flp,
  43. int flags, struct fib_lookup_arg *arg)
  44. {
  45. struct rt6_info *rt = NULL;
  46. struct fib6_table *table;
  47. struct net *net = rule->fr_net;
  48. pol_lookup_t lookup = arg->lookup_ptr;
  49. switch (rule->action) {
  50. case FR_ACT_TO_TBL:
  51. break;
  52. case FR_ACT_UNREACHABLE:
  53. rt = net->ipv6.ip6_null_entry;
  54. goto discard_pkt;
  55. default:
  56. case FR_ACT_BLACKHOLE:
  57. rt = net->ipv6.ip6_blk_hole_entry;
  58. goto discard_pkt;
  59. case FR_ACT_PROHIBIT:
  60. rt = net->ipv6.ip6_prohibit_entry;
  61. goto discard_pkt;
  62. }
  63. table = fib6_get_table(net, rule->table);
  64. if (table)
  65. rt = lookup(net, table, flp, flags);
  66. if (rt != net->ipv6.ip6_null_entry) {
  67. struct fib6_rule *r = (struct fib6_rule *)rule;
  68. /*
  69. * If we need to find a source address for this traffic,
  70. * we check the result if it meets requirement of the rule.
  71. */
  72. if ((rule->flags & FIB_RULE_FIND_SADDR) &&
  73. r->src.plen && !(flags & RT6_LOOKUP_F_HAS_SADDR)) {
  74. struct in6_addr saddr;
  75. unsigned int srcprefs = 0;
  76. if (flags & RT6_LOOKUP_F_SRCPREF_TMP)
  77. srcprefs |= IPV6_PREFER_SRC_TMP;
  78. if (flags & RT6_LOOKUP_F_SRCPREF_PUBLIC)
  79. srcprefs |= IPV6_PREFER_SRC_PUBLIC;
  80. if (flags & RT6_LOOKUP_F_SRCPREF_COA)
  81. srcprefs |= IPV6_PREFER_SRC_COA;
  82. if (ipv6_dev_get_saddr(net,
  83. ip6_dst_idev(&rt->u.dst)->dev,
  84. &flp->fl6_dst, srcprefs,
  85. &saddr))
  86. goto again;
  87. if (!ipv6_prefix_equal(&saddr, &r->src.addr,
  88. r->src.plen))
  89. goto again;
  90. ipv6_addr_copy(&flp->fl6_src, &saddr);
  91. }
  92. goto out;
  93. }
  94. again:
  95. dst_release(&rt->u.dst);
  96. rt = NULL;
  97. goto out;
  98. discard_pkt:
  99. dst_hold(&rt->u.dst);
  100. out:
  101. arg->result = rt;
  102. return rt == NULL ? -EAGAIN : 0;
  103. }
  104. static int fib6_rule_match(struct fib_rule *rule, struct flowi *fl, int flags)
  105. {
  106. struct fib6_rule *r = (struct fib6_rule *) rule;
  107. if (r->dst.plen &&
  108. !ipv6_prefix_equal(&fl->fl6_dst, &r->dst.addr, r->dst.plen))
  109. return 0;
  110. /*
  111. * If FIB_RULE_FIND_SADDR is set and we do not have a
  112. * source address for the traffic, we defer check for
  113. * source address.
  114. */
  115. if (r->src.plen) {
  116. if (flags & RT6_LOOKUP_F_HAS_SADDR) {
  117. if (!ipv6_prefix_equal(&fl->fl6_src, &r->src.addr,
  118. r->src.plen))
  119. return 0;
  120. } else if (!(r->common.flags & FIB_RULE_FIND_SADDR))
  121. return 0;
  122. }
  123. if (r->tclass && r->tclass != ((ntohl(fl->fl6_flowlabel) >> 20) & 0xff))
  124. return 0;
  125. return 1;
  126. }
  127. static const struct nla_policy fib6_rule_policy[FRA_MAX+1] = {
  128. FRA_GENERIC_POLICY,
  129. };
  130. static int fib6_rule_configure(struct fib_rule *rule, struct sk_buff *skb,
  131. struct fib_rule_hdr *frh,
  132. struct nlattr **tb)
  133. {
  134. int err = -EINVAL;
  135. struct net *net = sock_net(skb->sk);
  136. struct fib6_rule *rule6 = (struct fib6_rule *) rule;
  137. if (rule->action == FR_ACT_TO_TBL) {
  138. if (rule->table == RT6_TABLE_UNSPEC)
  139. goto errout;
  140. if (fib6_new_table(net, rule->table) == NULL) {
  141. err = -ENOBUFS;
  142. goto errout;
  143. }
  144. }
  145. if (frh->src_len)
  146. nla_memcpy(&rule6->src.addr, tb[FRA_SRC],
  147. sizeof(struct in6_addr));
  148. if (frh->dst_len)
  149. nla_memcpy(&rule6->dst.addr, tb[FRA_DST],
  150. sizeof(struct in6_addr));
  151. rule6->src.plen = frh->src_len;
  152. rule6->dst.plen = frh->dst_len;
  153. rule6->tclass = frh->tos;
  154. err = 0;
  155. errout:
  156. return err;
  157. }
  158. static int fib6_rule_compare(struct fib_rule *rule, struct fib_rule_hdr *frh,
  159. struct nlattr **tb)
  160. {
  161. struct fib6_rule *rule6 = (struct fib6_rule *) rule;
  162. if (frh->src_len && (rule6->src.plen != frh->src_len))
  163. return 0;
  164. if (frh->dst_len && (rule6->dst.plen != frh->dst_len))
  165. return 0;
  166. if (frh->tos && (rule6->tclass != frh->tos))
  167. return 0;
  168. if (frh->src_len &&
  169. nla_memcmp(tb[FRA_SRC], &rule6->src.addr, sizeof(struct in6_addr)))
  170. return 0;
  171. if (frh->dst_len &&
  172. nla_memcmp(tb[FRA_DST], &rule6->dst.addr, sizeof(struct in6_addr)))
  173. return 0;
  174. return 1;
  175. }
  176. static int fib6_rule_fill(struct fib_rule *rule, struct sk_buff *skb,
  177. struct fib_rule_hdr *frh)
  178. {
  179. struct fib6_rule *rule6 = (struct fib6_rule *) rule;
  180. frh->family = AF_INET6;
  181. frh->dst_len = rule6->dst.plen;
  182. frh->src_len = rule6->src.plen;
  183. frh->tos = rule6->tclass;
  184. if (rule6->dst.plen)
  185. NLA_PUT(skb, FRA_DST, sizeof(struct in6_addr),
  186. &rule6->dst.addr);
  187. if (rule6->src.plen)
  188. NLA_PUT(skb, FRA_SRC, sizeof(struct in6_addr),
  189. &rule6->src.addr);
  190. return 0;
  191. nla_put_failure:
  192. return -ENOBUFS;
  193. }
  194. static u32 fib6_rule_default_pref(struct fib_rules_ops *ops)
  195. {
  196. return 0x3FFF;
  197. }
  198. static size_t fib6_rule_nlmsg_payload(struct fib_rule *rule)
  199. {
  200. return nla_total_size(16) /* dst */
  201. + nla_total_size(16); /* src */
  202. }
  203. static struct fib_rules_ops fib6_rules_ops_template = {
  204. .family = AF_INET6,
  205. .rule_size = sizeof(struct fib6_rule),
  206. .addr_size = sizeof(struct in6_addr),
  207. .action = fib6_rule_action,
  208. .match = fib6_rule_match,
  209. .configure = fib6_rule_configure,
  210. .compare = fib6_rule_compare,
  211. .fill = fib6_rule_fill,
  212. .default_pref = fib6_rule_default_pref,
  213. .nlmsg_payload = fib6_rule_nlmsg_payload,
  214. .nlgroup = RTNLGRP_IPV6_RULE,
  215. .policy = fib6_rule_policy,
  216. .owner = THIS_MODULE,
  217. .fro_net = &init_net,
  218. };
  219. static int fib6_rules_net_init(struct net *net)
  220. {
  221. int err = -ENOMEM;
  222. net->ipv6.fib6_rules_ops = kmemdup(&fib6_rules_ops_template,
  223. sizeof(*net->ipv6.fib6_rules_ops),
  224. GFP_KERNEL);
  225. if (!net->ipv6.fib6_rules_ops)
  226. goto out;
  227. net->ipv6.fib6_rules_ops->fro_net = net;
  228. INIT_LIST_HEAD(&net->ipv6.fib6_rules_ops->rules_list);
  229. err = fib_default_rule_add(net->ipv6.fib6_rules_ops, 0,
  230. RT6_TABLE_LOCAL, FIB_RULE_PERMANENT);
  231. if (err)
  232. goto out_fib6_rules_ops;
  233. err = fib_default_rule_add(net->ipv6.fib6_rules_ops,
  234. 0x7FFE, RT6_TABLE_MAIN, 0);
  235. if (err)
  236. goto out_fib6_default_rule_add;
  237. err = fib_rules_register(net->ipv6.fib6_rules_ops);
  238. if (err)
  239. goto out_fib6_default_rule_add;
  240. out:
  241. return err;
  242. out_fib6_default_rule_add:
  243. fib_rules_cleanup_ops(net->ipv6.fib6_rules_ops);
  244. out_fib6_rules_ops:
  245. kfree(net->ipv6.fib6_rules_ops);
  246. goto out;
  247. }
  248. static void fib6_rules_net_exit(struct net *net)
  249. {
  250. fib_rules_unregister(net->ipv6.fib6_rules_ops);
  251. kfree(net->ipv6.fib6_rules_ops);
  252. }
  253. static struct pernet_operations fib6_rules_net_ops = {
  254. .init = fib6_rules_net_init,
  255. .exit = fib6_rules_net_exit,
  256. };
  257. int __init fib6_rules_init(void)
  258. {
  259. return register_pernet_subsys(&fib6_rules_net_ops);
  260. }
  261. void fib6_rules_cleanup(void)
  262. {
  263. unregister_pernet_subsys(&fib6_rules_net_ops);
  264. }