xfrm6_tunnel.c 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387
  1. /*
  2. * Copyright (C)2003,2004 USAGI/WIDE Project
  3. *
  4. * This program is free software; you can redistribute it and/or modify
  5. * it under the terms of the GNU General Public License as published by
  6. * the Free Software Foundation; either version 2 of the License, or
  7. * (at your option) any later version.
  8. *
  9. * This program is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write to the Free Software
  16. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  17. *
  18. * Authors Mitsuru KANDA <mk@linux-ipv6.org>
  19. * YOSHIFUJI Hideaki <yoshfuji@linux-ipv6.org>
  20. *
  21. * Based on net/ipv4/xfrm4_tunnel.c
  22. *
  23. */
  24. #include <linux/module.h>
  25. #include <linux/xfrm.h>
  26. #include <linux/rculist.h>
  27. #include <net/ip.h>
  28. #include <net/xfrm.h>
  29. #include <net/ipv6.h>
  30. #include <linux/ipv6.h>
  31. #include <linux/icmpv6.h>
  32. #include <linux/mutex.h>
  33. /*
  34. * xfrm_tunnel_spi things are for allocating unique id ("spi")
  35. * per xfrm_address_t.
  36. */
  37. struct xfrm6_tunnel_spi {
  38. struct hlist_node list_byaddr;
  39. struct hlist_node list_byspi;
  40. xfrm_address_t addr;
  41. u32 spi;
  42. atomic_t refcnt;
  43. struct rcu_head rcu_head;
  44. };
  45. static DEFINE_SPINLOCK(xfrm6_tunnel_spi_lock);
  46. static u32 xfrm6_tunnel_spi;
  47. #define XFRM6_TUNNEL_SPI_MIN 1
  48. #define XFRM6_TUNNEL_SPI_MAX 0xffffffff
  49. static struct kmem_cache *xfrm6_tunnel_spi_kmem __read_mostly;
  50. #define XFRM6_TUNNEL_SPI_BYADDR_HSIZE 256
  51. #define XFRM6_TUNNEL_SPI_BYSPI_HSIZE 256
  52. static struct hlist_head xfrm6_tunnel_spi_byaddr[XFRM6_TUNNEL_SPI_BYADDR_HSIZE];
  53. static struct hlist_head xfrm6_tunnel_spi_byspi[XFRM6_TUNNEL_SPI_BYSPI_HSIZE];
  54. static inline unsigned xfrm6_tunnel_spi_hash_byaddr(xfrm_address_t *addr)
  55. {
  56. unsigned h;
  57. h = (__force u32)(addr->a6[0] ^ addr->a6[1] ^ addr->a6[2] ^ addr->a6[3]);
  58. h ^= h >> 16;
  59. h ^= h >> 8;
  60. h &= XFRM6_TUNNEL_SPI_BYADDR_HSIZE - 1;
  61. return h;
  62. }
  63. static inline unsigned xfrm6_tunnel_spi_hash_byspi(u32 spi)
  64. {
  65. return spi % XFRM6_TUNNEL_SPI_BYSPI_HSIZE;
  66. }
  67. static int xfrm6_tunnel_spi_init(void)
  68. {
  69. int i;
  70. xfrm6_tunnel_spi = 0;
  71. xfrm6_tunnel_spi_kmem = kmem_cache_create("xfrm6_tunnel_spi",
  72. sizeof(struct xfrm6_tunnel_spi),
  73. 0, SLAB_HWCACHE_ALIGN,
  74. NULL);
  75. if (!xfrm6_tunnel_spi_kmem)
  76. return -ENOMEM;
  77. for (i = 0; i < XFRM6_TUNNEL_SPI_BYADDR_HSIZE; i++)
  78. INIT_HLIST_HEAD(&xfrm6_tunnel_spi_byaddr[i]);
  79. for (i = 0; i < XFRM6_TUNNEL_SPI_BYSPI_HSIZE; i++)
  80. INIT_HLIST_HEAD(&xfrm6_tunnel_spi_byspi[i]);
  81. return 0;
  82. }
  83. static void xfrm6_tunnel_spi_fini(void)
  84. {
  85. int i;
  86. for (i = 0; i < XFRM6_TUNNEL_SPI_BYADDR_HSIZE; i++) {
  87. if (!hlist_empty(&xfrm6_tunnel_spi_byaddr[i]))
  88. return;
  89. }
  90. for (i = 0; i < XFRM6_TUNNEL_SPI_BYSPI_HSIZE; i++) {
  91. if (!hlist_empty(&xfrm6_tunnel_spi_byspi[i]))
  92. return;
  93. }
  94. rcu_barrier();
  95. kmem_cache_destroy(xfrm6_tunnel_spi_kmem);
  96. xfrm6_tunnel_spi_kmem = NULL;
  97. }
  98. static struct xfrm6_tunnel_spi *__xfrm6_tunnel_spi_lookup(xfrm_address_t *saddr)
  99. {
  100. struct xfrm6_tunnel_spi *x6spi;
  101. struct hlist_node *pos;
  102. hlist_for_each_entry_rcu(x6spi, pos,
  103. &xfrm6_tunnel_spi_byaddr[xfrm6_tunnel_spi_hash_byaddr(saddr)],
  104. list_byaddr) {
  105. if (memcmp(&x6spi->addr, saddr, sizeof(x6spi->addr)) == 0)
  106. return x6spi;
  107. }
  108. return NULL;
  109. }
  110. __be32 xfrm6_tunnel_spi_lookup(xfrm_address_t *saddr)
  111. {
  112. struct xfrm6_tunnel_spi *x6spi;
  113. u32 spi;
  114. rcu_read_lock_bh();
  115. x6spi = __xfrm6_tunnel_spi_lookup(saddr);
  116. spi = x6spi ? x6spi->spi : 0;
  117. rcu_read_unlock_bh();
  118. return htonl(spi);
  119. }
  120. EXPORT_SYMBOL(xfrm6_tunnel_spi_lookup);
  121. static int __xfrm6_tunnel_spi_check(u32 spi)
  122. {
  123. struct xfrm6_tunnel_spi *x6spi;
  124. int index = xfrm6_tunnel_spi_hash_byspi(spi);
  125. struct hlist_node *pos;
  126. hlist_for_each_entry(x6spi, pos,
  127. &xfrm6_tunnel_spi_byspi[index],
  128. list_byspi) {
  129. if (x6spi->spi == spi)
  130. return -1;
  131. }
  132. return index;
  133. }
  134. static u32 __xfrm6_tunnel_alloc_spi(xfrm_address_t *saddr)
  135. {
  136. u32 spi;
  137. struct xfrm6_tunnel_spi *x6spi;
  138. int index;
  139. if (xfrm6_tunnel_spi < XFRM6_TUNNEL_SPI_MIN ||
  140. xfrm6_tunnel_spi >= XFRM6_TUNNEL_SPI_MAX)
  141. xfrm6_tunnel_spi = XFRM6_TUNNEL_SPI_MIN;
  142. else
  143. xfrm6_tunnel_spi++;
  144. for (spi = xfrm6_tunnel_spi; spi <= XFRM6_TUNNEL_SPI_MAX; spi++) {
  145. index = __xfrm6_tunnel_spi_check(spi);
  146. if (index >= 0)
  147. goto alloc_spi;
  148. }
  149. for (spi = XFRM6_TUNNEL_SPI_MIN; spi < xfrm6_tunnel_spi; spi++) {
  150. index = __xfrm6_tunnel_spi_check(spi);
  151. if (index >= 0)
  152. goto alloc_spi;
  153. }
  154. spi = 0;
  155. goto out;
  156. alloc_spi:
  157. xfrm6_tunnel_spi = spi;
  158. x6spi = kmem_cache_alloc(xfrm6_tunnel_spi_kmem, GFP_ATOMIC);
  159. if (!x6spi)
  160. goto out;
  161. INIT_RCU_HEAD(&x6spi->rcu_head);
  162. memcpy(&x6spi->addr, saddr, sizeof(x6spi->addr));
  163. x6spi->spi = spi;
  164. atomic_set(&x6spi->refcnt, 1);
  165. hlist_add_head_rcu(&x6spi->list_byspi, &xfrm6_tunnel_spi_byspi[index]);
  166. index = xfrm6_tunnel_spi_hash_byaddr(saddr);
  167. hlist_add_head_rcu(&x6spi->list_byaddr, &xfrm6_tunnel_spi_byaddr[index]);
  168. out:
  169. return spi;
  170. }
  171. __be32 xfrm6_tunnel_alloc_spi(xfrm_address_t *saddr)
  172. {
  173. struct xfrm6_tunnel_spi *x6spi;
  174. u32 spi;
  175. spin_lock_bh(&xfrm6_tunnel_spi_lock);
  176. x6spi = __xfrm6_tunnel_spi_lookup(saddr);
  177. if (x6spi) {
  178. atomic_inc(&x6spi->refcnt);
  179. spi = x6spi->spi;
  180. } else
  181. spi = __xfrm6_tunnel_alloc_spi(saddr);
  182. spin_unlock_bh(&xfrm6_tunnel_spi_lock);
  183. return htonl(spi);
  184. }
  185. EXPORT_SYMBOL(xfrm6_tunnel_alloc_spi);
  186. static void x6spi_destroy_rcu(struct rcu_head *head)
  187. {
  188. kmem_cache_free(xfrm6_tunnel_spi_kmem,
  189. container_of(head, struct xfrm6_tunnel_spi, rcu_head));
  190. }
  191. void xfrm6_tunnel_free_spi(xfrm_address_t *saddr)
  192. {
  193. struct xfrm6_tunnel_spi *x6spi;
  194. struct hlist_node *pos, *n;
  195. spin_lock_bh(&xfrm6_tunnel_spi_lock);
  196. hlist_for_each_entry_safe(x6spi, pos, n,
  197. &xfrm6_tunnel_spi_byaddr[xfrm6_tunnel_spi_hash_byaddr(saddr)],
  198. list_byaddr)
  199. {
  200. if (memcmp(&x6spi->addr, saddr, sizeof(x6spi->addr)) == 0) {
  201. if (atomic_dec_and_test(&x6spi->refcnt)) {
  202. hlist_del_rcu(&x6spi->list_byaddr);
  203. hlist_del_rcu(&x6spi->list_byspi);
  204. call_rcu(&x6spi->rcu_head, x6spi_destroy_rcu);
  205. break;
  206. }
  207. }
  208. }
  209. spin_unlock_bh(&xfrm6_tunnel_spi_lock);
  210. }
  211. EXPORT_SYMBOL(xfrm6_tunnel_free_spi);
  212. static int xfrm6_tunnel_output(struct xfrm_state *x, struct sk_buff *skb)
  213. {
  214. skb_push(skb, -skb_network_offset(skb));
  215. return 0;
  216. }
  217. static int xfrm6_tunnel_input(struct xfrm_state *x, struct sk_buff *skb)
  218. {
  219. return skb_network_header(skb)[IP6CB(skb)->nhoff];
  220. }
  221. static int xfrm6_tunnel_rcv(struct sk_buff *skb)
  222. {
  223. struct ipv6hdr *iph = ipv6_hdr(skb);
  224. __be32 spi;
  225. spi = xfrm6_tunnel_spi_lookup((xfrm_address_t *)&iph->saddr);
  226. return xfrm6_rcv_spi(skb, IPPROTO_IPV6, spi) > 0 ? : 0;
  227. }
  228. static int xfrm6_tunnel_err(struct sk_buff *skb, struct inet6_skb_parm *opt,
  229. u8 type, u8 code, int offset, __be32 info)
  230. {
  231. /* xfrm6_tunnel native err handling */
  232. switch (type) {
  233. case ICMPV6_DEST_UNREACH:
  234. switch (code) {
  235. case ICMPV6_NOROUTE:
  236. case ICMPV6_ADM_PROHIBITED:
  237. case ICMPV6_NOT_NEIGHBOUR:
  238. case ICMPV6_ADDR_UNREACH:
  239. case ICMPV6_PORT_UNREACH:
  240. default:
  241. break;
  242. }
  243. break;
  244. case ICMPV6_PKT_TOOBIG:
  245. break;
  246. case ICMPV6_TIME_EXCEED:
  247. switch (code) {
  248. case ICMPV6_EXC_HOPLIMIT:
  249. break;
  250. case ICMPV6_EXC_FRAGTIME:
  251. default:
  252. break;
  253. }
  254. break;
  255. case ICMPV6_PARAMPROB:
  256. switch (code) {
  257. case ICMPV6_HDR_FIELD: break;
  258. case ICMPV6_UNK_NEXTHDR: break;
  259. case ICMPV6_UNK_OPTION: break;
  260. }
  261. break;
  262. default:
  263. break;
  264. }
  265. return 0;
  266. }
  267. static int xfrm6_tunnel_init_state(struct xfrm_state *x)
  268. {
  269. if (x->props.mode != XFRM_MODE_TUNNEL)
  270. return -EINVAL;
  271. if (x->encap)
  272. return -EINVAL;
  273. x->props.header_len = sizeof(struct ipv6hdr);
  274. return 0;
  275. }
  276. static void xfrm6_tunnel_destroy(struct xfrm_state *x)
  277. {
  278. xfrm6_tunnel_free_spi((xfrm_address_t *)&x->props.saddr);
  279. }
  280. static const struct xfrm_type xfrm6_tunnel_type = {
  281. .description = "IP6IP6",
  282. .owner = THIS_MODULE,
  283. .proto = IPPROTO_IPV6,
  284. .init_state = xfrm6_tunnel_init_state,
  285. .destructor = xfrm6_tunnel_destroy,
  286. .input = xfrm6_tunnel_input,
  287. .output = xfrm6_tunnel_output,
  288. };
  289. static struct xfrm6_tunnel xfrm6_tunnel_handler = {
  290. .handler = xfrm6_tunnel_rcv,
  291. .err_handler = xfrm6_tunnel_err,
  292. .priority = 2,
  293. };
  294. static struct xfrm6_tunnel xfrm46_tunnel_handler = {
  295. .handler = xfrm6_tunnel_rcv,
  296. .err_handler = xfrm6_tunnel_err,
  297. .priority = 2,
  298. };
  299. static int __init xfrm6_tunnel_init(void)
  300. {
  301. if (xfrm_register_type(&xfrm6_tunnel_type, AF_INET6) < 0)
  302. goto err;
  303. if (xfrm6_tunnel_register(&xfrm6_tunnel_handler, AF_INET6))
  304. goto unreg;
  305. if (xfrm6_tunnel_register(&xfrm46_tunnel_handler, AF_INET))
  306. goto dereg6;
  307. if (xfrm6_tunnel_spi_init() < 0)
  308. goto dereg46;
  309. return 0;
  310. dereg46:
  311. xfrm6_tunnel_deregister(&xfrm46_tunnel_handler, AF_INET);
  312. dereg6:
  313. xfrm6_tunnel_deregister(&xfrm6_tunnel_handler, AF_INET6);
  314. unreg:
  315. xfrm_unregister_type(&xfrm6_tunnel_type, AF_INET6);
  316. err:
  317. return -EAGAIN;
  318. }
  319. static void __exit xfrm6_tunnel_fini(void)
  320. {
  321. xfrm6_tunnel_spi_fini();
  322. xfrm6_tunnel_deregister(&xfrm46_tunnel_handler, AF_INET);
  323. xfrm6_tunnel_deregister(&xfrm6_tunnel_handler, AF_INET6);
  324. xfrm_unregister_type(&xfrm6_tunnel_type, AF_INET6);
  325. }
  326. module_init(xfrm6_tunnel_init);
  327. module_exit(xfrm6_tunnel_fini);
  328. MODULE_LICENSE("GPL");
  329. MODULE_ALIAS_XFRM_TYPE(AF_INET6, XFRM_PROTO_IPV6);