1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /* memcontrol.c - Memory Controller
4 * Copyright IBM Corporation, 2007
5 * Author Balbir Singh <balbir@linux.vnet.ibm.com>
7 * Copyright 2007 OpenVZ SWsoft Inc
8 * Author: Pavel Emelianov <xemul@openvz.org>
11 * Copyright (C) 2009 Nokia Corporation
12 * Author: Kirill A. Shutemov
14 * Kernel Memory Controller
15 * Copyright (C) 2012 Parallels Inc. and Google Inc.
16 * Authors: Glauber Costa and Suleiman Souhlal
19 * Charge lifetime sanitation
20 * Lockless page tracking & accounting
21 * Unified hierarchy configuration model
22 * Copyright (C) 2015 Red Hat, Inc., Johannes Weiner
25 #include <linux/page_counter.h>
26 #include <linux/memcontrol.h>
27 #include <linux/cgroup.h>
28 #include <linux/pagewalk.h>
29 #include <linux/sched/mm.h>
30 #include <linux/shmem_fs.h>
31 #include <linux/hugetlb.h>
32 #include <linux/pagemap.h>
33 #include <linux/vm_event_item.h>
34 #include <linux/smp.h>
35 #include <linux/page-flags.h>
36 #include <linux/backing-dev.h>
37 #include <linux/bit_spinlock.h>
38 #include <linux/rcupdate.h>
39 #include <linux/limits.h>
40 #include <linux/export.h>
41 #include <linux/mutex.h>
42 #include <linux/rbtree.h>
43 #include <linux/slab.h>
44 #include <linux/swap.h>
45 #include <linux/swapops.h>
46 #include <linux/spinlock.h>
47 #include <linux/eventfd.h>
48 #include <linux/poll.h>
49 #include <linux/sort.h>
51 #include <linux/seq_file.h>
52 #include <linux/vmpressure.h>
53 #include <linux/mm_inline.h>
54 #include <linux/swap_cgroup.h>
55 #include <linux/cpu.h>
56 #include <linux/oom.h>
57 #include <linux/lockdep.h>
58 #include <linux/file.h>
59 #include <linux/tracehook.h>
60 #include <linux/psi.h>
61 #include <linux/seq_buf.h>
67 #include <linux/uaccess.h>
69 #include <trace/events/vmscan.h>
71 struct cgroup_subsys memory_cgrp_subsys __read_mostly
;
72 EXPORT_SYMBOL(memory_cgrp_subsys
);
74 struct mem_cgroup
*root_mem_cgroup __read_mostly
;
76 /* Active memory cgroup to use from an interrupt context */
77 DEFINE_PER_CPU(struct mem_cgroup
*, int_active_memcg
);
79 /* Socket memory accounting disabled? */
80 static bool cgroup_memory_nosocket
;
82 /* Kernel memory accounting disabled? */
83 static bool cgroup_memory_nokmem
;
85 /* Whether the swap controller is active */
86 #ifdef CONFIG_MEMCG_SWAP
87 bool cgroup_memory_noswap __read_mostly
;
89 #define cgroup_memory_noswap 1
92 #ifdef CONFIG_CGROUP_WRITEBACK
93 static DECLARE_WAIT_QUEUE_HEAD(memcg_cgwb_frn_waitq
);
96 /* Whether legacy memory+swap accounting is active */
97 static bool do_memsw_account(void)
99 return !cgroup_subsys_on_dfl(memory_cgrp_subsys
) && !cgroup_memory_noswap
;
102 #define THRESHOLDS_EVENTS_TARGET 128
103 #define SOFTLIMIT_EVENTS_TARGET 1024
106 * Cgroups above their limits are maintained in a RB-Tree, independent of
107 * their hierarchy representation
110 struct mem_cgroup_tree_per_node
{
111 struct rb_root rb_root
;
112 struct rb_node
*rb_rightmost
;
116 struct mem_cgroup_tree
{
117 struct mem_cgroup_tree_per_node
*rb_tree_per_node
[MAX_NUMNODES
];
120 static struct mem_cgroup_tree soft_limit_tree __read_mostly
;
123 struct mem_cgroup_eventfd_list
{
124 struct list_head list
;
125 struct eventfd_ctx
*eventfd
;
129 * cgroup_event represents events which userspace want to receive.
131 struct mem_cgroup_event
{
133 * memcg which the event belongs to.
135 struct mem_cgroup
*memcg
;
137 * eventfd to signal userspace about the event.
139 struct eventfd_ctx
*eventfd
;
141 * Each of these stored in a list by the cgroup.
143 struct list_head list
;
145 * register_event() callback will be used to add new userspace
146 * waiter for changes related to this event. Use eventfd_signal()
147 * on eventfd to send notification to userspace.
149 int (*register_event
)(struct mem_cgroup
*memcg
,
150 struct eventfd_ctx
*eventfd
, const char *args
);
152 * unregister_event() callback will be called when userspace closes
153 * the eventfd or on cgroup removing. This callback must be set,
154 * if you want provide notification functionality.
156 void (*unregister_event
)(struct mem_cgroup
*memcg
,
157 struct eventfd_ctx
*eventfd
);
159 * All fields below needed to unregister event when
160 * userspace closes eventfd.
163 wait_queue_head_t
*wqh
;
164 wait_queue_entry_t wait
;
165 struct work_struct remove
;
168 static void mem_cgroup_threshold(struct mem_cgroup
*memcg
);
169 static void mem_cgroup_oom_notify(struct mem_cgroup
*memcg
);
171 /* Stuffs for move charges at task migration. */
173 * Types of charges to be moved.
175 #define MOVE_ANON 0x1U
176 #define MOVE_FILE 0x2U
177 #define MOVE_MASK (MOVE_ANON | MOVE_FILE)
179 /* "mc" and its members are protected by cgroup_mutex */
180 static struct move_charge_struct
{
181 spinlock_t lock
; /* for from, to */
182 struct mm_struct
*mm
;
183 struct mem_cgroup
*from
;
184 struct mem_cgroup
*to
;
186 unsigned long precharge
;
187 unsigned long moved_charge
;
188 unsigned long moved_swap
;
189 struct task_struct
*moving_task
; /* a task moving charges */
190 wait_queue_head_t waitq
; /* a waitq for other context */
192 .lock
= __SPIN_LOCK_UNLOCKED(mc
.lock
),
193 .waitq
= __WAIT_QUEUE_HEAD_INITIALIZER(mc
.waitq
),
197 * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft
198 * limit reclaim to prevent infinite loops, if they ever occur.
200 #define MEM_CGROUP_MAX_RECLAIM_LOOPS 100
201 #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS 2
203 /* for encoding cft->private value on file */
212 #define MEMFILE_PRIVATE(x, val) ((x) << 16 | (val))
213 #define MEMFILE_TYPE(val) ((val) >> 16 & 0xffff)
214 #define MEMFILE_ATTR(val) ((val) & 0xffff)
215 /* Used for OOM nofiier */
216 #define OOM_CONTROL (0)
219 * Iteration constructs for visiting all cgroups (under a tree). If
220 * loops are exited prematurely (break), mem_cgroup_iter_break() must
221 * be used for reference counting.
223 #define for_each_mem_cgroup_tree(iter, root) \
224 for (iter = mem_cgroup_iter(root, NULL, NULL); \
226 iter = mem_cgroup_iter(root, iter, NULL))
228 #define for_each_mem_cgroup(iter) \
229 for (iter = mem_cgroup_iter(NULL, NULL, NULL); \
231 iter = mem_cgroup_iter(NULL, iter, NULL))
233 static inline bool should_force_charge(void)
235 return tsk_is_oom_victim(current
) || fatal_signal_pending(current
) ||
236 (current
->flags
& PF_EXITING
);
239 /* Some nice accessors for the vmpressure. */
240 struct vmpressure
*memcg_to_vmpressure(struct mem_cgroup
*memcg
)
243 memcg
= root_mem_cgroup
;
244 return &memcg
->vmpressure
;
247 struct cgroup_subsys_state
*vmpressure_to_css(struct vmpressure
*vmpr
)
249 return &container_of(vmpr
, struct mem_cgroup
, vmpressure
)->css
;
252 #ifdef CONFIG_MEMCG_KMEM
253 extern spinlock_t css_set_lock
;
255 static void obj_cgroup_release(struct percpu_ref
*ref
)
257 struct obj_cgroup
*objcg
= container_of(ref
, struct obj_cgroup
, refcnt
);
258 struct mem_cgroup
*memcg
;
259 unsigned int nr_bytes
;
260 unsigned int nr_pages
;
264 * At this point all allocated objects are freed, and
265 * objcg->nr_charged_bytes can't have an arbitrary byte value.
266 * However, it can be PAGE_SIZE or (x * PAGE_SIZE).
268 * The following sequence can lead to it:
269 * 1) CPU0: objcg == stock->cached_objcg
270 * 2) CPU1: we do a small allocation (e.g. 92 bytes),
271 * PAGE_SIZE bytes are charged
272 * 3) CPU1: a process from another memcg is allocating something,
273 * the stock if flushed,
274 * objcg->nr_charged_bytes = PAGE_SIZE - 92
275 * 5) CPU0: we do release this object,
276 * 92 bytes are added to stock->nr_bytes
277 * 6) CPU0: stock is flushed,
278 * 92 bytes are added to objcg->nr_charged_bytes
280 * In the result, nr_charged_bytes == PAGE_SIZE.
281 * This page will be uncharged in obj_cgroup_release().
283 nr_bytes
= atomic_read(&objcg
->nr_charged_bytes
);
284 WARN_ON_ONCE(nr_bytes
& (PAGE_SIZE
- 1));
285 nr_pages
= nr_bytes
>> PAGE_SHIFT
;
287 spin_lock_irqsave(&css_set_lock
, flags
);
288 memcg
= obj_cgroup_memcg(objcg
);
290 __memcg_kmem_uncharge(memcg
, nr_pages
);
291 list_del(&objcg
->list
);
292 mem_cgroup_put(memcg
);
293 spin_unlock_irqrestore(&css_set_lock
, flags
);
295 percpu_ref_exit(ref
);
296 kfree_rcu(objcg
, rcu
);
299 static struct obj_cgroup
*obj_cgroup_alloc(void)
301 struct obj_cgroup
*objcg
;
304 objcg
= kzalloc(sizeof(struct obj_cgroup
), GFP_KERNEL
);
308 ret
= percpu_ref_init(&objcg
->refcnt
, obj_cgroup_release
, 0,
314 INIT_LIST_HEAD(&objcg
->list
);
318 static void memcg_reparent_objcgs(struct mem_cgroup
*memcg
,
319 struct mem_cgroup
*parent
)
321 struct obj_cgroup
*objcg
, *iter
;
323 objcg
= rcu_replace_pointer(memcg
->objcg
, NULL
, true);
325 spin_lock_irq(&css_set_lock
);
327 /* Move active objcg to the parent's list */
328 xchg(&objcg
->memcg
, parent
);
329 css_get(&parent
->css
);
330 list_add(&objcg
->list
, &parent
->objcg_list
);
332 /* Move already reparented objcgs to the parent's list */
333 list_for_each_entry(iter
, &memcg
->objcg_list
, list
) {
334 css_get(&parent
->css
);
335 xchg(&iter
->memcg
, parent
);
336 css_put(&memcg
->css
);
338 list_splice(&memcg
->objcg_list
, &parent
->objcg_list
);
340 spin_unlock_irq(&css_set_lock
);
342 percpu_ref_kill(&objcg
->refcnt
);
346 * This will be used as a shrinker list's index.
347 * The main reason for not using cgroup id for this:
348 * this works better in sparse environments, where we have a lot of memcgs,
349 * but only a few kmem-limited. Or also, if we have, for instance, 200
350 * memcgs, and none but the 200th is kmem-limited, we'd have to have a
351 * 200 entry array for that.
353 * The current size of the caches array is stored in memcg_nr_cache_ids. It
354 * will double each time we have to increase it.
356 static DEFINE_IDA(memcg_cache_ida
);
357 int memcg_nr_cache_ids
;
359 /* Protects memcg_nr_cache_ids */
360 static DECLARE_RWSEM(memcg_cache_ids_sem
);
362 void memcg_get_cache_ids(void)
364 down_read(&memcg_cache_ids_sem
);
367 void memcg_put_cache_ids(void)
369 up_read(&memcg_cache_ids_sem
);
373 * MIN_SIZE is different than 1, because we would like to avoid going through
374 * the alloc/free process all the time. In a small machine, 4 kmem-limited
375 * cgroups is a reasonable guess. In the future, it could be a parameter or
376 * tunable, but that is strictly not necessary.
378 * MAX_SIZE should be as large as the number of cgrp_ids. Ideally, we could get
379 * this constant directly from cgroup, but it is understandable that this is
380 * better kept as an internal representation in cgroup.c. In any case, the
381 * cgrp_id space is not getting any smaller, and we don't have to necessarily
382 * increase ours as well if it increases.
384 #define MEMCG_CACHES_MIN_SIZE 4
385 #define MEMCG_CACHES_MAX_SIZE MEM_CGROUP_ID_MAX
388 * A lot of the calls to the cache allocation functions are expected to be
389 * inlined by the compiler. Since the calls to memcg_slab_pre_alloc_hook() are
390 * conditional to this static branch, we'll have to allow modules that does
391 * kmem_cache_alloc and the such to see this symbol as well
393 DEFINE_STATIC_KEY_FALSE(memcg_kmem_enabled_key
);
394 EXPORT_SYMBOL(memcg_kmem_enabled_key
);
397 static int memcg_shrinker_map_size
;
398 static DEFINE_MUTEX(memcg_shrinker_map_mutex
);
400 static void memcg_free_shrinker_map_rcu(struct rcu_head
*head
)
402 kvfree(container_of(head
, struct memcg_shrinker_map
, rcu
));
405 static int memcg_expand_one_shrinker_map(struct mem_cgroup
*memcg
,
406 int size
, int old_size
)
408 struct memcg_shrinker_map
*new, *old
;
411 lockdep_assert_held(&memcg_shrinker_map_mutex
);
414 old
= rcu_dereference_protected(
415 mem_cgroup_nodeinfo(memcg
, nid
)->shrinker_map
, true);
416 /* Not yet online memcg */
420 new = kvmalloc_node(sizeof(*new) + size
, GFP_KERNEL
, nid
);
424 /* Set all old bits, clear all new bits */
425 memset(new->map
, (int)0xff, old_size
);
426 memset((void *)new->map
+ old_size
, 0, size
- old_size
);
428 rcu_assign_pointer(memcg
->nodeinfo
[nid
]->shrinker_map
, new);
429 call_rcu(&old
->rcu
, memcg_free_shrinker_map_rcu
);
435 static void memcg_free_shrinker_maps(struct mem_cgroup
*memcg
)
437 struct mem_cgroup_per_node
*pn
;
438 struct memcg_shrinker_map
*map
;
441 if (mem_cgroup_is_root(memcg
))
445 pn
= mem_cgroup_nodeinfo(memcg
, nid
);
446 map
= rcu_dereference_protected(pn
->shrinker_map
, true);
449 rcu_assign_pointer(pn
->shrinker_map
, NULL
);
453 static int memcg_alloc_shrinker_maps(struct mem_cgroup
*memcg
)
455 struct memcg_shrinker_map
*map
;
456 int nid
, size
, ret
= 0;
458 if (mem_cgroup_is_root(memcg
))
461 mutex_lock(&memcg_shrinker_map_mutex
);
462 size
= memcg_shrinker_map_size
;
464 map
= kvzalloc_node(sizeof(*map
) + size
, GFP_KERNEL
, nid
);
466 memcg_free_shrinker_maps(memcg
);
470 rcu_assign_pointer(memcg
->nodeinfo
[nid
]->shrinker_map
, map
);
472 mutex_unlock(&memcg_shrinker_map_mutex
);
477 int memcg_expand_shrinker_maps(int new_id
)
479 int size
, old_size
, ret
= 0;
480 struct mem_cgroup
*memcg
;
482 size
= DIV_ROUND_UP(new_id
+ 1, BITS_PER_LONG
) * sizeof(unsigned long);
483 old_size
= memcg_shrinker_map_size
;
484 if (size
<= old_size
)
487 mutex_lock(&memcg_shrinker_map_mutex
);
488 if (!root_mem_cgroup
)
491 for_each_mem_cgroup(memcg
) {
492 if (mem_cgroup_is_root(memcg
))
494 ret
= memcg_expand_one_shrinker_map(memcg
, size
, old_size
);
496 mem_cgroup_iter_break(NULL
, memcg
);
502 memcg_shrinker_map_size
= size
;
503 mutex_unlock(&memcg_shrinker_map_mutex
);
507 void memcg_set_shrinker_bit(struct mem_cgroup
*memcg
, int nid
, int shrinker_id
)
509 if (shrinker_id
>= 0 && memcg
&& !mem_cgroup_is_root(memcg
)) {
510 struct memcg_shrinker_map
*map
;
513 map
= rcu_dereference(memcg
->nodeinfo
[nid
]->shrinker_map
);
514 /* Pairs with smp mb in shrink_slab() */
515 smp_mb__before_atomic();
516 set_bit(shrinker_id
, map
->map
);
522 * mem_cgroup_css_from_page - css of the memcg associated with a page
523 * @page: page of interest
525 * If memcg is bound to the default hierarchy, css of the memcg associated
526 * with @page is returned. The returned css remains associated with @page
527 * until it is released.
529 * If memcg is bound to a traditional hierarchy, the css of root_mem_cgroup
532 struct cgroup_subsys_state
*mem_cgroup_css_from_page(struct page
*page
)
534 struct mem_cgroup
*memcg
;
536 memcg
= page
->mem_cgroup
;
538 if (!memcg
|| !cgroup_subsys_on_dfl(memory_cgrp_subsys
))
539 memcg
= root_mem_cgroup
;
545 * page_cgroup_ino - return inode number of the memcg a page is charged to
548 * Look up the closest online ancestor of the memory cgroup @page is charged to
549 * and return its inode number or 0 if @page is not charged to any cgroup. It
550 * is safe to call this function without holding a reference to @page.
552 * Note, this function is inherently racy, because there is nothing to prevent
553 * the cgroup inode from getting torn down and potentially reallocated a moment
554 * after page_cgroup_ino() returns, so it only should be used by callers that
555 * do not care (such as procfs interfaces).
557 ino_t
page_cgroup_ino(struct page
*page
)
559 struct mem_cgroup
*memcg
;
560 unsigned long ino
= 0;
563 memcg
= page
->mem_cgroup
;
566 * The lowest bit set means that memcg isn't a valid
567 * memcg pointer, but a obj_cgroups pointer.
568 * In this case the page is shared and doesn't belong
569 * to any specific memory cgroup.
571 if ((unsigned long) memcg
& 0x1UL
)
574 while (memcg
&& !(memcg
->css
.flags
& CSS_ONLINE
))
575 memcg
= parent_mem_cgroup(memcg
);
577 ino
= cgroup_ino(memcg
->css
.cgroup
);
582 static struct mem_cgroup_per_node
*
583 mem_cgroup_page_nodeinfo(struct mem_cgroup
*memcg
, struct page
*page
)
585 int nid
= page_to_nid(page
);
587 return memcg
->nodeinfo
[nid
];
590 static struct mem_cgroup_tree_per_node
*
591 soft_limit_tree_node(int nid
)
593 return soft_limit_tree
.rb_tree_per_node
[nid
];
596 static struct mem_cgroup_tree_per_node
*
597 soft_limit_tree_from_page(struct page
*page
)
599 int nid
= page_to_nid(page
);
601 return soft_limit_tree
.rb_tree_per_node
[nid
];
604 static void __mem_cgroup_insert_exceeded(struct mem_cgroup_per_node
*mz
,
605 struct mem_cgroup_tree_per_node
*mctz
,
606 unsigned long new_usage_in_excess
)
608 struct rb_node
**p
= &mctz
->rb_root
.rb_node
;
609 struct rb_node
*parent
= NULL
;
610 struct mem_cgroup_per_node
*mz_node
;
611 bool rightmost
= true;
616 mz
->usage_in_excess
= new_usage_in_excess
;
617 if (!mz
->usage_in_excess
)
621 mz_node
= rb_entry(parent
, struct mem_cgroup_per_node
,
623 if (mz
->usage_in_excess
< mz_node
->usage_in_excess
) {
629 * We can't avoid mem cgroups that are over their soft
630 * limit by the same amount
632 else if (mz
->usage_in_excess
>= mz_node
->usage_in_excess
)
637 mctz
->rb_rightmost
= &mz
->tree_node
;
639 rb_link_node(&mz
->tree_node
, parent
, p
);
640 rb_insert_color(&mz
->tree_node
, &mctz
->rb_root
);
644 static void __mem_cgroup_remove_exceeded(struct mem_cgroup_per_node
*mz
,
645 struct mem_cgroup_tree_per_node
*mctz
)
650 if (&mz
->tree_node
== mctz
->rb_rightmost
)
651 mctz
->rb_rightmost
= rb_prev(&mz
->tree_node
);
653 rb_erase(&mz
->tree_node
, &mctz
->rb_root
);
657 static void mem_cgroup_remove_exceeded(struct mem_cgroup_per_node
*mz
,
658 struct mem_cgroup_tree_per_node
*mctz
)
662 spin_lock_irqsave(&mctz
->lock
, flags
);
663 __mem_cgroup_remove_exceeded(mz
, mctz
);
664 spin_unlock_irqrestore(&mctz
->lock
, flags
);
667 static unsigned long soft_limit_excess(struct mem_cgroup
*memcg
)
669 unsigned long nr_pages
= page_counter_read(&memcg
->memory
);
670 unsigned long soft_limit
= READ_ONCE(memcg
->soft_limit
);
671 unsigned long excess
= 0;
673 if (nr_pages
> soft_limit
)
674 excess
= nr_pages
- soft_limit
;
679 static void mem_cgroup_update_tree(struct mem_cgroup
*memcg
, struct page
*page
)
681 unsigned long excess
;
682 struct mem_cgroup_per_node
*mz
;
683 struct mem_cgroup_tree_per_node
*mctz
;
685 mctz
= soft_limit_tree_from_page(page
);
689 * Necessary to update all ancestors when hierarchy is used.
690 * because their event counter is not touched.
692 for (; memcg
; memcg
= parent_mem_cgroup(memcg
)) {
693 mz
= mem_cgroup_page_nodeinfo(memcg
, page
);
694 excess
= soft_limit_excess(memcg
);
696 * We have to update the tree if mz is on RB-tree or
697 * mem is over its softlimit.
699 if (excess
|| mz
->on_tree
) {
702 spin_lock_irqsave(&mctz
->lock
, flags
);
703 /* if on-tree, remove it */
705 __mem_cgroup_remove_exceeded(mz
, mctz
);
707 * Insert again. mz->usage_in_excess will be updated.
708 * If excess is 0, no tree ops.
710 __mem_cgroup_insert_exceeded(mz
, mctz
, excess
);
711 spin_unlock_irqrestore(&mctz
->lock
, flags
);
716 static void mem_cgroup_remove_from_trees(struct mem_cgroup
*memcg
)
718 struct mem_cgroup_tree_per_node
*mctz
;
719 struct mem_cgroup_per_node
*mz
;
723 mz
= mem_cgroup_nodeinfo(memcg
, nid
);
724 mctz
= soft_limit_tree_node(nid
);
726 mem_cgroup_remove_exceeded(mz
, mctz
);
730 static struct mem_cgroup_per_node
*
731 __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node
*mctz
)
733 struct mem_cgroup_per_node
*mz
;
737 if (!mctz
->rb_rightmost
)
738 goto done
; /* Nothing to reclaim from */
740 mz
= rb_entry(mctz
->rb_rightmost
,
741 struct mem_cgroup_per_node
, tree_node
);
743 * Remove the node now but someone else can add it back,
744 * we will to add it back at the end of reclaim to its correct
745 * position in the tree.
747 __mem_cgroup_remove_exceeded(mz
, mctz
);
748 if (!soft_limit_excess(mz
->memcg
) ||
749 !css_tryget(&mz
->memcg
->css
))
755 static struct mem_cgroup_per_node
*
756 mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node
*mctz
)
758 struct mem_cgroup_per_node
*mz
;
760 spin_lock_irq(&mctz
->lock
);
761 mz
= __mem_cgroup_largest_soft_limit_node(mctz
);
762 spin_unlock_irq(&mctz
->lock
);
767 * __mod_memcg_state - update cgroup memory statistics
768 * @memcg: the memory cgroup
769 * @idx: the stat item - can be enum memcg_stat_item or enum node_stat_item
770 * @val: delta to add to the counter, can be negative
772 void __mod_memcg_state(struct mem_cgroup
*memcg
, int idx
, int val
)
774 long x
, threshold
= MEMCG_CHARGE_BATCH
;
776 if (mem_cgroup_disabled())
779 if (memcg_stat_item_in_bytes(idx
))
780 threshold
<<= PAGE_SHIFT
;
782 x
= val
+ __this_cpu_read(memcg
->vmstats_percpu
->stat
[idx
]);
783 if (unlikely(abs(x
) > threshold
)) {
784 struct mem_cgroup
*mi
;
787 * Batch local counters to keep them in sync with
788 * the hierarchical ones.
790 __this_cpu_add(memcg
->vmstats_local
->stat
[idx
], x
);
791 for (mi
= memcg
; mi
; mi
= parent_mem_cgroup(mi
))
792 atomic_long_add(x
, &mi
->vmstats
[idx
]);
795 __this_cpu_write(memcg
->vmstats_percpu
->stat
[idx
], x
);
798 static struct mem_cgroup_per_node
*
799 parent_nodeinfo(struct mem_cgroup_per_node
*pn
, int nid
)
801 struct mem_cgroup
*parent
;
803 parent
= parent_mem_cgroup(pn
->memcg
);
806 return mem_cgroup_nodeinfo(parent
, nid
);
809 void __mod_memcg_lruvec_state(struct lruvec
*lruvec
, enum node_stat_item idx
,
812 struct mem_cgroup_per_node
*pn
;
813 struct mem_cgroup
*memcg
;
814 long x
, threshold
= MEMCG_CHARGE_BATCH
;
816 pn
= container_of(lruvec
, struct mem_cgroup_per_node
, lruvec
);
820 __mod_memcg_state(memcg
, idx
, val
);
823 __this_cpu_add(pn
->lruvec_stat_local
->count
[idx
], val
);
825 if (vmstat_item_in_bytes(idx
))
826 threshold
<<= PAGE_SHIFT
;
828 x
= val
+ __this_cpu_read(pn
->lruvec_stat_cpu
->count
[idx
]);
829 if (unlikely(abs(x
) > threshold
)) {
830 pg_data_t
*pgdat
= lruvec_pgdat(lruvec
);
831 struct mem_cgroup_per_node
*pi
;
833 for (pi
= pn
; pi
; pi
= parent_nodeinfo(pi
, pgdat
->node_id
))
834 atomic_long_add(x
, &pi
->lruvec_stat
[idx
]);
837 __this_cpu_write(pn
->lruvec_stat_cpu
->count
[idx
], x
);
841 * __mod_lruvec_state - update lruvec memory statistics
842 * @lruvec: the lruvec
843 * @idx: the stat item
844 * @val: delta to add to the counter, can be negative
846 * The lruvec is the intersection of the NUMA node and a cgroup. This
847 * function updates the all three counters that are affected by a
848 * change of state at this level: per-node, per-cgroup, per-lruvec.
850 void __mod_lruvec_state(struct lruvec
*lruvec
, enum node_stat_item idx
,
854 __mod_node_page_state(lruvec_pgdat(lruvec
), idx
, val
);
856 /* Update memcg and lruvec */
857 if (!mem_cgroup_disabled())
858 __mod_memcg_lruvec_state(lruvec
, idx
, val
);
861 void __mod_lruvec_slab_state(void *p
, enum node_stat_item idx
, int val
)
863 pg_data_t
*pgdat
= page_pgdat(virt_to_page(p
));
864 struct mem_cgroup
*memcg
;
865 struct lruvec
*lruvec
;
868 memcg
= mem_cgroup_from_obj(p
);
871 * Untracked pages have no memcg, no lruvec. Update only the
872 * node. If we reparent the slab objects to the root memcg,
873 * when we free the slab object, we need to update the per-memcg
874 * vmstats to keep it correct for the root memcg.
877 __mod_node_page_state(pgdat
, idx
, val
);
879 lruvec
= mem_cgroup_lruvec(memcg
, pgdat
);
880 __mod_lruvec_state(lruvec
, idx
, val
);
885 void mod_memcg_obj_state(void *p
, int idx
, int val
)
887 struct mem_cgroup
*memcg
;
890 memcg
= mem_cgroup_from_obj(p
);
892 mod_memcg_state(memcg
, idx
, val
);
897 * __count_memcg_events - account VM events in a cgroup
898 * @memcg: the memory cgroup
899 * @idx: the event item
900 * @count: the number of events that occured
902 void __count_memcg_events(struct mem_cgroup
*memcg
, enum vm_event_item idx
,
907 if (mem_cgroup_disabled())
910 x
= count
+ __this_cpu_read(memcg
->vmstats_percpu
->events
[idx
]);
911 if (unlikely(x
> MEMCG_CHARGE_BATCH
)) {
912 struct mem_cgroup
*mi
;
915 * Batch local counters to keep them in sync with
916 * the hierarchical ones.
918 __this_cpu_add(memcg
->vmstats_local
->events
[idx
], x
);
919 for (mi
= memcg
; mi
; mi
= parent_mem_cgroup(mi
))
920 atomic_long_add(x
, &mi
->vmevents
[idx
]);
923 __this_cpu_write(memcg
->vmstats_percpu
->events
[idx
], x
);
926 static unsigned long memcg_events(struct mem_cgroup
*memcg
, int event
)
928 return atomic_long_read(&memcg
->vmevents
[event
]);
931 static unsigned long memcg_events_local(struct mem_cgroup
*memcg
, int event
)
936 for_each_possible_cpu(cpu
)
937 x
+= per_cpu(memcg
->vmstats_local
->events
[event
], cpu
);
941 static void mem_cgroup_charge_statistics(struct mem_cgroup
*memcg
,
945 /* pagein of a big page is an event. So, ignore page size */
947 __count_memcg_events(memcg
, PGPGIN
, 1);
949 __count_memcg_events(memcg
, PGPGOUT
, 1);
950 nr_pages
= -nr_pages
; /* for event */
953 __this_cpu_add(memcg
->vmstats_percpu
->nr_page_events
, nr_pages
);
956 static bool mem_cgroup_event_ratelimit(struct mem_cgroup
*memcg
,
957 enum mem_cgroup_events_target target
)
959 unsigned long val
, next
;
961 val
= __this_cpu_read(memcg
->vmstats_percpu
->nr_page_events
);
962 next
= __this_cpu_read(memcg
->vmstats_percpu
->targets
[target
]);
963 /* from time_after() in jiffies.h */
964 if ((long)(next
- val
) < 0) {
966 case MEM_CGROUP_TARGET_THRESH
:
967 next
= val
+ THRESHOLDS_EVENTS_TARGET
;
969 case MEM_CGROUP_TARGET_SOFTLIMIT
:
970 next
= val
+ SOFTLIMIT_EVENTS_TARGET
;
975 __this_cpu_write(memcg
->vmstats_percpu
->targets
[target
], next
);
982 * Check events in order.
985 static void memcg_check_events(struct mem_cgroup
*memcg
, struct page
*page
)
987 /* threshold event is triggered in finer grain than soft limit */
988 if (unlikely(mem_cgroup_event_ratelimit(memcg
,
989 MEM_CGROUP_TARGET_THRESH
))) {
992 do_softlimit
= mem_cgroup_event_ratelimit(memcg
,
993 MEM_CGROUP_TARGET_SOFTLIMIT
);
994 mem_cgroup_threshold(memcg
);
995 if (unlikely(do_softlimit
))
996 mem_cgroup_update_tree(memcg
, page
);
1000 struct mem_cgroup
*mem_cgroup_from_task(struct task_struct
*p
)
1003 * mm_update_next_owner() may clear mm->owner to NULL
1004 * if it races with swapoff, page migration, etc.
1005 * So this can be called with p == NULL.
1010 return mem_cgroup_from_css(task_css(p
, memory_cgrp_id
));
1012 EXPORT_SYMBOL(mem_cgroup_from_task
);
1015 * get_mem_cgroup_from_mm: Obtain a reference on given mm_struct's memcg.
1016 * @mm: mm from which memcg should be extracted. It can be NULL.
1018 * Obtain a reference on mm->memcg and returns it if successful. Otherwise
1019 * root_mem_cgroup is returned. However if mem_cgroup is disabled, NULL is
1022 struct mem_cgroup
*get_mem_cgroup_from_mm(struct mm_struct
*mm
)
1024 struct mem_cgroup
*memcg
;
1026 if (mem_cgroup_disabled())
1032 * Page cache insertions can happen withou an
1033 * actual mm context, e.g. during disk probing
1034 * on boot, loopback IO, acct() writes etc.
1037 memcg
= root_mem_cgroup
;
1039 memcg
= mem_cgroup_from_task(rcu_dereference(mm
->owner
));
1040 if (unlikely(!memcg
))
1041 memcg
= root_mem_cgroup
;
1043 } while (!css_tryget(&memcg
->css
));
1047 EXPORT_SYMBOL(get_mem_cgroup_from_mm
);
1050 * get_mem_cgroup_from_page: Obtain a reference on given page's memcg.
1051 * @page: page from which memcg should be extracted.
1053 * Obtain a reference on page->memcg and returns it if successful. Otherwise
1054 * root_mem_cgroup is returned.
1056 struct mem_cgroup
*get_mem_cgroup_from_page(struct page
*page
)
1058 struct mem_cgroup
*memcg
= page
->mem_cgroup
;
1060 if (mem_cgroup_disabled())
1064 /* Page should not get uncharged and freed memcg under us. */
1065 if (!memcg
|| WARN_ON_ONCE(!css_tryget(&memcg
->css
)))
1066 memcg
= root_mem_cgroup
;
1070 EXPORT_SYMBOL(get_mem_cgroup_from_page
);
1072 static __always_inline
struct mem_cgroup
*active_memcg(void)
1075 return this_cpu_read(int_active_memcg
);
1077 return current
->active_memcg
;
1080 static __always_inline
struct mem_cgroup
*get_active_memcg(void)
1082 struct mem_cgroup
*memcg
;
1085 memcg
= active_memcg();
1087 /* current->active_memcg must hold a ref. */
1088 if (WARN_ON_ONCE(!css_tryget(&memcg
->css
)))
1089 memcg
= root_mem_cgroup
;
1091 memcg
= current
->active_memcg
;
1098 static __always_inline
bool memcg_kmem_bypass(void)
1100 /* Allow remote memcg charging from any context. */
1101 if (unlikely(active_memcg()))
1104 /* Memcg to charge can't be determined. */
1105 if (in_interrupt() || !current
->mm
|| (current
->flags
& PF_KTHREAD
))
1112 * If active memcg is set, do not fallback to current->mm->memcg.
1114 static __always_inline
struct mem_cgroup
*get_mem_cgroup_from_current(void)
1116 if (memcg_kmem_bypass())
1119 if (unlikely(active_memcg()))
1120 return get_active_memcg();
1122 return get_mem_cgroup_from_mm(current
->mm
);
1126 * mem_cgroup_iter - iterate over memory cgroup hierarchy
1127 * @root: hierarchy root
1128 * @prev: previously returned memcg, NULL on first invocation
1129 * @reclaim: cookie for shared reclaim walks, NULL for full walks
1131 * Returns references to children of the hierarchy below @root, or
1132 * @root itself, or %NULL after a full round-trip.
1134 * Caller must pass the return value in @prev on subsequent
1135 * invocations for reference counting, or use mem_cgroup_iter_break()
1136 * to cancel a hierarchy walk before the round-trip is complete.
1138 * Reclaimers can specify a node in @reclaim to divide up the memcgs
1139 * in the hierarchy among all concurrent reclaimers operating on the
1142 struct mem_cgroup
*mem_cgroup_iter(struct mem_cgroup
*root
,
1143 struct mem_cgroup
*prev
,
1144 struct mem_cgroup_reclaim_cookie
*reclaim
)
1146 struct mem_cgroup_reclaim_iter
*iter
;
1147 struct cgroup_subsys_state
*css
= NULL
;
1148 struct mem_cgroup
*memcg
= NULL
;
1149 struct mem_cgroup
*pos
= NULL
;
1151 if (mem_cgroup_disabled())
1155 root
= root_mem_cgroup
;
1157 if (prev
&& !reclaim
)
1160 if (!root
->use_hierarchy
&& root
!= root_mem_cgroup
) {
1169 struct mem_cgroup_per_node
*mz
;
1171 mz
= mem_cgroup_nodeinfo(root
, reclaim
->pgdat
->node_id
);
1174 if (prev
&& reclaim
->generation
!= iter
->generation
)
1178 pos
= READ_ONCE(iter
->position
);
1179 if (!pos
|| css_tryget(&pos
->css
))
1182 * css reference reached zero, so iter->position will
1183 * be cleared by ->css_released. However, we should not
1184 * rely on this happening soon, because ->css_released
1185 * is called from a work queue, and by busy-waiting we
1186 * might block it. So we clear iter->position right
1189 (void)cmpxchg(&iter
->position
, pos
, NULL
);
1197 css
= css_next_descendant_pre(css
, &root
->css
);
1200 * Reclaimers share the hierarchy walk, and a
1201 * new one might jump in right at the end of
1202 * the hierarchy - make sure they see at least
1203 * one group and restart from the beginning.
1211 * Verify the css and acquire a reference. The root
1212 * is provided by the caller, so we know it's alive
1213 * and kicking, and don't take an extra reference.
1215 memcg
= mem_cgroup_from_css(css
);
1217 if (css
== &root
->css
)
1220 if (css_tryget(css
))
1228 * The position could have already been updated by a competing
1229 * thread, so check that the value hasn't changed since we read
1230 * it to avoid reclaiming from the same cgroup twice.
1232 (void)cmpxchg(&iter
->position
, pos
, memcg
);
1240 reclaim
->generation
= iter
->generation
;
1246 if (prev
&& prev
!= root
)
1247 css_put(&prev
->css
);
1253 * mem_cgroup_iter_break - abort a hierarchy walk prematurely
1254 * @root: hierarchy root
1255 * @prev: last visited hierarchy member as returned by mem_cgroup_iter()
1257 void mem_cgroup_iter_break(struct mem_cgroup
*root
,
1258 struct mem_cgroup
*prev
)
1261 root
= root_mem_cgroup
;
1262 if (prev
&& prev
!= root
)
1263 css_put(&prev
->css
);
1266 static void __invalidate_reclaim_iterators(struct mem_cgroup
*from
,
1267 struct mem_cgroup
*dead_memcg
)
1269 struct mem_cgroup_reclaim_iter
*iter
;
1270 struct mem_cgroup_per_node
*mz
;
1273 for_each_node(nid
) {
1274 mz
= mem_cgroup_nodeinfo(from
, nid
);
1276 cmpxchg(&iter
->position
, dead_memcg
, NULL
);
1280 static void invalidate_reclaim_iterators(struct mem_cgroup
*dead_memcg
)
1282 struct mem_cgroup
*memcg
= dead_memcg
;
1283 struct mem_cgroup
*last
;
1286 __invalidate_reclaim_iterators(memcg
, dead_memcg
);
1288 } while ((memcg
= parent_mem_cgroup(memcg
)));
1291 * When cgruop1 non-hierarchy mode is used,
1292 * parent_mem_cgroup() does not walk all the way up to the
1293 * cgroup root (root_mem_cgroup). So we have to handle
1294 * dead_memcg from cgroup root separately.
1296 if (last
!= root_mem_cgroup
)
1297 __invalidate_reclaim_iterators(root_mem_cgroup
,
1302 * mem_cgroup_scan_tasks - iterate over tasks of a memory cgroup hierarchy
1303 * @memcg: hierarchy root
1304 * @fn: function to call for each task
1305 * @arg: argument passed to @fn
1307 * This function iterates over tasks attached to @memcg or to any of its
1308 * descendants and calls @fn for each task. If @fn returns a non-zero
1309 * value, the function breaks the iteration loop and returns the value.
1310 * Otherwise, it will iterate over all tasks and return 0.
1312 * This function must not be called for the root memory cgroup.
1314 int mem_cgroup_scan_tasks(struct mem_cgroup
*memcg
,
1315 int (*fn
)(struct task_struct
*, void *), void *arg
)
1317 struct mem_cgroup
*iter
;
1320 BUG_ON(memcg
== root_mem_cgroup
);
1322 for_each_mem_cgroup_tree(iter
, memcg
) {
1323 struct css_task_iter it
;
1324 struct task_struct
*task
;
1326 css_task_iter_start(&iter
->css
, CSS_TASK_ITER_PROCS
, &it
);
1327 while (!ret
&& (task
= css_task_iter_next(&it
)))
1328 ret
= fn(task
, arg
);
1329 css_task_iter_end(&it
);
1331 mem_cgroup_iter_break(memcg
, iter
);
1339 * mem_cgroup_page_lruvec - return lruvec for isolating/putting an LRU page
1341 * @pgdat: pgdat of the page
1343 * This function relies on page->mem_cgroup being stable - see the
1344 * access rules in commit_charge().
1346 struct lruvec
*mem_cgroup_page_lruvec(struct page
*page
, struct pglist_data
*pgdat
)
1348 struct mem_cgroup_per_node
*mz
;
1349 struct mem_cgroup
*memcg
;
1350 struct lruvec
*lruvec
;
1352 if (mem_cgroup_disabled()) {
1353 lruvec
= &pgdat
->__lruvec
;
1357 memcg
= page
->mem_cgroup
;
1359 * Swapcache readahead pages are added to the LRU - and
1360 * possibly migrated - before they are charged.
1363 memcg
= root_mem_cgroup
;
1365 mz
= mem_cgroup_page_nodeinfo(memcg
, page
);
1366 lruvec
= &mz
->lruvec
;
1369 * Since a node can be onlined after the mem_cgroup was created,
1370 * we have to be prepared to initialize lruvec->zone here;
1371 * and if offlined then reonlined, we need to reinitialize it.
1373 if (unlikely(lruvec
->pgdat
!= pgdat
))
1374 lruvec
->pgdat
= pgdat
;
1379 * mem_cgroup_update_lru_size - account for adding or removing an lru page
1380 * @lruvec: mem_cgroup per zone lru vector
1381 * @lru: index of lru list the page is sitting on
1382 * @zid: zone id of the accounted pages
1383 * @nr_pages: positive when adding or negative when removing
1385 * This function must be called under lru_lock, just before a page is added
1386 * to or just after a page is removed from an lru list (that ordering being
1387 * so as to allow it to check that lru_size 0 is consistent with list_empty).
1389 void mem_cgroup_update_lru_size(struct lruvec
*lruvec
, enum lru_list lru
,
1390 int zid
, int nr_pages
)
1392 struct mem_cgroup_per_node
*mz
;
1393 unsigned long *lru_size
;
1396 if (mem_cgroup_disabled())
1399 mz
= container_of(lruvec
, struct mem_cgroup_per_node
, lruvec
);
1400 lru_size
= &mz
->lru_zone_size
[zid
][lru
];
1403 *lru_size
+= nr_pages
;
1406 if (WARN_ONCE(size
< 0,
1407 "%s(%p, %d, %d): lru_size %ld\n",
1408 __func__
, lruvec
, lru
, nr_pages
, size
)) {
1414 *lru_size
+= nr_pages
;
1418 * mem_cgroup_margin - calculate chargeable space of a memory cgroup
1419 * @memcg: the memory cgroup
1421 * Returns the maximum amount of memory @mem can be charged with, in
1424 static unsigned long mem_cgroup_margin(struct mem_cgroup
*memcg
)
1426 unsigned long margin
= 0;
1427 unsigned long count
;
1428 unsigned long limit
;
1430 count
= page_counter_read(&memcg
->memory
);
1431 limit
= READ_ONCE(memcg
->memory
.max
);
1433 margin
= limit
- count
;
1435 if (do_memsw_account()) {
1436 count
= page_counter_read(&memcg
->memsw
);
1437 limit
= READ_ONCE(memcg
->memsw
.max
);
1439 margin
= min(margin
, limit
- count
);
1448 * A routine for checking "mem" is under move_account() or not.
1450 * Checking a cgroup is mc.from or mc.to or under hierarchy of
1451 * moving cgroups. This is for waiting at high-memory pressure
1454 static bool mem_cgroup_under_move(struct mem_cgroup
*memcg
)
1456 struct mem_cgroup
*from
;
1457 struct mem_cgroup
*to
;
1460 * Unlike task_move routines, we access mc.to, mc.from not under
1461 * mutual exclusion by cgroup_mutex. Here, we take spinlock instead.
1463 spin_lock(&mc
.lock
);
1469 ret
= mem_cgroup_is_descendant(from
, memcg
) ||
1470 mem_cgroup_is_descendant(to
, memcg
);
1472 spin_unlock(&mc
.lock
);
1476 static bool mem_cgroup_wait_acct_move(struct mem_cgroup
*memcg
)
1478 if (mc
.moving_task
&& current
!= mc
.moving_task
) {
1479 if (mem_cgroup_under_move(memcg
)) {
1481 prepare_to_wait(&mc
.waitq
, &wait
, TASK_INTERRUPTIBLE
);
1482 /* moving charge context might have finished. */
1485 finish_wait(&mc
.waitq
, &wait
);
1492 struct memory_stat
{
1498 static struct memory_stat memory_stats
[] = {
1499 { "anon", PAGE_SIZE
, NR_ANON_MAPPED
},
1500 { "file", PAGE_SIZE
, NR_FILE_PAGES
},
1501 { "kernel_stack", 1024, NR_KERNEL_STACK_KB
},
1502 { "percpu", 1, MEMCG_PERCPU_B
},
1503 { "sock", PAGE_SIZE
, MEMCG_SOCK
},
1504 { "shmem", PAGE_SIZE
, NR_SHMEM
},
1505 { "file_mapped", PAGE_SIZE
, NR_FILE_MAPPED
},
1506 { "file_dirty", PAGE_SIZE
, NR_FILE_DIRTY
},
1507 { "file_writeback", PAGE_SIZE
, NR_WRITEBACK
},
1508 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
1510 * The ratio will be initialized in memory_stats_init(). Because
1511 * on some architectures, the macro of HPAGE_PMD_SIZE is not
1512 * constant(e.g. powerpc).
1514 { "anon_thp", 0, NR_ANON_THPS
},
1516 { "inactive_anon", PAGE_SIZE
, NR_INACTIVE_ANON
},
1517 { "active_anon", PAGE_SIZE
, NR_ACTIVE_ANON
},
1518 { "inactive_file", PAGE_SIZE
, NR_INACTIVE_FILE
},
1519 { "active_file", PAGE_SIZE
, NR_ACTIVE_FILE
},
1520 { "unevictable", PAGE_SIZE
, NR_UNEVICTABLE
},
1523 * Note: The slab_reclaimable and slab_unreclaimable must be
1524 * together and slab_reclaimable must be in front.
1526 { "slab_reclaimable", 1, NR_SLAB_RECLAIMABLE_B
},
1527 { "slab_unreclaimable", 1, NR_SLAB_UNRECLAIMABLE_B
},
1529 /* The memory events */
1530 { "workingset_refault_anon", 1, WORKINGSET_REFAULT_ANON
},
1531 { "workingset_refault_file", 1, WORKINGSET_REFAULT_FILE
},
1532 { "workingset_activate_anon", 1, WORKINGSET_ACTIVATE_ANON
},
1533 { "workingset_activate_file", 1, WORKINGSET_ACTIVATE_FILE
},
1534 { "workingset_restore_anon", 1, WORKINGSET_RESTORE_ANON
},
1535 { "workingset_restore_file", 1, WORKINGSET_RESTORE_FILE
},
1536 { "workingset_nodereclaim", 1, WORKINGSET_NODERECLAIM
},
1539 static int __init
memory_stats_init(void)
1543 for (i
= 0; i
< ARRAY_SIZE(memory_stats
); i
++) {
1544 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
1545 if (memory_stats
[i
].idx
== NR_ANON_THPS
)
1546 memory_stats
[i
].ratio
= HPAGE_PMD_SIZE
;
1548 VM_BUG_ON(!memory_stats
[i
].ratio
);
1549 VM_BUG_ON(memory_stats
[i
].idx
>= MEMCG_NR_STAT
);
1554 pure_initcall(memory_stats_init
);
1556 static char *memory_stat_format(struct mem_cgroup
*memcg
)
1561 seq_buf_init(&s
, kmalloc(PAGE_SIZE
, GFP_KERNEL
), PAGE_SIZE
);
1566 * Provide statistics on the state of the memory subsystem as
1567 * well as cumulative event counters that show past behavior.
1569 * This list is ordered following a combination of these gradients:
1570 * 1) generic big picture -> specifics and details
1571 * 2) reflecting userspace activity -> reflecting kernel heuristics
1573 * Current memory state:
1576 for (i
= 0; i
< ARRAY_SIZE(memory_stats
); i
++) {
1579 size
= memcg_page_state(memcg
, memory_stats
[i
].idx
);
1580 size
*= memory_stats
[i
].ratio
;
1581 seq_buf_printf(&s
, "%s %llu\n", memory_stats
[i
].name
, size
);
1583 if (unlikely(memory_stats
[i
].idx
== NR_SLAB_UNRECLAIMABLE_B
)) {
1584 size
= memcg_page_state(memcg
, NR_SLAB_RECLAIMABLE_B
) +
1585 memcg_page_state(memcg
, NR_SLAB_UNRECLAIMABLE_B
);
1586 seq_buf_printf(&s
, "slab %llu\n", size
);
1590 /* Accumulated memory events */
1592 seq_buf_printf(&s
, "%s %lu\n", vm_event_name(PGFAULT
),
1593 memcg_events(memcg
, PGFAULT
));
1594 seq_buf_printf(&s
, "%s %lu\n", vm_event_name(PGMAJFAULT
),
1595 memcg_events(memcg
, PGMAJFAULT
));
1596 seq_buf_printf(&s
, "%s %lu\n", vm_event_name(PGREFILL
),
1597 memcg_events(memcg
, PGREFILL
));
1598 seq_buf_printf(&s
, "pgscan %lu\n",
1599 memcg_events(memcg
, PGSCAN_KSWAPD
) +
1600 memcg_events(memcg
, PGSCAN_DIRECT
));
1601 seq_buf_printf(&s
, "pgsteal %lu\n",
1602 memcg_events(memcg
, PGSTEAL_KSWAPD
) +
1603 memcg_events(memcg
, PGSTEAL_DIRECT
));
1604 seq_buf_printf(&s
, "%s %lu\n", vm_event_name(PGACTIVATE
),
1605 memcg_events(memcg
, PGACTIVATE
));
1606 seq_buf_printf(&s
, "%s %lu\n", vm_event_name(PGDEACTIVATE
),
1607 memcg_events(memcg
, PGDEACTIVATE
));
1608 seq_buf_printf(&s
, "%s %lu\n", vm_event_name(PGLAZYFREE
),
1609 memcg_events(memcg
, PGLAZYFREE
));
1610 seq_buf_printf(&s
, "%s %lu\n", vm_event_name(PGLAZYFREED
),
1611 memcg_events(memcg
, PGLAZYFREED
));
1613 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
1614 seq_buf_printf(&s
, "%s %lu\n", vm_event_name(THP_FAULT_ALLOC
),
1615 memcg_events(memcg
, THP_FAULT_ALLOC
));
1616 seq_buf_printf(&s
, "%s %lu\n", vm_event_name(THP_COLLAPSE_ALLOC
),
1617 memcg_events(memcg
, THP_COLLAPSE_ALLOC
));
1618 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
1620 /* The above should easily fit into one page */
1621 WARN_ON_ONCE(seq_buf_has_overflowed(&s
));
1626 #define K(x) ((x) << (PAGE_SHIFT-10))
1628 * mem_cgroup_print_oom_context: Print OOM information relevant to
1629 * memory controller.
1630 * @memcg: The memory cgroup that went over limit
1631 * @p: Task that is going to be killed
1633 * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is
1636 void mem_cgroup_print_oom_context(struct mem_cgroup
*memcg
, struct task_struct
*p
)
1641 pr_cont(",oom_memcg=");
1642 pr_cont_cgroup_path(memcg
->css
.cgroup
);
1644 pr_cont(",global_oom");
1646 pr_cont(",task_memcg=");
1647 pr_cont_cgroup_path(task_cgroup(p
, memory_cgrp_id
));
1653 * mem_cgroup_print_oom_meminfo: Print OOM memory information relevant to
1654 * memory controller.
1655 * @memcg: The memory cgroup that went over limit
1657 void mem_cgroup_print_oom_meminfo(struct mem_cgroup
*memcg
)
1661 pr_info("memory: usage %llukB, limit %llukB, failcnt %lu\n",
1662 K((u64
)page_counter_read(&memcg
->memory
)),
1663 K((u64
)READ_ONCE(memcg
->memory
.max
)), memcg
->memory
.failcnt
);
1664 if (cgroup_subsys_on_dfl(memory_cgrp_subsys
))
1665 pr_info("swap: usage %llukB, limit %llukB, failcnt %lu\n",
1666 K((u64
)page_counter_read(&memcg
->swap
)),
1667 K((u64
)READ_ONCE(memcg
->swap
.max
)), memcg
->swap
.failcnt
);
1669 pr_info("memory+swap: usage %llukB, limit %llukB, failcnt %lu\n",
1670 K((u64
)page_counter_read(&memcg
->memsw
)),
1671 K((u64
)memcg
->memsw
.max
), memcg
->memsw
.failcnt
);
1672 pr_info("kmem: usage %llukB, limit %llukB, failcnt %lu\n",
1673 K((u64
)page_counter_read(&memcg
->kmem
)),
1674 K((u64
)memcg
->kmem
.max
), memcg
->kmem
.failcnt
);
1677 pr_info("Memory cgroup stats for ");
1678 pr_cont_cgroup_path(memcg
->css
.cgroup
);
1680 buf
= memory_stat_format(memcg
);
1688 * Return the memory (and swap, if configured) limit for a memcg.
1690 unsigned long mem_cgroup_get_max(struct mem_cgroup
*memcg
)
1692 unsigned long max
= READ_ONCE(memcg
->memory
.max
);
1694 if (cgroup_subsys_on_dfl(memory_cgrp_subsys
)) {
1695 if (mem_cgroup_swappiness(memcg
))
1696 max
+= min(READ_ONCE(memcg
->swap
.max
),
1697 (unsigned long)total_swap_pages
);
1699 if (mem_cgroup_swappiness(memcg
)) {
1700 /* Calculate swap excess capacity from memsw limit */
1701 unsigned long swap
= READ_ONCE(memcg
->memsw
.max
) - max
;
1703 max
+= min(swap
, (unsigned long)total_swap_pages
);
1709 unsigned long mem_cgroup_size(struct mem_cgroup
*memcg
)
1711 return page_counter_read(&memcg
->memory
);
1714 static bool mem_cgroup_out_of_memory(struct mem_cgroup
*memcg
, gfp_t gfp_mask
,
1717 struct oom_control oc
= {
1721 .gfp_mask
= gfp_mask
,
1726 if (mutex_lock_killable(&oom_lock
))
1729 if (mem_cgroup_margin(memcg
) >= (1 << order
))
1733 * A few threads which were not waiting at mutex_lock_killable() can
1734 * fail to bail out. Therefore, check again after holding oom_lock.
1736 ret
= should_force_charge() || out_of_memory(&oc
);
1739 mutex_unlock(&oom_lock
);
1743 static int mem_cgroup_soft_reclaim(struct mem_cgroup
*root_memcg
,
1746 unsigned long *total_scanned
)
1748 struct mem_cgroup
*victim
= NULL
;
1751 unsigned long excess
;
1752 unsigned long nr_scanned
;
1753 struct mem_cgroup_reclaim_cookie reclaim
= {
1757 excess
= soft_limit_excess(root_memcg
);
1760 victim
= mem_cgroup_iter(root_memcg
, victim
, &reclaim
);
1765 * If we have not been able to reclaim
1766 * anything, it might because there are
1767 * no reclaimable pages under this hierarchy
1772 * We want to do more targeted reclaim.
1773 * excess >> 2 is not to excessive so as to
1774 * reclaim too much, nor too less that we keep
1775 * coming back to reclaim from this cgroup
1777 if (total
>= (excess
>> 2) ||
1778 (loop
> MEM_CGROUP_MAX_RECLAIM_LOOPS
))
1783 total
+= mem_cgroup_shrink_node(victim
, gfp_mask
, false,
1784 pgdat
, &nr_scanned
);
1785 *total_scanned
+= nr_scanned
;
1786 if (!soft_limit_excess(root_memcg
))
1789 mem_cgroup_iter_break(root_memcg
, victim
);
1793 #ifdef CONFIG_LOCKDEP
1794 static struct lockdep_map memcg_oom_lock_dep_map
= {
1795 .name
= "memcg_oom_lock",
1799 static DEFINE_SPINLOCK(memcg_oom_lock
);
1802 * Check OOM-Killer is already running under our hierarchy.
1803 * If someone is running, return false.
1805 static bool mem_cgroup_oom_trylock(struct mem_cgroup
*memcg
)
1807 struct mem_cgroup
*iter
, *failed
= NULL
;
1809 spin_lock(&memcg_oom_lock
);
1811 for_each_mem_cgroup_tree(iter
, memcg
) {
1812 if (iter
->oom_lock
) {
1814 * this subtree of our hierarchy is already locked
1815 * so we cannot give a lock.
1818 mem_cgroup_iter_break(memcg
, iter
);
1821 iter
->oom_lock
= true;
1826 * OK, we failed to lock the whole subtree so we have
1827 * to clean up what we set up to the failing subtree
1829 for_each_mem_cgroup_tree(iter
, memcg
) {
1830 if (iter
== failed
) {
1831 mem_cgroup_iter_break(memcg
, iter
);
1834 iter
->oom_lock
= false;
1837 mutex_acquire(&memcg_oom_lock_dep_map
, 0, 1, _RET_IP_
);
1839 spin_unlock(&memcg_oom_lock
);
1844 static void mem_cgroup_oom_unlock(struct mem_cgroup
*memcg
)
1846 struct mem_cgroup
*iter
;
1848 spin_lock(&memcg_oom_lock
);
1849 mutex_release(&memcg_oom_lock_dep_map
, _RET_IP_
);
1850 for_each_mem_cgroup_tree(iter
, memcg
)
1851 iter
->oom_lock
= false;
1852 spin_unlock(&memcg_oom_lock
);
1855 static void mem_cgroup_mark_under_oom(struct mem_cgroup
*memcg
)
1857 struct mem_cgroup
*iter
;
1859 spin_lock(&memcg_oom_lock
);
1860 for_each_mem_cgroup_tree(iter
, memcg
)
1862 spin_unlock(&memcg_oom_lock
);
1865 static void mem_cgroup_unmark_under_oom(struct mem_cgroup
*memcg
)
1867 struct mem_cgroup
*iter
;
1870 * Be careful about under_oom underflows becase a child memcg
1871 * could have been added after mem_cgroup_mark_under_oom.
1873 spin_lock(&memcg_oom_lock
);
1874 for_each_mem_cgroup_tree(iter
, memcg
)
1875 if (iter
->under_oom
> 0)
1877 spin_unlock(&memcg_oom_lock
);
1880 static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq
);
1882 struct oom_wait_info
{
1883 struct mem_cgroup
*memcg
;
1884 wait_queue_entry_t wait
;
1887 static int memcg_oom_wake_function(wait_queue_entry_t
*wait
,
1888 unsigned mode
, int sync
, void *arg
)
1890 struct mem_cgroup
*wake_memcg
= (struct mem_cgroup
*)arg
;
1891 struct mem_cgroup
*oom_wait_memcg
;
1892 struct oom_wait_info
*oom_wait_info
;
1894 oom_wait_info
= container_of(wait
, struct oom_wait_info
, wait
);
1895 oom_wait_memcg
= oom_wait_info
->memcg
;
1897 if (!mem_cgroup_is_descendant(wake_memcg
, oom_wait_memcg
) &&
1898 !mem_cgroup_is_descendant(oom_wait_memcg
, wake_memcg
))
1900 return autoremove_wake_function(wait
, mode
, sync
, arg
);
1903 static void memcg_oom_recover(struct mem_cgroup
*memcg
)
1906 * For the following lockless ->under_oom test, the only required
1907 * guarantee is that it must see the state asserted by an OOM when
1908 * this function is called as a result of userland actions
1909 * triggered by the notification of the OOM. This is trivially
1910 * achieved by invoking mem_cgroup_mark_under_oom() before
1911 * triggering notification.
1913 if (memcg
&& memcg
->under_oom
)
1914 __wake_up(&memcg_oom_waitq
, TASK_NORMAL
, 0, memcg
);
1924 static enum oom_status
mem_cgroup_oom(struct mem_cgroup
*memcg
, gfp_t mask
, int order
)
1926 enum oom_status ret
;
1929 if (order
> PAGE_ALLOC_COSTLY_ORDER
)
1932 memcg_memory_event(memcg
, MEMCG_OOM
);
1935 * We are in the middle of the charge context here, so we
1936 * don't want to block when potentially sitting on a callstack
1937 * that holds all kinds of filesystem and mm locks.
1939 * cgroup1 allows disabling the OOM killer and waiting for outside
1940 * handling until the charge can succeed; remember the context and put
1941 * the task to sleep at the end of the page fault when all locks are
1944 * On the other hand, in-kernel OOM killer allows for an async victim
1945 * memory reclaim (oom_reaper) and that means that we are not solely
1946 * relying on the oom victim to make a forward progress and we can
1947 * invoke the oom killer here.
1949 * Please note that mem_cgroup_out_of_memory might fail to find a
1950 * victim and then we have to bail out from the charge path.
1952 if (memcg
->oom_kill_disable
) {
1953 if (!current
->in_user_fault
)
1955 css_get(&memcg
->css
);
1956 current
->memcg_in_oom
= memcg
;
1957 current
->memcg_oom_gfp_mask
= mask
;
1958 current
->memcg_oom_order
= order
;
1963 mem_cgroup_mark_under_oom(memcg
);
1965 locked
= mem_cgroup_oom_trylock(memcg
);
1968 mem_cgroup_oom_notify(memcg
);
1970 mem_cgroup_unmark_under_oom(memcg
);
1971 if (mem_cgroup_out_of_memory(memcg
, mask
, order
))
1977 mem_cgroup_oom_unlock(memcg
);
1983 * mem_cgroup_oom_synchronize - complete memcg OOM handling
1984 * @handle: actually kill/wait or just clean up the OOM state
1986 * This has to be called at the end of a page fault if the memcg OOM
1987 * handler was enabled.
1989 * Memcg supports userspace OOM handling where failed allocations must
1990 * sleep on a waitqueue until the userspace task resolves the
1991 * situation. Sleeping directly in the charge context with all kinds
1992 * of locks held is not a good idea, instead we remember an OOM state
1993 * in the task and mem_cgroup_oom_synchronize() has to be called at
1994 * the end of the page fault to complete the OOM handling.
1996 * Returns %true if an ongoing memcg OOM situation was detected and
1997 * completed, %false otherwise.
1999 bool mem_cgroup_oom_synchronize(bool handle
)
2001 struct mem_cgroup
*memcg
= current
->memcg_in_oom
;
2002 struct oom_wait_info owait
;
2005 /* OOM is global, do not handle */
2012 owait
.memcg
= memcg
;
2013 owait
.wait
.flags
= 0;
2014 owait
.wait
.func
= memcg_oom_wake_function
;
2015 owait
.wait
.private = current
;
2016 INIT_LIST_HEAD(&owait
.wait
.entry
);
2018 prepare_to_wait(&memcg_oom_waitq
, &owait
.wait
, TASK_KILLABLE
);
2019 mem_cgroup_mark_under_oom(memcg
);
2021 locked
= mem_cgroup_oom_trylock(memcg
);
2024 mem_cgroup_oom_notify(memcg
);
2026 if (locked
&& !memcg
->oom_kill_disable
) {
2027 mem_cgroup_unmark_under_oom(memcg
);
2028 finish_wait(&memcg_oom_waitq
, &owait
.wait
);
2029 mem_cgroup_out_of_memory(memcg
, current
->memcg_oom_gfp_mask
,
2030 current
->memcg_oom_order
);
2033 mem_cgroup_unmark_under_oom(memcg
);
2034 finish_wait(&memcg_oom_waitq
, &owait
.wait
);
2038 mem_cgroup_oom_unlock(memcg
);
2040 * There is no guarantee that an OOM-lock contender
2041 * sees the wakeups triggered by the OOM kill
2042 * uncharges. Wake any sleepers explicitely.
2044 memcg_oom_recover(memcg
);
2047 current
->memcg_in_oom
= NULL
;
2048 css_put(&memcg
->css
);
2053 * mem_cgroup_get_oom_group - get a memory cgroup to clean up after OOM
2054 * @victim: task to be killed by the OOM killer
2055 * @oom_domain: memcg in case of memcg OOM, NULL in case of system-wide OOM
2057 * Returns a pointer to a memory cgroup, which has to be cleaned up
2058 * by killing all belonging OOM-killable tasks.
2060 * Caller has to call mem_cgroup_put() on the returned non-NULL memcg.
2062 struct mem_cgroup
*mem_cgroup_get_oom_group(struct task_struct
*victim
,
2063 struct mem_cgroup
*oom_domain
)
2065 struct mem_cgroup
*oom_group
= NULL
;
2066 struct mem_cgroup
*memcg
;
2068 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys
))
2072 oom_domain
= root_mem_cgroup
;
2076 memcg
= mem_cgroup_from_task(victim
);
2077 if (memcg
== root_mem_cgroup
)
2081 * If the victim task has been asynchronously moved to a different
2082 * memory cgroup, we might end up killing tasks outside oom_domain.
2083 * In this case it's better to ignore memory.group.oom.
2085 if (unlikely(!mem_cgroup_is_descendant(memcg
, oom_domain
)))
2089 * Traverse the memory cgroup hierarchy from the victim task's
2090 * cgroup up to the OOMing cgroup (or root) to find the
2091 * highest-level memory cgroup with oom.group set.
2093 for (; memcg
; memcg
= parent_mem_cgroup(memcg
)) {
2094 if (memcg
->oom_group
)
2097 if (memcg
== oom_domain
)
2102 css_get(&oom_group
->css
);
2109 void mem_cgroup_print_oom_group(struct mem_cgroup
*memcg
)
2111 pr_info("Tasks in ");
2112 pr_cont_cgroup_path(memcg
->css
.cgroup
);
2113 pr_cont(" are going to be killed due to memory.oom.group set\n");
2117 * lock_page_memcg - lock a page->mem_cgroup binding
2120 * This function protects unlocked LRU pages from being moved to
2123 * It ensures lifetime of the returned memcg. Caller is responsible
2124 * for the lifetime of the page; __unlock_page_memcg() is available
2125 * when @page might get freed inside the locked section.
2127 struct mem_cgroup
*lock_page_memcg(struct page
*page
)
2129 struct page
*head
= compound_head(page
); /* rmap on tail pages */
2130 struct mem_cgroup
*memcg
;
2131 unsigned long flags
;
2134 * The RCU lock is held throughout the transaction. The fast
2135 * path can get away without acquiring the memcg->move_lock
2136 * because page moving starts with an RCU grace period.
2138 * The RCU lock also protects the memcg from being freed when
2139 * the page state that is going to change is the only thing
2140 * preventing the page itself from being freed. E.g. writeback
2141 * doesn't hold a page reference and relies on PG_writeback to
2142 * keep off truncation, migration and so forth.
2146 if (mem_cgroup_disabled())
2149 memcg
= head
->mem_cgroup
;
2150 if (unlikely(!memcg
))
2153 if (atomic_read(&memcg
->moving_account
) <= 0)
2156 spin_lock_irqsave(&memcg
->move_lock
, flags
);
2157 if (memcg
!= head
->mem_cgroup
) {
2158 spin_unlock_irqrestore(&memcg
->move_lock
, flags
);
2163 * When charge migration first begins, we can have locked and
2164 * unlocked page stat updates happening concurrently. Track
2165 * the task who has the lock for unlock_page_memcg().
2167 memcg
->move_lock_task
= current
;
2168 memcg
->move_lock_flags
= flags
;
2172 EXPORT_SYMBOL(lock_page_memcg
);
2175 * __unlock_page_memcg - unlock and unpin a memcg
2178 * Unlock and unpin a memcg returned by lock_page_memcg().
2180 void __unlock_page_memcg(struct mem_cgroup
*memcg
)
2182 if (memcg
&& memcg
->move_lock_task
== current
) {
2183 unsigned long flags
= memcg
->move_lock_flags
;
2185 memcg
->move_lock_task
= NULL
;
2186 memcg
->move_lock_flags
= 0;
2188 spin_unlock_irqrestore(&memcg
->move_lock
, flags
);
2195 * unlock_page_memcg - unlock a page->mem_cgroup binding
2198 void unlock_page_memcg(struct page
*page
)
2200 struct page
*head
= compound_head(page
);
2202 __unlock_page_memcg(head
->mem_cgroup
);
2204 EXPORT_SYMBOL(unlock_page_memcg
);
2206 struct memcg_stock_pcp
{
2207 struct mem_cgroup
*cached
; /* this never be root cgroup */
2208 unsigned int nr_pages
;
2210 #ifdef CONFIG_MEMCG_KMEM
2211 struct obj_cgroup
*cached_objcg
;
2212 unsigned int nr_bytes
;
2215 struct work_struct work
;
2216 unsigned long flags
;
2217 #define FLUSHING_CACHED_CHARGE 0
2219 static DEFINE_PER_CPU(struct memcg_stock_pcp
, memcg_stock
);
2220 static DEFINE_MUTEX(percpu_charge_mutex
);
2222 #ifdef CONFIG_MEMCG_KMEM
2223 static void drain_obj_stock(struct memcg_stock_pcp
*stock
);
2224 static bool obj_stock_flush_required(struct memcg_stock_pcp
*stock
,
2225 struct mem_cgroup
*root_memcg
);
2228 static inline void drain_obj_stock(struct memcg_stock_pcp
*stock
)
2231 static bool obj_stock_flush_required(struct memcg_stock_pcp
*stock
,
2232 struct mem_cgroup
*root_memcg
)
2239 * consume_stock: Try to consume stocked charge on this cpu.
2240 * @memcg: memcg to consume from.
2241 * @nr_pages: how many pages to charge.
2243 * The charges will only happen if @memcg matches the current cpu's memcg
2244 * stock, and at least @nr_pages are available in that stock. Failure to
2245 * service an allocation will refill the stock.
2247 * returns true if successful, false otherwise.
2249 static bool consume_stock(struct mem_cgroup
*memcg
, unsigned int nr_pages
)
2251 struct memcg_stock_pcp
*stock
;
2252 unsigned long flags
;
2255 if (nr_pages
> MEMCG_CHARGE_BATCH
)
2258 local_irq_save(flags
);
2260 stock
= this_cpu_ptr(&memcg_stock
);
2261 if (memcg
== stock
->cached
&& stock
->nr_pages
>= nr_pages
) {
2262 stock
->nr_pages
-= nr_pages
;
2266 local_irq_restore(flags
);
2272 * Returns stocks cached in percpu and reset cached information.
2274 static void drain_stock(struct memcg_stock_pcp
*stock
)
2276 struct mem_cgroup
*old
= stock
->cached
;
2281 if (stock
->nr_pages
) {
2282 page_counter_uncharge(&old
->memory
, stock
->nr_pages
);
2283 if (do_memsw_account())
2284 page_counter_uncharge(&old
->memsw
, stock
->nr_pages
);
2285 stock
->nr_pages
= 0;
2289 stock
->cached
= NULL
;
2292 static void drain_local_stock(struct work_struct
*dummy
)
2294 struct memcg_stock_pcp
*stock
;
2295 unsigned long flags
;
2298 * The only protection from memory hotplug vs. drain_stock races is
2299 * that we always operate on local CPU stock here with IRQ disabled
2301 local_irq_save(flags
);
2303 stock
= this_cpu_ptr(&memcg_stock
);
2304 drain_obj_stock(stock
);
2306 clear_bit(FLUSHING_CACHED_CHARGE
, &stock
->flags
);
2308 local_irq_restore(flags
);
2312 * Cache charges(val) to local per_cpu area.
2313 * This will be consumed by consume_stock() function, later.
2315 static void refill_stock(struct mem_cgroup
*memcg
, unsigned int nr_pages
)
2317 struct memcg_stock_pcp
*stock
;
2318 unsigned long flags
;
2320 local_irq_save(flags
);
2322 stock
= this_cpu_ptr(&memcg_stock
);
2323 if (stock
->cached
!= memcg
) { /* reset if necessary */
2325 css_get(&memcg
->css
);
2326 stock
->cached
= memcg
;
2328 stock
->nr_pages
+= nr_pages
;
2330 if (stock
->nr_pages
> MEMCG_CHARGE_BATCH
)
2333 local_irq_restore(flags
);
2337 * Drains all per-CPU charge caches for given root_memcg resp. subtree
2338 * of the hierarchy under it.
2340 static void drain_all_stock(struct mem_cgroup
*root_memcg
)
2344 /* If someone's already draining, avoid adding running more workers. */
2345 if (!mutex_trylock(&percpu_charge_mutex
))
2348 * Notify other cpus that system-wide "drain" is running
2349 * We do not care about races with the cpu hotplug because cpu down
2350 * as well as workers from this path always operate on the local
2351 * per-cpu data. CPU up doesn't touch memcg_stock at all.
2354 for_each_online_cpu(cpu
) {
2355 struct memcg_stock_pcp
*stock
= &per_cpu(memcg_stock
, cpu
);
2356 struct mem_cgroup
*memcg
;
2360 memcg
= stock
->cached
;
2361 if (memcg
&& stock
->nr_pages
&&
2362 mem_cgroup_is_descendant(memcg
, root_memcg
))
2364 if (obj_stock_flush_required(stock
, root_memcg
))
2369 !test_and_set_bit(FLUSHING_CACHED_CHARGE
, &stock
->flags
)) {
2371 drain_local_stock(&stock
->work
);
2373 schedule_work_on(cpu
, &stock
->work
);
2377 mutex_unlock(&percpu_charge_mutex
);
2380 static int memcg_hotplug_cpu_dead(unsigned int cpu
)
2382 struct memcg_stock_pcp
*stock
;
2383 struct mem_cgroup
*memcg
, *mi
;
2385 stock
= &per_cpu(memcg_stock
, cpu
);
2388 for_each_mem_cgroup(memcg
) {
2391 for (i
= 0; i
< MEMCG_NR_STAT
; i
++) {
2395 x
= this_cpu_xchg(memcg
->vmstats_percpu
->stat
[i
], 0);
2397 for (mi
= memcg
; mi
; mi
= parent_mem_cgroup(mi
))
2398 atomic_long_add(x
, &memcg
->vmstats
[i
]);
2400 if (i
>= NR_VM_NODE_STAT_ITEMS
)
2403 for_each_node(nid
) {
2404 struct mem_cgroup_per_node
*pn
;
2406 pn
= mem_cgroup_nodeinfo(memcg
, nid
);
2407 x
= this_cpu_xchg(pn
->lruvec_stat_cpu
->count
[i
], 0);
2410 atomic_long_add(x
, &pn
->lruvec_stat
[i
]);
2411 } while ((pn
= parent_nodeinfo(pn
, nid
)));
2415 for (i
= 0; i
< NR_VM_EVENT_ITEMS
; i
++) {
2418 x
= this_cpu_xchg(memcg
->vmstats_percpu
->events
[i
], 0);
2420 for (mi
= memcg
; mi
; mi
= parent_mem_cgroup(mi
))
2421 atomic_long_add(x
, &memcg
->vmevents
[i
]);
2428 static unsigned long reclaim_high(struct mem_cgroup
*memcg
,
2429 unsigned int nr_pages
,
2432 unsigned long nr_reclaimed
= 0;
2435 unsigned long pflags
;
2437 if (page_counter_read(&memcg
->memory
) <=
2438 READ_ONCE(memcg
->memory
.high
))
2441 memcg_memory_event(memcg
, MEMCG_HIGH
);
2443 psi_memstall_enter(&pflags
);
2444 nr_reclaimed
+= try_to_free_mem_cgroup_pages(memcg
, nr_pages
,
2446 psi_memstall_leave(&pflags
);
2447 } while ((memcg
= parent_mem_cgroup(memcg
)) &&
2448 !mem_cgroup_is_root(memcg
));
2450 return nr_reclaimed
;
2453 static void high_work_func(struct work_struct
*work
)
2455 struct mem_cgroup
*memcg
;
2457 memcg
= container_of(work
, struct mem_cgroup
, high_work
);
2458 reclaim_high(memcg
, MEMCG_CHARGE_BATCH
, GFP_KERNEL
);
2462 * Clamp the maximum sleep time per allocation batch to 2 seconds. This is
2463 * enough to still cause a significant slowdown in most cases, while still
2464 * allowing diagnostics and tracing to proceed without becoming stuck.
2466 #define MEMCG_MAX_HIGH_DELAY_JIFFIES (2UL*HZ)
2469 * When calculating the delay, we use these either side of the exponentiation to
2470 * maintain precision and scale to a reasonable number of jiffies (see the table
2473 * - MEMCG_DELAY_PRECISION_SHIFT: Extra precision bits while translating the
2474 * overage ratio to a delay.
2475 * - MEMCG_DELAY_SCALING_SHIFT: The number of bits to scale down the
2476 * proposed penalty in order to reduce to a reasonable number of jiffies, and
2477 * to produce a reasonable delay curve.
2479 * MEMCG_DELAY_SCALING_SHIFT just happens to be a number that produces a
2480 * reasonable delay curve compared to precision-adjusted overage, not
2481 * penalising heavily at first, but still making sure that growth beyond the
2482 * limit penalises misbehaviour cgroups by slowing them down exponentially. For
2483 * example, with a high of 100 megabytes:
2485 * +-------+------------------------+
2486 * | usage | time to allocate in ms |
2487 * +-------+------------------------+
2509 * +-------+------------------------+
2511 #define MEMCG_DELAY_PRECISION_SHIFT 20
2512 #define MEMCG_DELAY_SCALING_SHIFT 14
2514 static u64
calculate_overage(unsigned long usage
, unsigned long high
)
2522 * Prevent division by 0 in overage calculation by acting as if
2523 * it was a threshold of 1 page
2525 high
= max(high
, 1UL);
2527 overage
= usage
- high
;
2528 overage
<<= MEMCG_DELAY_PRECISION_SHIFT
;
2529 return div64_u64(overage
, high
);
2532 static u64
mem_find_max_overage(struct mem_cgroup
*memcg
)
2534 u64 overage
, max_overage
= 0;
2537 overage
= calculate_overage(page_counter_read(&memcg
->memory
),
2538 READ_ONCE(memcg
->memory
.high
));
2539 max_overage
= max(overage
, max_overage
);
2540 } while ((memcg
= parent_mem_cgroup(memcg
)) &&
2541 !mem_cgroup_is_root(memcg
));
2546 static u64
swap_find_max_overage(struct mem_cgroup
*memcg
)
2548 u64 overage
, max_overage
= 0;
2551 overage
= calculate_overage(page_counter_read(&memcg
->swap
),
2552 READ_ONCE(memcg
->swap
.high
));
2554 memcg_memory_event(memcg
, MEMCG_SWAP_HIGH
);
2555 max_overage
= max(overage
, max_overage
);
2556 } while ((memcg
= parent_mem_cgroup(memcg
)) &&
2557 !mem_cgroup_is_root(memcg
));
2563 * Get the number of jiffies that we should penalise a mischievous cgroup which
2564 * is exceeding its memory.high by checking both it and its ancestors.
2566 static unsigned long calculate_high_delay(struct mem_cgroup
*memcg
,
2567 unsigned int nr_pages
,
2570 unsigned long penalty_jiffies
;
2576 * We use overage compared to memory.high to calculate the number of
2577 * jiffies to sleep (penalty_jiffies). Ideally this value should be
2578 * fairly lenient on small overages, and increasingly harsh when the
2579 * memcg in question makes it clear that it has no intention of stopping
2580 * its crazy behaviour, so we exponentially increase the delay based on
2583 penalty_jiffies
= max_overage
* max_overage
* HZ
;
2584 penalty_jiffies
>>= MEMCG_DELAY_PRECISION_SHIFT
;
2585 penalty_jiffies
>>= MEMCG_DELAY_SCALING_SHIFT
;
2588 * Factor in the task's own contribution to the overage, such that four
2589 * N-sized allocations are throttled approximately the same as one
2590 * 4N-sized allocation.
2592 * MEMCG_CHARGE_BATCH pages is nominal, so work out how much smaller or
2593 * larger the current charge patch is than that.
2595 return penalty_jiffies
* nr_pages
/ MEMCG_CHARGE_BATCH
;
2599 * Scheduled by try_charge() to be executed from the userland return path
2600 * and reclaims memory over the high limit.
2602 void mem_cgroup_handle_over_high(void)
2604 unsigned long penalty_jiffies
;
2605 unsigned long pflags
;
2606 unsigned long nr_reclaimed
;
2607 unsigned int nr_pages
= current
->memcg_nr_pages_over_high
;
2608 int nr_retries
= MAX_RECLAIM_RETRIES
;
2609 struct mem_cgroup
*memcg
;
2610 bool in_retry
= false;
2612 if (likely(!nr_pages
))
2615 memcg
= get_mem_cgroup_from_mm(current
->mm
);
2616 current
->memcg_nr_pages_over_high
= 0;
2620 * The allocating task should reclaim at least the batch size, but for
2621 * subsequent retries we only want to do what's necessary to prevent oom
2622 * or breaching resource isolation.
2624 * This is distinct from memory.max or page allocator behaviour because
2625 * memory.high is currently batched, whereas memory.max and the page
2626 * allocator run every time an allocation is made.
2628 nr_reclaimed
= reclaim_high(memcg
,
2629 in_retry
? SWAP_CLUSTER_MAX
: nr_pages
,
2633 * memory.high is breached and reclaim is unable to keep up. Throttle
2634 * allocators proactively to slow down excessive growth.
2636 penalty_jiffies
= calculate_high_delay(memcg
, nr_pages
,
2637 mem_find_max_overage(memcg
));
2639 penalty_jiffies
+= calculate_high_delay(memcg
, nr_pages
,
2640 swap_find_max_overage(memcg
));
2643 * Clamp the max delay per usermode return so as to still keep the
2644 * application moving forwards and also permit diagnostics, albeit
2647 penalty_jiffies
= min(penalty_jiffies
, MEMCG_MAX_HIGH_DELAY_JIFFIES
);
2650 * Don't sleep if the amount of jiffies this memcg owes us is so low
2651 * that it's not even worth doing, in an attempt to be nice to those who
2652 * go only a small amount over their memory.high value and maybe haven't
2653 * been aggressively reclaimed enough yet.
2655 if (penalty_jiffies
<= HZ
/ 100)
2659 * If reclaim is making forward progress but we're still over
2660 * memory.high, we want to encourage that rather than doing allocator
2663 if (nr_reclaimed
|| nr_retries
--) {
2669 * If we exit early, we're guaranteed to die (since
2670 * schedule_timeout_killable sets TASK_KILLABLE). This means we don't
2671 * need to account for any ill-begotten jiffies to pay them off later.
2673 psi_memstall_enter(&pflags
);
2674 schedule_timeout_killable(penalty_jiffies
);
2675 psi_memstall_leave(&pflags
);
2678 css_put(&memcg
->css
);
2681 static int try_charge(struct mem_cgroup
*memcg
, gfp_t gfp_mask
,
2682 unsigned int nr_pages
)
2684 unsigned int batch
= max(MEMCG_CHARGE_BATCH
, nr_pages
);
2685 int nr_retries
= MAX_RECLAIM_RETRIES
;
2686 struct mem_cgroup
*mem_over_limit
;
2687 struct page_counter
*counter
;
2688 enum oom_status oom_status
;
2689 unsigned long nr_reclaimed
;
2690 bool may_swap
= true;
2691 bool drained
= false;
2692 unsigned long pflags
;
2694 if (mem_cgroup_is_root(memcg
))
2697 if (consume_stock(memcg
, nr_pages
))
2700 if (!do_memsw_account() ||
2701 page_counter_try_charge(&memcg
->memsw
, batch
, &counter
)) {
2702 if (page_counter_try_charge(&memcg
->memory
, batch
, &counter
))
2704 if (do_memsw_account())
2705 page_counter_uncharge(&memcg
->memsw
, batch
);
2706 mem_over_limit
= mem_cgroup_from_counter(counter
, memory
);
2708 mem_over_limit
= mem_cgroup_from_counter(counter
, memsw
);
2712 if (batch
> nr_pages
) {
2718 * Memcg doesn't have a dedicated reserve for atomic
2719 * allocations. But like the global atomic pool, we need to
2720 * put the burden of reclaim on regular allocation requests
2721 * and let these go through as privileged allocations.
2723 if (gfp_mask
& __GFP_ATOMIC
)
2727 * Unlike in global OOM situations, memcg is not in a physical
2728 * memory shortage. Allow dying and OOM-killed tasks to
2729 * bypass the last charges so that they can exit quickly and
2730 * free their memory.
2732 if (unlikely(should_force_charge()))
2736 * Prevent unbounded recursion when reclaim operations need to
2737 * allocate memory. This might exceed the limits temporarily,
2738 * but we prefer facilitating memory reclaim and getting back
2739 * under the limit over triggering OOM kills in these cases.
2741 if (unlikely(current
->flags
& PF_MEMALLOC
))
2744 if (unlikely(task_in_memcg_oom(current
)))
2747 if (!gfpflags_allow_blocking(gfp_mask
))
2750 memcg_memory_event(mem_over_limit
, MEMCG_MAX
);
2752 psi_memstall_enter(&pflags
);
2753 nr_reclaimed
= try_to_free_mem_cgroup_pages(mem_over_limit
, nr_pages
,
2754 gfp_mask
, may_swap
);
2755 psi_memstall_leave(&pflags
);
2757 if (mem_cgroup_margin(mem_over_limit
) >= nr_pages
)
2761 drain_all_stock(mem_over_limit
);
2766 if (gfp_mask
& __GFP_NORETRY
)
2769 * Even though the limit is exceeded at this point, reclaim
2770 * may have been able to free some pages. Retry the charge
2771 * before killing the task.
2773 * Only for regular pages, though: huge pages are rather
2774 * unlikely to succeed so close to the limit, and we fall back
2775 * to regular pages anyway in case of failure.
2777 if (nr_reclaimed
&& nr_pages
<= (1 << PAGE_ALLOC_COSTLY_ORDER
))
2780 * At task move, charge accounts can be doubly counted. So, it's
2781 * better to wait until the end of task_move if something is going on.
2783 if (mem_cgroup_wait_acct_move(mem_over_limit
))
2789 if (gfp_mask
& __GFP_RETRY_MAYFAIL
)
2792 if (gfp_mask
& __GFP_NOFAIL
)
2795 if (fatal_signal_pending(current
))
2799 * keep retrying as long as the memcg oom killer is able to make
2800 * a forward progress or bypass the charge if the oom killer
2801 * couldn't make any progress.
2803 oom_status
= mem_cgroup_oom(mem_over_limit
, gfp_mask
,
2804 get_order(nr_pages
* PAGE_SIZE
));
2805 switch (oom_status
) {
2807 nr_retries
= MAX_RECLAIM_RETRIES
;
2815 if (!(gfp_mask
& __GFP_NOFAIL
))
2819 * The allocation either can't fail or will lead to more memory
2820 * being freed very soon. Allow memory usage go over the limit
2821 * temporarily by force charging it.
2823 page_counter_charge(&memcg
->memory
, nr_pages
);
2824 if (do_memsw_account())
2825 page_counter_charge(&memcg
->memsw
, nr_pages
);
2830 if (batch
> nr_pages
)
2831 refill_stock(memcg
, batch
- nr_pages
);
2834 * If the hierarchy is above the normal consumption range, schedule
2835 * reclaim on returning to userland. We can perform reclaim here
2836 * if __GFP_RECLAIM but let's always punt for simplicity and so that
2837 * GFP_KERNEL can consistently be used during reclaim. @memcg is
2838 * not recorded as it most likely matches current's and won't
2839 * change in the meantime. As high limit is checked again before
2840 * reclaim, the cost of mismatch is negligible.
2843 bool mem_high
, swap_high
;
2845 mem_high
= page_counter_read(&memcg
->memory
) >
2846 READ_ONCE(memcg
->memory
.high
);
2847 swap_high
= page_counter_read(&memcg
->swap
) >
2848 READ_ONCE(memcg
->swap
.high
);
2850 /* Don't bother a random interrupted task */
2851 if (in_interrupt()) {
2853 schedule_work(&memcg
->high_work
);
2859 if (mem_high
|| swap_high
) {
2861 * The allocating tasks in this cgroup will need to do
2862 * reclaim or be throttled to prevent further growth
2863 * of the memory or swap footprints.
2865 * Target some best-effort fairness between the tasks,
2866 * and distribute reclaim work and delay penalties
2867 * based on how much each task is actually allocating.
2869 current
->memcg_nr_pages_over_high
+= batch
;
2870 set_notify_resume(current
);
2873 } while ((memcg
= parent_mem_cgroup(memcg
)));
2878 #if defined(CONFIG_MEMCG_KMEM) || defined(CONFIG_MMU)
2879 static void cancel_charge(struct mem_cgroup
*memcg
, unsigned int nr_pages
)
2881 if (mem_cgroup_is_root(memcg
))
2884 page_counter_uncharge(&memcg
->memory
, nr_pages
);
2885 if (do_memsw_account())
2886 page_counter_uncharge(&memcg
->memsw
, nr_pages
);
2890 static void commit_charge(struct page
*page
, struct mem_cgroup
*memcg
)
2892 VM_BUG_ON_PAGE(page
->mem_cgroup
, page
);
2894 * Any of the following ensures page->mem_cgroup stability:
2898 * - lock_page_memcg()
2899 * - exclusive reference
2901 page
->mem_cgroup
= memcg
;
2904 #ifdef CONFIG_MEMCG_KMEM
2905 int memcg_alloc_page_obj_cgroups(struct page
*page
, struct kmem_cache
*s
,
2908 unsigned int objects
= objs_per_slab_page(s
, page
);
2911 vec
= kcalloc_node(objects
, sizeof(struct obj_cgroup
*), gfp
,
2916 if (cmpxchg(&page
->obj_cgroups
, NULL
,
2917 (struct obj_cgroup
**) ((unsigned long)vec
| 0x1UL
)))
2920 kmemleak_not_leak(vec
);
2926 * Returns a pointer to the memory cgroup to which the kernel object is charged.
2928 * The caller must ensure the memcg lifetime, e.g. by taking rcu_read_lock(),
2929 * cgroup_mutex, etc.
2931 struct mem_cgroup
*mem_cgroup_from_obj(void *p
)
2935 if (mem_cgroup_disabled())
2938 page
= virt_to_head_page(p
);
2941 * If page->mem_cgroup is set, it's either a simple mem_cgroup pointer
2942 * or a pointer to obj_cgroup vector. In the latter case the lowest
2943 * bit of the pointer is set.
2944 * The page->mem_cgroup pointer can be asynchronously changed
2945 * from NULL to (obj_cgroup_vec | 0x1UL), but can't be changed
2946 * from a valid memcg pointer to objcg vector or back.
2948 if (!page
->mem_cgroup
)
2952 * Slab objects are accounted individually, not per-page.
2953 * Memcg membership data for each individual object is saved in
2954 * the page->obj_cgroups.
2956 if (page_has_obj_cgroups(page
)) {
2957 struct obj_cgroup
*objcg
;
2960 off
= obj_to_index(page
->slab_cache
, page
, p
);
2961 objcg
= page_obj_cgroups(page
)[off
];
2963 return obj_cgroup_memcg(objcg
);
2968 /* All other pages use page->mem_cgroup */
2969 return page
->mem_cgroup
;
2972 __always_inline
struct obj_cgroup
*get_obj_cgroup_from_current(void)
2974 struct obj_cgroup
*objcg
= NULL
;
2975 struct mem_cgroup
*memcg
;
2977 if (memcg_kmem_bypass())
2981 if (unlikely(active_memcg()))
2982 memcg
= active_memcg();
2984 memcg
= mem_cgroup_from_task(current
);
2986 for (; memcg
!= root_mem_cgroup
; memcg
= parent_mem_cgroup(memcg
)) {
2987 objcg
= rcu_dereference(memcg
->objcg
);
2988 if (objcg
&& obj_cgroup_tryget(objcg
))
2997 static int memcg_alloc_cache_id(void)
3002 id
= ida_simple_get(&memcg_cache_ida
,
3003 0, MEMCG_CACHES_MAX_SIZE
, GFP_KERNEL
);
3007 if (id
< memcg_nr_cache_ids
)
3011 * There's no space for the new id in memcg_caches arrays,
3012 * so we have to grow them.
3014 down_write(&memcg_cache_ids_sem
);
3016 size
= 2 * (id
+ 1);
3017 if (size
< MEMCG_CACHES_MIN_SIZE
)
3018 size
= MEMCG_CACHES_MIN_SIZE
;
3019 else if (size
> MEMCG_CACHES_MAX_SIZE
)
3020 size
= MEMCG_CACHES_MAX_SIZE
;
3022 err
= memcg_update_all_list_lrus(size
);
3024 memcg_nr_cache_ids
= size
;
3026 up_write(&memcg_cache_ids_sem
);
3029 ida_simple_remove(&memcg_cache_ida
, id
);
3035 static void memcg_free_cache_id(int id
)
3037 ida_simple_remove(&memcg_cache_ida
, id
);
3041 * __memcg_kmem_charge: charge a number of kernel pages to a memcg
3042 * @memcg: memory cgroup to charge
3043 * @gfp: reclaim mode
3044 * @nr_pages: number of pages to charge
3046 * Returns 0 on success, an error code on failure.
3048 int __memcg_kmem_charge(struct mem_cgroup
*memcg
, gfp_t gfp
,
3049 unsigned int nr_pages
)
3051 struct page_counter
*counter
;
3054 ret
= try_charge(memcg
, gfp
, nr_pages
);
3058 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys
) &&
3059 !page_counter_try_charge(&memcg
->kmem
, nr_pages
, &counter
)) {
3062 * Enforce __GFP_NOFAIL allocation because callers are not
3063 * prepared to see failures and likely do not have any failure
3066 if (gfp
& __GFP_NOFAIL
) {
3067 page_counter_charge(&memcg
->kmem
, nr_pages
);
3070 cancel_charge(memcg
, nr_pages
);
3077 * __memcg_kmem_uncharge: uncharge a number of kernel pages from a memcg
3078 * @memcg: memcg to uncharge
3079 * @nr_pages: number of pages to uncharge
3081 void __memcg_kmem_uncharge(struct mem_cgroup
*memcg
, unsigned int nr_pages
)
3083 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys
))
3084 page_counter_uncharge(&memcg
->kmem
, nr_pages
);
3086 page_counter_uncharge(&memcg
->memory
, nr_pages
);
3087 if (do_memsw_account())
3088 page_counter_uncharge(&memcg
->memsw
, nr_pages
);
3092 * __memcg_kmem_charge_page: charge a kmem page to the current memory cgroup
3093 * @page: page to charge
3094 * @gfp: reclaim mode
3095 * @order: allocation order
3097 * Returns 0 on success, an error code on failure.
3099 int __memcg_kmem_charge_page(struct page
*page
, gfp_t gfp
, int order
)
3101 struct mem_cgroup
*memcg
;
3104 memcg
= get_mem_cgroup_from_current();
3105 if (memcg
&& !mem_cgroup_is_root(memcg
)) {
3106 ret
= __memcg_kmem_charge(memcg
, gfp
, 1 << order
);
3108 page
->mem_cgroup
= memcg
;
3109 __SetPageKmemcg(page
);
3112 css_put(&memcg
->css
);
3118 * __memcg_kmem_uncharge_page: uncharge a kmem page
3119 * @page: page to uncharge
3120 * @order: allocation order
3122 void __memcg_kmem_uncharge_page(struct page
*page
, int order
)
3124 struct mem_cgroup
*memcg
= page
->mem_cgroup
;
3125 unsigned int nr_pages
= 1 << order
;
3130 VM_BUG_ON_PAGE(mem_cgroup_is_root(memcg
), page
);
3131 __memcg_kmem_uncharge(memcg
, nr_pages
);
3132 page
->mem_cgroup
= NULL
;
3133 css_put(&memcg
->css
);
3135 /* slab pages do not have PageKmemcg flag set */
3136 if (PageKmemcg(page
))
3137 __ClearPageKmemcg(page
);
3140 static bool consume_obj_stock(struct obj_cgroup
*objcg
, unsigned int nr_bytes
)
3142 struct memcg_stock_pcp
*stock
;
3143 unsigned long flags
;
3146 local_irq_save(flags
);
3148 stock
= this_cpu_ptr(&memcg_stock
);
3149 if (objcg
== stock
->cached_objcg
&& stock
->nr_bytes
>= nr_bytes
) {
3150 stock
->nr_bytes
-= nr_bytes
;
3154 local_irq_restore(flags
);
3159 static void drain_obj_stock(struct memcg_stock_pcp
*stock
)
3161 struct obj_cgroup
*old
= stock
->cached_objcg
;
3166 if (stock
->nr_bytes
) {
3167 unsigned int nr_pages
= stock
->nr_bytes
>> PAGE_SHIFT
;
3168 unsigned int nr_bytes
= stock
->nr_bytes
& (PAGE_SIZE
- 1);
3172 __memcg_kmem_uncharge(obj_cgroup_memcg(old
), nr_pages
);
3177 * The leftover is flushed to the centralized per-memcg value.
3178 * On the next attempt to refill obj stock it will be moved
3179 * to a per-cpu stock (probably, on an other CPU), see
3180 * refill_obj_stock().
3182 * How often it's flushed is a trade-off between the memory
3183 * limit enforcement accuracy and potential CPU contention,
3184 * so it might be changed in the future.
3186 atomic_add(nr_bytes
, &old
->nr_charged_bytes
);
3187 stock
->nr_bytes
= 0;
3190 obj_cgroup_put(old
);
3191 stock
->cached_objcg
= NULL
;
3194 static bool obj_stock_flush_required(struct memcg_stock_pcp
*stock
,
3195 struct mem_cgroup
*root_memcg
)
3197 struct mem_cgroup
*memcg
;
3199 if (stock
->cached_objcg
) {
3200 memcg
= obj_cgroup_memcg(stock
->cached_objcg
);
3201 if (memcg
&& mem_cgroup_is_descendant(memcg
, root_memcg
))
3208 static void refill_obj_stock(struct obj_cgroup
*objcg
, unsigned int nr_bytes
)
3210 struct memcg_stock_pcp
*stock
;
3211 unsigned long flags
;
3213 local_irq_save(flags
);
3215 stock
= this_cpu_ptr(&memcg_stock
);
3216 if (stock
->cached_objcg
!= objcg
) { /* reset if necessary */
3217 drain_obj_stock(stock
);
3218 obj_cgroup_get(objcg
);
3219 stock
->cached_objcg
= objcg
;
3220 stock
->nr_bytes
= atomic_xchg(&objcg
->nr_charged_bytes
, 0);
3222 stock
->nr_bytes
+= nr_bytes
;
3224 if (stock
->nr_bytes
> PAGE_SIZE
)
3225 drain_obj_stock(stock
);
3227 local_irq_restore(flags
);
3230 int obj_cgroup_charge(struct obj_cgroup
*objcg
, gfp_t gfp
, size_t size
)
3232 struct mem_cgroup
*memcg
;
3233 unsigned int nr_pages
, nr_bytes
;
3236 if (consume_obj_stock(objcg
, size
))
3240 * In theory, memcg->nr_charged_bytes can have enough
3241 * pre-charged bytes to satisfy the allocation. However,
3242 * flushing memcg->nr_charged_bytes requires two atomic
3243 * operations, and memcg->nr_charged_bytes can't be big,
3244 * so it's better to ignore it and try grab some new pages.
3245 * memcg->nr_charged_bytes will be flushed in
3246 * refill_obj_stock(), called from this function or
3247 * independently later.
3251 memcg
= obj_cgroup_memcg(objcg
);
3252 if (unlikely(!css_tryget(&memcg
->css
)))
3256 nr_pages
= size
>> PAGE_SHIFT
;
3257 nr_bytes
= size
& (PAGE_SIZE
- 1);
3262 ret
= __memcg_kmem_charge(memcg
, gfp
, nr_pages
);
3263 if (!ret
&& nr_bytes
)
3264 refill_obj_stock(objcg
, PAGE_SIZE
- nr_bytes
);
3266 css_put(&memcg
->css
);
3270 void obj_cgroup_uncharge(struct obj_cgroup
*objcg
, size_t size
)
3272 refill_obj_stock(objcg
, size
);
3275 #endif /* CONFIG_MEMCG_KMEM */
3277 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
3280 * Because tail pages are not marked as "used", set it. We're under
3281 * pgdat->lru_lock and migration entries setup in all page mappings.
3283 void mem_cgroup_split_huge_fixup(struct page
*head
)
3285 struct mem_cgroup
*memcg
= head
->mem_cgroup
;
3288 if (mem_cgroup_disabled())
3291 for (i
= 1; i
< HPAGE_PMD_NR
; i
++) {
3292 css_get(&memcg
->css
);
3293 head
[i
].mem_cgroup
= memcg
;
3296 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
3298 #ifdef CONFIG_MEMCG_SWAP
3300 * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record.
3301 * @entry: swap entry to be moved
3302 * @from: mem_cgroup which the entry is moved from
3303 * @to: mem_cgroup which the entry is moved to
3305 * It succeeds only when the swap_cgroup's record for this entry is the same
3306 * as the mem_cgroup's id of @from.
3308 * Returns 0 on success, -EINVAL on failure.
3310 * The caller must have charged to @to, IOW, called page_counter_charge() about
3311 * both res and memsw, and called css_get().
3313 static int mem_cgroup_move_swap_account(swp_entry_t entry
,
3314 struct mem_cgroup
*from
, struct mem_cgroup
*to
)
3316 unsigned short old_id
, new_id
;
3318 old_id
= mem_cgroup_id(from
);
3319 new_id
= mem_cgroup_id(to
);
3321 if (swap_cgroup_cmpxchg(entry
, old_id
, new_id
) == old_id
) {
3322 mod_memcg_state(from
, MEMCG_SWAP
, -1);
3323 mod_memcg_state(to
, MEMCG_SWAP
, 1);
3329 static inline int mem_cgroup_move_swap_account(swp_entry_t entry
,
3330 struct mem_cgroup
*from
, struct mem_cgroup
*to
)
3336 static DEFINE_MUTEX(memcg_max_mutex
);
3338 static int mem_cgroup_resize_max(struct mem_cgroup
*memcg
,
3339 unsigned long max
, bool memsw
)
3341 bool enlarge
= false;
3342 bool drained
= false;
3344 bool limits_invariant
;
3345 struct page_counter
*counter
= memsw
? &memcg
->memsw
: &memcg
->memory
;
3348 if (signal_pending(current
)) {
3353 mutex_lock(&memcg_max_mutex
);
3355 * Make sure that the new limit (memsw or memory limit) doesn't
3356 * break our basic invariant rule memory.max <= memsw.max.
3358 limits_invariant
= memsw
? max
>= READ_ONCE(memcg
->memory
.max
) :
3359 max
<= memcg
->memsw
.max
;
3360 if (!limits_invariant
) {
3361 mutex_unlock(&memcg_max_mutex
);
3365 if (max
> counter
->max
)
3367 ret
= page_counter_set_max(counter
, max
);
3368 mutex_unlock(&memcg_max_mutex
);
3374 drain_all_stock(memcg
);
3379 if (!try_to_free_mem_cgroup_pages(memcg
, 1,
3380 GFP_KERNEL
, !memsw
)) {
3386 if (!ret
&& enlarge
)
3387 memcg_oom_recover(memcg
);
3392 unsigned long mem_cgroup_soft_limit_reclaim(pg_data_t
*pgdat
, int order
,
3394 unsigned long *total_scanned
)
3396 unsigned long nr_reclaimed
= 0;
3397 struct mem_cgroup_per_node
*mz
, *next_mz
= NULL
;
3398 unsigned long reclaimed
;
3400 struct mem_cgroup_tree_per_node
*mctz
;
3401 unsigned long excess
;
3402 unsigned long nr_scanned
;
3407 mctz
= soft_limit_tree_node(pgdat
->node_id
);
3410 * Do not even bother to check the largest node if the root
3411 * is empty. Do it lockless to prevent lock bouncing. Races
3412 * are acceptable as soft limit is best effort anyway.
3414 if (!mctz
|| RB_EMPTY_ROOT(&mctz
->rb_root
))
3418 * This loop can run a while, specially if mem_cgroup's continuously
3419 * keep exceeding their soft limit and putting the system under
3426 mz
= mem_cgroup_largest_soft_limit_node(mctz
);
3431 reclaimed
= mem_cgroup_soft_reclaim(mz
->memcg
, pgdat
,
3432 gfp_mask
, &nr_scanned
);
3433 nr_reclaimed
+= reclaimed
;
3434 *total_scanned
+= nr_scanned
;
3435 spin_lock_irq(&mctz
->lock
);
3436 __mem_cgroup_remove_exceeded(mz
, mctz
);
3439 * If we failed to reclaim anything from this memory cgroup
3440 * it is time to move on to the next cgroup
3444 next_mz
= __mem_cgroup_largest_soft_limit_node(mctz
);
3446 excess
= soft_limit_excess(mz
->memcg
);
3448 * One school of thought says that we should not add
3449 * back the node to the tree if reclaim returns 0.
3450 * But our reclaim could return 0, simply because due
3451 * to priority we are exposing a smaller subset of
3452 * memory to reclaim from. Consider this as a longer
3455 /* If excess == 0, no tree ops */
3456 __mem_cgroup_insert_exceeded(mz
, mctz
, excess
);
3457 spin_unlock_irq(&mctz
->lock
);
3458 css_put(&mz
->memcg
->css
);
3461 * Could not reclaim anything and there are no more
3462 * mem cgroups to try or we seem to be looping without
3463 * reclaiming anything.
3465 if (!nr_reclaimed
&&
3467 loop
> MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS
))
3469 } while (!nr_reclaimed
);
3471 css_put(&next_mz
->memcg
->css
);
3472 return nr_reclaimed
;
3476 * Test whether @memcg has children, dead or alive. Note that this
3477 * function doesn't care whether @memcg has use_hierarchy enabled and
3478 * returns %true if there are child csses according to the cgroup
3479 * hierarchy. Testing use_hierarchy is the caller's responsibility.
3481 static inline bool memcg_has_children(struct mem_cgroup
*memcg
)
3486 ret
= css_next_child(NULL
, &memcg
->css
);
3492 * Reclaims as many pages from the given memcg as possible.
3494 * Caller is responsible for holding css reference for memcg.
3496 static int mem_cgroup_force_empty(struct mem_cgroup
*memcg
)
3498 int nr_retries
= MAX_RECLAIM_RETRIES
;
3500 /* we call try-to-free pages for make this cgroup empty */
3501 lru_add_drain_all();
3503 drain_all_stock(memcg
);
3505 /* try to free all pages in this cgroup */
3506 while (nr_retries
&& page_counter_read(&memcg
->memory
)) {
3509 if (signal_pending(current
))
3512 progress
= try_to_free_mem_cgroup_pages(memcg
, 1,
3516 /* maybe some writeback is necessary */
3517 congestion_wait(BLK_RW_ASYNC
, HZ
/10);
3525 static ssize_t
mem_cgroup_force_empty_write(struct kernfs_open_file
*of
,
3526 char *buf
, size_t nbytes
,
3529 struct mem_cgroup
*memcg
= mem_cgroup_from_css(of_css(of
));
3531 if (mem_cgroup_is_root(memcg
))
3533 return mem_cgroup_force_empty(memcg
) ?: nbytes
;
3536 static u64
mem_cgroup_hierarchy_read(struct cgroup_subsys_state
*css
,
3539 return mem_cgroup_from_css(css
)->use_hierarchy
;
3542 static int mem_cgroup_hierarchy_write(struct cgroup_subsys_state
*css
,
3543 struct cftype
*cft
, u64 val
)
3546 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
3547 struct mem_cgroup
*parent_memcg
= mem_cgroup_from_css(memcg
->css
.parent
);
3549 if (memcg
->use_hierarchy
== val
)
3553 * If parent's use_hierarchy is set, we can't make any modifications
3554 * in the child subtrees. If it is unset, then the change can
3555 * occur, provided the current cgroup has no children.
3557 * For the root cgroup, parent_mem is NULL, we allow value to be
3558 * set if there are no children.
3560 if ((!parent_memcg
|| !parent_memcg
->use_hierarchy
) &&
3561 (val
== 1 || val
== 0)) {
3562 if (!memcg_has_children(memcg
))
3563 memcg
->use_hierarchy
= val
;
3572 static unsigned long mem_cgroup_usage(struct mem_cgroup
*memcg
, bool swap
)
3576 if (mem_cgroup_is_root(memcg
)) {
3577 val
= memcg_page_state(memcg
, NR_FILE_PAGES
) +
3578 memcg_page_state(memcg
, NR_ANON_MAPPED
);
3580 val
+= memcg_page_state(memcg
, MEMCG_SWAP
);
3583 val
= page_counter_read(&memcg
->memory
);
3585 val
= page_counter_read(&memcg
->memsw
);
3598 static u64
mem_cgroup_read_u64(struct cgroup_subsys_state
*css
,
3601 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
3602 struct page_counter
*counter
;
3604 switch (MEMFILE_TYPE(cft
->private)) {
3606 counter
= &memcg
->memory
;
3609 counter
= &memcg
->memsw
;
3612 counter
= &memcg
->kmem
;
3615 counter
= &memcg
->tcpmem
;
3621 switch (MEMFILE_ATTR(cft
->private)) {
3623 if (counter
== &memcg
->memory
)
3624 return (u64
)mem_cgroup_usage(memcg
, false) * PAGE_SIZE
;
3625 if (counter
== &memcg
->memsw
)
3626 return (u64
)mem_cgroup_usage(memcg
, true) * PAGE_SIZE
;
3627 return (u64
)page_counter_read(counter
) * PAGE_SIZE
;
3629 return (u64
)counter
->max
* PAGE_SIZE
;
3631 return (u64
)counter
->watermark
* PAGE_SIZE
;
3633 return counter
->failcnt
;
3634 case RES_SOFT_LIMIT
:
3635 return (u64
)memcg
->soft_limit
* PAGE_SIZE
;
3641 static void memcg_flush_percpu_vmstats(struct mem_cgroup
*memcg
)
3643 unsigned long stat
[MEMCG_NR_STAT
] = {0};
3644 struct mem_cgroup
*mi
;
3647 for_each_online_cpu(cpu
)
3648 for (i
= 0; i
< MEMCG_NR_STAT
; i
++)
3649 stat
[i
] += per_cpu(memcg
->vmstats_percpu
->stat
[i
], cpu
);
3651 for (mi
= memcg
; mi
; mi
= parent_mem_cgroup(mi
))
3652 for (i
= 0; i
< MEMCG_NR_STAT
; i
++)
3653 atomic_long_add(stat
[i
], &mi
->vmstats
[i
]);
3655 for_each_node(node
) {
3656 struct mem_cgroup_per_node
*pn
= memcg
->nodeinfo
[node
];
3657 struct mem_cgroup_per_node
*pi
;
3659 for (i
= 0; i
< NR_VM_NODE_STAT_ITEMS
; i
++)
3662 for_each_online_cpu(cpu
)
3663 for (i
= 0; i
< NR_VM_NODE_STAT_ITEMS
; i
++)
3665 pn
->lruvec_stat_cpu
->count
[i
], cpu
);
3667 for (pi
= pn
; pi
; pi
= parent_nodeinfo(pi
, node
))
3668 for (i
= 0; i
< NR_VM_NODE_STAT_ITEMS
; i
++)
3669 atomic_long_add(stat
[i
], &pi
->lruvec_stat
[i
]);
3673 static void memcg_flush_percpu_vmevents(struct mem_cgroup
*memcg
)
3675 unsigned long events
[NR_VM_EVENT_ITEMS
];
3676 struct mem_cgroup
*mi
;
3679 for (i
= 0; i
< NR_VM_EVENT_ITEMS
; i
++)
3682 for_each_online_cpu(cpu
)
3683 for (i
= 0; i
< NR_VM_EVENT_ITEMS
; i
++)
3684 events
[i
] += per_cpu(memcg
->vmstats_percpu
->events
[i
],
3687 for (mi
= memcg
; mi
; mi
= parent_mem_cgroup(mi
))
3688 for (i
= 0; i
< NR_VM_EVENT_ITEMS
; i
++)
3689 atomic_long_add(events
[i
], &mi
->vmevents
[i
]);
3692 #ifdef CONFIG_MEMCG_KMEM
3693 static int memcg_online_kmem(struct mem_cgroup
*memcg
)
3695 struct obj_cgroup
*objcg
;
3698 if (cgroup_memory_nokmem
)
3701 BUG_ON(memcg
->kmemcg_id
>= 0);
3702 BUG_ON(memcg
->kmem_state
);
3704 memcg_id
= memcg_alloc_cache_id();
3708 objcg
= obj_cgroup_alloc();
3710 memcg_free_cache_id(memcg_id
);
3713 objcg
->memcg
= memcg
;
3714 rcu_assign_pointer(memcg
->objcg
, objcg
);
3716 static_branch_enable(&memcg_kmem_enabled_key
);
3719 * A memory cgroup is considered kmem-online as soon as it gets
3720 * kmemcg_id. Setting the id after enabling static branching will
3721 * guarantee no one starts accounting before all call sites are
3724 memcg
->kmemcg_id
= memcg_id
;
3725 memcg
->kmem_state
= KMEM_ONLINE
;
3730 static void memcg_offline_kmem(struct mem_cgroup
*memcg
)
3732 struct cgroup_subsys_state
*css
;
3733 struct mem_cgroup
*parent
, *child
;
3736 if (memcg
->kmem_state
!= KMEM_ONLINE
)
3739 memcg
->kmem_state
= KMEM_ALLOCATED
;
3741 parent
= parent_mem_cgroup(memcg
);
3743 parent
= root_mem_cgroup
;
3745 memcg_reparent_objcgs(memcg
, parent
);
3747 kmemcg_id
= memcg
->kmemcg_id
;
3748 BUG_ON(kmemcg_id
< 0);
3751 * Change kmemcg_id of this cgroup and all its descendants to the
3752 * parent's id, and then move all entries from this cgroup's list_lrus
3753 * to ones of the parent. After we have finished, all list_lrus
3754 * corresponding to this cgroup are guaranteed to remain empty. The
3755 * ordering is imposed by list_lru_node->lock taken by
3756 * memcg_drain_all_list_lrus().
3758 rcu_read_lock(); /* can be called from css_free w/o cgroup_mutex */
3759 css_for_each_descendant_pre(css
, &memcg
->css
) {
3760 child
= mem_cgroup_from_css(css
);
3761 BUG_ON(child
->kmemcg_id
!= kmemcg_id
);
3762 child
->kmemcg_id
= parent
->kmemcg_id
;
3763 if (!memcg
->use_hierarchy
)
3768 memcg_drain_all_list_lrus(kmemcg_id
, parent
);
3770 memcg_free_cache_id(kmemcg_id
);
3773 static void memcg_free_kmem(struct mem_cgroup
*memcg
)
3775 /* css_alloc() failed, offlining didn't happen */
3776 if (unlikely(memcg
->kmem_state
== KMEM_ONLINE
))
3777 memcg_offline_kmem(memcg
);
3780 static int memcg_online_kmem(struct mem_cgroup
*memcg
)
3784 static void memcg_offline_kmem(struct mem_cgroup
*memcg
)
3787 static void memcg_free_kmem(struct mem_cgroup
*memcg
)
3790 #endif /* CONFIG_MEMCG_KMEM */
3792 static int memcg_update_kmem_max(struct mem_cgroup
*memcg
,
3797 mutex_lock(&memcg_max_mutex
);
3798 ret
= page_counter_set_max(&memcg
->kmem
, max
);
3799 mutex_unlock(&memcg_max_mutex
);
3803 static int memcg_update_tcp_max(struct mem_cgroup
*memcg
, unsigned long max
)
3807 mutex_lock(&memcg_max_mutex
);
3809 ret
= page_counter_set_max(&memcg
->tcpmem
, max
);
3813 if (!memcg
->tcpmem_active
) {
3815 * The active flag needs to be written after the static_key
3816 * update. This is what guarantees that the socket activation
3817 * function is the last one to run. See mem_cgroup_sk_alloc()
3818 * for details, and note that we don't mark any socket as
3819 * belonging to this memcg until that flag is up.
3821 * We need to do this, because static_keys will span multiple
3822 * sites, but we can't control their order. If we mark a socket
3823 * as accounted, but the accounting functions are not patched in
3824 * yet, we'll lose accounting.
3826 * We never race with the readers in mem_cgroup_sk_alloc(),
3827 * because when this value change, the code to process it is not
3830 static_branch_inc(&memcg_sockets_enabled_key
);
3831 memcg
->tcpmem_active
= true;
3834 mutex_unlock(&memcg_max_mutex
);
3839 * The user of this function is...
3842 static ssize_t
mem_cgroup_write(struct kernfs_open_file
*of
,
3843 char *buf
, size_t nbytes
, loff_t off
)
3845 struct mem_cgroup
*memcg
= mem_cgroup_from_css(of_css(of
));
3846 unsigned long nr_pages
;
3849 buf
= strstrip(buf
);
3850 ret
= page_counter_memparse(buf
, "-1", &nr_pages
);
3854 switch (MEMFILE_ATTR(of_cft(of
)->private)) {
3856 if (mem_cgroup_is_root(memcg
)) { /* Can't set limit on root */
3860 switch (MEMFILE_TYPE(of_cft(of
)->private)) {
3862 ret
= mem_cgroup_resize_max(memcg
, nr_pages
, false);
3865 ret
= mem_cgroup_resize_max(memcg
, nr_pages
, true);
3868 pr_warn_once("kmem.limit_in_bytes is deprecated and will be removed. "
3869 "Please report your usecase to linux-mm@kvack.org if you "
3870 "depend on this functionality.\n");
3871 ret
= memcg_update_kmem_max(memcg
, nr_pages
);
3874 ret
= memcg_update_tcp_max(memcg
, nr_pages
);
3878 case RES_SOFT_LIMIT
:
3879 memcg
->soft_limit
= nr_pages
;
3883 return ret
?: nbytes
;
3886 static ssize_t
mem_cgroup_reset(struct kernfs_open_file
*of
, char *buf
,
3887 size_t nbytes
, loff_t off
)
3889 struct mem_cgroup
*memcg
= mem_cgroup_from_css(of_css(of
));
3890 struct page_counter
*counter
;
3892 switch (MEMFILE_TYPE(of_cft(of
)->private)) {
3894 counter
= &memcg
->memory
;
3897 counter
= &memcg
->memsw
;
3900 counter
= &memcg
->kmem
;
3903 counter
= &memcg
->tcpmem
;
3909 switch (MEMFILE_ATTR(of_cft(of
)->private)) {
3911 page_counter_reset_watermark(counter
);
3914 counter
->failcnt
= 0;
3923 static u64
mem_cgroup_move_charge_read(struct cgroup_subsys_state
*css
,
3926 return mem_cgroup_from_css(css
)->move_charge_at_immigrate
;
3930 static int mem_cgroup_move_charge_write(struct cgroup_subsys_state
*css
,
3931 struct cftype
*cft
, u64 val
)
3933 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
3935 if (val
& ~MOVE_MASK
)
3939 * No kind of locking is needed in here, because ->can_attach() will
3940 * check this value once in the beginning of the process, and then carry
3941 * on with stale data. This means that changes to this value will only
3942 * affect task migrations starting after the change.
3944 memcg
->move_charge_at_immigrate
= val
;
3948 static int mem_cgroup_move_charge_write(struct cgroup_subsys_state
*css
,
3949 struct cftype
*cft
, u64 val
)
3957 #define LRU_ALL_FILE (BIT(LRU_INACTIVE_FILE) | BIT(LRU_ACTIVE_FILE))
3958 #define LRU_ALL_ANON (BIT(LRU_INACTIVE_ANON) | BIT(LRU_ACTIVE_ANON))
3959 #define LRU_ALL ((1 << NR_LRU_LISTS) - 1)
3961 static unsigned long mem_cgroup_node_nr_lru_pages(struct mem_cgroup
*memcg
,
3962 int nid
, unsigned int lru_mask
, bool tree
)
3964 struct lruvec
*lruvec
= mem_cgroup_lruvec(memcg
, NODE_DATA(nid
));
3965 unsigned long nr
= 0;
3968 VM_BUG_ON((unsigned)nid
>= nr_node_ids
);
3971 if (!(BIT(lru
) & lru_mask
))
3974 nr
+= lruvec_page_state(lruvec
, NR_LRU_BASE
+ lru
);
3976 nr
+= lruvec_page_state_local(lruvec
, NR_LRU_BASE
+ lru
);
3981 static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup
*memcg
,
3982 unsigned int lru_mask
,
3985 unsigned long nr
= 0;
3989 if (!(BIT(lru
) & lru_mask
))
3992 nr
+= memcg_page_state(memcg
, NR_LRU_BASE
+ lru
);
3994 nr
+= memcg_page_state_local(memcg
, NR_LRU_BASE
+ lru
);
3999 static int memcg_numa_stat_show(struct seq_file
*m
, void *v
)
4003 unsigned int lru_mask
;
4006 static const struct numa_stat stats
[] = {
4007 { "total", LRU_ALL
},
4008 { "file", LRU_ALL_FILE
},
4009 { "anon", LRU_ALL_ANON
},
4010 { "unevictable", BIT(LRU_UNEVICTABLE
) },
4012 const struct numa_stat
*stat
;
4014 struct mem_cgroup
*memcg
= mem_cgroup_from_seq(m
);
4016 for (stat
= stats
; stat
< stats
+ ARRAY_SIZE(stats
); stat
++) {
4017 seq_printf(m
, "%s=%lu", stat
->name
,
4018 mem_cgroup_nr_lru_pages(memcg
, stat
->lru_mask
,
4020 for_each_node_state(nid
, N_MEMORY
)
4021 seq_printf(m
, " N%d=%lu", nid
,
4022 mem_cgroup_node_nr_lru_pages(memcg
, nid
,
4023 stat
->lru_mask
, false));
4027 for (stat
= stats
; stat
< stats
+ ARRAY_SIZE(stats
); stat
++) {
4029 seq_printf(m
, "hierarchical_%s=%lu", stat
->name
,
4030 mem_cgroup_nr_lru_pages(memcg
, stat
->lru_mask
,
4032 for_each_node_state(nid
, N_MEMORY
)
4033 seq_printf(m
, " N%d=%lu", nid
,
4034 mem_cgroup_node_nr_lru_pages(memcg
, nid
,
4035 stat
->lru_mask
, true));
4041 #endif /* CONFIG_NUMA */
4043 static const unsigned int memcg1_stats
[] = {
4046 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4056 static const char *const memcg1_stat_names
[] = {
4059 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4069 /* Universal VM events cgroup1 shows, original sort order */
4070 static const unsigned int memcg1_events
[] = {
4077 static int memcg_stat_show(struct seq_file
*m
, void *v
)
4079 struct mem_cgroup
*memcg
= mem_cgroup_from_seq(m
);
4080 unsigned long memory
, memsw
;
4081 struct mem_cgroup
*mi
;
4084 BUILD_BUG_ON(ARRAY_SIZE(memcg1_stat_names
) != ARRAY_SIZE(memcg1_stats
));
4086 for (i
= 0; i
< ARRAY_SIZE(memcg1_stats
); i
++) {
4089 if (memcg1_stats
[i
] == MEMCG_SWAP
&& !do_memsw_account())
4091 nr
= memcg_page_state_local(memcg
, memcg1_stats
[i
]);
4092 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4093 if (memcg1_stats
[i
] == NR_ANON_THPS
)
4096 seq_printf(m
, "%s %lu\n", memcg1_stat_names
[i
], nr
* PAGE_SIZE
);
4099 for (i
= 0; i
< ARRAY_SIZE(memcg1_events
); i
++)
4100 seq_printf(m
, "%s %lu\n", vm_event_name(memcg1_events
[i
]),
4101 memcg_events_local(memcg
, memcg1_events
[i
]));
4103 for (i
= 0; i
< NR_LRU_LISTS
; i
++)
4104 seq_printf(m
, "%s %lu\n", lru_list_name(i
),
4105 memcg_page_state_local(memcg
, NR_LRU_BASE
+ i
) *
4108 /* Hierarchical information */
4109 memory
= memsw
= PAGE_COUNTER_MAX
;
4110 for (mi
= memcg
; mi
; mi
= parent_mem_cgroup(mi
)) {
4111 memory
= min(memory
, READ_ONCE(mi
->memory
.max
));
4112 memsw
= min(memsw
, READ_ONCE(mi
->memsw
.max
));
4114 seq_printf(m
, "hierarchical_memory_limit %llu\n",
4115 (u64
)memory
* PAGE_SIZE
);
4116 if (do_memsw_account())
4117 seq_printf(m
, "hierarchical_memsw_limit %llu\n",
4118 (u64
)memsw
* PAGE_SIZE
);
4120 for (i
= 0; i
< ARRAY_SIZE(memcg1_stats
); i
++) {
4123 if (memcg1_stats
[i
] == MEMCG_SWAP
&& !do_memsw_account())
4125 nr
= memcg_page_state(memcg
, memcg1_stats
[i
]);
4126 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4127 if (memcg1_stats
[i
] == NR_ANON_THPS
)
4130 seq_printf(m
, "total_%s %llu\n", memcg1_stat_names
[i
],
4131 (u64
)nr
* PAGE_SIZE
);
4134 for (i
= 0; i
< ARRAY_SIZE(memcg1_events
); i
++)
4135 seq_printf(m
, "total_%s %llu\n",
4136 vm_event_name(memcg1_events
[i
]),
4137 (u64
)memcg_events(memcg
, memcg1_events
[i
]));
4139 for (i
= 0; i
< NR_LRU_LISTS
; i
++)
4140 seq_printf(m
, "total_%s %llu\n", lru_list_name(i
),
4141 (u64
)memcg_page_state(memcg
, NR_LRU_BASE
+ i
) *
4144 #ifdef CONFIG_DEBUG_VM
4147 struct mem_cgroup_per_node
*mz
;
4148 unsigned long anon_cost
= 0;
4149 unsigned long file_cost
= 0;
4151 for_each_online_pgdat(pgdat
) {
4152 mz
= mem_cgroup_nodeinfo(memcg
, pgdat
->node_id
);
4154 anon_cost
+= mz
->lruvec
.anon_cost
;
4155 file_cost
+= mz
->lruvec
.file_cost
;
4157 seq_printf(m
, "anon_cost %lu\n", anon_cost
);
4158 seq_printf(m
, "file_cost %lu\n", file_cost
);
4165 static u64
mem_cgroup_swappiness_read(struct cgroup_subsys_state
*css
,
4168 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
4170 return mem_cgroup_swappiness(memcg
);
4173 static int mem_cgroup_swappiness_write(struct cgroup_subsys_state
*css
,
4174 struct cftype
*cft
, u64 val
)
4176 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
4182 memcg
->swappiness
= val
;
4184 vm_swappiness
= val
;
4189 static void __mem_cgroup_threshold(struct mem_cgroup
*memcg
, bool swap
)
4191 struct mem_cgroup_threshold_ary
*t
;
4192 unsigned long usage
;
4197 t
= rcu_dereference(memcg
->thresholds
.primary
);
4199 t
= rcu_dereference(memcg
->memsw_thresholds
.primary
);
4204 usage
= mem_cgroup_usage(memcg
, swap
);
4207 * current_threshold points to threshold just below or equal to usage.
4208 * If it's not true, a threshold was crossed after last
4209 * call of __mem_cgroup_threshold().
4211 i
= t
->current_threshold
;
4214 * Iterate backward over array of thresholds starting from
4215 * current_threshold and check if a threshold is crossed.
4216 * If none of thresholds below usage is crossed, we read
4217 * only one element of the array here.
4219 for (; i
>= 0 && unlikely(t
->entries
[i
].threshold
> usage
); i
--)
4220 eventfd_signal(t
->entries
[i
].eventfd
, 1);
4222 /* i = current_threshold + 1 */
4226 * Iterate forward over array of thresholds starting from
4227 * current_threshold+1 and check if a threshold is crossed.
4228 * If none of thresholds above usage is crossed, we read
4229 * only one element of the array here.
4231 for (; i
< t
->size
&& unlikely(t
->entries
[i
].threshold
<= usage
); i
++)
4232 eventfd_signal(t
->entries
[i
].eventfd
, 1);
4234 /* Update current_threshold */
4235 t
->current_threshold
= i
- 1;
4240 static void mem_cgroup_threshold(struct mem_cgroup
*memcg
)
4243 __mem_cgroup_threshold(memcg
, false);
4244 if (do_memsw_account())
4245 __mem_cgroup_threshold(memcg
, true);
4247 memcg
= parent_mem_cgroup(memcg
);
4251 static int compare_thresholds(const void *a
, const void *b
)
4253 const struct mem_cgroup_threshold
*_a
= a
;
4254 const struct mem_cgroup_threshold
*_b
= b
;
4256 if (_a
->threshold
> _b
->threshold
)
4259 if (_a
->threshold
< _b
->threshold
)
4265 static int mem_cgroup_oom_notify_cb(struct mem_cgroup
*memcg
)
4267 struct mem_cgroup_eventfd_list
*ev
;
4269 spin_lock(&memcg_oom_lock
);
4271 list_for_each_entry(ev
, &memcg
->oom_notify
, list
)
4272 eventfd_signal(ev
->eventfd
, 1);
4274 spin_unlock(&memcg_oom_lock
);
4278 static void mem_cgroup_oom_notify(struct mem_cgroup
*memcg
)
4280 struct mem_cgroup
*iter
;
4282 for_each_mem_cgroup_tree(iter
, memcg
)
4283 mem_cgroup_oom_notify_cb(iter
);
4286 static int __mem_cgroup_usage_register_event(struct mem_cgroup
*memcg
,
4287 struct eventfd_ctx
*eventfd
, const char *args
, enum res_type type
)
4289 struct mem_cgroup_thresholds
*thresholds
;
4290 struct mem_cgroup_threshold_ary
*new;
4291 unsigned long threshold
;
4292 unsigned long usage
;
4295 ret
= page_counter_memparse(args
, "-1", &threshold
);
4299 mutex_lock(&memcg
->thresholds_lock
);
4302 thresholds
= &memcg
->thresholds
;
4303 usage
= mem_cgroup_usage(memcg
, false);
4304 } else if (type
== _MEMSWAP
) {
4305 thresholds
= &memcg
->memsw_thresholds
;
4306 usage
= mem_cgroup_usage(memcg
, true);
4310 /* Check if a threshold crossed before adding a new one */
4311 if (thresholds
->primary
)
4312 __mem_cgroup_threshold(memcg
, type
== _MEMSWAP
);
4314 size
= thresholds
->primary
? thresholds
->primary
->size
+ 1 : 1;
4316 /* Allocate memory for new array of thresholds */
4317 new = kmalloc(struct_size(new, entries
, size
), GFP_KERNEL
);
4324 /* Copy thresholds (if any) to new array */
4325 if (thresholds
->primary
)
4326 memcpy(new->entries
, thresholds
->primary
->entries
,
4327 flex_array_size(new, entries
, size
- 1));
4329 /* Add new threshold */
4330 new->entries
[size
- 1].eventfd
= eventfd
;
4331 new->entries
[size
- 1].threshold
= threshold
;
4333 /* Sort thresholds. Registering of new threshold isn't time-critical */
4334 sort(new->entries
, size
, sizeof(*new->entries
),
4335 compare_thresholds
, NULL
);
4337 /* Find current threshold */
4338 new->current_threshold
= -1;
4339 for (i
= 0; i
< size
; i
++) {
4340 if (new->entries
[i
].threshold
<= usage
) {
4342 * new->current_threshold will not be used until
4343 * rcu_assign_pointer(), so it's safe to increment
4346 ++new->current_threshold
;
4351 /* Free old spare buffer and save old primary buffer as spare */
4352 kfree(thresholds
->spare
);
4353 thresholds
->spare
= thresholds
->primary
;
4355 rcu_assign_pointer(thresholds
->primary
, new);
4357 /* To be sure that nobody uses thresholds */
4361 mutex_unlock(&memcg
->thresholds_lock
);
4366 static int mem_cgroup_usage_register_event(struct mem_cgroup
*memcg
,
4367 struct eventfd_ctx
*eventfd
, const char *args
)
4369 return __mem_cgroup_usage_register_event(memcg
, eventfd
, args
, _MEM
);
4372 static int memsw_cgroup_usage_register_event(struct mem_cgroup
*memcg
,
4373 struct eventfd_ctx
*eventfd
, const char *args
)
4375 return __mem_cgroup_usage_register_event(memcg
, eventfd
, args
, _MEMSWAP
);
4378 static void __mem_cgroup_usage_unregister_event(struct mem_cgroup
*memcg
,
4379 struct eventfd_ctx
*eventfd
, enum res_type type
)
4381 struct mem_cgroup_thresholds
*thresholds
;
4382 struct mem_cgroup_threshold_ary
*new;
4383 unsigned long usage
;
4384 int i
, j
, size
, entries
;
4386 mutex_lock(&memcg
->thresholds_lock
);
4389 thresholds
= &memcg
->thresholds
;
4390 usage
= mem_cgroup_usage(memcg
, false);
4391 } else if (type
== _MEMSWAP
) {
4392 thresholds
= &memcg
->memsw_thresholds
;
4393 usage
= mem_cgroup_usage(memcg
, true);
4397 if (!thresholds
->primary
)
4400 /* Check if a threshold crossed before removing */
4401 __mem_cgroup_threshold(memcg
, type
== _MEMSWAP
);
4403 /* Calculate new number of threshold */
4405 for (i
= 0; i
< thresholds
->primary
->size
; i
++) {
4406 if (thresholds
->primary
->entries
[i
].eventfd
!= eventfd
)
4412 new = thresholds
->spare
;
4414 /* If no items related to eventfd have been cleared, nothing to do */
4418 /* Set thresholds array to NULL if we don't have thresholds */
4427 /* Copy thresholds and find current threshold */
4428 new->current_threshold
= -1;
4429 for (i
= 0, j
= 0; i
< thresholds
->primary
->size
; i
++) {
4430 if (thresholds
->primary
->entries
[i
].eventfd
== eventfd
)
4433 new->entries
[j
] = thresholds
->primary
->entries
[i
];
4434 if (new->entries
[j
].threshold
<= usage
) {
4436 * new->current_threshold will not be used
4437 * until rcu_assign_pointer(), so it's safe to increment
4440 ++new->current_threshold
;
4446 /* Swap primary and spare array */
4447 thresholds
->spare
= thresholds
->primary
;
4449 rcu_assign_pointer(thresholds
->primary
, new);
4451 /* To be sure that nobody uses thresholds */
4454 /* If all events are unregistered, free the spare array */
4456 kfree(thresholds
->spare
);
4457 thresholds
->spare
= NULL
;
4460 mutex_unlock(&memcg
->thresholds_lock
);
4463 static void mem_cgroup_usage_unregister_event(struct mem_cgroup
*memcg
,
4464 struct eventfd_ctx
*eventfd
)
4466 return __mem_cgroup_usage_unregister_event(memcg
, eventfd
, _MEM
);
4469 static void memsw_cgroup_usage_unregister_event(struct mem_cgroup
*memcg
,
4470 struct eventfd_ctx
*eventfd
)
4472 return __mem_cgroup_usage_unregister_event(memcg
, eventfd
, _MEMSWAP
);
4475 static int mem_cgroup_oom_register_event(struct mem_cgroup
*memcg
,
4476 struct eventfd_ctx
*eventfd
, const char *args
)
4478 struct mem_cgroup_eventfd_list
*event
;
4480 event
= kmalloc(sizeof(*event
), GFP_KERNEL
);
4484 spin_lock(&memcg_oom_lock
);
4486 event
->eventfd
= eventfd
;
4487 list_add(&event
->list
, &memcg
->oom_notify
);
4489 /* already in OOM ? */
4490 if (memcg
->under_oom
)
4491 eventfd_signal(eventfd
, 1);
4492 spin_unlock(&memcg_oom_lock
);
4497 static void mem_cgroup_oom_unregister_event(struct mem_cgroup
*memcg
,
4498 struct eventfd_ctx
*eventfd
)
4500 struct mem_cgroup_eventfd_list
*ev
, *tmp
;
4502 spin_lock(&memcg_oom_lock
);
4504 list_for_each_entry_safe(ev
, tmp
, &memcg
->oom_notify
, list
) {
4505 if (ev
->eventfd
== eventfd
) {
4506 list_del(&ev
->list
);
4511 spin_unlock(&memcg_oom_lock
);
4514 static int mem_cgroup_oom_control_read(struct seq_file
*sf
, void *v
)
4516 struct mem_cgroup
*memcg
= mem_cgroup_from_seq(sf
);
4518 seq_printf(sf
, "oom_kill_disable %d\n", memcg
->oom_kill_disable
);
4519 seq_printf(sf
, "under_oom %d\n", (bool)memcg
->under_oom
);
4520 seq_printf(sf
, "oom_kill %lu\n",
4521 atomic_long_read(&memcg
->memory_events
[MEMCG_OOM_KILL
]));
4525 static int mem_cgroup_oom_control_write(struct cgroup_subsys_state
*css
,
4526 struct cftype
*cft
, u64 val
)
4528 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
4530 /* cannot set to root cgroup and only 0 and 1 are allowed */
4531 if (!css
->parent
|| !((val
== 0) || (val
== 1)))
4534 memcg
->oom_kill_disable
= val
;
4536 memcg_oom_recover(memcg
);
4541 #ifdef CONFIG_CGROUP_WRITEBACK
4543 #include <trace/events/writeback.h>
4545 static int memcg_wb_domain_init(struct mem_cgroup
*memcg
, gfp_t gfp
)
4547 return wb_domain_init(&memcg
->cgwb_domain
, gfp
);
4550 static void memcg_wb_domain_exit(struct mem_cgroup
*memcg
)
4552 wb_domain_exit(&memcg
->cgwb_domain
);
4555 static void memcg_wb_domain_size_changed(struct mem_cgroup
*memcg
)
4557 wb_domain_size_changed(&memcg
->cgwb_domain
);
4560 struct wb_domain
*mem_cgroup_wb_domain(struct bdi_writeback
*wb
)
4562 struct mem_cgroup
*memcg
= mem_cgroup_from_css(wb
->memcg_css
);
4564 if (!memcg
->css
.parent
)
4567 return &memcg
->cgwb_domain
;
4571 * idx can be of type enum memcg_stat_item or node_stat_item.
4572 * Keep in sync with memcg_exact_page().
4574 static unsigned long memcg_exact_page_state(struct mem_cgroup
*memcg
, int idx
)
4576 long x
= atomic_long_read(&memcg
->vmstats
[idx
]);
4579 for_each_online_cpu(cpu
)
4580 x
+= per_cpu_ptr(memcg
->vmstats_percpu
, cpu
)->stat
[idx
];
4587 * mem_cgroup_wb_stats - retrieve writeback related stats from its memcg
4588 * @wb: bdi_writeback in question
4589 * @pfilepages: out parameter for number of file pages
4590 * @pheadroom: out parameter for number of allocatable pages according to memcg
4591 * @pdirty: out parameter for number of dirty pages
4592 * @pwriteback: out parameter for number of pages under writeback
4594 * Determine the numbers of file, headroom, dirty, and writeback pages in
4595 * @wb's memcg. File, dirty and writeback are self-explanatory. Headroom
4596 * is a bit more involved.
4598 * A memcg's headroom is "min(max, high) - used". In the hierarchy, the
4599 * headroom is calculated as the lowest headroom of itself and the
4600 * ancestors. Note that this doesn't consider the actual amount of
4601 * available memory in the system. The caller should further cap
4602 * *@pheadroom accordingly.
4604 void mem_cgroup_wb_stats(struct bdi_writeback
*wb
, unsigned long *pfilepages
,
4605 unsigned long *pheadroom
, unsigned long *pdirty
,
4606 unsigned long *pwriteback
)
4608 struct mem_cgroup
*memcg
= mem_cgroup_from_css(wb
->memcg_css
);
4609 struct mem_cgroup
*parent
;
4611 *pdirty
= memcg_exact_page_state(memcg
, NR_FILE_DIRTY
);
4613 *pwriteback
= memcg_exact_page_state(memcg
, NR_WRITEBACK
);
4614 *pfilepages
= memcg_exact_page_state(memcg
, NR_INACTIVE_FILE
) +
4615 memcg_exact_page_state(memcg
, NR_ACTIVE_FILE
);
4616 *pheadroom
= PAGE_COUNTER_MAX
;
4618 while ((parent
= parent_mem_cgroup(memcg
))) {
4619 unsigned long ceiling
= min(READ_ONCE(memcg
->memory
.max
),
4620 READ_ONCE(memcg
->memory
.high
));
4621 unsigned long used
= page_counter_read(&memcg
->memory
);
4623 *pheadroom
= min(*pheadroom
, ceiling
- min(ceiling
, used
));
4629 * Foreign dirty flushing
4631 * There's an inherent mismatch between memcg and writeback. The former
4632 * trackes ownership per-page while the latter per-inode. This was a
4633 * deliberate design decision because honoring per-page ownership in the
4634 * writeback path is complicated, may lead to higher CPU and IO overheads
4635 * and deemed unnecessary given that write-sharing an inode across
4636 * different cgroups isn't a common use-case.
4638 * Combined with inode majority-writer ownership switching, this works well
4639 * enough in most cases but there are some pathological cases. For
4640 * example, let's say there are two cgroups A and B which keep writing to
4641 * different but confined parts of the same inode. B owns the inode and
4642 * A's memory is limited far below B's. A's dirty ratio can rise enough to
4643 * trigger balance_dirty_pages() sleeps but B's can be low enough to avoid
4644 * triggering background writeback. A will be slowed down without a way to
4645 * make writeback of the dirty pages happen.
4647 * Conditions like the above can lead to a cgroup getting repatedly and
4648 * severely throttled after making some progress after each
4649 * dirty_expire_interval while the underyling IO device is almost
4652 * Solving this problem completely requires matching the ownership tracking
4653 * granularities between memcg and writeback in either direction. However,
4654 * the more egregious behaviors can be avoided by simply remembering the
4655 * most recent foreign dirtying events and initiating remote flushes on
4656 * them when local writeback isn't enough to keep the memory clean enough.
4658 * The following two functions implement such mechanism. When a foreign
4659 * page - a page whose memcg and writeback ownerships don't match - is
4660 * dirtied, mem_cgroup_track_foreign_dirty() records the inode owning
4661 * bdi_writeback on the page owning memcg. When balance_dirty_pages()
4662 * decides that the memcg needs to sleep due to high dirty ratio, it calls
4663 * mem_cgroup_flush_foreign() which queues writeback on the recorded
4664 * foreign bdi_writebacks which haven't expired. Both the numbers of
4665 * recorded bdi_writebacks and concurrent in-flight foreign writebacks are
4666 * limited to MEMCG_CGWB_FRN_CNT.
4668 * The mechanism only remembers IDs and doesn't hold any object references.
4669 * As being wrong occasionally doesn't matter, updates and accesses to the
4670 * records are lockless and racy.
4672 void mem_cgroup_track_foreign_dirty_slowpath(struct page
*page
,
4673 struct bdi_writeback
*wb
)
4675 struct mem_cgroup
*memcg
= page
->mem_cgroup
;
4676 struct memcg_cgwb_frn
*frn
;
4677 u64 now
= get_jiffies_64();
4678 u64 oldest_at
= now
;
4682 trace_track_foreign_dirty(page
, wb
);
4685 * Pick the slot to use. If there is already a slot for @wb, keep
4686 * using it. If not replace the oldest one which isn't being
4689 for (i
= 0; i
< MEMCG_CGWB_FRN_CNT
; i
++) {
4690 frn
= &memcg
->cgwb_frn
[i
];
4691 if (frn
->bdi_id
== wb
->bdi
->id
&&
4692 frn
->memcg_id
== wb
->memcg_css
->id
)
4694 if (time_before64(frn
->at
, oldest_at
) &&
4695 atomic_read(&frn
->done
.cnt
) == 1) {
4697 oldest_at
= frn
->at
;
4701 if (i
< MEMCG_CGWB_FRN_CNT
) {
4703 * Re-using an existing one. Update timestamp lazily to
4704 * avoid making the cacheline hot. We want them to be
4705 * reasonably up-to-date and significantly shorter than
4706 * dirty_expire_interval as that's what expires the record.
4707 * Use the shorter of 1s and dirty_expire_interval / 8.
4709 unsigned long update_intv
=
4710 min_t(unsigned long, HZ
,
4711 msecs_to_jiffies(dirty_expire_interval
* 10) / 8);
4713 if (time_before64(frn
->at
, now
- update_intv
))
4715 } else if (oldest
>= 0) {
4716 /* replace the oldest free one */
4717 frn
= &memcg
->cgwb_frn
[oldest
];
4718 frn
->bdi_id
= wb
->bdi
->id
;
4719 frn
->memcg_id
= wb
->memcg_css
->id
;
4724 /* issue foreign writeback flushes for recorded foreign dirtying events */
4725 void mem_cgroup_flush_foreign(struct bdi_writeback
*wb
)
4727 struct mem_cgroup
*memcg
= mem_cgroup_from_css(wb
->memcg_css
);
4728 unsigned long intv
= msecs_to_jiffies(dirty_expire_interval
* 10);
4729 u64 now
= jiffies_64
;
4732 for (i
= 0; i
< MEMCG_CGWB_FRN_CNT
; i
++) {
4733 struct memcg_cgwb_frn
*frn
= &memcg
->cgwb_frn
[i
];
4736 * If the record is older than dirty_expire_interval,
4737 * writeback on it has already started. No need to kick it
4738 * off again. Also, don't start a new one if there's
4739 * already one in flight.
4741 if (time_after64(frn
->at
, now
- intv
) &&
4742 atomic_read(&frn
->done
.cnt
) == 1) {
4744 trace_flush_foreign(wb
, frn
->bdi_id
, frn
->memcg_id
);
4745 cgroup_writeback_by_id(frn
->bdi_id
, frn
->memcg_id
, 0,
4746 WB_REASON_FOREIGN_FLUSH
,
4752 #else /* CONFIG_CGROUP_WRITEBACK */
4754 static int memcg_wb_domain_init(struct mem_cgroup
*memcg
, gfp_t gfp
)
4759 static void memcg_wb_domain_exit(struct mem_cgroup
*memcg
)
4763 static void memcg_wb_domain_size_changed(struct mem_cgroup
*memcg
)
4767 #endif /* CONFIG_CGROUP_WRITEBACK */
4770 * DO NOT USE IN NEW FILES.
4772 * "cgroup.event_control" implementation.
4774 * This is way over-engineered. It tries to support fully configurable
4775 * events for each user. Such level of flexibility is completely
4776 * unnecessary especially in the light of the planned unified hierarchy.
4778 * Please deprecate this and replace with something simpler if at all
4783 * Unregister event and free resources.
4785 * Gets called from workqueue.
4787 static void memcg_event_remove(struct work_struct
*work
)
4789 struct mem_cgroup_event
*event
=
4790 container_of(work
, struct mem_cgroup_event
, remove
);
4791 struct mem_cgroup
*memcg
= event
->memcg
;
4793 remove_wait_queue(event
->wqh
, &event
->wait
);
4795 event
->unregister_event(memcg
, event
->eventfd
);
4797 /* Notify userspace the event is going away. */
4798 eventfd_signal(event
->eventfd
, 1);
4800 eventfd_ctx_put(event
->eventfd
);
4802 css_put(&memcg
->css
);
4806 * Gets called on EPOLLHUP on eventfd when user closes it.
4808 * Called with wqh->lock held and interrupts disabled.
4810 static int memcg_event_wake(wait_queue_entry_t
*wait
, unsigned mode
,
4811 int sync
, void *key
)
4813 struct mem_cgroup_event
*event
=
4814 container_of(wait
, struct mem_cgroup_event
, wait
);
4815 struct mem_cgroup
*memcg
= event
->memcg
;
4816 __poll_t flags
= key_to_poll(key
);
4818 if (flags
& EPOLLHUP
) {
4820 * If the event has been detached at cgroup removal, we
4821 * can simply return knowing the other side will cleanup
4824 * We can't race against event freeing since the other
4825 * side will require wqh->lock via remove_wait_queue(),
4828 spin_lock(&memcg
->event_list_lock
);
4829 if (!list_empty(&event
->list
)) {
4830 list_del_init(&event
->list
);
4832 * We are in atomic context, but cgroup_event_remove()
4833 * may sleep, so we have to call it in workqueue.
4835 schedule_work(&event
->remove
);
4837 spin_unlock(&memcg
->event_list_lock
);
4843 static void memcg_event_ptable_queue_proc(struct file
*file
,
4844 wait_queue_head_t
*wqh
, poll_table
*pt
)
4846 struct mem_cgroup_event
*event
=
4847 container_of(pt
, struct mem_cgroup_event
, pt
);
4850 add_wait_queue(wqh
, &event
->wait
);
4854 * DO NOT USE IN NEW FILES.
4856 * Parse input and register new cgroup event handler.
4858 * Input must be in format '<event_fd> <control_fd> <args>'.
4859 * Interpretation of args is defined by control file implementation.
4861 static ssize_t
memcg_write_event_control(struct kernfs_open_file
*of
,
4862 char *buf
, size_t nbytes
, loff_t off
)
4864 struct cgroup_subsys_state
*css
= of_css(of
);
4865 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
4866 struct mem_cgroup_event
*event
;
4867 struct cgroup_subsys_state
*cfile_css
;
4868 unsigned int efd
, cfd
;
4875 buf
= strstrip(buf
);
4877 efd
= simple_strtoul(buf
, &endp
, 10);
4882 cfd
= simple_strtoul(buf
, &endp
, 10);
4883 if ((*endp
!= ' ') && (*endp
!= '\0'))
4887 event
= kzalloc(sizeof(*event
), GFP_KERNEL
);
4891 event
->memcg
= memcg
;
4892 INIT_LIST_HEAD(&event
->list
);
4893 init_poll_funcptr(&event
->pt
, memcg_event_ptable_queue_proc
);
4894 init_waitqueue_func_entry(&event
->wait
, memcg_event_wake
);
4895 INIT_WORK(&event
->remove
, memcg_event_remove
);
4903 event
->eventfd
= eventfd_ctx_fileget(efile
.file
);
4904 if (IS_ERR(event
->eventfd
)) {
4905 ret
= PTR_ERR(event
->eventfd
);
4912 goto out_put_eventfd
;
4915 /* the process need read permission on control file */
4916 /* AV: shouldn't we check that it's been opened for read instead? */
4917 ret
= inode_permission(file_inode(cfile
.file
), MAY_READ
);
4922 * Determine the event callbacks and set them in @event. This used
4923 * to be done via struct cftype but cgroup core no longer knows
4924 * about these events. The following is crude but the whole thing
4925 * is for compatibility anyway.
4927 * DO NOT ADD NEW FILES.
4929 name
= cfile
.file
->f_path
.dentry
->d_name
.name
;
4931 if (!strcmp(name
, "memory.usage_in_bytes")) {
4932 event
->register_event
= mem_cgroup_usage_register_event
;
4933 event
->unregister_event
= mem_cgroup_usage_unregister_event
;
4934 } else if (!strcmp(name
, "memory.oom_control")) {
4935 event
->register_event
= mem_cgroup_oom_register_event
;
4936 event
->unregister_event
= mem_cgroup_oom_unregister_event
;
4937 } else if (!strcmp(name
, "memory.pressure_level")) {
4938 event
->register_event
= vmpressure_register_event
;
4939 event
->unregister_event
= vmpressure_unregister_event
;
4940 } else if (!strcmp(name
, "memory.memsw.usage_in_bytes")) {
4941 event
->register_event
= memsw_cgroup_usage_register_event
;
4942 event
->unregister_event
= memsw_cgroup_usage_unregister_event
;
4949 * Verify @cfile should belong to @css. Also, remaining events are
4950 * automatically removed on cgroup destruction but the removal is
4951 * asynchronous, so take an extra ref on @css.
4953 cfile_css
= css_tryget_online_from_dir(cfile
.file
->f_path
.dentry
->d_parent
,
4954 &memory_cgrp_subsys
);
4956 if (IS_ERR(cfile_css
))
4958 if (cfile_css
!= css
) {
4963 ret
= event
->register_event(memcg
, event
->eventfd
, buf
);
4967 vfs_poll(efile
.file
, &event
->pt
);
4969 spin_lock(&memcg
->event_list_lock
);
4970 list_add(&event
->list
, &memcg
->event_list
);
4971 spin_unlock(&memcg
->event_list_lock
);
4983 eventfd_ctx_put(event
->eventfd
);
4992 static struct cftype mem_cgroup_legacy_files
[] = {
4994 .name
= "usage_in_bytes",
4995 .private = MEMFILE_PRIVATE(_MEM
, RES_USAGE
),
4996 .read_u64
= mem_cgroup_read_u64
,
4999 .name
= "max_usage_in_bytes",
5000 .private = MEMFILE_PRIVATE(_MEM
, RES_MAX_USAGE
),
5001 .write
= mem_cgroup_reset
,
5002 .read_u64
= mem_cgroup_read_u64
,
5005 .name
= "limit_in_bytes",
5006 .private = MEMFILE_PRIVATE(_MEM
, RES_LIMIT
),
5007 .write
= mem_cgroup_write
,
5008 .read_u64
= mem_cgroup_read_u64
,
5011 .name
= "soft_limit_in_bytes",
5012 .private = MEMFILE_PRIVATE(_MEM
, RES_SOFT_LIMIT
),
5013 .write
= mem_cgroup_write
,
5014 .read_u64
= mem_cgroup_read_u64
,
5018 .private = MEMFILE_PRIVATE(_MEM
, RES_FAILCNT
),
5019 .write
= mem_cgroup_reset
,
5020 .read_u64
= mem_cgroup_read_u64
,
5024 .seq_show
= memcg_stat_show
,
5027 .name
= "force_empty",
5028 .write
= mem_cgroup_force_empty_write
,
5031 .name
= "use_hierarchy",
5032 .write_u64
= mem_cgroup_hierarchy_write
,
5033 .read_u64
= mem_cgroup_hierarchy_read
,
5036 .name
= "cgroup.event_control", /* XXX: for compat */
5037 .write
= memcg_write_event_control
,
5038 .flags
= CFTYPE_NO_PREFIX
| CFTYPE_WORLD_WRITABLE
,
5041 .name
= "swappiness",
5042 .read_u64
= mem_cgroup_swappiness_read
,
5043 .write_u64
= mem_cgroup_swappiness_write
,
5046 .name
= "move_charge_at_immigrate",
5047 .read_u64
= mem_cgroup_move_charge_read
,
5048 .write_u64
= mem_cgroup_move_charge_write
,
5051 .name
= "oom_control",
5052 .seq_show
= mem_cgroup_oom_control_read
,
5053 .write_u64
= mem_cgroup_oom_control_write
,
5054 .private = MEMFILE_PRIVATE(_OOM_TYPE
, OOM_CONTROL
),
5057 .name
= "pressure_level",
5061 .name
= "numa_stat",
5062 .seq_show
= memcg_numa_stat_show
,
5066 .name
= "kmem.limit_in_bytes",
5067 .private = MEMFILE_PRIVATE(_KMEM
, RES_LIMIT
),
5068 .write
= mem_cgroup_write
,
5069 .read_u64
= mem_cgroup_read_u64
,
5072 .name
= "kmem.usage_in_bytes",
5073 .private = MEMFILE_PRIVATE(_KMEM
, RES_USAGE
),
5074 .read_u64
= mem_cgroup_read_u64
,
5077 .name
= "kmem.failcnt",
5078 .private = MEMFILE_PRIVATE(_KMEM
, RES_FAILCNT
),
5079 .write
= mem_cgroup_reset
,
5080 .read_u64
= mem_cgroup_read_u64
,
5083 .name
= "kmem.max_usage_in_bytes",
5084 .private = MEMFILE_PRIVATE(_KMEM
, RES_MAX_USAGE
),
5085 .write
= mem_cgroup_reset
,
5086 .read_u64
= mem_cgroup_read_u64
,
5088 #if defined(CONFIG_MEMCG_KMEM) && \
5089 (defined(CONFIG_SLAB) || defined(CONFIG_SLUB_DEBUG))
5091 .name
= "kmem.slabinfo",
5092 .seq_show
= memcg_slab_show
,
5096 .name
= "kmem.tcp.limit_in_bytes",
5097 .private = MEMFILE_PRIVATE(_TCP
, RES_LIMIT
),
5098 .write
= mem_cgroup_write
,
5099 .read_u64
= mem_cgroup_read_u64
,
5102 .name
= "kmem.tcp.usage_in_bytes",
5103 .private = MEMFILE_PRIVATE(_TCP
, RES_USAGE
),
5104 .read_u64
= mem_cgroup_read_u64
,
5107 .name
= "kmem.tcp.failcnt",
5108 .private = MEMFILE_PRIVATE(_TCP
, RES_FAILCNT
),
5109 .write
= mem_cgroup_reset
,
5110 .read_u64
= mem_cgroup_read_u64
,
5113 .name
= "kmem.tcp.max_usage_in_bytes",
5114 .private = MEMFILE_PRIVATE(_TCP
, RES_MAX_USAGE
),
5115 .write
= mem_cgroup_reset
,
5116 .read_u64
= mem_cgroup_read_u64
,
5118 { }, /* terminate */
5122 * Private memory cgroup IDR
5124 * Swap-out records and page cache shadow entries need to store memcg
5125 * references in constrained space, so we maintain an ID space that is
5126 * limited to 16 bit (MEM_CGROUP_ID_MAX), limiting the total number of
5127 * memory-controlled cgroups to 64k.
5129 * However, there usually are many references to the offline CSS after
5130 * the cgroup has been destroyed, such as page cache or reclaimable
5131 * slab objects, that don't need to hang on to the ID. We want to keep
5132 * those dead CSS from occupying IDs, or we might quickly exhaust the
5133 * relatively small ID space and prevent the creation of new cgroups
5134 * even when there are much fewer than 64k cgroups - possibly none.
5136 * Maintain a private 16-bit ID space for memcg, and allow the ID to
5137 * be freed and recycled when it's no longer needed, which is usually
5138 * when the CSS is offlined.
5140 * The only exception to that are records of swapped out tmpfs/shmem
5141 * pages that need to be attributed to live ancestors on swapin. But
5142 * those references are manageable from userspace.
5145 static DEFINE_IDR(mem_cgroup_idr
);
5147 static void mem_cgroup_id_remove(struct mem_cgroup
*memcg
)
5149 if (memcg
->id
.id
> 0) {
5150 idr_remove(&mem_cgroup_idr
, memcg
->id
.id
);
5155 static void __maybe_unused
mem_cgroup_id_get_many(struct mem_cgroup
*memcg
,
5158 refcount_add(n
, &memcg
->id
.ref
);
5161 static void mem_cgroup_id_put_many(struct mem_cgroup
*memcg
, unsigned int n
)
5163 if (refcount_sub_and_test(n
, &memcg
->id
.ref
)) {
5164 mem_cgroup_id_remove(memcg
);
5166 /* Memcg ID pins CSS */
5167 css_put(&memcg
->css
);
5171 static inline void mem_cgroup_id_put(struct mem_cgroup
*memcg
)
5173 mem_cgroup_id_put_many(memcg
, 1);
5177 * mem_cgroup_from_id - look up a memcg from a memcg id
5178 * @id: the memcg id to look up
5180 * Caller must hold rcu_read_lock().
5182 struct mem_cgroup
*mem_cgroup_from_id(unsigned short id
)
5184 WARN_ON_ONCE(!rcu_read_lock_held());
5185 return idr_find(&mem_cgroup_idr
, id
);
5188 static int alloc_mem_cgroup_per_node_info(struct mem_cgroup
*memcg
, int node
)
5190 struct mem_cgroup_per_node
*pn
;
5193 * This routine is called against possible nodes.
5194 * But it's BUG to call kmalloc() against offline node.
5196 * TODO: this routine can waste much memory for nodes which will
5197 * never be onlined. It's better to use memory hotplug callback
5200 if (!node_state(node
, N_NORMAL_MEMORY
))
5202 pn
= kzalloc_node(sizeof(*pn
), GFP_KERNEL
, tmp
);
5206 pn
->lruvec_stat_local
= alloc_percpu_gfp(struct lruvec_stat
,
5207 GFP_KERNEL_ACCOUNT
);
5208 if (!pn
->lruvec_stat_local
) {
5213 pn
->lruvec_stat_cpu
= alloc_percpu_gfp(struct lruvec_stat
,
5214 GFP_KERNEL_ACCOUNT
);
5215 if (!pn
->lruvec_stat_cpu
) {
5216 free_percpu(pn
->lruvec_stat_local
);
5221 lruvec_init(&pn
->lruvec
);
5222 pn
->usage_in_excess
= 0;
5223 pn
->on_tree
= false;
5226 memcg
->nodeinfo
[node
] = pn
;
5230 static void free_mem_cgroup_per_node_info(struct mem_cgroup
*memcg
, int node
)
5232 struct mem_cgroup_per_node
*pn
= memcg
->nodeinfo
[node
];
5237 free_percpu(pn
->lruvec_stat_cpu
);
5238 free_percpu(pn
->lruvec_stat_local
);
5242 static void __mem_cgroup_free(struct mem_cgroup
*memcg
)
5247 free_mem_cgroup_per_node_info(memcg
, node
);
5248 free_percpu(memcg
->vmstats_percpu
);
5249 free_percpu(memcg
->vmstats_local
);
5253 static void mem_cgroup_free(struct mem_cgroup
*memcg
)
5255 memcg_wb_domain_exit(memcg
);
5257 * Flush percpu vmstats and vmevents to guarantee the value correctness
5258 * on parent's and all ancestor levels.
5260 memcg_flush_percpu_vmstats(memcg
);
5261 memcg_flush_percpu_vmevents(memcg
);
5262 __mem_cgroup_free(memcg
);
5265 static struct mem_cgroup
*mem_cgroup_alloc(void)
5267 struct mem_cgroup
*memcg
;
5270 int __maybe_unused i
;
5271 long error
= -ENOMEM
;
5273 size
= sizeof(struct mem_cgroup
);
5274 size
+= nr_node_ids
* sizeof(struct mem_cgroup_per_node
*);
5276 memcg
= kzalloc(size
, GFP_KERNEL
);
5278 return ERR_PTR(error
);
5280 memcg
->id
.id
= idr_alloc(&mem_cgroup_idr
, NULL
,
5281 1, MEM_CGROUP_ID_MAX
,
5283 if (memcg
->id
.id
< 0) {
5284 error
= memcg
->id
.id
;
5288 memcg
->vmstats_local
= alloc_percpu_gfp(struct memcg_vmstats_percpu
,
5289 GFP_KERNEL_ACCOUNT
);
5290 if (!memcg
->vmstats_local
)
5293 memcg
->vmstats_percpu
= alloc_percpu_gfp(struct memcg_vmstats_percpu
,
5294 GFP_KERNEL_ACCOUNT
);
5295 if (!memcg
->vmstats_percpu
)
5299 if (alloc_mem_cgroup_per_node_info(memcg
, node
))
5302 if (memcg_wb_domain_init(memcg
, GFP_KERNEL
))
5305 INIT_WORK(&memcg
->high_work
, high_work_func
);
5306 INIT_LIST_HEAD(&memcg
->oom_notify
);
5307 mutex_init(&memcg
->thresholds_lock
);
5308 spin_lock_init(&memcg
->move_lock
);
5309 vmpressure_init(&memcg
->vmpressure
);
5310 INIT_LIST_HEAD(&memcg
->event_list
);
5311 spin_lock_init(&memcg
->event_list_lock
);
5312 memcg
->socket_pressure
= jiffies
;
5313 #ifdef CONFIG_MEMCG_KMEM
5314 memcg
->kmemcg_id
= -1;
5315 INIT_LIST_HEAD(&memcg
->objcg_list
);
5317 #ifdef CONFIG_CGROUP_WRITEBACK
5318 INIT_LIST_HEAD(&memcg
->cgwb_list
);
5319 for (i
= 0; i
< MEMCG_CGWB_FRN_CNT
; i
++)
5320 memcg
->cgwb_frn
[i
].done
=
5321 __WB_COMPLETION_INIT(&memcg_cgwb_frn_waitq
);
5323 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5324 spin_lock_init(&memcg
->deferred_split_queue
.split_queue_lock
);
5325 INIT_LIST_HEAD(&memcg
->deferred_split_queue
.split_queue
);
5326 memcg
->deferred_split_queue
.split_queue_len
= 0;
5328 idr_replace(&mem_cgroup_idr
, memcg
, memcg
->id
.id
);
5331 mem_cgroup_id_remove(memcg
);
5332 __mem_cgroup_free(memcg
);
5333 return ERR_PTR(error
);
5336 static struct cgroup_subsys_state
* __ref
5337 mem_cgroup_css_alloc(struct cgroup_subsys_state
*parent_css
)
5339 struct mem_cgroup
*parent
= mem_cgroup_from_css(parent_css
);
5340 struct mem_cgroup
*memcg
, *old_memcg
;
5341 long error
= -ENOMEM
;
5343 old_memcg
= set_active_memcg(parent
);
5344 memcg
= mem_cgroup_alloc();
5345 set_active_memcg(old_memcg
);
5347 return ERR_CAST(memcg
);
5349 page_counter_set_high(&memcg
->memory
, PAGE_COUNTER_MAX
);
5350 memcg
->soft_limit
= PAGE_COUNTER_MAX
;
5351 page_counter_set_high(&memcg
->swap
, PAGE_COUNTER_MAX
);
5353 memcg
->swappiness
= mem_cgroup_swappiness(parent
);
5354 memcg
->oom_kill_disable
= parent
->oom_kill_disable
;
5357 page_counter_init(&memcg
->memory
, NULL
);
5358 page_counter_init(&memcg
->swap
, NULL
);
5359 page_counter_init(&memcg
->kmem
, NULL
);
5360 page_counter_init(&memcg
->tcpmem
, NULL
);
5361 } else if (parent
->use_hierarchy
) {
5362 memcg
->use_hierarchy
= true;
5363 page_counter_init(&memcg
->memory
, &parent
->memory
);
5364 page_counter_init(&memcg
->swap
, &parent
->swap
);
5365 page_counter_init(&memcg
->kmem
, &parent
->kmem
);
5366 page_counter_init(&memcg
->tcpmem
, &parent
->tcpmem
);
5368 page_counter_init(&memcg
->memory
, &root_mem_cgroup
->memory
);
5369 page_counter_init(&memcg
->swap
, &root_mem_cgroup
->swap
);
5370 page_counter_init(&memcg
->kmem
, &root_mem_cgroup
->kmem
);
5371 page_counter_init(&memcg
->tcpmem
, &root_mem_cgroup
->tcpmem
);
5373 * Deeper hierachy with use_hierarchy == false doesn't make
5374 * much sense so let cgroup subsystem know about this
5375 * unfortunate state in our controller.
5377 if (parent
!= root_mem_cgroup
)
5378 memory_cgrp_subsys
.broken_hierarchy
= true;
5381 /* The following stuff does not apply to the root */
5383 root_mem_cgroup
= memcg
;
5387 error
= memcg_online_kmem(memcg
);
5391 if (cgroup_subsys_on_dfl(memory_cgrp_subsys
) && !cgroup_memory_nosocket
)
5392 static_branch_inc(&memcg_sockets_enabled_key
);
5396 mem_cgroup_id_remove(memcg
);
5397 mem_cgroup_free(memcg
);
5398 return ERR_PTR(error
);
5401 static int mem_cgroup_css_online(struct cgroup_subsys_state
*css
)
5403 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
5406 * A memcg must be visible for memcg_expand_shrinker_maps()
5407 * by the time the maps are allocated. So, we allocate maps
5408 * here, when for_each_mem_cgroup() can't skip it.
5410 if (memcg_alloc_shrinker_maps(memcg
)) {
5411 mem_cgroup_id_remove(memcg
);
5415 /* Online state pins memcg ID, memcg ID pins CSS */
5416 refcount_set(&memcg
->id
.ref
, 1);
5421 static void mem_cgroup_css_offline(struct cgroup_subsys_state
*css
)
5423 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
5424 struct mem_cgroup_event
*event
, *tmp
;
5427 * Unregister events and notify userspace.
5428 * Notify userspace about cgroup removing only after rmdir of cgroup
5429 * directory to avoid race between userspace and kernelspace.
5431 spin_lock(&memcg
->event_list_lock
);
5432 list_for_each_entry_safe(event
, tmp
, &memcg
->event_list
, list
) {
5433 list_del_init(&event
->list
);
5434 schedule_work(&event
->remove
);
5436 spin_unlock(&memcg
->event_list_lock
);
5438 page_counter_set_min(&memcg
->memory
, 0);
5439 page_counter_set_low(&memcg
->memory
, 0);
5441 memcg_offline_kmem(memcg
);
5442 wb_memcg_offline(memcg
);
5444 drain_all_stock(memcg
);
5446 mem_cgroup_id_put(memcg
);
5449 static void mem_cgroup_css_released(struct cgroup_subsys_state
*css
)
5451 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
5453 invalidate_reclaim_iterators(memcg
);
5456 static void mem_cgroup_css_free(struct cgroup_subsys_state
*css
)
5458 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
5459 int __maybe_unused i
;
5461 #ifdef CONFIG_CGROUP_WRITEBACK
5462 for (i
= 0; i
< MEMCG_CGWB_FRN_CNT
; i
++)
5463 wb_wait_for_completion(&memcg
->cgwb_frn
[i
].done
);
5465 if (cgroup_subsys_on_dfl(memory_cgrp_subsys
) && !cgroup_memory_nosocket
)
5466 static_branch_dec(&memcg_sockets_enabled_key
);
5468 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys
) && memcg
->tcpmem_active
)
5469 static_branch_dec(&memcg_sockets_enabled_key
);
5471 vmpressure_cleanup(&memcg
->vmpressure
);
5472 cancel_work_sync(&memcg
->high_work
);
5473 mem_cgroup_remove_from_trees(memcg
);
5474 memcg_free_shrinker_maps(memcg
);
5475 memcg_free_kmem(memcg
);
5476 mem_cgroup_free(memcg
);
5480 * mem_cgroup_css_reset - reset the states of a mem_cgroup
5481 * @css: the target css
5483 * Reset the states of the mem_cgroup associated with @css. This is
5484 * invoked when the userland requests disabling on the default hierarchy
5485 * but the memcg is pinned through dependency. The memcg should stop
5486 * applying policies and should revert to the vanilla state as it may be
5487 * made visible again.
5489 * The current implementation only resets the essential configurations.
5490 * This needs to be expanded to cover all the visible parts.
5492 static void mem_cgroup_css_reset(struct cgroup_subsys_state
*css
)
5494 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
5496 page_counter_set_max(&memcg
->memory
, PAGE_COUNTER_MAX
);
5497 page_counter_set_max(&memcg
->swap
, PAGE_COUNTER_MAX
);
5498 page_counter_set_max(&memcg
->kmem
, PAGE_COUNTER_MAX
);
5499 page_counter_set_max(&memcg
->tcpmem
, PAGE_COUNTER_MAX
);
5500 page_counter_set_min(&memcg
->memory
, 0);
5501 page_counter_set_low(&memcg
->memory
, 0);
5502 page_counter_set_high(&memcg
->memory
, PAGE_COUNTER_MAX
);
5503 memcg
->soft_limit
= PAGE_COUNTER_MAX
;
5504 page_counter_set_high(&memcg
->swap
, PAGE_COUNTER_MAX
);
5505 memcg_wb_domain_size_changed(memcg
);
5509 /* Handlers for move charge at task migration. */
5510 static int mem_cgroup_do_precharge(unsigned long count
)
5514 /* Try a single bulk charge without reclaim first, kswapd may wake */
5515 ret
= try_charge(mc
.to
, GFP_KERNEL
& ~__GFP_DIRECT_RECLAIM
, count
);
5517 mc
.precharge
+= count
;
5521 /* Try charges one by one with reclaim, but do not retry */
5523 ret
= try_charge(mc
.to
, GFP_KERNEL
| __GFP_NORETRY
, 1);
5537 enum mc_target_type
{
5544 static struct page
*mc_handle_present_pte(struct vm_area_struct
*vma
,
5545 unsigned long addr
, pte_t ptent
)
5547 struct page
*page
= vm_normal_page(vma
, addr
, ptent
);
5549 if (!page
|| !page_mapped(page
))
5551 if (PageAnon(page
)) {
5552 if (!(mc
.flags
& MOVE_ANON
))
5555 if (!(mc
.flags
& MOVE_FILE
))
5558 if (!get_page_unless_zero(page
))
5564 #if defined(CONFIG_SWAP) || defined(CONFIG_DEVICE_PRIVATE)
5565 static struct page
*mc_handle_swap_pte(struct vm_area_struct
*vma
,
5566 pte_t ptent
, swp_entry_t
*entry
)
5568 struct page
*page
= NULL
;
5569 swp_entry_t ent
= pte_to_swp_entry(ptent
);
5571 if (!(mc
.flags
& MOVE_ANON
))
5575 * Handle MEMORY_DEVICE_PRIVATE which are ZONE_DEVICE page belonging to
5576 * a device and because they are not accessible by CPU they are store
5577 * as special swap entry in the CPU page table.
5579 if (is_device_private_entry(ent
)) {
5580 page
= device_private_entry_to_page(ent
);
5582 * MEMORY_DEVICE_PRIVATE means ZONE_DEVICE page and which have
5583 * a refcount of 1 when free (unlike normal page)
5585 if (!page_ref_add_unless(page
, 1, 1))
5590 if (non_swap_entry(ent
))
5594 * Because lookup_swap_cache() updates some statistics counter,
5595 * we call find_get_page() with swapper_space directly.
5597 page
= find_get_page(swap_address_space(ent
), swp_offset(ent
));
5598 entry
->val
= ent
.val
;
5603 static struct page
*mc_handle_swap_pte(struct vm_area_struct
*vma
,
5604 pte_t ptent
, swp_entry_t
*entry
)
5610 static struct page
*mc_handle_file_pte(struct vm_area_struct
*vma
,
5611 unsigned long addr
, pte_t ptent
, swp_entry_t
*entry
)
5613 if (!vma
->vm_file
) /* anonymous vma */
5615 if (!(mc
.flags
& MOVE_FILE
))
5618 /* page is moved even if it's not RSS of this task(page-faulted). */
5619 /* shmem/tmpfs may report page out on swap: account for that too. */
5620 return find_get_incore_page(vma
->vm_file
->f_mapping
,
5621 linear_page_index(vma
, addr
));
5625 * mem_cgroup_move_account - move account of the page
5627 * @compound: charge the page as compound or small page
5628 * @from: mem_cgroup which the page is moved from.
5629 * @to: mem_cgroup which the page is moved to. @from != @to.
5631 * The caller must make sure the page is not on LRU (isolate_page() is useful.)
5633 * This function doesn't do "charge" to new cgroup and doesn't do "uncharge"
5636 static int mem_cgroup_move_account(struct page
*page
,
5638 struct mem_cgroup
*from
,
5639 struct mem_cgroup
*to
)
5641 struct lruvec
*from_vec
, *to_vec
;
5642 struct pglist_data
*pgdat
;
5643 unsigned int nr_pages
= compound
? thp_nr_pages(page
) : 1;
5646 VM_BUG_ON(from
== to
);
5647 VM_BUG_ON_PAGE(PageLRU(page
), page
);
5648 VM_BUG_ON(compound
&& !PageTransHuge(page
));
5651 * Prevent mem_cgroup_migrate() from looking at
5652 * page->mem_cgroup of its source page while we change it.
5655 if (!trylock_page(page
))
5659 if (page
->mem_cgroup
!= from
)
5662 pgdat
= page_pgdat(page
);
5663 from_vec
= mem_cgroup_lruvec(from
, pgdat
);
5664 to_vec
= mem_cgroup_lruvec(to
, pgdat
);
5666 lock_page_memcg(page
);
5668 if (PageAnon(page
)) {
5669 if (page_mapped(page
)) {
5670 __mod_lruvec_state(from_vec
, NR_ANON_MAPPED
, -nr_pages
);
5671 __mod_lruvec_state(to_vec
, NR_ANON_MAPPED
, nr_pages
);
5672 if (PageTransHuge(page
)) {
5673 __mod_lruvec_state(from_vec
, NR_ANON_THPS
,
5675 __mod_lruvec_state(to_vec
, NR_ANON_THPS
,
5681 __mod_lruvec_state(from_vec
, NR_FILE_PAGES
, -nr_pages
);
5682 __mod_lruvec_state(to_vec
, NR_FILE_PAGES
, nr_pages
);
5684 if (PageSwapBacked(page
)) {
5685 __mod_lruvec_state(from_vec
, NR_SHMEM
, -nr_pages
);
5686 __mod_lruvec_state(to_vec
, NR_SHMEM
, nr_pages
);
5689 if (page_mapped(page
)) {
5690 __mod_lruvec_state(from_vec
, NR_FILE_MAPPED
, -nr_pages
);
5691 __mod_lruvec_state(to_vec
, NR_FILE_MAPPED
, nr_pages
);
5694 if (PageDirty(page
)) {
5695 struct address_space
*mapping
= page_mapping(page
);
5697 if (mapping_can_writeback(mapping
)) {
5698 __mod_lruvec_state(from_vec
, NR_FILE_DIRTY
,
5700 __mod_lruvec_state(to_vec
, NR_FILE_DIRTY
,
5706 if (PageWriteback(page
)) {
5707 __mod_lruvec_state(from_vec
, NR_WRITEBACK
, -nr_pages
);
5708 __mod_lruvec_state(to_vec
, NR_WRITEBACK
, nr_pages
);
5712 * All state has been migrated, let's switch to the new memcg.
5714 * It is safe to change page->mem_cgroup here because the page
5715 * is referenced, charged, isolated, and locked: we can't race
5716 * with (un)charging, migration, LRU putback, or anything else
5717 * that would rely on a stable page->mem_cgroup.
5719 * Note that lock_page_memcg is a memcg lock, not a page lock,
5720 * to save space. As soon as we switch page->mem_cgroup to a
5721 * new memcg that isn't locked, the above state can change
5722 * concurrently again. Make sure we're truly done with it.
5727 css_put(&from
->css
);
5729 page
->mem_cgroup
= to
;
5731 __unlock_page_memcg(from
);
5735 local_irq_disable();
5736 mem_cgroup_charge_statistics(to
, page
, nr_pages
);
5737 memcg_check_events(to
, page
);
5738 mem_cgroup_charge_statistics(from
, page
, -nr_pages
);
5739 memcg_check_events(from
, page
);
5748 * get_mctgt_type - get target type of moving charge
5749 * @vma: the vma the pte to be checked belongs
5750 * @addr: the address corresponding to the pte to be checked
5751 * @ptent: the pte to be checked
5752 * @target: the pointer the target page or swap ent will be stored(can be NULL)
5755 * 0(MC_TARGET_NONE): if the pte is not a target for move charge.
5756 * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for
5757 * move charge. if @target is not NULL, the page is stored in target->page
5758 * with extra refcnt got(Callers should handle it).
5759 * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a
5760 * target for charge migration. if @target is not NULL, the entry is stored
5762 * 3(MC_TARGET_DEVICE): like MC_TARGET_PAGE but page is MEMORY_DEVICE_PRIVATE
5763 * (so ZONE_DEVICE page and thus not on the lru).
5764 * For now we such page is charge like a regular page would be as for all
5765 * intent and purposes it is just special memory taking the place of a
5768 * See Documentations/vm/hmm.txt and include/linux/hmm.h
5770 * Called with pte lock held.
5773 static enum mc_target_type
get_mctgt_type(struct vm_area_struct
*vma
,
5774 unsigned long addr
, pte_t ptent
, union mc_target
*target
)
5776 struct page
*page
= NULL
;
5777 enum mc_target_type ret
= MC_TARGET_NONE
;
5778 swp_entry_t ent
= { .val
= 0 };
5780 if (pte_present(ptent
))
5781 page
= mc_handle_present_pte(vma
, addr
, ptent
);
5782 else if (is_swap_pte(ptent
))
5783 page
= mc_handle_swap_pte(vma
, ptent
, &ent
);
5784 else if (pte_none(ptent
))
5785 page
= mc_handle_file_pte(vma
, addr
, ptent
, &ent
);
5787 if (!page
&& !ent
.val
)
5791 * Do only loose check w/o serialization.
5792 * mem_cgroup_move_account() checks the page is valid or
5793 * not under LRU exclusion.
5795 if (page
->mem_cgroup
== mc
.from
) {
5796 ret
= MC_TARGET_PAGE
;
5797 if (is_device_private_page(page
))
5798 ret
= MC_TARGET_DEVICE
;
5800 target
->page
= page
;
5802 if (!ret
|| !target
)
5806 * There is a swap entry and a page doesn't exist or isn't charged.
5807 * But we cannot move a tail-page in a THP.
5809 if (ent
.val
&& !ret
&& (!page
|| !PageTransCompound(page
)) &&
5810 mem_cgroup_id(mc
.from
) == lookup_swap_cgroup_id(ent
)) {
5811 ret
= MC_TARGET_SWAP
;
5818 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5820 * We don't consider PMD mapped swapping or file mapped pages because THP does
5821 * not support them for now.
5822 * Caller should make sure that pmd_trans_huge(pmd) is true.
5824 static enum mc_target_type
get_mctgt_type_thp(struct vm_area_struct
*vma
,
5825 unsigned long addr
, pmd_t pmd
, union mc_target
*target
)
5827 struct page
*page
= NULL
;
5828 enum mc_target_type ret
= MC_TARGET_NONE
;
5830 if (unlikely(is_swap_pmd(pmd
))) {
5831 VM_BUG_ON(thp_migration_supported() &&
5832 !is_pmd_migration_entry(pmd
));
5835 page
= pmd_page(pmd
);
5836 VM_BUG_ON_PAGE(!page
|| !PageHead(page
), page
);
5837 if (!(mc
.flags
& MOVE_ANON
))
5839 if (page
->mem_cgroup
== mc
.from
) {
5840 ret
= MC_TARGET_PAGE
;
5843 target
->page
= page
;
5849 static inline enum mc_target_type
get_mctgt_type_thp(struct vm_area_struct
*vma
,
5850 unsigned long addr
, pmd_t pmd
, union mc_target
*target
)
5852 return MC_TARGET_NONE
;
5856 static int mem_cgroup_count_precharge_pte_range(pmd_t
*pmd
,
5857 unsigned long addr
, unsigned long end
,
5858 struct mm_walk
*walk
)
5860 struct vm_area_struct
*vma
= walk
->vma
;
5864 ptl
= pmd_trans_huge_lock(pmd
, vma
);
5867 * Note their can not be MC_TARGET_DEVICE for now as we do not
5868 * support transparent huge page with MEMORY_DEVICE_PRIVATE but
5869 * this might change.
5871 if (get_mctgt_type_thp(vma
, addr
, *pmd
, NULL
) == MC_TARGET_PAGE
)
5872 mc
.precharge
+= HPAGE_PMD_NR
;
5877 if (pmd_trans_unstable(pmd
))
5879 pte
= pte_offset_map_lock(vma
->vm_mm
, pmd
, addr
, &ptl
);
5880 for (; addr
!= end
; pte
++, addr
+= PAGE_SIZE
)
5881 if (get_mctgt_type(vma
, addr
, *pte
, NULL
))
5882 mc
.precharge
++; /* increment precharge temporarily */
5883 pte_unmap_unlock(pte
- 1, ptl
);
5889 static const struct mm_walk_ops precharge_walk_ops
= {
5890 .pmd_entry
= mem_cgroup_count_precharge_pte_range
,
5893 static unsigned long mem_cgroup_count_precharge(struct mm_struct
*mm
)
5895 unsigned long precharge
;
5898 walk_page_range(mm
, 0, mm
->highest_vm_end
, &precharge_walk_ops
, NULL
);
5899 mmap_read_unlock(mm
);
5901 precharge
= mc
.precharge
;
5907 static int mem_cgroup_precharge_mc(struct mm_struct
*mm
)
5909 unsigned long precharge
= mem_cgroup_count_precharge(mm
);
5911 VM_BUG_ON(mc
.moving_task
);
5912 mc
.moving_task
= current
;
5913 return mem_cgroup_do_precharge(precharge
);
5916 /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */
5917 static void __mem_cgroup_clear_mc(void)
5919 struct mem_cgroup
*from
= mc
.from
;
5920 struct mem_cgroup
*to
= mc
.to
;
5922 /* we must uncharge all the leftover precharges from mc.to */
5924 cancel_charge(mc
.to
, mc
.precharge
);
5928 * we didn't uncharge from mc.from at mem_cgroup_move_account(), so
5929 * we must uncharge here.
5931 if (mc
.moved_charge
) {
5932 cancel_charge(mc
.from
, mc
.moved_charge
);
5933 mc
.moved_charge
= 0;
5935 /* we must fixup refcnts and charges */
5936 if (mc
.moved_swap
) {
5937 /* uncharge swap account from the old cgroup */
5938 if (!mem_cgroup_is_root(mc
.from
))
5939 page_counter_uncharge(&mc
.from
->memsw
, mc
.moved_swap
);
5941 mem_cgroup_id_put_many(mc
.from
, mc
.moved_swap
);
5944 * we charged both to->memory and to->memsw, so we
5945 * should uncharge to->memory.
5947 if (!mem_cgroup_is_root(mc
.to
))
5948 page_counter_uncharge(&mc
.to
->memory
, mc
.moved_swap
);
5952 memcg_oom_recover(from
);
5953 memcg_oom_recover(to
);
5954 wake_up_all(&mc
.waitq
);
5957 static void mem_cgroup_clear_mc(void)
5959 struct mm_struct
*mm
= mc
.mm
;
5962 * we must clear moving_task before waking up waiters at the end of
5965 mc
.moving_task
= NULL
;
5966 __mem_cgroup_clear_mc();
5967 spin_lock(&mc
.lock
);
5971 spin_unlock(&mc
.lock
);
5976 static int mem_cgroup_can_attach(struct cgroup_taskset
*tset
)
5978 struct cgroup_subsys_state
*css
;
5979 struct mem_cgroup
*memcg
= NULL
; /* unneeded init to make gcc happy */
5980 struct mem_cgroup
*from
;
5981 struct task_struct
*leader
, *p
;
5982 struct mm_struct
*mm
;
5983 unsigned long move_flags
;
5986 /* charge immigration isn't supported on the default hierarchy */
5987 if (cgroup_subsys_on_dfl(memory_cgrp_subsys
))
5991 * Multi-process migrations only happen on the default hierarchy
5992 * where charge immigration is not used. Perform charge
5993 * immigration if @tset contains a leader and whine if there are
5997 cgroup_taskset_for_each_leader(leader
, css
, tset
) {
6000 memcg
= mem_cgroup_from_css(css
);
6006 * We are now commited to this value whatever it is. Changes in this
6007 * tunable will only affect upcoming migrations, not the current one.
6008 * So we need to save it, and keep it going.
6010 move_flags
= READ_ONCE(memcg
->move_charge_at_immigrate
);
6014 from
= mem_cgroup_from_task(p
);
6016 VM_BUG_ON(from
== memcg
);
6018 mm
= get_task_mm(p
);
6021 /* We move charges only when we move a owner of the mm */
6022 if (mm
->owner
== p
) {
6025 VM_BUG_ON(mc
.precharge
);
6026 VM_BUG_ON(mc
.moved_charge
);
6027 VM_BUG_ON(mc
.moved_swap
);
6029 spin_lock(&mc
.lock
);
6033 mc
.flags
= move_flags
;
6034 spin_unlock(&mc
.lock
);
6035 /* We set mc.moving_task later */
6037 ret
= mem_cgroup_precharge_mc(mm
);
6039 mem_cgroup_clear_mc();
6046 static void mem_cgroup_cancel_attach(struct cgroup_taskset
*tset
)
6049 mem_cgroup_clear_mc();
6052 static int mem_cgroup_move_charge_pte_range(pmd_t
*pmd
,
6053 unsigned long addr
, unsigned long end
,
6054 struct mm_walk
*walk
)
6057 struct vm_area_struct
*vma
= walk
->vma
;
6060 enum mc_target_type target_type
;
6061 union mc_target target
;
6064 ptl
= pmd_trans_huge_lock(pmd
, vma
);
6066 if (mc
.precharge
< HPAGE_PMD_NR
) {
6070 target_type
= get_mctgt_type_thp(vma
, addr
, *pmd
, &target
);
6071 if (target_type
== MC_TARGET_PAGE
) {
6073 if (!isolate_lru_page(page
)) {
6074 if (!mem_cgroup_move_account(page
, true,
6076 mc
.precharge
-= HPAGE_PMD_NR
;
6077 mc
.moved_charge
+= HPAGE_PMD_NR
;
6079 putback_lru_page(page
);
6082 } else if (target_type
== MC_TARGET_DEVICE
) {
6084 if (!mem_cgroup_move_account(page
, true,
6086 mc
.precharge
-= HPAGE_PMD_NR
;
6087 mc
.moved_charge
+= HPAGE_PMD_NR
;
6095 if (pmd_trans_unstable(pmd
))
6098 pte
= pte_offset_map_lock(vma
->vm_mm
, pmd
, addr
, &ptl
);
6099 for (; addr
!= end
; addr
+= PAGE_SIZE
) {
6100 pte_t ptent
= *(pte
++);
6101 bool device
= false;
6107 switch (get_mctgt_type(vma
, addr
, ptent
, &target
)) {
6108 case MC_TARGET_DEVICE
:
6111 case MC_TARGET_PAGE
:
6114 * We can have a part of the split pmd here. Moving it
6115 * can be done but it would be too convoluted so simply
6116 * ignore such a partial THP and keep it in original
6117 * memcg. There should be somebody mapping the head.
6119 if (PageTransCompound(page
))
6121 if (!device
&& isolate_lru_page(page
))
6123 if (!mem_cgroup_move_account(page
, false,
6126 /* we uncharge from mc.from later. */
6130 putback_lru_page(page
);
6131 put
: /* get_mctgt_type() gets the page */
6134 case MC_TARGET_SWAP
:
6136 if (!mem_cgroup_move_swap_account(ent
, mc
.from
, mc
.to
)) {
6138 mem_cgroup_id_get_many(mc
.to
, 1);
6139 /* we fixup other refcnts and charges later. */
6147 pte_unmap_unlock(pte
- 1, ptl
);
6152 * We have consumed all precharges we got in can_attach().
6153 * We try charge one by one, but don't do any additional
6154 * charges to mc.to if we have failed in charge once in attach()
6157 ret
= mem_cgroup_do_precharge(1);
6165 static const struct mm_walk_ops charge_walk_ops
= {
6166 .pmd_entry
= mem_cgroup_move_charge_pte_range
,
6169 static void mem_cgroup_move_charge(void)
6171 lru_add_drain_all();
6173 * Signal lock_page_memcg() to take the memcg's move_lock
6174 * while we're moving its pages to another memcg. Then wait
6175 * for already started RCU-only updates to finish.
6177 atomic_inc(&mc
.from
->moving_account
);
6180 if (unlikely(!mmap_read_trylock(mc
.mm
))) {
6182 * Someone who are holding the mmap_lock might be waiting in
6183 * waitq. So we cancel all extra charges, wake up all waiters,
6184 * and retry. Because we cancel precharges, we might not be able
6185 * to move enough charges, but moving charge is a best-effort
6186 * feature anyway, so it wouldn't be a big problem.
6188 __mem_cgroup_clear_mc();
6193 * When we have consumed all precharges and failed in doing
6194 * additional charge, the page walk just aborts.
6196 walk_page_range(mc
.mm
, 0, mc
.mm
->highest_vm_end
, &charge_walk_ops
,
6199 mmap_read_unlock(mc
.mm
);
6200 atomic_dec(&mc
.from
->moving_account
);
6203 static void mem_cgroup_move_task(void)
6206 mem_cgroup_move_charge();
6207 mem_cgroup_clear_mc();
6210 #else /* !CONFIG_MMU */
6211 static int mem_cgroup_can_attach(struct cgroup_taskset
*tset
)
6215 static void mem_cgroup_cancel_attach(struct cgroup_taskset
*tset
)
6218 static void mem_cgroup_move_task(void)
6224 * Cgroup retains root cgroups across [un]mount cycles making it necessary
6225 * to verify whether we're attached to the default hierarchy on each mount
6228 static void mem_cgroup_bind(struct cgroup_subsys_state
*root_css
)
6231 * use_hierarchy is forced on the default hierarchy. cgroup core
6232 * guarantees that @root doesn't have any children, so turning it
6233 * on for the root memcg is enough.
6235 if (cgroup_subsys_on_dfl(memory_cgrp_subsys
))
6236 root_mem_cgroup
->use_hierarchy
= true;
6238 root_mem_cgroup
->use_hierarchy
= false;
6241 static int seq_puts_memcg_tunable(struct seq_file
*m
, unsigned long value
)
6243 if (value
== PAGE_COUNTER_MAX
)
6244 seq_puts(m
, "max\n");
6246 seq_printf(m
, "%llu\n", (u64
)value
* PAGE_SIZE
);
6251 static u64
memory_current_read(struct cgroup_subsys_state
*css
,
6254 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
6256 return (u64
)page_counter_read(&memcg
->memory
) * PAGE_SIZE
;
6259 static int memory_min_show(struct seq_file
*m
, void *v
)
6261 return seq_puts_memcg_tunable(m
,
6262 READ_ONCE(mem_cgroup_from_seq(m
)->memory
.min
));
6265 static ssize_t
memory_min_write(struct kernfs_open_file
*of
,
6266 char *buf
, size_t nbytes
, loff_t off
)
6268 struct mem_cgroup
*memcg
= mem_cgroup_from_css(of_css(of
));
6272 buf
= strstrip(buf
);
6273 err
= page_counter_memparse(buf
, "max", &min
);
6277 page_counter_set_min(&memcg
->memory
, min
);
6282 static int memory_low_show(struct seq_file
*m
, void *v
)
6284 return seq_puts_memcg_tunable(m
,
6285 READ_ONCE(mem_cgroup_from_seq(m
)->memory
.low
));
6288 static ssize_t
memory_low_write(struct kernfs_open_file
*of
,
6289 char *buf
, size_t nbytes
, loff_t off
)
6291 struct mem_cgroup
*memcg
= mem_cgroup_from_css(of_css(of
));
6295 buf
= strstrip(buf
);
6296 err
= page_counter_memparse(buf
, "max", &low
);
6300 page_counter_set_low(&memcg
->memory
, low
);
6305 static int memory_high_show(struct seq_file
*m
, void *v
)
6307 return seq_puts_memcg_tunable(m
,
6308 READ_ONCE(mem_cgroup_from_seq(m
)->memory
.high
));
6311 static ssize_t
memory_high_write(struct kernfs_open_file
*of
,
6312 char *buf
, size_t nbytes
, loff_t off
)
6314 struct mem_cgroup
*memcg
= mem_cgroup_from_css(of_css(of
));
6315 unsigned int nr_retries
= MAX_RECLAIM_RETRIES
;
6316 bool drained
= false;
6320 buf
= strstrip(buf
);
6321 err
= page_counter_memparse(buf
, "max", &high
);
6326 unsigned long nr_pages
= page_counter_read(&memcg
->memory
);
6327 unsigned long reclaimed
;
6329 if (nr_pages
<= high
)
6332 if (signal_pending(current
))
6336 drain_all_stock(memcg
);
6341 reclaimed
= try_to_free_mem_cgroup_pages(memcg
, nr_pages
- high
,
6344 if (!reclaimed
&& !nr_retries
--)
6348 page_counter_set_high(&memcg
->memory
, high
);
6350 memcg_wb_domain_size_changed(memcg
);
6355 static int memory_max_show(struct seq_file
*m
, void *v
)
6357 return seq_puts_memcg_tunable(m
,
6358 READ_ONCE(mem_cgroup_from_seq(m
)->memory
.max
));
6361 static ssize_t
memory_max_write(struct kernfs_open_file
*of
,
6362 char *buf
, size_t nbytes
, loff_t off
)
6364 struct mem_cgroup
*memcg
= mem_cgroup_from_css(of_css(of
));
6365 unsigned int nr_reclaims
= MAX_RECLAIM_RETRIES
;
6366 bool drained
= false;
6370 buf
= strstrip(buf
);
6371 err
= page_counter_memparse(buf
, "max", &max
);
6375 xchg(&memcg
->memory
.max
, max
);
6378 unsigned long nr_pages
= page_counter_read(&memcg
->memory
);
6380 if (nr_pages
<= max
)
6383 if (signal_pending(current
))
6387 drain_all_stock(memcg
);
6393 if (!try_to_free_mem_cgroup_pages(memcg
, nr_pages
- max
,
6399 memcg_memory_event(memcg
, MEMCG_OOM
);
6400 if (!mem_cgroup_out_of_memory(memcg
, GFP_KERNEL
, 0))
6404 memcg_wb_domain_size_changed(memcg
);
6408 static void __memory_events_show(struct seq_file
*m
, atomic_long_t
*events
)
6410 seq_printf(m
, "low %lu\n", atomic_long_read(&events
[MEMCG_LOW
]));
6411 seq_printf(m
, "high %lu\n", atomic_long_read(&events
[MEMCG_HIGH
]));
6412 seq_printf(m
, "max %lu\n", atomic_long_read(&events
[MEMCG_MAX
]));
6413 seq_printf(m
, "oom %lu\n", atomic_long_read(&events
[MEMCG_OOM
]));
6414 seq_printf(m
, "oom_kill %lu\n",
6415 atomic_long_read(&events
[MEMCG_OOM_KILL
]));
6418 static int memory_events_show(struct seq_file
*m
, void *v
)
6420 struct mem_cgroup
*memcg
= mem_cgroup_from_seq(m
);
6422 __memory_events_show(m
, memcg
->memory_events
);
6426 static int memory_events_local_show(struct seq_file
*m
, void *v
)
6428 struct mem_cgroup
*memcg
= mem_cgroup_from_seq(m
);
6430 __memory_events_show(m
, memcg
->memory_events_local
);
6434 static int memory_stat_show(struct seq_file
*m
, void *v
)
6436 struct mem_cgroup
*memcg
= mem_cgroup_from_seq(m
);
6439 buf
= memory_stat_format(memcg
);
6448 static int memory_numa_stat_show(struct seq_file
*m
, void *v
)
6451 struct mem_cgroup
*memcg
= mem_cgroup_from_seq(m
);
6453 for (i
= 0; i
< ARRAY_SIZE(memory_stats
); i
++) {
6456 if (memory_stats
[i
].idx
>= NR_VM_NODE_STAT_ITEMS
)
6459 seq_printf(m
, "%s", memory_stats
[i
].name
);
6460 for_each_node_state(nid
, N_MEMORY
) {
6462 struct lruvec
*lruvec
;
6464 lruvec
= mem_cgroup_lruvec(memcg
, NODE_DATA(nid
));
6465 size
= lruvec_page_state(lruvec
, memory_stats
[i
].idx
);
6466 size
*= memory_stats
[i
].ratio
;
6467 seq_printf(m
, " N%d=%llu", nid
, size
);
6476 static int memory_oom_group_show(struct seq_file
*m
, void *v
)
6478 struct mem_cgroup
*memcg
= mem_cgroup_from_seq(m
);
6480 seq_printf(m
, "%d\n", memcg
->oom_group
);
6485 static ssize_t
memory_oom_group_write(struct kernfs_open_file
*of
,
6486 char *buf
, size_t nbytes
, loff_t off
)
6488 struct mem_cgroup
*memcg
= mem_cgroup_from_css(of_css(of
));
6491 buf
= strstrip(buf
);
6495 ret
= kstrtoint(buf
, 0, &oom_group
);
6499 if (oom_group
!= 0 && oom_group
!= 1)
6502 memcg
->oom_group
= oom_group
;
6507 static struct cftype memory_files
[] = {
6510 .flags
= CFTYPE_NOT_ON_ROOT
,
6511 .read_u64
= memory_current_read
,
6515 .flags
= CFTYPE_NOT_ON_ROOT
,
6516 .seq_show
= memory_min_show
,
6517 .write
= memory_min_write
,
6521 .flags
= CFTYPE_NOT_ON_ROOT
,
6522 .seq_show
= memory_low_show
,
6523 .write
= memory_low_write
,
6527 .flags
= CFTYPE_NOT_ON_ROOT
,
6528 .seq_show
= memory_high_show
,
6529 .write
= memory_high_write
,
6533 .flags
= CFTYPE_NOT_ON_ROOT
,
6534 .seq_show
= memory_max_show
,
6535 .write
= memory_max_write
,
6539 .flags
= CFTYPE_NOT_ON_ROOT
,
6540 .file_offset
= offsetof(struct mem_cgroup
, events_file
),
6541 .seq_show
= memory_events_show
,
6544 .name
= "events.local",
6545 .flags
= CFTYPE_NOT_ON_ROOT
,
6546 .file_offset
= offsetof(struct mem_cgroup
, events_local_file
),
6547 .seq_show
= memory_events_local_show
,
6551 .seq_show
= memory_stat_show
,
6555 .name
= "numa_stat",
6556 .seq_show
= memory_numa_stat_show
,
6560 .name
= "oom.group",
6561 .flags
= CFTYPE_NOT_ON_ROOT
| CFTYPE_NS_DELEGATABLE
,
6562 .seq_show
= memory_oom_group_show
,
6563 .write
= memory_oom_group_write
,
6568 struct cgroup_subsys memory_cgrp_subsys
= {
6569 .css_alloc
= mem_cgroup_css_alloc
,
6570 .css_online
= mem_cgroup_css_online
,
6571 .css_offline
= mem_cgroup_css_offline
,
6572 .css_released
= mem_cgroup_css_released
,
6573 .css_free
= mem_cgroup_css_free
,
6574 .css_reset
= mem_cgroup_css_reset
,
6575 .can_attach
= mem_cgroup_can_attach
,
6576 .cancel_attach
= mem_cgroup_cancel_attach
,
6577 .post_attach
= mem_cgroup_move_task
,
6578 .bind
= mem_cgroup_bind
,
6579 .dfl_cftypes
= memory_files
,
6580 .legacy_cftypes
= mem_cgroup_legacy_files
,
6585 * This function calculates an individual cgroup's effective
6586 * protection which is derived from its own memory.min/low, its
6587 * parent's and siblings' settings, as well as the actual memory
6588 * distribution in the tree.
6590 * The following rules apply to the effective protection values:
6592 * 1. At the first level of reclaim, effective protection is equal to
6593 * the declared protection in memory.min and memory.low.
6595 * 2. To enable safe delegation of the protection configuration, at
6596 * subsequent levels the effective protection is capped to the
6597 * parent's effective protection.
6599 * 3. To make complex and dynamic subtrees easier to configure, the
6600 * user is allowed to overcommit the declared protection at a given
6601 * level. If that is the case, the parent's effective protection is
6602 * distributed to the children in proportion to how much protection
6603 * they have declared and how much of it they are utilizing.
6605 * This makes distribution proportional, but also work-conserving:
6606 * if one cgroup claims much more protection than it uses memory,
6607 * the unused remainder is available to its siblings.
6609 * 4. Conversely, when the declared protection is undercommitted at a
6610 * given level, the distribution of the larger parental protection
6611 * budget is NOT proportional. A cgroup's protection from a sibling
6612 * is capped to its own memory.min/low setting.
6614 * 5. However, to allow protecting recursive subtrees from each other
6615 * without having to declare each individual cgroup's fixed share
6616 * of the ancestor's claim to protection, any unutilized -
6617 * "floating" - protection from up the tree is distributed in
6618 * proportion to each cgroup's *usage*. This makes the protection
6619 * neutral wrt sibling cgroups and lets them compete freely over
6620 * the shared parental protection budget, but it protects the
6621 * subtree as a whole from neighboring subtrees.
6623 * Note that 4. and 5. are not in conflict: 4. is about protecting
6624 * against immediate siblings whereas 5. is about protecting against
6625 * neighboring subtrees.
6627 static unsigned long effective_protection(unsigned long usage
,
6628 unsigned long parent_usage
,
6629 unsigned long setting
,
6630 unsigned long parent_effective
,
6631 unsigned long siblings_protected
)
6633 unsigned long protected;
6636 protected = min(usage
, setting
);
6638 * If all cgroups at this level combined claim and use more
6639 * protection then what the parent affords them, distribute
6640 * shares in proportion to utilization.
6642 * We are using actual utilization rather than the statically
6643 * claimed protection in order to be work-conserving: claimed
6644 * but unused protection is available to siblings that would
6645 * otherwise get a smaller chunk than what they claimed.
6647 if (siblings_protected
> parent_effective
)
6648 return protected * parent_effective
/ siblings_protected
;
6651 * Ok, utilized protection of all children is within what the
6652 * parent affords them, so we know whatever this child claims
6653 * and utilizes is effectively protected.
6655 * If there is unprotected usage beyond this value, reclaim
6656 * will apply pressure in proportion to that amount.
6658 * If there is unutilized protection, the cgroup will be fully
6659 * shielded from reclaim, but we do return a smaller value for
6660 * protection than what the group could enjoy in theory. This
6661 * is okay. With the overcommit distribution above, effective
6662 * protection is always dependent on how memory is actually
6663 * consumed among the siblings anyway.
6668 * If the children aren't claiming (all of) the protection
6669 * afforded to them by the parent, distribute the remainder in
6670 * proportion to the (unprotected) memory of each cgroup. That
6671 * way, cgroups that aren't explicitly prioritized wrt each
6672 * other compete freely over the allowance, but they are
6673 * collectively protected from neighboring trees.
6675 * We're using unprotected memory for the weight so that if
6676 * some cgroups DO claim explicit protection, we don't protect
6677 * the same bytes twice.
6679 * Check both usage and parent_usage against the respective
6680 * protected values. One should imply the other, but they
6681 * aren't read atomically - make sure the division is sane.
6683 if (!(cgrp_dfl_root
.flags
& CGRP_ROOT_MEMORY_RECURSIVE_PROT
))
6685 if (parent_effective
> siblings_protected
&&
6686 parent_usage
> siblings_protected
&&
6687 usage
> protected) {
6688 unsigned long unclaimed
;
6690 unclaimed
= parent_effective
- siblings_protected
;
6691 unclaimed
*= usage
- protected;
6692 unclaimed
/= parent_usage
- siblings_protected
;
6701 * mem_cgroup_protected - check if memory consumption is in the normal range
6702 * @root: the top ancestor of the sub-tree being checked
6703 * @memcg: the memory cgroup to check
6705 * WARNING: This function is not stateless! It can only be used as part
6706 * of a top-down tree iteration, not for isolated queries.
6708 void mem_cgroup_calculate_protection(struct mem_cgroup
*root
,
6709 struct mem_cgroup
*memcg
)
6711 unsigned long usage
, parent_usage
;
6712 struct mem_cgroup
*parent
;
6714 if (mem_cgroup_disabled())
6718 root
= root_mem_cgroup
;
6721 * Effective values of the reclaim targets are ignored so they
6722 * can be stale. Have a look at mem_cgroup_protection for more
6724 * TODO: calculation should be more robust so that we do not need
6725 * that special casing.
6730 usage
= page_counter_read(&memcg
->memory
);
6734 parent
= parent_mem_cgroup(memcg
);
6735 /* No parent means a non-hierarchical mode on v1 memcg */
6739 if (parent
== root
) {
6740 memcg
->memory
.emin
= READ_ONCE(memcg
->memory
.min
);
6741 memcg
->memory
.elow
= READ_ONCE(memcg
->memory
.low
);
6745 parent_usage
= page_counter_read(&parent
->memory
);
6747 WRITE_ONCE(memcg
->memory
.emin
, effective_protection(usage
, parent_usage
,
6748 READ_ONCE(memcg
->memory
.min
),
6749 READ_ONCE(parent
->memory
.emin
),
6750 atomic_long_read(&parent
->memory
.children_min_usage
)));
6752 WRITE_ONCE(memcg
->memory
.elow
, effective_protection(usage
, parent_usage
,
6753 READ_ONCE(memcg
->memory
.low
),
6754 READ_ONCE(parent
->memory
.elow
),
6755 atomic_long_read(&parent
->memory
.children_low_usage
)));
6759 * mem_cgroup_charge - charge a newly allocated page to a cgroup
6760 * @page: page to charge
6761 * @mm: mm context of the victim
6762 * @gfp_mask: reclaim mode
6764 * Try to charge @page to the memcg that @mm belongs to, reclaiming
6765 * pages according to @gfp_mask if necessary.
6767 * Returns 0 on success. Otherwise, an error code is returned.
6769 int mem_cgroup_charge(struct page
*page
, struct mm_struct
*mm
, gfp_t gfp_mask
)
6771 unsigned int nr_pages
= thp_nr_pages(page
);
6772 struct mem_cgroup
*memcg
= NULL
;
6775 if (mem_cgroup_disabled())
6778 if (PageSwapCache(page
)) {
6779 swp_entry_t ent
= { .val
= page_private(page
), };
6783 * Every swap fault against a single page tries to charge the
6784 * page, bail as early as possible. shmem_unuse() encounters
6785 * already charged pages, too. page->mem_cgroup is protected
6786 * by the page lock, which serializes swap cache removal, which
6787 * in turn serializes uncharging.
6789 VM_BUG_ON_PAGE(!PageLocked(page
), page
);
6790 if (compound_head(page
)->mem_cgroup
)
6793 id
= lookup_swap_cgroup_id(ent
);
6795 memcg
= mem_cgroup_from_id(id
);
6796 if (memcg
&& !css_tryget_online(&memcg
->css
))
6802 memcg
= get_mem_cgroup_from_mm(mm
);
6804 ret
= try_charge(memcg
, gfp_mask
, nr_pages
);
6808 css_get(&memcg
->css
);
6809 commit_charge(page
, memcg
);
6811 local_irq_disable();
6812 mem_cgroup_charge_statistics(memcg
, page
, nr_pages
);
6813 memcg_check_events(memcg
, page
);
6816 if (PageSwapCache(page
)) {
6817 swp_entry_t entry
= { .val
= page_private(page
) };
6819 * The swap entry might not get freed for a long time,
6820 * let's not wait for it. The page already received a
6821 * memory+swap charge, drop the swap entry duplicate.
6823 mem_cgroup_uncharge_swap(entry
, nr_pages
);
6827 css_put(&memcg
->css
);
6832 struct uncharge_gather
{
6833 struct mem_cgroup
*memcg
;
6834 unsigned long nr_pages
;
6835 unsigned long pgpgout
;
6836 unsigned long nr_kmem
;
6837 struct page
*dummy_page
;
6840 static inline void uncharge_gather_clear(struct uncharge_gather
*ug
)
6842 memset(ug
, 0, sizeof(*ug
));
6845 static void uncharge_batch(const struct uncharge_gather
*ug
)
6847 unsigned long flags
;
6849 if (!mem_cgroup_is_root(ug
->memcg
)) {
6850 page_counter_uncharge(&ug
->memcg
->memory
, ug
->nr_pages
);
6851 if (do_memsw_account())
6852 page_counter_uncharge(&ug
->memcg
->memsw
, ug
->nr_pages
);
6853 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys
) && ug
->nr_kmem
)
6854 page_counter_uncharge(&ug
->memcg
->kmem
, ug
->nr_kmem
);
6855 memcg_oom_recover(ug
->memcg
);
6858 local_irq_save(flags
);
6859 __count_memcg_events(ug
->memcg
, PGPGOUT
, ug
->pgpgout
);
6860 __this_cpu_add(ug
->memcg
->vmstats_percpu
->nr_page_events
, ug
->nr_pages
);
6861 memcg_check_events(ug
->memcg
, ug
->dummy_page
);
6862 local_irq_restore(flags
);
6864 /* drop reference from uncharge_page */
6865 css_put(&ug
->memcg
->css
);
6868 static void uncharge_page(struct page
*page
, struct uncharge_gather
*ug
)
6870 unsigned long nr_pages
;
6872 VM_BUG_ON_PAGE(PageLRU(page
), page
);
6874 if (!page
->mem_cgroup
)
6878 * Nobody should be changing or seriously looking at
6879 * page->mem_cgroup at this point, we have fully
6880 * exclusive access to the page.
6883 if (ug
->memcg
!= page
->mem_cgroup
) {
6886 uncharge_gather_clear(ug
);
6888 ug
->memcg
= page
->mem_cgroup
;
6890 /* pairs with css_put in uncharge_batch */
6891 css_get(&ug
->memcg
->css
);
6894 nr_pages
= compound_nr(page
);
6895 ug
->nr_pages
+= nr_pages
;
6897 if (!PageKmemcg(page
)) {
6900 ug
->nr_kmem
+= nr_pages
;
6901 __ClearPageKmemcg(page
);
6904 ug
->dummy_page
= page
;
6905 page
->mem_cgroup
= NULL
;
6906 css_put(&ug
->memcg
->css
);
6909 static void uncharge_list(struct list_head
*page_list
)
6911 struct uncharge_gather ug
;
6912 struct list_head
*next
;
6914 uncharge_gather_clear(&ug
);
6917 * Note that the list can be a single page->lru; hence the
6918 * do-while loop instead of a simple list_for_each_entry().
6920 next
= page_list
->next
;
6924 page
= list_entry(next
, struct page
, lru
);
6925 next
= page
->lru
.next
;
6927 uncharge_page(page
, &ug
);
6928 } while (next
!= page_list
);
6931 uncharge_batch(&ug
);
6935 * mem_cgroup_uncharge - uncharge a page
6936 * @page: page to uncharge
6938 * Uncharge a page previously charged with mem_cgroup_charge().
6940 void mem_cgroup_uncharge(struct page
*page
)
6942 struct uncharge_gather ug
;
6944 if (mem_cgroup_disabled())
6947 /* Don't touch page->lru of any random page, pre-check: */
6948 if (!page
->mem_cgroup
)
6951 uncharge_gather_clear(&ug
);
6952 uncharge_page(page
, &ug
);
6953 uncharge_batch(&ug
);
6957 * mem_cgroup_uncharge_list - uncharge a list of page
6958 * @page_list: list of pages to uncharge
6960 * Uncharge a list of pages previously charged with
6961 * mem_cgroup_charge().
6963 void mem_cgroup_uncharge_list(struct list_head
*page_list
)
6965 if (mem_cgroup_disabled())
6968 if (!list_empty(page_list
))
6969 uncharge_list(page_list
);
6973 * mem_cgroup_migrate - charge a page's replacement
6974 * @oldpage: currently circulating page
6975 * @newpage: replacement page
6977 * Charge @newpage as a replacement page for @oldpage. @oldpage will
6978 * be uncharged upon free.
6980 * Both pages must be locked, @newpage->mapping must be set up.
6982 void mem_cgroup_migrate(struct page
*oldpage
, struct page
*newpage
)
6984 struct mem_cgroup
*memcg
;
6985 unsigned int nr_pages
;
6986 unsigned long flags
;
6988 VM_BUG_ON_PAGE(!PageLocked(oldpage
), oldpage
);
6989 VM_BUG_ON_PAGE(!PageLocked(newpage
), newpage
);
6990 VM_BUG_ON_PAGE(PageAnon(oldpage
) != PageAnon(newpage
), newpage
);
6991 VM_BUG_ON_PAGE(PageTransHuge(oldpage
) != PageTransHuge(newpage
),
6994 if (mem_cgroup_disabled())
6997 /* Page cache replacement: new page already charged? */
6998 if (newpage
->mem_cgroup
)
7001 /* Swapcache readahead pages can get replaced before being charged */
7002 memcg
= oldpage
->mem_cgroup
;
7006 /* Force-charge the new page. The old one will be freed soon */
7007 nr_pages
= thp_nr_pages(newpage
);
7009 page_counter_charge(&memcg
->memory
, nr_pages
);
7010 if (do_memsw_account())
7011 page_counter_charge(&memcg
->memsw
, nr_pages
);
7013 css_get(&memcg
->css
);
7014 commit_charge(newpage
, memcg
);
7016 local_irq_save(flags
);
7017 mem_cgroup_charge_statistics(memcg
, newpage
, nr_pages
);
7018 memcg_check_events(memcg
, newpage
);
7019 local_irq_restore(flags
);
7022 DEFINE_STATIC_KEY_FALSE(memcg_sockets_enabled_key
);
7023 EXPORT_SYMBOL(memcg_sockets_enabled_key
);
7025 void mem_cgroup_sk_alloc(struct sock
*sk
)
7027 struct mem_cgroup
*memcg
;
7029 if (!mem_cgroup_sockets_enabled
)
7032 /* Do not associate the sock with unrelated interrupted task's memcg. */
7037 memcg
= mem_cgroup_from_task(current
);
7038 if (memcg
== root_mem_cgroup
)
7040 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys
) && !memcg
->tcpmem_active
)
7042 if (css_tryget(&memcg
->css
))
7043 sk
->sk_memcg
= memcg
;
7048 void mem_cgroup_sk_free(struct sock
*sk
)
7051 css_put(&sk
->sk_memcg
->css
);
7055 * mem_cgroup_charge_skmem - charge socket memory
7056 * @memcg: memcg to charge
7057 * @nr_pages: number of pages to charge
7059 * Charges @nr_pages to @memcg. Returns %true if the charge fit within
7060 * @memcg's configured limit, %false if the charge had to be forced.
7062 bool mem_cgroup_charge_skmem(struct mem_cgroup
*memcg
, unsigned int nr_pages
)
7064 gfp_t gfp_mask
= GFP_KERNEL
;
7066 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys
)) {
7067 struct page_counter
*fail
;
7069 if (page_counter_try_charge(&memcg
->tcpmem
, nr_pages
, &fail
)) {
7070 memcg
->tcpmem_pressure
= 0;
7073 page_counter_charge(&memcg
->tcpmem
, nr_pages
);
7074 memcg
->tcpmem_pressure
= 1;
7078 /* Don't block in the packet receive path */
7080 gfp_mask
= GFP_NOWAIT
;
7082 mod_memcg_state(memcg
, MEMCG_SOCK
, nr_pages
);
7084 if (try_charge(memcg
, gfp_mask
, nr_pages
) == 0)
7087 try_charge(memcg
, gfp_mask
|__GFP_NOFAIL
, nr_pages
);
7092 * mem_cgroup_uncharge_skmem - uncharge socket memory
7093 * @memcg: memcg to uncharge
7094 * @nr_pages: number of pages to uncharge
7096 void mem_cgroup_uncharge_skmem(struct mem_cgroup
*memcg
, unsigned int nr_pages
)
7098 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys
)) {
7099 page_counter_uncharge(&memcg
->tcpmem
, nr_pages
);
7103 mod_memcg_state(memcg
, MEMCG_SOCK
, -nr_pages
);
7105 refill_stock(memcg
, nr_pages
);
7108 static int __init
cgroup_memory(char *s
)
7112 while ((token
= strsep(&s
, ",")) != NULL
) {
7115 if (!strcmp(token
, "nosocket"))
7116 cgroup_memory_nosocket
= true;
7117 if (!strcmp(token
, "nokmem"))
7118 cgroup_memory_nokmem
= true;
7122 __setup("cgroup.memory=", cgroup_memory
);
7125 * subsys_initcall() for memory controller.
7127 * Some parts like memcg_hotplug_cpu_dead() have to be initialized from this
7128 * context because of lock dependencies (cgroup_lock -> cpu hotplug) but
7129 * basically everything that doesn't depend on a specific mem_cgroup structure
7130 * should be initialized from here.
7132 static int __init
mem_cgroup_init(void)
7136 cpuhp_setup_state_nocalls(CPUHP_MM_MEMCQ_DEAD
, "mm/memctrl:dead", NULL
,
7137 memcg_hotplug_cpu_dead
);
7139 for_each_possible_cpu(cpu
)
7140 INIT_WORK(&per_cpu_ptr(&memcg_stock
, cpu
)->work
,
7143 for_each_node(node
) {
7144 struct mem_cgroup_tree_per_node
*rtpn
;
7146 rtpn
= kzalloc_node(sizeof(*rtpn
), GFP_KERNEL
,
7147 node_online(node
) ? node
: NUMA_NO_NODE
);
7149 rtpn
->rb_root
= RB_ROOT
;
7150 rtpn
->rb_rightmost
= NULL
;
7151 spin_lock_init(&rtpn
->lock
);
7152 soft_limit_tree
.rb_tree_per_node
[node
] = rtpn
;
7157 subsys_initcall(mem_cgroup_init
);
7159 #ifdef CONFIG_MEMCG_SWAP
7160 static struct mem_cgroup
*mem_cgroup_id_get_online(struct mem_cgroup
*memcg
)
7162 while (!refcount_inc_not_zero(&memcg
->id
.ref
)) {
7164 * The root cgroup cannot be destroyed, so it's refcount must
7167 if (WARN_ON_ONCE(memcg
== root_mem_cgroup
)) {
7171 memcg
= parent_mem_cgroup(memcg
);
7173 memcg
= root_mem_cgroup
;
7179 * mem_cgroup_swapout - transfer a memsw charge to swap
7180 * @page: page whose memsw charge to transfer
7181 * @entry: swap entry to move the charge to
7183 * Transfer the memsw charge of @page to @entry.
7185 void mem_cgroup_swapout(struct page
*page
, swp_entry_t entry
)
7187 struct mem_cgroup
*memcg
, *swap_memcg
;
7188 unsigned int nr_entries
;
7189 unsigned short oldid
;
7191 VM_BUG_ON_PAGE(PageLRU(page
), page
);
7192 VM_BUG_ON_PAGE(page_count(page
), page
);
7194 if (cgroup_subsys_on_dfl(memory_cgrp_subsys
))
7197 memcg
= page
->mem_cgroup
;
7199 /* Readahead page, never charged */
7204 * In case the memcg owning these pages has been offlined and doesn't
7205 * have an ID allocated to it anymore, charge the closest online
7206 * ancestor for the swap instead and transfer the memory+swap charge.
7208 swap_memcg
= mem_cgroup_id_get_online(memcg
);
7209 nr_entries
= thp_nr_pages(page
);
7210 /* Get references for the tail pages, too */
7212 mem_cgroup_id_get_many(swap_memcg
, nr_entries
- 1);
7213 oldid
= swap_cgroup_record(entry
, mem_cgroup_id(swap_memcg
),
7215 VM_BUG_ON_PAGE(oldid
, page
);
7216 mod_memcg_state(swap_memcg
, MEMCG_SWAP
, nr_entries
);
7218 page
->mem_cgroup
= NULL
;
7220 if (!mem_cgroup_is_root(memcg
))
7221 page_counter_uncharge(&memcg
->memory
, nr_entries
);
7223 if (!cgroup_memory_noswap
&& memcg
!= swap_memcg
) {
7224 if (!mem_cgroup_is_root(swap_memcg
))
7225 page_counter_charge(&swap_memcg
->memsw
, nr_entries
);
7226 page_counter_uncharge(&memcg
->memsw
, nr_entries
);
7230 * Interrupts should be disabled here because the caller holds the
7231 * i_pages lock which is taken with interrupts-off. It is
7232 * important here to have the interrupts disabled because it is the
7233 * only synchronisation we have for updating the per-CPU variables.
7235 VM_BUG_ON(!irqs_disabled());
7236 mem_cgroup_charge_statistics(memcg
, page
, -nr_entries
);
7237 memcg_check_events(memcg
, page
);
7239 css_put(&memcg
->css
);
7243 * mem_cgroup_try_charge_swap - try charging swap space for a page
7244 * @page: page being added to swap
7245 * @entry: swap entry to charge
7247 * Try to charge @page's memcg for the swap space at @entry.
7249 * Returns 0 on success, -ENOMEM on failure.
7251 int mem_cgroup_try_charge_swap(struct page
*page
, swp_entry_t entry
)
7253 unsigned int nr_pages
= thp_nr_pages(page
);
7254 struct page_counter
*counter
;
7255 struct mem_cgroup
*memcg
;
7256 unsigned short oldid
;
7258 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys
))
7261 memcg
= page
->mem_cgroup
;
7263 /* Readahead page, never charged */
7268 memcg_memory_event(memcg
, MEMCG_SWAP_FAIL
);
7272 memcg
= mem_cgroup_id_get_online(memcg
);
7274 if (!cgroup_memory_noswap
&& !mem_cgroup_is_root(memcg
) &&
7275 !page_counter_try_charge(&memcg
->swap
, nr_pages
, &counter
)) {
7276 memcg_memory_event(memcg
, MEMCG_SWAP_MAX
);
7277 memcg_memory_event(memcg
, MEMCG_SWAP_FAIL
);
7278 mem_cgroup_id_put(memcg
);
7282 /* Get references for the tail pages, too */
7284 mem_cgroup_id_get_many(memcg
, nr_pages
- 1);
7285 oldid
= swap_cgroup_record(entry
, mem_cgroup_id(memcg
), nr_pages
);
7286 VM_BUG_ON_PAGE(oldid
, page
);
7287 mod_memcg_state(memcg
, MEMCG_SWAP
, nr_pages
);
7293 * mem_cgroup_uncharge_swap - uncharge swap space
7294 * @entry: swap entry to uncharge
7295 * @nr_pages: the amount of swap space to uncharge
7297 void mem_cgroup_uncharge_swap(swp_entry_t entry
, unsigned int nr_pages
)
7299 struct mem_cgroup
*memcg
;
7302 id
= swap_cgroup_record(entry
, 0, nr_pages
);
7304 memcg
= mem_cgroup_from_id(id
);
7306 if (!cgroup_memory_noswap
&& !mem_cgroup_is_root(memcg
)) {
7307 if (cgroup_subsys_on_dfl(memory_cgrp_subsys
))
7308 page_counter_uncharge(&memcg
->swap
, nr_pages
);
7310 page_counter_uncharge(&memcg
->memsw
, nr_pages
);
7312 mod_memcg_state(memcg
, MEMCG_SWAP
, -nr_pages
);
7313 mem_cgroup_id_put_many(memcg
, nr_pages
);
7318 long mem_cgroup_get_nr_swap_pages(struct mem_cgroup
*memcg
)
7320 long nr_swap_pages
= get_nr_swap_pages();
7322 if (cgroup_memory_noswap
|| !cgroup_subsys_on_dfl(memory_cgrp_subsys
))
7323 return nr_swap_pages
;
7324 for (; memcg
!= root_mem_cgroup
; memcg
= parent_mem_cgroup(memcg
))
7325 nr_swap_pages
= min_t(long, nr_swap_pages
,
7326 READ_ONCE(memcg
->swap
.max
) -
7327 page_counter_read(&memcg
->swap
));
7328 return nr_swap_pages
;
7331 bool mem_cgroup_swap_full(struct page
*page
)
7333 struct mem_cgroup
*memcg
;
7335 VM_BUG_ON_PAGE(!PageLocked(page
), page
);
7339 if (cgroup_memory_noswap
|| !cgroup_subsys_on_dfl(memory_cgrp_subsys
))
7342 memcg
= page
->mem_cgroup
;
7346 for (; memcg
!= root_mem_cgroup
; memcg
= parent_mem_cgroup(memcg
)) {
7347 unsigned long usage
= page_counter_read(&memcg
->swap
);
7349 if (usage
* 2 >= READ_ONCE(memcg
->swap
.high
) ||
7350 usage
* 2 >= READ_ONCE(memcg
->swap
.max
))
7357 static int __init
setup_swap_account(char *s
)
7359 if (!strcmp(s
, "1"))
7360 cgroup_memory_noswap
= 0;
7361 else if (!strcmp(s
, "0"))
7362 cgroup_memory_noswap
= 1;
7365 __setup("swapaccount=", setup_swap_account
);
7367 static u64
swap_current_read(struct cgroup_subsys_state
*css
,
7370 struct mem_cgroup
*memcg
= mem_cgroup_from_css(css
);
7372 return (u64
)page_counter_read(&memcg
->swap
) * PAGE_SIZE
;
7375 static int swap_high_show(struct seq_file
*m
, void *v
)
7377 return seq_puts_memcg_tunable(m
,
7378 READ_ONCE(mem_cgroup_from_seq(m
)->swap
.high
));
7381 static ssize_t
swap_high_write(struct kernfs_open_file
*of
,
7382 char *buf
, size_t nbytes
, loff_t off
)
7384 struct mem_cgroup
*memcg
= mem_cgroup_from_css(of_css(of
));
7388 buf
= strstrip(buf
);
7389 err
= page_counter_memparse(buf
, "max", &high
);
7393 page_counter_set_high(&memcg
->swap
, high
);
7398 static int swap_max_show(struct seq_file
*m
, void *v
)
7400 return seq_puts_memcg_tunable(m
,
7401 READ_ONCE(mem_cgroup_from_seq(m
)->swap
.max
));
7404 static ssize_t
swap_max_write(struct kernfs_open_file
*of
,
7405 char *buf
, size_t nbytes
, loff_t off
)
7407 struct mem_cgroup
*memcg
= mem_cgroup_from_css(of_css(of
));
7411 buf
= strstrip(buf
);
7412 err
= page_counter_memparse(buf
, "max", &max
);
7416 xchg(&memcg
->swap
.max
, max
);
7421 static int swap_events_show(struct seq_file
*m
, void *v
)
7423 struct mem_cgroup
*memcg
= mem_cgroup_from_seq(m
);
7425 seq_printf(m
, "high %lu\n",
7426 atomic_long_read(&memcg
->memory_events
[MEMCG_SWAP_HIGH
]));
7427 seq_printf(m
, "max %lu\n",
7428 atomic_long_read(&memcg
->memory_events
[MEMCG_SWAP_MAX
]));
7429 seq_printf(m
, "fail %lu\n",
7430 atomic_long_read(&memcg
->memory_events
[MEMCG_SWAP_FAIL
]));
7435 static struct cftype swap_files
[] = {
7437 .name
= "swap.current",
7438 .flags
= CFTYPE_NOT_ON_ROOT
,
7439 .read_u64
= swap_current_read
,
7442 .name
= "swap.high",
7443 .flags
= CFTYPE_NOT_ON_ROOT
,
7444 .seq_show
= swap_high_show
,
7445 .write
= swap_high_write
,
7449 .flags
= CFTYPE_NOT_ON_ROOT
,
7450 .seq_show
= swap_max_show
,
7451 .write
= swap_max_write
,
7454 .name
= "swap.events",
7455 .flags
= CFTYPE_NOT_ON_ROOT
,
7456 .file_offset
= offsetof(struct mem_cgroup
, swap_events_file
),
7457 .seq_show
= swap_events_show
,
7462 static struct cftype memsw_files
[] = {
7464 .name
= "memsw.usage_in_bytes",
7465 .private = MEMFILE_PRIVATE(_MEMSWAP
, RES_USAGE
),
7466 .read_u64
= mem_cgroup_read_u64
,
7469 .name
= "memsw.max_usage_in_bytes",
7470 .private = MEMFILE_PRIVATE(_MEMSWAP
, RES_MAX_USAGE
),
7471 .write
= mem_cgroup_reset
,
7472 .read_u64
= mem_cgroup_read_u64
,
7475 .name
= "memsw.limit_in_bytes",
7476 .private = MEMFILE_PRIVATE(_MEMSWAP
, RES_LIMIT
),
7477 .write
= mem_cgroup_write
,
7478 .read_u64
= mem_cgroup_read_u64
,
7481 .name
= "memsw.failcnt",
7482 .private = MEMFILE_PRIVATE(_MEMSWAP
, RES_FAILCNT
),
7483 .write
= mem_cgroup_reset
,
7484 .read_u64
= mem_cgroup_read_u64
,
7486 { }, /* terminate */
7490 * If mem_cgroup_swap_init() is implemented as a subsys_initcall()
7491 * instead of a core_initcall(), this could mean cgroup_memory_noswap still
7492 * remains set to false even when memcg is disabled via "cgroup_disable=memory"
7493 * boot parameter. This may result in premature OOPS inside
7494 * mem_cgroup_get_nr_swap_pages() function in corner cases.
7496 static int __init
mem_cgroup_swap_init(void)
7498 /* No memory control -> no swap control */
7499 if (mem_cgroup_disabled())
7500 cgroup_memory_noswap
= true;
7502 if (cgroup_memory_noswap
)
7505 WARN_ON(cgroup_add_dfl_cftypes(&memory_cgrp_subsys
, swap_files
));
7506 WARN_ON(cgroup_add_legacy_cftypes(&memory_cgrp_subsys
, memsw_files
));
7510 core_initcall(mem_cgroup_swap_init
);
7512 #endif /* CONFIG_MEMCG_SWAP */