diff for duplicates of <1490374331.2733.130.camel@linux.intel.com> diff --git a/a/1.txt b/N1/1.txt index b1f0181..caffd79 100644 --- a/a/1.txt +++ b/N1/1.txt @@ -11,23 +11,17 @@ On Fri, 2017-03-24 at 06:56 -0700, Dave Hansen wrote: > > But, Ying is right. > -> Let's say we have a two-page data structure.A A vmalloc() takes two +> Let's say we have a two-page data structure. vmalloc() takes two > effectively random order-0 pages, probably from two different 2M pages -> and pins them.A A That "kills" two 2M pages. +> and pins them. That "kills" two 2M pages. > > kmalloc(), allocating two *contiguous* pages, is very unlikely to cross -> a 2M boundary (it theoretically could).A A That means it will only "kill" -> the possibility of a single 2M page.A A More 2M pages == less fragmentation. +> a 2M boundary (it theoretically could). That means it will only "kill" +> the possibility of a single 2M page. More 2M pages == less fragmentation. In vmalloc, it eventually calls __vmalloc_area_node that allocates the -page one at a time. A There's no attempt there to make the pages contiguous -if I am reading the code correctly. A So that will increase the memory -fragmentation as we will be piecing together pages from all over the places. A +page one at a time. There's no attempt there to make the pages contiguous +if I am reading the code correctly. So that will increase the memory +fragmentation as we will be piecing together pages from all over the places. -Tim A - --- -To unsubscribe, send a message with 'unsubscribe linux-mm' in -the body to majordomo@kvack.org. For more info on Linux MM, -see: http://www.linux-mm.org/ . -Don't email: <a href=mailto:"dont@kvack.org"> email@kvack.org </a> +Tim diff --git a/a/content_digest b/N1/content_digest index 6da4349..73e7947 100644 --- a/a/content_digest +++ b/N1/content_digest @@ -44,25 +44,19 @@ "> \n" "> But, Ying is right.\n" "> \n" - "> Let's say we have a two-page data structure.A A vmalloc() takes two\n" + "> Let's say we have a two-page data structure.\302\240\302\240vmalloc() takes two\n" "> effectively random order-0 pages, probably from two different 2M pages\n" - "> and pins them.A A That \"kills\" two 2M pages.\n" + "> and pins them.\302\240\302\240That \"kills\" two 2M pages.\n" "> \n" "> kmalloc(), allocating two *contiguous* pages, is very unlikely to cross\n" - "> a 2M boundary (it theoretically could).A A That means it will only \"kill\"\n" - "> the possibility of a single 2M page.A A More 2M pages == less fragmentation.\n" + "> a 2M boundary (it theoretically could).\302\240\302\240That means it will only \"kill\"\n" + "> the possibility of a single 2M page.\302\240\302\240More 2M pages == less fragmentation.\n" "\n" "In vmalloc, it eventually calls __vmalloc_area_node that allocates the\n" - "page one at a time. A There's no attempt there to make the pages contiguous\n" - "if I am reading the code correctly. A So that will increase the memory\n" - "fragmentation as we will be piecing together pages from all over the places. A \n" + "page one at a time. \302\240There's no attempt there to make the pages contiguous\n" + "if I am reading the code correctly. \302\240So that will increase the memory\n" + "fragmentation as we will be piecing together pages from all over the places. \302\240\n" "\n" - "Tim A \n" - "\n" - "--\n" - "To unsubscribe, send a message with 'unsubscribe linux-mm' in\n" - "the body to majordomo@kvack.org. For more info on Linux MM,\n" - "see: http://www.linux-mm.org/ .\n" - "Don't email: <a href=mailto:\"dont@kvack.org\"> email@kvack.org </a>" + Tim -cfc111331be7dc4ab9b62051f8b21a111875cd72bbee939b1a67fc7a5715b18f +28e900c7008ac6c44df0af38117e68572cd87d929d1d484f9b81345577294dfa
This is an external index of several public inboxes, see mirroring instructions on how to clone and mirror all data and code used by this external index.