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