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