|
@@ -1743,52 +1743,11 @@ int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
|
|
|
memcg->last_scanned_node = node;
|
|
|
return node;
|
|
|
}
|
|
|
-
|
|
|
-/*
|
|
|
- * Check all nodes whether it contains reclaimable pages or not.
|
|
|
- * For quick scan, we make use of scan_nodes. This will allow us to skip
|
|
|
- * unused nodes. But scan_nodes is lazily updated and may not cotain
|
|
|
- * enough new information. We need to do double check.
|
|
|
- */
|
|
|
-static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
|
|
|
-{
|
|
|
- int nid;
|
|
|
-
|
|
|
- /*
|
|
|
- * quick check...making use of scan_node.
|
|
|
- * We can skip unused nodes.
|
|
|
- */
|
|
|
- if (!nodes_empty(memcg->scan_nodes)) {
|
|
|
- for (nid = first_node(memcg->scan_nodes);
|
|
|
- nid < MAX_NUMNODES;
|
|
|
- nid = next_node(nid, memcg->scan_nodes)) {
|
|
|
-
|
|
|
- if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
|
|
|
- return true;
|
|
|
- }
|
|
|
- }
|
|
|
- /*
|
|
|
- * Check rest of nodes.
|
|
|
- */
|
|
|
- for_each_node_state(nid, N_MEMORY) {
|
|
|
- if (node_isset(nid, memcg->scan_nodes))
|
|
|
- continue;
|
|
|
- if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
|
|
|
- return true;
|
|
|
- }
|
|
|
- return false;
|
|
|
-}
|
|
|
-
|
|
|
#else
|
|
|
int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
|
|
|
{
|
|
|
return 0;
|
|
|
}
|
|
|
-
|
|
|
-static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
|
|
|
-{
|
|
|
- return test_mem_cgroup_node_reclaimable(memcg, 0, noswap);
|
|
|
-}
|
|
|
#endif
|
|
|
|
|
|
static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg,
|
|
@@ -1832,8 +1791,6 @@ static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg,
|
|
|
}
|
|
|
continue;
|
|
|
}
|
|
|
- if (!mem_cgroup_reclaimable(victim, false))
|
|
|
- continue;
|
|
|
total += mem_cgroup_shrink_node_zone(victim, gfp_mask, false,
|
|
|
zone, &nr_scanned);
|
|
|
*total_scanned += nr_scanned;
|