]>
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 | * | |
2e72b634 KS |
9 | * Memory thresholds |
10 | * Copyright (C) 2009 Nokia Corporation | |
11 | * Author: Kirill A. Shutemov | |
12 | * | |
7ae1e1d0 GC |
13 | * Kernel Memory Controller |
14 | * Copyright (C) 2012 Parallels Inc. and Google Inc. | |
15 | * Authors: Glauber Costa and Suleiman Souhlal | |
16 | * | |
8cdea7c0 BS |
17 | * This program is free software; you can redistribute it and/or modify |
18 | * it under the terms of the GNU General Public License as published by | |
19 | * the Free Software Foundation; either version 2 of the License, or | |
20 | * (at your option) any later version. | |
21 | * | |
22 | * This program is distributed in the hope that it will be useful, | |
23 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
24 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
25 | * GNU General Public License for more details. | |
26 | */ | |
27 | ||
28 | #include <linux/res_counter.h> | |
29 | #include <linux/memcontrol.h> | |
30 | #include <linux/cgroup.h> | |
78fb7466 | 31 | #include <linux/mm.h> |
4ffef5fe | 32 | #include <linux/hugetlb.h> |
d13d1443 | 33 | #include <linux/pagemap.h> |
d52aa412 | 34 | #include <linux/smp.h> |
8a9f3ccd | 35 | #include <linux/page-flags.h> |
66e1707b | 36 | #include <linux/backing-dev.h> |
8a9f3ccd BS |
37 | #include <linux/bit_spinlock.h> |
38 | #include <linux/rcupdate.h> | |
e222432b | 39 | #include <linux/limits.h> |
b9e15baf | 40 | #include <linux/export.h> |
8c7c6e34 | 41 | #include <linux/mutex.h> |
f64c3f54 | 42 | #include <linux/rbtree.h> |
b6ac57d5 | 43 | #include <linux/slab.h> |
66e1707b | 44 | #include <linux/swap.h> |
02491447 | 45 | #include <linux/swapops.h> |
66e1707b | 46 | #include <linux/spinlock.h> |
2e72b634 KS |
47 | #include <linux/eventfd.h> |
48 | #include <linux/sort.h> | |
66e1707b | 49 | #include <linux/fs.h> |
d2ceb9b7 | 50 | #include <linux/seq_file.h> |
33327948 | 51 | #include <linux/vmalloc.h> |
b69408e8 | 52 | #include <linux/mm_inline.h> |
52d4b9ac | 53 | #include <linux/page_cgroup.h> |
cdec2e42 | 54 | #include <linux/cpu.h> |
158e0a2d | 55 | #include <linux/oom.h> |
08e552c6 | 56 | #include "internal.h" |
d1a4c0b3 | 57 | #include <net/sock.h> |
4bd2c1ee | 58 | #include <net/ip.h> |
d1a4c0b3 | 59 | #include <net/tcp_memcontrol.h> |
8cdea7c0 | 60 | |
8697d331 BS |
61 | #include <asm/uaccess.h> |
62 | ||
cc8e970c KM |
63 | #include <trace/events/vmscan.h> |
64 | ||
a181b0e8 | 65 | struct cgroup_subsys mem_cgroup_subsys __read_mostly; |
68ae564b DR |
66 | EXPORT_SYMBOL(mem_cgroup_subsys); |
67 | ||
a181b0e8 | 68 | #define MEM_CGROUP_RECLAIM_RETRIES 5 |
6bbda35c | 69 | static struct mem_cgroup *root_mem_cgroup __read_mostly; |
8cdea7c0 | 70 | |
c255a458 | 71 | #ifdef CONFIG_MEMCG_SWAP |
338c8431 | 72 | /* Turned on only when memory cgroup is enabled && really_do_swap_account = 1 */ |
c077719b | 73 | int do_swap_account __read_mostly; |
a42c390c MH |
74 | |
75 | /* for remember boot option*/ | |
c255a458 | 76 | #ifdef CONFIG_MEMCG_SWAP_ENABLED |
a42c390c MH |
77 | static int really_do_swap_account __initdata = 1; |
78 | #else | |
79 | static int really_do_swap_account __initdata = 0; | |
80 | #endif | |
81 | ||
c077719b | 82 | #else |
a0db00fc | 83 | #define do_swap_account 0 |
c077719b KH |
84 | #endif |
85 | ||
86 | ||
d52aa412 KH |
87 | /* |
88 | * Statistics for memory cgroup. | |
89 | */ | |
90 | enum mem_cgroup_stat_index { | |
91 | /* | |
92 | * For MEM_CONTAINER_TYPE_ALL, usage = pagecache + rss. | |
93 | */ | |
94 | MEM_CGROUP_STAT_CACHE, /* # of pages charged as cache */ | |
d69b042f | 95 | MEM_CGROUP_STAT_RSS, /* # of pages charged as anon rss */ |
d8046582 | 96 | MEM_CGROUP_STAT_FILE_MAPPED, /* # of pages charged as file rss */ |
bff6bb83 | 97 | MEM_CGROUP_STAT_SWAP, /* # of pages, swapped out */ |
d52aa412 KH |
98 | MEM_CGROUP_STAT_NSTATS, |
99 | }; | |
100 | ||
af7c4b0e JW |
101 | static const char * const mem_cgroup_stat_names[] = { |
102 | "cache", | |
103 | "rss", | |
104 | "mapped_file", | |
105 | "swap", | |
106 | }; | |
107 | ||
e9f8974f JW |
108 | enum mem_cgroup_events_index { |
109 | MEM_CGROUP_EVENTS_PGPGIN, /* # of pages paged in */ | |
110 | MEM_CGROUP_EVENTS_PGPGOUT, /* # of pages paged out */ | |
456f998e YH |
111 | MEM_CGROUP_EVENTS_PGFAULT, /* # of page-faults */ |
112 | MEM_CGROUP_EVENTS_PGMAJFAULT, /* # of major page-faults */ | |
e9f8974f JW |
113 | MEM_CGROUP_EVENTS_NSTATS, |
114 | }; | |
af7c4b0e JW |
115 | |
116 | static const char * const mem_cgroup_events_names[] = { | |
117 | "pgpgin", | |
118 | "pgpgout", | |
119 | "pgfault", | |
120 | "pgmajfault", | |
121 | }; | |
122 | ||
7a159cc9 JW |
123 | /* |
124 | * Per memcg event counter is incremented at every pagein/pageout. With THP, | |
125 | * it will be incremated by the number of pages. This counter is used for | |
126 | * for trigger some periodic events. This is straightforward and better | |
127 | * than using jiffies etc. to handle periodic memcg event. | |
128 | */ | |
129 | enum mem_cgroup_events_target { | |
130 | MEM_CGROUP_TARGET_THRESH, | |
131 | MEM_CGROUP_TARGET_SOFTLIMIT, | |
453a9bf3 | 132 | MEM_CGROUP_TARGET_NUMAINFO, |
7a159cc9 JW |
133 | MEM_CGROUP_NTARGETS, |
134 | }; | |
a0db00fc KS |
135 | #define THRESHOLDS_EVENTS_TARGET 128 |
136 | #define SOFTLIMIT_EVENTS_TARGET 1024 | |
137 | #define NUMAINFO_EVENTS_TARGET 1024 | |
e9f8974f | 138 | |
d52aa412 | 139 | struct mem_cgroup_stat_cpu { |
7a159cc9 | 140 | long count[MEM_CGROUP_STAT_NSTATS]; |
e9f8974f | 141 | unsigned long events[MEM_CGROUP_EVENTS_NSTATS]; |
13114716 | 142 | unsigned long nr_page_events; |
7a159cc9 | 143 | unsigned long targets[MEM_CGROUP_NTARGETS]; |
d52aa412 KH |
144 | }; |
145 | ||
527a5ec9 JW |
146 | struct mem_cgroup_reclaim_iter { |
147 | /* css_id of the last scanned hierarchy member */ | |
148 | int position; | |
149 | /* scan generation, increased every round-trip */ | |
150 | unsigned int generation; | |
151 | }; | |
152 | ||
6d12e2d8 KH |
153 | /* |
154 | * per-zone information in memory controller. | |
155 | */ | |
6d12e2d8 | 156 | struct mem_cgroup_per_zone { |
6290df54 | 157 | struct lruvec lruvec; |
1eb49272 | 158 | unsigned long lru_size[NR_LRU_LISTS]; |
3e2f41f1 | 159 | |
527a5ec9 JW |
160 | struct mem_cgroup_reclaim_iter reclaim_iter[DEF_PRIORITY + 1]; |
161 | ||
f64c3f54 BS |
162 | struct rb_node tree_node; /* RB tree node */ |
163 | unsigned long long usage_in_excess;/* Set to the value by which */ | |
164 | /* the soft limit is exceeded*/ | |
165 | bool on_tree; | |
d79154bb | 166 | struct mem_cgroup *memcg; /* Back pointer, we cannot */ |
4e416953 | 167 | /* use container_of */ |
6d12e2d8 | 168 | }; |
6d12e2d8 KH |
169 | |
170 | struct mem_cgroup_per_node { | |
171 | struct mem_cgroup_per_zone zoneinfo[MAX_NR_ZONES]; | |
172 | }; | |
173 | ||
174 | struct mem_cgroup_lru_info { | |
175 | struct mem_cgroup_per_node *nodeinfo[MAX_NUMNODES]; | |
176 | }; | |
177 | ||
f64c3f54 BS |
178 | /* |
179 | * Cgroups above their limits are maintained in a RB-Tree, independent of | |
180 | * their hierarchy representation | |
181 | */ | |
182 | ||
183 | struct mem_cgroup_tree_per_zone { | |
184 | struct rb_root rb_root; | |
185 | spinlock_t lock; | |
186 | }; | |
187 | ||
188 | struct mem_cgroup_tree_per_node { | |
189 | struct mem_cgroup_tree_per_zone rb_tree_per_zone[MAX_NR_ZONES]; | |
190 | }; | |
191 | ||
192 | struct mem_cgroup_tree { | |
193 | struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES]; | |
194 | }; | |
195 | ||
196 | static struct mem_cgroup_tree soft_limit_tree __read_mostly; | |
197 | ||
2e72b634 KS |
198 | struct mem_cgroup_threshold { |
199 | struct eventfd_ctx *eventfd; | |
200 | u64 threshold; | |
201 | }; | |
202 | ||
9490ff27 | 203 | /* For threshold */ |
2e72b634 | 204 | struct mem_cgroup_threshold_ary { |
748dad36 | 205 | /* An array index points to threshold just below or equal to usage. */ |
5407a562 | 206 | int current_threshold; |
2e72b634 KS |
207 | /* Size of entries[] */ |
208 | unsigned int size; | |
209 | /* Array of thresholds */ | |
210 | struct mem_cgroup_threshold entries[0]; | |
211 | }; | |
2c488db2 KS |
212 | |
213 | struct mem_cgroup_thresholds { | |
214 | /* Primary thresholds array */ | |
215 | struct mem_cgroup_threshold_ary *primary; | |
216 | /* | |
217 | * Spare threshold array. | |
218 | * This is needed to make mem_cgroup_unregister_event() "never fail". | |
219 | * It must be able to store at least primary->size - 1 entries. | |
220 | */ | |
221 | struct mem_cgroup_threshold_ary *spare; | |
222 | }; | |
223 | ||
9490ff27 KH |
224 | /* for OOM */ |
225 | struct mem_cgroup_eventfd_list { | |
226 | struct list_head list; | |
227 | struct eventfd_ctx *eventfd; | |
228 | }; | |
2e72b634 | 229 | |
c0ff4b85 R |
230 | static void mem_cgroup_threshold(struct mem_cgroup *memcg); |
231 | static void mem_cgroup_oom_notify(struct mem_cgroup *memcg); | |
2e72b634 | 232 | |
8cdea7c0 BS |
233 | /* |
234 | * The memory controller data structure. The memory controller controls both | |
235 | * page cache and RSS per cgroup. We would eventually like to provide | |
236 | * statistics based on the statistics developed by Rik Van Riel for clock-pro, | |
237 | * to help the administrator determine what knobs to tune. | |
238 | * | |
239 | * TODO: Add a water mark for the memory controller. Reclaim will begin when | |
8a9f3ccd BS |
240 | * we hit the water mark. May be even add a low water mark, such that |
241 | * no reclaim occurs from a cgroup at it's low water mark, this is | |
242 | * a feature that will be implemented much later in the future. | |
8cdea7c0 BS |
243 | */ |
244 | struct mem_cgroup { | |
245 | struct cgroup_subsys_state css; | |
246 | /* | |
247 | * the counter to account for memory usage | |
248 | */ | |
249 | struct res_counter res; | |
59927fb9 HD |
250 | |
251 | union { | |
252 | /* | |
253 | * the counter to account for mem+swap usage. | |
254 | */ | |
255 | struct res_counter memsw; | |
256 | ||
257 | /* | |
258 | * rcu_freeing is used only when freeing struct mem_cgroup, | |
259 | * so put it into a union to avoid wasting more memory. | |
260 | * It must be disjoint from the css field. It could be | |
261 | * in a union with the res field, but res plays a much | |
262 | * larger part in mem_cgroup life than memsw, and might | |
263 | * be of interest, even at time of free, when debugging. | |
264 | * So share rcu_head with the less interesting memsw. | |
265 | */ | |
266 | struct rcu_head rcu_freeing; | |
267 | /* | |
3afe36b1 GC |
268 | * We also need some space for a worker in deferred freeing. |
269 | * By the time we call it, rcu_freeing is no longer in use. | |
59927fb9 HD |
270 | */ |
271 | struct work_struct work_freeing; | |
272 | }; | |
273 | ||
510fc4e1 GC |
274 | /* |
275 | * the counter to account for kernel memory usage. | |
276 | */ | |
277 | struct res_counter kmem; | |
78fb7466 PE |
278 | /* |
279 | * Per cgroup active and inactive list, similar to the | |
280 | * per zone LRU lists. | |
78fb7466 | 281 | */ |
6d12e2d8 | 282 | struct mem_cgroup_lru_info info; |
889976db YH |
283 | int last_scanned_node; |
284 | #if MAX_NUMNODES > 1 | |
285 | nodemask_t scan_nodes; | |
453a9bf3 KH |
286 | atomic_t numainfo_events; |
287 | atomic_t numainfo_updating; | |
889976db | 288 | #endif |
18f59ea7 BS |
289 | /* |
290 | * Should the accounting and control be hierarchical, per subtree? | |
291 | */ | |
292 | bool use_hierarchy; | |
510fc4e1 | 293 | unsigned long kmem_account_flags; /* See KMEM_ACCOUNTED_*, below */ |
79dfdacc MH |
294 | |
295 | bool oom_lock; | |
296 | atomic_t under_oom; | |
297 | ||
8c7c6e34 | 298 | atomic_t refcnt; |
14797e23 | 299 | |
1f4c025b | 300 | int swappiness; |
3c11ecf4 KH |
301 | /* OOM-Killer disable */ |
302 | int oom_kill_disable; | |
a7885eb8 | 303 | |
22a668d7 KH |
304 | /* set when res.limit == memsw.limit */ |
305 | bool memsw_is_minimum; | |
306 | ||
2e72b634 KS |
307 | /* protect arrays of thresholds */ |
308 | struct mutex thresholds_lock; | |
309 | ||
310 | /* thresholds for memory usage. RCU-protected */ | |
2c488db2 | 311 | struct mem_cgroup_thresholds thresholds; |
907860ed | 312 | |
2e72b634 | 313 | /* thresholds for mem+swap usage. RCU-protected */ |
2c488db2 | 314 | struct mem_cgroup_thresholds memsw_thresholds; |
907860ed | 315 | |
9490ff27 KH |
316 | /* For oom notifier event fd */ |
317 | struct list_head oom_notify; | |
185efc0f | 318 | |
7dc74be0 DN |
319 | /* |
320 | * Should we move charges of a task when a task is moved into this | |
321 | * mem_cgroup ? And what type of charges should we move ? | |
322 | */ | |
323 | unsigned long move_charge_at_immigrate; | |
619d094b KH |
324 | /* |
325 | * set > 0 if pages under this cgroup are moving to other cgroup. | |
326 | */ | |
327 | atomic_t moving_account; | |
312734c0 KH |
328 | /* taken only while moving_account > 0 */ |
329 | spinlock_t move_lock; | |
d52aa412 | 330 | /* |
c62b1a3b | 331 | * percpu counter. |
d52aa412 | 332 | */ |
3a7951b4 | 333 | struct mem_cgroup_stat_cpu __percpu *stat; |
711d3d2c KH |
334 | /* |
335 | * used when a cpu is offlined or other synchronizations | |
336 | * See mem_cgroup_read_stat(). | |
337 | */ | |
338 | struct mem_cgroup_stat_cpu nocpu_base; | |
339 | spinlock_t pcp_counter_lock; | |
d1a4c0b3 | 340 | |
4bd2c1ee | 341 | #if defined(CONFIG_MEMCG_KMEM) && defined(CONFIG_INET) |
d1a4c0b3 GC |
342 | struct tcp_memcontrol tcp_mem; |
343 | #endif | |
2633d7a0 GC |
344 | #if defined(CONFIG_MEMCG_KMEM) |
345 | /* analogous to slab_common's slab_caches list. per-memcg */ | |
346 | struct list_head memcg_slab_caches; | |
347 | /* Not a spinlock, we can take a lot of time walking the list */ | |
348 | struct mutex slab_caches_mutex; | |
349 | /* Index in the kmem_cache->memcg_params->memcg_caches array */ | |
350 | int kmemcg_id; | |
351 | #endif | |
8cdea7c0 BS |
352 | }; |
353 | ||
510fc4e1 GC |
354 | /* internal only representation about the status of kmem accounting. */ |
355 | enum { | |
356 | KMEM_ACCOUNTED_ACTIVE = 0, /* accounted by this cgroup itself */ | |
a8964b9b | 357 | KMEM_ACCOUNTED_ACTIVATED, /* static key enabled. */ |
7de37682 | 358 | KMEM_ACCOUNTED_DEAD, /* dead memcg with pending kmem charges */ |
510fc4e1 GC |
359 | }; |
360 | ||
a8964b9b GC |
361 | /* We account when limit is on, but only after call sites are patched */ |
362 | #define KMEM_ACCOUNTED_MASK \ | |
363 | ((1 << KMEM_ACCOUNTED_ACTIVE) | (1 << KMEM_ACCOUNTED_ACTIVATED)) | |
510fc4e1 GC |
364 | |
365 | #ifdef CONFIG_MEMCG_KMEM | |
366 | static inline void memcg_kmem_set_active(struct mem_cgroup *memcg) | |
367 | { | |
368 | set_bit(KMEM_ACCOUNTED_ACTIVE, &memcg->kmem_account_flags); | |
369 | } | |
7de37682 GC |
370 | |
371 | static bool memcg_kmem_is_active(struct mem_cgroup *memcg) | |
372 | { | |
373 | return test_bit(KMEM_ACCOUNTED_ACTIVE, &memcg->kmem_account_flags); | |
374 | } | |
375 | ||
a8964b9b GC |
376 | static void memcg_kmem_set_activated(struct mem_cgroup *memcg) |
377 | { | |
378 | set_bit(KMEM_ACCOUNTED_ACTIVATED, &memcg->kmem_account_flags); | |
379 | } | |
380 | ||
55007d84 GC |
381 | static void memcg_kmem_clear_activated(struct mem_cgroup *memcg) |
382 | { | |
383 | clear_bit(KMEM_ACCOUNTED_ACTIVATED, &memcg->kmem_account_flags); | |
384 | } | |
385 | ||
7de37682 GC |
386 | static void memcg_kmem_mark_dead(struct mem_cgroup *memcg) |
387 | { | |
388 | if (test_bit(KMEM_ACCOUNTED_ACTIVE, &memcg->kmem_account_flags)) | |
389 | set_bit(KMEM_ACCOUNTED_DEAD, &memcg->kmem_account_flags); | |
390 | } | |
391 | ||
392 | static bool memcg_kmem_test_and_clear_dead(struct mem_cgroup *memcg) | |
393 | { | |
394 | return test_and_clear_bit(KMEM_ACCOUNTED_DEAD, | |
395 | &memcg->kmem_account_flags); | |
396 | } | |
510fc4e1 GC |
397 | #endif |
398 | ||
7dc74be0 DN |
399 | /* Stuffs for move charges at task migration. */ |
400 | /* | |
401 | * Types of charges to be moved. "move_charge_at_immitgrate" is treated as a | |
402 | * left-shifted bitmap of these types. | |
403 | */ | |
404 | enum move_type { | |
4ffef5fe | 405 | MOVE_CHARGE_TYPE_ANON, /* private anonymous page and swap of it */ |
87946a72 | 406 | MOVE_CHARGE_TYPE_FILE, /* file page(including tmpfs) and swap of it */ |
7dc74be0 DN |
407 | NR_MOVE_TYPE, |
408 | }; | |
409 | ||
4ffef5fe DN |
410 | /* "mc" and its members are protected by cgroup_mutex */ |
411 | static struct move_charge_struct { | |
b1dd693e | 412 | spinlock_t lock; /* for from, to */ |
4ffef5fe DN |
413 | struct mem_cgroup *from; |
414 | struct mem_cgroup *to; | |
415 | unsigned long precharge; | |
854ffa8d | 416 | unsigned long moved_charge; |
483c30b5 | 417 | unsigned long moved_swap; |
8033b97c DN |
418 | struct task_struct *moving_task; /* a task moving charges */ |
419 | wait_queue_head_t waitq; /* a waitq for other context */ | |
420 | } mc = { | |
2bd9bb20 | 421 | .lock = __SPIN_LOCK_UNLOCKED(mc.lock), |
8033b97c DN |
422 | .waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq), |
423 | }; | |
4ffef5fe | 424 | |
90254a65 DN |
425 | static bool move_anon(void) |
426 | { | |
427 | return test_bit(MOVE_CHARGE_TYPE_ANON, | |
428 | &mc.to->move_charge_at_immigrate); | |
429 | } | |
430 | ||
87946a72 DN |
431 | static bool move_file(void) |
432 | { | |
433 | return test_bit(MOVE_CHARGE_TYPE_FILE, | |
434 | &mc.to->move_charge_at_immigrate); | |
435 | } | |
436 | ||
4e416953 BS |
437 | /* |
438 | * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft | |
439 | * limit reclaim to prevent infinite loops, if they ever occur. | |
440 | */ | |
a0db00fc KS |
441 | #define MEM_CGROUP_MAX_RECLAIM_LOOPS 100 |
442 | #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS 2 | |
4e416953 | 443 | |
217bc319 KH |
444 | enum charge_type { |
445 | MEM_CGROUP_CHARGE_TYPE_CACHE = 0, | |
41326c17 | 446 | MEM_CGROUP_CHARGE_TYPE_ANON, |
d13d1443 | 447 | MEM_CGROUP_CHARGE_TYPE_SWAPOUT, /* for accounting swapcache */ |
8a9478ca | 448 | MEM_CGROUP_CHARGE_TYPE_DROP, /* a page was unused swap cache */ |
c05555b5 KH |
449 | NR_CHARGE_TYPE, |
450 | }; | |
451 | ||
8c7c6e34 | 452 | /* for encoding cft->private value on file */ |
86ae53e1 GC |
453 | enum res_type { |
454 | _MEM, | |
455 | _MEMSWAP, | |
456 | _OOM_TYPE, | |
510fc4e1 | 457 | _KMEM, |
86ae53e1 GC |
458 | }; |
459 | ||
a0db00fc KS |
460 | #define MEMFILE_PRIVATE(x, val) ((x) << 16 | (val)) |
461 | #define MEMFILE_TYPE(val) ((val) >> 16 & 0xffff) | |
8c7c6e34 | 462 | #define MEMFILE_ATTR(val) ((val) & 0xffff) |
9490ff27 KH |
463 | /* Used for OOM nofiier */ |
464 | #define OOM_CONTROL (0) | |
8c7c6e34 | 465 | |
75822b44 BS |
466 | /* |
467 | * Reclaim flags for mem_cgroup_hierarchical_reclaim | |
468 | */ | |
469 | #define MEM_CGROUP_RECLAIM_NOSWAP_BIT 0x0 | |
470 | #define MEM_CGROUP_RECLAIM_NOSWAP (1 << MEM_CGROUP_RECLAIM_NOSWAP_BIT) | |
471 | #define MEM_CGROUP_RECLAIM_SHRINK_BIT 0x1 | |
472 | #define MEM_CGROUP_RECLAIM_SHRINK (1 << MEM_CGROUP_RECLAIM_SHRINK_BIT) | |
473 | ||
c0ff4b85 R |
474 | static void mem_cgroup_get(struct mem_cgroup *memcg); |
475 | static void mem_cgroup_put(struct mem_cgroup *memcg); | |
e1aab161 | 476 | |
b2145145 WL |
477 | static inline |
478 | struct mem_cgroup *mem_cgroup_from_css(struct cgroup_subsys_state *s) | |
479 | { | |
480 | return container_of(s, struct mem_cgroup, css); | |
481 | } | |
482 | ||
7ffc0edc MH |
483 | static inline bool mem_cgroup_is_root(struct mem_cgroup *memcg) |
484 | { | |
485 | return (memcg == root_mem_cgroup); | |
486 | } | |
487 | ||
e1aab161 | 488 | /* Writing them here to avoid exposing memcg's inner layout */ |
4bd2c1ee | 489 | #if defined(CONFIG_INET) && defined(CONFIG_MEMCG_KMEM) |
e1aab161 | 490 | |
e1aab161 GC |
491 | void sock_update_memcg(struct sock *sk) |
492 | { | |
376be5ff | 493 | if (mem_cgroup_sockets_enabled) { |
e1aab161 | 494 | struct mem_cgroup *memcg; |
3f134619 | 495 | struct cg_proto *cg_proto; |
e1aab161 GC |
496 | |
497 | BUG_ON(!sk->sk_prot->proto_cgroup); | |
498 | ||
f3f511e1 GC |
499 | /* Socket cloning can throw us here with sk_cgrp already |
500 | * filled. It won't however, necessarily happen from | |
501 | * process context. So the test for root memcg given | |
502 | * the current task's memcg won't help us in this case. | |
503 | * | |
504 | * Respecting the original socket's memcg is a better | |
505 | * decision in this case. | |
506 | */ | |
507 | if (sk->sk_cgrp) { | |
508 | BUG_ON(mem_cgroup_is_root(sk->sk_cgrp->memcg)); | |
509 | mem_cgroup_get(sk->sk_cgrp->memcg); | |
510 | return; | |
511 | } | |
512 | ||
e1aab161 GC |
513 | rcu_read_lock(); |
514 | memcg = mem_cgroup_from_task(current); | |
3f134619 GC |
515 | cg_proto = sk->sk_prot->proto_cgroup(memcg); |
516 | if (!mem_cgroup_is_root(memcg) && memcg_proto_active(cg_proto)) { | |
e1aab161 | 517 | mem_cgroup_get(memcg); |
3f134619 | 518 | sk->sk_cgrp = cg_proto; |
e1aab161 GC |
519 | } |
520 | rcu_read_unlock(); | |
521 | } | |
522 | } | |
523 | EXPORT_SYMBOL(sock_update_memcg); | |
524 | ||
525 | void sock_release_memcg(struct sock *sk) | |
526 | { | |
376be5ff | 527 | if (mem_cgroup_sockets_enabled && sk->sk_cgrp) { |
e1aab161 GC |
528 | struct mem_cgroup *memcg; |
529 | WARN_ON(!sk->sk_cgrp->memcg); | |
530 | memcg = sk->sk_cgrp->memcg; | |
531 | mem_cgroup_put(memcg); | |
532 | } | |
533 | } | |
d1a4c0b3 GC |
534 | |
535 | struct cg_proto *tcp_proto_cgroup(struct mem_cgroup *memcg) | |
536 | { | |
537 | if (!memcg || mem_cgroup_is_root(memcg)) | |
538 | return NULL; | |
539 | ||
540 | return &memcg->tcp_mem.cg_proto; | |
541 | } | |
542 | EXPORT_SYMBOL(tcp_proto_cgroup); | |
e1aab161 | 543 | |
3f134619 GC |
544 | static void disarm_sock_keys(struct mem_cgroup *memcg) |
545 | { | |
546 | if (!memcg_proto_activated(&memcg->tcp_mem.cg_proto)) | |
547 | return; | |
548 | static_key_slow_dec(&memcg_socket_limit_enabled); | |
549 | } | |
550 | #else | |
551 | static void disarm_sock_keys(struct mem_cgroup *memcg) | |
552 | { | |
553 | } | |
554 | #endif | |
555 | ||
a8964b9b | 556 | #ifdef CONFIG_MEMCG_KMEM |
55007d84 GC |
557 | /* |
558 | * This will be the memcg's index in each cache's ->memcg_params->memcg_caches. | |
559 | * There are two main reasons for not using the css_id for this: | |
560 | * 1) this works better in sparse environments, where we have a lot of memcgs, | |
561 | * but only a few kmem-limited. Or also, if we have, for instance, 200 | |
562 | * memcgs, and none but the 200th is kmem-limited, we'd have to have a | |
563 | * 200 entry array for that. | |
564 | * | |
565 | * 2) In order not to violate the cgroup API, we would like to do all memory | |
566 | * allocation in ->create(). At that point, we haven't yet allocated the | |
567 | * css_id. Having a separate index prevents us from messing with the cgroup | |
568 | * core for this | |
569 | * | |
570 | * The current size of the caches array is stored in | |
571 | * memcg_limited_groups_array_size. It will double each time we have to | |
572 | * increase it. | |
573 | */ | |
574 | static DEFINE_IDA(kmem_limited_groups); | |
575 | static int memcg_limited_groups_array_size; | |
576 | /* | |
577 | * MIN_SIZE is different than 1, because we would like to avoid going through | |
578 | * the alloc/free process all the time. In a small machine, 4 kmem-limited | |
579 | * cgroups is a reasonable guess. In the future, it could be a parameter or | |
580 | * tunable, but that is strictly not necessary. | |
581 | * | |
582 | * MAX_SIZE should be as large as the number of css_ids. Ideally, we could get | |
583 | * this constant directly from cgroup, but it is understandable that this is | |
584 | * better kept as an internal representation in cgroup.c. In any case, the | |
585 | * css_id space is not getting any smaller, and we don't have to necessarily | |
586 | * increase ours as well if it increases. | |
587 | */ | |
588 | #define MEMCG_CACHES_MIN_SIZE 4 | |
589 | #define MEMCG_CACHES_MAX_SIZE 65535 | |
590 | ||
d7f25f8a GC |
591 | /* |
592 | * A lot of the calls to the cache allocation functions are expected to be | |
593 | * inlined by the compiler. Since the calls to memcg_kmem_get_cache are | |
594 | * conditional to this static branch, we'll have to allow modules that does | |
595 | * kmem_cache_alloc and the such to see this symbol as well | |
596 | */ | |
a8964b9b | 597 | struct static_key memcg_kmem_enabled_key; |
d7f25f8a | 598 | EXPORT_SYMBOL(memcg_kmem_enabled_key); |
a8964b9b GC |
599 | |
600 | static void disarm_kmem_keys(struct mem_cgroup *memcg) | |
601 | { | |
55007d84 | 602 | if (memcg_kmem_is_active(memcg)) { |
a8964b9b | 603 | static_key_slow_dec(&memcg_kmem_enabled_key); |
55007d84 GC |
604 | ida_simple_remove(&kmem_limited_groups, memcg->kmemcg_id); |
605 | } | |
bea207c8 GC |
606 | /* |
607 | * This check can't live in kmem destruction function, | |
608 | * since the charges will outlive the cgroup | |
609 | */ | |
610 | WARN_ON(res_counter_read_u64(&memcg->kmem, RES_USAGE) != 0); | |
a8964b9b GC |
611 | } |
612 | #else | |
613 | static void disarm_kmem_keys(struct mem_cgroup *memcg) | |
614 | { | |
615 | } | |
616 | #endif /* CONFIG_MEMCG_KMEM */ | |
617 | ||
618 | static void disarm_static_keys(struct mem_cgroup *memcg) | |
619 | { | |
620 | disarm_sock_keys(memcg); | |
621 | disarm_kmem_keys(memcg); | |
622 | } | |
623 | ||
c0ff4b85 | 624 | static void drain_all_stock_async(struct mem_cgroup *memcg); |
8c7c6e34 | 625 | |
f64c3f54 | 626 | static struct mem_cgroup_per_zone * |
c0ff4b85 | 627 | mem_cgroup_zoneinfo(struct mem_cgroup *memcg, int nid, int zid) |
f64c3f54 | 628 | { |
c0ff4b85 | 629 | return &memcg->info.nodeinfo[nid]->zoneinfo[zid]; |
f64c3f54 BS |
630 | } |
631 | ||
c0ff4b85 | 632 | struct cgroup_subsys_state *mem_cgroup_css(struct mem_cgroup *memcg) |
d324236b | 633 | { |
c0ff4b85 | 634 | return &memcg->css; |
d324236b WF |
635 | } |
636 | ||
f64c3f54 | 637 | static struct mem_cgroup_per_zone * |
c0ff4b85 | 638 | page_cgroup_zoneinfo(struct mem_cgroup *memcg, struct page *page) |
f64c3f54 | 639 | { |
97a6c37b JW |
640 | int nid = page_to_nid(page); |
641 | int zid = page_zonenum(page); | |
f64c3f54 | 642 | |
c0ff4b85 | 643 | return mem_cgroup_zoneinfo(memcg, nid, zid); |
f64c3f54 BS |
644 | } |
645 | ||
646 | static struct mem_cgroup_tree_per_zone * | |
647 | soft_limit_tree_node_zone(int nid, int zid) | |
648 | { | |
649 | return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid]; | |
650 | } | |
651 | ||
652 | static struct mem_cgroup_tree_per_zone * | |
653 | soft_limit_tree_from_page(struct page *page) | |
654 | { | |
655 | int nid = page_to_nid(page); | |
656 | int zid = page_zonenum(page); | |
657 | ||
658 | return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid]; | |
659 | } | |
660 | ||
661 | static void | |
c0ff4b85 | 662 | __mem_cgroup_insert_exceeded(struct mem_cgroup *memcg, |
f64c3f54 | 663 | struct mem_cgroup_per_zone *mz, |
ef8745c1 KH |
664 | struct mem_cgroup_tree_per_zone *mctz, |
665 | unsigned long long new_usage_in_excess) | |
f64c3f54 BS |
666 | { |
667 | struct rb_node **p = &mctz->rb_root.rb_node; | |
668 | struct rb_node *parent = NULL; | |
669 | struct mem_cgroup_per_zone *mz_node; | |
670 | ||
671 | if (mz->on_tree) | |
672 | return; | |
673 | ||
ef8745c1 KH |
674 | mz->usage_in_excess = new_usage_in_excess; |
675 | if (!mz->usage_in_excess) | |
676 | return; | |
f64c3f54 BS |
677 | while (*p) { |
678 | parent = *p; | |
679 | mz_node = rb_entry(parent, struct mem_cgroup_per_zone, | |
680 | tree_node); | |
681 | if (mz->usage_in_excess < mz_node->usage_in_excess) | |
682 | p = &(*p)->rb_left; | |
683 | /* | |
684 | * We can't avoid mem cgroups that are over their soft | |
685 | * limit by the same amount | |
686 | */ | |
687 | else if (mz->usage_in_excess >= mz_node->usage_in_excess) | |
688 | p = &(*p)->rb_right; | |
689 | } | |
690 | rb_link_node(&mz->tree_node, parent, p); | |
691 | rb_insert_color(&mz->tree_node, &mctz->rb_root); | |
692 | mz->on_tree = true; | |
4e416953 BS |
693 | } |
694 | ||
695 | static void | |
c0ff4b85 | 696 | __mem_cgroup_remove_exceeded(struct mem_cgroup *memcg, |
4e416953 BS |
697 | struct mem_cgroup_per_zone *mz, |
698 | struct mem_cgroup_tree_per_zone *mctz) | |
699 | { | |
700 | if (!mz->on_tree) | |
701 | return; | |
702 | rb_erase(&mz->tree_node, &mctz->rb_root); | |
703 | mz->on_tree = false; | |
704 | } | |
705 | ||
f64c3f54 | 706 | static void |
c0ff4b85 | 707 | mem_cgroup_remove_exceeded(struct mem_cgroup *memcg, |
f64c3f54 BS |
708 | struct mem_cgroup_per_zone *mz, |
709 | struct mem_cgroup_tree_per_zone *mctz) | |
710 | { | |
711 | spin_lock(&mctz->lock); | |
c0ff4b85 | 712 | __mem_cgroup_remove_exceeded(memcg, mz, mctz); |
f64c3f54 BS |
713 | spin_unlock(&mctz->lock); |
714 | } | |
715 | ||
f64c3f54 | 716 | |
c0ff4b85 | 717 | static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page) |
f64c3f54 | 718 | { |
ef8745c1 | 719 | unsigned long long excess; |
f64c3f54 BS |
720 | struct mem_cgroup_per_zone *mz; |
721 | struct mem_cgroup_tree_per_zone *mctz; | |
4e649152 KH |
722 | int nid = page_to_nid(page); |
723 | int zid = page_zonenum(page); | |
f64c3f54 BS |
724 | mctz = soft_limit_tree_from_page(page); |
725 | ||
726 | /* | |
4e649152 KH |
727 | * Necessary to update all ancestors when hierarchy is used. |
728 | * because their event counter is not touched. | |
f64c3f54 | 729 | */ |
c0ff4b85 R |
730 | for (; memcg; memcg = parent_mem_cgroup(memcg)) { |
731 | mz = mem_cgroup_zoneinfo(memcg, nid, zid); | |
732 | excess = res_counter_soft_limit_excess(&memcg->res); | |
4e649152 KH |
733 | /* |
734 | * We have to update the tree if mz is on RB-tree or | |
735 | * mem is over its softlimit. | |
736 | */ | |
ef8745c1 | 737 | if (excess || mz->on_tree) { |
4e649152 KH |
738 | spin_lock(&mctz->lock); |
739 | /* if on-tree, remove it */ | |
740 | if (mz->on_tree) | |
c0ff4b85 | 741 | __mem_cgroup_remove_exceeded(memcg, mz, mctz); |
4e649152 | 742 | /* |
ef8745c1 KH |
743 | * Insert again. mz->usage_in_excess will be updated. |
744 | * If excess is 0, no tree ops. | |
4e649152 | 745 | */ |
c0ff4b85 | 746 | __mem_cgroup_insert_exceeded(memcg, mz, mctz, excess); |
4e649152 KH |
747 | spin_unlock(&mctz->lock); |
748 | } | |
f64c3f54 BS |
749 | } |
750 | } | |
751 | ||
c0ff4b85 | 752 | static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg) |
f64c3f54 BS |
753 | { |
754 | int node, zone; | |
755 | struct mem_cgroup_per_zone *mz; | |
756 | struct mem_cgroup_tree_per_zone *mctz; | |
757 | ||
3ed28fa1 | 758 | for_each_node(node) { |
f64c3f54 | 759 | for (zone = 0; zone < MAX_NR_ZONES; zone++) { |
c0ff4b85 | 760 | mz = mem_cgroup_zoneinfo(memcg, node, zone); |
f64c3f54 | 761 | mctz = soft_limit_tree_node_zone(node, zone); |
c0ff4b85 | 762 | mem_cgroup_remove_exceeded(memcg, mz, mctz); |
f64c3f54 BS |
763 | } |
764 | } | |
765 | } | |
766 | ||
4e416953 BS |
767 | static struct mem_cgroup_per_zone * |
768 | __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz) | |
769 | { | |
770 | struct rb_node *rightmost = NULL; | |
26251eaf | 771 | struct mem_cgroup_per_zone *mz; |
4e416953 BS |
772 | |
773 | retry: | |
26251eaf | 774 | mz = NULL; |
4e416953 BS |
775 | rightmost = rb_last(&mctz->rb_root); |
776 | if (!rightmost) | |
777 | goto done; /* Nothing to reclaim from */ | |
778 | ||
779 | mz = rb_entry(rightmost, struct mem_cgroup_per_zone, tree_node); | |
780 | /* | |
781 | * Remove the node now but someone else can add it back, | |
782 | * we will to add it back at the end of reclaim to its correct | |
783 | * position in the tree. | |
784 | */ | |
d79154bb HD |
785 | __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz); |
786 | if (!res_counter_soft_limit_excess(&mz->memcg->res) || | |
787 | !css_tryget(&mz->memcg->css)) | |
4e416953 BS |
788 | goto retry; |
789 | done: | |
790 | return mz; | |
791 | } | |
792 | ||
793 | static struct mem_cgroup_per_zone * | |
794 | mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz) | |
795 | { | |
796 | struct mem_cgroup_per_zone *mz; | |
797 | ||
798 | spin_lock(&mctz->lock); | |
799 | mz = __mem_cgroup_largest_soft_limit_node(mctz); | |
800 | spin_unlock(&mctz->lock); | |
801 | return mz; | |
802 | } | |
803 | ||
711d3d2c KH |
804 | /* |
805 | * Implementation Note: reading percpu statistics for memcg. | |
806 | * | |
807 | * Both of vmstat[] and percpu_counter has threshold and do periodic | |
808 | * synchronization to implement "quick" read. There are trade-off between | |
809 | * reading cost and precision of value. Then, we may have a chance to implement | |
810 | * a periodic synchronizion of counter in memcg's counter. | |
811 | * | |
812 | * But this _read() function is used for user interface now. The user accounts | |
813 | * memory usage by memory cgroup and he _always_ requires exact value because | |
814 | * he accounts memory. Even if we provide quick-and-fuzzy read, we always | |
815 | * have to visit all online cpus and make sum. So, for now, unnecessary | |
816 | * synchronization is not implemented. (just implemented for cpu hotplug) | |
817 | * | |
818 | * If there are kernel internal actions which can make use of some not-exact | |
819 | * value, and reading all cpu value can be performance bottleneck in some | |
820 | * common workload, threashold and synchonization as vmstat[] should be | |
821 | * implemented. | |
822 | */ | |
c0ff4b85 | 823 | static long mem_cgroup_read_stat(struct mem_cgroup *memcg, |
7a159cc9 | 824 | enum mem_cgroup_stat_index idx) |
c62b1a3b | 825 | { |
7a159cc9 | 826 | long val = 0; |
c62b1a3b | 827 | int cpu; |
c62b1a3b | 828 | |
711d3d2c KH |
829 | get_online_cpus(); |
830 | for_each_online_cpu(cpu) | |
c0ff4b85 | 831 | val += per_cpu(memcg->stat->count[idx], cpu); |
711d3d2c | 832 | #ifdef CONFIG_HOTPLUG_CPU |
c0ff4b85 R |
833 | spin_lock(&memcg->pcp_counter_lock); |
834 | val += memcg->nocpu_base.count[idx]; | |
835 | spin_unlock(&memcg->pcp_counter_lock); | |
711d3d2c KH |
836 | #endif |
837 | put_online_cpus(); | |
c62b1a3b KH |
838 | return val; |
839 | } | |
840 | ||
c0ff4b85 | 841 | static void mem_cgroup_swap_statistics(struct mem_cgroup *memcg, |
0c3e73e8 BS |
842 | bool charge) |
843 | { | |
844 | int val = (charge) ? 1 : -1; | |
bff6bb83 | 845 | this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_SWAP], val); |
0c3e73e8 BS |
846 | } |
847 | ||
c0ff4b85 | 848 | static unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg, |
e9f8974f JW |
849 | enum mem_cgroup_events_index idx) |
850 | { | |
851 | unsigned long val = 0; | |
852 | int cpu; | |
853 | ||
854 | for_each_online_cpu(cpu) | |
c0ff4b85 | 855 | val += per_cpu(memcg->stat->events[idx], cpu); |
e9f8974f | 856 | #ifdef CONFIG_HOTPLUG_CPU |
c0ff4b85 R |
857 | spin_lock(&memcg->pcp_counter_lock); |
858 | val += memcg->nocpu_base.events[idx]; | |
859 | spin_unlock(&memcg->pcp_counter_lock); | |
e9f8974f JW |
860 | #endif |
861 | return val; | |
862 | } | |
863 | ||
c0ff4b85 | 864 | static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg, |
b2402857 | 865 | bool anon, int nr_pages) |
d52aa412 | 866 | { |
c62b1a3b KH |
867 | preempt_disable(); |
868 | ||
b2402857 KH |
869 | /* |
870 | * Here, RSS means 'mapped anon' and anon's SwapCache. Shmem/tmpfs is | |
871 | * counted as CACHE even if it's on ANON LRU. | |
872 | */ | |
873 | if (anon) | |
874 | __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_RSS], | |
c0ff4b85 | 875 | nr_pages); |
d52aa412 | 876 | else |
b2402857 | 877 | __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_CACHE], |
c0ff4b85 | 878 | nr_pages); |
55e462b0 | 879 | |
e401f176 KH |
880 | /* pagein of a big page is an event. So, ignore page size */ |
881 | if (nr_pages > 0) | |
c0ff4b85 | 882 | __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGIN]); |
3751d604 | 883 | else { |
c0ff4b85 | 884 | __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGOUT]); |
3751d604 KH |
885 | nr_pages = -nr_pages; /* for event */ |
886 | } | |
e401f176 | 887 | |
13114716 | 888 | __this_cpu_add(memcg->stat->nr_page_events, nr_pages); |
2e72b634 | 889 | |
c62b1a3b | 890 | preempt_enable(); |
6d12e2d8 KH |
891 | } |
892 | ||
bb2a0de9 | 893 | unsigned long |
4d7dcca2 | 894 | mem_cgroup_get_lru_size(struct lruvec *lruvec, enum lru_list lru) |
074291fe KK |
895 | { |
896 | struct mem_cgroup_per_zone *mz; | |
897 | ||
898 | mz = container_of(lruvec, struct mem_cgroup_per_zone, lruvec); | |
899 | return mz->lru_size[lru]; | |
900 | } | |
901 | ||
902 | static unsigned long | |
c0ff4b85 | 903 | mem_cgroup_zone_nr_lru_pages(struct mem_cgroup *memcg, int nid, int zid, |
bb2a0de9 | 904 | unsigned int lru_mask) |
889976db YH |
905 | { |
906 | struct mem_cgroup_per_zone *mz; | |
f156ab93 | 907 | enum lru_list lru; |
bb2a0de9 KH |
908 | unsigned long ret = 0; |
909 | ||
c0ff4b85 | 910 | mz = mem_cgroup_zoneinfo(memcg, nid, zid); |
bb2a0de9 | 911 | |
f156ab93 HD |
912 | for_each_lru(lru) { |
913 | if (BIT(lru) & lru_mask) | |
914 | ret += mz->lru_size[lru]; | |
bb2a0de9 KH |
915 | } |
916 | return ret; | |
917 | } | |
918 | ||
919 | static unsigned long | |
c0ff4b85 | 920 | mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg, |
bb2a0de9 KH |
921 | int nid, unsigned int lru_mask) |
922 | { | |
889976db YH |
923 | u64 total = 0; |
924 | int zid; | |
925 | ||
bb2a0de9 | 926 | for (zid = 0; zid < MAX_NR_ZONES; zid++) |
c0ff4b85 R |
927 | total += mem_cgroup_zone_nr_lru_pages(memcg, |
928 | nid, zid, lru_mask); | |
bb2a0de9 | 929 | |
889976db YH |
930 | return total; |
931 | } | |
bb2a0de9 | 932 | |
c0ff4b85 | 933 | static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg, |
bb2a0de9 | 934 | unsigned int lru_mask) |
6d12e2d8 | 935 | { |
889976db | 936 | int nid; |
6d12e2d8 KH |
937 | u64 total = 0; |
938 | ||
31aaea4a | 939 | for_each_node_state(nid, N_MEMORY) |
c0ff4b85 | 940 | total += mem_cgroup_node_nr_lru_pages(memcg, nid, lru_mask); |
6d12e2d8 | 941 | return total; |
d52aa412 KH |
942 | } |
943 | ||
f53d7ce3 JW |
944 | static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg, |
945 | enum mem_cgroup_events_target target) | |
7a159cc9 JW |
946 | { |
947 | unsigned long val, next; | |
948 | ||
13114716 | 949 | val = __this_cpu_read(memcg->stat->nr_page_events); |
4799401f | 950 | next = __this_cpu_read(memcg->stat->targets[target]); |
7a159cc9 | 951 | /* from time_after() in jiffies.h */ |
f53d7ce3 JW |
952 | if ((long)next - (long)val < 0) { |
953 | switch (target) { | |
954 | case MEM_CGROUP_TARGET_THRESH: | |
955 | next = val + THRESHOLDS_EVENTS_TARGET; | |
956 | break; | |
957 | case MEM_CGROUP_TARGET_SOFTLIMIT: | |
958 | next = val + SOFTLIMIT_EVENTS_TARGET; | |
959 | break; | |
960 | case MEM_CGROUP_TARGET_NUMAINFO: | |
961 | next = val + NUMAINFO_EVENTS_TARGET; | |
962 | break; | |
963 | default: | |
964 | break; | |
965 | } | |
966 | __this_cpu_write(memcg->stat->targets[target], next); | |
967 | return true; | |
7a159cc9 | 968 | } |
f53d7ce3 | 969 | return false; |
d2265e6f KH |
970 | } |
971 | ||
972 | /* | |
973 | * Check events in order. | |
974 | * | |
975 | */ | |
c0ff4b85 | 976 | static void memcg_check_events(struct mem_cgroup *memcg, struct page *page) |
d2265e6f | 977 | { |
4799401f | 978 | preempt_disable(); |
d2265e6f | 979 | /* threshold event is triggered in finer grain than soft limit */ |
f53d7ce3 JW |
980 | if (unlikely(mem_cgroup_event_ratelimit(memcg, |
981 | MEM_CGROUP_TARGET_THRESH))) { | |
82b3f2a7 AM |
982 | bool do_softlimit; |
983 | bool do_numainfo __maybe_unused; | |
f53d7ce3 JW |
984 | |
985 | do_softlimit = mem_cgroup_event_ratelimit(memcg, | |
986 | MEM_CGROUP_TARGET_SOFTLIMIT); | |
987 | #if MAX_NUMNODES > 1 | |
988 | do_numainfo = mem_cgroup_event_ratelimit(memcg, | |
989 | MEM_CGROUP_TARGET_NUMAINFO); | |
990 | #endif | |
991 | preempt_enable(); | |
992 | ||
c0ff4b85 | 993 | mem_cgroup_threshold(memcg); |
f53d7ce3 | 994 | if (unlikely(do_softlimit)) |
c0ff4b85 | 995 | mem_cgroup_update_tree(memcg, page); |
453a9bf3 | 996 | #if MAX_NUMNODES > 1 |
f53d7ce3 | 997 | if (unlikely(do_numainfo)) |
c0ff4b85 | 998 | atomic_inc(&memcg->numainfo_events); |
453a9bf3 | 999 | #endif |
f53d7ce3 JW |
1000 | } else |
1001 | preempt_enable(); | |
d2265e6f KH |
1002 | } |
1003 | ||
d1a4c0b3 | 1004 | struct mem_cgroup *mem_cgroup_from_cont(struct cgroup *cont) |
8cdea7c0 | 1005 | { |
b2145145 WL |
1006 | return mem_cgroup_from_css( |
1007 | cgroup_subsys_state(cont, mem_cgroup_subsys_id)); | |
8cdea7c0 BS |
1008 | } |
1009 | ||
cf475ad2 | 1010 | struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p) |
78fb7466 | 1011 | { |
31a78f23 BS |
1012 | /* |
1013 | * mm_update_next_owner() may clear mm->owner to NULL | |
1014 | * if it races with swapoff, page migration, etc. | |
1015 | * So this can be called with p == NULL. | |
1016 | */ | |
1017 | if (unlikely(!p)) | |
1018 | return NULL; | |
1019 | ||
b2145145 | 1020 | return mem_cgroup_from_css(task_subsys_state(p, mem_cgroup_subsys_id)); |
78fb7466 PE |
1021 | } |
1022 | ||
a433658c | 1023 | struct mem_cgroup *try_get_mem_cgroup_from_mm(struct mm_struct *mm) |
54595fe2 | 1024 | { |
c0ff4b85 | 1025 | struct mem_cgroup *memcg = NULL; |
0b7f569e KH |
1026 | |
1027 | if (!mm) | |
1028 | return NULL; | |
54595fe2 KH |
1029 | /* |
1030 | * Because we have no locks, mm->owner's may be being moved to other | |
1031 | * cgroup. We use css_tryget() here even if this looks | |
1032 | * pessimistic (rather than adding locks here). | |
1033 | */ | |
1034 | rcu_read_lock(); | |
1035 | do { | |
c0ff4b85 R |
1036 | memcg = mem_cgroup_from_task(rcu_dereference(mm->owner)); |
1037 | if (unlikely(!memcg)) | |
54595fe2 | 1038 | break; |
c0ff4b85 | 1039 | } while (!css_tryget(&memcg->css)); |
54595fe2 | 1040 | rcu_read_unlock(); |
c0ff4b85 | 1041 | return memcg; |
54595fe2 KH |
1042 | } |
1043 | ||
5660048c JW |
1044 | /** |
1045 | * mem_cgroup_iter - iterate over memory cgroup hierarchy | |
1046 | * @root: hierarchy root | |
1047 | * @prev: previously returned memcg, NULL on first invocation | |
1048 | * @reclaim: cookie for shared reclaim walks, NULL for full walks | |
1049 | * | |
1050 | * Returns references to children of the hierarchy below @root, or | |
1051 | * @root itself, or %NULL after a full round-trip. | |
1052 | * | |
1053 | * Caller must pass the return value in @prev on subsequent | |
1054 | * invocations for reference counting, or use mem_cgroup_iter_break() | |
1055 | * to cancel a hierarchy walk before the round-trip is complete. | |
1056 | * | |
1057 | * Reclaimers can specify a zone and a priority level in @reclaim to | |
1058 | * divide up the memcgs in the hierarchy among all concurrent | |
1059 | * reclaimers operating on the same zone and priority. | |
1060 | */ | |
1061 | struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root, | |
1062 | struct mem_cgroup *prev, | |
1063 | struct mem_cgroup_reclaim_cookie *reclaim) | |
14067bb3 | 1064 | { |
9f3a0d09 JW |
1065 | struct mem_cgroup *memcg = NULL; |
1066 | int id = 0; | |
711d3d2c | 1067 | |
5660048c JW |
1068 | if (mem_cgroup_disabled()) |
1069 | return NULL; | |
1070 | ||
9f3a0d09 JW |
1071 | if (!root) |
1072 | root = root_mem_cgroup; | |
7d74b06f | 1073 | |
9f3a0d09 JW |
1074 | if (prev && !reclaim) |
1075 | id = css_id(&prev->css); | |
14067bb3 | 1076 | |
9f3a0d09 JW |
1077 | if (prev && prev != root) |
1078 | css_put(&prev->css); | |
14067bb3 | 1079 | |
9f3a0d09 JW |
1080 | if (!root->use_hierarchy && root != root_mem_cgroup) { |
1081 | if (prev) | |
1082 | return NULL; | |
1083 | return root; | |
1084 | } | |
14067bb3 | 1085 | |
9f3a0d09 | 1086 | while (!memcg) { |
527a5ec9 | 1087 | struct mem_cgroup_reclaim_iter *uninitialized_var(iter); |
9f3a0d09 | 1088 | struct cgroup_subsys_state *css; |
711d3d2c | 1089 | |
527a5ec9 JW |
1090 | if (reclaim) { |
1091 | int nid = zone_to_nid(reclaim->zone); | |
1092 | int zid = zone_idx(reclaim->zone); | |
1093 | struct mem_cgroup_per_zone *mz; | |
1094 | ||
1095 | mz = mem_cgroup_zoneinfo(root, nid, zid); | |
1096 | iter = &mz->reclaim_iter[reclaim->priority]; | |
1097 | if (prev && reclaim->generation != iter->generation) | |
1098 | return NULL; | |
1099 | id = iter->position; | |
1100 | } | |
7d74b06f | 1101 | |
9f3a0d09 JW |
1102 | rcu_read_lock(); |
1103 | css = css_get_next(&mem_cgroup_subsys, id + 1, &root->css, &id); | |
1104 | if (css) { | |
1105 | if (css == &root->css || css_tryget(css)) | |
b2145145 | 1106 | memcg = mem_cgroup_from_css(css); |
9f3a0d09 JW |
1107 | } else |
1108 | id = 0; | |
14067bb3 | 1109 | rcu_read_unlock(); |
14067bb3 | 1110 | |
527a5ec9 JW |
1111 | if (reclaim) { |
1112 | iter->position = id; | |
1113 | if (!css) | |
1114 | iter->generation++; | |
1115 | else if (!prev && memcg) | |
1116 | reclaim->generation = iter->generation; | |
1117 | } | |
9f3a0d09 JW |
1118 | |
1119 | if (prev && !css) | |
1120 | return NULL; | |
1121 | } | |
1122 | return memcg; | |
14067bb3 | 1123 | } |
7d74b06f | 1124 | |
5660048c JW |
1125 | /** |
1126 | * mem_cgroup_iter_break - abort a hierarchy walk prematurely | |
1127 | * @root: hierarchy root | |
1128 | * @prev: last visited hierarchy member as returned by mem_cgroup_iter() | |
1129 | */ | |
1130 | void mem_cgroup_iter_break(struct mem_cgroup *root, | |
1131 | struct mem_cgroup *prev) | |
9f3a0d09 JW |
1132 | { |
1133 | if (!root) | |
1134 | root = root_mem_cgroup; | |
1135 | if (prev && prev != root) | |
1136 | css_put(&prev->css); | |
1137 | } | |
7d74b06f | 1138 | |
9f3a0d09 JW |
1139 | /* |
1140 | * Iteration constructs for visiting all cgroups (under a tree). If | |
1141 | * loops are exited prematurely (break), mem_cgroup_iter_break() must | |
1142 | * be used for reference counting. | |
1143 | */ | |
1144 | #define for_each_mem_cgroup_tree(iter, root) \ | |
527a5ec9 | 1145 | for (iter = mem_cgroup_iter(root, NULL, NULL); \ |
9f3a0d09 | 1146 | iter != NULL; \ |
527a5ec9 | 1147 | iter = mem_cgroup_iter(root, iter, NULL)) |
711d3d2c | 1148 | |
9f3a0d09 | 1149 | #define for_each_mem_cgroup(iter) \ |
527a5ec9 | 1150 | for (iter = mem_cgroup_iter(NULL, NULL, NULL); \ |
9f3a0d09 | 1151 | iter != NULL; \ |
527a5ec9 | 1152 | iter = mem_cgroup_iter(NULL, iter, NULL)) |
14067bb3 | 1153 | |
68ae564b | 1154 | void __mem_cgroup_count_vm_event(struct mm_struct *mm, enum vm_event_item idx) |
456f998e | 1155 | { |
c0ff4b85 | 1156 | struct mem_cgroup *memcg; |
456f998e | 1157 | |
456f998e | 1158 | rcu_read_lock(); |
c0ff4b85 R |
1159 | memcg = mem_cgroup_from_task(rcu_dereference(mm->owner)); |
1160 | if (unlikely(!memcg)) | |
456f998e YH |
1161 | goto out; |
1162 | ||
1163 | switch (idx) { | |
456f998e | 1164 | case PGFAULT: |
0e574a93 JW |
1165 | this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGFAULT]); |
1166 | break; | |
1167 | case PGMAJFAULT: | |
1168 | this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGMAJFAULT]); | |
456f998e YH |
1169 | break; |
1170 | default: | |
1171 | BUG(); | |
1172 | } | |
1173 | out: | |
1174 | rcu_read_unlock(); | |
1175 | } | |
68ae564b | 1176 | EXPORT_SYMBOL(__mem_cgroup_count_vm_event); |
456f998e | 1177 | |
925b7673 JW |
1178 | /** |
1179 | * mem_cgroup_zone_lruvec - get the lru list vector for a zone and memcg | |
1180 | * @zone: zone of the wanted lruvec | |
fa9add64 | 1181 | * @memcg: memcg of the wanted lruvec |
925b7673 JW |
1182 | * |
1183 | * Returns the lru list vector holding pages for the given @zone and | |
1184 | * @mem. This can be the global zone lruvec, if the memory controller | |
1185 | * is disabled. | |
1186 | */ | |
1187 | struct lruvec *mem_cgroup_zone_lruvec(struct zone *zone, | |
1188 | struct mem_cgroup *memcg) | |
1189 | { | |
1190 | struct mem_cgroup_per_zone *mz; | |
bea8c150 | 1191 | struct lruvec *lruvec; |
925b7673 | 1192 | |
bea8c150 HD |
1193 | if (mem_cgroup_disabled()) { |
1194 | lruvec = &zone->lruvec; | |
1195 | goto out; | |
1196 | } | |
925b7673 JW |
1197 | |
1198 | mz = mem_cgroup_zoneinfo(memcg, zone_to_nid(zone), zone_idx(zone)); | |
bea8c150 HD |
1199 | lruvec = &mz->lruvec; |
1200 | out: | |
1201 | /* | |
1202 | * Since a node can be onlined after the mem_cgroup was created, | |
1203 | * we have to be prepared to initialize lruvec->zone here; | |
1204 | * and if offlined then reonlined, we need to reinitialize it. | |
1205 | */ | |
1206 | if (unlikely(lruvec->zone != zone)) | |
1207 | lruvec->zone = zone; | |
1208 | return lruvec; | |
925b7673 JW |
1209 | } |
1210 | ||
08e552c6 KH |
1211 | /* |
1212 | * Following LRU functions are allowed to be used without PCG_LOCK. | |
1213 | * Operations are called by routine of global LRU independently from memcg. | |
1214 | * What we have to take care of here is validness of pc->mem_cgroup. | |
1215 | * | |
1216 | * Changes to pc->mem_cgroup happens when | |
1217 | * 1. charge | |
1218 | * 2. moving account | |
1219 | * In typical case, "charge" is done before add-to-lru. Exception is SwapCache. | |
1220 | * It is added to LRU before charge. | |
1221 | * If PCG_USED bit is not set, page_cgroup is not added to this private LRU. | |
1222 | * When moving account, the page is not on LRU. It's isolated. | |
1223 | */ | |
4f98a2fe | 1224 | |
925b7673 | 1225 | /** |
fa9add64 | 1226 | * mem_cgroup_page_lruvec - return lruvec for adding an lru page |
925b7673 | 1227 | * @page: the page |
fa9add64 | 1228 | * @zone: zone of the page |
925b7673 | 1229 | */ |
fa9add64 | 1230 | struct lruvec *mem_cgroup_page_lruvec(struct page *page, struct zone *zone) |
08e552c6 | 1231 | { |
08e552c6 | 1232 | struct mem_cgroup_per_zone *mz; |
925b7673 JW |
1233 | struct mem_cgroup *memcg; |
1234 | struct page_cgroup *pc; | |
bea8c150 | 1235 | struct lruvec *lruvec; |
6d12e2d8 | 1236 | |
bea8c150 HD |
1237 | if (mem_cgroup_disabled()) { |
1238 | lruvec = &zone->lruvec; | |
1239 | goto out; | |
1240 | } | |
925b7673 | 1241 | |
08e552c6 | 1242 | pc = lookup_page_cgroup(page); |
38c5d72f | 1243 | memcg = pc->mem_cgroup; |
7512102c HD |
1244 | |
1245 | /* | |
fa9add64 | 1246 | * Surreptitiously switch any uncharged offlist page to root: |
7512102c HD |
1247 | * an uncharged page off lru does nothing to secure |
1248 | * its former mem_cgroup from sudden removal. | |
1249 | * | |
1250 | * Our caller holds lru_lock, and PageCgroupUsed is updated | |
1251 | * under page_cgroup lock: between them, they make all uses | |
1252 | * of pc->mem_cgroup safe. | |
1253 | */ | |
fa9add64 | 1254 | if (!PageLRU(page) && !PageCgroupUsed(pc) && memcg != root_mem_cgroup) |
7512102c HD |
1255 | pc->mem_cgroup = memcg = root_mem_cgroup; |
1256 | ||
925b7673 | 1257 | mz = page_cgroup_zoneinfo(memcg, page); |
bea8c150 HD |
1258 | lruvec = &mz->lruvec; |
1259 | out: | |
1260 | /* | |
1261 | * Since a node can be onlined after the mem_cgroup was created, | |
1262 | * we have to be prepared to initialize lruvec->zone here; | |
1263 | * and if offlined then reonlined, we need to reinitialize it. | |
1264 | */ | |
1265 | if (unlikely(lruvec->zone != zone)) | |
1266 | lruvec->zone = zone; | |
1267 | return lruvec; | |
08e552c6 | 1268 | } |
b69408e8 | 1269 | |
925b7673 | 1270 | /** |
fa9add64 HD |
1271 | * mem_cgroup_update_lru_size - account for adding or removing an lru page |
1272 | * @lruvec: mem_cgroup per zone lru vector | |
1273 | * @lru: index of lru list the page is sitting on | |
1274 | * @nr_pages: positive when adding or negative when removing | |
925b7673 | 1275 | * |
fa9add64 HD |
1276 | * This function must be called when a page is added to or removed from an |
1277 | * lru list. | |
3f58a829 | 1278 | */ |
fa9add64 HD |
1279 | void mem_cgroup_update_lru_size(struct lruvec *lruvec, enum lru_list lru, |
1280 | int nr_pages) | |
3f58a829 MK |
1281 | { |
1282 | struct mem_cgroup_per_zone *mz; | |
fa9add64 | 1283 | unsigned long *lru_size; |
3f58a829 MK |
1284 | |
1285 | if (mem_cgroup_disabled()) | |
1286 | return; | |
1287 | ||
fa9add64 HD |
1288 | mz = container_of(lruvec, struct mem_cgroup_per_zone, lruvec); |
1289 | lru_size = mz->lru_size + lru; | |
1290 | *lru_size += nr_pages; | |
1291 | VM_BUG_ON((long)(*lru_size) < 0); | |
08e552c6 | 1292 | } |
544122e5 | 1293 | |
3e92041d | 1294 | /* |
c0ff4b85 | 1295 | * Checks whether given mem is same or in the root_mem_cgroup's |
3e92041d MH |
1296 | * hierarchy subtree |
1297 | */ | |
c3ac9a8a JW |
1298 | bool __mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg, |
1299 | struct mem_cgroup *memcg) | |
3e92041d | 1300 | { |
91c63734 JW |
1301 | if (root_memcg == memcg) |
1302 | return true; | |
3a981f48 | 1303 | if (!root_memcg->use_hierarchy || !memcg) |
91c63734 | 1304 | return false; |
c3ac9a8a JW |
1305 | return css_is_ancestor(&memcg->css, &root_memcg->css); |
1306 | } | |
1307 | ||
1308 | static bool mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg, | |
1309 | struct mem_cgroup *memcg) | |
1310 | { | |
1311 | bool ret; | |
1312 | ||
91c63734 | 1313 | rcu_read_lock(); |
c3ac9a8a | 1314 | ret = __mem_cgroup_same_or_subtree(root_memcg, memcg); |
91c63734 JW |
1315 | rcu_read_unlock(); |
1316 | return ret; | |
3e92041d MH |
1317 | } |
1318 | ||
c0ff4b85 | 1319 | int task_in_mem_cgroup(struct task_struct *task, const struct mem_cgroup *memcg) |
4c4a2214 DR |
1320 | { |
1321 | int ret; | |
0b7f569e | 1322 | struct mem_cgroup *curr = NULL; |
158e0a2d | 1323 | struct task_struct *p; |
4c4a2214 | 1324 | |
158e0a2d | 1325 | p = find_lock_task_mm(task); |
de077d22 DR |
1326 | if (p) { |
1327 | curr = try_get_mem_cgroup_from_mm(p->mm); | |
1328 | task_unlock(p); | |
1329 | } else { | |
1330 | /* | |
1331 | * All threads may have already detached their mm's, but the oom | |
1332 | * killer still needs to detect if they have already been oom | |
1333 | * killed to prevent needlessly killing additional tasks. | |
1334 | */ | |
1335 | task_lock(task); | |
1336 | curr = mem_cgroup_from_task(task); | |
1337 | if (curr) | |
1338 | css_get(&curr->css); | |
1339 | task_unlock(task); | |
1340 | } | |
0b7f569e KH |
1341 | if (!curr) |
1342 | return 0; | |
d31f56db | 1343 | /* |
c0ff4b85 | 1344 | * We should check use_hierarchy of "memcg" not "curr". Because checking |
d31f56db | 1345 | * use_hierarchy of "curr" here make this function true if hierarchy is |
c0ff4b85 R |
1346 | * enabled in "curr" and "curr" is a child of "memcg" in *cgroup* |
1347 | * hierarchy(even if use_hierarchy is disabled in "memcg"). | |
d31f56db | 1348 | */ |
c0ff4b85 | 1349 | ret = mem_cgroup_same_or_subtree(memcg, curr); |
0b7f569e | 1350 | css_put(&curr->css); |
4c4a2214 DR |
1351 | return ret; |
1352 | } | |
1353 | ||
c56d5c7d | 1354 | int mem_cgroup_inactive_anon_is_low(struct lruvec *lruvec) |
14797e23 | 1355 | { |
9b272977 | 1356 | unsigned long inactive_ratio; |
14797e23 | 1357 | unsigned long inactive; |
9b272977 | 1358 | unsigned long active; |
c772be93 | 1359 | unsigned long gb; |
14797e23 | 1360 | |
4d7dcca2 HD |
1361 | inactive = mem_cgroup_get_lru_size(lruvec, LRU_INACTIVE_ANON); |
1362 | active = mem_cgroup_get_lru_size(lruvec, LRU_ACTIVE_ANON); | |
14797e23 | 1363 | |
c772be93 KM |
1364 | gb = (inactive + active) >> (30 - PAGE_SHIFT); |
1365 | if (gb) | |
1366 | inactive_ratio = int_sqrt(10 * gb); | |
1367 | else | |
1368 | inactive_ratio = 1; | |
1369 | ||
9b272977 | 1370 | return inactive * inactive_ratio < active; |
14797e23 KM |
1371 | } |
1372 | ||
c56d5c7d | 1373 | int mem_cgroup_inactive_file_is_low(struct lruvec *lruvec) |
56e49d21 RR |
1374 | { |
1375 | unsigned long active; | |
1376 | unsigned long inactive; | |
1377 | ||
4d7dcca2 HD |
1378 | inactive = mem_cgroup_get_lru_size(lruvec, LRU_INACTIVE_FILE); |
1379 | active = mem_cgroup_get_lru_size(lruvec, LRU_ACTIVE_FILE); | |
56e49d21 RR |
1380 | |
1381 | return (active > inactive); | |
1382 | } | |
1383 | ||
6d61ef40 BS |
1384 | #define mem_cgroup_from_res_counter(counter, member) \ |
1385 | container_of(counter, struct mem_cgroup, member) | |
1386 | ||
19942822 | 1387 | /** |
9d11ea9f | 1388 | * mem_cgroup_margin - calculate chargeable space of a memory cgroup |
dad7557e | 1389 | * @memcg: the memory cgroup |
19942822 | 1390 | * |
9d11ea9f | 1391 | * Returns the maximum amount of memory @mem can be charged with, in |
7ec99d62 | 1392 | * pages. |
19942822 | 1393 | */ |
c0ff4b85 | 1394 | static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg) |
19942822 | 1395 | { |
9d11ea9f JW |
1396 | unsigned long long margin; |
1397 | ||
c0ff4b85 | 1398 | margin = res_counter_margin(&memcg->res); |
9d11ea9f | 1399 | if (do_swap_account) |
c0ff4b85 | 1400 | margin = min(margin, res_counter_margin(&memcg->memsw)); |
7ec99d62 | 1401 | return margin >> PAGE_SHIFT; |
19942822 JW |
1402 | } |
1403 | ||
1f4c025b | 1404 | int mem_cgroup_swappiness(struct mem_cgroup *memcg) |
a7885eb8 KM |
1405 | { |
1406 | struct cgroup *cgrp = memcg->css.cgroup; | |
a7885eb8 KM |
1407 | |
1408 | /* root ? */ | |
1409 | if (cgrp->parent == NULL) | |
1410 | return vm_swappiness; | |
1411 | ||
bf1ff263 | 1412 | return memcg->swappiness; |
a7885eb8 KM |
1413 | } |
1414 | ||
619d094b KH |
1415 | /* |
1416 | * memcg->moving_account is used for checking possibility that some thread is | |
1417 | * calling move_account(). When a thread on CPU-A starts moving pages under | |
1418 | * a memcg, other threads should check memcg->moving_account under | |
1419 | * rcu_read_lock(), like this: | |
1420 | * | |
1421 | * CPU-A CPU-B | |
1422 | * rcu_read_lock() | |
1423 | * memcg->moving_account+1 if (memcg->mocing_account) | |
1424 | * take heavy locks. | |
1425 | * synchronize_rcu() update something. | |
1426 | * rcu_read_unlock() | |
1427 | * start move here. | |
1428 | */ | |
4331f7d3 KH |
1429 | |
1430 | /* for quick checking without looking up memcg */ | |
1431 | atomic_t memcg_moving __read_mostly; | |
1432 | ||
c0ff4b85 | 1433 | static void mem_cgroup_start_move(struct mem_cgroup *memcg) |
32047e2a | 1434 | { |
4331f7d3 | 1435 | atomic_inc(&memcg_moving); |
619d094b | 1436 | atomic_inc(&memcg->moving_account); |
32047e2a KH |
1437 | synchronize_rcu(); |
1438 | } | |
1439 | ||
c0ff4b85 | 1440 | static void mem_cgroup_end_move(struct mem_cgroup *memcg) |
32047e2a | 1441 | { |
619d094b KH |
1442 | /* |
1443 | * Now, mem_cgroup_clear_mc() may call this function with NULL. | |
1444 | * We check NULL in callee rather than caller. | |
1445 | */ | |
4331f7d3 KH |
1446 | if (memcg) { |
1447 | atomic_dec(&memcg_moving); | |
619d094b | 1448 | atomic_dec(&memcg->moving_account); |
4331f7d3 | 1449 | } |
32047e2a | 1450 | } |
619d094b | 1451 | |
32047e2a KH |
1452 | /* |
1453 | * 2 routines for checking "mem" is under move_account() or not. | |
1454 | * | |
13fd1dd9 AM |
1455 | * mem_cgroup_stolen() - checking whether a cgroup is mc.from or not. This |
1456 | * is used for avoiding races in accounting. If true, | |
32047e2a KH |
1457 | * pc->mem_cgroup may be overwritten. |
1458 | * | |
1459 | * mem_cgroup_under_move() - checking a cgroup is mc.from or mc.to or | |
1460 | * under hierarchy of moving cgroups. This is for | |
1461 | * waiting at hith-memory prressure caused by "move". | |
1462 | */ | |
1463 | ||
13fd1dd9 | 1464 | static bool mem_cgroup_stolen(struct mem_cgroup *memcg) |
32047e2a KH |
1465 | { |
1466 | VM_BUG_ON(!rcu_read_lock_held()); | |
619d094b | 1467 | return atomic_read(&memcg->moving_account) > 0; |
32047e2a | 1468 | } |
4b534334 | 1469 | |
c0ff4b85 | 1470 | static bool mem_cgroup_under_move(struct mem_cgroup *memcg) |
4b534334 | 1471 | { |
2bd9bb20 KH |
1472 | struct mem_cgroup *from; |
1473 | struct mem_cgroup *to; | |
4b534334 | 1474 | bool ret = false; |
2bd9bb20 KH |
1475 | /* |
1476 | * Unlike task_move routines, we access mc.to, mc.from not under | |
1477 | * mutual exclusion by cgroup_mutex. Here, we take spinlock instead. | |
1478 | */ | |
1479 | spin_lock(&mc.lock); | |
1480 | from = mc.from; | |
1481 | to = mc.to; | |
1482 | if (!from) | |
1483 | goto unlock; | |
3e92041d | 1484 | |
c0ff4b85 R |
1485 | ret = mem_cgroup_same_or_subtree(memcg, from) |
1486 | || mem_cgroup_same_or_subtree(memcg, to); | |
2bd9bb20 KH |
1487 | unlock: |
1488 | spin_unlock(&mc.lock); | |
4b534334 KH |
1489 | return ret; |
1490 | } | |
1491 | ||
c0ff4b85 | 1492 | static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg) |
4b534334 KH |
1493 | { |
1494 | if (mc.moving_task && current != mc.moving_task) { | |
c0ff4b85 | 1495 | if (mem_cgroup_under_move(memcg)) { |
4b534334 KH |
1496 | DEFINE_WAIT(wait); |
1497 | prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE); | |
1498 | /* moving charge context might have finished. */ | |
1499 | if (mc.moving_task) | |
1500 | schedule(); | |
1501 | finish_wait(&mc.waitq, &wait); | |
1502 | return true; | |
1503 | } | |
1504 | } | |
1505 | return false; | |
1506 | } | |
1507 | ||
312734c0 KH |
1508 | /* |
1509 | * Take this lock when | |
1510 | * - a code tries to modify page's memcg while it's USED. | |
1511 | * - a code tries to modify page state accounting in a memcg. | |
13fd1dd9 | 1512 | * see mem_cgroup_stolen(), too. |
312734c0 KH |
1513 | */ |
1514 | static void move_lock_mem_cgroup(struct mem_cgroup *memcg, | |
1515 | unsigned long *flags) | |
1516 | { | |
1517 | spin_lock_irqsave(&memcg->move_lock, *flags); | |
1518 | } | |
1519 | ||
1520 | static void move_unlock_mem_cgroup(struct mem_cgroup *memcg, | |
1521 | unsigned long *flags) | |
1522 | { | |
1523 | spin_unlock_irqrestore(&memcg->move_lock, *flags); | |
1524 | } | |
1525 | ||
e222432b | 1526 | /** |
6a6135b6 | 1527 | * mem_cgroup_print_oom_info: Called from OOM with tasklist_lock held in read mode. |
e222432b BS |
1528 | * @memcg: The memory cgroup that went over limit |
1529 | * @p: Task that is going to be killed | |
1530 | * | |
1531 | * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is | |
1532 | * enabled | |
1533 | */ | |
1534 | void mem_cgroup_print_oom_info(struct mem_cgroup *memcg, struct task_struct *p) | |
1535 | { | |
1536 | struct cgroup *task_cgrp; | |
1537 | struct cgroup *mem_cgrp; | |
1538 | /* | |
1539 | * Need a buffer in BSS, can't rely on allocations. The code relies | |
1540 | * on the assumption that OOM is serialized for memory controller. | |
1541 | * If this assumption is broken, revisit this code. | |
1542 | */ | |
1543 | static char memcg_name[PATH_MAX]; | |
1544 | int ret; | |
1545 | ||
d31f56db | 1546 | if (!memcg || !p) |
e222432b BS |
1547 | return; |
1548 | ||
e222432b BS |
1549 | rcu_read_lock(); |
1550 | ||
1551 | mem_cgrp = memcg->css.cgroup; | |
1552 | task_cgrp = task_cgroup(p, mem_cgroup_subsys_id); | |
1553 | ||
1554 | ret = cgroup_path(task_cgrp, memcg_name, PATH_MAX); | |
1555 | if (ret < 0) { | |
1556 | /* | |
1557 | * Unfortunately, we are unable to convert to a useful name | |
1558 | * But we'll still print out the usage information | |
1559 | */ | |
1560 | rcu_read_unlock(); | |
1561 | goto done; | |
1562 | } | |
1563 | rcu_read_unlock(); | |
1564 | ||
1565 | printk(KERN_INFO "Task in %s killed", memcg_name); | |
1566 | ||
1567 | rcu_read_lock(); | |
1568 | ret = cgroup_path(mem_cgrp, memcg_name, PATH_MAX); | |
1569 | if (ret < 0) { | |
1570 | rcu_read_unlock(); | |
1571 | goto done; | |
1572 | } | |
1573 | rcu_read_unlock(); | |
1574 | ||
1575 | /* | |
1576 | * Continues from above, so we don't need an KERN_ level | |
1577 | */ | |
1578 | printk(KERN_CONT " as a result of limit of %s\n", memcg_name); | |
1579 | done: | |
1580 | ||
1581 | printk(KERN_INFO "memory: usage %llukB, limit %llukB, failcnt %llu\n", | |
1582 | res_counter_read_u64(&memcg->res, RES_USAGE) >> 10, | |
1583 | res_counter_read_u64(&memcg->res, RES_LIMIT) >> 10, | |
1584 | res_counter_read_u64(&memcg->res, RES_FAILCNT)); | |
1585 | printk(KERN_INFO "memory+swap: usage %llukB, limit %llukB, " | |
1586 | "failcnt %llu\n", | |
1587 | res_counter_read_u64(&memcg->memsw, RES_USAGE) >> 10, | |
1588 | res_counter_read_u64(&memcg->memsw, RES_LIMIT) >> 10, | |
1589 | res_counter_read_u64(&memcg->memsw, RES_FAILCNT)); | |
510fc4e1 GC |
1590 | printk(KERN_INFO "kmem: usage %llukB, limit %llukB, failcnt %llu\n", |
1591 | res_counter_read_u64(&memcg->kmem, RES_USAGE) >> 10, | |
1592 | res_counter_read_u64(&memcg->kmem, RES_LIMIT) >> 10, | |
1593 | res_counter_read_u64(&memcg->kmem, RES_FAILCNT)); | |
e222432b BS |
1594 | } |
1595 | ||
81d39c20 KH |
1596 | /* |
1597 | * This function returns the number of memcg under hierarchy tree. Returns | |
1598 | * 1(self count) if no children. | |
1599 | */ | |
c0ff4b85 | 1600 | static int mem_cgroup_count_children(struct mem_cgroup *memcg) |
81d39c20 KH |
1601 | { |
1602 | int num = 0; | |
7d74b06f KH |
1603 | struct mem_cgroup *iter; |
1604 | ||
c0ff4b85 | 1605 | for_each_mem_cgroup_tree(iter, memcg) |
7d74b06f | 1606 | num++; |
81d39c20 KH |
1607 | return num; |
1608 | } | |
1609 | ||
a63d83f4 DR |
1610 | /* |
1611 | * Return the memory (and swap, if configured) limit for a memcg. | |
1612 | */ | |
9cbb78bb | 1613 | static u64 mem_cgroup_get_limit(struct mem_cgroup *memcg) |
a63d83f4 DR |
1614 | { |
1615 | u64 limit; | |
a63d83f4 | 1616 | |
f3e8eb70 | 1617 | limit = res_counter_read_u64(&memcg->res, RES_LIMIT); |
f3e8eb70 | 1618 | |
a63d83f4 | 1619 | /* |
9a5a8f19 | 1620 | * Do not consider swap space if we cannot swap due to swappiness |
a63d83f4 | 1621 | */ |
9a5a8f19 MH |
1622 | if (mem_cgroup_swappiness(memcg)) { |
1623 | u64 memsw; | |
1624 | ||
1625 | limit += total_swap_pages << PAGE_SHIFT; | |
1626 | memsw = res_counter_read_u64(&memcg->memsw, RES_LIMIT); | |
1627 | ||
1628 | /* | |
1629 | * If memsw is finite and limits the amount of swap space | |
1630 | * available to this memcg, return that limit. | |
1631 | */ | |
1632 | limit = min(limit, memsw); | |
1633 | } | |
1634 | ||
1635 | return limit; | |
a63d83f4 DR |
1636 | } |
1637 | ||
19965460 DR |
1638 | static void mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask, |
1639 | int order) | |
9cbb78bb DR |
1640 | { |
1641 | struct mem_cgroup *iter; | |
1642 | unsigned long chosen_points = 0; | |
1643 | unsigned long totalpages; | |
1644 | unsigned int points = 0; | |
1645 | struct task_struct *chosen = NULL; | |
1646 | ||
876aafbf DR |
1647 | /* |
1648 | * If current has a pending SIGKILL, then automatically select it. The | |
1649 | * goal is to allow it to allocate so that it may quickly exit and free | |
1650 | * its memory. | |
1651 | */ | |
1652 | if (fatal_signal_pending(current)) { | |
1653 | set_thread_flag(TIF_MEMDIE); | |
1654 | return; | |
1655 | } | |
1656 | ||
1657 | check_panic_on_oom(CONSTRAINT_MEMCG, gfp_mask, order, NULL); | |
9cbb78bb DR |
1658 | totalpages = mem_cgroup_get_limit(memcg) >> PAGE_SHIFT ? : 1; |
1659 | for_each_mem_cgroup_tree(iter, memcg) { | |
1660 | struct cgroup *cgroup = iter->css.cgroup; | |
1661 | struct cgroup_iter it; | |
1662 | struct task_struct *task; | |
1663 | ||
1664 | cgroup_iter_start(cgroup, &it); | |
1665 | while ((task = cgroup_iter_next(cgroup, &it))) { | |
1666 | switch (oom_scan_process_thread(task, totalpages, NULL, | |
1667 | false)) { | |
1668 | case OOM_SCAN_SELECT: | |
1669 | if (chosen) | |
1670 | put_task_struct(chosen); | |
1671 | chosen = task; | |
1672 | chosen_points = ULONG_MAX; | |
1673 | get_task_struct(chosen); | |
1674 | /* fall through */ | |
1675 | case OOM_SCAN_CONTINUE: | |
1676 | continue; | |
1677 | case OOM_SCAN_ABORT: | |
1678 | cgroup_iter_end(cgroup, &it); | |
1679 | mem_cgroup_iter_break(memcg, iter); | |
1680 | if (chosen) | |
1681 | put_task_struct(chosen); | |
1682 | return; | |
1683 | case OOM_SCAN_OK: | |
1684 | break; | |
1685 | }; | |
1686 | points = oom_badness(task, memcg, NULL, totalpages); | |
1687 | if (points > chosen_points) { | |
1688 | if (chosen) | |
1689 | put_task_struct(chosen); | |
1690 | chosen = task; | |
1691 | chosen_points = points; | |
1692 | get_task_struct(chosen); | |
1693 | } | |
1694 | } | |
1695 | cgroup_iter_end(cgroup, &it); | |
1696 | } | |
1697 | ||
1698 | if (!chosen) | |
1699 | return; | |
1700 | points = chosen_points * 1000 / totalpages; | |
9cbb78bb DR |
1701 | oom_kill_process(chosen, gfp_mask, order, points, totalpages, memcg, |
1702 | NULL, "Memory cgroup out of memory"); | |
9cbb78bb DR |
1703 | } |
1704 | ||
5660048c JW |
1705 | static unsigned long mem_cgroup_reclaim(struct mem_cgroup *memcg, |
1706 | gfp_t gfp_mask, | |
1707 | unsigned long flags) | |
1708 | { | |
1709 | unsigned long total = 0; | |
1710 | bool noswap = false; | |
1711 | int loop; | |
1712 | ||
1713 | if (flags & MEM_CGROUP_RECLAIM_NOSWAP) | |
1714 | noswap = true; | |
1715 | if (!(flags & MEM_CGROUP_RECLAIM_SHRINK) && memcg->memsw_is_minimum) | |
1716 | noswap = true; | |
1717 | ||
1718 | for (loop = 0; loop < MEM_CGROUP_MAX_RECLAIM_LOOPS; loop++) { | |
1719 | if (loop) | |
1720 | drain_all_stock_async(memcg); | |
1721 | total += try_to_free_mem_cgroup_pages(memcg, gfp_mask, noswap); | |
1722 | /* | |
1723 | * Allow limit shrinkers, which are triggered directly | |
1724 | * by userspace, to catch signals and stop reclaim | |
1725 | * after minimal progress, regardless of the margin. | |
1726 | */ | |
1727 | if (total && (flags & MEM_CGROUP_RECLAIM_SHRINK)) | |
1728 | break; | |
1729 | if (mem_cgroup_margin(memcg)) | |
1730 | break; | |
1731 | /* | |
1732 | * If nothing was reclaimed after two attempts, there | |
1733 | * may be no reclaimable pages in this hierarchy. | |
1734 | */ | |
1735 | if (loop && !total) | |
1736 | break; | |
1737 | } | |
1738 | return total; | |
1739 | } | |
1740 | ||
4d0c066d KH |
1741 | /** |
1742 | * test_mem_cgroup_node_reclaimable | |
dad7557e | 1743 | * @memcg: the target memcg |
4d0c066d KH |
1744 | * @nid: the node ID to be checked. |
1745 | * @noswap : specify true here if the user wants flle only information. | |
1746 | * | |
1747 | * This function returns whether the specified memcg contains any | |
1748 | * reclaimable pages on a node. Returns true if there are any reclaimable | |
1749 | * pages in the node. | |
1750 | */ | |
c0ff4b85 | 1751 | static bool test_mem_cgroup_node_reclaimable(struct mem_cgroup *memcg, |
4d0c066d KH |
1752 | int nid, bool noswap) |
1753 | { | |
c0ff4b85 | 1754 | if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_FILE)) |
4d0c066d KH |
1755 | return true; |
1756 | if (noswap || !total_swap_pages) | |
1757 | return false; | |
c0ff4b85 | 1758 | if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_ANON)) |
4d0c066d KH |
1759 | return true; |
1760 | return false; | |
1761 | ||
1762 | } | |
889976db YH |
1763 | #if MAX_NUMNODES > 1 |
1764 | ||
1765 | /* | |
1766 | * Always updating the nodemask is not very good - even if we have an empty | |
1767 | * list or the wrong list here, we can start from some node and traverse all | |
1768 | * nodes based on the zonelist. So update the list loosely once per 10 secs. | |
1769 | * | |
1770 | */ | |
c0ff4b85 | 1771 | static void mem_cgroup_may_update_nodemask(struct mem_cgroup *memcg) |
889976db YH |
1772 | { |
1773 | int nid; | |
453a9bf3 KH |
1774 | /* |
1775 | * numainfo_events > 0 means there was at least NUMAINFO_EVENTS_TARGET | |
1776 | * pagein/pageout changes since the last update. | |
1777 | */ | |
c0ff4b85 | 1778 | if (!atomic_read(&memcg->numainfo_events)) |
453a9bf3 | 1779 | return; |
c0ff4b85 | 1780 | if (atomic_inc_return(&memcg->numainfo_updating) > 1) |
889976db YH |
1781 | return; |
1782 | ||
889976db | 1783 | /* make a nodemask where this memcg uses memory from */ |
31aaea4a | 1784 | memcg->scan_nodes = node_states[N_MEMORY]; |
889976db | 1785 | |
31aaea4a | 1786 | for_each_node_mask(nid, node_states[N_MEMORY]) { |
889976db | 1787 | |
c0ff4b85 R |
1788 | if (!test_mem_cgroup_node_reclaimable(memcg, nid, false)) |
1789 | node_clear(nid, memcg->scan_nodes); | |
889976db | 1790 | } |
453a9bf3 | 1791 | |
c0ff4b85 R |
1792 | atomic_set(&memcg->numainfo_events, 0); |
1793 | atomic_set(&memcg->numainfo_updating, 0); | |
889976db YH |
1794 | } |
1795 | ||
1796 | /* | |
1797 | * Selecting a node where we start reclaim from. Because what we need is just | |
1798 | * reducing usage counter, start from anywhere is O,K. Considering | |
1799 | * memory reclaim from current node, there are pros. and cons. | |
1800 | * | |
1801 | * Freeing memory from current node means freeing memory from a node which | |
1802 | * we'll use or we've used. So, it may make LRU bad. And if several threads | |
1803 | * hit limits, it will see a contention on a node. But freeing from remote | |
1804 | * node means more costs for memory reclaim because of memory latency. | |
1805 | * | |
1806 | * Now, we use round-robin. Better algorithm is welcomed. | |
1807 | */ | |
c0ff4b85 | 1808 | int mem_cgroup_select_victim_node(struct mem_cgroup *memcg) |
889976db YH |
1809 | { |
1810 | int node; | |
1811 | ||
c0ff4b85 R |
1812 | mem_cgroup_may_update_nodemask(memcg); |
1813 | node = memcg->last_scanned_node; | |
889976db | 1814 | |
c0ff4b85 | 1815 | node = next_node(node, memcg->scan_nodes); |
889976db | 1816 | if (node == MAX_NUMNODES) |
c0ff4b85 | 1817 | node = first_node(memcg->scan_nodes); |
889976db YH |
1818 | /* |
1819 | * We call this when we hit limit, not when pages are added to LRU. | |
1820 | * No LRU may hold pages because all pages are UNEVICTABLE or | |
1821 | * memcg is too small and all pages are not on LRU. In that case, | |
1822 | * we use curret node. | |
1823 | */ | |
1824 | if (unlikely(node == MAX_NUMNODES)) | |
1825 | node = numa_node_id(); | |
1826 | ||
c0ff4b85 | 1827 | memcg->last_scanned_node = node; |
889976db YH |
1828 | return node; |
1829 | } | |
1830 | ||
4d0c066d KH |
1831 | /* |
1832 | * Check all nodes whether it contains reclaimable pages or not. | |
1833 | * For quick scan, we make use of scan_nodes. This will allow us to skip | |
1834 | * unused nodes. But scan_nodes is lazily updated and may not cotain | |
1835 | * enough new information. We need to do double check. | |
1836 | */ | |
6bbda35c | 1837 | static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap) |
4d0c066d KH |
1838 | { |
1839 | int nid; | |
1840 | ||
1841 | /* | |
1842 | * quick check...making use of scan_node. | |
1843 | * We can skip unused nodes. | |
1844 | */ | |
c0ff4b85 R |
1845 | if (!nodes_empty(memcg->scan_nodes)) { |
1846 | for (nid = first_node(memcg->scan_nodes); | |
4d0c066d | 1847 | nid < MAX_NUMNODES; |
c0ff4b85 | 1848 | nid = next_node(nid, memcg->scan_nodes)) { |
4d0c066d | 1849 | |
c0ff4b85 | 1850 | if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap)) |
4d0c066d KH |
1851 | return true; |
1852 | } | |
1853 | } | |
1854 | /* | |
1855 | * Check rest of nodes. | |
1856 | */ | |
31aaea4a | 1857 | for_each_node_state(nid, N_MEMORY) { |
c0ff4b85 | 1858 | if (node_isset(nid, memcg->scan_nodes)) |
4d0c066d | 1859 | continue; |
c0ff4b85 | 1860 | if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap)) |
4d0c066d KH |
1861 | return true; |
1862 | } | |
1863 | return false; | |
1864 | } | |
1865 | ||
889976db | 1866 | #else |
c0ff4b85 | 1867 | int mem_cgroup_select_victim_node(struct mem_cgroup *memcg) |
889976db YH |
1868 | { |
1869 | return 0; | |
1870 | } | |
4d0c066d | 1871 | |
6bbda35c | 1872 | static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap) |
4d0c066d | 1873 | { |
c0ff4b85 | 1874 | return test_mem_cgroup_node_reclaimable(memcg, 0, noswap); |
4d0c066d | 1875 | } |
889976db YH |
1876 | #endif |
1877 | ||
5660048c JW |
1878 | static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg, |
1879 | struct zone *zone, | |
1880 | gfp_t gfp_mask, | |
1881 | unsigned long *total_scanned) | |
6d61ef40 | 1882 | { |
9f3a0d09 | 1883 | struct mem_cgroup *victim = NULL; |
5660048c | 1884 | int total = 0; |
04046e1a | 1885 | int loop = 0; |
9d11ea9f | 1886 | unsigned long excess; |
185efc0f | 1887 | unsigned long nr_scanned; |
527a5ec9 JW |
1888 | struct mem_cgroup_reclaim_cookie reclaim = { |
1889 | .zone = zone, | |
1890 | .priority = 0, | |
1891 | }; | |
9d11ea9f | 1892 | |
c0ff4b85 | 1893 | excess = res_counter_soft_limit_excess(&root_memcg->res) >> PAGE_SHIFT; |
04046e1a | 1894 | |
4e416953 | 1895 | while (1) { |
527a5ec9 | 1896 | victim = mem_cgroup_iter(root_memcg, victim, &reclaim); |
9f3a0d09 | 1897 | if (!victim) { |
04046e1a | 1898 | loop++; |
4e416953 BS |
1899 | if (loop >= 2) { |
1900 | /* | |
1901 | * If we have not been able to reclaim | |
1902 | * anything, it might because there are | |
1903 | * no reclaimable pages under this hierarchy | |
1904 | */ | |
5660048c | 1905 | if (!total) |
4e416953 | 1906 | break; |
4e416953 | 1907 | /* |
25985edc | 1908 | * We want to do more targeted reclaim. |
4e416953 BS |
1909 | * excess >> 2 is not to excessive so as to |
1910 | * reclaim too much, nor too less that we keep | |
1911 | * coming back to reclaim from this cgroup | |
1912 | */ | |
1913 | if (total >= (excess >> 2) || | |
9f3a0d09 | 1914 | (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS)) |
4e416953 | 1915 | break; |
4e416953 | 1916 | } |
9f3a0d09 | 1917 | continue; |
4e416953 | 1918 | } |
5660048c | 1919 | if (!mem_cgroup_reclaimable(victim, false)) |
6d61ef40 | 1920 | continue; |
5660048c JW |
1921 | total += mem_cgroup_shrink_node_zone(victim, gfp_mask, false, |
1922 | zone, &nr_scanned); | |
1923 | *total_scanned += nr_scanned; | |
1924 | if (!res_counter_soft_limit_excess(&root_memcg->res)) | |
9f3a0d09 | 1925 | break; |
6d61ef40 | 1926 | } |
9f3a0d09 | 1927 | mem_cgroup_iter_break(root_memcg, victim); |
04046e1a | 1928 | return total; |
6d61ef40 BS |
1929 | } |
1930 | ||
867578cb KH |
1931 | /* |
1932 | * Check OOM-Killer is already running under our hierarchy. | |
1933 | * If someone is running, return false. | |
1af8efe9 | 1934 | * Has to be called with memcg_oom_lock |
867578cb | 1935 | */ |
c0ff4b85 | 1936 | static bool mem_cgroup_oom_lock(struct mem_cgroup *memcg) |
867578cb | 1937 | { |
79dfdacc | 1938 | struct mem_cgroup *iter, *failed = NULL; |
a636b327 | 1939 | |
9f3a0d09 | 1940 | for_each_mem_cgroup_tree(iter, memcg) { |
23751be0 | 1941 | if (iter->oom_lock) { |
79dfdacc MH |
1942 | /* |
1943 | * this subtree of our hierarchy is already locked | |
1944 | * so we cannot give a lock. | |
1945 | */ | |
79dfdacc | 1946 | failed = iter; |
9f3a0d09 JW |
1947 | mem_cgroup_iter_break(memcg, iter); |
1948 | break; | |
23751be0 JW |
1949 | } else |
1950 | iter->oom_lock = true; | |
7d74b06f | 1951 | } |
867578cb | 1952 | |
79dfdacc | 1953 | if (!failed) |
23751be0 | 1954 | return true; |
79dfdacc MH |
1955 | |
1956 | /* | |
1957 | * OK, we failed to lock the whole subtree so we have to clean up | |
1958 | * what we set up to the failing subtree | |
1959 | */ | |
9f3a0d09 | 1960 | for_each_mem_cgroup_tree(iter, memcg) { |
79dfdacc | 1961 | if (iter == failed) { |
9f3a0d09 JW |
1962 | mem_cgroup_iter_break(memcg, iter); |
1963 | break; | |
79dfdacc MH |
1964 | } |
1965 | iter->oom_lock = false; | |
1966 | } | |
23751be0 | 1967 | return false; |
a636b327 | 1968 | } |
0b7f569e | 1969 | |
79dfdacc | 1970 | /* |
1af8efe9 | 1971 | * Has to be called with memcg_oom_lock |
79dfdacc | 1972 | */ |
c0ff4b85 | 1973 | static int mem_cgroup_oom_unlock(struct mem_cgroup *memcg) |
0b7f569e | 1974 | { |
7d74b06f KH |
1975 | struct mem_cgroup *iter; |
1976 | ||
c0ff4b85 | 1977 | for_each_mem_cgroup_tree(iter, memcg) |
79dfdacc MH |
1978 | iter->oom_lock = false; |
1979 | return 0; | |
1980 | } | |
1981 | ||
c0ff4b85 | 1982 | static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg) |
79dfdacc MH |
1983 | { |
1984 | struct mem_cgroup *iter; | |
1985 | ||
c0ff4b85 | 1986 | for_each_mem_cgroup_tree(iter, memcg) |
79dfdacc MH |
1987 | atomic_inc(&iter->under_oom); |
1988 | } | |
1989 | ||
c0ff4b85 | 1990 | static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg) |
79dfdacc MH |
1991 | { |
1992 | struct mem_cgroup *iter; | |
1993 | ||
867578cb KH |
1994 | /* |
1995 | * When a new child is created while the hierarchy is under oom, | |
1996 | * mem_cgroup_oom_lock() may not be called. We have to use | |
1997 | * atomic_add_unless() here. | |
1998 | */ | |
c0ff4b85 | 1999 | for_each_mem_cgroup_tree(iter, memcg) |
79dfdacc | 2000 | atomic_add_unless(&iter->under_oom, -1, 0); |
0b7f569e KH |
2001 | } |
2002 | ||
1af8efe9 | 2003 | static DEFINE_SPINLOCK(memcg_oom_lock); |
867578cb KH |
2004 | static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq); |
2005 | ||
dc98df5a | 2006 | struct oom_wait_info { |
d79154bb | 2007 | struct mem_cgroup *memcg; |
dc98df5a KH |
2008 | wait_queue_t wait; |
2009 | }; | |
2010 | ||
2011 | static int memcg_oom_wake_function(wait_queue_t *wait, | |
2012 | unsigned mode, int sync, void *arg) | |
2013 | { | |
d79154bb HD |
2014 | struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg; |
2015 | struct mem_cgroup *oom_wait_memcg; | |
dc98df5a KH |
2016 | struct oom_wait_info *oom_wait_info; |
2017 | ||
2018 | oom_wait_info = container_of(wait, struct oom_wait_info, wait); | |
d79154bb | 2019 | oom_wait_memcg = oom_wait_info->memcg; |
dc98df5a | 2020 | |
dc98df5a | 2021 | /* |
d79154bb | 2022 | * Both of oom_wait_info->memcg and wake_memcg are stable under us. |
dc98df5a KH |
2023 | * Then we can use css_is_ancestor without taking care of RCU. |
2024 | */ | |
c0ff4b85 R |
2025 | if (!mem_cgroup_same_or_subtree(oom_wait_memcg, wake_memcg) |
2026 | && !mem_cgroup_same_or_subtree(wake_memcg, oom_wait_memcg)) | |
dc98df5a | 2027 | return 0; |
dc98df5a KH |
2028 | return autoremove_wake_function(wait, mode, sync, arg); |
2029 | } | |
2030 | ||
c0ff4b85 | 2031 | static void memcg_wakeup_oom(struct mem_cgroup *memcg) |
dc98df5a | 2032 | { |
c0ff4b85 R |
2033 | /* for filtering, pass "memcg" as argument. */ |
2034 | __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg); | |
dc98df5a KH |
2035 | } |
2036 | ||
c0ff4b85 | 2037 | static void memcg_oom_recover(struct mem_cgroup *memcg) |
3c11ecf4 | 2038 | { |
c0ff4b85 R |
2039 | if (memcg && atomic_read(&memcg->under_oom)) |
2040 | memcg_wakeup_oom(memcg); | |
3c11ecf4 KH |
2041 | } |
2042 | ||
867578cb KH |
2043 | /* |
2044 | * try to call OOM killer. returns false if we should exit memory-reclaim loop. | |
2045 | */ | |
6bbda35c KS |
2046 | static bool mem_cgroup_handle_oom(struct mem_cgroup *memcg, gfp_t mask, |
2047 | int order) | |
0b7f569e | 2048 | { |
dc98df5a | 2049 | struct oom_wait_info owait; |
3c11ecf4 | 2050 | bool locked, need_to_kill; |
867578cb | 2051 | |
d79154bb | 2052 | owait.memcg = memcg; |
dc98df5a KH |
2053 | owait.wait.flags = 0; |
2054 | owait.wait.func = memcg_oom_wake_function; | |
2055 | owait.wait.private = current; | |
2056 | INIT_LIST_HEAD(&owait.wait.task_list); | |
3c11ecf4 | 2057 | need_to_kill = true; |
c0ff4b85 | 2058 | mem_cgroup_mark_under_oom(memcg); |
79dfdacc | 2059 | |
c0ff4b85 | 2060 | /* At first, try to OOM lock hierarchy under memcg.*/ |
1af8efe9 | 2061 | spin_lock(&memcg_oom_lock); |
c0ff4b85 | 2062 | locked = mem_cgroup_oom_lock(memcg); |
867578cb KH |
2063 | /* |
2064 | * Even if signal_pending(), we can't quit charge() loop without | |
2065 | * accounting. So, UNINTERRUPTIBLE is appropriate. But SIGKILL | |
2066 | * under OOM is always welcomed, use TASK_KILLABLE here. | |
2067 | */ | |
3c11ecf4 | 2068 | prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE); |
c0ff4b85 | 2069 | if (!locked || memcg->oom_kill_disable) |
3c11ecf4 KH |
2070 | need_to_kill = false; |
2071 | if (locked) | |
c0ff4b85 | 2072 | mem_cgroup_oom_notify(memcg); |
1af8efe9 | 2073 | spin_unlock(&memcg_oom_lock); |
867578cb | 2074 | |
3c11ecf4 KH |
2075 | if (need_to_kill) { |
2076 | finish_wait(&memcg_oom_waitq, &owait.wait); | |
e845e199 | 2077 | mem_cgroup_out_of_memory(memcg, mask, order); |
3c11ecf4 | 2078 | } else { |
867578cb | 2079 | schedule(); |
dc98df5a | 2080 | finish_wait(&memcg_oom_waitq, &owait.wait); |
867578cb | 2081 | } |
1af8efe9 | 2082 | spin_lock(&memcg_oom_lock); |
79dfdacc | 2083 | if (locked) |
c0ff4b85 R |
2084 | mem_cgroup_oom_unlock(memcg); |
2085 | memcg_wakeup_oom(memcg); | |
1af8efe9 | 2086 | spin_unlock(&memcg_oom_lock); |
867578cb | 2087 | |
c0ff4b85 | 2088 | mem_cgroup_unmark_under_oom(memcg); |
79dfdacc | 2089 | |
867578cb KH |
2090 | if (test_thread_flag(TIF_MEMDIE) || fatal_signal_pending(current)) |
2091 | return false; | |
2092 | /* Give chance to dying process */ | |
715a5ee8 | 2093 | schedule_timeout_uninterruptible(1); |
867578cb | 2094 | return true; |
0b7f569e KH |
2095 | } |
2096 | ||
d69b042f BS |
2097 | /* |
2098 | * Currently used to update mapped file statistics, but the routine can be | |
2099 | * generalized to update other statistics as well. | |
32047e2a KH |
2100 | * |
2101 | * Notes: Race condition | |
2102 | * | |
2103 | * We usually use page_cgroup_lock() for accessing page_cgroup member but | |
2104 | * it tends to be costly. But considering some conditions, we doesn't need | |
2105 | * to do so _always_. | |
2106 | * | |
2107 | * Considering "charge", lock_page_cgroup() is not required because all | |
2108 | * file-stat operations happen after a page is attached to radix-tree. There | |
2109 | * are no race with "charge". | |
2110 | * | |
2111 | * Considering "uncharge", we know that memcg doesn't clear pc->mem_cgroup | |
2112 | * at "uncharge" intentionally. So, we always see valid pc->mem_cgroup even | |
2113 | * if there are race with "uncharge". Statistics itself is properly handled | |
2114 | * by flags. | |
2115 | * | |
2116 | * Considering "move", this is an only case we see a race. To make the race | |
619d094b KH |
2117 | * small, we check mm->moving_account and detect there are possibility of race |
2118 | * If there is, we take a lock. | |
d69b042f | 2119 | */ |
26174efd | 2120 | |
89c06bd5 KH |
2121 | void __mem_cgroup_begin_update_page_stat(struct page *page, |
2122 | bool *locked, unsigned long *flags) | |
2123 | { | |
2124 | struct mem_cgroup *memcg; | |
2125 | struct page_cgroup *pc; | |
2126 | ||
2127 | pc = lookup_page_cgroup(page); | |
2128 | again: | |
2129 | memcg = pc->mem_cgroup; | |
2130 | if (unlikely(!memcg || !PageCgroupUsed(pc))) | |
2131 | return; | |
2132 | /* | |
2133 | * If this memory cgroup is not under account moving, we don't | |
da92c47d | 2134 | * need to take move_lock_mem_cgroup(). Because we already hold |
89c06bd5 | 2135 | * rcu_read_lock(), any calls to move_account will be delayed until |
13fd1dd9 | 2136 | * rcu_read_unlock() if mem_cgroup_stolen() == true. |
89c06bd5 | 2137 | */ |
13fd1dd9 | 2138 | if (!mem_cgroup_stolen(memcg)) |
89c06bd5 KH |
2139 | return; |
2140 | ||
2141 | move_lock_mem_cgroup(memcg, flags); | |
2142 | if (memcg != pc->mem_cgroup || !PageCgroupUsed(pc)) { | |
2143 | move_unlock_mem_cgroup(memcg, flags); | |
2144 | goto again; | |
2145 | } | |
2146 | *locked = true; | |
2147 | } | |
2148 | ||
2149 | void __mem_cgroup_end_update_page_stat(struct page *page, unsigned long *flags) | |
2150 | { | |
2151 | struct page_cgroup *pc = lookup_page_cgroup(page); | |
2152 | ||
2153 | /* | |
2154 | * It's guaranteed that pc->mem_cgroup never changes while | |
2155 | * lock is held because a routine modifies pc->mem_cgroup | |
da92c47d | 2156 | * should take move_lock_mem_cgroup(). |
89c06bd5 KH |
2157 | */ |
2158 | move_unlock_mem_cgroup(pc->mem_cgroup, flags); | |
2159 | } | |
2160 | ||
2a7106f2 GT |
2161 | void mem_cgroup_update_page_stat(struct page *page, |
2162 | enum mem_cgroup_page_stat_item idx, int val) | |
d69b042f | 2163 | { |
c0ff4b85 | 2164 | struct mem_cgroup *memcg; |
32047e2a | 2165 | struct page_cgroup *pc = lookup_page_cgroup(page); |
dbd4ea78 | 2166 | unsigned long uninitialized_var(flags); |
d69b042f | 2167 | |
cfa44946 | 2168 | if (mem_cgroup_disabled()) |
d69b042f | 2169 | return; |
89c06bd5 | 2170 | |
c0ff4b85 R |
2171 | memcg = pc->mem_cgroup; |
2172 | if (unlikely(!memcg || !PageCgroupUsed(pc))) | |
89c06bd5 | 2173 | return; |
26174efd | 2174 | |
26174efd | 2175 | switch (idx) { |
2a7106f2 | 2176 | case MEMCG_NR_FILE_MAPPED: |
2a7106f2 | 2177 | idx = MEM_CGROUP_STAT_FILE_MAPPED; |
26174efd KH |
2178 | break; |
2179 | default: | |
2180 | BUG(); | |
8725d541 | 2181 | } |
d69b042f | 2182 | |
c0ff4b85 | 2183 | this_cpu_add(memcg->stat->count[idx], val); |
d69b042f | 2184 | } |
26174efd | 2185 | |
cdec2e42 KH |
2186 | /* |
2187 | * size of first charge trial. "32" comes from vmscan.c's magic value. | |
2188 | * TODO: maybe necessary to use big numbers in big irons. | |
2189 | */ | |
7ec99d62 | 2190 | #define CHARGE_BATCH 32U |
cdec2e42 KH |
2191 | struct memcg_stock_pcp { |
2192 | struct mem_cgroup *cached; /* this never be root cgroup */ | |
11c9ea4e | 2193 | unsigned int nr_pages; |
cdec2e42 | 2194 | struct work_struct work; |
26fe6168 | 2195 | unsigned long flags; |
a0db00fc | 2196 | #define FLUSHING_CACHED_CHARGE 0 |
cdec2e42 KH |
2197 | }; |
2198 | static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock); | |
9f50fad6 | 2199 | static DEFINE_MUTEX(percpu_charge_mutex); |
cdec2e42 | 2200 | |
a0956d54 SS |
2201 | /** |
2202 | * consume_stock: Try to consume stocked charge on this cpu. | |
2203 | * @memcg: memcg to consume from. | |
2204 | * @nr_pages: how many pages to charge. | |
2205 | * | |
2206 | * The charges will only happen if @memcg matches the current cpu's memcg | |
2207 | * stock, and at least @nr_pages are available in that stock. Failure to | |
2208 | * service an allocation will refill the stock. | |
2209 | * | |
2210 | * returns true if successful, false otherwise. | |
cdec2e42 | 2211 | */ |
a0956d54 | 2212 | static bool consume_stock(struct mem_cgroup *memcg, unsigned int nr_pages) |
cdec2e42 KH |
2213 | { |
2214 | struct memcg_stock_pcp *stock; | |
2215 | bool ret = true; | |
2216 | ||
a0956d54 SS |
2217 | if (nr_pages > CHARGE_BATCH) |
2218 | return false; | |
2219 | ||
cdec2e42 | 2220 | stock = &get_cpu_var(memcg_stock); |
a0956d54 SS |
2221 | if (memcg == stock->cached && stock->nr_pages >= nr_pages) |
2222 | stock->nr_pages -= nr_pages; | |
cdec2e42 KH |
2223 | else /* need to call res_counter_charge */ |
2224 | ret = false; | |
2225 | put_cpu_var(memcg_stock); | |
2226 | return ret; | |
2227 | } | |
2228 | ||
2229 | /* | |
2230 | * Returns stocks cached in percpu to res_counter and reset cached information. | |
2231 | */ | |
2232 | static void drain_stock(struct memcg_stock_pcp *stock) | |
2233 | { | |
2234 | struct mem_cgroup *old = stock->cached; | |
2235 | ||
11c9ea4e JW |
2236 | if (stock->nr_pages) { |
2237 | unsigned long bytes = stock->nr_pages * PAGE_SIZE; | |
2238 | ||
2239 | res_counter_uncharge(&old->res, bytes); | |
cdec2e42 | 2240 | if (do_swap_account) |
11c9ea4e JW |
2241 | res_counter_uncharge(&old->memsw, bytes); |
2242 | stock->nr_pages = 0; | |
cdec2e42 KH |
2243 | } |
2244 | stock->cached = NULL; | |
cdec2e42 KH |
2245 | } |
2246 | ||
2247 | /* | |
2248 | * This must be called under preempt disabled or must be called by | |
2249 | * a thread which is pinned to local cpu. | |
2250 | */ | |
2251 | static void drain_local_stock(struct work_struct *dummy) | |
2252 | { | |
2253 | struct memcg_stock_pcp *stock = &__get_cpu_var(memcg_stock); | |
2254 | drain_stock(stock); | |
26fe6168 | 2255 | clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags); |
cdec2e42 KH |
2256 | } |
2257 | ||
2258 | /* | |
2259 | * Cache charges(val) which is from res_counter, to local per_cpu area. | |
320cc51d | 2260 | * This will be consumed by consume_stock() function, later. |
cdec2e42 | 2261 | */ |
c0ff4b85 | 2262 | static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages) |
cdec2e42 KH |
2263 | { |
2264 | struct memcg_stock_pcp *stock = &get_cpu_var(memcg_stock); | |
2265 | ||
c0ff4b85 | 2266 | if (stock->cached != memcg) { /* reset if necessary */ |
cdec2e42 | 2267 | drain_stock(stock); |
c0ff4b85 | 2268 | stock->cached = memcg; |
cdec2e42 | 2269 | } |
11c9ea4e | 2270 | stock->nr_pages += nr_pages; |
cdec2e42 KH |
2271 | put_cpu_var(memcg_stock); |
2272 | } | |
2273 | ||
2274 | /* | |
c0ff4b85 | 2275 | * Drains all per-CPU charge caches for given root_memcg resp. subtree |
d38144b7 MH |
2276 | * of the hierarchy under it. sync flag says whether we should block |
2277 | * until the work is done. | |
cdec2e42 | 2278 | */ |
c0ff4b85 | 2279 | static void drain_all_stock(struct mem_cgroup *root_memcg, bool sync) |
cdec2e42 | 2280 | { |
26fe6168 | 2281 | int cpu, curcpu; |
d38144b7 | 2282 | |
cdec2e42 | 2283 | /* Notify other cpus that system-wide "drain" is running */ |
cdec2e42 | 2284 | get_online_cpus(); |
5af12d0e | 2285 | curcpu = get_cpu(); |
cdec2e42 KH |
2286 | for_each_online_cpu(cpu) { |
2287 | struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu); | |
c0ff4b85 | 2288 | struct mem_cgroup *memcg; |
26fe6168 | 2289 | |
c0ff4b85 R |
2290 | memcg = stock->cached; |
2291 | if (!memcg || !stock->nr_pages) | |
26fe6168 | 2292 | continue; |
c0ff4b85 | 2293 | if (!mem_cgroup_same_or_subtree(root_memcg, memcg)) |
3e92041d | 2294 | continue; |
d1a05b69 MH |
2295 | if (!test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) { |
2296 | if (cpu == curcpu) | |
2297 | drain_local_stock(&stock->work); | |
2298 | else | |
2299 | schedule_work_on(cpu, &stock->work); | |
2300 | } | |
cdec2e42 | 2301 | } |
5af12d0e | 2302 | put_cpu(); |
d38144b7 MH |
2303 | |
2304 | if (!sync) | |
2305 | goto out; | |
2306 | ||
2307 | for_each_online_cpu(cpu) { | |
2308 | struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu); | |
9f50fad6 | 2309 | if (test_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) |
d38144b7 MH |
2310 | flush_work(&stock->work); |
2311 | } | |
2312 | out: | |
cdec2e42 | 2313 | put_online_cpus(); |
d38144b7 MH |
2314 | } |
2315 | ||
2316 | /* | |
2317 | * Tries to drain stocked charges in other cpus. This function is asynchronous | |
2318 | * and just put a work per cpu for draining localy on each cpu. Caller can | |
2319 | * expects some charges will be back to res_counter later but cannot wait for | |
2320 | * it. | |
2321 | */ | |
c0ff4b85 | 2322 | static void drain_all_stock_async(struct mem_cgroup *root_memcg) |
d38144b7 | 2323 | { |
9f50fad6 MH |
2324 | /* |
2325 | * If someone calls draining, avoid adding more kworker runs. | |
2326 | */ | |
2327 | if (!mutex_trylock(&percpu_charge_mutex)) | |
2328 | return; | |
c0ff4b85 | 2329 | drain_all_stock(root_memcg, false); |
9f50fad6 | 2330 | mutex_unlock(&percpu_charge_mutex); |
cdec2e42 KH |
2331 | } |
2332 | ||
2333 | /* This is a synchronous drain interface. */ | |
c0ff4b85 | 2334 | static void drain_all_stock_sync(struct mem_cgroup *root_memcg) |
cdec2e42 KH |
2335 | { |
2336 | /* called when force_empty is called */ | |
9f50fad6 | 2337 | mutex_lock(&percpu_charge_mutex); |
c0ff4b85 | 2338 | drain_all_stock(root_memcg, true); |
9f50fad6 | 2339 | mutex_unlock(&percpu_charge_mutex); |
cdec2e42 KH |
2340 | } |
2341 | ||
711d3d2c KH |
2342 | /* |
2343 | * This function drains percpu counter value from DEAD cpu and | |
2344 | * move it to local cpu. Note that this function can be preempted. | |
2345 | */ | |
c0ff4b85 | 2346 | static void mem_cgroup_drain_pcp_counter(struct mem_cgroup *memcg, int cpu) |
711d3d2c KH |
2347 | { |
2348 | int i; | |
2349 | ||
c0ff4b85 | 2350 | spin_lock(&memcg->pcp_counter_lock); |
6104621d | 2351 | for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) { |
c0ff4b85 | 2352 | long x = per_cpu(memcg->stat->count[i], cpu); |
711d3d2c | 2353 | |
c0ff4b85 R |
2354 | per_cpu(memcg->stat->count[i], cpu) = 0; |
2355 | memcg->nocpu_base.count[i] += x; | |
711d3d2c | 2356 | } |
e9f8974f | 2357 | for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) { |
c0ff4b85 | 2358 | unsigned long x = per_cpu(memcg->stat->events[i], cpu); |
e9f8974f | 2359 | |
c0ff4b85 R |
2360 | per_cpu(memcg->stat->events[i], cpu) = 0; |
2361 | memcg->nocpu_base.events[i] += x; | |
e9f8974f | 2362 | } |
c0ff4b85 | 2363 | spin_unlock(&memcg->pcp_counter_lock); |
711d3d2c KH |
2364 | } |
2365 | ||
2366 | static int __cpuinit memcg_cpu_hotplug_callback(struct notifier_block *nb, | |
cdec2e42 KH |
2367 | unsigned long action, |
2368 | void *hcpu) | |
2369 | { | |
2370 | int cpu = (unsigned long)hcpu; | |
2371 | struct memcg_stock_pcp *stock; | |
711d3d2c | 2372 | struct mem_cgroup *iter; |
cdec2e42 | 2373 | |
619d094b | 2374 | if (action == CPU_ONLINE) |
1489ebad | 2375 | return NOTIFY_OK; |
1489ebad | 2376 | |
d833049b | 2377 | if (action != CPU_DEAD && action != CPU_DEAD_FROZEN) |
cdec2e42 | 2378 | return NOTIFY_OK; |
711d3d2c | 2379 | |
9f3a0d09 | 2380 | for_each_mem_cgroup(iter) |
711d3d2c KH |
2381 | mem_cgroup_drain_pcp_counter(iter, cpu); |
2382 | ||
cdec2e42 KH |
2383 | stock = &per_cpu(memcg_stock, cpu); |
2384 | drain_stock(stock); | |
2385 | return NOTIFY_OK; | |
2386 | } | |
2387 | ||
4b534334 KH |
2388 | |
2389 | /* See __mem_cgroup_try_charge() for details */ | |
2390 | enum { | |
2391 | CHARGE_OK, /* success */ | |
2392 | CHARGE_RETRY, /* need to retry but retry is not bad */ | |
2393 | CHARGE_NOMEM, /* we can't do more. return -ENOMEM */ | |
2394 | CHARGE_WOULDBLOCK, /* GFP_WAIT wasn't set and no enough res. */ | |
2395 | CHARGE_OOM_DIE, /* the current is killed because of OOM */ | |
2396 | }; | |
2397 | ||
c0ff4b85 | 2398 | static int mem_cgroup_do_charge(struct mem_cgroup *memcg, gfp_t gfp_mask, |
4c9c5359 SS |
2399 | unsigned int nr_pages, unsigned int min_pages, |
2400 | bool oom_check) | |
4b534334 | 2401 | { |
7ec99d62 | 2402 | unsigned long csize = nr_pages * PAGE_SIZE; |
4b534334 KH |
2403 | struct mem_cgroup *mem_over_limit; |
2404 | struct res_counter *fail_res; | |
2405 | unsigned long flags = 0; | |
2406 | int ret; | |
2407 | ||
c0ff4b85 | 2408 | ret = res_counter_charge(&memcg->res, csize, &fail_res); |
4b534334 KH |
2409 | |
2410 | if (likely(!ret)) { | |
2411 | if (!do_swap_account) | |
2412 | return CHARGE_OK; | |
c0ff4b85 | 2413 | ret = res_counter_charge(&memcg->memsw, csize, &fail_res); |
4b534334 KH |
2414 | if (likely(!ret)) |
2415 | return CHARGE_OK; | |
2416 | ||
c0ff4b85 | 2417 | res_counter_uncharge(&memcg->res, csize); |
4b534334 KH |
2418 | mem_over_limit = mem_cgroup_from_res_counter(fail_res, memsw); |
2419 | flags |= MEM_CGROUP_RECLAIM_NOSWAP; | |
2420 | } else | |
2421 | mem_over_limit = mem_cgroup_from_res_counter(fail_res, res); | |
9221edb7 | 2422 | /* |
9221edb7 JW |
2423 | * Never reclaim on behalf of optional batching, retry with a |
2424 | * single page instead. | |
2425 | */ | |
4c9c5359 | 2426 | if (nr_pages > min_pages) |
4b534334 KH |
2427 | return CHARGE_RETRY; |
2428 | ||
2429 | if (!(gfp_mask & __GFP_WAIT)) | |
2430 | return CHARGE_WOULDBLOCK; | |
2431 | ||
4c9c5359 SS |
2432 | if (gfp_mask & __GFP_NORETRY) |
2433 | return CHARGE_NOMEM; | |
2434 | ||
5660048c | 2435 | ret = mem_cgroup_reclaim(mem_over_limit, gfp_mask, flags); |
7ec99d62 | 2436 | if (mem_cgroup_margin(mem_over_limit) >= nr_pages) |
19942822 | 2437 | return CHARGE_RETRY; |
4b534334 | 2438 | /* |
19942822 JW |
2439 | * Even though the limit is exceeded at this point, reclaim |
2440 | * may have been able to free some pages. Retry the charge | |
2441 | * before killing the task. | |
2442 | * | |
2443 | * Only for regular pages, though: huge pages are rather | |
2444 | * unlikely to succeed so close to the limit, and we fall back | |
2445 | * to regular pages anyway in case of failure. | |
4b534334 | 2446 | */ |
4c9c5359 | 2447 | if (nr_pages <= (1 << PAGE_ALLOC_COSTLY_ORDER) && ret) |
4b534334 KH |
2448 | return CHARGE_RETRY; |
2449 | ||
2450 | /* | |
2451 | * At task move, charge accounts can be doubly counted. So, it's | |
2452 | * better to wait until the end of task_move if something is going on. | |
2453 | */ | |
2454 | if (mem_cgroup_wait_acct_move(mem_over_limit)) | |
2455 | return CHARGE_RETRY; | |
2456 | ||
2457 | /* If we don't need to call oom-killer at el, return immediately */ | |
2458 | if (!oom_check) | |
2459 | return CHARGE_NOMEM; | |
2460 | /* check OOM */ | |
e845e199 | 2461 | if (!mem_cgroup_handle_oom(mem_over_limit, gfp_mask, get_order(csize))) |
4b534334 KH |
2462 | return CHARGE_OOM_DIE; |
2463 | ||
2464 | return CHARGE_RETRY; | |
2465 | } | |
2466 | ||
f817ed48 | 2467 | /* |
38c5d72f KH |
2468 | * __mem_cgroup_try_charge() does |
2469 | * 1. detect memcg to be charged against from passed *mm and *ptr, | |
2470 | * 2. update res_counter | |
2471 | * 3. call memory reclaim if necessary. | |
2472 | * | |
2473 | * In some special case, if the task is fatal, fatal_signal_pending() or | |
2474 | * has TIF_MEMDIE, this function returns -EINTR while writing root_mem_cgroup | |
2475 | * to *ptr. There are two reasons for this. 1: fatal threads should quit as soon | |
2476 | * as possible without any hazards. 2: all pages should have a valid | |
2477 | * pc->mem_cgroup. If mm is NULL and the caller doesn't pass a valid memcg | |
2478 | * pointer, that is treated as a charge to root_mem_cgroup. | |
2479 | * | |
2480 | * So __mem_cgroup_try_charge() will return | |
2481 | * 0 ... on success, filling *ptr with a valid memcg pointer. | |
2482 | * -ENOMEM ... charge failure because of resource limits. | |
2483 | * -EINTR ... if thread is fatal. *ptr is filled with root_mem_cgroup. | |
2484 | * | |
2485 | * Unlike the exported interface, an "oom" parameter is added. if oom==true, | |
2486 | * the oom-killer can be invoked. | |
8a9f3ccd | 2487 | */ |
f817ed48 | 2488 | static int __mem_cgroup_try_charge(struct mm_struct *mm, |
ec168510 | 2489 | gfp_t gfp_mask, |
7ec99d62 | 2490 | unsigned int nr_pages, |
c0ff4b85 | 2491 | struct mem_cgroup **ptr, |
7ec99d62 | 2492 | bool oom) |
8a9f3ccd | 2493 | { |
7ec99d62 | 2494 | unsigned int batch = max(CHARGE_BATCH, nr_pages); |
4b534334 | 2495 | int nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES; |
c0ff4b85 | 2496 | struct mem_cgroup *memcg = NULL; |
4b534334 | 2497 | int ret; |
a636b327 | 2498 | |
867578cb KH |
2499 | /* |
2500 | * Unlike gloval-vm's OOM-kill, we're not in memory shortage | |
2501 | * in system level. So, allow to go ahead dying process in addition to | |
2502 | * MEMDIE process. | |
2503 | */ | |
2504 | if (unlikely(test_thread_flag(TIF_MEMDIE) | |
2505 | || fatal_signal_pending(current))) | |
2506 | goto bypass; | |
a636b327 | 2507 | |
8a9f3ccd | 2508 | /* |
3be91277 HD |
2509 | * We always charge the cgroup the mm_struct belongs to. |
2510 | * The mm_struct's mem_cgroup changes on task migration if the | |
8a9f3ccd | 2511 | * thread group leader migrates. It's possible that mm is not |
24467cac | 2512 | * set, if so charge the root memcg (happens for pagecache usage). |
8a9f3ccd | 2513 | */ |
c0ff4b85 | 2514 | if (!*ptr && !mm) |
38c5d72f | 2515 | *ptr = root_mem_cgroup; |
f75ca962 | 2516 | again: |
c0ff4b85 R |
2517 | if (*ptr) { /* css should be a valid one */ |
2518 | memcg = *ptr; | |
c0ff4b85 | 2519 | if (mem_cgroup_is_root(memcg)) |
f75ca962 | 2520 | goto done; |
a0956d54 | 2521 | if (consume_stock(memcg, nr_pages)) |
f75ca962 | 2522 | goto done; |
c0ff4b85 | 2523 | css_get(&memcg->css); |
4b534334 | 2524 | } else { |
f75ca962 | 2525 | struct task_struct *p; |
54595fe2 | 2526 | |
f75ca962 KH |
2527 | rcu_read_lock(); |
2528 | p = rcu_dereference(mm->owner); | |
f75ca962 | 2529 | /* |
ebb76ce1 | 2530 | * Because we don't have task_lock(), "p" can exit. |
c0ff4b85 | 2531 | * In that case, "memcg" can point to root or p can be NULL with |
ebb76ce1 KH |
2532 | * race with swapoff. Then, we have small risk of mis-accouning. |
2533 | * But such kind of mis-account by race always happens because | |
2534 | * we don't have cgroup_mutex(). It's overkill and we allo that | |
2535 | * small race, here. | |
2536 | * (*) swapoff at el will charge against mm-struct not against | |
2537 | * task-struct. So, mm->owner can be NULL. | |
f75ca962 | 2538 | */ |
c0ff4b85 | 2539 | memcg = mem_cgroup_from_task(p); |
38c5d72f KH |
2540 | if (!memcg) |
2541 | memcg = root_mem_cgroup; | |
2542 | if (mem_cgroup_is_root(memcg)) { | |
f75ca962 KH |
2543 | rcu_read_unlock(); |
2544 | goto done; | |
2545 | } | |
a0956d54 | 2546 | if (consume_stock(memcg, nr_pages)) { |
f75ca962 KH |
2547 | /* |
2548 | * It seems dagerous to access memcg without css_get(). | |
2549 | * But considering how consume_stok works, it's not | |
2550 | * necessary. If consume_stock success, some charges | |
2551 | * from this memcg are cached on this cpu. So, we | |
2552 | * don't need to call css_get()/css_tryget() before | |
2553 | * calling consume_stock(). | |
2554 | */ | |
2555 | rcu_read_unlock(); | |
2556 | goto done; | |
2557 | } | |
2558 | /* after here, we may be blocked. we need to get refcnt */ | |
c0ff4b85 | 2559 | if (!css_tryget(&memcg->css)) { |
f75ca962 KH |
2560 | rcu_read_unlock(); |
2561 | goto again; | |
2562 | } | |
2563 | rcu_read_unlock(); | |
2564 | } | |
8a9f3ccd | 2565 | |
4b534334 KH |
2566 | do { |
2567 | bool oom_check; | |
7a81b88c | 2568 | |
4b534334 | 2569 | /* If killed, bypass charge */ |
f75ca962 | 2570 | if (fatal_signal_pending(current)) { |
c0ff4b85 | 2571 | css_put(&memcg->css); |
4b534334 | 2572 | goto bypass; |
f75ca962 | 2573 | } |
6d61ef40 | 2574 | |
4b534334 KH |
2575 | oom_check = false; |
2576 | if (oom && !nr_oom_retries) { | |
2577 | oom_check = true; | |
2578 | nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES; | |
cdec2e42 | 2579 | } |
66e1707b | 2580 | |
4c9c5359 SS |
2581 | ret = mem_cgroup_do_charge(memcg, gfp_mask, batch, nr_pages, |
2582 | oom_check); | |
4b534334 KH |
2583 | switch (ret) { |
2584 | case CHARGE_OK: | |
2585 | break; | |
2586 | case CHARGE_RETRY: /* not in OOM situation but retry */ | |
7ec99d62 | 2587 | batch = nr_pages; |
c0ff4b85 R |
2588 | css_put(&memcg->css); |
2589 | memcg = NULL; | |
f75ca962 | 2590 | goto again; |
4b534334 | 2591 | case CHARGE_WOULDBLOCK: /* !__GFP_WAIT */ |
c0ff4b85 | 2592 | css_put(&memcg->css); |
4b534334 KH |
2593 | goto nomem; |
2594 | case CHARGE_NOMEM: /* OOM routine works */ | |
f75ca962 | 2595 | if (!oom) { |
c0ff4b85 | 2596 | css_put(&memcg->css); |
867578cb | 2597 | goto nomem; |
f75ca962 | 2598 | } |
4b534334 KH |
2599 | /* If oom, we never return -ENOMEM */ |
2600 | nr_oom_retries--; | |
2601 | break; | |
2602 | case CHARGE_OOM_DIE: /* Killed by OOM Killer */ | |
c0ff4b85 | 2603 | css_put(&memcg->css); |
867578cb | 2604 | goto bypass; |
66e1707b | 2605 | } |
4b534334 KH |
2606 | } while (ret != CHARGE_OK); |
2607 | ||
7ec99d62 | 2608 | if (batch > nr_pages) |
c0ff4b85 R |
2609 | refill_stock(memcg, batch - nr_pages); |
2610 | css_put(&memcg->css); | |
0c3e73e8 | 2611 | done: |
c0ff4b85 | 2612 | *ptr = memcg; |
7a81b88c KH |
2613 | return 0; |
2614 | nomem: | |
c0ff4b85 | 2615 | *ptr = NULL; |
7a81b88c | 2616 | return -ENOMEM; |
867578cb | 2617 | bypass: |
38c5d72f KH |
2618 | *ptr = root_mem_cgroup; |
2619 | return -EINTR; | |
7a81b88c | 2620 | } |
8a9f3ccd | 2621 | |
a3032a2c DN |
2622 | /* |
2623 | * Somemtimes we have to undo a charge we got by try_charge(). | |
2624 | * This function is for that and do uncharge, put css's refcnt. | |
2625 | * gotten by try_charge(). | |
2626 | */ | |
c0ff4b85 | 2627 | static void __mem_cgroup_cancel_charge(struct mem_cgroup *memcg, |
e7018b8d | 2628 | unsigned int nr_pages) |
a3032a2c | 2629 | { |
c0ff4b85 | 2630 | if (!mem_cgroup_is_root(memcg)) { |
e7018b8d JW |
2631 | unsigned long bytes = nr_pages * PAGE_SIZE; |
2632 | ||
c0ff4b85 | 2633 | res_counter_uncharge(&memcg->res, bytes); |
a3032a2c | 2634 | if (do_swap_account) |
c0ff4b85 | 2635 | res_counter_uncharge(&memcg->memsw, bytes); |
a3032a2c | 2636 | } |
854ffa8d DN |
2637 | } |
2638 | ||
d01dd17f KH |
2639 | /* |
2640 | * Cancel chrages in this cgroup....doesn't propagate to parent cgroup. | |
2641 | * This is useful when moving usage to parent cgroup. | |
2642 | */ | |
2643 | static void __mem_cgroup_cancel_local_charge(struct mem_cgroup *memcg, | |
2644 | unsigned int nr_pages) | |
2645 | { | |
2646 | unsigned long bytes = nr_pages * PAGE_SIZE; | |
2647 | ||
2648 | if (mem_cgroup_is_root(memcg)) | |
2649 | return; | |
2650 | ||
2651 | res_counter_uncharge_until(&memcg->res, memcg->res.parent, bytes); | |
2652 | if (do_swap_account) | |
2653 | res_counter_uncharge_until(&memcg->memsw, | |
2654 | memcg->memsw.parent, bytes); | |
2655 | } | |
2656 | ||
a3b2d692 KH |
2657 | /* |
2658 | * A helper function to get mem_cgroup from ID. must be called under | |
e9316080 TH |
2659 | * rcu_read_lock(). The caller is responsible for calling css_tryget if |
2660 | * the mem_cgroup is used for charging. (dropping refcnt from swap can be | |
2661 | * called against removed memcg.) | |
a3b2d692 KH |
2662 | */ |
2663 | static struct mem_cgroup *mem_cgroup_lookup(unsigned short id) | |
2664 | { | |
2665 | struct cgroup_subsys_state *css; | |
2666 | ||
2667 | /* ID 0 is unused ID */ | |
2668 | if (!id) | |
2669 | return NULL; | |
2670 | css = css_lookup(&mem_cgroup_subsys, id); | |
2671 | if (!css) | |
2672 | return NULL; | |
b2145145 | 2673 | return mem_cgroup_from_css(css); |
a3b2d692 KH |
2674 | } |
2675 | ||
e42d9d5d | 2676 | struct mem_cgroup *try_get_mem_cgroup_from_page(struct page *page) |
b5a84319 | 2677 | { |
c0ff4b85 | 2678 | struct mem_cgroup *memcg = NULL; |
3c776e64 | 2679 | struct page_cgroup *pc; |
a3b2d692 | 2680 | unsigned short id; |
b5a84319 KH |
2681 | swp_entry_t ent; |
2682 | ||
3c776e64 DN |
2683 | VM_BUG_ON(!PageLocked(page)); |
2684 | ||
3c776e64 | 2685 | pc = lookup_page_cgroup(page); |
c0bd3f63 | 2686 | lock_page_cgroup(pc); |
a3b2d692 | 2687 | if (PageCgroupUsed(pc)) { |
c0ff4b85 R |
2688 | memcg = pc->mem_cgroup; |
2689 | if (memcg && !css_tryget(&memcg->css)) | |
2690 | memcg = NULL; | |
e42d9d5d | 2691 | } else if (PageSwapCache(page)) { |
3c776e64 | 2692 | ent.val = page_private(page); |
9fb4b7cc | 2693 | id = lookup_swap_cgroup_id(ent); |
a3b2d692 | 2694 | rcu_read_lock(); |
c0ff4b85 R |
2695 | memcg = mem_cgroup_lookup(id); |
2696 | if (memcg && !css_tryget(&memcg->css)) | |
2697 | memcg = NULL; | |
a3b2d692 | 2698 | rcu_read_unlock(); |
3c776e64 | 2699 | } |
c0bd3f63 | 2700 | unlock_page_cgroup(pc); |
c0ff4b85 | 2701 | return memcg; |
b5a84319 KH |
2702 | } |
2703 | ||
c0ff4b85 | 2704 | static void __mem_cgroup_commit_charge(struct mem_cgroup *memcg, |
5564e88b | 2705 | struct page *page, |
7ec99d62 | 2706 | unsigned int nr_pages, |
9ce70c02 HD |
2707 | enum charge_type ctype, |
2708 | bool lrucare) | |
7a81b88c | 2709 | { |
ce587e65 | 2710 | struct page_cgroup *pc = lookup_page_cgroup(page); |
9ce70c02 | 2711 | struct zone *uninitialized_var(zone); |
fa9add64 | 2712 | struct lruvec *lruvec; |
9ce70c02 | 2713 | bool was_on_lru = false; |
b2402857 | 2714 | bool anon; |
9ce70c02 | 2715 | |
ca3e0214 | 2716 | lock_page_cgroup(pc); |
90deb788 | 2717 | VM_BUG_ON(PageCgroupUsed(pc)); |
ca3e0214 KH |
2718 | /* |
2719 | * we don't need page_cgroup_lock about tail pages, becase they are not | |
2720 | * accessed by any other context at this point. | |
2721 | */ | |
9ce70c02 HD |
2722 | |
2723 | /* | |
2724 | * In some cases, SwapCache and FUSE(splice_buf->radixtree), the page | |
2725 | * may already be on some other mem_cgroup's LRU. Take care of it. | |
2726 | */ | |
2727 | if (lrucare) { | |
2728 | zone = page_zone(page); | |
2729 | spin_lock_irq(&zone->lru_lock); | |
2730 | if (PageLRU(page)) { | |
fa9add64 | 2731 | lruvec = mem_cgroup_zone_lruvec(zone, pc->mem_cgroup); |
9ce70c02 | 2732 | ClearPageLRU(page); |
fa9add64 | 2733 | del_page_from_lru_list(page, lruvec, page_lru(page)); |
9ce70c02 HD |
2734 | was_on_lru = true; |
2735 | } | |
2736 | } | |
2737 | ||
c0ff4b85 | 2738 | pc->mem_cgroup = memcg; |
261fb61a KH |
2739 | /* |
2740 | * We access a page_cgroup asynchronously without lock_page_cgroup(). | |
2741 | * Especially when a page_cgroup is taken from a page, pc->mem_cgroup | |
2742 | * is accessed after testing USED bit. To make pc->mem_cgroup visible | |
2743 | * before USED bit, we need memory barrier here. | |
2744 | * See mem_cgroup_add_lru_list(), etc. | |
2745 | */ | |
08e552c6 | 2746 | smp_wmb(); |
b2402857 | 2747 | SetPageCgroupUsed(pc); |
3be91277 | 2748 | |
9ce70c02 HD |
2749 | if (lrucare) { |
2750 | if (was_on_lru) { | |
fa9add64 | 2751 | lruvec = mem_cgroup_zone_lruvec(zone, pc->mem_cgroup); |
9ce70c02 HD |
2752 | VM_BUG_ON(PageLRU(page)); |
2753 | SetPageLRU(page); | |
fa9add64 | 2754 | add_page_to_lru_list(page, lruvec, page_lru(page)); |
9ce70c02 HD |
2755 | } |
2756 | spin_unlock_irq(&zone->lru_lock); | |
2757 | } | |
2758 | ||
41326c17 | 2759 | if (ctype == MEM_CGROUP_CHARGE_TYPE_ANON) |
b2402857 KH |
2760 | anon = true; |
2761 | else | |
2762 | anon = false; | |
2763 | ||
2764 | mem_cgroup_charge_statistics(memcg, anon, nr_pages); | |
52d4b9ac | 2765 | unlock_page_cgroup(pc); |
9ce70c02 | 2766 | |
430e4863 KH |
2767 | /* |
2768 | * "charge_statistics" updated event counter. Then, check it. | |
2769 | * Insert ancestor (and ancestor's ancestors), to softlimit RB-tree. | |
2770 | * if they exceeds softlimit. | |
2771 | */ | |
c0ff4b85 | 2772 | memcg_check_events(memcg, page); |
7a81b88c | 2773 | } |
66e1707b | 2774 | |
7ae1e1d0 GC |
2775 | #ifdef CONFIG_MEMCG_KMEM |
2776 | static inline bool memcg_can_account_kmem(struct mem_cgroup *memcg) | |
2777 | { | |
2778 | return !mem_cgroup_disabled() && !mem_cgroup_is_root(memcg) && | |
2779 | (memcg->kmem_account_flags & KMEM_ACCOUNTED_MASK); | |
2780 | } | |
2781 | ||
2782 | static int memcg_charge_kmem(struct mem_cgroup *memcg, gfp_t gfp, u64 size) | |
2783 | { | |
2784 | struct res_counter *fail_res; | |
2785 | struct mem_cgroup *_memcg; | |
2786 | int ret = 0; | |
2787 | bool may_oom; | |
2788 | ||
2789 | ret = res_counter_charge(&memcg->kmem, size, &fail_res); | |
2790 | if (ret) | |
2791 | return ret; | |
2792 | ||
2793 | /* | |
2794 | * Conditions under which we can wait for the oom_killer. Those are | |
2795 | * the same conditions tested by the core page allocator | |
2796 | */ | |
2797 | may_oom = (gfp & __GFP_FS) && !(gfp & __GFP_NORETRY); | |
2798 | ||
2799 | _memcg = memcg; | |
2800 | ret = __mem_cgroup_try_charge(NULL, gfp, size >> PAGE_SHIFT, | |
2801 | &_memcg, may_oom); | |
2802 | ||
2803 | if (ret == -EINTR) { | |
2804 | /* | |
2805 | * __mem_cgroup_try_charge() chosed to bypass to root due to | |
2806 | * OOM kill or fatal signal. Since our only options are to | |
2807 | * either fail the allocation or charge it to this cgroup, do | |
2808 | * it as a temporary condition. But we can't fail. From a | |
2809 | * kmem/slab perspective, the cache has already been selected, | |
2810 | * by mem_cgroup_kmem_get_cache(), so it is too late to change | |
2811 | * our minds. | |
2812 | * | |
2813 | * This condition will only trigger if the task entered | |
2814 | * memcg_charge_kmem in a sane state, but was OOM-killed during | |
2815 | * __mem_cgroup_try_charge() above. Tasks that were already | |
2816 | * dying when the allocation triggers should have been already | |
2817 | * directed to the root cgroup in memcontrol.h | |
2818 | */ | |
2819 | res_counter_charge_nofail(&memcg->res, size, &fail_res); | |
2820 | if (do_swap_account) | |
2821 | res_counter_charge_nofail(&memcg->memsw, size, | |
2822 | &fail_res); | |
2823 | ret = 0; | |
2824 | } else if (ret) | |
2825 | res_counter_uncharge(&memcg->kmem, size); | |
2826 | ||
2827 | return ret; | |
2828 | } | |
2829 | ||
2830 | static void memcg_uncharge_kmem(struct mem_cgroup *memcg, u64 size) | |
2831 | { | |
7ae1e1d0 GC |
2832 | res_counter_uncharge(&memcg->res, size); |
2833 | if (do_swap_account) | |
2834 | res_counter_uncharge(&memcg->memsw, size); | |
7de37682 GC |
2835 | |
2836 | /* Not down to 0 */ | |
2837 | if (res_counter_uncharge(&memcg->kmem, size)) | |
2838 | return; | |
2839 | ||
2840 | if (memcg_kmem_test_and_clear_dead(memcg)) | |
2841 | mem_cgroup_put(memcg); | |
7ae1e1d0 GC |
2842 | } |
2843 | ||
2633d7a0 GC |
2844 | void memcg_cache_list_add(struct mem_cgroup *memcg, struct kmem_cache *cachep) |
2845 | { | |
2846 | if (!memcg) | |
2847 | return; | |
2848 | ||
2849 | mutex_lock(&memcg->slab_caches_mutex); | |
2850 | list_add(&cachep->memcg_params->list, &memcg->memcg_slab_caches); | |
2851 | mutex_unlock(&memcg->slab_caches_mutex); | |
2852 | } | |
2853 | ||
2854 | /* | |
2855 | * helper for acessing a memcg's index. It will be used as an index in the | |
2856 | * child cache array in kmem_cache, and also to derive its name. This function | |
2857 | * will return -1 when this is not a kmem-limited memcg. | |
2858 | */ | |
2859 | int memcg_cache_id(struct mem_cgroup *memcg) | |
2860 | { | |
2861 | return memcg ? memcg->kmemcg_id : -1; | |
2862 | } | |
2863 | ||
55007d84 GC |
2864 | /* |
2865 | * This ends up being protected by the set_limit mutex, during normal | |
2866 | * operation, because that is its main call site. | |
2867 | * | |
2868 | * But when we create a new cache, we can call this as well if its parent | |
2869 | * is kmem-limited. That will have to hold set_limit_mutex as well. | |
2870 | */ | |
2871 | int memcg_update_cache_sizes(struct mem_cgroup *memcg) | |
2872 | { | |
2873 | int num, ret; | |
2874 | ||
2875 | num = ida_simple_get(&kmem_limited_groups, | |
2876 | 0, MEMCG_CACHES_MAX_SIZE, GFP_KERNEL); | |
2877 | if (num < 0) | |
2878 | return num; | |
2879 | /* | |
2880 | * After this point, kmem_accounted (that we test atomically in | |
2881 | * the beginning of this conditional), is no longer 0. This | |
2882 | * guarantees only one process will set the following boolean | |
2883 | * to true. We don't need test_and_set because we're protected | |
2884 | * by the set_limit_mutex anyway. | |
2885 | */ | |
2886 | memcg_kmem_set_activated(memcg); | |
2887 | ||
2888 | ret = memcg_update_all_caches(num+1); | |
2889 | if (ret) { | |
2890 | ida_simple_remove(&kmem_limited_groups, num); | |
2891 | memcg_kmem_clear_activated(memcg); | |
2892 | return ret; | |
2893 | } | |
2894 | ||
2895 | memcg->kmemcg_id = num; | |
2896 | INIT_LIST_HEAD(&memcg->memcg_slab_caches); | |
2897 | mutex_init(&memcg->slab_caches_mutex); | |
2898 | return 0; | |
2899 | } | |
2900 | ||
2901 | static size_t memcg_caches_array_size(int num_groups) | |
2902 | { | |
2903 | ssize_t size; | |
2904 | if (num_groups <= 0) | |
2905 | return 0; | |
2906 | ||
2907 | size = 2 * num_groups; | |
2908 | if (size < MEMCG_CACHES_MIN_SIZE) | |
2909 | size = MEMCG_CACHES_MIN_SIZE; | |
2910 | else if (size > MEMCG_CACHES_MAX_SIZE) | |
2911 | size = MEMCG_CACHES_MAX_SIZE; | |
2912 | ||
2913 | return size; | |
2914 | } | |
2915 | ||
2916 | /* | |
2917 | * We should update the current array size iff all caches updates succeed. This | |
2918 | * can only be done from the slab side. The slab mutex needs to be held when | |
2919 | * calling this. | |
2920 | */ | |
2921 | void memcg_update_array_size(int num) | |
2922 | { | |
2923 | if (num > memcg_limited_groups_array_size) | |
2924 | memcg_limited_groups_array_size = memcg_caches_array_size(num); | |
2925 | } | |
2926 | ||
2927 | int memcg_update_cache_size(struct kmem_cache *s, int num_groups) | |
2928 | { | |
2929 | struct memcg_cache_params *cur_params = s->memcg_params; | |
2930 | ||
2931 | VM_BUG_ON(s->memcg_params && !s->memcg_params->is_root_cache); | |
2932 | ||
2933 | if (num_groups > memcg_limited_groups_array_size) { | |
2934 | int i; | |
2935 | ssize_t size = memcg_caches_array_size(num_groups); | |
2936 | ||
2937 | size *= sizeof(void *); | |
2938 | size += sizeof(struct memcg_cache_params); | |
2939 | ||
2940 | s->memcg_params = kzalloc(size, GFP_KERNEL); | |
2941 | if (!s->memcg_params) { | |
2942 | s->memcg_params = cur_params; | |
2943 | return -ENOMEM; | |
2944 | } | |
2945 | ||
2946 | s->memcg_params->is_root_cache = true; | |
2947 | ||
2948 | /* | |
2949 | * There is the chance it will be bigger than | |
2950 | * memcg_limited_groups_array_size, if we failed an allocation | |
2951 | * in a cache, in which case all caches updated before it, will | |
2952 | * have a bigger array. | |
2953 | * | |
2954 | * But if that is the case, the data after | |
2955 | * memcg_limited_groups_array_size is certainly unused | |
2956 | */ | |
2957 | for (i = 0; i < memcg_limited_groups_array_size; i++) { | |
2958 | if (!cur_params->memcg_caches[i]) | |
2959 | continue; | |
2960 | s->memcg_params->memcg_caches[i] = | |
2961 | cur_params->memcg_caches[i]; | |
2962 | } | |
2963 | ||
2964 | /* | |
2965 | * Ideally, we would wait until all caches succeed, and only | |
2966 | * then free the old one. But this is not worth the extra | |
2967 | * pointer per-cache we'd have to have for this. | |
2968 | * | |
2969 | * It is not a big deal if some caches are left with a size | |
2970 | * bigger than the others. And all updates will reset this | |
2971 | * anyway. | |
2972 | */ | |
2973 | kfree(cur_params); | |
2974 | } | |
2975 | return 0; | |
2976 | } | |
2977 | ||
2633d7a0 GC |
2978 | int memcg_register_cache(struct mem_cgroup *memcg, struct kmem_cache *s) |
2979 | { | |
2980 | size_t size = sizeof(struct memcg_cache_params); | |
2981 | ||
2982 | if (!memcg_kmem_enabled()) | |
2983 | return 0; | |
2984 | ||
55007d84 GC |
2985 | if (!memcg) |
2986 | size += memcg_limited_groups_array_size * sizeof(void *); | |
2987 | ||
2633d7a0 GC |
2988 | s->memcg_params = kzalloc(size, GFP_KERNEL); |
2989 | if (!s->memcg_params) | |
2990 | return -ENOMEM; | |
2991 | ||
2992 | if (memcg) | |
2993 | s->memcg_params->memcg = memcg; | |
2994 | return 0; | |
2995 | } | |
2996 | ||
2997 | void memcg_release_cache(struct kmem_cache *s) | |
2998 | { | |
d7f25f8a GC |
2999 | struct kmem_cache *root; |
3000 | struct mem_cgroup *memcg; | |
3001 | int id; | |
3002 | ||
3003 | /* | |
3004 | * This happens, for instance, when a root cache goes away before we | |
3005 | * add any memcg. | |
3006 | */ | |
3007 | if (!s->memcg_params) | |
3008 | return; | |
3009 | ||
3010 | if (s->memcg_params->is_root_cache) | |
3011 | goto out; | |
3012 | ||
3013 | memcg = s->memcg_params->memcg; | |
3014 | id = memcg_cache_id(memcg); | |
3015 | ||
3016 | root = s->memcg_params->root_cache; | |
3017 | root->memcg_params->memcg_caches[id] = NULL; | |
3018 | mem_cgroup_put(memcg); | |
3019 | ||
3020 | mutex_lock(&memcg->slab_caches_mutex); | |
3021 | list_del(&s->memcg_params->list); | |
3022 | mutex_unlock(&memcg->slab_caches_mutex); | |
3023 | ||
3024 | out: | |
2633d7a0 GC |
3025 | kfree(s->memcg_params); |
3026 | } | |
3027 | ||
0e9d92f2 GC |
3028 | /* |
3029 | * During the creation a new cache, we need to disable our accounting mechanism | |
3030 | * altogether. This is true even if we are not creating, but rather just | |
3031 | * enqueing new caches to be created. | |
3032 | * | |
3033 | * This is because that process will trigger allocations; some visible, like | |
3034 | * explicit kmallocs to auxiliary data structures, name strings and internal | |
3035 | * cache structures; some well concealed, like INIT_WORK() that can allocate | |
3036 | * objects during debug. | |
3037 | * | |
3038 | * If any allocation happens during memcg_kmem_get_cache, we will recurse back | |
3039 | * to it. This may not be a bounded recursion: since the first cache creation | |
3040 | * failed to complete (waiting on the allocation), we'll just try to create the | |
3041 | * cache again, failing at the same point. | |
3042 | * | |
3043 | * memcg_kmem_get_cache is prepared to abort after seeing a positive count of | |
3044 | * memcg_kmem_skip_account. So we enclose anything that might allocate memory | |
3045 | * inside the following two functions. | |
3046 | */ | |
3047 | static inline void memcg_stop_kmem_account(void) | |
3048 | { | |
3049 | VM_BUG_ON(!current->mm); | |
3050 | current->memcg_kmem_skip_account++; | |
3051 | } | |
3052 | ||
3053 | static inline void memcg_resume_kmem_account(void) | |
3054 | { | |
3055 | VM_BUG_ON(!current->mm); | |
3056 | current->memcg_kmem_skip_account--; | |
3057 | } | |
3058 | ||
d7f25f8a GC |
3059 | static char *memcg_cache_name(struct mem_cgroup *memcg, struct kmem_cache *s) |
3060 | { | |
3061 | char *name; | |
3062 | struct dentry *dentry; | |
3063 | ||
3064 | rcu_read_lock(); | |
3065 | dentry = rcu_dereference(memcg->css.cgroup->dentry); | |
3066 | rcu_read_unlock(); | |
3067 | ||
3068 | BUG_ON(dentry == NULL); | |
3069 | ||
3070 | name = kasprintf(GFP_KERNEL, "%s(%d:%s)", s->name, | |
3071 | memcg_cache_id(memcg), dentry->d_name.name); | |
3072 | ||
3073 | return name; | |
3074 | } | |
3075 | ||
3076 | static struct kmem_cache *kmem_cache_dup(struct mem_cgroup *memcg, | |
3077 | struct kmem_cache *s) | |
3078 | { | |
3079 | char *name; | |
3080 | struct kmem_cache *new; | |
3081 | ||
3082 | name = memcg_cache_name(memcg, s); | |
3083 | if (!name) | |
3084 | return NULL; | |
3085 | ||
3086 | new = kmem_cache_create_memcg(memcg, name, s->object_size, s->align, | |
3087 | (s->flags & ~SLAB_PANIC), s->ctor); | |
3088 | ||
d79923fa GC |
3089 | if (new) |
3090 | new->allocflags |= __GFP_KMEMCG; | |
3091 | ||
d7f25f8a GC |
3092 | kfree(name); |
3093 | return new; | |
3094 | } | |
3095 | ||
3096 | /* | |
3097 | * This lock protects updaters, not readers. We want readers to be as fast as | |
3098 | * they can, and they will either see NULL or a valid cache value. Our model | |
3099 | * allow them to see NULL, in which case the root memcg will be selected. | |
3100 | * | |
3101 | * We need this lock because multiple allocations to the same cache from a non | |
3102 | * will span more than one worker. Only one of them can create the cache. | |
3103 | */ | |
3104 | static DEFINE_MUTEX(memcg_cache_mutex); | |
3105 | static struct kmem_cache *memcg_create_kmem_cache(struct mem_cgroup *memcg, | |
3106 | struct kmem_cache *cachep) | |
3107 | { | |
3108 | struct kmem_cache *new_cachep; | |
3109 | int idx; | |
3110 | ||
3111 | BUG_ON(!memcg_can_account_kmem(memcg)); | |
3112 | ||
3113 | idx = memcg_cache_id(memcg); | |
3114 | ||
3115 | mutex_lock(&memcg_cache_mutex); | |
3116 | new_cachep = cachep->memcg_params->memcg_caches[idx]; | |
3117 | if (new_cachep) | |
3118 | goto out; | |
3119 | ||
3120 | new_cachep = kmem_cache_dup(memcg, cachep); | |
d7f25f8a GC |
3121 | if (new_cachep == NULL) { |
3122 | new_cachep = cachep; | |
3123 | goto out; | |
3124 | } | |
3125 | ||
3126 | mem_cgroup_get(memcg); | |
3127 | new_cachep->memcg_params->root_cache = cachep; | |
3128 | ||
3129 | cachep->memcg_params->memcg_caches[idx] = new_cachep; | |
3130 | /* | |
3131 | * the readers won't lock, make sure everybody sees the updated value, | |
3132 | * so they won't put stuff in the queue again for no reason | |
3133 | */ | |
3134 | wmb(); | |
3135 | out: | |
3136 | mutex_unlock(&memcg_cache_mutex); | |
3137 | return new_cachep; | |
3138 | } | |
3139 | ||
3140 | struct create_work { | |
3141 | struct mem_cgroup *memcg; | |
3142 | struct kmem_cache *cachep; | |
3143 | struct work_struct work; | |
3144 | }; | |
3145 | ||
3146 | static void memcg_create_cache_work_func(struct work_struct *w) | |
3147 | { | |
3148 | struct create_work *cw; | |
3149 | ||
3150 | cw = container_of(w, struct create_work, work); | |
3151 | memcg_create_kmem_cache(cw->memcg, cw->cachep); | |
3152 | /* Drop the reference gotten when we enqueued. */ | |
3153 | css_put(&cw->memcg->css); | |
3154 | kfree(cw); | |
3155 | } | |
3156 | ||
3157 | /* | |
3158 | * Enqueue the creation of a per-memcg kmem_cache. | |
3159 | * Called with rcu_read_lock. | |
3160 | */ | |
0e9d92f2 GC |
3161 | static void __memcg_create_cache_enqueue(struct mem_cgroup *memcg, |
3162 | struct kmem_cache *cachep) | |
d7f25f8a GC |
3163 | { |
3164 | struct create_work *cw; | |
3165 | ||
3166 | cw = kmalloc(sizeof(struct create_work), GFP_NOWAIT); | |
3167 | if (cw == NULL) | |
3168 | return; | |
3169 | ||
3170 | /* The corresponding put will be done in the workqueue. */ | |
3171 | if (!css_tryget(&memcg->css)) { | |
3172 | kfree(cw); | |
3173 | return; | |
3174 | } | |
3175 | ||
3176 | cw->memcg = memcg; | |
3177 | cw->cachep = cachep; | |
3178 | ||
3179 | INIT_WORK(&cw->work, memcg_create_cache_work_func); | |
3180 | schedule_work(&cw->work); | |
3181 | } | |
3182 | ||
0e9d92f2 GC |
3183 | static void memcg_create_cache_enqueue(struct mem_cgroup *memcg, |
3184 | struct kmem_cache *cachep) | |
3185 | { | |
3186 | /* | |
3187 | * We need to stop accounting when we kmalloc, because if the | |
3188 | * corresponding kmalloc cache is not yet created, the first allocation | |
3189 | * in __memcg_create_cache_enqueue will recurse. | |
3190 | * | |
3191 | * However, it is better to enclose the whole function. Depending on | |
3192 | * the debugging options enabled, INIT_WORK(), for instance, can | |
3193 | * trigger an allocation. This too, will make us recurse. Because at | |
3194 | * this point we can't allow ourselves back into memcg_kmem_get_cache, | |
3195 | * the safest choice is to do it like this, wrapping the whole function. | |
3196 | */ | |
3197 | memcg_stop_kmem_account(); | |
3198 | __memcg_create_cache_enqueue(memcg, cachep); | |
3199 | memcg_resume_kmem_account(); | |
3200 | } | |
d7f25f8a GC |
3201 | /* |
3202 | * Return the kmem_cache we're supposed to use for a slab allocation. | |
3203 | * We try to use the current memcg's version of the cache. | |
3204 | * | |
3205 | * If the cache does not exist yet, if we are the first user of it, | |
3206 | * we either create it immediately, if possible, or create it asynchronously | |
3207 | * in a workqueue. | |
3208 | * In the latter case, we will let the current allocation go through with | |
3209 | * the original cache. | |
3210 | * | |
3211 | * Can't be called in interrupt context or from kernel threads. | |
3212 | * This function needs to be called with rcu_read_lock() held. | |
3213 | */ | |
3214 | struct kmem_cache *__memcg_kmem_get_cache(struct kmem_cache *cachep, | |
3215 | gfp_t gfp) | |
3216 | { | |
3217 | struct mem_cgroup *memcg; | |
3218 | int idx; | |
3219 | ||
3220 | VM_BUG_ON(!cachep->memcg_params); | |
3221 | VM_BUG_ON(!cachep->memcg_params->is_root_cache); | |
3222 | ||
0e9d92f2 GC |
3223 | if (!current->mm || current->memcg_kmem_skip_account) |
3224 | return cachep; | |
3225 | ||
d7f25f8a GC |
3226 | rcu_read_lock(); |
3227 | memcg = mem_cgroup_from_task(rcu_dereference(current->mm->owner)); | |
3228 | rcu_read_unlock(); | |
3229 | ||
3230 | if (!memcg_can_account_kmem(memcg)) | |
3231 | return cachep; | |
3232 | ||
3233 | idx = memcg_cache_id(memcg); | |
3234 | ||
3235 | /* | |
3236 | * barrier to mare sure we're always seeing the up to date value. The | |
3237 | * code updating memcg_caches will issue a write barrier to match this. | |
3238 | */ | |
3239 | read_barrier_depends(); | |
3240 | if (unlikely(cachep->memcg_params->memcg_caches[idx] == NULL)) { | |
3241 | /* | |
3242 | * If we are in a safe context (can wait, and not in interrupt | |
3243 | * context), we could be be predictable and return right away. | |
3244 | * This would guarantee that the allocation being performed | |
3245 | * already belongs in the new cache. | |
3246 | * | |
3247 | * However, there are some clashes that can arrive from locking. | |
3248 | * For instance, because we acquire the slab_mutex while doing | |
3249 | * kmem_cache_dup, this means no further allocation could happen | |
3250 | * with the slab_mutex held. | |
3251 | * | |
3252 | * Also, because cache creation issue get_online_cpus(), this | |
3253 | * creates a lock chain: memcg_slab_mutex -> cpu_hotplug_mutex, | |
3254 | * that ends up reversed during cpu hotplug. (cpuset allocates | |
3255 | * a bunch of GFP_KERNEL memory during cpuup). Due to all that, | |
3256 | * better to defer everything. | |
3257 | */ | |
3258 | memcg_create_cache_enqueue(memcg, cachep); | |
3259 | return cachep; | |
3260 | } | |
3261 | ||
3262 | return cachep->memcg_params->memcg_caches[idx]; | |
3263 | } | |
3264 | EXPORT_SYMBOL(__memcg_kmem_get_cache); | |
3265 | ||
7ae1e1d0 GC |
3266 | /* |
3267 | * We need to verify if the allocation against current->mm->owner's memcg is | |
3268 | * possible for the given order. But the page is not allocated yet, so we'll | |
3269 | * need a further commit step to do the final arrangements. | |
3270 | * | |
3271 | * It is possible for the task to switch cgroups in this mean time, so at | |
3272 | * commit time, we can't rely on task conversion any longer. We'll then use | |
3273 | * the handle argument to return to the caller which cgroup we should commit | |
3274 | * against. We could also return the memcg directly and avoid the pointer | |
3275 | * passing, but a boolean return value gives better semantics considering | |
3276 | * the compiled-out case as well. | |
3277 | * | |
3278 | * Returning true means the allocation is possible. | |
3279 | */ | |
3280 | bool | |
3281 | __memcg_kmem_newpage_charge(gfp_t gfp, struct mem_cgroup **_memcg, int order) | |
3282 | { | |
3283 | struct mem_cgroup *memcg; | |
3284 | int ret; | |
3285 | ||
3286 | *_memcg = NULL; | |
3287 | memcg = try_get_mem_cgroup_from_mm(current->mm); | |
3288 | ||
3289 | /* | |
3290 | * very rare case described in mem_cgroup_from_task. Unfortunately there | |
3291 | * isn't much we can do without complicating this too much, and it would | |
3292 | * be gfp-dependent anyway. Just let it go | |
3293 | */ | |
3294 | if (unlikely(!memcg)) | |
3295 | return true; | |
3296 | ||
3297 | if (!memcg_can_account_kmem(memcg)) { | |
3298 | css_put(&memcg->css); | |
3299 | return true; | |
3300 | } | |
3301 | ||
7ae1e1d0 GC |
3302 | ret = memcg_charge_kmem(memcg, gfp, PAGE_SIZE << order); |
3303 | if (!ret) | |
3304 | *_memcg = memcg; | |
7ae1e1d0 GC |
3305 | |
3306 | css_put(&memcg->css); | |
3307 | return (ret == 0); | |
3308 | } | |
3309 | ||
3310 | void __memcg_kmem_commit_charge(struct page *page, struct mem_cgroup *memcg, | |
3311 | int order) | |
3312 | { | |
3313 | struct page_cgroup *pc; | |
3314 | ||
3315 | VM_BUG_ON(mem_cgroup_is_root(memcg)); | |
3316 | ||
3317 | /* The page allocation failed. Revert */ | |
3318 | if (!page) { | |
3319 | memcg_uncharge_kmem(memcg, PAGE_SIZE << order); | |
7ae1e1d0 GC |
3320 | return; |
3321 | } | |
3322 | ||
3323 | pc = lookup_page_cgroup(page); | |
3324 | lock_page_cgroup(pc); | |
3325 | pc->mem_cgroup = memcg; | |
3326 | SetPageCgroupUsed(pc); | |
3327 | unlock_page_cgroup(pc); | |
3328 | } | |
3329 | ||
3330 | void __memcg_kmem_uncharge_pages(struct page *page, int order) | |
3331 | { | |
3332 | struct mem_cgroup *memcg = NULL; | |
3333 | struct page_cgroup *pc; | |
3334 | ||
3335 | ||
3336 | pc = lookup_page_cgroup(page); | |
3337 | /* | |
3338 | * Fast unlocked return. Theoretically might have changed, have to | |
3339 | * check again after locking. | |
3340 | */ | |
3341 | if (!PageCgroupUsed(pc)) | |
3342 | return; | |
3343 | ||
3344 | lock_page_cgroup(pc); | |
3345 | if (PageCgroupUsed(pc)) { | |
3346 | memcg = pc->mem_cgroup; | |
3347 | ClearPageCgroupUsed(pc); | |
3348 | } | |
3349 | unlock_page_cgroup(pc); | |
3350 | ||
3351 | /* | |
3352 | * We trust that only if there is a memcg associated with the page, it | |
3353 | * is a valid allocation | |
3354 | */ | |
3355 | if (!memcg) | |
3356 | return; | |
3357 | ||
3358 | VM_BUG_ON(mem_cgroup_is_root(memcg)); | |
3359 | memcg_uncharge_kmem(memcg, PAGE_SIZE << order); | |
7ae1e1d0 GC |
3360 | } |
3361 | #endif /* CONFIG_MEMCG_KMEM */ | |
3362 | ||
ca3e0214 KH |
3363 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE |
3364 | ||
a0db00fc | 3365 | #define PCGF_NOCOPY_AT_SPLIT (1 << PCG_LOCK | 1 << PCG_MIGRATION) |
ca3e0214 KH |
3366 | /* |
3367 | * Because tail pages are not marked as "used", set it. We're under | |
e94c8a9c KH |
3368 | * zone->lru_lock, 'splitting on pmd' and compound_lock. |
3369 | * charge/uncharge will be never happen and move_account() is done under | |
3370 | * compound_lock(), so we don't have to take care of races. | |
ca3e0214 | 3371 | */ |
e94c8a9c | 3372 | void mem_cgroup_split_huge_fixup(struct page *head) |
ca3e0214 KH |
3373 | { |
3374 | struct page_cgroup *head_pc = lookup_page_cgroup(head); | |
e94c8a9c KH |
3375 | struct page_cgroup *pc; |
3376 | int i; | |
ca3e0214 | 3377 | |
3d37c4a9 KH |
3378 | if (mem_cgroup_disabled()) |
3379 | return; | |
e94c8a9c KH |
3380 | for (i = 1; i < HPAGE_PMD_NR; i++) { |
3381 | pc = head_pc + i; | |
3382 | pc->mem_cgroup = head_pc->mem_cgroup; | |
3383 | smp_wmb();/* see __commit_charge() */ | |
e94c8a9c KH |
3384 | pc->flags = head_pc->flags & ~PCGF_NOCOPY_AT_SPLIT; |
3385 | } | |
ca3e0214 | 3386 | } |
12d27107 | 3387 | #endif /* CONFIG_TRANSPARENT_HUGEPAGE */ |
ca3e0214 | 3388 | |
f817ed48 | 3389 | /** |
de3638d9 | 3390 | * mem_cgroup_move_account - move account of the page |
5564e88b | 3391 | * @page: the page |
7ec99d62 | 3392 | * @nr_pages: number of regular pages (>1 for huge pages) |
f817ed48 KH |
3393 | * @pc: page_cgroup of the page. |
3394 | * @from: mem_cgroup which the page is moved from. | |
3395 | * @to: mem_cgroup which the page is moved to. @from != @to. | |
3396 | * | |
3397 | * The caller must confirm following. | |
08e552c6 | 3398 | * - page is not on LRU (isolate_page() is useful.) |
7ec99d62 | 3399 | * - compound_lock is held when nr_pages > 1 |
f817ed48 | 3400 | * |
2f3479b1 KH |
3401 | * This function doesn't do "charge" to new cgroup and doesn't do "uncharge" |
3402 | * from old cgroup. | |
f817ed48 | 3403 | */ |
7ec99d62 JW |
3404 | static int mem_cgroup_move_account(struct page *page, |
3405 | unsigned int nr_pages, | |
3406 | struct page_cgroup *pc, | |
3407 | struct mem_cgroup *from, | |
2f3479b1 | 3408 | struct mem_cgroup *to) |
f817ed48 | 3409 | { |
de3638d9 JW |
3410 | unsigned long flags; |
3411 | int ret; | |
b2402857 | 3412 | bool anon = PageAnon(page); |
987eba66 | 3413 | |
f817ed48 | 3414 | VM_BUG_ON(from == to); |
5564e88b | 3415 | VM_BUG_ON(PageLRU(page)); |
de3638d9 JW |
3416 | /* |
3417 | * The page is isolated from LRU. So, collapse function | |
3418 | * will not handle this page. But page splitting can happen. | |
3419 | * Do this check under compound_page_lock(). The caller should | |
3420 | * hold it. | |
3421 | */ | |
3422 | ret = -EBUSY; | |
7ec99d62 | 3423 | if (nr_pages > 1 && !PageTransHuge(page)) |
de3638d9 JW |
3424 | goto out; |
3425 | ||
3426 | lock_page_cgroup(pc); | |
3427 | ||
3428 | ret = -EINVAL; | |
3429 | if (!PageCgroupUsed(pc) || pc->mem_cgroup != from) | |
3430 | goto unlock; | |
3431 | ||
312734c0 | 3432 | move_lock_mem_cgroup(from, &flags); |
f817ed48 | 3433 | |
2ff76f11 | 3434 | if (!anon && page_mapped(page)) { |
c62b1a3b KH |
3435 | /* Update mapped_file data for mem_cgroup */ |
3436 | preempt_disable(); | |
3437 | __this_cpu_dec(from->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]); | |
3438 | __this_cpu_inc(to->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]); | |
3439 | preempt_enable(); | |
d69b042f | 3440 | } |
b2402857 | 3441 | mem_cgroup_charge_statistics(from, anon, -nr_pages); |
d69b042f | 3442 | |
854ffa8d | 3443 | /* caller should have done css_get */ |
08e552c6 | 3444 | pc->mem_cgroup = to; |
b2402857 | 3445 | mem_cgroup_charge_statistics(to, anon, nr_pages); |
312734c0 | 3446 | move_unlock_mem_cgroup(from, &flags); |
de3638d9 JW |
3447 | ret = 0; |
3448 | unlock: | |
57f9fd7d | 3449 | unlock_page_cgroup(pc); |
d2265e6f KH |
3450 | /* |
3451 | * check events | |
3452 | */ | |
5564e88b JW |
3453 | memcg_check_events(to, page); |
3454 | memcg_check_events(from, page); | |
de3638d9 | 3455 | out: |
f817ed48 KH |
3456 | return ret; |
3457 | } | |
3458 | ||
2ef37d3f MH |
3459 | /** |
3460 | * mem_cgroup_move_parent - moves page to the parent group | |
3461 | * @page: the page to move | |
3462 | * @pc: page_cgroup of the page | |
3463 | * @child: page's cgroup | |
3464 | * | |
3465 | * move charges to its parent or the root cgroup if the group has no | |
3466 | * parent (aka use_hierarchy==0). | |
3467 | * Although this might fail (get_page_unless_zero, isolate_lru_page or | |
3468 | * mem_cgroup_move_account fails) the failure is always temporary and | |
3469 | * it signals a race with a page removal/uncharge or migration. In the | |
3470 | * first case the page is on the way out and it will vanish from the LRU | |
3471 | * on the next attempt and the call should be retried later. | |
3472 | * Isolation from the LRU fails only if page has been isolated from | |
3473 | * the LRU since we looked at it and that usually means either global | |
3474 | * reclaim or migration going on. The page will either get back to the | |
3475 | * LRU or vanish. | |
3476 | * Finaly mem_cgroup_move_account fails only if the page got uncharged | |
3477 | * (!PageCgroupUsed) or moved to a different group. The page will | |
3478 | * disappear in the next attempt. | |
f817ed48 | 3479 | */ |
5564e88b JW |
3480 | static int mem_cgroup_move_parent(struct page *page, |
3481 | struct page_cgroup *pc, | |
6068bf01 | 3482 | struct mem_cgroup *child) |
f817ed48 | 3483 | { |
f817ed48 | 3484 | struct mem_cgroup *parent; |
7ec99d62 | 3485 | unsigned int nr_pages; |
4be4489f | 3486 | unsigned long uninitialized_var(flags); |
f817ed48 KH |
3487 | int ret; |
3488 | ||
d8423011 | 3489 | VM_BUG_ON(mem_cgroup_is_root(child)); |
f817ed48 | 3490 | |
57f9fd7d DN |
3491 | ret = -EBUSY; |
3492 | if (!get_page_unless_zero(page)) | |
3493 | goto out; | |
3494 | if (isolate_lru_page(page)) | |
3495 | goto put; | |
52dbb905 | 3496 | |
7ec99d62 | 3497 | nr_pages = hpage_nr_pages(page); |
08e552c6 | 3498 | |
cc926f78 KH |
3499 | parent = parent_mem_cgroup(child); |
3500 | /* | |
3501 | * If no parent, move charges to root cgroup. | |
3502 | */ | |
3503 | if (!parent) | |
3504 | parent = root_mem_cgroup; | |
f817ed48 | 3505 | |
2ef37d3f MH |
3506 | if (nr_pages > 1) { |
3507 | VM_BUG_ON(!PageTransHuge(page)); | |
987eba66 | 3508 | flags = compound_lock_irqsave(page); |
2ef37d3f | 3509 | } |
987eba66 | 3510 | |
cc926f78 | 3511 | ret = mem_cgroup_move_account(page, nr_pages, |
2f3479b1 | 3512 | pc, child, parent); |
cc926f78 KH |
3513 | if (!ret) |
3514 | __mem_cgroup_cancel_local_charge(child, nr_pages); | |
8dba474f | 3515 | |
7ec99d62 | 3516 | if (nr_pages > 1) |
987eba66 | 3517 | compound_unlock_irqrestore(page, flags); |
08e552c6 | 3518 | putback_lru_page(page); |
57f9fd7d | 3519 | put: |
40d58138 | 3520 | put_page(page); |
57f9fd7d | 3521 | out: |
f817ed48 KH |
3522 | return ret; |
3523 | } | |
3524 | ||
7a81b88c KH |
3525 | /* |
3526 | * Charge the memory controller for page usage. | |
3527 | * Return | |
3528 | * 0 if the charge was successful | |
3529 | * < 0 if the cgroup is over its limit | |
3530 | */ | |
3531 | static int mem_cgroup_charge_common(struct page *page, struct mm_struct *mm, | |
73045c47 | 3532 | gfp_t gfp_mask, enum charge_type ctype) |
7a81b88c | 3533 | { |
c0ff4b85 | 3534 | struct mem_cgroup *memcg = NULL; |
7ec99d62 | 3535 | unsigned int nr_pages = 1; |
8493ae43 | 3536 | bool oom = true; |
7a81b88c | 3537 | int ret; |
ec168510 | 3538 | |
37c2ac78 | 3539 | if (PageTransHuge(page)) { |
7ec99d62 | 3540 | nr_pages <<= compound_order(page); |
37c2ac78 | 3541 | VM_BUG_ON(!PageTransHuge(page)); |
8493ae43 JW |
3542 | /* |
3543 | * Never OOM-kill a process for a huge page. The | |
3544 | * fault handler will fall back to regular pages. | |
3545 | */ | |
3546 | oom = false; | |
37c2ac78 | 3547 | } |
7a81b88c | 3548 | |
c0ff4b85 | 3549 | ret = __mem_cgroup_try_charge(mm, gfp_mask, nr_pages, &memcg, oom); |
38c5d72f | 3550 | if (ret == -ENOMEM) |
7a81b88c | 3551 | return ret; |
ce587e65 | 3552 | __mem_cgroup_commit_charge(memcg, page, nr_pages, ctype, false); |
8a9f3ccd | 3553 | return 0; |
8a9f3ccd BS |
3554 | } |
3555 | ||
7a81b88c KH |
3556 | int mem_cgroup_newpage_charge(struct page *page, |
3557 | struct mm_struct *mm, gfp_t gfp_mask) | |
217bc319 | 3558 | { |
f8d66542 | 3559 | if (mem_cgroup_disabled()) |
cede86ac | 3560 | return 0; |
7a0524cf JW |
3561 | VM_BUG_ON(page_mapped(page)); |
3562 | VM_BUG_ON(page->mapping && !PageAnon(page)); | |
3563 | VM_BUG_ON(!mm); | |
217bc319 | 3564 | return mem_cgroup_charge_common(page, mm, gfp_mask, |
41326c17 | 3565 | MEM_CGROUP_CHARGE_TYPE_ANON); |
217bc319 KH |
3566 | } |
3567 | ||
54595fe2 KH |
3568 | /* |
3569 | * While swap-in, try_charge -> commit or cancel, the page is locked. | |
3570 | * And when try_charge() successfully returns, one refcnt to memcg without | |
21ae2956 | 3571 | * struct page_cgroup is acquired. This refcnt will be consumed by |
54595fe2 KH |
3572 | * "commit()" or removed by "cancel()" |
3573 | */ | |
0435a2fd JW |
3574 | static int __mem_cgroup_try_charge_swapin(struct mm_struct *mm, |
3575 | struct page *page, | |
3576 | gfp_t mask, | |
3577 | struct mem_cgroup **memcgp) | |
8c7c6e34 | 3578 | { |
c0ff4b85 | 3579 | struct mem_cgroup *memcg; |
90deb788 | 3580 | struct page_cgroup *pc; |
54595fe2 | 3581 | int ret; |
8c7c6e34 | 3582 | |
90deb788 JW |
3583 | pc = lookup_page_cgroup(page); |
3584 | /* | |
3585 | * Every swap fault against a single page tries to charge the | |
3586 | * page, bail as early as possible. shmem_unuse() encounters | |
3587 | * already charged pages, too. The USED bit is protected by | |
3588 | * the page lock, which serializes swap cache removal, which | |
3589 | * in turn serializes uncharging. | |
3590 | */ | |
3591 | if (PageCgroupUsed(pc)) | |
3592 | return 0; | |
8c7c6e34 KH |
3593 | if (!do_swap_account) |
3594 | goto charge_cur_mm; | |
c0ff4b85 R |
3595 | memcg = try_get_mem_cgroup_from_page(page); |
3596 | if (!memcg) | |
54595fe2 | 3597 | goto charge_cur_mm; |
72835c86 JW |
3598 | *memcgp = memcg; |
3599 | ret = __mem_cgroup_try_charge(NULL, mask, 1, memcgp, true); | |
c0ff4b85 | 3600 | css_put(&memcg->css); |
38c5d72f KH |
3601 | if (ret == -EINTR) |
3602 | ret = 0; | |
54595fe2 | 3603 | return ret; |
8c7c6e34 | 3604 | charge_cur_mm: |
38c5d72f KH |
3605 | ret = __mem_cgroup_try_charge(mm, mask, 1, memcgp, true); |
3606 | if (ret == -EINTR) | |
3607 | ret = 0; | |
3608 | return ret; | |
8c7c6e34 KH |
3609 | } |
3610 | ||
0435a2fd JW |
3611 | int mem_cgroup_try_charge_swapin(struct mm_struct *mm, struct page *page, |
3612 | gfp_t gfp_mask, struct mem_cgroup **memcgp) | |
3613 | { | |
3614 | *memcgp = NULL; | |
3615 | if (mem_cgroup_disabled()) | |
3616 | return 0; | |
bdf4f4d2 JW |
3617 | /* |
3618 | * A racing thread's fault, or swapoff, may have already | |
3619 | * updated the pte, and even removed page from swap cache: in | |
3620 | * those cases unuse_pte()'s pte_same() test will fail; but | |
3621 | * there's also a KSM case which does need to charge the page. | |
3622 | */ | |
3623 | if (!PageSwapCache(page)) { | |
3624 | int ret; | |
3625 | ||
3626 | ret = __mem_cgroup_try_charge(mm, gfp_mask, 1, memcgp, true); | |
3627 | if (ret == -EINTR) | |
3628 | ret = 0; | |
3629 | return ret; | |
3630 | } | |
0435a2fd JW |
3631 | return __mem_cgroup_try_charge_swapin(mm, page, gfp_mask, memcgp); |
3632 | } | |
3633 | ||
827a03d2 JW |
3634 | void mem_cgroup_cancel_charge_swapin(struct mem_cgroup *memcg) |
3635 | { | |
3636 | if (mem_cgroup_disabled()) | |
3637 | return; | |
3638 | if (!memcg) | |
3639 | return; | |
3640 | __mem_cgroup_cancel_charge(memcg, 1); | |
3641 | } | |
3642 | ||
83aae4c7 | 3643 | static void |
72835c86 | 3644 | __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *memcg, |
83aae4c7 | 3645 | enum charge_type ctype) |
7a81b88c | 3646 | { |
f8d66542 | 3647 | if (mem_cgroup_disabled()) |
7a81b88c | 3648 | return; |
72835c86 | 3649 | if (!memcg) |
7a81b88c | 3650 | return; |
5a6475a4 | 3651 | |
ce587e65 | 3652 | __mem_cgroup_commit_charge(memcg, page, 1, ctype, true); |
8c7c6e34 KH |
3653 | /* |
3654 | * Now swap is on-memory. This means this page may be | |
3655 | * counted both as mem and swap....double count. | |
03f3c433 KH |
3656 | * Fix it by uncharging from memsw. Basically, this SwapCache is stable |
3657 | * under lock_page(). But in do_swap_page()::memory.c, reuse_swap_page() | |
3658 | * may call delete_from_swap_cache() before reach here. | |
8c7c6e34 | 3659 | */ |
03f3c433 | 3660 | if (do_swap_account && PageSwapCache(page)) { |
8c7c6e34 | 3661 | swp_entry_t ent = {.val = page_private(page)}; |
86493009 | 3662 | mem_cgroup_uncharge_swap(ent); |
8c7c6e34 | 3663 | } |
7a81b88c KH |
3664 | } |
3665 | ||
72835c86 JW |
3666 | void mem_cgroup_commit_charge_swapin(struct page *page, |
3667 | struct mem_cgroup *memcg) | |
83aae4c7 | 3668 | { |
72835c86 | 3669 | __mem_cgroup_commit_charge_swapin(page, memcg, |
41326c17 | 3670 | MEM_CGROUP_CHARGE_TYPE_ANON); |
83aae4c7 DN |
3671 | } |
3672 | ||
827a03d2 JW |
3673 | int mem_cgroup_cache_charge(struct page *page, struct mm_struct *mm, |
3674 | gfp_t gfp_mask) | |
7a81b88c | 3675 | { |
827a03d2 JW |
3676 | struct mem_cgroup *memcg = NULL; |
3677 | enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE; | |
3678 | int ret; | |
3679 | ||
f8d66542 | 3680 | if (mem_cgroup_disabled()) |
827a03d2 JW |
3681 | return 0; |
3682 | if (PageCompound(page)) | |
3683 | return 0; | |
3684 | ||
827a03d2 JW |
3685 | if (!PageSwapCache(page)) |
3686 | ret = mem_cgroup_charge_common(page, mm, gfp_mask, type); | |
3687 | else { /* page is swapcache/shmem */ | |
0435a2fd JW |
3688 | ret = __mem_cgroup_try_charge_swapin(mm, page, |
3689 | gfp_mask, &memcg); | |
827a03d2 JW |
3690 | if (!ret) |
3691 | __mem_cgroup_commit_charge_swapin(page, memcg, type); | |
3692 | } | |
3693 | return ret; | |
7a81b88c KH |
3694 | } |
3695 | ||
c0ff4b85 | 3696 | static void mem_cgroup_do_uncharge(struct mem_cgroup *memcg, |
7ec99d62 JW |
3697 | unsigned int nr_pages, |
3698 | const enum charge_type ctype) | |
569b846d KH |
3699 | { |
3700 | struct memcg_batch_info *batch = NULL; | |
3701 | bool uncharge_memsw = true; | |
7ec99d62 | 3702 | |
569b846d KH |
3703 | /* If swapout, usage of swap doesn't decrease */ |
3704 | if (!do_swap_account || ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) | |
3705 | uncharge_memsw = false; | |
569b846d KH |
3706 | |
3707 | batch = ¤t->memcg_batch; | |
3708 | /* | |
3709 | * In usual, we do css_get() when we remember memcg pointer. | |
3710 | * But in this case, we keep res->usage until end of a series of | |
3711 | * uncharges. Then, it's ok to ignore memcg's refcnt. | |
3712 | */ | |
3713 | if (!batch->memcg) | |
c0ff4b85 | 3714 | batch->memcg = memcg; |
3c11ecf4 KH |
3715 | /* |
3716 | * do_batch > 0 when unmapping pages or inode invalidate/truncate. | |
25985edc | 3717 | * In those cases, all pages freed continuously can be expected to be in |
3c11ecf4 KH |
3718 | * the same cgroup and we have chance to coalesce uncharges. |
3719 | * But we do uncharge one by one if this is killed by OOM(TIF_MEMDIE) | |
3720 | * because we want to do uncharge as soon as possible. | |
3721 | */ | |
3722 | ||
3723 | if (!batch->do_batch || test_thread_flag(TIF_MEMDIE)) | |
3724 | goto direct_uncharge; | |
3725 | ||
7ec99d62 | 3726 | if (nr_pages > 1) |
ec168510 AA |
3727 | goto direct_uncharge; |
3728 | ||
569b846d KH |
3729 | /* |
3730 | * In typical case, batch->memcg == mem. This means we can | |
3731 | * merge a series of uncharges to an uncharge of res_counter. | |
3732 | * If not, we uncharge res_counter ony by one. | |
3733 | */ | |
c0ff4b85 | 3734 | if (batch->memcg != memcg) |
569b846d KH |
3735 | goto direct_uncharge; |
3736 | /* remember freed charge and uncharge it later */ | |
7ffd4ca7 | 3737 | batch->nr_pages++; |
569b846d | 3738 | if (uncharge_memsw) |
7ffd4ca7 | 3739 | batch->memsw_nr_pages++; |
569b846d KH |
3740 | return; |
3741 | direct_uncharge: | |
c0ff4b85 | 3742 | res_counter_uncharge(&memcg->res, nr_pages * PAGE_SIZE); |
569b846d | 3743 | if (uncharge_memsw) |
c0ff4b85 R |
3744 | res_counter_uncharge(&memcg->memsw, nr_pages * PAGE_SIZE); |
3745 | if (unlikely(batch->memcg != memcg)) | |
3746 | memcg_oom_recover(memcg); | |
569b846d | 3747 | } |
7a81b88c | 3748 | |
8a9f3ccd | 3749 | /* |
69029cd5 | 3750 | * uncharge if !page_mapped(page) |
8a9f3ccd | 3751 | */ |
8c7c6e34 | 3752 | static struct mem_cgroup * |
0030f535 JW |
3753 | __mem_cgroup_uncharge_common(struct page *page, enum charge_type ctype, |
3754 | bool end_migration) | |
8a9f3ccd | 3755 | { |
c0ff4b85 | 3756 | struct mem_cgroup *memcg = NULL; |
7ec99d62 JW |
3757 | unsigned int nr_pages = 1; |
3758 | struct page_cgroup *pc; | |
b2402857 | 3759 | bool anon; |
8a9f3ccd | 3760 | |
f8d66542 | 3761 | if (mem_cgroup_disabled()) |
8c7c6e34 | 3762 | return NULL; |
4077960e | 3763 | |
0c59b89c | 3764 | VM_BUG_ON(PageSwapCache(page)); |
d13d1443 | 3765 | |
37c2ac78 | 3766 | if (PageTransHuge(page)) { |
7ec99d62 | 3767 | nr_pages <<= compound_order(page); |
37c2ac78 AA |
3768 | VM_BUG_ON(!PageTransHuge(page)); |
3769 | } | |
8697d331 | 3770 | /* |
3c541e14 | 3771 | * Check if our page_cgroup is valid |
8697d331 | 3772 | */ |
52d4b9ac | 3773 | pc = lookup_page_cgroup(page); |
cfa44946 | 3774 | if (unlikely(!PageCgroupUsed(pc))) |
8c7c6e34 | 3775 | return NULL; |
b9c565d5 | 3776 | |
52d4b9ac | 3777 | lock_page_cgroup(pc); |
d13d1443 | 3778 | |
c0ff4b85 | 3779 | memcg = pc->mem_cgroup; |
8c7c6e34 | 3780 | |
d13d1443 KH |
3781 | if (!PageCgroupUsed(pc)) |
3782 | goto unlock_out; | |
3783 | ||
b2402857 KH |
3784 | anon = PageAnon(page); |
3785 | ||
d13d1443 | 3786 | switch (ctype) { |
41326c17 | 3787 | case MEM_CGROUP_CHARGE_TYPE_ANON: |
2ff76f11 KH |
3788 | /* |
3789 | * Generally PageAnon tells if it's the anon statistics to be | |
3790 | * updated; but sometimes e.g. mem_cgroup_uncharge_page() is | |
3791 | * used before page reached the stage of being marked PageAnon. | |
3792 | */ | |
b2402857 KH |
3793 | anon = true; |
3794 | /* fallthrough */ | |
8a9478ca | 3795 | case MEM_CGROUP_CHARGE_TYPE_DROP: |
ac39cf8c | 3796 | /* See mem_cgroup_prepare_migration() */ |
0030f535 JW |
3797 | if (page_mapped(page)) |
3798 | goto unlock_out; | |
3799 | /* | |
3800 | * Pages under migration may not be uncharged. But | |
3801 | * end_migration() /must/ be the one uncharging the | |
3802 | * unused post-migration page and so it has to call | |
3803 | * here with the migration bit still set. See the | |
3804 | * res_counter handling below. | |
3805 | */ | |
3806 | if (!end_migration && PageCgroupMigration(pc)) | |
d13d1443 KH |
3807 | goto unlock_out; |
3808 | break; | |
3809 | case MEM_CGROUP_CHARGE_TYPE_SWAPOUT: | |
3810 | if (!PageAnon(page)) { /* Shared memory */ | |
3811 | if (page->mapping && !page_is_file_cache(page)) | |
3812 | goto unlock_out; | |
3813 | } else if (page_mapped(page)) /* Anon */ | |
3814 | goto unlock_out; | |
3815 | break; | |
3816 | default: | |
3817 | break; | |
52d4b9ac | 3818 | } |
d13d1443 | 3819 | |
b2402857 | 3820 | mem_cgroup_charge_statistics(memcg, anon, -nr_pages); |
04046e1a | 3821 | |
52d4b9ac | 3822 | ClearPageCgroupUsed(pc); |
544122e5 KH |
3823 | /* |
3824 | * pc->mem_cgroup is not cleared here. It will be accessed when it's | |
3825 | * freed from LRU. This is safe because uncharged page is expected not | |
3826 | * to be reused (freed soon). Exception is SwapCache, it's handled by | |
3827 | * special functions. | |
3828 | */ | |
b9c565d5 | 3829 | |
52d4b9ac | 3830 | unlock_page_cgroup(pc); |
f75ca962 | 3831 | /* |
c0ff4b85 | 3832 | * even after unlock, we have memcg->res.usage here and this memcg |
f75ca962 KH |
3833 | * will never be freed. |
3834 | */ | |
c0ff4b85 | 3835 | memcg_check_events(memcg, page); |
f75ca962 | 3836 | if (do_swap_account && ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) { |
c0ff4b85 R |
3837 | mem_cgroup_swap_statistics(memcg, true); |
3838 | mem_cgroup_get(memcg); | |
f75ca962 | 3839 | } |
0030f535 JW |
3840 | /* |
3841 | * Migration does not charge the res_counter for the | |
3842 | * replacement page, so leave it alone when phasing out the | |
3843 | * page that is unused after the migration. | |
3844 | */ | |
3845 | if (!end_migration && !mem_cgroup_is_root(memcg)) | |
c0ff4b85 | 3846 | mem_cgroup_do_uncharge(memcg, nr_pages, ctype); |
6d12e2d8 | 3847 | |
c0ff4b85 | 3848 | return memcg; |
d13d1443 KH |
3849 | |
3850 | unlock_out: | |
3851 | unlock_page_cgroup(pc); | |
8c7c6e34 | 3852 | return NULL; |
3c541e14 BS |
3853 | } |
3854 | ||
69029cd5 KH |
3855 | void mem_cgroup_uncharge_page(struct page *page) |
3856 | { | |
52d4b9ac KH |
3857 | /* early check. */ |
3858 | if (page_mapped(page)) | |
3859 | return; | |
40f23a21 | 3860 | VM_BUG_ON(page->mapping && !PageAnon(page)); |
0c59b89c JW |
3861 | if (PageSwapCache(page)) |
3862 | return; | |
0030f535 | 3863 | __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_ANON, false); |
69029cd5 KH |
3864 | } |
3865 | ||
3866 | void mem_cgroup_uncharge_cache_page(struct page *page) | |
3867 | { | |
3868 | VM_BUG_ON(page_mapped(page)); | |
b7abea96 | 3869 | VM_BUG_ON(page->mapping); |
0030f535 | 3870 | __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_CACHE, false); |
69029cd5 KH |
3871 | } |
3872 | ||
569b846d KH |
3873 | /* |
3874 | * Batch_start/batch_end is called in unmap_page_range/invlidate/trucate. | |
3875 | * In that cases, pages are freed continuously and we can expect pages | |
3876 | * are in the same memcg. All these calls itself limits the number of | |
3877 | * pages freed at once, then uncharge_start/end() is called properly. | |
3878 | * This may be called prural(2) times in a context, | |
3879 | */ | |
3880 | ||
3881 | void mem_cgroup_uncharge_start(void) | |
3882 | { | |
3883 | current->memcg_batch.do_batch++; | |
3884 | /* We can do nest. */ | |
3885 | if (current->memcg_batch.do_batch == 1) { | |
3886 | current->memcg_batch.memcg = NULL; | |
7ffd4ca7 JW |
3887 | current->memcg_batch.nr_pages = 0; |
3888 | current->memcg_batch.memsw_nr_pages = 0; | |
569b846d KH |
3889 | } |
3890 | } | |
3891 | ||
3892 | void mem_cgroup_uncharge_end(void) | |
3893 | { | |
3894 | struct memcg_batch_info *batch = ¤t->memcg_batch; | |
3895 | ||
3896 | if (!batch->do_batch) | |
3897 | return; | |
3898 | ||
3899 | batch->do_batch--; | |
3900 | if (batch->do_batch) /* If stacked, do nothing. */ | |
3901 | return; | |
3902 | ||
3903 | if (!batch->memcg) | |
3904 | return; | |
3905 | /* | |
3906 | * This "batch->memcg" is valid without any css_get/put etc... | |
3907 | * bacause we hide charges behind us. | |
3908 | */ | |
7ffd4ca7 JW |
3909 | if (batch->nr_pages) |
3910 | res_counter_uncharge(&batch->memcg->res, | |
3911 | batch->nr_pages * PAGE_SIZE); | |
3912 | if (batch->memsw_nr_pages) | |
3913 | res_counter_uncharge(&batch->memcg->memsw, | |
3914 | batch->memsw_nr_pages * PAGE_SIZE); | |
3c11ecf4 | 3915 | memcg_oom_recover(batch->memcg); |
569b846d KH |
3916 | /* forget this pointer (for sanity check) */ |
3917 | batch->memcg = NULL; | |
3918 | } | |
3919 | ||
e767e056 | 3920 | #ifdef CONFIG_SWAP |
8c7c6e34 | 3921 | /* |
e767e056 | 3922 | * called after __delete_from_swap_cache() and drop "page" account. |
8c7c6e34 KH |
3923 | * memcg information is recorded to swap_cgroup of "ent" |
3924 | */ | |
8a9478ca KH |
3925 | void |
3926 | mem_cgroup_uncharge_swapcache(struct page *page, swp_entry_t ent, bool swapout) | |
8c7c6e34 KH |
3927 | { |
3928 | struct mem_cgroup *memcg; | |
8a9478ca KH |
3929 | int ctype = MEM_CGROUP_CHARGE_TYPE_SWAPOUT; |
3930 | ||
3931 | if (!swapout) /* this was a swap cache but the swap is unused ! */ | |
3932 | ctype = MEM_CGROUP_CHARGE_TYPE_DROP; | |
3933 | ||
0030f535 | 3934 | memcg = __mem_cgroup_uncharge_common(page, ctype, false); |
8c7c6e34 | 3935 | |
f75ca962 KH |
3936 | /* |
3937 | * record memcg information, if swapout && memcg != NULL, | |
3938 | * mem_cgroup_get() was called in uncharge(). | |
3939 | */ | |
3940 | if (do_swap_account && swapout && memcg) | |
a3b2d692 | 3941 | swap_cgroup_record(ent, css_id(&memcg->css)); |
8c7c6e34 | 3942 | } |
e767e056 | 3943 | #endif |
8c7c6e34 | 3944 | |
c255a458 | 3945 | #ifdef CONFIG_MEMCG_SWAP |
8c7c6e34 KH |
3946 | /* |
3947 | * called from swap_entry_free(). remove record in swap_cgroup and | |
3948 | * uncharge "memsw" account. | |
3949 | */ | |
3950 | void mem_cgroup_uncharge_swap(swp_entry_t ent) | |
d13d1443 | 3951 | { |
8c7c6e34 | 3952 | struct mem_cgroup *memcg; |
a3b2d692 | 3953 | unsigned short id; |
8c7c6e34 KH |
3954 | |
3955 | if (!do_swap_account) | |
3956 | return; | |
3957 | ||
a3b2d692 KH |
3958 | id = swap_cgroup_record(ent, 0); |
3959 | rcu_read_lock(); | |
3960 | memcg = mem_cgroup_lookup(id); | |
8c7c6e34 | 3961 | if (memcg) { |
a3b2d692 KH |
3962 | /* |
3963 | * We uncharge this because swap is freed. | |
3964 | * This memcg can be obsolete one. We avoid calling css_tryget | |
3965 | */ | |
0c3e73e8 | 3966 | if (!mem_cgroup_is_root(memcg)) |
4e649152 | 3967 | res_counter_uncharge(&memcg->memsw, PAGE_SIZE); |
0c3e73e8 | 3968 | mem_cgroup_swap_statistics(memcg, false); |
8c7c6e34 KH |
3969 | mem_cgroup_put(memcg); |
3970 | } | |
a3b2d692 | 3971 | rcu_read_unlock(); |
d13d1443 | 3972 | } |
02491447 DN |
3973 | |
3974 | /** | |
3975 | * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record. | |
3976 | * @entry: swap entry to be moved | |
3977 | * @from: mem_cgroup which the entry is moved from | |
3978 | * @to: mem_cgroup which the entry is moved to | |
3979 | * | |
3980 | * It succeeds only when the swap_cgroup's record for this entry is the same | |
3981 | * as the mem_cgroup's id of @from. | |
3982 | * | |
3983 | * Returns 0 on success, -EINVAL on failure. | |
3984 | * | |
3985 | * The caller must have charged to @to, IOW, called res_counter_charge() about | |
3986 | * both res and memsw, and called css_get(). | |
3987 | */ | |
3988 | static int mem_cgroup_move_swap_account(swp_entry_t entry, | |
e91cbb42 | 3989 | struct mem_cgroup *from, struct mem_cgroup *to) |
02491447 DN |
3990 | { |
3991 | unsigned short old_id, new_id; | |
3992 | ||
3993 | old_id = css_id(&from->css); | |
3994 | new_id = css_id(&to->css); | |
3995 | ||
3996 | if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) { | |
02491447 | 3997 | mem_cgroup_swap_statistics(from, false); |
483c30b5 | 3998 | mem_cgroup_swap_statistics(to, true); |
02491447 | 3999 | /* |
483c30b5 DN |
4000 | * This function is only called from task migration context now. |
4001 | * It postpones res_counter and refcount handling till the end | |
4002 | * of task migration(mem_cgroup_clear_mc()) for performance | |
4003 | * improvement. But we cannot postpone mem_cgroup_get(to) | |
4004 | * because if the process that has been moved to @to does | |
4005 | * swap-in, the refcount of @to might be decreased to 0. | |
02491447 | 4006 | */ |
02491447 | 4007 | mem_cgroup_get(to); |
02491447 DN |
4008 | return 0; |
4009 | } | |
4010 | return -EINVAL; | |
4011 | } | |
4012 | #else | |
4013 | static inline int mem_cgroup_move_swap_account(swp_entry_t entry, | |
e91cbb42 | 4014 | struct mem_cgroup *from, struct mem_cgroup *to) |
02491447 DN |
4015 | { |
4016 | return -EINVAL; | |
4017 | } | |
8c7c6e34 | 4018 | #endif |
d13d1443 | 4019 | |
ae41be37 | 4020 | /* |
01b1ae63 KH |
4021 | * Before starting migration, account PAGE_SIZE to mem_cgroup that the old |
4022 | * page belongs to. | |
ae41be37 | 4023 | */ |
0030f535 JW |
4024 | void mem_cgroup_prepare_migration(struct page *page, struct page *newpage, |
4025 | struct mem_cgroup **memcgp) | |
ae41be37 | 4026 | { |
c0ff4b85 | 4027 | struct mem_cgroup *memcg = NULL; |
b32967ff | 4028 | unsigned int nr_pages = 1; |
7ec99d62 | 4029 | struct page_cgroup *pc; |
ac39cf8c | 4030 | enum charge_type ctype; |
8869b8f6 | 4031 | |
72835c86 | 4032 | *memcgp = NULL; |
56039efa | 4033 | |
f8d66542 | 4034 | if (mem_cgroup_disabled()) |
0030f535 | 4035 | return; |
4077960e | 4036 | |
b32967ff MG |
4037 | if (PageTransHuge(page)) |
4038 | nr_pages <<= compound_order(page); | |
4039 | ||
52d4b9ac KH |
4040 | pc = lookup_page_cgroup(page); |
4041 | lock_page_cgroup(pc); | |
4042 | if (PageCgroupUsed(pc)) { | |
c0ff4b85 R |
4043 | memcg = pc->mem_cgroup; |
4044 | css_get(&memcg->css); | |
ac39cf8c AM |
4045 | /* |
4046 | * At migrating an anonymous page, its mapcount goes down | |
4047 | * to 0 and uncharge() will be called. But, even if it's fully | |
4048 | * unmapped, migration may fail and this page has to be | |
4049 | * charged again. We set MIGRATION flag here and delay uncharge | |
4050 | * until end_migration() is called | |
4051 | * | |
4052 | * Corner Case Thinking | |
4053 | * A) | |
4054 | * When the old page was mapped as Anon and it's unmap-and-freed | |
4055 | * while migration was ongoing. | |
4056 | * If unmap finds the old page, uncharge() of it will be delayed | |
4057 | * until end_migration(). If unmap finds a new page, it's | |
4058 | * uncharged when it make mapcount to be 1->0. If unmap code | |
4059 | * finds swap_migration_entry, the new page will not be mapped | |
4060 | * and end_migration() will find it(mapcount==0). | |
4061 | * | |
4062 | * B) | |
4063 | * When the old page was mapped but migraion fails, the kernel | |
4064 | * remaps it. A charge for it is kept by MIGRATION flag even | |
4065 | * if mapcount goes down to 0. We can do remap successfully | |
4066 | * without charging it again. | |
4067 | * | |
4068 | * C) | |
4069 | * The "old" page is under lock_page() until the end of | |
4070 | * migration, so, the old page itself will not be swapped-out. | |
4071 | * If the new page is swapped out before end_migraton, our | |
4072 | * hook to usual swap-out path will catch the event. | |
4073 | */ | |
4074 | if (PageAnon(page)) | |
4075 | SetPageCgroupMigration(pc); | |
e8589cc1 | 4076 | } |
52d4b9ac | 4077 | unlock_page_cgroup(pc); |
ac39cf8c AM |
4078 | /* |
4079 | * If the page is not charged at this point, | |
4080 | * we return here. | |
4081 | */ | |
c0ff4b85 | 4082 | if (!memcg) |
0030f535 | 4083 | return; |
01b1ae63 | 4084 | |
72835c86 | 4085 | *memcgp = memcg; |
ac39cf8c AM |
4086 | /* |
4087 | * We charge new page before it's used/mapped. So, even if unlock_page() | |
4088 | * is called before end_migration, we can catch all events on this new | |
4089 | * page. In the case new page is migrated but not remapped, new page's | |
4090 | * mapcount will be finally 0 and we call uncharge in end_migration(). | |
4091 | */ | |
ac39cf8c | 4092 | if (PageAnon(page)) |
41326c17 | 4093 | ctype = MEM_CGROUP_CHARGE_TYPE_ANON; |
ac39cf8c | 4094 | else |
62ba7442 | 4095 | ctype = MEM_CGROUP_CHARGE_TYPE_CACHE; |
0030f535 JW |
4096 | /* |
4097 | * The page is committed to the memcg, but it's not actually | |
4098 | * charged to the res_counter since we plan on replacing the | |
4099 | * old one and only one page is going to be left afterwards. | |
4100 | */ | |
b32967ff | 4101 | __mem_cgroup_commit_charge(memcg, newpage, nr_pages, ctype, false); |
ae41be37 | 4102 | } |
8869b8f6 | 4103 | |
69029cd5 | 4104 | /* remove redundant charge if migration failed*/ |
c0ff4b85 | 4105 | void mem_cgroup_end_migration(struct mem_cgroup *memcg, |
50de1dd9 | 4106 | struct page *oldpage, struct page *newpage, bool migration_ok) |
ae41be37 | 4107 | { |
ac39cf8c | 4108 | struct page *used, *unused; |
01b1ae63 | 4109 | struct page_cgroup *pc; |
b2402857 | 4110 | bool anon; |
01b1ae63 | 4111 | |
c0ff4b85 | 4112 | if (!memcg) |
01b1ae63 | 4113 | return; |
b25ed609 | 4114 | |
50de1dd9 | 4115 | if (!migration_ok) { |
ac39cf8c AM |
4116 | used = oldpage; |
4117 | unused = newpage; | |
01b1ae63 | 4118 | } else { |
ac39cf8c | 4119 | used = newpage; |
01b1ae63 KH |
4120 | unused = oldpage; |
4121 | } | |
0030f535 | 4122 | anon = PageAnon(used); |
7d188958 JW |
4123 | __mem_cgroup_uncharge_common(unused, |
4124 | anon ? MEM_CGROUP_CHARGE_TYPE_ANON | |
4125 | : MEM_CGROUP_CHARGE_TYPE_CACHE, | |
4126 | true); | |
0030f535 | 4127 | css_put(&memcg->css); |
69029cd5 | 4128 | /* |
ac39cf8c AM |
4129 | * We disallowed uncharge of pages under migration because mapcount |
4130 | * of the page goes down to zero, temporarly. | |
4131 | * Clear the flag and check the page should be charged. | |
01b1ae63 | 4132 | */ |
ac39cf8c AM |
4133 | pc = lookup_page_cgroup(oldpage); |
4134 | lock_page_cgroup(pc); | |
4135 | ClearPageCgroupMigration(pc); | |
4136 | unlock_page_cgroup(pc); | |
ac39cf8c | 4137 | |
01b1ae63 | 4138 | /* |
ac39cf8c AM |
4139 | * If a page is a file cache, radix-tree replacement is very atomic |
4140 | * and we can skip this check. When it was an Anon page, its mapcount | |
4141 | * goes down to 0. But because we added MIGRATION flage, it's not | |
4142 | * uncharged yet. There are several case but page->mapcount check | |
4143 | * and USED bit check in mem_cgroup_uncharge_page() will do enough | |
4144 | * check. (see prepare_charge() also) | |
69029cd5 | 4145 | */ |
b2402857 | 4146 | if (anon) |
ac39cf8c | 4147 | mem_cgroup_uncharge_page(used); |
ae41be37 | 4148 | } |
78fb7466 | 4149 | |
ab936cbc KH |
4150 | /* |
4151 | * At replace page cache, newpage is not under any memcg but it's on | |
4152 | * LRU. So, this function doesn't touch res_counter but handles LRU | |
4153 | * in correct way. Both pages are locked so we cannot race with uncharge. | |
4154 | */ | |
4155 | void mem_cgroup_replace_page_cache(struct page *oldpage, | |
4156 | struct page *newpage) | |
4157 | { | |
bde05d1c | 4158 | struct mem_cgroup *memcg = NULL; |
ab936cbc | 4159 | struct page_cgroup *pc; |
ab936cbc | 4160 | enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE; |
ab936cbc KH |
4161 | |
4162 | if (mem_cgroup_disabled()) | |
4163 | return; | |
4164 | ||
4165 | pc = lookup_page_cgroup(oldpage); | |
4166 | /* fix accounting on old pages */ | |
4167 | lock_page_cgroup(pc); | |
bde05d1c HD |
4168 | if (PageCgroupUsed(pc)) { |
4169 | memcg = pc->mem_cgroup; | |
4170 | mem_cgroup_charge_statistics(memcg, false, -1); | |
4171 | ClearPageCgroupUsed(pc); | |
4172 | } | |
ab936cbc KH |
4173 | unlock_page_cgroup(pc); |
4174 | ||
bde05d1c HD |
4175 | /* |
4176 | * When called from shmem_replace_page(), in some cases the | |
4177 | * oldpage has already been charged, and in some cases not. | |
4178 | */ | |
4179 | if (!memcg) | |
4180 | return; | |
ab936cbc KH |
4181 | /* |
4182 | * Even if newpage->mapping was NULL before starting replacement, | |
4183 | * the newpage may be on LRU(or pagevec for LRU) already. We lock | |
4184 | * LRU while we overwrite pc->mem_cgroup. | |
4185 | */ | |
ce587e65 | 4186 | __mem_cgroup_commit_charge(memcg, newpage, 1, type, true); |
ab936cbc KH |
4187 | } |
4188 | ||
f212ad7c DN |
4189 | #ifdef CONFIG_DEBUG_VM |
4190 | static struct page_cgroup *lookup_page_cgroup_used(struct page *page) | |
4191 | { | |
4192 | struct page_cgroup *pc; | |
4193 | ||
4194 | pc = lookup_page_cgroup(page); | |
cfa44946 JW |
4195 | /* |
4196 | * Can be NULL while feeding pages into the page allocator for | |
4197 | * the first time, i.e. during boot or memory hotplug; | |
4198 | * or when mem_cgroup_disabled(). | |
4199 | */ | |
f212ad7c DN |
4200 | if (likely(pc) && PageCgroupUsed(pc)) |
4201 | return pc; | |
4202 | return NULL; | |
4203 | } | |
4204 | ||
4205 | bool mem_cgroup_bad_page_check(struct page *page) | |
4206 | { | |
4207 | if (mem_cgroup_disabled()) | |
4208 | return false; | |
4209 | ||
4210 | return lookup_page_cgroup_used(page) != NULL; | |
4211 | } | |
4212 | ||
4213 | void mem_cgroup_print_bad_page(struct page *page) | |
4214 | { | |
4215 | struct page_cgroup *pc; | |
4216 | ||
4217 | pc = lookup_page_cgroup_used(page); | |
4218 | if (pc) { | |
90b3feae | 4219 | printk(KERN_ALERT "pc:%p pc->flags:%lx pc->mem_cgroup:%p\n", |
f212ad7c | 4220 | pc, pc->flags, pc->mem_cgroup); |
f212ad7c DN |
4221 | } |
4222 | } | |
4223 | #endif | |
4224 | ||
8c7c6e34 KH |
4225 | static DEFINE_MUTEX(set_limit_mutex); |
4226 | ||
d38d2a75 | 4227 | static int mem_cgroup_resize_limit(struct mem_cgroup *memcg, |
8c7c6e34 | 4228 | unsigned long long val) |
628f4235 | 4229 | { |
81d39c20 | 4230 | int retry_count; |
3c11ecf4 | 4231 | u64 memswlimit, memlimit; |
628f4235 | 4232 | int ret = 0; |
81d39c20 KH |
4233 | int children = mem_cgroup_count_children(memcg); |
4234 | u64 curusage, oldusage; | |
3c11ecf4 | 4235 | int enlarge; |
81d39c20 KH |
4236 | |
4237 | /* | |
4238 | * For keeping hierarchical_reclaim simple, how long we should retry | |
4239 | * is depends on callers. We set our retry-count to be function | |
4240 | * of # of children which we should visit in this loop. | |
4241 | */ | |
4242 | retry_count = MEM_CGROUP_RECLAIM_RETRIES * children; | |
4243 | ||
4244 | oldusage = res_counter_read_u64(&memcg->res, RES_USAGE); | |
628f4235 | 4245 | |
3c11ecf4 | 4246 | enlarge = 0; |
8c7c6e34 | 4247 | while (retry_count) { |
628f4235 KH |
4248 | if (signal_pending(current)) { |
4249 | ret = -EINTR; | |
4250 | break; | |
4251 | } | |
8c7c6e34 KH |
4252 | /* |
4253 | * Rather than hide all in some function, I do this in | |
4254 | * open coded manner. You see what this really does. | |
aaad153e | 4255 | * We have to guarantee memcg->res.limit <= memcg->memsw.limit. |
8c7c6e34 KH |
4256 | */ |
4257 | mutex_lock(&set_limit_mutex); | |
4258 | memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT); | |
4259 | if (memswlimit < val) { | |
4260 | ret = -EINVAL; | |
4261 | mutex_unlock(&set_limit_mutex); | |
628f4235 KH |
4262 | break; |
4263 | } | |
3c11ecf4 KH |
4264 | |
4265 | memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT); | |
4266 | if (memlimit < val) | |
4267 | enlarge = 1; | |
4268 | ||
8c7c6e34 | 4269 | ret = res_counter_set_limit(&memcg->res, val); |
22a668d7 KH |
4270 | if (!ret) { |
4271 | if (memswlimit == val) | |
4272 | memcg->memsw_is_minimum = true; | |
4273 | else | |
4274 | memcg->memsw_is_minimum = false; | |
4275 | } | |
8c7c6e34 KH |
4276 | mutex_unlock(&set_limit_mutex); |
4277 | ||
4278 | if (!ret) | |
4279 | break; | |
4280 | ||
5660048c JW |
4281 | mem_cgroup_reclaim(memcg, GFP_KERNEL, |
4282 | MEM_CGROUP_RECLAIM_SHRINK); | |
81d39c20 KH |
4283 | curusage = res_counter_read_u64(&memcg->res, RES_USAGE); |
4284 | /* Usage is reduced ? */ | |
4285 | if (curusage >= oldusage) | |
4286 | retry_count--; | |
4287 | else | |
4288 | oldusage = curusage; | |
8c7c6e34 | 4289 | } |
3c11ecf4 KH |
4290 | if (!ret && enlarge) |
4291 | memcg_oom_recover(memcg); | |
14797e23 | 4292 | |
8c7c6e34 KH |
4293 | return ret; |
4294 | } | |
4295 | ||
338c8431 LZ |
4296 | static int mem_cgroup_resize_memsw_limit(struct mem_cgroup *memcg, |
4297 | unsigned long long val) | |
8c7c6e34 | 4298 | { |
81d39c20 | 4299 | int retry_count; |
3c11ecf4 | 4300 | u64 memlimit, memswlimit, oldusage, curusage; |
81d39c20 KH |
4301 | int children = mem_cgroup_count_children(memcg); |
4302 | int ret = -EBUSY; | |
3c11ecf4 | 4303 | int enlarge = 0; |
8c7c6e34 | 4304 | |
81d39c20 KH |
4305 | /* see mem_cgroup_resize_res_limit */ |
4306 | retry_count = children * MEM_CGROUP_RECLAIM_RETRIES; | |
4307 | oldusage = res_counter_read_u64(&memcg->memsw, RES_USAGE); | |
8c7c6e34 KH |
4308 | while (retry_count) { |
4309 | if (signal_pending(current)) { | |
4310 | ret = -EINTR; | |
4311 | break; | |
4312 | } | |
4313 | /* | |
4314 | * Rather than hide all in some function, I do this in | |
4315 | * open coded manner. You see what this really does. | |
aaad153e | 4316 | * We have to guarantee memcg->res.limit <= memcg->memsw.limit. |
8c7c6e34 KH |
4317 | */ |
4318 | mutex_lock(&set_limit_mutex); | |
4319 | memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT); | |
4320 | if (memlimit > val) { | |
4321 | ret = -EINVAL; | |
4322 | mutex_unlock(&set_limit_mutex); | |
4323 | break; | |
4324 | } | |
3c11ecf4 KH |
4325 | memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT); |
4326 | if (memswlimit < val) | |
4327 | enlarge = 1; | |
8c7c6e34 | 4328 | ret = res_counter_set_limit(&memcg->memsw, val); |
22a668d7 KH |
4329 | if (!ret) { |
4330 | if (memlimit == val) | |
4331 | memcg->memsw_is_minimum = true; | |
4332 | else | |
4333 | memcg->memsw_is_minimum = false; | |
4334 | } | |
8c7c6e34 KH |
4335 | mutex_unlock(&set_limit_mutex); |
4336 | ||
4337 | if (!ret) | |
4338 | break; | |
4339 | ||
5660048c JW |
4340 | mem_cgroup_reclaim(memcg, GFP_KERNEL, |
4341 | MEM_CGROUP_RECLAIM_NOSWAP | | |
4342 | MEM_CGROUP_RECLAIM_SHRINK); | |
8c7c6e34 | 4343 | curusage = res_counter_read_u64(&memcg->memsw, RES_USAGE); |
81d39c20 | 4344 | /* Usage is reduced ? */ |
8c7c6e34 | 4345 | if (curusage >= oldusage) |
628f4235 | 4346 | retry_count--; |
81d39c20 KH |
4347 | else |
4348 | oldusage = curusage; | |
628f4235 | 4349 | } |
3c11ecf4 KH |
4350 | if (!ret && enlarge) |
4351 | memcg_oom_recover(memcg); | |
628f4235 KH |
4352 | return ret; |
4353 | } | |
4354 | ||
4e416953 | 4355 | unsigned long mem_cgroup_soft_limit_reclaim(struct zone *zone, int order, |
0ae5e89c YH |
4356 | gfp_t gfp_mask, |
4357 | unsigned long *total_scanned) | |
4e416953 BS |
4358 | { |
4359 | unsigned long nr_reclaimed = 0; | |
4360 | struct mem_cgroup_per_zone *mz, *next_mz = NULL; | |
4361 | unsigned long reclaimed; | |
4362 | int loop = 0; | |
4363 | struct mem_cgroup_tree_per_zone *mctz; | |
ef8745c1 | 4364 | unsigned long long excess; |
0ae5e89c | 4365 | unsigned long nr_scanned; |
4e416953 BS |
4366 | |
4367 | if (order > 0) | |
4368 | return 0; | |
4369 | ||
00918b6a | 4370 | mctz = soft_limit_tree_node_zone(zone_to_nid(zone), zone_idx(zone)); |
4e416953 BS |
4371 | /* |
4372 | * This loop can run a while, specially if mem_cgroup's continuously | |
4373 | * keep exceeding their soft limit and putting the system under | |
4374 | * pressure | |
4375 | */ | |
4376 | do { | |
4377 | if (next_mz) | |
4378 | mz = next_mz; | |
4379 | else | |
4380 | mz = mem_cgroup_largest_soft_limit_node(mctz); | |
4381 | if (!mz) | |
4382 | break; | |
4383 | ||
0ae5e89c | 4384 | nr_scanned = 0; |
d79154bb | 4385 | reclaimed = mem_cgroup_soft_reclaim(mz->memcg, zone, |
5660048c | 4386 | gfp_mask, &nr_scanned); |
4e416953 | 4387 | nr_reclaimed += reclaimed; |
0ae5e89c | 4388 | *total_scanned += nr_scanned; |
4e416953 BS |
4389 | spin_lock(&mctz->lock); |
4390 | ||
4391 | /* | |
4392 | * If we failed to reclaim anything from this memory cgroup | |
4393 | * it is time to move on to the next cgroup | |
4394 | */ | |
4395 | next_mz = NULL; | |
4396 | if (!reclaimed) { | |
4397 | do { | |
4398 | /* | |
4399 | * Loop until we find yet another one. | |
4400 | * | |
4401 | * By the time we get the soft_limit lock | |
4402 | * again, someone might have aded the | |
4403 | * group back on the RB tree. Iterate to | |
4404 | * make sure we get a different mem. | |
4405 | * mem_cgroup_largest_soft_limit_node returns | |
4406 | * NULL if no other cgroup is present on | |
4407 | * the tree | |
4408 | */ | |
4409 | next_mz = | |
4410 | __mem_cgroup_largest_soft_limit_node(mctz); | |
39cc98f1 | 4411 | if (next_mz == mz) |
d79154bb | 4412 | css_put(&next_mz->memcg->css); |
39cc98f1 | 4413 | else /* next_mz == NULL or other memcg */ |
4e416953 BS |
4414 | break; |
4415 | } while (1); | |
4416 | } | |
d79154bb HD |
4417 | __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz); |
4418 | excess = res_counter_soft_limit_excess(&mz->memcg->res); | |
4e416953 BS |
4419 | /* |
4420 | * One school of thought says that we should not add | |
4421 | * back the node to the tree if reclaim returns 0. | |
4422 | * But our reclaim could return 0, simply because due | |
4423 | * to priority we are exposing a smaller subset of | |
4424 | * memory to reclaim from. Consider this as a longer | |
4425 | * term TODO. | |
4426 | */ | |
ef8745c1 | 4427 | /* If excess == 0, no tree ops */ |
d79154bb | 4428 | __mem_cgroup_insert_exceeded(mz->memcg, mz, mctz, excess); |
4e416953 | 4429 | spin_unlock(&mctz->lock); |
d79154bb | 4430 | css_put(&mz->memcg->css); |
4e416953 BS |
4431 | loop++; |
4432 | /* | |
4433 | * Could not reclaim anything and there are no more | |
4434 | * mem cgroups to try or we seem to be looping without | |
4435 | * reclaiming anything. | |
4436 | */ | |
4437 | if (!nr_reclaimed && | |
4438 | (next_mz == NULL || | |
4439 | loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS)) | |
4440 | break; | |
4441 | } while (!nr_reclaimed); | |
4442 | if (next_mz) | |
d79154bb | 4443 | css_put(&next_mz->memcg->css); |
4e416953 BS |
4444 | return nr_reclaimed; |
4445 | } | |
4446 | ||
2ef37d3f MH |
4447 | /** |
4448 | * mem_cgroup_force_empty_list - clears LRU of a group | |
4449 | * @memcg: group to clear | |
4450 | * @node: NUMA node | |
4451 | * @zid: zone id | |
4452 | * @lru: lru to to clear | |
4453 | * | |
3c935d18 | 4454 | * Traverse a specified page_cgroup list and try to drop them all. This doesn't |
2ef37d3f MH |
4455 | * reclaim the pages page themselves - pages are moved to the parent (or root) |
4456 | * group. | |
cc847582 | 4457 | */ |
2ef37d3f | 4458 | static void mem_cgroup_force_empty_list(struct mem_cgroup *memcg, |
08e552c6 | 4459 | int node, int zid, enum lru_list lru) |
cc847582 | 4460 | { |
bea8c150 | 4461 | struct lruvec *lruvec; |
2ef37d3f | 4462 | unsigned long flags; |
072c56c1 | 4463 | struct list_head *list; |
925b7673 JW |
4464 | struct page *busy; |
4465 | struct zone *zone; | |
072c56c1 | 4466 | |
08e552c6 | 4467 | zone = &NODE_DATA(node)->node_zones[zid]; |
bea8c150 HD |
4468 | lruvec = mem_cgroup_zone_lruvec(zone, memcg); |
4469 | list = &lruvec->lists[lru]; | |
cc847582 | 4470 | |
f817ed48 | 4471 | busy = NULL; |
2ef37d3f | 4472 | do { |
925b7673 | 4473 | struct page_cgroup *pc; |
5564e88b JW |
4474 | struct page *page; |
4475 | ||
08e552c6 | 4476 | spin_lock_irqsave(&zone->lru_lock, flags); |
f817ed48 | 4477 | if (list_empty(list)) { |
08e552c6 | 4478 | spin_unlock_irqrestore(&zone->lru_lock, flags); |
52d4b9ac | 4479 | break; |
f817ed48 | 4480 | } |
925b7673 JW |
4481 | page = list_entry(list->prev, struct page, lru); |
4482 | if (busy == page) { | |
4483 | list_move(&page->lru, list); | |
648bcc77 | 4484 | busy = NULL; |
08e552c6 | 4485 | spin_unlock_irqrestore(&zone->lru_lock, flags); |
f817ed48 KH |
4486 | continue; |
4487 | } | |
08e552c6 | 4488 | spin_unlock_irqrestore(&zone->lru_lock, flags); |
f817ed48 | 4489 | |
925b7673 | 4490 | pc = lookup_page_cgroup(page); |
5564e88b | 4491 | |
3c935d18 | 4492 | if (mem_cgroup_move_parent(page, pc, memcg)) { |
f817ed48 | 4493 | /* found lock contention or "pc" is obsolete. */ |
925b7673 | 4494 | busy = page; |
f817ed48 KH |
4495 | cond_resched(); |
4496 | } else | |
4497 | busy = NULL; | |
2ef37d3f | 4498 | } while (!list_empty(list)); |
cc847582 KH |
4499 | } |
4500 | ||
4501 | /* | |
c26251f9 MH |
4502 | * make mem_cgroup's charge to be 0 if there is no task by moving |
4503 | * all the charges and pages to the parent. | |
cc847582 | 4504 | * This enables deleting this mem_cgroup. |
c26251f9 MH |
4505 | * |
4506 | * Caller is responsible for holding css reference on the memcg. | |
cc847582 | 4507 | */ |
ab5196c2 | 4508 | static void mem_cgroup_reparent_charges(struct mem_cgroup *memcg) |
cc847582 | 4509 | { |
c26251f9 | 4510 | int node, zid; |
bea207c8 | 4511 | u64 usage; |
f817ed48 | 4512 | |
fce66477 | 4513 | do { |
52d4b9ac KH |
4514 | /* This is for making all *used* pages to be on LRU. */ |
4515 | lru_add_drain_all(); | |
c0ff4b85 | 4516 | drain_all_stock_sync(memcg); |
c0ff4b85 | 4517 | mem_cgroup_start_move(memcg); |
31aaea4a | 4518 | for_each_node_state(node, N_MEMORY) { |
2ef37d3f | 4519 | for (zid = 0; zid < MAX_NR_ZONES; zid++) { |
f156ab93 HD |
4520 | enum lru_list lru; |
4521 | for_each_lru(lru) { | |
2ef37d3f | 4522 | mem_cgroup_force_empty_list(memcg, |
f156ab93 | 4523 | node, zid, lru); |
f817ed48 | 4524 | } |
1ecaab2b | 4525 | } |
f817ed48 | 4526 | } |
c0ff4b85 R |
4527 | mem_cgroup_end_move(memcg); |
4528 | memcg_oom_recover(memcg); | |
52d4b9ac | 4529 | cond_resched(); |
f817ed48 | 4530 | |
2ef37d3f | 4531 | /* |
bea207c8 GC |
4532 | * Kernel memory may not necessarily be trackable to a specific |
4533 | * process. So they are not migrated, and therefore we can't | |
4534 | * expect their value to drop to 0 here. | |
4535 | * Having res filled up with kmem only is enough. | |
4536 | * | |
2ef37d3f MH |
4537 | * This is a safety check because mem_cgroup_force_empty_list |
4538 | * could have raced with mem_cgroup_replace_page_cache callers | |
4539 | * so the lru seemed empty but the page could have been added | |
4540 | * right after the check. RES_USAGE should be safe as we always | |
4541 | * charge before adding to the LRU. | |
4542 | */ | |
bea207c8 GC |
4543 | usage = res_counter_read_u64(&memcg->res, RES_USAGE) - |
4544 | res_counter_read_u64(&memcg->kmem, RES_USAGE); | |
4545 | } while (usage > 0); | |
c26251f9 MH |
4546 | } |
4547 | ||
4548 | /* | |
4549 | * Reclaims as many pages from the given memcg as possible and moves | |
4550 | * the rest to the parent. | |
4551 | * | |
4552 | * Caller is responsible for holding css reference for memcg. | |
4553 | */ | |
4554 | static int mem_cgroup_force_empty(struct mem_cgroup *memcg) | |
4555 | { | |
4556 | int nr_retries = MEM_CGROUP_RECLAIM_RETRIES; | |
4557 | struct cgroup *cgrp = memcg->css.cgroup; | |
f817ed48 | 4558 | |
c1e862c1 | 4559 | /* returns EBUSY if there is a task or if we come here twice. */ |
c26251f9 MH |
4560 | if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children)) |
4561 | return -EBUSY; | |
4562 | ||
c1e862c1 KH |
4563 | /* we call try-to-free pages for make this cgroup empty */ |
4564 | lru_add_drain_all(); | |
f817ed48 | 4565 | /* try to free all pages in this cgroup */ |
569530fb | 4566 | while (nr_retries && res_counter_read_u64(&memcg->res, RES_USAGE) > 0) { |
f817ed48 | 4567 | int progress; |
c1e862c1 | 4568 | |
c26251f9 MH |
4569 | if (signal_pending(current)) |
4570 | return -EINTR; | |
4571 | ||
c0ff4b85 | 4572 | progress = try_to_free_mem_cgroup_pages(memcg, GFP_KERNEL, |
185efc0f | 4573 | false); |
c1e862c1 | 4574 | if (!progress) { |
f817ed48 | 4575 | nr_retries--; |
c1e862c1 | 4576 | /* maybe some writeback is necessary */ |
8aa7e847 | 4577 | congestion_wait(BLK_RW_ASYNC, HZ/10); |
c1e862c1 | 4578 | } |
f817ed48 KH |
4579 | |
4580 | } | |
08e552c6 | 4581 | lru_add_drain(); |
ab5196c2 MH |
4582 | mem_cgroup_reparent_charges(memcg); |
4583 | ||
4584 | return 0; | |
cc847582 KH |
4585 | } |
4586 | ||
6bbda35c | 4587 | static int mem_cgroup_force_empty_write(struct cgroup *cont, unsigned int event) |
c1e862c1 | 4588 | { |
c26251f9 MH |
4589 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
4590 | int ret; | |
4591 | ||
d8423011 MH |
4592 | if (mem_cgroup_is_root(memcg)) |
4593 | return -EINVAL; | |
c26251f9 MH |
4594 | css_get(&memcg->css); |
4595 | ret = mem_cgroup_force_empty(memcg); | |
4596 | css_put(&memcg->css); | |
4597 | ||
4598 | return ret; | |
c1e862c1 KH |
4599 | } |
4600 | ||
4601 | ||
18f59ea7 BS |
4602 | static u64 mem_cgroup_hierarchy_read(struct cgroup *cont, struct cftype *cft) |
4603 | { | |
4604 | return mem_cgroup_from_cont(cont)->use_hierarchy; | |
4605 | } | |
4606 | ||
4607 | static int mem_cgroup_hierarchy_write(struct cgroup *cont, struct cftype *cft, | |
4608 | u64 val) | |
4609 | { | |
4610 | int retval = 0; | |
c0ff4b85 | 4611 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
18f59ea7 | 4612 | struct cgroup *parent = cont->parent; |
c0ff4b85 | 4613 | struct mem_cgroup *parent_memcg = NULL; |
18f59ea7 BS |
4614 | |
4615 | if (parent) | |
c0ff4b85 | 4616 | parent_memcg = mem_cgroup_from_cont(parent); |
18f59ea7 BS |
4617 | |
4618 | cgroup_lock(); | |
567fb435 GC |
4619 | |
4620 | if (memcg->use_hierarchy == val) | |
4621 | goto out; | |
4622 | ||
18f59ea7 | 4623 | /* |
af901ca1 | 4624 | * If parent's use_hierarchy is set, we can't make any modifications |
18f59ea7 BS |
4625 | * in the child subtrees. If it is unset, then the change can |
4626 | * occur, provided the current cgroup has no children. | |
4627 | * | |
4628 | * For the root cgroup, parent_mem is NULL, we allow value to be | |
4629 | * set if there are no children. | |
4630 | */ | |
c0ff4b85 | 4631 | if ((!parent_memcg || !parent_memcg->use_hierarchy) && |
18f59ea7 BS |
4632 | (val == 1 || val == 0)) { |
4633 | if (list_empty(&cont->children)) | |
c0ff4b85 | 4634 | memcg->use_hierarchy = val; |
18f59ea7 BS |
4635 | else |
4636 | retval = -EBUSY; | |
4637 | } else | |
4638 | retval = -EINVAL; | |
567fb435 GC |
4639 | |
4640 | out: | |
18f59ea7 BS |
4641 | cgroup_unlock(); |
4642 | ||
4643 | return retval; | |
4644 | } | |
4645 | ||
0c3e73e8 | 4646 | |
c0ff4b85 | 4647 | static unsigned long mem_cgroup_recursive_stat(struct mem_cgroup *memcg, |
7a159cc9 | 4648 | enum mem_cgroup_stat_index idx) |
0c3e73e8 | 4649 | { |
7d74b06f | 4650 | struct mem_cgroup *iter; |
7a159cc9 | 4651 | long val = 0; |
0c3e73e8 | 4652 | |
7a159cc9 | 4653 | /* Per-cpu values can be negative, use a signed accumulator */ |
c0ff4b85 | 4654 | for_each_mem_cgroup_tree(iter, memcg) |
7d74b06f KH |
4655 | val += mem_cgroup_read_stat(iter, idx); |
4656 | ||
4657 | if (val < 0) /* race ? */ | |
4658 | val = 0; | |
4659 | return val; | |
0c3e73e8 BS |
4660 | } |
4661 | ||
c0ff4b85 | 4662 | static inline u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap) |
104f3928 | 4663 | { |
7d74b06f | 4664 | u64 val; |
104f3928 | 4665 | |
c0ff4b85 | 4666 | if (!mem_cgroup_is_root(memcg)) { |
104f3928 | 4667 | if (!swap) |
65c64ce8 | 4668 | return res_counter_read_u64(&memcg->res, RES_USAGE); |
104f3928 | 4669 | else |
65c64ce8 | 4670 | return res_counter_read_u64(&memcg->memsw, RES_USAGE); |
104f3928 KS |
4671 | } |
4672 | ||
c0ff4b85 R |
4673 | val = mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_CACHE); |
4674 | val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_RSS); | |
104f3928 | 4675 | |
7d74b06f | 4676 | if (swap) |
bff6bb83 | 4677 | val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_SWAP); |
104f3928 KS |
4678 | |
4679 | return val << PAGE_SHIFT; | |
4680 | } | |
4681 | ||
af36f906 TH |
4682 | static ssize_t mem_cgroup_read(struct cgroup *cont, struct cftype *cft, |
4683 | struct file *file, char __user *buf, | |
4684 | size_t nbytes, loff_t *ppos) | |
8cdea7c0 | 4685 | { |
c0ff4b85 | 4686 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
af36f906 | 4687 | char str[64]; |
104f3928 | 4688 | u64 val; |
86ae53e1 GC |
4689 | int name, len; |
4690 | enum res_type type; | |
8c7c6e34 KH |
4691 | |
4692 | type = MEMFILE_TYPE(cft->private); | |
4693 | name = MEMFILE_ATTR(cft->private); | |
af36f906 TH |
4694 | |
4695 | if (!do_swap_account && type == _MEMSWAP) | |
4696 | return -EOPNOTSUPP; | |
4697 | ||
8c7c6e34 KH |
4698 | switch (type) { |
4699 | case _MEM: | |
104f3928 | 4700 | if (name == RES_USAGE) |
c0ff4b85 | 4701 | val = mem_cgroup_usage(memcg, false); |
104f3928 | 4702 | else |
c0ff4b85 | 4703 | val = res_counter_read_u64(&memcg->res, name); |
8c7c6e34 KH |
4704 | break; |
4705 | case _MEMSWAP: | |
104f3928 | 4706 | if (name == RES_USAGE) |
c0ff4b85 | 4707 | val = mem_cgroup_usage(memcg, true); |
104f3928 | 4708 | else |
c0ff4b85 | 4709 | val = res_counter_read_u64(&memcg->memsw, name); |
8c7c6e34 | 4710 | break; |
510fc4e1 GC |
4711 | case _KMEM: |
4712 | val = res_counter_read_u64(&memcg->kmem, name); | |
4713 | break; | |
8c7c6e34 KH |
4714 | default: |
4715 | BUG(); | |
8c7c6e34 | 4716 | } |
af36f906 TH |
4717 | |
4718 | len = scnprintf(str, sizeof(str), "%llu\n", (unsigned long long)val); | |
4719 | return simple_read_from_buffer(buf, nbytes, ppos, str, len); | |
8cdea7c0 | 4720 | } |
510fc4e1 GC |
4721 | |
4722 | static int memcg_update_kmem_limit(struct cgroup *cont, u64 val) | |
4723 | { | |
4724 | int ret = -EINVAL; | |
4725 | #ifdef CONFIG_MEMCG_KMEM | |
a8964b9b GC |
4726 | bool must_inc_static_branch = false; |
4727 | ||
510fc4e1 GC |
4728 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
4729 | /* | |
4730 | * For simplicity, we won't allow this to be disabled. It also can't | |
4731 | * be changed if the cgroup has children already, or if tasks had | |
4732 | * already joined. | |
4733 | * | |
4734 | * If tasks join before we set the limit, a person looking at | |
4735 | * kmem.usage_in_bytes will have no way to determine when it took | |
4736 | * place, which makes the value quite meaningless. | |
4737 | * | |
4738 | * After it first became limited, changes in the value of the limit are | |
4739 | * of course permitted. | |
4740 | * | |
4741 | * Taking the cgroup_lock is really offensive, but it is so far the only | |
4742 | * way to guarantee that no children will appear. There are plenty of | |
4743 | * other offenders, and they should all go away. Fine grained locking | |
4744 | * is probably the way to go here. When we are fully hierarchical, we | |
4745 | * can also get rid of the use_hierarchy check. | |
4746 | */ | |
4747 | cgroup_lock(); | |
4748 | mutex_lock(&set_limit_mutex); | |
4749 | if (!memcg->kmem_account_flags && val != RESOURCE_MAX) { | |
4750 | if (cgroup_task_count(cont) || (memcg->use_hierarchy && | |
4751 | !list_empty(&cont->children))) { | |
4752 | ret = -EBUSY; | |
4753 | goto out; | |
4754 | } | |
4755 | ret = res_counter_set_limit(&memcg->kmem, val); | |
4756 | VM_BUG_ON(ret); | |
4757 | ||
55007d84 GC |
4758 | ret = memcg_update_cache_sizes(memcg); |
4759 | if (ret) { | |
4760 | res_counter_set_limit(&memcg->kmem, RESOURCE_MAX); | |
4761 | goto out; | |
4762 | } | |
a8964b9b | 4763 | must_inc_static_branch = true; |
7de37682 GC |
4764 | /* |
4765 | * kmem charges can outlive the cgroup. In the case of slab | |
4766 | * pages, for instance, a page contain objects from various | |
4767 | * processes, so it is unfeasible to migrate them away. We | |
4768 | * need to reference count the memcg because of that. | |
4769 | */ | |
4770 | mem_cgroup_get(memcg); | |
510fc4e1 GC |
4771 | } else |
4772 | ret = res_counter_set_limit(&memcg->kmem, val); | |
4773 | out: | |
4774 | mutex_unlock(&set_limit_mutex); | |
4775 | cgroup_unlock(); | |
a8964b9b GC |
4776 | |
4777 | /* | |
4778 | * We are by now familiar with the fact that we can't inc the static | |
4779 | * branch inside cgroup_lock. See disarm functions for details. A | |
4780 | * worker here is overkill, but also wrong: After the limit is set, we | |
4781 | * must start accounting right away. Since this operation can't fail, | |
4782 | * we can safely defer it to here - no rollback will be needed. | |
4783 | * | |
4784 | * The boolean used to control this is also safe, because | |
4785 | * KMEM_ACCOUNTED_ACTIVATED guarantees that only one process will be | |
4786 | * able to set it to true; | |
4787 | */ | |
4788 | if (must_inc_static_branch) { | |
4789 | static_key_slow_inc(&memcg_kmem_enabled_key); | |
4790 | /* | |
4791 | * setting the active bit after the inc will guarantee no one | |
4792 | * starts accounting before all call sites are patched | |
4793 | */ | |
4794 | memcg_kmem_set_active(memcg); | |
4795 | } | |
4796 | ||
510fc4e1 GC |
4797 | #endif |
4798 | return ret; | |
4799 | } | |
4800 | ||
55007d84 | 4801 | static int memcg_propagate_kmem(struct mem_cgroup *memcg) |
510fc4e1 | 4802 | { |
55007d84 | 4803 | int ret = 0; |
510fc4e1 GC |
4804 | struct mem_cgroup *parent = parent_mem_cgroup(memcg); |
4805 | if (!parent) | |
55007d84 GC |
4806 | goto out; |
4807 | ||
510fc4e1 | 4808 | memcg->kmem_account_flags = parent->kmem_account_flags; |
7de37682 | 4809 | #ifdef CONFIG_MEMCG_KMEM |
a8964b9b GC |
4810 | /* |
4811 | * When that happen, we need to disable the static branch only on those | |
4812 | * memcgs that enabled it. To achieve this, we would be forced to | |
4813 | * complicate the code by keeping track of which memcgs were the ones | |
4814 | * that actually enabled limits, and which ones got it from its | |
4815 | * parents. | |
4816 | * | |
4817 | * It is a lot simpler just to do static_key_slow_inc() on every child | |
4818 | * that is accounted. | |
4819 | */ | |
55007d84 GC |
4820 | if (!memcg_kmem_is_active(memcg)) |
4821 | goto out; | |
4822 | ||
4823 | /* | |
4824 | * destroy(), called if we fail, will issue static_key_slow_inc() and | |
4825 | * mem_cgroup_put() if kmem is enabled. We have to either call them | |
4826 | * unconditionally, or clear the KMEM_ACTIVE flag. I personally find | |
4827 | * this more consistent, since it always leads to the same destroy path | |
4828 | */ | |
4829 | mem_cgroup_get(memcg); | |
4830 | static_key_slow_inc(&memcg_kmem_enabled_key); | |
4831 | ||
4832 | mutex_lock(&set_limit_mutex); | |
4833 | ret = memcg_update_cache_sizes(memcg); | |
4834 | mutex_unlock(&set_limit_mutex); | |
7de37682 | 4835 | #endif |
55007d84 GC |
4836 | out: |
4837 | return ret; | |
510fc4e1 GC |
4838 | } |
4839 | ||
628f4235 KH |
4840 | /* |
4841 | * The user of this function is... | |
4842 | * RES_LIMIT. | |
4843 | */ | |
856c13aa PM |
4844 | static int mem_cgroup_write(struct cgroup *cont, struct cftype *cft, |
4845 | const char *buffer) | |
8cdea7c0 | 4846 | { |
628f4235 | 4847 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
86ae53e1 GC |
4848 | enum res_type type; |
4849 | int name; | |
628f4235 KH |
4850 | unsigned long long val; |
4851 | int ret; | |
4852 | ||
8c7c6e34 KH |
4853 | type = MEMFILE_TYPE(cft->private); |
4854 | name = MEMFILE_ATTR(cft->private); | |
af36f906 TH |
4855 | |
4856 | if (!do_swap_account && type == _MEMSWAP) | |
4857 | return -EOPNOTSUPP; | |
4858 | ||
8c7c6e34 | 4859 | switch (name) { |
628f4235 | 4860 | case RES_LIMIT: |
4b3bde4c BS |
4861 | if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */ |
4862 | ret = -EINVAL; | |
4863 | break; | |
4864 | } | |
628f4235 KH |
4865 | /* This function does all necessary parse...reuse it */ |
4866 | ret = res_counter_memparse_write_strategy(buffer, &val); | |
8c7c6e34 KH |
4867 | if (ret) |
4868 | break; | |
4869 | if (type == _MEM) | |
628f4235 | 4870 | ret = mem_cgroup_resize_limit(memcg, val); |
510fc4e1 | 4871 | else if (type == _MEMSWAP) |
8c7c6e34 | 4872 | ret = mem_cgroup_resize_memsw_limit(memcg, val); |
510fc4e1 GC |
4873 | else if (type == _KMEM) |
4874 | ret = memcg_update_kmem_limit(cont, val); | |
4875 | else | |
4876 | return -EINVAL; | |
628f4235 | 4877 | break; |
296c81d8 BS |
4878 | case RES_SOFT_LIMIT: |
4879 | ret = res_counter_memparse_write_strategy(buffer, &val); | |
4880 | if (ret) | |
4881 | break; | |
4882 | /* | |
4883 | * For memsw, soft limits are hard to implement in terms | |
4884 | * of semantics, for now, we support soft limits for | |
4885 | * control without swap | |
4886 | */ | |
4887 | if (type == _MEM) | |
4888 | ret = res_counter_set_soft_limit(&memcg->res, val); | |
4889 | else | |
4890 | ret = -EINVAL; | |
4891 | break; | |
628f4235 KH |
4892 | default: |
4893 | ret = -EINVAL; /* should be BUG() ? */ | |
4894 | break; | |
4895 | } | |
4896 | return ret; | |
8cdea7c0 BS |
4897 | } |
4898 | ||
fee7b548 KH |
4899 | static void memcg_get_hierarchical_limit(struct mem_cgroup *memcg, |
4900 | unsigned long long *mem_limit, unsigned long long *memsw_limit) | |
4901 | { | |
4902 | struct cgroup *cgroup; | |
4903 | unsigned long long min_limit, min_memsw_limit, tmp; | |
4904 | ||
4905 | min_limit = res_counter_read_u64(&memcg->res, RES_LIMIT); | |
4906 | min_memsw_limit = res_counter_read_u64(&memcg->memsw, RES_LIMIT); | |
4907 | cgroup = memcg->css.cgroup; | |
4908 | if (!memcg->use_hierarchy) | |
4909 | goto out; | |
4910 | ||
4911 | while (cgroup->parent) { | |
4912 | cgroup = cgroup->parent; | |
4913 | memcg = mem_cgroup_from_cont(cgroup); | |
4914 | if (!memcg->use_hierarchy) | |
4915 | break; | |
4916 | tmp = res_counter_read_u64(&memcg->res, RES_LIMIT); | |
4917 | min_limit = min(min_limit, tmp); | |
4918 | tmp = res_counter_read_u64(&memcg->memsw, RES_LIMIT); | |
4919 | min_memsw_limit = min(min_memsw_limit, tmp); | |
4920 | } | |
4921 | out: | |
4922 | *mem_limit = min_limit; | |
4923 | *memsw_limit = min_memsw_limit; | |
fee7b548 KH |
4924 | } |
4925 | ||
29f2a4da | 4926 | static int mem_cgroup_reset(struct cgroup *cont, unsigned int event) |
c84872e1 | 4927 | { |
af36f906 | 4928 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
86ae53e1 GC |
4929 | int name; |
4930 | enum res_type type; | |
c84872e1 | 4931 | |
8c7c6e34 KH |
4932 | type = MEMFILE_TYPE(event); |
4933 | name = MEMFILE_ATTR(event); | |
af36f906 TH |
4934 | |
4935 | if (!do_swap_account && type == _MEMSWAP) | |
4936 | return -EOPNOTSUPP; | |
4937 | ||
8c7c6e34 | 4938 | switch (name) { |
29f2a4da | 4939 | case RES_MAX_USAGE: |
8c7c6e34 | 4940 | if (type == _MEM) |
c0ff4b85 | 4941 | res_counter_reset_max(&memcg->res); |
510fc4e1 | 4942 | else if (type == _MEMSWAP) |
c0ff4b85 | 4943 | res_counter_reset_max(&memcg->memsw); |
510fc4e1 GC |
4944 | else if (type == _KMEM) |
4945 | res_counter_reset_max(&memcg->kmem); | |
4946 | else | |
4947 | return -EINVAL; | |
29f2a4da PE |
4948 | break; |
4949 | case RES_FAILCNT: | |
8c7c6e34 | 4950 | if (type == _MEM) |
c0ff4b85 | 4951 | res_counter_reset_failcnt(&memcg->res); |
510fc4e1 | 4952 | else if (type == _MEMSWAP) |
c0ff4b85 | 4953 | res_counter_reset_failcnt(&memcg->memsw); |
510fc4e1 GC |
4954 | else if (type == _KMEM) |
4955 | res_counter_reset_failcnt(&memcg->kmem); | |
4956 | else | |
4957 | return -EINVAL; | |
29f2a4da PE |
4958 | break; |
4959 | } | |
f64c3f54 | 4960 | |
85cc59db | 4961 | return 0; |
c84872e1 PE |
4962 | } |
4963 | ||
7dc74be0 DN |
4964 | static u64 mem_cgroup_move_charge_read(struct cgroup *cgrp, |
4965 | struct cftype *cft) | |
4966 | { | |
4967 | return mem_cgroup_from_cont(cgrp)->move_charge_at_immigrate; | |
4968 | } | |
4969 | ||
02491447 | 4970 | #ifdef CONFIG_MMU |
7dc74be0 DN |
4971 | static int mem_cgroup_move_charge_write(struct cgroup *cgrp, |
4972 | struct cftype *cft, u64 val) | |
4973 | { | |
c0ff4b85 | 4974 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
7dc74be0 DN |
4975 | |
4976 | if (val >= (1 << NR_MOVE_TYPE)) | |
4977 | return -EINVAL; | |
4978 | /* | |
4979 | * We check this value several times in both in can_attach() and | |
4980 | * attach(), so we need cgroup lock to prevent this value from being | |
4981 | * inconsistent. | |
4982 | */ | |
4983 | cgroup_lock(); | |
c0ff4b85 | 4984 | memcg->move_charge_at_immigrate = val; |
7dc74be0 DN |
4985 | cgroup_unlock(); |
4986 | ||
4987 | return 0; | |
4988 | } | |
02491447 DN |
4989 | #else |
4990 | static int mem_cgroup_move_charge_write(struct cgroup *cgrp, | |
4991 | struct cftype *cft, u64 val) | |
4992 | { | |
4993 | return -ENOSYS; | |
4994 | } | |
4995 | #endif | |
7dc74be0 | 4996 | |
406eb0c9 | 4997 | #ifdef CONFIG_NUMA |
ab215884 | 4998 | static int memcg_numa_stat_show(struct cgroup *cont, struct cftype *cft, |
fada52ca | 4999 | struct seq_file *m) |
406eb0c9 YH |
5000 | { |
5001 | int nid; | |
5002 | unsigned long total_nr, file_nr, anon_nr, unevictable_nr; | |
5003 | unsigned long node_nr; | |
d79154bb | 5004 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
406eb0c9 | 5005 | |
d79154bb | 5006 | total_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL); |
406eb0c9 | 5007 | seq_printf(m, "total=%lu", total_nr); |
31aaea4a | 5008 | for_each_node_state(nid, N_MEMORY) { |
d79154bb | 5009 | node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL); |
406eb0c9 YH |
5010 | seq_printf(m, " N%d=%lu", nid, node_nr); |
5011 | } | |
5012 | seq_putc(m, '\n'); | |
5013 | ||
d79154bb | 5014 | file_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL_FILE); |
406eb0c9 | 5015 | seq_printf(m, "file=%lu", file_nr); |
31aaea4a | 5016 | for_each_node_state(nid, N_MEMORY) { |
d79154bb | 5017 | node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid, |
bb2a0de9 | 5018 | LRU_ALL_FILE); |
406eb0c9 YH |
5019 | seq_printf(m, " N%d=%lu", nid, node_nr); |
5020 | } | |
5021 | seq_putc(m, '\n'); | |
5022 | ||
d79154bb | 5023 | anon_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL_ANON); |
406eb0c9 | 5024 | seq_printf(m, "anon=%lu", anon_nr); |
31aaea4a | 5025 | for_each_node_state(nid, N_MEMORY) { |
d79154bb | 5026 | node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid, |
bb2a0de9 | 5027 | LRU_ALL_ANON); |
406eb0c9 YH |
5028 | seq_printf(m, " N%d=%lu", nid, node_nr); |
5029 | } | |
5030 | seq_putc(m, '\n'); | |
5031 | ||
d79154bb | 5032 | unevictable_nr = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_UNEVICTABLE)); |
406eb0c9 | 5033 | seq_printf(m, "unevictable=%lu", unevictable_nr); |
31aaea4a | 5034 | for_each_node_state(nid, N_MEMORY) { |
d79154bb | 5035 | node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid, |
bb2a0de9 | 5036 | BIT(LRU_UNEVICTABLE)); |
406eb0c9 YH |
5037 | seq_printf(m, " N%d=%lu", nid, node_nr); |
5038 | } | |
5039 | seq_putc(m, '\n'); | |
5040 | return 0; | |
5041 | } | |
5042 | #endif /* CONFIG_NUMA */ | |
5043 | ||
af7c4b0e JW |
5044 | static const char * const mem_cgroup_lru_names[] = { |
5045 | "inactive_anon", | |
5046 | "active_anon", | |
5047 | "inactive_file", | |
5048 | "active_file", | |
5049 | "unevictable", | |
5050 | }; | |
5051 | ||
5052 | static inline void mem_cgroup_lru_names_not_uptodate(void) | |
5053 | { | |
5054 | BUILD_BUG_ON(ARRAY_SIZE(mem_cgroup_lru_names) != NR_LRU_LISTS); | |
5055 | } | |
5056 | ||
ab215884 | 5057 | static int memcg_stat_show(struct cgroup *cont, struct cftype *cft, |
78ccf5b5 | 5058 | struct seq_file *m) |
d2ceb9b7 | 5059 | { |
d79154bb | 5060 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
af7c4b0e JW |
5061 | struct mem_cgroup *mi; |
5062 | unsigned int i; | |
406eb0c9 | 5063 | |
af7c4b0e | 5064 | for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) { |
bff6bb83 | 5065 | if (i == MEM_CGROUP_STAT_SWAP && !do_swap_account) |
1dd3a273 | 5066 | continue; |
af7c4b0e JW |
5067 | seq_printf(m, "%s %ld\n", mem_cgroup_stat_names[i], |
5068 | mem_cgroup_read_stat(memcg, i) * PAGE_SIZE); | |
1dd3a273 | 5069 | } |
7b854121 | 5070 | |
af7c4b0e JW |
5071 | for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) |
5072 | seq_printf(m, "%s %lu\n", mem_cgroup_events_names[i], | |
5073 | mem_cgroup_read_events(memcg, i)); | |
5074 | ||
5075 | for (i = 0; i < NR_LRU_LISTS; i++) | |
5076 | seq_printf(m, "%s %lu\n", mem_cgroup_lru_names[i], | |
5077 | mem_cgroup_nr_lru_pages(memcg, BIT(i)) * PAGE_SIZE); | |
5078 | ||
14067bb3 | 5079 | /* Hierarchical information */ |
fee7b548 KH |
5080 | { |
5081 | unsigned long long limit, memsw_limit; | |
d79154bb | 5082 | memcg_get_hierarchical_limit(memcg, &limit, &memsw_limit); |
78ccf5b5 | 5083 | seq_printf(m, "hierarchical_memory_limit %llu\n", limit); |
fee7b548 | 5084 | if (do_swap_account) |
78ccf5b5 JW |
5085 | seq_printf(m, "hierarchical_memsw_limit %llu\n", |
5086 | memsw_limit); | |
fee7b548 | 5087 | } |
7f016ee8 | 5088 | |
af7c4b0e JW |
5089 | for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) { |
5090 | long long val = 0; | |
5091 | ||
bff6bb83 | 5092 | if (i == MEM_CGROUP_STAT_SWAP && !do_swap_account) |
1dd3a273 | 5093 | continue; |
af7c4b0e JW |
5094 | for_each_mem_cgroup_tree(mi, memcg) |
5095 | val += mem_cgroup_read_stat(mi, i) * PAGE_SIZE; | |
5096 | seq_printf(m, "total_%s %lld\n", mem_cgroup_stat_names[i], val); | |
5097 | } | |
5098 | ||
5099 | for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) { | |
5100 | unsigned long long val = 0; | |
5101 | ||
5102 | for_each_mem_cgroup_tree(mi, memcg) | |
5103 | val += mem_cgroup_read_events(mi, i); | |
5104 | seq_printf(m, "total_%s %llu\n", | |
5105 | mem_cgroup_events_names[i], val); | |
5106 | } | |
5107 | ||
5108 | for (i = 0; i < NR_LRU_LISTS; i++) { | |
5109 | unsigned long long val = 0; | |
5110 | ||
5111 | for_each_mem_cgroup_tree(mi, memcg) | |
5112 | val += mem_cgroup_nr_lru_pages(mi, BIT(i)) * PAGE_SIZE; | |
5113 | seq_printf(m, "total_%s %llu\n", mem_cgroup_lru_names[i], val); | |
1dd3a273 | 5114 | } |
14067bb3 | 5115 | |
7f016ee8 | 5116 | #ifdef CONFIG_DEBUG_VM |
7f016ee8 KM |
5117 | { |
5118 | int nid, zid; | |
5119 | struct mem_cgroup_per_zone *mz; | |
89abfab1 | 5120 | struct zone_reclaim_stat *rstat; |
7f016ee8 KM |
5121 | unsigned long recent_rotated[2] = {0, 0}; |
5122 | unsigned long recent_scanned[2] = {0, 0}; | |
5123 | ||
5124 | for_each_online_node(nid) | |
5125 | for (zid = 0; zid < MAX_NR_ZONES; zid++) { | |
d79154bb | 5126 | mz = mem_cgroup_zoneinfo(memcg, nid, zid); |
89abfab1 | 5127 | rstat = &mz->lruvec.reclaim_stat; |
7f016ee8 | 5128 | |
89abfab1 HD |
5129 | recent_rotated[0] += rstat->recent_rotated[0]; |
5130 | recent_rotated[1] += rstat->recent_rotated[1]; | |
5131 | recent_scanned[0] += rstat->recent_scanned[0]; | |
5132 | recent_scanned[1] += rstat->recent_scanned[1]; | |
7f016ee8 | 5133 | } |
78ccf5b5 JW |
5134 | seq_printf(m, "recent_rotated_anon %lu\n", recent_rotated[0]); |
5135 | seq_printf(m, "recent_rotated_file %lu\n", recent_rotated[1]); | |
5136 | seq_printf(m, "recent_scanned_anon %lu\n", recent_scanned[0]); | |
5137 | seq_printf(m, "recent_scanned_file %lu\n", recent_scanned[1]); | |
7f016ee8 KM |
5138 | } |
5139 | #endif | |
5140 | ||
d2ceb9b7 KH |
5141 | return 0; |
5142 | } | |
5143 | ||
a7885eb8 KM |
5144 | static u64 mem_cgroup_swappiness_read(struct cgroup *cgrp, struct cftype *cft) |
5145 | { | |
5146 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); | |
5147 | ||
1f4c025b | 5148 | return mem_cgroup_swappiness(memcg); |
a7885eb8 KM |
5149 | } |
5150 | ||
5151 | static int mem_cgroup_swappiness_write(struct cgroup *cgrp, struct cftype *cft, | |
5152 | u64 val) | |
5153 | { | |
5154 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); | |
5155 | struct mem_cgroup *parent; | |
068b38c1 | 5156 | |
a7885eb8 KM |
5157 | if (val > 100) |
5158 | return -EINVAL; | |
5159 | ||
5160 | if (cgrp->parent == NULL) | |
5161 | return -EINVAL; | |
5162 | ||
5163 | parent = mem_cgroup_from_cont(cgrp->parent); | |
068b38c1 LZ |
5164 | |
5165 | cgroup_lock(); | |
5166 | ||
a7885eb8 KM |
5167 | /* If under hierarchy, only empty-root can set this value */ |
5168 | if ((parent->use_hierarchy) || | |
068b38c1 LZ |
5169 | (memcg->use_hierarchy && !list_empty(&cgrp->children))) { |
5170 | cgroup_unlock(); | |
a7885eb8 | 5171 | return -EINVAL; |
068b38c1 | 5172 | } |
a7885eb8 | 5173 | |
a7885eb8 | 5174 | memcg->swappiness = val; |
a7885eb8 | 5175 | |
068b38c1 LZ |
5176 | cgroup_unlock(); |
5177 | ||
a7885eb8 KM |
5178 | return 0; |
5179 | } | |
5180 | ||
2e72b634 KS |
5181 | static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap) |
5182 | { | |
5183 | struct mem_cgroup_threshold_ary *t; | |
5184 | u64 usage; | |
5185 | int i; | |
5186 | ||
5187 | rcu_read_lock(); | |
5188 | if (!swap) | |
2c488db2 | 5189 | t = rcu_dereference(memcg->thresholds.primary); |
2e72b634 | 5190 | else |
2c488db2 | 5191 | t = rcu_dereference(memcg->memsw_thresholds.primary); |
2e72b634 KS |
5192 | |
5193 | if (!t) | |
5194 | goto unlock; | |
5195 | ||
5196 | usage = mem_cgroup_usage(memcg, swap); | |
5197 | ||
5198 | /* | |
748dad36 | 5199 | * current_threshold points to threshold just below or equal to usage. |
2e72b634 KS |
5200 | * If it's not true, a threshold was crossed after last |
5201 | * call of __mem_cgroup_threshold(). | |
5202 | */ | |
5407a562 | 5203 | i = t->current_threshold; |
2e72b634 KS |
5204 | |
5205 | /* | |
5206 | * Iterate backward over array of thresholds starting from | |
5207 | * current_threshold and check if a threshold is crossed. | |
5208 | * If none of thresholds below usage is crossed, we read | |
5209 | * only one element of the array here. | |
5210 | */ | |
5211 | for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--) | |
5212 | eventfd_signal(t->entries[i].eventfd, 1); | |
5213 | ||
5214 | /* i = current_threshold + 1 */ | |
5215 | i++; | |
5216 | ||
5217 | /* | |
5218 | * Iterate forward over array of thresholds starting from | |
5219 | * current_threshold+1 and check if a threshold is crossed. | |
5220 | * If none of thresholds above usage is crossed, we read | |
5221 | * only one element of the array here. | |
5222 | */ | |
5223 | for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++) | |
5224 | eventfd_signal(t->entries[i].eventfd, 1); | |
5225 | ||
5226 | /* Update current_threshold */ | |
5407a562 | 5227 | t->current_threshold = i - 1; |
2e72b634 KS |
5228 | unlock: |
5229 | rcu_read_unlock(); | |
5230 | } | |
5231 | ||
5232 | static void mem_cgroup_threshold(struct mem_cgroup *memcg) | |
5233 | { | |
ad4ca5f4 KS |
5234 | while (memcg) { |
5235 | __mem_cgroup_threshold(memcg, false); | |
5236 | if (do_swap_account) | |
5237 | __mem_cgroup_threshold(memcg, true); | |
5238 | ||
5239 | memcg = parent_mem_cgroup(memcg); | |
5240 | } | |
2e72b634 KS |
5241 | } |
5242 | ||
5243 | static int compare_thresholds(const void *a, const void *b) | |
5244 | { | |
5245 | const struct mem_cgroup_threshold *_a = a; | |
5246 | const struct mem_cgroup_threshold *_b = b; | |
5247 | ||
5248 | return _a->threshold - _b->threshold; | |
5249 | } | |
5250 | ||
c0ff4b85 | 5251 | static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg) |
9490ff27 KH |
5252 | { |
5253 | struct mem_cgroup_eventfd_list *ev; | |
5254 | ||
c0ff4b85 | 5255 | list_for_each_entry(ev, &memcg->oom_notify, list) |
9490ff27 KH |
5256 | eventfd_signal(ev->eventfd, 1); |
5257 | return 0; | |
5258 | } | |
5259 | ||
c0ff4b85 | 5260 | static void mem_cgroup_oom_notify(struct mem_cgroup *memcg) |
9490ff27 | 5261 | { |
7d74b06f KH |
5262 | struct mem_cgroup *iter; |
5263 | ||
c0ff4b85 | 5264 | for_each_mem_cgroup_tree(iter, memcg) |
7d74b06f | 5265 | mem_cgroup_oom_notify_cb(iter); |
9490ff27 KH |
5266 | } |
5267 | ||
5268 | static int mem_cgroup_usage_register_event(struct cgroup *cgrp, | |
5269 | struct cftype *cft, struct eventfd_ctx *eventfd, const char *args) | |
2e72b634 KS |
5270 | { |
5271 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); | |
2c488db2 KS |
5272 | struct mem_cgroup_thresholds *thresholds; |
5273 | struct mem_cgroup_threshold_ary *new; | |
86ae53e1 | 5274 | enum res_type type = MEMFILE_TYPE(cft->private); |
2e72b634 | 5275 | u64 threshold, usage; |
2c488db2 | 5276 | int i, size, ret; |
2e72b634 KS |
5277 | |
5278 | ret = res_counter_memparse_write_strategy(args, &threshold); | |
5279 | if (ret) | |
5280 | return ret; | |
5281 | ||
5282 | mutex_lock(&memcg->thresholds_lock); | |
2c488db2 | 5283 | |
2e72b634 | 5284 | if (type == _MEM) |
2c488db2 | 5285 | thresholds = &memcg->thresholds; |
2e72b634 | 5286 | else if (type == _MEMSWAP) |
2c488db2 | 5287 | thresholds = &memcg->memsw_thresholds; |
2e72b634 KS |
5288 | else |
5289 | BUG(); | |
5290 | ||
5291 | usage = mem_cgroup_usage(memcg, type == _MEMSWAP); | |
5292 | ||
5293 | /* Check if a threshold crossed before adding a new one */ | |
2c488db2 | 5294 | if (thresholds->primary) |
2e72b634 KS |
5295 | __mem_cgroup_threshold(memcg, type == _MEMSWAP); |
5296 | ||
2c488db2 | 5297 | size = thresholds->primary ? thresholds->primary->size + 1 : 1; |
2e72b634 KS |
5298 | |
5299 | /* Allocate memory for new array of thresholds */ | |
2c488db2 | 5300 | new = kmalloc(sizeof(*new) + size * sizeof(struct mem_cgroup_threshold), |
2e72b634 | 5301 | GFP_KERNEL); |
2c488db2 | 5302 | if (!new) { |
2e72b634 KS |
5303 | ret = -ENOMEM; |
5304 | goto unlock; | |
5305 | } | |
2c488db2 | 5306 | new->size = size; |
2e72b634 KS |
5307 | |
5308 | /* Copy thresholds (if any) to new array */ | |
2c488db2 KS |
5309 | if (thresholds->primary) { |
5310 | memcpy(new->entries, thresholds->primary->entries, (size - 1) * | |
2e72b634 | 5311 | sizeof(struct mem_cgroup_threshold)); |
2c488db2 KS |
5312 | } |
5313 | ||
2e72b634 | 5314 | /* Add new threshold */ |
2c488db2 KS |
5315 | new->entries[size - 1].eventfd = eventfd; |
5316 | new->entries[size - 1].threshold = threshold; | |
2e72b634 KS |
5317 | |
5318 | /* Sort thresholds. Registering of new threshold isn't time-critical */ | |
2c488db2 | 5319 | sort(new->entries, size, sizeof(struct mem_cgroup_threshold), |
2e72b634 KS |
5320 | compare_thresholds, NULL); |
5321 | ||
5322 | /* Find current threshold */ | |
2c488db2 | 5323 | new->current_threshold = -1; |
2e72b634 | 5324 | for (i = 0; i < size; i++) { |
748dad36 | 5325 | if (new->entries[i].threshold <= usage) { |
2e72b634 | 5326 | /* |
2c488db2 KS |
5327 | * new->current_threshold will not be used until |
5328 | * rcu_assign_pointer(), so it's safe to increment | |
2e72b634 KS |
5329 | * it here. |
5330 | */ | |
2c488db2 | 5331 | ++new->current_threshold; |
748dad36 SZ |
5332 | } else |
5333 | break; | |
2e72b634 KS |
5334 | } |
5335 | ||
2c488db2 KS |
5336 | /* Free old spare buffer and save old primary buffer as spare */ |
5337 | kfree(thresholds->spare); | |
5338 | thresholds->spare = thresholds->primary; | |
5339 | ||
5340 | rcu_assign_pointer(thresholds->primary, new); | |
2e72b634 | 5341 | |
907860ed | 5342 | /* To be sure that nobody uses thresholds */ |
2e72b634 KS |
5343 | synchronize_rcu(); |
5344 | ||
2e72b634 KS |
5345 | unlock: |
5346 | mutex_unlock(&memcg->thresholds_lock); | |
5347 | ||
5348 | return ret; | |
5349 | } | |
5350 | ||
907860ed | 5351 | static void mem_cgroup_usage_unregister_event(struct cgroup *cgrp, |
9490ff27 | 5352 | struct cftype *cft, struct eventfd_ctx *eventfd) |
2e72b634 KS |
5353 | { |
5354 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); | |
2c488db2 KS |
5355 | struct mem_cgroup_thresholds *thresholds; |
5356 | struct mem_cgroup_threshold_ary *new; | |
86ae53e1 | 5357 | enum res_type type = MEMFILE_TYPE(cft->private); |
2e72b634 | 5358 | u64 usage; |
2c488db2 | 5359 | int i, j, size; |
2e72b634 KS |
5360 | |
5361 | mutex_lock(&memcg->thresholds_lock); | |
5362 | if (type == _MEM) | |
2c488db2 | 5363 | thresholds = &memcg->thresholds; |
2e72b634 | 5364 | else if (type == _MEMSWAP) |
2c488db2 | 5365 | thresholds = &memcg->memsw_thresholds; |
2e72b634 KS |
5366 | else |
5367 | BUG(); | |
5368 | ||
371528ca AV |
5369 | if (!thresholds->primary) |
5370 | goto unlock; | |
5371 | ||
2e72b634 KS |
5372 | usage = mem_cgroup_usage(memcg, type == _MEMSWAP); |
5373 | ||
5374 | /* Check if a threshold crossed before removing */ | |
5375 | __mem_cgroup_threshold(memcg, type == _MEMSWAP); | |
5376 | ||
5377 | /* Calculate new number of threshold */ | |
2c488db2 KS |
5378 | size = 0; |
5379 | for (i = 0; i < thresholds->primary->size; i++) { | |
5380 | if (thresholds->primary->entries[i].eventfd != eventfd) | |
2e72b634 KS |
5381 | size++; |
5382 | } | |
5383 | ||
2c488db2 | 5384 | new = thresholds->spare; |
907860ed | 5385 | |
2e72b634 KS |
5386 | /* Set thresholds array to NULL if we don't have thresholds */ |
5387 | if (!size) { | |
2c488db2 KS |
5388 | kfree(new); |
5389 | new = NULL; | |
907860ed | 5390 | goto swap_buffers; |
2e72b634 KS |
5391 | } |
5392 | ||
2c488db2 | 5393 | new->size = size; |
2e72b634 KS |
5394 | |
5395 | /* Copy thresholds and find current threshold */ | |
2c488db2 KS |
5396 | new->current_threshold = -1; |
5397 | for (i = 0, j = 0; i < thresholds->primary->size; i++) { | |
5398 | if (thresholds->primary->entries[i].eventfd == eventfd) | |
2e72b634 KS |
5399 | continue; |
5400 | ||
2c488db2 | 5401 | new->entries[j] = thresholds->primary->entries[i]; |
748dad36 | 5402 | if (new->entries[j].threshold <= usage) { |
2e72b634 | 5403 | /* |
2c488db2 | 5404 | * new->current_threshold will not be used |
2e72b634 KS |
5405 | * until rcu_assign_pointer(), so it's safe to increment |
5406 | * it here. | |
5407 | */ | |
2c488db2 | 5408 | ++new->current_threshold; |
2e72b634 KS |
5409 | } |
5410 | j++; | |
5411 | } | |
5412 | ||
907860ed | 5413 | swap_buffers: |
2c488db2 KS |
5414 | /* Swap primary and spare array */ |
5415 | thresholds->spare = thresholds->primary; | |
8c757763 SZ |
5416 | /* If all events are unregistered, free the spare array */ |
5417 | if (!new) { | |
5418 | kfree(thresholds->spare); | |
5419 | thresholds->spare = NULL; | |
5420 | } | |
5421 | ||
2c488db2 | 5422 | rcu_assign_pointer(thresholds->primary, new); |
2e72b634 | 5423 | |
907860ed | 5424 | /* To be sure that nobody uses thresholds */ |
2e72b634 | 5425 | synchronize_rcu(); |
371528ca | 5426 | unlock: |
2e72b634 | 5427 | mutex_unlock(&memcg->thresholds_lock); |
2e72b634 | 5428 | } |
c1e862c1 | 5429 | |
9490ff27 KH |
5430 | static int mem_cgroup_oom_register_event(struct cgroup *cgrp, |
5431 | struct cftype *cft, struct eventfd_ctx *eventfd, const char *args) | |
5432 | { | |
5433 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); | |
5434 | struct mem_cgroup_eventfd_list *event; | |
86ae53e1 | 5435 | enum res_type type = MEMFILE_TYPE(cft->private); |
9490ff27 KH |
5436 | |
5437 | BUG_ON(type != _OOM_TYPE); | |
5438 | event = kmalloc(sizeof(*event), GFP_KERNEL); | |
5439 | if (!event) | |
5440 | return -ENOMEM; | |
5441 | ||
1af8efe9 | 5442 | spin_lock(&memcg_oom_lock); |
9490ff27 KH |
5443 | |
5444 | event->eventfd = eventfd; | |
5445 | list_add(&event->list, &memcg->oom_notify); | |
5446 | ||
5447 | /* already in OOM ? */ | |
79dfdacc | 5448 | if (atomic_read(&memcg->under_oom)) |
9490ff27 | 5449 | eventfd_signal(eventfd, 1); |
1af8efe9 | 5450 | spin_unlock(&memcg_oom_lock); |
9490ff27 KH |
5451 | |
5452 | return 0; | |
5453 | } | |
5454 | ||
907860ed | 5455 | static void mem_cgroup_oom_unregister_event(struct cgroup *cgrp, |
9490ff27 KH |
5456 | struct cftype *cft, struct eventfd_ctx *eventfd) |
5457 | { | |
c0ff4b85 | 5458 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
9490ff27 | 5459 | struct mem_cgroup_eventfd_list *ev, *tmp; |
86ae53e1 | 5460 | enum res_type type = MEMFILE_TYPE(cft->private); |
9490ff27 KH |
5461 | |
5462 | BUG_ON(type != _OOM_TYPE); | |
5463 | ||
1af8efe9 | 5464 | spin_lock(&memcg_oom_lock); |
9490ff27 | 5465 | |
c0ff4b85 | 5466 | list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) { |
9490ff27 KH |
5467 | if (ev->eventfd == eventfd) { |
5468 | list_del(&ev->list); | |
5469 | kfree(ev); | |
5470 | } | |
5471 | } | |
5472 | ||
1af8efe9 | 5473 | spin_unlock(&memcg_oom_lock); |
9490ff27 KH |
5474 | } |
5475 | ||
3c11ecf4 KH |
5476 | static int mem_cgroup_oom_control_read(struct cgroup *cgrp, |
5477 | struct cftype *cft, struct cgroup_map_cb *cb) | |
5478 | { | |
c0ff4b85 | 5479 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
3c11ecf4 | 5480 | |
c0ff4b85 | 5481 | cb->fill(cb, "oom_kill_disable", memcg->oom_kill_disable); |
3c11ecf4 | 5482 | |
c0ff4b85 | 5483 | if (atomic_read(&memcg->under_oom)) |
3c11ecf4 KH |
5484 | cb->fill(cb, "under_oom", 1); |
5485 | else | |
5486 | cb->fill(cb, "under_oom", 0); | |
5487 | return 0; | |
5488 | } | |
5489 | ||
3c11ecf4 KH |
5490 | static int mem_cgroup_oom_control_write(struct cgroup *cgrp, |
5491 | struct cftype *cft, u64 val) | |
5492 | { | |
c0ff4b85 | 5493 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp); |
3c11ecf4 KH |
5494 | struct mem_cgroup *parent; |
5495 | ||
5496 | /* cannot set to root cgroup and only 0 and 1 are allowed */ | |
5497 | if (!cgrp->parent || !((val == 0) || (val == 1))) | |
5498 | return -EINVAL; | |
5499 | ||
5500 | parent = mem_cgroup_from_cont(cgrp->parent); | |
5501 | ||
5502 | cgroup_lock(); | |
5503 | /* oom-kill-disable is a flag for subhierarchy. */ | |
5504 | if ((parent->use_hierarchy) || | |
c0ff4b85 | 5505 | (memcg->use_hierarchy && !list_empty(&cgrp->children))) { |
3c11ecf4 KH |
5506 | cgroup_unlock(); |
5507 | return -EINVAL; | |
5508 | } | |
c0ff4b85 | 5509 | memcg->oom_kill_disable = val; |
4d845ebf | 5510 | if (!val) |
c0ff4b85 | 5511 | memcg_oom_recover(memcg); |
3c11ecf4 KH |
5512 | cgroup_unlock(); |
5513 | return 0; | |
5514 | } | |
5515 | ||
c255a458 | 5516 | #ifdef CONFIG_MEMCG_KMEM |
cbe128e3 | 5517 | static int memcg_init_kmem(struct mem_cgroup *memcg, struct cgroup_subsys *ss) |
e5671dfa | 5518 | { |
55007d84 GC |
5519 | int ret; |
5520 | ||
2633d7a0 | 5521 | memcg->kmemcg_id = -1; |
55007d84 GC |
5522 | ret = memcg_propagate_kmem(memcg); |
5523 | if (ret) | |
5524 | return ret; | |
2633d7a0 | 5525 | |
1d62e436 | 5526 | return mem_cgroup_sockets_init(memcg, ss); |
e5671dfa GC |
5527 | }; |
5528 | ||
1d62e436 | 5529 | static void kmem_cgroup_destroy(struct mem_cgroup *memcg) |
d1a4c0b3 | 5530 | { |
1d62e436 | 5531 | mem_cgroup_sockets_destroy(memcg); |
7de37682 GC |
5532 | |
5533 | memcg_kmem_mark_dead(memcg); | |
5534 | ||
5535 | if (res_counter_read_u64(&memcg->kmem, RES_USAGE) != 0) | |
5536 | return; | |
5537 | ||
5538 | /* | |
5539 | * Charges already down to 0, undo mem_cgroup_get() done in the charge | |
5540 | * path here, being careful not to race with memcg_uncharge_kmem: it is | |
5541 | * possible that the charges went down to 0 between mark_dead and the | |
5542 | * res_counter read, so in that case, we don't need the put | |
5543 | */ | |
5544 | if (memcg_kmem_test_and_clear_dead(memcg)) | |
5545 | mem_cgroup_put(memcg); | |
d1a4c0b3 | 5546 | } |
e5671dfa | 5547 | #else |
cbe128e3 | 5548 | static int memcg_init_kmem(struct mem_cgroup *memcg, struct cgroup_subsys *ss) |
e5671dfa GC |
5549 | { |
5550 | return 0; | |
5551 | } | |
d1a4c0b3 | 5552 | |
1d62e436 | 5553 | static void kmem_cgroup_destroy(struct mem_cgroup *memcg) |
d1a4c0b3 GC |
5554 | { |
5555 | } | |
e5671dfa GC |
5556 | #endif |
5557 | ||
8cdea7c0 BS |
5558 | static struct cftype mem_cgroup_files[] = { |
5559 | { | |
0eea1030 | 5560 | .name = "usage_in_bytes", |
8c7c6e34 | 5561 | .private = MEMFILE_PRIVATE(_MEM, RES_USAGE), |
af36f906 | 5562 | .read = mem_cgroup_read, |
9490ff27 KH |
5563 | .register_event = mem_cgroup_usage_register_event, |
5564 | .unregister_event = mem_cgroup_usage_unregister_event, | |
8cdea7c0 | 5565 | }, |
c84872e1 PE |
5566 | { |
5567 | .name = "max_usage_in_bytes", | |
8c7c6e34 | 5568 | .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE), |
29f2a4da | 5569 | .trigger = mem_cgroup_reset, |
af36f906 | 5570 | .read = mem_cgroup_read, |
c84872e1 | 5571 | }, |
8cdea7c0 | 5572 | { |
0eea1030 | 5573 | .name = "limit_in_bytes", |
8c7c6e34 | 5574 | .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT), |
856c13aa | 5575 | .write_string = mem_cgroup_write, |
af36f906 | 5576 | .read = mem_cgroup_read, |
8cdea7c0 | 5577 | }, |
296c81d8 BS |
5578 | { |
5579 | .name = "soft_limit_in_bytes", | |
5580 | .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT), | |
5581 | .write_string = mem_cgroup_write, | |
af36f906 | 5582 | .read = mem_cgroup_read, |
296c81d8 | 5583 | }, |
8cdea7c0 BS |
5584 | { |
5585 | .name = "failcnt", | |
8c7c6e34 | 5586 | .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT), |
29f2a4da | 5587 | .trigger = mem_cgroup_reset, |
af36f906 | 5588 | .read = mem_cgroup_read, |
8cdea7c0 | 5589 | }, |
d2ceb9b7 KH |
5590 | { |
5591 | .name = "stat", | |
ab215884 | 5592 | .read_seq_string = memcg_stat_show, |
d2ceb9b7 | 5593 | }, |
c1e862c1 KH |
5594 | { |
5595 | .name = "force_empty", | |
5596 | .trigger = mem_cgroup_force_empty_write, | |
5597 | }, | |
18f59ea7 BS |
5598 | { |
5599 | .name = "use_hierarchy", | |
5600 | .write_u64 = mem_cgroup_hierarchy_write, | |
5601 | .read_u64 = mem_cgroup_hierarchy_read, | |
5602 | }, | |
a7885eb8 KM |
5603 | { |
5604 | .name = "swappiness", | |
5605 | .read_u64 = mem_cgroup_swappiness_read, | |
5606 | .write_u64 = mem_cgroup_swappiness_write, | |
5607 | }, | |
7dc74be0 DN |
5608 | { |
5609 | .name = "move_charge_at_immigrate", | |
5610 | .read_u64 = mem_cgroup_move_charge_read, | |
5611 | .write_u64 = mem_cgroup_move_charge_write, | |
5612 | }, | |
9490ff27 KH |
5613 | { |
5614 | .name = "oom_control", | |
3c11ecf4 KH |
5615 | .read_map = mem_cgroup_oom_control_read, |
5616 | .write_u64 = mem_cgroup_oom_control_write, | |
9490ff27 KH |
5617 | .register_event = mem_cgroup_oom_register_event, |
5618 | .unregister_event = mem_cgroup_oom_unregister_event, | |
5619 | .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL), | |
5620 | }, | |
406eb0c9 YH |
5621 | #ifdef CONFIG_NUMA |
5622 | { | |
5623 | .name = "numa_stat", | |
ab215884 | 5624 | .read_seq_string = memcg_numa_stat_show, |
406eb0c9 YH |
5625 | }, |
5626 | #endif | |
c255a458 | 5627 | #ifdef CONFIG_MEMCG_SWAP |
8c7c6e34 KH |
5628 | { |
5629 | .name = "memsw.usage_in_bytes", | |
5630 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE), | |
af36f906 | 5631 | .read = mem_cgroup_read, |
9490ff27 KH |
5632 | .register_event = mem_cgroup_usage_register_event, |
5633 | .unregister_event = mem_cgroup_usage_unregister_event, | |
8c7c6e34 KH |
5634 | }, |
5635 | { | |
5636 | .name = "memsw.max_usage_in_bytes", | |
5637 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE), | |
5638 | .trigger = mem_cgroup_reset, | |
af36f906 | 5639 | .read = mem_cgroup_read, |
8c7c6e34 KH |
5640 | }, |
5641 | { | |
5642 | .name = "memsw.limit_in_bytes", | |
5643 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT), | |
5644 | .write_string = mem_cgroup_write, | |
af36f906 | 5645 | .read = mem_cgroup_read, |
8c7c6e34 KH |
5646 | }, |
5647 | { | |
5648 | .name = "memsw.failcnt", | |
5649 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT), | |
5650 | .trigger = mem_cgroup_reset, | |
af36f906 | 5651 | .read = mem_cgroup_read, |
8c7c6e34 | 5652 | }, |
510fc4e1 GC |
5653 | #endif |
5654 | #ifdef CONFIG_MEMCG_KMEM | |
5655 | { | |
5656 | .name = "kmem.limit_in_bytes", | |
5657 | .private = MEMFILE_PRIVATE(_KMEM, RES_LIMIT), | |
5658 | .write_string = mem_cgroup_write, | |
5659 | .read = mem_cgroup_read, | |
5660 | }, | |
5661 | { | |
5662 | .name = "kmem.usage_in_bytes", | |
5663 | .private = MEMFILE_PRIVATE(_KMEM, RES_USAGE), | |
5664 | .read = mem_cgroup_read, | |
5665 | }, | |
5666 | { | |
5667 | .name = "kmem.failcnt", | |
5668 | .private = MEMFILE_PRIVATE(_KMEM, RES_FAILCNT), | |
5669 | .trigger = mem_cgroup_reset, | |
5670 | .read = mem_cgroup_read, | |
5671 | }, | |
5672 | { | |
5673 | .name = "kmem.max_usage_in_bytes", | |
5674 | .private = MEMFILE_PRIVATE(_KMEM, RES_MAX_USAGE), | |
5675 | .trigger = mem_cgroup_reset, | |
5676 | .read = mem_cgroup_read, | |
5677 | }, | |
8c7c6e34 | 5678 | #endif |
6bc10349 | 5679 | { }, /* terminate */ |
af36f906 | 5680 | }; |
8c7c6e34 | 5681 | |
c0ff4b85 | 5682 | static int alloc_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node) |
6d12e2d8 KH |
5683 | { |
5684 | struct mem_cgroup_per_node *pn; | |
1ecaab2b | 5685 | struct mem_cgroup_per_zone *mz; |
41e3355d | 5686 | int zone, tmp = node; |
1ecaab2b KH |
5687 | /* |
5688 | * This routine is called against possible nodes. | |
5689 | * But it's BUG to call kmalloc() against offline node. | |
5690 | * | |
5691 | * TODO: this routine can waste much memory for nodes which will | |
5692 | * never be onlined. It's better to use memory hotplug callback | |
5693 | * function. | |
5694 | */ | |
41e3355d KH |
5695 | if (!node_state(node, N_NORMAL_MEMORY)) |
5696 | tmp = -1; | |
17295c88 | 5697 | pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp); |
6d12e2d8 KH |
5698 | if (!pn) |
5699 | return 1; | |
1ecaab2b | 5700 | |
1ecaab2b KH |
5701 | for (zone = 0; zone < MAX_NR_ZONES; zone++) { |
5702 | mz = &pn->zoneinfo[zone]; | |
bea8c150 | 5703 | lruvec_init(&mz->lruvec); |
f64c3f54 | 5704 | mz->usage_in_excess = 0; |
4e416953 | 5705 | mz->on_tree = false; |
d79154bb | 5706 | mz->memcg = memcg; |
1ecaab2b | 5707 | } |
0a619e58 | 5708 | memcg->info.nodeinfo[node] = pn; |
6d12e2d8 KH |
5709 | return 0; |
5710 | } | |
5711 | ||
c0ff4b85 | 5712 | static void free_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node) |
1ecaab2b | 5713 | { |
c0ff4b85 | 5714 | kfree(memcg->info.nodeinfo[node]); |
1ecaab2b KH |
5715 | } |
5716 | ||
33327948 KH |
5717 | static struct mem_cgroup *mem_cgroup_alloc(void) |
5718 | { | |
d79154bb | 5719 | struct mem_cgroup *memcg; |
c62b1a3b | 5720 | int size = sizeof(struct mem_cgroup); |
33327948 | 5721 | |
c62b1a3b | 5722 | /* Can be very big if MAX_NUMNODES is very big */ |
c8dad2bb | 5723 | if (size < PAGE_SIZE) |
d79154bb | 5724 | memcg = kzalloc(size, GFP_KERNEL); |
33327948 | 5725 | else |
d79154bb | 5726 | memcg = vzalloc(size); |
33327948 | 5727 | |
d79154bb | 5728 | if (!memcg) |
e7bbcdf3 DC |
5729 | return NULL; |
5730 | ||
d79154bb HD |
5731 | memcg->stat = alloc_percpu(struct mem_cgroup_stat_cpu); |
5732 | if (!memcg->stat) | |
d2e61b8d | 5733 | goto out_free; |
d79154bb HD |
5734 | spin_lock_init(&memcg->pcp_counter_lock); |
5735 | return memcg; | |
d2e61b8d DC |
5736 | |
5737 | out_free: | |
5738 | if (size < PAGE_SIZE) | |
d79154bb | 5739 | kfree(memcg); |
d2e61b8d | 5740 | else |
d79154bb | 5741 | vfree(memcg); |
d2e61b8d | 5742 | return NULL; |
33327948 KH |
5743 | } |
5744 | ||
59927fb9 | 5745 | /* |
c8b2a36f GC |
5746 | * At destroying mem_cgroup, references from swap_cgroup can remain. |
5747 | * (scanning all at force_empty is too costly...) | |
5748 | * | |
5749 | * Instead of clearing all references at force_empty, we remember | |
5750 | * the number of reference from swap_cgroup and free mem_cgroup when | |
5751 | * it goes down to 0. | |
5752 | * | |
5753 | * Removal of cgroup itself succeeds regardless of refs from swap. | |
59927fb9 | 5754 | */ |
c8b2a36f GC |
5755 | |
5756 | static void __mem_cgroup_free(struct mem_cgroup *memcg) | |
59927fb9 | 5757 | { |
c8b2a36f | 5758 | int node; |
3afe36b1 | 5759 | int size = sizeof(struct mem_cgroup); |
59927fb9 | 5760 | |
c8b2a36f GC |
5761 | mem_cgroup_remove_from_trees(memcg); |
5762 | free_css_id(&mem_cgroup_subsys, &memcg->css); | |
5763 | ||
5764 | for_each_node(node) | |
5765 | free_mem_cgroup_per_zone_info(memcg, node); | |
5766 | ||
5767 | free_percpu(memcg->stat); | |
5768 | ||
3f134619 GC |
5769 | /* |
5770 | * We need to make sure that (at least for now), the jump label | |
5771 | * destruction code runs outside of the cgroup lock. This is because | |
5772 | * get_online_cpus(), which is called from the static_branch update, | |
5773 | * can't be called inside the cgroup_lock. cpusets are the ones | |
5774 | * enforcing this dependency, so if they ever change, we might as well. | |
5775 | * | |
5776 | * schedule_work() will guarantee this happens. Be careful if you need | |
5777 | * to move this code around, and make sure it is outside | |
5778 | * the cgroup_lock. | |
5779 | */ | |
a8964b9b | 5780 | disarm_static_keys(memcg); |
3afe36b1 GC |
5781 | if (size < PAGE_SIZE) |
5782 | kfree(memcg); | |
5783 | else | |
5784 | vfree(memcg); | |
59927fb9 | 5785 | } |
3afe36b1 | 5786 | |
59927fb9 | 5787 | |
8c7c6e34 | 5788 | /* |
c8b2a36f GC |
5789 | * Helpers for freeing a kmalloc()ed/vzalloc()ed mem_cgroup by RCU, |
5790 | * but in process context. The work_freeing structure is overlaid | |
5791 | * on the rcu_freeing structure, which itself is overlaid on memsw. | |
8c7c6e34 | 5792 | */ |
c8b2a36f | 5793 | static void free_work(struct work_struct *work) |
33327948 | 5794 | { |
c8b2a36f | 5795 | struct mem_cgroup *memcg; |
08e552c6 | 5796 | |
c8b2a36f GC |
5797 | memcg = container_of(work, struct mem_cgroup, work_freeing); |
5798 | __mem_cgroup_free(memcg); | |
5799 | } | |
04046e1a | 5800 | |
c8b2a36f GC |
5801 | static void free_rcu(struct rcu_head *rcu_head) |
5802 | { | |
5803 | struct mem_cgroup *memcg; | |
08e552c6 | 5804 | |
c8b2a36f GC |
5805 | memcg = container_of(rcu_head, struct mem_cgroup, rcu_freeing); |
5806 | INIT_WORK(&memcg->work_freeing, free_work); | |
5807 | schedule_work(&memcg->work_freeing); | |
33327948 KH |
5808 | } |
5809 | ||
c0ff4b85 | 5810 | static void mem_cgroup_get(struct mem_cgroup *memcg) |
8c7c6e34 | 5811 | { |
c0ff4b85 | 5812 | atomic_inc(&memcg->refcnt); |
8c7c6e34 KH |
5813 | } |
5814 | ||
c0ff4b85 | 5815 | static void __mem_cgroup_put(struct mem_cgroup *memcg, int count) |
8c7c6e34 | 5816 | { |
c0ff4b85 R |
5817 | if (atomic_sub_and_test(count, &memcg->refcnt)) { |
5818 | struct mem_cgroup *parent = parent_mem_cgroup(memcg); | |
c8b2a36f | 5819 | call_rcu(&memcg->rcu_freeing, free_rcu); |
7bcc1bb1 DN |
5820 | if (parent) |
5821 | mem_cgroup_put(parent); | |
5822 | } | |
8c7c6e34 KH |
5823 | } |
5824 | ||
c0ff4b85 | 5825 | static void mem_cgroup_put(struct mem_cgroup *memcg) |
483c30b5 | 5826 | { |
c0ff4b85 | 5827 | __mem_cgroup_put(memcg, 1); |
483c30b5 DN |
5828 | } |
5829 | ||
7bcc1bb1 DN |
5830 | /* |
5831 | * Returns the parent mem_cgroup in memcgroup hierarchy with hierarchy enabled. | |
5832 | */ | |
e1aab161 | 5833 | struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *memcg) |
7bcc1bb1 | 5834 | { |
c0ff4b85 | 5835 | if (!memcg->res.parent) |
7bcc1bb1 | 5836 | return NULL; |
c0ff4b85 | 5837 | return mem_cgroup_from_res_counter(memcg->res.parent, res); |
7bcc1bb1 | 5838 | } |
e1aab161 | 5839 | EXPORT_SYMBOL(parent_mem_cgroup); |
33327948 | 5840 | |
c255a458 | 5841 | #ifdef CONFIG_MEMCG_SWAP |
c077719b KH |
5842 | static void __init enable_swap_cgroup(void) |
5843 | { | |
f8d66542 | 5844 | if (!mem_cgroup_disabled() && really_do_swap_account) |
c077719b KH |
5845 | do_swap_account = 1; |
5846 | } | |
5847 | #else | |
5848 | static void __init enable_swap_cgroup(void) | |
5849 | { | |
5850 | } | |
5851 | #endif | |
5852 | ||
f64c3f54 BS |
5853 | static int mem_cgroup_soft_limit_tree_init(void) |
5854 | { | |
5855 | struct mem_cgroup_tree_per_node *rtpn; | |
5856 | struct mem_cgroup_tree_per_zone *rtpz; | |
5857 | int tmp, node, zone; | |
5858 | ||
3ed28fa1 | 5859 | for_each_node(node) { |
f64c3f54 BS |
5860 | tmp = node; |
5861 | if (!node_state(node, N_NORMAL_MEMORY)) | |
5862 | tmp = -1; | |
5863 | rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL, tmp); | |
5864 | if (!rtpn) | |
c3cecc68 | 5865 | goto err_cleanup; |
f64c3f54 BS |
5866 | |
5867 | soft_limit_tree.rb_tree_per_node[node] = rtpn; | |
5868 | ||
5869 | for (zone = 0; zone < MAX_NR_ZONES; zone++) { | |
5870 | rtpz = &rtpn->rb_tree_per_zone[zone]; | |
5871 | rtpz->rb_root = RB_ROOT; | |
5872 | spin_lock_init(&rtpz->lock); | |
5873 | } | |
5874 | } | |
5875 | return 0; | |
c3cecc68 MH |
5876 | |
5877 | err_cleanup: | |
3ed28fa1 | 5878 | for_each_node(node) { |
c3cecc68 MH |
5879 | if (!soft_limit_tree.rb_tree_per_node[node]) |
5880 | break; | |
5881 | kfree(soft_limit_tree.rb_tree_per_node[node]); | |
5882 | soft_limit_tree.rb_tree_per_node[node] = NULL; | |
5883 | } | |
5884 | return 1; | |
5885 | ||
f64c3f54 BS |
5886 | } |
5887 | ||
0eb253e2 | 5888 | static struct cgroup_subsys_state * __ref |
92fb9748 | 5889 | mem_cgroup_css_alloc(struct cgroup *cont) |
8cdea7c0 | 5890 | { |
c0ff4b85 | 5891 | struct mem_cgroup *memcg, *parent; |
04046e1a | 5892 | long error = -ENOMEM; |
6d12e2d8 | 5893 | int node; |
8cdea7c0 | 5894 | |
c0ff4b85 R |
5895 | memcg = mem_cgroup_alloc(); |
5896 | if (!memcg) | |
04046e1a | 5897 | return ERR_PTR(error); |
78fb7466 | 5898 | |
3ed28fa1 | 5899 | for_each_node(node) |
c0ff4b85 | 5900 | if (alloc_mem_cgroup_per_zone_info(memcg, node)) |
6d12e2d8 | 5901 | goto free_out; |
f64c3f54 | 5902 | |
c077719b | 5903 | /* root ? */ |
28dbc4b6 | 5904 | if (cont->parent == NULL) { |
cdec2e42 | 5905 | int cpu; |
c077719b | 5906 | enable_swap_cgroup(); |
28dbc4b6 | 5907 | parent = NULL; |
f64c3f54 BS |
5908 | if (mem_cgroup_soft_limit_tree_init()) |
5909 | goto free_out; | |
a41c58a6 | 5910 | root_mem_cgroup = memcg; |
cdec2e42 KH |
5911 | for_each_possible_cpu(cpu) { |
5912 | struct memcg_stock_pcp *stock = | |
5913 | &per_cpu(memcg_stock, cpu); | |
5914 | INIT_WORK(&stock->work, drain_local_stock); | |
5915 | } | |
711d3d2c | 5916 | hotcpu_notifier(memcg_cpu_hotplug_callback, 0); |
18f59ea7 | 5917 | } else { |
28dbc4b6 | 5918 | parent = mem_cgroup_from_cont(cont->parent); |
c0ff4b85 R |
5919 | memcg->use_hierarchy = parent->use_hierarchy; |
5920 | memcg->oom_kill_disable = parent->oom_kill_disable; | |
18f59ea7 | 5921 | } |
28dbc4b6 | 5922 | |
18f59ea7 | 5923 | if (parent && parent->use_hierarchy) { |
c0ff4b85 R |
5924 | res_counter_init(&memcg->res, &parent->res); |
5925 | res_counter_init(&memcg->memsw, &parent->memsw); | |
510fc4e1 | 5926 | res_counter_init(&memcg->kmem, &parent->kmem); |
55007d84 | 5927 | |
7bcc1bb1 DN |
5928 | /* |
5929 | * We increment refcnt of the parent to ensure that we can | |
5930 | * safely access it on res_counter_charge/uncharge. | |
5931 | * This refcnt will be decremented when freeing this | |
5932 | * mem_cgroup(see mem_cgroup_put). | |
5933 | */ | |
5934 | mem_cgroup_get(parent); | |
18f59ea7 | 5935 | } else { |
c0ff4b85 R |
5936 | res_counter_init(&memcg->res, NULL); |
5937 | res_counter_init(&memcg->memsw, NULL); | |
510fc4e1 | 5938 | res_counter_init(&memcg->kmem, NULL); |
8c7f6edb TH |
5939 | /* |
5940 | * Deeper hierachy with use_hierarchy == false doesn't make | |
5941 | * much sense so let cgroup subsystem know about this | |
5942 | * unfortunate state in our controller. | |
5943 | */ | |
5944 | if (parent && parent != root_mem_cgroup) | |
5945 | mem_cgroup_subsys.broken_hierarchy = true; | |
18f59ea7 | 5946 | } |
c0ff4b85 R |
5947 | memcg->last_scanned_node = MAX_NUMNODES; |
5948 | INIT_LIST_HEAD(&memcg->oom_notify); | |
6d61ef40 | 5949 | |
a7885eb8 | 5950 | if (parent) |
c0ff4b85 R |
5951 | memcg->swappiness = mem_cgroup_swappiness(parent); |
5952 | atomic_set(&memcg->refcnt, 1); | |
5953 | memcg->move_charge_at_immigrate = 0; | |
5954 | mutex_init(&memcg->thresholds_lock); | |
312734c0 | 5955 | spin_lock_init(&memcg->move_lock); |
cbe128e3 GC |
5956 | |
5957 | error = memcg_init_kmem(memcg, &mem_cgroup_subsys); | |
5958 | if (error) { | |
5959 | /* | |
5960 | * We call put now because our (and parent's) refcnts | |
5961 | * are already in place. mem_cgroup_put() will internally | |
5962 | * call __mem_cgroup_free, so return directly | |
5963 | */ | |
5964 | mem_cgroup_put(memcg); | |
5965 | return ERR_PTR(error); | |
5966 | } | |
c0ff4b85 | 5967 | return &memcg->css; |
6d12e2d8 | 5968 | free_out: |
c0ff4b85 | 5969 | __mem_cgroup_free(memcg); |
04046e1a | 5970 | return ERR_PTR(error); |
8cdea7c0 BS |
5971 | } |
5972 | ||
92fb9748 | 5973 | static void mem_cgroup_css_offline(struct cgroup *cont) |
df878fb0 | 5974 | { |
c0ff4b85 | 5975 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
ec64f515 | 5976 | |
ab5196c2 | 5977 | mem_cgroup_reparent_charges(memcg); |
df878fb0 KH |
5978 | } |
5979 | ||
92fb9748 | 5980 | static void mem_cgroup_css_free(struct cgroup *cont) |
8cdea7c0 | 5981 | { |
c0ff4b85 | 5982 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cont); |
c268e994 | 5983 | |
1d62e436 | 5984 | kmem_cgroup_destroy(memcg); |
d1a4c0b3 | 5985 | |
c0ff4b85 | 5986 | mem_cgroup_put(memcg); |
8cdea7c0 BS |
5987 | } |
5988 | ||
02491447 | 5989 | #ifdef CONFIG_MMU |
7dc74be0 | 5990 | /* Handlers for move charge at task migration. */ |
854ffa8d DN |
5991 | #define PRECHARGE_COUNT_AT_ONCE 256 |
5992 | static int mem_cgroup_do_precharge(unsigned long count) | |
7dc74be0 | 5993 | { |
854ffa8d DN |
5994 | int ret = 0; |
5995 | int batch_count = PRECHARGE_COUNT_AT_ONCE; | |
c0ff4b85 | 5996 | struct mem_cgroup *memcg = mc.to; |
4ffef5fe | 5997 | |
c0ff4b85 | 5998 | if (mem_cgroup_is_root(memcg)) { |
854ffa8d DN |
5999 | mc.precharge += count; |
6000 | /* we don't need css_get for root */ | |
6001 | return ret; | |
6002 | } | |
6003 | /* try to charge at once */ | |
6004 | if (count > 1) { | |
6005 | struct res_counter *dummy; | |
6006 | /* | |
c0ff4b85 | 6007 | * "memcg" cannot be under rmdir() because we've already checked |
854ffa8d DN |
6008 | * by cgroup_lock_live_cgroup() that it is not removed and we |
6009 | * are still under the same cgroup_mutex. So we can postpone | |
6010 | * css_get(). | |
6011 | */ | |
c0ff4b85 | 6012 | if (res_counter_charge(&memcg->res, PAGE_SIZE * count, &dummy)) |
854ffa8d | 6013 | goto one_by_one; |
c0ff4b85 | 6014 | if (do_swap_account && res_counter_charge(&memcg->memsw, |
854ffa8d | 6015 | PAGE_SIZE * count, &dummy)) { |
c0ff4b85 | 6016 | res_counter_uncharge(&memcg->res, PAGE_SIZE * count); |
854ffa8d DN |
6017 | goto one_by_one; |
6018 | } | |
6019 | mc.precharge += count; | |
854ffa8d DN |
6020 | return ret; |
6021 | } | |
6022 | one_by_one: | |
6023 | /* fall back to one by one charge */ | |
6024 | while (count--) { | |
6025 | if (signal_pending(current)) { | |
6026 | ret = -EINTR; | |
6027 | break; | |
6028 | } | |
6029 | if (!batch_count--) { | |
6030 | batch_count = PRECHARGE_COUNT_AT_ONCE; | |
6031 | cond_resched(); | |
6032 | } | |
c0ff4b85 R |
6033 | ret = __mem_cgroup_try_charge(NULL, |
6034 | GFP_KERNEL, 1, &memcg, false); | |
38c5d72f | 6035 | if (ret) |
854ffa8d | 6036 | /* mem_cgroup_clear_mc() will do uncharge later */ |
38c5d72f | 6037 | return ret; |
854ffa8d DN |
6038 | mc.precharge++; |
6039 | } | |
4ffef5fe DN |
6040 | return ret; |
6041 | } | |
6042 | ||
6043 | /** | |
8d32ff84 | 6044 | * get_mctgt_type - get target type of moving charge |
4ffef5fe DN |
6045 | * @vma: the vma the pte to be checked belongs |
6046 | * @addr: the address corresponding to the pte to be checked | |
6047 | * @ptent: the pte to be checked | |
02491447 | 6048 | * @target: the pointer the target page or swap ent will be stored(can be NULL) |
4ffef5fe DN |
6049 | * |
6050 | * Returns | |
6051 | * 0(MC_TARGET_NONE): if the pte is not a target for move charge. | |
6052 | * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for | |
6053 | * move charge. if @target is not NULL, the page is stored in target->page | |
6054 | * with extra refcnt got(Callers should handle it). | |
02491447 DN |
6055 | * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a |
6056 | * target for charge migration. if @target is not NULL, the entry is stored | |
6057 | * in target->ent. | |
4ffef5fe DN |
6058 | * |
6059 | * Called with pte lock held. | |
6060 | */ | |
4ffef5fe DN |
6061 | union mc_target { |
6062 | struct page *page; | |
02491447 | 6063 | swp_entry_t ent; |
4ffef5fe DN |
6064 | }; |
6065 | ||
4ffef5fe | 6066 | enum mc_target_type { |
8d32ff84 | 6067 | MC_TARGET_NONE = 0, |
4ffef5fe | 6068 | MC_TARGET_PAGE, |
02491447 | 6069 | MC_TARGET_SWAP, |
4ffef5fe DN |
6070 | }; |
6071 | ||
90254a65 DN |
6072 | static struct page *mc_handle_present_pte(struct vm_area_struct *vma, |
6073 | unsigned long addr, pte_t ptent) | |
4ffef5fe | 6074 | { |
90254a65 | 6075 | struct page *page = vm_normal_page(vma, addr, ptent); |
4ffef5fe | 6076 | |
90254a65 DN |
6077 | if (!page || !page_mapped(page)) |
6078 | return NULL; | |
6079 | if (PageAnon(page)) { | |
6080 | /* we don't move shared anon */ | |
4b91355e | 6081 | if (!move_anon()) |
90254a65 | 6082 | return NULL; |
87946a72 DN |
6083 | } else if (!move_file()) |
6084 | /* we ignore mapcount for file pages */ | |
90254a65 DN |
6085 | return NULL; |
6086 | if (!get_page_unless_zero(page)) | |
6087 | return NULL; | |
6088 | ||
6089 | return page; | |
6090 | } | |
6091 | ||
4b91355e | 6092 | #ifdef CONFIG_SWAP |
90254a65 DN |
6093 | static struct page *mc_handle_swap_pte(struct vm_area_struct *vma, |
6094 | unsigned long addr, pte_t ptent, swp_entry_t *entry) | |
6095 | { | |
90254a65 DN |
6096 | struct page *page = NULL; |
6097 | swp_entry_t ent = pte_to_swp_entry(ptent); | |
6098 | ||
6099 | if (!move_anon() || non_swap_entry(ent)) | |
6100 | return NULL; | |
4b91355e KH |
6101 | /* |
6102 | * Because lookup_swap_cache() updates some statistics counter, | |
6103 | * we call find_get_page() with swapper_space directly. | |
6104 | */ | |
6105 | page = find_get_page(&swapper_space, ent.val); | |
90254a65 DN |
6106 | if (do_swap_account) |
6107 | entry->val = ent.val; | |
6108 | ||
6109 | return page; | |
6110 | } | |
4b91355e KH |
6111 | #else |
6112 | static struct page *mc_handle_swap_pte(struct vm_area_struct *vma, | |
6113 | unsigned long addr, pte_t ptent, swp_entry_t *entry) | |
6114 | { | |
6115 | return NULL; | |
6116 | } | |
6117 | #endif | |
90254a65 | 6118 | |
87946a72 DN |
6119 | static struct page *mc_handle_file_pte(struct vm_area_struct *vma, |
6120 | unsigned long addr, pte_t ptent, swp_entry_t *entry) | |
6121 | { | |
6122 | struct page *page = NULL; | |
87946a72 DN |
6123 | struct address_space *mapping; |
6124 | pgoff_t pgoff; | |
6125 | ||
6126 | if (!vma->vm_file) /* anonymous vma */ | |
6127 | return NULL; | |
6128 | if (!move_file()) | |
6129 | return NULL; | |
6130 | ||
87946a72 DN |
6131 | mapping = vma->vm_file->f_mapping; |
6132 | if (pte_none(ptent)) | |
6133 | pgoff = linear_page_index(vma, addr); | |
6134 | else /* pte_file(ptent) is true */ | |
6135 | pgoff = pte_to_pgoff(ptent); | |
6136 | ||
6137 | /* page is moved even if it's not RSS of this task(page-faulted). */ | |
aa3b1895 HD |
6138 | page = find_get_page(mapping, pgoff); |
6139 | ||
6140 | #ifdef CONFIG_SWAP | |
6141 | /* shmem/tmpfs may report page out on swap: account for that too. */ | |
6142 | if (radix_tree_exceptional_entry(page)) { | |
6143 | swp_entry_t swap = radix_to_swp_entry(page); | |
87946a72 | 6144 | if (do_swap_account) |
aa3b1895 HD |
6145 | *entry = swap; |
6146 | page = find_get_page(&swapper_space, swap.val); | |
87946a72 | 6147 | } |
aa3b1895 | 6148 | #endif |
87946a72 DN |
6149 | return page; |
6150 | } | |
6151 | ||
8d32ff84 | 6152 | static enum mc_target_type get_mctgt_type(struct vm_area_struct *vma, |
90254a65 DN |
6153 | unsigned long addr, pte_t ptent, union mc_target *target) |
6154 | { | |
6155 | struct page *page = NULL; | |
6156 | struct page_cgroup *pc; | |
8d32ff84 | 6157 | enum mc_target_type ret = MC_TARGET_NONE; |
90254a65 DN |
6158 | swp_entry_t ent = { .val = 0 }; |
6159 | ||
6160 | if (pte_present(ptent)) | |
6161 | page = mc_handle_present_pte(vma, addr, ptent); | |
6162 | else if (is_swap_pte(ptent)) | |
6163 | page = mc_handle_swap_pte(vma, addr, ptent, &ent); | |
87946a72 DN |
6164 | else if (pte_none(ptent) || pte_file(ptent)) |
6165 | page = mc_handle_file_pte(vma, addr, ptent, &ent); | |
90254a65 DN |
6166 | |
6167 | if (!page && !ent.val) | |
8d32ff84 | 6168 | return ret; |
02491447 DN |
6169 | if (page) { |
6170 | pc = lookup_page_cgroup(page); | |
6171 | /* | |
6172 | * Do only loose check w/o page_cgroup lock. | |
6173 | * mem_cgroup_move_account() checks the pc is valid or not under | |
6174 | * the lock. | |
6175 | */ | |
6176 | if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) { | |
6177 | ret = MC_TARGET_PAGE; | |
6178 | if (target) | |
6179 | target->page = page; | |
6180 | } | |
6181 | if (!ret || !target) | |
6182 | put_page(page); | |
6183 | } | |
90254a65 DN |
6184 | /* There is a swap entry and a page doesn't exist or isn't charged */ |
6185 | if (ent.val && !ret && | |
9fb4b7cc | 6186 | css_id(&mc.from->css) == lookup_swap_cgroup_id(ent)) { |
7f0f1546 KH |
6187 | ret = MC_TARGET_SWAP; |
6188 | if (target) | |
6189 | target->ent = ent; | |
4ffef5fe | 6190 | } |
4ffef5fe DN |
6191 | return ret; |
6192 | } | |
6193 | ||
12724850 NH |
6194 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE |
6195 | /* | |
6196 | * We don't consider swapping or file mapped pages because THP does not | |
6197 | * support them for now. | |
6198 | * Caller should make sure that pmd_trans_huge(pmd) is true. | |
6199 | */ | |
6200 | static enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma, | |
6201 | unsigned long addr, pmd_t pmd, union mc_target *target) | |
6202 | { | |
6203 | struct page *page = NULL; | |
6204 | struct page_cgroup *pc; | |
6205 | enum mc_target_type ret = MC_TARGET_NONE; | |
6206 | ||
6207 | page = pmd_page(pmd); | |
6208 | VM_BUG_ON(!page || !PageHead(page)); | |
6209 | if (!move_anon()) | |
6210 | return ret; | |
6211 | pc = lookup_page_cgroup(page); | |
6212 | if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) { | |
6213 | ret = MC_TARGET_PAGE; | |
6214 | if (target) { | |
6215 | get_page(page); | |
6216 | target->page = page; | |
6217 | } | |
6218 | } | |
6219 | return ret; | |
6220 | } | |
6221 | #else | |
6222 | static inline enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma, | |
6223 | unsigned long addr, pmd_t pmd, union mc_target *target) | |
6224 | { | |
6225 | return MC_TARGET_NONE; | |
6226 | } | |
6227 | #endif | |
6228 | ||
4ffef5fe DN |
6229 | static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd, |
6230 | unsigned long addr, unsigned long end, | |
6231 | struct mm_walk *walk) | |
6232 | { | |
6233 | struct vm_area_struct *vma = walk->private; | |
6234 | pte_t *pte; | |
6235 | spinlock_t *ptl; | |
6236 | ||
12724850 NH |
6237 | if (pmd_trans_huge_lock(pmd, vma) == 1) { |
6238 | if (get_mctgt_type_thp(vma, addr, *pmd, NULL) == MC_TARGET_PAGE) | |
6239 | mc.precharge += HPAGE_PMD_NR; | |
6240 | spin_unlock(&vma->vm_mm->page_table_lock); | |
1a5a9906 | 6241 | return 0; |
12724850 | 6242 | } |
03319327 | 6243 | |
45f83cef AA |
6244 | if (pmd_trans_unstable(pmd)) |
6245 | return 0; | |
4ffef5fe DN |
6246 | pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl); |
6247 | for (; addr != end; pte++, addr += PAGE_SIZE) | |
8d32ff84 | 6248 | if (get_mctgt_type(vma, addr, *pte, NULL)) |
4ffef5fe DN |
6249 | mc.precharge++; /* increment precharge temporarily */ |
6250 | pte_unmap_unlock(pte - 1, ptl); | |
6251 | cond_resched(); | |
6252 | ||
7dc74be0 DN |
6253 | return 0; |
6254 | } | |
6255 | ||
4ffef5fe DN |
6256 | static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm) |
6257 | { | |
6258 | unsigned long precharge; | |
6259 | struct vm_area_struct *vma; | |
6260 | ||
dfe076b0 | 6261 | down_read(&mm->mmap_sem); |
4ffef5fe DN |
6262 | for (vma = mm->mmap; vma; vma = vma->vm_next) { |
6263 | struct mm_walk mem_cgroup_count_precharge_walk = { | |
6264 | .pmd_entry = mem_cgroup_count_precharge_pte_range, | |
6265 | .mm = mm, | |
6266 | .private = vma, | |
6267 | }; | |
6268 | if (is_vm_hugetlb_page(vma)) | |
6269 | continue; | |
4ffef5fe DN |
6270 | walk_page_range(vma->vm_start, vma->vm_end, |
6271 | &mem_cgroup_count_precharge_walk); | |
6272 | } | |
dfe076b0 | 6273 | up_read(&mm->mmap_sem); |
4ffef5fe DN |
6274 | |
6275 | precharge = mc.precharge; | |
6276 | mc.precharge = 0; | |
6277 | ||
6278 | return precharge; | |
6279 | } | |
6280 | ||
4ffef5fe DN |
6281 | static int mem_cgroup_precharge_mc(struct mm_struct *mm) |
6282 | { | |
dfe076b0 DN |
6283 | unsigned long precharge = mem_cgroup_count_precharge(mm); |
6284 | ||
6285 | VM_BUG_ON(mc.moving_task); | |
6286 | mc.moving_task = current; | |
6287 | return mem_cgroup_do_precharge(precharge); | |
4ffef5fe DN |
6288 | } |
6289 | ||
dfe076b0 DN |
6290 | /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */ |
6291 | static void __mem_cgroup_clear_mc(void) | |
4ffef5fe | 6292 | { |
2bd9bb20 KH |
6293 | struct mem_cgroup *from = mc.from; |
6294 | struct mem_cgroup *to = mc.to; | |
6295 | ||
4ffef5fe | 6296 | /* we must uncharge all the leftover precharges from mc.to */ |
854ffa8d DN |
6297 | if (mc.precharge) { |
6298 | __mem_cgroup_cancel_charge(mc.to, mc.precharge); | |
6299 | mc.precharge = 0; | |
6300 | } | |
6301 | /* | |
6302 | * we didn't uncharge from mc.from at mem_cgroup_move_account(), so | |
6303 | * we must uncharge here. | |
6304 | */ | |
6305 | if (mc.moved_charge) { | |
6306 | __mem_cgroup_cancel_charge(mc.from, mc.moved_charge); | |
6307 | mc.moved_charge = 0; | |
4ffef5fe | 6308 | } |
483c30b5 DN |
6309 | /* we must fixup refcnts and charges */ |
6310 | if (mc.moved_swap) { | |
483c30b5 DN |
6311 | /* uncharge swap account from the old cgroup */ |
6312 | if (!mem_cgroup_is_root(mc.from)) | |
6313 | res_counter_uncharge(&mc.from->memsw, | |
6314 | PAGE_SIZE * mc.moved_swap); | |
6315 | __mem_cgroup_put(mc.from, mc.moved_swap); | |
6316 | ||
6317 | if (!mem_cgroup_is_root(mc.to)) { | |
6318 | /* | |
6319 | * we charged both to->res and to->memsw, so we should | |
6320 | * uncharge to->res. | |
6321 | */ | |
6322 | res_counter_uncharge(&mc.to->res, | |
6323 | PAGE_SIZE * mc.moved_swap); | |
483c30b5 DN |
6324 | } |
6325 | /* we've already done mem_cgroup_get(mc.to) */ | |
483c30b5 DN |
6326 | mc.moved_swap = 0; |
6327 | } | |
dfe076b0 DN |
6328 | memcg_oom_recover(from); |
6329 | memcg_oom_recover(to); | |
6330 | wake_up_all(&mc.waitq); | |
6331 | } | |
6332 | ||
6333 | static void mem_cgroup_clear_mc(void) | |
6334 | { | |
6335 | struct mem_cgroup *from = mc.from; | |
6336 | ||
6337 | /* | |
6338 | * we must clear moving_task before waking up waiters at the end of | |
6339 | * task migration. | |
6340 | */ | |
6341 | mc.moving_task = NULL; | |
6342 | __mem_cgroup_clear_mc(); | |
2bd9bb20 | 6343 | spin_lock(&mc.lock); |
4ffef5fe DN |
6344 | mc.from = NULL; |
6345 | mc.to = NULL; | |
2bd9bb20 | 6346 | spin_unlock(&mc.lock); |
32047e2a | 6347 | mem_cgroup_end_move(from); |
4ffef5fe DN |
6348 | } |
6349 | ||
761b3ef5 LZ |
6350 | static int mem_cgroup_can_attach(struct cgroup *cgroup, |
6351 | struct cgroup_taskset *tset) | |
7dc74be0 | 6352 | { |
2f7ee569 | 6353 | struct task_struct *p = cgroup_taskset_first(tset); |
7dc74be0 | 6354 | int ret = 0; |
c0ff4b85 | 6355 | struct mem_cgroup *memcg = mem_cgroup_from_cont(cgroup); |
7dc74be0 | 6356 | |
c0ff4b85 | 6357 | if (memcg->move_charge_at_immigrate) { |
7dc74be0 DN |
6358 | struct mm_struct *mm; |
6359 | struct mem_cgroup *from = mem_cgroup_from_task(p); | |
6360 | ||
c0ff4b85 | 6361 | VM_BUG_ON(from == memcg); |
7dc74be0 DN |
6362 | |
6363 | mm = get_task_mm(p); | |
6364 | if (!mm) | |
6365 | return 0; | |
7dc74be0 | 6366 | /* We move charges only when we move a owner of the mm */ |
4ffef5fe DN |
6367 | if (mm->owner == p) { |
6368 | VM_BUG_ON(mc.from); | |
6369 | VM_BUG_ON(mc.to); | |
6370 | VM_BUG_ON(mc.precharge); | |
854ffa8d | 6371 | VM_BUG_ON(mc.moved_charge); |
483c30b5 | 6372 | VM_BUG_ON(mc.moved_swap); |
32047e2a | 6373 | mem_cgroup_start_move(from); |
2bd9bb20 | 6374 | spin_lock(&mc.lock); |
4ffef5fe | 6375 | mc.from = from; |
c0ff4b85 | 6376 | mc.to = memcg; |
2bd9bb20 | 6377 | spin_unlock(&mc.lock); |
dfe076b0 | 6378 | /* We set mc.moving_task later */ |
4ffef5fe DN |
6379 | |
6380 | ret = mem_cgroup_precharge_mc(mm); | |
6381 | if (ret) | |
6382 | mem_cgroup_clear_mc(); | |
dfe076b0 DN |
6383 | } |
6384 | mmput(mm); | |
7dc74be0 DN |
6385 | } |
6386 | return ret; | |
6387 | } | |
6388 | ||
761b3ef5 LZ |
6389 | static void mem_cgroup_cancel_attach(struct cgroup *cgroup, |
6390 | struct cgroup_taskset *tset) | |
7dc74be0 | 6391 | { |
4ffef5fe | 6392 | mem_cgroup_clear_mc(); |
7dc74be0 DN |
6393 | } |
6394 | ||
4ffef5fe DN |
6395 | static int mem_cgroup_move_charge_pte_range(pmd_t *pmd, |
6396 | unsigned long addr, unsigned long end, | |
6397 | struct mm_walk *walk) | |
7dc74be0 | 6398 | { |
4ffef5fe DN |
6399 | int ret = 0; |
6400 | struct vm_area_struct *vma = walk->private; | |
6401 | pte_t *pte; | |
6402 | spinlock_t *ptl; | |
12724850 NH |
6403 | enum mc_target_type target_type; |
6404 | union mc_target target; | |
6405 | struct page *page; | |
6406 | struct page_cgroup *pc; | |
4ffef5fe | 6407 | |
12724850 NH |
6408 | /* |
6409 | * We don't take compound_lock() here but no race with splitting thp | |
6410 | * happens because: | |
6411 | * - if pmd_trans_huge_lock() returns 1, the relevant thp is not | |
6412 | * under splitting, which means there's no concurrent thp split, | |
6413 | * - if another thread runs into split_huge_page() just after we | |
6414 | * entered this if-block, the thread must wait for page table lock | |
6415 | * to be unlocked in __split_huge_page_splitting(), where the main | |
6416 | * part of thp split is not executed yet. | |
6417 | */ | |
6418 | if (pmd_trans_huge_lock(pmd, vma) == 1) { | |
62ade86a | 6419 | if (mc.precharge < HPAGE_PMD_NR) { |
12724850 NH |
6420 | spin_unlock(&vma->vm_mm->page_table_lock); |
6421 | return 0; | |
6422 | } | |
6423 | target_type = get_mctgt_type_thp(vma, addr, *pmd, &target); | |
6424 | if (target_type == MC_TARGET_PAGE) { | |
6425 | page = target.page; | |
6426 | if (!isolate_lru_page(page)) { | |
6427 | pc = lookup_page_cgroup(page); | |
6428 | if (!mem_cgroup_move_account(page, HPAGE_PMD_NR, | |
2f3479b1 | 6429 | pc, mc.from, mc.to)) { |
12724850 NH |
6430 | mc.precharge -= HPAGE_PMD_NR; |
6431 | mc.moved_charge += HPAGE_PMD_NR; | |
6432 | } | |
6433 | putback_lru_page(page); | |
6434 | } | |
6435 | put_page(page); | |
6436 | } | |
6437 | spin_unlock(&vma->vm_mm->page_table_lock); | |
1a5a9906 | 6438 | return 0; |
12724850 NH |
6439 | } |
6440 | ||
45f83cef AA |
6441 | if (pmd_trans_unstable(pmd)) |
6442 | return 0; | |
4ffef5fe DN |
6443 | retry: |
6444 | pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl); | |
6445 | for (; addr != end; addr += PAGE_SIZE) { | |
6446 | pte_t ptent = *(pte++); | |
02491447 | 6447 | swp_entry_t ent; |
4ffef5fe DN |
6448 | |
6449 | if (!mc.precharge) | |
6450 | break; | |
6451 | ||
8d32ff84 | 6452 | switch (get_mctgt_type(vma, addr, ptent, &target)) { |
4ffef5fe DN |
6453 | case MC_TARGET_PAGE: |
6454 | page = target.page; | |
6455 | if (isolate_lru_page(page)) | |
6456 | goto put; | |
6457 | pc = lookup_page_cgroup(page); | |
7ec99d62 | 6458 | if (!mem_cgroup_move_account(page, 1, pc, |
2f3479b1 | 6459 | mc.from, mc.to)) { |
4ffef5fe | 6460 | mc.precharge--; |
854ffa8d DN |
6461 | /* we uncharge from mc.from later. */ |
6462 | mc.moved_charge++; | |
4ffef5fe DN |
6463 | } |
6464 | putback_lru_page(page); | |
8d32ff84 | 6465 | put: /* get_mctgt_type() gets the page */ |
4ffef5fe DN |
6466 | put_page(page); |
6467 | break; | |
02491447 DN |
6468 | case MC_TARGET_SWAP: |
6469 | ent = target.ent; | |
e91cbb42 | 6470 | if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to)) { |
02491447 | 6471 | mc.precharge--; |
483c30b5 DN |
6472 | /* we fixup refcnts and charges later. */ |
6473 | mc.moved_swap++; | |
6474 | } | |
02491447 | 6475 | break; |
4ffef5fe DN |
6476 | default: |
6477 | break; | |
6478 | } | |
6479 | } | |
6480 | pte_unmap_unlock(pte - 1, ptl); | |
6481 | cond_resched(); | |
6482 | ||
6483 | if (addr != end) { | |
6484 | /* | |
6485 | * We have consumed all precharges we got in can_attach(). | |
6486 | * We try charge one by one, but don't do any additional | |
6487 | * charges to mc.to if we have failed in charge once in attach() | |
6488 | * phase. | |
6489 | */ | |
854ffa8d | 6490 | ret = mem_cgroup_do_precharge(1); |
4ffef5fe DN |
6491 | if (!ret) |
6492 | goto retry; | |
6493 | } | |
6494 | ||
6495 | return ret; | |
6496 | } | |
6497 | ||
6498 | static void mem_cgroup_move_charge(struct mm_struct *mm) | |
6499 | { | |
6500 | struct vm_area_struct *vma; | |
6501 | ||
6502 | lru_add_drain_all(); | |
dfe076b0 DN |
6503 | retry: |
6504 | if (unlikely(!down_read_trylock(&mm->mmap_sem))) { | |
6505 | /* | |
6506 | * Someone who are holding the mmap_sem might be waiting in | |
6507 | * waitq. So we cancel all extra charges, wake up all waiters, | |
6508 | * and retry. Because we cancel precharges, we might not be able | |
6509 | * to move enough charges, but moving charge is a best-effort | |
6510 | * feature anyway, so it wouldn't be a big problem. | |
6511 | */ | |
6512 | __mem_cgroup_clear_mc(); | |
6513 | cond_resched(); | |
6514 | goto retry; | |
6515 | } | |
4ffef5fe DN |
6516 | for (vma = mm->mmap; vma; vma = vma->vm_next) { |
6517 | int ret; | |
6518 | struct mm_walk mem_cgroup_move_charge_walk = { | |
6519 | .pmd_entry = mem_cgroup_move_charge_pte_range, | |
6520 | .mm = mm, | |
6521 | .private = vma, | |
6522 | }; | |
6523 | if (is_vm_hugetlb_page(vma)) | |
6524 | continue; | |
4ffef5fe DN |
6525 | ret = walk_page_range(vma->vm_start, vma->vm_end, |
6526 | &mem_cgroup_move_charge_walk); | |
6527 | if (ret) | |
6528 | /* | |
6529 | * means we have consumed all precharges and failed in | |
6530 | * doing additional charge. Just abandon here. | |
6531 | */ | |
6532 | break; | |
6533 | } | |
dfe076b0 | 6534 | up_read(&mm->mmap_sem); |
7dc74be0 DN |
6535 | } |
6536 | ||
761b3ef5 LZ |
6537 | static void mem_cgroup_move_task(struct cgroup *cont, |
6538 | struct cgroup_taskset *tset) | |
67e465a7 | 6539 | { |
2f7ee569 | 6540 | struct task_struct *p = cgroup_taskset_first(tset); |
a433658c | 6541 | struct mm_struct *mm = get_task_mm(p); |
dfe076b0 | 6542 | |
dfe076b0 | 6543 | if (mm) { |
a433658c KM |
6544 | if (mc.to) |
6545 | mem_cgroup_move_charge(mm); | |
dfe076b0 DN |
6546 | mmput(mm); |
6547 | } | |
a433658c KM |
6548 | if (mc.to) |
6549 | mem_cgroup_clear_mc(); | |
67e465a7 | 6550 | } |
5cfb80a7 | 6551 | #else /* !CONFIG_MMU */ |
761b3ef5 LZ |
6552 | static int mem_cgroup_can_attach(struct cgroup *cgroup, |
6553 | struct cgroup_taskset *tset) | |
5cfb80a7 DN |
6554 | { |
6555 | return 0; | |
6556 | } | |
761b3ef5 LZ |
6557 | static void mem_cgroup_cancel_attach(struct cgroup *cgroup, |
6558 | struct cgroup_taskset *tset) | |
5cfb80a7 DN |
6559 | { |
6560 | } | |
761b3ef5 LZ |
6561 | static void mem_cgroup_move_task(struct cgroup *cont, |
6562 | struct cgroup_taskset *tset) | |
5cfb80a7 DN |
6563 | { |
6564 | } | |
6565 | #endif | |
67e465a7 | 6566 | |
8cdea7c0 BS |
6567 | struct cgroup_subsys mem_cgroup_subsys = { |
6568 | .name = "memory", | |
6569 | .subsys_id = mem_cgroup_subsys_id, | |
92fb9748 TH |
6570 | .css_alloc = mem_cgroup_css_alloc, |
6571 | .css_offline = mem_cgroup_css_offline, | |
6572 | .css_free = mem_cgroup_css_free, | |
7dc74be0 DN |
6573 | .can_attach = mem_cgroup_can_attach, |
6574 | .cancel_attach = mem_cgroup_cancel_attach, | |
67e465a7 | 6575 | .attach = mem_cgroup_move_task, |
6bc10349 | 6576 | .base_cftypes = mem_cgroup_files, |
6d12e2d8 | 6577 | .early_init = 0, |
04046e1a | 6578 | .use_id = 1, |
8cdea7c0 | 6579 | }; |
c077719b | 6580 | |
c255a458 | 6581 | #ifdef CONFIG_MEMCG_SWAP |
a42c390c MH |
6582 | static int __init enable_swap_account(char *s) |
6583 | { | |
6584 | /* consider enabled if no parameter or 1 is given */ | |
a2c8990a | 6585 | if (!strcmp(s, "1")) |
a42c390c | 6586 | really_do_swap_account = 1; |
a2c8990a | 6587 | else if (!strcmp(s, "0")) |
a42c390c MH |
6588 | really_do_swap_account = 0; |
6589 | return 1; | |
6590 | } | |
a2c8990a | 6591 | __setup("swapaccount=", enable_swap_account); |
c077719b | 6592 | |
c077719b | 6593 | #endif |