|
@@ -182,7 +182,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 */
|
|
@@ -371,7 +371,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;
|
|
|
|
|
|
@@ -395,8 +395,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)
|
|
@@ -405,7 +405,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)
|
|
@@ -870,7 +870,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;
|
|
@@ -910,7 +910,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;
|
|
@@ -1033,10 +1033,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; }
|
|
@@ -1503,8 +1503,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;
|
|
@@ -1588,7 +1588,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;
|
|
@@ -1617,14 +1617,14 @@ 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));
|
|
|
|
|
|
+ return slab_alloc(s, gfpflags, -1, _RET_IP_);
|
|
}
|
|
}
|
|
EXPORT_SYMBOL(kmem_cache_alloc);
|
|
EXPORT_SYMBOL(kmem_cache_alloc);
|
|
|
|
|
|
#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));
|
|
|
|
|
|
+ return slab_alloc(s, gfpflags, node, _RET_IP_);
|
|
}
|
|
}
|
|
EXPORT_SYMBOL(kmem_cache_alloc_node);
|
|
EXPORT_SYMBOL(kmem_cache_alloc_node);
|
|
#endif
|
|
#endif
|
|
@@ -1638,7 +1638,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;
|
|
@@ -1708,7 +1708,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;
|
|
@@ -1735,7 +1735,7 @@ 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_);
|
|
}
|
|
}
|
|
EXPORT_SYMBOL(kmem_cache_free);
|
|
EXPORT_SYMBOL(kmem_cache_free);
|
|
|
|
|
|
@@ -2663,7 +2663,7 @@ 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));
|
|
|
|
|
|
+ return slab_alloc(s, flags, -1, _RET_IP_);
|
|
}
|
|
}
|
|
EXPORT_SYMBOL(__kmalloc);
|
|
EXPORT_SYMBOL(__kmalloc);
|
|
|
|
|
|
@@ -2691,7 +2691,7 @@ void *__kmalloc_node(size_t size, gfp_t flags, int node)
|
|
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));
|
|
|
|
|
|
+ return slab_alloc(s, flags, node, _RET_IP_);
|
|
}
|
|
}
|
|
EXPORT_SYMBOL(__kmalloc_node);
|
|
EXPORT_SYMBOL(__kmalloc_node);
|
|
#endif
|
|
#endif
|
|
@@ -2748,7 +2748,7 @@ 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_);
|
|
}
|
|
}
|
|
EXPORT_SYMBOL(kfree);
|
|
EXPORT_SYMBOL(kfree);
|
|
|
|
|
|
@@ -3204,7 +3204,7 @@ 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;
|
|
|
|
|
|
@@ -3220,7 +3220,7 @@ void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, void *caller)
|
|
}
|
|
}
|
|
|
|
|
|
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;
|
|
|
|
|
|
@@ -3431,7 +3431,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;
|
|
@@ -3479,7 +3479,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;
|