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
17 * This program is free software; you can redistribute it and/or modify
18 * it under the terms of the GNU General Public License as published by
19 * the Free Software Foundation; either version 2 of the License, or
20 * (at your option) any later version.
22 * This program is distributed in the hope that it will be useful,
23 * but WITHOUT ANY WARRANTY; without even the implied warranty of
24 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
25 * GNU General Public License for more details.
28 #include <linux/res_counter.h>
29 #include <linux/memcontrol.h>
30 #include <linux/cgroup.h>
32 #include <linux/hugetlb.h>
33 #include <linux/pagemap.h>
34 #include <linux/smp.h>
35 #include <linux/page-flags.h>
36 #include <linux/backing-dev.h>
37 #include <linux/bit_spinlock.h>
38 #include <linux/rcupdate.h>
39 #include <linux/limits.h>
40 #include <linux/export.h>
41 #include <linux/mutex.h>
42 #include <linux/rbtree.h>
43 #include <linux/slab.h>
44 #include <linux/swap.h>
45 #include <linux/swapops.h>
46 #include <linux/spinlock.h>
47 #include <linux/eventfd.h>
48 #include <linux/poll.h>
49 #include <linux/sort.h>
51 #include <linux/seq_file.h>
52 #include <linux/vmpressure.h>
53 #include <linux/mm_inline.h>
54 #include <linux/page_cgroup.h>
55 #include <linux/cpu.h>
56 #include <linux/oom.h>
57 #include <linux/lockdep.h>
58 #include <linux/file.h>
62 #include <net/tcp_memcontrol.h>
65 #include <asm/uaccess.h>
67 #include <trace/events/vmscan.h>
69 struct cgroup_subsys mem_cgroup_subsys __read_mostly;
70 EXPORT_SYMBOL(mem_cgroup_subsys);
72 #define MEM_CGROUP_RECLAIM_RETRIES 5
73 static struct mem_cgroup *root_mem_cgroup __read_mostly;
75 #ifdef CONFIG_MEMCG_SWAP
76 /* Turned on only when memory cgroup is enabled && really_do_swap_account = 1 */
77 int do_swap_account __read_mostly;
79 /* for remember boot option*/
80 #ifdef CONFIG_MEMCG_SWAP_ENABLED
81 static int really_do_swap_account __initdata = 1;
83 static int really_do_swap_account __initdata = 0;
87 #define do_swap_account 0
91 static const char * const mem_cgroup_stat_names[] = {
100 enum mem_cgroup_events_index {
101 MEM_CGROUP_EVENTS_PGPGIN, /* # of pages paged in */
102 MEM_CGROUP_EVENTS_PGPGOUT, /* # of pages paged out */
103 MEM_CGROUP_EVENTS_PGFAULT, /* # of page-faults */
104 MEM_CGROUP_EVENTS_PGMAJFAULT, /* # of major page-faults */
105 MEM_CGROUP_EVENTS_NSTATS,
108 static const char * const mem_cgroup_events_names[] = {
115 static const char * const mem_cgroup_lru_names[] = {
124 * Per memcg event counter is incremented at every pagein/pageout. With THP,
125 * it will be incremated by the number of pages. This counter is used for
126 * for trigger some periodic events. This is straightforward and better
127 * than using jiffies etc. to handle periodic memcg event.
129 enum mem_cgroup_events_target {
130 MEM_CGROUP_TARGET_THRESH,
131 MEM_CGROUP_TARGET_SOFTLIMIT,
132 MEM_CGROUP_TARGET_NUMAINFO,
135 #define THRESHOLDS_EVENTS_TARGET 128
136 #define SOFTLIMIT_EVENTS_TARGET 1024
137 #define NUMAINFO_EVENTS_TARGET 1024
139 struct mem_cgroup_stat_cpu {
140 long count[MEM_CGROUP_STAT_NSTATS];
141 unsigned long events[MEM_CGROUP_EVENTS_NSTATS];
142 unsigned long nr_page_events;
143 unsigned long targets[MEM_CGROUP_NTARGETS];
146 struct mem_cgroup_reclaim_iter {
148 * last scanned hierarchy member. Valid only if last_dead_count
149 * matches memcg->dead_count of the hierarchy root group.
151 struct mem_cgroup *last_visited;
152 unsigned long last_dead_count;
154 /* scan generation, increased every round-trip */
155 unsigned int generation;
159 * per-zone information in memory controller.
161 struct mem_cgroup_per_zone {
162 struct lruvec lruvec;
163 unsigned long lru_size[NR_LRU_LISTS];
165 struct mem_cgroup_reclaim_iter reclaim_iter[DEF_PRIORITY + 1];
167 struct rb_node tree_node; /* RB tree node */
168 unsigned long long usage_in_excess;/* Set to the value by which */
169 /* the soft limit is exceeded*/
171 struct mem_cgroup *memcg; /* Back pointer, we cannot */
172 /* use container_of */
175 struct mem_cgroup_per_node {
176 struct mem_cgroup_per_zone zoneinfo[MAX_NR_ZONES];
180 * Cgroups above their limits are maintained in a RB-Tree, independent of
181 * their hierarchy representation
184 struct mem_cgroup_tree_per_zone {
185 struct rb_root rb_root;
189 struct mem_cgroup_tree_per_node {
190 struct mem_cgroup_tree_per_zone rb_tree_per_zone[MAX_NR_ZONES];
193 struct mem_cgroup_tree {
194 struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES];
197 static struct mem_cgroup_tree soft_limit_tree __read_mostly;
199 struct mem_cgroup_threshold {
200 struct eventfd_ctx *eventfd;
205 struct mem_cgroup_threshold_ary {
206 /* An array index points to threshold just below or equal to usage. */
207 int current_threshold;
208 /* Size of entries[] */
210 /* Array of thresholds */
211 struct mem_cgroup_threshold entries[0];
214 struct mem_cgroup_thresholds {
215 /* Primary thresholds array */
216 struct mem_cgroup_threshold_ary *primary;
218 * Spare threshold array.
219 * This is needed to make mem_cgroup_unregister_event() "never fail".
220 * It must be able to store at least primary->size - 1 entries.
222 struct mem_cgroup_threshold_ary *spare;
226 struct mem_cgroup_eventfd_list {
227 struct list_head list;
228 struct eventfd_ctx *eventfd;
232 * cgroup_event represents events which userspace want to receive.
234 struct mem_cgroup_event {
236 * memcg which the event belongs to.
238 struct mem_cgroup *memcg;
240 * eventfd to signal userspace about the event.
242 struct eventfd_ctx *eventfd;
244 * Each of these stored in a list by the cgroup.
246 struct list_head list;
248 * register_event() callback will be used to add new userspace
249 * waiter for changes related to this event. Use eventfd_signal()
250 * on eventfd to send notification to userspace.
252 int (*register_event)(struct mem_cgroup *memcg,
253 struct eventfd_ctx *eventfd, const char *args);
255 * unregister_event() callback will be called when userspace closes
256 * the eventfd or on cgroup removing. This callback must be set,
257 * if you want provide notification functionality.
259 void (*unregister_event)(struct mem_cgroup *memcg,
260 struct eventfd_ctx *eventfd);
262 * All fields below needed to unregister event when
263 * userspace closes eventfd.
266 wait_queue_head_t *wqh;
268 struct work_struct remove;
271 static void mem_cgroup_threshold(struct mem_cgroup *memcg);
272 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg);
275 * The memory controller data structure. The memory controller controls both
276 * page cache and RSS per cgroup. We would eventually like to provide
277 * statistics based on the statistics developed by Rik Van Riel for clock-pro,
278 * to help the administrator determine what knobs to tune.
280 * TODO: Add a water mark for the memory controller. Reclaim will begin when
281 * we hit the water mark. May be even add a low water mark, such that
282 * no reclaim occurs from a cgroup at it's low water mark, this is
283 * a feature that will be implemented much later in the future.
286 struct cgroup_subsys_state css;
288 * the counter to account for memory usage
290 struct res_counter res;
292 /* vmpressure notifications */
293 struct vmpressure vmpressure;
296 * the counter to account for mem+swap usage.
298 struct res_counter memsw;
301 * the counter to account for kernel memory usage.
303 struct res_counter kmem;
305 * Should the accounting and control be hierarchical, per subtree?
308 unsigned long kmem_account_flags; /* See KMEM_ACCOUNTED_*, below */
312 atomic_t oom_wakeups;
315 /* OOM-Killer disable */
316 int oom_kill_disable;
318 /* set when res.limit == memsw.limit */
319 bool memsw_is_minimum;
321 /* protect arrays of thresholds */
322 struct mutex thresholds_lock;
324 /* thresholds for memory usage. RCU-protected */
325 struct mem_cgroup_thresholds thresholds;
327 /* thresholds for mem+swap usage. RCU-protected */
328 struct mem_cgroup_thresholds memsw_thresholds;
330 /* For oom notifier event fd */
331 struct list_head oom_notify;
334 * Should we move charges of a task when a task is moved into this
335 * mem_cgroup ? And what type of charges should we move ?
337 unsigned long move_charge_at_immigrate;
339 * set > 0 if pages under this cgroup are moving to other cgroup.
341 atomic_t moving_account;
342 /* taken only while moving_account > 0 */
343 spinlock_t move_lock;
347 struct mem_cgroup_stat_cpu __percpu *stat;
349 * used when a cpu is offlined or other synchronizations
350 * See mem_cgroup_read_stat().
352 struct mem_cgroup_stat_cpu nocpu_base;
353 spinlock_t pcp_counter_lock;
356 #if defined(CONFIG_MEMCG_KMEM) && defined(CONFIG_INET)
357 struct cg_proto tcp_mem;
359 #if defined(CONFIG_MEMCG_KMEM)
360 /* analogous to slab_common's slab_caches list. per-memcg */
361 struct list_head memcg_slab_caches;
362 /* Not a spinlock, we can take a lot of time walking the list */
363 struct mutex slab_caches_mutex;
364 /* Index in the kmem_cache->memcg_params->memcg_caches array */
368 int last_scanned_node;
370 nodemask_t scan_nodes;
371 atomic_t numainfo_events;
372 atomic_t numainfo_updating;
375 /* List of events which userspace want to receive */
376 struct list_head event_list;
377 spinlock_t event_list_lock;
379 struct mem_cgroup_per_node *nodeinfo[0];
380 /* WARNING: nodeinfo must be the last member here */
383 /* internal only representation about the status of kmem accounting. */
385 KMEM_ACCOUNTED_ACTIVE, /* accounted by this cgroup itself */
386 KMEM_ACCOUNTED_DEAD, /* dead memcg with pending kmem charges */
389 #ifdef CONFIG_MEMCG_KMEM
390 static inline void memcg_kmem_set_active(struct mem_cgroup *memcg)
392 set_bit(KMEM_ACCOUNTED_ACTIVE, &memcg->kmem_account_flags);
395 static bool memcg_kmem_is_active(struct mem_cgroup *memcg)
397 return test_bit(KMEM_ACCOUNTED_ACTIVE, &memcg->kmem_account_flags);
400 static void memcg_kmem_mark_dead(struct mem_cgroup *memcg)
403 * Our caller must use css_get() first, because memcg_uncharge_kmem()
404 * will call css_put() if it sees the memcg is dead.
407 if (test_bit(KMEM_ACCOUNTED_ACTIVE, &memcg->kmem_account_flags))
408 set_bit(KMEM_ACCOUNTED_DEAD, &memcg->kmem_account_flags);
411 static bool memcg_kmem_test_and_clear_dead(struct mem_cgroup *memcg)
413 return test_and_clear_bit(KMEM_ACCOUNTED_DEAD,
414 &memcg->kmem_account_flags);
418 /* Stuffs for move charges at task migration. */
420 * Types of charges to be moved. "move_charge_at_immitgrate" and
421 * "immigrate_flags" are treated as a left-shifted bitmap of these types.
424 MOVE_CHARGE_TYPE_ANON, /* private anonymous page and swap of it */
425 MOVE_CHARGE_TYPE_FILE, /* file page(including tmpfs) and swap of it */
429 /* "mc" and its members are protected by cgroup_mutex */
430 static struct move_charge_struct {
431 spinlock_t lock; /* for from, to */
432 struct mem_cgroup *from;
433 struct mem_cgroup *to;
434 unsigned long immigrate_flags;
435 unsigned long precharge;
436 unsigned long moved_charge;
437 unsigned long moved_swap;
438 struct task_struct *moving_task; /* a task moving charges */
439 wait_queue_head_t waitq; /* a waitq for other context */
441 .lock = __SPIN_LOCK_UNLOCKED(mc.lock),
442 .waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq),
445 static bool move_anon(void)
447 return test_bit(MOVE_CHARGE_TYPE_ANON, &mc.immigrate_flags);
450 static bool move_file(void)
452 return test_bit(MOVE_CHARGE_TYPE_FILE, &mc.immigrate_flags);
456 * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft
457 * limit reclaim to prevent infinite loops, if they ever occur.
459 #define MEM_CGROUP_MAX_RECLAIM_LOOPS 100
460 #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS 2
463 MEM_CGROUP_CHARGE_TYPE_CACHE = 0,
464 MEM_CGROUP_CHARGE_TYPE_ANON,
465 MEM_CGROUP_CHARGE_TYPE_SWAPOUT, /* for accounting swapcache */
466 MEM_CGROUP_CHARGE_TYPE_DROP, /* a page was unused swap cache */
470 /* for encoding cft->private value on file */
478 #define MEMFILE_PRIVATE(x, val) ((x) << 16 | (val))
479 #define MEMFILE_TYPE(val) ((val) >> 16 & 0xffff)
480 #define MEMFILE_ATTR(val) ((val) & 0xffff)
481 /* Used for OOM nofiier */
482 #define OOM_CONTROL (0)
485 * Reclaim flags for mem_cgroup_hierarchical_reclaim
487 #define MEM_CGROUP_RECLAIM_NOSWAP_BIT 0x0
488 #define MEM_CGROUP_RECLAIM_NOSWAP (1 << MEM_CGROUP_RECLAIM_NOSWAP_BIT)
489 #define MEM_CGROUP_RECLAIM_SHRINK_BIT 0x1
490 #define MEM_CGROUP_RECLAIM_SHRINK (1 << MEM_CGROUP_RECLAIM_SHRINK_BIT)
493 * The memcg_create_mutex will be held whenever a new cgroup is created.
494 * As a consequence, any change that needs to protect against new child cgroups
495 * appearing has to hold it as well.
497 static DEFINE_MUTEX(memcg_create_mutex);
499 struct mem_cgroup *mem_cgroup_from_css(struct cgroup_subsys_state *s)
501 return s ? container_of(s, struct mem_cgroup, css) : NULL;
504 /* Some nice accessors for the vmpressure. */
505 struct vmpressure *memcg_to_vmpressure(struct mem_cgroup *memcg)
508 memcg = root_mem_cgroup;
509 return &memcg->vmpressure;
512 struct cgroup_subsys_state *vmpressure_to_css(struct vmpressure *vmpr)
514 return &container_of(vmpr, struct mem_cgroup, vmpressure)->css;
517 static inline bool mem_cgroup_is_root(struct mem_cgroup *memcg)
519 return (memcg == root_mem_cgroup);
523 * We restrict the id in the range of [1, 65535], so it can fit into
526 #define MEM_CGROUP_ID_MAX USHRT_MAX
528 static inline unsigned short mem_cgroup_id(struct mem_cgroup *memcg)
531 * The ID of the root cgroup is 0, but memcg treat 0 as an
532 * invalid ID, so we return (cgroup_id + 1).
534 return memcg->css.cgroup->id + 1;
537 static inline struct mem_cgroup *mem_cgroup_from_id(unsigned short id)
539 struct cgroup_subsys_state *css;
541 css = css_from_id(id - 1, &mem_cgroup_subsys);
542 return mem_cgroup_from_css(css);
545 /* Writing them here to avoid exposing memcg's inner layout */
546 #if defined(CONFIG_INET) && defined(CONFIG_MEMCG_KMEM)
548 void sock_update_memcg(struct sock *sk)
550 if (mem_cgroup_sockets_enabled) {
551 struct mem_cgroup *memcg;
552 struct cg_proto *cg_proto;
554 BUG_ON(!sk->sk_prot->proto_cgroup);
556 /* Socket cloning can throw us here with sk_cgrp already
557 * filled. It won't however, necessarily happen from
558 * process context. So the test for root memcg given
559 * the current task's memcg won't help us in this case.
561 * Respecting the original socket's memcg is a better
562 * decision in this case.
565 BUG_ON(mem_cgroup_is_root(sk->sk_cgrp->memcg));
566 css_get(&sk->sk_cgrp->memcg->css);
571 memcg = mem_cgroup_from_task(current);
572 cg_proto = sk->sk_prot->proto_cgroup(memcg);
573 if (!mem_cgroup_is_root(memcg) &&
574 memcg_proto_active(cg_proto) && css_tryget(&memcg->css)) {
575 sk->sk_cgrp = cg_proto;
580 EXPORT_SYMBOL(sock_update_memcg);
582 void sock_release_memcg(struct sock *sk)
584 if (mem_cgroup_sockets_enabled && sk->sk_cgrp) {
585 struct mem_cgroup *memcg;
586 WARN_ON(!sk->sk_cgrp->memcg);
587 memcg = sk->sk_cgrp->memcg;
588 css_put(&sk->sk_cgrp->memcg->css);
592 struct cg_proto *tcp_proto_cgroup(struct mem_cgroup *memcg)
594 if (!memcg || mem_cgroup_is_root(memcg))
597 return &memcg->tcp_mem;
599 EXPORT_SYMBOL(tcp_proto_cgroup);
601 static void disarm_sock_keys(struct mem_cgroup *memcg)
603 if (!memcg_proto_activated(&memcg->tcp_mem))
605 static_key_slow_dec(&memcg_socket_limit_enabled);
608 static void disarm_sock_keys(struct mem_cgroup *memcg)
613 #ifdef CONFIG_MEMCG_KMEM
615 * This will be the memcg's index in each cache's ->memcg_params->memcg_caches.
616 * The main reason for not using cgroup id for this:
617 * this works better in sparse environments, where we have a lot of memcgs,
618 * but only a few kmem-limited. Or also, if we have, for instance, 200
619 * memcgs, and none but the 200th is kmem-limited, we'd have to have a
620 * 200 entry array for that.
622 * The current size of the caches array is stored in
623 * memcg_limited_groups_array_size. It will double each time we have to
626 static DEFINE_IDA(kmem_limited_groups);
627 int memcg_limited_groups_array_size;
630 * MIN_SIZE is different than 1, because we would like to avoid going through
631 * the alloc/free process all the time. In a small machine, 4 kmem-limited
632 * cgroups is a reasonable guess. In the future, it could be a parameter or
633 * tunable, but that is strictly not necessary.
635 * MAX_SIZE should be as large as the number of cgrp_ids. Ideally, we could get
636 * this constant directly from cgroup, but it is understandable that this is
637 * better kept as an internal representation in cgroup.c. In any case, the
638 * cgrp_id space is not getting any smaller, and we don't have to necessarily
639 * increase ours as well if it increases.
641 #define MEMCG_CACHES_MIN_SIZE 4
642 #define MEMCG_CACHES_MAX_SIZE MEM_CGROUP_ID_MAX
645 * A lot of the calls to the cache allocation functions are expected to be
646 * inlined by the compiler. Since the calls to memcg_kmem_get_cache are
647 * conditional to this static branch, we'll have to allow modules that does
648 * kmem_cache_alloc and the such to see this symbol as well
650 struct static_key memcg_kmem_enabled_key;
651 EXPORT_SYMBOL(memcg_kmem_enabled_key);
653 static void disarm_kmem_keys(struct mem_cgroup *memcg)
655 if (memcg_kmem_is_active(memcg)) {
656 static_key_slow_dec(&memcg_kmem_enabled_key);
657 ida_simple_remove(&kmem_limited_groups, memcg->kmemcg_id);
660 * This check can't live in kmem destruction function,
661 * since the charges will outlive the cgroup
663 WARN_ON(res_counter_read_u64(&memcg->kmem, RES_USAGE) != 0);
666 static void disarm_kmem_keys(struct mem_cgroup *memcg)
669 #endif /* CONFIG_MEMCG_KMEM */
671 static void disarm_static_keys(struct mem_cgroup *memcg)
673 disarm_sock_keys(memcg);
674 disarm_kmem_keys(memcg);
677 static void drain_all_stock_async(struct mem_cgroup *memcg);
679 static struct mem_cgroup_per_zone *
680 mem_cgroup_zoneinfo(struct mem_cgroup *memcg, int nid, int zid)
682 VM_BUG_ON((unsigned)nid >= nr_node_ids);
683 return &memcg->nodeinfo[nid]->zoneinfo[zid];
686 struct cgroup_subsys_state *mem_cgroup_css(struct mem_cgroup *memcg)
691 static struct mem_cgroup_per_zone *
692 page_cgroup_zoneinfo(struct mem_cgroup *memcg, struct page *page)
694 int nid = page_to_nid(page);
695 int zid = page_zonenum(page);
697 return mem_cgroup_zoneinfo(memcg, nid, zid);
700 static struct mem_cgroup_tree_per_zone *
701 soft_limit_tree_node_zone(int nid, int zid)
703 return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid];
706 static struct mem_cgroup_tree_per_zone *
707 soft_limit_tree_from_page(struct page *page)
709 int nid = page_to_nid(page);
710 int zid = page_zonenum(page);
712 return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid];
716 __mem_cgroup_insert_exceeded(struct mem_cgroup *memcg,
717 struct mem_cgroup_per_zone *mz,
718 struct mem_cgroup_tree_per_zone *mctz,
719 unsigned long long new_usage_in_excess)
721 struct rb_node **p = &mctz->rb_root.rb_node;
722 struct rb_node *parent = NULL;
723 struct mem_cgroup_per_zone *mz_node;
728 mz->usage_in_excess = new_usage_in_excess;
729 if (!mz->usage_in_excess)
733 mz_node = rb_entry(parent, struct mem_cgroup_per_zone,
735 if (mz->usage_in_excess < mz_node->usage_in_excess)
738 * We can't avoid mem cgroups that are over their soft
739 * limit by the same amount
741 else if (mz->usage_in_excess >= mz_node->usage_in_excess)
744 rb_link_node(&mz->tree_node, parent, p);
745 rb_insert_color(&mz->tree_node, &mctz->rb_root);
750 __mem_cgroup_remove_exceeded(struct mem_cgroup *memcg,
751 struct mem_cgroup_per_zone *mz,
752 struct mem_cgroup_tree_per_zone *mctz)
756 rb_erase(&mz->tree_node, &mctz->rb_root);
761 mem_cgroup_remove_exceeded(struct mem_cgroup *memcg,
762 struct mem_cgroup_per_zone *mz,
763 struct mem_cgroup_tree_per_zone *mctz)
765 spin_lock(&mctz->lock);
766 __mem_cgroup_remove_exceeded(memcg, mz, mctz);
767 spin_unlock(&mctz->lock);
771 static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page)
773 unsigned long long excess;
774 struct mem_cgroup_per_zone *mz;
775 struct mem_cgroup_tree_per_zone *mctz;
776 int nid = page_to_nid(page);
777 int zid = page_zonenum(page);
778 mctz = soft_limit_tree_from_page(page);
781 * Necessary to update all ancestors when hierarchy is used.
782 * because their event counter is not touched.
784 for (; memcg; memcg = parent_mem_cgroup(memcg)) {
785 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
786 excess = res_counter_soft_limit_excess(&memcg->res);
788 * We have to update the tree if mz is on RB-tree or
789 * mem is over its softlimit.
791 if (excess || mz->on_tree) {
792 spin_lock(&mctz->lock);
793 /* if on-tree, remove it */
795 __mem_cgroup_remove_exceeded(memcg, mz, mctz);
797 * Insert again. mz->usage_in_excess will be updated.
798 * If excess is 0, no tree ops.
800 __mem_cgroup_insert_exceeded(memcg, mz, mctz, excess);
801 spin_unlock(&mctz->lock);
806 static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg)
809 struct mem_cgroup_per_zone *mz;
810 struct mem_cgroup_tree_per_zone *mctz;
812 for_each_node(node) {
813 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
814 mz = mem_cgroup_zoneinfo(memcg, node, zone);
815 mctz = soft_limit_tree_node_zone(node, zone);
816 mem_cgroup_remove_exceeded(memcg, mz, mctz);
821 static struct mem_cgroup_per_zone *
822 __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz)
824 struct rb_node *rightmost = NULL;
825 struct mem_cgroup_per_zone *mz;
829 rightmost = rb_last(&mctz->rb_root);
831 goto done; /* Nothing to reclaim from */
833 mz = rb_entry(rightmost, struct mem_cgroup_per_zone, tree_node);
835 * Remove the node now but someone else can add it back,
836 * we will to add it back at the end of reclaim to its correct
837 * position in the tree.
839 __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz);
840 if (!res_counter_soft_limit_excess(&mz->memcg->res) ||
841 !css_tryget(&mz->memcg->css))
847 static struct mem_cgroup_per_zone *
848 mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz)
850 struct mem_cgroup_per_zone *mz;
852 spin_lock(&mctz->lock);
853 mz = __mem_cgroup_largest_soft_limit_node(mctz);
854 spin_unlock(&mctz->lock);
859 * Implementation Note: reading percpu statistics for memcg.
861 * Both of vmstat[] and percpu_counter has threshold and do periodic
862 * synchronization to implement "quick" read. There are trade-off between
863 * reading cost and precision of value. Then, we may have a chance to implement
864 * a periodic synchronizion of counter in memcg's counter.
866 * But this _read() function is used for user interface now. The user accounts
867 * memory usage by memory cgroup and he _always_ requires exact value because
868 * he accounts memory. Even if we provide quick-and-fuzzy read, we always
869 * have to visit all online cpus and make sum. So, for now, unnecessary
870 * synchronization is not implemented. (just implemented for cpu hotplug)
872 * If there are kernel internal actions which can make use of some not-exact
873 * value, and reading all cpu value can be performance bottleneck in some
874 * common workload, threashold and synchonization as vmstat[] should be
877 static long mem_cgroup_read_stat(struct mem_cgroup *memcg,
878 enum mem_cgroup_stat_index idx)
884 for_each_online_cpu(cpu)
885 val += per_cpu(memcg->stat->count[idx], cpu);
886 #ifdef CONFIG_HOTPLUG_CPU
887 spin_lock(&memcg->pcp_counter_lock);
888 val += memcg->nocpu_base.count[idx];
889 spin_unlock(&memcg->pcp_counter_lock);
895 static void mem_cgroup_swap_statistics(struct mem_cgroup *memcg,
898 int val = (charge) ? 1 : -1;
899 this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_SWAP], val);
902 static unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg,
903 enum mem_cgroup_events_index idx)
905 unsigned long val = 0;
909 for_each_online_cpu(cpu)
910 val += per_cpu(memcg->stat->events[idx], cpu);
911 #ifdef CONFIG_HOTPLUG_CPU
912 spin_lock(&memcg->pcp_counter_lock);
913 val += memcg->nocpu_base.events[idx];
914 spin_unlock(&memcg->pcp_counter_lock);
920 static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg,
922 bool anon, int nr_pages)
927 * Here, RSS means 'mapped anon' and anon's SwapCache. Shmem/tmpfs is
928 * counted as CACHE even if it's on ANON LRU.
931 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_RSS],
934 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_CACHE],
937 if (PageTransHuge(page))
938 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_RSS_HUGE],
941 /* pagein of a big page is an event. So, ignore page size */
943 __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGIN]);
945 __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGOUT]);
946 nr_pages = -nr_pages; /* for event */
949 __this_cpu_add(memcg->stat->nr_page_events, nr_pages);
955 mem_cgroup_get_lru_size(struct lruvec *lruvec, enum lru_list lru)
957 struct mem_cgroup_per_zone *mz;
959 mz = container_of(lruvec, struct mem_cgroup_per_zone, lruvec);
960 return mz->lru_size[lru];
964 mem_cgroup_zone_nr_lru_pages(struct mem_cgroup *memcg, int nid, int zid,
965 unsigned int lru_mask)
967 struct mem_cgroup_per_zone *mz;
969 unsigned long ret = 0;
971 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
974 if (BIT(lru) & lru_mask)
975 ret += mz->lru_size[lru];
981 mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg,
982 int nid, unsigned int lru_mask)
987 for (zid = 0; zid < MAX_NR_ZONES; zid++)
988 total += mem_cgroup_zone_nr_lru_pages(memcg,
994 static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg,
995 unsigned int lru_mask)
1000 for_each_node_state(nid, N_MEMORY)
1001 total += mem_cgroup_node_nr_lru_pages(memcg, nid, lru_mask);
1005 static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg,
1006 enum mem_cgroup_events_target target)
1008 unsigned long val, next;
1010 val = __this_cpu_read(memcg->stat->nr_page_events);
1011 next = __this_cpu_read(memcg->stat->targets[target]);
1012 /* from time_after() in jiffies.h */
1013 if ((long)next - (long)val < 0) {
1015 case MEM_CGROUP_TARGET_THRESH:
1016 next = val + THRESHOLDS_EVENTS_TARGET;
1018 case MEM_CGROUP_TARGET_SOFTLIMIT:
1019 next = val + SOFTLIMIT_EVENTS_TARGET;
1021 case MEM_CGROUP_TARGET_NUMAINFO:
1022 next = val + NUMAINFO_EVENTS_TARGET;
1027 __this_cpu_write(memcg->stat->targets[target], next);
1034 * Check events in order.
1037 static void memcg_check_events(struct mem_cgroup *memcg, struct page *page)
1040 /* threshold event is triggered in finer grain than soft limit */
1041 if (unlikely(mem_cgroup_event_ratelimit(memcg,
1042 MEM_CGROUP_TARGET_THRESH))) {
1044 bool do_numainfo __maybe_unused;
1046 do_softlimit = mem_cgroup_event_ratelimit(memcg,
1047 MEM_CGROUP_TARGET_SOFTLIMIT);
1048 #if MAX_NUMNODES > 1
1049 do_numainfo = mem_cgroup_event_ratelimit(memcg,
1050 MEM_CGROUP_TARGET_NUMAINFO);
1054 mem_cgroup_threshold(memcg);
1055 if (unlikely(do_softlimit))
1056 mem_cgroup_update_tree(memcg, page);
1057 #if MAX_NUMNODES > 1
1058 if (unlikely(do_numainfo))
1059 atomic_inc(&memcg->numainfo_events);
1065 struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p)
1068 * mm_update_next_owner() may clear mm->owner to NULL
1069 * if it races with swapoff, page migration, etc.
1070 * So this can be called with p == NULL.
1075 return mem_cgroup_from_css(task_css(p, mem_cgroup_subsys_id));
1078 struct mem_cgroup *try_get_mem_cgroup_from_mm(struct mm_struct *mm)
1080 struct mem_cgroup *memcg = NULL;
1085 * Because we have no locks, mm->owner's may be being moved to other
1086 * cgroup. We use css_tryget() here even if this looks
1087 * pessimistic (rather than adding locks here).
1091 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
1092 if (unlikely(!memcg))
1094 } while (!css_tryget(&memcg->css));
1100 * Returns a next (in a pre-order walk) alive memcg (with elevated css
1101 * ref. count) or NULL if the whole root's subtree has been visited.
1103 * helper function to be used by mem_cgroup_iter
1105 static struct mem_cgroup *__mem_cgroup_iter_next(struct mem_cgroup *root,
1106 struct mem_cgroup *last_visited)
1108 struct cgroup_subsys_state *prev_css, *next_css;
1110 prev_css = last_visited ? &last_visited->css : NULL;
1112 next_css = css_next_descendant_pre(prev_css, &root->css);
1115 * Even if we found a group we have to make sure it is
1116 * alive. css && !memcg means that the groups should be
1117 * skipped and we should continue the tree walk.
1118 * last_visited css is safe to use because it is
1119 * protected by css_get and the tree walk is rcu safe.
1122 struct mem_cgroup *mem = mem_cgroup_from_css(next_css);
1124 if (css_tryget(&mem->css))
1127 prev_css = next_css;
1135 static void mem_cgroup_iter_invalidate(struct mem_cgroup *root)
1138 * When a group in the hierarchy below root is destroyed, the
1139 * hierarchy iterator can no longer be trusted since it might
1140 * have pointed to the destroyed group. Invalidate it.
1142 atomic_inc(&root->dead_count);
1145 static struct mem_cgroup *
1146 mem_cgroup_iter_load(struct mem_cgroup_reclaim_iter *iter,
1147 struct mem_cgroup *root,
1150 struct mem_cgroup *position = NULL;
1152 * A cgroup destruction happens in two stages: offlining and
1153 * release. They are separated by a RCU grace period.
1155 * If the iterator is valid, we may still race with an
1156 * offlining. The RCU lock ensures the object won't be
1157 * released, tryget will fail if we lost the race.
1159 *sequence = atomic_read(&root->dead_count);
1160 if (iter->last_dead_count == *sequence) {
1162 position = iter->last_visited;
1163 if (position && !css_tryget(&position->css))
1169 static void mem_cgroup_iter_update(struct mem_cgroup_reclaim_iter *iter,
1170 struct mem_cgroup *last_visited,
1171 struct mem_cgroup *new_position,
1175 css_put(&last_visited->css);
1177 * We store the sequence count from the time @last_visited was
1178 * loaded successfully instead of rereading it here so that we
1179 * don't lose destruction events in between. We could have
1180 * raced with the destruction of @new_position after all.
1182 iter->last_visited = new_position;
1184 iter->last_dead_count = sequence;
1188 * mem_cgroup_iter - iterate over memory cgroup hierarchy
1189 * @root: hierarchy root
1190 * @prev: previously returned memcg, NULL on first invocation
1191 * @reclaim: cookie for shared reclaim walks, NULL for full walks
1193 * Returns references to children of the hierarchy below @root, or
1194 * @root itself, or %NULL after a full round-trip.
1196 * Caller must pass the return value in @prev on subsequent
1197 * invocations for reference counting, or use mem_cgroup_iter_break()
1198 * to cancel a hierarchy walk before the round-trip is complete.
1200 * Reclaimers can specify a zone and a priority level in @reclaim to
1201 * divide up the memcgs in the hierarchy among all concurrent
1202 * reclaimers operating on the same zone and priority.
1204 struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root,
1205 struct mem_cgroup *prev,
1206 struct mem_cgroup_reclaim_cookie *reclaim)
1208 struct mem_cgroup *memcg = NULL;
1209 struct mem_cgroup *last_visited = NULL;
1211 if (mem_cgroup_disabled())
1215 root = root_mem_cgroup;
1217 if (prev && !reclaim)
1218 last_visited = prev;
1220 if (!root->use_hierarchy && root != root_mem_cgroup) {
1228 struct mem_cgroup_reclaim_iter *uninitialized_var(iter);
1229 int uninitialized_var(seq);
1232 int nid = zone_to_nid(reclaim->zone);
1233 int zid = zone_idx(reclaim->zone);
1234 struct mem_cgroup_per_zone *mz;
1236 mz = mem_cgroup_zoneinfo(root, nid, zid);
1237 iter = &mz->reclaim_iter[reclaim->priority];
1238 if (prev && reclaim->generation != iter->generation) {
1239 iter->last_visited = NULL;
1243 last_visited = mem_cgroup_iter_load(iter, root, &seq);
1246 memcg = __mem_cgroup_iter_next(root, last_visited);
1249 mem_cgroup_iter_update(iter, last_visited, memcg, seq);
1253 else if (!prev && memcg)
1254 reclaim->generation = iter->generation;
1263 if (prev && prev != root)
1264 css_put(&prev->css);
1270 * mem_cgroup_iter_break - abort a hierarchy walk prematurely
1271 * @root: hierarchy root
1272 * @prev: last visited hierarchy member as returned by mem_cgroup_iter()
1274 void mem_cgroup_iter_break(struct mem_cgroup *root,
1275 struct mem_cgroup *prev)
1278 root = root_mem_cgroup;
1279 if (prev && prev != root)
1280 css_put(&prev->css);
1284 * Iteration constructs for visiting all cgroups (under a tree). If
1285 * loops are exited prematurely (break), mem_cgroup_iter_break() must
1286 * be used for reference counting.
1288 #define for_each_mem_cgroup_tree(iter, root) \
1289 for (iter = mem_cgroup_iter(root, NULL, NULL); \
1291 iter = mem_cgroup_iter(root, iter, NULL))
1293 #define for_each_mem_cgroup(iter) \
1294 for (iter = mem_cgroup_iter(NULL, NULL, NULL); \
1296 iter = mem_cgroup_iter(NULL, iter, NULL))
1298 void __mem_cgroup_count_vm_event(struct mm_struct *mm, enum vm_event_item idx)
1300 struct mem_cgroup *memcg;
1303 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
1304 if (unlikely(!memcg))
1309 this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGFAULT]);
1312 this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGMAJFAULT]);
1320 EXPORT_SYMBOL(__mem_cgroup_count_vm_event);
1323 * mem_cgroup_zone_lruvec - get the lru list vector for a zone and memcg
1324 * @zone: zone of the wanted lruvec
1325 * @memcg: memcg of the wanted lruvec
1327 * Returns the lru list vector holding pages for the given @zone and
1328 * @mem. This can be the global zone lruvec, if the memory controller
1331 struct lruvec *mem_cgroup_zone_lruvec(struct zone *zone,
1332 struct mem_cgroup *memcg)
1334 struct mem_cgroup_per_zone *mz;
1335 struct lruvec *lruvec;
1337 if (mem_cgroup_disabled()) {
1338 lruvec = &zone->lruvec;
1342 mz = mem_cgroup_zoneinfo(memcg, zone_to_nid(zone), zone_idx(zone));
1343 lruvec = &mz->lruvec;
1346 * Since a node can be onlined after the mem_cgroup was created,
1347 * we have to be prepared to initialize lruvec->zone here;
1348 * and if offlined then reonlined, we need to reinitialize it.
1350 if (unlikely(lruvec->zone != zone))
1351 lruvec->zone = zone;
1356 * Following LRU functions are allowed to be used without PCG_LOCK.
1357 * Operations are called by routine of global LRU independently from memcg.
1358 * What we have to take care of here is validness of pc->mem_cgroup.
1360 * Changes to pc->mem_cgroup happens when
1363 * In typical case, "charge" is done before add-to-lru. Exception is SwapCache.
1364 * It is added to LRU before charge.
1365 * If PCG_USED bit is not set, page_cgroup is not added to this private LRU.
1366 * When moving account, the page is not on LRU. It's isolated.
1370 * mem_cgroup_page_lruvec - return lruvec for adding an lru page
1372 * @zone: zone of the page
1374 struct lruvec *mem_cgroup_page_lruvec(struct page *page, struct zone *zone)
1376 struct mem_cgroup_per_zone *mz;
1377 struct mem_cgroup *memcg;
1378 struct page_cgroup *pc;
1379 struct lruvec *lruvec;
1381 if (mem_cgroup_disabled()) {
1382 lruvec = &zone->lruvec;
1386 pc = lookup_page_cgroup(page);
1387 memcg = pc->mem_cgroup;
1390 * Surreptitiously switch any uncharged offlist page to root:
1391 * an uncharged page off lru does nothing to secure
1392 * its former mem_cgroup from sudden removal.
1394 * Our caller holds lru_lock, and PageCgroupUsed is updated
1395 * under page_cgroup lock: between them, they make all uses
1396 * of pc->mem_cgroup safe.
1398 if (!PageLRU(page) && !PageCgroupUsed(pc) && memcg != root_mem_cgroup)
1399 pc->mem_cgroup = memcg = root_mem_cgroup;
1401 mz = page_cgroup_zoneinfo(memcg, page);
1402 lruvec = &mz->lruvec;
1405 * Since a node can be onlined after the mem_cgroup was created,
1406 * we have to be prepared to initialize lruvec->zone here;
1407 * and if offlined then reonlined, we need to reinitialize it.
1409 if (unlikely(lruvec->zone != zone))
1410 lruvec->zone = zone;
1415 * mem_cgroup_update_lru_size - account for adding or removing an lru page
1416 * @lruvec: mem_cgroup per zone lru vector
1417 * @lru: index of lru list the page is sitting on
1418 * @nr_pages: positive when adding or negative when removing
1420 * This function must be called when a page is added to or removed from an
1423 void mem_cgroup_update_lru_size(struct lruvec *lruvec, enum lru_list lru,
1426 struct mem_cgroup_per_zone *mz;
1427 unsigned long *lru_size;
1429 if (mem_cgroup_disabled())
1432 mz = container_of(lruvec, struct mem_cgroup_per_zone, lruvec);
1433 lru_size = mz->lru_size + lru;
1434 *lru_size += nr_pages;
1435 VM_BUG_ON((long)(*lru_size) < 0);
1439 * Checks whether given mem is same or in the root_mem_cgroup's
1442 bool __mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg,
1443 struct mem_cgroup *memcg)
1445 if (root_memcg == memcg)
1447 if (!root_memcg->use_hierarchy || !memcg)
1449 return cgroup_is_descendant(memcg->css.cgroup, root_memcg->css.cgroup);
1452 static bool mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg,
1453 struct mem_cgroup *memcg)
1458 ret = __mem_cgroup_same_or_subtree(root_memcg, memcg);
1463 bool task_in_mem_cgroup(struct task_struct *task,
1464 const struct mem_cgroup *memcg)
1466 struct mem_cgroup *curr = NULL;
1467 struct task_struct *p;
1470 p = find_lock_task_mm(task);
1472 curr = try_get_mem_cgroup_from_mm(p->mm);
1476 * All threads may have already detached their mm's, but the oom
1477 * killer still needs to detect if they have already been oom
1478 * killed to prevent needlessly killing additional tasks.
1481 curr = mem_cgroup_from_task(task);
1483 css_get(&curr->css);
1489 * We should check use_hierarchy of "memcg" not "curr". Because checking
1490 * use_hierarchy of "curr" here make this function true if hierarchy is
1491 * enabled in "curr" and "curr" is a child of "memcg" in *cgroup*
1492 * hierarchy(even if use_hierarchy is disabled in "memcg").
1494 ret = mem_cgroup_same_or_subtree(memcg, curr);
1495 css_put(&curr->css);
1499 int mem_cgroup_inactive_anon_is_low(struct lruvec *lruvec)
1501 unsigned long inactive_ratio;
1502 unsigned long inactive;
1503 unsigned long active;
1506 inactive = mem_cgroup_get_lru_size(lruvec, LRU_INACTIVE_ANON);
1507 active = mem_cgroup_get_lru_size(lruvec, LRU_ACTIVE_ANON);
1509 gb = (inactive + active) >> (30 - PAGE_SHIFT);
1511 inactive_ratio = int_sqrt(10 * gb);
1515 return inactive * inactive_ratio < active;
1518 #define mem_cgroup_from_res_counter(counter, member) \
1519 container_of(counter, struct mem_cgroup, member)
1522 * mem_cgroup_margin - calculate chargeable space of a memory cgroup
1523 * @memcg: the memory cgroup
1525 * Returns the maximum amount of memory @mem can be charged with, in
1528 static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg)
1530 unsigned long long margin;
1532 margin = res_counter_margin(&memcg->res);
1533 if (do_swap_account)
1534 margin = min(margin, res_counter_margin(&memcg->memsw));
1535 return margin >> PAGE_SHIFT;
1538 int mem_cgroup_swappiness(struct mem_cgroup *memcg)
1541 if (!css_parent(&memcg->css))
1542 return vm_swappiness;
1544 return memcg->swappiness;
1548 * memcg->moving_account is used for checking possibility that some thread is
1549 * calling move_account(). When a thread on CPU-A starts moving pages under
1550 * a memcg, other threads should check memcg->moving_account under
1551 * rcu_read_lock(), like this:
1555 * memcg->moving_account+1 if (memcg->mocing_account)
1557 * synchronize_rcu() update something.
1562 /* for quick checking without looking up memcg */
1563 atomic_t memcg_moving __read_mostly;
1565 static void mem_cgroup_start_move(struct mem_cgroup *memcg)
1567 atomic_inc(&memcg_moving);
1568 atomic_inc(&memcg->moving_account);
1572 static void mem_cgroup_end_move(struct mem_cgroup *memcg)
1575 * Now, mem_cgroup_clear_mc() may call this function with NULL.
1576 * We check NULL in callee rather than caller.
1579 atomic_dec(&memcg_moving);
1580 atomic_dec(&memcg->moving_account);
1585 * 2 routines for checking "mem" is under move_account() or not.
1587 * mem_cgroup_stolen() - checking whether a cgroup is mc.from or not. This
1588 * is used for avoiding races in accounting. If true,
1589 * pc->mem_cgroup may be overwritten.
1591 * mem_cgroup_under_move() - checking a cgroup is mc.from or mc.to or
1592 * under hierarchy of moving cgroups. This is for
1593 * waiting at hith-memory prressure caused by "move".
1596 static bool mem_cgroup_stolen(struct mem_cgroup *memcg)
1598 VM_BUG_ON(!rcu_read_lock_held());
1599 return atomic_read(&memcg->moving_account) > 0;
1602 static bool mem_cgroup_under_move(struct mem_cgroup *memcg)
1604 struct mem_cgroup *from;
1605 struct mem_cgroup *to;
1608 * Unlike task_move routines, we access mc.to, mc.from not under
1609 * mutual exclusion by cgroup_mutex. Here, we take spinlock instead.
1611 spin_lock(&mc.lock);
1617 ret = mem_cgroup_same_or_subtree(memcg, from)
1618 || mem_cgroup_same_or_subtree(memcg, to);
1620 spin_unlock(&mc.lock);
1624 static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg)
1626 if (mc.moving_task && current != mc.moving_task) {
1627 if (mem_cgroup_under_move(memcg)) {
1629 prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE);
1630 /* moving charge context might have finished. */
1633 finish_wait(&mc.waitq, &wait);
1641 * Take this lock when
1642 * - a code tries to modify page's memcg while it's USED.
1643 * - a code tries to modify page state accounting in a memcg.
1644 * see mem_cgroup_stolen(), too.
1646 static void move_lock_mem_cgroup(struct mem_cgroup *memcg,
1647 unsigned long *flags)
1649 spin_lock_irqsave(&memcg->move_lock, *flags);
1652 static void move_unlock_mem_cgroup(struct mem_cgroup *memcg,
1653 unsigned long *flags)
1655 spin_unlock_irqrestore(&memcg->move_lock, *flags);
1658 #define K(x) ((x) << (PAGE_SHIFT-10))
1660 * mem_cgroup_print_oom_info: Print OOM information relevant to memory controller.
1661 * @memcg: The memory cgroup that went over limit
1662 * @p: Task that is going to be killed
1664 * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is
1667 void mem_cgroup_print_oom_info(struct mem_cgroup *memcg, struct task_struct *p)
1670 * protects memcg_name and makes sure that parallel ooms do not
1673 static DEFINE_SPINLOCK(oom_info_lock);
1674 struct cgroup *task_cgrp;
1675 struct cgroup *mem_cgrp;
1676 static char memcg_name[PATH_MAX];
1678 struct mem_cgroup *iter;
1684 spin_lock(&oom_info_lock);
1687 mem_cgrp = memcg->css.cgroup;
1688 task_cgrp = task_cgroup(p, mem_cgroup_subsys_id);
1690 ret = cgroup_path(task_cgrp, memcg_name, PATH_MAX);
1693 * Unfortunately, we are unable to convert to a useful name
1694 * But we'll still print out the usage information
1701 pr_info("Task in %s killed", memcg_name);
1704 ret = cgroup_path(mem_cgrp, memcg_name, PATH_MAX);
1712 * Continues from above, so we don't need an KERN_ level
1714 pr_cont(" as a result of limit of %s\n", memcg_name);
1717 pr_info("memory: usage %llukB, limit %llukB, failcnt %llu\n",
1718 res_counter_read_u64(&memcg->res, RES_USAGE) >> 10,
1719 res_counter_read_u64(&memcg->res, RES_LIMIT) >> 10,
1720 res_counter_read_u64(&memcg->res, RES_FAILCNT));
1721 pr_info("memory+swap: usage %llukB, limit %llukB, failcnt %llu\n",
1722 res_counter_read_u64(&memcg->memsw, RES_USAGE) >> 10,
1723 res_counter_read_u64(&memcg->memsw, RES_LIMIT) >> 10,
1724 res_counter_read_u64(&memcg->memsw, RES_FAILCNT));
1725 pr_info("kmem: usage %llukB, limit %llukB, failcnt %llu\n",
1726 res_counter_read_u64(&memcg->kmem, RES_USAGE) >> 10,
1727 res_counter_read_u64(&memcg->kmem, RES_LIMIT) >> 10,
1728 res_counter_read_u64(&memcg->kmem, RES_FAILCNT));
1730 for_each_mem_cgroup_tree(iter, memcg) {
1731 pr_info("Memory cgroup stats");
1734 ret = cgroup_path(iter->css.cgroup, memcg_name, PATH_MAX);
1736 pr_cont(" for %s", memcg_name);
1740 for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) {
1741 if (i == MEM_CGROUP_STAT_SWAP && !do_swap_account)
1743 pr_cont(" %s:%ldKB", mem_cgroup_stat_names[i],
1744 K(mem_cgroup_read_stat(iter, i)));
1747 for (i = 0; i < NR_LRU_LISTS; i++)
1748 pr_cont(" %s:%luKB", mem_cgroup_lru_names[i],
1749 K(mem_cgroup_nr_lru_pages(iter, BIT(i))));
1753 spin_unlock(&oom_info_lock);
1757 * This function returns the number of memcg under hierarchy tree. Returns
1758 * 1(self count) if no children.
1760 static int mem_cgroup_count_children(struct mem_cgroup *memcg)
1763 struct mem_cgroup *iter;
1765 for_each_mem_cgroup_tree(iter, memcg)
1771 * Return the memory (and swap, if configured) limit for a memcg.
1773 static u64 mem_cgroup_get_limit(struct mem_cgroup *memcg)
1777 limit = res_counter_read_u64(&memcg->res, RES_LIMIT);
1780 * Do not consider swap space if we cannot swap due to swappiness
1782 if (mem_cgroup_swappiness(memcg)) {
1785 limit += total_swap_pages << PAGE_SHIFT;
1786 memsw = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
1789 * If memsw is finite and limits the amount of swap space
1790 * available to this memcg, return that limit.
1792 limit = min(limit, memsw);
1798 static void mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask,
1801 struct mem_cgroup *iter;
1802 unsigned long chosen_points = 0;
1803 unsigned long totalpages;
1804 unsigned int points = 0;
1805 struct task_struct *chosen = NULL;
1808 * If current has a pending SIGKILL or is exiting, then automatically
1809 * select it. The goal is to allow it to allocate so that it may
1810 * quickly exit and free its memory.
1812 if (fatal_signal_pending(current) || current->flags & PF_EXITING) {
1813 set_thread_flag(TIF_MEMDIE);
1817 check_panic_on_oom(CONSTRAINT_MEMCG, gfp_mask, order, NULL);
1818 totalpages = mem_cgroup_get_limit(memcg) >> PAGE_SHIFT ? : 1;
1819 for_each_mem_cgroup_tree(iter, memcg) {
1820 struct css_task_iter it;
1821 struct task_struct *task;
1823 css_task_iter_start(&iter->css, &it);
1824 while ((task = css_task_iter_next(&it))) {
1825 switch (oom_scan_process_thread(task, totalpages, NULL,
1827 case OOM_SCAN_SELECT:
1829 put_task_struct(chosen);
1831 chosen_points = ULONG_MAX;
1832 get_task_struct(chosen);
1834 case OOM_SCAN_CONTINUE:
1836 case OOM_SCAN_ABORT:
1837 css_task_iter_end(&it);
1838 mem_cgroup_iter_break(memcg, iter);
1840 put_task_struct(chosen);
1845 points = oom_badness(task, memcg, NULL, totalpages);
1846 if (points > chosen_points) {
1848 put_task_struct(chosen);
1850 chosen_points = points;
1851 get_task_struct(chosen);
1854 css_task_iter_end(&it);
1859 points = chosen_points * 1000 / totalpages;
1860 oom_kill_process(chosen, gfp_mask, order, points, totalpages, memcg,
1861 NULL, "Memory cgroup out of memory");
1864 static unsigned long mem_cgroup_reclaim(struct mem_cgroup *memcg,
1866 unsigned long flags)
1868 unsigned long total = 0;
1869 bool noswap = false;
1872 if (flags & MEM_CGROUP_RECLAIM_NOSWAP)
1874 if (!(flags & MEM_CGROUP_RECLAIM_SHRINK) && memcg->memsw_is_minimum)
1877 for (loop = 0; loop < MEM_CGROUP_MAX_RECLAIM_LOOPS; loop++) {
1879 drain_all_stock_async(memcg);
1880 total += try_to_free_mem_cgroup_pages(memcg, gfp_mask, noswap);
1882 * Allow limit shrinkers, which are triggered directly
1883 * by userspace, to catch signals and stop reclaim
1884 * after minimal progress, regardless of the margin.
1886 if (total && (flags & MEM_CGROUP_RECLAIM_SHRINK))
1888 if (mem_cgroup_margin(memcg))
1891 * If nothing was reclaimed after two attempts, there
1892 * may be no reclaimable pages in this hierarchy.
1901 * test_mem_cgroup_node_reclaimable
1902 * @memcg: the target memcg
1903 * @nid: the node ID to be checked.
1904 * @noswap : specify true here if the user wants flle only information.
1906 * This function returns whether the specified memcg contains any
1907 * reclaimable pages on a node. Returns true if there are any reclaimable
1908 * pages in the node.
1910 static bool test_mem_cgroup_node_reclaimable(struct mem_cgroup *memcg,
1911 int nid, bool noswap)
1913 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_FILE))
1915 if (noswap || !total_swap_pages)
1917 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_ANON))
1922 #if MAX_NUMNODES > 1
1925 * Always updating the nodemask is not very good - even if we have an empty
1926 * list or the wrong list here, we can start from some node and traverse all
1927 * nodes based on the zonelist. So update the list loosely once per 10 secs.
1930 static void mem_cgroup_may_update_nodemask(struct mem_cgroup *memcg)
1934 * numainfo_events > 0 means there was at least NUMAINFO_EVENTS_TARGET
1935 * pagein/pageout changes since the last update.
1937 if (!atomic_read(&memcg->numainfo_events))
1939 if (atomic_inc_return(&memcg->numainfo_updating) > 1)
1942 /* make a nodemask where this memcg uses memory from */
1943 memcg->scan_nodes = node_states[N_MEMORY];
1945 for_each_node_mask(nid, node_states[N_MEMORY]) {
1947 if (!test_mem_cgroup_node_reclaimable(memcg, nid, false))
1948 node_clear(nid, memcg->scan_nodes);
1951 atomic_set(&memcg->numainfo_events, 0);
1952 atomic_set(&memcg->numainfo_updating, 0);
1956 * Selecting a node where we start reclaim from. Because what we need is just
1957 * reducing usage counter, start from anywhere is O,K. Considering
1958 * memory reclaim from current node, there are pros. and cons.
1960 * Freeing memory from current node means freeing memory from a node which
1961 * we'll use or we've used. So, it may make LRU bad. And if several threads
1962 * hit limits, it will see a contention on a node. But freeing from remote
1963 * node means more costs for memory reclaim because of memory latency.
1965 * Now, we use round-robin. Better algorithm is welcomed.
1967 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1971 mem_cgroup_may_update_nodemask(memcg);
1972 node = memcg->last_scanned_node;
1974 node = next_node(node, memcg->scan_nodes);
1975 if (node == MAX_NUMNODES)
1976 node = first_node(memcg->scan_nodes);
1978 * We call this when we hit limit, not when pages are added to LRU.
1979 * No LRU may hold pages because all pages are UNEVICTABLE or
1980 * memcg is too small and all pages are not on LRU. In that case,
1981 * we use curret node.
1983 if (unlikely(node == MAX_NUMNODES))
1984 node = numa_node_id();
1986 memcg->last_scanned_node = node;
1991 * Check all nodes whether it contains reclaimable pages or not.
1992 * For quick scan, we make use of scan_nodes. This will allow us to skip
1993 * unused nodes. But scan_nodes is lazily updated and may not cotain
1994 * enough new information. We need to do double check.
1996 static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
2001 * quick check...making use of scan_node.
2002 * We can skip unused nodes.
2004 if (!nodes_empty(memcg->scan_nodes)) {
2005 for (nid = first_node(memcg->scan_nodes);
2007 nid = next_node(nid, memcg->scan_nodes)) {
2009 if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
2014 * Check rest of nodes.
2016 for_each_node_state(nid, N_MEMORY) {
2017 if (node_isset(nid, memcg->scan_nodes))
2019 if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
2026 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
2031 static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
2033 return test_mem_cgroup_node_reclaimable(memcg, 0, noswap);
2037 static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg,
2040 unsigned long *total_scanned)
2042 struct mem_cgroup *victim = NULL;
2045 unsigned long excess;
2046 unsigned long nr_scanned;
2047 struct mem_cgroup_reclaim_cookie reclaim = {
2052 excess = res_counter_soft_limit_excess(&root_memcg->res) >> PAGE_SHIFT;
2055 victim = mem_cgroup_iter(root_memcg, victim, &reclaim);
2060 * If we have not been able to reclaim
2061 * anything, it might because there are
2062 * no reclaimable pages under this hierarchy
2067 * We want to do more targeted reclaim.
2068 * excess >> 2 is not to excessive so as to
2069 * reclaim too much, nor too less that we keep
2070 * coming back to reclaim from this cgroup
2072 if (total >= (excess >> 2) ||
2073 (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS))
2078 if (!mem_cgroup_reclaimable(victim, false))
2080 total += mem_cgroup_shrink_node_zone(victim, gfp_mask, false,
2082 *total_scanned += nr_scanned;
2083 if (!res_counter_soft_limit_excess(&root_memcg->res))
2086 mem_cgroup_iter_break(root_memcg, victim);
2090 #ifdef CONFIG_LOCKDEP
2091 static struct lockdep_map memcg_oom_lock_dep_map = {
2092 .name = "memcg_oom_lock",
2096 static DEFINE_SPINLOCK(memcg_oom_lock);
2099 * Check OOM-Killer is already running under our hierarchy.
2100 * If someone is running, return false.
2102 static bool mem_cgroup_oom_trylock(struct mem_cgroup *memcg)
2104 struct mem_cgroup *iter, *failed = NULL;
2106 spin_lock(&memcg_oom_lock);
2108 for_each_mem_cgroup_tree(iter, memcg) {
2109 if (iter->oom_lock) {
2111 * this subtree of our hierarchy is already locked
2112 * so we cannot give a lock.
2115 mem_cgroup_iter_break(memcg, iter);
2118 iter->oom_lock = true;
2123 * OK, we failed to lock the whole subtree so we have
2124 * to clean up what we set up to the failing subtree
2126 for_each_mem_cgroup_tree(iter, memcg) {
2127 if (iter == failed) {
2128 mem_cgroup_iter_break(memcg, iter);
2131 iter->oom_lock = false;
2134 mutex_acquire(&memcg_oom_lock_dep_map, 0, 1, _RET_IP_);
2136 spin_unlock(&memcg_oom_lock);
2141 static void mem_cgroup_oom_unlock(struct mem_cgroup *memcg)
2143 struct mem_cgroup *iter;
2145 spin_lock(&memcg_oom_lock);
2146 mutex_release(&memcg_oom_lock_dep_map, 1, _RET_IP_);
2147 for_each_mem_cgroup_tree(iter, memcg)
2148 iter->oom_lock = false;
2149 spin_unlock(&memcg_oom_lock);
2152 static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg)
2154 struct mem_cgroup *iter;
2156 for_each_mem_cgroup_tree(iter, memcg)
2157 atomic_inc(&iter->under_oom);
2160 static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg)
2162 struct mem_cgroup *iter;
2165 * When a new child is created while the hierarchy is under oom,
2166 * mem_cgroup_oom_lock() may not be called. We have to use
2167 * atomic_add_unless() here.
2169 for_each_mem_cgroup_tree(iter, memcg)
2170 atomic_add_unless(&iter->under_oom, -1, 0);
2173 static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq);
2175 struct oom_wait_info {
2176 struct mem_cgroup *memcg;
2180 static int memcg_oom_wake_function(wait_queue_t *wait,
2181 unsigned mode, int sync, void *arg)
2183 struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg;
2184 struct mem_cgroup *oom_wait_memcg;
2185 struct oom_wait_info *oom_wait_info;
2187 oom_wait_info = container_of(wait, struct oom_wait_info, wait);
2188 oom_wait_memcg = oom_wait_info->memcg;
2191 * Both of oom_wait_info->memcg and wake_memcg are stable under us.
2192 * Then we can use css_is_ancestor without taking care of RCU.
2194 if (!mem_cgroup_same_or_subtree(oom_wait_memcg, wake_memcg)
2195 && !mem_cgroup_same_or_subtree(wake_memcg, oom_wait_memcg))
2197 return autoremove_wake_function(wait, mode, sync, arg);
2200 static void memcg_wakeup_oom(struct mem_cgroup *memcg)
2202 atomic_inc(&memcg->oom_wakeups);
2203 /* for filtering, pass "memcg" as argument. */
2204 __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg);
2207 static void memcg_oom_recover(struct mem_cgroup *memcg)
2209 if (memcg && atomic_read(&memcg->under_oom))
2210 memcg_wakeup_oom(memcg);
2213 static void mem_cgroup_oom(struct mem_cgroup *memcg, gfp_t mask, int order)
2215 if (!current->memcg_oom.may_oom)
2218 * We are in the middle of the charge context here, so we
2219 * don't want to block when potentially sitting on a callstack
2220 * that holds all kinds of filesystem and mm locks.
2222 * Also, the caller may handle a failed allocation gracefully
2223 * (like optional page cache readahead) and so an OOM killer
2224 * invocation might not even be necessary.
2226 * That's why we don't do anything here except remember the
2227 * OOM context and then deal with it at the end of the page
2228 * fault when the stack is unwound, the locks are released,
2229 * and when we know whether the fault was overall successful.
2231 css_get(&memcg->css);
2232 current->memcg_oom.memcg = memcg;
2233 current->memcg_oom.gfp_mask = mask;
2234 current->memcg_oom.order = order;
2238 * mem_cgroup_oom_synchronize - complete memcg OOM handling
2239 * @handle: actually kill/wait or just clean up the OOM state
2241 * This has to be called at the end of a page fault if the memcg OOM
2242 * handler was enabled.
2244 * Memcg supports userspace OOM handling where failed allocations must
2245 * sleep on a waitqueue until the userspace task resolves the
2246 * situation. Sleeping directly in the charge context with all kinds
2247 * of locks held is not a good idea, instead we remember an OOM state
2248 * in the task and mem_cgroup_oom_synchronize() has to be called at
2249 * the end of the page fault to complete the OOM handling.
2251 * Returns %true if an ongoing memcg OOM situation was detected and
2252 * completed, %false otherwise.
2254 bool mem_cgroup_oom_synchronize(bool handle)
2256 struct mem_cgroup *memcg = current->memcg_oom.memcg;
2257 struct oom_wait_info owait;
2260 /* OOM is global, do not handle */
2267 owait.memcg = memcg;
2268 owait.wait.flags = 0;
2269 owait.wait.func = memcg_oom_wake_function;
2270 owait.wait.private = current;
2271 INIT_LIST_HEAD(&owait.wait.task_list);
2273 prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE);
2274 mem_cgroup_mark_under_oom(memcg);
2276 locked = mem_cgroup_oom_trylock(memcg);
2279 mem_cgroup_oom_notify(memcg);
2281 if (locked && !memcg->oom_kill_disable) {
2282 mem_cgroup_unmark_under_oom(memcg);
2283 finish_wait(&memcg_oom_waitq, &owait.wait);
2284 mem_cgroup_out_of_memory(memcg, current->memcg_oom.gfp_mask,
2285 current->memcg_oom.order);
2288 mem_cgroup_unmark_under_oom(memcg);
2289 finish_wait(&memcg_oom_waitq, &owait.wait);
2293 mem_cgroup_oom_unlock(memcg);
2295 * There is no guarantee that an OOM-lock contender
2296 * sees the wakeups triggered by the OOM kill
2297 * uncharges. Wake any sleepers explicitely.
2299 memcg_oom_recover(memcg);
2302 current->memcg_oom.memcg = NULL;
2303 css_put(&memcg->css);
2308 * Currently used to update mapped file statistics, but the routine can be
2309 * generalized to update other statistics as well.
2311 * Notes: Race condition
2313 * We usually use page_cgroup_lock() for accessing page_cgroup member but
2314 * it tends to be costly. But considering some conditions, we doesn't need
2315 * to do so _always_.
2317 * Considering "charge", lock_page_cgroup() is not required because all
2318 * file-stat operations happen after a page is attached to radix-tree. There
2319 * are no race with "charge".
2321 * Considering "uncharge", we know that memcg doesn't clear pc->mem_cgroup
2322 * at "uncharge" intentionally. So, we always see valid pc->mem_cgroup even
2323 * if there are race with "uncharge". Statistics itself is properly handled
2326 * Considering "move", this is an only case we see a race. To make the race
2327 * small, we check mm->moving_account and detect there are possibility of race
2328 * If there is, we take a lock.
2331 void __mem_cgroup_begin_update_page_stat(struct page *page,
2332 bool *locked, unsigned long *flags)
2334 struct mem_cgroup *memcg;
2335 struct page_cgroup *pc;
2337 pc = lookup_page_cgroup(page);
2339 memcg = pc->mem_cgroup;
2340 if (unlikely(!memcg || !PageCgroupUsed(pc)))
2343 * If this memory cgroup is not under account moving, we don't
2344 * need to take move_lock_mem_cgroup(). Because we already hold
2345 * rcu_read_lock(), any calls to move_account will be delayed until
2346 * rcu_read_unlock() if mem_cgroup_stolen() == true.
2348 if (!mem_cgroup_stolen(memcg))
2351 move_lock_mem_cgroup(memcg, flags);
2352 if (memcg != pc->mem_cgroup || !PageCgroupUsed(pc)) {
2353 move_unlock_mem_cgroup(memcg, flags);
2359 void __mem_cgroup_end_update_page_stat(struct page *page, unsigned long *flags)
2361 struct page_cgroup *pc = lookup_page_cgroup(page);
2364 * It's guaranteed that pc->mem_cgroup never changes while
2365 * lock is held because a routine modifies pc->mem_cgroup
2366 * should take move_lock_mem_cgroup().
2368 move_unlock_mem_cgroup(pc->mem_cgroup, flags);
2371 void mem_cgroup_update_page_stat(struct page *page,
2372 enum mem_cgroup_stat_index idx, int val)
2374 struct mem_cgroup *memcg;
2375 struct page_cgroup *pc = lookup_page_cgroup(page);
2376 unsigned long uninitialized_var(flags);
2378 if (mem_cgroup_disabled())
2381 VM_BUG_ON(!rcu_read_lock_held());
2382 memcg = pc->mem_cgroup;
2383 if (unlikely(!memcg || !PageCgroupUsed(pc)))
2386 this_cpu_add(memcg->stat->count[idx], val);
2390 * size of first charge trial. "32" comes from vmscan.c's magic value.
2391 * TODO: maybe necessary to use big numbers in big irons.
2393 #define CHARGE_BATCH 32U
2394 struct memcg_stock_pcp {
2395 struct mem_cgroup *cached; /* this never be root cgroup */
2396 unsigned int nr_pages;
2397 struct work_struct work;
2398 unsigned long flags;
2399 #define FLUSHING_CACHED_CHARGE 0
2401 static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock);
2402 static DEFINE_MUTEX(percpu_charge_mutex);
2405 * consume_stock: Try to consume stocked charge on this cpu.
2406 * @memcg: memcg to consume from.
2407 * @nr_pages: how many pages to charge.
2409 * The charges will only happen if @memcg matches the current cpu's memcg
2410 * stock, and at least @nr_pages are available in that stock. Failure to
2411 * service an allocation will refill the stock.
2413 * returns true if successful, false otherwise.
2415 static bool consume_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2417 struct memcg_stock_pcp *stock;
2420 if (nr_pages > CHARGE_BATCH)
2423 stock = &get_cpu_var(memcg_stock);
2424 if (memcg == stock->cached && stock->nr_pages >= nr_pages)
2425 stock->nr_pages -= nr_pages;
2426 else /* need to call res_counter_charge */
2428 put_cpu_var(memcg_stock);
2433 * Returns stocks cached in percpu to res_counter and reset cached information.
2435 static void drain_stock(struct memcg_stock_pcp *stock)
2437 struct mem_cgroup *old = stock->cached;
2439 if (stock->nr_pages) {
2440 unsigned long bytes = stock->nr_pages * PAGE_SIZE;
2442 res_counter_uncharge(&old->res, bytes);
2443 if (do_swap_account)
2444 res_counter_uncharge(&old->memsw, bytes);
2445 stock->nr_pages = 0;
2447 stock->cached = NULL;
2451 * This must be called under preempt disabled or must be called by
2452 * a thread which is pinned to local cpu.
2454 static void drain_local_stock(struct work_struct *dummy)
2456 struct memcg_stock_pcp *stock = &__get_cpu_var(memcg_stock);
2458 clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags);
2461 static void __init memcg_stock_init(void)
2465 for_each_possible_cpu(cpu) {
2466 struct memcg_stock_pcp *stock =
2467 &per_cpu(memcg_stock, cpu);
2468 INIT_WORK(&stock->work, drain_local_stock);
2473 * Cache charges(val) which is from res_counter, to local per_cpu area.
2474 * This will be consumed by consume_stock() function, later.
2476 static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2478 struct memcg_stock_pcp *stock = &get_cpu_var(memcg_stock);
2480 if (stock->cached != memcg) { /* reset if necessary */
2482 stock->cached = memcg;
2484 stock->nr_pages += nr_pages;
2485 put_cpu_var(memcg_stock);
2489 * Drains all per-CPU charge caches for given root_memcg resp. subtree
2490 * of the hierarchy under it. sync flag says whether we should block
2491 * until the work is done.
2493 static void drain_all_stock(struct mem_cgroup *root_memcg, bool sync)
2497 /* Notify other cpus that system-wide "drain" is running */
2500 for_each_online_cpu(cpu) {
2501 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2502 struct mem_cgroup *memcg;
2504 memcg = stock->cached;
2505 if (!memcg || !stock->nr_pages)
2507 if (!mem_cgroup_same_or_subtree(root_memcg, memcg))
2509 if (!test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) {
2511 drain_local_stock(&stock->work);
2513 schedule_work_on(cpu, &stock->work);
2521 for_each_online_cpu(cpu) {
2522 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2523 if (test_bit(FLUSHING_CACHED_CHARGE, &stock->flags))
2524 flush_work(&stock->work);
2531 * Tries to drain stocked charges in other cpus. This function is asynchronous
2532 * and just put a work per cpu for draining localy on each cpu. Caller can
2533 * expects some charges will be back to res_counter later but cannot wait for
2536 static void drain_all_stock_async(struct mem_cgroup *root_memcg)
2539 * If someone calls draining, avoid adding more kworker runs.
2541 if (!mutex_trylock(&percpu_charge_mutex))
2543 drain_all_stock(root_memcg, false);
2544 mutex_unlock(&percpu_charge_mutex);
2547 /* This is a synchronous drain interface. */
2548 static void drain_all_stock_sync(struct mem_cgroup *root_memcg)
2550 /* called when force_empty is called */
2551 mutex_lock(&percpu_charge_mutex);
2552 drain_all_stock(root_memcg, true);
2553 mutex_unlock(&percpu_charge_mutex);
2557 * This function drains percpu counter value from DEAD cpu and
2558 * move it to local cpu. Note that this function can be preempted.
2560 static void mem_cgroup_drain_pcp_counter(struct mem_cgroup *memcg, int cpu)
2564 spin_lock(&memcg->pcp_counter_lock);
2565 for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) {
2566 long x = per_cpu(memcg->stat->count[i], cpu);
2568 per_cpu(memcg->stat->count[i], cpu) = 0;
2569 memcg->nocpu_base.count[i] += x;
2571 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) {
2572 unsigned long x = per_cpu(memcg->stat->events[i], cpu);
2574 per_cpu(memcg->stat->events[i], cpu) = 0;
2575 memcg->nocpu_base.events[i] += x;
2577 spin_unlock(&memcg->pcp_counter_lock);
2580 static int memcg_cpu_hotplug_callback(struct notifier_block *nb,
2581 unsigned long action,
2584 int cpu = (unsigned long)hcpu;
2585 struct memcg_stock_pcp *stock;
2586 struct mem_cgroup *iter;
2588 if (action == CPU_ONLINE)
2591 if (action != CPU_DEAD && action != CPU_DEAD_FROZEN)
2594 for_each_mem_cgroup(iter)
2595 mem_cgroup_drain_pcp_counter(iter, cpu);
2597 stock = &per_cpu(memcg_stock, cpu);
2603 /* See __mem_cgroup_try_charge() for details */
2605 CHARGE_OK, /* success */
2606 CHARGE_RETRY, /* need to retry but retry is not bad */
2607 CHARGE_NOMEM, /* we can't do more. return -ENOMEM */
2608 CHARGE_WOULDBLOCK, /* GFP_WAIT wasn't set and no enough res. */
2611 static int mem_cgroup_do_charge(struct mem_cgroup *memcg, gfp_t gfp_mask,
2612 unsigned int nr_pages, unsigned int min_pages,
2615 unsigned long csize = nr_pages * PAGE_SIZE;
2616 struct mem_cgroup *mem_over_limit;
2617 struct res_counter *fail_res;
2618 unsigned long flags = 0;
2621 ret = res_counter_charge(&memcg->res, csize, &fail_res);
2624 if (!do_swap_account)
2626 ret = res_counter_charge(&memcg->memsw, csize, &fail_res);
2630 res_counter_uncharge(&memcg->res, csize);
2631 mem_over_limit = mem_cgroup_from_res_counter(fail_res, memsw);
2632 flags |= MEM_CGROUP_RECLAIM_NOSWAP;
2634 mem_over_limit = mem_cgroup_from_res_counter(fail_res, res);
2636 * Never reclaim on behalf of optional batching, retry with a
2637 * single page instead.
2639 if (nr_pages > min_pages)
2640 return CHARGE_RETRY;
2642 if (!(gfp_mask & __GFP_WAIT))
2643 return CHARGE_WOULDBLOCK;
2645 if (gfp_mask & __GFP_NORETRY)
2646 return CHARGE_NOMEM;
2648 ret = mem_cgroup_reclaim(mem_over_limit, gfp_mask, flags);
2649 if (mem_cgroup_margin(mem_over_limit) >= nr_pages)
2650 return CHARGE_RETRY;
2652 * Even though the limit is exceeded at this point, reclaim
2653 * may have been able to free some pages. Retry the charge
2654 * before killing the task.
2656 * Only for regular pages, though: huge pages are rather
2657 * unlikely to succeed so close to the limit, and we fall back
2658 * to regular pages anyway in case of failure.
2660 if (nr_pages <= (1 << PAGE_ALLOC_COSTLY_ORDER) && ret)
2661 return CHARGE_RETRY;
2664 * At task move, charge accounts can be doubly counted. So, it's
2665 * better to wait until the end of task_move if something is going on.
2667 if (mem_cgroup_wait_acct_move(mem_over_limit))
2668 return CHARGE_RETRY;
2671 mem_cgroup_oom(mem_over_limit, gfp_mask, get_order(csize));
2673 return CHARGE_NOMEM;
2677 * __mem_cgroup_try_charge() does
2678 * 1. detect memcg to be charged against from passed *mm and *ptr,
2679 * 2. update res_counter
2680 * 3. call memory reclaim if necessary.
2682 * In some special case, if the task is fatal, fatal_signal_pending() or
2683 * has TIF_MEMDIE, this function returns -EINTR while writing root_mem_cgroup
2684 * to *ptr. There are two reasons for this. 1: fatal threads should quit as soon
2685 * as possible without any hazards. 2: all pages should have a valid
2686 * pc->mem_cgroup. If mm is NULL and the caller doesn't pass a valid memcg
2687 * pointer, that is treated as a charge to root_mem_cgroup.
2689 * So __mem_cgroup_try_charge() will return
2690 * 0 ... on success, filling *ptr with a valid memcg pointer.
2691 * -ENOMEM ... charge failure because of resource limits.
2692 * -EINTR ... if thread is fatal. *ptr is filled with root_mem_cgroup.
2694 * Unlike the exported interface, an "oom" parameter is added. if oom==true,
2695 * the oom-killer can be invoked.
2697 static int __mem_cgroup_try_charge(struct mm_struct *mm,
2699 unsigned int nr_pages,
2700 struct mem_cgroup **ptr,
2703 unsigned int batch = max(CHARGE_BATCH, nr_pages);
2704 int nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES;
2705 struct mem_cgroup *memcg = NULL;
2709 * Unlike gloval-vm's OOM-kill, we're not in memory shortage
2710 * in system level. So, allow to go ahead dying process in addition to
2713 if (unlikely(test_thread_flag(TIF_MEMDIE)
2714 || fatal_signal_pending(current)))
2717 if (unlikely(task_in_memcg_oom(current)))
2720 if (gfp_mask & __GFP_NOFAIL)
2724 * We always charge the cgroup the mm_struct belongs to.
2725 * The mm_struct's mem_cgroup changes on task migration if the
2726 * thread group leader migrates. It's possible that mm is not
2727 * set, if so charge the root memcg (happens for pagecache usage).
2730 *ptr = root_mem_cgroup;
2732 if (*ptr) { /* css should be a valid one */
2734 if (mem_cgroup_is_root(memcg))
2736 if (consume_stock(memcg, nr_pages))
2738 css_get(&memcg->css);
2740 struct task_struct *p;
2743 p = rcu_dereference(mm->owner);
2745 * Because we don't have task_lock(), "p" can exit.
2746 * In that case, "memcg" can point to root or p can be NULL with
2747 * race with swapoff. Then, we have small risk of mis-accouning.
2748 * But such kind of mis-account by race always happens because
2749 * we don't have cgroup_mutex(). It's overkill and we allo that
2751 * (*) swapoff at el will charge against mm-struct not against
2752 * task-struct. So, mm->owner can be NULL.
2754 memcg = mem_cgroup_from_task(p);
2756 memcg = root_mem_cgroup;
2757 if (mem_cgroup_is_root(memcg)) {
2761 if (consume_stock(memcg, nr_pages)) {
2763 * It seems dagerous to access memcg without css_get().
2764 * But considering how consume_stok works, it's not
2765 * necessary. If consume_stock success, some charges
2766 * from this memcg are cached on this cpu. So, we
2767 * don't need to call css_get()/css_tryget() before
2768 * calling consume_stock().
2773 /* after here, we may be blocked. we need to get refcnt */
2774 if (!css_tryget(&memcg->css)) {
2782 bool invoke_oom = oom && !nr_oom_retries;
2784 /* If killed, bypass charge */
2785 if (fatal_signal_pending(current)) {
2786 css_put(&memcg->css);
2790 ret = mem_cgroup_do_charge(memcg, gfp_mask, batch,
2791 nr_pages, invoke_oom);
2795 case CHARGE_RETRY: /* not in OOM situation but retry */
2797 css_put(&memcg->css);
2800 case CHARGE_WOULDBLOCK: /* !__GFP_WAIT */
2801 css_put(&memcg->css);
2803 case CHARGE_NOMEM: /* OOM routine works */
2804 if (!oom || invoke_oom) {
2805 css_put(&memcg->css);
2811 } while (ret != CHARGE_OK);
2813 if (batch > nr_pages)
2814 refill_stock(memcg, batch - nr_pages);
2815 css_put(&memcg->css);
2820 if (!(gfp_mask & __GFP_NOFAIL)) {
2825 *ptr = root_mem_cgroup;
2830 * Somemtimes we have to undo a charge we got by try_charge().
2831 * This function is for that and do uncharge, put css's refcnt.
2832 * gotten by try_charge().
2834 static void __mem_cgroup_cancel_charge(struct mem_cgroup *memcg,
2835 unsigned int nr_pages)
2837 if (!mem_cgroup_is_root(memcg)) {
2838 unsigned long bytes = nr_pages * PAGE_SIZE;
2840 res_counter_uncharge(&memcg->res, bytes);
2841 if (do_swap_account)
2842 res_counter_uncharge(&memcg->memsw, bytes);
2847 * Cancel chrages in this cgroup....doesn't propagate to parent cgroup.
2848 * This is useful when moving usage to parent cgroup.
2850 static void __mem_cgroup_cancel_local_charge(struct mem_cgroup *memcg,
2851 unsigned int nr_pages)
2853 unsigned long bytes = nr_pages * PAGE_SIZE;
2855 if (mem_cgroup_is_root(memcg))
2858 res_counter_uncharge_until(&memcg->res, memcg->res.parent, bytes);
2859 if (do_swap_account)
2860 res_counter_uncharge_until(&memcg->memsw,
2861 memcg->memsw.parent, bytes);
2865 * A helper function to get mem_cgroup from ID. must be called under
2866 * rcu_read_lock(). The caller is responsible for calling css_tryget if
2867 * the mem_cgroup is used for charging. (dropping refcnt from swap can be
2868 * called against removed memcg.)
2870 static struct mem_cgroup *mem_cgroup_lookup(unsigned short id)
2872 /* ID 0 is unused ID */
2875 return mem_cgroup_from_id(id);
2878 struct mem_cgroup *try_get_mem_cgroup_from_page(struct page *page)
2880 struct mem_cgroup *memcg = NULL;
2881 struct page_cgroup *pc;
2885 VM_BUG_ON_PAGE(!PageLocked(page), page);
2887 pc = lookup_page_cgroup(page);
2888 lock_page_cgroup(pc);
2889 if (PageCgroupUsed(pc)) {
2890 memcg = pc->mem_cgroup;
2891 if (memcg && !css_tryget(&memcg->css))
2893 } else if (PageSwapCache(page)) {
2894 ent.val = page_private(page);
2895 id = lookup_swap_cgroup_id(ent);
2897 memcg = mem_cgroup_lookup(id);
2898 if (memcg && !css_tryget(&memcg->css))
2902 unlock_page_cgroup(pc);
2906 static void __mem_cgroup_commit_charge(struct mem_cgroup *memcg,
2908 unsigned int nr_pages,
2909 enum charge_type ctype,
2912 struct page_cgroup *pc = lookup_page_cgroup(page);
2913 struct zone *uninitialized_var(zone);
2914 struct lruvec *lruvec;
2915 bool was_on_lru = false;
2918 lock_page_cgroup(pc);
2919 VM_BUG_ON_PAGE(PageCgroupUsed(pc), page);
2921 * we don't need page_cgroup_lock about tail pages, becase they are not
2922 * accessed by any other context at this point.
2926 * In some cases, SwapCache and FUSE(splice_buf->radixtree), the page
2927 * may already be on some other mem_cgroup's LRU. Take care of it.
2930 zone = page_zone(page);
2931 spin_lock_irq(&zone->lru_lock);
2932 if (PageLRU(page)) {
2933 lruvec = mem_cgroup_zone_lruvec(zone, pc->mem_cgroup);
2935 del_page_from_lru_list(page, lruvec, page_lru(page));
2940 pc->mem_cgroup = memcg;
2942 * We access a page_cgroup asynchronously without lock_page_cgroup().
2943 * Especially when a page_cgroup is taken from a page, pc->mem_cgroup
2944 * is accessed after testing USED bit. To make pc->mem_cgroup visible
2945 * before USED bit, we need memory barrier here.
2946 * See mem_cgroup_add_lru_list(), etc.
2949 SetPageCgroupUsed(pc);
2953 lruvec = mem_cgroup_zone_lruvec(zone, pc->mem_cgroup);
2954 VM_BUG_ON_PAGE(PageLRU(page), page);
2956 add_page_to_lru_list(page, lruvec, page_lru(page));
2958 spin_unlock_irq(&zone->lru_lock);
2961 if (ctype == MEM_CGROUP_CHARGE_TYPE_ANON)
2966 mem_cgroup_charge_statistics(memcg, page, anon, nr_pages);
2967 unlock_page_cgroup(pc);
2970 * "charge_statistics" updated event counter. Then, check it.
2971 * Insert ancestor (and ancestor's ancestors), to softlimit RB-tree.
2972 * if they exceeds softlimit.
2974 memcg_check_events(memcg, page);
2977 static DEFINE_MUTEX(set_limit_mutex);
2979 #ifdef CONFIG_MEMCG_KMEM
2980 static DEFINE_MUTEX(activate_kmem_mutex);
2982 static inline bool memcg_can_account_kmem(struct mem_cgroup *memcg)
2984 return !mem_cgroup_disabled() && !mem_cgroup_is_root(memcg) &&
2985 memcg_kmem_is_active(memcg);
2989 * This is a bit cumbersome, but it is rarely used and avoids a backpointer
2990 * in the memcg_cache_params struct.
2992 static struct kmem_cache *memcg_params_to_cache(struct memcg_cache_params *p)
2994 struct kmem_cache *cachep;
2996 VM_BUG_ON(p->is_root_cache);
2997 cachep = p->root_cache;
2998 return cache_from_memcg_idx(cachep, memcg_cache_id(p->memcg));
3001 #ifdef CONFIG_SLABINFO
3002 static int mem_cgroup_slabinfo_read(struct seq_file *m, void *v)
3004 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
3005 struct memcg_cache_params *params;
3007 if (!memcg_can_account_kmem(memcg))
3010 print_slabinfo_header(m);
3012 mutex_lock(&memcg->slab_caches_mutex);
3013 list_for_each_entry(params, &memcg->memcg_slab_caches, list)
3014 cache_show(memcg_params_to_cache(params), m);
3015 mutex_unlock(&memcg->slab_caches_mutex);
3021 static int memcg_charge_kmem(struct mem_cgroup *memcg, gfp_t gfp, u64 size)
3023 struct res_counter *fail_res;
3024 struct mem_cgroup *_memcg;
3027 ret = res_counter_charge(&memcg->kmem, size, &fail_res);
3032 ret = __mem_cgroup_try_charge(NULL, gfp, size >> PAGE_SHIFT,
3033 &_memcg, oom_gfp_allowed(gfp));
3035 if (ret == -EINTR) {
3037 * __mem_cgroup_try_charge() chosed to bypass to root due to
3038 * OOM kill or fatal signal. Since our only options are to
3039 * either fail the allocation or charge it to this cgroup, do
3040 * it as a temporary condition. But we can't fail. From a
3041 * kmem/slab perspective, the cache has already been selected,
3042 * by mem_cgroup_kmem_get_cache(), so it is too late to change
3045 * This condition will only trigger if the task entered
3046 * memcg_charge_kmem in a sane state, but was OOM-killed during
3047 * __mem_cgroup_try_charge() above. Tasks that were already
3048 * dying when the allocation triggers should have been already
3049 * directed to the root cgroup in memcontrol.h
3051 res_counter_charge_nofail(&memcg->res, size, &fail_res);
3052 if (do_swap_account)
3053 res_counter_charge_nofail(&memcg->memsw, size,
3057 res_counter_uncharge(&memcg->kmem, size);
3062 static void memcg_uncharge_kmem(struct mem_cgroup *memcg, u64 size)
3064 res_counter_uncharge(&memcg->res, size);
3065 if (do_swap_account)
3066 res_counter_uncharge(&memcg->memsw, size);
3069 if (res_counter_uncharge(&memcg->kmem, size))
3073 * Releases a reference taken in kmem_cgroup_css_offline in case
3074 * this last uncharge is racing with the offlining code or it is
3075 * outliving the memcg existence.
3077 * The memory barrier imposed by test&clear is paired with the
3078 * explicit one in memcg_kmem_mark_dead().
3080 if (memcg_kmem_test_and_clear_dead(memcg))
3081 css_put(&memcg->css);
3085 * helper for acessing a memcg's index. It will be used as an index in the
3086 * child cache array in kmem_cache, and also to derive its name. This function
3087 * will return -1 when this is not a kmem-limited memcg.
3089 int memcg_cache_id(struct mem_cgroup *memcg)
3091 return memcg ? memcg->kmemcg_id : -1;
3094 static size_t memcg_caches_array_size(int num_groups)
3097 if (num_groups <= 0)
3100 size = 2 * num_groups;
3101 if (size < MEMCG_CACHES_MIN_SIZE)
3102 size = MEMCG_CACHES_MIN_SIZE;
3103 else if (size > MEMCG_CACHES_MAX_SIZE)
3104 size = MEMCG_CACHES_MAX_SIZE;
3110 * We should update the current array size iff all caches updates succeed. This
3111 * can only be done from the slab side. The slab mutex needs to be held when
3114 void memcg_update_array_size(int num)
3116 if (num > memcg_limited_groups_array_size)
3117 memcg_limited_groups_array_size = memcg_caches_array_size(num);
3120 static void kmem_cache_destroy_work_func(struct work_struct *w);
3122 int memcg_update_cache_size(struct kmem_cache *s, int num_groups)
3124 struct memcg_cache_params *cur_params = s->memcg_params;
3126 VM_BUG_ON(!is_root_cache(s));
3128 if (num_groups > memcg_limited_groups_array_size) {
3130 struct memcg_cache_params *new_params;
3131 ssize_t size = memcg_caches_array_size(num_groups);
3133 size *= sizeof(void *);
3134 size += offsetof(struct memcg_cache_params, memcg_caches);
3136 new_params = kzalloc(size, GFP_KERNEL);
3140 new_params->is_root_cache = true;
3143 * There is the chance it will be bigger than
3144 * memcg_limited_groups_array_size, if we failed an allocation
3145 * in a cache, in which case all caches updated before it, will
3146 * have a bigger array.
3148 * But if that is the case, the data after
3149 * memcg_limited_groups_array_size is certainly unused
3151 for (i = 0; i < memcg_limited_groups_array_size; i++) {
3152 if (!cur_params->memcg_caches[i])
3154 new_params->memcg_caches[i] =
3155 cur_params->memcg_caches[i];
3159 * Ideally, we would wait until all caches succeed, and only
3160 * then free the old one. But this is not worth the extra
3161 * pointer per-cache we'd have to have for this.
3163 * It is not a big deal if some caches are left with a size
3164 * bigger than the others. And all updates will reset this
3167 rcu_assign_pointer(s->memcg_params, new_params);
3169 kfree_rcu(cur_params, rcu_head);
3174 int memcg_alloc_cache_params(struct mem_cgroup *memcg, struct kmem_cache *s,
3175 struct kmem_cache *root_cache)
3179 if (!memcg_kmem_enabled())
3183 size = offsetof(struct memcg_cache_params, memcg_caches);
3184 size += memcg_limited_groups_array_size * sizeof(void *);
3186 size = sizeof(struct memcg_cache_params);
3188 s->memcg_params = kzalloc(size, GFP_KERNEL);
3189 if (!s->memcg_params)
3193 s->memcg_params->memcg = memcg;
3194 s->memcg_params->root_cache = root_cache;
3195 INIT_WORK(&s->memcg_params->destroy,
3196 kmem_cache_destroy_work_func);
3198 s->memcg_params->is_root_cache = true;
3203 void memcg_free_cache_params(struct kmem_cache *s)
3205 kfree(s->memcg_params);
3208 void memcg_register_cache(struct kmem_cache *s)
3210 struct kmem_cache *root;
3211 struct mem_cgroup *memcg;
3214 if (is_root_cache(s))
3218 * Holding the slab_mutex assures nobody will touch the memcg_caches
3219 * array while we are modifying it.
3221 lockdep_assert_held(&slab_mutex);
3223 root = s->memcg_params->root_cache;
3224 memcg = s->memcg_params->memcg;
3225 id = memcg_cache_id(memcg);
3227 css_get(&memcg->css);
3231 * Since readers won't lock (see cache_from_memcg_idx()), we need a
3232 * barrier here to ensure nobody will see the kmem_cache partially
3238 * Initialize the pointer to this cache in its parent's memcg_params
3239 * before adding it to the memcg_slab_caches list, otherwise we can
3240 * fail to convert memcg_params_to_cache() while traversing the list.
3242 VM_BUG_ON(root->memcg_params->memcg_caches[id]);
3243 root->memcg_params->memcg_caches[id] = s;
3245 mutex_lock(&memcg->slab_caches_mutex);
3246 list_add(&s->memcg_params->list, &memcg->memcg_slab_caches);
3247 mutex_unlock(&memcg->slab_caches_mutex);
3250 void memcg_unregister_cache(struct kmem_cache *s)
3252 struct kmem_cache *root;
3253 struct mem_cgroup *memcg;
3256 if (is_root_cache(s))
3260 * Holding the slab_mutex assures nobody will touch the memcg_caches
3261 * array while we are modifying it.
3263 lockdep_assert_held(&slab_mutex);
3265 root = s->memcg_params->root_cache;
3266 memcg = s->memcg_params->memcg;
3267 id = memcg_cache_id(memcg);
3269 mutex_lock(&memcg->slab_caches_mutex);
3270 list_del(&s->memcg_params->list);
3271 mutex_unlock(&memcg->slab_caches_mutex);
3274 * Clear the pointer to this cache in its parent's memcg_params only
3275 * after removing it from the memcg_slab_caches list, otherwise we can
3276 * fail to convert memcg_params_to_cache() while traversing the list.
3278 VM_BUG_ON(!root->memcg_params->memcg_caches[id]);
3279 root->memcg_params->memcg_caches[id] = NULL;
3281 css_put(&memcg->css);
3285 * During the creation a new cache, we need to disable our accounting mechanism
3286 * altogether. This is true even if we are not creating, but rather just
3287 * enqueing new caches to be created.
3289 * This is because that process will trigger allocations; some visible, like
3290 * explicit kmallocs to auxiliary data structures, name strings and internal
3291 * cache structures; some well concealed, like INIT_WORK() that can allocate
3292 * objects during debug.
3294 * If any allocation happens during memcg_kmem_get_cache, we will recurse back
3295 * to it. This may not be a bounded recursion: since the first cache creation
3296 * failed to complete (waiting on the allocation), we'll just try to create the
3297 * cache again, failing at the same point.
3299 * memcg_kmem_get_cache is prepared to abort after seeing a positive count of
3300 * memcg_kmem_skip_account. So we enclose anything that might allocate memory
3301 * inside the following two functions.
3303 static inline void memcg_stop_kmem_account(void)
3305 VM_BUG_ON(!current->mm);
3306 current->memcg_kmem_skip_account++;
3309 static inline void memcg_resume_kmem_account(void)
3311 VM_BUG_ON(!current->mm);
3312 current->memcg_kmem_skip_account--;
3315 static void kmem_cache_destroy_work_func(struct work_struct *w)
3317 struct kmem_cache *cachep;
3318 struct memcg_cache_params *p;
3320 p = container_of(w, struct memcg_cache_params, destroy);
3322 cachep = memcg_params_to_cache(p);
3325 * If we get down to 0 after shrink, we could delete right away.
3326 * However, memcg_release_pages() already puts us back in the workqueue
3327 * in that case. If we proceed deleting, we'll get a dangling
3328 * reference, and removing the object from the workqueue in that case
3329 * is unnecessary complication. We are not a fast path.
3331 * Note that this case is fundamentally different from racing with
3332 * shrink_slab(): if memcg_cgroup_destroy_cache() is called in
3333 * kmem_cache_shrink, not only we would be reinserting a dead cache
3334 * into the queue, but doing so from inside the worker racing to
3337 * So if we aren't down to zero, we'll just schedule a worker and try
3340 if (atomic_read(&cachep->memcg_params->nr_pages) != 0) {
3341 kmem_cache_shrink(cachep);
3342 if (atomic_read(&cachep->memcg_params->nr_pages) == 0)
3345 kmem_cache_destroy(cachep);
3348 void mem_cgroup_destroy_cache(struct kmem_cache *cachep)
3350 if (!cachep->memcg_params->dead)
3354 * There are many ways in which we can get here.
3356 * We can get to a memory-pressure situation while the delayed work is
3357 * still pending to run. The vmscan shrinkers can then release all
3358 * cache memory and get us to destruction. If this is the case, we'll
3359 * be executed twice, which is a bug (the second time will execute over
3360 * bogus data). In this case, cancelling the work should be fine.
3362 * But we can also get here from the worker itself, if
3363 * kmem_cache_shrink is enough to shake all the remaining objects and
3364 * get the page count to 0. In this case, we'll deadlock if we try to
3365 * cancel the work (the worker runs with an internal lock held, which
3366 * is the same lock we would hold for cancel_work_sync().)
3368 * Since we can't possibly know who got us here, just refrain from
3369 * running if there is already work pending
3371 if (work_pending(&cachep->memcg_params->destroy))
3374 * We have to defer the actual destroying to a workqueue, because
3375 * we might currently be in a context that cannot sleep.
3377 schedule_work(&cachep->memcg_params->destroy);
3380 static struct kmem_cache *memcg_create_kmem_cache(struct mem_cgroup *memcg,
3381 struct kmem_cache *s)
3383 struct kmem_cache *new;
3384 static char *tmp_name = NULL;
3385 static DEFINE_MUTEX(mutex); /* protects tmp_name */
3387 BUG_ON(!memcg_can_account_kmem(memcg));
3391 * kmem_cache_create_memcg duplicates the given name and
3392 * cgroup_name for this name requires RCU context.
3393 * This static temporary buffer is used to prevent from
3394 * pointless shortliving allocation.
3397 tmp_name = kmalloc(PATH_MAX, GFP_KERNEL);
3403 snprintf(tmp_name, PATH_MAX, "%s(%d:%s)", s->name,
3404 memcg_cache_id(memcg), cgroup_name(memcg->css.cgroup));
3407 new = kmem_cache_create_memcg(memcg, tmp_name, s->object_size, s->align,
3408 (s->flags & ~SLAB_PANIC), s->ctor, s);
3411 new->allocflags |= __GFP_KMEMCG;
3415 mutex_unlock(&mutex);
3419 void kmem_cache_destroy_memcg_children(struct kmem_cache *s)
3421 struct kmem_cache *c;
3424 if (!s->memcg_params)
3426 if (!s->memcg_params->is_root_cache)
3430 * If the cache is being destroyed, we trust that there is no one else
3431 * requesting objects from it. Even if there are, the sanity checks in
3432 * kmem_cache_destroy should caught this ill-case.
3434 * Still, we don't want anyone else freeing memcg_caches under our
3435 * noses, which can happen if a new memcg comes to life. As usual,
3436 * we'll take the activate_kmem_mutex to protect ourselves against
3439 mutex_lock(&activate_kmem_mutex);
3440 for_each_memcg_cache_index(i) {
3441 c = cache_from_memcg_idx(s, i);
3446 * We will now manually delete the caches, so to avoid races
3447 * we need to cancel all pending destruction workers and
3448 * proceed with destruction ourselves.
3450 * kmem_cache_destroy() will call kmem_cache_shrink internally,
3451 * and that could spawn the workers again: it is likely that
3452 * the cache still have active pages until this very moment.
3453 * This would lead us back to mem_cgroup_destroy_cache.
3455 * But that will not execute at all if the "dead" flag is not
3456 * set, so flip it down to guarantee we are in control.
3458 c->memcg_params->dead = false;
3459 cancel_work_sync(&c->memcg_params->destroy);
3460 kmem_cache_destroy(c);
3462 mutex_unlock(&activate_kmem_mutex);
3465 struct create_work {
3466 struct mem_cgroup *memcg;
3467 struct kmem_cache *cachep;
3468 struct work_struct work;
3471 static void mem_cgroup_destroy_all_caches(struct mem_cgroup *memcg)
3473 struct kmem_cache *cachep;
3474 struct memcg_cache_params *params;
3476 if (!memcg_kmem_is_active(memcg))
3479 mutex_lock(&memcg->slab_caches_mutex);
3480 list_for_each_entry(params, &memcg->memcg_slab_caches, list) {
3481 cachep = memcg_params_to_cache(params);
3482 cachep->memcg_params->dead = true;
3483 schedule_work(&cachep->memcg_params->destroy);
3485 mutex_unlock(&memcg->slab_caches_mutex);
3488 static void memcg_create_cache_work_func(struct work_struct *w)
3490 struct create_work *cw;
3492 cw = container_of(w, struct create_work, work);
3493 memcg_create_kmem_cache(cw->memcg, cw->cachep);
3494 css_put(&cw->memcg->css);
3499 * Enqueue the creation of a per-memcg kmem_cache.
3501 static void __memcg_create_cache_enqueue(struct mem_cgroup *memcg,
3502 struct kmem_cache *cachep)
3504 struct create_work *cw;
3506 cw = kmalloc(sizeof(struct create_work), GFP_NOWAIT);
3508 css_put(&memcg->css);
3513 cw->cachep = cachep;
3515 INIT_WORK(&cw->work, memcg_create_cache_work_func);
3516 schedule_work(&cw->work);
3519 static void memcg_create_cache_enqueue(struct mem_cgroup *memcg,
3520 struct kmem_cache *cachep)
3523 * We need to stop accounting when we kmalloc, because if the
3524 * corresponding kmalloc cache is not yet created, the first allocation
3525 * in __memcg_create_cache_enqueue will recurse.
3527 * However, it is better to enclose the whole function. Depending on
3528 * the debugging options enabled, INIT_WORK(), for instance, can
3529 * trigger an allocation. This too, will make us recurse. Because at
3530 * this point we can't allow ourselves back into memcg_kmem_get_cache,
3531 * the safest choice is to do it like this, wrapping the whole function.
3533 memcg_stop_kmem_account();
3534 __memcg_create_cache_enqueue(memcg, cachep);
3535 memcg_resume_kmem_account();
3538 * Return the kmem_cache we're supposed to use for a slab allocation.
3539 * We try to use the current memcg's version of the cache.
3541 * If the cache does not exist yet, if we are the first user of it,
3542 * we either create it immediately, if possible, or create it asynchronously
3544 * In the latter case, we will let the current allocation go through with
3545 * the original cache.
3547 * Can't be called in interrupt context or from kernel threads.
3548 * This function needs to be called with rcu_read_lock() held.
3550 struct kmem_cache *__memcg_kmem_get_cache(struct kmem_cache *cachep,
3553 struct mem_cgroup *memcg;
3554 struct kmem_cache *memcg_cachep;
3556 VM_BUG_ON(!cachep->memcg_params);
3557 VM_BUG_ON(!cachep->memcg_params->is_root_cache);
3559 if (!current->mm || current->memcg_kmem_skip_account)
3563 memcg = mem_cgroup_from_task(rcu_dereference(current->mm->owner));
3565 if (!memcg_can_account_kmem(memcg))
3568 memcg_cachep = cache_from_memcg_idx(cachep, memcg_cache_id(memcg));
3569 if (likely(memcg_cachep)) {
3570 cachep = memcg_cachep;
3574 /* The corresponding put will be done in the workqueue. */
3575 if (!css_tryget(&memcg->css))
3580 * If we are in a safe context (can wait, and not in interrupt
3581 * context), we could be be predictable and return right away.
3582 * This would guarantee that the allocation being performed
3583 * already belongs in the new cache.
3585 * However, there are some clashes that can arrive from locking.
3586 * For instance, because we acquire the slab_mutex while doing
3587 * kmem_cache_dup, this means no further allocation could happen
3588 * with the slab_mutex held.
3590 * Also, because cache creation issue get_online_cpus(), this
3591 * creates a lock chain: memcg_slab_mutex -> cpu_hotplug_mutex,
3592 * that ends up reversed during cpu hotplug. (cpuset allocates
3593 * a bunch of GFP_KERNEL memory during cpuup). Due to all that,
3594 * better to defer everything.
3596 memcg_create_cache_enqueue(memcg, cachep);
3602 EXPORT_SYMBOL(__memcg_kmem_get_cache);
3605 * We need to verify if the allocation against current->mm->owner's memcg is
3606 * possible for the given order. But the page is not allocated yet, so we'll
3607 * need a further commit step to do the final arrangements.
3609 * It is possible for the task to switch cgroups in this mean time, so at
3610 * commit time, we can't rely on task conversion any longer. We'll then use
3611 * the handle argument to return to the caller which cgroup we should commit
3612 * against. We could also return the memcg directly and avoid the pointer
3613 * passing, but a boolean return value gives better semantics considering
3614 * the compiled-out case as well.
3616 * Returning true means the allocation is possible.
3619 __memcg_kmem_newpage_charge(gfp_t gfp, struct mem_cgroup **_memcg, int order)
3621 struct mem_cgroup *memcg;
3627 * Disabling accounting is only relevant for some specific memcg
3628 * internal allocations. Therefore we would initially not have such
3629 * check here, since direct calls to the page allocator that are marked
3630 * with GFP_KMEMCG only happen outside memcg core. We are mostly
3631 * concerned with cache allocations, and by having this test at
3632 * memcg_kmem_get_cache, we are already able to relay the allocation to
3633 * the root cache and bypass the memcg cache altogether.
3635 * There is one exception, though: the SLUB allocator does not create
3636 * large order caches, but rather service large kmallocs directly from
3637 * the page allocator. Therefore, the following sequence when backed by
3638 * the SLUB allocator:
3640 * memcg_stop_kmem_account();
3641 * kmalloc(<large_number>)
3642 * memcg_resume_kmem_account();
3644 * would effectively ignore the fact that we should skip accounting,
3645 * since it will drive us directly to this function without passing
3646 * through the cache selector memcg_kmem_get_cache. Such large
3647 * allocations are extremely rare but can happen, for instance, for the
3648 * cache arrays. We bring this test here.
3650 if (!current->mm || current->memcg_kmem_skip_account)
3653 memcg = try_get_mem_cgroup_from_mm(current->mm);
3656 * very rare case described in mem_cgroup_from_task. Unfortunately there
3657 * isn't much we can do without complicating this too much, and it would
3658 * be gfp-dependent anyway. Just let it go
3660 if (unlikely(!memcg))
3663 if (!memcg_can_account_kmem(memcg)) {
3664 css_put(&memcg->css);
3668 ret = memcg_charge_kmem(memcg, gfp, PAGE_SIZE << order);
3672 css_put(&memcg->css);
3676 void __memcg_kmem_commit_charge(struct page *page, struct mem_cgroup *memcg,
3679 struct page_cgroup *pc;
3681 VM_BUG_ON(mem_cgroup_is_root(memcg));
3683 /* The page allocation failed. Revert */
3685 memcg_uncharge_kmem(memcg, PAGE_SIZE << order);
3689 pc = lookup_page_cgroup(page);
3690 lock_page_cgroup(pc);
3691 pc->mem_cgroup = memcg;
3692 SetPageCgroupUsed(pc);
3693 unlock_page_cgroup(pc);
3696 void __memcg_kmem_uncharge_pages(struct page *page, int order)
3698 struct mem_cgroup *memcg = NULL;
3699 struct page_cgroup *pc;
3702 pc = lookup_page_cgroup(page);
3704 * Fast unlocked return. Theoretically might have changed, have to
3705 * check again after locking.
3707 if (!PageCgroupUsed(pc))
3710 lock_page_cgroup(pc);
3711 if (PageCgroupUsed(pc)) {
3712 memcg = pc->mem_cgroup;
3713 ClearPageCgroupUsed(pc);
3715 unlock_page_cgroup(pc);
3718 * We trust that only if there is a memcg associated with the page, it
3719 * is a valid allocation
3724 VM_BUG_ON_PAGE(mem_cgroup_is_root(memcg), page);
3725 memcg_uncharge_kmem(memcg, PAGE_SIZE << order);
3728 static inline void mem_cgroup_destroy_all_caches(struct mem_cgroup *memcg)
3731 #endif /* CONFIG_MEMCG_KMEM */
3733 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
3735 #define PCGF_NOCOPY_AT_SPLIT (1 << PCG_LOCK | 1 << PCG_MIGRATION)
3737 * Because tail pages are not marked as "used", set it. We're under
3738 * zone->lru_lock, 'splitting on pmd' and compound_lock.
3739 * charge/uncharge will be never happen and move_account() is done under
3740 * compound_lock(), so we don't have to take care of races.
3742 void mem_cgroup_split_huge_fixup(struct page *head)
3744 struct page_cgroup *head_pc = lookup_page_cgroup(head);
3745 struct page_cgroup *pc;
3746 struct mem_cgroup *memcg;
3749 if (mem_cgroup_disabled())
3752 memcg = head_pc->mem_cgroup;
3753 for (i = 1; i < HPAGE_PMD_NR; i++) {
3755 pc->mem_cgroup = memcg;
3756 smp_wmb();/* see __commit_charge() */
3757 pc->flags = head_pc->flags & ~PCGF_NOCOPY_AT_SPLIT;
3759 __this_cpu_sub(memcg->stat->count[MEM_CGROUP_STAT_RSS_HUGE],
3762 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
3765 void mem_cgroup_move_account_page_stat(struct mem_cgroup *from,
3766 struct mem_cgroup *to,
3767 unsigned int nr_pages,
3768 enum mem_cgroup_stat_index idx)
3770 /* Update stat data for mem_cgroup */
3772 __this_cpu_sub(from->stat->count[idx], nr_pages);
3773 __this_cpu_add(to->stat->count[idx], nr_pages);
3778 * mem_cgroup_move_account - move account of the page
3780 * @nr_pages: number of regular pages (>1 for huge pages)
3781 * @pc: page_cgroup of the page.
3782 * @from: mem_cgroup which the page is moved from.
3783 * @to: mem_cgroup which the page is moved to. @from != @to.
3785 * The caller must confirm following.
3786 * - page is not on LRU (isolate_page() is useful.)
3787 * - compound_lock is held when nr_pages > 1
3789 * This function doesn't do "charge" to new cgroup and doesn't do "uncharge"
3792 static int mem_cgroup_move_account(struct page *page,
3793 unsigned int nr_pages,
3794 struct page_cgroup *pc,
3795 struct mem_cgroup *from,
3796 struct mem_cgroup *to)
3798 unsigned long flags;
3800 bool anon = PageAnon(page);
3802 VM_BUG_ON(from == to);
3803 VM_BUG_ON_PAGE(PageLRU(page), page);
3805 * The page is isolated from LRU. So, collapse function
3806 * will not handle this page. But page splitting can happen.
3807 * Do this check under compound_page_lock(). The caller should
3811 if (nr_pages > 1 && !PageTransHuge(page))
3814 lock_page_cgroup(pc);
3817 if (!PageCgroupUsed(pc) || pc->mem_cgroup != from)
3820 move_lock_mem_cgroup(from, &flags);
3822 if (!anon && page_mapped(page))
3823 mem_cgroup_move_account_page_stat(from, to, nr_pages,
3824 MEM_CGROUP_STAT_FILE_MAPPED);
3826 if (PageWriteback(page))
3827 mem_cgroup_move_account_page_stat(from, to, nr_pages,
3828 MEM_CGROUP_STAT_WRITEBACK);
3830 mem_cgroup_charge_statistics(from, page, anon, -nr_pages);
3832 /* caller should have done css_get */
3833 pc->mem_cgroup = to;
3834 mem_cgroup_charge_statistics(to, page, anon, nr_pages);
3835 move_unlock_mem_cgroup(from, &flags);
3838 unlock_page_cgroup(pc);
3842 memcg_check_events(to, page);
3843 memcg_check_events(from, page);
3849 * mem_cgroup_move_parent - moves page to the parent group
3850 * @page: the page to move
3851 * @pc: page_cgroup of the page
3852 * @child: page's cgroup
3854 * move charges to its parent or the root cgroup if the group has no
3855 * parent (aka use_hierarchy==0).
3856 * Although this might fail (get_page_unless_zero, isolate_lru_page or
3857 * mem_cgroup_move_account fails) the failure is always temporary and
3858 * it signals a race with a page removal/uncharge or migration. In the
3859 * first case the page is on the way out and it will vanish from the LRU
3860 * on the next attempt and the call should be retried later.
3861 * Isolation from the LRU fails only if page has been isolated from
3862 * the LRU since we looked at it and that usually means either global
3863 * reclaim or migration going on. The page will either get back to the
3865 * Finaly mem_cgroup_move_account fails only if the page got uncharged
3866 * (!PageCgroupUsed) or moved to a different group. The page will
3867 * disappear in the next attempt.
3869 static int mem_cgroup_move_parent(struct page *page,
3870 struct page_cgroup *pc,
3871 struct mem_cgroup *child)
3873 struct mem_cgroup *parent;
3874 unsigned int nr_pages;
3875 unsigned long uninitialized_var(flags);
3878 VM_BUG_ON(mem_cgroup_is_root(child));
3881 if (!get_page_unless_zero(page))
3883 if (isolate_lru_page(page))
3886 nr_pages = hpage_nr_pages(page);
3888 parent = parent_mem_cgroup(child);
3890 * If no parent, move charges to root cgroup.
3893 parent = root_mem_cgroup;
3896 VM_BUG_ON_PAGE(!PageTransHuge(page), page);
3897 flags = compound_lock_irqsave(page);
3900 ret = mem_cgroup_move_account(page, nr_pages,
3903 __mem_cgroup_cancel_local_charge(child, nr_pages);
3906 compound_unlock_irqrestore(page, flags);
3907 putback_lru_page(page);
3915 * Charge the memory controller for page usage.
3917 * 0 if the charge was successful
3918 * < 0 if the cgroup is over its limit
3920 static int mem_cgroup_charge_common(struct page *page, struct mm_struct *mm,
3921 gfp_t gfp_mask, enum charge_type ctype)
3923 struct mem_cgroup *memcg = NULL;
3924 unsigned int nr_pages = 1;
3928 if (PageTransHuge(page)) {
3929 nr_pages <<= compound_order(page);
3930 VM_BUG_ON_PAGE(!PageTransHuge(page), page);
3932 * Never OOM-kill a process for a huge page. The
3933 * fault handler will fall back to regular pages.
3938 ret = __mem_cgroup_try_charge(mm, gfp_mask, nr_pages, &memcg, oom);
3941 __mem_cgroup_commit_charge(memcg, page, nr_pages, ctype, false);
3945 int mem_cgroup_newpage_charge(struct page *page,
3946 struct mm_struct *mm, gfp_t gfp_mask)
3948 if (mem_cgroup_disabled())
3950 VM_BUG_ON_PAGE(page_mapped(page), page);
3951 VM_BUG_ON_PAGE(page->mapping && !PageAnon(page), page);
3953 return mem_cgroup_charge_common(page, mm, gfp_mask,
3954 MEM_CGROUP_CHARGE_TYPE_ANON);
3958 * While swap-in, try_charge -> commit or cancel, the page is locked.
3959 * And when try_charge() successfully returns, one refcnt to memcg without
3960 * struct page_cgroup is acquired. This refcnt will be consumed by
3961 * "commit()" or removed by "cancel()"
3963 static int __mem_cgroup_try_charge_swapin(struct mm_struct *mm,
3966 struct mem_cgroup **memcgp)
3968 struct mem_cgroup *memcg;
3969 struct page_cgroup *pc;
3972 pc = lookup_page_cgroup(page);
3974 * Every swap fault against a single page tries to charge the
3975 * page, bail as early as possible. shmem_unuse() encounters
3976 * already charged pages, too. The USED bit is protected by
3977 * the page lock, which serializes swap cache removal, which
3978 * in turn serializes uncharging.
3980 if (PageCgroupUsed(pc))
3982 if (!do_swap_account)
3984 memcg = try_get_mem_cgroup_from_page(page);
3988 ret = __mem_cgroup_try_charge(NULL, mask, 1, memcgp, true);
3989 css_put(&memcg->css);
3994 ret = __mem_cgroup_try_charge(mm, mask, 1, memcgp, true);
4000 int mem_cgroup_try_charge_swapin(struct mm_struct *mm, struct page *page,
4001 gfp_t gfp_mask, struct mem_cgroup **memcgp)
4004 if (mem_cgroup_disabled())
4007 * A racing thread's fault, or swapoff, may have already
4008 * updated the pte, and even removed page from swap cache: in
4009 * those cases unuse_pte()'s pte_same() test will fail; but
4010 * there's also a KSM case which does need to charge the page.
4012 if (!PageSwapCache(page)) {
4015 ret = __mem_cgroup_try_charge(mm, gfp_mask, 1, memcgp, true);
4020 return __mem_cgroup_try_charge_swapin(mm, page, gfp_mask, memcgp);
4023 void mem_cgroup_cancel_charge_swapin(struct mem_cgroup *memcg)
4025 if (mem_cgroup_disabled())
4029 __mem_cgroup_cancel_charge(memcg, 1);
4033 __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *memcg,
4034 enum charge_type ctype)
4036 if (mem_cgroup_disabled())
4041 __mem_cgroup_commit_charge(memcg, page, 1, ctype, true);
4043 * Now swap is on-memory. This means this page may be
4044 * counted both as mem and swap....double count.
4045 * Fix it by uncharging from memsw. Basically, this SwapCache is stable
4046 * under lock_page(). But in do_swap_page()::memory.c, reuse_swap_page()
4047 * may call delete_from_swap_cache() before reach here.
4049 if (do_swap_account && PageSwapCache(page)) {
4050 swp_entry_t ent = {.val = page_private(page)};
4051 mem_cgroup_uncharge_swap(ent);
4055 void mem_cgroup_commit_charge_swapin(struct page *page,
4056 struct mem_cgroup *memcg)
4058 __mem_cgroup_commit_charge_swapin(page, memcg,
4059 MEM_CGROUP_CHARGE_TYPE_ANON);
4062 int mem_cgroup_cache_charge(struct page *page, struct mm_struct *mm,
4065 struct mem_cgroup *memcg = NULL;
4066 enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE;
4069 if (mem_cgroup_disabled())
4071 if (PageCompound(page))
4074 if (!PageSwapCache(page))
4075 ret = mem_cgroup_charge_common(page, mm, gfp_mask, type);
4076 else { /* page is swapcache/shmem */
4077 ret = __mem_cgroup_try_charge_swapin(mm, page,
4080 __mem_cgroup_commit_charge_swapin(page, memcg, type);
4085 static void mem_cgroup_do_uncharge(struct mem_cgroup *memcg,
4086 unsigned int nr_pages,
4087 const enum charge_type ctype)
4089 struct memcg_batch_info *batch = NULL;
4090 bool uncharge_memsw = true;
4092 /* If swapout, usage of swap doesn't decrease */
4093 if (!do_swap_account || ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT)
4094 uncharge_memsw = false;
4096 batch = ¤t->memcg_batch;
4098 * In usual, we do css_get() when we remember memcg pointer.
4099 * But in this case, we keep res->usage until end of a series of
4100 * uncharges. Then, it's ok to ignore memcg's refcnt.
4103 batch->memcg = memcg;
4105 * do_batch > 0 when unmapping pages or inode invalidate/truncate.
4106 * In those cases, all pages freed continuously can be expected to be in
4107 * the same cgroup and we have chance to coalesce uncharges.
4108 * But we do uncharge one by one if this is killed by OOM(TIF_MEMDIE)
4109 * because we want to do uncharge as soon as possible.
4112 if (!batch->do_batch || test_thread_flag(TIF_MEMDIE))
4113 goto direct_uncharge;
4116 goto direct_uncharge;
4119 * In typical case, batch->memcg == mem. This means we can
4120 * merge a series of uncharges to an uncharge of res_counter.
4121 * If not, we uncharge res_counter ony by one.
4123 if (batch->memcg != memcg)
4124 goto direct_uncharge;
4125 /* remember freed charge and uncharge it later */
4128 batch->memsw_nr_pages++;
4131 res_counter_uncharge(&memcg->res, nr_pages * PAGE_SIZE);
4133 res_counter_uncharge(&memcg->memsw, nr_pages * PAGE_SIZE);
4134 if (unlikely(batch->memcg != memcg))
4135 memcg_oom_recover(memcg);
4139 * uncharge if !page_mapped(page)
4141 static struct mem_cgroup *
4142 __mem_cgroup_uncharge_common(struct page *page, enum charge_type ctype,
4145 struct mem_cgroup *memcg = NULL;
4146 unsigned int nr_pages = 1;
4147 struct page_cgroup *pc;
4150 if (mem_cgroup_disabled())
4153 if (PageTransHuge(page)) {
4154 nr_pages <<= compound_order(page);
4155 VM_BUG_ON_PAGE(!PageTransHuge(page), page);
4158 * Check if our page_cgroup is valid
4160 pc = lookup_page_cgroup(page);
4161 if (unlikely(!PageCgroupUsed(pc)))
4164 lock_page_cgroup(pc);
4166 memcg = pc->mem_cgroup;
4168 if (!PageCgroupUsed(pc))
4171 anon = PageAnon(page);
4174 case MEM_CGROUP_CHARGE_TYPE_ANON:
4176 * Generally PageAnon tells if it's the anon statistics to be
4177 * updated; but sometimes e.g. mem_cgroup_uncharge_page() is
4178 * used before page reached the stage of being marked PageAnon.
4182 case MEM_CGROUP_CHARGE_TYPE_DROP:
4183 /* See mem_cgroup_prepare_migration() */
4184 if (page_mapped(page))
4187 * Pages under migration may not be uncharged. But
4188 * end_migration() /must/ be the one uncharging the
4189 * unused post-migration page and so it has to call
4190 * here with the migration bit still set. See the
4191 * res_counter handling below.
4193 if (!end_migration && PageCgroupMigration(pc))
4196 case MEM_CGROUP_CHARGE_TYPE_SWAPOUT:
4197 if (!PageAnon(page)) { /* Shared memory */
4198 if (page->mapping && !page_is_file_cache(page))
4200 } else if (page_mapped(page)) /* Anon */
4207 mem_cgroup_charge_statistics(memcg, page, anon, -nr_pages);
4209 ClearPageCgroupUsed(pc);
4211 * pc->mem_cgroup is not cleared here. It will be accessed when it's
4212 * freed from LRU. This is safe because uncharged page is expected not
4213 * to be reused (freed soon). Exception is SwapCache, it's handled by
4214 * special functions.
4217 unlock_page_cgroup(pc);
4219 * even after unlock, we have memcg->res.usage here and this memcg
4220 * will never be freed, so it's safe to call css_get().
4222 memcg_check_events(memcg, page);
4223 if (do_swap_account && ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) {
4224 mem_cgroup_swap_statistics(memcg, true);
4225 css_get(&memcg->css);
4228 * Migration does not charge the res_counter for the
4229 * replacement page, so leave it alone when phasing out the
4230 * page that is unused after the migration.
4232 if (!end_migration && !mem_cgroup_is_root(memcg))
4233 mem_cgroup_do_uncharge(memcg, nr_pages, ctype);
4238 unlock_page_cgroup(pc);
4242 void mem_cgroup_uncharge_page(struct page *page)
4245 if (page_mapped(page))
4247 VM_BUG_ON_PAGE(page->mapping && !PageAnon(page), page);
4249 * If the page is in swap cache, uncharge should be deferred
4250 * to the swap path, which also properly accounts swap usage
4251 * and handles memcg lifetime.
4253 * Note that this check is not stable and reclaim may add the
4254 * page to swap cache at any time after this. However, if the
4255 * page is not in swap cache by the time page->mapcount hits
4256 * 0, there won't be any page table references to the swap
4257 * slot, and reclaim will free it and not actually write the
4260 if (PageSwapCache(page))
4262 __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_ANON, false);
4265 void mem_cgroup_uncharge_cache_page(struct page *page)
4267 VM_BUG_ON_PAGE(page_mapped(page), page);
4268 VM_BUG_ON_PAGE(page->mapping, page);
4269 __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_CACHE, false);
4273 * Batch_start/batch_end is called in unmap_page_range/invlidate/trucate.
4274 * In that cases, pages are freed continuously and we can expect pages
4275 * are in the same memcg. All these calls itself limits the number of
4276 * pages freed at once, then uncharge_start/end() is called properly.
4277 * This may be called prural(2) times in a context,
4280 void mem_cgroup_uncharge_start(void)
4282 current->memcg_batch.do_batch++;
4283 /* We can do nest. */
4284 if (current->memcg_batch.do_batch == 1) {
4285 current->memcg_batch.memcg = NULL;
4286 current->memcg_batch.nr_pages = 0;
4287 current->memcg_batch.memsw_nr_pages = 0;
4291 void mem_cgroup_uncharge_end(void)
4293 struct memcg_batch_info *batch = ¤t->memcg_batch;
4295 if (!batch->do_batch)
4299 if (batch->do_batch) /* If stacked, do nothing. */
4305 * This "batch->memcg" is valid without any css_get/put etc...
4306 * bacause we hide charges behind us.
4308 if (batch->nr_pages)
4309 res_counter_uncharge(&batch->memcg->res,
4310 batch->nr_pages * PAGE_SIZE);
4311 if (batch->memsw_nr_pages)
4312 res_counter_uncharge(&batch->memcg->memsw,
4313 batch->memsw_nr_pages * PAGE_SIZE);
4314 memcg_oom_recover(batch->memcg);
4315 /* forget this pointer (for sanity check) */
4316 batch->memcg = NULL;
4321 * called after __delete_from_swap_cache() and drop "page" account.
4322 * memcg information is recorded to swap_cgroup of "ent"
4325 mem_cgroup_uncharge_swapcache(struct page *page, swp_entry_t ent, bool swapout)
4327 struct mem_cgroup *memcg;
4328 int ctype = MEM_CGROUP_CHARGE_TYPE_SWAPOUT;
4330 if (!swapout) /* this was a swap cache but the swap is unused ! */
4331 ctype = MEM_CGROUP_CHARGE_TYPE_DROP;
4333 memcg = __mem_cgroup_uncharge_common(page, ctype, false);
4336 * record memcg information, if swapout && memcg != NULL,
4337 * css_get() was called in uncharge().
4339 if (do_swap_account && swapout && memcg)
4340 swap_cgroup_record(ent, mem_cgroup_id(memcg));
4344 #ifdef CONFIG_MEMCG_SWAP
4346 * called from swap_entry_free(). remove record in swap_cgroup and
4347 * uncharge "memsw" account.
4349 void mem_cgroup_uncharge_swap(swp_entry_t ent)
4351 struct mem_cgroup *memcg;
4354 if (!do_swap_account)
4357 id = swap_cgroup_record(ent, 0);
4359 memcg = mem_cgroup_lookup(id);
4362 * We uncharge this because swap is freed.
4363 * This memcg can be obsolete one. We avoid calling css_tryget
4365 if (!mem_cgroup_is_root(memcg))
4366 res_counter_uncharge(&memcg->memsw, PAGE_SIZE);
4367 mem_cgroup_swap_statistics(memcg, false);
4368 css_put(&memcg->css);
4374 * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record.
4375 * @entry: swap entry to be moved
4376 * @from: mem_cgroup which the entry is moved from
4377 * @to: mem_cgroup which the entry is moved to
4379 * It succeeds only when the swap_cgroup's record for this entry is the same
4380 * as the mem_cgroup's id of @from.
4382 * Returns 0 on success, -EINVAL on failure.
4384 * The caller must have charged to @to, IOW, called res_counter_charge() about
4385 * both res and memsw, and called css_get().
4387 static int mem_cgroup_move_swap_account(swp_entry_t entry,
4388 struct mem_cgroup *from, struct mem_cgroup *to)
4390 unsigned short old_id, new_id;
4392 old_id = mem_cgroup_id(from);
4393 new_id = mem_cgroup_id(to);
4395 if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) {
4396 mem_cgroup_swap_statistics(from, false);
4397 mem_cgroup_swap_statistics(to, true);
4399 * This function is only called from task migration context now.
4400 * It postpones res_counter and refcount handling till the end
4401 * of task migration(mem_cgroup_clear_mc()) for performance
4402 * improvement. But we cannot postpone css_get(to) because if
4403 * the process that has been moved to @to does swap-in, the
4404 * refcount of @to might be decreased to 0.
4406 * We are in attach() phase, so the cgroup is guaranteed to be
4407 * alive, so we can just call css_get().
4415 static inline int mem_cgroup_move_swap_account(swp_entry_t entry,
4416 struct mem_cgroup *from, struct mem_cgroup *to)
4423 * Before starting migration, account PAGE_SIZE to mem_cgroup that the old
4426 void mem_cgroup_prepare_migration(struct page *page, struct page *newpage,
4427 struct mem_cgroup **memcgp)
4429 struct mem_cgroup *memcg = NULL;
4430 unsigned int nr_pages = 1;
4431 struct page_cgroup *pc;
4432 enum charge_type ctype;
4436 if (mem_cgroup_disabled())
4439 if (PageTransHuge(page))
4440 nr_pages <<= compound_order(page);
4442 pc = lookup_page_cgroup(page);
4443 lock_page_cgroup(pc);
4444 if (PageCgroupUsed(pc)) {
4445 memcg = pc->mem_cgroup;
4446 css_get(&memcg->css);
4448 * At migrating an anonymous page, its mapcount goes down
4449 * to 0 and uncharge() will be called. But, even if it's fully
4450 * unmapped, migration may fail and this page has to be
4451 * charged again. We set MIGRATION flag here and delay uncharge
4452 * until end_migration() is called
4454 * Corner Case Thinking
4456 * When the old page was mapped as Anon and it's unmap-and-freed
4457 * while migration was ongoing.
4458 * If unmap finds the old page, uncharge() of it will be delayed
4459 * until end_migration(). If unmap finds a new page, it's
4460 * uncharged when it make mapcount to be 1->0. If unmap code
4461 * finds swap_migration_entry, the new page will not be mapped
4462 * and end_migration() will find it(mapcount==0).
4465 * When the old page was mapped but migraion fails, the kernel
4466 * remaps it. A charge for it is kept by MIGRATION flag even
4467 * if mapcount goes down to 0. We can do remap successfully
4468 * without charging it again.
4471 * The "old" page is under lock_page() until the end of
4472 * migration, so, the old page itself will not be swapped-out.
4473 * If the new page is swapped out before end_migraton, our
4474 * hook to usual swap-out path will catch the event.
4477 SetPageCgroupMigration(pc);
4479 unlock_page_cgroup(pc);
4481 * If the page is not charged at this point,
4489 * We charge new page before it's used/mapped. So, even if unlock_page()
4490 * is called before end_migration, we can catch all events on this new
4491 * page. In the case new page is migrated but not remapped, new page's
4492 * mapcount will be finally 0 and we call uncharge in end_migration().
4495 ctype = MEM_CGROUP_CHARGE_TYPE_ANON;
4497 ctype = MEM_CGROUP_CHARGE_TYPE_CACHE;
4499 * The page is committed to the memcg, but it's not actually
4500 * charged to the res_counter since we plan on replacing the
4501 * old one and only one page is going to be left afterwards.
4503 __mem_cgroup_commit_charge(memcg, newpage, nr_pages, ctype, false);
4506 /* remove redundant charge if migration failed*/
4507 void mem_cgroup_end_migration(struct mem_cgroup *memcg,
4508 struct page *oldpage, struct page *newpage, bool migration_ok)
4510 struct page *used, *unused;
4511 struct page_cgroup *pc;
4517 if (!migration_ok) {
4524 anon = PageAnon(used);
4525 __mem_cgroup_uncharge_common(unused,
4526 anon ? MEM_CGROUP_CHARGE_TYPE_ANON
4527 : MEM_CGROUP_CHARGE_TYPE_CACHE,
4529 css_put(&memcg->css);
4531 * We disallowed uncharge of pages under migration because mapcount
4532 * of the page goes down to zero, temporarly.
4533 * Clear the flag and check the page should be charged.
4535 pc = lookup_page_cgroup(oldpage);
4536 lock_page_cgroup(pc);
4537 ClearPageCgroupMigration(pc);
4538 unlock_page_cgroup(pc);
4541 * If a page is a file cache, radix-tree replacement is very atomic
4542 * and we can skip this check. When it was an Anon page, its mapcount
4543 * goes down to 0. But because we added MIGRATION flage, it's not
4544 * uncharged yet. There are several case but page->mapcount check
4545 * and USED bit check in mem_cgroup_uncharge_page() will do enough
4546 * check. (see prepare_charge() also)
4549 mem_cgroup_uncharge_page(used);
4553 * At replace page cache, newpage is not under any memcg but it's on
4554 * LRU. So, this function doesn't touch res_counter but handles LRU
4555 * in correct way. Both pages are locked so we cannot race with uncharge.
4557 void mem_cgroup_replace_page_cache(struct page *oldpage,
4558 struct page *newpage)
4560 struct mem_cgroup *memcg = NULL;
4561 struct page_cgroup *pc;
4562 enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE;
4564 if (mem_cgroup_disabled())
4567 pc = lookup_page_cgroup(oldpage);
4568 /* fix accounting on old pages */
4569 lock_page_cgroup(pc);
4570 if (PageCgroupUsed(pc)) {
4571 memcg = pc->mem_cgroup;
4572 mem_cgroup_charge_statistics(memcg, oldpage, false, -1);
4573 ClearPageCgroupUsed(pc);
4575 unlock_page_cgroup(pc);
4578 * When called from shmem_replace_page(), in some cases the
4579 * oldpage has already been charged, and in some cases not.
4584 * Even if newpage->mapping was NULL before starting replacement,
4585 * the newpage may be on LRU(or pagevec for LRU) already. We lock
4586 * LRU while we overwrite pc->mem_cgroup.
4588 __mem_cgroup_commit_charge(memcg, newpage, 1, type, true);
4591 #ifdef CONFIG_DEBUG_VM
4592 static struct page_cgroup *lookup_page_cgroup_used(struct page *page)
4594 struct page_cgroup *pc;
4596 pc = lookup_page_cgroup(page);
4598 * Can be NULL while feeding pages into the page allocator for
4599 * the first time, i.e. during boot or memory hotplug;
4600 * or when mem_cgroup_disabled().
4602 if (likely(pc) && PageCgroupUsed(pc))
4607 bool mem_cgroup_bad_page_check(struct page *page)
4609 if (mem_cgroup_disabled())
4612 return lookup_page_cgroup_used(page) != NULL;
4615 void mem_cgroup_print_bad_page(struct page *page)
4617 struct page_cgroup *pc;
4619 pc = lookup_page_cgroup_used(page);
4621 pr_alert("pc:%p pc->flags:%lx pc->mem_cgroup:%p\n",
4622 pc, pc->flags, pc->mem_cgroup);
4627 static int mem_cgroup_resize_limit(struct mem_cgroup *memcg,
4628 unsigned long long val)
4631 u64 memswlimit, memlimit;
4633 int children = mem_cgroup_count_children(memcg);
4634 u64 curusage, oldusage;
4638 * For keeping hierarchical_reclaim simple, how long we should retry
4639 * is depends on callers. We set our retry-count to be function
4640 * of # of children which we should visit in this loop.
4642 retry_count = MEM_CGROUP_RECLAIM_RETRIES * children;
4644 oldusage = res_counter_read_u64(&memcg->res, RES_USAGE);
4647 while (retry_count) {
4648 if (signal_pending(current)) {
4653 * Rather than hide all in some function, I do this in
4654 * open coded manner. You see what this really does.
4655 * We have to guarantee memcg->res.limit <= memcg->memsw.limit.
4657 mutex_lock(&set_limit_mutex);
4658 memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
4659 if (memswlimit < val) {
4661 mutex_unlock(&set_limit_mutex);
4665 memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT);
4669 ret = res_counter_set_limit(&memcg->res, val);
4671 if (memswlimit == val)
4672 memcg->memsw_is_minimum = true;
4674 memcg->memsw_is_minimum = false;
4676 mutex_unlock(&set_limit_mutex);
4681 mem_cgroup_reclaim(memcg, GFP_KERNEL,
4682 MEM_CGROUP_RECLAIM_SHRINK);
4683 curusage = res_counter_read_u64(&memcg->res, RES_USAGE);
4684 /* Usage is reduced ? */
4685 if (curusage >= oldusage)
4688 oldusage = curusage;
4690 if (!ret && enlarge)
4691 memcg_oom_recover(memcg);
4696 static int mem_cgroup_resize_memsw_limit(struct mem_cgroup *memcg,
4697 unsigned long long val)
4700 u64 memlimit, memswlimit, oldusage, curusage;
4701 int children = mem_cgroup_count_children(memcg);
4705 /* see mem_cgroup_resize_res_limit */
4706 retry_count = children * MEM_CGROUP_RECLAIM_RETRIES;
4707 oldusage = res_counter_read_u64(&memcg->memsw, RES_USAGE);
4708 while (retry_count) {
4709 if (signal_pending(current)) {
4714 * Rather than hide all in some function, I do this in
4715 * open coded manner. You see what this really does.
4716 * We have to guarantee memcg->res.limit <= memcg->memsw.limit.
4718 mutex_lock(&set_limit_mutex);
4719 memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT);
4720 if (memlimit > val) {
4722 mutex_unlock(&set_limit_mutex);
4725 memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
4726 if (memswlimit < val)
4728 ret = res_counter_set_limit(&memcg->memsw, val);
4730 if (memlimit == val)
4731 memcg->memsw_is_minimum = true;
4733 memcg->memsw_is_minimum = false;
4735 mutex_unlock(&set_limit_mutex);
4740 mem_cgroup_reclaim(memcg, GFP_KERNEL,
4741 MEM_CGROUP_RECLAIM_NOSWAP |
4742 MEM_CGROUP_RECLAIM_SHRINK);
4743 curusage = res_counter_read_u64(&memcg->memsw, RES_USAGE);
4744 /* Usage is reduced ? */
4745 if (curusage >= oldusage)
4748 oldusage = curusage;
4750 if (!ret && enlarge)
4751 memcg_oom_recover(memcg);
4755 unsigned long mem_cgroup_soft_limit_reclaim(struct zone *zone, int order,
4757 unsigned long *total_scanned)
4759 unsigned long nr_reclaimed = 0;
4760 struct mem_cgroup_per_zone *mz, *next_mz = NULL;
4761 unsigned long reclaimed;
4763 struct mem_cgroup_tree_per_zone *mctz;
4764 unsigned long long excess;
4765 unsigned long nr_scanned;
4770 mctz = soft_limit_tree_node_zone(zone_to_nid(zone), zone_idx(zone));
4772 * This loop can run a while, specially if mem_cgroup's continuously
4773 * keep exceeding their soft limit and putting the system under
4780 mz = mem_cgroup_largest_soft_limit_node(mctz);
4785 reclaimed = mem_cgroup_soft_reclaim(mz->memcg, zone,
4786 gfp_mask, &nr_scanned);
4787 nr_reclaimed += reclaimed;
4788 *total_scanned += nr_scanned;
4789 spin_lock(&mctz->lock);
4792 * If we failed to reclaim anything from this memory cgroup
4793 * it is time to move on to the next cgroup
4799 * Loop until we find yet another one.
4801 * By the time we get the soft_limit lock
4802 * again, someone might have aded the
4803 * group back on the RB tree. Iterate to
4804 * make sure we get a different mem.
4805 * mem_cgroup_largest_soft_limit_node returns
4806 * NULL if no other cgroup is present on
4810 __mem_cgroup_largest_soft_limit_node(mctz);
4812 css_put(&next_mz->memcg->css);
4813 else /* next_mz == NULL or other memcg */
4817 __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz);
4818 excess = res_counter_soft_limit_excess(&mz->memcg->res);
4820 * One school of thought says that we should not add
4821 * back the node to the tree if reclaim returns 0.
4822 * But our reclaim could return 0, simply because due
4823 * to priority we are exposing a smaller subset of
4824 * memory to reclaim from. Consider this as a longer
4827 /* If excess == 0, no tree ops */
4828 __mem_cgroup_insert_exceeded(mz->memcg, mz, mctz, excess);
4829 spin_unlock(&mctz->lock);
4830 css_put(&mz->memcg->css);
4833 * Could not reclaim anything and there are no more
4834 * mem cgroups to try or we seem to be looping without
4835 * reclaiming anything.
4837 if (!nr_reclaimed &&
4839 loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS))
4841 } while (!nr_reclaimed);
4843 css_put(&next_mz->memcg->css);
4844 return nr_reclaimed;
4848 * mem_cgroup_force_empty_list - clears LRU of a group
4849 * @memcg: group to clear
4852 * @lru: lru to to clear
4854 * Traverse a specified page_cgroup list and try to drop them all. This doesn't
4855 * reclaim the pages page themselves - pages are moved to the parent (or root)
4858 static void mem_cgroup_force_empty_list(struct mem_cgroup *memcg,
4859 int node, int zid, enum lru_list lru)
4861 struct lruvec *lruvec;
4862 unsigned long flags;
4863 struct list_head *list;
4867 zone = &NODE_DATA(node)->node_zones[zid];
4868 lruvec = mem_cgroup_zone_lruvec(zone, memcg);
4869 list = &lruvec->lists[lru];
4873 struct page_cgroup *pc;
4876 spin_lock_irqsave(&zone->lru_lock, flags);
4877 if (list_empty(list)) {
4878 spin_unlock_irqrestore(&zone->lru_lock, flags);
4881 page = list_entry(list->prev, struct page, lru);
4883 list_move(&page->lru, list);
4885 spin_unlock_irqrestore(&zone->lru_lock, flags);
4888 spin_unlock_irqrestore(&zone->lru_lock, flags);
4890 pc = lookup_page_cgroup(page);
4892 if (mem_cgroup_move_parent(page, pc, memcg)) {
4893 /* found lock contention or "pc" is obsolete. */
4898 } while (!list_empty(list));
4902 * make mem_cgroup's charge to be 0 if there is no task by moving
4903 * all the charges and pages to the parent.
4904 * This enables deleting this mem_cgroup.
4906 * Caller is responsible for holding css reference on the memcg.
4908 static void mem_cgroup_reparent_charges(struct mem_cgroup *memcg)
4914 /* This is for making all *used* pages to be on LRU. */
4915 lru_add_drain_all();
4916 drain_all_stock_sync(memcg);
4917 mem_cgroup_start_move(memcg);
4918 for_each_node_state(node, N_MEMORY) {
4919 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
4922 mem_cgroup_force_empty_list(memcg,
4927 mem_cgroup_end_move(memcg);
4928 memcg_oom_recover(memcg);
4932 * Kernel memory may not necessarily be trackable to a specific
4933 * process. So they are not migrated, and therefore we can't
4934 * expect their value to drop to 0 here.
4935 * Having res filled up with kmem only is enough.
4937 * This is a safety check because mem_cgroup_force_empty_list
4938 * could have raced with mem_cgroup_replace_page_cache callers
4939 * so the lru seemed empty but the page could have been added
4940 * right after the check. RES_USAGE should be safe as we always
4941 * charge before adding to the LRU.
4943 usage = res_counter_read_u64(&memcg->res, RES_USAGE) -
4944 res_counter_read_u64(&memcg->kmem, RES_USAGE);
4945 } while (usage > 0);
4948 static inline bool memcg_has_children(struct mem_cgroup *memcg)
4950 lockdep_assert_held(&memcg_create_mutex);
4952 * The lock does not prevent addition or deletion to the list
4953 * of children, but it prevents a new child from being
4954 * initialized based on this parent in css_online(), so it's
4955 * enough to decide whether hierarchically inherited
4956 * attributes can still be changed or not.
4958 return memcg->use_hierarchy &&
4959 !list_empty(&memcg->css.cgroup->children);
4963 * Reclaims as many pages from the given memcg as possible and moves
4964 * the rest to the parent.
4966 * Caller is responsible for holding css reference for memcg.
4968 static int mem_cgroup_force_empty(struct mem_cgroup *memcg)
4970 int nr_retries = MEM_CGROUP_RECLAIM_RETRIES;
4971 struct cgroup *cgrp = memcg->css.cgroup;
4973 /* returns EBUSY if there is a task or if we come here twice. */
4974 if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children))
4977 /* we call try-to-free pages for make this cgroup empty */
4978 lru_add_drain_all();
4979 /* try to free all pages in this cgroup */
4980 while (nr_retries && res_counter_read_u64(&memcg->res, RES_USAGE) > 0) {
4983 if (signal_pending(current))
4986 progress = try_to_free_mem_cgroup_pages(memcg, GFP_KERNEL,
4990 /* maybe some writeback is necessary */
4991 congestion_wait(BLK_RW_ASYNC, HZ/10);
4996 mem_cgroup_reparent_charges(memcg);
5001 static int mem_cgroup_force_empty_write(struct cgroup_subsys_state *css,
5004 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5006 if (mem_cgroup_is_root(memcg))
5008 return mem_cgroup_force_empty(memcg);
5011 static u64 mem_cgroup_hierarchy_read(struct cgroup_subsys_state *css,
5014 return mem_cgroup_from_css(css)->use_hierarchy;
5017 static int mem_cgroup_hierarchy_write(struct cgroup_subsys_state *css,
5018 struct cftype *cft, u64 val)
5021 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5022 struct mem_cgroup *parent_memcg = mem_cgroup_from_css(css_parent(&memcg->css));
5024 mutex_lock(&memcg_create_mutex);
5026 if (memcg->use_hierarchy == val)
5030 * If parent's use_hierarchy is set, we can't make any modifications
5031 * in the child subtrees. If it is unset, then the change can
5032 * occur, provided the current cgroup has no children.
5034 * For the root cgroup, parent_mem is NULL, we allow value to be
5035 * set if there are no children.
5037 if ((!parent_memcg || !parent_memcg->use_hierarchy) &&
5038 (val == 1 || val == 0)) {
5039 if (list_empty(&memcg->css.cgroup->children))
5040 memcg->use_hierarchy = val;
5047 mutex_unlock(&memcg_create_mutex);
5053 static unsigned long mem_cgroup_recursive_stat(struct mem_cgroup *memcg,
5054 enum mem_cgroup_stat_index idx)
5056 struct mem_cgroup *iter;
5059 /* Per-cpu values can be negative, use a signed accumulator */
5060 for_each_mem_cgroup_tree(iter, memcg)
5061 val += mem_cgroup_read_stat(iter, idx);
5063 if (val < 0) /* race ? */
5068 static inline u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap)
5072 if (!mem_cgroup_is_root(memcg)) {
5074 return res_counter_read_u64(&memcg->res, RES_USAGE);
5076 return res_counter_read_u64(&memcg->memsw, RES_USAGE);
5080 * Transparent hugepages are still accounted for in MEM_CGROUP_STAT_RSS
5081 * as well as in MEM_CGROUP_STAT_RSS_HUGE.
5083 val = mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_CACHE);
5084 val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_RSS);
5087 val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_SWAP);
5089 return val << PAGE_SHIFT;
5092 static u64 mem_cgroup_read_u64(struct cgroup_subsys_state *css,
5095 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5100 type = MEMFILE_TYPE(cft->private);
5101 name = MEMFILE_ATTR(cft->private);
5105 if (name == RES_USAGE)
5106 val = mem_cgroup_usage(memcg, false);
5108 val = res_counter_read_u64(&memcg->res, name);
5111 if (name == RES_USAGE)
5112 val = mem_cgroup_usage(memcg, true);
5114 val = res_counter_read_u64(&memcg->memsw, name);
5117 val = res_counter_read_u64(&memcg->kmem, name);
5126 #ifdef CONFIG_MEMCG_KMEM
5127 /* should be called with activate_kmem_mutex held */
5128 static int __memcg_activate_kmem(struct mem_cgroup *memcg,
5129 unsigned long long limit)
5134 if (memcg_kmem_is_active(memcg))
5138 * We are going to allocate memory for data shared by all memory
5139 * cgroups so let's stop accounting here.
5141 memcg_stop_kmem_account();
5144 * For simplicity, we won't allow this to be disabled. It also can't
5145 * be changed if the cgroup has children already, or if tasks had
5148 * If tasks join before we set the limit, a person looking at
5149 * kmem.usage_in_bytes will have no way to determine when it took
5150 * place, which makes the value quite meaningless.
5152 * After it first became limited, changes in the value of the limit are
5153 * of course permitted.
5155 mutex_lock(&memcg_create_mutex);
5156 if (cgroup_task_count(memcg->css.cgroup) || memcg_has_children(memcg))
5158 mutex_unlock(&memcg_create_mutex);
5162 memcg_id = ida_simple_get(&kmem_limited_groups,
5163 0, MEMCG_CACHES_MAX_SIZE, GFP_KERNEL);
5170 * Make sure we have enough space for this cgroup in each root cache's
5173 err = memcg_update_all_caches(memcg_id + 1);
5177 memcg->kmemcg_id = memcg_id;
5178 INIT_LIST_HEAD(&memcg->memcg_slab_caches);
5179 mutex_init(&memcg->slab_caches_mutex);
5182 * We couldn't have accounted to this cgroup, because it hasn't got the
5183 * active bit set yet, so this should succeed.
5185 err = res_counter_set_limit(&memcg->kmem, limit);
5188 static_key_slow_inc(&memcg_kmem_enabled_key);
5190 * Setting the active bit after enabling static branching will
5191 * guarantee no one starts accounting before all call sites are
5194 memcg_kmem_set_active(memcg);
5196 memcg_resume_kmem_account();
5200 ida_simple_remove(&kmem_limited_groups, memcg_id);
5204 static int memcg_activate_kmem(struct mem_cgroup *memcg,
5205 unsigned long long limit)
5209 mutex_lock(&activate_kmem_mutex);
5210 ret = __memcg_activate_kmem(memcg, limit);
5211 mutex_unlock(&activate_kmem_mutex);
5215 static int memcg_update_kmem_limit(struct mem_cgroup *memcg,
5216 unsigned long long val)
5220 if (!memcg_kmem_is_active(memcg))
5221 ret = memcg_activate_kmem(memcg, val);
5223 ret = res_counter_set_limit(&memcg->kmem, val);
5227 static int memcg_propagate_kmem(struct mem_cgroup *memcg)
5230 struct mem_cgroup *parent = parent_mem_cgroup(memcg);
5235 mutex_lock(&activate_kmem_mutex);
5237 * If the parent cgroup is not kmem-active now, it cannot be activated
5238 * after this point, because it has at least one child already.
5240 if (memcg_kmem_is_active(parent))
5241 ret = __memcg_activate_kmem(memcg, RES_COUNTER_MAX);
5242 mutex_unlock(&activate_kmem_mutex);
5246 static int memcg_update_kmem_limit(struct mem_cgroup *memcg,
5247 unsigned long long val)
5251 #endif /* CONFIG_MEMCG_KMEM */
5254 * The user of this function is...
5257 static int mem_cgroup_write(struct cgroup_subsys_state *css, struct cftype *cft,
5260 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5263 unsigned long long val;
5266 type = MEMFILE_TYPE(cft->private);
5267 name = MEMFILE_ATTR(cft->private);
5271 if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */
5275 /* This function does all necessary parse...reuse it */
5276 ret = res_counter_memparse_write_strategy(buffer, &val);
5280 ret = mem_cgroup_resize_limit(memcg, val);
5281 else if (type == _MEMSWAP)
5282 ret = mem_cgroup_resize_memsw_limit(memcg, val);
5283 else if (type == _KMEM)
5284 ret = memcg_update_kmem_limit(memcg, val);
5288 case RES_SOFT_LIMIT:
5289 ret = res_counter_memparse_write_strategy(buffer, &val);
5293 * For memsw, soft limits are hard to implement in terms
5294 * of semantics, for now, we support soft limits for
5295 * control without swap
5298 ret = res_counter_set_soft_limit(&memcg->res, val);
5303 ret = -EINVAL; /* should be BUG() ? */
5309 static void memcg_get_hierarchical_limit(struct mem_cgroup *memcg,
5310 unsigned long long *mem_limit, unsigned long long *memsw_limit)
5312 unsigned long long min_limit, min_memsw_limit, tmp;
5314 min_limit = res_counter_read_u64(&memcg->res, RES_LIMIT);
5315 min_memsw_limit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
5316 if (!memcg->use_hierarchy)
5319 while (css_parent(&memcg->css)) {
5320 memcg = mem_cgroup_from_css(css_parent(&memcg->css));
5321 if (!memcg->use_hierarchy)
5323 tmp = res_counter_read_u64(&memcg->res, RES_LIMIT);
5324 min_limit = min(min_limit, tmp);
5325 tmp = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
5326 min_memsw_limit = min(min_memsw_limit, tmp);
5329 *mem_limit = min_limit;
5330 *memsw_limit = min_memsw_limit;
5333 static int mem_cgroup_reset(struct cgroup_subsys_state *css, unsigned int event)
5335 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5339 type = MEMFILE_TYPE(event);
5340 name = MEMFILE_ATTR(event);
5345 res_counter_reset_max(&memcg->res);
5346 else if (type == _MEMSWAP)
5347 res_counter_reset_max(&memcg->memsw);
5348 else if (type == _KMEM)
5349 res_counter_reset_max(&memcg->kmem);
5355 res_counter_reset_failcnt(&memcg->res);
5356 else if (type == _MEMSWAP)
5357 res_counter_reset_failcnt(&memcg->memsw);
5358 else if (type == _KMEM)
5359 res_counter_reset_failcnt(&memcg->kmem);
5368 static u64 mem_cgroup_move_charge_read(struct cgroup_subsys_state *css,
5371 return mem_cgroup_from_css(css)->move_charge_at_immigrate;
5375 static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css,
5376 struct cftype *cft, u64 val)
5378 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5380 if (val >= (1 << NR_MOVE_TYPE))
5384 * No kind of locking is needed in here, because ->can_attach() will
5385 * check this value once in the beginning of the process, and then carry
5386 * on with stale data. This means that changes to this value will only
5387 * affect task migrations starting after the change.
5389 memcg->move_charge_at_immigrate = val;
5393 static int mem_cgroup_move_charge_write(struct cgroup_subsys_state *css,
5394 struct cftype *cft, u64 val)
5401 static int memcg_numa_stat_show(struct seq_file *m, void *v)
5405 unsigned int lru_mask;
5408 static const struct numa_stat stats[] = {
5409 { "total", LRU_ALL },
5410 { "file", LRU_ALL_FILE },
5411 { "anon", LRU_ALL_ANON },
5412 { "unevictable", BIT(LRU_UNEVICTABLE) },
5414 const struct numa_stat *stat;
5417 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
5419 for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) {
5420 nr = mem_cgroup_nr_lru_pages(memcg, stat->lru_mask);
5421 seq_printf(m, "%s=%lu", stat->name, nr);
5422 for_each_node_state(nid, N_MEMORY) {
5423 nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
5425 seq_printf(m, " N%d=%lu", nid, nr);
5430 for (stat = stats; stat < stats + ARRAY_SIZE(stats); stat++) {
5431 struct mem_cgroup *iter;
5434 for_each_mem_cgroup_tree(iter, memcg)
5435 nr += mem_cgroup_nr_lru_pages(iter, stat->lru_mask);
5436 seq_printf(m, "hierarchical_%s=%lu", stat->name, nr);
5437 for_each_node_state(nid, N_MEMORY) {
5439 for_each_mem_cgroup_tree(iter, memcg)
5440 nr += mem_cgroup_node_nr_lru_pages(
5441 iter, nid, stat->lru_mask);
5442 seq_printf(m, " N%d=%lu", nid, nr);
5449 #endif /* CONFIG_NUMA */
5451 static inline void mem_cgroup_lru_names_not_uptodate(void)
5453 BUILD_BUG_ON(ARRAY_SIZE(mem_cgroup_lru_names) != NR_LRU_LISTS);
5456 static int memcg_stat_show(struct seq_file *m, void *v)
5458 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
5459 struct mem_cgroup *mi;
5462 for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) {
5463 if (i == MEM_CGROUP_STAT_SWAP && !do_swap_account)
5465 seq_printf(m, "%s %ld\n", mem_cgroup_stat_names[i],
5466 mem_cgroup_read_stat(memcg, i) * PAGE_SIZE);
5469 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++)
5470 seq_printf(m, "%s %lu\n", mem_cgroup_events_names[i],
5471 mem_cgroup_read_events(memcg, i));
5473 for (i = 0; i < NR_LRU_LISTS; i++)
5474 seq_printf(m, "%s %lu\n", mem_cgroup_lru_names[i],
5475 mem_cgroup_nr_lru_pages(memcg, BIT(i)) * PAGE_SIZE);
5477 /* Hierarchical information */
5479 unsigned long long limit, memsw_limit;
5480 memcg_get_hierarchical_limit(memcg, &limit, &memsw_limit);
5481 seq_printf(m, "hierarchical_memory_limit %llu\n", limit);
5482 if (do_swap_account)
5483 seq_printf(m, "hierarchical_memsw_limit %llu\n",
5487 for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) {
5490 if (i == MEM_CGROUP_STAT_SWAP && !do_swap_account)
5492 for_each_mem_cgroup_tree(mi, memcg)
5493 val += mem_cgroup_read_stat(mi, i) * PAGE_SIZE;
5494 seq_printf(m, "total_%s %lld\n", mem_cgroup_stat_names[i], val);
5497 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) {
5498 unsigned long long val = 0;
5500 for_each_mem_cgroup_tree(mi, memcg)
5501 val += mem_cgroup_read_events(mi, i);
5502 seq_printf(m, "total_%s %llu\n",
5503 mem_cgroup_events_names[i], val);
5506 for (i = 0; i < NR_LRU_LISTS; i++) {
5507 unsigned long long val = 0;
5509 for_each_mem_cgroup_tree(mi, memcg)
5510 val += mem_cgroup_nr_lru_pages(mi, BIT(i)) * PAGE_SIZE;
5511 seq_printf(m, "total_%s %llu\n", mem_cgroup_lru_names[i], val);
5514 #ifdef CONFIG_DEBUG_VM
5517 struct mem_cgroup_per_zone *mz;
5518 struct zone_reclaim_stat *rstat;
5519 unsigned long recent_rotated[2] = {0, 0};
5520 unsigned long recent_scanned[2] = {0, 0};
5522 for_each_online_node(nid)
5523 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
5524 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
5525 rstat = &mz->lruvec.reclaim_stat;
5527 recent_rotated[0] += rstat->recent_rotated[0];
5528 recent_rotated[1] += rstat->recent_rotated[1];
5529 recent_scanned[0] += rstat->recent_scanned[0];
5530 recent_scanned[1] += rstat->recent_scanned[1];
5532 seq_printf(m, "recent_rotated_anon %lu\n", recent_rotated[0]);
5533 seq_printf(m, "recent_rotated_file %lu\n", recent_rotated[1]);
5534 seq_printf(m, "recent_scanned_anon %lu\n", recent_scanned[0]);
5535 seq_printf(m, "recent_scanned_file %lu\n", recent_scanned[1]);
5542 static u64 mem_cgroup_swappiness_read(struct cgroup_subsys_state *css,
5545 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5547 return mem_cgroup_swappiness(memcg);
5550 static int mem_cgroup_swappiness_write(struct cgroup_subsys_state *css,
5551 struct cftype *cft, u64 val)
5553 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5554 struct mem_cgroup *parent = mem_cgroup_from_css(css_parent(&memcg->css));
5556 if (val > 100 || !parent)
5559 mutex_lock(&memcg_create_mutex);
5561 /* If under hierarchy, only empty-root can set this value */
5562 if ((parent->use_hierarchy) || memcg_has_children(memcg)) {
5563 mutex_unlock(&memcg_create_mutex);
5567 memcg->swappiness = val;
5569 mutex_unlock(&memcg_create_mutex);
5574 static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap)
5576 struct mem_cgroup_threshold_ary *t;
5582 t = rcu_dereference(memcg->thresholds.primary);
5584 t = rcu_dereference(memcg->memsw_thresholds.primary);
5589 usage = mem_cgroup_usage(memcg, swap);
5592 * current_threshold points to threshold just below or equal to usage.
5593 * If it's not true, a threshold was crossed after last
5594 * call of __mem_cgroup_threshold().
5596 i = t->current_threshold;
5599 * Iterate backward over array of thresholds starting from
5600 * current_threshold and check if a threshold is crossed.
5601 * If none of thresholds below usage is crossed, we read
5602 * only one element of the array here.
5604 for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)
5605 eventfd_signal(t->entries[i].eventfd, 1);
5607 /* i = current_threshold + 1 */
5611 * Iterate forward over array of thresholds starting from
5612 * current_threshold+1 and check if a threshold is crossed.
5613 * If none of thresholds above usage is crossed, we read
5614 * only one element of the array here.
5616 for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)
5617 eventfd_signal(t->entries[i].eventfd, 1);
5619 /* Update current_threshold */
5620 t->current_threshold = i - 1;
5625 static void mem_cgroup_threshold(struct mem_cgroup *memcg)
5628 __mem_cgroup_threshold(memcg, false);
5629 if (do_swap_account)
5630 __mem_cgroup_threshold(memcg, true);
5632 memcg = parent_mem_cgroup(memcg);
5636 static int compare_thresholds(const void *a, const void *b)
5638 const struct mem_cgroup_threshold *_a = a;
5639 const struct mem_cgroup_threshold *_b = b;
5641 if (_a->threshold > _b->threshold)
5644 if (_a->threshold < _b->threshold)
5650 static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg)
5652 struct mem_cgroup_eventfd_list *ev;
5654 list_for_each_entry(ev, &memcg->oom_notify, list)
5655 eventfd_signal(ev->eventfd, 1);
5659 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg)
5661 struct mem_cgroup *iter;
5663 for_each_mem_cgroup_tree(iter, memcg)
5664 mem_cgroup_oom_notify_cb(iter);
5667 static int __mem_cgroup_usage_register_event(struct mem_cgroup *memcg,
5668 struct eventfd_ctx *eventfd, const char *args, enum res_type type)
5670 struct mem_cgroup_thresholds *thresholds;
5671 struct mem_cgroup_threshold_ary *new;
5672 u64 threshold, usage;
5675 ret = res_counter_memparse_write_strategy(args, &threshold);
5679 mutex_lock(&memcg->thresholds_lock);
5682 thresholds = &memcg->thresholds;
5683 else if (type == _MEMSWAP)
5684 thresholds = &memcg->memsw_thresholds;
5688 usage = mem_cgroup_usage(memcg, type == _MEMSWAP);
5690 /* Check if a threshold crossed before adding a new one */
5691 if (thresholds->primary)
5692 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
5694 size = thresholds->primary ? thresholds->primary->size + 1 : 1;
5696 /* Allocate memory for new array of thresholds */
5697 new = kmalloc(sizeof(*new) + size * sizeof(struct mem_cgroup_threshold),
5705 /* Copy thresholds (if any) to new array */
5706 if (thresholds->primary) {
5707 memcpy(new->entries, thresholds->primary->entries, (size - 1) *
5708 sizeof(struct mem_cgroup_threshold));
5711 /* Add new threshold */
5712 new->entries[size - 1].eventfd = eventfd;
5713 new->entries[size - 1].threshold = threshold;
5715 /* Sort thresholds. Registering of new threshold isn't time-critical */
5716 sort(new->entries, size, sizeof(struct mem_cgroup_threshold),
5717 compare_thresholds, NULL);
5719 /* Find current threshold */
5720 new->current_threshold = -1;
5721 for (i = 0; i < size; i++) {
5722 if (new->entries[i].threshold <= usage) {
5724 * new->current_threshold will not be used until
5725 * rcu_assign_pointer(), so it's safe to increment
5728 ++new->current_threshold;
5733 /* Free old spare buffer and save old primary buffer as spare */
5734 kfree(thresholds->spare);
5735 thresholds->spare = thresholds->primary;
5737 rcu_assign_pointer(thresholds->primary, new);
5739 /* To be sure that nobody uses thresholds */
5743 mutex_unlock(&memcg->thresholds_lock);
5748 static int mem_cgroup_usage_register_event(struct mem_cgroup *memcg,
5749 struct eventfd_ctx *eventfd, const char *args)
5751 return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEM);
5754 static int memsw_cgroup_usage_register_event(struct mem_cgroup *memcg,
5755 struct eventfd_ctx *eventfd, const char *args)
5757 return __mem_cgroup_usage_register_event(memcg, eventfd, args, _MEMSWAP);
5760 static void __mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
5761 struct eventfd_ctx *eventfd, enum res_type type)
5763 struct mem_cgroup_thresholds *thresholds;
5764 struct mem_cgroup_threshold_ary *new;
5768 mutex_lock(&memcg->thresholds_lock);
5770 thresholds = &memcg->thresholds;
5771 else if (type == _MEMSWAP)
5772 thresholds = &memcg->memsw_thresholds;
5776 if (!thresholds->primary)
5779 usage = mem_cgroup_usage(memcg, type == _MEMSWAP);
5781 /* Check if a threshold crossed before removing */
5782 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
5784 /* Calculate new number of threshold */
5786 for (i = 0; i < thresholds->primary->size; i++) {
5787 if (thresholds->primary->entries[i].eventfd != eventfd)
5791 new = thresholds->spare;
5793 /* Set thresholds array to NULL if we don't have thresholds */
5802 /* Copy thresholds and find current threshold */
5803 new->current_threshold = -1;
5804 for (i = 0, j = 0; i < thresholds->primary->size; i++) {
5805 if (thresholds->primary->entries[i].eventfd == eventfd)
5808 new->entries[j] = thresholds->primary->entries[i];
5809 if (new->entries[j].threshold <= usage) {
5811 * new->current_threshold will not be used
5812 * until rcu_assign_pointer(), so it's safe to increment
5815 ++new->current_threshold;
5821 /* Swap primary and spare array */
5822 thresholds->spare = thresholds->primary;
5823 /* If all events are unregistered, free the spare array */
5825 kfree(thresholds->spare);
5826 thresholds->spare = NULL;
5829 rcu_assign_pointer(thresholds->primary, new);
5831 /* To be sure that nobody uses thresholds */
5834 mutex_unlock(&memcg->thresholds_lock);
5837 static void mem_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
5838 struct eventfd_ctx *eventfd)
5840 return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEM);
5843 static void memsw_cgroup_usage_unregister_event(struct mem_cgroup *memcg,
5844 struct eventfd_ctx *eventfd)
5846 return __mem_cgroup_usage_unregister_event(memcg, eventfd, _MEMSWAP);
5849 static int mem_cgroup_oom_register_event(struct mem_cgroup *memcg,
5850 struct eventfd_ctx *eventfd, const char *args)
5852 struct mem_cgroup_eventfd_list *event;
5854 event = kmalloc(sizeof(*event), GFP_KERNEL);
5858 spin_lock(&memcg_oom_lock);
5860 event->eventfd = eventfd;
5861 list_add(&event->list, &memcg->oom_notify);
5863 /* already in OOM ? */
5864 if (atomic_read(&memcg->under_oom))
5865 eventfd_signal(eventfd, 1);
5866 spin_unlock(&memcg_oom_lock);
5871 static void mem_cgroup_oom_unregister_event(struct mem_cgroup *memcg,
5872 struct eventfd_ctx *eventfd)
5874 struct mem_cgroup_eventfd_list *ev, *tmp;
5876 spin_lock(&memcg_oom_lock);
5878 list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) {
5879 if (ev->eventfd == eventfd) {
5880 list_del(&ev->list);
5885 spin_unlock(&memcg_oom_lock);
5888 static int mem_cgroup_oom_control_read(struct seq_file *sf, void *v)
5890 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(sf));
5892 seq_printf(sf, "oom_kill_disable %d\n", memcg->oom_kill_disable);
5893 seq_printf(sf, "under_oom %d\n", (bool)atomic_read(&memcg->under_oom));
5897 static int mem_cgroup_oom_control_write(struct cgroup_subsys_state *css,
5898 struct cftype *cft, u64 val)
5900 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
5901 struct mem_cgroup *parent = mem_cgroup_from_css(css_parent(&memcg->css));
5903 /* cannot set to root cgroup and only 0 and 1 are allowed */
5904 if (!parent || !((val == 0) || (val == 1)))
5907 mutex_lock(&memcg_create_mutex);
5908 /* oom-kill-disable is a flag for subhierarchy. */
5909 if ((parent->use_hierarchy) || memcg_has_children(memcg)) {
5910 mutex_unlock(&memcg_create_mutex);
5913 memcg->oom_kill_disable = val;
5915 memcg_oom_recover(memcg);
5916 mutex_unlock(&memcg_create_mutex);
5920 #ifdef CONFIG_MEMCG_KMEM
5921 static int memcg_init_kmem(struct mem_cgroup *memcg, struct cgroup_subsys *ss)
5925 memcg->kmemcg_id = -1;
5926 ret = memcg_propagate_kmem(memcg);
5930 return mem_cgroup_sockets_init(memcg, ss);
5933 static void memcg_destroy_kmem(struct mem_cgroup *memcg)
5935 mem_cgroup_sockets_destroy(memcg);
5938 static void kmem_cgroup_css_offline(struct mem_cgroup *memcg)
5940 if (!memcg_kmem_is_active(memcg))
5944 * kmem charges can outlive the cgroup. In the case of slab
5945 * pages, for instance, a page contain objects from various
5946 * processes. As we prevent from taking a reference for every
5947 * such allocation we have to be careful when doing uncharge
5948 * (see memcg_uncharge_kmem) and here during offlining.
5950 * The idea is that that only the _last_ uncharge which sees
5951 * the dead memcg will drop the last reference. An additional
5952 * reference is taken here before the group is marked dead
5953 * which is then paired with css_put during uncharge resp. here.
5955 * Although this might sound strange as this path is called from
5956 * css_offline() when the referencemight have dropped down to 0
5957 * and shouldn't be incremented anymore (css_tryget would fail)
5958 * we do not have other options because of the kmem allocations
5961 css_get(&memcg->css);
5963 memcg_kmem_mark_dead(memcg);
5965 if (res_counter_read_u64(&memcg->kmem, RES_USAGE) != 0)
5968 if (memcg_kmem_test_and_clear_dead(memcg))
5969 css_put(&memcg->css);
5972 static int memcg_init_kmem(struct mem_cgroup *memcg, struct cgroup_subsys *ss)
5977 static void memcg_destroy_kmem(struct mem_cgroup *memcg)
5981 static void kmem_cgroup_css_offline(struct mem_cgroup *memcg)
5987 * DO NOT USE IN NEW FILES.
5989 * "cgroup.event_control" implementation.
5991 * This is way over-engineered. It tries to support fully configurable
5992 * events for each user. Such level of flexibility is completely
5993 * unnecessary especially in the light of the planned unified hierarchy.
5995 * Please deprecate this and replace with something simpler if at all
6000 * Unregister event and free resources.
6002 * Gets called from workqueue.
6004 static void memcg_event_remove(struct work_struct *work)
6006 struct mem_cgroup_event *event =
6007 container_of(work, struct mem_cgroup_event, remove);
6008 struct mem_cgroup *memcg = event->memcg;
6010 remove_wait_queue(event->wqh, &event->wait);
6012 event->unregister_event(memcg, event->eventfd);
6014 /* Notify userspace the event is going away. */
6015 eventfd_signal(event->eventfd, 1);
6017 eventfd_ctx_put(event->eventfd);
6019 css_put(&memcg->css);
6023 * Gets called on POLLHUP on eventfd when user closes it.
6025 * Called with wqh->lock held and interrupts disabled.
6027 static int memcg_event_wake(wait_queue_t *wait, unsigned mode,
6028 int sync, void *key)
6030 struct mem_cgroup_event *event =
6031 container_of(wait, struct mem_cgroup_event, wait);
6032 struct mem_cgroup *memcg = event->memcg;
6033 unsigned long flags = (unsigned long)key;
6035 if (flags & POLLHUP) {
6037 * If the event has been detached at cgroup removal, we
6038 * can simply return knowing the other side will cleanup
6041 * We can't race against event freeing since the other
6042 * side will require wqh->lock via remove_wait_queue(),
6045 spin_lock(&memcg->event_list_lock);
6046 if (!list_empty(&event->list)) {
6047 list_del_init(&event->list);
6049 * We are in atomic context, but cgroup_event_remove()
6050 * may sleep, so we have to call it in workqueue.
6052 schedule_work(&event->remove);
6054 spin_unlock(&memcg->event_list_lock);
6060 static void memcg_event_ptable_queue_proc(struct file *file,
6061 wait_queue_head_t *wqh, poll_table *pt)
6063 struct mem_cgroup_event *event =
6064 container_of(pt, struct mem_cgroup_event, pt);
6067 add_wait_queue(wqh, &event->wait);
6071 * DO NOT USE IN NEW FILES.
6073 * Parse input and register new cgroup event handler.
6075 * Input must be in format '<event_fd> <control_fd> <args>'.
6076 * Interpretation of args is defined by control file implementation.
6078 static int memcg_write_event_control(struct cgroup_subsys_state *css,
6079 struct cftype *cft, const char *buffer)
6081 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
6082 struct mem_cgroup_event *event;
6083 struct cgroup_subsys_state *cfile_css;
6084 unsigned int efd, cfd;
6091 efd = simple_strtoul(buffer, &endp, 10);
6096 cfd = simple_strtoul(buffer, &endp, 10);
6097 if ((*endp != ' ') && (*endp != '\0'))
6101 event = kzalloc(sizeof(*event), GFP_KERNEL);
6105 event->memcg = memcg;
6106 INIT_LIST_HEAD(&event->list);
6107 init_poll_funcptr(&event->pt, memcg_event_ptable_queue_proc);
6108 init_waitqueue_func_entry(&event->wait, memcg_event_wake);
6109 INIT_WORK(&event->remove, memcg_event_remove);
6117 event->eventfd = eventfd_ctx_fileget(efile.file);
6118 if (IS_ERR(event->eventfd)) {
6119 ret = PTR_ERR(event->eventfd);
6126 goto out_put_eventfd;
6129 /* the process need read permission on control file */
6130 /* AV: shouldn't we check that it's been opened for read instead? */
6131 ret = inode_permission(file_inode(cfile.file), MAY_READ);
6136 * Determine the event callbacks and set them in @event. This used
6137 * to be done via struct cftype but cgroup core no longer knows
6138 * about these events. The following is crude but the whole thing
6139 * is for compatibility anyway.
6141 * DO NOT ADD NEW FILES.
6143 name = cfile.file->f_dentry->d_name.name;
6145 if (!strcmp(name, "memory.usage_in_bytes")) {
6146 event->register_event = mem_cgroup_usage_register_event;
6147 event->unregister_event = mem_cgroup_usage_unregister_event;
6148 } else if (!strcmp(name, "memory.oom_control")) {
6149 event->register_event = mem_cgroup_oom_register_event;
6150 event->unregister_event = mem_cgroup_oom_unregister_event;
6151 } else if (!strcmp(name, "memory.pressure_level")) {
6152 event->register_event = vmpressure_register_event;
6153 event->unregister_event = vmpressure_unregister_event;
6154 } else if (!strcmp(name, "memory.memsw.usage_in_bytes")) {
6155 event->register_event = memsw_cgroup_usage_register_event;
6156 event->unregister_event = memsw_cgroup_usage_unregister_event;
6163 * Verify @cfile should belong to @css. Also, remaining events are
6164 * automatically removed on cgroup destruction but the removal is
6165 * asynchronous, so take an extra ref on @css.
6170 cfile_css = css_from_dir(cfile.file->f_dentry->d_parent,
6171 &mem_cgroup_subsys);
6172 if (cfile_css == css && css_tryget(css))
6179 ret = event->register_event(memcg, event->eventfd, buffer);
6183 efile.file->f_op->poll(efile.file, &event->pt);
6185 spin_lock(&memcg->event_list_lock);
6186 list_add(&event->list, &memcg->event_list);
6187 spin_unlock(&memcg->event_list_lock);
6199 eventfd_ctx_put(event->eventfd);
6208 static struct cftype mem_cgroup_files[] = {
6210 .name = "usage_in_bytes",
6211 .private = MEMFILE_PRIVATE(_MEM, RES_USAGE),
6212 .read_u64 = mem_cgroup_read_u64,
6215 .name = "max_usage_in_bytes",
6216 .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE),
6217 .trigger = mem_cgroup_reset,
6218 .read_u64 = mem_cgroup_read_u64,
6221 .name = "limit_in_bytes",
6222 .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT),
6223 .write_string = mem_cgroup_write,
6224 .read_u64 = mem_cgroup_read_u64,
6227 .name = "soft_limit_in_bytes",
6228 .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT),
6229 .write_string = mem_cgroup_write,
6230 .read_u64 = mem_cgroup_read_u64,
6234 .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT),
6235 .trigger = mem_cgroup_reset,
6236 .read_u64 = mem_cgroup_read_u64,
6240 .seq_show = memcg_stat_show,
6243 .name = "force_empty",
6244 .trigger = mem_cgroup_force_empty_write,
6247 .name = "use_hierarchy",
6248 .flags = CFTYPE_INSANE,
6249 .write_u64 = mem_cgroup_hierarchy_write,
6250 .read_u64 = mem_cgroup_hierarchy_read,
6253 .name = "cgroup.event_control", /* XXX: for compat */
6254 .write_string = memcg_write_event_control,
6255 .flags = CFTYPE_NO_PREFIX,
6259 .name = "swappiness",
6260 .read_u64 = mem_cgroup_swappiness_read,
6261 .write_u64 = mem_cgroup_swappiness_write,
6264 .name = "move_charge_at_immigrate",
6265 .read_u64 = mem_cgroup_move_charge_read,
6266 .write_u64 = mem_cgroup_move_charge_write,
6269 .name = "oom_control",
6270 .seq_show = mem_cgroup_oom_control_read,
6271 .write_u64 = mem_cgroup_oom_control_write,
6272 .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL),
6275 .name = "pressure_level",
6279 .name = "numa_stat",
6280 .seq_show = memcg_numa_stat_show,
6283 #ifdef CONFIG_MEMCG_KMEM
6285 .name = "kmem.limit_in_bytes",
6286 .private = MEMFILE_PRIVATE(_KMEM, RES_LIMIT),
6287 .write_string = mem_cgroup_write,
6288 .read_u64 = mem_cgroup_read_u64,
6291 .name = "kmem.usage_in_bytes",
6292 .private = MEMFILE_PRIVATE(_KMEM, RES_USAGE),
6293 .read_u64 = mem_cgroup_read_u64,
6296 .name = "kmem.failcnt",
6297 .private = MEMFILE_PRIVATE(_KMEM, RES_FAILCNT),
6298 .trigger = mem_cgroup_reset,
6299 .read_u64 = mem_cgroup_read_u64,
6302 .name = "kmem.max_usage_in_bytes",
6303 .private = MEMFILE_PRIVATE(_KMEM, RES_MAX_USAGE),
6304 .trigger = mem_cgroup_reset,
6305 .read_u64 = mem_cgroup_read_u64,
6307 #ifdef CONFIG_SLABINFO
6309 .name = "kmem.slabinfo",
6310 .seq_show = mem_cgroup_slabinfo_read,
6314 { }, /* terminate */
6317 #ifdef CONFIG_MEMCG_SWAP
6318 static struct cftype memsw_cgroup_files[] = {
6320 .name = "memsw.usage_in_bytes",
6321 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE),
6322 .read_u64 = mem_cgroup_read_u64,
6325 .name = "memsw.max_usage_in_bytes",
6326 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE),
6327 .trigger = mem_cgroup_reset,
6328 .read_u64 = mem_cgroup_read_u64,
6331 .name = "memsw.limit_in_bytes",
6332 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT),
6333 .write_string = mem_cgroup_write,
6334 .read_u64 = mem_cgroup_read_u64,
6337 .name = "memsw.failcnt",
6338 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT),
6339 .trigger = mem_cgroup_reset,
6340 .read_u64 = mem_cgroup_read_u64,
6342 { }, /* terminate */
6345 static int alloc_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node)
6347 struct mem_cgroup_per_node *pn;
6348 struct mem_cgroup_per_zone *mz;
6349 int zone, tmp = node;
6351 * This routine is called against possible nodes.
6352 * But it's BUG to call kmalloc() against offline node.
6354 * TODO: this routine can waste much memory for nodes which will
6355 * never be onlined. It's better to use memory hotplug callback
6358 if (!node_state(node, N_NORMAL_MEMORY))
6360 pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp);
6364 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
6365 mz = &pn->zoneinfo[zone];
6366 lruvec_init(&mz->lruvec);
6367 mz->usage_in_excess = 0;
6368 mz->on_tree = false;
6371 memcg->nodeinfo[node] = pn;
6375 static void free_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node)
6377 kfree(memcg->nodeinfo[node]);
6380 static struct mem_cgroup *mem_cgroup_alloc(void)
6382 struct mem_cgroup *memcg;
6385 size = sizeof(struct mem_cgroup);
6386 size += nr_node_ids * sizeof(struct mem_cgroup_per_node *);
6388 memcg = kzalloc(size, GFP_KERNEL);
6392 memcg->stat = alloc_percpu(struct mem_cgroup_stat_cpu);
6395 spin_lock_init(&memcg->pcp_counter_lock);
6404 * At destroying mem_cgroup, references from swap_cgroup can remain.
6405 * (scanning all at force_empty is too costly...)
6407 * Instead of clearing all references at force_empty, we remember
6408 * the number of reference from swap_cgroup and free mem_cgroup when
6409 * it goes down to 0.
6411 * Removal of cgroup itself succeeds regardless of refs from swap.
6414 static void __mem_cgroup_free(struct mem_cgroup *memcg)
6418 mem_cgroup_remove_from_trees(memcg);
6421 free_mem_cgroup_per_zone_info(memcg, node);
6423 free_percpu(memcg->stat);
6426 * We need to make sure that (at least for now), the jump label
6427 * destruction code runs outside of the cgroup lock. This is because
6428 * get_online_cpus(), which is called from the static_branch update,
6429 * can't be called inside the cgroup_lock. cpusets are the ones
6430 * enforcing this dependency, so if they ever change, we might as well.
6432 * schedule_work() will guarantee this happens. Be careful if you need
6433 * to move this code around, and make sure it is outside
6436 disarm_static_keys(memcg);
6441 * Returns the parent mem_cgroup in memcgroup hierarchy with hierarchy enabled.
6443 struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *memcg)
6445 if (!memcg->res.parent)
6447 return mem_cgroup_from_res_counter(memcg->res.parent, res);
6449 EXPORT_SYMBOL(parent_mem_cgroup);
6451 static void __init mem_cgroup_soft_limit_tree_init(void)
6453 struct mem_cgroup_tree_per_node *rtpn;
6454 struct mem_cgroup_tree_per_zone *rtpz;
6455 int tmp, node, zone;
6457 for_each_node(node) {
6459 if (!node_state(node, N_NORMAL_MEMORY))
6461 rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL, tmp);
6464 soft_limit_tree.rb_tree_per_node[node] = rtpn;
6466 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
6467 rtpz = &rtpn->rb_tree_per_zone[zone];
6468 rtpz->rb_root = RB_ROOT;
6469 spin_lock_init(&rtpz->lock);
6474 static struct cgroup_subsys_state * __ref
6475 mem_cgroup_css_alloc(struct cgroup_subsys_state *parent_css)
6477 struct mem_cgroup *memcg;
6478 long error = -ENOMEM;
6481 memcg = mem_cgroup_alloc();
6483 return ERR_PTR(error);
6486 if (alloc_mem_cgroup_per_zone_info(memcg, node))
6490 if (parent_css == NULL) {
6491 root_mem_cgroup = memcg;
6492 res_counter_init(&memcg->res, NULL);
6493 res_counter_init(&memcg->memsw, NULL);
6494 res_counter_init(&memcg->kmem, NULL);
6497 memcg->last_scanned_node = MAX_NUMNODES;
6498 INIT_LIST_HEAD(&memcg->oom_notify);
6499 memcg->move_charge_at_immigrate = 0;
6500 mutex_init(&memcg->thresholds_lock);
6501 spin_lock_init(&memcg->move_lock);
6502 vmpressure_init(&memcg->vmpressure);
6503 INIT_LIST_HEAD(&memcg->event_list);
6504 spin_lock_init(&memcg->event_list_lock);
6509 __mem_cgroup_free(memcg);
6510 return ERR_PTR(error);
6514 mem_cgroup_css_online(struct cgroup_subsys_state *css)
6516 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
6517 struct mem_cgroup *parent = mem_cgroup_from_css(css_parent(css));
6519 if (css->cgroup->id > MEM_CGROUP_ID_MAX)
6525 mutex_lock(&memcg_create_mutex);
6527 memcg->use_hierarchy = parent->use_hierarchy;
6528 memcg->oom_kill_disable = parent->oom_kill_disable;
6529 memcg->swappiness = mem_cgroup_swappiness(parent);
6531 if (parent->use_hierarchy) {
6532 res_counter_init(&memcg->res, &parent->res);
6533 res_counter_init(&memcg->memsw, &parent->memsw);
6534 res_counter_init(&memcg->kmem, &parent->kmem);
6537 * No need to take a reference to the parent because cgroup
6538 * core guarantees its existence.
6541 res_counter_init(&memcg->res, NULL);
6542 res_counter_init(&memcg->memsw, NULL);
6543 res_counter_init(&memcg->kmem, NULL);
6545 * Deeper hierachy with use_hierarchy == false doesn't make
6546 * much sense so let cgroup subsystem know about this
6547 * unfortunate state in our controller.
6549 if (parent != root_mem_cgroup)
6550 mem_cgroup_subsys.broken_hierarchy = true;
6552 mutex_unlock(&memcg_create_mutex);
6554 return memcg_init_kmem(memcg, &mem_cgroup_subsys);
6558 * Announce all parents that a group from their hierarchy is gone.
6560 static void mem_cgroup_invalidate_reclaim_iterators(struct mem_cgroup *memcg)
6562 struct mem_cgroup *parent = memcg;
6564 while ((parent = parent_mem_cgroup(parent)))
6565 mem_cgroup_iter_invalidate(parent);
6568 * if the root memcg is not hierarchical we have to check it
6571 if (!root_mem_cgroup->use_hierarchy)
6572 mem_cgroup_iter_invalidate(root_mem_cgroup);
6575 static void mem_cgroup_css_offline(struct cgroup_subsys_state *css)
6577 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
6578 struct mem_cgroup_event *event, *tmp;
6581 * Unregister events and notify userspace.
6582 * Notify userspace about cgroup removing only after rmdir of cgroup
6583 * directory to avoid race between userspace and kernelspace.
6585 spin_lock(&memcg->event_list_lock);
6586 list_for_each_entry_safe(event, tmp, &memcg->event_list, list) {
6587 list_del_init(&event->list);
6588 schedule_work(&event->remove);
6590 spin_unlock(&memcg->event_list_lock);
6592 kmem_cgroup_css_offline(memcg);
6594 mem_cgroup_invalidate_reclaim_iterators(memcg);
6595 mem_cgroup_reparent_charges(memcg);
6596 mem_cgroup_destroy_all_caches(memcg);
6597 vmpressure_cleanup(&memcg->vmpressure);
6600 static void mem_cgroup_css_free(struct cgroup_subsys_state *css)
6602 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
6604 * XXX: css_offline() would be where we should reparent all
6605 * memory to prepare the cgroup for destruction. However,
6606 * memcg does not do css_tryget() and res_counter charging
6607 * under the same RCU lock region, which means that charging
6608 * could race with offlining. Offlining only happens to
6609 * cgroups with no tasks in them but charges can show up
6610 * without any tasks from the swapin path when the target
6611 * memcg is looked up from the swapout record and not from the
6612 * current task as it usually is. A race like this can leak
6613 * charges and put pages with stale cgroup pointers into
6617 * lookup_swap_cgroup_id()
6619 * mem_cgroup_lookup()
6622 * disable css_tryget()
6625 * reparent_charges()
6626 * res_counter_charge()
6629 * pc->mem_cgroup = dead memcg
6632 * The bulk of the charges are still moved in offline_css() to
6633 * avoid pinning a lot of pages in case a long-term reference
6634 * like a swapout record is deferring the css_free() to long
6635 * after offlining. But this makes sure we catch any charges
6636 * made after offlining:
6638 mem_cgroup_reparent_charges(memcg);
6640 memcg_destroy_kmem(memcg);
6641 __mem_cgroup_free(memcg);
6645 /* Handlers for move charge at task migration. */
6646 #define PRECHARGE_COUNT_AT_ONCE 256
6647 static int mem_cgroup_do_precharge(unsigned long count)
6650 int batch_count = PRECHARGE_COUNT_AT_ONCE;
6651 struct mem_cgroup *memcg = mc.to;
6653 if (mem_cgroup_is_root(memcg)) {
6654 mc.precharge += count;
6655 /* we don't need css_get for root */
6658 /* try to charge at once */
6660 struct res_counter *dummy;
6662 * "memcg" cannot be under rmdir() because we've already checked
6663 * by cgroup_lock_live_cgroup() that it is not removed and we
6664 * are still under the same cgroup_mutex. So we can postpone
6667 if (res_counter_charge(&memcg->res, PAGE_SIZE * count, &dummy))
6669 if (do_swap_account && res_counter_charge(&memcg->memsw,
6670 PAGE_SIZE * count, &dummy)) {
6671 res_counter_uncharge(&memcg->res, PAGE_SIZE * count);
6674 mc.precharge += count;
6678 /* fall back to one by one charge */
6680 if (signal_pending(current)) {
6684 if (!batch_count--) {
6685 batch_count = PRECHARGE_COUNT_AT_ONCE;
6688 ret = __mem_cgroup_try_charge(NULL,
6689 GFP_KERNEL, 1, &memcg, false);
6691 /* mem_cgroup_clear_mc() will do uncharge later */
6699 * get_mctgt_type - get target type of moving charge
6700 * @vma: the vma the pte to be checked belongs
6701 * @addr: the address corresponding to the pte to be checked
6702 * @ptent: the pte to be checked
6703 * @target: the pointer the target page or swap ent will be stored(can be NULL)
6706 * 0(MC_TARGET_NONE): if the pte is not a target for move charge.
6707 * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for
6708 * move charge. if @target is not NULL, the page is stored in target->page
6709 * with extra refcnt got(Callers should handle it).
6710 * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a
6711 * target for charge migration. if @target is not NULL, the entry is stored
6714 * Called with pte lock held.
6721 enum mc_target_type {
6727 static struct page *mc_handle_present_pte(struct vm_area_struct *vma,
6728 unsigned long addr, pte_t ptent)
6730 struct page *page = vm_normal_page(vma, addr, ptent);
6732 if (!page || !page_mapped(page))
6734 if (PageAnon(page)) {
6735 /* we don't move shared anon */
6738 } else if (!move_file())
6739 /* we ignore mapcount for file pages */
6741 if (!get_page_unless_zero(page))
6748 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
6749 unsigned long addr, pte_t ptent, swp_entry_t *entry)
6751 struct page *page = NULL;
6752 swp_entry_t ent = pte_to_swp_entry(ptent);
6754 if (!move_anon() || non_swap_entry(ent))
6757 * Because lookup_swap_cache() updates some statistics counter,
6758 * we call find_get_page() with swapper_space directly.
6760 page = find_get_page(swap_address_space(ent), ent.val);
6761 if (do_swap_account)
6762 entry->val = ent.val;
6767 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
6768 unsigned long addr, pte_t ptent, swp_entry_t *entry)
6774 static struct page *mc_handle_file_pte(struct vm_area_struct *vma,
6775 unsigned long addr, pte_t ptent, swp_entry_t *entry)
6777 struct page *page = NULL;
6778 struct address_space *mapping;
6781 if (!vma->vm_file) /* anonymous vma */
6786 mapping = vma->vm_file->f_mapping;
6787 if (pte_none(ptent))
6788 pgoff = linear_page_index(vma, addr);
6789 else /* pte_file(ptent) is true */
6790 pgoff = pte_to_pgoff(ptent);
6792 /* page is moved even if it's not RSS of this task(page-faulted). */
6793 page = find_get_page(mapping, pgoff);
6796 /* shmem/tmpfs may report page out on swap: account for that too. */
6797 if (radix_tree_exceptional_entry(page)) {
6798 swp_entry_t swap = radix_to_swp_entry(page);
6799 if (do_swap_account)
6801 page = find_get_page(swap_address_space(swap), swap.val);
6807 static enum mc_target_type get_mctgt_type(struct vm_area_struct *vma,
6808 unsigned long addr, pte_t ptent, union mc_target *target)
6810 struct page *page = NULL;
6811 struct page_cgroup *pc;
6812 enum mc_target_type ret = MC_TARGET_NONE;
6813 swp_entry_t ent = { .val = 0 };
6815 if (pte_present(ptent))
6816 page = mc_handle_present_pte(vma, addr, ptent);
6817 else if (is_swap_pte(ptent))
6818 page = mc_handle_swap_pte(vma, addr, ptent, &ent);
6819 else if (pte_none(ptent) || pte_file(ptent))
6820 page = mc_handle_file_pte(vma, addr, ptent, &ent);
6822 if (!page && !ent.val)
6825 pc = lookup_page_cgroup(page);
6827 * Do only loose check w/o page_cgroup lock.
6828 * mem_cgroup_move_account() checks the pc is valid or not under
6831 if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) {
6832 ret = MC_TARGET_PAGE;
6834 target->page = page;
6836 if (!ret || !target)
6839 /* There is a swap entry and a page doesn't exist or isn't charged */
6840 if (ent.val && !ret &&
6841 mem_cgroup_id(mc.from) == lookup_swap_cgroup_id(ent)) {
6842 ret = MC_TARGET_SWAP;
6849 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
6851 * We don't consider swapping or file mapped pages because THP does not
6852 * support them for now.
6853 * Caller should make sure that pmd_trans_huge(pmd) is true.
6855 static enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
6856 unsigned long addr, pmd_t pmd, union mc_target *target)
6858 struct page *page = NULL;
6859 struct page_cgroup *pc;
6860 enum mc_target_type ret = MC_TARGET_NONE;
6862 page = pmd_page(pmd);
6863 VM_BUG_ON_PAGE(!page || !PageHead(page), page);
6866 pc = lookup_page_cgroup(page);
6867 if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) {
6868 ret = MC_TARGET_PAGE;
6871 target->page = page;
6877 static inline enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
6878 unsigned long addr, pmd_t pmd, union mc_target *target)
6880 return MC_TARGET_NONE;
6884 static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd,
6885 unsigned long addr, unsigned long end,
6886 struct mm_walk *walk)
6888 struct vm_area_struct *vma = walk->private;
6892 if (pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
6893 if (get_mctgt_type_thp(vma, addr, *pmd, NULL) == MC_TARGET_PAGE)
6894 mc.precharge += HPAGE_PMD_NR;
6899 if (pmd_trans_unstable(pmd))
6901 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
6902 for (; addr != end; pte++, addr += PAGE_SIZE)
6903 if (get_mctgt_type(vma, addr, *pte, NULL))
6904 mc.precharge++; /* increment precharge temporarily */
6905 pte_unmap_unlock(pte - 1, ptl);
6911 static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm)
6913 unsigned long precharge;
6914 struct vm_area_struct *vma;
6916 down_read(&mm->mmap_sem);
6917 for (vma = mm->mmap; vma; vma = vma->vm_next) {
6918 struct mm_walk mem_cgroup_count_precharge_walk = {
6919 .pmd_entry = mem_cgroup_count_precharge_pte_range,
6923 if (is_vm_hugetlb_page(vma))
6925 walk_page_range(vma->vm_start, vma->vm_end,
6926 &mem_cgroup_count_precharge_walk);
6928 up_read(&mm->mmap_sem);
6930 precharge = mc.precharge;
6936 static int mem_cgroup_precharge_mc(struct mm_struct *mm)
6938 unsigned long precharge = mem_cgroup_count_precharge(mm);
6940 VM_BUG_ON(mc.moving_task);
6941 mc.moving_task = current;
6942 return mem_cgroup_do_precharge(precharge);
6945 /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */
6946 static void __mem_cgroup_clear_mc(void)
6948 struct mem_cgroup *from = mc.from;
6949 struct mem_cgroup *to = mc.to;
6952 /* we must uncharge all the leftover precharges from mc.to */
6954 __mem_cgroup_cancel_charge(mc.to, mc.precharge);
6958 * we didn't uncharge from mc.from at mem_cgroup_move_account(), so
6959 * we must uncharge here.
6961 if (mc.moved_charge) {
6962 __mem_cgroup_cancel_charge(mc.from, mc.moved_charge);
6963 mc.moved_charge = 0;
6965 /* we must fixup refcnts and charges */
6966 if (mc.moved_swap) {
6967 /* uncharge swap account from the old cgroup */
6968 if (!mem_cgroup_is_root(mc.from))
6969 res_counter_uncharge(&mc.from->memsw,
6970 PAGE_SIZE * mc.moved_swap);
6972 for (i = 0; i < mc.moved_swap; i++)
6973 css_put(&mc.from->css);
6975 if (!mem_cgroup_is_root(mc.to)) {
6977 * we charged both to->res and to->memsw, so we should
6980 res_counter_uncharge(&mc.to->res,
6981 PAGE_SIZE * mc.moved_swap);
6983 /* we've already done css_get(mc.to) */
6986 memcg_oom_recover(from);
6987 memcg_oom_recover(to);
6988 wake_up_all(&mc.waitq);
6991 static void mem_cgroup_clear_mc(void)
6993 struct mem_cgroup *from = mc.from;
6996 * we must clear moving_task before waking up waiters at the end of
6999 mc.moving_task = NULL;
7000 __mem_cgroup_clear_mc();
7001 spin_lock(&mc.lock);
7004 spin_unlock(&mc.lock);
7005 mem_cgroup_end_move(from);
7008 static int mem_cgroup_can_attach(struct cgroup_subsys_state *css,
7009 struct cgroup_taskset *tset)
7011 struct task_struct *p = cgroup_taskset_first(tset);
7013 struct mem_cgroup *memcg = mem_cgroup_from_css(css);
7014 unsigned long move_charge_at_immigrate;
7017 * We are now commited to this value whatever it is. Changes in this
7018 * tunable will only affect upcoming migrations, not the current one.
7019 * So we need to save it, and keep it going.
7021 move_charge_at_immigrate = memcg->move_charge_at_immigrate;
7022 if (move_charge_at_immigrate) {
7023 struct mm_struct *mm;
7024 struct mem_cgroup *from = mem_cgroup_from_task(p);
7026 VM_BUG_ON(from == memcg);
7028 mm = get_task_mm(p);
7031 /* We move charges only when we move a owner of the mm */
7032 if (mm->owner == p) {
7035 VM_BUG_ON(mc.precharge);
7036 VM_BUG_ON(mc.moved_charge);
7037 VM_BUG_ON(mc.moved_swap);
7038 mem_cgroup_start_move(from);
7039 spin_lock(&mc.lock);
7042 mc.immigrate_flags = move_charge_at_immigrate;
7043 spin_unlock(&mc.lock);
7044 /* We set mc.moving_task later */
7046 ret = mem_cgroup_precharge_mc(mm);
7048 mem_cgroup_clear_mc();
7055 static void mem_cgroup_cancel_attach(struct cgroup_subsys_state *css,
7056 struct cgroup_taskset *tset)
7058 mem_cgroup_clear_mc();
7061 static int mem_cgroup_move_charge_pte_range(pmd_t *pmd,
7062 unsigned long addr, unsigned long end,
7063 struct mm_walk *walk)
7066 struct vm_area_struct *vma = walk->private;
7069 enum mc_target_type target_type;
7070 union mc_target target;
7072 struct page_cgroup *pc;
7075 * We don't take compound_lock() here but no race with splitting thp
7077 * - if pmd_trans_huge_lock() returns 1, the relevant thp is not
7078 * under splitting, which means there's no concurrent thp split,
7079 * - if another thread runs into split_huge_page() just after we
7080 * entered this if-block, the thread must wait for page table lock
7081 * to be unlocked in __split_huge_page_splitting(), where the main
7082 * part of thp split is not executed yet.
7084 if (pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
7085 if (mc.precharge < HPAGE_PMD_NR) {
7089 target_type = get_mctgt_type_thp(vma, addr, *pmd, &target);
7090 if (target_type == MC_TARGET_PAGE) {
7092 if (!isolate_lru_page(page)) {
7093 pc = lookup_page_cgroup(page);
7094 if (!mem_cgroup_move_account(page, HPAGE_PMD_NR,
7095 pc, mc.from, mc.to)) {
7096 mc.precharge -= HPAGE_PMD_NR;
7097 mc.moved_charge += HPAGE_PMD_NR;
7099 putback_lru_page(page);
7107 if (pmd_trans_unstable(pmd))
7110 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
7111 for (; addr != end; addr += PAGE_SIZE) {
7112 pte_t ptent = *(pte++);
7118 switch (get_mctgt_type(vma, addr, ptent, &target)) {
7119 case MC_TARGET_PAGE:
7121 if (isolate_lru_page(page))
7123 pc = lookup_page_cgroup(page);
7124 if (!mem_cgroup_move_account(page, 1, pc,
7127 /* we uncharge from mc.from later. */
7130 putback_lru_page(page);
7131 put: /* get_mctgt_type() gets the page */
7134 case MC_TARGET_SWAP:
7136 if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to)) {
7138 /* we fixup refcnts and charges later. */
7146 pte_unmap_unlock(pte - 1, ptl);
7151 * We have consumed all precharges we got in can_attach().
7152 * We try charge one by one, but don't do any additional
7153 * charges to mc.to if we have failed in charge once in attach()
7156 ret = mem_cgroup_do_precharge(1);
7164 static void mem_cgroup_move_charge(struct mm_struct *mm)
7166 struct vm_area_struct *vma;
7168 lru_add_drain_all();
7170 if (unlikely(!down_read_trylock(&mm->mmap_sem))) {
7172 * Someone who are holding the mmap_sem might be waiting in
7173 * waitq. So we cancel all extra charges, wake up all waiters,
7174 * and retry. Because we cancel precharges, we might not be able
7175 * to move enough charges, but moving charge is a best-effort
7176 * feature anyway, so it wouldn't be a big problem.
7178 __mem_cgroup_clear_mc();
7182 for (vma = mm->mmap; vma; vma = vma->vm_next) {
7184 struct mm_walk mem_cgroup_move_charge_walk = {
7185 .pmd_entry = mem_cgroup_move_charge_pte_range,
7189 if (is_vm_hugetlb_page(vma))
7191 ret = walk_page_range(vma->vm_start, vma->vm_end,
7192 &mem_cgroup_move_charge_walk);
7195 * means we have consumed all precharges and failed in
7196 * doing additional charge. Just abandon here.
7200 up_read(&mm->mmap_sem);
7203 static void mem_cgroup_move_task(struct cgroup_subsys_state *css,
7204 struct cgroup_taskset *tset)
7206 struct task_struct *p = cgroup_taskset_first(tset);
7207 struct mm_struct *mm = get_task_mm(p);
7211 mem_cgroup_move_charge(mm);
7215 mem_cgroup_clear_mc();
7217 #else /* !CONFIG_MMU */
7218 static int mem_cgroup_can_attach(struct cgroup_subsys_state *css,
7219 struct cgroup_taskset *tset)
7223 static void mem_cgroup_cancel_attach(struct cgroup_subsys_state *css,
7224 struct cgroup_taskset *tset)
7227 static void mem_cgroup_move_task(struct cgroup_subsys_state *css,
7228 struct cgroup_taskset *tset)
7234 * Cgroup retains root cgroups across [un]mount cycles making it necessary
7235 * to verify sane_behavior flag on each mount attempt.
7237 static void mem_cgroup_bind(struct cgroup_subsys_state *root_css)
7240 * use_hierarchy is forced with sane_behavior. cgroup core
7241 * guarantees that @root doesn't have any children, so turning it
7242 * on for the root memcg is enough.
7244 if (cgroup_sane_behavior(root_css->cgroup))
7245 mem_cgroup_from_css(root_css)->use_hierarchy = true;
7248 struct cgroup_subsys mem_cgroup_subsys = {
7250 .subsys_id = mem_cgroup_subsys_id,
7251 .css_alloc = mem_cgroup_css_alloc,
7252 .css_online = mem_cgroup_css_online,
7253 .css_offline = mem_cgroup_css_offline,
7254 .css_free = mem_cgroup_css_free,
7255 .can_attach = mem_cgroup_can_attach,
7256 .cancel_attach = mem_cgroup_cancel_attach,
7257 .attach = mem_cgroup_move_task,
7258 .bind = mem_cgroup_bind,
7259 .base_cftypes = mem_cgroup_files,
7263 #ifdef CONFIG_MEMCG_SWAP
7264 static int __init enable_swap_account(char *s)
7266 if (!strcmp(s, "1"))
7267 really_do_swap_account = 1;
7268 else if (!strcmp(s, "0"))
7269 really_do_swap_account = 0;
7272 __setup("swapaccount=", enable_swap_account);
7274 static void __init memsw_file_init(void)
7276 WARN_ON(cgroup_add_cftypes(&mem_cgroup_subsys, memsw_cgroup_files));
7279 static void __init enable_swap_cgroup(void)
7281 if (!mem_cgroup_disabled() && really_do_swap_account) {
7282 do_swap_account = 1;
7288 static void __init enable_swap_cgroup(void)
7294 * subsys_initcall() for memory controller.
7296 * Some parts like hotcpu_notifier() have to be initialized from this context
7297 * because of lock dependencies (cgroup_lock -> cpu hotplug) but basically
7298 * everything that doesn't depend on a specific mem_cgroup structure should
7299 * be initialized from here.
7301 static int __init mem_cgroup_init(void)
7303 hotcpu_notifier(memcg_cpu_hotplug_callback, 0);
7304 enable_swap_cgroup();
7305 mem_cgroup_soft_limit_tree_init();
7309 subsys_initcall(mem_cgroup_init);