ipcomp.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488
  1. /*
  2. * IP Payload Compression Protocol (IPComp) - RFC3173.
  3. *
  4. * Copyright (c) 2003 James Morris <jmorris@intercode.com.au>
  5. *
  6. * This program is free software; you can redistribute it and/or modify it
  7. * under the terms of the GNU General Public License as published by the Free
  8. * Software Foundation; either version 2 of the License, or (at your option)
  9. * any later version.
  10. *
  11. * Todo:
  12. * - Tunable compression parameters.
  13. * - Compression stats.
  14. * - Adaptive compression.
  15. */
  16. #include <linux/module.h>
  17. #include <asm/scatterlist.h>
  18. #include <asm/semaphore.h>
  19. #include <linux/crypto.h>
  20. #include <linux/pfkeyv2.h>
  21. #include <linux/percpu.h>
  22. #include <linux/smp.h>
  23. #include <linux/list.h>
  24. #include <linux/vmalloc.h>
  25. #include <linux/rtnetlink.h>
  26. #include <linux/mutex.h>
  27. #include <net/ip.h>
  28. #include <net/xfrm.h>
  29. #include <net/icmp.h>
  30. #include <net/ipcomp.h>
  31. #include <net/protocol.h>
  32. struct ipcomp_tfms {
  33. struct list_head list;
  34. struct crypto_comp **tfms;
  35. int users;
  36. };
  37. static DEFINE_MUTEX(ipcomp_resource_mutex);
  38. static void **ipcomp_scratches;
  39. static int ipcomp_scratch_users;
  40. static LIST_HEAD(ipcomp_tfms_list);
  41. static int ipcomp_decompress(struct xfrm_state *x, struct sk_buff *skb)
  42. {
  43. struct ipcomp_data *ipcd = x->data;
  44. const int plen = skb->len;
  45. int dlen = IPCOMP_SCRATCH_SIZE;
  46. const u8 *start = skb->data;
  47. const int cpu = get_cpu();
  48. u8 *scratch = *per_cpu_ptr(ipcomp_scratches, cpu);
  49. struct crypto_comp *tfm = *per_cpu_ptr(ipcd->tfms, cpu);
  50. int err = crypto_comp_decompress(tfm, start, plen, scratch, &dlen);
  51. if (err)
  52. goto out;
  53. if (dlen < (plen + sizeof(struct ip_comp_hdr))) {
  54. err = -EINVAL;
  55. goto out;
  56. }
  57. err = pskb_expand_head(skb, 0, dlen - plen, GFP_ATOMIC);
  58. if (err)
  59. goto out;
  60. skb->truesize += dlen - plen;
  61. __skb_put(skb, dlen - plen);
  62. skb_copy_to_linear_data(skb, scratch, dlen);
  63. out:
  64. put_cpu();
  65. return err;
  66. }
  67. static int ipcomp_input(struct xfrm_state *x, struct sk_buff *skb)
  68. {
  69. int err = -ENOMEM;
  70. struct iphdr *iph;
  71. struct ip_comp_hdr *ipch;
  72. if (skb_linearize_cow(skb))
  73. goto out;
  74. skb->ip_summed = CHECKSUM_NONE;
  75. /* Remove ipcomp header and decompress original payload */
  76. iph = ip_hdr(skb);
  77. ipch = (void *)skb->data;
  78. iph->protocol = ipch->nexthdr;
  79. skb->transport_header = skb->network_header + sizeof(*ipch);
  80. __skb_pull(skb, sizeof(*ipch));
  81. err = ipcomp_decompress(x, skb);
  82. out:
  83. return err;
  84. }
  85. static int ipcomp_compress(struct xfrm_state *x, struct sk_buff *skb)
  86. {
  87. struct ipcomp_data *ipcd = x->data;
  88. const int ihlen = ip_hdrlen(skb);
  89. const int plen = skb->len - ihlen;
  90. int dlen = IPCOMP_SCRATCH_SIZE;
  91. u8 *start = skb->data + ihlen;
  92. const int cpu = get_cpu();
  93. u8 *scratch = *per_cpu_ptr(ipcomp_scratches, cpu);
  94. struct crypto_comp *tfm = *per_cpu_ptr(ipcd->tfms, cpu);
  95. int err = crypto_comp_compress(tfm, start, plen, scratch, &dlen);
  96. if (err)
  97. goto out;
  98. if ((dlen + sizeof(struct ip_comp_hdr)) >= plen) {
  99. err = -EMSGSIZE;
  100. goto out;
  101. }
  102. memcpy(start + sizeof(struct ip_comp_hdr), scratch, dlen);
  103. put_cpu();
  104. pskb_trim(skb, ihlen + dlen + sizeof(struct ip_comp_hdr));
  105. return 0;
  106. out:
  107. put_cpu();
  108. return err;
  109. }
  110. static int ipcomp_output(struct xfrm_state *x, struct sk_buff *skb)
  111. {
  112. int err;
  113. struct ip_comp_hdr *ipch;
  114. struct ipcomp_data *ipcd = x->data;
  115. int hdr_len = 0;
  116. struct iphdr *iph = ip_hdr(skb);
  117. iph->tot_len = htons(skb->len);
  118. hdr_len = iph->ihl * 4;
  119. if ((skb->len - hdr_len) < ipcd->threshold) {
  120. /* Don't bother compressing */
  121. goto out_ok;
  122. }
  123. if (skb_linearize_cow(skb))
  124. goto out_ok;
  125. err = ipcomp_compress(x, skb);
  126. iph = ip_hdr(skb);
  127. if (err) {
  128. goto out_ok;
  129. }
  130. /* Install ipcomp header, convert into ipcomp datagram. */
  131. iph->tot_len = htons(skb->len);
  132. ipch = (struct ip_comp_hdr *)((char *)iph + iph->ihl * 4);
  133. ipch->nexthdr = iph->protocol;
  134. ipch->flags = 0;
  135. ipch->cpi = htons((u16 )ntohl(x->id.spi));
  136. iph->protocol = IPPROTO_COMP;
  137. ip_send_check(iph);
  138. return 0;
  139. out_ok:
  140. if (x->props.mode == XFRM_MODE_TUNNEL)
  141. ip_send_check(iph);
  142. return 0;
  143. }
  144. static void ipcomp4_err(struct sk_buff *skb, u32 info)
  145. {
  146. __be32 spi;
  147. struct iphdr *iph = (struct iphdr *)skb->data;
  148. struct ip_comp_hdr *ipch = (struct ip_comp_hdr *)(skb->data+(iph->ihl<<2));
  149. struct xfrm_state *x;
  150. if (icmp_hdr(skb)->type != ICMP_DEST_UNREACH ||
  151. icmp_hdr(skb)->code != ICMP_FRAG_NEEDED)
  152. return;
  153. spi = htonl(ntohs(ipch->cpi));
  154. x = xfrm_state_lookup((xfrm_address_t *)&iph->daddr,
  155. spi, IPPROTO_COMP, AF_INET);
  156. if (!x)
  157. return;
  158. NETDEBUG(KERN_DEBUG "pmtu discovery on SA IPCOMP/%08x/%u.%u.%u.%u\n",
  159. spi, NIPQUAD(iph->daddr));
  160. xfrm_state_put(x);
  161. }
  162. /* We always hold one tunnel user reference to indicate a tunnel */
  163. static struct xfrm_state *ipcomp_tunnel_create(struct xfrm_state *x)
  164. {
  165. struct xfrm_state *t;
  166. u8 mode = XFRM_MODE_TUNNEL;
  167. t = xfrm_state_alloc();
  168. if (t == NULL)
  169. goto out;
  170. t->id.proto = IPPROTO_IPIP;
  171. t->id.spi = x->props.saddr.a4;
  172. t->id.daddr.a4 = x->id.daddr.a4;
  173. memcpy(&t->sel, &x->sel, sizeof(t->sel));
  174. t->props.family = AF_INET;
  175. if (x->props.mode == XFRM_MODE_BEET)
  176. mode = x->props.mode;
  177. t->props.mode = mode;
  178. t->props.saddr.a4 = x->props.saddr.a4;
  179. t->props.flags = x->props.flags;
  180. if (xfrm_init_state(t))
  181. goto error;
  182. atomic_set(&t->tunnel_users, 1);
  183. out:
  184. return t;
  185. error:
  186. t->km.state = XFRM_STATE_DEAD;
  187. xfrm_state_put(t);
  188. t = NULL;
  189. goto out;
  190. }
  191. /*
  192. * Must be protected by xfrm_cfg_mutex. State and tunnel user references are
  193. * always incremented on success.
  194. */
  195. static int ipcomp_tunnel_attach(struct xfrm_state *x)
  196. {
  197. int err = 0;
  198. struct xfrm_state *t;
  199. t = xfrm_state_lookup((xfrm_address_t *)&x->id.daddr.a4,
  200. x->props.saddr.a4, IPPROTO_IPIP, AF_INET);
  201. if (!t) {
  202. t = ipcomp_tunnel_create(x);
  203. if (!t) {
  204. err = -EINVAL;
  205. goto out;
  206. }
  207. xfrm_state_insert(t);
  208. xfrm_state_hold(t);
  209. }
  210. x->tunnel = t;
  211. atomic_inc(&t->tunnel_users);
  212. out:
  213. return err;
  214. }
  215. static void ipcomp_free_scratches(void)
  216. {
  217. int i;
  218. void **scratches;
  219. if (--ipcomp_scratch_users)
  220. return;
  221. scratches = ipcomp_scratches;
  222. if (!scratches)
  223. return;
  224. for_each_possible_cpu(i)
  225. vfree(*per_cpu_ptr(scratches, i));
  226. free_percpu(scratches);
  227. }
  228. static void **ipcomp_alloc_scratches(void)
  229. {
  230. int i;
  231. void **scratches;
  232. if (ipcomp_scratch_users++)
  233. return ipcomp_scratches;
  234. scratches = alloc_percpu(void *);
  235. if (!scratches)
  236. return NULL;
  237. ipcomp_scratches = scratches;
  238. for_each_possible_cpu(i) {
  239. void *scratch = vmalloc(IPCOMP_SCRATCH_SIZE);
  240. if (!scratch)
  241. return NULL;
  242. *per_cpu_ptr(scratches, i) = scratch;
  243. }
  244. return scratches;
  245. }
  246. static void ipcomp_free_tfms(struct crypto_comp **tfms)
  247. {
  248. struct ipcomp_tfms *pos;
  249. int cpu;
  250. list_for_each_entry(pos, &ipcomp_tfms_list, list) {
  251. if (pos->tfms == tfms)
  252. break;
  253. }
  254. BUG_TRAP(pos);
  255. if (--pos->users)
  256. return;
  257. list_del(&pos->list);
  258. kfree(pos);
  259. if (!tfms)
  260. return;
  261. for_each_possible_cpu(cpu) {
  262. struct crypto_comp *tfm = *per_cpu_ptr(tfms, cpu);
  263. crypto_free_comp(tfm);
  264. }
  265. free_percpu(tfms);
  266. }
  267. static struct crypto_comp **ipcomp_alloc_tfms(const char *alg_name)
  268. {
  269. struct ipcomp_tfms *pos;
  270. struct crypto_comp **tfms;
  271. int cpu;
  272. /* This can be any valid CPU ID so we don't need locking. */
  273. cpu = raw_smp_processor_id();
  274. list_for_each_entry(pos, &ipcomp_tfms_list, list) {
  275. struct crypto_comp *tfm;
  276. tfms = pos->tfms;
  277. tfm = *per_cpu_ptr(tfms, cpu);
  278. if (!strcmp(crypto_comp_name(tfm), alg_name)) {
  279. pos->users++;
  280. return tfms;
  281. }
  282. }
  283. pos = kmalloc(sizeof(*pos), GFP_KERNEL);
  284. if (!pos)
  285. return NULL;
  286. pos->users = 1;
  287. INIT_LIST_HEAD(&pos->list);
  288. list_add(&pos->list, &ipcomp_tfms_list);
  289. pos->tfms = tfms = alloc_percpu(struct crypto_comp *);
  290. if (!tfms)
  291. goto error;
  292. for_each_possible_cpu(cpu) {
  293. struct crypto_comp *tfm = crypto_alloc_comp(alg_name, 0,
  294. CRYPTO_ALG_ASYNC);
  295. if (!tfm)
  296. goto error;
  297. *per_cpu_ptr(tfms, cpu) = tfm;
  298. }
  299. return tfms;
  300. error:
  301. ipcomp_free_tfms(tfms);
  302. return NULL;
  303. }
  304. static void ipcomp_free_data(struct ipcomp_data *ipcd)
  305. {
  306. if (ipcd->tfms)
  307. ipcomp_free_tfms(ipcd->tfms);
  308. ipcomp_free_scratches();
  309. }
  310. static void ipcomp_destroy(struct xfrm_state *x)
  311. {
  312. struct ipcomp_data *ipcd = x->data;
  313. if (!ipcd)
  314. return;
  315. xfrm_state_delete_tunnel(x);
  316. mutex_lock(&ipcomp_resource_mutex);
  317. ipcomp_free_data(ipcd);
  318. mutex_unlock(&ipcomp_resource_mutex);
  319. kfree(ipcd);
  320. }
  321. static int ipcomp_init_state(struct xfrm_state *x)
  322. {
  323. int err;
  324. struct ipcomp_data *ipcd;
  325. struct xfrm_algo_desc *calg_desc;
  326. err = -EINVAL;
  327. if (!x->calg)
  328. goto out;
  329. if (x->encap)
  330. goto out;
  331. err = -ENOMEM;
  332. ipcd = kzalloc(sizeof(*ipcd), GFP_KERNEL);
  333. if (!ipcd)
  334. goto out;
  335. x->props.header_len = 0;
  336. if (x->props.mode == XFRM_MODE_TUNNEL)
  337. x->props.header_len += sizeof(struct iphdr);
  338. mutex_lock(&ipcomp_resource_mutex);
  339. if (!ipcomp_alloc_scratches())
  340. goto error;
  341. ipcd->tfms = ipcomp_alloc_tfms(x->calg->alg_name);
  342. if (!ipcd->tfms)
  343. goto error;
  344. mutex_unlock(&ipcomp_resource_mutex);
  345. if (x->props.mode == XFRM_MODE_TUNNEL) {
  346. err = ipcomp_tunnel_attach(x);
  347. if (err)
  348. goto error_tunnel;
  349. }
  350. calg_desc = xfrm_calg_get_byname(x->calg->alg_name, 0);
  351. BUG_ON(!calg_desc);
  352. ipcd->threshold = calg_desc->uinfo.comp.threshold;
  353. x->data = ipcd;
  354. err = 0;
  355. out:
  356. return err;
  357. error_tunnel:
  358. mutex_lock(&ipcomp_resource_mutex);
  359. error:
  360. ipcomp_free_data(ipcd);
  361. mutex_unlock(&ipcomp_resource_mutex);
  362. kfree(ipcd);
  363. goto out;
  364. }
  365. static struct xfrm_type ipcomp_type = {
  366. .description = "IPCOMP4",
  367. .owner = THIS_MODULE,
  368. .proto = IPPROTO_COMP,
  369. .init_state = ipcomp_init_state,
  370. .destructor = ipcomp_destroy,
  371. .input = ipcomp_input,
  372. .output = ipcomp_output
  373. };
  374. static struct net_protocol ipcomp4_protocol = {
  375. .handler = xfrm4_rcv,
  376. .err_handler = ipcomp4_err,
  377. .no_policy = 1,
  378. };
  379. static int __init ipcomp4_init(void)
  380. {
  381. if (xfrm_register_type(&ipcomp_type, AF_INET) < 0) {
  382. printk(KERN_INFO "ipcomp init: can't add xfrm type\n");
  383. return -EAGAIN;
  384. }
  385. if (inet_add_protocol(&ipcomp4_protocol, IPPROTO_COMP) < 0) {
  386. printk(KERN_INFO "ipcomp init: can't add protocol\n");
  387. xfrm_unregister_type(&ipcomp_type, AF_INET);
  388. return -EAGAIN;
  389. }
  390. return 0;
  391. }
  392. static void __exit ipcomp4_fini(void)
  393. {
  394. if (inet_del_protocol(&ipcomp4_protocol, IPPROTO_COMP) < 0)
  395. printk(KERN_INFO "ip ipcomp close: can't remove protocol\n");
  396. if (xfrm_unregister_type(&ipcomp_type, AF_INET) < 0)
  397. printk(KERN_INFO "ip ipcomp close: can't remove xfrm type\n");
  398. }
  399. module_init(ipcomp4_init);
  400. module_exit(ipcomp4_fini);
  401. MODULE_LICENSE("GPL");
  402. MODULE_DESCRIPTION("IP Payload Compression Protocol (IPComp) - RFC3173");
  403. MODULE_AUTHOR("James Morris <jmorris@intercode.com.au>");
  404. MODULE_ALIAS_XFRM_TYPE(AF_INET, XFRM_PROTO_COMP);