mm, memcg: memory.{low,min} reclaim fix & cleanup
Subsystems (5)
v4 cover mm, memcg: memory.{low,min} reclaim fix & cleanup
This series contains a fix for a edge case in my earlier protection calculation patches, and a patch to make the area overall a little more robust to hopefully help avoid this in future.
Changes in v4:
- Fix premature OOM when checking protection on root memcg. Thanks Naresh and Michal for helping debug.
Chris Down (1):
mm, memcg: Decouple e{low,min} state mutations from protection checks
Yafang Shao (1):
mm, memcg: Avoid stale protection values when cgroup is above
protection
include/linux/memcontrol.h | 95 ++++++++++++++++++++++++++++++++------ mm/memcontrol.c | 36 ++++++--------- mm/vmscan.c | 20 +++----- 3 files changed, 103 insertions(+), 48 deletions(-)
Signature · 1 line
2.27.0
PATCH v4 1/2 mm, memcg: Avoid stale protection values when cgroup is above protection
From: Yafang Shao <[email protected]>
A cgroup can have both memory protection and a memory limit to isolate it from its siblings in both directions - for example, to prevent it from being shrunk below 2G under high pressure from outside, but also from growing beyond 4G under low pressure.
Commit 9783aa9917f8 ("mm, memcg: proportional memory.{low,min} reclaim") implemented proportional scan pressure so that multiple siblings in excess of their protection settings don't get reclaimed equally but instead in accordance to their unprotected portion.
During limit reclaim, this proportionality shouldn't apply of course:
there is no competition, all pressure is from within the cgroup and should be applied as such. Reclaim should operate at full efficiency.
However, mem_cgroup_protected() never expected anybody to look at the effective protection values when it indicated that the cgroup is above its protection. As a result, a query during limit reclaim may return stale protection values that were calculated by a previous reclaim cycle in which the cgroup did have siblings.
When this happens, reclaim is unnecessarily hesitant and potentially slow to meet the desired limit. In theory this could lead to premature OOM kills, although it's not obvious this has occurred in practice.
Workaround the problem by special casing reclaim roots in mem_cgroup_protection. These memcgs are never participating in the reclaim protection because the reclaim is internal.
We have to ignore effective protection values for reclaim roots because mem_cgroup_protected might be called from racing reclaim contexts with different roots. Calculation is relying on root -> leaf tree traversal therefore top-down reclaim protection invariants should hold. The only exception is the reclaim root which should have effective protection set to 0 but that would be problematic for the following setup:
Let's have global and A's reclaim in parallel:
|
A (low=2G, usage = 3G, max = 3G, children_low_usage = 1.5G) |\
| C (low = 1G, usage = 2.5G)
B (low = 1G, usage = 0.5G)
for A reclaim we have
B.elow = B.low
C.elow = C.low
For the global reclaim
A.elow = A.low
B.elow = min(B.usage, B.low) because children_low_usage <= A.elow C.elow = min(C.usage, C.low)
With the effective values resetting we have A reclaim A.elow = 0
B.elow = B.low
C.elow = C.low
and global reclaim could see the above and then B.elow = C.elow = 0 because children_low_usage > A.elow
Which means that protected memcgs would get reclaimed.
In future we would like to make mem_cgroup_protected more robust against racing reclaim contexts but that is likely more complex solution than this simple workaround.
--- include/linux/memcontrol.h | 42 ++++++++++++++++++++++++++++++++++++-- mm/memcontrol.c | 8 ++++++++ mm/vmscan.c | 3 ++- 3 files changed, 50 insertions(+), 3 deletions(-)
include/linux/memcontrol.h +40 -2
@@ -363,12 +363,49 @@ static inline bool mem_cgroup_disabled(void)return !cgroup_subsys_enabled (memory_cgrp_subsys); } -static inline unsigned long mem_cgroup_protection (struct mem_cgroup *memcg, +static inline unsigned long mem_cgroup_protection (struct mem_cgroup *root, +struct mem_cgroup *memcg,bool in_low_reclaim) {if (mem_cgroup_disabled ())return 0 ; +/* +* There is no reclaim protection applied to a targeted reclaim. +* We are special casing this specific case here because +* mem_cgroup_protected calculation is not robust enough to keep +* the protection invariant for calculated effective values for +* parallel reclaimers with different reclaim target. This is +* especially a problem for tail memcgs (as they have pages on LRU) +* which would want to have effective values 0 for targeted reclaim +* but a different value for external reclaim. +* +* Example +* Let's have global and A's reclaim in parallel: +* | +* A (low=2G, usage = 3G, max = 3G, children_low_usage = 1.5G) +* |\ +* | C (low = 1G, usage = 2.5G) +* B (low = 1G, usage = 0.5G) +* +* For the global reclaim +* A.elow = A.low +* B.elow = min(B.usage, B.low) because children_low_usage <= A.elow +* C.elow = min(C.usage, C.low) +* +* With the effective values resetting we have A reclaim +* A.elow = 0 +* B.elow = B.low +* C.elow = C.low +* +* If the global reclaim races with A's reclaim then +* B.elow = C.elow = 0 because children_low_usage > A.elow) +* is possible and reclaiming B would be violating the protection. +* +*/ +if (root == memcg) +return 0 ; +if (in_low_reclaim)return READ_ONCE (memcg->memory.emin);
@@ -899,7 +936,8 @@ static inline void memcg_memory_event_mm(struct mm_struct *mm, { } -static inline unsigned long mem_cgroup_protection (struct mem_cgroup *memcg, +static inline unsigned long mem_cgroup_protection (struct mem_cgroup *root, +struct mem_cgroup *memcg,bool in_low_reclaim) {return 0 ;
mm/memcontrol.c +8 -0
@@ -6566,6 +6566,14 @@ enum mem_cgroup_protection mem_cgroup_protected(struct mem_cgroup *root,if (!root) root = root_mem_cgroup; + +/* +* Effective values of the reclaim targets are ignored so they +* can be stale. Have a look at mem_cgroup_protection for more +* details. +* TODO: calculation should be more robust so that we do not need +* that special casing. +*/ if (memcg == root)return MEMCG_PROT_NONE ;
mm/vmscan.c +2 -1
@@ -2326,7 +2326,8 @@ static void get_scan_count(struct lruvec *lruvec, struct scan_control *sc,unsigned long protection; lruvec_size =lruvec_lru_size (lruvec, lru, sc->reclaim_idx); - protection =mem_cgroup_protection (memcg, + protection =mem_cgroup_protection (sc->target_mem_cgroup, + memcg, sc->memcg_low_reclaim);if (protection) {
Signature · 1 line
2.27.0
PATCH v4 2/2 mm, memcg: Decouple e{low,min} state mutations from protection checks
In reply to Chris Downmem_cgroup_protected currently is both used to set effective low and min and return a mem_cgroup_protection based on the result. As a user, this can be a little unexpected: it appears to be a simple predicate function, if not for the big warning in the comment above about the order in which it must be executed.
This change makes it so that we separate the state mutations from the actual protection checks, which makes it more obvious where we need to be careful mutating internal state, and where we are simply checking and don't need to worry about that.
--- include/linux/memcontrol.h | 53 ++++++++++++++++++++++++++++++-------- mm/memcontrol.c | 28 +++++--------------- mm/vmscan.c | 17 +++--------- 3 files changed, 53 insertions(+), 45 deletions(-)
include/linux/memcontrol.h +42 -11
@@ -55,12 +55,6 @@ enum memcg_memory_event { MEMCG_NR_MEMORY_EVENTS, }; -enum mem_cgroup_protection { -MEMCG_PROT_NONE , -MEMCG_PROT_LOW , -MEMCG_PROT_MIN , -}; -struct mem_cgroup_reclaim_cookie {pg_data_t *pgdat;unsigned int generation;
@@ -413,8 +407,36 @@ static inline unsigned long mem_cgroup_protection(struct mem_cgroup *root, READ_ONCE(memcg->memory.elow)); } -enum mem_cgroup_protection mem_cgroup_protected (struct mem_cgroup *root, -struct mem_cgroup *memcg); +void mem_cgroup_calculate_protection (struct mem_cgroup *root, +struct mem_cgroup *memcg); + +static inline bool mem_cgroup_supports_protection (struct mem_cgroup *memcg) +{ +/* +* The root memcg doesn't account charges, and doesn't support +* protection. +*/ +return !mem_cgroup_disabled () && !mem_cgroup_is_root (memcg); + +} + +static inline bool mem_cgroup_below_low (struct mem_cgroup *memcg) +{ +if (!mem_cgroup_supports_protection (memcg)) +return false; + +return READ_ONCE (memcg->memory.elow) >= +page_counter_read (&memcg->memory); +} + +static inline bool mem_cgroup_below_min (struct mem_cgroup *memcg) +{ +if (!mem_cgroup_supports_protection (memcg)) +return false; + +return READ_ONCE (memcg->memory.emin) >= +page_counter_read (&memcg->memory); +}int mem_cgroup_charge (struct page *page,struct mm_struct *mm,gfp_t gfp_mask);
@@ -943,10 +965,19 @@ static inline unsigned long mem_cgroup_protection(struct mem_cgroup *root,return 0 ; } -static inline enum mem_cgroup_protection mem_cgroup_protected ( -struct mem_cgroup *root,struct mem_cgroup *memcg) +static inline void mem_cgroup_calculate_protection (struct mem_cgroup *root, +struct mem_cgroup *memcg) { -return MEMCG_PROT_NONE ; +} + +static inline bool mem_cgroup_below_low (struct mem_cgroup *memcg) +{ +return false; +} + +static inline bool mem_cgroup_below_min (struct mem_cgroup *memcg) +{ +return false; } static inline int mem_cgroup_charge(struct page *page, struct mm_struct *mm,
mm/memcontrol.c +7 -21
@@ -6548,21 +6548,15 @@ static unsigned long effective_protection(unsigned long usage,* * WARNING: This function is not stateless! It can only be used as part * of a top-down tree iteration, not for isolated queries. -* -* Returns one of the following: -* MEMCG_PROT_NONE: cgroup memory is not protected -* MEMCG_PROT_LOW: cgroup memory is protected as long there is -* an unprotected supply of reclaimable memory from other cgroups. -* MEMCG_PROT_MIN: cgroup memory is protected */ -enum mem_cgroup_protection mem_cgroup_protected (struct mem_cgroup *root, -struct mem_cgroup *memcg) +void mem_cgroup_calculate_protection (struct mem_cgroup *root, +struct mem_cgroup *memcg) {unsigned long usage, parent_usage;struct mem_cgroup *parent;if (mem_cgroup_disabled ()) -return MEMCG_PROT_NONE ; +return ;if (!root) root = root_mem_cgroup;
@@ -6575,21 +6569,21 @@ enum mem_cgroup_protection mem_cgroup_protected(struct mem_cgroup *root,* that special casing. */ if (memcg == root) -return MEMCG_PROT_NONE ; +return ; usage =page_counter_read (&memcg->memory);if (!usage) -return MEMCG_PROT_NONE ; +return ; parent =parent_mem_cgroup (memcg);/* No parent means a non-hierarchical mode on v1 memcg */ if (!parent) -return MEMCG_PROT_NONE ; +return ;if (parent == root) { memcg->memory.emin =READ_ONCE (memcg->memory.min); memcg->memory.elow =READ_ONCE (memcg->memory.low); - goto out; +return ; } parent_usage =page_counter_read (&parent->memory);
@@ -6603,14 +6597,6 @@ enum mem_cgroup_protection mem_cgroup_protected(struct mem_cgroup *root,READ_ONCE (memcg->memory.low),READ_ONCE (parent->memory.elow), atomic_long_read(&parent->memory.children_low_usage))); - -out: -if (usage <= memcg->memory.emin) -return MEMCG_PROT_MIN ; -else if (usage <= memcg->memory.elow) -return MEMCG_PROT_LOW ; -else -return MEMCG_PROT_NONE ; }/**
mm/vmscan.c +4 -13
@@ -2615,14 +2615,15 @@ static void shrink_node_memcgs(pg_data_t *pgdat, struct scan_control *sc)unsigned long reclaimed;unsigned long scanned; -switch (mem_cgroup_protected (target_memcg, memcg)) { -case MEMCG_PROT_MIN : +mem_cgroup_calculate_protection (target_memcg, memcg); + +if (mem_cgroup_below_min (memcg)) {/* * Hard protection. * If there is no reclaimable memory, OOM. */ continue ; -case MEMCG_PROT_LOW : + }else if (mem_cgroup_below_low (memcg)) {/* * Soft protection. * Respect the protection only as long as
@@ -2634,16 +2635,6 @@ static void shrink_node_memcgs(pg_data_t *pgdat, struct scan_control *sc)continue ; }memcg_memory_event (memcg,MEMCG_LOW ); -break ; -case MEMCG_PROT_NONE : -/* -* All protection thresholds breached. We may -* still choose to vary the scan pressure -* applied based on by how much the cgroup in -* question has exceeded its protection -* thresholds (see get_scan_count). -*/ -break ; } reclaimed = sc->nr_reclaimed;
Signature · 1 line
2.27.0