On 08/16/2016 08:41 AM, Joonsoo Kim wrote:
>> free pages for probability of compaction success, so I don't think
>> it's worth complicating the compact_gap() formula.
>
> I agree that it's not worth complicating the compact_gap() formula but
> it would be better to fix the comment?
OK, Andrew can
On Tue, Aug 16, 2016 at 08:15:36AM +0200, Vlastimil Babka wrote:
> On 08/16/2016 08:15 AM, Joonsoo Kim wrote:
> >On Wed, Aug 10, 2016 at 11:12:23AM +0200, Vlastimil Babka wrote:
> >>--- a/include/linux/compaction.h
> >>+++ b/include/linux/compaction.h
> >>@@ -58,6 +58,22 @@ enum compact_result {
>
On 08/16/2016 08:15 AM, Joonsoo Kim wrote:
On Wed, Aug 10, 2016 at 11:12:23AM +0200, Vlastimil Babka wrote:
--- a/include/linux/compaction.h
+++ b/include/linux/compaction.h
@@ -58,6 +58,22 @@ enum compact_result {
struct alloc_context; /* in mm/internal.h */
+/*
+ * Number of free order-0 pa
On Wed, Aug 10, 2016 at 11:12:23AM +0200, Vlastimil Babka wrote:
> Compaction uses a watermark gap of (2UL << order) pages at various places and
> it's not immediately obvious why. Abstract it through a compact_gap() wrapper
> to create a single place with a thorough explanation.
>
> Signed-off-by
Compaction uses a watermark gap of (2UL << order) pages at various places and
it's not immediately obvious why. Abstract it through a compact_gap() wrapper
to create a single place with a thorough explanation.
Signed-off-by: Vlastimil Babka
Acked-by: Michal Hocko
---
include/linux/compaction.h
5 matches
Mail list logo