6253db055e
Multi-page allocations are always likely to fail. Since such failures are expected and non-critical in xfrm_hash_alloc, we shouldn't warn about them. Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au> Signed-off-by: David S. Miller <davem@davemloft.net>
42 lines
809 B
C
42 lines
809 B
C
/* xfrm_hash.c: Common hash table code.
|
|
*
|
|
* Copyright (C) 2006 David S. Miller (davem@davemloft.net)
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
#include <linux/mm.h>
|
|
#include <linux/bootmem.h>
|
|
#include <linux/vmalloc.h>
|
|
#include <linux/slab.h>
|
|
#include <linux/xfrm.h>
|
|
|
|
#include "xfrm_hash.h"
|
|
|
|
struct hlist_head *xfrm_hash_alloc(unsigned int sz)
|
|
{
|
|
struct hlist_head *n;
|
|
|
|
if (sz <= PAGE_SIZE)
|
|
n = kmalloc(sz, GFP_KERNEL);
|
|
else if (hashdist)
|
|
n = __vmalloc(sz, GFP_KERNEL, PAGE_KERNEL);
|
|
else
|
|
n = (struct hlist_head *)
|
|
__get_free_pages(GFP_KERNEL | __GFP_NOWARN,
|
|
get_order(sz));
|
|
|
|
if (n)
|
|
memset(n, 0, sz);
|
|
|
|
return n;
|
|
}
|
|
|
|
void xfrm_hash_free(struct hlist_head *n, unsigned int sz)
|
|
{
|
|
if (sz <= PAGE_SIZE)
|
|
kfree(n);
|
|
else if (hashdist)
|
|
vfree(n);
|
|
else
|
|
free_pages((unsigned long)n, get_order(sz));
|
|
}
|