user/sven/linux.git/include/linux/objpool.h, branch v6.8.12Linux Kernel
https://git.stealer.net/cgit.cgi/user/sven/linux.git/atom?h=v6.8.122023-10-18T13:35:36Zlib: objpool added: ring-array based lockless MPMC2023-10-18T13:35:36Zwuqiang.mattwuqiang.matt@bytedance.com2023-10-17T13:56:50Zurn:sha1:b4edb8d2d4647a71a246d91fe34ff25c2c5f3481
objpool is a scalable implementation of high performance queue for
object allocation and reclamation, such as kretprobe instances.
With leveraging percpu ring-array to mitigate hot spots of memory
contention, it delivers near-linear scalability for high parallel
scenarios. The objpool is best suited for the following cases:
1) Memory allocation or reclamation are prohibited or too expensive
2) Consumers are of different priorities, such as irqs and threads
Limitations:
1) Maximum objects (capacity) is fixed after objpool creation
2) All pre-allocated objects are managed in percpu ring array,
which consumes more memory than linked lists
Link: https://lore.kernel.org/all/20231017135654.82270-2-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>