diff options
Diffstat (limited to 'mm/slab.c')
-rw-r--r-- | mm/slab.c | 70 |
1 files changed, 41 insertions, 29 deletions
@@ -308,12 +308,12 @@ struct kmem_list3 __initdata initkmem_list3[NUM_INIT_LISTS]; | |||
308 | #define SIZE_L3 (1 + MAX_NUMNODES) | 308 | #define SIZE_L3 (1 + MAX_NUMNODES) |
309 | 309 | ||
310 | /* | 310 | /* |
311 | * This function may be completely optimized away if | 311 | * This function must be completely optimized away if |
312 | * a constant is passed to it. Mostly the same as | 312 | * a constant is passed to it. Mostly the same as |
313 | * what is in linux/slab.h except it returns an | 313 | * what is in linux/slab.h except it returns an |
314 | * index. | 314 | * index. |
315 | */ | 315 | */ |
316 | static inline int index_of(const size_t size) | 316 | static __always_inline int index_of(const size_t size) |
317 | { | 317 | { |
318 | if (__builtin_constant_p(size)) { | 318 | if (__builtin_constant_p(size)) { |
319 | int i = 0; | 319 | int i = 0; |
@@ -329,7 +329,8 @@ static inline int index_of(const size_t size) | |||
329 | extern void __bad_size(void); | 329 | extern void __bad_size(void); |
330 | __bad_size(); | 330 | __bad_size(); |
331 | } | 331 | } |
332 | } | 332 | } else |
333 | BUG(); | ||
333 | return 0; | 334 | return 0; |
334 | } | 335 | } |
335 | 336 | ||
@@ -639,7 +640,7 @@ static enum { | |||
639 | 640 | ||
640 | static DEFINE_PER_CPU(struct work_struct, reap_work); | 641 | static DEFINE_PER_CPU(struct work_struct, reap_work); |
641 | 642 | ||
642 | static void free_block(kmem_cache_t* cachep, void** objpp, int len); | 643 | static void free_block(kmem_cache_t* cachep, void** objpp, int len, int node); |
643 | static void enable_cpucache (kmem_cache_t *cachep); | 644 | static void enable_cpucache (kmem_cache_t *cachep); |
644 | static void cache_reap (void *unused); | 645 | static void cache_reap (void *unused); |
645 | static int __node_shrink(kmem_cache_t *cachep, int node); | 646 | static int __node_shrink(kmem_cache_t *cachep, int node); |
@@ -804,7 +805,7 @@ static inline void __drain_alien_cache(kmem_cache_t *cachep, struct array_cache | |||
804 | 805 | ||
805 | if (ac->avail) { | 806 | if (ac->avail) { |
806 | spin_lock(&rl3->list_lock); | 807 | spin_lock(&rl3->list_lock); |
807 | free_block(cachep, ac->entry, ac->avail); | 808 | free_block(cachep, ac->entry, ac->avail, node); |
808 | ac->avail = 0; | 809 | ac->avail = 0; |
809 | spin_unlock(&rl3->list_lock); | 810 | spin_unlock(&rl3->list_lock); |
810 | } | 811 | } |
@@ -925,7 +926,7 @@ static int __devinit cpuup_callback(struct notifier_block *nfb, | |||
925 | /* Free limit for this kmem_list3 */ | 926 | /* Free limit for this kmem_list3 */ |
926 | l3->free_limit -= cachep->batchcount; | 927 | l3->free_limit -= cachep->batchcount; |
927 | if (nc) | 928 | if (nc) |
928 | free_block(cachep, nc->entry, nc->avail); | 929 | free_block(cachep, nc->entry, nc->avail, node); |
929 | 930 | ||
930 | if (!cpus_empty(mask)) { | 931 | if (!cpus_empty(mask)) { |
931 | spin_unlock(&l3->list_lock); | 932 | spin_unlock(&l3->list_lock); |
@@ -934,7 +935,7 @@ static int __devinit cpuup_callback(struct notifier_block *nfb, | |||
934 | 935 | ||
935 | if (l3->shared) { | 936 | if (l3->shared) { |
936 | free_block(cachep, l3->shared->entry, | 937 | free_block(cachep, l3->shared->entry, |
937 | l3->shared->avail); | 938 | l3->shared->avail, node); |
938 | kfree(l3->shared); | 939 | kfree(l3->shared); |
939 | l3->shared = NULL; | 940 | l3->shared = NULL; |
940 | } | 941 | } |
@@ -1882,12 +1883,13 @@ static void do_drain(void *arg) | |||
1882 | { | 1883 | { |
1883 | kmem_cache_t *cachep = (kmem_cache_t*)arg; | 1884 | kmem_cache_t *cachep = (kmem_cache_t*)arg; |
1884 | struct array_cache *ac; | 1885 | struct array_cache *ac; |
1886 | int node = numa_node_id(); | ||
1885 | 1887 | ||
1886 | check_irq_off(); | 1888 | check_irq_off(); |
1887 | ac = ac_data(cachep); | 1889 | ac = ac_data(cachep); |
1888 | spin_lock(&cachep->nodelists[numa_node_id()]->list_lock); | 1890 | spin_lock(&cachep->nodelists[node]->list_lock); |
1889 | free_block(cachep, ac->entry, ac->avail); | 1891 | free_block(cachep, ac->entry, ac->avail, node); |
1890 | spin_unlock(&cachep->nodelists[numa_node_id()]->list_lock); | 1892 | spin_unlock(&cachep->nodelists[node]->list_lock); |
1891 | ac->avail = 0; | 1893 | ac->avail = 0; |
1892 | } | 1894 | } |
1893 | 1895 | ||
@@ -2508,16 +2510,12 @@ cache_alloc_debugcheck_after(kmem_cache_t *cachep, | |||
2508 | #define cache_alloc_debugcheck_after(a,b,objp,d) (objp) | 2510 | #define cache_alloc_debugcheck_after(a,b,objp,d) (objp) |
2509 | #endif | 2511 | #endif |
2510 | 2512 | ||
2511 | 2513 | static inline void *____cache_alloc(kmem_cache_t *cachep, unsigned int __nocast flags) | |
2512 | static inline void *__cache_alloc(kmem_cache_t *cachep, unsigned int __nocast flags) | ||
2513 | { | 2514 | { |
2514 | unsigned long save_flags; | ||
2515 | void* objp; | 2515 | void* objp; |
2516 | struct array_cache *ac; | 2516 | struct array_cache *ac; |
2517 | 2517 | ||
2518 | cache_alloc_debugcheck_before(cachep, flags); | 2518 | check_irq_off(); |
2519 | |||
2520 | local_irq_save(save_flags); | ||
2521 | ac = ac_data(cachep); | 2519 | ac = ac_data(cachep); |
2522 | if (likely(ac->avail)) { | 2520 | if (likely(ac->avail)) { |
2523 | STATS_INC_ALLOCHIT(cachep); | 2521 | STATS_INC_ALLOCHIT(cachep); |
@@ -2527,6 +2525,18 @@ static inline void *__cache_alloc(kmem_cache_t *cachep, unsigned int __nocast fl | |||
2527 | STATS_INC_ALLOCMISS(cachep); | 2525 | STATS_INC_ALLOCMISS(cachep); |
2528 | objp = cache_alloc_refill(cachep, flags); | 2526 | objp = cache_alloc_refill(cachep, flags); |
2529 | } | 2527 | } |
2528 | return objp; | ||
2529 | } | ||
2530 | |||
2531 | static inline void *__cache_alloc(kmem_cache_t *cachep, unsigned int __nocast flags) | ||
2532 | { | ||
2533 | unsigned long save_flags; | ||
2534 | void* objp; | ||
2535 | |||
2536 | cache_alloc_debugcheck_before(cachep, flags); | ||
2537 | |||
2538 | local_irq_save(save_flags); | ||
2539 | objp = ____cache_alloc(cachep, flags); | ||
2530 | local_irq_restore(save_flags); | 2540 | local_irq_restore(save_flags); |
2531 | objp = cache_alloc_debugcheck_after(cachep, flags, objp, | 2541 | objp = cache_alloc_debugcheck_after(cachep, flags, objp, |
2532 | __builtin_return_address(0)); | 2542 | __builtin_return_address(0)); |
@@ -2608,7 +2618,7 @@ done: | |||
2608 | /* | 2618 | /* |
2609 | * Caller needs to acquire correct kmem_list's list_lock | 2619 | * Caller needs to acquire correct kmem_list's list_lock |
2610 | */ | 2620 | */ |
2611 | static void free_block(kmem_cache_t *cachep, void **objpp, int nr_objects) | 2621 | static void free_block(kmem_cache_t *cachep, void **objpp, int nr_objects, int node) |
2612 | { | 2622 | { |
2613 | int i; | 2623 | int i; |
2614 | struct kmem_list3 *l3; | 2624 | struct kmem_list3 *l3; |
@@ -2617,14 +2627,12 @@ static void free_block(kmem_cache_t *cachep, void **objpp, int nr_objects) | |||
2617 | void *objp = objpp[i]; | 2627 | void *objp = objpp[i]; |
2618 | struct slab *slabp; | 2628 | struct slab *slabp; |
2619 | unsigned int objnr; | 2629 | unsigned int objnr; |
2620 | int nodeid = 0; | ||
2621 | 2630 | ||
2622 | slabp = GET_PAGE_SLAB(virt_to_page(objp)); | 2631 | slabp = GET_PAGE_SLAB(virt_to_page(objp)); |
2623 | nodeid = slabp->nodeid; | 2632 | l3 = cachep->nodelists[node]; |
2624 | l3 = cachep->nodelists[nodeid]; | ||
2625 | list_del(&slabp->list); | 2633 | list_del(&slabp->list); |
2626 | objnr = (objp - slabp->s_mem) / cachep->objsize; | 2634 | objnr = (objp - slabp->s_mem) / cachep->objsize; |
2627 | check_spinlock_acquired_node(cachep, nodeid); | 2635 | check_spinlock_acquired_node(cachep, node); |
2628 | check_slabp(cachep, slabp); | 2636 | check_slabp(cachep, slabp); |
2629 | 2637 | ||
2630 | 2638 | ||
@@ -2664,13 +2672,14 @@ static void cache_flusharray(kmem_cache_t *cachep, struct array_cache *ac) | |||
2664 | { | 2672 | { |
2665 | int batchcount; | 2673 | int batchcount; |
2666 | struct kmem_list3 *l3; | 2674 | struct kmem_list3 *l3; |
2675 | int node = numa_node_id(); | ||
2667 | 2676 | ||
2668 | batchcount = ac->batchcount; | 2677 | batchcount = ac->batchcount; |
2669 | #if DEBUG | 2678 | #if DEBUG |
2670 | BUG_ON(!batchcount || batchcount > ac->avail); | 2679 | BUG_ON(!batchcount || batchcount > ac->avail); |
2671 | #endif | 2680 | #endif |
2672 | check_irq_off(); | 2681 | check_irq_off(); |
2673 | l3 = cachep->nodelists[numa_node_id()]; | 2682 | l3 = cachep->nodelists[node]; |
2674 | spin_lock(&l3->list_lock); | 2683 | spin_lock(&l3->list_lock); |
2675 | if (l3->shared) { | 2684 | if (l3->shared) { |
2676 | struct array_cache *shared_array = l3->shared; | 2685 | struct array_cache *shared_array = l3->shared; |
@@ -2686,7 +2695,7 @@ static void cache_flusharray(kmem_cache_t *cachep, struct array_cache *ac) | |||
2686 | } | 2695 | } |
2687 | } | 2696 | } |
2688 | 2697 | ||
2689 | free_block(cachep, ac->entry, batchcount); | 2698 | free_block(cachep, ac->entry, batchcount, node); |
2690 | free_done: | 2699 | free_done: |
2691 | #if STATS | 2700 | #if STATS |
2692 | { | 2701 | { |
@@ -2751,7 +2760,7 @@ static inline void __cache_free(kmem_cache_t *cachep, void *objp) | |||
2751 | } else { | 2760 | } else { |
2752 | spin_lock(&(cachep->nodelists[nodeid])-> | 2761 | spin_lock(&(cachep->nodelists[nodeid])-> |
2753 | list_lock); | 2762 | list_lock); |
2754 | free_block(cachep, &objp, 1); | 2763 | free_block(cachep, &objp, 1, nodeid); |
2755 | spin_unlock(&(cachep->nodelists[nodeid])-> | 2764 | spin_unlock(&(cachep->nodelists[nodeid])-> |
2756 | list_lock); | 2765 | list_lock); |
2757 | } | 2766 | } |
@@ -2844,7 +2853,7 @@ void *kmem_cache_alloc_node(kmem_cache_t *cachep, unsigned int __nocast flags, i | |||
2844 | unsigned long save_flags; | 2853 | unsigned long save_flags; |
2845 | void *ptr; | 2854 | void *ptr; |
2846 | 2855 | ||
2847 | if (nodeid == numa_node_id() || nodeid == -1) | 2856 | if (nodeid == -1) |
2848 | return __cache_alloc(cachep, flags); | 2857 | return __cache_alloc(cachep, flags); |
2849 | 2858 | ||
2850 | if (unlikely(!cachep->nodelists[nodeid])) { | 2859 | if (unlikely(!cachep->nodelists[nodeid])) { |
@@ -2855,7 +2864,10 @@ void *kmem_cache_alloc_node(kmem_cache_t *cachep, unsigned int __nocast flags, i | |||
2855 | 2864 | ||
2856 | cache_alloc_debugcheck_before(cachep, flags); | 2865 | cache_alloc_debugcheck_before(cachep, flags); |
2857 | local_irq_save(save_flags); | 2866 | local_irq_save(save_flags); |
2858 | ptr = __cache_alloc_node(cachep, flags, nodeid); | 2867 | if (nodeid == numa_node_id()) |
2868 | ptr = ____cache_alloc(cachep, flags); | ||
2869 | else | ||
2870 | ptr = __cache_alloc_node(cachep, flags, nodeid); | ||
2859 | local_irq_restore(save_flags); | 2871 | local_irq_restore(save_flags); |
2860 | ptr = cache_alloc_debugcheck_after(cachep, flags, ptr, __builtin_return_address(0)); | 2872 | ptr = cache_alloc_debugcheck_after(cachep, flags, ptr, __builtin_return_address(0)); |
2861 | 2873 | ||
@@ -3079,7 +3091,7 @@ static int alloc_kmemlist(kmem_cache_t *cachep) | |||
3079 | 3091 | ||
3080 | if ((nc = cachep->nodelists[node]->shared)) | 3092 | if ((nc = cachep->nodelists[node]->shared)) |
3081 | free_block(cachep, nc->entry, | 3093 | free_block(cachep, nc->entry, |
3082 | nc->avail); | 3094 | nc->avail, node); |
3083 | 3095 | ||
3084 | l3->shared = new; | 3096 | l3->shared = new; |
3085 | if (!cachep->nodelists[node]->alien) { | 3097 | if (!cachep->nodelists[node]->alien) { |
@@ -3160,7 +3172,7 @@ static int do_tune_cpucache(kmem_cache_t *cachep, int limit, int batchcount, | |||
3160 | if (!ccold) | 3172 | if (!ccold) |
3161 | continue; | 3173 | continue; |
3162 | spin_lock_irq(&cachep->nodelists[cpu_to_node(i)]->list_lock); | 3174 | spin_lock_irq(&cachep->nodelists[cpu_to_node(i)]->list_lock); |
3163 | free_block(cachep, ccold->entry, ccold->avail); | 3175 | free_block(cachep, ccold->entry, ccold->avail, cpu_to_node(i)); |
3164 | spin_unlock_irq(&cachep->nodelists[cpu_to_node(i)]->list_lock); | 3176 | spin_unlock_irq(&cachep->nodelists[cpu_to_node(i)]->list_lock); |
3165 | kfree(ccold); | 3177 | kfree(ccold); |
3166 | } | 3178 | } |
@@ -3240,7 +3252,7 @@ static void drain_array_locked(kmem_cache_t *cachep, | |||
3240 | if (tofree > ac->avail) { | 3252 | if (tofree > ac->avail) { |
3241 | tofree = (ac->avail+1)/2; | 3253 | tofree = (ac->avail+1)/2; |
3242 | } | 3254 | } |
3243 | free_block(cachep, ac->entry, tofree); | 3255 | free_block(cachep, ac->entry, tofree, node); |
3244 | ac->avail -= tofree; | 3256 | ac->avail -= tofree; |
3245 | memmove(ac->entry, &(ac->entry[tofree]), | 3257 | memmove(ac->entry, &(ac->entry[tofree]), |
3246 | sizeof(void*)*ac->avail); | 3258 | sizeof(void*)*ac->avail); |