addrlabel.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598
  1. /*
  2. * IPv6 Address Label subsystem
  3. * for the IPv6 "Default" Source Address Selection
  4. *
  5. * Copyright (C)2007 USAGI/WIDE Project
  6. */
  7. /*
  8. * Author:
  9. * YOSHIFUJI Hideaki @ USAGI/WIDE Project <yoshfuji@linux-ipv6.org>
  10. */
  11. #include <linux/kernel.h>
  12. #include <linux/list.h>
  13. #include <linux/rcupdate.h>
  14. #include <linux/in6.h>
  15. #include <net/addrconf.h>
  16. #include <linux/if_addrlabel.h>
  17. #include <linux/netlink.h>
  18. #include <linux/rtnetlink.h>
  19. #if 0
  20. #define ADDRLABEL(x...) printk(x)
  21. #else
  22. #define ADDRLABEL(x...) do { ; } while(0)
  23. #endif
  24. /*
  25. * Policy Table
  26. */
  27. struct ip6addrlbl_entry
  28. {
  29. #ifdef CONFIG_NET_NS
  30. struct net *lbl_net;
  31. #endif
  32. struct in6_addr prefix;
  33. int prefixlen;
  34. int ifindex;
  35. int addrtype;
  36. u32 label;
  37. struct hlist_node list;
  38. atomic_t refcnt;
  39. struct rcu_head rcu;
  40. };
  41. static struct ip6addrlbl_table
  42. {
  43. struct hlist_head head;
  44. spinlock_t lock;
  45. u32 seq;
  46. } ip6addrlbl_table;
  47. static inline
  48. struct net *ip6addrlbl_net(const struct ip6addrlbl_entry *lbl)
  49. {
  50. #ifdef CONFIG_NET_NS
  51. return lbl->lbl_net;
  52. #else
  53. return &init_net;
  54. #endif
  55. }
  56. /*
  57. * Default policy table (RFC3484 + extensions)
  58. *
  59. * prefix addr_type label
  60. * -------------------------------------------------------------------------
  61. * ::1/128 LOOPBACK 0
  62. * ::/0 N/A 1
  63. * 2002::/16 N/A 2
  64. * ::/96 COMPATv4 3
  65. * ::ffff:0:0/96 V4MAPPED 4
  66. * fc00::/7 N/A 5 ULA (RFC 4193)
  67. * 2001::/32 N/A 6 Teredo (RFC 4380)
  68. * 2001:10::/28 N/A 7 ORCHID (RFC 4843)
  69. *
  70. * Note: 0xffffffff is used if we do not have any policies.
  71. */
  72. #define IPV6_ADDR_LABEL_DEFAULT 0xffffffffUL
  73. static const __net_initdata struct ip6addrlbl_init_table
  74. {
  75. const struct in6_addr *prefix;
  76. int prefixlen;
  77. u32 label;
  78. } ip6addrlbl_init_table[] = {
  79. { /* ::/0 */
  80. .prefix = &in6addr_any,
  81. .label = 1,
  82. },{ /* fc00::/7 */
  83. .prefix = &(struct in6_addr){{{ 0xfc }}},
  84. .prefixlen = 7,
  85. .label = 5,
  86. },{ /* 2002::/16 */
  87. .prefix = &(struct in6_addr){{{ 0x20, 0x02 }}},
  88. .prefixlen = 16,
  89. .label = 2,
  90. },{ /* 2001::/32 */
  91. .prefix = &(struct in6_addr){{{ 0x20, 0x01 }}},
  92. .prefixlen = 32,
  93. .label = 6,
  94. },{ /* 2001:10::/28 */
  95. .prefix = &(struct in6_addr){{{ 0x20, 0x01, 0x00, 0x10 }}},
  96. .prefixlen = 28,
  97. .label = 7,
  98. },{ /* ::ffff:0:0 */
  99. .prefix = &(struct in6_addr){{{ [10] = 0xff, [11] = 0xff }}},
  100. .prefixlen = 96,
  101. .label = 4,
  102. },{ /* ::/96 */
  103. .prefix = &in6addr_any,
  104. .prefixlen = 96,
  105. .label = 3,
  106. },{ /* ::1/128 */
  107. .prefix = &in6addr_loopback,
  108. .prefixlen = 128,
  109. .label = 0,
  110. }
  111. };
  112. /* Object management */
  113. static inline void ip6addrlbl_free(struct ip6addrlbl_entry *p)
  114. {
  115. #ifdef CONFIG_NET_NS
  116. release_net(p->lbl_net);
  117. #endif
  118. kfree(p);
  119. }
  120. static void ip6addrlbl_free_rcu(struct rcu_head *h)
  121. {
  122. ip6addrlbl_free(container_of(h, struct ip6addrlbl_entry, rcu));
  123. }
  124. static inline int ip6addrlbl_hold(struct ip6addrlbl_entry *p)
  125. {
  126. return atomic_inc_not_zero(&p->refcnt);
  127. }
  128. static inline void ip6addrlbl_put(struct ip6addrlbl_entry *p)
  129. {
  130. if (atomic_dec_and_test(&p->refcnt))
  131. call_rcu(&p->rcu, ip6addrlbl_free_rcu);
  132. }
  133. /* Find label */
  134. static int __ip6addrlbl_match(struct net *net,
  135. struct ip6addrlbl_entry *p,
  136. const struct in6_addr *addr,
  137. int addrtype, int ifindex)
  138. {
  139. if (!net_eq(ip6addrlbl_net(p), net))
  140. return 0;
  141. if (p->ifindex && p->ifindex != ifindex)
  142. return 0;
  143. if (p->addrtype && p->addrtype != addrtype)
  144. return 0;
  145. if (!ipv6_prefix_equal(addr, &p->prefix, p->prefixlen))
  146. return 0;
  147. return 1;
  148. }
  149. static struct ip6addrlbl_entry *__ipv6_addr_label(struct net *net,
  150. const struct in6_addr *addr,
  151. int type, int ifindex)
  152. {
  153. struct hlist_node *pos;
  154. struct ip6addrlbl_entry *p;
  155. hlist_for_each_entry_rcu(p, pos, &ip6addrlbl_table.head, list) {
  156. if (__ip6addrlbl_match(net, p, addr, type, ifindex))
  157. return p;
  158. }
  159. return NULL;
  160. }
  161. u32 ipv6_addr_label(struct net *net,
  162. const struct in6_addr *addr, int type, int ifindex)
  163. {
  164. u32 label;
  165. struct ip6addrlbl_entry *p;
  166. type &= IPV6_ADDR_MAPPED | IPV6_ADDR_COMPATv4 | IPV6_ADDR_LOOPBACK;
  167. rcu_read_lock();
  168. p = __ipv6_addr_label(net, addr, type, ifindex);
  169. label = p ? p->label : IPV6_ADDR_LABEL_DEFAULT;
  170. rcu_read_unlock();
  171. ADDRLABEL(KERN_DEBUG "%s(addr=%pI6, type=%d, ifindex=%d) => %08x\n",
  172. __func__, addr, type, ifindex, label);
  173. return label;
  174. }
  175. /* allocate one entry */
  176. static struct ip6addrlbl_entry *ip6addrlbl_alloc(struct net *net,
  177. const struct in6_addr *prefix,
  178. int prefixlen, int ifindex,
  179. u32 label)
  180. {
  181. struct ip6addrlbl_entry *newp;
  182. int addrtype;
  183. ADDRLABEL(KERN_DEBUG "%s(prefix=%pI6, prefixlen=%d, ifindex=%d, label=%u)\n",
  184. __func__, prefix, prefixlen, ifindex, (unsigned int)label);
  185. addrtype = ipv6_addr_type(prefix) & (IPV6_ADDR_MAPPED | IPV6_ADDR_COMPATv4 | IPV6_ADDR_LOOPBACK);
  186. switch (addrtype) {
  187. case IPV6_ADDR_MAPPED:
  188. if (prefixlen > 96)
  189. return ERR_PTR(-EINVAL);
  190. if (prefixlen < 96)
  191. addrtype = 0;
  192. break;
  193. case IPV6_ADDR_COMPATv4:
  194. if (prefixlen != 96)
  195. addrtype = 0;
  196. break;
  197. case IPV6_ADDR_LOOPBACK:
  198. if (prefixlen != 128)
  199. addrtype = 0;
  200. break;
  201. }
  202. newp = kmalloc(sizeof(*newp), GFP_KERNEL);
  203. if (!newp)
  204. return ERR_PTR(-ENOMEM);
  205. ipv6_addr_prefix(&newp->prefix, prefix, prefixlen);
  206. newp->prefixlen = prefixlen;
  207. newp->ifindex = ifindex;
  208. newp->addrtype = addrtype;
  209. newp->label = label;
  210. INIT_HLIST_NODE(&newp->list);
  211. #ifdef CONFIG_NET_NS
  212. newp->lbl_net = hold_net(net);
  213. #endif
  214. atomic_set(&newp->refcnt, 1);
  215. return newp;
  216. }
  217. /* add a label */
  218. static int __ip6addrlbl_add(struct ip6addrlbl_entry *newp, int replace)
  219. {
  220. int ret = 0;
  221. ADDRLABEL(KERN_DEBUG "%s(newp=%p, replace=%d)\n",
  222. __func__,
  223. newp, replace);
  224. if (hlist_empty(&ip6addrlbl_table.head)) {
  225. hlist_add_head_rcu(&newp->list, &ip6addrlbl_table.head);
  226. } else {
  227. struct hlist_node *pos, *n;
  228. struct ip6addrlbl_entry *p = NULL;
  229. hlist_for_each_entry_safe(p, pos, n,
  230. &ip6addrlbl_table.head, list) {
  231. if (p->prefixlen == newp->prefixlen &&
  232. net_eq(ip6addrlbl_net(p), ip6addrlbl_net(newp)) &&
  233. p->ifindex == newp->ifindex &&
  234. ipv6_addr_equal(&p->prefix, &newp->prefix)) {
  235. if (!replace) {
  236. ret = -EEXIST;
  237. goto out;
  238. }
  239. hlist_replace_rcu(&p->list, &newp->list);
  240. ip6addrlbl_put(p);
  241. goto out;
  242. } else if ((p->prefixlen == newp->prefixlen && !p->ifindex) ||
  243. (p->prefixlen < newp->prefixlen)) {
  244. hlist_add_before_rcu(&newp->list, &p->list);
  245. goto out;
  246. }
  247. }
  248. hlist_add_after_rcu(&p->list, &newp->list);
  249. }
  250. out:
  251. if (!ret)
  252. ip6addrlbl_table.seq++;
  253. return ret;
  254. }
  255. /* add a label */
  256. static int ip6addrlbl_add(struct net *net,
  257. const struct in6_addr *prefix, int prefixlen,
  258. int ifindex, u32 label, int replace)
  259. {
  260. struct ip6addrlbl_entry *newp;
  261. int ret = 0;
  262. ADDRLABEL(KERN_DEBUG "%s(prefix=%pI6, prefixlen=%d, ifindex=%d, label=%u, replace=%d)\n",
  263. __func__, prefix, prefixlen, ifindex, (unsigned int)label,
  264. replace);
  265. newp = ip6addrlbl_alloc(net, prefix, prefixlen, ifindex, label);
  266. if (IS_ERR(newp))
  267. return PTR_ERR(newp);
  268. spin_lock(&ip6addrlbl_table.lock);
  269. ret = __ip6addrlbl_add(newp, replace);
  270. spin_unlock(&ip6addrlbl_table.lock);
  271. if (ret)
  272. ip6addrlbl_free(newp);
  273. return ret;
  274. }
  275. /* remove a label */
  276. static int __ip6addrlbl_del(struct net *net,
  277. const struct in6_addr *prefix, int prefixlen,
  278. int ifindex)
  279. {
  280. struct ip6addrlbl_entry *p = NULL;
  281. struct hlist_node *pos, *n;
  282. int ret = -ESRCH;
  283. ADDRLABEL(KERN_DEBUG "%s(prefix=%pI6, prefixlen=%d, ifindex=%d)\n",
  284. __func__, prefix, prefixlen, ifindex);
  285. hlist_for_each_entry_safe(p, pos, n, &ip6addrlbl_table.head, list) {
  286. if (p->prefixlen == prefixlen &&
  287. net_eq(ip6addrlbl_net(p), net) &&
  288. p->ifindex == ifindex &&
  289. ipv6_addr_equal(&p->prefix, prefix)) {
  290. hlist_del_rcu(&p->list);
  291. ip6addrlbl_put(p);
  292. ret = 0;
  293. break;
  294. }
  295. }
  296. return ret;
  297. }
  298. static int ip6addrlbl_del(struct net *net,
  299. const struct in6_addr *prefix, int prefixlen,
  300. int ifindex)
  301. {
  302. struct in6_addr prefix_buf;
  303. int ret;
  304. ADDRLABEL(KERN_DEBUG "%s(prefix=%pI6, prefixlen=%d, ifindex=%d)\n",
  305. __func__, prefix, prefixlen, ifindex);
  306. ipv6_addr_prefix(&prefix_buf, prefix, prefixlen);
  307. spin_lock(&ip6addrlbl_table.lock);
  308. ret = __ip6addrlbl_del(net, &prefix_buf, prefixlen, ifindex);
  309. spin_unlock(&ip6addrlbl_table.lock);
  310. return ret;
  311. }
  312. /* add default label */
  313. static int __net_init ip6addrlbl_net_init(struct net *net)
  314. {
  315. int err = 0;
  316. int i;
  317. ADDRLABEL(KERN_DEBUG "%s()\n", __func__);
  318. for (i = 0; i < ARRAY_SIZE(ip6addrlbl_init_table); i++) {
  319. int ret = ip6addrlbl_add(net,
  320. ip6addrlbl_init_table[i].prefix,
  321. ip6addrlbl_init_table[i].prefixlen,
  322. 0,
  323. ip6addrlbl_init_table[i].label, 0);
  324. /* XXX: should we free all rules when we catch an error? */
  325. if (ret && (!err || err != -ENOMEM))
  326. err = ret;
  327. }
  328. return err;
  329. }
  330. static void __net_exit ip6addrlbl_net_exit(struct net *net)
  331. {
  332. struct ip6addrlbl_entry *p = NULL;
  333. struct hlist_node *pos, *n;
  334. /* Remove all labels belonging to the exiting net */
  335. spin_lock(&ip6addrlbl_table.lock);
  336. hlist_for_each_entry_safe(p, pos, n, &ip6addrlbl_table.head, list) {
  337. if (net_eq(ip6addrlbl_net(p), net)) {
  338. hlist_del_rcu(&p->list);
  339. ip6addrlbl_put(p);
  340. }
  341. }
  342. spin_unlock(&ip6addrlbl_table.lock);
  343. }
  344. static struct pernet_operations ipv6_addr_label_ops = {
  345. .init = ip6addrlbl_net_init,
  346. .exit = ip6addrlbl_net_exit,
  347. };
  348. int __init ipv6_addr_label_init(void)
  349. {
  350. spin_lock_init(&ip6addrlbl_table.lock);
  351. return register_pernet_subsys(&ipv6_addr_label_ops);
  352. }
  353. static const struct nla_policy ifal_policy[IFAL_MAX+1] = {
  354. [IFAL_ADDRESS] = { .len = sizeof(struct in6_addr), },
  355. [IFAL_LABEL] = { .len = sizeof(u32), },
  356. };
  357. static int ip6addrlbl_newdel(struct sk_buff *skb, struct nlmsghdr *nlh,
  358. void *arg)
  359. {
  360. struct net *net = sock_net(skb->sk);
  361. struct ifaddrlblmsg *ifal;
  362. struct nlattr *tb[IFAL_MAX+1];
  363. struct in6_addr *pfx;
  364. u32 label;
  365. int err = 0;
  366. err = nlmsg_parse(nlh, sizeof(*ifal), tb, IFAL_MAX, ifal_policy);
  367. if (err < 0)
  368. return err;
  369. ifal = nlmsg_data(nlh);
  370. if (ifal->ifal_family != AF_INET6 ||
  371. ifal->ifal_prefixlen > 128)
  372. return -EINVAL;
  373. if (ifal->ifal_index &&
  374. !__dev_get_by_index(net, ifal->ifal_index))
  375. return -EINVAL;
  376. if (!tb[IFAL_ADDRESS])
  377. return -EINVAL;
  378. pfx = nla_data(tb[IFAL_ADDRESS]);
  379. if (!pfx)
  380. return -EINVAL;
  381. if (!tb[IFAL_LABEL])
  382. return -EINVAL;
  383. label = nla_get_u32(tb[IFAL_LABEL]);
  384. if (label == IPV6_ADDR_LABEL_DEFAULT)
  385. return -EINVAL;
  386. switch(nlh->nlmsg_type) {
  387. case RTM_NEWADDRLABEL:
  388. err = ip6addrlbl_add(net, pfx, ifal->ifal_prefixlen,
  389. ifal->ifal_index, label,
  390. nlh->nlmsg_flags & NLM_F_REPLACE);
  391. break;
  392. case RTM_DELADDRLABEL:
  393. err = ip6addrlbl_del(net, pfx, ifal->ifal_prefixlen,
  394. ifal->ifal_index);
  395. break;
  396. default:
  397. err = -EOPNOTSUPP;
  398. }
  399. return err;
  400. }
  401. static inline void ip6addrlbl_putmsg(struct nlmsghdr *nlh,
  402. int prefixlen, int ifindex, u32 lseq)
  403. {
  404. struct ifaddrlblmsg *ifal = nlmsg_data(nlh);
  405. ifal->ifal_family = AF_INET6;
  406. ifal->ifal_prefixlen = prefixlen;
  407. ifal->ifal_flags = 0;
  408. ifal->ifal_index = ifindex;
  409. ifal->ifal_seq = lseq;
  410. };
  411. static int ip6addrlbl_fill(struct sk_buff *skb,
  412. struct ip6addrlbl_entry *p,
  413. u32 lseq,
  414. u32 pid, u32 seq, int event,
  415. unsigned int flags)
  416. {
  417. struct nlmsghdr *nlh = nlmsg_put(skb, pid, seq, event,
  418. sizeof(struct ifaddrlblmsg), flags);
  419. if (!nlh)
  420. return -EMSGSIZE;
  421. ip6addrlbl_putmsg(nlh, p->prefixlen, p->ifindex, lseq);
  422. if (nla_put(skb, IFAL_ADDRESS, 16, &p->prefix) < 0 ||
  423. nla_put_u32(skb, IFAL_LABEL, p->label) < 0) {
  424. nlmsg_cancel(skb, nlh);
  425. return -EMSGSIZE;
  426. }
  427. return nlmsg_end(skb, nlh);
  428. }
  429. static int ip6addrlbl_dump(struct sk_buff *skb, struct netlink_callback *cb)
  430. {
  431. struct net *net = sock_net(skb->sk);
  432. struct ip6addrlbl_entry *p;
  433. struct hlist_node *pos;
  434. int idx = 0, s_idx = cb->args[0];
  435. int err;
  436. rcu_read_lock();
  437. hlist_for_each_entry_rcu(p, pos, &ip6addrlbl_table.head, list) {
  438. if (idx >= s_idx &&
  439. net_eq(ip6addrlbl_net(p), net)) {
  440. if ((err = ip6addrlbl_fill(skb, p,
  441. ip6addrlbl_table.seq,
  442. NETLINK_CB(cb->skb).pid,
  443. cb->nlh->nlmsg_seq,
  444. RTM_NEWADDRLABEL,
  445. NLM_F_MULTI)) <= 0)
  446. break;
  447. }
  448. idx++;
  449. }
  450. rcu_read_unlock();
  451. cb->args[0] = idx;
  452. return skb->len;
  453. }
  454. static inline int ip6addrlbl_msgsize(void)
  455. {
  456. return (NLMSG_ALIGN(sizeof(struct ifaddrlblmsg))
  457. + nla_total_size(16) /* IFAL_ADDRESS */
  458. + nla_total_size(4) /* IFAL_LABEL */
  459. );
  460. }
  461. static int ip6addrlbl_get(struct sk_buff *in_skb, struct nlmsghdr* nlh,
  462. void *arg)
  463. {
  464. struct net *net = sock_net(in_skb->sk);
  465. struct ifaddrlblmsg *ifal;
  466. struct nlattr *tb[IFAL_MAX+1];
  467. struct in6_addr *addr;
  468. u32 lseq;
  469. int err = 0;
  470. struct ip6addrlbl_entry *p;
  471. struct sk_buff *skb;
  472. err = nlmsg_parse(nlh, sizeof(*ifal), tb, IFAL_MAX, ifal_policy);
  473. if (err < 0)
  474. return err;
  475. ifal = nlmsg_data(nlh);
  476. if (ifal->ifal_family != AF_INET6 ||
  477. ifal->ifal_prefixlen != 128)
  478. return -EINVAL;
  479. if (ifal->ifal_index &&
  480. !__dev_get_by_index(net, ifal->ifal_index))
  481. return -EINVAL;
  482. if (!tb[IFAL_ADDRESS])
  483. return -EINVAL;
  484. addr = nla_data(tb[IFAL_ADDRESS]);
  485. if (!addr)
  486. return -EINVAL;
  487. rcu_read_lock();
  488. p = __ipv6_addr_label(net, addr, ipv6_addr_type(addr), ifal->ifal_index);
  489. if (p && ip6addrlbl_hold(p))
  490. p = NULL;
  491. lseq = ip6addrlbl_table.seq;
  492. rcu_read_unlock();
  493. if (!p) {
  494. err = -ESRCH;
  495. goto out;
  496. }
  497. if (!(skb = nlmsg_new(ip6addrlbl_msgsize(), GFP_KERNEL))) {
  498. ip6addrlbl_put(p);
  499. return -ENOBUFS;
  500. }
  501. err = ip6addrlbl_fill(skb, p, lseq,
  502. NETLINK_CB(in_skb).pid, nlh->nlmsg_seq,
  503. RTM_NEWADDRLABEL, 0);
  504. ip6addrlbl_put(p);
  505. if (err < 0) {
  506. WARN_ON(err == -EMSGSIZE);
  507. kfree_skb(skb);
  508. goto out;
  509. }
  510. err = rtnl_unicast(skb, net, NETLINK_CB(in_skb).pid);
  511. out:
  512. return err;
  513. }
  514. void __init ipv6_addr_label_rtnl_register(void)
  515. {
  516. __rtnl_register(PF_INET6, RTM_NEWADDRLABEL, ip6addrlbl_newdel, NULL);
  517. __rtnl_register(PF_INET6, RTM_DELADDRLABEL, ip6addrlbl_newdel, NULL);
  518. __rtnl_register(PF_INET6, RTM_GETADDRLABEL, ip6addrlbl_get, ip6addrlbl_dump);
  519. }