mirror of
https://github.com/torvalds/linux.git
synced 2024-12-13 14:43:03 +00:00
bbe9d71f2c
The kmem_cache_alloc implementation simply allocates new memory from malloc() and calls the ctor, which zeroes out the entire object. This means it cannot spot bugs where the object isn't properly reinitialised before being freed. Add a small (11 objects) cache before freeing objects back to malloc. This is enough to let us write a test to catch it, although the memory allocator is now aware of the structure of the radix tree node, since it chains free objects through ->private_data (like the percpu cache does). Link: http://lkml.kernel.org/r/1481667692-14500-2-git-send-email-mawilcox@linuxonhyperv.com Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com> Cc: Kirill A. Shutemov <kirill.shutemov@linux.intel.com> Cc: Konstantin Khlebnikov <koct9i@gmail.com> Cc: Ross Zwisler <ross.zwisler@linux.intel.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org> |
||
|---|---|---|
| .. | ||
| generated | ||
| linux | ||
| .gitignore | ||
| benchmark.c | ||
| iteration_check.c | ||
| linux.c | ||
| main.c | ||
| Makefile | ||
| multiorder.c | ||
| rcupdate.c | ||
| regression1.c | ||
| regression2.c | ||
| regression3.c | ||
| regression.h | ||
| tag_check.c | ||
| test.c | ||
| test.h | ||