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