|
@@ -24,6 +24,7 @@
|
|
|
#include <linux/kallsyms.h>
|
|
|
#include <linux/memory.h>
|
|
|
#include <linux/math64.h>
|
|
|
+#include <linux/kmemtrace.h>
|
|
|
|
|
|
/*
|
|
|
* Lock order:
|
|
@@ -1613,18 +1614,46 @@ static __always_inline void *slab_alloc(struct kmem_cache *s,
|
|
|
|
|
|
void *kmem_cache_alloc(struct kmem_cache *s, gfp_t gfpflags)
|
|
|
{
|
|
|
- return slab_alloc(s, gfpflags, -1, _RET_IP_);
|
|
|
+ void *ret = slab_alloc(s, gfpflags, -1, _RET_IP_);
|
|
|
+
|
|
|
+ kmemtrace_mark_alloc(KMEMTRACE_TYPE_CACHE, _RET_IP_, ret,
|
|
|
+ s->objsize, s->size, gfpflags);
|
|
|
+
|
|
|
+ return ret;
|
|
|
}
|
|
|
EXPORT_SYMBOL(kmem_cache_alloc);
|
|
|
|
|
|
+#ifdef CONFIG_KMEMTRACE
|
|
|
+void *kmem_cache_alloc_notrace(struct kmem_cache *s, gfp_t gfpflags)
|
|
|
+{
|
|
|
+ return slab_alloc(s, gfpflags, -1, _RET_IP_);
|
|
|
+}
|
|
|
+EXPORT_SYMBOL(kmem_cache_alloc_notrace);
|
|
|
+#endif
|
|
|
+
|
|
|
#ifdef CONFIG_NUMA
|
|
|
void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t gfpflags, int node)
|
|
|
{
|
|
|
- return slab_alloc(s, gfpflags, node, _RET_IP_);
|
|
|
+ void *ret = slab_alloc(s, gfpflags, node, _RET_IP_);
|
|
|
+
|
|
|
+ kmemtrace_mark_alloc_node(KMEMTRACE_TYPE_CACHE, _RET_IP_, ret,
|
|
|
+ s->objsize, s->size, gfpflags, node);
|
|
|
+
|
|
|
+ return ret;
|
|
|
}
|
|
|
EXPORT_SYMBOL(kmem_cache_alloc_node);
|
|
|
#endif
|
|
|
|
|
|
+#ifdef CONFIG_KMEMTRACE
|
|
|
+void *kmem_cache_alloc_node_notrace(struct kmem_cache *s,
|
|
|
+ gfp_t gfpflags,
|
|
|
+ int node)
|
|
|
+{
|
|
|
+ return slab_alloc(s, gfpflags, node, _RET_IP_);
|
|
|
+}
|
|
|
+EXPORT_SYMBOL(kmem_cache_alloc_node_notrace);
|
|
|
+#endif
|
|
|
+
|
|
|
/*
|
|
|
* Slow patch handling. This may still be called frequently since objects
|
|
|
* have a longer lifetime than the cpu slabs in most processing loads.
|
|
@@ -1732,6 +1761,8 @@ void kmem_cache_free(struct kmem_cache *s, void *x)
|
|
|
page = virt_to_head_page(x);
|
|
|
|
|
|
slab_free(s, page, x, _RET_IP_);
|
|
|
+
|
|
|
+ kmemtrace_mark_free(KMEMTRACE_TYPE_CACHE, _RET_IP_, x);
|
|
|
}
|
|
|
EXPORT_SYMBOL(kmem_cache_free);
|
|
|
|
|
@@ -2650,6 +2681,7 @@ static struct kmem_cache *get_slab(size_t size, gfp_t flags)
|
|
|
void *__kmalloc(size_t size, gfp_t flags)
|
|
|
{
|
|
|
struct kmem_cache *s;
|
|
|
+ void *ret;
|
|
|
|
|
|
if (unlikely(size > PAGE_SIZE))
|
|
|
return kmalloc_large(size, flags);
|
|
@@ -2659,7 +2691,12 @@ void *__kmalloc(size_t size, gfp_t flags)
|
|
|
if (unlikely(ZERO_OR_NULL_PTR(s)))
|
|
|
return s;
|
|
|
|
|
|
- return slab_alloc(s, flags, -1, _RET_IP_);
|
|
|
+ ret = slab_alloc(s, flags, -1, _RET_IP_);
|
|
|
+
|
|
|
+ kmemtrace_mark_alloc(KMEMTRACE_TYPE_KMALLOC, _RET_IP_, ret,
|
|
|
+ size, s->size, flags);
|
|
|
+
|
|
|
+ return ret;
|
|
|
}
|
|
|
EXPORT_SYMBOL(__kmalloc);
|
|
|
|
|
@@ -2678,16 +2715,30 @@ static void *kmalloc_large_node(size_t size, gfp_t flags, int node)
|
|
|
void *__kmalloc_node(size_t size, gfp_t flags, int node)
|
|
|
{
|
|
|
struct kmem_cache *s;
|
|
|
+ void *ret;
|
|
|
|
|
|
- if (unlikely(size > PAGE_SIZE))
|
|
|
- return kmalloc_large_node(size, flags, node);
|
|
|
+ if (unlikely(size > PAGE_SIZE)) {
|
|
|
+ ret = kmalloc_large_node(size, flags, node);
|
|
|
+
|
|
|
+ kmemtrace_mark_alloc_node(KMEMTRACE_TYPE_KMALLOC,
|
|
|
+ _RET_IP_, ret,
|
|
|
+ size, PAGE_SIZE << get_order(size),
|
|
|
+ flags, node);
|
|
|
+
|
|
|
+ return ret;
|
|
|
+ }
|
|
|
|
|
|
s = get_slab(size, flags);
|
|
|
|
|
|
if (unlikely(ZERO_OR_NULL_PTR(s)))
|
|
|
return s;
|
|
|
|
|
|
- return slab_alloc(s, flags, node, _RET_IP_);
|
|
|
+ ret = slab_alloc(s, flags, node, _RET_IP_);
|
|
|
+
|
|
|
+ kmemtrace_mark_alloc_node(KMEMTRACE_TYPE_KMALLOC, _RET_IP_, ret,
|
|
|
+ size, s->size, flags, node);
|
|
|
+
|
|
|
+ return ret;
|
|
|
}
|
|
|
EXPORT_SYMBOL(__kmalloc_node);
|
|
|
#endif
|
|
@@ -2745,6 +2796,8 @@ void kfree(const void *x)
|
|
|
return;
|
|
|
}
|
|
|
slab_free(page->slab, page, object, _RET_IP_);
|
|
|
+
|
|
|
+ kmemtrace_mark_free(KMEMTRACE_TYPE_KMALLOC, _RET_IP_, x);
|
|
|
}
|
|
|
EXPORT_SYMBOL(kfree);
|
|
|
|