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
24 * Per memcg lru locking
25 * Copyright (C) 2020 Alibaba, Inc, Alex Shi
28 #include <linux/page_counter.h>
29 #include <linux/memcontrol.h>
30 #include <linux/cgroup.h>
31 #include <linux/pagewalk.h>
32 #include <linux/sched/mm.h>
33 #include <linux/shmem_fs.h>
34 #include <linux/hugetlb.h>
35 #include <linux/pagemap.h>
36 #include <linux/vm_event_item.h>
37 #include <linux/smp.h>
38 #include <linux/page-flags.h>
39 #include <linux/backing-dev.h>
40 #include <linux/bit_spinlock.h>
41 #include <linux/rcupdate.h>
42 #include <linux/limits.h>
43 #include <linux/export.h>
44 #include <linux/mutex.h>
45 #include <linux/rbtree.h>
46 #include <linux/slab.h>
47 #include <linux/swap.h>
48 #include <linux/swapops.h>
49 #include <linux/spinlock.h>
50 #include <linux/eventfd.h>
51 #include <linux/poll.h>
52 #include <linux/sort.h>
54 #include <linux/seq_file.h>
55 #include <linux/vmpressure.h>
56 #include <linux/mm_inline.h>
57 #include <linux/swap_cgroup.h>
58 #include <linux/cpu.h>
59 #include <linux/oom.h>
60 #include <linux/lockdep.h>
61 #include <linux/file.h>
62 #include <linux/tracehook.h>
63 #include <linux/psi.h>
64 #include <linux/seq_buf.h>
70 #include <linux/uaccess.h>
72 #include <trace/events/vmscan.h>
74 struct cgroup_subsys memory_cgrp_subsys __read_mostly;
75 EXPORT_SYMBOL(memory_cgrp_subsys);
77 struct mem_cgroup *root_mem_cgroup __read_mostly;
79 /* Active memory cgroup to use from an interrupt context */
80 DEFINE_PER_CPU(struct mem_cgroup *, int_active_memcg);
81 EXPORT_PER_CPU_SYMBOL_GPL(int_active_memcg);
83 /* Socket memory accounting disabled? */
84 static bool cgroup_memory_nosocket __ro_after_init;
86 /* Kernel memory accounting disabled? */
87 bool cgroup_memory_nokmem __ro_after_init;
89 /* Whether the swap controller is active */
90 #ifdef CONFIG_MEMCG_SWAP
91 bool cgroup_memory_noswap __ro_after_init;
93 #define cgroup_memory_noswap 1
96 #ifdef CONFIG_CGROUP_WRITEBACK
97 static DECLARE_WAIT_QUEUE_HEAD(memcg_cgwb_frn_waitq);
100 /* Whether legacy memory+swap accounting is active */
101 static bool do_memsw_account(void)
103 return !cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_noswap;
106 #define THRESHOLDS_EVENTS_TARGET 128
107 #define SOFTLIMIT_EVENTS_TARGET 1024
110 * Cgroups above their limits are maintained in a RB-Tree, independent of
111 * their hierarchy representation
114 struct mem_cgroup_tree_per_node {
115 struct rb_root rb_root;
116 struct rb_node *rb_rightmost;
120 struct mem_cgroup_tree {
121 struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES];
124 static struct mem_cgroup_tree soft_limit_tree __read_mostly;
127 struct mem_cgroup_eventfd_list {
128 struct list_head list;
129 struct eventfd_ctx *eventfd;
133 * cgroup_event represents events which userspace want to receive.
135 struct mem_cgroup_event {
137 * memcg which the event belongs to.
139 struct mem_cgroup *memcg;
141 * eventfd to signal userspace about the event.
143 struct eventfd_ctx *eventfd;
145 * Each of these stored in a list by the cgroup.
147 struct list_head list;
149 * register_event() callback will be used to add new userspace
150 * waiter for changes related to this event. Use eventfd_signal()
151 * on eventfd to send notification to userspace.
153 int (*register_event)(struct mem_cgroup *memcg,
154 struct eventfd_ctx *eventfd, const char *args);
156 * unregister_event() callback will be called when userspace closes
157 * the eventfd or on cgroup removing. This callback must be set,
158 * if you want provide notification functionality.
160 void (*unregister_event)(struct mem_cgroup *memcg,
161 struct eventfd_ctx *eventfd);
163 * All fields below needed to unregister event when
164 * userspace closes eventfd.
167 wait_queue_head_t *wqh;
168 wait_queue_entry_t wait;
169 struct work_struct remove;
172 static void mem_cgroup_threshold(struct mem_cgroup *memcg);
173 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg);
175 /* Stuffs for move charges at task migration. */
177 * Types of charges to be moved.
179 #define MOVE_ANON 0x1U
180 #define MOVE_FILE 0x2U
181 #define MOVE_MASK (MOVE_ANON | MOVE_FILE)
183 /* "mc" and its members are protected by cgroup_mutex */
184 static struct move_charge_struct {
185 spinlock_t lock; /* for from, to */
186 struct mm_struct *mm;
187 struct mem_cgroup *from;
188 struct mem_cgroup *to;
190 unsigned long precharge;
191 unsigned long moved_charge;
192 unsigned long moved_swap;
193 struct task_struct *moving_task; /* a task moving charges */
194 wait_queue_head_t waitq; /* a waitq for other context */
196 .lock = __SPIN_LOCK_UNLOCKED(mc.lock),
197 .waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq),
201 * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft
202 * limit reclaim to prevent infinite loops, if they ever occur.
204 #define MEM_CGROUP_MAX_RECLAIM_LOOPS 100
205 #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS 2
207 /* for encoding cft->private value on file */
216 #define MEMFILE_PRIVATE(x, val) ((x) << 16 | (val))
217 #define MEMFILE_TYPE(val) ((val) >> 16 & 0xffff)
218 #define MEMFILE_ATTR(val) ((val) & 0xffff)
219 /* Used for OOM notifier */
220 #define OOM_CONTROL (0)
223 * Iteration constructs for visiting all cgroups (under a tree). If
224 * loops are exited prematurely (break), mem_cgroup_iter_break() must
225 * be used for reference counting.
227 #define for_each_mem_cgroup_tree(iter, root) \
228 for (iter = mem_cgroup_iter(root, NULL, NULL); \
230 iter = mem_cgroup_iter(root, iter, NULL))
232 #define for_each_mem_cgroup(iter) \
233 for (iter = mem_cgroup_iter(NULL, NULL, NULL); \
235 iter = mem_cgroup_iter(NULL, iter, NULL))
237 static inline bool task_is_dying(void)
239 return tsk_is_oom_victim(current) || fatal_signal_pending(current) ||
240 (current->flags & PF_EXITING);
243 /* Some nice accessors for the vmpressure. */
244 struct vmpressure *memcg_to_vmpressure(struct mem_cgroup *memcg)
247 memcg = root_mem_cgroup;
248 return &memcg->vmpressure;
251 struct mem_cgroup *vmpressure_to_memcg(struct vmpressure *vmpr)
253 return container_of(vmpr, struct mem_cgroup, vmpressure);
256 #ifdef CONFIG_MEMCG_KMEM
257 static DEFINE_SPINLOCK(objcg_lock);
259 bool mem_cgroup_kmem_disabled(void)
261 return cgroup_memory_nokmem;
264 static void obj_cgroup_uncharge_pages(struct obj_cgroup *objcg,
265 unsigned int nr_pages);
267 static void obj_cgroup_release(struct percpu_ref *ref)
269 struct obj_cgroup *objcg = container_of(ref, struct obj_cgroup, refcnt);
270 unsigned int nr_bytes;
271 unsigned int nr_pages;
275 * At this point all allocated objects are freed, and
276 * objcg->nr_charged_bytes can't have an arbitrary byte value.
277 * However, it can be PAGE_SIZE or (x * PAGE_SIZE).
279 * The following sequence can lead to it:
280 * 1) CPU0: objcg == stock->cached_objcg
281 * 2) CPU1: we do a small allocation (e.g. 92 bytes),
282 * PAGE_SIZE bytes are charged
283 * 3) CPU1: a process from another memcg is allocating something,
284 * the stock if flushed,
285 * objcg->nr_charged_bytes = PAGE_SIZE - 92
286 * 5) CPU0: we do release this object,
287 * 92 bytes are added to stock->nr_bytes
288 * 6) CPU0: stock is flushed,
289 * 92 bytes are added to objcg->nr_charged_bytes
291 * In the result, nr_charged_bytes == PAGE_SIZE.
292 * This page will be uncharged in obj_cgroup_release().
294 nr_bytes = atomic_read(&objcg->nr_charged_bytes);
295 WARN_ON_ONCE(nr_bytes & (PAGE_SIZE - 1));
296 nr_pages = nr_bytes >> PAGE_SHIFT;
299 obj_cgroup_uncharge_pages(objcg, nr_pages);
301 spin_lock_irqsave(&objcg_lock, flags);
302 list_del(&objcg->list);
303 spin_unlock_irqrestore(&objcg_lock, flags);
305 percpu_ref_exit(ref);
306 kfree_rcu(objcg, rcu);
309 static struct obj_cgroup *obj_cgroup_alloc(void)
311 struct obj_cgroup *objcg;
314 objcg = kzalloc(sizeof(struct obj_cgroup), GFP_KERNEL);
318 ret = percpu_ref_init(&objcg->refcnt, obj_cgroup_release, 0,
324 INIT_LIST_HEAD(&objcg->list);
328 static void memcg_reparent_objcgs(struct mem_cgroup *memcg,
329 struct mem_cgroup *parent)
331 struct obj_cgroup *objcg, *iter;
333 objcg = rcu_replace_pointer(memcg->objcg, NULL, true);
335 spin_lock_irq(&objcg_lock);
337 /* 1) Ready to reparent active objcg. */
338 list_add(&objcg->list, &memcg->objcg_list);
339 /* 2) Reparent active objcg and already reparented objcgs to parent. */
340 list_for_each_entry(iter, &memcg->objcg_list, list)
341 WRITE_ONCE(iter->memcg, parent);
342 /* 3) Move already reparented objcgs to the parent's list */
343 list_splice(&memcg->objcg_list, &parent->objcg_list);
345 spin_unlock_irq(&objcg_lock);
347 percpu_ref_kill(&objcg->refcnt);
351 * This will be used as a shrinker list's index.
352 * The main reason for not using cgroup id for this:
353 * this works better in sparse environments, where we have a lot of memcgs,
354 * but only a few kmem-limited. Or also, if we have, for instance, 200
355 * memcgs, and none but the 200th is kmem-limited, we'd have to have a
356 * 200 entry array for that.
358 * The current size of the caches array is stored in memcg_nr_cache_ids. It
359 * will double each time we have to increase it.
361 static DEFINE_IDA(memcg_cache_ida);
362 int memcg_nr_cache_ids;
364 /* Protects memcg_nr_cache_ids */
365 static DECLARE_RWSEM(memcg_cache_ids_sem);
367 void memcg_get_cache_ids(void)
369 down_read(&memcg_cache_ids_sem);
372 void memcg_put_cache_ids(void)
374 up_read(&memcg_cache_ids_sem);
378 * MIN_SIZE is different than 1, because we would like to avoid going through
379 * the alloc/free process all the time. In a small machine, 4 kmem-limited
380 * cgroups is a reasonable guess. In the future, it could be a parameter or
381 * tunable, but that is strictly not necessary.
383 * MAX_SIZE should be as large as the number of cgrp_ids. Ideally, we could get
384 * this constant directly from cgroup, but it is understandable that this is
385 * better kept as an internal representation in cgroup.c. In any case, the
386 * cgrp_id space is not getting any smaller, and we don't have to necessarily
387 * increase ours as well if it increases.
389 #define MEMCG_CACHES_MIN_SIZE 4
390 #define MEMCG_CACHES_MAX_SIZE MEM_CGROUP_ID_MAX
393 * A lot of the calls to the cache allocation functions are expected to be
394 * inlined by the compiler. Since the calls to memcg_slab_pre_alloc_hook() are
395 * conditional to this static branch, we'll have to allow modules that does
396 * kmem_cache_alloc and the such to see this symbol as well
398 DEFINE_STATIC_KEY_FALSE(memcg_kmem_enabled_key);
399 EXPORT_SYMBOL(memcg_kmem_enabled_key);
403 * mem_cgroup_css_from_page - css of the memcg associated with a page
404 * @page: page of interest
406 * If memcg is bound to the default hierarchy, css of the memcg associated
407 * with @page is returned. The returned css remains associated with @page
408 * until it is released.
410 * If memcg is bound to a traditional hierarchy, the css of root_mem_cgroup
413 struct cgroup_subsys_state *mem_cgroup_css_from_page(struct page *page)
415 struct mem_cgroup *memcg;
417 memcg = page_memcg(page);
419 if (!memcg || !cgroup_subsys_on_dfl(memory_cgrp_subsys))
420 memcg = root_mem_cgroup;
426 * page_cgroup_ino - return inode number of the memcg a page is charged to
429 * Look up the closest online ancestor of the memory cgroup @page is charged to
430 * and return its inode number or 0 if @page is not charged to any cgroup. It
431 * is safe to call this function without holding a reference to @page.
433 * Note, this function is inherently racy, because there is nothing to prevent
434 * the cgroup inode from getting torn down and potentially reallocated a moment
435 * after page_cgroup_ino() returns, so it only should be used by callers that
436 * do not care (such as procfs interfaces).
438 ino_t page_cgroup_ino(struct page *page)
440 struct mem_cgroup *memcg;
441 unsigned long ino = 0;
444 memcg = page_memcg_check(page);
446 while (memcg && !(memcg->css.flags & CSS_ONLINE))
447 memcg = parent_mem_cgroup(memcg);
449 ino = cgroup_ino(memcg->css.cgroup);
454 static struct mem_cgroup_per_node *
455 mem_cgroup_page_nodeinfo(struct mem_cgroup *memcg, struct page *page)
457 int nid = page_to_nid(page);
459 return memcg->nodeinfo[nid];
462 static struct mem_cgroup_tree_per_node *
463 soft_limit_tree_node(int nid)
465 return soft_limit_tree.rb_tree_per_node[nid];
468 static struct mem_cgroup_tree_per_node *
469 soft_limit_tree_from_page(struct page *page)
471 int nid = page_to_nid(page);
473 return soft_limit_tree.rb_tree_per_node[nid];
476 static void __mem_cgroup_insert_exceeded(struct mem_cgroup_per_node *mz,
477 struct mem_cgroup_tree_per_node *mctz,
478 unsigned long new_usage_in_excess)
480 struct rb_node **p = &mctz->rb_root.rb_node;
481 struct rb_node *parent = NULL;
482 struct mem_cgroup_per_node *mz_node;
483 bool rightmost = true;
488 mz->usage_in_excess = new_usage_in_excess;
489 if (!mz->usage_in_excess)
493 mz_node = rb_entry(parent, struct mem_cgroup_per_node,
495 if (mz->usage_in_excess < mz_node->usage_in_excess) {
504 mctz->rb_rightmost = &mz->tree_node;
506 rb_link_node(&mz->tree_node, parent, p);
507 rb_insert_color(&mz->tree_node, &mctz->rb_root);
511 static void __mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
512 struct mem_cgroup_tree_per_node *mctz)
517 if (&mz->tree_node == mctz->rb_rightmost)
518 mctz->rb_rightmost = rb_prev(&mz->tree_node);
520 rb_erase(&mz->tree_node, &mctz->rb_root);
524 static void mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
525 struct mem_cgroup_tree_per_node *mctz)
529 spin_lock_irqsave(&mctz->lock, flags);
530 __mem_cgroup_remove_exceeded(mz, mctz);
531 spin_unlock_irqrestore(&mctz->lock, flags);
534 static unsigned long soft_limit_excess(struct mem_cgroup *memcg)
536 unsigned long nr_pages = page_counter_read(&memcg->memory);
537 unsigned long soft_limit = READ_ONCE(memcg->soft_limit);
538 unsigned long excess = 0;
540 if (nr_pages > soft_limit)
541 excess = nr_pages - soft_limit;
546 static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page)
548 unsigned long excess;
549 struct mem_cgroup_per_node *mz;
550 struct mem_cgroup_tree_per_node *mctz;
552 mctz = soft_limit_tree_from_page(page);
556 * Necessary to update all ancestors when hierarchy is used.
557 * because their event counter is not touched.
559 for (; memcg; memcg = parent_mem_cgroup(memcg)) {
560 mz = mem_cgroup_page_nodeinfo(memcg, page);
561 excess = soft_limit_excess(memcg);
563 * We have to update the tree if mz is on RB-tree or
564 * mem is over its softlimit.
566 if (excess || mz->on_tree) {
569 spin_lock_irqsave(&mctz->lock, flags);
570 /* if on-tree, remove it */
572 __mem_cgroup_remove_exceeded(mz, mctz);
574 * Insert again. mz->usage_in_excess will be updated.
575 * If excess is 0, no tree ops.
577 __mem_cgroup_insert_exceeded(mz, mctz, excess);
578 spin_unlock_irqrestore(&mctz->lock, flags);
583 static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg)
585 struct mem_cgroup_tree_per_node *mctz;
586 struct mem_cgroup_per_node *mz;
590 mz = memcg->nodeinfo[nid];
591 mctz = soft_limit_tree_node(nid);
593 mem_cgroup_remove_exceeded(mz, mctz);
597 static struct mem_cgroup_per_node *
598 __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node *mctz)
600 struct mem_cgroup_per_node *mz;
604 if (!mctz->rb_rightmost)
605 goto done; /* Nothing to reclaim from */
607 mz = rb_entry(mctz->rb_rightmost,
608 struct mem_cgroup_per_node, tree_node);
610 * Remove the node now but someone else can add it back,
611 * we will to add it back at the end of reclaim to its correct
612 * position in the tree.
614 __mem_cgroup_remove_exceeded(mz, mctz);
615 if (!soft_limit_excess(mz->memcg) ||
616 !css_tryget(&mz->memcg->css))
622 static struct mem_cgroup_per_node *
623 mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node *mctz)
625 struct mem_cgroup_per_node *mz;
627 spin_lock_irq(&mctz->lock);
628 mz = __mem_cgroup_largest_soft_limit_node(mctz);
629 spin_unlock_irq(&mctz->lock);
634 * memcg and lruvec stats flushing
636 * Many codepaths leading to stats update or read are performance sensitive and
637 * adding stats flushing in such codepaths is not desirable. So, to optimize the
638 * flushing the kernel does:
640 * 1) Periodically and asynchronously flush the stats every 2 seconds to not let
641 * rstat update tree grow unbounded.
643 * 2) Flush the stats synchronously on reader side only when there are more than
644 * (MEMCG_CHARGE_BATCH * nr_cpus) update events. Though this optimization
645 * will let stats be out of sync by atmost (MEMCG_CHARGE_BATCH * nr_cpus) but
646 * only for 2 seconds due to (1).
648 static void flush_memcg_stats_dwork(struct work_struct *w);
649 static DECLARE_DEFERRABLE_WORK(stats_flush_dwork, flush_memcg_stats_dwork);
650 static DEFINE_SPINLOCK(stats_flush_lock);
651 static DEFINE_PER_CPU(unsigned int, stats_updates);
652 static atomic_t stats_flush_threshold = ATOMIC_INIT(0);
653 static u64 flush_next_time;
655 #define FLUSH_TIME (2UL*HZ)
657 static inline void memcg_rstat_updated(struct mem_cgroup *memcg, int val)
661 cgroup_rstat_updated(memcg->css.cgroup, smp_processor_id());
663 x = __this_cpu_add_return(stats_updates, abs(val));
664 if (x > MEMCG_CHARGE_BATCH) {
665 atomic_add(x / MEMCG_CHARGE_BATCH, &stats_flush_threshold);
666 __this_cpu_write(stats_updates, 0);
670 static void __mem_cgroup_flush_stats(void)
674 if (!spin_trylock_irqsave(&stats_flush_lock, flag))
677 flush_next_time = jiffies_64 + 2*FLUSH_TIME;
678 cgroup_rstat_flush_irqsafe(root_mem_cgroup->css.cgroup);
679 atomic_set(&stats_flush_threshold, 0);
680 spin_unlock_irqrestore(&stats_flush_lock, flag);
683 void mem_cgroup_flush_stats(void)
685 if (atomic_read(&stats_flush_threshold) > num_online_cpus())
686 __mem_cgroup_flush_stats();
689 void mem_cgroup_flush_stats_delayed(void)
691 if (time_after64(jiffies_64, flush_next_time))
692 mem_cgroup_flush_stats();
695 static void flush_memcg_stats_dwork(struct work_struct *w)
697 __mem_cgroup_flush_stats();
698 queue_delayed_work(system_unbound_wq, &stats_flush_dwork, FLUSH_TIME);
702 * __mod_memcg_state - update cgroup memory statistics
703 * @memcg: the memory cgroup
704 * @idx: the stat item - can be enum memcg_stat_item or enum node_stat_item
705 * @val: delta to add to the counter, can be negative
707 void __mod_memcg_state(struct mem_cgroup *memcg, int idx, int val)
709 if (mem_cgroup_disabled())
712 __this_cpu_add(memcg->vmstats_percpu->state[idx], val);
713 memcg_rstat_updated(memcg, val);
716 /* idx can be of type enum memcg_stat_item or node_stat_item. */
717 static unsigned long memcg_page_state_local(struct mem_cgroup *memcg, int idx)
722 for_each_possible_cpu(cpu)
723 x += per_cpu(memcg->vmstats_percpu->state[idx], cpu);
731 void __mod_memcg_lruvec_state(struct lruvec *lruvec, enum node_stat_item idx,
734 struct mem_cgroup_per_node *pn;
735 struct mem_cgroup *memcg;
737 pn = container_of(lruvec, struct mem_cgroup_per_node, lruvec);
741 __this_cpu_add(memcg->vmstats_percpu->state[idx], val);
744 __this_cpu_add(pn->lruvec_stats_percpu->state[idx], val);
746 memcg_rstat_updated(memcg, val);
750 * __mod_lruvec_state - update lruvec memory statistics
751 * @lruvec: the lruvec
752 * @idx: the stat item
753 * @val: delta to add to the counter, can be negative
755 * The lruvec is the intersection of the NUMA node and a cgroup. This
756 * function updates the all three counters that are affected by a
757 * change of state at this level: per-node, per-cgroup, per-lruvec.
759 void __mod_lruvec_state(struct lruvec *lruvec, enum node_stat_item idx,
763 __mod_node_page_state(lruvec_pgdat(lruvec), idx, val);
765 /* Update memcg and lruvec */
766 if (!mem_cgroup_disabled())
767 __mod_memcg_lruvec_state(lruvec, idx, val);
770 void __mod_lruvec_page_state(struct page *page, enum node_stat_item idx,
773 struct page *head = compound_head(page); /* rmap on tail pages */
774 struct mem_cgroup *memcg;
775 pg_data_t *pgdat = page_pgdat(page);
776 struct lruvec *lruvec;
779 memcg = page_memcg(head);
780 /* Untracked pages have no memcg, no lruvec. Update only the node */
783 __mod_node_page_state(pgdat, idx, val);
787 lruvec = mem_cgroup_lruvec(memcg, pgdat);
788 __mod_lruvec_state(lruvec, idx, val);
791 EXPORT_SYMBOL(__mod_lruvec_page_state);
793 void __mod_lruvec_kmem_state(void *p, enum node_stat_item idx, int val)
795 pg_data_t *pgdat = page_pgdat(virt_to_page(p));
796 struct mem_cgroup *memcg;
797 struct lruvec *lruvec;
800 memcg = mem_cgroup_from_obj(p);
803 * Untracked pages have no memcg, no lruvec. Update only the
804 * node. If we reparent the slab objects to the root memcg,
805 * when we free the slab object, we need to update the per-memcg
806 * vmstats to keep it correct for the root memcg.
809 __mod_node_page_state(pgdat, idx, val);
811 lruvec = mem_cgroup_lruvec(memcg, pgdat);
812 __mod_lruvec_state(lruvec, idx, val);
818 * mod_objcg_mlstate() may be called with irq enabled, so
819 * mod_memcg_lruvec_state() should be used.
821 static inline void mod_objcg_mlstate(struct obj_cgroup *objcg,
822 struct pglist_data *pgdat,
823 enum node_stat_item idx, int nr)
825 struct mem_cgroup *memcg;
826 struct lruvec *lruvec;
829 memcg = obj_cgroup_memcg(objcg);
830 lruvec = mem_cgroup_lruvec(memcg, pgdat);
831 mod_memcg_lruvec_state(lruvec, idx, nr);
836 * __count_memcg_events - account VM events in a cgroup
837 * @memcg: the memory cgroup
838 * @idx: the event item
839 * @count: the number of events that occurred
841 void __count_memcg_events(struct mem_cgroup *memcg, enum vm_event_item idx,
844 if (mem_cgroup_disabled())
847 __this_cpu_add(memcg->vmstats_percpu->events[idx], count);
848 memcg_rstat_updated(memcg, count);
851 static unsigned long memcg_events(struct mem_cgroup *memcg, int event)
853 return READ_ONCE(memcg->vmstats.events[event]);
856 static unsigned long memcg_events_local(struct mem_cgroup *memcg, int event)
861 for_each_possible_cpu(cpu)
862 x += per_cpu(memcg->vmstats_percpu->events[event], cpu);
866 static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg,
870 /* pagein of a big page is an event. So, ignore page size */
872 __count_memcg_events(memcg, PGPGIN, 1);
874 __count_memcg_events(memcg, PGPGOUT, 1);
875 nr_pages = -nr_pages; /* for event */
878 __this_cpu_add(memcg->vmstats_percpu->nr_page_events, nr_pages);
881 static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg,
882 enum mem_cgroup_events_target target)
884 unsigned long val, next;
886 val = __this_cpu_read(memcg->vmstats_percpu->nr_page_events);
887 next = __this_cpu_read(memcg->vmstats_percpu->targets[target]);
888 /* from time_after() in jiffies.h */
889 if ((long)(next - val) < 0) {
891 case MEM_CGROUP_TARGET_THRESH:
892 next = val + THRESHOLDS_EVENTS_TARGET;
894 case MEM_CGROUP_TARGET_SOFTLIMIT:
895 next = val + SOFTLIMIT_EVENTS_TARGET;
900 __this_cpu_write(memcg->vmstats_percpu->targets[target], next);
907 * Check events in order.
910 static void memcg_check_events(struct mem_cgroup *memcg, struct page *page)
912 /* threshold event is triggered in finer grain than soft limit */
913 if (unlikely(mem_cgroup_event_ratelimit(memcg,
914 MEM_CGROUP_TARGET_THRESH))) {
917 do_softlimit = mem_cgroup_event_ratelimit(memcg,
918 MEM_CGROUP_TARGET_SOFTLIMIT);
919 mem_cgroup_threshold(memcg);
920 if (unlikely(do_softlimit))
921 mem_cgroup_update_tree(memcg, page);
925 struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p)
928 * mm_update_next_owner() may clear mm->owner to NULL
929 * if it races with swapoff, page migration, etc.
930 * So this can be called with p == NULL.
935 return mem_cgroup_from_css(task_css(p, memory_cgrp_id));
937 EXPORT_SYMBOL(mem_cgroup_from_task);
939 static __always_inline struct mem_cgroup *active_memcg(void)
942 return this_cpu_read(int_active_memcg);
944 return current->active_memcg;
948 * get_mem_cgroup_from_mm: Obtain a reference on given mm_struct's memcg.
949 * @mm: mm from which memcg should be extracted. It can be NULL.
951 * Obtain a reference on mm->memcg and returns it if successful. If mm
952 * is NULL, then the memcg is chosen as follows:
953 * 1) The active memcg, if set.
954 * 2) current->mm->memcg, if available
956 * If mem_cgroup is disabled, NULL is returned.
958 struct mem_cgroup *get_mem_cgroup_from_mm(struct mm_struct *mm)
960 struct mem_cgroup *memcg;
962 if (mem_cgroup_disabled())
966 * Page cache insertions can happen without an
967 * actual mm context, e.g. during disk probing
968 * on boot, loopback IO, acct() writes etc.
970 * No need to css_get on root memcg as the reference
971 * counting is disabled on the root level in the
972 * cgroup core. See CSS_NO_REF.
975 memcg = active_memcg();
976 if (unlikely(memcg)) {
977 /* remote memcg must hold a ref */
978 css_get(&memcg->css);
983 return root_mem_cgroup;
988 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
989 if (unlikely(!memcg))
990 memcg = root_mem_cgroup;
991 } while (!css_tryget(&memcg->css));
995 EXPORT_SYMBOL(get_mem_cgroup_from_mm);
997 static __always_inline bool memcg_kmem_bypass(void)
999 /* Allow remote memcg charging from any context. */
1000 if (unlikely(active_memcg()))
1003 /* Memcg to charge can't be determined. */
1004 if (!in_task() || !current->mm || (current->flags & PF_KTHREAD))
1011 * mem_cgroup_iter - iterate over memory cgroup hierarchy
1012 * @root: hierarchy root
1013 * @prev: previously returned memcg, NULL on first invocation
1014 * @reclaim: cookie for shared reclaim walks, NULL for full walks
1016 * Returns references to children of the hierarchy below @root, or
1017 * @root itself, or %NULL after a full round-trip.
1019 * Caller must pass the return value in @prev on subsequent
1020 * invocations for reference counting, or use mem_cgroup_iter_break()
1021 * to cancel a hierarchy walk before the round-trip is complete.
1023 * Reclaimers can specify a node in @reclaim to divide up the memcgs
1024 * in the hierarchy among all concurrent reclaimers operating on the
1027 struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root,
1028 struct mem_cgroup *prev,
1029 struct mem_cgroup_reclaim_cookie *reclaim)
1031 struct mem_cgroup_reclaim_iter *iter;
1032 struct cgroup_subsys_state *css = NULL;
1033 struct mem_cgroup *memcg = NULL;
1034 struct mem_cgroup *pos = NULL;
1036 if (mem_cgroup_disabled())
1040 root = root_mem_cgroup;
1042 if (prev && !reclaim)
1048 struct mem_cgroup_per_node *mz;
1050 mz = root->nodeinfo[reclaim->pgdat->node_id];
1053 if (prev && reclaim->generation != iter->generation)
1057 pos = READ_ONCE(iter->position);
1058 if (!pos || css_tryget(&pos->css))
1061 * css reference reached zero, so iter->position will
1062 * be cleared by ->css_released. However, we should not
1063 * rely on this happening soon, because ->css_released
1064 * is called from a work queue, and by busy-waiting we
1065 * might block it. So we clear iter->position right
1068 (void)cmpxchg(&iter->position, pos, NULL);
1076 css = css_next_descendant_pre(css, &root->css);
1079 * Reclaimers share the hierarchy walk, and a
1080 * new one might jump in right at the end of
1081 * the hierarchy - make sure they see at least
1082 * one group and restart from the beginning.
1090 * Verify the css and acquire a reference. The root
1091 * is provided by the caller, so we know it's alive
1092 * and kicking, and don't take an extra reference.
1094 memcg = mem_cgroup_from_css(css);
1096 if (css == &root->css)
1099 if (css_tryget(css))
1107 * The position could have already been updated by a competing
1108 * thread, so check that the value hasn't changed since we read
1109 * it to avoid reclaiming from the same cgroup twice.
1111 (void)cmpxchg(&iter->position, pos, memcg);
1119 reclaim->generation = iter->generation;
1124 if (prev && prev != root)
1125 css_put(&prev->css);
1131 * mem_cgroup_iter_break - abort a hierarchy walk prematurely
1132 * @root: hierarchy root
1133 * @prev: last visited hierarchy member as returned by mem_cgroup_iter()
1135 void mem_cgroup_iter_break(struct mem_cgroup *root,
1136 struct mem_cgroup *prev)
1139 root = root_mem_cgroup;
1140 if (prev && prev != root)
1141 css_put(&prev->css);
1144 static void __invalidate_reclaim_iterators(struct mem_cgroup *from,
1145 struct mem_cgroup *dead_memcg)
1147 struct mem_cgroup_reclaim_iter *iter;
1148 struct mem_cgroup_per_node *mz;
1151 for_each_node(nid) {
1152 mz = from->nodeinfo[nid];
1154 cmpxchg(&iter->position, dead_memcg, NULL);
1158 static void invalidate_reclaim_iterators(struct mem_cgroup *dead_memcg)
1160 struct mem_cgroup *memcg = dead_memcg;
1161 struct mem_cgroup *last;
1164 __invalidate_reclaim_iterators(memcg, dead_memcg);
1166 } while ((memcg = parent_mem_cgroup(memcg)));
1169 * When cgruop1 non-hierarchy mode is used,
1170 * parent_mem_cgroup() does not walk all the way up to the
1171 * cgroup root (root_mem_cgroup). So we have to handle
1172 * dead_memcg from cgroup root separately.
1174 if (last != root_mem_cgroup)
1175 __invalidate_reclaim_iterators(root_mem_cgroup,
1180 * mem_cgroup_scan_tasks - iterate over tasks of a memory cgroup hierarchy
1181 * @memcg: hierarchy root
1182 * @fn: function to call for each task
1183 * @arg: argument passed to @fn
1185 * This function iterates over tasks attached to @memcg or to any of its
1186 * descendants and calls @fn for each task. If @fn returns a non-zero
1187 * value, the function breaks the iteration loop and returns the value.
1188 * Otherwise, it will iterate over all tasks and return 0.
1190 * This function must not be called for the root memory cgroup.
1192 int mem_cgroup_scan_tasks(struct mem_cgroup *memcg,
1193 int (*fn)(struct task_struct *, void *), void *arg)
1195 struct mem_cgroup *iter;
1198 BUG_ON(memcg == root_mem_cgroup);
1200 for_each_mem_cgroup_tree(iter, memcg) {
1201 struct css_task_iter it;
1202 struct task_struct *task;
1204 css_task_iter_start(&iter->css, CSS_TASK_ITER_PROCS, &it);
1205 while (!ret && (task = css_task_iter_next(&it)))
1206 ret = fn(task, arg);
1207 css_task_iter_end(&it);
1209 mem_cgroup_iter_break(memcg, iter);
1216 #ifdef CONFIG_DEBUG_VM
1217 void lruvec_memcg_debug(struct lruvec *lruvec, struct page *page)
1219 struct mem_cgroup *memcg;
1221 if (mem_cgroup_disabled())
1224 memcg = page_memcg(page);
1227 VM_BUG_ON_PAGE(lruvec_memcg(lruvec) != root_mem_cgroup, page);
1229 VM_BUG_ON_PAGE(lruvec_memcg(lruvec) != memcg, page);
1234 * lock_page_lruvec - lock and return lruvec for a given page.
1237 * These functions are safe to use under any of the following conditions:
1240 * - lock_page_memcg()
1241 * - page->_refcount is zero
1243 struct lruvec *lock_page_lruvec(struct page *page)
1245 struct lruvec *lruvec;
1247 lruvec = mem_cgroup_page_lruvec(page);
1248 spin_lock(&lruvec->lru_lock);
1250 lruvec_memcg_debug(lruvec, page);
1255 struct lruvec *lock_page_lruvec_irq(struct page *page)
1257 struct lruvec *lruvec;
1259 lruvec = mem_cgroup_page_lruvec(page);
1260 spin_lock_irq(&lruvec->lru_lock);
1262 lruvec_memcg_debug(lruvec, page);
1267 struct lruvec *lock_page_lruvec_irqsave(struct page *page, unsigned long *flags)
1269 struct lruvec *lruvec;
1271 lruvec = mem_cgroup_page_lruvec(page);
1272 spin_lock_irqsave(&lruvec->lru_lock, *flags);
1274 lruvec_memcg_debug(lruvec, page);
1280 * mem_cgroup_update_lru_size - account for adding or removing an lru page
1281 * @lruvec: mem_cgroup per zone lru vector
1282 * @lru: index of lru list the page is sitting on
1283 * @zid: zone id of the accounted pages
1284 * @nr_pages: positive when adding or negative when removing
1286 * This function must be called under lru_lock, just before a page is added
1287 * to or just after a page is removed from an lru list (that ordering being
1288 * so as to allow it to check that lru_size 0 is consistent with list_empty).
1290 void mem_cgroup_update_lru_size(struct lruvec *lruvec, enum lru_list lru,
1291 int zid, int nr_pages)
1293 struct mem_cgroup_per_node *mz;
1294 unsigned long *lru_size;
1297 if (mem_cgroup_disabled())
1300 mz = container_of(lruvec, struct mem_cgroup_per_node, lruvec);
1301 lru_size = &mz->lru_zone_size[zid][lru];
1304 *lru_size += nr_pages;
1307 if (WARN_ONCE(size < 0,
1308 "%s(%p, %d, %d): lru_size %ld\n",
1309 __func__, lruvec, lru, nr_pages, size)) {
1315 *lru_size += nr_pages;
1319 * mem_cgroup_margin - calculate chargeable space of a memory cgroup
1320 * @memcg: the memory cgroup
1322 * Returns the maximum amount of memory @mem can be charged with, in
1325 static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg)
1327 unsigned long margin = 0;
1328 unsigned long count;
1329 unsigned long limit;
1331 count = page_counter_read(&memcg->memory);
1332 limit = READ_ONCE(memcg->memory.max);
1334 margin = limit - count;
1336 if (do_memsw_account()) {
1337 count = page_counter_read(&memcg->memsw);
1338 limit = READ_ONCE(memcg->memsw.max);
1340 margin = min(margin, limit - count);
1349 * A routine for checking "mem" is under move_account() or not.
1351 * Checking a cgroup is mc.from or mc.to or under hierarchy of
1352 * moving cgroups. This is for waiting at high-memory pressure
1355 static bool mem_cgroup_under_move(struct mem_cgroup *memcg)
1357 struct mem_cgroup *from;
1358 struct mem_cgroup *to;
1361 * Unlike task_move routines, we access mc.to, mc.from not under
1362 * mutual exclusion by cgroup_mutex. Here, we take spinlock instead.
1364 spin_lock(&mc.lock);
1370 ret = mem_cgroup_is_descendant(from, memcg) ||
1371 mem_cgroup_is_descendant(to, memcg);
1373 spin_unlock(&mc.lock);
1377 static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg)
1379 if (mc.moving_task && current != mc.moving_task) {
1380 if (mem_cgroup_under_move(memcg)) {
1382 prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE);
1383 /* moving charge context might have finished. */
1386 finish_wait(&mc.waitq, &wait);
1393 struct memory_stat {
1398 static const struct memory_stat memory_stats[] = {
1399 { "anon", NR_ANON_MAPPED },
1400 { "file", NR_FILE_PAGES },
1401 { "kernel_stack", NR_KERNEL_STACK_KB },
1402 { "pagetables", NR_PAGETABLE },
1403 { "percpu", MEMCG_PERCPU_B },
1404 { "sock", MEMCG_SOCK },
1405 { "shmem", NR_SHMEM },
1406 { "file_mapped", NR_FILE_MAPPED },
1407 { "file_dirty", NR_FILE_DIRTY },
1408 { "file_writeback", NR_WRITEBACK },
1410 { "swapcached", NR_SWAPCACHE },
1412 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
1413 { "anon_thp", NR_ANON_THPS },
1414 { "file_thp", NR_FILE_THPS },
1415 { "shmem_thp", NR_SHMEM_THPS },
1417 { "inactive_anon", NR_INACTIVE_ANON },
1418 { "active_anon", NR_ACTIVE_ANON },
1419 { "inactive_file", NR_INACTIVE_FILE },
1420 { "active_file", NR_ACTIVE_FILE },
1421 { "unevictable", NR_UNEVICTABLE },
1422 { "slab_reclaimable", NR_SLAB_RECLAIMABLE_B },
1423 { "slab_unreclaimable", NR_SLAB_UNRECLAIMABLE_B },
1425 /* The memory events */
1426 { "workingset_refault_anon", WORKINGSET_REFAULT_ANON },
1427 { "workingset_refault_file", WORKINGSET_REFAULT_FILE },
1428 { "workingset_activate_anon", WORKINGSET_ACTIVATE_ANON },
1429 { "workingset_activate_file", WORKINGSET_ACTIVATE_FILE },
1430 { "workingset_restore_anon", WORKINGSET_RESTORE_ANON },
1431 { "workingset_restore_file", WORKINGSET_RESTORE_FILE },
1432 { "workingset_nodereclaim", WORKINGSET_NODERECLAIM },
1435 /* Translate stat items to the correct unit for memory.stat output */
1436 static int memcg_page_state_unit(int item)
1439 case MEMCG_PERCPU_B:
1440 case NR_SLAB_RECLAIMABLE_B:
1441 case NR_SLAB_UNRECLAIMABLE_B:
1442 case WORKINGSET_REFAULT_ANON:
1443 case WORKINGSET_REFAULT_FILE:
1444 case WORKINGSET_ACTIVATE_ANON:
1445 case WORKINGSET_ACTIVATE_FILE:
1446 case WORKINGSET_RESTORE_ANON:
1447 case WORKINGSET_RESTORE_FILE:
1448 case WORKINGSET_NODERECLAIM:
1450 case NR_KERNEL_STACK_KB:
1457 static inline unsigned long memcg_page_state_output(struct mem_cgroup *memcg,
1460 return memcg_page_state(memcg, item) * memcg_page_state_unit(item);
1463 static char *memory_stat_format(struct mem_cgroup *memcg)
1468 seq_buf_init(&s, kmalloc(PAGE_SIZE, GFP_KERNEL), PAGE_SIZE);
1473 * Provide statistics on the state of the memory subsystem as
1474 * well as cumulative event counters that show past behavior.
1476 * This list is ordered following a combination of these gradients:
1477 * 1) generic big picture -> specifics and details
1478 * 2) reflecting userspace activity -> reflecting kernel heuristics
1480 * Current memory state:
1482 mem_cgroup_flush_stats();
1484 for (i = 0; i < ARRAY_SIZE(memory_stats); i++) {
1487 size = memcg_page_state_output(memcg, memory_stats[i].idx);
1488 seq_buf_printf(&s, "%s %llu\n", memory_stats[i].name, size);
1490 if (unlikely(memory_stats[i].idx == NR_SLAB_UNRECLAIMABLE_B)) {
1491 size += memcg_page_state_output(memcg,
1492 NR_SLAB_RECLAIMABLE_B);
1493 seq_buf_printf(&s, "slab %llu\n", size);
1497 /* Accumulated memory events */
1499 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGFAULT),
1500 memcg_events(memcg, PGFAULT));
1501 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGMAJFAULT),
1502 memcg_events(memcg, PGMAJFAULT));
1503 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGREFILL),
1504 memcg_events(memcg, PGREFILL));
1505 seq_buf_printf(&s, "pgscan %lu\n",
1506 memcg_events(memcg, PGSCAN_KSWAPD) +
1507 memcg_events(memcg, PGSCAN_DIRECT));
1508 seq_buf_printf(&s, "pgsteal %lu\n",
1509 memcg_events(memcg, PGSTEAL_KSWAPD) +
1510 memcg_events(memcg, PGSTEAL_DIRECT));
1511 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGACTIVATE),
1512 memcg_events(memcg, PGACTIVATE));
1513 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGDEACTIVATE),
1514 memcg_events(memcg, PGDEACTIVATE));
1515 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGLAZYFREE),
1516 memcg_events(memcg, PGLAZYFREE));
1517 seq_buf_printf(&s, "%s %lu\n", vm_event_name(PGLAZYFREED),
1518 memcg_events(memcg, PGLAZYFREED));
1520 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
1521 seq_buf_printf(&s, "%s %lu\n", vm_event_name(THP_FAULT_ALLOC),
1522 memcg_events(memcg, THP_FAULT_ALLOC));
1523 seq_buf_printf(&s, "%s %lu\n", vm_event_name(THP_COLLAPSE_ALLOC),
1524 memcg_events(memcg, THP_COLLAPSE_ALLOC));
1525 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
1527 /* The above should easily fit into one page */
1528 WARN_ON_ONCE(seq_buf_has_overflowed(&s));
1533 #define K(x) ((x) << (PAGE_SHIFT-10))
1535 * mem_cgroup_print_oom_context: Print OOM information relevant to
1536 * memory controller.
1537 * @memcg: The memory cgroup that went over limit
1538 * @p: Task that is going to be killed
1540 * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is
1543 void mem_cgroup_print_oom_context(struct mem_cgroup *memcg, struct task_struct *p)
1548 pr_cont(",oom_memcg=");
1549 pr_cont_cgroup_path(memcg->css.cgroup);
1551 pr_cont(",global_oom");
1553 pr_cont(",task_memcg=");
1554 pr_cont_cgroup_path(task_cgroup(p, memory_cgrp_id));
1560 * mem_cgroup_print_oom_meminfo: Print OOM memory information relevant to
1561 * memory controller.
1562 * @memcg: The memory cgroup that went over limit
1564 void mem_cgroup_print_oom_meminfo(struct mem_cgroup *memcg)
1568 pr_info("memory: usage %llukB, limit %llukB, failcnt %lu\n",
1569 K((u64)page_counter_read(&memcg->memory)),
1570 K((u64)READ_ONCE(memcg->memory.max)), memcg->memory.failcnt);
1571 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
1572 pr_info("swap: usage %llukB, limit %llukB, failcnt %lu\n",
1573 K((u64)page_counter_read(&memcg->swap)),
1574 K((u64)READ_ONCE(memcg->swap.max)), memcg->swap.failcnt);
1576 pr_info("memory+swap: usage %llukB, limit %llukB, failcnt %lu\n",
1577 K((u64)page_counter_read(&memcg->memsw)),
1578 K((u64)memcg->memsw.max), memcg->memsw.failcnt);
1579 pr_info("kmem: usage %llukB, limit %llukB, failcnt %lu\n",
1580 K((u64)page_counter_read(&memcg->kmem)),
1581 K((u64)memcg->kmem.max), memcg->kmem.failcnt);
1584 pr_info("Memory cgroup stats for ");
1585 pr_cont_cgroup_path(memcg->css.cgroup);
1587 buf = memory_stat_format(memcg);
1595 * Return the memory (and swap, if configured) limit for a memcg.
1597 unsigned long mem_cgroup_get_max(struct mem_cgroup *memcg)
1599 unsigned long max = READ_ONCE(memcg->memory.max);
1601 if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) {
1602 if (mem_cgroup_swappiness(memcg))
1603 max += min(READ_ONCE(memcg->swap.max),
1604 (unsigned long)total_swap_pages);
1606 if (mem_cgroup_swappiness(memcg)) {
1607 /* Calculate swap excess capacity from memsw limit */
1608 unsigned long swap = READ_ONCE(memcg->memsw.max) - max;
1610 max += min(swap, (unsigned long)total_swap_pages);
1616 unsigned long mem_cgroup_size(struct mem_cgroup *memcg)
1618 return page_counter_read(&memcg->memory);
1621 static bool mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask,
1624 struct oom_control oc = {
1628 .gfp_mask = gfp_mask,
1633 if (mutex_lock_killable(&oom_lock))
1636 if (mem_cgroup_margin(memcg) >= (1 << order))
1640 * A few threads which were not waiting at mutex_lock_killable() can
1641 * fail to bail out. Therefore, check again after holding oom_lock.
1643 ret = task_is_dying() || out_of_memory(&oc);
1646 mutex_unlock(&oom_lock);
1650 static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg,
1653 unsigned long *total_scanned)
1655 struct mem_cgroup *victim = NULL;
1658 unsigned long excess;
1659 unsigned long nr_scanned;
1660 struct mem_cgroup_reclaim_cookie reclaim = {
1664 excess = soft_limit_excess(root_memcg);
1667 victim = mem_cgroup_iter(root_memcg, victim, &reclaim);
1672 * If we have not been able to reclaim
1673 * anything, it might because there are
1674 * no reclaimable pages under this hierarchy
1679 * We want to do more targeted reclaim.
1680 * excess >> 2 is not to excessive so as to
1681 * reclaim too much, nor too less that we keep
1682 * coming back to reclaim from this cgroup
1684 if (total >= (excess >> 2) ||
1685 (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS))
1690 total += mem_cgroup_shrink_node(victim, gfp_mask, false,
1691 pgdat, &nr_scanned);
1692 *total_scanned += nr_scanned;
1693 if (!soft_limit_excess(root_memcg))
1696 mem_cgroup_iter_break(root_memcg, victim);
1700 #ifdef CONFIG_LOCKDEP
1701 static struct lockdep_map memcg_oom_lock_dep_map = {
1702 .name = "memcg_oom_lock",
1706 static DEFINE_SPINLOCK(memcg_oom_lock);
1709 * Check OOM-Killer is already running under our hierarchy.
1710 * If someone is running, return false.
1712 static bool mem_cgroup_oom_trylock(struct mem_cgroup *memcg)
1714 struct mem_cgroup *iter, *failed = NULL;
1716 spin_lock(&memcg_oom_lock);
1718 for_each_mem_cgroup_tree(iter, memcg) {
1719 if (iter->oom_lock) {
1721 * this subtree of our hierarchy is already locked
1722 * so we cannot give a lock.
1725 mem_cgroup_iter_break(memcg, iter);
1728 iter->oom_lock = true;
1733 * OK, we failed to lock the whole subtree so we have
1734 * to clean up what we set up to the failing subtree
1736 for_each_mem_cgroup_tree(iter, memcg) {
1737 if (iter == failed) {
1738 mem_cgroup_iter_break(memcg, iter);
1741 iter->oom_lock = false;
1744 mutex_acquire(&memcg_oom_lock_dep_map, 0, 1, _RET_IP_);
1746 spin_unlock(&memcg_oom_lock);
1751 static void mem_cgroup_oom_unlock(struct mem_cgroup *memcg)
1753 struct mem_cgroup *iter;
1755 spin_lock(&memcg_oom_lock);
1756 mutex_release(&memcg_oom_lock_dep_map, _RET_IP_);
1757 for_each_mem_cgroup_tree(iter, memcg)
1758 iter->oom_lock = false;
1759 spin_unlock(&memcg_oom_lock);
1762 static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg)
1764 struct mem_cgroup *iter;
1766 spin_lock(&memcg_oom_lock);
1767 for_each_mem_cgroup_tree(iter, memcg)
1769 spin_unlock(&memcg_oom_lock);
1772 static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg)
1774 struct mem_cgroup *iter;
1777 * Be careful about under_oom underflows because a child memcg
1778 * could have been added after mem_cgroup_mark_under_oom.
1780 spin_lock(&memcg_oom_lock);
1781 for_each_mem_cgroup_tree(iter, memcg)
1782 if (iter->under_oom > 0)
1784 spin_unlock(&memcg_oom_lock);
1787 static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq);
1789 struct oom_wait_info {
1790 struct mem_cgroup *memcg;
1791 wait_queue_entry_t wait;
1794 static int memcg_oom_wake_function(wait_queue_entry_t *wait,
1795 unsigned mode, int sync, void *arg)
1797 struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg;
1798 struct mem_cgroup *oom_wait_memcg;
1799 struct oom_wait_info *oom_wait_info;
1801 oom_wait_info = container_of(wait, struct oom_wait_info, wait);
1802 oom_wait_memcg = oom_wait_info->memcg;
1804 if (!mem_cgroup_is_descendant(wake_memcg, oom_wait_memcg) &&
1805 !mem_cgroup_is_descendant(oom_wait_memcg, wake_memcg))
1807 return autoremove_wake_function(wait, mode, sync, arg);
1810 static void memcg_oom_recover(struct mem_cgroup *memcg)
1813 * For the following lockless ->under_oom test, the only required
1814 * guarantee is that it must see the state asserted by an OOM when
1815 * this function is called as a result of userland actions
1816 * triggered by the notification of the OOM. This is trivially
1817 * achieved by invoking mem_cgroup_mark_under_oom() before
1818 * triggering notification.
1820 if (memcg && memcg->under_oom)
1821 __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg);
1831 static enum oom_status mem_cgroup_oom(struct mem_cgroup *memcg, gfp_t mask, int order)
1833 enum oom_status ret;
1836 if (order > PAGE_ALLOC_COSTLY_ORDER)
1839 memcg_memory_event(memcg, MEMCG_OOM);
1842 * We are in the middle of the charge context here, so we
1843 * don't want to block when potentially sitting on a callstack
1844 * that holds all kinds of filesystem and mm locks.
1846 * cgroup1 allows disabling the OOM killer and waiting for outside
1847 * handling until the charge can succeed; remember the context and put
1848 * the task to sleep at the end of the page fault when all locks are
1851 * On the other hand, in-kernel OOM killer allows for an async victim
1852 * memory reclaim (oom_reaper) and that means that we are not solely
1853 * relying on the oom victim to make a forward progress and we can
1854 * invoke the oom killer here.
1856 * Please note that mem_cgroup_out_of_memory might fail to find a
1857 * victim and then we have to bail out from the charge path.
1859 if (memcg->oom_kill_disable) {
1860 if (!current->in_user_fault)
1862 css_get(&memcg->css);
1863 current->memcg_in_oom = memcg;
1864 current->memcg_oom_gfp_mask = mask;
1865 current->memcg_oom_order = order;
1870 mem_cgroup_mark_under_oom(memcg);
1872 locked = mem_cgroup_oom_trylock(memcg);
1875 mem_cgroup_oom_notify(memcg);
1877 mem_cgroup_unmark_under_oom(memcg);
1878 if (mem_cgroup_out_of_memory(memcg, mask, order))
1884 mem_cgroup_oom_unlock(memcg);
1890 * mem_cgroup_oom_synchronize - complete memcg OOM handling
1891 * @handle: actually kill/wait or just clean up the OOM state
1893 * This has to be called at the end of a page fault if the memcg OOM
1894 * handler was enabled.
1896 * Memcg supports userspace OOM handling where failed allocations must
1897 * sleep on a waitqueue until the userspace task resolves the
1898 * situation. Sleeping directly in the charge context with all kinds
1899 * of locks held is not a good idea, instead we remember an OOM state
1900 * in the task and mem_cgroup_oom_synchronize() has to be called at
1901 * the end of the page fault to complete the OOM handling.
1903 * Returns %true if an ongoing memcg OOM situation was detected and
1904 * completed, %false otherwise.
1906 bool mem_cgroup_oom_synchronize(bool handle)
1908 struct mem_cgroup *memcg = current->memcg_in_oom;
1909 struct oom_wait_info owait;
1912 /* OOM is global, do not handle */
1919 owait.memcg = memcg;
1920 owait.wait.flags = 0;
1921 owait.wait.func = memcg_oom_wake_function;
1922 owait.wait.private = current;
1923 INIT_LIST_HEAD(&owait.wait.entry);
1925 prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE);
1926 mem_cgroup_mark_under_oom(memcg);
1928 locked = mem_cgroup_oom_trylock(memcg);
1931 mem_cgroup_oom_notify(memcg);
1933 if (locked && !memcg->oom_kill_disable) {
1934 mem_cgroup_unmark_under_oom(memcg);
1935 finish_wait(&memcg_oom_waitq, &owait.wait);
1936 mem_cgroup_out_of_memory(memcg, current->memcg_oom_gfp_mask,
1937 current->memcg_oom_order);
1940 mem_cgroup_unmark_under_oom(memcg);
1941 finish_wait(&memcg_oom_waitq, &owait.wait);
1945 mem_cgroup_oom_unlock(memcg);
1947 * There is no guarantee that an OOM-lock contender
1948 * sees the wakeups triggered by the OOM kill
1949 * uncharges. Wake any sleepers explicitly.
1951 memcg_oom_recover(memcg);
1954 current->memcg_in_oom = NULL;
1955 css_put(&memcg->css);
1960 * mem_cgroup_get_oom_group - get a memory cgroup to clean up after OOM
1961 * @victim: task to be killed by the OOM killer
1962 * @oom_domain: memcg in case of memcg OOM, NULL in case of system-wide OOM
1964 * Returns a pointer to a memory cgroup, which has to be cleaned up
1965 * by killing all belonging OOM-killable tasks.
1967 * Caller has to call mem_cgroup_put() on the returned non-NULL memcg.
1969 struct mem_cgroup *mem_cgroup_get_oom_group(struct task_struct *victim,
1970 struct mem_cgroup *oom_domain)
1972 struct mem_cgroup *oom_group = NULL;
1973 struct mem_cgroup *memcg;
1975 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys))
1979 oom_domain = root_mem_cgroup;
1983 memcg = mem_cgroup_from_task(victim);
1984 if (memcg == root_mem_cgroup)
1988 * If the victim task has been asynchronously moved to a different
1989 * memory cgroup, we might end up killing tasks outside oom_domain.
1990 * In this case it's better to ignore memory.group.oom.
1992 if (unlikely(!mem_cgroup_is_descendant(memcg, oom_domain)))
1996 * Traverse the memory cgroup hierarchy from the victim task's
1997 * cgroup up to the OOMing cgroup (or root) to find the
1998 * highest-level memory cgroup with oom.group set.
2000 for (; memcg; memcg = parent_mem_cgroup(memcg)) {
2001 if (memcg->oom_group)
2004 if (memcg == oom_domain)
2009 css_get(&oom_group->css);
2016 void mem_cgroup_print_oom_group(struct mem_cgroup *memcg)
2018 pr_info("Tasks in ");
2019 pr_cont_cgroup_path(memcg->css.cgroup);
2020 pr_cont(" are going to be killed due to memory.oom.group set\n");
2024 * lock_page_memcg - lock a page and memcg binding
2027 * This function protects unlocked LRU pages from being moved to
2030 * It ensures lifetime of the locked memcg. Caller is responsible
2031 * for the lifetime of the page.
2033 void lock_page_memcg(struct page *page)
2035 struct page *head = compound_head(page); /* rmap on tail pages */
2036 struct mem_cgroup *memcg;
2037 unsigned long flags;
2040 * The RCU lock is held throughout the transaction. The fast
2041 * path can get away without acquiring the memcg->move_lock
2042 * because page moving starts with an RCU grace period.
2046 if (mem_cgroup_disabled())
2049 memcg = page_memcg(head);
2050 if (unlikely(!memcg))
2053 #ifdef CONFIG_PROVE_LOCKING
2054 local_irq_save(flags);
2055 might_lock(&memcg->move_lock);
2056 local_irq_restore(flags);
2059 if (atomic_read(&memcg->moving_account) <= 0)
2062 spin_lock_irqsave(&memcg->move_lock, flags);
2063 if (memcg != page_memcg(head)) {
2064 spin_unlock_irqrestore(&memcg->move_lock, flags);
2069 * When charge migration first begins, we can have multiple
2070 * critical sections holding the fast-path RCU lock and one
2071 * holding the slowpath move_lock. Track the task who has the
2072 * move_lock for unlock_page_memcg().
2074 memcg->move_lock_task = current;
2075 memcg->move_lock_flags = flags;
2077 EXPORT_SYMBOL(lock_page_memcg);
2079 static void __unlock_page_memcg(struct mem_cgroup *memcg)
2081 if (memcg && memcg->move_lock_task == current) {
2082 unsigned long flags = memcg->move_lock_flags;
2084 memcg->move_lock_task = NULL;
2085 memcg->move_lock_flags = 0;
2087 spin_unlock_irqrestore(&memcg->move_lock, flags);
2094 * unlock_page_memcg - unlock a page and memcg binding
2097 void unlock_page_memcg(struct page *page)
2099 struct page *head = compound_head(page);
2101 __unlock_page_memcg(page_memcg(head));
2103 EXPORT_SYMBOL(unlock_page_memcg);
2106 #ifdef CONFIG_MEMCG_KMEM
2107 struct obj_cgroup *cached_objcg;
2108 struct pglist_data *cached_pgdat;
2109 unsigned int nr_bytes;
2110 int nr_slab_reclaimable_b;
2111 int nr_slab_unreclaimable_b;
2117 struct memcg_stock_pcp {
2118 struct mem_cgroup *cached; /* this never be root cgroup */
2119 unsigned int nr_pages;
2120 struct obj_stock task_obj;
2121 struct obj_stock irq_obj;
2123 struct work_struct work;
2124 unsigned long flags;
2125 #define FLUSHING_CACHED_CHARGE 0
2127 static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock);
2128 static DEFINE_MUTEX(percpu_charge_mutex);
2130 #ifdef CONFIG_MEMCG_KMEM
2131 static void drain_obj_stock(struct obj_stock *stock);
2132 static bool obj_stock_flush_required(struct memcg_stock_pcp *stock,
2133 struct mem_cgroup *root_memcg);
2136 static inline void drain_obj_stock(struct obj_stock *stock)
2139 static bool obj_stock_flush_required(struct memcg_stock_pcp *stock,
2140 struct mem_cgroup *root_memcg)
2147 * Most kmem_cache_alloc() calls are from user context. The irq disable/enable
2148 * sequence used in this case to access content from object stock is slow.
2149 * To optimize for user context access, there are now two object stocks for
2150 * task context and interrupt context access respectively.
2152 * The task context object stock can be accessed by disabling preemption only
2153 * which is cheap in non-preempt kernel. The interrupt context object stock
2154 * can only be accessed after disabling interrupt. User context code can
2155 * access interrupt object stock, but not vice versa.
2157 static inline struct obj_stock *get_obj_stock(unsigned long *pflags)
2159 struct memcg_stock_pcp *stock;
2161 if (likely(in_task())) {
2164 stock = this_cpu_ptr(&memcg_stock);
2165 return &stock->task_obj;
2168 local_irq_save(*pflags);
2169 stock = this_cpu_ptr(&memcg_stock);
2170 return &stock->irq_obj;
2173 static inline void put_obj_stock(unsigned long flags)
2175 if (likely(in_task()))
2178 local_irq_restore(flags);
2182 * consume_stock: Try to consume stocked charge on this cpu.
2183 * @memcg: memcg to consume from.
2184 * @nr_pages: how many pages to charge.
2186 * The charges will only happen if @memcg matches the current cpu's memcg
2187 * stock, and at least @nr_pages are available in that stock. Failure to
2188 * service an allocation will refill the stock.
2190 * returns true if successful, false otherwise.
2192 static bool consume_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2194 struct memcg_stock_pcp *stock;
2195 unsigned long flags;
2198 if (nr_pages > MEMCG_CHARGE_BATCH)
2201 local_irq_save(flags);
2203 stock = this_cpu_ptr(&memcg_stock);
2204 if (memcg == stock->cached && stock->nr_pages >= nr_pages) {
2205 stock->nr_pages -= nr_pages;
2209 local_irq_restore(flags);
2215 * Returns stocks cached in percpu and reset cached information.
2217 static void drain_stock(struct memcg_stock_pcp *stock)
2219 struct mem_cgroup *old = stock->cached;
2224 if (stock->nr_pages) {
2225 page_counter_uncharge(&old->memory, stock->nr_pages);
2226 if (do_memsw_account())
2227 page_counter_uncharge(&old->memsw, stock->nr_pages);
2228 stock->nr_pages = 0;
2232 stock->cached = NULL;
2235 static void drain_local_stock(struct work_struct *dummy)
2237 struct memcg_stock_pcp *stock;
2238 unsigned long flags;
2241 * The only protection from cpu hotplug (memcg_hotplug_cpu_dead) vs.
2242 * drain_stock races is that we always operate on local CPU stock
2243 * here with IRQ disabled
2245 local_irq_save(flags);
2247 stock = this_cpu_ptr(&memcg_stock);
2248 drain_obj_stock(&stock->irq_obj);
2250 drain_obj_stock(&stock->task_obj);
2252 clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags);
2254 local_irq_restore(flags);
2258 * Cache charges(val) to local per_cpu area.
2259 * This will be consumed by consume_stock() function, later.
2261 static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2263 struct memcg_stock_pcp *stock;
2264 unsigned long flags;
2266 local_irq_save(flags);
2268 stock = this_cpu_ptr(&memcg_stock);
2269 if (stock->cached != memcg) { /* reset if necessary */
2271 css_get(&memcg->css);
2272 stock->cached = memcg;
2274 stock->nr_pages += nr_pages;
2276 if (stock->nr_pages > MEMCG_CHARGE_BATCH)
2279 local_irq_restore(flags);
2283 * Drains all per-CPU charge caches for given root_memcg resp. subtree
2284 * of the hierarchy under it.
2286 static void drain_all_stock(struct mem_cgroup *root_memcg)
2290 /* If someone's already draining, avoid adding running more workers. */
2291 if (!mutex_trylock(&percpu_charge_mutex))
2294 * Notify other cpus that system-wide "drain" is running
2295 * We do not care about races with the cpu hotplug because cpu down
2296 * as well as workers from this path always operate on the local
2297 * per-cpu data. CPU up doesn't touch memcg_stock at all.
2300 for_each_online_cpu(cpu) {
2301 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2302 struct mem_cgroup *memcg;
2306 memcg = stock->cached;
2307 if (memcg && stock->nr_pages &&
2308 mem_cgroup_is_descendant(memcg, root_memcg))
2310 else if (obj_stock_flush_required(stock, root_memcg))
2315 !test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) {
2317 drain_local_stock(&stock->work);
2319 schedule_work_on(cpu, &stock->work);
2323 mutex_unlock(&percpu_charge_mutex);
2326 static int memcg_hotplug_cpu_dead(unsigned int cpu)
2328 struct memcg_stock_pcp *stock;
2330 stock = &per_cpu(memcg_stock, cpu);
2336 static unsigned long reclaim_high(struct mem_cgroup *memcg,
2337 unsigned int nr_pages,
2340 unsigned long nr_reclaimed = 0;
2343 unsigned long pflags;
2345 if (page_counter_read(&memcg->memory) <=
2346 READ_ONCE(memcg->memory.high))
2349 memcg_memory_event(memcg, MEMCG_HIGH);
2351 psi_memstall_enter(&pflags);
2352 nr_reclaimed += try_to_free_mem_cgroup_pages(memcg, nr_pages,
2354 psi_memstall_leave(&pflags);
2355 } while ((memcg = parent_mem_cgroup(memcg)) &&
2356 !mem_cgroup_is_root(memcg));
2358 return nr_reclaimed;
2361 static void high_work_func(struct work_struct *work)
2363 struct mem_cgroup *memcg;
2365 memcg = container_of(work, struct mem_cgroup, high_work);
2366 reclaim_high(memcg, MEMCG_CHARGE_BATCH, GFP_KERNEL);
2370 * Clamp the maximum sleep time per allocation batch to 2 seconds. This is
2371 * enough to still cause a significant slowdown in most cases, while still
2372 * allowing diagnostics and tracing to proceed without becoming stuck.
2374 #define MEMCG_MAX_HIGH_DELAY_JIFFIES (2UL*HZ)
2377 * When calculating the delay, we use these either side of the exponentiation to
2378 * maintain precision and scale to a reasonable number of jiffies (see the table
2381 * - MEMCG_DELAY_PRECISION_SHIFT: Extra precision bits while translating the
2382 * overage ratio to a delay.
2383 * - MEMCG_DELAY_SCALING_SHIFT: The number of bits to scale down the
2384 * proposed penalty in order to reduce to a reasonable number of jiffies, and
2385 * to produce a reasonable delay curve.
2387 * MEMCG_DELAY_SCALING_SHIFT just happens to be a number that produces a
2388 * reasonable delay curve compared to precision-adjusted overage, not
2389 * penalising heavily at first, but still making sure that growth beyond the
2390 * limit penalises misbehaviour cgroups by slowing them down exponentially. For
2391 * example, with a high of 100 megabytes:
2393 * +-------+------------------------+
2394 * | usage | time to allocate in ms |
2395 * +-------+------------------------+
2417 * +-------+------------------------+
2419 #define MEMCG_DELAY_PRECISION_SHIFT 20
2420 #define MEMCG_DELAY_SCALING_SHIFT 14
2422 static u64 calculate_overage(unsigned long usage, unsigned long high)
2430 * Prevent division by 0 in overage calculation by acting as if
2431 * it was a threshold of 1 page
2433 high = max(high, 1UL);
2435 overage = usage - high;
2436 overage <<= MEMCG_DELAY_PRECISION_SHIFT;
2437 return div64_u64(overage, high);
2440 static u64 mem_find_max_overage(struct mem_cgroup *memcg)
2442 u64 overage, max_overage = 0;
2445 overage = calculate_overage(page_counter_read(&memcg->memory),
2446 READ_ONCE(memcg->memory.high));
2447 max_overage = max(overage, max_overage);
2448 } while ((memcg = parent_mem_cgroup(memcg)) &&
2449 !mem_cgroup_is_root(memcg));
2454 static u64 swap_find_max_overage(struct mem_cgroup *memcg)
2456 u64 overage, max_overage = 0;
2459 overage = calculate_overage(page_counter_read(&memcg->swap),
2460 READ_ONCE(memcg->swap.high));
2462 memcg_memory_event(memcg, MEMCG_SWAP_HIGH);
2463 max_overage = max(overage, max_overage);
2464 } while ((memcg = parent_mem_cgroup(memcg)) &&
2465 !mem_cgroup_is_root(memcg));
2471 * Get the number of jiffies that we should penalise a mischievous cgroup which
2472 * is exceeding its memory.high by checking both it and its ancestors.
2474 static unsigned long calculate_high_delay(struct mem_cgroup *memcg,
2475 unsigned int nr_pages,
2478 unsigned long penalty_jiffies;
2484 * We use overage compared to memory.high to calculate the number of
2485 * jiffies to sleep (penalty_jiffies). Ideally this value should be
2486 * fairly lenient on small overages, and increasingly harsh when the
2487 * memcg in question makes it clear that it has no intention of stopping
2488 * its crazy behaviour, so we exponentially increase the delay based on
2491 penalty_jiffies = max_overage * max_overage * HZ;
2492 penalty_jiffies >>= MEMCG_DELAY_PRECISION_SHIFT;
2493 penalty_jiffies >>= MEMCG_DELAY_SCALING_SHIFT;
2496 * Factor in the task's own contribution to the overage, such that four
2497 * N-sized allocations are throttled approximately the same as one
2498 * 4N-sized allocation.
2500 * MEMCG_CHARGE_BATCH pages is nominal, so work out how much smaller or
2501 * larger the current charge patch is than that.
2503 return penalty_jiffies * nr_pages / MEMCG_CHARGE_BATCH;
2507 * Scheduled by try_charge() to be executed from the userland return path
2508 * and reclaims memory over the high limit.
2510 void mem_cgroup_handle_over_high(void)
2512 unsigned long penalty_jiffies;
2513 unsigned long pflags;
2514 unsigned long nr_reclaimed;
2515 unsigned int nr_pages = current->memcg_nr_pages_over_high;
2516 int nr_retries = MAX_RECLAIM_RETRIES;
2517 struct mem_cgroup *memcg;
2518 bool in_retry = false;
2520 if (likely(!nr_pages))
2523 memcg = get_mem_cgroup_from_mm(current->mm);
2524 current->memcg_nr_pages_over_high = 0;
2528 * The allocating task should reclaim at least the batch size, but for
2529 * subsequent retries we only want to do what's necessary to prevent oom
2530 * or breaching resource isolation.
2532 * This is distinct from memory.max or page allocator behaviour because
2533 * memory.high is currently batched, whereas memory.max and the page
2534 * allocator run every time an allocation is made.
2536 nr_reclaimed = reclaim_high(memcg,
2537 in_retry ? SWAP_CLUSTER_MAX : nr_pages,
2541 * memory.high is breached and reclaim is unable to keep up. Throttle
2542 * allocators proactively to slow down excessive growth.
2544 penalty_jiffies = calculate_high_delay(memcg, nr_pages,
2545 mem_find_max_overage(memcg));
2547 penalty_jiffies += calculate_high_delay(memcg, nr_pages,
2548 swap_find_max_overage(memcg));
2551 * Clamp the max delay per usermode return so as to still keep the
2552 * application moving forwards and also permit diagnostics, albeit
2555 penalty_jiffies = min(penalty_jiffies, MEMCG_MAX_HIGH_DELAY_JIFFIES);
2558 * Don't sleep if the amount of jiffies this memcg owes us is so low
2559 * that it's not even worth doing, in an attempt to be nice to those who
2560 * go only a small amount over their memory.high value and maybe haven't
2561 * been aggressively reclaimed enough yet.
2563 if (penalty_jiffies <= HZ / 100)
2567 * If reclaim is making forward progress but we're still over
2568 * memory.high, we want to encourage that rather than doing allocator
2571 if (nr_reclaimed || nr_retries--) {
2577 * If we exit early, we're guaranteed to die (since
2578 * schedule_timeout_killable sets TASK_KILLABLE). This means we don't
2579 * need to account for any ill-begotten jiffies to pay them off later.
2581 psi_memstall_enter(&pflags);
2582 schedule_timeout_killable(penalty_jiffies);
2583 psi_memstall_leave(&pflags);
2586 css_put(&memcg->css);
2589 static int try_charge_memcg(struct mem_cgroup *memcg, gfp_t gfp_mask,
2590 unsigned int nr_pages)
2592 unsigned int batch = max(MEMCG_CHARGE_BATCH, nr_pages);
2593 int nr_retries = MAX_RECLAIM_RETRIES;
2594 struct mem_cgroup *mem_over_limit;
2595 struct page_counter *counter;
2596 enum oom_status oom_status;
2597 unsigned long nr_reclaimed;
2598 bool passed_oom = false;
2599 bool may_swap = true;
2600 bool drained = false;
2601 unsigned long pflags;
2604 if (consume_stock(memcg, nr_pages))
2607 if (!do_memsw_account() ||
2608 page_counter_try_charge(&memcg->memsw, batch, &counter)) {
2609 if (page_counter_try_charge(&memcg->memory, batch, &counter))
2611 if (do_memsw_account())
2612 page_counter_uncharge(&memcg->memsw, batch);
2613 mem_over_limit = mem_cgroup_from_counter(counter, memory);
2615 mem_over_limit = mem_cgroup_from_counter(counter, memsw);
2619 if (batch > nr_pages) {
2625 * Memcg doesn't have a dedicated reserve for atomic
2626 * allocations. But like the global atomic pool, we need to
2627 * put the burden of reclaim on regular allocation requests
2628 * and let these go through as privileged allocations.
2630 if (gfp_mask & __GFP_ATOMIC)
2634 * Prevent unbounded recursion when reclaim operations need to
2635 * allocate memory. This might exceed the limits temporarily,
2636 * but we prefer facilitating memory reclaim and getting back
2637 * under the limit over triggering OOM kills in these cases.
2639 if (unlikely(current->flags & PF_MEMALLOC))
2642 if (unlikely(task_in_memcg_oom(current)))
2645 if (!gfpflags_allow_blocking(gfp_mask))
2648 memcg_memory_event(mem_over_limit, MEMCG_MAX);
2650 psi_memstall_enter(&pflags);
2651 nr_reclaimed = try_to_free_mem_cgroup_pages(mem_over_limit, nr_pages,
2652 gfp_mask, may_swap);
2653 psi_memstall_leave(&pflags);
2655 if (mem_cgroup_margin(mem_over_limit) >= nr_pages)
2659 drain_all_stock(mem_over_limit);
2664 if (gfp_mask & __GFP_NORETRY)
2667 * Even though the limit is exceeded at this point, reclaim
2668 * may have been able to free some pages. Retry the charge
2669 * before killing the task.
2671 * Only for regular pages, though: huge pages are rather
2672 * unlikely to succeed so close to the limit, and we fall back
2673 * to regular pages anyway in case of failure.
2675 if (nr_reclaimed && nr_pages <= (1 << PAGE_ALLOC_COSTLY_ORDER))
2678 * At task move, charge accounts can be doubly counted. So, it's
2679 * better to wait until the end of task_move if something is going on.
2681 if (mem_cgroup_wait_acct_move(mem_over_limit))
2687 if (gfp_mask & __GFP_RETRY_MAYFAIL)
2690 /* Avoid endless loop for tasks bypassed by the oom killer */
2691 if (passed_oom && task_is_dying())
2695 * keep retrying as long as the memcg oom killer is able to make
2696 * a forward progress or bypass the charge if the oom killer
2697 * couldn't make any progress.
2699 oom_status = mem_cgroup_oom(mem_over_limit, gfp_mask,
2700 get_order(nr_pages * PAGE_SIZE));
2701 if (oom_status == OOM_SUCCESS) {
2703 nr_retries = MAX_RECLAIM_RETRIES;
2707 if (!(gfp_mask & __GFP_NOFAIL))
2711 * The allocation either can't fail or will lead to more memory
2712 * being freed very soon. Allow memory usage go over the limit
2713 * temporarily by force charging it.
2715 page_counter_charge(&memcg->memory, nr_pages);
2716 if (do_memsw_account())
2717 page_counter_charge(&memcg->memsw, nr_pages);
2722 if (batch > nr_pages)
2723 refill_stock(memcg, batch - nr_pages);
2726 * If the hierarchy is above the normal consumption range, schedule
2727 * reclaim on returning to userland. We can perform reclaim here
2728 * if __GFP_RECLAIM but let's always punt for simplicity and so that
2729 * GFP_KERNEL can consistently be used during reclaim. @memcg is
2730 * not recorded as it most likely matches current's and won't
2731 * change in the meantime. As high limit is checked again before
2732 * reclaim, the cost of mismatch is negligible.
2735 bool mem_high, swap_high;
2737 mem_high = page_counter_read(&memcg->memory) >
2738 READ_ONCE(memcg->memory.high);
2739 swap_high = page_counter_read(&memcg->swap) >
2740 READ_ONCE(memcg->swap.high);
2742 /* Don't bother a random interrupted task */
2743 if (in_interrupt()) {
2745 schedule_work(&memcg->high_work);
2751 if (mem_high || swap_high) {
2753 * The allocating tasks in this cgroup will need to do
2754 * reclaim or be throttled to prevent further growth
2755 * of the memory or swap footprints.
2757 * Target some best-effort fairness between the tasks,
2758 * and distribute reclaim work and delay penalties
2759 * based on how much each task is actually allocating.
2761 current->memcg_nr_pages_over_high += batch;
2762 set_notify_resume(current);
2765 } while ((memcg = parent_mem_cgroup(memcg)));
2770 static inline int try_charge(struct mem_cgroup *memcg, gfp_t gfp_mask,
2771 unsigned int nr_pages)
2773 if (mem_cgroup_is_root(memcg))
2776 return try_charge_memcg(memcg, gfp_mask, nr_pages);
2779 #if defined(CONFIG_MEMCG_KMEM) || defined(CONFIG_MMU)
2780 static void cancel_charge(struct mem_cgroup *memcg, unsigned int nr_pages)
2782 if (mem_cgroup_is_root(memcg))
2785 page_counter_uncharge(&memcg->memory, nr_pages);
2786 if (do_memsw_account())
2787 page_counter_uncharge(&memcg->memsw, nr_pages);
2791 static void commit_charge(struct page *page, struct mem_cgroup *memcg)
2793 VM_BUG_ON_PAGE(page_memcg(page), page);
2795 * Any of the following ensures page's memcg stability:
2799 * - lock_page_memcg()
2800 * - exclusive reference
2802 page->memcg_data = (unsigned long)memcg;
2805 static struct mem_cgroup *get_mem_cgroup_from_objcg(struct obj_cgroup *objcg)
2807 struct mem_cgroup *memcg;
2811 memcg = obj_cgroup_memcg(objcg);
2812 if (unlikely(!css_tryget(&memcg->css)))
2819 #ifdef CONFIG_MEMCG_KMEM
2821 * The allocated objcg pointers array is not accounted directly.
2822 * Moreover, it should not come from DMA buffer and is not readily
2823 * reclaimable. So those GFP bits should be masked off.
2825 #define OBJCGS_CLEAR_MASK (__GFP_DMA | __GFP_RECLAIMABLE | __GFP_ACCOUNT)
2827 int memcg_alloc_page_obj_cgroups(struct page *page, struct kmem_cache *s,
2828 gfp_t gfp, bool new_page)
2830 unsigned int objects = objs_per_slab_page(s, page);
2831 unsigned long memcg_data;
2834 gfp &= ~OBJCGS_CLEAR_MASK;
2835 vec = kcalloc_node(objects, sizeof(struct obj_cgroup *), gfp,
2840 memcg_data = (unsigned long) vec | MEMCG_DATA_OBJCGS;
2843 * If the slab page is brand new and nobody can yet access
2844 * it's memcg_data, no synchronization is required and
2845 * memcg_data can be simply assigned.
2847 page->memcg_data = memcg_data;
2848 } else if (cmpxchg(&page->memcg_data, 0, memcg_data)) {
2850 * If the slab page is already in use, somebody can allocate
2851 * and assign obj_cgroups in parallel. In this case the existing
2852 * objcg vector should be reused.
2858 kmemleak_not_leak(vec);
2863 * Returns a pointer to the memory cgroup to which the kernel object is charged.
2865 * A passed kernel object can be a slab object or a generic kernel page, so
2866 * different mechanisms for getting the memory cgroup pointer should be used.
2867 * In certain cases (e.g. kernel stacks or large kmallocs with SLUB) the caller
2868 * can not know for sure how the kernel object is implemented.
2869 * mem_cgroup_from_obj() can be safely used in such cases.
2871 * The caller must ensure the memcg lifetime, e.g. by taking rcu_read_lock(),
2872 * cgroup_mutex, etc.
2874 struct mem_cgroup *mem_cgroup_from_obj(void *p)
2878 if (mem_cgroup_disabled())
2881 page = virt_to_head_page(p);
2884 * Slab objects are accounted individually, not per-page.
2885 * Memcg membership data for each individual object is saved in
2886 * the page->obj_cgroups.
2888 if (page_objcgs_check(page)) {
2889 struct obj_cgroup *objcg;
2892 off = obj_to_index(page->slab_cache, page, p);
2893 objcg = page_objcgs(page)[off];
2895 return obj_cgroup_memcg(objcg);
2901 * page_memcg_check() is used here, because page_has_obj_cgroups()
2902 * check above could fail because the object cgroups vector wasn't set
2903 * at that moment, but it can be set concurrently.
2904 * page_memcg_check(page) will guarantee that a proper memory
2905 * cgroup pointer or NULL will be returned.
2907 return page_memcg_check(page);
2910 __always_inline struct obj_cgroup *get_obj_cgroup_from_current(void)
2912 struct obj_cgroup *objcg = NULL;
2913 struct mem_cgroup *memcg;
2915 if (memcg_kmem_bypass())
2919 if (unlikely(active_memcg()))
2920 memcg = active_memcg();
2922 memcg = mem_cgroup_from_task(current);
2924 for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg)) {
2925 objcg = rcu_dereference(memcg->objcg);
2926 if (objcg && obj_cgroup_tryget(objcg))
2935 static int memcg_alloc_cache_id(void)
2940 id = ida_simple_get(&memcg_cache_ida,
2941 0, MEMCG_CACHES_MAX_SIZE, GFP_KERNEL);
2945 if (id < memcg_nr_cache_ids)
2949 * There's no space for the new id in memcg_caches arrays,
2950 * so we have to grow them.
2952 down_write(&memcg_cache_ids_sem);
2954 size = 2 * (id + 1);
2955 if (size < MEMCG_CACHES_MIN_SIZE)
2956 size = MEMCG_CACHES_MIN_SIZE;
2957 else if (size > MEMCG_CACHES_MAX_SIZE)
2958 size = MEMCG_CACHES_MAX_SIZE;
2960 err = memcg_update_all_list_lrus(size);
2962 memcg_nr_cache_ids = size;
2964 up_write(&memcg_cache_ids_sem);
2967 ida_simple_remove(&memcg_cache_ida, id);
2973 static void memcg_free_cache_id(int id)
2975 ida_simple_remove(&memcg_cache_ida, id);
2979 * obj_cgroup_uncharge_pages: uncharge a number of kernel pages from a objcg
2980 * @objcg: object cgroup to uncharge
2981 * @nr_pages: number of pages to uncharge
2983 static void obj_cgroup_uncharge_pages(struct obj_cgroup *objcg,
2984 unsigned int nr_pages)
2986 struct mem_cgroup *memcg;
2988 memcg = get_mem_cgroup_from_objcg(objcg);
2990 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys))
2991 page_counter_uncharge(&memcg->kmem, nr_pages);
2992 refill_stock(memcg, nr_pages);
2994 css_put(&memcg->css);
2998 * obj_cgroup_charge_pages: charge a number of kernel pages to a objcg
2999 * @objcg: object cgroup to charge
3000 * @gfp: reclaim mode
3001 * @nr_pages: number of pages to charge
3003 * Returns 0 on success, an error code on failure.
3005 static int obj_cgroup_charge_pages(struct obj_cgroup *objcg, gfp_t gfp,
3006 unsigned int nr_pages)
3008 struct page_counter *counter;
3009 struct mem_cgroup *memcg;
3012 memcg = get_mem_cgroup_from_objcg(objcg);
3014 ret = try_charge_memcg(memcg, gfp, nr_pages);
3018 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) &&
3019 !page_counter_try_charge(&memcg->kmem, nr_pages, &counter)) {
3022 * Enforce __GFP_NOFAIL allocation because callers are not
3023 * prepared to see failures and likely do not have any failure
3026 if (gfp & __GFP_NOFAIL) {
3027 page_counter_charge(&memcg->kmem, nr_pages);
3030 cancel_charge(memcg, nr_pages);
3034 css_put(&memcg->css);
3040 * __memcg_kmem_charge_page: charge a kmem page to the current memory cgroup
3041 * @page: page to charge
3042 * @gfp: reclaim mode
3043 * @order: allocation order
3045 * Returns 0 on success, an error code on failure.
3047 int __memcg_kmem_charge_page(struct page *page, gfp_t gfp, int order)
3049 struct obj_cgroup *objcg;
3052 objcg = get_obj_cgroup_from_current();
3054 ret = obj_cgroup_charge_pages(objcg, gfp, 1 << order);
3056 page->memcg_data = (unsigned long)objcg |
3060 obj_cgroup_put(objcg);
3066 * __memcg_kmem_uncharge_page: uncharge a kmem page
3067 * @page: page to uncharge
3068 * @order: allocation order
3070 void __memcg_kmem_uncharge_page(struct page *page, int order)
3072 struct obj_cgroup *objcg;
3073 unsigned int nr_pages = 1 << order;
3075 if (!PageMemcgKmem(page))
3078 objcg = __page_objcg(page);
3079 obj_cgroup_uncharge_pages(objcg, nr_pages);
3080 page->memcg_data = 0;
3081 obj_cgroup_put(objcg);
3084 void mod_objcg_state(struct obj_cgroup *objcg, struct pglist_data *pgdat,
3085 enum node_stat_item idx, int nr)
3087 unsigned long flags;
3088 struct obj_stock *stock = get_obj_stock(&flags);
3092 * Save vmstat data in stock and skip vmstat array update unless
3093 * accumulating over a page of vmstat data or when pgdat or idx
3096 if (stock->cached_objcg != objcg) {
3097 drain_obj_stock(stock);
3098 obj_cgroup_get(objcg);
3099 stock->nr_bytes = atomic_read(&objcg->nr_charged_bytes)
3100 ? atomic_xchg(&objcg->nr_charged_bytes, 0) : 0;
3101 stock->cached_objcg = objcg;
3102 stock->cached_pgdat = pgdat;
3103 } else if (stock->cached_pgdat != pgdat) {
3104 /* Flush the existing cached vmstat data */
3105 struct pglist_data *oldpg = stock->cached_pgdat;
3107 if (stock->nr_slab_reclaimable_b) {
3108 mod_objcg_mlstate(objcg, oldpg, NR_SLAB_RECLAIMABLE_B,
3109 stock->nr_slab_reclaimable_b);
3110 stock->nr_slab_reclaimable_b = 0;
3112 if (stock->nr_slab_unreclaimable_b) {
3113 mod_objcg_mlstate(objcg, oldpg, NR_SLAB_UNRECLAIMABLE_B,
3114 stock->nr_slab_unreclaimable_b);
3115 stock->nr_slab_unreclaimable_b = 0;
3117 stock->cached_pgdat = pgdat;
3120 bytes = (idx == NR_SLAB_RECLAIMABLE_B) ? &stock->nr_slab_reclaimable_b
3121 : &stock->nr_slab_unreclaimable_b;
3123 * Even for large object >= PAGE_SIZE, the vmstat data will still be
3124 * cached locally at least once before pushing it out.
3131 if (abs(*bytes) > PAGE_SIZE) {
3139 mod_objcg_mlstate(objcg, pgdat, idx, nr);
3141 put_obj_stock(flags);
3144 static bool consume_obj_stock(struct obj_cgroup *objcg, unsigned int nr_bytes)
3146 unsigned long flags;
3147 struct obj_stock *stock = get_obj_stock(&flags);
3150 if (objcg == stock->cached_objcg && stock->nr_bytes >= nr_bytes) {
3151 stock->nr_bytes -= nr_bytes;
3155 put_obj_stock(flags);
3160 static void drain_obj_stock(struct obj_stock *stock)
3162 struct obj_cgroup *old = stock->cached_objcg;
3167 if (stock->nr_bytes) {
3168 unsigned int nr_pages = stock->nr_bytes >> PAGE_SHIFT;
3169 unsigned int nr_bytes = stock->nr_bytes & (PAGE_SIZE - 1);
3172 obj_cgroup_uncharge_pages(old, nr_pages);
3175 * The leftover is flushed to the centralized per-memcg value.
3176 * On the next attempt to refill obj stock it will be moved
3177 * to a per-cpu stock (probably, on an other CPU), see
3178 * refill_obj_stock().
3180 * How often it's flushed is a trade-off between the memory
3181 * limit enforcement accuracy and potential CPU contention,
3182 * so it might be changed in the future.
3184 atomic_add(nr_bytes, &old->nr_charged_bytes);
3185 stock->nr_bytes = 0;
3189 * Flush the vmstat data in current stock
3191 if (stock->nr_slab_reclaimable_b || stock->nr_slab_unreclaimable_b) {
3192 if (stock->nr_slab_reclaimable_b) {
3193 mod_objcg_mlstate(old, stock->cached_pgdat,
3194 NR_SLAB_RECLAIMABLE_B,
3195 stock->nr_slab_reclaimable_b);
3196 stock->nr_slab_reclaimable_b = 0;
3198 if (stock->nr_slab_unreclaimable_b) {
3199 mod_objcg_mlstate(old, stock->cached_pgdat,
3200 NR_SLAB_UNRECLAIMABLE_B,
3201 stock->nr_slab_unreclaimable_b);
3202 stock->nr_slab_unreclaimable_b = 0;
3204 stock->cached_pgdat = NULL;
3207 obj_cgroup_put(old);
3208 stock->cached_objcg = NULL;
3211 static bool obj_stock_flush_required(struct memcg_stock_pcp *stock,
3212 struct mem_cgroup *root_memcg)
3214 struct mem_cgroup *memcg;
3216 if (in_task() && stock->task_obj.cached_objcg) {
3217 memcg = obj_cgroup_memcg(stock->task_obj.cached_objcg);
3218 if (memcg && mem_cgroup_is_descendant(memcg, root_memcg))
3221 if (stock->irq_obj.cached_objcg) {
3222 memcg = obj_cgroup_memcg(stock->irq_obj.cached_objcg);
3223 if (memcg && mem_cgroup_is_descendant(memcg, root_memcg))
3230 static void refill_obj_stock(struct obj_cgroup *objcg, unsigned int nr_bytes,
3231 bool allow_uncharge)
3233 unsigned long flags;
3234 struct obj_stock *stock = get_obj_stock(&flags);
3235 unsigned int nr_pages = 0;
3237 if (stock->cached_objcg != objcg) { /* reset if necessary */
3238 drain_obj_stock(stock);
3239 obj_cgroup_get(objcg);
3240 stock->cached_objcg = objcg;
3241 stock->nr_bytes = atomic_read(&objcg->nr_charged_bytes)
3242 ? atomic_xchg(&objcg->nr_charged_bytes, 0) : 0;
3243 allow_uncharge = true; /* Allow uncharge when objcg changes */
3245 stock->nr_bytes += nr_bytes;
3247 if (allow_uncharge && (stock->nr_bytes > PAGE_SIZE)) {
3248 nr_pages = stock->nr_bytes >> PAGE_SHIFT;
3249 stock->nr_bytes &= (PAGE_SIZE - 1);
3252 put_obj_stock(flags);
3255 obj_cgroup_uncharge_pages(objcg, nr_pages);
3258 int obj_cgroup_charge(struct obj_cgroup *objcg, gfp_t gfp, size_t size)
3260 unsigned int nr_pages, nr_bytes;
3263 if (consume_obj_stock(objcg, size))
3267 * In theory, objcg->nr_charged_bytes can have enough
3268 * pre-charged bytes to satisfy the allocation. However,
3269 * flushing objcg->nr_charged_bytes requires two atomic
3270 * operations, and objcg->nr_charged_bytes can't be big.
3271 * The shared objcg->nr_charged_bytes can also become a
3272 * performance bottleneck if all tasks of the same memcg are
3273 * trying to update it. So it's better to ignore it and try
3274 * grab some new pages. The stock's nr_bytes will be flushed to
3275 * objcg->nr_charged_bytes later on when objcg changes.
3277 * The stock's nr_bytes may contain enough pre-charged bytes
3278 * to allow one less page from being charged, but we can't rely
3279 * on the pre-charged bytes not being changed outside of
3280 * consume_obj_stock() or refill_obj_stock(). So ignore those
3281 * pre-charged bytes as well when charging pages. To avoid a
3282 * page uncharge right after a page charge, we set the
3283 * allow_uncharge flag to false when calling refill_obj_stock()
3284 * to temporarily allow the pre-charged bytes to exceed the page
3285 * size limit. The maximum reachable value of the pre-charged
3286 * bytes is (sizeof(object) + PAGE_SIZE - 2) if there is no data
3289 nr_pages = size >> PAGE_SHIFT;
3290 nr_bytes = size & (PAGE_SIZE - 1);
3295 ret = obj_cgroup_charge_pages(objcg, gfp, nr_pages);
3296 if (!ret && nr_bytes)
3297 refill_obj_stock(objcg, PAGE_SIZE - nr_bytes, false);
3302 void obj_cgroup_uncharge(struct obj_cgroup *objcg, size_t size)
3304 refill_obj_stock(objcg, size, true);
3307 #endif /* CONFIG_MEMCG_KMEM */
3310 * Because page_memcg(head) is not set on tails, set it now.
3312 void split_page_memcg(struct page *head, unsigned int nr)
3314 struct mem_cgroup *memcg = page_memcg(head);
3317 if (mem_cgroup_disabled() || !memcg)
3320 for (i = 1; i < nr; i++)
3321 head[i].memcg_data = head->memcg_data;
3323 if (PageMemcgKmem(head))
3324 obj_cgroup_get_many(__page_objcg(head), nr - 1);
3326 css_get_many(&memcg->css, nr - 1);
3329 #ifdef CONFIG_MEMCG_SWAP
3331 * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record.
3332 * @entry: swap entry to be moved
3333 * @from: mem_cgroup which the entry is moved from
3334 * @to: mem_cgroup which the entry is moved to
3336 * It succeeds only when the swap_cgroup's record for this entry is the same
3337 * as the mem_cgroup's id of @from.
3339 * Returns 0 on success, -EINVAL on failure.
3341 * The caller must have charged to @to, IOW, called page_counter_charge() about
3342 * both res and memsw, and called css_get().
3344 static int mem_cgroup_move_swap_account(swp_entry_t entry,
3345 struct mem_cgroup *from, struct mem_cgroup *to)
3347 unsigned short old_id, new_id;
3349 old_id = mem_cgroup_id(from);
3350 new_id = mem_cgroup_id(to);
3352 if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) {
3353 mod_memcg_state(from, MEMCG_SWAP, -1);
3354 mod_memcg_state(to, MEMCG_SWAP, 1);
3360 static inline int mem_cgroup_move_swap_account(swp_entry_t entry,
3361 struct mem_cgroup *from, struct mem_cgroup *to)
3367 static DEFINE_MUTEX(memcg_max_mutex);
3369 static int mem_cgroup_resize_max(struct mem_cgroup *memcg,
3370 unsigned long max, bool memsw)
3372 bool enlarge = false;
3373 bool drained = false;
3375 bool limits_invariant;
3376 struct page_counter *counter = memsw ? &memcg->memsw : &memcg->memory;
3379 if (signal_pending(current)) {
3384 mutex_lock(&memcg_max_mutex);
3386 * Make sure that the new limit (memsw or memory limit) doesn't
3387 * break our basic invariant rule memory.max <= memsw.max.
3389 limits_invariant = memsw ? max >= READ_ONCE(memcg->memory.max) :
3390 max <= memcg->memsw.max;
3391 if (!limits_invariant) {
3392 mutex_unlock(&memcg_max_mutex);
3396 if (max > counter->max)
3398 ret = page_counter_set_max(counter, max);
3399 mutex_unlock(&memcg_max_mutex);
3405 drain_all_stock(memcg);
3410 if (!try_to_free_mem_cgroup_pages(memcg, 1,
3411 GFP_KERNEL, !memsw)) {
3417 if (!ret && enlarge)
3418 memcg_oom_recover(memcg);
3423 unsigned long mem_cgroup_soft_limit_reclaim(pg_data_t *pgdat, int order,
3425 unsigned long *total_scanned)
3427 unsigned long nr_reclaimed = 0;
3428 struct mem_cgroup_per_node *mz, *next_mz = NULL;
3429 unsigned long reclaimed;
3431 struct mem_cgroup_tree_per_node *mctz;
3432 unsigned long excess;
3433 unsigned long nr_scanned;
3438 mctz = soft_limit_tree_node(pgdat->node_id);
3441 * Do not even bother to check the largest node if the root
3442 * is empty. Do it lockless to prevent lock bouncing. Races
3443 * are acceptable as soft limit is best effort anyway.
3445 if (!mctz || RB_EMPTY_ROOT(&mctz->rb_root))
3449 * This loop can run a while, specially if mem_cgroup's continuously
3450 * keep exceeding their soft limit and putting the system under
3457 mz = mem_cgroup_largest_soft_limit_node(mctz);
3462 reclaimed = mem_cgroup_soft_reclaim(mz->memcg, pgdat,
3463 gfp_mask, &nr_scanned);
3464 nr_reclaimed += reclaimed;
3465 *total_scanned += nr_scanned;
3466 spin_lock_irq(&mctz->lock);
3467 __mem_cgroup_remove_exceeded(mz, mctz);
3470 * If we failed to reclaim anything from this memory cgroup
3471 * it is time to move on to the next cgroup
3475 next_mz = __mem_cgroup_largest_soft_limit_node(mctz);
3477 excess = soft_limit_excess(mz->memcg);
3479 * One school of thought says that we should not add
3480 * back the node to the tree if reclaim returns 0.
3481 * But our reclaim could return 0, simply because due
3482 * to priority we are exposing a smaller subset of
3483 * memory to reclaim from. Consider this as a longer
3486 /* If excess == 0, no tree ops */
3487 __mem_cgroup_insert_exceeded(mz, mctz, excess);
3488 spin_unlock_irq(&mctz->lock);
3489 css_put(&mz->memcg->css);
3492 * Could not reclaim anything and there are no more
3493 * mem cgroups to try or we seem to be looping without
3494 * reclaiming anything.
3496 if (!nr_reclaimed &&
3498 loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS))
3500 } while (!nr_reclaimed);
3502 css_put(&next_mz->memcg->css);
3503 return nr_reclaimed;
3507 * Reclaims as many pages from the given memcg as possible.
3509 * Caller is responsible for holding css reference for memcg.
3511 static int mem_cgroup_force_empty(struct mem_cgroup *memcg)
3513 int nr_retries = MAX_RECLAIM_RETRIES;
3515 /* we call try-to-free pages for make this cgroup empty */
3516 lru_add_drain_all();
3518 drain_all_stock(memcg);
3520 /* try to free all pages in this cgroup */
3521 while (nr_retries && page_counter_read(&memcg->memory)) {
3524 if (signal_pending(current))
3527 progress = try_to_free_mem_cgroup_pages(memcg, 1,
3531 /* maybe some writeback is necessary */
3532 congestion_wait(BLK_RW_ASYNC, HZ/10);
3540 static ssize_t mem_cgroup_force_empty_write(struct kernfs_open_file *of,
3541 char *buf, size_t nbytes,
3544 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
3546 if (mem_cgroup_is_root(memcg))
3548 return mem_cgroup_force_empty(memcg) ?: nbytes;
3551 static u64 mem_cgroup_hierarchy_read(struct cgroup_subsys_state *css,
3557 static int mem_cgroup_hierarchy_write(struct cgroup_subsys_state *css,
3558 struct cftype *cft, u64 val)
3563 pr_warn_once("Non-hierarchical mode is deprecated. "
3564 "Please report your usecase to linux-mm@kvack.org if you "
3565 "depend on this functionality.\n");
3570 static unsigned long mem_cgroup_usage(struct mem_cgroup *memcg, bool swap)
3574 if (mem_cgroup_is_root(memcg)) {
3575 mem_cgroup_flush_stats();
3576 val = memcg_page_state(memcg, NR_FILE_PAGES) +
3577 memcg_page_state(memcg, NR_ANON_MAPPED);
3579 val += memcg_page_state(memcg, MEMCG_SWAP);
3582 val = page_counter_read(&memcg->memory);
3584 val = page_counter_read(&memcg->memsw);
3597 static u64 mem_cgroup_read_u64(struct cgroup_subsys_state *css,
3600 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
3601 struct page_counter *counter;
3603 switch (MEMFILE_TYPE(cft->private)) {
3605 counter = &memcg->memory;
3608 counter = &memcg->memsw;
3611 counter = &memcg->kmem;
3614 counter = &memcg->tcpmem;
3620 switch (MEMFILE_ATTR(cft->private)) {
3622 if (counter == &memcg->memory)
3623 return (u64)mem_cgroup_usage(memcg, false) * PAGE_SIZE;
3624 if (counter == &memcg->memsw)
3625 return (u64)mem_cgroup_usage(memcg, true) * PAGE_SIZE;
3626 return (u64)page_counter_read(counter) * PAGE_SIZE;
3628 return (u64)counter->max * PAGE_SIZE;
3630 return (u64)counter->watermark * PAGE_SIZE;
3632 return counter->failcnt;
3633 case RES_SOFT_LIMIT:
3634 return (u64)memcg->soft_limit * PAGE_SIZE;
3640 #ifdef CONFIG_MEMCG_KMEM
3641 static int memcg_online_kmem(struct mem_cgroup *memcg)
3643 struct obj_cgroup *objcg;
3646 if (cgroup_memory_nokmem)
3649 BUG_ON(memcg->kmemcg_id >= 0);
3650 BUG_ON(memcg->kmem_state);
3652 memcg_id = memcg_alloc_cache_id();
3656 objcg = obj_cgroup_alloc();
3658 memcg_free_cache_id(memcg_id);
3661 objcg->memcg = memcg;
3662 rcu_assign_pointer(memcg->objcg, objcg);
3664 static_branch_enable(&memcg_kmem_enabled_key);
3666 memcg->kmemcg_id = memcg_id;
3667 memcg->kmem_state = KMEM_ONLINE;
3672 static void memcg_offline_kmem(struct mem_cgroup *memcg)
3674 struct cgroup_subsys_state *css;
3675 struct mem_cgroup *parent, *child;
3678 if (memcg->kmem_state != KMEM_ONLINE)
3681 memcg->kmem_state = KMEM_ALLOCATED;
3683 parent = parent_mem_cgroup(memcg);
3685 parent = root_mem_cgroup;
3687 memcg_reparent_objcgs(memcg, parent);
3689 kmemcg_id = memcg->kmemcg_id;
3690 BUG_ON(kmemcg_id < 0);
3693 * Change kmemcg_id of this cgroup and all its descendants to the
3694 * parent's id, and then move all entries from this cgroup's list_lrus
3695 * to ones of the parent. After we have finished, all list_lrus
3696 * corresponding to this cgroup are guaranteed to remain empty. The
3697 * ordering is imposed by list_lru_node->lock taken by
3698 * memcg_drain_all_list_lrus().
3700 rcu_read_lock(); /* can be called from css_free w/o cgroup_mutex */
3701 css_for_each_descendant_pre(css, &memcg->css) {
3702 child = mem_cgroup_from_css(css);
3703 BUG_ON(child->kmemcg_id != kmemcg_id);
3704 child->kmemcg_id = parent->kmemcg_id;
3708 memcg_drain_all_list_lrus(kmemcg_id, parent);
3710 memcg_free_cache_id(kmemcg_id);
3713 static void memcg_free_kmem(struct mem_cgroup *memcg)
3715 /* css_alloc() failed, offlining didn't happen */
3716 if (unlikely(memcg->kmem_state == KMEM_ONLINE))
3717 memcg_offline_kmem(memcg);
3720 static int memcg_online_kmem(struct mem_cgroup *memcg)
3724 static void memcg_offline_kmem(struct mem_cgroup *memcg)
3727 static void memcg_free_kmem(struct mem_cgroup *memcg)
3730 #endif /* CONFIG_MEMCG_KMEM */
3732 static int memcg_update_kmem_max(struct mem_cgroup *memcg,
3737 mutex_lock(&memcg_max_mutex);
3738 ret = page_counter_set_max(&memcg->kmem, max);
3739 mutex_unlock(&memcg_max_mutex);
3743 static int memcg_update_tcp_max(struct mem_cgroup *memcg, unsigned long max)
3747 mutex_lock(&memcg_max_mutex);
3749 ret = page_counter_set_max(&memcg->tcpmem, max);
3753 if (!memcg->tcpmem_active) {
3755 * The active flag needs to be written after the static_key
3756 * update. This is what guarantees that the socket activation
3757 * function is the last one to run. See mem_cgroup_sk_alloc()
3758 * for details, and note that we don't mark any socket as
3759 * belonging to this memcg until that flag is up.
3761 * We need to do this, because static_keys will span multiple
3762 * sites, but we can't control their order. If we mark a socket
3763 * as accounted, but the accounting functions are not patched in
3764 * yet, we'll lose accounting.
3766 * We never race with the readers in mem_cgroup_sk_alloc(),
3767 * because when this value change, the code to process it is not
3770 static_branch_inc(&memcg_sockets_enabled_key);
3771 memcg->tcpmem_active = true;
3774 mutex_unlock(&memcg_max_mutex);
3779 * The user of this function is...
3782 static ssize_t mem_cgroup_write(struct kernfs_open_file *of,
3783 char *buf, size_t nbytes, loff_t off)
3785 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
3786 unsigned long nr_pages;
3789 buf = strstrip(buf);
3790 ret = page_counter_memparse(buf, "-1", &nr_pages);
3794 switch (MEMFILE_ATTR(of_cft(of)->private)) {
3796 if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */
3800 switch (MEMFILE_TYPE(of_cft(of)->private)) {
3802 ret = mem_cgroup_resize_max(memcg, nr_pages, false);
3805 ret = mem_cgroup_resize_max(memcg, nr_pages, true);
3808 pr_warn_once("kmem.limit_in_bytes is deprecated and will be removed. "
3809 "Please report your usecase to linux-mm@kvack.org if you "
3810 "depend on this functionality.\n");
3811 ret = memcg_update_kmem_max(memcg, nr_pages);
3814 ret = memcg_update_tcp_max(memcg, nr_pages);
3818 case RES_SOFT_LIMIT:
3819 memcg->soft_limit = nr_pages;
3823 return ret ?: nbytes;
3826 static ssize_t mem_cgroup_reset(struct kernfs_open_file *of, char *buf,
3827 size_t nbytes, loff_t off)
3829 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
3830 struct page_counter *counter;
3832 switch (MEMFILE_TYPE(of_cft(of)->private)) {
3834 counter = &memcg->memory;
3837 counter = &memcg->memsw;
3840 counter = &memcg->kmem;
3843 counter = &memcg->tcpmem;
3849 switch (MEMFILE_ATTR(of_cft(of)->private)) {
3851 page_counter_reset_watermark(counter);
3854 counter->failcnt = 0;
3863 static u64 mem_cgroup_move_charge_read(struct cgroup_subsys_state *css,
3866 return mem_cgroup_from_css(css)->move_charge_at_immigrate;
3870 static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css,
3871 struct cftype *cft, u64 val)
3873 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
3875 if (val & ~MOVE_MASK)
3879 * No kind of locking is needed in here, because ->can_attach() will
3880 * check this value once in the beginning of the process, and then carry
3881 * on with stale data. This means that changes to this value will only
3882 * affect task migrations starting after the change.
3884 memcg->move_charge_at_immigrate = val;
3888 static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css,
3889 struct cftype *cft, u64 val)
3897 #define LRU_ALL_FILE (BIT(LRU_INACTIVE_FILE) | BIT(LRU_ACTIVE_FILE))
3898 #define LRU_ALL_ANON (BIT(LRU_INACTIVE_ANON) | BIT(LRU_ACTIVE_ANON))
3899 #define LRU_ALL ((1 << NR_LRU_LISTS) - 1)
3901 static unsigned long mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg,
3902 int nid, unsigned int lru_mask, bool tree)
3904 struct lruvec *lruvec = mem_cgroup_lruvec(memcg, NODE_DATA(nid));
3905 unsigned long nr = 0;
3908 VM_BUG_ON((unsigned)nid >= nr_node_ids);
3911 if (!(BIT(lru) & lru_mask))
3914 nr += lruvec_page_state(lruvec, NR_LRU_BASE + lru);
3916 nr += lruvec_page_state_local(lruvec, NR_LRU_BASE + lru);
3921 static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg,
3922 unsigned int lru_mask,
3925 unsigned long nr = 0;
3929 if (!(BIT(lru) & lru_mask))
3932 nr += memcg_page_state(memcg, NR_LRU_BASE + lru);
3934 nr += memcg_page_state_local(memcg, NR_LRU_BASE + lru);
3939 static int memcg_numa_stat_show(struct seq_file *m, void *v)
3943 unsigned int lru_mask;
3946 static const struct numa_stat stats[] = {
3947 { "total", LRU_ALL },
3948 { "file", LRU_ALL_FILE },
3949 { "anon", LRU_ALL_ANON },
3950 { "unevictable", BIT(LRU_UNEVICTABLE) },
3952 const struct numa_stat *stat;
3954 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
3956 mem_cgroup_flush_stats();
3958 for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) {
3959 seq_printf(m, "%s=%lu", stat->name,
3960 mem_cgroup_nr_lru_pages(memcg, stat->lru_mask,
3962 for_each_node_state(nid, N_MEMORY)
3963 seq_printf(m, " N%d=%lu", nid,
3964 mem_cgroup_node_nr_lru_pages(memcg, nid,
3965 stat->lru_mask, false));
3969 for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) {
3971 seq_printf(m, "hierarchical_%s=%lu", stat->name,
3972 mem_cgroup_nr_lru_pages(memcg, stat->lru_mask,
3974 for_each_node_state(nid, N_MEMORY)
3975 seq_printf(m, " N%d=%lu", nid,
3976 mem_cgroup_node_nr_lru_pages(memcg, nid,
3977 stat->lru_mask, true));
3983 #endif /* CONFIG_NUMA */
3985 static const unsigned int memcg1_stats[] = {
3988 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
3998 static const char *const memcg1_stat_names[] = {
4001 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4011 /* Universal VM events cgroup1 shows, original sort order */
4012 static const unsigned int memcg1_events[] = {
4019 static int memcg_stat_show(struct seq_file *m, void *v)
4021 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
4022 unsigned long memory, memsw;
4023 struct mem_cgroup *mi;
4026 BUILD_BUG_ON(ARRAY_SIZE(memcg1_stat_names) != ARRAY_SIZE(memcg1_stats));
4028 mem_cgroup_flush_stats();
4030 for (i = 0; i < ARRAY_SIZE(memcg1_stats); i++) {
4033 if (memcg1_stats[i] == MEMCG_SWAP && !do_memsw_account())
4035 nr = memcg_page_state_local(memcg, memcg1_stats[i]);
4036 seq_printf(m, "%s %lu\n", memcg1_stat_names[i], nr * PAGE_SIZE);
4039 for (i = 0; i < ARRAY_SIZE(memcg1_events); i++)
4040 seq_printf(m, "%s %lu\n", vm_event_name(memcg1_events[i]),
4041 memcg_events_local(memcg, memcg1_events[i]));
4043 for (i = 0; i < NR_LRU_LISTS; i++)
4044 seq_printf(m, "%s %lu\n", lru_list_name(i),
4045 memcg_page_state_local(memcg, NR_LRU_BASE + i) *
4048 /* Hierarchical information */
4049 memory = memsw = PAGE_COUNTER_MAX;
4050 for (mi = memcg; mi; mi = parent_mem_cgroup(mi)) {
4051 memory = min(memory, READ_ONCE(mi->memory.max));
4052 memsw = min(memsw, READ_ONCE(mi->memsw.max));
4054 seq_printf(m, "hierarchical_memory_limit %llu\n",
4055 (u64)memory * PAGE_SIZE);
4056 if (do_memsw_account())
4057 seq_printf(m, "hierarchical_memsw_limit %llu\n",
4058 (u64)memsw * PAGE_SIZE);
4060 for (i = 0; i < ARRAY_SIZE(memcg1_stats); i++) {
4063 if (memcg1_stats[i] == MEMCG_SWAP && !do_memsw_account())
4065 nr = memcg_page_state(memcg, memcg1_stats[i]);
4066 seq_printf(m, "total_%s %llu\n", memcg1_stat_names[i],
4067 (u64)nr * PAGE_SIZE);
4070 for (i = 0; i < ARRAY_SIZE(memcg1_events); i++)
4071 seq_printf(m, "total_%s %llu\n",
4072 vm_event_name(memcg1_events[i]),
4073 (u64)memcg_events(memcg, memcg1_events[i]));
4075 for (i = 0; i < NR_LRU_LISTS; i++)
4076 seq_printf(m, "total_%s %llu\n", lru_list_name(i),
4077 (u64)memcg_page_state(memcg, NR_LRU_BASE + i) *
4080 #ifdef CONFIG_DEBUG_VM
4083 struct mem_cgroup_per_node *mz;
4084 unsigned long anon_cost = 0;
4085 unsigned long file_cost = 0;
4087 for_each_online_pgdat(pgdat) {
4088 mz = memcg->nodeinfo[pgdat->node_id];
4090 anon_cost += mz->lruvec.anon_cost;
4091 file_cost += mz->lruvec.file_cost;
4093 seq_printf(m, "anon_cost %lu\n", anon_cost);
4094 seq_printf(m, "file_cost %lu\n", file_cost);
4101 static u64 mem_cgroup_swappiness_read(struct cgroup_subsys_state *css,
4104 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4106 return mem_cgroup_swappiness(memcg);
4109 static int mem_cgroup_swappiness_write(struct cgroup_subsys_state *css,
4110 struct cftype *cft, u64 val)
4112 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4117 if (!mem_cgroup_is_root(memcg))
4118 memcg->swappiness = val;
4120 vm_swappiness = val;
4125 static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap)
4127 struct mem_cgroup_threshold_ary *t;
4128 unsigned long usage;
4133 t = rcu_dereference(memcg->thresholds.primary);
4135 t = rcu_dereference(memcg->memsw_thresholds.primary);
4140 usage = mem_cgroup_usage(memcg, swap);
4143 * current_threshold points to threshold just below or equal to usage.
4144 * If it's not true, a threshold was crossed after last
4145 * call of __mem_cgroup_threshold().
4147 i = t->current_threshold;
4150 * Iterate backward over array of thresholds starting from
4151 * current_threshold and check if a threshold is crossed.
4152 * If none of thresholds below usage is crossed, we read
4153 * only one element of the array here.
4155 for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)
4156 eventfd_signal(t->entries[i].eventfd, 1);
4158 /* i = current_threshold + 1 */
4162 * Iterate forward over array of thresholds starting from
4163 * current_threshold+1 and check if a threshold is crossed.
4164 * If none of thresholds above usage is crossed, we read
4165 * only one element of the array here.
4167 for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)
4168 eventfd_signal(t->entries[i].eventfd, 1);
4170 /* Update current_threshold */
4171 t->current_threshold = i - 1;
4176 static void mem_cgroup_threshold(struct mem_cgroup *memcg)
4179 __mem_cgroup_threshold(memcg, false);
4180 if (do_memsw_account())
4181 __mem_cgroup_threshold(memcg, true);
4183 memcg = parent_mem_cgroup(memcg);
4187 static int compare_thresholds(const void *a, const void *b)
4189 const struct mem_cgroup_threshold *_a = a;
4190 const struct mem_cgroup_threshold *_b = b;
4192 if (_a->threshold > _b->threshold)
4195 if (_a->threshold < _b->threshold)
4201 static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg)
4203 struct mem_cgroup_eventfd_list *ev;
4205 spin_lock(&memcg_oom_lock);
4207 list_for_each_entry(ev, &memcg->oom_notify, list)
4208 eventfd_signal(ev->eventfd, 1);
4210 spin_unlock(&memcg_oom_lock);
4214 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg)
4216 struct mem_cgroup *iter;
4218 for_each_mem_cgroup_tree(iter, memcg)
4219 mem_cgroup_oom_notify_cb(iter);
4222 static int __mem_cgroup_usage_register_event(struct mem_cgroup *memcg,
4223 struct eventfd_ctx *eventfd, const char *args, enum res_type type)
4225 struct mem_cgroup_thresholds *thresholds;
4226 struct mem_cgroup_threshold_ary *new;
4227 unsigned long threshold;
4228 unsigned long usage;
4231 ret = page_counter_memparse(args, "-1", &threshold);
4235 mutex_lock(&memcg->thresholds_lock);
4238 thresholds = &memcg->thresholds;
4239 usage = mem_cgroup_usage(memcg, false);
4240 } else if (type == _MEMSWAP) {
4241 thresholds = &memcg->memsw_thresholds;
4242 usage = mem_cgroup_usage(memcg, true);
4246 /* Check if a threshold crossed before adding a new one */
4247 if (thresholds->primary)
4248 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
4250 size = thresholds->primary ? thresholds->primary->size + 1 : 1;
4252 /* Allocate memory for new array of thresholds */
4253 new = kmalloc(struct_size(new, entries, size), GFP_KERNEL);
4260 /* Copy thresholds (if any) to new array */
4261 if (thresholds->primary)
4262 memcpy(new->entries, thresholds->primary->entries,
4263 flex_array_size(new, entries, size - 1));
4265 /* Add new threshold */
4266 new->entries[size - 1].eventfd = eventfd;
4267 new->entries[size - 1].threshold = threshold;
4269 /* Sort thresholds. Registering of new threshold isn't time-critical */
4270 sort(new->entries, size, sizeof(*new->entries),
4271 compare_thresholds, NULL);
4273 /* Find current threshold */
4274 new->current_threshold = -1;
4275 for (i = 0; i < size; i++) {
4276 if (new->entries[i].threshold <= usage) {
4278 * new->current_threshold will not be used until
4279 * rcu_assign_pointer(), so it's safe to increment
4282 ++new->current_threshold;
4287 /* Free old spare buffer and save old primary buffer as spare */
4288 kfree(thresholds->spare);
4289 thresholds->spare = thresholds->primary;
4291 rcu_assign_pointer(thresholds->primary, new);
4293 /* To be sure that nobody uses thresholds */
4297 mutex_unlock(&memcg->thresholds_lock);
4302 static int mem_cgroup_usage_register_event(struct mem_cgroup *memcg,
4303 struct eventfd_ctx *eventfd, const char *args)
4305 return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEM);
4308 static int memsw_cgroup_usage_register_event(struct mem_cgroup *memcg,
4309 struct eventfd_ctx *eventfd, const char *args)
4311 return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEMSWAP);
4314 static void __mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
4315 struct eventfd_ctx *eventfd, enum res_type type)
4317 struct mem_cgroup_thresholds *thresholds;
4318 struct mem_cgroup_threshold_ary *new;
4319 unsigned long usage;
4320 int i, j, size, entries;
4322 mutex_lock(&memcg->thresholds_lock);
4325 thresholds = &memcg->thresholds;
4326 usage = mem_cgroup_usage(memcg, false);
4327 } else if (type == _MEMSWAP) {
4328 thresholds = &memcg->memsw_thresholds;
4329 usage = mem_cgroup_usage(memcg, true);
4333 if (!thresholds->primary)
4336 /* Check if a threshold crossed before removing */
4337 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
4339 /* Calculate new number of threshold */
4341 for (i = 0; i < thresholds->primary->size; i++) {
4342 if (thresholds->primary->entries[i].eventfd != eventfd)
4348 new = thresholds->spare;
4350 /* If no items related to eventfd have been cleared, nothing to do */
4354 /* Set thresholds array to NULL if we don't have thresholds */
4363 /* Copy thresholds and find current threshold */
4364 new->current_threshold = -1;
4365 for (i = 0, j = 0; i < thresholds->primary->size; i++) {
4366 if (thresholds->primary->entries[i].eventfd == eventfd)
4369 new->entries[j] = thresholds->primary->entries[i];
4370 if (new->entries[j].threshold <= usage) {
4372 * new->current_threshold will not be used
4373 * until rcu_assign_pointer(), so it's safe to increment
4376 ++new->current_threshold;
4382 /* Swap primary and spare array */
4383 thresholds->spare = thresholds->primary;
4385 rcu_assign_pointer(thresholds->primary, new);
4387 /* To be sure that nobody uses thresholds */
4390 /* If all events are unregistered, free the spare array */
4392 kfree(thresholds->spare);
4393 thresholds->spare = NULL;
4396 mutex_unlock(&memcg->thresholds_lock);
4399 static void mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
4400 struct eventfd_ctx *eventfd)
4402 return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEM);
4405 static void memsw_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
4406 struct eventfd_ctx *eventfd)
4408 return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEMSWAP);
4411 static int mem_cgroup_oom_register_event(struct mem_cgroup *memcg,
4412 struct eventfd_ctx *eventfd, const char *args)
4414 struct mem_cgroup_eventfd_list *event;
4416 event = kmalloc(sizeof(*event), GFP_KERNEL);
4420 spin_lock(&memcg_oom_lock);
4422 event->eventfd = eventfd;
4423 list_add(&event->list, &memcg->oom_notify);
4425 /* already in OOM ? */
4426 if (memcg->under_oom)
4427 eventfd_signal(eventfd, 1);
4428 spin_unlock(&memcg_oom_lock);
4433 static void mem_cgroup_oom_unregister_event(struct mem_cgroup *memcg,
4434 struct eventfd_ctx *eventfd)
4436 struct mem_cgroup_eventfd_list *ev, *tmp;
4438 spin_lock(&memcg_oom_lock);
4440 list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) {
4441 if (ev->eventfd == eventfd) {
4442 list_del(&ev->list);
4447 spin_unlock(&memcg_oom_lock);
4450 static int mem_cgroup_oom_control_read(struct seq_file *sf, void *v)
4452 struct mem_cgroup *memcg = mem_cgroup_from_seq(sf);
4454 seq_printf(sf, "oom_kill_disable %d\n", memcg->oom_kill_disable);
4455 seq_printf(sf, "under_oom %d\n", (bool)memcg->under_oom);
4456 seq_printf(sf, "oom_kill %lu\n",
4457 atomic_long_read(&memcg->memory_events[MEMCG_OOM_KILL]));
4461 static int mem_cgroup_oom_control_write(struct cgroup_subsys_state *css,
4462 struct cftype *cft, u64 val)
4464 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4466 /* cannot set to root cgroup and only 0 and 1 are allowed */
4467 if (mem_cgroup_is_root(memcg) || !((val == 0) || (val == 1)))
4470 memcg->oom_kill_disable = val;
4472 memcg_oom_recover(memcg);
4477 #ifdef CONFIG_CGROUP_WRITEBACK
4479 #include <trace/events/writeback.h>
4481 static int memcg_wb_domain_init(struct mem_cgroup *memcg, gfp_t gfp)
4483 return wb_domain_init(&memcg->cgwb_domain, gfp);
4486 static void memcg_wb_domain_exit(struct mem_cgroup *memcg)
4488 wb_domain_exit(&memcg->cgwb_domain);
4491 static void memcg_wb_domain_size_changed(struct mem_cgroup *memcg)
4493 wb_domain_size_changed(&memcg->cgwb_domain);
4496 struct wb_domain *mem_cgroup_wb_domain(struct bdi_writeback *wb)
4498 struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css);
4500 if (!memcg->css.parent)
4503 return &memcg->cgwb_domain;
4507 * mem_cgroup_wb_stats - retrieve writeback related stats from its memcg
4508 * @wb: bdi_writeback in question
4509 * @pfilepages: out parameter for number of file pages
4510 * @pheadroom: out parameter for number of allocatable pages according to memcg
4511 * @pdirty: out parameter for number of dirty pages
4512 * @pwriteback: out parameter for number of pages under writeback
4514 * Determine the numbers of file, headroom, dirty, and writeback pages in
4515 * @wb's memcg. File, dirty and writeback are self-explanatory. Headroom
4516 * is a bit more involved.
4518 * A memcg's headroom is "min(max, high) - used". In the hierarchy, the
4519 * headroom is calculated as the lowest headroom of itself and the
4520 * ancestors. Note that this doesn't consider the actual amount of
4521 * available memory in the system. The caller should further cap
4522 * *@pheadroom accordingly.
4524 void mem_cgroup_wb_stats(struct bdi_writeback *wb, unsigned long *pfilepages,
4525 unsigned long *pheadroom, unsigned long *pdirty,
4526 unsigned long *pwriteback)
4528 struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css);
4529 struct mem_cgroup *parent;
4531 mem_cgroup_flush_stats();
4533 *pdirty = memcg_page_state(memcg, NR_FILE_DIRTY);
4534 *pwriteback = memcg_page_state(memcg, NR_WRITEBACK);
4535 *pfilepages = memcg_page_state(memcg, NR_INACTIVE_FILE) +
4536 memcg_page_state(memcg, NR_ACTIVE_FILE);
4538 *pheadroom = PAGE_COUNTER_MAX;
4539 while ((parent = parent_mem_cgroup(memcg))) {
4540 unsigned long ceiling = min(READ_ONCE(memcg->memory.max),
4541 READ_ONCE(memcg->memory.high));
4542 unsigned long used = page_counter_read(&memcg->memory);
4544 *pheadroom = min(*pheadroom, ceiling - min(ceiling, used));
4550 * Foreign dirty flushing
4552 * There's an inherent mismatch between memcg and writeback. The former
4553 * tracks ownership per-page while the latter per-inode. This was a
4554 * deliberate design decision because honoring per-page ownership in the
4555 * writeback path is complicated, may lead to higher CPU and IO overheads
4556 * and deemed unnecessary given that write-sharing an inode across
4557 * different cgroups isn't a common use-case.
4559 * Combined with inode majority-writer ownership switching, this works well
4560 * enough in most cases but there are some pathological cases. For
4561 * example, let's say there are two cgroups A and B which keep writing to
4562 * different but confined parts of the same inode. B owns the inode and
4563 * A's memory is limited far below B's. A's dirty ratio can rise enough to
4564 * trigger balance_dirty_pages() sleeps but B's can be low enough to avoid
4565 * triggering background writeback. A will be slowed down without a way to
4566 * make writeback of the dirty pages happen.
4568 * Conditions like the above can lead to a cgroup getting repeatedly and
4569 * severely throttled after making some progress after each
4570 * dirty_expire_interval while the underlying IO device is almost
4573 * Solving this problem completely requires matching the ownership tracking
4574 * granularities between memcg and writeback in either direction. However,
4575 * the more egregious behaviors can be avoided by simply remembering the
4576 * most recent foreign dirtying events and initiating remote flushes on
4577 * them when local writeback isn't enough to keep the memory clean enough.
4579 * The following two functions implement such mechanism. When a foreign
4580 * page - a page whose memcg and writeback ownerships don't match - is
4581 * dirtied, mem_cgroup_track_foreign_dirty() records the inode owning
4582 * bdi_writeback on the page owning memcg. When balance_dirty_pages()
4583 * decides that the memcg needs to sleep due to high dirty ratio, it calls
4584 * mem_cgroup_flush_foreign() which queues writeback on the recorded
4585 * foreign bdi_writebacks which haven't expired. Both the numbers of
4586 * recorded bdi_writebacks and concurrent in-flight foreign writebacks are
4587 * limited to MEMCG_CGWB_FRN_CNT.
4589 * The mechanism only remembers IDs and doesn't hold any object references.
4590 * As being wrong occasionally doesn't matter, updates and accesses to the
4591 * records are lockless and racy.
4593 void mem_cgroup_track_foreign_dirty_slowpath(struct page *page,
4594 struct bdi_writeback *wb)
4596 struct mem_cgroup *memcg = page_memcg(page);
4597 struct memcg_cgwb_frn *frn;
4598 u64 now = get_jiffies_64();
4599 u64 oldest_at = now;
4603 trace_track_foreign_dirty(page, wb);
4606 * Pick the slot to use. If there is already a slot for @wb, keep
4607 * using it. If not replace the oldest one which isn't being
4610 for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++) {
4611 frn = &memcg->cgwb_frn[i];
4612 if (frn->bdi_id == wb->bdi->id &&
4613 frn->memcg_id == wb->memcg_css->id)
4615 if (time_before64(frn->at, oldest_at) &&
4616 atomic_read(&frn->done.cnt) == 1) {
4618 oldest_at = frn->at;
4622 if (i < MEMCG_CGWB_FRN_CNT) {
4624 * Re-using an existing one. Update timestamp lazily to
4625 * avoid making the cacheline hot. We want them to be
4626 * reasonably up-to-date and significantly shorter than
4627 * dirty_expire_interval as that's what expires the record.
4628 * Use the shorter of 1s and dirty_expire_interval / 8.
4630 unsigned long update_intv =
4631 min_t(unsigned long, HZ,
4632 msecs_to_jiffies(dirty_expire_interval * 10) / 8);
4634 if (time_before64(frn->at, now - update_intv))
4636 } else if (oldest >= 0) {
4637 /* replace the oldest free one */
4638 frn = &memcg->cgwb_frn[oldest];
4639 frn->bdi_id = wb->bdi->id;
4640 frn->memcg_id = wb->memcg_css->id;
4645 /* issue foreign writeback flushes for recorded foreign dirtying events */
4646 void mem_cgroup_flush_foreign(struct bdi_writeback *wb)
4648 struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css);
4649 unsigned long intv = msecs_to_jiffies(dirty_expire_interval * 10);
4650 u64 now = jiffies_64;
4653 for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++) {
4654 struct memcg_cgwb_frn *frn = &memcg->cgwb_frn[i];
4657 * If the record is older than dirty_expire_interval,
4658 * writeback on it has already started. No need to kick it
4659 * off again. Also, don't start a new one if there's
4660 * already one in flight.
4662 if (time_after64(frn->at, now - intv) &&
4663 atomic_read(&frn->done.cnt) == 1) {
4665 trace_flush_foreign(wb, frn->bdi_id, frn->memcg_id);
4666 cgroup_writeback_by_id(frn->bdi_id, frn->memcg_id,
4667 WB_REASON_FOREIGN_FLUSH,
4673 #else /* CONFIG_CGROUP_WRITEBACK */
4675 static int memcg_wb_domain_init(struct mem_cgroup *memcg, gfp_t gfp)
4680 static void memcg_wb_domain_exit(struct mem_cgroup *memcg)
4684 static void memcg_wb_domain_size_changed(struct mem_cgroup *memcg)
4688 #endif /* CONFIG_CGROUP_WRITEBACK */
4691 * DO NOT USE IN NEW FILES.
4693 * "cgroup.event_control" implementation.
4695 * This is way over-engineered. It tries to support fully configurable
4696 * events for each user. Such level of flexibility is completely
4697 * unnecessary especially in the light of the planned unified hierarchy.
4699 * Please deprecate this and replace with something simpler if at all
4704 * Unregister event and free resources.
4706 * Gets called from workqueue.
4708 static void memcg_event_remove(struct work_struct *work)
4710 struct mem_cgroup_event *event =
4711 container_of(work, struct mem_cgroup_event, remove);
4712 struct mem_cgroup *memcg = event->memcg;
4714 remove_wait_queue(event->wqh, &event->wait);
4716 event->unregister_event(memcg, event->eventfd);
4718 /* Notify userspace the event is going away. */
4719 eventfd_signal(event->eventfd, 1);
4721 eventfd_ctx_put(event->eventfd);
4723 css_put(&memcg->css);
4727 * Gets called on EPOLLHUP on eventfd when user closes it.
4729 * Called with wqh->lock held and interrupts disabled.
4731 static int memcg_event_wake(wait_queue_entry_t *wait, unsigned mode,
4732 int sync, void *key)
4734 struct mem_cgroup_event *event =
4735 container_of(wait, struct mem_cgroup_event, wait);
4736 struct mem_cgroup *memcg = event->memcg;
4737 __poll_t flags = key_to_poll(key);
4739 if (flags & EPOLLHUP) {
4741 * If the event has been detached at cgroup removal, we
4742 * can simply return knowing the other side will cleanup
4745 * We can't race against event freeing since the other
4746 * side will require wqh->lock via remove_wait_queue(),
4749 spin_lock(&memcg->event_list_lock);
4750 if (!list_empty(&event->list)) {
4751 list_del_init(&event->list);
4753 * We are in atomic context, but cgroup_event_remove()
4754 * may sleep, so we have to call it in workqueue.
4756 schedule_work(&event->remove);
4758 spin_unlock(&memcg->event_list_lock);
4764 static void memcg_event_ptable_queue_proc(struct file *file,
4765 wait_queue_head_t *wqh, poll_table *pt)
4767 struct mem_cgroup_event *event =
4768 container_of(pt, struct mem_cgroup_event, pt);
4771 add_wait_queue(wqh, &event->wait);
4775 * DO NOT USE IN NEW FILES.
4777 * Parse input and register new cgroup event handler.
4779 * Input must be in format '<event_fd> <control_fd> <args>'.
4780 * Interpretation of args is defined by control file implementation.
4782 static ssize_t memcg_write_event_control(struct kernfs_open_file *of,
4783 char *buf, size_t nbytes, loff_t off)
4785 struct cgroup_subsys_state *css = of_css(of);
4786 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4787 struct mem_cgroup_event *event;
4788 struct cgroup_subsys_state *cfile_css;
4789 unsigned int efd, cfd;
4792 struct dentry *cdentry;
4797 buf = strstrip(buf);
4799 efd = simple_strtoul(buf, &endp, 10);
4804 cfd = simple_strtoul(buf, &endp, 10);
4805 if ((*endp != ' ') && (*endp != '\0'))
4809 event = kzalloc(sizeof(*event), GFP_KERNEL);
4813 event->memcg = memcg;
4814 INIT_LIST_HEAD(&event->list);
4815 init_poll_funcptr(&event->pt, memcg_event_ptable_queue_proc);
4816 init_waitqueue_func_entry(&event->wait, memcg_event_wake);
4817 INIT_WORK(&event->remove, memcg_event_remove);
4825 event->eventfd = eventfd_ctx_fileget(efile.file);
4826 if (IS_ERR(event->eventfd)) {
4827 ret = PTR_ERR(event->eventfd);
4834 goto out_put_eventfd;
4837 /* the process need read permission on control file */
4838 /* AV: shouldn't we check that it's been opened for read instead? */
4839 ret = file_permission(cfile.file, MAY_READ);
4844 * The control file must be a regular cgroup1 file. As a regular cgroup
4845 * file can't be renamed, it's safe to access its name afterwards.
4847 cdentry = cfile.file->f_path.dentry;
4848 if (cdentry->d_sb->s_type != &cgroup_fs_type || !d_is_reg(cdentry)) {
4854 * Determine the event callbacks and set them in @event. This used
4855 * to be done via struct cftype but cgroup core no longer knows
4856 * about these events. The following is crude but the whole thing
4857 * is for compatibility anyway.
4859 * DO NOT ADD NEW FILES.
4861 name = cdentry->d_name.name;
4863 if (!strcmp(name, "memory.usage_in_bytes")) {
4864 event->register_event = mem_cgroup_usage_register_event;
4865 event->unregister_event = mem_cgroup_usage_unregister_event;
4866 } else if (!strcmp(name, "memory.oom_control")) {
4867 event->register_event = mem_cgroup_oom_register_event;
4868 event->unregister_event = mem_cgroup_oom_unregister_event;
4869 } else if (!strcmp(name, "memory.pressure_level")) {
4870 event->register_event = vmpressure_register_event;
4871 event->unregister_event = vmpressure_unregister_event;
4872 } else if (!strcmp(name, "memory.memsw.usage_in_bytes")) {
4873 event->register_event = memsw_cgroup_usage_register_event;
4874 event->unregister_event = memsw_cgroup_usage_unregister_event;
4881 * Verify @cfile should belong to @css. Also, remaining events are
4882 * automatically removed on cgroup destruction but the removal is
4883 * asynchronous, so take an extra ref on @css.
4885 cfile_css = css_tryget_online_from_dir(cdentry->d_parent,
4886 &memory_cgrp_subsys);
4888 if (IS_ERR(cfile_css))
4890 if (cfile_css != css) {
4895 ret = event->register_event(memcg, event->eventfd, buf);
4899 vfs_poll(efile.file, &event->pt);
4901 spin_lock_irq(&memcg->event_list_lock);
4902 list_add(&event->list, &memcg->event_list);
4903 spin_unlock_irq(&memcg->event_list_lock);
4915 eventfd_ctx_put(event->eventfd);
4924 static struct cftype mem_cgroup_legacy_files[] = {
4926 .name = "usage_in_bytes",
4927 .private = MEMFILE_PRIVATE(_MEM, RES_USAGE),
4928 .read_u64 = mem_cgroup_read_u64,
4931 .name = "max_usage_in_bytes",
4932 .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE),
4933 .write = mem_cgroup_reset,
4934 .read_u64 = mem_cgroup_read_u64,
4937 .name = "limit_in_bytes",
4938 .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT),
4939 .write = mem_cgroup_write,
4940 .read_u64 = mem_cgroup_read_u64,
4943 .name = "soft_limit_in_bytes",
4944 .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT),
4945 .write = mem_cgroup_write,
4946 .read_u64 = mem_cgroup_read_u64,
4950 .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT),
4951 .write = mem_cgroup_reset,
4952 .read_u64 = mem_cgroup_read_u64,
4956 .seq_show = memcg_stat_show,
4959 .name = "force_empty",
4960 .write = mem_cgroup_force_empty_write,
4963 .name = "use_hierarchy",
4964 .write_u64 = mem_cgroup_hierarchy_write,
4965 .read_u64 = mem_cgroup_hierarchy_read,
4968 .name = "cgroup.event_control", /* XXX: for compat */
4969 .write = memcg_write_event_control,
4970 .flags = CFTYPE_NO_PREFIX | CFTYPE_WORLD_WRITABLE,
4973 .name = "swappiness",
4974 .read_u64 = mem_cgroup_swappiness_read,
4975 .write_u64 = mem_cgroup_swappiness_write,
4978 .name = "move_charge_at_immigrate",
4979 .read_u64 = mem_cgroup_move_charge_read,
4980 .write_u64 = mem_cgroup_move_charge_write,
4983 .name = "oom_control",
4984 .seq_show = mem_cgroup_oom_control_read,
4985 .write_u64 = mem_cgroup_oom_control_write,
4986 .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL),
4989 .name = "pressure_level",
4993 .name = "numa_stat",
4994 .seq_show = memcg_numa_stat_show,
4998 .name = "kmem.limit_in_bytes",
4999 .private = MEMFILE_PRIVATE(_KMEM, RES_LIMIT),
5000 .write = mem_cgroup_write,
5001 .read_u64 = mem_cgroup_read_u64,
5004 .name = "kmem.usage_in_bytes",
5005 .private = MEMFILE_PRIVATE(_KMEM, RES_USAGE),
5006 .read_u64 = mem_cgroup_read_u64,
5009 .name = "kmem.failcnt",
5010 .private = MEMFILE_PRIVATE(_KMEM, RES_FAILCNT),
5011 .write = mem_cgroup_reset,
5012 .read_u64 = mem_cgroup_read_u64,
5015 .name = "kmem.max_usage_in_bytes",
5016 .private = MEMFILE_PRIVATE(_KMEM, RES_MAX_USAGE),
5017 .write = mem_cgroup_reset,
5018 .read_u64 = mem_cgroup_read_u64,
5020 #if defined(CONFIG_MEMCG_KMEM) && \
5021 (defined(CONFIG_SLAB) || defined(CONFIG_SLUB_DEBUG))
5023 .name = "kmem.slabinfo",
5024 .seq_show = memcg_slab_show,
5028 .name = "kmem.tcp.limit_in_bytes",
5029 .private = MEMFILE_PRIVATE(_TCP, RES_LIMIT),
5030 .write = mem_cgroup_write,
5031 .read_u64 = mem_cgroup_read_u64,
5034 .name = "kmem.tcp.usage_in_bytes",
5035 .private = MEMFILE_PRIVATE(_TCP, RES_USAGE),
5036 .read_u64 = mem_cgroup_read_u64,
5039 .name = "kmem.tcp.failcnt",
5040 .private = MEMFILE_PRIVATE(_TCP, RES_FAILCNT),
5041 .write = mem_cgroup_reset,
5042 .read_u64 = mem_cgroup_read_u64,
5045 .name = "kmem.tcp.max_usage_in_bytes",
5046 .private = MEMFILE_PRIVATE(_TCP, RES_MAX_USAGE),
5047 .write = mem_cgroup_reset,
5048 .read_u64 = mem_cgroup_read_u64,
5050 { }, /* terminate */
5054 * Private memory cgroup IDR
5056 * Swap-out records and page cache shadow entries need to store memcg
5057 * references in constrained space, so we maintain an ID space that is
5058 * limited to 16 bit (MEM_CGROUP_ID_MAX), limiting the total number of
5059 * memory-controlled cgroups to 64k.
5061 * However, there usually are many references to the offline CSS after
5062 * the cgroup has been destroyed, such as page cache or reclaimable
5063 * slab objects, that don't need to hang on to the ID. We want to keep
5064 * those dead CSS from occupying IDs, or we might quickly exhaust the
5065 * relatively small ID space and prevent the creation of new cgroups
5066 * even when there are much fewer than 64k cgroups - possibly none.
5068 * Maintain a private 16-bit ID space for memcg, and allow the ID to
5069 * be freed and recycled when it's no longer needed, which is usually
5070 * when the CSS is offlined.
5072 * The only exception to that are records of swapped out tmpfs/shmem
5073 * pages that need to be attributed to live ancestors on swapin. But
5074 * those references are manageable from userspace.
5077 static DEFINE_IDR(mem_cgroup_idr);
5079 static void mem_cgroup_id_remove(struct mem_cgroup *memcg)
5081 if (memcg->id.id > 0) {
5082 idr_remove(&mem_cgroup_idr, memcg->id.id);
5087 static void __maybe_unused mem_cgroup_id_get_many(struct mem_cgroup *memcg,
5090 refcount_add(n, &memcg->id.ref);
5093 static void mem_cgroup_id_put_many(struct mem_cgroup *memcg, unsigned int n)
5095 if (refcount_sub_and_test(n, &memcg->id.ref)) {
5096 mem_cgroup_id_remove(memcg);
5098 /* Memcg ID pins CSS */
5099 css_put(&memcg->css);
5103 static inline void mem_cgroup_id_put(struct mem_cgroup *memcg)
5105 mem_cgroup_id_put_many(memcg, 1);
5109 * mem_cgroup_from_id - look up a memcg from a memcg id
5110 * @id: the memcg id to look up
5112 * Caller must hold rcu_read_lock().
5114 struct mem_cgroup *mem_cgroup_from_id(unsigned short id)
5116 WARN_ON_ONCE(!rcu_read_lock_held());
5117 return idr_find(&mem_cgroup_idr, id);
5120 static int alloc_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node)
5122 struct mem_cgroup_per_node *pn;
5125 * This routine is called against possible nodes.
5126 * But it's BUG to call kmalloc() against offline node.
5128 * TODO: this routine can waste much memory for nodes which will
5129 * never be onlined. It's better to use memory hotplug callback
5132 if (!node_state(node, N_NORMAL_MEMORY))
5134 pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp);
5138 pn->lruvec_stats_percpu = alloc_percpu_gfp(struct lruvec_stats_percpu,
5139 GFP_KERNEL_ACCOUNT);
5140 if (!pn->lruvec_stats_percpu) {
5145 lruvec_init(&pn->lruvec);
5146 pn->usage_in_excess = 0;
5147 pn->on_tree = false;
5150 memcg->nodeinfo[node] = pn;
5154 static void free_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node)
5156 struct mem_cgroup_per_node *pn = memcg->nodeinfo[node];
5161 free_percpu(pn->lruvec_stats_percpu);
5165 static void __mem_cgroup_free(struct mem_cgroup *memcg)
5170 free_mem_cgroup_per_node_info(memcg, node);
5171 free_percpu(memcg->vmstats_percpu);
5175 static void mem_cgroup_free(struct mem_cgroup *memcg)
5177 memcg_wb_domain_exit(memcg);
5178 __mem_cgroup_free(memcg);
5181 static struct mem_cgroup *mem_cgroup_alloc(void)
5183 struct mem_cgroup *memcg;
5186 int __maybe_unused i;
5187 long error = -ENOMEM;
5189 size = sizeof(struct mem_cgroup);
5190 size += nr_node_ids * sizeof(struct mem_cgroup_per_node *);
5192 memcg = kzalloc(size, GFP_KERNEL);
5194 return ERR_PTR(error);
5196 memcg->id.id = idr_alloc(&mem_cgroup_idr, NULL,
5197 1, MEM_CGROUP_ID_MAX,
5199 if (memcg->id.id < 0) {
5200 error = memcg->id.id;
5204 memcg->vmstats_percpu = alloc_percpu_gfp(struct memcg_vmstats_percpu,
5205 GFP_KERNEL_ACCOUNT);
5206 if (!memcg->vmstats_percpu)
5210 if (alloc_mem_cgroup_per_node_info(memcg, node))
5213 if (memcg_wb_domain_init(memcg, GFP_KERNEL))
5216 INIT_WORK(&memcg->high_work, high_work_func);
5217 INIT_LIST_HEAD(&memcg->oom_notify);
5218 mutex_init(&memcg->thresholds_lock);
5219 spin_lock_init(&memcg->move_lock);
5220 vmpressure_init(&memcg->vmpressure);
5221 INIT_LIST_HEAD(&memcg->event_list);
5222 spin_lock_init(&memcg->event_list_lock);
5223 memcg->socket_pressure = jiffies;
5224 #ifdef CONFIG_MEMCG_KMEM
5225 memcg->kmemcg_id = -1;
5226 INIT_LIST_HEAD(&memcg->objcg_list);
5228 #ifdef CONFIG_CGROUP_WRITEBACK
5229 INIT_LIST_HEAD(&memcg->cgwb_list);
5230 for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++)
5231 memcg->cgwb_frn[i].done =
5232 __WB_COMPLETION_INIT(&memcg_cgwb_frn_waitq);
5234 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5235 spin_lock_init(&memcg->deferred_split_queue.split_queue_lock);
5236 INIT_LIST_HEAD(&memcg->deferred_split_queue.split_queue);
5237 memcg->deferred_split_queue.split_queue_len = 0;
5239 idr_replace(&mem_cgroup_idr, memcg, memcg->id.id);
5242 mem_cgroup_id_remove(memcg);
5243 __mem_cgroup_free(memcg);
5244 return ERR_PTR(error);
5247 static struct cgroup_subsys_state * __ref
5248 mem_cgroup_css_alloc(struct cgroup_subsys_state *parent_css)
5250 struct mem_cgroup *parent = mem_cgroup_from_css(parent_css);
5251 struct mem_cgroup *memcg, *old_memcg;
5252 long error = -ENOMEM;
5254 old_memcg = set_active_memcg(parent);
5255 memcg = mem_cgroup_alloc();
5256 set_active_memcg(old_memcg);
5258 return ERR_CAST(memcg);
5260 page_counter_set_high(&memcg->memory, PAGE_COUNTER_MAX);
5261 memcg->soft_limit = PAGE_COUNTER_MAX;
5262 page_counter_set_high(&memcg->swap, PAGE_COUNTER_MAX);
5264 memcg->swappiness = mem_cgroup_swappiness(parent);
5265 memcg->oom_kill_disable = parent->oom_kill_disable;
5267 page_counter_init(&memcg->memory, &parent->memory);
5268 page_counter_init(&memcg->swap, &parent->swap);
5269 page_counter_init(&memcg->kmem, &parent->kmem);
5270 page_counter_init(&memcg->tcpmem, &parent->tcpmem);
5272 page_counter_init(&memcg->memory, NULL);
5273 page_counter_init(&memcg->swap, NULL);
5274 page_counter_init(&memcg->kmem, NULL);
5275 page_counter_init(&memcg->tcpmem, NULL);
5277 root_mem_cgroup = memcg;
5281 /* The following stuff does not apply to the root */
5282 error = memcg_online_kmem(memcg);
5286 if (cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_nosocket)
5287 static_branch_inc(&memcg_sockets_enabled_key);
5291 mem_cgroup_id_remove(memcg);
5292 mem_cgroup_free(memcg);
5293 return ERR_PTR(error);
5296 static int mem_cgroup_css_online(struct cgroup_subsys_state *css)
5298 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5301 * A memcg must be visible for expand_shrinker_info()
5302 * by the time the maps are allocated. So, we allocate maps
5303 * here, when for_each_mem_cgroup() can't skip it.
5305 if (alloc_shrinker_info(memcg)) {
5306 mem_cgroup_id_remove(memcg);
5310 /* Online state pins memcg ID, memcg ID pins CSS */
5311 refcount_set(&memcg->id.ref, 1);
5314 if (unlikely(mem_cgroup_is_root(memcg)))
5315 queue_delayed_work(system_unbound_wq, &stats_flush_dwork,
5320 static void mem_cgroup_css_offline(struct cgroup_subsys_state *css)
5322 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5323 struct mem_cgroup_event *event, *tmp;
5326 * Unregister events and notify userspace.
5327 * Notify userspace about cgroup removing only after rmdir of cgroup
5328 * directory to avoid race between userspace and kernelspace.
5330 spin_lock_irq(&memcg->event_list_lock);
5331 list_for_each_entry_safe(event, tmp, &memcg->event_list, list) {
5332 list_del_init(&event->list);
5333 schedule_work(&event->remove);
5335 spin_unlock_irq(&memcg->event_list_lock);
5337 page_counter_set_min(&memcg->memory, 0);
5338 page_counter_set_low(&memcg->memory, 0);
5340 memcg_offline_kmem(memcg);
5341 reparent_shrinker_deferred(memcg);
5342 wb_memcg_offline(memcg);
5344 drain_all_stock(memcg);
5346 mem_cgroup_id_put(memcg);
5349 static void mem_cgroup_css_released(struct cgroup_subsys_state *css)
5351 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5353 invalidate_reclaim_iterators(memcg);
5356 static void mem_cgroup_css_free(struct cgroup_subsys_state *css)
5358 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5359 int __maybe_unused i;
5361 #ifdef CONFIG_CGROUP_WRITEBACK
5362 for (i = 0; i < MEMCG_CGWB_FRN_CNT; i++)
5363 wb_wait_for_completion(&memcg->cgwb_frn[i].done);
5365 if (cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_nosocket)
5366 static_branch_dec(&memcg_sockets_enabled_key);
5368 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && memcg->tcpmem_active)
5369 static_branch_dec(&memcg_sockets_enabled_key);
5371 vmpressure_cleanup(&memcg->vmpressure);
5372 cancel_work_sync(&memcg->high_work);
5373 mem_cgroup_remove_from_trees(memcg);
5374 free_shrinker_info(memcg);
5375 memcg_free_kmem(memcg);
5376 mem_cgroup_free(memcg);
5380 * mem_cgroup_css_reset - reset the states of a mem_cgroup
5381 * @css: the target css
5383 * Reset the states of the mem_cgroup associated with @css. This is
5384 * invoked when the userland requests disabling on the default hierarchy
5385 * but the memcg is pinned through dependency. The memcg should stop
5386 * applying policies and should revert to the vanilla state as it may be
5387 * made visible again.
5389 * The current implementation only resets the essential configurations.
5390 * This needs to be expanded to cover all the visible parts.
5392 static void mem_cgroup_css_reset(struct cgroup_subsys_state *css)
5394 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5396 page_counter_set_max(&memcg->memory, PAGE_COUNTER_MAX);
5397 page_counter_set_max(&memcg->swap, PAGE_COUNTER_MAX);
5398 page_counter_set_max(&memcg->kmem, PAGE_COUNTER_MAX);
5399 page_counter_set_max(&memcg->tcpmem, PAGE_COUNTER_MAX);
5400 page_counter_set_min(&memcg->memory, 0);
5401 page_counter_set_low(&memcg->memory, 0);
5402 page_counter_set_high(&memcg->memory, PAGE_COUNTER_MAX);
5403 memcg->soft_limit = PAGE_COUNTER_MAX;
5404 page_counter_set_high(&memcg->swap, PAGE_COUNTER_MAX);
5405 memcg_wb_domain_size_changed(memcg);
5408 static void mem_cgroup_css_rstat_flush(struct cgroup_subsys_state *css, int cpu)
5410 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5411 struct mem_cgroup *parent = parent_mem_cgroup(memcg);
5412 struct memcg_vmstats_percpu *statc;
5416 statc = per_cpu_ptr(memcg->vmstats_percpu, cpu);
5418 for (i = 0; i < MEMCG_NR_STAT; i++) {
5420 * Collect the aggregated propagation counts of groups
5421 * below us. We're in a per-cpu loop here and this is
5422 * a global counter, so the first cycle will get them.
5424 delta = memcg->vmstats.state_pending[i];
5426 memcg->vmstats.state_pending[i] = 0;
5428 /* Add CPU changes on this level since the last flush */
5429 v = READ_ONCE(statc->state[i]);
5430 if (v != statc->state_prev[i]) {
5431 delta += v - statc->state_prev[i];
5432 statc->state_prev[i] = v;
5438 /* Aggregate counts on this level and propagate upwards */
5439 memcg->vmstats.state[i] += delta;
5441 parent->vmstats.state_pending[i] += delta;
5444 for (i = 0; i < NR_VM_EVENT_ITEMS; i++) {
5445 delta = memcg->vmstats.events_pending[i];
5447 memcg->vmstats.events_pending[i] = 0;
5449 v = READ_ONCE(statc->events[i]);
5450 if (v != statc->events_prev[i]) {
5451 delta += v - statc->events_prev[i];
5452 statc->events_prev[i] = v;
5458 memcg->vmstats.events[i] += delta;
5460 parent->vmstats.events_pending[i] += delta;
5463 for_each_node_state(nid, N_MEMORY) {
5464 struct mem_cgroup_per_node *pn = memcg->nodeinfo[nid];
5465 struct mem_cgroup_per_node *ppn = NULL;
5466 struct lruvec_stats_percpu *lstatc;
5469 ppn = parent->nodeinfo[nid];
5471 lstatc = per_cpu_ptr(pn->lruvec_stats_percpu, cpu);
5473 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++) {
5474 delta = pn->lruvec_stats.state_pending[i];
5476 pn->lruvec_stats.state_pending[i] = 0;
5478 v = READ_ONCE(lstatc->state[i]);
5479 if (v != lstatc->state_prev[i]) {
5480 delta += v - lstatc->state_prev[i];
5481 lstatc->state_prev[i] = v;
5487 pn->lruvec_stats.state[i] += delta;
5489 ppn->lruvec_stats.state_pending[i] += delta;
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 = pfn_swap_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's memory cgroup of its source page while we change it.
5641 if (!trylock_page(page))
5645 if (page_memcg(page) != 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,
5666 __mod_lruvec_state(from_vec, NR_FILE_PAGES, -nr_pages);
5667 __mod_lruvec_state(to_vec, NR_FILE_PAGES, nr_pages);
5669 if (PageSwapBacked(page)) {
5670 __mod_lruvec_state(from_vec, NR_SHMEM, -nr_pages);
5671 __mod_lruvec_state(to_vec, NR_SHMEM, nr_pages);
5674 if (page_mapped(page)) {
5675 __mod_lruvec_state(from_vec, NR_FILE_MAPPED, -nr_pages);
5676 __mod_lruvec_state(to_vec, NR_FILE_MAPPED, nr_pages);
5679 if (PageDirty(page)) {
5680 struct address_space *mapping = page_mapping(page);
5682 if (mapping_can_writeback(mapping)) {
5683 __mod_lruvec_state(from_vec, NR_FILE_DIRTY,
5685 __mod_lruvec_state(to_vec, NR_FILE_DIRTY,
5691 if (PageWriteback(page)) {
5692 __mod_lruvec_state(from_vec, NR_WRITEBACK, -nr_pages);
5693 __mod_lruvec_state(to_vec, NR_WRITEBACK, nr_pages);
5697 * All state has been migrated, let's switch to the new memcg.
5699 * It is safe to change page's memcg here because the page
5700 * is referenced, charged, isolated, and locked: we can't race
5701 * with (un)charging, migration, LRU putback, or anything else
5702 * that would rely on a stable page's memory cgroup.
5704 * Note that lock_page_memcg is a memcg lock, not a page lock,
5705 * to save space. As soon as we switch page's memory cgroup to a
5706 * new memcg that isn't locked, the above state can change
5707 * concurrently again. Make sure we're truly done with it.
5712 css_put(&from->css);
5714 page->memcg_data = (unsigned long)to;
5716 __unlock_page_memcg(from);
5720 local_irq_disable();
5721 mem_cgroup_charge_statistics(to, page, nr_pages);
5722 memcg_check_events(to, page);
5723 mem_cgroup_charge_statistics(from, page, -nr_pages);
5724 memcg_check_events(from, page);
5733 * get_mctgt_type - get target type of moving charge
5734 * @vma: the vma the pte to be checked belongs
5735 * @addr: the address corresponding to the pte to be checked
5736 * @ptent: the pte to be checked
5737 * @target: the pointer the target page or swap ent will be stored(can be NULL)
5740 * 0(MC_TARGET_NONE): if the pte is not a target for move charge.
5741 * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for
5742 * move charge. if @target is not NULL, the page is stored in target->page
5743 * with extra refcnt got(Callers should handle it).
5744 * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a
5745 * target for charge migration. if @target is not NULL, the entry is stored
5747 * 3(MC_TARGET_DEVICE): like MC_TARGET_PAGE but page is MEMORY_DEVICE_PRIVATE
5748 * (so ZONE_DEVICE page and thus not on the lru).
5749 * For now we such page is charge like a regular page would be as for all
5750 * intent and purposes it is just special memory taking the place of a
5753 * See Documentations/vm/hmm.txt and include/linux/hmm.h
5755 * Called with pte lock held.
5758 static enum mc_target_type get_mctgt_type(struct vm_area_struct *vma,
5759 unsigned long addr, pte_t ptent, union mc_target *target)
5761 struct page *page = NULL;
5762 enum mc_target_type ret = MC_TARGET_NONE;
5763 swp_entry_t ent = { .val = 0 };
5765 if (pte_present(ptent))
5766 page = mc_handle_present_pte(vma, addr, ptent);
5767 else if (is_swap_pte(ptent))
5768 page = mc_handle_swap_pte(vma, ptent, &ent);
5769 else if (pte_none(ptent))
5770 page = mc_handle_file_pte(vma, addr, ptent, &ent);
5772 if (!page && !ent.val)
5776 * Do only loose check w/o serialization.
5777 * mem_cgroup_move_account() checks the page is valid or
5778 * not under LRU exclusion.
5780 if (page_memcg(page) == mc.from) {
5781 ret = MC_TARGET_PAGE;
5782 if (is_device_private_page(page))
5783 ret = MC_TARGET_DEVICE;
5785 target->page = page;
5787 if (!ret || !target)
5791 * There is a swap entry and a page doesn't exist or isn't charged.
5792 * But we cannot move a tail-page in a THP.
5794 if (ent.val && !ret && (!page || !PageTransCompound(page)) &&
5795 mem_cgroup_id(mc.from) == lookup_swap_cgroup_id(ent)) {
5796 ret = MC_TARGET_SWAP;
5803 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5805 * We don't consider PMD mapped swapping or file mapped pages because THP does
5806 * not support them for now.
5807 * Caller should make sure that pmd_trans_huge(pmd) is true.
5809 static enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
5810 unsigned long addr, pmd_t pmd, union mc_target *target)
5812 struct page *page = NULL;
5813 enum mc_target_type ret = MC_TARGET_NONE;
5815 if (unlikely(is_swap_pmd(pmd))) {
5816 VM_BUG_ON(thp_migration_supported() &&
5817 !is_pmd_migration_entry(pmd));
5820 page = pmd_page(pmd);
5821 VM_BUG_ON_PAGE(!page || !PageHead(page), page);
5822 if (!(mc.flags & MOVE_ANON))
5824 if (page_memcg(page) == mc.from) {
5825 ret = MC_TARGET_PAGE;
5828 target->page = page;
5834 static inline enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
5835 unsigned long addr, pmd_t pmd, union mc_target *target)
5837 return MC_TARGET_NONE;
5841 static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd,
5842 unsigned long addr, unsigned long end,
5843 struct mm_walk *walk)
5845 struct vm_area_struct *vma = walk->vma;
5849 ptl = pmd_trans_huge_lock(pmd, vma);
5852 * Note their can not be MC_TARGET_DEVICE for now as we do not
5853 * support transparent huge page with MEMORY_DEVICE_PRIVATE but
5854 * this might change.
5856 if (get_mctgt_type_thp(vma, addr, *pmd, NULL) == MC_TARGET_PAGE)
5857 mc.precharge += HPAGE_PMD_NR;
5862 if (pmd_trans_unstable(pmd))
5864 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
5865 for (; addr != end; pte++, addr += PAGE_SIZE)
5866 if (get_mctgt_type(vma, addr, *pte, NULL))
5867 mc.precharge++; /* increment precharge temporarily */
5868 pte_unmap_unlock(pte - 1, ptl);
5874 static const struct mm_walk_ops precharge_walk_ops = {
5875 .pmd_entry = mem_cgroup_count_precharge_pte_range,
5878 static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm)
5880 unsigned long precharge;
5883 walk_page_range(mm, 0, mm->highest_vm_end, &precharge_walk_ops, NULL);
5884 mmap_read_unlock(mm);
5886 precharge = mc.precharge;
5892 static int mem_cgroup_precharge_mc(struct mm_struct *mm)
5894 unsigned long precharge = mem_cgroup_count_precharge(mm);
5896 VM_BUG_ON(mc.moving_task);
5897 mc.moving_task = current;
5898 return mem_cgroup_do_precharge(precharge);
5901 /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */
5902 static void __mem_cgroup_clear_mc(void)
5904 struct mem_cgroup *from = mc.from;
5905 struct mem_cgroup *to = mc.to;
5907 /* we must uncharge all the leftover precharges from mc.to */
5909 cancel_charge(mc.to, mc.precharge);
5913 * we didn't uncharge from mc.from at mem_cgroup_move_account(), so
5914 * we must uncharge here.
5916 if (mc.moved_charge) {
5917 cancel_charge(mc.from, mc.moved_charge);
5918 mc.moved_charge = 0;
5920 /* we must fixup refcnts and charges */
5921 if (mc.moved_swap) {
5922 /* uncharge swap account from the old cgroup */
5923 if (!mem_cgroup_is_root(mc.from))
5924 page_counter_uncharge(&mc.from->memsw, mc.moved_swap);
5926 mem_cgroup_id_put_many(mc.from, mc.moved_swap);
5929 * we charged both to->memory and to->memsw, so we
5930 * should uncharge to->memory.
5932 if (!mem_cgroup_is_root(mc.to))
5933 page_counter_uncharge(&mc.to->memory, mc.moved_swap);
5937 memcg_oom_recover(from);
5938 memcg_oom_recover(to);
5939 wake_up_all(&mc.waitq);
5942 static void mem_cgroup_clear_mc(void)
5944 struct mm_struct *mm = mc.mm;
5947 * we must clear moving_task before waking up waiters at the end of
5950 mc.moving_task = NULL;
5951 __mem_cgroup_clear_mc();
5952 spin_lock(&mc.lock);
5956 spin_unlock(&mc.lock);
5961 static int mem_cgroup_can_attach(struct cgroup_taskset *tset)
5963 struct cgroup_subsys_state *css;
5964 struct mem_cgroup *memcg = NULL; /* unneeded init to make gcc happy */
5965 struct mem_cgroup *from;
5966 struct task_struct *leader, *p;
5967 struct mm_struct *mm;
5968 unsigned long move_flags;
5971 /* charge immigration isn't supported on the default hierarchy */
5972 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
5976 * Multi-process migrations only happen on the default hierarchy
5977 * where charge immigration is not used. Perform charge
5978 * immigration if @tset contains a leader and whine if there are
5982 cgroup_taskset_for_each_leader(leader, css, tset) {
5985 memcg = mem_cgroup_from_css(css);
5991 * We are now committed to this value whatever it is. Changes in this
5992 * tunable will only affect upcoming migrations, not the current one.
5993 * So we need to save it, and keep it going.
5995 move_flags = READ_ONCE(memcg->move_charge_at_immigrate);
5999 from = mem_cgroup_from_task(p);
6001 VM_BUG_ON(from == memcg);
6003 mm = get_task_mm(p);
6006 /* We move charges only when we move a owner of the mm */
6007 if (mm->owner == p) {
6010 VM_BUG_ON(mc.precharge);
6011 VM_BUG_ON(mc.moved_charge);
6012 VM_BUG_ON(mc.moved_swap);
6014 spin_lock(&mc.lock);
6018 mc.flags = move_flags;
6019 spin_unlock(&mc.lock);
6020 /* We set mc.moving_task later */
6022 ret = mem_cgroup_precharge_mc(mm);
6024 mem_cgroup_clear_mc();
6031 static void mem_cgroup_cancel_attach(struct cgroup_taskset *tset)
6034 mem_cgroup_clear_mc();
6037 static int mem_cgroup_move_charge_pte_range(pmd_t *pmd,
6038 unsigned long addr, unsigned long end,
6039 struct mm_walk *walk)
6042 struct vm_area_struct *vma = walk->vma;
6045 enum mc_target_type target_type;
6046 union mc_target target;
6049 ptl = pmd_trans_huge_lock(pmd, vma);
6051 if (mc.precharge < HPAGE_PMD_NR) {
6055 target_type = get_mctgt_type_thp(vma, addr, *pmd, &target);
6056 if (target_type == MC_TARGET_PAGE) {
6058 if (!isolate_lru_page(page)) {
6059 if (!mem_cgroup_move_account(page, true,
6061 mc.precharge -= HPAGE_PMD_NR;
6062 mc.moved_charge += HPAGE_PMD_NR;
6064 putback_lru_page(page);
6067 } else if (target_type == MC_TARGET_DEVICE) {
6069 if (!mem_cgroup_move_account(page, true,
6071 mc.precharge -= HPAGE_PMD_NR;
6072 mc.moved_charge += HPAGE_PMD_NR;
6080 if (pmd_trans_unstable(pmd))
6083 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
6084 for (; addr != end; addr += PAGE_SIZE) {
6085 pte_t ptent = *(pte++);
6086 bool device = false;
6092 switch (get_mctgt_type(vma, addr, ptent, &target)) {
6093 case MC_TARGET_DEVICE:
6096 case MC_TARGET_PAGE:
6099 * We can have a part of the split pmd here. Moving it
6100 * can be done but it would be too convoluted so simply
6101 * ignore such a partial THP and keep it in original
6102 * memcg. There should be somebody mapping the head.
6104 if (PageTransCompound(page))
6106 if (!device && isolate_lru_page(page))
6108 if (!mem_cgroup_move_account(page, false,
6111 /* we uncharge from mc.from later. */
6115 putback_lru_page(page);
6116 put: /* get_mctgt_type() gets the page */
6119 case MC_TARGET_SWAP:
6121 if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to)) {
6123 mem_cgroup_id_get_many(mc.to, 1);
6124 /* we fixup other refcnts and charges later. */
6132 pte_unmap_unlock(pte - 1, ptl);
6137 * We have consumed all precharges we got in can_attach().
6138 * We try charge one by one, but don't do any additional
6139 * charges to mc.to if we have failed in charge once in attach()
6142 ret = mem_cgroup_do_precharge(1);
6150 static const struct mm_walk_ops charge_walk_ops = {
6151 .pmd_entry = mem_cgroup_move_charge_pte_range,
6154 static void mem_cgroup_move_charge(void)
6156 lru_add_drain_all();
6158 * Signal lock_page_memcg() to take the memcg's move_lock
6159 * while we're moving its pages to another memcg. Then wait
6160 * for already started RCU-only updates to finish.
6162 atomic_inc(&mc.from->moving_account);
6165 if (unlikely(!mmap_read_trylock(mc.mm))) {
6167 * Someone who are holding the mmap_lock might be waiting in
6168 * waitq. So we cancel all extra charges, wake up all waiters,
6169 * and retry. Because we cancel precharges, we might not be able
6170 * to move enough charges, but moving charge is a best-effort
6171 * feature anyway, so it wouldn't be a big problem.
6173 __mem_cgroup_clear_mc();
6178 * When we have consumed all precharges and failed in doing
6179 * additional charge, the page walk just aborts.
6181 walk_page_range(mc.mm, 0, mc.mm->highest_vm_end, &charge_walk_ops,
6184 mmap_read_unlock(mc.mm);
6185 atomic_dec(&mc.from->moving_account);
6188 static void mem_cgroup_move_task(void)
6191 mem_cgroup_move_charge();
6192 mem_cgroup_clear_mc();
6195 #else /* !CONFIG_MMU */
6196 static int mem_cgroup_can_attach(struct cgroup_taskset *tset)
6200 static void mem_cgroup_cancel_attach(struct cgroup_taskset *tset)
6203 static void mem_cgroup_move_task(void)
6208 static int seq_puts_memcg_tunable(struct seq_file *m, unsigned long value)
6210 if (value == PAGE_COUNTER_MAX)
6211 seq_puts(m, "max\n");
6213 seq_printf(m, "%llu\n", (u64)value * PAGE_SIZE);
6218 static u64 memory_current_read(struct cgroup_subsys_state *css,
6221 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
6223 return (u64)page_counter_read(&memcg->memory) * PAGE_SIZE;
6226 static int memory_min_show(struct seq_file *m, void *v)
6228 return seq_puts_memcg_tunable(m,
6229 READ_ONCE(mem_cgroup_from_seq(m)->memory.min));
6232 static ssize_t memory_min_write(struct kernfs_open_file *of,
6233 char *buf, size_t nbytes, loff_t off)
6235 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6239 buf = strstrip(buf);
6240 err = page_counter_memparse(buf, "max", &min);
6244 page_counter_set_min(&memcg->memory, min);
6249 static int memory_low_show(struct seq_file *m, void *v)
6251 return seq_puts_memcg_tunable(m,
6252 READ_ONCE(mem_cgroup_from_seq(m)->memory.low));
6255 static ssize_t memory_low_write(struct kernfs_open_file *of,
6256 char *buf, size_t nbytes, loff_t off)
6258 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6262 buf = strstrip(buf);
6263 err = page_counter_memparse(buf, "max", &low);
6267 page_counter_set_low(&memcg->memory, low);
6272 static int memory_high_show(struct seq_file *m, void *v)
6274 return seq_puts_memcg_tunable(m,
6275 READ_ONCE(mem_cgroup_from_seq(m)->memory.high));
6278 static ssize_t memory_high_write(struct kernfs_open_file *of,
6279 char *buf, size_t nbytes, loff_t off)
6281 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6282 unsigned int nr_retries = MAX_RECLAIM_RETRIES;
6283 bool drained = false;
6287 buf = strstrip(buf);
6288 err = page_counter_memparse(buf, "max", &high);
6292 page_counter_set_high(&memcg->memory, high);
6295 unsigned long nr_pages = page_counter_read(&memcg->memory);
6296 unsigned long reclaimed;
6298 if (nr_pages <= high)
6301 if (signal_pending(current))
6305 drain_all_stock(memcg);
6310 reclaimed = try_to_free_mem_cgroup_pages(memcg, nr_pages - high,
6313 if (!reclaimed && !nr_retries--)
6317 memcg_wb_domain_size_changed(memcg);
6321 static int memory_max_show(struct seq_file *m, void *v)
6323 return seq_puts_memcg_tunable(m,
6324 READ_ONCE(mem_cgroup_from_seq(m)->memory.max));
6327 static ssize_t memory_max_write(struct kernfs_open_file *of,
6328 char *buf, size_t nbytes, loff_t off)
6330 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6331 unsigned int nr_reclaims = MAX_RECLAIM_RETRIES;
6332 bool drained = false;
6336 buf = strstrip(buf);
6337 err = page_counter_memparse(buf, "max", &max);
6341 xchg(&memcg->memory.max, max);
6344 unsigned long nr_pages = page_counter_read(&memcg->memory);
6346 if (nr_pages <= max)
6349 if (signal_pending(current))
6353 drain_all_stock(memcg);
6359 if (!try_to_free_mem_cgroup_pages(memcg, nr_pages - max,
6365 memcg_memory_event(memcg, MEMCG_OOM);
6366 if (!mem_cgroup_out_of_memory(memcg, GFP_KERNEL, 0))
6370 memcg_wb_domain_size_changed(memcg);
6374 static void __memory_events_show(struct seq_file *m, atomic_long_t *events)
6376 seq_printf(m, "low %lu\n", atomic_long_read(&events[MEMCG_LOW]));
6377 seq_printf(m, "high %lu\n", atomic_long_read(&events[MEMCG_HIGH]));
6378 seq_printf(m, "max %lu\n", atomic_long_read(&events[MEMCG_MAX]));
6379 seq_printf(m, "oom %lu\n", atomic_long_read(&events[MEMCG_OOM]));
6380 seq_printf(m, "oom_kill %lu\n",
6381 atomic_long_read(&events[MEMCG_OOM_KILL]));
6384 static int memory_events_show(struct seq_file *m, void *v)
6386 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
6388 __memory_events_show(m, memcg->memory_events);
6392 static int memory_events_local_show(struct seq_file *m, void *v)
6394 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
6396 __memory_events_show(m, memcg->memory_events_local);
6400 static int memory_stat_show(struct seq_file *m, void *v)
6402 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
6405 buf = memory_stat_format(memcg);
6414 static inline unsigned long lruvec_page_state_output(struct lruvec *lruvec,
6417 return lruvec_page_state(lruvec, item) * memcg_page_state_unit(item);
6420 static int memory_numa_stat_show(struct seq_file *m, void *v)
6423 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
6425 mem_cgroup_flush_stats();
6427 for (i = 0; i < ARRAY_SIZE(memory_stats); i++) {
6430 if (memory_stats[i].idx >= NR_VM_NODE_STAT_ITEMS)
6433 seq_printf(m, "%s", memory_stats[i].name);
6434 for_each_node_state(nid, N_MEMORY) {
6436 struct lruvec *lruvec;
6438 lruvec = mem_cgroup_lruvec(memcg, NODE_DATA(nid));
6439 size = lruvec_page_state_output(lruvec,
6440 memory_stats[i].idx);
6441 seq_printf(m, " N%d=%llu", nid, size);
6450 static int memory_oom_group_show(struct seq_file *m, void *v)
6452 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
6454 seq_printf(m, "%d\n", memcg->oom_group);
6459 static ssize_t memory_oom_group_write(struct kernfs_open_file *of,
6460 char *buf, size_t nbytes, loff_t off)
6462 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6465 buf = strstrip(buf);
6469 ret = kstrtoint(buf, 0, &oom_group);
6473 if (oom_group != 0 && oom_group != 1)
6476 memcg->oom_group = oom_group;
6481 static struct cftype memory_files[] = {
6484 .flags = CFTYPE_NOT_ON_ROOT,
6485 .read_u64 = memory_current_read,
6489 .flags = CFTYPE_NOT_ON_ROOT,
6490 .seq_show = memory_min_show,
6491 .write = memory_min_write,
6495 .flags = CFTYPE_NOT_ON_ROOT,
6496 .seq_show = memory_low_show,
6497 .write = memory_low_write,
6501 .flags = CFTYPE_NOT_ON_ROOT,
6502 .seq_show = memory_high_show,
6503 .write = memory_high_write,
6507 .flags = CFTYPE_NOT_ON_ROOT,
6508 .seq_show = memory_max_show,
6509 .write = memory_max_write,
6513 .flags = CFTYPE_NOT_ON_ROOT,
6514 .file_offset = offsetof(struct mem_cgroup, events_file),
6515 .seq_show = memory_events_show,
6518 .name = "events.local",
6519 .flags = CFTYPE_NOT_ON_ROOT,
6520 .file_offset = offsetof(struct mem_cgroup, events_local_file),
6521 .seq_show = memory_events_local_show,
6525 .seq_show = memory_stat_show,
6529 .name = "numa_stat",
6530 .seq_show = memory_numa_stat_show,
6534 .name = "oom.group",
6535 .flags = CFTYPE_NOT_ON_ROOT | CFTYPE_NS_DELEGATABLE,
6536 .seq_show = memory_oom_group_show,
6537 .write = memory_oom_group_write,
6542 struct cgroup_subsys memory_cgrp_subsys = {
6543 .css_alloc = mem_cgroup_css_alloc,
6544 .css_online = mem_cgroup_css_online,
6545 .css_offline = mem_cgroup_css_offline,
6546 .css_released = mem_cgroup_css_released,
6547 .css_free = mem_cgroup_css_free,
6548 .css_reset = mem_cgroup_css_reset,
6549 .css_rstat_flush = mem_cgroup_css_rstat_flush,
6550 .can_attach = mem_cgroup_can_attach,
6551 .cancel_attach = mem_cgroup_cancel_attach,
6552 .post_attach = mem_cgroup_move_task,
6553 .dfl_cftypes = memory_files,
6554 .legacy_cftypes = mem_cgroup_legacy_files,
6559 * This function calculates an individual cgroup's effective
6560 * protection which is derived from its own memory.min/low, its
6561 * parent's and siblings' settings, as well as the actual memory
6562 * distribution in the tree.
6564 * The following rules apply to the effective protection values:
6566 * 1. At the first level of reclaim, effective protection is equal to
6567 * the declared protection in memory.min and memory.low.
6569 * 2. To enable safe delegation of the protection configuration, at
6570 * subsequent levels the effective protection is capped to the
6571 * parent's effective protection.
6573 * 3. To make complex and dynamic subtrees easier to configure, the
6574 * user is allowed to overcommit the declared protection at a given
6575 * level. If that is the case, the parent's effective protection is
6576 * distributed to the children in proportion to how much protection
6577 * they have declared and how much of it they are utilizing.
6579 * This makes distribution proportional, but also work-conserving:
6580 * if one cgroup claims much more protection than it uses memory,
6581 * the unused remainder is available to its siblings.
6583 * 4. Conversely, when the declared protection is undercommitted at a
6584 * given level, the distribution of the larger parental protection
6585 * budget is NOT proportional. A cgroup's protection from a sibling
6586 * is capped to its own memory.min/low setting.
6588 * 5. However, to allow protecting recursive subtrees from each other
6589 * without having to declare each individual cgroup's fixed share
6590 * of the ancestor's claim to protection, any unutilized -
6591 * "floating" - protection from up the tree is distributed in
6592 * proportion to each cgroup's *usage*. This makes the protection
6593 * neutral wrt sibling cgroups and lets them compete freely over
6594 * the shared parental protection budget, but it protects the
6595 * subtree as a whole from neighboring subtrees.
6597 * Note that 4. and 5. are not in conflict: 4. is about protecting
6598 * against immediate siblings whereas 5. is about protecting against
6599 * neighboring subtrees.
6601 static unsigned long effective_protection(unsigned long usage,
6602 unsigned long parent_usage,
6603 unsigned long setting,
6604 unsigned long parent_effective,
6605 unsigned long siblings_protected)
6607 unsigned long protected;
6610 protected = min(usage, setting);
6612 * If all cgroups at this level combined claim and use more
6613 * protection then what the parent affords them, distribute
6614 * shares in proportion to utilization.
6616 * We are using actual utilization rather than the statically
6617 * claimed protection in order to be work-conserving: claimed
6618 * but unused protection is available to siblings that would
6619 * otherwise get a smaller chunk than what they claimed.
6621 if (siblings_protected > parent_effective)
6622 return protected * parent_effective / siblings_protected;
6625 * Ok, utilized protection of all children is within what the
6626 * parent affords them, so we know whatever this child claims
6627 * and utilizes is effectively protected.
6629 * If there is unprotected usage beyond this value, reclaim
6630 * will apply pressure in proportion to that amount.
6632 * If there is unutilized protection, the cgroup will be fully
6633 * shielded from reclaim, but we do return a smaller value for
6634 * protection than what the group could enjoy in theory. This
6635 * is okay. With the overcommit distribution above, effective
6636 * protection is always dependent on how memory is actually
6637 * consumed among the siblings anyway.
6642 * If the children aren't claiming (all of) the protection
6643 * afforded to them by the parent, distribute the remainder in
6644 * proportion to the (unprotected) memory of each cgroup. That
6645 * way, cgroups that aren't explicitly prioritized wrt each
6646 * other compete freely over the allowance, but they are
6647 * collectively protected from neighboring trees.
6649 * We're using unprotected memory for the weight so that if
6650 * some cgroups DO claim explicit protection, we don't protect
6651 * the same bytes twice.
6653 * Check both usage and parent_usage against the respective
6654 * protected values. One should imply the other, but they
6655 * aren't read atomically - make sure the division is sane.
6657 if (!(cgrp_dfl_root.flags & CGRP_ROOT_MEMORY_RECURSIVE_PROT))
6659 if (parent_effective > siblings_protected &&
6660 parent_usage > siblings_protected &&
6661 usage > protected) {
6662 unsigned long unclaimed;
6664 unclaimed = parent_effective - siblings_protected;
6665 unclaimed *= usage - protected;
6666 unclaimed /= parent_usage - siblings_protected;
6675 * mem_cgroup_calculate_protection - check if memory consumption is in the normal range
6676 * @root: the top ancestor of the sub-tree being checked
6677 * @memcg: the memory cgroup to check
6679 * WARNING: This function is not stateless! It can only be used as part
6680 * of a top-down tree iteration, not for isolated queries.
6682 void mem_cgroup_calculate_protection(struct mem_cgroup *root,
6683 struct mem_cgroup *memcg)
6685 unsigned long usage, parent_usage;
6686 struct mem_cgroup *parent;
6688 if (mem_cgroup_disabled())
6692 root = root_mem_cgroup;
6695 * Effective values of the reclaim targets are ignored so they
6696 * can be stale. Have a look at mem_cgroup_protection for more
6698 * TODO: calculation should be more robust so that we do not need
6699 * that special casing.
6704 usage = page_counter_read(&memcg->memory);
6708 parent = parent_mem_cgroup(memcg);
6709 /* No parent means a non-hierarchical mode on v1 memcg */
6713 if (parent == root) {
6714 memcg->memory.emin = READ_ONCE(memcg->memory.min);
6715 memcg->memory.elow = READ_ONCE(memcg->memory.low);
6719 parent_usage = page_counter_read(&parent->memory);
6721 WRITE_ONCE(memcg->memory.emin, effective_protection(usage, parent_usage,
6722 READ_ONCE(memcg->memory.min),
6723 READ_ONCE(parent->memory.emin),
6724 atomic_long_read(&parent->memory.children_min_usage)));
6726 WRITE_ONCE(memcg->memory.elow, effective_protection(usage, parent_usage,
6727 READ_ONCE(memcg->memory.low),
6728 READ_ONCE(parent->memory.elow),
6729 atomic_long_read(&parent->memory.children_low_usage)));
6732 static int charge_memcg(struct page *page, struct mem_cgroup *memcg, gfp_t gfp)
6734 unsigned int nr_pages = thp_nr_pages(page);
6737 ret = try_charge(memcg, gfp, nr_pages);
6741 css_get(&memcg->css);
6742 commit_charge(page, memcg);
6744 local_irq_disable();
6745 mem_cgroup_charge_statistics(memcg, page, nr_pages);
6746 memcg_check_events(memcg, page);
6753 * __mem_cgroup_charge - charge a newly allocated page to a cgroup
6754 * @page: page to charge
6755 * @mm: mm context of the victim
6756 * @gfp_mask: reclaim mode
6758 * Try to charge @page to the memcg that @mm belongs to, reclaiming
6759 * pages according to @gfp_mask if necessary. if @mm is NULL, try to
6760 * charge to the active memcg.
6762 * Do not use this for pages allocated for swapin.
6764 * Returns 0 on success. Otherwise, an error code is returned.
6766 int __mem_cgroup_charge(struct page *page, struct mm_struct *mm,
6769 struct mem_cgroup *memcg;
6772 memcg = get_mem_cgroup_from_mm(mm);
6773 ret = charge_memcg(page, memcg, gfp_mask);
6774 css_put(&memcg->css);
6780 * mem_cgroup_swapin_charge_page - charge a newly allocated page for swapin
6781 * @page: page to charge
6782 * @mm: mm context of the victim
6783 * @gfp: reclaim mode
6784 * @entry: swap entry for which the page is allocated
6786 * This function charges a page allocated for swapin. Please call this before
6787 * adding the page to the swapcache.
6789 * Returns 0 on success. Otherwise, an error code is returned.
6791 int mem_cgroup_swapin_charge_page(struct page *page, struct mm_struct *mm,
6792 gfp_t gfp, swp_entry_t entry)
6794 struct mem_cgroup *memcg;
6798 if (mem_cgroup_disabled())
6801 id = lookup_swap_cgroup_id(entry);
6803 memcg = mem_cgroup_from_id(id);
6804 if (!memcg || !css_tryget_online(&memcg->css))
6805 memcg = get_mem_cgroup_from_mm(mm);
6808 ret = charge_memcg(page, memcg, gfp);
6810 css_put(&memcg->css);
6815 * mem_cgroup_swapin_uncharge_swap - uncharge swap slot
6816 * @entry: swap entry for which the page is charged
6818 * Call this function after successfully adding the charged page to swapcache.
6820 * Note: This function assumes the page for which swap slot is being uncharged
6823 void mem_cgroup_swapin_uncharge_swap(swp_entry_t entry)
6826 * Cgroup1's unified memory+swap counter has been charged with the
6827 * new swapcache page, finish the transfer by uncharging the swap
6828 * slot. The swap slot would also get uncharged when it dies, but
6829 * it can stick around indefinitely and we'd count the page twice
6832 * Cgroup2 has separate resource counters for memory and swap,
6833 * so this is a non-issue here. Memory and swap charge lifetimes
6834 * correspond 1:1 to page and swap slot lifetimes: we charge the
6835 * page to memory here, and uncharge swap when the slot is freed.
6837 if (!mem_cgroup_disabled() && do_memsw_account()) {
6839 * The swap entry might not get freed for a long time,
6840 * let's not wait for it. The page already received a
6841 * memory+swap charge, drop the swap entry duplicate.
6843 mem_cgroup_uncharge_swap(entry, 1);
6847 struct uncharge_gather {
6848 struct mem_cgroup *memcg;
6849 unsigned long nr_memory;
6850 unsigned long pgpgout;
6851 unsigned long nr_kmem;
6852 struct page *dummy_page;
6855 static inline void uncharge_gather_clear(struct uncharge_gather *ug)
6857 memset(ug, 0, sizeof(*ug));
6860 static void uncharge_batch(const struct uncharge_gather *ug)
6862 unsigned long flags;
6864 if (ug->nr_memory) {
6865 page_counter_uncharge(&ug->memcg->memory, ug->nr_memory);
6866 if (do_memsw_account())
6867 page_counter_uncharge(&ug->memcg->memsw, ug->nr_memory);
6868 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && ug->nr_kmem)
6869 page_counter_uncharge(&ug->memcg->kmem, ug->nr_kmem);
6870 memcg_oom_recover(ug->memcg);
6873 local_irq_save(flags);
6874 __count_memcg_events(ug->memcg, PGPGOUT, ug->pgpgout);
6875 __this_cpu_add(ug->memcg->vmstats_percpu->nr_page_events, ug->nr_memory);
6876 memcg_check_events(ug->memcg, ug->dummy_page);
6877 local_irq_restore(flags);
6879 /* drop reference from uncharge_page */
6880 css_put(&ug->memcg->css);
6883 static void uncharge_page(struct page *page, struct uncharge_gather *ug)
6885 unsigned long nr_pages;
6886 struct mem_cgroup *memcg;
6887 struct obj_cgroup *objcg;
6888 bool use_objcg = PageMemcgKmem(page);
6890 VM_BUG_ON_PAGE(PageLRU(page), page);
6893 * Nobody should be changing or seriously looking at
6894 * page memcg or objcg at this point, we have fully
6895 * exclusive access to the page.
6898 objcg = __page_objcg(page);
6900 * This get matches the put at the end of the function and
6901 * kmem pages do not hold memcg references anymore.
6903 memcg = get_mem_cgroup_from_objcg(objcg);
6905 memcg = __page_memcg(page);
6911 if (ug->memcg != memcg) {
6914 uncharge_gather_clear(ug);
6917 ug->dummy_page = page;
6919 /* pairs with css_put in uncharge_batch */
6920 css_get(&memcg->css);
6923 nr_pages = compound_nr(page);
6926 ug->nr_memory += nr_pages;
6927 ug->nr_kmem += nr_pages;
6929 page->memcg_data = 0;
6930 obj_cgroup_put(objcg);
6932 /* LRU pages aren't accounted at the root level */
6933 if (!mem_cgroup_is_root(memcg))
6934 ug->nr_memory += nr_pages;
6937 page->memcg_data = 0;
6940 css_put(&memcg->css);
6944 * __mem_cgroup_uncharge - uncharge a page
6945 * @page: page to uncharge
6947 * Uncharge a page previously charged with __mem_cgroup_charge().
6949 void __mem_cgroup_uncharge(struct page *page)
6951 struct uncharge_gather ug;
6953 /* Don't touch page->lru of any random page, pre-check: */
6954 if (!page_memcg(page))
6957 uncharge_gather_clear(&ug);
6958 uncharge_page(page, &ug);
6959 uncharge_batch(&ug);
6963 * __mem_cgroup_uncharge_list - uncharge a list of page
6964 * @page_list: list of pages to uncharge
6966 * Uncharge a list of pages previously charged with
6967 * __mem_cgroup_charge().
6969 void __mem_cgroup_uncharge_list(struct list_head *page_list)
6971 struct uncharge_gather ug;
6974 uncharge_gather_clear(&ug);
6975 list_for_each_entry(page, page_list, lru)
6976 uncharge_page(page, &ug);
6978 uncharge_batch(&ug);
6982 * mem_cgroup_migrate - charge a page's replacement
6983 * @oldpage: currently circulating page
6984 * @newpage: replacement page
6986 * Charge @newpage as a replacement page for @oldpage. @oldpage will
6987 * be uncharged upon free.
6989 * Both pages must be locked, @newpage->mapping must be set up.
6991 void mem_cgroup_migrate(struct page *oldpage, struct page *newpage)
6993 struct mem_cgroup *memcg;
6994 unsigned int nr_pages;
6995 unsigned long flags;
6997 VM_BUG_ON_PAGE(!PageLocked(oldpage), oldpage);
6998 VM_BUG_ON_PAGE(!PageLocked(newpage), newpage);
6999 VM_BUG_ON_PAGE(PageAnon(oldpage) != PageAnon(newpage), newpage);
7000 VM_BUG_ON_PAGE(PageTransHuge(oldpage) != PageTransHuge(newpage),
7003 if (mem_cgroup_disabled())
7006 /* Page cache replacement: new page already charged? */
7007 if (page_memcg(newpage))
7010 memcg = page_memcg(oldpage);
7011 VM_WARN_ON_ONCE_PAGE(!memcg, oldpage);
7015 /* Force-charge the new page. The old one will be freed soon */
7016 nr_pages = thp_nr_pages(newpage);
7018 if (!mem_cgroup_is_root(memcg)) {
7019 page_counter_charge(&memcg->memory, nr_pages);
7020 if (do_memsw_account())
7021 page_counter_charge(&memcg->memsw, nr_pages);
7024 css_get(&memcg->css);
7025 commit_charge(newpage, memcg);
7027 local_irq_save(flags);
7028 mem_cgroup_charge_statistics(memcg, newpage, nr_pages);
7029 memcg_check_events(memcg, newpage);
7030 local_irq_restore(flags);
7033 DEFINE_STATIC_KEY_FALSE(memcg_sockets_enabled_key);
7034 EXPORT_SYMBOL(memcg_sockets_enabled_key);
7036 void mem_cgroup_sk_alloc(struct sock *sk)
7038 struct mem_cgroup *memcg;
7040 if (!mem_cgroup_sockets_enabled)
7043 /* Do not associate the sock with unrelated interrupted task's memcg. */
7048 memcg = mem_cgroup_from_task(current);
7049 if (memcg == root_mem_cgroup)
7051 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && !memcg->tcpmem_active)
7053 if (css_tryget(&memcg->css))
7054 sk->sk_memcg = memcg;
7059 void mem_cgroup_sk_free(struct sock *sk)
7062 css_put(&sk->sk_memcg->css);
7066 * mem_cgroup_charge_skmem - charge socket memory
7067 * @memcg: memcg to charge
7068 * @nr_pages: number of pages to charge
7069 * @gfp_mask: reclaim mode
7071 * Charges @nr_pages to @memcg. Returns %true if the charge fit within
7072 * @memcg's configured limit, %false if it doesn't.
7074 bool mem_cgroup_charge_skmem(struct mem_cgroup *memcg, unsigned int nr_pages,
7077 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) {
7078 struct page_counter *fail;
7080 if (page_counter_try_charge(&memcg->tcpmem, nr_pages, &fail)) {
7081 memcg->tcpmem_pressure = 0;
7084 memcg->tcpmem_pressure = 1;
7085 if (gfp_mask & __GFP_NOFAIL) {
7086 page_counter_charge(&memcg->tcpmem, nr_pages);
7092 if (try_charge(memcg, gfp_mask, nr_pages) == 0) {
7093 mod_memcg_state(memcg, MEMCG_SOCK, nr_pages);
7101 * mem_cgroup_uncharge_skmem - uncharge socket memory
7102 * @memcg: memcg to uncharge
7103 * @nr_pages: number of pages to uncharge
7105 void mem_cgroup_uncharge_skmem(struct mem_cgroup *memcg, unsigned int nr_pages)
7107 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) {
7108 page_counter_uncharge(&memcg->tcpmem, nr_pages);
7112 mod_memcg_state(memcg, MEMCG_SOCK, -nr_pages);
7114 refill_stock(memcg, nr_pages);
7117 static int __init cgroup_memory(char *s)
7121 while ((token = strsep(&s, ",")) != NULL) {
7124 if (!strcmp(token, "nosocket"))
7125 cgroup_memory_nosocket = true;
7126 if (!strcmp(token, "nokmem"))
7127 cgroup_memory_nokmem = true;
7131 __setup("cgroup.memory=", cgroup_memory);
7134 * subsys_initcall() for memory controller.
7136 * Some parts like memcg_hotplug_cpu_dead() have to be initialized from this
7137 * context because of lock dependencies (cgroup_lock -> cpu hotplug) but
7138 * basically everything that doesn't depend on a specific mem_cgroup structure
7139 * should be initialized from here.
7141 static int __init mem_cgroup_init(void)
7146 * Currently s32 type (can refer to struct batched_lruvec_stat) is
7147 * used for per-memcg-per-cpu caching of per-node statistics. In order
7148 * to work fine, we should make sure that the overfill threshold can't
7149 * exceed S32_MAX / PAGE_SIZE.
7151 BUILD_BUG_ON(MEMCG_CHARGE_BATCH > S32_MAX / PAGE_SIZE);
7153 cpuhp_setup_state_nocalls(CPUHP_MM_MEMCQ_DEAD, "mm/memctrl:dead", NULL,
7154 memcg_hotplug_cpu_dead);
7156 for_each_possible_cpu(cpu)
7157 INIT_WORK(&per_cpu_ptr(&memcg_stock, cpu)->work,
7160 for_each_node(node) {
7161 struct mem_cgroup_tree_per_node *rtpn;
7163 rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL,
7164 node_online(node) ? node : NUMA_NO_NODE);
7166 rtpn->rb_root = RB_ROOT;
7167 rtpn->rb_rightmost = NULL;
7168 spin_lock_init(&rtpn->lock);
7169 soft_limit_tree.rb_tree_per_node[node] = rtpn;
7174 subsys_initcall(mem_cgroup_init);
7176 #ifdef CONFIG_MEMCG_SWAP
7177 static struct mem_cgroup *mem_cgroup_id_get_online(struct mem_cgroup *memcg)
7179 while (!refcount_inc_not_zero(&memcg->id.ref)) {
7181 * The root cgroup cannot be destroyed, so it's refcount must
7184 if (WARN_ON_ONCE(memcg == root_mem_cgroup)) {
7188 memcg = parent_mem_cgroup(memcg);
7190 memcg = root_mem_cgroup;
7196 * mem_cgroup_swapout - transfer a memsw charge to swap
7197 * @page: page whose memsw charge to transfer
7198 * @entry: swap entry to move the charge to
7200 * Transfer the memsw charge of @page to @entry.
7202 void mem_cgroup_swapout(struct page *page, swp_entry_t entry)
7204 struct mem_cgroup *memcg, *swap_memcg;
7205 unsigned int nr_entries;
7206 unsigned short oldid;
7208 VM_BUG_ON_PAGE(PageLRU(page), page);
7209 VM_BUG_ON_PAGE(page_count(page), page);
7211 if (mem_cgroup_disabled())
7214 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
7217 memcg = page_memcg(page);
7219 VM_WARN_ON_ONCE_PAGE(!memcg, page);
7224 * In case the memcg owning these pages has been offlined and doesn't
7225 * have an ID allocated to it anymore, charge the closest online
7226 * ancestor for the swap instead and transfer the memory+swap charge.
7228 swap_memcg = mem_cgroup_id_get_online(memcg);
7229 nr_entries = thp_nr_pages(page);
7230 /* Get references for the tail pages, too */
7232 mem_cgroup_id_get_many(swap_memcg, nr_entries - 1);
7233 oldid = swap_cgroup_record(entry, mem_cgroup_id(swap_memcg),
7235 VM_BUG_ON_PAGE(oldid, page);
7236 mod_memcg_state(swap_memcg, MEMCG_SWAP, nr_entries);
7238 page->memcg_data = 0;
7240 if (!mem_cgroup_is_root(memcg))
7241 page_counter_uncharge(&memcg->memory, nr_entries);
7243 if (!cgroup_memory_noswap && memcg != swap_memcg) {
7244 if (!mem_cgroup_is_root(swap_memcg))
7245 page_counter_charge(&swap_memcg->memsw, nr_entries);
7246 page_counter_uncharge(&memcg->memsw, nr_entries);
7250 * Interrupts should be disabled here because the caller holds the
7251 * i_pages lock which is taken with interrupts-off. It is
7252 * important here to have the interrupts disabled because it is the
7253 * only synchronisation we have for updating the per-CPU variables.
7255 VM_BUG_ON(!irqs_disabled());
7256 mem_cgroup_charge_statistics(memcg, page, -nr_entries);
7257 memcg_check_events(memcg, page);
7259 css_put(&memcg->css);
7263 * __mem_cgroup_try_charge_swap - try charging swap space for a page
7264 * @page: page being added to swap
7265 * @entry: swap entry to charge
7267 * Try to charge @page's memcg for the swap space at @entry.
7269 * Returns 0 on success, -ENOMEM on failure.
7271 int __mem_cgroup_try_charge_swap(struct page *page, swp_entry_t entry)
7273 unsigned int nr_pages = thp_nr_pages(page);
7274 struct page_counter *counter;
7275 struct mem_cgroup *memcg;
7276 unsigned short oldid;
7278 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys))
7281 memcg = page_memcg(page);
7283 VM_WARN_ON_ONCE_PAGE(!memcg, page);
7288 memcg_memory_event(memcg, MEMCG_SWAP_FAIL);
7292 memcg = mem_cgroup_id_get_online(memcg);
7294 if (!cgroup_memory_noswap && !mem_cgroup_is_root(memcg) &&
7295 !page_counter_try_charge(&memcg->swap, nr_pages, &counter)) {
7296 memcg_memory_event(memcg, MEMCG_SWAP_MAX);
7297 memcg_memory_event(memcg, MEMCG_SWAP_FAIL);
7298 mem_cgroup_id_put(memcg);
7302 /* Get references for the tail pages, too */
7304 mem_cgroup_id_get_many(memcg, nr_pages - 1);
7305 oldid = swap_cgroup_record(entry, mem_cgroup_id(memcg), nr_pages);
7306 VM_BUG_ON_PAGE(oldid, page);
7307 mod_memcg_state(memcg, MEMCG_SWAP, nr_pages);
7313 * __mem_cgroup_uncharge_swap - uncharge swap space
7314 * @entry: swap entry to uncharge
7315 * @nr_pages: the amount of swap space to uncharge
7317 void __mem_cgroup_uncharge_swap(swp_entry_t entry, unsigned int nr_pages)
7319 struct mem_cgroup *memcg;
7322 id = swap_cgroup_record(entry, 0, nr_pages);
7324 memcg = mem_cgroup_from_id(id);
7326 if (!cgroup_memory_noswap && !mem_cgroup_is_root(memcg)) {
7327 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
7328 page_counter_uncharge(&memcg->swap, nr_pages);
7330 page_counter_uncharge(&memcg->memsw, nr_pages);
7332 mod_memcg_state(memcg, MEMCG_SWAP, -nr_pages);
7333 mem_cgroup_id_put_many(memcg, nr_pages);
7338 long mem_cgroup_get_nr_swap_pages(struct mem_cgroup *memcg)
7340 long nr_swap_pages = get_nr_swap_pages();
7342 if (cgroup_memory_noswap || !cgroup_subsys_on_dfl(memory_cgrp_subsys))
7343 return nr_swap_pages;
7344 for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg))
7345 nr_swap_pages = min_t(long, nr_swap_pages,
7346 READ_ONCE(memcg->swap.max) -
7347 page_counter_read(&memcg->swap));
7348 return nr_swap_pages;
7351 bool mem_cgroup_swap_full(struct page *page)
7353 struct mem_cgroup *memcg;
7355 VM_BUG_ON_PAGE(!PageLocked(page), page);
7359 if (cgroup_memory_noswap || !cgroup_subsys_on_dfl(memory_cgrp_subsys))
7362 memcg = page_memcg(page);
7366 for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg)) {
7367 unsigned long usage = page_counter_read(&memcg->swap);
7369 if (usage * 2 >= READ_ONCE(memcg->swap.high) ||
7370 usage * 2 >= READ_ONCE(memcg->swap.max))
7377 static int __init setup_swap_account(char *s)
7379 if (!strcmp(s, "1"))
7380 cgroup_memory_noswap = false;
7381 else if (!strcmp(s, "0"))
7382 cgroup_memory_noswap = true;
7385 __setup("swapaccount=", setup_swap_account);
7387 static u64 swap_current_read(struct cgroup_subsys_state *css,
7390 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
7392 return (u64)page_counter_read(&memcg->swap) * PAGE_SIZE;
7395 static int swap_high_show(struct seq_file *m, void *v)
7397 return seq_puts_memcg_tunable(m,
7398 READ_ONCE(mem_cgroup_from_seq(m)->swap.high));
7401 static ssize_t swap_high_write(struct kernfs_open_file *of,
7402 char *buf, size_t nbytes, loff_t off)
7404 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
7408 buf = strstrip(buf);
7409 err = page_counter_memparse(buf, "max", &high);
7413 page_counter_set_high(&memcg->swap, high);
7418 static int swap_max_show(struct seq_file *m, void *v)
7420 return seq_puts_memcg_tunable(m,
7421 READ_ONCE(mem_cgroup_from_seq(m)->swap.max));
7424 static ssize_t swap_max_write(struct kernfs_open_file *of,
7425 char *buf, size_t nbytes, loff_t off)
7427 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
7431 buf = strstrip(buf);
7432 err = page_counter_memparse(buf, "max", &max);
7436 xchg(&memcg->swap.max, max);
7441 static int swap_events_show(struct seq_file *m, void *v)
7443 struct mem_cgroup *memcg = mem_cgroup_from_seq(m);
7445 seq_printf(m, "high %lu\n",
7446 atomic_long_read(&memcg->memory_events[MEMCG_SWAP_HIGH]));
7447 seq_printf(m, "max %lu\n",
7448 atomic_long_read(&memcg->memory_events[MEMCG_SWAP_MAX]));
7449 seq_printf(m, "fail %lu\n",
7450 atomic_long_read(&memcg->memory_events[MEMCG_SWAP_FAIL]));
7455 static struct cftype swap_files[] = {
7457 .name = "swap.current",
7458 .flags = CFTYPE_NOT_ON_ROOT,
7459 .read_u64 = swap_current_read,
7462 .name = "swap.high",
7463 .flags = CFTYPE_NOT_ON_ROOT,
7464 .seq_show = swap_high_show,
7465 .write = swap_high_write,
7469 .flags = CFTYPE_NOT_ON_ROOT,
7470 .seq_show = swap_max_show,
7471 .write = swap_max_write,
7474 .name = "swap.events",
7475 .flags = CFTYPE_NOT_ON_ROOT,
7476 .file_offset = offsetof(struct mem_cgroup, swap_events_file),
7477 .seq_show = swap_events_show,
7482 static struct cftype memsw_files[] = {
7484 .name = "memsw.usage_in_bytes",
7485 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE),
7486 .read_u64 = mem_cgroup_read_u64,
7489 .name = "memsw.max_usage_in_bytes",
7490 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE),
7491 .write = mem_cgroup_reset,
7492 .read_u64 = mem_cgroup_read_u64,
7495 .name = "memsw.limit_in_bytes",
7496 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT),
7497 .write = mem_cgroup_write,
7498 .read_u64 = mem_cgroup_read_u64,
7501 .name = "memsw.failcnt",
7502 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT),
7503 .write = mem_cgroup_reset,
7504 .read_u64 = mem_cgroup_read_u64,
7506 { }, /* terminate */
7510 * If mem_cgroup_swap_init() is implemented as a subsys_initcall()
7511 * instead of a core_initcall(), this could mean cgroup_memory_noswap still
7512 * remains set to false even when memcg is disabled via "cgroup_disable=memory"
7513 * boot parameter. This may result in premature OOPS inside
7514 * mem_cgroup_get_nr_swap_pages() function in corner cases.
7516 static int __init mem_cgroup_swap_init(void)
7518 /* No memory control -> no swap control */
7519 if (mem_cgroup_disabled())
7520 cgroup_memory_noswap = true;
7522 if (cgroup_memory_noswap)
7525 WARN_ON(cgroup_add_dfl_cftypes(&memory_cgrp_subsys, swap_files));
7526 WARN_ON(cgroup_add_legacy_cftypes(&memory_cgrp_subsys, memsw_files));
7530 core_initcall(mem_cgroup_swap_init);
7532 #endif /* CONFIG_MEMCG_SWAP */