summaryrefslogtreecommitdiffstats
path: root/lib/generic-radix-tree.c
diff options
context:
space:
mode:
Diffstat (limited to 'lib/generic-radix-tree.c')
-rw-r--r--lib/generic-radix-tree.c32
1 files changed, 26 insertions, 6 deletions
diff --git a/lib/generic-radix-tree.c b/lib/generic-radix-tree.c
index ae25e2fa2187..f25eb111c051 100644
--- a/lib/generic-radix-tree.c
+++ b/lib/generic-radix-tree.c
@@ -2,6 +2,7 @@
2#include <linux/export.h> 2#include <linux/export.h>
3#include <linux/generic-radix-tree.h> 3#include <linux/generic-radix-tree.h>
4#include <linux/gfp.h> 4#include <linux/gfp.h>
5#include <linux/kmemleak.h>
5 6
6#define GENRADIX_ARY (PAGE_SIZE / sizeof(struct genradix_node *)) 7#define GENRADIX_ARY (PAGE_SIZE / sizeof(struct genradix_node *))
7#define GENRADIX_ARY_SHIFT ilog2(GENRADIX_ARY) 8#define GENRADIX_ARY_SHIFT ilog2(GENRADIX_ARY)
@@ -75,6 +76,27 @@ void *__genradix_ptr(struct __genradix *radix, size_t offset)
75} 76}
76EXPORT_SYMBOL(__genradix_ptr); 77EXPORT_SYMBOL(__genradix_ptr);
77 78
79static inline struct genradix_node *genradix_alloc_node(gfp_t gfp_mask)
80{
81 struct genradix_node *node;
82
83 node = (struct genradix_node *)__get_free_page(gfp_mask|__GFP_ZERO);
84
85 /*
86 * We're using pages (not slab allocations) directly for kernel data
87 * structures, so we need to explicitly inform kmemleak of them in order
88 * to avoid false positive memory leak reports.
89 */
90 kmemleak_alloc(node, PAGE_SIZE, 1, gfp_mask);
91 return node;
92}
93
94static inline void genradix_free_node(struct genradix_node *node)
95{
96 kmemleak_free(node);
97 free_page((unsigned long)node);
98}
99
78/* 100/*
79 * Returns pointer to the specified byte @offset within @radix, allocating it if 101 * Returns pointer to the specified byte @offset within @radix, allocating it if
80 * necessary - newly allocated slots are always zeroed out: 102 * necessary - newly allocated slots are always zeroed out:
@@ -97,8 +119,7 @@ void *__genradix_ptr_alloc(struct __genradix *radix, size_t offset,
97 break; 119 break;
98 120
99 if (!new_node) { 121 if (!new_node) {
100 new_node = (void *) 122 new_node = genradix_alloc_node(gfp_mask);
101 __get_free_page(gfp_mask|__GFP_ZERO);
102 if (!new_node) 123 if (!new_node)
103 return NULL; 124 return NULL;
104 } 125 }
@@ -121,8 +142,7 @@ void *__genradix_ptr_alloc(struct __genradix *radix, size_t offset,
121 n = READ_ONCE(*p); 142 n = READ_ONCE(*p);
122 if (!n) { 143 if (!n) {
123 if (!new_node) { 144 if (!new_node) {
124 new_node = (void *) 145 new_node = genradix_alloc_node(gfp_mask);
125 __get_free_page(gfp_mask|__GFP_ZERO);
126 if (!new_node) 146 if (!new_node)
127 return NULL; 147 return NULL;
128 } 148 }
@@ -133,7 +153,7 @@ void *__genradix_ptr_alloc(struct __genradix *radix, size_t offset,
133 } 153 }
134 154
135 if (new_node) 155 if (new_node)
136 free_page((unsigned long) new_node); 156 genradix_free_node(new_node);
137 157
138 return &n->data[offset]; 158 return &n->data[offset];
139} 159}
@@ -191,7 +211,7 @@ static void genradix_free_recurse(struct genradix_node *n, unsigned level)
191 genradix_free_recurse(n->children[i], level - 1); 211 genradix_free_recurse(n->children[i], level - 1);
192 } 212 }
193 213
194 free_page((unsigned long) n); 214 genradix_free_node(n);
195} 215}
196 216
197int __genradix_prealloc(struct __genradix *radix, size_t size, 217int __genradix_prealloc(struct __genradix *radix, size_t size,