Commit | Line | Data |
---|---|---|
8cdea7c0 BS |
1 | /* memcontrol.c - Memory Controller |
2 | * | |
3 | * Copyright IBM Corporation, 2007 | |
4 | * Author Balbir Singh <balbir@linux.vnet.ibm.com> | |
5 | * | |
78fb7466 PE |
6 | * Copyright 2007 OpenVZ SWsoft Inc |
7 | * Author: Pavel Emelianov <xemul@openvz.org> | |
8 | * | |
8cdea7c0 BS |
9 | * This program is free software; you can redistribute it and/or modify |
10 | * it under the terms of the GNU General Public License as published by | |
11 | * the Free Software Foundation; either version 2 of the License, or | |
12 | * (at your option) any later version. | |
13 | * | |
14 | * This program is distributed in the hope that it will be useful, | |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | * GNU General Public License for more details. | |
18 | */ | |
19 | ||
20 | #include <linux/res_counter.h> | |
21 | #include <linux/memcontrol.h> | |
22 | #include <linux/cgroup.h> | |
78fb7466 | 23 | #include <linux/mm.h> |
d13d1443 | 24 | #include <linux/pagemap.h> |
d52aa412 | 25 | #include <linux/smp.h> |
8a9f3ccd | 26 | #include <linux/page-flags.h> |
66e1707b | 27 | #include <linux/backing-dev.h> |
8a9f3ccd BS |
28 | #include <linux/bit_spinlock.h> |
29 | #include <linux/rcupdate.h> | |
e222432b | 30 | #include <linux/limits.h> |
8c7c6e34 | 31 | #include <linux/mutex.h> |
f64c3f54 | 32 | #include <linux/rbtree.h> |
b6ac57d5 | 33 | #include <linux/slab.h> |
66e1707b BS |
34 | #include <linux/swap.h> |
35 | #include <linux/spinlock.h> | |
36 | #include <linux/fs.h> | |
d2ceb9b7 | 37 | #include <linux/seq_file.h> |
33327948 | 38 | #include <linux/vmalloc.h> |
b69408e8 | 39 | #include <linux/mm_inline.h> |
52d4b9ac | 40 | #include <linux/page_cgroup.h> |
cdec2e42 | 41 | #include <linux/cpu.h> |
08e552c6 | 42 | #include "internal.h" |
8cdea7c0 | 43 | |
8697d331 BS |
44 | #include <asm/uaccess.h> |
45 | ||
a181b0e8 | 46 | struct cgroup_subsys mem_cgroup_subsys __read_mostly; |
a181b0e8 | 47 | #define MEM_CGROUP_RECLAIM_RETRIES 5 |
4b3bde4c | 48 | struct mem_cgroup *root_mem_cgroup __read_mostly; |
8cdea7c0 | 49 | |
c077719b | 50 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP |
338c8431 | 51 | /* Turned on only when memory cgroup is enabled && really_do_swap_account = 1 */ |
c077719b KH |
52 | int do_swap_account __read_mostly; |
53 | static int really_do_swap_account __initdata = 1; /* for remember boot option*/ | |
54 | #else | |
55 | #define do_swap_account (0) | |
56 | #endif | |
57 | ||
f64c3f54 | 58 | #define SOFTLIMIT_EVENTS_THRESH (1000) |
c077719b | 59 | |
d52aa412 KH |
60 | /* |
61 | * Statistics for memory cgroup. | |
62 | */ | |
63 | enum mem_cgroup_stat_index { | |
64 | /* | |
65 | * For MEM_CONTAINER_TYPE_ALL, usage = pagecache + rss. | |
66 | */ | |
67 | MEM_CGROUP_STAT_CACHE, /* # of pages charged as cache */ | |
d69b042f | 68 | MEM_CGROUP_STAT_RSS, /* # of pages charged as anon rss */ |
d8046582 | 69 | MEM_CGROUP_STAT_FILE_MAPPED, /* # of pages charged as file rss */ |
55e462b0 BR |
70 | MEM_CGROUP_STAT_PGPGIN_COUNT, /* # of pages paged in */ |
71 | MEM_CGROUP_STAT_PGPGOUT_COUNT, /* # of pages paged out */ | |
f64c3f54 | 72 | MEM_CGROUP_STAT_EVENTS, /* sum of pagein + pageout for internal use */ |
0c3e73e8 | 73 | MEM_CGROUP_STAT_SWAPOUT, /* # of pages, swapped out */ |
d52aa412 KH |
74 | |
75 | MEM_CGROUP_STAT_NSTATS, | |
76 | }; | |
77 | ||
78 | struct mem_cgroup_stat_cpu { | |
79 | s64 count[MEM_CGROUP_STAT_NSTATS]; | |
80 | } ____cacheline_aligned_in_smp; | |
81 | ||
82 | struct mem_cgroup_stat { | |
c8dad2bb | 83 | struct mem_cgroup_stat_cpu cpustat[0]; |
d52aa412 KH |
84 | }; |
85 | ||
f64c3f54 BS |
86 | static inline void |
87 | __mem_cgroup_stat_reset_safe(struct mem_cgroup_stat_cpu *stat, | |
88 | enum mem_cgroup_stat_index idx) | |
89 | { | |
90 | stat->count[idx] = 0; | |
91 | } | |
92 | ||
93 | static inline s64 | |
94 | __mem_cgroup_stat_read_local(struct mem_cgroup_stat_cpu *stat, | |
95 | enum mem_cgroup_stat_index idx) | |
96 | { | |
97 | return stat->count[idx]; | |
98 | } | |
99 | ||
d52aa412 KH |
100 | /* |
101 | * For accounting under irq disable, no need for increment preempt count. | |
102 | */ | |
addb9efe | 103 | static inline void __mem_cgroup_stat_add_safe(struct mem_cgroup_stat_cpu *stat, |
d52aa412 KH |
104 | enum mem_cgroup_stat_index idx, int val) |
105 | { | |
addb9efe | 106 | stat->count[idx] += val; |
d52aa412 KH |
107 | } |
108 | ||
109 | static s64 mem_cgroup_read_stat(struct mem_cgroup_stat *stat, | |
110 | enum mem_cgroup_stat_index idx) | |
111 | { | |
112 | int cpu; | |
113 | s64 ret = 0; | |
114 | for_each_possible_cpu(cpu) | |
115 | ret += stat->cpustat[cpu].count[idx]; | |
116 | return ret; | |
117 | } | |
118 | ||
04046e1a KH |
119 | static s64 mem_cgroup_local_usage(struct mem_cgroup_stat *stat) |
120 | { | |
121 | s64 ret; | |
122 | ||
123 | ret = mem_cgroup_read_stat(stat, MEM_CGROUP_STAT_CACHE); | |
124 | ret += mem_cgroup_read_stat(stat, MEM_CGROUP_STAT_RSS); | |
125 | return ret; | |
126 | } | |
127 | ||
6d12e2d8 KH |
128 | /* |
129 | * per-zone information in memory controller. | |
130 | */ | |
6d12e2d8 | 131 | struct mem_cgroup_per_zone { |
072c56c1 KH |
132 | /* |
133 | * spin_lock to protect the per cgroup LRU | |
134 | */ | |
b69408e8 CL |
135 | struct list_head lists[NR_LRU_LISTS]; |
136 | unsigned long count[NR_LRU_LISTS]; | |
3e2f41f1 KM |
137 | |
138 | struct zone_reclaim_stat reclaim_stat; | |
f64c3f54 BS |
139 | struct rb_node tree_node; /* RB tree node */ |
140 | unsigned long long usage_in_excess;/* Set to the value by which */ | |
141 | /* the soft limit is exceeded*/ | |
142 | bool on_tree; | |
4e416953 BS |
143 | struct mem_cgroup *mem; /* Back pointer, we cannot */ |
144 | /* use container_of */ | |
6d12e2d8 KH |
145 | }; |
146 | /* Macro for accessing counter */ | |
147 | #define MEM_CGROUP_ZSTAT(mz, idx) ((mz)->count[(idx)]) | |
148 | ||
149 | struct mem_cgroup_per_node { | |
150 | struct mem_cgroup_per_zone zoneinfo[MAX_NR_ZONES]; | |
151 | }; | |
152 | ||
153 | struct mem_cgroup_lru_info { | |
154 | struct mem_cgroup_per_node *nodeinfo[MAX_NUMNODES]; | |
155 | }; | |
156 | ||
f64c3f54 BS |
157 | /* |
158 | * Cgroups above their limits are maintained in a RB-Tree, independent of | |
159 | * their hierarchy representation | |
160 | */ | |
161 | ||
162 | struct mem_cgroup_tree_per_zone { | |
163 | struct rb_root rb_root; | |
164 | spinlock_t lock; | |
165 | }; | |
166 | ||
167 | struct mem_cgroup_tree_per_node { | |
168 | struct mem_cgroup_tree_per_zone rb_tree_per_zone[MAX_NR_ZONES]; | |
169 | }; | |
170 | ||
171 | struct mem_cgroup_tree { | |
172 | struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES]; | |
173 | }; | |
174 | ||
175 | static struct mem_cgroup_tree soft_limit_tree __read_mostly; | |
176 | ||
8cdea7c0 BS |
177 | /* |
178 | * The memory controller data structure. The memory controller controls both | |
179 | * page cache and RSS per cgroup. We would eventually like to provide | |
180 | * statistics based on the statistics developed by Rik Van Riel for clock-pro, | |
181 | * to help the administrator determine what knobs to tune. | |
182 | * | |
183 | * TODO: Add a water mark for the memory controller. Reclaim will begin when | |
8a9f3ccd BS |
184 | * we hit the water mark. May be even add a low water mark, such that |
185 | * no reclaim occurs from a cgroup at it's low water mark, this is | |
186 | * a feature that will be implemented much later in the future. | |
8cdea7c0 BS |
187 | */ |
188 | struct mem_cgroup { | |
189 | struct cgroup_subsys_state css; | |
190 | /* | |
191 | * the counter to account for memory usage | |
192 | */ | |
193 | struct res_counter res; | |
8c7c6e34 KH |
194 | /* |
195 | * the counter to account for mem+swap usage. | |
196 | */ | |
197 | struct res_counter memsw; | |
78fb7466 PE |
198 | /* |
199 | * Per cgroup active and inactive list, similar to the | |
200 | * per zone LRU lists. | |
78fb7466 | 201 | */ |
6d12e2d8 | 202 | struct mem_cgroup_lru_info info; |
072c56c1 | 203 | |
2733c06a KM |
204 | /* |
205 | protect against reclaim related member. | |
206 | */ | |
207 | spinlock_t reclaim_param_lock; | |
208 | ||
6c48a1d0 | 209 | int prev_priority; /* for recording reclaim priority */ |
6d61ef40 BS |
210 | |
211 | /* | |
af901ca1 | 212 | * While reclaiming in a hierarchy, we cache the last child we |
04046e1a | 213 | * reclaimed from. |
6d61ef40 | 214 | */ |
04046e1a | 215 | int last_scanned_child; |
18f59ea7 BS |
216 | /* |
217 | * Should the accounting and control be hierarchical, per subtree? | |
218 | */ | |
219 | bool use_hierarchy; | |
a636b327 | 220 | unsigned long last_oom_jiffies; |
8c7c6e34 | 221 | atomic_t refcnt; |
14797e23 | 222 | |
a7885eb8 KM |
223 | unsigned int swappiness; |
224 | ||
22a668d7 KH |
225 | /* set when res.limit == memsw.limit */ |
226 | bool memsw_is_minimum; | |
227 | ||
d52aa412 | 228 | /* |
c8dad2bb | 229 | * statistics. This must be placed at the end of memcg. |
d52aa412 KH |
230 | */ |
231 | struct mem_cgroup_stat stat; | |
8cdea7c0 BS |
232 | }; |
233 | ||
4e416953 BS |
234 | /* |
235 | * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft | |
236 | * limit reclaim to prevent infinite loops, if they ever occur. | |
237 | */ | |
238 | #define MEM_CGROUP_MAX_RECLAIM_LOOPS (100) | |
239 | #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS (2) | |
240 | ||
217bc319 KH |
241 | enum charge_type { |
242 | MEM_CGROUP_CHARGE_TYPE_CACHE = 0, | |
243 | MEM_CGROUP_CHARGE_TYPE_MAPPED, | |
4f98a2fe | 244 | MEM_CGROUP_CHARGE_TYPE_SHMEM, /* used by page migration of shmem */ |
c05555b5 | 245 | MEM_CGROUP_CHARGE_TYPE_FORCE, /* used by force_empty */ |
d13d1443 | 246 | MEM_CGROUP_CHARGE_TYPE_SWAPOUT, /* for accounting swapcache */ |
8a9478ca | 247 | MEM_CGROUP_CHARGE_TYPE_DROP, /* a page was unused swap cache */ |
c05555b5 KH |
248 | NR_CHARGE_TYPE, |
249 | }; | |
250 | ||
52d4b9ac KH |
251 | /* only for here (for easy reading.) */ |
252 | #define PCGF_CACHE (1UL << PCG_CACHE) | |
253 | #define PCGF_USED (1UL << PCG_USED) | |
52d4b9ac | 254 | #define PCGF_LOCK (1UL << PCG_LOCK) |
4b3bde4c BS |
255 | /* Not used, but added here for completeness */ |
256 | #define PCGF_ACCT (1UL << PCG_ACCT) | |
217bc319 | 257 | |
8c7c6e34 KH |
258 | /* for encoding cft->private value on file */ |
259 | #define _MEM (0) | |
260 | #define _MEMSWAP (1) | |
261 | #define MEMFILE_PRIVATE(x, val) (((x) << 16) | (val)) | |
262 | #define MEMFILE_TYPE(val) (((val) >> 16) & 0xffff) | |
263 | #define MEMFILE_ATTR(val) ((val) & 0xffff) | |
264 | ||
75822b44 BS |
265 | /* |
266 | * Reclaim flags for mem_cgroup_hierarchical_reclaim | |
267 | */ | |
268 | #define MEM_CGROUP_RECLAIM_NOSWAP_BIT 0x0 | |
269 | #define MEM_CGROUP_RECLAIM_NOSWAP (1 << MEM_CGROUP_RECLAIM_NOSWAP_BIT) | |
270 | #define MEM_CGROUP_RECLAIM_SHRINK_BIT 0x1 | |
271 | #define MEM_CGROUP_RECLAIM_SHRINK (1 << MEM_CGROUP_RECLAIM_SHRINK_BIT) | |
4e416953 BS |
272 | #define MEM_CGROUP_RECLAIM_SOFT_BIT 0x2 |
273 | #define MEM_CGROUP_RECLAIM_SOFT (1 << MEM_CGROUP_RECLAIM_SOFT_BIT) | |
75822b44 | 274 | |
8c7c6e34 KH |
275 | static void mem_cgroup_get(struct mem_cgroup *mem); |
276 | static void mem_cgroup_put(struct mem_cgroup *mem); | |
7bcc1bb1 | 277 | static struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *mem); |
cdec2e42 | 278 | static void drain_all_stock_async(void); |
8c7c6e34 | 279 | |
f64c3f54 BS |
280 | static struct mem_cgroup_per_zone * |
281 | mem_cgroup_zoneinfo(struct mem_cgroup *mem, int nid, int zid) | |
282 | { | |
283 | return &mem->info.nodeinfo[nid]->zoneinfo[zid]; | |
284 | } | |
285 | ||
286 | static struct mem_cgroup_per_zone * | |
287 | page_cgroup_zoneinfo(struct page_cgroup *pc) | |
288 | { | |
289 | struct mem_cgroup *mem = pc->mem_cgroup; | |
290 | int nid = page_cgroup_nid(pc); | |
291 | int zid = page_cgroup_zid(pc); | |
292 | ||
293 | if (!mem) | |
294 | return NULL; | |
295 | ||
296 | return mem_cgroup_zoneinfo(mem, nid, zid); | |
297 | } | |
298 | ||
299 | static struct mem_cgroup_tree_per_zone * | |
300 | soft_limit_tree_node_zone(int nid, int zid) | |
301 | { | |
302 | return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid]; | |
303 | } | |
304 | ||
305 | static struct mem_cgroup_tree_per_zone * | |
306 | soft_limit_tree_from_page(struct page *page) | |
307 | { | |
308 | int nid = page_to_nid(page); | |
309 | int zid = page_zonenum(page); | |
310 | ||
311 | return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid]; | |
312 | } | |
313 | ||
314 | static void | |
4e416953 | 315 | __mem_cgroup_insert_exceeded(struct mem_cgroup *mem, |
f64c3f54 | 316 | struct mem_cgroup_per_zone *mz, |
ef8745c1 KH |
317 | struct mem_cgroup_tree_per_zone *mctz, |
318 | unsigned long long new_usage_in_excess) | |
f64c3f54 BS |
319 | { |
320 | struct rb_node **p = &mctz->rb_root.rb_node; | |
321 | struct rb_node *parent = NULL; | |
322 | struct mem_cgroup_per_zone *mz_node; | |
323 | ||
324 | if (mz->on_tree) | |
325 | return; | |
326 | ||
ef8745c1 KH |
327 | mz->usage_in_excess = new_usage_in_excess; |
328 | if (!mz->usage_in_excess) | |
329 | return; | |
f64c3f54 BS |
330 | while (*p) { |
331 | parent = *p; | |
332 | mz_node = rb_entry(parent, struct mem_cgroup_per_zone, | |
333 | tree_node); | |
334 | if (mz->usage_in_excess < mz_node->usage_in_excess) | |
335 | p = &(*p)->rb_left; | |
336 | /* | |
337 | * We can't avoid mem cgroups that are over their soft | |
338 | * limit by the same amount | |
339 | */ | |
340 | else if (mz->usage_in_excess >= mz_node->usage_in_excess) | |
341 | p = &(*p)->rb_right; | |
342 | } | |
343 | rb_link_node(&mz->tree_node, parent, p); | |
344 | rb_insert_color(&mz->tree_node, &mctz->rb_root); | |
345 | mz->on_tree = true; | |
4e416953 BS |
346 | } |
347 | ||
348 | static void | |
349 | __mem_cgroup_remove_exceeded(struct mem_cgroup *mem, | |
350 | struct mem_cgroup_per_zone *mz, | |
351 | struct mem_cgroup_tree_per_zone *mctz) | |
352 | { | |
353 | if (!mz->on_tree) | |
354 | return; | |
355 | rb_erase(&mz->tree_node, &mctz->rb_root); | |
356 | mz->on_tree = false; | |
357 | } | |
358 | ||
f64c3f54 BS |
359 | static void |
360 | mem_cgroup_remove_exceeded(struct mem_cgroup *mem, | |
361 | struct mem_cgroup_per_zone *mz, | |
362 | struct mem_cgroup_tree_per_zone *mctz) | |
363 | { | |
364 | spin_lock(&mctz->lock); | |
4e416953 | 365 | __mem_cgroup_remove_exceeded(mem, mz, mctz); |
f64c3f54 BS |
366 | spin_unlock(&mctz->lock); |
367 | } | |
368 | ||
369 | static bool mem_cgroup_soft_limit_check(struct mem_cgroup *mem) | |
370 | { | |
371 | bool ret = false; | |
372 | int cpu; | |
373 | s64 val; | |
374 | struct mem_cgroup_stat_cpu *cpustat; | |
375 | ||
376 | cpu = get_cpu(); | |
377 | cpustat = &mem->stat.cpustat[cpu]; | |
378 | val = __mem_cgroup_stat_read_local(cpustat, MEM_CGROUP_STAT_EVENTS); | |
379 | if (unlikely(val > SOFTLIMIT_EVENTS_THRESH)) { | |
380 | __mem_cgroup_stat_reset_safe(cpustat, MEM_CGROUP_STAT_EVENTS); | |
381 | ret = true; | |
382 | } | |
383 | put_cpu(); | |
384 | return ret; | |
385 | } | |
386 | ||
387 | static void mem_cgroup_update_tree(struct mem_cgroup *mem, struct page *page) | |
388 | { | |
ef8745c1 | 389 | unsigned long long excess; |
f64c3f54 BS |
390 | struct mem_cgroup_per_zone *mz; |
391 | struct mem_cgroup_tree_per_zone *mctz; | |
4e649152 KH |
392 | int nid = page_to_nid(page); |
393 | int zid = page_zonenum(page); | |
f64c3f54 BS |
394 | mctz = soft_limit_tree_from_page(page); |
395 | ||
396 | /* | |
4e649152 KH |
397 | * Necessary to update all ancestors when hierarchy is used. |
398 | * because their event counter is not touched. | |
f64c3f54 | 399 | */ |
4e649152 KH |
400 | for (; mem; mem = parent_mem_cgroup(mem)) { |
401 | mz = mem_cgroup_zoneinfo(mem, nid, zid); | |
ef8745c1 | 402 | excess = res_counter_soft_limit_excess(&mem->res); |
4e649152 KH |
403 | /* |
404 | * We have to update the tree if mz is on RB-tree or | |
405 | * mem is over its softlimit. | |
406 | */ | |
ef8745c1 | 407 | if (excess || mz->on_tree) { |
4e649152 KH |
408 | spin_lock(&mctz->lock); |
409 | /* if on-tree, remove it */ | |
410 | if (mz->on_tree) | |
411 | __mem_cgroup_remove_exceeded(mem, mz, mctz); | |
412 | /* | |
ef8745c1 KH |
413 | * Insert again. mz->usage_in_excess will be updated. |
414 | * If excess is 0, no tree ops. | |
4e649152 | 415 | */ |
ef8745c1 | 416 | __mem_cgroup_insert_exceeded(mem, mz, mctz, excess); |
4e649152 KH |
417 | spin_unlock(&mctz->lock); |
418 | } | |
f64c3f54 BS |
419 | } |
420 | } | |
421 | ||
422 | static void mem_cgroup_remove_from_trees(struct mem_cgroup *mem) | |
423 | { | |
424 | int node, zone; | |
425 | struct mem_cgroup_per_zone *mz; | |
426 | struct mem_cgroup_tree_per_zone *mctz; | |
427 | ||
428 | for_each_node_state(node, N_POSSIBLE) { | |
429 | for (zone = 0; zone < MAX_NR_ZONES; zone++) { | |
430 | mz = mem_cgroup_zoneinfo(mem, node, zone); | |
431 | mctz = soft_limit_tree_node_zone(node, zone); | |
432 | mem_cgroup_remove_exceeded(mem, mz, mctz); | |
433 | } | |
434 | } | |
435 | } | |
436 | ||
4e416953 BS |
437 | static inline unsigned long mem_cgroup_get_excess(struct mem_cgroup *mem) |
438 | { | |
439 | return res_counter_soft_limit_excess(&mem->res) >> PAGE_SHIFT; | |
440 | } | |
441 | ||
442 | static struct mem_cgroup_per_zone * | |
443 | __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz) | |
444 | { | |
445 | struct rb_node *rightmost = NULL; | |
26251eaf | 446 | struct mem_cgroup_per_zone *mz; |
4e416953 BS |
447 | |
448 | retry: | |
26251eaf | 449 | mz = NULL; |
4e416953 BS |
450 | rightmost = rb_last(&mctz->rb_root); |
451 | if (!rightmost) | |
452 | goto done; /* Nothing to reclaim from */ | |
453 | ||
454 | mz = rb_entry(rightmost, struct mem_cgroup_per_zone, tree_node); | |
455 | /* | |
456 | * Remove the node now but someone else can add it back, | |
457 | * we will to add it back at the end of reclaim to its correct | |
458 | * position in the tree. | |
459 | */ | |
460 | __mem_cgroup_remove_exceeded(mz->mem, mz, mctz); | |
461 | if (!res_counter_soft_limit_excess(&mz->mem->res) || | |
462 | !css_tryget(&mz->mem->css)) | |
463 | goto retry; | |
464 | done: | |
465 | return mz; | |
466 | } | |
467 | ||
468 | static struct mem_cgroup_per_zone * | |
469 | mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz) | |
470 | { | |
471 | struct mem_cgroup_per_zone *mz; | |
472 | ||
473 | spin_lock(&mctz->lock); | |
474 | mz = __mem_cgroup_largest_soft_limit_node(mctz); | |
475 | spin_unlock(&mctz->lock); | |
476 | return mz; | |
477 | } | |
478 | ||
0c3e73e8 BS |
479 | static void mem_cgroup_swap_statistics(struct mem_cgroup *mem, |
480 | bool charge) | |
481 | { | |
482 | int val = (charge) ? 1 : -1; | |
483 | struct mem_cgroup_stat *stat = &mem->stat; | |
484 | struct mem_cgroup_stat_cpu *cpustat; | |
485 | int cpu = get_cpu(); | |
486 | ||
487 | cpustat = &stat->cpustat[cpu]; | |
488 | __mem_cgroup_stat_add_safe(cpustat, MEM_CGROUP_STAT_SWAPOUT, val); | |
489 | put_cpu(); | |
490 | } | |
491 | ||
c05555b5 KH |
492 | static void mem_cgroup_charge_statistics(struct mem_cgroup *mem, |
493 | struct page_cgroup *pc, | |
494 | bool charge) | |
d52aa412 | 495 | { |
0c3e73e8 | 496 | int val = (charge) ? 1 : -1; |
d52aa412 | 497 | struct mem_cgroup_stat *stat = &mem->stat; |
addb9efe | 498 | struct mem_cgroup_stat_cpu *cpustat; |
08e552c6 | 499 | int cpu = get_cpu(); |
d52aa412 | 500 | |
08e552c6 | 501 | cpustat = &stat->cpustat[cpu]; |
c05555b5 | 502 | if (PageCgroupCache(pc)) |
addb9efe | 503 | __mem_cgroup_stat_add_safe(cpustat, MEM_CGROUP_STAT_CACHE, val); |
d52aa412 | 504 | else |
addb9efe | 505 | __mem_cgroup_stat_add_safe(cpustat, MEM_CGROUP_STAT_RSS, val); |
55e462b0 BR |
506 | |
507 | if (charge) | |
addb9efe | 508 | __mem_cgroup_stat_add_safe(cpustat, |
55e462b0 BR |
509 | MEM_CGROUP_STAT_PGPGIN_COUNT, 1); |
510 | else | |
addb9efe | 511 | __mem_cgroup_stat_add_safe(cpustat, |
55e462b0 | 512 | MEM_CGROUP_STAT_PGPGOUT_COUNT, 1); |
f64c3f54 | 513 | __mem_cgroup_stat_add_safe(cpustat, MEM_CGROUP_STAT_EVENTS, 1); |
08e552c6 | 514 | put_cpu(); |
6d12e2d8 KH |
515 | } |
516 | ||
14067bb3 | 517 | static unsigned long mem_cgroup_get_local_zonestat(struct mem_cgroup *mem, |
b69408e8 | 518 | enum lru_list idx) |
6d12e2d8 KH |
519 | { |
520 | int nid, zid; | |
521 | struct mem_cgroup_per_zone *mz; | |
522 | u64 total = 0; | |
523 | ||
524 | for_each_online_node(nid) | |
525 | for (zid = 0; zid < MAX_NR_ZONES; zid++) { | |
526 | mz = mem_cgroup_zoneinfo(mem, nid, zid); | |
527 | total += MEM_CGROUP_ZSTAT(mz, idx); | |
528 | } | |
529 | return total; | |
d52aa412 KH |
530 | } |
531 | ||
d5b69e38 | 532 | static struct mem_cgroup *mem_cgroup_from_cont(struct cgroup *cont) |
8cdea7c0 BS |
533 | { |
534 | return container_of(cgroup_subsys_state(cont, | |
535 | mem_cgroup_subsys_id), struct mem_cgroup, | |
536 | css); | |
537 | } | |
538 | ||
cf475ad2 | 539 | struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p) |
78fb7466 | 540 | { |
31a78f23 BS |
541 | /* |
542 | * mm_update_next_owner() may clear mm->owner to NULL | |
543 | * if it races with swapoff, page migration, etc. | |
544 | * So this can be called with p == NULL. | |
545 | */ | |
546 | if (unlikely(!p)) | |
547 | return NULL; | |
548 | ||
78fb7466 PE |
549 | return container_of(task_subsys_state(p, mem_cgroup_subsys_id), |
550 | struct mem_cgroup, css); | |
551 | } | |
552 | ||
54595fe2 KH |
553 | static struct mem_cgroup *try_get_mem_cgroup_from_mm(struct mm_struct *mm) |
554 | { | |
555 | struct mem_cgroup *mem = NULL; | |
0b7f569e KH |
556 | |
557 | if (!mm) | |
558 | return NULL; | |
54595fe2 KH |
559 | /* |
560 | * Because we have no locks, mm->owner's may be being moved to other | |
561 | * cgroup. We use css_tryget() here even if this looks | |
562 | * pessimistic (rather than adding locks here). | |
563 | */ | |
564 | rcu_read_lock(); | |
565 | do { | |
566 | mem = mem_cgroup_from_task(rcu_dereference(mm->owner)); | |
567 | if (unlikely(!mem)) | |
568 | break; | |
569 | } while (!css_tryget(&mem->css)); | |
570 | rcu_read_unlock(); | |
571 | return mem; | |
572 | } | |
573 | ||
14067bb3 KH |
574 | /* |
575 | * Call callback function against all cgroup under hierarchy tree. | |
576 | */ | |
577 | static int mem_cgroup_walk_tree(struct mem_cgroup *root, void *data, | |
578 | int (*func)(struct mem_cgroup *, void *)) | |
579 | { | |
580 | int found, ret, nextid; | |
581 | struct cgroup_subsys_state *css; | |
582 | struct mem_cgroup *mem; | |
583 | ||
584 | if (!root->use_hierarchy) | |
585 | return (*func)(root, data); | |
586 | ||
587 | nextid = 1; | |
588 | do { | |
589 | ret = 0; | |
590 | mem = NULL; | |
591 | ||
592 | rcu_read_lock(); | |
593 | css = css_get_next(&mem_cgroup_subsys, nextid, &root->css, | |
594 | &found); | |
595 | if (css && css_tryget(css)) | |
596 | mem = container_of(css, struct mem_cgroup, css); | |
597 | rcu_read_unlock(); | |
598 | ||
599 | if (mem) { | |
600 | ret = (*func)(mem, data); | |
601 | css_put(&mem->css); | |
602 | } | |
603 | nextid = found + 1; | |
604 | } while (!ret && css); | |
605 | ||
606 | return ret; | |
607 | } | |
608 | ||
4b3bde4c BS |
609 | static inline bool mem_cgroup_is_root(struct mem_cgroup *mem) |
610 | { | |
611 | return (mem == root_mem_cgroup); | |
612 | } | |
613 | ||
08e552c6 KH |
614 | /* |
615 | * Following LRU functions are allowed to be used without PCG_LOCK. | |
616 | * Operations are called by routine of global LRU independently from memcg. | |
617 | * What we have to take care of here is validness of pc->mem_cgroup. | |
618 | * | |
619 | * Changes to pc->mem_cgroup happens when | |
620 | * 1. charge | |
621 | * 2. moving account | |
622 | * In typical case, "charge" is done before add-to-lru. Exception is SwapCache. | |
623 | * It is added to LRU before charge. | |
624 | * If PCG_USED bit is not set, page_cgroup is not added to this private LRU. | |
625 | * When moving account, the page is not on LRU. It's isolated. | |
626 | */ | |
4f98a2fe | 627 | |
08e552c6 KH |
628 | void mem_cgroup_del_lru_list(struct page *page, enum lru_list lru) |
629 | { | |
630 | struct page_cgroup *pc; | |
08e552c6 | 631 | struct mem_cgroup_per_zone *mz; |
6d12e2d8 | 632 | |
f8d66542 | 633 | if (mem_cgroup_disabled()) |
08e552c6 KH |
634 | return; |
635 | pc = lookup_page_cgroup(page); | |
636 | /* can happen while we handle swapcache. */ | |
4b3bde4c | 637 | if (!TestClearPageCgroupAcctLRU(pc)) |
08e552c6 | 638 | return; |
4b3bde4c | 639 | VM_BUG_ON(!pc->mem_cgroup); |
544122e5 KH |
640 | /* |
641 | * We don't check PCG_USED bit. It's cleared when the "page" is finally | |
642 | * removed from global LRU. | |
643 | */ | |
08e552c6 | 644 | mz = page_cgroup_zoneinfo(pc); |
b69408e8 | 645 | MEM_CGROUP_ZSTAT(mz, lru) -= 1; |
4b3bde4c BS |
646 | if (mem_cgroup_is_root(pc->mem_cgroup)) |
647 | return; | |
648 | VM_BUG_ON(list_empty(&pc->lru)); | |
08e552c6 KH |
649 | list_del_init(&pc->lru); |
650 | return; | |
6d12e2d8 KH |
651 | } |
652 | ||
08e552c6 | 653 | void mem_cgroup_del_lru(struct page *page) |
6d12e2d8 | 654 | { |
08e552c6 KH |
655 | mem_cgroup_del_lru_list(page, page_lru(page)); |
656 | } | |
b69408e8 | 657 | |
08e552c6 KH |
658 | void mem_cgroup_rotate_lru_list(struct page *page, enum lru_list lru) |
659 | { | |
660 | struct mem_cgroup_per_zone *mz; | |
661 | struct page_cgroup *pc; | |
b69408e8 | 662 | |
f8d66542 | 663 | if (mem_cgroup_disabled()) |
08e552c6 | 664 | return; |
6d12e2d8 | 665 | |
08e552c6 | 666 | pc = lookup_page_cgroup(page); |
bd112db8 DN |
667 | /* |
668 | * Used bit is set without atomic ops but after smp_wmb(). | |
669 | * For making pc->mem_cgroup visible, insert smp_rmb() here. | |
670 | */ | |
08e552c6 | 671 | smp_rmb(); |
4b3bde4c BS |
672 | /* unused or root page is not rotated. */ |
673 | if (!PageCgroupUsed(pc) || mem_cgroup_is_root(pc->mem_cgroup)) | |
08e552c6 KH |
674 | return; |
675 | mz = page_cgroup_zoneinfo(pc); | |
676 | list_move(&pc->lru, &mz->lists[lru]); | |
6d12e2d8 KH |
677 | } |
678 | ||
08e552c6 | 679 | void mem_cgroup_add_lru_list(struct page *page, enum lru_list lru) |
66e1707b | 680 | { |
08e552c6 KH |
681 | struct page_cgroup *pc; |
682 | struct mem_cgroup_per_zone *mz; | |
6d12e2d8 | 683 | |
f8d66542 | 684 | if (mem_cgroup_disabled()) |
08e552c6 KH |
685 | return; |
686 | pc = lookup_page_cgroup(page); | |
4b3bde4c | 687 | VM_BUG_ON(PageCgroupAcctLRU(pc)); |
bd112db8 DN |
688 | /* |
689 | * Used bit is set without atomic ops but after smp_wmb(). | |
690 | * For making pc->mem_cgroup visible, insert smp_rmb() here. | |
691 | */ | |
08e552c6 KH |
692 | smp_rmb(); |
693 | if (!PageCgroupUsed(pc)) | |
894bc310 | 694 | return; |
b69408e8 | 695 | |
08e552c6 | 696 | mz = page_cgroup_zoneinfo(pc); |
b69408e8 | 697 | MEM_CGROUP_ZSTAT(mz, lru) += 1; |
4b3bde4c BS |
698 | SetPageCgroupAcctLRU(pc); |
699 | if (mem_cgroup_is_root(pc->mem_cgroup)) | |
700 | return; | |
08e552c6 KH |
701 | list_add(&pc->lru, &mz->lists[lru]); |
702 | } | |
544122e5 | 703 | |
08e552c6 | 704 | /* |
544122e5 KH |
705 | * At handling SwapCache, pc->mem_cgroup may be changed while it's linked to |
706 | * lru because the page may.be reused after it's fully uncharged (because of | |
707 | * SwapCache behavior).To handle that, unlink page_cgroup from LRU when charge | |
708 | * it again. This function is only used to charge SwapCache. It's done under | |
709 | * lock_page and expected that zone->lru_lock is never held. | |
08e552c6 | 710 | */ |
544122e5 | 711 | static void mem_cgroup_lru_del_before_commit_swapcache(struct page *page) |
08e552c6 | 712 | { |
544122e5 KH |
713 | unsigned long flags; |
714 | struct zone *zone = page_zone(page); | |
715 | struct page_cgroup *pc = lookup_page_cgroup(page); | |
716 | ||
717 | spin_lock_irqsave(&zone->lru_lock, flags); | |
718 | /* | |
719 | * Forget old LRU when this page_cgroup is *not* used. This Used bit | |
720 | * is guarded by lock_page() because the page is SwapCache. | |
721 | */ | |
722 | if (!PageCgroupUsed(pc)) | |
723 | mem_cgroup_del_lru_list(page, page_lru(page)); | |
724 | spin_unlock_irqrestore(&zone->lru_lock, flags); | |
08e552c6 KH |
725 | } |
726 | ||
544122e5 KH |
727 | static void mem_cgroup_lru_add_after_commit_swapcache(struct page *page) |
728 | { | |
729 | unsigned long flags; | |
730 | struct zone *zone = page_zone(page); | |
731 | struct page_cgroup *pc = lookup_page_cgroup(page); | |
732 | ||
733 | spin_lock_irqsave(&zone->lru_lock, flags); | |
734 | /* link when the page is linked to LRU but page_cgroup isn't */ | |
4b3bde4c | 735 | if (PageLRU(page) && !PageCgroupAcctLRU(pc)) |
544122e5 KH |
736 | mem_cgroup_add_lru_list(page, page_lru(page)); |
737 | spin_unlock_irqrestore(&zone->lru_lock, flags); | |
738 | } | |
739 | ||
740 | ||
08e552c6 KH |
741 | void mem_cgroup_move_lists(struct page *page, |
742 | enum lru_list from, enum lru_list to) | |
743 | { | |
f8d66542 | 744 | if (mem_cgroup_disabled()) |
08e552c6 KH |
745 | return; |
746 | mem_cgroup_del_lru_list(page, from); | |
747 | mem_cgroup_add_lru_list(page, to); | |
66e1707b BS |
748 | } |
749 | ||
4c4a2214 DR |
750 | int task_in_mem_cgroup(struct task_struct *task, const struct mem_cgroup *mem) |
751 | { | |
752 | int ret; | |
0b7f569e | 753 | struct mem_cgroup *curr = NULL; |
4c4a2214 DR |
754 | |
755 | task_lock(task); | |
0b7f569e KH |
756 | rcu_read_lock(); |
757 | curr = try_get_mem_cgroup_from_mm(task->mm); | |
758 | rcu_read_unlock(); | |
4c4a2214 | 759 | task_unlock(task); |
0b7f569e KH |
760 | if (!curr) |
761 | return 0; | |
d31f56db DN |
762 | /* |
763 | * We should check use_hierarchy of "mem" not "curr". Because checking | |
764 | * use_hierarchy of "curr" here make this function true if hierarchy is | |
765 | * enabled in "curr" and "curr" is a child of "mem" in *cgroup* | |
766 | * hierarchy(even if use_hierarchy is disabled in "mem"). | |
767 | */ | |
768 | if (mem->use_hierarchy) | |
0b7f569e KH |
769 | ret = css_is_ancestor(&curr->css, &mem->css); |
770 | else | |
771 | ret = (curr == mem); | |
772 | css_put(&curr->css); | |
4c4a2214 DR |
773 | return ret; |
774 | } | |
775 | ||
6c48a1d0 KH |
776 | /* |
777 | * prev_priority control...this will be used in memory reclaim path. | |
778 | */ | |
779 | int mem_cgroup_get_reclaim_priority(struct mem_cgroup *mem) | |
780 | { | |
2733c06a KM |
781 | int prev_priority; |
782 | ||
783 | spin_lock(&mem->reclaim_param_lock); | |
784 | prev_priority = mem->prev_priority; | |
785 | spin_unlock(&mem->reclaim_param_lock); | |
786 | ||
787 | return prev_priority; | |
6c48a1d0 KH |
788 | } |
789 | ||
790 | void mem_cgroup_note_reclaim_priority(struct mem_cgroup *mem, int priority) | |
791 | { | |
2733c06a | 792 | spin_lock(&mem->reclaim_param_lock); |
6c48a1d0 KH |
793 | if (priority < mem->prev_priority) |
794 | mem->prev_priority = priority; | |
2733c06a | 795 | spin_unlock(&mem->reclaim_param_lock); |
6c48a1d0 KH |
796 | } |
797 | ||
798 | void mem_cgroup_record_reclaim_priority(struct mem_cgroup *mem, int priority) | |
799 | { | |
2733c06a | 800 | spin_lock(&mem->reclaim_param_lock); |
6c48a1d0 | 801 | mem->prev_priority = priority; |
2733c06a | 802 | spin_unlock(&mem->reclaim_param_lock); |
6c48a1d0 KH |
803 | } |
804 | ||
c772be93 | 805 | static int calc_inactive_ratio(struct mem_cgroup *memcg, unsigned long *present_pages) |
14797e23 KM |
806 | { |
807 | unsigned long active; | |
808 | unsigned long inactive; | |
c772be93 KM |
809 | unsigned long gb; |
810 | unsigned long inactive_ratio; | |
14797e23 | 811 | |
14067bb3 KH |
812 | inactive = mem_cgroup_get_local_zonestat(memcg, LRU_INACTIVE_ANON); |
813 | active = mem_cgroup_get_local_zonestat(memcg, LRU_ACTIVE_ANON); | |
14797e23 | 814 | |
c772be93 KM |
815 | gb = (inactive + active) >> (30 - PAGE_SHIFT); |
816 | if (gb) | |
817 | inactive_ratio = int_sqrt(10 * gb); | |
818 | else | |
819 | inactive_ratio = 1; | |
820 | ||
821 | if (present_pages) { | |
822 | present_pages[0] = inactive; | |
823 | present_pages[1] = active; | |
824 | } | |
825 | ||
826 | return inactive_ratio; | |
827 | } | |
828 | ||
829 | int mem_cgroup_inactive_anon_is_low(struct mem_cgroup *memcg) | |
830 | { | |
831 | unsigned long active; | |
832 | unsigned long inactive; | |
833 | unsigned long present_pages[2]; | |
834 | unsigned long inactive_ratio; | |
835 | ||
836 | inactive_ratio = calc_inactive_ratio(memcg, present_pages); | |
837 | ||
838 | inactive = present_pages[0]; | |
839 | active = present_pages[1]; | |
840 | ||
841 | if (inactive * inactive_ratio < active) | |
14797e23 KM |
842 | return 1; |
843 | ||
844 | return 0; | |
845 | } | |
846 | ||
56e49d21 RR |
847 | int mem_cgroup_inactive_file_is_low(struct mem_cgroup *memcg) |
848 | { | |
849 | unsigned long active; | |
850 | unsigned long inactive; | |
851 | ||
852 | inactive = mem_cgroup_get_local_zonestat(memcg, LRU_INACTIVE_FILE); | |
853 | active = mem_cgroup_get_local_zonestat(memcg, LRU_ACTIVE_FILE); | |
854 | ||
855 | return (active > inactive); | |
856 | } | |
857 | ||
a3d8e054 KM |
858 | unsigned long mem_cgroup_zone_nr_pages(struct mem_cgroup *memcg, |
859 | struct zone *zone, | |
860 | enum lru_list lru) | |
861 | { | |
862 | int nid = zone->zone_pgdat->node_id; | |
863 | int zid = zone_idx(zone); | |
864 | struct mem_cgroup_per_zone *mz = mem_cgroup_zoneinfo(memcg, nid, zid); | |
865 | ||
866 | return MEM_CGROUP_ZSTAT(mz, lru); | |
867 | } | |
868 | ||
3e2f41f1 KM |
869 | struct zone_reclaim_stat *mem_cgroup_get_reclaim_stat(struct mem_cgroup *memcg, |
870 | struct zone *zone) | |
871 | { | |
872 | int nid = zone->zone_pgdat->node_id; | |
873 | int zid = zone_idx(zone); | |
874 | struct mem_cgroup_per_zone *mz = mem_cgroup_zoneinfo(memcg, nid, zid); | |
875 | ||
876 | return &mz->reclaim_stat; | |
877 | } | |
878 | ||
879 | struct zone_reclaim_stat * | |
880 | mem_cgroup_get_reclaim_stat_from_page(struct page *page) | |
881 | { | |
882 | struct page_cgroup *pc; | |
883 | struct mem_cgroup_per_zone *mz; | |
884 | ||
885 | if (mem_cgroup_disabled()) | |
886 | return NULL; | |
887 | ||
888 | pc = lookup_page_cgroup(page); | |
bd112db8 DN |
889 | /* |
890 | * Used bit is set without atomic ops but after smp_wmb(). | |
891 | * For making pc->mem_cgroup visible, insert smp_rmb() here. | |
892 | */ | |
893 | smp_rmb(); | |
894 | if (!PageCgroupUsed(pc)) | |
895 | return NULL; | |
896 | ||
3e2f41f1 KM |
897 | mz = page_cgroup_zoneinfo(pc); |
898 | if (!mz) | |
899 | return NULL; | |
900 | ||
901 | return &mz->reclaim_stat; | |
902 | } | |
903 | ||
66e1707b BS |
904 | unsigned long mem_cgroup_isolate_pages(unsigned long nr_to_scan, |
905 | struct list_head *dst, | |
906 | unsigned long *scanned, int order, | |
907 | int mode, struct zone *z, | |
908 | struct mem_cgroup *mem_cont, | |
4f98a2fe | 909 | int active, int file) |
66e1707b BS |
910 | { |
911 | unsigned long nr_taken = 0; | |
912 | struct page *page; | |
913 | unsigned long scan; | |
914 | LIST_HEAD(pc_list); | |
915 | struct list_head *src; | |
ff7283fa | 916 | struct page_cgroup *pc, *tmp; |
1ecaab2b KH |
917 | int nid = z->zone_pgdat->node_id; |
918 | int zid = zone_idx(z); | |
919 | struct mem_cgroup_per_zone *mz; | |
b7c46d15 | 920 | int lru = LRU_FILE * file + active; |
2ffebca6 | 921 | int ret; |
66e1707b | 922 | |
cf475ad2 | 923 | BUG_ON(!mem_cont); |
1ecaab2b | 924 | mz = mem_cgroup_zoneinfo(mem_cont, nid, zid); |
b69408e8 | 925 | src = &mz->lists[lru]; |
66e1707b | 926 | |
ff7283fa KH |
927 | scan = 0; |
928 | list_for_each_entry_safe_reverse(pc, tmp, src, lru) { | |
436c6541 | 929 | if (scan >= nr_to_scan) |
ff7283fa | 930 | break; |
08e552c6 KH |
931 | |
932 | page = pc->page; | |
52d4b9ac KH |
933 | if (unlikely(!PageCgroupUsed(pc))) |
934 | continue; | |
436c6541 | 935 | if (unlikely(!PageLRU(page))) |
ff7283fa | 936 | continue; |
ff7283fa | 937 | |
436c6541 | 938 | scan++; |
2ffebca6 KH |
939 | ret = __isolate_lru_page(page, mode, file); |
940 | switch (ret) { | |
941 | case 0: | |
66e1707b | 942 | list_move(&page->lru, dst); |
2ffebca6 | 943 | mem_cgroup_del_lru(page); |
66e1707b | 944 | nr_taken++; |
2ffebca6 KH |
945 | break; |
946 | case -EBUSY: | |
947 | /* we don't affect global LRU but rotate in our LRU */ | |
948 | mem_cgroup_rotate_lru_list(page, page_lru(page)); | |
949 | break; | |
950 | default: | |
951 | break; | |
66e1707b BS |
952 | } |
953 | } | |
954 | ||
66e1707b BS |
955 | *scanned = scan; |
956 | return nr_taken; | |
957 | } | |
958 | ||
6d61ef40 BS |
959 | #define mem_cgroup_from_res_counter(counter, member) \ |
960 | container_of(counter, struct mem_cgroup, member) | |
961 | ||
b85a96c0 DN |
962 | static bool mem_cgroup_check_under_limit(struct mem_cgroup *mem) |
963 | { | |
964 | if (do_swap_account) { | |
965 | if (res_counter_check_under_limit(&mem->res) && | |
966 | res_counter_check_under_limit(&mem->memsw)) | |
967 | return true; | |
968 | } else | |
969 | if (res_counter_check_under_limit(&mem->res)) | |
970 | return true; | |
971 | return false; | |
972 | } | |
973 | ||
a7885eb8 KM |
974 | static unsigned int get_swappiness(struct mem_cgroup *memcg) |
975 | { | |
976 | struct cgroup *cgrp = memcg->css.cgroup; | |
977 | unsigned int swappiness; | |
978 | ||
979 | /* root ? */ | |
980 | if (cgrp->parent == NULL) | |
981 | return vm_swappiness; | |
982 | ||
983 | spin_lock(&memcg->reclaim_param_lock); | |
984 | swappiness = memcg->swappiness; | |
985 | spin_unlock(&memcg->reclaim_param_lock); | |
986 | ||
987 | return swappiness; | |
988 | } | |
989 | ||
81d39c20 KH |
990 | static int mem_cgroup_count_children_cb(struct mem_cgroup *mem, void *data) |
991 | { | |
992 | int *val = data; | |
993 | (*val)++; | |
994 | return 0; | |
995 | } | |
e222432b BS |
996 | |
997 | /** | |
998 | * mem_cgroup_print_mem_info: Called from OOM with tasklist_lock held in read mode. | |
999 | * @memcg: The memory cgroup that went over limit | |
1000 | * @p: Task that is going to be killed | |
1001 | * | |
1002 | * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is | |
1003 | * enabled | |
1004 | */ | |
1005 | void mem_cgroup_print_oom_info(struct mem_cgroup *memcg, struct task_struct *p) | |
1006 | { | |
1007 | struct cgroup *task_cgrp; | |
1008 | struct cgroup *mem_cgrp; | |
1009 | /* | |
1010 | * Need a buffer in BSS, can't rely on allocations. The code relies | |
1011 | * on the assumption that OOM is serialized for memory controller. | |
1012 | * If this assumption is broken, revisit this code. | |
1013 | */ | |
1014 | static char memcg_name[PATH_MAX]; | |
1015 | int ret; | |
1016 | ||
d31f56db | 1017 | if (!memcg || !p) |
e222432b BS |
1018 | return; |
1019 | ||
1020 | ||
1021 | rcu_read_lock(); | |
1022 | ||
1023 | mem_cgrp = memcg->css.cgroup; | |
1024 | task_cgrp = task_cgroup(p, mem_cgroup_subsys_id); | |
1025 | ||
1026 | ret = cgroup_path(task_cgrp, memcg_name, PATH_MAX); | |
1027 | if (ret < 0) { | |
1028 | /* | |
1029 | * Unfortunately, we are unable to convert to a useful name | |
1030 | * But we'll still print out the usage information | |
1031 | */ | |
1032 | rcu_read_unlock(); | |
1033 | goto done; | |
1034 | } | |
1035 | rcu_read_unlock(); | |
1036 | ||
1037 | printk(KERN_INFO "Task in %s killed", memcg_name); | |
1038 | ||
1039 | rcu_read_lock(); | |
1040 | ret = cgroup_path(mem_cgrp, memcg_name, PATH_MAX); | |
1041 | if (ret < 0) { | |
1042 | rcu_read_unlock(); | |
1043 | goto done; | |
1044 | } | |
1045 | rcu_read_unlock(); | |
1046 | ||
1047 | /* | |
1048 | * Continues from above, so we don't need an KERN_ level | |
1049 | */ | |
1050 | printk(KERN_CONT " as a result of limit of %s\n", memcg_name); | |
1051 | done: | |
1052 | ||
1053 | printk(KERN_INFO "memory: usage %llukB, limit %llukB, failcnt %llu\n", | |
1054 | res_counter_read_u64(&memcg->res, RES_USAGE) >> 10, | |
1055 | res_counter_read_u64(&memcg->res, RES_LIMIT) >> 10, | |
1056 | res_counter_read_u64(&memcg->res, RES_FAILCNT)); | |
1057 | printk(KERN_INFO "memory+swap: usage %llukB, limit %llukB, " | |
1058 | "failcnt %llu\n", | |
1059 | res_counter_read_u64(&memcg->memsw, RES_USAGE) >> 10, | |
1060 | res_counter_read_u64(&memcg->memsw, RES_LIMIT) >> 10, | |
1061 | res_counter_read_u64(&memcg->memsw, RES_FAILCNT)); | |
1062 | } | |
1063 | ||
81d39c20 KH |
1064 | /* |
1065 | * This function returns the number of memcg under hierarchy tree. Returns | |
1066 | * 1(self count) if no children. | |
1067 | */ | |
1068 | static int mem_cgroup_count_children(struct mem_cgroup *mem) | |
1069 | { | |
1070 | int num = 0; | |
1071 | mem_cgroup_walk_tree(mem, &num, mem_cgroup_count_children_cb); | |
1072 | return num; | |
1073 | } | |
1074 | ||
6d61ef40 | 1075 | /* |
04046e1a KH |
1076 | * Visit the first child (need not be the first child as per the ordering |
1077 | * of the cgroup list, since we track last_scanned_child) of @mem and use | |
1078 | * that to reclaim free pages from. | |
1079 | */ | |
1080 | static struct mem_cgroup * | |
1081 | mem_cgroup_select_victim(struct mem_cgroup *root_mem) | |
1082 | { | |
1083 | struct mem_cgroup *ret = NULL; | |
1084 | struct cgroup_subsys_state *css; | |
1085 | int nextid, found; | |
1086 | ||
1087 | if (!root_mem->use_hierarchy) { | |
1088 | css_get(&root_mem->css); | |
1089 | ret = root_mem; | |
1090 | } | |
1091 | ||
1092 | while (!ret) { | |
1093 | rcu_read_lock(); | |
1094 | nextid = root_mem->last_scanned_child + 1; | |
1095 | css = css_get_next(&mem_cgroup_subsys, nextid, &root_mem->css, | |
1096 | &found); | |
1097 | if (css && css_tryget(css)) | |
1098 | ret = container_of(css, struct mem_cgroup, css); | |
1099 | ||
1100 | rcu_read_unlock(); | |
1101 | /* Updates scanning parameter */ | |
1102 | spin_lock(&root_mem->reclaim_param_lock); | |
1103 | if (!css) { | |
1104 | /* this means start scan from ID:1 */ | |
1105 | root_mem->last_scanned_child = 0; | |
1106 | } else | |
1107 | root_mem->last_scanned_child = found; | |
1108 | spin_unlock(&root_mem->reclaim_param_lock); | |
1109 | } | |
1110 | ||
1111 | return ret; | |
1112 | } | |
1113 | ||
1114 | /* | |
1115 | * Scan the hierarchy if needed to reclaim memory. We remember the last child | |
1116 | * we reclaimed from, so that we don't end up penalizing one child extensively | |
1117 | * based on its position in the children list. | |
6d61ef40 BS |
1118 | * |
1119 | * root_mem is the original ancestor that we've been reclaim from. | |
04046e1a KH |
1120 | * |
1121 | * We give up and return to the caller when we visit root_mem twice. | |
1122 | * (other groups can be removed while we're walking....) | |
81d39c20 KH |
1123 | * |
1124 | * If shrink==true, for avoiding to free too much, this returns immedieately. | |
6d61ef40 BS |
1125 | */ |
1126 | static int mem_cgroup_hierarchical_reclaim(struct mem_cgroup *root_mem, | |
4e416953 | 1127 | struct zone *zone, |
75822b44 BS |
1128 | gfp_t gfp_mask, |
1129 | unsigned long reclaim_options) | |
6d61ef40 | 1130 | { |
04046e1a KH |
1131 | struct mem_cgroup *victim; |
1132 | int ret, total = 0; | |
1133 | int loop = 0; | |
75822b44 BS |
1134 | bool noswap = reclaim_options & MEM_CGROUP_RECLAIM_NOSWAP; |
1135 | bool shrink = reclaim_options & MEM_CGROUP_RECLAIM_SHRINK; | |
4e416953 BS |
1136 | bool check_soft = reclaim_options & MEM_CGROUP_RECLAIM_SOFT; |
1137 | unsigned long excess = mem_cgroup_get_excess(root_mem); | |
04046e1a | 1138 | |
22a668d7 KH |
1139 | /* If memsw_is_minimum==1, swap-out is of-no-use. */ |
1140 | if (root_mem->memsw_is_minimum) | |
1141 | noswap = true; | |
1142 | ||
4e416953 | 1143 | while (1) { |
04046e1a | 1144 | victim = mem_cgroup_select_victim(root_mem); |
4e416953 | 1145 | if (victim == root_mem) { |
04046e1a | 1146 | loop++; |
cdec2e42 KH |
1147 | if (loop >= 1) |
1148 | drain_all_stock_async(); | |
4e416953 BS |
1149 | if (loop >= 2) { |
1150 | /* | |
1151 | * If we have not been able to reclaim | |
1152 | * anything, it might because there are | |
1153 | * no reclaimable pages under this hierarchy | |
1154 | */ | |
1155 | if (!check_soft || !total) { | |
1156 | css_put(&victim->css); | |
1157 | break; | |
1158 | } | |
1159 | /* | |
1160 | * We want to do more targetted reclaim. | |
1161 | * excess >> 2 is not to excessive so as to | |
1162 | * reclaim too much, nor too less that we keep | |
1163 | * coming back to reclaim from this cgroup | |
1164 | */ | |
1165 | if (total >= (excess >> 2) || | |
1166 | (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS)) { | |
1167 | css_put(&victim->css); | |
1168 | break; | |
1169 | } | |
1170 | } | |
1171 | } | |
04046e1a KH |
1172 | if (!mem_cgroup_local_usage(&victim->stat)) { |
1173 | /* this cgroup's local usage == 0 */ | |
1174 | css_put(&victim->css); | |
6d61ef40 BS |
1175 | continue; |
1176 | } | |
04046e1a | 1177 | /* we use swappiness of local cgroup */ |
4e416953 BS |
1178 | if (check_soft) |
1179 | ret = mem_cgroup_shrink_node_zone(victim, gfp_mask, | |
1180 | noswap, get_swappiness(victim), zone, | |
1181 | zone->zone_pgdat->node_id); | |
1182 | else | |
1183 | ret = try_to_free_mem_cgroup_pages(victim, gfp_mask, | |
1184 | noswap, get_swappiness(victim)); | |
04046e1a | 1185 | css_put(&victim->css); |
81d39c20 KH |
1186 | /* |
1187 | * At shrinking usage, we can't check we should stop here or | |
1188 | * reclaim more. It's depends on callers. last_scanned_child | |
1189 | * will work enough for keeping fairness under tree. | |
1190 | */ | |
1191 | if (shrink) | |
1192 | return ret; | |
04046e1a | 1193 | total += ret; |
4e416953 BS |
1194 | if (check_soft) { |
1195 | if (res_counter_check_under_soft_limit(&root_mem->res)) | |
1196 | return total; | |
1197 | } else if (mem_cgroup_check_under_limit(root_mem)) | |
04046e1a | 1198 | return 1 + total; |
6d61ef40 | 1199 | } |
04046e1a | 1200 | return total; |
6d61ef40 BS |
1201 | } |
1202 | ||
a636b327 KH |
1203 | bool mem_cgroup_oom_called(struct task_struct *task) |
1204 | { | |
1205 | bool ret = false; | |
1206 | struct mem_cgroup *mem; | |
1207 | struct mm_struct *mm; | |
1208 | ||
1209 | rcu_read_lock(); | |
1210 | mm = task->mm; | |
1211 | if (!mm) | |
1212 | mm = &init_mm; | |
1213 | mem = mem_cgroup_from_task(rcu_dereference(mm->owner)); | |
1214 | if (mem && time_before(jiffies, mem->last_oom_jiffies + HZ/10)) | |
1215 | ret = true; | |
1216 | rcu_read_unlock(); | |
1217 | return ret; | |
1218 | } | |
0b7f569e KH |
1219 | |
1220 | static int record_last_oom_cb(struct mem_cgroup *mem, void *data) | |
1221 | { | |
1222 | mem->last_oom_jiffies = jiffies; | |
1223 | return 0; | |
1224 | } | |
1225 | ||
1226 | static void record_last_oom(struct mem_cgroup *mem) | |
1227 | { | |
1228 | mem_cgroup_walk_tree(mem, NULL, record_last_oom_cb); | |
1229 | } | |
1230 | ||
d69b042f BS |
1231 | /* |
1232 | * Currently used to update mapped file statistics, but the routine can be | |
1233 | * generalized to update other statistics as well. | |
1234 | */ | |
d8046582 | 1235 | void mem_cgroup_update_file_mapped(struct page *page, int val) |
d69b042f BS |
1236 | { |
1237 | struct mem_cgroup *mem; | |
1238 | struct mem_cgroup_stat *stat; | |
1239 | struct mem_cgroup_stat_cpu *cpustat; | |
1240 | int cpu; | |
1241 | struct page_cgroup *pc; | |
1242 | ||
d69b042f BS |
1243 | pc = lookup_page_cgroup(page); |
1244 | if (unlikely(!pc)) | |
1245 | return; | |
1246 | ||
1247 | lock_page_cgroup(pc); | |
1248 | mem = pc->mem_cgroup; | |
1249 | if (!mem) | |
1250 | goto done; | |
1251 | ||
1252 | if (!PageCgroupUsed(pc)) | |
1253 | goto done; | |
1254 | ||
1255 | /* | |
1256 | * Preemption is already disabled, we don't need get_cpu() | |
1257 | */ | |
1258 | cpu = smp_processor_id(); | |
1259 | stat = &mem->stat; | |
1260 | cpustat = &stat->cpustat[cpu]; | |
1261 | ||
d8046582 | 1262 | __mem_cgroup_stat_add_safe(cpustat, MEM_CGROUP_STAT_FILE_MAPPED, val); |
d69b042f BS |
1263 | done: |
1264 | unlock_page_cgroup(pc); | |
1265 | } | |
0b7f569e | 1266 | |
cdec2e42 KH |
1267 | /* |
1268 | * size of first charge trial. "32" comes from vmscan.c's magic value. | |
1269 | * TODO: maybe necessary to use big numbers in big irons. | |
1270 | */ | |
1271 | #define CHARGE_SIZE (32 * PAGE_SIZE) | |
1272 | struct memcg_stock_pcp { | |
1273 | struct mem_cgroup *cached; /* this never be root cgroup */ | |
1274 | int charge; | |
1275 | struct work_struct work; | |
1276 | }; | |
1277 | static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock); | |
1278 | static atomic_t memcg_drain_count; | |
1279 | ||
1280 | /* | |
1281 | * Try to consume stocked charge on this cpu. If success, PAGE_SIZE is consumed | |
1282 | * from local stock and true is returned. If the stock is 0 or charges from a | |
1283 | * cgroup which is not current target, returns false. This stock will be | |
1284 | * refilled. | |
1285 | */ | |
1286 | static bool consume_stock(struct mem_cgroup *mem) | |
1287 | { | |
1288 | struct memcg_stock_pcp *stock; | |
1289 | bool ret = true; | |
1290 | ||
1291 | stock = &get_cpu_var(memcg_stock); | |
1292 | if (mem == stock->cached && stock->charge) | |
1293 | stock->charge -= PAGE_SIZE; | |
1294 | else /* need to call res_counter_charge */ | |
1295 | ret = false; | |
1296 | put_cpu_var(memcg_stock); | |
1297 | return ret; | |
1298 | } | |
1299 | ||
1300 | /* | |
1301 | * Returns stocks cached in percpu to res_counter and reset cached information. | |
1302 | */ | |
1303 | static void drain_stock(struct memcg_stock_pcp *stock) | |
1304 | { | |
1305 | struct mem_cgroup *old = stock->cached; | |
1306 | ||
1307 | if (stock->charge) { | |
1308 | res_counter_uncharge(&old->res, stock->charge); | |
1309 | if (do_swap_account) | |
1310 | res_counter_uncharge(&old->memsw, stock->charge); | |
1311 | } | |
1312 | stock->cached = NULL; | |
1313 | stock->charge = 0; | |
1314 | } | |
1315 | ||
1316 | /* | |
1317 | * This must be called under preempt disabled or must be called by | |
1318 | * a thread which is pinned to local cpu. | |
1319 | */ | |
1320 | static void drain_local_stock(struct work_struct *dummy) | |
1321 | { | |
1322 | struct memcg_stock_pcp *stock = &__get_cpu_var(memcg_stock); | |
1323 | drain_stock(stock); | |
1324 | } | |
1325 | ||
1326 | /* | |
1327 | * Cache charges(val) which is from res_counter, to local per_cpu area. | |
1328 | * This will be consumed by consumt_stock() function, later. | |
1329 | */ | |
1330 | static void refill_stock(struct mem_cgroup *mem, int val) | |
1331 | { | |
1332 | struct memcg_stock_pcp *stock = &get_cpu_var(memcg_stock); | |
1333 | ||
1334 | if (stock->cached != mem) { /* reset if necessary */ | |
1335 | drain_stock(stock); | |
1336 | stock->cached = mem; | |
1337 | } | |
1338 | stock->charge += val; | |
1339 | put_cpu_var(memcg_stock); | |
1340 | } | |
1341 | ||
1342 | /* | |
1343 | * Tries to drain stocked charges in other cpus. This function is asynchronous | |
1344 | * and just put a work per cpu for draining localy on each cpu. Caller can | |
1345 | * expects some charges will be back to res_counter later but cannot wait for | |
1346 | * it. | |
1347 | */ | |
1348 | static void drain_all_stock_async(void) | |
1349 | { | |
1350 | int cpu; | |
1351 | /* This function is for scheduling "drain" in asynchronous way. | |
1352 | * The result of "drain" is not directly handled by callers. Then, | |
1353 | * if someone is calling drain, we don't have to call drain more. | |
1354 | * Anyway, WORK_STRUCT_PENDING check in queue_work_on() will catch if | |
1355 | * there is a race. We just do loose check here. | |
1356 | */ | |
1357 | if (atomic_read(&memcg_drain_count)) | |
1358 | return; | |
1359 | /* Notify other cpus that system-wide "drain" is running */ | |
1360 | atomic_inc(&memcg_drain_count); | |
1361 | get_online_cpus(); | |
1362 | for_each_online_cpu(cpu) { | |
1363 | struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu); | |
1364 | schedule_work_on(cpu, &stock->work); | |
1365 | } | |
1366 | put_online_cpus(); | |
1367 | atomic_dec(&memcg_drain_count); | |
1368 | /* We don't wait for flush_work */ | |
1369 | } | |
1370 | ||
1371 | /* This is a synchronous drain interface. */ | |
1372 | static void drain_all_stock_sync(void) | |
1373 | { | |
1374 | /* called when force_empty is called */ | |
1375 | atomic_inc(&memcg_drain_count); | |
1376 | schedule_on_each_cpu(drain_local_stock); | |
1377 | atomic_dec(&memcg_drain_count); | |
1378 | } | |
1379 | ||
1380 | static int __cpuinit memcg_stock_cpu_callback(struct notifier_block *nb, | |
1381 | unsigned long action, | |
1382 | void *hcpu) | |
1383 | { | |
1384 | int cpu = (unsigned long)hcpu; | |
1385 | struct memcg_stock_pcp *stock; | |
1386 | ||
1387 | if (action != CPU_DEAD) | |
1388 | return NOTIFY_OK; | |
1389 | stock = &per_cpu(memcg_stock, cpu); | |
1390 | drain_stock(stock); | |
1391 | return NOTIFY_OK; | |
1392 | } | |
1393 | ||
f817ed48 KH |
1394 | /* |
1395 | * Unlike exported interface, "oom" parameter is added. if oom==true, | |
1396 | * oom-killer can be invoked. | |
8a9f3ccd | 1397 | */ |
f817ed48 | 1398 | static int __mem_cgroup_try_charge(struct mm_struct *mm, |
8c7c6e34 | 1399 | gfp_t gfp_mask, struct mem_cgroup **memcg, |
f64c3f54 | 1400 | bool oom, struct page *page) |
8a9f3ccd | 1401 | { |
4e649152 | 1402 | struct mem_cgroup *mem, *mem_over_limit; |
7a81b88c | 1403 | int nr_retries = MEM_CGROUP_RECLAIM_RETRIES; |
4e649152 | 1404 | struct res_counter *fail_res; |
cdec2e42 | 1405 | int csize = CHARGE_SIZE; |
a636b327 KH |
1406 | |
1407 | if (unlikely(test_thread_flag(TIF_MEMDIE))) { | |
1408 | /* Don't account this! */ | |
1409 | *memcg = NULL; | |
1410 | return 0; | |
1411 | } | |
1412 | ||
8a9f3ccd | 1413 | /* |
3be91277 HD |
1414 | * We always charge the cgroup the mm_struct belongs to. |
1415 | * The mm_struct's mem_cgroup changes on task migration if the | |
8a9f3ccd BS |
1416 | * thread group leader migrates. It's possible that mm is not |
1417 | * set, if so charge the init_mm (happens for pagecache usage). | |
1418 | */ | |
54595fe2 KH |
1419 | mem = *memcg; |
1420 | if (likely(!mem)) { | |
1421 | mem = try_get_mem_cgroup_from_mm(mm); | |
7a81b88c | 1422 | *memcg = mem; |
e8589cc1 | 1423 | } else { |
7a81b88c | 1424 | css_get(&mem->css); |
e8589cc1 | 1425 | } |
54595fe2 KH |
1426 | if (unlikely(!mem)) |
1427 | return 0; | |
1428 | ||
46f7e602 | 1429 | VM_BUG_ON(css_is_removed(&mem->css)); |
cdec2e42 KH |
1430 | if (mem_cgroup_is_root(mem)) |
1431 | goto done; | |
8a9f3ccd | 1432 | |
8c7c6e34 | 1433 | while (1) { |
0c3e73e8 | 1434 | int ret = 0; |
75822b44 | 1435 | unsigned long flags = 0; |
7a81b88c | 1436 | |
cdec2e42 KH |
1437 | if (consume_stock(mem)) |
1438 | goto charged; | |
1439 | ||
1440 | ret = res_counter_charge(&mem->res, csize, &fail_res); | |
8c7c6e34 KH |
1441 | if (likely(!ret)) { |
1442 | if (!do_swap_account) | |
1443 | break; | |
cdec2e42 | 1444 | ret = res_counter_charge(&mem->memsw, csize, &fail_res); |
8c7c6e34 KH |
1445 | if (likely(!ret)) |
1446 | break; | |
1447 | /* mem+swap counter fails */ | |
cdec2e42 | 1448 | res_counter_uncharge(&mem->res, csize); |
75822b44 | 1449 | flags |= MEM_CGROUP_RECLAIM_NOSWAP; |
6d61ef40 BS |
1450 | mem_over_limit = mem_cgroup_from_res_counter(fail_res, |
1451 | memsw); | |
1452 | } else | |
1453 | /* mem counter fails */ | |
1454 | mem_over_limit = mem_cgroup_from_res_counter(fail_res, | |
1455 | res); | |
1456 | ||
cdec2e42 KH |
1457 | /* reduce request size and retry */ |
1458 | if (csize > PAGE_SIZE) { | |
1459 | csize = PAGE_SIZE; | |
1460 | continue; | |
1461 | } | |
3be91277 | 1462 | if (!(gfp_mask & __GFP_WAIT)) |
7a81b88c | 1463 | goto nomem; |
e1a1cd59 | 1464 | |
4e416953 BS |
1465 | ret = mem_cgroup_hierarchical_reclaim(mem_over_limit, NULL, |
1466 | gfp_mask, flags); | |
4d1c6273 DN |
1467 | if (ret) |
1468 | continue; | |
66e1707b BS |
1469 | |
1470 | /* | |
8869b8f6 HD |
1471 | * try_to_free_mem_cgroup_pages() might not give us a full |
1472 | * picture of reclaim. Some pages are reclaimed and might be | |
1473 | * moved to swap cache or just unmapped from the cgroup. | |
1474 | * Check the limit again to see if the reclaim reduced the | |
1475 | * current usage of the cgroup before giving up | |
8c7c6e34 | 1476 | * |
8869b8f6 | 1477 | */ |
b85a96c0 DN |
1478 | if (mem_cgroup_check_under_limit(mem_over_limit)) |
1479 | continue; | |
3be91277 HD |
1480 | |
1481 | if (!nr_retries--) { | |
a636b327 | 1482 | if (oom) { |
88700756 | 1483 | mem_cgroup_out_of_memory(mem_over_limit, gfp_mask); |
0b7f569e | 1484 | record_last_oom(mem_over_limit); |
a636b327 | 1485 | } |
7a81b88c | 1486 | goto nomem; |
66e1707b | 1487 | } |
8a9f3ccd | 1488 | } |
cdec2e42 KH |
1489 | if (csize > PAGE_SIZE) |
1490 | refill_stock(mem, csize - PAGE_SIZE); | |
1491 | charged: | |
f64c3f54 | 1492 | /* |
4e649152 KH |
1493 | * Insert ancestor (and ancestor's ancestors), to softlimit RB-tree. |
1494 | * if they exceeds softlimit. | |
f64c3f54 | 1495 | */ |
4e649152 KH |
1496 | if (mem_cgroup_soft_limit_check(mem)) |
1497 | mem_cgroup_update_tree(mem, page); | |
0c3e73e8 | 1498 | done: |
7a81b88c KH |
1499 | return 0; |
1500 | nomem: | |
1501 | css_put(&mem->css); | |
1502 | return -ENOMEM; | |
1503 | } | |
8a9f3ccd | 1504 | |
a3032a2c DN |
1505 | /* |
1506 | * Somemtimes we have to undo a charge we got by try_charge(). | |
1507 | * This function is for that and do uncharge, put css's refcnt. | |
1508 | * gotten by try_charge(). | |
1509 | */ | |
1510 | static void mem_cgroup_cancel_charge(struct mem_cgroup *mem) | |
1511 | { | |
1512 | if (!mem_cgroup_is_root(mem)) { | |
1513 | res_counter_uncharge(&mem->res, PAGE_SIZE); | |
1514 | if (do_swap_account) | |
1515 | res_counter_uncharge(&mem->memsw, PAGE_SIZE); | |
1516 | } | |
1517 | css_put(&mem->css); | |
1518 | } | |
1519 | ||
a3b2d692 KH |
1520 | /* |
1521 | * A helper function to get mem_cgroup from ID. must be called under | |
1522 | * rcu_read_lock(). The caller must check css_is_removed() or some if | |
1523 | * it's concern. (dropping refcnt from swap can be called against removed | |
1524 | * memcg.) | |
1525 | */ | |
1526 | static struct mem_cgroup *mem_cgroup_lookup(unsigned short id) | |
1527 | { | |
1528 | struct cgroup_subsys_state *css; | |
1529 | ||
1530 | /* ID 0 is unused ID */ | |
1531 | if (!id) | |
1532 | return NULL; | |
1533 | css = css_lookup(&mem_cgroup_subsys, id); | |
1534 | if (!css) | |
1535 | return NULL; | |
1536 | return container_of(css, struct mem_cgroup, css); | |
1537 | } | |
1538 | ||
b5a84319 KH |
1539 | static struct mem_cgroup *try_get_mem_cgroup_from_swapcache(struct page *page) |
1540 | { | |
1541 | struct mem_cgroup *mem; | |
3c776e64 | 1542 | struct page_cgroup *pc; |
a3b2d692 | 1543 | unsigned short id; |
b5a84319 KH |
1544 | swp_entry_t ent; |
1545 | ||
3c776e64 DN |
1546 | VM_BUG_ON(!PageLocked(page)); |
1547 | ||
b5a84319 KH |
1548 | if (!PageSwapCache(page)) |
1549 | return NULL; | |
1550 | ||
3c776e64 | 1551 | pc = lookup_page_cgroup(page); |
c0bd3f63 | 1552 | lock_page_cgroup(pc); |
a3b2d692 | 1553 | if (PageCgroupUsed(pc)) { |
3c776e64 | 1554 | mem = pc->mem_cgroup; |
a3b2d692 KH |
1555 | if (mem && !css_tryget(&mem->css)) |
1556 | mem = NULL; | |
1557 | } else { | |
3c776e64 | 1558 | ent.val = page_private(page); |
a3b2d692 KH |
1559 | id = lookup_swap_cgroup(ent); |
1560 | rcu_read_lock(); | |
1561 | mem = mem_cgroup_lookup(id); | |
1562 | if (mem && !css_tryget(&mem->css)) | |
1563 | mem = NULL; | |
1564 | rcu_read_unlock(); | |
3c776e64 | 1565 | } |
c0bd3f63 | 1566 | unlock_page_cgroup(pc); |
b5a84319 KH |
1567 | return mem; |
1568 | } | |
1569 | ||
7a81b88c | 1570 | /* |
a5e924f5 | 1571 | * commit a charge got by __mem_cgroup_try_charge() and makes page_cgroup to be |
7a81b88c KH |
1572 | * USED state. If already USED, uncharge and return. |
1573 | */ | |
1574 | ||
1575 | static void __mem_cgroup_commit_charge(struct mem_cgroup *mem, | |
1576 | struct page_cgroup *pc, | |
1577 | enum charge_type ctype) | |
1578 | { | |
7a81b88c KH |
1579 | /* try_charge() can return NULL to *memcg, taking care of it. */ |
1580 | if (!mem) | |
1581 | return; | |
52d4b9ac KH |
1582 | |
1583 | lock_page_cgroup(pc); | |
1584 | if (unlikely(PageCgroupUsed(pc))) { | |
1585 | unlock_page_cgroup(pc); | |
a3032a2c | 1586 | mem_cgroup_cancel_charge(mem); |
7a81b88c | 1587 | return; |
52d4b9ac | 1588 | } |
4b3bde4c | 1589 | |
8a9f3ccd | 1590 | pc->mem_cgroup = mem; |
261fb61a KH |
1591 | /* |
1592 | * We access a page_cgroup asynchronously without lock_page_cgroup(). | |
1593 | * Especially when a page_cgroup is taken from a page, pc->mem_cgroup | |
1594 | * is accessed after testing USED bit. To make pc->mem_cgroup visible | |
1595 | * before USED bit, we need memory barrier here. | |
1596 | * See mem_cgroup_add_lru_list(), etc. | |
1597 | */ | |
08e552c6 | 1598 | smp_wmb(); |
4b3bde4c BS |
1599 | switch (ctype) { |
1600 | case MEM_CGROUP_CHARGE_TYPE_CACHE: | |
1601 | case MEM_CGROUP_CHARGE_TYPE_SHMEM: | |
1602 | SetPageCgroupCache(pc); | |
1603 | SetPageCgroupUsed(pc); | |
1604 | break; | |
1605 | case MEM_CGROUP_CHARGE_TYPE_MAPPED: | |
1606 | ClearPageCgroupCache(pc); | |
1607 | SetPageCgroupUsed(pc); | |
1608 | break; | |
1609 | default: | |
1610 | break; | |
1611 | } | |
3be91277 | 1612 | |
08e552c6 | 1613 | mem_cgroup_charge_statistics(mem, pc, true); |
52d4b9ac | 1614 | |
52d4b9ac | 1615 | unlock_page_cgroup(pc); |
7a81b88c | 1616 | } |
66e1707b | 1617 | |
f817ed48 | 1618 | /** |
57f9fd7d | 1619 | * __mem_cgroup_move_account - move account of the page |
f817ed48 KH |
1620 | * @pc: page_cgroup of the page. |
1621 | * @from: mem_cgroup which the page is moved from. | |
1622 | * @to: mem_cgroup which the page is moved to. @from != @to. | |
1623 | * | |
1624 | * The caller must confirm following. | |
08e552c6 | 1625 | * - page is not on LRU (isolate_page() is useful.) |
57f9fd7d | 1626 | * - the pc is locked, used, and ->mem_cgroup points to @from. |
f817ed48 KH |
1627 | * |
1628 | * This function does "uncharge" from old cgroup but doesn't do "charge" to | |
1629 | * new cgroup. It should be done by a caller. | |
1630 | */ | |
1631 | ||
57f9fd7d | 1632 | static void __mem_cgroup_move_account(struct page_cgroup *pc, |
f817ed48 KH |
1633 | struct mem_cgroup *from, struct mem_cgroup *to) |
1634 | { | |
d69b042f BS |
1635 | struct page *page; |
1636 | int cpu; | |
1637 | struct mem_cgroup_stat *stat; | |
1638 | struct mem_cgroup_stat_cpu *cpustat; | |
f817ed48 | 1639 | |
f817ed48 | 1640 | VM_BUG_ON(from == to); |
08e552c6 | 1641 | VM_BUG_ON(PageLRU(pc->page)); |
57f9fd7d DN |
1642 | VM_BUG_ON(!PageCgroupLocked(pc)); |
1643 | VM_BUG_ON(!PageCgroupUsed(pc)); | |
1644 | VM_BUG_ON(pc->mem_cgroup != from); | |
f817ed48 | 1645 | |
0c3e73e8 | 1646 | if (!mem_cgroup_is_root(from)) |
4e649152 | 1647 | res_counter_uncharge(&from->res, PAGE_SIZE); |
08e552c6 | 1648 | mem_cgroup_charge_statistics(from, pc, false); |
d69b042f BS |
1649 | |
1650 | page = pc->page; | |
d8046582 | 1651 | if (page_mapped(page) && !PageAnon(page)) { |
d69b042f BS |
1652 | cpu = smp_processor_id(); |
1653 | /* Update mapped_file data for mem_cgroup "from" */ | |
1654 | stat = &from->stat; | |
1655 | cpustat = &stat->cpustat[cpu]; | |
d8046582 | 1656 | __mem_cgroup_stat_add_safe(cpustat, MEM_CGROUP_STAT_FILE_MAPPED, |
d69b042f BS |
1657 | -1); |
1658 | ||
1659 | /* Update mapped_file data for mem_cgroup "to" */ | |
1660 | stat = &to->stat; | |
1661 | cpustat = &stat->cpustat[cpu]; | |
d8046582 | 1662 | __mem_cgroup_stat_add_safe(cpustat, MEM_CGROUP_STAT_FILE_MAPPED, |
d69b042f BS |
1663 | 1); |
1664 | } | |
1665 | ||
0c3e73e8 | 1666 | if (do_swap_account && !mem_cgroup_is_root(from)) |
4e649152 | 1667 | res_counter_uncharge(&from->memsw, PAGE_SIZE); |
40d58138 DN |
1668 | css_put(&from->css); |
1669 | ||
1670 | css_get(&to->css); | |
08e552c6 KH |
1671 | pc->mem_cgroup = to; |
1672 | mem_cgroup_charge_statistics(to, pc, true); | |
88703267 KH |
1673 | /* |
1674 | * We charges against "to" which may not have any tasks. Then, "to" | |
1675 | * can be under rmdir(). But in current implementation, caller of | |
1676 | * this function is just force_empty() and it's garanteed that | |
1677 | * "to" is never removed. So, we don't check rmdir status here. | |
1678 | */ | |
57f9fd7d DN |
1679 | } |
1680 | ||
1681 | /* | |
1682 | * check whether the @pc is valid for moving account and call | |
1683 | * __mem_cgroup_move_account() | |
1684 | */ | |
1685 | static int mem_cgroup_move_account(struct page_cgroup *pc, | |
1686 | struct mem_cgroup *from, struct mem_cgroup *to) | |
1687 | { | |
1688 | int ret = -EINVAL; | |
1689 | lock_page_cgroup(pc); | |
1690 | if (PageCgroupUsed(pc) && pc->mem_cgroup == from) { | |
1691 | __mem_cgroup_move_account(pc, from, to); | |
1692 | ret = 0; | |
1693 | } | |
1694 | unlock_page_cgroup(pc); | |
f817ed48 KH |
1695 | return ret; |
1696 | } | |
1697 | ||
1698 | /* | |
1699 | * move charges to its parent. | |
1700 | */ | |
1701 | ||
1702 | static int mem_cgroup_move_parent(struct page_cgroup *pc, | |
1703 | struct mem_cgroup *child, | |
1704 | gfp_t gfp_mask) | |
1705 | { | |
08e552c6 | 1706 | struct page *page = pc->page; |
f817ed48 KH |
1707 | struct cgroup *cg = child->css.cgroup; |
1708 | struct cgroup *pcg = cg->parent; | |
1709 | struct mem_cgroup *parent; | |
f817ed48 KH |
1710 | int ret; |
1711 | ||
1712 | /* Is ROOT ? */ | |
1713 | if (!pcg) | |
1714 | return -EINVAL; | |
1715 | ||
57f9fd7d DN |
1716 | ret = -EBUSY; |
1717 | if (!get_page_unless_zero(page)) | |
1718 | goto out; | |
1719 | if (isolate_lru_page(page)) | |
1720 | goto put; | |
08e552c6 | 1721 | |
f817ed48 | 1722 | parent = mem_cgroup_from_cont(pcg); |
f64c3f54 | 1723 | ret = __mem_cgroup_try_charge(NULL, gfp_mask, &parent, false, page); |
a636b327 | 1724 | if (ret || !parent) |
57f9fd7d | 1725 | goto put_back; |
f817ed48 | 1726 | |
f817ed48 | 1727 | ret = mem_cgroup_move_account(pc, child, parent); |
57f9fd7d DN |
1728 | if (!ret) |
1729 | css_put(&parent->css); /* drop extra refcnt by try_charge() */ | |
1730 | else | |
1731 | mem_cgroup_cancel_charge(parent); /* does css_put */ | |
1732 | put_back: | |
08e552c6 | 1733 | putback_lru_page(page); |
57f9fd7d | 1734 | put: |
40d58138 | 1735 | put_page(page); |
57f9fd7d | 1736 | out: |
f817ed48 KH |
1737 | return ret; |
1738 | } | |
1739 | ||
7a81b88c KH |
1740 | /* |
1741 | * Charge the memory controller for page usage. | |
1742 | * Return | |
1743 | * 0 if the charge was successful | |
1744 | * < 0 if the cgroup is over its limit | |
1745 | */ | |
1746 | static int mem_cgroup_charge_common(struct page *page, struct mm_struct *mm, | |
1747 | gfp_t gfp_mask, enum charge_type ctype, | |
1748 | struct mem_cgroup *memcg) | |
1749 | { | |
1750 | struct mem_cgroup *mem; | |
1751 | struct page_cgroup *pc; | |
1752 | int ret; | |
1753 | ||
1754 | pc = lookup_page_cgroup(page); | |
1755 | /* can happen at boot */ | |
1756 | if (unlikely(!pc)) | |
1757 | return 0; | |
1758 | prefetchw(pc); | |
1759 | ||
1760 | mem = memcg; | |
f64c3f54 | 1761 | ret = __mem_cgroup_try_charge(mm, gfp_mask, &mem, true, page); |
a636b327 | 1762 | if (ret || !mem) |
7a81b88c KH |
1763 | return ret; |
1764 | ||
1765 | __mem_cgroup_commit_charge(mem, pc, ctype); | |
8a9f3ccd | 1766 | return 0; |
8a9f3ccd BS |
1767 | } |
1768 | ||
7a81b88c KH |
1769 | int mem_cgroup_newpage_charge(struct page *page, |
1770 | struct mm_struct *mm, gfp_t gfp_mask) | |
217bc319 | 1771 | { |
f8d66542 | 1772 | if (mem_cgroup_disabled()) |
cede86ac | 1773 | return 0; |
52d4b9ac KH |
1774 | if (PageCompound(page)) |
1775 | return 0; | |
69029cd5 KH |
1776 | /* |
1777 | * If already mapped, we don't have to account. | |
1778 | * If page cache, page->mapping has address_space. | |
1779 | * But page->mapping may have out-of-use anon_vma pointer, | |
1780 | * detecit it by PageAnon() check. newly-mapped-anon's page->mapping | |
1781 | * is NULL. | |
1782 | */ | |
1783 | if (page_mapped(page) || (page->mapping && !PageAnon(page))) | |
1784 | return 0; | |
1785 | if (unlikely(!mm)) | |
1786 | mm = &init_mm; | |
217bc319 | 1787 | return mem_cgroup_charge_common(page, mm, gfp_mask, |
e8589cc1 | 1788 | MEM_CGROUP_CHARGE_TYPE_MAPPED, NULL); |
217bc319 KH |
1789 | } |
1790 | ||
83aae4c7 DN |
1791 | static void |
1792 | __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *ptr, | |
1793 | enum charge_type ctype); | |
1794 | ||
e1a1cd59 BS |
1795 | int mem_cgroup_cache_charge(struct page *page, struct mm_struct *mm, |
1796 | gfp_t gfp_mask) | |
8697d331 | 1797 | { |
b5a84319 KH |
1798 | struct mem_cgroup *mem = NULL; |
1799 | int ret; | |
1800 | ||
f8d66542 | 1801 | if (mem_cgroup_disabled()) |
cede86ac | 1802 | return 0; |
52d4b9ac KH |
1803 | if (PageCompound(page)) |
1804 | return 0; | |
accf163e KH |
1805 | /* |
1806 | * Corner case handling. This is called from add_to_page_cache() | |
1807 | * in usual. But some FS (shmem) precharges this page before calling it | |
1808 | * and call add_to_page_cache() with GFP_NOWAIT. | |
1809 | * | |
1810 | * For GFP_NOWAIT case, the page may be pre-charged before calling | |
1811 | * add_to_page_cache(). (See shmem.c) check it here and avoid to call | |
1812 | * charge twice. (It works but has to pay a bit larger cost.) | |
b5a84319 KH |
1813 | * And when the page is SwapCache, it should take swap information |
1814 | * into account. This is under lock_page() now. | |
accf163e KH |
1815 | */ |
1816 | if (!(gfp_mask & __GFP_WAIT)) { | |
1817 | struct page_cgroup *pc; | |
1818 | ||
52d4b9ac KH |
1819 | |
1820 | pc = lookup_page_cgroup(page); | |
1821 | if (!pc) | |
1822 | return 0; | |
1823 | lock_page_cgroup(pc); | |
1824 | if (PageCgroupUsed(pc)) { | |
1825 | unlock_page_cgroup(pc); | |
accf163e KH |
1826 | return 0; |
1827 | } | |
52d4b9ac | 1828 | unlock_page_cgroup(pc); |
accf163e KH |
1829 | } |
1830 | ||
b5a84319 | 1831 | if (unlikely(!mm && !mem)) |
8697d331 | 1832 | mm = &init_mm; |
accf163e | 1833 | |
c05555b5 KH |
1834 | if (page_is_file_cache(page)) |
1835 | return mem_cgroup_charge_common(page, mm, gfp_mask, | |
e8589cc1 | 1836 | MEM_CGROUP_CHARGE_TYPE_CACHE, NULL); |
b5a84319 | 1837 | |
83aae4c7 DN |
1838 | /* shmem */ |
1839 | if (PageSwapCache(page)) { | |
1840 | ret = mem_cgroup_try_charge_swapin(mm, page, gfp_mask, &mem); | |
1841 | if (!ret) | |
1842 | __mem_cgroup_commit_charge_swapin(page, mem, | |
1843 | MEM_CGROUP_CHARGE_TYPE_SHMEM); | |
1844 | } else | |
1845 | ret = mem_cgroup_charge_common(page, mm, gfp_mask, | |
1846 | MEM_CGROUP_CHARGE_TYPE_SHMEM, mem); | |
b5a84319 | 1847 | |
b5a84319 | 1848 | return ret; |
e8589cc1 KH |
1849 | } |
1850 | ||
54595fe2 KH |
1851 | /* |
1852 | * While swap-in, try_charge -> commit or cancel, the page is locked. | |
1853 | * And when try_charge() successfully returns, one refcnt to memcg without | |
21ae2956 | 1854 | * struct page_cgroup is acquired. This refcnt will be consumed by |
54595fe2 KH |
1855 | * "commit()" or removed by "cancel()" |
1856 | */ | |
8c7c6e34 KH |
1857 | int mem_cgroup_try_charge_swapin(struct mm_struct *mm, |
1858 | struct page *page, | |
1859 | gfp_t mask, struct mem_cgroup **ptr) | |
1860 | { | |
1861 | struct mem_cgroup *mem; | |
54595fe2 | 1862 | int ret; |
8c7c6e34 | 1863 | |
f8d66542 | 1864 | if (mem_cgroup_disabled()) |
8c7c6e34 KH |
1865 | return 0; |
1866 | ||
1867 | if (!do_swap_account) | |
1868 | goto charge_cur_mm; | |
8c7c6e34 KH |
1869 | /* |
1870 | * A racing thread's fault, or swapoff, may have already updated | |
407f9c8b HD |
1871 | * the pte, and even removed page from swap cache: in those cases |
1872 | * do_swap_page()'s pte_same() test will fail; but there's also a | |
1873 | * KSM case which does need to charge the page. | |
8c7c6e34 KH |
1874 | */ |
1875 | if (!PageSwapCache(page)) | |
407f9c8b | 1876 | goto charge_cur_mm; |
b5a84319 | 1877 | mem = try_get_mem_cgroup_from_swapcache(page); |
54595fe2 KH |
1878 | if (!mem) |
1879 | goto charge_cur_mm; | |
8c7c6e34 | 1880 | *ptr = mem; |
f64c3f54 | 1881 | ret = __mem_cgroup_try_charge(NULL, mask, ptr, true, page); |
54595fe2 KH |
1882 | /* drop extra refcnt from tryget */ |
1883 | css_put(&mem->css); | |
1884 | return ret; | |
8c7c6e34 KH |
1885 | charge_cur_mm: |
1886 | if (unlikely(!mm)) | |
1887 | mm = &init_mm; | |
f64c3f54 | 1888 | return __mem_cgroup_try_charge(mm, mask, ptr, true, page); |
8c7c6e34 KH |
1889 | } |
1890 | ||
83aae4c7 DN |
1891 | static void |
1892 | __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *ptr, | |
1893 | enum charge_type ctype) | |
7a81b88c KH |
1894 | { |
1895 | struct page_cgroup *pc; | |
1896 | ||
f8d66542 | 1897 | if (mem_cgroup_disabled()) |
7a81b88c KH |
1898 | return; |
1899 | if (!ptr) | |
1900 | return; | |
88703267 | 1901 | cgroup_exclude_rmdir(&ptr->css); |
7a81b88c | 1902 | pc = lookup_page_cgroup(page); |
544122e5 | 1903 | mem_cgroup_lru_del_before_commit_swapcache(page); |
83aae4c7 | 1904 | __mem_cgroup_commit_charge(ptr, pc, ctype); |
544122e5 | 1905 | mem_cgroup_lru_add_after_commit_swapcache(page); |
8c7c6e34 KH |
1906 | /* |
1907 | * Now swap is on-memory. This means this page may be | |
1908 | * counted both as mem and swap....double count. | |
03f3c433 KH |
1909 | * Fix it by uncharging from memsw. Basically, this SwapCache is stable |
1910 | * under lock_page(). But in do_swap_page()::memory.c, reuse_swap_page() | |
1911 | * may call delete_from_swap_cache() before reach here. | |
8c7c6e34 | 1912 | */ |
03f3c433 | 1913 | if (do_swap_account && PageSwapCache(page)) { |
8c7c6e34 | 1914 | swp_entry_t ent = {.val = page_private(page)}; |
a3b2d692 | 1915 | unsigned short id; |
8c7c6e34 | 1916 | struct mem_cgroup *memcg; |
a3b2d692 KH |
1917 | |
1918 | id = swap_cgroup_record(ent, 0); | |
1919 | rcu_read_lock(); | |
1920 | memcg = mem_cgroup_lookup(id); | |
8c7c6e34 | 1921 | if (memcg) { |
a3b2d692 KH |
1922 | /* |
1923 | * This recorded memcg can be obsolete one. So, avoid | |
1924 | * calling css_tryget | |
1925 | */ | |
0c3e73e8 | 1926 | if (!mem_cgroup_is_root(memcg)) |
4e649152 | 1927 | res_counter_uncharge(&memcg->memsw, PAGE_SIZE); |
0c3e73e8 | 1928 | mem_cgroup_swap_statistics(memcg, false); |
8c7c6e34 KH |
1929 | mem_cgroup_put(memcg); |
1930 | } | |
a3b2d692 | 1931 | rcu_read_unlock(); |
8c7c6e34 | 1932 | } |
88703267 KH |
1933 | /* |
1934 | * At swapin, we may charge account against cgroup which has no tasks. | |
1935 | * So, rmdir()->pre_destroy() can be called while we do this charge. | |
1936 | * In that case, we need to call pre_destroy() again. check it here. | |
1937 | */ | |
1938 | cgroup_release_and_wakeup_rmdir(&ptr->css); | |
7a81b88c KH |
1939 | } |
1940 | ||
83aae4c7 DN |
1941 | void mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *ptr) |
1942 | { | |
1943 | __mem_cgroup_commit_charge_swapin(page, ptr, | |
1944 | MEM_CGROUP_CHARGE_TYPE_MAPPED); | |
1945 | } | |
1946 | ||
7a81b88c KH |
1947 | void mem_cgroup_cancel_charge_swapin(struct mem_cgroup *mem) |
1948 | { | |
f8d66542 | 1949 | if (mem_cgroup_disabled()) |
7a81b88c KH |
1950 | return; |
1951 | if (!mem) | |
1952 | return; | |
a3032a2c | 1953 | mem_cgroup_cancel_charge(mem); |
7a81b88c KH |
1954 | } |
1955 | ||
569b846d KH |
1956 | static void |
1957 | __do_uncharge(struct mem_cgroup *mem, const enum charge_type ctype) | |
1958 | { | |
1959 | struct memcg_batch_info *batch = NULL; | |
1960 | bool uncharge_memsw = true; | |
1961 | /* If swapout, usage of swap doesn't decrease */ | |
1962 | if (!do_swap_account || ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) | |
1963 | uncharge_memsw = false; | |
1964 | /* | |
1965 | * do_batch > 0 when unmapping pages or inode invalidate/truncate. | |
1966 | * In those cases, all pages freed continously can be expected to be in | |
1967 | * the same cgroup and we have chance to coalesce uncharges. | |
1968 | * But we do uncharge one by one if this is killed by OOM(TIF_MEMDIE) | |
1969 | * because we want to do uncharge as soon as possible. | |
1970 | */ | |
1971 | if (!current->memcg_batch.do_batch || test_thread_flag(TIF_MEMDIE)) | |
1972 | goto direct_uncharge; | |
1973 | ||
1974 | batch = ¤t->memcg_batch; | |
1975 | /* | |
1976 | * In usual, we do css_get() when we remember memcg pointer. | |
1977 | * But in this case, we keep res->usage until end of a series of | |
1978 | * uncharges. Then, it's ok to ignore memcg's refcnt. | |
1979 | */ | |
1980 | if (!batch->memcg) | |
1981 | batch->memcg = mem; | |
1982 | /* | |
1983 | * In typical case, batch->memcg == mem. This means we can | |
1984 | * merge a series of uncharges to an uncharge of res_counter. | |
1985 | * If not, we uncharge res_counter ony by one. | |
1986 | */ | |
1987 | if (batch->memcg != mem) | |
1988 | goto direct_uncharge; | |
1989 | /* remember freed charge and uncharge it later */ | |
1990 | batch->bytes += PAGE_SIZE; | |
1991 | if (uncharge_memsw) | |
1992 | batch->memsw_bytes += PAGE_SIZE; | |
1993 | return; | |
1994 | direct_uncharge: | |
1995 | res_counter_uncharge(&mem->res, PAGE_SIZE); | |
1996 | if (uncharge_memsw) | |
1997 | res_counter_uncharge(&mem->memsw, PAGE_SIZE); | |
1998 | return; | |
1999 | } | |
7a81b88c | 2000 | |
8a9f3ccd | 2001 | /* |
69029cd5 | 2002 | * uncharge if !page_mapped(page) |
8a9f3ccd | 2003 | */ |
8c7c6e34 | 2004 | static struct mem_cgroup * |
69029cd5 | 2005 | __mem_cgroup_uncharge_common(struct page *page, enum charge_type ctype) |
8a9f3ccd | 2006 | { |
8289546e | 2007 | struct page_cgroup *pc; |
8c7c6e34 | 2008 | struct mem_cgroup *mem = NULL; |
072c56c1 | 2009 | struct mem_cgroup_per_zone *mz; |
8a9f3ccd | 2010 | |
f8d66542 | 2011 | if (mem_cgroup_disabled()) |
8c7c6e34 | 2012 | return NULL; |
4077960e | 2013 | |
d13d1443 | 2014 | if (PageSwapCache(page)) |
8c7c6e34 | 2015 | return NULL; |
d13d1443 | 2016 | |
8697d331 | 2017 | /* |
3c541e14 | 2018 | * Check if our page_cgroup is valid |
8697d331 | 2019 | */ |
52d4b9ac KH |
2020 | pc = lookup_page_cgroup(page); |
2021 | if (unlikely(!pc || !PageCgroupUsed(pc))) | |
8c7c6e34 | 2022 | return NULL; |
b9c565d5 | 2023 | |
52d4b9ac | 2024 | lock_page_cgroup(pc); |
d13d1443 | 2025 | |
8c7c6e34 KH |
2026 | mem = pc->mem_cgroup; |
2027 | ||
d13d1443 KH |
2028 | if (!PageCgroupUsed(pc)) |
2029 | goto unlock_out; | |
2030 | ||
2031 | switch (ctype) { | |
2032 | case MEM_CGROUP_CHARGE_TYPE_MAPPED: | |
8a9478ca | 2033 | case MEM_CGROUP_CHARGE_TYPE_DROP: |
d13d1443 KH |
2034 | if (page_mapped(page)) |
2035 | goto unlock_out; | |
2036 | break; | |
2037 | case MEM_CGROUP_CHARGE_TYPE_SWAPOUT: | |
2038 | if (!PageAnon(page)) { /* Shared memory */ | |
2039 | if (page->mapping && !page_is_file_cache(page)) | |
2040 | goto unlock_out; | |
2041 | } else if (page_mapped(page)) /* Anon */ | |
2042 | goto unlock_out; | |
2043 | break; | |
2044 | default: | |
2045 | break; | |
52d4b9ac | 2046 | } |
d13d1443 | 2047 | |
569b846d KH |
2048 | if (!mem_cgroup_is_root(mem)) |
2049 | __do_uncharge(mem, ctype); | |
0c3e73e8 BS |
2050 | if (ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) |
2051 | mem_cgroup_swap_statistics(mem, true); | |
08e552c6 | 2052 | mem_cgroup_charge_statistics(mem, pc, false); |
04046e1a | 2053 | |
52d4b9ac | 2054 | ClearPageCgroupUsed(pc); |
544122e5 KH |
2055 | /* |
2056 | * pc->mem_cgroup is not cleared here. It will be accessed when it's | |
2057 | * freed from LRU. This is safe because uncharged page is expected not | |
2058 | * to be reused (freed soon). Exception is SwapCache, it's handled by | |
2059 | * special functions. | |
2060 | */ | |
b9c565d5 | 2061 | |
69029cd5 | 2062 | mz = page_cgroup_zoneinfo(pc); |
52d4b9ac | 2063 | unlock_page_cgroup(pc); |
fb59e9f1 | 2064 | |
4e649152 | 2065 | if (mem_cgroup_soft_limit_check(mem)) |
f64c3f54 | 2066 | mem_cgroup_update_tree(mem, page); |
a7fe942e KH |
2067 | /* at swapout, this memcg will be accessed to record to swap */ |
2068 | if (ctype != MEM_CGROUP_CHARGE_TYPE_SWAPOUT) | |
2069 | css_put(&mem->css); | |
6d12e2d8 | 2070 | |
8c7c6e34 | 2071 | return mem; |
d13d1443 KH |
2072 | |
2073 | unlock_out: | |
2074 | unlock_page_cgroup(pc); | |
8c7c6e34 | 2075 | return NULL; |
3c541e14 BS |
2076 | } |
2077 | ||
69029cd5 KH |
2078 | void mem_cgroup_uncharge_page(struct page *page) |
2079 | { | |
52d4b9ac KH |
2080 | /* early check. */ |
2081 | if (page_mapped(page)) | |
2082 | return; | |
2083 | if (page->mapping && !PageAnon(page)) | |
2084 | return; | |
69029cd5 KH |
2085 | __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_MAPPED); |
2086 | } | |
2087 | ||
2088 | void mem_cgroup_uncharge_cache_page(struct page *page) | |
2089 | { | |
2090 | VM_BUG_ON(page_mapped(page)); | |
b7abea96 | 2091 | VM_BUG_ON(page->mapping); |
69029cd5 KH |
2092 | __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_CACHE); |
2093 | } | |
2094 | ||
569b846d KH |
2095 | /* |
2096 | * Batch_start/batch_end is called in unmap_page_range/invlidate/trucate. | |
2097 | * In that cases, pages are freed continuously and we can expect pages | |
2098 | * are in the same memcg. All these calls itself limits the number of | |
2099 | * pages freed at once, then uncharge_start/end() is called properly. | |
2100 | * This may be called prural(2) times in a context, | |
2101 | */ | |
2102 | ||
2103 | void mem_cgroup_uncharge_start(void) | |
2104 | { | |
2105 | current->memcg_batch.do_batch++; | |
2106 | /* We can do nest. */ | |
2107 | if (current->memcg_batch.do_batch == 1) { | |
2108 | current->memcg_batch.memcg = NULL; | |
2109 | current->memcg_batch.bytes = 0; | |
2110 | current->memcg_batch.memsw_bytes = 0; | |
2111 | } | |
2112 | } | |
2113 | ||
2114 | void mem_cgroup_uncharge_end(void) | |
2115 | { | |
2116 | struct memcg_batch_info *batch = ¤t->memcg_batch; | |
2117 | ||
2118 | if (!batch->do_batch) | |
2119 | return; | |
2120 | ||
2121 | batch->do_batch--; | |
2122 | if (batch->do_batch) /* If stacked, do nothing. */ | |
2123 | return; | |
2124 | ||
2125 | if (!batch->memcg) | |
2126 | return; | |
2127 | /* | |
2128 | * This "batch->memcg" is valid without any css_get/put etc... | |
2129 | * bacause we hide charges behind us. | |
2130 | */ | |
2131 | if (batch->bytes) | |
2132 | res_counter_uncharge(&batch->memcg->res, batch->bytes); | |
2133 | if (batch->memsw_bytes) | |
2134 | res_counter_uncharge(&batch->memcg->memsw, batch->memsw_bytes); | |
2135 | /* forget this pointer (for sanity check) */ | |
2136 | batch->memcg = NULL; | |
2137 | } | |
2138 | ||
e767e056 | 2139 | #ifdef CONFIG_SWAP |
8c7c6e34 | 2140 | /* |
e767e056 | 2141 | * called after __delete_from_swap_cache() and drop "page" account. |
8c7c6e34 KH |
2142 | * memcg information is recorded to swap_cgroup of "ent" |
2143 | */ | |
8a9478ca KH |
2144 | void |
2145 | mem_cgroup_uncharge_swapcache(struct page *page, swp_entry_t ent, bool swapout) | |
8c7c6e34 KH |
2146 | { |
2147 | struct mem_cgroup *memcg; | |
8a9478ca KH |
2148 | int ctype = MEM_CGROUP_CHARGE_TYPE_SWAPOUT; |
2149 | ||
2150 | if (!swapout) /* this was a swap cache but the swap is unused ! */ | |
2151 | ctype = MEM_CGROUP_CHARGE_TYPE_DROP; | |
2152 | ||
2153 | memcg = __mem_cgroup_uncharge_common(page, ctype); | |
8c7c6e34 | 2154 | |
8c7c6e34 | 2155 | /* record memcg information */ |
8a9478ca | 2156 | if (do_swap_account && swapout && memcg) { |
a3b2d692 | 2157 | swap_cgroup_record(ent, css_id(&memcg->css)); |
8c7c6e34 KH |
2158 | mem_cgroup_get(memcg); |
2159 | } | |
8a9478ca | 2160 | if (swapout && memcg) |
a7fe942e | 2161 | css_put(&memcg->css); |
8c7c6e34 | 2162 | } |
e767e056 | 2163 | #endif |
8c7c6e34 KH |
2164 | |
2165 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP | |
2166 | /* | |
2167 | * called from swap_entry_free(). remove record in swap_cgroup and | |
2168 | * uncharge "memsw" account. | |
2169 | */ | |
2170 | void mem_cgroup_uncharge_swap(swp_entry_t ent) | |
d13d1443 | 2171 | { |
8c7c6e34 | 2172 | struct mem_cgroup *memcg; |
a3b2d692 | 2173 | unsigned short id; |
8c7c6e34 KH |
2174 | |
2175 | if (!do_swap_account) | |
2176 | return; | |
2177 | ||
a3b2d692 KH |
2178 | id = swap_cgroup_record(ent, 0); |
2179 | rcu_read_lock(); | |
2180 | memcg = mem_cgroup_lookup(id); | |
8c7c6e34 | 2181 | if (memcg) { |
a3b2d692 KH |
2182 | /* |
2183 | * We uncharge this because swap is freed. | |
2184 | * This memcg can be obsolete one. We avoid calling css_tryget | |
2185 | */ | |
0c3e73e8 | 2186 | if (!mem_cgroup_is_root(memcg)) |
4e649152 | 2187 | res_counter_uncharge(&memcg->memsw, PAGE_SIZE); |
0c3e73e8 | 2188 | mem_cgroup_swap_statistics(memcg, false); |
8c7c6e34 KH |
2189 | mem_cgroup_put(memcg); |
2190 | } | |
a3b2d692 | 2191 | rcu_read_unlock(); |
d13d1443 | 2192 | } |
8c7c6e34 | 2193 | #endif |
d13d1443 | 2194 | |
ae41be37 | 2195 | /* |
01b1ae63 KH |
2196 | * Before starting migration, account PAGE_SIZE to mem_cgroup that the old |
2197 | * page belongs to. | |
ae41be37 | 2198 | */ |
01b1ae63 | 2199 | int mem_cgroup_prepare_migration(struct page *page, struct mem_cgroup **ptr) |
ae41be37 KH |
2200 | { |
2201 | struct page_cgroup *pc; | |
e8589cc1 | 2202 | struct mem_cgroup *mem = NULL; |
e8589cc1 | 2203 | int ret = 0; |
8869b8f6 | 2204 | |
f8d66542 | 2205 | if (mem_cgroup_disabled()) |
4077960e BS |
2206 | return 0; |
2207 | ||
52d4b9ac KH |
2208 | pc = lookup_page_cgroup(page); |
2209 | lock_page_cgroup(pc); | |
2210 | if (PageCgroupUsed(pc)) { | |
e8589cc1 KH |
2211 | mem = pc->mem_cgroup; |
2212 | css_get(&mem->css); | |
e8589cc1 | 2213 | } |
52d4b9ac | 2214 | unlock_page_cgroup(pc); |
01b1ae63 | 2215 | |
e8589cc1 | 2216 | if (mem) { |
f64c3f54 BS |
2217 | ret = __mem_cgroup_try_charge(NULL, GFP_KERNEL, &mem, false, |
2218 | page); | |
e8589cc1 KH |
2219 | css_put(&mem->css); |
2220 | } | |
01b1ae63 | 2221 | *ptr = mem; |
e8589cc1 | 2222 | return ret; |
ae41be37 | 2223 | } |
8869b8f6 | 2224 | |
69029cd5 | 2225 | /* remove redundant charge if migration failed*/ |
01b1ae63 KH |
2226 | void mem_cgroup_end_migration(struct mem_cgroup *mem, |
2227 | struct page *oldpage, struct page *newpage) | |
ae41be37 | 2228 | { |
01b1ae63 KH |
2229 | struct page *target, *unused; |
2230 | struct page_cgroup *pc; | |
2231 | enum charge_type ctype; | |
2232 | ||
2233 | if (!mem) | |
2234 | return; | |
88703267 | 2235 | cgroup_exclude_rmdir(&mem->css); |
01b1ae63 KH |
2236 | /* at migration success, oldpage->mapping is NULL. */ |
2237 | if (oldpage->mapping) { | |
2238 | target = oldpage; | |
2239 | unused = NULL; | |
2240 | } else { | |
2241 | target = newpage; | |
2242 | unused = oldpage; | |
2243 | } | |
2244 | ||
2245 | if (PageAnon(target)) | |
2246 | ctype = MEM_CGROUP_CHARGE_TYPE_MAPPED; | |
2247 | else if (page_is_file_cache(target)) | |
2248 | ctype = MEM_CGROUP_CHARGE_TYPE_CACHE; | |
2249 | else | |
2250 | ctype = MEM_CGROUP_CHARGE_TYPE_SHMEM; | |
2251 | ||
2252 | /* unused page is not on radix-tree now. */ | |
d13d1443 | 2253 | if (unused) |
01b1ae63 KH |
2254 | __mem_cgroup_uncharge_common(unused, ctype); |
2255 | ||
2256 | pc = lookup_page_cgroup(target); | |
69029cd5 | 2257 | /* |
01b1ae63 KH |
2258 | * __mem_cgroup_commit_charge() check PCG_USED bit of page_cgroup. |
2259 | * So, double-counting is effectively avoided. | |
2260 | */ | |
2261 | __mem_cgroup_commit_charge(mem, pc, ctype); | |
2262 | ||
2263 | /* | |
2264 | * Both of oldpage and newpage are still under lock_page(). | |
2265 | * Then, we don't have to care about race in radix-tree. | |
2266 | * But we have to be careful that this page is unmapped or not. | |
2267 | * | |
2268 | * There is a case for !page_mapped(). At the start of | |
2269 | * migration, oldpage was mapped. But now, it's zapped. | |
2270 | * But we know *target* page is not freed/reused under us. | |
2271 | * mem_cgroup_uncharge_page() does all necessary checks. | |
69029cd5 | 2272 | */ |
01b1ae63 KH |
2273 | if (ctype == MEM_CGROUP_CHARGE_TYPE_MAPPED) |
2274 | mem_cgroup_uncharge_page(target); | |
88703267 KH |
2275 | /* |
2276 | * At migration, we may charge account against cgroup which has no tasks | |
2277 | * So, rmdir()->pre_destroy() can be called while we do this charge. | |
2278 | * In that case, we need to call pre_destroy() again. check it here. | |
2279 | */ | |
2280 | cgroup_release_and_wakeup_rmdir(&mem->css); | |
ae41be37 | 2281 | } |
78fb7466 | 2282 | |
c9b0ed51 | 2283 | /* |
ae3abae6 DN |
2284 | * A call to try to shrink memory usage on charge failure at shmem's swapin. |
2285 | * Calling hierarchical_reclaim is not enough because we should update | |
2286 | * last_oom_jiffies to prevent pagefault_out_of_memory from invoking global OOM. | |
2287 | * Moreover considering hierarchy, we should reclaim from the mem_over_limit, | |
2288 | * not from the memcg which this page would be charged to. | |
2289 | * try_charge_swapin does all of these works properly. | |
c9b0ed51 | 2290 | */ |
ae3abae6 | 2291 | int mem_cgroup_shmem_charge_fallback(struct page *page, |
b5a84319 KH |
2292 | struct mm_struct *mm, |
2293 | gfp_t gfp_mask) | |
c9b0ed51 | 2294 | { |
b5a84319 | 2295 | struct mem_cgroup *mem = NULL; |
ae3abae6 | 2296 | int ret; |
c9b0ed51 | 2297 | |
f8d66542 | 2298 | if (mem_cgroup_disabled()) |
cede86ac | 2299 | return 0; |
c9b0ed51 | 2300 | |
ae3abae6 DN |
2301 | ret = mem_cgroup_try_charge_swapin(mm, page, gfp_mask, &mem); |
2302 | if (!ret) | |
2303 | mem_cgroup_cancel_charge_swapin(mem); /* it does !mem check */ | |
c9b0ed51 | 2304 | |
ae3abae6 | 2305 | return ret; |
c9b0ed51 KH |
2306 | } |
2307 | ||
8c7c6e34 KH |
2308 | static DEFINE_MUTEX(set_limit_mutex); |
2309 | ||
d38d2a75 | 2310 | static int mem_cgroup_resize_limit(struct mem_cgroup *memcg, |
8c7c6e34 | 2311 | unsigned long long val) |
628f4235 | 2312 | { |
81d39c20 | 2313 | int retry_count; |
628f4235 | 2314 | int progress; |
8c7c6e34 | 2315 | u64 memswlimit; |
628f4235 | 2316 | int ret = 0; |
81d39c20 KH |
2317 | int children = mem_cgroup_count_children(memcg); |
2318 | u64 curusage, oldusage; | |
2319 | ||
2320 | /* | |
2321 | * For keeping hierarchical_reclaim simple, how long we should retry | |
2322 | * is depends on callers. We set our retry-count to be function | |
2323 | * of # of children which we should visit in this loop. | |
2324 | */ | |
2325 | retry_count = MEM_CGROUP_RECLAIM_RETRIES * children; | |
2326 | ||
2327 | oldusage = res_counter_read_u64(&memcg->res, RES_USAGE); | |
628f4235 | 2328 | |
8c7c6e34 | 2329 | while (retry_count) { |
628f4235 KH |
2330 | if (signal_pending(current)) { |
2331 | ret = -EINTR; | |
2332 | break; | |
2333 | } | |
8c7c6e34 KH |
2334 | /* |
2335 | * Rather than hide all in some function, I do this in | |
2336 | * open coded manner. You see what this really does. | |
2337 | * We have to guarantee mem->res.limit < mem->memsw.limit. | |
2338 | */ | |
2339 | mutex_lock(&set_limit_mutex); | |
2340 | memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT); | |
2341 | if (memswlimit < val) { | |
2342 | ret = -EINVAL; | |
2343 | mutex_unlock(&set_limit_mutex); | |
628f4235 KH |
2344 | break; |
2345 | } | |
8c7c6e34 | 2346 | ret = res_counter_set_limit(&memcg->res, val); |
22a668d7 KH |
2347 | if (!ret) { |
2348 | if (memswlimit == val) | |
2349 | memcg->memsw_is_minimum = true; | |
2350 | else | |
2351 | memcg->memsw_is_minimum = false; | |
2352 | } | |
8c7c6e34 KH |
2353 | mutex_unlock(&set_limit_mutex); |
2354 | ||
2355 | if (!ret) | |
2356 | break; | |
2357 | ||
4e416953 BS |
2358 | progress = mem_cgroup_hierarchical_reclaim(memcg, NULL, |
2359 | GFP_KERNEL, | |
2360 | MEM_CGROUP_RECLAIM_SHRINK); | |
81d39c20 KH |
2361 | curusage = res_counter_read_u64(&memcg->res, RES_USAGE); |
2362 | /* Usage is reduced ? */ | |
2363 | if (curusage >= oldusage) | |
2364 | retry_count--; | |
2365 | else | |
2366 | oldusage = curusage; | |
8c7c6e34 | 2367 | } |
14797e23 | 2368 | |
8c7c6e34 KH |
2369 | return ret; |
2370 | } | |
2371 | ||
338c8431 LZ |
2372 | static int mem_cgroup_resize_memsw_limit(struct mem_cgroup *memcg, |
2373 | unsigned long long val) | |
8c7c6e34 | 2374 | { |
81d39c20 | 2375 | int retry_count; |
8c7c6e34 | 2376 | u64 memlimit, oldusage, curusage; |
81d39c20 KH |
2377 | int children = mem_cgroup_count_children(memcg); |
2378 | int ret = -EBUSY; | |
8c7c6e34 | 2379 | |
81d39c20 KH |
2380 | /* see mem_cgroup_resize_res_limit */ |
2381 | retry_count = children * MEM_CGROUP_RECLAIM_RETRIES; | |
2382 | oldusage = res_counter_read_u64(&memcg->memsw, RES_USAGE); | |
8c7c6e34 KH |
2383 | while (retry_count) { |
2384 | if (signal_pending(current)) { | |
2385 | ret = -EINTR; | |
2386 | break; | |
2387 | } | |
2388 | /* | |
2389 | * Rather than hide all in some function, I do this in | |
2390 | * open coded manner. You see what this really does. | |
2391 | * We have to guarantee mem->res.limit < mem->memsw.limit. | |
2392 | */ | |
2393 | mutex_lock(&set_limit_mutex); | |
2394 | memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT); | |
2395 | if (memlimit > val) { | |
2396 | ret = -EINVAL; | |
2397 | mutex_unlock(&set_limit_mutex); | |
2398 | break; | |
2399 | } | |
2400 | ret = res_counter_set_limit(&memcg->memsw, val); | |
22a668d7 KH |
2401 | if (!ret) { |
2402 | if (memlimit == val) | |
2403 | memcg->memsw_is_minimum = true; | |
2404 | else | |
2405 | memcg->memsw_is_minimum = false; | |
2406 | } | |
8c7c6e34 KH |
2407 | mutex_unlock(&set_limit_mutex); |
2408 | ||
2409 | if (!ret) | |
2410 | break; | |
2411 | ||
4e416953 | 2412 | mem_cgroup_hierarchical_reclaim(memcg, NULL, GFP_KERNEL, |
75822b44 BS |
2413 | MEM_CGROUP_RECLAIM_NOSWAP | |
2414 | MEM_CGROUP_RECLAIM_SHRINK); | |
8c7c6e34 | 2415 | curusage = res_counter_read_u64(&memcg->memsw, RES_USAGE); |
81d39c20 | 2416 | /* Usage is reduced ? */ |
8c7c6e34 | 2417 | if (curusage >= oldusage) |
628f4235 | 2418 | retry_count--; |
81d39c20 KH |
2419 | else |
2420 | oldusage = curusage; | |
628f4235 KH |
2421 | } |
2422 | return ret; | |
2423 | } | |
2424 | ||
4e416953 BS |
2425 | unsigned long mem_cgroup_soft_limit_reclaim(struct zone *zone, int order, |
2426 | gfp_t gfp_mask, int nid, | |
2427 | int zid) | |
2428 | { | |
2429 | unsigned long nr_reclaimed = 0; | |
2430 | struct mem_cgroup_per_zone *mz, *next_mz = NULL; | |
2431 | unsigned long reclaimed; | |
2432 | int loop = 0; | |
2433 | struct mem_cgroup_tree_per_zone *mctz; | |
ef8745c1 | 2434 | unsigned long long excess; |
4e416953 BS |
2435 | |
2436 | if (order > 0) | |
2437 | return 0; | |
2438 | ||
2439 | mctz = soft_limit_tree_node_zone(nid, zid); | |
2440 | /* | |
2441 | * This loop can run a while, specially if mem_cgroup's continuously | |
2442 | * keep exceeding their soft limit and putting the system under | |
2443 | * pressure | |
2444 | */ | |
2445 | do { | |
2446 | if (next_mz) | |
2447 | mz = next_mz; | |
2448 | else | |
2449 | mz = mem_cgroup_largest_soft_limit_node(mctz); | |
2450 | if (!mz) | |
2451 | break; | |
2452 | ||
2453 | reclaimed = mem_cgroup_hierarchical_reclaim(mz->mem, zone, | |
2454 | gfp_mask, | |
2455 | MEM_CGROUP_RECLAIM_SOFT); | |
2456 | nr_reclaimed += reclaimed; | |
2457 | spin_lock(&mctz->lock); | |
2458 | ||
2459 | /* | |
2460 | * If we failed to reclaim anything from this memory cgroup | |
2461 | * it is time to move on to the next cgroup | |
2462 | */ | |
2463 | next_mz = NULL; | |
2464 | if (!reclaimed) { | |
2465 | do { | |
2466 | /* | |
2467 | * Loop until we find yet another one. | |
2468 | * | |
2469 | * By the time we get the soft_limit lock | |
2470 | * again, someone might have aded the | |
2471 | * group back on the RB tree. Iterate to | |
2472 | * make sure we get a different mem. | |
2473 | * mem_cgroup_largest_soft_limit_node returns | |
2474 | * NULL if no other cgroup is present on | |
2475 | * the tree | |
2476 | */ | |
2477 | next_mz = | |
2478 | __mem_cgroup_largest_soft_limit_node(mctz); | |
2479 | if (next_mz == mz) { | |
2480 | css_put(&next_mz->mem->css); | |
2481 | next_mz = NULL; | |
2482 | } else /* next_mz == NULL or other memcg */ | |
2483 | break; | |
2484 | } while (1); | |
2485 | } | |
4e416953 | 2486 | __mem_cgroup_remove_exceeded(mz->mem, mz, mctz); |
ef8745c1 | 2487 | excess = res_counter_soft_limit_excess(&mz->mem->res); |
4e416953 BS |
2488 | /* |
2489 | * One school of thought says that we should not add | |
2490 | * back the node to the tree if reclaim returns 0. | |
2491 | * But our reclaim could return 0, simply because due | |
2492 | * to priority we are exposing a smaller subset of | |
2493 | * memory to reclaim from. Consider this as a longer | |
2494 | * term TODO. | |
2495 | */ | |
ef8745c1 KH |
2496 | /* If excess == 0, no tree ops */ |
2497 | __mem_cgroup_insert_exceeded(mz->mem, mz, mctz, excess); | |
4e416953 BS |
2498 | spin_unlock(&mctz->lock); |
2499 | css_put(&mz->mem->css); | |
2500 | loop++; | |
2501 | /* | |
2502 | * Could not reclaim anything and there are no more | |
2503 | * mem cgroups to try or we seem to be looping without | |
2504 | * reclaiming anything. | |
2505 | */ | |
2506 | if (!nr_reclaimed && | |
2507 | (next_mz == NULL || | |
2508 | loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS)) | |
2509 | break; | |
2510 | } while (!nr_reclaimed); | |
2511 | if (next_mz) | |
2512 | css_put(&next_mz->mem->css); | |
2513 | return nr_reclaimed; | |
2514 | } | |
2515 | ||
cc847582 KH |
2516 | /* |
2517 | * This routine traverse page_cgroup in given list and drop them all. | |
cc847582 KH |
2518 | * *And* this routine doesn't reclaim page itself, just removes page_cgroup. |
2519 | */ | |
f817ed48 | 2520 | static int mem_cgroup_force_empty_list(struct mem_cgroup *mem, |
08e552c6 | 2521 | int node, int zid, enum lru_list lru) |
cc847582 | 2522 | { |
08e552c6 KH |
2523 | struct zone *zone; |
2524 | struct mem_cgroup_per_zone *mz; | |
f817ed48 | 2525 | struct page_cgroup *pc, *busy; |
08e552c6 | 2526 | unsigned long flags, loop; |
072c56c1 | 2527 | struct list_head *list; |
f817ed48 | 2528 | int ret = 0; |
072c56c1 | 2529 | |
08e552c6 KH |
2530 | zone = &NODE_DATA(node)->node_zones[zid]; |
2531 | mz = mem_cgroup_zoneinfo(mem, node, zid); | |
b69408e8 | 2532 | list = &mz->lists[lru]; |
cc847582 | 2533 | |
f817ed48 KH |
2534 | loop = MEM_CGROUP_ZSTAT(mz, lru); |
2535 | /* give some margin against EBUSY etc...*/ | |
2536 | loop += 256; | |
2537 | busy = NULL; | |
2538 | while (loop--) { | |
2539 | ret = 0; | |
08e552c6 | 2540 | spin_lock_irqsave(&zone->lru_lock, flags); |
f817ed48 | 2541 | if (list_empty(list)) { |
08e552c6 | 2542 | spin_unlock_irqrestore(&zone->lru_lock, flags); |
52d4b9ac | 2543 | break; |
f817ed48 KH |
2544 | } |
2545 | pc = list_entry(list->prev, struct page_cgroup, lru); | |
2546 | if (busy == pc) { | |
2547 | list_move(&pc->lru, list); | |
2548 | busy = 0; | |
08e552c6 | 2549 | spin_unlock_irqrestore(&zone->lru_lock, flags); |
f817ed48 KH |
2550 | continue; |
2551 | } | |
08e552c6 | 2552 | spin_unlock_irqrestore(&zone->lru_lock, flags); |
f817ed48 | 2553 | |
2c26fdd7 | 2554 | ret = mem_cgroup_move_parent(pc, mem, GFP_KERNEL); |
f817ed48 | 2555 | if (ret == -ENOMEM) |
52d4b9ac | 2556 | break; |
f817ed48 KH |
2557 | |
2558 | if (ret == -EBUSY || ret == -EINVAL) { | |
2559 | /* found lock contention or "pc" is obsolete. */ | |
2560 | busy = pc; | |
2561 | cond_resched(); | |
2562 | } else | |
2563 | busy = NULL; | |
cc847582 | 2564 | } |
08e552c6 | 2565 | |
f817ed48 KH |
2566 | if (!ret && !list_empty(list)) |
2567 | return -EBUSY; | |
2568 | return ret; | |
cc847582 KH |
2569 | } |
2570 | ||
2571 | /* | |
2572 | * make mem_cgroup's charge to be 0 if there is no task. | |
2573 | * This enables deleting this mem_cgroup. | |
2574 | */ | |
c1e862c1 | 2575 | static int mem_cgroup_force_empty(struct mem_cgroup *mem, bool free_all) |
cc847582 | 2576 | { |
f817ed48 KH |
2577 | int ret; |
2578 | int node, zid, shrink; | |
2579 | int nr_retries = MEM_CGROUP_RECLAIM_RETRIES; | |
c1e862c1 | 2580 | struct cgroup *cgrp = mem->css.cgroup; |
8869b8f6 | 2581 | |
cc847582 | 2582 | css_get(&mem->css); |
f817ed48 KH |
2583 | |
2584 | shrink = 0; | |
c1e862c1 KH |
2585 | /* should free all ? */ |
2586 | if (free_all) | |
2587 | goto try_to_free; | |
f817ed48 | 2588 | move_account: |
1ecaab2b | 2589 | while (mem->res.usage > 0) { |
f817ed48 | 2590 | ret = -EBUSY; |
c1e862c1 KH |
2591 | if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children)) |
2592 | goto out; | |
2593 | ret = -EINTR; | |
2594 | if (signal_pending(current)) | |
cc847582 | 2595 | goto out; |
52d4b9ac KH |
2596 | /* This is for making all *used* pages to be on LRU. */ |
2597 | lru_add_drain_all(); | |
cdec2e42 | 2598 | drain_all_stock_sync(); |
f817ed48 | 2599 | ret = 0; |
299b4eaa | 2600 | for_each_node_state(node, N_HIGH_MEMORY) { |
f817ed48 | 2601 | for (zid = 0; !ret && zid < MAX_NR_ZONES; zid++) { |
b69408e8 | 2602 | enum lru_list l; |
f817ed48 KH |
2603 | for_each_lru(l) { |
2604 | ret = mem_cgroup_force_empty_list(mem, | |
08e552c6 | 2605 | node, zid, l); |
f817ed48 KH |
2606 | if (ret) |
2607 | break; | |
2608 | } | |
1ecaab2b | 2609 | } |
f817ed48 KH |
2610 | if (ret) |
2611 | break; | |
2612 | } | |
2613 | /* it seems parent cgroup doesn't have enough mem */ | |
2614 | if (ret == -ENOMEM) | |
2615 | goto try_to_free; | |
52d4b9ac | 2616 | cond_resched(); |
cc847582 KH |
2617 | } |
2618 | ret = 0; | |
2619 | out: | |
2620 | css_put(&mem->css); | |
2621 | return ret; | |
f817ed48 KH |
2622 | |
2623 | try_to_free: | |
c1e862c1 KH |
2624 | /* returns EBUSY if there is a task or if we come here twice. */ |
2625 | if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children) || shrink) { | |
f817ed48 KH |
2626 | ret = -EBUSY; |
2627 | goto out; | |
2628 | } | |
c1e862c1 KH |
2629 | /* we call try-to-free pages for make this cgroup empty */ |
2630 | lru_add_drain_all(); | |
f817ed48 KH |
2631 | /* try to free all pages in this cgroup */ |
2632 | shrink = 1; | |
2633 | while (nr_retries && mem->res.usage > 0) { | |
2634 | int progress; | |
c1e862c1 KH |
2635 | |
2636 | if (signal_pending(current)) { | |
2637 | ret = -EINTR; | |
2638 | goto out; | |
2639 | } | |
a7885eb8 KM |
2640 | progress = try_to_free_mem_cgroup_pages(mem, GFP_KERNEL, |
2641 | false, get_swappiness(mem)); | |
c1e862c1 | 2642 | if (!progress) { |
f817ed48 | 2643 | nr_retries--; |
c1e862c1 | 2644 | /* maybe some writeback is necessary */ |
8aa7e847 | 2645 | congestion_wait(BLK_RW_ASYNC, HZ/10); |
c1e862c1 | 2646 | } |
f817ed48 KH |
2647 | |
2648 | } | |
08e552c6 | 2649 | lru_add_drain(); |
f817ed48 KH |
2650 | /* try move_account...there may be some *locked* pages. */ |
2651 | if (mem->res.usage) | |
2652 | goto move_account; | |
2653 | ret = 0; | |
2654 | goto out; | |
cc847582 KH |
2655 | } |
2656 | ||
c1e862c1 KH |
2657 | int mem_cgroup_force_empty_write(struct cgroup *cont, unsigned int event) |
2658 | { | |
2659 | return mem_cgroup_force_empty(mem_cgroup_from_cont(cont), true); | |
2660 | } | |
2661 | ||
2662 | ||
18f59ea7 BS |
2663 | static u64 mem_cgroup_hierarchy_read(struct cgroup *cont, struct cftype *cft) |
2664 | { | |
2665 | return mem_cgroup_from_cont(cont)->use_hierarchy; | |
2666 | } | |
2667 | ||
2668 | static int mem_cgroup_hierarchy_write(struct cgroup *cont, struct cftype *cft, | |
2669 | u64 val) | |
2670 | { | |
2671 | int retval = 0; | |
2672 | struct mem_cgroup *mem = mem_cgroup_from_cont(cont); | |
2673 | struct cgroup *parent = cont->parent; | |
2674 | struct mem_cgroup *parent_mem = NULL; | |
2675 | ||
2676 | if (parent) | |
2677 | parent_mem = mem_cgroup_from_cont(parent); | |
2678 | ||
2679 | cgroup_lock(); | |
2680 | /* | |
af901ca1 | 2681 | * If parent's use_hierarchy is set, we can't make any modifications |
18f59ea7 BS |
2682 | * in the child subtrees. If it is unset, then the change can |
2683 | * occur, provided the current cgroup has no children. | |
2684 | * | |
2685 | * For the root cgroup, parent_mem is NULL, we allow value to be | |
2686 | * set if there are no children. | |
2687 | */ | |
2688 | if ((!parent_mem || !parent_mem->use_hierarchy) && | |
2689 | (val == 1 || val == 0)) { | |
2690 | if (list_empty(&cont->children)) | |
2691 | mem->use_hierarchy = val; | |
2692 | else | |
2693 | retval = -EBUSY; | |
2694 | } else | |
2695 | retval = -EINVAL; | |
2696 | cgroup_unlock(); | |
2697 | ||
2698 | return retval; | |
2699 | } | |
2700 | ||
0c3e73e8 BS |
2701 | struct mem_cgroup_idx_data { |
2702 | s64 val; | |
2703 | enum mem_cgroup_stat_index idx; | |
2704 | }; | |
2705 | ||
2706 | static int | |
2707 | mem_cgroup_get_idx_stat(struct mem_cgroup *mem, void *data) | |
2708 | { | |
2709 | struct mem_cgroup_idx_data *d = data; | |
2710 | d->val += mem_cgroup_read_stat(&mem->stat, d->idx); | |
2711 | return 0; | |
2712 | } | |
2713 | ||
2714 | static void | |
2715 | mem_cgroup_get_recursive_idx_stat(struct mem_cgroup *mem, | |
2716 | enum mem_cgroup_stat_index idx, s64 *val) | |
2717 | { | |
2718 | struct mem_cgroup_idx_data d; | |
2719 | d.idx = idx; | |
2720 | d.val = 0; | |
2721 | mem_cgroup_walk_tree(mem, &d, mem_cgroup_get_idx_stat); | |
2722 | *val = d.val; | |
2723 | } | |
2724 | ||
2c3daa72 | 2725 | static u64 mem_cgroup_read(struct cgroup *cont, struct cftype *cft) |
8cdea7c0 | 2726 | { |
8c7c6e34 | 2727 | struct mem_cgroup *mem = mem_cgroup_from_cont(cont); |
0c3e73e8 | 2728 | u64 idx_val, val; |
8c7c6e34 KH |
2729 | int type, name; |
2730 | ||
2731 | type = MEMFILE_TYPE(cft->private); | |
2732 | name = MEMFILE_ATTR(cft->private); | |
2733 | switch (type) { | |
2734 | case _MEM: | |
0c3e73e8 BS |
2735 | if (name == RES_USAGE && mem_cgroup_is_root(mem)) { |
2736 | mem_cgroup_get_recursive_idx_stat(mem, | |
2737 | MEM_CGROUP_STAT_CACHE, &idx_val); | |
2738 | val = idx_val; | |
2739 | mem_cgroup_get_recursive_idx_stat(mem, | |
2740 | MEM_CGROUP_STAT_RSS, &idx_val); | |
2741 | val += idx_val; | |
2742 | val <<= PAGE_SHIFT; | |
2743 | } else | |
2744 | val = res_counter_read_u64(&mem->res, name); | |
8c7c6e34 KH |
2745 | break; |
2746 | case _MEMSWAP: | |
0c3e73e8 BS |
2747 | if (name == RES_USAGE && mem_cgroup_is_root(mem)) { |
2748 | mem_cgroup_get_recursive_idx_stat(mem, | |
2749 | MEM_CGROUP_STAT_CACHE, &idx_val); | |
2750 | val = idx_val; | |
2751 | mem_cgroup_get_recursive_idx_stat(mem, | |
2752 | MEM_CGROUP_STAT_RSS, &idx_val); | |
2753 | val += idx_val; | |
2754 | mem_cgroup_get_recursive_idx_stat(mem, | |
2755 | MEM_CGROUP_STAT_SWAPOUT, &idx_val); | |
cd9b45b7 | 2756 | val += idx_val; |
0c3e73e8 BS |
2757 | val <<= PAGE_SHIFT; |
2758 | } else | |
2759 | val = res_counter_read_u64(&mem->memsw, name); | |
8c7c6e34 KH |
2760 | break; |
2761 | default: | |
2762 | BUG(); | |
2763 | break; | |
2764 | } | |
2765 | return val; | |
8cdea7c0 | 2766 | } |
628f4235 KH |
2767 | /* |
2768 | * The user of this function is... | |
2769 | * RES_LIMIT. | |
2770 | */ | |
856c13aa PM |
2771 | static int mem_cgroup_write(struct cgroup *cont, struct cftype *cft, |
2772 | const char *buffer) | |
8cdea7c0 | 2773 | { |
628f4235 | 2774 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
8c7c6e34 | 2775 | int type, name; |
628f4235 KH |
2776 | unsigned long long val; |
2777 | int ret; | |
2778 | ||
8c7c6e34 KH |
2779 | type = MEMFILE_TYPE(cft->private); |
2780 | name = MEMFILE_ATTR(cft->private); | |
2781 | switch (name) { | |
628f4235 | 2782 | case RES_LIMIT: |
4b3bde4c BS |
2783 | if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */ |
2784 | ret = -EINVAL; | |
2785 | break; | |
2786 | } | |
628f4235 KH |
2787 | /* This function does all necessary parse...reuse it */ |
2788 | ret = res_counter_memparse_write_strategy(buffer, &val); | |
8c7c6e34 KH |
2789 | if (ret) |
2790 | break; | |
2791 | if (type == _MEM) | |
628f4235 | 2792 | ret = mem_cgroup_resize_limit(memcg, val); |
8c7c6e34 KH |
2793 | else |
2794 | ret = mem_cgroup_resize_memsw_limit(memcg, val); | |
628f4235 | 2795 | break; |
296c81d8 BS |
2796 | case RES_SOFT_LIMIT: |
2797 | ret = res_counter_memparse_write_strategy(buffer, &val); | |
2798 | if (ret) | |
2799 | break; | |
2800 | /* | |
2801 | * For memsw, soft limits are hard to implement in terms | |
2802 | * of semantics, for now, we support soft limits for | |
2803 | * control without swap | |
2804 | */ | |
2805 | if (type == _MEM) | |
2806 | ret = res_counter_set_soft_limit(&memcg->res, val); | |
2807 | else | |
2808 | ret = -EINVAL; | |
2809 | break; | |
628f4235 KH |
2810 | default: |
2811 | ret = -EINVAL; /* should be BUG() ? */ | |
2812 | break; | |
2813 | } | |
2814 | return ret; | |
8cdea7c0 BS |
2815 | } |
2816 | ||
fee7b548 KH |
2817 | static void memcg_get_hierarchical_limit(struct mem_cgroup *memcg, |
2818 | unsigned long long *mem_limit, unsigned long long *memsw_limit) | |
2819 | { | |
2820 | struct cgroup *cgroup; | |
2821 | unsigned long long min_limit, min_memsw_limit, tmp; | |
2822 | ||
2823 | min_limit = res_counter_read_u64(&memcg->res, RES_LIMIT); | |
2824 | min_memsw_limit = res_counter_read_u64(&memcg->memsw, RES_LIMIT); | |
2825 | cgroup = memcg->css.cgroup; | |
2826 | if (!memcg->use_hierarchy) | |
2827 | goto out; | |
2828 | ||
2829 | while (cgroup->parent) { | |
2830 | cgroup = cgroup->parent; | |
2831 | memcg = mem_cgroup_from_cont(cgroup); | |
2832 | if (!memcg->use_hierarchy) | |
2833 | break; | |
2834 | tmp = res_counter_read_u64(&memcg->res, RES_LIMIT); | |
2835 | min_limit = min(min_limit, tmp); | |
2836 | tmp = res_counter_read_u64(&memcg->memsw, RES_LIMIT); | |
2837 | min_memsw_limit = min(min_memsw_limit, tmp); | |
2838 | } | |
2839 | out: | |
2840 | *mem_limit = min_limit; | |
2841 | *memsw_limit = min_memsw_limit; | |
2842 | return; | |
2843 | } | |
2844 | ||
29f2a4da | 2845 | static int mem_cgroup_reset(struct cgroup *cont, unsigned int event) |
c84872e1 PE |
2846 | { |
2847 | struct mem_cgroup *mem; | |
8c7c6e34 | 2848 | int type, name; |
c84872e1 PE |
2849 | |
2850 | mem = mem_cgroup_from_cont(cont); | |
8c7c6e34 KH |
2851 | type = MEMFILE_TYPE(event); |
2852 | name = MEMFILE_ATTR(event); | |
2853 | switch (name) { | |
29f2a4da | 2854 | case RES_MAX_USAGE: |
8c7c6e34 KH |
2855 | if (type == _MEM) |
2856 | res_counter_reset_max(&mem->res); | |
2857 | else | |
2858 | res_counter_reset_max(&mem->memsw); | |
29f2a4da PE |
2859 | break; |
2860 | case RES_FAILCNT: | |
8c7c6e34 KH |
2861 | if (type == _MEM) |
2862 | res_counter_reset_failcnt(&mem->res); | |
2863 | else | |
2864 | res_counter_reset_failcnt(&mem->memsw); | |
29f2a4da PE |
2865 | break; |
2866 | } | |
f64c3f54 | 2867 | |
85cc59db | 2868 | return 0; |
c84872e1 PE |
2869 | } |
2870 | ||
14067bb3 KH |
2871 | |
2872 | /* For read statistics */ | |
2873 | enum { | |
2874 | MCS_CACHE, | |
2875 | MCS_RSS, | |
d8046582 | 2876 | MCS_FILE_MAPPED, |
14067bb3 KH |
2877 | MCS_PGPGIN, |
2878 | MCS_PGPGOUT, | |
1dd3a273 | 2879 | MCS_SWAP, |
14067bb3 KH |
2880 | MCS_INACTIVE_ANON, |
2881 | MCS_ACTIVE_ANON, | |
2882 | MCS_INACTIVE_FILE, | |
2883 | MCS_ACTIVE_FILE, | |
2884 | MCS_UNEVICTABLE, | |
2885 | NR_MCS_STAT, | |
2886 | }; | |
2887 | ||
2888 | struct mcs_total_stat { | |
2889 | s64 stat[NR_MCS_STAT]; | |
d2ceb9b7 KH |
2890 | }; |
2891 | ||
14067bb3 KH |
2892 | struct { |
2893 | char *local_name; | |
2894 | char *total_name; | |
2895 | } memcg_stat_strings[NR_MCS_STAT] = { | |
2896 | {"cache", "total_cache"}, | |
2897 | {"rss", "total_rss"}, | |
d69b042f | 2898 | {"mapped_file", "total_mapped_file"}, |
14067bb3 KH |
2899 | {"pgpgin", "total_pgpgin"}, |
2900 | {"pgpgout", "total_pgpgout"}, | |
1dd3a273 | 2901 | {"swap", "total_swap"}, |
14067bb3 KH |
2902 | {"inactive_anon", "total_inactive_anon"}, |
2903 | {"active_anon", "total_active_anon"}, | |
2904 | {"inactive_file", "total_inactive_file"}, | |
2905 | {"active_file", "total_active_file"}, | |
2906 | {"unevictable", "total_unevictable"} | |
2907 | }; | |
2908 | ||
2909 | ||
2910 | static int mem_cgroup_get_local_stat(struct mem_cgroup *mem, void *data) | |
2911 | { | |
2912 | struct mcs_total_stat *s = data; | |
2913 | s64 val; | |
2914 | ||
2915 | /* per cpu stat */ | |
2916 | val = mem_cgroup_read_stat(&mem->stat, MEM_CGROUP_STAT_CACHE); | |
2917 | s->stat[MCS_CACHE] += val * PAGE_SIZE; | |
2918 | val = mem_cgroup_read_stat(&mem->stat, MEM_CGROUP_STAT_RSS); | |
2919 | s->stat[MCS_RSS] += val * PAGE_SIZE; | |
d8046582 KH |
2920 | val = mem_cgroup_read_stat(&mem->stat, MEM_CGROUP_STAT_FILE_MAPPED); |
2921 | s->stat[MCS_FILE_MAPPED] += val * PAGE_SIZE; | |
14067bb3 KH |
2922 | val = mem_cgroup_read_stat(&mem->stat, MEM_CGROUP_STAT_PGPGIN_COUNT); |
2923 | s->stat[MCS_PGPGIN] += val; | |
2924 | val = mem_cgroup_read_stat(&mem->stat, MEM_CGROUP_STAT_PGPGOUT_COUNT); | |
2925 | s->stat[MCS_PGPGOUT] += val; | |
1dd3a273 DN |
2926 | if (do_swap_account) { |
2927 | val = mem_cgroup_read_stat(&mem->stat, MEM_CGROUP_STAT_SWAPOUT); | |
2928 | s->stat[MCS_SWAP] += val * PAGE_SIZE; | |
2929 | } | |
14067bb3 KH |
2930 | |
2931 | /* per zone stat */ | |
2932 | val = mem_cgroup_get_local_zonestat(mem, LRU_INACTIVE_ANON); | |
2933 | s->stat[MCS_INACTIVE_ANON] += val * PAGE_SIZE; | |
2934 | val = mem_cgroup_get_local_zonestat(mem, LRU_ACTIVE_ANON); | |
2935 | s->stat[MCS_ACTIVE_ANON] += val * PAGE_SIZE; | |
2936 | val = mem_cgroup_get_local_zonestat(mem, LRU_INACTIVE_FILE); | |
2937 | s->stat[MCS_INACTIVE_FILE] += val * PAGE_SIZE; | |
2938 | val = mem_cgroup_get_local_zonestat(mem, LRU_ACTIVE_FILE); | |
2939 | s->stat[MCS_ACTIVE_FILE] += val * PAGE_SIZE; | |
2940 | val = mem_cgroup_get_local_zonestat(mem, LRU_UNEVICTABLE); | |
2941 | s->stat[MCS_UNEVICTABLE] += val * PAGE_SIZE; | |
2942 | return 0; | |
2943 | } | |
2944 | ||
2945 | static void | |
2946 | mem_cgroup_get_total_stat(struct mem_cgroup *mem, struct mcs_total_stat *s) | |
2947 | { | |
2948 | mem_cgroup_walk_tree(mem, s, mem_cgroup_get_local_stat); | |
2949 | } | |
2950 | ||
c64745cf PM |
2951 | static int mem_control_stat_show(struct cgroup *cont, struct cftype *cft, |
2952 | struct cgroup_map_cb *cb) | |
d2ceb9b7 | 2953 | { |
d2ceb9b7 | 2954 | struct mem_cgroup *mem_cont = mem_cgroup_from_cont(cont); |
14067bb3 | 2955 | struct mcs_total_stat mystat; |
d2ceb9b7 KH |
2956 | int i; |
2957 | ||
14067bb3 KH |
2958 | memset(&mystat, 0, sizeof(mystat)); |
2959 | mem_cgroup_get_local_stat(mem_cont, &mystat); | |
d2ceb9b7 | 2960 | |
1dd3a273 DN |
2961 | for (i = 0; i < NR_MCS_STAT; i++) { |
2962 | if (i == MCS_SWAP && !do_swap_account) | |
2963 | continue; | |
14067bb3 | 2964 | cb->fill(cb, memcg_stat_strings[i].local_name, mystat.stat[i]); |
1dd3a273 | 2965 | } |
7b854121 | 2966 | |
14067bb3 | 2967 | /* Hierarchical information */ |
fee7b548 KH |
2968 | { |
2969 | unsigned long long limit, memsw_limit; | |
2970 | memcg_get_hierarchical_limit(mem_cont, &limit, &memsw_limit); | |
2971 | cb->fill(cb, "hierarchical_memory_limit", limit); | |
2972 | if (do_swap_account) | |
2973 | cb->fill(cb, "hierarchical_memsw_limit", memsw_limit); | |
2974 | } | |
7f016ee8 | 2975 | |
14067bb3 KH |
2976 | memset(&mystat, 0, sizeof(mystat)); |
2977 | mem_cgroup_get_total_stat(mem_cont, &mystat); | |
1dd3a273 DN |
2978 | for (i = 0; i < NR_MCS_STAT; i++) { |
2979 | if (i == MCS_SWAP && !do_swap_account) | |
2980 | continue; | |
14067bb3 | 2981 | cb->fill(cb, memcg_stat_strings[i].total_name, mystat.stat[i]); |
1dd3a273 | 2982 | } |
14067bb3 | 2983 | |
7f016ee8 | 2984 | #ifdef CONFIG_DEBUG_VM |
c772be93 | 2985 | cb->fill(cb, "inactive_ratio", calc_inactive_ratio(mem_cont, NULL)); |
7f016ee8 KM |
2986 | |
2987 | { | |
2988 | int nid, zid; | |
2989 | struct mem_cgroup_per_zone *mz; | |
2990 | unsigned long recent_rotated[2] = {0, 0}; | |
2991 | unsigned long recent_scanned[2] = {0, 0}; | |
2992 | ||
2993 | for_each_online_node(nid) | |
2994 | for (zid = 0; zid < MAX_NR_ZONES; zid++) { | |
2995 | mz = mem_cgroup_zoneinfo(mem_cont, nid, zid); | |
2996 | ||
2997 | recent_rotated[0] += | |
2998 | mz->reclaim_stat.recent_rotated[0]; | |
2999 | recent_rotated[1] += | |
3000 | mz->reclaim_stat.recent_rotated[1]; | |
3001 | recent_scanned[0] += | |
3002 | mz->reclaim_stat.recent_scanned[0]; | |
3003 | recent_scanned[1] += | |
3004 | mz->reclaim_stat.recent_scanned[1]; | |
3005 | } | |
3006 | cb->fill(cb, "recent_rotated_anon", recent_rotated[0]); | |
3007 | cb->fill(cb, "recent_rotated_file", recent_rotated[1]); | |
3008 | cb->fill(cb, "recent_scanned_anon", recent_scanned[0]); | |
3009 | cb->fill(cb, "recent_scanned_file", recent_scanned[1]); | |
3010 | } | |
3011 | #endif | |
3012 | ||
d2ceb9b7 KH |
3013 | return 0; |
3014 | } | |
3015 | ||
a7885eb8 KM |
3016 | static u64 mem_cgroup_swappiness_read(struct cgroup *cgrp, struct cftype *cft) |
3017 | { | |
3018 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); | |
3019 | ||
3020 | return get_swappiness(memcg); | |
3021 | } | |
3022 | ||
3023 | static int mem_cgroup_swappiness_write(struct cgroup *cgrp, struct cftype *cft, | |
3024 | u64 val) | |
3025 | { | |
3026 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); | |
3027 | struct mem_cgroup *parent; | |
068b38c1 | 3028 | |
a7885eb8 KM |
3029 | if (val > 100) |
3030 | return -EINVAL; | |
3031 | ||
3032 | if (cgrp->parent == NULL) | |
3033 | return -EINVAL; | |
3034 | ||
3035 | parent = mem_cgroup_from_cont(cgrp->parent); | |
068b38c1 LZ |
3036 | |
3037 | cgroup_lock(); | |
3038 | ||
a7885eb8 KM |
3039 | /* If under hierarchy, only empty-root can set this value */ |
3040 | if ((parent->use_hierarchy) || | |
068b38c1 LZ |
3041 | (memcg->use_hierarchy && !list_empty(&cgrp->children))) { |
3042 | cgroup_unlock(); | |
a7885eb8 | 3043 | return -EINVAL; |
068b38c1 | 3044 | } |
a7885eb8 KM |
3045 | |
3046 | spin_lock(&memcg->reclaim_param_lock); | |
3047 | memcg->swappiness = val; | |
3048 | spin_unlock(&memcg->reclaim_param_lock); | |
3049 | ||
068b38c1 LZ |
3050 | cgroup_unlock(); |
3051 | ||
a7885eb8 KM |
3052 | return 0; |
3053 | } | |
3054 | ||
c1e862c1 | 3055 | |
8cdea7c0 BS |
3056 | static struct cftype mem_cgroup_files[] = { |
3057 | { | |
0eea1030 | 3058 | .name = "usage_in_bytes", |
8c7c6e34 | 3059 | .private = MEMFILE_PRIVATE(_MEM, RES_USAGE), |
2c3daa72 | 3060 | .read_u64 = mem_cgroup_read, |
8cdea7c0 | 3061 | }, |
c84872e1 PE |
3062 | { |
3063 | .name = "max_usage_in_bytes", | |
8c7c6e34 | 3064 | .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE), |
29f2a4da | 3065 | .trigger = mem_cgroup_reset, |
c84872e1 PE |
3066 | .read_u64 = mem_cgroup_read, |
3067 | }, | |
8cdea7c0 | 3068 | { |
0eea1030 | 3069 | .name = "limit_in_bytes", |
8c7c6e34 | 3070 | .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT), |
856c13aa | 3071 | .write_string = mem_cgroup_write, |
2c3daa72 | 3072 | .read_u64 = mem_cgroup_read, |
8cdea7c0 | 3073 | }, |
296c81d8 BS |
3074 | { |
3075 | .name = "soft_limit_in_bytes", | |
3076 | .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT), | |
3077 | .write_string = mem_cgroup_write, | |
3078 | .read_u64 = mem_cgroup_read, | |
3079 | }, | |
8cdea7c0 BS |
3080 | { |
3081 | .name = "failcnt", | |
8c7c6e34 | 3082 | .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT), |
29f2a4da | 3083 | .trigger = mem_cgroup_reset, |
2c3daa72 | 3084 | .read_u64 = mem_cgroup_read, |
8cdea7c0 | 3085 | }, |
d2ceb9b7 KH |
3086 | { |
3087 | .name = "stat", | |
c64745cf | 3088 | .read_map = mem_control_stat_show, |
d2ceb9b7 | 3089 | }, |
c1e862c1 KH |
3090 | { |
3091 | .name = "force_empty", | |
3092 | .trigger = mem_cgroup_force_empty_write, | |
3093 | }, | |
18f59ea7 BS |
3094 | { |
3095 | .name = "use_hierarchy", | |
3096 | .write_u64 = mem_cgroup_hierarchy_write, | |
3097 | .read_u64 = mem_cgroup_hierarchy_read, | |
3098 | }, | |
a7885eb8 KM |
3099 | { |
3100 | .name = "swappiness", | |
3101 | .read_u64 = mem_cgroup_swappiness_read, | |
3102 | .write_u64 = mem_cgroup_swappiness_write, | |
3103 | }, | |
8cdea7c0 BS |
3104 | }; |
3105 | ||
8c7c6e34 KH |
3106 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP |
3107 | static struct cftype memsw_cgroup_files[] = { | |
3108 | { | |
3109 | .name = "memsw.usage_in_bytes", | |
3110 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE), | |
3111 | .read_u64 = mem_cgroup_read, | |
3112 | }, | |
3113 | { | |
3114 | .name = "memsw.max_usage_in_bytes", | |
3115 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE), | |
3116 | .trigger = mem_cgroup_reset, | |
3117 | .read_u64 = mem_cgroup_read, | |
3118 | }, | |
3119 | { | |
3120 | .name = "memsw.limit_in_bytes", | |
3121 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT), | |
3122 | .write_string = mem_cgroup_write, | |
3123 | .read_u64 = mem_cgroup_read, | |
3124 | }, | |
3125 | { | |
3126 | .name = "memsw.failcnt", | |
3127 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT), | |
3128 | .trigger = mem_cgroup_reset, | |
3129 | .read_u64 = mem_cgroup_read, | |
3130 | }, | |
3131 | }; | |
3132 | ||
3133 | static int register_memsw_files(struct cgroup *cont, struct cgroup_subsys *ss) | |
3134 | { | |
3135 | if (!do_swap_account) | |
3136 | return 0; | |
3137 | return cgroup_add_files(cont, ss, memsw_cgroup_files, | |
3138 | ARRAY_SIZE(memsw_cgroup_files)); | |
3139 | }; | |
3140 | #else | |
3141 | static int register_memsw_files(struct cgroup *cont, struct cgroup_subsys *ss) | |
3142 | { | |
3143 | return 0; | |
3144 | } | |
3145 | #endif | |
3146 | ||
6d12e2d8 KH |
3147 | static int alloc_mem_cgroup_per_zone_info(struct mem_cgroup *mem, int node) |
3148 | { | |
3149 | struct mem_cgroup_per_node *pn; | |
1ecaab2b | 3150 | struct mem_cgroup_per_zone *mz; |
b69408e8 | 3151 | enum lru_list l; |
41e3355d | 3152 | int zone, tmp = node; |
1ecaab2b KH |
3153 | /* |
3154 | * This routine is called against possible nodes. | |
3155 | * But it's BUG to call kmalloc() against offline node. | |
3156 | * | |
3157 | * TODO: this routine can waste much memory for nodes which will | |
3158 | * never be onlined. It's better to use memory hotplug callback | |
3159 | * function. | |
3160 | */ | |
41e3355d KH |
3161 | if (!node_state(node, N_NORMAL_MEMORY)) |
3162 | tmp = -1; | |
3163 | pn = kmalloc_node(sizeof(*pn), GFP_KERNEL, tmp); | |
6d12e2d8 KH |
3164 | if (!pn) |
3165 | return 1; | |
1ecaab2b | 3166 | |
6d12e2d8 KH |
3167 | mem->info.nodeinfo[node] = pn; |
3168 | memset(pn, 0, sizeof(*pn)); | |
1ecaab2b KH |
3169 | |
3170 | for (zone = 0; zone < MAX_NR_ZONES; zone++) { | |
3171 | mz = &pn->zoneinfo[zone]; | |
b69408e8 CL |
3172 | for_each_lru(l) |
3173 | INIT_LIST_HEAD(&mz->lists[l]); | |
f64c3f54 | 3174 | mz->usage_in_excess = 0; |
4e416953 BS |
3175 | mz->on_tree = false; |
3176 | mz->mem = mem; | |
1ecaab2b | 3177 | } |
6d12e2d8 KH |
3178 | return 0; |
3179 | } | |
3180 | ||
1ecaab2b KH |
3181 | static void free_mem_cgroup_per_zone_info(struct mem_cgroup *mem, int node) |
3182 | { | |
3183 | kfree(mem->info.nodeinfo[node]); | |
3184 | } | |
3185 | ||
c8dad2bb JB |
3186 | static int mem_cgroup_size(void) |
3187 | { | |
3188 | int cpustat_size = nr_cpu_ids * sizeof(struct mem_cgroup_stat_cpu); | |
3189 | return sizeof(struct mem_cgroup) + cpustat_size; | |
3190 | } | |
3191 | ||
33327948 KH |
3192 | static struct mem_cgroup *mem_cgroup_alloc(void) |
3193 | { | |
3194 | struct mem_cgroup *mem; | |
c8dad2bb | 3195 | int size = mem_cgroup_size(); |
33327948 | 3196 | |
c8dad2bb JB |
3197 | if (size < PAGE_SIZE) |
3198 | mem = kmalloc(size, GFP_KERNEL); | |
33327948 | 3199 | else |
c8dad2bb | 3200 | mem = vmalloc(size); |
33327948 KH |
3201 | |
3202 | if (mem) | |
c8dad2bb | 3203 | memset(mem, 0, size); |
33327948 KH |
3204 | return mem; |
3205 | } | |
3206 | ||
8c7c6e34 KH |
3207 | /* |
3208 | * At destroying mem_cgroup, references from swap_cgroup can remain. | |
3209 | * (scanning all at force_empty is too costly...) | |
3210 | * | |
3211 | * Instead of clearing all references at force_empty, we remember | |
3212 | * the number of reference from swap_cgroup and free mem_cgroup when | |
3213 | * it goes down to 0. | |
3214 | * | |
8c7c6e34 KH |
3215 | * Removal of cgroup itself succeeds regardless of refs from swap. |
3216 | */ | |
3217 | ||
a7ba0eef | 3218 | static void __mem_cgroup_free(struct mem_cgroup *mem) |
33327948 | 3219 | { |
08e552c6 KH |
3220 | int node; |
3221 | ||
f64c3f54 | 3222 | mem_cgroup_remove_from_trees(mem); |
04046e1a KH |
3223 | free_css_id(&mem_cgroup_subsys, &mem->css); |
3224 | ||
08e552c6 KH |
3225 | for_each_node_state(node, N_POSSIBLE) |
3226 | free_mem_cgroup_per_zone_info(mem, node); | |
3227 | ||
c8dad2bb | 3228 | if (mem_cgroup_size() < PAGE_SIZE) |
33327948 KH |
3229 | kfree(mem); |
3230 | else | |
3231 | vfree(mem); | |
3232 | } | |
3233 | ||
8c7c6e34 KH |
3234 | static void mem_cgroup_get(struct mem_cgroup *mem) |
3235 | { | |
3236 | atomic_inc(&mem->refcnt); | |
3237 | } | |
3238 | ||
3239 | static void mem_cgroup_put(struct mem_cgroup *mem) | |
3240 | { | |
7bcc1bb1 DN |
3241 | if (atomic_dec_and_test(&mem->refcnt)) { |
3242 | struct mem_cgroup *parent = parent_mem_cgroup(mem); | |
a7ba0eef | 3243 | __mem_cgroup_free(mem); |
7bcc1bb1 DN |
3244 | if (parent) |
3245 | mem_cgroup_put(parent); | |
3246 | } | |
8c7c6e34 KH |
3247 | } |
3248 | ||
7bcc1bb1 DN |
3249 | /* |
3250 | * Returns the parent mem_cgroup in memcgroup hierarchy with hierarchy enabled. | |
3251 | */ | |
3252 | static struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *mem) | |
3253 | { | |
3254 | if (!mem->res.parent) | |
3255 | return NULL; | |
3256 | return mem_cgroup_from_res_counter(mem->res.parent, res); | |
3257 | } | |
33327948 | 3258 | |
c077719b KH |
3259 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP |
3260 | static void __init enable_swap_cgroup(void) | |
3261 | { | |
f8d66542 | 3262 | if (!mem_cgroup_disabled() && really_do_swap_account) |
c077719b KH |
3263 | do_swap_account = 1; |
3264 | } | |
3265 | #else | |
3266 | static void __init enable_swap_cgroup(void) | |
3267 | { | |
3268 | } | |
3269 | #endif | |
3270 | ||
f64c3f54 BS |
3271 | static int mem_cgroup_soft_limit_tree_init(void) |
3272 | { | |
3273 | struct mem_cgroup_tree_per_node *rtpn; | |
3274 | struct mem_cgroup_tree_per_zone *rtpz; | |
3275 | int tmp, node, zone; | |
3276 | ||
3277 | for_each_node_state(node, N_POSSIBLE) { | |
3278 | tmp = node; | |
3279 | if (!node_state(node, N_NORMAL_MEMORY)) | |
3280 | tmp = -1; | |
3281 | rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL, tmp); | |
3282 | if (!rtpn) | |
3283 | return 1; | |
3284 | ||
3285 | soft_limit_tree.rb_tree_per_node[node] = rtpn; | |
3286 | ||
3287 | for (zone = 0; zone < MAX_NR_ZONES; zone++) { | |
3288 | rtpz = &rtpn->rb_tree_per_zone[zone]; | |
3289 | rtpz->rb_root = RB_ROOT; | |
3290 | spin_lock_init(&rtpz->lock); | |
3291 | } | |
3292 | } | |
3293 | return 0; | |
3294 | } | |
3295 | ||
0eb253e2 | 3296 | static struct cgroup_subsys_state * __ref |
8cdea7c0 BS |
3297 | mem_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cont) |
3298 | { | |
28dbc4b6 | 3299 | struct mem_cgroup *mem, *parent; |
04046e1a | 3300 | long error = -ENOMEM; |
6d12e2d8 | 3301 | int node; |
8cdea7c0 | 3302 | |
c8dad2bb JB |
3303 | mem = mem_cgroup_alloc(); |
3304 | if (!mem) | |
04046e1a | 3305 | return ERR_PTR(error); |
78fb7466 | 3306 | |
6d12e2d8 KH |
3307 | for_each_node_state(node, N_POSSIBLE) |
3308 | if (alloc_mem_cgroup_per_zone_info(mem, node)) | |
3309 | goto free_out; | |
f64c3f54 | 3310 | |
c077719b | 3311 | /* root ? */ |
28dbc4b6 | 3312 | if (cont->parent == NULL) { |
cdec2e42 | 3313 | int cpu; |
c077719b | 3314 | enable_swap_cgroup(); |
28dbc4b6 | 3315 | parent = NULL; |
4b3bde4c | 3316 | root_mem_cgroup = mem; |
f64c3f54 BS |
3317 | if (mem_cgroup_soft_limit_tree_init()) |
3318 | goto free_out; | |
cdec2e42 KH |
3319 | for_each_possible_cpu(cpu) { |
3320 | struct memcg_stock_pcp *stock = | |
3321 | &per_cpu(memcg_stock, cpu); | |
3322 | INIT_WORK(&stock->work, drain_local_stock); | |
3323 | } | |
3324 | hotcpu_notifier(memcg_stock_cpu_callback, 0); | |
f64c3f54 | 3325 | |
18f59ea7 | 3326 | } else { |
28dbc4b6 | 3327 | parent = mem_cgroup_from_cont(cont->parent); |
18f59ea7 BS |
3328 | mem->use_hierarchy = parent->use_hierarchy; |
3329 | } | |
28dbc4b6 | 3330 | |
18f59ea7 BS |
3331 | if (parent && parent->use_hierarchy) { |
3332 | res_counter_init(&mem->res, &parent->res); | |
3333 | res_counter_init(&mem->memsw, &parent->memsw); | |
7bcc1bb1 DN |
3334 | /* |
3335 | * We increment refcnt of the parent to ensure that we can | |
3336 | * safely access it on res_counter_charge/uncharge. | |
3337 | * This refcnt will be decremented when freeing this | |
3338 | * mem_cgroup(see mem_cgroup_put). | |
3339 | */ | |
3340 | mem_cgroup_get(parent); | |
18f59ea7 BS |
3341 | } else { |
3342 | res_counter_init(&mem->res, NULL); | |
3343 | res_counter_init(&mem->memsw, NULL); | |
3344 | } | |
04046e1a | 3345 | mem->last_scanned_child = 0; |
2733c06a | 3346 | spin_lock_init(&mem->reclaim_param_lock); |
6d61ef40 | 3347 | |
a7885eb8 KM |
3348 | if (parent) |
3349 | mem->swappiness = get_swappiness(parent); | |
a7ba0eef | 3350 | atomic_set(&mem->refcnt, 1); |
8cdea7c0 | 3351 | return &mem->css; |
6d12e2d8 | 3352 | free_out: |
a7ba0eef | 3353 | __mem_cgroup_free(mem); |
4b3bde4c | 3354 | root_mem_cgroup = NULL; |
04046e1a | 3355 | return ERR_PTR(error); |
8cdea7c0 BS |
3356 | } |
3357 | ||
ec64f515 | 3358 | static int mem_cgroup_pre_destroy(struct cgroup_subsys *ss, |
df878fb0 KH |
3359 | struct cgroup *cont) |
3360 | { | |
3361 | struct mem_cgroup *mem = mem_cgroup_from_cont(cont); | |
ec64f515 KH |
3362 | |
3363 | return mem_cgroup_force_empty(mem, false); | |
df878fb0 KH |
3364 | } |
3365 | ||
8cdea7c0 BS |
3366 | static void mem_cgroup_destroy(struct cgroup_subsys *ss, |
3367 | struct cgroup *cont) | |
3368 | { | |
c268e994 | 3369 | struct mem_cgroup *mem = mem_cgroup_from_cont(cont); |
c268e994 | 3370 | |
c268e994 | 3371 | mem_cgroup_put(mem); |
8cdea7c0 BS |
3372 | } |
3373 | ||
3374 | static int mem_cgroup_populate(struct cgroup_subsys *ss, | |
3375 | struct cgroup *cont) | |
3376 | { | |
8c7c6e34 KH |
3377 | int ret; |
3378 | ||
3379 | ret = cgroup_add_files(cont, ss, mem_cgroup_files, | |
3380 | ARRAY_SIZE(mem_cgroup_files)); | |
3381 | ||
3382 | if (!ret) | |
3383 | ret = register_memsw_files(cont, ss); | |
3384 | return ret; | |
8cdea7c0 BS |
3385 | } |
3386 | ||
67e465a7 BS |
3387 | static void mem_cgroup_move_task(struct cgroup_subsys *ss, |
3388 | struct cgroup *cont, | |
3389 | struct cgroup *old_cont, | |
be367d09 BB |
3390 | struct task_struct *p, |
3391 | bool threadgroup) | |
67e465a7 | 3392 | { |
67e465a7 | 3393 | /* |
f9717d28 NK |
3394 | * FIXME: It's better to move charges of this process from old |
3395 | * memcg to new memcg. But it's just on TODO-List now. | |
67e465a7 | 3396 | */ |
67e465a7 BS |
3397 | } |
3398 | ||
8cdea7c0 BS |
3399 | struct cgroup_subsys mem_cgroup_subsys = { |
3400 | .name = "memory", | |
3401 | .subsys_id = mem_cgroup_subsys_id, | |
3402 | .create = mem_cgroup_create, | |
df878fb0 | 3403 | .pre_destroy = mem_cgroup_pre_destroy, |
8cdea7c0 BS |
3404 | .destroy = mem_cgroup_destroy, |
3405 | .populate = mem_cgroup_populate, | |
67e465a7 | 3406 | .attach = mem_cgroup_move_task, |
6d12e2d8 | 3407 | .early_init = 0, |
04046e1a | 3408 | .use_id = 1, |
8cdea7c0 | 3409 | }; |
c077719b KH |
3410 | |
3411 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP | |
3412 | ||
3413 | static int __init disable_swap_account(char *s) | |
3414 | { | |
3415 | really_do_swap_account = 0; | |
3416 | return 1; | |
3417 | } | |
3418 | __setup("noswapaccount", disable_swap_account); | |
3419 | #endif |