]>
Commit | Line | Data |
---|---|---|
c942fddf | 1 | // SPDX-License-Identifier: GPL-2.0-or-later |
8cdea7c0 BS |
2 | /* memcontrol.c - Memory Controller |
3 | * | |
4 | * Copyright IBM Corporation, 2007 | |
5 | * Author Balbir Singh <balbir@linux.vnet.ibm.com> | |
6 | * | |
78fb7466 PE |
7 | * Copyright 2007 OpenVZ SWsoft Inc |
8 | * Author: Pavel Emelianov <xemul@openvz.org> | |
9 | * | |
2e72b634 KS |
10 | * Memory thresholds |
11 | * Copyright (C) 2009 Nokia Corporation | |
12 | * Author: Kirill A. Shutemov | |
13 | * | |
7ae1e1d0 GC |
14 | * Kernel Memory Controller |
15 | * Copyright (C) 2012 Parallels Inc. and Google Inc. | |
16 | * Authors: Glauber Costa and Suleiman Souhlal | |
17 | * | |
1575e68b JW |
18 | * Native page reclaim |
19 | * Charge lifetime sanitation | |
20 | * Lockless page tracking & accounting | |
21 | * Unified hierarchy configuration model | |
22 | * Copyright (C) 2015 Red Hat, Inc., Johannes Weiner | |
6168d0da AS |
23 | * |
24 | * Per memcg lru locking | |
25 | * Copyright (C) 2020 Alibaba, Inc, Alex Shi | |
8cdea7c0 BS |
26 | */ |
27 | ||
3e32cb2e | 28 | #include <linux/page_counter.h> |
8cdea7c0 BS |
29 | #include <linux/memcontrol.h> |
30 | #include <linux/cgroup.h> | |
a520110e | 31 | #include <linux/pagewalk.h> |
6e84f315 | 32 | #include <linux/sched/mm.h> |
3a4f8a0b | 33 | #include <linux/shmem_fs.h> |
4ffef5fe | 34 | #include <linux/hugetlb.h> |
d13d1443 | 35 | #include <linux/pagemap.h> |
1ff9e6e1 | 36 | #include <linux/vm_event_item.h> |
d52aa412 | 37 | #include <linux/smp.h> |
8a9f3ccd | 38 | #include <linux/page-flags.h> |
66e1707b | 39 | #include <linux/backing-dev.h> |
8a9f3ccd BS |
40 | #include <linux/bit_spinlock.h> |
41 | #include <linux/rcupdate.h> | |
e222432b | 42 | #include <linux/limits.h> |
b9e15baf | 43 | #include <linux/export.h> |
8c7c6e34 | 44 | #include <linux/mutex.h> |
bb4cc1a8 | 45 | #include <linux/rbtree.h> |
b6ac57d5 | 46 | #include <linux/slab.h> |
66e1707b | 47 | #include <linux/swap.h> |
02491447 | 48 | #include <linux/swapops.h> |
66e1707b | 49 | #include <linux/spinlock.h> |
2e72b634 | 50 | #include <linux/eventfd.h> |
79bd9814 | 51 | #include <linux/poll.h> |
2e72b634 | 52 | #include <linux/sort.h> |
66e1707b | 53 | #include <linux/fs.h> |
d2ceb9b7 | 54 | #include <linux/seq_file.h> |
70ddf637 | 55 | #include <linux/vmpressure.h> |
b69408e8 | 56 | #include <linux/mm_inline.h> |
5d1ea48b | 57 | #include <linux/swap_cgroup.h> |
cdec2e42 | 58 | #include <linux/cpu.h> |
158e0a2d | 59 | #include <linux/oom.h> |
0056f4e6 | 60 | #include <linux/lockdep.h> |
79bd9814 | 61 | #include <linux/file.h> |
b23afb93 | 62 | #include <linux/tracehook.h> |
0e4b01df | 63 | #include <linux/psi.h> |
c8713d0b | 64 | #include <linux/seq_buf.h> |
08e552c6 | 65 | #include "internal.h" |
d1a4c0b3 | 66 | #include <net/sock.h> |
4bd2c1ee | 67 | #include <net/ip.h> |
f35c3a8e | 68 | #include "slab.h" |
8cdea7c0 | 69 | |
7c0f6ba6 | 70 | #include <linux/uaccess.h> |
8697d331 | 71 | |
cc8e970c KM |
72 | #include <trace/events/vmscan.h> |
73 | ||
073219e9 TH |
74 | struct cgroup_subsys memory_cgrp_subsys __read_mostly; |
75 | EXPORT_SYMBOL(memory_cgrp_subsys); | |
68ae564b | 76 | |
7d828602 JW |
77 | struct mem_cgroup *root_mem_cgroup __read_mostly; |
78 | ||
37d5985c RG |
79 | /* Active memory cgroup to use from an interrupt context */ |
80 | DEFINE_PER_CPU(struct mem_cgroup *, int_active_memcg); | |
c74d40e8 | 81 | EXPORT_PER_CPU_SYMBOL_GPL(int_active_memcg); |
37d5985c | 82 | |
f7e1cb6e | 83 | /* Socket memory accounting disabled? */ |
0f0cace3 | 84 | static bool cgroup_memory_nosocket __ro_after_init; |
f7e1cb6e | 85 | |
04823c83 | 86 | /* Kernel memory accounting disabled? */ |
e267992f | 87 | bool cgroup_memory_nokmem __ro_after_init; |
04823c83 | 88 | |
21afa38e | 89 | /* Whether the swap controller is active */ |
c255a458 | 90 | #ifdef CONFIG_MEMCG_SWAP |
0f0cace3 | 91 | bool cgroup_memory_noswap __ro_after_init; |
c077719b | 92 | #else |
eccb52e7 | 93 | #define cgroup_memory_noswap 1 |
2d1c4980 | 94 | #endif |
c077719b | 95 | |
97b27821 TH |
96 | #ifdef CONFIG_CGROUP_WRITEBACK |
97 | static DECLARE_WAIT_QUEUE_HEAD(memcg_cgwb_frn_waitq); | |
98 | #endif | |
99 | ||
7941d214 JW |
100 | /* Whether legacy memory+swap accounting is active */ |
101 | static bool do_memsw_account(void) | |
102 | { | |
eccb52e7 | 103 | return !cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_noswap; |
7941d214 JW |
104 | } |
105 | ||
a0db00fc KS |
106 | #define THRESHOLDS_EVENTS_TARGET 128 |
107 | #define SOFTLIMIT_EVENTS_TARGET 1024 | |
e9f8974f | 108 | |
bb4cc1a8 AM |
109 | /* |
110 | * Cgroups above their limits are maintained in a RB-Tree, independent of | |
111 | * their hierarchy representation | |
112 | */ | |
113 | ||
ef8f2327 | 114 | struct mem_cgroup_tree_per_node { |
bb4cc1a8 | 115 | struct rb_root rb_root; |
fa90b2fd | 116 | struct rb_node *rb_rightmost; |
bb4cc1a8 AM |
117 | spinlock_t lock; |
118 | }; | |
119 | ||
bb4cc1a8 AM |
120 | struct mem_cgroup_tree { |
121 | struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES]; | |
122 | }; | |
123 | ||
124 | static struct mem_cgroup_tree soft_limit_tree __read_mostly; | |
125 | ||
9490ff27 KH |
126 | /* for OOM */ |
127 | struct mem_cgroup_eventfd_list { | |
128 | struct list_head list; | |
129 | struct eventfd_ctx *eventfd; | |
130 | }; | |
2e72b634 | 131 | |
79bd9814 TH |
132 | /* |
133 | * cgroup_event represents events which userspace want to receive. | |
134 | */ | |
3bc942f3 | 135 | struct mem_cgroup_event { |
79bd9814 | 136 | /* |
59b6f873 | 137 | * memcg which the event belongs to. |
79bd9814 | 138 | */ |
59b6f873 | 139 | struct mem_cgroup *memcg; |
79bd9814 TH |
140 | /* |
141 | * eventfd to signal userspace about the event. | |
142 | */ | |
143 | struct eventfd_ctx *eventfd; | |
144 | /* | |
145 | * Each of these stored in a list by the cgroup. | |
146 | */ | |
147 | struct list_head list; | |
fba94807 TH |
148 | /* |
149 | * register_event() callback will be used to add new userspace | |
150 | * waiter for changes related to this event. Use eventfd_signal() | |
151 | * on eventfd to send notification to userspace. | |
152 | */ | |
59b6f873 | 153 | int (*register_event)(struct mem_cgroup *memcg, |
347c4a87 | 154 | struct eventfd_ctx *eventfd, const char *args); |
fba94807 TH |
155 | /* |
156 | * unregister_event() callback will be called when userspace closes | |
157 | * the eventfd or on cgroup removing. This callback must be set, | |
158 | * if you want provide notification functionality. | |
159 | */ | |
59b6f873 | 160 | void (*unregister_event)(struct mem_cgroup *memcg, |
fba94807 | 161 | struct eventfd_ctx *eventfd); |
79bd9814 TH |
162 | /* |
163 | * All fields below needed to unregister event when | |
164 | * userspace closes eventfd. | |
165 | */ | |
166 | poll_table pt; | |
167 | wait_queue_head_t *wqh; | |
ac6424b9 | 168 | wait_queue_entry_t wait; |
79bd9814 TH |
169 | struct work_struct remove; |
170 | }; | |
171 | ||
c0ff4b85 R |
172 | static void mem_cgroup_threshold(struct mem_cgroup *memcg); |
173 | static void mem_cgroup_oom_notify(struct mem_cgroup *memcg); | |
2e72b634 | 174 | |
7dc74be0 DN |
175 | /* Stuffs for move charges at task migration. */ |
176 | /* | |
1dfab5ab | 177 | * Types of charges to be moved. |
7dc74be0 | 178 | */ |
1dfab5ab JW |
179 | #define MOVE_ANON 0x1U |
180 | #define MOVE_FILE 0x2U | |
181 | #define MOVE_MASK (MOVE_ANON | MOVE_FILE) | |
7dc74be0 | 182 | |
4ffef5fe DN |
183 | /* "mc" and its members are protected by cgroup_mutex */ |
184 | static struct move_charge_struct { | |
b1dd693e | 185 | spinlock_t lock; /* for from, to */ |
264a0ae1 | 186 | struct mm_struct *mm; |
4ffef5fe DN |
187 | struct mem_cgroup *from; |
188 | struct mem_cgroup *to; | |
1dfab5ab | 189 | unsigned long flags; |
4ffef5fe | 190 | unsigned long precharge; |
854ffa8d | 191 | unsigned long moved_charge; |
483c30b5 | 192 | unsigned long moved_swap; |
8033b97c DN |
193 | struct task_struct *moving_task; /* a task moving charges */ |
194 | wait_queue_head_t waitq; /* a waitq for other context */ | |
195 | } mc = { | |
2bd9bb20 | 196 | .lock = __SPIN_LOCK_UNLOCKED(mc.lock), |
8033b97c DN |
197 | .waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq), |
198 | }; | |
4ffef5fe | 199 | |
4e416953 BS |
200 | /* |
201 | * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft | |
202 | * limit reclaim to prevent infinite loops, if they ever occur. | |
203 | */ | |
a0db00fc | 204 | #define MEM_CGROUP_MAX_RECLAIM_LOOPS 100 |
bb4cc1a8 | 205 | #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS 2 |
4e416953 | 206 | |
8c7c6e34 | 207 | /* for encoding cft->private value on file */ |
86ae53e1 GC |
208 | enum res_type { |
209 | _MEM, | |
210 | _MEMSWAP, | |
211 | _OOM_TYPE, | |
510fc4e1 | 212 | _KMEM, |
d55f90bf | 213 | _TCP, |
86ae53e1 GC |
214 | }; |
215 | ||
a0db00fc KS |
216 | #define MEMFILE_PRIVATE(x, val) ((x) << 16 | (val)) |
217 | #define MEMFILE_TYPE(val) ((val) >> 16 & 0xffff) | |
8c7c6e34 | 218 | #define MEMFILE_ATTR(val) ((val) & 0xffff) |
f0953a1b | 219 | /* Used for OOM notifier */ |
9490ff27 | 220 | #define OOM_CONTROL (0) |
8c7c6e34 | 221 | |
b05706f1 KT |
222 | /* |
223 | * Iteration constructs for visiting all cgroups (under a tree). If | |
224 | * loops are exited prematurely (break), mem_cgroup_iter_break() must | |
225 | * be used for reference counting. | |
226 | */ | |
227 | #define for_each_mem_cgroup_tree(iter, root) \ | |
228 | for (iter = mem_cgroup_iter(root, NULL, NULL); \ | |
229 | iter != NULL; \ | |
230 | iter = mem_cgroup_iter(root, iter, NULL)) | |
231 | ||
232 | #define for_each_mem_cgroup(iter) \ | |
233 | for (iter = mem_cgroup_iter(NULL, NULL, NULL); \ | |
234 | iter != NULL; \ | |
235 | iter = mem_cgroup_iter(NULL, iter, NULL)) | |
236 | ||
3a4618fc | 237 | static inline bool task_is_dying(void) |
7775face TH |
238 | { |
239 | return tsk_is_oom_victim(current) || fatal_signal_pending(current) || | |
240 | (current->flags & PF_EXITING); | |
241 | } | |
242 | ||
70ddf637 AV |
243 | /* Some nice accessors for the vmpressure. */ |
244 | struct vmpressure *memcg_to_vmpressure(struct mem_cgroup *memcg) | |
245 | { | |
246 | if (!memcg) | |
247 | memcg = root_mem_cgroup; | |
248 | return &memcg->vmpressure; | |
249 | } | |
250 | ||
9647875b | 251 | struct mem_cgroup *vmpressure_to_memcg(struct vmpressure *vmpr) |
70ddf637 | 252 | { |
9647875b | 253 | return container_of(vmpr, struct mem_cgroup, vmpressure); |
70ddf637 AV |
254 | } |
255 | ||
84c07d11 | 256 | #ifdef CONFIG_MEMCG_KMEM |
00fe7039 | 257 | static DEFINE_SPINLOCK(objcg_lock); |
bf4f0599 | 258 | |
4d5c8aed RG |
259 | bool mem_cgroup_kmem_disabled(void) |
260 | { | |
261 | return cgroup_memory_nokmem; | |
262 | } | |
263 | ||
f1286fae MS |
264 | static void obj_cgroup_uncharge_pages(struct obj_cgroup *objcg, |
265 | unsigned int nr_pages); | |
c1a660de | 266 | |
bf4f0599 RG |
267 | static void obj_cgroup_release(struct percpu_ref *ref) |
268 | { | |
269 | struct obj_cgroup *objcg = container_of(ref, struct obj_cgroup, refcnt); | |
bf4f0599 RG |
270 | unsigned int nr_bytes; |
271 | unsigned int nr_pages; | |
272 | unsigned long flags; | |
273 | ||
274 | /* | |
275 | * At this point all allocated objects are freed, and | |
276 | * objcg->nr_charged_bytes can't have an arbitrary byte value. | |
277 | * However, it can be PAGE_SIZE or (x * PAGE_SIZE). | |
278 | * | |
279 | * The following sequence can lead to it: | |
280 | * 1) CPU0: objcg == stock->cached_objcg | |
281 | * 2) CPU1: we do a small allocation (e.g. 92 bytes), | |
282 | * PAGE_SIZE bytes are charged | |
283 | * 3) CPU1: a process from another memcg is allocating something, | |
284 | * the stock if flushed, | |
285 | * objcg->nr_charged_bytes = PAGE_SIZE - 92 | |
286 | * 5) CPU0: we do release this object, | |
287 | * 92 bytes are added to stock->nr_bytes | |
288 | * 6) CPU0: stock is flushed, | |
289 | * 92 bytes are added to objcg->nr_charged_bytes | |
290 | * | |
291 | * In the result, nr_charged_bytes == PAGE_SIZE. | |
292 | * This page will be uncharged in obj_cgroup_release(). | |
293 | */ | |
294 | nr_bytes = atomic_read(&objcg->nr_charged_bytes); | |
295 | WARN_ON_ONCE(nr_bytes & (PAGE_SIZE - 1)); | |
296 | nr_pages = nr_bytes >> PAGE_SHIFT; | |
297 | ||
bf4f0599 | 298 | if (nr_pages) |
f1286fae | 299 | obj_cgroup_uncharge_pages(objcg, nr_pages); |
271dd6b1 | 300 | |
00fe7039 | 301 | spin_lock_irqsave(&objcg_lock, flags); |
bf4f0599 | 302 | list_del(&objcg->list); |
00fe7039 | 303 | spin_unlock_irqrestore(&objcg_lock, flags); |
bf4f0599 RG |
304 | |
305 | percpu_ref_exit(ref); | |
306 | kfree_rcu(objcg, rcu); | |
307 | } | |
308 | ||
309 | static struct obj_cgroup *obj_cgroup_alloc(void) | |
310 | { | |
311 | struct obj_cgroup *objcg; | |
312 | int ret; | |
313 | ||
314 | objcg = kzalloc(sizeof(struct obj_cgroup), GFP_KERNEL); | |
315 | if (!objcg) | |
316 | return NULL; | |
317 | ||
318 | ret = percpu_ref_init(&objcg->refcnt, obj_cgroup_release, 0, | |
319 | GFP_KERNEL); | |
320 | if (ret) { | |
321 | kfree(objcg); | |
322 | return NULL; | |
323 | } | |
324 | INIT_LIST_HEAD(&objcg->list); | |
325 | return objcg; | |
326 | } | |
327 | ||
328 | static void memcg_reparent_objcgs(struct mem_cgroup *memcg, | |
329 | struct mem_cgroup *parent) | |
330 | { | |
331 | struct obj_cgroup *objcg, *iter; | |
332 | ||
333 | objcg = rcu_replace_pointer(memcg->objcg, NULL, true); | |
334 | ||
00fe7039 | 335 | spin_lock_irq(&objcg_lock); |
bf4f0599 | 336 | |
9838354e MS |
337 | /* 1) Ready to reparent active objcg. */ |
338 | list_add(&objcg->list, &memcg->objcg_list); | |
339 | /* 2) Reparent active objcg and already reparented objcgs to parent. */ | |
340 | list_for_each_entry(iter, &memcg->objcg_list, list) | |
341 | WRITE_ONCE(iter->memcg, parent); | |
342 | /* 3) Move already reparented objcgs to the parent's list */ | |
bf4f0599 RG |
343 | list_splice(&memcg->objcg_list, &parent->objcg_list); |
344 | ||
00fe7039 | 345 | spin_unlock_irq(&objcg_lock); |
bf4f0599 RG |
346 | |
347 | percpu_ref_kill(&objcg->refcnt); | |
348 | } | |
349 | ||
55007d84 | 350 | /* |
9855609b | 351 | * This will be used as a shrinker list's index. |
b8627835 LZ |
352 | * The main reason for not using cgroup id for this: |
353 | * this works better in sparse environments, where we have a lot of memcgs, | |
354 | * but only a few kmem-limited. Or also, if we have, for instance, 200 | |
355 | * memcgs, and none but the 200th is kmem-limited, we'd have to have a | |
356 | * 200 entry array for that. | |
55007d84 | 357 | * |
dbcf73e2 VD |
358 | * The current size of the caches array is stored in memcg_nr_cache_ids. It |
359 | * will double each time we have to increase it. | |
55007d84 | 360 | */ |
dbcf73e2 VD |
361 | static DEFINE_IDA(memcg_cache_ida); |
362 | int memcg_nr_cache_ids; | |
749c5415 | 363 | |
05257a1a VD |
364 | /* Protects memcg_nr_cache_ids */ |
365 | static DECLARE_RWSEM(memcg_cache_ids_sem); | |
366 | ||
367 | void memcg_get_cache_ids(void) | |
368 | { | |
369 | down_read(&memcg_cache_ids_sem); | |
370 | } | |
371 | ||
372 | void memcg_put_cache_ids(void) | |
373 | { | |
374 | up_read(&memcg_cache_ids_sem); | |
375 | } | |
376 | ||
55007d84 GC |
377 | /* |
378 | * MIN_SIZE is different than 1, because we would like to avoid going through | |
379 | * the alloc/free process all the time. In a small machine, 4 kmem-limited | |
380 | * cgroups is a reasonable guess. In the future, it could be a parameter or | |
381 | * tunable, but that is strictly not necessary. | |
382 | * | |
b8627835 | 383 | * MAX_SIZE should be as large as the number of cgrp_ids. Ideally, we could get |
55007d84 GC |
384 | * this constant directly from cgroup, but it is understandable that this is |
385 | * better kept as an internal representation in cgroup.c. In any case, the | |
b8627835 | 386 | * cgrp_id space is not getting any smaller, and we don't have to necessarily |
55007d84 GC |
387 | * increase ours as well if it increases. |
388 | */ | |
389 | #define MEMCG_CACHES_MIN_SIZE 4 | |
b8627835 | 390 | #define MEMCG_CACHES_MAX_SIZE MEM_CGROUP_ID_MAX |
55007d84 | 391 | |
d7f25f8a GC |
392 | /* |
393 | * A lot of the calls to the cache allocation functions are expected to be | |
272911a4 | 394 | * inlined by the compiler. Since the calls to memcg_slab_pre_alloc_hook() are |
d7f25f8a GC |
395 | * conditional to this static branch, we'll have to allow modules that does |
396 | * kmem_cache_alloc and the such to see this symbol as well | |
397 | */ | |
ef12947c | 398 | DEFINE_STATIC_KEY_FALSE(memcg_kmem_enabled_key); |
d7f25f8a | 399 | EXPORT_SYMBOL(memcg_kmem_enabled_key); |
0a432dcb | 400 | #endif |
17cc4dfe | 401 | |
ad7fa852 TH |
402 | /** |
403 | * mem_cgroup_css_from_page - css of the memcg associated with a page | |
404 | * @page: page of interest | |
405 | * | |
406 | * If memcg is bound to the default hierarchy, css of the memcg associated | |
407 | * with @page is returned. The returned css remains associated with @page | |
408 | * until it is released. | |
409 | * | |
410 | * If memcg is bound to a traditional hierarchy, the css of root_mem_cgroup | |
411 | * is returned. | |
ad7fa852 TH |
412 | */ |
413 | struct cgroup_subsys_state *mem_cgroup_css_from_page(struct page *page) | |
414 | { | |
415 | struct mem_cgroup *memcg; | |
416 | ||
bcfe06bf | 417 | memcg = page_memcg(page); |
ad7fa852 | 418 | |
9e10a130 | 419 | if (!memcg || !cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
ad7fa852 TH |
420 | memcg = root_mem_cgroup; |
421 | ||
ad7fa852 TH |
422 | return &memcg->css; |
423 | } | |
424 | ||
2fc04524 VD |
425 | /** |
426 | * page_cgroup_ino - return inode number of the memcg a page is charged to | |
427 | * @page: the page | |
428 | * | |
429 | * Look up the closest online ancestor of the memory cgroup @page is charged to | |
430 | * and return its inode number or 0 if @page is not charged to any cgroup. It | |
431 | * is safe to call this function without holding a reference to @page. | |
432 | * | |
433 | * Note, this function is inherently racy, because there is nothing to prevent | |
434 | * the cgroup inode from getting torn down and potentially reallocated a moment | |
435 | * after page_cgroup_ino() returns, so it only should be used by callers that | |
436 | * do not care (such as procfs interfaces). | |
437 | */ | |
438 | ino_t page_cgroup_ino(struct page *page) | |
439 | { | |
440 | struct mem_cgroup *memcg; | |
441 | unsigned long ino = 0; | |
442 | ||
443 | rcu_read_lock(); | |
bcfe06bf | 444 | memcg = page_memcg_check(page); |
286e04b8 | 445 | |
2fc04524 VD |
446 | while (memcg && !(memcg->css.flags & CSS_ONLINE)) |
447 | memcg = parent_mem_cgroup(memcg); | |
448 | if (memcg) | |
449 | ino = cgroup_ino(memcg->css.cgroup); | |
450 | rcu_read_unlock(); | |
451 | return ino; | |
452 | } | |
453 | ||
ef8f2327 MG |
454 | static struct mem_cgroup_per_node * |
455 | mem_cgroup_page_nodeinfo(struct mem_cgroup *memcg, struct page *page) | |
f64c3f54 | 456 | { |
97a6c37b | 457 | int nid = page_to_nid(page); |
f64c3f54 | 458 | |
ef8f2327 | 459 | return memcg->nodeinfo[nid]; |
f64c3f54 BS |
460 | } |
461 | ||
ef8f2327 MG |
462 | static struct mem_cgroup_tree_per_node * |
463 | soft_limit_tree_node(int nid) | |
bb4cc1a8 | 464 | { |
ef8f2327 | 465 | return soft_limit_tree.rb_tree_per_node[nid]; |
bb4cc1a8 AM |
466 | } |
467 | ||
ef8f2327 | 468 | static struct mem_cgroup_tree_per_node * |
bb4cc1a8 AM |
469 | soft_limit_tree_from_page(struct page *page) |
470 | { | |
471 | int nid = page_to_nid(page); | |
bb4cc1a8 | 472 | |
ef8f2327 | 473 | return soft_limit_tree.rb_tree_per_node[nid]; |
bb4cc1a8 AM |
474 | } |
475 | ||
ef8f2327 MG |
476 | static void __mem_cgroup_insert_exceeded(struct mem_cgroup_per_node *mz, |
477 | struct mem_cgroup_tree_per_node *mctz, | |
3e32cb2e | 478 | unsigned long new_usage_in_excess) |
bb4cc1a8 AM |
479 | { |
480 | struct rb_node **p = &mctz->rb_root.rb_node; | |
481 | struct rb_node *parent = NULL; | |
ef8f2327 | 482 | struct mem_cgroup_per_node *mz_node; |
fa90b2fd | 483 | bool rightmost = true; |
bb4cc1a8 AM |
484 | |
485 | if (mz->on_tree) | |
486 | return; | |
487 | ||
488 | mz->usage_in_excess = new_usage_in_excess; | |
489 | if (!mz->usage_in_excess) | |
490 | return; | |
491 | while (*p) { | |
492 | parent = *p; | |
ef8f2327 | 493 | mz_node = rb_entry(parent, struct mem_cgroup_per_node, |
bb4cc1a8 | 494 | tree_node); |
fa90b2fd | 495 | if (mz->usage_in_excess < mz_node->usage_in_excess) { |
bb4cc1a8 | 496 | p = &(*p)->rb_left; |
fa90b2fd | 497 | rightmost = false; |
378876b0 | 498 | } else { |
bb4cc1a8 | 499 | p = &(*p)->rb_right; |
378876b0 | 500 | } |
bb4cc1a8 | 501 | } |
fa90b2fd DB |
502 | |
503 | if (rightmost) | |
504 | mctz->rb_rightmost = &mz->tree_node; | |
505 | ||
bb4cc1a8 AM |
506 | rb_link_node(&mz->tree_node, parent, p); |
507 | rb_insert_color(&mz->tree_node, &mctz->rb_root); | |
508 | mz->on_tree = true; | |
509 | } | |
510 | ||
ef8f2327 MG |
511 | static void __mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz, |
512 | struct mem_cgroup_tree_per_node *mctz) | |
bb4cc1a8 AM |
513 | { |
514 | if (!mz->on_tree) | |
515 | return; | |
fa90b2fd DB |
516 | |
517 | if (&mz->tree_node == mctz->rb_rightmost) | |
518 | mctz->rb_rightmost = rb_prev(&mz->tree_node); | |
519 | ||
bb4cc1a8 AM |
520 | rb_erase(&mz->tree_node, &mctz->rb_root); |
521 | mz->on_tree = false; | |
522 | } | |
523 | ||
ef8f2327 MG |
524 | static void mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz, |
525 | struct mem_cgroup_tree_per_node *mctz) | |
bb4cc1a8 | 526 | { |
0a31bc97 JW |
527 | unsigned long flags; |
528 | ||
529 | spin_lock_irqsave(&mctz->lock, flags); | |
cf2c8127 | 530 | __mem_cgroup_remove_exceeded(mz, mctz); |
0a31bc97 | 531 | spin_unlock_irqrestore(&mctz->lock, flags); |
bb4cc1a8 AM |
532 | } |
533 | ||
3e32cb2e JW |
534 | static unsigned long soft_limit_excess(struct mem_cgroup *memcg) |
535 | { | |
536 | unsigned long nr_pages = page_counter_read(&memcg->memory); | |
4db0c3c2 | 537 | unsigned long soft_limit = READ_ONCE(memcg->soft_limit); |
3e32cb2e JW |
538 | unsigned long excess = 0; |
539 | ||
540 | if (nr_pages > soft_limit) | |
541 | excess = nr_pages - soft_limit; | |
542 | ||
543 | return excess; | |
544 | } | |
bb4cc1a8 AM |
545 | |
546 | static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page) | |
547 | { | |
3e32cb2e | 548 | unsigned long excess; |
ef8f2327 MG |
549 | struct mem_cgroup_per_node *mz; |
550 | struct mem_cgroup_tree_per_node *mctz; | |
bb4cc1a8 | 551 | |
e231875b | 552 | mctz = soft_limit_tree_from_page(page); |
bfc7228b LD |
553 | if (!mctz) |
554 | return; | |
bb4cc1a8 AM |
555 | /* |
556 | * Necessary to update all ancestors when hierarchy is used. | |
557 | * because their event counter is not touched. | |
558 | */ | |
559 | for (; memcg; memcg = parent_mem_cgroup(memcg)) { | |
ef8f2327 | 560 | mz = mem_cgroup_page_nodeinfo(memcg, page); |
3e32cb2e | 561 | excess = soft_limit_excess(memcg); |
bb4cc1a8 AM |
562 | /* |
563 | * We have to update the tree if mz is on RB-tree or | |
564 | * mem is over its softlimit. | |
565 | */ | |
566 | if (excess || mz->on_tree) { | |
0a31bc97 JW |
567 | unsigned long flags; |
568 | ||
569 | spin_lock_irqsave(&mctz->lock, flags); | |
bb4cc1a8 AM |
570 | /* if on-tree, remove it */ |
571 | if (mz->on_tree) | |
cf2c8127 | 572 | __mem_cgroup_remove_exceeded(mz, mctz); |
bb4cc1a8 AM |
573 | /* |
574 | * Insert again. mz->usage_in_excess will be updated. | |
575 | * If excess is 0, no tree ops. | |
576 | */ | |
cf2c8127 | 577 | __mem_cgroup_insert_exceeded(mz, mctz, excess); |
0a31bc97 | 578 | spin_unlock_irqrestore(&mctz->lock, flags); |
bb4cc1a8 AM |
579 | } |
580 | } | |
581 | } | |
582 | ||
583 | static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg) | |
584 | { | |
ef8f2327 MG |
585 | struct mem_cgroup_tree_per_node *mctz; |
586 | struct mem_cgroup_per_node *mz; | |
587 | int nid; | |
bb4cc1a8 | 588 | |
e231875b | 589 | for_each_node(nid) { |
a3747b53 | 590 | mz = memcg->nodeinfo[nid]; |
ef8f2327 | 591 | mctz = soft_limit_tree_node(nid); |
bfc7228b LD |
592 | if (mctz) |
593 | mem_cgroup_remove_exceeded(mz, mctz); | |
bb4cc1a8 AM |
594 | } |
595 | } | |
596 | ||
ef8f2327 MG |
597 | static struct mem_cgroup_per_node * |
598 | __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node *mctz) | |
bb4cc1a8 | 599 | { |
ef8f2327 | 600 | struct mem_cgroup_per_node *mz; |
bb4cc1a8 AM |
601 | |
602 | retry: | |
603 | mz = NULL; | |
fa90b2fd | 604 | if (!mctz->rb_rightmost) |
bb4cc1a8 AM |
605 | goto done; /* Nothing to reclaim from */ |
606 | ||
fa90b2fd DB |
607 | mz = rb_entry(mctz->rb_rightmost, |
608 | struct mem_cgroup_per_node, tree_node); | |
bb4cc1a8 AM |
609 | /* |
610 | * Remove the node now but someone else can add it back, | |
611 | * we will to add it back at the end of reclaim to its correct | |
612 | * position in the tree. | |
613 | */ | |
cf2c8127 | 614 | __mem_cgroup_remove_exceeded(mz, mctz); |
3e32cb2e | 615 | if (!soft_limit_excess(mz->memcg) || |
8965aa28 | 616 | !css_tryget(&mz->memcg->css)) |
bb4cc1a8 AM |
617 | goto retry; |
618 | done: | |
619 | return mz; | |
620 | } | |
621 | ||
ef8f2327 MG |
622 | static struct mem_cgroup_per_node * |
623 | mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node *mctz) | |
bb4cc1a8 | 624 | { |
ef8f2327 | 625 | struct mem_cgroup_per_node *mz; |
bb4cc1a8 | 626 | |
0a31bc97 | 627 | spin_lock_irq(&mctz->lock); |
bb4cc1a8 | 628 | mz = __mem_cgroup_largest_soft_limit_node(mctz); |
0a31bc97 | 629 | spin_unlock_irq(&mctz->lock); |
bb4cc1a8 AM |
630 | return mz; |
631 | } | |
632 | ||
00525f43 SB |
633 | /* |
634 | * memcg and lruvec stats flushing | |
635 | * | |
636 | * Many codepaths leading to stats update or read are performance sensitive and | |
637 | * adding stats flushing in such codepaths is not desirable. So, to optimize the | |
638 | * flushing the kernel does: | |
639 | * | |
640 | * 1) Periodically and asynchronously flush the stats every 2 seconds to not let | |
641 | * rstat update tree grow unbounded. | |
642 | * | |
643 | * 2) Flush the stats synchronously on reader side only when there are more than | |
644 | * (MEMCG_CHARGE_BATCH * nr_cpus) update events. Though this optimization | |
645 | * will let stats be out of sync by atmost (MEMCG_CHARGE_BATCH * nr_cpus) but | |
646 | * only for 2 seconds due to (1). | |
647 | */ | |
648 | static void flush_memcg_stats_dwork(struct work_struct *w); | |
649 | static DECLARE_DEFERRABLE_WORK(stats_flush_dwork, flush_memcg_stats_dwork); | |
650 | static DEFINE_SPINLOCK(stats_flush_lock); | |
651 | static DEFINE_PER_CPU(unsigned int, stats_updates); | |
652 | static atomic_t stats_flush_threshold = ATOMIC_INIT(0); | |
39f33712 SB |
653 | static u64 flush_next_time; |
654 | ||
655 | #define FLUSH_TIME (2UL*HZ) | |
00525f43 | 656 | |
43d67e44 | 657 | static inline void memcg_rstat_updated(struct mem_cgroup *memcg, int val) |
00525f43 | 658 | { |
43d67e44 SB |
659 | unsigned int x; |
660 | ||
00525f43 | 661 | cgroup_rstat_updated(memcg->css.cgroup, smp_processor_id()); |
43d67e44 SB |
662 | |
663 | x = __this_cpu_add_return(stats_updates, abs(val)); | |
664 | if (x > MEMCG_CHARGE_BATCH) { | |
665 | atomic_add(x / MEMCG_CHARGE_BATCH, &stats_flush_threshold); | |
666 | __this_cpu_write(stats_updates, 0); | |
667 | } | |
00525f43 SB |
668 | } |
669 | ||
670 | static void __mem_cgroup_flush_stats(void) | |
671 | { | |
909fc739 SB |
672 | unsigned long flag; |
673 | ||
674 | if (!spin_trylock_irqsave(&stats_flush_lock, flag)) | |
00525f43 SB |
675 | return; |
676 | ||
39f33712 | 677 | flush_next_time = jiffies_64 + 2*FLUSH_TIME; |
00525f43 SB |
678 | cgroup_rstat_flush_irqsafe(root_mem_cgroup->css.cgroup); |
679 | atomic_set(&stats_flush_threshold, 0); | |
909fc739 | 680 | spin_unlock_irqrestore(&stats_flush_lock, flag); |
00525f43 SB |
681 | } |
682 | ||
683 | void mem_cgroup_flush_stats(void) | |
684 | { | |
685 | if (atomic_read(&stats_flush_threshold) > num_online_cpus()) | |
686 | __mem_cgroup_flush_stats(); | |
687 | } | |
688 | ||
39f33712 SB |
689 | void mem_cgroup_flush_stats_delayed(void) |
690 | { | |
691 | if (time_after64(jiffies_64, flush_next_time)) | |
692 | mem_cgroup_flush_stats(); | |
693 | } | |
694 | ||
00525f43 SB |
695 | static void flush_memcg_stats_dwork(struct work_struct *w) |
696 | { | |
43d67e44 | 697 | __mem_cgroup_flush_stats(); |
39f33712 | 698 | queue_delayed_work(system_unbound_wq, &stats_flush_dwork, FLUSH_TIME); |
00525f43 SB |
699 | } |
700 | ||
db9adbcb JW |
701 | /** |
702 | * __mod_memcg_state - update cgroup memory statistics | |
703 | * @memcg: the memory cgroup | |
704 | * @idx: the stat item - can be enum memcg_stat_item or enum node_stat_item | |
705 | * @val: delta to add to the counter, can be negative | |
706 | */ | |
707 | void __mod_memcg_state(struct mem_cgroup *memcg, int idx, int val) | |
708 | { | |
db9adbcb JW |
709 | if (mem_cgroup_disabled()) |
710 | return; | |
711 | ||
2d146aa3 | 712 | __this_cpu_add(memcg->vmstats_percpu->state[idx], val); |
43d67e44 | 713 | memcg_rstat_updated(memcg, val); |
db9adbcb JW |
714 | } |
715 | ||
2d146aa3 | 716 | /* idx can be of type enum memcg_stat_item or node_stat_item. */ |
a18e6e6e JW |
717 | static unsigned long memcg_page_state_local(struct mem_cgroup *memcg, int idx) |
718 | { | |
719 | long x = 0; | |
720 | int cpu; | |
721 | ||
722 | for_each_possible_cpu(cpu) | |
2d146aa3 | 723 | x += per_cpu(memcg->vmstats_percpu->state[idx], cpu); |
a18e6e6e JW |
724 | #ifdef CONFIG_SMP |
725 | if (x < 0) | |
726 | x = 0; | |
727 | #endif | |
728 | return x; | |
729 | } | |
730 | ||
eedc4e5a RG |
731 | void __mod_memcg_lruvec_state(struct lruvec *lruvec, enum node_stat_item idx, |
732 | int val) | |
db9adbcb JW |
733 | { |
734 | struct mem_cgroup_per_node *pn; | |
42a30035 | 735 | struct mem_cgroup *memcg; |
db9adbcb | 736 | |
db9adbcb | 737 | pn = container_of(lruvec, struct mem_cgroup_per_node, lruvec); |
42a30035 | 738 | memcg = pn->memcg; |
db9adbcb JW |
739 | |
740 | /* Update memcg */ | |
00525f43 | 741 | __this_cpu_add(memcg->vmstats_percpu->state[idx], val); |
db9adbcb | 742 | |
b4c46484 | 743 | /* Update lruvec */ |
7e1c0d6f | 744 | __this_cpu_add(pn->lruvec_stats_percpu->state[idx], val); |
00525f43 | 745 | |
43d67e44 | 746 | memcg_rstat_updated(memcg, val); |
db9adbcb JW |
747 | } |
748 | ||
eedc4e5a RG |
749 | /** |
750 | * __mod_lruvec_state - update lruvec memory statistics | |
751 | * @lruvec: the lruvec | |
752 | * @idx: the stat item | |
753 | * @val: delta to add to the counter, can be negative | |
754 | * | |
755 | * The lruvec is the intersection of the NUMA node and a cgroup. This | |
756 | * function updates the all three counters that are affected by a | |
757 | * change of state at this level: per-node, per-cgroup, per-lruvec. | |
758 | */ | |
759 | void __mod_lruvec_state(struct lruvec *lruvec, enum node_stat_item idx, | |
760 | int val) | |
761 | { | |
762 | /* Update node */ | |
763 | __mod_node_page_state(lruvec_pgdat(lruvec), idx, val); | |
764 | ||
765 | /* Update memcg and lruvec */ | |
766 | if (!mem_cgroup_disabled()) | |
767 | __mod_memcg_lruvec_state(lruvec, idx, val); | |
768 | } | |
769 | ||
c47d5032 SB |
770 | void __mod_lruvec_page_state(struct page *page, enum node_stat_item idx, |
771 | int val) | |
772 | { | |
773 | struct page *head = compound_head(page); /* rmap on tail pages */ | |
b4e0b68f | 774 | struct mem_cgroup *memcg; |
c47d5032 SB |
775 | pg_data_t *pgdat = page_pgdat(page); |
776 | struct lruvec *lruvec; | |
777 | ||
b4e0b68f MS |
778 | rcu_read_lock(); |
779 | memcg = page_memcg(head); | |
c47d5032 | 780 | /* Untracked pages have no memcg, no lruvec. Update only the node */ |
d635a69d | 781 | if (!memcg) { |
b4e0b68f | 782 | rcu_read_unlock(); |
c47d5032 SB |
783 | __mod_node_page_state(pgdat, idx, val); |
784 | return; | |
785 | } | |
786 | ||
d635a69d | 787 | lruvec = mem_cgroup_lruvec(memcg, pgdat); |
c47d5032 | 788 | __mod_lruvec_state(lruvec, idx, val); |
b4e0b68f | 789 | rcu_read_unlock(); |
c47d5032 | 790 | } |
f0c0c115 | 791 | EXPORT_SYMBOL(__mod_lruvec_page_state); |
c47d5032 | 792 | |
da3ceeff | 793 | void __mod_lruvec_kmem_state(void *p, enum node_stat_item idx, int val) |
ec9f0238 | 794 | { |
4f103c63 | 795 | pg_data_t *pgdat = page_pgdat(virt_to_page(p)); |
ec9f0238 RG |
796 | struct mem_cgroup *memcg; |
797 | struct lruvec *lruvec; | |
798 | ||
799 | rcu_read_lock(); | |
4f103c63 | 800 | memcg = mem_cgroup_from_obj(p); |
ec9f0238 | 801 | |
8faeb1ff MS |
802 | /* |
803 | * Untracked pages have no memcg, no lruvec. Update only the | |
804 | * node. If we reparent the slab objects to the root memcg, | |
805 | * when we free the slab object, we need to update the per-memcg | |
806 | * vmstats to keep it correct for the root memcg. | |
807 | */ | |
808 | if (!memcg) { | |
ec9f0238 RG |
809 | __mod_node_page_state(pgdat, idx, val); |
810 | } else { | |
867e5e1d | 811 | lruvec = mem_cgroup_lruvec(memcg, pgdat); |
ec9f0238 RG |
812 | __mod_lruvec_state(lruvec, idx, val); |
813 | } | |
814 | rcu_read_unlock(); | |
815 | } | |
816 | ||
55927114 WL |
817 | /* |
818 | * mod_objcg_mlstate() may be called with irq enabled, so | |
819 | * mod_memcg_lruvec_state() should be used. | |
820 | */ | |
68ac5b3c WL |
821 | static inline void mod_objcg_mlstate(struct obj_cgroup *objcg, |
822 | struct pglist_data *pgdat, | |
823 | enum node_stat_item idx, int nr) | |
fdbcb2a6 WL |
824 | { |
825 | struct mem_cgroup *memcg; | |
826 | struct lruvec *lruvec; | |
827 | ||
828 | rcu_read_lock(); | |
829 | memcg = obj_cgroup_memcg(objcg); | |
830 | lruvec = mem_cgroup_lruvec(memcg, pgdat); | |
55927114 | 831 | mod_memcg_lruvec_state(lruvec, idx, nr); |
fdbcb2a6 WL |
832 | rcu_read_unlock(); |
833 | } | |
834 | ||
db9adbcb JW |
835 | /** |
836 | * __count_memcg_events - account VM events in a cgroup | |
837 | * @memcg: the memory cgroup | |
838 | * @idx: the event item | |
f0953a1b | 839 | * @count: the number of events that occurred |
db9adbcb JW |
840 | */ |
841 | void __count_memcg_events(struct mem_cgroup *memcg, enum vm_event_item idx, | |
842 | unsigned long count) | |
843 | { | |
db9adbcb JW |
844 | if (mem_cgroup_disabled()) |
845 | return; | |
846 | ||
2d146aa3 | 847 | __this_cpu_add(memcg->vmstats_percpu->events[idx], count); |
43d67e44 | 848 | memcg_rstat_updated(memcg, count); |
db9adbcb JW |
849 | } |
850 | ||
42a30035 | 851 | static unsigned long memcg_events(struct mem_cgroup *memcg, int event) |
e9f8974f | 852 | { |
2d146aa3 | 853 | return READ_ONCE(memcg->vmstats.events[event]); |
e9f8974f JW |
854 | } |
855 | ||
42a30035 JW |
856 | static unsigned long memcg_events_local(struct mem_cgroup *memcg, int event) |
857 | { | |
815744d7 JW |
858 | long x = 0; |
859 | int cpu; | |
860 | ||
861 | for_each_possible_cpu(cpu) | |
2d146aa3 | 862 | x += per_cpu(memcg->vmstats_percpu->events[event], cpu); |
815744d7 | 863 | return x; |
42a30035 JW |
864 | } |
865 | ||
c0ff4b85 | 866 | static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg, |
b070e65c | 867 | struct page *page, |
3fba69a5 | 868 | int nr_pages) |
d52aa412 | 869 | { |
e401f176 KH |
870 | /* pagein of a big page is an event. So, ignore page size */ |
871 | if (nr_pages > 0) | |
c9019e9b | 872 | __count_memcg_events(memcg, PGPGIN, 1); |
3751d604 | 873 | else { |
c9019e9b | 874 | __count_memcg_events(memcg, PGPGOUT, 1); |
3751d604 KH |
875 | nr_pages = -nr_pages; /* for event */ |
876 | } | |
e401f176 | 877 | |
871789d4 | 878 | __this_cpu_add(memcg->vmstats_percpu->nr_page_events, nr_pages); |
6d12e2d8 KH |
879 | } |
880 | ||
f53d7ce3 JW |
881 | static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg, |
882 | enum mem_cgroup_events_target target) | |
7a159cc9 JW |
883 | { |
884 | unsigned long val, next; | |
885 | ||
871789d4 CD |
886 | val = __this_cpu_read(memcg->vmstats_percpu->nr_page_events); |
887 | next = __this_cpu_read(memcg->vmstats_percpu->targets[target]); | |
7a159cc9 | 888 | /* from time_after() in jiffies.h */ |
6a1a8b80 | 889 | if ((long)(next - val) < 0) { |
f53d7ce3 JW |
890 | switch (target) { |
891 | case MEM_CGROUP_TARGET_THRESH: | |
892 | next = val + THRESHOLDS_EVENTS_TARGET; | |
893 | break; | |
bb4cc1a8 AM |
894 | case MEM_CGROUP_TARGET_SOFTLIMIT: |
895 | next = val + SOFTLIMIT_EVENTS_TARGET; | |
896 | break; | |
f53d7ce3 JW |
897 | default: |
898 | break; | |
899 | } | |
871789d4 | 900 | __this_cpu_write(memcg->vmstats_percpu->targets[target], next); |
f53d7ce3 | 901 | return true; |
7a159cc9 | 902 | } |
f53d7ce3 | 903 | return false; |
d2265e6f KH |
904 | } |
905 | ||
906 | /* | |
907 | * Check events in order. | |
908 | * | |
909 | */ | |
c0ff4b85 | 910 | static void memcg_check_events(struct mem_cgroup *memcg, struct page *page) |
d2265e6f KH |
911 | { |
912 | /* threshold event is triggered in finer grain than soft limit */ | |
f53d7ce3 JW |
913 | if (unlikely(mem_cgroup_event_ratelimit(memcg, |
914 | MEM_CGROUP_TARGET_THRESH))) { | |
bb4cc1a8 | 915 | bool do_softlimit; |
f53d7ce3 | 916 | |
bb4cc1a8 AM |
917 | do_softlimit = mem_cgroup_event_ratelimit(memcg, |
918 | MEM_CGROUP_TARGET_SOFTLIMIT); | |
c0ff4b85 | 919 | mem_cgroup_threshold(memcg); |
bb4cc1a8 AM |
920 | if (unlikely(do_softlimit)) |
921 | mem_cgroup_update_tree(memcg, page); | |
0a31bc97 | 922 | } |
d2265e6f KH |
923 | } |
924 | ||
cf475ad2 | 925 | struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p) |
78fb7466 | 926 | { |
31a78f23 BS |
927 | /* |
928 | * mm_update_next_owner() may clear mm->owner to NULL | |
929 | * if it races with swapoff, page migration, etc. | |
930 | * So this can be called with p == NULL. | |
931 | */ | |
932 | if (unlikely(!p)) | |
933 | return NULL; | |
934 | ||
073219e9 | 935 | return mem_cgroup_from_css(task_css(p, memory_cgrp_id)); |
78fb7466 | 936 | } |
33398cf2 | 937 | EXPORT_SYMBOL(mem_cgroup_from_task); |
78fb7466 | 938 | |
04f94e3f DS |
939 | static __always_inline struct mem_cgroup *active_memcg(void) |
940 | { | |
55a68c82 | 941 | if (!in_task()) |
04f94e3f DS |
942 | return this_cpu_read(int_active_memcg); |
943 | else | |
944 | return current->active_memcg; | |
945 | } | |
946 | ||
d46eb14b SB |
947 | /** |
948 | * get_mem_cgroup_from_mm: Obtain a reference on given mm_struct's memcg. | |
949 | * @mm: mm from which memcg should be extracted. It can be NULL. | |
950 | * | |
04f94e3f DS |
951 | * Obtain a reference on mm->memcg and returns it if successful. If mm |
952 | * is NULL, then the memcg is chosen as follows: | |
953 | * 1) The active memcg, if set. | |
954 | * 2) current->mm->memcg, if available | |
955 | * 3) root memcg | |
956 | * If mem_cgroup is disabled, NULL is returned. | |
d46eb14b SB |
957 | */ |
958 | struct mem_cgroup *get_mem_cgroup_from_mm(struct mm_struct *mm) | |
54595fe2 | 959 | { |
d46eb14b SB |
960 | struct mem_cgroup *memcg; |
961 | ||
962 | if (mem_cgroup_disabled()) | |
963 | return NULL; | |
0b7f569e | 964 | |
2884b6b7 MS |
965 | /* |
966 | * Page cache insertions can happen without an | |
967 | * actual mm context, e.g. during disk probing | |
968 | * on boot, loopback IO, acct() writes etc. | |
969 | * | |
970 | * No need to css_get on root memcg as the reference | |
971 | * counting is disabled on the root level in the | |
972 | * cgroup core. See CSS_NO_REF. | |
973 | */ | |
04f94e3f DS |
974 | if (unlikely(!mm)) { |
975 | memcg = active_memcg(); | |
976 | if (unlikely(memcg)) { | |
977 | /* remote memcg must hold a ref */ | |
978 | css_get(&memcg->css); | |
979 | return memcg; | |
980 | } | |
981 | mm = current->mm; | |
982 | if (unlikely(!mm)) | |
983 | return root_mem_cgroup; | |
984 | } | |
2884b6b7 | 985 | |
54595fe2 KH |
986 | rcu_read_lock(); |
987 | do { | |
2884b6b7 MS |
988 | memcg = mem_cgroup_from_task(rcu_dereference(mm->owner)); |
989 | if (unlikely(!memcg)) | |
df381975 | 990 | memcg = root_mem_cgroup; |
00d484f3 | 991 | } while (!css_tryget(&memcg->css)); |
54595fe2 | 992 | rcu_read_unlock(); |
c0ff4b85 | 993 | return memcg; |
54595fe2 | 994 | } |
d46eb14b SB |
995 | EXPORT_SYMBOL(get_mem_cgroup_from_mm); |
996 | ||
4127c650 RG |
997 | static __always_inline bool memcg_kmem_bypass(void) |
998 | { | |
999 | /* Allow remote memcg charging from any context. */ | |
1000 | if (unlikely(active_memcg())) | |
1001 | return false; | |
1002 | ||
1003 | /* Memcg to charge can't be determined. */ | |
6126891c | 1004 | if (!in_task() || !current->mm || (current->flags & PF_KTHREAD)) |
4127c650 RG |
1005 | return true; |
1006 | ||
1007 | return false; | |
1008 | } | |
1009 | ||
5660048c JW |
1010 | /** |
1011 | * mem_cgroup_iter - iterate over memory cgroup hierarchy | |
1012 | * @root: hierarchy root | |
1013 | * @prev: previously returned memcg, NULL on first invocation | |
1014 | * @reclaim: cookie for shared reclaim walks, NULL for full walks | |
1015 | * | |
1016 | * Returns references to children of the hierarchy below @root, or | |
1017 | * @root itself, or %NULL after a full round-trip. | |
1018 | * | |
1019 | * Caller must pass the return value in @prev on subsequent | |
1020 | * invocations for reference counting, or use mem_cgroup_iter_break() | |
1021 | * to cancel a hierarchy walk before the round-trip is complete. | |
1022 | * | |
05bdc520 ML |
1023 | * Reclaimers can specify a node in @reclaim to divide up the memcgs |
1024 | * in the hierarchy among all concurrent reclaimers operating on the | |
1025 | * same node. | |
5660048c | 1026 | */ |
694fbc0f | 1027 | struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root, |
5660048c | 1028 | struct mem_cgroup *prev, |
694fbc0f | 1029 | struct mem_cgroup_reclaim_cookie *reclaim) |
14067bb3 | 1030 | { |
3f649ab7 | 1031 | struct mem_cgroup_reclaim_iter *iter; |
5ac8fb31 | 1032 | struct cgroup_subsys_state *css = NULL; |
9f3a0d09 | 1033 | struct mem_cgroup *memcg = NULL; |
5ac8fb31 | 1034 | struct mem_cgroup *pos = NULL; |
711d3d2c | 1035 | |
694fbc0f AM |
1036 | if (mem_cgroup_disabled()) |
1037 | return NULL; | |
5660048c | 1038 | |
9f3a0d09 JW |
1039 | if (!root) |
1040 | root = root_mem_cgroup; | |
7d74b06f | 1041 | |
9f3a0d09 | 1042 | if (prev && !reclaim) |
5ac8fb31 | 1043 | pos = prev; |
14067bb3 | 1044 | |
542f85f9 | 1045 | rcu_read_lock(); |
5f578161 | 1046 | |
5ac8fb31 | 1047 | if (reclaim) { |
ef8f2327 | 1048 | struct mem_cgroup_per_node *mz; |
5ac8fb31 | 1049 | |
a3747b53 | 1050 | mz = root->nodeinfo[reclaim->pgdat->node_id]; |
9da83f3f | 1051 | iter = &mz->iter; |
5ac8fb31 JW |
1052 | |
1053 | if (prev && reclaim->generation != iter->generation) | |
1054 | goto out_unlock; | |
1055 | ||
6df38689 | 1056 | while (1) { |
4db0c3c2 | 1057 | pos = READ_ONCE(iter->position); |
6df38689 VD |
1058 | if (!pos || css_tryget(&pos->css)) |
1059 | break; | |
5ac8fb31 | 1060 | /* |
6df38689 VD |
1061 | * css reference reached zero, so iter->position will |
1062 | * be cleared by ->css_released. However, we should not | |
1063 | * rely on this happening soon, because ->css_released | |
1064 | * is called from a work queue, and by busy-waiting we | |
1065 | * might block it. So we clear iter->position right | |
1066 | * away. | |
5ac8fb31 | 1067 | */ |
6df38689 VD |
1068 | (void)cmpxchg(&iter->position, pos, NULL); |
1069 | } | |
5ac8fb31 JW |
1070 | } |
1071 | ||
1072 | if (pos) | |
1073 | css = &pos->css; | |
1074 | ||
1075 | for (;;) { | |
1076 | css = css_next_descendant_pre(css, &root->css); | |
1077 | if (!css) { | |
1078 | /* | |
1079 | * Reclaimers share the hierarchy walk, and a | |
1080 | * new one might jump in right at the end of | |
1081 | * the hierarchy - make sure they see at least | |
1082 | * one group and restart from the beginning. | |
1083 | */ | |
1084 | if (!prev) | |
1085 | continue; | |
1086 | break; | |
527a5ec9 | 1087 | } |
7d74b06f | 1088 | |
5ac8fb31 JW |
1089 | /* |
1090 | * Verify the css and acquire a reference. The root | |
1091 | * is provided by the caller, so we know it's alive | |
1092 | * and kicking, and don't take an extra reference. | |
1093 | */ | |
1094 | memcg = mem_cgroup_from_css(css); | |
14067bb3 | 1095 | |
5ac8fb31 JW |
1096 | if (css == &root->css) |
1097 | break; | |
14067bb3 | 1098 | |
0b8f73e1 JW |
1099 | if (css_tryget(css)) |
1100 | break; | |
9f3a0d09 | 1101 | |
5ac8fb31 | 1102 | memcg = NULL; |
9f3a0d09 | 1103 | } |
5ac8fb31 JW |
1104 | |
1105 | if (reclaim) { | |
5ac8fb31 | 1106 | /* |
6df38689 VD |
1107 | * The position could have already been updated by a competing |
1108 | * thread, so check that the value hasn't changed since we read | |
1109 | * it to avoid reclaiming from the same cgroup twice. | |
5ac8fb31 | 1110 | */ |
6df38689 VD |
1111 | (void)cmpxchg(&iter->position, pos, memcg); |
1112 | ||
5ac8fb31 JW |
1113 | if (pos) |
1114 | css_put(&pos->css); | |
1115 | ||
1116 | if (!memcg) | |
1117 | iter->generation++; | |
1118 | else if (!prev) | |
1119 | reclaim->generation = iter->generation; | |
9f3a0d09 | 1120 | } |
5ac8fb31 | 1121 | |
542f85f9 MH |
1122 | out_unlock: |
1123 | rcu_read_unlock(); | |
c40046f3 MH |
1124 | if (prev && prev != root) |
1125 | css_put(&prev->css); | |
1126 | ||
9f3a0d09 | 1127 | return memcg; |
14067bb3 | 1128 | } |
7d74b06f | 1129 | |
5660048c JW |
1130 | /** |
1131 | * mem_cgroup_iter_break - abort a hierarchy walk prematurely | |
1132 | * @root: hierarchy root | |
1133 | * @prev: last visited hierarchy member as returned by mem_cgroup_iter() | |
1134 | */ | |
1135 | void mem_cgroup_iter_break(struct mem_cgroup *root, | |
1136 | struct mem_cgroup *prev) | |
9f3a0d09 JW |
1137 | { |
1138 | if (!root) | |
1139 | root = root_mem_cgroup; | |
1140 | if (prev && prev != root) | |
1141 | css_put(&prev->css); | |
1142 | } | |
7d74b06f | 1143 | |
54a83d6b MC |
1144 | static void __invalidate_reclaim_iterators(struct mem_cgroup *from, |
1145 | struct mem_cgroup *dead_memcg) | |
6df38689 | 1146 | { |
6df38689 | 1147 | struct mem_cgroup_reclaim_iter *iter; |
ef8f2327 MG |
1148 | struct mem_cgroup_per_node *mz; |
1149 | int nid; | |
6df38689 | 1150 | |
54a83d6b | 1151 | for_each_node(nid) { |
a3747b53 | 1152 | mz = from->nodeinfo[nid]; |
9da83f3f YS |
1153 | iter = &mz->iter; |
1154 | cmpxchg(&iter->position, dead_memcg, NULL); | |
6df38689 VD |
1155 | } |
1156 | } | |
1157 | ||
54a83d6b MC |
1158 | static void invalidate_reclaim_iterators(struct mem_cgroup *dead_memcg) |
1159 | { | |
1160 | struct mem_cgroup *memcg = dead_memcg; | |
1161 | struct mem_cgroup *last; | |
1162 | ||
1163 | do { | |
1164 | __invalidate_reclaim_iterators(memcg, dead_memcg); | |
1165 | last = memcg; | |
1166 | } while ((memcg = parent_mem_cgroup(memcg))); | |
1167 | ||
1168 | /* | |
1169 | * When cgruop1 non-hierarchy mode is used, | |
1170 | * parent_mem_cgroup() does not walk all the way up to the | |
1171 | * cgroup root (root_mem_cgroup). So we have to handle | |
1172 | * dead_memcg from cgroup root separately. | |
1173 | */ | |
1174 | if (last != root_mem_cgroup) | |
1175 | __invalidate_reclaim_iterators(root_mem_cgroup, | |
1176 | dead_memcg); | |
1177 | } | |
1178 | ||
7c5f64f8 VD |
1179 | /** |
1180 | * mem_cgroup_scan_tasks - iterate over tasks of a memory cgroup hierarchy | |
1181 | * @memcg: hierarchy root | |
1182 | * @fn: function to call for each task | |
1183 | * @arg: argument passed to @fn | |
1184 | * | |
1185 | * This function iterates over tasks attached to @memcg or to any of its | |
1186 | * descendants and calls @fn for each task. If @fn returns a non-zero | |
1187 | * value, the function breaks the iteration loop and returns the value. | |
1188 | * Otherwise, it will iterate over all tasks and return 0. | |
1189 | * | |
1190 | * This function must not be called for the root memory cgroup. | |
1191 | */ | |
1192 | int mem_cgroup_scan_tasks(struct mem_cgroup *memcg, | |
1193 | int (*fn)(struct task_struct *, void *), void *arg) | |
1194 | { | |
1195 | struct mem_cgroup *iter; | |
1196 | int ret = 0; | |
1197 | ||
1198 | BUG_ON(memcg == root_mem_cgroup); | |
1199 | ||
1200 | for_each_mem_cgroup_tree(iter, memcg) { | |
1201 | struct css_task_iter it; | |
1202 | struct task_struct *task; | |
1203 | ||
f168a9a5 | 1204 | css_task_iter_start(&iter->css, CSS_TASK_ITER_PROCS, &it); |
7c5f64f8 VD |
1205 | while (!ret && (task = css_task_iter_next(&it))) |
1206 | ret = fn(task, arg); | |
1207 | css_task_iter_end(&it); | |
1208 | if (ret) { | |
1209 | mem_cgroup_iter_break(memcg, iter); | |
1210 | break; | |
1211 | } | |
1212 | } | |
1213 | return ret; | |
1214 | } | |
1215 | ||
6168d0da AS |
1216 | #ifdef CONFIG_DEBUG_VM |
1217 | void lruvec_memcg_debug(struct lruvec *lruvec, struct page *page) | |
1218 | { | |
1219 | struct mem_cgroup *memcg; | |
1220 | ||
1221 | if (mem_cgroup_disabled()) | |
1222 | return; | |
1223 | ||
1224 | memcg = page_memcg(page); | |
1225 | ||
1226 | if (!memcg) | |
1227 | VM_BUG_ON_PAGE(lruvec_memcg(lruvec) != root_mem_cgroup, page); | |
1228 | else | |
1229 | VM_BUG_ON_PAGE(lruvec_memcg(lruvec) != memcg, page); | |
1230 | } | |
1231 | #endif | |
1232 | ||
6168d0da AS |
1233 | /** |
1234 | * lock_page_lruvec - lock and return lruvec for a given page. | |
1235 | * @page: the page | |
1236 | * | |
d7e3aba5 AS |
1237 | * These functions are safe to use under any of the following conditions: |
1238 | * - page locked | |
1239 | * - PageLRU cleared | |
1240 | * - lock_page_memcg() | |
1241 | * - page->_refcount is zero | |
6168d0da AS |
1242 | */ |
1243 | struct lruvec *lock_page_lruvec(struct page *page) | |
1244 | { | |
1245 | struct lruvec *lruvec; | |
6168d0da | 1246 | |
a984226f | 1247 | lruvec = mem_cgroup_page_lruvec(page); |
6168d0da | 1248 | spin_lock(&lruvec->lru_lock); |
6168d0da AS |
1249 | |
1250 | lruvec_memcg_debug(lruvec, page); | |
1251 | ||
1252 | return lruvec; | |
1253 | } | |
1254 | ||
1255 | struct lruvec *lock_page_lruvec_irq(struct page *page) | |
1256 | { | |
1257 | struct lruvec *lruvec; | |
6168d0da | 1258 | |
a984226f | 1259 | lruvec = mem_cgroup_page_lruvec(page); |
6168d0da | 1260 | spin_lock_irq(&lruvec->lru_lock); |
6168d0da AS |
1261 | |
1262 | lruvec_memcg_debug(lruvec, page); | |
1263 | ||
1264 | return lruvec; | |
1265 | } | |
1266 | ||
1267 | struct lruvec *lock_page_lruvec_irqsave(struct page *page, unsigned long *flags) | |
1268 | { | |
1269 | struct lruvec *lruvec; | |
6168d0da | 1270 | |
a984226f | 1271 | lruvec = mem_cgroup_page_lruvec(page); |
6168d0da | 1272 | spin_lock_irqsave(&lruvec->lru_lock, *flags); |
6168d0da AS |
1273 | |
1274 | lruvec_memcg_debug(lruvec, page); | |
1275 | ||
1276 | return lruvec; | |
1277 | } | |
1278 | ||
925b7673 | 1279 | /** |
fa9add64 HD |
1280 | * mem_cgroup_update_lru_size - account for adding or removing an lru page |
1281 | * @lruvec: mem_cgroup per zone lru vector | |
1282 | * @lru: index of lru list the page is sitting on | |
b4536f0c | 1283 | * @zid: zone id of the accounted pages |
fa9add64 | 1284 | * @nr_pages: positive when adding or negative when removing |
925b7673 | 1285 | * |
ca707239 HD |
1286 | * This function must be called under lru_lock, just before a page is added |
1287 | * to or just after a page is removed from an lru list (that ordering being | |
1288 | * so as to allow it to check that lru_size 0 is consistent with list_empty). | |
3f58a829 | 1289 | */ |
fa9add64 | 1290 | void mem_cgroup_update_lru_size(struct lruvec *lruvec, enum lru_list lru, |
b4536f0c | 1291 | int zid, int nr_pages) |
3f58a829 | 1292 | { |
ef8f2327 | 1293 | struct mem_cgroup_per_node *mz; |
fa9add64 | 1294 | unsigned long *lru_size; |
ca707239 | 1295 | long size; |
3f58a829 MK |
1296 | |
1297 | if (mem_cgroup_disabled()) | |
1298 | return; | |
1299 | ||
ef8f2327 | 1300 | mz = container_of(lruvec, struct mem_cgroup_per_node, lruvec); |
b4536f0c | 1301 | lru_size = &mz->lru_zone_size[zid][lru]; |
ca707239 HD |
1302 | |
1303 | if (nr_pages < 0) | |
1304 | *lru_size += nr_pages; | |
1305 | ||
1306 | size = *lru_size; | |
b4536f0c MH |
1307 | if (WARN_ONCE(size < 0, |
1308 | "%s(%p, %d, %d): lru_size %ld\n", | |
1309 | __func__, lruvec, lru, nr_pages, size)) { | |
ca707239 HD |
1310 | VM_BUG_ON(1); |
1311 | *lru_size = 0; | |
1312 | } | |
1313 | ||
1314 | if (nr_pages > 0) | |
1315 | *lru_size += nr_pages; | |
08e552c6 | 1316 | } |
544122e5 | 1317 | |
19942822 | 1318 | /** |
9d11ea9f | 1319 | * mem_cgroup_margin - calculate chargeable space of a memory cgroup |
dad7557e | 1320 | * @memcg: the memory cgroup |
19942822 | 1321 | * |
9d11ea9f | 1322 | * Returns the maximum amount of memory @mem can be charged with, in |
7ec99d62 | 1323 | * pages. |
19942822 | 1324 | */ |
c0ff4b85 | 1325 | static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg) |
19942822 | 1326 | { |
3e32cb2e JW |
1327 | unsigned long margin = 0; |
1328 | unsigned long count; | |
1329 | unsigned long limit; | |
9d11ea9f | 1330 | |
3e32cb2e | 1331 | count = page_counter_read(&memcg->memory); |
bbec2e15 | 1332 | limit = READ_ONCE(memcg->memory.max); |
3e32cb2e JW |
1333 | if (count < limit) |
1334 | margin = limit - count; | |
1335 | ||
7941d214 | 1336 | if (do_memsw_account()) { |
3e32cb2e | 1337 | count = page_counter_read(&memcg->memsw); |
bbec2e15 | 1338 | limit = READ_ONCE(memcg->memsw.max); |
1c4448ed | 1339 | if (count < limit) |
3e32cb2e | 1340 | margin = min(margin, limit - count); |
cbedbac3 LR |
1341 | else |
1342 | margin = 0; | |
3e32cb2e JW |
1343 | } |
1344 | ||
1345 | return margin; | |
19942822 JW |
1346 | } |
1347 | ||
32047e2a | 1348 | /* |
bdcbb659 | 1349 | * A routine for checking "mem" is under move_account() or not. |
32047e2a | 1350 | * |
bdcbb659 QH |
1351 | * Checking a cgroup is mc.from or mc.to or under hierarchy of |
1352 | * moving cgroups. This is for waiting at high-memory pressure | |
1353 | * caused by "move". | |
32047e2a | 1354 | */ |
c0ff4b85 | 1355 | static bool mem_cgroup_under_move(struct mem_cgroup *memcg) |
4b534334 | 1356 | { |
2bd9bb20 KH |
1357 | struct mem_cgroup *from; |
1358 | struct mem_cgroup *to; | |
4b534334 | 1359 | bool ret = false; |
2bd9bb20 KH |
1360 | /* |
1361 | * Unlike task_move routines, we access mc.to, mc.from not under | |
1362 | * mutual exclusion by cgroup_mutex. Here, we take spinlock instead. | |
1363 | */ | |
1364 | spin_lock(&mc.lock); | |
1365 | from = mc.from; | |
1366 | to = mc.to; | |
1367 | if (!from) | |
1368 | goto unlock; | |
3e92041d | 1369 | |
2314b42d JW |
1370 | ret = mem_cgroup_is_descendant(from, memcg) || |
1371 | mem_cgroup_is_descendant(to, memcg); | |
2bd9bb20 KH |
1372 | unlock: |
1373 | spin_unlock(&mc.lock); | |
4b534334 KH |
1374 | return ret; |
1375 | } | |
1376 | ||
c0ff4b85 | 1377 | static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg) |
4b534334 KH |
1378 | { |
1379 | if (mc.moving_task && current != mc.moving_task) { | |
c0ff4b85 | 1380 | if (mem_cgroup_under_move(memcg)) { |
4b534334 KH |
1381 | DEFINE_WAIT(wait); |
1382 | prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE); | |
1383 | /* moving charge context might have finished. */ | |
1384 | if (mc.moving_task) | |
1385 | schedule(); | |
1386 | finish_wait(&mc.waitq, &wait); | |
1387 | return true; | |
1388 | } | |
1389 | } | |
1390 | return false; | |
1391 | } | |
1392 | ||
5f9a4f4a MS |
1393 | struct memory_stat { |
1394 | const char *name; | |
5f9a4f4a MS |
1395 | unsigned int idx; |
1396 | }; | |
1397 | ||
57b2847d | 1398 | static const struct memory_stat memory_stats[] = { |
fff66b79 MS |
1399 | { "anon", NR_ANON_MAPPED }, |
1400 | { "file", NR_FILE_PAGES }, | |
1401 | { "kernel_stack", NR_KERNEL_STACK_KB }, | |
1402 | { "pagetables", NR_PAGETABLE }, | |
1403 | { "percpu", MEMCG_PERCPU_B }, | |
1404 | { "sock", MEMCG_SOCK }, | |
1405 | { "shmem", NR_SHMEM }, | |
1406 | { "file_mapped", NR_FILE_MAPPED }, | |
1407 | { "file_dirty", NR_FILE_DIRTY }, | |
1408 | { "file_writeback", NR_WRITEBACK }, | |
b6038942 SB |
1409 | #ifdef CONFIG_SWAP |
1410 | { "swapcached", NR_SWAPCACHE }, | |
1411 | #endif | |
5f9a4f4a | 1412 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE |
fff66b79 MS |
1413 | { "anon_thp", NR_ANON_THPS }, |
1414 | { "file_thp", NR_FILE_THPS }, | |
1415 | { "shmem_thp", NR_SHMEM_THPS }, | |
5f9a4f4a | 1416 | #endif |
fff66b79 MS |
1417 | { "inactive_anon", NR_INACTIVE_ANON }, |
1418 | { "active_anon", NR_ACTIVE_ANON }, | |
1419 | { "inactive_file", NR_INACTIVE_FILE }, | |
1420 | { "active_file", NR_ACTIVE_FILE }, | |
1421 | { "unevictable", NR_UNEVICTABLE }, | |
1422 | { "slab_reclaimable", NR_SLAB_RECLAIMABLE_B }, | |
1423 | { "slab_unreclaimable", NR_SLAB_UNRECLAIMABLE_B }, | |
5f9a4f4a MS |
1424 | |
1425 | /* The memory events */ | |
fff66b79 MS |
1426 | { "workingset_refault_anon", WORKINGSET_REFAULT_ANON }, |
1427 | { "workingset_refault_file", WORKINGSET_REFAULT_FILE }, | |
1428 | { "workingset_activate_anon", WORKINGSET_ACTIVATE_ANON }, | |
1429 | { "workingset_activate_file", WORKINGSET_ACTIVATE_FILE }, | |
1430 | { "workingset_restore_anon", WORKINGSET_RESTORE_ANON }, | |
1431 | { "workingset_restore_file", WORKINGSET_RESTORE_FILE }, | |
1432 | { "workingset_nodereclaim", WORKINGSET_NODERECLAIM }, | |
5f9a4f4a MS |
1433 | }; |
1434 | ||
fff66b79 MS |
1435 | /* Translate stat items to the correct unit for memory.stat output */ |
1436 | static int memcg_page_state_unit(int item) | |
1437 | { | |
1438 | switch (item) { | |
1439 | case MEMCG_PERCPU_B: | |
1440 | case NR_SLAB_RECLAIMABLE_B: | |
1441 | case NR_SLAB_UNRECLAIMABLE_B: | |
1442 | case WORKINGSET_REFAULT_ANON: | |
1443 | case WORKINGSET_REFAULT_FILE: | |
1444 | case WORKINGSET_ACTIVATE_ANON: | |
1445 | case WORKINGSET_ACTIVATE_FILE: | |
1446 | case WORKINGSET_RESTORE_ANON: | |
1447 | case WORKINGSET_RESTORE_FILE: | |
1448 | case WORKINGSET_NODERECLAIM: | |
1449 | return 1; | |
1450 | case NR_KERNEL_STACK_KB: | |
1451 | return SZ_1K; | |
1452 | default: | |
1453 | return PAGE_SIZE; | |
1454 | } | |
1455 | } | |
1456 | ||
1457 | static inline unsigned long memcg_page_state_output(struct mem_cgroup *memcg, | |
1458 | int item) | |
1459 | { | |
1460 | return memcg_page_state(memcg, item) * memcg_page_state_unit(item); | |
1461 | } | |
1462 | ||
c8713d0b JW |
1463 | static char *memory_stat_format(struct mem_cgroup *memcg) |
1464 | { | |
1465 | struct seq_buf s; | |
1466 | int i; | |
71cd3113 | 1467 | |
c8713d0b JW |
1468 | seq_buf_init(&s, kmalloc(PAGE_SIZE, GFP_KERNEL), PAGE_SIZE); |
1469 | if (!s.buffer) | |
1470 | return NULL; | |
1471 | ||
1472 | /* | |
1473 | * Provide statistics on the state of the memory subsystem as | |
1474 | * well as cumulative event counters that show past behavior. | |
1475 | * | |
1476 | * This list is ordered following a combination of these gradients: | |
1477 | * 1) generic big picture -> specifics and details | |
1478 | * 2) reflecting userspace activity -> reflecting kernel heuristics | |
1479 | * | |
1480 | * Current memory state: | |
1481 | */ | |
909fc739 | 1482 | mem_cgroup_flush_stats(); |
c8713d0b | 1483 | |
5f9a4f4a MS |
1484 | for (i = 0; i < ARRAY_SIZE(memory_stats); i++) { |
1485 | u64 size; | |
c8713d0b | 1486 | |
fff66b79 | 1487 | size = memcg_page_state_output(memcg, memory_stats[i].idx); |
5f9a4f4a | 1488 | seq_buf_printf(&s, "%s %llu\n", memory_stats[i].name, size); |
c8713d0b | 1489 | |
5f9a4f4a | 1490 | if (unlikely(memory_stats[i].idx == NR_SLAB_UNRECLAIMABLE_B)) { |
fff66b79 MS |
1491 | size += memcg_page_state_output(memcg, |
1492 | NR_SLAB_RECLAIMABLE_B); | |
5f9a4f4a MS |
1493 | seq_buf_printf(&s, "slab %llu\n", size); |
1494 | } | |
1495 | } | |
c8713d0b JW |
1496 | |
1497 | /* Accumulated memory events */ | |
1498 | ||
ebc5d83d KK |
1499 | seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGFAULT), |
1500 | memcg_events(memcg, PGFAULT)); | |
1501 | seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGMAJFAULT), | |
1502 | memcg_events(memcg, PGMAJFAULT)); | |
ebc5d83d KK |
1503 | seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGREFILL), |
1504 | memcg_events(memcg, PGREFILL)); | |
c8713d0b JW |
1505 | seq_buf_printf(&s, "pgscan %lu\n", |
1506 | memcg_events(memcg, PGSCAN_KSWAPD) + | |
1507 | memcg_events(memcg, PGSCAN_DIRECT)); | |
1508 | seq_buf_printf(&s, "pgsteal %lu\n", | |
1509 | memcg_events(memcg, PGSTEAL_KSWAPD) + | |
1510 | memcg_events(memcg, PGSTEAL_DIRECT)); | |
ebc5d83d KK |
1511 | seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGACTIVATE), |
1512 | memcg_events(memcg, PGACTIVATE)); | |
1513 | seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGDEACTIVATE), | |
1514 | memcg_events(memcg, PGDEACTIVATE)); | |
1515 | seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGLAZYFREE), | |
1516 | memcg_events(memcg, PGLAZYFREE)); | |
1517 | seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGLAZYFREED), | |
1518 | memcg_events(memcg, PGLAZYFREED)); | |
c8713d0b JW |
1519 | |
1520 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE | |
ebc5d83d | 1521 | seq_buf_printf(&s, "%s %lu\n", vm_event_name(THP_FAULT_ALLOC), |
c8713d0b | 1522 | memcg_events(memcg, THP_FAULT_ALLOC)); |
ebc5d83d | 1523 | seq_buf_printf(&s, "%s %lu\n", vm_event_name(THP_COLLAPSE_ALLOC), |
c8713d0b JW |
1524 | memcg_events(memcg, THP_COLLAPSE_ALLOC)); |
1525 | #endif /* CONFIG_TRANSPARENT_HUGEPAGE */ | |
1526 | ||
1527 | /* The above should easily fit into one page */ | |
1528 | WARN_ON_ONCE(seq_buf_has_overflowed(&s)); | |
1529 | ||
1530 | return s.buffer; | |
1531 | } | |
71cd3113 | 1532 | |
58cf188e | 1533 | #define K(x) ((x) << (PAGE_SHIFT-10)) |
e222432b | 1534 | /** |
f0c867d9 | 1535 | * mem_cgroup_print_oom_context: Print OOM information relevant to |
1536 | * memory controller. | |
e222432b BS |
1537 | * @memcg: The memory cgroup that went over limit |
1538 | * @p: Task that is going to be killed | |
1539 | * | |
1540 | * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is | |
1541 | * enabled | |
1542 | */ | |
f0c867d9 | 1543 | void mem_cgroup_print_oom_context(struct mem_cgroup *memcg, struct task_struct *p) |
e222432b | 1544 | { |
e222432b BS |
1545 | rcu_read_lock(); |
1546 | ||
f0c867d9 | 1547 | if (memcg) { |
1548 | pr_cont(",oom_memcg="); | |
1549 | pr_cont_cgroup_path(memcg->css.cgroup); | |
1550 | } else | |
1551 | pr_cont(",global_oom"); | |
2415b9f5 | 1552 | if (p) { |
f0c867d9 | 1553 | pr_cont(",task_memcg="); |
2415b9f5 | 1554 | pr_cont_cgroup_path(task_cgroup(p, memory_cgrp_id)); |
2415b9f5 | 1555 | } |
e222432b | 1556 | rcu_read_unlock(); |
f0c867d9 | 1557 | } |
1558 | ||
1559 | /** | |
1560 | * mem_cgroup_print_oom_meminfo: Print OOM memory information relevant to | |
1561 | * memory controller. | |
1562 | * @memcg: The memory cgroup that went over limit | |
1563 | */ | |
1564 | void mem_cgroup_print_oom_meminfo(struct mem_cgroup *memcg) | |
1565 | { | |
c8713d0b | 1566 | char *buf; |
e222432b | 1567 | |
3e32cb2e JW |
1568 | pr_info("memory: usage %llukB, limit %llukB, failcnt %lu\n", |
1569 | K((u64)page_counter_read(&memcg->memory)), | |
15b42562 | 1570 | K((u64)READ_ONCE(memcg->memory.max)), memcg->memory.failcnt); |
c8713d0b JW |
1571 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
1572 | pr_info("swap: usage %llukB, limit %llukB, failcnt %lu\n", | |
1573 | K((u64)page_counter_read(&memcg->swap)), | |
32d087cd | 1574 | K((u64)READ_ONCE(memcg->swap.max)), memcg->swap.failcnt); |
c8713d0b JW |
1575 | else { |
1576 | pr_info("memory+swap: usage %llukB, limit %llukB, failcnt %lu\n", | |
1577 | K((u64)page_counter_read(&memcg->memsw)), | |
1578 | K((u64)memcg->memsw.max), memcg->memsw.failcnt); | |
1579 | pr_info("kmem: usage %llukB, limit %llukB, failcnt %lu\n", | |
1580 | K((u64)page_counter_read(&memcg->kmem)), | |
1581 | K((u64)memcg->kmem.max), memcg->kmem.failcnt); | |
58cf188e | 1582 | } |
c8713d0b JW |
1583 | |
1584 | pr_info("Memory cgroup stats for "); | |
1585 | pr_cont_cgroup_path(memcg->css.cgroup); | |
1586 | pr_cont(":"); | |
1587 | buf = memory_stat_format(memcg); | |
1588 | if (!buf) | |
1589 | return; | |
1590 | pr_info("%s", buf); | |
1591 | kfree(buf); | |
e222432b BS |
1592 | } |
1593 | ||
a63d83f4 DR |
1594 | /* |
1595 | * Return the memory (and swap, if configured) limit for a memcg. | |
1596 | */ | |
bbec2e15 | 1597 | unsigned long mem_cgroup_get_max(struct mem_cgroup *memcg) |
a63d83f4 | 1598 | { |
8d387a5f WL |
1599 | unsigned long max = READ_ONCE(memcg->memory.max); |
1600 | ||
1601 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) { | |
1602 | if (mem_cgroup_swappiness(memcg)) | |
1603 | max += min(READ_ONCE(memcg->swap.max), | |
1604 | (unsigned long)total_swap_pages); | |
1605 | } else { /* v1 */ | |
1606 | if (mem_cgroup_swappiness(memcg)) { | |
1607 | /* Calculate swap excess capacity from memsw limit */ | |
1608 | unsigned long swap = READ_ONCE(memcg->memsw.max) - max; | |
1609 | ||
1610 | max += min(swap, (unsigned long)total_swap_pages); | |
1611 | } | |
9a5a8f19 | 1612 | } |
bbec2e15 | 1613 | return max; |
a63d83f4 DR |
1614 | } |
1615 | ||
9783aa99 CD |
1616 | unsigned long mem_cgroup_size(struct mem_cgroup *memcg) |
1617 | { | |
1618 | return page_counter_read(&memcg->memory); | |
1619 | } | |
1620 | ||
b6e6edcf | 1621 | static bool mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask, |
19965460 | 1622 | int order) |
9cbb78bb | 1623 | { |
6e0fc46d DR |
1624 | struct oom_control oc = { |
1625 | .zonelist = NULL, | |
1626 | .nodemask = NULL, | |
2a966b77 | 1627 | .memcg = memcg, |
6e0fc46d DR |
1628 | .gfp_mask = gfp_mask, |
1629 | .order = order, | |
6e0fc46d | 1630 | }; |
1378b37d | 1631 | bool ret = true; |
9cbb78bb | 1632 | |
7775face TH |
1633 | if (mutex_lock_killable(&oom_lock)) |
1634 | return true; | |
1378b37d YS |
1635 | |
1636 | if (mem_cgroup_margin(memcg) >= (1 << order)) | |
1637 | goto unlock; | |
1638 | ||
7775face TH |
1639 | /* |
1640 | * A few threads which were not waiting at mutex_lock_killable() can | |
1641 | * fail to bail out. Therefore, check again after holding oom_lock. | |
1642 | */ | |
3a4618fc | 1643 | ret = task_is_dying() || out_of_memory(&oc); |
1378b37d YS |
1644 | |
1645 | unlock: | |
dc56401f | 1646 | mutex_unlock(&oom_lock); |
7c5f64f8 | 1647 | return ret; |
9cbb78bb DR |
1648 | } |
1649 | ||
0608f43d | 1650 | static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg, |
ef8f2327 | 1651 | pg_data_t *pgdat, |
0608f43d AM |
1652 | gfp_t gfp_mask, |
1653 | unsigned long *total_scanned) | |
1654 | { | |
1655 | struct mem_cgroup *victim = NULL; | |
1656 | int total = 0; | |
1657 | int loop = 0; | |
1658 | unsigned long excess; | |
1659 | unsigned long nr_scanned; | |
1660 | struct mem_cgroup_reclaim_cookie reclaim = { | |
ef8f2327 | 1661 | .pgdat = pgdat, |
0608f43d AM |
1662 | }; |
1663 | ||
3e32cb2e | 1664 | excess = soft_limit_excess(root_memcg); |
0608f43d AM |
1665 | |
1666 | while (1) { | |
1667 | victim = mem_cgroup_iter(root_memcg, victim, &reclaim); | |
1668 | if (!victim) { | |
1669 | loop++; | |
1670 | if (loop >= 2) { | |
1671 | /* | |
1672 | * If we have not been able to reclaim | |
1673 | * anything, it might because there are | |
1674 | * no reclaimable pages under this hierarchy | |
1675 | */ | |
1676 | if (!total) | |
1677 | break; | |
1678 | /* | |
1679 | * We want to do more targeted reclaim. | |
1680 | * excess >> 2 is not to excessive so as to | |
1681 | * reclaim too much, nor too less that we keep | |
1682 | * coming back to reclaim from this cgroup | |
1683 | */ | |
1684 | if (total >= (excess >> 2) || | |
1685 | (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS)) | |
1686 | break; | |
1687 | } | |
1688 | continue; | |
1689 | } | |
a9dd0a83 | 1690 | total += mem_cgroup_shrink_node(victim, gfp_mask, false, |
ef8f2327 | 1691 | pgdat, &nr_scanned); |
0608f43d | 1692 | *total_scanned += nr_scanned; |
3e32cb2e | 1693 | if (!soft_limit_excess(root_memcg)) |
0608f43d | 1694 | break; |
6d61ef40 | 1695 | } |
0608f43d AM |
1696 | mem_cgroup_iter_break(root_memcg, victim); |
1697 | return total; | |
6d61ef40 BS |
1698 | } |
1699 | ||
0056f4e6 JW |
1700 | #ifdef CONFIG_LOCKDEP |
1701 | static struct lockdep_map memcg_oom_lock_dep_map = { | |
1702 | .name = "memcg_oom_lock", | |
1703 | }; | |
1704 | #endif | |
1705 | ||
fb2a6fc5 JW |
1706 | static DEFINE_SPINLOCK(memcg_oom_lock); |
1707 | ||
867578cb KH |
1708 | /* |
1709 | * Check OOM-Killer is already running under our hierarchy. | |
1710 | * If someone is running, return false. | |
1711 | */ | |
fb2a6fc5 | 1712 | static bool mem_cgroup_oom_trylock(struct mem_cgroup *memcg) |
867578cb | 1713 | { |
79dfdacc | 1714 | struct mem_cgroup *iter, *failed = NULL; |
a636b327 | 1715 | |
fb2a6fc5 JW |
1716 | spin_lock(&memcg_oom_lock); |
1717 | ||
9f3a0d09 | 1718 | for_each_mem_cgroup_tree(iter, memcg) { |
23751be0 | 1719 | if (iter->oom_lock) { |
79dfdacc MH |
1720 | /* |
1721 | * this subtree of our hierarchy is already locked | |
1722 | * so we cannot give a lock. | |
1723 | */ | |
79dfdacc | 1724 | failed = iter; |
9f3a0d09 JW |
1725 | mem_cgroup_iter_break(memcg, iter); |
1726 | break; | |
23751be0 JW |
1727 | } else |
1728 | iter->oom_lock = true; | |
7d74b06f | 1729 | } |
867578cb | 1730 | |
fb2a6fc5 JW |
1731 | if (failed) { |
1732 | /* | |
1733 | * OK, we failed to lock the whole subtree so we have | |
1734 | * to clean up what we set up to the failing subtree | |
1735 | */ | |
1736 | for_each_mem_cgroup_tree(iter, memcg) { | |
1737 | if (iter == failed) { | |
1738 | mem_cgroup_iter_break(memcg, iter); | |
1739 | break; | |
1740 | } | |
1741 | iter->oom_lock = false; | |
79dfdacc | 1742 | } |
0056f4e6 JW |
1743 | } else |
1744 | mutex_acquire(&memcg_oom_lock_dep_map, 0, 1, _RET_IP_); | |
fb2a6fc5 JW |
1745 | |
1746 | spin_unlock(&memcg_oom_lock); | |
1747 | ||
1748 | return !failed; | |
a636b327 | 1749 | } |
0b7f569e | 1750 | |
fb2a6fc5 | 1751 | static void mem_cgroup_oom_unlock(struct mem_cgroup *memcg) |
0b7f569e | 1752 | { |
7d74b06f KH |
1753 | struct mem_cgroup *iter; |
1754 | ||
fb2a6fc5 | 1755 | spin_lock(&memcg_oom_lock); |
5facae4f | 1756 | mutex_release(&memcg_oom_lock_dep_map, _RET_IP_); |
c0ff4b85 | 1757 | for_each_mem_cgroup_tree(iter, memcg) |
79dfdacc | 1758 | iter->oom_lock = false; |
fb2a6fc5 | 1759 | spin_unlock(&memcg_oom_lock); |
79dfdacc MH |
1760 | } |
1761 | ||
c0ff4b85 | 1762 | static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg) |
79dfdacc MH |
1763 | { |
1764 | struct mem_cgroup *iter; | |
1765 | ||
c2b42d3c | 1766 | spin_lock(&memcg_oom_lock); |
c0ff4b85 | 1767 | for_each_mem_cgroup_tree(iter, memcg) |
c2b42d3c TH |
1768 | iter->under_oom++; |
1769 | spin_unlock(&memcg_oom_lock); | |
79dfdacc MH |
1770 | } |
1771 | ||
c0ff4b85 | 1772 | static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg) |
79dfdacc MH |
1773 | { |
1774 | struct mem_cgroup *iter; | |
1775 | ||
867578cb | 1776 | /* |
f0953a1b | 1777 | * Be careful about under_oom underflows because a child memcg |
7a52d4d8 | 1778 | * could have been added after mem_cgroup_mark_under_oom. |
867578cb | 1779 | */ |
c2b42d3c | 1780 | spin_lock(&memcg_oom_lock); |
c0ff4b85 | 1781 | for_each_mem_cgroup_tree(iter, memcg) |
c2b42d3c TH |
1782 | if (iter->under_oom > 0) |
1783 | iter->under_oom--; | |
1784 | spin_unlock(&memcg_oom_lock); | |
0b7f569e KH |
1785 | } |
1786 | ||
867578cb KH |
1787 | static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq); |
1788 | ||
dc98df5a | 1789 | struct oom_wait_info { |
d79154bb | 1790 | struct mem_cgroup *memcg; |
ac6424b9 | 1791 | wait_queue_entry_t wait; |
dc98df5a KH |
1792 | }; |
1793 | ||
ac6424b9 | 1794 | static int memcg_oom_wake_function(wait_queue_entry_t *wait, |
dc98df5a KH |
1795 | unsigned mode, int sync, void *arg) |
1796 | { | |
d79154bb HD |
1797 | struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg; |
1798 | struct mem_cgroup *oom_wait_memcg; | |
dc98df5a KH |
1799 | struct oom_wait_info *oom_wait_info; |
1800 | ||
1801 | oom_wait_info = container_of(wait, struct oom_wait_info, wait); | |
d79154bb | 1802 | oom_wait_memcg = oom_wait_info->memcg; |
dc98df5a | 1803 | |
2314b42d JW |
1804 | if (!mem_cgroup_is_descendant(wake_memcg, oom_wait_memcg) && |
1805 | !mem_cgroup_is_descendant(oom_wait_memcg, wake_memcg)) | |
dc98df5a | 1806 | return 0; |
dc98df5a KH |
1807 | return autoremove_wake_function(wait, mode, sync, arg); |
1808 | } | |
1809 | ||
c0ff4b85 | 1810 | static void memcg_oom_recover(struct mem_cgroup *memcg) |
3c11ecf4 | 1811 | { |
c2b42d3c TH |
1812 | /* |
1813 | * For the following lockless ->under_oom test, the only required | |
1814 | * guarantee is that it must see the state asserted by an OOM when | |
1815 | * this function is called as a result of userland actions | |
1816 | * triggered by the notification of the OOM. This is trivially | |
1817 | * achieved by invoking mem_cgroup_mark_under_oom() before | |
1818 | * triggering notification. | |
1819 | */ | |
1820 | if (memcg && memcg->under_oom) | |
f4b90b70 | 1821 | __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg); |
3c11ecf4 KH |
1822 | } |
1823 | ||
29ef680a MH |
1824 | enum oom_status { |
1825 | OOM_SUCCESS, | |
1826 | OOM_FAILED, | |
1827 | OOM_ASYNC, | |
1828 | OOM_SKIPPED | |
1829 | }; | |
1830 | ||
1831 | static enum oom_status mem_cgroup_oom(struct mem_cgroup *memcg, gfp_t mask, int order) | |
0b7f569e | 1832 | { |
7056d3a3 MH |
1833 | enum oom_status ret; |
1834 | bool locked; | |
1835 | ||
29ef680a MH |
1836 | if (order > PAGE_ALLOC_COSTLY_ORDER) |
1837 | return OOM_SKIPPED; | |
1838 | ||
7a1adfdd RG |
1839 | memcg_memory_event(memcg, MEMCG_OOM); |
1840 | ||
867578cb | 1841 | /* |
49426420 JW |
1842 | * We are in the middle of the charge context here, so we |
1843 | * don't want to block when potentially sitting on a callstack | |
1844 | * that holds all kinds of filesystem and mm locks. | |
1845 | * | |
29ef680a MH |
1846 | * cgroup1 allows disabling the OOM killer and waiting for outside |
1847 | * handling until the charge can succeed; remember the context and put | |
1848 | * the task to sleep at the end of the page fault when all locks are | |
1849 | * released. | |
49426420 | 1850 | * |
29ef680a MH |
1851 | * On the other hand, in-kernel OOM killer allows for an async victim |
1852 | * memory reclaim (oom_reaper) and that means that we are not solely | |
1853 | * relying on the oom victim to make a forward progress and we can | |
1854 | * invoke the oom killer here. | |
1855 | * | |
1856 | * Please note that mem_cgroup_out_of_memory might fail to find a | |
1857 | * victim and then we have to bail out from the charge path. | |
867578cb | 1858 | */ |
29ef680a MH |
1859 | if (memcg->oom_kill_disable) { |
1860 | if (!current->in_user_fault) | |
1861 | return OOM_SKIPPED; | |
1862 | css_get(&memcg->css); | |
1863 | current->memcg_in_oom = memcg; | |
1864 | current->memcg_oom_gfp_mask = mask; | |
1865 | current->memcg_oom_order = order; | |
1866 | ||
1867 | return OOM_ASYNC; | |
1868 | } | |
1869 | ||
7056d3a3 MH |
1870 | mem_cgroup_mark_under_oom(memcg); |
1871 | ||
1872 | locked = mem_cgroup_oom_trylock(memcg); | |
1873 | ||
1874 | if (locked) | |
1875 | mem_cgroup_oom_notify(memcg); | |
1876 | ||
1877 | mem_cgroup_unmark_under_oom(memcg); | |
29ef680a | 1878 | if (mem_cgroup_out_of_memory(memcg, mask, order)) |
7056d3a3 MH |
1879 | ret = OOM_SUCCESS; |
1880 | else | |
1881 | ret = OOM_FAILED; | |
1882 | ||
1883 | if (locked) | |
1884 | mem_cgroup_oom_unlock(memcg); | |
29ef680a | 1885 | |
7056d3a3 | 1886 | return ret; |
3812c8c8 JW |
1887 | } |
1888 | ||
1889 | /** | |
1890 | * mem_cgroup_oom_synchronize - complete memcg OOM handling | |
49426420 | 1891 | * @handle: actually kill/wait or just clean up the OOM state |
3812c8c8 | 1892 | * |
49426420 JW |
1893 | * This has to be called at the end of a page fault if the memcg OOM |
1894 | * handler was enabled. | |
3812c8c8 | 1895 | * |
49426420 | 1896 | * Memcg supports userspace OOM handling where failed allocations must |
3812c8c8 JW |
1897 | * sleep on a waitqueue until the userspace task resolves the |
1898 | * situation. Sleeping directly in the charge context with all kinds | |
1899 | * of locks held is not a good idea, instead we remember an OOM state | |
1900 | * in the task and mem_cgroup_oom_synchronize() has to be called at | |
49426420 | 1901 | * the end of the page fault to complete the OOM handling. |
3812c8c8 JW |
1902 | * |
1903 | * Returns %true if an ongoing memcg OOM situation was detected and | |
49426420 | 1904 | * completed, %false otherwise. |
3812c8c8 | 1905 | */ |
49426420 | 1906 | bool mem_cgroup_oom_synchronize(bool handle) |
3812c8c8 | 1907 | { |
626ebc41 | 1908 | struct mem_cgroup *memcg = current->memcg_in_oom; |
3812c8c8 | 1909 | struct oom_wait_info owait; |
49426420 | 1910 | bool locked; |
3812c8c8 JW |
1911 | |
1912 | /* OOM is global, do not handle */ | |
3812c8c8 | 1913 | if (!memcg) |
49426420 | 1914 | return false; |
3812c8c8 | 1915 | |
7c5f64f8 | 1916 | if (!handle) |
49426420 | 1917 | goto cleanup; |
3812c8c8 JW |
1918 | |
1919 | owait.memcg = memcg; | |
1920 | owait.wait.flags = 0; | |
1921 | owait.wait.func = memcg_oom_wake_function; | |
1922 | owait.wait.private = current; | |
2055da97 | 1923 | INIT_LIST_HEAD(&owait.wait.entry); |
867578cb | 1924 | |
3812c8c8 | 1925 | prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE); |
49426420 JW |
1926 | mem_cgroup_mark_under_oom(memcg); |
1927 | ||
1928 | locked = mem_cgroup_oom_trylock(memcg); | |
1929 | ||
1930 | if (locked) | |
1931 | mem_cgroup_oom_notify(memcg); | |
1932 | ||
1933 | if (locked && !memcg->oom_kill_disable) { | |
1934 | mem_cgroup_unmark_under_oom(memcg); | |
1935 | finish_wait(&memcg_oom_waitq, &owait.wait); | |
626ebc41 TH |
1936 | mem_cgroup_out_of_memory(memcg, current->memcg_oom_gfp_mask, |
1937 | current->memcg_oom_order); | |
49426420 | 1938 | } else { |
3812c8c8 | 1939 | schedule(); |
49426420 JW |
1940 | mem_cgroup_unmark_under_oom(memcg); |
1941 | finish_wait(&memcg_oom_waitq, &owait.wait); | |
1942 | } | |
1943 | ||
1944 | if (locked) { | |
fb2a6fc5 JW |
1945 | mem_cgroup_oom_unlock(memcg); |
1946 | /* | |
1947 | * There is no guarantee that an OOM-lock contender | |
1948 | * sees the wakeups triggered by the OOM kill | |
f0953a1b | 1949 | * uncharges. Wake any sleepers explicitly. |
fb2a6fc5 JW |
1950 | */ |
1951 | memcg_oom_recover(memcg); | |
1952 | } | |
49426420 | 1953 | cleanup: |
626ebc41 | 1954 | current->memcg_in_oom = NULL; |
3812c8c8 | 1955 | css_put(&memcg->css); |
867578cb | 1956 | return true; |
0b7f569e KH |
1957 | } |
1958 | ||
3d8b38eb RG |
1959 | /** |
1960 | * mem_cgroup_get_oom_group - get a memory cgroup to clean up after OOM | |
1961 | * @victim: task to be killed by the OOM killer | |
1962 | * @oom_domain: memcg in case of memcg OOM, NULL in case of system-wide OOM | |
1963 | * | |
1964 | * Returns a pointer to a memory cgroup, which has to be cleaned up | |
1965 | * by killing all belonging OOM-killable tasks. | |
1966 | * | |
1967 | * Caller has to call mem_cgroup_put() on the returned non-NULL memcg. | |
1968 | */ | |
1969 | struct mem_cgroup *mem_cgroup_get_oom_group(struct task_struct *victim, | |
1970 | struct mem_cgroup *oom_domain) | |
1971 | { | |
1972 | struct mem_cgroup *oom_group = NULL; | |
1973 | struct mem_cgroup *memcg; | |
1974 | ||
1975 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) | |
1976 | return NULL; | |
1977 | ||
1978 | if (!oom_domain) | |
1979 | oom_domain = root_mem_cgroup; | |
1980 | ||
1981 | rcu_read_lock(); | |
1982 | ||
1983 | memcg = mem_cgroup_from_task(victim); | |
1984 | if (memcg == root_mem_cgroup) | |
1985 | goto out; | |
1986 | ||
48fe267c RG |
1987 | /* |
1988 | * If the victim task has been asynchronously moved to a different | |
1989 | * memory cgroup, we might end up killing tasks outside oom_domain. | |
1990 | * In this case it's better to ignore memory.group.oom. | |
1991 | */ | |
1992 | if (unlikely(!mem_cgroup_is_descendant(memcg, oom_domain))) | |
1993 | goto out; | |
1994 | ||
3d8b38eb RG |
1995 | /* |
1996 | * Traverse the memory cgroup hierarchy from the victim task's | |
1997 | * cgroup up to the OOMing cgroup (or root) to find the | |
1998 | * highest-level memory cgroup with oom.group set. | |
1999 | */ | |
2000 | for (; memcg; memcg = parent_mem_cgroup(memcg)) { | |
2001 | if (memcg->oom_group) | |
2002 | oom_group = memcg; | |
2003 | ||
2004 | if (memcg == oom_domain) | |
2005 | break; | |
2006 | } | |
2007 | ||
2008 | if (oom_group) | |
2009 | css_get(&oom_group->css); | |
2010 | out: | |
2011 | rcu_read_unlock(); | |
2012 | ||
2013 | return oom_group; | |
2014 | } | |
2015 | ||
2016 | void mem_cgroup_print_oom_group(struct mem_cgroup *memcg) | |
2017 | { | |
2018 | pr_info("Tasks in "); | |
2019 | pr_cont_cgroup_path(memcg->css.cgroup); | |
2020 | pr_cont(" are going to be killed due to memory.oom.group set\n"); | |
2021 | } | |
2022 | ||
d7365e78 | 2023 | /** |
bcfe06bf | 2024 | * lock_page_memcg - lock a page and memcg binding |
81f8c3a4 | 2025 | * @page: the page |
32047e2a | 2026 | * |
81f8c3a4 | 2027 | * This function protects unlocked LRU pages from being moved to |
739f79fc JW |
2028 | * another cgroup. |
2029 | * | |
1c824a68 JW |
2030 | * It ensures lifetime of the locked memcg. Caller is responsible |
2031 | * for the lifetime of the page. | |
d69b042f | 2032 | */ |
1c824a68 | 2033 | void lock_page_memcg(struct page *page) |
89c06bd5 | 2034 | { |
9da7b521 | 2035 | struct page *head = compound_head(page); /* rmap on tail pages */ |
89c06bd5 | 2036 | struct mem_cgroup *memcg; |
6de22619 | 2037 | unsigned long flags; |
89c06bd5 | 2038 | |
6de22619 JW |
2039 | /* |
2040 | * The RCU lock is held throughout the transaction. The fast | |
2041 | * path can get away without acquiring the memcg->move_lock | |
2042 | * because page moving starts with an RCU grace period. | |
739f79fc | 2043 | */ |
d7365e78 JW |
2044 | rcu_read_lock(); |
2045 | ||
2046 | if (mem_cgroup_disabled()) | |
1c824a68 | 2047 | return; |
89c06bd5 | 2048 | again: |
bcfe06bf | 2049 | memcg = page_memcg(head); |
29833315 | 2050 | if (unlikely(!memcg)) |
1c824a68 | 2051 | return; |
d7365e78 | 2052 | |
20ad50d6 AS |
2053 | #ifdef CONFIG_PROVE_LOCKING |
2054 | local_irq_save(flags); | |
2055 | might_lock(&memcg->move_lock); | |
2056 | local_irq_restore(flags); | |
2057 | #endif | |
2058 | ||
bdcbb659 | 2059 | if (atomic_read(&memcg->moving_account) <= 0) |
1c824a68 | 2060 | return; |
89c06bd5 | 2061 | |
6de22619 | 2062 | spin_lock_irqsave(&memcg->move_lock, flags); |
bcfe06bf | 2063 | if (memcg != page_memcg(head)) { |
6de22619 | 2064 | spin_unlock_irqrestore(&memcg->move_lock, flags); |
89c06bd5 KH |
2065 | goto again; |
2066 | } | |
6de22619 JW |
2067 | |
2068 | /* | |
1c824a68 JW |
2069 | * When charge migration first begins, we can have multiple |
2070 | * critical sections holding the fast-path RCU lock and one | |
2071 | * holding the slowpath move_lock. Track the task who has the | |
2072 | * move_lock for unlock_page_memcg(). | |
6de22619 JW |
2073 | */ |
2074 | memcg->move_lock_task = current; | |
2075 | memcg->move_lock_flags = flags; | |
89c06bd5 | 2076 | } |
81f8c3a4 | 2077 | EXPORT_SYMBOL(lock_page_memcg); |
89c06bd5 | 2078 | |
1c824a68 | 2079 | static void __unlock_page_memcg(struct mem_cgroup *memcg) |
89c06bd5 | 2080 | { |
6de22619 JW |
2081 | if (memcg && memcg->move_lock_task == current) { |
2082 | unsigned long flags = memcg->move_lock_flags; | |
2083 | ||
2084 | memcg->move_lock_task = NULL; | |
2085 | memcg->move_lock_flags = 0; | |
2086 | ||
2087 | spin_unlock_irqrestore(&memcg->move_lock, flags); | |
2088 | } | |
89c06bd5 | 2089 | |
d7365e78 | 2090 | rcu_read_unlock(); |
89c06bd5 | 2091 | } |
739f79fc JW |
2092 | |
2093 | /** | |
bcfe06bf | 2094 | * unlock_page_memcg - unlock a page and memcg binding |
739f79fc JW |
2095 | * @page: the page |
2096 | */ | |
2097 | void unlock_page_memcg(struct page *page) | |
2098 | { | |
9da7b521 JW |
2099 | struct page *head = compound_head(page); |
2100 | ||
bcfe06bf | 2101 | __unlock_page_memcg(page_memcg(head)); |
739f79fc | 2102 | } |
81f8c3a4 | 2103 | EXPORT_SYMBOL(unlock_page_memcg); |
89c06bd5 | 2104 | |
55927114 | 2105 | struct obj_stock { |
bf4f0599 RG |
2106 | #ifdef CONFIG_MEMCG_KMEM |
2107 | struct obj_cgroup *cached_objcg; | |
68ac5b3c | 2108 | struct pglist_data *cached_pgdat; |
bf4f0599 | 2109 | unsigned int nr_bytes; |
68ac5b3c WL |
2110 | int nr_slab_reclaimable_b; |
2111 | int nr_slab_unreclaimable_b; | |
55927114 WL |
2112 | #else |
2113 | int dummy[0]; | |
bf4f0599 | 2114 | #endif |
55927114 WL |
2115 | }; |
2116 | ||
2117 | struct memcg_stock_pcp { | |
2118 | struct mem_cgroup *cached; /* this never be root cgroup */ | |
2119 | unsigned int nr_pages; | |
2120 | struct obj_stock task_obj; | |
2121 | struct obj_stock irq_obj; | |
bf4f0599 | 2122 | |
cdec2e42 | 2123 | struct work_struct work; |
26fe6168 | 2124 | unsigned long flags; |
a0db00fc | 2125 | #define FLUSHING_CACHED_CHARGE 0 |
cdec2e42 KH |
2126 | }; |
2127 | static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock); | |
9f50fad6 | 2128 | static DEFINE_MUTEX(percpu_charge_mutex); |
cdec2e42 | 2129 | |
bf4f0599 | 2130 | #ifdef CONFIG_MEMCG_KMEM |
55927114 | 2131 | static void drain_obj_stock(struct obj_stock *stock); |
bf4f0599 RG |
2132 | static bool obj_stock_flush_required(struct memcg_stock_pcp *stock, |
2133 | struct mem_cgroup *root_memcg); | |
2134 | ||
2135 | #else | |
55927114 | 2136 | static inline void drain_obj_stock(struct obj_stock *stock) |
bf4f0599 RG |
2137 | { |
2138 | } | |
2139 | static bool obj_stock_flush_required(struct memcg_stock_pcp *stock, | |
2140 | struct mem_cgroup *root_memcg) | |
2141 | { | |
2142 | return false; | |
2143 | } | |
2144 | #endif | |
2145 | ||
55927114 WL |
2146 | /* |
2147 | * Most kmem_cache_alloc() calls are from user context. The irq disable/enable | |
2148 | * sequence used in this case to access content from object stock is slow. | |
2149 | * To optimize for user context access, there are now two object stocks for | |
2150 | * task context and interrupt context access respectively. | |
2151 | * | |
2152 | * The task context object stock can be accessed by disabling preemption only | |
2153 | * which is cheap in non-preempt kernel. The interrupt context object stock | |
2154 | * can only be accessed after disabling interrupt. User context code can | |
2155 | * access interrupt object stock, but not vice versa. | |
2156 | */ | |
2157 | static inline struct obj_stock *get_obj_stock(unsigned long *pflags) | |
2158 | { | |
2159 | struct memcg_stock_pcp *stock; | |
2160 | ||
2161 | if (likely(in_task())) { | |
2162 | *pflags = 0UL; | |
2163 | preempt_disable(); | |
2164 | stock = this_cpu_ptr(&memcg_stock); | |
2165 | return &stock->task_obj; | |
2166 | } | |
2167 | ||
2168 | local_irq_save(*pflags); | |
2169 | stock = this_cpu_ptr(&memcg_stock); | |
2170 | return &stock->irq_obj; | |
2171 | } | |
2172 | ||
2173 | static inline void put_obj_stock(unsigned long flags) | |
2174 | { | |
2175 | if (likely(in_task())) | |
2176 | preempt_enable(); | |
2177 | else | |
2178 | local_irq_restore(flags); | |
2179 | } | |
2180 | ||
a0956d54 SS |
2181 | /** |
2182 | * consume_stock: Try to consume stocked charge on this cpu. | |
2183 | * @memcg: memcg to consume from. | |
2184 | * @nr_pages: how many pages to charge. | |
2185 | * | |
2186 | * The charges will only happen if @memcg matches the current cpu's memcg | |
2187 | * stock, and at least @nr_pages are available in that stock. Failure to | |
2188 | * service an allocation will refill the stock. | |
2189 | * | |
2190 | * returns true if successful, false otherwise. | |
cdec2e42 | 2191 | */ |
a0956d54 | 2192 | static bool consume_stock(struct mem_cgroup *memcg, unsigned int nr_pages) |
cdec2e42 KH |
2193 | { |
2194 | struct memcg_stock_pcp *stock; | |
db2ba40c | 2195 | unsigned long flags; |
3e32cb2e | 2196 | bool ret = false; |
cdec2e42 | 2197 | |
a983b5eb | 2198 | if (nr_pages > MEMCG_CHARGE_BATCH) |
3e32cb2e | 2199 | return ret; |
a0956d54 | 2200 | |
db2ba40c JW |
2201 | local_irq_save(flags); |
2202 | ||
2203 | stock = this_cpu_ptr(&memcg_stock); | |
3e32cb2e | 2204 | if (memcg == stock->cached && stock->nr_pages >= nr_pages) { |
a0956d54 | 2205 | stock->nr_pages -= nr_pages; |
3e32cb2e JW |
2206 | ret = true; |
2207 | } | |
db2ba40c JW |
2208 | |
2209 | local_irq_restore(flags); | |
2210 | ||
cdec2e42 KH |
2211 | return ret; |
2212 | } | |
2213 | ||
2214 | /* | |
3e32cb2e | 2215 | * Returns stocks cached in percpu and reset cached information. |
cdec2e42 KH |
2216 | */ |
2217 | static void drain_stock(struct memcg_stock_pcp *stock) | |
2218 | { | |
2219 | struct mem_cgroup *old = stock->cached; | |
2220 | ||
1a3e1f40 JW |
2221 | if (!old) |
2222 | return; | |
2223 | ||
11c9ea4e | 2224 | if (stock->nr_pages) { |
3e32cb2e | 2225 | page_counter_uncharge(&old->memory, stock->nr_pages); |
7941d214 | 2226 | if (do_memsw_account()) |
3e32cb2e | 2227 | page_counter_uncharge(&old->memsw, stock->nr_pages); |
11c9ea4e | 2228 | stock->nr_pages = 0; |
cdec2e42 | 2229 | } |
1a3e1f40 JW |
2230 | |
2231 | css_put(&old->css); | |
cdec2e42 | 2232 | stock->cached = NULL; |
cdec2e42 KH |
2233 | } |
2234 | ||
cdec2e42 KH |
2235 | static void drain_local_stock(struct work_struct *dummy) |
2236 | { | |
db2ba40c JW |
2237 | struct memcg_stock_pcp *stock; |
2238 | unsigned long flags; | |
2239 | ||
72f0184c | 2240 | /* |
5c49cf9a MH |
2241 | * The only protection from cpu hotplug (memcg_hotplug_cpu_dead) vs. |
2242 | * drain_stock races is that we always operate on local CPU stock | |
2243 | * here with IRQ disabled | |
72f0184c | 2244 | */ |
db2ba40c JW |
2245 | local_irq_save(flags); |
2246 | ||
2247 | stock = this_cpu_ptr(&memcg_stock); | |
55927114 WL |
2248 | drain_obj_stock(&stock->irq_obj); |
2249 | if (in_task()) | |
2250 | drain_obj_stock(&stock->task_obj); | |
cdec2e42 | 2251 | drain_stock(stock); |
26fe6168 | 2252 | clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags); |
db2ba40c JW |
2253 | |
2254 | local_irq_restore(flags); | |
cdec2e42 KH |
2255 | } |
2256 | ||
2257 | /* | |
3e32cb2e | 2258 | * Cache charges(val) to local per_cpu area. |
320cc51d | 2259 | * This will be consumed by consume_stock() function, later. |
cdec2e42 | 2260 | */ |
c0ff4b85 | 2261 | static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages) |
cdec2e42 | 2262 | { |
db2ba40c JW |
2263 | struct memcg_stock_pcp *stock; |
2264 | unsigned long flags; | |
2265 | ||
2266 | local_irq_save(flags); | |
cdec2e42 | 2267 | |
db2ba40c | 2268 | stock = this_cpu_ptr(&memcg_stock); |
c0ff4b85 | 2269 | if (stock->cached != memcg) { /* reset if necessary */ |
cdec2e42 | 2270 | drain_stock(stock); |
1a3e1f40 | 2271 | css_get(&memcg->css); |
c0ff4b85 | 2272 | stock->cached = memcg; |
cdec2e42 | 2273 | } |
11c9ea4e | 2274 | stock->nr_pages += nr_pages; |
db2ba40c | 2275 | |
a983b5eb | 2276 | if (stock->nr_pages > MEMCG_CHARGE_BATCH) |
475d0487 RG |
2277 | drain_stock(stock); |
2278 | ||
db2ba40c | 2279 | local_irq_restore(flags); |
cdec2e42 KH |
2280 | } |
2281 | ||
2282 | /* | |
c0ff4b85 | 2283 | * Drains all per-CPU charge caches for given root_memcg resp. subtree |
6d3d6aa2 | 2284 | * of the hierarchy under it. |
cdec2e42 | 2285 | */ |
6d3d6aa2 | 2286 | static void drain_all_stock(struct mem_cgroup *root_memcg) |
cdec2e42 | 2287 | { |
26fe6168 | 2288 | int cpu, curcpu; |
d38144b7 | 2289 | |
6d3d6aa2 JW |
2290 | /* If someone's already draining, avoid adding running more workers. */ |
2291 | if (!mutex_trylock(&percpu_charge_mutex)) | |
2292 | return; | |
72f0184c MH |
2293 | /* |
2294 | * Notify other cpus that system-wide "drain" is running | |
2295 | * We do not care about races with the cpu hotplug because cpu down | |
2296 | * as well as workers from this path always operate on the local | |
2297 | * per-cpu data. CPU up doesn't touch memcg_stock at all. | |
2298 | */ | |
5af12d0e | 2299 | curcpu = get_cpu(); |
cdec2e42 KH |
2300 | for_each_online_cpu(cpu) { |
2301 | struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu); | |
c0ff4b85 | 2302 | struct mem_cgroup *memcg; |
e1a366be | 2303 | bool flush = false; |
26fe6168 | 2304 | |
e1a366be | 2305 | rcu_read_lock(); |
c0ff4b85 | 2306 | memcg = stock->cached; |
e1a366be RG |
2307 | if (memcg && stock->nr_pages && |
2308 | mem_cgroup_is_descendant(memcg, root_memcg)) | |
2309 | flush = true; | |
27fb0956 | 2310 | else if (obj_stock_flush_required(stock, root_memcg)) |
bf4f0599 | 2311 | flush = true; |
e1a366be RG |
2312 | rcu_read_unlock(); |
2313 | ||
2314 | if (flush && | |
2315 | !test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) { | |
d1a05b69 MH |
2316 | if (cpu == curcpu) |
2317 | drain_local_stock(&stock->work); | |
2318 | else | |
2319 | schedule_work_on(cpu, &stock->work); | |
2320 | } | |
cdec2e42 | 2321 | } |
5af12d0e | 2322 | put_cpu(); |
9f50fad6 | 2323 | mutex_unlock(&percpu_charge_mutex); |
cdec2e42 KH |
2324 | } |
2325 | ||
2cd21c89 JW |
2326 | static int memcg_hotplug_cpu_dead(unsigned int cpu) |
2327 | { | |
2328 | struct memcg_stock_pcp *stock; | |
a3d4c05a | 2329 | |
2cd21c89 JW |
2330 | stock = &per_cpu(memcg_stock, cpu); |
2331 | drain_stock(stock); | |
a3d4c05a | 2332 | |
308167fc | 2333 | return 0; |
cdec2e42 KH |
2334 | } |
2335 | ||
b3ff9291 CD |
2336 | static unsigned long reclaim_high(struct mem_cgroup *memcg, |
2337 | unsigned int nr_pages, | |
2338 | gfp_t gfp_mask) | |
f7e1cb6e | 2339 | { |
b3ff9291 CD |
2340 | unsigned long nr_reclaimed = 0; |
2341 | ||
f7e1cb6e | 2342 | do { |
e22c6ed9 JW |
2343 | unsigned long pflags; |
2344 | ||
d1663a90 JK |
2345 | if (page_counter_read(&memcg->memory) <= |
2346 | READ_ONCE(memcg->memory.high)) | |
f7e1cb6e | 2347 | continue; |
e22c6ed9 | 2348 | |
e27be240 | 2349 | memcg_memory_event(memcg, MEMCG_HIGH); |
e22c6ed9 JW |
2350 | |
2351 | psi_memstall_enter(&pflags); | |
b3ff9291 CD |
2352 | nr_reclaimed += try_to_free_mem_cgroup_pages(memcg, nr_pages, |
2353 | gfp_mask, true); | |
e22c6ed9 | 2354 | psi_memstall_leave(&pflags); |
4bf17307 CD |
2355 | } while ((memcg = parent_mem_cgroup(memcg)) && |
2356 | !mem_cgroup_is_root(memcg)); | |
b3ff9291 CD |
2357 | |
2358 | return nr_reclaimed; | |
f7e1cb6e JW |
2359 | } |
2360 | ||
2361 | static void high_work_func(struct work_struct *work) | |
2362 | { | |
2363 | struct mem_cgroup *memcg; | |
2364 | ||
2365 | memcg = container_of(work, struct mem_cgroup, high_work); | |
a983b5eb | 2366 | reclaim_high(memcg, MEMCG_CHARGE_BATCH, GFP_KERNEL); |
f7e1cb6e JW |
2367 | } |
2368 | ||
0e4b01df CD |
2369 | /* |
2370 | * Clamp the maximum sleep time per allocation batch to 2 seconds. This is | |
2371 | * enough to still cause a significant slowdown in most cases, while still | |
2372 | * allowing diagnostics and tracing to proceed without becoming stuck. | |
2373 | */ | |
2374 | #define MEMCG_MAX_HIGH_DELAY_JIFFIES (2UL*HZ) | |
2375 | ||
2376 | /* | |
2377 | * When calculating the delay, we use these either side of the exponentiation to | |
2378 | * maintain precision and scale to a reasonable number of jiffies (see the table | |
2379 | * below. | |
2380 | * | |
2381 | * - MEMCG_DELAY_PRECISION_SHIFT: Extra precision bits while translating the | |
2382 | * overage ratio to a delay. | |
ac5ddd0f | 2383 | * - MEMCG_DELAY_SCALING_SHIFT: The number of bits to scale down the |
0e4b01df CD |
2384 | * proposed penalty in order to reduce to a reasonable number of jiffies, and |
2385 | * to produce a reasonable delay curve. | |
2386 | * | |
2387 | * MEMCG_DELAY_SCALING_SHIFT just happens to be a number that produces a | |
2388 | * reasonable delay curve compared to precision-adjusted overage, not | |
2389 | * penalising heavily at first, but still making sure that growth beyond the | |
2390 | * limit penalises misbehaviour cgroups by slowing them down exponentially. For | |
2391 | * example, with a high of 100 megabytes: | |
2392 | * | |
2393 | * +-------+------------------------+ | |
2394 | * | usage | time to allocate in ms | | |
2395 | * +-------+------------------------+ | |
2396 | * | 100M | 0 | | |
2397 | * | 101M | 6 | | |
2398 | * | 102M | 25 | | |
2399 | * | 103M | 57 | | |
2400 | * | 104M | 102 | | |
2401 | * | 105M | 159 | | |
2402 | * | 106M | 230 | | |
2403 | * | 107M | 313 | | |
2404 | * | 108M | 409 | | |
2405 | * | 109M | 518 | | |
2406 | * | 110M | 639 | | |
2407 | * | 111M | 774 | | |
2408 | * | 112M | 921 | | |
2409 | * | 113M | 1081 | | |
2410 | * | 114M | 1254 | | |
2411 | * | 115M | 1439 | | |
2412 | * | 116M | 1638 | | |
2413 | * | 117M | 1849 | | |
2414 | * | 118M | 2000 | | |
2415 | * | 119M | 2000 | | |
2416 | * | 120M | 2000 | | |
2417 | * +-------+------------------------+ | |
2418 | */ | |
2419 | #define MEMCG_DELAY_PRECISION_SHIFT 20 | |
2420 | #define MEMCG_DELAY_SCALING_SHIFT 14 | |
2421 | ||
8a5dbc65 | 2422 | static u64 calculate_overage(unsigned long usage, unsigned long high) |
b23afb93 | 2423 | { |
8a5dbc65 | 2424 | u64 overage; |
b23afb93 | 2425 | |
8a5dbc65 JK |
2426 | if (usage <= high) |
2427 | return 0; | |
e26733e0 | 2428 | |
8a5dbc65 JK |
2429 | /* |
2430 | * Prevent division by 0 in overage calculation by acting as if | |
2431 | * it was a threshold of 1 page | |
2432 | */ | |
2433 | high = max(high, 1UL); | |
9b8b1754 | 2434 | |
8a5dbc65 JK |
2435 | overage = usage - high; |
2436 | overage <<= MEMCG_DELAY_PRECISION_SHIFT; | |
2437 | return div64_u64(overage, high); | |
2438 | } | |
e26733e0 | 2439 | |
8a5dbc65 JK |
2440 | static u64 mem_find_max_overage(struct mem_cgroup *memcg) |
2441 | { | |
2442 | u64 overage, max_overage = 0; | |
e26733e0 | 2443 | |
8a5dbc65 JK |
2444 | do { |
2445 | overage = calculate_overage(page_counter_read(&memcg->memory), | |
d1663a90 | 2446 | READ_ONCE(memcg->memory.high)); |
8a5dbc65 | 2447 | max_overage = max(overage, max_overage); |
e26733e0 CD |
2448 | } while ((memcg = parent_mem_cgroup(memcg)) && |
2449 | !mem_cgroup_is_root(memcg)); | |
2450 | ||
8a5dbc65 JK |
2451 | return max_overage; |
2452 | } | |
2453 | ||
4b82ab4f JK |
2454 | static u64 swap_find_max_overage(struct mem_cgroup *memcg) |
2455 | { | |
2456 | u64 overage, max_overage = 0; | |
2457 | ||
2458 | do { | |
2459 | overage = calculate_overage(page_counter_read(&memcg->swap), | |
2460 | READ_ONCE(memcg->swap.high)); | |
2461 | if (overage) | |
2462 | memcg_memory_event(memcg, MEMCG_SWAP_HIGH); | |
2463 | max_overage = max(overage, max_overage); | |
2464 | } while ((memcg = parent_mem_cgroup(memcg)) && | |
2465 | !mem_cgroup_is_root(memcg)); | |
2466 | ||
2467 | return max_overage; | |
2468 | } | |
2469 | ||
8a5dbc65 JK |
2470 | /* |
2471 | * Get the number of jiffies that we should penalise a mischievous cgroup which | |
2472 | * is exceeding its memory.high by checking both it and its ancestors. | |
2473 | */ | |
2474 | static unsigned long calculate_high_delay(struct mem_cgroup *memcg, | |
2475 | unsigned int nr_pages, | |
2476 | u64 max_overage) | |
2477 | { | |
2478 | unsigned long penalty_jiffies; | |
2479 | ||
e26733e0 CD |
2480 | if (!max_overage) |
2481 | return 0; | |
0e4b01df CD |
2482 | |
2483 | /* | |
0e4b01df CD |
2484 | * We use overage compared to memory.high to calculate the number of |
2485 | * jiffies to sleep (penalty_jiffies). Ideally this value should be | |
2486 | * fairly lenient on small overages, and increasingly harsh when the | |
2487 | * memcg in question makes it clear that it has no intention of stopping | |
2488 | * its crazy behaviour, so we exponentially increase the delay based on | |
2489 | * overage amount. | |
2490 | */ | |
e26733e0 CD |
2491 | penalty_jiffies = max_overage * max_overage * HZ; |
2492 | penalty_jiffies >>= MEMCG_DELAY_PRECISION_SHIFT; | |
2493 | penalty_jiffies >>= MEMCG_DELAY_SCALING_SHIFT; | |
0e4b01df CD |
2494 | |
2495 | /* | |
2496 | * Factor in the task's own contribution to the overage, such that four | |
2497 | * N-sized allocations are throttled approximately the same as one | |
2498 | * 4N-sized allocation. | |
2499 | * | |
2500 | * MEMCG_CHARGE_BATCH pages is nominal, so work out how much smaller or | |
2501 | * larger the current charge patch is than that. | |
2502 | */ | |
ff144e69 | 2503 | return penalty_jiffies * nr_pages / MEMCG_CHARGE_BATCH; |
e26733e0 CD |
2504 | } |
2505 | ||
2506 | /* | |
2507 | * Scheduled by try_charge() to be executed from the userland return path | |
2508 | * and reclaims memory over the high limit. | |
2509 | */ | |
2510 | void mem_cgroup_handle_over_high(void) | |
2511 | { | |
2512 | unsigned long penalty_jiffies; | |
2513 | unsigned long pflags; | |
b3ff9291 | 2514 | unsigned long nr_reclaimed; |
e26733e0 | 2515 | unsigned int nr_pages = current->memcg_nr_pages_over_high; |
d977aa93 | 2516 | int nr_retries = MAX_RECLAIM_RETRIES; |
e26733e0 | 2517 | struct mem_cgroup *memcg; |
b3ff9291 | 2518 | bool in_retry = false; |
e26733e0 CD |
2519 | |
2520 | if (likely(!nr_pages)) | |
2521 | return; | |
2522 | ||
2523 | memcg = get_mem_cgroup_from_mm(current->mm); | |
e26733e0 CD |
2524 | current->memcg_nr_pages_over_high = 0; |
2525 | ||
b3ff9291 CD |
2526 | retry_reclaim: |
2527 | /* | |
2528 | * The allocating task should reclaim at least the batch size, but for | |
2529 | * subsequent retries we only want to do what's necessary to prevent oom | |
2530 | * or breaching resource isolation. | |
2531 | * | |
2532 | * This is distinct from memory.max or page allocator behaviour because | |
2533 | * memory.high is currently batched, whereas memory.max and the page | |
2534 | * allocator run every time an allocation is made. | |
2535 | */ | |
2536 | nr_reclaimed = reclaim_high(memcg, | |
2537 | in_retry ? SWAP_CLUSTER_MAX : nr_pages, | |
2538 | GFP_KERNEL); | |
2539 | ||
e26733e0 CD |
2540 | /* |
2541 | * memory.high is breached and reclaim is unable to keep up. Throttle | |
2542 | * allocators proactively to slow down excessive growth. | |
2543 | */ | |
8a5dbc65 JK |
2544 | penalty_jiffies = calculate_high_delay(memcg, nr_pages, |
2545 | mem_find_max_overage(memcg)); | |
0e4b01df | 2546 | |
4b82ab4f JK |
2547 | penalty_jiffies += calculate_high_delay(memcg, nr_pages, |
2548 | swap_find_max_overage(memcg)); | |
2549 | ||
ff144e69 JK |
2550 | /* |
2551 | * Clamp the max delay per usermode return so as to still keep the | |
2552 | * application moving forwards and also permit diagnostics, albeit | |
2553 | * extremely slowly. | |
2554 | */ | |
2555 | penalty_jiffies = min(penalty_jiffies, MEMCG_MAX_HIGH_DELAY_JIFFIES); | |
2556 | ||
0e4b01df CD |
2557 | /* |
2558 | * Don't sleep if the amount of jiffies this memcg owes us is so low | |
2559 | * that it's not even worth doing, in an attempt to be nice to those who | |
2560 | * go only a small amount over their memory.high value and maybe haven't | |
2561 | * been aggressively reclaimed enough yet. | |
2562 | */ | |
2563 | if (penalty_jiffies <= HZ / 100) | |
2564 | goto out; | |
2565 | ||
b3ff9291 CD |
2566 | /* |
2567 | * If reclaim is making forward progress but we're still over | |
2568 | * memory.high, we want to encourage that rather than doing allocator | |
2569 | * throttling. | |
2570 | */ | |
2571 | if (nr_reclaimed || nr_retries--) { | |
2572 | in_retry = true; | |
2573 | goto retry_reclaim; | |
2574 | } | |
2575 | ||
0e4b01df CD |
2576 | /* |
2577 | * If we exit early, we're guaranteed to die (since | |
2578 | * schedule_timeout_killable sets TASK_KILLABLE). This means we don't | |
2579 | * need to account for any ill-begotten jiffies to pay them off later. | |
2580 | */ | |
2581 | psi_memstall_enter(&pflags); | |
2582 | schedule_timeout_killable(penalty_jiffies); | |
2583 | psi_memstall_leave(&pflags); | |
2584 | ||
2585 | out: | |
2586 | css_put(&memcg->css); | |
b23afb93 TH |
2587 | } |
2588 | ||
c5c8b16b MS |
2589 | static int try_charge_memcg(struct mem_cgroup *memcg, gfp_t gfp_mask, |
2590 | unsigned int nr_pages) | |
8a9f3ccd | 2591 | { |
a983b5eb | 2592 | unsigned int batch = max(MEMCG_CHARGE_BATCH, nr_pages); |
d977aa93 | 2593 | int nr_retries = MAX_RECLAIM_RETRIES; |
6539cc05 | 2594 | struct mem_cgroup *mem_over_limit; |
3e32cb2e | 2595 | struct page_counter *counter; |
e22c6ed9 | 2596 | enum oom_status oom_status; |
6539cc05 | 2597 | unsigned long nr_reclaimed; |
3a4618fc | 2598 | bool passed_oom = false; |
b70a2a21 JW |
2599 | bool may_swap = true; |
2600 | bool drained = false; | |
e22c6ed9 | 2601 | unsigned long pflags; |
a636b327 | 2602 | |
6539cc05 | 2603 | retry: |
b6b6cc72 | 2604 | if (consume_stock(memcg, nr_pages)) |
10d53c74 | 2605 | return 0; |
8a9f3ccd | 2606 | |
7941d214 | 2607 | if (!do_memsw_account() || |
6071ca52 JW |
2608 | page_counter_try_charge(&memcg->memsw, batch, &counter)) { |
2609 | if (page_counter_try_charge(&memcg->memory, batch, &counter)) | |
6539cc05 | 2610 | goto done_restock; |
7941d214 | 2611 | if (do_memsw_account()) |
3e32cb2e JW |
2612 | page_counter_uncharge(&memcg->memsw, batch); |
2613 | mem_over_limit = mem_cgroup_from_counter(counter, memory); | |
3fbe7244 | 2614 | } else { |
3e32cb2e | 2615 | mem_over_limit = mem_cgroup_from_counter(counter, memsw); |
b70a2a21 | 2616 | may_swap = false; |
3fbe7244 | 2617 | } |
7a81b88c | 2618 | |
6539cc05 JW |
2619 | if (batch > nr_pages) { |
2620 | batch = nr_pages; | |
2621 | goto retry; | |
2622 | } | |
6d61ef40 | 2623 | |
869712fd JW |
2624 | /* |
2625 | * Memcg doesn't have a dedicated reserve for atomic | |
2626 | * allocations. But like the global atomic pool, we need to | |
2627 | * put the burden of reclaim on regular allocation requests | |
2628 | * and let these go through as privileged allocations. | |
2629 | */ | |
2630 | if (gfp_mask & __GFP_ATOMIC) | |
2631 | goto force; | |
2632 | ||
89a28483 JW |
2633 | /* |
2634 | * Prevent unbounded recursion when reclaim operations need to | |
2635 | * allocate memory. This might exceed the limits temporarily, | |
2636 | * but we prefer facilitating memory reclaim and getting back | |
2637 | * under the limit over triggering OOM kills in these cases. | |
2638 | */ | |
2639 | if (unlikely(current->flags & PF_MEMALLOC)) | |
2640 | goto force; | |
2641 | ||
06b078fc JW |
2642 | if (unlikely(task_in_memcg_oom(current))) |
2643 | goto nomem; | |
2644 | ||
d0164adc | 2645 | if (!gfpflags_allow_blocking(gfp_mask)) |
6539cc05 | 2646 | goto nomem; |
4b534334 | 2647 | |
e27be240 | 2648 | memcg_memory_event(mem_over_limit, MEMCG_MAX); |
241994ed | 2649 | |
e22c6ed9 | 2650 | psi_memstall_enter(&pflags); |
b70a2a21 JW |
2651 | nr_reclaimed = try_to_free_mem_cgroup_pages(mem_over_limit, nr_pages, |
2652 | gfp_mask, may_swap); | |
e22c6ed9 | 2653 | psi_memstall_leave(&pflags); |
6539cc05 | 2654 | |
61e02c74 | 2655 | if (mem_cgroup_margin(mem_over_limit) >= nr_pages) |
6539cc05 | 2656 | goto retry; |
28c34c29 | 2657 | |
b70a2a21 | 2658 | if (!drained) { |
6d3d6aa2 | 2659 | drain_all_stock(mem_over_limit); |
b70a2a21 JW |
2660 | drained = true; |
2661 | goto retry; | |
2662 | } | |
2663 | ||
28c34c29 JW |
2664 | if (gfp_mask & __GFP_NORETRY) |
2665 | goto nomem; | |
6539cc05 JW |
2666 | /* |
2667 | * Even though the limit is exceeded at this point, reclaim | |
2668 | * may have been able to free some pages. Retry the charge | |
2669 | * before killing the task. | |
2670 | * | |
2671 | * Only for regular pages, though: huge pages are rather | |
2672 | * unlikely to succeed so close to the limit, and we fall back | |
2673 | * to regular pages anyway in case of failure. | |
2674 | */ | |
61e02c74 | 2675 | if (nr_reclaimed && nr_pages <= (1 << PAGE_ALLOC_COSTLY_ORDER)) |
6539cc05 JW |
2676 | goto retry; |
2677 | /* | |
2678 | * At task move, charge accounts can be doubly counted. So, it's | |
2679 | * better to wait until the end of task_move if something is going on. | |
2680 | */ | |
2681 | if (mem_cgroup_wait_acct_move(mem_over_limit)) | |
2682 | goto retry; | |
2683 | ||
9b130619 JW |
2684 | if (nr_retries--) |
2685 | goto retry; | |
2686 | ||
38d38493 | 2687 | if (gfp_mask & __GFP_RETRY_MAYFAIL) |
29ef680a MH |
2688 | goto nomem; |
2689 | ||
3a4618fc VA |
2690 | /* Avoid endless loop for tasks bypassed by the oom killer */ |
2691 | if (passed_oom && task_is_dying()) | |
2692 | goto nomem; | |
6539cc05 | 2693 | |
29ef680a MH |
2694 | /* |
2695 | * keep retrying as long as the memcg oom killer is able to make | |
2696 | * a forward progress or bypass the charge if the oom killer | |
2697 | * couldn't make any progress. | |
2698 | */ | |
2699 | oom_status = mem_cgroup_oom(mem_over_limit, gfp_mask, | |
3608de07 | 2700 | get_order(nr_pages * PAGE_SIZE)); |
3a4618fc VA |
2701 | if (oom_status == OOM_SUCCESS) { |
2702 | passed_oom = true; | |
d977aa93 | 2703 | nr_retries = MAX_RECLAIM_RETRIES; |
29ef680a | 2704 | goto retry; |
29ef680a | 2705 | } |
7a81b88c | 2706 | nomem: |
6d1fdc48 | 2707 | if (!(gfp_mask & __GFP_NOFAIL)) |
3168ecbe | 2708 | return -ENOMEM; |
10d53c74 TH |
2709 | force: |
2710 | /* | |
2711 | * The allocation either can't fail or will lead to more memory | |
2712 | * being freed very soon. Allow memory usage go over the limit | |
2713 | * temporarily by force charging it. | |
2714 | */ | |
2715 | page_counter_charge(&memcg->memory, nr_pages); | |
7941d214 | 2716 | if (do_memsw_account()) |
10d53c74 | 2717 | page_counter_charge(&memcg->memsw, nr_pages); |
10d53c74 TH |
2718 | |
2719 | return 0; | |
6539cc05 JW |
2720 | |
2721 | done_restock: | |
2722 | if (batch > nr_pages) | |
2723 | refill_stock(memcg, batch - nr_pages); | |
b23afb93 | 2724 | |
241994ed | 2725 | /* |
b23afb93 TH |
2726 | * If the hierarchy is above the normal consumption range, schedule |
2727 | * reclaim on returning to userland. We can perform reclaim here | |
71baba4b | 2728 | * if __GFP_RECLAIM but let's always punt for simplicity and so that |
b23afb93 TH |
2729 | * GFP_KERNEL can consistently be used during reclaim. @memcg is |
2730 | * not recorded as it most likely matches current's and won't | |
2731 | * change in the meantime. As high limit is checked again before | |
2732 | * reclaim, the cost of mismatch is negligible. | |
241994ed JW |
2733 | */ |
2734 | do { | |
4b82ab4f JK |
2735 | bool mem_high, swap_high; |
2736 | ||
2737 | mem_high = page_counter_read(&memcg->memory) > | |
2738 | READ_ONCE(memcg->memory.high); | |
2739 | swap_high = page_counter_read(&memcg->swap) > | |
2740 | READ_ONCE(memcg->swap.high); | |
2741 | ||
2742 | /* Don't bother a random interrupted task */ | |
2743 | if (in_interrupt()) { | |
2744 | if (mem_high) { | |
f7e1cb6e JW |
2745 | schedule_work(&memcg->high_work); |
2746 | break; | |
2747 | } | |
4b82ab4f JK |
2748 | continue; |
2749 | } | |
2750 | ||
2751 | if (mem_high || swap_high) { | |
2752 | /* | |
2753 | * The allocating tasks in this cgroup will need to do | |
2754 | * reclaim or be throttled to prevent further growth | |
2755 | * of the memory or swap footprints. | |
2756 | * | |
2757 | * Target some best-effort fairness between the tasks, | |
2758 | * and distribute reclaim work and delay penalties | |
2759 | * based on how much each task is actually allocating. | |
2760 | */ | |
9516a18a | 2761 | current->memcg_nr_pages_over_high += batch; |
b23afb93 TH |
2762 | set_notify_resume(current); |
2763 | break; | |
2764 | } | |
241994ed | 2765 | } while ((memcg = parent_mem_cgroup(memcg))); |
10d53c74 TH |
2766 | |
2767 | return 0; | |
7a81b88c | 2768 | } |
8a9f3ccd | 2769 | |
c5c8b16b MS |
2770 | static inline int try_charge(struct mem_cgroup *memcg, gfp_t gfp_mask, |
2771 | unsigned int nr_pages) | |
2772 | { | |
2773 | if (mem_cgroup_is_root(memcg)) | |
2774 | return 0; | |
2775 | ||
2776 | return try_charge_memcg(memcg, gfp_mask, nr_pages); | |
2777 | } | |
2778 | ||
f0e45fb4 | 2779 | #if defined(CONFIG_MEMCG_KMEM) || defined(CONFIG_MMU) |
00501b53 | 2780 | static void cancel_charge(struct mem_cgroup *memcg, unsigned int nr_pages) |
a3032a2c | 2781 | { |
ce00a967 JW |
2782 | if (mem_cgroup_is_root(memcg)) |
2783 | return; | |
2784 | ||
3e32cb2e | 2785 | page_counter_uncharge(&memcg->memory, nr_pages); |
7941d214 | 2786 | if (do_memsw_account()) |
3e32cb2e | 2787 | page_counter_uncharge(&memcg->memsw, nr_pages); |
d01dd17f | 2788 | } |
f0e45fb4 | 2789 | #endif |
d01dd17f | 2790 | |
d9eb1ea2 | 2791 | static void commit_charge(struct page *page, struct mem_cgroup *memcg) |
0a31bc97 | 2792 | { |
bcfe06bf | 2793 | VM_BUG_ON_PAGE(page_memcg(page), page); |
0a31bc97 | 2794 | /* |
a5eb011a | 2795 | * Any of the following ensures page's memcg stability: |
0a31bc97 | 2796 | * |
a0b5b414 JW |
2797 | * - the page lock |
2798 | * - LRU isolation | |
2799 | * - lock_page_memcg() | |
2800 | * - exclusive reference | |
0a31bc97 | 2801 | */ |
bcfe06bf | 2802 | page->memcg_data = (unsigned long)memcg; |
7a81b88c | 2803 | } |
66e1707b | 2804 | |
e74d2259 MS |
2805 | static struct mem_cgroup *get_mem_cgroup_from_objcg(struct obj_cgroup *objcg) |
2806 | { | |
2807 | struct mem_cgroup *memcg; | |
2808 | ||
2809 | rcu_read_lock(); | |
2810 | retry: | |
2811 | memcg = obj_cgroup_memcg(objcg); | |
2812 | if (unlikely(!css_tryget(&memcg->css))) | |
2813 | goto retry; | |
2814 | rcu_read_unlock(); | |
2815 | ||
2816 | return memcg; | |
2817 | } | |
2818 | ||
84c07d11 | 2819 | #ifdef CONFIG_MEMCG_KMEM |
41eb5df1 WL |
2820 | /* |
2821 | * The allocated objcg pointers array is not accounted directly. | |
2822 | * Moreover, it should not come from DMA buffer and is not readily | |
2823 | * reclaimable. So those GFP bits should be masked off. | |
2824 | */ | |
2825 | #define OBJCGS_CLEAR_MASK (__GFP_DMA | __GFP_RECLAIMABLE | __GFP_ACCOUNT) | |
2826 | ||
10befea9 | 2827 | int memcg_alloc_page_obj_cgroups(struct page *page, struct kmem_cache *s, |
2e9bd483 | 2828 | gfp_t gfp, bool new_page) |
10befea9 RG |
2829 | { |
2830 | unsigned int objects = objs_per_slab_page(s, page); | |
2e9bd483 | 2831 | unsigned long memcg_data; |
10befea9 RG |
2832 | void *vec; |
2833 | ||
41eb5df1 | 2834 | gfp &= ~OBJCGS_CLEAR_MASK; |
10befea9 RG |
2835 | vec = kcalloc_node(objects, sizeof(struct obj_cgroup *), gfp, |
2836 | page_to_nid(page)); | |
2837 | if (!vec) | |
2838 | return -ENOMEM; | |
2839 | ||
2e9bd483 RG |
2840 | memcg_data = (unsigned long) vec | MEMCG_DATA_OBJCGS; |
2841 | if (new_page) { | |
2842 | /* | |
2843 | * If the slab page is brand new and nobody can yet access | |
2844 | * it's memcg_data, no synchronization is required and | |
2845 | * memcg_data can be simply assigned. | |
2846 | */ | |
2847 | page->memcg_data = memcg_data; | |
2848 | } else if (cmpxchg(&page->memcg_data, 0, memcg_data)) { | |
2849 | /* | |
2850 | * If the slab page is already in use, somebody can allocate | |
2851 | * and assign obj_cgroups in parallel. In this case the existing | |
2852 | * objcg vector should be reused. | |
2853 | */ | |
10befea9 | 2854 | kfree(vec); |
2e9bd483 RG |
2855 | return 0; |
2856 | } | |
10befea9 | 2857 | |
2e9bd483 | 2858 | kmemleak_not_leak(vec); |
10befea9 RG |
2859 | return 0; |
2860 | } | |
2861 | ||
8380ce47 RG |
2862 | /* |
2863 | * Returns a pointer to the memory cgroup to which the kernel object is charged. | |
2864 | * | |
bcfe06bf RG |
2865 | * A passed kernel object can be a slab object or a generic kernel page, so |
2866 | * different mechanisms for getting the memory cgroup pointer should be used. | |
2867 | * In certain cases (e.g. kernel stacks or large kmallocs with SLUB) the caller | |
2868 | * can not know for sure how the kernel object is implemented. | |
2869 | * mem_cgroup_from_obj() can be safely used in such cases. | |
2870 | * | |
8380ce47 RG |
2871 | * The caller must ensure the memcg lifetime, e.g. by taking rcu_read_lock(), |
2872 | * cgroup_mutex, etc. | |
2873 | */ | |
2874 | struct mem_cgroup *mem_cgroup_from_obj(void *p) | |
2875 | { | |
2876 | struct page *page; | |
2877 | ||
2878 | if (mem_cgroup_disabled()) | |
2879 | return NULL; | |
2880 | ||
2881 | page = virt_to_head_page(p); | |
2882 | ||
2883 | /* | |
9855609b RG |
2884 | * Slab objects are accounted individually, not per-page. |
2885 | * Memcg membership data for each individual object is saved in | |
2886 | * the page->obj_cgroups. | |
8380ce47 | 2887 | */ |
270c6a71 | 2888 | if (page_objcgs_check(page)) { |
9855609b RG |
2889 | struct obj_cgroup *objcg; |
2890 | unsigned int off; | |
2891 | ||
2892 | off = obj_to_index(page->slab_cache, page, p); | |
270c6a71 | 2893 | objcg = page_objcgs(page)[off]; |
10befea9 RG |
2894 | if (objcg) |
2895 | return obj_cgroup_memcg(objcg); | |
2896 | ||
2897 | return NULL; | |
9855609b | 2898 | } |
8380ce47 | 2899 | |
bcfe06bf RG |
2900 | /* |
2901 | * page_memcg_check() is used here, because page_has_obj_cgroups() | |
2902 | * check above could fail because the object cgroups vector wasn't set | |
2903 | * at that moment, but it can be set concurrently. | |
2904 | * page_memcg_check(page) will guarantee that a proper memory | |
2905 | * cgroup pointer or NULL will be returned. | |
2906 | */ | |
2907 | return page_memcg_check(page); | |
8380ce47 RG |
2908 | } |
2909 | ||
bf4f0599 RG |
2910 | __always_inline struct obj_cgroup *get_obj_cgroup_from_current(void) |
2911 | { | |
2912 | struct obj_cgroup *objcg = NULL; | |
2913 | struct mem_cgroup *memcg; | |
2914 | ||
279c3393 RG |
2915 | if (memcg_kmem_bypass()) |
2916 | return NULL; | |
2917 | ||
bf4f0599 | 2918 | rcu_read_lock(); |
37d5985c RG |
2919 | if (unlikely(active_memcg())) |
2920 | memcg = active_memcg(); | |
bf4f0599 RG |
2921 | else |
2922 | memcg = mem_cgroup_from_task(current); | |
2923 | ||
2924 | for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg)) { | |
2925 | objcg = rcu_dereference(memcg->objcg); | |
2926 | if (objcg && obj_cgroup_tryget(objcg)) | |
2927 | break; | |
2f7659a3 | 2928 | objcg = NULL; |
bf4f0599 RG |
2929 | } |
2930 | rcu_read_unlock(); | |
2931 | ||
2932 | return objcg; | |
2933 | } | |
2934 | ||
f3bb3043 | 2935 | static int memcg_alloc_cache_id(void) |
55007d84 | 2936 | { |
f3bb3043 VD |
2937 | int id, size; |
2938 | int err; | |
2939 | ||
dbcf73e2 | 2940 | id = ida_simple_get(&memcg_cache_ida, |
f3bb3043 VD |
2941 | 0, MEMCG_CACHES_MAX_SIZE, GFP_KERNEL); |
2942 | if (id < 0) | |
2943 | return id; | |
55007d84 | 2944 | |
dbcf73e2 | 2945 | if (id < memcg_nr_cache_ids) |
f3bb3043 VD |
2946 | return id; |
2947 | ||
2948 | /* | |
2949 | * There's no space for the new id in memcg_caches arrays, | |
2950 | * so we have to grow them. | |
2951 | */ | |
05257a1a | 2952 | down_write(&memcg_cache_ids_sem); |
f3bb3043 VD |
2953 | |
2954 | size = 2 * (id + 1); | |
55007d84 GC |
2955 | if (size < MEMCG_CACHES_MIN_SIZE) |
2956 | size = MEMCG_CACHES_MIN_SIZE; | |
2957 | else if (size > MEMCG_CACHES_MAX_SIZE) | |
2958 | size = MEMCG_CACHES_MAX_SIZE; | |
2959 | ||
9855609b | 2960 | err = memcg_update_all_list_lrus(size); |
05257a1a VD |
2961 | if (!err) |
2962 | memcg_nr_cache_ids = size; | |
2963 | ||
2964 | up_write(&memcg_cache_ids_sem); | |
2965 | ||
f3bb3043 | 2966 | if (err) { |
dbcf73e2 | 2967 | ida_simple_remove(&memcg_cache_ida, id); |
f3bb3043 VD |
2968 | return err; |
2969 | } | |
2970 | return id; | |
2971 | } | |
2972 | ||
2973 | static void memcg_free_cache_id(int id) | |
2974 | { | |
dbcf73e2 | 2975 | ida_simple_remove(&memcg_cache_ida, id); |
55007d84 GC |
2976 | } |
2977 | ||
f1286fae MS |
2978 | /* |
2979 | * obj_cgroup_uncharge_pages: uncharge a number of kernel pages from a objcg | |
2980 | * @objcg: object cgroup to uncharge | |
2981 | * @nr_pages: number of pages to uncharge | |
2982 | */ | |
e74d2259 MS |
2983 | static void obj_cgroup_uncharge_pages(struct obj_cgroup *objcg, |
2984 | unsigned int nr_pages) | |
2985 | { | |
2986 | struct mem_cgroup *memcg; | |
2987 | ||
2988 | memcg = get_mem_cgroup_from_objcg(objcg); | |
e74d2259 | 2989 | |
f1286fae MS |
2990 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
2991 | page_counter_uncharge(&memcg->kmem, nr_pages); | |
2992 | refill_stock(memcg, nr_pages); | |
e74d2259 | 2993 | |
e74d2259 | 2994 | css_put(&memcg->css); |
e74d2259 MS |
2995 | } |
2996 | ||
f1286fae MS |
2997 | /* |
2998 | * obj_cgroup_charge_pages: charge a number of kernel pages to a objcg | |
2999 | * @objcg: object cgroup to charge | |
45264778 | 3000 | * @gfp: reclaim mode |
92d0510c | 3001 | * @nr_pages: number of pages to charge |
45264778 VD |
3002 | * |
3003 | * Returns 0 on success, an error code on failure. | |
3004 | */ | |
f1286fae MS |
3005 | static int obj_cgroup_charge_pages(struct obj_cgroup *objcg, gfp_t gfp, |
3006 | unsigned int nr_pages) | |
7ae1e1d0 | 3007 | { |
f3ccb2c4 | 3008 | struct page_counter *counter; |
f1286fae | 3009 | struct mem_cgroup *memcg; |
7ae1e1d0 GC |
3010 | int ret; |
3011 | ||
f1286fae MS |
3012 | memcg = get_mem_cgroup_from_objcg(objcg); |
3013 | ||
c5c8b16b | 3014 | ret = try_charge_memcg(memcg, gfp, nr_pages); |
52c29b04 | 3015 | if (ret) |
f1286fae | 3016 | goto out; |
52c29b04 JW |
3017 | |
3018 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && | |
3019 | !page_counter_try_charge(&memcg->kmem, nr_pages, &counter)) { | |
e55d9d9b MH |
3020 | |
3021 | /* | |
3022 | * Enforce __GFP_NOFAIL allocation because callers are not | |
3023 | * prepared to see failures and likely do not have any failure | |
3024 | * handling code. | |
3025 | */ | |
3026 | if (gfp & __GFP_NOFAIL) { | |
3027 | page_counter_charge(&memcg->kmem, nr_pages); | |
f1286fae | 3028 | goto out; |
e55d9d9b | 3029 | } |
52c29b04 | 3030 | cancel_charge(memcg, nr_pages); |
f1286fae | 3031 | ret = -ENOMEM; |
7ae1e1d0 | 3032 | } |
f1286fae MS |
3033 | out: |
3034 | css_put(&memcg->css); | |
4b13f64d | 3035 | |
f1286fae | 3036 | return ret; |
4b13f64d RG |
3037 | } |
3038 | ||
45264778 | 3039 | /** |
f4b00eab | 3040 | * __memcg_kmem_charge_page: charge a kmem page to the current memory cgroup |
45264778 VD |
3041 | * @page: page to charge |
3042 | * @gfp: reclaim mode | |
3043 | * @order: allocation order | |
3044 | * | |
3045 | * Returns 0 on success, an error code on failure. | |
3046 | */ | |
f4b00eab | 3047 | int __memcg_kmem_charge_page(struct page *page, gfp_t gfp, int order) |
7ae1e1d0 | 3048 | { |
b4e0b68f | 3049 | struct obj_cgroup *objcg; |
fcff7d7e | 3050 | int ret = 0; |
7ae1e1d0 | 3051 | |
b4e0b68f MS |
3052 | objcg = get_obj_cgroup_from_current(); |
3053 | if (objcg) { | |
3054 | ret = obj_cgroup_charge_pages(objcg, gfp, 1 << order); | |
4d96ba35 | 3055 | if (!ret) { |
b4e0b68f | 3056 | page->memcg_data = (unsigned long)objcg | |
18b2db3b | 3057 | MEMCG_DATA_KMEM; |
1a3e1f40 | 3058 | return 0; |
4d96ba35 | 3059 | } |
b4e0b68f | 3060 | obj_cgroup_put(objcg); |
c4159a75 | 3061 | } |
d05e83a6 | 3062 | return ret; |
7ae1e1d0 | 3063 | } |
49a18eae | 3064 | |
45264778 | 3065 | /** |
f4b00eab | 3066 | * __memcg_kmem_uncharge_page: uncharge a kmem page |
45264778 VD |
3067 | * @page: page to uncharge |
3068 | * @order: allocation order | |
3069 | */ | |
f4b00eab | 3070 | void __memcg_kmem_uncharge_page(struct page *page, int order) |
7ae1e1d0 | 3071 | { |
b4e0b68f | 3072 | struct obj_cgroup *objcg; |
f3ccb2c4 | 3073 | unsigned int nr_pages = 1 << order; |
7ae1e1d0 | 3074 | |
b4e0b68f | 3075 | if (!PageMemcgKmem(page)) |
7ae1e1d0 GC |
3076 | return; |
3077 | ||
b4e0b68f MS |
3078 | objcg = __page_objcg(page); |
3079 | obj_cgroup_uncharge_pages(objcg, nr_pages); | |
bcfe06bf | 3080 | page->memcg_data = 0; |
b4e0b68f | 3081 | obj_cgroup_put(objcg); |
60d3fd32 | 3082 | } |
bf4f0599 | 3083 | |
68ac5b3c WL |
3084 | void mod_objcg_state(struct obj_cgroup *objcg, struct pglist_data *pgdat, |
3085 | enum node_stat_item idx, int nr) | |
3086 | { | |
68ac5b3c | 3087 | unsigned long flags; |
55927114 | 3088 | struct obj_stock *stock = get_obj_stock(&flags); |
68ac5b3c WL |
3089 | int *bytes; |
3090 | ||
68ac5b3c WL |
3091 | /* |
3092 | * Save vmstat data in stock and skip vmstat array update unless | |
3093 | * accumulating over a page of vmstat data or when pgdat or idx | |
3094 | * changes. | |
3095 | */ | |
3096 | if (stock->cached_objcg != objcg) { | |
3097 | drain_obj_stock(stock); | |
3098 | obj_cgroup_get(objcg); | |
3099 | stock->nr_bytes = atomic_read(&objcg->nr_charged_bytes) | |
3100 | ? atomic_xchg(&objcg->nr_charged_bytes, 0) : 0; | |
3101 | stock->cached_objcg = objcg; | |
3102 | stock->cached_pgdat = pgdat; | |
3103 | } else if (stock->cached_pgdat != pgdat) { | |
3104 | /* Flush the existing cached vmstat data */ | |
7fa0dacb WL |
3105 | struct pglist_data *oldpg = stock->cached_pgdat; |
3106 | ||
68ac5b3c | 3107 | if (stock->nr_slab_reclaimable_b) { |
7fa0dacb | 3108 | mod_objcg_mlstate(objcg, oldpg, NR_SLAB_RECLAIMABLE_B, |
68ac5b3c WL |
3109 | stock->nr_slab_reclaimable_b); |
3110 | stock->nr_slab_reclaimable_b = 0; | |
3111 | } | |
3112 | if (stock->nr_slab_unreclaimable_b) { | |
7fa0dacb | 3113 | mod_objcg_mlstate(objcg, oldpg, NR_SLAB_UNRECLAIMABLE_B, |
68ac5b3c WL |
3114 | stock->nr_slab_unreclaimable_b); |
3115 | stock->nr_slab_unreclaimable_b = 0; | |
3116 | } | |
3117 | stock->cached_pgdat = pgdat; | |
3118 | } | |
3119 | ||
3120 | bytes = (idx == NR_SLAB_RECLAIMABLE_B) ? &stock->nr_slab_reclaimable_b | |
3121 | : &stock->nr_slab_unreclaimable_b; | |
3122 | /* | |
3123 | * Even for large object >= PAGE_SIZE, the vmstat data will still be | |
3124 | * cached locally at least once before pushing it out. | |
3125 | */ | |
3126 | if (!*bytes) { | |
3127 | *bytes = nr; | |
3128 | nr = 0; | |
3129 | } else { | |
3130 | *bytes += nr; | |
3131 | if (abs(*bytes) > PAGE_SIZE) { | |
3132 | nr = *bytes; | |
3133 | *bytes = 0; | |
3134 | } else { | |
3135 | nr = 0; | |
3136 | } | |
3137 | } | |
3138 | if (nr) | |
3139 | mod_objcg_mlstate(objcg, pgdat, idx, nr); | |
3140 | ||
55927114 | 3141 | put_obj_stock(flags); |
68ac5b3c WL |
3142 | } |
3143 | ||
bf4f0599 RG |
3144 | static bool consume_obj_stock(struct obj_cgroup *objcg, unsigned int nr_bytes) |
3145 | { | |
bf4f0599 | 3146 | unsigned long flags; |
55927114 | 3147 | struct obj_stock *stock = get_obj_stock(&flags); |
bf4f0599 RG |
3148 | bool ret = false; |
3149 | ||
bf4f0599 RG |
3150 | if (objcg == stock->cached_objcg && stock->nr_bytes >= nr_bytes) { |
3151 | stock->nr_bytes -= nr_bytes; | |
3152 | ret = true; | |
3153 | } | |
3154 | ||
55927114 | 3155 | put_obj_stock(flags); |
bf4f0599 RG |
3156 | |
3157 | return ret; | |
3158 | } | |
3159 | ||
55927114 | 3160 | static void drain_obj_stock(struct obj_stock *stock) |
bf4f0599 RG |
3161 | { |
3162 | struct obj_cgroup *old = stock->cached_objcg; | |
3163 | ||
3164 | if (!old) | |
3165 | return; | |
3166 | ||
3167 | if (stock->nr_bytes) { | |
3168 | unsigned int nr_pages = stock->nr_bytes >> PAGE_SHIFT; | |
3169 | unsigned int nr_bytes = stock->nr_bytes & (PAGE_SIZE - 1); | |
3170 | ||
e74d2259 MS |
3171 | if (nr_pages) |
3172 | obj_cgroup_uncharge_pages(old, nr_pages); | |
bf4f0599 RG |
3173 | |
3174 | /* | |
3175 | * The leftover is flushed to the centralized per-memcg value. | |
3176 | * On the next attempt to refill obj stock it will be moved | |
3177 | * to a per-cpu stock (probably, on an other CPU), see | |
3178 | * refill_obj_stock(). | |
3179 | * | |
3180 | * How often it's flushed is a trade-off between the memory | |
3181 | * limit enforcement accuracy and potential CPU contention, | |
3182 | * so it might be changed in the future. | |
3183 | */ | |
3184 | atomic_add(nr_bytes, &old->nr_charged_bytes); | |
3185 | stock->nr_bytes = 0; | |
3186 | } | |
3187 | ||
68ac5b3c WL |
3188 | /* |
3189 | * Flush the vmstat data in current stock | |
3190 | */ | |
3191 | if (stock->nr_slab_reclaimable_b || stock->nr_slab_unreclaimable_b) { | |
3192 | if (stock->nr_slab_reclaimable_b) { | |
3193 | mod_objcg_mlstate(old, stock->cached_pgdat, | |
3194 | NR_SLAB_RECLAIMABLE_B, | |
3195 | stock->nr_slab_reclaimable_b); | |
3196 | stock->nr_slab_reclaimable_b = 0; | |
3197 | } | |
3198 | if (stock->nr_slab_unreclaimable_b) { | |
3199 | mod_objcg_mlstate(old, stock->cached_pgdat, | |
3200 | NR_SLAB_UNRECLAIMABLE_B, | |
3201 | stock->nr_slab_unreclaimable_b); | |
3202 | stock->nr_slab_unreclaimable_b = 0; | |
3203 | } | |
3204 | stock->cached_pgdat = NULL; | |
3205 | } | |
3206 | ||
bf4f0599 RG |
3207 | obj_cgroup_put(old); |
3208 | stock->cached_objcg = NULL; | |
3209 | } | |
3210 | ||
3211 | static bool obj_stock_flush_required(struct memcg_stock_pcp *stock, | |
3212 | struct mem_cgroup *root_memcg) | |
3213 | { | |
3214 | struct mem_cgroup *memcg; | |
3215 | ||
55927114 WL |
3216 | if (in_task() && stock->task_obj.cached_objcg) { |
3217 | memcg = obj_cgroup_memcg(stock->task_obj.cached_objcg); | |
3218 | if (memcg && mem_cgroup_is_descendant(memcg, root_memcg)) | |
3219 | return true; | |
3220 | } | |
3221 | if (stock->irq_obj.cached_objcg) { | |
3222 | memcg = obj_cgroup_memcg(stock->irq_obj.cached_objcg); | |
bf4f0599 RG |
3223 | if (memcg && mem_cgroup_is_descendant(memcg, root_memcg)) |
3224 | return true; | |
3225 | } | |
3226 | ||
3227 | return false; | |
3228 | } | |
3229 | ||
5387c904 WL |
3230 | static void refill_obj_stock(struct obj_cgroup *objcg, unsigned int nr_bytes, |
3231 | bool allow_uncharge) | |
bf4f0599 | 3232 | { |
bf4f0599 | 3233 | unsigned long flags; |
55927114 | 3234 | struct obj_stock *stock = get_obj_stock(&flags); |
5387c904 | 3235 | unsigned int nr_pages = 0; |
bf4f0599 | 3236 | |
bf4f0599 RG |
3237 | if (stock->cached_objcg != objcg) { /* reset if necessary */ |
3238 | drain_obj_stock(stock); | |
3239 | obj_cgroup_get(objcg); | |
3240 | stock->cached_objcg = objcg; | |
5387c904 WL |
3241 | stock->nr_bytes = atomic_read(&objcg->nr_charged_bytes) |
3242 | ? atomic_xchg(&objcg->nr_charged_bytes, 0) : 0; | |
3243 | allow_uncharge = true; /* Allow uncharge when objcg changes */ | |
bf4f0599 RG |
3244 | } |
3245 | stock->nr_bytes += nr_bytes; | |
3246 | ||
5387c904 WL |
3247 | if (allow_uncharge && (stock->nr_bytes > PAGE_SIZE)) { |
3248 | nr_pages = stock->nr_bytes >> PAGE_SHIFT; | |
3249 | stock->nr_bytes &= (PAGE_SIZE - 1); | |
3250 | } | |
bf4f0599 | 3251 | |
55927114 | 3252 | put_obj_stock(flags); |
5387c904 WL |
3253 | |
3254 | if (nr_pages) | |
3255 | obj_cgroup_uncharge_pages(objcg, nr_pages); | |
bf4f0599 RG |
3256 | } |
3257 | ||
3258 | int obj_cgroup_charge(struct obj_cgroup *objcg, gfp_t gfp, size_t size) | |
3259 | { | |
bf4f0599 RG |
3260 | unsigned int nr_pages, nr_bytes; |
3261 | int ret; | |
3262 | ||
3263 | if (consume_obj_stock(objcg, size)) | |
3264 | return 0; | |
3265 | ||
3266 | /* | |
5387c904 | 3267 | * In theory, objcg->nr_charged_bytes can have enough |
bf4f0599 | 3268 | * pre-charged bytes to satisfy the allocation. However, |
5387c904 WL |
3269 | * flushing objcg->nr_charged_bytes requires two atomic |
3270 | * operations, and objcg->nr_charged_bytes can't be big. | |
3271 | * The shared objcg->nr_charged_bytes can also become a | |
3272 | * performance bottleneck if all tasks of the same memcg are | |
3273 | * trying to update it. So it's better to ignore it and try | |
3274 | * grab some new pages. The stock's nr_bytes will be flushed to | |
3275 | * objcg->nr_charged_bytes later on when objcg changes. | |
3276 | * | |
3277 | * The stock's nr_bytes may contain enough pre-charged bytes | |
3278 | * to allow one less page from being charged, but we can't rely | |
3279 | * on the pre-charged bytes not being changed outside of | |
3280 | * consume_obj_stock() or refill_obj_stock(). So ignore those | |
3281 | * pre-charged bytes as well when charging pages. To avoid a | |
3282 | * page uncharge right after a page charge, we set the | |
3283 | * allow_uncharge flag to false when calling refill_obj_stock() | |
3284 | * to temporarily allow the pre-charged bytes to exceed the page | |
3285 | * size limit. The maximum reachable value of the pre-charged | |
3286 | * bytes is (sizeof(object) + PAGE_SIZE - 2) if there is no data | |
3287 | * race. | |
bf4f0599 | 3288 | */ |
bf4f0599 RG |
3289 | nr_pages = size >> PAGE_SHIFT; |
3290 | nr_bytes = size & (PAGE_SIZE - 1); | |
3291 | ||
3292 | if (nr_bytes) | |
3293 | nr_pages += 1; | |
3294 | ||
e74d2259 | 3295 | ret = obj_cgroup_charge_pages(objcg, gfp, nr_pages); |
bf4f0599 | 3296 | if (!ret && nr_bytes) |
5387c904 | 3297 | refill_obj_stock(objcg, PAGE_SIZE - nr_bytes, false); |
bf4f0599 | 3298 | |
bf4f0599 RG |
3299 | return ret; |
3300 | } | |
3301 | ||
3302 | void obj_cgroup_uncharge(struct obj_cgroup *objcg, size_t size) | |
3303 | { | |
5387c904 | 3304 | refill_obj_stock(objcg, size, true); |
bf4f0599 RG |
3305 | } |
3306 | ||
84c07d11 | 3307 | #endif /* CONFIG_MEMCG_KMEM */ |
7ae1e1d0 | 3308 | |
ca3e0214 | 3309 | /* |
be6c8982 | 3310 | * Because page_memcg(head) is not set on tails, set it now. |
ca3e0214 | 3311 | */ |
be6c8982 | 3312 | void split_page_memcg(struct page *head, unsigned int nr) |
ca3e0214 | 3313 | { |
bcfe06bf | 3314 | struct mem_cgroup *memcg = page_memcg(head); |
e94c8a9c | 3315 | int i; |
ca3e0214 | 3316 | |
be6c8982 | 3317 | if (mem_cgroup_disabled() || !memcg) |
3d37c4a9 | 3318 | return; |
b070e65c | 3319 | |
be6c8982 ZG |
3320 | for (i = 1; i < nr; i++) |
3321 | head[i].memcg_data = head->memcg_data; | |
b4e0b68f MS |
3322 | |
3323 | if (PageMemcgKmem(head)) | |
3324 | obj_cgroup_get_many(__page_objcg(head), nr - 1); | |
3325 | else | |
3326 | css_get_many(&memcg->css, nr - 1); | |
ca3e0214 | 3327 | } |
ca3e0214 | 3328 | |
c255a458 | 3329 | #ifdef CONFIG_MEMCG_SWAP |
02491447 DN |
3330 | /** |
3331 | * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record. | |
3332 | * @entry: swap entry to be moved | |
3333 | * @from: mem_cgroup which the entry is moved from | |
3334 | * @to: mem_cgroup which the entry is moved to | |
3335 | * | |
3336 | * It succeeds only when the swap_cgroup's record for this entry is the same | |
3337 | * as the mem_cgroup's id of @from. | |
3338 | * | |
3339 | * Returns 0 on success, -EINVAL on failure. | |
3340 | * | |
3e32cb2e | 3341 | * The caller must have charged to @to, IOW, called page_counter_charge() about |
02491447 DN |
3342 | * both res and memsw, and called css_get(). |
3343 | */ | |
3344 | static int mem_cgroup_move_swap_account(swp_entry_t entry, | |
e91cbb42 | 3345 | struct mem_cgroup *from, struct mem_cgroup *to) |
02491447 DN |
3346 | { |
3347 | unsigned short old_id, new_id; | |
3348 | ||
34c00c31 LZ |
3349 | old_id = mem_cgroup_id(from); |
3350 | new_id = mem_cgroup_id(to); | |
02491447 DN |
3351 | |
3352 | if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) { | |
c9019e9b JW |
3353 | mod_memcg_state(from, MEMCG_SWAP, -1); |
3354 | mod_memcg_state(to, MEMCG_SWAP, 1); | |
02491447 DN |
3355 | return 0; |
3356 | } | |
3357 | return -EINVAL; | |
3358 | } | |
3359 | #else | |
3360 | static inline int mem_cgroup_move_swap_account(swp_entry_t entry, | |
e91cbb42 | 3361 | struct mem_cgroup *from, struct mem_cgroup *to) |
02491447 DN |
3362 | { |
3363 | return -EINVAL; | |
3364 | } | |
8c7c6e34 | 3365 | #endif |
d13d1443 | 3366 | |
bbec2e15 | 3367 | static DEFINE_MUTEX(memcg_max_mutex); |
f212ad7c | 3368 | |
bbec2e15 RG |
3369 | static int mem_cgroup_resize_max(struct mem_cgroup *memcg, |
3370 | unsigned long max, bool memsw) | |
628f4235 | 3371 | { |
3e32cb2e | 3372 | bool enlarge = false; |
bb4a7ea2 | 3373 | bool drained = false; |
3e32cb2e | 3374 | int ret; |
c054a78c YZ |
3375 | bool limits_invariant; |
3376 | struct page_counter *counter = memsw ? &memcg->memsw : &memcg->memory; | |
81d39c20 | 3377 | |
3e32cb2e | 3378 | do { |
628f4235 KH |
3379 | if (signal_pending(current)) { |
3380 | ret = -EINTR; | |
3381 | break; | |
3382 | } | |
3e32cb2e | 3383 | |
bbec2e15 | 3384 | mutex_lock(&memcg_max_mutex); |
c054a78c YZ |
3385 | /* |
3386 | * Make sure that the new limit (memsw or memory limit) doesn't | |
bbec2e15 | 3387 | * break our basic invariant rule memory.max <= memsw.max. |
c054a78c | 3388 | */ |
15b42562 | 3389 | limits_invariant = memsw ? max >= READ_ONCE(memcg->memory.max) : |
bbec2e15 | 3390 | max <= memcg->memsw.max; |
c054a78c | 3391 | if (!limits_invariant) { |
bbec2e15 | 3392 | mutex_unlock(&memcg_max_mutex); |
8c7c6e34 | 3393 | ret = -EINVAL; |
8c7c6e34 KH |
3394 | break; |
3395 | } | |
bbec2e15 | 3396 | if (max > counter->max) |
3e32cb2e | 3397 | enlarge = true; |
bbec2e15 RG |
3398 | ret = page_counter_set_max(counter, max); |
3399 | mutex_unlock(&memcg_max_mutex); | |
8c7c6e34 KH |
3400 | |
3401 | if (!ret) | |
3402 | break; | |
3403 | ||
bb4a7ea2 SB |
3404 | if (!drained) { |
3405 | drain_all_stock(memcg); | |
3406 | drained = true; | |
3407 | continue; | |
3408 | } | |
3409 | ||
1ab5c056 AR |
3410 | if (!try_to_free_mem_cgroup_pages(memcg, 1, |
3411 | GFP_KERNEL, !memsw)) { | |
3412 | ret = -EBUSY; | |
3413 | break; | |
3414 | } | |
3415 | } while (true); | |
3e32cb2e | 3416 | |
3c11ecf4 KH |
3417 | if (!ret && enlarge) |
3418 | memcg_oom_recover(memcg); | |
3e32cb2e | 3419 | |
628f4235 KH |
3420 | return ret; |
3421 | } | |
3422 | ||
ef8f2327 | 3423 | unsigned long mem_cgroup_soft_limit_reclaim(pg_data_t *pgdat, int order, |
0608f43d AM |
3424 | gfp_t gfp_mask, |
3425 | unsigned long *total_scanned) | |
3426 | { | |
3427 | unsigned long nr_reclaimed = 0; | |
ef8f2327 | 3428 | struct mem_cgroup_per_node *mz, *next_mz = NULL; |
0608f43d AM |
3429 | unsigned long reclaimed; |
3430 | int loop = 0; | |
ef8f2327 | 3431 | struct mem_cgroup_tree_per_node *mctz; |
3e32cb2e | 3432 | unsigned long excess; |
0608f43d AM |
3433 | unsigned long nr_scanned; |
3434 | ||
3435 | if (order > 0) | |
3436 | return 0; | |
3437 | ||
ef8f2327 | 3438 | mctz = soft_limit_tree_node(pgdat->node_id); |
d6507ff5 MH |
3439 | |
3440 | /* | |
3441 | * Do not even bother to check the largest node if the root | |
3442 | * is empty. Do it lockless to prevent lock bouncing. Races | |
3443 | * are acceptable as soft limit is best effort anyway. | |
3444 | */ | |
bfc7228b | 3445 | if (!mctz || RB_EMPTY_ROOT(&mctz->rb_root)) |
d6507ff5 MH |
3446 | return 0; |
3447 | ||
0608f43d AM |
3448 | /* |
3449 | * This loop can run a while, specially if mem_cgroup's continuously | |
3450 | * keep exceeding their soft limit and putting the system under | |
3451 | * pressure | |
3452 | */ | |
3453 | do { | |
3454 | if (next_mz) | |
3455 | mz = next_mz; | |
3456 | else | |
3457 | mz = mem_cgroup_largest_soft_limit_node(mctz); | |
3458 | if (!mz) | |
3459 | break; | |
3460 | ||
3461 | nr_scanned = 0; | |
ef8f2327 | 3462 | reclaimed = mem_cgroup_soft_reclaim(mz->memcg, pgdat, |
0608f43d AM |
3463 | gfp_mask, &nr_scanned); |
3464 | nr_reclaimed += reclaimed; | |
3465 | *total_scanned += nr_scanned; | |
0a31bc97 | 3466 | spin_lock_irq(&mctz->lock); |
bc2f2e7f | 3467 | __mem_cgroup_remove_exceeded(mz, mctz); |
0608f43d AM |
3468 | |
3469 | /* | |
3470 | * If we failed to reclaim anything from this memory cgroup | |
3471 | * it is time to move on to the next cgroup | |
3472 | */ | |
3473 | next_mz = NULL; | |
bc2f2e7f VD |
3474 | if (!reclaimed) |
3475 | next_mz = __mem_cgroup_largest_soft_limit_node(mctz); | |
3476 | ||
3e32cb2e | 3477 | excess = soft_limit_excess(mz->memcg); |
0608f43d AM |
3478 | /* |
3479 | * One school of thought says that we should not add | |
3480 | * back the node to the tree if reclaim returns 0. | |
3481 | * But our reclaim could return 0, simply because due | |
3482 | * to priority we are exposing a smaller subset of | |
3483 | * memory to reclaim from. Consider this as a longer | |
3484 | * term TODO. | |
3485 | */ | |
3486 | /* If excess == 0, no tree ops */ | |
cf2c8127 | 3487 | __mem_cgroup_insert_exceeded(mz, mctz, excess); |
0a31bc97 | 3488 | spin_unlock_irq(&mctz->lock); |
0608f43d AM |
3489 | css_put(&mz->memcg->css); |
3490 | loop++; | |
3491 | /* | |
3492 | * Could not reclaim anything and there are no more | |
3493 | * mem cgroups to try or we seem to be looping without | |
3494 | * reclaiming anything. | |
3495 | */ | |
3496 | if (!nr_reclaimed && | |
3497 | (next_mz == NULL || | |
3498 | loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS)) | |
3499 | break; | |
3500 | } while (!nr_reclaimed); | |
3501 | if (next_mz) | |
3502 | css_put(&next_mz->memcg->css); | |
3503 | return nr_reclaimed; | |
3504 | } | |
3505 | ||
c26251f9 | 3506 | /* |
51038171 | 3507 | * Reclaims as many pages from the given memcg as possible. |
c26251f9 MH |
3508 | * |
3509 | * Caller is responsible for holding css reference for memcg. | |
3510 | */ | |
3511 | static int mem_cgroup_force_empty(struct mem_cgroup *memcg) | |
3512 | { | |
d977aa93 | 3513 | int nr_retries = MAX_RECLAIM_RETRIES; |
c26251f9 | 3514 | |
c1e862c1 KH |
3515 | /* we call try-to-free pages for make this cgroup empty */ |
3516 | lru_add_drain_all(); | |
d12c60f6 JS |
3517 | |
3518 | drain_all_stock(memcg); | |
3519 | ||
f817ed48 | 3520 | /* try to free all pages in this cgroup */ |
3e32cb2e | 3521 | while (nr_retries && page_counter_read(&memcg->memory)) { |
f817ed48 | 3522 | int progress; |
c1e862c1 | 3523 | |
c26251f9 MH |
3524 | if (signal_pending(current)) |
3525 | return -EINTR; | |
3526 | ||
b70a2a21 JW |
3527 | progress = try_to_free_mem_cgroup_pages(memcg, 1, |
3528 | GFP_KERNEL, true); | |
c1e862c1 | 3529 | if (!progress) { |
f817ed48 | 3530 | nr_retries--; |
c1e862c1 | 3531 | /* maybe some writeback is necessary */ |
8aa7e847 | 3532 | congestion_wait(BLK_RW_ASYNC, HZ/10); |
c1e862c1 | 3533 | } |
f817ed48 KH |
3534 | |
3535 | } | |
ab5196c2 MH |
3536 | |
3537 | return 0; | |
cc847582 KH |
3538 | } |
3539 | ||
6770c64e TH |
3540 | static ssize_t mem_cgroup_force_empty_write(struct kernfs_open_file *of, |
3541 | char *buf, size_t nbytes, | |
3542 | loff_t off) | |
c1e862c1 | 3543 | { |
6770c64e | 3544 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); |
c26251f9 | 3545 | |
d8423011 MH |
3546 | if (mem_cgroup_is_root(memcg)) |
3547 | return -EINVAL; | |
6770c64e | 3548 | return mem_cgroup_force_empty(memcg) ?: nbytes; |
c1e862c1 KH |
3549 | } |
3550 | ||
182446d0 TH |
3551 | static u64 mem_cgroup_hierarchy_read(struct cgroup_subsys_state *css, |
3552 | struct cftype *cft) | |
18f59ea7 | 3553 | { |
bef8620c | 3554 | return 1; |
18f59ea7 BS |
3555 | } |
3556 | ||
182446d0 TH |
3557 | static int mem_cgroup_hierarchy_write(struct cgroup_subsys_state *css, |
3558 | struct cftype *cft, u64 val) | |
18f59ea7 | 3559 | { |
bef8620c | 3560 | if (val == 1) |
0b8f73e1 | 3561 | return 0; |
567fb435 | 3562 | |
bef8620c RG |
3563 | pr_warn_once("Non-hierarchical mode is deprecated. " |
3564 | "Please report your usecase to linux-mm@kvack.org if you " | |
3565 | "depend on this functionality.\n"); | |
567fb435 | 3566 | |
bef8620c | 3567 | return -EINVAL; |
18f59ea7 BS |
3568 | } |
3569 | ||
6f646156 | 3570 | static unsigned long mem_cgroup_usage(struct mem_cgroup *memcg, bool swap) |
ce00a967 | 3571 | { |
42a30035 | 3572 | unsigned long val; |
ce00a967 | 3573 | |
3e32cb2e | 3574 | if (mem_cgroup_is_root(memcg)) { |
909fc739 | 3575 | mem_cgroup_flush_stats(); |
0d1c2072 | 3576 | val = memcg_page_state(memcg, NR_FILE_PAGES) + |
be5d0a74 | 3577 | memcg_page_state(memcg, NR_ANON_MAPPED); |
42a30035 JW |
3578 | if (swap) |
3579 | val += memcg_page_state(memcg, MEMCG_SWAP); | |
3e32cb2e | 3580 | } else { |
ce00a967 | 3581 | if (!swap) |
3e32cb2e | 3582 | val = page_counter_read(&memcg->memory); |
ce00a967 | 3583 | else |
3e32cb2e | 3584 | val = page_counter_read(&memcg->memsw); |
ce00a967 | 3585 | } |
c12176d3 | 3586 | return val; |
ce00a967 JW |
3587 | } |
3588 | ||
3e32cb2e JW |
3589 | enum { |
3590 | RES_USAGE, | |
3591 | RES_LIMIT, | |
3592 | RES_MAX_USAGE, | |
3593 | RES_FAILCNT, | |
3594 | RES_SOFT_LIMIT, | |
3595 | }; | |
ce00a967 | 3596 | |
791badbd | 3597 | static u64 mem_cgroup_read_u64(struct cgroup_subsys_state *css, |
05b84301 | 3598 | struct cftype *cft) |
8cdea7c0 | 3599 | { |
182446d0 | 3600 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
3e32cb2e | 3601 | struct page_counter *counter; |
af36f906 | 3602 | |
3e32cb2e | 3603 | switch (MEMFILE_TYPE(cft->private)) { |
8c7c6e34 | 3604 | case _MEM: |
3e32cb2e JW |
3605 | counter = &memcg->memory; |
3606 | break; | |
8c7c6e34 | 3607 | case _MEMSWAP: |
3e32cb2e JW |
3608 | counter = &memcg->memsw; |
3609 | break; | |
510fc4e1 | 3610 | case _KMEM: |
3e32cb2e | 3611 | counter = &memcg->kmem; |
510fc4e1 | 3612 | break; |
d55f90bf | 3613 | case _TCP: |
0db15298 | 3614 | counter = &memcg->tcpmem; |
d55f90bf | 3615 | break; |
8c7c6e34 KH |
3616 | default: |
3617 | BUG(); | |
8c7c6e34 | 3618 | } |
3e32cb2e JW |
3619 | |
3620 | switch (MEMFILE_ATTR(cft->private)) { | |
3621 | case RES_USAGE: | |
3622 | if (counter == &memcg->memory) | |
c12176d3 | 3623 | return (u64)mem_cgroup_usage(memcg, false) * PAGE_SIZE; |
3e32cb2e | 3624 | if (counter == &memcg->memsw) |
c12176d3 | 3625 | return (u64)mem_cgroup_usage(memcg, true) * PAGE_SIZE; |
3e32cb2e JW |
3626 | return (u64)page_counter_read(counter) * PAGE_SIZE; |
3627 | case RES_LIMIT: | |
bbec2e15 | 3628 | return (u64)counter->max * PAGE_SIZE; |
3e32cb2e JW |
3629 | case RES_MAX_USAGE: |
3630 | return (u64)counter->watermark * PAGE_SIZE; | |
3631 | case RES_FAILCNT: | |
3632 | return counter->failcnt; | |
3633 | case RES_SOFT_LIMIT: | |
3634 | return (u64)memcg->soft_limit * PAGE_SIZE; | |
3635 | default: | |
3636 | BUG(); | |
3637 | } | |
8cdea7c0 | 3638 | } |
510fc4e1 | 3639 | |
84c07d11 | 3640 | #ifdef CONFIG_MEMCG_KMEM |
567e9ab2 | 3641 | static int memcg_online_kmem(struct mem_cgroup *memcg) |
d6441637 | 3642 | { |
bf4f0599 | 3643 | struct obj_cgroup *objcg; |
d6441637 VD |
3644 | int memcg_id; |
3645 | ||
b313aeee VD |
3646 | if (cgroup_memory_nokmem) |
3647 | return 0; | |
3648 | ||
2a4db7eb | 3649 | BUG_ON(memcg->kmemcg_id >= 0); |
567e9ab2 | 3650 | BUG_ON(memcg->kmem_state); |
d6441637 | 3651 | |
f3bb3043 | 3652 | memcg_id = memcg_alloc_cache_id(); |
0b8f73e1 JW |
3653 | if (memcg_id < 0) |
3654 | return memcg_id; | |
d6441637 | 3655 | |
bf4f0599 RG |
3656 | objcg = obj_cgroup_alloc(); |
3657 | if (!objcg) { | |
3658 | memcg_free_cache_id(memcg_id); | |
3659 | return -ENOMEM; | |
3660 | } | |
3661 | objcg->memcg = memcg; | |
3662 | rcu_assign_pointer(memcg->objcg, objcg); | |
3663 | ||
d648bcc7 RG |
3664 | static_branch_enable(&memcg_kmem_enabled_key); |
3665 | ||
900a38f0 | 3666 | memcg->kmemcg_id = memcg_id; |
567e9ab2 | 3667 | memcg->kmem_state = KMEM_ONLINE; |
0b8f73e1 JW |
3668 | |
3669 | return 0; | |
d6441637 VD |
3670 | } |
3671 | ||
8e0a8912 JW |
3672 | static void memcg_offline_kmem(struct mem_cgroup *memcg) |
3673 | { | |
3674 | struct cgroup_subsys_state *css; | |
3675 | struct mem_cgroup *parent, *child; | |
3676 | int kmemcg_id; | |
3677 | ||
3678 | if (memcg->kmem_state != KMEM_ONLINE) | |
3679 | return; | |
9855609b | 3680 | |
8e0a8912 JW |
3681 | memcg->kmem_state = KMEM_ALLOCATED; |
3682 | ||
8e0a8912 JW |
3683 | parent = parent_mem_cgroup(memcg); |
3684 | if (!parent) | |
3685 | parent = root_mem_cgroup; | |
3686 | ||
bf4f0599 | 3687 | memcg_reparent_objcgs(memcg, parent); |
fb2f2b0a RG |
3688 | |
3689 | kmemcg_id = memcg->kmemcg_id; | |
3690 | BUG_ON(kmemcg_id < 0); | |
3691 | ||
8e0a8912 JW |
3692 | /* |
3693 | * Change kmemcg_id of this cgroup and all its descendants to the | |
3694 | * parent's id, and then move all entries from this cgroup's list_lrus | |
3695 | * to ones of the parent. After we have finished, all list_lrus | |
3696 | * corresponding to this cgroup are guaranteed to remain empty. The | |
3697 | * ordering is imposed by list_lru_node->lock taken by | |
3698 | * memcg_drain_all_list_lrus(). | |
3699 | */ | |
3a06bb78 | 3700 | rcu_read_lock(); /* can be called from css_free w/o cgroup_mutex */ |
8e0a8912 JW |
3701 | css_for_each_descendant_pre(css, &memcg->css) { |
3702 | child = mem_cgroup_from_css(css); | |
3703 | BUG_ON(child->kmemcg_id != kmemcg_id); | |
3704 | child->kmemcg_id = parent->kmemcg_id; | |
8e0a8912 | 3705 | } |
3a06bb78 TH |
3706 | rcu_read_unlock(); |
3707 | ||
9bec5c35 | 3708 | memcg_drain_all_list_lrus(kmemcg_id, parent); |
8e0a8912 JW |
3709 | |
3710 | memcg_free_cache_id(kmemcg_id); | |
3711 | } | |
3712 | ||
3713 | static void memcg_free_kmem(struct mem_cgroup *memcg) | |
3714 | { | |
0b8f73e1 JW |
3715 | /* css_alloc() failed, offlining didn't happen */ |
3716 | if (unlikely(memcg->kmem_state == KMEM_ONLINE)) | |
3717 | memcg_offline_kmem(memcg); | |
8e0a8912 | 3718 | } |
d6441637 | 3719 | #else |
0b8f73e1 | 3720 | static int memcg_online_kmem(struct mem_cgroup *memcg) |
127424c8 JW |
3721 | { |
3722 | return 0; | |
3723 | } | |
3724 | static void memcg_offline_kmem(struct mem_cgroup *memcg) | |
3725 | { | |
3726 | } | |
3727 | static void memcg_free_kmem(struct mem_cgroup *memcg) | |
3728 | { | |
3729 | } | |
84c07d11 | 3730 | #endif /* CONFIG_MEMCG_KMEM */ |
127424c8 | 3731 | |
bbec2e15 RG |
3732 | static int memcg_update_kmem_max(struct mem_cgroup *memcg, |
3733 | unsigned long max) | |
d6441637 | 3734 | { |
b313aeee | 3735 | int ret; |
127424c8 | 3736 | |
bbec2e15 RG |
3737 | mutex_lock(&memcg_max_mutex); |
3738 | ret = page_counter_set_max(&memcg->kmem, max); | |
3739 | mutex_unlock(&memcg_max_mutex); | |
127424c8 | 3740 | return ret; |
d6441637 | 3741 | } |
510fc4e1 | 3742 | |
bbec2e15 | 3743 | static int memcg_update_tcp_max(struct mem_cgroup *memcg, unsigned long max) |
d55f90bf VD |
3744 | { |
3745 | int ret; | |
3746 | ||
bbec2e15 | 3747 | mutex_lock(&memcg_max_mutex); |
d55f90bf | 3748 | |
bbec2e15 | 3749 | ret = page_counter_set_max(&memcg->tcpmem, max); |
d55f90bf VD |
3750 | if (ret) |
3751 | goto out; | |
3752 | ||
0db15298 | 3753 | if (!memcg->tcpmem_active) { |
d55f90bf VD |
3754 | /* |
3755 | * The active flag needs to be written after the static_key | |
3756 | * update. This is what guarantees that the socket activation | |
2d758073 JW |
3757 | * function is the last one to run. See mem_cgroup_sk_alloc() |
3758 | * for details, and note that we don't mark any socket as | |
3759 | * belonging to this memcg until that flag is up. | |
d55f90bf VD |
3760 | * |
3761 | * We need to do this, because static_keys will span multiple | |
3762 | * sites, but we can't control their order. If we mark a socket | |
3763 | * as accounted, but the accounting functions are not patched in | |
3764 | * yet, we'll lose accounting. | |
3765 | * | |
2d758073 | 3766 | * We never race with the readers in mem_cgroup_sk_alloc(), |
d55f90bf VD |
3767 | * because when this value change, the code to process it is not |
3768 | * patched in yet. | |
3769 | */ | |
3770 | static_branch_inc(&memcg_sockets_enabled_key); | |
0db15298 | 3771 | memcg->tcpmem_active = true; |
d55f90bf VD |
3772 | } |
3773 | out: | |
bbec2e15 | 3774 | mutex_unlock(&memcg_max_mutex); |
d55f90bf VD |
3775 | return ret; |
3776 | } | |
d55f90bf | 3777 | |
628f4235 KH |
3778 | /* |
3779 | * The user of this function is... | |
3780 | * RES_LIMIT. | |
3781 | */ | |
451af504 TH |
3782 | static ssize_t mem_cgroup_write(struct kernfs_open_file *of, |
3783 | char *buf, size_t nbytes, loff_t off) | |
8cdea7c0 | 3784 | { |
451af504 | 3785 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); |
3e32cb2e | 3786 | unsigned long nr_pages; |
628f4235 KH |
3787 | int ret; |
3788 | ||
451af504 | 3789 | buf = strstrip(buf); |
650c5e56 | 3790 | ret = page_counter_memparse(buf, "-1", &nr_pages); |
3e32cb2e JW |
3791 | if (ret) |
3792 | return ret; | |
af36f906 | 3793 | |
3e32cb2e | 3794 | switch (MEMFILE_ATTR(of_cft(of)->private)) { |
628f4235 | 3795 | case RES_LIMIT: |
4b3bde4c BS |
3796 | if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */ |
3797 | ret = -EINVAL; | |
3798 | break; | |
3799 | } | |
3e32cb2e JW |
3800 | switch (MEMFILE_TYPE(of_cft(of)->private)) { |
3801 | case _MEM: | |
bbec2e15 | 3802 | ret = mem_cgroup_resize_max(memcg, nr_pages, false); |
8c7c6e34 | 3803 | break; |
3e32cb2e | 3804 | case _MEMSWAP: |
bbec2e15 | 3805 | ret = mem_cgroup_resize_max(memcg, nr_pages, true); |
296c81d8 | 3806 | break; |
3e32cb2e | 3807 | case _KMEM: |
0158115f MH |
3808 | pr_warn_once("kmem.limit_in_bytes is deprecated and will be removed. " |
3809 | "Please report your usecase to linux-mm@kvack.org if you " | |
3810 | "depend on this functionality.\n"); | |
bbec2e15 | 3811 | ret = memcg_update_kmem_max(memcg, nr_pages); |
3e32cb2e | 3812 | break; |
d55f90bf | 3813 | case _TCP: |
bbec2e15 | 3814 | ret = memcg_update_tcp_max(memcg, nr_pages); |
d55f90bf | 3815 | break; |
3e32cb2e | 3816 | } |
296c81d8 | 3817 | break; |
3e32cb2e JW |
3818 | case RES_SOFT_LIMIT: |
3819 | memcg->soft_limit = nr_pages; | |
3820 | ret = 0; | |
628f4235 KH |
3821 | break; |
3822 | } | |
451af504 | 3823 | return ret ?: nbytes; |
8cdea7c0 BS |
3824 | } |
3825 | ||
6770c64e TH |
3826 | static ssize_t mem_cgroup_reset(struct kernfs_open_file *of, char *buf, |
3827 | size_t nbytes, loff_t off) | |
c84872e1 | 3828 | { |
6770c64e | 3829 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); |
3e32cb2e | 3830 | struct page_counter *counter; |
c84872e1 | 3831 | |
3e32cb2e JW |
3832 | switch (MEMFILE_TYPE(of_cft(of)->private)) { |
3833 | case _MEM: | |
3834 | counter = &memcg->memory; | |
3835 | break; | |
3836 | case _MEMSWAP: | |
3837 | counter = &memcg->memsw; | |
3838 | break; | |
3839 | case _KMEM: | |
3840 | counter = &memcg->kmem; | |
3841 | break; | |
d55f90bf | 3842 | case _TCP: |
0db15298 | 3843 | counter = &memcg->tcpmem; |
d55f90bf | 3844 | break; |
3e32cb2e JW |
3845 | default: |
3846 | BUG(); | |
3847 | } | |
af36f906 | 3848 | |
3e32cb2e | 3849 | switch (MEMFILE_ATTR(of_cft(of)->private)) { |
29f2a4da | 3850 | case RES_MAX_USAGE: |
3e32cb2e | 3851 | page_counter_reset_watermark(counter); |
29f2a4da PE |
3852 | break; |
3853 | case RES_FAILCNT: | |
3e32cb2e | 3854 | counter->failcnt = 0; |
29f2a4da | 3855 | break; |
3e32cb2e JW |
3856 | default: |
3857 | BUG(); | |
29f2a4da | 3858 | } |
f64c3f54 | 3859 | |
6770c64e | 3860 | return nbytes; |
c84872e1 PE |
3861 | } |
3862 | ||
182446d0 | 3863 | static u64 mem_cgroup_move_charge_read(struct cgroup_subsys_state *css, |
7dc74be0 DN |
3864 | struct cftype *cft) |
3865 | { | |
182446d0 | 3866 | return mem_cgroup_from_css(css)->move_charge_at_immigrate; |
7dc74be0 DN |
3867 | } |
3868 | ||
02491447 | 3869 | #ifdef CONFIG_MMU |
182446d0 | 3870 | static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css, |
7dc74be0 DN |
3871 | struct cftype *cft, u64 val) |
3872 | { | |
182446d0 | 3873 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
7dc74be0 | 3874 | |
1dfab5ab | 3875 | if (val & ~MOVE_MASK) |
7dc74be0 | 3876 | return -EINVAL; |
ee5e8472 | 3877 | |
7dc74be0 | 3878 | /* |
ee5e8472 GC |
3879 | * No kind of locking is needed in here, because ->can_attach() will |
3880 | * check this value once in the beginning of the process, and then carry | |
3881 | * on with stale data. This means that changes to this value will only | |
3882 | * affect task migrations starting after the change. | |
7dc74be0 | 3883 | */ |
c0ff4b85 | 3884 | memcg->move_charge_at_immigrate = val; |
7dc74be0 DN |
3885 | return 0; |
3886 | } | |
02491447 | 3887 | #else |
182446d0 | 3888 | static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css, |
02491447 DN |
3889 | struct cftype *cft, u64 val) |
3890 | { | |
3891 | return -ENOSYS; | |
3892 | } | |
3893 | #endif | |
7dc74be0 | 3894 | |
406eb0c9 | 3895 | #ifdef CONFIG_NUMA |
113b7dfd JW |
3896 | |
3897 | #define LRU_ALL_FILE (BIT(LRU_INACTIVE_FILE) | BIT(LRU_ACTIVE_FILE)) | |
3898 | #define LRU_ALL_ANON (BIT(LRU_INACTIVE_ANON) | BIT(LRU_ACTIVE_ANON)) | |
3899 | #define LRU_ALL ((1 << NR_LRU_LISTS) - 1) | |
3900 | ||
3901 | static unsigned long mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg, | |
dd8657b6 | 3902 | int nid, unsigned int lru_mask, bool tree) |
113b7dfd | 3903 | { |
867e5e1d | 3904 | struct lruvec *lruvec = mem_cgroup_lruvec(memcg, NODE_DATA(nid)); |
113b7dfd JW |
3905 | unsigned long nr = 0; |
3906 | enum lru_list lru; | |
3907 | ||
3908 | VM_BUG_ON((unsigned)nid >= nr_node_ids); | |
3909 | ||
3910 | for_each_lru(lru) { | |
3911 | if (!(BIT(lru) & lru_mask)) | |
3912 | continue; | |
dd8657b6 SB |
3913 | if (tree) |
3914 | nr += lruvec_page_state(lruvec, NR_LRU_BASE + lru); | |
3915 | else | |
3916 | nr += lruvec_page_state_local(lruvec, NR_LRU_BASE + lru); | |
113b7dfd JW |
3917 | } |
3918 | return nr; | |
3919 | } | |
3920 | ||
3921 | static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg, | |
dd8657b6 SB |
3922 | unsigned int lru_mask, |
3923 | bool tree) | |
113b7dfd JW |
3924 | { |
3925 | unsigned long nr = 0; | |
3926 | enum lru_list lru; | |
3927 | ||
3928 | for_each_lru(lru) { | |
3929 | if (!(BIT(lru) & lru_mask)) | |
3930 | continue; | |
dd8657b6 SB |
3931 | if (tree) |
3932 | nr += memcg_page_state(memcg, NR_LRU_BASE + lru); | |
3933 | else | |
3934 | nr += memcg_page_state_local(memcg, NR_LRU_BASE + lru); | |
113b7dfd JW |
3935 | } |
3936 | return nr; | |
3937 | } | |
3938 | ||
2da8ca82 | 3939 | static int memcg_numa_stat_show(struct seq_file *m, void *v) |
406eb0c9 | 3940 | { |
25485de6 GT |
3941 | struct numa_stat { |
3942 | const char *name; | |
3943 | unsigned int lru_mask; | |
3944 | }; | |
3945 | ||
3946 | static const struct numa_stat stats[] = { | |
3947 | { "total", LRU_ALL }, | |
3948 | { "file", LRU_ALL_FILE }, | |
3949 | { "anon", LRU_ALL_ANON }, | |
3950 | { "unevictable", BIT(LRU_UNEVICTABLE) }, | |
3951 | }; | |
3952 | const struct numa_stat *stat; | |
406eb0c9 | 3953 | int nid; |
aa9694bb | 3954 | struct mem_cgroup *memcg = mem_cgroup_from_seq(m); |
406eb0c9 | 3955 | |
909fc739 | 3956 | mem_cgroup_flush_stats(); |
2d146aa3 | 3957 | |
25485de6 | 3958 | for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) { |
dd8657b6 SB |
3959 | seq_printf(m, "%s=%lu", stat->name, |
3960 | mem_cgroup_nr_lru_pages(memcg, stat->lru_mask, | |
3961 | false)); | |
3962 | for_each_node_state(nid, N_MEMORY) | |
3963 | seq_printf(m, " N%d=%lu", nid, | |
3964 | mem_cgroup_node_nr_lru_pages(memcg, nid, | |
3965 | stat->lru_mask, false)); | |
25485de6 | 3966 | seq_putc(m, '\n'); |
406eb0c9 | 3967 | } |
406eb0c9 | 3968 | |
071aee13 | 3969 | for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) { |
dd8657b6 SB |
3970 | |
3971 | seq_printf(m, "hierarchical_%s=%lu", stat->name, | |
3972 | mem_cgroup_nr_lru_pages(memcg, stat->lru_mask, | |
3973 | true)); | |
3974 | for_each_node_state(nid, N_MEMORY) | |
3975 | seq_printf(m, " N%d=%lu", nid, | |
3976 | mem_cgroup_node_nr_lru_pages(memcg, nid, | |
3977 | stat->lru_mask, true)); | |
071aee13 | 3978 | seq_putc(m, '\n'); |
406eb0c9 | 3979 | } |
406eb0c9 | 3980 | |
406eb0c9 YH |
3981 | return 0; |
3982 | } | |
3983 | #endif /* CONFIG_NUMA */ | |
3984 | ||
c8713d0b | 3985 | static const unsigned int memcg1_stats[] = { |
0d1c2072 | 3986 | NR_FILE_PAGES, |
be5d0a74 | 3987 | NR_ANON_MAPPED, |
468c3982 JW |
3988 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE |
3989 | NR_ANON_THPS, | |
3990 | #endif | |
c8713d0b JW |
3991 | NR_SHMEM, |
3992 | NR_FILE_MAPPED, | |
3993 | NR_FILE_DIRTY, | |
3994 | NR_WRITEBACK, | |
3995 | MEMCG_SWAP, | |
3996 | }; | |
3997 | ||
3998 | static const char *const memcg1_stat_names[] = { | |
3999 | "cache", | |
4000 | "rss", | |
468c3982 | 4001 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE |
c8713d0b | 4002 | "rss_huge", |
468c3982 | 4003 | #endif |
c8713d0b JW |
4004 | "shmem", |
4005 | "mapped_file", | |
4006 | "dirty", | |
4007 | "writeback", | |
4008 | "swap", | |
4009 | }; | |
4010 | ||
df0e53d0 | 4011 | /* Universal VM events cgroup1 shows, original sort order */ |
8dd53fd3 | 4012 | static const unsigned int memcg1_events[] = { |
df0e53d0 JW |
4013 | PGPGIN, |
4014 | PGPGOUT, | |
4015 | PGFAULT, | |
4016 | PGMAJFAULT, | |
4017 | }; | |
4018 | ||
2da8ca82 | 4019 | static int memcg_stat_show(struct seq_file *m, void *v) |
d2ceb9b7 | 4020 | { |
aa9694bb | 4021 | struct mem_cgroup *memcg = mem_cgroup_from_seq(m); |
3e32cb2e | 4022 | unsigned long memory, memsw; |
af7c4b0e JW |
4023 | struct mem_cgroup *mi; |
4024 | unsigned int i; | |
406eb0c9 | 4025 | |
71cd3113 | 4026 | BUILD_BUG_ON(ARRAY_SIZE(memcg1_stat_names) != ARRAY_SIZE(memcg1_stats)); |
70bc068c | 4027 | |
909fc739 | 4028 | mem_cgroup_flush_stats(); |
2d146aa3 | 4029 | |
71cd3113 | 4030 | for (i = 0; i < ARRAY_SIZE(memcg1_stats); i++) { |
468c3982 JW |
4031 | unsigned long nr; |
4032 | ||
71cd3113 | 4033 | if (memcg1_stats[i] == MEMCG_SWAP && !do_memsw_account()) |
1dd3a273 | 4034 | continue; |
468c3982 | 4035 | nr = memcg_page_state_local(memcg, memcg1_stats[i]); |
468c3982 | 4036 | seq_printf(m, "%s %lu\n", memcg1_stat_names[i], nr * PAGE_SIZE); |
1dd3a273 | 4037 | } |
7b854121 | 4038 | |
df0e53d0 | 4039 | for (i = 0; i < ARRAY_SIZE(memcg1_events); i++) |
ebc5d83d | 4040 | seq_printf(m, "%s %lu\n", vm_event_name(memcg1_events[i]), |
205b20cc | 4041 | memcg_events_local(memcg, memcg1_events[i])); |
af7c4b0e JW |
4042 | |
4043 | for (i = 0; i < NR_LRU_LISTS; i++) | |
ebc5d83d | 4044 | seq_printf(m, "%s %lu\n", lru_list_name(i), |
205b20cc | 4045 | memcg_page_state_local(memcg, NR_LRU_BASE + i) * |
21d89d15 | 4046 | PAGE_SIZE); |
af7c4b0e | 4047 | |
14067bb3 | 4048 | /* Hierarchical information */ |
3e32cb2e JW |
4049 | memory = memsw = PAGE_COUNTER_MAX; |
4050 | for (mi = memcg; mi; mi = parent_mem_cgroup(mi)) { | |
15b42562 CD |
4051 | memory = min(memory, READ_ONCE(mi->memory.max)); |
4052 | memsw = min(memsw, READ_ONCE(mi->memsw.max)); | |
fee7b548 | 4053 | } |
3e32cb2e JW |
4054 | seq_printf(m, "hierarchical_memory_limit %llu\n", |
4055 | (u64)memory * PAGE_SIZE); | |
7941d214 | 4056 | if (do_memsw_account()) |
3e32cb2e JW |
4057 | seq_printf(m, "hierarchical_memsw_limit %llu\n", |
4058 | (u64)memsw * PAGE_SIZE); | |
7f016ee8 | 4059 | |
8de7ecc6 | 4060 | for (i = 0; i < ARRAY_SIZE(memcg1_stats); i++) { |
7de2e9f1 | 4061 | unsigned long nr; |
4062 | ||
71cd3113 | 4063 | if (memcg1_stats[i] == MEMCG_SWAP && !do_memsw_account()) |
1dd3a273 | 4064 | continue; |
7de2e9f1 | 4065 | nr = memcg_page_state(memcg, memcg1_stats[i]); |
8de7ecc6 | 4066 | seq_printf(m, "total_%s %llu\n", memcg1_stat_names[i], |
7de2e9f1 | 4067 | (u64)nr * PAGE_SIZE); |
af7c4b0e JW |
4068 | } |
4069 | ||
8de7ecc6 | 4070 | for (i = 0; i < ARRAY_SIZE(memcg1_events); i++) |
ebc5d83d KK |
4071 | seq_printf(m, "total_%s %llu\n", |
4072 | vm_event_name(memcg1_events[i]), | |
dd923990 | 4073 | (u64)memcg_events(memcg, memcg1_events[i])); |
af7c4b0e | 4074 | |
8de7ecc6 | 4075 | for (i = 0; i < NR_LRU_LISTS; i++) |
ebc5d83d | 4076 | seq_printf(m, "total_%s %llu\n", lru_list_name(i), |
42a30035 JW |
4077 | (u64)memcg_page_state(memcg, NR_LRU_BASE + i) * |
4078 | PAGE_SIZE); | |
14067bb3 | 4079 | |
7f016ee8 | 4080 | #ifdef CONFIG_DEBUG_VM |
7f016ee8 | 4081 | { |
ef8f2327 MG |
4082 | pg_data_t *pgdat; |
4083 | struct mem_cgroup_per_node *mz; | |
1431d4d1 JW |
4084 | unsigned long anon_cost = 0; |
4085 | unsigned long file_cost = 0; | |
7f016ee8 | 4086 | |
ef8f2327 | 4087 | for_each_online_pgdat(pgdat) { |
a3747b53 | 4088 | mz = memcg->nodeinfo[pgdat->node_id]; |
7f016ee8 | 4089 | |
1431d4d1 JW |
4090 | anon_cost += mz->lruvec.anon_cost; |
4091 | file_cost += mz->lruvec.file_cost; | |
ef8f2327 | 4092 | } |
1431d4d1 JW |
4093 | seq_printf(m, "anon_cost %lu\n", anon_cost); |
4094 | seq_printf(m, "file_cost %lu\n", file_cost); | |
7f016ee8 KM |
4095 | } |
4096 | #endif | |
4097 | ||
d2ceb9b7 KH |
4098 | return 0; |
4099 | } | |
4100 | ||
182446d0 TH |
4101 | static u64 mem_cgroup_swappiness_read(struct cgroup_subsys_state *css, |
4102 | struct cftype *cft) | |
a7885eb8 | 4103 | { |
182446d0 | 4104 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
a7885eb8 | 4105 | |
1f4c025b | 4106 | return mem_cgroup_swappiness(memcg); |
a7885eb8 KM |
4107 | } |
4108 | ||
182446d0 TH |
4109 | static int mem_cgroup_swappiness_write(struct cgroup_subsys_state *css, |
4110 | struct cftype *cft, u64 val) | |
a7885eb8 | 4111 | { |
182446d0 | 4112 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
a7885eb8 | 4113 | |
37bc3cb9 | 4114 | if (val > 200) |
a7885eb8 KM |
4115 | return -EINVAL; |
4116 | ||
a4792030 | 4117 | if (!mem_cgroup_is_root(memcg)) |
3dae7fec JW |
4118 | memcg->swappiness = val; |
4119 | else | |
4120 | vm_swappiness = val; | |
068b38c1 | 4121 | |
a7885eb8 KM |
4122 | return 0; |
4123 | } | |
4124 | ||
2e72b634 KS |
4125 | static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap) |
4126 | { | |
4127 | struct mem_cgroup_threshold_ary *t; | |
3e32cb2e | 4128 | unsigned long usage; |
2e72b634 KS |
4129 | int i; |
4130 | ||
4131 | rcu_read_lock(); | |
4132 | if (!swap) | |
2c488db2 | 4133 | t = rcu_dereference(memcg->thresholds.primary); |
2e72b634 | 4134 | else |
2c488db2 | 4135 | t = rcu_dereference(memcg->memsw_thresholds.primary); |
2e72b634 KS |
4136 | |
4137 | if (!t) | |
4138 | goto unlock; | |
4139 | ||
ce00a967 | 4140 | usage = mem_cgroup_usage(memcg, swap); |
2e72b634 KS |
4141 | |
4142 | /* | |
748dad36 | 4143 | * current_threshold points to threshold just below or equal to usage. |
2e72b634 KS |
4144 | * If it's not true, a threshold was crossed after last |
4145 | * call of __mem_cgroup_threshold(). | |
4146 | */ | |
5407a562 | 4147 | i = t->current_threshold; |
2e72b634 KS |
4148 | |
4149 | /* | |
4150 | * Iterate backward over array of thresholds starting from | |
4151 | * current_threshold and check if a threshold is crossed. | |
4152 | * If none of thresholds below usage is crossed, we read | |
4153 | * only one element of the array here. | |
4154 | */ | |
4155 | for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--) | |
4156 | eventfd_signal(t->entries[i].eventfd, 1); | |
4157 | ||
4158 | /* i = current_threshold + 1 */ | |
4159 | i++; | |
4160 | ||
4161 | /* | |
4162 | * Iterate forward over array of thresholds starting from | |
4163 | * current_threshold+1 and check if a threshold is crossed. | |
4164 | * If none of thresholds above usage is crossed, we read | |
4165 | * only one element of the array here. | |
4166 | */ | |
4167 | for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++) | |
4168 | eventfd_signal(t->entries[i].eventfd, 1); | |
4169 | ||
4170 | /* Update current_threshold */ | |
5407a562 | 4171 | t->current_threshold = i - 1; |
2e72b634 KS |
4172 | unlock: |
4173 | rcu_read_unlock(); | |
4174 | } | |
4175 | ||
4176 | static void mem_cgroup_threshold(struct mem_cgroup *memcg) | |
4177 | { | |
ad4ca5f4 KS |
4178 | while (memcg) { |
4179 | __mem_cgroup_threshold(memcg, false); | |
7941d214 | 4180 | if (do_memsw_account()) |
ad4ca5f4 KS |
4181 | __mem_cgroup_threshold(memcg, true); |
4182 | ||
4183 | memcg = parent_mem_cgroup(memcg); | |
4184 | } | |
2e72b634 KS |
4185 | } |
4186 | ||
4187 | static int compare_thresholds(const void *a, const void *b) | |
4188 | { | |
4189 | const struct mem_cgroup_threshold *_a = a; | |
4190 | const struct mem_cgroup_threshold *_b = b; | |
4191 | ||
2bff24a3 GT |
4192 | if (_a->threshold > _b->threshold) |
4193 | return 1; | |
4194 | ||
4195 | if (_a->threshold < _b->threshold) | |
4196 | return -1; | |
4197 | ||
4198 | return 0; | |
2e72b634 KS |
4199 | } |
4200 | ||
c0ff4b85 | 4201 | static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg) |
9490ff27 KH |
4202 | { |
4203 | struct mem_cgroup_eventfd_list *ev; | |
4204 | ||
2bcf2e92 MH |
4205 | spin_lock(&memcg_oom_lock); |
4206 | ||
c0ff4b85 | 4207 | list_for_each_entry(ev, &memcg->oom_notify, list) |
9490ff27 | 4208 | eventfd_signal(ev->eventfd, 1); |
2bcf2e92 MH |
4209 | |
4210 | spin_unlock(&memcg_oom_lock); | |
9490ff27 KH |
4211 | return 0; |
4212 | } | |
4213 | ||
c0ff4b85 | 4214 | static void mem_cgroup_oom_notify(struct mem_cgroup *memcg) |
9490ff27 | 4215 | { |
7d74b06f KH |
4216 | struct mem_cgroup *iter; |
4217 | ||
c0ff4b85 | 4218 | for_each_mem_cgroup_tree(iter, memcg) |
7d74b06f | 4219 | mem_cgroup_oom_notify_cb(iter); |
9490ff27 KH |
4220 | } |
4221 | ||
59b6f873 | 4222 | static int __mem_cgroup_usage_register_event(struct mem_cgroup *memcg, |
347c4a87 | 4223 | struct eventfd_ctx *eventfd, const char *args, enum res_type type) |
2e72b634 | 4224 | { |
2c488db2 KS |
4225 | struct mem_cgroup_thresholds *thresholds; |
4226 | struct mem_cgroup_threshold_ary *new; | |
3e32cb2e JW |
4227 | unsigned long threshold; |
4228 | unsigned long usage; | |
2c488db2 | 4229 | int i, size, ret; |
2e72b634 | 4230 | |
650c5e56 | 4231 | ret = page_counter_memparse(args, "-1", &threshold); |
2e72b634 KS |
4232 | if (ret) |
4233 | return ret; | |
4234 | ||
4235 | mutex_lock(&memcg->thresholds_lock); | |
2c488db2 | 4236 | |
05b84301 | 4237 | if (type == _MEM) { |
2c488db2 | 4238 | thresholds = &memcg->thresholds; |
ce00a967 | 4239 | usage = mem_cgroup_usage(memcg, false); |
05b84301 | 4240 | } else if (type == _MEMSWAP) { |
2c488db2 | 4241 | thresholds = &memcg->memsw_thresholds; |
ce00a967 | 4242 | usage = mem_cgroup_usage(memcg, true); |
05b84301 | 4243 | } else |
2e72b634 KS |
4244 | BUG(); |
4245 | ||
2e72b634 | 4246 | /* Check if a threshold crossed before adding a new one */ |
2c488db2 | 4247 | if (thresholds->primary) |
2e72b634 KS |
4248 | __mem_cgroup_threshold(memcg, type == _MEMSWAP); |
4249 | ||
2c488db2 | 4250 | size = thresholds->primary ? thresholds->primary->size + 1 : 1; |
2e72b634 KS |
4251 | |
4252 | /* Allocate memory for new array of thresholds */ | |
67b8046f | 4253 | new = kmalloc(struct_size(new, entries, size), GFP_KERNEL); |
2c488db2 | 4254 | if (!new) { |
2e72b634 KS |
4255 | ret = -ENOMEM; |
4256 | goto unlock; | |
4257 | } | |
2c488db2 | 4258 | new->size = size; |
2e72b634 KS |
4259 | |
4260 | /* Copy thresholds (if any) to new array */ | |
e90342e6 GS |
4261 | if (thresholds->primary) |
4262 | memcpy(new->entries, thresholds->primary->entries, | |
4263 | flex_array_size(new, entries, size - 1)); | |
2c488db2 | 4264 | |
2e72b634 | 4265 | /* Add new threshold */ |
2c488db2 KS |
4266 | new->entries[size - 1].eventfd = eventfd; |
4267 | new->entries[size - 1].threshold = threshold; | |
2e72b634 KS |
4268 | |
4269 | /* Sort thresholds. Registering of new threshold isn't time-critical */ | |
61e604e6 | 4270 | sort(new->entries, size, sizeof(*new->entries), |
2e72b634 KS |
4271 | compare_thresholds, NULL); |
4272 | ||
4273 | /* Find current threshold */ | |
2c488db2 | 4274 | new->current_threshold = -1; |
2e72b634 | 4275 | for (i = 0; i < size; i++) { |
748dad36 | 4276 | if (new->entries[i].threshold <= usage) { |
2e72b634 | 4277 | /* |
2c488db2 KS |
4278 | * new->current_threshold will not be used until |
4279 | * rcu_assign_pointer(), so it's safe to increment | |
2e72b634 KS |
4280 | * it here. |
4281 | */ | |
2c488db2 | 4282 | ++new->current_threshold; |
748dad36 SZ |
4283 | } else |
4284 | break; | |
2e72b634 KS |
4285 | } |
4286 | ||
2c488db2 KS |
4287 | /* Free old spare buffer and save old primary buffer as spare */ |
4288 | kfree(thresholds->spare); | |
4289 | thresholds->spare = thresholds->primary; | |
4290 | ||
4291 | rcu_assign_pointer(thresholds->primary, new); | |
2e72b634 | 4292 | |
907860ed | 4293 | /* To be sure that nobody uses thresholds */ |
2e72b634 KS |
4294 | synchronize_rcu(); |
4295 | ||
2e72b634 KS |
4296 | unlock: |
4297 | mutex_unlock(&memcg->thresholds_lock); | |
4298 | ||
4299 | return ret; | |
4300 | } | |
4301 | ||
59b6f873 | 4302 | static int mem_cgroup_usage_register_event(struct mem_cgroup *memcg, |
347c4a87 TH |
4303 | struct eventfd_ctx *eventfd, const char *args) |
4304 | { | |
59b6f873 | 4305 | return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEM); |
347c4a87 TH |
4306 | } |
4307 | ||
59b6f873 | 4308 | static int memsw_cgroup_usage_register_event(struct mem_cgroup *memcg, |
347c4a87 TH |
4309 | struct eventfd_ctx *eventfd, const char *args) |
4310 | { | |
59b6f873 | 4311 | return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEMSWAP); |
347c4a87 TH |
4312 | } |
4313 | ||
59b6f873 | 4314 | static void __mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg, |
347c4a87 | 4315 | struct eventfd_ctx *eventfd, enum res_type type) |
2e72b634 | 4316 | { |
2c488db2 KS |
4317 | struct mem_cgroup_thresholds *thresholds; |
4318 | struct mem_cgroup_threshold_ary *new; | |
3e32cb2e | 4319 | unsigned long usage; |
7d36665a | 4320 | int i, j, size, entries; |
2e72b634 KS |
4321 | |
4322 | mutex_lock(&memcg->thresholds_lock); | |
05b84301 JW |
4323 | |
4324 | if (type == _MEM) { | |
2c488db2 | 4325 | thresholds = &memcg->thresholds; |
ce00a967 | 4326 | usage = mem_cgroup_usage(memcg, false); |
05b84301 | 4327 | } else if (type == _MEMSWAP) { |
2c488db2 | 4328 | thresholds = &memcg->memsw_thresholds; |
ce00a967 | 4329 | usage = mem_cgroup_usage(memcg, true); |
05b84301 | 4330 | } else |
2e72b634 KS |
4331 | BUG(); |
4332 | ||
371528ca AV |
4333 | if (!thresholds->primary) |
4334 | goto unlock; | |
4335 | ||
2e72b634 KS |
4336 | /* Check if a threshold crossed before removing */ |
4337 | __mem_cgroup_threshold(memcg, type == _MEMSWAP); | |
4338 | ||
4339 | /* Calculate new number of threshold */ | |
7d36665a | 4340 | size = entries = 0; |
2c488db2 KS |
4341 | for (i = 0; i < thresholds->primary->size; i++) { |
4342 | if (thresholds->primary->entries[i].eventfd != eventfd) | |
2e72b634 | 4343 | size++; |
7d36665a CX |
4344 | else |
4345 | entries++; | |
2e72b634 KS |
4346 | } |
4347 | ||
2c488db2 | 4348 | new = thresholds->spare; |
907860ed | 4349 | |
7d36665a CX |
4350 | /* If no items related to eventfd have been cleared, nothing to do */ |
4351 | if (!entries) | |
4352 | goto unlock; | |
4353 | ||
2e72b634 KS |
4354 | /* Set thresholds array to NULL if we don't have thresholds */ |
4355 | if (!size) { | |
2c488db2 KS |
4356 | kfree(new); |
4357 | new = NULL; | |
907860ed | 4358 | goto swap_buffers; |
2e72b634 KS |
4359 | } |
4360 | ||
2c488db2 | 4361 | new->size = size; |
2e72b634 KS |
4362 | |
4363 | /* Copy thresholds and find current threshold */ | |
2c488db2 KS |
4364 | new->current_threshold = -1; |
4365 | for (i = 0, j = 0; i < thresholds->primary->size; i++) { | |
4366 | if (thresholds->primary->entries[i].eventfd == eventfd) | |
2e72b634 KS |
4367 | continue; |
4368 | ||
2c488db2 | 4369 | new->entries[j] = thresholds->primary->entries[i]; |
748dad36 | 4370 | if (new->entries[j].threshold <= usage) { |
2e72b634 | 4371 | /* |
2c488db2 | 4372 | * new->current_threshold will not be used |
2e72b634 KS |
4373 | * until rcu_assign_pointer(), so it's safe to increment |
4374 | * it here. | |
4375 | */ | |
2c488db2 | 4376 | ++new->current_threshold; |
2e72b634 KS |
4377 | } |
4378 | j++; | |
4379 | } | |
4380 | ||
907860ed | 4381 | swap_buffers: |
2c488db2 KS |
4382 | /* Swap primary and spare array */ |
4383 | thresholds->spare = thresholds->primary; | |
8c757763 | 4384 | |
2c488db2 | 4385 | rcu_assign_pointer(thresholds->primary, new); |
2e72b634 | 4386 | |
907860ed | 4387 | /* To be sure that nobody uses thresholds */ |
2e72b634 | 4388 | synchronize_rcu(); |
6611d8d7 MC |
4389 | |
4390 | /* If all events are unregistered, free the spare array */ | |
4391 | if (!new) { | |
4392 | kfree(thresholds->spare); | |
4393 | thresholds->spare = NULL; | |
4394 | } | |
371528ca | 4395 | unlock: |
2e72b634 | 4396 | mutex_unlock(&memcg->thresholds_lock); |
2e72b634 | 4397 | } |
c1e862c1 | 4398 | |
59b6f873 | 4399 | static void mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg, |
347c4a87 TH |
4400 | struct eventfd_ctx *eventfd) |
4401 | { | |
59b6f873 | 4402 | return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEM); |
347c4a87 TH |
4403 | } |
4404 | ||
59b6f873 | 4405 | static void memsw_cgroup_usage_unregister_event(struct mem_cgroup *memcg, |
347c4a87 TH |
4406 | struct eventfd_ctx *eventfd) |
4407 | { | |
59b6f873 | 4408 | return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEMSWAP); |
347c4a87 TH |
4409 | } |
4410 | ||
59b6f873 | 4411 | static int mem_cgroup_oom_register_event(struct mem_cgroup *memcg, |
347c4a87 | 4412 | struct eventfd_ctx *eventfd, const char *args) |
9490ff27 | 4413 | { |
9490ff27 | 4414 | struct mem_cgroup_eventfd_list *event; |
9490ff27 | 4415 | |
9490ff27 KH |
4416 | event = kmalloc(sizeof(*event), GFP_KERNEL); |
4417 | if (!event) | |
4418 | return -ENOMEM; | |
4419 | ||
1af8efe9 | 4420 | spin_lock(&memcg_oom_lock); |
9490ff27 KH |
4421 | |
4422 | event->eventfd = eventfd; | |
4423 | list_add(&event->list, &memcg->oom_notify); | |
4424 | ||
4425 | /* already in OOM ? */ | |
c2b42d3c | 4426 | if (memcg->under_oom) |
9490ff27 | 4427 | eventfd_signal(eventfd, 1); |
1af8efe9 | 4428 | spin_unlock(&memcg_oom_lock); |
9490ff27 KH |
4429 | |
4430 | return 0; | |
4431 | } | |
4432 | ||
59b6f873 | 4433 | static void mem_cgroup_oom_unregister_event(struct mem_cgroup *memcg, |
347c4a87 | 4434 | struct eventfd_ctx *eventfd) |
9490ff27 | 4435 | { |
9490ff27 | 4436 | struct mem_cgroup_eventfd_list *ev, *tmp; |
9490ff27 | 4437 | |
1af8efe9 | 4438 | spin_lock(&memcg_oom_lock); |
9490ff27 | 4439 | |
c0ff4b85 | 4440 | list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) { |
9490ff27 KH |
4441 | if (ev->eventfd == eventfd) { |
4442 | list_del(&ev->list); | |
4443 | kfree(ev); | |
4444 | } | |
4445 | } | |
4446 | ||
1af8efe9 | 4447 | spin_unlock(&memcg_oom_lock); |
9490ff27 KH |
4448 | } |
4449 | ||
2da8ca82 | 4450 | static int mem_cgroup_oom_control_read(struct seq_file *sf, void *v) |
3c11ecf4 | 4451 | { |
aa9694bb | 4452 | struct mem_cgroup *memcg = mem_cgroup_from_seq(sf); |
3c11ecf4 | 4453 | |
791badbd | 4454 | seq_printf(sf, "oom_kill_disable %d\n", memcg->oom_kill_disable); |
c2b42d3c | 4455 | seq_printf(sf, "under_oom %d\n", (bool)memcg->under_oom); |
fe6bdfc8 RG |
4456 | seq_printf(sf, "oom_kill %lu\n", |
4457 | atomic_long_read(&memcg->memory_events[MEMCG_OOM_KILL])); | |
3c11ecf4 KH |
4458 | return 0; |
4459 | } | |
4460 | ||
182446d0 | 4461 | static int mem_cgroup_oom_control_write(struct cgroup_subsys_state *css, |
3c11ecf4 KH |
4462 | struct cftype *cft, u64 val) |
4463 | { | |
182446d0 | 4464 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
3c11ecf4 KH |
4465 | |
4466 | /* cannot set to root cgroup and only 0 and 1 are allowed */ | |
a4792030 | 4467 | if (mem_cgroup_is_root(memcg) || !((val == 0) || (val == 1))) |
3c11ecf4 KH |
4468 | return -EINVAL; |
4469 | ||
c0ff4b85 | 4470 | memcg->oom_kill_disable = val; |
4d845ebf | 4471 | if (!val) |
c0ff4b85 | 4472 | memcg_oom_recover(memcg); |
3dae7fec | 4473 | |
3c11ecf4 KH |
4474 | return 0; |
4475 | } | |
4476 | ||
52ebea74 TH |
4477 | #ifdef CONFIG_CGROUP_WRITEBACK |
4478 | ||
3a8e9ac8 TH |
4479 | #include <trace/events/writeback.h> |
4480 | ||
841710aa TH |
4481 | static int memcg_wb_domain_init(struct mem_cgroup *memcg, gfp_t gfp) |
4482 | { | |
4483 | return wb_domain_init(&memcg->cgwb_domain, gfp); | |
4484 | } | |
4485 | ||
4486 | static void memcg_wb_domain_exit(struct mem_cgroup *memcg) | |
4487 | { | |
4488 | wb_domain_exit(&memcg->cgwb_domain); | |
4489 | } | |
4490 | ||
2529bb3a TH |
4491 | static void memcg_wb_domain_size_changed(struct mem_cgroup *memcg) |
4492 | { | |
4493 | wb_domain_size_changed(&memcg->cgwb_domain); | |
4494 | } | |
4495 | ||
841710aa TH |
4496 | struct wb_domain *mem_cgroup_wb_domain(struct bdi_writeback *wb) |
4497 | { | |
4498 | struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css); | |
4499 | ||
4500 | if (!memcg->css.parent) | |
4501 | return NULL; | |
4502 | ||
4503 | return &memcg->cgwb_domain; | |
4504 | } | |
4505 | ||
c2aa723a TH |
4506 | /** |
4507 | * mem_cgroup_wb_stats - retrieve writeback related stats from its memcg | |
4508 | * @wb: bdi_writeback in question | |
c5edf9cd TH |
4509 | * @pfilepages: out parameter for number of file pages |
4510 | * @pheadroom: out parameter for number of allocatable pages according to memcg | |
c2aa723a TH |
4511 | * @pdirty: out parameter for number of dirty pages |
4512 | * @pwriteback: out parameter for number of pages under writeback | |
4513 | * | |
c5edf9cd TH |
4514 | * Determine the numbers of file, headroom, dirty, and writeback pages in |
4515 | * @wb's memcg. File, dirty and writeback are self-explanatory. Headroom | |
4516 | * is a bit more involved. | |
c2aa723a | 4517 | * |
c5edf9cd TH |
4518 | * A memcg's headroom is "min(max, high) - used". In the hierarchy, the |
4519 | * headroom is calculated as the lowest headroom of itself and the | |
4520 | * ancestors. Note that this doesn't consider the actual amount of | |
4521 | * available memory in the system. The caller should further cap | |
4522 | * *@pheadroom accordingly. | |
c2aa723a | 4523 | */ |
c5edf9cd TH |
4524 | void mem_cgroup_wb_stats(struct bdi_writeback *wb, unsigned long *pfilepages, |
4525 | unsigned long *pheadroom, unsigned long *pdirty, | |
4526 | unsigned long *pwriteback) | |
c2aa723a TH |
4527 | { |
4528 | struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css); | |
4529 | struct mem_cgroup *parent; | |
c2aa723a | 4530 | |
909fc739 | 4531 | mem_cgroup_flush_stats(); |
c2aa723a | 4532 | |
2d146aa3 JW |
4533 | *pdirty = memcg_page_state(memcg, NR_FILE_DIRTY); |
4534 | *pwriteback = memcg_page_state(memcg, NR_WRITEBACK); | |
4535 | *pfilepages = memcg_page_state(memcg, NR_INACTIVE_FILE) + | |
4536 | memcg_page_state(memcg, NR_ACTIVE_FILE); | |
c2aa723a | 4537 | |
2d146aa3 | 4538 | *pheadroom = PAGE_COUNTER_MAX; |
c2aa723a | 4539 | while ((parent = parent_mem_cgroup(memcg))) { |
15b42562 | 4540 | unsigned long ceiling = min(READ_ONCE(memcg->memory.max), |
d1663a90 | 4541 | READ_ONCE(memcg->memory.high)); |
c2aa723a TH |
4542 | unsigned long used = page_counter_read(&memcg->memory); |
4543 | ||
c5edf9cd | 4544 | *pheadroom = min(*pheadroom, ceiling - min(ceiling, used)); |
c2aa723a TH |
4545 | memcg = parent; |
4546 | } | |
c2aa723a TH |
4547 | } |
4548 | ||
97b27821 TH |
4549 | /* |
4550 | * Foreign dirty flushing | |
4551 | * | |
4552 | * There's an inherent mismatch between memcg and writeback. The former | |
f0953a1b | 4553 | * tracks ownership per-page while the latter per-inode. This was a |
97b27821 TH |
4554 | * deliberate design decision because honoring per-page ownership in the |
4555 | * writeback path is complicated, may lead to higher CPU and IO overheads | |
4556 | * and deemed unnecessary given that write-sharing an inode across | |
4557 | * different cgroups isn't a common use-case. | |
4558 | * | |
4559 | * Combined with inode majority-writer ownership switching, this works well | |
4560 | * enough in most cases but there are some pathological cases. For | |
4561 | * example, let's say there are two cgroups A and B which keep writing to | |
4562 | * different but confined parts of the same inode. B owns the inode and | |
4563 | * A's memory is limited far below B's. A's dirty ratio can rise enough to | |
4564 | * trigger balance_dirty_pages() sleeps but B's can be low enough to avoid | |
4565 | * triggering background writeback. A will be slowed down without a way to | |
4566 | * make writeback of the dirty pages happen. | |
4567 | * | |
f0953a1b | 4568 | * Conditions like the above can lead to a cgroup getting repeatedly and |
97b27821 | 4569 | * severely throttled after making some progress after each |
f0953a1b | 4570 | * dirty_expire_interval while the underlying IO device is almost |
97b27821 TH |
4571 | * completely idle. |
4572 | * | |
4573 | * Solving this problem completely requires matching the ownership tracking | |
4574 | * granularities between memcg and writeback in either direction. However, | |
4575 | * the more egregious behaviors can be avoided by simply remembering the | |
4576 | * most recent foreign dirtying events and initiating remote flushes on | |
4577 | * them when local writeback isn't enough to keep the memory clean enough. | |
4578 | * | |
4579 | * The following two functions implement such mechanism. When a foreign | |
4580 | * page - a page whose memcg and writeback ownerships don't match - is | |
4581 | * dirtied, mem_cgroup_track_foreign_dirty() records the inode owning | |
4582 | * bdi_writeback on the page owning memcg. When balance_dirty_pages() | |
4583 | * decides that the memcg needs to sleep due to high dirty ratio, it calls | |
4584 | * mem_cgroup_flush_foreign() which queues writeback on the recorded | |
4585 | * foreign bdi_writebacks which haven't expired. Both the numbers of | |
4586 | * recorded bdi_writebacks and concurrent in-flight foreign writebacks are | |
4587 | * limited to MEMCG_CGWB_FRN_CNT. | |
4588 | * | |
4589 | * The mechanism only remembers IDs and doesn't hold any object references. | |
4590 | * As being wrong occasionally doesn't matter, updates and accesses to the | |
4591 | * records are lockless and racy. | |
4592 | */ | |
4593 | void mem_cgroup_track_foreign_dirty_slowpath(struct page *page, | |
4594 | struct bdi_writeback *wb) | |
4595 | { | |
bcfe06bf | 4596 | struct mem_cgroup *memcg = page_memcg(page); |
97b27821 TH |
4597 | struct memcg_cgwb_frn *frn; |
4598 | u64 now = get_jiffies_64(); | |
4599 | u64 oldest_at = now; | |
4600 | int oldest = -1; | |
4601 | int i; | |
4602 | ||
3a8e9ac8 TH |
4603 | trace_track_foreign_dirty(page, wb); |
4604 | ||
97b27821 TH |
4605 | /* |
4606 | * Pick the slot to use. If there is already a slot for @wb, keep | |
4607 | * using it. If not replace the oldest one which isn't being | |
4608 | * written out. | |
4609 | */ | |
4610 | for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++) { | |
4611 | frn = &memcg->cgwb_frn[i]; | |
4612 | if (frn->bdi_id == wb->bdi->id && | |
4613 | frn->memcg_id == wb->memcg_css->id) | |
4614 | break; | |
4615 | if (time_before64(frn->at, oldest_at) && | |
4616 | atomic_read(&frn->done.cnt) == 1) { | |
4617 | oldest = i; | |
4618 | oldest_at = frn->at; | |
4619 | } | |
4620 | } | |
4621 | ||
4622 | if (i < MEMCG_CGWB_FRN_CNT) { | |
4623 | /* | |
4624 | * Re-using an existing one. Update timestamp lazily to | |
4625 | * avoid making the cacheline hot. We want them to be | |
4626 | * reasonably up-to-date and significantly shorter than | |
4627 | * dirty_expire_interval as that's what expires the record. | |
4628 | * Use the shorter of 1s and dirty_expire_interval / 8. | |
4629 | */ | |
4630 | unsigned long update_intv = | |
4631 | min_t(unsigned long, HZ, | |
4632 | msecs_to_jiffies(dirty_expire_interval * 10) / 8); | |
4633 | ||
4634 | if (time_before64(frn->at, now - update_intv)) | |
4635 | frn->at = now; | |
4636 | } else if (oldest >= 0) { | |
4637 | /* replace the oldest free one */ | |
4638 | frn = &memcg->cgwb_frn[oldest]; | |
4639 | frn->bdi_id = wb->bdi->id; | |
4640 | frn->memcg_id = wb->memcg_css->id; | |
4641 | frn->at = now; | |
4642 | } | |
4643 | } | |
4644 | ||
4645 | /* issue foreign writeback flushes for recorded foreign dirtying events */ | |
4646 | void mem_cgroup_flush_foreign(struct bdi_writeback *wb) | |
4647 | { | |
4648 | struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css); | |
4649 | unsigned long intv = msecs_to_jiffies(dirty_expire_interval * 10); | |
4650 | u64 now = jiffies_64; | |
4651 | int i; | |
4652 | ||
4653 | for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++) { | |
4654 | struct memcg_cgwb_frn *frn = &memcg->cgwb_frn[i]; | |
4655 | ||
4656 | /* | |
4657 | * If the record is older than dirty_expire_interval, | |
4658 | * writeback on it has already started. No need to kick it | |
4659 | * off again. Also, don't start a new one if there's | |
4660 | * already one in flight. | |
4661 | */ | |
4662 | if (time_after64(frn->at, now - intv) && | |
4663 | atomic_read(&frn->done.cnt) == 1) { | |
4664 | frn->at = 0; | |
3a8e9ac8 | 4665 | trace_flush_foreign(wb, frn->bdi_id, frn->memcg_id); |
7490a2d2 | 4666 | cgroup_writeback_by_id(frn->bdi_id, frn->memcg_id, |
97b27821 TH |
4667 | WB_REASON_FOREIGN_FLUSH, |
4668 | &frn->done); | |
4669 | } | |
4670 | } | |
4671 | } | |
4672 | ||
841710aa TH |
4673 | #else /* CONFIG_CGROUP_WRITEBACK */ |
4674 | ||
4675 | static int memcg_wb_domain_init(struct mem_cgroup *memcg, gfp_t gfp) | |
4676 | { | |
4677 | return 0; | |
4678 | } | |
4679 | ||
4680 | static void memcg_wb_domain_exit(struct mem_cgroup *memcg) | |
4681 | { | |
4682 | } | |
4683 | ||
2529bb3a TH |
4684 | static void memcg_wb_domain_size_changed(struct mem_cgroup *memcg) |
4685 | { | |
4686 | } | |
4687 | ||
52ebea74 TH |
4688 | #endif /* CONFIG_CGROUP_WRITEBACK */ |
4689 | ||
3bc942f3 TH |
4690 | /* |
4691 | * DO NOT USE IN NEW FILES. | |
4692 | * | |
4693 | * "cgroup.event_control" implementation. | |
4694 | * | |
4695 | * This is way over-engineered. It tries to support fully configurable | |
4696 | * events for each user. Such level of flexibility is completely | |
4697 | * unnecessary especially in the light of the planned unified hierarchy. | |
4698 | * | |
4699 | * Please deprecate this and replace with something simpler if at all | |
4700 | * possible. | |
4701 | */ | |
4702 | ||
79bd9814 TH |
4703 | /* |
4704 | * Unregister event and free resources. | |
4705 | * | |
4706 | * Gets called from workqueue. | |
4707 | */ | |
3bc942f3 | 4708 | static void memcg_event_remove(struct work_struct *work) |
79bd9814 | 4709 | { |
3bc942f3 TH |
4710 | struct mem_cgroup_event *event = |
4711 | container_of(work, struct mem_cgroup_event, remove); | |
59b6f873 | 4712 | struct mem_cgroup *memcg = event->memcg; |
79bd9814 TH |
4713 | |
4714 | remove_wait_queue(event->wqh, &event->wait); | |
4715 | ||
59b6f873 | 4716 | event->unregister_event(memcg, event->eventfd); |
79bd9814 TH |
4717 | |
4718 | /* Notify userspace the event is going away. */ | |
4719 | eventfd_signal(event->eventfd, 1); | |
4720 | ||
4721 | eventfd_ctx_put(event->eventfd); | |
4722 | kfree(event); | |
59b6f873 | 4723 | css_put(&memcg->css); |
79bd9814 TH |
4724 | } |
4725 | ||
4726 | /* | |
a9a08845 | 4727 | * Gets called on EPOLLHUP on eventfd when user closes it. |
79bd9814 TH |
4728 | * |
4729 | * Called with wqh->lock held and interrupts disabled. | |
4730 | */ | |
ac6424b9 | 4731 | static int memcg_event_wake(wait_queue_entry_t *wait, unsigned mode, |
3bc942f3 | 4732 | int sync, void *key) |
79bd9814 | 4733 | { |
3bc942f3 TH |
4734 | struct mem_cgroup_event *event = |
4735 | container_of(wait, struct mem_cgroup_event, wait); | |
59b6f873 | 4736 | struct mem_cgroup *memcg = event->memcg; |
3ad6f93e | 4737 | __poll_t flags = key_to_poll(key); |
79bd9814 | 4738 | |
a9a08845 | 4739 | if (flags & EPOLLHUP) { |
79bd9814 TH |
4740 | /* |
4741 | * If the event has been detached at cgroup removal, we | |
4742 | * can simply return knowing the other side will cleanup | |
4743 | * for us. | |
4744 | * | |
4745 | * We can't race against event freeing since the other | |
4746 | * side will require wqh->lock via remove_wait_queue(), | |
4747 | * which we hold. | |
4748 | */ | |
fba94807 | 4749 | spin_lock(&memcg->event_list_lock); |
79bd9814 TH |
4750 | if (!list_empty(&event->list)) { |
4751 | list_del_init(&event->list); | |
4752 | /* | |
4753 | * We are in atomic context, but cgroup_event_remove() | |
4754 | * may sleep, so we have to call it in workqueue. | |
4755 | */ | |
4756 | schedule_work(&event->remove); | |
4757 | } | |
fba94807 | 4758 | spin_unlock(&memcg->event_list_lock); |
79bd9814 TH |
4759 | } |
4760 | ||
4761 | return 0; | |
4762 | } | |
4763 | ||
3bc942f3 | 4764 | static void memcg_event_ptable_queue_proc(struct file *file, |
79bd9814 TH |
4765 | wait_queue_head_t *wqh, poll_table *pt) |
4766 | { | |
3bc942f3 TH |
4767 | struct mem_cgroup_event *event = |
4768 | container_of(pt, struct mem_cgroup_event, pt); | |
79bd9814 TH |
4769 | |
4770 | event->wqh = wqh; | |
4771 | add_wait_queue(wqh, &event->wait); | |
4772 | } | |
4773 | ||
4774 | /* | |
3bc942f3 TH |
4775 | * DO NOT USE IN NEW FILES. |
4776 | * | |
79bd9814 TH |
4777 | * Parse input and register new cgroup event handler. |
4778 | * | |
4779 | * Input must be in format '<event_fd> <control_fd> <args>'. | |
4780 | * Interpretation of args is defined by control file implementation. | |
4781 | */ | |
451af504 TH |
4782 | static ssize_t memcg_write_event_control(struct kernfs_open_file *of, |
4783 | char *buf, size_t nbytes, loff_t off) | |
79bd9814 | 4784 | { |
451af504 | 4785 | struct cgroup_subsys_state *css = of_css(of); |
fba94807 | 4786 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
3bc942f3 | 4787 | struct mem_cgroup_event *event; |
79bd9814 TH |
4788 | struct cgroup_subsys_state *cfile_css; |
4789 | unsigned int efd, cfd; | |
4790 | struct fd efile; | |
4791 | struct fd cfile; | |
fba94807 | 4792 | const char *name; |
79bd9814 TH |
4793 | char *endp; |
4794 | int ret; | |
4795 | ||
451af504 TH |
4796 | buf = strstrip(buf); |
4797 | ||
4798 | efd = simple_strtoul(buf, &endp, 10); | |
79bd9814 TH |
4799 | if (*endp != ' ') |
4800 | return -EINVAL; | |
451af504 | 4801 | buf = endp + 1; |
79bd9814 | 4802 | |
451af504 | 4803 | cfd = simple_strtoul(buf, &endp, 10); |
79bd9814 TH |
4804 | if ((*endp != ' ') && (*endp != '\0')) |
4805 | return -EINVAL; | |
451af504 | 4806 | buf = endp + 1; |
79bd9814 TH |
4807 | |
4808 | event = kzalloc(sizeof(*event), GFP_KERNEL); | |
4809 | if (!event) | |
4810 | return -ENOMEM; | |
4811 | ||
59b6f873 | 4812 | event->memcg = memcg; |
79bd9814 | 4813 | INIT_LIST_HEAD(&event->list); |
3bc942f3 TH |
4814 | init_poll_funcptr(&event->pt, memcg_event_ptable_queue_proc); |
4815 | init_waitqueue_func_entry(&event->wait, memcg_event_wake); | |
4816 | INIT_WORK(&event->remove, memcg_event_remove); | |
79bd9814 TH |
4817 | |
4818 | efile = fdget(efd); | |
4819 | if (!efile.file) { | |
4820 | ret = -EBADF; | |
4821 | goto out_kfree; | |
4822 | } | |
4823 | ||
4824 | event->eventfd = eventfd_ctx_fileget(efile.file); | |
4825 | if (IS_ERR(event->eventfd)) { | |
4826 | ret = PTR_ERR(event->eventfd); | |
4827 | goto out_put_efile; | |
4828 | } | |
4829 | ||
4830 | cfile = fdget(cfd); | |
4831 | if (!cfile.file) { | |
4832 | ret = -EBADF; | |
4833 | goto out_put_eventfd; | |
4834 | } | |
4835 | ||
4836 | /* the process need read permission on control file */ | |
4837 | /* AV: shouldn't we check that it's been opened for read instead? */ | |
02f92b38 | 4838 | ret = file_permission(cfile.file, MAY_READ); |
79bd9814 TH |
4839 | if (ret < 0) |
4840 | goto out_put_cfile; | |
4841 | ||
fba94807 TH |
4842 | /* |
4843 | * Determine the event callbacks and set them in @event. This used | |
4844 | * to be done via struct cftype but cgroup core no longer knows | |
4845 | * about these events. The following is crude but the whole thing | |
4846 | * is for compatibility anyway. | |
3bc942f3 TH |
4847 | * |
4848 | * DO NOT ADD NEW FILES. | |
fba94807 | 4849 | */ |
b583043e | 4850 | name = cfile.file->f_path.dentry->d_name.name; |
fba94807 TH |
4851 | |
4852 | if (!strcmp(name, "memory.usage_in_bytes")) { | |
4853 | event->register_event = mem_cgroup_usage_register_event; | |
4854 | event->unregister_event = mem_cgroup_usage_unregister_event; | |
4855 | } else if (!strcmp(name, "memory.oom_control")) { | |
4856 | event->register_event = mem_cgroup_oom_register_event; | |
4857 | event->unregister_event = mem_cgroup_oom_unregister_event; | |
4858 | } else if (!strcmp(name, "memory.pressure_level")) { | |
4859 | event->register_event = vmpressure_register_event; | |
4860 | event->unregister_event = vmpressure_unregister_event; | |
4861 | } else if (!strcmp(name, "memory.memsw.usage_in_bytes")) { | |
347c4a87 TH |
4862 | event->register_event = memsw_cgroup_usage_register_event; |
4863 | event->unregister_event = memsw_cgroup_usage_unregister_event; | |
fba94807 TH |
4864 | } else { |
4865 | ret = -EINVAL; | |
4866 | goto out_put_cfile; | |
4867 | } | |
4868 | ||
79bd9814 | 4869 | /* |
b5557c4c TH |
4870 | * Verify @cfile should belong to @css. Also, remaining events are |
4871 | * automatically removed on cgroup destruction but the removal is | |
4872 | * asynchronous, so take an extra ref on @css. | |
79bd9814 | 4873 | */ |
b583043e | 4874 | cfile_css = css_tryget_online_from_dir(cfile.file->f_path.dentry->d_parent, |
ec903c0c | 4875 | &memory_cgrp_subsys); |
79bd9814 | 4876 | ret = -EINVAL; |
5a17f543 | 4877 | if (IS_ERR(cfile_css)) |
79bd9814 | 4878 | goto out_put_cfile; |
5a17f543 TH |
4879 | if (cfile_css != css) { |
4880 | css_put(cfile_css); | |
79bd9814 | 4881 | goto out_put_cfile; |
5a17f543 | 4882 | } |
79bd9814 | 4883 | |
451af504 | 4884 | ret = event->register_event(memcg, event->eventfd, buf); |
79bd9814 TH |
4885 | if (ret) |
4886 | goto out_put_css; | |
4887 | ||
9965ed17 | 4888 | vfs_poll(efile.file, &event->pt); |
79bd9814 | 4889 | |
4ba9515d | 4890 | spin_lock_irq(&memcg->event_list_lock); |
fba94807 | 4891 | list_add(&event->list, &memcg->event_list); |
4ba9515d | 4892 | spin_unlock_irq(&memcg->event_list_lock); |
79bd9814 TH |
4893 | |
4894 | fdput(cfile); | |
4895 | fdput(efile); | |
4896 | ||
451af504 | 4897 | return nbytes; |
79bd9814 TH |
4898 | |
4899 | out_put_css: | |
b5557c4c | 4900 | css_put(css); |
79bd9814 TH |
4901 | out_put_cfile: |
4902 | fdput(cfile); | |
4903 | out_put_eventfd: | |
4904 | eventfd_ctx_put(event->eventfd); | |
4905 | out_put_efile: | |
4906 | fdput(efile); | |
4907 | out_kfree: | |
4908 | kfree(event); | |
4909 | ||
4910 | return ret; | |
4911 | } | |
4912 | ||
241994ed | 4913 | static struct cftype mem_cgroup_legacy_files[] = { |
8cdea7c0 | 4914 | { |
0eea1030 | 4915 | .name = "usage_in_bytes", |
8c7c6e34 | 4916 | .private = MEMFILE_PRIVATE(_MEM, RES_USAGE), |
791badbd | 4917 | .read_u64 = mem_cgroup_read_u64, |
8cdea7c0 | 4918 | }, |
c84872e1 PE |
4919 | { |
4920 | .name = "max_usage_in_bytes", | |
8c7c6e34 | 4921 | .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE), |
6770c64e | 4922 | .write = mem_cgroup_reset, |
791badbd | 4923 | .read_u64 = mem_cgroup_read_u64, |
c84872e1 | 4924 | }, |
8cdea7c0 | 4925 | { |
0eea1030 | 4926 | .name = "limit_in_bytes", |
8c7c6e34 | 4927 | .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT), |
451af504 | 4928 | .write = mem_cgroup_write, |
791badbd | 4929 | .read_u64 = mem_cgroup_read_u64, |
8cdea7c0 | 4930 | }, |
296c81d8 BS |
4931 | { |
4932 | .name = "soft_limit_in_bytes", | |
4933 | .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT), | |
451af504 | 4934 | .write = mem_cgroup_write, |
791badbd | 4935 | .read_u64 = mem_cgroup_read_u64, |
296c81d8 | 4936 | }, |
8cdea7c0 BS |
4937 | { |
4938 | .name = "failcnt", | |
8c7c6e34 | 4939 | .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT), |
6770c64e | 4940 | .write = mem_cgroup_reset, |
791badbd | 4941 | .read_u64 = mem_cgroup_read_u64, |
8cdea7c0 | 4942 | }, |
d2ceb9b7 KH |
4943 | { |
4944 | .name = "stat", | |
2da8ca82 | 4945 | .seq_show = memcg_stat_show, |
d2ceb9b7 | 4946 | }, |
c1e862c1 KH |
4947 | { |
4948 | .name = "force_empty", | |
6770c64e | 4949 | .write = mem_cgroup_force_empty_write, |
c1e862c1 | 4950 | }, |
18f59ea7 BS |
4951 | { |
4952 | .name = "use_hierarchy", | |
4953 | .write_u64 = mem_cgroup_hierarchy_write, | |
4954 | .read_u64 = mem_cgroup_hierarchy_read, | |
4955 | }, | |
79bd9814 | 4956 | { |
3bc942f3 | 4957 | .name = "cgroup.event_control", /* XXX: for compat */ |
451af504 | 4958 | .write = memcg_write_event_control, |
7dbdb199 | 4959 | .flags = CFTYPE_NO_PREFIX | CFTYPE_WORLD_WRITABLE, |
79bd9814 | 4960 | }, |
a7885eb8 KM |
4961 | { |
4962 | .name = "swappiness", | |
4963 | .read_u64 = mem_cgroup_swappiness_read, | |
4964 | .write_u64 = mem_cgroup_swappiness_write, | |
4965 | }, | |
7dc74be0 DN |
4966 | { |
4967 | .name = "move_charge_at_immigrate", | |
4968 | .read_u64 = mem_cgroup_move_charge_read, | |
4969 | .write_u64 = mem_cgroup_move_charge_write, | |
4970 | }, | |
9490ff27 KH |
4971 | { |
4972 | .name = "oom_control", | |
2da8ca82 | 4973 | .seq_show = mem_cgroup_oom_control_read, |
3c11ecf4 | 4974 | .write_u64 = mem_cgroup_oom_control_write, |
9490ff27 KH |
4975 | .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL), |
4976 | }, | |
70ddf637 AV |
4977 | { |
4978 | .name = "pressure_level", | |
70ddf637 | 4979 | }, |
406eb0c9 YH |
4980 | #ifdef CONFIG_NUMA |
4981 | { | |
4982 | .name = "numa_stat", | |
2da8ca82 | 4983 | .seq_show = memcg_numa_stat_show, |
406eb0c9 YH |
4984 | }, |
4985 | #endif | |
510fc4e1 GC |
4986 | { |
4987 | .name = "kmem.limit_in_bytes", | |
4988 | .private = MEMFILE_PRIVATE(_KMEM, RES_LIMIT), | |
451af504 | 4989 | .write = mem_cgroup_write, |
791badbd | 4990 | .read_u64 = mem_cgroup_read_u64, |
510fc4e1 GC |
4991 | }, |
4992 | { | |
4993 | .name = "kmem.usage_in_bytes", | |
4994 | .private = MEMFILE_PRIVATE(_KMEM, RES_USAGE), | |
791badbd | 4995 | .read_u64 = mem_cgroup_read_u64, |
510fc4e1 GC |
4996 | }, |
4997 | { | |
4998 | .name = "kmem.failcnt", | |
4999 | .private = MEMFILE_PRIVATE(_KMEM, RES_FAILCNT), | |
6770c64e | 5000 | .write = mem_cgroup_reset, |
791badbd | 5001 | .read_u64 = mem_cgroup_read_u64, |
510fc4e1 GC |
5002 | }, |
5003 | { | |
5004 | .name = "kmem.max_usage_in_bytes", | |
5005 | .private = MEMFILE_PRIVATE(_KMEM, RES_MAX_USAGE), | |
6770c64e | 5006 | .write = mem_cgroup_reset, |
791badbd | 5007 | .read_u64 = mem_cgroup_read_u64, |
510fc4e1 | 5008 | }, |
a87425a3 YS |
5009 | #if defined(CONFIG_MEMCG_KMEM) && \ |
5010 | (defined(CONFIG_SLAB) || defined(CONFIG_SLUB_DEBUG)) | |
749c5415 GC |
5011 | { |
5012 | .name = "kmem.slabinfo", | |
b047501c | 5013 | .seq_show = memcg_slab_show, |
749c5415 GC |
5014 | }, |
5015 | #endif | |
d55f90bf VD |
5016 | { |
5017 | .name = "kmem.tcp.limit_in_bytes", | |
5018 | .private = MEMFILE_PRIVATE(_TCP, RES_LIMIT), | |
5019 | .write = mem_cgroup_write, | |
5020 | .read_u64 = mem_cgroup_read_u64, | |
5021 | }, | |
5022 | { | |
5023 | .name = "kmem.tcp.usage_in_bytes", | |
5024 | .private = MEMFILE_PRIVATE(_TCP, RES_USAGE), | |
5025 | .read_u64 = mem_cgroup_read_u64, | |
5026 | }, | |
5027 | { | |
5028 | .name = "kmem.tcp.failcnt", | |
5029 | .private = MEMFILE_PRIVATE(_TCP, RES_FAILCNT), | |
5030 | .write = mem_cgroup_reset, | |
5031 | .read_u64 = mem_cgroup_read_u64, | |
5032 | }, | |
5033 | { | |
5034 | .name = "kmem.tcp.max_usage_in_bytes", | |
5035 | .private = MEMFILE_PRIVATE(_TCP, RES_MAX_USAGE), | |
5036 | .write = mem_cgroup_reset, | |
5037 | .read_u64 = mem_cgroup_read_u64, | |
5038 | }, | |
6bc10349 | 5039 | { }, /* terminate */ |
af36f906 | 5040 | }; |
8c7c6e34 | 5041 | |
73f576c0 JW |
5042 | /* |
5043 | * Private memory cgroup IDR | |
5044 | * | |
5045 | * Swap-out records and page cache shadow entries need to store memcg | |
5046 | * references in constrained space, so we maintain an ID space that is | |
5047 | * limited to 16 bit (MEM_CGROUP_ID_MAX), limiting the total number of | |
5048 | * memory-controlled cgroups to 64k. | |
5049 | * | |
b8f2935f | 5050 | * However, there usually are many references to the offline CSS after |
73f576c0 JW |
5051 | * the cgroup has been destroyed, such as page cache or reclaimable |
5052 | * slab objects, that don't need to hang on to the ID. We want to keep | |
5053 | * those dead CSS from occupying IDs, or we might quickly exhaust the | |
5054 | * relatively small ID space and prevent the creation of new cgroups | |
5055 | * even when there are much fewer than 64k cgroups - possibly none. | |
5056 | * | |
5057 | * Maintain a private 16-bit ID space for memcg, and allow the ID to | |
5058 | * be freed and recycled when it's no longer needed, which is usually | |
5059 | * when the CSS is offlined. | |
5060 | * | |
5061 | * The only exception to that are records of swapped out tmpfs/shmem | |
5062 | * pages that need to be attributed to live ancestors on swapin. But | |
5063 | * those references are manageable from userspace. | |
5064 | */ | |
5065 | ||
5066 | static DEFINE_IDR(mem_cgroup_idr); | |
5067 | ||
7e97de0b KT |
5068 | static void mem_cgroup_id_remove(struct mem_cgroup *memcg) |
5069 | { | |
5070 | if (memcg->id.id > 0) { | |
5071 | idr_remove(&mem_cgroup_idr, memcg->id.id); | |
5072 | memcg->id.id = 0; | |
5073 | } | |
5074 | } | |
5075 | ||
c1514c0a VF |
5076 | static void __maybe_unused mem_cgroup_id_get_many(struct mem_cgroup *memcg, |
5077 | unsigned int n) | |
73f576c0 | 5078 | { |
1c2d479a | 5079 | refcount_add(n, &memcg->id.ref); |
73f576c0 JW |
5080 | } |
5081 | ||
615d66c3 | 5082 | static void mem_cgroup_id_put_many(struct mem_cgroup *memcg, unsigned int n) |
73f576c0 | 5083 | { |
1c2d479a | 5084 | if (refcount_sub_and_test(n, &memcg->id.ref)) { |
7e97de0b | 5085 | mem_cgroup_id_remove(memcg); |
73f576c0 JW |
5086 | |
5087 | /* Memcg ID pins CSS */ | |
5088 | css_put(&memcg->css); | |
5089 | } | |
5090 | } | |
5091 | ||
615d66c3 VD |
5092 | static inline void mem_cgroup_id_put(struct mem_cgroup *memcg) |
5093 | { | |
5094 | mem_cgroup_id_put_many(memcg, 1); | |
5095 | } | |
5096 | ||
73f576c0 JW |
5097 | /** |
5098 | * mem_cgroup_from_id - look up a memcg from a memcg id | |
5099 | * @id: the memcg id to look up | |
5100 | * | |
5101 | * Caller must hold rcu_read_lock(). | |
5102 | */ | |
5103 | struct mem_cgroup *mem_cgroup_from_id(unsigned short id) | |
5104 | { | |
5105 | WARN_ON_ONCE(!rcu_read_lock_held()); | |
5106 | return idr_find(&mem_cgroup_idr, id); | |
5107 | } | |
5108 | ||
ef8f2327 | 5109 | static int alloc_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node) |
6d12e2d8 KH |
5110 | { |
5111 | struct mem_cgroup_per_node *pn; | |
ef8f2327 | 5112 | int tmp = node; |
1ecaab2b KH |
5113 | /* |
5114 | * This routine is called against possible nodes. | |
5115 | * But it's BUG to call kmalloc() against offline node. | |
5116 | * | |
5117 | * TODO: this routine can waste much memory for nodes which will | |
5118 | * never be onlined. It's better to use memory hotplug callback | |
5119 | * function. | |
5120 | */ | |
41e3355d KH |
5121 | if (!node_state(node, N_NORMAL_MEMORY)) |
5122 | tmp = -1; | |
17295c88 | 5123 | pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp); |
6d12e2d8 KH |
5124 | if (!pn) |
5125 | return 1; | |
1ecaab2b | 5126 | |
7e1c0d6f SB |
5127 | pn->lruvec_stats_percpu = alloc_percpu_gfp(struct lruvec_stats_percpu, |
5128 | GFP_KERNEL_ACCOUNT); | |
5129 | if (!pn->lruvec_stats_percpu) { | |
00f3ca2c JW |
5130 | kfree(pn); |
5131 | return 1; | |
5132 | } | |
5133 | ||
ef8f2327 MG |
5134 | lruvec_init(&pn->lruvec); |
5135 | pn->usage_in_excess = 0; | |
5136 | pn->on_tree = false; | |
5137 | pn->memcg = memcg; | |
5138 | ||
54f72fe0 | 5139 | memcg->nodeinfo[node] = pn; |
6d12e2d8 KH |
5140 | return 0; |
5141 | } | |
5142 | ||
ef8f2327 | 5143 | static void free_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node) |
1ecaab2b | 5144 | { |
00f3ca2c JW |
5145 | struct mem_cgroup_per_node *pn = memcg->nodeinfo[node]; |
5146 | ||
4eaf431f MH |
5147 | if (!pn) |
5148 | return; | |
5149 | ||
7e1c0d6f | 5150 | free_percpu(pn->lruvec_stats_percpu); |
00f3ca2c | 5151 | kfree(pn); |
1ecaab2b KH |
5152 | } |
5153 | ||
40e952f9 | 5154 | static void __mem_cgroup_free(struct mem_cgroup *memcg) |
59927fb9 | 5155 | { |
c8b2a36f | 5156 | int node; |
59927fb9 | 5157 | |
c8b2a36f | 5158 | for_each_node(node) |
ef8f2327 | 5159 | free_mem_cgroup_per_node_info(memcg, node); |
871789d4 | 5160 | free_percpu(memcg->vmstats_percpu); |
8ff69e2c | 5161 | kfree(memcg); |
59927fb9 | 5162 | } |
3afe36b1 | 5163 | |
40e952f9 TE |
5164 | static void mem_cgroup_free(struct mem_cgroup *memcg) |
5165 | { | |
5166 | memcg_wb_domain_exit(memcg); | |
5167 | __mem_cgroup_free(memcg); | |
5168 | } | |
5169 | ||
0b8f73e1 | 5170 | static struct mem_cgroup *mem_cgroup_alloc(void) |
8cdea7c0 | 5171 | { |
d142e3e6 | 5172 | struct mem_cgroup *memcg; |
b9726c26 | 5173 | unsigned int size; |
6d12e2d8 | 5174 | int node; |
97b27821 | 5175 | int __maybe_unused i; |
11d67612 | 5176 | long error = -ENOMEM; |
8cdea7c0 | 5177 | |
0b8f73e1 JW |
5178 | size = sizeof(struct mem_cgroup); |
5179 | size += nr_node_ids * sizeof(struct mem_cgroup_per_node *); | |
5180 | ||
5181 | memcg = kzalloc(size, GFP_KERNEL); | |
c0ff4b85 | 5182 | if (!memcg) |
11d67612 | 5183 | return ERR_PTR(error); |
0b8f73e1 | 5184 | |
73f576c0 JW |
5185 | memcg->id.id = idr_alloc(&mem_cgroup_idr, NULL, |
5186 | 1, MEM_CGROUP_ID_MAX, | |
5187 | GFP_KERNEL); | |
11d67612 YS |
5188 | if (memcg->id.id < 0) { |
5189 | error = memcg->id.id; | |
73f576c0 | 5190 | goto fail; |
11d67612 | 5191 | } |
73f576c0 | 5192 | |
3e38e0aa RG |
5193 | memcg->vmstats_percpu = alloc_percpu_gfp(struct memcg_vmstats_percpu, |
5194 | GFP_KERNEL_ACCOUNT); | |
871789d4 | 5195 | if (!memcg->vmstats_percpu) |
0b8f73e1 | 5196 | goto fail; |
78fb7466 | 5197 | |
3ed28fa1 | 5198 | for_each_node(node) |
ef8f2327 | 5199 | if (alloc_mem_cgroup_per_node_info(memcg, node)) |
0b8f73e1 | 5200 | goto fail; |
f64c3f54 | 5201 | |
0b8f73e1 JW |
5202 | if (memcg_wb_domain_init(memcg, GFP_KERNEL)) |
5203 | goto fail; | |
28dbc4b6 | 5204 | |
f7e1cb6e | 5205 | INIT_WORK(&memcg->high_work, high_work_func); |
d142e3e6 | 5206 | INIT_LIST_HEAD(&memcg->oom_notify); |
d142e3e6 GC |
5207 | mutex_init(&memcg->thresholds_lock); |
5208 | spin_lock_init(&memcg->move_lock); | |
70ddf637 | 5209 | vmpressure_init(&memcg->vmpressure); |
fba94807 TH |
5210 | INIT_LIST_HEAD(&memcg->event_list); |
5211 | spin_lock_init(&memcg->event_list_lock); | |
d886f4e4 | 5212 | memcg->socket_pressure = jiffies; |
84c07d11 | 5213 | #ifdef CONFIG_MEMCG_KMEM |
900a38f0 | 5214 | memcg->kmemcg_id = -1; |
bf4f0599 | 5215 | INIT_LIST_HEAD(&memcg->objcg_list); |
900a38f0 | 5216 | #endif |
52ebea74 TH |
5217 | #ifdef CONFIG_CGROUP_WRITEBACK |
5218 | INIT_LIST_HEAD(&memcg->cgwb_list); | |
97b27821 TH |
5219 | for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++) |
5220 | memcg->cgwb_frn[i].done = | |
5221 | __WB_COMPLETION_INIT(&memcg_cgwb_frn_waitq); | |
87eaceb3 YS |
5222 | #endif |
5223 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE | |
5224 | spin_lock_init(&memcg->deferred_split_queue.split_queue_lock); | |
5225 | INIT_LIST_HEAD(&memcg->deferred_split_queue.split_queue); | |
5226 | memcg->deferred_split_queue.split_queue_len = 0; | |
52ebea74 | 5227 | #endif |
73f576c0 | 5228 | idr_replace(&mem_cgroup_idr, memcg, memcg->id.id); |
0b8f73e1 JW |
5229 | return memcg; |
5230 | fail: | |
7e97de0b | 5231 | mem_cgroup_id_remove(memcg); |
40e952f9 | 5232 | __mem_cgroup_free(memcg); |
11d67612 | 5233 | return ERR_PTR(error); |
d142e3e6 GC |
5234 | } |
5235 | ||
0b8f73e1 JW |
5236 | static struct cgroup_subsys_state * __ref |
5237 | mem_cgroup_css_alloc(struct cgroup_subsys_state *parent_css) | |
d142e3e6 | 5238 | { |
0b8f73e1 | 5239 | struct mem_cgroup *parent = mem_cgroup_from_css(parent_css); |
b87d8cef | 5240 | struct mem_cgroup *memcg, *old_memcg; |
0b8f73e1 | 5241 | long error = -ENOMEM; |
d142e3e6 | 5242 | |
b87d8cef | 5243 | old_memcg = set_active_memcg(parent); |
0b8f73e1 | 5244 | memcg = mem_cgroup_alloc(); |
b87d8cef | 5245 | set_active_memcg(old_memcg); |
11d67612 YS |
5246 | if (IS_ERR(memcg)) |
5247 | return ERR_CAST(memcg); | |
d142e3e6 | 5248 | |
d1663a90 | 5249 | page_counter_set_high(&memcg->memory, PAGE_COUNTER_MAX); |
0b8f73e1 | 5250 | memcg->soft_limit = PAGE_COUNTER_MAX; |
4b82ab4f | 5251 | page_counter_set_high(&memcg->swap, PAGE_COUNTER_MAX); |
0b8f73e1 JW |
5252 | if (parent) { |
5253 | memcg->swappiness = mem_cgroup_swappiness(parent); | |
5254 | memcg->oom_kill_disable = parent->oom_kill_disable; | |
bef8620c | 5255 | |
3e32cb2e | 5256 | page_counter_init(&memcg->memory, &parent->memory); |
37e84351 | 5257 | page_counter_init(&memcg->swap, &parent->swap); |
3e32cb2e | 5258 | page_counter_init(&memcg->kmem, &parent->kmem); |
0db15298 | 5259 | page_counter_init(&memcg->tcpmem, &parent->tcpmem); |
18f59ea7 | 5260 | } else { |
bef8620c RG |
5261 | page_counter_init(&memcg->memory, NULL); |
5262 | page_counter_init(&memcg->swap, NULL); | |
5263 | page_counter_init(&memcg->kmem, NULL); | |
5264 | page_counter_init(&memcg->tcpmem, NULL); | |
d6441637 | 5265 | |
0b8f73e1 JW |
5266 | root_mem_cgroup = memcg; |
5267 | return &memcg->css; | |
5268 | } | |
5269 | ||
bef8620c | 5270 | /* The following stuff does not apply to the root */ |
b313aeee | 5271 | error = memcg_online_kmem(memcg); |
0b8f73e1 JW |
5272 | if (error) |
5273 | goto fail; | |
127424c8 | 5274 | |
f7e1cb6e | 5275 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_nosocket) |
ef12947c | 5276 | static_branch_inc(&memcg_sockets_enabled_key); |
f7e1cb6e | 5277 | |
0b8f73e1 JW |
5278 | return &memcg->css; |
5279 | fail: | |
7e97de0b | 5280 | mem_cgroup_id_remove(memcg); |
0b8f73e1 | 5281 | mem_cgroup_free(memcg); |
11d67612 | 5282 | return ERR_PTR(error); |
0b8f73e1 JW |
5283 | } |
5284 | ||
73f576c0 | 5285 | static int mem_cgroup_css_online(struct cgroup_subsys_state *css) |
0b8f73e1 | 5286 | { |
58fa2a55 VD |
5287 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
5288 | ||
0a4465d3 | 5289 | /* |
e4262c4f | 5290 | * A memcg must be visible for expand_shrinker_info() |
0a4465d3 KT |
5291 | * by the time the maps are allocated. So, we allocate maps |
5292 | * here, when for_each_mem_cgroup() can't skip it. | |
5293 | */ | |
e4262c4f | 5294 | if (alloc_shrinker_info(memcg)) { |
0a4465d3 KT |
5295 | mem_cgroup_id_remove(memcg); |
5296 | return -ENOMEM; | |
5297 | } | |
5298 | ||
73f576c0 | 5299 | /* Online state pins memcg ID, memcg ID pins CSS */ |
1c2d479a | 5300 | refcount_set(&memcg->id.ref, 1); |
73f576c0 | 5301 | css_get(css); |
aa48e47e SB |
5302 | |
5303 | if (unlikely(mem_cgroup_is_root(memcg))) | |
5304 | queue_delayed_work(system_unbound_wq, &stats_flush_dwork, | |
5305 | 2UL*HZ); | |
2f7dd7a4 | 5306 | return 0; |
8cdea7c0 BS |
5307 | } |
5308 | ||
eb95419b | 5309 | static void mem_cgroup_css_offline(struct cgroup_subsys_state *css) |
df878fb0 | 5310 | { |
eb95419b | 5311 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
3bc942f3 | 5312 | struct mem_cgroup_event *event, *tmp; |
79bd9814 TH |
5313 | |
5314 | /* | |
5315 | * Unregister events and notify userspace. | |
5316 | * Notify userspace about cgroup removing only after rmdir of cgroup | |
5317 | * directory to avoid race between userspace and kernelspace. | |
5318 | */ | |
4ba9515d | 5319 | spin_lock_irq(&memcg->event_list_lock); |
fba94807 | 5320 | list_for_each_entry_safe(event, tmp, &memcg->event_list, list) { |
79bd9814 TH |
5321 | list_del_init(&event->list); |
5322 | schedule_work(&event->remove); | |
5323 | } | |
4ba9515d | 5324 | spin_unlock_irq(&memcg->event_list_lock); |
ec64f515 | 5325 | |
bf8d5d52 | 5326 | page_counter_set_min(&memcg->memory, 0); |
23067153 | 5327 | page_counter_set_low(&memcg->memory, 0); |
63677c74 | 5328 | |
567e9ab2 | 5329 | memcg_offline_kmem(memcg); |
a178015c | 5330 | reparent_shrinker_deferred(memcg); |
52ebea74 | 5331 | wb_memcg_offline(memcg); |
73f576c0 | 5332 | |
591edfb1 RG |
5333 | drain_all_stock(memcg); |
5334 | ||
73f576c0 | 5335 | mem_cgroup_id_put(memcg); |
df878fb0 KH |
5336 | } |
5337 | ||
6df38689 VD |
5338 | static void mem_cgroup_css_released(struct cgroup_subsys_state *css) |
5339 | { | |
5340 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); | |
5341 | ||
5342 | invalidate_reclaim_iterators(memcg); | |
5343 | } | |
5344 | ||
eb95419b | 5345 | static void mem_cgroup_css_free(struct cgroup_subsys_state *css) |
8cdea7c0 | 5346 | { |
eb95419b | 5347 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
97b27821 | 5348 | int __maybe_unused i; |
c268e994 | 5349 | |
97b27821 TH |
5350 | #ifdef CONFIG_CGROUP_WRITEBACK |
5351 | for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++) | |
5352 | wb_wait_for_completion(&memcg->cgwb_frn[i].done); | |
5353 | #endif | |
f7e1cb6e | 5354 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_nosocket) |
ef12947c | 5355 | static_branch_dec(&memcg_sockets_enabled_key); |
127424c8 | 5356 | |
0db15298 | 5357 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && memcg->tcpmem_active) |
d55f90bf | 5358 | static_branch_dec(&memcg_sockets_enabled_key); |
3893e302 | 5359 | |
0b8f73e1 JW |
5360 | vmpressure_cleanup(&memcg->vmpressure); |
5361 | cancel_work_sync(&memcg->high_work); | |
5362 | mem_cgroup_remove_from_trees(memcg); | |
e4262c4f | 5363 | free_shrinker_info(memcg); |
d886f4e4 | 5364 | memcg_free_kmem(memcg); |
0b8f73e1 | 5365 | mem_cgroup_free(memcg); |
8cdea7c0 BS |
5366 | } |
5367 | ||
1ced953b TH |
5368 | /** |
5369 | * mem_cgroup_css_reset - reset the states of a mem_cgroup | |
5370 | * @css: the target css | |
5371 | * | |
5372 | * Reset the states of the mem_cgroup associated with @css. This is | |
5373 | * invoked when the userland requests disabling on the default hierarchy | |
5374 | * but the memcg is pinned through dependency. The memcg should stop | |
5375 | * applying policies and should revert to the vanilla state as it may be | |
5376 | * made visible again. | |
5377 | * | |
5378 | * The current implementation only resets the essential configurations. | |
5379 | * This needs to be expanded to cover all the visible parts. | |
5380 | */ | |
5381 | static void mem_cgroup_css_reset(struct cgroup_subsys_state *css) | |
5382 | { | |
5383 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); | |
5384 | ||
bbec2e15 RG |
5385 | page_counter_set_max(&memcg->memory, PAGE_COUNTER_MAX); |
5386 | page_counter_set_max(&memcg->swap, PAGE_COUNTER_MAX); | |
bbec2e15 RG |
5387 | page_counter_set_max(&memcg->kmem, PAGE_COUNTER_MAX); |
5388 | page_counter_set_max(&memcg->tcpmem, PAGE_COUNTER_MAX); | |
bf8d5d52 | 5389 | page_counter_set_min(&memcg->memory, 0); |
23067153 | 5390 | page_counter_set_low(&memcg->memory, 0); |
d1663a90 | 5391 | page_counter_set_high(&memcg->memory, PAGE_COUNTER_MAX); |
24d404dc | 5392 | memcg->soft_limit = PAGE_COUNTER_MAX; |
4b82ab4f | 5393 | page_counter_set_high(&memcg->swap, PAGE_COUNTER_MAX); |
2529bb3a | 5394 | memcg_wb_domain_size_changed(memcg); |
1ced953b TH |
5395 | } |
5396 | ||
2d146aa3 JW |
5397 | static void mem_cgroup_css_rstat_flush(struct cgroup_subsys_state *css, int cpu) |
5398 | { | |
5399 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); | |
5400 | struct mem_cgroup *parent = parent_mem_cgroup(memcg); | |
5401 | struct memcg_vmstats_percpu *statc; | |
5402 | long delta, v; | |
7e1c0d6f | 5403 | int i, nid; |
2d146aa3 JW |
5404 | |
5405 | statc = per_cpu_ptr(memcg->vmstats_percpu, cpu); | |
5406 | ||
5407 | for (i = 0; i < MEMCG_NR_STAT; i++) { | |
5408 | /* | |
5409 | * Collect the aggregated propagation counts of groups | |
5410 | * below us. We're in a per-cpu loop here and this is | |
5411 | * a global counter, so the first cycle will get them. | |
5412 | */ | |
5413 | delta = memcg->vmstats.state_pending[i]; | |
5414 | if (delta) | |
5415 | memcg->vmstats.state_pending[i] = 0; | |
5416 | ||
5417 | /* Add CPU changes on this level since the last flush */ | |
5418 | v = READ_ONCE(statc->state[i]); | |
5419 | if (v != statc->state_prev[i]) { | |
5420 | delta += v - statc->state_prev[i]; | |
5421 | statc->state_prev[i] = v; | |
5422 | } | |
5423 | ||
5424 | if (!delta) | |
5425 | continue; | |
5426 | ||
5427 | /* Aggregate counts on this level and propagate upwards */ | |
5428 | memcg->vmstats.state[i] += delta; | |
5429 | if (parent) | |
5430 | parent->vmstats.state_pending[i] += delta; | |
5431 | } | |
5432 | ||
5433 | for (i = 0; i < NR_VM_EVENT_ITEMS; i++) { | |
5434 | delta = memcg->vmstats.events_pending[i]; | |
5435 | if (delta) | |
5436 | memcg->vmstats.events_pending[i] = 0; | |
5437 | ||
5438 | v = READ_ONCE(statc->events[i]); | |
5439 | if (v != statc->events_prev[i]) { | |
5440 | delta += v - statc->events_prev[i]; | |
5441 | statc->events_prev[i] = v; | |
5442 | } | |
5443 | ||
5444 | if (!delta) | |
5445 | continue; | |
5446 | ||
5447 | memcg->vmstats.events[i] += delta; | |
5448 | if (parent) | |
5449 | parent->vmstats.events_pending[i] += delta; | |
5450 | } | |
7e1c0d6f SB |
5451 | |
5452 | for_each_node_state(nid, N_MEMORY) { | |
5453 | struct mem_cgroup_per_node *pn = memcg->nodeinfo[nid]; | |
5454 | struct mem_cgroup_per_node *ppn = NULL; | |
5455 | struct lruvec_stats_percpu *lstatc; | |
5456 | ||
5457 | if (parent) | |
5458 | ppn = parent->nodeinfo[nid]; | |
5459 | ||
5460 | lstatc = per_cpu_ptr(pn->lruvec_stats_percpu, cpu); | |
5461 | ||
5462 | for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++) { | |
5463 | delta = pn->lruvec_stats.state_pending[i]; | |
5464 | if (delta) | |
5465 | pn->lruvec_stats.state_pending[i] = 0; | |
5466 | ||
5467 | v = READ_ONCE(lstatc->state[i]); | |
5468 | if (v != lstatc->state_prev[i]) { | |
5469 | delta += v - lstatc->state_prev[i]; | |
5470 | lstatc->state_prev[i] = v; | |
5471 | } | |
5472 | ||
5473 | if (!delta) | |
5474 | continue; | |
5475 | ||
5476 | pn->lruvec_stats.state[i] += delta; | |
5477 | if (ppn) | |
5478 | ppn->lruvec_stats.state_pending[i] += delta; | |
5479 | } | |
5480 | } | |
2d146aa3 JW |
5481 | } |
5482 | ||
02491447 | 5483 | #ifdef CONFIG_MMU |
7dc74be0 | 5484 | /* Handlers for move charge at task migration. */ |
854ffa8d | 5485 | static int mem_cgroup_do_precharge(unsigned long count) |
7dc74be0 | 5486 | { |
05b84301 | 5487 | int ret; |
9476db97 | 5488 | |
d0164adc MG |
5489 | /* Try a single bulk charge without reclaim first, kswapd may wake */ |
5490 | ret = try_charge(mc.to, GFP_KERNEL & ~__GFP_DIRECT_RECLAIM, count); | |
9476db97 | 5491 | if (!ret) { |
854ffa8d | 5492 | mc.precharge += count; |
854ffa8d DN |
5493 | return ret; |
5494 | } | |
9476db97 | 5495 | |
3674534b | 5496 | /* Try charges one by one with reclaim, but do not retry */ |
854ffa8d | 5497 | while (count--) { |
3674534b | 5498 | ret = try_charge(mc.to, GFP_KERNEL | __GFP_NORETRY, 1); |
38c5d72f | 5499 | if (ret) |
38c5d72f | 5500 | return ret; |
854ffa8d | 5501 | mc.precharge++; |
9476db97 | 5502 | cond_resched(); |
854ffa8d | 5503 | } |
9476db97 | 5504 | return 0; |
4ffef5fe DN |
5505 | } |
5506 | ||
4ffef5fe DN |
5507 | union mc_target { |
5508 | struct page *page; | |
02491447 | 5509 | swp_entry_t ent; |
4ffef5fe DN |
5510 | }; |
5511 | ||
4ffef5fe | 5512 | enum mc_target_type { |
8d32ff84 | 5513 | MC_TARGET_NONE = 0, |
4ffef5fe | 5514 | MC_TARGET_PAGE, |
02491447 | 5515 | MC_TARGET_SWAP, |
c733a828 | 5516 | MC_TARGET_DEVICE, |
4ffef5fe DN |
5517 | }; |
5518 | ||
90254a65 DN |
5519 | static struct page *mc_handle_present_pte(struct vm_area_struct *vma, |
5520 | unsigned long addr, pte_t ptent) | |
4ffef5fe | 5521 | { |
25b2995a | 5522 | struct page *page = vm_normal_page(vma, addr, ptent); |
4ffef5fe | 5523 | |
90254a65 DN |
5524 | if (!page || !page_mapped(page)) |
5525 | return NULL; | |
5526 | if (PageAnon(page)) { | |
1dfab5ab | 5527 | if (!(mc.flags & MOVE_ANON)) |
90254a65 | 5528 | return NULL; |
1dfab5ab JW |
5529 | } else { |
5530 | if (!(mc.flags & MOVE_FILE)) | |
5531 | return NULL; | |
5532 | } | |
90254a65 DN |
5533 | if (!get_page_unless_zero(page)) |
5534 | return NULL; | |
5535 | ||
5536 | return page; | |
5537 | } | |
5538 | ||
c733a828 | 5539 | #if defined(CONFIG_SWAP) || defined(CONFIG_DEVICE_PRIVATE) |
90254a65 | 5540 | static struct page *mc_handle_swap_pte(struct vm_area_struct *vma, |
48406ef8 | 5541 | pte_t ptent, swp_entry_t *entry) |
90254a65 | 5542 | { |
90254a65 DN |
5543 | struct page *page = NULL; |
5544 | swp_entry_t ent = pte_to_swp_entry(ptent); | |
5545 | ||
9a137153 | 5546 | if (!(mc.flags & MOVE_ANON)) |
90254a65 | 5547 | return NULL; |
c733a828 JG |
5548 | |
5549 | /* | |
5550 | * Handle MEMORY_DEVICE_PRIVATE which are ZONE_DEVICE page belonging to | |
5551 | * a device and because they are not accessible by CPU they are store | |
5552 | * as special swap entry in the CPU page table. | |
5553 | */ | |
5554 | if (is_device_private_entry(ent)) { | |
af5cdaf8 | 5555 | page = pfn_swap_entry_to_page(ent); |
c733a828 JG |
5556 | /* |
5557 | * MEMORY_DEVICE_PRIVATE means ZONE_DEVICE page and which have | |
5558 | * a refcount of 1 when free (unlike normal page) | |
5559 | */ | |
5560 | if (!page_ref_add_unless(page, 1, 1)) | |
5561 | return NULL; | |
5562 | return page; | |
5563 | } | |
5564 | ||
9a137153 RC |
5565 | if (non_swap_entry(ent)) |
5566 | return NULL; | |
5567 | ||
4b91355e KH |
5568 | /* |
5569 | * Because lookup_swap_cache() updates some statistics counter, | |
5570 | * we call find_get_page() with swapper_space directly. | |
5571 | */ | |
f6ab1f7f | 5572 | page = find_get_page(swap_address_space(ent), swp_offset(ent)); |
2d1c4980 | 5573 | entry->val = ent.val; |
90254a65 DN |
5574 | |
5575 | return page; | |
5576 | } | |
4b91355e KH |
5577 | #else |
5578 | static struct page *mc_handle_swap_pte(struct vm_area_struct *vma, | |
48406ef8 | 5579 | pte_t ptent, swp_entry_t *entry) |
4b91355e KH |
5580 | { |
5581 | return NULL; | |
5582 | } | |
5583 | #endif | |
90254a65 | 5584 | |
87946a72 DN |
5585 | static struct page *mc_handle_file_pte(struct vm_area_struct *vma, |
5586 | unsigned long addr, pte_t ptent, swp_entry_t *entry) | |
5587 | { | |
87946a72 DN |
5588 | if (!vma->vm_file) /* anonymous vma */ |
5589 | return NULL; | |
1dfab5ab | 5590 | if (!(mc.flags & MOVE_FILE)) |
87946a72 DN |
5591 | return NULL; |
5592 | ||
87946a72 | 5593 | /* page is moved even if it's not RSS of this task(page-faulted). */ |
aa3b1895 | 5594 | /* shmem/tmpfs may report page out on swap: account for that too. */ |
f5df8635 MWO |
5595 | return find_get_incore_page(vma->vm_file->f_mapping, |
5596 | linear_page_index(vma, addr)); | |
87946a72 DN |
5597 | } |
5598 | ||
b1b0deab CG |
5599 | /** |
5600 | * mem_cgroup_move_account - move account of the page | |
5601 | * @page: the page | |
25843c2b | 5602 | * @compound: charge the page as compound or small page |
b1b0deab CG |
5603 | * @from: mem_cgroup which the page is moved from. |
5604 | * @to: mem_cgroup which the page is moved to. @from != @to. | |
5605 | * | |
3ac808fd | 5606 | * The caller must make sure the page is not on LRU (isolate_page() is useful.) |
b1b0deab CG |
5607 | * |
5608 | * This function doesn't do "charge" to new cgroup and doesn't do "uncharge" | |
5609 | * from old cgroup. | |
5610 | */ | |
5611 | static int mem_cgroup_move_account(struct page *page, | |
f627c2f5 | 5612 | bool compound, |
b1b0deab CG |
5613 | struct mem_cgroup *from, |
5614 | struct mem_cgroup *to) | |
5615 | { | |
ae8af438 KK |
5616 | struct lruvec *from_vec, *to_vec; |
5617 | struct pglist_data *pgdat; | |
6c357848 | 5618 | unsigned int nr_pages = compound ? thp_nr_pages(page) : 1; |
b1b0deab CG |
5619 | int ret; |
5620 | ||
5621 | VM_BUG_ON(from == to); | |
5622 | VM_BUG_ON_PAGE(PageLRU(page), page); | |
f627c2f5 | 5623 | VM_BUG_ON(compound && !PageTransHuge(page)); |
b1b0deab CG |
5624 | |
5625 | /* | |
6a93ca8f | 5626 | * Prevent mem_cgroup_migrate() from looking at |
bcfe06bf | 5627 | * page's memory cgroup of its source page while we change it. |
b1b0deab | 5628 | */ |
f627c2f5 | 5629 | ret = -EBUSY; |
b1b0deab CG |
5630 | if (!trylock_page(page)) |
5631 | goto out; | |
5632 | ||
5633 | ret = -EINVAL; | |
bcfe06bf | 5634 | if (page_memcg(page) != from) |
b1b0deab CG |
5635 | goto out_unlock; |
5636 | ||
ae8af438 | 5637 | pgdat = page_pgdat(page); |
867e5e1d JW |
5638 | from_vec = mem_cgroup_lruvec(from, pgdat); |
5639 | to_vec = mem_cgroup_lruvec(to, pgdat); | |
ae8af438 | 5640 | |
abb242f5 | 5641 | lock_page_memcg(page); |
b1b0deab | 5642 | |
be5d0a74 JW |
5643 | if (PageAnon(page)) { |
5644 | if (page_mapped(page)) { | |
5645 | __mod_lruvec_state(from_vec, NR_ANON_MAPPED, -nr_pages); | |
5646 | __mod_lruvec_state(to_vec, NR_ANON_MAPPED, nr_pages); | |
468c3982 | 5647 | if (PageTransHuge(page)) { |
69473e5d MS |
5648 | __mod_lruvec_state(from_vec, NR_ANON_THPS, |
5649 | -nr_pages); | |
5650 | __mod_lruvec_state(to_vec, NR_ANON_THPS, | |
5651 | nr_pages); | |
468c3982 | 5652 | } |
be5d0a74 JW |
5653 | } |
5654 | } else { | |
0d1c2072 JW |
5655 | __mod_lruvec_state(from_vec, NR_FILE_PAGES, -nr_pages); |
5656 | __mod_lruvec_state(to_vec, NR_FILE_PAGES, nr_pages); | |
5657 | ||
5658 | if (PageSwapBacked(page)) { | |
5659 | __mod_lruvec_state(from_vec, NR_SHMEM, -nr_pages); | |
5660 | __mod_lruvec_state(to_vec, NR_SHMEM, nr_pages); | |
5661 | } | |
5662 | ||
49e50d27 JW |
5663 | if (page_mapped(page)) { |
5664 | __mod_lruvec_state(from_vec, NR_FILE_MAPPED, -nr_pages); | |
5665 | __mod_lruvec_state(to_vec, NR_FILE_MAPPED, nr_pages); | |
5666 | } | |
b1b0deab | 5667 | |
49e50d27 JW |
5668 | if (PageDirty(page)) { |
5669 | struct address_space *mapping = page_mapping(page); | |
c4843a75 | 5670 | |
f56753ac | 5671 | if (mapping_can_writeback(mapping)) { |
49e50d27 JW |
5672 | __mod_lruvec_state(from_vec, NR_FILE_DIRTY, |
5673 | -nr_pages); | |
5674 | __mod_lruvec_state(to_vec, NR_FILE_DIRTY, | |
5675 | nr_pages); | |
5676 | } | |
c4843a75 GT |
5677 | } |
5678 | } | |
5679 | ||
b1b0deab | 5680 | if (PageWriteback(page)) { |
ae8af438 KK |
5681 | __mod_lruvec_state(from_vec, NR_WRITEBACK, -nr_pages); |
5682 | __mod_lruvec_state(to_vec, NR_WRITEBACK, nr_pages); | |
b1b0deab CG |
5683 | } |
5684 | ||
5685 | /* | |
abb242f5 JW |
5686 | * All state has been migrated, let's switch to the new memcg. |
5687 | * | |
bcfe06bf | 5688 | * It is safe to change page's memcg here because the page |
abb242f5 JW |
5689 | * is referenced, charged, isolated, and locked: we can't race |
5690 | * with (un)charging, migration, LRU putback, or anything else | |
bcfe06bf | 5691 | * that would rely on a stable page's memory cgroup. |
abb242f5 JW |
5692 | * |
5693 | * Note that lock_page_memcg is a memcg lock, not a page lock, | |
bcfe06bf | 5694 | * to save space. As soon as we switch page's memory cgroup to a |
abb242f5 JW |
5695 | * new memcg that isn't locked, the above state can change |
5696 | * concurrently again. Make sure we're truly done with it. | |
b1b0deab | 5697 | */ |
abb242f5 | 5698 | smp_mb(); |
b1b0deab | 5699 | |
1a3e1f40 JW |
5700 | css_get(&to->css); |
5701 | css_put(&from->css); | |
5702 | ||
bcfe06bf | 5703 | page->memcg_data = (unsigned long)to; |
87eaceb3 | 5704 | |
abb242f5 | 5705 | __unlock_page_memcg(from); |
b1b0deab CG |
5706 | |
5707 | ret = 0; | |
5708 | ||
5709 | local_irq_disable(); | |
3fba69a5 | 5710 | mem_cgroup_charge_statistics(to, page, nr_pages); |
b1b0deab | 5711 | memcg_check_events(to, page); |
3fba69a5 | 5712 | mem_cgroup_charge_statistics(from, page, -nr_pages); |
b1b0deab CG |
5713 | memcg_check_events(from, page); |
5714 | local_irq_enable(); | |
5715 | out_unlock: | |
5716 | unlock_page(page); | |
5717 | out: | |
5718 | return ret; | |
5719 | } | |
5720 | ||
7cf7806c LR |
5721 | /** |
5722 | * get_mctgt_type - get target type of moving charge | |
5723 | * @vma: the vma the pte to be checked belongs | |
5724 | * @addr: the address corresponding to the pte to be checked | |
5725 | * @ptent: the pte to be checked | |
5726 | * @target: the pointer the target page or swap ent will be stored(can be NULL) | |
5727 | * | |
5728 | * Returns | |
5729 | * 0(MC_TARGET_NONE): if the pte is not a target for move charge. | |
5730 | * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for | |
5731 | * move charge. if @target is not NULL, the page is stored in target->page | |
5732 | * with extra refcnt got(Callers should handle it). | |
5733 | * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a | |
5734 | * target for charge migration. if @target is not NULL, the entry is stored | |
5735 | * in target->ent. | |
25b2995a CH |
5736 | * 3(MC_TARGET_DEVICE): like MC_TARGET_PAGE but page is MEMORY_DEVICE_PRIVATE |
5737 | * (so ZONE_DEVICE page and thus not on the lru). | |
df6ad698 JG |
5738 | * For now we such page is charge like a regular page would be as for all |
5739 | * intent and purposes it is just special memory taking the place of a | |
5740 | * regular page. | |
c733a828 JG |
5741 | * |
5742 | * See Documentations/vm/hmm.txt and include/linux/hmm.h | |
7cf7806c LR |
5743 | * |
5744 | * Called with pte lock held. | |
5745 | */ | |
5746 | ||
8d32ff84 | 5747 | static enum mc_target_type get_mctgt_type(struct vm_area_struct *vma, |
90254a65 DN |
5748 | unsigned long addr, pte_t ptent, union mc_target *target) |
5749 | { | |
5750 | struct page *page = NULL; | |
8d32ff84 | 5751 | enum mc_target_type ret = MC_TARGET_NONE; |
90254a65 DN |
5752 | swp_entry_t ent = { .val = 0 }; |
5753 | ||
5754 | if (pte_present(ptent)) | |
5755 | page = mc_handle_present_pte(vma, addr, ptent); | |
5756 | else if (is_swap_pte(ptent)) | |
48406ef8 | 5757 | page = mc_handle_swap_pte(vma, ptent, &ent); |
0661a336 | 5758 | else if (pte_none(ptent)) |
87946a72 | 5759 | page = mc_handle_file_pte(vma, addr, ptent, &ent); |
90254a65 DN |
5760 | |
5761 | if (!page && !ent.val) | |
8d32ff84 | 5762 | return ret; |
02491447 | 5763 | if (page) { |
02491447 | 5764 | /* |
0a31bc97 | 5765 | * Do only loose check w/o serialization. |
1306a85a | 5766 | * mem_cgroup_move_account() checks the page is valid or |
0a31bc97 | 5767 | * not under LRU exclusion. |
02491447 | 5768 | */ |
bcfe06bf | 5769 | if (page_memcg(page) == mc.from) { |
02491447 | 5770 | ret = MC_TARGET_PAGE; |
25b2995a | 5771 | if (is_device_private_page(page)) |
c733a828 | 5772 | ret = MC_TARGET_DEVICE; |
02491447 DN |
5773 | if (target) |
5774 | target->page = page; | |
5775 | } | |
5776 | if (!ret || !target) | |
5777 | put_page(page); | |
5778 | } | |
3e14a57b HY |
5779 | /* |
5780 | * There is a swap entry and a page doesn't exist or isn't charged. | |
5781 | * But we cannot move a tail-page in a THP. | |
5782 | */ | |
5783 | if (ent.val && !ret && (!page || !PageTransCompound(page)) && | |
34c00c31 | 5784 | mem_cgroup_id(mc.from) == lookup_swap_cgroup_id(ent)) { |
7f0f1546 KH |
5785 | ret = MC_TARGET_SWAP; |
5786 | if (target) | |
5787 | target->ent = ent; | |
4ffef5fe | 5788 | } |
4ffef5fe DN |
5789 | return ret; |
5790 | } | |
5791 | ||
12724850 NH |
5792 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE |
5793 | /* | |
d6810d73 HY |
5794 | * We don't consider PMD mapped swapping or file mapped pages because THP does |
5795 | * not support them for now. | |
12724850 NH |
5796 | * Caller should make sure that pmd_trans_huge(pmd) is true. |
5797 | */ | |
5798 | static enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma, | |
5799 | unsigned long addr, pmd_t pmd, union mc_target *target) | |
5800 | { | |
5801 | struct page *page = NULL; | |
12724850 NH |
5802 | enum mc_target_type ret = MC_TARGET_NONE; |
5803 | ||
84c3fc4e ZY |
5804 | if (unlikely(is_swap_pmd(pmd))) { |
5805 | VM_BUG_ON(thp_migration_supported() && | |
5806 | !is_pmd_migration_entry(pmd)); | |
5807 | return ret; | |
5808 | } | |
12724850 | 5809 | page = pmd_page(pmd); |
309381fe | 5810 | VM_BUG_ON_PAGE(!page || !PageHead(page), page); |
1dfab5ab | 5811 | if (!(mc.flags & MOVE_ANON)) |
12724850 | 5812 | return ret; |
bcfe06bf | 5813 | if (page_memcg(page) == mc.from) { |
12724850 NH |
5814 | ret = MC_TARGET_PAGE; |
5815 | if (target) { | |
5816 | get_page(page); | |
5817 | target->page = page; | |
5818 | } | |
5819 | } | |
5820 | return ret; | |
5821 | } | |
5822 | #else | |
5823 | static inline enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma, | |
5824 | unsigned long addr, pmd_t pmd, union mc_target *target) | |
5825 | { | |
5826 | return MC_TARGET_NONE; | |
5827 | } | |
5828 | #endif | |
5829 | ||
4ffef5fe DN |
5830 | static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd, |
5831 | unsigned long addr, unsigned long end, | |
5832 | struct mm_walk *walk) | |
5833 | { | |
26bcd64a | 5834 | struct vm_area_struct *vma = walk->vma; |
4ffef5fe DN |
5835 | pte_t *pte; |
5836 | spinlock_t *ptl; | |
5837 | ||
b6ec57f4 KS |
5838 | ptl = pmd_trans_huge_lock(pmd, vma); |
5839 | if (ptl) { | |
c733a828 JG |
5840 | /* |
5841 | * Note their can not be MC_TARGET_DEVICE for now as we do not | |
25b2995a CH |
5842 | * support transparent huge page with MEMORY_DEVICE_PRIVATE but |
5843 | * this might change. | |
c733a828 | 5844 | */ |
12724850 NH |
5845 | if (get_mctgt_type_thp(vma, addr, *pmd, NULL) == MC_TARGET_PAGE) |
5846 | mc.precharge += HPAGE_PMD_NR; | |
bf929152 | 5847 | spin_unlock(ptl); |
1a5a9906 | 5848 | return 0; |
12724850 | 5849 | } |
03319327 | 5850 | |
45f83cef AA |
5851 | if (pmd_trans_unstable(pmd)) |
5852 | return 0; | |
4ffef5fe DN |
5853 | pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl); |
5854 | for (; addr != end; pte++, addr += PAGE_SIZE) | |
8d32ff84 | 5855 | if (get_mctgt_type(vma, addr, *pte, NULL)) |
4ffef5fe DN |
5856 | mc.precharge++; /* increment precharge temporarily */ |
5857 | pte_unmap_unlock(pte - 1, ptl); | |
5858 | cond_resched(); | |
5859 | ||
7dc74be0 DN |
5860 | return 0; |
5861 | } | |
5862 | ||
7b86ac33 CH |
5863 | static const struct mm_walk_ops precharge_walk_ops = { |
5864 | .pmd_entry = mem_cgroup_count_precharge_pte_range, | |
5865 | }; | |
5866 | ||
4ffef5fe DN |
5867 | static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm) |
5868 | { | |
5869 | unsigned long precharge; | |
4ffef5fe | 5870 | |
d8ed45c5 | 5871 | mmap_read_lock(mm); |
7b86ac33 | 5872 | walk_page_range(mm, 0, mm->highest_vm_end, &precharge_walk_ops, NULL); |
d8ed45c5 | 5873 | mmap_read_unlock(mm); |
4ffef5fe DN |
5874 | |
5875 | precharge = mc.precharge; | |
5876 | mc.precharge = 0; | |
5877 | ||
5878 | return precharge; | |
5879 | } | |
5880 | ||
4ffef5fe DN |
5881 | static int mem_cgroup_precharge_mc(struct mm_struct *mm) |
5882 | { | |
dfe076b0 DN |
5883 | unsigned long precharge = mem_cgroup_count_precharge(mm); |
5884 | ||
5885 | VM_BUG_ON(mc.moving_task); | |
5886 | mc.moving_task = current; | |
5887 | return mem_cgroup_do_precharge(precharge); | |
4ffef5fe DN |
5888 | } |
5889 | ||
dfe076b0 DN |
5890 | /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */ |
5891 | static void __mem_cgroup_clear_mc(void) | |
4ffef5fe | 5892 | { |
2bd9bb20 KH |
5893 | struct mem_cgroup *from = mc.from; |
5894 | struct mem_cgroup *to = mc.to; | |
5895 | ||
4ffef5fe | 5896 | /* we must uncharge all the leftover precharges from mc.to */ |
854ffa8d | 5897 | if (mc.precharge) { |
00501b53 | 5898 | cancel_charge(mc.to, mc.precharge); |
854ffa8d DN |
5899 | mc.precharge = 0; |
5900 | } | |
5901 | /* | |
5902 | * we didn't uncharge from mc.from at mem_cgroup_move_account(), so | |
5903 | * we must uncharge here. | |
5904 | */ | |
5905 | if (mc.moved_charge) { | |
00501b53 | 5906 | cancel_charge(mc.from, mc.moved_charge); |
854ffa8d | 5907 | mc.moved_charge = 0; |
4ffef5fe | 5908 | } |
483c30b5 DN |
5909 | /* we must fixup refcnts and charges */ |
5910 | if (mc.moved_swap) { | |
483c30b5 | 5911 | /* uncharge swap account from the old cgroup */ |
ce00a967 | 5912 | if (!mem_cgroup_is_root(mc.from)) |
3e32cb2e | 5913 | page_counter_uncharge(&mc.from->memsw, mc.moved_swap); |
483c30b5 | 5914 | |
615d66c3 VD |
5915 | mem_cgroup_id_put_many(mc.from, mc.moved_swap); |
5916 | ||
05b84301 | 5917 | /* |
3e32cb2e JW |
5918 | * we charged both to->memory and to->memsw, so we |
5919 | * should uncharge to->memory. | |
05b84301 | 5920 | */ |
ce00a967 | 5921 | if (!mem_cgroup_is_root(mc.to)) |
3e32cb2e JW |
5922 | page_counter_uncharge(&mc.to->memory, mc.moved_swap); |
5923 | ||
483c30b5 DN |
5924 | mc.moved_swap = 0; |
5925 | } | |
dfe076b0 DN |
5926 | memcg_oom_recover(from); |
5927 | memcg_oom_recover(to); | |
5928 | wake_up_all(&mc.waitq); | |
5929 | } | |
5930 | ||
5931 | static void mem_cgroup_clear_mc(void) | |
5932 | { | |
264a0ae1 TH |
5933 | struct mm_struct *mm = mc.mm; |
5934 | ||
dfe076b0 DN |
5935 | /* |
5936 | * we must clear moving_task before waking up waiters at the end of | |
5937 | * task migration. | |
5938 | */ | |
5939 | mc.moving_task = NULL; | |
5940 | __mem_cgroup_clear_mc(); | |
2bd9bb20 | 5941 | spin_lock(&mc.lock); |
4ffef5fe DN |
5942 | mc.from = NULL; |
5943 | mc.to = NULL; | |
264a0ae1 | 5944 | mc.mm = NULL; |
2bd9bb20 | 5945 | spin_unlock(&mc.lock); |
264a0ae1 TH |
5946 | |
5947 | mmput(mm); | |
4ffef5fe DN |
5948 | } |
5949 | ||
1f7dd3e5 | 5950 | static int mem_cgroup_can_attach(struct cgroup_taskset *tset) |
7dc74be0 | 5951 | { |
1f7dd3e5 | 5952 | struct cgroup_subsys_state *css; |
eed67d75 | 5953 | struct mem_cgroup *memcg = NULL; /* unneeded init to make gcc happy */ |
9f2115f9 | 5954 | struct mem_cgroup *from; |
4530eddb | 5955 | struct task_struct *leader, *p; |
9f2115f9 | 5956 | struct mm_struct *mm; |
1dfab5ab | 5957 | unsigned long move_flags; |
9f2115f9 | 5958 | int ret = 0; |
7dc74be0 | 5959 | |
1f7dd3e5 TH |
5960 | /* charge immigration isn't supported on the default hierarchy */ |
5961 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) | |
9f2115f9 TH |
5962 | return 0; |
5963 | ||
4530eddb TH |
5964 | /* |
5965 | * Multi-process migrations only happen on the default hierarchy | |
5966 | * where charge immigration is not used. Perform charge | |
5967 | * immigration if @tset contains a leader and whine if there are | |
5968 | * multiple. | |
5969 | */ | |
5970 | p = NULL; | |
1f7dd3e5 | 5971 | cgroup_taskset_for_each_leader(leader, css, tset) { |
4530eddb TH |
5972 | WARN_ON_ONCE(p); |
5973 | p = leader; | |
1f7dd3e5 | 5974 | memcg = mem_cgroup_from_css(css); |
4530eddb TH |
5975 | } |
5976 | if (!p) | |
5977 | return 0; | |
5978 | ||
1f7dd3e5 | 5979 | /* |
f0953a1b | 5980 | * We are now committed to this value whatever it is. Changes in this |
1f7dd3e5 TH |
5981 | * tunable will only affect upcoming migrations, not the current one. |
5982 | * So we need to save it, and keep it going. | |
5983 | */ | |
5984 | move_flags = READ_ONCE(memcg->move_charge_at_immigrate); | |
5985 | if (!move_flags) | |
5986 | return 0; | |
5987 | ||
9f2115f9 TH |
5988 | from = mem_cgroup_from_task(p); |
5989 | ||
5990 | VM_BUG_ON(from == memcg); | |
5991 | ||
5992 | mm = get_task_mm(p); | |
5993 | if (!mm) | |
5994 | return 0; | |
5995 | /* We move charges only when we move a owner of the mm */ | |
5996 | if (mm->owner == p) { | |
5997 | VM_BUG_ON(mc.from); | |
5998 | VM_BUG_ON(mc.to); | |
5999 | VM_BUG_ON(mc.precharge); | |
6000 | VM_BUG_ON(mc.moved_charge); | |
6001 | VM_BUG_ON(mc.moved_swap); | |
6002 | ||
6003 | spin_lock(&mc.lock); | |
264a0ae1 | 6004 | mc.mm = mm; |
9f2115f9 TH |
6005 | mc.from = from; |
6006 | mc.to = memcg; | |
6007 | mc.flags = move_flags; | |
6008 | spin_unlock(&mc.lock); | |
6009 | /* We set mc.moving_task later */ | |
6010 | ||
6011 | ret = mem_cgroup_precharge_mc(mm); | |
6012 | if (ret) | |
6013 | mem_cgroup_clear_mc(); | |
264a0ae1 TH |
6014 | } else { |
6015 | mmput(mm); | |
7dc74be0 DN |
6016 | } |
6017 | return ret; | |
6018 | } | |
6019 | ||
1f7dd3e5 | 6020 | static void mem_cgroup_cancel_attach(struct cgroup_taskset *tset) |
7dc74be0 | 6021 | { |
4e2f245d JW |
6022 | if (mc.to) |
6023 | mem_cgroup_clear_mc(); | |
7dc74be0 DN |
6024 | } |
6025 | ||
4ffef5fe DN |
6026 | static int mem_cgroup_move_charge_pte_range(pmd_t *pmd, |
6027 | unsigned long addr, unsigned long end, | |
6028 | struct mm_walk *walk) | |
7dc74be0 | 6029 | { |
4ffef5fe | 6030 | int ret = 0; |
26bcd64a | 6031 | struct vm_area_struct *vma = walk->vma; |
4ffef5fe DN |
6032 | pte_t *pte; |
6033 | spinlock_t *ptl; | |
12724850 NH |
6034 | enum mc_target_type target_type; |
6035 | union mc_target target; | |
6036 | struct page *page; | |
4ffef5fe | 6037 | |
b6ec57f4 KS |
6038 | ptl = pmd_trans_huge_lock(pmd, vma); |
6039 | if (ptl) { | |
62ade86a | 6040 | if (mc.precharge < HPAGE_PMD_NR) { |
bf929152 | 6041 | spin_unlock(ptl); |
12724850 NH |
6042 | return 0; |
6043 | } | |
6044 | target_type = get_mctgt_type_thp(vma, addr, *pmd, &target); | |
6045 | if (target_type == MC_TARGET_PAGE) { | |
6046 | page = target.page; | |
6047 | if (!isolate_lru_page(page)) { | |
f627c2f5 | 6048 | if (!mem_cgroup_move_account(page, true, |
1306a85a | 6049 | mc.from, mc.to)) { |
12724850 NH |
6050 | mc.precharge -= HPAGE_PMD_NR; |
6051 | mc.moved_charge += HPAGE_PMD_NR; | |
6052 | } | |
6053 | putback_lru_page(page); | |
6054 | } | |
6055 | put_page(page); | |
c733a828 JG |
6056 | } else if (target_type == MC_TARGET_DEVICE) { |
6057 | page = target.page; | |
6058 | if (!mem_cgroup_move_account(page, true, | |
6059 | mc.from, mc.to)) { | |
6060 | mc.precharge -= HPAGE_PMD_NR; | |
6061 | mc.moved_charge += HPAGE_PMD_NR; | |
6062 | } | |
6063 | put_page(page); | |
12724850 | 6064 | } |
bf929152 | 6065 | spin_unlock(ptl); |
1a5a9906 | 6066 | return 0; |
12724850 NH |
6067 | } |
6068 | ||
45f83cef AA |
6069 | if (pmd_trans_unstable(pmd)) |
6070 | return 0; | |
4ffef5fe DN |
6071 | retry: |
6072 | pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl); | |
6073 | for (; addr != end; addr += PAGE_SIZE) { | |
6074 | pte_t ptent = *(pte++); | |
c733a828 | 6075 | bool device = false; |
02491447 | 6076 | swp_entry_t ent; |
4ffef5fe DN |
6077 | |
6078 | if (!mc.precharge) | |
6079 | break; | |
6080 | ||
8d32ff84 | 6081 | switch (get_mctgt_type(vma, addr, ptent, &target)) { |
c733a828 JG |
6082 | case MC_TARGET_DEVICE: |
6083 | device = true; | |
e4a9bc58 | 6084 | fallthrough; |
4ffef5fe DN |
6085 | case MC_TARGET_PAGE: |
6086 | page = target.page; | |
53f9263b KS |
6087 | /* |
6088 | * We can have a part of the split pmd here. Moving it | |
6089 | * can be done but it would be too convoluted so simply | |
6090 | * ignore such a partial THP and keep it in original | |
6091 | * memcg. There should be somebody mapping the head. | |
6092 | */ | |
6093 | if (PageTransCompound(page)) | |
6094 | goto put; | |
c733a828 | 6095 | if (!device && isolate_lru_page(page)) |
4ffef5fe | 6096 | goto put; |
f627c2f5 KS |
6097 | if (!mem_cgroup_move_account(page, false, |
6098 | mc.from, mc.to)) { | |
4ffef5fe | 6099 | mc.precharge--; |
854ffa8d DN |
6100 | /* we uncharge from mc.from later. */ |
6101 | mc.moved_charge++; | |
4ffef5fe | 6102 | } |
c733a828 JG |
6103 | if (!device) |
6104 | putback_lru_page(page); | |
8d32ff84 | 6105 | put: /* get_mctgt_type() gets the page */ |
4ffef5fe DN |
6106 | put_page(page); |
6107 | break; | |
02491447 DN |
6108 | case MC_TARGET_SWAP: |
6109 | ent = target.ent; | |
e91cbb42 | 6110 | if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to)) { |
02491447 | 6111 | mc.precharge--; |
8d22a935 HD |
6112 | mem_cgroup_id_get_many(mc.to, 1); |
6113 | /* we fixup other refcnts and charges later. */ | |
483c30b5 DN |
6114 | mc.moved_swap++; |
6115 | } | |
02491447 | 6116 | break; |
4ffef5fe DN |
6117 | default: |
6118 | break; | |
6119 | } | |
6120 | } | |
6121 | pte_unmap_unlock(pte - 1, ptl); | |
6122 | cond_resched(); | |
6123 | ||
6124 | if (addr != end) { | |
6125 | /* | |
6126 | * We have consumed all precharges we got in can_attach(). | |
6127 | * We try charge one by one, but don't do any additional | |
6128 | * charges to mc.to if we have failed in charge once in attach() | |
6129 | * phase. | |
6130 | */ | |
854ffa8d | 6131 | ret = mem_cgroup_do_precharge(1); |
4ffef5fe DN |
6132 | if (!ret) |
6133 | goto retry; | |
6134 | } | |
6135 | ||
6136 | return ret; | |
6137 | } | |
6138 | ||
7b86ac33 CH |
6139 | static const struct mm_walk_ops charge_walk_ops = { |
6140 | .pmd_entry = mem_cgroup_move_charge_pte_range, | |
6141 | }; | |
6142 | ||
264a0ae1 | 6143 | static void mem_cgroup_move_charge(void) |
4ffef5fe | 6144 | { |
4ffef5fe | 6145 | lru_add_drain_all(); |
312722cb | 6146 | /* |
81f8c3a4 JW |
6147 | * Signal lock_page_memcg() to take the memcg's move_lock |
6148 | * while we're moving its pages to another memcg. Then wait | |
6149 | * for already started RCU-only updates to finish. | |
312722cb JW |
6150 | */ |
6151 | atomic_inc(&mc.from->moving_account); | |
6152 | synchronize_rcu(); | |
dfe076b0 | 6153 | retry: |
d8ed45c5 | 6154 | if (unlikely(!mmap_read_trylock(mc.mm))) { |
dfe076b0 | 6155 | /* |
c1e8d7c6 | 6156 | * Someone who are holding the mmap_lock might be waiting in |
dfe076b0 DN |
6157 | * waitq. So we cancel all extra charges, wake up all waiters, |
6158 | * and retry. Because we cancel precharges, we might not be able | |
6159 | * to move enough charges, but moving charge is a best-effort | |
6160 | * feature anyway, so it wouldn't be a big problem. | |
6161 | */ | |
6162 | __mem_cgroup_clear_mc(); | |
6163 | cond_resched(); | |
6164 | goto retry; | |
6165 | } | |
26bcd64a NH |
6166 | /* |
6167 | * When we have consumed all precharges and failed in doing | |
6168 | * additional charge, the page walk just aborts. | |
6169 | */ | |
7b86ac33 CH |
6170 | walk_page_range(mc.mm, 0, mc.mm->highest_vm_end, &charge_walk_ops, |
6171 | NULL); | |
0247f3f4 | 6172 | |
d8ed45c5 | 6173 | mmap_read_unlock(mc.mm); |
312722cb | 6174 | atomic_dec(&mc.from->moving_account); |
7dc74be0 DN |
6175 | } |
6176 | ||
264a0ae1 | 6177 | static void mem_cgroup_move_task(void) |
67e465a7 | 6178 | { |
264a0ae1 TH |
6179 | if (mc.to) { |
6180 | mem_cgroup_move_charge(); | |
a433658c | 6181 | mem_cgroup_clear_mc(); |
264a0ae1 | 6182 | } |
67e465a7 | 6183 | } |
5cfb80a7 | 6184 | #else /* !CONFIG_MMU */ |
1f7dd3e5 | 6185 | static int mem_cgroup_can_attach(struct cgroup_taskset *tset) |
5cfb80a7 DN |
6186 | { |
6187 | return 0; | |
6188 | } | |
1f7dd3e5 | 6189 | static void mem_cgroup_cancel_attach(struct cgroup_taskset *tset) |
5cfb80a7 DN |
6190 | { |
6191 | } | |
264a0ae1 | 6192 | static void mem_cgroup_move_task(void) |
5cfb80a7 DN |
6193 | { |
6194 | } | |
6195 | #endif | |
67e465a7 | 6196 | |
677dc973 CD |
6197 | static int seq_puts_memcg_tunable(struct seq_file *m, unsigned long value) |
6198 | { | |
6199 | if (value == PAGE_COUNTER_MAX) | |
6200 | seq_puts(m, "max\n"); | |
6201 | else | |
6202 | seq_printf(m, "%llu\n", (u64)value * PAGE_SIZE); | |
6203 | ||
6204 | return 0; | |
6205 | } | |
6206 | ||
241994ed JW |
6207 | static u64 memory_current_read(struct cgroup_subsys_state *css, |
6208 | struct cftype *cft) | |
6209 | { | |
f5fc3c5d JW |
6210 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); |
6211 | ||
6212 | return (u64)page_counter_read(&memcg->memory) * PAGE_SIZE; | |
241994ed JW |
6213 | } |
6214 | ||
bf8d5d52 RG |
6215 | static int memory_min_show(struct seq_file *m, void *v) |
6216 | { | |
677dc973 CD |
6217 | return seq_puts_memcg_tunable(m, |
6218 | READ_ONCE(mem_cgroup_from_seq(m)->memory.min)); | |
bf8d5d52 RG |
6219 | } |
6220 | ||
6221 | static ssize_t memory_min_write(struct kernfs_open_file *of, | |
6222 | char *buf, size_t nbytes, loff_t off) | |
6223 | { | |
6224 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
6225 | unsigned long min; | |
6226 | int err; | |
6227 | ||
6228 | buf = strstrip(buf); | |
6229 | err = page_counter_memparse(buf, "max", &min); | |
6230 | if (err) | |
6231 | return err; | |
6232 | ||
6233 | page_counter_set_min(&memcg->memory, min); | |
6234 | ||
6235 | return nbytes; | |
6236 | } | |
6237 | ||
241994ed JW |
6238 | static int memory_low_show(struct seq_file *m, void *v) |
6239 | { | |
677dc973 CD |
6240 | return seq_puts_memcg_tunable(m, |
6241 | READ_ONCE(mem_cgroup_from_seq(m)->memory.low)); | |
241994ed JW |
6242 | } |
6243 | ||
6244 | static ssize_t memory_low_write(struct kernfs_open_file *of, | |
6245 | char *buf, size_t nbytes, loff_t off) | |
6246 | { | |
6247 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
6248 | unsigned long low; | |
6249 | int err; | |
6250 | ||
6251 | buf = strstrip(buf); | |
d2973697 | 6252 | err = page_counter_memparse(buf, "max", &low); |
241994ed JW |
6253 | if (err) |
6254 | return err; | |
6255 | ||
23067153 | 6256 | page_counter_set_low(&memcg->memory, low); |
241994ed JW |
6257 | |
6258 | return nbytes; | |
6259 | } | |
6260 | ||
6261 | static int memory_high_show(struct seq_file *m, void *v) | |
6262 | { | |
d1663a90 JK |
6263 | return seq_puts_memcg_tunable(m, |
6264 | READ_ONCE(mem_cgroup_from_seq(m)->memory.high)); | |
241994ed JW |
6265 | } |
6266 | ||
6267 | static ssize_t memory_high_write(struct kernfs_open_file *of, | |
6268 | char *buf, size_t nbytes, loff_t off) | |
6269 | { | |
6270 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
d977aa93 | 6271 | unsigned int nr_retries = MAX_RECLAIM_RETRIES; |
8c8c383c | 6272 | bool drained = false; |
241994ed JW |
6273 | unsigned long high; |
6274 | int err; | |
6275 | ||
6276 | buf = strstrip(buf); | |
d2973697 | 6277 | err = page_counter_memparse(buf, "max", &high); |
241994ed JW |
6278 | if (err) |
6279 | return err; | |
6280 | ||
e82553c1 JW |
6281 | page_counter_set_high(&memcg->memory, high); |
6282 | ||
8c8c383c JW |
6283 | for (;;) { |
6284 | unsigned long nr_pages = page_counter_read(&memcg->memory); | |
6285 | unsigned long reclaimed; | |
6286 | ||
6287 | if (nr_pages <= high) | |
6288 | break; | |
6289 | ||
6290 | if (signal_pending(current)) | |
6291 | break; | |
6292 | ||
6293 | if (!drained) { | |
6294 | drain_all_stock(memcg); | |
6295 | drained = true; | |
6296 | continue; | |
6297 | } | |
6298 | ||
6299 | reclaimed = try_to_free_mem_cgroup_pages(memcg, nr_pages - high, | |
6300 | GFP_KERNEL, true); | |
6301 | ||
6302 | if (!reclaimed && !nr_retries--) | |
6303 | break; | |
6304 | } | |
588083bb | 6305 | |
19ce33ac | 6306 | memcg_wb_domain_size_changed(memcg); |
241994ed JW |
6307 | return nbytes; |
6308 | } | |
6309 | ||
6310 | static int memory_max_show(struct seq_file *m, void *v) | |
6311 | { | |
677dc973 CD |
6312 | return seq_puts_memcg_tunable(m, |
6313 | READ_ONCE(mem_cgroup_from_seq(m)->memory.max)); | |
241994ed JW |
6314 | } |
6315 | ||
6316 | static ssize_t memory_max_write(struct kernfs_open_file *of, | |
6317 | char *buf, size_t nbytes, loff_t off) | |
6318 | { | |
6319 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
d977aa93 | 6320 | unsigned int nr_reclaims = MAX_RECLAIM_RETRIES; |
b6e6edcf | 6321 | bool drained = false; |
241994ed JW |
6322 | unsigned long max; |
6323 | int err; | |
6324 | ||
6325 | buf = strstrip(buf); | |
d2973697 | 6326 | err = page_counter_memparse(buf, "max", &max); |
241994ed JW |
6327 | if (err) |
6328 | return err; | |
6329 | ||
bbec2e15 | 6330 | xchg(&memcg->memory.max, max); |
b6e6edcf JW |
6331 | |
6332 | for (;;) { | |
6333 | unsigned long nr_pages = page_counter_read(&memcg->memory); | |
6334 | ||
6335 | if (nr_pages <= max) | |
6336 | break; | |
6337 | ||
7249c9f0 | 6338 | if (signal_pending(current)) |
b6e6edcf | 6339 | break; |
b6e6edcf JW |
6340 | |
6341 | if (!drained) { | |
6342 | drain_all_stock(memcg); | |
6343 | drained = true; | |
6344 | continue; | |
6345 | } | |
6346 | ||
6347 | if (nr_reclaims) { | |
6348 | if (!try_to_free_mem_cgroup_pages(memcg, nr_pages - max, | |
6349 | GFP_KERNEL, true)) | |
6350 | nr_reclaims--; | |
6351 | continue; | |
6352 | } | |
6353 | ||
e27be240 | 6354 | memcg_memory_event(memcg, MEMCG_OOM); |
b6e6edcf JW |
6355 | if (!mem_cgroup_out_of_memory(memcg, GFP_KERNEL, 0)) |
6356 | break; | |
6357 | } | |
241994ed | 6358 | |
2529bb3a | 6359 | memcg_wb_domain_size_changed(memcg); |
241994ed JW |
6360 | return nbytes; |
6361 | } | |
6362 | ||
1e577f97 SB |
6363 | static void __memory_events_show(struct seq_file *m, atomic_long_t *events) |
6364 | { | |
6365 | seq_printf(m, "low %lu\n", atomic_long_read(&events[MEMCG_LOW])); | |
6366 | seq_printf(m, "high %lu\n", atomic_long_read(&events[MEMCG_HIGH])); | |
6367 | seq_printf(m, "max %lu\n", atomic_long_read(&events[MEMCG_MAX])); | |
6368 | seq_printf(m, "oom %lu\n", atomic_long_read(&events[MEMCG_OOM])); | |
6369 | seq_printf(m, "oom_kill %lu\n", | |
6370 | atomic_long_read(&events[MEMCG_OOM_KILL])); | |
6371 | } | |
6372 | ||
241994ed JW |
6373 | static int memory_events_show(struct seq_file *m, void *v) |
6374 | { | |
aa9694bb | 6375 | struct mem_cgroup *memcg = mem_cgroup_from_seq(m); |
241994ed | 6376 | |
1e577f97 SB |
6377 | __memory_events_show(m, memcg->memory_events); |
6378 | return 0; | |
6379 | } | |
6380 | ||
6381 | static int memory_events_local_show(struct seq_file *m, void *v) | |
6382 | { | |
6383 | struct mem_cgroup *memcg = mem_cgroup_from_seq(m); | |
241994ed | 6384 | |
1e577f97 | 6385 | __memory_events_show(m, memcg->memory_events_local); |
241994ed JW |
6386 | return 0; |
6387 | } | |
6388 | ||
587d9f72 JW |
6389 | static int memory_stat_show(struct seq_file *m, void *v) |
6390 | { | |
aa9694bb | 6391 | struct mem_cgroup *memcg = mem_cgroup_from_seq(m); |
c8713d0b | 6392 | char *buf; |
1ff9e6e1 | 6393 | |
c8713d0b JW |
6394 | buf = memory_stat_format(memcg); |
6395 | if (!buf) | |
6396 | return -ENOMEM; | |
6397 | seq_puts(m, buf); | |
6398 | kfree(buf); | |
587d9f72 JW |
6399 | return 0; |
6400 | } | |
6401 | ||
5f9a4f4a | 6402 | #ifdef CONFIG_NUMA |
fff66b79 MS |
6403 | static inline unsigned long lruvec_page_state_output(struct lruvec *lruvec, |
6404 | int item) | |
6405 | { | |
6406 | return lruvec_page_state(lruvec, item) * memcg_page_state_unit(item); | |
6407 | } | |
6408 | ||
5f9a4f4a MS |
6409 | static int memory_numa_stat_show(struct seq_file *m, void *v) |
6410 | { | |
6411 | int i; | |
6412 | struct mem_cgroup *memcg = mem_cgroup_from_seq(m); | |
6413 | ||
909fc739 | 6414 | mem_cgroup_flush_stats(); |
7e1c0d6f | 6415 | |
5f9a4f4a MS |
6416 | for (i = 0; i < ARRAY_SIZE(memory_stats); i++) { |
6417 | int nid; | |
6418 | ||
6419 | if (memory_stats[i].idx >= NR_VM_NODE_STAT_ITEMS) | |
6420 | continue; | |
6421 | ||
6422 | seq_printf(m, "%s", memory_stats[i].name); | |
6423 | for_each_node_state(nid, N_MEMORY) { | |
6424 | u64 size; | |
6425 | struct lruvec *lruvec; | |
6426 | ||
6427 | lruvec = mem_cgroup_lruvec(memcg, NODE_DATA(nid)); | |
fff66b79 MS |
6428 | size = lruvec_page_state_output(lruvec, |
6429 | memory_stats[i].idx); | |
5f9a4f4a MS |
6430 | seq_printf(m, " N%d=%llu", nid, size); |
6431 | } | |
6432 | seq_putc(m, '\n'); | |
6433 | } | |
6434 | ||
6435 | return 0; | |
6436 | } | |
6437 | #endif | |
6438 | ||
3d8b38eb RG |
6439 | static int memory_oom_group_show(struct seq_file *m, void *v) |
6440 | { | |
aa9694bb | 6441 | struct mem_cgroup *memcg = mem_cgroup_from_seq(m); |
3d8b38eb RG |
6442 | |
6443 | seq_printf(m, "%d\n", memcg->oom_group); | |
6444 | ||
6445 | return 0; | |
6446 | } | |
6447 | ||
6448 | static ssize_t memory_oom_group_write(struct kernfs_open_file *of, | |
6449 | char *buf, size_t nbytes, loff_t off) | |
6450 | { | |
6451 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
6452 | int ret, oom_group; | |
6453 | ||
6454 | buf = strstrip(buf); | |
6455 | if (!buf) | |
6456 | return -EINVAL; | |
6457 | ||
6458 | ret = kstrtoint(buf, 0, &oom_group); | |
6459 | if (ret) | |
6460 | return ret; | |
6461 | ||
6462 | if (oom_group != 0 && oom_group != 1) | |
6463 | return -EINVAL; | |
6464 | ||
6465 | memcg->oom_group = oom_group; | |
6466 | ||
6467 | return nbytes; | |
6468 | } | |
6469 | ||
241994ed JW |
6470 | static struct cftype memory_files[] = { |
6471 | { | |
6472 | .name = "current", | |
f5fc3c5d | 6473 | .flags = CFTYPE_NOT_ON_ROOT, |
241994ed JW |
6474 | .read_u64 = memory_current_read, |
6475 | }, | |
bf8d5d52 RG |
6476 | { |
6477 | .name = "min", | |
6478 | .flags = CFTYPE_NOT_ON_ROOT, | |
6479 | .seq_show = memory_min_show, | |
6480 | .write = memory_min_write, | |
6481 | }, | |
241994ed JW |
6482 | { |
6483 | .name = "low", | |
6484 | .flags = CFTYPE_NOT_ON_ROOT, | |
6485 | .seq_show = memory_low_show, | |
6486 | .write = memory_low_write, | |
6487 | }, | |
6488 | { | |
6489 | .name = "high", | |
6490 | .flags = CFTYPE_NOT_ON_ROOT, | |
6491 | .seq_show = memory_high_show, | |
6492 | .write = memory_high_write, | |
6493 | }, | |
6494 | { | |
6495 | .name = "max", | |
6496 | .flags = CFTYPE_NOT_ON_ROOT, | |
6497 | .seq_show = memory_max_show, | |
6498 | .write = memory_max_write, | |
6499 | }, | |
6500 | { | |
6501 | .name = "events", | |
6502 | .flags = CFTYPE_NOT_ON_ROOT, | |
472912a2 | 6503 | .file_offset = offsetof(struct mem_cgroup, events_file), |
241994ed JW |
6504 | .seq_show = memory_events_show, |
6505 | }, | |
1e577f97 SB |
6506 | { |
6507 | .name = "events.local", | |
6508 | .flags = CFTYPE_NOT_ON_ROOT, | |
6509 | .file_offset = offsetof(struct mem_cgroup, events_local_file), | |
6510 | .seq_show = memory_events_local_show, | |
6511 | }, | |
587d9f72 JW |
6512 | { |
6513 | .name = "stat", | |
587d9f72 JW |
6514 | .seq_show = memory_stat_show, |
6515 | }, | |
5f9a4f4a MS |
6516 | #ifdef CONFIG_NUMA |
6517 | { | |
6518 | .name = "numa_stat", | |
6519 | .seq_show = memory_numa_stat_show, | |
6520 | }, | |
6521 | #endif | |
3d8b38eb RG |
6522 | { |
6523 | .name = "oom.group", | |
6524 | .flags = CFTYPE_NOT_ON_ROOT | CFTYPE_NS_DELEGATABLE, | |
6525 | .seq_show = memory_oom_group_show, | |
6526 | .write = memory_oom_group_write, | |
6527 | }, | |
241994ed JW |
6528 | { } /* terminate */ |
6529 | }; | |
6530 | ||
073219e9 | 6531 | struct cgroup_subsys memory_cgrp_subsys = { |
92fb9748 | 6532 | .css_alloc = mem_cgroup_css_alloc, |
d142e3e6 | 6533 | .css_online = mem_cgroup_css_online, |
92fb9748 | 6534 | .css_offline = mem_cgroup_css_offline, |
6df38689 | 6535 | .css_released = mem_cgroup_css_released, |
92fb9748 | 6536 | .css_free = mem_cgroup_css_free, |
1ced953b | 6537 | .css_reset = mem_cgroup_css_reset, |
2d146aa3 | 6538 | .css_rstat_flush = mem_cgroup_css_rstat_flush, |
7dc74be0 DN |
6539 | .can_attach = mem_cgroup_can_attach, |
6540 | .cancel_attach = mem_cgroup_cancel_attach, | |
264a0ae1 | 6541 | .post_attach = mem_cgroup_move_task, |
241994ed JW |
6542 | .dfl_cftypes = memory_files, |
6543 | .legacy_cftypes = mem_cgroup_legacy_files, | |
6d12e2d8 | 6544 | .early_init = 0, |
8cdea7c0 | 6545 | }; |
c077719b | 6546 | |
bc50bcc6 JW |
6547 | /* |
6548 | * This function calculates an individual cgroup's effective | |
6549 | * protection which is derived from its own memory.min/low, its | |
6550 | * parent's and siblings' settings, as well as the actual memory | |
6551 | * distribution in the tree. | |
6552 | * | |
6553 | * The following rules apply to the effective protection values: | |
6554 | * | |
6555 | * 1. At the first level of reclaim, effective protection is equal to | |
6556 | * the declared protection in memory.min and memory.low. | |
6557 | * | |
6558 | * 2. To enable safe delegation of the protection configuration, at | |
6559 | * subsequent levels the effective protection is capped to the | |
6560 | * parent's effective protection. | |
6561 | * | |
6562 | * 3. To make complex and dynamic subtrees easier to configure, the | |
6563 | * user is allowed to overcommit the declared protection at a given | |
6564 | * level. If that is the case, the parent's effective protection is | |
6565 | * distributed to the children in proportion to how much protection | |
6566 | * they have declared and how much of it they are utilizing. | |
6567 | * | |
6568 | * This makes distribution proportional, but also work-conserving: | |
6569 | * if one cgroup claims much more protection than it uses memory, | |
6570 | * the unused remainder is available to its siblings. | |
6571 | * | |
6572 | * 4. Conversely, when the declared protection is undercommitted at a | |
6573 | * given level, the distribution of the larger parental protection | |
6574 | * budget is NOT proportional. A cgroup's protection from a sibling | |
6575 | * is capped to its own memory.min/low setting. | |
6576 | * | |
8a931f80 JW |
6577 | * 5. However, to allow protecting recursive subtrees from each other |
6578 | * without having to declare each individual cgroup's fixed share | |
6579 | * of the ancestor's claim to protection, any unutilized - | |
6580 | * "floating" - protection from up the tree is distributed in | |
6581 | * proportion to each cgroup's *usage*. This makes the protection | |
6582 | * neutral wrt sibling cgroups and lets them compete freely over | |
6583 | * the shared parental protection budget, but it protects the | |
6584 | * subtree as a whole from neighboring subtrees. | |
6585 | * | |
6586 | * Note that 4. and 5. are not in conflict: 4. is about protecting | |
6587 | * against immediate siblings whereas 5. is about protecting against | |
6588 | * neighboring subtrees. | |
bc50bcc6 JW |
6589 | */ |
6590 | static unsigned long effective_protection(unsigned long usage, | |
8a931f80 | 6591 | unsigned long parent_usage, |
bc50bcc6 JW |
6592 | unsigned long setting, |
6593 | unsigned long parent_effective, | |
6594 | unsigned long siblings_protected) | |
6595 | { | |
6596 | unsigned long protected; | |
8a931f80 | 6597 | unsigned long ep; |
bc50bcc6 JW |
6598 | |
6599 | protected = min(usage, setting); | |
6600 | /* | |
6601 | * If all cgroups at this level combined claim and use more | |
6602 | * protection then what the parent affords them, distribute | |
6603 | * shares in proportion to utilization. | |
6604 | * | |
6605 | * We are using actual utilization rather than the statically | |
6606 | * claimed protection in order to be work-conserving: claimed | |
6607 | * but unused protection is available to siblings that would | |
6608 | * otherwise get a smaller chunk than what they claimed. | |
6609 | */ | |
6610 | if (siblings_protected > parent_effective) | |
6611 | return protected * parent_effective / siblings_protected; | |
6612 | ||
6613 | /* | |
6614 | * Ok, utilized protection of all children is within what the | |
6615 | * parent affords them, so we know whatever this child claims | |
6616 | * and utilizes is effectively protected. | |
6617 | * | |
6618 | * If there is unprotected usage beyond this value, reclaim | |
6619 | * will apply pressure in proportion to that amount. | |
6620 | * | |
6621 | * If there is unutilized protection, the cgroup will be fully | |
6622 | * shielded from reclaim, but we do return a smaller value for | |
6623 | * protection than what the group could enjoy in theory. This | |
6624 | * is okay. With the overcommit distribution above, effective | |
6625 | * protection is always dependent on how memory is actually | |
6626 | * consumed among the siblings anyway. | |
6627 | */ | |
8a931f80 JW |
6628 | ep = protected; |
6629 | ||
6630 | /* | |
6631 | * If the children aren't claiming (all of) the protection | |
6632 | * afforded to them by the parent, distribute the remainder in | |
6633 | * proportion to the (unprotected) memory of each cgroup. That | |
6634 | * way, cgroups that aren't explicitly prioritized wrt each | |
6635 | * other compete freely over the allowance, but they are | |
6636 | * collectively protected from neighboring trees. | |
6637 | * | |
6638 | * We're using unprotected memory for the weight so that if | |
6639 | * some cgroups DO claim explicit protection, we don't protect | |
6640 | * the same bytes twice. | |
cd324edc JW |
6641 | * |
6642 | * Check both usage and parent_usage against the respective | |
6643 | * protected values. One should imply the other, but they | |
6644 | * aren't read atomically - make sure the division is sane. | |
8a931f80 JW |
6645 | */ |
6646 | if (!(cgrp_dfl_root.flags & CGRP_ROOT_MEMORY_RECURSIVE_PROT)) | |
6647 | return ep; | |
cd324edc JW |
6648 | if (parent_effective > siblings_protected && |
6649 | parent_usage > siblings_protected && | |
6650 | usage > protected) { | |
8a931f80 JW |
6651 | unsigned long unclaimed; |
6652 | ||
6653 | unclaimed = parent_effective - siblings_protected; | |
6654 | unclaimed *= usage - protected; | |
6655 | unclaimed /= parent_usage - siblings_protected; | |
6656 | ||
6657 | ep += unclaimed; | |
6658 | } | |
6659 | ||
6660 | return ep; | |
bc50bcc6 JW |
6661 | } |
6662 | ||
241994ed | 6663 | /** |
05395718 | 6664 | * mem_cgroup_calculate_protection - check if memory consumption is in the normal range |
34c81057 | 6665 | * @root: the top ancestor of the sub-tree being checked |
241994ed JW |
6666 | * @memcg: the memory cgroup to check |
6667 | * | |
23067153 RG |
6668 | * WARNING: This function is not stateless! It can only be used as part |
6669 | * of a top-down tree iteration, not for isolated queries. | |
241994ed | 6670 | */ |
45c7f7e1 CD |
6671 | void mem_cgroup_calculate_protection(struct mem_cgroup *root, |
6672 | struct mem_cgroup *memcg) | |
241994ed | 6673 | { |
8a931f80 | 6674 | unsigned long usage, parent_usage; |
23067153 RG |
6675 | struct mem_cgroup *parent; |
6676 | ||
241994ed | 6677 | if (mem_cgroup_disabled()) |
45c7f7e1 | 6678 | return; |
241994ed | 6679 | |
34c81057 SC |
6680 | if (!root) |
6681 | root = root_mem_cgroup; | |
22f7496f YS |
6682 | |
6683 | /* | |
6684 | * Effective values of the reclaim targets are ignored so they | |
6685 | * can be stale. Have a look at mem_cgroup_protection for more | |
6686 | * details. | |
6687 | * TODO: calculation should be more robust so that we do not need | |
6688 | * that special casing. | |
6689 | */ | |
34c81057 | 6690 | if (memcg == root) |
45c7f7e1 | 6691 | return; |
241994ed | 6692 | |
23067153 | 6693 | usage = page_counter_read(&memcg->memory); |
bf8d5d52 | 6694 | if (!usage) |
45c7f7e1 | 6695 | return; |
bf8d5d52 | 6696 | |
bf8d5d52 | 6697 | parent = parent_mem_cgroup(memcg); |
df2a4196 RG |
6698 | /* No parent means a non-hierarchical mode on v1 memcg */ |
6699 | if (!parent) | |
45c7f7e1 | 6700 | return; |
df2a4196 | 6701 | |
bc50bcc6 | 6702 | if (parent == root) { |
c3d53200 | 6703 | memcg->memory.emin = READ_ONCE(memcg->memory.min); |
03960e33 | 6704 | memcg->memory.elow = READ_ONCE(memcg->memory.low); |
45c7f7e1 | 6705 | return; |
bf8d5d52 RG |
6706 | } |
6707 | ||
8a931f80 JW |
6708 | parent_usage = page_counter_read(&parent->memory); |
6709 | ||
b3a7822e | 6710 | WRITE_ONCE(memcg->memory.emin, effective_protection(usage, parent_usage, |
c3d53200 CD |
6711 | READ_ONCE(memcg->memory.min), |
6712 | READ_ONCE(parent->memory.emin), | |
b3a7822e | 6713 | atomic_long_read(&parent->memory.children_min_usage))); |
23067153 | 6714 | |
b3a7822e | 6715 | WRITE_ONCE(memcg->memory.elow, effective_protection(usage, parent_usage, |
03960e33 CD |
6716 | READ_ONCE(memcg->memory.low), |
6717 | READ_ONCE(parent->memory.elow), | |
b3a7822e | 6718 | atomic_long_read(&parent->memory.children_low_usage))); |
241994ed JW |
6719 | } |
6720 | ||
2c8d8f97 | 6721 | static int charge_memcg(struct page *page, struct mem_cgroup *memcg, gfp_t gfp) |
0add0c77 SB |
6722 | { |
6723 | unsigned int nr_pages = thp_nr_pages(page); | |
6724 | int ret; | |
6725 | ||
6726 | ret = try_charge(memcg, gfp, nr_pages); | |
6727 | if (ret) | |
6728 | goto out; | |
6729 | ||
6730 | css_get(&memcg->css); | |
6731 | commit_charge(page, memcg); | |
6732 | ||
6733 | local_irq_disable(); | |
6734 | mem_cgroup_charge_statistics(memcg, page, nr_pages); | |
6735 | memcg_check_events(memcg, page); | |
6736 | local_irq_enable(); | |
6737 | out: | |
6738 | return ret; | |
6739 | } | |
6740 | ||
00501b53 | 6741 | /** |
2c8d8f97 | 6742 | * __mem_cgroup_charge - charge a newly allocated page to a cgroup |
00501b53 JW |
6743 | * @page: page to charge |
6744 | * @mm: mm context of the victim | |
6745 | * @gfp_mask: reclaim mode | |
00501b53 JW |
6746 | * |
6747 | * Try to charge @page to the memcg that @mm belongs to, reclaiming | |
04f94e3f DS |
6748 | * pages according to @gfp_mask if necessary. if @mm is NULL, try to |
6749 | * charge to the active memcg. | |
00501b53 | 6750 | * |
0add0c77 SB |
6751 | * Do not use this for pages allocated for swapin. |
6752 | * | |
f0e45fb4 | 6753 | * Returns 0 on success. Otherwise, an error code is returned. |
00501b53 | 6754 | */ |
2c8d8f97 SB |
6755 | int __mem_cgroup_charge(struct page *page, struct mm_struct *mm, |
6756 | gfp_t gfp_mask) | |
00501b53 | 6757 | { |
0add0c77 SB |
6758 | struct mem_cgroup *memcg; |
6759 | int ret; | |
00501b53 | 6760 | |
0add0c77 | 6761 | memcg = get_mem_cgroup_from_mm(mm); |
2c8d8f97 | 6762 | ret = charge_memcg(page, memcg, gfp_mask); |
0add0c77 | 6763 | css_put(&memcg->css); |
2d1c4980 | 6764 | |
0add0c77 SB |
6765 | return ret; |
6766 | } | |
e993d905 | 6767 | |
0add0c77 SB |
6768 | /** |
6769 | * mem_cgroup_swapin_charge_page - charge a newly allocated page for swapin | |
6770 | * @page: page to charge | |
6771 | * @mm: mm context of the victim | |
6772 | * @gfp: reclaim mode | |
6773 | * @entry: swap entry for which the page is allocated | |
6774 | * | |
6775 | * This function charges a page allocated for swapin. Please call this before | |
6776 | * adding the page to the swapcache. | |
6777 | * | |
6778 | * Returns 0 on success. Otherwise, an error code is returned. | |
6779 | */ | |
6780 | int mem_cgroup_swapin_charge_page(struct page *page, struct mm_struct *mm, | |
6781 | gfp_t gfp, swp_entry_t entry) | |
6782 | { | |
6783 | struct mem_cgroup *memcg; | |
6784 | unsigned short id; | |
6785 | int ret; | |
00501b53 | 6786 | |
0add0c77 SB |
6787 | if (mem_cgroup_disabled()) |
6788 | return 0; | |
00501b53 | 6789 | |
0add0c77 SB |
6790 | id = lookup_swap_cgroup_id(entry); |
6791 | rcu_read_lock(); | |
6792 | memcg = mem_cgroup_from_id(id); | |
6793 | if (!memcg || !css_tryget_online(&memcg->css)) | |
6794 | memcg = get_mem_cgroup_from_mm(mm); | |
6795 | rcu_read_unlock(); | |
00501b53 | 6796 | |
2c8d8f97 | 6797 | ret = charge_memcg(page, memcg, gfp); |
6abb5a86 | 6798 | |
0add0c77 SB |
6799 | css_put(&memcg->css); |
6800 | return ret; | |
6801 | } | |
00501b53 | 6802 | |
0add0c77 SB |
6803 | /* |
6804 | * mem_cgroup_swapin_uncharge_swap - uncharge swap slot | |
6805 | * @entry: swap entry for which the page is charged | |
6806 | * | |
6807 | * Call this function after successfully adding the charged page to swapcache. | |
6808 | * | |
6809 | * Note: This function assumes the page for which swap slot is being uncharged | |
6810 | * is order 0 page. | |
6811 | */ | |
6812 | void mem_cgroup_swapin_uncharge_swap(swp_entry_t entry) | |
6813 | { | |
cae3af62 MS |
6814 | /* |
6815 | * Cgroup1's unified memory+swap counter has been charged with the | |
6816 | * new swapcache page, finish the transfer by uncharging the swap | |
6817 | * slot. The swap slot would also get uncharged when it dies, but | |
6818 | * it can stick around indefinitely and we'd count the page twice | |
6819 | * the entire time. | |
6820 | * | |
6821 | * Cgroup2 has separate resource counters for memory and swap, | |
6822 | * so this is a non-issue here. Memory and swap charge lifetimes | |
6823 | * correspond 1:1 to page and swap slot lifetimes: we charge the | |
6824 | * page to memory here, and uncharge swap when the slot is freed. | |
6825 | */ | |
0add0c77 | 6826 | if (!mem_cgroup_disabled() && do_memsw_account()) { |
00501b53 JW |
6827 | /* |
6828 | * The swap entry might not get freed for a long time, | |
6829 | * let's not wait for it. The page already received a | |
6830 | * memory+swap charge, drop the swap entry duplicate. | |
6831 | */ | |
0add0c77 | 6832 | mem_cgroup_uncharge_swap(entry, 1); |
00501b53 | 6833 | } |
3fea5a49 JW |
6834 | } |
6835 | ||
a9d5adee JG |
6836 | struct uncharge_gather { |
6837 | struct mem_cgroup *memcg; | |
b4e0b68f | 6838 | unsigned long nr_memory; |
a9d5adee | 6839 | unsigned long pgpgout; |
a9d5adee | 6840 | unsigned long nr_kmem; |
a9d5adee JG |
6841 | struct page *dummy_page; |
6842 | }; | |
6843 | ||
6844 | static inline void uncharge_gather_clear(struct uncharge_gather *ug) | |
747db954 | 6845 | { |
a9d5adee JG |
6846 | memset(ug, 0, sizeof(*ug)); |
6847 | } | |
6848 | ||
6849 | static void uncharge_batch(const struct uncharge_gather *ug) | |
6850 | { | |
747db954 JW |
6851 | unsigned long flags; |
6852 | ||
b4e0b68f MS |
6853 | if (ug->nr_memory) { |
6854 | page_counter_uncharge(&ug->memcg->memory, ug->nr_memory); | |
7941d214 | 6855 | if (do_memsw_account()) |
b4e0b68f | 6856 | page_counter_uncharge(&ug->memcg->memsw, ug->nr_memory); |
a9d5adee JG |
6857 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && ug->nr_kmem) |
6858 | page_counter_uncharge(&ug->memcg->kmem, ug->nr_kmem); | |
6859 | memcg_oom_recover(ug->memcg); | |
ce00a967 | 6860 | } |
747db954 JW |
6861 | |
6862 | local_irq_save(flags); | |
c9019e9b | 6863 | __count_memcg_events(ug->memcg, PGPGOUT, ug->pgpgout); |
b4e0b68f | 6864 | __this_cpu_add(ug->memcg->vmstats_percpu->nr_page_events, ug->nr_memory); |
a9d5adee | 6865 | memcg_check_events(ug->memcg, ug->dummy_page); |
747db954 | 6866 | local_irq_restore(flags); |
f1796544 MH |
6867 | |
6868 | /* drop reference from uncharge_page */ | |
6869 | css_put(&ug->memcg->css); | |
a9d5adee JG |
6870 | } |
6871 | ||
6872 | static void uncharge_page(struct page *page, struct uncharge_gather *ug) | |
6873 | { | |
9f762dbe | 6874 | unsigned long nr_pages; |
b4e0b68f MS |
6875 | struct mem_cgroup *memcg; |
6876 | struct obj_cgroup *objcg; | |
55927114 | 6877 | bool use_objcg = PageMemcgKmem(page); |
9f762dbe | 6878 | |
a9d5adee | 6879 | VM_BUG_ON_PAGE(PageLRU(page), page); |
a9d5adee | 6880 | |
a9d5adee JG |
6881 | /* |
6882 | * Nobody should be changing or seriously looking at | |
b4e0b68f | 6883 | * page memcg or objcg at this point, we have fully |
a9d5adee JG |
6884 | * exclusive access to the page. |
6885 | */ | |
55927114 | 6886 | if (use_objcg) { |
b4e0b68f MS |
6887 | objcg = __page_objcg(page); |
6888 | /* | |
6889 | * This get matches the put at the end of the function and | |
6890 | * kmem pages do not hold memcg references anymore. | |
6891 | */ | |
6892 | memcg = get_mem_cgroup_from_objcg(objcg); | |
6893 | } else { | |
6894 | memcg = __page_memcg(page); | |
6895 | } | |
a9d5adee | 6896 | |
b4e0b68f MS |
6897 | if (!memcg) |
6898 | return; | |
6899 | ||
6900 | if (ug->memcg != memcg) { | |
a9d5adee JG |
6901 | if (ug->memcg) { |
6902 | uncharge_batch(ug); | |
6903 | uncharge_gather_clear(ug); | |
6904 | } | |
b4e0b68f | 6905 | ug->memcg = memcg; |
7ab345a8 | 6906 | ug->dummy_page = page; |
f1796544 MH |
6907 | |
6908 | /* pairs with css_put in uncharge_batch */ | |
b4e0b68f | 6909 | css_get(&memcg->css); |
a9d5adee JG |
6910 | } |
6911 | ||
9f762dbe | 6912 | nr_pages = compound_nr(page); |
a9d5adee | 6913 | |
55927114 | 6914 | if (use_objcg) { |
b4e0b68f | 6915 | ug->nr_memory += nr_pages; |
9f762dbe | 6916 | ug->nr_kmem += nr_pages; |
b4e0b68f MS |
6917 | |
6918 | page->memcg_data = 0; | |
6919 | obj_cgroup_put(objcg); | |
6920 | } else { | |
6921 | /* LRU pages aren't accounted at the root level */ | |
6922 | if (!mem_cgroup_is_root(memcg)) | |
6923 | ug->nr_memory += nr_pages; | |
18b2db3b | 6924 | ug->pgpgout++; |
a9d5adee | 6925 | |
b4e0b68f MS |
6926 | page->memcg_data = 0; |
6927 | } | |
6928 | ||
6929 | css_put(&memcg->css); | |
747db954 JW |
6930 | } |
6931 | ||
0a31bc97 | 6932 | /** |
2c8d8f97 | 6933 | * __mem_cgroup_uncharge - uncharge a page |
0a31bc97 JW |
6934 | * @page: page to uncharge |
6935 | * | |
2c8d8f97 | 6936 | * Uncharge a page previously charged with __mem_cgroup_charge(). |
0a31bc97 | 6937 | */ |
2c8d8f97 | 6938 | void __mem_cgroup_uncharge(struct page *page) |
0a31bc97 | 6939 | { |
a9d5adee JG |
6940 | struct uncharge_gather ug; |
6941 | ||
747db954 | 6942 | /* Don't touch page->lru of any random page, pre-check: */ |
bcfe06bf | 6943 | if (!page_memcg(page)) |
0a31bc97 JW |
6944 | return; |
6945 | ||
a9d5adee JG |
6946 | uncharge_gather_clear(&ug); |
6947 | uncharge_page(page, &ug); | |
6948 | uncharge_batch(&ug); | |
747db954 | 6949 | } |
0a31bc97 | 6950 | |
747db954 | 6951 | /** |
2c8d8f97 | 6952 | * __mem_cgroup_uncharge_list - uncharge a list of page |
747db954 JW |
6953 | * @page_list: list of pages to uncharge |
6954 | * | |
6955 | * Uncharge a list of pages previously charged with | |
2c8d8f97 | 6956 | * __mem_cgroup_charge(). |
747db954 | 6957 | */ |
2c8d8f97 | 6958 | void __mem_cgroup_uncharge_list(struct list_head *page_list) |
747db954 | 6959 | { |
c41a40b6 MS |
6960 | struct uncharge_gather ug; |
6961 | struct page *page; | |
6962 | ||
c41a40b6 MS |
6963 | uncharge_gather_clear(&ug); |
6964 | list_for_each_entry(page, page_list, lru) | |
6965 | uncharge_page(page, &ug); | |
6966 | if (ug.memcg) | |
6967 | uncharge_batch(&ug); | |
0a31bc97 JW |
6968 | } |
6969 | ||
6970 | /** | |
6a93ca8f JW |
6971 | * mem_cgroup_migrate - charge a page's replacement |
6972 | * @oldpage: currently circulating page | |
6973 | * @newpage: replacement page | |
0a31bc97 | 6974 | * |
6a93ca8f JW |
6975 | * Charge @newpage as a replacement page for @oldpage. @oldpage will |
6976 | * be uncharged upon free. | |
0a31bc97 JW |
6977 | * |
6978 | * Both pages must be locked, @newpage->mapping must be set up. | |
6979 | */ | |
6a93ca8f | 6980 | void mem_cgroup_migrate(struct page *oldpage, struct page *newpage) |
0a31bc97 | 6981 | { |
29833315 | 6982 | struct mem_cgroup *memcg; |
44b7a8d3 | 6983 | unsigned int nr_pages; |
d93c4130 | 6984 | unsigned long flags; |
0a31bc97 JW |
6985 | |
6986 | VM_BUG_ON_PAGE(!PageLocked(oldpage), oldpage); | |
6987 | VM_BUG_ON_PAGE(!PageLocked(newpage), newpage); | |
0a31bc97 | 6988 | VM_BUG_ON_PAGE(PageAnon(oldpage) != PageAnon(newpage), newpage); |
6abb5a86 JW |
6989 | VM_BUG_ON_PAGE(PageTransHuge(oldpage) != PageTransHuge(newpage), |
6990 | newpage); | |
0a31bc97 JW |
6991 | |
6992 | if (mem_cgroup_disabled()) | |
6993 | return; | |
6994 | ||
6995 | /* Page cache replacement: new page already charged? */ | |
bcfe06bf | 6996 | if (page_memcg(newpage)) |
0a31bc97 JW |
6997 | return; |
6998 | ||
bcfe06bf | 6999 | memcg = page_memcg(oldpage); |
a4055888 | 7000 | VM_WARN_ON_ONCE_PAGE(!memcg, oldpage); |
29833315 | 7001 | if (!memcg) |
0a31bc97 JW |
7002 | return; |
7003 | ||
44b7a8d3 | 7004 | /* Force-charge the new page. The old one will be freed soon */ |
6c357848 | 7005 | nr_pages = thp_nr_pages(newpage); |
44b7a8d3 | 7006 | |
8dc87c7d MS |
7007 | if (!mem_cgroup_is_root(memcg)) { |
7008 | page_counter_charge(&memcg->memory, nr_pages); | |
7009 | if (do_memsw_account()) | |
7010 | page_counter_charge(&memcg->memsw, nr_pages); | |
7011 | } | |
0a31bc97 | 7012 | |
1a3e1f40 | 7013 | css_get(&memcg->css); |
d9eb1ea2 | 7014 | commit_charge(newpage, memcg); |
44b7a8d3 | 7015 | |
d93c4130 | 7016 | local_irq_save(flags); |
3fba69a5 | 7017 | mem_cgroup_charge_statistics(memcg, newpage, nr_pages); |
44b7a8d3 | 7018 | memcg_check_events(memcg, newpage); |
d93c4130 | 7019 | local_irq_restore(flags); |
0a31bc97 JW |
7020 | } |
7021 | ||
ef12947c | 7022 | DEFINE_STATIC_KEY_FALSE(memcg_sockets_enabled_key); |
11092087 JW |
7023 | EXPORT_SYMBOL(memcg_sockets_enabled_key); |
7024 | ||
2d758073 | 7025 | void mem_cgroup_sk_alloc(struct sock *sk) |
11092087 JW |
7026 | { |
7027 | struct mem_cgroup *memcg; | |
7028 | ||
2d758073 JW |
7029 | if (!mem_cgroup_sockets_enabled) |
7030 | return; | |
7031 | ||
e876ecc6 SB |
7032 | /* Do not associate the sock with unrelated interrupted task's memcg. */ |
7033 | if (in_interrupt()) | |
7034 | return; | |
7035 | ||
11092087 JW |
7036 | rcu_read_lock(); |
7037 | memcg = mem_cgroup_from_task(current); | |
f7e1cb6e JW |
7038 | if (memcg == root_mem_cgroup) |
7039 | goto out; | |
0db15298 | 7040 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && !memcg->tcpmem_active) |
f7e1cb6e | 7041 | goto out; |
8965aa28 | 7042 | if (css_tryget(&memcg->css)) |
11092087 | 7043 | sk->sk_memcg = memcg; |
f7e1cb6e | 7044 | out: |
11092087 JW |
7045 | rcu_read_unlock(); |
7046 | } | |
11092087 | 7047 | |
2d758073 | 7048 | void mem_cgroup_sk_free(struct sock *sk) |
11092087 | 7049 | { |
2d758073 JW |
7050 | if (sk->sk_memcg) |
7051 | css_put(&sk->sk_memcg->css); | |
11092087 JW |
7052 | } |
7053 | ||
7054 | /** | |
7055 | * mem_cgroup_charge_skmem - charge socket memory | |
7056 | * @memcg: memcg to charge | |
7057 | * @nr_pages: number of pages to charge | |
4b1327be | 7058 | * @gfp_mask: reclaim mode |
11092087 JW |
7059 | * |
7060 | * Charges @nr_pages to @memcg. Returns %true if the charge fit within | |
4b1327be | 7061 | * @memcg's configured limit, %false if it doesn't. |
11092087 | 7062 | */ |
4b1327be WW |
7063 | bool mem_cgroup_charge_skmem(struct mem_cgroup *memcg, unsigned int nr_pages, |
7064 | gfp_t gfp_mask) | |
11092087 | 7065 | { |
f7e1cb6e | 7066 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) { |
0db15298 | 7067 | struct page_counter *fail; |
f7e1cb6e | 7068 | |
0db15298 JW |
7069 | if (page_counter_try_charge(&memcg->tcpmem, nr_pages, &fail)) { |
7070 | memcg->tcpmem_pressure = 0; | |
f7e1cb6e JW |
7071 | return true; |
7072 | } | |
0db15298 | 7073 | memcg->tcpmem_pressure = 1; |
4b1327be WW |
7074 | if (gfp_mask & __GFP_NOFAIL) { |
7075 | page_counter_charge(&memcg->tcpmem, nr_pages); | |
7076 | return true; | |
7077 | } | |
f7e1cb6e | 7078 | return false; |
11092087 | 7079 | } |
d886f4e4 | 7080 | |
4b1327be WW |
7081 | if (try_charge(memcg, gfp_mask, nr_pages) == 0) { |
7082 | mod_memcg_state(memcg, MEMCG_SOCK, nr_pages); | |
f7e1cb6e | 7083 | return true; |
4b1327be | 7084 | } |
f7e1cb6e | 7085 | |
11092087 JW |
7086 | return false; |
7087 | } | |
7088 | ||
7089 | /** | |
7090 | * mem_cgroup_uncharge_skmem - uncharge socket memory | |
b7701a5f MR |
7091 | * @memcg: memcg to uncharge |
7092 | * @nr_pages: number of pages to uncharge | |
11092087 JW |
7093 | */ |
7094 | void mem_cgroup_uncharge_skmem(struct mem_cgroup *memcg, unsigned int nr_pages) | |
7095 | { | |
f7e1cb6e | 7096 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) { |
0db15298 | 7097 | page_counter_uncharge(&memcg->tcpmem, nr_pages); |
f7e1cb6e JW |
7098 | return; |
7099 | } | |
d886f4e4 | 7100 | |
c9019e9b | 7101 | mod_memcg_state(memcg, MEMCG_SOCK, -nr_pages); |
b2807f07 | 7102 | |
475d0487 | 7103 | refill_stock(memcg, nr_pages); |
11092087 JW |
7104 | } |
7105 | ||
f7e1cb6e JW |
7106 | static int __init cgroup_memory(char *s) |
7107 | { | |
7108 | char *token; | |
7109 | ||
7110 | while ((token = strsep(&s, ",")) != NULL) { | |
7111 | if (!*token) | |
7112 | continue; | |
7113 | if (!strcmp(token, "nosocket")) | |
7114 | cgroup_memory_nosocket = true; | |
04823c83 VD |
7115 | if (!strcmp(token, "nokmem")) |
7116 | cgroup_memory_nokmem = true; | |
f7e1cb6e | 7117 | } |
1673df18 | 7118 | return 1; |
f7e1cb6e JW |
7119 | } |
7120 | __setup("cgroup.memory=", cgroup_memory); | |
11092087 | 7121 | |
2d11085e | 7122 | /* |
1081312f MH |
7123 | * subsys_initcall() for memory controller. |
7124 | * | |
308167fc SAS |
7125 | * Some parts like memcg_hotplug_cpu_dead() have to be initialized from this |
7126 | * context because of lock dependencies (cgroup_lock -> cpu hotplug) but | |
7127 | * basically everything that doesn't depend on a specific mem_cgroup structure | |
7128 | * should be initialized from here. | |
2d11085e MH |
7129 | */ |
7130 | static int __init mem_cgroup_init(void) | |
7131 | { | |
95a045f6 JW |
7132 | int cpu, node; |
7133 | ||
f3344adf MS |
7134 | /* |
7135 | * Currently s32 type (can refer to struct batched_lruvec_stat) is | |
7136 | * used for per-memcg-per-cpu caching of per-node statistics. In order | |
7137 | * to work fine, we should make sure that the overfill threshold can't | |
7138 | * exceed S32_MAX / PAGE_SIZE. | |
7139 | */ | |
7140 | BUILD_BUG_ON(MEMCG_CHARGE_BATCH > S32_MAX / PAGE_SIZE); | |
7141 | ||
308167fc SAS |
7142 | cpuhp_setup_state_nocalls(CPUHP_MM_MEMCQ_DEAD, "mm/memctrl:dead", NULL, |
7143 | memcg_hotplug_cpu_dead); | |
95a045f6 JW |
7144 | |
7145 | for_each_possible_cpu(cpu) | |
7146 | INIT_WORK(&per_cpu_ptr(&memcg_stock, cpu)->work, | |
7147 | drain_local_stock); | |
7148 | ||
7149 | for_each_node(node) { | |
7150 | struct mem_cgroup_tree_per_node *rtpn; | |
95a045f6 JW |
7151 | |
7152 | rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL, | |
7153 | node_online(node) ? node : NUMA_NO_NODE); | |
7154 | ||
ef8f2327 | 7155 | rtpn->rb_root = RB_ROOT; |
fa90b2fd | 7156 | rtpn->rb_rightmost = NULL; |
ef8f2327 | 7157 | spin_lock_init(&rtpn->lock); |
95a045f6 JW |
7158 | soft_limit_tree.rb_tree_per_node[node] = rtpn; |
7159 | } | |
7160 | ||
2d11085e MH |
7161 | return 0; |
7162 | } | |
7163 | subsys_initcall(mem_cgroup_init); | |
21afa38e JW |
7164 | |
7165 | #ifdef CONFIG_MEMCG_SWAP | |
358c07fc AB |
7166 | static struct mem_cgroup *mem_cgroup_id_get_online(struct mem_cgroup *memcg) |
7167 | { | |
1c2d479a | 7168 | while (!refcount_inc_not_zero(&memcg->id.ref)) { |
358c07fc AB |
7169 | /* |
7170 | * The root cgroup cannot be destroyed, so it's refcount must | |
7171 | * always be >= 1. | |
7172 | */ | |
7173 | if (WARN_ON_ONCE(memcg == root_mem_cgroup)) { | |
7174 | VM_BUG_ON(1); | |
7175 | break; | |
7176 | } | |
7177 | memcg = parent_mem_cgroup(memcg); | |
7178 | if (!memcg) | |
7179 | memcg = root_mem_cgroup; | |
7180 | } | |
7181 | return memcg; | |
7182 | } | |
7183 | ||
21afa38e JW |
7184 | /** |
7185 | * mem_cgroup_swapout - transfer a memsw charge to swap | |
7186 | * @page: page whose memsw charge to transfer | |
7187 | * @entry: swap entry to move the charge to | |
7188 | * | |
7189 | * Transfer the memsw charge of @page to @entry. | |
7190 | */ | |
7191 | void mem_cgroup_swapout(struct page *page, swp_entry_t entry) | |
7192 | { | |
1f47b61f | 7193 | struct mem_cgroup *memcg, *swap_memcg; |
d6810d73 | 7194 | unsigned int nr_entries; |
21afa38e JW |
7195 | unsigned short oldid; |
7196 | ||
7197 | VM_BUG_ON_PAGE(PageLRU(page), page); | |
7198 | VM_BUG_ON_PAGE(page_count(page), page); | |
7199 | ||
76358ab5 AS |
7200 | if (mem_cgroup_disabled()) |
7201 | return; | |
7202 | ||
2d1c4980 | 7203 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
21afa38e JW |
7204 | return; |
7205 | ||
bcfe06bf | 7206 | memcg = page_memcg(page); |
21afa38e | 7207 | |
a4055888 | 7208 | VM_WARN_ON_ONCE_PAGE(!memcg, page); |
21afa38e JW |
7209 | if (!memcg) |
7210 | return; | |
7211 | ||
1f47b61f VD |
7212 | /* |
7213 | * In case the memcg owning these pages has been offlined and doesn't | |
7214 | * have an ID allocated to it anymore, charge the closest online | |
7215 | * ancestor for the swap instead and transfer the memory+swap charge. | |
7216 | */ | |
7217 | swap_memcg = mem_cgroup_id_get_online(memcg); | |
6c357848 | 7218 | nr_entries = thp_nr_pages(page); |
d6810d73 HY |
7219 | /* Get references for the tail pages, too */ |
7220 | if (nr_entries > 1) | |
7221 | mem_cgroup_id_get_many(swap_memcg, nr_entries - 1); | |
7222 | oldid = swap_cgroup_record(entry, mem_cgroup_id(swap_memcg), | |
7223 | nr_entries); | |
21afa38e | 7224 | VM_BUG_ON_PAGE(oldid, page); |
c9019e9b | 7225 | mod_memcg_state(swap_memcg, MEMCG_SWAP, nr_entries); |
21afa38e | 7226 | |
bcfe06bf | 7227 | page->memcg_data = 0; |
21afa38e JW |
7228 | |
7229 | if (!mem_cgroup_is_root(memcg)) | |
d6810d73 | 7230 | page_counter_uncharge(&memcg->memory, nr_entries); |
21afa38e | 7231 | |
2d1c4980 | 7232 | if (!cgroup_memory_noswap && memcg != swap_memcg) { |
1f47b61f | 7233 | if (!mem_cgroup_is_root(swap_memcg)) |
d6810d73 HY |
7234 | page_counter_charge(&swap_memcg->memsw, nr_entries); |
7235 | page_counter_uncharge(&memcg->memsw, nr_entries); | |
1f47b61f VD |
7236 | } |
7237 | ||
ce9ce665 SAS |
7238 | /* |
7239 | * Interrupts should be disabled here because the caller holds the | |
b93b0163 | 7240 | * i_pages lock which is taken with interrupts-off. It is |
ce9ce665 | 7241 | * important here to have the interrupts disabled because it is the |
b93b0163 | 7242 | * only synchronisation we have for updating the per-CPU variables. |
ce9ce665 SAS |
7243 | */ |
7244 | VM_BUG_ON(!irqs_disabled()); | |
3fba69a5 | 7245 | mem_cgroup_charge_statistics(memcg, page, -nr_entries); |
21afa38e | 7246 | memcg_check_events(memcg, page); |
73f576c0 | 7247 | |
1a3e1f40 | 7248 | css_put(&memcg->css); |
21afa38e JW |
7249 | } |
7250 | ||
38d8b4e6 | 7251 | /** |
01c4b28c | 7252 | * __mem_cgroup_try_charge_swap - try charging swap space for a page |
37e84351 VD |
7253 | * @page: page being added to swap |
7254 | * @entry: swap entry to charge | |
7255 | * | |
38d8b4e6 | 7256 | * Try to charge @page's memcg for the swap space at @entry. |
37e84351 VD |
7257 | * |
7258 | * Returns 0 on success, -ENOMEM on failure. | |
7259 | */ | |
01c4b28c | 7260 | int __mem_cgroup_try_charge_swap(struct page *page, swp_entry_t entry) |
37e84351 | 7261 | { |
6c357848 | 7262 | unsigned int nr_pages = thp_nr_pages(page); |
37e84351 | 7263 | struct page_counter *counter; |
38d8b4e6 | 7264 | struct mem_cgroup *memcg; |
37e84351 VD |
7265 | unsigned short oldid; |
7266 | ||
2d1c4980 | 7267 | if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
37e84351 VD |
7268 | return 0; |
7269 | ||
bcfe06bf | 7270 | memcg = page_memcg(page); |
37e84351 | 7271 | |
a4055888 | 7272 | VM_WARN_ON_ONCE_PAGE(!memcg, page); |
37e84351 VD |
7273 | if (!memcg) |
7274 | return 0; | |
7275 | ||
f3a53a3a TH |
7276 | if (!entry.val) { |
7277 | memcg_memory_event(memcg, MEMCG_SWAP_FAIL); | |
bb98f2c5 | 7278 | return 0; |
f3a53a3a | 7279 | } |
bb98f2c5 | 7280 | |
1f47b61f VD |
7281 | memcg = mem_cgroup_id_get_online(memcg); |
7282 | ||
2d1c4980 | 7283 | if (!cgroup_memory_noswap && !mem_cgroup_is_root(memcg) && |
38d8b4e6 | 7284 | !page_counter_try_charge(&memcg->swap, nr_pages, &counter)) { |
f3a53a3a TH |
7285 | memcg_memory_event(memcg, MEMCG_SWAP_MAX); |
7286 | memcg_memory_event(memcg, MEMCG_SWAP_FAIL); | |
1f47b61f | 7287 | mem_cgroup_id_put(memcg); |
37e84351 | 7288 | return -ENOMEM; |
1f47b61f | 7289 | } |
37e84351 | 7290 | |
38d8b4e6 HY |
7291 | /* Get references for the tail pages, too */ |
7292 | if (nr_pages > 1) | |
7293 | mem_cgroup_id_get_many(memcg, nr_pages - 1); | |
7294 | oldid = swap_cgroup_record(entry, mem_cgroup_id(memcg), nr_pages); | |
37e84351 | 7295 | VM_BUG_ON_PAGE(oldid, page); |
c9019e9b | 7296 | mod_memcg_state(memcg, MEMCG_SWAP, nr_pages); |
37e84351 | 7297 | |
37e84351 VD |
7298 | return 0; |
7299 | } | |
7300 | ||
21afa38e | 7301 | /** |
01c4b28c | 7302 | * __mem_cgroup_uncharge_swap - uncharge swap space |
21afa38e | 7303 | * @entry: swap entry to uncharge |
38d8b4e6 | 7304 | * @nr_pages: the amount of swap space to uncharge |
21afa38e | 7305 | */ |
01c4b28c | 7306 | void __mem_cgroup_uncharge_swap(swp_entry_t entry, unsigned int nr_pages) |
21afa38e JW |
7307 | { |
7308 | struct mem_cgroup *memcg; | |
7309 | unsigned short id; | |
7310 | ||
38d8b4e6 | 7311 | id = swap_cgroup_record(entry, 0, nr_pages); |
21afa38e | 7312 | rcu_read_lock(); |
adbe427b | 7313 | memcg = mem_cgroup_from_id(id); |
21afa38e | 7314 | if (memcg) { |
2d1c4980 | 7315 | if (!cgroup_memory_noswap && !mem_cgroup_is_root(memcg)) { |
37e84351 | 7316 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
38d8b4e6 | 7317 | page_counter_uncharge(&memcg->swap, nr_pages); |
37e84351 | 7318 | else |
38d8b4e6 | 7319 | page_counter_uncharge(&memcg->memsw, nr_pages); |
37e84351 | 7320 | } |
c9019e9b | 7321 | mod_memcg_state(memcg, MEMCG_SWAP, -nr_pages); |
38d8b4e6 | 7322 | mem_cgroup_id_put_many(memcg, nr_pages); |
21afa38e JW |
7323 | } |
7324 | rcu_read_unlock(); | |
7325 | } | |
7326 | ||
d8b38438 VD |
7327 | long mem_cgroup_get_nr_swap_pages(struct mem_cgroup *memcg) |
7328 | { | |
7329 | long nr_swap_pages = get_nr_swap_pages(); | |
7330 | ||
eccb52e7 | 7331 | if (cgroup_memory_noswap || !cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
d8b38438 VD |
7332 | return nr_swap_pages; |
7333 | for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg)) | |
7334 | nr_swap_pages = min_t(long, nr_swap_pages, | |
bbec2e15 | 7335 | READ_ONCE(memcg->swap.max) - |
d8b38438 VD |
7336 | page_counter_read(&memcg->swap)); |
7337 | return nr_swap_pages; | |
7338 | } | |
7339 | ||
5ccc5aba VD |
7340 | bool mem_cgroup_swap_full(struct page *page) |
7341 | { | |
7342 | struct mem_cgroup *memcg; | |
7343 | ||
7344 | VM_BUG_ON_PAGE(!PageLocked(page), page); | |
7345 | ||
7346 | if (vm_swap_full()) | |
7347 | return true; | |
eccb52e7 | 7348 | if (cgroup_memory_noswap || !cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
5ccc5aba VD |
7349 | return false; |
7350 | ||
bcfe06bf | 7351 | memcg = page_memcg(page); |
5ccc5aba VD |
7352 | if (!memcg) |
7353 | return false; | |
7354 | ||
4b82ab4f JK |
7355 | for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg)) { |
7356 | unsigned long usage = page_counter_read(&memcg->swap); | |
7357 | ||
7358 | if (usage * 2 >= READ_ONCE(memcg->swap.high) || | |
7359 | usage * 2 >= READ_ONCE(memcg->swap.max)) | |
5ccc5aba | 7360 | return true; |
4b82ab4f | 7361 | } |
5ccc5aba VD |
7362 | |
7363 | return false; | |
7364 | } | |
7365 | ||
eccb52e7 | 7366 | static int __init setup_swap_account(char *s) |
21afa38e JW |
7367 | { |
7368 | if (!strcmp(s, "1")) | |
5ab92901 | 7369 | cgroup_memory_noswap = false; |
21afa38e | 7370 | else if (!strcmp(s, "0")) |
5ab92901 | 7371 | cgroup_memory_noswap = true; |
21afa38e JW |
7372 | return 1; |
7373 | } | |
eccb52e7 | 7374 | __setup("swapaccount=", setup_swap_account); |
21afa38e | 7375 | |
37e84351 VD |
7376 | static u64 swap_current_read(struct cgroup_subsys_state *css, |
7377 | struct cftype *cft) | |
7378 | { | |
7379 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); | |
7380 | ||
7381 | return (u64)page_counter_read(&memcg->swap) * PAGE_SIZE; | |
7382 | } | |
7383 | ||
4b82ab4f JK |
7384 | static int swap_high_show(struct seq_file *m, void *v) |
7385 | { | |
7386 | return seq_puts_memcg_tunable(m, | |
7387 | READ_ONCE(mem_cgroup_from_seq(m)->swap.high)); | |
7388 | } | |
7389 | ||
7390 | static ssize_t swap_high_write(struct kernfs_open_file *of, | |
7391 | char *buf, size_t nbytes, loff_t off) | |
7392 | { | |
7393 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
7394 | unsigned long high; | |
7395 | int err; | |
7396 | ||
7397 | buf = strstrip(buf); | |
7398 | err = page_counter_memparse(buf, "max", &high); | |
7399 | if (err) | |
7400 | return err; | |
7401 | ||
7402 | page_counter_set_high(&memcg->swap, high); | |
7403 | ||
7404 | return nbytes; | |
7405 | } | |
7406 | ||
37e84351 VD |
7407 | static int swap_max_show(struct seq_file *m, void *v) |
7408 | { | |
677dc973 CD |
7409 | return seq_puts_memcg_tunable(m, |
7410 | READ_ONCE(mem_cgroup_from_seq(m)->swap.max)); | |
37e84351 VD |
7411 | } |
7412 | ||
7413 | static ssize_t swap_max_write(struct kernfs_open_file *of, | |
7414 | char *buf, size_t nbytes, loff_t off) | |
7415 | { | |
7416 | struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of)); | |
7417 | unsigned long max; | |
7418 | int err; | |
7419 | ||
7420 | buf = strstrip(buf); | |
7421 | err = page_counter_memparse(buf, "max", &max); | |
7422 | if (err) | |
7423 | return err; | |
7424 | ||
be09102b | 7425 | xchg(&memcg->swap.max, max); |
37e84351 VD |
7426 | |
7427 | return nbytes; | |
7428 | } | |
7429 | ||
f3a53a3a TH |
7430 | static int swap_events_show(struct seq_file *m, void *v) |
7431 | { | |
aa9694bb | 7432 | struct mem_cgroup *memcg = mem_cgroup_from_seq(m); |
f3a53a3a | 7433 | |
4b82ab4f JK |
7434 | seq_printf(m, "high %lu\n", |
7435 | atomic_long_read(&memcg->memory_events[MEMCG_SWAP_HIGH])); | |
f3a53a3a TH |
7436 | seq_printf(m, "max %lu\n", |
7437 | atomic_long_read(&memcg->memory_events[MEMCG_SWAP_MAX])); | |
7438 | seq_printf(m, "fail %lu\n", | |
7439 | atomic_long_read(&memcg->memory_events[MEMCG_SWAP_FAIL])); | |
7440 | ||
7441 | return 0; | |
7442 | } | |
7443 | ||
37e84351 VD |
7444 | static struct cftype swap_files[] = { |
7445 | { | |
7446 | .name = "swap.current", | |
7447 | .flags = CFTYPE_NOT_ON_ROOT, | |
7448 | .read_u64 = swap_current_read, | |
7449 | }, | |
4b82ab4f JK |
7450 | { |
7451 | .name = "swap.high", | |
7452 | .flags = CFTYPE_NOT_ON_ROOT, | |
7453 | .seq_show = swap_high_show, | |
7454 | .write = swap_high_write, | |
7455 | }, | |
37e84351 VD |
7456 | { |
7457 | .name = "swap.max", | |
7458 | .flags = CFTYPE_NOT_ON_ROOT, | |
7459 | .seq_show = swap_max_show, | |
7460 | .write = swap_max_write, | |
7461 | }, | |
f3a53a3a TH |
7462 | { |
7463 | .name = "swap.events", | |
7464 | .flags = CFTYPE_NOT_ON_ROOT, | |
7465 | .file_offset = offsetof(struct mem_cgroup, swap_events_file), | |
7466 | .seq_show = swap_events_show, | |
7467 | }, | |
37e84351 VD |
7468 | { } /* terminate */ |
7469 | }; | |
7470 | ||
eccb52e7 | 7471 | static struct cftype memsw_files[] = { |
21afa38e JW |
7472 | { |
7473 | .name = "memsw.usage_in_bytes", | |
7474 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE), | |
7475 | .read_u64 = mem_cgroup_read_u64, | |
7476 | }, | |
7477 | { | |
7478 | .name = "memsw.max_usage_in_bytes", | |
7479 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE), | |
7480 | .write = mem_cgroup_reset, | |
7481 | .read_u64 = mem_cgroup_read_u64, | |
7482 | }, | |
7483 | { | |
7484 | .name = "memsw.limit_in_bytes", | |
7485 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT), | |
7486 | .write = mem_cgroup_write, | |
7487 | .read_u64 = mem_cgroup_read_u64, | |
7488 | }, | |
7489 | { | |
7490 | .name = "memsw.failcnt", | |
7491 | .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT), | |
7492 | .write = mem_cgroup_reset, | |
7493 | .read_u64 = mem_cgroup_read_u64, | |
7494 | }, | |
7495 | { }, /* terminate */ | |
7496 | }; | |
7497 | ||
82ff165c BS |
7498 | /* |
7499 | * If mem_cgroup_swap_init() is implemented as a subsys_initcall() | |
7500 | * instead of a core_initcall(), this could mean cgroup_memory_noswap still | |
7501 | * remains set to false even when memcg is disabled via "cgroup_disable=memory" | |
7502 | * boot parameter. This may result in premature OOPS inside | |
7503 | * mem_cgroup_get_nr_swap_pages() function in corner cases. | |
7504 | */ | |
21afa38e JW |
7505 | static int __init mem_cgroup_swap_init(void) |
7506 | { | |
2d1c4980 JW |
7507 | /* No memory control -> no swap control */ |
7508 | if (mem_cgroup_disabled()) | |
7509 | cgroup_memory_noswap = true; | |
7510 | ||
7511 | if (cgroup_memory_noswap) | |
eccb52e7 JW |
7512 | return 0; |
7513 | ||
7514 | WARN_ON(cgroup_add_dfl_cftypes(&memory_cgrp_subsys, swap_files)); | |
7515 | WARN_ON(cgroup_add_legacy_cftypes(&memory_cgrp_subsys, memsw_files)); | |
7516 | ||
21afa38e JW |
7517 | return 0; |
7518 | } | |
82ff165c | 7519 | core_initcall(mem_cgroup_swap_init); |
21afa38e JW |
7520 | |
7521 | #endif /* CONFIG_MEMCG_SWAP */ |