]>
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 | * | |
1575e68b JW |
17 | * Native page reclaim |
18 | * Charge lifetime sanitation | |
19 | * Lockless page tracking & accounting | |
20 | * Unified hierarchy configuration model | |
21 | * Copyright (C) 2015 Red Hat, Inc., Johannes Weiner | |
22 | * | |
8cdea7c0 BS |
23 | * This program is free software; you can redistribute it and/or modify |
24 | * it under the terms of the GNU General Public License as published by | |
25 | * the Free Software Foundation; either version 2 of the License, or | |
26 | * (at your option) any later version. | |
27 | * | |
28 | * This program is distributed in the hope that it will be useful, | |
29 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
30 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
31 | * GNU General Public License for more details. | |
32 | */ | |
33 | ||
3e32cb2e | 34 | #include <linux/page_counter.h> |
8cdea7c0 BS |
35 | #include <linux/memcontrol.h> |
36 | #include <linux/cgroup.h> | |
78fb7466 | 37 | #include <linux/mm.h> |
4ffef5fe | 38 | #include <linux/hugetlb.h> |
d13d1443 | 39 | #include <linux/pagemap.h> |
d52aa412 | 40 | #include <linux/smp.h> |
8a9f3ccd | 41 | #include <linux/page-flags.h> |
66e1707b | 42 | #include <linux/backing-dev.h> |
8a9f3ccd BS |
43 | #include <linux/bit_spinlock.h> |
44 | #include <linux/rcupdate.h> | |
e222432b | 45 | #include <linux/limits.h> |
b9e15baf | 46 | #include <linux/export.h> |
8c7c6e34 | 47 | #include <linux/mutex.h> |
bb4cc1a8 | 48 | #include <linux/rbtree.h> |
b6ac57d5 | 49 | #include <linux/slab.h> |
66e1707b | 50 | #include <linux/swap.h> |
02491447 | 51 | #include <linux/swapops.h> |
66e1707b | 52 | #include <linux/spinlock.h> |
2e72b634 | 53 | #include <linux/eventfd.h> |
79bd9814 | 54 | #include <linux/poll.h> |
2e72b634 | 55 | #include <linux/sort.h> |
66e1707b | 56 | #include <linux/fs.h> |
d2ceb9b7 | 57 | #include <linux/seq_file.h> |
70ddf637 | 58 | #include <linux/vmpressure.h> |
b69408e8 | 59 | #include <linux/mm_inline.h> |
5d1ea48b | 60 | #include <linux/swap_cgroup.h> |
cdec2e42 | 61 | #include <linux/cpu.h> |
158e0a2d | 62 | #include <linux/oom.h> |
0056f4e6 | 63 | #include <linux/lockdep.h> |
79bd9814 | 64 | #include <linux/file.h> |
b23afb93 | 65 | #include <linux/tracehook.h> |
08e552c6 | 66 | #include "internal.h" |
d1a4c0b3 | 67 | #include <net/sock.h> |
4bd2c1ee | 68 | #include <net/ip.h> |
f35c3a8e | 69 | #include "slab.h" |
8cdea7c0 | 70 | |
7c0f6ba6 | 71 | #include <linux/uaccess.h> |
8697d331 | 72 | |
cc8e970c KM |
73 | #include <trace/events/vmscan.h> |
74 | ||
073219e9 TH |
75 | struct cgroup_subsys memory_cgrp_subsys __read_mostly; |
76 | EXPORT_SYMBOL(memory_cgrp_subsys); | |
68ae564b | 77 | |
7d828602 JW |
78 | struct mem_cgroup *root_mem_cgroup __read_mostly; |
79 | ||
a181b0e8 | 80 | #define MEM_CGROUP_RECLAIM_RETRIES 5 |
8cdea7c0 | 81 | |
f7e1cb6e JW |
82 | /* Socket memory accounting disabled? */ |
83 | static bool cgroup_memory_nosocket; | |
84 | ||
04823c83 VD |
85 | /* Kernel memory accounting disabled? */ |
86 | static bool cgroup_memory_nokmem; | |
87 | ||
21afa38e | 88 | /* Whether the swap controller is active */ |
c255a458 | 89 | #ifdef CONFIG_MEMCG_SWAP |
c077719b | 90 | int do_swap_account __read_mostly; |
c077719b | 91 | #else |
a0db00fc | 92 | #define do_swap_account 0 |
c077719b KH |
93 | #endif |
94 | ||
7941d214 JW |
95 | /* Whether legacy memory+swap accounting is active */ |
96 | static bool do_memsw_account(void) | |
97 | { | |
98 | return !cgroup_subsys_on_dfl(memory_cgrp_subsys) && do_swap_account; | |
99 | } | |
100 | ||
af7c4b0e JW |
101 | static const char * const mem_cgroup_stat_names[] = { |
102 | "cache", | |
103 | "rss", | |
b070e65c | 104 | "rss_huge", |
af7c4b0e | 105 | "mapped_file", |
c4843a75 | 106 | "dirty", |
3ea67d06 | 107 | "writeback", |
af7c4b0e JW |
108 | "swap", |
109 | }; | |
110 | ||
af7c4b0e JW |
111 | static const char * const mem_cgroup_events_names[] = { |
112 | "pgpgin", | |
113 | "pgpgout", | |
114 | "pgfault", | |
115 | "pgmajfault", | |
116 | }; | |
117 | ||
58cf188e SZ |
118 | static const char * const mem_cgroup_lru_names[] = { |
119 | "inactive_anon", | |
120 | "active_anon", | |
121 | "inactive_file", | |
122 | "active_file", | |
123 | "unevictable", | |
124 | }; | |
125 | ||
a0db00fc KS |
126 | #define THRESHOLDS_EVENTS_TARGET 128 |
127 | #define SOFTLIMIT_EVENTS_TARGET 1024 | |
128 | #define NUMAINFO_EVENTS_TARGET 1024 | |
e9f8974f | 129 | |
bb4cc1a8 AM |
130 | /* |
131 | * Cgroups above their limits are maintained in a RB-Tree, independent of | |
132 | * their hierarchy representation | |
133 | */ | |
134 | ||
ef8f2327 | 135 | struct mem_cgroup_tree_per_node { |
bb4cc1a8 AM |
136 | struct rb_root rb_root; |
137 | spinlock_t lock; | |
138 | }; | |
139 | ||
bb4cc1a8 AM |
140 | struct mem_cgroup_tree { |
141 | struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES]; | |
142 | }; | |
143 | ||
144 | static struct mem_cgroup_tree soft_limit_tree __read_mostly; | |
145 | ||
9490ff27 KH |
146 | /* for OOM */ |
147 | struct mem_cgroup_eventfd_list { | |
148 | struct list_head list; | |
149 | struct eventfd_ctx *eventfd; | |
150 | }; | |
2e72b634 | 151 | |
79bd9814 TH |
152 | /* |
153 | * cgroup_event represents events which userspace want to receive. | |
154 | */ | |
3bc942f3 | 155 | struct mem_cgroup_event { |
79bd9814 | 156 | /* |
59b6f873 | 157 | * memcg which the event belongs to. |
79bd9814 | 158 | */ |
59b6f873 | 159 | struct mem_cgroup *memcg; |
79bd9814 TH |
160 | /* |
161 | * eventfd to signal userspace about the event. | |
162 | */ | |
163 | struct eventfd_ctx *eventfd; | |
164 | /* | |
165 | * Each of these stored in a list by the cgroup. | |
166 | */ | |
167 | struct list_head list; | |
fba94807 TH |
168 | /* |
169 | * register_event() callback will be used to add new userspace | |
170 | * waiter for changes related to this event. Use eventfd_signal() | |
171 | * on eventfd to send notification to userspace. | |
172 | */ | |
59b6f873 | 173 | int (*register_event)(struct mem_cgroup *memcg, |
347c4a87 | 174 | struct eventfd_ctx *eventfd, const char *args); |
fba94807 TH |
175 | /* |
176 | * unregister_event() callback will be called when userspace closes | |
177 | * the eventfd or on cgroup removing. This callback must be set, | |
178 | * if you want provide notification functionality. | |
179 | */ | |
59b6f873 | 180 | void (*unregister_event)(struct mem_cgroup *memcg, |
fba94807 | 181 | struct eventfd_ctx *eventfd); |
79bd9814 TH |
182 | /* |
183 | * All fields below needed to unregister event when | |
184 | * userspace closes eventfd. | |
185 | */ | |
186 | poll_table pt; | |
187 | wait_queue_head_t *wqh; | |
188 | wait_queue_t wait; | |
189 | struct work_struct remove; | |
190 | }; | |
191 | ||
c0ff4b85 R |
192 | static void mem_cgroup_threshold(struct mem_cgroup *memcg); |
193 | static void mem_cgroup_oom_notify(struct mem_cgroup *memcg); | |
2e72b634 | 194 | |
7dc74be0 DN |
195 | /* Stuffs for move charges at task migration. */ |
196 | /* | |
1dfab5ab | 197 | * Types of charges to be moved. |
7dc74be0 | 198 | */ |
1dfab5ab JW |
199 | #define MOVE_ANON 0x1U |
200 | #define MOVE_FILE 0x2U | |
201 | #define MOVE_MASK (MOVE_ANON | MOVE_FILE) | |
7dc74be0 | 202 | |
4ffef5fe DN |
203 | /* "mc" and its members are protected by cgroup_mutex */ |
204 | static struct move_charge_struct { | |
b1dd693e | 205 | spinlock_t lock; /* for from, to */ |
264a0ae1 | 206 | struct mm_struct *mm; |
4ffef5fe DN |
207 | struct mem_cgroup *from; |
208 | struct mem_cgroup *to; | |
1dfab5ab | 209 | unsigned long flags; |
4ffef5fe | 210 | unsigned long precharge; |
854ffa8d | 211 | unsigned long moved_charge; |
483c30b5 | 212 | unsigned long moved_swap; |
8033b97c DN |
213 | struct task_struct *moving_task; /* a task moving charges */ |
214 | wait_queue_head_t waitq; /* a waitq for other context */ | |
215 | } mc = { | |
2bd9bb20 | 216 | .lock = __SPIN_LOCK_UNLOCKED(mc.lock), |
8033b97c DN |
217 | .waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq), |
218 | }; | |
4ffef5fe | 219 | |
4e416953 BS |
220 | /* |
221 | * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft | |
222 | * limit reclaim to prevent infinite loops, if they ever occur. | |
223 | */ | |
a0db00fc | 224 | #define MEM_CGROUP_MAX_RECLAIM_LOOPS 100 |
bb4cc1a8 | 225 | #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS 2 |
4e416953 | 226 | |
217bc319 KH |
227 | enum charge_type { |
228 | MEM_CGROUP_CHARGE_TYPE_CACHE = 0, | |
41326c17 | 229 | MEM_CGROUP_CHARGE_TYPE_ANON, |
d13d1443 | 230 | MEM_CGROUP_CHARGE_TYPE_SWAPOUT, /* for accounting swapcache */ |
8a9478ca | 231 | MEM_CGROUP_CHARGE_TYPE_DROP, /* a page was unused swap cache */ |
c05555b5 KH |
232 | NR_CHARGE_TYPE, |
233 | }; | |
234 | ||
8c7c6e34 | 235 | /* for encoding cft->private value on file */ |
86ae53e1 GC |
236 | enum res_type { |
237 | _MEM, | |
238 | _MEMSWAP, | |
239 | _OOM_TYPE, | |
510fc4e1 | 240 | _KMEM, |
d55f90bf | 241 | _TCP, |
86ae53e1 GC |
242 | }; |
243 | ||
a0db00fc KS |
244 | #define MEMFILE_PRIVATE(x, val) ((x) << 16 | (val)) |
245 | #define MEMFILE_TYPE(val) ((val) >> 16 & 0xffff) | |
8c7c6e34 | 246 | #define MEMFILE_ATTR(val) ((val) & 0xffff) |
9490ff27 KH |
247 | /* Used for OOM nofiier */ |
248 | #define OOM_CONTROL (0) | |
8c7c6e34 | 249 | |
70ddf637 AV |
250 | /* Some nice accessors for the vmpressure. */ |
251 | struct vmpressure *memcg_to_vmpressure(struct mem_cgroup *memcg) | |
252 | { | |
253 | if (!memcg) | |
254 | memcg = root_mem_cgroup; | |
255 | return &memcg->vmpressure; | |
256 | } | |
257 | ||
258 | struct cgroup_subsys_state *vmpressure_to_css(struct vmpressure *vmpr) | |
259 | { | |
260 | return &container_of(vmpr, struct mem_cgroup, vmpressure)->css; | |
261 | } | |
262 | ||
7ffc0edc MH |
263 | static inline bool mem_cgroup_is_root(struct mem_cgroup *memcg) |
264 | { | |
265 | return (memcg == root_mem_cgroup); | |
266 | } | |
267 | ||
127424c8 | 268 | #ifndef CONFIG_SLOB |
55007d84 | 269 | /* |
f7ce3190 | 270 | * This will be the memcg's index in each cache's ->memcg_params.memcg_caches. |
b8627835 LZ |
271 | * The main reason for not using cgroup id for this: |
272 | * this works better in sparse environments, where we have a lot of memcgs, | |
273 | * but only a few kmem-limited. Or also, if we have, for instance, 200 | |
274 | * memcgs, and none but the 200th is kmem-limited, we'd have to have a | |
275 | * 200 entry array for that. | |
55007d84 | 276 | * |
dbcf73e2 VD |
277 | * The current size of the caches array is stored in memcg_nr_cache_ids. It |
278 | * will double each time we have to increase it. | |
55007d84 | 279 | */ |
dbcf73e2 VD |
280 | static DEFINE_IDA(memcg_cache_ida); |
281 | int memcg_nr_cache_ids; | |
749c5415 | 282 | |
05257a1a VD |
283 | /* Protects memcg_nr_cache_ids */ |
284 | static DECLARE_RWSEM(memcg_cache_ids_sem); | |
285 | ||
286 | void memcg_get_cache_ids(void) | |
287 | { | |
288 | down_read(&memcg_cache_ids_sem); | |
289 | } | |
290 | ||
291 | void memcg_put_cache_ids(void) | |
292 | { | |
293 | up_read(&memcg_cache_ids_sem); | |
294 | } | |
295 | ||
55007d84 GC |
296 | /* |
297 | * MIN_SIZE is different than 1, because we would like to avoid going through | |
298 | * the alloc/free process all the time. In a small machine, 4 kmem-limited | |
299 | * cgroups is a reasonable guess. In the future, it could be a parameter or | |
300 | * tunable, but that is strictly not necessary. | |
301 | * | |
b8627835 | 302 | * MAX_SIZE should be as large as the number of cgrp_ids. Ideally, we could get |
55007d84 GC |
303 | * this constant directly from cgroup, but it is understandable that this is |
304 | * better kept as an internal representation in cgroup.c. In any case, the | |
b8627835 | 305 | * cgrp_id space is not getting any smaller, and we don't have to necessarily |
55007d84 GC |
306 | * increase ours as well if it increases. |
307 | */ | |
308 | #define MEMCG_CACHES_MIN_SIZE 4 | |
b8627835 | 309 | #define MEMCG_CACHES_MAX_SIZE MEM_CGROUP_ID_MAX |
55007d84 | 310 | |
d7f25f8a GC |
311 | /* |
312 | * A lot of the calls to the cache allocation functions are expected to be | |
313 | * inlined by the compiler. Since the calls to memcg_kmem_get_cache are | |
314 | * conditional to this static branch, we'll have to allow modules that does | |
315 | * kmem_cache_alloc and the such to see this symbol as well | |
316 | */ | |
ef12947c | 317 | DEFINE_STATIC_KEY_FALSE(memcg_kmem_enabled_key); |
d7f25f8a | 318 | EXPORT_SYMBOL(memcg_kmem_enabled_key); |
a8964b9b | 319 | |
127424c8 | 320 | #endif /* !CONFIG_SLOB */ |
a8964b9b | 321 | |
ad7fa852 TH |
322 | /** |
323 | * mem_cgroup_css_from_page - css of the memcg associated with a page | |
324 | * @page: page of interest | |
325 | * | |
326 | * If memcg is bound to the default hierarchy, css of the memcg associated | |
327 | * with @page is returned. The returned css remains associated with @page | |
328 | * until it is released. | |
329 | * | |
330 | * If memcg is bound to a traditional hierarchy, the css of root_mem_cgroup | |
331 | * is returned. | |
ad7fa852 TH |
332 | */ |
333 | struct cgroup_subsys_state *mem_cgroup_css_from_page(struct page *page) | |
334 | { | |
335 | struct mem_cgroup *memcg; | |
336 | ||
ad7fa852 TH |
337 | memcg = page->mem_cgroup; |
338 | ||
9e10a130 | 339 | if (!memcg || !cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
ad7fa852 TH |
340 | memcg = root_mem_cgroup; |
341 | ||
ad7fa852 TH |
342 | return &memcg->css; |
343 | } | |
344 | ||
2fc04524 VD |
345 | /** |
346 | * page_cgroup_ino - return inode number of the memcg a page is charged to | |
347 | * @page: the page | |
348 | * | |
349 | * Look up the closest online ancestor of the memory cgroup @page is charged to | |
350 | * and return its inode number or 0 if @page is not charged to any cgroup. It | |
351 | * is safe to call this function without holding a reference to @page. | |
352 | * | |
353 | * Note, this function is inherently racy, because there is nothing to prevent | |
354 | * the cgroup inode from getting torn down and potentially reallocated a moment | |
355 | * after page_cgroup_ino() returns, so it only should be used by callers that | |
356 | * do not care (such as procfs interfaces). | |
357 | */ | |
358 | ino_t page_cgroup_ino(struct page *page) | |
359 | { | |
360 | struct mem_cgroup *memcg; | |
361 | unsigned long ino = 0; | |
362 | ||
363 | rcu_read_lock(); | |
364 | memcg = READ_ONCE(page->mem_cgroup); | |
365 | while (memcg && !(memcg->css.flags & CSS_ONLINE)) | |
366 | memcg = parent_mem_cgroup(memcg); | |
367 | if (memcg) | |
368 | ino = cgroup_ino(memcg->css.cgroup); | |
369 | rcu_read_unlock(); | |
370 | return ino; | |
371 | } | |
372 | ||
ef8f2327 MG |
373 | static struct mem_cgroup_per_node * |
374 | mem_cgroup_page_nodeinfo(struct mem_cgroup *memcg, struct page *page) | |
f64c3f54 | 375 | { |
97a6c37b | 376 | int nid = page_to_nid(page); |
f64c3f54 | 377 | |
ef8f2327 | 378 | return memcg->nodeinfo[nid]; |
f64c3f54 BS |
379 | } |
380 | ||
ef8f2327 MG |
381 | static struct mem_cgroup_tree_per_node * |
382 | soft_limit_tree_node(int nid) | |
bb4cc1a8 | 383 | { |
ef8f2327 | 384 | return soft_limit_tree.rb_tree_per_node[nid]; |
bb4cc1a8 AM |
385 | } |
386 | ||
ef8f2327 | 387 | static struct mem_cgroup_tree_per_node * |
bb4cc1a8 AM |
388 | soft_limit_tree_from_page(struct page *page) |
389 | { | |
390 | int nid = page_to_nid(page); | |
bb4cc1a8 | 391 | |
ef8f2327 | 392 | return soft_limit_tree.rb_tree_per_node[nid]; |
bb4cc1a8 AM |
393 | } |
394 | ||
ef8f2327 MG |
395 | static void __mem_cgroup_insert_exceeded(struct mem_cgroup_per_node *mz, |
396 | struct mem_cgroup_tree_per_node *mctz, | |
3e32cb2e | 397 | unsigned long new_usage_in_excess) |
bb4cc1a8 AM |
398 | { |
399 | struct rb_node **p = &mctz->rb_root.rb_node; | |
400 | struct rb_node *parent = NULL; | |
ef8f2327 | 401 | struct mem_cgroup_per_node *mz_node; |
bb4cc1a8 AM |
402 | |
403 | if (mz->on_tree) | |
404 | return; | |
405 | ||
406 | mz->usage_in_excess = new_usage_in_excess; | |
407 | if (!mz->usage_in_excess) | |
408 | return; | |
409 | while (*p) { | |
410 | parent = *p; | |
ef8f2327 | 411 | mz_node = rb_entry(parent, struct mem_cgroup_per_node, |
bb4cc1a8 AM |
412 | tree_node); |
413 | if (mz->usage_in_excess < mz_node->usage_in_excess) | |
414 | p = &(*p)->rb_left; | |
415 | /* | |
416 | * We can't avoid mem cgroups that are over their soft | |
417 | * limit by the same amount | |
418 | */ | |
419 | else if (mz->usage_in_excess >= mz_node->usage_in_excess) | |
420 | p = &(*p)->rb_right; | |
421 | } | |
422 | rb_link_node(&mz->tree_node, parent, p); | |
423 | rb_insert_color(&mz->tree_node, &mctz->rb_root); | |
424 | mz->on_tree = true; | |
425 | } | |
426 | ||
ef8f2327 MG |
427 | static void __mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz, |
428 | struct mem_cgroup_tree_per_node *mctz) | |
bb4cc1a8 AM |
429 | { |
430 | if (!mz->on_tree) | |
431 | return; | |
432 | rb_erase(&mz->tree_node, &mctz->rb_root); | |
433 | mz->on_tree = false; | |
434 | } | |
435 | ||
ef8f2327 MG |
436 | static void mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz, |
437 | struct mem_cgroup_tree_per_node *mctz) | |
bb4cc1a8 | 438 | { |
0a31bc97 JW |
439 | unsigned long flags; |
440 | ||
441 | spin_lock_irqsave(&mctz->lock, flags); | |
cf2c8127 | 442 | __mem_cgroup_remove_exceeded(mz, mctz); |
0a31bc97 | 443 | spin_unlock_irqrestore(&mctz->lock, flags); |
bb4cc1a8 AM |
444 | } |
445 | ||
3e32cb2e JW |
446 | static unsigned long soft_limit_excess(struct mem_cgroup *memcg) |
447 | { | |
448 | unsigned long nr_pages = page_counter_read(&memcg->memory); | |
4db0c3c2 | 449 | unsigned long soft_limit = READ_ONCE(memcg->soft_limit); |
3e32cb2e JW |
450 | unsigned long excess = 0; |
451 | ||
452 | if (nr_pages > soft_limit) | |
453 | excess = nr_pages - soft_limit; | |
454 | ||
455 | return excess; | |
456 | } | |
bb4cc1a8 AM |
457 | |
458 | static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page) | |
459 | { | |
3e32cb2e | 460 | unsigned long excess; |
ef8f2327 MG |
461 | struct mem_cgroup_per_node *mz; |
462 | struct mem_cgroup_tree_per_node *mctz; | |
bb4cc1a8 | 463 | |
e231875b | 464 | mctz = soft_limit_tree_from_page(page); |
bb4cc1a8 AM |
465 | /* |
466 | * Necessary to update all ancestors when hierarchy is used. | |
467 | * because their event counter is not touched. | |
468 | */ | |
469 | for (; memcg; memcg = parent_mem_cgroup(memcg)) { | |
ef8f2327 | 470 | mz = mem_cgroup_page_nodeinfo(memcg, page); |
3e32cb2e | 471 | excess = soft_limit_excess(memcg); |
bb4cc1a8 AM |
472 | /* |
473 | * We have to update the tree if mz is on RB-tree or | |
474 | * mem is over its softlimit. | |
475 | */ | |
476 | if (excess || mz->on_tree) { | |
0a31bc97 JW |
477 | unsigned long flags; |
478 | ||
479 | spin_lock_irqsave(&mctz->lock, flags); | |
bb4cc1a8 AM |
480 | /* if on-tree, remove it */ |
481 | if (mz->on_tree) | |
cf2c8127 | 482 | __mem_cgroup_remove_exceeded(mz, mctz); |
bb4cc1a8 AM |
483 | /* |
484 | * Insert again. mz->usage_in_excess will be updated. | |
485 | * If excess is 0, no tree ops. | |
486 | */ | |
cf2c8127 | 487 | __mem_cgroup_insert_exceeded(mz, mctz, excess); |
0a31bc97 | 488 | spin_unlock_irqrestore(&mctz->lock, flags); |
bb4cc1a8 AM |
489 | } |
490 | } | |
491 | } | |
492 | ||
493 | static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg) | |
494 | { | |
ef8f2327 MG |
495 | struct mem_cgroup_tree_per_node *mctz; |
496 | struct mem_cgroup_per_node *mz; | |
497 | int nid; | |
bb4cc1a8 | 498 | |
e231875b | 499 | for_each_node(nid) { |
ef8f2327 MG |
500 | mz = mem_cgroup_nodeinfo(memcg, nid); |
501 | mctz = soft_limit_tree_node(nid); | |
502 | mem_cgroup_remove_exceeded(mz, mctz); | |
bb4cc1a8 AM |
503 | } |
504 | } | |
505 | ||
ef8f2327 MG |
506 | static struct mem_cgroup_per_node * |
507 | __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node *mctz) | |
bb4cc1a8 AM |
508 | { |
509 | struct rb_node *rightmost = NULL; | |
ef8f2327 | 510 | struct mem_cgroup_per_node *mz; |
bb4cc1a8 AM |
511 | |
512 | retry: | |
513 | mz = NULL; | |
514 | rightmost = rb_last(&mctz->rb_root); | |
515 | if (!rightmost) | |
516 | goto done; /* Nothing to reclaim from */ | |
517 | ||
ef8f2327 | 518 | mz = rb_entry(rightmost, struct mem_cgroup_per_node, tree_node); |
bb4cc1a8 AM |
519 | /* |
520 | * Remove the node now but someone else can add it back, | |
521 | * we will to add it back at the end of reclaim to its correct | |
522 | * position in the tree. | |
523 | */ | |
cf2c8127 | 524 | __mem_cgroup_remove_exceeded(mz, mctz); |
3e32cb2e | 525 | if (!soft_limit_excess(mz->memcg) || |
ec903c0c | 526 | !css_tryget_online(&mz->memcg->css)) |
bb4cc1a8 AM |
527 | goto retry; |
528 | done: | |
529 | return mz; | |
530 | } | |
531 | ||
ef8f2327 MG |
532 | static struct mem_cgroup_per_node * |
533 | mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node *mctz) | |
bb4cc1a8 | 534 | { |
ef8f2327 | 535 | struct mem_cgroup_per_node *mz; |
bb4cc1a8 | 536 | |
0a31bc97 | 537 | spin_lock_irq(&mctz->lock); |
bb4cc1a8 | 538 | mz = __mem_cgroup_largest_soft_limit_node(mctz); |
0a31bc97 | 539 | spin_unlock_irq(&mctz->lock); |
bb4cc1a8 AM |
540 | return mz; |
541 | } | |
542 | ||
711d3d2c | 543 | /* |
484ebb3b GT |
544 | * Return page count for single (non recursive) @memcg. |
545 | * | |
711d3d2c KH |
546 | * Implementation Note: reading percpu statistics for memcg. |
547 | * | |
548 | * Both of vmstat[] and percpu_counter has threshold and do periodic | |
549 | * synchronization to implement "quick" read. There are trade-off between | |
550 | * reading cost and precision of value. Then, we may have a chance to implement | |
484ebb3b | 551 | * a periodic synchronization of counter in memcg's counter. |
711d3d2c KH |
552 | * |
553 | * But this _read() function is used for user interface now. The user accounts | |
554 | * memory usage by memory cgroup and he _always_ requires exact value because | |
555 | * he accounts memory. Even if we provide quick-and-fuzzy read, we always | |
556 | * have to visit all online cpus and make sum. So, for now, unnecessary | |
557 | * synchronization is not implemented. (just implemented for cpu hotplug) | |
558 | * | |
559 | * If there are kernel internal actions which can make use of some not-exact | |
560 | * value, and reading all cpu value can be performance bottleneck in some | |
484ebb3b | 561 | * common workload, threshold and synchronization as vmstat[] should be |
711d3d2c KH |
562 | * implemented. |
563 | */ | |
484ebb3b GT |
564 | static unsigned long |
565 | mem_cgroup_read_stat(struct mem_cgroup *memcg, enum mem_cgroup_stat_index idx) | |
c62b1a3b | 566 | { |
7a159cc9 | 567 | long val = 0; |
c62b1a3b | 568 | int cpu; |
c62b1a3b | 569 | |
484ebb3b | 570 | /* Per-cpu values can be negative, use a signed accumulator */ |
733a572e | 571 | for_each_possible_cpu(cpu) |
c0ff4b85 | 572 | val += per_cpu(memcg->stat->count[idx], cpu); |
484ebb3b GT |
573 | /* |
574 | * Summing races with updates, so val may be negative. Avoid exposing | |
575 | * transient negative values. | |
576 | */ | |
577 | if (val < 0) | |
578 | val = 0; | |
c62b1a3b KH |
579 | return val; |
580 | } | |
581 | ||
c0ff4b85 | 582 | static unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg, |
e9f8974f JW |
583 | enum mem_cgroup_events_index idx) |
584 | { | |
585 | unsigned long val = 0; | |
586 | int cpu; | |
587 | ||
733a572e | 588 | for_each_possible_cpu(cpu) |
c0ff4b85 | 589 | val += per_cpu(memcg->stat->events[idx], cpu); |
e9f8974f JW |
590 | return val; |
591 | } | |
592 | ||
c0ff4b85 | 593 | static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg, |
b070e65c | 594 | struct page *page, |
f627c2f5 | 595 | bool compound, int nr_pages) |
d52aa412 | 596 | { |
b2402857 KH |
597 | /* |
598 | * Here, RSS means 'mapped anon' and anon's SwapCache. Shmem/tmpfs is | |
599 | * counted as CACHE even if it's on ANON LRU. | |
600 | */ | |
0a31bc97 | 601 | if (PageAnon(page)) |
b2402857 | 602 | __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_RSS], |
c0ff4b85 | 603 | nr_pages); |
d52aa412 | 604 | else |
b2402857 | 605 | __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_CACHE], |
c0ff4b85 | 606 | nr_pages); |
55e462b0 | 607 | |
f627c2f5 KS |
608 | if (compound) { |
609 | VM_BUG_ON_PAGE(!PageTransHuge(page), page); | |
b070e65c DR |
610 | __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_RSS_HUGE], |
611 | nr_pages); | |
f627c2f5 | 612 | } |
b070e65c | 613 | |
e401f176 KH |
614 | /* pagein of a big page is an event. So, ignore page size */ |
615 | if (nr_pages > 0) | |
c0ff4b85 | 616 | __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGIN]); |
3751d604 | 617 | else { |
c0ff4b85 | 618 | __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGOUT]); |
3751d604 KH |
619 | nr_pages = -nr_pages; /* for event */ |
620 | } | |
e401f176 | 621 | |
13114716 | 622 | __this_cpu_add(memcg->stat->nr_page_events, nr_pages); |
6d12e2d8 KH |
623 | } |
624 | ||
0a6b76dd VD |
625 | unsigned long mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg, |
626 | int nid, unsigned int lru_mask) | |
bb2a0de9 | 627 | { |
b4536f0c | 628 | struct lruvec *lruvec = mem_cgroup_lruvec(NODE_DATA(nid), memcg); |
e231875b | 629 | unsigned long nr = 0; |
ef8f2327 | 630 | enum lru_list lru; |
889976db | 631 | |
e231875b | 632 | VM_BUG_ON((unsigned)nid >= nr_node_ids); |
bb2a0de9 | 633 | |
ef8f2327 MG |
634 | for_each_lru(lru) { |
635 | if (!(BIT(lru) & lru_mask)) | |
636 | continue; | |
b4536f0c | 637 | nr += mem_cgroup_get_lru_size(lruvec, lru); |
e231875b JZ |
638 | } |
639 | return nr; | |
889976db | 640 | } |
bb2a0de9 | 641 | |
c0ff4b85 | 642 | static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg, |
bb2a0de9 | 643 | unsigned int lru_mask) |
6d12e2d8 | 644 | { |
e231875b | 645 | unsigned long nr = 0; |
889976db | 646 | int nid; |
6d12e2d8 | 647 | |
31aaea4a | 648 | for_each_node_state(nid, N_MEMORY) |
e231875b JZ |
649 | nr += mem_cgroup_node_nr_lru_pages(memcg, nid, lru_mask); |
650 | return nr; | |
d52aa412 KH |
651 | } |
652 | ||
f53d7ce3 JW |
653 | static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg, |
654 | enum mem_cgroup_events_target target) | |
7a159cc9 JW |
655 | { |
656 | unsigned long val, next; | |
657 | ||
13114716 | 658 | val = __this_cpu_read(memcg->stat->nr_page_events); |
4799401f | 659 | next = __this_cpu_read(memcg->stat->targets[target]); |
7a159cc9 | 660 | /* from time_after() in jiffies.h */ |
f53d7ce3 JW |
661 | if ((long)next - (long)val < 0) { |
662 | switch (target) { | |
663 | case MEM_CGROUP_TARGET_THRESH: | |
664 | next = val + THRESHOLDS_EVENTS_TARGET; | |
665 | break; | |
bb4cc1a8 AM |
666 | case MEM_CGROUP_TARGET_SOFTLIMIT: |
667 | next = val + SOFTLIMIT_EVENTS_TARGET; | |
668 | break; | |
f53d7ce3 JW |
669 | case MEM_CGROUP_TARGET_NUMAINFO: |
670 | next = val + NUMAINFO_EVENTS_TARGET; | |
671 | break; | |
672 | default: | |
673 | break; | |
674 | } | |
675 | __this_cpu_write(memcg->stat->targets[target], next); | |
676 | return true; | |
7a159cc9 | 677 | } |
f53d7ce3 | 678 | return false; |
d2265e6f KH |
679 | } |
680 | ||
681 | /* | |
682 | * Check events in order. | |
683 | * | |
684 | */ | |
c0ff4b85 | 685 | static void memcg_check_events(struct mem_cgroup *memcg, struct page *page) |
d2265e6f KH |
686 | { |
687 | /* threshold event is triggered in finer grain than soft limit */ | |
f53d7ce3 JW |
688 | if (unlikely(mem_cgroup_event_ratelimit(memcg, |
689 | MEM_CGROUP_TARGET_THRESH))) { | |
bb4cc1a8 | 690 | bool do_softlimit; |
82b3f2a7 | 691 | bool do_numainfo __maybe_unused; |
f53d7ce3 | 692 | |
bb4cc1a8 AM |
693 | do_softlimit = mem_cgroup_event_ratelimit(memcg, |
694 | MEM_CGROUP_TARGET_SOFTLIMIT); | |
f53d7ce3 JW |
695 | #if MAX_NUMNODES > 1 |
696 | do_numainfo = mem_cgroup_event_ratelimit(memcg, | |
697 | MEM_CGROUP_TARGET_NUMAINFO); | |
698 | #endif | |
c0ff4b85 | 699 | mem_cgroup_threshold(memcg); |
bb4cc1a8 AM |
700 | if (unlikely(do_softlimit)) |
701 | mem_cgroup_update_tree(memcg, page); | |
453a9bf3 | 702 | #if MAX_NUMNODES > 1 |
f53d7ce3 | 703 | if (unlikely(do_numainfo)) |
c0ff4b85 | 704 | atomic_inc(&memcg->numainfo_events); |
453a9bf3 | 705 | #endif |
0a31bc97 | 706 | } |
d2265e6f KH |
707 | } |
708 | ||
cf475ad2 | 709 | struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p) |
78fb7466 | 710 | { |
31a78f23 BS |
711 | /* |
712 | * mm_update_next_owner() may clear mm->owner to NULL | |
713 | * if it races with swapoff, page migration, etc. | |
714 | * So this can be called with p == NULL. | |
715 | */ | |
716 | if (unlikely(!p)) | |
717 | return NULL; | |
718 | ||
073219e9 | 719 | return mem_cgroup_from_css(task_css(p, memory_cgrp_id)); |
78fb7466 | 720 | } |
33398cf2 | 721 | EXPORT_SYMBOL(mem_cgroup_from_task); |
78fb7466 | 722 | |
df381975 | 723 | static struct mem_cgroup *get_mem_cgroup_from_mm(struct mm_struct *mm) |
54595fe2 | 724 | { |
c0ff4b85 | 725 | struct mem_cgroup *memcg = NULL; |
0b7f569e | 726 | |
54595fe2 KH |
727 | rcu_read_lock(); |
728 | do { | |
6f6acb00 MH |
729 | /* |
730 | * Page cache insertions can happen withou an | |
731 | * actual mm context, e.g. during disk probing | |
732 | * on boot, loopback IO, acct() writes etc. | |
733 | */ | |
734 | if (unlikely(!mm)) | |
df381975 | 735 | memcg = root_mem_cgroup; |
6f6acb00 MH |
736 | else { |
737 | memcg = mem_cgroup_from_task(rcu_dereference(mm->owner)); | |
738 | if (unlikely(!memcg)) | |
739 | memcg = root_mem_cgroup; | |
740 | } | |
ec903c0c | 741 | } while (!css_tryget_online(&memcg->css)); |
54595fe2 | 742 | rcu_read_unlock(); |
c0ff4b85 | 743 | return memcg; |
54595fe2 KH |
744 | } |
745 | ||
5660048c JW |
746 | /** |
747 | * mem_cgroup_iter - iterate over memory cgroup hierarchy | |
748 | * @root: hierarchy root | |
749 | * @prev: previously returned memcg, NULL on first invocation | |
750 | * @reclaim: cookie for shared reclaim walks, NULL for full walks | |
751 | * | |
752 | * Returns references to children of the hierarchy below @root, or | |
753 | * @root itself, or %NULL after a full round-trip. | |
754 | * | |
755 | * Caller must pass the return value in @prev on subsequent | |
756 | * invocations for reference counting, or use mem_cgroup_iter_break() | |
757 | * to cancel a hierarchy walk before the round-trip is complete. | |
758 | * | |
759 | * Reclaimers can specify a zone and a priority level in @reclaim to | |
760 | * divide up the memcgs in the hierarchy among all concurrent | |
761 | * reclaimers operating on the same zone and priority. | |
762 | */ | |
694fbc0f | 763 | struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root, |
5660048c | 764 | struct mem_cgroup *prev, |
694fbc0f | 765 | struct mem_cgroup_reclaim_cookie *reclaim) |
14067bb3 | 766 | { |
33398cf2 | 767 | struct mem_cgroup_reclaim_iter *uninitialized_var(iter); |
5ac8fb31 | 768 | struct cgroup_subsys_state *css = NULL; |
9f3a0d09 | 769 | struct mem_cgroup *memcg = NULL; |
5ac8fb31 | 770 | struct mem_cgroup *pos = NULL; |
711d3d2c | 771 | |
694fbc0f AM |
772 | if (mem_cgroup_disabled()) |
773 | return NULL; | |
5660048c | 774 | |
9f3a0d09 JW |
775 | if (!root) |
776 | root = root_mem_cgroup; | |
7d74b06f | 777 | |
9f3a0d09 | 778 | if (prev && !reclaim) |
5ac8fb31 | 779 | pos = prev; |
14067bb3 | 780 | |
9f3a0d09 JW |
781 | if (!root->use_hierarchy && root != root_mem_cgroup) { |
782 | if (prev) | |
5ac8fb31 | 783 | goto out; |
694fbc0f | 784 | return root; |
9f3a0d09 | 785 | } |
14067bb3 | 786 | |
542f85f9 | 787 | rcu_read_lock(); |
5f578161 | 788 | |
5ac8fb31 | 789 | if (reclaim) { |
ef8f2327 | 790 | struct mem_cgroup_per_node *mz; |
5ac8fb31 | 791 | |
ef8f2327 | 792 | mz = mem_cgroup_nodeinfo(root, reclaim->pgdat->node_id); |
5ac8fb31 JW |
793 | iter = &mz->iter[reclaim->priority]; |
794 | ||
795 | if (prev && reclaim->generation != iter->generation) | |
796 | goto out_unlock; | |
797 | ||
6df38689 | 798 | while (1) { |
4db0c3c2 | 799 | pos = READ_ONCE(iter->position); |
6df38689 VD |
800 | if (!pos || css_tryget(&pos->css)) |
801 | break; | |
5ac8fb31 | 802 | /* |
6df38689 VD |
803 | * css reference reached zero, so iter->position will |
804 | * be cleared by ->css_released. However, we should not | |
805 | * rely on this happening soon, because ->css_released | |
806 | * is called from a work queue, and by busy-waiting we | |
807 | * might block it. So we clear iter->position right | |
808 | * away. | |
5ac8fb31 | 809 | */ |
6df38689 VD |
810 | (void)cmpxchg(&iter->position, pos, NULL); |
811 | } | |
5ac8fb31 JW |
812 | } |
813 | ||
814 | if (pos) | |
815 | css = &pos->css; | |
816 | ||
817 | for (;;) { | |
818 | css = css_next_descendant_pre(css, &root->css); | |
819 | if (!css) { | |
820 | /* | |
821 | * Reclaimers share the hierarchy walk, and a | |
822 | * new one might jump in right at the end of | |
823 | * the hierarchy - make sure they see at least | |
824 | * one group and restart from the beginning. | |
825 | */ | |
826 | if (!prev) | |
827 | continue; | |
828 | break; | |
527a5ec9 | 829 | } |
7d74b06f | 830 | |
5ac8fb31 JW |
831 | /* |
832 | * Verify the css and acquire a reference. The root | |
833 | * is provided by the caller, so we know it's alive | |
834 | * and kicking, and don't take an extra reference. | |
835 | */ | |
836 | memcg = mem_cgroup_from_css(css); | |
14067bb3 | 837 | |
5ac8fb31 JW |
838 | if (css == &root->css) |
839 | break; | |
14067bb3 | 840 | |
0b8f73e1 JW |
841 | if (css_tryget(css)) |
842 | break; | |
9f3a0d09 | 843 | |
5ac8fb31 | 844 | memcg = NULL; |
9f3a0d09 | 845 | } |
5ac8fb31 JW |
846 | |
847 | if (reclaim) { | |
5ac8fb31 | 848 | /* |
6df38689 VD |
849 | * The position could have already been updated by a competing |
850 | * thread, so check that the value hasn't changed since we read | |
851 | * it to avoid reclaiming from the same cgroup twice. | |
5ac8fb31 | 852 | */ |
6df38689 VD |
853 | (void)cmpxchg(&iter->position, pos, memcg); |
854 | ||
5ac8fb31 JW |
855 | if (pos) |
856 | css_put(&pos->css); | |
857 | ||
858 | if (!memcg) | |
859 | iter->generation++; | |
860 | else if (!prev) | |
861 | reclaim->generation = iter->generation; | |
9f3a0d09 | 862 | } |
5ac8fb31 | 863 | |
542f85f9 MH |
864 | out_unlock: |
865 | rcu_read_unlock(); | |
5ac8fb31 | 866 | out: |
c40046f3 MH |
867 | if (prev && prev != root) |
868 | css_put(&prev->css); | |
869 | ||
9f3a0d09 | 870 | return memcg; |
14067bb3 | 871 | } |
7d74b06f | 872 | |
5660048c JW |
873 | /** |
874 | * mem_cgroup_iter_break - abort a hierarchy walk prematurely | |
875 | * @root: hierarchy root | |
876 | * @prev: last visited hierarchy member as returned by mem_cgroup_iter() | |
877 | */ | |
878 | void mem_cgroup_iter_break(struct mem_cgroup *root, | |
879 | struct mem_cgroup *prev) | |
9f3a0d09 JW |
880 | { |
881 | if (!root) | |
882 | root = root_mem_cgroup; | |
883 | if (prev && prev != root) | |
884 | css_put(&prev->css); | |
885 | } | |
7d74b06f | 886 | |
6df38689 VD |
887 | static void invalidate_reclaim_iterators(struct mem_cgroup *dead_memcg) |
888 | { | |
889 | struct mem_cgroup *memcg = dead_memcg; | |
890 | struct mem_cgroup_reclaim_iter *iter; | |
ef8f2327 MG |
891 | struct mem_cgroup_per_node *mz; |
892 | int nid; | |
6df38689 VD |
893 | int i; |
894 | ||
895 | while ((memcg = parent_mem_cgroup(memcg))) { | |
896 | for_each_node(nid) { | |
ef8f2327 MG |
897 | mz = mem_cgroup_nodeinfo(memcg, nid); |
898 | for (i = 0; i <= DEF_PRIORITY; i++) { | |
899 | iter = &mz->iter[i]; | |
900 | cmpxchg(&iter->position, | |
901 | dead_memcg, NULL); | |
6df38689 VD |
902 | } |
903 | } | |
904 | } | |
905 | } | |
906 | ||
9f3a0d09 JW |
907 | /* |
908 | * Iteration constructs for visiting all cgroups (under a tree). If | |
909 | * loops are exited prematurely (break), mem_cgroup_iter_break() must | |
910 | * be used for reference counting. | |
911 | */ | |
912 | #define for_each_mem_cgroup_tree(iter, root) \ | |
527a5ec9 | 913 | for (iter = mem_cgroup_iter(root, NULL, NULL); \ |
9f3a0d09 | 914 | iter != NULL; \ |
527a5ec9 | 915 | iter = mem_cgroup_iter(root, iter, NULL)) |
711d3d2c | 916 | |
9f3a0d09 | 917 | #define for_each_mem_cgroup(iter) \ |
527a5ec9 | 918 | for (iter = mem_cgroup_iter(NULL, NULL, NULL); \ |
9f3a0d09 | 919 | iter != NULL; \ |
527a5ec9 | 920 | iter = mem_cgroup_iter(NULL, iter, NULL)) |
14067bb3 | 921 | |
7c5f64f8 VD |
922 | /** |
923 | * mem_cgroup_scan_tasks - iterate over tasks of a memory cgroup hierarchy | |
924 | * @memcg: hierarchy root | |
925 | * @fn: function to call for each task | |
926 | * @arg: argument passed to @fn | |
927 | * | |
928 | * This function iterates over tasks attached to @memcg or to any of its | |
929 | * descendants and calls @fn for each task. If @fn returns a non-zero | |
930 | * value, the function breaks the iteration loop and returns the value. | |
931 | * Otherwise, it will iterate over all tasks and return 0. | |
932 | * | |
933 | * This function must not be called for the root memory cgroup. | |
934 | */ | |
935 | int mem_cgroup_scan_tasks(struct mem_cgroup *memcg, | |
936 | int (*fn)(struct task_struct *, void *), void *arg) | |
937 | { | |
938 | struct mem_cgroup *iter; | |
939 | int ret = 0; | |
940 | ||
941 | BUG_ON(memcg == root_mem_cgroup); | |
942 | ||
943 | for_each_mem_cgroup_tree(iter, memcg) { | |
944 | struct css_task_iter it; | |
945 | struct task_struct *task; | |
946 | ||
947 | css_task_iter_start(&iter->css, &it); | |
948 | while (!ret && (task = css_task_iter_next(&it))) | |
949 | ret = fn(task, arg); | |
950 | css_task_iter_end(&it); | |
951 | if (ret) { | |
952 | mem_cgroup_iter_break(memcg, iter); | |
953 | break; | |
954 | } | |
955 | } | |
956 | return ret; | |
957 | } | |
958 | ||
925b7673 | 959 | /** |
dfe0e773 | 960 | * mem_cgroup_page_lruvec - return lruvec for isolating/putting an LRU page |
925b7673 | 961 | * @page: the page |
fa9add64 | 962 | * @zone: zone of the page |
dfe0e773 JW |
963 | * |
964 | * This function is only safe when following the LRU page isolation | |
965 | * and putback protocol: the LRU lock must be held, and the page must | |
966 | * either be PageLRU() or the caller must have isolated/allocated it. | |
925b7673 | 967 | */ |
599d0c95 | 968 | struct lruvec *mem_cgroup_page_lruvec(struct page *page, struct pglist_data *pgdat) |
08e552c6 | 969 | { |
ef8f2327 | 970 | struct mem_cgroup_per_node *mz; |
925b7673 | 971 | struct mem_cgroup *memcg; |
bea8c150 | 972 | struct lruvec *lruvec; |
6d12e2d8 | 973 | |
bea8c150 | 974 | if (mem_cgroup_disabled()) { |
599d0c95 | 975 | lruvec = &pgdat->lruvec; |
bea8c150 HD |
976 | goto out; |
977 | } | |
925b7673 | 978 | |
1306a85a | 979 | memcg = page->mem_cgroup; |
7512102c | 980 | /* |
dfe0e773 | 981 | * Swapcache readahead pages are added to the LRU - and |
29833315 | 982 | * possibly migrated - before they are charged. |
7512102c | 983 | */ |
29833315 JW |
984 | if (!memcg) |
985 | memcg = root_mem_cgroup; | |
7512102c | 986 | |
ef8f2327 | 987 | mz = mem_cgroup_page_nodeinfo(memcg, page); |
bea8c150 HD |
988 | lruvec = &mz->lruvec; |
989 | out: | |
990 | /* | |
991 | * Since a node can be onlined after the mem_cgroup was created, | |
992 | * we have to be prepared to initialize lruvec->zone here; | |
993 | * and if offlined then reonlined, we need to reinitialize it. | |
994 | */ | |
599d0c95 MG |
995 | if (unlikely(lruvec->pgdat != pgdat)) |
996 | lruvec->pgdat = pgdat; | |
bea8c150 | 997 | return lruvec; |
08e552c6 | 998 | } |
b69408e8 | 999 | |
925b7673 | 1000 | /** |
fa9add64 HD |
1001 | * mem_cgroup_update_lru_size - account for adding or removing an lru page |
1002 | * @lruvec: mem_cgroup per zone lru vector | |
1003 | * @lru: index of lru list the page is sitting on | |
b4536f0c | 1004 | * @zid: zone id of the accounted pages |
fa9add64 | 1005 | * @nr_pages: positive when adding or negative when removing |
925b7673 | 1006 | * |
ca707239 HD |
1007 | * This function must be called under lru_lock, just before a page is added |
1008 | * to or just after a page is removed from an lru list (that ordering being | |
1009 | * so as to allow it to check that lru_size 0 is consistent with list_empty). | |
3f58a829 | 1010 | */ |
fa9add64 | 1011 | void mem_cgroup_update_lru_size(struct lruvec *lruvec, enum lru_list lru, |
b4536f0c | 1012 | int zid, int nr_pages) |
3f58a829 | 1013 | { |
ef8f2327 | 1014 | struct mem_cgroup_per_node *mz; |
fa9add64 | 1015 | unsigned long *lru_size; |
ca707239 | 1016 | long size; |
3f58a829 MK |
1017 | |
1018 | if (mem_cgroup_disabled()) | |
1019 | return; | |
1020 | ||
ef8f2327 | 1021 | mz = container_of(lruvec, struct mem_cgroup_per_node, lruvec); |
b4536f0c | 1022 | lru_size = &mz->lru_zone_size[zid][lru]; |
ca707239 HD |
1023 | |
1024 | if (nr_pages < 0) | |
1025 | *lru_size += nr_pages; | |
1026 | ||
1027 | size = *lru_size; | |
b4536f0c MH |
1028 | if (WARN_ONCE(size < 0, |
1029 | "%s(%p, %d, %d): lru_size %ld\n", | |
1030 | __func__, lruvec, lru, nr_pages, size)) { | |
ca707239 HD |
1031 | VM_BUG_ON(1); |
1032 | *lru_size = 0; | |
1033 | } | |
1034 | ||
1035 | if (nr_pages > 0) | |
1036 | *lru_size += nr_pages; | |
08e552c6 | 1037 | } |
544122e5 | 1038 | |
2314b42d | 1039 | bool task_in_mem_cgroup(struct task_struct *task, struct mem_cgroup *memcg) |
c3ac9a8a | 1040 | { |
2314b42d | 1041 | struct mem_cgroup *task_memcg; |
158e0a2d | 1042 | struct task_struct *p; |
ffbdccf5 | 1043 | bool ret; |
4c4a2214 | 1044 | |
158e0a2d | 1045 | p = find_lock_task_mm(task); |
de077d22 | 1046 | if (p) { |
2314b42d | 1047 | task_memcg = get_mem_cgroup_from_mm(p->mm); |
de077d22 DR |
1048 | task_unlock(p); |
1049 | } else { | |
1050 | /* | |
1051 | * All threads may have already detached their mm's, but the oom | |
1052 | * killer still needs to detect if they have already been oom | |
1053 | * killed to prevent needlessly killing additional tasks. | |
1054 | */ | |
ffbdccf5 | 1055 | rcu_read_lock(); |
2314b42d JW |
1056 | task_memcg = mem_cgroup_from_task(task); |
1057 | css_get(&task_memcg->css); | |
ffbdccf5 | 1058 | rcu_read_unlock(); |
de077d22 | 1059 | } |
2314b42d JW |
1060 | ret = mem_cgroup_is_descendant(task_memcg, memcg); |
1061 | css_put(&task_memcg->css); | |
4c4a2214 DR |
1062 | return ret; |
1063 | } | |
1064 | ||
19942822 | 1065 | /** |
9d11ea9f | 1066 | * mem_cgroup_margin - calculate chargeable space of a memory cgroup |
dad7557e | 1067 | * @memcg: the memory cgroup |
19942822 | 1068 | * |
9d11ea9f | 1069 | * Returns the maximum amount of memory @mem can be charged with, in |
7ec99d62 | 1070 | * pages. |
19942822 | 1071 | */ |
c0ff4b85 | 1072 | static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg) |
19942822 | 1073 | { |
3e32cb2e JW |
1074 | unsigned long margin = 0; |
1075 | unsigned long count; | |
1076 | unsigned long limit; | |
9d11ea9f | 1077 | |
3e32cb2e | 1078 | count = page_counter_read(&memcg->memory); |
4db0c3c2 | 1079 | limit = READ_ONCE(memcg->memory.limit); |
3e32cb2e JW |
1080 | if (count < limit) |
1081 | margin = limit - count; | |
1082 | ||
7941d214 | 1083 | if (do_memsw_account()) { |
3e32cb2e | 1084 | count = page_counter_read(&memcg->memsw); |
4db0c3c2 | 1085 | limit = READ_ONCE(memcg->memsw.limit); |
3e32cb2e JW |
1086 | if (count <= limit) |
1087 | margin = min(margin, limit - count); | |
cbedbac3 LR |
1088 | else |
1089 | margin = 0; | |
3e32cb2e JW |
1090 | } |
1091 | ||
1092 | return margin; | |
19942822 JW |
1093 | } |
1094 | ||
32047e2a | 1095 | /* |
bdcbb659 | 1096 | * A routine for checking "mem" is under move_account() or not. |
32047e2a | 1097 | * |
bdcbb659 QH |
1098 | * Checking a cgroup is mc.from or mc.to or under hierarchy of |
1099 | * moving cgroups. This is for waiting at high-memory pressure | |
1100 | * caused by "move". | |
32047e2a | 1101 | */ |
c0ff4b85 | 1102 | static bool mem_cgroup_under_move(struct mem_cgroup *memcg) |
4b534334 | 1103 | { |
2bd9bb20 KH |
1104 | struct mem_cgroup *from; |
1105 | struct mem_cgroup *to; | |
4b534334 | 1106 | bool ret = false; |
2bd9bb20 KH |
1107 | /* |
1108 | * Unlike task_move routines, we access mc.to, mc.from not under | |
1109 | * mutual exclusion by cgroup_mutex. Here, we take spinlock instead. | |
1110 | */ | |
1111 | spin_lock(&mc.lock); | |
1112 | from = mc.from; | |
1113 | to = mc.to; | |
1114 | if (!from) | |
1115 | goto unlock; | |
3e92041d | 1116 | |
2314b42d JW |
1117 | ret = mem_cgroup_is_descendant(from, memcg) || |
1118 | mem_cgroup_is_descendant(to, memcg); | |
2bd9bb20 KH |
1119 | unlock: |
1120 | spin_unlock(&mc.lock); | |
4b534334 KH |
1121 | return ret; |
1122 | } | |
1123 | ||
c0ff4b85 | 1124 | static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg) |
4b534334 KH |
1125 | { |
1126 | if (mc.moving_task && current != mc.moving_task) { | |
c0ff4b85 | 1127 | if (mem_cgroup_under_move(memcg)) { |
4b534334 KH |
1128 | DEFINE_WAIT(wait); |
1129 | prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE); | |
1130 | /* moving charge context might have finished. */ | |
1131 | if (mc.moving_task) | |
1132 | schedule(); | |
1133 | finish_wait(&mc.waitq, &wait); | |
1134 | return true; | |
1135 | } | |
1136 | } | |
1137 | return false; | |
1138 | } | |
1139 | ||
58cf188e | 1140 | #define K(x) ((x) << (PAGE_SHIFT-10)) |
e222432b | 1141 | /** |
58cf188e | 1142 | * mem_cgroup_print_oom_info: Print OOM information relevant to memory controller. |
e222432b BS |
1143 | * @memcg: The memory cgroup that went over limit |
1144 | * @p: Task that is going to be killed | |
1145 | * | |
1146 | * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is | |
1147 | * enabled | |
1148 | */ | |
1149 | void mem_cgroup_print_oom_info(struct mem_cgroup *memcg, struct task_struct *p) | |
1150 | { | |
58cf188e SZ |
1151 | struct mem_cgroup *iter; |
1152 | unsigned int i; | |
e222432b | 1153 | |
e222432b BS |
1154 | rcu_read_lock(); |
1155 | ||
2415b9f5 BV |
1156 | if (p) { |
1157 | pr_info("Task in "); | |
1158 | pr_cont_cgroup_path(task_cgroup(p, memory_cgrp_id)); | |
1159 | pr_cont(" killed as a result of limit of "); | |
1160 | } else { | |
1161 | pr_info("Memory limit reached of cgroup "); | |
1162 | } | |
1163 | ||
e61734c5 | 1164 | pr_cont_cgroup_path(memcg->css.cgroup); |
0346dadb | 1165 | pr_cont("\n"); |
e222432b | 1166 | |
e222432b BS |
1167 | rcu_read_unlock(); |
1168 | ||
3e32cb2e JW |
1169 | pr_info("memory: usage %llukB, limit %llukB, failcnt %lu\n", |
1170 | K((u64)page_counter_read(&memcg->memory)), | |
1171 | K((u64)memcg->memory.limit), memcg->memory.failcnt); | |
1172 | pr_info("memory+swap: usage %llukB, limit %llukB, failcnt %lu\n", | |
1173 | K((u64)page_counter_read(&memcg->memsw)), | |
1174 | K((u64)memcg->memsw.limit), memcg->memsw.failcnt); | |
1175 | pr_info("kmem: usage %llukB, limit %llukB, failcnt %lu\n", | |
1176 | K((u64)page_counter_read(&memcg->kmem)), | |
1177 | K((u64)memcg->kmem.limit), memcg->kmem.failcnt); | |
58cf188e SZ |
1178 | |
1179 | for_each_mem_cgroup_tree(iter, memcg) { | |
e61734c5 TH |
1180 | pr_info("Memory cgroup stats for "); |
1181 | pr_cont_cgroup_path(iter->css.cgroup); | |
58cf188e SZ |
1182 | pr_cont(":"); |
1183 | ||
1184 | for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) { | |
37e84351 | 1185 | if (i == MEM_CGROUP_STAT_SWAP && !do_swap_account) |
58cf188e | 1186 | continue; |
484ebb3b | 1187 | pr_cont(" %s:%luKB", mem_cgroup_stat_names[i], |
58cf188e SZ |
1188 | K(mem_cgroup_read_stat(iter, i))); |
1189 | } | |
1190 | ||
1191 | for (i = 0; i < NR_LRU_LISTS; i++) | |
1192 | pr_cont(" %s:%luKB", mem_cgroup_lru_names[i], | |
1193 | K(mem_cgroup_nr_lru_pages(iter, BIT(i)))); | |
1194 | ||
1195 | pr_cont("\n"); | |
1196 | } | |
e222432b BS |
1197 | } |
1198 | ||
81d39c20 KH |
1199 | /* |
1200 | * This function returns the number of memcg under hierarchy tree. Returns | |
1201 | * 1(self count) if no children. | |
1202 | */ | |
c0ff4b85 | 1203 | static int mem_cgroup_count_children(struct mem_cgroup *memcg) |
81d39c20 KH |
1204 | { |
1205 | int num = 0; | |
7d74b06f KH |
1206 | struct mem_cgroup *iter; |
1207 | ||
c0ff4b85 | 1208 | for_each_mem_cgroup_tree(iter, memcg) |
7d74b06f | 1209 | num++; |
81d39c20 KH |
1210 | return num; |
1211 | } | |
1212 | ||
a63d83f4 DR |
1213 | /* |
1214 | * Return the memory (and swap, if configured) limit for a memcg. | |
1215 | */ | |
7c5f64f8 | 1216 | unsigned long mem_cgroup_get_limit(struct mem_cgroup *memcg) |
a63d83f4 | 1217 | { |
3e32cb2e | 1218 | unsigned long limit; |
f3e8eb70 | 1219 | |
3e32cb2e | 1220 | limit = memcg->memory.limit; |
9a5a8f19 | 1221 | if (mem_cgroup_swappiness(memcg)) { |
3e32cb2e | 1222 | unsigned long memsw_limit; |
37e84351 | 1223 | unsigned long swap_limit; |
9a5a8f19 | 1224 | |
3e32cb2e | 1225 | memsw_limit = memcg->memsw.limit; |
37e84351 VD |
1226 | swap_limit = memcg->swap.limit; |
1227 | swap_limit = min(swap_limit, (unsigned long)total_swap_pages); | |
1228 | limit = min(limit + swap_limit, memsw_limit); | |
9a5a8f19 | 1229 | } |
9a5a8f19 | 1230 | return limit; |
a63d83f4 DR |
1231 | } |
1232 | ||
b6e6edcf | 1233 | static bool mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask, |
19965460 | 1234 | int order) |
9cbb78bb | 1235 | { |
6e0fc46d DR |
1236 | struct oom_control oc = { |
1237 | .zonelist = NULL, | |
1238 | .nodemask = NULL, | |
2a966b77 | 1239 | .memcg = memcg, |
6e0fc46d DR |
1240 | .gfp_mask = gfp_mask, |
1241 | .order = order, | |
6e0fc46d | 1242 | }; |
7c5f64f8 | 1243 | bool ret; |
9cbb78bb | 1244 | |
dc56401f | 1245 | mutex_lock(&oom_lock); |
7c5f64f8 | 1246 | ret = out_of_memory(&oc); |
dc56401f | 1247 | mutex_unlock(&oom_lock); |
7c5f64f8 | 1248 | return ret; |
9cbb78bb DR |
1249 | } |
1250 | ||
ae6e71d3 MC |
1251 | #if MAX_NUMNODES > 1 |
1252 | ||
4d0c066d KH |
1253 | /** |
1254 | * test_mem_cgroup_node_reclaimable | |
dad7557e | 1255 | * @memcg: the target memcg |
4d0c066d KH |
1256 | * @nid: the node ID to be checked. |
1257 | * @noswap : specify true here if the user wants flle only information. | |
1258 | * | |
1259 | * This function returns whether the specified memcg contains any | |
1260 | * reclaimable pages on a node. Returns true if there are any reclaimable | |
1261 | * pages in the node. | |
1262 | */ | |
c0ff4b85 | 1263 | static bool test_mem_cgroup_node_reclaimable(struct mem_cgroup *memcg, |
4d0c066d KH |
1264 | int nid, bool noswap) |
1265 | { | |
c0ff4b85 | 1266 | if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_FILE)) |
4d0c066d KH |
1267 | return true; |
1268 | if (noswap || !total_swap_pages) | |
1269 | return false; | |
c0ff4b85 | 1270 | if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_ANON)) |
4d0c066d KH |
1271 | return true; |
1272 | return false; | |
1273 | ||
1274 | } | |
889976db YH |
1275 | |
1276 | /* | |
1277 | * Always updating the nodemask is not very good - even if we have an empty | |
1278 | * list or the wrong list here, we can start from some node and traverse all | |
1279 | * nodes based on the zonelist. So update the list loosely once per 10 secs. | |
1280 | * | |
1281 | */ | |
c0ff4b85 | 1282 | static void mem_cgroup_may_update_nodemask(struct mem_cgroup *memcg) |
889976db YH |
1283 | { |
1284 | int nid; | |
453a9bf3 KH |
1285 | /* |
1286 | * numainfo_events > 0 means there was at least NUMAINFO_EVENTS_TARGET | |
1287 | * pagein/pageout changes since the last update. | |
1288 | */ | |
c0ff4b85 | 1289 | if (!atomic_read(&memcg->numainfo_events)) |
453a9bf3 | 1290 | return; |
c0ff4b85 | 1291 | if (atomic_inc_return(&memcg->numainfo_updating) > 1) |
889976db YH |
1292 | return; |
1293 | ||
889976db | 1294 | /* make a nodemask where this memcg uses memory from */ |
31aaea4a | 1295 | memcg->scan_nodes = node_states[N_MEMORY]; |
889976db | 1296 | |
31aaea4a | 1297 | for_each_node_mask(nid, node_states[N_MEMORY]) { |
889976db | 1298 | |
c0ff4b85 R |
1299 | if (!test_mem_cgroup_node_reclaimable(memcg, nid, false)) |
1300 | node_clear(nid, memcg->scan_nodes); | |
889976db | 1301 | } |
453a9bf3 | 1302 | |
c0ff4b85 R |
1303 | atomic_set(&memcg->numainfo_events, 0); |
1304 | atomic_set(&memcg->numainfo_updating, 0); | |
889976db YH |
1305 | } |
1306 | ||
1307 | /* | |
1308 | * Selecting a node where we start reclaim from. Because what we need is just | |
1309 | * reducing usage counter, start from anywhere is O,K. Considering | |
1310 | * memory reclaim from current node, there are pros. and cons. | |
1311 | * | |
1312 | * Freeing memory from current node means freeing memory from a node which | |
1313 | * we'll use or we've used. So, it may make LRU bad. And if several threads | |
1314 | * hit limits, it will see a contention on a node. But freeing from remote | |
1315 | * node means more costs for memory reclaim because of memory latency. | |
1316 | * | |
1317 | * Now, we use round-robin. Better algorithm is welcomed. | |
1318 | */ | |
c0ff4b85 | 1319 | int mem_cgroup_select_victim_node(struct mem_cgroup *memcg) |
889976db YH |
1320 | { |
1321 | int node; | |
1322 | ||
c0ff4b85 R |
1323 | mem_cgroup_may_update_nodemask(memcg); |
1324 | node = memcg->last_scanned_node; | |
889976db | 1325 | |
0edaf86c | 1326 | node = next_node_in(node, memcg->scan_nodes); |
889976db | 1327 | /* |
fda3d69b MH |
1328 | * mem_cgroup_may_update_nodemask might have seen no reclaimmable pages |
1329 | * last time it really checked all the LRUs due to rate limiting. | |
1330 | * Fallback to the current node in that case for simplicity. | |
889976db YH |
1331 | */ |
1332 | if (unlikely(node == MAX_NUMNODES)) | |
1333 | node = numa_node_id(); | |
1334 | ||
c0ff4b85 | 1335 | memcg->last_scanned_node = node; |
889976db YH |
1336 | return node; |
1337 | } | |
889976db | 1338 | #else |
c0ff4b85 | 1339 | int mem_cgroup_select_victim_node(struct mem_cgroup *memcg) |
889976db YH |
1340 | { |
1341 | return 0; | |
1342 | } | |
1343 | #endif | |
1344 | ||
0608f43d | 1345 | static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg, |
ef8f2327 | 1346 | pg_data_t *pgdat, |
0608f43d AM |
1347 | gfp_t gfp_mask, |
1348 | unsigned long *total_scanned) | |
1349 | { | |
1350 | struct mem_cgroup *victim = NULL; | |
1351 | int total = 0; | |
1352 | int loop = 0; | |
1353 | unsigned long excess; | |
1354 | unsigned long nr_scanned; | |
1355 | struct mem_cgroup_reclaim_cookie reclaim = { | |
ef8f2327 | 1356 | .pgdat = pgdat, |
0608f43d AM |
1357 | .priority = 0, |
1358 | }; | |
1359 | ||
3e32cb2e | 1360 | excess = soft_limit_excess(root_memcg); |
0608f43d AM |
1361 | |
1362 | while (1) { | |
1363 | victim = mem_cgroup_iter(root_memcg, victim, &reclaim); | |
1364 | if (!victim) { | |
1365 | loop++; | |
1366 | if (loop >= 2) { | |
1367 | /* | |
1368 | * If we have not been able to reclaim | |
1369 | * anything, it might because there are | |
1370 | * no reclaimable pages under this hierarchy | |
1371 | */ | |
1372 | if (!total) | |
1373 | break; | |
1374 | /* | |
1375 | * We want to do more targeted reclaim. | |
1376 | * excess >> 2 is not to excessive so as to | |
1377 | * reclaim too much, nor too less that we keep | |
1378 | * coming back to reclaim from this cgroup | |
1379 | */ | |
1380 | if (total >= (excess >> 2) || | |
1381 | (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS)) | |
1382 | break; | |
1383 | } | |
1384 | continue; | |
1385 | } | |
a9dd0a83 | 1386 | total += mem_cgroup_shrink_node(victim, gfp_mask, false, |
ef8f2327 | 1387 | pgdat, &nr_scanned); |
0608f43d | 1388 | *total_scanned += nr_scanned; |
3e32cb2e | 1389 | if (!soft_limit_excess(root_memcg)) |
0608f43d | 1390 | break; |
6d61ef40 | 1391 | } |
0608f43d AM |
1392 | mem_cgroup_iter_break(root_memcg, victim); |
1393 | return total; | |
6d61ef40 BS |
1394 | } |
1395 | ||
0056f4e6 JW |
1396 | #ifdef CONFIG_LOCKDEP |
1397 | static struct lockdep_map memcg_oom_lock_dep_map = { | |
1398 | .name = "memcg_oom_lock", | |
1399 | }; | |
1400 | #endif | |
1401 | ||
fb2a6fc5 JW |
1402 | static DEFINE_SPINLOCK(memcg_oom_lock); |
1403 | ||
867578cb KH |
1404 | /* |
1405 | * Check OOM-Killer is already running under our hierarchy. | |
1406 | * If someone is running, return false. | |
1407 | */ | |
fb2a6fc5 | 1408 | static bool mem_cgroup_oom_trylock(struct mem_cgroup *memcg) |
867578cb | 1409 | { |
79dfdacc | 1410 | struct mem_cgroup *iter, *failed = NULL; |
a636b327 | 1411 | |
fb2a6fc5 JW |
1412 | spin_lock(&memcg_oom_lock); |
1413 | ||
9f3a0d09 | 1414 | for_each_mem_cgroup_tree(iter, memcg) { |
23751be0 | 1415 | if (iter->oom_lock) { |
79dfdacc MH |
1416 | /* |
1417 | * this subtree of our hierarchy is already locked | |
1418 | * so we cannot give a lock. | |
1419 | */ | |
79dfdacc | 1420 | failed = iter; |
9f3a0d09 JW |
1421 | mem_cgroup_iter_break(memcg, iter); |
1422 | break; | |
23751be0 JW |
1423 | } else |
1424 | iter->oom_lock = true; | |
7d74b06f | 1425 | } |
867578cb | 1426 | |
fb2a6fc5 JW |
1427 | if (failed) { |
1428 | /* | |
1429 | * OK, we failed to lock the whole subtree so we have | |
1430 | * to clean up what we set up to the failing subtree | |
1431 | */ | |
1432 | for_each_mem_cgroup_tree(iter, memcg) { | |
1433 | if (iter == failed) { | |
1434 | mem_cgroup_iter_break(memcg, iter); | |
1435 | break; | |
1436 | } | |
1437 | iter->oom_lock = false; | |
79dfdacc | 1438 | } |
0056f4e6 JW |
1439 | } else |
1440 | mutex_acquire(&memcg_oom_lock_dep_map, 0, 1, _RET_IP_); | |
fb2a6fc5 JW |
1441 | |
1442 | spin_unlock(&memcg_oom_lock); | |
1443 | ||
1444 | return !failed; | |
a636b327 | 1445 | } |
0b7f569e | 1446 | |
fb2a6fc5 | 1447 | static void mem_cgroup_oom_unlock(struct mem_cgroup *memcg) |
0b7f569e | 1448 | { |
7d74b06f KH |
1449 | struct mem_cgroup *iter; |
1450 | ||
fb2a6fc5 | 1451 | spin_lock(&memcg_oom_lock); |
0056f4e6 | 1452 | mutex_release(&memcg_oom_lock_dep_map, 1, _RET_IP_); |
c0ff4b85 | 1453 | for_each_mem_cgroup_tree(iter, memcg) |
79dfdacc | 1454 | iter->oom_lock = false; |
fb2a6fc5 | 1455 | spin_unlock(&memcg_oom_lock); |
79dfdacc MH |
1456 | } |
1457 | ||
c0ff4b85 | 1458 | static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg) |
79dfdacc MH |
1459 | { |
1460 | struct mem_cgroup *iter; | |
1461 | ||
c2b42d3c | 1462 | spin_lock(&memcg_oom_lock); |
c0ff4b85 | 1463 | for_each_mem_cgroup_tree(iter, memcg) |
c2b42d3c TH |
1464 | iter->under_oom++; |
1465 | spin_unlock(&memcg_oom_lock); | |
79dfdacc MH |
1466 | } |
1467 | ||
c0ff4b85 | 1468 | static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg) |
79dfdacc MH |
1469 | { |
1470 | struct mem_cgroup *iter; | |
1471 | ||
867578cb KH |
1472 | /* |
1473 | * When a new child is created while the hierarchy is under oom, | |
c2b42d3c | 1474 | * mem_cgroup_oom_lock() may not be called. Watch for underflow. |
867578cb | 1475 | */ |
c2b42d3c | 1476 | spin_lock(&memcg_oom_lock); |
c0ff4b85 | 1477 | for_each_mem_cgroup_tree(iter, memcg) |
c2b42d3c TH |
1478 | if (iter->under_oom > 0) |
1479 | iter->under_oom--; | |
1480 | spin_unlock(&memcg_oom_lock); | |
0b7f569e KH |
1481 | } |
1482 | ||
867578cb KH |
1483 | static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq); |
1484 | ||
dc98df5a | 1485 | struct oom_wait_info { |
d79154bb | 1486 | struct mem_cgroup *memcg; |
dc98df5a KH |
1487 | wait_queue_t wait; |
1488 | }; | |
1489 | ||
1490 | static int memcg_oom_wake_function(wait_queue_t *wait, | |
1491 | unsigned mode, int sync, void *arg) | |
1492 | { | |
d79154bb HD |
1493 | struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg; |
1494 | struct mem_cgroup *oom_wait_memcg; | |
dc98df5a KH |
1495 | struct oom_wait_info *oom_wait_info; |
1496 | ||
1497 | oom_wait_info = container_of(wait, struct oom_wait_info, wait); | |
d79154bb | 1498 | oom_wait_memcg = oom_wait_info->memcg; |
dc98df5a | 1499 | |
2314b42d JW |
1500 | if (!mem_cgroup_is_descendant(wake_memcg, oom_wait_memcg) && |
1501 | !mem_cgroup_is_descendant(oom_wait_memcg, wake_memcg)) | |
dc98df5a | 1502 | return 0; |
dc98df5a KH |
1503 | return autoremove_wake_function(wait, mode, sync, arg); |
1504 | } | |
1505 | ||
c0ff4b85 | 1506 | static void memcg_oom_recover(struct mem_cgroup *memcg) |
3c11ecf4 | 1507 | { |
c2b42d3c TH |
1508 | /* |
1509 | * For the following lockless ->under_oom test, the only required | |
1510 | * guarantee is that it must see the state asserted by an OOM when | |
1511 | * this function is called as a result of userland actions | |
1512 | * triggered by the notification of the OOM. This is trivially | |
1513 | * achieved by invoking mem_cgroup_mark_under_oom() before | |
1514 | * triggering notification. | |
1515 | */ | |
1516 | if (memcg && memcg->under_oom) | |
f4b90b70 | 1517 | __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg); |
3c11ecf4 KH |
1518 | } |
1519 | ||
3812c8c8 | 1520 | static void mem_cgroup_oom(struct mem_cgroup *memcg, gfp_t mask, int order) |
0b7f569e | 1521 | { |
d0db7afa | 1522 | if (!current->memcg_may_oom) |
3812c8c8 | 1523 | return; |
867578cb | 1524 | /* |
49426420 JW |
1525 | * We are in the middle of the charge context here, so we |
1526 | * don't want to block when potentially sitting on a callstack | |
1527 | * that holds all kinds of filesystem and mm locks. | |
1528 | * | |
1529 | * Also, the caller may handle a failed allocation gracefully | |
1530 | * (like optional page cache readahead) and so an OOM killer | |
1531 | * invocation might not even be necessary. | |
1532 | * | |
1533 | * That's why we don't do anything here except remember the | |
1534 | * OOM context and then deal with it at the end of the page | |
1535 | * fault when the stack is unwound, the locks are released, | |
1536 | * and when we know whether the fault was overall successful. | |
867578cb | 1537 | */ |
49426420 | 1538 | css_get(&memcg->css); |
626ebc41 TH |
1539 | current->memcg_in_oom = memcg; |
1540 | current->memcg_oom_gfp_mask = mask; | |
1541 | current->memcg_oom_order = order; | |
3812c8c8 JW |
1542 | } |
1543 | ||
1544 | /** | |
1545 | * mem_cgroup_oom_synchronize - complete memcg OOM handling | |
49426420 | 1546 | * @handle: actually kill/wait or just clean up the OOM state |
3812c8c8 | 1547 | * |
49426420 JW |
1548 | * This has to be called at the end of a page fault if the memcg OOM |
1549 | * handler was enabled. | |
3812c8c8 | 1550 | * |
49426420 | 1551 | * Memcg supports userspace OOM handling where failed allocations must |
3812c8c8 JW |
1552 | * sleep on a waitqueue until the userspace task resolves the |
1553 | * situation. Sleeping directly in the charge context with all kinds | |
1554 | * of locks held is not a good idea, instead we remember an OOM state | |
1555 | * in the task and mem_cgroup_oom_synchronize() has to be called at | |
49426420 | 1556 | * the end of the page fault to complete the OOM handling. |
3812c8c8 JW |
1557 | * |
1558 | * Returns %true if an ongoing memcg OOM situation was detected and | |
49426420 | 1559 | * completed, %false otherwise. |
3812c8c8 | 1560 | */ |
49426420 | 1561 | bool mem_cgroup_oom_synchronize(bool handle) |
3812c8c8 | 1562 | { |
626ebc41 | 1563 | struct mem_cgroup *memcg = current->memcg_in_oom; |
3812c8c8 | 1564 | struct oom_wait_info owait; |
49426420 | 1565 | bool locked; |
3812c8c8 JW |
1566 | |
1567 | /* OOM is global, do not handle */ | |
3812c8c8 | 1568 | if (!memcg) |
49426420 | 1569 | return false; |
3812c8c8 | 1570 | |
7c5f64f8 | 1571 | if (!handle) |
49426420 | 1572 | goto cleanup; |
3812c8c8 JW |
1573 | |
1574 | owait.memcg = memcg; | |
1575 | owait.wait.flags = 0; | |
1576 | owait.wait.func = memcg_oom_wake_function; | |
1577 | owait.wait.private = current; | |
1578 | INIT_LIST_HEAD(&owait.wait.task_list); | |
867578cb | 1579 | |
3812c8c8 | 1580 | prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE); |
49426420 JW |
1581 | mem_cgroup_mark_under_oom(memcg); |
1582 | ||
1583 | locked = mem_cgroup_oom_trylock(memcg); | |
1584 | ||
1585 | if (locked) | |
1586 | mem_cgroup_oom_notify(memcg); | |
1587 | ||
1588 | if (locked && !memcg->oom_kill_disable) { | |
1589 | mem_cgroup_unmark_under_oom(memcg); | |
1590 | finish_wait(&memcg_oom_waitq, &owait.wait); | |
626ebc41 TH |
1591 | mem_cgroup_out_of_memory(memcg, current->memcg_oom_gfp_mask, |
1592 | current->memcg_oom_order); | |
49426420 | 1593 | } else { |
3812c8c8 | 1594 | schedule(); |
49426420 JW |
1595 | mem_cgroup_unmark_under_oom(memcg); |
1596 | finish_wait(&memcg_oom_waitq, &owait.wait); | |
1597 | } | |
1598 | ||
1599 | if (locked) { | |
fb2a6fc5 JW |
1600 | mem_cgroup_oom_unlock(memcg); |
1601 | /* | |
1602 | * There is no guarantee that an OOM-lock contender | |
1603 | * sees the wakeups triggered by the OOM kill | |
1604 | * uncharges. Wake any sleepers explicitely. | |
1605 | */ | |
1606 | memcg_oom_recover(memcg); | |
1607 | } | |
49426420 | 1608 | cleanup: |
626ebc41 | 1609 | current->memcg_in_oom = NULL; |
3812c8c8 | 1610 | css_put(&memcg->css); |
867578cb | 1611 | return true; |
0b7f569e KH |
1612 | } |
1613 | ||
d7365e78 | 1614 | /** |
81f8c3a4 JW |
1615 | * lock_page_memcg - lock a page->mem_cgroup binding |
1616 | * @page: the page | |
32047e2a | 1617 | * |
81f8c3a4 JW |
1618 | * This function protects unlocked LRU pages from being moved to |
1619 | * another cgroup and stabilizes their page->mem_cgroup binding. | |
d69b042f | 1620 | */ |
62cccb8c | 1621 | void lock_page_memcg(struct page *page) |
89c06bd5 KH |
1622 | { |
1623 | struct mem_cgroup *memcg; | |
6de22619 | 1624 | unsigned long flags; |
89c06bd5 | 1625 | |
6de22619 JW |
1626 | /* |
1627 | * The RCU lock is held throughout the transaction. The fast | |
1628 | * path can get away without acquiring the memcg->move_lock | |
1629 | * because page moving starts with an RCU grace period. | |
6de22619 | 1630 | */ |
d7365e78 JW |
1631 | rcu_read_lock(); |
1632 | ||
1633 | if (mem_cgroup_disabled()) | |
62cccb8c | 1634 | return; |
89c06bd5 | 1635 | again: |
1306a85a | 1636 | memcg = page->mem_cgroup; |
29833315 | 1637 | if (unlikely(!memcg)) |
62cccb8c | 1638 | return; |
d7365e78 | 1639 | |
bdcbb659 | 1640 | if (atomic_read(&memcg->moving_account) <= 0) |
62cccb8c | 1641 | return; |
89c06bd5 | 1642 | |
6de22619 | 1643 | spin_lock_irqsave(&memcg->move_lock, flags); |
1306a85a | 1644 | if (memcg != page->mem_cgroup) { |
6de22619 | 1645 | spin_unlock_irqrestore(&memcg->move_lock, flags); |
89c06bd5 KH |
1646 | goto again; |
1647 | } | |
6de22619 JW |
1648 | |
1649 | /* | |
1650 | * When charge migration first begins, we can have locked and | |
1651 | * unlocked page stat updates happening concurrently. Track | |
81f8c3a4 | 1652 | * the task who has the lock for unlock_page_memcg(). |
6de22619 JW |
1653 | */ |
1654 | memcg->move_lock_task = current; | |
1655 | memcg->move_lock_flags = flags; | |
d7365e78 | 1656 | |
62cccb8c | 1657 | return; |
89c06bd5 | 1658 | } |
81f8c3a4 | 1659 | EXPORT_SYMBOL(lock_page_memcg); |
89c06bd5 | 1660 | |
d7365e78 | 1661 | /** |
81f8c3a4 | 1662 | * unlock_page_memcg - unlock a page->mem_cgroup binding |
62cccb8c | 1663 | * @page: the page |
d7365e78 | 1664 | */ |
62cccb8c | 1665 | void unlock_page_memcg(struct page *page) |
89c06bd5 | 1666 | { |
62cccb8c JW |
1667 | struct mem_cgroup *memcg = page->mem_cgroup; |
1668 | ||
6de22619 JW |
1669 | if (memcg && memcg->move_lock_task == current) { |
1670 | unsigned long flags = memcg->move_lock_flags; | |
1671 | ||
1672 | memcg->move_lock_task = NULL; | |
1673 | memcg->move_lock_flags = 0; | |
1674 | ||
1675 | spin_unlock_irqrestore(&memcg->move_lock, flags); | |
1676 | } | |
89c06bd5 | 1677 | |
d7365e78 | 1678 | rcu_read_unlock(); |
89c06bd5 | 1679 | } |
81f8c3a4 | 1680 | EXPORT_SYMBOL(unlock_page_memcg); |
89c06bd5 | 1681 | |
cdec2e42 KH |
1682 | /* |
1683 | * size of first charge trial. "32" comes from vmscan.c's magic value. | |
1684 | * TODO: maybe necessary to use big numbers in big irons. | |
1685 | */ | |
7ec99d62 | 1686 | #define CHARGE_BATCH 32U |
cdec2e42 KH |
1687 | struct memcg_stock_pcp { |
1688 | struct mem_cgroup *cached; /* this never be root cgroup */ | |
11c9ea4e | 1689 | unsigned int nr_pages; |
cdec2e42 | 1690 | struct work_struct work; |
26fe6168 | 1691 | unsigned long flags; |
a0db00fc | 1692 | #define FLUSHING_CACHED_CHARGE 0 |
cdec2e42 KH |
1693 | }; |
1694 | static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock); | |
9f50fad6 | 1695 | static DEFINE_MUTEX(percpu_charge_mutex); |
cdec2e42 | 1696 | |
a0956d54 SS |
1697 | /** |
1698 | * consume_stock: Try to consume stocked charge on this cpu. | |
1699 | * @memcg: memcg to consume from. | |
1700 | * @nr_pages: how many pages to charge. | |
1701 | * | |
1702 | * The charges will only happen if @memcg matches the current cpu's memcg | |
1703 | * stock, and at least @nr_pages are available in that stock. Failure to | |
1704 | * service an allocation will refill the stock. | |
1705 | * | |
1706 | * returns true if successful, false otherwise. | |
cdec2e42 | 1707 | */ |
a0956d54 | 1708 | static bool consume_stock(struct mem_cgroup *memcg, unsigned int nr_pages) |
cdec2e42 KH |
1709 | { |
1710 | struct memcg_stock_pcp *stock; | |
db2ba40c | 1711 | unsigned long flags; |
3e32cb2e | 1712 | bool ret = false; |
cdec2e42 | 1713 | |
a0956d54 | 1714 | if (nr_pages > CHARGE_BATCH) |
3e32cb2e | 1715 | return ret; |
a0956d54 | 1716 | |
db2ba40c JW |
1717 | local_irq_save(flags); |
1718 | ||
1719 | stock = this_cpu_ptr(&memcg_stock); | |
3e32cb2e | 1720 | if (memcg == stock->cached && stock->nr_pages >= nr_pages) { |
a0956d54 | 1721 | stock->nr_pages -= nr_pages; |
3e32cb2e JW |
1722 | ret = true; |
1723 | } | |
db2ba40c JW |
1724 | |
1725 | local_irq_restore(flags); | |
1726 | ||
cdec2e42 KH |
1727 | return ret; |
1728 | } | |
1729 | ||
1730 | /* | |
3e32cb2e | 1731 | * Returns stocks cached in percpu and reset cached information. |
cdec2e42 KH |
1732 | */ |
1733 | static void drain_stock(struct memcg_stock_pcp *stock) | |
1734 | { | |
1735 | struct mem_cgroup *old = stock->cached; | |
1736 | ||
11c9ea4e | 1737 | if (stock->nr_pages) { |
3e32cb2e | 1738 | page_counter_uncharge(&old->memory, stock->nr_pages); |
7941d214 | 1739 | if (do_memsw_account()) |
3e32cb2e | 1740 | page_counter_uncharge(&old->memsw, stock->nr_pages); |
e8ea14cc | 1741 | css_put_many(&old->css, stock->nr_pages); |
11c9ea4e | 1742 | stock->nr_pages = 0; |
cdec2e42 KH |
1743 | } |
1744 | stock->cached = NULL; | |
cdec2e42 KH |
1745 | } |
1746 | ||
cdec2e42 KH |
1747 | static void drain_local_stock(struct work_struct *dummy) |
1748 | { | |
db2ba40c JW |
1749 | struct memcg_stock_pcp *stock; |
1750 | unsigned long flags; | |
1751 | ||
1752 | local_irq_save(flags); | |
1753 | ||
1754 | stock = this_cpu_ptr(&memcg_stock); | |
cdec2e42 | 1755 | drain_stock(stock); |
26fe6168 | 1756 | clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags); |
db2ba40c JW |
1757 | |
1758 | local_irq_restore(flags); | |
cdec2e42 KH |
1759 | } |
1760 | ||
1761 | /* | |
3e32cb2e | 1762 | * Cache charges(val) to local per_cpu area. |
320cc51d | 1763 | * This will be consumed by consume_stock() function, later. |
cdec2e42 | 1764 | */ |
c0ff4b85 | 1765 | static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages) |
cdec2e42 | 1766 | { |
db2ba40c JW |
1767 | struct memcg_stock_pcp *stock; |
1768 | unsigned long flags; | |
1769 | ||
1770 | local_irq_save(flags); | |
cdec2e42 | 1771 | |
db2ba40c | 1772 | stock = this_cpu_ptr(&memcg_stock); |
c0ff4b85 | 1773 | if (stock->cached != memcg) { /* reset if necessary */ |
cdec2e42 | 1774 | drain_stock(stock); |
c0ff4b85 | 1775 | stock->cached = memcg; |
cdec2e42 | 1776 | } |
11c9ea4e | 1777 | stock->nr_pages += nr_pages; |
db2ba40c JW |
1778 | |
1779 | local_irq_restore(flags); | |
cdec2e42 KH |
1780 | } |
1781 | ||
1782 | /* | |
c0ff4b85 | 1783 | * Drains all per-CPU charge caches for given root_memcg resp. subtree |
6d3d6aa2 | 1784 | * of the hierarchy under it. |
cdec2e42 | 1785 | */ |
6d3d6aa2 | 1786 | static void drain_all_stock(struct mem_cgroup *root_memcg) |
cdec2e42 | 1787 | { |
26fe6168 | 1788 | int cpu, curcpu; |
d38144b7 | 1789 | |
6d3d6aa2 JW |
1790 | /* If someone's already draining, avoid adding running more workers. */ |
1791 | if (!mutex_trylock(&percpu_charge_mutex)) | |
1792 | return; | |
cdec2e42 | 1793 | /* Notify other cpus that system-wide "drain" is running */ |
cdec2e42 | 1794 | get_online_cpus(); |
5af12d0e | 1795 | curcpu = get_cpu(); |
cdec2e42 KH |
1796 | for_each_online_cpu(cpu) { |
1797 | struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu); | |
c0ff4b85 | 1798 | struct mem_cgroup *memcg; |
26fe6168 | 1799 | |
c0ff4b85 R |
1800 | memcg = stock->cached; |
1801 | if (!memcg || !stock->nr_pages) | |
26fe6168 | 1802 | continue; |
2314b42d | 1803 | if (!mem_cgroup_is_descendant(memcg, root_memcg)) |
3e92041d | 1804 | continue; |
d1a05b69 MH |
1805 | if (!test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) { |
1806 | if (cpu == curcpu) | |
1807 | drain_local_stock(&stock->work); | |
1808 | else | |
1809 | schedule_work_on(cpu, &stock->work); | |
1810 | } | |
cdec2e42 | 1811 | } |
5af12d0e | 1812 | put_cpu(); |
f894ffa8 | 1813 | put_online_cpus(); |
9f50fad6 | 1814 | mutex_unlock(&percpu_charge_mutex); |
cdec2e42 KH |
1815 | } |
1816 | ||
308167fc | 1817 | static int memcg_hotplug_cpu_dead(unsigned int cpu) |
cdec2e42 | 1818 | { |
cdec2e42 KH |
1819 | struct memcg_stock_pcp *stock; |
1820 | ||
cdec2e42 KH |
1821 | stock = &per_cpu(memcg_stock, cpu); |
1822 | drain_stock(stock); | |
308167fc | 1823 | return 0; |
cdec2e42 KH |
1824 | } |
1825 | ||
f7e1cb6e JW |
1826 | static void reclaim_high(struct mem_cgroup *memcg, |
1827 | unsigned int nr_pages, | |
1828 | gfp_t gfp_mask) | |
1829 | { | |
1830 | do { | |
1831 | if (page_counter_read(&memcg->memory) <= memcg->high) | |
1832 | continue; | |
1833 | mem_cgroup_events(memcg, MEMCG_HIGH, 1); | |
1834 | try_to_free_mem_cgroup_pages(memcg, nr_pages, gfp_mask, true); | |
1835 | } while ((memcg = parent_mem_cgroup(memcg))); | |
1836 | } | |
1837 | ||
1838 | static void high_work_func(struct work_struct *work) | |
1839 | { | |
1840 | struct mem_cgroup *memcg; | |
1841 | ||
1842 | memcg = container_of(work, struct mem_cgroup, high_work); | |
1843 | reclaim_high(memcg, CHARGE_BATCH, GFP_KERNEL); | |
1844 | } | |
1845 | ||
b23afb93 TH |
1846 | /* |
1847 | * Scheduled by try_charge() to be executed from the userland return path | |
1848 | * and reclaims memory over the high limit. | |
1849 | */ | |
1850 | void mem_cgroup_handle_over_high(void) | |
1851 | { | |
1852 | unsigned int nr_pages = current->memcg_nr_pages_over_high; | |
f7e1cb6e | 1853 | struct mem_cgroup *memcg; |
b23afb93 TH |
1854 | |
1855 | if (likely(!nr_pages)) | |
1856 | return; | |
1857 | ||
f7e1cb6e JW |
1858 | memcg = get_mem_cgroup_from_mm(current->mm); |
1859 | reclaim_high(memcg, nr_pages, GFP_KERNEL); | |
b23afb93 TH |
1860 | css_put(&memcg->css); |
1861 | current->memcg_nr_pages_over_high = 0; | |
1862 | } | |
1863 | ||
00501b53 JW |
1864 | static int try_charge(struct mem_cgroup *memcg, gfp_t gfp_mask, |
1865 | unsigned int nr_pages) | |
8a9f3ccd | 1866 | { |
7ec99d62 | 1867 | unsigned int batch = max(CHARGE_BATCH, nr_pages); |
9b130619 | 1868 | int nr_retries = MEM_CGROUP_RECLAIM_RETRIES; |
6539cc05 | 1869 | struct mem_cgroup *mem_over_limit; |
3e32cb2e | 1870 | struct page_counter *counter; |
6539cc05 | 1871 | unsigned long nr_reclaimed; |
b70a2a21 JW |
1872 | bool may_swap = true; |
1873 | bool drained = false; | |
a636b327 | 1874 | |
ce00a967 | 1875 | if (mem_cgroup_is_root(memcg)) |
10d53c74 | 1876 | return 0; |
6539cc05 | 1877 | retry: |
b6b6cc72 | 1878 | if (consume_stock(memcg, nr_pages)) |
10d53c74 | 1879 | return 0; |
8a9f3ccd | 1880 | |
7941d214 | 1881 | if (!do_memsw_account() || |
6071ca52 JW |
1882 | page_counter_try_charge(&memcg->memsw, batch, &counter)) { |
1883 | if (page_counter_try_charge(&memcg->memory, batch, &counter)) | |
6539cc05 | 1884 | goto done_restock; |
7941d214 | 1885 | if (do_memsw_account()) |
3e32cb2e JW |
1886 | page_counter_uncharge(&memcg->memsw, batch); |
1887 | mem_over_limit = mem_cgroup_from_counter(counter, memory); | |
3fbe7244 | 1888 | } else { |
3e32cb2e | 1889 | mem_over_limit = mem_cgroup_from_counter(counter, memsw); |
b70a2a21 | 1890 | may_swap = false; |
3fbe7244 | 1891 | } |
7a81b88c | 1892 | |
6539cc05 JW |
1893 | if (batch > nr_pages) { |
1894 | batch = nr_pages; | |
1895 | goto retry; | |
1896 | } | |
6d61ef40 | 1897 | |
06b078fc JW |
1898 | /* |
1899 | * Unlike in global OOM situations, memcg is not in a physical | |
1900 | * memory shortage. Allow dying and OOM-killed tasks to | |
1901 | * bypass the last charges so that they can exit quickly and | |
1902 | * free their memory. | |
1903 | */ | |
1904 | if (unlikely(test_thread_flag(TIF_MEMDIE) || | |
1905 | fatal_signal_pending(current) || | |
1906 | current->flags & PF_EXITING)) | |
10d53c74 | 1907 | goto force; |
06b078fc | 1908 | |
89a28483 JW |
1909 | /* |
1910 | * Prevent unbounded recursion when reclaim operations need to | |
1911 | * allocate memory. This might exceed the limits temporarily, | |
1912 | * but we prefer facilitating memory reclaim and getting back | |
1913 | * under the limit over triggering OOM kills in these cases. | |
1914 | */ | |
1915 | if (unlikely(current->flags & PF_MEMALLOC)) | |
1916 | goto force; | |
1917 | ||
06b078fc JW |
1918 | if (unlikely(task_in_memcg_oom(current))) |
1919 | goto nomem; | |
1920 | ||
d0164adc | 1921 | if (!gfpflags_allow_blocking(gfp_mask)) |
6539cc05 | 1922 | goto nomem; |
4b534334 | 1923 | |
241994ed JW |
1924 | mem_cgroup_events(mem_over_limit, MEMCG_MAX, 1); |
1925 | ||
b70a2a21 JW |
1926 | nr_reclaimed = try_to_free_mem_cgroup_pages(mem_over_limit, nr_pages, |
1927 | gfp_mask, may_swap); | |
6539cc05 | 1928 | |
61e02c74 | 1929 | if (mem_cgroup_margin(mem_over_limit) >= nr_pages) |
6539cc05 | 1930 | goto retry; |
28c34c29 | 1931 | |
b70a2a21 | 1932 | if (!drained) { |
6d3d6aa2 | 1933 | drain_all_stock(mem_over_limit); |
b70a2a21 JW |
1934 | drained = true; |
1935 | goto retry; | |
1936 | } | |
1937 | ||
28c34c29 JW |
1938 | if (gfp_mask & __GFP_NORETRY) |
1939 | goto nomem; | |
6539cc05 JW |
1940 | /* |
1941 | * Even though the limit is exceeded at this point, reclaim | |
1942 | * may have been able to free some pages. Retry the charge | |
1943 | * before killing the task. | |
1944 | * | |
1945 | * Only for regular pages, though: huge pages are rather | |
1946 | * unlikely to succeed so close to the limit, and we fall back | |
1947 | * to regular pages anyway in case of failure. | |
1948 | */ | |
61e02c74 | 1949 | if (nr_reclaimed && nr_pages <= (1 << PAGE_ALLOC_COSTLY_ORDER)) |
6539cc05 JW |
1950 | goto retry; |
1951 | /* | |
1952 | * At task move, charge accounts can be doubly counted. So, it's | |
1953 | * better to wait until the end of task_move if something is going on. | |
1954 | */ | |
1955 | if (mem_cgroup_wait_acct_move(mem_over_limit)) | |
1956 | goto retry; | |
1957 | ||
9b130619 JW |
1958 | if (nr_retries--) |
1959 | goto retry; | |
1960 | ||
06b078fc | 1961 | if (gfp_mask & __GFP_NOFAIL) |
10d53c74 | 1962 | goto force; |
06b078fc | 1963 | |
6539cc05 | 1964 | if (fatal_signal_pending(current)) |
10d53c74 | 1965 | goto force; |
6539cc05 | 1966 | |
241994ed JW |
1967 | mem_cgroup_events(mem_over_limit, MEMCG_OOM, 1); |
1968 | ||
3608de07 JM |
1969 | mem_cgroup_oom(mem_over_limit, gfp_mask, |
1970 | get_order(nr_pages * PAGE_SIZE)); | |
7a81b88c | 1971 | nomem: |
6d1fdc48 | 1972 | if (!(gfp_mask & __GFP_NOFAIL)) |
3168ecbe | 1973 | return -ENOMEM; |
10d53c74 TH |
1974 | force: |
1975 | /* | |
1976 | * The allocation either can't fail or will lead to more memory | |
1977 | * being freed very soon. Allow memory usage go over the limit | |
1978 | * temporarily by force charging it. | |
1979 | */ | |
1980 | page_counter_charge(&memcg->memory, nr_pages); | |
7941d214 | 1981 | if (do_memsw_account()) |
10d53c74 TH |
1982 | page_counter_charge(&memcg->memsw, nr_pages); |
1983 | css_get_many(&memcg->css, nr_pages); | |
1984 | ||
1985 | return 0; | |
6539cc05 JW |
1986 | |
1987 | done_restock: | |
e8ea14cc | 1988 | css_get_many(&memcg->css, batch); |
6539cc05 JW |
1989 | if (batch > nr_pages) |
1990 | refill_stock(memcg, batch - nr_pages); | |
b23afb93 | 1991 | |
241994ed | 1992 | /* |
b23afb93 TH |
1993 | * If the hierarchy is above the normal consumption range, schedule |
1994 | * reclaim on returning to userland. We can perform reclaim here | |
71baba4b | 1995 | * if __GFP_RECLAIM but let's always punt for simplicity and so that |
b23afb93 TH |
1996 | * GFP_KERNEL can consistently be used during reclaim. @memcg is |
1997 | * not recorded as it most likely matches current's and won't | |
1998 | * change in the meantime. As high limit is checked again before | |
1999 | * reclaim, the cost of mismatch is negligible. | |
241994ed JW |
2000 | */ |
2001 | do { | |
b23afb93 | 2002 | if (page_counter_read(&memcg->memory) > memcg->high) { |
f7e1cb6e JW |
2003 | /* Don't bother a random interrupted task */ |
2004 | if (in_interrupt()) { | |
2005 | schedule_work(&memcg->high_work); | |
2006 | break; | |
2007 | } | |
9516a18a | 2008 | current->memcg_nr_pages_over_high += batch; |
b23afb93 TH |
2009 | set_notify_resume(current); |
2010 | break; | |
2011 | } | |
241994ed | 2012 | } while ((memcg = parent_mem_cgroup(memcg))); |
10d53c74 TH |
2013 | |
2014 | return 0; | |
7a81b88c | 2015 | } |
8a9f3ccd | 2016 | |
00501b53 | 2017 | static void cancel_charge(struct mem_cgroup *memcg, unsigned int nr_pages) |
a3032a2c | 2018 | { |
ce00a967 JW |
2019 | if (mem_cgroup_is_root(memcg)) |
2020 | return; | |
2021 | ||
3e32cb2e | 2022 | page_counter_uncharge(&memcg->memory, nr_pages); |
7941d214 | 2023 | if (do_memsw_account()) |
3e32cb2e | 2024 | page_counter_uncharge(&memcg->memsw, nr_pages); |
ce00a967 | 2025 | |
e8ea14cc | 2026 | css_put_many(&memcg->css, nr_pages); |
d01dd17f KH |
2027 | } |
2028 | ||
0a31bc97 JW |
2029 | static void lock_page_lru(struct page *page, int *isolated) |
2030 | { | |
2031 | struct zone *zone = page_zone(page); | |
2032 | ||
a52633d8 | 2033 | spin_lock_irq(zone_lru_lock(zone)); |
0a31bc97 JW |
2034 | if (PageLRU(page)) { |
2035 | struct lruvec *lruvec; | |
2036 | ||
599d0c95 | 2037 | lruvec = mem_cgroup_page_lruvec(page, zone->zone_pgdat); |
0a31bc97 JW |
2038 | ClearPageLRU(page); |
2039 | del_page_from_lru_list(page, lruvec, page_lru(page)); | |
2040 | *isolated = 1; | |
2041 | } else | |
2042 | *isolated = 0; | |
2043 | } | |
2044 | ||
2045 | static void unlock_page_lru(struct page *page, int isolated) | |
2046 | { | |
2047 | struct zone *zone = page_zone(page); | |
2048 | ||
2049 | if (isolated) { | |
2050 | struct lruvec *lruvec; | |
2051 | ||
599d0c95 | 2052 | lruvec = mem_cgroup_page_lruvec(page, zone->zone_pgdat); |
0a31bc97 JW |
2053 | VM_BUG_ON_PAGE(PageLRU(page), page); |
2054 | SetPageLRU(page); | |
2055 | add_page_to_lru_list(page, lruvec, page_lru(page)); | |
2056 | } | |
a52633d8 | 2057 | spin_unlock_irq(zone_lru_lock(zone)); |
0a31bc97 JW |
2058 | } |
2059 | ||
00501b53 | 2060 | static void commit_charge(struct page *page, struct mem_cgroup *memcg, |
6abb5a86 | 2061 | bool lrucare) |
7a81b88c | 2062 | { |
0a31bc97 | 2063 | int isolated; |
9ce70c02 | 2064 | |
1306a85a | 2065 | VM_BUG_ON_PAGE(page->mem_cgroup, page); |
9ce70c02 HD |
2066 | |
2067 | /* | |
2068 | * In some cases, SwapCache and FUSE(splice_buf->radixtree), the page | |
2069 | * may already be on some other mem_cgroup's LRU. Take care of it. | |
2070 | */ | |
0a31bc97 JW |
2071 | if (lrucare) |
2072 | lock_page_lru(page, &isolated); | |
9ce70c02 | 2073 | |
0a31bc97 JW |
2074 | /* |
2075 | * Nobody should be changing or seriously looking at | |
1306a85a | 2076 | * page->mem_cgroup at this point: |
0a31bc97 JW |
2077 | * |
2078 | * - the page is uncharged | |
2079 | * | |
2080 | * - the page is off-LRU | |
2081 | * | |
2082 | * - an anonymous fault has exclusive page access, except for | |
2083 | * a locked page table | |
2084 | * | |
2085 | * - a page cache insertion, a swapin fault, or a migration | |
2086 | * have the page locked | |
2087 | */ | |
1306a85a | 2088 | page->mem_cgroup = memcg; |
9ce70c02 | 2089 | |
0a31bc97 JW |
2090 | if (lrucare) |
2091 | unlock_page_lru(page, isolated); | |
7a81b88c | 2092 | } |
66e1707b | 2093 | |
127424c8 | 2094 | #ifndef CONFIG_SLOB |
f3bb3043 | 2095 | static int memcg_alloc_cache_id(void) |
55007d84 | 2096 | { |
f3bb3043 VD |
2097 | int id, size; |
2098 | int err; | |
2099 | ||
dbcf73e2 | 2100 | id = ida_simple_get(&memcg_cache_ida, |
f3bb3043 VD |
2101 | 0, MEMCG_CACHES_MAX_SIZE, GFP_KERNEL); |
2102 | if (id < 0) | |
2103 | return id; | |
55007d84 | 2104 | |
dbcf73e2 | 2105 | if (id < memcg_nr_cache_ids) |
f3bb3043 VD |
2106 | return id; |
2107 | ||
2108 | /* | |
2109 | * There's no space for the new id in memcg_caches arrays, | |
2110 | * so we have to grow them. | |
2111 | */ | |
05257a1a | 2112 | down_write(&memcg_cache_ids_sem); |
f3bb3043 VD |
2113 | |
2114 | size = 2 * (id + 1); | |
55007d84 GC |
2115 | if (size < MEMCG_CACHES_MIN_SIZE) |
2116 | size = MEMCG_CACHES_MIN_SIZE; | |
2117 | else if (size > MEMCG_CACHES_MAX_SIZE) | |
2118 | size = MEMCG_CACHES_MAX_SIZE; | |
2119 | ||
f3bb3043 | 2120 | err = memcg_update_all_caches(size); |
60d3fd32 VD |
2121 | if (!err) |
2122 | err = memcg_update_all_list_lrus(size); | |
05257a1a VD |
2123 | if (!err) |
2124 | memcg_nr_cache_ids = size; | |
2125 | ||
2126 | up_write(&memcg_cache_ids_sem); | |
2127 | ||
f3bb3043 | 2128 | if (err) { |
dbcf73e2 | 2129 | ida_simple_remove(&memcg_cache_ida, id); |
f3bb3043 VD |
2130 | return err; |
2131 | } | |
2132 | return id; | |
2133 | } | |
2134 | ||
2135 | static void memcg_free_cache_id(int id) | |
2136 | { | |
dbcf73e2 | 2137 | ida_simple_remove(&memcg_cache_ida, id); |
55007d84 GC |
2138 | } |
2139 | ||
d5b3cf71 | 2140 | struct memcg_kmem_cache_create_work { |
5722d094 VD |
2141 | struct mem_cgroup *memcg; |
2142 | struct kmem_cache *cachep; | |
2143 | struct work_struct work; | |
2144 | }; | |
2145 | ||
13583c3d VD |
2146 | static struct workqueue_struct *memcg_kmem_cache_create_wq; |
2147 | ||
d5b3cf71 | 2148 | static void memcg_kmem_cache_create_func(struct work_struct *w) |
d7f25f8a | 2149 | { |
d5b3cf71 VD |
2150 | struct memcg_kmem_cache_create_work *cw = |
2151 | container_of(w, struct memcg_kmem_cache_create_work, work); | |
5722d094 VD |
2152 | struct mem_cgroup *memcg = cw->memcg; |
2153 | struct kmem_cache *cachep = cw->cachep; | |
d7f25f8a | 2154 | |
d5b3cf71 | 2155 | memcg_create_kmem_cache(memcg, cachep); |
bd673145 | 2156 | |
5722d094 | 2157 | css_put(&memcg->css); |
d7f25f8a GC |
2158 | kfree(cw); |
2159 | } | |
2160 | ||
2161 | /* | |
2162 | * Enqueue the creation of a per-memcg kmem_cache. | |
d7f25f8a | 2163 | */ |
d5b3cf71 VD |
2164 | static void __memcg_schedule_kmem_cache_create(struct mem_cgroup *memcg, |
2165 | struct kmem_cache *cachep) | |
d7f25f8a | 2166 | { |
d5b3cf71 | 2167 | struct memcg_kmem_cache_create_work *cw; |
d7f25f8a | 2168 | |
776ed0f0 | 2169 | cw = kmalloc(sizeof(*cw), GFP_NOWAIT); |
8135be5a | 2170 | if (!cw) |
d7f25f8a | 2171 | return; |
8135be5a VD |
2172 | |
2173 | css_get(&memcg->css); | |
d7f25f8a GC |
2174 | |
2175 | cw->memcg = memcg; | |
2176 | cw->cachep = cachep; | |
d5b3cf71 | 2177 | INIT_WORK(&cw->work, memcg_kmem_cache_create_func); |
d7f25f8a | 2178 | |
13583c3d | 2179 | queue_work(memcg_kmem_cache_create_wq, &cw->work); |
d7f25f8a GC |
2180 | } |
2181 | ||
d5b3cf71 VD |
2182 | static void memcg_schedule_kmem_cache_create(struct mem_cgroup *memcg, |
2183 | struct kmem_cache *cachep) | |
0e9d92f2 GC |
2184 | { |
2185 | /* | |
2186 | * We need to stop accounting when we kmalloc, because if the | |
2187 | * corresponding kmalloc cache is not yet created, the first allocation | |
d5b3cf71 | 2188 | * in __memcg_schedule_kmem_cache_create will recurse. |
0e9d92f2 GC |
2189 | * |
2190 | * However, it is better to enclose the whole function. Depending on | |
2191 | * the debugging options enabled, INIT_WORK(), for instance, can | |
2192 | * trigger an allocation. This too, will make us recurse. Because at | |
2193 | * this point we can't allow ourselves back into memcg_kmem_get_cache, | |
2194 | * the safest choice is to do it like this, wrapping the whole function. | |
2195 | */ | |
6f185c29 | 2196 | current->memcg_kmem_skip_account = 1; |
d5b3cf71 | 2197 | __memcg_schedule_kmem_cache_create(memcg, cachep); |
6f185c29 | 2198 | current->memcg_kmem_skip_account = 0; |
0e9d92f2 | 2199 | } |
c67a8a68 | 2200 | |
45264778 VD |
2201 | static inline bool memcg_kmem_bypass(void) |
2202 | { | |
2203 | if (in_interrupt() || !current->mm || (current->flags & PF_KTHREAD)) | |
2204 | return true; | |
2205 | return false; | |
2206 | } | |
2207 | ||
2208 | /** | |
2209 | * memcg_kmem_get_cache: select the correct per-memcg cache for allocation | |
2210 | * @cachep: the original global kmem cache | |
2211 | * | |
d7f25f8a GC |
2212 | * Return the kmem_cache we're supposed to use for a slab allocation. |
2213 | * We try to use the current memcg's version of the cache. | |
2214 | * | |
45264778 VD |
2215 | * If the cache does not exist yet, if we are the first user of it, we |
2216 | * create it asynchronously in a workqueue and let the current allocation | |
2217 | * go through with the original cache. | |
d7f25f8a | 2218 | * |
45264778 VD |
2219 | * This function takes a reference to the cache it returns to assure it |
2220 | * won't get destroyed while we are working with it. Once the caller is | |
2221 | * done with it, memcg_kmem_put_cache() must be called to release the | |
2222 | * reference. | |
d7f25f8a | 2223 | */ |
45264778 | 2224 | struct kmem_cache *memcg_kmem_get_cache(struct kmem_cache *cachep) |
d7f25f8a GC |
2225 | { |
2226 | struct mem_cgroup *memcg; | |
959c8963 | 2227 | struct kmem_cache *memcg_cachep; |
2a4db7eb | 2228 | int kmemcg_id; |
d7f25f8a | 2229 | |
f7ce3190 | 2230 | VM_BUG_ON(!is_root_cache(cachep)); |
d7f25f8a | 2231 | |
45264778 | 2232 | if (memcg_kmem_bypass()) |
230e9fc2 VD |
2233 | return cachep; |
2234 | ||
9d100c5e | 2235 | if (current->memcg_kmem_skip_account) |
0e9d92f2 GC |
2236 | return cachep; |
2237 | ||
8135be5a | 2238 | memcg = get_mem_cgroup_from_mm(current->mm); |
4db0c3c2 | 2239 | kmemcg_id = READ_ONCE(memcg->kmemcg_id); |
2a4db7eb | 2240 | if (kmemcg_id < 0) |
ca0dde97 | 2241 | goto out; |
d7f25f8a | 2242 | |
2a4db7eb | 2243 | memcg_cachep = cache_from_memcg_idx(cachep, kmemcg_id); |
8135be5a VD |
2244 | if (likely(memcg_cachep)) |
2245 | return memcg_cachep; | |
ca0dde97 LZ |
2246 | |
2247 | /* | |
2248 | * If we are in a safe context (can wait, and not in interrupt | |
2249 | * context), we could be be predictable and return right away. | |
2250 | * This would guarantee that the allocation being performed | |
2251 | * already belongs in the new cache. | |
2252 | * | |
2253 | * However, there are some clashes that can arrive from locking. | |
2254 | * For instance, because we acquire the slab_mutex while doing | |
776ed0f0 VD |
2255 | * memcg_create_kmem_cache, this means no further allocation |
2256 | * could happen with the slab_mutex held. So it's better to | |
2257 | * defer everything. | |
ca0dde97 | 2258 | */ |
d5b3cf71 | 2259 | memcg_schedule_kmem_cache_create(memcg, cachep); |
ca0dde97 | 2260 | out: |
8135be5a | 2261 | css_put(&memcg->css); |
ca0dde97 | 2262 | return cachep; |
d7f25f8a | 2263 | } |
d7f25f8a | 2264 | |
45264778 VD |
2265 | /** |
2266 | * memcg_kmem_put_cache: drop reference taken by memcg_kmem_get_cache | |
2267 | * @cachep: the cache returned by memcg_kmem_get_cache | |
2268 | */ | |
2269 | void memcg_kmem_put_cache(struct kmem_cache *cachep) | |
8135be5a VD |
2270 | { |
2271 | if (!is_root_cache(cachep)) | |
f7ce3190 | 2272 | css_put(&cachep->memcg_params.memcg->css); |
8135be5a VD |
2273 | } |
2274 | ||
45264778 VD |
2275 | /** |
2276 | * memcg_kmem_charge: charge a kmem page | |
2277 | * @page: page to charge | |
2278 | * @gfp: reclaim mode | |
2279 | * @order: allocation order | |
2280 | * @memcg: memory cgroup to charge | |
2281 | * | |
2282 | * Returns 0 on success, an error code on failure. | |
2283 | */ | |
2284 | int memcg_kmem_charge_memcg(struct page *page, gfp_t gfp, int order, | |
2285 | struct mem_cgroup *memcg) | |
7ae1e1d0 | 2286 | { |
f3ccb2c4 VD |
2287 | unsigned int nr_pages = 1 << order; |
2288 | struct page_counter *counter; | |
7ae1e1d0 GC |
2289 | int ret; |
2290 | ||
f3ccb2c4 | 2291 | ret = try_charge(memcg, gfp, nr_pages); |
52c29b04 | 2292 | if (ret) |
f3ccb2c4 | 2293 | return ret; |
52c29b04 JW |
2294 | |
2295 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && | |
2296 | !page_counter_try_charge(&memcg->kmem, nr_pages, &counter)) { | |
2297 | cancel_charge(memcg, nr_pages); | |
2298 | return -ENOMEM; | |
7ae1e1d0 GC |
2299 | } |
2300 | ||
f3ccb2c4 | 2301 | page->mem_cgroup = memcg; |
7ae1e1d0 | 2302 | |
f3ccb2c4 | 2303 | return 0; |
7ae1e1d0 GC |
2304 | } |
2305 | ||
45264778 VD |
2306 | /** |
2307 | * memcg_kmem_charge: charge a kmem page to the current memory cgroup | |
2308 | * @page: page to charge | |
2309 | * @gfp: reclaim mode | |
2310 | * @order: allocation order | |
2311 | * | |
2312 | * Returns 0 on success, an error code on failure. | |
2313 | */ | |
2314 | int memcg_kmem_charge(struct page *page, gfp_t gfp, int order) | |
7ae1e1d0 | 2315 | { |
f3ccb2c4 | 2316 | struct mem_cgroup *memcg; |
fcff7d7e | 2317 | int ret = 0; |
7ae1e1d0 | 2318 | |
45264778 VD |
2319 | if (memcg_kmem_bypass()) |
2320 | return 0; | |
2321 | ||
f3ccb2c4 | 2322 | memcg = get_mem_cgroup_from_mm(current->mm); |
c4159a75 | 2323 | if (!mem_cgroup_is_root(memcg)) { |
45264778 | 2324 | ret = memcg_kmem_charge_memcg(page, gfp, order, memcg); |
c4159a75 VD |
2325 | if (!ret) |
2326 | __SetPageKmemcg(page); | |
2327 | } | |
7ae1e1d0 | 2328 | css_put(&memcg->css); |
d05e83a6 | 2329 | return ret; |
7ae1e1d0 | 2330 | } |
45264778 VD |
2331 | /** |
2332 | * memcg_kmem_uncharge: uncharge a kmem page | |
2333 | * @page: page to uncharge | |
2334 | * @order: allocation order | |
2335 | */ | |
2336 | void memcg_kmem_uncharge(struct page *page, int order) | |
7ae1e1d0 | 2337 | { |
1306a85a | 2338 | struct mem_cgroup *memcg = page->mem_cgroup; |
f3ccb2c4 | 2339 | unsigned int nr_pages = 1 << order; |
7ae1e1d0 | 2340 | |
7ae1e1d0 GC |
2341 | if (!memcg) |
2342 | return; | |
2343 | ||
309381fe | 2344 | VM_BUG_ON_PAGE(mem_cgroup_is_root(memcg), page); |
29833315 | 2345 | |
52c29b04 JW |
2346 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
2347 | page_counter_uncharge(&memcg->kmem, nr_pages); | |
2348 | ||
f3ccb2c4 | 2349 | page_counter_uncharge(&memcg->memory, nr_pages); |
7941d214 | 2350 | if (do_memsw_account()) |
f3ccb2c4 | 2351 | page_counter_uncharge(&memcg->memsw, nr_pages); |
60d3fd32 | 2352 | |
1306a85a | 2353 | page->mem_cgroup = NULL; |
c4159a75 VD |
2354 | |
2355 | /* slab pages do not have PageKmemcg flag set */ | |
2356 | if (PageKmemcg(page)) | |
2357 | __ClearPageKmemcg(page); | |
2358 | ||
f3ccb2c4 | 2359 | css_put_many(&memcg->css, nr_pages); |
60d3fd32 | 2360 | } |
127424c8 | 2361 | #endif /* !CONFIG_SLOB */ |
7ae1e1d0 | 2362 | |
ca3e0214 KH |
2363 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE |
2364 | ||
ca3e0214 KH |
2365 | /* |
2366 | * Because tail pages are not marked as "used", set it. We're under | |
a52633d8 | 2367 | * zone_lru_lock and migration entries setup in all page mappings. |
ca3e0214 | 2368 | */ |
e94c8a9c | 2369 | void mem_cgroup_split_huge_fixup(struct page *head) |
ca3e0214 | 2370 | { |
e94c8a9c | 2371 | int i; |
ca3e0214 | 2372 | |
3d37c4a9 KH |
2373 | if (mem_cgroup_disabled()) |
2374 | return; | |
b070e65c | 2375 | |
29833315 | 2376 | for (i = 1; i < HPAGE_PMD_NR; i++) |
1306a85a | 2377 | head[i].mem_cgroup = head->mem_cgroup; |
b9982f8d | 2378 | |
1306a85a | 2379 | __this_cpu_sub(head->mem_cgroup->stat->count[MEM_CGROUP_STAT_RSS_HUGE], |
b070e65c | 2380 | HPAGE_PMD_NR); |
ca3e0214 | 2381 | } |
12d27107 | 2382 | #endif /* CONFIG_TRANSPARENT_HUGEPAGE */ |
ca3e0214 | 2383 | |
c255a458 | 2384 | #ifdef CONFIG_MEMCG_SWAP |
0a31bc97 JW |
2385 | static void mem_cgroup_swap_statistics(struct mem_cgroup *memcg, |
2386 | bool charge) | |
d13d1443 | 2387 | { |
0a31bc97 JW |
2388 | int val = (charge) ? 1 : -1; |
2389 | this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_SWAP], val); | |
d13d1443 | 2390 | } |
02491447 DN |
2391 | |
2392 | /** | |
2393 | * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record. | |
2394 | * @entry: swap entry to be moved | |
2395 | * @from: mem_cgroup which the entry is moved from | |
2396 | * @to: mem_cgroup which the entry is moved to | |
2397 | * | |
2398 | * It succeeds only when the swap_cgroup's record for this entry is the same | |
2399 | * as the mem_cgroup's id of @from. | |
2400 | * | |
2401 | * Returns 0 on success, -EINVAL on failure. | |
2402 | * | |
3e32cb2e | 2403 | * The caller must have charged to @to, IOW, called page_counter_charge() about |
02491447 DN |
2404 | * both res and memsw, and called css_get(). |
2405 | */ | |
2406 | static int mem_cgroup_move_swap_account(swp_entry_t entry, | |
e91cbb42 | 2407 | struct mem_cgroup *from, struct mem_cgroup *to) |
02491447 DN |
2408 | { |
2409 | unsigned short old_id, new_id; | |
2410 | ||
34c00c31 LZ |
2411 | old_id = mem_cgroup_id(from); |
2412 | new_id = mem_cgroup_id(to); | |
02491447 DN |
2413 | |
2414 | if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) { | |
02491447 | 2415 | mem_cgroup_swap_statistics(from, false); |
483c30b5 | 2416 | mem_cgroup_swap_statistics(to, true); |
02491447 DN |
2417 | return 0; |
2418 | } | |
2419 | return -EINVAL; | |
2420 | } | |
2421 | #else | |
2422 | static inline int mem_cgroup_move_swap_account(swp_entry_t entry, | |
e91cbb42 | 2423 | struct mem_cgroup *from, struct mem_cgroup *to) |
02491447 DN |
2424 | { |
2425 | return -EINVAL; | |
2426 | } | |
8c7c6e34 | 2427 | #endif |
d13d1443 | 2428 | |
3e32cb2e | 2429 | static DEFINE_MUTEX(memcg_limit_mutex); |
f212ad7c | 2430 | |
d38d2a75 | 2431 | static int mem_cgroup_resize_limit(struct mem_cgroup *memcg, |
3e32cb2e | 2432 | unsigned long limit) |
628f4235 | 2433 | { |
3e32cb2e JW |
2434 | unsigned long curusage; |
2435 | unsigned long oldusage; | |
2436 | bool enlarge = false; | |
81d39c20 | 2437 | int retry_count; |
3e32cb2e | 2438 | int ret; |
81d39c20 KH |
2439 | |
2440 | /* | |
2441 | * For keeping hierarchical_reclaim simple, how long we should retry | |
2442 | * is depends on callers. We set our retry-count to be function | |
2443 | * of # of children which we should visit in this loop. | |
2444 | */ | |
3e32cb2e JW |
2445 | retry_count = MEM_CGROUP_RECLAIM_RETRIES * |
2446 | mem_cgroup_count_children(memcg); | |
81d39c20 | 2447 | |
3e32cb2e | 2448 | oldusage = page_counter_read(&memcg->memory); |
628f4235 | 2449 | |
3e32cb2e | 2450 | do { |
628f4235 KH |
2451 | if (signal_pending(current)) { |
2452 | ret = -EINTR; | |
2453 | break; | |
2454 | } | |
3e32cb2e JW |
2455 | |
2456 | mutex_lock(&memcg_limit_mutex); | |
2457 | if (limit > memcg->memsw.limit) { | |
2458 | mutex_unlock(&memcg_limit_mutex); | |
8c7c6e34 | 2459 | ret = -EINVAL; |
628f4235 KH |
2460 | break; |
2461 | } | |
3e32cb2e JW |
2462 | if (limit > memcg->memory.limit) |
2463 | enlarge = true; | |
2464 | ret = page_counter_limit(&memcg->memory, limit); | |
2465 | mutex_unlock(&memcg_limit_mutex); | |
8c7c6e34 KH |
2466 | |
2467 | if (!ret) | |
2468 | break; | |
2469 | ||
b70a2a21 JW |
2470 | try_to_free_mem_cgroup_pages(memcg, 1, GFP_KERNEL, true); |
2471 | ||
3e32cb2e | 2472 | curusage = page_counter_read(&memcg->memory); |
81d39c20 | 2473 | /* Usage is reduced ? */ |
f894ffa8 | 2474 | if (curusage >= oldusage) |
81d39c20 KH |
2475 | retry_count--; |
2476 | else | |
2477 | oldusage = curusage; | |
3e32cb2e JW |
2478 | } while (retry_count); |
2479 | ||
3c11ecf4 KH |
2480 | if (!ret && enlarge) |
2481 | memcg_oom_recover(memcg); | |
14797e23 | 2482 | |
8c7c6e34 KH |
2483 | return ret; |
2484 | } | |
2485 | ||
338c8431 | 2486 | static int mem_cgroup_resize_memsw_limit(struct mem_cgroup *memcg, |
3e32cb2e | 2487 | unsigned long limit) |
8c7c6e34 | 2488 | { |
3e32cb2e JW |
2489 | unsigned long curusage; |
2490 | unsigned long oldusage; | |
2491 | bool enlarge = false; | |
81d39c20 | 2492 | int retry_count; |
3e32cb2e | 2493 | int ret; |
8c7c6e34 | 2494 | |
81d39c20 | 2495 | /* see mem_cgroup_resize_res_limit */ |
3e32cb2e JW |
2496 | retry_count = MEM_CGROUP_RECLAIM_RETRIES * |
2497 | mem_cgroup_count_children(memcg); | |
2498 | ||
2499 | oldusage = page_counter_read(&memcg->memsw); | |
2500 | ||
2501 | do { | |
8c7c6e34 KH |
2502 | if (signal_pending(current)) { |
2503 | ret = -EINTR; | |
2504 | break; | |
2505 | } | |
3e32cb2e JW |
2506 | |
2507 | mutex_lock(&memcg_limit_mutex); | |
2508 | if (limit < memcg->memory.limit) { | |
2509 | mutex_unlock(&memcg_limit_mutex); | |
8c7c6e34 | 2510 | ret = -EINVAL; |
8c7c6e34 KH |
2511 | break; |
2512 | } | |
3e32cb2e JW |
2513 | if (limit > memcg->memsw.limit) |
2514 | enlarge = true; | |
2515 | ret = page_counter_limit(&memcg->memsw, limit); | |
2516 | mutex_unlock(&memcg_limit_mutex); | |
8c7c6e34 KH |
2517 | |
2518 | if (!ret) | |
2519 | break; | |
2520 | ||
b70a2a21 JW |
2521 | try_to_free_mem_cgroup_pages(memcg, 1, GFP_KERNEL, false); |
2522 | ||
3e32cb2e | 2523 | curusage = page_counter_read(&memcg->memsw); |
81d39c20 | 2524 | /* Usage is reduced ? */ |
8c7c6e34 | 2525 | if (curusage >= oldusage) |
628f4235 | 2526 | retry_count--; |
81d39c20 KH |
2527 | else |
2528 | oldusage = curusage; | |
3e32cb2e JW |
2529 | } while (retry_count); |
2530 | ||
3c11ecf4 KH |
2531 | if (!ret && enlarge) |
2532 | memcg_oom_recover(memcg); | |
3e32cb2e | 2533 | |
628f4235 KH |
2534 | return ret; |
2535 | } | |
2536 | ||
ef8f2327 | 2537 | unsigned long mem_cgroup_soft_limit_reclaim(pg_data_t *pgdat, int order, |
0608f43d AM |
2538 | gfp_t gfp_mask, |
2539 | unsigned long *total_scanned) | |
2540 | { | |
2541 | unsigned long nr_reclaimed = 0; | |
ef8f2327 | 2542 | struct mem_cgroup_per_node *mz, *next_mz = NULL; |
0608f43d AM |
2543 | unsigned long reclaimed; |
2544 | int loop = 0; | |
ef8f2327 | 2545 | struct mem_cgroup_tree_per_node *mctz; |
3e32cb2e | 2546 | unsigned long excess; |
0608f43d AM |
2547 | unsigned long nr_scanned; |
2548 | ||
2549 | if (order > 0) | |
2550 | return 0; | |
2551 | ||
ef8f2327 | 2552 | mctz = soft_limit_tree_node(pgdat->node_id); |
d6507ff5 MH |
2553 | |
2554 | /* | |
2555 | * Do not even bother to check the largest node if the root | |
2556 | * is empty. Do it lockless to prevent lock bouncing. Races | |
2557 | * are acceptable as soft limit is best effort anyway. | |
2558 | */ | |
2559 | if (RB_EMPTY_ROOT(&mctz->rb_root)) | |
2560 | return 0; | |
2561 | ||
0608f43d AM |
2562 | /* |
2563 | * This loop can run a while, specially if mem_cgroup's continuously | |
2564 | * keep exceeding their soft limit and putting the system under | |
2565 | * pressure | |
2566 | */ | |
2567 | do { | |
2568 | if (next_mz) | |
2569 | mz = next_mz; | |
2570 | else | |
2571 | mz = mem_cgroup_largest_soft_limit_node(mctz); | |
2572 | if (!mz) | |
2573 | break; | |
2574 | ||
2575 | nr_scanned = 0; | |
ef8f2327 | 2576 | reclaimed = mem_cgroup_soft_reclaim(mz->memcg, pgdat, |
0608f43d AM |
2577 | gfp_mask, &nr_scanned); |
2578 | nr_reclaimed += reclaimed; | |
2579 | *total_scanned += nr_scanned; | |
0a31bc97 | 2580 | spin_lock_irq(&mctz->lock); |
bc2f2e7f | 2581 | __mem_cgroup_remove_exceeded(mz, mctz); |
0608f43d AM |
2582 | |
2583 | /* | |
2584 | * If we failed to reclaim anything from this memory cgroup | |
2585 | * it is time to move on to the next cgroup | |
2586 | */ | |
2587 | next_mz = NULL; | |
bc2f2e7f VD |
2588 | if (!reclaimed) |
2589 | next_mz = __mem_cgroup_largest_soft_limit_node(mctz); | |
2590 | ||
3e32cb2e | 2591 | excess = soft_limit_excess(mz->memcg); |
0608f43d AM |
2592 | /* |
2593 | * One school of thought says that we should not add | |
2594 | * back the node to the tree if reclaim returns 0. | |
2595 | * But our reclaim could return 0, simply because due | |
2596 | * to priority we are exposing a smaller subset of | |
2597 | * memory to reclaim from. Consider this as a longer | |
2598 | * term TODO. | |
2599 | */ | |
2600 | /* If excess == 0, no tree ops */ | |
cf2c8127 | 2601 | __mem_cgroup_insert_exceeded(mz, mctz, excess); |
0a31bc97 | 2602 | spin_unlock_irq(&mctz->lock); |
0608f43d AM |
2603 | css_put(&mz->memcg->css); |
2604 | loop++; | |
2605 | /* | |
2606 | * Could not reclaim anything and there are no more | |
2607 | * mem cgroups to try or we seem to be looping without | |
2608 | * reclaiming anything. | |
2609 | */ | |
2610 | if (!nr_reclaimed && | |
2611 | (next_mz == NULL || | |
2612 | loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS)) | |
2613 | break; | |
2614 | } while (!nr_reclaimed); | |
2615 | if (next_mz) | |
2616 | css_put(&next_mz->memcg->css); | |
2617 | return nr_reclaimed; | |
2618 | } | |
2619 | ||
ea280e7b TH |
2620 | /* |
2621 | * Test whether @memcg has children, dead or alive. Note that this | |
2622 | * function doesn't care whether @memcg has use_hierarchy enabled and | |
2623 | * returns %true if there are child csses according to the cgroup | |
2624 | * hierarchy. Testing use_hierarchy is the caller's responsiblity. | |
2625 | */ | |
b5f99b53 GC |
2626 | static inline bool memcg_has_children(struct mem_cgroup *memcg) |
2627 | { | |
ea280e7b TH |
2628 | bool ret; |
2629 | ||
ea280e7b TH |
2630 | rcu_read_lock(); |
2631 | ret = css_next_child(NULL, &memcg->css); | |
2632 | rcu_read_unlock(); | |
2633 | return ret; | |
b5f99b53 GC |
2634 | } |
2635 | ||
c26251f9 | 2636 | /* |
51038171 | 2637 | * Reclaims as many pages from the given memcg as possible. |
c26251f9 MH |
2638 | * |
2639 | * Caller is responsible for holding css reference for memcg. | |
2640 | */ | |
2641 | static int mem_cgroup_force_empty(struct mem_cgroup *memcg) | |
2642 | { | |
2643 | int nr_retries = MEM_CGROUP_RECLAIM_RETRIES; | |
c26251f9 | 2644 | |
c1e862c1 KH |
2645 | /* we call try-to-free pages for make this cgroup empty */ |
2646 | lru_add_drain_all(); | |
f817ed48 | 2647 | /* try to free all pages in this cgroup */ |
3e32cb2e | 2648 | while (nr_retries && page_counter_read(&memcg->memory)) { |
f817ed48 | 2649 | int progress; |
c1e862c1 | 2650 | |
c26251f9 MH |
2651 | if (signal_pending(current)) |
2652 | return -EINTR; | |
2653 | ||
b70a2a21 JW |
2654 | progress = try_to_free_mem_cgroup_pages(memcg, 1, |
2655 | GFP_KERNEL, true); | |
c1e862c1 | 2656 | if (!progress) { |
f817ed48 | 2657 | nr_retries--; |
c1e862c1 | 2658 | /* maybe some writeback is necessary */ |
8aa7e847 | 2659 | congestion_wait(BLK_RW_ASYNC, HZ/10); |
c1e862c1 | 2660 | } |
f817ed48 KH |
2661 | |
2662 | } | |
ab5196c2 MH |
2663 | |
2664 | return 0; | |
cc847582 KH |
2665 | } |
2666 | ||
6770c64e TH |
2667 | static ssize_t mem_cgroup_force_empty_write(struct kernfs_open_file *of, |
2668 | char *buf, size_t nbytes, | |
2669 | loff_t off) | |
c1e862c1 | 2670 | { |
6770c64e | 2671 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); |
c26251f9 | 2672 | |
d8423011 MH |
2673 | if (mem_cgroup_is_root(memcg)) |
2674 | return -EINVAL; | |
6770c64e | 2675 | return mem_cgroup_force_empty(memcg) ?: nbytes; |
c1e862c1 KH |
2676 | } |
2677 | ||
182446d0 TH |
2678 | static u64 mem_cgroup_hierarchy_read(struct cgroup_subsys_state *css, |
2679 | struct cftype *cft) | |
18f59ea7 | 2680 | { |
182446d0 | 2681 | return mem_cgroup_from_css(css)->use_hierarchy; |
18f59ea7 BS |
2682 | } |
2683 | ||
182446d0 TH |
2684 | static int mem_cgroup_hierarchy_write(struct cgroup_subsys_state *css, |
2685 | struct cftype *cft, u64 val) | |
18f59ea7 BS |
2686 | { |
2687 | int retval = 0; | |
182446d0 | 2688 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
5c9d535b | 2689 | struct mem_cgroup *parent_memcg = mem_cgroup_from_css(memcg->css.parent); |
18f59ea7 | 2690 | |
567fb435 | 2691 | if (memcg->use_hierarchy == val) |
0b8f73e1 | 2692 | return 0; |
567fb435 | 2693 | |
18f59ea7 | 2694 | /* |
af901ca1 | 2695 | * If parent's use_hierarchy is set, we can't make any modifications |
18f59ea7 BS |
2696 | * in the child subtrees. If it is unset, then the change can |
2697 | * occur, provided the current cgroup has no children. | |
2698 | * | |
2699 | * For the root cgroup, parent_mem is NULL, we allow value to be | |
2700 | * set if there are no children. | |
2701 | */ | |
c0ff4b85 | 2702 | if ((!parent_memcg || !parent_memcg->use_hierarchy) && |
18f59ea7 | 2703 | (val == 1 || val == 0)) { |
ea280e7b | 2704 | if (!memcg_has_children(memcg)) |
c0ff4b85 | 2705 | memcg->use_hierarchy = val; |
18f59ea7 BS |
2706 | else |
2707 | retval = -EBUSY; | |
2708 | } else | |
2709 | retval = -EINVAL; | |
567fb435 | 2710 | |
18f59ea7 BS |
2711 | return retval; |
2712 | } | |
2713 | ||
72b54e73 | 2714 | static void tree_stat(struct mem_cgroup *memcg, unsigned long *stat) |
ce00a967 JW |
2715 | { |
2716 | struct mem_cgroup *iter; | |
72b54e73 | 2717 | int i; |
ce00a967 | 2718 | |
72b54e73 | 2719 | memset(stat, 0, sizeof(*stat) * MEMCG_NR_STAT); |
ce00a967 | 2720 | |
72b54e73 VD |
2721 | for_each_mem_cgroup_tree(iter, memcg) { |
2722 | for (i = 0; i < MEMCG_NR_STAT; i++) | |
2723 | stat[i] += mem_cgroup_read_stat(iter, i); | |
2724 | } | |
ce00a967 JW |
2725 | } |
2726 | ||
72b54e73 | 2727 | static void tree_events(struct mem_cgroup *memcg, unsigned long *events) |
587d9f72 JW |
2728 | { |
2729 | struct mem_cgroup *iter; | |
72b54e73 | 2730 | int i; |
587d9f72 | 2731 | |
72b54e73 | 2732 | memset(events, 0, sizeof(*events) * MEMCG_NR_EVENTS); |
587d9f72 | 2733 | |
72b54e73 VD |
2734 | for_each_mem_cgroup_tree(iter, memcg) { |
2735 | for (i = 0; i < MEMCG_NR_EVENTS; i++) | |
2736 | events[i] += mem_cgroup_read_events(iter, i); | |
2737 | } | |
587d9f72 JW |
2738 | } |
2739 | ||
6f646156 | 2740 | static unsigned long mem_cgroup_usage(struct mem_cgroup *memcg, bool swap) |
ce00a967 | 2741 | { |
72b54e73 | 2742 | unsigned long val = 0; |
ce00a967 | 2743 | |
3e32cb2e | 2744 | if (mem_cgroup_is_root(memcg)) { |
72b54e73 VD |
2745 | struct mem_cgroup *iter; |
2746 | ||
2747 | for_each_mem_cgroup_tree(iter, memcg) { | |
2748 | val += mem_cgroup_read_stat(iter, | |
2749 | MEM_CGROUP_STAT_CACHE); | |
2750 | val += mem_cgroup_read_stat(iter, | |
2751 | MEM_CGROUP_STAT_RSS); | |
2752 | if (swap) | |
2753 | val += mem_cgroup_read_stat(iter, | |
2754 | MEM_CGROUP_STAT_SWAP); | |
2755 | } | |
3e32cb2e | 2756 | } else { |
ce00a967 | 2757 | if (!swap) |
3e32cb2e | 2758 | val = page_counter_read(&memcg->memory); |
ce00a967 | 2759 | else |
3e32cb2e | 2760 | val = page_counter_read(&memcg->memsw); |
ce00a967 | 2761 | } |
c12176d3 | 2762 | return val; |
ce00a967 JW |
2763 | } |
2764 | ||
3e32cb2e JW |
2765 | enum { |
2766 | RES_USAGE, | |
2767 | RES_LIMIT, | |
2768 | RES_MAX_USAGE, | |
2769 | RES_FAILCNT, | |
2770 | RES_SOFT_LIMIT, | |
2771 | }; | |
ce00a967 | 2772 | |
791badbd | 2773 | static u64 mem_cgroup_read_u64(struct cgroup_subsys_state *css, |
05b84301 | 2774 | struct cftype *cft) |
8cdea7c0 | 2775 | { |
182446d0 | 2776 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
3e32cb2e | 2777 | struct page_counter *counter; |
af36f906 | 2778 | |
3e32cb2e | 2779 | switch (MEMFILE_TYPE(cft->private)) { |
8c7c6e34 | 2780 | case _MEM: |
3e32cb2e JW |
2781 | counter = &memcg->memory; |
2782 | break; | |
8c7c6e34 | 2783 | case _MEMSWAP: |
3e32cb2e JW |
2784 | counter = &memcg->memsw; |
2785 | break; | |
510fc4e1 | 2786 | case _KMEM: |
3e32cb2e | 2787 | counter = &memcg->kmem; |
510fc4e1 | 2788 | break; |
d55f90bf | 2789 | case _TCP: |
0db15298 | 2790 | counter = &memcg->tcpmem; |
d55f90bf | 2791 | break; |
8c7c6e34 KH |
2792 | default: |
2793 | BUG(); | |
8c7c6e34 | 2794 | } |
3e32cb2e JW |
2795 | |
2796 | switch (MEMFILE_ATTR(cft->private)) { | |
2797 | case RES_USAGE: | |
2798 | if (counter == &memcg->memory) | |
c12176d3 | 2799 | return (u64)mem_cgroup_usage(memcg, false) * PAGE_SIZE; |
3e32cb2e | 2800 | if (counter == &memcg->memsw) |
c12176d3 | 2801 | return (u64)mem_cgroup_usage(memcg, true) * PAGE_SIZE; |
3e32cb2e JW |
2802 | return (u64)page_counter_read(counter) * PAGE_SIZE; |
2803 | case RES_LIMIT: | |
2804 | return (u64)counter->limit * PAGE_SIZE; | |
2805 | case RES_MAX_USAGE: | |
2806 | return (u64)counter->watermark * PAGE_SIZE; | |
2807 | case RES_FAILCNT: | |
2808 | return counter->failcnt; | |
2809 | case RES_SOFT_LIMIT: | |
2810 | return (u64)memcg->soft_limit * PAGE_SIZE; | |
2811 | default: | |
2812 | BUG(); | |
2813 | } | |
8cdea7c0 | 2814 | } |
510fc4e1 | 2815 | |
127424c8 | 2816 | #ifndef CONFIG_SLOB |
567e9ab2 | 2817 | static int memcg_online_kmem(struct mem_cgroup *memcg) |
d6441637 | 2818 | { |
d6441637 VD |
2819 | int memcg_id; |
2820 | ||
b313aeee VD |
2821 | if (cgroup_memory_nokmem) |
2822 | return 0; | |
2823 | ||
2a4db7eb | 2824 | BUG_ON(memcg->kmemcg_id >= 0); |
567e9ab2 | 2825 | BUG_ON(memcg->kmem_state); |
d6441637 | 2826 | |
f3bb3043 | 2827 | memcg_id = memcg_alloc_cache_id(); |
0b8f73e1 JW |
2828 | if (memcg_id < 0) |
2829 | return memcg_id; | |
d6441637 | 2830 | |
ef12947c | 2831 | static_branch_inc(&memcg_kmem_enabled_key); |
d6441637 | 2832 | /* |
567e9ab2 | 2833 | * A memory cgroup is considered kmem-online as soon as it gets |
900a38f0 | 2834 | * kmemcg_id. Setting the id after enabling static branching will |
d6441637 VD |
2835 | * guarantee no one starts accounting before all call sites are |
2836 | * patched. | |
2837 | */ | |
900a38f0 | 2838 | memcg->kmemcg_id = memcg_id; |
567e9ab2 | 2839 | memcg->kmem_state = KMEM_ONLINE; |
bc2791f8 | 2840 | INIT_LIST_HEAD(&memcg->kmem_caches); |
0b8f73e1 JW |
2841 | |
2842 | return 0; | |
d6441637 VD |
2843 | } |
2844 | ||
8e0a8912 JW |
2845 | static void memcg_offline_kmem(struct mem_cgroup *memcg) |
2846 | { | |
2847 | struct cgroup_subsys_state *css; | |
2848 | struct mem_cgroup *parent, *child; | |
2849 | int kmemcg_id; | |
2850 | ||
2851 | if (memcg->kmem_state != KMEM_ONLINE) | |
2852 | return; | |
2853 | /* | |
2854 | * Clear the online state before clearing memcg_caches array | |
2855 | * entries. The slab_mutex in memcg_deactivate_kmem_caches() | |
2856 | * guarantees that no cache will be created for this cgroup | |
2857 | * after we are done (see memcg_create_kmem_cache()). | |
2858 | */ | |
2859 | memcg->kmem_state = KMEM_ALLOCATED; | |
2860 | ||
2861 | memcg_deactivate_kmem_caches(memcg); | |
2862 | ||
2863 | kmemcg_id = memcg->kmemcg_id; | |
2864 | BUG_ON(kmemcg_id < 0); | |
2865 | ||
2866 | parent = parent_mem_cgroup(memcg); | |
2867 | if (!parent) | |
2868 | parent = root_mem_cgroup; | |
2869 | ||
2870 | /* | |
2871 | * Change kmemcg_id of this cgroup and all its descendants to the | |
2872 | * parent's id, and then move all entries from this cgroup's list_lrus | |
2873 | * to ones of the parent. After we have finished, all list_lrus | |
2874 | * corresponding to this cgroup are guaranteed to remain empty. The | |
2875 | * ordering is imposed by list_lru_node->lock taken by | |
2876 | * memcg_drain_all_list_lrus(). | |
2877 | */ | |
3a06bb78 | 2878 | rcu_read_lock(); /* can be called from css_free w/o cgroup_mutex */ |
8e0a8912 JW |
2879 | css_for_each_descendant_pre(css, &memcg->css) { |
2880 | child = mem_cgroup_from_css(css); | |
2881 | BUG_ON(child->kmemcg_id != kmemcg_id); | |
2882 | child->kmemcg_id = parent->kmemcg_id; | |
2883 | if (!memcg->use_hierarchy) | |
2884 | break; | |
2885 | } | |
3a06bb78 TH |
2886 | rcu_read_unlock(); |
2887 | ||
8e0a8912 JW |
2888 | memcg_drain_all_list_lrus(kmemcg_id, parent->kmemcg_id); |
2889 | ||
2890 | memcg_free_cache_id(kmemcg_id); | |
2891 | } | |
2892 | ||
2893 | static void memcg_free_kmem(struct mem_cgroup *memcg) | |
2894 | { | |
0b8f73e1 JW |
2895 | /* css_alloc() failed, offlining didn't happen */ |
2896 | if (unlikely(memcg->kmem_state == KMEM_ONLINE)) | |
2897 | memcg_offline_kmem(memcg); | |
2898 | ||
8e0a8912 JW |
2899 | if (memcg->kmem_state == KMEM_ALLOCATED) { |
2900 | memcg_destroy_kmem_caches(memcg); | |
2901 | static_branch_dec(&memcg_kmem_enabled_key); | |
2902 | WARN_ON(page_counter_read(&memcg->kmem)); | |
2903 | } | |
8e0a8912 | 2904 | } |
d6441637 | 2905 | #else |
0b8f73e1 | 2906 | static int memcg_online_kmem(struct mem_cgroup *memcg) |
127424c8 JW |
2907 | { |
2908 | return 0; | |
2909 | } | |
2910 | static void memcg_offline_kmem(struct mem_cgroup *memcg) | |
2911 | { | |
2912 | } | |
2913 | static void memcg_free_kmem(struct mem_cgroup *memcg) | |
2914 | { | |
2915 | } | |
2916 | #endif /* !CONFIG_SLOB */ | |
2917 | ||
d6441637 | 2918 | static int memcg_update_kmem_limit(struct mem_cgroup *memcg, |
3e32cb2e | 2919 | unsigned long limit) |
d6441637 | 2920 | { |
b313aeee | 2921 | int ret; |
127424c8 JW |
2922 | |
2923 | mutex_lock(&memcg_limit_mutex); | |
127424c8 | 2924 | ret = page_counter_limit(&memcg->kmem, limit); |
127424c8 JW |
2925 | mutex_unlock(&memcg_limit_mutex); |
2926 | return ret; | |
d6441637 | 2927 | } |
510fc4e1 | 2928 | |
d55f90bf VD |
2929 | static int memcg_update_tcp_limit(struct mem_cgroup *memcg, unsigned long limit) |
2930 | { | |
2931 | int ret; | |
2932 | ||
2933 | mutex_lock(&memcg_limit_mutex); | |
2934 | ||
0db15298 | 2935 | ret = page_counter_limit(&memcg->tcpmem, limit); |
d55f90bf VD |
2936 | if (ret) |
2937 | goto out; | |
2938 | ||
0db15298 | 2939 | if (!memcg->tcpmem_active) { |
d55f90bf VD |
2940 | /* |
2941 | * The active flag needs to be written after the static_key | |
2942 | * update. This is what guarantees that the socket activation | |
2d758073 JW |
2943 | * function is the last one to run. See mem_cgroup_sk_alloc() |
2944 | * for details, and note that we don't mark any socket as | |
2945 | * belonging to this memcg until that flag is up. | |
d55f90bf VD |
2946 | * |
2947 | * We need to do this, because static_keys will span multiple | |
2948 | * sites, but we can't control their order. If we mark a socket | |
2949 | * as accounted, but the accounting functions are not patched in | |
2950 | * yet, we'll lose accounting. | |
2951 | * | |
2d758073 | 2952 | * We never race with the readers in mem_cgroup_sk_alloc(), |
d55f90bf VD |
2953 | * because when this value change, the code to process it is not |
2954 | * patched in yet. | |
2955 | */ | |
2956 | static_branch_inc(&memcg_sockets_enabled_key); | |
0db15298 | 2957 | memcg->tcpmem_active = true; |
d55f90bf VD |
2958 | } |
2959 | out: | |
2960 | mutex_unlock(&memcg_limit_mutex); | |
2961 | return ret; | |
2962 | } | |
d55f90bf | 2963 | |
628f4235 KH |
2964 | /* |
2965 | * The user of this function is... | |
2966 | * RES_LIMIT. | |
2967 | */ | |
451af504 TH |
2968 | static ssize_t mem_cgroup_write(struct kernfs_open_file *of, |
2969 | char *buf, size_t nbytes, loff_t off) | |
8cdea7c0 | 2970 | { |
451af504 | 2971 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); |
3e32cb2e | 2972 | unsigned long nr_pages; |
628f4235 KH |
2973 | int ret; |
2974 | ||
451af504 | 2975 | buf = strstrip(buf); |
650c5e56 | 2976 | ret = page_counter_memparse(buf, "-1", &nr_pages); |
3e32cb2e JW |
2977 | if (ret) |
2978 | return ret; | |
af36f906 | 2979 | |
3e32cb2e | 2980 | switch (MEMFILE_ATTR(of_cft(of)->private)) { |
628f4235 | 2981 | case RES_LIMIT: |
4b3bde4c BS |
2982 | if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */ |
2983 | ret = -EINVAL; | |
2984 | break; | |
2985 | } | |
3e32cb2e JW |
2986 | switch (MEMFILE_TYPE(of_cft(of)->private)) { |
2987 | case _MEM: | |
2988 | ret = mem_cgroup_resize_limit(memcg, nr_pages); | |
8c7c6e34 | 2989 | break; |
3e32cb2e JW |
2990 | case _MEMSWAP: |
2991 | ret = mem_cgroup_resize_memsw_limit(memcg, nr_pages); | |
296c81d8 | 2992 | break; |
3e32cb2e JW |
2993 | case _KMEM: |
2994 | ret = memcg_update_kmem_limit(memcg, nr_pages); | |
2995 | break; | |
d55f90bf VD |
2996 | case _TCP: |
2997 | ret = memcg_update_tcp_limit(memcg, nr_pages); | |
2998 | break; | |
3e32cb2e | 2999 | } |
296c81d8 | 3000 | break; |
3e32cb2e JW |
3001 | case RES_SOFT_LIMIT: |
3002 | memcg->soft_limit = nr_pages; | |
3003 | ret = 0; | |
628f4235 KH |
3004 | break; |
3005 | } | |
451af504 | 3006 | return ret ?: nbytes; |
8cdea7c0 BS |
3007 | } |
3008 | ||
6770c64e TH |
3009 | static ssize_t mem_cgroup_reset(struct kernfs_open_file *of, char *buf, |
3010 | size_t nbytes, loff_t off) | |
c84872e1 | 3011 | { |
6770c64e | 3012 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); |
3e32cb2e | 3013 | struct page_counter *counter; |
c84872e1 | 3014 | |
3e32cb2e JW |
3015 | switch (MEMFILE_TYPE(of_cft(of)->private)) { |
3016 | case _MEM: | |
3017 | counter = &memcg->memory; | |
3018 | break; | |
3019 | case _MEMSWAP: | |
3020 | counter = &memcg->memsw; | |
3021 | break; | |
3022 | case _KMEM: | |
3023 | counter = &memcg->kmem; | |
3024 | break; | |
d55f90bf | 3025 | case _TCP: |
0db15298 | 3026 | counter = &memcg->tcpmem; |
d55f90bf | 3027 | break; |
3e32cb2e JW |
3028 | default: |
3029 | BUG(); | |
3030 | } | |
af36f906 | 3031 | |
3e32cb2e | 3032 | switch (MEMFILE_ATTR(of_cft(of)->private)) { |
29f2a4da | 3033 | case RES_MAX_USAGE: |
3e32cb2e | 3034 | page_counter_reset_watermark(counter); |
29f2a4da PE |
3035 | break; |
3036 | case RES_FAILCNT: | |
3e32cb2e | 3037 | counter->failcnt = 0; |
29f2a4da | 3038 | break; |
3e32cb2e JW |
3039 | default: |
3040 | BUG(); | |
29f2a4da | 3041 | } |
f64c3f54 | 3042 | |
6770c64e | 3043 | return nbytes; |
c84872e1 PE |
3044 | } |
3045 | ||
182446d0 | 3046 | static u64 mem_cgroup_move_charge_read(struct cgroup_subsys_state *css, |
7dc74be0 DN |
3047 | struct cftype *cft) |
3048 | { | |
182446d0 | 3049 | return mem_cgroup_from_css(css)->move_charge_at_immigrate; |
7dc74be0 DN |
3050 | } |
3051 | ||
02491447 | 3052 | #ifdef CONFIG_MMU |
182446d0 | 3053 | static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css, |
7dc74be0 DN |
3054 | struct cftype *cft, u64 val) |
3055 | { | |
182446d0 | 3056 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
7dc74be0 | 3057 | |
1dfab5ab | 3058 | if (val & ~MOVE_MASK) |
7dc74be0 | 3059 | return -EINVAL; |
ee5e8472 | 3060 | |
7dc74be0 | 3061 | /* |
ee5e8472 GC |
3062 | * No kind of locking is needed in here, because ->can_attach() will |
3063 | * check this value once in the beginning of the process, and then carry | |
3064 | * on with stale data. This means that changes to this value will only | |
3065 | * affect task migrations starting after the change. | |
7dc74be0 | 3066 | */ |
c0ff4b85 | 3067 | memcg->move_charge_at_immigrate = val; |
7dc74be0 DN |
3068 | return 0; |
3069 | } | |
02491447 | 3070 | #else |
182446d0 | 3071 | static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css, |
02491447 DN |
3072 | struct cftype *cft, u64 val) |
3073 | { | |
3074 | return -ENOSYS; | |
3075 | } | |
3076 | #endif | |
7dc74be0 | 3077 | |
406eb0c9 | 3078 | #ifdef CONFIG_NUMA |
2da8ca82 | 3079 | static int memcg_numa_stat_show(struct seq_file *m, void *v) |
406eb0c9 | 3080 | { |
25485de6 GT |
3081 | struct numa_stat { |
3082 | const char *name; | |
3083 | unsigned int lru_mask; | |
3084 | }; | |
3085 | ||
3086 | static const struct numa_stat stats[] = { | |
3087 | { "total", LRU_ALL }, | |
3088 | { "file", LRU_ALL_FILE }, | |
3089 | { "anon", LRU_ALL_ANON }, | |
3090 | { "unevictable", BIT(LRU_UNEVICTABLE) }, | |
3091 | }; | |
3092 | const struct numa_stat *stat; | |
406eb0c9 | 3093 | int nid; |
25485de6 | 3094 | unsigned long nr; |
2da8ca82 | 3095 | struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m)); |
406eb0c9 | 3096 | |
25485de6 GT |
3097 | for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) { |
3098 | nr = mem_cgroup_nr_lru_pages(memcg, stat->lru_mask); | |
3099 | seq_printf(m, "%s=%lu", stat->name, nr); | |
3100 | for_each_node_state(nid, N_MEMORY) { | |
3101 | nr = mem_cgroup_node_nr_lru_pages(memcg, nid, | |
3102 | stat->lru_mask); | |
3103 | seq_printf(m, " N%d=%lu", nid, nr); | |
3104 | } | |
3105 | seq_putc(m, '\n'); | |
406eb0c9 | 3106 | } |
406eb0c9 | 3107 | |
071aee13 YH |
3108 | for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) { |
3109 | struct mem_cgroup *iter; | |
3110 | ||
3111 | nr = 0; | |
3112 | for_each_mem_cgroup_tree(iter, memcg) | |
3113 | nr += mem_cgroup_nr_lru_pages(iter, stat->lru_mask); | |
3114 | seq_printf(m, "hierarchical_%s=%lu", stat->name, nr); | |
3115 | for_each_node_state(nid, N_MEMORY) { | |
3116 | nr = 0; | |
3117 | for_each_mem_cgroup_tree(iter, memcg) | |
3118 | nr += mem_cgroup_node_nr_lru_pages( | |
3119 | iter, nid, stat->lru_mask); | |
3120 | seq_printf(m, " N%d=%lu", nid, nr); | |
3121 | } | |
3122 | seq_putc(m, '\n'); | |
406eb0c9 | 3123 | } |
406eb0c9 | 3124 | |
406eb0c9 YH |
3125 | return 0; |
3126 | } | |
3127 | #endif /* CONFIG_NUMA */ | |
3128 | ||
2da8ca82 | 3129 | static int memcg_stat_show(struct seq_file *m, void *v) |
d2ceb9b7 | 3130 | { |
2da8ca82 | 3131 | struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m)); |
3e32cb2e | 3132 | unsigned long memory, memsw; |
af7c4b0e JW |
3133 | struct mem_cgroup *mi; |
3134 | unsigned int i; | |
406eb0c9 | 3135 | |
0ca44b14 GT |
3136 | BUILD_BUG_ON(ARRAY_SIZE(mem_cgroup_stat_names) != |
3137 | MEM_CGROUP_STAT_NSTATS); | |
3138 | BUILD_BUG_ON(ARRAY_SIZE(mem_cgroup_events_names) != | |
3139 | MEM_CGROUP_EVENTS_NSTATS); | |
70bc068c RS |
3140 | BUILD_BUG_ON(ARRAY_SIZE(mem_cgroup_lru_names) != NR_LRU_LISTS); |
3141 | ||
af7c4b0e | 3142 | for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) { |
7941d214 | 3143 | if (i == MEM_CGROUP_STAT_SWAP && !do_memsw_account()) |
1dd3a273 | 3144 | continue; |
484ebb3b | 3145 | seq_printf(m, "%s %lu\n", mem_cgroup_stat_names[i], |
af7c4b0e | 3146 | mem_cgroup_read_stat(memcg, i) * PAGE_SIZE); |
1dd3a273 | 3147 | } |
7b854121 | 3148 | |
af7c4b0e JW |
3149 | for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) |
3150 | seq_printf(m, "%s %lu\n", mem_cgroup_events_names[i], | |
3151 | mem_cgroup_read_events(memcg, i)); | |
3152 | ||
3153 | for (i = 0; i < NR_LRU_LISTS; i++) | |
3154 | seq_printf(m, "%s %lu\n", mem_cgroup_lru_names[i], | |
3155 | mem_cgroup_nr_lru_pages(memcg, BIT(i)) * PAGE_SIZE); | |
3156 | ||
14067bb3 | 3157 | /* Hierarchical information */ |
3e32cb2e JW |
3158 | memory = memsw = PAGE_COUNTER_MAX; |
3159 | for (mi = memcg; mi; mi = parent_mem_cgroup(mi)) { | |
3160 | memory = min(memory, mi->memory.limit); | |
3161 | memsw = min(memsw, mi->memsw.limit); | |
fee7b548 | 3162 | } |
3e32cb2e JW |
3163 | seq_printf(m, "hierarchical_memory_limit %llu\n", |
3164 | (u64)memory * PAGE_SIZE); | |
7941d214 | 3165 | if (do_memsw_account()) |
3e32cb2e JW |
3166 | seq_printf(m, "hierarchical_memsw_limit %llu\n", |
3167 | (u64)memsw * PAGE_SIZE); | |
7f016ee8 | 3168 | |
af7c4b0e | 3169 | for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) { |
484ebb3b | 3170 | unsigned long long val = 0; |
af7c4b0e | 3171 | |
7941d214 | 3172 | if (i == MEM_CGROUP_STAT_SWAP && !do_memsw_account()) |
1dd3a273 | 3173 | continue; |
af7c4b0e JW |
3174 | for_each_mem_cgroup_tree(mi, memcg) |
3175 | val += mem_cgroup_read_stat(mi, i) * PAGE_SIZE; | |
484ebb3b | 3176 | seq_printf(m, "total_%s %llu\n", mem_cgroup_stat_names[i], val); |
af7c4b0e JW |
3177 | } |
3178 | ||
3179 | for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) { | |
3180 | unsigned long long val = 0; | |
3181 | ||
3182 | for_each_mem_cgroup_tree(mi, memcg) | |
3183 | val += mem_cgroup_read_events(mi, i); | |
3184 | seq_printf(m, "total_%s %llu\n", | |
3185 | mem_cgroup_events_names[i], val); | |
3186 | } | |
3187 | ||
3188 | for (i = 0; i < NR_LRU_LISTS; i++) { | |
3189 | unsigned long long val = 0; | |
3190 | ||
3191 | for_each_mem_cgroup_tree(mi, memcg) | |
3192 | val += mem_cgroup_nr_lru_pages(mi, BIT(i)) * PAGE_SIZE; | |
3193 | seq_printf(m, "total_%s %llu\n", mem_cgroup_lru_names[i], val); | |
1dd3a273 | 3194 | } |
14067bb3 | 3195 | |
7f016ee8 | 3196 | #ifdef CONFIG_DEBUG_VM |
7f016ee8 | 3197 | { |
ef8f2327 MG |
3198 | pg_data_t *pgdat; |
3199 | struct mem_cgroup_per_node *mz; | |
89abfab1 | 3200 | struct zone_reclaim_stat *rstat; |
7f016ee8 KM |
3201 | unsigned long recent_rotated[2] = {0, 0}; |
3202 | unsigned long recent_scanned[2] = {0, 0}; | |
3203 | ||
ef8f2327 MG |
3204 | for_each_online_pgdat(pgdat) { |
3205 | mz = mem_cgroup_nodeinfo(memcg, pgdat->node_id); | |
3206 | rstat = &mz->lruvec.reclaim_stat; | |
7f016ee8 | 3207 | |
ef8f2327 MG |
3208 | recent_rotated[0] += rstat->recent_rotated[0]; |
3209 | recent_rotated[1] += rstat->recent_rotated[1]; | |
3210 | recent_scanned[0] += rstat->recent_scanned[0]; | |
3211 | recent_scanned[1] += rstat->recent_scanned[1]; | |
3212 | } | |
78ccf5b5 JW |
3213 | seq_printf(m, "recent_rotated_anon %lu\n", recent_rotated[0]); |
3214 | seq_printf(m, "recent_rotated_file %lu\n", recent_rotated[1]); | |
3215 | seq_printf(m, "recent_scanned_anon %lu\n", recent_scanned[0]); | |
3216 | seq_printf(m, "recent_scanned_file %lu\n", recent_scanned[1]); | |
7f016ee8 KM |
3217 | } |
3218 | #endif | |
3219 | ||
d2ceb9b7 KH |
3220 | return 0; |
3221 | } | |
3222 | ||
182446d0 TH |
3223 | static u64 mem_cgroup_swappiness_read(struct cgroup_subsys_state *css, |
3224 | struct cftype *cft) | |
a7885eb8 | 3225 | { |
182446d0 | 3226 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
a7885eb8 | 3227 | |
1f4c025b | 3228 | return mem_cgroup_swappiness(memcg); |
a7885eb8 KM |
3229 | } |
3230 | ||
182446d0 TH |
3231 | static int mem_cgroup_swappiness_write(struct cgroup_subsys_state *css, |
3232 | struct cftype *cft, u64 val) | |
a7885eb8 | 3233 | { |
182446d0 | 3234 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
a7885eb8 | 3235 | |
3dae7fec | 3236 | if (val > 100) |
a7885eb8 KM |
3237 | return -EINVAL; |
3238 | ||
14208b0e | 3239 | if (css->parent) |
3dae7fec JW |
3240 | memcg->swappiness = val; |
3241 | else | |
3242 | vm_swappiness = val; | |
068b38c1 | 3243 | |
a7885eb8 KM |
3244 | return 0; |
3245 | } | |
3246 | ||
2e72b634 KS |
3247 | static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap) |
3248 | { | |
3249 | struct mem_cgroup_threshold_ary *t; | |
3e32cb2e | 3250 | unsigned long usage; |
2e72b634 KS |
3251 | int i; |
3252 | ||
3253 | rcu_read_lock(); | |
3254 | if (!swap) | |
2c488db2 | 3255 | t = rcu_dereference(memcg->thresholds.primary); |
2e72b634 | 3256 | else |
2c488db2 | 3257 | t = rcu_dereference(memcg->memsw_thresholds.primary); |
2e72b634 KS |
3258 | |
3259 | if (!t) | |
3260 | goto unlock; | |
3261 | ||
ce00a967 | 3262 | usage = mem_cgroup_usage(memcg, swap); |
2e72b634 KS |
3263 | |
3264 | /* | |
748dad36 | 3265 | * current_threshold points to threshold just below or equal to usage. |
2e72b634 KS |
3266 | * If it's not true, a threshold was crossed after last |
3267 | * call of __mem_cgroup_threshold(). | |
3268 | */ | |
5407a562 | 3269 | i = t->current_threshold; |
2e72b634 KS |
3270 | |
3271 | /* | |
3272 | * Iterate backward over array of thresholds starting from | |
3273 | * current_threshold and check if a threshold is crossed. | |
3274 | * If none of thresholds below usage is crossed, we read | |
3275 | * only one element of the array here. | |
3276 | */ | |
3277 | for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--) | |
3278 | eventfd_signal(t->entries[i].eventfd, 1); | |
3279 | ||
3280 | /* i = current_threshold + 1 */ | |
3281 | i++; | |
3282 | ||
3283 | /* | |
3284 | * Iterate forward over array of thresholds starting from | |
3285 | * current_threshold+1 and check if a threshold is crossed. | |
3286 | * If none of thresholds above usage is crossed, we read | |
3287 | * only one element of the array here. | |
3288 | */ | |
3289 | for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++) | |
3290 | eventfd_signal(t->entries[i].eventfd, 1); | |
3291 | ||
3292 | /* Update current_threshold */ | |
5407a562 | 3293 | t->current_threshold = i - 1; |
2e72b634 KS |
3294 | unlock: |
3295 | rcu_read_unlock(); | |
3296 | } | |
3297 | ||
3298 | static void mem_cgroup_threshold(struct mem_cgroup *memcg) | |
3299 | { | |
ad4ca5f4 KS |
3300 | while (memcg) { |
3301 | __mem_cgroup_threshold(memcg, false); | |
7941d214 | 3302 | if (do_memsw_account()) |
ad4ca5f4 KS |
3303 | __mem_cgroup_threshold(memcg, true); |
3304 | ||
3305 | memcg = parent_mem_cgroup(memcg); | |
3306 | } | |
2e72b634 KS |
3307 | } |
3308 | ||
3309 | static int compare_thresholds(const void *a, const void *b) | |
3310 | { | |
3311 | const struct mem_cgroup_threshold *_a = a; | |
3312 | const struct mem_cgroup_threshold *_b = b; | |
3313 | ||
2bff24a3 GT |
3314 | if (_a->threshold > _b->threshold) |
3315 | return 1; | |
3316 | ||
3317 | if (_a->threshold < _b->threshold) | |
3318 | return -1; | |
3319 | ||
3320 | return 0; | |
2e72b634 KS |
3321 | } |
3322 | ||
c0ff4b85 | 3323 | static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg) |
9490ff27 KH |
3324 | { |
3325 | struct mem_cgroup_eventfd_list *ev; | |
3326 | ||
2bcf2e92 MH |
3327 | spin_lock(&memcg_oom_lock); |
3328 | ||
c0ff4b85 | 3329 | list_for_each_entry(ev, &memcg->oom_notify, list) |
9490ff27 | 3330 | eventfd_signal(ev->eventfd, 1); |
2bcf2e92 MH |
3331 | |
3332 | spin_unlock(&memcg_oom_lock); | |
9490ff27 KH |
3333 | return 0; |
3334 | } | |
3335 | ||
c0ff4b85 | 3336 | static void mem_cgroup_oom_notify(struct mem_cgroup *memcg) |
9490ff27 | 3337 | { |
7d74b06f KH |
3338 | struct mem_cgroup *iter; |
3339 | ||
c0ff4b85 | 3340 | for_each_mem_cgroup_tree(iter, memcg) |
7d74b06f | 3341 | mem_cgroup_oom_notify_cb(iter); |
9490ff27 KH |
3342 | } |
3343 | ||
59b6f873 | 3344 | static int __mem_cgroup_usage_register_event(struct mem_cgroup *memcg, |
347c4a87 | 3345 | struct eventfd_ctx *eventfd, const char *args, enum res_type type) |
2e72b634 | 3346 | { |
2c488db2 KS |
3347 | struct mem_cgroup_thresholds *thresholds; |
3348 | struct mem_cgroup_threshold_ary *new; | |
3e32cb2e JW |
3349 | unsigned long threshold; |
3350 | unsigned long usage; | |
2c488db2 | 3351 | int i, size, ret; |
2e72b634 | 3352 | |
650c5e56 | 3353 | ret = page_counter_memparse(args, "-1", &threshold); |
2e72b634 KS |
3354 | if (ret) |
3355 | return ret; | |
3356 | ||
3357 | mutex_lock(&memcg->thresholds_lock); | |
2c488db2 | 3358 | |
05b84301 | 3359 | if (type == _MEM) { |
2c488db2 | 3360 | thresholds = &memcg->thresholds; |
ce00a967 | 3361 | usage = mem_cgroup_usage(memcg, false); |
05b84301 | 3362 | } else if (type == _MEMSWAP) { |
2c488db2 | 3363 | thresholds = &memcg->memsw_thresholds; |
ce00a967 | 3364 | usage = mem_cgroup_usage(memcg, true); |
05b84301 | 3365 | } else |
2e72b634 KS |
3366 | BUG(); |
3367 | ||
2e72b634 | 3368 | /* Check if a threshold crossed before adding a new one */ |
2c488db2 | 3369 | if (thresholds->primary) |
2e72b634 KS |
3370 | __mem_cgroup_threshold(memcg, type == _MEMSWAP); |
3371 | ||
2c488db2 | 3372 | size = thresholds->primary ? thresholds->primary->size + 1 : 1; |
2e72b634 KS |
3373 | |
3374 | /* Allocate memory for new array of thresholds */ | |
2c488db2 | 3375 | new = kmalloc(sizeof(*new) + size * sizeof(struct mem_cgroup_threshold), |
2e72b634 | 3376 | GFP_KERNEL); |
2c488db2 | 3377 | if (!new) { |
2e72b634 KS |
3378 | ret = -ENOMEM; |
3379 | goto unlock; | |
3380 | } | |
2c488db2 | 3381 | new->size = size; |
2e72b634 KS |
3382 | |
3383 | /* Copy thresholds (if any) to new array */ | |
2c488db2 KS |
3384 | if (thresholds->primary) { |
3385 | memcpy(new->entries, thresholds->primary->entries, (size - 1) * | |
2e72b634 | 3386 | sizeof(struct mem_cgroup_threshold)); |
2c488db2 KS |
3387 | } |
3388 | ||
2e72b634 | 3389 | /* Add new threshold */ |
2c488db2 KS |
3390 | new->entries[size - 1].eventfd = eventfd; |
3391 | new->entries[size - 1].threshold = threshold; | |
2e72b634 KS |
3392 | |
3393 | /* Sort thresholds. Registering of new threshold isn't time-critical */ | |
2c488db2 | 3394 | sort(new->entries, size, sizeof(struct mem_cgroup_threshold), |
2e72b634 KS |
3395 | compare_thresholds, NULL); |
3396 | ||
3397 | /* Find current threshold */ | |
2c488db2 | 3398 | new->current_threshold = -1; |
2e72b634 | 3399 | for (i = 0; i < size; i++) { |
748dad36 | 3400 | if (new->entries[i].threshold <= usage) { |
2e72b634 | 3401 | /* |
2c488db2 KS |
3402 | * new->current_threshold will not be used until |
3403 | * rcu_assign_pointer(), so it's safe to increment | |
2e72b634 KS |
3404 | * it here. |
3405 | */ | |
2c488db2 | 3406 | ++new->current_threshold; |
748dad36 SZ |
3407 | } else |
3408 | break; | |
2e72b634 KS |
3409 | } |
3410 | ||
2c488db2 KS |
3411 | /* Free old spare buffer and save old primary buffer as spare */ |
3412 | kfree(thresholds->spare); | |
3413 | thresholds->spare = thresholds->primary; | |
3414 | ||
3415 | rcu_assign_pointer(thresholds->primary, new); | |
2e72b634 | 3416 | |
907860ed | 3417 | /* To be sure that nobody uses thresholds */ |
2e72b634 KS |
3418 | synchronize_rcu(); |
3419 | ||
2e72b634 KS |
3420 | unlock: |
3421 | mutex_unlock(&memcg->thresholds_lock); | |
3422 | ||
3423 | return ret; | |
3424 | } | |
3425 | ||
59b6f873 | 3426 | static int mem_cgroup_usage_register_event(struct mem_cgroup *memcg, |
347c4a87 TH |
3427 | struct eventfd_ctx *eventfd, const char *args) |
3428 | { | |
59b6f873 | 3429 | return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEM); |
347c4a87 TH |
3430 | } |
3431 | ||
59b6f873 | 3432 | static int memsw_cgroup_usage_register_event(struct mem_cgroup *memcg, |
347c4a87 TH |
3433 | struct eventfd_ctx *eventfd, const char *args) |
3434 | { | |
59b6f873 | 3435 | return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEMSWAP); |
347c4a87 TH |
3436 | } |
3437 | ||
59b6f873 | 3438 | static void __mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg, |
347c4a87 | 3439 | struct eventfd_ctx *eventfd, enum res_type type) |
2e72b634 | 3440 | { |
2c488db2 KS |
3441 | struct mem_cgroup_thresholds *thresholds; |
3442 | struct mem_cgroup_threshold_ary *new; | |
3e32cb2e | 3443 | unsigned long usage; |
2c488db2 | 3444 | int i, j, size; |
2e72b634 KS |
3445 | |
3446 | mutex_lock(&memcg->thresholds_lock); | |
05b84301 JW |
3447 | |
3448 | if (type == _MEM) { | |
2c488db2 | 3449 | thresholds = &memcg->thresholds; |
ce00a967 | 3450 | usage = mem_cgroup_usage(memcg, false); |
05b84301 | 3451 | } else if (type == _MEMSWAP) { |
2c488db2 | 3452 | thresholds = &memcg->memsw_thresholds; |
ce00a967 | 3453 | usage = mem_cgroup_usage(memcg, true); |
05b84301 | 3454 | } else |
2e72b634 KS |
3455 | BUG(); |
3456 | ||
371528ca AV |
3457 | if (!thresholds->primary) |
3458 | goto unlock; | |
3459 | ||
2e72b634 KS |
3460 | /* Check if a threshold crossed before removing */ |
3461 | __mem_cgroup_threshold(memcg, type == _MEMSWAP); | |
3462 | ||
3463 | /* Calculate new number of threshold */ | |
2c488db2 KS |
3464 | size = 0; |
3465 | for (i = 0; i < thresholds->primary->size; i++) { | |
3466 | if (thresholds->primary->entries[i].eventfd != eventfd) | |
2e72b634 KS |
3467 | size++; |
3468 | } | |
3469 | ||
2c488db2 | 3470 | new = thresholds->spare; |
907860ed | 3471 | |
2e72b634 KS |
3472 | /* Set thresholds array to NULL if we don't have thresholds */ |
3473 | if (!size) { | |
2c488db2 KS |
3474 | kfree(new); |
3475 | new = NULL; | |
907860ed | 3476 | goto swap_buffers; |
2e72b634 KS |
3477 | } |
3478 | ||
2c488db2 | 3479 | new->size = size; |
2e72b634 KS |
3480 | |
3481 | /* Copy thresholds and find current threshold */ | |
2c488db2 KS |
3482 | new->current_threshold = -1; |
3483 | for (i = 0, j = 0; i < thresholds->primary->size; i++) { | |
3484 | if (thresholds->primary->entries[i].eventfd == eventfd) | |
2e72b634 KS |
3485 | continue; |
3486 | ||
2c488db2 | 3487 | new->entries[j] = thresholds->primary->entries[i]; |
748dad36 | 3488 | if (new->entries[j].threshold <= usage) { |
2e72b634 | 3489 | /* |
2c488db2 | 3490 | * new->current_threshold will not be used |
2e72b634 KS |
3491 | * until rcu_assign_pointer(), so it's safe to increment |
3492 | * it here. | |
3493 | */ | |
2c488db2 | 3494 | ++new->current_threshold; |
2e72b634 KS |
3495 | } |
3496 | j++; | |
3497 | } | |
3498 | ||
907860ed | 3499 | swap_buffers: |
2c488db2 KS |
3500 | /* Swap primary and spare array */ |
3501 | thresholds->spare = thresholds->primary; | |
8c757763 | 3502 | |
2c488db2 | 3503 | rcu_assign_pointer(thresholds->primary, new); |
2e72b634 | 3504 | |
907860ed | 3505 | /* To be sure that nobody uses thresholds */ |
2e72b634 | 3506 | synchronize_rcu(); |
6611d8d7 MC |
3507 | |
3508 | /* If all events are unregistered, free the spare array */ | |
3509 | if (!new) { | |
3510 | kfree(thresholds->spare); | |
3511 | thresholds->spare = NULL; | |
3512 | } | |
371528ca | 3513 | unlock: |
2e72b634 | 3514 | mutex_unlock(&memcg->thresholds_lock); |
2e72b634 | 3515 | } |
c1e862c1 | 3516 | |
59b6f873 | 3517 | static void mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg, |
347c4a87 TH |
3518 | struct eventfd_ctx *eventfd) |
3519 | { | |
59b6f873 | 3520 | return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEM); |
347c4a87 TH |
3521 | } |
3522 | ||
59b6f873 | 3523 | static void memsw_cgroup_usage_unregister_event(struct mem_cgroup *memcg, |
347c4a87 TH |
3524 | struct eventfd_ctx *eventfd) |
3525 | { | |
59b6f873 | 3526 | return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEMSWAP); |
347c4a87 TH |
3527 | } |
3528 | ||
59b6f873 | 3529 | static int mem_cgroup_oom_register_event(struct mem_cgroup *memcg, |
347c4a87 | 3530 | struct eventfd_ctx *eventfd, const char *args) |
9490ff27 | 3531 | { |
9490ff27 | 3532 | struct mem_cgroup_eventfd_list *event; |
9490ff27 | 3533 | |
9490ff27 KH |
3534 | event = kmalloc(sizeof(*event), GFP_KERNEL); |
3535 | if (!event) | |
3536 | return -ENOMEM; | |
3537 | ||
1af8efe9 | 3538 | spin_lock(&memcg_oom_lock); |
9490ff27 KH |
3539 | |
3540 | event->eventfd = eventfd; | |
3541 | list_add(&event->list, &memcg->oom_notify); | |
3542 | ||
3543 | /* already in OOM ? */ | |
c2b42d3c | 3544 | if (memcg->under_oom) |
9490ff27 | 3545 | eventfd_signal(eventfd, 1); |
1af8efe9 | 3546 | spin_unlock(&memcg_oom_lock); |
9490ff27 KH |
3547 | |
3548 | return 0; | |
3549 | } | |
3550 | ||
59b6f873 | 3551 | static void mem_cgroup_oom_unregister_event(struct mem_cgroup *memcg, |
347c4a87 | 3552 | struct eventfd_ctx *eventfd) |
9490ff27 | 3553 | { |
9490ff27 | 3554 | struct mem_cgroup_eventfd_list *ev, *tmp; |
9490ff27 | 3555 | |
1af8efe9 | 3556 | spin_lock(&memcg_oom_lock); |
9490ff27 | 3557 | |
c0ff4b85 | 3558 | list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) { |
9490ff27 KH |
3559 | if (ev->eventfd == eventfd) { |
3560 | list_del(&ev->list); | |
3561 | kfree(ev); | |
3562 | } | |
3563 | } | |
3564 | ||
1af8efe9 | 3565 | spin_unlock(&memcg_oom_lock); |
9490ff27 KH |
3566 | } |
3567 | ||
2da8ca82 | 3568 | static int mem_cgroup_oom_control_read(struct seq_file *sf, void *v) |
3c11ecf4 | 3569 | { |
2da8ca82 | 3570 | struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(sf)); |
3c11ecf4 | 3571 | |
791badbd | 3572 | seq_printf(sf, "oom_kill_disable %d\n", memcg->oom_kill_disable); |
c2b42d3c | 3573 | seq_printf(sf, "under_oom %d\n", (bool)memcg->under_oom); |
3c11ecf4 KH |
3574 | return 0; |
3575 | } | |
3576 | ||
182446d0 | 3577 | static int mem_cgroup_oom_control_write(struct cgroup_subsys_state *css, |
3c11ecf4 KH |
3578 | struct cftype *cft, u64 val) |
3579 | { | |
182446d0 | 3580 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
3c11ecf4 KH |
3581 | |
3582 | /* cannot set to root cgroup and only 0 and 1 are allowed */ | |
14208b0e | 3583 | if (!css->parent || !((val == 0) || (val == 1))) |
3c11ecf4 KH |
3584 | return -EINVAL; |
3585 | ||
c0ff4b85 | 3586 | memcg->oom_kill_disable = val; |
4d845ebf | 3587 | if (!val) |
c0ff4b85 | 3588 | memcg_oom_recover(memcg); |
3dae7fec | 3589 | |
3c11ecf4 KH |
3590 | return 0; |
3591 | } | |
3592 | ||
52ebea74 TH |
3593 | #ifdef CONFIG_CGROUP_WRITEBACK |
3594 | ||
3595 | struct list_head *mem_cgroup_cgwb_list(struct mem_cgroup *memcg) | |
3596 | { | |
3597 | return &memcg->cgwb_list; | |
3598 | } | |
3599 | ||
841710aa TH |
3600 | static int memcg_wb_domain_init(struct mem_cgroup *memcg, gfp_t gfp) |
3601 | { | |
3602 | return wb_domain_init(&memcg->cgwb_domain, gfp); | |
3603 | } | |
3604 | ||
3605 | static void memcg_wb_domain_exit(struct mem_cgroup *memcg) | |
3606 | { | |
3607 | wb_domain_exit(&memcg->cgwb_domain); | |
3608 | } | |
3609 | ||
2529bb3a TH |
3610 | static void memcg_wb_domain_size_changed(struct mem_cgroup *memcg) |
3611 | { | |
3612 | wb_domain_size_changed(&memcg->cgwb_domain); | |
3613 | } | |
3614 | ||
841710aa TH |
3615 | struct wb_domain *mem_cgroup_wb_domain(struct bdi_writeback *wb) |
3616 | { | |
3617 | struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css); | |
3618 | ||
3619 | if (!memcg->css.parent) | |
3620 | return NULL; | |
3621 | ||
3622 | return &memcg->cgwb_domain; | |
3623 | } | |
3624 | ||
c2aa723a TH |
3625 | /** |
3626 | * mem_cgroup_wb_stats - retrieve writeback related stats from its memcg | |
3627 | * @wb: bdi_writeback in question | |
c5edf9cd TH |
3628 | * @pfilepages: out parameter for number of file pages |
3629 | * @pheadroom: out parameter for number of allocatable pages according to memcg | |
c2aa723a TH |
3630 | * @pdirty: out parameter for number of dirty pages |
3631 | * @pwriteback: out parameter for number of pages under writeback | |
3632 | * | |
c5edf9cd TH |
3633 | * Determine the numbers of file, headroom, dirty, and writeback pages in |
3634 | * @wb's memcg. File, dirty and writeback are self-explanatory. Headroom | |
3635 | * is a bit more involved. | |
c2aa723a | 3636 | * |
c5edf9cd TH |
3637 | * A memcg's headroom is "min(max, high) - used". In the hierarchy, the |
3638 | * headroom is calculated as the lowest headroom of itself and the | |
3639 | * ancestors. Note that this doesn't consider the actual amount of | |
3640 | * available memory in the system. The caller should further cap | |
3641 | * *@pheadroom accordingly. | |
c2aa723a | 3642 | */ |
c5edf9cd TH |
3643 | void mem_cgroup_wb_stats(struct bdi_writeback *wb, unsigned long *pfilepages, |
3644 | unsigned long *pheadroom, unsigned long *pdirty, | |
3645 | unsigned long *pwriteback) | |
c2aa723a TH |
3646 | { |
3647 | struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css); | |
3648 | struct mem_cgroup *parent; | |
c2aa723a TH |
3649 | |
3650 | *pdirty = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_DIRTY); | |
3651 | ||
3652 | /* this should eventually include NR_UNSTABLE_NFS */ | |
3653 | *pwriteback = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_WRITEBACK); | |
c5edf9cd TH |
3654 | *pfilepages = mem_cgroup_nr_lru_pages(memcg, (1 << LRU_INACTIVE_FILE) | |
3655 | (1 << LRU_ACTIVE_FILE)); | |
3656 | *pheadroom = PAGE_COUNTER_MAX; | |
c2aa723a | 3657 | |
c2aa723a TH |
3658 | while ((parent = parent_mem_cgroup(memcg))) { |
3659 | unsigned long ceiling = min(memcg->memory.limit, memcg->high); | |
3660 | unsigned long used = page_counter_read(&memcg->memory); | |
3661 | ||
c5edf9cd | 3662 | *pheadroom = min(*pheadroom, ceiling - min(ceiling, used)); |
c2aa723a TH |
3663 | memcg = parent; |
3664 | } | |
c2aa723a TH |
3665 | } |
3666 | ||
841710aa TH |
3667 | #else /* CONFIG_CGROUP_WRITEBACK */ |
3668 | ||
3669 | static int memcg_wb_domain_init(struct mem_cgroup *memcg, gfp_t gfp) | |
3670 | { | |
3671 | return 0; | |
3672 | } | |
3673 | ||
3674 | static void memcg_wb_domain_exit(struct mem_cgroup *memcg) | |
3675 | { | |
3676 | } | |
3677 | ||
2529bb3a TH |
3678 | static void memcg_wb_domain_size_changed(struct mem_cgroup *memcg) |
3679 | { | |
3680 | } | |
3681 | ||
52ebea74 TH |
3682 | #endif /* CONFIG_CGROUP_WRITEBACK */ |
3683 | ||
3bc942f3 TH |
3684 | /* |
3685 | * DO NOT USE IN NEW FILES. | |
3686 | * | |
3687 | * "cgroup.event_control" implementation. | |
3688 | * | |
3689 | * This is way over-engineered. It tries to support fully configurable | |
3690 | * events for each user. Such level of flexibility is completely | |
3691 | * unnecessary especially in the light of the planned unified hierarchy. | |
3692 | * | |
3693 | * Please deprecate this and replace with something simpler if at all | |
3694 | * possible. | |
3695 | */ | |
3696 | ||
79bd9814 TH |
3697 | /* |
3698 | * Unregister event and free resources. | |
3699 | * | |
3700 | * Gets called from workqueue. | |
3701 | */ | |
3bc942f3 | 3702 | static void memcg_event_remove(struct work_struct *work) |
79bd9814 | 3703 | { |
3bc942f3 TH |
3704 | struct mem_cgroup_event *event = |
3705 | container_of(work, struct mem_cgroup_event, remove); | |
59b6f873 | 3706 | struct mem_cgroup *memcg = event->memcg; |
79bd9814 TH |
3707 | |
3708 | remove_wait_queue(event->wqh, &event->wait); | |
3709 | ||
59b6f873 | 3710 | event->unregister_event(memcg, event->eventfd); |
79bd9814 TH |
3711 | |
3712 | /* Notify userspace the event is going away. */ | |
3713 | eventfd_signal(event->eventfd, 1); | |
3714 | ||
3715 | eventfd_ctx_put(event->eventfd); | |
3716 | kfree(event); | |
59b6f873 | 3717 | css_put(&memcg->css); |
79bd9814 TH |
3718 | } |
3719 | ||
3720 | /* | |
3721 | * Gets called on POLLHUP on eventfd when user closes it. | |
3722 | * | |
3723 | * Called with wqh->lock held and interrupts disabled. | |
3724 | */ | |
3bc942f3 TH |
3725 | static int memcg_event_wake(wait_queue_t *wait, unsigned mode, |
3726 | int sync, void *key) | |
79bd9814 | 3727 | { |
3bc942f3 TH |
3728 | struct mem_cgroup_event *event = |
3729 | container_of(wait, struct mem_cgroup_event, wait); | |
59b6f873 | 3730 | struct mem_cgroup *memcg = event->memcg; |
79bd9814 TH |
3731 | unsigned long flags = (unsigned long)key; |
3732 | ||
3733 | if (flags & POLLHUP) { | |
3734 | /* | |
3735 | * If the event has been detached at cgroup removal, we | |
3736 | * can simply return knowing the other side will cleanup | |
3737 | * for us. | |
3738 | * | |
3739 | * We can't race against event freeing since the other | |
3740 | * side will require wqh->lock via remove_wait_queue(), | |
3741 | * which we hold. | |
3742 | */ | |
fba94807 | 3743 | spin_lock(&memcg->event_list_lock); |
79bd9814 TH |
3744 | if (!list_empty(&event->list)) { |
3745 | list_del_init(&event->list); | |
3746 | /* | |
3747 | * We are in atomic context, but cgroup_event_remove() | |
3748 | * may sleep, so we have to call it in workqueue. | |
3749 | */ | |
3750 | schedule_work(&event->remove); | |
3751 | } | |
fba94807 | 3752 | spin_unlock(&memcg->event_list_lock); |
79bd9814 TH |
3753 | } |
3754 | ||
3755 | return 0; | |
3756 | } | |
3757 | ||
3bc942f3 | 3758 | static void memcg_event_ptable_queue_proc(struct file *file, |
79bd9814 TH |
3759 | wait_queue_head_t *wqh, poll_table *pt) |
3760 | { | |
3bc942f3 TH |
3761 | struct mem_cgroup_event *event = |
3762 | container_of(pt, struct mem_cgroup_event, pt); | |
79bd9814 TH |
3763 | |
3764 | event->wqh = wqh; | |
3765 | add_wait_queue(wqh, &event->wait); | |
3766 | } | |
3767 | ||
3768 | /* | |
3bc942f3 TH |
3769 | * DO NOT USE IN NEW FILES. |
3770 | * | |
79bd9814 TH |
3771 | * Parse input and register new cgroup event handler. |
3772 | * | |
3773 | * Input must be in format '<event_fd> <control_fd> <args>'. | |
3774 | * Interpretation of args is defined by control file implementation. | |
3775 | */ | |
451af504 TH |
3776 | static ssize_t memcg_write_event_control(struct kernfs_open_file *of, |
3777 | char *buf, size_t nbytes, loff_t off) | |
79bd9814 | 3778 | { |
451af504 | 3779 | struct cgroup_subsys_state *css = of_css(of); |
fba94807 | 3780 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
3bc942f3 | 3781 | struct mem_cgroup_event *event; |
79bd9814 TH |
3782 | struct cgroup_subsys_state *cfile_css; |
3783 | unsigned int efd, cfd; | |
3784 | struct fd efile; | |
3785 | struct fd cfile; | |
fba94807 | 3786 | const char *name; |
79bd9814 TH |
3787 | char *endp; |
3788 | int ret; | |
3789 | ||
451af504 TH |
3790 | buf = strstrip(buf); |
3791 | ||
3792 | efd = simple_strtoul(buf, &endp, 10); | |
79bd9814 TH |
3793 | if (*endp != ' ') |
3794 | return -EINVAL; | |
451af504 | 3795 | buf = endp + 1; |
79bd9814 | 3796 | |
451af504 | 3797 | cfd = simple_strtoul(buf, &endp, 10); |
79bd9814 TH |
3798 | if ((*endp != ' ') && (*endp != '\0')) |
3799 | return -EINVAL; | |
451af504 | 3800 | buf = endp + 1; |
79bd9814 TH |
3801 | |
3802 | event = kzalloc(sizeof(*event), GFP_KERNEL); | |
3803 | if (!event) | |
3804 | return -ENOMEM; | |
3805 | ||
59b6f873 | 3806 | event->memcg = memcg; |
79bd9814 | 3807 | INIT_LIST_HEAD(&event->list); |
3bc942f3 TH |
3808 | init_poll_funcptr(&event->pt, memcg_event_ptable_queue_proc); |
3809 | init_waitqueue_func_entry(&event->wait, memcg_event_wake); | |
3810 | INIT_WORK(&event->remove, memcg_event_remove); | |
79bd9814 TH |
3811 | |
3812 | efile = fdget(efd); | |
3813 | if (!efile.file) { | |
3814 | ret = -EBADF; | |
3815 | goto out_kfree; | |
3816 | } | |
3817 | ||
3818 | event->eventfd = eventfd_ctx_fileget(efile.file); | |
3819 | if (IS_ERR(event->eventfd)) { | |
3820 | ret = PTR_ERR(event->eventfd); | |
3821 | goto out_put_efile; | |
3822 | } | |
3823 | ||
3824 | cfile = fdget(cfd); | |
3825 | if (!cfile.file) { | |
3826 | ret = -EBADF; | |
3827 | goto out_put_eventfd; | |
3828 | } | |
3829 | ||
3830 | /* the process need read permission on control file */ | |
3831 | /* AV: shouldn't we check that it's been opened for read instead? */ | |
3832 | ret = inode_permission(file_inode(cfile.file), MAY_READ); | |
3833 | if (ret < 0) | |
3834 | goto out_put_cfile; | |
3835 | ||
fba94807 TH |
3836 | /* |
3837 | * Determine the event callbacks and set them in @event. This used | |
3838 | * to be done via struct cftype but cgroup core no longer knows | |
3839 | * about these events. The following is crude but the whole thing | |
3840 | * is for compatibility anyway. | |
3bc942f3 TH |
3841 | * |
3842 | * DO NOT ADD NEW FILES. | |
fba94807 | 3843 | */ |
b583043e | 3844 | name = cfile.file->f_path.dentry->d_name.name; |
fba94807 TH |
3845 | |
3846 | if (!strcmp(name, "memory.usage_in_bytes")) { | |
3847 | event->register_event = mem_cgroup_usage_register_event; | |
3848 | event->unregister_event = mem_cgroup_usage_unregister_event; | |
3849 | } else if (!strcmp(name, "memory.oom_control")) { | |
3850 | event->register_event = mem_cgroup_oom_register_event; | |
3851 | event->unregister_event = mem_cgroup_oom_unregister_event; | |
3852 | } else if (!strcmp(name, "memory.pressure_level")) { | |
3853 | event->register_event = vmpressure_register_event; | |
3854 | event->unregister_event = vmpressure_unregister_event; | |
3855 | } else if (!strcmp(name, "memory.memsw.usage_in_bytes")) { | |
347c4a87 TH |
3856 | event->register_event = memsw_cgroup_usage_register_event; |
3857 | event->unregister_event = memsw_cgroup_usage_unregister_event; | |
fba94807 TH |
3858 | } else { |
3859 | ret = -EINVAL; | |
3860 | goto out_put_cfile; | |
3861 | } | |
3862 | ||
79bd9814 | 3863 | /* |
b5557c4c TH |
3864 | * Verify @cfile should belong to @css. Also, remaining events are |
3865 | * automatically removed on cgroup destruction but the removal is | |
3866 | * asynchronous, so take an extra ref on @css. | |
79bd9814 | 3867 | */ |
b583043e | 3868 | cfile_css = css_tryget_online_from_dir(cfile.file->f_path.dentry->d_parent, |
ec903c0c | 3869 | &memory_cgrp_subsys); |
79bd9814 | 3870 | ret = -EINVAL; |
5a17f543 | 3871 | if (IS_ERR(cfile_css)) |
79bd9814 | 3872 | goto out_put_cfile; |
5a17f543 TH |
3873 | if (cfile_css != css) { |
3874 | css_put(cfile_css); | |
79bd9814 | 3875 | goto out_put_cfile; |
5a17f543 | 3876 | } |
79bd9814 | 3877 | |
451af504 | 3878 | ret = event->register_event(memcg, event->eventfd, buf); |
79bd9814 TH |
3879 | if (ret) |
3880 | goto out_put_css; | |
3881 | ||
3882 | efile.file->f_op->poll(efile.file, &event->pt); | |
3883 | ||
fba94807 TH |
3884 | spin_lock(&memcg->event_list_lock); |
3885 | list_add(&event->list, &memcg->event_list); | |
3886 | spin_unlock(&memcg->event_list_lock); | |
79bd9814 TH |
3887 | |
3888 | fdput(cfile); | |
3889 | fdput(efile); | |
3890 | ||
451af504 | 3891 | return nbytes; |
79bd9814 TH |
3892 | |
3893 | out_put_css: | |
b5557c4c | 3894 | css_put(css); |
79bd9814 TH |
3895 | out_put_cfile: |
3896 | fdput(cfile); | |
3897 | out_put_eventfd: | |
3898 | eventfd_ctx_put(event->eventfd); | |
3899 | out_put_efile: | |
3900 | fdput(efile); | |
3901 | out_kfree: | |
3902 | kfree(event); | |
3903 | ||
3904 | return ret; | |
3905 | } | |
3906 | ||
241994ed | 3907 | static struct cftype mem_cgroup_legacy_files[] = { |
8cdea7c0 | 3908 | { |
0eea1030 | 3909 | .name = "usage_in_bytes", |
8c7c6e34 | 3910 | .private = MEMFILE_PRIVATE(_MEM, RES_USAGE), |
791badbd | 3911 | .read_u64 = mem_cgroup_read_u64, |
8cdea7c0 | 3912 | }, |
c84872e1 PE |
3913 | { |
3914 | .name = "max_usage_in_bytes", | |
8c7c6e34 | 3915 | .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE), |
6770c64e | 3916 | .write = mem_cgroup_reset, |
791badbd | 3917 | .read_u64 = mem_cgroup_read_u64, |
c84872e1 | 3918 | }, |
8cdea7c0 | 3919 | { |
0eea1030 | 3920 | .name = "limit_in_bytes", |
8c7c6e34 | 3921 | .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT), |
451af504 | 3922 | .write = mem_cgroup_write, |
791badbd | 3923 | .read_u64 = mem_cgroup_read_u64, |
8cdea7c0 | 3924 | }, |
296c81d8 BS |
3925 | { |
3926 | .name = "soft_limit_in_bytes", | |
3927 | .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT), | |
451af504 | 3928 | .write = mem_cgroup_write, |
791badbd | 3929 | .read_u64 = mem_cgroup_read_u64, |
296c81d8 | 3930 | }, |
8cdea7c0 BS |
3931 | { |
3932 | .name = "failcnt", | |
8c7c6e34 | 3933 | .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT), |
6770c64e | 3934 | .write = mem_cgroup_reset, |
791badbd | 3935 | .read_u64 = mem_cgroup_read_u64, |
8cdea7c0 | 3936 | }, |
d2ceb9b7 KH |
3937 | { |
3938 | .name = "stat", | |
2da8ca82 | 3939 | .seq_show = memcg_stat_show, |
d2ceb9b7 | 3940 | }, |
c1e862c1 KH |
3941 | { |
3942 | .name = "force_empty", | |
6770c64e | 3943 | .write = mem_cgroup_force_empty_write, |
c1e862c1 | 3944 | }, |
18f59ea7 BS |
3945 | { |
3946 | .name = "use_hierarchy", | |
3947 | .write_u64 = mem_cgroup_hierarchy_write, | |
3948 | .read_u64 = mem_cgroup_hierarchy_read, | |
3949 | }, | |
79bd9814 | 3950 | { |
3bc942f3 | 3951 | .name = "cgroup.event_control", /* XXX: for compat */ |
451af504 | 3952 | .write = memcg_write_event_control, |
7dbdb199 | 3953 | .flags = CFTYPE_NO_PREFIX | CFTYPE_WORLD_WRITABLE, |
79bd9814 | 3954 | }, |
a7885eb8 KM |
3955 | { |
3956 | .name = "swappiness", | |
3957 | .read_u64 = mem_cgroup_swappiness_read, | |
3958 | .write_u64 = mem_cgroup_swappiness_write, | |
3959 | }, | |
7dc74be0 DN |
3960 | { |
3961 | .name = "move_charge_at_immigrate", | |
3962 | .read_u64 = mem_cgroup_move_charge_read, | |
3963 | .write_u64 = mem_cgroup_move_charge_write, | |
3964 | }, | |
9490ff27 KH |
3965 | { |
3966 | .name = "oom_control", | |
2da8ca82 | 3967 | .seq_show = mem_cgroup_oom_control_read, |
3c11ecf4 | 3968 | .write_u64 = mem_cgroup_oom_control_write, |
9490ff27 KH |
3969 | .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL), |
3970 | }, | |
70ddf637 AV |
3971 | { |
3972 | .name = "pressure_level", | |
70ddf637 | 3973 | }, |
406eb0c9 YH |
3974 | #ifdef CONFIG_NUMA |
3975 | { | |
3976 | .name = "numa_stat", | |
2da8ca82 | 3977 | .seq_show = memcg_numa_stat_show, |
406eb0c9 YH |
3978 | }, |
3979 | #endif | |
510fc4e1 GC |
3980 | { |
3981 | .name = "kmem.limit_in_bytes", | |
3982 | .private = MEMFILE_PRIVATE(_KMEM, RES_LIMIT), | |
451af504 | 3983 | .write = mem_cgroup_write, |
791badbd | 3984 | .read_u64 = mem_cgroup_read_u64, |
510fc4e1 GC |
3985 | }, |
3986 | { | |
3987 | .name = "kmem.usage_in_bytes", | |
3988 | .private = MEMFILE_PRIVATE(_KMEM, RES_USAGE), | |
791badbd | 3989 | .read_u64 = mem_cgroup_read_u64, |
510fc4e1 GC |
3990 | }, |
3991 | { | |
3992 | .name = "kmem.failcnt", | |
3993 | .private = MEMFILE_PRIVATE(_KMEM, RES_FAILCNT), | |
6770c64e | 3994 | .write = mem_cgroup_reset, |
791badbd | 3995 | .read_u64 = mem_cgroup_read_u64, |
510fc4e1 GC |
3996 | }, |
3997 | { | |
3998 | .name = "kmem.max_usage_in_bytes", | |
3999 | .private = MEMFILE_PRIVATE(_KMEM, RES_MAX_USAGE), | |
6770c64e | 4000 | .write = mem_cgroup_reset, |
791badbd | 4001 | .read_u64 = mem_cgroup_read_u64, |
510fc4e1 | 4002 | }, |
749c5415 GC |
4003 | #ifdef CONFIG_SLABINFO |
4004 | { | |
4005 | .name = "kmem.slabinfo", | |
bc2791f8 TH |
4006 | .seq_start = memcg_slab_start, |
4007 | .seq_next = memcg_slab_next, | |
4008 | .seq_stop = memcg_slab_stop, | |
b047501c | 4009 | .seq_show = memcg_slab_show, |
749c5415 GC |
4010 | }, |
4011 | #endif | |
d55f90bf VD |
4012 | { |
4013 | .name = "kmem.tcp.limit_in_bytes", | |
4014 | .private = MEMFILE_PRIVATE(_TCP, RES_LIMIT), | |
4015 | .write = mem_cgroup_write, | |
4016 | .read_u64 = mem_cgroup_read_u64, | |
4017 | }, | |
4018 | { | |
4019 | .name = "kmem.tcp.usage_in_bytes", | |
4020 | .private = MEMFILE_PRIVATE(_TCP, RES_USAGE), | |
4021 | .read_u64 = mem_cgroup_read_u64, | |
4022 | }, | |
4023 | { | |
4024 | .name = "kmem.tcp.failcnt", | |
4025 | .private = MEMFILE_PRIVATE(_TCP, RES_FAILCNT), | |
4026 | .write = mem_cgroup_reset, | |
4027 | .read_u64 = mem_cgroup_read_u64, | |
4028 | }, | |
4029 | { | |
4030 | .name = "kmem.tcp.max_usage_in_bytes", | |
4031 | .private = MEMFILE_PRIVATE(_TCP, RES_MAX_USAGE), | |
4032 | .write = mem_cgroup_reset, | |
4033 | .read_u64 = mem_cgroup_read_u64, | |
4034 | }, | |
6bc10349 | 4035 | { }, /* terminate */ |
af36f906 | 4036 | }; |
8c7c6e34 | 4037 | |
73f576c0 JW |
4038 | /* |
4039 | * Private memory cgroup IDR | |
4040 | * | |
4041 | * Swap-out records and page cache shadow entries need to store memcg | |
4042 | * references in constrained space, so we maintain an ID space that is | |
4043 | * limited to 16 bit (MEM_CGROUP_ID_MAX), limiting the total number of | |
4044 | * memory-controlled cgroups to 64k. | |
4045 | * | |
4046 | * However, there usually are many references to the oflline CSS after | |
4047 | * the cgroup has been destroyed, such as page cache or reclaimable | |
4048 | * slab objects, that don't need to hang on to the ID. We want to keep | |
4049 | * those dead CSS from occupying IDs, or we might quickly exhaust the | |
4050 | * relatively small ID space and prevent the creation of new cgroups | |
4051 | * even when there are much fewer than 64k cgroups - possibly none. | |
4052 | * | |
4053 | * Maintain a private 16-bit ID space for memcg, and allow the ID to | |
4054 | * be freed and recycled when it's no longer needed, which is usually | |
4055 | * when the CSS is offlined. | |
4056 | * | |
4057 | * The only exception to that are records of swapped out tmpfs/shmem | |
4058 | * pages that need to be attributed to live ancestors on swapin. But | |
4059 | * those references are manageable from userspace. | |
4060 | */ | |
4061 | ||
4062 | static DEFINE_IDR(mem_cgroup_idr); | |
4063 | ||
615d66c3 | 4064 | static void mem_cgroup_id_get_many(struct mem_cgroup *memcg, unsigned int n) |
73f576c0 | 4065 | { |
58fa2a55 | 4066 | VM_BUG_ON(atomic_read(&memcg->id.ref) <= 0); |
615d66c3 | 4067 | atomic_add(n, &memcg->id.ref); |
73f576c0 JW |
4068 | } |
4069 | ||
615d66c3 | 4070 | static void mem_cgroup_id_put_many(struct mem_cgroup *memcg, unsigned int n) |
73f576c0 | 4071 | { |
58fa2a55 | 4072 | VM_BUG_ON(atomic_read(&memcg->id.ref) < n); |
615d66c3 | 4073 | if (atomic_sub_and_test(n, &memcg->id.ref)) { |
73f576c0 JW |
4074 | idr_remove(&mem_cgroup_idr, memcg->id.id); |
4075 | memcg->id.id = 0; | |
4076 | ||
4077 | /* Memcg ID pins CSS */ | |
4078 | css_put(&memcg->css); | |
4079 | } | |
4080 | } | |
4081 | ||
615d66c3 VD |
4082 | static inline void mem_cgroup_id_get(struct mem_cgroup *memcg) |
4083 | { | |
4084 | mem_cgroup_id_get_many(memcg, 1); | |
4085 | } | |
4086 | ||
4087 | static inline void mem_cgroup_id_put(struct mem_cgroup *memcg) | |
4088 | { | |
4089 | mem_cgroup_id_put_many(memcg, 1); | |
4090 | } | |
4091 | ||
73f576c0 JW |
4092 | /** |
4093 | * mem_cgroup_from_id - look up a memcg from a memcg id | |
4094 | * @id: the memcg id to look up | |
4095 | * | |
4096 | * Caller must hold rcu_read_lock(). | |
4097 | */ | |
4098 | struct mem_cgroup *mem_cgroup_from_id(unsigned short id) | |
4099 | { | |
4100 | WARN_ON_ONCE(!rcu_read_lock_held()); | |
4101 | return idr_find(&mem_cgroup_idr, id); | |
4102 | } | |
4103 | ||
ef8f2327 | 4104 | static int alloc_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node) |
6d12e2d8 KH |
4105 | { |
4106 | struct mem_cgroup_per_node *pn; | |
ef8f2327 | 4107 | int tmp = node; |
1ecaab2b KH |
4108 | /* |
4109 | * This routine is called against possible nodes. | |
4110 | * But it's BUG to call kmalloc() against offline node. | |
4111 | * | |
4112 | * TODO: this routine can waste much memory for nodes which will | |
4113 | * never be onlined. It's better to use memory hotplug callback | |
4114 | * function. | |
4115 | */ | |
41e3355d KH |
4116 | if (!node_state(node, N_NORMAL_MEMORY)) |
4117 | tmp = -1; | |
17295c88 | 4118 | pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp); |
6d12e2d8 KH |
4119 | if (!pn) |
4120 | return 1; | |
1ecaab2b | 4121 | |
ef8f2327 MG |
4122 | lruvec_init(&pn->lruvec); |
4123 | pn->usage_in_excess = 0; | |
4124 | pn->on_tree = false; | |
4125 | pn->memcg = memcg; | |
4126 | ||
54f72fe0 | 4127 | memcg->nodeinfo[node] = pn; |
6d12e2d8 KH |
4128 | return 0; |
4129 | } | |
4130 | ||
ef8f2327 | 4131 | static void free_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node) |
1ecaab2b | 4132 | { |
54f72fe0 | 4133 | kfree(memcg->nodeinfo[node]); |
1ecaab2b KH |
4134 | } |
4135 | ||
0b8f73e1 | 4136 | static void mem_cgroup_free(struct mem_cgroup *memcg) |
59927fb9 | 4137 | { |
c8b2a36f | 4138 | int node; |
59927fb9 | 4139 | |
0b8f73e1 | 4140 | memcg_wb_domain_exit(memcg); |
c8b2a36f | 4141 | for_each_node(node) |
ef8f2327 | 4142 | free_mem_cgroup_per_node_info(memcg, node); |
c8b2a36f | 4143 | free_percpu(memcg->stat); |
8ff69e2c | 4144 | kfree(memcg); |
59927fb9 | 4145 | } |
3afe36b1 | 4146 | |
0b8f73e1 | 4147 | static struct mem_cgroup *mem_cgroup_alloc(void) |
8cdea7c0 | 4148 | { |
d142e3e6 | 4149 | struct mem_cgroup *memcg; |
0b8f73e1 | 4150 | size_t size; |
6d12e2d8 | 4151 | int node; |
8cdea7c0 | 4152 | |
0b8f73e1 JW |
4153 | size = sizeof(struct mem_cgroup); |
4154 | size += nr_node_ids * sizeof(struct mem_cgroup_per_node *); | |
4155 | ||
4156 | memcg = kzalloc(size, GFP_KERNEL); | |
c0ff4b85 | 4157 | if (!memcg) |
0b8f73e1 JW |
4158 | return NULL; |
4159 | ||
73f576c0 JW |
4160 | memcg->id.id = idr_alloc(&mem_cgroup_idr, NULL, |
4161 | 1, MEM_CGROUP_ID_MAX, | |
4162 | GFP_KERNEL); | |
4163 | if (memcg->id.id < 0) | |
4164 | goto fail; | |
4165 | ||
0b8f73e1 JW |
4166 | memcg->stat = alloc_percpu(struct mem_cgroup_stat_cpu); |
4167 | if (!memcg->stat) | |
4168 | goto fail; | |
78fb7466 | 4169 | |
3ed28fa1 | 4170 | for_each_node(node) |
ef8f2327 | 4171 | if (alloc_mem_cgroup_per_node_info(memcg, node)) |
0b8f73e1 | 4172 | goto fail; |
f64c3f54 | 4173 | |
0b8f73e1 JW |
4174 | if (memcg_wb_domain_init(memcg, GFP_KERNEL)) |
4175 | goto fail; | |
28dbc4b6 | 4176 | |
f7e1cb6e | 4177 | INIT_WORK(&memcg->high_work, high_work_func); |
d142e3e6 GC |
4178 | memcg->last_scanned_node = MAX_NUMNODES; |
4179 | INIT_LIST_HEAD(&memcg->oom_notify); | |
d142e3e6 GC |
4180 | mutex_init(&memcg->thresholds_lock); |
4181 | spin_lock_init(&memcg->move_lock); | |
70ddf637 | 4182 | vmpressure_init(&memcg->vmpressure); |
fba94807 TH |
4183 | INIT_LIST_HEAD(&memcg->event_list); |
4184 | spin_lock_init(&memcg->event_list_lock); | |
d886f4e4 | 4185 | memcg->socket_pressure = jiffies; |
127424c8 | 4186 | #ifndef CONFIG_SLOB |
900a38f0 | 4187 | memcg->kmemcg_id = -1; |
900a38f0 | 4188 | #endif |
52ebea74 TH |
4189 | #ifdef CONFIG_CGROUP_WRITEBACK |
4190 | INIT_LIST_HEAD(&memcg->cgwb_list); | |
4191 | #endif | |
73f576c0 | 4192 | idr_replace(&mem_cgroup_idr, memcg, memcg->id.id); |
0b8f73e1 JW |
4193 | return memcg; |
4194 | fail: | |
73f576c0 JW |
4195 | if (memcg->id.id > 0) |
4196 | idr_remove(&mem_cgroup_idr, memcg->id.id); | |
0b8f73e1 JW |
4197 | mem_cgroup_free(memcg); |
4198 | return NULL; | |
d142e3e6 GC |
4199 | } |
4200 | ||
0b8f73e1 JW |
4201 | static struct cgroup_subsys_state * __ref |
4202 | mem_cgroup_css_alloc(struct cgroup_subsys_state *parent_css) | |
d142e3e6 | 4203 | { |
0b8f73e1 JW |
4204 | struct mem_cgroup *parent = mem_cgroup_from_css(parent_css); |
4205 | struct mem_cgroup *memcg; | |
4206 | long error = -ENOMEM; | |
d142e3e6 | 4207 | |
0b8f73e1 JW |
4208 | memcg = mem_cgroup_alloc(); |
4209 | if (!memcg) | |
4210 | return ERR_PTR(error); | |
d142e3e6 | 4211 | |
0b8f73e1 JW |
4212 | memcg->high = PAGE_COUNTER_MAX; |
4213 | memcg->soft_limit = PAGE_COUNTER_MAX; | |
4214 | if (parent) { | |
4215 | memcg->swappiness = mem_cgroup_swappiness(parent); | |
4216 | memcg->oom_kill_disable = parent->oom_kill_disable; | |
4217 | } | |
4218 | if (parent && parent->use_hierarchy) { | |
4219 | memcg->use_hierarchy = true; | |
3e32cb2e | 4220 | page_counter_init(&memcg->memory, &parent->memory); |
37e84351 | 4221 | page_counter_init(&memcg->swap, &parent->swap); |
3e32cb2e JW |
4222 | page_counter_init(&memcg->memsw, &parent->memsw); |
4223 | page_counter_init(&memcg->kmem, &parent->kmem); | |
0db15298 | 4224 | page_counter_init(&memcg->tcpmem, &parent->tcpmem); |
18f59ea7 | 4225 | } else { |
3e32cb2e | 4226 | page_counter_init(&memcg->memory, NULL); |
37e84351 | 4227 | page_counter_init(&memcg->swap, NULL); |
3e32cb2e JW |
4228 | page_counter_init(&memcg->memsw, NULL); |
4229 | page_counter_init(&memcg->kmem, NULL); | |
0db15298 | 4230 | page_counter_init(&memcg->tcpmem, NULL); |
8c7f6edb TH |
4231 | /* |
4232 | * Deeper hierachy with use_hierarchy == false doesn't make | |
4233 | * much sense so let cgroup subsystem know about this | |
4234 | * unfortunate state in our controller. | |
4235 | */ | |
d142e3e6 | 4236 | if (parent != root_mem_cgroup) |
073219e9 | 4237 | memory_cgrp_subsys.broken_hierarchy = true; |
18f59ea7 | 4238 | } |
d6441637 | 4239 | |
0b8f73e1 JW |
4240 | /* The following stuff does not apply to the root */ |
4241 | if (!parent) { | |
4242 | root_mem_cgroup = memcg; | |
4243 | return &memcg->css; | |
4244 | } | |
4245 | ||
b313aeee | 4246 | error = memcg_online_kmem(memcg); |
0b8f73e1 JW |
4247 | if (error) |
4248 | goto fail; | |
127424c8 | 4249 | |
f7e1cb6e | 4250 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_nosocket) |
ef12947c | 4251 | static_branch_inc(&memcg_sockets_enabled_key); |
f7e1cb6e | 4252 | |
0b8f73e1 JW |
4253 | return &memcg->css; |
4254 | fail: | |
4255 | mem_cgroup_free(memcg); | |
ea3a9645 | 4256 | return ERR_PTR(-ENOMEM); |
0b8f73e1 JW |
4257 | } |
4258 | ||
73f576c0 | 4259 | static int mem_cgroup_css_online(struct cgroup_subsys_state *css) |
0b8f73e1 | 4260 | { |
58fa2a55 VD |
4261 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
4262 | ||
73f576c0 | 4263 | /* Online state pins memcg ID, memcg ID pins CSS */ |
58fa2a55 | 4264 | atomic_set(&memcg->id.ref, 1); |
73f576c0 | 4265 | css_get(css); |
2f7dd7a4 | 4266 | return 0; |
8cdea7c0 BS |
4267 | } |
4268 | ||
eb95419b | 4269 | static void mem_cgroup_css_offline(struct cgroup_subsys_state *css) |
df878fb0 | 4270 | { |
eb95419b | 4271 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
3bc942f3 | 4272 | struct mem_cgroup_event *event, *tmp; |
79bd9814 TH |
4273 | |
4274 | /* | |
4275 | * Unregister events and notify userspace. | |
4276 | * Notify userspace about cgroup removing only after rmdir of cgroup | |
4277 | * directory to avoid race between userspace and kernelspace. | |
4278 | */ | |
fba94807 TH |
4279 | spin_lock(&memcg->event_list_lock); |
4280 | list_for_each_entry_safe(event, tmp, &memcg->event_list, list) { | |
79bd9814 TH |
4281 | list_del_init(&event->list); |
4282 | schedule_work(&event->remove); | |
4283 | } | |
fba94807 | 4284 | spin_unlock(&memcg->event_list_lock); |
ec64f515 | 4285 | |
567e9ab2 | 4286 | memcg_offline_kmem(memcg); |
52ebea74 | 4287 | wb_memcg_offline(memcg); |
73f576c0 JW |
4288 | |
4289 | mem_cgroup_id_put(memcg); | |
df878fb0 KH |
4290 | } |
4291 | ||
6df38689 VD |
4292 | static void mem_cgroup_css_released(struct cgroup_subsys_state *css) |
4293 | { | |
4294 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); | |
4295 | ||
4296 | invalidate_reclaim_iterators(memcg); | |
4297 | } | |
4298 | ||
eb95419b | 4299 | static void mem_cgroup_css_free(struct cgroup_subsys_state *css) |
8cdea7c0 | 4300 | { |
eb95419b | 4301 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
c268e994 | 4302 | |
f7e1cb6e | 4303 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_nosocket) |
ef12947c | 4304 | static_branch_dec(&memcg_sockets_enabled_key); |
127424c8 | 4305 | |
0db15298 | 4306 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && memcg->tcpmem_active) |
d55f90bf | 4307 | static_branch_dec(&memcg_sockets_enabled_key); |
3893e302 | 4308 | |
0b8f73e1 JW |
4309 | vmpressure_cleanup(&memcg->vmpressure); |
4310 | cancel_work_sync(&memcg->high_work); | |
4311 | mem_cgroup_remove_from_trees(memcg); | |
d886f4e4 | 4312 | memcg_free_kmem(memcg); |
0b8f73e1 | 4313 | mem_cgroup_free(memcg); |
8cdea7c0 BS |
4314 | } |
4315 | ||
1ced953b TH |
4316 | /** |
4317 | * mem_cgroup_css_reset - reset the states of a mem_cgroup | |
4318 | * @css: the target css | |
4319 | * | |
4320 | * Reset the states of the mem_cgroup associated with @css. This is | |
4321 | * invoked when the userland requests disabling on the default hierarchy | |
4322 | * but the memcg is pinned through dependency. The memcg should stop | |
4323 | * applying policies and should revert to the vanilla state as it may be | |
4324 | * made visible again. | |
4325 | * | |
4326 | * The current implementation only resets the essential configurations. | |
4327 | * This needs to be expanded to cover all the visible parts. | |
4328 | */ | |
4329 | static void mem_cgroup_css_reset(struct cgroup_subsys_state *css) | |
4330 | { | |
4331 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); | |
4332 | ||
d334c9bc VD |
4333 | page_counter_limit(&memcg->memory, PAGE_COUNTER_MAX); |
4334 | page_counter_limit(&memcg->swap, PAGE_COUNTER_MAX); | |
4335 | page_counter_limit(&memcg->memsw, PAGE_COUNTER_MAX); | |
4336 | page_counter_limit(&memcg->kmem, PAGE_COUNTER_MAX); | |
4337 | page_counter_limit(&memcg->tcpmem, PAGE_COUNTER_MAX); | |
241994ed JW |
4338 | memcg->low = 0; |
4339 | memcg->high = PAGE_COUNTER_MAX; | |
24d404dc | 4340 | memcg->soft_limit = PAGE_COUNTER_MAX; |
2529bb3a | 4341 | memcg_wb_domain_size_changed(memcg); |
1ced953b TH |
4342 | } |
4343 | ||
02491447 | 4344 | #ifdef CONFIG_MMU |
7dc74be0 | 4345 | /* Handlers for move charge at task migration. */ |
854ffa8d | 4346 | static int mem_cgroup_do_precharge(unsigned long count) |
7dc74be0 | 4347 | { |
05b84301 | 4348 | int ret; |
9476db97 | 4349 | |
d0164adc MG |
4350 | /* Try a single bulk charge without reclaim first, kswapd may wake */ |
4351 | ret = try_charge(mc.to, GFP_KERNEL & ~__GFP_DIRECT_RECLAIM, count); | |
9476db97 | 4352 | if (!ret) { |
854ffa8d | 4353 | mc.precharge += count; |
854ffa8d DN |
4354 | return ret; |
4355 | } | |
9476db97 | 4356 | |
3674534b | 4357 | /* Try charges one by one with reclaim, but do not retry */ |
854ffa8d | 4358 | while (count--) { |
3674534b | 4359 | ret = try_charge(mc.to, GFP_KERNEL | __GFP_NORETRY, 1); |
38c5d72f | 4360 | if (ret) |
38c5d72f | 4361 | return ret; |
854ffa8d | 4362 | mc.precharge++; |
9476db97 | 4363 | cond_resched(); |
854ffa8d | 4364 | } |
9476db97 | 4365 | return 0; |
4ffef5fe DN |
4366 | } |
4367 | ||
4ffef5fe DN |
4368 | union mc_target { |
4369 | struct page *page; | |
02491447 | 4370 | swp_entry_t ent; |
4ffef5fe DN |
4371 | }; |
4372 | ||
4ffef5fe | 4373 | enum mc_target_type { |
8d32ff84 | 4374 | MC_TARGET_NONE = 0, |
4ffef5fe | 4375 | MC_TARGET_PAGE, |
02491447 | 4376 | MC_TARGET_SWAP, |
4ffef5fe DN |
4377 | }; |
4378 | ||
90254a65 DN |
4379 | static struct page *mc_handle_present_pte(struct vm_area_struct *vma, |
4380 | unsigned long addr, pte_t ptent) | |
4ffef5fe | 4381 | { |
90254a65 | 4382 | struct page *page = vm_normal_page(vma, addr, ptent); |
4ffef5fe | 4383 | |
90254a65 DN |
4384 | if (!page || !page_mapped(page)) |
4385 | return NULL; | |
4386 | if (PageAnon(page)) { | |
1dfab5ab | 4387 | if (!(mc.flags & MOVE_ANON)) |
90254a65 | 4388 | return NULL; |
1dfab5ab JW |
4389 | } else { |
4390 | if (!(mc.flags & MOVE_FILE)) | |
4391 | return NULL; | |
4392 | } | |
90254a65 DN |
4393 | if (!get_page_unless_zero(page)) |
4394 | return NULL; | |
4395 | ||
4396 | return page; | |
4397 | } | |
4398 | ||
4b91355e | 4399 | #ifdef CONFIG_SWAP |
90254a65 | 4400 | static struct page *mc_handle_swap_pte(struct vm_area_struct *vma, |
48406ef8 | 4401 | pte_t ptent, swp_entry_t *entry) |
90254a65 | 4402 | { |
90254a65 DN |
4403 | struct page *page = NULL; |
4404 | swp_entry_t ent = pte_to_swp_entry(ptent); | |
4405 | ||
1dfab5ab | 4406 | if (!(mc.flags & MOVE_ANON) || non_swap_entry(ent)) |
90254a65 | 4407 | return NULL; |
4b91355e KH |
4408 | /* |
4409 | * Because lookup_swap_cache() updates some statistics counter, | |
4410 | * we call find_get_page() with swapper_space directly. | |
4411 | */ | |
f6ab1f7f | 4412 | page = find_get_page(swap_address_space(ent), swp_offset(ent)); |
7941d214 | 4413 | if (do_memsw_account()) |
90254a65 DN |
4414 | entry->val = ent.val; |
4415 | ||
4416 | return page; | |
4417 | } | |
4b91355e KH |
4418 | #else |
4419 | static struct page *mc_handle_swap_pte(struct vm_area_struct *vma, | |
48406ef8 | 4420 | pte_t ptent, swp_entry_t *entry) |
4b91355e KH |
4421 | { |
4422 | return NULL; | |
4423 | } | |
4424 | #endif | |
90254a65 | 4425 | |
87946a72 DN |
4426 | static struct page *mc_handle_file_pte(struct vm_area_struct *vma, |
4427 | unsigned long addr, pte_t ptent, swp_entry_t *entry) | |
4428 | { | |
4429 | struct page *page = NULL; | |
87946a72 DN |
4430 | struct address_space *mapping; |
4431 | pgoff_t pgoff; | |
4432 | ||
4433 | if (!vma->vm_file) /* anonymous vma */ | |
4434 | return NULL; | |
1dfab5ab | 4435 | if (!(mc.flags & MOVE_FILE)) |
87946a72 DN |
4436 | return NULL; |
4437 | ||
87946a72 | 4438 | mapping = vma->vm_file->f_mapping; |
0661a336 | 4439 | pgoff = linear_page_index(vma, addr); |
87946a72 DN |
4440 | |
4441 | /* page is moved even if it's not RSS of this task(page-faulted). */ | |
aa3b1895 HD |
4442 | #ifdef CONFIG_SWAP |
4443 | /* shmem/tmpfs may report page out on swap: account for that too. */ | |
139b6a6f JW |
4444 | if (shmem_mapping(mapping)) { |
4445 | page = find_get_entry(mapping, pgoff); | |
4446 | if (radix_tree_exceptional_entry(page)) { | |
4447 | swp_entry_t swp = radix_to_swp_entry(page); | |
7941d214 | 4448 | if (do_memsw_account()) |
139b6a6f | 4449 | *entry = swp; |
f6ab1f7f HY |
4450 | page = find_get_page(swap_address_space(swp), |
4451 | swp_offset(swp)); | |
139b6a6f JW |
4452 | } |
4453 | } else | |
4454 | page = find_get_page(mapping, pgoff); | |
4455 | #else | |
4456 | page = find_get_page(mapping, pgoff); | |
aa3b1895 | 4457 | #endif |
87946a72 DN |
4458 | return page; |
4459 | } | |
4460 | ||
b1b0deab CG |
4461 | /** |
4462 | * mem_cgroup_move_account - move account of the page | |
4463 | * @page: the page | |
25843c2b | 4464 | * @compound: charge the page as compound or small page |
b1b0deab CG |
4465 | * @from: mem_cgroup which the page is moved from. |
4466 | * @to: mem_cgroup which the page is moved to. @from != @to. | |
4467 | * | |
3ac808fd | 4468 | * The caller must make sure the page is not on LRU (isolate_page() is useful.) |
b1b0deab CG |
4469 | * |
4470 | * This function doesn't do "charge" to new cgroup and doesn't do "uncharge" | |
4471 | * from old cgroup. | |
4472 | */ | |
4473 | static int mem_cgroup_move_account(struct page *page, | |
f627c2f5 | 4474 | bool compound, |
b1b0deab CG |
4475 | struct mem_cgroup *from, |
4476 | struct mem_cgroup *to) | |
4477 | { | |
4478 | unsigned long flags; | |
f627c2f5 | 4479 | unsigned int nr_pages = compound ? hpage_nr_pages(page) : 1; |
b1b0deab | 4480 | int ret; |
c4843a75 | 4481 | bool anon; |
b1b0deab CG |
4482 | |
4483 | VM_BUG_ON(from == to); | |
4484 | VM_BUG_ON_PAGE(PageLRU(page), page); | |
f627c2f5 | 4485 | VM_BUG_ON(compound && !PageTransHuge(page)); |
b1b0deab CG |
4486 | |
4487 | /* | |
6a93ca8f | 4488 | * Prevent mem_cgroup_migrate() from looking at |
45637bab | 4489 | * page->mem_cgroup of its source page while we change it. |
b1b0deab | 4490 | */ |
f627c2f5 | 4491 | ret = -EBUSY; |
b1b0deab CG |
4492 | if (!trylock_page(page)) |
4493 | goto out; | |
4494 | ||
4495 | ret = -EINVAL; | |
4496 | if (page->mem_cgroup != from) | |
4497 | goto out_unlock; | |
4498 | ||
c4843a75 GT |
4499 | anon = PageAnon(page); |
4500 | ||
b1b0deab CG |
4501 | spin_lock_irqsave(&from->move_lock, flags); |
4502 | ||
c4843a75 | 4503 | if (!anon && page_mapped(page)) { |
b1b0deab CG |
4504 | __this_cpu_sub(from->stat->count[MEM_CGROUP_STAT_FILE_MAPPED], |
4505 | nr_pages); | |
4506 | __this_cpu_add(to->stat->count[MEM_CGROUP_STAT_FILE_MAPPED], | |
4507 | nr_pages); | |
4508 | } | |
4509 | ||
c4843a75 GT |
4510 | /* |
4511 | * move_lock grabbed above and caller set from->moving_account, so | |
4512 | * mem_cgroup_update_page_stat() will serialize updates to PageDirty. | |
4513 | * So mapping should be stable for dirty pages. | |
4514 | */ | |
4515 | if (!anon && PageDirty(page)) { | |
4516 | struct address_space *mapping = page_mapping(page); | |
4517 | ||
4518 | if (mapping_cap_account_dirty(mapping)) { | |
4519 | __this_cpu_sub(from->stat->count[MEM_CGROUP_STAT_DIRTY], | |
4520 | nr_pages); | |
4521 | __this_cpu_add(to->stat->count[MEM_CGROUP_STAT_DIRTY], | |
4522 | nr_pages); | |
4523 | } | |
4524 | } | |
4525 | ||
b1b0deab CG |
4526 | if (PageWriteback(page)) { |
4527 | __this_cpu_sub(from->stat->count[MEM_CGROUP_STAT_WRITEBACK], | |
4528 | nr_pages); | |
4529 | __this_cpu_add(to->stat->count[MEM_CGROUP_STAT_WRITEBACK], | |
4530 | nr_pages); | |
4531 | } | |
4532 | ||
4533 | /* | |
4534 | * It is safe to change page->mem_cgroup here because the page | |
4535 | * is referenced, charged, and isolated - we can't race with | |
4536 | * uncharging, charging, migration, or LRU putback. | |
4537 | */ | |
4538 | ||
4539 | /* caller should have done css_get */ | |
4540 | page->mem_cgroup = to; | |
4541 | spin_unlock_irqrestore(&from->move_lock, flags); | |
4542 | ||
4543 | ret = 0; | |
4544 | ||
4545 | local_irq_disable(); | |
f627c2f5 | 4546 | mem_cgroup_charge_statistics(to, page, compound, nr_pages); |
b1b0deab | 4547 | memcg_check_events(to, page); |
f627c2f5 | 4548 | mem_cgroup_charge_statistics(from, page, compound, -nr_pages); |
b1b0deab CG |
4549 | memcg_check_events(from, page); |
4550 | local_irq_enable(); | |
4551 | out_unlock: | |
4552 | unlock_page(page); | |
4553 | out: | |
4554 | return ret; | |
4555 | } | |
4556 | ||
7cf7806c LR |
4557 | /** |
4558 | * get_mctgt_type - get target type of moving charge | |
4559 | * @vma: the vma the pte to be checked belongs | |
4560 | * @addr: the address corresponding to the pte to be checked | |
4561 | * @ptent: the pte to be checked | |
4562 | * @target: the pointer the target page or swap ent will be stored(can be NULL) | |
4563 | * | |
4564 | * Returns | |
4565 | * 0(MC_TARGET_NONE): if the pte is not a target for move charge. | |
4566 | * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for | |
4567 | * move charge. if @target is not NULL, the page is stored in target->page | |
4568 | * with extra refcnt got(Callers should handle it). | |
4569 | * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a | |
4570 | * target for charge migration. if @target is not NULL, the entry is stored | |
4571 | * in target->ent. | |
4572 | * | |
4573 | * Called with pte lock held. | |
4574 | */ | |
4575 | ||
8d32ff84 | 4576 | static enum mc_target_type get_mctgt_type(struct vm_area_struct *vma, |
90254a65 DN |
4577 | unsigned long addr, pte_t ptent, union mc_target *target) |
4578 | { | |
4579 | struct page *page = NULL; | |
8d32ff84 | 4580 | enum mc_target_type ret = MC_TARGET_NONE; |
90254a65 DN |
4581 | swp_entry_t ent = { .val = 0 }; |
4582 | ||
4583 | if (pte_present(ptent)) | |
4584 | page = mc_handle_present_pte(vma, addr, ptent); | |
4585 | else if (is_swap_pte(ptent)) | |
48406ef8 | 4586 | page = mc_handle_swap_pte(vma, ptent, &ent); |
0661a336 | 4587 | else if (pte_none(ptent)) |
87946a72 | 4588 | page = mc_handle_file_pte(vma, addr, ptent, &ent); |
90254a65 DN |
4589 | |
4590 | if (!page && !ent.val) | |
8d32ff84 | 4591 | return ret; |
02491447 | 4592 | if (page) { |
02491447 | 4593 | /* |
0a31bc97 | 4594 | * Do only loose check w/o serialization. |
1306a85a | 4595 | * mem_cgroup_move_account() checks the page is valid or |
0a31bc97 | 4596 | * not under LRU exclusion. |
02491447 | 4597 | */ |
1306a85a | 4598 | if (page->mem_cgroup == mc.from) { |
02491447 DN |
4599 | ret = MC_TARGET_PAGE; |
4600 | if (target) | |
4601 | target->page = page; | |
4602 | } | |
4603 | if (!ret || !target) | |
4604 | put_page(page); | |
4605 | } | |
90254a65 DN |
4606 | /* There is a swap entry and a page doesn't exist or isn't charged */ |
4607 | if (ent.val && !ret && | |
34c00c31 | 4608 | mem_cgroup_id(mc.from) == lookup_swap_cgroup_id(ent)) { |
7f0f1546 KH |
4609 | ret = MC_TARGET_SWAP; |
4610 | if (target) | |
4611 | target->ent = ent; | |
4ffef5fe | 4612 | } |
4ffef5fe DN |
4613 | return ret; |
4614 | } | |
4615 | ||
12724850 NH |
4616 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE |
4617 | /* | |
4618 | * We don't consider swapping or file mapped pages because THP does not | |
4619 | * support them for now. | |
4620 | * Caller should make sure that pmd_trans_huge(pmd) is true. | |
4621 | */ | |
4622 | static enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma, | |
4623 | unsigned long addr, pmd_t pmd, union mc_target *target) | |
4624 | { | |
4625 | struct page *page = NULL; | |
12724850 NH |
4626 | enum mc_target_type ret = MC_TARGET_NONE; |
4627 | ||
4628 | page = pmd_page(pmd); | |
309381fe | 4629 | VM_BUG_ON_PAGE(!page || !PageHead(page), page); |
1dfab5ab | 4630 | if (!(mc.flags & MOVE_ANON)) |
12724850 | 4631 | return ret; |
1306a85a | 4632 | if (page->mem_cgroup == mc.from) { |
12724850 NH |
4633 | ret = MC_TARGET_PAGE; |
4634 | if (target) { | |
4635 | get_page(page); | |
4636 | target->page = page; | |
4637 | } | |
4638 | } | |
4639 | return ret; | |
4640 | } | |
4641 | #else | |
4642 | static inline enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma, | |
4643 | unsigned long addr, pmd_t pmd, union mc_target *target) | |
4644 | { | |
4645 | return MC_TARGET_NONE; | |
4646 | } | |
4647 | #endif | |
4648 | ||
4ffef5fe DN |
4649 | static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd, |
4650 | unsigned long addr, unsigned long end, | |
4651 | struct mm_walk *walk) | |
4652 | { | |
26bcd64a | 4653 | struct vm_area_struct *vma = walk->vma; |
4ffef5fe DN |
4654 | pte_t *pte; |
4655 | spinlock_t *ptl; | |
4656 | ||
b6ec57f4 KS |
4657 | ptl = pmd_trans_huge_lock(pmd, vma); |
4658 | if (ptl) { | |
12724850 NH |
4659 | if (get_mctgt_type_thp(vma, addr, *pmd, NULL) == MC_TARGET_PAGE) |
4660 | mc.precharge += HPAGE_PMD_NR; | |
bf929152 | 4661 | spin_unlock(ptl); |
1a5a9906 | 4662 | return 0; |
12724850 | 4663 | } |
03319327 | 4664 | |
45f83cef AA |
4665 | if (pmd_trans_unstable(pmd)) |
4666 | return 0; | |
4ffef5fe DN |
4667 | pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl); |
4668 | for (; addr != end; pte++, addr += PAGE_SIZE) | |
8d32ff84 | 4669 | if (get_mctgt_type(vma, addr, *pte, NULL)) |
4ffef5fe DN |
4670 | mc.precharge++; /* increment precharge temporarily */ |
4671 | pte_unmap_unlock(pte - 1, ptl); | |
4672 | cond_resched(); | |
4673 | ||
7dc74be0 DN |
4674 | return 0; |
4675 | } | |
4676 | ||
4ffef5fe DN |
4677 | static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm) |
4678 | { | |
4679 | unsigned long precharge; | |
4ffef5fe | 4680 | |
26bcd64a NH |
4681 | struct mm_walk mem_cgroup_count_precharge_walk = { |
4682 | .pmd_entry = mem_cgroup_count_precharge_pte_range, | |
4683 | .mm = mm, | |
4684 | }; | |
dfe076b0 | 4685 | down_read(&mm->mmap_sem); |
0247f3f4 JM |
4686 | walk_page_range(0, mm->highest_vm_end, |
4687 | &mem_cgroup_count_precharge_walk); | |
dfe076b0 | 4688 | up_read(&mm->mmap_sem); |
4ffef5fe DN |
4689 | |
4690 | precharge = mc.precharge; | |
4691 | mc.precharge = 0; | |
4692 | ||
4693 | return precharge; | |
4694 | } | |
4695 | ||
4ffef5fe DN |
4696 | static int mem_cgroup_precharge_mc(struct mm_struct *mm) |
4697 | { | |
dfe076b0 DN |
4698 | unsigned long precharge = mem_cgroup_count_precharge(mm); |
4699 | ||
4700 | VM_BUG_ON(mc.moving_task); | |
4701 | mc.moving_task = current; | |
4702 | return mem_cgroup_do_precharge(precharge); | |
4ffef5fe DN |
4703 | } |
4704 | ||
dfe076b0 DN |
4705 | /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */ |
4706 | static void __mem_cgroup_clear_mc(void) | |
4ffef5fe | 4707 | { |
2bd9bb20 KH |
4708 | struct mem_cgroup *from = mc.from; |
4709 | struct mem_cgroup *to = mc.to; | |
4710 | ||
4ffef5fe | 4711 | /* we must uncharge all the leftover precharges from mc.to */ |
854ffa8d | 4712 | if (mc.precharge) { |
00501b53 | 4713 | cancel_charge(mc.to, mc.precharge); |
854ffa8d DN |
4714 | mc.precharge = 0; |
4715 | } | |
4716 | /* | |
4717 | * we didn't uncharge from mc.from at mem_cgroup_move_account(), so | |
4718 | * we must uncharge here. | |
4719 | */ | |
4720 | if (mc.moved_charge) { | |
00501b53 | 4721 | cancel_charge(mc.from, mc.moved_charge); |
854ffa8d | 4722 | mc.moved_charge = 0; |
4ffef5fe | 4723 | } |
483c30b5 DN |
4724 | /* we must fixup refcnts and charges */ |
4725 | if (mc.moved_swap) { | |
483c30b5 | 4726 | /* uncharge swap account from the old cgroup */ |
ce00a967 | 4727 | if (!mem_cgroup_is_root(mc.from)) |
3e32cb2e | 4728 | page_counter_uncharge(&mc.from->memsw, mc.moved_swap); |
483c30b5 | 4729 | |
615d66c3 VD |
4730 | mem_cgroup_id_put_many(mc.from, mc.moved_swap); |
4731 | ||
05b84301 | 4732 | /* |
3e32cb2e JW |
4733 | * we charged both to->memory and to->memsw, so we |
4734 | * should uncharge to->memory. | |
05b84301 | 4735 | */ |
ce00a967 | 4736 | if (!mem_cgroup_is_root(mc.to)) |
3e32cb2e JW |
4737 | page_counter_uncharge(&mc.to->memory, mc.moved_swap); |
4738 | ||
615d66c3 VD |
4739 | mem_cgroup_id_get_many(mc.to, mc.moved_swap); |
4740 | css_put_many(&mc.to->css, mc.moved_swap); | |
3e32cb2e | 4741 | |
483c30b5 DN |
4742 | mc.moved_swap = 0; |
4743 | } | |
dfe076b0 DN |
4744 | memcg_oom_recover(from); |
4745 | memcg_oom_recover(to); | |
4746 | wake_up_all(&mc.waitq); | |
4747 | } | |
4748 | ||
4749 | static void mem_cgroup_clear_mc(void) | |
4750 | { | |
264a0ae1 TH |
4751 | struct mm_struct *mm = mc.mm; |
4752 | ||
dfe076b0 DN |
4753 | /* |
4754 | * we must clear moving_task before waking up waiters at the end of | |
4755 | * task migration. | |
4756 | */ | |
4757 | mc.moving_task = NULL; | |
4758 | __mem_cgroup_clear_mc(); | |
2bd9bb20 | 4759 | spin_lock(&mc.lock); |
4ffef5fe DN |
4760 | mc.from = NULL; |
4761 | mc.to = NULL; | |
264a0ae1 | 4762 | mc.mm = NULL; |
2bd9bb20 | 4763 | spin_unlock(&mc.lock); |
264a0ae1 TH |
4764 | |
4765 | mmput(mm); | |
4ffef5fe DN |
4766 | } |
4767 | ||
1f7dd3e5 | 4768 | static int mem_cgroup_can_attach(struct cgroup_taskset *tset) |
7dc74be0 | 4769 | { |
1f7dd3e5 | 4770 | struct cgroup_subsys_state *css; |
eed67d75 | 4771 | struct mem_cgroup *memcg = NULL; /* unneeded init to make gcc happy */ |
9f2115f9 | 4772 | struct mem_cgroup *from; |
4530eddb | 4773 | struct task_struct *leader, *p; |
9f2115f9 | 4774 | struct mm_struct *mm; |
1dfab5ab | 4775 | unsigned long move_flags; |
9f2115f9 | 4776 | int ret = 0; |
7dc74be0 | 4777 | |
1f7dd3e5 TH |
4778 | /* charge immigration isn't supported on the default hierarchy */ |
4779 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) | |
9f2115f9 TH |
4780 | return 0; |
4781 | ||
4530eddb TH |
4782 | /* |
4783 | * Multi-process migrations only happen on the default hierarchy | |
4784 | * where charge immigration is not used. Perform charge | |
4785 | * immigration if @tset contains a leader and whine if there are | |
4786 | * multiple. | |
4787 | */ | |
4788 | p = NULL; | |
1f7dd3e5 | 4789 | cgroup_taskset_for_each_leader(leader, css, tset) { |
4530eddb TH |
4790 | WARN_ON_ONCE(p); |
4791 | p = leader; | |
1f7dd3e5 | 4792 | memcg = mem_cgroup_from_css(css); |
4530eddb TH |
4793 | } |
4794 | if (!p) | |
4795 | return 0; | |
4796 | ||
1f7dd3e5 TH |
4797 | /* |
4798 | * We are now commited to this value whatever it is. Changes in this | |
4799 | * tunable will only affect upcoming migrations, not the current one. | |
4800 | * So we need to save it, and keep it going. | |
4801 | */ | |
4802 | move_flags = READ_ONCE(memcg->move_charge_at_immigrate); | |
4803 | if (!move_flags) | |
4804 | return 0; | |
4805 | ||
9f2115f9 TH |
4806 | from = mem_cgroup_from_task(p); |
4807 | ||
4808 | VM_BUG_ON(from == memcg); | |
4809 | ||
4810 | mm = get_task_mm(p); | |
4811 | if (!mm) | |
4812 | return 0; | |
4813 | /* We move charges only when we move a owner of the mm */ | |
4814 | if (mm->owner == p) { | |
4815 | VM_BUG_ON(mc.from); | |
4816 | VM_BUG_ON(mc.to); | |
4817 | VM_BUG_ON(mc.precharge); | |
4818 | VM_BUG_ON(mc.moved_charge); | |
4819 | VM_BUG_ON(mc.moved_swap); | |
4820 | ||
4821 | spin_lock(&mc.lock); | |
264a0ae1 | 4822 | mc.mm = mm; |
9f2115f9 TH |
4823 | mc.from = from; |
4824 | mc.to = memcg; | |
4825 | mc.flags = move_flags; | |
4826 | spin_unlock(&mc.lock); | |
4827 | /* We set mc.moving_task later */ | |
4828 | ||
4829 | ret = mem_cgroup_precharge_mc(mm); | |
4830 | if (ret) | |
4831 | mem_cgroup_clear_mc(); | |
264a0ae1 TH |
4832 | } else { |
4833 | mmput(mm); | |
7dc74be0 DN |
4834 | } |
4835 | return ret; | |
4836 | } | |
4837 | ||
1f7dd3e5 | 4838 | static void mem_cgroup_cancel_attach(struct cgroup_taskset *tset) |
7dc74be0 | 4839 | { |
4e2f245d JW |
4840 | if (mc.to) |
4841 | mem_cgroup_clear_mc(); | |
7dc74be0 DN |
4842 | } |
4843 | ||
4ffef5fe DN |
4844 | static int mem_cgroup_move_charge_pte_range(pmd_t *pmd, |
4845 | unsigned long addr, unsigned long end, | |
4846 | struct mm_walk *walk) | |
7dc74be0 | 4847 | { |
4ffef5fe | 4848 | int ret = 0; |
26bcd64a | 4849 | struct vm_area_struct *vma = walk->vma; |
4ffef5fe DN |
4850 | pte_t *pte; |
4851 | spinlock_t *ptl; | |
12724850 NH |
4852 | enum mc_target_type target_type; |
4853 | union mc_target target; | |
4854 | struct page *page; | |
4ffef5fe | 4855 | |
b6ec57f4 KS |
4856 | ptl = pmd_trans_huge_lock(pmd, vma); |
4857 | if (ptl) { | |
62ade86a | 4858 | if (mc.precharge < HPAGE_PMD_NR) { |
bf929152 | 4859 | spin_unlock(ptl); |
12724850 NH |
4860 | return 0; |
4861 | } | |
4862 | target_type = get_mctgt_type_thp(vma, addr, *pmd, &target); | |
4863 | if (target_type == MC_TARGET_PAGE) { | |
4864 | page = target.page; | |
4865 | if (!isolate_lru_page(page)) { | |
f627c2f5 | 4866 | if (!mem_cgroup_move_account(page, true, |
1306a85a | 4867 | mc.from, mc.to)) { |
12724850 NH |
4868 | mc.precharge -= HPAGE_PMD_NR; |
4869 | mc.moved_charge += HPAGE_PMD_NR; | |
4870 | } | |
4871 | putback_lru_page(page); | |
4872 | } | |
4873 | put_page(page); | |
4874 | } | |
bf929152 | 4875 | spin_unlock(ptl); |
1a5a9906 | 4876 | return 0; |
12724850 NH |
4877 | } |
4878 | ||
45f83cef AA |
4879 | if (pmd_trans_unstable(pmd)) |
4880 | return 0; | |
4ffef5fe DN |
4881 | retry: |
4882 | pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl); | |
4883 | for (; addr != end; addr += PAGE_SIZE) { | |
4884 | pte_t ptent = *(pte++); | |
02491447 | 4885 | swp_entry_t ent; |
4ffef5fe DN |
4886 | |
4887 | if (!mc.precharge) | |
4888 | break; | |
4889 | ||
8d32ff84 | 4890 | switch (get_mctgt_type(vma, addr, ptent, &target)) { |
4ffef5fe DN |
4891 | case MC_TARGET_PAGE: |
4892 | page = target.page; | |
53f9263b KS |
4893 | /* |
4894 | * We can have a part of the split pmd here. Moving it | |
4895 | * can be done but it would be too convoluted so simply | |
4896 | * ignore such a partial THP and keep it in original | |
4897 | * memcg. There should be somebody mapping the head. | |
4898 | */ | |
4899 | if (PageTransCompound(page)) | |
4900 | goto put; | |
4ffef5fe DN |
4901 | if (isolate_lru_page(page)) |
4902 | goto put; | |
f627c2f5 KS |
4903 | if (!mem_cgroup_move_account(page, false, |
4904 | mc.from, mc.to)) { | |
4ffef5fe | 4905 | mc.precharge--; |
854ffa8d DN |
4906 | /* we uncharge from mc.from later. */ |
4907 | mc.moved_charge++; | |
4ffef5fe DN |
4908 | } |
4909 | putback_lru_page(page); | |
8d32ff84 | 4910 | put: /* get_mctgt_type() gets the page */ |
4ffef5fe DN |
4911 | put_page(page); |
4912 | break; | |
02491447 DN |
4913 | case MC_TARGET_SWAP: |
4914 | ent = target.ent; | |
e91cbb42 | 4915 | if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to)) { |
02491447 | 4916 | mc.precharge--; |
483c30b5 DN |
4917 | /* we fixup refcnts and charges later. */ |
4918 | mc.moved_swap++; | |
4919 | } | |
02491447 | 4920 | break; |
4ffef5fe DN |
4921 | default: |
4922 | break; | |
4923 | } | |
4924 | } | |
4925 | pte_unmap_unlock(pte - 1, ptl); | |
4926 | cond_resched(); | |
4927 | ||
4928 | if (addr != end) { | |
4929 | /* | |
4930 | * We have consumed all precharges we got in can_attach(). | |
4931 | * We try charge one by one, but don't do any additional | |
4932 | * charges to mc.to if we have failed in charge once in attach() | |
4933 | * phase. | |
4934 | */ | |
854ffa8d | 4935 | ret = mem_cgroup_do_precharge(1); |
4ffef5fe DN |
4936 | if (!ret) |
4937 | goto retry; | |
4938 | } | |
4939 | ||
4940 | return ret; | |
4941 | } | |
4942 | ||
264a0ae1 | 4943 | static void mem_cgroup_move_charge(void) |
4ffef5fe | 4944 | { |
26bcd64a NH |
4945 | struct mm_walk mem_cgroup_move_charge_walk = { |
4946 | .pmd_entry = mem_cgroup_move_charge_pte_range, | |
264a0ae1 | 4947 | .mm = mc.mm, |
26bcd64a | 4948 | }; |
4ffef5fe DN |
4949 | |
4950 | lru_add_drain_all(); | |
312722cb | 4951 | /* |
81f8c3a4 JW |
4952 | * Signal lock_page_memcg() to take the memcg's move_lock |
4953 | * while we're moving its pages to another memcg. Then wait | |
4954 | * for already started RCU-only updates to finish. | |
312722cb JW |
4955 | */ |
4956 | atomic_inc(&mc.from->moving_account); | |
4957 | synchronize_rcu(); | |
dfe076b0 | 4958 | retry: |
264a0ae1 | 4959 | if (unlikely(!down_read_trylock(&mc.mm->mmap_sem))) { |
dfe076b0 DN |
4960 | /* |
4961 | * Someone who are holding the mmap_sem might be waiting in | |
4962 | * waitq. So we cancel all extra charges, wake up all waiters, | |
4963 | * and retry. Because we cancel precharges, we might not be able | |
4964 | * to move enough charges, but moving charge is a best-effort | |
4965 | * feature anyway, so it wouldn't be a big problem. | |
4966 | */ | |
4967 | __mem_cgroup_clear_mc(); | |
4968 | cond_resched(); | |
4969 | goto retry; | |
4970 | } | |
26bcd64a NH |
4971 | /* |
4972 | * When we have consumed all precharges and failed in doing | |
4973 | * additional charge, the page walk just aborts. | |
4974 | */ | |
0247f3f4 JM |
4975 | walk_page_range(0, mc.mm->highest_vm_end, &mem_cgroup_move_charge_walk); |
4976 | ||
264a0ae1 | 4977 | up_read(&mc.mm->mmap_sem); |
312722cb | 4978 | atomic_dec(&mc.from->moving_account); |
7dc74be0 DN |
4979 | } |
4980 | ||
264a0ae1 | 4981 | static void mem_cgroup_move_task(void) |
67e465a7 | 4982 | { |
264a0ae1 TH |
4983 | if (mc.to) { |
4984 | mem_cgroup_move_charge(); | |
a433658c | 4985 | mem_cgroup_clear_mc(); |
264a0ae1 | 4986 | } |
67e465a7 | 4987 | } |
5cfb80a7 | 4988 | #else /* !CONFIG_MMU */ |
1f7dd3e5 | 4989 | static int mem_cgroup_can_attach(struct cgroup_taskset *tset) |
5cfb80a7 DN |
4990 | { |
4991 | return 0; | |
4992 | } | |
1f7dd3e5 | 4993 | static void mem_cgroup_cancel_attach(struct cgroup_taskset *tset) |
5cfb80a7 DN |
4994 | { |
4995 | } | |
264a0ae1 | 4996 | static void mem_cgroup_move_task(void) |
5cfb80a7 DN |
4997 | { |
4998 | } | |
4999 | #endif | |
67e465a7 | 5000 | |
f00baae7 TH |
5001 | /* |
5002 | * Cgroup retains root cgroups across [un]mount cycles making it necessary | |
aa6ec29b TH |
5003 | * to verify whether we're attached to the default hierarchy on each mount |
5004 | * attempt. | |
f00baae7 | 5005 | */ |
eb95419b | 5006 | static void mem_cgroup_bind(struct cgroup_subsys_state *root_css) |
f00baae7 TH |
5007 | { |
5008 | /* | |
aa6ec29b | 5009 | * use_hierarchy is forced on the default hierarchy. cgroup core |
f00baae7 TH |
5010 | * guarantees that @root doesn't have any children, so turning it |
5011 | * on for the root memcg is enough. | |
5012 | */ | |
9e10a130 | 5013 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
7feee590 VD |
5014 | root_mem_cgroup->use_hierarchy = true; |
5015 | else | |
5016 | root_mem_cgroup->use_hierarchy = false; | |
f00baae7 TH |
5017 | } |
5018 | ||
241994ed JW |
5019 | static u64 memory_current_read(struct cgroup_subsys_state *css, |
5020 | struct cftype *cft) | |
5021 | { | |
f5fc3c5d JW |
5022 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
5023 | ||
5024 | return (u64)page_counter_read(&memcg->memory) * PAGE_SIZE; | |
241994ed JW |
5025 | } |
5026 | ||
5027 | static int memory_low_show(struct seq_file *m, void *v) | |
5028 | { | |
5029 | struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m)); | |
4db0c3c2 | 5030 | unsigned long low = READ_ONCE(memcg->low); |
241994ed JW |
5031 | |
5032 | if (low == PAGE_COUNTER_MAX) | |
d2973697 | 5033 | seq_puts(m, "max\n"); |
241994ed JW |
5034 | else |
5035 | seq_printf(m, "%llu\n", (u64)low * PAGE_SIZE); | |
5036 | ||
5037 | return 0; | |
5038 | } | |
5039 | ||
5040 | static ssize_t memory_low_write(struct kernfs_open_file *of, | |
5041 | char *buf, size_t nbytes, loff_t off) | |
5042 | { | |
5043 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
5044 | unsigned long low; | |
5045 | int err; | |
5046 | ||
5047 | buf = strstrip(buf); | |
d2973697 | 5048 | err = page_counter_memparse(buf, "max", &low); |
241994ed JW |
5049 | if (err) |
5050 | return err; | |
5051 | ||
5052 | memcg->low = low; | |
5053 | ||
5054 | return nbytes; | |
5055 | } | |
5056 | ||
5057 | static int memory_high_show(struct seq_file *m, void *v) | |
5058 | { | |
5059 | struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m)); | |
4db0c3c2 | 5060 | unsigned long high = READ_ONCE(memcg->high); |
241994ed JW |
5061 | |
5062 | if (high == PAGE_COUNTER_MAX) | |
d2973697 | 5063 | seq_puts(m, "max\n"); |
241994ed JW |
5064 | else |
5065 | seq_printf(m, "%llu\n", (u64)high * PAGE_SIZE); | |
5066 | ||
5067 | return 0; | |
5068 | } | |
5069 | ||
5070 | static ssize_t memory_high_write(struct kernfs_open_file *of, | |
5071 | char *buf, size_t nbytes, loff_t off) | |
5072 | { | |
5073 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
588083bb | 5074 | unsigned long nr_pages; |
241994ed JW |
5075 | unsigned long high; |
5076 | int err; | |
5077 | ||
5078 | buf = strstrip(buf); | |
d2973697 | 5079 | err = page_counter_memparse(buf, "max", &high); |
241994ed JW |
5080 | if (err) |
5081 | return err; | |
5082 | ||
5083 | memcg->high = high; | |
5084 | ||
588083bb JW |
5085 | nr_pages = page_counter_read(&memcg->memory); |
5086 | if (nr_pages > high) | |
5087 | try_to_free_mem_cgroup_pages(memcg, nr_pages - high, | |
5088 | GFP_KERNEL, true); | |
5089 | ||
2529bb3a | 5090 | memcg_wb_domain_size_changed(memcg); |
241994ed JW |
5091 | return nbytes; |
5092 | } | |
5093 | ||
5094 | static int memory_max_show(struct seq_file *m, void *v) | |
5095 | { | |
5096 | struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m)); | |
4db0c3c2 | 5097 | unsigned long max = READ_ONCE(memcg->memory.limit); |
241994ed JW |
5098 | |
5099 | if (max == PAGE_COUNTER_MAX) | |
d2973697 | 5100 | seq_puts(m, "max\n"); |
241994ed JW |
5101 | else |
5102 | seq_printf(m, "%llu\n", (u64)max * PAGE_SIZE); | |
5103 | ||
5104 | return 0; | |
5105 | } | |
5106 | ||
5107 | static ssize_t memory_max_write(struct kernfs_open_file *of, | |
5108 | char *buf, size_t nbytes, loff_t off) | |
5109 | { | |
5110 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
b6e6edcf JW |
5111 | unsigned int nr_reclaims = MEM_CGROUP_RECLAIM_RETRIES; |
5112 | bool drained = false; | |
241994ed JW |
5113 | unsigned long max; |
5114 | int err; | |
5115 | ||
5116 | buf = strstrip(buf); | |
d2973697 | 5117 | err = page_counter_memparse(buf, "max", &max); |
241994ed JW |
5118 | if (err) |
5119 | return err; | |
5120 | ||
b6e6edcf JW |
5121 | xchg(&memcg->memory.limit, max); |
5122 | ||
5123 | for (;;) { | |
5124 | unsigned long nr_pages = page_counter_read(&memcg->memory); | |
5125 | ||
5126 | if (nr_pages <= max) | |
5127 | break; | |
5128 | ||
5129 | if (signal_pending(current)) { | |
5130 | err = -EINTR; | |
5131 | break; | |
5132 | } | |
5133 | ||
5134 | if (!drained) { | |
5135 | drain_all_stock(memcg); | |
5136 | drained = true; | |
5137 | continue; | |
5138 | } | |
5139 | ||
5140 | if (nr_reclaims) { | |
5141 | if (!try_to_free_mem_cgroup_pages(memcg, nr_pages - max, | |
5142 | GFP_KERNEL, true)) | |
5143 | nr_reclaims--; | |
5144 | continue; | |
5145 | } | |
5146 | ||
5147 | mem_cgroup_events(memcg, MEMCG_OOM, 1); | |
5148 | if (!mem_cgroup_out_of_memory(memcg, GFP_KERNEL, 0)) | |
5149 | break; | |
5150 | } | |
241994ed | 5151 | |
2529bb3a | 5152 | memcg_wb_domain_size_changed(memcg); |
241994ed JW |
5153 | return nbytes; |
5154 | } | |
5155 | ||
5156 | static int memory_events_show(struct seq_file *m, void *v) | |
5157 | { | |
5158 | struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m)); | |
5159 | ||
5160 | seq_printf(m, "low %lu\n", mem_cgroup_read_events(memcg, MEMCG_LOW)); | |
5161 | seq_printf(m, "high %lu\n", mem_cgroup_read_events(memcg, MEMCG_HIGH)); | |
5162 | seq_printf(m, "max %lu\n", mem_cgroup_read_events(memcg, MEMCG_MAX)); | |
5163 | seq_printf(m, "oom %lu\n", mem_cgroup_read_events(memcg, MEMCG_OOM)); | |
5164 | ||
5165 | return 0; | |
5166 | } | |
5167 | ||
587d9f72 JW |
5168 | static int memory_stat_show(struct seq_file *m, void *v) |
5169 | { | |
5170 | struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m)); | |
72b54e73 VD |
5171 | unsigned long stat[MEMCG_NR_STAT]; |
5172 | unsigned long events[MEMCG_NR_EVENTS]; | |
587d9f72 JW |
5173 | int i; |
5174 | ||
5175 | /* | |
5176 | * Provide statistics on the state of the memory subsystem as | |
5177 | * well as cumulative event counters that show past behavior. | |
5178 | * | |
5179 | * This list is ordered following a combination of these gradients: | |
5180 | * 1) generic big picture -> specifics and details | |
5181 | * 2) reflecting userspace activity -> reflecting kernel heuristics | |
5182 | * | |
5183 | * Current memory state: | |
5184 | */ | |
5185 | ||
72b54e73 VD |
5186 | tree_stat(memcg, stat); |
5187 | tree_events(memcg, events); | |
5188 | ||
587d9f72 | 5189 | seq_printf(m, "anon %llu\n", |
72b54e73 | 5190 | (u64)stat[MEM_CGROUP_STAT_RSS] * PAGE_SIZE); |
587d9f72 | 5191 | seq_printf(m, "file %llu\n", |
72b54e73 | 5192 | (u64)stat[MEM_CGROUP_STAT_CACHE] * PAGE_SIZE); |
12580e4b | 5193 | seq_printf(m, "kernel_stack %llu\n", |
efdc9490 | 5194 | (u64)stat[MEMCG_KERNEL_STACK_KB] * 1024); |
27ee57c9 VD |
5195 | seq_printf(m, "slab %llu\n", |
5196 | (u64)(stat[MEMCG_SLAB_RECLAIMABLE] + | |
5197 | stat[MEMCG_SLAB_UNRECLAIMABLE]) * PAGE_SIZE); | |
b2807f07 | 5198 | seq_printf(m, "sock %llu\n", |
72b54e73 | 5199 | (u64)stat[MEMCG_SOCK] * PAGE_SIZE); |
587d9f72 JW |
5200 | |
5201 | seq_printf(m, "file_mapped %llu\n", | |
72b54e73 | 5202 | (u64)stat[MEM_CGROUP_STAT_FILE_MAPPED] * PAGE_SIZE); |
587d9f72 | 5203 | seq_printf(m, "file_dirty %llu\n", |
72b54e73 | 5204 | (u64)stat[MEM_CGROUP_STAT_DIRTY] * PAGE_SIZE); |
587d9f72 | 5205 | seq_printf(m, "file_writeback %llu\n", |
72b54e73 | 5206 | (u64)stat[MEM_CGROUP_STAT_WRITEBACK] * PAGE_SIZE); |
587d9f72 JW |
5207 | |
5208 | for (i = 0; i < NR_LRU_LISTS; i++) { | |
5209 | struct mem_cgroup *mi; | |
5210 | unsigned long val = 0; | |
5211 | ||
5212 | for_each_mem_cgroup_tree(mi, memcg) | |
5213 | val += mem_cgroup_nr_lru_pages(mi, BIT(i)); | |
5214 | seq_printf(m, "%s %llu\n", | |
5215 | mem_cgroup_lru_names[i], (u64)val * PAGE_SIZE); | |
5216 | } | |
5217 | ||
27ee57c9 VD |
5218 | seq_printf(m, "slab_reclaimable %llu\n", |
5219 | (u64)stat[MEMCG_SLAB_RECLAIMABLE] * PAGE_SIZE); | |
5220 | seq_printf(m, "slab_unreclaimable %llu\n", | |
5221 | (u64)stat[MEMCG_SLAB_UNRECLAIMABLE] * PAGE_SIZE); | |
5222 | ||
587d9f72 JW |
5223 | /* Accumulated memory events */ |
5224 | ||
5225 | seq_printf(m, "pgfault %lu\n", | |
72b54e73 | 5226 | events[MEM_CGROUP_EVENTS_PGFAULT]); |
587d9f72 | 5227 | seq_printf(m, "pgmajfault %lu\n", |
72b54e73 | 5228 | events[MEM_CGROUP_EVENTS_PGMAJFAULT]); |
587d9f72 JW |
5229 | |
5230 | return 0; | |
5231 | } | |
5232 | ||
241994ed JW |
5233 | static struct cftype memory_files[] = { |
5234 | { | |
5235 | .name = "current", | |
f5fc3c5d | 5236 | .flags = CFTYPE_NOT_ON_ROOT, |
241994ed JW |
5237 | .read_u64 = memory_current_read, |
5238 | }, | |
5239 | { | |
5240 | .name = "low", | |
5241 | .flags = CFTYPE_NOT_ON_ROOT, | |
5242 | .seq_show = memory_low_show, | |
5243 | .write = memory_low_write, | |
5244 | }, | |
5245 | { | |
5246 | .name = "high", | |
5247 | .flags = CFTYPE_NOT_ON_ROOT, | |
5248 | .seq_show = memory_high_show, | |
5249 | .write = memory_high_write, | |
5250 | }, | |
5251 | { | |
5252 | .name = "max", | |
5253 | .flags = CFTYPE_NOT_ON_ROOT, | |
5254 | .seq_show = memory_max_show, | |
5255 | .write = memory_max_write, | |
5256 | }, | |
5257 | { | |
5258 | .name = "events", | |
5259 | .flags = CFTYPE_NOT_ON_ROOT, | |
472912a2 | 5260 | .file_offset = offsetof(struct mem_cgroup, events_file), |
241994ed JW |
5261 | .seq_show = memory_events_show, |
5262 | }, | |
587d9f72 JW |
5263 | { |
5264 | .name = "stat", | |
5265 | .flags = CFTYPE_NOT_ON_ROOT, | |
5266 | .seq_show = memory_stat_show, | |
5267 | }, | |
241994ed JW |
5268 | { } /* terminate */ |
5269 | }; | |
5270 | ||
073219e9 | 5271 | struct cgroup_subsys memory_cgrp_subsys = { |
92fb9748 | 5272 | .css_alloc = mem_cgroup_css_alloc, |
d142e3e6 | 5273 | .css_online = mem_cgroup_css_online, |
92fb9748 | 5274 | .css_offline = mem_cgroup_css_offline, |
6df38689 | 5275 | .css_released = mem_cgroup_css_released, |
92fb9748 | 5276 | .css_free = mem_cgroup_css_free, |
1ced953b | 5277 | .css_reset = mem_cgroup_css_reset, |
7dc74be0 DN |
5278 | .can_attach = mem_cgroup_can_attach, |
5279 | .cancel_attach = mem_cgroup_cancel_attach, | |
264a0ae1 | 5280 | .post_attach = mem_cgroup_move_task, |
f00baae7 | 5281 | .bind = mem_cgroup_bind, |
241994ed JW |
5282 | .dfl_cftypes = memory_files, |
5283 | .legacy_cftypes = mem_cgroup_legacy_files, | |
6d12e2d8 | 5284 | .early_init = 0, |
8cdea7c0 | 5285 | }; |
c077719b | 5286 | |
241994ed JW |
5287 | /** |
5288 | * mem_cgroup_low - check if memory consumption is below the normal range | |
5289 | * @root: the highest ancestor to consider | |
5290 | * @memcg: the memory cgroup to check | |
5291 | * | |
5292 | * Returns %true if memory consumption of @memcg, and that of all | |
5293 | * configurable ancestors up to @root, is below the normal range. | |
5294 | */ | |
5295 | bool mem_cgroup_low(struct mem_cgroup *root, struct mem_cgroup *memcg) | |
5296 | { | |
5297 | if (mem_cgroup_disabled()) | |
5298 | return false; | |
5299 | ||
5300 | /* | |
5301 | * The toplevel group doesn't have a configurable range, so | |
5302 | * it's never low when looked at directly, and it is not | |
5303 | * considered an ancestor when assessing the hierarchy. | |
5304 | */ | |
5305 | ||
5306 | if (memcg == root_mem_cgroup) | |
5307 | return false; | |
5308 | ||
4e54dede | 5309 | if (page_counter_read(&memcg->memory) >= memcg->low) |
241994ed JW |
5310 | return false; |
5311 | ||
5312 | while (memcg != root) { | |
5313 | memcg = parent_mem_cgroup(memcg); | |
5314 | ||
5315 | if (memcg == root_mem_cgroup) | |
5316 | break; | |
5317 | ||
4e54dede | 5318 | if (page_counter_read(&memcg->memory) >= memcg->low) |
241994ed JW |
5319 | return false; |
5320 | } | |
5321 | return true; | |
5322 | } | |
5323 | ||
00501b53 JW |
5324 | /** |
5325 | * mem_cgroup_try_charge - try charging a page | |
5326 | * @page: page to charge | |
5327 | * @mm: mm context of the victim | |
5328 | * @gfp_mask: reclaim mode | |
5329 | * @memcgp: charged memcg return | |
25843c2b | 5330 | * @compound: charge the page as compound or small page |
00501b53 JW |
5331 | * |
5332 | * Try to charge @page to the memcg that @mm belongs to, reclaiming | |
5333 | * pages according to @gfp_mask if necessary. | |
5334 | * | |
5335 | * Returns 0 on success, with *@memcgp pointing to the charged memcg. | |
5336 | * Otherwise, an error code is returned. | |
5337 | * | |
5338 | * After page->mapping has been set up, the caller must finalize the | |
5339 | * charge with mem_cgroup_commit_charge(). Or abort the transaction | |
5340 | * with mem_cgroup_cancel_charge() in case page instantiation fails. | |
5341 | */ | |
5342 | int mem_cgroup_try_charge(struct page *page, struct mm_struct *mm, | |
f627c2f5 KS |
5343 | gfp_t gfp_mask, struct mem_cgroup **memcgp, |
5344 | bool compound) | |
00501b53 JW |
5345 | { |
5346 | struct mem_cgroup *memcg = NULL; | |
f627c2f5 | 5347 | unsigned int nr_pages = compound ? hpage_nr_pages(page) : 1; |
00501b53 JW |
5348 | int ret = 0; |
5349 | ||
5350 | if (mem_cgroup_disabled()) | |
5351 | goto out; | |
5352 | ||
5353 | if (PageSwapCache(page)) { | |
00501b53 JW |
5354 | /* |
5355 | * Every swap fault against a single page tries to charge the | |
5356 | * page, bail as early as possible. shmem_unuse() encounters | |
5357 | * already charged pages, too. The USED bit is protected by | |
5358 | * the page lock, which serializes swap cache removal, which | |
5359 | * in turn serializes uncharging. | |
5360 | */ | |
e993d905 | 5361 | VM_BUG_ON_PAGE(!PageLocked(page), page); |
1306a85a | 5362 | if (page->mem_cgroup) |
00501b53 | 5363 | goto out; |
e993d905 | 5364 | |
37e84351 | 5365 | if (do_swap_account) { |
e993d905 VD |
5366 | swp_entry_t ent = { .val = page_private(page), }; |
5367 | unsigned short id = lookup_swap_cgroup_id(ent); | |
5368 | ||
5369 | rcu_read_lock(); | |
5370 | memcg = mem_cgroup_from_id(id); | |
5371 | if (memcg && !css_tryget_online(&memcg->css)) | |
5372 | memcg = NULL; | |
5373 | rcu_read_unlock(); | |
5374 | } | |
00501b53 JW |
5375 | } |
5376 | ||
00501b53 JW |
5377 | if (!memcg) |
5378 | memcg = get_mem_cgroup_from_mm(mm); | |
5379 | ||
5380 | ret = try_charge(memcg, gfp_mask, nr_pages); | |
5381 | ||
5382 | css_put(&memcg->css); | |
00501b53 JW |
5383 | out: |
5384 | *memcgp = memcg; | |
5385 | return ret; | |
5386 | } | |
5387 | ||
5388 | /** | |
5389 | * mem_cgroup_commit_charge - commit a page charge | |
5390 | * @page: page to charge | |
5391 | * @memcg: memcg to charge the page to | |
5392 | * @lrucare: page might be on LRU already | |
25843c2b | 5393 | * @compound: charge the page as compound or small page |
00501b53 JW |
5394 | * |
5395 | * Finalize a charge transaction started by mem_cgroup_try_charge(), | |
5396 | * after page->mapping has been set up. This must happen atomically | |
5397 | * as part of the page instantiation, i.e. under the page table lock | |
5398 | * for anonymous pages, under the page lock for page and swap cache. | |
5399 | * | |
5400 | * In addition, the page must not be on the LRU during the commit, to | |
5401 | * prevent racing with task migration. If it might be, use @lrucare. | |
5402 | * | |
5403 | * Use mem_cgroup_cancel_charge() to cancel the transaction instead. | |
5404 | */ | |
5405 | void mem_cgroup_commit_charge(struct page *page, struct mem_cgroup *memcg, | |
f627c2f5 | 5406 | bool lrucare, bool compound) |
00501b53 | 5407 | { |
f627c2f5 | 5408 | unsigned int nr_pages = compound ? hpage_nr_pages(page) : 1; |
00501b53 JW |
5409 | |
5410 | VM_BUG_ON_PAGE(!page->mapping, page); | |
5411 | VM_BUG_ON_PAGE(PageLRU(page) && !lrucare, page); | |
5412 | ||
5413 | if (mem_cgroup_disabled()) | |
5414 | return; | |
5415 | /* | |
5416 | * Swap faults will attempt to charge the same page multiple | |
5417 | * times. But reuse_swap_page() might have removed the page | |
5418 | * from swapcache already, so we can't check PageSwapCache(). | |
5419 | */ | |
5420 | if (!memcg) | |
5421 | return; | |
5422 | ||
6abb5a86 JW |
5423 | commit_charge(page, memcg, lrucare); |
5424 | ||
6abb5a86 | 5425 | local_irq_disable(); |
f627c2f5 | 5426 | mem_cgroup_charge_statistics(memcg, page, compound, nr_pages); |
6abb5a86 JW |
5427 | memcg_check_events(memcg, page); |
5428 | local_irq_enable(); | |
00501b53 | 5429 | |
7941d214 | 5430 | if (do_memsw_account() && PageSwapCache(page)) { |
00501b53 JW |
5431 | swp_entry_t entry = { .val = page_private(page) }; |
5432 | /* | |
5433 | * The swap entry might not get freed for a long time, | |
5434 | * let's not wait for it. The page already received a | |
5435 | * memory+swap charge, drop the swap entry duplicate. | |
5436 | */ | |
5437 | mem_cgroup_uncharge_swap(entry); | |
5438 | } | |
5439 | } | |
5440 | ||
5441 | /** | |
5442 | * mem_cgroup_cancel_charge - cancel a page charge | |
5443 | * @page: page to charge | |
5444 | * @memcg: memcg to charge the page to | |
25843c2b | 5445 | * @compound: charge the page as compound or small page |
00501b53 JW |
5446 | * |
5447 | * Cancel a charge transaction started by mem_cgroup_try_charge(). | |
5448 | */ | |
f627c2f5 KS |
5449 | void mem_cgroup_cancel_charge(struct page *page, struct mem_cgroup *memcg, |
5450 | bool compound) | |
00501b53 | 5451 | { |
f627c2f5 | 5452 | unsigned int nr_pages = compound ? hpage_nr_pages(page) : 1; |
00501b53 JW |
5453 | |
5454 | if (mem_cgroup_disabled()) | |
5455 | return; | |
5456 | /* | |
5457 | * Swap faults will attempt to charge the same page multiple | |
5458 | * times. But reuse_swap_page() might have removed the page | |
5459 | * from swapcache already, so we can't check PageSwapCache(). | |
5460 | */ | |
5461 | if (!memcg) | |
5462 | return; | |
5463 | ||
00501b53 JW |
5464 | cancel_charge(memcg, nr_pages); |
5465 | } | |
5466 | ||
747db954 | 5467 | static void uncharge_batch(struct mem_cgroup *memcg, unsigned long pgpgout, |
747db954 | 5468 | unsigned long nr_anon, unsigned long nr_file, |
5e8d35f8 VD |
5469 | unsigned long nr_huge, unsigned long nr_kmem, |
5470 | struct page *dummy_page) | |
747db954 | 5471 | { |
5e8d35f8 | 5472 | unsigned long nr_pages = nr_anon + nr_file + nr_kmem; |
747db954 JW |
5473 | unsigned long flags; |
5474 | ||
ce00a967 | 5475 | if (!mem_cgroup_is_root(memcg)) { |
18eca2e6 | 5476 | page_counter_uncharge(&memcg->memory, nr_pages); |
7941d214 | 5477 | if (do_memsw_account()) |
18eca2e6 | 5478 | page_counter_uncharge(&memcg->memsw, nr_pages); |
5e8d35f8 VD |
5479 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && nr_kmem) |
5480 | page_counter_uncharge(&memcg->kmem, nr_kmem); | |
ce00a967 JW |
5481 | memcg_oom_recover(memcg); |
5482 | } | |
747db954 JW |
5483 | |
5484 | local_irq_save(flags); | |
5485 | __this_cpu_sub(memcg->stat->count[MEM_CGROUP_STAT_RSS], nr_anon); | |
5486 | __this_cpu_sub(memcg->stat->count[MEM_CGROUP_STAT_CACHE], nr_file); | |
5487 | __this_cpu_sub(memcg->stat->count[MEM_CGROUP_STAT_RSS_HUGE], nr_huge); | |
5488 | __this_cpu_add(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGOUT], pgpgout); | |
18eca2e6 | 5489 | __this_cpu_add(memcg->stat->nr_page_events, nr_pages); |
747db954 JW |
5490 | memcg_check_events(memcg, dummy_page); |
5491 | local_irq_restore(flags); | |
e8ea14cc JW |
5492 | |
5493 | if (!mem_cgroup_is_root(memcg)) | |
18eca2e6 | 5494 | css_put_many(&memcg->css, nr_pages); |
747db954 JW |
5495 | } |
5496 | ||
5497 | static void uncharge_list(struct list_head *page_list) | |
5498 | { | |
5499 | struct mem_cgroup *memcg = NULL; | |
747db954 JW |
5500 | unsigned long nr_anon = 0; |
5501 | unsigned long nr_file = 0; | |
5502 | unsigned long nr_huge = 0; | |
5e8d35f8 | 5503 | unsigned long nr_kmem = 0; |
747db954 | 5504 | unsigned long pgpgout = 0; |
747db954 JW |
5505 | struct list_head *next; |
5506 | struct page *page; | |
5507 | ||
8b592656 JW |
5508 | /* |
5509 | * Note that the list can be a single page->lru; hence the | |
5510 | * do-while loop instead of a simple list_for_each_entry(). | |
5511 | */ | |
747db954 JW |
5512 | next = page_list->next; |
5513 | do { | |
747db954 JW |
5514 | page = list_entry(next, struct page, lru); |
5515 | next = page->lru.next; | |
5516 | ||
5517 | VM_BUG_ON_PAGE(PageLRU(page), page); | |
5518 | VM_BUG_ON_PAGE(page_count(page), page); | |
5519 | ||
1306a85a | 5520 | if (!page->mem_cgroup) |
747db954 JW |
5521 | continue; |
5522 | ||
5523 | /* | |
5524 | * Nobody should be changing or seriously looking at | |
1306a85a | 5525 | * page->mem_cgroup at this point, we have fully |
29833315 | 5526 | * exclusive access to the page. |
747db954 JW |
5527 | */ |
5528 | ||
1306a85a | 5529 | if (memcg != page->mem_cgroup) { |
747db954 | 5530 | if (memcg) { |
18eca2e6 | 5531 | uncharge_batch(memcg, pgpgout, nr_anon, nr_file, |
5e8d35f8 VD |
5532 | nr_huge, nr_kmem, page); |
5533 | pgpgout = nr_anon = nr_file = | |
5534 | nr_huge = nr_kmem = 0; | |
747db954 | 5535 | } |
1306a85a | 5536 | memcg = page->mem_cgroup; |
747db954 JW |
5537 | } |
5538 | ||
5e8d35f8 VD |
5539 | if (!PageKmemcg(page)) { |
5540 | unsigned int nr_pages = 1; | |
747db954 | 5541 | |
5e8d35f8 VD |
5542 | if (PageTransHuge(page)) { |
5543 | nr_pages <<= compound_order(page); | |
5e8d35f8 VD |
5544 | nr_huge += nr_pages; |
5545 | } | |
5546 | if (PageAnon(page)) | |
5547 | nr_anon += nr_pages; | |
5548 | else | |
5549 | nr_file += nr_pages; | |
5550 | pgpgout++; | |
c4159a75 | 5551 | } else { |
5e8d35f8 | 5552 | nr_kmem += 1 << compound_order(page); |
c4159a75 VD |
5553 | __ClearPageKmemcg(page); |
5554 | } | |
747db954 | 5555 | |
1306a85a | 5556 | page->mem_cgroup = NULL; |
747db954 JW |
5557 | } while (next != page_list); |
5558 | ||
5559 | if (memcg) | |
18eca2e6 | 5560 | uncharge_batch(memcg, pgpgout, nr_anon, nr_file, |
5e8d35f8 | 5561 | nr_huge, nr_kmem, page); |
747db954 JW |
5562 | } |
5563 | ||
0a31bc97 JW |
5564 | /** |
5565 | * mem_cgroup_uncharge - uncharge a page | |
5566 | * @page: page to uncharge | |
5567 | * | |
5568 | * Uncharge a page previously charged with mem_cgroup_try_charge() and | |
5569 | * mem_cgroup_commit_charge(). | |
5570 | */ | |
5571 | void mem_cgroup_uncharge(struct page *page) | |
5572 | { | |
0a31bc97 JW |
5573 | if (mem_cgroup_disabled()) |
5574 | return; | |
5575 | ||
747db954 | 5576 | /* Don't touch page->lru of any random page, pre-check: */ |
1306a85a | 5577 | if (!page->mem_cgroup) |
0a31bc97 JW |
5578 | return; |
5579 | ||
747db954 JW |
5580 | INIT_LIST_HEAD(&page->lru); |
5581 | uncharge_list(&page->lru); | |
5582 | } | |
0a31bc97 | 5583 | |
747db954 JW |
5584 | /** |
5585 | * mem_cgroup_uncharge_list - uncharge a list of page | |
5586 | * @page_list: list of pages to uncharge | |
5587 | * | |
5588 | * Uncharge a list of pages previously charged with | |
5589 | * mem_cgroup_try_charge() and mem_cgroup_commit_charge(). | |
5590 | */ | |
5591 | void mem_cgroup_uncharge_list(struct list_head *page_list) | |
5592 | { | |
5593 | if (mem_cgroup_disabled()) | |
5594 | return; | |
0a31bc97 | 5595 | |
747db954 JW |
5596 | if (!list_empty(page_list)) |
5597 | uncharge_list(page_list); | |
0a31bc97 JW |
5598 | } |
5599 | ||
5600 | /** | |
6a93ca8f JW |
5601 | * mem_cgroup_migrate - charge a page's replacement |
5602 | * @oldpage: currently circulating page | |
5603 | * @newpage: replacement page | |
0a31bc97 | 5604 | * |
6a93ca8f JW |
5605 | * Charge @newpage as a replacement page for @oldpage. @oldpage will |
5606 | * be uncharged upon free. | |
0a31bc97 JW |
5607 | * |
5608 | * Both pages must be locked, @newpage->mapping must be set up. | |
5609 | */ | |
6a93ca8f | 5610 | void mem_cgroup_migrate(struct page *oldpage, struct page *newpage) |
0a31bc97 | 5611 | { |
29833315 | 5612 | struct mem_cgroup *memcg; |
44b7a8d3 JW |
5613 | unsigned int nr_pages; |
5614 | bool compound; | |
d93c4130 | 5615 | unsigned long flags; |
0a31bc97 JW |
5616 | |
5617 | VM_BUG_ON_PAGE(!PageLocked(oldpage), oldpage); | |
5618 | VM_BUG_ON_PAGE(!PageLocked(newpage), newpage); | |
0a31bc97 | 5619 | VM_BUG_ON_PAGE(PageAnon(oldpage) != PageAnon(newpage), newpage); |
6abb5a86 JW |
5620 | VM_BUG_ON_PAGE(PageTransHuge(oldpage) != PageTransHuge(newpage), |
5621 | newpage); | |
0a31bc97 JW |
5622 | |
5623 | if (mem_cgroup_disabled()) | |
5624 | return; | |
5625 | ||
5626 | /* Page cache replacement: new page already charged? */ | |
1306a85a | 5627 | if (newpage->mem_cgroup) |
0a31bc97 JW |
5628 | return; |
5629 | ||
45637bab | 5630 | /* Swapcache readahead pages can get replaced before being charged */ |
1306a85a | 5631 | memcg = oldpage->mem_cgroup; |
29833315 | 5632 | if (!memcg) |
0a31bc97 JW |
5633 | return; |
5634 | ||
44b7a8d3 JW |
5635 | /* Force-charge the new page. The old one will be freed soon */ |
5636 | compound = PageTransHuge(newpage); | |
5637 | nr_pages = compound ? hpage_nr_pages(newpage) : 1; | |
5638 | ||
5639 | page_counter_charge(&memcg->memory, nr_pages); | |
5640 | if (do_memsw_account()) | |
5641 | page_counter_charge(&memcg->memsw, nr_pages); | |
5642 | css_get_many(&memcg->css, nr_pages); | |
0a31bc97 | 5643 | |
9cf7666a | 5644 | commit_charge(newpage, memcg, false); |
44b7a8d3 | 5645 | |
d93c4130 | 5646 | local_irq_save(flags); |
44b7a8d3 JW |
5647 | mem_cgroup_charge_statistics(memcg, newpage, compound, nr_pages); |
5648 | memcg_check_events(memcg, newpage); | |
d93c4130 | 5649 | local_irq_restore(flags); |
0a31bc97 JW |
5650 | } |
5651 | ||
ef12947c | 5652 | DEFINE_STATIC_KEY_FALSE(memcg_sockets_enabled_key); |
11092087 JW |
5653 | EXPORT_SYMBOL(memcg_sockets_enabled_key); |
5654 | ||
2d758073 | 5655 | void mem_cgroup_sk_alloc(struct sock *sk) |
11092087 JW |
5656 | { |
5657 | struct mem_cgroup *memcg; | |
5658 | ||
2d758073 JW |
5659 | if (!mem_cgroup_sockets_enabled) |
5660 | return; | |
5661 | ||
5662 | /* | |
5663 | * Socket cloning can throw us here with sk_memcg already | |
11092087 JW |
5664 | * filled. It won't however, necessarily happen from |
5665 | * process context. So the test for root memcg given | |
5666 | * the current task's memcg won't help us in this case. | |
5667 | * | |
5668 | * Respecting the original socket's memcg is a better | |
5669 | * decision in this case. | |
5670 | */ | |
5671 | if (sk->sk_memcg) { | |
5672 | BUG_ON(mem_cgroup_is_root(sk->sk_memcg)); | |
5673 | css_get(&sk->sk_memcg->css); | |
5674 | return; | |
5675 | } | |
5676 | ||
5677 | rcu_read_lock(); | |
5678 | memcg = mem_cgroup_from_task(current); | |
f7e1cb6e JW |
5679 | if (memcg == root_mem_cgroup) |
5680 | goto out; | |
0db15298 | 5681 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && !memcg->tcpmem_active) |
f7e1cb6e | 5682 | goto out; |
f7e1cb6e | 5683 | if (css_tryget_online(&memcg->css)) |
11092087 | 5684 | sk->sk_memcg = memcg; |
f7e1cb6e | 5685 | out: |
11092087 JW |
5686 | rcu_read_unlock(); |
5687 | } | |
11092087 | 5688 | |
2d758073 | 5689 | void mem_cgroup_sk_free(struct sock *sk) |
11092087 | 5690 | { |
2d758073 JW |
5691 | if (sk->sk_memcg) |
5692 | css_put(&sk->sk_memcg->css); | |
11092087 JW |
5693 | } |
5694 | ||
5695 | /** | |
5696 | * mem_cgroup_charge_skmem - charge socket memory | |
5697 | * @memcg: memcg to charge | |
5698 | * @nr_pages: number of pages to charge | |
5699 | * | |
5700 | * Charges @nr_pages to @memcg. Returns %true if the charge fit within | |
5701 | * @memcg's configured limit, %false if the charge had to be forced. | |
5702 | */ | |
5703 | bool mem_cgroup_charge_skmem(struct mem_cgroup *memcg, unsigned int nr_pages) | |
5704 | { | |
f7e1cb6e | 5705 | gfp_t gfp_mask = GFP_KERNEL; |
11092087 | 5706 | |
f7e1cb6e | 5707 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) { |
0db15298 | 5708 | struct page_counter *fail; |
f7e1cb6e | 5709 | |
0db15298 JW |
5710 | if (page_counter_try_charge(&memcg->tcpmem, nr_pages, &fail)) { |
5711 | memcg->tcpmem_pressure = 0; | |
f7e1cb6e JW |
5712 | return true; |
5713 | } | |
0db15298 JW |
5714 | page_counter_charge(&memcg->tcpmem, nr_pages); |
5715 | memcg->tcpmem_pressure = 1; | |
f7e1cb6e | 5716 | return false; |
11092087 | 5717 | } |
d886f4e4 | 5718 | |
f7e1cb6e JW |
5719 | /* Don't block in the packet receive path */ |
5720 | if (in_softirq()) | |
5721 | gfp_mask = GFP_NOWAIT; | |
5722 | ||
b2807f07 JW |
5723 | this_cpu_add(memcg->stat->count[MEMCG_SOCK], nr_pages); |
5724 | ||
f7e1cb6e JW |
5725 | if (try_charge(memcg, gfp_mask, nr_pages) == 0) |
5726 | return true; | |
5727 | ||
5728 | try_charge(memcg, gfp_mask|__GFP_NOFAIL, nr_pages); | |
11092087 JW |
5729 | return false; |
5730 | } | |
5731 | ||
5732 | /** | |
5733 | * mem_cgroup_uncharge_skmem - uncharge socket memory | |
5734 | * @memcg - memcg to uncharge | |
5735 | * @nr_pages - number of pages to uncharge | |
5736 | */ | |
5737 | void mem_cgroup_uncharge_skmem(struct mem_cgroup *memcg, unsigned int nr_pages) | |
5738 | { | |
f7e1cb6e | 5739 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) { |
0db15298 | 5740 | page_counter_uncharge(&memcg->tcpmem, nr_pages); |
f7e1cb6e JW |
5741 | return; |
5742 | } | |
d886f4e4 | 5743 | |
b2807f07 JW |
5744 | this_cpu_sub(memcg->stat->count[MEMCG_SOCK], nr_pages); |
5745 | ||
f7e1cb6e JW |
5746 | page_counter_uncharge(&memcg->memory, nr_pages); |
5747 | css_put_many(&memcg->css, nr_pages); | |
11092087 JW |
5748 | } |
5749 | ||
f7e1cb6e JW |
5750 | static int __init cgroup_memory(char *s) |
5751 | { | |
5752 | char *token; | |
5753 | ||
5754 | while ((token = strsep(&s, ",")) != NULL) { | |
5755 | if (!*token) | |
5756 | continue; | |
5757 | if (!strcmp(token, "nosocket")) | |
5758 | cgroup_memory_nosocket = true; | |
04823c83 VD |
5759 | if (!strcmp(token, "nokmem")) |
5760 | cgroup_memory_nokmem = true; | |
f7e1cb6e JW |
5761 | } |
5762 | return 0; | |
5763 | } | |
5764 | __setup("cgroup.memory=", cgroup_memory); | |
11092087 | 5765 | |
2d11085e | 5766 | /* |
1081312f MH |
5767 | * subsys_initcall() for memory controller. |
5768 | * | |
308167fc SAS |
5769 | * Some parts like memcg_hotplug_cpu_dead() have to be initialized from this |
5770 | * context because of lock dependencies (cgroup_lock -> cpu hotplug) but | |
5771 | * basically everything that doesn't depend on a specific mem_cgroup structure | |
5772 | * should be initialized from here. | |
2d11085e MH |
5773 | */ |
5774 | static int __init mem_cgroup_init(void) | |
5775 | { | |
95a045f6 JW |
5776 | int cpu, node; |
5777 | ||
13583c3d VD |
5778 | #ifndef CONFIG_SLOB |
5779 | /* | |
5780 | * Kmem cache creation is mostly done with the slab_mutex held, | |
5781 | * so use a special workqueue to avoid stalling all worker | |
5782 | * threads in case lots of cgroups are created simultaneously. | |
5783 | */ | |
5784 | memcg_kmem_cache_create_wq = | |
5785 | alloc_ordered_workqueue("memcg_kmem_cache_create", 0); | |
5786 | BUG_ON(!memcg_kmem_cache_create_wq); | |
5787 | #endif | |
5788 | ||
308167fc SAS |
5789 | cpuhp_setup_state_nocalls(CPUHP_MM_MEMCQ_DEAD, "mm/memctrl:dead", NULL, |
5790 | memcg_hotplug_cpu_dead); | |
95a045f6 JW |
5791 | |
5792 | for_each_possible_cpu(cpu) | |
5793 | INIT_WORK(&per_cpu_ptr(&memcg_stock, cpu)->work, | |
5794 | drain_local_stock); | |
5795 | ||
5796 | for_each_node(node) { | |
5797 | struct mem_cgroup_tree_per_node *rtpn; | |
95a045f6 JW |
5798 | |
5799 | rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL, | |
5800 | node_online(node) ? node : NUMA_NO_NODE); | |
5801 | ||
ef8f2327 MG |
5802 | rtpn->rb_root = RB_ROOT; |
5803 | spin_lock_init(&rtpn->lock); | |
95a045f6 JW |
5804 | soft_limit_tree.rb_tree_per_node[node] = rtpn; |
5805 | } | |
5806 | ||
2d11085e MH |
5807 | return 0; |
5808 | } | |
5809 | subsys_initcall(mem_cgroup_init); | |
21afa38e JW |
5810 | |
5811 | #ifdef CONFIG_MEMCG_SWAP | |
358c07fc AB |
5812 | static struct mem_cgroup *mem_cgroup_id_get_online(struct mem_cgroup *memcg) |
5813 | { | |
5814 | while (!atomic_inc_not_zero(&memcg->id.ref)) { | |
5815 | /* | |
5816 | * The root cgroup cannot be destroyed, so it's refcount must | |
5817 | * always be >= 1. | |
5818 | */ | |
5819 | if (WARN_ON_ONCE(memcg == root_mem_cgroup)) { | |
5820 | VM_BUG_ON(1); | |
5821 | break; | |
5822 | } | |
5823 | memcg = parent_mem_cgroup(memcg); | |
5824 | if (!memcg) | |
5825 | memcg = root_mem_cgroup; | |
5826 | } | |
5827 | return memcg; | |
5828 | } | |
5829 | ||
21afa38e JW |
5830 | /** |
5831 | * mem_cgroup_swapout - transfer a memsw charge to swap | |
5832 | * @page: page whose memsw charge to transfer | |
5833 | * @entry: swap entry to move the charge to | |
5834 | * | |
5835 | * Transfer the memsw charge of @page to @entry. | |
5836 | */ | |
5837 | void mem_cgroup_swapout(struct page *page, swp_entry_t entry) | |
5838 | { | |
1f47b61f | 5839 | struct mem_cgroup *memcg, *swap_memcg; |
21afa38e JW |
5840 | unsigned short oldid; |
5841 | ||
5842 | VM_BUG_ON_PAGE(PageLRU(page), page); | |
5843 | VM_BUG_ON_PAGE(page_count(page), page); | |
5844 | ||
7941d214 | 5845 | if (!do_memsw_account()) |
21afa38e JW |
5846 | return; |
5847 | ||
5848 | memcg = page->mem_cgroup; | |
5849 | ||
5850 | /* Readahead page, never charged */ | |
5851 | if (!memcg) | |
5852 | return; | |
5853 | ||
1f47b61f VD |
5854 | /* |
5855 | * In case the memcg owning these pages has been offlined and doesn't | |
5856 | * have an ID allocated to it anymore, charge the closest online | |
5857 | * ancestor for the swap instead and transfer the memory+swap charge. | |
5858 | */ | |
5859 | swap_memcg = mem_cgroup_id_get_online(memcg); | |
5860 | oldid = swap_cgroup_record(entry, mem_cgroup_id(swap_memcg)); | |
21afa38e | 5861 | VM_BUG_ON_PAGE(oldid, page); |
1f47b61f | 5862 | mem_cgroup_swap_statistics(swap_memcg, true); |
21afa38e JW |
5863 | |
5864 | page->mem_cgroup = NULL; | |
5865 | ||
5866 | if (!mem_cgroup_is_root(memcg)) | |
5867 | page_counter_uncharge(&memcg->memory, 1); | |
5868 | ||
1f47b61f VD |
5869 | if (memcg != swap_memcg) { |
5870 | if (!mem_cgroup_is_root(swap_memcg)) | |
5871 | page_counter_charge(&swap_memcg->memsw, 1); | |
5872 | page_counter_uncharge(&memcg->memsw, 1); | |
5873 | } | |
5874 | ||
ce9ce665 SAS |
5875 | /* |
5876 | * Interrupts should be disabled here because the caller holds the | |
5877 | * mapping->tree_lock lock which is taken with interrupts-off. It is | |
5878 | * important here to have the interrupts disabled because it is the | |
5879 | * only synchronisation we have for udpating the per-CPU variables. | |
5880 | */ | |
5881 | VM_BUG_ON(!irqs_disabled()); | |
f627c2f5 | 5882 | mem_cgroup_charge_statistics(memcg, page, false, -1); |
21afa38e | 5883 | memcg_check_events(memcg, page); |
73f576c0 JW |
5884 | |
5885 | if (!mem_cgroup_is_root(memcg)) | |
5886 | css_put(&memcg->css); | |
21afa38e JW |
5887 | } |
5888 | ||
37e84351 VD |
5889 | /* |
5890 | * mem_cgroup_try_charge_swap - try charging a swap entry | |
5891 | * @page: page being added to swap | |
5892 | * @entry: swap entry to charge | |
5893 | * | |
5894 | * Try to charge @entry to the memcg that @page belongs to. | |
5895 | * | |
5896 | * Returns 0 on success, -ENOMEM on failure. | |
5897 | */ | |
5898 | int mem_cgroup_try_charge_swap(struct page *page, swp_entry_t entry) | |
5899 | { | |
5900 | struct mem_cgroup *memcg; | |
5901 | struct page_counter *counter; | |
5902 | unsigned short oldid; | |
5903 | ||
5904 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) || !do_swap_account) | |
5905 | return 0; | |
5906 | ||
5907 | memcg = page->mem_cgroup; | |
5908 | ||
5909 | /* Readahead page, never charged */ | |
5910 | if (!memcg) | |
5911 | return 0; | |
5912 | ||
1f47b61f VD |
5913 | memcg = mem_cgroup_id_get_online(memcg); |
5914 | ||
37e84351 | 5915 | if (!mem_cgroup_is_root(memcg) && |
1f47b61f VD |
5916 | !page_counter_try_charge(&memcg->swap, 1, &counter)) { |
5917 | mem_cgroup_id_put(memcg); | |
37e84351 | 5918 | return -ENOMEM; |
1f47b61f | 5919 | } |
37e84351 VD |
5920 | |
5921 | oldid = swap_cgroup_record(entry, mem_cgroup_id(memcg)); | |
5922 | VM_BUG_ON_PAGE(oldid, page); | |
5923 | mem_cgroup_swap_statistics(memcg, true); | |
5924 | ||
37e84351 VD |
5925 | return 0; |
5926 | } | |
5927 | ||
21afa38e JW |
5928 | /** |
5929 | * mem_cgroup_uncharge_swap - uncharge a swap entry | |
5930 | * @entry: swap entry to uncharge | |
5931 | * | |
37e84351 | 5932 | * Drop the swap charge associated with @entry. |
21afa38e JW |
5933 | */ |
5934 | void mem_cgroup_uncharge_swap(swp_entry_t entry) | |
5935 | { | |
5936 | struct mem_cgroup *memcg; | |
5937 | unsigned short id; | |
5938 | ||
37e84351 | 5939 | if (!do_swap_account) |
21afa38e JW |
5940 | return; |
5941 | ||
5942 | id = swap_cgroup_record(entry, 0); | |
5943 | rcu_read_lock(); | |
adbe427b | 5944 | memcg = mem_cgroup_from_id(id); |
21afa38e | 5945 | if (memcg) { |
37e84351 VD |
5946 | if (!mem_cgroup_is_root(memcg)) { |
5947 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) | |
5948 | page_counter_uncharge(&memcg->swap, 1); | |
5949 | else | |
5950 | page_counter_uncharge(&memcg->memsw, 1); | |
5951 | } | |
21afa38e | 5952 | mem_cgroup_swap_statistics(memcg, false); |
73f576c0 | 5953 | mem_cgroup_id_put(memcg); |
21afa38e JW |
5954 | } |
5955 | rcu_read_unlock(); | |
5956 | } | |
5957 | ||
d8b38438 VD |
5958 | long mem_cgroup_get_nr_swap_pages(struct mem_cgroup *memcg) |
5959 | { | |
5960 | long nr_swap_pages = get_nr_swap_pages(); | |
5961 | ||
5962 | if (!do_swap_account || !cgroup_subsys_on_dfl(memory_cgrp_subsys)) | |
5963 | return nr_swap_pages; | |
5964 | for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg)) | |
5965 | nr_swap_pages = min_t(long, nr_swap_pages, | |
5966 | READ_ONCE(memcg->swap.limit) - | |
5967 | page_counter_read(&memcg->swap)); | |
5968 | return nr_swap_pages; | |
5969 | } | |
5970 | ||
5ccc5aba VD |
5971 | bool mem_cgroup_swap_full(struct page *page) |
5972 | { | |
5973 | struct mem_cgroup *memcg; | |
5974 | ||
5975 | VM_BUG_ON_PAGE(!PageLocked(page), page); | |
5976 | ||
5977 | if (vm_swap_full()) | |
5978 | return true; | |
5979 | if (!do_swap_account || !cgroup_subsys_on_dfl(memory_cgrp_subsys)) | |
5980 | return false; | |
5981 | ||
5982 | memcg = page->mem_cgroup; | |
5983 | if (!memcg) | |
5984 | return false; | |
5985 | ||
5986 | for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg)) | |
5987 | if (page_counter_read(&memcg->swap) * 2 >= memcg->swap.limit) | |
5988 | return true; | |
5989 | ||
5990 | return false; | |
5991 | } | |
5992 | ||
21afa38e JW |
5993 | /* for remember boot option*/ |
5994 | #ifdef CONFIG_MEMCG_SWAP_ENABLED | |
5995 | static int really_do_swap_account __initdata = 1; | |
5996 | #else | |
5997 | static int really_do_swap_account __initdata; | |
5998 | #endif | |
5999 | ||
6000 | static int __init enable_swap_account(char *s) | |
6001 | { | |
6002 | if (!strcmp(s, "1")) | |
6003 | really_do_swap_account = 1; | |
6004 | else if (!strcmp(s, "0")) | |
6005 | really_do_swap_account = 0; | |
6006 | return 1; | |
6007 | } | |
6008 | __setup("swapaccount=", enable_swap_account); | |
6009 | ||
37e84351 VD |
6010 | static u64 swap_current_read(struct cgroup_subsys_state *css, |
6011 | struct cftype *cft) | |
6012 | { | |
6013 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); | |
6014 | ||
6015 | return (u64)page_counter_read(&memcg->swap) * PAGE_SIZE; | |
6016 | } | |
6017 | ||
6018 | static int swap_max_show(struct seq_file *m, void *v) | |
6019 | { | |
6020 | struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m)); | |
6021 | unsigned long max = READ_ONCE(memcg->swap.limit); | |
6022 | ||
6023 | if (max == PAGE_COUNTER_MAX) | |
6024 | seq_puts(m, "max\n"); | |
6025 | else | |
6026 | seq_printf(m, "%llu\n", (u64)max * PAGE_SIZE); | |
6027 | ||
6028 | return 0; | |
6029 | } | |
6030 | ||
6031 | static ssize_t swap_max_write(struct kernfs_open_file *of, | |
6032 | char *buf, size_t nbytes, loff_t off) | |
6033 | { | |
6034 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
6035 | unsigned long max; | |
6036 | int err; | |
6037 | ||
6038 | buf = strstrip(buf); | |
6039 | err = page_counter_memparse(buf, "max", &max); | |
6040 | if (err) | |
6041 | return err; | |
6042 | ||
6043 | mutex_lock(&memcg_limit_mutex); | |
6044 | err = page_counter_limit(&memcg->swap, max); | |
6045 | mutex_unlock(&memcg_limit_mutex); | |
6046 | if (err) | |
6047 | return err; | |
6048 | ||
6049 | return nbytes; | |
6050 | } | |
6051 | ||
6052 | static struct cftype swap_files[] = { | |
6053 | { | |
6054 | .name = "swap.current", | |
6055 | .flags = CFTYPE_NOT_ON_ROOT, | |
6056 | .read_u64 = swap_current_read, | |
6057 | }, | |
6058 | { | |
6059 | .name = "swap.max", | |
6060 | .flags = CFTYPE_NOT_ON_ROOT, | |
6061 | .seq_show = swap_max_show, | |
6062 | .write = swap_max_write, | |
6063 | }, | |
6064 | { } /* terminate */ | |
6065 | }; | |
6066 | ||
21afa38e JW |
6067 | static struct cftype memsw_cgroup_files[] = { |
6068 | { | |
6069 | .name = "memsw.usage_in_bytes", | |
6070 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE), | |
6071 | .read_u64 = mem_cgroup_read_u64, | |
6072 | }, | |
6073 | { | |
6074 | .name = "memsw.max_usage_in_bytes", | |
6075 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE), | |
6076 | .write = mem_cgroup_reset, | |
6077 | .read_u64 = mem_cgroup_read_u64, | |
6078 | }, | |
6079 | { | |
6080 | .name = "memsw.limit_in_bytes", | |
6081 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT), | |
6082 | .write = mem_cgroup_write, | |
6083 | .read_u64 = mem_cgroup_read_u64, | |
6084 | }, | |
6085 | { | |
6086 | .name = "memsw.failcnt", | |
6087 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT), | |
6088 | .write = mem_cgroup_reset, | |
6089 | .read_u64 = mem_cgroup_read_u64, | |
6090 | }, | |
6091 | { }, /* terminate */ | |
6092 | }; | |
6093 | ||
6094 | static int __init mem_cgroup_swap_init(void) | |
6095 | { | |
6096 | if (!mem_cgroup_disabled() && really_do_swap_account) { | |
6097 | do_swap_account = 1; | |
37e84351 VD |
6098 | WARN_ON(cgroup_add_dfl_cftypes(&memory_cgrp_subsys, |
6099 | swap_files)); | |
21afa38e JW |
6100 | WARN_ON(cgroup_add_legacy_cftypes(&memory_cgrp_subsys, |
6101 | memsw_cgroup_files)); | |
6102 | } | |
6103 | return 0; | |
6104 | } | |
6105 | subsys_initcall(mem_cgroup_swap_init); | |
6106 | ||
6107 | #endif /* CONFIG_MEMCG_SWAP */ |