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) {
632 mctz->rb_rightmost = &mz->tree_node;
634 rb_link_node(&mz->tree_node, parent, p);
635 rb_insert_color(&mz->tree_node, &mctz->rb_root);
639 static void __mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
640 struct mem_cgroup_tree_per_node *mctz)
645 if (&mz->tree_node == mctz->rb_rightmost)
646 mctz->rb_rightmost = rb_prev(&mz->tree_node);
648 rb_erase(&mz->tree_node, &mctz->rb_root);
652 static void mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
653 struct mem_cgroup_tree_per_node *mctz)
657 spin_lock_irqsave(&mctz->lock, flags);
658 __mem_cgroup_remove_exceeded(mz, mctz);
659 spin_unlock_irqrestore(&mctz->lock, flags);
662 static unsigned long soft_limit_excess(struct mem_cgroup *memcg)
664 unsigned long nr_pages = page_counter_read(&memcg->memory);
665 unsigned long soft_limit = READ_ONCE(memcg->soft_limit);
666 unsigned long excess = 0;
668 if (nr_pages > soft_limit)
669 excess = nr_pages - soft_limit;
674 static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page)
676 unsigned long excess;
677 struct mem_cgroup_per_node *mz;
678 struct mem_cgroup_tree_per_node *mctz;
680 mctz = soft_limit_tree_from_page(page);
684 * Necessary to update all ancestors when hierarchy is used.
685 * because their event counter is not touched.
687 for (; memcg; memcg = parent_mem_cgroup(memcg)) {
688 mz = mem_cgroup_page_nodeinfo(memcg, page);
689 excess = soft_limit_excess(memcg);
691 * We have to update the tree if mz is on RB-tree or
692 * mem is over its softlimit.
694 if (excess || mz->on_tree) {
697 spin_lock_irqsave(&mctz->lock, flags);
698 /* if on-tree, remove it */
700 __mem_cgroup_remove_exceeded(mz, mctz);
702 * Insert again. mz->usage_in_excess will be updated.
703 * If excess is 0, no tree ops.
705 __mem_cgroup_insert_exceeded(mz, mctz, excess);
706 spin_unlock_irqrestore(&mctz->lock, flags);
711 static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg)
713 struct mem_cgroup_tree_per_node *mctz;
714 struct mem_cgroup_per_node *mz;
718 mz = mem_cgroup_nodeinfo(memcg, nid);
719 mctz = soft_limit_tree_node(nid);
721 mem_cgroup_remove_exceeded(mz, mctz);
725 static struct mem_cgroup_per_node *
726 __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node *mctz)
728 struct mem_cgroup_per_node *mz;
732 if (!mctz->rb_rightmost)
733 goto done; /* Nothing to reclaim from */
735 mz = rb_entry(mctz->rb_rightmost,
736 struct mem_cgroup_per_node, tree_node);
738 * Remove the node now but someone else can add it back,
739 * we will to add it back at the end of reclaim to its correct
740 * position in the tree.
742 __mem_cgroup_remove_exceeded(mz, mctz);
743 if (!soft_limit_excess(mz->memcg) ||
744 !css_tryget(&mz->memcg->css))
750 static struct mem_cgroup_per_node *
751 mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node *mctz)
753 struct mem_cgroup_per_node *mz;
755 spin_lock_irq(&mctz->lock);
756 mz = __mem_cgroup_largest_soft_limit_node(mctz);
757 spin_unlock_irq(&mctz->lock);
762 * __mod_memcg_state - update cgroup memory statistics
763 * @memcg: the memory cgroup
764 * @idx: the stat item - can be enum memcg_stat_item or enum node_stat_item
765 * @val: delta to add to the counter, can be negative
767 void __mod_memcg_state(struct mem_cgroup *memcg, int idx, int val)
769 long x, threshold = MEMCG_CHARGE_BATCH;
771 if (mem_cgroup_disabled())
774 if (memcg_stat_item_in_bytes(idx))
775 threshold <<= PAGE_SHIFT;
777 x = val + __this_cpu_read(memcg->vmstats_percpu->stat[idx]);
778 if (unlikely(abs(x) > threshold)) {
779 struct mem_cgroup *mi;
782 * Batch local counters to keep them in sync with
783 * the hierarchical ones.
785 __this_cpu_add(memcg->vmstats_local->stat[idx], x);
786 for (mi = memcg; mi; mi = parent_mem_cgroup(mi))
787 atomic_long_add(x, &mi->vmstats[idx]);
790 __this_cpu_write(memcg->vmstats_percpu->stat[idx], x);
793 static struct mem_cgroup_per_node *
794 parent_nodeinfo(struct mem_cgroup_per_node *pn, int nid)
796 struct mem_cgroup *parent;
798 parent = parent_mem_cgroup(pn->memcg);
801 return mem_cgroup_nodeinfo(parent, nid);
804 void __mod_memcg_lruvec_state(struct lruvec *lruvec, enum node_stat_item idx,
807 struct mem_cgroup_per_node *pn;
808 struct mem_cgroup *memcg;
809 long x, threshold = MEMCG_CHARGE_BATCH;
811 pn = container_of(lruvec, struct mem_cgroup_per_node, lruvec);
815 __mod_memcg_state(memcg, idx, val);
818 __this_cpu_add(pn->lruvec_stat_local->count[idx], val);
820 if (vmstat_item_in_bytes(idx))
821 threshold <<= PAGE_SHIFT;
823 x = val + __this_cpu_read(pn->lruvec_stat_cpu->count[idx]);
824 if (unlikely(abs(x) > threshold)) {
825 pg_data_t *pgdat = lruvec_pgdat(lruvec);
826 struct mem_cgroup_per_node *pi;
828 for (pi = pn; pi; pi = parent_nodeinfo(pi, pgdat->node_id))
829 atomic_long_add(x, &pi->lruvec_stat[idx]);
832 __this_cpu_write(pn->lruvec_stat_cpu->count[idx], x);
836 * __mod_lruvec_state - update lruvec memory statistics
837 * @lruvec: the lruvec
838 * @idx: the stat item
839 * @val: delta to add to the counter, can be negative
841 * The lruvec is the intersection of the NUMA node and a cgroup. This
842 * function updates the all three counters that are affected by a
843 * change of state at this level: per-node, per-cgroup, per-lruvec.
845 void __mod_lruvec_state(struct lruvec *lruvec, enum node_stat_item idx,
849 __mod_node_page_state(lruvec_pgdat(lruvec), idx, val);
851 /* Update memcg and lruvec */
852 if (!mem_cgroup_disabled())
853 __mod_memcg_lruvec_state(lruvec, idx, val);
856 void __mod_lruvec_slab_state(void *p, enum node_stat_item idx, int val)
858 pg_data_t *pgdat = page_pgdat(virt_to_page(p));
859 struct mem_cgroup *memcg;
860 struct lruvec *lruvec;
863 memcg = mem_cgroup_from_obj(p);
866 * Untracked pages have no memcg, no lruvec. Update only the
867 * node. If we reparent the slab objects to the root memcg,
868 * when we free the slab object, we need to update the per-memcg
869 * vmstats to keep it correct for the root memcg.
872 __mod_node_page_state(pgdat, idx, val);
874 lruvec = mem_cgroup_lruvec(memcg, pgdat);
875 __mod_lruvec_state(lruvec, idx, val);
881 * __count_memcg_events - account VM events in a cgroup
882 * @memcg: the memory cgroup
883 * @idx: the event item
884 * @count: the number of events that occured
886 void __count_memcg_events(struct mem_cgroup *memcg, enum vm_event_item idx,
891 if (mem_cgroup_disabled())
894 x = count + __this_cpu_read(memcg->vmstats_percpu->events[idx]);
895 if (unlikely(x > MEMCG_CHARGE_BATCH)) {
896 struct mem_cgroup *mi;
899 * Batch local counters to keep them in sync with
900 * the hierarchical ones.
902 __this_cpu_add(memcg->vmstats_local->events[idx], x);
903 for (mi = memcg; mi; mi = parent_mem_cgroup(mi))
904 atomic_long_add(x, &mi->vmevents[idx]);
907 __this_cpu_write(memcg->vmstats_percpu->events[idx], x);
910 static unsigned long memcg_events(struct mem_cgroup *memcg, int event)
912 return atomic_long_read(&memcg->vmevents[event]);
915 static unsigned long memcg_events_local(struct mem_cgroup *memcg, int event)
920 for_each_possible_cpu(cpu)
921 x += per_cpu(memcg->vmstats_local->events[event], cpu);
925 static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg,
929 /* pagein of a big page is an event. So, ignore page size */
931 __count_memcg_events(memcg, PGPGIN, 1);
933 __count_memcg_events(memcg, PGPGOUT, 1);
934 nr_pages = -nr_pages; /* for event */
937 __this_cpu_add(memcg->vmstats_percpu->nr_page_events, nr_pages);
940 static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg,
941 enum mem_cgroup_events_target target)
943 unsigned long val, next;
945 val = __this_cpu_read(memcg->vmstats_percpu->nr_page_events);
946 next = __this_cpu_read(memcg->vmstats_percpu->targets[target]);
947 /* from time_after() in jiffies.h */
948 if ((long)(next - val) < 0) {
950 case MEM_CGROUP_TARGET_THRESH:
951 next = val + THRESHOLDS_EVENTS_TARGET;
953 case MEM_CGROUP_TARGET_SOFTLIMIT:
954 next = val + SOFTLIMIT_EVENTS_TARGET;
959 __this_cpu_write(memcg->vmstats_percpu->targets[target], next);
966 * Check events in order.
969 static void memcg_check_events(struct mem_cgroup *memcg, struct page *page)
971 /* threshold event is triggered in finer grain than soft limit */
972 if (unlikely(mem_cgroup_event_ratelimit(memcg,
973 MEM_CGROUP_TARGET_THRESH))) {
976 do_softlimit = mem_cgroup_event_ratelimit(memcg,
977 MEM_CGROUP_TARGET_SOFTLIMIT);
978 mem_cgroup_threshold(memcg);
979 if (unlikely(do_softlimit))
980 mem_cgroup_update_tree(memcg, page);
984 struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p)
987 * mm_update_next_owner() may clear mm->owner to NULL
988 * if it races with swapoff, page migration, etc.
989 * So this can be called with p == NULL.
994 return mem_cgroup_from_css(task_css(p, memory_cgrp_id));
996 EXPORT_SYMBOL(mem_cgroup_from_task);
999 * get_mem_cgroup_from_mm: Obtain a reference on given mm_struct's memcg.
1000 * @mm: mm from which memcg should be extracted. It can be NULL.
1002 * Obtain a reference on mm->memcg and returns it if successful. Otherwise
1003 * root_mem_cgroup is returned. However if mem_cgroup is disabled, NULL is
1006 struct mem_cgroup *get_mem_cgroup_from_mm(struct mm_struct *mm)
1008 struct mem_cgroup *memcg;
1010 if (mem_cgroup_disabled())
1016 * Page cache insertions can happen withou an
1017 * actual mm context, e.g. during disk probing
1018 * on boot, loopback IO, acct() writes etc.
1021 memcg = root_mem_cgroup;
1023 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
1024 if (unlikely(!memcg))
1025 memcg = root_mem_cgroup;
1027 } while (!css_tryget(&memcg->css));
1031 EXPORT_SYMBOL(get_mem_cgroup_from_mm);
1034 * get_mem_cgroup_from_page: Obtain a reference on given page's memcg.
1035 * @page: page from which memcg should be extracted.
1037 * Obtain a reference on page->memcg and returns it if successful. Otherwise
1038 * root_mem_cgroup is returned.
1040 struct mem_cgroup *get_mem_cgroup_from_page(struct page *page)
1042 struct mem_cgroup *memcg = page->mem_cgroup;
1044 if (mem_cgroup_disabled())
1048 /* Page should not get uncharged and freed memcg under us. */
1049 if (!memcg || WARN_ON_ONCE(!css_tryget(&memcg->css)))
1050 memcg = root_mem_cgroup;
1054 EXPORT_SYMBOL(get_mem_cgroup_from_page);
1056 static __always_inline struct mem_cgroup *active_memcg(void)
1059 return this_cpu_read(int_active_memcg);
1061 return current->active_memcg;
1064 static __always_inline struct mem_cgroup *get_active_memcg(void)
1066 struct mem_cgroup *memcg;
1069 memcg = active_memcg();
1071 /* current->active_memcg must hold a ref. */
1072 if (WARN_ON_ONCE(!css_tryget(&memcg->css)))
1073 memcg = root_mem_cgroup;
1075 memcg = current->active_memcg;
1082 static __always_inline bool memcg_kmem_bypass(void)
1084 /* Allow remote memcg charging from any context. */
1085 if (unlikely(active_memcg()))
1088 /* Memcg to charge can't be determined. */
1089 if (in_interrupt() || !current->mm || (current->flags & PF_KTHREAD))
1096 * If active memcg is set, do not fallback to current->mm->memcg.
1098 static __always_inline struct mem_cgroup *get_mem_cgroup_from_current(void)
1100 if (memcg_kmem_bypass())
1103 if (unlikely(active_memcg()))
1104 return get_active_memcg();
1106 return get_mem_cgroup_from_mm(current->mm);
1110 * mem_cgroup_iter - iterate over memory cgroup hierarchy
1111 * @root: hierarchy root
1112 * @prev: previously returned memcg, NULL on first invocation
1113 * @reclaim: cookie for shared reclaim walks, NULL for full walks
1115 * Returns references to children of the hierarchy below @root, or
1116 * @root itself, or %NULL after a full round-trip.
1118 * Caller must pass the return value in @prev on subsequent
1119 * invocations for reference counting, or use mem_cgroup_iter_break()
1120 * to cancel a hierarchy walk before the round-trip is complete.
1122 * Reclaimers can specify a node in @reclaim to divide up the memcgs
1123 * in the hierarchy among all concurrent reclaimers operating on the
1126 struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root,
1127 struct mem_cgroup *prev,
1128 struct mem_cgroup_reclaim_cookie *reclaim)
1130 struct mem_cgroup_reclaim_iter *iter;
1131 struct cgroup_subsys_state *css = NULL;
1132 struct mem_cgroup *memcg = NULL;
1133 struct mem_cgroup *pos = NULL;
1135 if (mem_cgroup_disabled())
1139 root = root_mem_cgroup;
1141 if (prev && !reclaim)
1144 if (!root->use_hierarchy && root != root_mem_cgroup) {
1153 struct mem_cgroup_per_node *mz;
1155 mz = mem_cgroup_nodeinfo(root, reclaim->pgdat->node_id);
1158 if (prev && reclaim->generation != iter->generation)
1162 pos = READ_ONCE(iter->position);
1163 if (!pos || css_tryget(&pos->css))
1166 * css reference reached zero, so iter->position will
1167 * be cleared by ->css_released. However, we should not
1168 * rely on this happening soon, because ->css_released
1169 * is called from a work queue, and by busy-waiting we
1170 * might block it. So we clear iter->position right
1173 (void)cmpxchg(&iter->position, pos, NULL);
1181 css = css_next_descendant_pre(css, &root->css);
1184 * Reclaimers share the hierarchy walk, and a
1185 * new one might jump in right at the end of
1186 * the hierarchy - make sure they see at least
1187 * one group and restart from the beginning.
1195 * Verify the css and acquire a reference. The root
1196 * is provided by the caller, so we know it's alive
1197 * and kicking, and don't take an extra reference.
1199 memcg = mem_cgroup_from_css(css);
1201 if (css == &root->css)
1204 if (css_tryget(css))
1212 * The position could have already been updated by a competing
1213 * thread, so check that the value hasn't changed since we read
1214 * it to avoid reclaiming from the same cgroup twice.
1216 (void)cmpxchg(&iter->position, pos, memcg);
1224 reclaim->generation = iter->generation;
1230 if (prev && prev != root)
1231 css_put(&prev->css);
1237 * mem_cgroup_iter_break - abort a hierarchy walk prematurely
1238 * @root: hierarchy root
1239 * @prev: last visited hierarchy member as returned by mem_cgroup_iter()
1241 void mem_cgroup_iter_break(struct mem_cgroup *root,
1242 struct mem_cgroup *prev)
1245 root = root_mem_cgroup;
1246 if (prev && prev != root)
1247 css_put(&prev->css);
1250 static void __invalidate_reclaim_iterators(struct mem_cgroup *from,
1251 struct mem_cgroup *dead_memcg)
1253 struct mem_cgroup_reclaim_iter *iter;
1254 struct mem_cgroup_per_node *mz;
1257 for_each_node(nid) {
1258 mz = mem_cgroup_nodeinfo(from, nid);
1260 cmpxchg(&iter->position, dead_memcg, NULL);
1264 static void invalidate_reclaim_iterators(struct mem_cgroup *dead_memcg)
1266 struct mem_cgroup *memcg = dead_memcg;
1267 struct mem_cgroup *last;
1270 __invalidate_reclaim_iterators(memcg, dead_memcg);
1272 } while ((memcg = parent_mem_cgroup(memcg)));
1275 * When cgruop1 non-hierarchy mode is used,
1276 * parent_mem_cgroup() does not walk all the way up to the
1277 * cgroup root (root_mem_cgroup). So we have to handle
1278 * dead_memcg from cgroup root separately.
1280 if (last != root_mem_cgroup)
1281 __invalidate_reclaim_iterators(root_mem_cgroup,
1286 * mem_cgroup_scan_tasks - iterate over tasks of a memory cgroup hierarchy
1287 * @memcg: hierarchy root
1288 * @fn: function to call for each task
1289 * @arg: argument passed to @fn
1291 * This function iterates over tasks attached to @memcg or to any of its
1292 * descendants and calls @fn for each task. If @fn returns a non-zero
1293 * value, the function breaks the iteration loop and returns the value.
1294 * Otherwise, it will iterate over all tasks and return 0.
1296 * This function must not be called for the root memory cgroup.
1298 int mem_cgroup_scan_tasks(struct mem_cgroup *memcg,
1299 int (*fn)(struct task_struct *, void *), void *arg)
1301 struct mem_cgroup *iter;
1304 BUG_ON(memcg == root_mem_cgroup);
1306 for_each_mem_cgroup_tree(iter, memcg) {
1307 struct css_task_iter it;
1308 struct task_struct *task;
1310 css_task_iter_start(&iter->css, CSS_TASK_ITER_PROCS, &it);
1311 while (!ret && (task = css_task_iter_next(&it)))
1312 ret = fn(task, arg);
1313 css_task_iter_end(&it);
1315 mem_cgroup_iter_break(memcg, iter);
1323 * mem_cgroup_page_lruvec - return lruvec for isolating/putting an LRU page
1325 * @pgdat: pgdat of the page
1327 * This function relies on page->mem_cgroup being stable - see the
1328 * access rules in commit_charge().
1330 struct lruvec *mem_cgroup_page_lruvec(struct page *page, struct pglist_data *pgdat)
1332 struct mem_cgroup_per_node *mz;
1333 struct mem_cgroup *memcg;
1334 struct lruvec *lruvec;
1336 if (mem_cgroup_disabled()) {
1337 lruvec = &pgdat->__lruvec;
1341 memcg = page->mem_cgroup;
1343 * Swapcache readahead pages are added to the LRU - and
1344 * possibly migrated - before they are charged.
1347 memcg = root_mem_cgroup;
1349 mz = mem_cgroup_page_nodeinfo(memcg, page);
1350 lruvec = &mz->lruvec;
1353 * Since a node can be onlined after the mem_cgroup was created,
1354 * we have to be prepared to initialize lruvec->zone here;
1355 * and if offlined then reonlined, we need to reinitialize it.
1357 if (unlikely(lruvec->pgdat != pgdat))
1358 lruvec->pgdat = pgdat;
1363 * mem_cgroup_update_lru_size - account for adding or removing an lru page
1364 * @lruvec: mem_cgroup per zone lru vector
1365 * @lru: index of lru list the page is sitting on
1366 * @zid: zone id of the accounted pages
1367 * @nr_pages: positive when adding or negative when removing
1369 * This function must be called under lru_lock, just before a page is added
1370 * to or just after a page is removed from an lru list (that ordering being
1371 * so as to allow it to check that lru_size 0 is consistent with list_empty).
1373 void mem_cgroup_update_lru_size(struct lruvec *lruvec, enum lru_list lru,
1374 int zid, int nr_pages)
1376 struct mem_cgroup_per_node *mz;
1377 unsigned long *lru_size;
1380 if (mem_cgroup_disabled())
1383 mz = container_of(lruvec, struct mem_cgroup_per_node, lruvec);
1384 lru_size = &mz->lru_zone_size[zid][lru];
1387 *lru_size += nr_pages;
1390 if (WARN_ONCE(size < 0,
1391 "%s(%p, %d, %d): lru_size %ld\n",
1392 __func__, lruvec, lru, nr_pages, size)) {
1398 *lru_size += nr_pages;
1402 * mem_cgroup_margin - calculate chargeable space of a memory cgroup
1403 * @memcg: the memory cgroup
1405 * Returns the maximum amount of memory @mem can be charged with, in
1408 static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg)
1410 unsigned long margin = 0;
1411 unsigned long count;
1412 unsigned long limit;
1414 count = page_counter_read(&memcg->memory);
1415 limit = READ_ONCE(memcg->memory.max);
1417 margin = limit - count;
1419 if (do_memsw_account()) {
1420 count = page_counter_read(&memcg->memsw);
1421 limit = READ_ONCE(memcg->memsw.max);
1423 margin = min(margin, limit - count);
1432 * A routine for checking "mem" is under move_account() or not.
1434 * Checking a cgroup is mc.from or mc.to or under hierarchy of
1435 * moving cgroups. This is for waiting at high-memory pressure
1438 static bool mem_cgroup_under_move(struct mem_cgroup *memcg)
1440 struct mem_cgroup *from;
1441 struct mem_cgroup *to;
1444 * Unlike task_move routines, we access mc.to, mc.from not under
1445 * mutual exclusion by cgroup_mutex. Here, we take spinlock instead.
1447 spin_lock(&mc.lock);
1453 ret = mem_cgroup_is_descendant(from, memcg) ||
1454 mem_cgroup_is_descendant(to, memcg);
1456 spin_unlock(&mc.lock);
1460 static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg)
1462 if (mc.moving_task && current != mc.moving_task) {
1463 if (mem_cgroup_under_move(memcg)) {
1465 prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE);
1466 /* moving charge context might have finished. */
1469 finish_wait(&mc.waitq, &wait);
1476 struct memory_stat {
1482 static struct memory_stat memory_stats[] = {
1483 { "anon", PAGE_SIZE, NR_ANON_MAPPED },
1484 { "file", PAGE_SIZE, NR_FILE_PAGES },
1485 { "kernel_stack", 1024, NR_KERNEL_STACK_KB },
1486 { "percpu", 1, MEMCG_PERCPU_B },
1487 { "sock", PAGE_SIZE, MEMCG_SOCK },
1488 { "shmem", PAGE_SIZE, NR_SHMEM },
1489 { "file_mapped", PAGE_SIZE, NR_FILE_MAPPED },
1490 { "file_dirty", PAGE_SIZE, NR_FILE_DIRTY },
1491 { "file_writeback", PAGE_SIZE, NR_WRITEBACK },
1492 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
1494 * The ratio will be initialized in memory_stats_init(). Because
1495 * on some architectures, the macro of HPAGE_PMD_SIZE is not
1496 * constant(e.g. powerpc).
1498 { "anon_thp", 0, NR_ANON_THPS },
1499 { "file_thp", 0, NR_FILE_THPS },
1500 { "shmem_thp", 0, NR_SHMEM_THPS },
1502 { "inactive_anon", PAGE_SIZE, NR_INACTIVE_ANON },
1503 { "active_anon", PAGE_SIZE, NR_ACTIVE_ANON },
1504 { "inactive_file", PAGE_SIZE, NR_INACTIVE_FILE },
1505 { "active_file", PAGE_SIZE, NR_ACTIVE_FILE },
1506 { "unevictable", PAGE_SIZE, NR_UNEVICTABLE },
1509 * Note: The slab_reclaimable and slab_unreclaimable must be
1510 * together and slab_reclaimable must be in front.
1512 { "slab_reclaimable", 1, NR_SLAB_RECLAIMABLE_B },
1513 { "slab_unreclaimable", 1, NR_SLAB_UNRECLAIMABLE_B },
1515 /* The memory events */
1516 { "workingset_refault_anon", 1, WORKINGSET_REFAULT_ANON },
1517 { "workingset_refault_file", 1, WORKINGSET_REFAULT_FILE },
1518 { "workingset_activate_anon", 1, WORKINGSET_ACTIVATE_ANON },
1519 { "workingset_activate_file", 1, WORKINGSET_ACTIVATE_FILE },
1520 { "workingset_restore_anon", 1, WORKINGSET_RESTORE_ANON },
1521 { "workingset_restore_file", 1, WORKINGSET_RESTORE_FILE },
1522 { "workingset_nodereclaim", 1, WORKINGSET_NODERECLAIM },
1525 static int __init memory_stats_init(void)
1529 for (i = 0; i < ARRAY_SIZE(memory_stats); i++) {
1530 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
1531 if (memory_stats[i].idx == NR_ANON_THPS ||
1532 memory_stats[i].idx == NR_FILE_THPS ||
1533 memory_stats[i].idx == NR_SHMEM_THPS)
1534 memory_stats[i].ratio = HPAGE_PMD_SIZE;
1536 VM_BUG_ON(!memory_stats[i].ratio);
1537 VM_BUG_ON(memory_stats[i].idx >= MEMCG_NR_STAT);
1542 pure_initcall(memory_stats_init);
1544 static char *memory_stat_format(struct mem_cgroup *memcg)
1549 seq_buf_init(&s, kmalloc(PAGE_SIZE, GFP_KERNEL), PAGE_SIZE);
1554 * Provide statistics on the state of the memory subsystem as
1555 * well as cumulative event counters that show past behavior.
1557 * This list is ordered following a combination of these gradients:
1558 * 1) generic big picture -> specifics and details
1559 * 2) reflecting userspace activity -> reflecting kernel heuristics
1561 * Current memory state:
1564 for (i = 0; i < ARRAY_SIZE(memory_stats); i++) {
1567 size = memcg_page_state(memcg, memory_stats[i].idx);
1568 size *= memory_stats[i].ratio;
1569 seq_buf_printf(&s, "%s %llu\n", memory_stats[i].name, size);
1571 if (unlikely(memory_stats[i].idx == NR_SLAB_UNRECLAIMABLE_B)) {
1572 size = memcg_page_state(memcg, NR_SLAB_RECLAIMABLE_B) +
1573 memcg_page_state(memcg, NR_SLAB_UNRECLAIMABLE_B);
1574 seq_buf_printf(&s, "slab %llu\n", size);
1578 /* Accumulated memory events */
1580 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGFAULT),
1581 memcg_events(memcg, PGFAULT));
1582 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGMAJFAULT),
1583 memcg_events(memcg, PGMAJFAULT));
1584 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGREFILL),
1585 memcg_events(memcg, PGREFILL));
1586 seq_buf_printf(&s, "pgscan %lu\n",
1587 memcg_events(memcg, PGSCAN_KSWAPD) +
1588 memcg_events(memcg, PGSCAN_DIRECT));
1589 seq_buf_printf(&s, "pgsteal %lu\n",
1590 memcg_events(memcg, PGSTEAL_KSWAPD) +
1591 memcg_events(memcg, PGSTEAL_DIRECT));
1592 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGACTIVATE),
1593 memcg_events(memcg, PGACTIVATE));
1594 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGDEACTIVATE),
1595 memcg_events(memcg, PGDEACTIVATE));
1596 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGLAZYFREE),
1597 memcg_events(memcg, PGLAZYFREE));
1598 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGLAZYFREED),
1599 memcg_events(memcg, PGLAZYFREED));
1601 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
1602 seq_buf_printf(&s, "%s %lu\n", vm_event_name(THP_FAULT_ALLOC),
1603 memcg_events(memcg, THP_FAULT_ALLOC));
1604 seq_buf_printf(&s, "%s %lu\n", vm_event_name(THP_COLLAPSE_ALLOC),
1605 memcg_events(memcg, THP_COLLAPSE_ALLOC));
1606 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
1608 /* The above should easily fit into one page */
1609 WARN_ON_ONCE(seq_buf_has_overflowed(&s));
1614 #define K(x) ((x) << (PAGE_SHIFT-10))
1616 * mem_cgroup_print_oom_context: Print OOM information relevant to
1617 * memory controller.
1618 * @memcg: The memory cgroup that went over limit
1619 * @p: Task that is going to be killed
1621 * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is
1624 void mem_cgroup_print_oom_context(struct mem_cgroup *memcg, struct task_struct *p)
1629 pr_cont(",oom_memcg=");
1630 pr_cont_cgroup_path(memcg->css.cgroup);
1632 pr_cont(",global_oom");
1634 pr_cont(",task_memcg=");
1635 pr_cont_cgroup_path(task_cgroup(p, memory_cgrp_id));
1641 * mem_cgroup_print_oom_meminfo: Print OOM memory information relevant to
1642 * memory controller.
1643 * @memcg: The memory cgroup that went over limit
1645 void mem_cgroup_print_oom_meminfo(struct mem_cgroup *memcg)
1649 pr_info("memory: usage %llukB, limit %llukB, failcnt %lu\n",
1650 K((u64)page_counter_read(&memcg->memory)),
1651 K((u64)READ_ONCE(memcg->memory.max)), memcg->memory.failcnt);
1652 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
1653 pr_info("swap: usage %llukB, limit %llukB, failcnt %lu\n",
1654 K((u64)page_counter_read(&memcg->swap)),
1655 K((u64)READ_ONCE(memcg->swap.max)), memcg->swap.failcnt);
1657 pr_info("memory+swap: usage %llukB, limit %llukB, failcnt %lu\n",
1658 K((u64)page_counter_read(&memcg->memsw)),
1659 K((u64)memcg->memsw.max), memcg->memsw.failcnt);
1660 pr_info("kmem: usage %llukB, limit %llukB, failcnt %lu\n",
1661 K((u64)page_counter_read(&memcg->kmem)),
1662 K((u64)memcg->kmem.max), memcg->kmem.failcnt);
1665 pr_info("Memory cgroup stats for ");
1666 pr_cont_cgroup_path(memcg->css.cgroup);
1668 buf = memory_stat_format(memcg);
1676 * Return the memory (and swap, if configured) limit for a memcg.
1678 unsigned long mem_cgroup_get_max(struct mem_cgroup *memcg)
1680 unsigned long max = READ_ONCE(memcg->memory.max);
1682 if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) {
1683 if (mem_cgroup_swappiness(memcg))
1684 max += min(READ_ONCE(memcg->swap.max),
1685 (unsigned long)total_swap_pages);
1687 if (mem_cgroup_swappiness(memcg)) {
1688 /* Calculate swap excess capacity from memsw limit */
1689 unsigned long swap = READ_ONCE(memcg->memsw.max) - max;
1691 max += min(swap, (unsigned long)total_swap_pages);
1697 unsigned long mem_cgroup_size(struct mem_cgroup *memcg)
1699 return page_counter_read(&memcg->memory);
1702 static bool mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask,
1705 struct oom_control oc = {
1709 .gfp_mask = gfp_mask,
1714 if (mutex_lock_killable(&oom_lock))
1717 if (mem_cgroup_margin(memcg) >= (1 << order))
1721 * A few threads which were not waiting at mutex_lock_killable() can
1722 * fail to bail out. Therefore, check again after holding oom_lock.
1724 ret = should_force_charge() || out_of_memory(&oc);
1727 mutex_unlock(&oom_lock);
1731 static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg,
1734 unsigned long *total_scanned)
1736 struct mem_cgroup *victim = NULL;
1739 unsigned long excess;
1740 unsigned long nr_scanned;
1741 struct mem_cgroup_reclaim_cookie reclaim = {
1745 excess = soft_limit_excess(root_memcg);
1748 victim = mem_cgroup_iter(root_memcg, victim, &reclaim);
1753 * If we have not been able to reclaim
1754 * anything, it might because there are
1755 * no reclaimable pages under this hierarchy
1760 * We want to do more targeted reclaim.
1761 * excess >> 2 is not to excessive so as to
1762 * reclaim too much, nor too less that we keep
1763 * coming back to reclaim from this cgroup
1765 if (total >= (excess >> 2) ||
1766 (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS))
1771 total += mem_cgroup_shrink_node(victim, gfp_mask, false,
1772 pgdat, &nr_scanned);
1773 *total_scanned += nr_scanned;
1774 if (!soft_limit_excess(root_memcg))
1777 mem_cgroup_iter_break(root_memcg, victim);
1781 #ifdef CONFIG_LOCKDEP
1782 static struct lockdep_map memcg_oom_lock_dep_map = {
1783 .name = "memcg_oom_lock",
1787 static DEFINE_SPINLOCK(memcg_oom_lock);
1790 * Check OOM-Killer is already running under our hierarchy.
1791 * If someone is running, return false.
1793 static bool mem_cgroup_oom_trylock(struct mem_cgroup *memcg)
1795 struct mem_cgroup *iter, *failed = NULL;
1797 spin_lock(&memcg_oom_lock);
1799 for_each_mem_cgroup_tree(iter, memcg) {
1800 if (iter->oom_lock) {
1802 * this subtree of our hierarchy is already locked
1803 * so we cannot give a lock.
1806 mem_cgroup_iter_break(memcg, iter);
1809 iter->oom_lock = true;
1814 * OK, we failed to lock the whole subtree so we have
1815 * to clean up what we set up to the failing subtree
1817 for_each_mem_cgroup_tree(iter, memcg) {
1818 if (iter == failed) {
1819 mem_cgroup_iter_break(memcg, iter);
1822 iter->oom_lock = false;
1825 mutex_acquire(&memcg_oom_lock_dep_map, 0, 1, _RET_IP_);
1827 spin_unlock(&memcg_oom_lock);
1832 static void mem_cgroup_oom_unlock(struct mem_cgroup *memcg)
1834 struct mem_cgroup *iter;
1836 spin_lock(&memcg_oom_lock);
1837 mutex_release(&memcg_oom_lock_dep_map, _RET_IP_);
1838 for_each_mem_cgroup_tree(iter, memcg)
1839 iter->oom_lock = false;
1840 spin_unlock(&memcg_oom_lock);
1843 static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg)
1845 struct mem_cgroup *iter;
1847 spin_lock(&memcg_oom_lock);
1848 for_each_mem_cgroup_tree(iter, memcg)
1850 spin_unlock(&memcg_oom_lock);
1853 static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg)
1855 struct mem_cgroup *iter;
1858 * Be careful about under_oom underflows becase a child memcg
1859 * could have been added after mem_cgroup_mark_under_oom.
1861 spin_lock(&memcg_oom_lock);
1862 for_each_mem_cgroup_tree(iter, memcg)
1863 if (iter->under_oom > 0)
1865 spin_unlock(&memcg_oom_lock);
1868 static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq);
1870 struct oom_wait_info {
1871 struct mem_cgroup *memcg;
1872 wait_queue_entry_t wait;
1875 static int memcg_oom_wake_function(wait_queue_entry_t *wait,
1876 unsigned mode, int sync, void *arg)
1878 struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg;
1879 struct mem_cgroup *oom_wait_memcg;
1880 struct oom_wait_info *oom_wait_info;
1882 oom_wait_info = container_of(wait, struct oom_wait_info, wait);
1883 oom_wait_memcg = oom_wait_info->memcg;
1885 if (!mem_cgroup_is_descendant(wake_memcg, oom_wait_memcg) &&
1886 !mem_cgroup_is_descendant(oom_wait_memcg, wake_memcg))
1888 return autoremove_wake_function(wait, mode, sync, arg);
1891 static void memcg_oom_recover(struct mem_cgroup *memcg)
1894 * For the following lockless ->under_oom test, the only required
1895 * guarantee is that it must see the state asserted by an OOM when
1896 * this function is called as a result of userland actions
1897 * triggered by the notification of the OOM. This is trivially
1898 * achieved by invoking mem_cgroup_mark_under_oom() before
1899 * triggering notification.
1901 if (memcg && memcg->under_oom)
1902 __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg);
1912 static enum oom_status mem_cgroup_oom(struct mem_cgroup *memcg, gfp_t mask, int order)
1914 enum oom_status ret;
1917 if (order > PAGE_ALLOC_COSTLY_ORDER)
1920 memcg_memory_event(memcg, MEMCG_OOM);
1923 * We are in the middle of the charge context here, so we
1924 * don't want to block when potentially sitting on a callstack
1925 * that holds all kinds of filesystem and mm locks.
1927 * cgroup1 allows disabling the OOM killer and waiting for outside
1928 * handling until the charge can succeed; remember the context and put
1929 * the task to sleep at the end of the page fault when all locks are
1932 * On the other hand, in-kernel OOM killer allows for an async victim
1933 * memory reclaim (oom_reaper) and that means that we are not solely
1934 * relying on the oom victim to make a forward progress and we can
1935 * invoke the oom killer here.
1937 * Please note that mem_cgroup_out_of_memory might fail to find a
1938 * victim and then we have to bail out from the charge path.
1940 if (memcg->oom_kill_disable) {
1941 if (!current->in_user_fault)
1943 css_get(&memcg->css);
1944 current->memcg_in_oom = memcg;
1945 current->memcg_oom_gfp_mask = mask;
1946 current->memcg_oom_order = order;
1951 mem_cgroup_mark_under_oom(memcg);
1953 locked = mem_cgroup_oom_trylock(memcg);
1956 mem_cgroup_oom_notify(memcg);
1958 mem_cgroup_unmark_under_oom(memcg);
1959 if (mem_cgroup_out_of_memory(memcg, mask, order))
1965 mem_cgroup_oom_unlock(memcg);
1971 * mem_cgroup_oom_synchronize - complete memcg OOM handling
1972 * @handle: actually kill/wait or just clean up the OOM state
1974 * This has to be called at the end of a page fault if the memcg OOM
1975 * handler was enabled.
1977 * Memcg supports userspace OOM handling where failed allocations must
1978 * sleep on a waitqueue until the userspace task resolves the
1979 * situation. Sleeping directly in the charge context with all kinds
1980 * of locks held is not a good idea, instead we remember an OOM state
1981 * in the task and mem_cgroup_oom_synchronize() has to be called at
1982 * the end of the page fault to complete the OOM handling.
1984 * Returns %true if an ongoing memcg OOM situation was detected and
1985 * completed, %false otherwise.
1987 bool mem_cgroup_oom_synchronize(bool handle)
1989 struct mem_cgroup *memcg = current->memcg_in_oom;
1990 struct oom_wait_info owait;
1993 /* OOM is global, do not handle */
2000 owait.memcg = memcg;
2001 owait.wait.flags = 0;
2002 owait.wait.func = memcg_oom_wake_function;
2003 owait.wait.private = current;
2004 INIT_LIST_HEAD(&owait.wait.entry);
2006 prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE);
2007 mem_cgroup_mark_under_oom(memcg);
2009 locked = mem_cgroup_oom_trylock(memcg);
2012 mem_cgroup_oom_notify(memcg);
2014 if (locked && !memcg->oom_kill_disable) {
2015 mem_cgroup_unmark_under_oom(memcg);
2016 finish_wait(&memcg_oom_waitq, &owait.wait);
2017 mem_cgroup_out_of_memory(memcg, current->memcg_oom_gfp_mask,
2018 current->memcg_oom_order);
2021 mem_cgroup_unmark_under_oom(memcg);
2022 finish_wait(&memcg_oom_waitq, &owait.wait);
2026 mem_cgroup_oom_unlock(memcg);
2028 * There is no guarantee that an OOM-lock contender
2029 * sees the wakeups triggered by the OOM kill
2030 * uncharges. Wake any sleepers explicitely.
2032 memcg_oom_recover(memcg);
2035 current->memcg_in_oom = NULL;
2036 css_put(&memcg->css);
2041 * mem_cgroup_get_oom_group - get a memory cgroup to clean up after OOM
2042 * @victim: task to be killed by the OOM killer
2043 * @oom_domain: memcg in case of memcg OOM, NULL in case of system-wide OOM
2045 * Returns a pointer to a memory cgroup, which has to be cleaned up
2046 * by killing all belonging OOM-killable tasks.
2048 * Caller has to call mem_cgroup_put() on the returned non-NULL memcg.
2050 struct mem_cgroup *mem_cgroup_get_oom_group(struct task_struct *victim,
2051 struct mem_cgroup *oom_domain)
2053 struct mem_cgroup *oom_group = NULL;
2054 struct mem_cgroup *memcg;
2056 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys))
2060 oom_domain = root_mem_cgroup;
2064 memcg = mem_cgroup_from_task(victim);
2065 if (memcg == root_mem_cgroup)
2069 * If the victim task has been asynchronously moved to a different
2070 * memory cgroup, we might end up killing tasks outside oom_domain.
2071 * In this case it's better to ignore memory.group.oom.
2073 if (unlikely(!mem_cgroup_is_descendant(memcg, oom_domain)))
2077 * Traverse the memory cgroup hierarchy from the victim task's
2078 * cgroup up to the OOMing cgroup (or root) to find the
2079 * highest-level memory cgroup with oom.group set.
2081 for (; memcg; memcg = parent_mem_cgroup(memcg)) {
2082 if (memcg->oom_group)
2085 if (memcg == oom_domain)
2090 css_get(&oom_group->css);
2097 void mem_cgroup_print_oom_group(struct mem_cgroup *memcg)
2099 pr_info("Tasks in ");
2100 pr_cont_cgroup_path(memcg->css.cgroup);
2101 pr_cont(" are going to be killed due to memory.oom.group set\n");
2105 * lock_page_memcg - lock a page->mem_cgroup binding
2108 * This function protects unlocked LRU pages from being moved to
2111 * It ensures lifetime of the returned memcg. Caller is responsible
2112 * for the lifetime of the page; __unlock_page_memcg() is available
2113 * when @page might get freed inside the locked section.
2115 struct mem_cgroup *lock_page_memcg(struct page *page)
2117 struct page *head = compound_head(page); /* rmap on tail pages */
2118 struct mem_cgroup *memcg;
2119 unsigned long flags;
2122 * The RCU lock is held throughout the transaction. The fast
2123 * path can get away without acquiring the memcg->move_lock
2124 * because page moving starts with an RCU grace period.
2126 * The RCU lock also protects the memcg from being freed when
2127 * the page state that is going to change is the only thing
2128 * preventing the page itself from being freed. E.g. writeback
2129 * doesn't hold a page reference and relies on PG_writeback to
2130 * keep off truncation, migration and so forth.
2134 if (mem_cgroup_disabled())
2137 memcg = head->mem_cgroup;
2138 if (unlikely(!memcg))
2141 if (atomic_read(&memcg->moving_account) <= 0)
2144 spin_lock_irqsave(&memcg->move_lock, flags);
2145 if (memcg != head->mem_cgroup) {
2146 spin_unlock_irqrestore(&memcg->move_lock, flags);
2151 * When charge migration first begins, we can have locked and
2152 * unlocked page stat updates happening concurrently. Track
2153 * the task who has the lock for unlock_page_memcg().
2155 memcg->move_lock_task = current;
2156 memcg->move_lock_flags = flags;
2160 EXPORT_SYMBOL(lock_page_memcg);
2163 * __unlock_page_memcg - unlock and unpin a memcg
2166 * Unlock and unpin a memcg returned by lock_page_memcg().
2168 void __unlock_page_memcg(struct mem_cgroup *memcg)
2170 if (memcg && memcg->move_lock_task == current) {
2171 unsigned long flags = memcg->move_lock_flags;
2173 memcg->move_lock_task = NULL;
2174 memcg->move_lock_flags = 0;
2176 spin_unlock_irqrestore(&memcg->move_lock, flags);
2183 * unlock_page_memcg - unlock a page->mem_cgroup binding
2186 void unlock_page_memcg(struct page *page)
2188 struct page *head = compound_head(page);
2190 __unlock_page_memcg(head->mem_cgroup);
2192 EXPORT_SYMBOL(unlock_page_memcg);
2194 struct memcg_stock_pcp {
2195 struct mem_cgroup *cached; /* this never be root cgroup */
2196 unsigned int nr_pages;
2198 #ifdef CONFIG_MEMCG_KMEM
2199 struct obj_cgroup *cached_objcg;
2200 unsigned int nr_bytes;
2203 struct work_struct work;
2204 unsigned long flags;
2205 #define FLUSHING_CACHED_CHARGE 0
2207 static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock);
2208 static DEFINE_MUTEX(percpu_charge_mutex);
2210 #ifdef CONFIG_MEMCG_KMEM
2211 static void drain_obj_stock(struct memcg_stock_pcp *stock);
2212 static bool obj_stock_flush_required(struct memcg_stock_pcp *stock,
2213 struct mem_cgroup *root_memcg);
2216 static inline void drain_obj_stock(struct memcg_stock_pcp *stock)
2219 static bool obj_stock_flush_required(struct memcg_stock_pcp *stock,
2220 struct mem_cgroup *root_memcg)
2227 * consume_stock: Try to consume stocked charge on this cpu.
2228 * @memcg: memcg to consume from.
2229 * @nr_pages: how many pages to charge.
2231 * The charges will only happen if @memcg matches the current cpu's memcg
2232 * stock, and at least @nr_pages are available in that stock. Failure to
2233 * service an allocation will refill the stock.
2235 * returns true if successful, false otherwise.
2237 static bool consume_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2239 struct memcg_stock_pcp *stock;
2240 unsigned long flags;
2243 if (nr_pages > MEMCG_CHARGE_BATCH)
2246 local_irq_save(flags);
2248 stock = this_cpu_ptr(&memcg_stock);
2249 if (memcg == stock->cached && stock->nr_pages >= nr_pages) {
2250 stock->nr_pages -= nr_pages;
2254 local_irq_restore(flags);
2260 * Returns stocks cached in percpu and reset cached information.
2262 static void drain_stock(struct memcg_stock_pcp *stock)
2264 struct mem_cgroup *old = stock->cached;
2269 if (stock->nr_pages) {
2270 page_counter_uncharge(&old->memory, stock->nr_pages);
2271 if (do_memsw_account())
2272 page_counter_uncharge(&old->memsw, stock->nr_pages);
2273 stock->nr_pages = 0;
2277 stock->cached = NULL;
2280 static void drain_local_stock(struct work_struct *dummy)
2282 struct memcg_stock_pcp *stock;
2283 unsigned long flags;
2286 * The only protection from memory hotplug vs. drain_stock races is
2287 * that we always operate on local CPU stock here with IRQ disabled
2289 local_irq_save(flags);
2291 stock = this_cpu_ptr(&memcg_stock);
2292 drain_obj_stock(stock);
2294 clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags);
2296 local_irq_restore(flags);
2300 * Cache charges(val) to local per_cpu area.
2301 * This will be consumed by consume_stock() function, later.
2303 static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2305 struct memcg_stock_pcp *stock;
2306 unsigned long flags;
2308 local_irq_save(flags);
2310 stock = this_cpu_ptr(&memcg_stock);
2311 if (stock->cached != memcg) { /* reset if necessary */
2313 css_get(&memcg->css);
2314 stock->cached = memcg;
2316 stock->nr_pages += nr_pages;
2318 if (stock->nr_pages > MEMCG_CHARGE_BATCH)
2321 local_irq_restore(flags);
2325 * Drains all per-CPU charge caches for given root_memcg resp. subtree
2326 * of the hierarchy under it.
2328 static void drain_all_stock(struct mem_cgroup *root_memcg)
2332 /* If someone's already draining, avoid adding running more workers. */
2333 if (!mutex_trylock(&percpu_charge_mutex))
2336 * Notify other cpus that system-wide "drain" is running
2337 * We do not care about races with the cpu hotplug because cpu down
2338 * as well as workers from this path always operate on the local
2339 * per-cpu data. CPU up doesn't touch memcg_stock at all.
2342 for_each_online_cpu(cpu) {
2343 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2344 struct mem_cgroup *memcg;
2348 memcg = stock->cached;
2349 if (memcg && stock->nr_pages &&
2350 mem_cgroup_is_descendant(memcg, root_memcg))
2352 if (obj_stock_flush_required(stock, root_memcg))
2357 !test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) {
2359 drain_local_stock(&stock->work);
2361 schedule_work_on(cpu, &stock->work);
2365 mutex_unlock(&percpu_charge_mutex);
2368 static int memcg_hotplug_cpu_dead(unsigned int cpu)
2370 struct memcg_stock_pcp *stock;
2371 struct mem_cgroup *memcg, *mi;
2373 stock = &per_cpu(memcg_stock, cpu);
2376 for_each_mem_cgroup(memcg) {
2379 for (i = 0; i < MEMCG_NR_STAT; i++) {
2383 x = this_cpu_xchg(memcg->vmstats_percpu->stat[i], 0);
2385 for (mi = memcg; mi; mi = parent_mem_cgroup(mi))
2386 atomic_long_add(x, &memcg->vmstats[i]);
2388 if (i >= NR_VM_NODE_STAT_ITEMS)
2391 for_each_node(nid) {
2392 struct mem_cgroup_per_node *pn;
2394 pn = mem_cgroup_nodeinfo(memcg, nid);
2395 x = this_cpu_xchg(pn->lruvec_stat_cpu->count[i], 0);
2398 atomic_long_add(x, &pn->lruvec_stat[i]);
2399 } while ((pn = parent_nodeinfo(pn, nid)));
2403 for (i = 0; i < NR_VM_EVENT_ITEMS; i++) {
2406 x = this_cpu_xchg(memcg->vmstats_percpu->events[i], 0);
2408 for (mi = memcg; mi; mi = parent_mem_cgroup(mi))
2409 atomic_long_add(x, &memcg->vmevents[i]);
2416 static unsigned long reclaim_high(struct mem_cgroup *memcg,
2417 unsigned int nr_pages,
2420 unsigned long nr_reclaimed = 0;
2423 unsigned long pflags;
2425 if (page_counter_read(&memcg->memory) <=
2426 READ_ONCE(memcg->memory.high))
2429 memcg_memory_event(memcg, MEMCG_HIGH);
2431 psi_memstall_enter(&pflags);
2432 nr_reclaimed += try_to_free_mem_cgroup_pages(memcg, nr_pages,
2434 psi_memstall_leave(&pflags);
2435 } while ((memcg = parent_mem_cgroup(memcg)) &&
2436 !mem_cgroup_is_root(memcg));
2438 return nr_reclaimed;
2441 static void high_work_func(struct work_struct *work)
2443 struct mem_cgroup *memcg;
2445 memcg = container_of(work, struct mem_cgroup, high_work);
2446 reclaim_high(memcg, MEMCG_CHARGE_BATCH, GFP_KERNEL);
2450 * Clamp the maximum sleep time per allocation batch to 2 seconds. This is
2451 * enough to still cause a significant slowdown in most cases, while still
2452 * allowing diagnostics and tracing to proceed without becoming stuck.
2454 #define MEMCG_MAX_HIGH_DELAY_JIFFIES (2UL*HZ)
2457 * When calculating the delay, we use these either side of the exponentiation to
2458 * maintain precision and scale to a reasonable number of jiffies (see the table
2461 * - MEMCG_DELAY_PRECISION_SHIFT: Extra precision bits while translating the
2462 * overage ratio to a delay.
2463 * - MEMCG_DELAY_SCALING_SHIFT: The number of bits to scale down the
2464 * proposed penalty in order to reduce to a reasonable number of jiffies, and
2465 * to produce a reasonable delay curve.
2467 * MEMCG_DELAY_SCALING_SHIFT just happens to be a number that produces a
2468 * reasonable delay curve compared to precision-adjusted overage, not
2469 * penalising heavily at first, but still making sure that growth beyond the
2470 * limit penalises misbehaviour cgroups by slowing them down exponentially. For
2471 * example, with a high of 100 megabytes:
2473 * +-------+------------------------+
2474 * | usage | time to allocate in ms |
2475 * +-------+------------------------+
2497 * +-------+------------------------+
2499 #define MEMCG_DELAY_PRECISION_SHIFT 20
2500 #define MEMCG_DELAY_SCALING_SHIFT 14
2502 static u64 calculate_overage(unsigned long usage, unsigned long high)
2510 * Prevent division by 0 in overage calculation by acting as if
2511 * it was a threshold of 1 page
2513 high = max(high, 1UL);
2515 overage = usage - high;
2516 overage <<= MEMCG_DELAY_PRECISION_SHIFT;
2517 return div64_u64(overage, high);
2520 static u64 mem_find_max_overage(struct mem_cgroup *memcg)
2522 u64 overage, max_overage = 0;
2525 overage = calculate_overage(page_counter_read(&memcg->memory),
2526 READ_ONCE(memcg->memory.high));
2527 max_overage = max(overage, max_overage);
2528 } while ((memcg = parent_mem_cgroup(memcg)) &&
2529 !mem_cgroup_is_root(memcg));
2534 static u64 swap_find_max_overage(struct mem_cgroup *memcg)
2536 u64 overage, max_overage = 0;
2539 overage = calculate_overage(page_counter_read(&memcg->swap),
2540 READ_ONCE(memcg->swap.high));
2542 memcg_memory_event(memcg, MEMCG_SWAP_HIGH);
2543 max_overage = max(overage, max_overage);
2544 } while ((memcg = parent_mem_cgroup(memcg)) &&
2545 !mem_cgroup_is_root(memcg));
2551 * Get the number of jiffies that we should penalise a mischievous cgroup which
2552 * is exceeding its memory.high by checking both it and its ancestors.
2554 static unsigned long calculate_high_delay(struct mem_cgroup *memcg,
2555 unsigned int nr_pages,
2558 unsigned long penalty_jiffies;
2564 * We use overage compared to memory.high to calculate the number of
2565 * jiffies to sleep (penalty_jiffies). Ideally this value should be
2566 * fairly lenient on small overages, and increasingly harsh when the
2567 * memcg in question makes it clear that it has no intention of stopping
2568 * its crazy behaviour, so we exponentially increase the delay based on
2571 penalty_jiffies = max_overage * max_overage * HZ;
2572 penalty_jiffies >>= MEMCG_DELAY_PRECISION_SHIFT;
2573 penalty_jiffies >>= MEMCG_DELAY_SCALING_SHIFT;
2576 * Factor in the task's own contribution to the overage, such that four
2577 * N-sized allocations are throttled approximately the same as one
2578 * 4N-sized allocation.
2580 * MEMCG_CHARGE_BATCH pages is nominal, so work out how much smaller or
2581 * larger the current charge patch is than that.
2583 return penalty_jiffies * nr_pages / MEMCG_CHARGE_BATCH;
2587 * Scheduled by try_charge() to be executed from the userland return path
2588 * and reclaims memory over the high limit.
2590 void mem_cgroup_handle_over_high(void)
2592 unsigned long penalty_jiffies;
2593 unsigned long pflags;
2594 unsigned long nr_reclaimed;
2595 unsigned int nr_pages = current->memcg_nr_pages_over_high;
2596 int nr_retries = MAX_RECLAIM_RETRIES;
2597 struct mem_cgroup *memcg;
2598 bool in_retry = false;
2600 if (likely(!nr_pages))
2603 memcg = get_mem_cgroup_from_mm(current->mm);
2604 current->memcg_nr_pages_over_high = 0;
2608 * The allocating task should reclaim at least the batch size, but for
2609 * subsequent retries we only want to do what's necessary to prevent oom
2610 * or breaching resource isolation.
2612 * This is distinct from memory.max or page allocator behaviour because
2613 * memory.high is currently batched, whereas memory.max and the page
2614 * allocator run every time an allocation is made.
2616 nr_reclaimed = reclaim_high(memcg,
2617 in_retry ? SWAP_CLUSTER_MAX : nr_pages,
2621 * memory.high is breached and reclaim is unable to keep up. Throttle
2622 * allocators proactively to slow down excessive growth.
2624 penalty_jiffies = calculate_high_delay(memcg, nr_pages,
2625 mem_find_max_overage(memcg));
2627 penalty_jiffies += calculate_high_delay(memcg, nr_pages,
2628 swap_find_max_overage(memcg));
2631 * Clamp the max delay per usermode return so as to still keep the
2632 * application moving forwards and also permit diagnostics, albeit
2635 penalty_jiffies = min(penalty_jiffies, MEMCG_MAX_HIGH_DELAY_JIFFIES);
2638 * Don't sleep if the amount of jiffies this memcg owes us is so low
2639 * that it's not even worth doing, in an attempt to be nice to those who
2640 * go only a small amount over their memory.high value and maybe haven't
2641 * been aggressively reclaimed enough yet.
2643 if (penalty_jiffies <= HZ / 100)
2647 * If reclaim is making forward progress but we're still over
2648 * memory.high, we want to encourage that rather than doing allocator
2651 if (nr_reclaimed || nr_retries--) {
2657 * If we exit early, we're guaranteed to die (since
2658 * schedule_timeout_killable sets TASK_KILLABLE). This means we don't
2659 * need to account for any ill-begotten jiffies to pay them off later.
2661 psi_memstall_enter(&pflags);
2662 schedule_timeout_killable(penalty_jiffies);
2663 psi_memstall_leave(&pflags);
2666 css_put(&memcg->css);
2669 static int try_charge(struct mem_cgroup *memcg, gfp_t gfp_mask,
2670 unsigned int nr_pages)
2672 unsigned int batch = max(MEMCG_CHARGE_BATCH, nr_pages);
2673 int nr_retries = MAX_RECLAIM_RETRIES;
2674 struct mem_cgroup *mem_over_limit;
2675 struct page_counter *counter;
2676 enum oom_status oom_status;
2677 unsigned long nr_reclaimed;
2678 bool may_swap = true;
2679 bool drained = false;
2680 unsigned long pflags;
2682 if (mem_cgroup_is_root(memcg))
2685 if (consume_stock(memcg, nr_pages))
2688 if (!do_memsw_account() ||
2689 page_counter_try_charge(&memcg->memsw, batch, &counter)) {
2690 if (page_counter_try_charge(&memcg->memory, batch, &counter))
2692 if (do_memsw_account())
2693 page_counter_uncharge(&memcg->memsw, batch);
2694 mem_over_limit = mem_cgroup_from_counter(counter, memory);
2696 mem_over_limit = mem_cgroup_from_counter(counter, memsw);
2700 if (batch > nr_pages) {
2706 * Memcg doesn't have a dedicated reserve for atomic
2707 * allocations. But like the global atomic pool, we need to
2708 * put the burden of reclaim on regular allocation requests
2709 * and let these go through as privileged allocations.
2711 if (gfp_mask & __GFP_ATOMIC)
2715 * Unlike in global OOM situations, memcg is not in a physical
2716 * memory shortage. Allow dying and OOM-killed tasks to
2717 * bypass the last charges so that they can exit quickly and
2718 * free their memory.
2720 if (unlikely(should_force_charge()))
2724 * Prevent unbounded recursion when reclaim operations need to
2725 * allocate memory. This might exceed the limits temporarily,
2726 * but we prefer facilitating memory reclaim and getting back
2727 * under the limit over triggering OOM kills in these cases.
2729 if (unlikely(current->flags & PF_MEMALLOC))
2732 if (unlikely(task_in_memcg_oom(current)))
2735 if (!gfpflags_allow_blocking(gfp_mask))
2738 memcg_memory_event(mem_over_limit, MEMCG_MAX);
2740 psi_memstall_enter(&pflags);
2741 nr_reclaimed = try_to_free_mem_cgroup_pages(mem_over_limit, nr_pages,
2742 gfp_mask, may_swap);
2743 psi_memstall_leave(&pflags);
2745 if (mem_cgroup_margin(mem_over_limit) >= nr_pages)
2749 drain_all_stock(mem_over_limit);
2754 if (gfp_mask & __GFP_NORETRY)
2757 * Even though the limit is exceeded at this point, reclaim
2758 * may have been able to free some pages. Retry the charge
2759 * before killing the task.
2761 * Only for regular pages, though: huge pages are rather
2762 * unlikely to succeed so close to the limit, and we fall back
2763 * to regular pages anyway in case of failure.
2765 if (nr_reclaimed && nr_pages <= (1 << PAGE_ALLOC_COSTLY_ORDER))
2768 * At task move, charge accounts can be doubly counted. So, it's
2769 * better to wait until the end of task_move if something is going on.
2771 if (mem_cgroup_wait_acct_move(mem_over_limit))
2777 if (gfp_mask & __GFP_RETRY_MAYFAIL)
2780 if (gfp_mask & __GFP_NOFAIL)
2783 if (fatal_signal_pending(current))
2787 * keep retrying as long as the memcg oom killer is able to make
2788 * a forward progress or bypass the charge if the oom killer
2789 * couldn't make any progress.
2791 oom_status = mem_cgroup_oom(mem_over_limit, gfp_mask,
2792 get_order(nr_pages * PAGE_SIZE));
2793 switch (oom_status) {
2795 nr_retries = MAX_RECLAIM_RETRIES;
2803 if (!(gfp_mask & __GFP_NOFAIL))
2807 * The allocation either can't fail or will lead to more memory
2808 * being freed very soon. Allow memory usage go over the limit
2809 * temporarily by force charging it.
2811 page_counter_charge(&memcg->memory, nr_pages);
2812 if (do_memsw_account())
2813 page_counter_charge(&memcg->memsw, nr_pages);
2818 if (batch > nr_pages)
2819 refill_stock(memcg, batch - nr_pages);
2822 * If the hierarchy is above the normal consumption range, schedule
2823 * reclaim on returning to userland. We can perform reclaim here
2824 * if __GFP_RECLAIM but let's always punt for simplicity and so that
2825 * GFP_KERNEL can consistently be used during reclaim. @memcg is
2826 * not recorded as it most likely matches current's and won't
2827 * change in the meantime. As high limit is checked again before
2828 * reclaim, the cost of mismatch is negligible.
2831 bool mem_high, swap_high;
2833 mem_high = page_counter_read(&memcg->memory) >
2834 READ_ONCE(memcg->memory.high);
2835 swap_high = page_counter_read(&memcg->swap) >
2836 READ_ONCE(memcg->swap.high);
2838 /* Don't bother a random interrupted task */
2839 if (in_interrupt()) {
2841 schedule_work(&memcg->high_work);
2847 if (mem_high || swap_high) {
2849 * The allocating tasks in this cgroup will need to do
2850 * reclaim or be throttled to prevent further growth
2851 * of the memory or swap footprints.
2853 * Target some best-effort fairness between the tasks,
2854 * and distribute reclaim work and delay penalties
2855 * based on how much each task is actually allocating.
2857 current->memcg_nr_pages_over_high += batch;
2858 set_notify_resume(current);
2861 } while ((memcg = parent_mem_cgroup(memcg)));
2866 #if defined(CONFIG_MEMCG_KMEM) || defined(CONFIG_MMU)
2867 static void cancel_charge(struct mem_cgroup *memcg, unsigned int nr_pages)
2869 if (mem_cgroup_is_root(memcg))
2872 page_counter_uncharge(&memcg->memory, nr_pages);
2873 if (do_memsw_account())
2874 page_counter_uncharge(&memcg->memsw, nr_pages);
2878 static void commit_charge(struct page *page, struct mem_cgroup *memcg)
2880 VM_BUG_ON_PAGE(page->mem_cgroup, page);
2882 * Any of the following ensures page->mem_cgroup stability:
2886 * - lock_page_memcg()
2887 * - exclusive reference
2889 page->mem_cgroup = memcg;
2892 #ifdef CONFIG_MEMCG_KMEM
2893 int memcg_alloc_page_obj_cgroups(struct page *page, struct kmem_cache *s,
2896 unsigned int objects = objs_per_slab_page(s, page);
2899 vec = kcalloc_node(objects, sizeof(struct obj_cgroup *), gfp,
2904 if (cmpxchg(&page->obj_cgroups, NULL,
2905 (struct obj_cgroup **) ((unsigned long)vec | 0x1UL)))
2908 kmemleak_not_leak(vec);
2914 * Returns a pointer to the memory cgroup to which the kernel object is charged.
2916 * The caller must ensure the memcg lifetime, e.g. by taking rcu_read_lock(),
2917 * cgroup_mutex, etc.
2919 struct mem_cgroup *mem_cgroup_from_obj(void *p)
2923 if (mem_cgroup_disabled())
2926 page = virt_to_head_page(p);
2929 * If page->mem_cgroup is set, it's either a simple mem_cgroup pointer
2930 * or a pointer to obj_cgroup vector. In the latter case the lowest
2931 * bit of the pointer is set.
2932 * The page->mem_cgroup pointer can be asynchronously changed
2933 * from NULL to (obj_cgroup_vec | 0x1UL), but can't be changed
2934 * from a valid memcg pointer to objcg vector or back.
2936 if (!page->mem_cgroup)
2940 * Slab objects are accounted individually, not per-page.
2941 * Memcg membership data for each individual object is saved in
2942 * the page->obj_cgroups.
2944 if (page_has_obj_cgroups(page)) {
2945 struct obj_cgroup *objcg;
2948 off = obj_to_index(page->slab_cache, page, p);
2949 objcg = page_obj_cgroups(page)[off];
2951 return obj_cgroup_memcg(objcg);
2956 /* All other pages use page->mem_cgroup */
2957 return page->mem_cgroup;
2960 __always_inline struct obj_cgroup *get_obj_cgroup_from_current(void)
2962 struct obj_cgroup *objcg = NULL;
2963 struct mem_cgroup *memcg;
2965 if (memcg_kmem_bypass())
2969 if (unlikely(active_memcg()))
2970 memcg = active_memcg();
2972 memcg = mem_cgroup_from_task(current);
2974 for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg)) {
2975 objcg = rcu_dereference(memcg->objcg);
2976 if (objcg && obj_cgroup_tryget(objcg))
2985 static int memcg_alloc_cache_id(void)
2990 id = ida_simple_get(&memcg_cache_ida,
2991 0, MEMCG_CACHES_MAX_SIZE, GFP_KERNEL);
2995 if (id < memcg_nr_cache_ids)
2999 * There's no space for the new id in memcg_caches arrays,
3000 * so we have to grow them.
3002 down_write(&memcg_cache_ids_sem);
3004 size = 2 * (id + 1);
3005 if (size < MEMCG_CACHES_MIN_SIZE)
3006 size = MEMCG_CACHES_MIN_SIZE;
3007 else if (size > MEMCG_CACHES_MAX_SIZE)
3008 size = MEMCG_CACHES_MAX_SIZE;
3010 err = memcg_update_all_list_lrus(size);
3012 memcg_nr_cache_ids = size;
3014 up_write(&memcg_cache_ids_sem);
3017 ida_simple_remove(&memcg_cache_ida, id);
3023 static void memcg_free_cache_id(int id)
3025 ida_simple_remove(&memcg_cache_ida, id);
3029 * __memcg_kmem_charge: charge a number of kernel pages to a memcg
3030 * @memcg: memory cgroup to charge
3031 * @gfp: reclaim mode
3032 * @nr_pages: number of pages to charge
3034 * Returns 0 on success, an error code on failure.
3036 int __memcg_kmem_charge(struct mem_cgroup *memcg, gfp_t gfp,
3037 unsigned int nr_pages)
3039 struct page_counter *counter;
3042 ret = try_charge(memcg, gfp, nr_pages);
3046 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) &&
3047 !page_counter_try_charge(&memcg->kmem, nr_pages, &counter)) {
3050 * Enforce __GFP_NOFAIL allocation because callers are not
3051 * prepared to see failures and likely do not have any failure
3054 if (gfp & __GFP_NOFAIL) {
3055 page_counter_charge(&memcg->kmem, nr_pages);
3058 cancel_charge(memcg, nr_pages);
3065 * __memcg_kmem_uncharge: uncharge a number of kernel pages from a memcg
3066 * @memcg: memcg to uncharge
3067 * @nr_pages: number of pages to uncharge
3069 void __memcg_kmem_uncharge(struct mem_cgroup *memcg, unsigned int nr_pages)
3071 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys))
3072 page_counter_uncharge(&memcg->kmem, nr_pages);
3074 page_counter_uncharge(&memcg->memory, nr_pages);
3075 if (do_memsw_account())
3076 page_counter_uncharge(&memcg->memsw, nr_pages);
3080 * __memcg_kmem_charge_page: charge a kmem page to the current memory cgroup
3081 * @page: page to charge
3082 * @gfp: reclaim mode
3083 * @order: allocation order
3085 * Returns 0 on success, an error code on failure.
3087 int __memcg_kmem_charge_page(struct page *page, gfp_t gfp, int order)
3089 struct mem_cgroup *memcg;
3092 memcg = get_mem_cgroup_from_current();
3093 if (memcg && !mem_cgroup_is_root(memcg)) {
3094 ret = __memcg_kmem_charge(memcg, gfp, 1 << order);
3096 page->mem_cgroup = memcg;
3097 __SetPageKmemcg(page);
3100 css_put(&memcg->css);
3106 * __memcg_kmem_uncharge_page: uncharge a kmem page
3107 * @page: page to uncharge
3108 * @order: allocation order
3110 void __memcg_kmem_uncharge_page(struct page *page, int order)
3112 struct mem_cgroup *memcg = page->mem_cgroup;
3113 unsigned int nr_pages = 1 << order;
3118 VM_BUG_ON_PAGE(mem_cgroup_is_root(memcg), page);
3119 __memcg_kmem_uncharge(memcg, nr_pages);
3120 page->mem_cgroup = NULL;
3121 css_put(&memcg->css);
3123 /* slab pages do not have PageKmemcg flag set */
3124 if (PageKmemcg(page))
3125 __ClearPageKmemcg(page);
3128 static bool consume_obj_stock(struct obj_cgroup *objcg, unsigned int nr_bytes)
3130 struct memcg_stock_pcp *stock;
3131 unsigned long flags;
3134 local_irq_save(flags);
3136 stock = this_cpu_ptr(&memcg_stock);
3137 if (objcg == stock->cached_objcg && stock->nr_bytes >= nr_bytes) {
3138 stock->nr_bytes -= nr_bytes;
3142 local_irq_restore(flags);
3147 static void drain_obj_stock(struct memcg_stock_pcp *stock)
3149 struct obj_cgroup *old = stock->cached_objcg;
3154 if (stock->nr_bytes) {
3155 unsigned int nr_pages = stock->nr_bytes >> PAGE_SHIFT;
3156 unsigned int nr_bytes = stock->nr_bytes & (PAGE_SIZE - 1);
3160 __memcg_kmem_uncharge(obj_cgroup_memcg(old), nr_pages);
3165 * The leftover is flushed to the centralized per-memcg value.
3166 * On the next attempt to refill obj stock it will be moved
3167 * to a per-cpu stock (probably, on an other CPU), see
3168 * refill_obj_stock().
3170 * How often it's flushed is a trade-off between the memory
3171 * limit enforcement accuracy and potential CPU contention,
3172 * so it might be changed in the future.
3174 atomic_add(nr_bytes, &old->nr_charged_bytes);
3175 stock->nr_bytes = 0;
3178 obj_cgroup_put(old);
3179 stock->cached_objcg = NULL;
3182 static bool obj_stock_flush_required(struct memcg_stock_pcp *stock,
3183 struct mem_cgroup *root_memcg)
3185 struct mem_cgroup *memcg;
3187 if (stock->cached_objcg) {
3188 memcg = obj_cgroup_memcg(stock->cached_objcg);
3189 if (memcg && mem_cgroup_is_descendant(memcg, root_memcg))
3196 static void refill_obj_stock(struct obj_cgroup *objcg, unsigned int nr_bytes)
3198 struct memcg_stock_pcp *stock;
3199 unsigned long flags;
3201 local_irq_save(flags);
3203 stock = this_cpu_ptr(&memcg_stock);
3204 if (stock->cached_objcg != objcg) { /* reset if necessary */
3205 drain_obj_stock(stock);
3206 obj_cgroup_get(objcg);
3207 stock->cached_objcg = objcg;
3208 stock->nr_bytes = atomic_xchg(&objcg->nr_charged_bytes, 0);
3210 stock->nr_bytes += nr_bytes;
3212 if (stock->nr_bytes > PAGE_SIZE)
3213 drain_obj_stock(stock);
3215 local_irq_restore(flags);
3218 int obj_cgroup_charge(struct obj_cgroup *objcg, gfp_t gfp, size_t size)
3220 struct mem_cgroup *memcg;
3221 unsigned int nr_pages, nr_bytes;
3224 if (consume_obj_stock(objcg, size))
3228 * In theory, memcg->nr_charged_bytes can have enough
3229 * pre-charged bytes to satisfy the allocation. However,
3230 * flushing memcg->nr_charged_bytes requires two atomic
3231 * operations, and memcg->nr_charged_bytes can't be big,
3232 * so it's better to ignore it and try grab some new pages.
3233 * memcg->nr_charged_bytes will be flushed in
3234 * refill_obj_stock(), called from this function or
3235 * independently later.
3238 memcg = obj_cgroup_memcg(objcg);
3239 css_get(&memcg->css);
3242 nr_pages = size >> PAGE_SHIFT;
3243 nr_bytes = size & (PAGE_SIZE - 1);
3248 ret = __memcg_kmem_charge(memcg, gfp, nr_pages);
3249 if (!ret && nr_bytes)
3250 refill_obj_stock(objcg, PAGE_SIZE - nr_bytes);
3252 css_put(&memcg->css);
3256 void obj_cgroup_uncharge(struct obj_cgroup *objcg, size_t size)
3258 refill_obj_stock(objcg, size);
3261 #endif /* CONFIG_MEMCG_KMEM */
3263 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
3266 * Because tail pages are not marked as "used", set it. We're under
3267 * pgdat->lru_lock and migration entries setup in all page mappings.
3269 void mem_cgroup_split_huge_fixup(struct page *head)
3271 struct mem_cgroup *memcg = head->mem_cgroup;
3274 if (mem_cgroup_disabled())
3277 for (i = 1; i < HPAGE_PMD_NR; i++) {
3278 css_get(&memcg->css);
3279 head[i].mem_cgroup = memcg;
3282 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
3284 #ifdef CONFIG_MEMCG_SWAP
3286 * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record.
3287 * @entry: swap entry to be moved
3288 * @from: mem_cgroup which the entry is moved from
3289 * @to: mem_cgroup which the entry is moved to
3291 * It succeeds only when the swap_cgroup's record for this entry is the same
3292 * as the mem_cgroup's id of @from.
3294 * Returns 0 on success, -EINVAL on failure.
3296 * The caller must have charged to @to, IOW, called page_counter_charge() about
3297 * both res and memsw, and called css_get().
3299 static int mem_cgroup_move_swap_account(swp_entry_t entry,
3300 struct mem_cgroup *from, struct mem_cgroup *to)
3302 unsigned short old_id, new_id;
3304 old_id = mem_cgroup_id(from);
3305 new_id = mem_cgroup_id(to);
3307 if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) {
3308 mod_memcg_state(from, MEMCG_SWAP, -1);
3309 mod_memcg_state(to, MEMCG_SWAP, 1);
3315 static inline int mem_cgroup_move_swap_account(swp_entry_t entry,
3316 struct mem_cgroup *from, struct mem_cgroup *to)
3322 static DEFINE_MUTEX(memcg_max_mutex);
3324 static int mem_cgroup_resize_max(struct mem_cgroup *memcg,
3325 unsigned long max, bool memsw)
3327 bool enlarge = false;
3328 bool drained = false;
3330 bool limits_invariant;
3331 struct page_counter *counter = memsw ? &memcg->memsw : &memcg->memory;
3334 if (signal_pending(current)) {
3339 mutex_lock(&memcg_max_mutex);
3341 * Make sure that the new limit (memsw or memory limit) doesn't
3342 * break our basic invariant rule memory.max <= memsw.max.
3344 limits_invariant = memsw ? max >= READ_ONCE(memcg->memory.max) :
3345 max <= memcg->memsw.max;
3346 if (!limits_invariant) {
3347 mutex_unlock(&memcg_max_mutex);
3351 if (max > counter->max)
3353 ret = page_counter_set_max(counter, max);
3354 mutex_unlock(&memcg_max_mutex);
3360 drain_all_stock(memcg);
3365 if (!try_to_free_mem_cgroup_pages(memcg, 1,
3366 GFP_KERNEL, !memsw)) {
3372 if (!ret && enlarge)
3373 memcg_oom_recover(memcg);
3378 unsigned long mem_cgroup_soft_limit_reclaim(pg_data_t *pgdat, int order,
3380 unsigned long *total_scanned)
3382 unsigned long nr_reclaimed = 0;
3383 struct mem_cgroup_per_node *mz, *next_mz = NULL;
3384 unsigned long reclaimed;
3386 struct mem_cgroup_tree_per_node *mctz;
3387 unsigned long excess;
3388 unsigned long nr_scanned;
3393 mctz = soft_limit_tree_node(pgdat->node_id);
3396 * Do not even bother to check the largest node if the root
3397 * is empty. Do it lockless to prevent lock bouncing. Races
3398 * are acceptable as soft limit is best effort anyway.
3400 if (!mctz || RB_EMPTY_ROOT(&mctz->rb_root))
3404 * This loop can run a while, specially if mem_cgroup's continuously
3405 * keep exceeding their soft limit and putting the system under
3412 mz = mem_cgroup_largest_soft_limit_node(mctz);
3417 reclaimed = mem_cgroup_soft_reclaim(mz->memcg, pgdat,
3418 gfp_mask, &nr_scanned);
3419 nr_reclaimed += reclaimed;
3420 *total_scanned += nr_scanned;
3421 spin_lock_irq(&mctz->lock);
3422 __mem_cgroup_remove_exceeded(mz, mctz);
3425 * If we failed to reclaim anything from this memory cgroup
3426 * it is time to move on to the next cgroup
3430 next_mz = __mem_cgroup_largest_soft_limit_node(mctz);
3432 excess = soft_limit_excess(mz->memcg);
3434 * One school of thought says that we should not add
3435 * back the node to the tree if reclaim returns 0.
3436 * But our reclaim could return 0, simply because due
3437 * to priority we are exposing a smaller subset of
3438 * memory to reclaim from. Consider this as a longer
3441 /* If excess == 0, no tree ops */
3442 __mem_cgroup_insert_exceeded(mz, mctz, excess);
3443 spin_unlock_irq(&mctz->lock);
3444 css_put(&mz->memcg->css);
3447 * Could not reclaim anything and there are no more
3448 * mem cgroups to try or we seem to be looping without
3449 * reclaiming anything.
3451 if (!nr_reclaimed &&
3453 loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS))
3455 } while (!nr_reclaimed);
3457 css_put(&next_mz->memcg->css);
3458 return nr_reclaimed;
3462 * Test whether @memcg has children, dead or alive. Note that this
3463 * function doesn't care whether @memcg has use_hierarchy enabled and
3464 * returns %true if there are child csses according to the cgroup
3465 * hierarchy. Testing use_hierarchy is the caller's responsibility.
3467 static inline bool memcg_has_children(struct mem_cgroup *memcg)
3472 ret = css_next_child(NULL, &memcg->css);
3478 * Reclaims as many pages from the given memcg as possible.
3480 * Caller is responsible for holding css reference for memcg.
3482 static int mem_cgroup_force_empty(struct mem_cgroup *memcg)
3484 int nr_retries = MAX_RECLAIM_RETRIES;
3486 /* we call try-to-free pages for make this cgroup empty */
3487 lru_add_drain_all();
3489 drain_all_stock(memcg);
3491 /* try to free all pages in this cgroup */
3492 while (nr_retries && page_counter_read(&memcg->memory)) {
3495 if (signal_pending(current))
3498 progress = try_to_free_mem_cgroup_pages(memcg, 1,
3502 /* maybe some writeback is necessary */
3503 congestion_wait(BLK_RW_ASYNC, HZ/10);
3511 static ssize_t mem_cgroup_force_empty_write(struct kernfs_open_file *of,
3512 char *buf, size_t nbytes,
3515 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
3517 if (mem_cgroup_is_root(memcg))
3519 return mem_cgroup_force_empty(memcg) ?: nbytes;
3522 static u64 mem_cgroup_hierarchy_read(struct cgroup_subsys_state *css,
3525 return mem_cgroup_from_css(css)->use_hierarchy;
3528 static int mem_cgroup_hierarchy_write(struct cgroup_subsys_state *css,
3529 struct cftype *cft, u64 val)
3532 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
3533 struct mem_cgroup *parent_memcg = mem_cgroup_from_css(memcg->css.parent);
3535 if (memcg->use_hierarchy == val)
3539 * If parent's use_hierarchy is set, we can't make any modifications
3540 * in the child subtrees. If it is unset, then the change can
3541 * occur, provided the current cgroup has no children.
3543 * For the root cgroup, parent_mem is NULL, we allow value to be
3544 * set if there are no children.
3546 if ((!parent_memcg || !parent_memcg->use_hierarchy) &&
3547 (val == 1 || val == 0)) {
3548 if (!memcg_has_children(memcg))
3549 memcg->use_hierarchy = val;
3558 static unsigned long mem_cgroup_usage(struct mem_cgroup *memcg, bool swap)
3562 if (mem_cgroup_is_root(memcg)) {
3563 val = memcg_page_state(memcg, NR_FILE_PAGES) +
3564 memcg_page_state(memcg, NR_ANON_MAPPED);
3566 val += memcg_page_state(memcg, MEMCG_SWAP);
3569 val = page_counter_read(&memcg->memory);
3571 val = page_counter_read(&memcg->memsw);
3584 static u64 mem_cgroup_read_u64(struct cgroup_subsys_state *css,
3587 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
3588 struct page_counter *counter;
3590 switch (MEMFILE_TYPE(cft->private)) {
3592 counter = &memcg->memory;
3595 counter = &memcg->memsw;
3598 counter = &memcg->kmem;
3601 counter = &memcg->tcpmem;
3607 switch (MEMFILE_ATTR(cft->private)) {
3609 if (counter == &memcg->memory)
3610 return (u64)mem_cgroup_usage(memcg, false) * PAGE_SIZE;
3611 if (counter == &memcg->memsw)
3612 return (u64)mem_cgroup_usage(memcg, true) * PAGE_SIZE;
3613 return (u64)page_counter_read(counter) * PAGE_SIZE;
3615 return (u64)counter->max * PAGE_SIZE;
3617 return (u64)counter->watermark * PAGE_SIZE;
3619 return counter->failcnt;
3620 case RES_SOFT_LIMIT:
3621 return (u64)memcg->soft_limit * PAGE_SIZE;
3627 static void memcg_flush_percpu_vmstats(struct mem_cgroup *memcg)
3629 unsigned long stat[MEMCG_NR_STAT] = {0};
3630 struct mem_cgroup *mi;
3633 for_each_online_cpu(cpu)
3634 for (i = 0; i < MEMCG_NR_STAT; i++)
3635 stat[i] += per_cpu(memcg->vmstats_percpu->stat[i], cpu);
3637 for (mi = memcg; mi; mi = parent_mem_cgroup(mi))
3638 for (i = 0; i < MEMCG_NR_STAT; i++)
3639 atomic_long_add(stat[i], &mi->vmstats[i]);
3641 for_each_node(node) {
3642 struct mem_cgroup_per_node *pn = memcg->nodeinfo[node];
3643 struct mem_cgroup_per_node *pi;
3645 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++)
3648 for_each_online_cpu(cpu)
3649 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++)
3651 pn->lruvec_stat_cpu->count[i], cpu);
3653 for (pi = pn; pi; pi = parent_nodeinfo(pi, node))
3654 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++)
3655 atomic_long_add(stat[i], &pi->lruvec_stat[i]);
3659 static void memcg_flush_percpu_vmevents(struct mem_cgroup *memcg)
3661 unsigned long events[NR_VM_EVENT_ITEMS];
3662 struct mem_cgroup *mi;
3665 for (i = 0; i < NR_VM_EVENT_ITEMS; i++)
3668 for_each_online_cpu(cpu)
3669 for (i = 0; i < NR_VM_EVENT_ITEMS; i++)
3670 events[i] += per_cpu(memcg->vmstats_percpu->events[i],
3673 for (mi = memcg; mi; mi = parent_mem_cgroup(mi))
3674 for (i = 0; i < NR_VM_EVENT_ITEMS; i++)
3675 atomic_long_add(events[i], &mi->vmevents[i]);
3678 #ifdef CONFIG_MEMCG_KMEM
3679 static int memcg_online_kmem(struct mem_cgroup *memcg)
3681 struct obj_cgroup *objcg;
3684 if (cgroup_memory_nokmem)
3687 BUG_ON(memcg->kmemcg_id >= 0);
3688 BUG_ON(memcg->kmem_state);
3690 memcg_id = memcg_alloc_cache_id();
3694 objcg = obj_cgroup_alloc();
3696 memcg_free_cache_id(memcg_id);
3699 objcg->memcg = memcg;
3700 rcu_assign_pointer(memcg->objcg, objcg);
3702 static_branch_enable(&memcg_kmem_enabled_key);
3705 * A memory cgroup is considered kmem-online as soon as it gets
3706 * kmemcg_id. Setting the id after enabling static branching will
3707 * guarantee no one starts accounting before all call sites are
3710 memcg->kmemcg_id = memcg_id;
3711 memcg->kmem_state = KMEM_ONLINE;
3716 static void memcg_offline_kmem(struct mem_cgroup *memcg)
3718 struct cgroup_subsys_state *css;
3719 struct mem_cgroup *parent, *child;
3722 if (memcg->kmem_state != KMEM_ONLINE)
3725 memcg->kmem_state = KMEM_ALLOCATED;
3727 parent = parent_mem_cgroup(memcg);
3729 parent = root_mem_cgroup;
3731 memcg_reparent_objcgs(memcg, parent);
3733 kmemcg_id = memcg->kmemcg_id;
3734 BUG_ON(kmemcg_id < 0);
3737 * Change kmemcg_id of this cgroup and all its descendants to the
3738 * parent's id, and then move all entries from this cgroup's list_lrus
3739 * to ones of the parent. After we have finished, all list_lrus
3740 * corresponding to this cgroup are guaranteed to remain empty. The
3741 * ordering is imposed by list_lru_node->lock taken by
3742 * memcg_drain_all_list_lrus().
3744 rcu_read_lock(); /* can be called from css_free w/o cgroup_mutex */
3745 css_for_each_descendant_pre(css, &memcg->css) {
3746 child = mem_cgroup_from_css(css);
3747 BUG_ON(child->kmemcg_id != kmemcg_id);
3748 child->kmemcg_id = parent->kmemcg_id;
3749 if (!memcg->use_hierarchy)
3754 memcg_drain_all_list_lrus(kmemcg_id, parent);
3756 memcg_free_cache_id(kmemcg_id);
3759 static void memcg_free_kmem(struct mem_cgroup *memcg)
3761 /* css_alloc() failed, offlining didn't happen */
3762 if (unlikely(memcg->kmem_state == KMEM_ONLINE))
3763 memcg_offline_kmem(memcg);
3766 static int memcg_online_kmem(struct mem_cgroup *memcg)
3770 static void memcg_offline_kmem(struct mem_cgroup *memcg)
3773 static void memcg_free_kmem(struct mem_cgroup *memcg)
3776 #endif /* CONFIG_MEMCG_KMEM */
3778 static int memcg_update_kmem_max(struct mem_cgroup *memcg,
3783 mutex_lock(&memcg_max_mutex);
3784 ret = page_counter_set_max(&memcg->kmem, max);
3785 mutex_unlock(&memcg_max_mutex);
3789 static int memcg_update_tcp_max(struct mem_cgroup *memcg, unsigned long max)
3793 mutex_lock(&memcg_max_mutex);
3795 ret = page_counter_set_max(&memcg->tcpmem, max);
3799 if (!memcg->tcpmem_active) {
3801 * The active flag needs to be written after the static_key
3802 * update. This is what guarantees that the socket activation
3803 * function is the last one to run. See mem_cgroup_sk_alloc()
3804 * for details, and note that we don't mark any socket as
3805 * belonging to this memcg until that flag is up.
3807 * We need to do this, because static_keys will span multiple
3808 * sites, but we can't control their order. If we mark a socket
3809 * as accounted, but the accounting functions are not patched in
3810 * yet, we'll lose accounting.
3812 * We never race with the readers in mem_cgroup_sk_alloc(),
3813 * because when this value change, the code to process it is not
3816 static_branch_inc(&memcg_sockets_enabled_key);
3817 memcg->tcpmem_active = true;
3820 mutex_unlock(&memcg_max_mutex);
3825 * The user of this function is...
3828 static ssize_t mem_cgroup_write(struct kernfs_open_file *of,
3829 char *buf, size_t nbytes, loff_t off)
3831 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
3832 unsigned long nr_pages;
3835 buf = strstrip(buf);
3836 ret = page_counter_memparse(buf, "-1", &nr_pages);
3840 switch (MEMFILE_ATTR(of_cft(of)->private)) {
3842 if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */
3846 switch (MEMFILE_TYPE(of_cft(of)->private)) {
3848 ret = mem_cgroup_resize_max(memcg, nr_pages, false);
3851 ret = mem_cgroup_resize_max(memcg, nr_pages, true);
3854 pr_warn_once("kmem.limit_in_bytes is deprecated and will be removed. "
3855 "Please report your usecase to linux-mm@kvack.org if you "
3856 "depend on this functionality.\n");
3857 ret = memcg_update_kmem_max(memcg, nr_pages);
3860 ret = memcg_update_tcp_max(memcg, nr_pages);
3864 case RES_SOFT_LIMIT:
3865 memcg->soft_limit = nr_pages;
3869 return ret ?: nbytes;
3872 static ssize_t mem_cgroup_reset(struct kernfs_open_file *of, char *buf,
3873 size_t nbytes, loff_t off)
3875 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
3876 struct page_counter *counter;
3878 switch (MEMFILE_TYPE(of_cft(of)->private)) {
3880 counter = &memcg->memory;
3883 counter = &memcg->memsw;
3886 counter = &memcg->kmem;
3889 counter = &memcg->tcpmem;
3895 switch (MEMFILE_ATTR(of_cft(of)->private)) {
3897 page_counter_reset_watermark(counter);
3900 counter->failcnt = 0;
3909 static u64 mem_cgroup_move_charge_read(struct cgroup_subsys_state *css,
3912 return mem_cgroup_from_css(css)->move_charge_at_immigrate;
3916 static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css,
3917 struct cftype *cft, u64 val)
3919 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
3921 if (val & ~MOVE_MASK)
3925 * No kind of locking is needed in here, because ->can_attach() will
3926 * check this value once in the beginning of the process, and then carry
3927 * on with stale data. This means that changes to this value will only
3928 * affect task migrations starting after the change.
3930 memcg->move_charge_at_immigrate = val;
3934 static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css,
3935 struct cftype *cft, u64 val)
3943 #define LRU_ALL_FILE (BIT(LRU_INACTIVE_FILE) | BIT(LRU_ACTIVE_FILE))
3944 #define LRU_ALL_ANON (BIT(LRU_INACTIVE_ANON) | BIT(LRU_ACTIVE_ANON))
3945 #define LRU_ALL ((1 << NR_LRU_LISTS) - 1)
3947 static unsigned long mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg,
3948 int nid, unsigned int lru_mask, bool tree)
3950 struct lruvec *lruvec = mem_cgroup_lruvec(memcg, NODE_DATA(nid));
3951 unsigned long nr = 0;
3954 VM_BUG_ON((unsigned)nid >= nr_node_ids);
3957 if (!(BIT(lru) & lru_mask))
3960 nr += lruvec_page_state(lruvec, NR_LRU_BASE + lru);
3962 nr += lruvec_page_state_local(lruvec, NR_LRU_BASE + lru);
3967 static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg,
3968 unsigned int lru_mask,
3971 unsigned long nr = 0;
3975 if (!(BIT(lru) & lru_mask))
3978 nr += memcg_page_state(memcg, NR_LRU_BASE + lru);
3980 nr += memcg_page_state_local(memcg, NR_LRU_BASE + lru);
3985 static int memcg_numa_stat_show(struct seq_file *m, void *v)
3989 unsigned int lru_mask;
3992 static const struct numa_stat stats[] = {
3993 { "total", LRU_ALL },
3994 { "file", LRU_ALL_FILE },
3995 { "anon", LRU_ALL_ANON },
3996 { "unevictable", BIT(LRU_UNEVICTABLE) },
3998 const struct numa_stat *stat;
4000 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
4002 for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) {
4003 seq_printf(m, "%s=%lu", stat->name,
4004 mem_cgroup_nr_lru_pages(memcg, stat->lru_mask,
4006 for_each_node_state(nid, N_MEMORY)
4007 seq_printf(m, " N%d=%lu", nid,
4008 mem_cgroup_node_nr_lru_pages(memcg, nid,
4009 stat->lru_mask, false));
4013 for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) {
4015 seq_printf(m, "hierarchical_%s=%lu", stat->name,
4016 mem_cgroup_nr_lru_pages(memcg, stat->lru_mask,
4018 for_each_node_state(nid, N_MEMORY)
4019 seq_printf(m, " N%d=%lu", nid,
4020 mem_cgroup_node_nr_lru_pages(memcg, nid,
4021 stat->lru_mask, true));
4027 #endif /* CONFIG_NUMA */
4029 static const unsigned int memcg1_stats[] = {
4032 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4042 static const char *const memcg1_stat_names[] = {
4045 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4055 /* Universal VM events cgroup1 shows, original sort order */
4056 static const unsigned int memcg1_events[] = {
4063 static int memcg_stat_show(struct seq_file *m, void *v)
4065 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
4066 unsigned long memory, memsw;
4067 struct mem_cgroup *mi;
4070 BUILD_BUG_ON(ARRAY_SIZE(memcg1_stat_names) != ARRAY_SIZE(memcg1_stats));
4072 for (i = 0; i < ARRAY_SIZE(memcg1_stats); i++) {
4075 if (memcg1_stats[i] == MEMCG_SWAP && !do_memsw_account())
4077 nr = memcg_page_state_local(memcg, memcg1_stats[i]);
4078 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4079 if (memcg1_stats[i] == NR_ANON_THPS)
4082 seq_printf(m, "%s %lu\n", memcg1_stat_names[i], nr * PAGE_SIZE);
4085 for (i = 0; i < ARRAY_SIZE(memcg1_events); i++)
4086 seq_printf(m, "%s %lu\n", vm_event_name(memcg1_events[i]),
4087 memcg_events_local(memcg, memcg1_events[i]));
4089 for (i = 0; i < NR_LRU_LISTS; i++)
4090 seq_printf(m, "%s %lu\n", lru_list_name(i),
4091 memcg_page_state_local(memcg, NR_LRU_BASE + i) *
4094 /* Hierarchical information */
4095 memory = memsw = PAGE_COUNTER_MAX;
4096 for (mi = memcg; mi; mi = parent_mem_cgroup(mi)) {
4097 memory = min(memory, READ_ONCE(mi->memory.max));
4098 memsw = min(memsw, READ_ONCE(mi->memsw.max));
4100 seq_printf(m, "hierarchical_memory_limit %llu\n",
4101 (u64)memory * PAGE_SIZE);
4102 if (do_memsw_account())
4103 seq_printf(m, "hierarchical_memsw_limit %llu\n",
4104 (u64)memsw * PAGE_SIZE);
4106 for (i = 0; i < ARRAY_SIZE(memcg1_stats); i++) {
4109 if (memcg1_stats[i] == MEMCG_SWAP && !do_memsw_account())
4111 nr = memcg_page_state(memcg, memcg1_stats[i]);
4112 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4113 if (memcg1_stats[i] == NR_ANON_THPS)
4116 seq_printf(m, "total_%s %llu\n", memcg1_stat_names[i],
4117 (u64)nr * PAGE_SIZE);
4120 for (i = 0; i < ARRAY_SIZE(memcg1_events); i++)
4121 seq_printf(m, "total_%s %llu\n",
4122 vm_event_name(memcg1_events[i]),
4123 (u64)memcg_events(memcg, memcg1_events[i]));
4125 for (i = 0; i < NR_LRU_LISTS; i++)
4126 seq_printf(m, "total_%s %llu\n", lru_list_name(i),
4127 (u64)memcg_page_state(memcg, NR_LRU_BASE + i) *
4130 #ifdef CONFIG_DEBUG_VM
4133 struct mem_cgroup_per_node *mz;
4134 unsigned long anon_cost = 0;
4135 unsigned long file_cost = 0;
4137 for_each_online_pgdat(pgdat) {
4138 mz = mem_cgroup_nodeinfo(memcg, pgdat->node_id);
4140 anon_cost += mz->lruvec.anon_cost;
4141 file_cost += mz->lruvec.file_cost;
4143 seq_printf(m, "anon_cost %lu\n", anon_cost);
4144 seq_printf(m, "file_cost %lu\n", file_cost);
4151 static u64 mem_cgroup_swappiness_read(struct cgroup_subsys_state *css,
4154 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4156 return mem_cgroup_swappiness(memcg);
4159 static int mem_cgroup_swappiness_write(struct cgroup_subsys_state *css,
4160 struct cftype *cft, u64 val)
4162 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4168 memcg->swappiness = val;
4170 vm_swappiness = val;
4175 static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap)
4177 struct mem_cgroup_threshold_ary *t;
4178 unsigned long usage;
4183 t = rcu_dereference(memcg->thresholds.primary);
4185 t = rcu_dereference(memcg->memsw_thresholds.primary);
4190 usage = mem_cgroup_usage(memcg, swap);
4193 * current_threshold points to threshold just below or equal to usage.
4194 * If it's not true, a threshold was crossed after last
4195 * call of __mem_cgroup_threshold().
4197 i = t->current_threshold;
4200 * Iterate backward over array of thresholds starting from
4201 * current_threshold and check if a threshold is crossed.
4202 * If none of thresholds below usage is crossed, we read
4203 * only one element of the array here.
4205 for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)
4206 eventfd_signal(t->entries[i].eventfd, 1);
4208 /* i = current_threshold + 1 */
4212 * Iterate forward over array of thresholds starting from
4213 * current_threshold+1 and check if a threshold is crossed.
4214 * If none of thresholds above usage is crossed, we read
4215 * only one element of the array here.
4217 for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)
4218 eventfd_signal(t->entries[i].eventfd, 1);
4220 /* Update current_threshold */
4221 t->current_threshold = i - 1;
4226 static void mem_cgroup_threshold(struct mem_cgroup *memcg)
4229 __mem_cgroup_threshold(memcg, false);
4230 if (do_memsw_account())
4231 __mem_cgroup_threshold(memcg, true);
4233 memcg = parent_mem_cgroup(memcg);
4237 static int compare_thresholds(const void *a, const void *b)
4239 const struct mem_cgroup_threshold *_a = a;
4240 const struct mem_cgroup_threshold *_b = b;
4242 if (_a->threshold > _b->threshold)
4245 if (_a->threshold < _b->threshold)
4251 static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg)
4253 struct mem_cgroup_eventfd_list *ev;
4255 spin_lock(&memcg_oom_lock);
4257 list_for_each_entry(ev, &memcg->oom_notify, list)
4258 eventfd_signal(ev->eventfd, 1);
4260 spin_unlock(&memcg_oom_lock);
4264 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg)
4266 struct mem_cgroup *iter;
4268 for_each_mem_cgroup_tree(iter, memcg)
4269 mem_cgroup_oom_notify_cb(iter);
4272 static int __mem_cgroup_usage_register_event(struct mem_cgroup *memcg,
4273 struct eventfd_ctx *eventfd, const char *args, enum res_type type)
4275 struct mem_cgroup_thresholds *thresholds;
4276 struct mem_cgroup_threshold_ary *new;
4277 unsigned long threshold;
4278 unsigned long usage;
4281 ret = page_counter_memparse(args, "-1", &threshold);
4285 mutex_lock(&memcg->thresholds_lock);
4288 thresholds = &memcg->thresholds;
4289 usage = mem_cgroup_usage(memcg, false);
4290 } else if (type == _MEMSWAP) {
4291 thresholds = &memcg->memsw_thresholds;
4292 usage = mem_cgroup_usage(memcg, true);
4296 /* Check if a threshold crossed before adding a new one */
4297 if (thresholds->primary)
4298 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
4300 size = thresholds->primary ? thresholds->primary->size + 1 : 1;
4302 /* Allocate memory for new array of thresholds */
4303 new = kmalloc(struct_size(new, entries, size), GFP_KERNEL);
4310 /* Copy thresholds (if any) to new array */
4311 if (thresholds->primary)
4312 memcpy(new->entries, thresholds->primary->entries,
4313 flex_array_size(new, entries, size - 1));
4315 /* Add new threshold */
4316 new->entries[size - 1].eventfd = eventfd;
4317 new->entries[size - 1].threshold = threshold;
4319 /* Sort thresholds. Registering of new threshold isn't time-critical */
4320 sort(new->entries, size, sizeof(*new->entries),
4321 compare_thresholds, NULL);
4323 /* Find current threshold */
4324 new->current_threshold = -1;
4325 for (i = 0; i < size; i++) {
4326 if (new->entries[i].threshold <= usage) {
4328 * new->current_threshold will not be used until
4329 * rcu_assign_pointer(), so it's safe to increment
4332 ++new->current_threshold;
4337 /* Free old spare buffer and save old primary buffer as spare */
4338 kfree(thresholds->spare);
4339 thresholds->spare = thresholds->primary;
4341 rcu_assign_pointer(thresholds->primary, new);
4343 /* To be sure that nobody uses thresholds */
4347 mutex_unlock(&memcg->thresholds_lock);
4352 static int mem_cgroup_usage_register_event(struct mem_cgroup *memcg,
4353 struct eventfd_ctx *eventfd, const char *args)
4355 return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEM);
4358 static int memsw_cgroup_usage_register_event(struct mem_cgroup *memcg,
4359 struct eventfd_ctx *eventfd, const char *args)
4361 return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEMSWAP);
4364 static void __mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
4365 struct eventfd_ctx *eventfd, enum res_type type)
4367 struct mem_cgroup_thresholds *thresholds;
4368 struct mem_cgroup_threshold_ary *new;
4369 unsigned long usage;
4370 int i, j, size, entries;
4372 mutex_lock(&memcg->thresholds_lock);
4375 thresholds = &memcg->thresholds;
4376 usage = mem_cgroup_usage(memcg, false);
4377 } else if (type == _MEMSWAP) {
4378 thresholds = &memcg->memsw_thresholds;
4379 usage = mem_cgroup_usage(memcg, true);
4383 if (!thresholds->primary)
4386 /* Check if a threshold crossed before removing */
4387 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
4389 /* Calculate new number of threshold */
4391 for (i = 0; i < thresholds->primary->size; i++) {
4392 if (thresholds->primary->entries[i].eventfd != eventfd)
4398 new = thresholds->spare;
4400 /* If no items related to eventfd have been cleared, nothing to do */
4404 /* Set thresholds array to NULL if we don't have thresholds */
4413 /* Copy thresholds and find current threshold */
4414 new->current_threshold = -1;
4415 for (i = 0, j = 0; i < thresholds->primary->size; i++) {
4416 if (thresholds->primary->entries[i].eventfd == eventfd)
4419 new->entries[j] = thresholds->primary->entries[i];
4420 if (new->entries[j].threshold <= usage) {
4422 * new->current_threshold will not be used
4423 * until rcu_assign_pointer(), so it's safe to increment
4426 ++new->current_threshold;
4432 /* Swap primary and spare array */
4433 thresholds->spare = thresholds->primary;
4435 rcu_assign_pointer(thresholds->primary, new);
4437 /* To be sure that nobody uses thresholds */
4440 /* If all events are unregistered, free the spare array */
4442 kfree(thresholds->spare);
4443 thresholds->spare = NULL;
4446 mutex_unlock(&memcg->thresholds_lock);
4449 static void mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
4450 struct eventfd_ctx *eventfd)
4452 return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEM);
4455 static void memsw_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
4456 struct eventfd_ctx *eventfd)
4458 return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEMSWAP);
4461 static int mem_cgroup_oom_register_event(struct mem_cgroup *memcg,
4462 struct eventfd_ctx *eventfd, const char *args)
4464 struct mem_cgroup_eventfd_list *event;
4466 event = kmalloc(sizeof(*event), GFP_KERNEL);
4470 spin_lock(&memcg_oom_lock);
4472 event->eventfd = eventfd;
4473 list_add(&event->list, &memcg->oom_notify);
4475 /* already in OOM ? */
4476 if (memcg->under_oom)
4477 eventfd_signal(eventfd, 1);
4478 spin_unlock(&memcg_oom_lock);
4483 static void mem_cgroup_oom_unregister_event(struct mem_cgroup *memcg,
4484 struct eventfd_ctx *eventfd)
4486 struct mem_cgroup_eventfd_list *ev, *tmp;
4488 spin_lock(&memcg_oom_lock);
4490 list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) {
4491 if (ev->eventfd == eventfd) {
4492 list_del(&ev->list);
4497 spin_unlock(&memcg_oom_lock);
4500 static int mem_cgroup_oom_control_read(struct seq_file *sf, void *v)
4502 struct mem_cgroup *memcg = mem_cgroup_from_seq(sf);
4504 seq_printf(sf, "oom_kill_disable %d\n", memcg->oom_kill_disable);
4505 seq_printf(sf, "under_oom %d\n", (bool)memcg->under_oom);
4506 seq_printf(sf, "oom_kill %lu\n",
4507 atomic_long_read(&memcg->memory_events[MEMCG_OOM_KILL]));
4511 static int mem_cgroup_oom_control_write(struct cgroup_subsys_state *css,
4512 struct cftype *cft, u64 val)
4514 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4516 /* cannot set to root cgroup and only 0 and 1 are allowed */
4517 if (!css->parent || !((val == 0) || (val == 1)))
4520 memcg->oom_kill_disable = val;
4522 memcg_oom_recover(memcg);
4527 #ifdef CONFIG_CGROUP_WRITEBACK
4529 #include <trace/events/writeback.h>
4531 static int memcg_wb_domain_init(struct mem_cgroup *memcg, gfp_t gfp)
4533 return wb_domain_init(&memcg->cgwb_domain, gfp);
4536 static void memcg_wb_domain_exit(struct mem_cgroup *memcg)
4538 wb_domain_exit(&memcg->cgwb_domain);
4541 static void memcg_wb_domain_size_changed(struct mem_cgroup *memcg)
4543 wb_domain_size_changed(&memcg->cgwb_domain);
4546 struct wb_domain *mem_cgroup_wb_domain(struct bdi_writeback *wb)
4548 struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css);
4550 if (!memcg->css.parent)
4553 return &memcg->cgwb_domain;
4557 * idx can be of type enum memcg_stat_item or node_stat_item.
4558 * Keep in sync with memcg_exact_page().
4560 static unsigned long memcg_exact_page_state(struct mem_cgroup *memcg, int idx)
4562 long x = atomic_long_read(&memcg->vmstats[idx]);
4565 for_each_online_cpu(cpu)
4566 x += per_cpu_ptr(memcg->vmstats_percpu, cpu)->stat[idx];
4573 * mem_cgroup_wb_stats - retrieve writeback related stats from its memcg
4574 * @wb: bdi_writeback in question
4575 * @pfilepages: out parameter for number of file pages
4576 * @pheadroom: out parameter for number of allocatable pages according to memcg
4577 * @pdirty: out parameter for number of dirty pages
4578 * @pwriteback: out parameter for number of pages under writeback
4580 * Determine the numbers of file, headroom, dirty, and writeback pages in
4581 * @wb's memcg. File, dirty and writeback are self-explanatory. Headroom
4582 * is a bit more involved.
4584 * A memcg's headroom is "min(max, high) - used". In the hierarchy, the
4585 * headroom is calculated as the lowest headroom of itself and the
4586 * ancestors. Note that this doesn't consider the actual amount of
4587 * available memory in the system. The caller should further cap
4588 * *@pheadroom accordingly.
4590 void mem_cgroup_wb_stats(struct bdi_writeback *wb, unsigned long *pfilepages,
4591 unsigned long *pheadroom, unsigned long *pdirty,
4592 unsigned long *pwriteback)
4594 struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css);
4595 struct mem_cgroup *parent;
4597 *pdirty = memcg_exact_page_state(memcg, NR_FILE_DIRTY);
4599 *pwriteback = memcg_exact_page_state(memcg, NR_WRITEBACK);
4600 *pfilepages = memcg_exact_page_state(memcg, NR_INACTIVE_FILE) +
4601 memcg_exact_page_state(memcg, NR_ACTIVE_FILE);
4602 *pheadroom = PAGE_COUNTER_MAX;
4604 while ((parent = parent_mem_cgroup(memcg))) {
4605 unsigned long ceiling = min(READ_ONCE(memcg->memory.max),
4606 READ_ONCE(memcg->memory.high));
4607 unsigned long used = page_counter_read(&memcg->memory);
4609 *pheadroom = min(*pheadroom, ceiling - min(ceiling, used));
4615 * Foreign dirty flushing
4617 * There's an inherent mismatch between memcg and writeback. The former
4618 * trackes ownership per-page while the latter per-inode. This was a
4619 * deliberate design decision because honoring per-page ownership in the
4620 * writeback path is complicated, may lead to higher CPU and IO overheads
4621 * and deemed unnecessary given that write-sharing an inode across
4622 * different cgroups isn't a common use-case.
4624 * Combined with inode majority-writer ownership switching, this works well
4625 * enough in most cases but there are some pathological cases. For
4626 * example, let's say there are two cgroups A and B which keep writing to
4627 * different but confined parts of the same inode. B owns the inode and
4628 * A's memory is limited far below B's. A's dirty ratio can rise enough to
4629 * trigger balance_dirty_pages() sleeps but B's can be low enough to avoid
4630 * triggering background writeback. A will be slowed down without a way to
4631 * make writeback of the dirty pages happen.
4633 * Conditions like the above can lead to a cgroup getting repatedly and
4634 * severely throttled after making some progress after each
4635 * dirty_expire_interval while the underyling IO device is almost
4638 * Solving this problem completely requires matching the ownership tracking
4639 * granularities between memcg and writeback in either direction. However,
4640 * the more egregious behaviors can be avoided by simply remembering the
4641 * most recent foreign dirtying events and initiating remote flushes on
4642 * them when local writeback isn't enough to keep the memory clean enough.
4644 * The following two functions implement such mechanism. When a foreign
4645 * page - a page whose memcg and writeback ownerships don't match - is
4646 * dirtied, mem_cgroup_track_foreign_dirty() records the inode owning
4647 * bdi_writeback on the page owning memcg. When balance_dirty_pages()
4648 * decides that the memcg needs to sleep due to high dirty ratio, it calls
4649 * mem_cgroup_flush_foreign() which queues writeback on the recorded
4650 * foreign bdi_writebacks which haven't expired. Both the numbers of
4651 * recorded bdi_writebacks and concurrent in-flight foreign writebacks are
4652 * limited to MEMCG_CGWB_FRN_CNT.
4654 * The mechanism only remembers IDs and doesn't hold any object references.
4655 * As being wrong occasionally doesn't matter, updates and accesses to the
4656 * records are lockless and racy.
4658 void mem_cgroup_track_foreign_dirty_slowpath(struct page *page,
4659 struct bdi_writeback *wb)
4661 struct mem_cgroup *memcg = page->mem_cgroup;
4662 struct memcg_cgwb_frn *frn;
4663 u64 now = get_jiffies_64();
4664 u64 oldest_at = now;
4668 trace_track_foreign_dirty(page, wb);
4671 * Pick the slot to use. If there is already a slot for @wb, keep
4672 * using it. If not replace the oldest one which isn't being
4675 for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++) {
4676 frn = &memcg->cgwb_frn[i];
4677 if (frn->bdi_id == wb->bdi->id &&
4678 frn->memcg_id == wb->memcg_css->id)
4680 if (time_before64(frn->at, oldest_at) &&
4681 atomic_read(&frn->done.cnt) == 1) {
4683 oldest_at = frn->at;
4687 if (i < MEMCG_CGWB_FRN_CNT) {
4689 * Re-using an existing one. Update timestamp lazily to
4690 * avoid making the cacheline hot. We want them to be
4691 * reasonably up-to-date and significantly shorter than
4692 * dirty_expire_interval as that's what expires the record.
4693 * Use the shorter of 1s and dirty_expire_interval / 8.
4695 unsigned long update_intv =
4696 min_t(unsigned long, HZ,
4697 msecs_to_jiffies(dirty_expire_interval * 10) / 8);
4699 if (time_before64(frn->at, now - update_intv))
4701 } else if (oldest >= 0) {
4702 /* replace the oldest free one */
4703 frn = &memcg->cgwb_frn[oldest];
4704 frn->bdi_id = wb->bdi->id;
4705 frn->memcg_id = wb->memcg_css->id;
4710 /* issue foreign writeback flushes for recorded foreign dirtying events */
4711 void mem_cgroup_flush_foreign(struct bdi_writeback *wb)
4713 struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css);
4714 unsigned long intv = msecs_to_jiffies(dirty_expire_interval * 10);
4715 u64 now = jiffies_64;
4718 for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++) {
4719 struct memcg_cgwb_frn *frn = &memcg->cgwb_frn[i];
4722 * If the record is older than dirty_expire_interval,
4723 * writeback on it has already started. No need to kick it
4724 * off again. Also, don't start a new one if there's
4725 * already one in flight.
4727 if (time_after64(frn->at, now - intv) &&
4728 atomic_read(&frn->done.cnt) == 1) {
4730 trace_flush_foreign(wb, frn->bdi_id, frn->memcg_id);
4731 cgroup_writeback_by_id(frn->bdi_id, frn->memcg_id, 0,
4732 WB_REASON_FOREIGN_FLUSH,
4738 #else /* CONFIG_CGROUP_WRITEBACK */
4740 static int memcg_wb_domain_init(struct mem_cgroup *memcg, gfp_t gfp)
4745 static void memcg_wb_domain_exit(struct mem_cgroup *memcg)
4749 static void memcg_wb_domain_size_changed(struct mem_cgroup *memcg)
4753 #endif /* CONFIG_CGROUP_WRITEBACK */
4756 * DO NOT USE IN NEW FILES.
4758 * "cgroup.event_control" implementation.
4760 * This is way over-engineered. It tries to support fully configurable
4761 * events for each user. Such level of flexibility is completely
4762 * unnecessary especially in the light of the planned unified hierarchy.
4764 * Please deprecate this and replace with something simpler if at all
4769 * Unregister event and free resources.
4771 * Gets called from workqueue.
4773 static void memcg_event_remove(struct work_struct *work)
4775 struct mem_cgroup_event *event =
4776 container_of(work, struct mem_cgroup_event, remove);
4777 struct mem_cgroup *memcg = event->memcg;
4779 remove_wait_queue(event->wqh, &event->wait);
4781 event->unregister_event(memcg, event->eventfd);
4783 /* Notify userspace the event is going away. */
4784 eventfd_signal(event->eventfd, 1);
4786 eventfd_ctx_put(event->eventfd);
4788 css_put(&memcg->css);
4792 * Gets called on EPOLLHUP on eventfd when user closes it.
4794 * Called with wqh->lock held and interrupts disabled.
4796 static int memcg_event_wake(wait_queue_entry_t *wait, unsigned mode,
4797 int sync, void *key)
4799 struct mem_cgroup_event *event =
4800 container_of(wait, struct mem_cgroup_event, wait);
4801 struct mem_cgroup *memcg = event->memcg;
4802 __poll_t flags = key_to_poll(key);
4804 if (flags & EPOLLHUP) {
4806 * If the event has been detached at cgroup removal, we
4807 * can simply return knowing the other side will cleanup
4810 * We can't race against event freeing since the other
4811 * side will require wqh->lock via remove_wait_queue(),
4814 spin_lock(&memcg->event_list_lock);
4815 if (!list_empty(&event->list)) {
4816 list_del_init(&event->list);
4818 * We are in atomic context, but cgroup_event_remove()
4819 * may sleep, so we have to call it in workqueue.
4821 schedule_work(&event->remove);
4823 spin_unlock(&memcg->event_list_lock);
4829 static void memcg_event_ptable_queue_proc(struct file *file,
4830 wait_queue_head_t *wqh, poll_table *pt)
4832 struct mem_cgroup_event *event =
4833 container_of(pt, struct mem_cgroup_event, pt);
4836 add_wait_queue(wqh, &event->wait);
4840 * DO NOT USE IN NEW FILES.
4842 * Parse input and register new cgroup event handler.
4844 * Input must be in format '<event_fd> <control_fd> <args>'.
4845 * Interpretation of args is defined by control file implementation.
4847 static ssize_t memcg_write_event_control(struct kernfs_open_file *of,
4848 char *buf, size_t nbytes, loff_t off)
4850 struct cgroup_subsys_state *css = of_css(of);
4851 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4852 struct mem_cgroup_event *event;
4853 struct cgroup_subsys_state *cfile_css;
4854 unsigned int efd, cfd;
4861 buf = strstrip(buf);
4863 efd = simple_strtoul(buf, &endp, 10);
4868 cfd = simple_strtoul(buf, &endp, 10);
4869 if ((*endp != ' ') && (*endp != '\0'))
4873 event = kzalloc(sizeof(*event), GFP_KERNEL);
4877 event->memcg = memcg;
4878 INIT_LIST_HEAD(&event->list);
4879 init_poll_funcptr(&event->pt, memcg_event_ptable_queue_proc);
4880 init_waitqueue_func_entry(&event->wait, memcg_event_wake);
4881 INIT_WORK(&event->remove, memcg_event_remove);
4889 event->eventfd = eventfd_ctx_fileget(efile.file);
4890 if (IS_ERR(event->eventfd)) {
4891 ret = PTR_ERR(event->eventfd);
4898 goto out_put_eventfd;
4901 /* the process need read permission on control file */
4902 /* AV: shouldn't we check that it's been opened for read instead? */
4903 ret = inode_permission(file_inode(cfile.file), MAY_READ);
4908 * Determine the event callbacks and set them in @event. This used
4909 * to be done via struct cftype but cgroup core no longer knows
4910 * about these events. The following is crude but the whole thing
4911 * is for compatibility anyway.
4913 * DO NOT ADD NEW FILES.
4915 name = cfile.file->f_path.dentry->d_name.name;
4917 if (!strcmp(name, "memory.usage_in_bytes")) {
4918 event->register_event = mem_cgroup_usage_register_event;
4919 event->unregister_event = mem_cgroup_usage_unregister_event;
4920 } else if (!strcmp(name, "memory.oom_control")) {
4921 event->register_event = mem_cgroup_oom_register_event;
4922 event->unregister_event = mem_cgroup_oom_unregister_event;
4923 } else if (!strcmp(name, "memory.pressure_level")) {
4924 event->register_event = vmpressure_register_event;
4925 event->unregister_event = vmpressure_unregister_event;
4926 } else if (!strcmp(name, "memory.memsw.usage_in_bytes")) {
4927 event->register_event = memsw_cgroup_usage_register_event;
4928 event->unregister_event = memsw_cgroup_usage_unregister_event;
4935 * Verify @cfile should belong to @css. Also, remaining events are
4936 * automatically removed on cgroup destruction but the removal is
4937 * asynchronous, so take an extra ref on @css.
4939 cfile_css = css_tryget_online_from_dir(cfile.file->f_path.dentry->d_parent,
4940 &memory_cgrp_subsys);
4942 if (IS_ERR(cfile_css))
4944 if (cfile_css != css) {
4949 ret = event->register_event(memcg, event->eventfd, buf);
4953 vfs_poll(efile.file, &event->pt);
4955 spin_lock(&memcg->event_list_lock);
4956 list_add(&event->list, &memcg->event_list);
4957 spin_unlock(&memcg->event_list_lock);
4969 eventfd_ctx_put(event->eventfd);
4978 static struct cftype mem_cgroup_legacy_files[] = {
4980 .name = "usage_in_bytes",
4981 .private = MEMFILE_PRIVATE(_MEM, RES_USAGE),
4982 .read_u64 = mem_cgroup_read_u64,
4985 .name = "max_usage_in_bytes",
4986 .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE),
4987 .write = mem_cgroup_reset,
4988 .read_u64 = mem_cgroup_read_u64,
4991 .name = "limit_in_bytes",
4992 .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT),
4993 .write = mem_cgroup_write,
4994 .read_u64 = mem_cgroup_read_u64,
4997 .name = "soft_limit_in_bytes",
4998 .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT),
4999 .write = mem_cgroup_write,
5000 .read_u64 = mem_cgroup_read_u64,
5004 .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT),
5005 .write = mem_cgroup_reset,
5006 .read_u64 = mem_cgroup_read_u64,
5010 .seq_show = memcg_stat_show,
5013 .name = "force_empty",
5014 .write = mem_cgroup_force_empty_write,
5017 .name = "use_hierarchy",
5018 .write_u64 = mem_cgroup_hierarchy_write,
5019 .read_u64 = mem_cgroup_hierarchy_read,
5022 .name = "cgroup.event_control", /* XXX: for compat */
5023 .write = memcg_write_event_control,
5024 .flags = CFTYPE_NO_PREFIX | CFTYPE_WORLD_WRITABLE,
5027 .name = "swappiness",
5028 .read_u64 = mem_cgroup_swappiness_read,
5029 .write_u64 = mem_cgroup_swappiness_write,
5032 .name = "move_charge_at_immigrate",
5033 .read_u64 = mem_cgroup_move_charge_read,
5034 .write_u64 = mem_cgroup_move_charge_write,
5037 .name = "oom_control",
5038 .seq_show = mem_cgroup_oom_control_read,
5039 .write_u64 = mem_cgroup_oom_control_write,
5040 .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL),
5043 .name = "pressure_level",
5047 .name = "numa_stat",
5048 .seq_show = memcg_numa_stat_show,
5052 .name = "kmem.limit_in_bytes",
5053 .private = MEMFILE_PRIVATE(_KMEM, RES_LIMIT),
5054 .write = mem_cgroup_write,
5055 .read_u64 = mem_cgroup_read_u64,
5058 .name = "kmem.usage_in_bytes",
5059 .private = MEMFILE_PRIVATE(_KMEM, RES_USAGE),
5060 .read_u64 = mem_cgroup_read_u64,
5063 .name = "kmem.failcnt",
5064 .private = MEMFILE_PRIVATE(_KMEM, RES_FAILCNT),
5065 .write = mem_cgroup_reset,
5066 .read_u64 = mem_cgroup_read_u64,
5069 .name = "kmem.max_usage_in_bytes",
5070 .private = MEMFILE_PRIVATE(_KMEM, RES_MAX_USAGE),
5071 .write = mem_cgroup_reset,
5072 .read_u64 = mem_cgroup_read_u64,
5074 #if defined(CONFIG_MEMCG_KMEM) && \
5075 (defined(CONFIG_SLAB) || defined(CONFIG_SLUB_DEBUG))
5077 .name = "kmem.slabinfo",
5078 .seq_show = memcg_slab_show,
5082 .name = "kmem.tcp.limit_in_bytes",
5083 .private = MEMFILE_PRIVATE(_TCP, RES_LIMIT),
5084 .write = mem_cgroup_write,
5085 .read_u64 = mem_cgroup_read_u64,
5088 .name = "kmem.tcp.usage_in_bytes",
5089 .private = MEMFILE_PRIVATE(_TCP, RES_USAGE),
5090 .read_u64 = mem_cgroup_read_u64,
5093 .name = "kmem.tcp.failcnt",
5094 .private = MEMFILE_PRIVATE(_TCP, RES_FAILCNT),
5095 .write = mem_cgroup_reset,
5096 .read_u64 = mem_cgroup_read_u64,
5099 .name = "kmem.tcp.max_usage_in_bytes",
5100 .private = MEMFILE_PRIVATE(_TCP, RES_MAX_USAGE),
5101 .write = mem_cgroup_reset,
5102 .read_u64 = mem_cgroup_read_u64,
5104 { }, /* terminate */
5108 * Private memory cgroup IDR
5110 * Swap-out records and page cache shadow entries need to store memcg
5111 * references in constrained space, so we maintain an ID space that is
5112 * limited to 16 bit (MEM_CGROUP_ID_MAX), limiting the total number of
5113 * memory-controlled cgroups to 64k.
5115 * However, there usually are many references to the offline CSS after
5116 * the cgroup has been destroyed, such as page cache or reclaimable
5117 * slab objects, that don't need to hang on to the ID. We want to keep
5118 * those dead CSS from occupying IDs, or we might quickly exhaust the
5119 * relatively small ID space and prevent the creation of new cgroups
5120 * even when there are much fewer than 64k cgroups - possibly none.
5122 * Maintain a private 16-bit ID space for memcg, and allow the ID to
5123 * be freed and recycled when it's no longer needed, which is usually
5124 * when the CSS is offlined.
5126 * The only exception to that are records of swapped out tmpfs/shmem
5127 * pages that need to be attributed to live ancestors on swapin. But
5128 * those references are manageable from userspace.
5131 static DEFINE_IDR(mem_cgroup_idr);
5133 static void mem_cgroup_id_remove(struct mem_cgroup *memcg)
5135 if (memcg->id.id > 0) {
5136 idr_remove(&mem_cgroup_idr, memcg->id.id);
5141 static void __maybe_unused mem_cgroup_id_get_many(struct mem_cgroup *memcg,
5144 refcount_add(n, &memcg->id.ref);
5147 static void mem_cgroup_id_put_many(struct mem_cgroup *memcg, unsigned int n)
5149 if (refcount_sub_and_test(n, &memcg->id.ref)) {
5150 mem_cgroup_id_remove(memcg);
5152 /* Memcg ID pins CSS */
5153 css_put(&memcg->css);
5157 static inline void mem_cgroup_id_put(struct mem_cgroup *memcg)
5159 mem_cgroup_id_put_many(memcg, 1);
5163 * mem_cgroup_from_id - look up a memcg from a memcg id
5164 * @id: the memcg id to look up
5166 * Caller must hold rcu_read_lock().
5168 struct mem_cgroup *mem_cgroup_from_id(unsigned short id)
5170 WARN_ON_ONCE(!rcu_read_lock_held());
5171 return idr_find(&mem_cgroup_idr, id);
5174 static int alloc_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node)
5176 struct mem_cgroup_per_node *pn;
5179 * This routine is called against possible nodes.
5180 * But it's BUG to call kmalloc() against offline node.
5182 * TODO: this routine can waste much memory for nodes which will
5183 * never be onlined. It's better to use memory hotplug callback
5186 if (!node_state(node, N_NORMAL_MEMORY))
5188 pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp);
5192 pn->lruvec_stat_local = alloc_percpu_gfp(struct lruvec_stat,
5193 GFP_KERNEL_ACCOUNT);
5194 if (!pn->lruvec_stat_local) {
5199 pn->lruvec_stat_cpu = alloc_percpu_gfp(struct lruvec_stat,
5200 GFP_KERNEL_ACCOUNT);
5201 if (!pn->lruvec_stat_cpu) {
5202 free_percpu(pn->lruvec_stat_local);
5207 lruvec_init(&pn->lruvec);
5208 pn->usage_in_excess = 0;
5209 pn->on_tree = false;
5212 memcg->nodeinfo[node] = pn;
5216 static void free_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node)
5218 struct mem_cgroup_per_node *pn = memcg->nodeinfo[node];
5223 free_percpu(pn->lruvec_stat_cpu);
5224 free_percpu(pn->lruvec_stat_local);
5228 static void __mem_cgroup_free(struct mem_cgroup *memcg)
5233 free_mem_cgroup_per_node_info(memcg, node);
5234 free_percpu(memcg->vmstats_percpu);
5235 free_percpu(memcg->vmstats_local);
5239 static void mem_cgroup_free(struct mem_cgroup *memcg)
5241 memcg_wb_domain_exit(memcg);
5243 * Flush percpu vmstats and vmevents to guarantee the value correctness
5244 * on parent's and all ancestor levels.
5246 memcg_flush_percpu_vmstats(memcg);
5247 memcg_flush_percpu_vmevents(memcg);
5248 __mem_cgroup_free(memcg);
5251 static struct mem_cgroup *mem_cgroup_alloc(void)
5253 struct mem_cgroup *memcg;
5256 int __maybe_unused i;
5257 long error = -ENOMEM;
5259 size = sizeof(struct mem_cgroup);
5260 size += nr_node_ids * sizeof(struct mem_cgroup_per_node *);
5262 memcg = kzalloc(size, GFP_KERNEL);
5264 return ERR_PTR(error);
5266 memcg->id.id = idr_alloc(&mem_cgroup_idr, NULL,
5267 1, MEM_CGROUP_ID_MAX,
5269 if (memcg->id.id < 0) {
5270 error = memcg->id.id;
5274 memcg->vmstats_local = alloc_percpu_gfp(struct memcg_vmstats_percpu,
5275 GFP_KERNEL_ACCOUNT);
5276 if (!memcg->vmstats_local)
5279 memcg->vmstats_percpu = alloc_percpu_gfp(struct memcg_vmstats_percpu,
5280 GFP_KERNEL_ACCOUNT);
5281 if (!memcg->vmstats_percpu)
5285 if (alloc_mem_cgroup_per_node_info(memcg, node))
5288 if (memcg_wb_domain_init(memcg, GFP_KERNEL))
5291 INIT_WORK(&memcg->high_work, high_work_func);
5292 INIT_LIST_HEAD(&memcg->oom_notify);
5293 mutex_init(&memcg->thresholds_lock);
5294 spin_lock_init(&memcg->move_lock);
5295 vmpressure_init(&memcg->vmpressure);
5296 INIT_LIST_HEAD(&memcg->event_list);
5297 spin_lock_init(&memcg->event_list_lock);
5298 memcg->socket_pressure = jiffies;
5299 #ifdef CONFIG_MEMCG_KMEM
5300 memcg->kmemcg_id = -1;
5301 INIT_LIST_HEAD(&memcg->objcg_list);
5303 #ifdef CONFIG_CGROUP_WRITEBACK
5304 INIT_LIST_HEAD(&memcg->cgwb_list);
5305 for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++)
5306 memcg->cgwb_frn[i].done =
5307 __WB_COMPLETION_INIT(&memcg_cgwb_frn_waitq);
5309 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5310 spin_lock_init(&memcg->deferred_split_queue.split_queue_lock);
5311 INIT_LIST_HEAD(&memcg->deferred_split_queue.split_queue);
5312 memcg->deferred_split_queue.split_queue_len = 0;
5314 idr_replace(&mem_cgroup_idr, memcg, memcg->id.id);
5317 mem_cgroup_id_remove(memcg);
5318 __mem_cgroup_free(memcg);
5319 return ERR_PTR(error);
5322 static struct cgroup_subsys_state * __ref
5323 mem_cgroup_css_alloc(struct cgroup_subsys_state *parent_css)
5325 struct mem_cgroup *parent = mem_cgroup_from_css(parent_css);
5326 struct mem_cgroup *memcg, *old_memcg;
5327 long error = -ENOMEM;
5329 old_memcg = set_active_memcg(parent);
5330 memcg = mem_cgroup_alloc();
5331 set_active_memcg(old_memcg);
5333 return ERR_CAST(memcg);
5335 page_counter_set_high(&memcg->memory, PAGE_COUNTER_MAX);
5336 memcg->soft_limit = PAGE_COUNTER_MAX;
5337 page_counter_set_high(&memcg->swap, PAGE_COUNTER_MAX);
5339 memcg->swappiness = mem_cgroup_swappiness(parent);
5340 memcg->oom_kill_disable = parent->oom_kill_disable;
5343 page_counter_init(&memcg->memory, NULL);
5344 page_counter_init(&memcg->swap, NULL);
5345 page_counter_init(&memcg->kmem, NULL);
5346 page_counter_init(&memcg->tcpmem, NULL);
5347 } else if (parent->use_hierarchy) {
5348 memcg->use_hierarchy = true;
5349 page_counter_init(&memcg->memory, &parent->memory);
5350 page_counter_init(&memcg->swap, &parent->swap);
5351 page_counter_init(&memcg->kmem, &parent->kmem);
5352 page_counter_init(&memcg->tcpmem, &parent->tcpmem);
5354 page_counter_init(&memcg->memory, &root_mem_cgroup->memory);
5355 page_counter_init(&memcg->swap, &root_mem_cgroup->swap);
5356 page_counter_init(&memcg->kmem, &root_mem_cgroup->kmem);
5357 page_counter_init(&memcg->tcpmem, &root_mem_cgroup->tcpmem);
5359 * Deeper hierachy with use_hierarchy == false doesn't make
5360 * much sense so let cgroup subsystem know about this
5361 * unfortunate state in our controller.
5363 if (parent != root_mem_cgroup)
5364 memory_cgrp_subsys.broken_hierarchy = true;
5367 /* The following stuff does not apply to the root */
5369 root_mem_cgroup = memcg;
5373 error = memcg_online_kmem(memcg);
5377 if (cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_nosocket)
5378 static_branch_inc(&memcg_sockets_enabled_key);
5382 mem_cgroup_id_remove(memcg);
5383 mem_cgroup_free(memcg);
5384 return ERR_PTR(error);
5387 static int mem_cgroup_css_online(struct cgroup_subsys_state *css)
5389 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5392 * A memcg must be visible for memcg_expand_shrinker_maps()
5393 * by the time the maps are allocated. So, we allocate maps
5394 * here, when for_each_mem_cgroup() can't skip it.
5396 if (memcg_alloc_shrinker_maps(memcg)) {
5397 mem_cgroup_id_remove(memcg);
5401 /* Online state pins memcg ID, memcg ID pins CSS */
5402 refcount_set(&memcg->id.ref, 1);
5407 static void mem_cgroup_css_offline(struct cgroup_subsys_state *css)
5409 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5410 struct mem_cgroup_event *event, *tmp;
5413 * Unregister events and notify userspace.
5414 * Notify userspace about cgroup removing only after rmdir of cgroup
5415 * directory to avoid race between userspace and kernelspace.
5417 spin_lock(&memcg->event_list_lock);
5418 list_for_each_entry_safe(event, tmp, &memcg->event_list, list) {
5419 list_del_init(&event->list);
5420 schedule_work(&event->remove);
5422 spin_unlock(&memcg->event_list_lock);
5424 page_counter_set_min(&memcg->memory, 0);
5425 page_counter_set_low(&memcg->memory, 0);
5427 memcg_offline_kmem(memcg);
5428 wb_memcg_offline(memcg);
5430 drain_all_stock(memcg);
5432 mem_cgroup_id_put(memcg);
5435 static void mem_cgroup_css_released(struct cgroup_subsys_state *css)
5437 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5439 invalidate_reclaim_iterators(memcg);
5442 static void mem_cgroup_css_free(struct cgroup_subsys_state *css)
5444 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5445 int __maybe_unused i;
5447 #ifdef CONFIG_CGROUP_WRITEBACK
5448 for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++)
5449 wb_wait_for_completion(&memcg->cgwb_frn[i].done);
5451 if (cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_nosocket)
5452 static_branch_dec(&memcg_sockets_enabled_key);
5454 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && memcg->tcpmem_active)
5455 static_branch_dec(&memcg_sockets_enabled_key);
5457 vmpressure_cleanup(&memcg->vmpressure);
5458 cancel_work_sync(&memcg->high_work);
5459 mem_cgroup_remove_from_trees(memcg);
5460 memcg_free_shrinker_maps(memcg);
5461 memcg_free_kmem(memcg);
5462 mem_cgroup_free(memcg);
5466 * mem_cgroup_css_reset - reset the states of a mem_cgroup
5467 * @css: the target css
5469 * Reset the states of the mem_cgroup associated with @css. This is
5470 * invoked when the userland requests disabling on the default hierarchy
5471 * but the memcg is pinned through dependency. The memcg should stop
5472 * applying policies and should revert to the vanilla state as it may be
5473 * made visible again.
5475 * The current implementation only resets the essential configurations.
5476 * This needs to be expanded to cover all the visible parts.
5478 static void mem_cgroup_css_reset(struct cgroup_subsys_state *css)
5480 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5482 page_counter_set_max(&memcg->memory, PAGE_COUNTER_MAX);
5483 page_counter_set_max(&memcg->swap, PAGE_COUNTER_MAX);
5484 page_counter_set_max(&memcg->kmem, PAGE_COUNTER_MAX);
5485 page_counter_set_max(&memcg->tcpmem, PAGE_COUNTER_MAX);
5486 page_counter_set_min(&memcg->memory, 0);
5487 page_counter_set_low(&memcg->memory, 0);
5488 page_counter_set_high(&memcg->memory, PAGE_COUNTER_MAX);
5489 memcg->soft_limit = PAGE_COUNTER_MAX;
5490 page_counter_set_high(&memcg->swap, PAGE_COUNTER_MAX);
5491 memcg_wb_domain_size_changed(memcg);
5495 /* Handlers for move charge at task migration. */
5496 static int mem_cgroup_do_precharge(unsigned long count)
5500 /* Try a single bulk charge without reclaim first, kswapd may wake */
5501 ret = try_charge(mc.to, GFP_KERNEL & ~__GFP_DIRECT_RECLAIM, count);
5503 mc.precharge += count;
5507 /* Try charges one by one with reclaim, but do not retry */
5509 ret = try_charge(mc.to, GFP_KERNEL | __GFP_NORETRY, 1);
5523 enum mc_target_type {
5530 static struct page *mc_handle_present_pte(struct vm_area_struct *vma,
5531 unsigned long addr, pte_t ptent)
5533 struct page *page = vm_normal_page(vma, addr, ptent);
5535 if (!page || !page_mapped(page))
5537 if (PageAnon(page)) {
5538 if (!(mc.flags & MOVE_ANON))
5541 if (!(mc.flags & MOVE_FILE))
5544 if (!get_page_unless_zero(page))
5550 #if defined(CONFIG_SWAP) || defined(CONFIG_DEVICE_PRIVATE)
5551 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
5552 pte_t ptent, swp_entry_t *entry)
5554 struct page *page = NULL;
5555 swp_entry_t ent = pte_to_swp_entry(ptent);
5557 if (!(mc.flags & MOVE_ANON))
5561 * Handle MEMORY_DEVICE_PRIVATE which are ZONE_DEVICE page belonging to
5562 * a device and because they are not accessible by CPU they are store
5563 * as special swap entry in the CPU page table.
5565 if (is_device_private_entry(ent)) {
5566 page = device_private_entry_to_page(ent);
5568 * MEMORY_DEVICE_PRIVATE means ZONE_DEVICE page and which have
5569 * a refcount of 1 when free (unlike normal page)
5571 if (!page_ref_add_unless(page, 1, 1))
5576 if (non_swap_entry(ent))
5580 * Because lookup_swap_cache() updates some statistics counter,
5581 * we call find_get_page() with swapper_space directly.
5583 page = find_get_page(swap_address_space(ent), swp_offset(ent));
5584 entry->val = ent.val;
5589 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
5590 pte_t ptent, swp_entry_t *entry)
5596 static struct page *mc_handle_file_pte(struct vm_area_struct *vma,
5597 unsigned long addr, pte_t ptent, swp_entry_t *entry)
5599 if (!vma->vm_file) /* anonymous vma */
5601 if (!(mc.flags & MOVE_FILE))
5604 /* page is moved even if it's not RSS of this task(page-faulted). */
5605 /* shmem/tmpfs may report page out on swap: account for that too. */
5606 return find_get_incore_page(vma->vm_file->f_mapping,
5607 linear_page_index(vma, addr));
5611 * mem_cgroup_move_account - move account of the page
5613 * @compound: charge the page as compound or small page
5614 * @from: mem_cgroup which the page is moved from.
5615 * @to: mem_cgroup which the page is moved to. @from != @to.
5617 * The caller must make sure the page is not on LRU (isolate_page() is useful.)
5619 * This function doesn't do "charge" to new cgroup and doesn't do "uncharge"
5622 static int mem_cgroup_move_account(struct page *page,
5624 struct mem_cgroup *from,
5625 struct mem_cgroup *to)
5627 struct lruvec *from_vec, *to_vec;
5628 struct pglist_data *pgdat;
5629 unsigned int nr_pages = compound ? thp_nr_pages(page) : 1;
5632 VM_BUG_ON(from == to);
5633 VM_BUG_ON_PAGE(PageLRU(page), page);
5634 VM_BUG_ON(compound && !PageTransHuge(page));
5637 * Prevent mem_cgroup_migrate() from looking at
5638 * page->mem_cgroup of its source page while we change it.
5641 if (!trylock_page(page))
5645 if (page->mem_cgroup != from)
5648 pgdat = page_pgdat(page);
5649 from_vec = mem_cgroup_lruvec(from, pgdat);
5650 to_vec = mem_cgroup_lruvec(to, pgdat);
5652 lock_page_memcg(page);
5654 if (PageAnon(page)) {
5655 if (page_mapped(page)) {
5656 __mod_lruvec_state(from_vec, NR_ANON_MAPPED, -nr_pages);
5657 __mod_lruvec_state(to_vec, NR_ANON_MAPPED, nr_pages);
5658 if (PageTransHuge(page)) {
5659 __mod_lruvec_state(from_vec, NR_ANON_THPS,
5661 __mod_lruvec_state(to_vec, NR_ANON_THPS,
5667 __mod_lruvec_state(from_vec, NR_FILE_PAGES, -nr_pages);
5668 __mod_lruvec_state(to_vec, NR_FILE_PAGES, nr_pages);
5670 if (PageSwapBacked(page)) {
5671 __mod_lruvec_state(from_vec, NR_SHMEM, -nr_pages);
5672 __mod_lruvec_state(to_vec, NR_SHMEM, nr_pages);
5675 if (page_mapped(page)) {
5676 __mod_lruvec_state(from_vec, NR_FILE_MAPPED, -nr_pages);
5677 __mod_lruvec_state(to_vec, NR_FILE_MAPPED, nr_pages);
5680 if (PageDirty(page)) {
5681 struct address_space *mapping = page_mapping(page);
5683 if (mapping_can_writeback(mapping)) {
5684 __mod_lruvec_state(from_vec, NR_FILE_DIRTY,
5686 __mod_lruvec_state(to_vec, NR_FILE_DIRTY,
5692 if (PageWriteback(page)) {
5693 __mod_lruvec_state(from_vec, NR_WRITEBACK, -nr_pages);
5694 __mod_lruvec_state(to_vec, NR_WRITEBACK, nr_pages);
5698 * All state has been migrated, let's switch to the new memcg.
5700 * It is safe to change page->mem_cgroup here because the page
5701 * is referenced, charged, isolated, and locked: we can't race
5702 * with (un)charging, migration, LRU putback, or anything else
5703 * that would rely on a stable page->mem_cgroup.
5705 * Note that lock_page_memcg is a memcg lock, not a page lock,
5706 * to save space. As soon as we switch page->mem_cgroup to a
5707 * new memcg that isn't locked, the above state can change
5708 * concurrently again. Make sure we're truly done with it.
5713 css_put(&from->css);
5715 page->mem_cgroup = to;
5717 __unlock_page_memcg(from);
5721 local_irq_disable();
5722 mem_cgroup_charge_statistics(to, page, nr_pages);
5723 memcg_check_events(to, page);
5724 mem_cgroup_charge_statistics(from, page, -nr_pages);
5725 memcg_check_events(from, page);
5734 * get_mctgt_type - get target type of moving charge
5735 * @vma: the vma the pte to be checked belongs
5736 * @addr: the address corresponding to the pte to be checked
5737 * @ptent: the pte to be checked
5738 * @target: the pointer the target page or swap ent will be stored(can be NULL)
5741 * 0(MC_TARGET_NONE): if the pte is not a target for move charge.
5742 * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for
5743 * move charge. if @target is not NULL, the page is stored in target->page
5744 * with extra refcnt got(Callers should handle it).
5745 * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a
5746 * target for charge migration. if @target is not NULL, the entry is stored
5748 * 3(MC_TARGET_DEVICE): like MC_TARGET_PAGE but page is MEMORY_DEVICE_PRIVATE
5749 * (so ZONE_DEVICE page and thus not on the lru).
5750 * For now we such page is charge like a regular page would be as for all
5751 * intent and purposes it is just special memory taking the place of a
5754 * See Documentations/vm/hmm.txt and include/linux/hmm.h
5756 * Called with pte lock held.
5759 static enum mc_target_type get_mctgt_type(struct vm_area_struct *vma,
5760 unsigned long addr, pte_t ptent, union mc_target *target)
5762 struct page *page = NULL;
5763 enum mc_target_type ret = MC_TARGET_NONE;
5764 swp_entry_t ent = { .val = 0 };
5766 if (pte_present(ptent))
5767 page = mc_handle_present_pte(vma, addr, ptent);
5768 else if (is_swap_pte(ptent))
5769 page = mc_handle_swap_pte(vma, ptent, &ent);
5770 else if (pte_none(ptent))
5771 page = mc_handle_file_pte(vma, addr, ptent, &ent);
5773 if (!page && !ent.val)
5777 * Do only loose check w/o serialization.
5778 * mem_cgroup_move_account() checks the page is valid or
5779 * not under LRU exclusion.
5781 if (page->mem_cgroup == mc.from) {
5782 ret = MC_TARGET_PAGE;
5783 if (is_device_private_page(page))
5784 ret = MC_TARGET_DEVICE;
5786 target->page = page;
5788 if (!ret || !target)
5792 * There is a swap entry and a page doesn't exist or isn't charged.
5793 * But we cannot move a tail-page in a THP.
5795 if (ent.val && !ret && (!page || !PageTransCompound(page)) &&
5796 mem_cgroup_id(mc.from) == lookup_swap_cgroup_id(ent)) {
5797 ret = MC_TARGET_SWAP;
5804 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5806 * We don't consider PMD mapped swapping or file mapped pages because THP does
5807 * not support them for now.
5808 * Caller should make sure that pmd_trans_huge(pmd) is true.
5810 static enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
5811 unsigned long addr, pmd_t pmd, union mc_target *target)
5813 struct page *page = NULL;
5814 enum mc_target_type ret = MC_TARGET_NONE;
5816 if (unlikely(is_swap_pmd(pmd))) {
5817 VM_BUG_ON(thp_migration_supported() &&
5818 !is_pmd_migration_entry(pmd));
5821 page = pmd_page(pmd);
5822 VM_BUG_ON_PAGE(!page || !PageHead(page), page);
5823 if (!(mc.flags & MOVE_ANON))
5825 if (page->mem_cgroup == mc.from) {
5826 ret = MC_TARGET_PAGE;
5829 target->page = page;
5835 static inline enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
5836 unsigned long addr, pmd_t pmd, union mc_target *target)
5838 return MC_TARGET_NONE;
5842 static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd,
5843 unsigned long addr, unsigned long end,
5844 struct mm_walk *walk)
5846 struct vm_area_struct *vma = walk->vma;
5850 ptl = pmd_trans_huge_lock(pmd, vma);
5853 * Note their can not be MC_TARGET_DEVICE for now as we do not
5854 * support transparent huge page with MEMORY_DEVICE_PRIVATE but
5855 * this might change.
5857 if (get_mctgt_type_thp(vma, addr, *pmd, NULL) == MC_TARGET_PAGE)
5858 mc.precharge += HPAGE_PMD_NR;
5863 if (pmd_trans_unstable(pmd))
5865 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
5866 for (; addr != end; pte++, addr += PAGE_SIZE)
5867 if (get_mctgt_type(vma, addr, *pte, NULL))
5868 mc.precharge++; /* increment precharge temporarily */
5869 pte_unmap_unlock(pte - 1, ptl);
5875 static const struct mm_walk_ops precharge_walk_ops = {
5876 .pmd_entry = mem_cgroup_count_precharge_pte_range,
5879 static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm)
5881 unsigned long precharge;
5884 walk_page_range(mm, 0, mm->highest_vm_end, &precharge_walk_ops, NULL);
5885 mmap_read_unlock(mm);
5887 precharge = mc.precharge;
5893 static int mem_cgroup_precharge_mc(struct mm_struct *mm)
5895 unsigned long precharge = mem_cgroup_count_precharge(mm);
5897 VM_BUG_ON(mc.moving_task);
5898 mc.moving_task = current;
5899 return mem_cgroup_do_precharge(precharge);
5902 /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */
5903 static void __mem_cgroup_clear_mc(void)
5905 struct mem_cgroup *from = mc.from;
5906 struct mem_cgroup *to = mc.to;
5908 /* we must uncharge all the leftover precharges from mc.to */
5910 cancel_charge(mc.to, mc.precharge);
5914 * we didn't uncharge from mc.from at mem_cgroup_move_account(), so
5915 * we must uncharge here.
5917 if (mc.moved_charge) {
5918 cancel_charge(mc.from, mc.moved_charge);
5919 mc.moved_charge = 0;
5921 /* we must fixup refcnts and charges */
5922 if (mc.moved_swap) {
5923 /* uncharge swap account from the old cgroup */
5924 if (!mem_cgroup_is_root(mc.from))
5925 page_counter_uncharge(&mc.from->memsw, mc.moved_swap);
5927 mem_cgroup_id_put_many(mc.from, mc.moved_swap);
5930 * we charged both to->memory and to->memsw, so we
5931 * should uncharge to->memory.
5933 if (!mem_cgroup_is_root(mc.to))
5934 page_counter_uncharge(&mc.to->memory, mc.moved_swap);
5938 memcg_oom_recover(from);
5939 memcg_oom_recover(to);
5940 wake_up_all(&mc.waitq);
5943 static void mem_cgroup_clear_mc(void)
5945 struct mm_struct *mm = mc.mm;
5948 * we must clear moving_task before waking up waiters at the end of
5951 mc.moving_task = NULL;
5952 __mem_cgroup_clear_mc();
5953 spin_lock(&mc.lock);
5957 spin_unlock(&mc.lock);
5962 static int mem_cgroup_can_attach(struct cgroup_taskset *tset)
5964 struct cgroup_subsys_state *css;
5965 struct mem_cgroup *memcg = NULL; /* unneeded init to make gcc happy */
5966 struct mem_cgroup *from;
5967 struct task_struct *leader, *p;
5968 struct mm_struct *mm;
5969 unsigned long move_flags;
5972 /* charge immigration isn't supported on the default hierarchy */
5973 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
5977 * Multi-process migrations only happen on the default hierarchy
5978 * where charge immigration is not used. Perform charge
5979 * immigration if @tset contains a leader and whine if there are
5983 cgroup_taskset_for_each_leader(leader, css, tset) {
5986 memcg = mem_cgroup_from_css(css);
5992 * We are now commited to this value whatever it is. Changes in this
5993 * tunable will only affect upcoming migrations, not the current one.
5994 * So we need to save it, and keep it going.
5996 move_flags = READ_ONCE(memcg->move_charge_at_immigrate);
6000 from = mem_cgroup_from_task(p);
6002 VM_BUG_ON(from == memcg);
6004 mm = get_task_mm(p);
6007 /* We move charges only when we move a owner of the mm */
6008 if (mm->owner == p) {
6011 VM_BUG_ON(mc.precharge);
6012 VM_BUG_ON(mc.moved_charge);
6013 VM_BUG_ON(mc.moved_swap);
6015 spin_lock(&mc.lock);
6019 mc.flags = move_flags;
6020 spin_unlock(&mc.lock);
6021 /* We set mc.moving_task later */
6023 ret = mem_cgroup_precharge_mc(mm);
6025 mem_cgroup_clear_mc();
6032 static void mem_cgroup_cancel_attach(struct cgroup_taskset *tset)
6035 mem_cgroup_clear_mc();
6038 static int mem_cgroup_move_charge_pte_range(pmd_t *pmd,
6039 unsigned long addr, unsigned long end,
6040 struct mm_walk *walk)
6043 struct vm_area_struct *vma = walk->vma;
6046 enum mc_target_type target_type;
6047 union mc_target target;
6050 ptl = pmd_trans_huge_lock(pmd, vma);
6052 if (mc.precharge < HPAGE_PMD_NR) {
6056 target_type = get_mctgt_type_thp(vma, addr, *pmd, &target);
6057 if (target_type == MC_TARGET_PAGE) {
6059 if (!isolate_lru_page(page)) {
6060 if (!mem_cgroup_move_account(page, true,
6062 mc.precharge -= HPAGE_PMD_NR;
6063 mc.moved_charge += HPAGE_PMD_NR;
6065 putback_lru_page(page);
6068 } else if (target_type == MC_TARGET_DEVICE) {
6070 if (!mem_cgroup_move_account(page, true,
6072 mc.precharge -= HPAGE_PMD_NR;
6073 mc.moved_charge += HPAGE_PMD_NR;
6081 if (pmd_trans_unstable(pmd))
6084 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
6085 for (; addr != end; addr += PAGE_SIZE) {
6086 pte_t ptent = *(pte++);
6087 bool device = false;
6093 switch (get_mctgt_type(vma, addr, ptent, &target)) {
6094 case MC_TARGET_DEVICE:
6097 case MC_TARGET_PAGE:
6100 * We can have a part of the split pmd here. Moving it
6101 * can be done but it would be too convoluted so simply
6102 * ignore such a partial THP and keep it in original
6103 * memcg. There should be somebody mapping the head.
6105 if (PageTransCompound(page))
6107 if (!device && isolate_lru_page(page))
6109 if (!mem_cgroup_move_account(page, false,
6112 /* we uncharge from mc.from later. */
6116 putback_lru_page(page);
6117 put: /* get_mctgt_type() gets the page */
6120 case MC_TARGET_SWAP:
6122 if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to)) {
6124 mem_cgroup_id_get_many(mc.to, 1);
6125 /* we fixup other refcnts and charges later. */
6133 pte_unmap_unlock(pte - 1, ptl);
6138 * We have consumed all precharges we got in can_attach().
6139 * We try charge one by one, but don't do any additional
6140 * charges to mc.to if we have failed in charge once in attach()
6143 ret = mem_cgroup_do_precharge(1);
6151 static const struct mm_walk_ops charge_walk_ops = {
6152 .pmd_entry = mem_cgroup_move_charge_pte_range,
6155 static void mem_cgroup_move_charge(void)
6157 lru_add_drain_all();
6159 * Signal lock_page_memcg() to take the memcg's move_lock
6160 * while we're moving its pages to another memcg. Then wait
6161 * for already started RCU-only updates to finish.
6163 atomic_inc(&mc.from->moving_account);
6166 if (unlikely(!mmap_read_trylock(mc.mm))) {
6168 * Someone who are holding the mmap_lock might be waiting in
6169 * waitq. So we cancel all extra charges, wake up all waiters,
6170 * and retry. Because we cancel precharges, we might not be able
6171 * to move enough charges, but moving charge is a best-effort
6172 * feature anyway, so it wouldn't be a big problem.
6174 __mem_cgroup_clear_mc();
6179 * When we have consumed all precharges and failed in doing
6180 * additional charge, the page walk just aborts.
6182 walk_page_range(mc.mm, 0, mc.mm->highest_vm_end, &charge_walk_ops,
6185 mmap_read_unlock(mc.mm);
6186 atomic_dec(&mc.from->moving_account);
6189 static void mem_cgroup_move_task(void)
6192 mem_cgroup_move_charge();
6193 mem_cgroup_clear_mc();
6196 #else /* !CONFIG_MMU */
6197 static int mem_cgroup_can_attach(struct cgroup_taskset *tset)
6201 static void mem_cgroup_cancel_attach(struct cgroup_taskset *tset)
6204 static void mem_cgroup_move_task(void)
6210 * Cgroup retains root cgroups across [un]mount cycles making it necessary
6211 * to verify whether we're attached to the default hierarchy on each mount
6214 static void mem_cgroup_bind(struct cgroup_subsys_state *root_css)
6217 * use_hierarchy is forced on the default hierarchy. cgroup core
6218 * guarantees that @root doesn't have any children, so turning it
6219 * on for the root memcg is enough.
6221 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
6222 root_mem_cgroup->use_hierarchy = true;
6224 root_mem_cgroup->use_hierarchy = false;
6227 static int seq_puts_memcg_tunable(struct seq_file *m, unsigned long value)
6229 if (value == PAGE_COUNTER_MAX)
6230 seq_puts(m, "max\n");
6232 seq_printf(m, "%llu\n", (u64)value * PAGE_SIZE);
6237 static u64 memory_current_read(struct cgroup_subsys_state *css,
6240 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
6242 return (u64)page_counter_read(&memcg->memory) * PAGE_SIZE;
6245 static int memory_min_show(struct seq_file *m, void *v)
6247 return seq_puts_memcg_tunable(m,
6248 READ_ONCE(mem_cgroup_from_seq(m)->memory.min));
6251 static ssize_t memory_min_write(struct kernfs_open_file *of,
6252 char *buf, size_t nbytes, loff_t off)
6254 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6258 buf = strstrip(buf);
6259 err = page_counter_memparse(buf, "max", &min);
6263 page_counter_set_min(&memcg->memory, min);
6268 static int memory_low_show(struct seq_file *m, void *v)
6270 return seq_puts_memcg_tunable(m,
6271 READ_ONCE(mem_cgroup_from_seq(m)->memory.low));
6274 static ssize_t memory_low_write(struct kernfs_open_file *of,
6275 char *buf, size_t nbytes, loff_t off)
6277 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6281 buf = strstrip(buf);
6282 err = page_counter_memparse(buf, "max", &low);
6286 page_counter_set_low(&memcg->memory, low);
6291 static int memory_high_show(struct seq_file *m, void *v)
6293 return seq_puts_memcg_tunable(m,
6294 READ_ONCE(mem_cgroup_from_seq(m)->memory.high));
6297 static ssize_t memory_high_write(struct kernfs_open_file *of,
6298 char *buf, size_t nbytes, loff_t off)
6300 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6301 unsigned int nr_retries = MAX_RECLAIM_RETRIES;
6302 bool drained = false;
6306 buf = strstrip(buf);
6307 err = page_counter_memparse(buf, "max", &high);
6312 unsigned long nr_pages = page_counter_read(&memcg->memory);
6313 unsigned long reclaimed;
6315 if (nr_pages <= high)
6318 if (signal_pending(current))
6322 drain_all_stock(memcg);
6327 reclaimed = try_to_free_mem_cgroup_pages(memcg, nr_pages - high,
6330 if (!reclaimed && !nr_retries--)
6334 page_counter_set_high(&memcg->memory, high);
6336 memcg_wb_domain_size_changed(memcg);
6341 static int memory_max_show(struct seq_file *m, void *v)
6343 return seq_puts_memcg_tunable(m,
6344 READ_ONCE(mem_cgroup_from_seq(m)->memory.max));
6347 static ssize_t memory_max_write(struct kernfs_open_file *of,
6348 char *buf, size_t nbytes, loff_t off)
6350 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6351 unsigned int nr_reclaims = MAX_RECLAIM_RETRIES;
6352 bool drained = false;
6356 buf = strstrip(buf);
6357 err = page_counter_memparse(buf, "max", &max);
6361 xchg(&memcg->memory.max, max);
6364 unsigned long nr_pages = page_counter_read(&memcg->memory);
6366 if (nr_pages <= max)
6369 if (signal_pending(current))
6373 drain_all_stock(memcg);
6379 if (!try_to_free_mem_cgroup_pages(memcg, nr_pages - max,
6385 memcg_memory_event(memcg, MEMCG_OOM);
6386 if (!mem_cgroup_out_of_memory(memcg, GFP_KERNEL, 0))
6390 memcg_wb_domain_size_changed(memcg);
6394 static void __memory_events_show(struct seq_file *m, atomic_long_t *events)
6396 seq_printf(m, "low %lu\n", atomic_long_read(&events[MEMCG_LOW]));
6397 seq_printf(m, "high %lu\n", atomic_long_read(&events[MEMCG_HIGH]));
6398 seq_printf(m, "max %lu\n", atomic_long_read(&events[MEMCG_MAX]));
6399 seq_printf(m, "oom %lu\n", atomic_long_read(&events[MEMCG_OOM]));
6400 seq_printf(m, "oom_kill %lu\n",
6401 atomic_long_read(&events[MEMCG_OOM_KILL]));
6404 static int memory_events_show(struct seq_file *m, void *v)
6406 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
6408 __memory_events_show(m, memcg->memory_events);
6412 static int memory_events_local_show(struct seq_file *m, void *v)
6414 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
6416 __memory_events_show(m, memcg->memory_events_local);
6420 static int memory_stat_show(struct seq_file *m, void *v)
6422 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
6425 buf = memory_stat_format(memcg);
6434 static int memory_numa_stat_show(struct seq_file *m, void *v)
6437 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
6439 for (i = 0; i < ARRAY_SIZE(memory_stats); i++) {
6442 if (memory_stats[i].idx >= NR_VM_NODE_STAT_ITEMS)
6445 seq_printf(m, "%s", memory_stats[i].name);
6446 for_each_node_state(nid, N_MEMORY) {
6448 struct lruvec *lruvec;
6450 lruvec = mem_cgroup_lruvec(memcg, NODE_DATA(nid));
6451 size = lruvec_page_state(lruvec, memory_stats[i].idx);
6452 size *= memory_stats[i].ratio;
6453 seq_printf(m, " N%d=%llu", nid, size);
6462 static int memory_oom_group_show(struct seq_file *m, void *v)
6464 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
6466 seq_printf(m, "%d\n", memcg->oom_group);
6471 static ssize_t memory_oom_group_write(struct kernfs_open_file *of,
6472 char *buf, size_t nbytes, loff_t off)
6474 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6477 buf = strstrip(buf);
6481 ret = kstrtoint(buf, 0, &oom_group);
6485 if (oom_group != 0 && oom_group != 1)
6488 memcg->oom_group = oom_group;
6493 static struct cftype memory_files[] = {
6496 .flags = CFTYPE_NOT_ON_ROOT,
6497 .read_u64 = memory_current_read,
6501 .flags = CFTYPE_NOT_ON_ROOT,
6502 .seq_show = memory_min_show,
6503 .write = memory_min_write,
6507 .flags = CFTYPE_NOT_ON_ROOT,
6508 .seq_show = memory_low_show,
6509 .write = memory_low_write,
6513 .flags = CFTYPE_NOT_ON_ROOT,
6514 .seq_show = memory_high_show,
6515 .write = memory_high_write,
6519 .flags = CFTYPE_NOT_ON_ROOT,
6520 .seq_show = memory_max_show,
6521 .write = memory_max_write,
6525 .flags = CFTYPE_NOT_ON_ROOT,
6526 .file_offset = offsetof(struct mem_cgroup, events_file),
6527 .seq_show = memory_events_show,
6530 .name = "events.local",
6531 .flags = CFTYPE_NOT_ON_ROOT,
6532 .file_offset = offsetof(struct mem_cgroup, events_local_file),
6533 .seq_show = memory_events_local_show,
6537 .seq_show = memory_stat_show,
6541 .name = "numa_stat",
6542 .seq_show = memory_numa_stat_show,
6546 .name = "oom.group",
6547 .flags = CFTYPE_NOT_ON_ROOT | CFTYPE_NS_DELEGATABLE,
6548 .seq_show = memory_oom_group_show,
6549 .write = memory_oom_group_write,
6554 struct cgroup_subsys memory_cgrp_subsys = {
6555 .css_alloc = mem_cgroup_css_alloc,
6556 .css_online = mem_cgroup_css_online,
6557 .css_offline = mem_cgroup_css_offline,
6558 .css_released = mem_cgroup_css_released,
6559 .css_free = mem_cgroup_css_free,
6560 .css_reset = mem_cgroup_css_reset,
6561 .can_attach = mem_cgroup_can_attach,
6562 .cancel_attach = mem_cgroup_cancel_attach,
6563 .post_attach = mem_cgroup_move_task,
6564 .bind = mem_cgroup_bind,
6565 .dfl_cftypes = memory_files,
6566 .legacy_cftypes = mem_cgroup_legacy_files,
6571 * This function calculates an individual cgroup's effective
6572 * protection which is derived from its own memory.min/low, its
6573 * parent's and siblings' settings, as well as the actual memory
6574 * distribution in the tree.
6576 * The following rules apply to the effective protection values:
6578 * 1. At the first level of reclaim, effective protection is equal to
6579 * the declared protection in memory.min and memory.low.
6581 * 2. To enable safe delegation of the protection configuration, at
6582 * subsequent levels the effective protection is capped to the
6583 * parent's effective protection.
6585 * 3. To make complex and dynamic subtrees easier to configure, the
6586 * user is allowed to overcommit the declared protection at a given
6587 * level. If that is the case, the parent's effective protection is
6588 * distributed to the children in proportion to how much protection
6589 * they have declared and how much of it they are utilizing.
6591 * This makes distribution proportional, but also work-conserving:
6592 * if one cgroup claims much more protection than it uses memory,
6593 * the unused remainder is available to its siblings.
6595 * 4. Conversely, when the declared protection is undercommitted at a
6596 * given level, the distribution of the larger parental protection
6597 * budget is NOT proportional. A cgroup's protection from a sibling
6598 * is capped to its own memory.min/low setting.
6600 * 5. However, to allow protecting recursive subtrees from each other
6601 * without having to declare each individual cgroup's fixed share
6602 * of the ancestor's claim to protection, any unutilized -
6603 * "floating" - protection from up the tree is distributed in
6604 * proportion to each cgroup's *usage*. This makes the protection
6605 * neutral wrt sibling cgroups and lets them compete freely over
6606 * the shared parental protection budget, but it protects the
6607 * subtree as a whole from neighboring subtrees.
6609 * Note that 4. and 5. are not in conflict: 4. is about protecting
6610 * against immediate siblings whereas 5. is about protecting against
6611 * neighboring subtrees.
6613 static unsigned long effective_protection(unsigned long usage,
6614 unsigned long parent_usage,
6615 unsigned long setting,
6616 unsigned long parent_effective,
6617 unsigned long siblings_protected)
6619 unsigned long protected;
6622 protected = min(usage, setting);
6624 * If all cgroups at this level combined claim and use more
6625 * protection then what the parent affords them, distribute
6626 * shares in proportion to utilization.
6628 * We are using actual utilization rather than the statically
6629 * claimed protection in order to be work-conserving: claimed
6630 * but unused protection is available to siblings that would
6631 * otherwise get a smaller chunk than what they claimed.
6633 if (siblings_protected > parent_effective)
6634 return protected * parent_effective / siblings_protected;
6637 * Ok, utilized protection of all children is within what the
6638 * parent affords them, so we know whatever this child claims
6639 * and utilizes is effectively protected.
6641 * If there is unprotected usage beyond this value, reclaim
6642 * will apply pressure in proportion to that amount.
6644 * If there is unutilized protection, the cgroup will be fully
6645 * shielded from reclaim, but we do return a smaller value for
6646 * protection than what the group could enjoy in theory. This
6647 * is okay. With the overcommit distribution above, effective
6648 * protection is always dependent on how memory is actually
6649 * consumed among the siblings anyway.
6654 * If the children aren't claiming (all of) the protection
6655 * afforded to them by the parent, distribute the remainder in
6656 * proportion to the (unprotected) memory of each cgroup. That
6657 * way, cgroups that aren't explicitly prioritized wrt each
6658 * other compete freely over the allowance, but they are
6659 * collectively protected from neighboring trees.
6661 * We're using unprotected memory for the weight so that if
6662 * some cgroups DO claim explicit protection, we don't protect
6663 * the same bytes twice.
6665 * Check both usage and parent_usage against the respective
6666 * protected values. One should imply the other, but they
6667 * aren't read atomically - make sure the division is sane.
6669 if (!(cgrp_dfl_root.flags & CGRP_ROOT_MEMORY_RECURSIVE_PROT))
6671 if (parent_effective > siblings_protected &&
6672 parent_usage > siblings_protected &&
6673 usage > protected) {
6674 unsigned long unclaimed;
6676 unclaimed = parent_effective - siblings_protected;
6677 unclaimed *= usage - protected;
6678 unclaimed /= parent_usage - siblings_protected;
6687 * mem_cgroup_protected - check if memory consumption is in the normal range
6688 * @root: the top ancestor of the sub-tree being checked
6689 * @memcg: the memory cgroup to check
6691 * WARNING: This function is not stateless! It can only be used as part
6692 * of a top-down tree iteration, not for isolated queries.
6694 void mem_cgroup_calculate_protection(struct mem_cgroup *root,
6695 struct mem_cgroup *memcg)
6697 unsigned long usage, parent_usage;
6698 struct mem_cgroup *parent;
6700 if (mem_cgroup_disabled())
6704 root = root_mem_cgroup;
6707 * Effective values of the reclaim targets are ignored so they
6708 * can be stale. Have a look at mem_cgroup_protection for more
6710 * TODO: calculation should be more robust so that we do not need
6711 * that special casing.
6716 usage = page_counter_read(&memcg->memory);
6720 parent = parent_mem_cgroup(memcg);
6721 /* No parent means a non-hierarchical mode on v1 memcg */
6725 if (parent == root) {
6726 memcg->memory.emin = READ_ONCE(memcg->memory.min);
6727 memcg->memory.elow = READ_ONCE(memcg->memory.low);
6731 parent_usage = page_counter_read(&parent->memory);
6733 WRITE_ONCE(memcg->memory.emin, effective_protection(usage, parent_usage,
6734 READ_ONCE(memcg->memory.min),
6735 READ_ONCE(parent->memory.emin),
6736 atomic_long_read(&parent->memory.children_min_usage)));
6738 WRITE_ONCE(memcg->memory.elow, effective_protection(usage, parent_usage,
6739 READ_ONCE(memcg->memory.low),
6740 READ_ONCE(parent->memory.elow),
6741 atomic_long_read(&parent->memory.children_low_usage)));
6745 * mem_cgroup_charge - charge a newly allocated page to a cgroup
6746 * @page: page to charge
6747 * @mm: mm context of the victim
6748 * @gfp_mask: reclaim mode
6750 * Try to charge @page to the memcg that @mm belongs to, reclaiming
6751 * pages according to @gfp_mask if necessary.
6753 * Returns 0 on success. Otherwise, an error code is returned.
6755 int mem_cgroup_charge(struct page *page, struct mm_struct *mm, gfp_t gfp_mask)
6757 unsigned int nr_pages = thp_nr_pages(page);
6758 struct mem_cgroup *memcg = NULL;
6761 if (mem_cgroup_disabled())
6764 if (PageSwapCache(page)) {
6765 swp_entry_t ent = { .val = page_private(page), };
6769 * Every swap fault against a single page tries to charge the
6770 * page, bail as early as possible. shmem_unuse() encounters
6771 * already charged pages, too. page->mem_cgroup is protected
6772 * by the page lock, which serializes swap cache removal, which
6773 * in turn serializes uncharging.
6775 VM_BUG_ON_PAGE(!PageLocked(page), page);
6776 if (compound_head(page)->mem_cgroup)
6779 id = lookup_swap_cgroup_id(ent);
6781 memcg = mem_cgroup_from_id(id);
6782 if (memcg && !css_tryget_online(&memcg->css))
6788 memcg = get_mem_cgroup_from_mm(mm);
6790 ret = try_charge(memcg, gfp_mask, nr_pages);
6794 css_get(&memcg->css);
6795 commit_charge(page, memcg);
6797 local_irq_disable();
6798 mem_cgroup_charge_statistics(memcg, page, nr_pages);
6799 memcg_check_events(memcg, page);
6802 if (PageSwapCache(page)) {
6803 swp_entry_t entry = { .val = page_private(page) };
6805 * The swap entry might not get freed for a long time,
6806 * let's not wait for it. The page already received a
6807 * memory+swap charge, drop the swap entry duplicate.
6809 mem_cgroup_uncharge_swap(entry, nr_pages);
6813 css_put(&memcg->css);
6818 struct uncharge_gather {
6819 struct mem_cgroup *memcg;
6820 unsigned long nr_pages;
6821 unsigned long pgpgout;
6822 unsigned long nr_kmem;
6823 struct page *dummy_page;
6826 static inline void uncharge_gather_clear(struct uncharge_gather *ug)
6828 memset(ug, 0, sizeof(*ug));
6831 static void uncharge_batch(const struct uncharge_gather *ug)
6833 unsigned long flags;
6835 if (!mem_cgroup_is_root(ug->memcg)) {
6836 page_counter_uncharge(&ug->memcg->memory, ug->nr_pages);
6837 if (do_memsw_account())
6838 page_counter_uncharge(&ug->memcg->memsw, ug->nr_pages);
6839 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && ug->nr_kmem)
6840 page_counter_uncharge(&ug->memcg->kmem, ug->nr_kmem);
6841 memcg_oom_recover(ug->memcg);
6844 local_irq_save(flags);
6845 __count_memcg_events(ug->memcg, PGPGOUT, ug->pgpgout);
6846 __this_cpu_add(ug->memcg->vmstats_percpu->nr_page_events, ug->nr_pages);
6847 memcg_check_events(ug->memcg, ug->dummy_page);
6848 local_irq_restore(flags);
6850 /* drop reference from uncharge_page */
6851 css_put(&ug->memcg->css);
6854 static void uncharge_page(struct page *page, struct uncharge_gather *ug)
6856 unsigned long nr_pages;
6858 VM_BUG_ON_PAGE(PageLRU(page), page);
6860 if (!page->mem_cgroup)
6864 * Nobody should be changing or seriously looking at
6865 * page->mem_cgroup at this point, we have fully
6866 * exclusive access to the page.
6869 if (ug->memcg != page->mem_cgroup) {
6872 uncharge_gather_clear(ug);
6874 ug->memcg = page->mem_cgroup;
6876 /* pairs with css_put in uncharge_batch */
6877 css_get(&ug->memcg->css);
6880 nr_pages = compound_nr(page);
6881 ug->nr_pages += nr_pages;
6883 if (!PageKmemcg(page)) {
6886 ug->nr_kmem += nr_pages;
6887 __ClearPageKmemcg(page);
6890 ug->dummy_page = page;
6891 page->mem_cgroup = NULL;
6892 css_put(&ug->memcg->css);
6895 static void uncharge_list(struct list_head *page_list)
6897 struct uncharge_gather ug;
6898 struct list_head *next;
6900 uncharge_gather_clear(&ug);
6903 * Note that the list can be a single page->lru; hence the
6904 * do-while loop instead of a simple list_for_each_entry().
6906 next = page_list->next;
6910 page = list_entry(next, struct page, lru);
6911 next = page->lru.next;
6913 uncharge_page(page, &ug);
6914 } while (next != page_list);
6917 uncharge_batch(&ug);
6921 * mem_cgroup_uncharge - uncharge a page
6922 * @page: page to uncharge
6924 * Uncharge a page previously charged with mem_cgroup_charge().
6926 void mem_cgroup_uncharge(struct page *page)
6928 struct uncharge_gather ug;
6930 if (mem_cgroup_disabled())
6933 /* Don't touch page->lru of any random page, pre-check: */
6934 if (!page->mem_cgroup)
6937 uncharge_gather_clear(&ug);
6938 uncharge_page(page, &ug);
6939 uncharge_batch(&ug);
6943 * mem_cgroup_uncharge_list - uncharge a list of page
6944 * @page_list: list of pages to uncharge
6946 * Uncharge a list of pages previously charged with
6947 * mem_cgroup_charge().
6949 void mem_cgroup_uncharge_list(struct list_head *page_list)
6951 if (mem_cgroup_disabled())
6954 if (!list_empty(page_list))
6955 uncharge_list(page_list);
6959 * mem_cgroup_migrate - charge a page's replacement
6960 * @oldpage: currently circulating page
6961 * @newpage: replacement page
6963 * Charge @newpage as a replacement page for @oldpage. @oldpage will
6964 * be uncharged upon free.
6966 * Both pages must be locked, @newpage->mapping must be set up.
6968 void mem_cgroup_migrate(struct page *oldpage, struct page *newpage)
6970 struct mem_cgroup *memcg;
6971 unsigned int nr_pages;
6972 unsigned long flags;
6974 VM_BUG_ON_PAGE(!PageLocked(oldpage), oldpage);
6975 VM_BUG_ON_PAGE(!PageLocked(newpage), newpage);
6976 VM_BUG_ON_PAGE(PageAnon(oldpage) != PageAnon(newpage), newpage);
6977 VM_BUG_ON_PAGE(PageTransHuge(oldpage) != PageTransHuge(newpage),
6980 if (mem_cgroup_disabled())
6983 /* Page cache replacement: new page already charged? */
6984 if (newpage->mem_cgroup)
6987 /* Swapcache readahead pages can get replaced before being charged */
6988 memcg = oldpage->mem_cgroup;
6992 /* Force-charge the new page. The old one will be freed soon */
6993 nr_pages = thp_nr_pages(newpage);
6995 page_counter_charge(&memcg->memory, nr_pages);
6996 if (do_memsw_account())
6997 page_counter_charge(&memcg->memsw, nr_pages);
6999 css_get(&memcg->css);
7000 commit_charge(newpage, memcg);
7002 local_irq_save(flags);
7003 mem_cgroup_charge_statistics(memcg, newpage, nr_pages);
7004 memcg_check_events(memcg, newpage);
7005 local_irq_restore(flags);
7008 DEFINE_STATIC_KEY_FALSE(memcg_sockets_enabled_key);
7009 EXPORT_SYMBOL(memcg_sockets_enabled_key);
7011 void mem_cgroup_sk_alloc(struct sock *sk)
7013 struct mem_cgroup *memcg;
7015 if (!mem_cgroup_sockets_enabled)
7018 /* Do not associate the sock with unrelated interrupted task's memcg. */
7023 memcg = mem_cgroup_from_task(current);
7024 if (memcg == root_mem_cgroup)
7026 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && !memcg->tcpmem_active)
7028 if (css_tryget(&memcg->css))
7029 sk->sk_memcg = memcg;
7034 void mem_cgroup_sk_free(struct sock *sk)
7037 css_put(&sk->sk_memcg->css);
7041 * mem_cgroup_charge_skmem - charge socket memory
7042 * @memcg: memcg to charge
7043 * @nr_pages: number of pages to charge
7045 * Charges @nr_pages to @memcg. Returns %true if the charge fit within
7046 * @memcg's configured limit, %false if the charge had to be forced.
7048 bool mem_cgroup_charge_skmem(struct mem_cgroup *memcg, unsigned int nr_pages)
7050 gfp_t gfp_mask = GFP_KERNEL;
7052 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) {
7053 struct page_counter *fail;
7055 if (page_counter_try_charge(&memcg->tcpmem, nr_pages, &fail)) {
7056 memcg->tcpmem_pressure = 0;
7059 page_counter_charge(&memcg->tcpmem, nr_pages);
7060 memcg->tcpmem_pressure = 1;
7064 /* Don't block in the packet receive path */
7066 gfp_mask = GFP_NOWAIT;
7068 mod_memcg_state(memcg, MEMCG_SOCK, nr_pages);
7070 if (try_charge(memcg, gfp_mask, nr_pages) == 0)
7073 try_charge(memcg, gfp_mask|__GFP_NOFAIL, nr_pages);
7078 * mem_cgroup_uncharge_skmem - uncharge socket memory
7079 * @memcg: memcg to uncharge
7080 * @nr_pages: number of pages to uncharge
7082 void mem_cgroup_uncharge_skmem(struct mem_cgroup *memcg, unsigned int nr_pages)
7084 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) {
7085 page_counter_uncharge(&memcg->tcpmem, nr_pages);
7089 mod_memcg_state(memcg, MEMCG_SOCK, -nr_pages);
7091 refill_stock(memcg, nr_pages);
7094 static int __init cgroup_memory(char *s)
7098 while ((token = strsep(&s, ",")) != NULL) {
7101 if (!strcmp(token, "nosocket"))
7102 cgroup_memory_nosocket = true;
7103 if (!strcmp(token, "nokmem"))
7104 cgroup_memory_nokmem = true;
7108 __setup("cgroup.memory=", cgroup_memory);
7111 * subsys_initcall() for memory controller.
7113 * Some parts like memcg_hotplug_cpu_dead() have to be initialized from this
7114 * context because of lock dependencies (cgroup_lock -> cpu hotplug) but
7115 * basically everything that doesn't depend on a specific mem_cgroup structure
7116 * should be initialized from here.
7118 static int __init mem_cgroup_init(void)
7122 cpuhp_setup_state_nocalls(CPUHP_MM_MEMCQ_DEAD, "mm/memctrl:dead", NULL,
7123 memcg_hotplug_cpu_dead);
7125 for_each_possible_cpu(cpu)
7126 INIT_WORK(&per_cpu_ptr(&memcg_stock, cpu)->work,
7129 for_each_node(node) {
7130 struct mem_cgroup_tree_per_node *rtpn;
7132 rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL,
7133 node_online(node) ? node : NUMA_NO_NODE);
7135 rtpn->rb_root = RB_ROOT;
7136 rtpn->rb_rightmost = NULL;
7137 spin_lock_init(&rtpn->lock);
7138 soft_limit_tree.rb_tree_per_node[node] = rtpn;
7143 subsys_initcall(mem_cgroup_init);
7145 #ifdef CONFIG_MEMCG_SWAP
7146 static struct mem_cgroup *mem_cgroup_id_get_online(struct mem_cgroup *memcg)
7148 while (!refcount_inc_not_zero(&memcg->id.ref)) {
7150 * The root cgroup cannot be destroyed, so it's refcount must
7153 if (WARN_ON_ONCE(memcg == root_mem_cgroup)) {
7157 memcg = parent_mem_cgroup(memcg);
7159 memcg = root_mem_cgroup;
7165 * mem_cgroup_swapout - transfer a memsw charge to swap
7166 * @page: page whose memsw charge to transfer
7167 * @entry: swap entry to move the charge to
7169 * Transfer the memsw charge of @page to @entry.
7171 void mem_cgroup_swapout(struct page *page, swp_entry_t entry)
7173 struct mem_cgroup *memcg, *swap_memcg;
7174 unsigned int nr_entries;
7175 unsigned short oldid;
7177 VM_BUG_ON_PAGE(PageLRU(page), page);
7178 VM_BUG_ON_PAGE(page_count(page), page);
7180 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
7183 memcg = page->mem_cgroup;
7185 /* Readahead page, never charged */
7190 * In case the memcg owning these pages has been offlined and doesn't
7191 * have an ID allocated to it anymore, charge the closest online
7192 * ancestor for the swap instead and transfer the memory+swap charge.
7194 swap_memcg = mem_cgroup_id_get_online(memcg);
7195 nr_entries = thp_nr_pages(page);
7196 /* Get references for the tail pages, too */
7198 mem_cgroup_id_get_many(swap_memcg, nr_entries - 1);
7199 oldid = swap_cgroup_record(entry, mem_cgroup_id(swap_memcg),
7201 VM_BUG_ON_PAGE(oldid, page);
7202 mod_memcg_state(swap_memcg, MEMCG_SWAP, nr_entries);
7204 page->mem_cgroup = NULL;
7206 if (!mem_cgroup_is_root(memcg))
7207 page_counter_uncharge(&memcg->memory, nr_entries);
7209 if (!cgroup_memory_noswap && memcg != swap_memcg) {
7210 if (!mem_cgroup_is_root(swap_memcg))
7211 page_counter_charge(&swap_memcg->memsw, nr_entries);
7212 page_counter_uncharge(&memcg->memsw, nr_entries);
7216 * Interrupts should be disabled here because the caller holds the
7217 * i_pages lock which is taken with interrupts-off. It is
7218 * important here to have the interrupts disabled because it is the
7219 * only synchronisation we have for updating the per-CPU variables.
7221 VM_BUG_ON(!irqs_disabled());
7222 mem_cgroup_charge_statistics(memcg, page, -nr_entries);
7223 memcg_check_events(memcg, page);
7225 css_put(&memcg->css);
7229 * mem_cgroup_try_charge_swap - try charging swap space for a page
7230 * @page: page being added to swap
7231 * @entry: swap entry to charge
7233 * Try to charge @page's memcg for the swap space at @entry.
7235 * Returns 0 on success, -ENOMEM on failure.
7237 int mem_cgroup_try_charge_swap(struct page *page, swp_entry_t entry)
7239 unsigned int nr_pages = thp_nr_pages(page);
7240 struct page_counter *counter;
7241 struct mem_cgroup *memcg;
7242 unsigned short oldid;
7244 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys))
7247 memcg = page->mem_cgroup;
7249 /* Readahead page, never charged */
7254 memcg_memory_event(memcg, MEMCG_SWAP_FAIL);
7258 memcg = mem_cgroup_id_get_online(memcg);
7260 if (!cgroup_memory_noswap && !mem_cgroup_is_root(memcg) &&
7261 !page_counter_try_charge(&memcg->swap, nr_pages, &counter)) {
7262 memcg_memory_event(memcg, MEMCG_SWAP_MAX);
7263 memcg_memory_event(memcg, MEMCG_SWAP_FAIL);
7264 mem_cgroup_id_put(memcg);
7268 /* Get references for the tail pages, too */
7270 mem_cgroup_id_get_many(memcg, nr_pages - 1);
7271 oldid = swap_cgroup_record(entry, mem_cgroup_id(memcg), nr_pages);
7272 VM_BUG_ON_PAGE(oldid, page);
7273 mod_memcg_state(memcg, MEMCG_SWAP, nr_pages);
7279 * mem_cgroup_uncharge_swap - uncharge swap space
7280 * @entry: swap entry to uncharge
7281 * @nr_pages: the amount of swap space to uncharge
7283 void mem_cgroup_uncharge_swap(swp_entry_t entry, unsigned int nr_pages)
7285 struct mem_cgroup *memcg;
7288 id = swap_cgroup_record(entry, 0, nr_pages);
7290 memcg = mem_cgroup_from_id(id);
7292 if (!cgroup_memory_noswap && !mem_cgroup_is_root(memcg)) {
7293 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
7294 page_counter_uncharge(&memcg->swap, nr_pages);
7296 page_counter_uncharge(&memcg->memsw, nr_pages);
7298 mod_memcg_state(memcg, MEMCG_SWAP, -nr_pages);
7299 mem_cgroup_id_put_many(memcg, nr_pages);
7304 long mem_cgroup_get_nr_swap_pages(struct mem_cgroup *memcg)
7306 long nr_swap_pages = get_nr_swap_pages();
7308 if (cgroup_memory_noswap || !cgroup_subsys_on_dfl(memory_cgrp_subsys))
7309 return nr_swap_pages;
7310 for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg))
7311 nr_swap_pages = min_t(long, nr_swap_pages,
7312 READ_ONCE(memcg->swap.max) -
7313 page_counter_read(&memcg->swap));
7314 return nr_swap_pages;
7317 bool mem_cgroup_swap_full(struct page *page)
7319 struct mem_cgroup *memcg;
7321 VM_BUG_ON_PAGE(!PageLocked(page), page);
7325 if (cgroup_memory_noswap || !cgroup_subsys_on_dfl(memory_cgrp_subsys))
7328 memcg = page->mem_cgroup;
7332 for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg)) {
7333 unsigned long usage = page_counter_read(&memcg->swap);
7335 if (usage * 2 >= READ_ONCE(memcg->swap.high) ||
7336 usage * 2 >= READ_ONCE(memcg->swap.max))
7343 static int __init setup_swap_account(char *s)
7345 if (!strcmp(s, "1"))
7346 cgroup_memory_noswap = 0;
7347 else if (!strcmp(s, "0"))
7348 cgroup_memory_noswap = 1;
7351 __setup("swapaccount=", setup_swap_account);
7353 static u64 swap_current_read(struct cgroup_subsys_state *css,
7356 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
7358 return (u64)page_counter_read(&memcg->swap) * PAGE_SIZE;
7361 static int swap_high_show(struct seq_file *m, void *v)
7363 return seq_puts_memcg_tunable(m,
7364 READ_ONCE(mem_cgroup_from_seq(m)->swap.high));
7367 static ssize_t swap_high_write(struct kernfs_open_file *of,
7368 char *buf, size_t nbytes, loff_t off)
7370 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
7374 buf = strstrip(buf);
7375 err = page_counter_memparse(buf, "max", &high);
7379 page_counter_set_high(&memcg->swap, high);
7384 static int swap_max_show(struct seq_file *m, void *v)
7386 return seq_puts_memcg_tunable(m,
7387 READ_ONCE(mem_cgroup_from_seq(m)->swap.max));
7390 static ssize_t swap_max_write(struct kernfs_open_file *of,
7391 char *buf, size_t nbytes, loff_t off)
7393 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
7397 buf = strstrip(buf);
7398 err = page_counter_memparse(buf, "max", &max);
7402 xchg(&memcg->swap.max, max);
7407 static int swap_events_show(struct seq_file *m, void *v)
7409 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
7411 seq_printf(m, "high %lu\n",
7412 atomic_long_read(&memcg->memory_events[MEMCG_SWAP_HIGH]));
7413 seq_printf(m, "max %lu\n",
7414 atomic_long_read(&memcg->memory_events[MEMCG_SWAP_MAX]));
7415 seq_printf(m, "fail %lu\n",
7416 atomic_long_read(&memcg->memory_events[MEMCG_SWAP_FAIL]));
7421 static struct cftype swap_files[] = {
7423 .name = "swap.current",
7424 .flags = CFTYPE_NOT_ON_ROOT,
7425 .read_u64 = swap_current_read,
7428 .name = "swap.high",
7429 .flags = CFTYPE_NOT_ON_ROOT,
7430 .seq_show = swap_high_show,
7431 .write = swap_high_write,
7435 .flags = CFTYPE_NOT_ON_ROOT,
7436 .seq_show = swap_max_show,
7437 .write = swap_max_write,
7440 .name = "swap.events",
7441 .flags = CFTYPE_NOT_ON_ROOT,
7442 .file_offset = offsetof(struct mem_cgroup, swap_events_file),
7443 .seq_show = swap_events_show,
7448 static struct cftype memsw_files[] = {
7450 .name = "memsw.usage_in_bytes",
7451 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE),
7452 .read_u64 = mem_cgroup_read_u64,
7455 .name = "memsw.max_usage_in_bytes",
7456 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE),
7457 .write = mem_cgroup_reset,
7458 .read_u64 = mem_cgroup_read_u64,
7461 .name = "memsw.limit_in_bytes",
7462 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT),
7463 .write = mem_cgroup_write,
7464 .read_u64 = mem_cgroup_read_u64,
7467 .name = "memsw.failcnt",
7468 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT),
7469 .write = mem_cgroup_reset,
7470 .read_u64 = mem_cgroup_read_u64,
7472 { }, /* terminate */
7476 * If mem_cgroup_swap_init() is implemented as a subsys_initcall()
7477 * instead of a core_initcall(), this could mean cgroup_memory_noswap still
7478 * remains set to false even when memcg is disabled via "cgroup_disable=memory"
7479 * boot parameter. This may result in premature OOPS inside
7480 * mem_cgroup_get_nr_swap_pages() function in corner cases.
7482 static int __init mem_cgroup_swap_init(void)
7484 /* No memory control -> no swap control */
7485 if (mem_cgroup_disabled())
7486 cgroup_memory_noswap = true;
7488 if (cgroup_memory_noswap)
7491 WARN_ON(cgroup_add_dfl_cftypes(&memory_cgrp_subsys, swap_files));
7492 WARN_ON(cgroup_add_legacy_cftypes(&memory_cgrp_subsys, memsw_files));
7496 core_initcall(mem_cgroup_swap_init);
7498 #endif /* CONFIG_MEMCG_SWAP */