1 /* memcontrol.c - Memory Controller
3 * Copyright IBM Corporation, 2007
4 * Author Balbir Singh <balbir@linux.vnet.ibm.com>
6 * Copyright 2007 OpenVZ SWsoft Inc
7 * Author: Pavel Emelianov <xemul@openvz.org>
10 * Copyright (C) 2009 Nokia Corporation
11 * Author: Kirill A. Shutemov
13 * Kernel Memory Controller
14 * Copyright (C) 2012 Parallels Inc. and Google Inc.
15 * Authors: Glauber Costa and Suleiman Souhlal
18 * Charge lifetime sanitation
19 * Lockless page tracking & accounting
20 * Unified hierarchy configuration model
21 * Copyright (C) 2015 Red Hat, Inc., Johannes Weiner
23 * This program is free software; you can redistribute it and/or modify
24 * it under the terms of the GNU General Public License as published by
25 * the Free Software Foundation; either version 2 of the License, or
26 * (at your option) any later version.
28 * This program is distributed in the hope that it will be useful,
29 * but WITHOUT ANY WARRANTY; without even the implied warranty of
30 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
31 * GNU General Public License for more details.
34 #include <linux/page_counter.h>
35 #include <linux/memcontrol.h>
36 #include <linux/cgroup.h>
38 #include <linux/sched/mm.h>
39 #include <linux/shmem_fs.h>
40 #include <linux/hugetlb.h>
41 #include <linux/pagemap.h>
42 #include <linux/smp.h>
43 #include <linux/page-flags.h>
44 #include <linux/backing-dev.h>
45 #include <linux/bit_spinlock.h>
46 #include <linux/rcupdate.h>
47 #include <linux/limits.h>
48 #include <linux/export.h>
49 #include <linux/mutex.h>
50 #include <linux/rbtree.h>
51 #include <linux/slab.h>
52 #include <linux/swap.h>
53 #include <linux/swapops.h>
54 #include <linux/spinlock.h>
55 #include <linux/eventfd.h>
56 #include <linux/poll.h>
57 #include <linux/sort.h>
59 #include <linux/seq_file.h>
60 #include <linux/vmpressure.h>
61 #include <linux/mm_inline.h>
62 #include <linux/swap_cgroup.h>
63 #include <linux/cpu.h>
64 #include <linux/oom.h>
65 #include <linux/lockdep.h>
66 #include <linux/file.h>
67 #include <linux/tracehook.h>
73 #include <linux/uaccess.h>
75 #include <trace/events/vmscan.h>
77 struct cgroup_subsys memory_cgrp_subsys __read_mostly;
78 EXPORT_SYMBOL(memory_cgrp_subsys);
80 struct mem_cgroup *root_mem_cgroup __read_mostly;
82 #define MEM_CGROUP_RECLAIM_RETRIES 5
84 /* Socket memory accounting disabled? */
85 static bool cgroup_memory_nosocket;
87 /* Kernel memory accounting disabled? */
88 static bool cgroup_memory_nokmem;
90 /* Whether the swap controller is active */
91 #ifdef CONFIG_MEMCG_SWAP
92 int do_swap_account __read_mostly;
94 #define do_swap_account 0
97 /* Whether legacy memory+swap accounting is active */
98 static bool do_memsw_account(void)
100 return !cgroup_subsys_on_dfl(memory_cgrp_subsys) && do_swap_account;
103 static const char *const mem_cgroup_lru_names[] = {
111 #define THRESHOLDS_EVENTS_TARGET 128
112 #define SOFTLIMIT_EVENTS_TARGET 1024
113 #define NUMAINFO_EVENTS_TARGET 1024
116 * Cgroups above their limits are maintained in a RB-Tree, independent of
117 * their hierarchy representation
120 struct mem_cgroup_tree_per_node {
121 struct rb_root rb_root;
122 struct rb_node *rb_rightmost;
126 struct mem_cgroup_tree {
127 struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES];
130 static struct mem_cgroup_tree soft_limit_tree __read_mostly;
133 struct mem_cgroup_eventfd_list {
134 struct list_head list;
135 struct eventfd_ctx *eventfd;
139 * cgroup_event represents events which userspace want to receive.
141 struct mem_cgroup_event {
143 * memcg which the event belongs to.
145 struct mem_cgroup *memcg;
147 * eventfd to signal userspace about the event.
149 struct eventfd_ctx *eventfd;
151 * Each of these stored in a list by the cgroup.
153 struct list_head list;
155 * register_event() callback will be used to add new userspace
156 * waiter for changes related to this event. Use eventfd_signal()
157 * on eventfd to send notification to userspace.
159 int (*register_event)(struct mem_cgroup *memcg,
160 struct eventfd_ctx *eventfd, const char *args);
162 * unregister_event() callback will be called when userspace closes
163 * the eventfd or on cgroup removing. This callback must be set,
164 * if you want provide notification functionality.
166 void (*unregister_event)(struct mem_cgroup *memcg,
167 struct eventfd_ctx *eventfd);
169 * All fields below needed to unregister event when
170 * userspace closes eventfd.
173 wait_queue_head_t *wqh;
174 wait_queue_entry_t wait;
175 struct work_struct remove;
178 static void mem_cgroup_threshold(struct mem_cgroup *memcg);
179 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg);
181 /* Stuffs for move charges at task migration. */
183 * Types of charges to be moved.
185 #define MOVE_ANON 0x1U
186 #define MOVE_FILE 0x2U
187 #define MOVE_MASK (MOVE_ANON | MOVE_FILE)
189 /* "mc" and its members are protected by cgroup_mutex */
190 static struct move_charge_struct {
191 spinlock_t lock; /* for from, to */
192 struct mm_struct *mm;
193 struct mem_cgroup *from;
194 struct mem_cgroup *to;
196 unsigned long precharge;
197 unsigned long moved_charge;
198 unsigned long moved_swap;
199 struct task_struct *moving_task; /* a task moving charges */
200 wait_queue_head_t waitq; /* a waitq for other context */
202 .lock = __SPIN_LOCK_UNLOCKED(mc.lock),
203 .waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq),
207 * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft
208 * limit reclaim to prevent infinite loops, if they ever occur.
210 #define MEM_CGROUP_MAX_RECLAIM_LOOPS 100
211 #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS 2
214 MEM_CGROUP_CHARGE_TYPE_CACHE = 0,
215 MEM_CGROUP_CHARGE_TYPE_ANON,
216 MEM_CGROUP_CHARGE_TYPE_SWAPOUT, /* for accounting swapcache */
217 MEM_CGROUP_CHARGE_TYPE_DROP, /* a page was unused swap cache */
221 /* for encoding cft->private value on file */
230 #define MEMFILE_PRIVATE(x, val) ((x) << 16 | (val))
231 #define MEMFILE_TYPE(val) ((val) >> 16 & 0xffff)
232 #define MEMFILE_ATTR(val) ((val) & 0xffff)
233 /* Used for OOM nofiier */
234 #define OOM_CONTROL (0)
236 /* Some nice accessors for the vmpressure. */
237 struct vmpressure *memcg_to_vmpressure(struct mem_cgroup *memcg)
240 memcg = root_mem_cgroup;
241 return &memcg->vmpressure;
244 struct cgroup_subsys_state *vmpressure_to_css(struct vmpressure *vmpr)
246 return &container_of(vmpr, struct mem_cgroup, vmpressure)->css;
249 static inline bool mem_cgroup_is_root(struct mem_cgroup *memcg)
251 return (memcg == root_mem_cgroup);
256 * This will be the memcg's index in each cache's ->memcg_params.memcg_caches.
257 * The main reason for not using cgroup id for this:
258 * this works better in sparse environments, where we have a lot of memcgs,
259 * but only a few kmem-limited. Or also, if we have, for instance, 200
260 * memcgs, and none but the 200th is kmem-limited, we'd have to have a
261 * 200 entry array for that.
263 * The current size of the caches array is stored in memcg_nr_cache_ids. It
264 * will double each time we have to increase it.
266 static DEFINE_IDA(memcg_cache_ida);
267 int memcg_nr_cache_ids;
269 /* Protects memcg_nr_cache_ids */
270 static DECLARE_RWSEM(memcg_cache_ids_sem);
272 void memcg_get_cache_ids(void)
274 down_read(&memcg_cache_ids_sem);
277 void memcg_put_cache_ids(void)
279 up_read(&memcg_cache_ids_sem);
283 * MIN_SIZE is different than 1, because we would like to avoid going through
284 * the alloc/free process all the time. In a small machine, 4 kmem-limited
285 * cgroups is a reasonable guess. In the future, it could be a parameter or
286 * tunable, but that is strictly not necessary.
288 * MAX_SIZE should be as large as the number of cgrp_ids. Ideally, we could get
289 * this constant directly from cgroup, but it is understandable that this is
290 * better kept as an internal representation in cgroup.c. In any case, the
291 * cgrp_id space is not getting any smaller, and we don't have to necessarily
292 * increase ours as well if it increases.
294 #define MEMCG_CACHES_MIN_SIZE 4
295 #define MEMCG_CACHES_MAX_SIZE MEM_CGROUP_ID_MAX
298 * A lot of the calls to the cache allocation functions are expected to be
299 * inlined by the compiler. Since the calls to memcg_kmem_get_cache are
300 * conditional to this static branch, we'll have to allow modules that does
301 * kmem_cache_alloc and the such to see this symbol as well
303 DEFINE_STATIC_KEY_FALSE(memcg_kmem_enabled_key);
304 EXPORT_SYMBOL(memcg_kmem_enabled_key);
306 struct workqueue_struct *memcg_kmem_cache_wq;
308 #endif /* !CONFIG_SLOB */
311 * mem_cgroup_css_from_page - css of the memcg associated with a page
312 * @page: page of interest
314 * If memcg is bound to the default hierarchy, css of the memcg associated
315 * with @page is returned. The returned css remains associated with @page
316 * until it is released.
318 * If memcg is bound to a traditional hierarchy, the css of root_mem_cgroup
321 struct cgroup_subsys_state *mem_cgroup_css_from_page(struct page *page)
323 struct mem_cgroup *memcg;
325 memcg = page->mem_cgroup;
327 if (!memcg || !cgroup_subsys_on_dfl(memory_cgrp_subsys))
328 memcg = root_mem_cgroup;
334 * page_cgroup_ino - return inode number of the memcg a page is charged to
337 * Look up the closest online ancestor of the memory cgroup @page is charged to
338 * and return its inode number or 0 if @page is not charged to any cgroup. It
339 * is safe to call this function without holding a reference to @page.
341 * Note, this function is inherently racy, because there is nothing to prevent
342 * the cgroup inode from getting torn down and potentially reallocated a moment
343 * after page_cgroup_ino() returns, so it only should be used by callers that
344 * do not care (such as procfs interfaces).
346 ino_t page_cgroup_ino(struct page *page)
348 struct mem_cgroup *memcg;
349 unsigned long ino = 0;
352 memcg = READ_ONCE(page->mem_cgroup);
353 while (memcg && !(memcg->css.flags & CSS_ONLINE))
354 memcg = parent_mem_cgroup(memcg);
356 ino = cgroup_ino(memcg->css.cgroup);
361 static struct mem_cgroup_per_node *
362 mem_cgroup_page_nodeinfo(struct mem_cgroup *memcg, struct page *page)
364 int nid = page_to_nid(page);
366 return memcg->nodeinfo[nid];
369 static struct mem_cgroup_tree_per_node *
370 soft_limit_tree_node(int nid)
372 return soft_limit_tree.rb_tree_per_node[nid];
375 static struct mem_cgroup_tree_per_node *
376 soft_limit_tree_from_page(struct page *page)
378 int nid = page_to_nid(page);
380 return soft_limit_tree.rb_tree_per_node[nid];
383 static void __mem_cgroup_insert_exceeded(struct mem_cgroup_per_node *mz,
384 struct mem_cgroup_tree_per_node *mctz,
385 unsigned long new_usage_in_excess)
387 struct rb_node **p = &mctz->rb_root.rb_node;
388 struct rb_node *parent = NULL;
389 struct mem_cgroup_per_node *mz_node;
390 bool rightmost = true;
395 mz->usage_in_excess = new_usage_in_excess;
396 if (!mz->usage_in_excess)
400 mz_node = rb_entry(parent, struct mem_cgroup_per_node,
402 if (mz->usage_in_excess < mz_node->usage_in_excess) {
408 * We can't avoid mem cgroups that are over their soft
409 * limit by the same amount
411 else if (mz->usage_in_excess >= mz_node->usage_in_excess)
416 mctz->rb_rightmost = &mz->tree_node;
418 rb_link_node(&mz->tree_node, parent, p);
419 rb_insert_color(&mz->tree_node, &mctz->rb_root);
423 static void __mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
424 struct mem_cgroup_tree_per_node *mctz)
429 if (&mz->tree_node == mctz->rb_rightmost)
430 mctz->rb_rightmost = rb_prev(&mz->tree_node);
432 rb_erase(&mz->tree_node, &mctz->rb_root);
436 static void mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
437 struct mem_cgroup_tree_per_node *mctz)
441 spin_lock_irqsave(&mctz->lock, flags);
442 __mem_cgroup_remove_exceeded(mz, mctz);
443 spin_unlock_irqrestore(&mctz->lock, flags);
446 static unsigned long soft_limit_excess(struct mem_cgroup *memcg)
448 unsigned long nr_pages = page_counter_read(&memcg->memory);
449 unsigned long soft_limit = READ_ONCE(memcg->soft_limit);
450 unsigned long excess = 0;
452 if (nr_pages > soft_limit)
453 excess = nr_pages - soft_limit;
458 static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page)
460 unsigned long excess;
461 struct mem_cgroup_per_node *mz;
462 struct mem_cgroup_tree_per_node *mctz;
464 mctz = soft_limit_tree_from_page(page);
468 * Necessary to update all ancestors when hierarchy is used.
469 * because their event counter is not touched.
471 for (; memcg; memcg = parent_mem_cgroup(memcg)) {
472 mz = mem_cgroup_page_nodeinfo(memcg, page);
473 excess = soft_limit_excess(memcg);
475 * We have to update the tree if mz is on RB-tree or
476 * mem is over its softlimit.
478 if (excess || mz->on_tree) {
481 spin_lock_irqsave(&mctz->lock, flags);
482 /* if on-tree, remove it */
484 __mem_cgroup_remove_exceeded(mz, mctz);
486 * Insert again. mz->usage_in_excess will be updated.
487 * If excess is 0, no tree ops.
489 __mem_cgroup_insert_exceeded(mz, mctz, excess);
490 spin_unlock_irqrestore(&mctz->lock, flags);
495 static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg)
497 struct mem_cgroup_tree_per_node *mctz;
498 struct mem_cgroup_per_node *mz;
502 mz = mem_cgroup_nodeinfo(memcg, nid);
503 mctz = soft_limit_tree_node(nid);
505 mem_cgroup_remove_exceeded(mz, mctz);
509 static struct mem_cgroup_per_node *
510 __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node *mctz)
512 struct mem_cgroup_per_node *mz;
516 if (!mctz->rb_rightmost)
517 goto done; /* Nothing to reclaim from */
519 mz = rb_entry(mctz->rb_rightmost,
520 struct mem_cgroup_per_node, tree_node);
522 * Remove the node now but someone else can add it back,
523 * we will to add it back at the end of reclaim to its correct
524 * position in the tree.
526 __mem_cgroup_remove_exceeded(mz, mctz);
527 if (!soft_limit_excess(mz->memcg) ||
528 !css_tryget_online(&mz->memcg->css))
534 static struct mem_cgroup_per_node *
535 mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_node *mctz)
537 struct mem_cgroup_per_node *mz;
539 spin_lock_irq(&mctz->lock);
540 mz = __mem_cgroup_largest_soft_limit_node(mctz);
541 spin_unlock_irq(&mctz->lock);
545 static unsigned long memcg_sum_events(struct mem_cgroup *memcg,
548 return atomic_long_read(&memcg->events[event]);
551 static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg,
553 bool compound, int nr_pages)
556 * Here, RSS means 'mapped anon' and anon's SwapCache. Shmem/tmpfs is
557 * counted as CACHE even if it's on ANON LRU.
560 __mod_memcg_state(memcg, MEMCG_RSS, nr_pages);
562 __mod_memcg_state(memcg, MEMCG_CACHE, nr_pages);
563 if (PageSwapBacked(page))
564 __mod_memcg_state(memcg, NR_SHMEM, nr_pages);
568 VM_BUG_ON_PAGE(!PageTransHuge(page), page);
569 __mod_memcg_state(memcg, MEMCG_RSS_HUGE, nr_pages);
572 /* pagein of a big page is an event. So, ignore page size */
574 __count_memcg_events(memcg, PGPGIN, 1);
576 __count_memcg_events(memcg, PGPGOUT, 1);
577 nr_pages = -nr_pages; /* for event */
580 __this_cpu_add(memcg->stat_cpu->nr_page_events, nr_pages);
583 unsigned long mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg,
584 int nid, unsigned int lru_mask)
586 struct lruvec *lruvec = mem_cgroup_lruvec(NODE_DATA(nid), memcg);
587 unsigned long nr = 0;
590 VM_BUG_ON((unsigned)nid >= nr_node_ids);
593 if (!(BIT(lru) & lru_mask))
595 nr += mem_cgroup_get_lru_size(lruvec, lru);
600 static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg,
601 unsigned int lru_mask)
603 unsigned long nr = 0;
606 for_each_node_state(nid, N_MEMORY)
607 nr += mem_cgroup_node_nr_lru_pages(memcg, nid, lru_mask);
611 static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg,
612 enum mem_cgroup_events_target target)
614 unsigned long val, next;
616 val = __this_cpu_read(memcg->stat_cpu->nr_page_events);
617 next = __this_cpu_read(memcg->stat_cpu->targets[target]);
618 /* from time_after() in jiffies.h */
619 if ((long)(next - val) < 0) {
621 case MEM_CGROUP_TARGET_THRESH:
622 next = val + THRESHOLDS_EVENTS_TARGET;
624 case MEM_CGROUP_TARGET_SOFTLIMIT:
625 next = val + SOFTLIMIT_EVENTS_TARGET;
627 case MEM_CGROUP_TARGET_NUMAINFO:
628 next = val + NUMAINFO_EVENTS_TARGET;
633 __this_cpu_write(memcg->stat_cpu->targets[target], next);
640 * Check events in order.
643 static void memcg_check_events(struct mem_cgroup *memcg, struct page *page)
645 /* threshold event is triggered in finer grain than soft limit */
646 if (unlikely(mem_cgroup_event_ratelimit(memcg,
647 MEM_CGROUP_TARGET_THRESH))) {
649 bool do_numainfo __maybe_unused;
651 do_softlimit = mem_cgroup_event_ratelimit(memcg,
652 MEM_CGROUP_TARGET_SOFTLIMIT);
654 do_numainfo = mem_cgroup_event_ratelimit(memcg,
655 MEM_CGROUP_TARGET_NUMAINFO);
657 mem_cgroup_threshold(memcg);
658 if (unlikely(do_softlimit))
659 mem_cgroup_update_tree(memcg, page);
661 if (unlikely(do_numainfo))
662 atomic_inc(&memcg->numainfo_events);
667 struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p)
670 * mm_update_next_owner() may clear mm->owner to NULL
671 * if it races with swapoff, page migration, etc.
672 * So this can be called with p == NULL.
677 return mem_cgroup_from_css(task_css(p, memory_cgrp_id));
679 EXPORT_SYMBOL(mem_cgroup_from_task);
681 static struct mem_cgroup *get_mem_cgroup_from_mm(struct mm_struct *mm)
683 struct mem_cgroup *memcg = NULL;
688 * Page cache insertions can happen withou an
689 * actual mm context, e.g. during disk probing
690 * on boot, loopback IO, acct() writes etc.
693 memcg = root_mem_cgroup;
695 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
696 if (unlikely(!memcg))
697 memcg = root_mem_cgroup;
699 } while (!css_tryget(&memcg->css));
705 * mem_cgroup_iter - iterate over memory cgroup hierarchy
706 * @root: hierarchy root
707 * @prev: previously returned memcg, NULL on first invocation
708 * @reclaim: cookie for shared reclaim walks, NULL for full walks
710 * Returns references to children of the hierarchy below @root, or
711 * @root itself, or %NULL after a full round-trip.
713 * Caller must pass the return value in @prev on subsequent
714 * invocations for reference counting, or use mem_cgroup_iter_break()
715 * to cancel a hierarchy walk before the round-trip is complete.
717 * Reclaimers can specify a zone and a priority level in @reclaim to
718 * divide up the memcgs in the hierarchy among all concurrent
719 * reclaimers operating on the same zone and priority.
721 struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root,
722 struct mem_cgroup *prev,
723 struct mem_cgroup_reclaim_cookie *reclaim)
725 struct mem_cgroup_reclaim_iter *uninitialized_var(iter);
726 struct cgroup_subsys_state *css = NULL;
727 struct mem_cgroup *memcg = NULL;
728 struct mem_cgroup *pos = NULL;
730 if (mem_cgroup_disabled())
734 root = root_mem_cgroup;
736 if (prev && !reclaim)
739 if (!root->use_hierarchy && root != root_mem_cgroup) {
748 struct mem_cgroup_per_node *mz;
750 mz = mem_cgroup_nodeinfo(root, reclaim->pgdat->node_id);
751 iter = &mz->iter[reclaim->priority];
753 if (prev && reclaim->generation != iter->generation)
757 pos = READ_ONCE(iter->position);
758 if (!pos || css_tryget(&pos->css))
761 * css reference reached zero, so iter->position will
762 * be cleared by ->css_released. However, we should not
763 * rely on this happening soon, because ->css_released
764 * is called from a work queue, and by busy-waiting we
765 * might block it. So we clear iter->position right
768 (void)cmpxchg(&iter->position, pos, NULL);
776 css = css_next_descendant_pre(css, &root->css);
779 * Reclaimers share the hierarchy walk, and a
780 * new one might jump in right at the end of
781 * the hierarchy - make sure they see at least
782 * one group and restart from the beginning.
790 * Verify the css and acquire a reference. The root
791 * is provided by the caller, so we know it's alive
792 * and kicking, and don't take an extra reference.
794 memcg = mem_cgroup_from_css(css);
796 if (css == &root->css)
807 * The position could have already been updated by a competing
808 * thread, so check that the value hasn't changed since we read
809 * it to avoid reclaiming from the same cgroup twice.
811 (void)cmpxchg(&iter->position, pos, memcg);
819 reclaim->generation = iter->generation;
825 if (prev && prev != root)
832 * mem_cgroup_iter_break - abort a hierarchy walk prematurely
833 * @root: hierarchy root
834 * @prev: last visited hierarchy member as returned by mem_cgroup_iter()
836 void mem_cgroup_iter_break(struct mem_cgroup *root,
837 struct mem_cgroup *prev)
840 root = root_mem_cgroup;
841 if (prev && prev != root)
845 static void __invalidate_reclaim_iterators(struct mem_cgroup *from,
846 struct mem_cgroup *dead_memcg)
848 struct mem_cgroup_reclaim_iter *iter;
849 struct mem_cgroup_per_node *mz;
854 mz = mem_cgroup_nodeinfo(from, nid);
855 for (i = 0; i <= DEF_PRIORITY; i++) {
857 cmpxchg(&iter->position,
863 static void invalidate_reclaim_iterators(struct mem_cgroup *dead_memcg)
865 struct mem_cgroup *memcg = dead_memcg;
866 struct mem_cgroup *last;
869 __invalidate_reclaim_iterators(memcg, dead_memcg);
871 } while ((memcg = parent_mem_cgroup(memcg)));
874 * When cgruop1 non-hierarchy mode is used,
875 * parent_mem_cgroup() does not walk all the way up to the
876 * cgroup root (root_mem_cgroup). So we have to handle
877 * dead_memcg from cgroup root separately.
879 if (last != root_mem_cgroup)
880 __invalidate_reclaim_iterators(root_mem_cgroup,
885 * Iteration constructs for visiting all cgroups (under a tree). If
886 * loops are exited prematurely (break), mem_cgroup_iter_break() must
887 * be used for reference counting.
889 #define for_each_mem_cgroup_tree(iter, root) \
890 for (iter = mem_cgroup_iter(root, NULL, NULL); \
892 iter = mem_cgroup_iter(root, iter, NULL))
894 #define for_each_mem_cgroup(iter) \
895 for (iter = mem_cgroup_iter(NULL, NULL, NULL); \
897 iter = mem_cgroup_iter(NULL, iter, NULL))
900 * mem_cgroup_scan_tasks - iterate over tasks of a memory cgroup hierarchy
901 * @memcg: hierarchy root
902 * @fn: function to call for each task
903 * @arg: argument passed to @fn
905 * This function iterates over tasks attached to @memcg or to any of its
906 * descendants and calls @fn for each task. If @fn returns a non-zero
907 * value, the function breaks the iteration loop and returns the value.
908 * Otherwise, it will iterate over all tasks and return 0.
910 * This function must not be called for the root memory cgroup.
912 int mem_cgroup_scan_tasks(struct mem_cgroup *memcg,
913 int (*fn)(struct task_struct *, void *), void *arg)
915 struct mem_cgroup *iter;
918 BUG_ON(memcg == root_mem_cgroup);
920 for_each_mem_cgroup_tree(iter, memcg) {
921 struct css_task_iter it;
922 struct task_struct *task;
924 css_task_iter_start(&iter->css, 0, &it);
925 while (!ret && (task = css_task_iter_next(&it)))
927 css_task_iter_end(&it);
929 mem_cgroup_iter_break(memcg, iter);
937 * mem_cgroup_page_lruvec - return lruvec for isolating/putting an LRU page
939 * @zone: zone of the page
941 * This function is only safe when following the LRU page isolation
942 * and putback protocol: the LRU lock must be held, and the page must
943 * either be PageLRU() or the caller must have isolated/allocated it.
945 struct lruvec *mem_cgroup_page_lruvec(struct page *page, struct pglist_data *pgdat)
947 struct mem_cgroup_per_node *mz;
948 struct mem_cgroup *memcg;
949 struct lruvec *lruvec;
951 if (mem_cgroup_disabled()) {
952 lruvec = &pgdat->lruvec;
956 memcg = page->mem_cgroup;
958 * Swapcache readahead pages are added to the LRU - and
959 * possibly migrated - before they are charged.
962 memcg = root_mem_cgroup;
964 mz = mem_cgroup_page_nodeinfo(memcg, page);
965 lruvec = &mz->lruvec;
968 * Since a node can be onlined after the mem_cgroup was created,
969 * we have to be prepared to initialize lruvec->zone here;
970 * and if offlined then reonlined, we need to reinitialize it.
972 if (unlikely(lruvec->pgdat != pgdat))
973 lruvec->pgdat = pgdat;
978 * mem_cgroup_update_lru_size - account for adding or removing an lru page
979 * @lruvec: mem_cgroup per zone lru vector
980 * @lru: index of lru list the page is sitting on
981 * @zid: zone id of the accounted pages
982 * @nr_pages: positive when adding or negative when removing
984 * This function must be called under lru_lock, just before a page is added
985 * to or just after a page is removed from an lru list (that ordering being
986 * so as to allow it to check that lru_size 0 is consistent with list_empty).
988 void mem_cgroup_update_lru_size(struct lruvec *lruvec, enum lru_list lru,
989 int zid, int nr_pages)
991 struct mem_cgroup_per_node *mz;
992 unsigned long *lru_size;
995 if (mem_cgroup_disabled())
998 mz = container_of(lruvec, struct mem_cgroup_per_node, lruvec);
999 lru_size = &mz->lru_zone_size[zid][lru];
1002 *lru_size += nr_pages;
1005 if (WARN_ONCE(size < 0,
1006 "%s(%p, %d, %d): lru_size %ld\n",
1007 __func__, lruvec, lru, nr_pages, size)) {
1013 *lru_size += nr_pages;
1016 bool task_in_mem_cgroup(struct task_struct *task, struct mem_cgroup *memcg)
1018 struct mem_cgroup *task_memcg;
1019 struct task_struct *p;
1022 p = find_lock_task_mm(task);
1024 task_memcg = get_mem_cgroup_from_mm(p->mm);
1028 * All threads may have already detached their mm's, but the oom
1029 * killer still needs to detect if they have already been oom
1030 * killed to prevent needlessly killing additional tasks.
1033 task_memcg = mem_cgroup_from_task(task);
1034 css_get(&task_memcg->css);
1037 ret = mem_cgroup_is_descendant(task_memcg, memcg);
1038 css_put(&task_memcg->css);
1043 * mem_cgroup_margin - calculate chargeable space of a memory cgroup
1044 * @memcg: the memory cgroup
1046 * Returns the maximum amount of memory @mem can be charged with, in
1049 static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg)
1051 unsigned long margin = 0;
1052 unsigned long count;
1053 unsigned long limit;
1055 count = page_counter_read(&memcg->memory);
1056 limit = READ_ONCE(memcg->memory.limit);
1058 margin = limit - count;
1060 if (do_memsw_account()) {
1061 count = page_counter_read(&memcg->memsw);
1062 limit = READ_ONCE(memcg->memsw.limit);
1064 margin = min(margin, limit - count);
1073 * A routine for checking "mem" is under move_account() or not.
1075 * Checking a cgroup is mc.from or mc.to or under hierarchy of
1076 * moving cgroups. This is for waiting at high-memory pressure
1079 static bool mem_cgroup_under_move(struct mem_cgroup *memcg)
1081 struct mem_cgroup *from;
1082 struct mem_cgroup *to;
1085 * Unlike task_move routines, we access mc.to, mc.from not under
1086 * mutual exclusion by cgroup_mutex. Here, we take spinlock instead.
1088 spin_lock(&mc.lock);
1094 ret = mem_cgroup_is_descendant(from, memcg) ||
1095 mem_cgroup_is_descendant(to, memcg);
1097 spin_unlock(&mc.lock);
1101 static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg)
1103 if (mc.moving_task && current != mc.moving_task) {
1104 if (mem_cgroup_under_move(memcg)) {
1106 prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE);
1107 /* moving charge context might have finished. */
1110 finish_wait(&mc.waitq, &wait);
1117 unsigned int memcg1_stats[] = {
1128 static const char *const memcg1_stat_names[] = {
1139 #define K(x) ((x) << (PAGE_SHIFT-10))
1141 * mem_cgroup_print_oom_info: Print OOM information relevant to memory controller.
1142 * @memcg: The memory cgroup that went over limit
1143 * @p: Task that is going to be killed
1145 * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is
1148 void mem_cgroup_print_oom_info(struct mem_cgroup *memcg, struct task_struct *p)
1150 struct mem_cgroup *iter;
1156 pr_info("Task in ");
1157 pr_cont_cgroup_path(task_cgroup(p, memory_cgrp_id));
1158 pr_cont(" killed as a result of limit of ");
1160 pr_info("Memory limit reached of cgroup ");
1163 pr_cont_cgroup_path(memcg->css.cgroup);
1168 pr_info("memory: usage %llukB, limit %llukB, failcnt %lu\n",
1169 K((u64)page_counter_read(&memcg->memory)),
1170 K((u64)memcg->memory.limit), memcg->memory.failcnt);
1171 pr_info("memory+swap: usage %llukB, limit %llukB, failcnt %lu\n",
1172 K((u64)page_counter_read(&memcg->memsw)),
1173 K((u64)memcg->memsw.limit), memcg->memsw.failcnt);
1174 pr_info("kmem: usage %llukB, limit %llukB, failcnt %lu\n",
1175 K((u64)page_counter_read(&memcg->kmem)),
1176 K((u64)memcg->kmem.limit), memcg->kmem.failcnt);
1178 for_each_mem_cgroup_tree(iter, memcg) {
1179 pr_info("Memory cgroup stats for ");
1180 pr_cont_cgroup_path(iter->css.cgroup);
1183 for (i = 0; i < ARRAY_SIZE(memcg1_stats); i++) {
1184 if (memcg1_stats[i] == MEMCG_SWAP && !do_swap_account)
1186 pr_cont(" %s:%luKB", memcg1_stat_names[i],
1187 K(memcg_page_state(iter, memcg1_stats[i])));
1190 for (i = 0; i < NR_LRU_LISTS; i++)
1191 pr_cont(" %s:%luKB", mem_cgroup_lru_names[i],
1192 K(mem_cgroup_nr_lru_pages(iter, BIT(i))));
1199 * This function returns the number of memcg under hierarchy tree. Returns
1200 * 1(self count) if no children.
1202 static int mem_cgroup_count_children(struct mem_cgroup *memcg)
1205 struct mem_cgroup *iter;
1207 for_each_mem_cgroup_tree(iter, memcg)
1213 * Return the memory (and swap, if configured) limit for a memcg.
1215 unsigned long mem_cgroup_get_limit(struct mem_cgroup *memcg)
1217 unsigned long limit;
1219 limit = memcg->memory.limit;
1220 if (mem_cgroup_swappiness(memcg)) {
1221 unsigned long memsw_limit;
1222 unsigned long swap_limit;
1224 memsw_limit = memcg->memsw.limit;
1225 swap_limit = memcg->swap.limit;
1226 swap_limit = min(swap_limit, (unsigned long)total_swap_pages);
1227 limit = min(limit + swap_limit, memsw_limit);
1232 static bool mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask,
1235 struct oom_control oc = {
1239 .gfp_mask = gfp_mask,
1244 mutex_lock(&oom_lock);
1245 ret = out_of_memory(&oc);
1246 mutex_unlock(&oom_lock);
1250 #if MAX_NUMNODES > 1
1253 * test_mem_cgroup_node_reclaimable
1254 * @memcg: the target memcg
1255 * @nid: the node ID to be checked.
1256 * @noswap : specify true here if the user wants flle only information.
1258 * This function returns whether the specified memcg contains any
1259 * reclaimable pages on a node. Returns true if there are any reclaimable
1260 * pages in the node.
1262 static bool test_mem_cgroup_node_reclaimable(struct mem_cgroup *memcg,
1263 int nid, bool noswap)
1265 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_FILE))
1267 if (noswap || !total_swap_pages)
1269 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_ANON))
1276 * Always updating the nodemask is not very good - even if we have an empty
1277 * list or the wrong list here, we can start from some node and traverse all
1278 * nodes based on the zonelist. So update the list loosely once per 10 secs.
1281 static void mem_cgroup_may_update_nodemask(struct mem_cgroup *memcg)
1285 * numainfo_events > 0 means there was at least NUMAINFO_EVENTS_TARGET
1286 * pagein/pageout changes since the last update.
1288 if (!atomic_read(&memcg->numainfo_events))
1290 if (atomic_inc_return(&memcg->numainfo_updating) > 1)
1293 /* make a nodemask where this memcg uses memory from */
1294 memcg->scan_nodes = node_states[N_MEMORY];
1296 for_each_node_mask(nid, node_states[N_MEMORY]) {
1298 if (!test_mem_cgroup_node_reclaimable(memcg, nid, false))
1299 node_clear(nid, memcg->scan_nodes);
1302 atomic_set(&memcg->numainfo_events, 0);
1303 atomic_set(&memcg->numainfo_updating, 0);
1307 * Selecting a node where we start reclaim from. Because what we need is just
1308 * reducing usage counter, start from anywhere is O,K. Considering
1309 * memory reclaim from current node, there are pros. and cons.
1311 * Freeing memory from current node means freeing memory from a node which
1312 * we'll use or we've used. So, it may make LRU bad. And if several threads
1313 * hit limits, it will see a contention on a node. But freeing from remote
1314 * node means more costs for memory reclaim because of memory latency.
1316 * Now, we use round-robin. Better algorithm is welcomed.
1318 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1322 mem_cgroup_may_update_nodemask(memcg);
1323 node = memcg->last_scanned_node;
1325 node = next_node_in(node, memcg->scan_nodes);
1327 * mem_cgroup_may_update_nodemask might have seen no reclaimmable pages
1328 * last time it really checked all the LRUs due to rate limiting.
1329 * Fallback to the current node in that case for simplicity.
1331 if (unlikely(node == MAX_NUMNODES))
1332 node = numa_node_id();
1334 memcg->last_scanned_node = node;
1338 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1344 static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg,
1347 unsigned long *total_scanned)
1349 struct mem_cgroup *victim = NULL;
1352 unsigned long excess;
1353 unsigned long nr_scanned;
1354 struct mem_cgroup_reclaim_cookie reclaim = {
1359 excess = soft_limit_excess(root_memcg);
1362 victim = mem_cgroup_iter(root_memcg, victim, &reclaim);
1367 * If we have not been able to reclaim
1368 * anything, it might because there are
1369 * no reclaimable pages under this hierarchy
1374 * We want to do more targeted reclaim.
1375 * excess >> 2 is not to excessive so as to
1376 * reclaim too much, nor too less that we keep
1377 * coming back to reclaim from this cgroup
1379 if (total >= (excess >> 2) ||
1380 (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS))
1385 total += mem_cgroup_shrink_node(victim, gfp_mask, false,
1386 pgdat, &nr_scanned);
1387 *total_scanned += nr_scanned;
1388 if (!soft_limit_excess(root_memcg))
1391 mem_cgroup_iter_break(root_memcg, victim);
1395 #ifdef CONFIG_LOCKDEP
1396 static struct lockdep_map memcg_oom_lock_dep_map = {
1397 .name = "memcg_oom_lock",
1401 static DEFINE_SPINLOCK(memcg_oom_lock);
1404 * Check OOM-Killer is already running under our hierarchy.
1405 * If someone is running, return false.
1407 static bool mem_cgroup_oom_trylock(struct mem_cgroup *memcg)
1409 struct mem_cgroup *iter, *failed = NULL;
1411 spin_lock(&memcg_oom_lock);
1413 for_each_mem_cgroup_tree(iter, memcg) {
1414 if (iter->oom_lock) {
1416 * this subtree of our hierarchy is already locked
1417 * so we cannot give a lock.
1420 mem_cgroup_iter_break(memcg, iter);
1423 iter->oom_lock = true;
1428 * OK, we failed to lock the whole subtree so we have
1429 * to clean up what we set up to the failing subtree
1431 for_each_mem_cgroup_tree(iter, memcg) {
1432 if (iter == failed) {
1433 mem_cgroup_iter_break(memcg, iter);
1436 iter->oom_lock = false;
1439 mutex_acquire(&memcg_oom_lock_dep_map, 0, 1, _RET_IP_);
1441 spin_unlock(&memcg_oom_lock);
1446 static void mem_cgroup_oom_unlock(struct mem_cgroup *memcg)
1448 struct mem_cgroup *iter;
1450 spin_lock(&memcg_oom_lock);
1451 mutex_release(&memcg_oom_lock_dep_map, 1, _RET_IP_);
1452 for_each_mem_cgroup_tree(iter, memcg)
1453 iter->oom_lock = false;
1454 spin_unlock(&memcg_oom_lock);
1457 static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg)
1459 struct mem_cgroup *iter;
1461 spin_lock(&memcg_oom_lock);
1462 for_each_mem_cgroup_tree(iter, memcg)
1464 spin_unlock(&memcg_oom_lock);
1467 static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg)
1469 struct mem_cgroup *iter;
1472 * When a new child is created while the hierarchy is under oom,
1473 * mem_cgroup_oom_lock() may not be called. Watch for underflow.
1475 spin_lock(&memcg_oom_lock);
1476 for_each_mem_cgroup_tree(iter, memcg)
1477 if (iter->under_oom > 0)
1479 spin_unlock(&memcg_oom_lock);
1482 static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq);
1484 struct oom_wait_info {
1485 struct mem_cgroup *memcg;
1486 wait_queue_entry_t wait;
1489 static int memcg_oom_wake_function(wait_queue_entry_t *wait,
1490 unsigned mode, int sync, void *arg)
1492 struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg;
1493 struct mem_cgroup *oom_wait_memcg;
1494 struct oom_wait_info *oom_wait_info;
1496 oom_wait_info = container_of(wait, struct oom_wait_info, wait);
1497 oom_wait_memcg = oom_wait_info->memcg;
1499 if (!mem_cgroup_is_descendant(wake_memcg, oom_wait_memcg) &&
1500 !mem_cgroup_is_descendant(oom_wait_memcg, wake_memcg))
1502 return autoremove_wake_function(wait, mode, sync, arg);
1505 static void memcg_oom_recover(struct mem_cgroup *memcg)
1508 * For the following lockless ->under_oom test, the only required
1509 * guarantee is that it must see the state asserted by an OOM when
1510 * this function is called as a result of userland actions
1511 * triggered by the notification of the OOM. This is trivially
1512 * achieved by invoking mem_cgroup_mark_under_oom() before
1513 * triggering notification.
1515 if (memcg && memcg->under_oom)
1516 __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg);
1519 static void mem_cgroup_oom(struct mem_cgroup *memcg, gfp_t mask, int order)
1521 if (!current->memcg_may_oom)
1524 * We are in the middle of the charge context here, so we
1525 * don't want to block when potentially sitting on a callstack
1526 * that holds all kinds of filesystem and mm locks.
1528 * Also, the caller may handle a failed allocation gracefully
1529 * (like optional page cache readahead) and so an OOM killer
1530 * invocation might not even be necessary.
1532 * That's why we don't do anything here except remember the
1533 * OOM context and then deal with it at the end of the page
1534 * fault when the stack is unwound, the locks are released,
1535 * and when we know whether the fault was overall successful.
1537 css_get(&memcg->css);
1538 current->memcg_in_oom = memcg;
1539 current->memcg_oom_gfp_mask = mask;
1540 current->memcg_oom_order = order;
1544 * mem_cgroup_oom_synchronize - complete memcg OOM handling
1545 * @handle: actually kill/wait or just clean up the OOM state
1547 * This has to be called at the end of a page fault if the memcg OOM
1548 * handler was enabled.
1550 * Memcg supports userspace OOM handling where failed allocations must
1551 * sleep on a waitqueue until the userspace task resolves the
1552 * situation. Sleeping directly in the charge context with all kinds
1553 * of locks held is not a good idea, instead we remember an OOM state
1554 * in the task and mem_cgroup_oom_synchronize() has to be called at
1555 * the end of the page fault to complete the OOM handling.
1557 * Returns %true if an ongoing memcg OOM situation was detected and
1558 * completed, %false otherwise.
1560 bool mem_cgroup_oom_synchronize(bool handle)
1562 struct mem_cgroup *memcg = current->memcg_in_oom;
1563 struct oom_wait_info owait;
1566 /* OOM is global, do not handle */
1573 owait.memcg = memcg;
1574 owait.wait.flags = 0;
1575 owait.wait.func = memcg_oom_wake_function;
1576 owait.wait.private = current;
1577 INIT_LIST_HEAD(&owait.wait.entry);
1579 prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE);
1580 mem_cgroup_mark_under_oom(memcg);
1582 locked = mem_cgroup_oom_trylock(memcg);
1585 mem_cgroup_oom_notify(memcg);
1587 if (locked && !memcg->oom_kill_disable) {
1588 mem_cgroup_unmark_under_oom(memcg);
1589 finish_wait(&memcg_oom_waitq, &owait.wait);
1590 mem_cgroup_out_of_memory(memcg, current->memcg_oom_gfp_mask,
1591 current->memcg_oom_order);
1594 mem_cgroup_unmark_under_oom(memcg);
1595 finish_wait(&memcg_oom_waitq, &owait.wait);
1599 mem_cgroup_oom_unlock(memcg);
1601 * There is no guarantee that an OOM-lock contender
1602 * sees the wakeups triggered by the OOM kill
1603 * uncharges. Wake any sleepers explicitely.
1605 memcg_oom_recover(memcg);
1608 current->memcg_in_oom = NULL;
1609 css_put(&memcg->css);
1614 * lock_page_memcg - lock a page->mem_cgroup binding
1617 * This function protects unlocked LRU pages from being moved to
1620 * It ensures lifetime of the returned memcg. Caller is responsible
1621 * for the lifetime of the page; __unlock_page_memcg() is available
1622 * when @page might get freed inside the locked section.
1624 struct mem_cgroup *lock_page_memcg(struct page *page)
1626 struct mem_cgroup *memcg;
1627 unsigned long flags;
1630 * The RCU lock is held throughout the transaction. The fast
1631 * path can get away without acquiring the memcg->move_lock
1632 * because page moving starts with an RCU grace period.
1634 * The RCU lock also protects the memcg from being freed when
1635 * the page state that is going to change is the only thing
1636 * preventing the page itself from being freed. E.g. writeback
1637 * doesn't hold a page reference and relies on PG_writeback to
1638 * keep off truncation, migration and so forth.
1642 if (mem_cgroup_disabled())
1645 memcg = page->mem_cgroup;
1646 if (unlikely(!memcg))
1649 if (atomic_read(&memcg->moving_account) <= 0)
1652 spin_lock_irqsave(&memcg->move_lock, flags);
1653 if (memcg != page->mem_cgroup) {
1654 spin_unlock_irqrestore(&memcg->move_lock, flags);
1659 * When charge migration first begins, we can have locked and
1660 * unlocked page stat updates happening concurrently. Track
1661 * the task who has the lock for unlock_page_memcg().
1663 memcg->move_lock_task = current;
1664 memcg->move_lock_flags = flags;
1668 EXPORT_SYMBOL(lock_page_memcg);
1671 * __unlock_page_memcg - unlock and unpin a memcg
1674 * Unlock and unpin a memcg returned by lock_page_memcg().
1676 void __unlock_page_memcg(struct mem_cgroup *memcg)
1678 if (memcg && memcg->move_lock_task == current) {
1679 unsigned long flags = memcg->move_lock_flags;
1681 memcg->move_lock_task = NULL;
1682 memcg->move_lock_flags = 0;
1684 spin_unlock_irqrestore(&memcg->move_lock, flags);
1691 * unlock_page_memcg - unlock a page->mem_cgroup binding
1694 void unlock_page_memcg(struct page *page)
1696 __unlock_page_memcg(page->mem_cgroup);
1698 EXPORT_SYMBOL(unlock_page_memcg);
1700 struct memcg_stock_pcp {
1701 struct mem_cgroup *cached; /* this never be root cgroup */
1702 unsigned int nr_pages;
1703 struct work_struct work;
1704 unsigned long flags;
1705 #define FLUSHING_CACHED_CHARGE 0
1707 static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock);
1708 static DEFINE_MUTEX(percpu_charge_mutex);
1711 * consume_stock: Try to consume stocked charge on this cpu.
1712 * @memcg: memcg to consume from.
1713 * @nr_pages: how many pages to charge.
1715 * The charges will only happen if @memcg matches the current cpu's memcg
1716 * stock, and at least @nr_pages are available in that stock. Failure to
1717 * service an allocation will refill the stock.
1719 * returns true if successful, false otherwise.
1721 static bool consume_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
1723 struct memcg_stock_pcp *stock;
1724 unsigned long flags;
1727 if (nr_pages > MEMCG_CHARGE_BATCH)
1730 local_irq_save(flags);
1732 stock = this_cpu_ptr(&memcg_stock);
1733 if (memcg == stock->cached && stock->nr_pages >= nr_pages) {
1734 stock->nr_pages -= nr_pages;
1738 local_irq_restore(flags);
1744 * Returns stocks cached in percpu and reset cached information.
1746 static void drain_stock(struct memcg_stock_pcp *stock)
1748 struct mem_cgroup *old = stock->cached;
1750 if (stock->nr_pages) {
1751 page_counter_uncharge(&old->memory, stock->nr_pages);
1752 if (do_memsw_account())
1753 page_counter_uncharge(&old->memsw, stock->nr_pages);
1754 css_put_many(&old->css, stock->nr_pages);
1755 stock->nr_pages = 0;
1757 stock->cached = NULL;
1760 static void drain_local_stock(struct work_struct *dummy)
1762 struct memcg_stock_pcp *stock;
1763 unsigned long flags;
1766 * The only protection from memory hotplug vs. drain_stock races is
1767 * that we always operate on local CPU stock here with IRQ disabled
1769 local_irq_save(flags);
1771 stock = this_cpu_ptr(&memcg_stock);
1773 clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags);
1775 local_irq_restore(flags);
1779 * Cache charges(val) to local per_cpu area.
1780 * This will be consumed by consume_stock() function, later.
1782 static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
1784 struct memcg_stock_pcp *stock;
1785 unsigned long flags;
1787 local_irq_save(flags);
1789 stock = this_cpu_ptr(&memcg_stock);
1790 if (stock->cached != memcg) { /* reset if necessary */
1792 stock->cached = memcg;
1794 stock->nr_pages += nr_pages;
1796 if (stock->nr_pages > MEMCG_CHARGE_BATCH)
1799 local_irq_restore(flags);
1803 * Drains all per-CPU charge caches for given root_memcg resp. subtree
1804 * of the hierarchy under it.
1806 static void drain_all_stock(struct mem_cgroup *root_memcg)
1810 /* If someone's already draining, avoid adding running more workers. */
1811 if (!mutex_trylock(&percpu_charge_mutex))
1814 * Notify other cpus that system-wide "drain" is running
1815 * We do not care about races with the cpu hotplug because cpu down
1816 * as well as workers from this path always operate on the local
1817 * per-cpu data. CPU up doesn't touch memcg_stock at all.
1820 for_each_online_cpu(cpu) {
1821 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
1822 struct mem_cgroup *memcg;
1824 memcg = stock->cached;
1825 if (!memcg || !stock->nr_pages || !css_tryget(&memcg->css))
1827 if (!mem_cgroup_is_descendant(memcg, root_memcg)) {
1828 css_put(&memcg->css);
1831 if (!test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) {
1833 drain_local_stock(&stock->work);
1835 schedule_work_on(cpu, &stock->work);
1837 css_put(&memcg->css);
1840 mutex_unlock(&percpu_charge_mutex);
1843 static int memcg_hotplug_cpu_dead(unsigned int cpu)
1845 struct memcg_stock_pcp *stock;
1846 struct mem_cgroup *memcg;
1848 stock = &per_cpu(memcg_stock, cpu);
1851 for_each_mem_cgroup(memcg) {
1854 for (i = 0; i < MEMCG_NR_STAT; i++) {
1858 x = this_cpu_xchg(memcg->stat_cpu->count[i], 0);
1860 atomic_long_add(x, &memcg->stat[i]);
1862 if (i >= NR_VM_NODE_STAT_ITEMS)
1865 for_each_node(nid) {
1866 struct mem_cgroup_per_node *pn;
1868 pn = mem_cgroup_nodeinfo(memcg, nid);
1869 x = this_cpu_xchg(pn->lruvec_stat_cpu->count[i], 0);
1871 atomic_long_add(x, &pn->lruvec_stat[i]);
1875 for (i = 0; i < NR_VM_EVENT_ITEMS; i++) {
1878 x = this_cpu_xchg(memcg->stat_cpu->events[i], 0);
1880 atomic_long_add(x, &memcg->events[i]);
1887 static void reclaim_high(struct mem_cgroup *memcg,
1888 unsigned int nr_pages,
1892 if (page_counter_read(&memcg->memory) <= memcg->high)
1894 memcg_memory_event(memcg, MEMCG_HIGH);
1895 try_to_free_mem_cgroup_pages(memcg, nr_pages, gfp_mask, true);
1896 } while ((memcg = parent_mem_cgroup(memcg)));
1899 static void high_work_func(struct work_struct *work)
1901 struct mem_cgroup *memcg;
1903 memcg = container_of(work, struct mem_cgroup, high_work);
1904 reclaim_high(memcg, MEMCG_CHARGE_BATCH, GFP_KERNEL);
1908 * Scheduled by try_charge() to be executed from the userland return path
1909 * and reclaims memory over the high limit.
1911 void mem_cgroup_handle_over_high(void)
1913 unsigned int nr_pages = current->memcg_nr_pages_over_high;
1914 struct mem_cgroup *memcg;
1916 if (likely(!nr_pages))
1919 memcg = get_mem_cgroup_from_mm(current->mm);
1920 reclaim_high(memcg, nr_pages, GFP_KERNEL);
1921 css_put(&memcg->css);
1922 current->memcg_nr_pages_over_high = 0;
1925 static int try_charge(struct mem_cgroup *memcg, gfp_t gfp_mask,
1926 unsigned int nr_pages)
1928 unsigned int batch = max(MEMCG_CHARGE_BATCH, nr_pages);
1929 int nr_retries = MEM_CGROUP_RECLAIM_RETRIES;
1930 struct mem_cgroup *mem_over_limit;
1931 struct page_counter *counter;
1932 unsigned long nr_reclaimed;
1933 bool may_swap = true;
1934 bool drained = false;
1936 if (mem_cgroup_is_root(memcg))
1939 if (consume_stock(memcg, nr_pages))
1942 if (!do_memsw_account() ||
1943 page_counter_try_charge(&memcg->memsw, batch, &counter)) {
1944 if (page_counter_try_charge(&memcg->memory, batch, &counter))
1946 if (do_memsw_account())
1947 page_counter_uncharge(&memcg->memsw, batch);
1948 mem_over_limit = mem_cgroup_from_counter(counter, memory);
1950 mem_over_limit = mem_cgroup_from_counter(counter, memsw);
1954 if (batch > nr_pages) {
1960 * Unlike in global OOM situations, memcg is not in a physical
1961 * memory shortage. Allow dying and OOM-killed tasks to
1962 * bypass the last charges so that they can exit quickly and
1963 * free their memory.
1965 if (unlikely(tsk_is_oom_victim(current) ||
1966 fatal_signal_pending(current) ||
1967 current->flags & PF_EXITING))
1971 * Prevent unbounded recursion when reclaim operations need to
1972 * allocate memory. This might exceed the limits temporarily,
1973 * but we prefer facilitating memory reclaim and getting back
1974 * under the limit over triggering OOM kills in these cases.
1976 if (unlikely(current->flags & PF_MEMALLOC))
1979 if (unlikely(task_in_memcg_oom(current)))
1982 if (!gfpflags_allow_blocking(gfp_mask))
1985 memcg_memory_event(mem_over_limit, MEMCG_MAX);
1987 nr_reclaimed = try_to_free_mem_cgroup_pages(mem_over_limit, nr_pages,
1988 gfp_mask, may_swap);
1990 if (mem_cgroup_margin(mem_over_limit) >= nr_pages)
1994 drain_all_stock(mem_over_limit);
1999 if (gfp_mask & __GFP_NORETRY)
2002 * Even though the limit is exceeded at this point, reclaim
2003 * may have been able to free some pages. Retry the charge
2004 * before killing the task.
2006 * Only for regular pages, though: huge pages are rather
2007 * unlikely to succeed so close to the limit, and we fall back
2008 * to regular pages anyway in case of failure.
2010 if (nr_reclaimed && nr_pages <= (1 << PAGE_ALLOC_COSTLY_ORDER))
2013 * At task move, charge accounts can be doubly counted. So, it's
2014 * better to wait until the end of task_move if something is going on.
2016 if (mem_cgroup_wait_acct_move(mem_over_limit))
2022 if (gfp_mask & __GFP_NOFAIL)
2025 if (fatal_signal_pending(current))
2028 memcg_memory_event(mem_over_limit, MEMCG_OOM);
2030 mem_cgroup_oom(mem_over_limit, gfp_mask,
2031 get_order(nr_pages * PAGE_SIZE));
2033 if (!(gfp_mask & __GFP_NOFAIL))
2037 * The allocation either can't fail or will lead to more memory
2038 * being freed very soon. Allow memory usage go over the limit
2039 * temporarily by force charging it.
2041 page_counter_charge(&memcg->memory, nr_pages);
2042 if (do_memsw_account())
2043 page_counter_charge(&memcg->memsw, nr_pages);
2044 css_get_many(&memcg->css, nr_pages);
2049 css_get_many(&memcg->css, batch);
2050 if (batch > nr_pages)
2051 refill_stock(memcg, batch - nr_pages);
2054 * If the hierarchy is above the normal consumption range, schedule
2055 * reclaim on returning to userland. We can perform reclaim here
2056 * if __GFP_RECLAIM but let's always punt for simplicity and so that
2057 * GFP_KERNEL can consistently be used during reclaim. @memcg is
2058 * not recorded as it most likely matches current's and won't
2059 * change in the meantime. As high limit is checked again before
2060 * reclaim, the cost of mismatch is negligible.
2063 if (page_counter_read(&memcg->memory) > memcg->high) {
2064 /* Don't bother a random interrupted task */
2065 if (in_interrupt()) {
2066 schedule_work(&memcg->high_work);
2069 current->memcg_nr_pages_over_high += batch;
2070 set_notify_resume(current);
2073 } while ((memcg = parent_mem_cgroup(memcg)));
2078 static void cancel_charge(struct mem_cgroup *memcg, unsigned int nr_pages)
2080 if (mem_cgroup_is_root(memcg))
2083 page_counter_uncharge(&memcg->memory, nr_pages);
2084 if (do_memsw_account())
2085 page_counter_uncharge(&memcg->memsw, nr_pages);
2087 css_put_many(&memcg->css, nr_pages);
2090 static void lock_page_lru(struct page *page, int *isolated)
2092 struct zone *zone = page_zone(page);
2094 spin_lock_irq(zone_lru_lock(zone));
2095 if (PageLRU(page)) {
2096 struct lruvec *lruvec;
2098 lruvec = mem_cgroup_page_lruvec(page, zone->zone_pgdat);
2100 del_page_from_lru_list(page, lruvec, page_lru(page));
2106 static void unlock_page_lru(struct page *page, int isolated)
2108 struct zone *zone = page_zone(page);
2111 struct lruvec *lruvec;
2113 lruvec = mem_cgroup_page_lruvec(page, zone->zone_pgdat);
2114 VM_BUG_ON_PAGE(PageLRU(page), page);
2116 add_page_to_lru_list(page, lruvec, page_lru(page));
2118 spin_unlock_irq(zone_lru_lock(zone));
2121 static void commit_charge(struct page *page, struct mem_cgroup *memcg,
2126 VM_BUG_ON_PAGE(page->mem_cgroup, page);
2129 * In some cases, SwapCache and FUSE(splice_buf->radixtree), the page
2130 * may already be on some other mem_cgroup's LRU. Take care of it.
2133 lock_page_lru(page, &isolated);
2136 * Nobody should be changing or seriously looking at
2137 * page->mem_cgroup at this point:
2139 * - the page is uncharged
2141 * - the page is off-LRU
2143 * - an anonymous fault has exclusive page access, except for
2144 * a locked page table
2146 * - a page cache insertion, a swapin fault, or a migration
2147 * have the page locked
2149 page->mem_cgroup = memcg;
2152 unlock_page_lru(page, isolated);
2156 static int memcg_alloc_cache_id(void)
2161 id = ida_simple_get(&memcg_cache_ida,
2162 0, MEMCG_CACHES_MAX_SIZE, GFP_KERNEL);
2166 if (id < memcg_nr_cache_ids)
2170 * There's no space for the new id in memcg_caches arrays,
2171 * so we have to grow them.
2173 down_write(&memcg_cache_ids_sem);
2175 size = 2 * (id + 1);
2176 if (size < MEMCG_CACHES_MIN_SIZE)
2177 size = MEMCG_CACHES_MIN_SIZE;
2178 else if (size > MEMCG_CACHES_MAX_SIZE)
2179 size = MEMCG_CACHES_MAX_SIZE;
2181 err = memcg_update_all_caches(size);
2183 err = memcg_update_all_list_lrus(size);
2185 memcg_nr_cache_ids = size;
2187 up_write(&memcg_cache_ids_sem);
2190 ida_simple_remove(&memcg_cache_ida, id);
2196 static void memcg_free_cache_id(int id)
2198 ida_simple_remove(&memcg_cache_ida, id);
2201 struct memcg_kmem_cache_create_work {
2202 struct mem_cgroup *memcg;
2203 struct kmem_cache *cachep;
2204 struct work_struct work;
2207 static void memcg_kmem_cache_create_func(struct work_struct *w)
2209 struct memcg_kmem_cache_create_work *cw =
2210 container_of(w, struct memcg_kmem_cache_create_work, work);
2211 struct mem_cgroup *memcg = cw->memcg;
2212 struct kmem_cache *cachep = cw->cachep;
2214 memcg_create_kmem_cache(memcg, cachep);
2216 css_put(&memcg->css);
2221 * Enqueue the creation of a per-memcg kmem_cache.
2223 static void __memcg_schedule_kmem_cache_create(struct mem_cgroup *memcg,
2224 struct kmem_cache *cachep)
2226 struct memcg_kmem_cache_create_work *cw;
2228 cw = kmalloc(sizeof(*cw), GFP_NOWAIT | __GFP_NOWARN);
2232 css_get(&memcg->css);
2235 cw->cachep = cachep;
2236 INIT_WORK(&cw->work, memcg_kmem_cache_create_func);
2238 queue_work(memcg_kmem_cache_wq, &cw->work);
2241 static void memcg_schedule_kmem_cache_create(struct mem_cgroup *memcg,
2242 struct kmem_cache *cachep)
2245 * We need to stop accounting when we kmalloc, because if the
2246 * corresponding kmalloc cache is not yet created, the first allocation
2247 * in __memcg_schedule_kmem_cache_create will recurse.
2249 * However, it is better to enclose the whole function. Depending on
2250 * the debugging options enabled, INIT_WORK(), for instance, can
2251 * trigger an allocation. This too, will make us recurse. Because at
2252 * this point we can't allow ourselves back into memcg_kmem_get_cache,
2253 * the safest choice is to do it like this, wrapping the whole function.
2255 current->memcg_kmem_skip_account = 1;
2256 __memcg_schedule_kmem_cache_create(memcg, cachep);
2257 current->memcg_kmem_skip_account = 0;
2260 static inline bool memcg_kmem_bypass(void)
2262 if (in_interrupt() || !current->mm || (current->flags & PF_KTHREAD))
2268 * memcg_kmem_get_cache: select the correct per-memcg cache for allocation
2269 * @cachep: the original global kmem cache
2271 * Return the kmem_cache we're supposed to use for a slab allocation.
2272 * We try to use the current memcg's version of the cache.
2274 * If the cache does not exist yet, if we are the first user of it, we
2275 * create it asynchronously in a workqueue and let the current allocation
2276 * go through with the original cache.
2278 * This function takes a reference to the cache it returns to assure it
2279 * won't get destroyed while we are working with it. Once the caller is
2280 * done with it, memcg_kmem_put_cache() must be called to release the
2283 struct kmem_cache *memcg_kmem_get_cache(struct kmem_cache *cachep)
2285 struct mem_cgroup *memcg;
2286 struct kmem_cache *memcg_cachep;
2289 VM_BUG_ON(!is_root_cache(cachep));
2291 if (memcg_kmem_bypass())
2294 if (current->memcg_kmem_skip_account)
2297 memcg = get_mem_cgroup_from_mm(current->mm);
2298 kmemcg_id = READ_ONCE(memcg->kmemcg_id);
2302 memcg_cachep = cache_from_memcg_idx(cachep, kmemcg_id);
2303 if (likely(memcg_cachep))
2304 return memcg_cachep;
2307 * If we are in a safe context (can wait, and not in interrupt
2308 * context), we could be be predictable and return right away.
2309 * This would guarantee that the allocation being performed
2310 * already belongs in the new cache.
2312 * However, there are some clashes that can arrive from locking.
2313 * For instance, because we acquire the slab_mutex while doing
2314 * memcg_create_kmem_cache, this means no further allocation
2315 * could happen with the slab_mutex held. So it's better to
2318 memcg_schedule_kmem_cache_create(memcg, cachep);
2320 css_put(&memcg->css);
2325 * memcg_kmem_put_cache: drop reference taken by memcg_kmem_get_cache
2326 * @cachep: the cache returned by memcg_kmem_get_cache
2328 void memcg_kmem_put_cache(struct kmem_cache *cachep)
2330 if (!is_root_cache(cachep))
2331 css_put(&cachep->memcg_params.memcg->css);
2335 * memcg_kmem_charge: charge a kmem page
2336 * @page: page to charge
2337 * @gfp: reclaim mode
2338 * @order: allocation order
2339 * @memcg: memory cgroup to charge
2341 * Returns 0 on success, an error code on failure.
2343 int memcg_kmem_charge_memcg(struct page *page, gfp_t gfp, int order,
2344 struct mem_cgroup *memcg)
2346 unsigned int nr_pages = 1 << order;
2347 struct page_counter *counter;
2350 ret = try_charge(memcg, gfp, nr_pages);
2354 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) &&
2355 !page_counter_try_charge(&memcg->kmem, nr_pages, &counter)) {
2358 * Enforce __GFP_NOFAIL allocation because callers are not
2359 * prepared to see failures and likely do not have any failure
2362 if (gfp & __GFP_NOFAIL) {
2363 page_counter_charge(&memcg->kmem, nr_pages);
2366 cancel_charge(memcg, nr_pages);
2370 page->mem_cgroup = memcg;
2376 * memcg_kmem_charge: charge a kmem page to the current memory cgroup
2377 * @page: page to charge
2378 * @gfp: reclaim mode
2379 * @order: allocation order
2381 * Returns 0 on success, an error code on failure.
2383 int memcg_kmem_charge(struct page *page, gfp_t gfp, int order)
2385 struct mem_cgroup *memcg;
2388 if (memcg_kmem_bypass())
2391 memcg = get_mem_cgroup_from_mm(current->mm);
2392 if (!mem_cgroup_is_root(memcg)) {
2393 ret = memcg_kmem_charge_memcg(page, gfp, order, memcg);
2395 __SetPageKmemcg(page);
2397 css_put(&memcg->css);
2401 * memcg_kmem_uncharge: uncharge a kmem page
2402 * @page: page to uncharge
2403 * @order: allocation order
2405 void memcg_kmem_uncharge(struct page *page, int order)
2407 struct mem_cgroup *memcg = page->mem_cgroup;
2408 unsigned int nr_pages = 1 << order;
2413 VM_BUG_ON_PAGE(mem_cgroup_is_root(memcg), page);
2415 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys))
2416 page_counter_uncharge(&memcg->kmem, nr_pages);
2418 page_counter_uncharge(&memcg->memory, nr_pages);
2419 if (do_memsw_account())
2420 page_counter_uncharge(&memcg->memsw, nr_pages);
2422 page->mem_cgroup = NULL;
2424 /* slab pages do not have PageKmemcg flag set */
2425 if (PageKmemcg(page))
2426 __ClearPageKmemcg(page);
2428 css_put_many(&memcg->css, nr_pages);
2430 #endif /* !CONFIG_SLOB */
2432 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
2435 * Because tail pages are not marked as "used", set it. We're under
2436 * zone_lru_lock and migration entries setup in all page mappings.
2438 void mem_cgroup_split_huge_fixup(struct page *head)
2442 if (mem_cgroup_disabled())
2445 for (i = 1; i < HPAGE_PMD_NR; i++)
2446 head[i].mem_cgroup = head->mem_cgroup;
2448 __mod_memcg_state(head->mem_cgroup, MEMCG_RSS_HUGE, -HPAGE_PMD_NR);
2450 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
2452 #ifdef CONFIG_MEMCG_SWAP
2454 * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record.
2455 * @entry: swap entry to be moved
2456 * @from: mem_cgroup which the entry is moved from
2457 * @to: mem_cgroup which the entry is moved to
2459 * It succeeds only when the swap_cgroup's record for this entry is the same
2460 * as the mem_cgroup's id of @from.
2462 * Returns 0 on success, -EINVAL on failure.
2464 * The caller must have charged to @to, IOW, called page_counter_charge() about
2465 * both res and memsw, and called css_get().
2467 static int mem_cgroup_move_swap_account(swp_entry_t entry,
2468 struct mem_cgroup *from, struct mem_cgroup *to)
2470 unsigned short old_id, new_id;
2472 old_id = mem_cgroup_id(from);
2473 new_id = mem_cgroup_id(to);
2475 if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) {
2476 mod_memcg_state(from, MEMCG_SWAP, -1);
2477 mod_memcg_state(to, MEMCG_SWAP, 1);
2483 static inline int mem_cgroup_move_swap_account(swp_entry_t entry,
2484 struct mem_cgroup *from, struct mem_cgroup *to)
2490 static DEFINE_MUTEX(memcg_limit_mutex);
2492 static int mem_cgroup_resize_limit(struct mem_cgroup *memcg,
2493 unsigned long limit)
2495 unsigned long curusage;
2496 unsigned long oldusage;
2497 bool enlarge = false;
2502 * For keeping hierarchical_reclaim simple, how long we should retry
2503 * is depends on callers. We set our retry-count to be function
2504 * of # of children which we should visit in this loop.
2506 retry_count = MEM_CGROUP_RECLAIM_RETRIES *
2507 mem_cgroup_count_children(memcg);
2509 oldusage = page_counter_read(&memcg->memory);
2512 if (signal_pending(current)) {
2517 mutex_lock(&memcg_limit_mutex);
2518 if (limit > memcg->memsw.limit) {
2519 mutex_unlock(&memcg_limit_mutex);
2523 if (limit > memcg->memory.limit)
2525 ret = page_counter_limit(&memcg->memory, limit);
2526 mutex_unlock(&memcg_limit_mutex);
2531 try_to_free_mem_cgroup_pages(memcg, 1, GFP_KERNEL, true);
2533 curusage = page_counter_read(&memcg->memory);
2534 /* Usage is reduced ? */
2535 if (curusage >= oldusage)
2538 oldusage = curusage;
2539 } while (retry_count);
2541 if (!ret && enlarge)
2542 memcg_oom_recover(memcg);
2547 static int mem_cgroup_resize_memsw_limit(struct mem_cgroup *memcg,
2548 unsigned long limit)
2550 unsigned long curusage;
2551 unsigned long oldusage;
2552 bool enlarge = false;
2556 /* see mem_cgroup_resize_res_limit */
2557 retry_count = MEM_CGROUP_RECLAIM_RETRIES *
2558 mem_cgroup_count_children(memcg);
2560 oldusage = page_counter_read(&memcg->memsw);
2563 if (signal_pending(current)) {
2568 mutex_lock(&memcg_limit_mutex);
2569 if (limit < memcg->memory.limit) {
2570 mutex_unlock(&memcg_limit_mutex);
2574 if (limit > memcg->memsw.limit)
2576 ret = page_counter_limit(&memcg->memsw, limit);
2577 mutex_unlock(&memcg_limit_mutex);
2582 try_to_free_mem_cgroup_pages(memcg, 1, GFP_KERNEL, false);
2584 curusage = page_counter_read(&memcg->memsw);
2585 /* Usage is reduced ? */
2586 if (curusage >= oldusage)
2589 oldusage = curusage;
2590 } while (retry_count);
2592 if (!ret && enlarge)
2593 memcg_oom_recover(memcg);
2598 unsigned long mem_cgroup_soft_limit_reclaim(pg_data_t *pgdat, int order,
2600 unsigned long *total_scanned)
2602 unsigned long nr_reclaimed = 0;
2603 struct mem_cgroup_per_node *mz, *next_mz = NULL;
2604 unsigned long reclaimed;
2606 struct mem_cgroup_tree_per_node *mctz;
2607 unsigned long excess;
2608 unsigned long nr_scanned;
2613 mctz = soft_limit_tree_node(pgdat->node_id);
2616 * Do not even bother to check the largest node if the root
2617 * is empty. Do it lockless to prevent lock bouncing. Races
2618 * are acceptable as soft limit is best effort anyway.
2620 if (!mctz || RB_EMPTY_ROOT(&mctz->rb_root))
2624 * This loop can run a while, specially if mem_cgroup's continuously
2625 * keep exceeding their soft limit and putting the system under
2632 mz = mem_cgroup_largest_soft_limit_node(mctz);
2637 reclaimed = mem_cgroup_soft_reclaim(mz->memcg, pgdat,
2638 gfp_mask, &nr_scanned);
2639 nr_reclaimed += reclaimed;
2640 *total_scanned += nr_scanned;
2641 spin_lock_irq(&mctz->lock);
2642 __mem_cgroup_remove_exceeded(mz, mctz);
2645 * If we failed to reclaim anything from this memory cgroup
2646 * it is time to move on to the next cgroup
2650 next_mz = __mem_cgroup_largest_soft_limit_node(mctz);
2652 excess = soft_limit_excess(mz->memcg);
2654 * One school of thought says that we should not add
2655 * back the node to the tree if reclaim returns 0.
2656 * But our reclaim could return 0, simply because due
2657 * to priority we are exposing a smaller subset of
2658 * memory to reclaim from. Consider this as a longer
2661 /* If excess == 0, no tree ops */
2662 __mem_cgroup_insert_exceeded(mz, mctz, excess);
2663 spin_unlock_irq(&mctz->lock);
2664 css_put(&mz->memcg->css);
2667 * Could not reclaim anything and there are no more
2668 * mem cgroups to try or we seem to be looping without
2669 * reclaiming anything.
2671 if (!nr_reclaimed &&
2673 loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS))
2675 } while (!nr_reclaimed);
2677 css_put(&next_mz->memcg->css);
2678 return nr_reclaimed;
2682 * Test whether @memcg has children, dead or alive. Note that this
2683 * function doesn't care whether @memcg has use_hierarchy enabled and
2684 * returns %true if there are child csses according to the cgroup
2685 * hierarchy. Testing use_hierarchy is the caller's responsiblity.
2687 static inline bool memcg_has_children(struct mem_cgroup *memcg)
2692 ret = css_next_child(NULL, &memcg->css);
2698 * Reclaims as many pages from the given memcg as possible.
2700 * Caller is responsible for holding css reference for memcg.
2702 static int mem_cgroup_force_empty(struct mem_cgroup *memcg)
2704 int nr_retries = MEM_CGROUP_RECLAIM_RETRIES;
2706 /* we call try-to-free pages for make this cgroup empty */
2707 lru_add_drain_all();
2708 /* try to free all pages in this cgroup */
2709 while (nr_retries && page_counter_read(&memcg->memory)) {
2712 if (signal_pending(current))
2715 progress = try_to_free_mem_cgroup_pages(memcg, 1,
2719 /* maybe some writeback is necessary */
2720 congestion_wait(BLK_RW_ASYNC, HZ/10);
2728 static ssize_t mem_cgroup_force_empty_write(struct kernfs_open_file *of,
2729 char *buf, size_t nbytes,
2732 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
2734 if (mem_cgroup_is_root(memcg))
2736 return mem_cgroup_force_empty(memcg) ?: nbytes;
2739 static u64 mem_cgroup_hierarchy_read(struct cgroup_subsys_state *css,
2742 return mem_cgroup_from_css(css)->use_hierarchy;
2745 static int mem_cgroup_hierarchy_write(struct cgroup_subsys_state *css,
2746 struct cftype *cft, u64 val)
2749 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
2750 struct mem_cgroup *parent_memcg = mem_cgroup_from_css(memcg->css.parent);
2752 if (memcg->use_hierarchy == val)
2756 * If parent's use_hierarchy is set, we can't make any modifications
2757 * in the child subtrees. If it is unset, then the change can
2758 * occur, provided the current cgroup has no children.
2760 * For the root cgroup, parent_mem is NULL, we allow value to be
2761 * set if there are no children.
2763 if ((!parent_memcg || !parent_memcg->use_hierarchy) &&
2764 (val == 1 || val == 0)) {
2765 if (!memcg_has_children(memcg))
2766 memcg->use_hierarchy = val;
2775 static void tree_stat(struct mem_cgroup *memcg, unsigned long *stat)
2777 struct mem_cgroup *iter;
2780 memset(stat, 0, sizeof(*stat) * MEMCG_NR_STAT);
2782 for_each_mem_cgroup_tree(iter, memcg) {
2783 for (i = 0; i < MEMCG_NR_STAT; i++)
2784 stat[i] += memcg_page_state(iter, i);
2788 static void tree_events(struct mem_cgroup *memcg, unsigned long *events)
2790 struct mem_cgroup *iter;
2793 memset(events, 0, sizeof(*events) * NR_VM_EVENT_ITEMS);
2795 for_each_mem_cgroup_tree(iter, memcg) {
2796 for (i = 0; i < NR_VM_EVENT_ITEMS; i++)
2797 events[i] += memcg_sum_events(iter, i);
2801 static unsigned long mem_cgroup_usage(struct mem_cgroup *memcg, bool swap)
2803 unsigned long val = 0;
2805 if (mem_cgroup_is_root(memcg)) {
2806 struct mem_cgroup *iter;
2808 for_each_mem_cgroup_tree(iter, memcg) {
2809 val += memcg_page_state(iter, MEMCG_CACHE);
2810 val += memcg_page_state(iter, MEMCG_RSS);
2812 val += memcg_page_state(iter, MEMCG_SWAP);
2816 val = page_counter_read(&memcg->memory);
2818 val = page_counter_read(&memcg->memsw);
2831 static u64 mem_cgroup_read_u64(struct cgroup_subsys_state *css,
2834 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
2835 struct page_counter *counter;
2837 switch (MEMFILE_TYPE(cft->private)) {
2839 counter = &memcg->memory;
2842 counter = &memcg->memsw;
2845 counter = &memcg->kmem;
2848 counter = &memcg->tcpmem;
2854 switch (MEMFILE_ATTR(cft->private)) {
2856 if (counter == &memcg->memory)
2857 return (u64)mem_cgroup_usage(memcg, false) * PAGE_SIZE;
2858 if (counter == &memcg->memsw)
2859 return (u64)mem_cgroup_usage(memcg, true) * PAGE_SIZE;
2860 return (u64)page_counter_read(counter) * PAGE_SIZE;
2862 return (u64)counter->limit * PAGE_SIZE;
2864 return (u64)counter->watermark * PAGE_SIZE;
2866 return counter->failcnt;
2867 case RES_SOFT_LIMIT:
2868 return (u64)memcg->soft_limit * PAGE_SIZE;
2875 static int memcg_online_kmem(struct mem_cgroup *memcg)
2879 if (cgroup_memory_nokmem)
2882 BUG_ON(memcg->kmemcg_id >= 0);
2883 BUG_ON(memcg->kmem_state);
2885 memcg_id = memcg_alloc_cache_id();
2889 static_branch_inc(&memcg_kmem_enabled_key);
2891 * A memory cgroup is considered kmem-online as soon as it gets
2892 * kmemcg_id. Setting the id after enabling static branching will
2893 * guarantee no one starts accounting before all call sites are
2896 memcg->kmemcg_id = memcg_id;
2897 memcg->kmem_state = KMEM_ONLINE;
2898 INIT_LIST_HEAD(&memcg->kmem_caches);
2903 static void memcg_offline_kmem(struct mem_cgroup *memcg)
2905 struct cgroup_subsys_state *css;
2906 struct mem_cgroup *parent, *child;
2909 if (memcg->kmem_state != KMEM_ONLINE)
2912 * Clear the online state before clearing memcg_caches array
2913 * entries. The slab_mutex in memcg_deactivate_kmem_caches()
2914 * guarantees that no cache will be created for this cgroup
2915 * after we are done (see memcg_create_kmem_cache()).
2917 memcg->kmem_state = KMEM_ALLOCATED;
2919 memcg_deactivate_kmem_caches(memcg);
2921 kmemcg_id = memcg->kmemcg_id;
2922 BUG_ON(kmemcg_id < 0);
2924 parent = parent_mem_cgroup(memcg);
2926 parent = root_mem_cgroup;
2929 * Change kmemcg_id of this cgroup and all its descendants to the
2930 * parent's id, and then move all entries from this cgroup's list_lrus
2931 * to ones of the parent. After we have finished, all list_lrus
2932 * corresponding to this cgroup are guaranteed to remain empty. The
2933 * ordering is imposed by list_lru_node->lock taken by
2934 * memcg_drain_all_list_lrus().
2936 rcu_read_lock(); /* can be called from css_free w/o cgroup_mutex */
2937 css_for_each_descendant_pre(css, &memcg->css) {
2938 child = mem_cgroup_from_css(css);
2939 BUG_ON(child->kmemcg_id != kmemcg_id);
2940 child->kmemcg_id = parent->kmemcg_id;
2941 if (!memcg->use_hierarchy)
2946 memcg_drain_all_list_lrus(kmemcg_id, parent->kmemcg_id);
2948 memcg_free_cache_id(kmemcg_id);
2951 static void memcg_free_kmem(struct mem_cgroup *memcg)
2953 /* css_alloc() failed, offlining didn't happen */
2954 if (unlikely(memcg->kmem_state == KMEM_ONLINE))
2955 memcg_offline_kmem(memcg);
2957 if (memcg->kmem_state == KMEM_ALLOCATED) {
2958 memcg_destroy_kmem_caches(memcg);
2959 static_branch_dec(&memcg_kmem_enabled_key);
2960 WARN_ON(page_counter_read(&memcg->kmem));
2964 static int memcg_online_kmem(struct mem_cgroup *memcg)
2968 static void memcg_offline_kmem(struct mem_cgroup *memcg)
2971 static void memcg_free_kmem(struct mem_cgroup *memcg)
2974 #endif /* !CONFIG_SLOB */
2976 static int memcg_update_kmem_limit(struct mem_cgroup *memcg,
2977 unsigned long limit)
2981 mutex_lock(&memcg_limit_mutex);
2982 ret = page_counter_limit(&memcg->kmem, limit);
2983 mutex_unlock(&memcg_limit_mutex);
2987 static int memcg_update_tcp_limit(struct mem_cgroup *memcg, unsigned long limit)
2991 mutex_lock(&memcg_limit_mutex);
2993 ret = page_counter_limit(&memcg->tcpmem, limit);
2997 if (!memcg->tcpmem_active) {
2999 * The active flag needs to be written after the static_key
3000 * update. This is what guarantees that the socket activation
3001 * function is the last one to run. See mem_cgroup_sk_alloc()
3002 * for details, and note that we don't mark any socket as
3003 * belonging to this memcg until that flag is up.
3005 * We need to do this, because static_keys will span multiple
3006 * sites, but we can't control their order. If we mark a socket
3007 * as accounted, but the accounting functions are not patched in
3008 * yet, we'll lose accounting.
3010 * We never race with the readers in mem_cgroup_sk_alloc(),
3011 * because when this value change, the code to process it is not
3014 static_branch_inc(&memcg_sockets_enabled_key);
3015 memcg->tcpmem_active = true;
3018 mutex_unlock(&memcg_limit_mutex);
3023 * The user of this function is...
3026 static ssize_t mem_cgroup_write(struct kernfs_open_file *of,
3027 char *buf, size_t nbytes, loff_t off)
3029 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
3030 unsigned long nr_pages;
3033 buf = strstrip(buf);
3034 ret = page_counter_memparse(buf, "-1", &nr_pages);
3038 switch (MEMFILE_ATTR(of_cft(of)->private)) {
3040 if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */
3044 switch (MEMFILE_TYPE(of_cft(of)->private)) {
3046 ret = mem_cgroup_resize_limit(memcg, nr_pages);
3049 ret = mem_cgroup_resize_memsw_limit(memcg, nr_pages);
3052 ret = memcg_update_kmem_limit(memcg, nr_pages);
3055 ret = memcg_update_tcp_limit(memcg, nr_pages);
3059 case RES_SOFT_LIMIT:
3060 memcg->soft_limit = nr_pages;
3064 return ret ?: nbytes;
3067 static ssize_t mem_cgroup_reset(struct kernfs_open_file *of, char *buf,
3068 size_t nbytes, loff_t off)
3070 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
3071 struct page_counter *counter;
3073 switch (MEMFILE_TYPE(of_cft(of)->private)) {
3075 counter = &memcg->memory;
3078 counter = &memcg->memsw;
3081 counter = &memcg->kmem;
3084 counter = &memcg->tcpmem;
3090 switch (MEMFILE_ATTR(of_cft(of)->private)) {
3092 page_counter_reset_watermark(counter);
3095 counter->failcnt = 0;
3104 static u64 mem_cgroup_move_charge_read(struct cgroup_subsys_state *css,
3107 return mem_cgroup_from_css(css)->move_charge_at_immigrate;
3111 static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css,
3112 struct cftype *cft, u64 val)
3114 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
3116 if (val & ~MOVE_MASK)
3120 * No kind of locking is needed in here, because ->can_attach() will
3121 * check this value once in the beginning of the process, and then carry
3122 * on with stale data. This means that changes to this value will only
3123 * affect task migrations starting after the change.
3125 memcg->move_charge_at_immigrate = val;
3129 static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css,
3130 struct cftype *cft, u64 val)
3137 static int memcg_numa_stat_show(struct seq_file *m, void *v)
3141 unsigned int lru_mask;
3144 static const struct numa_stat stats[] = {
3145 { "total", LRU_ALL },
3146 { "file", LRU_ALL_FILE },
3147 { "anon", LRU_ALL_ANON },
3148 { "unevictable", BIT(LRU_UNEVICTABLE) },
3150 const struct numa_stat *stat;
3153 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
3155 for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) {
3156 nr = mem_cgroup_nr_lru_pages(memcg, stat->lru_mask);
3157 seq_printf(m, "%s=%lu", stat->name, nr);
3158 for_each_node_state(nid, N_MEMORY) {
3159 nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
3161 seq_printf(m, " N%d=%lu", nid, nr);
3166 for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) {
3167 struct mem_cgroup *iter;
3170 for_each_mem_cgroup_tree(iter, memcg)
3171 nr += mem_cgroup_nr_lru_pages(iter, stat->lru_mask);
3172 seq_printf(m, "hierarchical_%s=%lu", stat->name, nr);
3173 for_each_node_state(nid, N_MEMORY) {
3175 for_each_mem_cgroup_tree(iter, memcg)
3176 nr += mem_cgroup_node_nr_lru_pages(
3177 iter, nid, stat->lru_mask);
3178 seq_printf(m, " N%d=%lu", nid, nr);
3185 #endif /* CONFIG_NUMA */
3187 /* Universal VM events cgroup1 shows, original sort order */
3188 unsigned int memcg1_events[] = {
3195 static const char *const memcg1_event_names[] = {
3202 static int memcg_stat_show(struct seq_file *m, void *v)
3204 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
3205 unsigned long memory, memsw;
3206 struct mem_cgroup *mi;
3209 BUILD_BUG_ON(ARRAY_SIZE(memcg1_stat_names) != ARRAY_SIZE(memcg1_stats));
3210 BUILD_BUG_ON(ARRAY_SIZE(mem_cgroup_lru_names) != NR_LRU_LISTS);
3212 for (i = 0; i < ARRAY_SIZE(memcg1_stats); i++) {
3213 if (memcg1_stats[i] == MEMCG_SWAP && !do_memsw_account())
3215 seq_printf(m, "%s %lu\n", memcg1_stat_names[i],
3216 memcg_page_state(memcg, memcg1_stats[i]) *
3220 for (i = 0; i < ARRAY_SIZE(memcg1_events); i++)
3221 seq_printf(m, "%s %lu\n", memcg1_event_names[i],
3222 memcg_sum_events(memcg, memcg1_events[i]));
3224 for (i = 0; i < NR_LRU_LISTS; i++)
3225 seq_printf(m, "%s %lu\n", mem_cgroup_lru_names[i],
3226 mem_cgroup_nr_lru_pages(memcg, BIT(i)) * PAGE_SIZE);
3228 /* Hierarchical information */
3229 memory = memsw = PAGE_COUNTER_MAX;
3230 for (mi = memcg; mi; mi = parent_mem_cgroup(mi)) {
3231 memory = min(memory, mi->memory.limit);
3232 memsw = min(memsw, mi->memsw.limit);
3234 seq_printf(m, "hierarchical_memory_limit %llu\n",
3235 (u64)memory * PAGE_SIZE);
3236 if (do_memsw_account())
3237 seq_printf(m, "hierarchical_memsw_limit %llu\n",
3238 (u64)memsw * PAGE_SIZE);
3240 for (i = 0; i < ARRAY_SIZE(memcg1_stats); i++) {
3241 unsigned long long val = 0;
3243 if (memcg1_stats[i] == MEMCG_SWAP && !do_memsw_account())
3245 for_each_mem_cgroup_tree(mi, memcg)
3246 val += memcg_page_state(mi, memcg1_stats[i]) *
3248 seq_printf(m, "total_%s %llu\n", memcg1_stat_names[i], val);
3251 for (i = 0; i < ARRAY_SIZE(memcg1_events); i++) {
3252 unsigned long long val = 0;
3254 for_each_mem_cgroup_tree(mi, memcg)
3255 val += memcg_sum_events(mi, memcg1_events[i]);
3256 seq_printf(m, "total_%s %llu\n", memcg1_event_names[i], val);
3259 for (i = 0; i < NR_LRU_LISTS; i++) {
3260 unsigned long long val = 0;
3262 for_each_mem_cgroup_tree(mi, memcg)
3263 val += mem_cgroup_nr_lru_pages(mi, BIT(i)) * PAGE_SIZE;
3264 seq_printf(m, "total_%s %llu\n", mem_cgroup_lru_names[i], val);
3267 #ifdef CONFIG_DEBUG_VM
3270 struct mem_cgroup_per_node *mz;
3271 struct zone_reclaim_stat *rstat;
3272 unsigned long recent_rotated[2] = {0, 0};
3273 unsigned long recent_scanned[2] = {0, 0};
3275 for_each_online_pgdat(pgdat) {
3276 mz = mem_cgroup_nodeinfo(memcg, pgdat->node_id);
3277 rstat = &mz->lruvec.reclaim_stat;
3279 recent_rotated[0] += rstat->recent_rotated[0];
3280 recent_rotated[1] += rstat->recent_rotated[1];
3281 recent_scanned[0] += rstat->recent_scanned[0];
3282 recent_scanned[1] += rstat->recent_scanned[1];
3284 seq_printf(m, "recent_rotated_anon %lu\n", recent_rotated[0]);
3285 seq_printf(m, "recent_rotated_file %lu\n", recent_rotated[1]);
3286 seq_printf(m, "recent_scanned_anon %lu\n", recent_scanned[0]);
3287 seq_printf(m, "recent_scanned_file %lu\n", recent_scanned[1]);
3294 static u64 mem_cgroup_swappiness_read(struct cgroup_subsys_state *css,
3297 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
3299 return mem_cgroup_swappiness(memcg);
3302 static int mem_cgroup_swappiness_write(struct cgroup_subsys_state *css,
3303 struct cftype *cft, u64 val)
3305 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
3311 memcg->swappiness = val;
3313 vm_swappiness = val;
3318 static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap)
3320 struct mem_cgroup_threshold_ary *t;
3321 unsigned long usage;
3326 t = rcu_dereference(memcg->thresholds.primary);
3328 t = rcu_dereference(memcg->memsw_thresholds.primary);
3333 usage = mem_cgroup_usage(memcg, swap);
3336 * current_threshold points to threshold just below or equal to usage.
3337 * If it's not true, a threshold was crossed after last
3338 * call of __mem_cgroup_threshold().
3340 i = t->current_threshold;
3343 * Iterate backward over array of thresholds starting from
3344 * current_threshold and check if a threshold is crossed.
3345 * If none of thresholds below usage is crossed, we read
3346 * only one element of the array here.
3348 for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)
3349 eventfd_signal(t->entries[i].eventfd, 1);
3351 /* i = current_threshold + 1 */
3355 * Iterate forward over array of thresholds starting from
3356 * current_threshold+1 and check if a threshold is crossed.
3357 * If none of thresholds above usage is crossed, we read
3358 * only one element of the array here.
3360 for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)
3361 eventfd_signal(t->entries[i].eventfd, 1);
3363 /* Update current_threshold */
3364 t->current_threshold = i - 1;
3369 static void mem_cgroup_threshold(struct mem_cgroup *memcg)
3372 __mem_cgroup_threshold(memcg, false);
3373 if (do_memsw_account())
3374 __mem_cgroup_threshold(memcg, true);
3376 memcg = parent_mem_cgroup(memcg);
3380 static int compare_thresholds(const void *a, const void *b)
3382 const struct mem_cgroup_threshold *_a = a;
3383 const struct mem_cgroup_threshold *_b = b;
3385 if (_a->threshold > _b->threshold)
3388 if (_a->threshold < _b->threshold)
3394 static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg)
3396 struct mem_cgroup_eventfd_list *ev;
3398 spin_lock(&memcg_oom_lock);
3400 list_for_each_entry(ev, &memcg->oom_notify, list)
3401 eventfd_signal(ev->eventfd, 1);
3403 spin_unlock(&memcg_oom_lock);
3407 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg)
3409 struct mem_cgroup *iter;
3411 for_each_mem_cgroup_tree(iter, memcg)
3412 mem_cgroup_oom_notify_cb(iter);
3415 static int __mem_cgroup_usage_register_event(struct mem_cgroup *memcg,
3416 struct eventfd_ctx *eventfd, const char *args, enum res_type type)
3418 struct mem_cgroup_thresholds *thresholds;
3419 struct mem_cgroup_threshold_ary *new;
3420 unsigned long threshold;
3421 unsigned long usage;
3424 ret = page_counter_memparse(args, "-1", &threshold);
3428 mutex_lock(&memcg->thresholds_lock);
3431 thresholds = &memcg->thresholds;
3432 usage = mem_cgroup_usage(memcg, false);
3433 } else if (type == _MEMSWAP) {
3434 thresholds = &memcg->memsw_thresholds;
3435 usage = mem_cgroup_usage(memcg, true);
3439 /* Check if a threshold crossed before adding a new one */
3440 if (thresholds->primary)
3441 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
3443 size = thresholds->primary ? thresholds->primary->size + 1 : 1;
3445 /* Allocate memory for new array of thresholds */
3446 new = kmalloc(sizeof(*new) + size * sizeof(struct mem_cgroup_threshold),
3454 /* Copy thresholds (if any) to new array */
3455 if (thresholds->primary) {
3456 memcpy(new->entries, thresholds->primary->entries, (size - 1) *
3457 sizeof(struct mem_cgroup_threshold));
3460 /* Add new threshold */
3461 new->entries[size - 1].eventfd = eventfd;
3462 new->entries[size - 1].threshold = threshold;
3464 /* Sort thresholds. Registering of new threshold isn't time-critical */
3465 sort(new->entries, size, sizeof(struct mem_cgroup_threshold),
3466 compare_thresholds, NULL);
3468 /* Find current threshold */
3469 new->current_threshold = -1;
3470 for (i = 0; i < size; i++) {
3471 if (new->entries[i].threshold <= usage) {
3473 * new->current_threshold will not be used until
3474 * rcu_assign_pointer(), so it's safe to increment
3477 ++new->current_threshold;
3482 /* Free old spare buffer and save old primary buffer as spare */
3483 kfree(thresholds->spare);
3484 thresholds->spare = thresholds->primary;
3486 rcu_assign_pointer(thresholds->primary, new);
3488 /* To be sure that nobody uses thresholds */
3492 mutex_unlock(&memcg->thresholds_lock);
3497 static int mem_cgroup_usage_register_event(struct mem_cgroup *memcg,
3498 struct eventfd_ctx *eventfd, const char *args)
3500 return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEM);
3503 static int memsw_cgroup_usage_register_event(struct mem_cgroup *memcg,
3504 struct eventfd_ctx *eventfd, const char *args)
3506 return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEMSWAP);
3509 static void __mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
3510 struct eventfd_ctx *eventfd, enum res_type type)
3512 struct mem_cgroup_thresholds *thresholds;
3513 struct mem_cgroup_threshold_ary *new;
3514 unsigned long usage;
3515 int i, j, size, entries;
3517 mutex_lock(&memcg->thresholds_lock);
3520 thresholds = &memcg->thresholds;
3521 usage = mem_cgroup_usage(memcg, false);
3522 } else if (type == _MEMSWAP) {
3523 thresholds = &memcg->memsw_thresholds;
3524 usage = mem_cgroup_usage(memcg, true);
3528 if (!thresholds->primary)
3531 /* Check if a threshold crossed before removing */
3532 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
3534 /* Calculate new number of threshold */
3536 for (i = 0; i < thresholds->primary->size; i++) {
3537 if (thresholds->primary->entries[i].eventfd != eventfd)
3543 new = thresholds->spare;
3545 /* If no items related to eventfd have been cleared, nothing to do */
3549 /* Set thresholds array to NULL if we don't have thresholds */
3558 /* Copy thresholds and find current threshold */
3559 new->current_threshold = -1;
3560 for (i = 0, j = 0; i < thresholds->primary->size; i++) {
3561 if (thresholds->primary->entries[i].eventfd == eventfd)
3564 new->entries[j] = thresholds->primary->entries[i];
3565 if (new->entries[j].threshold <= usage) {
3567 * new->current_threshold will not be used
3568 * until rcu_assign_pointer(), so it's safe to increment
3571 ++new->current_threshold;
3577 /* Swap primary and spare array */
3578 thresholds->spare = thresholds->primary;
3580 rcu_assign_pointer(thresholds->primary, new);
3582 /* To be sure that nobody uses thresholds */
3585 /* If all events are unregistered, free the spare array */
3587 kfree(thresholds->spare);
3588 thresholds->spare = NULL;
3591 mutex_unlock(&memcg->thresholds_lock);
3594 static void mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
3595 struct eventfd_ctx *eventfd)
3597 return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEM);
3600 static void memsw_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
3601 struct eventfd_ctx *eventfd)
3603 return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEMSWAP);
3606 static int mem_cgroup_oom_register_event(struct mem_cgroup *memcg,
3607 struct eventfd_ctx *eventfd, const char *args)
3609 struct mem_cgroup_eventfd_list *event;
3611 event = kmalloc(sizeof(*event), GFP_KERNEL);
3615 spin_lock(&memcg_oom_lock);
3617 event->eventfd = eventfd;
3618 list_add(&event->list, &memcg->oom_notify);
3620 /* already in OOM ? */
3621 if (memcg->under_oom)
3622 eventfd_signal(eventfd, 1);
3623 spin_unlock(&memcg_oom_lock);
3628 static void mem_cgroup_oom_unregister_event(struct mem_cgroup *memcg,
3629 struct eventfd_ctx *eventfd)
3631 struct mem_cgroup_eventfd_list *ev, *tmp;
3633 spin_lock(&memcg_oom_lock);
3635 list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) {
3636 if (ev->eventfd == eventfd) {
3637 list_del(&ev->list);
3642 spin_unlock(&memcg_oom_lock);
3645 static int mem_cgroup_oom_control_read(struct seq_file *sf, void *v)
3647 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(sf));
3649 seq_printf(sf, "oom_kill_disable %d\n", memcg->oom_kill_disable);
3650 seq_printf(sf, "under_oom %d\n", (bool)memcg->under_oom);
3651 seq_printf(sf, "oom_kill %lu\n",
3652 atomic_long_read(&memcg->memory_events[MEMCG_OOM_KILL]));
3656 static int mem_cgroup_oom_control_write(struct cgroup_subsys_state *css,
3657 struct cftype *cft, u64 val)
3659 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
3661 /* cannot set to root cgroup and only 0 and 1 are allowed */
3662 if (!css->parent || !((val == 0) || (val == 1)))
3665 memcg->oom_kill_disable = val;
3667 memcg_oom_recover(memcg);
3672 #ifdef CONFIG_CGROUP_WRITEBACK
3674 struct list_head *mem_cgroup_cgwb_list(struct mem_cgroup *memcg)
3676 return &memcg->cgwb_list;
3679 static int memcg_wb_domain_init(struct mem_cgroup *memcg, gfp_t gfp)
3681 return wb_domain_init(&memcg->cgwb_domain, gfp);
3684 static void memcg_wb_domain_exit(struct mem_cgroup *memcg)
3686 wb_domain_exit(&memcg->cgwb_domain);
3689 static void memcg_wb_domain_size_changed(struct mem_cgroup *memcg)
3691 wb_domain_size_changed(&memcg->cgwb_domain);
3694 struct wb_domain *mem_cgroup_wb_domain(struct bdi_writeback *wb)
3696 struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css);
3698 if (!memcg->css.parent)
3701 return &memcg->cgwb_domain;
3705 * idx can be of type enum memcg_stat_item or node_stat_item.
3706 * Keep in sync with memcg_exact_page().
3708 static unsigned long memcg_exact_page_state(struct mem_cgroup *memcg, int idx)
3710 long x = atomic_long_read(&memcg->stat[idx]);
3713 for_each_online_cpu(cpu)
3714 x += per_cpu_ptr(memcg->stat_cpu, cpu)->count[idx];
3721 * mem_cgroup_wb_stats - retrieve writeback related stats from its memcg
3722 * @wb: bdi_writeback in question
3723 * @pfilepages: out parameter for number of file pages
3724 * @pheadroom: out parameter for number of allocatable pages according to memcg
3725 * @pdirty: out parameter for number of dirty pages
3726 * @pwriteback: out parameter for number of pages under writeback
3728 * Determine the numbers of file, headroom, dirty, and writeback pages in
3729 * @wb's memcg. File, dirty and writeback are self-explanatory. Headroom
3730 * is a bit more involved.
3732 * A memcg's headroom is "min(max, high) - used". In the hierarchy, the
3733 * headroom is calculated as the lowest headroom of itself and the
3734 * ancestors. Note that this doesn't consider the actual amount of
3735 * available memory in the system. The caller should further cap
3736 * *@pheadroom accordingly.
3738 void mem_cgroup_wb_stats(struct bdi_writeback *wb, unsigned long *pfilepages,
3739 unsigned long *pheadroom, unsigned long *pdirty,
3740 unsigned long *pwriteback)
3742 struct mem_cgroup *memcg = mem_cgroup_from_css(wb->memcg_css);
3743 struct mem_cgroup *parent;
3745 *pdirty = memcg_exact_page_state(memcg, NR_FILE_DIRTY);
3747 /* this should eventually include NR_UNSTABLE_NFS */
3748 *pwriteback = memcg_exact_page_state(memcg, NR_WRITEBACK);
3749 *pfilepages = mem_cgroup_nr_lru_pages(memcg, (1 << LRU_INACTIVE_FILE) |
3750 (1 << LRU_ACTIVE_FILE));
3751 *pheadroom = PAGE_COUNTER_MAX;
3753 while ((parent = parent_mem_cgroup(memcg))) {
3754 unsigned long ceiling = min(memcg->memory.limit, memcg->high);
3755 unsigned long used = page_counter_read(&memcg->memory);
3757 *pheadroom = min(*pheadroom, ceiling - min(ceiling, used));
3762 #else /* CONFIG_CGROUP_WRITEBACK */
3764 static int memcg_wb_domain_init(struct mem_cgroup *memcg, gfp_t gfp)
3769 static void memcg_wb_domain_exit(struct mem_cgroup *memcg)
3773 static void memcg_wb_domain_size_changed(struct mem_cgroup *memcg)
3777 #endif /* CONFIG_CGROUP_WRITEBACK */
3780 * DO NOT USE IN NEW FILES.
3782 * "cgroup.event_control" implementation.
3784 * This is way over-engineered. It tries to support fully configurable
3785 * events for each user. Such level of flexibility is completely
3786 * unnecessary especially in the light of the planned unified hierarchy.
3788 * Please deprecate this and replace with something simpler if at all
3793 * Unregister event and free resources.
3795 * Gets called from workqueue.
3797 static void memcg_event_remove(struct work_struct *work)
3799 struct mem_cgroup_event *event =
3800 container_of(work, struct mem_cgroup_event, remove);
3801 struct mem_cgroup *memcg = event->memcg;
3803 remove_wait_queue(event->wqh, &event->wait);
3805 event->unregister_event(memcg, event->eventfd);
3807 /* Notify userspace the event is going away. */
3808 eventfd_signal(event->eventfd, 1);
3810 eventfd_ctx_put(event->eventfd);
3812 css_put(&memcg->css);
3816 * Gets called on POLLHUP on eventfd when user closes it.
3818 * Called with wqh->lock held and interrupts disabled.
3820 static int memcg_event_wake(wait_queue_entry_t *wait, unsigned mode,
3821 int sync, void *key)
3823 struct mem_cgroup_event *event =
3824 container_of(wait, struct mem_cgroup_event, wait);
3825 struct mem_cgroup *memcg = event->memcg;
3826 unsigned long flags = (unsigned long)key;
3828 if (flags & POLLHUP) {
3830 * If the event has been detached at cgroup removal, we
3831 * can simply return knowing the other side will cleanup
3834 * We can't race against event freeing since the other
3835 * side will require wqh->lock via remove_wait_queue(),
3838 spin_lock(&memcg->event_list_lock);
3839 if (!list_empty(&event->list)) {
3840 list_del_init(&event->list);
3842 * We are in atomic context, but cgroup_event_remove()
3843 * may sleep, so we have to call it in workqueue.
3845 schedule_work(&event->remove);
3847 spin_unlock(&memcg->event_list_lock);
3853 static void memcg_event_ptable_queue_proc(struct file *file,
3854 wait_queue_head_t *wqh, poll_table *pt)
3856 struct mem_cgroup_event *event =
3857 container_of(pt, struct mem_cgroup_event, pt);
3860 add_wait_queue(wqh, &event->wait);
3864 * DO NOT USE IN NEW FILES.
3866 * Parse input and register new cgroup event handler.
3868 * Input must be in format '<event_fd> <control_fd> <args>'.
3869 * Interpretation of args is defined by control file implementation.
3871 static ssize_t memcg_write_event_control(struct kernfs_open_file *of,
3872 char *buf, size_t nbytes, loff_t off)
3874 struct cgroup_subsys_state *css = of_css(of);
3875 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
3876 struct mem_cgroup_event *event;
3877 struct cgroup_subsys_state *cfile_css;
3878 unsigned int efd, cfd;
3885 buf = strstrip(buf);
3887 efd = simple_strtoul(buf, &endp, 10);
3892 cfd = simple_strtoul(buf, &endp, 10);
3893 if ((*endp != ' ') && (*endp != '\0'))
3897 event = kzalloc(sizeof(*event), GFP_KERNEL);
3901 event->memcg = memcg;
3902 INIT_LIST_HEAD(&event->list);
3903 init_poll_funcptr(&event->pt, memcg_event_ptable_queue_proc);
3904 init_waitqueue_func_entry(&event->wait, memcg_event_wake);
3905 INIT_WORK(&event->remove, memcg_event_remove);
3913 event->eventfd = eventfd_ctx_fileget(efile.file);
3914 if (IS_ERR(event->eventfd)) {
3915 ret = PTR_ERR(event->eventfd);
3922 goto out_put_eventfd;
3925 /* the process need read permission on control file */
3926 /* AV: shouldn't we check that it's been opened for read instead? */
3927 ret = inode_permission(file_inode(cfile.file), MAY_READ);
3932 * Determine the event callbacks and set them in @event. This used
3933 * to be done via struct cftype but cgroup core no longer knows
3934 * about these events. The following is crude but the whole thing
3935 * is for compatibility anyway.
3937 * DO NOT ADD NEW FILES.
3939 name = cfile.file->f_path.dentry->d_name.name;
3941 if (!strcmp(name, "memory.usage_in_bytes")) {
3942 event->register_event = mem_cgroup_usage_register_event;
3943 event->unregister_event = mem_cgroup_usage_unregister_event;
3944 } else if (!strcmp(name, "memory.oom_control")) {
3945 event->register_event = mem_cgroup_oom_register_event;
3946 event->unregister_event = mem_cgroup_oom_unregister_event;
3947 } else if (!strcmp(name, "memory.pressure_level")) {
3948 event->register_event = vmpressure_register_event;
3949 event->unregister_event = vmpressure_unregister_event;
3950 } else if (!strcmp(name, "memory.memsw.usage_in_bytes")) {
3951 event->register_event = memsw_cgroup_usage_register_event;
3952 event->unregister_event = memsw_cgroup_usage_unregister_event;
3959 * Verify @cfile should belong to @css. Also, remaining events are
3960 * automatically removed on cgroup destruction but the removal is
3961 * asynchronous, so take an extra ref on @css.
3963 cfile_css = css_tryget_online_from_dir(cfile.file->f_path.dentry->d_parent,
3964 &memory_cgrp_subsys);
3966 if (IS_ERR(cfile_css))
3968 if (cfile_css != css) {
3973 ret = event->register_event(memcg, event->eventfd, buf);
3977 efile.file->f_op->poll(efile.file, &event->pt);
3979 spin_lock(&memcg->event_list_lock);
3980 list_add(&event->list, &memcg->event_list);
3981 spin_unlock(&memcg->event_list_lock);
3993 eventfd_ctx_put(event->eventfd);
4002 static struct cftype mem_cgroup_legacy_files[] = {
4004 .name = "usage_in_bytes",
4005 .private = MEMFILE_PRIVATE(_MEM, RES_USAGE),
4006 .read_u64 = mem_cgroup_read_u64,
4009 .name = "max_usage_in_bytes",
4010 .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE),
4011 .write = mem_cgroup_reset,
4012 .read_u64 = mem_cgroup_read_u64,
4015 .name = "limit_in_bytes",
4016 .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT),
4017 .write = mem_cgroup_write,
4018 .read_u64 = mem_cgroup_read_u64,
4021 .name = "soft_limit_in_bytes",
4022 .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT),
4023 .write = mem_cgroup_write,
4024 .read_u64 = mem_cgroup_read_u64,
4028 .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT),
4029 .write = mem_cgroup_reset,
4030 .read_u64 = mem_cgroup_read_u64,
4034 .seq_show = memcg_stat_show,
4037 .name = "force_empty",
4038 .write = mem_cgroup_force_empty_write,
4041 .name = "use_hierarchy",
4042 .write_u64 = mem_cgroup_hierarchy_write,
4043 .read_u64 = mem_cgroup_hierarchy_read,
4046 .name = "cgroup.event_control", /* XXX: for compat */
4047 .write = memcg_write_event_control,
4048 .flags = CFTYPE_NO_PREFIX | CFTYPE_WORLD_WRITABLE,
4051 .name = "swappiness",
4052 .read_u64 = mem_cgroup_swappiness_read,
4053 .write_u64 = mem_cgroup_swappiness_write,
4056 .name = "move_charge_at_immigrate",
4057 .read_u64 = mem_cgroup_move_charge_read,
4058 .write_u64 = mem_cgroup_move_charge_write,
4061 .name = "oom_control",
4062 .seq_show = mem_cgroup_oom_control_read,
4063 .write_u64 = mem_cgroup_oom_control_write,
4064 .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL),
4067 .name = "pressure_level",
4071 .name = "numa_stat",
4072 .seq_show = memcg_numa_stat_show,
4076 .name = "kmem.limit_in_bytes",
4077 .private = MEMFILE_PRIVATE(_KMEM, RES_LIMIT),
4078 .write = mem_cgroup_write,
4079 .read_u64 = mem_cgroup_read_u64,
4082 .name = "kmem.usage_in_bytes",
4083 .private = MEMFILE_PRIVATE(_KMEM, RES_USAGE),
4084 .read_u64 = mem_cgroup_read_u64,
4087 .name = "kmem.failcnt",
4088 .private = MEMFILE_PRIVATE(_KMEM, RES_FAILCNT),
4089 .write = mem_cgroup_reset,
4090 .read_u64 = mem_cgroup_read_u64,
4093 .name = "kmem.max_usage_in_bytes",
4094 .private = MEMFILE_PRIVATE(_KMEM, RES_MAX_USAGE),
4095 .write = mem_cgroup_reset,
4096 .read_u64 = mem_cgroup_read_u64,
4098 #ifdef CONFIG_SLABINFO
4100 .name = "kmem.slabinfo",
4101 .seq_start = memcg_slab_start,
4102 .seq_next = memcg_slab_next,
4103 .seq_stop = memcg_slab_stop,
4104 .seq_show = memcg_slab_show,
4108 .name = "kmem.tcp.limit_in_bytes",
4109 .private = MEMFILE_PRIVATE(_TCP, RES_LIMIT),
4110 .write = mem_cgroup_write,
4111 .read_u64 = mem_cgroup_read_u64,
4114 .name = "kmem.tcp.usage_in_bytes",
4115 .private = MEMFILE_PRIVATE(_TCP, RES_USAGE),
4116 .read_u64 = mem_cgroup_read_u64,
4119 .name = "kmem.tcp.failcnt",
4120 .private = MEMFILE_PRIVATE(_TCP, RES_FAILCNT),
4121 .write = mem_cgroup_reset,
4122 .read_u64 = mem_cgroup_read_u64,
4125 .name = "kmem.tcp.max_usage_in_bytes",
4126 .private = MEMFILE_PRIVATE(_TCP, RES_MAX_USAGE),
4127 .write = mem_cgroup_reset,
4128 .read_u64 = mem_cgroup_read_u64,
4130 { }, /* terminate */
4134 * Private memory cgroup IDR
4136 * Swap-out records and page cache shadow entries need to store memcg
4137 * references in constrained space, so we maintain an ID space that is
4138 * limited to 16 bit (MEM_CGROUP_ID_MAX), limiting the total number of
4139 * memory-controlled cgroups to 64k.
4141 * However, there usually are many references to the oflline CSS after
4142 * the cgroup has been destroyed, such as page cache or reclaimable
4143 * slab objects, that don't need to hang on to the ID. We want to keep
4144 * those dead CSS from occupying IDs, or we might quickly exhaust the
4145 * relatively small ID space and prevent the creation of new cgroups
4146 * even when there are much fewer than 64k cgroups - possibly none.
4148 * Maintain a private 16-bit ID space for memcg, and allow the ID to
4149 * be freed and recycled when it's no longer needed, which is usually
4150 * when the CSS is offlined.
4152 * The only exception to that are records of swapped out tmpfs/shmem
4153 * pages that need to be attributed to live ancestors on swapin. But
4154 * those references are manageable from userspace.
4157 static DEFINE_IDR(mem_cgroup_idr);
4159 static void mem_cgroup_id_remove(struct mem_cgroup *memcg)
4161 if (memcg->id.id > 0) {
4162 idr_remove(&mem_cgroup_idr, memcg->id.id);
4167 static void mem_cgroup_id_get_many(struct mem_cgroup *memcg, unsigned int n)
4169 VM_BUG_ON(atomic_read(&memcg->id.ref) <= 0);
4170 atomic_add(n, &memcg->id.ref);
4173 static void mem_cgroup_id_put_many(struct mem_cgroup *memcg, unsigned int n)
4175 VM_BUG_ON(atomic_read(&memcg->id.ref) < n);
4176 if (atomic_sub_and_test(n, &memcg->id.ref)) {
4177 mem_cgroup_id_remove(memcg);
4179 /* Memcg ID pins CSS */
4180 css_put(&memcg->css);
4184 static inline void mem_cgroup_id_get(struct mem_cgroup *memcg)
4186 mem_cgroup_id_get_many(memcg, 1);
4189 static inline void mem_cgroup_id_put(struct mem_cgroup *memcg)
4191 mem_cgroup_id_put_many(memcg, 1);
4195 * mem_cgroup_from_id - look up a memcg from a memcg id
4196 * @id: the memcg id to look up
4198 * Caller must hold rcu_read_lock().
4200 struct mem_cgroup *mem_cgroup_from_id(unsigned short id)
4202 WARN_ON_ONCE(!rcu_read_lock_held());
4203 return idr_find(&mem_cgroup_idr, id);
4206 static int alloc_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node)
4208 struct mem_cgroup_per_node *pn;
4211 * This routine is called against possible nodes.
4212 * But it's BUG to call kmalloc() against offline node.
4214 * TODO: this routine can waste much memory for nodes which will
4215 * never be onlined. It's better to use memory hotplug callback
4218 if (!node_state(node, N_NORMAL_MEMORY))
4220 pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp);
4224 pn->lruvec_stat_cpu = alloc_percpu(struct lruvec_stat);
4225 if (!pn->lruvec_stat_cpu) {
4230 lruvec_init(&pn->lruvec);
4231 pn->usage_in_excess = 0;
4232 pn->on_tree = false;
4235 memcg->nodeinfo[node] = pn;
4239 static void free_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node)
4241 struct mem_cgroup_per_node *pn = memcg->nodeinfo[node];
4246 free_percpu(pn->lruvec_stat_cpu);
4250 static void __mem_cgroup_free(struct mem_cgroup *memcg)
4255 free_mem_cgroup_per_node_info(memcg, node);
4256 free_percpu(memcg->stat_cpu);
4260 static void mem_cgroup_free(struct mem_cgroup *memcg)
4262 memcg_wb_domain_exit(memcg);
4263 __mem_cgroup_free(memcg);
4266 static struct mem_cgroup *mem_cgroup_alloc(void)
4268 struct mem_cgroup *memcg;
4272 size = sizeof(struct mem_cgroup);
4273 size += nr_node_ids * sizeof(struct mem_cgroup_per_node *);
4275 memcg = kzalloc(size, GFP_KERNEL);
4279 memcg->id.id = idr_alloc(&mem_cgroup_idr, NULL,
4280 1, MEM_CGROUP_ID_MAX,
4282 if (memcg->id.id < 0)
4285 memcg->stat_cpu = alloc_percpu(struct mem_cgroup_stat_cpu);
4286 if (!memcg->stat_cpu)
4290 if (alloc_mem_cgroup_per_node_info(memcg, node))
4293 if (memcg_wb_domain_init(memcg, GFP_KERNEL))
4296 INIT_WORK(&memcg->high_work, high_work_func);
4297 memcg->last_scanned_node = MAX_NUMNODES;
4298 INIT_LIST_HEAD(&memcg->oom_notify);
4299 mutex_init(&memcg->thresholds_lock);
4300 spin_lock_init(&memcg->move_lock);
4301 vmpressure_init(&memcg->vmpressure);
4302 INIT_LIST_HEAD(&memcg->event_list);
4303 spin_lock_init(&memcg->event_list_lock);
4304 memcg->socket_pressure = jiffies;
4306 memcg->kmemcg_id = -1;
4308 #ifdef CONFIG_CGROUP_WRITEBACK
4309 INIT_LIST_HEAD(&memcg->cgwb_list);
4311 idr_replace(&mem_cgroup_idr, memcg, memcg->id.id);
4314 mem_cgroup_id_remove(memcg);
4315 __mem_cgroup_free(memcg);
4319 static struct cgroup_subsys_state * __ref
4320 mem_cgroup_css_alloc(struct cgroup_subsys_state *parent_css)
4322 struct mem_cgroup *parent = mem_cgroup_from_css(parent_css);
4323 struct mem_cgroup *memcg;
4324 long error = -ENOMEM;
4326 memcg = mem_cgroup_alloc();
4328 return ERR_PTR(error);
4330 memcg->high = PAGE_COUNTER_MAX;
4331 memcg->soft_limit = PAGE_COUNTER_MAX;
4333 memcg->swappiness = mem_cgroup_swappiness(parent);
4334 memcg->oom_kill_disable = parent->oom_kill_disable;
4336 if (parent && parent->use_hierarchy) {
4337 memcg->use_hierarchy = true;
4338 page_counter_init(&memcg->memory, &parent->memory);
4339 page_counter_init(&memcg->swap, &parent->swap);
4340 page_counter_init(&memcg->memsw, &parent->memsw);
4341 page_counter_init(&memcg->kmem, &parent->kmem);
4342 page_counter_init(&memcg->tcpmem, &parent->tcpmem);
4344 page_counter_init(&memcg->memory, NULL);
4345 page_counter_init(&memcg->swap, NULL);
4346 page_counter_init(&memcg->memsw, NULL);
4347 page_counter_init(&memcg->kmem, NULL);
4348 page_counter_init(&memcg->tcpmem, NULL);
4350 * Deeper hierachy with use_hierarchy == false doesn't make
4351 * much sense so let cgroup subsystem know about this
4352 * unfortunate state in our controller.
4354 if (parent != root_mem_cgroup)
4355 memory_cgrp_subsys.broken_hierarchy = true;
4358 /* The following stuff does not apply to the root */
4360 root_mem_cgroup = memcg;
4364 error = memcg_online_kmem(memcg);
4368 if (cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_nosocket)
4369 static_branch_inc(&memcg_sockets_enabled_key);
4373 mem_cgroup_id_remove(memcg);
4374 mem_cgroup_free(memcg);
4375 return ERR_PTR(-ENOMEM);
4378 static int mem_cgroup_css_online(struct cgroup_subsys_state *css)
4380 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4382 /* Online state pins memcg ID, memcg ID pins CSS */
4383 atomic_set(&memcg->id.ref, 1);
4388 static void mem_cgroup_css_offline(struct cgroup_subsys_state *css)
4390 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4391 struct mem_cgroup_event *event, *tmp;
4394 * Unregister events and notify userspace.
4395 * Notify userspace about cgroup removing only after rmdir of cgroup
4396 * directory to avoid race between userspace and kernelspace.
4398 spin_lock(&memcg->event_list_lock);
4399 list_for_each_entry_safe(event, tmp, &memcg->event_list, list) {
4400 list_del_init(&event->list);
4401 schedule_work(&event->remove);
4403 spin_unlock(&memcg->event_list_lock);
4407 memcg_offline_kmem(memcg);
4408 wb_memcg_offline(memcg);
4410 mem_cgroup_id_put(memcg);
4413 static void mem_cgroup_css_released(struct cgroup_subsys_state *css)
4415 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4417 invalidate_reclaim_iterators(memcg);
4420 static void mem_cgroup_css_free(struct cgroup_subsys_state *css)
4422 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4424 if (cgroup_subsys_on_dfl(memory_cgrp_subsys) && !cgroup_memory_nosocket)
4425 static_branch_dec(&memcg_sockets_enabled_key);
4427 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && memcg->tcpmem_active)
4428 static_branch_dec(&memcg_sockets_enabled_key);
4430 vmpressure_cleanup(&memcg->vmpressure);
4431 cancel_work_sync(&memcg->high_work);
4432 mem_cgroup_remove_from_trees(memcg);
4433 memcg_free_kmem(memcg);
4434 mem_cgroup_free(memcg);
4438 * mem_cgroup_css_reset - reset the states of a mem_cgroup
4439 * @css: the target css
4441 * Reset the states of the mem_cgroup associated with @css. This is
4442 * invoked when the userland requests disabling on the default hierarchy
4443 * but the memcg is pinned through dependency. The memcg should stop
4444 * applying policies and should revert to the vanilla state as it may be
4445 * made visible again.
4447 * The current implementation only resets the essential configurations.
4448 * This needs to be expanded to cover all the visible parts.
4450 static void mem_cgroup_css_reset(struct cgroup_subsys_state *css)
4452 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
4454 page_counter_limit(&memcg->memory, PAGE_COUNTER_MAX);
4455 page_counter_limit(&memcg->swap, PAGE_COUNTER_MAX);
4456 page_counter_limit(&memcg->memsw, PAGE_COUNTER_MAX);
4457 page_counter_limit(&memcg->kmem, PAGE_COUNTER_MAX);
4458 page_counter_limit(&memcg->tcpmem, PAGE_COUNTER_MAX);
4460 memcg->high = PAGE_COUNTER_MAX;
4461 memcg->soft_limit = PAGE_COUNTER_MAX;
4462 memcg_wb_domain_size_changed(memcg);
4466 /* Handlers for move charge at task migration. */
4467 static int mem_cgroup_do_precharge(unsigned long count)
4471 /* Try a single bulk charge without reclaim first, kswapd may wake */
4472 ret = try_charge(mc.to, GFP_KERNEL & ~__GFP_DIRECT_RECLAIM, count);
4474 mc.precharge += count;
4478 /* Try charges one by one with reclaim, but do not retry */
4480 ret = try_charge(mc.to, GFP_KERNEL | __GFP_NORETRY, 1);
4494 enum mc_target_type {
4501 static struct page *mc_handle_present_pte(struct vm_area_struct *vma,
4502 unsigned long addr, pte_t ptent)
4504 struct page *page = _vm_normal_page(vma, addr, ptent, true);
4506 if (!page || !page_mapped(page))
4508 if (PageAnon(page)) {
4509 if (!(mc.flags & MOVE_ANON))
4512 if (!(mc.flags & MOVE_FILE))
4515 if (!get_page_unless_zero(page))
4521 #if defined(CONFIG_SWAP) || defined(CONFIG_DEVICE_PRIVATE)
4522 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
4523 pte_t ptent, swp_entry_t *entry)
4525 struct page *page = NULL;
4526 swp_entry_t ent = pte_to_swp_entry(ptent);
4528 if (!(mc.flags & MOVE_ANON))
4532 * Handle MEMORY_DEVICE_PRIVATE which are ZONE_DEVICE page belonging to
4533 * a device and because they are not accessible by CPU they are store
4534 * as special swap entry in the CPU page table.
4536 if (is_device_private_entry(ent)) {
4537 page = device_private_entry_to_page(ent);
4539 * MEMORY_DEVICE_PRIVATE means ZONE_DEVICE page and which have
4540 * a refcount of 1 when free (unlike normal page)
4542 if (!page_ref_add_unless(page, 1, 1))
4547 if (non_swap_entry(ent))
4551 * Because lookup_swap_cache() updates some statistics counter,
4552 * we call find_get_page() with swapper_space directly.
4554 page = find_get_page(swap_address_space(ent), swp_offset(ent));
4555 if (do_memsw_account())
4556 entry->val = ent.val;
4561 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
4562 pte_t ptent, swp_entry_t *entry)
4568 static struct page *mc_handle_file_pte(struct vm_area_struct *vma,
4569 unsigned long addr, pte_t ptent, swp_entry_t *entry)
4571 struct page *page = NULL;
4572 struct address_space *mapping;
4575 if (!vma->vm_file) /* anonymous vma */
4577 if (!(mc.flags & MOVE_FILE))
4580 mapping = vma->vm_file->f_mapping;
4581 pgoff = linear_page_index(vma, addr);
4583 /* page is moved even if it's not RSS of this task(page-faulted). */
4585 /* shmem/tmpfs may report page out on swap: account for that too. */
4586 if (shmem_mapping(mapping)) {
4587 page = find_get_entry(mapping, pgoff);
4588 if (radix_tree_exceptional_entry(page)) {
4589 swp_entry_t swp = radix_to_swp_entry(page);
4590 if (do_memsw_account())
4592 page = find_get_page(swap_address_space(swp),
4596 page = find_get_page(mapping, pgoff);
4598 page = find_get_page(mapping, pgoff);
4604 * mem_cgroup_move_account - move account of the page
4606 * @compound: charge the page as compound or small page
4607 * @from: mem_cgroup which the page is moved from.
4608 * @to: mem_cgroup which the page is moved to. @from != @to.
4610 * The caller must make sure the page is not on LRU (isolate_page() is useful.)
4612 * This function doesn't do "charge" to new cgroup and doesn't do "uncharge"
4615 static int mem_cgroup_move_account(struct page *page,
4617 struct mem_cgroup *from,
4618 struct mem_cgroup *to)
4620 unsigned long flags;
4621 unsigned int nr_pages = compound ? hpage_nr_pages(page) : 1;
4625 VM_BUG_ON(from == to);
4626 VM_BUG_ON_PAGE(PageLRU(page), page);
4627 VM_BUG_ON(compound && !PageTransHuge(page));
4630 * Prevent mem_cgroup_migrate() from looking at
4631 * page->mem_cgroup of its source page while we change it.
4634 if (!trylock_page(page))
4638 if (page->mem_cgroup != from)
4641 anon = PageAnon(page);
4643 spin_lock_irqsave(&from->move_lock, flags);
4645 if (!anon && page_mapped(page)) {
4646 __mod_memcg_state(from, NR_FILE_MAPPED, -nr_pages);
4647 __mod_memcg_state(to, NR_FILE_MAPPED, nr_pages);
4651 * move_lock grabbed above and caller set from->moving_account, so
4652 * mod_memcg_page_state will serialize updates to PageDirty.
4653 * So mapping should be stable for dirty pages.
4655 if (!anon && PageDirty(page)) {
4656 struct address_space *mapping = page_mapping(page);
4658 if (mapping_cap_account_dirty(mapping)) {
4659 __mod_memcg_state(from, NR_FILE_DIRTY, -nr_pages);
4660 __mod_memcg_state(to, NR_FILE_DIRTY, nr_pages);
4664 if (PageWriteback(page)) {
4665 __mod_memcg_state(from, NR_WRITEBACK, -nr_pages);
4666 __mod_memcg_state(to, NR_WRITEBACK, nr_pages);
4670 * It is safe to change page->mem_cgroup here because the page
4671 * is referenced, charged, and isolated - we can't race with
4672 * uncharging, charging, migration, or LRU putback.
4675 /* caller should have done css_get */
4676 page->mem_cgroup = to;
4677 spin_unlock_irqrestore(&from->move_lock, flags);
4681 local_irq_disable();
4682 mem_cgroup_charge_statistics(to, page, compound, nr_pages);
4683 memcg_check_events(to, page);
4684 mem_cgroup_charge_statistics(from, page, compound, -nr_pages);
4685 memcg_check_events(from, page);
4694 * get_mctgt_type - get target type of moving charge
4695 * @vma: the vma the pte to be checked belongs
4696 * @addr: the address corresponding to the pte to be checked
4697 * @ptent: the pte to be checked
4698 * @target: the pointer the target page or swap ent will be stored(can be NULL)
4701 * 0(MC_TARGET_NONE): if the pte is not a target for move charge.
4702 * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for
4703 * move charge. if @target is not NULL, the page is stored in target->page
4704 * with extra refcnt got(Callers should handle it).
4705 * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a
4706 * target for charge migration. if @target is not NULL, the entry is stored
4708 * 3(MC_TARGET_DEVICE): like MC_TARGET_PAGE but page is MEMORY_DEVICE_PUBLIC
4709 * or MEMORY_DEVICE_PRIVATE (so ZONE_DEVICE page and thus not on the lru).
4710 * For now we such page is charge like a regular page would be as for all
4711 * intent and purposes it is just special memory taking the place of a
4714 * See Documentations/vm/hmm.txt and include/linux/hmm.h
4716 * Called with pte lock held.
4719 static enum mc_target_type get_mctgt_type(struct vm_area_struct *vma,
4720 unsigned long addr, pte_t ptent, union mc_target *target)
4722 struct page *page = NULL;
4723 enum mc_target_type ret = MC_TARGET_NONE;
4724 swp_entry_t ent = { .val = 0 };
4726 if (pte_present(ptent))
4727 page = mc_handle_present_pte(vma, addr, ptent);
4728 else if (is_swap_pte(ptent))
4729 page = mc_handle_swap_pte(vma, ptent, &ent);
4730 else if (pte_none(ptent))
4731 page = mc_handle_file_pte(vma, addr, ptent, &ent);
4733 if (!page && !ent.val)
4737 * Do only loose check w/o serialization.
4738 * mem_cgroup_move_account() checks the page is valid or
4739 * not under LRU exclusion.
4741 if (page->mem_cgroup == mc.from) {
4742 ret = MC_TARGET_PAGE;
4743 if (is_device_private_page(page) ||
4744 is_device_public_page(page))
4745 ret = MC_TARGET_DEVICE;
4747 target->page = page;
4749 if (!ret || !target)
4753 * There is a swap entry and a page doesn't exist or isn't charged.
4754 * But we cannot move a tail-page in a THP.
4756 if (ent.val && !ret && (!page || !PageTransCompound(page)) &&
4757 mem_cgroup_id(mc.from) == lookup_swap_cgroup_id(ent)) {
4758 ret = MC_TARGET_SWAP;
4765 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4767 * We don't consider PMD mapped swapping or file mapped pages because THP does
4768 * not support them for now.
4769 * Caller should make sure that pmd_trans_huge(pmd) is true.
4771 static enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
4772 unsigned long addr, pmd_t pmd, union mc_target *target)
4774 struct page *page = NULL;
4775 enum mc_target_type ret = MC_TARGET_NONE;
4777 if (unlikely(is_swap_pmd(pmd))) {
4778 VM_BUG_ON(thp_migration_supported() &&
4779 !is_pmd_migration_entry(pmd));
4782 page = pmd_page(pmd);
4783 VM_BUG_ON_PAGE(!page || !PageHead(page), page);
4784 if (!(mc.flags & MOVE_ANON))
4786 if (page->mem_cgroup == mc.from) {
4787 ret = MC_TARGET_PAGE;
4790 target->page = page;
4796 static inline enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
4797 unsigned long addr, pmd_t pmd, union mc_target *target)
4799 return MC_TARGET_NONE;
4803 static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd,
4804 unsigned long addr, unsigned long end,
4805 struct mm_walk *walk)
4807 struct vm_area_struct *vma = walk->vma;
4811 ptl = pmd_trans_huge_lock(pmd, vma);
4814 * Note their can not be MC_TARGET_DEVICE for now as we do not
4815 * support transparent huge page with MEMORY_DEVICE_PUBLIC or
4816 * MEMORY_DEVICE_PRIVATE but this might change.
4818 if (get_mctgt_type_thp(vma, addr, *pmd, NULL) == MC_TARGET_PAGE)
4819 mc.precharge += HPAGE_PMD_NR;
4824 if (pmd_trans_unstable(pmd))
4826 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
4827 for (; addr != end; pte++, addr += PAGE_SIZE)
4828 if (get_mctgt_type(vma, addr, *pte, NULL))
4829 mc.precharge++; /* increment precharge temporarily */
4830 pte_unmap_unlock(pte - 1, ptl);
4836 static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm)
4838 unsigned long precharge;
4840 struct mm_walk mem_cgroup_count_precharge_walk = {
4841 .pmd_entry = mem_cgroup_count_precharge_pte_range,
4844 down_read(&mm->mmap_sem);
4845 walk_page_range(0, mm->highest_vm_end,
4846 &mem_cgroup_count_precharge_walk);
4847 up_read(&mm->mmap_sem);
4849 precharge = mc.precharge;
4855 static int mem_cgroup_precharge_mc(struct mm_struct *mm)
4857 unsigned long precharge = mem_cgroup_count_precharge(mm);
4859 VM_BUG_ON(mc.moving_task);
4860 mc.moving_task = current;
4861 return mem_cgroup_do_precharge(precharge);
4864 /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */
4865 static void __mem_cgroup_clear_mc(void)
4867 struct mem_cgroup *from = mc.from;
4868 struct mem_cgroup *to = mc.to;
4870 /* we must uncharge all the leftover precharges from mc.to */
4872 cancel_charge(mc.to, mc.precharge);
4876 * we didn't uncharge from mc.from at mem_cgroup_move_account(), so
4877 * we must uncharge here.
4879 if (mc.moved_charge) {
4880 cancel_charge(mc.from, mc.moved_charge);
4881 mc.moved_charge = 0;
4883 /* we must fixup refcnts and charges */
4884 if (mc.moved_swap) {
4885 /* uncharge swap account from the old cgroup */
4886 if (!mem_cgroup_is_root(mc.from))
4887 page_counter_uncharge(&mc.from->memsw, mc.moved_swap);
4889 mem_cgroup_id_put_many(mc.from, mc.moved_swap);
4892 * we charged both to->memory and to->memsw, so we
4893 * should uncharge to->memory.
4895 if (!mem_cgroup_is_root(mc.to))
4896 page_counter_uncharge(&mc.to->memory, mc.moved_swap);
4898 css_put_many(&mc.to->css, mc.moved_swap);
4902 memcg_oom_recover(from);
4903 memcg_oom_recover(to);
4904 wake_up_all(&mc.waitq);
4907 static void mem_cgroup_clear_mc(void)
4909 struct mm_struct *mm = mc.mm;
4912 * we must clear moving_task before waking up waiters at the end of
4915 mc.moving_task = NULL;
4916 __mem_cgroup_clear_mc();
4917 spin_lock(&mc.lock);
4921 spin_unlock(&mc.lock);
4926 static int mem_cgroup_can_attach(struct cgroup_taskset *tset)
4928 struct cgroup_subsys_state *css;
4929 struct mem_cgroup *memcg = NULL; /* unneeded init to make gcc happy */
4930 struct mem_cgroup *from;
4931 struct task_struct *leader, *p;
4932 struct mm_struct *mm;
4933 unsigned long move_flags;
4936 /* charge immigration isn't supported on the default hierarchy */
4937 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
4941 * Multi-process migrations only happen on the default hierarchy
4942 * where charge immigration is not used. Perform charge
4943 * immigration if @tset contains a leader and whine if there are
4947 cgroup_taskset_for_each_leader(leader, css, tset) {
4950 memcg = mem_cgroup_from_css(css);
4956 * We are now commited to this value whatever it is. Changes in this
4957 * tunable will only affect upcoming migrations, not the current one.
4958 * So we need to save it, and keep it going.
4960 move_flags = READ_ONCE(memcg->move_charge_at_immigrate);
4964 from = mem_cgroup_from_task(p);
4966 VM_BUG_ON(from == memcg);
4968 mm = get_task_mm(p);
4971 /* We move charges only when we move a owner of the mm */
4972 if (mm->owner == p) {
4975 VM_BUG_ON(mc.precharge);
4976 VM_BUG_ON(mc.moved_charge);
4977 VM_BUG_ON(mc.moved_swap);
4979 spin_lock(&mc.lock);
4983 mc.flags = move_flags;
4984 spin_unlock(&mc.lock);
4985 /* We set mc.moving_task later */
4987 ret = mem_cgroup_precharge_mc(mm);
4989 mem_cgroup_clear_mc();
4996 static void mem_cgroup_cancel_attach(struct cgroup_taskset *tset)
4999 mem_cgroup_clear_mc();
5002 static int mem_cgroup_move_charge_pte_range(pmd_t *pmd,
5003 unsigned long addr, unsigned long end,
5004 struct mm_walk *walk)
5007 struct vm_area_struct *vma = walk->vma;
5010 enum mc_target_type target_type;
5011 union mc_target target;
5014 ptl = pmd_trans_huge_lock(pmd, vma);
5016 if (mc.precharge < HPAGE_PMD_NR) {
5020 target_type = get_mctgt_type_thp(vma, addr, *pmd, &target);
5021 if (target_type == MC_TARGET_PAGE) {
5023 if (!isolate_lru_page(page)) {
5024 if (!mem_cgroup_move_account(page, true,
5026 mc.precharge -= HPAGE_PMD_NR;
5027 mc.moved_charge += HPAGE_PMD_NR;
5029 putback_lru_page(page);
5032 } else if (target_type == MC_TARGET_DEVICE) {
5034 if (!mem_cgroup_move_account(page, true,
5036 mc.precharge -= HPAGE_PMD_NR;
5037 mc.moved_charge += HPAGE_PMD_NR;
5045 if (pmd_trans_unstable(pmd))
5048 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
5049 for (; addr != end; addr += PAGE_SIZE) {
5050 pte_t ptent = *(pte++);
5051 bool device = false;
5057 switch (get_mctgt_type(vma, addr, ptent, &target)) {
5058 case MC_TARGET_DEVICE:
5061 case MC_TARGET_PAGE:
5064 * We can have a part of the split pmd here. Moving it
5065 * can be done but it would be too convoluted so simply
5066 * ignore such a partial THP and keep it in original
5067 * memcg. There should be somebody mapping the head.
5069 if (PageTransCompound(page))
5071 if (!device && isolate_lru_page(page))
5073 if (!mem_cgroup_move_account(page, false,
5076 /* we uncharge from mc.from later. */
5080 putback_lru_page(page);
5081 put: /* get_mctgt_type() gets the page */
5084 case MC_TARGET_SWAP:
5086 if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to)) {
5088 mem_cgroup_id_get_many(mc.to, 1);
5089 /* we fixup other refcnts and charges later. */
5097 pte_unmap_unlock(pte - 1, ptl);
5102 * We have consumed all precharges we got in can_attach().
5103 * We try charge one by one, but don't do any additional
5104 * charges to mc.to if we have failed in charge once in attach()
5107 ret = mem_cgroup_do_precharge(1);
5115 static void mem_cgroup_move_charge(void)
5117 struct mm_walk mem_cgroup_move_charge_walk = {
5118 .pmd_entry = mem_cgroup_move_charge_pte_range,
5122 lru_add_drain_all();
5124 * Signal lock_page_memcg() to take the memcg's move_lock
5125 * while we're moving its pages to another memcg. Then wait
5126 * for already started RCU-only updates to finish.
5128 atomic_inc(&mc.from->moving_account);
5131 if (unlikely(!down_read_trylock(&mc.mm->mmap_sem))) {
5133 * Someone who are holding the mmap_sem might be waiting in
5134 * waitq. So we cancel all extra charges, wake up all waiters,
5135 * and retry. Because we cancel precharges, we might not be able
5136 * to move enough charges, but moving charge is a best-effort
5137 * feature anyway, so it wouldn't be a big problem.
5139 __mem_cgroup_clear_mc();
5144 * When we have consumed all precharges and failed in doing
5145 * additional charge, the page walk just aborts.
5147 walk_page_range(0, mc.mm->highest_vm_end, &mem_cgroup_move_charge_walk);
5149 up_read(&mc.mm->mmap_sem);
5150 atomic_dec(&mc.from->moving_account);
5153 static void mem_cgroup_move_task(void)
5156 mem_cgroup_move_charge();
5157 mem_cgroup_clear_mc();
5160 #else /* !CONFIG_MMU */
5161 static int mem_cgroup_can_attach(struct cgroup_taskset *tset)
5165 static void mem_cgroup_cancel_attach(struct cgroup_taskset *tset)
5168 static void mem_cgroup_move_task(void)
5174 * Cgroup retains root cgroups across [un]mount cycles making it necessary
5175 * to verify whether we're attached to the default hierarchy on each mount
5178 static void mem_cgroup_bind(struct cgroup_subsys_state *root_css)
5181 * use_hierarchy is forced on the default hierarchy. cgroup core
5182 * guarantees that @root doesn't have any children, so turning it
5183 * on for the root memcg is enough.
5185 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
5186 root_mem_cgroup->use_hierarchy = true;
5188 root_mem_cgroup->use_hierarchy = false;
5191 static u64 memory_current_read(struct cgroup_subsys_state *css,
5194 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5196 return (u64)page_counter_read(&memcg->memory) * PAGE_SIZE;
5199 static int memory_low_show(struct seq_file *m, void *v)
5201 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
5202 unsigned long low = READ_ONCE(memcg->low);
5204 if (low == PAGE_COUNTER_MAX)
5205 seq_puts(m, "max\n");
5207 seq_printf(m, "%llu\n", (u64)low * PAGE_SIZE);
5212 static ssize_t memory_low_write(struct kernfs_open_file *of,
5213 char *buf, size_t nbytes, loff_t off)
5215 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
5219 buf = strstrip(buf);
5220 err = page_counter_memparse(buf, "max", &low);
5229 static int memory_high_show(struct seq_file *m, void *v)
5231 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
5232 unsigned long high = READ_ONCE(memcg->high);
5234 if (high == PAGE_COUNTER_MAX)
5235 seq_puts(m, "max\n");
5237 seq_printf(m, "%llu\n", (u64)high * PAGE_SIZE);
5242 static ssize_t memory_high_write(struct kernfs_open_file *of,
5243 char *buf, size_t nbytes, loff_t off)
5245 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
5246 unsigned long nr_pages;
5250 buf = strstrip(buf);
5251 err = page_counter_memparse(buf, "max", &high);
5257 nr_pages = page_counter_read(&memcg->memory);
5258 if (nr_pages > high)
5259 try_to_free_mem_cgroup_pages(memcg, nr_pages - high,
5262 memcg_wb_domain_size_changed(memcg);
5266 static int memory_max_show(struct seq_file *m, void *v)
5268 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
5269 unsigned long max = READ_ONCE(memcg->memory.limit);
5271 if (max == PAGE_COUNTER_MAX)
5272 seq_puts(m, "max\n");
5274 seq_printf(m, "%llu\n", (u64)max * PAGE_SIZE);
5279 static ssize_t memory_max_write(struct kernfs_open_file *of,
5280 char *buf, size_t nbytes, loff_t off)
5282 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
5283 unsigned int nr_reclaims = MEM_CGROUP_RECLAIM_RETRIES;
5284 bool drained = false;
5288 buf = strstrip(buf);
5289 err = page_counter_memparse(buf, "max", &max);
5293 xchg(&memcg->memory.limit, max);
5296 unsigned long nr_pages = page_counter_read(&memcg->memory);
5298 if (nr_pages <= max)
5301 if (signal_pending(current)) {
5307 drain_all_stock(memcg);
5313 if (!try_to_free_mem_cgroup_pages(memcg, nr_pages - max,
5319 memcg_memory_event(memcg, MEMCG_OOM);
5320 if (!mem_cgroup_out_of_memory(memcg, GFP_KERNEL, 0))
5324 memcg_wb_domain_size_changed(memcg);
5328 static int memory_events_show(struct seq_file *m, void *v)
5330 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
5332 seq_printf(m, "low %lu\n",
5333 atomic_long_read(&memcg->memory_events[MEMCG_LOW]));
5334 seq_printf(m, "high %lu\n",
5335 atomic_long_read(&memcg->memory_events[MEMCG_HIGH]));
5336 seq_printf(m, "max %lu\n",
5337 atomic_long_read(&memcg->memory_events[MEMCG_MAX]));
5338 seq_printf(m, "oom %lu\n",
5339 atomic_long_read(&memcg->memory_events[MEMCG_OOM]));
5340 seq_printf(m, "oom_kill %lu\n",
5341 atomic_long_read(&memcg->memory_events[MEMCG_OOM_KILL]));
5346 static int memory_stat_show(struct seq_file *m, void *v)
5348 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
5349 unsigned long stat[MEMCG_NR_STAT];
5350 unsigned long events[NR_VM_EVENT_ITEMS];
5354 * Provide statistics on the state of the memory subsystem as
5355 * well as cumulative event counters that show past behavior.
5357 * This list is ordered following a combination of these gradients:
5358 * 1) generic big picture -> specifics and details
5359 * 2) reflecting userspace activity -> reflecting kernel heuristics
5361 * Current memory state:
5364 tree_stat(memcg, stat);
5365 tree_events(memcg, events);
5367 seq_printf(m, "anon %llu\n",
5368 (u64)stat[MEMCG_RSS] * PAGE_SIZE);
5369 seq_printf(m, "file %llu\n",
5370 (u64)stat[MEMCG_CACHE] * PAGE_SIZE);
5371 seq_printf(m, "kernel_stack %llu\n",
5372 (u64)stat[MEMCG_KERNEL_STACK_KB] * 1024);
5373 seq_printf(m, "slab %llu\n",
5374 (u64)(stat[NR_SLAB_RECLAIMABLE] +
5375 stat[NR_SLAB_UNRECLAIMABLE]) * PAGE_SIZE);
5376 seq_printf(m, "sock %llu\n",
5377 (u64)stat[MEMCG_SOCK] * PAGE_SIZE);
5379 seq_printf(m, "shmem %llu\n",
5380 (u64)stat[NR_SHMEM] * PAGE_SIZE);
5381 seq_printf(m, "file_mapped %llu\n",
5382 (u64)stat[NR_FILE_MAPPED] * PAGE_SIZE);
5383 seq_printf(m, "file_dirty %llu\n",
5384 (u64)stat[NR_FILE_DIRTY] * PAGE_SIZE);
5385 seq_printf(m, "file_writeback %llu\n",
5386 (u64)stat[NR_WRITEBACK] * PAGE_SIZE);
5388 for (i = 0; i < NR_LRU_LISTS; i++) {
5389 struct mem_cgroup *mi;
5390 unsigned long val = 0;
5392 for_each_mem_cgroup_tree(mi, memcg)
5393 val += mem_cgroup_nr_lru_pages(mi, BIT(i));
5394 seq_printf(m, "%s %llu\n",
5395 mem_cgroup_lru_names[i], (u64)val * PAGE_SIZE);
5398 seq_printf(m, "slab_reclaimable %llu\n",
5399 (u64)stat[NR_SLAB_RECLAIMABLE] * PAGE_SIZE);
5400 seq_printf(m, "slab_unreclaimable %llu\n",
5401 (u64)stat[NR_SLAB_UNRECLAIMABLE] * PAGE_SIZE);
5403 /* Accumulated memory events */
5405 seq_printf(m, "pgfault %lu\n", events[PGFAULT]);
5406 seq_printf(m, "pgmajfault %lu\n", events[PGMAJFAULT]);
5408 seq_printf(m, "pgrefill %lu\n", events[PGREFILL]);
5409 seq_printf(m, "pgscan %lu\n", events[PGSCAN_KSWAPD] +
5410 events[PGSCAN_DIRECT]);
5411 seq_printf(m, "pgsteal %lu\n", events[PGSTEAL_KSWAPD] +
5412 events[PGSTEAL_DIRECT]);
5413 seq_printf(m, "pgactivate %lu\n", events[PGACTIVATE]);
5414 seq_printf(m, "pgdeactivate %lu\n", events[PGDEACTIVATE]);
5415 seq_printf(m, "pglazyfree %lu\n", events[PGLAZYFREE]);
5416 seq_printf(m, "pglazyfreed %lu\n", events[PGLAZYFREED]);
5418 seq_printf(m, "workingset_refault %lu\n",
5419 stat[WORKINGSET_REFAULT]);
5420 seq_printf(m, "workingset_activate %lu\n",
5421 stat[WORKINGSET_ACTIVATE]);
5422 seq_printf(m, "workingset_nodereclaim %lu\n",
5423 stat[WORKINGSET_NODERECLAIM]);
5428 static struct cftype memory_files[] = {
5431 .flags = CFTYPE_NOT_ON_ROOT,
5432 .read_u64 = memory_current_read,
5436 .flags = CFTYPE_NOT_ON_ROOT,
5437 .seq_show = memory_low_show,
5438 .write = memory_low_write,
5442 .flags = CFTYPE_NOT_ON_ROOT,
5443 .seq_show = memory_high_show,
5444 .write = memory_high_write,
5448 .flags = CFTYPE_NOT_ON_ROOT,
5449 .seq_show = memory_max_show,
5450 .write = memory_max_write,
5454 .flags = CFTYPE_NOT_ON_ROOT,
5455 .file_offset = offsetof(struct mem_cgroup, events_file),
5456 .seq_show = memory_events_show,
5460 .flags = CFTYPE_NOT_ON_ROOT,
5461 .seq_show = memory_stat_show,
5466 struct cgroup_subsys memory_cgrp_subsys = {
5467 .css_alloc = mem_cgroup_css_alloc,
5468 .css_online = mem_cgroup_css_online,
5469 .css_offline = mem_cgroup_css_offline,
5470 .css_released = mem_cgroup_css_released,
5471 .css_free = mem_cgroup_css_free,
5472 .css_reset = mem_cgroup_css_reset,
5473 .can_attach = mem_cgroup_can_attach,
5474 .cancel_attach = mem_cgroup_cancel_attach,
5475 .post_attach = mem_cgroup_move_task,
5476 .bind = mem_cgroup_bind,
5477 .dfl_cftypes = memory_files,
5478 .legacy_cftypes = mem_cgroup_legacy_files,
5483 * mem_cgroup_low - check if memory consumption is below the normal range
5484 * @root: the top ancestor of the sub-tree being checked
5485 * @memcg: the memory cgroup to check
5487 * Returns %true if memory consumption of @memcg, and that of all
5488 * ancestors up to (but not including) @root, is below the normal range.
5490 * @root is exclusive; it is never low when looked at directly and isn't
5491 * checked when traversing the hierarchy.
5493 * Excluding @root enables using memory.low to prioritize memory usage
5494 * between cgroups within a subtree of the hierarchy that is limited by
5495 * memory.high or memory.max.
5497 * For example, given cgroup A with children B and C:
5505 * 1. A/memory.current > A/memory.high
5506 * 2. A/B/memory.current < A/B/memory.low
5507 * 3. A/C/memory.current >= A/C/memory.low
5509 * As 'A' is high, i.e. triggers reclaim from 'A', and 'B' is low, we
5510 * should reclaim from 'C' until 'A' is no longer high or until we can
5511 * no longer reclaim from 'C'. If 'A', i.e. @root, isn't excluded by
5512 * mem_cgroup_low when reclaming from 'A', then 'B' won't be considered
5513 * low and we will reclaim indiscriminately from both 'B' and 'C'.
5515 bool mem_cgroup_low(struct mem_cgroup *root, struct mem_cgroup *memcg)
5517 if (mem_cgroup_disabled())
5521 root = root_mem_cgroup;
5525 for (; memcg != root; memcg = parent_mem_cgroup(memcg)) {
5526 if (page_counter_read(&memcg->memory) >= memcg->low)
5534 * mem_cgroup_try_charge - try charging a page
5535 * @page: page to charge
5536 * @mm: mm context of the victim
5537 * @gfp_mask: reclaim mode
5538 * @memcgp: charged memcg return
5539 * @compound: charge the page as compound or small page
5541 * Try to charge @page to the memcg that @mm belongs to, reclaiming
5542 * pages according to @gfp_mask if necessary.
5544 * Returns 0 on success, with *@memcgp pointing to the charged memcg.
5545 * Otherwise, an error code is returned.
5547 * After page->mapping has been set up, the caller must finalize the
5548 * charge with mem_cgroup_commit_charge(). Or abort the transaction
5549 * with mem_cgroup_cancel_charge() in case page instantiation fails.
5551 int mem_cgroup_try_charge(struct page *page, struct mm_struct *mm,
5552 gfp_t gfp_mask, struct mem_cgroup **memcgp,
5555 struct mem_cgroup *memcg = NULL;
5556 unsigned int nr_pages = compound ? hpage_nr_pages(page) : 1;
5559 if (mem_cgroup_disabled())
5562 if (PageSwapCache(page)) {
5564 * Every swap fault against a single page tries to charge the
5565 * page, bail as early as possible. shmem_unuse() encounters
5566 * already charged pages, too. The USED bit is protected by
5567 * the page lock, which serializes swap cache removal, which
5568 * in turn serializes uncharging.
5570 VM_BUG_ON_PAGE(!PageLocked(page), page);
5571 if (compound_head(page)->mem_cgroup)
5574 if (do_swap_account) {
5575 swp_entry_t ent = { .val = page_private(page), };
5576 unsigned short id = lookup_swap_cgroup_id(ent);
5579 memcg = mem_cgroup_from_id(id);
5580 if (memcg && !css_tryget_online(&memcg->css))
5587 memcg = get_mem_cgroup_from_mm(mm);
5589 ret = try_charge(memcg, gfp_mask, nr_pages);
5591 css_put(&memcg->css);
5598 * mem_cgroup_commit_charge - commit a page charge
5599 * @page: page to charge
5600 * @memcg: memcg to charge the page to
5601 * @lrucare: page might be on LRU already
5602 * @compound: charge the page as compound or small page
5604 * Finalize a charge transaction started by mem_cgroup_try_charge(),
5605 * after page->mapping has been set up. This must happen atomically
5606 * as part of the page instantiation, i.e. under the page table lock
5607 * for anonymous pages, under the page lock for page and swap cache.
5609 * In addition, the page must not be on the LRU during the commit, to
5610 * prevent racing with task migration. If it might be, use @lrucare.
5612 * Use mem_cgroup_cancel_charge() to cancel the transaction instead.
5614 void mem_cgroup_commit_charge(struct page *page, struct mem_cgroup *memcg,
5615 bool lrucare, bool compound)
5617 unsigned int nr_pages = compound ? hpage_nr_pages(page) : 1;
5619 VM_BUG_ON_PAGE(!page->mapping, page);
5620 VM_BUG_ON_PAGE(PageLRU(page) && !lrucare, page);
5622 if (mem_cgroup_disabled())
5625 * Swap faults will attempt to charge the same page multiple
5626 * times. But reuse_swap_page() might have removed the page
5627 * from swapcache already, so we can't check PageSwapCache().
5632 commit_charge(page, memcg, lrucare);
5634 local_irq_disable();
5635 mem_cgroup_charge_statistics(memcg, page, compound, nr_pages);
5636 memcg_check_events(memcg, page);
5639 if (do_memsw_account() && PageSwapCache(page)) {
5640 swp_entry_t entry = { .val = page_private(page) };
5642 * The swap entry might not get freed for a long time,
5643 * let's not wait for it. The page already received a
5644 * memory+swap charge, drop the swap entry duplicate.
5646 mem_cgroup_uncharge_swap(entry, nr_pages);
5651 * mem_cgroup_cancel_charge - cancel a page charge
5652 * @page: page to charge
5653 * @memcg: memcg to charge the page to
5654 * @compound: charge the page as compound or small page
5656 * Cancel a charge transaction started by mem_cgroup_try_charge().
5658 void mem_cgroup_cancel_charge(struct page *page, struct mem_cgroup *memcg,
5661 unsigned int nr_pages = compound ? hpage_nr_pages(page) : 1;
5663 if (mem_cgroup_disabled())
5666 * Swap faults will attempt to charge the same page multiple
5667 * times. But reuse_swap_page() might have removed the page
5668 * from swapcache already, so we can't check PageSwapCache().
5673 cancel_charge(memcg, nr_pages);
5676 struct uncharge_gather {
5677 struct mem_cgroup *memcg;
5678 unsigned long pgpgout;
5679 unsigned long nr_anon;
5680 unsigned long nr_file;
5681 unsigned long nr_kmem;
5682 unsigned long nr_huge;
5683 unsigned long nr_shmem;
5684 struct page *dummy_page;
5687 static inline void uncharge_gather_clear(struct uncharge_gather *ug)
5689 memset(ug, 0, sizeof(*ug));
5692 static void uncharge_batch(const struct uncharge_gather *ug)
5694 unsigned long nr_pages = ug->nr_anon + ug->nr_file + ug->nr_kmem;
5695 unsigned long flags;
5697 if (!mem_cgroup_is_root(ug->memcg)) {
5698 page_counter_uncharge(&ug->memcg->memory, nr_pages);
5699 if (do_memsw_account())
5700 page_counter_uncharge(&ug->memcg->memsw, nr_pages);
5701 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && ug->nr_kmem)
5702 page_counter_uncharge(&ug->memcg->kmem, ug->nr_kmem);
5703 memcg_oom_recover(ug->memcg);
5706 local_irq_save(flags);
5707 __mod_memcg_state(ug->memcg, MEMCG_RSS, -ug->nr_anon);
5708 __mod_memcg_state(ug->memcg, MEMCG_CACHE, -ug->nr_file);
5709 __mod_memcg_state(ug->memcg, MEMCG_RSS_HUGE, -ug->nr_huge);
5710 __mod_memcg_state(ug->memcg, NR_SHMEM, -ug->nr_shmem);
5711 __count_memcg_events(ug->memcg, PGPGOUT, ug->pgpgout);
5712 __this_cpu_add(ug->memcg->stat_cpu->nr_page_events, nr_pages);
5713 memcg_check_events(ug->memcg, ug->dummy_page);
5714 local_irq_restore(flags);
5716 if (!mem_cgroup_is_root(ug->memcg))
5717 css_put_many(&ug->memcg->css, nr_pages);
5720 static void uncharge_page(struct page *page, struct uncharge_gather *ug)
5722 VM_BUG_ON_PAGE(PageLRU(page), page);
5723 VM_BUG_ON_PAGE(page_count(page) && !is_zone_device_page(page) &&
5724 !PageHWPoison(page) , page);
5726 if (!page->mem_cgroup)
5730 * Nobody should be changing or seriously looking at
5731 * page->mem_cgroup at this point, we have fully
5732 * exclusive access to the page.
5735 if (ug->memcg != page->mem_cgroup) {
5738 uncharge_gather_clear(ug);
5740 ug->memcg = page->mem_cgroup;
5743 if (!PageKmemcg(page)) {
5744 unsigned int nr_pages = 1;
5746 if (PageTransHuge(page)) {
5747 nr_pages <<= compound_order(page);
5748 ug->nr_huge += nr_pages;
5751 ug->nr_anon += nr_pages;
5753 ug->nr_file += nr_pages;
5754 if (PageSwapBacked(page))
5755 ug->nr_shmem += nr_pages;
5759 ug->nr_kmem += 1 << compound_order(page);
5760 __ClearPageKmemcg(page);
5763 ug->dummy_page = page;
5764 page->mem_cgroup = NULL;
5767 static void uncharge_list(struct list_head *page_list)
5769 struct uncharge_gather ug;
5770 struct list_head *next;
5772 uncharge_gather_clear(&ug);
5775 * Note that the list can be a single page->lru; hence the
5776 * do-while loop instead of a simple list_for_each_entry().
5778 next = page_list->next;
5782 page = list_entry(next, struct page, lru);
5783 next = page->lru.next;
5785 uncharge_page(page, &ug);
5786 } while (next != page_list);
5789 uncharge_batch(&ug);
5793 * mem_cgroup_uncharge - uncharge a page
5794 * @page: page to uncharge
5796 * Uncharge a page previously charged with mem_cgroup_try_charge() and
5797 * mem_cgroup_commit_charge().
5799 void mem_cgroup_uncharge(struct page *page)
5801 struct uncharge_gather ug;
5803 if (mem_cgroup_disabled())
5806 /* Don't touch page->lru of any random page, pre-check: */
5807 if (!page->mem_cgroup)
5810 uncharge_gather_clear(&ug);
5811 uncharge_page(page, &ug);
5812 uncharge_batch(&ug);
5816 * mem_cgroup_uncharge_list - uncharge a list of page
5817 * @page_list: list of pages to uncharge
5819 * Uncharge a list of pages previously charged with
5820 * mem_cgroup_try_charge() and mem_cgroup_commit_charge().
5822 void mem_cgroup_uncharge_list(struct list_head *page_list)
5824 if (mem_cgroup_disabled())
5827 if (!list_empty(page_list))
5828 uncharge_list(page_list);
5832 * mem_cgroup_migrate - charge a page's replacement
5833 * @oldpage: currently circulating page
5834 * @newpage: replacement page
5836 * Charge @newpage as a replacement page for @oldpage. @oldpage will
5837 * be uncharged upon free.
5839 * Both pages must be locked, @newpage->mapping must be set up.
5841 void mem_cgroup_migrate(struct page *oldpage, struct page *newpage)
5843 struct mem_cgroup *memcg;
5844 unsigned int nr_pages;
5846 unsigned long flags;
5848 VM_BUG_ON_PAGE(!PageLocked(oldpage), oldpage);
5849 VM_BUG_ON_PAGE(!PageLocked(newpage), newpage);
5850 VM_BUG_ON_PAGE(PageAnon(oldpage) != PageAnon(newpage), newpage);
5851 VM_BUG_ON_PAGE(PageTransHuge(oldpage) != PageTransHuge(newpage),
5854 if (mem_cgroup_disabled())
5857 /* Page cache replacement: new page already charged? */
5858 if (newpage->mem_cgroup)
5861 /* Swapcache readahead pages can get replaced before being charged */
5862 memcg = oldpage->mem_cgroup;
5866 /* Force-charge the new page. The old one will be freed soon */
5867 compound = PageTransHuge(newpage);
5868 nr_pages = compound ? hpage_nr_pages(newpage) : 1;
5870 page_counter_charge(&memcg->memory, nr_pages);
5871 if (do_memsw_account())
5872 page_counter_charge(&memcg->memsw, nr_pages);
5873 css_get_many(&memcg->css, nr_pages);
5875 commit_charge(newpage, memcg, false);
5877 local_irq_save(flags);
5878 mem_cgroup_charge_statistics(memcg, newpage, compound, nr_pages);
5879 memcg_check_events(memcg, newpage);
5880 local_irq_restore(flags);
5883 DEFINE_STATIC_KEY_FALSE(memcg_sockets_enabled_key);
5884 EXPORT_SYMBOL(memcg_sockets_enabled_key);
5886 void mem_cgroup_sk_alloc(struct sock *sk)
5888 struct mem_cgroup *memcg;
5890 if (!mem_cgroup_sockets_enabled)
5893 /* Do not associate the sock with unrelated interrupted task's memcg. */
5898 memcg = mem_cgroup_from_task(current);
5899 if (memcg == root_mem_cgroup)
5901 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) && !memcg->tcpmem_active)
5903 if (css_tryget_online(&memcg->css))
5904 sk->sk_memcg = memcg;
5909 void mem_cgroup_sk_free(struct sock *sk)
5912 css_put(&sk->sk_memcg->css);
5916 * mem_cgroup_charge_skmem - charge socket memory
5917 * @memcg: memcg to charge
5918 * @nr_pages: number of pages to charge
5920 * Charges @nr_pages to @memcg. Returns %true if the charge fit within
5921 * @memcg's configured limit, %false if the charge had to be forced.
5923 bool mem_cgroup_charge_skmem(struct mem_cgroup *memcg, unsigned int nr_pages)
5925 gfp_t gfp_mask = GFP_KERNEL;
5927 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) {
5928 struct page_counter *fail;
5930 if (page_counter_try_charge(&memcg->tcpmem, nr_pages, &fail)) {
5931 memcg->tcpmem_pressure = 0;
5934 page_counter_charge(&memcg->tcpmem, nr_pages);
5935 memcg->tcpmem_pressure = 1;
5939 /* Don't block in the packet receive path */
5941 gfp_mask = GFP_NOWAIT;
5943 mod_memcg_state(memcg, MEMCG_SOCK, nr_pages);
5945 if (try_charge(memcg, gfp_mask, nr_pages) == 0)
5948 try_charge(memcg, gfp_mask|__GFP_NOFAIL, nr_pages);
5953 * mem_cgroup_uncharge_skmem - uncharge socket memory
5954 * @memcg - memcg to uncharge
5955 * @nr_pages - number of pages to uncharge
5957 void mem_cgroup_uncharge_skmem(struct mem_cgroup *memcg, unsigned int nr_pages)
5959 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys)) {
5960 page_counter_uncharge(&memcg->tcpmem, nr_pages);
5964 mod_memcg_state(memcg, MEMCG_SOCK, -nr_pages);
5966 refill_stock(memcg, nr_pages);
5969 static int __init cgroup_memory(char *s)
5973 while ((token = strsep(&s, ",")) != NULL) {
5976 if (!strcmp(token, "nosocket"))
5977 cgroup_memory_nosocket = true;
5978 if (!strcmp(token, "nokmem"))
5979 cgroup_memory_nokmem = true;
5983 __setup("cgroup.memory=", cgroup_memory);
5986 * subsys_initcall() for memory controller.
5988 * Some parts like memcg_hotplug_cpu_dead() have to be initialized from this
5989 * context because of lock dependencies (cgroup_lock -> cpu hotplug) but
5990 * basically everything that doesn't depend on a specific mem_cgroup structure
5991 * should be initialized from here.
5993 static int __init mem_cgroup_init(void)
5999 * Kmem cache creation is mostly done with the slab_mutex held,
6000 * so use a workqueue with limited concurrency to avoid stalling
6001 * all worker threads in case lots of cgroups are created and
6002 * destroyed simultaneously.
6004 memcg_kmem_cache_wq = alloc_workqueue("memcg_kmem_cache", 0, 1);
6005 BUG_ON(!memcg_kmem_cache_wq);
6008 cpuhp_setup_state_nocalls(CPUHP_MM_MEMCQ_DEAD, "mm/memctrl:dead", NULL,
6009 memcg_hotplug_cpu_dead);
6011 for_each_possible_cpu(cpu)
6012 INIT_WORK(&per_cpu_ptr(&memcg_stock, cpu)->work,
6015 for_each_node(node) {
6016 struct mem_cgroup_tree_per_node *rtpn;
6018 rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL,
6019 node_online(node) ? node : NUMA_NO_NODE);
6021 rtpn->rb_root = RB_ROOT;
6022 rtpn->rb_rightmost = NULL;
6023 spin_lock_init(&rtpn->lock);
6024 soft_limit_tree.rb_tree_per_node[node] = rtpn;
6029 subsys_initcall(mem_cgroup_init);
6031 #ifdef CONFIG_MEMCG_SWAP
6032 static struct mem_cgroup *mem_cgroup_id_get_online(struct mem_cgroup *memcg)
6034 while (!atomic_inc_not_zero(&memcg->id.ref)) {
6036 * The root cgroup cannot be destroyed, so it's refcount must
6039 if (WARN_ON_ONCE(memcg == root_mem_cgroup)) {
6043 memcg = parent_mem_cgroup(memcg);
6045 memcg = root_mem_cgroup;
6051 * mem_cgroup_swapout - transfer a memsw charge to swap
6052 * @page: page whose memsw charge to transfer
6053 * @entry: swap entry to move the charge to
6055 * Transfer the memsw charge of @page to @entry.
6057 void mem_cgroup_swapout(struct page *page, swp_entry_t entry)
6059 struct mem_cgroup *memcg, *swap_memcg;
6060 unsigned int nr_entries;
6061 unsigned short oldid;
6063 VM_BUG_ON_PAGE(PageLRU(page), page);
6064 VM_BUG_ON_PAGE(page_count(page), page);
6066 if (!do_memsw_account())
6069 memcg = page->mem_cgroup;
6071 /* Readahead page, never charged */
6076 * In case the memcg owning these pages has been offlined and doesn't
6077 * have an ID allocated to it anymore, charge the closest online
6078 * ancestor for the swap instead and transfer the memory+swap charge.
6080 swap_memcg = mem_cgroup_id_get_online(memcg);
6081 nr_entries = hpage_nr_pages(page);
6082 /* Get references for the tail pages, too */
6084 mem_cgroup_id_get_many(swap_memcg, nr_entries - 1);
6085 oldid = swap_cgroup_record(entry, mem_cgroup_id(swap_memcg),
6087 VM_BUG_ON_PAGE(oldid, page);
6088 mod_memcg_state(swap_memcg, MEMCG_SWAP, nr_entries);
6090 page->mem_cgroup = NULL;
6092 if (!mem_cgroup_is_root(memcg))
6093 page_counter_uncharge(&memcg->memory, nr_entries);
6095 if (memcg != swap_memcg) {
6096 if (!mem_cgroup_is_root(swap_memcg))
6097 page_counter_charge(&swap_memcg->memsw, nr_entries);
6098 page_counter_uncharge(&memcg->memsw, nr_entries);
6102 * Interrupts should be disabled here because the caller holds the
6103 * mapping->tree_lock lock which is taken with interrupts-off. It is
6104 * important here to have the interrupts disabled because it is the
6105 * only synchronisation we have for udpating the per-CPU variables.
6107 VM_BUG_ON(!irqs_disabled());
6108 mem_cgroup_charge_statistics(memcg, page, PageTransHuge(page),
6110 memcg_check_events(memcg, page);
6112 if (!mem_cgroup_is_root(memcg))
6113 css_put_many(&memcg->css, nr_entries);
6117 * mem_cgroup_try_charge_swap - try charging swap space for a page
6118 * @page: page being added to swap
6119 * @entry: swap entry to charge
6121 * Try to charge @page's memcg for the swap space at @entry.
6123 * Returns 0 on success, -ENOMEM on failure.
6125 int mem_cgroup_try_charge_swap(struct page *page, swp_entry_t entry)
6127 unsigned int nr_pages = hpage_nr_pages(page);
6128 struct page_counter *counter;
6129 struct mem_cgroup *memcg;
6130 unsigned short oldid;
6132 if (!cgroup_subsys_on_dfl(memory_cgrp_subsys) || !do_swap_account)
6135 memcg = page->mem_cgroup;
6137 /* Readahead page, never charged */
6141 memcg = mem_cgroup_id_get_online(memcg);
6143 if (!mem_cgroup_is_root(memcg) &&
6144 !page_counter_try_charge(&memcg->swap, nr_pages, &counter)) {
6145 mem_cgroup_id_put(memcg);
6149 /* Get references for the tail pages, too */
6151 mem_cgroup_id_get_many(memcg, nr_pages - 1);
6152 oldid = swap_cgroup_record(entry, mem_cgroup_id(memcg), nr_pages);
6153 VM_BUG_ON_PAGE(oldid, page);
6154 mod_memcg_state(memcg, MEMCG_SWAP, nr_pages);
6160 * mem_cgroup_uncharge_swap - uncharge swap space
6161 * @entry: swap entry to uncharge
6162 * @nr_pages: the amount of swap space to uncharge
6164 void mem_cgroup_uncharge_swap(swp_entry_t entry, unsigned int nr_pages)
6166 struct mem_cgroup *memcg;
6169 if (!do_swap_account)
6172 id = swap_cgroup_record(entry, 0, nr_pages);
6174 memcg = mem_cgroup_from_id(id);
6176 if (!mem_cgroup_is_root(memcg)) {
6177 if (cgroup_subsys_on_dfl(memory_cgrp_subsys))
6178 page_counter_uncharge(&memcg->swap, nr_pages);
6180 page_counter_uncharge(&memcg->memsw, nr_pages);
6182 mod_memcg_state(memcg, MEMCG_SWAP, -nr_pages);
6183 mem_cgroup_id_put_many(memcg, nr_pages);
6188 long mem_cgroup_get_nr_swap_pages(struct mem_cgroup *memcg)
6190 long nr_swap_pages = get_nr_swap_pages();
6192 if (!do_swap_account || !cgroup_subsys_on_dfl(memory_cgrp_subsys))
6193 return nr_swap_pages;
6194 for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg))
6195 nr_swap_pages = min_t(long, nr_swap_pages,
6196 READ_ONCE(memcg->swap.limit) -
6197 page_counter_read(&memcg->swap));
6198 return nr_swap_pages;
6201 bool mem_cgroup_swap_full(struct page *page)
6203 struct mem_cgroup *memcg;
6205 VM_BUG_ON_PAGE(!PageLocked(page), page);
6209 if (!do_swap_account || !cgroup_subsys_on_dfl(memory_cgrp_subsys))
6212 memcg = page->mem_cgroup;
6216 for (; memcg != root_mem_cgroup; memcg = parent_mem_cgroup(memcg))
6217 if (page_counter_read(&memcg->swap) * 2 >= memcg->swap.limit)
6223 /* for remember boot option*/
6224 #ifdef CONFIG_MEMCG_SWAP_ENABLED
6225 static int really_do_swap_account __initdata = 1;
6227 static int really_do_swap_account __initdata;
6230 static int __init enable_swap_account(char *s)
6232 if (!strcmp(s, "1"))
6233 really_do_swap_account = 1;
6234 else if (!strcmp(s, "0"))
6235 really_do_swap_account = 0;
6238 __setup("swapaccount=", enable_swap_account);
6240 static u64 swap_current_read(struct cgroup_subsys_state *css,
6243 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
6245 return (u64)page_counter_read(&memcg->swap) * PAGE_SIZE;
6248 static int swap_max_show(struct seq_file *m, void *v)
6250 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
6251 unsigned long max = READ_ONCE(memcg->swap.limit);
6253 if (max == PAGE_COUNTER_MAX)
6254 seq_puts(m, "max\n");
6256 seq_printf(m, "%llu\n", (u64)max * PAGE_SIZE);
6261 static ssize_t swap_max_write(struct kernfs_open_file *of,
6262 char *buf, size_t nbytes, loff_t off)
6264 struct mem_cgroup *memcg = mem_cgroup_from_css(of_css(of));
6268 buf = strstrip(buf);
6269 err = page_counter_memparse(buf, "max", &max);
6273 mutex_lock(&memcg_limit_mutex);
6274 err = page_counter_limit(&memcg->swap, max);
6275 mutex_unlock(&memcg_limit_mutex);
6282 static struct cftype swap_files[] = {
6284 .name = "swap.current",
6285 .flags = CFTYPE_NOT_ON_ROOT,
6286 .read_u64 = swap_current_read,
6290 .flags = CFTYPE_NOT_ON_ROOT,
6291 .seq_show = swap_max_show,
6292 .write = swap_max_write,
6297 static struct cftype memsw_cgroup_files[] = {
6299 .name = "memsw.usage_in_bytes",
6300 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE),
6301 .read_u64 = mem_cgroup_read_u64,
6304 .name = "memsw.max_usage_in_bytes",
6305 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE),
6306 .write = mem_cgroup_reset,
6307 .read_u64 = mem_cgroup_read_u64,
6310 .name = "memsw.limit_in_bytes",
6311 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT),
6312 .write = mem_cgroup_write,
6313 .read_u64 = mem_cgroup_read_u64,
6316 .name = "memsw.failcnt",
6317 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT),
6318 .write = mem_cgroup_reset,
6319 .read_u64 = mem_cgroup_read_u64,
6321 { }, /* terminate */
6324 static int __init mem_cgroup_swap_init(void)
6326 if (!mem_cgroup_disabled() && really_do_swap_account) {
6327 do_swap_account = 1;
6328 WARN_ON(cgroup_add_dfl_cftypes(&memory_cgrp_subsys,
6330 WARN_ON(cgroup_add_legacy_cftypes(&memory_cgrp_subsys,
6331 memsw_cgroup_files));
6335 subsys_initcall(mem_cgroup_swap_init);
6337 #endif /* CONFIG_MEMCG_SWAP */