Commit | Line | Data |
---|---|---|
b2441318 | 1 | // SPDX-License-Identifier: GPL-2.0 |
1366c37e MW |
2 | #include <stdlib.h> |
3 | #include <string.h> | |
4 | #include <malloc.h> | |
bbe9d71f | 5 | #include <pthread.h> |
1366c37e MW |
6 | #include <unistd.h> |
7 | #include <assert.h> | |
8 | ||
12ea6539 | 9 | #include <linux/gfp.h> |
bbe9d71f | 10 | #include <linux/poison.h> |
1366c37e | 11 | #include <linux/slab.h> |
bbe9d71f | 12 | #include <linux/radix-tree.h> |
1366c37e MW |
13 | #include <urcu/uatomic.h> |
14 | ||
15 | int nr_allocated; | |
847d3576 | 16 | int preempt_count; |
5eeb2d23 | 17 | int kmalloc_verbose; |
73bc029b | 18 | int test_verbose; |
1366c37e | 19 | |
bbe9d71f MW |
20 | struct kmem_cache { |
21 | pthread_mutex_t lock; | |
22 | int size; | |
23 | int nr_objs; | |
24 | void *objs; | |
25 | void (*ctor)(void *); | |
26 | }; | |
27 | ||
1366c37e MW |
28 | void *kmem_cache_alloc(struct kmem_cache *cachep, int flags) |
29 | { | |
bbe9d71f | 30 | struct radix_tree_node *node; |
31023cd6 | 31 | |
3d4d5d61 | 32 | if (!(flags & __GFP_DIRECT_RECLAIM)) |
31023cd6 MW |
33 | return NULL; |
34 | ||
bbe9d71f MW |
35 | pthread_mutex_lock(&cachep->lock); |
36 | if (cachep->nr_objs) { | |
37 | cachep->nr_objs--; | |
38 | node = cachep->objs; | |
1293d5c5 | 39 | cachep->objs = node->parent; |
bbe9d71f | 40 | pthread_mutex_unlock(&cachep->lock); |
1293d5c5 | 41 | node->parent = NULL; |
bbe9d71f MW |
42 | } else { |
43 | pthread_mutex_unlock(&cachep->lock); | |
44 | node = malloc(cachep->size); | |
45 | if (cachep->ctor) | |
46 | cachep->ctor(node); | |
47 | } | |
48 | ||
1366c37e | 49 | uatomic_inc(&nr_allocated); |
5eeb2d23 MW |
50 | if (kmalloc_verbose) |
51 | printf("Allocating %p from slab\n", node); | |
bbe9d71f | 52 | return node; |
1366c37e MW |
53 | } |
54 | ||
55 | void kmem_cache_free(struct kmem_cache *cachep, void *objp) | |
56 | { | |
57 | assert(objp); | |
58 | uatomic_dec(&nr_allocated); | |
5eeb2d23 MW |
59 | if (kmalloc_verbose) |
60 | printf("Freeing %p to slab\n", objp); | |
bbe9d71f MW |
61 | pthread_mutex_lock(&cachep->lock); |
62 | if (cachep->nr_objs > 10) { | |
63 | memset(objp, POISON_FREE, cachep->size); | |
64 | free(objp); | |
65 | } else { | |
66 | struct radix_tree_node *node = objp; | |
67 | cachep->nr_objs++; | |
1293d5c5 | 68 | node->parent = cachep->objs; |
bbe9d71f MW |
69 | cachep->objs = node; |
70 | } | |
71 | pthread_mutex_unlock(&cachep->lock); | |
1366c37e MW |
72 | } |
73 | ||
de1af8f6 MW |
74 | void *kmalloc(size_t size, gfp_t gfp) |
75 | { | |
3d4d5d61 MW |
76 | void *ret; |
77 | ||
78 | if (!(gfp & __GFP_DIRECT_RECLAIM)) | |
79 | return NULL; | |
80 | ||
81 | ret = malloc(size); | |
de1af8f6 | 82 | uatomic_inc(&nr_allocated); |
5eeb2d23 MW |
83 | if (kmalloc_verbose) |
84 | printf("Allocating %p from malloc\n", ret); | |
3d4d5d61 MW |
85 | if (gfp & __GFP_ZERO) |
86 | memset(ret, 0, size); | |
de1af8f6 MW |
87 | return ret; |
88 | } | |
89 | ||
90 | void kfree(void *p) | |
91 | { | |
92 | if (!p) | |
93 | return; | |
94 | uatomic_dec(&nr_allocated); | |
5eeb2d23 MW |
95 | if (kmalloc_verbose) |
96 | printf("Freeing %p to malloc\n", p); | |
de1af8f6 MW |
97 | free(p); |
98 | } | |
99 | ||
1366c37e MW |
100 | struct kmem_cache * |
101 | kmem_cache_create(const char *name, size_t size, size_t offset, | |
102 | unsigned long flags, void (*ctor)(void *)) | |
103 | { | |
104 | struct kmem_cache *ret = malloc(sizeof(*ret)); | |
105 | ||
bbe9d71f | 106 | pthread_mutex_init(&ret->lock, NULL); |
1366c37e | 107 | ret->size = size; |
bbe9d71f MW |
108 | ret->nr_objs = 0; |
109 | ret->objs = NULL; | |
1366c37e MW |
110 | ret->ctor = ctor; |
111 | return ret; | |
112 | } |