a68d1f887cb3c41e494eaee31c831d4b02ab21b6
1 // SPDX-License-Identifier: MIT
2 // SPDX-FileCopyrightText: 2024 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
4 #include <rseq/mempool.h>
11 #include <rseq/compiler.h>
22 #include "rseq-utils.h"
23 #include <rseq/rseq.h>
26 * rseq-mempool.c: rseq CPU-Local Storage (CLS) memory allocator.
28 * The rseq per-CPU memory allocator allows the application the request
29 * memory pools of CPU-Local memory each of containing objects of a
30 * given size (rounded to next power of 2), reserving a given virtual
31 * address size per CPU, for a given maximum number of CPUs.
33 * The per-CPU memory allocator is analogous to TLS (Thread-Local
34 * Storage) memory: TLS is Thread-Local Storage, whereas the per-CPU
35 * memory allocator provides CPU-Local Storage.
38 #define POOL_SET_NR_ENTRIES RSEQ_BITS_PER_LONG
41 * Smallest allocation should hold enough space for a free list pointer.
43 #if RSEQ_BITS_PER_LONG == 64
44 # define POOL_SET_MIN_ENTRY 3 /* Smallest item_len=8 */
46 # define POOL_SET_MIN_ENTRY 2 /* Smallest item_len=4 */
49 #define BIT_PER_ULONG (8 * sizeof(unsigned long))
51 #define MOVE_PAGES_BATCH_SIZE 4096
53 #define RANGE_HEADER_OFFSET sizeof(struct rseq_mempool_range)
55 struct free_list_node
;
57 struct free_list_node
{
58 struct free_list_node
*next
;
62 MEMPOOL_TYPE_GLOBAL
= 0, /* Default */
63 MEMPOOL_TYPE_PERCPU
= 1,
66 struct rseq_mempool_attr
{
68 void *(*mmap_func
)(void *priv
, size_t len
);
69 int (*munmap_func
)(void *priv
, void *ptr
, size_t len
);
73 int (*init_func
)(void *priv
, void *addr
, size_t len
, int cpu
);
78 enum mempool_type type
;
82 unsigned long max_nr_ranges
;
88 struct rseq_mempool_range
;
90 struct rseq_mempool_range
{
91 struct rseq_mempool_range
*next
; /* Linked list of ranges. */
92 struct rseq_mempool
*pool
; /* Backward reference to container pool. */
96 /* Track alloc/free. */
97 unsigned long *alloc_bitmap
;
100 struct rseq_mempool
{
101 /* Head of ranges linked-list. */
102 struct rseq_mempool_range
*range_list
;
103 unsigned long nr_ranges
;
109 * The free list chains freed items on the CPU 0 address range.
110 * We should rethink this decision if false sharing between
111 * malloc/free from other CPUs and data accesses from CPU 0
112 * becomes an issue. This is a NULL-terminated singly-linked
115 struct free_list_node
*free_list_head
;
117 /* This lock protects allocation/free within the pool. */
118 pthread_mutex_t lock
;
120 struct rseq_mempool_attr attr
;
125 * Pool set entries are indexed by item_len rounded to the next power of
126 * 2. A pool set can contain NULL pool entries, in which case the next
127 * large enough entry will be used for allocation.
129 struct rseq_mempool_set
{
130 /* This lock protects add vs malloc/zmalloc within the pool set. */
131 pthread_mutex_t lock
;
132 struct rseq_mempool
*entries
[POOL_SET_NR_ENTRIES
];
136 void *__rseq_pool_range_percpu_ptr(struct rseq_mempool_range
*range
, int cpu
,
137 uintptr_t item_offset
, size_t stride
)
139 return range
->base
+ (stride
* cpu
) + item_offset
;
143 void rseq_percpu_zero_item(struct rseq_mempool
*pool
,
144 struct rseq_mempool_range
*range
, uintptr_t item_offset
)
148 for (i
= 0; i
< pool
->attr
.max_nr_cpus
; i
++) {
149 char *p
= __rseq_pool_range_percpu_ptr(range
, i
,
150 item_offset
, pool
->attr
.stride
);
151 memset(p
, 0, pool
->item_len
);
156 void rseq_percpu_poison_item(struct rseq_mempool
*pool
,
157 struct rseq_mempool_range
*range
, uintptr_t item_offset
)
159 uintptr_t poison
= pool
->attr
.poison
;
162 for (i
= 0; i
< pool
->attr
.max_nr_cpus
; i
++) {
163 char *p
= __rseq_pool_range_percpu_ptr(range
, i
,
164 item_offset
, pool
->attr
.stride
);
167 for (offset
= 0; offset
< pool
->item_len
; offset
+= sizeof(uintptr_t))
168 *((uintptr_t *) p
) = poison
;
173 int rseq_mempool_range_init_numa(void *addr
, size_t len
, int cpu
, int numa_flags
)
175 unsigned long nr_pages
, page_len
;
176 int status
[MOVE_PAGES_BATCH_SIZE
];
177 int nodes
[MOVE_PAGES_BATCH_SIZE
];
178 void *pages
[MOVE_PAGES_BATCH_SIZE
];
185 page_len
= rseq_get_page_len();
186 nr_pages
= len
>> rseq_get_count_order_ulong(page_len
);
188 nodes
[0] = numa_node_of_cpu(cpu
);
192 for (size_t k
= 1; k
< RSEQ_ARRAY_SIZE(nodes
); ++k
) {
196 for (unsigned long page
= 0; page
< nr_pages
;) {
198 size_t max_k
= RSEQ_ARRAY_SIZE(pages
);
199 size_t left
= nr_pages
- page
;
205 for (size_t k
= 0; k
< max_k
; ++k
, ++page
) {
206 pages
[k
] = addr
+ (page
* page_len
);
210 ret
= move_pages(0, max_k
, pages
, nodes
, status
, numa_flags
);
216 fprintf(stderr
, "%lu pages were not migrated\n", ret
);
217 for (size_t k
= 0; k
< max_k
; ++k
) {
220 "Error while moving page %p to numa node %d: %u\n",
221 pages
[k
], nodes
[k
], -status
[k
]);
228 int rseq_mempool_range_init_numa(void *addr
__attribute__((unused
)),
229 size_t len
__attribute__((unused
)),
230 int cpu
__attribute__((unused
)),
231 int numa_flags
__attribute__((unused
)))
239 void *default_mmap_func(void *priv
__attribute__((unused
)), size_t len
)
243 base
= mmap(NULL
, len
, PROT_READ
| PROT_WRITE
,
244 MAP_ANONYMOUS
| MAP_PRIVATE
, -1, 0);
245 if (base
== MAP_FAILED
)
251 int default_munmap_func(void *priv
__attribute__((unused
)), void *ptr
, size_t len
)
253 return munmap(ptr
, len
);
257 int create_alloc_bitmap(struct rseq_mempool
*pool
, struct rseq_mempool_range
*range
)
261 count
= ((pool
->attr
.stride
>> pool
->item_order
) + BIT_PER_ULONG
- 1) / BIT_PER_ULONG
;
264 * Not being able to create the validation bitmap is an error
265 * that needs to be reported.
267 range
->alloc_bitmap
= calloc(count
, sizeof(unsigned long));
268 if (!range
->alloc_bitmap
)
274 const char *get_pool_name(const struct rseq_mempool
*pool
)
276 return pool
->name
? : "<anonymous>";
280 bool addr_in_pool(const struct rseq_mempool
*pool
, void *addr
)
282 struct rseq_mempool_range
*range
;
284 for (range
= pool
->range_list
; range
; range
= range
->next
) {
285 if (addr
>= range
->base
&& addr
< range
->base
+ range
->next_unused
)
291 /* Always inline for __builtin_return_address(0). */
292 static inline __attribute__((always_inline
))
293 void check_free_list(const struct rseq_mempool
*pool
)
295 size_t total_item
= 0, total_never_allocated
= 0, total_freed
= 0,
296 max_list_traversal
= 0, traversal_iteration
= 0;
297 struct rseq_mempool_range
*range
;
299 if (!pool
->attr
.robust_set
)
302 for (range
= pool
->range_list
; range
; range
= range
->next
) {
303 total_item
+= pool
->attr
.stride
>> pool
->item_order
;
304 total_never_allocated
+= (pool
->attr
.stride
- range
->next_unused
) >> pool
->item_order
;
306 max_list_traversal
= total_item
- total_never_allocated
;
308 for (struct free_list_node
*node
= pool
->free_list_head
, *prev
= NULL
;
313 void *node_addr
= node
;
315 if (traversal_iteration
>= max_list_traversal
) {
316 fprintf(stderr
, "%s: Corrupted free-list; Possibly infinite loop in pool \"%s\" (%p), caller %p.\n",
317 __func__
, get_pool_name(pool
), pool
, __builtin_return_address(0));
321 /* Node is out of range. */
322 if (!addr_in_pool(pool
, node_addr
)) {
324 fprintf(stderr
, "%s: Corrupted free-list node %p -> [out-of-range %p] in pool \"%s\" (%p), caller %p.\n",
325 __func__
, prev
, node
, get_pool_name(pool
), pool
, __builtin_return_address(0));
327 fprintf(stderr
, "%s: Corrupted free-list node [out-of-range %p] in pool \"%s\" (%p), caller %p.\n",
328 __func__
, node
, get_pool_name(pool
), pool
, __builtin_return_address(0));
332 traversal_iteration
++;
336 if (total_never_allocated
+ total_freed
!= total_item
) {
337 fprintf(stderr
, "%s: Corrupted free-list in pool \"%s\" (%p); total-item: %zu total-never-used: %zu total-freed: %zu, caller %p.\n",
338 __func__
, get_pool_name(pool
), pool
, total_item
, total_never_allocated
, total_freed
, __builtin_return_address(0));
343 /* Always inline for __builtin_return_address(0). */
344 static inline __attribute__((always_inline
))
345 void destroy_alloc_bitmap(struct rseq_mempool
*pool
, struct rseq_mempool_range
*range
)
347 unsigned long *bitmap
= range
->alloc_bitmap
;
348 size_t count
, total_leaks
= 0;
353 count
= ((pool
->attr
.stride
>> pool
->item_order
) + BIT_PER_ULONG
- 1) / BIT_PER_ULONG
;
355 /* Assert that all items in the pool were freed. */
356 for (size_t k
= 0; k
< count
; ++k
)
357 total_leaks
+= rseq_hweight_ulong(bitmap
[k
]);
359 fprintf(stderr
, "%s: Pool \"%s\" (%p) has %zu leaked items on destroy, caller: %p.\n",
360 __func__
, get_pool_name(pool
), pool
, total_leaks
, (void *) __builtin_return_address(0));
367 /* Always inline for __builtin_return_address(0). */
368 static inline __attribute__((always_inline
))
369 int rseq_mempool_range_destroy(struct rseq_mempool
*pool
,
370 struct rseq_mempool_range
*range
)
372 destroy_alloc_bitmap(pool
, range
);
373 /* range is a header located one page before the aligned mapping. */
374 return pool
->attr
.munmap_func(pool
->attr
.mmap_priv
, range
->header
,
375 (pool
->attr
.stride
* pool
->attr
.max_nr_cpus
) + rseq_get_page_len());
379 * Allocate a memory mapping aligned on @alignment, with an optional
380 * @pre_header before the mapping.
383 void *aligned_mmap_anonymous(struct rseq_mempool
*pool
,
384 size_t page_size
, size_t len
, size_t alignment
,
385 void **pre_header
, size_t pre_header_len
)
387 size_t minimum_page_count
, page_count
, extra
, total_allocate
= 0;
391 if (len
< page_size
|| alignment
< page_size
||
392 !is_pow2(alignment
) || (len
& (alignment
- 1))) {
396 page_order
= rseq_get_count_order_ulong(page_size
);
397 if (page_order
< 0) {
401 if (pre_header_len
&& (pre_header_len
& (page_size
- 1))) {
406 minimum_page_count
= (pre_header_len
+ len
) >> page_order
;
407 page_count
= (pre_header_len
+ len
+ alignment
- page_size
) >> page_order
;
409 assert(page_count
>= minimum_page_count
);
411 ptr
= pool
->attr
.mmap_func(pool
->attr
.mmap_priv
, page_count
<< page_order
);
415 total_allocate
= page_count
<< page_order
;
417 if (!(((uintptr_t) ptr
+ pre_header_len
) & (alignment
- 1))) {
418 /* Pointer is already aligned. ptr points to pre_header. */
422 /* Unmap extra before. */
423 extra
= offset_align((uintptr_t) ptr
+ pre_header_len
, alignment
);
424 assert(!(extra
& (page_size
- 1)));
425 if (pool
->attr
.munmap_func(pool
->attr
.mmap_priv
, ptr
, extra
)) {
429 total_allocate
-= extra
;
430 ptr
+= extra
; /* ptr points to pre_header */
431 page_count
-= extra
>> page_order
;
433 assert(page_count
>= minimum_page_count
);
435 if (page_count
> minimum_page_count
) {
438 /* Unmap extra after. */
439 extra_ptr
= ptr
+ (minimum_page_count
<< page_order
);
440 extra
= (page_count
- minimum_page_count
) << page_order
;
441 if (pool
->attr
.munmap_func(pool
->attr
.mmap_priv
, extra_ptr
, extra
)) {
445 total_allocate
-= extra
;
448 assert(!(((uintptr_t)ptr
+ pre_header_len
) & (alignment
- 1)));
449 assert(total_allocate
== len
+ pre_header_len
);
455 ptr
+= pre_header_len
;
461 struct rseq_mempool_range
*rseq_mempool_range_create(struct rseq_mempool
*pool
)
463 struct rseq_mempool_range
*range
;
464 unsigned long page_size
;
468 if (pool
->attr
.max_nr_ranges
&&
469 pool
->nr_ranges
>= pool
->attr
.max_nr_ranges
) {
473 page_size
= rseq_get_page_len();
475 base
= aligned_mmap_anonymous(pool
, page_size
,
476 pool
->attr
.stride
* pool
->attr
.max_nr_cpus
,
481 range
= (struct rseq_mempool_range
*) (base
- RANGE_HEADER_OFFSET
);
484 range
->header
= header
;
485 if (pool
->attr
.robust_set
) {
486 if (create_alloc_bitmap(pool
, range
))
489 if (pool
->attr
.init_set
) {
490 switch (pool
->attr
.type
) {
491 case MEMPOOL_TYPE_GLOBAL
:
492 if (pool
->attr
.init_func(pool
->attr
.init_priv
,
493 base
, pool
->attr
.stride
, -1)) {
497 case MEMPOOL_TYPE_PERCPU
:
500 for (cpu
= 0; cpu
< pool
->attr
.max_nr_cpus
; cpu
++) {
501 if (pool
->attr
.init_func(pool
->attr
.init_priv
,
502 base
+ (pool
->attr
.stride
* cpu
),
503 pool
->attr
.stride
, cpu
)) {
517 (void) rseq_mempool_range_destroy(pool
, range
);
521 int rseq_mempool_destroy(struct rseq_mempool
*pool
)
523 struct rseq_mempool_range
*range
, *next_range
;
528 check_free_list(pool
);
529 /* Iteration safe against removal. */
530 for (range
= pool
->range_list
; range
&& (next_range
= range
->next
, 1); range
= next_range
) {
531 if (rseq_mempool_range_destroy(pool
, range
))
533 /* Update list head to keep list coherent in case of partial failure. */
534 pool
->range_list
= next_range
;
536 pthread_mutex_destroy(&pool
->lock
);
538 memset(pool
, 0, sizeof(*pool
));
543 struct rseq_mempool
*rseq_mempool_create(const char *pool_name
,
544 size_t item_len
, const struct rseq_mempool_attr
*_attr
)
546 struct rseq_mempool
*pool
;
547 struct rseq_mempool_attr attr
= {};
550 /* Make sure each item is large enough to contain free list pointers. */
551 if (item_len
< sizeof(void *))
552 item_len
= sizeof(void *);
554 /* Align item_len on next power of two. */
555 order
= rseq_get_count_order_ulong(item_len
);
560 item_len
= 1UL << order
;
563 memcpy(&attr
, _attr
, sizeof(attr
));
564 if (!attr
.mmap_set
) {
565 attr
.mmap_func
= default_mmap_func
;
566 attr
.munmap_func
= default_munmap_func
;
567 attr
.mmap_priv
= NULL
;
571 case MEMPOOL_TYPE_PERCPU
:
572 if (attr
.max_nr_cpus
< 0) {
576 if (attr
.max_nr_cpus
== 0) {
578 attr
.max_nr_cpus
= rseq_get_max_nr_cpus();
579 if (attr
.max_nr_cpus
== 0) {
585 case MEMPOOL_TYPE_GLOBAL
:
586 /* Use a 1-cpu pool for global mempool type. */
587 attr
.max_nr_cpus
= 1;
591 attr
.stride
= RSEQ_MEMPOOL_STRIDE
; /* Use default */
592 if (item_len
> attr
.stride
|| attr
.stride
< (size_t) rseq_get_page_len() ||
593 !is_pow2(attr
.stride
)) {
598 pool
= calloc(1, sizeof(struct rseq_mempool
));
602 memcpy(&pool
->attr
, &attr
, sizeof(attr
));
603 pthread_mutex_init(&pool
->lock
, NULL
);
604 pool
->item_len
= item_len
;
605 pool
->item_order
= order
;
607 pool
->range_list
= rseq_mempool_range_create(pool
);
608 if (!pool
->range_list
)
612 pool
->name
= strdup(pool_name
);
619 rseq_mempool_destroy(pool
);
624 /* Always inline for __builtin_return_address(0). */
625 static inline __attribute__((always_inline
))
626 void set_alloc_slot(struct rseq_mempool
*pool
, struct rseq_mempool_range
*range
, size_t item_offset
)
628 unsigned long *bitmap
= range
->alloc_bitmap
;
629 size_t item_index
= item_offset
>> pool
->item_order
;
636 k
= item_index
/ BIT_PER_ULONG
;
637 mask
= 1ULL << (item_index
% BIT_PER_ULONG
);
639 /* Print error if bit is already set. */
640 if (bitmap
[k
] & mask
) {
641 fprintf(stderr
, "%s: Allocator corruption detected for pool: \"%s\" (%p), item offset: %zu, caller: %p.\n",
642 __func__
, get_pool_name(pool
), pool
, item_offset
, (void *) __builtin_return_address(0));
649 void __rseq_percpu
*__rseq_percpu_malloc(struct rseq_mempool
*pool
, bool zeroed
)
651 struct rseq_mempool_range
*range
;
652 struct free_list_node
*node
;
653 uintptr_t item_offset
;
654 void __rseq_percpu
*addr
;
656 pthread_mutex_lock(&pool
->lock
);
657 /* Get first entry from free list. */
658 node
= pool
->free_list_head
;
660 uintptr_t ptr
= (uintptr_t) node
;
661 void *range_base
= (void *) (ptr
& (~(pool
->attr
.stride
- 1)));
663 range
= (struct rseq_mempool_range
*) (range_base
- RANGE_HEADER_OFFSET
);
664 /* Remove node from free list (update head). */
665 pool
->free_list_head
= node
->next
;
666 item_offset
= (uintptr_t) ((void *) node
- range_base
);
667 addr
= (void __rseq_percpu
*) node
;
671 * If the most recent range (first in list) does not have any
672 * room left, create a new range and prepend it to the list
675 range
= pool
->range_list
;
676 if (range
->next_unused
+ pool
->item_len
> pool
->attr
.stride
) {
677 range
= rseq_mempool_range_create(pool
);
683 /* Add range to head of list. */
684 range
->next
= pool
->range_list
;
685 pool
->range_list
= range
;
687 /* First range in list has room left. */
688 item_offset
= range
->next_unused
;
689 addr
= (void __rseq_percpu
*) (range
->base
+ item_offset
);
690 range
->next_unused
+= pool
->item_len
;
693 set_alloc_slot(pool
, range
, item_offset
);
694 pthread_mutex_unlock(&pool
->lock
);
696 rseq_percpu_zero_item(pool
, range
, item_offset
);
700 void __rseq_percpu
*rseq_mempool_percpu_malloc(struct rseq_mempool
*pool
)
702 return __rseq_percpu_malloc(pool
, false);
705 void __rseq_percpu
*rseq_mempool_percpu_zmalloc(struct rseq_mempool
*pool
)
707 return __rseq_percpu_malloc(pool
, true);
710 /* Always inline for __builtin_return_address(0). */
711 static inline __attribute__((always_inline
))
712 void clear_alloc_slot(struct rseq_mempool
*pool
, struct rseq_mempool_range
*range
, size_t item_offset
)
714 unsigned long *bitmap
= range
->alloc_bitmap
;
715 size_t item_index
= item_offset
>> pool
->item_order
;
722 k
= item_index
/ BIT_PER_ULONG
;
723 mask
= 1ULL << (item_index
% BIT_PER_ULONG
);
725 /* Print error if bit is not set. */
726 if (!(bitmap
[k
] & mask
)) {
727 fprintf(stderr
, "%s: Double-free detected for pool: \"%s\" (%p), item offset: %zu, caller: %p.\n",
728 __func__
, get_pool_name(pool
), pool
, item_offset
,
729 (void *) __builtin_return_address(0));
735 void librseq_mempool_percpu_free(void __rseq_percpu
*_ptr
, size_t stride
)
737 uintptr_t ptr
= (uintptr_t) _ptr
;
738 void *range_base
= (void *) (ptr
& (~(stride
- 1)));
739 struct rseq_mempool_range
*range
= (struct rseq_mempool_range
*) (range_base
- RANGE_HEADER_OFFSET
);
740 struct rseq_mempool
*pool
= range
->pool
;
741 uintptr_t item_offset
= ptr
& (stride
- 1);
742 struct free_list_node
*head
, *item
;
744 pthread_mutex_lock(&pool
->lock
);
745 clear_alloc_slot(pool
, range
, item_offset
);
746 /* Add ptr to head of free list */
747 head
= pool
->free_list_head
;
748 if (pool
->attr
.poison_set
)
749 rseq_percpu_poison_item(pool
, range
, item_offset
);
750 /* Free-list is in CPU 0 range. */
751 item
= (struct free_list_node
*) ptr
;
753 * Setting the next pointer will overwrite the first uintptr_t
757 pool
->free_list_head
= item
;
758 pthread_mutex_unlock(&pool
->lock
);
761 struct rseq_mempool_set
*rseq_mempool_set_create(void)
763 struct rseq_mempool_set
*pool_set
;
765 pool_set
= calloc(1, sizeof(struct rseq_mempool_set
));
768 pthread_mutex_init(&pool_set
->lock
, NULL
);
772 int rseq_mempool_set_destroy(struct rseq_mempool_set
*pool_set
)
776 for (order
= POOL_SET_MIN_ENTRY
; order
< POOL_SET_NR_ENTRIES
; order
++) {
777 struct rseq_mempool
*pool
= pool_set
->entries
[order
];
781 ret
= rseq_mempool_destroy(pool
);
784 pool_set
->entries
[order
] = NULL
;
786 pthread_mutex_destroy(&pool_set
->lock
);
791 /* Ownership of pool is handed over to pool set on success. */
792 int rseq_mempool_set_add_pool(struct rseq_mempool_set
*pool_set
, struct rseq_mempool
*pool
)
794 size_t item_order
= pool
->item_order
;
797 pthread_mutex_lock(&pool_set
->lock
);
798 if (pool_set
->entries
[item_order
]) {
803 pool_set
->entries
[pool
->item_order
] = pool
;
805 pthread_mutex_unlock(&pool_set
->lock
);
810 void __rseq_percpu
*__rseq_mempool_set_malloc(struct rseq_mempool_set
*pool_set
, size_t len
, bool zeroed
)
812 int order
, min_order
= POOL_SET_MIN_ENTRY
;
813 struct rseq_mempool
*pool
;
814 void __rseq_percpu
*addr
;
816 order
= rseq_get_count_order_ulong(len
);
817 if (order
> POOL_SET_MIN_ENTRY
)
820 pthread_mutex_lock(&pool_set
->lock
);
821 /* First smallest present pool where @len fits. */
822 for (order
= min_order
; order
< POOL_SET_NR_ENTRIES
; order
++) {
823 pool
= pool_set
->entries
[order
];
827 if (pool
->item_len
>= len
)
832 pthread_mutex_unlock(&pool_set
->lock
);
834 addr
= __rseq_percpu_malloc(pool
, zeroed
);
835 if (addr
== NULL
&& errno
== ENOMEM
) {
837 * If the allocation failed, try again with a
840 min_order
= order
+ 1;
851 void __rseq_percpu
*rseq_mempool_set_percpu_malloc(struct rseq_mempool_set
*pool_set
, size_t len
)
853 return __rseq_mempool_set_malloc(pool_set
, len
, false);
856 void __rseq_percpu
*rseq_mempool_set_percpu_zmalloc(struct rseq_mempool_set
*pool_set
, size_t len
)
858 return __rseq_mempool_set_malloc(pool_set
, len
, true);
861 struct rseq_mempool_attr
*rseq_mempool_attr_create(void)
863 return calloc(1, sizeof(struct rseq_mempool_attr
));
866 void rseq_mempool_attr_destroy(struct rseq_mempool_attr
*attr
)
871 int rseq_mempool_attr_set_mmap(struct rseq_mempool_attr
*attr
,
872 void *(*mmap_func
)(void *priv
, size_t len
),
873 int (*munmap_func
)(void *priv
, void *ptr
, size_t len
),
880 attr
->mmap_set
= true;
881 attr
->mmap_func
= mmap_func
;
882 attr
->munmap_func
= munmap_func
;
883 attr
->mmap_priv
= mmap_priv
;
887 int rseq_mempool_attr_set_init(struct rseq_mempool_attr
*attr
,
888 int (*init_func
)(void *priv
, void *addr
, size_t len
, int cpu
),
895 attr
->init_set
= true;
896 attr
->init_func
= init_func
;
897 attr
->init_priv
= init_priv
;
901 int rseq_mempool_attr_set_robust(struct rseq_mempool_attr
*attr
)
907 attr
->robust_set
= true;
911 int rseq_mempool_attr_set_percpu(struct rseq_mempool_attr
*attr
,
912 size_t stride
, int max_nr_cpus
)
918 attr
->type
= MEMPOOL_TYPE_PERCPU
;
919 attr
->stride
= stride
;
920 attr
->max_nr_cpus
= max_nr_cpus
;
924 int rseq_mempool_attr_set_global(struct rseq_mempool_attr
*attr
,
931 attr
->type
= MEMPOOL_TYPE_GLOBAL
;
932 attr
->stride
= stride
;
933 attr
->max_nr_cpus
= 0;
937 int rseq_mempool_attr_set_max_nr_ranges(struct rseq_mempool_attr
*attr
,
938 unsigned long max_nr_ranges
)
944 attr
->max_nr_ranges
= max_nr_ranges
;
948 int rseq_mempool_attr_set_poison(struct rseq_mempool_attr
*attr
,
955 attr
->poison_set
= true;
956 attr
->poison
= poison
;
960 int rseq_mempool_get_max_nr_cpus(struct rseq_mempool
*mempool
)
962 if (!mempool
|| mempool
->attr
.type
!= MEMPOOL_TYPE_PERCPU
) {
966 return mempool
->attr
.max_nr_cpus
;
This page took 0.047453 seconds and 4 git commands to generate.