Lines Matching full:element
25 static void poison_error(mempool_t *pool, void *element, size_t size, in poison_error() argument
33 pr_err("BUG: mempool element poison mismatch\n"); in poison_error()
35 pr_err(" nr=%d @ %p: %s0x", nr, element, start > 0 ? "... " : ""); in poison_error()
37 pr_cont("%x ", *(u8 *)(element + i)); in poison_error()
42 static void __check_element(mempool_t *pool, void *element, size_t size) in __check_element() argument
44 u8 *obj = element; in __check_element()
51 poison_error(pool, element, size, i); in __check_element()
58 static void check_element(mempool_t *pool, void *element) in check_element() argument
62 __check_element(pool, element, ksize(element)); in check_element()
67 void *addr = kmap_atomic((struct page *)element); in check_element()
74 static void __poison_element(void *element, size_t size) in __poison_element() argument
76 u8 *obj = element; in __poison_element()
82 static void poison_element(mempool_t *pool, void *element) in poison_element() argument
86 __poison_element(element, ksize(element)); in poison_element()
91 void *addr = kmap_atomic((struct page *)element); in poison_element()
98 static inline void check_element(mempool_t *pool, void *element) in check_element() argument
101 static inline void poison_element(mempool_t *pool, void *element) in poison_element() argument
106 static __always_inline void kasan_poison_element(mempool_t *pool, void *element) in kasan_poison_element() argument
109 kasan_poison_kfree(element, _RET_IP_); in kasan_poison_element()
111 kasan_free_pages(element, (unsigned long)pool->pool_data); in kasan_poison_element()
114 static void kasan_unpoison_element(mempool_t *pool, void *element) in kasan_unpoison_element() argument
117 kasan_unpoison_slab(element); in kasan_unpoison_element()
119 kasan_alloc_pages(element, (unsigned long)pool->pool_data); in kasan_unpoison_element()
122 static __always_inline void add_element(mempool_t *pool, void *element) in add_element() argument
125 poison_element(pool, element); in add_element()
126 kasan_poison_element(pool, element); in add_element()
127 pool->elements[pool->curr_nr++] = element; in add_element()
132 void *element = pool->elements[--pool->curr_nr]; in remove_element() local
135 kasan_unpoison_element(pool, element); in remove_element()
136 check_element(pool, element); in remove_element()
137 return element; in remove_element()
154 void *element = remove_element(pool); in mempool_exit() local
155 pool->free(element, pool->pool_data); in mempool_exit()
200 void *element; in mempool_init_node() local
202 element = pool->alloc(gfp_mask, pool->pool_data); in mempool_init_node()
203 if (unlikely(!element)) { in mempool_init_node()
207 add_element(pool, element); in mempool_init_node()
219 * @alloc_fn: user-defined element-allocation function.
220 * @free_fn: user-defined element-freeing function.
239 * @alloc_fn: user-defined element-allocation function.
240 * @free_fn: user-defined element-freeing function.
295 void *element; in mempool_resize() local
305 element = remove_element(pool); in mempool_resize()
307 pool->free(element, pool->pool_data); in mempool_resize()
336 element = pool->alloc(GFP_KERNEL, pool->pool_data); in mempool_resize()
337 if (!element) in mempool_resize()
341 add_element(pool, element); in mempool_resize()
344 pool->free(element, pool->pool_data); /* Raced */ in mempool_resize()
356 * mempool_alloc - allocate an element from a specific memory pool
369 void *element; in mempool_alloc() local
385 element = pool->alloc(gfp_temp, pool->pool_data); in mempool_alloc()
386 if (likely(element != NULL)) in mempool_alloc()
387 return element; in mempool_alloc()
391 element = remove_element(pool); in mempool_alloc()
399 kmemleak_update_trace(element); in mempool_alloc()
400 return element; in mempool_alloc()
419 /* Let's wait for someone else to return an element to @pool */ in mempool_alloc()
437 * mempool_free - return an element to the pool.
438 * @element: pool element pointer.
444 void mempool_free(void *element, mempool_t *pool) in mempool_free() argument
448 if (unlikely(element == NULL)) in mempool_free()
453 * for @element and the following @pool->curr_nr. This ensures in mempool_free()
455 * allocation of @element. This is necessary for fringe cases in mempool_free()
456 * where @element was passed to this task without going through in mempool_free()
474 * allocation of @element, any task which decremented curr_nr below in mempool_free()
477 * to min_nr after the allocation of @element, the elements in mempool_free()
487 add_element(pool, element); in mempool_free()
494 pool->free(element, pool->pool_data); in mempool_free()
509 void mempool_free_slab(void *element, void *pool_data) in mempool_free_slab() argument
512 kmem_cache_free(mem, element); in mempool_free_slab()
527 void mempool_kfree(void *element, void *pool_data) in mempool_kfree() argument
529 kfree(element); in mempool_kfree()
544 void mempool_free_pages(void *element, void *pool_data) in mempool_free_pages() argument
547 __free_pages(element, order); in mempool_free_pages()