2019-05-27 09:55:01 +03:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
2008-07-25 13:54:40 +04:00
|
|
|
/*
|
|
|
|
* IP Payload Compression Protocol (IPComp) - RFC3173.
|
|
|
|
*
|
|
|
|
* Copyright (c) 2003 James Morris <jmorris@intercode.com.au>
|
|
|
|
* Copyright (c) 2003-2008 Herbert Xu <herbert@gondor.apana.org.au>
|
|
|
|
*
|
|
|
|
* Todo:
|
|
|
|
* - Tunable compression parameters.
|
|
|
|
* - Compression stats.
|
|
|
|
* - Adaptive compression.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/crypto.h>
|
|
|
|
#include <linux/err.h>
|
|
|
|
#include <linux/list.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/mutex.h>
|
|
|
|
#include <linux/percpu.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 11:04:11 +03:00
|
|
|
#include <linux/slab.h>
|
2008-07-25 13:54:40 +04:00
|
|
|
#include <linux/smp.h>
|
|
|
|
#include <linux/vmalloc.h>
|
|
|
|
#include <net/ip.h>
|
|
|
|
#include <net/ipcomp.h>
|
|
|
|
#include <net/xfrm.h>
|
|
|
|
|
|
|
|
struct ipcomp_tfms {
|
|
|
|
struct list_head list;
|
2010-02-16 18:20:26 +03:00
|
|
|
struct crypto_comp * __percpu *tfms;
|
2008-07-25 13:54:40 +04:00
|
|
|
int users;
|
|
|
|
};
|
|
|
|
|
|
|
|
static DEFINE_MUTEX(ipcomp_resource_mutex);
|
2010-02-16 18:20:26 +03:00
|
|
|
static void * __percpu *ipcomp_scratches;
|
2008-07-25 13:54:40 +04:00
|
|
|
static int ipcomp_scratch_users;
|
|
|
|
static LIST_HEAD(ipcomp_tfms_list);
|
|
|
|
|
|
|
|
static int ipcomp_decompress(struct xfrm_state *x, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
struct ipcomp_data *ipcd = x->data;
|
|
|
|
const int plen = skb->len;
|
|
|
|
int dlen = IPCOMP_SCRATCH_SIZE;
|
|
|
|
const u8 *start = skb->data;
|
2021-04-16 18:11:46 +03:00
|
|
|
u8 *scratch = *this_cpu_ptr(ipcomp_scratches);
|
|
|
|
struct crypto_comp *tfm = *this_cpu_ptr(ipcd->tfms);
|
2008-07-25 13:54:40 +04:00
|
|
|
int err = crypto_comp_decompress(tfm, start, plen, scratch, &dlen);
|
2008-07-25 13:55:33 +04:00
|
|
|
int len;
|
2008-07-25 13:54:40 +04:00
|
|
|
|
|
|
|
if (err)
|
2021-04-16 18:11:46 +03:00
|
|
|
return err;
|
2008-07-25 13:54:40 +04:00
|
|
|
|
2021-04-16 18:11:46 +03:00
|
|
|
if (dlen < (plen + sizeof(struct ip_comp_hdr)))
|
|
|
|
return -EINVAL;
|
2008-07-25 13:54:40 +04:00
|
|
|
|
2008-07-25 13:55:33 +04:00
|
|
|
len = dlen - plen;
|
|
|
|
if (len > skb_tailroom(skb))
|
|
|
|
len = skb_tailroom(skb);
|
|
|
|
|
|
|
|
__skb_put(skb, len);
|
|
|
|
|
|
|
|
len += plen;
|
|
|
|
skb_copy_to_linear_data(skb, scratch, len);
|
|
|
|
|
|
|
|
while ((scratch += len, dlen -= len) > 0) {
|
|
|
|
skb_frag_t *frag;
|
2011-08-23 03:45:01 +04:00
|
|
|
struct page *page;
|
2008-07-25 13:55:33 +04:00
|
|
|
|
|
|
|
if (WARN_ON(skb_shinfo(skb)->nr_frags >= MAX_SKB_FRAGS))
|
2021-04-16 18:11:46 +03:00
|
|
|
return -EMSGSIZE;
|
2008-07-25 13:55:33 +04:00
|
|
|
|
|
|
|
frag = skb_shinfo(skb)->frags + skb_shinfo(skb)->nr_frags;
|
2011-08-23 03:45:01 +04:00
|
|
|
page = alloc_page(GFP_ATOMIC);
|
2008-07-25 13:55:33 +04:00
|
|
|
|
2011-08-23 03:45:01 +04:00
|
|
|
if (!page)
|
2021-04-16 18:11:46 +03:00
|
|
|
return -ENOMEM;
|
2008-07-25 13:55:33 +04:00
|
|
|
|
2011-08-23 03:45:01 +04:00
|
|
|
__skb_frag_set_page(frag, page);
|
|
|
|
|
2008-07-25 13:55:33 +04:00
|
|
|
len = PAGE_SIZE;
|
|
|
|
if (dlen < len)
|
|
|
|
len = dlen;
|
|
|
|
|
2019-07-30 17:40:33 +03:00
|
|
|
skb_frag_off_set(frag, 0);
|
2011-10-19 01:00:24 +04:00
|
|
|
skb_frag_size_set(frag, len);
|
2011-08-23 03:45:01 +04:00
|
|
|
memcpy(skb_frag_address(frag), scratch, len);
|
|
|
|
|
2008-07-25 13:55:33 +04:00
|
|
|
skb->truesize += len;
|
|
|
|
skb->data_len += len;
|
|
|
|
skb->len += len;
|
|
|
|
|
|
|
|
skb_shinfo(skb)->nr_frags++;
|
|
|
|
}
|
|
|
|
|
2021-04-16 18:11:46 +03:00
|
|
|
return 0;
|
2008-07-25 13:54:40 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
int ipcomp_input(struct xfrm_state *x, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
int nexthdr;
|
|
|
|
int err = -ENOMEM;
|
|
|
|
struct ip_comp_hdr *ipch;
|
|
|
|
|
|
|
|
if (skb_linearize_cow(skb))
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
skb->ip_summed = CHECKSUM_NONE;
|
|
|
|
|
|
|
|
/* Remove ipcomp header and decompress original payload */
|
|
|
|
ipch = (void *)skb->data;
|
|
|
|
nexthdr = ipch->nexthdr;
|
|
|
|
|
|
|
|
skb->transport_header = skb->network_header + sizeof(*ipch);
|
|
|
|
__skb_pull(skb, sizeof(*ipch));
|
|
|
|
err = ipcomp_decompress(x, skb);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
err = nexthdr;
|
|
|
|
|
|
|
|
out:
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(ipcomp_input);
|
|
|
|
|
|
|
|
static int ipcomp_compress(struct xfrm_state *x, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
struct ipcomp_data *ipcd = x->data;
|
|
|
|
const int plen = skb->len;
|
|
|
|
int dlen = IPCOMP_SCRATCH_SIZE;
|
|
|
|
u8 *start = skb->data;
|
2013-10-17 17:07:40 +04:00
|
|
|
struct crypto_comp *tfm;
|
|
|
|
u8 *scratch;
|
2008-07-25 13:54:40 +04:00
|
|
|
int err;
|
|
|
|
|
|
|
|
local_bh_disable();
|
2013-10-17 17:07:40 +04:00
|
|
|
scratch = *this_cpu_ptr(ipcomp_scratches);
|
|
|
|
tfm = *this_cpu_ptr(ipcd->tfms);
|
2008-07-25 13:54:40 +04:00
|
|
|
err = crypto_comp_compress(tfm, start, plen, scratch, &dlen);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
if ((dlen + sizeof(struct ip_comp_hdr)) >= plen) {
|
|
|
|
err = -EMSGSIZE;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
memcpy(start + sizeof(struct ip_comp_hdr), scratch, dlen);
|
2013-10-17 17:07:40 +04:00
|
|
|
local_bh_enable();
|
2008-07-25 13:54:40 +04:00
|
|
|
|
|
|
|
pskb_trim(skb, dlen + sizeof(struct ip_comp_hdr));
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
out:
|
2013-10-17 17:07:40 +04:00
|
|
|
local_bh_enable();
|
2008-07-25 13:54:40 +04:00
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ipcomp_output(struct xfrm_state *x, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
int err;
|
|
|
|
struct ip_comp_hdr *ipch;
|
|
|
|
struct ipcomp_data *ipcd = x->data;
|
|
|
|
|
|
|
|
if (skb->len < ipcd->threshold) {
|
|
|
|
/* Don't bother compressing */
|
|
|
|
goto out_ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (skb_linearize_cow(skb))
|
|
|
|
goto out_ok;
|
|
|
|
|
|
|
|
err = ipcomp_compress(x, skb);
|
|
|
|
|
|
|
|
if (err) {
|
|
|
|
goto out_ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Install ipcomp header, convert into ipcomp datagram. */
|
|
|
|
ipch = ip_comp_hdr(skb);
|
|
|
|
ipch->nexthdr = *skb_mac_header(skb);
|
|
|
|
ipch->flags = 0;
|
|
|
|
ipch->cpi = htons((u16 )ntohl(x->id.spi));
|
|
|
|
*skb_mac_header(skb) = IPPROTO_COMP;
|
|
|
|
out_ok:
|
|
|
|
skb_push(skb, -skb_network_offset(skb));
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(ipcomp_output);
|
|
|
|
|
|
|
|
static void ipcomp_free_scratches(void)
|
|
|
|
{
|
|
|
|
int i;
|
2010-02-16 18:20:26 +03:00
|
|
|
void * __percpu *scratches;
|
2008-07-25 13:54:40 +04:00
|
|
|
|
|
|
|
if (--ipcomp_scratch_users)
|
|
|
|
return;
|
|
|
|
|
|
|
|
scratches = ipcomp_scratches;
|
|
|
|
if (!scratches)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_possible_cpu(i)
|
|
|
|
vfree(*per_cpu_ptr(scratches, i));
|
|
|
|
|
|
|
|
free_percpu(scratches);
|
2022-09-01 10:12:10 +03:00
|
|
|
ipcomp_scratches = NULL;
|
2008-07-25 13:54:40 +04:00
|
|
|
}
|
|
|
|
|
2010-02-16 18:20:26 +03:00
|
|
|
static void * __percpu *ipcomp_alloc_scratches(void)
|
2008-07-25 13:54:40 +04:00
|
|
|
{
|
2010-02-16 18:20:26 +03:00
|
|
|
void * __percpu *scratches;
|
2013-10-18 14:54:16 +04:00
|
|
|
int i;
|
2008-07-25 13:54:40 +04:00
|
|
|
|
|
|
|
if (ipcomp_scratch_users++)
|
|
|
|
return ipcomp_scratches;
|
|
|
|
|
|
|
|
scratches = alloc_percpu(void *);
|
|
|
|
if (!scratches)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
ipcomp_scratches = scratches;
|
|
|
|
|
|
|
|
for_each_possible_cpu(i) {
|
2013-10-18 14:54:16 +04:00
|
|
|
void *scratch;
|
|
|
|
|
|
|
|
scratch = vmalloc_node(IPCOMP_SCRATCH_SIZE, cpu_to_node(i));
|
2008-07-25 13:54:40 +04:00
|
|
|
if (!scratch)
|
|
|
|
return NULL;
|
|
|
|
*per_cpu_ptr(scratches, i) = scratch;
|
|
|
|
}
|
|
|
|
|
|
|
|
return scratches;
|
|
|
|
}
|
|
|
|
|
2010-02-16 18:20:26 +03:00
|
|
|
static void ipcomp_free_tfms(struct crypto_comp * __percpu *tfms)
|
2008-07-25 13:54:40 +04:00
|
|
|
{
|
|
|
|
struct ipcomp_tfms *pos;
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
list_for_each_entry(pos, &ipcomp_tfms_list, list) {
|
|
|
|
if (pos->tfms == tfms)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2021-07-25 20:53:55 +03:00
|
|
|
WARN_ON(list_entry_is_head(pos, &ipcomp_tfms_list, list));
|
2008-07-25 13:54:40 +04:00
|
|
|
|
|
|
|
if (--pos->users)
|
|
|
|
return;
|
|
|
|
|
|
|
|
list_del(&pos->list);
|
|
|
|
kfree(pos);
|
|
|
|
|
|
|
|
if (!tfms)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_possible_cpu(cpu) {
|
|
|
|
struct crypto_comp *tfm = *per_cpu_ptr(tfms, cpu);
|
|
|
|
crypto_free_comp(tfm);
|
|
|
|
}
|
|
|
|
free_percpu(tfms);
|
|
|
|
}
|
|
|
|
|
2010-02-16 18:20:26 +03:00
|
|
|
static struct crypto_comp * __percpu *ipcomp_alloc_tfms(const char *alg_name)
|
2008-07-25 13:54:40 +04:00
|
|
|
{
|
|
|
|
struct ipcomp_tfms *pos;
|
2010-02-16 18:20:26 +03:00
|
|
|
struct crypto_comp * __percpu *tfms;
|
2008-07-25 13:54:40 +04:00
|
|
|
int cpu;
|
|
|
|
|
|
|
|
|
|
|
|
list_for_each_entry(pos, &ipcomp_tfms_list, list) {
|
|
|
|
struct crypto_comp *tfm;
|
|
|
|
|
net: xfrm: use __this_cpu_read per-cpu helper
this_cpu_ptr/this_cpu_read is faster than per_cpu_ptr(p, smp_processor_id())
and can reduce memory accesses.
The latter helper needs to find the offset for current cpu,
and needs more assembler instructions which objdump shows in following.
this_cpu_ptr relocates and address. this_cpu_read() relocates the address
and performs the fetch. this_cpu_read() saves you more instructions
since it can do the relocation and the fetch in one instruction.
per_cpu_ptr(p, smp_processor_id()):
1e: 65 8b 04 25 00 00 00 00 mov %gs:0x0,%eax
26: 48 98 cltq
28: 31 f6 xor %esi,%esi
2a: 48 c7 c7 00 00 00 00 mov $0x0,%rdi
31: 48 8b 04 c5 00 00 00 00 mov 0x0(,%rax,8),%rax
39: c7 44 10 04 14 00 00 00 movl $0x14,0x4(%rax,%rdx,1)
this_cpu_ptr(p)
1e: 65 48 03 14 25 00 00 00 00 add %gs:0x0,%rdx
27: 31 f6 xor %esi,%esi
29: c7 42 04 14 00 00 00 movl $0x14,0x4(%rdx)
30: 48 c7 c7 00 00 00 00 mov $0x0,%rdi
Signed-off-by: Shan Wei <davidshan@tencent.com>
Signed-off-by: Steffen Klassert <steffen.klassert@secunet.com>
2012-11-13 16:36:00 +04:00
|
|
|
/* This can be any valid CPU ID so we don't need locking. */
|
2018-03-08 01:42:53 +03:00
|
|
|
tfm = this_cpu_read(*pos->tfms);
|
2008-07-25 13:54:40 +04:00
|
|
|
|
|
|
|
if (!strcmp(crypto_comp_name(tfm), alg_name)) {
|
|
|
|
pos->users++;
|
net: xfrm: use __this_cpu_read per-cpu helper
this_cpu_ptr/this_cpu_read is faster than per_cpu_ptr(p, smp_processor_id())
and can reduce memory accesses.
The latter helper needs to find the offset for current cpu,
and needs more assembler instructions which objdump shows in following.
this_cpu_ptr relocates and address. this_cpu_read() relocates the address
and performs the fetch. this_cpu_read() saves you more instructions
since it can do the relocation and the fetch in one instruction.
per_cpu_ptr(p, smp_processor_id()):
1e: 65 8b 04 25 00 00 00 00 mov %gs:0x0,%eax
26: 48 98 cltq
28: 31 f6 xor %esi,%esi
2a: 48 c7 c7 00 00 00 00 mov $0x0,%rdi
31: 48 8b 04 c5 00 00 00 00 mov 0x0(,%rax,8),%rax
39: c7 44 10 04 14 00 00 00 movl $0x14,0x4(%rax,%rdx,1)
this_cpu_ptr(p)
1e: 65 48 03 14 25 00 00 00 00 add %gs:0x0,%rdx
27: 31 f6 xor %esi,%esi
29: c7 42 04 14 00 00 00 movl $0x14,0x4(%rdx)
30: 48 c7 c7 00 00 00 00 mov $0x0,%rdi
Signed-off-by: Shan Wei <davidshan@tencent.com>
Signed-off-by: Steffen Klassert <steffen.klassert@secunet.com>
2012-11-13 16:36:00 +04:00
|
|
|
return pos->tfms;
|
2008-07-25 13:54:40 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pos = kmalloc(sizeof(*pos), GFP_KERNEL);
|
|
|
|
if (!pos)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
pos->users = 1;
|
|
|
|
INIT_LIST_HEAD(&pos->list);
|
|
|
|
list_add(&pos->list, &ipcomp_tfms_list);
|
|
|
|
|
|
|
|
pos->tfms = tfms = alloc_percpu(struct crypto_comp *);
|
|
|
|
if (!tfms)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
for_each_possible_cpu(cpu) {
|
|
|
|
struct crypto_comp *tfm = crypto_alloc_comp(alg_name, 0,
|
|
|
|
CRYPTO_ALG_ASYNC);
|
|
|
|
if (IS_ERR(tfm))
|
|
|
|
goto error;
|
|
|
|
*per_cpu_ptr(tfms, cpu) = tfm;
|
|
|
|
}
|
|
|
|
|
|
|
|
return tfms;
|
|
|
|
|
|
|
|
error:
|
|
|
|
ipcomp_free_tfms(tfms);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void ipcomp_free_data(struct ipcomp_data *ipcd)
|
|
|
|
{
|
|
|
|
if (ipcd->tfms)
|
|
|
|
ipcomp_free_tfms(ipcd->tfms);
|
|
|
|
ipcomp_free_scratches();
|
|
|
|
}
|
|
|
|
|
|
|
|
void ipcomp_destroy(struct xfrm_state *x)
|
|
|
|
{
|
|
|
|
struct ipcomp_data *ipcd = x->data;
|
|
|
|
if (!ipcd)
|
|
|
|
return;
|
|
|
|
xfrm_state_delete_tunnel(x);
|
|
|
|
mutex_lock(&ipcomp_resource_mutex);
|
|
|
|
ipcomp_free_data(ipcd);
|
|
|
|
mutex_unlock(&ipcomp_resource_mutex);
|
|
|
|
kfree(ipcd);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(ipcomp_destroy);
|
|
|
|
|
|
|
|
int ipcomp_init_state(struct xfrm_state *x)
|
|
|
|
{
|
|
|
|
int err;
|
|
|
|
struct ipcomp_data *ipcd;
|
|
|
|
struct xfrm_algo_desc *calg_desc;
|
|
|
|
|
|
|
|
err = -EINVAL;
|
|
|
|
if (!x->calg)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
if (x->encap)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
err = -ENOMEM;
|
|
|
|
ipcd = kzalloc(sizeof(*ipcd), GFP_KERNEL);
|
|
|
|
if (!ipcd)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
mutex_lock(&ipcomp_resource_mutex);
|
|
|
|
if (!ipcomp_alloc_scratches())
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
ipcd->tfms = ipcomp_alloc_tfms(x->calg->alg_name);
|
|
|
|
if (!ipcd->tfms)
|
|
|
|
goto error;
|
|
|
|
mutex_unlock(&ipcomp_resource_mutex);
|
|
|
|
|
|
|
|
calg_desc = xfrm_calg_get_byname(x->calg->alg_name, 0);
|
|
|
|
BUG_ON(!calg_desc);
|
|
|
|
ipcd->threshold = calg_desc->uinfo.comp.threshold;
|
|
|
|
x->data = ipcd;
|
|
|
|
err = 0;
|
|
|
|
out:
|
|
|
|
return err;
|
|
|
|
|
|
|
|
error:
|
|
|
|
ipcomp_free_data(ipcd);
|
|
|
|
mutex_unlock(&ipcomp_resource_mutex);
|
|
|
|
kfree(ipcd);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(ipcomp_init_state);
|
|
|
|
|
|
|
|
MODULE_LICENSE("GPL");
|
|
|
|
MODULE_DESCRIPTION("IP Payload Compression Protocol (IPComp) - RFC3173");
|
|
|
|
MODULE_AUTHOR("James Morris <jmorris@intercode.com.au>");
|