brain-hackers_pepepper-mirror/linux-brain
1
0
Fork 0
mirror of https://github.com/brain-hackers/linux-brain.git synced 2024-06-09 07:16:21 +09:00
Code Issues Projects Releases Wiki Activity

slub: Code optimization in get_partial_node()

Browse Source 
I find a way to reduce a variable in get_partial_node(). That is also helpful
for code understanding.

Acked-by: Christoph Lameter <cl@linux.com>
Signed-off-by: Alex Shi <alex.shi@intel.com>
Signed-off-by: Pekka Enberg <penberg@kernel.org>
This commit is contained in:
Alex,Shi 2011-09-07 10:26:36 +08:00 committed by Pekka Enberg
parent aca726a07a
commit 12d79634f8
1 changed files with 2 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
mm/slub.c
View File

@ -1600,7 +1600,6 @@ static void *get_partial_node(struct kmem_cache *s,
{
struct page *page, *page2;
void *object = NULL;
int count = 0;
/*
* Racy check. If we mistakenly see no partial slabs then we
@ -1613,17 +1612,16 @@ static void *get_partial_node(struct kmem_cache *s,
spin_lock(&n->list_lock);
list_for_each_entry_safe(page, page2, &n->partial, lru) {
void *t = acquire_slab(s, n, page, count == 0);
void *t = acquire_slab(s, n, page, object == NULL);
int available;
if (!t)
break;
if (!count) {
if (!object) {
c->page = page;
c->node = page_to_nid(page);
stat(s, ALLOC_FROM_PARTIAL);
count++;
object = t;
available = page->objects - page->inuse;
} else {