Blame view
mm/memcontrol.c
142 KB
8cdea7c05 Memory controller... |
1 2 3 4 5 |
/* memcontrol.c - Memory Controller * * Copyright IBM Corporation, 2007 * Author Balbir Singh <balbir@linux.vnet.ibm.com> * |
78fb74669 Memory controller... |
6 7 8 |
* Copyright 2007 OpenVZ SWsoft Inc * Author: Pavel Emelianov <xemul@openvz.org> * |
2e72b6347 memcg: implement ... |
9 10 11 12 |
* Memory thresholds * Copyright (C) 2009 Nokia Corporation * Author: Kirill A. Shutemov * |
8cdea7c05 Memory controller... |
13 14 15 16 17 18 19 20 21 22 23 24 25 26 |
* This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. */ #include <linux/res_counter.h> #include <linux/memcontrol.h> #include <linux/cgroup.h> |
78fb74669 Memory controller... |
27 |
#include <linux/mm.h> |
4ffef5fef memcg: move charg... |
28 |
#include <linux/hugetlb.h> |
d13d14430 memcg: handle swa... |
29 |
#include <linux/pagemap.h> |
d52aa412d memory cgroup enh... |
30 |
#include <linux/smp.h> |
8a9f3ccd2 Memory controller... |
31 |
#include <linux/page-flags.h> |
66e1707bc Memory controller... |
32 |
#include <linux/backing-dev.h> |
8a9f3ccd2 Memory controller... |
33 34 |
#include <linux/bit_spinlock.h> #include <linux/rcupdate.h> |
e222432bf memcg: show memcg... |
35 |
#include <linux/limits.h> |
b9e15bafd mm: Add export.h ... |
36 |
#include <linux/export.h> |
8c7c6e34a memcg: mem+swap c... |
37 |
#include <linux/mutex.h> |
f64c3f549 memory controller... |
38 |
#include <linux/rbtree.h> |
b6ac57d50 memcgroup: move m... |
39 |
#include <linux/slab.h> |
66e1707bc Memory controller... |
40 |
#include <linux/swap.h> |
024914477 memcg: move charg... |
41 |
#include <linux/swapops.h> |
66e1707bc Memory controller... |
42 |
#include <linux/spinlock.h> |
2e72b6347 memcg: implement ... |
43 44 |
#include <linux/eventfd.h> #include <linux/sort.h> |
66e1707bc Memory controller... |
45 |
#include <linux/fs.h> |
d2ceb9b7d memory cgroup enh... |
46 |
#include <linux/seq_file.h> |
333279487 memcgroup: use vm... |
47 |
#include <linux/vmalloc.h> |
b69408e88 vmscan: Use an in... |
48 |
#include <linux/mm_inline.h> |
52d4b9ac0 memcg: allocate a... |
49 |
#include <linux/page_cgroup.h> |
cdec2e426 memcg: coalesce c... |
50 |
#include <linux/cpu.h> |
158e0a2d1 memcg: use find_l... |
51 |
#include <linux/oom.h> |
08e552c69 memcg: synchroniz... |
52 |
#include "internal.h" |
8cdea7c05 Memory controller... |
53 |
|
8697d3319 Memory controller... |
54 |
#include <asm/uaccess.h> |
cc8e970c3 memcg: add mm_vms... |
55 |
#include <trace/events/vmscan.h> |
a181b0e88 memcg: make globa... |
56 |
struct cgroup_subsys mem_cgroup_subsys __read_mostly; |
a181b0e88 memcg: make globa... |
57 |
#define MEM_CGROUP_RECLAIM_RETRIES 5 |
4b3bde4c9 memcg: remove the... |
58 |
struct mem_cgroup *root_mem_cgroup __read_mostly; |
8cdea7c05 Memory controller... |
59 |
|
c077719be memcg: mem+swap c... |
60 |
#ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP |
338c84310 memcg: remove som... |
61 |
/* Turned on only when memory cgroup is enabled && really_do_swap_account = 1 */ |
c077719be memcg: mem+swap c... |
62 |
int do_swap_account __read_mostly; |
a42c390cf cgroups: make swa... |
63 64 65 66 67 68 69 |
/* for remember boot option*/ #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP_ENABLED static int really_do_swap_account __initdata = 1; #else static int really_do_swap_account __initdata = 0; #endif |
c077719be memcg: mem+swap c... |
70 71 72 |
#else #define do_swap_account (0) #endif |
8cdea7c05 Memory controller... |
73 |
/* |
d52aa412d memory cgroup enh... |
74 75 76 77 78 79 80 |
* Statistics for memory cgroup. */ enum mem_cgroup_stat_index { /* * For MEM_CONTAINER_TYPE_ALL, usage = pagecache + rss. */ MEM_CGROUP_STAT_CACHE, /* # of pages charged as cache */ |
d69b042f3 memcg: add file-b... |
81 |
MEM_CGROUP_STAT_RSS, /* # of pages charged as anon rss */ |
d8046582d memcg: make memcg... |
82 |
MEM_CGROUP_STAT_FILE_MAPPED, /* # of pages charged as file rss */ |
0c3e73e84 memcg: improve re... |
83 |
MEM_CGROUP_STAT_SWAPOUT, /* # of pages, swapped out */ |
711d3d2c9 memcg: cpu hotplu... |
84 |
MEM_CGROUP_STAT_DATA, /* end of data requires synchronization */ |
32047e2a8 memcg: avoid lock... |
85 |
MEM_CGROUP_ON_MOVE, /* someone is moving account between groups */ |
d52aa412d memory cgroup enh... |
86 87 |
MEM_CGROUP_STAT_NSTATS, }; |
e9f8974f2 memcg: break out ... |
88 89 90 91 |
enum mem_cgroup_events_index { MEM_CGROUP_EVENTS_PGPGIN, /* # of pages paged in */ MEM_CGROUP_EVENTS_PGPGOUT, /* # of pages paged out */ MEM_CGROUP_EVENTS_COUNT, /* # of pages paged in/out */ |
456f998ec memcg: add the pa... |
92 93 |
MEM_CGROUP_EVENTS_PGFAULT, /* # of page-faults */ MEM_CGROUP_EVENTS_PGMAJFAULT, /* # of major page-faults */ |
e9f8974f2 memcg: break out ... |
94 95 |
MEM_CGROUP_EVENTS_NSTATS, }; |
7a159cc9d memcg: use native... |
96 97 98 99 100 101 102 103 104 |
/* * Per memcg event counter is incremented at every pagein/pageout. With THP, * it will be incremated by the number of pages. This counter is used for * for trigger some periodic events. This is straightforward and better * than using jiffies etc. to handle periodic memcg event. */ enum mem_cgroup_events_target { MEM_CGROUP_TARGET_THRESH, MEM_CGROUP_TARGET_SOFTLIMIT, |
453a9bf34 memcg: fix numa s... |
105 |
MEM_CGROUP_TARGET_NUMAINFO, |
7a159cc9d memcg: use native... |
106 107 108 109 |
MEM_CGROUP_NTARGETS, }; #define THRESHOLDS_EVENTS_TARGET (128) #define SOFTLIMIT_EVENTS_TARGET (1024) |
453a9bf34 memcg: fix numa s... |
110 |
#define NUMAINFO_EVENTS_TARGET (1024) |
e9f8974f2 memcg: break out ... |
111 |
|
d52aa412d memory cgroup enh... |
112 |
struct mem_cgroup_stat_cpu { |
7a159cc9d memcg: use native... |
113 |
long count[MEM_CGROUP_STAT_NSTATS]; |
e9f8974f2 memcg: break out ... |
114 |
unsigned long events[MEM_CGROUP_EVENTS_NSTATS]; |
7a159cc9d memcg: use native... |
115 |
unsigned long targets[MEM_CGROUP_NTARGETS]; |
d52aa412d memory cgroup enh... |
116 |
}; |
d52aa412d memory cgroup enh... |
117 |
/* |
6d12e2d8d per-zone and recl... |
118 119 |
* per-zone information in memory controller. */ |
6d12e2d8d per-zone and recl... |
120 |
struct mem_cgroup_per_zone { |
072c56c13 per-zone and recl... |
121 122 123 |
/* * spin_lock to protect the per cgroup LRU */ |
b69408e88 vmscan: Use an in... |
124 125 |
struct list_head lists[NR_LRU_LISTS]; unsigned long count[NR_LRU_LISTS]; |
3e2f41f1f memcg: add zone_r... |
126 127 |
struct zone_reclaim_stat reclaim_stat; |
f64c3f549 memory controller... |
128 129 130 131 |
struct rb_node tree_node; /* RB tree node */ unsigned long long usage_in_excess;/* Set to the value by which */ /* the soft limit is exceeded*/ bool on_tree; |
4e4169535 memory controller... |
132 133 |
struct mem_cgroup *mem; /* Back pointer, we cannot */ /* use container_of */ |
6d12e2d8d per-zone and recl... |
134 135 136 137 138 139 140 141 142 143 144 145 146 |
}; /* Macro for accessing counter */ #define MEM_CGROUP_ZSTAT(mz, idx) ((mz)->count[(idx)]) struct mem_cgroup_per_node { struct mem_cgroup_per_zone zoneinfo[MAX_NR_ZONES]; }; struct mem_cgroup_lru_info { struct mem_cgroup_per_node *nodeinfo[MAX_NUMNODES]; }; /* |
f64c3f549 memory controller... |
147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 |
* Cgroups above their limits are maintained in a RB-Tree, independent of * their hierarchy representation */ struct mem_cgroup_tree_per_zone { struct rb_root rb_root; spinlock_t lock; }; struct mem_cgroup_tree_per_node { struct mem_cgroup_tree_per_zone rb_tree_per_zone[MAX_NR_ZONES]; }; struct mem_cgroup_tree { struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES]; }; static struct mem_cgroup_tree soft_limit_tree __read_mostly; |
2e72b6347 memcg: implement ... |
165 166 167 168 |
struct mem_cgroup_threshold { struct eventfd_ctx *eventfd; u64 threshold; }; |
9490ff275 memcg: oom notifier |
169 |
/* For threshold */ |
2e72b6347 memcg: implement ... |
170 171 |
struct mem_cgroup_threshold_ary { /* An array index points to threshold just below usage. */ |
5407a5625 mm: remove unnece... |
172 |
int current_threshold; |
2e72b6347 memcg: implement ... |
173 174 175 176 177 |
/* Size of entries[] */ unsigned int size; /* Array of thresholds */ struct mem_cgroup_threshold entries[0]; }; |
2c488db27 memcg: clean up m... |
178 179 180 181 182 183 184 185 186 187 188 |
struct mem_cgroup_thresholds { /* Primary thresholds array */ struct mem_cgroup_threshold_ary *primary; /* * Spare threshold array. * This is needed to make mem_cgroup_unregister_event() "never fail". * It must be able to store at least primary->size - 1 entries. */ struct mem_cgroup_threshold_ary *spare; }; |
9490ff275 memcg: oom notifier |
189 190 191 192 193 |
/* for OOM */ struct mem_cgroup_eventfd_list { struct list_head list; struct eventfd_ctx *eventfd; }; |
2e72b6347 memcg: implement ... |
194 |
|
c0ff4b854 memcg: rename mem... |
195 196 |
static void mem_cgroup_threshold(struct mem_cgroup *memcg); static void mem_cgroup_oom_notify(struct mem_cgroup *memcg); |
2e72b6347 memcg: implement ... |
197 |
|
f64c3f549 memory controller... |
198 |
/* |
8cdea7c05 Memory controller... |
199 200 201 202 203 204 |
* The memory controller data structure. The memory controller controls both * page cache and RSS per cgroup. We would eventually like to provide * statistics based on the statistics developed by Rik Van Riel for clock-pro, * to help the administrator determine what knobs to tune. * * TODO: Add a water mark for the memory controller. Reclaim will begin when |
8a9f3ccd2 Memory controller... |
205 206 207 |
* we hit the water mark. May be even add a low water mark, such that * no reclaim occurs from a cgroup at it's low water mark, this is * a feature that will be implemented much later in the future. |
8cdea7c05 Memory controller... |
208 209 210 211 212 213 214 |
*/ struct mem_cgroup { struct cgroup_subsys_state css; /* * the counter to account for memory usage */ struct res_counter res; |
78fb74669 Memory controller... |
215 |
/* |
8c7c6e34a memcg: mem+swap c... |
216 217 218 219 |
* the counter to account for mem+swap usage. */ struct res_counter memsw; /* |
78fb74669 Memory controller... |
220 221 |
* Per cgroup active and inactive list, similar to the * per zone LRU lists. |
78fb74669 Memory controller... |
222 |
*/ |
6d12e2d8d per-zone and recl... |
223 |
struct mem_cgroup_lru_info info; |
6d61ef409 memcg: memory cgr... |
224 |
/* |
af901ca18 tree-wide: fix as... |
225 |
* While reclaiming in a hierarchy, we cache the last child we |
04046e1a0 memcg: use CSS ID |
226 |
* reclaimed from. |
6d61ef409 memcg: memory cgr... |
227 |
*/ |
04046e1a0 memcg: use CSS ID |
228 |
int last_scanned_child; |
889976dbc memcg: reclaim me... |
229 230 231 |
int last_scanned_node; #if MAX_NUMNODES > 1 nodemask_t scan_nodes; |
453a9bf34 memcg: fix numa s... |
232 233 |
atomic_t numainfo_events; atomic_t numainfo_updating; |
889976dbc memcg: reclaim me... |
234 |
#endif |
18f59ea7d memcg: memory cgr... |
235 236 237 238 |
/* * Should the accounting and control be hierarchical, per subtree? */ bool use_hierarchy; |
79dfdaccd memcg: make oom_l... |
239 240 241 |
bool oom_lock; atomic_t under_oom; |
8c7c6e34a memcg: mem+swap c... |
242 |
atomic_t refcnt; |
14797e236 memcg: add inacti... |
243 |
|
1f4c025b5 memcg: export mem... |
244 |
int swappiness; |
3c11ecf44 memcg: oom kill d... |
245 246 |
/* OOM-Killer disable */ int oom_kill_disable; |
a7885eb8a memcg: swappiness |
247 |
|
22a668d7c memcg: fix behavi... |
248 249 |
/* set when res.limit == memsw.limit */ bool memsw_is_minimum; |
2e72b6347 memcg: implement ... |
250 251 252 253 |
/* protect arrays of thresholds */ struct mutex thresholds_lock; /* thresholds for memory usage. RCU-protected */ |
2c488db27 memcg: clean up m... |
254 |
struct mem_cgroup_thresholds thresholds; |
907860ed3 cgroups: make cft... |
255 |
|
2e72b6347 memcg: implement ... |
256 |
/* thresholds for mem+swap usage. RCU-protected */ |
2c488db27 memcg: clean up m... |
257 |
struct mem_cgroup_thresholds memsw_thresholds; |
907860ed3 cgroups: make cft... |
258 |
|
9490ff275 memcg: oom notifier |
259 260 |
/* For oom notifier event fd */ struct list_head oom_notify; |
185efc0f9 memcg: Revert "me... |
261 |
|
d52aa412d memory cgroup enh... |
262 |
/* |
7dc74be03 memcg: add interf... |
263 264 265 266 |
* Should we move charges of a task when a task is moved into this * mem_cgroup ? And what type of charges should we move ? */ unsigned long move_charge_at_immigrate; |
7dc74be03 memcg: add interf... |
267 |
/* |
c62b1a3b3 memcg: use generi... |
268 |
* percpu counter. |
d52aa412d memory cgroup enh... |
269 |
*/ |
c62b1a3b3 memcg: use generi... |
270 |
struct mem_cgroup_stat_cpu *stat; |
711d3d2c9 memcg: cpu hotplu... |
271 272 273 274 275 276 |
/* * used when a cpu is offlined or other synchronizations * See mem_cgroup_read_stat(). */ struct mem_cgroup_stat_cpu nocpu_base; spinlock_t pcp_counter_lock; |
8cdea7c05 Memory controller... |
277 |
}; |
7dc74be03 memcg: add interf... |
278 279 280 281 282 283 |
/* Stuffs for move charges at task migration. */ /* * Types of charges to be moved. "move_charge_at_immitgrate" is treated as a * left-shifted bitmap of these types. */ enum move_type { |
4ffef5fef memcg: move charg... |
284 |
MOVE_CHARGE_TYPE_ANON, /* private anonymous page and swap of it */ |
87946a722 memcg: move charg... |
285 |
MOVE_CHARGE_TYPE_FILE, /* file page(including tmpfs) and swap of it */ |
7dc74be03 memcg: add interf... |
286 287 |
NR_MOVE_TYPE, }; |
4ffef5fef memcg: move charg... |
288 289 |
/* "mc" and its members are protected by cgroup_mutex */ static struct move_charge_struct { |
b1dd693e5 memcg: avoid dead... |
290 |
spinlock_t lock; /* for from, to */ |
4ffef5fef memcg: move charg... |
291 292 293 |
struct mem_cgroup *from; struct mem_cgroup *to; unsigned long precharge; |
854ffa8d1 memcg: improve pe... |
294 |
unsigned long moved_charge; |
483c30b51 memcg: improve pe... |
295 |
unsigned long moved_swap; |
8033b97c9 memcg: avoid oom ... |
296 297 298 |
struct task_struct *moving_task; /* a task moving charges */ wait_queue_head_t waitq; /* a waitq for other context */ } mc = { |
2bd9bb206 memcg: clean up w... |
299 |
.lock = __SPIN_LOCK_UNLOCKED(mc.lock), |
8033b97c9 memcg: avoid oom ... |
300 301 |
.waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq), }; |
4ffef5fef memcg: move charg... |
302 |
|
90254a658 memcg: clean up m... |
303 304 305 306 307 |
static bool move_anon(void) { return test_bit(MOVE_CHARGE_TYPE_ANON, &mc.to->move_charge_at_immigrate); } |
87946a722 memcg: move charg... |
308 309 310 311 312 |
static bool move_file(void) { return test_bit(MOVE_CHARGE_TYPE_FILE, &mc.to->move_charge_at_immigrate); } |
4e4169535 memory controller... |
313 314 315 316 317 318 |
/* * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft * limit reclaim to prevent infinite loops, if they ever occur. */ #define MEM_CGROUP_MAX_RECLAIM_LOOPS (100) #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS (2) |
217bc3194 memory cgroup enh... |
319 320 321 |
enum charge_type { MEM_CGROUP_CHARGE_TYPE_CACHE = 0, MEM_CGROUP_CHARGE_TYPE_MAPPED, |
4f98a2fee vmscan: split LRU... |
322 |
MEM_CGROUP_CHARGE_TYPE_SHMEM, /* used by page migration of shmem */ |
c05555b57 memcg: atomic ops... |
323 |
MEM_CGROUP_CHARGE_TYPE_FORCE, /* used by force_empty */ |
d13d14430 memcg: handle swa... |
324 |
MEM_CGROUP_CHARGE_TYPE_SWAPOUT, /* for accounting swapcache */ |
8a9478ca7 memcg: fix swap a... |
325 |
MEM_CGROUP_CHARGE_TYPE_DROP, /* a page was unused swap cache */ |
c05555b57 memcg: atomic ops... |
326 327 |
NR_CHARGE_TYPE, }; |
8c7c6e34a memcg: mem+swap c... |
328 329 330 |
/* for encoding cft->private value on file */ #define _MEM (0) #define _MEMSWAP (1) |
9490ff275 memcg: oom notifier |
331 |
#define _OOM_TYPE (2) |
8c7c6e34a memcg: mem+swap c... |
332 333 334 |
#define MEMFILE_PRIVATE(x, val) (((x) << 16) | (val)) #define MEMFILE_TYPE(val) (((val) >> 16) & 0xffff) #define MEMFILE_ATTR(val) ((val) & 0xffff) |
9490ff275 memcg: oom notifier |
335 336 |
/* Used for OOM nofiier */ #define OOM_CONTROL (0) |
8c7c6e34a memcg: mem+swap c... |
337 |
|
75822b449 memory controller... |
338 339 340 341 342 343 344 |
/* * Reclaim flags for mem_cgroup_hierarchical_reclaim */ #define MEM_CGROUP_RECLAIM_NOSWAP_BIT 0x0 #define MEM_CGROUP_RECLAIM_NOSWAP (1 << MEM_CGROUP_RECLAIM_NOSWAP_BIT) #define MEM_CGROUP_RECLAIM_SHRINK_BIT 0x1 #define MEM_CGROUP_RECLAIM_SHRINK (1 << MEM_CGROUP_RECLAIM_SHRINK_BIT) |
4e4169535 memory controller... |
345 346 |
#define MEM_CGROUP_RECLAIM_SOFT_BIT 0x2 #define MEM_CGROUP_RECLAIM_SOFT (1 << MEM_CGROUP_RECLAIM_SOFT_BIT) |
75822b449 memory controller... |
347 |
|
c0ff4b854 memcg: rename mem... |
348 349 350 351 |
static void mem_cgroup_get(struct mem_cgroup *memcg); static void mem_cgroup_put(struct mem_cgroup *memcg); static struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *memcg); static void drain_all_stock_async(struct mem_cgroup *memcg); |
8c7c6e34a memcg: mem+swap c... |
352 |
|
f64c3f549 memory controller... |
353 |
static struct mem_cgroup_per_zone * |
c0ff4b854 memcg: rename mem... |
354 |
mem_cgroup_zoneinfo(struct mem_cgroup *memcg, int nid, int zid) |
f64c3f549 memory controller... |
355 |
{ |
c0ff4b854 memcg: rename mem... |
356 |
return &memcg->info.nodeinfo[nid]->zoneinfo[zid]; |
f64c3f549 memory controller... |
357 |
} |
c0ff4b854 memcg: rename mem... |
358 |
struct cgroup_subsys_state *mem_cgroup_css(struct mem_cgroup *memcg) |
d324236b3 memcg: add access... |
359 |
{ |
c0ff4b854 memcg: rename mem... |
360 |
return &memcg->css; |
d324236b3 memcg: add access... |
361 |
} |
f64c3f549 memory controller... |
362 |
static struct mem_cgroup_per_zone * |
c0ff4b854 memcg: rename mem... |
363 |
page_cgroup_zoneinfo(struct mem_cgroup *memcg, struct page *page) |
f64c3f549 memory controller... |
364 |
{ |
97a6c37b3 memcg: change pag... |
365 366 |
int nid = page_to_nid(page); int zid = page_zonenum(page); |
f64c3f549 memory controller... |
367 |
|
c0ff4b854 memcg: rename mem... |
368 |
return mem_cgroup_zoneinfo(memcg, nid, zid); |
f64c3f549 memory controller... |
369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 |
} static struct mem_cgroup_tree_per_zone * soft_limit_tree_node_zone(int nid, int zid) { return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid]; } static struct mem_cgroup_tree_per_zone * soft_limit_tree_from_page(struct page *page) { int nid = page_to_nid(page); int zid = page_zonenum(page); return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid]; } static void |
c0ff4b854 memcg: rename mem... |
387 |
__mem_cgroup_insert_exceeded(struct mem_cgroup *memcg, |
f64c3f549 memory controller... |
388 |
struct mem_cgroup_per_zone *mz, |
ef8745c1e memcg: reduce che... |
389 390 |
struct mem_cgroup_tree_per_zone *mctz, unsigned long long new_usage_in_excess) |
f64c3f549 memory controller... |
391 392 393 394 395 396 397 |
{ struct rb_node **p = &mctz->rb_root.rb_node; struct rb_node *parent = NULL; struct mem_cgroup_per_zone *mz_node; if (mz->on_tree) return; |
ef8745c1e memcg: reduce che... |
398 399 400 |
mz->usage_in_excess = new_usage_in_excess; if (!mz->usage_in_excess) return; |
f64c3f549 memory controller... |
401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 |
while (*p) { parent = *p; mz_node = rb_entry(parent, struct mem_cgroup_per_zone, tree_node); if (mz->usage_in_excess < mz_node->usage_in_excess) p = &(*p)->rb_left; /* * We can't avoid mem cgroups that are over their soft * limit by the same amount */ else if (mz->usage_in_excess >= mz_node->usage_in_excess) p = &(*p)->rb_right; } rb_link_node(&mz->tree_node, parent, p); rb_insert_color(&mz->tree_node, &mctz->rb_root); mz->on_tree = true; |
4e4169535 memory controller... |
417 418 419 |
} static void |
c0ff4b854 memcg: rename mem... |
420 |
__mem_cgroup_remove_exceeded(struct mem_cgroup *memcg, |
4e4169535 memory controller... |
421 422 423 424 425 426 427 428 429 430 |
struct mem_cgroup_per_zone *mz, struct mem_cgroup_tree_per_zone *mctz) { if (!mz->on_tree) return; rb_erase(&mz->tree_node, &mctz->rb_root); mz->on_tree = false; } static void |
c0ff4b854 memcg: rename mem... |
431 |
mem_cgroup_remove_exceeded(struct mem_cgroup *memcg, |
f64c3f549 memory controller... |
432 433 434 435 |
struct mem_cgroup_per_zone *mz, struct mem_cgroup_tree_per_zone *mctz) { spin_lock(&mctz->lock); |
c0ff4b854 memcg: rename mem... |
436 |
__mem_cgroup_remove_exceeded(memcg, mz, mctz); |
f64c3f549 memory controller... |
437 438 |
spin_unlock(&mctz->lock); } |
f64c3f549 memory controller... |
439 |
|
c0ff4b854 memcg: rename mem... |
440 |
static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page) |
f64c3f549 memory controller... |
441 |
{ |
ef8745c1e memcg: reduce che... |
442 |
unsigned long long excess; |
f64c3f549 memory controller... |
443 444 |
struct mem_cgroup_per_zone *mz; struct mem_cgroup_tree_per_zone *mctz; |
4e649152c memcg: some modif... |
445 446 |
int nid = page_to_nid(page); int zid = page_zonenum(page); |
f64c3f549 memory controller... |
447 448 449 |
mctz = soft_limit_tree_from_page(page); /* |
4e649152c memcg: some modif... |
450 451 |
* Necessary to update all ancestors when hierarchy is used. * because their event counter is not touched. |
f64c3f549 memory controller... |
452 |
*/ |
c0ff4b854 memcg: rename mem... |
453 454 455 |
for (; memcg; memcg = parent_mem_cgroup(memcg)) { mz = mem_cgroup_zoneinfo(memcg, nid, zid); excess = res_counter_soft_limit_excess(&memcg->res); |
4e649152c memcg: some modif... |
456 457 458 459 |
/* * We have to update the tree if mz is on RB-tree or * mem is over its softlimit. */ |
ef8745c1e memcg: reduce che... |
460 |
if (excess || mz->on_tree) { |
4e649152c memcg: some modif... |
461 462 463 |
spin_lock(&mctz->lock); /* if on-tree, remove it */ if (mz->on_tree) |
c0ff4b854 memcg: rename mem... |
464 |
__mem_cgroup_remove_exceeded(memcg, mz, mctz); |
4e649152c memcg: some modif... |
465 |
/* |
ef8745c1e memcg: reduce che... |
466 467 |
* Insert again. mz->usage_in_excess will be updated. * If excess is 0, no tree ops. |
4e649152c memcg: some modif... |
468 |
*/ |
c0ff4b854 memcg: rename mem... |
469 |
__mem_cgroup_insert_exceeded(memcg, mz, mctz, excess); |
4e649152c memcg: some modif... |
470 471 |
spin_unlock(&mctz->lock); } |
f64c3f549 memory controller... |
472 473 |
} } |
c0ff4b854 memcg: rename mem... |
474 |
static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg) |
f64c3f549 memory controller... |
475 476 477 478 479 480 481 |
{ int node, zone; struct mem_cgroup_per_zone *mz; struct mem_cgroup_tree_per_zone *mctz; for_each_node_state(node, N_POSSIBLE) { for (zone = 0; zone < MAX_NR_ZONES; zone++) { |
c0ff4b854 memcg: rename mem... |
482 |
mz = mem_cgroup_zoneinfo(memcg, node, zone); |
f64c3f549 memory controller... |
483 |
mctz = soft_limit_tree_node_zone(node, zone); |
c0ff4b854 memcg: rename mem... |
484 |
mem_cgroup_remove_exceeded(memcg, mz, mctz); |
f64c3f549 memory controller... |
485 486 487 |
} } } |
4e4169535 memory controller... |
488 489 490 491 |
static struct mem_cgroup_per_zone * __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz) { struct rb_node *rightmost = NULL; |
26251eaf9 memcg: fix refcnt... |
492 |
struct mem_cgroup_per_zone *mz; |
4e4169535 memory controller... |
493 494 |
retry: |
26251eaf9 memcg: fix refcnt... |
495 |
mz = NULL; |
4e4169535 memory controller... |
496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 |
rightmost = rb_last(&mctz->rb_root); if (!rightmost) goto done; /* Nothing to reclaim from */ mz = rb_entry(rightmost, struct mem_cgroup_per_zone, tree_node); /* * Remove the node now but someone else can add it back, * we will to add it back at the end of reclaim to its correct * position in the tree. */ __mem_cgroup_remove_exceeded(mz->mem, mz, mctz); if (!res_counter_soft_limit_excess(&mz->mem->res) || !css_tryget(&mz->mem->css)) goto retry; done: return mz; } static struct mem_cgroup_per_zone * mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz) { struct mem_cgroup_per_zone *mz; spin_lock(&mctz->lock); mz = __mem_cgroup_largest_soft_limit_node(mctz); spin_unlock(&mctz->lock); return mz; } |
711d3d2c9 memcg: cpu hotplu... |
524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 |
/* * Implementation Note: reading percpu statistics for memcg. * * Both of vmstat[] and percpu_counter has threshold and do periodic * synchronization to implement "quick" read. There are trade-off between * reading cost and precision of value. Then, we may have a chance to implement * a periodic synchronizion of counter in memcg's counter. * * But this _read() function is used for user interface now. The user accounts * memory usage by memory cgroup and he _always_ requires exact value because * he accounts memory. Even if we provide quick-and-fuzzy read, we always * have to visit all online cpus and make sum. So, for now, unnecessary * synchronization is not implemented. (just implemented for cpu hotplug) * * If there are kernel internal actions which can make use of some not-exact * value, and reading all cpu value can be performance bottleneck in some * common workload, threashold and synchonization as vmstat[] should be * implemented. */ |
c0ff4b854 memcg: rename mem... |
543 |
static long mem_cgroup_read_stat(struct mem_cgroup *memcg, |
7a159cc9d memcg: use native... |
544 |
enum mem_cgroup_stat_index idx) |
c62b1a3b3 memcg: use generi... |
545 |
{ |
7a159cc9d memcg: use native... |
546 |
long val = 0; |
c62b1a3b3 memcg: use generi... |
547 |
int cpu; |
c62b1a3b3 memcg: use generi... |
548 |
|
711d3d2c9 memcg: cpu hotplu... |
549 550 |
get_online_cpus(); for_each_online_cpu(cpu) |
c0ff4b854 memcg: rename mem... |
551 |
val += per_cpu(memcg->stat->count[idx], cpu); |
711d3d2c9 memcg: cpu hotplu... |
552 |
#ifdef CONFIG_HOTPLUG_CPU |
c0ff4b854 memcg: rename mem... |
553 554 555 |
spin_lock(&memcg->pcp_counter_lock); val += memcg->nocpu_base.count[idx]; spin_unlock(&memcg->pcp_counter_lock); |
711d3d2c9 memcg: cpu hotplu... |
556 557 |
#endif put_online_cpus(); |
c62b1a3b3 memcg: use generi... |
558 559 |
return val; } |
c0ff4b854 memcg: rename mem... |
560 |
static void mem_cgroup_swap_statistics(struct mem_cgroup *memcg, |
0c3e73e84 memcg: improve re... |
561 562 563 |
bool charge) { int val = (charge) ? 1 : -1; |
c0ff4b854 memcg: rename mem... |
564 |
this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_SWAPOUT], val); |
0c3e73e84 memcg: improve re... |
565 |
} |
c0ff4b854 memcg: rename mem... |
566 |
void mem_cgroup_pgfault(struct mem_cgroup *memcg, int val) |
456f998ec memcg: add the pa... |
567 |
{ |
c0ff4b854 memcg: rename mem... |
568 |
this_cpu_add(memcg->stat->events[MEM_CGROUP_EVENTS_PGFAULT], val); |
456f998ec memcg: add the pa... |
569 |
} |
c0ff4b854 memcg: rename mem... |
570 |
void mem_cgroup_pgmajfault(struct mem_cgroup *memcg, int val) |
456f998ec memcg: add the pa... |
571 |
{ |
c0ff4b854 memcg: rename mem... |
572 |
this_cpu_add(memcg->stat->events[MEM_CGROUP_EVENTS_PGMAJFAULT], val); |
456f998ec memcg: add the pa... |
573 |
} |
c0ff4b854 memcg: rename mem... |
574 |
static unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg, |
e9f8974f2 memcg: break out ... |
575 576 577 578 579 580 |
enum mem_cgroup_events_index idx) { unsigned long val = 0; int cpu; for_each_online_cpu(cpu) |
c0ff4b854 memcg: rename mem... |
581 |
val += per_cpu(memcg->stat->events[idx], cpu); |
e9f8974f2 memcg: break out ... |
582 |
#ifdef CONFIG_HOTPLUG_CPU |
c0ff4b854 memcg: rename mem... |
583 584 585 |
spin_lock(&memcg->pcp_counter_lock); val += memcg->nocpu_base.events[idx]; spin_unlock(&memcg->pcp_counter_lock); |
e9f8974f2 memcg: break out ... |
586 587 588 |
#endif return val; } |
c0ff4b854 memcg: rename mem... |
589 |
static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg, |
e401f1761 memcg: modify acc... |
590 |
bool file, int nr_pages) |
d52aa412d memory cgroup enh... |
591 |
{ |
c62b1a3b3 memcg: use generi... |
592 |
preempt_disable(); |
e401f1761 memcg: modify acc... |
593 |
if (file) |
c0ff4b854 memcg: rename mem... |
594 595 |
__this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_CACHE], nr_pages); |
d52aa412d memory cgroup enh... |
596 |
else |
c0ff4b854 memcg: rename mem... |
597 598 |
__this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_RSS], nr_pages); |
55e462b05 memcg: simple sta... |
599 |
|
e401f1761 memcg: modify acc... |
600 601 |
/* pagein of a big page is an event. So, ignore page size */ if (nr_pages > 0) |
c0ff4b854 memcg: rename mem... |
602 |
__this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGIN]); |
3751d6043 memcg: fix event ... |
603 |
else { |
c0ff4b854 memcg: rename mem... |
604 |
__this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGOUT]); |
3751d6043 memcg: fix event ... |
605 606 |
nr_pages = -nr_pages; /* for event */ } |
e401f1761 memcg: modify acc... |
607 |
|
c0ff4b854 memcg: rename mem... |
608 |
__this_cpu_add(memcg->stat->events[MEM_CGROUP_EVENTS_COUNT], nr_pages); |
2e72b6347 memcg: implement ... |
609 |
|
c62b1a3b3 memcg: use generi... |
610 |
preempt_enable(); |
6d12e2d8d per-zone and recl... |
611 |
} |
bb2a0de92 memcg: consolidat... |
612 |
unsigned long |
c0ff4b854 memcg: rename mem... |
613 |
mem_cgroup_zone_nr_lru_pages(struct mem_cgroup *memcg, int nid, int zid, |
bb2a0de92 memcg: consolidat... |
614 |
unsigned int lru_mask) |
889976dbc memcg: reclaim me... |
615 616 |
{ struct mem_cgroup_per_zone *mz; |
bb2a0de92 memcg: consolidat... |
617 618 |
enum lru_list l; unsigned long ret = 0; |
c0ff4b854 memcg: rename mem... |
619 |
mz = mem_cgroup_zoneinfo(memcg, nid, zid); |
bb2a0de92 memcg: consolidat... |
620 621 622 623 624 625 626 627 628 |
for_each_lru(l) { if (BIT(l) & lru_mask) ret += MEM_CGROUP_ZSTAT(mz, l); } return ret; } static unsigned long |
c0ff4b854 memcg: rename mem... |
629 |
mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg, |
bb2a0de92 memcg: consolidat... |
630 631 |
int nid, unsigned int lru_mask) { |
889976dbc memcg: reclaim me... |
632 633 |
u64 total = 0; int zid; |
bb2a0de92 memcg: consolidat... |
634 |
for (zid = 0; zid < MAX_NR_ZONES; zid++) |
c0ff4b854 memcg: rename mem... |
635 636 |
total += mem_cgroup_zone_nr_lru_pages(memcg, nid, zid, lru_mask); |
bb2a0de92 memcg: consolidat... |
637 |
|
889976dbc memcg: reclaim me... |
638 639 |
return total; } |
bb2a0de92 memcg: consolidat... |
640 |
|
c0ff4b854 memcg: rename mem... |
641 |
static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg, |
bb2a0de92 memcg: consolidat... |
642 |
unsigned int lru_mask) |
6d12e2d8d per-zone and recl... |
643 |
{ |
889976dbc memcg: reclaim me... |
644 |
int nid; |
6d12e2d8d per-zone and recl... |
645 |
u64 total = 0; |
bb2a0de92 memcg: consolidat... |
646 |
for_each_node_state(nid, N_HIGH_MEMORY) |
c0ff4b854 memcg: rename mem... |
647 |
total += mem_cgroup_node_nr_lru_pages(memcg, nid, lru_mask); |
6d12e2d8d per-zone and recl... |
648 |
return total; |
d52aa412d memory cgroup enh... |
649 |
} |
c0ff4b854 memcg: rename mem... |
650 |
static bool __memcg_event_check(struct mem_cgroup *memcg, int target) |
7a159cc9d memcg: use native... |
651 652 |
{ unsigned long val, next; |
4799401fe memcg: Fix race c... |
653 654 |
val = __this_cpu_read(memcg->stat->events[MEM_CGROUP_EVENTS_COUNT]); next = __this_cpu_read(memcg->stat->targets[target]); |
7a159cc9d memcg: use native... |
655 656 657 |
/* from time_after() in jiffies.h */ return ((long)next - (long)val < 0); } |
c0ff4b854 memcg: rename mem... |
658 |
static void __mem_cgroup_target_update(struct mem_cgroup *memcg, int target) |
d2265e6fa memcg : share eve... |
659 |
{ |
7a159cc9d memcg: use native... |
660 |
unsigned long val, next; |
d2265e6fa memcg : share eve... |
661 |
|
4799401fe memcg: Fix race c... |
662 |
val = __this_cpu_read(memcg->stat->events[MEM_CGROUP_EVENTS_COUNT]); |
d2265e6fa memcg : share eve... |
663 |
|
7a159cc9d memcg: use native... |
664 665 666 667 668 669 670 |
switch (target) { case MEM_CGROUP_TARGET_THRESH: next = val + THRESHOLDS_EVENTS_TARGET; break; case MEM_CGROUP_TARGET_SOFTLIMIT: next = val + SOFTLIMIT_EVENTS_TARGET; break; |
453a9bf34 memcg: fix numa s... |
671 672 673 |
case MEM_CGROUP_TARGET_NUMAINFO: next = val + NUMAINFO_EVENTS_TARGET; break; |
7a159cc9d memcg: use native... |
674 675 676 |
default: return; } |
4799401fe memcg: Fix race c... |
677 |
__this_cpu_write(memcg->stat->targets[target], next); |
d2265e6fa memcg : share eve... |
678 679 680 681 682 683 |
} /* * Check events in order. * */ |
c0ff4b854 memcg: rename mem... |
684 |
static void memcg_check_events(struct mem_cgroup *memcg, struct page *page) |
d2265e6fa memcg : share eve... |
685 |
{ |
4799401fe memcg: Fix race c... |
686 |
preempt_disable(); |
d2265e6fa memcg : share eve... |
687 |
/* threshold event is triggered in finer grain than soft limit */ |
c0ff4b854 memcg: rename mem... |
688 689 690 691 |
if (unlikely(__memcg_event_check(memcg, MEM_CGROUP_TARGET_THRESH))) { mem_cgroup_threshold(memcg); __mem_cgroup_target_update(memcg, MEM_CGROUP_TARGET_THRESH); if (unlikely(__memcg_event_check(memcg, |
453a9bf34 memcg: fix numa s... |
692 |
MEM_CGROUP_TARGET_SOFTLIMIT))) { |
c0ff4b854 memcg: rename mem... |
693 694 |
mem_cgroup_update_tree(memcg, page); __mem_cgroup_target_update(memcg, |
453a9bf34 memcg: fix numa s... |
695 696 697 |
MEM_CGROUP_TARGET_SOFTLIMIT); } #if MAX_NUMNODES > 1 |
c0ff4b854 memcg: rename mem... |
698 |
if (unlikely(__memcg_event_check(memcg, |
453a9bf34 memcg: fix numa s... |
699 |
MEM_CGROUP_TARGET_NUMAINFO))) { |
c0ff4b854 memcg: rename mem... |
700 701 |
atomic_inc(&memcg->numainfo_events); __mem_cgroup_target_update(memcg, |
453a9bf34 memcg: fix numa s... |
702 |
MEM_CGROUP_TARGET_NUMAINFO); |
7a159cc9d memcg: use native... |
703 |
} |
453a9bf34 memcg: fix numa s... |
704 |
#endif |
d2265e6fa memcg : share eve... |
705 |
} |
4799401fe memcg: Fix race c... |
706 |
preempt_enable(); |
d2265e6fa memcg : share eve... |
707 |
} |
d5b69e38f memcg: memcontrol... |
708 |
static struct mem_cgroup *mem_cgroup_from_cont(struct cgroup *cont) |
8cdea7c05 Memory controller... |
709 710 711 712 713 |
{ return container_of(cgroup_subsys_state(cont, mem_cgroup_subsys_id), struct mem_cgroup, css); } |
cf475ad28 cgroups: add an o... |
714 |
struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p) |
78fb74669 Memory controller... |
715 |
{ |
31a78f23b mm owner: fix rac... |
716 717 718 719 720 721 722 |
/* * mm_update_next_owner() may clear mm->owner to NULL * if it races with swapoff, page migration, etc. * So this can be called with p == NULL. */ if (unlikely(!p)) return NULL; |
78fb74669 Memory controller... |
723 724 725 |
return container_of(task_subsys_state(p, mem_cgroup_subsys_id), struct mem_cgroup, css); } |
a433658c3 vmscan,memcg: mem... |
726 |
struct mem_cgroup *try_get_mem_cgroup_from_mm(struct mm_struct *mm) |
54595fe26 memcg: use css_tr... |
727 |
{ |
c0ff4b854 memcg: rename mem... |
728 |
struct mem_cgroup *memcg = NULL; |
0b7f569e4 memcg: fix OOM ki... |
729 730 731 |
if (!mm) return NULL; |
54595fe26 memcg: use css_tr... |
732 733 734 735 736 737 738 |
/* * Because we have no locks, mm->owner's may be being moved to other * cgroup. We use css_tryget() here even if this looks * pessimistic (rather than adding locks here). */ rcu_read_lock(); do { |
c0ff4b854 memcg: rename mem... |
739 740 |
memcg = mem_cgroup_from_task(rcu_dereference(mm->owner)); if (unlikely(!memcg)) |
54595fe26 memcg: use css_tr... |
741 |
break; |
c0ff4b854 memcg: rename mem... |
742 |
} while (!css_tryget(&memcg->css)); |
54595fe26 memcg: use css_tr... |
743 |
rcu_read_unlock(); |
c0ff4b854 memcg: rename mem... |
744 |
return memcg; |
54595fe26 memcg: use css_tr... |
745 |
} |
7d74b06f2 memcg: use for_ea... |
746 |
/* The caller has to guarantee "mem" exists before calling this */ |
c0ff4b854 memcg: rename mem... |
747 |
static struct mem_cgroup *mem_cgroup_start_loop(struct mem_cgroup *memcg) |
14067bb3e memcg: hierarchic... |
748 |
{ |
711d3d2c9 memcg: cpu hotplu... |
749 750 |
struct cgroup_subsys_state *css; int found; |
c0ff4b854 memcg: rename mem... |
751 |
if (!memcg) /* ROOT cgroup has the smallest ID */ |
711d3d2c9 memcg: cpu hotplu... |
752 |
return root_mem_cgroup; /*css_put/get against root is ignored*/ |
c0ff4b854 memcg: rename mem... |
753 754 755 |
if (!memcg->use_hierarchy) { if (css_tryget(&memcg->css)) return memcg; |
711d3d2c9 memcg: cpu hotplu... |
756 757 758 759 760 761 762 |
return NULL; } rcu_read_lock(); /* * searching a memory cgroup which has the smallest ID under given * ROOT cgroup. (ID >= 1) */ |
c0ff4b854 memcg: rename mem... |
763 |
css = css_get_next(&mem_cgroup_subsys, 1, &memcg->css, &found); |
711d3d2c9 memcg: cpu hotplu... |
764 |
if (css && css_tryget(css)) |
c0ff4b854 memcg: rename mem... |
765 |
memcg = container_of(css, struct mem_cgroup, css); |
711d3d2c9 memcg: cpu hotplu... |
766 |
else |
c0ff4b854 memcg: rename mem... |
767 |
memcg = NULL; |
711d3d2c9 memcg: cpu hotplu... |
768 |
rcu_read_unlock(); |
c0ff4b854 memcg: rename mem... |
769 |
return memcg; |
7d74b06f2 memcg: use for_ea... |
770 771 772 773 774 775 776 777 778 |
} static struct mem_cgroup *mem_cgroup_get_next(struct mem_cgroup *iter, struct mem_cgroup *root, bool cond) { int nextid = css_id(&iter->css) + 1; int found; int hierarchy_used; |
14067bb3e memcg: hierarchic... |
779 |
struct cgroup_subsys_state *css; |
14067bb3e memcg: hierarchic... |
780 |
|
7d74b06f2 memcg: use for_ea... |
781 |
hierarchy_used = iter->use_hierarchy; |
14067bb3e memcg: hierarchic... |
782 |
|
7d74b06f2 memcg: use for_ea... |
783 |
css_put(&iter->css); |
711d3d2c9 memcg: cpu hotplu... |
784 785 |
/* If no ROOT, walk all, ignore hierarchy */ if (!cond || (root && !hierarchy_used)) |
7d74b06f2 memcg: use for_ea... |
786 |
return NULL; |
14067bb3e memcg: hierarchic... |
787 |
|
711d3d2c9 memcg: cpu hotplu... |
788 789 |
if (!root) root = root_mem_cgroup; |
7d74b06f2 memcg: use for_ea... |
790 791 |
do { iter = NULL; |
14067bb3e memcg: hierarchic... |
792 |
rcu_read_lock(); |
7d74b06f2 memcg: use for_ea... |
793 794 795 |
css = css_get_next(&mem_cgroup_subsys, nextid, &root->css, &found); |
14067bb3e memcg: hierarchic... |
796 |
if (css && css_tryget(css)) |
7d74b06f2 memcg: use for_ea... |
797 |
iter = container_of(css, struct mem_cgroup, css); |
14067bb3e memcg: hierarchic... |
798 |
rcu_read_unlock(); |
7d74b06f2 memcg: use for_ea... |
799 |
/* If css is NULL, no more cgroups will be found */ |
14067bb3e memcg: hierarchic... |
800 |
nextid = found + 1; |
7d74b06f2 memcg: use for_ea... |
801 |
} while (css && !iter); |
14067bb3e memcg: hierarchic... |
802 |
|
7d74b06f2 memcg: use for_ea... |
803 |
return iter; |
14067bb3e memcg: hierarchic... |
804 |
} |
7d74b06f2 memcg: use for_ea... |
805 806 807 808 809 810 811 812 813 814 815 816 |
/* * for_eacn_mem_cgroup_tree() for visiting all cgroup under tree. Please * be careful that "break" loop is not allowed. We have reference count. * Instead of that modify "cond" to be false and "continue" to exit the loop. */ #define for_each_mem_cgroup_tree_cond(iter, root, cond) \ for (iter = mem_cgroup_start_loop(root);\ iter != NULL;\ iter = mem_cgroup_get_next(iter, root, cond)) #define for_each_mem_cgroup_tree(iter, root) \ for_each_mem_cgroup_tree_cond(iter, root, true) |
711d3d2c9 memcg: cpu hotplu... |
817 818 |
#define for_each_mem_cgroup_all(iter) \ for_each_mem_cgroup_tree_cond(iter, NULL, true) |
14067bb3e memcg: hierarchic... |
819 |
|
c0ff4b854 memcg: rename mem... |
820 |
static inline bool mem_cgroup_is_root(struct mem_cgroup *memcg) |
4b3bde4c9 memcg: remove the... |
821 |
{ |
c0ff4b854 memcg: rename mem... |
822 |
return (memcg == root_mem_cgroup); |
4b3bde4c9 memcg: remove the... |
823 |
} |
456f998ec memcg: add the pa... |
824 825 |
void mem_cgroup_count_vm_event(struct mm_struct *mm, enum vm_event_item idx) { |
c0ff4b854 memcg: rename mem... |
826 |
struct mem_cgroup *memcg; |
456f998ec memcg: add the pa... |
827 828 829 830 831 |
if (!mm) return; rcu_read_lock(); |
c0ff4b854 memcg: rename mem... |
832 833 |
memcg = mem_cgroup_from_task(rcu_dereference(mm->owner)); if (unlikely(!memcg)) |
456f998ec memcg: add the pa... |
834 835 836 837 |
goto out; switch (idx) { case PGMAJFAULT: |
c0ff4b854 memcg: rename mem... |
838 |
mem_cgroup_pgmajfault(memcg, 1); |
456f998ec memcg: add the pa... |
839 840 |
break; case PGFAULT: |
c0ff4b854 memcg: rename mem... |
841 |
mem_cgroup_pgfault(memcg, 1); |
456f998ec memcg: add the pa... |
842 843 844 845 846 847 848 849 |
break; default: BUG(); } out: rcu_read_unlock(); } EXPORT_SYMBOL(mem_cgroup_count_vm_event); |
08e552c69 memcg: synchroniz... |
850 851 852 853 854 855 856 857 858 859 860 861 862 |
/* * Following LRU functions are allowed to be used without PCG_LOCK. * Operations are called by routine of global LRU independently from memcg. * What we have to take care of here is validness of pc->mem_cgroup. * * Changes to pc->mem_cgroup happens when * 1. charge * 2. moving account * In typical case, "charge" is done before add-to-lru. Exception is SwapCache. * It is added to LRU before charge. * If PCG_USED bit is not set, page_cgroup is not added to this private LRU. * When moving account, the page is not on LRU. It's isolated. */ |
4f98a2fee vmscan: split LRU... |
863 |
|
08e552c69 memcg: synchroniz... |
864 865 866 |
void mem_cgroup_del_lru_list(struct page *page, enum lru_list lru) { struct page_cgroup *pc; |
08e552c69 memcg: synchroniz... |
867 |
struct mem_cgroup_per_zone *mz; |
6d12e2d8d per-zone and recl... |
868 |
|
f8d665422 memcg: add mem_cg... |
869 |
if (mem_cgroup_disabled()) |
08e552c69 memcg: synchroniz... |
870 871 872 |
return; pc = lookup_page_cgroup(page); /* can happen while we handle swapcache. */ |
4b3bde4c9 memcg: remove the... |
873 |
if (!TestClearPageCgroupAcctLRU(pc)) |
08e552c69 memcg: synchroniz... |
874 |
return; |
4b3bde4c9 memcg: remove the... |
875 |
VM_BUG_ON(!pc->mem_cgroup); |
544122e5e memcg: fix LRU ac... |
876 877 878 879 |
/* * We don't check PCG_USED bit. It's cleared when the "page" is finally * removed from global LRU. */ |
97a6c37b3 memcg: change pag... |
880 |
mz = page_cgroup_zoneinfo(pc->mem_cgroup, page); |
ece35ca81 memcg: fix LRU ac... |
881 882 |
/* huge page split is done under lru_lock. so, we have no races. */ MEM_CGROUP_ZSTAT(mz, lru) -= 1 << compound_order(page); |
4b3bde4c9 memcg: remove the... |
883 884 885 |
if (mem_cgroup_is_root(pc->mem_cgroup)) return; VM_BUG_ON(list_empty(&pc->lru)); |
08e552c69 memcg: synchroniz... |
886 |
list_del_init(&pc->lru); |
6d12e2d8d per-zone and recl... |
887 |
} |
08e552c69 memcg: synchroniz... |
888 |
void mem_cgroup_del_lru(struct page *page) |
6d12e2d8d per-zone and recl... |
889 |
{ |
08e552c69 memcg: synchroniz... |
890 891 |
mem_cgroup_del_lru_list(page, page_lru(page)); } |
b69408e88 vmscan: Use an in... |
892 |
|
3f58a8294 memcg: move memcg... |
893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 |
/* * Writeback is about to end against a page which has been marked for immediate * reclaim. If it still appears to be reclaimable, move it to the tail of the * inactive list. */ void mem_cgroup_rotate_reclaimable_page(struct page *page) { struct mem_cgroup_per_zone *mz; struct page_cgroup *pc; enum lru_list lru = page_lru(page); if (mem_cgroup_disabled()) return; pc = lookup_page_cgroup(page); /* unused or root page is not rotated. */ if (!PageCgroupUsed(pc)) return; /* Ensure pc->mem_cgroup is visible after reading PCG_USED. */ smp_rmb(); if (mem_cgroup_is_root(pc->mem_cgroup)) return; |
97a6c37b3 memcg: change pag... |
915 |
mz = page_cgroup_zoneinfo(pc->mem_cgroup, page); |
3f58a8294 memcg: move memcg... |
916 917 |
list_move_tail(&pc->lru, &mz->lists[lru]); } |
08e552c69 memcg: synchroniz... |
918 919 920 921 |
void mem_cgroup_rotate_lru_list(struct page *page, enum lru_list lru) { struct mem_cgroup_per_zone *mz; struct page_cgroup *pc; |
b69408e88 vmscan: Use an in... |
922 |
|
f8d665422 memcg: add mem_cg... |
923 |
if (mem_cgroup_disabled()) |
08e552c69 memcg: synchroniz... |
924 |
return; |
6d12e2d8d per-zone and recl... |
925 |
|
08e552c69 memcg: synchroniz... |
926 |
pc = lookup_page_cgroup(page); |
4b3bde4c9 memcg: remove the... |
927 |
/* unused or root page is not rotated. */ |
713735b42 memcg: correctly ... |
928 929 930 931 932 |
if (!PageCgroupUsed(pc)) return; /* Ensure pc->mem_cgroup is visible after reading PCG_USED. */ smp_rmb(); if (mem_cgroup_is_root(pc->mem_cgroup)) |
08e552c69 memcg: synchroniz... |
933 |
return; |
97a6c37b3 memcg: change pag... |
934 |
mz = page_cgroup_zoneinfo(pc->mem_cgroup, page); |
08e552c69 memcg: synchroniz... |
935 |
list_move(&pc->lru, &mz->lists[lru]); |
6d12e2d8d per-zone and recl... |
936 |
} |
08e552c69 memcg: synchroniz... |
937 |
void mem_cgroup_add_lru_list(struct page *page, enum lru_list lru) |
66e1707bc Memory controller... |
938 |
{ |
08e552c69 memcg: synchroniz... |
939 940 |
struct page_cgroup *pc; struct mem_cgroup_per_zone *mz; |
6d12e2d8d per-zone and recl... |
941 |
|
f8d665422 memcg: add mem_cg... |
942 |
if (mem_cgroup_disabled()) |
08e552c69 memcg: synchroniz... |
943 944 |
return; pc = lookup_page_cgroup(page); |
4b3bde4c9 memcg: remove the... |
945 |
VM_BUG_ON(PageCgroupAcctLRU(pc)); |
a61ed3cec memcg: close race... |
946 947 948 949 950 951 952 953 954 955 |
/* * putback: charge: * SetPageLRU SetPageCgroupUsed * smp_mb smp_mb * PageCgroupUsed && add to memcg LRU PageLRU && add to memcg LRU * * Ensure that one of the two sides adds the page to the memcg * LRU during a race. */ smp_mb(); |
08e552c69 memcg: synchroniz... |
956 |
if (!PageCgroupUsed(pc)) |
894bc3104 Unevictable LRU I... |
957 |
return; |
713735b42 memcg: correctly ... |
958 959 |
/* Ensure pc->mem_cgroup is visible after reading PCG_USED. */ smp_rmb(); |
97a6c37b3 memcg: change pag... |
960 |
mz = page_cgroup_zoneinfo(pc->mem_cgroup, page); |
ece35ca81 memcg: fix LRU ac... |
961 962 |
/* huge page split is done under lru_lock. so, we have no races. */ MEM_CGROUP_ZSTAT(mz, lru) += 1 << compound_order(page); |
4b3bde4c9 memcg: remove the... |
963 964 965 |
SetPageCgroupAcctLRU(pc); if (mem_cgroup_is_root(pc->mem_cgroup)) return; |
08e552c69 memcg: synchroniz... |
966 967 |
list_add(&pc->lru, &mz->lists[lru]); } |
544122e5e memcg: fix LRU ac... |
968 |
|
08e552c69 memcg: synchroniz... |
969 |
/* |
5a6475a4e memcg: fix leak o... |
970 971 972 973 |
* At handling SwapCache and other FUSE stuff, pc->mem_cgroup may be changed * while it's linked to lru because the page may be reused after it's fully * uncharged. To handle that, unlink page_cgroup from LRU when charge it again. * It's done under lock_page and expected that zone->lru_lock isnever held. |
08e552c69 memcg: synchroniz... |
974 |
*/ |
5a6475a4e memcg: fix leak o... |
975 |
static void mem_cgroup_lru_del_before_commit(struct page *page) |
08e552c69 memcg: synchroniz... |
976 |
{ |
544122e5e memcg: fix LRU ac... |
977 978 979 |
unsigned long flags; struct zone *zone = page_zone(page); struct page_cgroup *pc = lookup_page_cgroup(page); |
5a6475a4e memcg: fix leak o... |
980 981 982 983 984 985 986 987 988 989 |
/* * Doing this check without taking ->lru_lock seems wrong but this * is safe. Because if page_cgroup's USED bit is unset, the page * will not be added to any memcg's LRU. If page_cgroup's USED bit is * set, the commit after this will fail, anyway. * This all charge/uncharge is done under some mutual execustion. * So, we don't need to taking care of changes in USED bit. */ if (likely(!PageLRU(page))) return; |
544122e5e memcg: fix LRU ac... |
990 991 992 993 994 995 996 997 |
spin_lock_irqsave(&zone->lru_lock, flags); /* * Forget old LRU when this page_cgroup is *not* used. This Used bit * is guarded by lock_page() because the page is SwapCache. */ if (!PageCgroupUsed(pc)) mem_cgroup_del_lru_list(page, page_lru(page)); spin_unlock_irqrestore(&zone->lru_lock, flags); |
08e552c69 memcg: synchroniz... |
998 |
} |
5a6475a4e memcg: fix leak o... |
999 |
static void mem_cgroup_lru_add_after_commit(struct page *page) |
544122e5e memcg: fix LRU ac... |
1000 1001 1002 1003 |
{ unsigned long flags; struct zone *zone = page_zone(page); struct page_cgroup *pc = lookup_page_cgroup(page); |
a61ed3cec memcg: close race... |
1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 |
/* * putback: charge: * SetPageLRU SetPageCgroupUsed * smp_mb smp_mb * PageCgroupUsed && add to memcg LRU PageLRU && add to memcg LRU * * Ensure that one of the two sides adds the page to the memcg * LRU during a race. */ smp_mb(); |
5a6475a4e memcg: fix leak o... |
1014 1015 1016 |
/* taking care of that the page is added to LRU while we commit it */ if (likely(!PageLRU(page))) return; |
544122e5e memcg: fix LRU ac... |
1017 1018 |
spin_lock_irqsave(&zone->lru_lock, flags); /* link when the page is linked to LRU but page_cgroup isn't */ |
4b3bde4c9 memcg: remove the... |
1019 |
if (PageLRU(page) && !PageCgroupAcctLRU(pc)) |
544122e5e memcg: fix LRU ac... |
1020 1021 1022 |
mem_cgroup_add_lru_list(page, page_lru(page)); spin_unlock_irqrestore(&zone->lru_lock, flags); } |
08e552c69 memcg: synchroniz... |
1023 1024 1025 |
void mem_cgroup_move_lists(struct page *page, enum lru_list from, enum lru_list to) { |
f8d665422 memcg: add mem_cg... |
1026 |
if (mem_cgroup_disabled()) |
08e552c69 memcg: synchroniz... |
1027 1028 1029 |
return; mem_cgroup_del_lru_list(page, from); mem_cgroup_add_lru_list(page, to); |
66e1707bc Memory controller... |
1030 |
} |
3e92041d6 memcg: add mem_cg... |
1031 |
/* |
c0ff4b854 memcg: rename mem... |
1032 |
* Checks whether given mem is same or in the root_mem_cgroup's |
3e92041d6 memcg: add mem_cg... |
1033 1034 |
* hierarchy subtree */ |
c0ff4b854 memcg: rename mem... |
1035 1036 |
static bool mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg, struct mem_cgroup *memcg) |
3e92041d6 memcg: add mem_cg... |
1037 |
{ |
c0ff4b854 memcg: rename mem... |
1038 1039 1040 |
if (root_memcg != memcg) { return (root_memcg->use_hierarchy && css_is_ancestor(&memcg->css, &root_memcg->css)); |
3e92041d6 memcg: add mem_cg... |
1041 1042 1043 1044 |
} return true; } |
c0ff4b854 memcg: rename mem... |
1045 |
int task_in_mem_cgroup(struct task_struct *task, const struct mem_cgroup *memcg) |
4c4a22148 memcontrol: move ... |
1046 1047 |
{ int ret; |
0b7f569e4 memcg: fix OOM ki... |
1048 |
struct mem_cgroup *curr = NULL; |
158e0a2d1 memcg: use find_l... |
1049 |
struct task_struct *p; |
4c4a22148 memcontrol: move ... |
1050 |
|
158e0a2d1 memcg: use find_l... |
1051 1052 1053 1054 1055 |
p = find_lock_task_mm(task); if (!p) return 0; curr = try_get_mem_cgroup_from_mm(p->mm); task_unlock(p); |
0b7f569e4 memcg: fix OOM ki... |
1056 1057 |
if (!curr) return 0; |
d31f56dbf memcg: avoid oom-... |
1058 |
/* |
c0ff4b854 memcg: rename mem... |
1059 |
* We should check use_hierarchy of "memcg" not "curr". Because checking |
d31f56dbf memcg: avoid oom-... |
1060 |
* use_hierarchy of "curr" here make this function true if hierarchy is |
c0ff4b854 memcg: rename mem... |
1061 1062 |
* enabled in "curr" and "curr" is a child of "memcg" in *cgroup* * hierarchy(even if use_hierarchy is disabled in "memcg"). |
d31f56dbf memcg: avoid oom-... |
1063 |
*/ |
c0ff4b854 memcg: rename mem... |
1064 |
ret = mem_cgroup_same_or_subtree(memcg, curr); |
0b7f569e4 memcg: fix OOM ki... |
1065 |
css_put(&curr->css); |
4c4a22148 memcontrol: move ... |
1066 1067 |
return ret; } |
9b272977e memcg: skip scann... |
1068 |
int mem_cgroup_inactive_anon_is_low(struct mem_cgroup *memcg, struct zone *zone) |
14797e236 memcg: add inacti... |
1069 |
{ |
9b272977e memcg: skip scann... |
1070 1071 1072 |
unsigned long inactive_ratio; int nid = zone_to_nid(zone); int zid = zone_idx(zone); |
14797e236 memcg: add inacti... |
1073 |
unsigned long inactive; |
9b272977e memcg: skip scann... |
1074 |
unsigned long active; |
c772be939 memcg: fix calcul... |
1075 |
unsigned long gb; |
14797e236 memcg: add inacti... |
1076 |
|
9b272977e memcg: skip scann... |
1077 1078 1079 1080 |
inactive = mem_cgroup_zone_nr_lru_pages(memcg, nid, zid, BIT(LRU_INACTIVE_ANON)); active = mem_cgroup_zone_nr_lru_pages(memcg, nid, zid, BIT(LRU_ACTIVE_ANON)); |
14797e236 memcg: add inacti... |
1081 |
|
c772be939 memcg: fix calcul... |
1082 1083 1084 1085 1086 |
gb = (inactive + active) >> (30 - PAGE_SHIFT); if (gb) inactive_ratio = int_sqrt(10 * gb); else inactive_ratio = 1; |
9b272977e memcg: skip scann... |
1087 |
return inactive * inactive_ratio < active; |
14797e236 memcg: add inacti... |
1088 |
} |
9b272977e memcg: skip scann... |
1089 |
int mem_cgroup_inactive_file_is_low(struct mem_cgroup *memcg, struct zone *zone) |
56e49d218 vmscan: evict use... |
1090 1091 1092 |
{ unsigned long active; unsigned long inactive; |
9b272977e memcg: skip scann... |
1093 1094 |
int zid = zone_idx(zone); int nid = zone_to_nid(zone); |
56e49d218 vmscan: evict use... |
1095 |
|
9b272977e memcg: skip scann... |
1096 1097 1098 1099 |
inactive = mem_cgroup_zone_nr_lru_pages(memcg, nid, zid, BIT(LRU_INACTIVE_FILE)); active = mem_cgroup_zone_nr_lru_pages(memcg, nid, zid, BIT(LRU_ACTIVE_FILE)); |
56e49d218 vmscan: evict use... |
1100 1101 1102 |
return (active > inactive); } |
3e2f41f1f memcg: add zone_r... |
1103 1104 1105 |
struct zone_reclaim_stat *mem_cgroup_get_reclaim_stat(struct mem_cgroup *memcg, struct zone *zone) { |
13d7e3a2d memcg: convert to... |
1106 |
int nid = zone_to_nid(zone); |
3e2f41f1f memcg: add zone_r... |
1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 |
int zid = zone_idx(zone); struct mem_cgroup_per_zone *mz = mem_cgroup_zoneinfo(memcg, nid, zid); return &mz->reclaim_stat; } struct zone_reclaim_stat * mem_cgroup_get_reclaim_stat_from_page(struct page *page) { struct page_cgroup *pc; struct mem_cgroup_per_zone *mz; if (mem_cgroup_disabled()) return NULL; pc = lookup_page_cgroup(page); |
bd112db87 memcg: fix mem_cg... |
1123 1124 |
if (!PageCgroupUsed(pc)) return NULL; |
713735b42 memcg: correctly ... |
1125 1126 |
/* Ensure pc->mem_cgroup is visible after reading PCG_USED. */ smp_rmb(); |
97a6c37b3 memcg: change pag... |
1127 |
mz = page_cgroup_zoneinfo(pc->mem_cgroup, page); |
3e2f41f1f memcg: add zone_r... |
1128 1129 |
return &mz->reclaim_stat; } |
66e1707bc Memory controller... |
1130 1131 1132 |
unsigned long mem_cgroup_isolate_pages(unsigned long nr_to_scan, struct list_head *dst, unsigned long *scanned, int order, |
4356f21d0 mm: change isolat... |
1133 1134 |
isolate_mode_t mode, struct zone *z, |
66e1707bc Memory controller... |
1135 |
struct mem_cgroup *mem_cont, |
4f98a2fee vmscan: split LRU... |
1136 |
int active, int file) |
66e1707bc Memory controller... |
1137 1138 1139 1140 1141 1142 |
{ unsigned long nr_taken = 0; struct page *page; unsigned long scan; LIST_HEAD(pc_list); struct list_head *src; |
ff7283fa3 bugfix for memory... |
1143 |
struct page_cgroup *pc, *tmp; |
13d7e3a2d memcg: convert to... |
1144 |
int nid = zone_to_nid(z); |
1ecaab2bd per-zone and recl... |
1145 1146 |
int zid = zone_idx(z); struct mem_cgroup_per_zone *mz; |
b7c46d151 mm: drop unneeded... |
1147 |
int lru = LRU_FILE * file + active; |
2ffebca6a memcg: fix lru ro... |
1148 |
int ret; |
66e1707bc Memory controller... |
1149 |
|
cf475ad28 cgroups: add an o... |
1150 |
BUG_ON(!mem_cont); |
1ecaab2bd per-zone and recl... |
1151 |
mz = mem_cgroup_zoneinfo(mem_cont, nid, zid); |
b69408e88 vmscan: Use an in... |
1152 |
src = &mz->lists[lru]; |
66e1707bc Memory controller... |
1153 |
|
ff7283fa3 bugfix for memory... |
1154 1155 |
scan = 0; list_for_each_entry_safe_reverse(pc, tmp, src, lru) { |
436c6541b memcgroup: fix zo... |
1156 |
if (scan >= nr_to_scan) |
ff7283fa3 bugfix for memory... |
1157 |
break; |
08e552c69 memcg: synchroniz... |
1158 |
|
52d4b9ac0 memcg: allocate a... |
1159 1160 |
if (unlikely(!PageCgroupUsed(pc))) continue; |
5564e88ba memcg: condense p... |
1161 |
|
6b3ae58ef memcg: remove dir... |
1162 |
page = lookup_cgroup_page(pc); |
5564e88ba memcg: condense p... |
1163 |
|
436c6541b memcgroup: fix zo... |
1164 |
if (unlikely(!PageLRU(page))) |
ff7283fa3 bugfix for memory... |
1165 |
continue; |
ff7283fa3 bugfix for memory... |
1166 |
|
436c6541b memcgroup: fix zo... |
1167 |
scan++; |
2ffebca6a memcg: fix lru ro... |
1168 1169 1170 |
ret = __isolate_lru_page(page, mode, file); switch (ret) { case 0: |
66e1707bc Memory controller... |
1171 |
list_move(&page->lru, dst); |
2ffebca6a memcg: fix lru ro... |
1172 |
mem_cgroup_del_lru(page); |
2c888cfbc thp: fix anon mem... |
1173 |
nr_taken += hpage_nr_pages(page); |
2ffebca6a memcg: fix lru ro... |
1174 1175 1176 1177 1178 1179 1180 |
break; case -EBUSY: /* we don't affect global LRU but rotate in our LRU */ mem_cgroup_rotate_lru_list(page, page_lru(page)); break; default: break; |
66e1707bc Memory controller... |
1181 1182 |
} } |
66e1707bc Memory controller... |
1183 |
*scanned = scan; |
cc8e970c3 memcg: add mm_vms... |
1184 1185 1186 |
trace_mm_vmscan_memcg_isolate(0, nr_to_scan, scan, nr_taken, 0, 0, 0, mode); |
66e1707bc Memory controller... |
1187 1188 |
return nr_taken; } |
6d61ef409 memcg: memory cgr... |
1189 1190 |
#define mem_cgroup_from_res_counter(counter, member) \ container_of(counter, struct mem_cgroup, member) |
19942822d memcg: prevent en... |
1191 |
/** |
9d11ea9f1 memcg: simplify t... |
1192 1193 |
* mem_cgroup_margin - calculate chargeable space of a memory cgroup * @mem: the memory cgroup |
19942822d memcg: prevent en... |
1194 |
* |
9d11ea9f1 memcg: simplify t... |
1195 |
* Returns the maximum amount of memory @mem can be charged with, in |
7ec99d621 memcg: unify char... |
1196 |
* pages. |
19942822d memcg: prevent en... |
1197 |
*/ |
c0ff4b854 memcg: rename mem... |
1198 |
static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg) |
19942822d memcg: prevent en... |
1199 |
{ |
9d11ea9f1 memcg: simplify t... |
1200 |
unsigned long long margin; |
c0ff4b854 memcg: rename mem... |
1201 |
margin = res_counter_margin(&memcg->res); |
9d11ea9f1 memcg: simplify t... |
1202 |
if (do_swap_account) |
c0ff4b854 memcg: rename mem... |
1203 |
margin = min(margin, res_counter_margin(&memcg->memsw)); |
7ec99d621 memcg: unify char... |
1204 |
return margin >> PAGE_SHIFT; |
19942822d memcg: prevent en... |
1205 |
} |
1f4c025b5 memcg: export mem... |
1206 |
int mem_cgroup_swappiness(struct mem_cgroup *memcg) |
a7885eb8a memcg: swappiness |
1207 1208 |
{ struct cgroup *cgrp = memcg->css.cgroup; |
a7885eb8a memcg: swappiness |
1209 1210 1211 1212 |
/* root ? */ if (cgrp->parent == NULL) return vm_swappiness; |
bf1ff2635 memcg: remove mem... |
1213 |
return memcg->swappiness; |
a7885eb8a memcg: swappiness |
1214 |
} |
c0ff4b854 memcg: rename mem... |
1215 |
static void mem_cgroup_start_move(struct mem_cgroup *memcg) |
32047e2a8 memcg: avoid lock... |
1216 1217 |
{ int cpu; |
1489ebad8 memcg: cpu hotplu... |
1218 1219 |
get_online_cpus(); |
c0ff4b854 memcg: rename mem... |
1220 |
spin_lock(&memcg->pcp_counter_lock); |
1489ebad8 memcg: cpu hotplu... |
1221 |
for_each_online_cpu(cpu) |
c0ff4b854 memcg: rename mem... |
1222 1223 1224 |
per_cpu(memcg->stat->count[MEM_CGROUP_ON_MOVE], cpu) += 1; memcg->nocpu_base.count[MEM_CGROUP_ON_MOVE] += 1; spin_unlock(&memcg->pcp_counter_lock); |
1489ebad8 memcg: cpu hotplu... |
1225 |
put_online_cpus(); |
32047e2a8 memcg: avoid lock... |
1226 1227 1228 |
synchronize_rcu(); } |
c0ff4b854 memcg: rename mem... |
1229 |
static void mem_cgroup_end_move(struct mem_cgroup *memcg) |
32047e2a8 memcg: avoid lock... |
1230 1231 |
{ int cpu; |
c0ff4b854 memcg: rename mem... |
1232 |
if (!memcg) |
32047e2a8 memcg: avoid lock... |
1233 |
return; |
1489ebad8 memcg: cpu hotplu... |
1234 |
get_online_cpus(); |
c0ff4b854 memcg: rename mem... |
1235 |
spin_lock(&memcg->pcp_counter_lock); |
1489ebad8 memcg: cpu hotplu... |
1236 |
for_each_online_cpu(cpu) |
c0ff4b854 memcg: rename mem... |
1237 1238 1239 |
per_cpu(memcg->stat->count[MEM_CGROUP_ON_MOVE], cpu) -= 1; memcg->nocpu_base.count[MEM_CGROUP_ON_MOVE] -= 1; spin_unlock(&memcg->pcp_counter_lock); |
1489ebad8 memcg: cpu hotplu... |
1240 |
put_online_cpus(); |
32047e2a8 memcg: avoid lock... |
1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 |
} /* * 2 routines for checking "mem" is under move_account() or not. * * mem_cgroup_stealed() - checking a cgroup is mc.from or not. This is used * for avoiding race in accounting. If true, * pc->mem_cgroup may be overwritten. * * mem_cgroup_under_move() - checking a cgroup is mc.from or mc.to or * under hierarchy of moving cgroups. This is for * waiting at hith-memory prressure caused by "move". */ |
c0ff4b854 memcg: rename mem... |
1253 |
static bool mem_cgroup_stealed(struct mem_cgroup *memcg) |
32047e2a8 memcg: avoid lock... |
1254 1255 |
{ VM_BUG_ON(!rcu_read_lock_held()); |
c0ff4b854 memcg: rename mem... |
1256 |
return this_cpu_read(memcg->stat->count[MEM_CGROUP_ON_MOVE]) > 0; |
32047e2a8 memcg: avoid lock... |
1257 |
} |
4b5343346 memcg: clean up t... |
1258 |
|
c0ff4b854 memcg: rename mem... |
1259 |
static bool mem_cgroup_under_move(struct mem_cgroup *memcg) |
4b5343346 memcg: clean up t... |
1260 |
{ |
2bd9bb206 memcg: clean up w... |
1261 1262 |
struct mem_cgroup *from; struct mem_cgroup *to; |
4b5343346 memcg: clean up t... |
1263 |
bool ret = false; |
2bd9bb206 memcg: clean up w... |
1264 1265 1266 1267 1268 1269 1270 1271 1272 |
/* * Unlike task_move routines, we access mc.to, mc.from not under * mutual exclusion by cgroup_mutex. Here, we take spinlock instead. */ spin_lock(&mc.lock); from = mc.from; to = mc.to; if (!from) goto unlock; |
3e92041d6 memcg: add mem_cg... |
1273 |
|
c0ff4b854 memcg: rename mem... |
1274 1275 |
ret = mem_cgroup_same_or_subtree(memcg, from) || mem_cgroup_same_or_subtree(memcg, to); |
2bd9bb206 memcg: clean up w... |
1276 1277 |
unlock: spin_unlock(&mc.lock); |
4b5343346 memcg: clean up t... |
1278 1279 |
return ret; } |
c0ff4b854 memcg: rename mem... |
1280 |
static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg) |
4b5343346 memcg: clean up t... |
1281 1282 |
{ if (mc.moving_task && current != mc.moving_task) { |
c0ff4b854 memcg: rename mem... |
1283 |
if (mem_cgroup_under_move(memcg)) { |
4b5343346 memcg: clean up t... |
1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 |
DEFINE_WAIT(wait); prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE); /* moving charge context might have finished. */ if (mc.moving_task) schedule(); finish_wait(&mc.waitq, &wait); return true; } } return false; } |
e222432bf memcg: show memcg... |
1295 |
/** |
6a6135b64 memcg: typo in co... |
1296 |
* mem_cgroup_print_oom_info: Called from OOM with tasklist_lock held in read mode. |
e222432bf memcg: show memcg... |
1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 |
* @memcg: The memory cgroup that went over limit * @p: Task that is going to be killed * * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is * enabled */ void mem_cgroup_print_oom_info(struct mem_cgroup *memcg, struct task_struct *p) { struct cgroup *task_cgrp; struct cgroup *mem_cgrp; /* * Need a buffer in BSS, can't rely on allocations. The code relies * on the assumption that OOM is serialized for memory controller. * If this assumption is broken, revisit this code. */ static char memcg_name[PATH_MAX]; int ret; |
d31f56dbf memcg: avoid oom-... |
1314 |
if (!memcg || !p) |
e222432bf memcg: show memcg... |
1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 |
return; rcu_read_lock(); mem_cgrp = memcg->css.cgroup; task_cgrp = task_cgroup(p, mem_cgroup_subsys_id); ret = cgroup_path(task_cgrp, memcg_name, PATH_MAX); if (ret < 0) { /* * Unfortunately, we are unable to convert to a useful name * But we'll still print out the usage information */ rcu_read_unlock(); goto done; } rcu_read_unlock(); printk(KERN_INFO "Task in %s killed", memcg_name); rcu_read_lock(); ret = cgroup_path(mem_cgrp, memcg_name, PATH_MAX); if (ret < 0) { rcu_read_unlock(); goto done; } rcu_read_unlock(); /* * Continues from above, so we don't need an KERN_ level */ printk(KERN_CONT " as a result of limit of %s ", memcg_name); done: printk(KERN_INFO "memory: usage %llukB, limit %llukB, failcnt %llu ", res_counter_read_u64(&memcg->res, RES_USAGE) >> 10, res_counter_read_u64(&memcg->res, RES_LIMIT) >> 10, res_counter_read_u64(&memcg->res, RES_FAILCNT)); printk(KERN_INFO "memory+swap: usage %llukB, limit %llukB, " "failcnt %llu ", res_counter_read_u64(&memcg->memsw, RES_USAGE) >> 10, res_counter_read_u64(&memcg->memsw, RES_LIMIT) >> 10, res_counter_read_u64(&memcg->memsw, RES_FAILCNT)); } |
81d39c20f memcg: fix shrink... |
1363 1364 1365 1366 |
/* * This function returns the number of memcg under hierarchy tree. Returns * 1(self count) if no children. */ |
c0ff4b854 memcg: rename mem... |
1367 |
static int mem_cgroup_count_children(struct mem_cgroup *memcg) |
81d39c20f memcg: fix shrink... |
1368 1369 |
{ int num = 0; |
7d74b06f2 memcg: use for_ea... |
1370 |
struct mem_cgroup *iter; |
c0ff4b854 memcg: rename mem... |
1371 |
for_each_mem_cgroup_tree(iter, memcg) |
7d74b06f2 memcg: use for_ea... |
1372 |
num++; |
81d39c20f memcg: fix shrink... |
1373 1374 |
return num; } |
6d61ef409 memcg: memory cgr... |
1375 |
/* |
a63d83f42 oom: badness heur... |
1376 1377 1378 1379 1380 1381 |
* Return the memory (and swap, if configured) limit for a memcg. */ u64 mem_cgroup_get_limit(struct mem_cgroup *memcg) { u64 limit; u64 memsw; |
f3e8eb70b memcg: fix unit m... |
1382 1383 |
limit = res_counter_read_u64(&memcg->res, RES_LIMIT); limit += total_swap_pages << PAGE_SHIFT; |
a63d83f42 oom: badness heur... |
1384 1385 1386 1387 1388 1389 1390 1391 1392 |
memsw = res_counter_read_u64(&memcg->memsw, RES_LIMIT); /* * If memsw is finite and limits the amount of swap space available * to this memcg, return that limit. */ return min(limit, memsw); } /* |
04046e1a0 memcg: use CSS ID |
1393 1394 1395 1396 1397 |
* Visit the first child (need not be the first child as per the ordering * of the cgroup list, since we track last_scanned_child) of @mem and use * that to reclaim free pages from. */ static struct mem_cgroup * |
c0ff4b854 memcg: rename mem... |
1398 |
mem_cgroup_select_victim(struct mem_cgroup *root_memcg) |
04046e1a0 memcg: use CSS ID |
1399 1400 1401 1402 |
{ struct mem_cgroup *ret = NULL; struct cgroup_subsys_state *css; int nextid, found; |
c0ff4b854 memcg: rename mem... |
1403 1404 1405 |
if (!root_memcg->use_hierarchy) { css_get(&root_memcg->css); ret = root_memcg; |
04046e1a0 memcg: use CSS ID |
1406 1407 1408 1409 |
} while (!ret) { rcu_read_lock(); |
c0ff4b854 memcg: rename mem... |
1410 1411 |
nextid = root_memcg->last_scanned_child + 1; css = css_get_next(&mem_cgroup_subsys, nextid, &root_memcg->css, |
04046e1a0 memcg: use CSS ID |
1412 1413 1414 1415 1416 1417 |
&found); if (css && css_tryget(css)) ret = container_of(css, struct mem_cgroup, css); rcu_read_unlock(); /* Updates scanning parameter */ |
04046e1a0 memcg: use CSS ID |
1418 1419 |
if (!css) { /* this means start scan from ID:1 */ |
c0ff4b854 memcg: rename mem... |
1420 |
root_memcg->last_scanned_child = 0; |
04046e1a0 memcg: use CSS ID |
1421 |
} else |
c0ff4b854 memcg: rename mem... |
1422 |
root_memcg->last_scanned_child = found; |
04046e1a0 memcg: use CSS ID |
1423 1424 1425 1426 |
} return ret; } |
4d0c066d2 memcg: fix reclai... |
1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 |
/** * test_mem_cgroup_node_reclaimable * @mem: the target memcg * @nid: the node ID to be checked. * @noswap : specify true here if the user wants flle only information. * * This function returns whether the specified memcg contains any * reclaimable pages on a node. Returns true if there are any reclaimable * pages in the node. */ |
c0ff4b854 memcg: rename mem... |
1437 |
static bool test_mem_cgroup_node_reclaimable(struct mem_cgroup *memcg, |
4d0c066d2 memcg: fix reclai... |
1438 1439 |
int nid, bool noswap) { |
c0ff4b854 memcg: rename mem... |
1440 |
if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_FILE)) |
4d0c066d2 memcg: fix reclai... |
1441 1442 1443 |
return true; if (noswap || !total_swap_pages) return false; |
c0ff4b854 memcg: rename mem... |
1444 |
if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_ANON)) |
4d0c066d2 memcg: fix reclai... |
1445 1446 1447 1448 |
return true; return false; } |
889976dbc memcg: reclaim me... |
1449 1450 1451 1452 1453 1454 1455 1456 |
#if MAX_NUMNODES > 1 /* * Always updating the nodemask is not very good - even if we have an empty * list or the wrong list here, we can start from some node and traverse all * nodes based on the zonelist. So update the list loosely once per 10 secs. * */ |
c0ff4b854 memcg: rename mem... |
1457 |
static void mem_cgroup_may_update_nodemask(struct mem_cgroup *memcg) |
889976dbc memcg: reclaim me... |
1458 1459 |
{ int nid; |
453a9bf34 memcg: fix numa s... |
1460 1461 1462 1463 |
/* * numainfo_events > 0 means there was at least NUMAINFO_EVENTS_TARGET * pagein/pageout changes since the last update. */ |
c0ff4b854 memcg: rename mem... |
1464 |
if (!atomic_read(&memcg->numainfo_events)) |
453a9bf34 memcg: fix numa s... |
1465 |
return; |
c0ff4b854 memcg: rename mem... |
1466 |
if (atomic_inc_return(&memcg->numainfo_updating) > 1) |
889976dbc memcg: reclaim me... |
1467 |
return; |
889976dbc memcg: reclaim me... |
1468 |
/* make a nodemask where this memcg uses memory from */ |
c0ff4b854 memcg: rename mem... |
1469 |
memcg->scan_nodes = node_states[N_HIGH_MEMORY]; |
889976dbc memcg: reclaim me... |
1470 1471 |
for_each_node_mask(nid, node_states[N_HIGH_MEMORY]) { |
c0ff4b854 memcg: rename mem... |
1472 1473 |
if (!test_mem_cgroup_node_reclaimable(memcg, nid, false)) node_clear(nid, memcg->scan_nodes); |
889976dbc memcg: reclaim me... |
1474 |
} |
453a9bf34 memcg: fix numa s... |
1475 |
|
c0ff4b854 memcg: rename mem... |
1476 1477 |
atomic_set(&memcg->numainfo_events, 0); atomic_set(&memcg->numainfo_updating, 0); |
889976dbc memcg: reclaim me... |
1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 |
} /* * Selecting a node where we start reclaim from. Because what we need is just * reducing usage counter, start from anywhere is O,K. Considering * memory reclaim from current node, there are pros. and cons. * * Freeing memory from current node means freeing memory from a node which * we'll use or we've used. So, it may make LRU bad. And if several threads * hit limits, it will see a contention on a node. But freeing from remote * node means more costs for memory reclaim because of memory latency. * * Now, we use round-robin. Better algorithm is welcomed. */ |
c0ff4b854 memcg: rename mem... |
1492 |
int mem_cgroup_select_victim_node(struct mem_cgroup *memcg) |
889976dbc memcg: reclaim me... |
1493 1494 |
{ int node; |
c0ff4b854 memcg: rename mem... |
1495 1496 |
mem_cgroup_may_update_nodemask(memcg); node = memcg->last_scanned_node; |
889976dbc memcg: reclaim me... |
1497 |
|
c0ff4b854 memcg: rename mem... |
1498 |
node = next_node(node, memcg->scan_nodes); |
889976dbc memcg: reclaim me... |
1499 |
if (node == MAX_NUMNODES) |
c0ff4b854 memcg: rename mem... |
1500 |
node = first_node(memcg->scan_nodes); |
889976dbc memcg: reclaim me... |
1501 1502 1503 1504 1505 1506 1507 1508 |
/* * We call this when we hit limit, not when pages are added to LRU. * No LRU may hold pages because all pages are UNEVICTABLE or * memcg is too small and all pages are not on LRU. In that case, * we use curret node. */ if (unlikely(node == MAX_NUMNODES)) node = numa_node_id(); |
c0ff4b854 memcg: rename mem... |
1509 |
memcg->last_scanned_node = node; |
889976dbc memcg: reclaim me... |
1510 1511 |
return node; } |
4d0c066d2 memcg: fix reclai... |
1512 1513 1514 1515 1516 1517 |
/* * 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. */ |
c0ff4b854 memcg: rename mem... |
1518 |
bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap) |
4d0c066d2 memcg: fix reclai... |
1519 1520 1521 1522 1523 1524 1525 |
{ int nid; /* * quick check...making use of scan_node. * We can skip unused nodes. */ |
c0ff4b854 memcg: rename mem... |
1526 1527 |
if (!nodes_empty(memcg->scan_nodes)) { for (nid = first_node(memcg->scan_nodes); |
4d0c066d2 memcg: fix reclai... |
1528 |
nid < MAX_NUMNODES; |
c0ff4b854 memcg: rename mem... |
1529 |
nid = next_node(nid, memcg->scan_nodes)) { |
4d0c066d2 memcg: fix reclai... |
1530 |
|
c0ff4b854 memcg: rename mem... |
1531 |
if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap)) |
4d0c066d2 memcg: fix reclai... |
1532 1533 1534 1535 1536 1537 1538 |
return true; } } /* * Check rest of nodes. */ for_each_node_state(nid, N_HIGH_MEMORY) { |
c0ff4b854 memcg: rename mem... |
1539 |
if (node_isset(nid, memcg->scan_nodes)) |
4d0c066d2 memcg: fix reclai... |
1540 |
continue; |
c0ff4b854 memcg: rename mem... |
1541 |
if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap)) |
4d0c066d2 memcg: fix reclai... |
1542 1543 1544 1545 |
return true; } return false; } |
889976dbc memcg: reclaim me... |
1546 |
#else |
c0ff4b854 memcg: rename mem... |
1547 |
int mem_cgroup_select_victim_node(struct mem_cgroup *memcg) |
889976dbc memcg: reclaim me... |
1548 1549 1550 |
{ return 0; } |
4d0c066d2 memcg: fix reclai... |
1551 |
|
c0ff4b854 memcg: rename mem... |
1552 |
bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap) |
4d0c066d2 memcg: fix reclai... |
1553 |
{ |
c0ff4b854 memcg: rename mem... |
1554 |
return test_mem_cgroup_node_reclaimable(memcg, 0, noswap); |
4d0c066d2 memcg: fix reclai... |
1555 |
} |
889976dbc memcg: reclaim me... |
1556 |
#endif |
04046e1a0 memcg: use CSS ID |
1557 1558 1559 1560 |
/* * Scan the hierarchy if needed to reclaim memory. We remember the last child * we reclaimed from, so that we don't end up penalizing one child extensively * based on its position in the children list. |
6d61ef409 memcg: memory cgr... |
1561 |
* |
c0ff4b854 memcg: rename mem... |
1562 |
* root_memcg is the original ancestor that we've been reclaim from. |
04046e1a0 memcg: use CSS ID |
1563 |
* |
c0ff4b854 memcg: rename mem... |
1564 |
* We give up and return to the caller when we visit root_memcg twice. |
04046e1a0 memcg: use CSS ID |
1565 |
* (other groups can be removed while we're walking....) |
81d39c20f memcg: fix shrink... |
1566 1567 |
* * If shrink==true, for avoiding to free too much, this returns immedieately. |
6d61ef409 memcg: memory cgr... |
1568 |
*/ |
c0ff4b854 memcg: rename mem... |
1569 |
static int mem_cgroup_hierarchical_reclaim(struct mem_cgroup *root_memcg, |
4e4169535 memory controller... |
1570 |
struct zone *zone, |
75822b449 memory controller... |
1571 |
gfp_t gfp_mask, |
0ae5e89c6 memcg: count the ... |
1572 1573 |
unsigned long reclaim_options, unsigned long *total_scanned) |
6d61ef409 memcg: memory cgr... |
1574 |
{ |
04046e1a0 memcg: use CSS ID |
1575 1576 1577 |
struct mem_cgroup *victim; int ret, total = 0; int loop = 0; |
75822b449 memory controller... |
1578 1579 |
bool noswap = reclaim_options & MEM_CGROUP_RECLAIM_NOSWAP; bool shrink = reclaim_options & MEM_CGROUP_RECLAIM_SHRINK; |
4e4169535 memory controller... |
1580 |
bool check_soft = reclaim_options & MEM_CGROUP_RECLAIM_SOFT; |
9d11ea9f1 memcg: simplify t... |
1581 |
unsigned long excess; |
185efc0f9 memcg: Revert "me... |
1582 |
unsigned long nr_scanned; |
9d11ea9f1 memcg: simplify t... |
1583 |
|
c0ff4b854 memcg: rename mem... |
1584 |
excess = res_counter_soft_limit_excess(&root_memcg->res) >> PAGE_SHIFT; |
04046e1a0 memcg: use CSS ID |
1585 |
|
22a668d7c memcg: fix behavi... |
1586 |
/* If memsw_is_minimum==1, swap-out is of-no-use. */ |
c0ff4b854 memcg: rename mem... |
1587 |
if (!check_soft && !shrink && root_memcg->memsw_is_minimum) |
22a668d7c memcg: fix behavi... |
1588 |
noswap = true; |
4e4169535 memory controller... |
1589 |
while (1) { |
c0ff4b854 memcg: rename mem... |
1590 1591 |
victim = mem_cgroup_select_victim(root_memcg); if (victim == root_memcg) { |
04046e1a0 memcg: use CSS ID |
1592 |
loop++; |
fbc29a25e memcg: avoid perc... |
1593 1594 1595 1596 1597 1598 1599 |
/* * We are not draining per cpu cached charges during * soft limit reclaim because global reclaim doesn't * care about charges. It tries to free some memory and * charges will not give any. */ if (!check_soft && loop >= 1) |
c0ff4b854 memcg: rename mem... |
1600 |
drain_all_stock_async(root_memcg); |
4e4169535 memory controller... |
1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 |
if (loop >= 2) { /* * If we have not been able to reclaim * anything, it might because there are * no reclaimable pages under this hierarchy */ if (!check_soft || !total) { css_put(&victim->css); break; } /* |
25985edce Fix common misspe... |
1612 |
* We want to do more targeted reclaim. |
4e4169535 memory controller... |
1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 |
* excess >> 2 is not to excessive so as to * reclaim too much, nor too less that we keep * coming back to reclaim from this cgroup */ if (total >= (excess >> 2) || (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS)) { css_put(&victim->css); break; } } } |
4d0c066d2 memcg: fix reclai... |
1624 |
if (!mem_cgroup_reclaimable(victim, noswap)) { |
04046e1a0 memcg: use CSS ID |
1625 1626 |
/* this cgroup's local usage == 0 */ css_put(&victim->css); |
6d61ef409 memcg: memory cgr... |
1627 1628 |
continue; } |
04046e1a0 memcg: use CSS ID |
1629 |
/* we use swappiness of local cgroup */ |
0ae5e89c6 memcg: count the ... |
1630 |
if (check_soft) { |
4e4169535 memory controller... |
1631 |
ret = mem_cgroup_shrink_node_zone(victim, gfp_mask, |
185efc0f9 memcg: Revert "me... |
1632 1633 |
noswap, zone, &nr_scanned); *total_scanned += nr_scanned; |
0ae5e89c6 memcg: count the ... |
1634 |
} else |
4e4169535 memory controller... |
1635 |
ret = try_to_free_mem_cgroup_pages(victim, gfp_mask, |
185efc0f9 memcg: Revert "me... |
1636 |
noswap); |
04046e1a0 memcg: use CSS ID |
1637 |
css_put(&victim->css); |
81d39c20f memcg: fix shrink... |
1638 1639 1640 1641 1642 1643 1644 |
/* * At shrinking usage, we can't check we should stop here or * reclaim more. It's depends on callers. last_scanned_child * will work enough for keeping fairness under tree. */ if (shrink) return ret; |
04046e1a0 memcg: use CSS ID |
1645 |
total += ret; |
4e4169535 memory controller... |
1646 |
if (check_soft) { |
c0ff4b854 memcg: rename mem... |
1647 |
if (!res_counter_soft_limit_excess(&root_memcg->res)) |
4e4169535 memory controller... |
1648 |
return total; |
c0ff4b854 memcg: rename mem... |
1649 |
} else if (mem_cgroup_margin(root_memcg)) |
4fd14ebf6 memcg: remove unu... |
1650 |
return total; |
6d61ef409 memcg: memory cgr... |
1651 |
} |
04046e1a0 memcg: use CSS ID |
1652 |
return total; |
6d61ef409 memcg: memory cgr... |
1653 |
} |
867578cbc memcg: fix oom ki... |
1654 1655 1656 |
/* * Check OOM-Killer is already running under our hierarchy. * If someone is running, return false. |
1af8efe96 memcg: change mem... |
1657 |
* Has to be called with memcg_oom_lock |
867578cbc memcg: fix oom ki... |
1658 |
*/ |
c0ff4b854 memcg: rename mem... |
1659 |
static bool mem_cgroup_oom_lock(struct mem_cgroup *memcg) |
867578cbc memcg: fix oom ki... |
1660 |
{ |
79dfdaccd memcg: make oom_l... |
1661 1662 |
struct mem_cgroup *iter, *failed = NULL; bool cond = true; |
a636b327f memcg: avoid unne... |
1663 |
|
c0ff4b854 memcg: rename mem... |
1664 |
for_each_mem_cgroup_tree_cond(iter, memcg, cond) { |
23751be00 memcg: fix hierar... |
1665 |
if (iter->oom_lock) { |
79dfdaccd memcg: make oom_l... |
1666 1667 1668 1669 |
/* * this subtree of our hierarchy is already locked * so we cannot give a lock. */ |
79dfdaccd memcg: make oom_l... |
1670 1671 |
failed = iter; cond = false; |
23751be00 memcg: fix hierar... |
1672 1673 |
} else iter->oom_lock = true; |
7d74b06f2 memcg: use for_ea... |
1674 |
} |
867578cbc memcg: fix oom ki... |
1675 |
|
79dfdaccd memcg: make oom_l... |
1676 |
if (!failed) |
23751be00 memcg: fix hierar... |
1677 |
return true; |
79dfdaccd memcg: make oom_l... |
1678 1679 1680 1681 1682 1683 |
/* * OK, we failed to lock the whole subtree so we have to clean up * what we set up to the failing subtree */ cond = true; |
c0ff4b854 memcg: rename mem... |
1684 |
for_each_mem_cgroup_tree_cond(iter, memcg, cond) { |
79dfdaccd memcg: make oom_l... |
1685 1686 1687 1688 1689 1690 |
if (iter == failed) { cond = false; continue; } iter->oom_lock = false; } |
23751be00 memcg: fix hierar... |
1691 |
return false; |
a636b327f memcg: avoid unne... |
1692 |
} |
0b7f569e4 memcg: fix OOM ki... |
1693 |
|
79dfdaccd memcg: make oom_l... |
1694 |
/* |
1af8efe96 memcg: change mem... |
1695 |
* Has to be called with memcg_oom_lock |
79dfdaccd memcg: make oom_l... |
1696 |
*/ |
c0ff4b854 memcg: rename mem... |
1697 |
static int mem_cgroup_oom_unlock(struct mem_cgroup *memcg) |
0b7f569e4 memcg: fix OOM ki... |
1698 |
{ |
7d74b06f2 memcg: use for_ea... |
1699 |
struct mem_cgroup *iter; |
c0ff4b854 memcg: rename mem... |
1700 |
for_each_mem_cgroup_tree(iter, memcg) |
79dfdaccd memcg: make oom_l... |
1701 1702 1703 |
iter->oom_lock = false; return 0; } |
c0ff4b854 memcg: rename mem... |
1704 |
static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg) |
79dfdaccd memcg: make oom_l... |
1705 1706 |
{ struct mem_cgroup *iter; |
c0ff4b854 memcg: rename mem... |
1707 |
for_each_mem_cgroup_tree(iter, memcg) |
79dfdaccd memcg: make oom_l... |
1708 1709 |
atomic_inc(&iter->under_oom); } |
c0ff4b854 memcg: rename mem... |
1710 |
static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg) |
79dfdaccd memcg: make oom_l... |
1711 1712 |
{ struct mem_cgroup *iter; |
867578cbc memcg: fix oom ki... |
1713 1714 1715 1716 1717 |
/* * When a new child is created while the hierarchy is under oom, * mem_cgroup_oom_lock() may not be called. We have to use * atomic_add_unless() here. */ |
c0ff4b854 memcg: rename mem... |
1718 |
for_each_mem_cgroup_tree(iter, memcg) |
79dfdaccd memcg: make oom_l... |
1719 |
atomic_add_unless(&iter->under_oom, -1, 0); |
0b7f569e4 memcg: fix OOM ki... |
1720 |
} |
1af8efe96 memcg: change mem... |
1721 |
static DEFINE_SPINLOCK(memcg_oom_lock); |
867578cbc memcg: fix oom ki... |
1722 |
static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq); |
dc98df5a1 memcg: oom wakeup... |
1723 1724 1725 1726 1727 1728 1729 1730 |
struct oom_wait_info { struct mem_cgroup *mem; wait_queue_t wait; }; static int memcg_oom_wake_function(wait_queue_t *wait, unsigned mode, int sync, void *arg) { |
c0ff4b854 memcg: rename mem... |
1731 1732 |
struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg, *oom_wait_memcg; |
dc98df5a1 memcg: oom wakeup... |
1733 1734 1735 |
struct oom_wait_info *oom_wait_info; oom_wait_info = container_of(wait, struct oom_wait_info, wait); |
c0ff4b854 memcg: rename mem... |
1736 |
oom_wait_memcg = oom_wait_info->mem; |
dc98df5a1 memcg: oom wakeup... |
1737 |
|
dc98df5a1 memcg: oom wakeup... |
1738 1739 1740 1741 |
/* * Both of oom_wait_info->mem and wake_mem are stable under us. * Then we can use css_is_ancestor without taking care of RCU. */ |
c0ff4b854 memcg: rename mem... |
1742 1743 |
if (!mem_cgroup_same_or_subtree(oom_wait_memcg, wake_memcg) && !mem_cgroup_same_or_subtree(wake_memcg, oom_wait_memcg)) |
dc98df5a1 memcg: oom wakeup... |
1744 |
return 0; |
dc98df5a1 memcg: oom wakeup... |
1745 1746 |
return autoremove_wake_function(wait, mode, sync, arg); } |
c0ff4b854 memcg: rename mem... |
1747 |
static void memcg_wakeup_oom(struct mem_cgroup *memcg) |
dc98df5a1 memcg: oom wakeup... |
1748 |
{ |
c0ff4b854 memcg: rename mem... |
1749 1750 |
/* for filtering, pass "memcg" as argument. */ __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg); |
dc98df5a1 memcg: oom wakeup... |
1751 |
} |
c0ff4b854 memcg: rename mem... |
1752 |
static void memcg_oom_recover(struct mem_cgroup *memcg) |
3c11ecf44 memcg: oom kill d... |
1753 |
{ |
c0ff4b854 memcg: rename mem... |
1754 1755 |
if (memcg && atomic_read(&memcg->under_oom)) memcg_wakeup_oom(memcg); |
3c11ecf44 memcg: oom kill d... |
1756 |
} |
867578cbc memcg: fix oom ki... |
1757 1758 1759 |
/* * try to call OOM killer. returns false if we should exit memory-reclaim loop. */ |
c0ff4b854 memcg: rename mem... |
1760 |
bool mem_cgroup_handle_oom(struct mem_cgroup *memcg, gfp_t mask) |
0b7f569e4 memcg: fix OOM ki... |
1761 |
{ |
dc98df5a1 memcg: oom wakeup... |
1762 |
struct oom_wait_info owait; |
3c11ecf44 memcg: oom kill d... |
1763 |
bool locked, need_to_kill; |
867578cbc memcg: fix oom ki... |
1764 |
|
c0ff4b854 memcg: rename mem... |
1765 |
owait.mem = memcg; |
dc98df5a1 memcg: oom wakeup... |
1766 1767 1768 1769 |
owait.wait.flags = 0; owait.wait.func = memcg_oom_wake_function; owait.wait.private = current; INIT_LIST_HEAD(&owait.wait.task_list); |
3c11ecf44 memcg: oom kill d... |
1770 |
need_to_kill = true; |
c0ff4b854 memcg: rename mem... |
1771 |
mem_cgroup_mark_under_oom(memcg); |
79dfdaccd memcg: make oom_l... |
1772 |
|
c0ff4b854 memcg: rename mem... |
1773 |
/* At first, try to OOM lock hierarchy under memcg.*/ |
1af8efe96 memcg: change mem... |
1774 |
spin_lock(&memcg_oom_lock); |
c0ff4b854 memcg: rename mem... |
1775 |
locked = mem_cgroup_oom_lock(memcg); |
867578cbc memcg: fix oom ki... |
1776 1777 1778 1779 1780 |
/* * Even if signal_pending(), we can't quit charge() loop without * accounting. So, UNINTERRUPTIBLE is appropriate. But SIGKILL * under OOM is always welcomed, use TASK_KILLABLE here. */ |
3c11ecf44 memcg: oom kill d... |
1781 |
prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE); |
c0ff4b854 memcg: rename mem... |
1782 |
if (!locked || memcg->oom_kill_disable) |
3c11ecf44 memcg: oom kill d... |
1783 1784 |
need_to_kill = false; if (locked) |
c0ff4b854 memcg: rename mem... |
1785 |
mem_cgroup_oom_notify(memcg); |
1af8efe96 memcg: change mem... |
1786 |
spin_unlock(&memcg_oom_lock); |
867578cbc memcg: fix oom ki... |
1787 |
|
3c11ecf44 memcg: oom kill d... |
1788 1789 |
if (need_to_kill) { finish_wait(&memcg_oom_waitq, &owait.wait); |
c0ff4b854 memcg: rename mem... |
1790 |
mem_cgroup_out_of_memory(memcg, mask); |
3c11ecf44 memcg: oom kill d... |
1791 |
} else { |
867578cbc memcg: fix oom ki... |
1792 |
schedule(); |
dc98df5a1 memcg: oom wakeup... |
1793 |
finish_wait(&memcg_oom_waitq, &owait.wait); |
867578cbc memcg: fix oom ki... |
1794 |
} |
1af8efe96 memcg: change mem... |
1795 |
spin_lock(&memcg_oom_lock); |
79dfdaccd memcg: make oom_l... |
1796 |
if (locked) |
c0ff4b854 memcg: rename mem... |
1797 1798 |
mem_cgroup_oom_unlock(memcg); memcg_wakeup_oom(memcg); |
1af8efe96 memcg: change mem... |
1799 |
spin_unlock(&memcg_oom_lock); |
867578cbc memcg: fix oom ki... |
1800 |
|
c0ff4b854 memcg: rename mem... |
1801 |
mem_cgroup_unmark_under_oom(memcg); |
79dfdaccd memcg: make oom_l... |
1802 |
|
867578cbc memcg: fix oom ki... |
1803 1804 1805 |
if (test_thread_flag(TIF_MEMDIE) || fatal_signal_pending(current)) return false; /* Give chance to dying process */ |
715a5ee82 memcg: fix oom sc... |
1806 |
schedule_timeout_uninterruptible(1); |
867578cbc memcg: fix oom ki... |
1807 |
return true; |
0b7f569e4 memcg: fix OOM ki... |
1808 |
} |
d69b042f3 memcg: add file-b... |
1809 1810 1811 |
/* * Currently used to update mapped file statistics, but the routine can be * generalized to update other statistics as well. |
32047e2a8 memcg: avoid lock... |
1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 |
* * Notes: Race condition * * We usually use page_cgroup_lock() for accessing page_cgroup member but * it tends to be costly. But considering some conditions, we doesn't need * to do so _always_. * * Considering "charge", lock_page_cgroup() is not required because all * file-stat operations happen after a page is attached to radix-tree. There * are no race with "charge". * * Considering "uncharge", we know that memcg doesn't clear pc->mem_cgroup * at "uncharge" intentionally. So, we always see valid pc->mem_cgroup even * if there are race with "uncharge". Statistics itself is properly handled * by flags. * * Considering "move", this is an only case we see a race. To make the race * small, we check MEM_CGROUP_ON_MOVE percpu value and detect there are * possibility of race condition. If there is, we take a lock. |
d69b042f3 memcg: add file-b... |
1831 |
*/ |
26174efd4 memcg: generic fi... |
1832 |
|
2a7106f2c memcg: create ext... |
1833 1834 |
void mem_cgroup_update_page_stat(struct page *page, enum mem_cgroup_page_stat_item idx, int val) |
d69b042f3 memcg: add file-b... |
1835 |
{ |
c0ff4b854 memcg: rename mem... |
1836 |
struct mem_cgroup *memcg; |
32047e2a8 memcg: avoid lock... |
1837 1838 |
struct page_cgroup *pc = lookup_page_cgroup(page); bool need_unlock = false; |
dbd4ea78f memcg: add lock t... |
1839 |
unsigned long uninitialized_var(flags); |
d69b042f3 memcg: add file-b... |
1840 |
|
d69b042f3 memcg: add file-b... |
1841 1842 |
if (unlikely(!pc)) return; |
32047e2a8 memcg: avoid lock... |
1843 |
rcu_read_lock(); |
c0ff4b854 memcg: rename mem... |
1844 1845 |
memcg = pc->mem_cgroup; if (unlikely(!memcg || !PageCgroupUsed(pc))) |
32047e2a8 memcg: avoid lock... |
1846 1847 |
goto out; /* pc->mem_cgroup is unstable ? */ |
c0ff4b854 memcg: rename mem... |
1848 |
if (unlikely(mem_cgroup_stealed(memcg)) || PageTransHuge(page)) { |
32047e2a8 memcg: avoid lock... |
1849 |
/* take a lock against to access pc->mem_cgroup */ |
dbd4ea78f memcg: add lock t... |
1850 |
move_lock_page_cgroup(pc, &flags); |
32047e2a8 memcg: avoid lock... |
1851 |
need_unlock = true; |
c0ff4b854 memcg: rename mem... |
1852 1853 |
memcg = pc->mem_cgroup; if (!memcg || !PageCgroupUsed(pc)) |
32047e2a8 memcg: avoid lock... |
1854 1855 |
goto out; } |
26174efd4 memcg: generic fi... |
1856 |
|
26174efd4 memcg: generic fi... |
1857 |
switch (idx) { |
2a7106f2c memcg: create ext... |
1858 |
case MEMCG_NR_FILE_MAPPED: |
26174efd4 memcg: generic fi... |
1859 1860 1861 |
if (val > 0) SetPageCgroupFileMapped(pc); else if (!page_mapped(page)) |
0c270f8f9 memcg: fix race i... |
1862 |
ClearPageCgroupFileMapped(pc); |
2a7106f2c memcg: create ext... |
1863 |
idx = MEM_CGROUP_STAT_FILE_MAPPED; |
26174efd4 memcg: generic fi... |
1864 1865 1866 |
break; default: BUG(); |
8725d5416 memcg: fix race i... |
1867 |
} |
d69b042f3 memcg: add file-b... |
1868 |
|
c0ff4b854 memcg: rename mem... |
1869 |
this_cpu_add(memcg->stat->count[idx], val); |
2a7106f2c memcg: create ext... |
1870 |
|
32047e2a8 memcg: avoid lock... |
1871 1872 |
out: if (unlikely(need_unlock)) |
dbd4ea78f memcg: add lock t... |
1873 |
move_unlock_page_cgroup(pc, &flags); |
32047e2a8 memcg: avoid lock... |
1874 1875 |
rcu_read_unlock(); return; |
d69b042f3 memcg: add file-b... |
1876 |
} |
2a7106f2c memcg: create ext... |
1877 |
EXPORT_SYMBOL(mem_cgroup_update_page_stat); |
26174efd4 memcg: generic fi... |
1878 |
|
f817ed485 memcg: move all a... |
1879 |
/* |
cdec2e426 memcg: coalesce c... |
1880 1881 1882 |
* size of first charge trial. "32" comes from vmscan.c's magic value. * TODO: maybe necessary to use big numbers in big irons. */ |
7ec99d621 memcg: unify char... |
1883 |
#define CHARGE_BATCH 32U |
cdec2e426 memcg: coalesce c... |
1884 1885 |
struct memcg_stock_pcp { struct mem_cgroup *cached; /* this never be root cgroup */ |
11c9ea4e8 memcg: convert pe... |
1886 |
unsigned int nr_pages; |
cdec2e426 memcg: coalesce c... |
1887 |
struct work_struct work; |
26fe61684 memcg: fix percpu... |
1888 1889 |
unsigned long flags; #define FLUSHING_CACHED_CHARGE (0) |
cdec2e426 memcg: coalesce c... |
1890 1891 |
}; static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock); |
9f50fad65 Revert "memcg: ge... |
1892 |
static DEFINE_MUTEX(percpu_charge_mutex); |
cdec2e426 memcg: coalesce c... |
1893 1894 |
/* |
11c9ea4e8 memcg: convert pe... |
1895 |
* Try to consume stocked charge on this cpu. If success, one page is consumed |
cdec2e426 memcg: coalesce c... |
1896 1897 1898 1899 |
* from local stock and true is returned. If the stock is 0 or charges from a * cgroup which is not current target, returns false. This stock will be * refilled. */ |
c0ff4b854 memcg: rename mem... |
1900 |
static bool consume_stock(struct mem_cgroup *memcg) |
cdec2e426 memcg: coalesce c... |
1901 1902 1903 1904 1905 |
{ struct memcg_stock_pcp *stock; bool ret = true; stock = &get_cpu_var(memcg_stock); |
c0ff4b854 memcg: rename mem... |
1906 |
if (memcg == stock->cached && stock->nr_pages) |
11c9ea4e8 memcg: convert pe... |
1907 |
stock->nr_pages--; |
cdec2e426 memcg: coalesce c... |
1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 |
else /* need to call res_counter_charge */ ret = false; put_cpu_var(memcg_stock); return ret; } /* * Returns stocks cached in percpu to res_counter and reset cached information. */ static void drain_stock(struct memcg_stock_pcp *stock) { struct mem_cgroup *old = stock->cached; |
11c9ea4e8 memcg: convert pe... |
1920 1921 1922 1923 |
if (stock->nr_pages) { unsigned long bytes = stock->nr_pages * PAGE_SIZE; res_counter_uncharge(&old->res, bytes); |
cdec2e426 memcg: coalesce c... |
1924 |
if (do_swap_account) |
11c9ea4e8 memcg: convert pe... |
1925 1926 |
res_counter_uncharge(&old->memsw, bytes); stock->nr_pages = 0; |
cdec2e426 memcg: coalesce c... |
1927 1928 |
} stock->cached = NULL; |
cdec2e426 memcg: coalesce c... |
1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 |
} /* * This must be called under preempt disabled or must be called by * a thread which is pinned to local cpu. */ static void drain_local_stock(struct work_struct *dummy) { struct memcg_stock_pcp *stock = &__get_cpu_var(memcg_stock); drain_stock(stock); |
26fe61684 memcg: fix percpu... |
1939 |
clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags); |
cdec2e426 memcg: coalesce c... |
1940 1941 1942 1943 |
} /* * Cache charges(val) which is from res_counter, to local per_cpu area. |
320cc51d9 mm: fix typo in r... |
1944 |
* This will be consumed by consume_stock() function, later. |
cdec2e426 memcg: coalesce c... |
1945 |
*/ |
c0ff4b854 memcg: rename mem... |
1946 |
static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages) |
cdec2e426 memcg: coalesce c... |
1947 1948 |
{ struct memcg_stock_pcp *stock = &get_cpu_var(memcg_stock); |
c0ff4b854 memcg: rename mem... |
1949 |
if (stock->cached != memcg) { /* reset if necessary */ |
cdec2e426 memcg: coalesce c... |
1950 |
drain_stock(stock); |
c0ff4b854 memcg: rename mem... |
1951 |
stock->cached = memcg; |
cdec2e426 memcg: coalesce c... |
1952 |
} |
11c9ea4e8 memcg: convert pe... |
1953 |
stock->nr_pages += nr_pages; |
cdec2e426 memcg: coalesce c... |
1954 1955 1956 1957 |
put_cpu_var(memcg_stock); } /* |
c0ff4b854 memcg: rename mem... |
1958 |
* Drains all per-CPU charge caches for given root_memcg resp. subtree |
d38144b7a memcg: unify sync... |
1959 1960 |
* of the hierarchy under it. sync flag says whether we should block * until the work is done. |
cdec2e426 memcg: coalesce c... |
1961 |
*/ |
c0ff4b854 memcg: rename mem... |
1962 |
static void drain_all_stock(struct mem_cgroup *root_memcg, bool sync) |
cdec2e426 memcg: coalesce c... |
1963 |
{ |
26fe61684 memcg: fix percpu... |
1964 |
int cpu, curcpu; |
d38144b7a memcg: unify sync... |
1965 |
|
cdec2e426 memcg: coalesce c... |
1966 |
/* Notify other cpus that system-wide "drain" is running */ |
cdec2e426 memcg: coalesce c... |
1967 |
get_online_cpus(); |
5af12d0ef memcg: pin execut... |
1968 |
curcpu = get_cpu(); |
cdec2e426 memcg: coalesce c... |
1969 1970 |
for_each_online_cpu(cpu) { struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu); |
c0ff4b854 memcg: rename mem... |
1971 |
struct mem_cgroup *memcg; |
26fe61684 memcg: fix percpu... |
1972 |
|
c0ff4b854 memcg: rename mem... |
1973 1974 |
memcg = stock->cached; if (!memcg || !stock->nr_pages) |
26fe61684 memcg: fix percpu... |
1975 |
continue; |
c0ff4b854 memcg: rename mem... |
1976 |
if (!mem_cgroup_same_or_subtree(root_memcg, memcg)) |
3e92041d6 memcg: add mem_cg... |
1977 |
continue; |
d1a05b697 memcg: do not try... |
1978 1979 1980 1981 1982 1983 |
if (!test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) { if (cpu == curcpu) drain_local_stock(&stock->work); else schedule_work_on(cpu, &stock->work); } |
cdec2e426 memcg: coalesce c... |
1984 |
} |
5af12d0ef memcg: pin execut... |
1985 |
put_cpu(); |
d38144b7a memcg: unify sync... |
1986 1987 1988 1989 1990 1991 |
if (!sync) goto out; for_each_online_cpu(cpu) { struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu); |
9f50fad65 Revert "memcg: ge... |
1992 |
if (test_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) |
d38144b7a memcg: unify sync... |
1993 1994 1995 |
flush_work(&stock->work); } out: |
cdec2e426 memcg: coalesce c... |
1996 |
put_online_cpus(); |
d38144b7a memcg: unify sync... |
1997 1998 1999 2000 2001 2002 2003 2004 |
} /* * Tries to drain stocked charges in other cpus. This function is asynchronous * and just put a work per cpu for draining localy on each cpu. Caller can * expects some charges will be back to res_counter later but cannot wait for * it. */ |
c0ff4b854 memcg: rename mem... |
2005 |
static void drain_all_stock_async(struct mem_cgroup *root_memcg) |
d38144b7a memcg: unify sync... |
2006 |
{ |
9f50fad65 Revert "memcg: ge... |
2007 2008 2009 2010 2011 |
/* * If someone calls draining, avoid adding more kworker runs. */ if (!mutex_trylock(&percpu_charge_mutex)) return; |
c0ff4b854 memcg: rename mem... |
2012 |
drain_all_stock(root_memcg, false); |
9f50fad65 Revert "memcg: ge... |
2013 |
mutex_unlock(&percpu_charge_mutex); |
cdec2e426 memcg: coalesce c... |
2014 2015 2016 |
} /* This is a synchronous drain interface. */ |
c0ff4b854 memcg: rename mem... |
2017 |
static void drain_all_stock_sync(struct mem_cgroup *root_memcg) |
cdec2e426 memcg: coalesce c... |
2018 2019 |
{ /* called when force_empty is called */ |
9f50fad65 Revert "memcg: ge... |
2020 |
mutex_lock(&percpu_charge_mutex); |
c0ff4b854 memcg: rename mem... |
2021 |
drain_all_stock(root_memcg, true); |
9f50fad65 Revert "memcg: ge... |
2022 |
mutex_unlock(&percpu_charge_mutex); |
cdec2e426 memcg: coalesce c... |
2023 |
} |
711d3d2c9 memcg: cpu hotplu... |
2024 2025 2026 2027 |
/* * This function drains percpu counter value from DEAD cpu and * move it to local cpu. Note that this function can be preempted. */ |
c0ff4b854 memcg: rename mem... |
2028 |
static void mem_cgroup_drain_pcp_counter(struct mem_cgroup *memcg, int cpu) |
711d3d2c9 memcg: cpu hotplu... |
2029 2030 |
{ int i; |
c0ff4b854 memcg: rename mem... |
2031 |
spin_lock(&memcg->pcp_counter_lock); |
711d3d2c9 memcg: cpu hotplu... |
2032 |
for (i = 0; i < MEM_CGROUP_STAT_DATA; i++) { |
c0ff4b854 memcg: rename mem... |
2033 |
long x = per_cpu(memcg->stat->count[i], cpu); |
711d3d2c9 memcg: cpu hotplu... |
2034 |
|
c0ff4b854 memcg: rename mem... |
2035 2036 |
per_cpu(memcg->stat->count[i], cpu) = 0; memcg->nocpu_base.count[i] += x; |
711d3d2c9 memcg: cpu hotplu... |
2037 |
} |
e9f8974f2 memcg: break out ... |
2038 |
for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) { |
c0ff4b854 memcg: rename mem... |
2039 |
unsigned long x = per_cpu(memcg->stat->events[i], cpu); |
e9f8974f2 memcg: break out ... |
2040 |
|
c0ff4b854 memcg: rename mem... |
2041 2042 |
per_cpu(memcg->stat->events[i], cpu) = 0; memcg->nocpu_base.events[i] += x; |
e9f8974f2 memcg: break out ... |
2043 |
} |
1489ebad8 memcg: cpu hotplu... |
2044 |
/* need to clear ON_MOVE value, works as a kind of lock. */ |
c0ff4b854 memcg: rename mem... |
2045 2046 |
per_cpu(memcg->stat->count[MEM_CGROUP_ON_MOVE], cpu) = 0; spin_unlock(&memcg->pcp_counter_lock); |
1489ebad8 memcg: cpu hotplu... |
2047 |
} |
c0ff4b854 memcg: rename mem... |
2048 |
static void synchronize_mem_cgroup_on_move(struct mem_cgroup *memcg, int cpu) |
1489ebad8 memcg: cpu hotplu... |
2049 2050 |
{ int idx = MEM_CGROUP_ON_MOVE; |
c0ff4b854 memcg: rename mem... |
2051 2052 2053 |
spin_lock(&memcg->pcp_counter_lock); per_cpu(memcg->stat->count[idx], cpu) = memcg->nocpu_base.count[idx]; spin_unlock(&memcg->pcp_counter_lock); |
711d3d2c9 memcg: cpu hotplu... |
2054 2055 2056 |
} static int __cpuinit memcg_cpu_hotplug_callback(struct notifier_block *nb, |
cdec2e426 memcg: coalesce c... |
2057 2058 2059 2060 2061 |
unsigned long action, void *hcpu) { int cpu = (unsigned long)hcpu; struct memcg_stock_pcp *stock; |
711d3d2c9 memcg: cpu hotplu... |
2062 |
struct mem_cgroup *iter; |
cdec2e426 memcg: coalesce c... |
2063 |
|
1489ebad8 memcg: cpu hotplu... |
2064 2065 2066 2067 2068 |
if ((action == CPU_ONLINE)) { for_each_mem_cgroup_all(iter) synchronize_mem_cgroup_on_move(iter, cpu); return NOTIFY_OK; } |
711d3d2c9 memcg: cpu hotplu... |
2069 |
if ((action != CPU_DEAD) || action != CPU_DEAD_FROZEN) |
cdec2e426 memcg: coalesce c... |
2070 |
return NOTIFY_OK; |
711d3d2c9 memcg: cpu hotplu... |
2071 2072 2073 |
for_each_mem_cgroup_all(iter) mem_cgroup_drain_pcp_counter(iter, cpu); |
cdec2e426 memcg: coalesce c... |
2074 2075 2076 2077 |
stock = &per_cpu(memcg_stock, cpu); drain_stock(stock); return NOTIFY_OK; } |
4b5343346 memcg: clean up t... |
2078 2079 2080 2081 2082 2083 2084 2085 2086 |
/* See __mem_cgroup_try_charge() for details */ enum { CHARGE_OK, /* success */ CHARGE_RETRY, /* need to retry but retry is not bad */ CHARGE_NOMEM, /* we can't do more. return -ENOMEM */ CHARGE_WOULDBLOCK, /* GFP_WAIT wasn't set and no enough res. */ CHARGE_OOM_DIE, /* the current is killed because of OOM */ }; |
c0ff4b854 memcg: rename mem... |
2087 |
static int mem_cgroup_do_charge(struct mem_cgroup *memcg, gfp_t gfp_mask, |
7ec99d621 memcg: unify char... |
2088 |
unsigned int nr_pages, bool oom_check) |
4b5343346 memcg: clean up t... |
2089 |
{ |
7ec99d621 memcg: unify char... |
2090 |
unsigned long csize = nr_pages * PAGE_SIZE; |
4b5343346 memcg: clean up t... |
2091 2092 2093 2094 |
struct mem_cgroup *mem_over_limit; struct res_counter *fail_res; unsigned long flags = 0; int ret; |
c0ff4b854 memcg: rename mem... |
2095 |
ret = res_counter_charge(&memcg->res, csize, &fail_res); |
4b5343346 memcg: clean up t... |
2096 2097 2098 2099 |
if (likely(!ret)) { if (!do_swap_account) return CHARGE_OK; |
c0ff4b854 memcg: rename mem... |
2100 |
ret = res_counter_charge(&memcg->memsw, csize, &fail_res); |
4b5343346 memcg: clean up t... |
2101 2102 |
if (likely(!ret)) return CHARGE_OK; |
c0ff4b854 memcg: rename mem... |
2103 |
res_counter_uncharge(&memcg->res, csize); |
4b5343346 memcg: clean up t... |
2104 2105 2106 2107 |
mem_over_limit = mem_cgroup_from_res_counter(fail_res, memsw); flags |= MEM_CGROUP_RECLAIM_NOSWAP; } else mem_over_limit = mem_cgroup_from_res_counter(fail_res, res); |
9221edb71 memcg: prevent en... |
2108 |
/* |
7ec99d621 memcg: unify char... |
2109 2110 |
* nr_pages can be either a huge page (HPAGE_PMD_NR), a batch * of regular pages (CHARGE_BATCH), or a single regular page (1). |
9221edb71 memcg: prevent en... |
2111 2112 2113 2114 |
* * Never reclaim on behalf of optional batching, retry with a * single page instead. */ |
7ec99d621 memcg: unify char... |
2115 |
if (nr_pages == CHARGE_BATCH) |
4b5343346 memcg: clean up t... |
2116 2117 2118 2119 2120 2121 |
return CHARGE_RETRY; if (!(gfp_mask & __GFP_WAIT)) return CHARGE_WOULDBLOCK; ret = mem_cgroup_hierarchical_reclaim(mem_over_limit, NULL, |
0ae5e89c6 memcg: count the ... |
2122 |
gfp_mask, flags, NULL); |
7ec99d621 memcg: unify char... |
2123 |
if (mem_cgroup_margin(mem_over_limit) >= nr_pages) |
19942822d memcg: prevent en... |
2124 |
return CHARGE_RETRY; |
4b5343346 memcg: clean up t... |
2125 |
/* |
19942822d memcg: prevent en... |
2126 2127 2128 2129 2130 2131 2132 |
* Even though the limit is exceeded at this point, reclaim * may have been able to free some pages. Retry the charge * before killing the task. * * Only for regular pages, though: huge pages are rather * unlikely to succeed so close to the limit, and we fall back * to regular pages anyway in case of failure. |
4b5343346 memcg: clean up t... |
2133 |
*/ |
7ec99d621 memcg: unify char... |
2134 |
if (nr_pages == 1 && ret) |
4b5343346 memcg: clean up t... |
2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 |
return CHARGE_RETRY; /* * At task move, charge accounts can be doubly counted. So, it's * better to wait until the end of task_move if something is going on. */ if (mem_cgroup_wait_acct_move(mem_over_limit)) return CHARGE_RETRY; /* If we don't need to call oom-killer at el, return immediately */ if (!oom_check) return CHARGE_NOMEM; /* check OOM */ if (!mem_cgroup_handle_oom(mem_over_limit, gfp_mask)) return CHARGE_OOM_DIE; return CHARGE_RETRY; } |
cdec2e426 memcg: coalesce c... |
2153 |
/* |
f817ed485 memcg: move all a... |
2154 2155 |
* Unlike exported interface, "oom" parameter is added. if oom==true, * oom-killer can be invoked. |
8a9f3ccd2 Memory controller... |
2156 |
*/ |
f817ed485 memcg: move all a... |
2157 |
static int __mem_cgroup_try_charge(struct mm_struct *mm, |
ec1685109 thp: memcg compound |
2158 |
gfp_t gfp_mask, |
7ec99d621 memcg: unify char... |
2159 |
unsigned int nr_pages, |
c0ff4b854 memcg: rename mem... |
2160 |
struct mem_cgroup **ptr, |
7ec99d621 memcg: unify char... |
2161 |
bool oom) |
8a9f3ccd2 Memory controller... |
2162 |
{ |
7ec99d621 memcg: unify char... |
2163 |
unsigned int batch = max(CHARGE_BATCH, nr_pages); |
4b5343346 memcg: clean up t... |
2164 |
int nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES; |
c0ff4b854 memcg: rename mem... |
2165 |
struct mem_cgroup *memcg = NULL; |
4b5343346 memcg: clean up t... |
2166 |
int ret; |
a636b327f memcg: avoid unne... |
2167 |
|
867578cbc memcg: fix oom ki... |
2168 2169 2170 2171 2172 2173 2174 2175 |
/* * Unlike gloval-vm's OOM-kill, we're not in memory shortage * in system level. So, allow to go ahead dying process in addition to * MEMDIE process. */ if (unlikely(test_thread_flag(TIF_MEMDIE) || fatal_signal_pending(current))) goto bypass; |
a636b327f memcg: avoid unne... |
2176 |
|
8a9f3ccd2 Memory controller... |
2177 |
/* |
3be91277e memcgroup: tidy u... |
2178 2179 |
* We always charge the cgroup the mm_struct belongs to. * The mm_struct's mem_cgroup changes on task migration if the |
8a9f3ccd2 Memory controller... |
2180 2181 2182 |
* thread group leader migrates. It's possible that mm is not * set, if so charge the init_mm (happens for pagecache usage). */ |
c0ff4b854 memcg: rename mem... |
2183 |
if (!*ptr && !mm) |
f75ca9620 memcg: avoid css_... |
2184 2185 |
goto bypass; again: |
c0ff4b854 memcg: rename mem... |
2186 2187 2188 2189 |
if (*ptr) { /* css should be a valid one */ memcg = *ptr; VM_BUG_ON(css_is_removed(&memcg->css)); if (mem_cgroup_is_root(memcg)) |
f75ca9620 memcg: avoid css_... |
2190 |
goto done; |
c0ff4b854 memcg: rename mem... |
2191 |
if (nr_pages == 1 && consume_stock(memcg)) |
f75ca9620 memcg: avoid css_... |
2192 |
goto done; |
c0ff4b854 memcg: rename mem... |
2193 |
css_get(&memcg->css); |
4b5343346 memcg: clean up t... |
2194 |
} else { |
f75ca9620 memcg: avoid css_... |
2195 |
struct task_struct *p; |
54595fe26 memcg: use css_tr... |
2196 |
|
f75ca9620 memcg: avoid css_... |
2197 2198 |
rcu_read_lock(); p = rcu_dereference(mm->owner); |
f75ca9620 memcg: avoid css_... |
2199 |
/* |
ebb76ce16 memcg: fix wrong ... |
2200 |
* Because we don't have task_lock(), "p" can exit. |
c0ff4b854 memcg: rename mem... |
2201 |
* In that case, "memcg" can point to root or p can be NULL with |
ebb76ce16 memcg: fix wrong ... |
2202 2203 2204 2205 2206 2207 |
* race with swapoff. Then, we have small risk of mis-accouning. * But such kind of mis-account by race always happens because * we don't have cgroup_mutex(). It's overkill and we allo that * small race, here. * (*) swapoff at el will charge against mm-struct not against * task-struct. So, mm->owner can be NULL. |
f75ca9620 memcg: avoid css_... |
2208 |
*/ |
c0ff4b854 memcg: rename mem... |
2209 2210 |
memcg = mem_cgroup_from_task(p); if (!memcg || mem_cgroup_is_root(memcg)) { |
f75ca9620 memcg: avoid css_... |
2211 2212 2213 |
rcu_read_unlock(); goto done; } |
c0ff4b854 memcg: rename mem... |
2214 |
if (nr_pages == 1 && consume_stock(memcg)) { |
f75ca9620 memcg: avoid css_... |
2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 |
/* * It seems dagerous to access memcg without css_get(). * But considering how consume_stok works, it's not * necessary. If consume_stock success, some charges * from this memcg are cached on this cpu. So, we * don't need to call css_get()/css_tryget() before * calling consume_stock(). */ rcu_read_unlock(); goto done; } /* after here, we may be blocked. we need to get refcnt */ |
c0ff4b854 memcg: rename mem... |
2227 |
if (!css_tryget(&memcg->css)) { |
f75ca9620 memcg: avoid css_... |
2228 2229 2230 2231 2232 |
rcu_read_unlock(); goto again; } rcu_read_unlock(); } |
8a9f3ccd2 Memory controller... |
2233 |
|
4b5343346 memcg: clean up t... |
2234 2235 |
do { bool oom_check; |
7a81b88cb memcg: introduce ... |
2236 |
|
4b5343346 memcg: clean up t... |
2237 |
/* If killed, bypass charge */ |
f75ca9620 memcg: avoid css_... |
2238 |
if (fatal_signal_pending(current)) { |
c0ff4b854 memcg: rename mem... |
2239 |
css_put(&memcg->css); |
4b5343346 memcg: clean up t... |
2240 |
goto bypass; |
f75ca9620 memcg: avoid css_... |
2241 |
} |
6d61ef409 memcg: memory cgr... |
2242 |
|
4b5343346 memcg: clean up t... |
2243 2244 2245 2246 |
oom_check = false; if (oom && !nr_oom_retries) { oom_check = true; nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES; |
cdec2e426 memcg: coalesce c... |
2247 |
} |
66e1707bc Memory controller... |
2248 |
|
c0ff4b854 memcg: rename mem... |
2249 |
ret = mem_cgroup_do_charge(memcg, gfp_mask, batch, oom_check); |
4b5343346 memcg: clean up t... |
2250 2251 2252 2253 |
switch (ret) { case CHARGE_OK: break; case CHARGE_RETRY: /* not in OOM situation but retry */ |
7ec99d621 memcg: unify char... |
2254 |
batch = nr_pages; |
c0ff4b854 memcg: rename mem... |
2255 2256 |
css_put(&memcg->css); memcg = NULL; |
f75ca9620 memcg: avoid css_... |
2257 |
goto again; |
4b5343346 memcg: clean up t... |
2258 |
case CHARGE_WOULDBLOCK: /* !__GFP_WAIT */ |
c0ff4b854 memcg: rename mem... |
2259 |
css_put(&memcg->css); |
4b5343346 memcg: clean up t... |
2260 2261 |
goto nomem; case CHARGE_NOMEM: /* OOM routine works */ |
f75ca9620 memcg: avoid css_... |
2262 |
if (!oom) { |
c0ff4b854 memcg: rename mem... |
2263 |
css_put(&memcg->css); |
867578cbc memcg: fix oom ki... |
2264 |
goto nomem; |
f75ca9620 memcg: avoid css_... |
2265 |
} |
4b5343346 memcg: clean up t... |
2266 2267 2268 2269 |
/* If oom, we never return -ENOMEM */ nr_oom_retries--; break; case CHARGE_OOM_DIE: /* Killed by OOM Killer */ |
c0ff4b854 memcg: rename mem... |
2270 |
css_put(&memcg->css); |
867578cbc memcg: fix oom ki... |
2271 |
goto bypass; |
66e1707bc Memory controller... |
2272 |
} |
4b5343346 memcg: clean up t... |
2273 |
} while (ret != CHARGE_OK); |
7ec99d621 memcg: unify char... |
2274 |
if (batch > nr_pages) |
c0ff4b854 memcg: rename mem... |
2275 2276 |
refill_stock(memcg, batch - nr_pages); css_put(&memcg->css); |
0c3e73e84 memcg: improve re... |
2277 |
done: |
c0ff4b854 memcg: rename mem... |
2278 |
*ptr = memcg; |
7a81b88cb memcg: introduce ... |
2279 2280 |
return 0; nomem: |
c0ff4b854 memcg: rename mem... |
2281 |
*ptr = NULL; |
7a81b88cb memcg: introduce ... |
2282 |
return -ENOMEM; |
867578cbc memcg: fix oom ki... |
2283 |
bypass: |
c0ff4b854 memcg: rename mem... |
2284 |
*ptr = NULL; |
867578cbc memcg: fix oom ki... |
2285 |
return 0; |
7a81b88cb memcg: introduce ... |
2286 |
} |
8a9f3ccd2 Memory controller... |
2287 |
|
a3b2d6926 cgroups: use css ... |
2288 |
/* |
a3032a2c1 memcg: add mem_cg... |
2289 2290 2291 2292 |
* Somemtimes we have to undo a charge we got by try_charge(). * This function is for that and do uncharge, put css's refcnt. * gotten by try_charge(). */ |
c0ff4b854 memcg: rename mem... |
2293 |
static void __mem_cgroup_cancel_charge(struct mem_cgroup *memcg, |
e7018b8d2 memcg: keep only ... |
2294 |
unsigned int nr_pages) |
a3032a2c1 memcg: add mem_cg... |
2295 |
{ |
c0ff4b854 memcg: rename mem... |
2296 |
if (!mem_cgroup_is_root(memcg)) { |
e7018b8d2 memcg: keep only ... |
2297 |
unsigned long bytes = nr_pages * PAGE_SIZE; |
c0ff4b854 memcg: rename mem... |
2298 |
res_counter_uncharge(&memcg->res, bytes); |
a3032a2c1 memcg: add mem_cg... |
2299 |
if (do_swap_account) |
c0ff4b854 memcg: rename mem... |
2300 |
res_counter_uncharge(&memcg->memsw, bytes); |
a3032a2c1 memcg: add mem_cg... |
2301 |
} |
854ffa8d1 memcg: improve pe... |
2302 |
} |
a3032a2c1 memcg: add mem_cg... |
2303 |
/* |
a3b2d6926 cgroups: use css ... |
2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 |
* A helper function to get mem_cgroup from ID. must be called under * rcu_read_lock(). The caller must check css_is_removed() or some if * it's concern. (dropping refcnt from swap can be called against removed * memcg.) */ static struct mem_cgroup *mem_cgroup_lookup(unsigned short id) { struct cgroup_subsys_state *css; /* ID 0 is unused ID */ if (!id) return NULL; css = css_lookup(&mem_cgroup_subsys, id); if (!css) return NULL; return container_of(css, struct mem_cgroup, css); } |
e42d9d5d4 memcg: rename and... |
2321 |
struct mem_cgroup *try_get_mem_cgroup_from_page(struct page *page) |
b5a84319a memcg: fix shmem'... |
2322 |
{ |
c0ff4b854 memcg: rename mem... |
2323 |
struct mem_cgroup *memcg = NULL; |
3c776e646 memcg: charge swa... |
2324 |
struct page_cgroup *pc; |
a3b2d6926 cgroups: use css ... |
2325 |
unsigned short id; |
b5a84319a memcg: fix shmem'... |
2326 |
swp_entry_t ent; |
3c776e646 memcg: charge swa... |
2327 |
VM_BUG_ON(!PageLocked(page)); |
3c776e646 memcg: charge swa... |
2328 |
pc = lookup_page_cgroup(page); |
c0bd3f63c memcg: fix try_ge... |
2329 |
lock_page_cgroup(pc); |
a3b2d6926 cgroups: use css ... |
2330 |
if (PageCgroupUsed(pc)) { |
c0ff4b854 memcg: rename mem... |
2331 2332 2333 |
memcg = pc->mem_cgroup; if (memcg && !css_tryget(&memcg->css)) memcg = NULL; |
e42d9d5d4 memcg: rename and... |
2334 |
} else if (PageSwapCache(page)) { |
3c776e646 memcg: charge swa... |
2335 |
ent.val = page_private(page); |
a3b2d6926 cgroups: use css ... |
2336 2337 |
id = lookup_swap_cgroup(ent); rcu_read_lock(); |
c0ff4b854 memcg: rename mem... |
2338 2339 2340 |
memcg = mem_cgroup_lookup(id); if (memcg && !css_tryget(&memcg->css)) memcg = NULL; |
a3b2d6926 cgroups: use css ... |
2341 |
rcu_read_unlock(); |
3c776e646 memcg: charge swa... |
2342 |
} |
c0bd3f63c memcg: fix try_ge... |
2343 |
unlock_page_cgroup(pc); |
c0ff4b854 memcg: rename mem... |
2344 |
return memcg; |
b5a84319a memcg: fix shmem'... |
2345 |
} |
c0ff4b854 memcg: rename mem... |
2346 |
static void __mem_cgroup_commit_charge(struct mem_cgroup *memcg, |
5564e88ba memcg: condense p... |
2347 |
struct page *page, |
7ec99d621 memcg: unify char... |
2348 |
unsigned int nr_pages, |
ca3e02141 memcg: fix USED b... |
2349 |
struct page_cgroup *pc, |
7ec99d621 memcg: unify char... |
2350 |
enum charge_type ctype) |
7a81b88cb memcg: introduce ... |
2351 |
{ |
ca3e02141 memcg: fix USED b... |
2352 2353 2354 |
lock_page_cgroup(pc); if (unlikely(PageCgroupUsed(pc))) { unlock_page_cgroup(pc); |
c0ff4b854 memcg: rename mem... |
2355 |
__mem_cgroup_cancel_charge(memcg, nr_pages); |
ca3e02141 memcg: fix USED b... |
2356 2357 2358 2359 2360 2361 |
return; } /* * we don't need page_cgroup_lock about tail pages, becase they are not * accessed by any other context at this point. */ |
c0ff4b854 memcg: rename mem... |
2362 |
pc->mem_cgroup = memcg; |
261fb61a8 memcg: add commen... |
2363 2364 2365 2366 2367 2368 2369 |
/* * We access a page_cgroup asynchronously without lock_page_cgroup(). * Especially when a page_cgroup is taken from a page, pc->mem_cgroup * is accessed after testing USED bit. To make pc->mem_cgroup visible * before USED bit, we need memory barrier here. * See mem_cgroup_add_lru_list(), etc. */ |
08e552c69 memcg: synchroniz... |
2370 |
smp_wmb(); |
4b3bde4c9 memcg: remove the... |
2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 |
switch (ctype) { case MEM_CGROUP_CHARGE_TYPE_CACHE: case MEM_CGROUP_CHARGE_TYPE_SHMEM: SetPageCgroupCache(pc); SetPageCgroupUsed(pc); break; case MEM_CGROUP_CHARGE_TYPE_MAPPED: ClearPageCgroupCache(pc); SetPageCgroupUsed(pc); break; default: break; } |
3be91277e memcgroup: tidy u... |
2384 |
|
c0ff4b854 memcg: rename mem... |
2385 |
mem_cgroup_charge_statistics(memcg, PageCgroupCache(pc), nr_pages); |
52d4b9ac0 memcg: allocate a... |
2386 |
unlock_page_cgroup(pc); |
430e48631 memcg: update thr... |
2387 2388 2389 2390 2391 |
/* * "charge_statistics" updated event counter. Then, check it. * Insert ancestor (and ancestor's ancestors), to softlimit RB-tree. * if they exceeds softlimit. */ |
c0ff4b854 memcg: rename mem... |
2392 |
memcg_check_events(memcg, page); |
7a81b88cb memcg: introduce ... |
2393 |
} |
66e1707bc Memory controller... |
2394 |
|
ca3e02141 memcg: fix USED b... |
2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 |
#ifdef CONFIG_TRANSPARENT_HUGEPAGE #define PCGF_NOCOPY_AT_SPLIT ((1 << PCG_LOCK) | (1 << PCG_MOVE_LOCK) |\ (1 << PCG_ACCT_LRU) | (1 << PCG_MIGRATION)) /* * Because tail pages are not marked as "used", set it. We're under * zone->lru_lock, 'splitting on pmd' and compund_lock. */ void mem_cgroup_split_huge_fixup(struct page *head, struct page *tail) { struct page_cgroup *head_pc = lookup_page_cgroup(head); struct page_cgroup *tail_pc = lookup_page_cgroup(tail); unsigned long flags; |
3d37c4a91 memcg: bugfix che... |
2408 2409 |
if (mem_cgroup_disabled()) return; |
ca3e02141 memcg: fix USED b... |
2410 |
/* |
ece35ca81 memcg: fix LRU ac... |
2411 |
* We have no races with charge/uncharge but will have races with |
ca3e02141 memcg: fix USED b... |
2412 2413 2414 2415 2416 2417 |
* page state accounting. */ move_lock_page_cgroup(head_pc, &flags); tail_pc->mem_cgroup = head_pc->mem_cgroup; smp_wmb(); /* see __commit_charge() */ |
ece35ca81 memcg: fix LRU ac... |
2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 |
if (PageCgroupAcctLRU(head_pc)) { enum lru_list lru; struct mem_cgroup_per_zone *mz; /* * LRU flags cannot be copied because we need to add tail *.page to LRU by generic call and our hook will be called. * We hold lru_lock, then, reduce counter directly. */ lru = page_lru(head); |
97a6c37b3 memcg: change pag... |
2428 |
mz = page_cgroup_zoneinfo(head_pc->mem_cgroup, head); |
ece35ca81 memcg: fix LRU ac... |
2429 2430 |
MEM_CGROUP_ZSTAT(mz, lru) -= 1; } |
ca3e02141 memcg: fix USED b... |
2431 2432 2433 2434 |
tail_pc->flags = head_pc->flags & ~PCGF_NOCOPY_AT_SPLIT; move_unlock_page_cgroup(head_pc, &flags); } #endif |
f817ed485 memcg: move all a... |
2435 |
/** |
de3638d9c memcg: fold __mem... |
2436 |
* mem_cgroup_move_account - move account of the page |
5564e88ba memcg: condense p... |
2437 |
* @page: the page |
7ec99d621 memcg: unify char... |
2438 |
* @nr_pages: number of regular pages (>1 for huge pages) |
f817ed485 memcg: move all a... |
2439 2440 2441 |
* @pc: page_cgroup of the page. * @from: mem_cgroup which the page is moved from. * @to: mem_cgroup which the page is moved to. @from != @to. |
854ffa8d1 memcg: improve pe... |
2442 |
* @uncharge: whether we should call uncharge and css_put against @from. |
f817ed485 memcg: move all a... |
2443 2444 |
* * The caller must confirm following. |
08e552c69 memcg: synchroniz... |
2445 |
* - page is not on LRU (isolate_page() is useful.) |
7ec99d621 memcg: unify char... |
2446 |
* - compound_lock is held when nr_pages > 1 |
f817ed485 memcg: move all a... |
2447 |
* |
854ffa8d1 memcg: improve pe... |
2448 |
* This function doesn't do "charge" nor css_get to new cgroup. It should be |
25985edce Fix common misspe... |
2449 |
* done by a caller(__mem_cgroup_try_charge would be useful). If @uncharge is |
854ffa8d1 memcg: improve pe... |
2450 2451 |
* true, this function does "uncharge" from old cgroup, but it doesn't if * @uncharge is false, so a caller should do "uncharge". |
f817ed485 memcg: move all a... |
2452 |
*/ |
7ec99d621 memcg: unify char... |
2453 2454 2455 2456 2457 2458 |
static int mem_cgroup_move_account(struct page *page, unsigned int nr_pages, struct page_cgroup *pc, struct mem_cgroup *from, struct mem_cgroup *to, bool uncharge) |
f817ed485 memcg: move all a... |
2459 |
{ |
de3638d9c memcg: fold __mem... |
2460 2461 |
unsigned long flags; int ret; |
987eba66e memcg: fix rmdir,... |
2462 |
|
f817ed485 memcg: move all a... |
2463 |
VM_BUG_ON(from == to); |
5564e88ba memcg: condense p... |
2464 |
VM_BUG_ON(PageLRU(page)); |
de3638d9c memcg: fold __mem... |
2465 2466 2467 2468 2469 2470 2471 |
/* * The page is isolated from LRU. So, collapse function * will not handle this page. But page splitting can happen. * Do this check under compound_page_lock(). The caller should * hold it. */ ret = -EBUSY; |
7ec99d621 memcg: unify char... |
2472 |
if (nr_pages > 1 && !PageTransHuge(page)) |
de3638d9c memcg: fold __mem... |
2473 2474 2475 2476 2477 2478 2479 2480 2481 |
goto out; lock_page_cgroup(pc); ret = -EINVAL; if (!PageCgroupUsed(pc) || pc->mem_cgroup != from) goto unlock; move_lock_page_cgroup(pc, &flags); |
f817ed485 memcg: move all a... |
2482 |
|
8725d5416 memcg: fix race i... |
2483 |
if (PageCgroupFileMapped(pc)) { |
c62b1a3b3 memcg: use generi... |
2484 2485 2486 2487 2488 |
/* Update mapped_file data for mem_cgroup */ preempt_disable(); __this_cpu_dec(from->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]); __this_cpu_inc(to->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]); preempt_enable(); |
d69b042f3 memcg: add file-b... |
2489 |
} |
987eba66e memcg: fix rmdir,... |
2490 |
mem_cgroup_charge_statistics(from, PageCgroupCache(pc), -nr_pages); |
854ffa8d1 memcg: improve pe... |
2491 2492 |
if (uncharge) /* This is not "cancel", but cancel_charge does all we need. */ |
e7018b8d2 memcg: keep only ... |
2493 |
__mem_cgroup_cancel_charge(from, nr_pages); |
d69b042f3 memcg: add file-b... |
2494 |
|
854ffa8d1 memcg: improve pe... |
2495 |
/* caller should have done css_get */ |
08e552c69 memcg: synchroniz... |
2496 |
pc->mem_cgroup = to; |
987eba66e memcg: fix rmdir,... |
2497 |
mem_cgroup_charge_statistics(to, PageCgroupCache(pc), nr_pages); |
887032670 cgroup avoid perm... |
2498 2499 2500 |
/* * We charges against "to" which may not have any tasks. Then, "to" * can be under rmdir(). But in current implementation, caller of |
4ffef5fef memcg: move charg... |
2501 |
* this function is just force_empty() and move charge, so it's |
25985edce Fix common misspe... |
2502 |
* guaranteed that "to" is never removed. So, we don't check rmdir |
4ffef5fef memcg: move charg... |
2503 |
* status here. |
887032670 cgroup avoid perm... |
2504 |
*/ |
de3638d9c memcg: fold __mem... |
2505 2506 2507 |
move_unlock_page_cgroup(pc, &flags); ret = 0; unlock: |
57f9fd7d2 memcg: cleanup me... |
2508 |
unlock_page_cgroup(pc); |
d2265e6fa memcg : share eve... |
2509 2510 2511 |
/* * check events */ |
5564e88ba memcg: condense p... |
2512 2513 |
memcg_check_events(to, page); memcg_check_events(from, page); |
de3638d9c memcg: fold __mem... |
2514 |
out: |
f817ed485 memcg: move all a... |
2515 2516 2517 2518 2519 2520 |
return ret; } /* * move charges to its parent. */ |
5564e88ba memcg: condense p... |
2521 2522 |
static int mem_cgroup_move_parent(struct page *page, struct page_cgroup *pc, |
f817ed485 memcg: move all a... |
2523 2524 2525 2526 2527 2528 |
struct mem_cgroup *child, gfp_t gfp_mask) { struct cgroup *cg = child->css.cgroup; struct cgroup *pcg = cg->parent; struct mem_cgroup *parent; |
7ec99d621 memcg: unify char... |
2529 |
unsigned int nr_pages; |
4be4489fe mm/memcontrol.c: ... |
2530 |
unsigned long uninitialized_var(flags); |
f817ed485 memcg: move all a... |
2531 2532 2533 2534 2535 |
int ret; /* Is ROOT ? */ if (!pcg) return -EINVAL; |
57f9fd7d2 memcg: cleanup me... |
2536 2537 2538 2539 2540 |
ret = -EBUSY; if (!get_page_unless_zero(page)) goto out; if (isolate_lru_page(page)) goto put; |
52dbb9050 memcg: fix race a... |
2541 |
|
7ec99d621 memcg: unify char... |
2542 |
nr_pages = hpage_nr_pages(page); |
08e552c69 memcg: synchroniz... |
2543 |
|
f817ed485 memcg: move all a... |
2544 |
parent = mem_cgroup_from_cont(pcg); |
7ec99d621 memcg: unify char... |
2545 |
ret = __mem_cgroup_try_charge(NULL, gfp_mask, nr_pages, &parent, false); |
a636b327f memcg: avoid unne... |
2546 |
if (ret || !parent) |
57f9fd7d2 memcg: cleanup me... |
2547 |
goto put_back; |
f817ed485 memcg: move all a... |
2548 |
|
7ec99d621 memcg: unify char... |
2549 |
if (nr_pages > 1) |
987eba66e memcg: fix rmdir,... |
2550 |
flags = compound_lock_irqsave(page); |
7ec99d621 memcg: unify char... |
2551 |
ret = mem_cgroup_move_account(page, nr_pages, pc, child, parent, true); |
854ffa8d1 memcg: improve pe... |
2552 |
if (ret) |
7ec99d621 memcg: unify char... |
2553 |
__mem_cgroup_cancel_charge(parent, nr_pages); |
8dba474f0 mm/memcontrol.c: ... |
2554 |
|
7ec99d621 memcg: unify char... |
2555 |
if (nr_pages > 1) |
987eba66e memcg: fix rmdir,... |
2556 |
compound_unlock_irqrestore(page, flags); |
8dba474f0 mm/memcontrol.c: ... |
2557 |
put_back: |
08e552c69 memcg: synchroniz... |
2558 |
putback_lru_page(page); |
57f9fd7d2 memcg: cleanup me... |
2559 |
put: |
40d58138f memcg: fix error ... |
2560 |
put_page(page); |
57f9fd7d2 memcg: cleanup me... |
2561 |
out: |
f817ed485 memcg: move all a... |
2562 2563 |
return ret; } |
7a81b88cb memcg: introduce ... |
2564 2565 2566 2567 2568 2569 2570 |
/* * Charge the memory controller for page usage. * Return * 0 if the charge was successful * < 0 if the cgroup is over its limit */ static int mem_cgroup_charge_common(struct page *page, struct mm_struct *mm, |
73045c47b memcg: remove mem... |
2571 |
gfp_t gfp_mask, enum charge_type ctype) |
7a81b88cb memcg: introduce ... |
2572 |
{ |
c0ff4b854 memcg: rename mem... |
2573 |
struct mem_cgroup *memcg = NULL; |
7ec99d621 memcg: unify char... |
2574 |
unsigned int nr_pages = 1; |
7a81b88cb memcg: introduce ... |
2575 |
struct page_cgroup *pc; |
8493ae439 memcg: never OOM ... |
2576 |
bool oom = true; |
7a81b88cb memcg: introduce ... |
2577 |
int ret; |
ec1685109 thp: memcg compound |
2578 |
|
37c2ac787 thp: compound_tra... |
2579 |
if (PageTransHuge(page)) { |
7ec99d621 memcg: unify char... |
2580 |
nr_pages <<= compound_order(page); |
37c2ac787 thp: compound_tra... |
2581 |
VM_BUG_ON(!PageTransHuge(page)); |
8493ae439 memcg: never OOM ... |
2582 2583 2584 2585 2586 |
/* * Never OOM-kill a process for a huge page. The * fault handler will fall back to regular pages. */ oom = false; |
37c2ac787 thp: compound_tra... |
2587 |
} |
7a81b88cb memcg: introduce ... |
2588 2589 |
pc = lookup_page_cgroup(page); |
af4a66214 memcg: remove NUL... |
2590 |
BUG_ON(!pc); /* XXX: remove this and move pc lookup into commit */ |
7a81b88cb memcg: introduce ... |
2591 |
|
c0ff4b854 memcg: rename mem... |
2592 2593 |
ret = __mem_cgroup_try_charge(mm, gfp_mask, nr_pages, &memcg, oom); if (ret || !memcg) |
7a81b88cb memcg: introduce ... |
2594 |
return ret; |
c0ff4b854 memcg: rename mem... |
2595 |
__mem_cgroup_commit_charge(memcg, page, nr_pages, pc, ctype); |
8a9f3ccd2 Memory controller... |
2596 |
return 0; |
8a9f3ccd2 Memory controller... |
2597 |
} |
7a81b88cb memcg: introduce ... |
2598 2599 |
int mem_cgroup_newpage_charge(struct page *page, struct mm_struct *mm, gfp_t gfp_mask) |
217bc3194 memory cgroup enh... |
2600 |
{ |
f8d665422 memcg: add mem_cg... |
2601 |
if (mem_cgroup_disabled()) |
cede86acd memcg: clean up c... |
2602 |
return 0; |
69029cd55 memcg: remove ref... |
2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 |
/* * If already mapped, we don't have to account. * If page cache, page->mapping has address_space. * But page->mapping may have out-of-use anon_vma pointer, * detecit it by PageAnon() check. newly-mapped-anon's page->mapping * is NULL. */ if (page_mapped(page) || (page->mapping && !PageAnon(page))) return 0; if (unlikely(!mm)) mm = &init_mm; |
217bc3194 memory cgroup enh... |
2614 |
return mem_cgroup_charge_common(page, mm, gfp_mask, |
73045c47b memcg: remove mem... |
2615 |
MEM_CGROUP_CHARGE_TYPE_MAPPED); |
217bc3194 memory cgroup enh... |
2616 |
} |
83aae4c73 memcg: cleanup ca... |
2617 2618 2619 |
static void __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *ptr, enum charge_type ctype); |
5a6475a4e memcg: fix leak o... |
2620 |
static void |
c0ff4b854 memcg: rename mem... |
2621 |
__mem_cgroup_commit_charge_lrucare(struct page *page, struct mem_cgroup *memcg, |
5a6475a4e memcg: fix leak o... |
2622 2623 2624 2625 2626 2627 2628 2629 2630 |
enum charge_type ctype) { struct page_cgroup *pc = lookup_page_cgroup(page); /* * In some case, SwapCache, FUSE(splice_buf->radixtree), the page * is already on LRU. It means the page may on some other page_cgroup's * LRU. Take care of it. */ mem_cgroup_lru_del_before_commit(page); |
c0ff4b854 memcg: rename mem... |
2631 |
__mem_cgroup_commit_charge(memcg, page, 1, pc, ctype); |
5a6475a4e memcg: fix leak o... |
2632 2633 2634 |
mem_cgroup_lru_add_after_commit(page); return; } |
e1a1cd590 Memory controller... |
2635 2636 |
int mem_cgroup_cache_charge(struct page *page, struct mm_struct *mm, gfp_t gfp_mask) |
8697d3319 Memory controller... |
2637 |
{ |
c0ff4b854 memcg: rename mem... |
2638 |
struct mem_cgroup *memcg = NULL; |
b5a84319a memcg: fix shmem'... |
2639 |
int ret; |
f8d665422 memcg: add mem_cg... |
2640 |
if (mem_cgroup_disabled()) |
cede86acd memcg: clean up c... |
2641 |
return 0; |
52d4b9ac0 memcg: allocate a... |
2642 2643 |
if (PageCompound(page)) return 0; |
accf163e6 memcg: remove a r... |
2644 |
|
73045c47b memcg: remove mem... |
2645 |
if (unlikely(!mm)) |
8697d3319 Memory controller... |
2646 |
mm = &init_mm; |
accf163e6 memcg: remove a r... |
2647 |
|
5a6475a4e memcg: fix leak o... |
2648 |
if (page_is_file_cache(page)) { |
c0ff4b854 memcg: rename mem... |
2649 2650 |
ret = __mem_cgroup_try_charge(mm, gfp_mask, 1, &memcg, true); if (ret || !memcg) |
5a6475a4e memcg: fix leak o... |
2651 |
return ret; |
b5a84319a memcg: fix shmem'... |
2652 |
|
5a6475a4e memcg: fix leak o... |
2653 2654 2655 2656 2657 |
/* * FUSE reuses pages without going through the final * put that would remove them from the LRU list, make * sure that they get relinked properly. */ |
c0ff4b854 memcg: rename mem... |
2658 |
__mem_cgroup_commit_charge_lrucare(page, memcg, |
5a6475a4e memcg: fix leak o... |
2659 2660 2661 |
MEM_CGROUP_CHARGE_TYPE_CACHE); return ret; } |
83aae4c73 memcg: cleanup ca... |
2662 2663 |
/* shmem */ if (PageSwapCache(page)) { |
c0ff4b854 memcg: rename mem... |
2664 |
ret = mem_cgroup_try_charge_swapin(mm, page, gfp_mask, &memcg); |
83aae4c73 memcg: cleanup ca... |
2665 |
if (!ret) |
c0ff4b854 memcg: rename mem... |
2666 |
__mem_cgroup_commit_charge_swapin(page, memcg, |
83aae4c73 memcg: cleanup ca... |
2667 2668 2669 |
MEM_CGROUP_CHARGE_TYPE_SHMEM); } else ret = mem_cgroup_charge_common(page, mm, gfp_mask, |
73045c47b memcg: remove mem... |
2670 |
MEM_CGROUP_CHARGE_TYPE_SHMEM); |
b5a84319a memcg: fix shmem'... |
2671 |
|
b5a84319a memcg: fix shmem'... |
2672 |
return ret; |
e8589cc18 memcg: better mig... |
2673 |
} |
54595fe26 memcg: use css_tr... |
2674 2675 2676 |
/* * While swap-in, try_charge -> commit or cancel, the page is locked. * And when try_charge() successfully returns, one refcnt to memcg without |
21ae2956c tree-wide: fix ty... |
2677 |
* struct page_cgroup is acquired. This refcnt will be consumed by |
54595fe26 memcg: use css_tr... |
2678 2679 |
* "commit()" or removed by "cancel()" */ |
8c7c6e34a memcg: mem+swap c... |
2680 2681 2682 2683 |
int mem_cgroup_try_charge_swapin(struct mm_struct *mm, struct page *page, gfp_t mask, struct mem_cgroup **ptr) { |
c0ff4b854 memcg: rename mem... |
2684 |
struct mem_cgroup *memcg; |
54595fe26 memcg: use css_tr... |
2685 |
int ret; |
8c7c6e34a memcg: mem+swap c... |
2686 |
|
56039efa1 memcg: fix ugly i... |
2687 |
*ptr = NULL; |
f8d665422 memcg: add mem_cg... |
2688 |
if (mem_cgroup_disabled()) |
8c7c6e34a memcg: mem+swap c... |
2689 2690 2691 2692 |
return 0; if (!do_swap_account) goto charge_cur_mm; |
8c7c6e34a memcg: mem+swap c... |
2693 2694 |
/* * A racing thread's fault, or swapoff, may have already updated |
407f9c8b0 ksm: mem cgroup c... |
2695 2696 2697 |
* the pte, and even removed page from swap cache: in those cases * do_swap_page()'s pte_same() test will fail; but there's also a * KSM case which does need to charge the page. |
8c7c6e34a memcg: mem+swap c... |
2698 2699 |
*/ if (!PageSwapCache(page)) |
407f9c8b0 ksm: mem cgroup c... |
2700 |
goto charge_cur_mm; |
c0ff4b854 memcg: rename mem... |
2701 2702 |
memcg = try_get_mem_cgroup_from_page(page); if (!memcg) |
54595fe26 memcg: use css_tr... |
2703 |
goto charge_cur_mm; |
c0ff4b854 memcg: rename mem... |
2704 |
*ptr = memcg; |
7ec99d621 memcg: unify char... |
2705 |
ret = __mem_cgroup_try_charge(NULL, mask, 1, ptr, true); |
c0ff4b854 memcg: rename mem... |
2706 |
css_put(&memcg->css); |
54595fe26 memcg: use css_tr... |
2707 |
return ret; |
8c7c6e34a memcg: mem+swap c... |
2708 2709 2710 |
charge_cur_mm: if (unlikely(!mm)) mm = &init_mm; |
7ec99d621 memcg: unify char... |
2711 |
return __mem_cgroup_try_charge(mm, mask, 1, ptr, true); |
8c7c6e34a memcg: mem+swap c... |
2712 |
} |
83aae4c73 memcg: cleanup ca... |
2713 2714 2715 |
static void __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *ptr, enum charge_type ctype) |
7a81b88cb memcg: introduce ... |
2716 |
{ |
f8d665422 memcg: add mem_cg... |
2717 |
if (mem_cgroup_disabled()) |
7a81b88cb memcg: introduce ... |
2718 2719 2720 |
return; if (!ptr) return; |
887032670 cgroup avoid perm... |
2721 |
cgroup_exclude_rmdir(&ptr->css); |
5a6475a4e memcg: fix leak o... |
2722 2723 |
__mem_cgroup_commit_charge_lrucare(page, ptr, ctype); |
8c7c6e34a memcg: mem+swap c... |
2724 2725 2726 |
/* * Now swap is on-memory. This means this page may be * counted both as mem and swap....double count. |
03f3c4336 memcg: fix swap a... |
2727 2728 2729 |
* Fix it by uncharging from memsw. Basically, this SwapCache is stable * under lock_page(). But in do_swap_page()::memory.c, reuse_swap_page() * may call delete_from_swap_cache() before reach here. |
8c7c6e34a memcg: mem+swap c... |
2730 |
*/ |
03f3c4336 memcg: fix swap a... |
2731 |
if (do_swap_account && PageSwapCache(page)) { |
8c7c6e34a memcg: mem+swap c... |
2732 |
swp_entry_t ent = {.val = page_private(page)}; |
a3b2d6926 cgroups: use css ... |
2733 |
unsigned short id; |
8c7c6e34a memcg: mem+swap c... |
2734 |
struct mem_cgroup *memcg; |
a3b2d6926 cgroups: use css ... |
2735 2736 2737 2738 |
id = swap_cgroup_record(ent, 0); rcu_read_lock(); memcg = mem_cgroup_lookup(id); |
8c7c6e34a memcg: mem+swap c... |
2739 |
if (memcg) { |
a3b2d6926 cgroups: use css ... |
2740 2741 2742 2743 |
/* * This recorded memcg can be obsolete one. So, avoid * calling css_tryget */ |
0c3e73e84 memcg: improve re... |
2744 |
if (!mem_cgroup_is_root(memcg)) |
4e649152c memcg: some modif... |
2745 |
res_counter_uncharge(&memcg->memsw, PAGE_SIZE); |
0c3e73e84 memcg: improve re... |
2746 |
mem_cgroup_swap_statistics(memcg, false); |
8c7c6e34a memcg: mem+swap c... |
2747 2748 |
mem_cgroup_put(memcg); } |
a3b2d6926 cgroups: use css ... |
2749 |
rcu_read_unlock(); |
8c7c6e34a memcg: mem+swap c... |
2750 |
} |
887032670 cgroup avoid perm... |
2751 2752 2753 2754 2755 2756 |
/* * At swapin, we may charge account against cgroup which has no tasks. * So, rmdir()->pre_destroy() can be called while we do this charge. * In that case, we need to call pre_destroy() again. check it here. */ cgroup_release_and_wakeup_rmdir(&ptr->css); |
7a81b88cb memcg: introduce ... |
2757 |
} |
83aae4c73 memcg: cleanup ca... |
2758 2759 2760 2761 2762 |
void mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *ptr) { __mem_cgroup_commit_charge_swapin(page, ptr, MEM_CGROUP_CHARGE_TYPE_MAPPED); } |
c0ff4b854 memcg: rename mem... |
2763 |
void mem_cgroup_cancel_charge_swapin(struct mem_cgroup *memcg) |
7a81b88cb memcg: introduce ... |
2764 |
{ |
f8d665422 memcg: add mem_cg... |
2765 |
if (mem_cgroup_disabled()) |
7a81b88cb memcg: introduce ... |
2766 |
return; |
c0ff4b854 memcg: rename mem... |
2767 |
if (!memcg) |
7a81b88cb memcg: introduce ... |
2768 |
return; |
c0ff4b854 memcg: rename mem... |
2769 |
__mem_cgroup_cancel_charge(memcg, 1); |
7a81b88cb memcg: introduce ... |
2770 |
} |
c0ff4b854 memcg: rename mem... |
2771 |
static void mem_cgroup_do_uncharge(struct mem_cgroup *memcg, |
7ec99d621 memcg: unify char... |
2772 2773 |
unsigned int nr_pages, const enum charge_type ctype) |
569b846df memcg: coalesce u... |
2774 2775 2776 |
{ struct memcg_batch_info *batch = NULL; bool uncharge_memsw = true; |
7ec99d621 memcg: unify char... |
2777 |
|
569b846df memcg: coalesce u... |
2778 2779 2780 |
/* If swapout, usage of swap doesn't decrease */ if (!do_swap_account || ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) uncharge_memsw = false; |
569b846df memcg: coalesce u... |
2781 2782 2783 2784 2785 2786 2787 2788 |
batch = ¤t->memcg_batch; /* * In usual, we do css_get() when we remember memcg pointer. * But in this case, we keep res->usage until end of a series of * uncharges. Then, it's ok to ignore memcg's refcnt. */ if (!batch->memcg) |
c0ff4b854 memcg: rename mem... |
2789 |
batch->memcg = memcg; |
569b846df memcg: coalesce u... |
2790 |
/* |
3c11ecf44 memcg: oom kill d... |
2791 |
* do_batch > 0 when unmapping pages or inode invalidate/truncate. |
25985edce Fix common misspe... |
2792 |
* In those cases, all pages freed continuously can be expected to be in |
3c11ecf44 memcg: oom kill d... |
2793 2794 2795 2796 2797 2798 2799 |
* the same cgroup and we have chance to coalesce uncharges. * But we do uncharge one by one if this is killed by OOM(TIF_MEMDIE) * because we want to do uncharge as soon as possible. */ if (!batch->do_batch || test_thread_flag(TIF_MEMDIE)) goto direct_uncharge; |
7ec99d621 memcg: unify char... |
2800 |
if (nr_pages > 1) |
ec1685109 thp: memcg compound |
2801 |
goto direct_uncharge; |
3c11ecf44 memcg: oom kill d... |
2802 |
/* |
569b846df memcg: coalesce u... |
2803 2804 2805 2806 |
* In typical case, batch->memcg == mem. This means we can * merge a series of uncharges to an uncharge of res_counter. * If not, we uncharge res_counter ony by one. */ |
c0ff4b854 memcg: rename mem... |
2807 |
if (batch->memcg != memcg) |
569b846df memcg: coalesce u... |
2808 2809 |
goto direct_uncharge; /* remember freed charge and uncharge it later */ |
7ffd4ca7a memcg: convert un... |
2810 |
batch->nr_pages++; |
569b846df memcg: coalesce u... |
2811 |
if (uncharge_memsw) |
7ffd4ca7a memcg: convert un... |
2812 |
batch->memsw_nr_pages++; |
569b846df memcg: coalesce u... |
2813 2814 |
return; direct_uncharge: |
c0ff4b854 memcg: rename mem... |
2815 |
res_counter_uncharge(&memcg->res, nr_pages * PAGE_SIZE); |
569b846df memcg: coalesce u... |
2816 |
if (uncharge_memsw) |
c0ff4b854 memcg: rename mem... |
2817 2818 2819 |
res_counter_uncharge(&memcg->memsw, nr_pages * PAGE_SIZE); if (unlikely(batch->memcg != memcg)) memcg_oom_recover(memcg); |
569b846df memcg: coalesce u... |
2820 2821 |
return; } |
7a81b88cb memcg: introduce ... |
2822 |
|
8697d3319 Memory controller... |
2823 |
/* |
69029cd55 memcg: remove ref... |
2824 |
* uncharge if !page_mapped(page) |
8a9f3ccd2 Memory controller... |
2825 |
*/ |
8c7c6e34a memcg: mem+swap c... |
2826 |
static struct mem_cgroup * |
69029cd55 memcg: remove ref... |
2827 |
__mem_cgroup_uncharge_common(struct page *page, enum charge_type ctype) |
8a9f3ccd2 Memory controller... |
2828 |
{ |
c0ff4b854 memcg: rename mem... |
2829 |
struct mem_cgroup *memcg = NULL; |
7ec99d621 memcg: unify char... |
2830 2831 |
unsigned int nr_pages = 1; struct page_cgroup *pc; |
8a9f3ccd2 Memory controller... |
2832 |
|
f8d665422 memcg: add mem_cg... |
2833 |
if (mem_cgroup_disabled()) |
8c7c6e34a memcg: mem+swap c... |
2834 |
return NULL; |
4077960e2 memory controller... |
2835 |
|
d13d14430 memcg: handle swa... |
2836 |
if (PageSwapCache(page)) |
8c7c6e34a memcg: mem+swap c... |
2837 |
return NULL; |
d13d14430 memcg: handle swa... |
2838 |
|
37c2ac787 thp: compound_tra... |
2839 |
if (PageTransHuge(page)) { |
7ec99d621 memcg: unify char... |
2840 |
nr_pages <<= compound_order(page); |
37c2ac787 thp: compound_tra... |
2841 2842 |
VM_BUG_ON(!PageTransHuge(page)); } |
8697d3319 Memory controller... |
2843 |
/* |
3c541e14b Memory controller... |
2844 |
* Check if our page_cgroup is valid |
8697d3319 Memory controller... |
2845 |
*/ |
52d4b9ac0 memcg: allocate a... |
2846 2847 |
pc = lookup_page_cgroup(page); if (unlikely(!pc || !PageCgroupUsed(pc))) |
8c7c6e34a memcg: mem+swap c... |
2848 |
return NULL; |
b9c565d5a memcg: remove cle... |
2849 |
|
52d4b9ac0 memcg: allocate a... |
2850 |
lock_page_cgroup(pc); |
d13d14430 memcg: handle swa... |
2851 |
|
c0ff4b854 memcg: rename mem... |
2852 |
memcg = pc->mem_cgroup; |
8c7c6e34a memcg: mem+swap c... |
2853 |
|
d13d14430 memcg: handle swa... |
2854 2855 2856 2857 2858 |
if (!PageCgroupUsed(pc)) goto unlock_out; switch (ctype) { case MEM_CGROUP_CHARGE_TYPE_MAPPED: |
8a9478ca7 memcg: fix swap a... |
2859 |
case MEM_CGROUP_CHARGE_TYPE_DROP: |
ac39cf8cb memcg: fix mis-ac... |
2860 2861 |
/* See mem_cgroup_prepare_migration() */ if (page_mapped(page) || PageCgroupMigration(pc)) |
d13d14430 memcg: handle swa... |
2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 |
goto unlock_out; break; case MEM_CGROUP_CHARGE_TYPE_SWAPOUT: if (!PageAnon(page)) { /* Shared memory */ if (page->mapping && !page_is_file_cache(page)) goto unlock_out; } else if (page_mapped(page)) /* Anon */ goto unlock_out; break; default: break; |
52d4b9ac0 memcg: allocate a... |
2873 |
} |
d13d14430 memcg: handle swa... |
2874 |
|
c0ff4b854 memcg: rename mem... |
2875 |
mem_cgroup_charge_statistics(memcg, PageCgroupCache(pc), -nr_pages); |
04046e1a0 memcg: use CSS ID |
2876 |
|
52d4b9ac0 memcg: allocate a... |
2877 |
ClearPageCgroupUsed(pc); |
544122e5e memcg: fix LRU ac... |
2878 2879 2880 2881 2882 2883 |
/* * pc->mem_cgroup is not cleared here. It will be accessed when it's * freed from LRU. This is safe because uncharged page is expected not * to be reused (freed soon). Exception is SwapCache, it's handled by * special functions. */ |
b9c565d5a memcg: remove cle... |
2884 |
|
52d4b9ac0 memcg: allocate a... |
2885 |
unlock_page_cgroup(pc); |
f75ca9620 memcg: avoid css_... |
2886 |
/* |
c0ff4b854 memcg: rename mem... |
2887 |
* even after unlock, we have memcg->res.usage here and this memcg |
f75ca9620 memcg: avoid css_... |
2888 2889 |
* will never be freed. */ |
c0ff4b854 memcg: rename mem... |
2890 |
memcg_check_events(memcg, page); |
f75ca9620 memcg: avoid css_... |
2891 |
if (do_swap_account && ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) { |
c0ff4b854 memcg: rename mem... |
2892 2893 |
mem_cgroup_swap_statistics(memcg, true); mem_cgroup_get(memcg); |
f75ca9620 memcg: avoid css_... |
2894 |
} |
c0ff4b854 memcg: rename mem... |
2895 2896 |
if (!mem_cgroup_is_root(memcg)) mem_cgroup_do_uncharge(memcg, nr_pages, ctype); |
6d12e2d8d per-zone and recl... |
2897 |
|
c0ff4b854 memcg: rename mem... |
2898 |
return memcg; |
d13d14430 memcg: handle swa... |
2899 2900 2901 |
unlock_out: unlock_page_cgroup(pc); |
8c7c6e34a memcg: mem+swap c... |
2902 |
return NULL; |
3c541e14b Memory controller... |
2903 |
} |
69029cd55 memcg: remove ref... |
2904 2905 |
void mem_cgroup_uncharge_page(struct page *page) { |
52d4b9ac0 memcg: allocate a... |
2906 2907 2908 2909 2910 |
/* early check. */ if (page_mapped(page)) return; if (page->mapping && !PageAnon(page)) return; |
69029cd55 memcg: remove ref... |
2911 2912 2913 2914 2915 2916 |
__mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_MAPPED); } void mem_cgroup_uncharge_cache_page(struct page *page) { VM_BUG_ON(page_mapped(page)); |
b7abea963 memcg: make page-... |
2917 |
VM_BUG_ON(page->mapping); |
69029cd55 memcg: remove ref... |
2918 2919 |
__mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_CACHE); } |
569b846df memcg: coalesce u... |
2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 |
/* * Batch_start/batch_end is called in unmap_page_range/invlidate/trucate. * In that cases, pages are freed continuously and we can expect pages * are in the same memcg. All these calls itself limits the number of * pages freed at once, then uncharge_start/end() is called properly. * This may be called prural(2) times in a context, */ void mem_cgroup_uncharge_start(void) { current->memcg_batch.do_batch++; /* We can do nest. */ if (current->memcg_batch.do_batch == 1) { current->memcg_batch.memcg = NULL; |
7ffd4ca7a memcg: convert un... |
2934 2935 |
current->memcg_batch.nr_pages = 0; current->memcg_batch.memsw_nr_pages = 0; |
569b846df memcg: coalesce u... |
2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 |
} } void mem_cgroup_uncharge_end(void) { struct memcg_batch_info *batch = ¤t->memcg_batch; if (!batch->do_batch) return; batch->do_batch--; if (batch->do_batch) /* If stacked, do nothing. */ return; if (!batch->memcg) return; /* * This "batch->memcg" is valid without any css_get/put etc... * bacause we hide charges behind us. */ |
7ffd4ca7a memcg: convert un... |
2956 2957 2958 2959 2960 2961 |
if (batch->nr_pages) res_counter_uncharge(&batch->memcg->res, batch->nr_pages * PAGE_SIZE); if (batch->memsw_nr_pages) res_counter_uncharge(&batch->memcg->memsw, batch->memsw_nr_pages * PAGE_SIZE); |
3c11ecf44 memcg: oom kill d... |
2962 |
memcg_oom_recover(batch->memcg); |
569b846df memcg: coalesce u... |
2963 2964 2965 |
/* forget this pointer (for sanity check) */ batch->memcg = NULL; } |
e767e0561 memcg: fix deadlo... |
2966 |
#ifdef CONFIG_SWAP |
8c7c6e34a memcg: mem+swap c... |
2967 |
/* |
e767e0561 memcg: fix deadlo... |
2968 |
* called after __delete_from_swap_cache() and drop "page" account. |
8c7c6e34a memcg: mem+swap c... |
2969 2970 |
* memcg information is recorded to swap_cgroup of "ent" */ |
8a9478ca7 memcg: fix swap a... |
2971 2972 |
void mem_cgroup_uncharge_swapcache(struct page *page, swp_entry_t ent, bool swapout) |
8c7c6e34a memcg: mem+swap c... |
2973 2974 |
{ struct mem_cgroup *memcg; |
8a9478ca7 memcg: fix swap a... |
2975 2976 2977 2978 2979 2980 |
int ctype = MEM_CGROUP_CHARGE_TYPE_SWAPOUT; if (!swapout) /* this was a swap cache but the swap is unused ! */ ctype = MEM_CGROUP_CHARGE_TYPE_DROP; memcg = __mem_cgroup_uncharge_common(page, ctype); |
8c7c6e34a memcg: mem+swap c... |
2981 |
|
f75ca9620 memcg: avoid css_... |
2982 2983 2984 2985 2986 |
/* * record memcg information, if swapout && memcg != NULL, * mem_cgroup_get() was called in uncharge(). */ if (do_swap_account && swapout && memcg) |
a3b2d6926 cgroups: use css ... |
2987 |
swap_cgroup_record(ent, css_id(&memcg->css)); |
8c7c6e34a memcg: mem+swap c... |
2988 |
} |
e767e0561 memcg: fix deadlo... |
2989 |
#endif |
8c7c6e34a memcg: mem+swap c... |
2990 2991 2992 2993 2994 2995 2996 |
#ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP /* * called from swap_entry_free(). remove record in swap_cgroup and * uncharge "memsw" account. */ void mem_cgroup_uncharge_swap(swp_entry_t ent) |
d13d14430 memcg: handle swa... |
2997 |
{ |
8c7c6e34a memcg: mem+swap c... |
2998 |
struct mem_cgroup *memcg; |
a3b2d6926 cgroups: use css ... |
2999 |
unsigned short id; |
8c7c6e34a memcg: mem+swap c... |
3000 3001 3002 |
if (!do_swap_account) return; |
a3b2d6926 cgroups: use css ... |
3003 3004 3005 |
id = swap_cgroup_record(ent, 0); rcu_read_lock(); memcg = mem_cgroup_lookup(id); |
8c7c6e34a memcg: mem+swap c... |
3006 |
if (memcg) { |
a3b2d6926 cgroups: use css ... |
3007 3008 3009 3010 |
/* * We uncharge this because swap is freed. * This memcg can be obsolete one. We avoid calling css_tryget */ |
0c3e73e84 memcg: improve re... |
3011 |
if (!mem_cgroup_is_root(memcg)) |
4e649152c memcg: some modif... |
3012 |
res_counter_uncharge(&memcg->memsw, PAGE_SIZE); |
0c3e73e84 memcg: improve re... |
3013 |
mem_cgroup_swap_statistics(memcg, false); |
8c7c6e34a memcg: mem+swap c... |
3014 3015 |
mem_cgroup_put(memcg); } |
a3b2d6926 cgroups: use css ... |
3016 |
rcu_read_unlock(); |
d13d14430 memcg: handle swa... |
3017 |
} |
024914477 memcg: move charg... |
3018 3019 3020 3021 3022 3023 |
/** * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record. * @entry: swap entry to be moved * @from: mem_cgroup which the entry is moved from * @to: mem_cgroup which the entry is moved to |
483c30b51 memcg: improve pe... |
3024 |
* @need_fixup: whether we should fixup res_counters and refcounts. |
024914477 memcg: move charg... |
3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 |
* * It succeeds only when the swap_cgroup's record for this entry is the same * as the mem_cgroup's id of @from. * * Returns 0 on success, -EINVAL on failure. * * The caller must have charged to @to, IOW, called res_counter_charge() about * both res and memsw, and called css_get(). */ static int mem_cgroup_move_swap_account(swp_entry_t entry, |
483c30b51 memcg: improve pe... |
3035 |
struct mem_cgroup *from, struct mem_cgroup *to, bool need_fixup) |
024914477 memcg: move charg... |
3036 3037 3038 3039 3040 3041 3042 |
{ unsigned short old_id, new_id; old_id = css_id(&from->css); new_id = css_id(&to->css); if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) { |
024914477 memcg: move charg... |
3043 |
mem_cgroup_swap_statistics(from, false); |
483c30b51 memcg: improve pe... |
3044 |
mem_cgroup_swap_statistics(to, true); |
024914477 memcg: move charg... |
3045 |
/* |
483c30b51 memcg: improve pe... |
3046 3047 3048 3049 3050 3051 |
* This function is only called from task migration context now. * It postpones res_counter and refcount handling till the end * of task migration(mem_cgroup_clear_mc()) for performance * improvement. But we cannot postpone mem_cgroup_get(to) * because if the process that has been moved to @to does * swap-in, the refcount of @to might be decreased to 0. |
024914477 memcg: move charg... |
3052 |
*/ |
024914477 memcg: move charg... |
3053 |
mem_cgroup_get(to); |
483c30b51 memcg: improve pe... |
3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 |
if (need_fixup) { if (!mem_cgroup_is_root(from)) res_counter_uncharge(&from->memsw, PAGE_SIZE); mem_cgroup_put(from); /* * we charged both to->res and to->memsw, so we should * uncharge to->res. */ if (!mem_cgroup_is_root(to)) res_counter_uncharge(&to->res, PAGE_SIZE); |
483c30b51 memcg: improve pe... |
3064 |
} |
024914477 memcg: move charg... |
3065 3066 3067 3068 3069 3070 |
return 0; } return -EINVAL; } #else static inline int mem_cgroup_move_swap_account(swp_entry_t entry, |
483c30b51 memcg: improve pe... |
3071 |
struct mem_cgroup *from, struct mem_cgroup *to, bool need_fixup) |
024914477 memcg: move charg... |
3072 3073 3074 |
{ return -EINVAL; } |
8c7c6e34a memcg: mem+swap c... |
3075 |
#endif |
d13d14430 memcg: handle swa... |
3076 |
|
ae41be374 bugfix for memory... |
3077 |
/* |
01b1ae63c memcg: simple mig... |
3078 3079 |
* Before starting migration, account PAGE_SIZE to mem_cgroup that the old * page belongs to. |
ae41be374 bugfix for memory... |
3080 |
*/ |
ac39cf8cb memcg: fix mis-ac... |
3081 |
int mem_cgroup_prepare_migration(struct page *page, |
ef6a3c631 mm: add replace_p... |
3082 |
struct page *newpage, struct mem_cgroup **ptr, gfp_t gfp_mask) |
ae41be374 bugfix for memory... |
3083 |
{ |
c0ff4b854 memcg: rename mem... |
3084 |
struct mem_cgroup *memcg = NULL; |
7ec99d621 memcg: unify char... |
3085 |
struct page_cgroup *pc; |
ac39cf8cb memcg: fix mis-ac... |
3086 |
enum charge_type ctype; |
e8589cc18 memcg: better mig... |
3087 |
int ret = 0; |
8869b8f6e memcg: memcontrol... |
3088 |
|
56039efa1 memcg: fix ugly i... |
3089 |
*ptr = NULL; |
ec1685109 thp: memcg compound |
3090 |
VM_BUG_ON(PageTransHuge(page)); |
f8d665422 memcg: add mem_cg... |
3091 |
if (mem_cgroup_disabled()) |
4077960e2 memory controller... |
3092 |
return 0; |
52d4b9ac0 memcg: allocate a... |
3093 3094 3095 |
pc = lookup_page_cgroup(page); lock_page_cgroup(pc); if (PageCgroupUsed(pc)) { |
c0ff4b854 memcg: rename mem... |
3096 3097 |
memcg = pc->mem_cgroup; css_get(&memcg->css); |
ac39cf8cb memcg: fix mis-ac... |
3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 |
/* * At migrating an anonymous page, its mapcount goes down * to 0 and uncharge() will be called. But, even if it's fully * unmapped, migration may fail and this page has to be * charged again. We set MIGRATION flag here and delay uncharge * until end_migration() is called * * Corner Case Thinking * A) * When the old page was mapped as Anon and it's unmap-and-freed * while migration was ongoing. * If unmap finds the old page, uncharge() of it will be delayed * until end_migration(). If unmap finds a new page, it's * uncharged when it make mapcount to be 1->0. If unmap code * finds swap_migration_entry, the new page will not be mapped * and end_migration() will find it(mapcount==0). * * B) * When the old page was mapped but migraion fails, the kernel * remaps it. A charge for it is kept by MIGRATION flag even * if mapcount goes down to 0. We can do remap successfully * without charging it again. * * C) * The "old" page is under lock_page() until the end of * migration, so, the old page itself will not be swapped-out. * If the new page is swapped out before end_migraton, our * hook to usual swap-out path will catch the event. */ if (PageAnon(page)) SetPageCgroupMigration(pc); |
e8589cc18 memcg: better mig... |
3129 |
} |
52d4b9ac0 memcg: allocate a... |
3130 |
unlock_page_cgroup(pc); |
ac39cf8cb memcg: fix mis-ac... |
3131 3132 3133 3134 |
/* * If the page is not charged at this point, * we return here. */ |
c0ff4b854 memcg: rename mem... |
3135 |
if (!memcg) |
ac39cf8cb memcg: fix mis-ac... |
3136 |
return 0; |
01b1ae63c memcg: simple mig... |
3137 |
|
c0ff4b854 memcg: rename mem... |
3138 |
*ptr = memcg; |
7ec99d621 memcg: unify char... |
3139 |
ret = __mem_cgroup_try_charge(NULL, gfp_mask, 1, ptr, false); |
c0ff4b854 memcg: rename mem... |
3140 |
css_put(&memcg->css);/* drop extra refcnt */ |
ac39cf8cb memcg: fix mis-ac... |
3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 |
if (ret || *ptr == NULL) { if (PageAnon(page)) { lock_page_cgroup(pc); ClearPageCgroupMigration(pc); unlock_page_cgroup(pc); /* * The old page may be fully unmapped while we kept it. */ mem_cgroup_uncharge_page(page); } return -ENOMEM; |
e8589cc18 memcg: better mig... |
3152 |
} |
ac39cf8cb memcg: fix mis-ac... |
3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 |
/* * We charge new page before it's used/mapped. So, even if unlock_page() * is called before end_migration, we can catch all events on this new * page. In the case new page is migrated but not remapped, new page's * mapcount will be finally 0 and we call uncharge in end_migration(). */ pc = lookup_page_cgroup(newpage); if (PageAnon(page)) ctype = MEM_CGROUP_CHARGE_TYPE_MAPPED; else if (page_is_file_cache(page)) ctype = MEM_CGROUP_CHARGE_TYPE_CACHE; else ctype = MEM_CGROUP_CHARGE_TYPE_SHMEM; |
c0ff4b854 memcg: rename mem... |
3166 |
__mem_cgroup_commit_charge(memcg, page, 1, pc, ctype); |
e8589cc18 memcg: better mig... |
3167 |
return ret; |
ae41be374 bugfix for memory... |
3168 |
} |
8869b8f6e memcg: memcontrol... |
3169 |
|
69029cd55 memcg: remove ref... |
3170 |
/* remove redundant charge if migration failed*/ |
c0ff4b854 memcg: rename mem... |
3171 |
void mem_cgroup_end_migration(struct mem_cgroup *memcg, |
50de1dd96 memcg: fix memory... |
3172 |
struct page *oldpage, struct page *newpage, bool migration_ok) |
ae41be374 bugfix for memory... |
3173 |
{ |
ac39cf8cb memcg: fix mis-ac... |
3174 |
struct page *used, *unused; |
01b1ae63c memcg: simple mig... |
3175 |
struct page_cgroup *pc; |
01b1ae63c memcg: simple mig... |
3176 |
|
c0ff4b854 memcg: rename mem... |
3177 |
if (!memcg) |
01b1ae63c memcg: simple mig... |
3178 |
return; |
ac39cf8cb memcg: fix mis-ac... |
3179 |
/* blocks rmdir() */ |
c0ff4b854 memcg: rename mem... |
3180 |
cgroup_exclude_rmdir(&memcg->css); |
50de1dd96 memcg: fix memory... |
3181 |
if (!migration_ok) { |
ac39cf8cb memcg: fix mis-ac... |
3182 3183 |
used = oldpage; unused = newpage; |
01b1ae63c memcg: simple mig... |
3184 |
} else { |
ac39cf8cb memcg: fix mis-ac... |
3185 |
used = newpage; |
01b1ae63c memcg: simple mig... |
3186 3187 |
unused = oldpage; } |
69029cd55 memcg: remove ref... |
3188 |
/* |
ac39cf8cb memcg: fix mis-ac... |
3189 3190 3191 |
* We disallowed uncharge of pages under migration because mapcount * of the page goes down to zero, temporarly. * Clear the flag and check the page should be charged. |
01b1ae63c memcg: simple mig... |
3192 |
*/ |
ac39cf8cb memcg: fix mis-ac... |
3193 3194 3195 3196 |
pc = lookup_page_cgroup(oldpage); lock_page_cgroup(pc); ClearPageCgroupMigration(pc); unlock_page_cgroup(pc); |
01b1ae63c memcg: simple mig... |
3197 |
|
ac39cf8cb memcg: fix mis-ac... |
3198 |
__mem_cgroup_uncharge_common(unused, MEM_CGROUP_CHARGE_TYPE_FORCE); |
01b1ae63c memcg: simple mig... |
3199 |
/* |
ac39cf8cb memcg: fix mis-ac... |
3200 3201 3202 3203 3204 3205 |
* If a page is a file cache, radix-tree replacement is very atomic * and we can skip this check. When it was an Anon page, its mapcount * goes down to 0. But because we added MIGRATION flage, it's not * uncharged yet. There are several case but page->mapcount check * and USED bit check in mem_cgroup_uncharge_page() will do enough * check. (see prepare_charge() also) |
69029cd55 memcg: remove ref... |
3206 |
*/ |
ac39cf8cb memcg: fix mis-ac... |
3207 3208 |
if (PageAnon(used)) mem_cgroup_uncharge_page(used); |
887032670 cgroup avoid perm... |
3209 |
/* |
ac39cf8cb memcg: fix mis-ac... |
3210 3211 |
* At migration, we may charge account against cgroup which has no * tasks. |
887032670 cgroup avoid perm... |
3212 3213 3214 |
* So, rmdir()->pre_destroy() can be called while we do this charge. * In that case, we need to call pre_destroy() again. check it here. */ |
c0ff4b854 memcg: rename mem... |
3215 |
cgroup_release_and_wakeup_rmdir(&memcg->css); |
ae41be374 bugfix for memory... |
3216 |
} |
78fb74669 Memory controller... |
3217 |
|
f212ad7cf memcg: add memcg ... |
3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 |
#ifdef CONFIG_DEBUG_VM static struct page_cgroup *lookup_page_cgroup_used(struct page *page) { struct page_cgroup *pc; pc = lookup_page_cgroup(page); if (likely(pc) && PageCgroupUsed(pc)) return pc; return NULL; } bool mem_cgroup_bad_page_check(struct page *page) { if (mem_cgroup_disabled()) return false; return lookup_page_cgroup_used(page) != NULL; } void mem_cgroup_print_bad_page(struct page *page) { struct page_cgroup *pc; pc = lookup_page_cgroup_used(page); if (pc) { int ret = -1; char *path; printk(KERN_ALERT "pc:%p pc->flags:%lx pc->mem_cgroup:%p", pc, pc->flags, pc->mem_cgroup); path = kmalloc(PATH_MAX, GFP_KERNEL); if (path) { rcu_read_lock(); ret = cgroup_path(pc->mem_cgroup->css.cgroup, path, PATH_MAX); rcu_read_unlock(); } printk(KERN_CONT "(%s) ", (ret < 0) ? "cannot get the path" : path); kfree(path); } } #endif |
8c7c6e34a memcg: mem+swap c... |
3264 |
static DEFINE_MUTEX(set_limit_mutex); |
d38d2a758 mm: make mem_cgro... |
3265 |
static int mem_cgroup_resize_limit(struct mem_cgroup *memcg, |
8c7c6e34a memcg: mem+swap c... |
3266 |
unsigned long long val) |
628f42355 memcg: limit chan... |
3267 |
{ |
81d39c20f memcg: fix shrink... |
3268 |
int retry_count; |
3c11ecf44 memcg: oom kill d... |
3269 |
u64 memswlimit, memlimit; |
628f42355 memcg: limit chan... |
3270 |
int ret = 0; |
81d39c20f memcg: fix shrink... |
3271 3272 |
int children = mem_cgroup_count_children(memcg); u64 curusage, oldusage; |
3c11ecf44 memcg: oom kill d... |
3273 |
int enlarge; |
81d39c20f memcg: fix shrink... |
3274 3275 3276 3277 3278 3279 3280 3281 3282 |
/* * For keeping hierarchical_reclaim simple, how long we should retry * is depends on callers. We set our retry-count to be function * of # of children which we should visit in this loop. */ retry_count = MEM_CGROUP_RECLAIM_RETRIES * children; oldusage = res_counter_read_u64(&memcg->res, RES_USAGE); |
628f42355 memcg: limit chan... |
3283 |
|
3c11ecf44 memcg: oom kill d... |
3284 |
enlarge = 0; |
8c7c6e34a memcg: mem+swap c... |
3285 |
while (retry_count) { |
628f42355 memcg: limit chan... |
3286 3287 3288 3289 |
if (signal_pending(current)) { ret = -EINTR; break; } |
8c7c6e34a memcg: mem+swap c... |
3290 3291 3292 |
/* * Rather than hide all in some function, I do this in * open coded manner. You see what this really does. |
c0ff4b854 memcg: rename mem... |
3293 |
* We have to guarantee memcg->res.limit < memcg->memsw.limit. |
8c7c6e34a memcg: mem+swap c... |
3294 3295 3296 3297 3298 3299 |
*/ mutex_lock(&set_limit_mutex); memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT); if (memswlimit < val) { ret = -EINVAL; mutex_unlock(&set_limit_mutex); |
628f42355 memcg: limit chan... |
3300 3301 |
break; } |
3c11ecf44 memcg: oom kill d... |
3302 3303 3304 3305 |
memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT); if (memlimit < val) enlarge = 1; |
8c7c6e34a memcg: mem+swap c... |
3306 |
ret = res_counter_set_limit(&memcg->res, val); |
22a668d7c memcg: fix behavi... |
3307 3308 3309 3310 3311 3312 |
if (!ret) { if (memswlimit == val) memcg->memsw_is_minimum = true; else memcg->memsw_is_minimum = false; } |
8c7c6e34a memcg: mem+swap c... |
3313 3314 3315 3316 |
mutex_unlock(&set_limit_mutex); if (!ret) break; |
aa20d489c memcg: code clean... |
3317 |
mem_cgroup_hierarchical_reclaim(memcg, NULL, GFP_KERNEL, |
0ae5e89c6 memcg: count the ... |
3318 3319 |
MEM_CGROUP_RECLAIM_SHRINK, NULL); |
81d39c20f memcg: fix shrink... |
3320 3321 3322 3323 3324 3325 |
curusage = res_counter_read_u64(&memcg->res, RES_USAGE); /* Usage is reduced ? */ if (curusage >= oldusage) retry_count--; else oldusage = curusage; |
8c7c6e34a memcg: mem+swap c... |
3326 |
} |
3c11ecf44 memcg: oom kill d... |
3327 3328 |
if (!ret && enlarge) memcg_oom_recover(memcg); |
14797e236 memcg: add inacti... |
3329 |
|
8c7c6e34a memcg: mem+swap c... |
3330 3331 |
return ret; } |
338c84310 memcg: remove som... |
3332 3333 |
static int mem_cgroup_resize_memsw_limit(struct mem_cgroup *memcg, unsigned long long val) |
8c7c6e34a memcg: mem+swap c... |
3334 |
{ |
81d39c20f memcg: fix shrink... |
3335 |
int retry_count; |
3c11ecf44 memcg: oom kill d... |
3336 |
u64 memlimit, memswlimit, oldusage, curusage; |
81d39c20f memcg: fix shrink... |
3337 3338 |
int children = mem_cgroup_count_children(memcg); int ret = -EBUSY; |
3c11ecf44 memcg: oom kill d... |
3339 |
int enlarge = 0; |
8c7c6e34a memcg: mem+swap c... |
3340 |
|
81d39c20f memcg: fix shrink... |
3341 3342 3343 |
/* see mem_cgroup_resize_res_limit */ retry_count = children * MEM_CGROUP_RECLAIM_RETRIES; oldusage = res_counter_read_u64(&memcg->memsw, RES_USAGE); |
8c7c6e34a memcg: mem+swap c... |
3344 3345 3346 3347 3348 3349 3350 3351 |
while (retry_count) { if (signal_pending(current)) { ret = -EINTR; break; } /* * Rather than hide all in some function, I do this in * open coded manner. You see what this really does. |
c0ff4b854 memcg: rename mem... |
3352 |
* We have to guarantee memcg->res.limit < memcg->memsw.limit. |
8c7c6e34a memcg: mem+swap c... |
3353 3354 3355 3356 3357 3358 3359 3360 |
*/ mutex_lock(&set_limit_mutex); memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT); if (memlimit > val) { ret = -EINVAL; mutex_unlock(&set_limit_mutex); break; } |
3c11ecf44 memcg: oom kill d... |
3361 3362 3363 |
memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT); if (memswlimit < val) enlarge = 1; |
8c7c6e34a memcg: mem+swap c... |
3364 |
ret = res_counter_set_limit(&memcg->memsw, val); |
22a668d7c memcg: fix behavi... |
3365 3366 3367 3368 3369 3370 |
if (!ret) { if (memlimit == val) memcg->memsw_is_minimum = true; else memcg->memsw_is_minimum = false; } |
8c7c6e34a memcg: mem+swap c... |
3371 3372 3373 3374 |
mutex_unlock(&set_limit_mutex); if (!ret) break; |
4e4169535 memory controller... |
3375 |
mem_cgroup_hierarchical_reclaim(memcg, NULL, GFP_KERNEL, |
75822b449 memory controller... |
3376 |
MEM_CGROUP_RECLAIM_NOSWAP | |
0ae5e89c6 memcg: count the ... |
3377 3378 |
MEM_CGROUP_RECLAIM_SHRINK, NULL); |
8c7c6e34a memcg: mem+swap c... |
3379 |
curusage = res_counter_read_u64(&memcg->memsw, RES_USAGE); |
81d39c20f memcg: fix shrink... |
3380 |
/* Usage is reduced ? */ |
8c7c6e34a memcg: mem+swap c... |
3381 |
if (curusage >= oldusage) |
628f42355 memcg: limit chan... |
3382 |
retry_count--; |
81d39c20f memcg: fix shrink... |
3383 3384 |
else oldusage = curusage; |
628f42355 memcg: limit chan... |
3385 |
} |
3c11ecf44 memcg: oom kill d... |
3386 3387 |
if (!ret && enlarge) memcg_oom_recover(memcg); |
628f42355 memcg: limit chan... |
3388 3389 |
return ret; } |
4e4169535 memory controller... |
3390 |
unsigned long mem_cgroup_soft_limit_reclaim(struct zone *zone, int order, |
0ae5e89c6 memcg: count the ... |
3391 3392 |
gfp_t gfp_mask, unsigned long *total_scanned) |
4e4169535 memory controller... |
3393 3394 3395 3396 3397 3398 |
{ unsigned long nr_reclaimed = 0; struct mem_cgroup_per_zone *mz, *next_mz = NULL; unsigned long reclaimed; int loop = 0; struct mem_cgroup_tree_per_zone *mctz; |
ef8745c1e memcg: reduce che... |
3399 |
unsigned long long excess; |
0ae5e89c6 memcg: count the ... |
3400 |
unsigned long nr_scanned; |
4e4169535 memory controller... |
3401 3402 3403 |
if (order > 0) return 0; |
00918b6ab memcg: remove nid... |
3404 |
mctz = soft_limit_tree_node_zone(zone_to_nid(zone), zone_idx(zone)); |
4e4169535 memory controller... |
3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 |
/* * This loop can run a while, specially if mem_cgroup's continuously * keep exceeding their soft limit and putting the system under * pressure */ do { if (next_mz) mz = next_mz; else mz = mem_cgroup_largest_soft_limit_node(mctz); if (!mz) break; |
0ae5e89c6 memcg: count the ... |
3417 |
nr_scanned = 0; |
4e4169535 memory controller... |
3418 3419 |
reclaimed = mem_cgroup_hierarchical_reclaim(mz->mem, zone, gfp_mask, |
0ae5e89c6 memcg: count the ... |
3420 3421 |
MEM_CGROUP_RECLAIM_SOFT, &nr_scanned); |
4e4169535 memory controller... |
3422 |
nr_reclaimed += reclaimed; |
0ae5e89c6 memcg: count the ... |
3423 |
*total_scanned += nr_scanned; |
4e4169535 memory controller... |
3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 |
spin_lock(&mctz->lock); /* * If we failed to reclaim anything from this memory cgroup * it is time to move on to the next cgroup */ next_mz = NULL; if (!reclaimed) { do { /* * Loop until we find yet another one. * * By the time we get the soft_limit lock * again, someone might have aded the * group back on the RB tree. Iterate to * make sure we get a different mem. * mem_cgroup_largest_soft_limit_node returns * NULL if no other cgroup is present on * the tree */ next_mz = __mem_cgroup_largest_soft_limit_node(mctz); |
39cc98f1f memcg: remove poi... |
3446 |
if (next_mz == mz) |
4e4169535 memory controller... |
3447 |
css_put(&next_mz->mem->css); |
39cc98f1f memcg: remove poi... |
3448 |
else /* next_mz == NULL or other memcg */ |
4e4169535 memory controller... |
3449 3450 3451 |
break; } while (1); } |
4e4169535 memory controller... |
3452 |
__mem_cgroup_remove_exceeded(mz->mem, mz, mctz); |
ef8745c1e memcg: reduce che... |
3453 |
excess = res_counter_soft_limit_excess(&mz->mem->res); |
4e4169535 memory controller... |
3454 3455 3456 3457 3458 3459 3460 3461 |
/* * One school of thought says that we should not add * back the node to the tree if reclaim returns 0. * But our reclaim could return 0, simply because due * to priority we are exposing a smaller subset of * memory to reclaim from. Consider this as a longer * term TODO. */ |
ef8745c1e memcg: reduce che... |
3462 3463 |
/* If excess == 0, no tree ops */ __mem_cgroup_insert_exceeded(mz->mem, mz, mctz, excess); |
4e4169535 memory controller... |
3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 |
spin_unlock(&mctz->lock); css_put(&mz->mem->css); loop++; /* * Could not reclaim anything and there are no more * mem cgroups to try or we seem to be looping without * reclaiming anything. */ if (!nr_reclaimed && (next_mz == NULL || loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS)) break; } while (!nr_reclaimed); if (next_mz) css_put(&next_mz->mem->css); return nr_reclaimed; } |
c9b0ed514 memcg: helper fun... |
3481 |
/* |
cc8475822 memory cgroup enh... |
3482 |
* This routine traverse page_cgroup in given list and drop them all. |
cc8475822 memory cgroup enh... |
3483 3484 |
* *And* this routine doesn't reclaim page itself, just removes page_cgroup. */ |
c0ff4b854 memcg: rename mem... |
3485 |
static int mem_cgroup_force_empty_list(struct mem_cgroup *memcg, |
08e552c69 memcg: synchroniz... |
3486 |
int node, int zid, enum lru_list lru) |
cc8475822 memory cgroup enh... |
3487 |
{ |
08e552c69 memcg: synchroniz... |
3488 3489 |
struct zone *zone; struct mem_cgroup_per_zone *mz; |
f817ed485 memcg: move all a... |
3490 |
struct page_cgroup *pc, *busy; |
08e552c69 memcg: synchroniz... |
3491 |
unsigned long flags, loop; |
072c56c13 per-zone and recl... |
3492 |
struct list_head *list; |
f817ed485 memcg: move all a... |
3493 |
int ret = 0; |
072c56c13 per-zone and recl... |
3494 |
|
08e552c69 memcg: synchroniz... |
3495 |
zone = &NODE_DATA(node)->node_zones[zid]; |
c0ff4b854 memcg: rename mem... |
3496 |
mz = mem_cgroup_zoneinfo(memcg, node, zid); |
b69408e88 vmscan: Use an in... |
3497 |
list = &mz->lists[lru]; |
cc8475822 memory cgroup enh... |
3498 |
|
f817ed485 memcg: move all a... |
3499 3500 3501 3502 3503 |
loop = MEM_CGROUP_ZSTAT(mz, lru); /* give some margin against EBUSY etc...*/ loop += 256; busy = NULL; while (loop--) { |
5564e88ba memcg: condense p... |
3504 |
struct page *page; |
f817ed485 memcg: move all a... |
3505 |
ret = 0; |
08e552c69 memcg: synchroniz... |
3506 |
spin_lock_irqsave(&zone->lru_lock, flags); |
f817ed485 memcg: move all a... |
3507 |
if (list_empty(list)) { |
08e552c69 memcg: synchroniz... |
3508 |
spin_unlock_irqrestore(&zone->lru_lock, flags); |
52d4b9ac0 memcg: allocate a... |
3509 |
break; |
f817ed485 memcg: move all a... |
3510 3511 3512 3513 |
} pc = list_entry(list->prev, struct page_cgroup, lru); if (busy == pc) { list_move(&pc->lru, list); |
648bcc771 mm/memcontrol.c: ... |
3514 |
busy = NULL; |
08e552c69 memcg: synchroniz... |
3515 |
spin_unlock_irqrestore(&zone->lru_lock, flags); |
f817ed485 memcg: move all a... |
3516 3517 |
continue; } |
08e552c69 memcg: synchroniz... |
3518 |
spin_unlock_irqrestore(&zone->lru_lock, flags); |
f817ed485 memcg: move all a... |
3519 |
|
6b3ae58ef memcg: remove dir... |
3520 |
page = lookup_cgroup_page(pc); |
5564e88ba memcg: condense p... |
3521 |
|
c0ff4b854 memcg: rename mem... |
3522 |
ret = mem_cgroup_move_parent(page, pc, memcg, GFP_KERNEL); |
f817ed485 memcg: move all a... |
3523 |
if (ret == -ENOMEM) |
52d4b9ac0 memcg: allocate a... |
3524 |
break; |
f817ed485 memcg: move all a... |
3525 3526 3527 3528 3529 3530 3531 |
if (ret == -EBUSY || ret == -EINVAL) { /* found lock contention or "pc" is obsolete. */ busy = pc; cond_resched(); } else busy = NULL; |
cc8475822 memory cgroup enh... |
3532 |
} |
08e552c69 memcg: synchroniz... |
3533 |
|
f817ed485 memcg: move all a... |
3534 3535 3536 |
if (!ret && !list_empty(list)) return -EBUSY; return ret; |
cc8475822 memory cgroup enh... |
3537 3538 3539 3540 3541 3542 |
} /* * make mem_cgroup's charge to be 0 if there is no task. * This enables deleting this mem_cgroup. */ |
c0ff4b854 memcg: rename mem... |
3543 |
static int mem_cgroup_force_empty(struct mem_cgroup *memcg, bool free_all) |
cc8475822 memory cgroup enh... |
3544 |
{ |
f817ed485 memcg: move all a... |
3545 3546 3547 |
int ret; int node, zid, shrink; int nr_retries = MEM_CGROUP_RECLAIM_RETRIES; |
c0ff4b854 memcg: rename mem... |
3548 |
struct cgroup *cgrp = memcg->css.cgroup; |
8869b8f6e memcg: memcontrol... |
3549 |
|
c0ff4b854 memcg: rename mem... |
3550 |
css_get(&memcg->css); |
f817ed485 memcg: move all a... |
3551 3552 |
shrink = 0; |
c1e862c1f memcg: new force_... |
3553 3554 3555 |
/* should free all ? */ if (free_all) goto try_to_free; |
f817ed485 memcg: move all a... |
3556 |
move_account: |
fce664775 memcg: ensure lis... |
3557 |
do { |
f817ed485 memcg: move all a... |
3558 |
ret = -EBUSY; |
c1e862c1f memcg: new force_... |
3559 3560 3561 3562 |
if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children)) goto out; ret = -EINTR; if (signal_pending(current)) |
cc8475822 memory cgroup enh... |
3563 |
goto out; |
52d4b9ac0 memcg: allocate a... |
3564 3565 |
/* This is for making all *used* pages to be on LRU. */ lru_add_drain_all(); |
c0ff4b854 memcg: rename mem... |
3566 |
drain_all_stock_sync(memcg); |
f817ed485 memcg: move all a... |
3567 |
ret = 0; |
c0ff4b854 memcg: rename mem... |
3568 |
mem_cgroup_start_move(memcg); |
299b4eaa3 memcg: NULL point... |
3569 |
for_each_node_state(node, N_HIGH_MEMORY) { |
f817ed485 memcg: move all a... |
3570 |
for (zid = 0; !ret && zid < MAX_NR_ZONES; zid++) { |
b69408e88 vmscan: Use an in... |
3571 |
enum lru_list l; |
f817ed485 memcg: move all a... |
3572 |
for_each_lru(l) { |
c0ff4b854 memcg: rename mem... |
3573 |
ret = mem_cgroup_force_empty_list(memcg, |
08e552c69 memcg: synchroniz... |
3574 |
node, zid, l); |
f817ed485 memcg: move all a... |
3575 3576 3577 |
if (ret) break; } |
1ecaab2bd per-zone and recl... |
3578 |
} |
f817ed485 memcg: move all a... |
3579 3580 3581 |
if (ret) break; } |
c0ff4b854 memcg: rename mem... |
3582 3583 |
mem_cgroup_end_move(memcg); memcg_oom_recover(memcg); |
f817ed485 memcg: move all a... |
3584 3585 3586 |
/* it seems parent cgroup doesn't have enough mem */ if (ret == -ENOMEM) goto try_to_free; |
52d4b9ac0 memcg: allocate a... |
3587 |
cond_resched(); |
fce664775 memcg: ensure lis... |
3588 |
/* "ret" should also be checked to ensure all lists are empty. */ |
c0ff4b854 memcg: rename mem... |
3589 |
} while (memcg->res.usage > 0 || ret); |
cc8475822 memory cgroup enh... |
3590 |
out: |
c0ff4b854 memcg: rename mem... |
3591 |
css_put(&memcg->css); |
cc8475822 memory cgroup enh... |
3592 |
return ret; |
f817ed485 memcg: move all a... |
3593 3594 |
try_to_free: |
c1e862c1f memcg: new force_... |
3595 3596 |
/* returns EBUSY if there is a task or if we come here twice. */ if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children) || shrink) { |
f817ed485 memcg: move all a... |
3597 3598 3599 |
ret = -EBUSY; goto out; } |
c1e862c1f memcg: new force_... |
3600 3601 |
/* we call try-to-free pages for make this cgroup empty */ lru_add_drain_all(); |
f817ed485 memcg: move all a... |
3602 3603 |
/* try to free all pages in this cgroup */ shrink = 1; |
c0ff4b854 memcg: rename mem... |
3604 |
while (nr_retries && memcg->res.usage > 0) { |
f817ed485 memcg: move all a... |
3605 |
int progress; |
c1e862c1f memcg: new force_... |
3606 3607 3608 3609 3610 |
if (signal_pending(current)) { ret = -EINTR; goto out; } |
c0ff4b854 memcg: rename mem... |
3611 |
progress = try_to_free_mem_cgroup_pages(memcg, GFP_KERNEL, |
185efc0f9 memcg: Revert "me... |
3612 |
false); |
c1e862c1f memcg: new force_... |
3613 |
if (!progress) { |
f817ed485 memcg: move all a... |
3614 |
nr_retries--; |
c1e862c1f memcg: new force_... |
3615 |
/* maybe some writeback is necessary */ |
8aa7e847d Fix congestion_wa... |
3616 |
congestion_wait(BLK_RW_ASYNC, HZ/10); |
c1e862c1f memcg: new force_... |
3617 |
} |
f817ed485 memcg: move all a... |
3618 3619 |
} |
08e552c69 memcg: synchroniz... |
3620 |
lru_add_drain(); |
f817ed485 memcg: move all a... |
3621 |
/* try move_account...there may be some *locked* pages. */ |
fce664775 memcg: ensure lis... |
3622 |
goto move_account; |
cc8475822 memory cgroup enh... |
3623 |
} |
c1e862c1f memcg: new force_... |
3624 3625 3626 3627 |
int mem_cgroup_force_empty_write(struct cgroup *cont, unsigned int event) { return mem_cgroup_force_empty(mem_cgroup_from_cont(cont), true); } |
18f59ea7d memcg: memory cgr... |
3628 3629 3630 3631 3632 3633 3634 3635 3636 |
static u64 mem_cgroup_hierarchy_read(struct cgroup *cont, struct cftype *cft) { return mem_cgroup_from_cont(cont)->use_hierarchy; } static int mem_cgroup_hierarchy_write(struct cgroup *cont, struct cftype *cft, u64 val) { int retval = 0; |
c0ff4b854 memcg: rename mem... |
3637 |
struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
18f59ea7d memcg: memory cgr... |
3638 |
struct cgroup *parent = cont->parent; |
c0ff4b854 memcg: rename mem... |
3639 |
struct mem_cgroup *parent_memcg = NULL; |
18f59ea7d memcg: memory cgr... |
3640 3641 |
if (parent) |
c0ff4b854 memcg: rename mem... |
3642 |
parent_memcg = mem_cgroup_from_cont(parent); |
18f59ea7d memcg: memory cgr... |
3643 3644 3645 |
cgroup_lock(); /* |
af901ca18 tree-wide: fix as... |
3646 |
* If parent's use_hierarchy is set, we can't make any modifications |
18f59ea7d memcg: memory cgr... |
3647 3648 3649 3650 3651 3652 |
* in the child subtrees. If it is unset, then the change can * occur, provided the current cgroup has no children. * * For the root cgroup, parent_mem is NULL, we allow value to be * set if there are no children. */ |
c0ff4b854 memcg: rename mem... |
3653 |
if ((!parent_memcg || !parent_memcg->use_hierarchy) && |
18f59ea7d memcg: memory cgr... |
3654 3655 |
(val == 1 || val == 0)) { if (list_empty(&cont->children)) |
c0ff4b854 memcg: rename mem... |
3656 |
memcg->use_hierarchy = val; |
18f59ea7d memcg: memory cgr... |
3657 3658 3659 3660 3661 3662 3663 3664 |
else retval = -EBUSY; } else retval = -EINVAL; cgroup_unlock(); return retval; } |
0c3e73e84 memcg: improve re... |
3665 |
|
c0ff4b854 memcg: rename mem... |
3666 |
static unsigned long mem_cgroup_recursive_stat(struct mem_cgroup *memcg, |
7a159cc9d memcg: use native... |
3667 |
enum mem_cgroup_stat_index idx) |
0c3e73e84 memcg: improve re... |
3668 |
{ |
7d74b06f2 memcg: use for_ea... |
3669 |
struct mem_cgroup *iter; |
7a159cc9d memcg: use native... |
3670 |
long val = 0; |
0c3e73e84 memcg: improve re... |
3671 |
|
7a159cc9d memcg: use native... |
3672 |
/* Per-cpu values can be negative, use a signed accumulator */ |
c0ff4b854 memcg: rename mem... |
3673 |
for_each_mem_cgroup_tree(iter, memcg) |
7d74b06f2 memcg: use for_ea... |
3674 3675 3676 3677 3678 |
val += mem_cgroup_read_stat(iter, idx); if (val < 0) /* race ? */ val = 0; return val; |
0c3e73e84 memcg: improve re... |
3679 |
} |
c0ff4b854 memcg: rename mem... |
3680 |
static inline u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap) |
104f39284 memcg: extract me... |
3681 |
{ |
7d74b06f2 memcg: use for_ea... |
3682 |
u64 val; |
104f39284 memcg: extract me... |
3683 |
|
c0ff4b854 memcg: rename mem... |
3684 |
if (!mem_cgroup_is_root(memcg)) { |
104f39284 memcg: extract me... |
3685 |
if (!swap) |
c0ff4b854 memcg: rename mem... |
3686 |
return res_counter_read_u64(&memcg->res, RES_USAGE); |
104f39284 memcg: extract me... |
3687 |
else |
c0ff4b854 memcg: rename mem... |
3688 |
return res_counter_read_u64(&memcg->memsw, RES_USAGE); |
104f39284 memcg: extract me... |
3689 |
} |
c0ff4b854 memcg: rename mem... |
3690 3691 |
val = mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_CACHE); val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_RSS); |
104f39284 memcg: extract me... |
3692 |
|
7d74b06f2 memcg: use for_ea... |
3693 |
if (swap) |
c0ff4b854 memcg: rename mem... |
3694 |
val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_SWAPOUT); |
104f39284 memcg: extract me... |
3695 3696 3697 |
return val << PAGE_SHIFT; } |
2c3daa722 CGroup API files:... |
3698 |
static u64 mem_cgroup_read(struct cgroup *cont, struct cftype *cft) |
8cdea7c05 Memory controller... |
3699 |
{ |
c0ff4b854 memcg: rename mem... |
3700 |
struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
104f39284 memcg: extract me... |
3701 |
u64 val; |
8c7c6e34a memcg: mem+swap c... |
3702 3703 3704 3705 3706 3707 |
int type, name; type = MEMFILE_TYPE(cft->private); name = MEMFILE_ATTR(cft->private); switch (type) { case _MEM: |
104f39284 memcg: extract me... |
3708 |
if (name == RES_USAGE) |
c0ff4b854 memcg: rename mem... |
3709 |
val = mem_cgroup_usage(memcg, false); |
104f39284 memcg: extract me... |
3710 |
else |
c0ff4b854 memcg: rename mem... |
3711 |
val = res_counter_read_u64(&memcg->res, name); |
8c7c6e34a memcg: mem+swap c... |
3712 3713 |
break; case _MEMSWAP: |
104f39284 memcg: extract me... |
3714 |
if (name == RES_USAGE) |
c0ff4b854 memcg: rename mem... |
3715 |
val = mem_cgroup_usage(memcg, true); |
104f39284 memcg: extract me... |
3716 |
else |
c0ff4b854 memcg: rename mem... |
3717 |
val = res_counter_read_u64(&memcg->memsw, name); |
8c7c6e34a memcg: mem+swap c... |
3718 3719 3720 3721 3722 3723 |
break; default: BUG(); break; } return val; |
8cdea7c05 Memory controller... |
3724 |
} |
628f42355 memcg: limit chan... |
3725 3726 3727 3728 |
/* * The user of this function is... * RES_LIMIT. */ |
856c13aa1 cgroup files: con... |
3729 3730 |
static int mem_cgroup_write(struct cgroup *cont, struct cftype *cft, const char *buffer) |
8cdea7c05 Memory controller... |
3731 |
{ |
628f42355 memcg: limit chan... |
3732 |
struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
8c7c6e34a memcg: mem+swap c... |
3733 |
int type, name; |
628f42355 memcg: limit chan... |
3734 3735 |
unsigned long long val; int ret; |
8c7c6e34a memcg: mem+swap c... |
3736 3737 3738 |
type = MEMFILE_TYPE(cft->private); name = MEMFILE_ATTR(cft->private); switch (name) { |
628f42355 memcg: limit chan... |
3739 |
case RES_LIMIT: |
4b3bde4c9 memcg: remove the... |
3740 3741 3742 3743 |
if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */ ret = -EINVAL; break; } |
628f42355 memcg: limit chan... |
3744 3745 |
/* This function does all necessary parse...reuse it */ ret = res_counter_memparse_write_strategy(buffer, &val); |
8c7c6e34a memcg: mem+swap c... |
3746 3747 3748 |
if (ret) break; if (type == _MEM) |
628f42355 memcg: limit chan... |
3749 |
ret = mem_cgroup_resize_limit(memcg, val); |
8c7c6e34a memcg: mem+swap c... |
3750 3751 |
else ret = mem_cgroup_resize_memsw_limit(memcg, val); |
628f42355 memcg: limit chan... |
3752 |
break; |
296c81d89 memory controller... |
3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 |
case RES_SOFT_LIMIT: ret = res_counter_memparse_write_strategy(buffer, &val); if (ret) break; /* * For memsw, soft limits are hard to implement in terms * of semantics, for now, we support soft limits for * control without swap */ if (type == _MEM) ret = res_counter_set_soft_limit(&memcg->res, val); else ret = -EINVAL; break; |
628f42355 memcg: limit chan... |
3767 3768 3769 3770 3771 |
default: ret = -EINVAL; /* should be BUG() ? */ break; } return ret; |
8cdea7c05 Memory controller... |
3772 |
} |
fee7b548e memcg: show real ... |
3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 |
static void memcg_get_hierarchical_limit(struct mem_cgroup *memcg, unsigned long long *mem_limit, unsigned long long *memsw_limit) { struct cgroup *cgroup; unsigned long long min_limit, min_memsw_limit, tmp; min_limit = res_counter_read_u64(&memcg->res, RES_LIMIT); min_memsw_limit = res_counter_read_u64(&memcg->memsw, RES_LIMIT); cgroup = memcg->css.cgroup; if (!memcg->use_hierarchy) goto out; while (cgroup->parent) { cgroup = cgroup->parent; memcg = mem_cgroup_from_cont(cgroup); if (!memcg->use_hierarchy) break; tmp = res_counter_read_u64(&memcg->res, RES_LIMIT); min_limit = min(min_limit, tmp); tmp = res_counter_read_u64(&memcg->memsw, RES_LIMIT); min_memsw_limit = min(min_memsw_limit, tmp); } out: *mem_limit = min_limit; *memsw_limit = min_memsw_limit; return; } |
29f2a4dac memcgroup: implem... |
3800 |
static int mem_cgroup_reset(struct cgroup *cont, unsigned int event) |
c84872e16 memcgroup: add th... |
3801 |
{ |
c0ff4b854 memcg: rename mem... |
3802 |
struct mem_cgroup *memcg; |
8c7c6e34a memcg: mem+swap c... |
3803 |
int type, name; |
c84872e16 memcgroup: add th... |
3804 |
|
c0ff4b854 memcg: rename mem... |
3805 |
memcg = mem_cgroup_from_cont(cont); |
8c7c6e34a memcg: mem+swap c... |
3806 3807 3808 |
type = MEMFILE_TYPE(event); name = MEMFILE_ATTR(event); switch (name) { |
29f2a4dac memcgroup: implem... |
3809 |
case RES_MAX_USAGE: |
8c7c6e34a memcg: mem+swap c... |
3810 |
if (type == _MEM) |
c0ff4b854 memcg: rename mem... |
3811 |
res_counter_reset_max(&memcg->res); |
8c7c6e34a memcg: mem+swap c... |
3812 |
else |
c0ff4b854 memcg: rename mem... |
3813 |
res_counter_reset_max(&memcg->memsw); |
29f2a4dac memcgroup: implem... |
3814 3815 |
break; case RES_FAILCNT: |
8c7c6e34a memcg: mem+swap c... |
3816 |
if (type == _MEM) |
c0ff4b854 memcg: rename mem... |
3817 |
res_counter_reset_failcnt(&memcg->res); |
8c7c6e34a memcg: mem+swap c... |
3818 |
else |
c0ff4b854 memcg: rename mem... |
3819 |
res_counter_reset_failcnt(&memcg->memsw); |
29f2a4dac memcgroup: implem... |
3820 3821 |
break; } |
f64c3f549 memory controller... |
3822 |
|
85cc59db1 memcgroup: use tr... |
3823 |
return 0; |
c84872e16 memcgroup: add th... |
3824 |
} |
7dc74be03 memcg: add interf... |
3825 3826 3827 3828 3829 |
static u64 mem_cgroup_move_charge_read(struct cgroup *cgrp, struct cftype *cft) { return mem_cgroup_from_cont(cgrp)->move_charge_at_immigrate; } |
024914477 memcg: move charg... |
3830 |
#ifdef CONFIG_MMU |
7dc74be03 memcg: add interf... |
3831 3832 3833 |
static int mem_cgroup_move_charge_write(struct cgroup *cgrp, struct cftype *cft, u64 val) { |
c0ff4b854 memcg: rename mem... |
3834 |
struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
7dc74be03 memcg: add interf... |
3835 3836 3837 3838 3839 3840 3841 3842 3843 |
if (val >= (1 << NR_MOVE_TYPE)) return -EINVAL; /* * We check this value several times in both in can_attach() and * attach(), so we need cgroup lock to prevent this value from being * inconsistent. */ cgroup_lock(); |
c0ff4b854 memcg: rename mem... |
3844 |
memcg->move_charge_at_immigrate = val; |
7dc74be03 memcg: add interf... |
3845 3846 3847 3848 |
cgroup_unlock(); return 0; } |
024914477 memcg: move charg... |
3849 3850 3851 3852 3853 3854 3855 |
#else static int mem_cgroup_move_charge_write(struct cgroup *cgrp, struct cftype *cft, u64 val) { return -ENOSYS; } #endif |
7dc74be03 memcg: add interf... |
3856 |
|
14067bb3e memcg: hierarchic... |
3857 3858 3859 3860 3861 |
/* For read statistics */ enum { MCS_CACHE, MCS_RSS, |
d8046582d memcg: make memcg... |
3862 |
MCS_FILE_MAPPED, |
14067bb3e memcg: hierarchic... |
3863 3864 |
MCS_PGPGIN, MCS_PGPGOUT, |
1dd3a2732 memcg: show swap ... |
3865 |
MCS_SWAP, |
456f998ec memcg: add the pa... |
3866 3867 |
MCS_PGFAULT, MCS_PGMAJFAULT, |
14067bb3e memcg: hierarchic... |
3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 |
MCS_INACTIVE_ANON, MCS_ACTIVE_ANON, MCS_INACTIVE_FILE, MCS_ACTIVE_FILE, MCS_UNEVICTABLE, NR_MCS_STAT, }; struct mcs_total_stat { s64 stat[NR_MCS_STAT]; |
d2ceb9b7d memory cgroup enh... |
3878 |
}; |
14067bb3e memcg: hierarchic... |
3879 3880 3881 3882 3883 3884 |
struct { char *local_name; char *total_name; } memcg_stat_strings[NR_MCS_STAT] = { {"cache", "total_cache"}, {"rss", "total_rss"}, |
d69b042f3 memcg: add file-b... |
3885 |
{"mapped_file", "total_mapped_file"}, |
14067bb3e memcg: hierarchic... |
3886 3887 |
{"pgpgin", "total_pgpgin"}, {"pgpgout", "total_pgpgout"}, |
1dd3a2732 memcg: show swap ... |
3888 |
{"swap", "total_swap"}, |
456f998ec memcg: add the pa... |
3889 3890 |
{"pgfault", "total_pgfault"}, {"pgmajfault", "total_pgmajfault"}, |
14067bb3e memcg: hierarchic... |
3891 3892 3893 3894 3895 3896 |
{"inactive_anon", "total_inactive_anon"}, {"active_anon", "total_active_anon"}, {"inactive_file", "total_inactive_file"}, {"active_file", "total_active_file"}, {"unevictable", "total_unevictable"} }; |
7d74b06f2 memcg: use for_ea... |
3897 |
static void |
c0ff4b854 memcg: rename mem... |
3898 |
mem_cgroup_get_local_stat(struct mem_cgroup *memcg, struct mcs_total_stat *s) |
14067bb3e memcg: hierarchic... |
3899 |
{ |
14067bb3e memcg: hierarchic... |
3900 3901 3902 |
s64 val; /* per cpu stat */ |
c0ff4b854 memcg: rename mem... |
3903 |
val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_CACHE); |
14067bb3e memcg: hierarchic... |
3904 |
s->stat[MCS_CACHE] += val * PAGE_SIZE; |
c0ff4b854 memcg: rename mem... |
3905 |
val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_RSS); |
14067bb3e memcg: hierarchic... |
3906 |
s->stat[MCS_RSS] += val * PAGE_SIZE; |
c0ff4b854 memcg: rename mem... |
3907 |
val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_FILE_MAPPED); |
d8046582d memcg: make memcg... |
3908 |
s->stat[MCS_FILE_MAPPED] += val * PAGE_SIZE; |
c0ff4b854 memcg: rename mem... |
3909 |
val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGPGIN); |
14067bb3e memcg: hierarchic... |
3910 |
s->stat[MCS_PGPGIN] += val; |
c0ff4b854 memcg: rename mem... |
3911 |
val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGPGOUT); |
14067bb3e memcg: hierarchic... |
3912 |
s->stat[MCS_PGPGOUT] += val; |
1dd3a2732 memcg: show swap ... |
3913 |
if (do_swap_account) { |
c0ff4b854 memcg: rename mem... |
3914 |
val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_SWAPOUT); |
1dd3a2732 memcg: show swap ... |
3915 3916 |
s->stat[MCS_SWAP] += val * PAGE_SIZE; } |
c0ff4b854 memcg: rename mem... |
3917 |
val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGFAULT); |
456f998ec memcg: add the pa... |
3918 |
s->stat[MCS_PGFAULT] += val; |
c0ff4b854 memcg: rename mem... |
3919 |
val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGMAJFAULT); |
456f998ec memcg: add the pa... |
3920 |
s->stat[MCS_PGMAJFAULT] += val; |
14067bb3e memcg: hierarchic... |
3921 3922 |
/* per zone stat */ |
c0ff4b854 memcg: rename mem... |
3923 |
val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_INACTIVE_ANON)); |
14067bb3e memcg: hierarchic... |
3924 |
s->stat[MCS_INACTIVE_ANON] += val * PAGE_SIZE; |
c0ff4b854 memcg: rename mem... |
3925 |
val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_ACTIVE_ANON)); |
14067bb3e memcg: hierarchic... |
3926 |
s->stat[MCS_ACTIVE_ANON] += val * PAGE_SIZE; |
c0ff4b854 memcg: rename mem... |
3927 |
val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_INACTIVE_FILE)); |
14067bb3e memcg: hierarchic... |
3928 |
s->stat[MCS_INACTIVE_FILE] += val * PAGE_SIZE; |
c0ff4b854 memcg: rename mem... |
3929 |
val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_ACTIVE_FILE)); |
14067bb3e memcg: hierarchic... |
3930 |
s->stat[MCS_ACTIVE_FILE] += val * PAGE_SIZE; |
c0ff4b854 memcg: rename mem... |
3931 |
val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_UNEVICTABLE)); |
14067bb3e memcg: hierarchic... |
3932 |
s->stat[MCS_UNEVICTABLE] += val * PAGE_SIZE; |
14067bb3e memcg: hierarchic... |
3933 3934 3935 |
} static void |
c0ff4b854 memcg: rename mem... |
3936 |
mem_cgroup_get_total_stat(struct mem_cgroup *memcg, struct mcs_total_stat *s) |
14067bb3e memcg: hierarchic... |
3937 |
{ |
7d74b06f2 memcg: use for_ea... |
3938 |
struct mem_cgroup *iter; |
c0ff4b854 memcg: rename mem... |
3939 |
for_each_mem_cgroup_tree(iter, memcg) |
7d74b06f2 memcg: use for_ea... |
3940 |
mem_cgroup_get_local_stat(iter, s); |
14067bb3e memcg: hierarchic... |
3941 |
} |
406eb0c9b memcg: add memory... |
3942 3943 3944 3945 3946 3947 3948 3949 |
#ifdef CONFIG_NUMA static int mem_control_numa_stat_show(struct seq_file *m, void *arg) { int nid; unsigned long total_nr, file_nr, anon_nr, unevictable_nr; unsigned long node_nr; struct cgroup *cont = m->private; struct mem_cgroup *mem_cont = mem_cgroup_from_cont(cont); |
bb2a0de92 memcg: consolidat... |
3950 |
total_nr = mem_cgroup_nr_lru_pages(mem_cont, LRU_ALL); |
406eb0c9b memcg: add memory... |
3951 3952 |
seq_printf(m, "total=%lu", total_nr); for_each_node_state(nid, N_HIGH_MEMORY) { |
bb2a0de92 memcg: consolidat... |
3953 |
node_nr = mem_cgroup_node_nr_lru_pages(mem_cont, nid, LRU_ALL); |
406eb0c9b memcg: add memory... |
3954 3955 3956 3957 |
seq_printf(m, " N%d=%lu", nid, node_nr); } seq_putc(m, ' '); |
bb2a0de92 memcg: consolidat... |
3958 |
file_nr = mem_cgroup_nr_lru_pages(mem_cont, LRU_ALL_FILE); |
406eb0c9b memcg: add memory... |
3959 3960 |
seq_printf(m, "file=%lu", file_nr); for_each_node_state(nid, N_HIGH_MEMORY) { |
bb2a0de92 memcg: consolidat... |
3961 3962 |
node_nr = mem_cgroup_node_nr_lru_pages(mem_cont, nid, LRU_ALL_FILE); |
406eb0c9b memcg: add memory... |
3963 3964 3965 3966 |
seq_printf(m, " N%d=%lu", nid, node_nr); } seq_putc(m, ' '); |
bb2a0de92 memcg: consolidat... |
3967 |
anon_nr = mem_cgroup_nr_lru_pages(mem_cont, LRU_ALL_ANON); |
406eb0c9b memcg: add memory... |
3968 3969 |
seq_printf(m, "anon=%lu", anon_nr); for_each_node_state(nid, N_HIGH_MEMORY) { |
bb2a0de92 memcg: consolidat... |
3970 3971 |
node_nr = mem_cgroup_node_nr_lru_pages(mem_cont, nid, LRU_ALL_ANON); |
406eb0c9b memcg: add memory... |
3972 3973 3974 3975 |
seq_printf(m, " N%d=%lu", nid, node_nr); } seq_putc(m, ' '); |
bb2a0de92 memcg: consolidat... |
3976 |
unevictable_nr = mem_cgroup_nr_lru_pages(mem_cont, BIT(LRU_UNEVICTABLE)); |
406eb0c9b memcg: add memory... |
3977 3978 |
seq_printf(m, "unevictable=%lu", unevictable_nr); for_each_node_state(nid, N_HIGH_MEMORY) { |
bb2a0de92 memcg: consolidat... |
3979 3980 |
node_nr = mem_cgroup_node_nr_lru_pages(mem_cont, nid, BIT(LRU_UNEVICTABLE)); |
406eb0c9b memcg: add memory... |
3981 3982 3983 3984 3985 3986 3987 |
seq_printf(m, " N%d=%lu", nid, node_nr); } seq_putc(m, ' '); return 0; } #endif /* CONFIG_NUMA */ |
c64745cf0 CGroup API files:... |
3988 3989 |
static int mem_control_stat_show(struct cgroup *cont, struct cftype *cft, struct cgroup_map_cb *cb) |
d2ceb9b7d memory cgroup enh... |
3990 |
{ |
d2ceb9b7d memory cgroup enh... |
3991 |
struct mem_cgroup *mem_cont = mem_cgroup_from_cont(cont); |
14067bb3e memcg: hierarchic... |
3992 |
struct mcs_total_stat mystat; |
d2ceb9b7d memory cgroup enh... |
3993 |
int i; |
14067bb3e memcg: hierarchic... |
3994 3995 |
memset(&mystat, 0, sizeof(mystat)); mem_cgroup_get_local_stat(mem_cont, &mystat); |
d2ceb9b7d memory cgroup enh... |
3996 |
|
406eb0c9b memcg: add memory... |
3997 |
|
1dd3a2732 memcg: show swap ... |
3998 3999 4000 |
for (i = 0; i < NR_MCS_STAT; i++) { if (i == MCS_SWAP && !do_swap_account) continue; |
14067bb3e memcg: hierarchic... |
4001 |
cb->fill(cb, memcg_stat_strings[i].local_name, mystat.stat[i]); |
1dd3a2732 memcg: show swap ... |
4002 |
} |
7b854121e Unevictable LRU P... |
4003 |
|
14067bb3e memcg: hierarchic... |
4004 |
/* Hierarchical information */ |
fee7b548e memcg: show real ... |
4005 4006 4007 4008 4009 4010 4011 |
{ unsigned long long limit, memsw_limit; memcg_get_hierarchical_limit(mem_cont, &limit, &memsw_limit); cb->fill(cb, "hierarchical_memory_limit", limit); if (do_swap_account) cb->fill(cb, "hierarchical_memsw_limit", memsw_limit); } |
7f016ee8b memcg: show recla... |
4012 |
|
14067bb3e memcg: hierarchic... |
4013 4014 |
memset(&mystat, 0, sizeof(mystat)); mem_cgroup_get_total_stat(mem_cont, &mystat); |
1dd3a2732 memcg: show swap ... |
4015 4016 4017 |
for (i = 0; i < NR_MCS_STAT; i++) { if (i == MCS_SWAP && !do_swap_account) continue; |
14067bb3e memcg: hierarchic... |
4018 |
cb->fill(cb, memcg_stat_strings[i].total_name, mystat.stat[i]); |
1dd3a2732 memcg: show swap ... |
4019 |
} |
14067bb3e memcg: hierarchic... |
4020 |
|
7f016ee8b memcg: show recla... |
4021 |
#ifdef CONFIG_DEBUG_VM |
7f016ee8b memcg: show recla... |
4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 |
{ int nid, zid; struct mem_cgroup_per_zone *mz; unsigned long recent_rotated[2] = {0, 0}; unsigned long recent_scanned[2] = {0, 0}; for_each_online_node(nid) for (zid = 0; zid < MAX_NR_ZONES; zid++) { mz = mem_cgroup_zoneinfo(mem_cont, nid, zid); recent_rotated[0] += mz->reclaim_stat.recent_rotated[0]; recent_rotated[1] += mz->reclaim_stat.recent_rotated[1]; recent_scanned[0] += mz->reclaim_stat.recent_scanned[0]; recent_scanned[1] += mz->reclaim_stat.recent_scanned[1]; } cb->fill(cb, "recent_rotated_anon", recent_rotated[0]); cb->fill(cb, "recent_rotated_file", recent_rotated[1]); cb->fill(cb, "recent_scanned_anon", recent_scanned[0]); cb->fill(cb, "recent_scanned_file", recent_scanned[1]); } #endif |
d2ceb9b7d memory cgroup enh... |
4047 4048 |
return 0; } |
a7885eb8a memcg: swappiness |
4049 4050 4051 |
static u64 mem_cgroup_swappiness_read(struct cgroup *cgrp, struct cftype *cft) { struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
1f4c025b5 memcg: export mem... |
4052 |
return mem_cgroup_swappiness(memcg); |
a7885eb8a memcg: swappiness |
4053 4054 4055 4056 4057 4058 4059 |
} static int mem_cgroup_swappiness_write(struct cgroup *cgrp, struct cftype *cft, u64 val) { struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); struct mem_cgroup *parent; |
068b38c1f memcg: fix a race... |
4060 |
|
a7885eb8a memcg: swappiness |
4061 4062 4063 4064 4065 4066 4067 |
if (val > 100) return -EINVAL; if (cgrp->parent == NULL) return -EINVAL; parent = mem_cgroup_from_cont(cgrp->parent); |
068b38c1f memcg: fix a race... |
4068 4069 |
cgroup_lock(); |
a7885eb8a memcg: swappiness |
4070 4071 |
/* If under hierarchy, only empty-root can set this value */ if ((parent->use_hierarchy) || |
068b38c1f memcg: fix a race... |
4072 4073 |
(memcg->use_hierarchy && !list_empty(&cgrp->children))) { cgroup_unlock(); |
a7885eb8a memcg: swappiness |
4074 |
return -EINVAL; |
068b38c1f memcg: fix a race... |
4075 |
} |
a7885eb8a memcg: swappiness |
4076 |
|
a7885eb8a memcg: swappiness |
4077 |
memcg->swappiness = val; |
a7885eb8a memcg: swappiness |
4078 |
|
068b38c1f memcg: fix a race... |
4079 |
cgroup_unlock(); |
a7885eb8a memcg: swappiness |
4080 4081 |
return 0; } |
2e72b6347 memcg: implement ... |
4082 4083 4084 4085 4086 4087 4088 4089 |
static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap) { struct mem_cgroup_threshold_ary *t; u64 usage; int i; rcu_read_lock(); if (!swap) |
2c488db27 memcg: clean up m... |
4090 |
t = rcu_dereference(memcg->thresholds.primary); |
2e72b6347 memcg: implement ... |
4091 |
else |
2c488db27 memcg: clean up m... |
4092 |
t = rcu_dereference(memcg->memsw_thresholds.primary); |
2e72b6347 memcg: implement ... |
4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 |
if (!t) goto unlock; usage = mem_cgroup_usage(memcg, swap); /* * current_threshold points to threshold just below usage. * If it's not true, a threshold was crossed after last * call of __mem_cgroup_threshold(). */ |
5407a5625 mm: remove unnece... |
4104 |
i = t->current_threshold; |
2e72b6347 memcg: implement ... |
4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 |
/* * Iterate backward over array of thresholds starting from * current_threshold and check if a threshold is crossed. * If none of thresholds below usage is crossed, we read * only one element of the array here. */ for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--) eventfd_signal(t->entries[i].eventfd, 1); /* i = current_threshold + 1 */ i++; /* * Iterate forward over array of thresholds starting from * current_threshold+1 and check if a threshold is crossed. * If none of thresholds above usage is crossed, we read * only one element of the array here. */ for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++) eventfd_signal(t->entries[i].eventfd, 1); /* Update current_threshold */ |
5407a5625 mm: remove unnece... |
4128 |
t->current_threshold = i - 1; |
2e72b6347 memcg: implement ... |
4129 4130 4131 4132 4133 4134 |
unlock: rcu_read_unlock(); } static void mem_cgroup_threshold(struct mem_cgroup *memcg) { |
ad4ca5f4b memcg: fix thresh... |
4135 4136 4137 4138 4139 4140 4141 |
while (memcg) { __mem_cgroup_threshold(memcg, false); if (do_swap_account) __mem_cgroup_threshold(memcg, true); memcg = parent_mem_cgroup(memcg); } |
2e72b6347 memcg: implement ... |
4142 4143 4144 4145 4146 4147 4148 4149 4150 |
} static int compare_thresholds(const void *a, const void *b) { const struct mem_cgroup_threshold *_a = a; const struct mem_cgroup_threshold *_b = b; return _a->threshold - _b->threshold; } |
c0ff4b854 memcg: rename mem... |
4151 |
static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg) |
9490ff275 memcg: oom notifier |
4152 4153 |
{ struct mem_cgroup_eventfd_list *ev; |
c0ff4b854 memcg: rename mem... |
4154 |
list_for_each_entry(ev, &memcg->oom_notify, list) |
9490ff275 memcg: oom notifier |
4155 4156 4157 |
eventfd_signal(ev->eventfd, 1); return 0; } |
c0ff4b854 memcg: rename mem... |
4158 |
static void mem_cgroup_oom_notify(struct mem_cgroup *memcg) |
9490ff275 memcg: oom notifier |
4159 |
{ |
7d74b06f2 memcg: use for_ea... |
4160 |
struct mem_cgroup *iter; |
c0ff4b854 memcg: rename mem... |
4161 |
for_each_mem_cgroup_tree(iter, memcg) |
7d74b06f2 memcg: use for_ea... |
4162 |
mem_cgroup_oom_notify_cb(iter); |
9490ff275 memcg: oom notifier |
4163 4164 4165 4166 |
} static int mem_cgroup_usage_register_event(struct cgroup *cgrp, struct cftype *cft, struct eventfd_ctx *eventfd, const char *args) |
2e72b6347 memcg: implement ... |
4167 4168 |
{ struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
2c488db27 memcg: clean up m... |
4169 4170 |
struct mem_cgroup_thresholds *thresholds; struct mem_cgroup_threshold_ary *new; |
2e72b6347 memcg: implement ... |
4171 4172 |
int type = MEMFILE_TYPE(cft->private); u64 threshold, usage; |
2c488db27 memcg: clean up m... |
4173 |
int i, size, ret; |
2e72b6347 memcg: implement ... |
4174 4175 4176 4177 4178 4179 |
ret = res_counter_memparse_write_strategy(args, &threshold); if (ret) return ret; mutex_lock(&memcg->thresholds_lock); |
2c488db27 memcg: clean up m... |
4180 |
|
2e72b6347 memcg: implement ... |
4181 |
if (type == _MEM) |
2c488db27 memcg: clean up m... |
4182 |
thresholds = &memcg->thresholds; |
2e72b6347 memcg: implement ... |
4183 |
else if (type == _MEMSWAP) |
2c488db27 memcg: clean up m... |
4184 |
thresholds = &memcg->memsw_thresholds; |
2e72b6347 memcg: implement ... |
4185 4186 4187 4188 4189 4190 |
else BUG(); usage = mem_cgroup_usage(memcg, type == _MEMSWAP); /* Check if a threshold crossed before adding a new one */ |
2c488db27 memcg: clean up m... |
4191 |
if (thresholds->primary) |
2e72b6347 memcg: implement ... |
4192 |
__mem_cgroup_threshold(memcg, type == _MEMSWAP); |
2c488db27 memcg: clean up m... |
4193 |
size = thresholds->primary ? thresholds->primary->size + 1 : 1; |
2e72b6347 memcg: implement ... |
4194 4195 |
/* Allocate memory for new array of thresholds */ |
2c488db27 memcg: clean up m... |
4196 |
new = kmalloc(sizeof(*new) + size * sizeof(struct mem_cgroup_threshold), |
2e72b6347 memcg: implement ... |
4197 |
GFP_KERNEL); |
2c488db27 memcg: clean up m... |
4198 |
if (!new) { |
2e72b6347 memcg: implement ... |
4199 4200 4201 |
ret = -ENOMEM; goto unlock; } |
2c488db27 memcg: clean up m... |
4202 |
new->size = size; |
2e72b6347 memcg: implement ... |
4203 4204 |
/* Copy thresholds (if any) to new array */ |
2c488db27 memcg: clean up m... |
4205 4206 |
if (thresholds->primary) { memcpy(new->entries, thresholds->primary->entries, (size - 1) * |
2e72b6347 memcg: implement ... |
4207 |
sizeof(struct mem_cgroup_threshold)); |
2c488db27 memcg: clean up m... |
4208 |
} |
2e72b6347 memcg: implement ... |
4209 |
/* Add new threshold */ |
2c488db27 memcg: clean up m... |
4210 4211 |
new->entries[size - 1].eventfd = eventfd; new->entries[size - 1].threshold = threshold; |
2e72b6347 memcg: implement ... |
4212 4213 |
/* Sort thresholds. Registering of new threshold isn't time-critical */ |
2c488db27 memcg: clean up m... |
4214 |
sort(new->entries, size, sizeof(struct mem_cgroup_threshold), |
2e72b6347 memcg: implement ... |
4215 4216 4217 |
compare_thresholds, NULL); /* Find current threshold */ |
2c488db27 memcg: clean up m... |
4218 |
new->current_threshold = -1; |
2e72b6347 memcg: implement ... |
4219 |
for (i = 0; i < size; i++) { |
2c488db27 memcg: clean up m... |
4220 |
if (new->entries[i].threshold < usage) { |
2e72b6347 memcg: implement ... |
4221 |
/* |
2c488db27 memcg: clean up m... |
4222 4223 |
* new->current_threshold will not be used until * rcu_assign_pointer(), so it's safe to increment |
2e72b6347 memcg: implement ... |
4224 4225 |
* it here. */ |
2c488db27 memcg: clean up m... |
4226 |
++new->current_threshold; |
2e72b6347 memcg: implement ... |
4227 4228 |
} } |
2c488db27 memcg: clean up m... |
4229 4230 4231 4232 4233 |
/* Free old spare buffer and save old primary buffer as spare */ kfree(thresholds->spare); thresholds->spare = thresholds->primary; rcu_assign_pointer(thresholds->primary, new); |
2e72b6347 memcg: implement ... |
4234 |
|
907860ed3 cgroups: make cft... |
4235 |
/* To be sure that nobody uses thresholds */ |
2e72b6347 memcg: implement ... |
4236 |
synchronize_rcu(); |
2e72b6347 memcg: implement ... |
4237 4238 4239 4240 4241 |
unlock: mutex_unlock(&memcg->thresholds_lock); return ret; } |
907860ed3 cgroups: make cft... |
4242 |
static void mem_cgroup_usage_unregister_event(struct cgroup *cgrp, |
9490ff275 memcg: oom notifier |
4243 |
struct cftype *cft, struct eventfd_ctx *eventfd) |
2e72b6347 memcg: implement ... |
4244 4245 |
{ struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
2c488db27 memcg: clean up m... |
4246 4247 |
struct mem_cgroup_thresholds *thresholds; struct mem_cgroup_threshold_ary *new; |
2e72b6347 memcg: implement ... |
4248 4249 |
int type = MEMFILE_TYPE(cft->private); u64 usage; |
2c488db27 memcg: clean up m... |
4250 |
int i, j, size; |
2e72b6347 memcg: implement ... |
4251 4252 4253 |
mutex_lock(&memcg->thresholds_lock); if (type == _MEM) |
2c488db27 memcg: clean up m... |
4254 |
thresholds = &memcg->thresholds; |
2e72b6347 memcg: implement ... |
4255 |
else if (type == _MEMSWAP) |
2c488db27 memcg: clean up m... |
4256 |
thresholds = &memcg->memsw_thresholds; |
2e72b6347 memcg: implement ... |
4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 |
else BUG(); /* * Something went wrong if we trying to unregister a threshold * if we don't have thresholds */ BUG_ON(!thresholds); usage = mem_cgroup_usage(memcg, type == _MEMSWAP); /* Check if a threshold crossed before removing */ __mem_cgroup_threshold(memcg, type == _MEMSWAP); /* Calculate new number of threshold */ |
2c488db27 memcg: clean up m... |
4272 4273 4274 |
size = 0; for (i = 0; i < thresholds->primary->size; i++) { if (thresholds->primary->entries[i].eventfd != eventfd) |
2e72b6347 memcg: implement ... |
4275 4276 |
size++; } |
2c488db27 memcg: clean up m... |
4277 |
new = thresholds->spare; |
907860ed3 cgroups: make cft... |
4278 |
|
2e72b6347 memcg: implement ... |
4279 4280 |
/* Set thresholds array to NULL if we don't have thresholds */ if (!size) { |
2c488db27 memcg: clean up m... |
4281 4282 |
kfree(new); new = NULL; |
907860ed3 cgroups: make cft... |
4283 |
goto swap_buffers; |
2e72b6347 memcg: implement ... |
4284 |
} |
2c488db27 memcg: clean up m... |
4285 |
new->size = size; |
2e72b6347 memcg: implement ... |
4286 4287 |
/* Copy thresholds and find current threshold */ |
2c488db27 memcg: clean up m... |
4288 4289 4290 |
new->current_threshold = -1; for (i = 0, j = 0; i < thresholds->primary->size; i++) { if (thresholds->primary->entries[i].eventfd == eventfd) |
2e72b6347 memcg: implement ... |
4291 |
continue; |
2c488db27 memcg: clean up m... |
4292 4293 |
new->entries[j] = thresholds->primary->entries[i]; if (new->entries[j].threshold < usage) { |
2e72b6347 memcg: implement ... |
4294 |
/* |
2c488db27 memcg: clean up m... |
4295 |
* new->current_threshold will not be used |
2e72b6347 memcg: implement ... |
4296 4297 4298 |
* until rcu_assign_pointer(), so it's safe to increment * it here. */ |
2c488db27 memcg: clean up m... |
4299 |
++new->current_threshold; |
2e72b6347 memcg: implement ... |
4300 4301 4302 |
} j++; } |
907860ed3 cgroups: make cft... |
4303 |
swap_buffers: |
2c488db27 memcg: clean up m... |
4304 4305 4306 |
/* Swap primary and spare array */ thresholds->spare = thresholds->primary; rcu_assign_pointer(thresholds->primary, new); |
2e72b6347 memcg: implement ... |
4307 |
|
907860ed3 cgroups: make cft... |
4308 |
/* To be sure that nobody uses thresholds */ |
2e72b6347 memcg: implement ... |
4309 |
synchronize_rcu(); |
2e72b6347 memcg: implement ... |
4310 |
mutex_unlock(&memcg->thresholds_lock); |
2e72b6347 memcg: implement ... |
4311 |
} |
c1e862c1f memcg: new force_... |
4312 |
|
9490ff275 memcg: oom notifier |
4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 |
static int mem_cgroup_oom_register_event(struct cgroup *cgrp, struct cftype *cft, struct eventfd_ctx *eventfd, const char *args) { struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); struct mem_cgroup_eventfd_list *event; int type = MEMFILE_TYPE(cft->private); BUG_ON(type != _OOM_TYPE); event = kmalloc(sizeof(*event), GFP_KERNEL); if (!event) return -ENOMEM; |
1af8efe96 memcg: change mem... |
4324 |
spin_lock(&memcg_oom_lock); |
9490ff275 memcg: oom notifier |
4325 4326 4327 4328 4329 |
event->eventfd = eventfd; list_add(&event->list, &memcg->oom_notify); /* already in OOM ? */ |
79dfdaccd memcg: make oom_l... |
4330 |
if (atomic_read(&memcg->under_oom)) |
9490ff275 memcg: oom notifier |
4331 |
eventfd_signal(eventfd, 1); |
1af8efe96 memcg: change mem... |
4332 |
spin_unlock(&memcg_oom_lock); |
9490ff275 memcg: oom notifier |
4333 4334 4335 |
return 0; } |
907860ed3 cgroups: make cft... |
4336 |
static void mem_cgroup_oom_unregister_event(struct cgroup *cgrp, |
9490ff275 memcg: oom notifier |
4337 4338 |
struct cftype *cft, struct eventfd_ctx *eventfd) { |
c0ff4b854 memcg: rename mem... |
4339 |
struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
9490ff275 memcg: oom notifier |
4340 4341 4342 4343 |
struct mem_cgroup_eventfd_list *ev, *tmp; int type = MEMFILE_TYPE(cft->private); BUG_ON(type != _OOM_TYPE); |
1af8efe96 memcg: change mem... |
4344 |
spin_lock(&memcg_oom_lock); |
9490ff275 memcg: oom notifier |
4345 |
|
c0ff4b854 memcg: rename mem... |
4346 |
list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) { |
9490ff275 memcg: oom notifier |
4347 4348 4349 4350 4351 |
if (ev->eventfd == eventfd) { list_del(&ev->list); kfree(ev); } } |
1af8efe96 memcg: change mem... |
4352 |
spin_unlock(&memcg_oom_lock); |
9490ff275 memcg: oom notifier |
4353 |
} |
3c11ecf44 memcg: oom kill d... |
4354 4355 4356 |
static int mem_cgroup_oom_control_read(struct cgroup *cgrp, struct cftype *cft, struct cgroup_map_cb *cb) { |
c0ff4b854 memcg: rename mem... |
4357 |
struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
3c11ecf44 memcg: oom kill d... |
4358 |
|
c0ff4b854 memcg: rename mem... |
4359 |
cb->fill(cb, "oom_kill_disable", memcg->oom_kill_disable); |
3c11ecf44 memcg: oom kill d... |
4360 |
|
c0ff4b854 memcg: rename mem... |
4361 |
if (atomic_read(&memcg->under_oom)) |
3c11ecf44 memcg: oom kill d... |
4362 4363 4364 4365 4366 |
cb->fill(cb, "under_oom", 1); else cb->fill(cb, "under_oom", 0); return 0; } |
3c11ecf44 memcg: oom kill d... |
4367 4368 4369 |
static int mem_cgroup_oom_control_write(struct cgroup *cgrp, struct cftype *cft, u64 val) { |
c0ff4b854 memcg: rename mem... |
4370 |
struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
3c11ecf44 memcg: oom kill d... |
4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 |
struct mem_cgroup *parent; /* cannot set to root cgroup and only 0 and 1 are allowed */ if (!cgrp->parent || !((val == 0) || (val == 1))) return -EINVAL; parent = mem_cgroup_from_cont(cgrp->parent); cgroup_lock(); /* oom-kill-disable is a flag for subhierarchy. */ if ((parent->use_hierarchy) || |
c0ff4b854 memcg: rename mem... |
4382 |
(memcg->use_hierarchy && !list_empty(&cgrp->children))) { |
3c11ecf44 memcg: oom kill d... |
4383 4384 4385 |
cgroup_unlock(); return -EINVAL; } |
c0ff4b854 memcg: rename mem... |
4386 |
memcg->oom_kill_disable = val; |
4d845ebf4 memcg: fix wake u... |
4387 |
if (!val) |
c0ff4b854 memcg: rename mem... |
4388 |
memcg_oom_recover(memcg); |
3c11ecf44 memcg: oom kill d... |
4389 4390 4391 |
cgroup_unlock(); return 0; } |
406eb0c9b memcg: add memory... |
4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 |
#ifdef CONFIG_NUMA static const struct file_operations mem_control_numa_stat_file_operations = { .read = seq_read, .llseek = seq_lseek, .release = single_release, }; static int mem_control_numa_stat_open(struct inode *unused, struct file *file) { struct cgroup *cont = file->f_dentry->d_parent->d_fsdata; file->f_op = &mem_control_numa_stat_file_operations; return single_open(file, mem_control_numa_stat_show, cont); } #endif /* CONFIG_NUMA */ |
8cdea7c05 Memory controller... |
4407 4408 |
static struct cftype mem_cgroup_files[] = { { |
0eea10301 Memory controller... |
4409 |
.name = "usage_in_bytes", |
8c7c6e34a memcg: mem+swap c... |
4410 |
.private = MEMFILE_PRIVATE(_MEM, RES_USAGE), |
2c3daa722 CGroup API files:... |
4411 |
.read_u64 = mem_cgroup_read, |
9490ff275 memcg: oom notifier |
4412 4413 |
.register_event = mem_cgroup_usage_register_event, .unregister_event = mem_cgroup_usage_unregister_event, |
8cdea7c05 Memory controller... |
4414 4415 |
}, { |
c84872e16 memcgroup: add th... |
4416 |
.name = "max_usage_in_bytes", |
8c7c6e34a memcg: mem+swap c... |
4417 |
.private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE), |
29f2a4dac memcgroup: implem... |
4418 |
.trigger = mem_cgroup_reset, |
c84872e16 memcgroup: add th... |
4419 4420 4421 |
.read_u64 = mem_cgroup_read, }, { |
0eea10301 Memory controller... |
4422 |
.name = "limit_in_bytes", |
8c7c6e34a memcg: mem+swap c... |
4423 |
.private = MEMFILE_PRIVATE(_MEM, RES_LIMIT), |
856c13aa1 cgroup files: con... |
4424 |
.write_string = mem_cgroup_write, |
2c3daa722 CGroup API files:... |
4425 |
.read_u64 = mem_cgroup_read, |
8cdea7c05 Memory controller... |
4426 4427 |
}, { |
296c81d89 memory controller... |
4428 4429 4430 4431 4432 4433 |
.name = "soft_limit_in_bytes", .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT), .write_string = mem_cgroup_write, .read_u64 = mem_cgroup_read, }, { |
8cdea7c05 Memory controller... |
4434 |
.name = "failcnt", |
8c7c6e34a memcg: mem+swap c... |
4435 |
.private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT), |
29f2a4dac memcgroup: implem... |
4436 |
.trigger = mem_cgroup_reset, |
2c3daa722 CGroup API files:... |
4437 |
.read_u64 = mem_cgroup_read, |
8cdea7c05 Memory controller... |
4438 |
}, |
8697d3319 Memory controller... |
4439 |
{ |
d2ceb9b7d memory cgroup enh... |
4440 |
.name = "stat", |
c64745cf0 CGroup API files:... |
4441 |
.read_map = mem_control_stat_show, |
d2ceb9b7d memory cgroup enh... |
4442 |
}, |
c1e862c1f memcg: new force_... |
4443 4444 4445 4446 |
{ .name = "force_empty", .trigger = mem_cgroup_force_empty_write, }, |
18f59ea7d memcg: memory cgr... |
4447 4448 4449 4450 4451 |
{ .name = "use_hierarchy", .write_u64 = mem_cgroup_hierarchy_write, .read_u64 = mem_cgroup_hierarchy_read, }, |
a7885eb8a memcg: swappiness |
4452 4453 4454 4455 4456 |
{ .name = "swappiness", .read_u64 = mem_cgroup_swappiness_read, .write_u64 = mem_cgroup_swappiness_write, }, |
7dc74be03 memcg: add interf... |
4457 4458 4459 4460 4461 |
{ .name = "move_charge_at_immigrate", .read_u64 = mem_cgroup_move_charge_read, .write_u64 = mem_cgroup_move_charge_write, }, |
9490ff275 memcg: oom notifier |
4462 4463 |
{ .name = "oom_control", |
3c11ecf44 memcg: oom kill d... |
4464 4465 |
.read_map = mem_cgroup_oom_control_read, .write_u64 = mem_cgroup_oom_control_write, |
9490ff275 memcg: oom notifier |
4466 4467 4468 4469 |
.register_event = mem_cgroup_oom_register_event, .unregister_event = mem_cgroup_oom_unregister_event, .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL), }, |
406eb0c9b memcg: add memory... |
4470 4471 4472 4473 |
#ifdef CONFIG_NUMA { .name = "numa_stat", .open = mem_control_numa_stat_open, |
895771271 mm: memory.numa_s... |
4474 |
.mode = S_IRUGO, |
406eb0c9b memcg: add memory... |
4475 4476 |
}, #endif |
8cdea7c05 Memory controller... |
4477 |
}; |
8c7c6e34a memcg: mem+swap c... |
4478 4479 4480 4481 4482 4483 |
#ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP static struct cftype memsw_cgroup_files[] = { { .name = "memsw.usage_in_bytes", .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE), .read_u64 = mem_cgroup_read, |
9490ff275 memcg: oom notifier |
4484 4485 |
.register_event = mem_cgroup_usage_register_event, .unregister_event = mem_cgroup_usage_unregister_event, |
8c7c6e34a memcg: mem+swap c... |
4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 |
}, { .name = "memsw.max_usage_in_bytes", .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE), .trigger = mem_cgroup_reset, .read_u64 = mem_cgroup_read, }, { .name = "memsw.limit_in_bytes", .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT), .write_string = mem_cgroup_write, .read_u64 = mem_cgroup_read, }, { .name = "memsw.failcnt", .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT), .trigger = mem_cgroup_reset, .read_u64 = mem_cgroup_read, }, }; static int register_memsw_files(struct cgroup *cont, struct cgroup_subsys *ss) { if (!do_swap_account) return 0; return cgroup_add_files(cont, ss, memsw_cgroup_files, ARRAY_SIZE(memsw_cgroup_files)); }; #else static int register_memsw_files(struct cgroup *cont, struct cgroup_subsys *ss) { return 0; } #endif |
c0ff4b854 memcg: rename mem... |
4520 |
static int alloc_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node) |
6d12e2d8d per-zone and recl... |
4521 4522 |
{ struct mem_cgroup_per_node *pn; |
1ecaab2bd per-zone and recl... |
4523 |
struct mem_cgroup_per_zone *mz; |
b69408e88 vmscan: Use an in... |
4524 |
enum lru_list l; |
41e3355de memcg: fix node_s... |
4525 |
int zone, tmp = node; |
1ecaab2bd per-zone and recl... |
4526 4527 4528 4529 4530 4531 4532 4533 |
/* * This routine is called against possible nodes. * But it's BUG to call kmalloc() against offline node. * * TODO: this routine can waste much memory for nodes which will * never be onlined. It's better to use memory hotplug callback * function. */ |
41e3355de memcg: fix node_s... |
4534 4535 |
if (!node_state(node, N_NORMAL_MEMORY)) tmp = -1; |
17295c88a memcg: use [kv]za... |
4536 |
pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp); |
6d12e2d8d per-zone and recl... |
4537 4538 |
if (!pn) return 1; |
1ecaab2bd per-zone and recl... |
4539 |
|
1ecaab2bd per-zone and recl... |
4540 4541 |
for (zone = 0; zone < MAX_NR_ZONES; zone++) { mz = &pn->zoneinfo[zone]; |
b69408e88 vmscan: Use an in... |
4542 4543 |
for_each_lru(l) INIT_LIST_HEAD(&mz->lists[l]); |
f64c3f549 memory controller... |
4544 |
mz->usage_in_excess = 0; |
4e4169535 memory controller... |
4545 |
mz->on_tree = false; |
c0ff4b854 memcg: rename mem... |
4546 |
mz->mem = memcg; |
1ecaab2bd per-zone and recl... |
4547 |
} |
0a619e587 memcg: do not exp... |
4548 |
memcg->info.nodeinfo[node] = pn; |
6d12e2d8d per-zone and recl... |
4549 4550 |
return 0; } |
c0ff4b854 memcg: rename mem... |
4551 |
static void free_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node) |
1ecaab2bd per-zone and recl... |
4552 |
{ |
c0ff4b854 memcg: rename mem... |
4553 |
kfree(memcg->info.nodeinfo[node]); |
1ecaab2bd per-zone and recl... |
4554 |
} |
333279487 memcgroup: use vm... |
4555 4556 4557 |
static struct mem_cgroup *mem_cgroup_alloc(void) { struct mem_cgroup *mem; |
c62b1a3b3 memcg: use generi... |
4558 |
int size = sizeof(struct mem_cgroup); |
333279487 memcgroup: use vm... |
4559 |
|
c62b1a3b3 memcg: use generi... |
4560 |
/* Can be very big if MAX_NUMNODES is very big */ |
c8dad2bb6 memcg: reduce siz... |
4561 |
if (size < PAGE_SIZE) |
17295c88a memcg: use [kv]za... |
4562 |
mem = kzalloc(size, GFP_KERNEL); |
333279487 memcgroup: use vm... |
4563 |
else |
17295c88a memcg: use [kv]za... |
4564 |
mem = vzalloc(size); |
333279487 memcgroup: use vm... |
4565 |
|
e7bbcdf37 memcontrol: fix p... |
4566 4567 |
if (!mem) return NULL; |
c62b1a3b3 memcg: use generi... |
4568 |
mem->stat = alloc_percpu(struct mem_cgroup_stat_cpu); |
d2e61b8dc memcg: null deref... |
4569 4570 |
if (!mem->stat) goto out_free; |
711d3d2c9 memcg: cpu hotplu... |
4571 |
spin_lock_init(&mem->pcp_counter_lock); |
333279487 memcgroup: use vm... |
4572 |
return mem; |
d2e61b8dc memcg: null deref... |
4573 4574 4575 4576 4577 4578 4579 |
out_free: if (size < PAGE_SIZE) kfree(mem); else vfree(mem); return NULL; |
333279487 memcgroup: use vm... |
4580 |
} |
8c7c6e34a memcg: mem+swap c... |
4581 4582 4583 4584 4585 4586 4587 4588 |
/* * At destroying mem_cgroup, references from swap_cgroup can remain. * (scanning all at force_empty is too costly...) * * Instead of clearing all references at force_empty, we remember * the number of reference from swap_cgroup and free mem_cgroup when * it goes down to 0. * |
8c7c6e34a memcg: mem+swap c... |
4589 4590 |
* Removal of cgroup itself succeeds regardless of refs from swap. */ |
c0ff4b854 memcg: rename mem... |
4591 |
static void __mem_cgroup_free(struct mem_cgroup *memcg) |
333279487 memcgroup: use vm... |
4592 |
{ |
08e552c69 memcg: synchroniz... |
4593 |
int node; |
c0ff4b854 memcg: rename mem... |
4594 4595 |
mem_cgroup_remove_from_trees(memcg); free_css_id(&mem_cgroup_subsys, &memcg->css); |
04046e1a0 memcg: use CSS ID |
4596 |
|
08e552c69 memcg: synchroniz... |
4597 |
for_each_node_state(node, N_POSSIBLE) |
c0ff4b854 memcg: rename mem... |
4598 |
free_mem_cgroup_per_zone_info(memcg, node); |
08e552c69 memcg: synchroniz... |
4599 |
|
c0ff4b854 memcg: rename mem... |
4600 |
free_percpu(memcg->stat); |
c62b1a3b3 memcg: use generi... |
4601 |
if (sizeof(struct mem_cgroup) < PAGE_SIZE) |
c0ff4b854 memcg: rename mem... |
4602 |
kfree(memcg); |
333279487 memcgroup: use vm... |
4603 |
else |
c0ff4b854 memcg: rename mem... |
4604 |
vfree(memcg); |
333279487 memcgroup: use vm... |
4605 |
} |
c0ff4b854 memcg: rename mem... |
4606 |
static void mem_cgroup_get(struct mem_cgroup *memcg) |
8c7c6e34a memcg: mem+swap c... |
4607 |
{ |
c0ff4b854 memcg: rename mem... |
4608 |
atomic_inc(&memcg->refcnt); |
8c7c6e34a memcg: mem+swap c... |
4609 |
} |
c0ff4b854 memcg: rename mem... |
4610 |
static void __mem_cgroup_put(struct mem_cgroup *memcg, int count) |
8c7c6e34a memcg: mem+swap c... |
4611 |
{ |
c0ff4b854 memcg: rename mem... |
4612 4613 4614 |
if (atomic_sub_and_test(count, &memcg->refcnt)) { struct mem_cgroup *parent = parent_mem_cgroup(memcg); __mem_cgroup_free(memcg); |
7bcc1bb12 memcg: get/put pa... |
4615 4616 4617 |
if (parent) mem_cgroup_put(parent); } |
8c7c6e34a memcg: mem+swap c... |
4618 |
} |
c0ff4b854 memcg: rename mem... |
4619 |
static void mem_cgroup_put(struct mem_cgroup *memcg) |
483c30b51 memcg: improve pe... |
4620 |
{ |
c0ff4b854 memcg: rename mem... |
4621 |
__mem_cgroup_put(memcg, 1); |
483c30b51 memcg: improve pe... |
4622 |
} |
7bcc1bb12 memcg: get/put pa... |
4623 4624 4625 |
/* * Returns the parent mem_cgroup in memcgroup hierarchy with hierarchy enabled. */ |
c0ff4b854 memcg: rename mem... |
4626 |
static struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *memcg) |
7bcc1bb12 memcg: get/put pa... |
4627 |
{ |
c0ff4b854 memcg: rename mem... |
4628 |
if (!memcg->res.parent) |
7bcc1bb12 memcg: get/put pa... |
4629 |
return NULL; |
c0ff4b854 memcg: rename mem... |
4630 |
return mem_cgroup_from_res_counter(memcg->res.parent, res); |
7bcc1bb12 memcg: get/put pa... |
4631 |
} |
333279487 memcgroup: use vm... |
4632 |
|
c077719be memcg: mem+swap c... |
4633 4634 4635 |
#ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP static void __init enable_swap_cgroup(void) { |
f8d665422 memcg: add mem_cg... |
4636 |
if (!mem_cgroup_disabled() && really_do_swap_account) |
c077719be memcg: mem+swap c... |
4637 4638 4639 4640 4641 4642 4643 |
do_swap_account = 1; } #else static void __init enable_swap_cgroup(void) { } #endif |
f64c3f549 memory controller... |
4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 |
static int mem_cgroup_soft_limit_tree_init(void) { struct mem_cgroup_tree_per_node *rtpn; struct mem_cgroup_tree_per_zone *rtpz; int tmp, node, zone; for_each_node_state(node, N_POSSIBLE) { tmp = node; if (!node_state(node, N_NORMAL_MEMORY)) tmp = -1; rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL, tmp); if (!rtpn) return 1; soft_limit_tree.rb_tree_per_node[node] = rtpn; for (zone = 0; zone < MAX_NR_ZONES; zone++) { rtpz = &rtpn->rb_tree_per_zone[zone]; rtpz->rb_root = RB_ROOT; spin_lock_init(&rtpz->lock); } } return 0; } |
0eb253e22 memcg: fix sectio... |
4668 |
static struct cgroup_subsys_state * __ref |
8cdea7c05 Memory controller... |
4669 4670 |
mem_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cont) { |
c0ff4b854 memcg: rename mem... |
4671 |
struct mem_cgroup *memcg, *parent; |
04046e1a0 memcg: use CSS ID |
4672 |
long error = -ENOMEM; |
6d12e2d8d per-zone and recl... |
4673 |
int node; |
8cdea7c05 Memory controller... |
4674 |
|
c0ff4b854 memcg: rename mem... |
4675 4676 |
memcg = mem_cgroup_alloc(); if (!memcg) |
04046e1a0 memcg: use CSS ID |
4677 |
return ERR_PTR(error); |
78fb74669 Memory controller... |
4678 |
|
6d12e2d8d per-zone and recl... |
4679 |
for_each_node_state(node, N_POSSIBLE) |
c0ff4b854 memcg: rename mem... |
4680 |
if (alloc_mem_cgroup_per_zone_info(memcg, node)) |
6d12e2d8d per-zone and recl... |
4681 |
goto free_out; |
f64c3f549 memory controller... |
4682 |
|
c077719be memcg: mem+swap c... |
4683 |
/* root ? */ |
28dbc4b6a memcg: memory cgr... |
4684 |
if (cont->parent == NULL) { |
cdec2e426 memcg: coalesce c... |
4685 |
int cpu; |
c077719be memcg: mem+swap c... |
4686 |
enable_swap_cgroup(); |
28dbc4b6a memcg: memory cgr... |
4687 |
parent = NULL; |
f64c3f549 memory controller... |
4688 4689 |
if (mem_cgroup_soft_limit_tree_init()) goto free_out; |
a41c58a66 memcg: keep root ... |
4690 |
root_mem_cgroup = memcg; |
cdec2e426 memcg: coalesce c... |
4691 4692 4693 4694 4695 |
for_each_possible_cpu(cpu) { struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu); INIT_WORK(&stock->work, drain_local_stock); } |
711d3d2c9 memcg: cpu hotplu... |
4696 |
hotcpu_notifier(memcg_cpu_hotplug_callback, 0); |
18f59ea7d memcg: memory cgr... |
4697 |
} else { |
28dbc4b6a memcg: memory cgr... |
4698 |
parent = mem_cgroup_from_cont(cont->parent); |
c0ff4b854 memcg: rename mem... |
4699 4700 |
memcg->use_hierarchy = parent->use_hierarchy; memcg->oom_kill_disable = parent->oom_kill_disable; |
18f59ea7d memcg: memory cgr... |
4701 |
} |
28dbc4b6a memcg: memory cgr... |
4702 |
|
18f59ea7d memcg: memory cgr... |
4703 |
if (parent && parent->use_hierarchy) { |
c0ff4b854 memcg: rename mem... |
4704 4705 |
res_counter_init(&memcg->res, &parent->res); res_counter_init(&memcg->memsw, &parent->memsw); |
7bcc1bb12 memcg: get/put pa... |
4706 4707 4708 4709 4710 4711 4712 |
/* * We increment refcnt of the parent to ensure that we can * safely access it on res_counter_charge/uncharge. * This refcnt will be decremented when freeing this * mem_cgroup(see mem_cgroup_put). */ mem_cgroup_get(parent); |
18f59ea7d memcg: memory cgr... |
4713 |
} else { |
c0ff4b854 memcg: rename mem... |
4714 4715 |
res_counter_init(&memcg->res, NULL); res_counter_init(&memcg->memsw, NULL); |
18f59ea7d memcg: memory cgr... |
4716 |
} |
c0ff4b854 memcg: rename mem... |
4717 4718 4719 |
memcg->last_scanned_child = 0; memcg->last_scanned_node = MAX_NUMNODES; INIT_LIST_HEAD(&memcg->oom_notify); |
6d61ef409 memcg: memory cgr... |
4720 |
|
a7885eb8a memcg: swappiness |
4721 |
if (parent) |
c0ff4b854 memcg: rename mem... |
4722 4723 4724 4725 4726 |
memcg->swappiness = mem_cgroup_swappiness(parent); atomic_set(&memcg->refcnt, 1); memcg->move_charge_at_immigrate = 0; mutex_init(&memcg->thresholds_lock); return &memcg->css; |
6d12e2d8d per-zone and recl... |
4727 |
free_out: |
c0ff4b854 memcg: rename mem... |
4728 |
__mem_cgroup_free(memcg); |
04046e1a0 memcg: use CSS ID |
4729 |
return ERR_PTR(error); |
8cdea7c05 Memory controller... |
4730 |
} |
ec64f5154 cgroup: fix frequ... |
4731 |
static int mem_cgroup_pre_destroy(struct cgroup_subsys *ss, |
df878fb04 memory cgroup enh... |
4732 4733 |
struct cgroup *cont) { |
c0ff4b854 memcg: rename mem... |
4734 |
struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
ec64f5154 cgroup: fix frequ... |
4735 |
|
c0ff4b854 memcg: rename mem... |
4736 |
return mem_cgroup_force_empty(memcg, false); |
df878fb04 memory cgroup enh... |
4737 |
} |
8cdea7c05 Memory controller... |
4738 4739 4740 |
static void mem_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cont) { |
c0ff4b854 memcg: rename mem... |
4741 |
struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
c268e9946 memcg: fix hierar... |
4742 |
|
c0ff4b854 memcg: rename mem... |
4743 |
mem_cgroup_put(memcg); |
8cdea7c05 Memory controller... |
4744 4745 4746 4747 4748 |
} static int mem_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont) { |
8c7c6e34a memcg: mem+swap c... |
4749 4750 4751 4752 4753 4754 4755 4756 |
int ret; ret = cgroup_add_files(cont, ss, mem_cgroup_files, ARRAY_SIZE(mem_cgroup_files)); if (!ret) ret = register_memsw_files(cont, ss); return ret; |
8cdea7c05 Memory controller... |
4757 |
} |
024914477 memcg: move charg... |
4758 |
#ifdef CONFIG_MMU |
7dc74be03 memcg: add interf... |
4759 |
/* Handlers for move charge at task migration. */ |
854ffa8d1 memcg: improve pe... |
4760 4761 |
#define PRECHARGE_COUNT_AT_ONCE 256 static int mem_cgroup_do_precharge(unsigned long count) |
7dc74be03 memcg: add interf... |
4762 |
{ |
854ffa8d1 memcg: improve pe... |
4763 4764 |
int ret = 0; int batch_count = PRECHARGE_COUNT_AT_ONCE; |
c0ff4b854 memcg: rename mem... |
4765 |
struct mem_cgroup *memcg = mc.to; |
4ffef5fef memcg: move charg... |
4766 |
|
c0ff4b854 memcg: rename mem... |
4767 |
if (mem_cgroup_is_root(memcg)) { |
854ffa8d1 memcg: improve pe... |
4768 4769 4770 4771 4772 4773 4774 4775 |
mc.precharge += count; /* we don't need css_get for root */ return ret; } /* try to charge at once */ if (count > 1) { struct res_counter *dummy; /* |
c0ff4b854 memcg: rename mem... |
4776 |
* "memcg" cannot be under rmdir() because we've already checked |
854ffa8d1 memcg: improve pe... |
4777 4778 4779 4780 |
* by cgroup_lock_live_cgroup() that it is not removed and we * are still under the same cgroup_mutex. So we can postpone * css_get(). */ |
c0ff4b854 memcg: rename mem... |
4781 |
if (res_counter_charge(&memcg->res, PAGE_SIZE * count, &dummy)) |
854ffa8d1 memcg: improve pe... |
4782 |
goto one_by_one; |
c0ff4b854 memcg: rename mem... |
4783 |
if (do_swap_account && res_counter_charge(&memcg->memsw, |
854ffa8d1 memcg: improve pe... |
4784 |
PAGE_SIZE * count, &dummy)) { |
c0ff4b854 memcg: rename mem... |
4785 |
res_counter_uncharge(&memcg->res, PAGE_SIZE * count); |
854ffa8d1 memcg: improve pe... |
4786 4787 4788 |
goto one_by_one; } mc.precharge += count; |
854ffa8d1 memcg: improve pe... |
4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 |
return ret; } one_by_one: /* fall back to one by one charge */ while (count--) { if (signal_pending(current)) { ret = -EINTR; break; } if (!batch_count--) { batch_count = PRECHARGE_COUNT_AT_ONCE; cond_resched(); } |
c0ff4b854 memcg: rename mem... |
4802 4803 4804 |
ret = __mem_cgroup_try_charge(NULL, GFP_KERNEL, 1, &memcg, false); if (ret || !memcg) |
854ffa8d1 memcg: improve pe... |
4805 4806 4807 4808 |
/* mem_cgroup_clear_mc() will do uncharge later */ return -ENOMEM; mc.precharge++; } |
4ffef5fef memcg: move charg... |
4809 4810 4811 4812 4813 4814 4815 4816 |
return ret; } /** * is_target_pte_for_mc - check a pte whether it is valid for move charge * @vma: the vma the pte to be checked belongs * @addr: the address corresponding to the pte to be checked * @ptent: the pte to be checked |
024914477 memcg: move charg... |
4817 |
* @target: the pointer the target page or swap ent will be stored(can be NULL) |
4ffef5fef memcg: move charg... |
4818 4819 4820 4821 4822 4823 |
* * Returns * 0(MC_TARGET_NONE): if the pte is not a target for move charge. * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for * move charge. if @target is not NULL, the page is stored in target->page * with extra refcnt got(Callers should handle it). |
024914477 memcg: move charg... |
4824 4825 4826 |
* 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a * target for charge migration. if @target is not NULL, the entry is stored * in target->ent. |
4ffef5fef memcg: move charg... |
4827 4828 4829 |
* * Called with pte lock held. */ |
4ffef5fef memcg: move charg... |
4830 4831 |
union mc_target { struct page *page; |
024914477 memcg: move charg... |
4832 |
swp_entry_t ent; |
4ffef5fef memcg: move charg... |
4833 |
}; |
4ffef5fef memcg: move charg... |
4834 4835 4836 |
enum mc_target_type { MC_TARGET_NONE, /* not used */ MC_TARGET_PAGE, |
024914477 memcg: move charg... |
4837 |
MC_TARGET_SWAP, |
4ffef5fef memcg: move charg... |
4838 |
}; |
90254a658 memcg: clean up m... |
4839 4840 |
static struct page *mc_handle_present_pte(struct vm_area_struct *vma, unsigned long addr, pte_t ptent) |
4ffef5fef memcg: move charg... |
4841 |
{ |
90254a658 memcg: clean up m... |
4842 |
struct page *page = vm_normal_page(vma, addr, ptent); |
4ffef5fef memcg: move charg... |
4843 |
|
90254a658 memcg: clean up m... |
4844 4845 4846 4847 4848 4849 |
if (!page || !page_mapped(page)) return NULL; if (PageAnon(page)) { /* we don't move shared anon */ if (!move_anon() || page_mapcount(page) > 2) return NULL; |
87946a722 memcg: move charg... |
4850 4851 |
} else if (!move_file()) /* we ignore mapcount for file pages */ |
90254a658 memcg: clean up m... |
4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 |
return NULL; if (!get_page_unless_zero(page)) return NULL; return page; } static struct page *mc_handle_swap_pte(struct vm_area_struct *vma, unsigned long addr, pte_t ptent, swp_entry_t *entry) { int usage_count; struct page *page = NULL; swp_entry_t ent = pte_to_swp_entry(ptent); if (!move_anon() || non_swap_entry(ent)) return NULL; usage_count = mem_cgroup_count_swap_user(ent, &page); if (usage_count > 1) { /* we don't move shared anon */ |
024914477 memcg: move charg... |
4870 4871 |
if (page) put_page(page); |
90254a658 memcg: clean up m... |
4872 |
return NULL; |
024914477 memcg: move charg... |
4873 |
} |
90254a658 memcg: clean up m... |
4874 4875 4876 4877 4878 |
if (do_swap_account) entry->val = ent.val; return page; } |
87946a722 memcg: move charg... |
4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 |
static struct page *mc_handle_file_pte(struct vm_area_struct *vma, unsigned long addr, pte_t ptent, swp_entry_t *entry) { struct page *page = NULL; struct inode *inode; struct address_space *mapping; pgoff_t pgoff; if (!vma->vm_file) /* anonymous vma */ return NULL; if (!move_file()) return NULL; inode = vma->vm_file->f_path.dentry->d_inode; mapping = vma->vm_file->f_mapping; if (pte_none(ptent)) pgoff = linear_page_index(vma, addr); else /* pte_file(ptent) is true */ pgoff = pte_to_pgoff(ptent); /* page is moved even if it's not RSS of this task(page-faulted). */ |
aa3b18955 tmpfs: convert me... |
4900 4901 4902 4903 4904 4905 |
page = find_get_page(mapping, pgoff); #ifdef CONFIG_SWAP /* shmem/tmpfs may report page out on swap: account for that too. */ if (radix_tree_exceptional_entry(page)) { swp_entry_t swap = radix_to_swp_entry(page); |
87946a722 memcg: move charg... |
4906 |
if (do_swap_account) |
aa3b18955 tmpfs: convert me... |
4907 4908 |
*entry = swap; page = find_get_page(&swapper_space, swap.val); |
87946a722 memcg: move charg... |
4909 |
} |
aa3b18955 tmpfs: convert me... |
4910 |
#endif |
87946a722 memcg: move charg... |
4911 4912 |
return page; } |
90254a658 memcg: clean up m... |
4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 |
static int is_target_pte_for_mc(struct vm_area_struct *vma, unsigned long addr, pte_t ptent, union mc_target *target) { struct page *page = NULL; struct page_cgroup *pc; int ret = 0; swp_entry_t ent = { .val = 0 }; if (pte_present(ptent)) page = mc_handle_present_pte(vma, addr, ptent); else if (is_swap_pte(ptent)) page = mc_handle_swap_pte(vma, addr, ptent, &ent); |
87946a722 memcg: move charg... |
4925 4926 |
else if (pte_none(ptent) || pte_file(ptent)) page = mc_handle_file_pte(vma, addr, ptent, &ent); |
90254a658 memcg: clean up m... |
4927 4928 4929 |
if (!page && !ent.val) return 0; |
024914477 memcg: move charg... |
4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 |
if (page) { pc = lookup_page_cgroup(page); /* * Do only loose check w/o page_cgroup lock. * mem_cgroup_move_account() checks the pc is valid or not under * the lock. */ if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) { ret = MC_TARGET_PAGE; if (target) target->page = page; } if (!ret || !target) put_page(page); } |
90254a658 memcg: clean up m... |
4945 4946 |
/* There is a swap entry and a page doesn't exist or isn't charged */ if (ent.val && !ret && |
7f0f15464 memcg: fix css_id... |
4947 4948 4949 4950 |
css_id(&mc.from->css) == lookup_swap_cgroup(ent)) { ret = MC_TARGET_SWAP; if (target) target->ent = ent; |
4ffef5fef memcg: move charg... |
4951 |
} |
4ffef5fef memcg: move charg... |
4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 |
return ret; } static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end, struct mm_walk *walk) { struct vm_area_struct *vma = walk->private; pte_t *pte; spinlock_t *ptl; |
033193275 pagewalk: only sp... |
4962 |
split_huge_page_pmd(walk->mm, pmd); |
4ffef5fef memcg: move charg... |
4963 4964 4965 4966 4967 4968 |
pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl); for (; addr != end; pte++, addr += PAGE_SIZE) if (is_target_pte_for_mc(vma, addr, *pte, NULL)) mc.precharge++; /* increment precharge temporarily */ pte_unmap_unlock(pte - 1, ptl); cond_resched(); |
7dc74be03 memcg: add interf... |
4969 4970 |
return 0; } |
4ffef5fef memcg: move charg... |
4971 4972 4973 4974 |
static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm) { unsigned long precharge; struct vm_area_struct *vma; |
dfe076b09 memcg: fix deadlo... |
4975 |
down_read(&mm->mmap_sem); |
4ffef5fef memcg: move charg... |
4976 4977 4978 4979 4980 4981 4982 4983 |
for (vma = mm->mmap; vma; vma = vma->vm_next) { struct mm_walk mem_cgroup_count_precharge_walk = { .pmd_entry = mem_cgroup_count_precharge_pte_range, .mm = mm, .private = vma, }; if (is_vm_hugetlb_page(vma)) continue; |
4ffef5fef memcg: move charg... |
4984 4985 4986 |
walk_page_range(vma->vm_start, vma->vm_end, &mem_cgroup_count_precharge_walk); } |
dfe076b09 memcg: fix deadlo... |
4987 |
up_read(&mm->mmap_sem); |
4ffef5fef memcg: move charg... |
4988 4989 4990 4991 4992 4993 |
precharge = mc.precharge; mc.precharge = 0; return precharge; } |
4ffef5fef memcg: move charg... |
4994 4995 |
static int mem_cgroup_precharge_mc(struct mm_struct *mm) { |
dfe076b09 memcg: fix deadlo... |
4996 4997 4998 4999 5000 |
unsigned long precharge = mem_cgroup_count_precharge(mm); VM_BUG_ON(mc.moving_task); mc.moving_task = current; return mem_cgroup_do_precharge(precharge); |
4ffef5fef memcg: move charg... |
5001 |
} |
dfe076b09 memcg: fix deadlo... |
5002 5003 |
/* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */ static void __mem_cgroup_clear_mc(void) |
4ffef5fef memcg: move charg... |
5004 |
{ |
2bd9bb206 memcg: clean up w... |
5005 5006 |
struct mem_cgroup *from = mc.from; struct mem_cgroup *to = mc.to; |
4ffef5fef memcg: move charg... |
5007 |
/* we must uncharge all the leftover precharges from mc.to */ |
854ffa8d1 memcg: improve pe... |
5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 |
if (mc.precharge) { __mem_cgroup_cancel_charge(mc.to, mc.precharge); mc.precharge = 0; } /* * we didn't uncharge from mc.from at mem_cgroup_move_account(), so * we must uncharge here. */ if (mc.moved_charge) { __mem_cgroup_cancel_charge(mc.from, mc.moved_charge); mc.moved_charge = 0; |
4ffef5fef memcg: move charg... |
5019 |
} |
483c30b51 memcg: improve pe... |
5020 5021 |
/* we must fixup refcnts and charges */ if (mc.moved_swap) { |
483c30b51 memcg: improve pe... |
5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 |
/* uncharge swap account from the old cgroup */ if (!mem_cgroup_is_root(mc.from)) res_counter_uncharge(&mc.from->memsw, PAGE_SIZE * mc.moved_swap); __mem_cgroup_put(mc.from, mc.moved_swap); if (!mem_cgroup_is_root(mc.to)) { /* * we charged both to->res and to->memsw, so we should * uncharge to->res. */ res_counter_uncharge(&mc.to->res, PAGE_SIZE * mc.moved_swap); |
483c30b51 memcg: improve pe... |
5035 5036 |
} /* we've already done mem_cgroup_get(mc.to) */ |
483c30b51 memcg: improve pe... |
5037 5038 |
mc.moved_swap = 0; } |
dfe076b09 memcg: fix deadlo... |
5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 |
memcg_oom_recover(from); memcg_oom_recover(to); wake_up_all(&mc.waitq); } static void mem_cgroup_clear_mc(void) { struct mem_cgroup *from = mc.from; /* * we must clear moving_task before waking up waiters at the end of * task migration. */ mc.moving_task = NULL; __mem_cgroup_clear_mc(); |
2bd9bb206 memcg: clean up w... |
5054 |
spin_lock(&mc.lock); |
4ffef5fef memcg: move charg... |
5055 5056 |
mc.from = NULL; mc.to = NULL; |
2bd9bb206 memcg: clean up w... |
5057 |
spin_unlock(&mc.lock); |
32047e2a8 memcg: avoid lock... |
5058 |
mem_cgroup_end_move(from); |
4ffef5fef memcg: move charg... |
5059 |
} |
7dc74be03 memcg: add interf... |
5060 5061 |
static int mem_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgroup, |
f780bdb7c cgroups: add per-... |
5062 |
struct task_struct *p) |
7dc74be03 memcg: add interf... |
5063 5064 |
{ int ret = 0; |
c0ff4b854 memcg: rename mem... |
5065 |
struct mem_cgroup *memcg = mem_cgroup_from_cont(cgroup); |
7dc74be03 memcg: add interf... |
5066 |
|
c0ff4b854 memcg: rename mem... |
5067 |
if (memcg->move_charge_at_immigrate) { |
7dc74be03 memcg: add interf... |
5068 5069 |
struct mm_struct *mm; struct mem_cgroup *from = mem_cgroup_from_task(p); |
c0ff4b854 memcg: rename mem... |
5070 |
VM_BUG_ON(from == memcg); |
7dc74be03 memcg: add interf... |
5071 5072 5073 5074 |
mm = get_task_mm(p); if (!mm) return 0; |
7dc74be03 memcg: add interf... |
5075 |
/* We move charges only when we move a owner of the mm */ |
4ffef5fef memcg: move charg... |
5076 5077 5078 5079 |
if (mm->owner == p) { VM_BUG_ON(mc.from); VM_BUG_ON(mc.to); VM_BUG_ON(mc.precharge); |
854ffa8d1 memcg: improve pe... |
5080 |
VM_BUG_ON(mc.moved_charge); |
483c30b51 memcg: improve pe... |
5081 |
VM_BUG_ON(mc.moved_swap); |
32047e2a8 memcg: avoid lock... |
5082 |
mem_cgroup_start_move(from); |
2bd9bb206 memcg: clean up w... |
5083 |
spin_lock(&mc.lock); |
4ffef5fef memcg: move charg... |
5084 |
mc.from = from; |
c0ff4b854 memcg: rename mem... |
5085 |
mc.to = memcg; |
2bd9bb206 memcg: clean up w... |
5086 |
spin_unlock(&mc.lock); |
dfe076b09 memcg: fix deadlo... |
5087 |
/* We set mc.moving_task later */ |
4ffef5fef memcg: move charg... |
5088 5089 5090 5091 |
ret = mem_cgroup_precharge_mc(mm); if (ret) mem_cgroup_clear_mc(); |
dfe076b09 memcg: fix deadlo... |
5092 5093 |
} mmput(mm); |
7dc74be03 memcg: add interf... |
5094 5095 5096 5097 5098 5099 |
} return ret; } static void mem_cgroup_cancel_attach(struct cgroup_subsys *ss, struct cgroup *cgroup, |
f780bdb7c cgroups: add per-... |
5100 |
struct task_struct *p) |
7dc74be03 memcg: add interf... |
5101 |
{ |
4ffef5fef memcg: move charg... |
5102 |
mem_cgroup_clear_mc(); |
7dc74be03 memcg: add interf... |
5103 |
} |
4ffef5fef memcg: move charg... |
5104 5105 5106 |
static int mem_cgroup_move_charge_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end, struct mm_walk *walk) |
7dc74be03 memcg: add interf... |
5107 |
{ |
4ffef5fef memcg: move charg... |
5108 5109 5110 5111 |
int ret = 0; struct vm_area_struct *vma = walk->private; pte_t *pte; spinlock_t *ptl; |
033193275 pagewalk: only sp... |
5112 |
split_huge_page_pmd(walk->mm, pmd); |
4ffef5fef memcg: move charg... |
5113 5114 5115 5116 5117 5118 5119 5120 |
retry: pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl); for (; addr != end; addr += PAGE_SIZE) { pte_t ptent = *(pte++); union mc_target target; int type; struct page *page; struct page_cgroup *pc; |
024914477 memcg: move charg... |
5121 |
swp_entry_t ent; |
4ffef5fef memcg: move charg... |
5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 |
if (!mc.precharge) break; type = is_target_pte_for_mc(vma, addr, ptent, &target); switch (type) { case MC_TARGET_PAGE: page = target.page; if (isolate_lru_page(page)) goto put; pc = lookup_page_cgroup(page); |
7ec99d621 memcg: unify char... |
5133 5134 |
if (!mem_cgroup_move_account(page, 1, pc, mc.from, mc.to, false)) { |
4ffef5fef memcg: move charg... |
5135 |
mc.precharge--; |
854ffa8d1 memcg: improve pe... |
5136 5137 |
/* we uncharge from mc.from later. */ mc.moved_charge++; |
4ffef5fef memcg: move charg... |
5138 5139 5140 5141 5142 |
} putback_lru_page(page); put: /* is_target_pte_for_mc() gets the page */ put_page(page); break; |
024914477 memcg: move charg... |
5143 5144 |
case MC_TARGET_SWAP: ent = target.ent; |
483c30b51 memcg: improve pe... |
5145 5146 |
if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to, false)) { |
024914477 memcg: move charg... |
5147 |
mc.precharge--; |
483c30b51 memcg: improve pe... |
5148 5149 5150 |
/* we fixup refcnts and charges later. */ mc.moved_swap++; } |
024914477 memcg: move charg... |
5151 |
break; |
4ffef5fef memcg: move charg... |
5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 |
default: break; } } pte_unmap_unlock(pte - 1, ptl); cond_resched(); if (addr != end) { /* * We have consumed all precharges we got in can_attach(). * We try charge one by one, but don't do any additional * charges to mc.to if we have failed in charge once in attach() * phase. */ |
854ffa8d1 memcg: improve pe... |
5166 |
ret = mem_cgroup_do_precharge(1); |
4ffef5fef memcg: move charg... |
5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 |
if (!ret) goto retry; } return ret; } static void mem_cgroup_move_charge(struct mm_struct *mm) { struct vm_area_struct *vma; lru_add_drain_all(); |
dfe076b09 memcg: fix deadlo... |
5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 |
retry: if (unlikely(!down_read_trylock(&mm->mmap_sem))) { /* * Someone who are holding the mmap_sem might be waiting in * waitq. So we cancel all extra charges, wake up all waiters, * and retry. Because we cancel precharges, we might not be able * to move enough charges, but moving charge is a best-effort * feature anyway, so it wouldn't be a big problem. */ __mem_cgroup_clear_mc(); cond_resched(); goto retry; } |
4ffef5fef memcg: move charg... |
5192 5193 5194 5195 5196 5197 5198 5199 5200 |
for (vma = mm->mmap; vma; vma = vma->vm_next) { int ret; struct mm_walk mem_cgroup_move_charge_walk = { .pmd_entry = mem_cgroup_move_charge_pte_range, .mm = mm, .private = vma, }; if (is_vm_hugetlb_page(vma)) continue; |
4ffef5fef memcg: move charg... |
5201 5202 5203 5204 5205 5206 5207 5208 5209 |
ret = walk_page_range(vma->vm_start, vma->vm_end, &mem_cgroup_move_charge_walk); if (ret) /* * means we have consumed all precharges and failed in * doing additional charge. Just abandon here. */ break; } |
dfe076b09 memcg: fix deadlo... |
5210 |
up_read(&mm->mmap_sem); |
7dc74be03 memcg: add interf... |
5211 |
} |
67e465a77 Memory controller... |
5212 5213 5214 |
static void mem_cgroup_move_task(struct cgroup_subsys *ss, struct cgroup *cont, struct cgroup *old_cont, |
f780bdb7c cgroups: add per-... |
5215 |
struct task_struct *p) |
67e465a77 Memory controller... |
5216 |
{ |
a433658c3 vmscan,memcg: mem... |
5217 |
struct mm_struct *mm = get_task_mm(p); |
dfe076b09 memcg: fix deadlo... |
5218 |
|
dfe076b09 memcg: fix deadlo... |
5219 |
if (mm) { |
a433658c3 vmscan,memcg: mem... |
5220 5221 5222 |
if (mc.to) mem_cgroup_move_charge(mm); put_swap_token(mm); |
dfe076b09 memcg: fix deadlo... |
5223 5224 |
mmput(mm); } |
a433658c3 vmscan,memcg: mem... |
5225 5226 |
if (mc.to) mem_cgroup_clear_mc(); |
67e465a77 Memory controller... |
5227 |
} |
5cfb80a73 memcg: disable mo... |
5228 5229 5230 |
#else /* !CONFIG_MMU */ static int mem_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgroup, |
f780bdb7c cgroups: add per-... |
5231 |
struct task_struct *p) |
5cfb80a73 memcg: disable mo... |
5232 5233 5234 5235 5236 |
{ return 0; } static void mem_cgroup_cancel_attach(struct cgroup_subsys *ss, struct cgroup *cgroup, |
f780bdb7c cgroups: add per-... |
5237 |
struct task_struct *p) |
5cfb80a73 memcg: disable mo... |
5238 5239 5240 5241 5242 |
{ } static void mem_cgroup_move_task(struct cgroup_subsys *ss, struct cgroup *cont, struct cgroup *old_cont, |
f780bdb7c cgroups: add per-... |
5243 |
struct task_struct *p) |
5cfb80a73 memcg: disable mo... |
5244 5245 5246 |
{ } #endif |
67e465a77 Memory controller... |
5247 |
|
8cdea7c05 Memory controller... |
5248 5249 5250 5251 |
struct cgroup_subsys mem_cgroup_subsys = { .name = "memory", .subsys_id = mem_cgroup_subsys_id, .create = mem_cgroup_create, |
df878fb04 memory cgroup enh... |
5252 |
.pre_destroy = mem_cgroup_pre_destroy, |
8cdea7c05 Memory controller... |
5253 5254 |
.destroy = mem_cgroup_destroy, .populate = mem_cgroup_populate, |
7dc74be03 memcg: add interf... |
5255 5256 |
.can_attach = mem_cgroup_can_attach, .cancel_attach = mem_cgroup_cancel_attach, |
67e465a77 Memory controller... |
5257 |
.attach = mem_cgroup_move_task, |
6d12e2d8d per-zone and recl... |
5258 |
.early_init = 0, |
04046e1a0 memcg: use CSS ID |
5259 |
.use_id = 1, |
8cdea7c05 Memory controller... |
5260 |
}; |
c077719be memcg: mem+swap c... |
5261 5262 |
#ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP |
a42c390cf cgroups: make swa... |
5263 5264 5265 |
static int __init enable_swap_account(char *s) { /* consider enabled if no parameter or 1 is given */ |
a2c8990ae memsw: remove nos... |
5266 |
if (!strcmp(s, "1")) |
a42c390cf cgroups: make swa... |
5267 |
really_do_swap_account = 1; |
a2c8990ae memsw: remove nos... |
5268 |
else if (!strcmp(s, "0")) |
a42c390cf cgroups: make swa... |
5269 5270 5271 |
really_do_swap_account = 0; return 1; } |
a2c8990ae memsw: remove nos... |
5272 |
__setup("swapaccount=", enable_swap_account); |
c077719be memcg: mem+swap c... |
5273 |
|
c077719be memcg: mem+swap c... |
5274 |
#endif |