mm/bootmem.c: cleanup on addition to bootmem data list
The objects of "struct bootmem_data_t" are linked together to form double-linked list sequentially based on its minimal page frame number. The current implementation implicitly supports the following cases, which means the inserting point for current bootmem data depends on how "list_for_each" works. That makes the code a little hard to read. Besides, "list_for_each" and "list_entry" can be replaced with "list_for_each_entry". - The linked list is empty. - There has no entry in the linked list, whose minimal page frame number is bigger than current one. Signed-off-by: Gavin Shan <shangw@linux.vnet.ibm.com> Acked-by: Johannes Weiner <hannes@cmpxchg.org> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
parent
e48982734e
commit
5c2b8a162b
1 changed files with 8 additions and 8 deletions
16
mm/bootmem.c
16
mm/bootmem.c
|
@ -77,16 +77,16 @@ unsigned long __init bootmem_bootmap_pages(unsigned long pages)
|
|||
*/
|
||||
static void __init link_bootmem(bootmem_data_t *bdata)
|
||||
{
|
||||
struct list_head *iter;
|
||||
bootmem_data_t *ent;
|
||||
|
||||
list_for_each(iter, &bdata_list) {
|
||||
bootmem_data_t *ent;
|
||||
|
||||
ent = list_entry(iter, bootmem_data_t, list);
|
||||
if (bdata->node_min_pfn < ent->node_min_pfn)
|
||||
break;
|
||||
list_for_each_entry(ent, &bdata_list, list) {
|
||||
if (bdata->node_min_pfn < ent->node_min_pfn) {
|
||||
list_add_tail(&bdata->list, &ent->list);
|
||||
return;
|
||||
}
|
||||
}
|
||||
list_add_tail(&bdata->list, iter);
|
||||
|
||||
list_add_tail(&bdata->list, &bdata_list);
|
||||
}
|
||||
|
||||
/*
|
||||
|
|
Loading…
Reference in a new issue