|
@@ -24,6 +24,7 @@
|
|
#include <linux/kallsyms.h>
|
|
#include <linux/kallsyms.h>
|
|
#include <linux/memory.h>
|
|
#include <linux/memory.h>
|
|
#include <linux/math64.h>
|
|
#include <linux/math64.h>
|
|
|
|
+#include <linux/kmemtrace.h>
|
|
|
|
|
|
/*
|
|
/*
|
|
* Lock order:
|
|
* Lock order:
|
|
@@ -178,7 +179,7 @@ static LIST_HEAD(slab_caches);
|
|
* Tracking user of a slab.
|
|
* Tracking user of a slab.
|
|
*/
|
|
*/
|
|
struct track {
|
|
struct track {
|
|
- void *addr; /* Called from address */
|
|
|
|
|
|
+ unsigned long addr; /* Called from address */
|
|
int cpu; /* Was running on cpu */
|
|
int cpu; /* Was running on cpu */
|
|
int pid; /* Pid context */
|
|
int pid; /* Pid context */
|
|
unsigned long when; /* When did the operation occur */
|
|
unsigned long when; /* When did the operation occur */
|
|
@@ -367,7 +368,7 @@ static struct track *get_track(struct kmem_cache *s, void *object,
|
|
}
|
|
}
|
|
|
|
|
|
static void set_track(struct kmem_cache *s, void *object,
|
|
static void set_track(struct kmem_cache *s, void *object,
|
|
- enum track_item alloc, void *addr)
|
|
|
|
|
|
+ enum track_item alloc, unsigned long addr)
|
|
{
|
|
{
|
|
struct track *p;
|
|
struct track *p;
|
|
|
|
|
|
@@ -391,8 +392,8 @@ static void init_tracking(struct kmem_cache *s, void *object)
|
|
if (!(s->flags & SLAB_STORE_USER))
|
|
if (!(s->flags & SLAB_STORE_USER))
|
|
return;
|
|
return;
|
|
|
|
|
|
- set_track(s, object, TRACK_FREE, NULL);
|
|
|
|
- set_track(s, object, TRACK_ALLOC, NULL);
|
|
|
|
|
|
+ set_track(s, object, TRACK_FREE, 0UL);
|
|
|
|
+ set_track(s, object, TRACK_ALLOC, 0UL);
|
|
}
|
|
}
|
|
|
|
|
|
static void print_track(const char *s, struct track *t)
|
|
static void print_track(const char *s, struct track *t)
|
|
@@ -401,7 +402,7 @@ static void print_track(const char *s, struct track *t)
|
|
return;
|
|
return;
|
|
|
|
|
|
printk(KERN_ERR "INFO: %s in %pS age=%lu cpu=%u pid=%d\n",
|
|
printk(KERN_ERR "INFO: %s in %pS age=%lu cpu=%u pid=%d\n",
|
|
- s, t->addr, jiffies - t->when, t->cpu, t->pid);
|
|
|
|
|
|
+ s, (void *)t->addr, jiffies - t->when, t->cpu, t->pid);
|
|
}
|
|
}
|
|
|
|
|
|
static void print_tracking(struct kmem_cache *s, void *object)
|
|
static void print_tracking(struct kmem_cache *s, void *object)
|
|
@@ -866,7 +867,7 @@ static void setup_object_debug(struct kmem_cache *s, struct page *page,
|
|
}
|
|
}
|
|
|
|
|
|
static int alloc_debug_processing(struct kmem_cache *s, struct page *page,
|
|
static int alloc_debug_processing(struct kmem_cache *s, struct page *page,
|
|
- void *object, void *addr)
|
|
|
|
|
|
+ void *object, unsigned long addr)
|
|
{
|
|
{
|
|
if (!check_slab(s, page))
|
|
if (!check_slab(s, page))
|
|
goto bad;
|
|
goto bad;
|
|
@@ -906,7 +907,7 @@ bad:
|
|
}
|
|
}
|
|
|
|
|
|
static int free_debug_processing(struct kmem_cache *s, struct page *page,
|
|
static int free_debug_processing(struct kmem_cache *s, struct page *page,
|
|
- void *object, void *addr)
|
|
|
|
|
|
+ void *object, unsigned long addr)
|
|
{
|
|
{
|
|
if (!check_slab(s, page))
|
|
if (!check_slab(s, page))
|
|
goto fail;
|
|
goto fail;
|
|
@@ -1029,10 +1030,10 @@ static inline void setup_object_debug(struct kmem_cache *s,
|
|
struct page *page, void *object) {}
|
|
struct page *page, void *object) {}
|
|
|
|
|
|
static inline int alloc_debug_processing(struct kmem_cache *s,
|
|
static inline int alloc_debug_processing(struct kmem_cache *s,
|
|
- struct page *page, void *object, void *addr) { return 0; }
|
|
|
|
|
|
+ struct page *page, void *object, unsigned long addr) { return 0; }
|
|
|
|
|
|
static inline int free_debug_processing(struct kmem_cache *s,
|
|
static inline int free_debug_processing(struct kmem_cache *s,
|
|
- struct page *page, void *object, void *addr) { return 0; }
|
|
|
|
|
|
+ struct page *page, void *object, unsigned long addr) { return 0; }
|
|
|
|
|
|
static inline int slab_pad_check(struct kmem_cache *s, struct page *page)
|
|
static inline int slab_pad_check(struct kmem_cache *s, struct page *page)
|
|
{ return 1; }
|
|
{ return 1; }
|
|
@@ -1499,8 +1500,8 @@ static inline int node_match(struct kmem_cache_cpu *c, int node)
|
|
* we need to allocate a new slab. This is the slowest path since it involves
|
|
* we need to allocate a new slab. This is the slowest path since it involves
|
|
* a call to the page allocator and the setup of a new slab.
|
|
* a call to the page allocator and the setup of a new slab.
|
|
*/
|
|
*/
|
|
-static void *__slab_alloc(struct kmem_cache *s,
|
|
|
|
- gfp_t gfpflags, int node, void *addr, struct kmem_cache_cpu *c)
|
|
|
|
|
|
+static void *__slab_alloc(struct kmem_cache *s, gfp_t gfpflags, int node,
|
|
|
|
+ unsigned long addr, struct kmem_cache_cpu *c)
|
|
{
|
|
{
|
|
void **object;
|
|
void **object;
|
|
struct page *new;
|
|
struct page *new;
|
|
@@ -1584,7 +1585,7 @@ debug:
|
|
* Otherwise we can simply pick the next object from the lockless free list.
|
|
* Otherwise we can simply pick the next object from the lockless free list.
|
|
*/
|
|
*/
|
|
static __always_inline void *slab_alloc(struct kmem_cache *s,
|
|
static __always_inline void *slab_alloc(struct kmem_cache *s,
|
|
- gfp_t gfpflags, int node, void *addr)
|
|
|
|
|
|
+ gfp_t gfpflags, int node, unsigned long addr)
|
|
{
|
|
{
|
|
void **object;
|
|
void **object;
|
|
struct kmem_cache_cpu *c;
|
|
struct kmem_cache_cpu *c;
|
|
@@ -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)
|
|
void *kmem_cache_alloc(struct kmem_cache *s, gfp_t gfpflags)
|
|
{
|
|
{
|
|
- return slab_alloc(s, gfpflags, -1, __builtin_return_address(0));
|
|
|
|
|
|
+ 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);
|
|
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
|
|
#ifdef CONFIG_NUMA
|
|
void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t gfpflags, int node)
|
|
void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t gfpflags, int node)
|
|
{
|
|
{
|
|
- return slab_alloc(s, gfpflags, node, __builtin_return_address(0));
|
|
|
|
|
|
+ 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);
|
|
EXPORT_SYMBOL(kmem_cache_alloc_node);
|
|
#endif
|
|
#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
|
|
* Slow patch handling. This may still be called frequently since objects
|
|
* have a longer lifetime than the cpu slabs in most processing loads.
|
|
* have a longer lifetime than the cpu slabs in most processing loads.
|
|
@@ -1634,7 +1663,7 @@ EXPORT_SYMBOL(kmem_cache_alloc_node);
|
|
* handling required then we can return immediately.
|
|
* handling required then we can return immediately.
|
|
*/
|
|
*/
|
|
static void __slab_free(struct kmem_cache *s, struct page *page,
|
|
static void __slab_free(struct kmem_cache *s, struct page *page,
|
|
- void *x, void *addr, unsigned int offset)
|
|
|
|
|
|
+ void *x, unsigned long addr, unsigned int offset)
|
|
{
|
|
{
|
|
void *prior;
|
|
void *prior;
|
|
void **object = (void *)x;
|
|
void **object = (void *)x;
|
|
@@ -1704,7 +1733,7 @@ debug:
|
|
* with all sorts of special processing.
|
|
* with all sorts of special processing.
|
|
*/
|
|
*/
|
|
static __always_inline void slab_free(struct kmem_cache *s,
|
|
static __always_inline void slab_free(struct kmem_cache *s,
|
|
- struct page *page, void *x, void *addr)
|
|
|
|
|
|
+ struct page *page, void *x, unsigned long addr)
|
|
{
|
|
{
|
|
void **object = (void *)x;
|
|
void **object = (void *)x;
|
|
struct kmem_cache_cpu *c;
|
|
struct kmem_cache_cpu *c;
|
|
@@ -1731,7 +1760,9 @@ void kmem_cache_free(struct kmem_cache *s, void *x)
|
|
|
|
|
|
page = virt_to_head_page(x);
|
|
page = virt_to_head_page(x);
|
|
|
|
|
|
- slab_free(s, page, x, __builtin_return_address(0));
|
|
|
|
|
|
+ slab_free(s, page, x, _RET_IP_);
|
|
|
|
+
|
|
|
|
+ kmemtrace_mark_free(KMEMTRACE_TYPE_CACHE, _RET_IP_, x);
|
|
}
|
|
}
|
|
EXPORT_SYMBOL(kmem_cache_free);
|
|
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)
|
|
void *__kmalloc(size_t size, gfp_t flags)
|
|
{
|
|
{
|
|
struct kmem_cache *s;
|
|
struct kmem_cache *s;
|
|
|
|
+ void *ret;
|
|
|
|
|
|
if (unlikely(size > PAGE_SIZE))
|
|
if (unlikely(size > PAGE_SIZE))
|
|
return kmalloc_large(size, flags);
|
|
return kmalloc_large(size, flags);
|
|
@@ -2659,7 +2691,12 @@ void *__kmalloc(size_t size, gfp_t flags)
|
|
if (unlikely(ZERO_OR_NULL_PTR(s)))
|
|
if (unlikely(ZERO_OR_NULL_PTR(s)))
|
|
return s;
|
|
return s;
|
|
|
|
|
|
- return slab_alloc(s, flags, -1, __builtin_return_address(0));
|
|
|
|
|
|
+ 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);
|
|
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)
|
|
void *__kmalloc_node(size_t size, gfp_t flags, int node)
|
|
{
|
|
{
|
|
struct kmem_cache *s;
|
|
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);
|
|
s = get_slab(size, flags);
|
|
|
|
|
|
if (unlikely(ZERO_OR_NULL_PTR(s)))
|
|
if (unlikely(ZERO_OR_NULL_PTR(s)))
|
|
return s;
|
|
return s;
|
|
|
|
|
|
- return slab_alloc(s, flags, node, __builtin_return_address(0));
|
|
|
|
|
|
+ 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);
|
|
EXPORT_SYMBOL(__kmalloc_node);
|
|
#endif
|
|
#endif
|
|
@@ -2744,7 +2795,9 @@ void kfree(const void *x)
|
|
put_page(page);
|
|
put_page(page);
|
|
return;
|
|
return;
|
|
}
|
|
}
|
|
- slab_free(page->slab, page, object, __builtin_return_address(0));
|
|
|
|
|
|
+ slab_free(page->slab, page, object, _RET_IP_);
|
|
|
|
+
|
|
|
|
+ kmemtrace_mark_free(KMEMTRACE_TYPE_KMALLOC, _RET_IP_, x);
|
|
}
|
|
}
|
|
EXPORT_SYMBOL(kfree);
|
|
EXPORT_SYMBOL(kfree);
|
|
|
|
|
|
@@ -3202,9 +3255,10 @@ static struct notifier_block __cpuinitdata slab_notifier = {
|
|
|
|
|
|
#endif
|
|
#endif
|
|
|
|
|
|
-void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, void *caller)
|
|
|
|
|
|
+void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, unsigned long caller)
|
|
{
|
|
{
|
|
struct kmem_cache *s;
|
|
struct kmem_cache *s;
|
|
|
|
+ void *ret;
|
|
|
|
|
|
if (unlikely(size > PAGE_SIZE))
|
|
if (unlikely(size > PAGE_SIZE))
|
|
return kmalloc_large(size, gfpflags);
|
|
return kmalloc_large(size, gfpflags);
|
|
@@ -3214,13 +3268,20 @@ void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, void *caller)
|
|
if (unlikely(ZERO_OR_NULL_PTR(s)))
|
|
if (unlikely(ZERO_OR_NULL_PTR(s)))
|
|
return s;
|
|
return s;
|
|
|
|
|
|
- return slab_alloc(s, gfpflags, -1, caller);
|
|
|
|
|
|
+ ret = slab_alloc(s, gfpflags, -1, caller);
|
|
|
|
+
|
|
|
|
+ /* Honor the call site pointer we recieved. */
|
|
|
|
+ kmemtrace_mark_alloc(KMEMTRACE_TYPE_KMALLOC, caller, ret, size,
|
|
|
|
+ s->size, gfpflags);
|
|
|
|
+
|
|
|
|
+ return ret;
|
|
}
|
|
}
|
|
|
|
|
|
void *__kmalloc_node_track_caller(size_t size, gfp_t gfpflags,
|
|
void *__kmalloc_node_track_caller(size_t size, gfp_t gfpflags,
|
|
- int node, void *caller)
|
|
|
|
|
|
+ int node, unsigned long caller)
|
|
{
|
|
{
|
|
struct kmem_cache *s;
|
|
struct kmem_cache *s;
|
|
|
|
+ void *ret;
|
|
|
|
|
|
if (unlikely(size > PAGE_SIZE))
|
|
if (unlikely(size > PAGE_SIZE))
|
|
return kmalloc_large_node(size, gfpflags, node);
|
|
return kmalloc_large_node(size, gfpflags, node);
|
|
@@ -3230,7 +3291,13 @@ void *__kmalloc_node_track_caller(size_t size, gfp_t gfpflags,
|
|
if (unlikely(ZERO_OR_NULL_PTR(s)))
|
|
if (unlikely(ZERO_OR_NULL_PTR(s)))
|
|
return s;
|
|
return s;
|
|
|
|
|
|
- return slab_alloc(s, gfpflags, node, caller);
|
|
|
|
|
|
+ ret = slab_alloc(s, gfpflags, node, caller);
|
|
|
|
+
|
|
|
|
+ /* Honor the call site pointer we recieved. */
|
|
|
|
+ kmemtrace_mark_alloc_node(KMEMTRACE_TYPE_KMALLOC, caller, ret,
|
|
|
|
+ size, s->size, gfpflags, node);
|
|
|
|
+
|
|
|
|
+ return ret;
|
|
}
|
|
}
|
|
|
|
|
|
#ifdef CONFIG_SLUB_DEBUG
|
|
#ifdef CONFIG_SLUB_DEBUG
|
|
@@ -3429,7 +3496,7 @@ static void resiliency_test(void) {};
|
|
|
|
|
|
struct location {
|
|
struct location {
|
|
unsigned long count;
|
|
unsigned long count;
|
|
- void *addr;
|
|
|
|
|
|
+ unsigned long addr;
|
|
long long sum_time;
|
|
long long sum_time;
|
|
long min_time;
|
|
long min_time;
|
|
long max_time;
|
|
long max_time;
|
|
@@ -3477,7 +3544,7 @@ static int add_location(struct loc_track *t, struct kmem_cache *s,
|
|
{
|
|
{
|
|
long start, end, pos;
|
|
long start, end, pos;
|
|
struct location *l;
|
|
struct location *l;
|
|
- void *caddr;
|
|
|
|
|
|
+ unsigned long caddr;
|
|
unsigned long age = jiffies - track->when;
|
|
unsigned long age = jiffies - track->when;
|
|
|
|
|
|
start = -1;
|
|
start = -1;
|