diff options
Diffstat (limited to 'tools/testing/radix-tree/linux.c')
-rw-r--r-- | tools/testing/radix-tree/linux.c | 67 |
1 files changed, 61 insertions, 6 deletions
diff --git a/tools/testing/radix-tree/linux.c b/tools/testing/radix-tree/linux.c index 154823737b20..d31ea7c9abec 100644 --- a/tools/testing/radix-tree/linux.c +++ b/tools/testing/radix-tree/linux.c | |||
@@ -1,14 +1,26 @@ | |||
1 | #include <stdlib.h> | 1 | #include <stdlib.h> |
2 | #include <string.h> | 2 | #include <string.h> |
3 | #include <malloc.h> | 3 | #include <malloc.h> |
4 | #include <pthread.h> | ||
4 | #include <unistd.h> | 5 | #include <unistd.h> |
5 | #include <assert.h> | 6 | #include <assert.h> |
6 | 7 | ||
7 | #include <linux/mempool.h> | 8 | #include <linux/mempool.h> |
9 | #include <linux/poison.h> | ||
8 | #include <linux/slab.h> | 10 | #include <linux/slab.h> |
11 | #include <linux/radix-tree.h> | ||
9 | #include <urcu/uatomic.h> | 12 | #include <urcu/uatomic.h> |
10 | 13 | ||
11 | int nr_allocated; | 14 | int nr_allocated; |
15 | int preempt_count; | ||
16 | |||
17 | struct kmem_cache { | ||
18 | pthread_mutex_t lock; | ||
19 | int size; | ||
20 | int nr_objs; | ||
21 | void *objs; | ||
22 | void (*ctor)(void *); | ||
23 | }; | ||
12 | 24 | ||
13 | void *mempool_alloc(mempool_t *pool, int gfp_mask) | 25 | void *mempool_alloc(mempool_t *pool, int gfp_mask) |
14 | { | 26 | { |
@@ -33,19 +45,59 @@ mempool_t *mempool_create(int min_nr, mempool_alloc_t *alloc_fn, | |||
33 | 45 | ||
34 | void *kmem_cache_alloc(struct kmem_cache *cachep, int flags) | 46 | void *kmem_cache_alloc(struct kmem_cache *cachep, int flags) |
35 | { | 47 | { |
36 | void *ret = malloc(cachep->size); | 48 | struct radix_tree_node *node; |
37 | if (cachep->ctor) | 49 | |
38 | cachep->ctor(ret); | 50 | if (flags & __GFP_NOWARN) |
51 | return NULL; | ||
52 | |||
53 | pthread_mutex_lock(&cachep->lock); | ||
54 | if (cachep->nr_objs) { | ||
55 | cachep->nr_objs--; | ||
56 | node = cachep->objs; | ||
57 | cachep->objs = node->private_data; | ||
58 | pthread_mutex_unlock(&cachep->lock); | ||
59 | node->private_data = NULL; | ||
60 | } else { | ||
61 | pthread_mutex_unlock(&cachep->lock); | ||
62 | node = malloc(cachep->size); | ||
63 | if (cachep->ctor) | ||
64 | cachep->ctor(node); | ||
65 | } | ||
66 | |||
39 | uatomic_inc(&nr_allocated); | 67 | uatomic_inc(&nr_allocated); |
40 | return ret; | 68 | return node; |
41 | } | 69 | } |
42 | 70 | ||
43 | void kmem_cache_free(struct kmem_cache *cachep, void *objp) | 71 | void kmem_cache_free(struct kmem_cache *cachep, void *objp) |
44 | { | 72 | { |
45 | assert(objp); | 73 | assert(objp); |
46 | uatomic_dec(&nr_allocated); | 74 | uatomic_dec(&nr_allocated); |
47 | memset(objp, 0, cachep->size); | 75 | pthread_mutex_lock(&cachep->lock); |
48 | free(objp); | 76 | if (cachep->nr_objs > 10) { |
77 | memset(objp, POISON_FREE, cachep->size); | ||
78 | free(objp); | ||
79 | } else { | ||
80 | struct radix_tree_node *node = objp; | ||
81 | cachep->nr_objs++; | ||
82 | node->private_data = cachep->objs; | ||
83 | cachep->objs = node; | ||
84 | } | ||
85 | pthread_mutex_unlock(&cachep->lock); | ||
86 | } | ||
87 | |||
88 | void *kmalloc(size_t size, gfp_t gfp) | ||
89 | { | ||
90 | void *ret = malloc(size); | ||
91 | uatomic_inc(&nr_allocated); | ||
92 | return ret; | ||
93 | } | ||
94 | |||
95 | void kfree(void *p) | ||
96 | { | ||
97 | if (!p) | ||
98 | return; | ||
99 | uatomic_dec(&nr_allocated); | ||
100 | free(p); | ||
49 | } | 101 | } |
50 | 102 | ||
51 | struct kmem_cache * | 103 | struct kmem_cache * |
@@ -54,7 +106,10 @@ kmem_cache_create(const char *name, size_t size, size_t offset, | |||
54 | { | 106 | { |
55 | struct kmem_cache *ret = malloc(sizeof(*ret)); | 107 | struct kmem_cache *ret = malloc(sizeof(*ret)); |
56 | 108 | ||
109 | pthread_mutex_init(&ret->lock, NULL); | ||
57 | ret->size = size; | 110 | ret->size = size; |
111 | ret->nr_objs = 0; | ||
112 | ret->objs = NULL; | ||
58 | ret->ctor = ctor; | 113 | ret->ctor = ctor; |
59 | return ret; | 114 | return ret; |
60 | } | 115 | } |