slub: per cpu partial lists V4
Subsystems (3)
cover slub: per cpu partial lists V4
V3->V4 : Use a single linked per cpu list instead of a per cpu array.
This results in improvements even for the single threaded case. I think this is ready for more widespread testing (-next?) The number of partial pages per cpu is configurable via /sys/kernel/slab/<name>/cpu_partial
V2->V3 : Work on the todo list. Still some work to be done to reduce
code impact and make this all cleaner. (Pekka: patch 1-3 are cleanup patches of general usefulness. You got #1 already 2+3 could be picked up w/o any issue).
The following patchset introduces per cpu partial lists which allow a performance increase of around ~10-20% with hackbench on my Sandybridge processor.
These lists help to avoid per node locking overhead. Allocator latency could be further reduced by making these operations work without disabling interrupts (like the fastpath and the free slowpath) but that is another project.
It is interesting to note that BSD has gone to a scheme with partial pages only per cpu (source: Adrian). Transfer of cpu ownerships is done using IPIs. Probably too much overhead for our taste. The approach here keeps the per node partial lists essentially meaning the "pages" in there have no cpu owner.
PATCH 1/7 slub: free slabs without holding locks (V2)
There are two situations in which slub holds a lock while releasing pages:
A. During kmem_cache_shrink()
B. During kmem_cache_close()
For A build a list while holding the lock and then release the pages later. In case of B we are the last remaining user of the slab so there is no need to take the listlock.
After this patch all calls to the page allocator to free pages are done without holding any spinlocks. kmem_cache_destroy() will still hold the slub_lock semaphore.
V1->V2. Remove kfree. Avoid locking in free_partial.
--- mm/slub.c | 26 +++++++++++++------------- 1 file changed, 13 insertions(+), 13 deletions(-)
mm/slub.c +13 -13
@@ -2970,13 +2970,13 @@ static void list_slab_objects(struct kme/* * Attempt to free all partial slabs on a node. +* This is called from kmem_cache_close(). We must be the last thread +* using the cache and therefore we do not need to lock anymore. */ static void free_partial (struct kmem_cache *s,struct kmem_cache_node *n) { -unsigned long flags;struct page *page, *h; -spin_lock_irqsave (&n->list_lock, flags);list_for_each_entry_safe (page, h, &n->partial, lru) {if (!page->inuse) {remove_partial (n, page);
@@ -2986,7 +2986,6 @@ static void free_partial(struct kmem_cac "Objects remaining on kmem_cache_close()"); } } -spin_unlock_irqrestore (&n->list_lock, flags); }/*
@@ -3020,6 +3019,7 @@ void kmem_cache_destroy(struct kmem_cach s->refcount--;if (!s->refcount) {list_del (&s->list); +up_write (&slub_lock);if (kmem_cache_close (s)) {printk (KERN_ERR "SLUB %s: %s called for cache that " "still has objects.\n" , s->name, __func__);
@@ -3028,8 +3028,8 @@ void kmem_cache_destroy(struct kmem_cachif (s->flags &SLAB_DESTROY_BY_RCU )rcu_barrier ();sysfs_slab_remove (s); - } -up_write (&slub_lock); + }else +up_write (&slub_lock); }EXPORT_SYMBOL (kmem_cache_destroy);
@@ -3347,23 +3347,23 @@ int kmem_cache_shrink(struct kmem_cache* list_lock. page->inuse here is the upper limit. */ list_for_each_entry_safe (page, t, &n->partial, lru) { -if (!page->inuse) { -remove_partial (n, page); -discard_slab (s, page); - }else { -list_move (&page->lru, - slabs_by_inuse + page->inuse); - } +list_move (&page->lru, slabs_by_inuse + page->inuse); +if (!page->inuse) + n->nr_partial--; }/* * Rebuild the partial list with the slabs filled up most * first and the least used slabs at the end. */ -for (i = objects -1 ; i >=0 ; i--) +for (i = objects -1 ; i >0 ; i--)list_splice (slabs_by_inuse + i, n->partial.prev);spin_unlock_irqrestore (&n->list_lock, flags); + +/* Release empty slabs */ +list_for_each_entry_safe (page, t, slabs_by_inuse, lru) +discard_slab (s, page); }kfree (slabs_by_inuse);
Re: [slub p4 1/7] slub: free slabs without holding locks (V2)
Quoted 27 lines · Christoph Lameter
There are two situations in which slub holds a lock while releasing pages:
A. During
kmem_cache_shrink()
B. Duringkmem_cache_close()For A build a list while holding the lock and then release the pages later. In case of B we are the last remaining user of the slab so there is no need to take the listlock.
After this patch all calls to the page allocator to free pages are done without holding any spinlocks.
kmem_cache_destroy()will still hold theslub_locksemaphore.
V1->V2. Remove kfree. Avoid locking infree_partial.Signed-off-by Christoph Lameter <[email protected]>---
mm/slub.c| 26 +++++++++++++-------------1 file changed, 13 insertions(+), 13 deletions(-)Index:
linux-2.6/mm/slub.c
===================================================================
mm/slub.c static void list_slab_objects(struct kme · line 2977
Quoted 8 lines
mm/slub.c +2
-0@@ -2970,13 +2970,13 @@ static void list_slab_objects(struct kme/* * Attempt to free all partial slabs on a node. +* This is called from kmem_cache_close(). We must be the last thread +* using the cache and therefore we do not need to lock anymore. */ static void free_partial (struct kmem_cache *s,struct kmem_cache_node *n) {
Is it possible to somehow verify that we're the last thread using the cache when SLUB debugging is enabled? It'd be useful for tracking down callers that violate this assumption.
Pekka
Re: [slub p4 1/7] slub: free slabs without holding locks (V2)
Quoted 6 lines · Pekka Enberg
Quoted 2 lines
static void
free_partial(struct kmem_cache *s, struct kmem_cache_node *n){Is it possible to somehow verify that we're the last thread using the cache when SLUB debugging is enabled? It'd be useful for tracking down callers that violate this assumption.
Hmmm... We do not track "threads" using slabs. I do not really know what the "thread" entity that would access a slab is? A subsystem? A kernel thread? A user thread? All these can access any slab at any time.
PATCH 2/7 slub: Remove useless statements in __slab_alloc
In reply to Christoph LameterTwo statements in __slab_alloc() do not have any effect.
1. c->page is already set to NULL by deactivate_slab() called right before.
2. gfpflags are masked in new_slab() before being passed to the page allocator. There is no need to mask gfpflags in __slab_alloc in particular since most frequent processing in __slab_alloc does not require the use of a gfpmask.
--- mm/slub.c | 4 ---- 1 file changed, 4 deletions(-)
mm/slub.c +0 -4
@@ -2064,9 +2064,6 @@ static void *__slab_alloc(struct kmem_ca c =this_cpu_ptr (s->cpu_slab);#endif -/* We handle __GFP_ZERO in the caller */ - gfpflags &= ~__GFP_ZERO; - page = c->page;if (!page) goto new_slab;
@@ -2163,7 +2160,6 @@ debug: c->freelist =get_freepointer (s, object);deactivate_slab (s, c); - c->page =NULL ; c->node =NUMA_NO_NODE ;local_irq_restore (flags);return object;
Re: [slub p4 2/7] slub: Remove useless statements in __slab_alloc
Quoted 11 lines · Christoph Lameter
Two statements in
__slab_alloc()do not have any effect.1.
c->pageis already set to NULL bydeactivate_slab()called right before.2. gfpflags are masked in
new_slab()before being passed to the page allocator. There is no need to mask gfpflags in__slab_allocin particular since most frequent processing in__slab_allocdoes not require the use of a gfpmask.Signed-off-by Christoph Lameter <[email protected]>
Linus wasn't actually on the CC of the email.
Quoted 9 lines
---
mm/slub.c| 4 ----1 file changed, 4 deletions(-)Index:
linux-2.6/mm/slub.c
===================================================================
mm/slub.c static void *__slab_alloc(struct kmem_ca · line 2069
Quoted 6 lines
mm/slub.c +0
-3@@ -2064,9 +2064,6 @@ static void *__slab_alloc(struct kmem_ca c =this_cpu_ptr (s->cpu_slab);#endif -/* We handle __GFP_ZERO in the caller */ - gfpflags &= ~__GFP_ZERO; -
This is the part Linus felt strongly about in the past. It's not needed now that we mask GFP flags in new_slab() and the code path is pretty hot on workloads where SLAB traditionally has had better performance.
Quoted 13 lines
mm/slub.c +0
-1page = c->page;if (!page) goto new_slab;@@ -2163,7 +2160,6 @@ debug: c->freelist =get_freepointer (s, object);deactivate_slab (s, c); - c->page =NULL ; c->node =NUMA_NO_NODE ;local_irq_restore (flags);return object;
Re: [slub p4 2/7] slub: Remove useless statements in __slab_alloc
Quoted 4 lines · Pekka Enberg
Quoted 2 lines
Signed-off-by Christoph Lameter <[email protected]>Linus wasn't actually on the CC of the email.
Quilt usually does that automatically when it finds a cc.
PATCH 3/7 slub: Prepare inuse field in new_slab()
In reply to Christoph Lameterinuse will always be set to page->objects. There is no point in initializing the field to zero in new_slab() and then overwriting the value in __slab_alloc().
--- mm/slub.c | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-)
mm/slub.c +2 -3
@@ -1447,7 +1447,7 @@ static struct page *new_slab(struct kmemset_freepointer (s, last,NULL ); page->freelist = start; - page->inuse =0 ; + page->inuse = page->objects; page->frozen =1 ; out:return page;
@@ -2139,7 +2139,6 @@ new_slab:*/ object = page->freelist; page->freelist =NULL ; - page->inuse = page->objects;stat (s,ALLOC_SLAB ); c->node =page_to_nid (page);
@@ -2681,7 +2680,7 @@ static void early_kmem_cache_node_alloc( n = page->freelist;BUG_ON (!n); page->freelist =get_freepointer (kmem_cache_node, n); - page->inuse++; + page->inuse =1 ; page->frozen =0 ; kmem_cache_node->node[node] = n;#ifdef CONFIG_SLUB_DEBUG
PATCH 4/7 slub: pass kmem_cache_cpu pointer to get_partial()
In reply to Christoph LameterPass the kmem_cache_cpu pointer to get_partial(). That way we can avoid the this_cpu_write() statements.
--- mm/slub.c | 30 +++++++++++++++--------------- 1 file changed, 15 insertions(+), 15 deletions(-)
mm/slub.c +15 -15
@@ -1557,7 +1557,8 @@ static inline void remove_partial(struct* Must hold list_lock. */ static inline int acquire_slab (struct kmem_cache *s, -struct kmem_cache_node *n,struct page *page) +struct kmem_cache_node *n,struct page *page, +struct kmem_cache_cpu *c) {void *freelist;unsigned long counters;
@@ -1586,9 +1587,9 @@ static inline int acquire_slab(struct kmif (freelist) {/* Populate the per cpu freelist */ -this_cpu_write (s->cpu_slab->freelist, freelist); -this_cpu_write (s->cpu_slab->page, page); -this_cpu_write (s->cpu_slab->node,page_to_nid (page)); + c->freelist = freelist; + c->page = page; + c->node =page_to_nid (page);return 1 ; }else {/*
@@ -1606,7 +1607,7 @@ static inline int acquire_slab(struct km* Try to allocate a partial slab from a specific node. */ static struct page *get_partial_node (struct kmem_cache *s, -struct kmem_cache_node *n) +struct kmem_cache_node *n,struct kmem_cache_cpu *c) {struct page *page;
@@ -1621,7 +1622,7 @@ static struct page *get_partial_node(strspin_lock (&n->list_lock);list_for_each_entry (page, &n->partial, lru) -if (acquire_slab (s, n, page)) +if (acquire_slab (s, n, page, c)) goto out; page =NULL ; out:
@@ -1632,7 +1633,8 @@ out:/* * Get a page from somewhere. Search in increasing NUMA distances. */ -static struct page *get_any_partial (struct kmem_cache *s,gfp_t flags) +static struct page *get_any_partial (struct kmem_cache *s,gfp_t flags, +struct kmem_cache_cpu *c) {#ifdef CONFIG_NUMA struct zonelist *zonelist;
@@ -1672,7 +1674,7 @@ static struct page *get_any_partial(struif (n &&cpuset_zone_allowed_hardwall (zone, flags) && n->nr_partial > s->min_partial) { - page =get_partial_node (s, n); + page =get_partial_node (s, n, c);if (page) {put_mems_allowed ();return page;
@@ -1687,16 +1689,17 @@ static struct page *get_any_partial(stru/* * Get a partial page, lock it and return it. */ -static struct page *get_partial (struct kmem_cache *s,gfp_t flags,int node) +static struct page *get_partial (struct kmem_cache *s,gfp_t flags,int node, +struct kmem_cache_cpu *c) {struct page *page;int searchnode = (node ==NUMA_NO_NODE ) ?numa_node_id () : node; - page =get_partial_node (s,get_node (s, searchnode)); + page =get_partial_node (s,get_node (s, searchnode), c);if (page || node !=NUMA_NO_NODE )return page; -return get_any_partial (s, flags); +return get_any_partial (s, flags, c); }#ifdef CONFIG_PREEMPT
@@ -1765,9 +1768,6 @@ void init_kmem_cache_cpus(struct kmem_cafor_each_possible_cpu (cpu)per_cpu_ptr (s->cpu_slab, cpu)->tid =init_tid (cpu); } -/* -* Remove the cpu slab -*/ /* * Remove the cpu slab
@@ -2116,7 +2116,7 @@ load_freelist:return object; new_slab: - page =get_partial (s, gfpflags, node); + page =get_partial (s, gfpflags, node, c);if (page) {stat (s,ALLOC_FROM_PARTIAL ); object = c->freelist;
PATCH 5/7 slub: return object pointer from get_partial() / new_slab().
In reply to Christoph LameterThere is no need anymore to return the pointer to a slab page from get_partial() since the page reference can be stored in the kmem_cache_cpu structures "page" field.
Return an object pointer instead.
That in turn allows a simplification of the spaghetti code in __slab_alloc().
--- mm/slub.c | 133 ++++++++++++++++++++++++++++++++++---------------------------- 1 file changed, 73 insertions(+), 60 deletions(-)
mm/slub.c +73 -60
@@ -1554,9 +1554,11 @@ static inline void remove_partial(struct* Lock slab, remove from the partial list and put the object into the * per cpu freelist. * +* Returns a list of objects or NULL if it fails. +* * Must hold list_lock. */ -static inline int acquire_slab (struct kmem_cache *s, +static inline void *acquire_slab (struct kmem_cache *s,struct kmem_cache_node *n,struct page *page,struct kmem_cache_cpu *c) {
@@ -1587,10 +1589,11 @@ static inline int acquire_slab(struct kmif (freelist) {/* Populate the per cpu freelist */ - c->freelist = freelist; c->page = page; c->node =page_to_nid (page); -return 1 ; +stat (s,ALLOC_FROM_PARTIAL ); + +return freelist; }else {/* * Slab page came from the wrong list. No object to allocate
@@ -1599,17 +1602,18 @@ static inline int acquire_slab(struct km*/ printk (KERN_ERR "SLUB: %s : Page without available objects on" " partial list\n" , s->name); -return 0 ; +return NULL ; } }/* * Try to allocate a partial slab from a specific node. */ -static struct page *get_partial_node (struct kmem_cache *s, +static void *get_partial_node (struct kmem_cache *s,struct kmem_cache_node *n,struct kmem_cache_cpu *c) {struct page *page; +void *object;/* * Racy check. If we mistakenly see no partial slabs then we
@@ -1621,13 +1625,15 @@ static struct page *get_partial_node(strreturn NULL ;spin_lock (&n->list_lock); -list_for_each_entry (page, &n->partial, lru) -if (acquire_slab (s, n, page, c)) +list_for_each_entry (page, &n->partial, lru) { + object =acquire_slab (s, n, page, c); +if (object) goto out; - page =NULL ; + } + object =NULL ; out:spin_unlock (&n->list_lock); -return page; +return object; }/*
@@ -1641,7 +1647,7 @@ static struct page *get_any_partial(strustruct zoneref *z;struct zone *zone;enum zone_type high_zoneidx =gfp_zone (flags); -struct page *page; +void *object;/* * The defrag ratio allows a configuration of the tradeoffs between
@@ -1674,10 +1680,10 @@ static struct page *get_any_partial(struif (n &&cpuset_zone_allowed_hardwall (zone, flags) && n->nr_partial > s->min_partial) { - page =get_partial_node (s, n, c); -if (page) { + object =get_partial_node (s, n, c); +if (object) {put_mems_allowed (); -return page; +return object; } } }
@@ -1689,15 +1695,15 @@ static struct page *get_any_partial(stru/* * Get a partial page, lock it and return it. */ -static struct page *get_partial (struct kmem_cache *s,gfp_t flags,int node, +static void *get_partial (struct kmem_cache *s,gfp_t flags,int node,struct kmem_cache_cpu *c) { -struct page *page; +void *object;int searchnode = (node ==NUMA_NO_NODE ) ?numa_node_id () : node; - page =get_partial_node (s,get_node (s, searchnode), c); -if (page || node !=NUMA_NO_NODE ) -return page; + object =get_partial_node (s,get_node (s, searchnode), c); +if (object || node !=NUMA_NO_NODE ) +return object;return get_any_partial (s, flags, c); }
@@ -2027,6 +2033,35 @@ slab_out_of_memory(struct kmem_cache *s, } } +static inline void *new_slab_objects (struct kmem_cache *s,gfp_t flags, +int node,struct kmem_cache_cpu **pc) +{ +void *object; +struct kmem_cache_cpu *c; +struct page *page =new_slab (s, flags, node); + +if (page) { + c =__this_cpu_ptr (s->cpu_slab); +if (c->page) +flush_slab (s, c); + +/* +* No other reference to the page yet so we can +* muck around with it freely without cmpxchg +*/ + object = page->freelist; + page->freelist =NULL ; + +stat (s,ALLOC_SLAB ); + c->node =page_to_nid (page); + c->page = page; + *pc = c; + }else + object =NULL ; + +return object; +} +/* * Slow path. The lockless freelist is empty or we need to perform * debugging duties.
@@ -2049,7 +2084,6 @@ static void *__slab_alloc(struct kmem_ca unsigned long addr, struct kmem_cache_cpu *c) { void **object; -struct page *page;unsigned long flags;struct page new;unsigned long counters;
@@ -2064,8 +2098,7 @@ static void *__slab_alloc(struct kmem_ca c =this_cpu_ptr (s->cpu_slab);#endif - page = c->page; -if (!page) +if (!c->page) goto new_slab;if (unlikely (!node_match (c, node))) {
@@ -2077,8 +2110,8 @@ static void *__slab_alloc(struct kmem_castat (s,ALLOC_SLOWPATH ); do { - object = page->freelist; - counters = page->counters; + object = c->page->freelist; + counters = c->page->counters; new.counters = counters; VM_BUG_ON(!new.frozen);
@@ -2090,12 +2123,12 @@ static void *__slab_alloc(struct kmem_ca* * If there are objects left then we retrieve them * and use them to refill the per cpu queue. -*/ +*/ - new.inuse = page->objects; + new.inuse = c->page->objects; new.frozen = object !=NULL ; - }while (!__cmpxchg_double_slab (s, page, + }while (!__cmpxchg_double_slab (s, c->page, object, counters,NULL , new.counters,"__slab_alloc" ));
@@ -2109,53 +2142,33 @@ static void *__slab_alloc(struct kmem_castat (s,ALLOC_REFILL ); load_freelist: -VM_BUG_ON (!page->frozen); c->freelist =get_freepointer (s, object); c->tid =next_tid (c->tid);local_irq_restore (flags);return object; new_slab: - page =get_partial (s, gfpflags, node, c); -if (page) { -stat (s,ALLOC_FROM_PARTIAL ); - object = c->freelist; + object =get_partial (s, gfpflags, node, c); -if (kmem_cache_debug (s)) - goto debug; - goto load_freelist; - } +if (unlikely (!object)) { - page =new_slab (s, gfpflags, node); + object =new_slab_objects (s, gfpflags, node, &c); -if (page) { - c =__this_cpu_ptr (s->cpu_slab); -if (c->page) -flush_slab (s, c); +if (unlikely (!object)) { +if (!(gfpflags & __GFP_NOWARN) &&printk_ratelimit ()) +slab_out_of_memory (s, gfpflags, node); -/* -* No other reference to the page yet so we can -* muck around with it freely without cmpxchg -*/ - object = page->freelist; - page->freelist =NULL ; - -stat (s,ALLOC_SLAB ); - c->node =page_to_nid (page); - c->page = page; +local_irq_restore (flags); +return NULL ; + } + } -if (kmem_cache_debug (s)) - goto debug; +if (likely (!kmem_cache_debug (s))) goto load_freelist; - } -if (!(gfpflags & __GFP_NOWARN) &&printk_ratelimit ()) -slab_out_of_memory (s, gfpflags, node); -local_irq_restore (flags); -return NULL ; -debug: -if (!object || !alloc_debug_processing (s, page, object, addr)) - goto new_slab; +/* Only entered in the debug case */ +if (!alloc_debug_processing (s, c->page, object, addr)) + goto new_slab;/* Slab failed checks. Next slab needed */ c->freelist =get_freepointer (s, object);deactivate_slab (s, c);
PATCH 6/7 slub: per cpu cache for partial pages
In reply to Christoph LameterAllow filling out the rest of the kmem_cache_cpu cacheline with pointers to partial pages. The partial page list is used in slab_free() to avoid per node lock taking.
In __slab_alloc() we can then take multiple partial pages off the per node partial list in one go reducing node lock pressure.
We can also use the per cpu partial list in slab_alloc() to avoid scanning partial lists for pages with free objects.
The main effect of a per cpu partial list is that the per node list_lock is taken for batches of partial pages instead of individual ones.
Potential future enhancements:
1. The pickup from the partial list could be perhaps be done without disabling interrupts with some work. The free path already puts the page into the per cpu partial list without disabling interrupts.
2. __slab_free() may have some code paths that could use optimization.
Performance:
Before After
./hackbench 100 process 200000
Time: 1953.047 1564.614 ./hackbench 100 process 20000 Time: 207.176 156.940 ./hackbench 100 process 20000 Time: 204.468 156.940 ./hackbench 100 process 20000 Time: 204.879 158.772 ./hackbench 10 process 20000 Time: 20.153 15.853 ./hackbench 10 process 20000 Time: 20.153 15.986 ./hackbench 10 process 20000 Time: 19.363 16.111 ./hackbench 1 process 20000 Time: 2.518 2.307 ./hackbench 1 process 20000 Time: 2.258 2.339 ./hackbench 1 process 20000 Time: 2.864 2.163
--- include/linux/mm_types.h | 14 + include/linux/slub_def.h | 4 mm/slub.c | 339 ++++++++++++++++++++++++++++++++++++++++------- 3 files changed, 309 insertions(+), 48 deletions(-)
include/linux/slub_def.h +4 -0
@@ -36,12 +36,15 @@ enum stat_item {ORDER_FALLBACK ,/* Number of times fallback was necessary */ CMPXCHG_DOUBLE_CPU_FAIL ,/* Failure of this_cpu_cmpxchg_double */ CMPXCHG_DOUBLE_FAIL ,/* Number of times that cmpxchg double did not match */ +CPU_PARTIAL_ALLOC ,/* Used cpu partial on alloc */ +CPU_PARTIAL_FREE ,/* USed cpu partial on free */ NR_SLUB_STAT_ITEMS };struct kmem_cache_cpu {void **freelist;/* Pointer to next available object */ unsigned long tid;/* Globally unique transaction id */ struct page *page;/* The slab from which we are allocating */ +struct page *partial;/* Partially allocated frozen slabs */ int node;/* The node of the page (or -1 for debug) */ #ifdef CONFIG_SLUB_STATS unsigned stat[NR_SLUB_STAT_ITEMS ];
@@ -79,6 +82,7 @@ struct kmem_cache {int size;/* The size of an object including meta data */ int objsize;/* The size of an object without meta data */ int offset;/* Free pointer offset. */ +int cpu_partial;/* Number of per cpu partial pages to keep around */ struct kmem_cache_order_objects oo;/* Allocation and freeing of slabs */
mm/slub.c +292 -47
480 lines not on this page · raw message
include/linux/mm_types.h +13 -1
@@ -79,9 +79,21 @@ struct page { };/* Third double word block */ -struct list_head lru;/* Pageout list, eg. active_list +union { +struct list_head lru;/* Pageout list, eg. active_list * protected by zone->lru_lock ! */ +struct {/* slub per cpu partial pages */ +struct page *next;/* Next partial slab */ +#ifdef CONFIG_64BIT +int pages;/* Nr of partial slabs left */ +int pobjects;/* Approximate # of objects */ +#else +short int pages; +short int pobjects; +#endif + }; + };/* Remainder is not double word aligned */ union {
Re: [slub p4 6/7] slub: per cpu cache for partial pages
mm/slub.c static int kmem_cache_open(struct kmem_c · line 3074
Quoted 6 lines
mm/slub.c +1
-1@@ -2919,7 +3071,34 @@ static int kmem_cache_open(struct kmem_c* The larger the object size is, the more pages we want on the partial * list to avoid pounding the page allocator excessively. */ -set_min_partial (s,ilog2 (s->size)); +set_min_partial (s,ilog2 (s->size) /2 );
Why do we want to make minimum size smaller?
Quoted 16 lines
mm/slub.c +16
-0+ +/* +* cpu_partial determined the maximum number of objects kept in the +* per cpu partial lists of a processor. +* +* Per cpu partial lists mainly contain slabs that just have one +* object freed. If they are used for allocation then they can be +* filled up again with minimal effort. The slab will never hit the +* per node partial lists and therefore no locking will be required. +* +* This setting also determines +* +* A) The number of objects from per cpu partial slabs dumped to the +* per node list when we reach the limit. +* B) The number of objects in partial partial slabs to extract from the +* per node list when we run out of per cpu objects. We only fetch 50%
mm/slub.c static int kmem_cache_open(struct kmem_c · line 3100
Quoted 10 lines
mm/slub.c +10
-0+* to keep some capacity around for frees. +*/ +if (s->size >=PAGE_SIZE ) + s->cpu_partial =2 ; +else if (s->size >=1024 ) + s->cpu_partial =6 ; +else if (s->size >=256 ) + s->cpu_partial =13 ; +else + s->cpu_partial =30 ;
How did you come up with these limits?
Quoted 14 lines
Index:
linux-2.6/include/linux/mm_types.h
===================================================================include/linux/mm_types.h +3
-1@@ -79,9 +79,21 @@ struct page { };/* Third double word block */ -struct list_head lru;/* Pageout list, eg. active_list +union { +struct list_head lru;/* Pageout list, eg. active_list * protected by zone->lru_lock ! */ +struct {/* slub per cpu partial pages */
include/linux/mm_types.h struct page { · line 96
Quoted 10 lines
include/linux/mm_types.h +10
-0+struct page *next;/* Next partial slab */ +#ifdef CONFIG_64BIT +int pages;/* Nr of partial slabs left */ +int pobjects;/* Approximate # of objects */ +#else +short int pages; +short int pobjects; +#endif + }; + };
Why are the sizes different on 32-bit and 64-bit? Does this change 'struct page' size?
Re: [slub p4 6/7] slub: per cpu cache for partial pages
Quoted 9 lines · Pekka Enberg
mm/slub.c static int kmem_cache_open(struct kmem_c · line 3074
Quoted 7 lines
(quoted diff) +0
-0@@ -2919,7 +3071,34 @@ static int kmem_cache_open(struct kmem_c * The larger the object size is, the more pages we want on thepartial
mm/slub.c +1
-1* list to avoid pounding the page allocator excessively. */ -set_min_partial (s,ilog2 (s->size)); +set_min_partial (s,ilog2 (s->size) /2 );Why do we want to make minimum size smaller?
Because we are getting additional partial pages cached for each processor.
Quoted 11 lines
mm/slub.c static int kmem_cache_open(struct kmem_c · line 3100
Quoted 9 lines
mm/slub.c +9
-0+*/ +if (s->size >=PAGE_SIZE ) + s->cpu_partial =2 ; +else if (s->size >=1024 ) + s->cpu_partial =6 ; +else if (s->size >=256 ) + s->cpu_partial =13 ; +else + s->cpu_partial =30 ;How did you come up with these limits?
These are the per cpu queue limits of SLAB.
Quoted 6 lines
Quoted 6 lines
include/linux/mm_types.h +6
-0+struct {/* slub per cpu partial pages */ +struct page *next;/* Next partial slab */ +#ifdef CONFIG_64BIT +int pages;/* Nr of partial slabs left */ +int pobjects;/* Approximate # of objects */ +#else
Quoted 8 lines
include/linux/mm_types.h struct page { · line 96
Quoted 5 lines
include/linux/mm_types.h +5
-0+short int pages; +short int pobjects; +#endif + }; + };Why are the sizes different on 32-bit and 64-bit? Does this change 'struct page' size?
int == long /2 under 64 bit
int == long on 32 bit.
without the ifdef the page struct could get bigger for 32 bit.
A message that is not in the archive (sent off-list or not yet received): CAF1ivSaH9fh6_QvuBkLc5t=zC4mPEAD5ZzsxOuPruDwG9MiZzw@mail.gmail.com
Re: [slub p4 6/7] slub: per cpu cache for partial pages
Quoted 10 lines · Christoph Lameter
Allow filling out the rest of the
kmem_cache_cpucacheline with pointers to partial pages. The partial page list is used inslab_free()to avoid per node lock taking.In
__slab_alloc()we can then take multiple partial pages off the per node partial list in one go reducing node lock pressure.We can also use the per cpu partial list in
slab_alloc()to avoid scanning partial lists for pages with free objects.
Quoted 8 lines
The main effect of a per cpu partial list is that the per node
list_lockis taken for batches of partial pages instead of individual ones.Potential future enhancements:
1. The pickup from the partial list could be perhaps be done without disabling interrupts with some work. The free path already puts the page into the per cpu partial list without disabling interrupts.
Nice patches!
Could you share possible ways for this potential enhancement?
Thanks,
Lin Ming
Quoted 2 lines
2.
__slab_free()may have some code paths that could use optimization.
Re: [slub p4 6/7] slub: per cpu cache for partial pages
Quoted 9 lines · Lin Ming
Quoted 5 lines
Potential future enhancements:
1. The pickup from the partial list could be perhaps be done without disabling interrupts with some work. The free path already puts the page into the per cpu partial list without disabling interrupts.
Nice patches!
Could you share possible ways for this potential enhancement?
In order to avoid disabling interrupts in the allocation paths the state that has to be kept in kmem_cache_cpu needs to be minimized so that it can be swapped atomically using a this_cpu_cmpxchg. This means getting rid of the node and slab fields I guess. Working on some patches to that effect.
Once that is done one can with a this_cpu_cmpxchg_double take over the per cpu slab and then use that information to update the slab page etc.
PATCH 7/7 slub: update slabinfo tools to report per cpu partial list statistics
In reply to Christoph LameterUpdate the slabinfo tool to report the stats on per cpu partial list usage.
--- tools/slub/slabinfo.c | 8 ++++++++ 1 file changed, 8 insertions(+)
tools/slub/slabinfo.c +8 -0
@@ -42,6 +42,7 @@ struct slabinfo {unsigned long deactivate_remote_frees, order_fallback;unsigned long cmpxchg_double_cpu_fail, cmpxchg_double_fail;unsigned long alloc_node_mismatch, deactivate_bypass; +unsigned long cpu_partial_alloc, cpu_partial_free;int numa[MAX_NODES ];int numa_partial[MAX_NODES ]; } slabinfo[MAX_SLABS ];
@@ -455,6 +456,11 @@ static void slab_stats(struct slabinfo * s->alloc_from_partial *100 / total_alloc, s->free_remove_partial * 100 / total_free); +printf ("Cpu partial list %8lu %8lu %3lu %3lu\n" , + s->cpu_partial_alloc, s->cpu_partial_free, + s->cpu_partial_alloc *100 / total_alloc, + s->cpu_partial_free *100 / total_free); + printf("RemoteObj/SlabFrozen %8lu %8lu %3lu %3lu\n", s->deactivate_remote_frees, s->free_frozen, s->deactivate_remote_frees * 100 / total_alloc,
@@ -1209,6 +1215,8 @@ static void read_slab_dir(void) slab->order_fallback =get_obj ("order_fallback" ); slab->cmpxchg_double_cpu_fail =get_obj ("cmpxchg_double_cpu_fail" ); slab->cmpxchg_double_fail =get_obj ("cmpxchg_double_fail" ); + slab->cpu_partial_alloc =get_obj ("cpu_partial_alloc" ); + slab->cpu_partial_free =get_obj ("cpu_partial_free" ); slab->alloc_node_mismatch =get_obj ("alloc_node_mismatch" ); slab->deactivate_bypass =get_obj ("deactivate_bypass" );chdir (".." );
David Rientjes
reviewerQuoted 9 lines · Christoph Lameter
The following patchset introduces per cpu partial lists which allow a performance increase of around ~10-20% with hackbench on my Sandybridge processor.
These lists help to avoid per node locking overhead. Allocator latency could be further reduced by making these operations work without disabling interrupts (like the fastpath and the free slowpath) but that is another project.
Quoted 6 lines
It is interesting to note that BSD has gone to a scheme with partial pages only per cpu (source: Adrian). Transfer of cpu ownerships is done using IPIs. Probably too much overhead for our taste. The approach here keeps the per node partial lists essentially meaning the "pages" in there have no cpu owner.
I'm currently 35,000 feet above Chicago going about 611 mph, so what better time to benchmark this patchset on my netperf testing rack!
threads before after 16 78031 74714 (-4.3%) 32 118269 115810 (-2.1%) 48 150787 150165 (-0.4%) 64 189932 187766 (-1.1%) 80 221189 223682 (+1.1%) 96 239807 246222 (+2.7%) 112 262135 271329 (+3.5%) 128 273612 286782 (+4.8%) 144 280009 293943 (+5.0%) 160 285972 299798 (+4.8%)
I'll review the patchset in detail, especially the cleanups and optimizations, when my wifi isn't so sketchy.
Quoted 33 lines · David Rientjes
Quoted 9 lines · Christoph Lameter
The following patchset introduces per cpu partial lists which allow a performance increase of around ~10-20% with hackbench on my Sandybridge processor.
These lists help to avoid per node locking overhead. Allocator latency could be further reduced by making these operations work without disabling interrupts (like the fastpath and the free slowpath) but that is another project.
Quoted 6 lines
It is interesting to note that BSD has gone to a scheme with partial pages only per cpu (source: Adrian). Transfer of cpu ownerships is done using IPIs. Probably too much overhead for our taste. The approach here keeps the per node partial lists essentially meaning the "pages" in there have no cpu owner.
I'm currently 35,000 feet above Chicago going about 611 mph, so what better time to benchmark this patchset on my netperf testing rack!
threads before after 16 78031 74714 (-4.3%) 32 118269 115810 (-2.1%) 48 150787 150165 (-0.4%) 64 189932 187766 (-1.1%) 80 221189 223682 (+1.1%) 96 239807 246222 (+2.7%) 112 262135 271329 (+3.5%) 128 273612 286782 (+4.8%) 144 280009 293943 (+5.0%) 160 285972 299798 (+4.8%)
Quoted 2 lines
I'll review the patchset in detail, especially the cleanups and optimizations, when my wifi isn't so sketchy.
Andi, it'd be interesting to know your results for v4 of this patchset. I'm hoping to get the patches reviewed and merged to linux-next this week.
Pekka
Quoted 14 lines · David Rientjes
I'm currently 35,000 feet above Chicago going about 611 mph, so what better time to benchmark this patchset on my netperf testing rack!
threads before after 16 78031 74714 (-4.3%) 32 118269 115810 (-2.1%) 48 150787 150165 (-0.4%) 64 189932 187766 (-1.1%) 80 221189 223682 (+1.1%) 96 239807 246222 (+2.7%) 112 262135 271329 (+3.5%) 128 273612 286782 (+4.8%) 144 280009 293943 (+5.0%) 160 285972 299798 (+4.8%)
The higher the contention the better the performance. But the -4% on non contention is worrisome.
Quoted 20 lines · Christoph Lameter
V3->V4: Use a single linked per cpu list instead of a per cpu array.
This results in improvements even for the single threaded case. I think this is ready for more widespread testing (-next?) The number of partial pages per cpu is configurable via /sys/kernel/slab/<name>/cpu_partial
V2->V3: Work on the todo list. Still some work to be done to reduce
code impact and make this all cleaner. (Pekka: patch 1-3 are cleanup patches of general usefulness. You got #1 already 2+3 could be picked up w/o any issue).The following patchset introduces per cpu partial lists which allow a performance increase of around ~10-20% with hackbench on my Sandybridge processor.
These lists help to avoid per node locking overhead. Allocator latency could be further reduced by making these operations work without disabling interrupts (like the fastpath and the free slowpath) but that is another project.
Quoted 5 lines
It is interesting to note that BSD has gone to a scheme with partial pages only per cpu (source: Adrian). Transfer of cpu ownerships is done using IPIs. Probably too much overhead for our taste. The approach here keeps the per node partial lists essentially meaning the "pages" in there have no cpu owner.
These patches are now in slub/partial branch of slab.git. I'll probably queue them for linux-next early next week if they don't explode on my machine.
Pekka