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/sort.h>
50 #include <linux/seq_file.h>
51 #include <linux/vmalloc.h>
52 #include <linux/mm_inline.h>
53 #include <linux/page_cgroup.h>
54 #include <linux/cpu.h>
55 #include <linux/oom.h>
59 #include <net/tcp_memcontrol.h>
61 #include <asm/uaccess.h>
63 #include <trace/events/vmscan.h>
65 struct cgroup_subsys mem_cgroup_subsys __read_mostly;
66 EXPORT_SYMBOL(mem_cgroup_subsys);
68 #define MEM_CGROUP_RECLAIM_RETRIES 5
69 static struct mem_cgroup *root_mem_cgroup __read_mostly;
71 #ifdef CONFIG_MEMCG_SWAP
72 /* Turned on only when memory cgroup is enabled && really_do_swap_account = 1 */
73 int do_swap_account __read_mostly;
75 /* for remember boot option*/
76 #ifdef CONFIG_MEMCG_SWAP_ENABLED
77 static int really_do_swap_account __initdata = 1;
79 static int really_do_swap_account __initdata = 0;
83 #define do_swap_account 0
88 * Statistics for memory cgroup.
90 enum mem_cgroup_stat_index {
92 * For MEM_CONTAINER_TYPE_ALL, usage = pagecache + rss.
94 MEM_CGROUP_STAT_CACHE, /* # of pages charged as cache */
95 MEM_CGROUP_STAT_RSS, /* # of pages charged as anon rss */
96 MEM_CGROUP_STAT_FILE_MAPPED, /* # of pages charged as file rss */
97 MEM_CGROUP_STAT_SWAP, /* # of pages, swapped out */
98 MEM_CGROUP_STAT_NSTATS,
101 static const char * const mem_cgroup_stat_names[] = {
108 enum mem_cgroup_events_index {
109 MEM_CGROUP_EVENTS_PGPGIN, /* # of pages paged in */
110 MEM_CGROUP_EVENTS_PGPGOUT, /* # of pages paged out */
111 MEM_CGROUP_EVENTS_PGFAULT, /* # of page-faults */
112 MEM_CGROUP_EVENTS_PGMAJFAULT, /* # of major page-faults */
113 MEM_CGROUP_EVENTS_NSTATS,
116 static const char * const mem_cgroup_events_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 {
147 /* css_id of the last scanned hierarchy member */
149 /* scan generation, increased every round-trip */
150 unsigned int generation;
154 * per-zone information in memory controller.
156 struct mem_cgroup_per_zone {
157 struct lruvec lruvec;
158 unsigned long lru_size[NR_LRU_LISTS];
160 struct mem_cgroup_reclaim_iter reclaim_iter[DEF_PRIORITY + 1];
162 struct rb_node tree_node; /* RB tree node */
163 unsigned long long usage_in_excess;/* Set to the value by which */
164 /* the soft limit is exceeded*/
166 struct mem_cgroup *memcg; /* Back pointer, we cannot */
167 /* use container_of */
170 struct mem_cgroup_per_node {
171 struct mem_cgroup_per_zone zoneinfo[MAX_NR_ZONES];
174 struct mem_cgroup_lru_info {
175 struct mem_cgroup_per_node *nodeinfo[MAX_NUMNODES];
179 * Cgroups above their limits are maintained in a RB-Tree, independent of
180 * their hierarchy representation
183 struct mem_cgroup_tree_per_zone {
184 struct rb_root rb_root;
188 struct mem_cgroup_tree_per_node {
189 struct mem_cgroup_tree_per_zone rb_tree_per_zone[MAX_NR_ZONES];
192 struct mem_cgroup_tree {
193 struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES];
196 static struct mem_cgroup_tree soft_limit_tree __read_mostly;
198 struct mem_cgroup_threshold {
199 struct eventfd_ctx *eventfd;
204 struct mem_cgroup_threshold_ary {
205 /* An array index points to threshold just below or equal to usage. */
206 int current_threshold;
207 /* Size of entries[] */
209 /* Array of thresholds */
210 struct mem_cgroup_threshold entries[0];
213 struct mem_cgroup_thresholds {
214 /* Primary thresholds array */
215 struct mem_cgroup_threshold_ary *primary;
217 * Spare threshold array.
218 * This is needed to make mem_cgroup_unregister_event() "never fail".
219 * It must be able to store at least primary->size - 1 entries.
221 struct mem_cgroup_threshold_ary *spare;
225 struct mem_cgroup_eventfd_list {
226 struct list_head list;
227 struct eventfd_ctx *eventfd;
230 static void mem_cgroup_threshold(struct mem_cgroup *memcg);
231 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg);
234 * The memory controller data structure. The memory controller controls both
235 * page cache and RSS per cgroup. We would eventually like to provide
236 * statistics based on the statistics developed by Rik Van Riel for clock-pro,
237 * to help the administrator determine what knobs to tune.
239 * TODO: Add a water mark for the memory controller. Reclaim will begin when
240 * we hit the water mark. May be even add a low water mark, such that
241 * no reclaim occurs from a cgroup at it's low water mark, this is
242 * a feature that will be implemented much later in the future.
245 struct cgroup_subsys_state css;
247 * the counter to account for memory usage
249 struct res_counter res;
253 * the counter to account for mem+swap usage.
255 struct res_counter memsw;
258 * rcu_freeing is used only when freeing struct mem_cgroup,
259 * so put it into a union to avoid wasting more memory.
260 * It must be disjoint from the css field. It could be
261 * in a union with the res field, but res plays a much
262 * larger part in mem_cgroup life than memsw, and might
263 * be of interest, even at time of free, when debugging.
264 * So share rcu_head with the less interesting memsw.
266 struct rcu_head rcu_freeing;
268 * We also need some space for a worker in deferred freeing.
269 * By the time we call it, rcu_freeing is no longer in use.
271 struct work_struct work_freeing;
275 * the counter to account for kernel memory usage.
277 struct res_counter kmem;
279 * Per cgroup active and inactive list, similar to the
280 * per zone LRU lists.
282 struct mem_cgroup_lru_info info;
283 int last_scanned_node;
285 nodemask_t scan_nodes;
286 atomic_t numainfo_events;
287 atomic_t numainfo_updating;
290 * Should the accounting and control be hierarchical, per subtree?
293 unsigned long kmem_account_flags; /* See KMEM_ACCOUNTED_*, below */
301 /* OOM-Killer disable */
302 int oom_kill_disable;
304 /* set when res.limit == memsw.limit */
305 bool memsw_is_minimum;
307 /* protect arrays of thresholds */
308 struct mutex thresholds_lock;
310 /* thresholds for memory usage. RCU-protected */
311 struct mem_cgroup_thresholds thresholds;
313 /* thresholds for mem+swap usage. RCU-protected */
314 struct mem_cgroup_thresholds memsw_thresholds;
316 /* For oom notifier event fd */
317 struct list_head oom_notify;
320 * Should we move charges of a task when a task is moved into this
321 * mem_cgroup ? And what type of charges should we move ?
323 unsigned long move_charge_at_immigrate;
325 * set > 0 if pages under this cgroup are moving to other cgroup.
327 atomic_t moving_account;
328 /* taken only while moving_account > 0 */
329 spinlock_t move_lock;
333 struct mem_cgroup_stat_cpu __percpu *stat;
335 * used when a cpu is offlined or other synchronizations
336 * See mem_cgroup_read_stat().
338 struct mem_cgroup_stat_cpu nocpu_base;
339 spinlock_t pcp_counter_lock;
341 #if defined(CONFIG_MEMCG_KMEM) && defined(CONFIG_INET)
342 struct tcp_memcontrol tcp_mem;
344 #if defined(CONFIG_MEMCG_KMEM)
345 /* analogous to slab_common's slab_caches list. per-memcg */
346 struct list_head memcg_slab_caches;
347 /* Not a spinlock, we can take a lot of time walking the list */
348 struct mutex slab_caches_mutex;
349 /* Index in the kmem_cache->memcg_params->memcg_caches array */
354 /* internal only representation about the status of kmem accounting. */
356 KMEM_ACCOUNTED_ACTIVE = 0, /* accounted by this cgroup itself */
357 KMEM_ACCOUNTED_ACTIVATED, /* static key enabled. */
358 KMEM_ACCOUNTED_DEAD, /* dead memcg with pending kmem charges */
361 /* We account when limit is on, but only after call sites are patched */
362 #define KMEM_ACCOUNTED_MASK \
363 ((1 << KMEM_ACCOUNTED_ACTIVE) | (1 << KMEM_ACCOUNTED_ACTIVATED))
365 #ifdef CONFIG_MEMCG_KMEM
366 static inline void memcg_kmem_set_active(struct mem_cgroup *memcg)
368 set_bit(KMEM_ACCOUNTED_ACTIVE, &memcg->kmem_account_flags);
371 static bool memcg_kmem_is_active(struct mem_cgroup *memcg)
373 return test_bit(KMEM_ACCOUNTED_ACTIVE, &memcg->kmem_account_flags);
376 static void memcg_kmem_set_activated(struct mem_cgroup *memcg)
378 set_bit(KMEM_ACCOUNTED_ACTIVATED, &memcg->kmem_account_flags);
381 static void memcg_kmem_clear_activated(struct mem_cgroup *memcg)
383 clear_bit(KMEM_ACCOUNTED_ACTIVATED, &memcg->kmem_account_flags);
386 static void memcg_kmem_mark_dead(struct mem_cgroup *memcg)
388 if (test_bit(KMEM_ACCOUNTED_ACTIVE, &memcg->kmem_account_flags))
389 set_bit(KMEM_ACCOUNTED_DEAD, &memcg->kmem_account_flags);
392 static bool memcg_kmem_test_and_clear_dead(struct mem_cgroup *memcg)
394 return test_and_clear_bit(KMEM_ACCOUNTED_DEAD,
395 &memcg->kmem_account_flags);
399 /* Stuffs for move charges at task migration. */
401 * Types of charges to be moved. "move_charge_at_immitgrate" is treated as a
402 * left-shifted bitmap of these types.
405 MOVE_CHARGE_TYPE_ANON, /* private anonymous page and swap of it */
406 MOVE_CHARGE_TYPE_FILE, /* file page(including tmpfs) and swap of it */
410 /* "mc" and its members are protected by cgroup_mutex */
411 static struct move_charge_struct {
412 spinlock_t lock; /* for from, to */
413 struct mem_cgroup *from;
414 struct mem_cgroup *to;
415 unsigned long precharge;
416 unsigned long moved_charge;
417 unsigned long moved_swap;
418 struct task_struct *moving_task; /* a task moving charges */
419 wait_queue_head_t waitq; /* a waitq for other context */
421 .lock = __SPIN_LOCK_UNLOCKED(mc.lock),
422 .waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq),
425 static bool move_anon(void)
427 return test_bit(MOVE_CHARGE_TYPE_ANON,
428 &mc.to->move_charge_at_immigrate);
431 static bool move_file(void)
433 return test_bit(MOVE_CHARGE_TYPE_FILE,
434 &mc.to->move_charge_at_immigrate);
438 * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft
439 * limit reclaim to prevent infinite loops, if they ever occur.
441 #define MEM_CGROUP_MAX_RECLAIM_LOOPS 100
442 #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS 2
445 MEM_CGROUP_CHARGE_TYPE_CACHE = 0,
446 MEM_CGROUP_CHARGE_TYPE_ANON,
447 MEM_CGROUP_CHARGE_TYPE_SWAPOUT, /* for accounting swapcache */
448 MEM_CGROUP_CHARGE_TYPE_DROP, /* a page was unused swap cache */
452 /* for encoding cft->private value on file */
460 #define MEMFILE_PRIVATE(x, val) ((x) << 16 | (val))
461 #define MEMFILE_TYPE(val) ((val) >> 16 & 0xffff)
462 #define MEMFILE_ATTR(val) ((val) & 0xffff)
463 /* Used for OOM nofiier */
464 #define OOM_CONTROL (0)
467 * Reclaim flags for mem_cgroup_hierarchical_reclaim
469 #define MEM_CGROUP_RECLAIM_NOSWAP_BIT 0x0
470 #define MEM_CGROUP_RECLAIM_NOSWAP (1 << MEM_CGROUP_RECLAIM_NOSWAP_BIT)
471 #define MEM_CGROUP_RECLAIM_SHRINK_BIT 0x1
472 #define MEM_CGROUP_RECLAIM_SHRINK (1 << MEM_CGROUP_RECLAIM_SHRINK_BIT)
474 static void mem_cgroup_get(struct mem_cgroup *memcg);
475 static void mem_cgroup_put(struct mem_cgroup *memcg);
478 struct mem_cgroup *mem_cgroup_from_css(struct cgroup_subsys_state *s)
480 return container_of(s, struct mem_cgroup, css);
483 static inline bool mem_cgroup_is_root(struct mem_cgroup *memcg)
485 return (memcg == root_mem_cgroup);
488 /* Writing them here to avoid exposing memcg's inner layout */
489 #if defined(CONFIG_INET) && defined(CONFIG_MEMCG_KMEM)
491 void sock_update_memcg(struct sock *sk)
493 if (mem_cgroup_sockets_enabled) {
494 struct mem_cgroup *memcg;
495 struct cg_proto *cg_proto;
497 BUG_ON(!sk->sk_prot->proto_cgroup);
499 /* Socket cloning can throw us here with sk_cgrp already
500 * filled. It won't however, necessarily happen from
501 * process context. So the test for root memcg given
502 * the current task's memcg won't help us in this case.
504 * Respecting the original socket's memcg is a better
505 * decision in this case.
508 BUG_ON(mem_cgroup_is_root(sk->sk_cgrp->memcg));
509 mem_cgroup_get(sk->sk_cgrp->memcg);
514 memcg = mem_cgroup_from_task(current);
515 cg_proto = sk->sk_prot->proto_cgroup(memcg);
516 if (!mem_cgroup_is_root(memcg) && memcg_proto_active(cg_proto)) {
517 mem_cgroup_get(memcg);
518 sk->sk_cgrp = cg_proto;
523 EXPORT_SYMBOL(sock_update_memcg);
525 void sock_release_memcg(struct sock *sk)
527 if (mem_cgroup_sockets_enabled && sk->sk_cgrp) {
528 struct mem_cgroup *memcg;
529 WARN_ON(!sk->sk_cgrp->memcg);
530 memcg = sk->sk_cgrp->memcg;
531 mem_cgroup_put(memcg);
535 struct cg_proto *tcp_proto_cgroup(struct mem_cgroup *memcg)
537 if (!memcg || mem_cgroup_is_root(memcg))
540 return &memcg->tcp_mem.cg_proto;
542 EXPORT_SYMBOL(tcp_proto_cgroup);
544 static void disarm_sock_keys(struct mem_cgroup *memcg)
546 if (!memcg_proto_activated(&memcg->tcp_mem.cg_proto))
548 static_key_slow_dec(&memcg_socket_limit_enabled);
551 static void disarm_sock_keys(struct mem_cgroup *memcg)
556 #ifdef CONFIG_MEMCG_KMEM
558 * This will be the memcg's index in each cache's ->memcg_params->memcg_caches.
559 * There are two main reasons for not using the css_id for this:
560 * 1) this works better in sparse environments, where we have a lot of memcgs,
561 * but only a few kmem-limited. Or also, if we have, for instance, 200
562 * memcgs, and none but the 200th is kmem-limited, we'd have to have a
563 * 200 entry array for that.
565 * 2) In order not to violate the cgroup API, we would like to do all memory
566 * allocation in ->create(). At that point, we haven't yet allocated the
567 * css_id. Having a separate index prevents us from messing with the cgroup
570 * The current size of the caches array is stored in
571 * memcg_limited_groups_array_size. It will double each time we have to
574 static DEFINE_IDA(kmem_limited_groups);
575 static int memcg_limited_groups_array_size;
577 * MIN_SIZE is different than 1, because we would like to avoid going through
578 * the alloc/free process all the time. In a small machine, 4 kmem-limited
579 * cgroups is a reasonable guess. In the future, it could be a parameter or
580 * tunable, but that is strictly not necessary.
582 * MAX_SIZE should be as large as the number of css_ids. Ideally, we could get
583 * this constant directly from cgroup, but it is understandable that this is
584 * better kept as an internal representation in cgroup.c. In any case, the
585 * css_id space is not getting any smaller, and we don't have to necessarily
586 * increase ours as well if it increases.
588 #define MEMCG_CACHES_MIN_SIZE 4
589 #define MEMCG_CACHES_MAX_SIZE 65535
592 * A lot of the calls to the cache allocation functions are expected to be
593 * inlined by the compiler. Since the calls to memcg_kmem_get_cache are
594 * conditional to this static branch, we'll have to allow modules that does
595 * kmem_cache_alloc and the such to see this symbol as well
597 struct static_key memcg_kmem_enabled_key;
598 EXPORT_SYMBOL(memcg_kmem_enabled_key);
600 static void disarm_kmem_keys(struct mem_cgroup *memcg)
602 if (memcg_kmem_is_active(memcg)) {
603 static_key_slow_dec(&memcg_kmem_enabled_key);
604 ida_simple_remove(&kmem_limited_groups, memcg->kmemcg_id);
607 * This check can't live in kmem destruction function,
608 * since the charges will outlive the cgroup
610 WARN_ON(res_counter_read_u64(&memcg->kmem, RES_USAGE) != 0);
613 static void disarm_kmem_keys(struct mem_cgroup *memcg)
616 #endif /* CONFIG_MEMCG_KMEM */
618 static void disarm_static_keys(struct mem_cgroup *memcg)
620 disarm_sock_keys(memcg);
621 disarm_kmem_keys(memcg);
624 static void drain_all_stock_async(struct mem_cgroup *memcg);
626 static struct mem_cgroup_per_zone *
627 mem_cgroup_zoneinfo(struct mem_cgroup *memcg, int nid, int zid)
629 return &memcg->info.nodeinfo[nid]->zoneinfo[zid];
632 struct cgroup_subsys_state *mem_cgroup_css(struct mem_cgroup *memcg)
637 static struct mem_cgroup_per_zone *
638 page_cgroup_zoneinfo(struct mem_cgroup *memcg, struct page *page)
640 int nid = page_to_nid(page);
641 int zid = page_zonenum(page);
643 return mem_cgroup_zoneinfo(memcg, nid, zid);
646 static struct mem_cgroup_tree_per_zone *
647 soft_limit_tree_node_zone(int nid, int zid)
649 return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid];
652 static struct mem_cgroup_tree_per_zone *
653 soft_limit_tree_from_page(struct page *page)
655 int nid = page_to_nid(page);
656 int zid = page_zonenum(page);
658 return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid];
662 __mem_cgroup_insert_exceeded(struct mem_cgroup *memcg,
663 struct mem_cgroup_per_zone *mz,
664 struct mem_cgroup_tree_per_zone *mctz,
665 unsigned long long new_usage_in_excess)
667 struct rb_node **p = &mctz->rb_root.rb_node;
668 struct rb_node *parent = NULL;
669 struct mem_cgroup_per_zone *mz_node;
674 mz->usage_in_excess = new_usage_in_excess;
675 if (!mz->usage_in_excess)
679 mz_node = rb_entry(parent, struct mem_cgroup_per_zone,
681 if (mz->usage_in_excess < mz_node->usage_in_excess)
684 * We can't avoid mem cgroups that are over their soft
685 * limit by the same amount
687 else if (mz->usage_in_excess >= mz_node->usage_in_excess)
690 rb_link_node(&mz->tree_node, parent, p);
691 rb_insert_color(&mz->tree_node, &mctz->rb_root);
696 __mem_cgroup_remove_exceeded(struct mem_cgroup *memcg,
697 struct mem_cgroup_per_zone *mz,
698 struct mem_cgroup_tree_per_zone *mctz)
702 rb_erase(&mz->tree_node, &mctz->rb_root);
707 mem_cgroup_remove_exceeded(struct mem_cgroup *memcg,
708 struct mem_cgroup_per_zone *mz,
709 struct mem_cgroup_tree_per_zone *mctz)
711 spin_lock(&mctz->lock);
712 __mem_cgroup_remove_exceeded(memcg, mz, mctz);
713 spin_unlock(&mctz->lock);
717 static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page)
719 unsigned long long excess;
720 struct mem_cgroup_per_zone *mz;
721 struct mem_cgroup_tree_per_zone *mctz;
722 int nid = page_to_nid(page);
723 int zid = page_zonenum(page);
724 mctz = soft_limit_tree_from_page(page);
727 * Necessary to update all ancestors when hierarchy is used.
728 * because their event counter is not touched.
730 for (; memcg; memcg = parent_mem_cgroup(memcg)) {
731 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
732 excess = res_counter_soft_limit_excess(&memcg->res);
734 * We have to update the tree if mz is on RB-tree or
735 * mem is over its softlimit.
737 if (excess || mz->on_tree) {
738 spin_lock(&mctz->lock);
739 /* if on-tree, remove it */
741 __mem_cgroup_remove_exceeded(memcg, mz, mctz);
743 * Insert again. mz->usage_in_excess will be updated.
744 * If excess is 0, no tree ops.
746 __mem_cgroup_insert_exceeded(memcg, mz, mctz, excess);
747 spin_unlock(&mctz->lock);
752 static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg)
755 struct mem_cgroup_per_zone *mz;
756 struct mem_cgroup_tree_per_zone *mctz;
758 for_each_node(node) {
759 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
760 mz = mem_cgroup_zoneinfo(memcg, node, zone);
761 mctz = soft_limit_tree_node_zone(node, zone);
762 mem_cgroup_remove_exceeded(memcg, mz, mctz);
767 static struct mem_cgroup_per_zone *
768 __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz)
770 struct rb_node *rightmost = NULL;
771 struct mem_cgroup_per_zone *mz;
775 rightmost = rb_last(&mctz->rb_root);
777 goto done; /* Nothing to reclaim from */
779 mz = rb_entry(rightmost, struct mem_cgroup_per_zone, tree_node);
781 * Remove the node now but someone else can add it back,
782 * we will to add it back at the end of reclaim to its correct
783 * position in the tree.
785 __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz);
786 if (!res_counter_soft_limit_excess(&mz->memcg->res) ||
787 !css_tryget(&mz->memcg->css))
793 static struct mem_cgroup_per_zone *
794 mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz)
796 struct mem_cgroup_per_zone *mz;
798 spin_lock(&mctz->lock);
799 mz = __mem_cgroup_largest_soft_limit_node(mctz);
800 spin_unlock(&mctz->lock);
805 * Implementation Note: reading percpu statistics for memcg.
807 * Both of vmstat[] and percpu_counter has threshold and do periodic
808 * synchronization to implement "quick" read. There are trade-off between
809 * reading cost and precision of value. Then, we may have a chance to implement
810 * a periodic synchronizion of counter in memcg's counter.
812 * But this _read() function is used for user interface now. The user accounts
813 * memory usage by memory cgroup and he _always_ requires exact value because
814 * he accounts memory. Even if we provide quick-and-fuzzy read, we always
815 * have to visit all online cpus and make sum. So, for now, unnecessary
816 * synchronization is not implemented. (just implemented for cpu hotplug)
818 * If there are kernel internal actions which can make use of some not-exact
819 * value, and reading all cpu value can be performance bottleneck in some
820 * common workload, threashold and synchonization as vmstat[] should be
823 static long mem_cgroup_read_stat(struct mem_cgroup *memcg,
824 enum mem_cgroup_stat_index idx)
830 for_each_online_cpu(cpu)
831 val += per_cpu(memcg->stat->count[idx], cpu);
832 #ifdef CONFIG_HOTPLUG_CPU
833 spin_lock(&memcg->pcp_counter_lock);
834 val += memcg->nocpu_base.count[idx];
835 spin_unlock(&memcg->pcp_counter_lock);
841 static void mem_cgroup_swap_statistics(struct mem_cgroup *memcg,
844 int val = (charge) ? 1 : -1;
845 this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_SWAP], val);
848 static unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg,
849 enum mem_cgroup_events_index idx)
851 unsigned long val = 0;
854 for_each_online_cpu(cpu)
855 val += per_cpu(memcg->stat->events[idx], cpu);
856 #ifdef CONFIG_HOTPLUG_CPU
857 spin_lock(&memcg->pcp_counter_lock);
858 val += memcg->nocpu_base.events[idx];
859 spin_unlock(&memcg->pcp_counter_lock);
864 static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg,
865 bool anon, int nr_pages)
870 * Here, RSS means 'mapped anon' and anon's SwapCache. Shmem/tmpfs is
871 * counted as CACHE even if it's on ANON LRU.
874 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_RSS],
877 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_CACHE],
880 /* pagein of a big page is an event. So, ignore page size */
882 __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGIN]);
884 __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGOUT]);
885 nr_pages = -nr_pages; /* for event */
888 __this_cpu_add(memcg->stat->nr_page_events, nr_pages);
894 mem_cgroup_get_lru_size(struct lruvec *lruvec, enum lru_list lru)
896 struct mem_cgroup_per_zone *mz;
898 mz = container_of(lruvec, struct mem_cgroup_per_zone, lruvec);
899 return mz->lru_size[lru];
903 mem_cgroup_zone_nr_lru_pages(struct mem_cgroup *memcg, int nid, int zid,
904 unsigned int lru_mask)
906 struct mem_cgroup_per_zone *mz;
908 unsigned long ret = 0;
910 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
913 if (BIT(lru) & lru_mask)
914 ret += mz->lru_size[lru];
920 mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg,
921 int nid, unsigned int lru_mask)
926 for (zid = 0; zid < MAX_NR_ZONES; zid++)
927 total += mem_cgroup_zone_nr_lru_pages(memcg,
933 static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg,
934 unsigned int lru_mask)
939 for_each_node_state(nid, N_MEMORY)
940 total += mem_cgroup_node_nr_lru_pages(memcg, nid, lru_mask);
944 static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg,
945 enum mem_cgroup_events_target target)
947 unsigned long val, next;
949 val = __this_cpu_read(memcg->stat->nr_page_events);
950 next = __this_cpu_read(memcg->stat->targets[target]);
951 /* from time_after() in jiffies.h */
952 if ((long)next - (long)val < 0) {
954 case MEM_CGROUP_TARGET_THRESH:
955 next = val + THRESHOLDS_EVENTS_TARGET;
957 case MEM_CGROUP_TARGET_SOFTLIMIT:
958 next = val + SOFTLIMIT_EVENTS_TARGET;
960 case MEM_CGROUP_TARGET_NUMAINFO:
961 next = val + NUMAINFO_EVENTS_TARGET;
966 __this_cpu_write(memcg->stat->targets[target], next);
973 * Check events in order.
976 static void memcg_check_events(struct mem_cgroup *memcg, struct page *page)
979 /* threshold event is triggered in finer grain than soft limit */
980 if (unlikely(mem_cgroup_event_ratelimit(memcg,
981 MEM_CGROUP_TARGET_THRESH))) {
983 bool do_numainfo __maybe_unused;
985 do_softlimit = mem_cgroup_event_ratelimit(memcg,
986 MEM_CGROUP_TARGET_SOFTLIMIT);
988 do_numainfo = mem_cgroup_event_ratelimit(memcg,
989 MEM_CGROUP_TARGET_NUMAINFO);
993 mem_cgroup_threshold(memcg);
994 if (unlikely(do_softlimit))
995 mem_cgroup_update_tree(memcg, page);
997 if (unlikely(do_numainfo))
998 atomic_inc(&memcg->numainfo_events);
1004 struct mem_cgroup *mem_cgroup_from_cont(struct cgroup *cont)
1006 return mem_cgroup_from_css(
1007 cgroup_subsys_state(cont, mem_cgroup_subsys_id));
1010 struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p)
1013 * mm_update_next_owner() may clear mm->owner to NULL
1014 * if it races with swapoff, page migration, etc.
1015 * So this can be called with p == NULL.
1020 return mem_cgroup_from_css(task_subsys_state(p, mem_cgroup_subsys_id));
1023 struct mem_cgroup *try_get_mem_cgroup_from_mm(struct mm_struct *mm)
1025 struct mem_cgroup *memcg = NULL;
1030 * Because we have no locks, mm->owner's may be being moved to other
1031 * cgroup. We use css_tryget() here even if this looks
1032 * pessimistic (rather than adding locks here).
1036 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
1037 if (unlikely(!memcg))
1039 } while (!css_tryget(&memcg->css));
1045 * mem_cgroup_iter - iterate over memory cgroup hierarchy
1046 * @root: hierarchy root
1047 * @prev: previously returned memcg, NULL on first invocation
1048 * @reclaim: cookie for shared reclaim walks, NULL for full walks
1050 * Returns references to children of the hierarchy below @root, or
1051 * @root itself, or %NULL after a full round-trip.
1053 * Caller must pass the return value in @prev on subsequent
1054 * invocations for reference counting, or use mem_cgroup_iter_break()
1055 * to cancel a hierarchy walk before the round-trip is complete.
1057 * Reclaimers can specify a zone and a priority level in @reclaim to
1058 * divide up the memcgs in the hierarchy among all concurrent
1059 * reclaimers operating on the same zone and priority.
1061 struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root,
1062 struct mem_cgroup *prev,
1063 struct mem_cgroup_reclaim_cookie *reclaim)
1065 struct mem_cgroup *memcg = NULL;
1068 if (mem_cgroup_disabled())
1072 root = root_mem_cgroup;
1074 if (prev && !reclaim)
1075 id = css_id(&prev->css);
1077 if (prev && prev != root)
1078 css_put(&prev->css);
1080 if (!root->use_hierarchy && root != root_mem_cgroup) {
1087 struct mem_cgroup_reclaim_iter *uninitialized_var(iter);
1088 struct cgroup_subsys_state *css;
1091 int nid = zone_to_nid(reclaim->zone);
1092 int zid = zone_idx(reclaim->zone);
1093 struct mem_cgroup_per_zone *mz;
1095 mz = mem_cgroup_zoneinfo(root, nid, zid);
1096 iter = &mz->reclaim_iter[reclaim->priority];
1097 if (prev && reclaim->generation != iter->generation)
1099 id = iter->position;
1103 css = css_get_next(&mem_cgroup_subsys, id + 1, &root->css, &id);
1105 if (css == &root->css || css_tryget(css))
1106 memcg = mem_cgroup_from_css(css);
1112 iter->position = id;
1115 else if (!prev && memcg)
1116 reclaim->generation = iter->generation;
1126 * mem_cgroup_iter_break - abort a hierarchy walk prematurely
1127 * @root: hierarchy root
1128 * @prev: last visited hierarchy member as returned by mem_cgroup_iter()
1130 void mem_cgroup_iter_break(struct mem_cgroup *root,
1131 struct mem_cgroup *prev)
1134 root = root_mem_cgroup;
1135 if (prev && prev != root)
1136 css_put(&prev->css);
1140 * Iteration constructs for visiting all cgroups (under a tree). If
1141 * loops are exited prematurely (break), mem_cgroup_iter_break() must
1142 * be used for reference counting.
1144 #define for_each_mem_cgroup_tree(iter, root) \
1145 for (iter = mem_cgroup_iter(root, NULL, NULL); \
1147 iter = mem_cgroup_iter(root, iter, NULL))
1149 #define for_each_mem_cgroup(iter) \
1150 for (iter = mem_cgroup_iter(NULL, NULL, NULL); \
1152 iter = mem_cgroup_iter(NULL, iter, NULL))
1154 void __mem_cgroup_count_vm_event(struct mm_struct *mm, enum vm_event_item idx)
1156 struct mem_cgroup *memcg;
1159 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
1160 if (unlikely(!memcg))
1165 this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGFAULT]);
1168 this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGMAJFAULT]);
1176 EXPORT_SYMBOL(__mem_cgroup_count_vm_event);
1179 * mem_cgroup_zone_lruvec - get the lru list vector for a zone and memcg
1180 * @zone: zone of the wanted lruvec
1181 * @memcg: memcg of the wanted lruvec
1183 * Returns the lru list vector holding pages for the given @zone and
1184 * @mem. This can be the global zone lruvec, if the memory controller
1187 struct lruvec *mem_cgroup_zone_lruvec(struct zone *zone,
1188 struct mem_cgroup *memcg)
1190 struct mem_cgroup_per_zone *mz;
1191 struct lruvec *lruvec;
1193 if (mem_cgroup_disabled()) {
1194 lruvec = &zone->lruvec;
1198 mz = mem_cgroup_zoneinfo(memcg, zone_to_nid(zone), zone_idx(zone));
1199 lruvec = &mz->lruvec;
1202 * Since a node can be onlined after the mem_cgroup was created,
1203 * we have to be prepared to initialize lruvec->zone here;
1204 * and if offlined then reonlined, we need to reinitialize it.
1206 if (unlikely(lruvec->zone != zone))
1207 lruvec->zone = zone;
1212 * Following LRU functions are allowed to be used without PCG_LOCK.
1213 * Operations are called by routine of global LRU independently from memcg.
1214 * What we have to take care of here is validness of pc->mem_cgroup.
1216 * Changes to pc->mem_cgroup happens when
1219 * In typical case, "charge" is done before add-to-lru. Exception is SwapCache.
1220 * It is added to LRU before charge.
1221 * If PCG_USED bit is not set, page_cgroup is not added to this private LRU.
1222 * When moving account, the page is not on LRU. It's isolated.
1226 * mem_cgroup_page_lruvec - return lruvec for adding an lru page
1228 * @zone: zone of the page
1230 struct lruvec *mem_cgroup_page_lruvec(struct page *page, struct zone *zone)
1232 struct mem_cgroup_per_zone *mz;
1233 struct mem_cgroup *memcg;
1234 struct page_cgroup *pc;
1235 struct lruvec *lruvec;
1237 if (mem_cgroup_disabled()) {
1238 lruvec = &zone->lruvec;
1242 pc = lookup_page_cgroup(page);
1243 memcg = pc->mem_cgroup;
1246 * Surreptitiously switch any uncharged offlist page to root:
1247 * an uncharged page off lru does nothing to secure
1248 * its former mem_cgroup from sudden removal.
1250 * Our caller holds lru_lock, and PageCgroupUsed is updated
1251 * under page_cgroup lock: between them, they make all uses
1252 * of pc->mem_cgroup safe.
1254 if (!PageLRU(page) && !PageCgroupUsed(pc) && memcg != root_mem_cgroup)
1255 pc->mem_cgroup = memcg = root_mem_cgroup;
1257 mz = page_cgroup_zoneinfo(memcg, page);
1258 lruvec = &mz->lruvec;
1261 * Since a node can be onlined after the mem_cgroup was created,
1262 * we have to be prepared to initialize lruvec->zone here;
1263 * and if offlined then reonlined, we need to reinitialize it.
1265 if (unlikely(lruvec->zone != zone))
1266 lruvec->zone = zone;
1271 * mem_cgroup_update_lru_size - account for adding or removing an lru page
1272 * @lruvec: mem_cgroup per zone lru vector
1273 * @lru: index of lru list the page is sitting on
1274 * @nr_pages: positive when adding or negative when removing
1276 * This function must be called when a page is added to or removed from an
1279 void mem_cgroup_update_lru_size(struct lruvec *lruvec, enum lru_list lru,
1282 struct mem_cgroup_per_zone *mz;
1283 unsigned long *lru_size;
1285 if (mem_cgroup_disabled())
1288 mz = container_of(lruvec, struct mem_cgroup_per_zone, lruvec);
1289 lru_size = mz->lru_size + lru;
1290 *lru_size += nr_pages;
1291 VM_BUG_ON((long)(*lru_size) < 0);
1295 * Checks whether given mem is same or in the root_mem_cgroup's
1298 bool __mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg,
1299 struct mem_cgroup *memcg)
1301 if (root_memcg == memcg)
1303 if (!root_memcg->use_hierarchy || !memcg)
1305 return css_is_ancestor(&memcg->css, &root_memcg->css);
1308 static bool mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg,
1309 struct mem_cgroup *memcg)
1314 ret = __mem_cgroup_same_or_subtree(root_memcg, memcg);
1319 int task_in_mem_cgroup(struct task_struct *task, const struct mem_cgroup *memcg)
1322 struct mem_cgroup *curr = NULL;
1323 struct task_struct *p;
1325 p = find_lock_task_mm(task);
1327 curr = try_get_mem_cgroup_from_mm(p->mm);
1331 * All threads may have already detached their mm's, but the oom
1332 * killer still needs to detect if they have already been oom
1333 * killed to prevent needlessly killing additional tasks.
1336 curr = mem_cgroup_from_task(task);
1338 css_get(&curr->css);
1344 * We should check use_hierarchy of "memcg" not "curr". Because checking
1345 * use_hierarchy of "curr" here make this function true if hierarchy is
1346 * enabled in "curr" and "curr" is a child of "memcg" in *cgroup*
1347 * hierarchy(even if use_hierarchy is disabled in "memcg").
1349 ret = mem_cgroup_same_or_subtree(memcg, curr);
1350 css_put(&curr->css);
1354 int mem_cgroup_inactive_anon_is_low(struct lruvec *lruvec)
1356 unsigned long inactive_ratio;
1357 unsigned long inactive;
1358 unsigned long active;
1361 inactive = mem_cgroup_get_lru_size(lruvec, LRU_INACTIVE_ANON);
1362 active = mem_cgroup_get_lru_size(lruvec, LRU_ACTIVE_ANON);
1364 gb = (inactive + active) >> (30 - PAGE_SHIFT);
1366 inactive_ratio = int_sqrt(10 * gb);
1370 return inactive * inactive_ratio < active;
1373 int mem_cgroup_inactive_file_is_low(struct lruvec *lruvec)
1375 unsigned long active;
1376 unsigned long inactive;
1378 inactive = mem_cgroup_get_lru_size(lruvec, LRU_INACTIVE_FILE);
1379 active = mem_cgroup_get_lru_size(lruvec, LRU_ACTIVE_FILE);
1381 return (active > inactive);
1384 #define mem_cgroup_from_res_counter(counter, member) \
1385 container_of(counter, struct mem_cgroup, member)
1388 * mem_cgroup_margin - calculate chargeable space of a memory cgroup
1389 * @memcg: the memory cgroup
1391 * Returns the maximum amount of memory @mem can be charged with, in
1394 static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg)
1396 unsigned long long margin;
1398 margin = res_counter_margin(&memcg->res);
1399 if (do_swap_account)
1400 margin = min(margin, res_counter_margin(&memcg->memsw));
1401 return margin >> PAGE_SHIFT;
1404 int mem_cgroup_swappiness(struct mem_cgroup *memcg)
1406 struct cgroup *cgrp = memcg->css.cgroup;
1409 if (cgrp->parent == NULL)
1410 return vm_swappiness;
1412 return memcg->swappiness;
1416 * memcg->moving_account is used for checking possibility that some thread is
1417 * calling move_account(). When a thread on CPU-A starts moving pages under
1418 * a memcg, other threads should check memcg->moving_account under
1419 * rcu_read_lock(), like this:
1423 * memcg->moving_account+1 if (memcg->mocing_account)
1425 * synchronize_rcu() update something.
1430 /* for quick checking without looking up memcg */
1431 atomic_t memcg_moving __read_mostly;
1433 static void mem_cgroup_start_move(struct mem_cgroup *memcg)
1435 atomic_inc(&memcg_moving);
1436 atomic_inc(&memcg->moving_account);
1440 static void mem_cgroup_end_move(struct mem_cgroup *memcg)
1443 * Now, mem_cgroup_clear_mc() may call this function with NULL.
1444 * We check NULL in callee rather than caller.
1447 atomic_dec(&memcg_moving);
1448 atomic_dec(&memcg->moving_account);
1453 * 2 routines for checking "mem" is under move_account() or not.
1455 * mem_cgroup_stolen() - checking whether a cgroup is mc.from or not. This
1456 * is used for avoiding races in accounting. If true,
1457 * pc->mem_cgroup may be overwritten.
1459 * mem_cgroup_under_move() - checking a cgroup is mc.from or mc.to or
1460 * under hierarchy of moving cgroups. This is for
1461 * waiting at hith-memory prressure caused by "move".
1464 static bool mem_cgroup_stolen(struct mem_cgroup *memcg)
1466 VM_BUG_ON(!rcu_read_lock_held());
1467 return atomic_read(&memcg->moving_account) > 0;
1470 static bool mem_cgroup_under_move(struct mem_cgroup *memcg)
1472 struct mem_cgroup *from;
1473 struct mem_cgroup *to;
1476 * Unlike task_move routines, we access mc.to, mc.from not under
1477 * mutual exclusion by cgroup_mutex. Here, we take spinlock instead.
1479 spin_lock(&mc.lock);
1485 ret = mem_cgroup_same_or_subtree(memcg, from)
1486 || mem_cgroup_same_or_subtree(memcg, to);
1488 spin_unlock(&mc.lock);
1492 static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg)
1494 if (mc.moving_task && current != mc.moving_task) {
1495 if (mem_cgroup_under_move(memcg)) {
1497 prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE);
1498 /* moving charge context might have finished. */
1501 finish_wait(&mc.waitq, &wait);
1509 * Take this lock when
1510 * - a code tries to modify page's memcg while it's USED.
1511 * - a code tries to modify page state accounting in a memcg.
1512 * see mem_cgroup_stolen(), too.
1514 static void move_lock_mem_cgroup(struct mem_cgroup *memcg,
1515 unsigned long *flags)
1517 spin_lock_irqsave(&memcg->move_lock, *flags);
1520 static void move_unlock_mem_cgroup(struct mem_cgroup *memcg,
1521 unsigned long *flags)
1523 spin_unlock_irqrestore(&memcg->move_lock, *flags);
1527 * mem_cgroup_print_oom_info: Called from OOM with tasklist_lock held in read mode.
1528 * @memcg: The memory cgroup that went over limit
1529 * @p: Task that is going to be killed
1531 * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is
1534 void mem_cgroup_print_oom_info(struct mem_cgroup *memcg, struct task_struct *p)
1536 struct cgroup *task_cgrp;
1537 struct cgroup *mem_cgrp;
1539 * Need a buffer in BSS, can't rely on allocations. The code relies
1540 * on the assumption that OOM is serialized for memory controller.
1541 * If this assumption is broken, revisit this code.
1543 static char memcg_name[PATH_MAX];
1551 mem_cgrp = memcg->css.cgroup;
1552 task_cgrp = task_cgroup(p, mem_cgroup_subsys_id);
1554 ret = cgroup_path(task_cgrp, memcg_name, PATH_MAX);
1557 * Unfortunately, we are unable to convert to a useful name
1558 * But we'll still print out the usage information
1565 printk(KERN_INFO "Task in %s killed", memcg_name);
1568 ret = cgroup_path(mem_cgrp, memcg_name, PATH_MAX);
1576 * Continues from above, so we don't need an KERN_ level
1578 printk(KERN_CONT " as a result of limit of %s\n", memcg_name);
1581 printk(KERN_INFO "memory: usage %llukB, limit %llukB, failcnt %llu\n",
1582 res_counter_read_u64(&memcg->res, RES_USAGE) >> 10,
1583 res_counter_read_u64(&memcg->res, RES_LIMIT) >> 10,
1584 res_counter_read_u64(&memcg->res, RES_FAILCNT));
1585 printk(KERN_INFO "memory+swap: usage %llukB, limit %llukB, "
1587 res_counter_read_u64(&memcg->memsw, RES_USAGE) >> 10,
1588 res_counter_read_u64(&memcg->memsw, RES_LIMIT) >> 10,
1589 res_counter_read_u64(&memcg->memsw, RES_FAILCNT));
1590 printk(KERN_INFO "kmem: usage %llukB, limit %llukB, failcnt %llu\n",
1591 res_counter_read_u64(&memcg->kmem, RES_USAGE) >> 10,
1592 res_counter_read_u64(&memcg->kmem, RES_LIMIT) >> 10,
1593 res_counter_read_u64(&memcg->kmem, RES_FAILCNT));
1597 * This function returns the number of memcg under hierarchy tree. Returns
1598 * 1(self count) if no children.
1600 static int mem_cgroup_count_children(struct mem_cgroup *memcg)
1603 struct mem_cgroup *iter;
1605 for_each_mem_cgroup_tree(iter, memcg)
1611 * Return the memory (and swap, if configured) limit for a memcg.
1613 static u64 mem_cgroup_get_limit(struct mem_cgroup *memcg)
1617 limit = res_counter_read_u64(&memcg->res, RES_LIMIT);
1620 * Do not consider swap space if we cannot swap due to swappiness
1622 if (mem_cgroup_swappiness(memcg)) {
1625 limit += total_swap_pages << PAGE_SHIFT;
1626 memsw = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
1629 * If memsw is finite and limits the amount of swap space
1630 * available to this memcg, return that limit.
1632 limit = min(limit, memsw);
1638 static void mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask,
1641 struct mem_cgroup *iter;
1642 unsigned long chosen_points = 0;
1643 unsigned long totalpages;
1644 unsigned int points = 0;
1645 struct task_struct *chosen = NULL;
1648 * If current has a pending SIGKILL, then automatically select it. The
1649 * goal is to allow it to allocate so that it may quickly exit and free
1652 if (fatal_signal_pending(current)) {
1653 set_thread_flag(TIF_MEMDIE);
1657 check_panic_on_oom(CONSTRAINT_MEMCG, gfp_mask, order, NULL);
1658 totalpages = mem_cgroup_get_limit(memcg) >> PAGE_SHIFT ? : 1;
1659 for_each_mem_cgroup_tree(iter, memcg) {
1660 struct cgroup *cgroup = iter->css.cgroup;
1661 struct cgroup_iter it;
1662 struct task_struct *task;
1664 cgroup_iter_start(cgroup, &it);
1665 while ((task = cgroup_iter_next(cgroup, &it))) {
1666 switch (oom_scan_process_thread(task, totalpages, NULL,
1668 case OOM_SCAN_SELECT:
1670 put_task_struct(chosen);
1672 chosen_points = ULONG_MAX;
1673 get_task_struct(chosen);
1675 case OOM_SCAN_CONTINUE:
1677 case OOM_SCAN_ABORT:
1678 cgroup_iter_end(cgroup, &it);
1679 mem_cgroup_iter_break(memcg, iter);
1681 put_task_struct(chosen);
1686 points = oom_badness(task, memcg, NULL, totalpages);
1687 if (points > chosen_points) {
1689 put_task_struct(chosen);
1691 chosen_points = points;
1692 get_task_struct(chosen);
1695 cgroup_iter_end(cgroup, &it);
1700 points = chosen_points * 1000 / totalpages;
1701 oom_kill_process(chosen, gfp_mask, order, points, totalpages, memcg,
1702 NULL, "Memory cgroup out of memory");
1705 static unsigned long mem_cgroup_reclaim(struct mem_cgroup *memcg,
1707 unsigned long flags)
1709 unsigned long total = 0;
1710 bool noswap = false;
1713 if (flags & MEM_CGROUP_RECLAIM_NOSWAP)
1715 if (!(flags & MEM_CGROUP_RECLAIM_SHRINK) && memcg->memsw_is_minimum)
1718 for (loop = 0; loop < MEM_CGROUP_MAX_RECLAIM_LOOPS; loop++) {
1720 drain_all_stock_async(memcg);
1721 total += try_to_free_mem_cgroup_pages(memcg, gfp_mask, noswap);
1723 * Allow limit shrinkers, which are triggered directly
1724 * by userspace, to catch signals and stop reclaim
1725 * after minimal progress, regardless of the margin.
1727 if (total && (flags & MEM_CGROUP_RECLAIM_SHRINK))
1729 if (mem_cgroup_margin(memcg))
1732 * If nothing was reclaimed after two attempts, there
1733 * may be no reclaimable pages in this hierarchy.
1742 * test_mem_cgroup_node_reclaimable
1743 * @memcg: the target memcg
1744 * @nid: the node ID to be checked.
1745 * @noswap : specify true here if the user wants flle only information.
1747 * This function returns whether the specified memcg contains any
1748 * reclaimable pages on a node. Returns true if there are any reclaimable
1749 * pages in the node.
1751 static bool test_mem_cgroup_node_reclaimable(struct mem_cgroup *memcg,
1752 int nid, bool noswap)
1754 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_FILE))
1756 if (noswap || !total_swap_pages)
1758 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_ANON))
1763 #if MAX_NUMNODES > 1
1766 * Always updating the nodemask is not very good - even if we have an empty
1767 * list or the wrong list here, we can start from some node and traverse all
1768 * nodes based on the zonelist. So update the list loosely once per 10 secs.
1771 static void mem_cgroup_may_update_nodemask(struct mem_cgroup *memcg)
1775 * numainfo_events > 0 means there was at least NUMAINFO_EVENTS_TARGET
1776 * pagein/pageout changes since the last update.
1778 if (!atomic_read(&memcg->numainfo_events))
1780 if (atomic_inc_return(&memcg->numainfo_updating) > 1)
1783 /* make a nodemask where this memcg uses memory from */
1784 memcg->scan_nodes = node_states[N_MEMORY];
1786 for_each_node_mask(nid, node_states[N_MEMORY]) {
1788 if (!test_mem_cgroup_node_reclaimable(memcg, nid, false))
1789 node_clear(nid, memcg->scan_nodes);
1792 atomic_set(&memcg->numainfo_events, 0);
1793 atomic_set(&memcg->numainfo_updating, 0);
1797 * Selecting a node where we start reclaim from. Because what we need is just
1798 * reducing usage counter, start from anywhere is O,K. Considering
1799 * memory reclaim from current node, there are pros. and cons.
1801 * Freeing memory from current node means freeing memory from a node which
1802 * we'll use or we've used. So, it may make LRU bad. And if several threads
1803 * hit limits, it will see a contention on a node. But freeing from remote
1804 * node means more costs for memory reclaim because of memory latency.
1806 * Now, we use round-robin. Better algorithm is welcomed.
1808 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1812 mem_cgroup_may_update_nodemask(memcg);
1813 node = memcg->last_scanned_node;
1815 node = next_node(node, memcg->scan_nodes);
1816 if (node == MAX_NUMNODES)
1817 node = first_node(memcg->scan_nodes);
1819 * We call this when we hit limit, not when pages are added to LRU.
1820 * No LRU may hold pages because all pages are UNEVICTABLE or
1821 * memcg is too small and all pages are not on LRU. In that case,
1822 * we use curret node.
1824 if (unlikely(node == MAX_NUMNODES))
1825 node = numa_node_id();
1827 memcg->last_scanned_node = node;
1832 * Check all nodes whether it contains reclaimable pages or not.
1833 * For quick scan, we make use of scan_nodes. This will allow us to skip
1834 * unused nodes. But scan_nodes is lazily updated and may not cotain
1835 * enough new information. We need to do double check.
1837 static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
1842 * quick check...making use of scan_node.
1843 * We can skip unused nodes.
1845 if (!nodes_empty(memcg->scan_nodes)) {
1846 for (nid = first_node(memcg->scan_nodes);
1848 nid = next_node(nid, memcg->scan_nodes)) {
1850 if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
1855 * Check rest of nodes.
1857 for_each_node_state(nid, N_MEMORY) {
1858 if (node_isset(nid, memcg->scan_nodes))
1860 if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
1867 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1872 static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
1874 return test_mem_cgroup_node_reclaimable(memcg, 0, noswap);
1878 static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg,
1881 unsigned long *total_scanned)
1883 struct mem_cgroup *victim = NULL;
1886 unsigned long excess;
1887 unsigned long nr_scanned;
1888 struct mem_cgroup_reclaim_cookie reclaim = {
1893 excess = res_counter_soft_limit_excess(&root_memcg->res) >> PAGE_SHIFT;
1896 victim = mem_cgroup_iter(root_memcg, victim, &reclaim);
1901 * If we have not been able to reclaim
1902 * anything, it might because there are
1903 * no reclaimable pages under this hierarchy
1908 * We want to do more targeted reclaim.
1909 * excess >> 2 is not to excessive so as to
1910 * reclaim too much, nor too less that we keep
1911 * coming back to reclaim from this cgroup
1913 if (total >= (excess >> 2) ||
1914 (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS))
1919 if (!mem_cgroup_reclaimable(victim, false))
1921 total += mem_cgroup_shrink_node_zone(victim, gfp_mask, false,
1923 *total_scanned += nr_scanned;
1924 if (!res_counter_soft_limit_excess(&root_memcg->res))
1927 mem_cgroup_iter_break(root_memcg, victim);
1932 * Check OOM-Killer is already running under our hierarchy.
1933 * If someone is running, return false.
1934 * Has to be called with memcg_oom_lock
1936 static bool mem_cgroup_oom_lock(struct mem_cgroup *memcg)
1938 struct mem_cgroup *iter, *failed = NULL;
1940 for_each_mem_cgroup_tree(iter, memcg) {
1941 if (iter->oom_lock) {
1943 * this subtree of our hierarchy is already locked
1944 * so we cannot give a lock.
1947 mem_cgroup_iter_break(memcg, iter);
1950 iter->oom_lock = true;
1957 * OK, we failed to lock the whole subtree so we have to clean up
1958 * what we set up to the failing subtree
1960 for_each_mem_cgroup_tree(iter, memcg) {
1961 if (iter == failed) {
1962 mem_cgroup_iter_break(memcg, iter);
1965 iter->oom_lock = false;
1971 * Has to be called with memcg_oom_lock
1973 static int mem_cgroup_oom_unlock(struct mem_cgroup *memcg)
1975 struct mem_cgroup *iter;
1977 for_each_mem_cgroup_tree(iter, memcg)
1978 iter->oom_lock = false;
1982 static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg)
1984 struct mem_cgroup *iter;
1986 for_each_mem_cgroup_tree(iter, memcg)
1987 atomic_inc(&iter->under_oom);
1990 static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg)
1992 struct mem_cgroup *iter;
1995 * When a new child is created while the hierarchy is under oom,
1996 * mem_cgroup_oom_lock() may not be called. We have to use
1997 * atomic_add_unless() here.
1999 for_each_mem_cgroup_tree(iter, memcg)
2000 atomic_add_unless(&iter->under_oom, -1, 0);
2003 static DEFINE_SPINLOCK(memcg_oom_lock);
2004 static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq);
2006 struct oom_wait_info {
2007 struct mem_cgroup *memcg;
2011 static int memcg_oom_wake_function(wait_queue_t *wait,
2012 unsigned mode, int sync, void *arg)
2014 struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg;
2015 struct mem_cgroup *oom_wait_memcg;
2016 struct oom_wait_info *oom_wait_info;
2018 oom_wait_info = container_of(wait, struct oom_wait_info, wait);
2019 oom_wait_memcg = oom_wait_info->memcg;
2022 * Both of oom_wait_info->memcg and wake_memcg are stable under us.
2023 * Then we can use css_is_ancestor without taking care of RCU.
2025 if (!mem_cgroup_same_or_subtree(oom_wait_memcg, wake_memcg)
2026 && !mem_cgroup_same_or_subtree(wake_memcg, oom_wait_memcg))
2028 return autoremove_wake_function(wait, mode, sync, arg);
2031 static void memcg_wakeup_oom(struct mem_cgroup *memcg)
2033 /* for filtering, pass "memcg" as argument. */
2034 __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg);
2037 static void memcg_oom_recover(struct mem_cgroup *memcg)
2039 if (memcg && atomic_read(&memcg->under_oom))
2040 memcg_wakeup_oom(memcg);
2044 * try to call OOM killer. returns false if we should exit memory-reclaim loop.
2046 static bool mem_cgroup_handle_oom(struct mem_cgroup *memcg, gfp_t mask,
2049 struct oom_wait_info owait;
2050 bool locked, need_to_kill;
2052 owait.memcg = memcg;
2053 owait.wait.flags = 0;
2054 owait.wait.func = memcg_oom_wake_function;
2055 owait.wait.private = current;
2056 INIT_LIST_HEAD(&owait.wait.task_list);
2057 need_to_kill = true;
2058 mem_cgroup_mark_under_oom(memcg);
2060 /* At first, try to OOM lock hierarchy under memcg.*/
2061 spin_lock(&memcg_oom_lock);
2062 locked = mem_cgroup_oom_lock(memcg);
2064 * Even if signal_pending(), we can't quit charge() loop without
2065 * accounting. So, UNINTERRUPTIBLE is appropriate. But SIGKILL
2066 * under OOM is always welcomed, use TASK_KILLABLE here.
2068 prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE);
2069 if (!locked || memcg->oom_kill_disable)
2070 need_to_kill = false;
2072 mem_cgroup_oom_notify(memcg);
2073 spin_unlock(&memcg_oom_lock);
2076 finish_wait(&memcg_oom_waitq, &owait.wait);
2077 mem_cgroup_out_of_memory(memcg, mask, order);
2080 finish_wait(&memcg_oom_waitq, &owait.wait);
2082 spin_lock(&memcg_oom_lock);
2084 mem_cgroup_oom_unlock(memcg);
2085 memcg_wakeup_oom(memcg);
2086 spin_unlock(&memcg_oom_lock);
2088 mem_cgroup_unmark_under_oom(memcg);
2090 if (test_thread_flag(TIF_MEMDIE) || fatal_signal_pending(current))
2092 /* Give chance to dying process */
2093 schedule_timeout_uninterruptible(1);
2098 * Currently used to update mapped file statistics, but the routine can be
2099 * generalized to update other statistics as well.
2101 * Notes: Race condition
2103 * We usually use page_cgroup_lock() for accessing page_cgroup member but
2104 * it tends to be costly. But considering some conditions, we doesn't need
2105 * to do so _always_.
2107 * Considering "charge", lock_page_cgroup() is not required because all
2108 * file-stat operations happen after a page is attached to radix-tree. There
2109 * are no race with "charge".
2111 * Considering "uncharge", we know that memcg doesn't clear pc->mem_cgroup
2112 * at "uncharge" intentionally. So, we always see valid pc->mem_cgroup even
2113 * if there are race with "uncharge". Statistics itself is properly handled
2116 * Considering "move", this is an only case we see a race. To make the race
2117 * small, we check mm->moving_account and detect there are possibility of race
2118 * If there is, we take a lock.
2121 void __mem_cgroup_begin_update_page_stat(struct page *page,
2122 bool *locked, unsigned long *flags)
2124 struct mem_cgroup *memcg;
2125 struct page_cgroup *pc;
2127 pc = lookup_page_cgroup(page);
2129 memcg = pc->mem_cgroup;
2130 if (unlikely(!memcg || !PageCgroupUsed(pc)))
2133 * If this memory cgroup is not under account moving, we don't
2134 * need to take move_lock_mem_cgroup(). Because we already hold
2135 * rcu_read_lock(), any calls to move_account will be delayed until
2136 * rcu_read_unlock() if mem_cgroup_stolen() == true.
2138 if (!mem_cgroup_stolen(memcg))
2141 move_lock_mem_cgroup(memcg, flags);
2142 if (memcg != pc->mem_cgroup || !PageCgroupUsed(pc)) {
2143 move_unlock_mem_cgroup(memcg, flags);
2149 void __mem_cgroup_end_update_page_stat(struct page *page, unsigned long *flags)
2151 struct page_cgroup *pc = lookup_page_cgroup(page);
2154 * It's guaranteed that pc->mem_cgroup never changes while
2155 * lock is held because a routine modifies pc->mem_cgroup
2156 * should take move_lock_mem_cgroup().
2158 move_unlock_mem_cgroup(pc->mem_cgroup, flags);
2161 void mem_cgroup_update_page_stat(struct page *page,
2162 enum mem_cgroup_page_stat_item idx, int val)
2164 struct mem_cgroup *memcg;
2165 struct page_cgroup *pc = lookup_page_cgroup(page);
2166 unsigned long uninitialized_var(flags);
2168 if (mem_cgroup_disabled())
2171 memcg = pc->mem_cgroup;
2172 if (unlikely(!memcg || !PageCgroupUsed(pc)))
2176 case MEMCG_NR_FILE_MAPPED:
2177 idx = MEM_CGROUP_STAT_FILE_MAPPED;
2183 this_cpu_add(memcg->stat->count[idx], val);
2187 * size of first charge trial. "32" comes from vmscan.c's magic value.
2188 * TODO: maybe necessary to use big numbers in big irons.
2190 #define CHARGE_BATCH 32U
2191 struct memcg_stock_pcp {
2192 struct mem_cgroup *cached; /* this never be root cgroup */
2193 unsigned int nr_pages;
2194 struct work_struct work;
2195 unsigned long flags;
2196 #define FLUSHING_CACHED_CHARGE 0
2198 static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock);
2199 static DEFINE_MUTEX(percpu_charge_mutex);
2202 * consume_stock: Try to consume stocked charge on this cpu.
2203 * @memcg: memcg to consume from.
2204 * @nr_pages: how many pages to charge.
2206 * The charges will only happen if @memcg matches the current cpu's memcg
2207 * stock, and at least @nr_pages are available in that stock. Failure to
2208 * service an allocation will refill the stock.
2210 * returns true if successful, false otherwise.
2212 static bool consume_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2214 struct memcg_stock_pcp *stock;
2217 if (nr_pages > CHARGE_BATCH)
2220 stock = &get_cpu_var(memcg_stock);
2221 if (memcg == stock->cached && stock->nr_pages >= nr_pages)
2222 stock->nr_pages -= nr_pages;
2223 else /* need to call res_counter_charge */
2225 put_cpu_var(memcg_stock);
2230 * Returns stocks cached in percpu to res_counter and reset cached information.
2232 static void drain_stock(struct memcg_stock_pcp *stock)
2234 struct mem_cgroup *old = stock->cached;
2236 if (stock->nr_pages) {
2237 unsigned long bytes = stock->nr_pages * PAGE_SIZE;
2239 res_counter_uncharge(&old->res, bytes);
2240 if (do_swap_account)
2241 res_counter_uncharge(&old->memsw, bytes);
2242 stock->nr_pages = 0;
2244 stock->cached = NULL;
2248 * This must be called under preempt disabled or must be called by
2249 * a thread which is pinned to local cpu.
2251 static void drain_local_stock(struct work_struct *dummy)
2253 struct memcg_stock_pcp *stock = &__get_cpu_var(memcg_stock);
2255 clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags);
2259 * Cache charges(val) which is from res_counter, to local per_cpu area.
2260 * This will be consumed by consume_stock() function, later.
2262 static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2264 struct memcg_stock_pcp *stock = &get_cpu_var(memcg_stock);
2266 if (stock->cached != memcg) { /* reset if necessary */
2268 stock->cached = memcg;
2270 stock->nr_pages += nr_pages;
2271 put_cpu_var(memcg_stock);
2275 * Drains all per-CPU charge caches for given root_memcg resp. subtree
2276 * of the hierarchy under it. sync flag says whether we should block
2277 * until the work is done.
2279 static void drain_all_stock(struct mem_cgroup *root_memcg, bool sync)
2283 /* Notify other cpus that system-wide "drain" is running */
2286 for_each_online_cpu(cpu) {
2287 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2288 struct mem_cgroup *memcg;
2290 memcg = stock->cached;
2291 if (!memcg || !stock->nr_pages)
2293 if (!mem_cgroup_same_or_subtree(root_memcg, memcg))
2295 if (!test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) {
2297 drain_local_stock(&stock->work);
2299 schedule_work_on(cpu, &stock->work);
2307 for_each_online_cpu(cpu) {
2308 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2309 if (test_bit(FLUSHING_CACHED_CHARGE, &stock->flags))
2310 flush_work(&stock->work);
2317 * Tries to drain stocked charges in other cpus. This function is asynchronous
2318 * and just put a work per cpu for draining localy on each cpu. Caller can
2319 * expects some charges will be back to res_counter later but cannot wait for
2322 static void drain_all_stock_async(struct mem_cgroup *root_memcg)
2325 * If someone calls draining, avoid adding more kworker runs.
2327 if (!mutex_trylock(&percpu_charge_mutex))
2329 drain_all_stock(root_memcg, false);
2330 mutex_unlock(&percpu_charge_mutex);
2333 /* This is a synchronous drain interface. */
2334 static void drain_all_stock_sync(struct mem_cgroup *root_memcg)
2336 /* called when force_empty is called */
2337 mutex_lock(&percpu_charge_mutex);
2338 drain_all_stock(root_memcg, true);
2339 mutex_unlock(&percpu_charge_mutex);
2343 * This function drains percpu counter value from DEAD cpu and
2344 * move it to local cpu. Note that this function can be preempted.
2346 static void mem_cgroup_drain_pcp_counter(struct mem_cgroup *memcg, int cpu)
2350 spin_lock(&memcg->pcp_counter_lock);
2351 for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) {
2352 long x = per_cpu(memcg->stat->count[i], cpu);
2354 per_cpu(memcg->stat->count[i], cpu) = 0;
2355 memcg->nocpu_base.count[i] += x;
2357 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) {
2358 unsigned long x = per_cpu(memcg->stat->events[i], cpu);
2360 per_cpu(memcg->stat->events[i], cpu) = 0;
2361 memcg->nocpu_base.events[i] += x;
2363 spin_unlock(&memcg->pcp_counter_lock);
2366 static int __cpuinit memcg_cpu_hotplug_callback(struct notifier_block *nb,
2367 unsigned long action,
2370 int cpu = (unsigned long)hcpu;
2371 struct memcg_stock_pcp *stock;
2372 struct mem_cgroup *iter;
2374 if (action == CPU_ONLINE)
2377 if (action != CPU_DEAD && action != CPU_DEAD_FROZEN)
2380 for_each_mem_cgroup(iter)
2381 mem_cgroup_drain_pcp_counter(iter, cpu);
2383 stock = &per_cpu(memcg_stock, cpu);
2389 /* See __mem_cgroup_try_charge() for details */
2391 CHARGE_OK, /* success */
2392 CHARGE_RETRY, /* need to retry but retry is not bad */
2393 CHARGE_NOMEM, /* we can't do more. return -ENOMEM */
2394 CHARGE_WOULDBLOCK, /* GFP_WAIT wasn't set and no enough res. */
2395 CHARGE_OOM_DIE, /* the current is killed because of OOM */
2398 static int mem_cgroup_do_charge(struct mem_cgroup *memcg, gfp_t gfp_mask,
2399 unsigned int nr_pages, unsigned int min_pages,
2402 unsigned long csize = nr_pages * PAGE_SIZE;
2403 struct mem_cgroup *mem_over_limit;
2404 struct res_counter *fail_res;
2405 unsigned long flags = 0;
2408 ret = res_counter_charge(&memcg->res, csize, &fail_res);
2411 if (!do_swap_account)
2413 ret = res_counter_charge(&memcg->memsw, csize, &fail_res);
2417 res_counter_uncharge(&memcg->res, csize);
2418 mem_over_limit = mem_cgroup_from_res_counter(fail_res, memsw);
2419 flags |= MEM_CGROUP_RECLAIM_NOSWAP;
2421 mem_over_limit = mem_cgroup_from_res_counter(fail_res, res);
2423 * Never reclaim on behalf of optional batching, retry with a
2424 * single page instead.
2426 if (nr_pages > min_pages)
2427 return CHARGE_RETRY;
2429 if (!(gfp_mask & __GFP_WAIT))
2430 return CHARGE_WOULDBLOCK;
2432 if (gfp_mask & __GFP_NORETRY)
2433 return CHARGE_NOMEM;
2435 ret = mem_cgroup_reclaim(mem_over_limit, gfp_mask, flags);
2436 if (mem_cgroup_margin(mem_over_limit) >= nr_pages)
2437 return CHARGE_RETRY;
2439 * Even though the limit is exceeded at this point, reclaim
2440 * may have been able to free some pages. Retry the charge
2441 * before killing the task.
2443 * Only for regular pages, though: huge pages are rather
2444 * unlikely to succeed so close to the limit, and we fall back
2445 * to regular pages anyway in case of failure.
2447 if (nr_pages <= (1 << PAGE_ALLOC_COSTLY_ORDER) && ret)
2448 return CHARGE_RETRY;
2451 * At task move, charge accounts can be doubly counted. So, it's
2452 * better to wait until the end of task_move if something is going on.
2454 if (mem_cgroup_wait_acct_move(mem_over_limit))
2455 return CHARGE_RETRY;
2457 /* If we don't need to call oom-killer at el, return immediately */
2459 return CHARGE_NOMEM;
2461 if (!mem_cgroup_handle_oom(mem_over_limit, gfp_mask, get_order(csize)))
2462 return CHARGE_OOM_DIE;
2464 return CHARGE_RETRY;
2468 * __mem_cgroup_try_charge() does
2469 * 1. detect memcg to be charged against from passed *mm and *ptr,
2470 * 2. update res_counter
2471 * 3. call memory reclaim if necessary.
2473 * In some special case, if the task is fatal, fatal_signal_pending() or
2474 * has TIF_MEMDIE, this function returns -EINTR while writing root_mem_cgroup
2475 * to *ptr. There are two reasons for this. 1: fatal threads should quit as soon
2476 * as possible without any hazards. 2: all pages should have a valid
2477 * pc->mem_cgroup. If mm is NULL and the caller doesn't pass a valid memcg
2478 * pointer, that is treated as a charge to root_mem_cgroup.
2480 * So __mem_cgroup_try_charge() will return
2481 * 0 ... on success, filling *ptr with a valid memcg pointer.
2482 * -ENOMEM ... charge failure because of resource limits.
2483 * -EINTR ... if thread is fatal. *ptr is filled with root_mem_cgroup.
2485 * Unlike the exported interface, an "oom" parameter is added. if oom==true,
2486 * the oom-killer can be invoked.
2488 static int __mem_cgroup_try_charge(struct mm_struct *mm,
2490 unsigned int nr_pages,
2491 struct mem_cgroup **ptr,
2494 unsigned int batch = max(CHARGE_BATCH, nr_pages);
2495 int nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES;
2496 struct mem_cgroup *memcg = NULL;
2500 * Unlike gloval-vm's OOM-kill, we're not in memory shortage
2501 * in system level. So, allow to go ahead dying process in addition to
2504 if (unlikely(test_thread_flag(TIF_MEMDIE)
2505 || fatal_signal_pending(current)))
2509 * We always charge the cgroup the mm_struct belongs to.
2510 * The mm_struct's mem_cgroup changes on task migration if the
2511 * thread group leader migrates. It's possible that mm is not
2512 * set, if so charge the root memcg (happens for pagecache usage).
2515 *ptr = root_mem_cgroup;
2517 if (*ptr) { /* css should be a valid one */
2519 if (mem_cgroup_is_root(memcg))
2521 if (consume_stock(memcg, nr_pages))
2523 css_get(&memcg->css);
2525 struct task_struct *p;
2528 p = rcu_dereference(mm->owner);
2530 * Because we don't have task_lock(), "p" can exit.
2531 * In that case, "memcg" can point to root or p can be NULL with
2532 * race with swapoff. Then, we have small risk of mis-accouning.
2533 * But such kind of mis-account by race always happens because
2534 * we don't have cgroup_mutex(). It's overkill and we allo that
2536 * (*) swapoff at el will charge against mm-struct not against
2537 * task-struct. So, mm->owner can be NULL.
2539 memcg = mem_cgroup_from_task(p);
2541 memcg = root_mem_cgroup;
2542 if (mem_cgroup_is_root(memcg)) {
2546 if (consume_stock(memcg, nr_pages)) {
2548 * It seems dagerous to access memcg without css_get().
2549 * But considering how consume_stok works, it's not
2550 * necessary. If consume_stock success, some charges
2551 * from this memcg are cached on this cpu. So, we
2552 * don't need to call css_get()/css_tryget() before
2553 * calling consume_stock().
2558 /* after here, we may be blocked. we need to get refcnt */
2559 if (!css_tryget(&memcg->css)) {
2569 /* If killed, bypass charge */
2570 if (fatal_signal_pending(current)) {
2571 css_put(&memcg->css);
2576 if (oom && !nr_oom_retries) {
2578 nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES;
2581 ret = mem_cgroup_do_charge(memcg, gfp_mask, batch, nr_pages,
2586 case CHARGE_RETRY: /* not in OOM situation but retry */
2588 css_put(&memcg->css);
2591 case CHARGE_WOULDBLOCK: /* !__GFP_WAIT */
2592 css_put(&memcg->css);
2594 case CHARGE_NOMEM: /* OOM routine works */
2596 css_put(&memcg->css);
2599 /* If oom, we never return -ENOMEM */
2602 case CHARGE_OOM_DIE: /* Killed by OOM Killer */
2603 css_put(&memcg->css);
2606 } while (ret != CHARGE_OK);
2608 if (batch > nr_pages)
2609 refill_stock(memcg, batch - nr_pages);
2610 css_put(&memcg->css);
2618 *ptr = root_mem_cgroup;
2623 * Somemtimes we have to undo a charge we got by try_charge().
2624 * This function is for that and do uncharge, put css's refcnt.
2625 * gotten by try_charge().
2627 static void __mem_cgroup_cancel_charge(struct mem_cgroup *memcg,
2628 unsigned int nr_pages)
2630 if (!mem_cgroup_is_root(memcg)) {
2631 unsigned long bytes = nr_pages * PAGE_SIZE;
2633 res_counter_uncharge(&memcg->res, bytes);
2634 if (do_swap_account)
2635 res_counter_uncharge(&memcg->memsw, bytes);
2640 * Cancel chrages in this cgroup....doesn't propagate to parent cgroup.
2641 * This is useful when moving usage to parent cgroup.
2643 static void __mem_cgroup_cancel_local_charge(struct mem_cgroup *memcg,
2644 unsigned int nr_pages)
2646 unsigned long bytes = nr_pages * PAGE_SIZE;
2648 if (mem_cgroup_is_root(memcg))
2651 res_counter_uncharge_until(&memcg->res, memcg->res.parent, bytes);
2652 if (do_swap_account)
2653 res_counter_uncharge_until(&memcg->memsw,
2654 memcg->memsw.parent, bytes);
2658 * A helper function to get mem_cgroup from ID. must be called under
2659 * rcu_read_lock(). The caller is responsible for calling css_tryget if
2660 * the mem_cgroup is used for charging. (dropping refcnt from swap can be
2661 * called against removed memcg.)
2663 static struct mem_cgroup *mem_cgroup_lookup(unsigned short id)
2665 struct cgroup_subsys_state *css;
2667 /* ID 0 is unused ID */
2670 css = css_lookup(&mem_cgroup_subsys, id);
2673 return mem_cgroup_from_css(css);
2676 struct mem_cgroup *try_get_mem_cgroup_from_page(struct page *page)
2678 struct mem_cgroup *memcg = NULL;
2679 struct page_cgroup *pc;
2683 VM_BUG_ON(!PageLocked(page));
2685 pc = lookup_page_cgroup(page);
2686 lock_page_cgroup(pc);
2687 if (PageCgroupUsed(pc)) {
2688 memcg = pc->mem_cgroup;
2689 if (memcg && !css_tryget(&memcg->css))
2691 } else if (PageSwapCache(page)) {
2692 ent.val = page_private(page);
2693 id = lookup_swap_cgroup_id(ent);
2695 memcg = mem_cgroup_lookup(id);
2696 if (memcg && !css_tryget(&memcg->css))
2700 unlock_page_cgroup(pc);
2704 static void __mem_cgroup_commit_charge(struct mem_cgroup *memcg,
2706 unsigned int nr_pages,
2707 enum charge_type ctype,
2710 struct page_cgroup *pc = lookup_page_cgroup(page);
2711 struct zone *uninitialized_var(zone);
2712 struct lruvec *lruvec;
2713 bool was_on_lru = false;
2716 lock_page_cgroup(pc);
2717 VM_BUG_ON(PageCgroupUsed(pc));
2719 * we don't need page_cgroup_lock about tail pages, becase they are not
2720 * accessed by any other context at this point.
2724 * In some cases, SwapCache and FUSE(splice_buf->radixtree), the page
2725 * may already be on some other mem_cgroup's LRU. Take care of it.
2728 zone = page_zone(page);
2729 spin_lock_irq(&zone->lru_lock);
2730 if (PageLRU(page)) {
2731 lruvec = mem_cgroup_zone_lruvec(zone, pc->mem_cgroup);
2733 del_page_from_lru_list(page, lruvec, page_lru(page));
2738 pc->mem_cgroup = memcg;
2740 * We access a page_cgroup asynchronously without lock_page_cgroup().
2741 * Especially when a page_cgroup is taken from a page, pc->mem_cgroup
2742 * is accessed after testing USED bit. To make pc->mem_cgroup visible
2743 * before USED bit, we need memory barrier here.
2744 * See mem_cgroup_add_lru_list(), etc.
2747 SetPageCgroupUsed(pc);
2751 lruvec = mem_cgroup_zone_lruvec(zone, pc->mem_cgroup);
2752 VM_BUG_ON(PageLRU(page));
2754 add_page_to_lru_list(page, lruvec, page_lru(page));
2756 spin_unlock_irq(&zone->lru_lock);
2759 if (ctype == MEM_CGROUP_CHARGE_TYPE_ANON)
2764 mem_cgroup_charge_statistics(memcg, anon, nr_pages);
2765 unlock_page_cgroup(pc);
2768 * "charge_statistics" updated event counter. Then, check it.
2769 * Insert ancestor (and ancestor's ancestors), to softlimit RB-tree.
2770 * if they exceeds softlimit.
2772 memcg_check_events(memcg, page);
2775 #ifdef CONFIG_MEMCG_KMEM
2776 static inline bool memcg_can_account_kmem(struct mem_cgroup *memcg)
2778 return !mem_cgroup_disabled() && !mem_cgroup_is_root(memcg) &&
2779 (memcg->kmem_account_flags & KMEM_ACCOUNTED_MASK);
2782 static int memcg_charge_kmem(struct mem_cgroup *memcg, gfp_t gfp, u64 size)
2784 struct res_counter *fail_res;
2785 struct mem_cgroup *_memcg;
2789 ret = res_counter_charge(&memcg->kmem, size, &fail_res);
2794 * Conditions under which we can wait for the oom_killer. Those are
2795 * the same conditions tested by the core page allocator
2797 may_oom = (gfp & __GFP_FS) && !(gfp & __GFP_NORETRY);
2800 ret = __mem_cgroup_try_charge(NULL, gfp, size >> PAGE_SHIFT,
2803 if (ret == -EINTR) {
2805 * __mem_cgroup_try_charge() chosed to bypass to root due to
2806 * OOM kill or fatal signal. Since our only options are to
2807 * either fail the allocation or charge it to this cgroup, do
2808 * it as a temporary condition. But we can't fail. From a
2809 * kmem/slab perspective, the cache has already been selected,
2810 * by mem_cgroup_kmem_get_cache(), so it is too late to change
2813 * This condition will only trigger if the task entered
2814 * memcg_charge_kmem in a sane state, but was OOM-killed during
2815 * __mem_cgroup_try_charge() above. Tasks that were already
2816 * dying when the allocation triggers should have been already
2817 * directed to the root cgroup in memcontrol.h
2819 res_counter_charge_nofail(&memcg->res, size, &fail_res);
2820 if (do_swap_account)
2821 res_counter_charge_nofail(&memcg->memsw, size,
2825 res_counter_uncharge(&memcg->kmem, size);
2830 static void memcg_uncharge_kmem(struct mem_cgroup *memcg, u64 size)
2832 res_counter_uncharge(&memcg->res, size);
2833 if (do_swap_account)
2834 res_counter_uncharge(&memcg->memsw, size);
2837 if (res_counter_uncharge(&memcg->kmem, size))
2840 if (memcg_kmem_test_and_clear_dead(memcg))
2841 mem_cgroup_put(memcg);
2844 void memcg_cache_list_add(struct mem_cgroup *memcg, struct kmem_cache *cachep)
2849 mutex_lock(&memcg->slab_caches_mutex);
2850 list_add(&cachep->memcg_params->list, &memcg->memcg_slab_caches);
2851 mutex_unlock(&memcg->slab_caches_mutex);
2855 * helper for acessing a memcg's index. It will be used as an index in the
2856 * child cache array in kmem_cache, and also to derive its name. This function
2857 * will return -1 when this is not a kmem-limited memcg.
2859 int memcg_cache_id(struct mem_cgroup *memcg)
2861 return memcg ? memcg->kmemcg_id : -1;
2865 * This ends up being protected by the set_limit mutex, during normal
2866 * operation, because that is its main call site.
2868 * But when we create a new cache, we can call this as well if its parent
2869 * is kmem-limited. That will have to hold set_limit_mutex as well.
2871 int memcg_update_cache_sizes(struct mem_cgroup *memcg)
2875 num = ida_simple_get(&kmem_limited_groups,
2876 0, MEMCG_CACHES_MAX_SIZE, GFP_KERNEL);
2880 * After this point, kmem_accounted (that we test atomically in
2881 * the beginning of this conditional), is no longer 0. This
2882 * guarantees only one process will set the following boolean
2883 * to true. We don't need test_and_set because we're protected
2884 * by the set_limit_mutex anyway.
2886 memcg_kmem_set_activated(memcg);
2888 ret = memcg_update_all_caches(num+1);
2890 ida_simple_remove(&kmem_limited_groups, num);
2891 memcg_kmem_clear_activated(memcg);
2895 memcg->kmemcg_id = num;
2896 INIT_LIST_HEAD(&memcg->memcg_slab_caches);
2897 mutex_init(&memcg->slab_caches_mutex);
2901 static size_t memcg_caches_array_size(int num_groups)
2904 if (num_groups <= 0)
2907 size = 2 * num_groups;
2908 if (size < MEMCG_CACHES_MIN_SIZE)
2909 size = MEMCG_CACHES_MIN_SIZE;
2910 else if (size > MEMCG_CACHES_MAX_SIZE)
2911 size = MEMCG_CACHES_MAX_SIZE;
2917 * We should update the current array size iff all caches updates succeed. This
2918 * can only be done from the slab side. The slab mutex needs to be held when
2921 void memcg_update_array_size(int num)
2923 if (num > memcg_limited_groups_array_size)
2924 memcg_limited_groups_array_size = memcg_caches_array_size(num);
2927 int memcg_update_cache_size(struct kmem_cache *s, int num_groups)
2929 struct memcg_cache_params *cur_params = s->memcg_params;
2931 VM_BUG_ON(s->memcg_params && !s->memcg_params->is_root_cache);
2933 if (num_groups > memcg_limited_groups_array_size) {
2935 ssize_t size = memcg_caches_array_size(num_groups);
2937 size *= sizeof(void *);
2938 size += sizeof(struct memcg_cache_params);
2940 s->memcg_params = kzalloc(size, GFP_KERNEL);
2941 if (!s->memcg_params) {
2942 s->memcg_params = cur_params;
2946 s->memcg_params->is_root_cache = true;
2949 * There is the chance it will be bigger than
2950 * memcg_limited_groups_array_size, if we failed an allocation
2951 * in a cache, in which case all caches updated before it, will
2952 * have a bigger array.
2954 * But if that is the case, the data after
2955 * memcg_limited_groups_array_size is certainly unused
2957 for (i = 0; i < memcg_limited_groups_array_size; i++) {
2958 if (!cur_params->memcg_caches[i])
2960 s->memcg_params->memcg_caches[i] =
2961 cur_params->memcg_caches[i];
2965 * Ideally, we would wait until all caches succeed, and only
2966 * then free the old one. But this is not worth the extra
2967 * pointer per-cache we'd have to have for this.
2969 * It is not a big deal if some caches are left with a size
2970 * bigger than the others. And all updates will reset this
2978 int memcg_register_cache(struct mem_cgroup *memcg, struct kmem_cache *s)
2980 size_t size = sizeof(struct memcg_cache_params);
2982 if (!memcg_kmem_enabled())
2986 size += memcg_limited_groups_array_size * sizeof(void *);
2988 s->memcg_params = kzalloc(size, GFP_KERNEL);
2989 if (!s->memcg_params)
2993 s->memcg_params->memcg = memcg;
2997 void memcg_release_cache(struct kmem_cache *s)
2999 struct kmem_cache *root;
3000 struct mem_cgroup *memcg;
3004 * This happens, for instance, when a root cache goes away before we
3007 if (!s->memcg_params)
3010 if (s->memcg_params->is_root_cache)
3013 memcg = s->memcg_params->memcg;
3014 id = memcg_cache_id(memcg);
3016 root = s->memcg_params->root_cache;
3017 root->memcg_params->memcg_caches[id] = NULL;
3018 mem_cgroup_put(memcg);
3020 mutex_lock(&memcg->slab_caches_mutex);
3021 list_del(&s->memcg_params->list);
3022 mutex_unlock(&memcg->slab_caches_mutex);
3025 kfree(s->memcg_params);
3029 * During the creation a new cache, we need to disable our accounting mechanism
3030 * altogether. This is true even if we are not creating, but rather just
3031 * enqueing new caches to be created.
3033 * This is because that process will trigger allocations; some visible, like
3034 * explicit kmallocs to auxiliary data structures, name strings and internal
3035 * cache structures; some well concealed, like INIT_WORK() that can allocate
3036 * objects during debug.
3038 * If any allocation happens during memcg_kmem_get_cache, we will recurse back
3039 * to it. This may not be a bounded recursion: since the first cache creation
3040 * failed to complete (waiting on the allocation), we'll just try to create the
3041 * cache again, failing at the same point.
3043 * memcg_kmem_get_cache is prepared to abort after seeing a positive count of
3044 * memcg_kmem_skip_account. So we enclose anything that might allocate memory
3045 * inside the following two functions.
3047 static inline void memcg_stop_kmem_account(void)
3049 VM_BUG_ON(!current->mm);
3050 current->memcg_kmem_skip_account++;
3053 static inline void memcg_resume_kmem_account(void)
3055 VM_BUG_ON(!current->mm);
3056 current->memcg_kmem_skip_account--;
3059 static char *memcg_cache_name(struct mem_cgroup *memcg, struct kmem_cache *s)
3062 struct dentry *dentry;
3065 dentry = rcu_dereference(memcg->css.cgroup->dentry);
3068 BUG_ON(dentry == NULL);
3070 name = kasprintf(GFP_KERNEL, "%s(%d:%s)", s->name,
3071 memcg_cache_id(memcg), dentry->d_name.name);
3076 static struct kmem_cache *kmem_cache_dup(struct mem_cgroup *memcg,
3077 struct kmem_cache *s)
3080 struct kmem_cache *new;
3082 name = memcg_cache_name(memcg, s);
3086 new = kmem_cache_create_memcg(memcg, name, s->object_size, s->align,
3087 (s->flags & ~SLAB_PANIC), s->ctor);
3090 new->allocflags |= __GFP_KMEMCG;
3097 * This lock protects updaters, not readers. We want readers to be as fast as
3098 * they can, and they will either see NULL or a valid cache value. Our model
3099 * allow them to see NULL, in which case the root memcg will be selected.
3101 * We need this lock because multiple allocations to the same cache from a non
3102 * will span more than one worker. Only one of them can create the cache.
3104 static DEFINE_MUTEX(memcg_cache_mutex);
3105 static struct kmem_cache *memcg_create_kmem_cache(struct mem_cgroup *memcg,
3106 struct kmem_cache *cachep)
3108 struct kmem_cache *new_cachep;
3111 BUG_ON(!memcg_can_account_kmem(memcg));
3113 idx = memcg_cache_id(memcg);
3115 mutex_lock(&memcg_cache_mutex);
3116 new_cachep = cachep->memcg_params->memcg_caches[idx];
3120 new_cachep = kmem_cache_dup(memcg, cachep);
3121 if (new_cachep == NULL) {
3122 new_cachep = cachep;
3126 mem_cgroup_get(memcg);
3127 new_cachep->memcg_params->root_cache = cachep;
3129 cachep->memcg_params->memcg_caches[idx] = new_cachep;
3131 * the readers won't lock, make sure everybody sees the updated value,
3132 * so they won't put stuff in the queue again for no reason
3136 mutex_unlock(&memcg_cache_mutex);
3140 struct create_work {
3141 struct mem_cgroup *memcg;
3142 struct kmem_cache *cachep;
3143 struct work_struct work;
3146 static void memcg_create_cache_work_func(struct work_struct *w)
3148 struct create_work *cw;
3150 cw = container_of(w, struct create_work, work);
3151 memcg_create_kmem_cache(cw->memcg, cw->cachep);
3152 /* Drop the reference gotten when we enqueued. */
3153 css_put(&cw->memcg->css);
3158 * Enqueue the creation of a per-memcg kmem_cache.
3159 * Called with rcu_read_lock.
3161 static void __memcg_create_cache_enqueue(struct mem_cgroup *memcg,
3162 struct kmem_cache *cachep)
3164 struct create_work *cw;
3166 cw = kmalloc(sizeof(struct create_work), GFP_NOWAIT);
3170 /* The corresponding put will be done in the workqueue. */
3171 if (!css_tryget(&memcg->css)) {
3177 cw->cachep = cachep;
3179 INIT_WORK(&cw->work, memcg_create_cache_work_func);
3180 schedule_work(&cw->work);
3183 static void memcg_create_cache_enqueue(struct mem_cgroup *memcg,
3184 struct kmem_cache *cachep)
3187 * We need to stop accounting when we kmalloc, because if the
3188 * corresponding kmalloc cache is not yet created, the first allocation
3189 * in __memcg_create_cache_enqueue will recurse.
3191 * However, it is better to enclose the whole function. Depending on
3192 * the debugging options enabled, INIT_WORK(), for instance, can
3193 * trigger an allocation. This too, will make us recurse. Because at
3194 * this point we can't allow ourselves back into memcg_kmem_get_cache,
3195 * the safest choice is to do it like this, wrapping the whole function.
3197 memcg_stop_kmem_account();
3198 __memcg_create_cache_enqueue(memcg, cachep);
3199 memcg_resume_kmem_account();
3202 * Return the kmem_cache we're supposed to use for a slab allocation.
3203 * We try to use the current memcg's version of the cache.
3205 * If the cache does not exist yet, if we are the first user of it,
3206 * we either create it immediately, if possible, or create it asynchronously
3208 * In the latter case, we will let the current allocation go through with
3209 * the original cache.
3211 * Can't be called in interrupt context or from kernel threads.
3212 * This function needs to be called with rcu_read_lock() held.
3214 struct kmem_cache *__memcg_kmem_get_cache(struct kmem_cache *cachep,
3217 struct mem_cgroup *memcg;
3220 VM_BUG_ON(!cachep->memcg_params);
3221 VM_BUG_ON(!cachep->memcg_params->is_root_cache);
3223 if (!current->mm || current->memcg_kmem_skip_account)
3227 memcg = mem_cgroup_from_task(rcu_dereference(current->mm->owner));
3230 if (!memcg_can_account_kmem(memcg))
3233 idx = memcg_cache_id(memcg);
3236 * barrier to mare sure we're always seeing the up to date value. The
3237 * code updating memcg_caches will issue a write barrier to match this.
3239 read_barrier_depends();
3240 if (unlikely(cachep->memcg_params->memcg_caches[idx] == NULL)) {
3242 * If we are in a safe context (can wait, and not in interrupt
3243 * context), we could be be predictable and return right away.
3244 * This would guarantee that the allocation being performed
3245 * already belongs in the new cache.
3247 * However, there are some clashes that can arrive from locking.
3248 * For instance, because we acquire the slab_mutex while doing
3249 * kmem_cache_dup, this means no further allocation could happen
3250 * with the slab_mutex held.
3252 * Also, because cache creation issue get_online_cpus(), this
3253 * creates a lock chain: memcg_slab_mutex -> cpu_hotplug_mutex,
3254 * that ends up reversed during cpu hotplug. (cpuset allocates
3255 * a bunch of GFP_KERNEL memory during cpuup). Due to all that,
3256 * better to defer everything.
3258 memcg_create_cache_enqueue(memcg, cachep);
3262 return cachep->memcg_params->memcg_caches[idx];
3264 EXPORT_SYMBOL(__memcg_kmem_get_cache);
3267 * We need to verify if the allocation against current->mm->owner's memcg is
3268 * possible for the given order. But the page is not allocated yet, so we'll
3269 * need a further commit step to do the final arrangements.
3271 * It is possible for the task to switch cgroups in this mean time, so at
3272 * commit time, we can't rely on task conversion any longer. We'll then use
3273 * the handle argument to return to the caller which cgroup we should commit
3274 * against. We could also return the memcg directly and avoid the pointer
3275 * passing, but a boolean return value gives better semantics considering
3276 * the compiled-out case as well.
3278 * Returning true means the allocation is possible.
3281 __memcg_kmem_newpage_charge(gfp_t gfp, struct mem_cgroup **_memcg, int order)
3283 struct mem_cgroup *memcg;
3287 memcg = try_get_mem_cgroup_from_mm(current->mm);
3290 * very rare case described in mem_cgroup_from_task. Unfortunately there
3291 * isn't much we can do without complicating this too much, and it would
3292 * be gfp-dependent anyway. Just let it go
3294 if (unlikely(!memcg))
3297 if (!memcg_can_account_kmem(memcg)) {
3298 css_put(&memcg->css);
3302 ret = memcg_charge_kmem(memcg, gfp, PAGE_SIZE << order);
3306 css_put(&memcg->css);
3310 void __memcg_kmem_commit_charge(struct page *page, struct mem_cgroup *memcg,
3313 struct page_cgroup *pc;
3315 VM_BUG_ON(mem_cgroup_is_root(memcg));
3317 /* The page allocation failed. Revert */
3319 memcg_uncharge_kmem(memcg, PAGE_SIZE << order);
3323 pc = lookup_page_cgroup(page);
3324 lock_page_cgroup(pc);
3325 pc->mem_cgroup = memcg;
3326 SetPageCgroupUsed(pc);
3327 unlock_page_cgroup(pc);
3330 void __memcg_kmem_uncharge_pages(struct page *page, int order)
3332 struct mem_cgroup *memcg = NULL;
3333 struct page_cgroup *pc;
3336 pc = lookup_page_cgroup(page);
3338 * Fast unlocked return. Theoretically might have changed, have to
3339 * check again after locking.
3341 if (!PageCgroupUsed(pc))
3344 lock_page_cgroup(pc);
3345 if (PageCgroupUsed(pc)) {
3346 memcg = pc->mem_cgroup;
3347 ClearPageCgroupUsed(pc);
3349 unlock_page_cgroup(pc);
3352 * We trust that only if there is a memcg associated with the page, it
3353 * is a valid allocation
3358 VM_BUG_ON(mem_cgroup_is_root(memcg));
3359 memcg_uncharge_kmem(memcg, PAGE_SIZE << order);
3361 #endif /* CONFIG_MEMCG_KMEM */
3363 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
3365 #define PCGF_NOCOPY_AT_SPLIT (1 << PCG_LOCK | 1 << PCG_MIGRATION)
3367 * Because tail pages are not marked as "used", set it. We're under
3368 * zone->lru_lock, 'splitting on pmd' and compound_lock.
3369 * charge/uncharge will be never happen and move_account() is done under
3370 * compound_lock(), so we don't have to take care of races.
3372 void mem_cgroup_split_huge_fixup(struct page *head)
3374 struct page_cgroup *head_pc = lookup_page_cgroup(head);
3375 struct page_cgroup *pc;
3378 if (mem_cgroup_disabled())
3380 for (i = 1; i < HPAGE_PMD_NR; i++) {
3382 pc->mem_cgroup = head_pc->mem_cgroup;
3383 smp_wmb();/* see __commit_charge() */
3384 pc->flags = head_pc->flags & ~PCGF_NOCOPY_AT_SPLIT;
3387 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
3390 * mem_cgroup_move_account - move account of the page
3392 * @nr_pages: number of regular pages (>1 for huge pages)
3393 * @pc: page_cgroup of the page.
3394 * @from: mem_cgroup which the page is moved from.
3395 * @to: mem_cgroup which the page is moved to. @from != @to.
3397 * The caller must confirm following.
3398 * - page is not on LRU (isolate_page() is useful.)
3399 * - compound_lock is held when nr_pages > 1
3401 * This function doesn't do "charge" to new cgroup and doesn't do "uncharge"
3404 static int mem_cgroup_move_account(struct page *page,
3405 unsigned int nr_pages,
3406 struct page_cgroup *pc,
3407 struct mem_cgroup *from,
3408 struct mem_cgroup *to)
3410 unsigned long flags;
3412 bool anon = PageAnon(page);
3414 VM_BUG_ON(from == to);
3415 VM_BUG_ON(PageLRU(page));
3417 * The page is isolated from LRU. So, collapse function
3418 * will not handle this page. But page splitting can happen.
3419 * Do this check under compound_page_lock(). The caller should
3423 if (nr_pages > 1 && !PageTransHuge(page))
3426 lock_page_cgroup(pc);
3429 if (!PageCgroupUsed(pc) || pc->mem_cgroup != from)
3432 move_lock_mem_cgroup(from, &flags);
3434 if (!anon && page_mapped(page)) {
3435 /* Update mapped_file data for mem_cgroup */
3437 __this_cpu_dec(from->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]);
3438 __this_cpu_inc(to->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]);
3441 mem_cgroup_charge_statistics(from, anon, -nr_pages);
3443 /* caller should have done css_get */
3444 pc->mem_cgroup = to;
3445 mem_cgroup_charge_statistics(to, anon, nr_pages);
3446 move_unlock_mem_cgroup(from, &flags);
3449 unlock_page_cgroup(pc);
3453 memcg_check_events(to, page);
3454 memcg_check_events(from, page);
3460 * mem_cgroup_move_parent - moves page to the parent group
3461 * @page: the page to move
3462 * @pc: page_cgroup of the page
3463 * @child: page's cgroup
3465 * move charges to its parent or the root cgroup if the group has no
3466 * parent (aka use_hierarchy==0).
3467 * Although this might fail (get_page_unless_zero, isolate_lru_page or
3468 * mem_cgroup_move_account fails) the failure is always temporary and
3469 * it signals a race with a page removal/uncharge or migration. In the
3470 * first case the page is on the way out and it will vanish from the LRU
3471 * on the next attempt and the call should be retried later.
3472 * Isolation from the LRU fails only if page has been isolated from
3473 * the LRU since we looked at it and that usually means either global
3474 * reclaim or migration going on. The page will either get back to the
3476 * Finaly mem_cgroup_move_account fails only if the page got uncharged
3477 * (!PageCgroupUsed) or moved to a different group. The page will
3478 * disappear in the next attempt.
3480 static int mem_cgroup_move_parent(struct page *page,
3481 struct page_cgroup *pc,
3482 struct mem_cgroup *child)
3484 struct mem_cgroup *parent;
3485 unsigned int nr_pages;
3486 unsigned long uninitialized_var(flags);
3489 VM_BUG_ON(mem_cgroup_is_root(child));
3492 if (!get_page_unless_zero(page))
3494 if (isolate_lru_page(page))
3497 nr_pages = hpage_nr_pages(page);
3499 parent = parent_mem_cgroup(child);
3501 * If no parent, move charges to root cgroup.
3504 parent = root_mem_cgroup;
3507 VM_BUG_ON(!PageTransHuge(page));
3508 flags = compound_lock_irqsave(page);
3511 ret = mem_cgroup_move_account(page, nr_pages,
3514 __mem_cgroup_cancel_local_charge(child, nr_pages);
3517 compound_unlock_irqrestore(page, flags);
3518 putback_lru_page(page);
3526 * Charge the memory controller for page usage.
3528 * 0 if the charge was successful
3529 * < 0 if the cgroup is over its limit
3531 static int mem_cgroup_charge_common(struct page *page, struct mm_struct *mm,
3532 gfp_t gfp_mask, enum charge_type ctype)
3534 struct mem_cgroup *memcg = NULL;
3535 unsigned int nr_pages = 1;
3539 if (PageTransHuge(page)) {
3540 nr_pages <<= compound_order(page);
3541 VM_BUG_ON(!PageTransHuge(page));
3543 * Never OOM-kill a process for a huge page. The
3544 * fault handler will fall back to regular pages.
3549 ret = __mem_cgroup_try_charge(mm, gfp_mask, nr_pages, &memcg, oom);
3552 __mem_cgroup_commit_charge(memcg, page, nr_pages, ctype, false);
3556 int mem_cgroup_newpage_charge(struct page *page,
3557 struct mm_struct *mm, gfp_t gfp_mask)
3559 if (mem_cgroup_disabled())
3561 VM_BUG_ON(page_mapped(page));
3562 VM_BUG_ON(page->mapping && !PageAnon(page));
3564 return mem_cgroup_charge_common(page, mm, gfp_mask,
3565 MEM_CGROUP_CHARGE_TYPE_ANON);
3569 * While swap-in, try_charge -> commit or cancel, the page is locked.
3570 * And when try_charge() successfully returns, one refcnt to memcg without
3571 * struct page_cgroup is acquired. This refcnt will be consumed by
3572 * "commit()" or removed by "cancel()"
3574 static int __mem_cgroup_try_charge_swapin(struct mm_struct *mm,
3577 struct mem_cgroup **memcgp)
3579 struct mem_cgroup *memcg;
3580 struct page_cgroup *pc;
3583 pc = lookup_page_cgroup(page);
3585 * Every swap fault against a single page tries to charge the
3586 * page, bail as early as possible. shmem_unuse() encounters
3587 * already charged pages, too. The USED bit is protected by
3588 * the page lock, which serializes swap cache removal, which
3589 * in turn serializes uncharging.
3591 if (PageCgroupUsed(pc))
3593 if (!do_swap_account)
3595 memcg = try_get_mem_cgroup_from_page(page);
3599 ret = __mem_cgroup_try_charge(NULL, mask, 1, memcgp, true);
3600 css_put(&memcg->css);
3605 ret = __mem_cgroup_try_charge(mm, mask, 1, memcgp, true);
3611 int mem_cgroup_try_charge_swapin(struct mm_struct *mm, struct page *page,
3612 gfp_t gfp_mask, struct mem_cgroup **memcgp)
3615 if (mem_cgroup_disabled())
3618 * A racing thread's fault, or swapoff, may have already
3619 * updated the pte, and even removed page from swap cache: in
3620 * those cases unuse_pte()'s pte_same() test will fail; but
3621 * there's also a KSM case which does need to charge the page.
3623 if (!PageSwapCache(page)) {
3626 ret = __mem_cgroup_try_charge(mm, gfp_mask, 1, memcgp, true);
3631 return __mem_cgroup_try_charge_swapin(mm, page, gfp_mask, memcgp);
3634 void mem_cgroup_cancel_charge_swapin(struct mem_cgroup *memcg)
3636 if (mem_cgroup_disabled())
3640 __mem_cgroup_cancel_charge(memcg, 1);
3644 __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *memcg,
3645 enum charge_type ctype)
3647 if (mem_cgroup_disabled())
3652 __mem_cgroup_commit_charge(memcg, page, 1, ctype, true);
3654 * Now swap is on-memory. This means this page may be
3655 * counted both as mem and swap....double count.
3656 * Fix it by uncharging from memsw. Basically, this SwapCache is stable
3657 * under lock_page(). But in do_swap_page()::memory.c, reuse_swap_page()
3658 * may call delete_from_swap_cache() before reach here.
3660 if (do_swap_account && PageSwapCache(page)) {
3661 swp_entry_t ent = {.val = page_private(page)};
3662 mem_cgroup_uncharge_swap(ent);
3666 void mem_cgroup_commit_charge_swapin(struct page *page,
3667 struct mem_cgroup *memcg)
3669 __mem_cgroup_commit_charge_swapin(page, memcg,
3670 MEM_CGROUP_CHARGE_TYPE_ANON);
3673 int mem_cgroup_cache_charge(struct page *page, struct mm_struct *mm,
3676 struct mem_cgroup *memcg = NULL;
3677 enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE;
3680 if (mem_cgroup_disabled())
3682 if (PageCompound(page))
3685 if (!PageSwapCache(page))
3686 ret = mem_cgroup_charge_common(page, mm, gfp_mask, type);
3687 else { /* page is swapcache/shmem */
3688 ret = __mem_cgroup_try_charge_swapin(mm, page,
3691 __mem_cgroup_commit_charge_swapin(page, memcg, type);
3696 static void mem_cgroup_do_uncharge(struct mem_cgroup *memcg,
3697 unsigned int nr_pages,
3698 const enum charge_type ctype)
3700 struct memcg_batch_info *batch = NULL;
3701 bool uncharge_memsw = true;
3703 /* If swapout, usage of swap doesn't decrease */
3704 if (!do_swap_account || ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT)
3705 uncharge_memsw = false;
3707 batch = ¤t->memcg_batch;
3709 * In usual, we do css_get() when we remember memcg pointer.
3710 * But in this case, we keep res->usage until end of a series of
3711 * uncharges. Then, it's ok to ignore memcg's refcnt.
3714 batch->memcg = memcg;
3716 * do_batch > 0 when unmapping pages or inode invalidate/truncate.
3717 * In those cases, all pages freed continuously can be expected to be in
3718 * the same cgroup and we have chance to coalesce uncharges.
3719 * But we do uncharge one by one if this is killed by OOM(TIF_MEMDIE)
3720 * because we want to do uncharge as soon as possible.
3723 if (!batch->do_batch || test_thread_flag(TIF_MEMDIE))
3724 goto direct_uncharge;
3727 goto direct_uncharge;
3730 * In typical case, batch->memcg == mem. This means we can
3731 * merge a series of uncharges to an uncharge of res_counter.
3732 * If not, we uncharge res_counter ony by one.
3734 if (batch->memcg != memcg)
3735 goto direct_uncharge;
3736 /* remember freed charge and uncharge it later */
3739 batch->memsw_nr_pages++;
3742 res_counter_uncharge(&memcg->res, nr_pages * PAGE_SIZE);
3744 res_counter_uncharge(&memcg->memsw, nr_pages * PAGE_SIZE);
3745 if (unlikely(batch->memcg != memcg))
3746 memcg_oom_recover(memcg);
3750 * uncharge if !page_mapped(page)
3752 static struct mem_cgroup *
3753 __mem_cgroup_uncharge_common(struct page *page, enum charge_type ctype,
3756 struct mem_cgroup *memcg = NULL;
3757 unsigned int nr_pages = 1;
3758 struct page_cgroup *pc;
3761 if (mem_cgroup_disabled())
3764 VM_BUG_ON(PageSwapCache(page));
3766 if (PageTransHuge(page)) {
3767 nr_pages <<= compound_order(page);
3768 VM_BUG_ON(!PageTransHuge(page));
3771 * Check if our page_cgroup is valid
3773 pc = lookup_page_cgroup(page);
3774 if (unlikely(!PageCgroupUsed(pc)))
3777 lock_page_cgroup(pc);
3779 memcg = pc->mem_cgroup;
3781 if (!PageCgroupUsed(pc))
3784 anon = PageAnon(page);
3787 case MEM_CGROUP_CHARGE_TYPE_ANON:
3789 * Generally PageAnon tells if it's the anon statistics to be
3790 * updated; but sometimes e.g. mem_cgroup_uncharge_page() is
3791 * used before page reached the stage of being marked PageAnon.
3795 case MEM_CGROUP_CHARGE_TYPE_DROP:
3796 /* See mem_cgroup_prepare_migration() */
3797 if (page_mapped(page))
3800 * Pages under migration may not be uncharged. But
3801 * end_migration() /must/ be the one uncharging the
3802 * unused post-migration page and so it has to call
3803 * here with the migration bit still set. See the
3804 * res_counter handling below.
3806 if (!end_migration && PageCgroupMigration(pc))
3809 case MEM_CGROUP_CHARGE_TYPE_SWAPOUT:
3810 if (!PageAnon(page)) { /* Shared memory */
3811 if (page->mapping && !page_is_file_cache(page))
3813 } else if (page_mapped(page)) /* Anon */
3820 mem_cgroup_charge_statistics(memcg, anon, -nr_pages);
3822 ClearPageCgroupUsed(pc);
3824 * pc->mem_cgroup is not cleared here. It will be accessed when it's
3825 * freed from LRU. This is safe because uncharged page is expected not
3826 * to be reused (freed soon). Exception is SwapCache, it's handled by
3827 * special functions.
3830 unlock_page_cgroup(pc);
3832 * even after unlock, we have memcg->res.usage here and this memcg
3833 * will never be freed.
3835 memcg_check_events(memcg, page);
3836 if (do_swap_account && ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) {
3837 mem_cgroup_swap_statistics(memcg, true);
3838 mem_cgroup_get(memcg);
3841 * Migration does not charge the res_counter for the
3842 * replacement page, so leave it alone when phasing out the
3843 * page that is unused after the migration.
3845 if (!end_migration && !mem_cgroup_is_root(memcg))
3846 mem_cgroup_do_uncharge(memcg, nr_pages, ctype);
3851 unlock_page_cgroup(pc);
3855 void mem_cgroup_uncharge_page(struct page *page)
3858 if (page_mapped(page))
3860 VM_BUG_ON(page->mapping && !PageAnon(page));
3861 if (PageSwapCache(page))
3863 __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_ANON, false);
3866 void mem_cgroup_uncharge_cache_page(struct page *page)
3868 VM_BUG_ON(page_mapped(page));
3869 VM_BUG_ON(page->mapping);
3870 __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_CACHE, false);
3874 * Batch_start/batch_end is called in unmap_page_range/invlidate/trucate.
3875 * In that cases, pages are freed continuously and we can expect pages
3876 * are in the same memcg. All these calls itself limits the number of
3877 * pages freed at once, then uncharge_start/end() is called properly.
3878 * This may be called prural(2) times in a context,
3881 void mem_cgroup_uncharge_start(void)
3883 current->memcg_batch.do_batch++;
3884 /* We can do nest. */
3885 if (current->memcg_batch.do_batch == 1) {
3886 current->memcg_batch.memcg = NULL;
3887 current->memcg_batch.nr_pages = 0;
3888 current->memcg_batch.memsw_nr_pages = 0;
3892 void mem_cgroup_uncharge_end(void)
3894 struct memcg_batch_info *batch = ¤t->memcg_batch;
3896 if (!batch->do_batch)
3900 if (batch->do_batch) /* If stacked, do nothing. */
3906 * This "batch->memcg" is valid without any css_get/put etc...
3907 * bacause we hide charges behind us.
3909 if (batch->nr_pages)
3910 res_counter_uncharge(&batch->memcg->res,
3911 batch->nr_pages * PAGE_SIZE);
3912 if (batch->memsw_nr_pages)
3913 res_counter_uncharge(&batch->memcg->memsw,
3914 batch->memsw_nr_pages * PAGE_SIZE);
3915 memcg_oom_recover(batch->memcg);
3916 /* forget this pointer (for sanity check) */
3917 batch->memcg = NULL;
3922 * called after __delete_from_swap_cache() and drop "page" account.
3923 * memcg information is recorded to swap_cgroup of "ent"
3926 mem_cgroup_uncharge_swapcache(struct page *page, swp_entry_t ent, bool swapout)
3928 struct mem_cgroup *memcg;
3929 int ctype = MEM_CGROUP_CHARGE_TYPE_SWAPOUT;
3931 if (!swapout) /* this was a swap cache but the swap is unused ! */
3932 ctype = MEM_CGROUP_CHARGE_TYPE_DROP;
3934 memcg = __mem_cgroup_uncharge_common(page, ctype, false);
3937 * record memcg information, if swapout && memcg != NULL,
3938 * mem_cgroup_get() was called in uncharge().
3940 if (do_swap_account && swapout && memcg)
3941 swap_cgroup_record(ent, css_id(&memcg->css));
3945 #ifdef CONFIG_MEMCG_SWAP
3947 * called from swap_entry_free(). remove record in swap_cgroup and
3948 * uncharge "memsw" account.
3950 void mem_cgroup_uncharge_swap(swp_entry_t ent)
3952 struct mem_cgroup *memcg;
3955 if (!do_swap_account)
3958 id = swap_cgroup_record(ent, 0);
3960 memcg = mem_cgroup_lookup(id);
3963 * We uncharge this because swap is freed.
3964 * This memcg can be obsolete one. We avoid calling css_tryget
3966 if (!mem_cgroup_is_root(memcg))
3967 res_counter_uncharge(&memcg->memsw, PAGE_SIZE);
3968 mem_cgroup_swap_statistics(memcg, false);
3969 mem_cgroup_put(memcg);
3975 * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record.
3976 * @entry: swap entry to be moved
3977 * @from: mem_cgroup which the entry is moved from
3978 * @to: mem_cgroup which the entry is moved to
3980 * It succeeds only when the swap_cgroup's record for this entry is the same
3981 * as the mem_cgroup's id of @from.
3983 * Returns 0 on success, -EINVAL on failure.
3985 * The caller must have charged to @to, IOW, called res_counter_charge() about
3986 * both res and memsw, and called css_get().
3988 static int mem_cgroup_move_swap_account(swp_entry_t entry,
3989 struct mem_cgroup *from, struct mem_cgroup *to)
3991 unsigned short old_id, new_id;
3993 old_id = css_id(&from->css);
3994 new_id = css_id(&to->css);
3996 if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) {
3997 mem_cgroup_swap_statistics(from, false);
3998 mem_cgroup_swap_statistics(to, true);
4000 * This function is only called from task migration context now.
4001 * It postpones res_counter and refcount handling till the end
4002 * of task migration(mem_cgroup_clear_mc()) for performance
4003 * improvement. But we cannot postpone mem_cgroup_get(to)
4004 * because if the process that has been moved to @to does
4005 * swap-in, the refcount of @to might be decreased to 0.
4013 static inline int mem_cgroup_move_swap_account(swp_entry_t entry,
4014 struct mem_cgroup *from, struct mem_cgroup *to)
4021 * Before starting migration, account PAGE_SIZE to mem_cgroup that the old
4024 void mem_cgroup_prepare_migration(struct page *page, struct page *newpage,
4025 struct mem_cgroup **memcgp)
4027 struct mem_cgroup *memcg = NULL;
4028 unsigned int nr_pages = 1;
4029 struct page_cgroup *pc;
4030 enum charge_type ctype;
4034 if (mem_cgroup_disabled())
4037 if (PageTransHuge(page))
4038 nr_pages <<= compound_order(page);
4040 pc = lookup_page_cgroup(page);
4041 lock_page_cgroup(pc);
4042 if (PageCgroupUsed(pc)) {
4043 memcg = pc->mem_cgroup;
4044 css_get(&memcg->css);
4046 * At migrating an anonymous page, its mapcount goes down
4047 * to 0 and uncharge() will be called. But, even if it's fully
4048 * unmapped, migration may fail and this page has to be
4049 * charged again. We set MIGRATION flag here and delay uncharge
4050 * until end_migration() is called
4052 * Corner Case Thinking
4054 * When the old page was mapped as Anon and it's unmap-and-freed
4055 * while migration was ongoing.
4056 * If unmap finds the old page, uncharge() of it will be delayed
4057 * until end_migration(). If unmap finds a new page, it's
4058 * uncharged when it make mapcount to be 1->0. If unmap code
4059 * finds swap_migration_entry, the new page will not be mapped
4060 * and end_migration() will find it(mapcount==0).
4063 * When the old page was mapped but migraion fails, the kernel
4064 * remaps it. A charge for it is kept by MIGRATION flag even
4065 * if mapcount goes down to 0. We can do remap successfully
4066 * without charging it again.
4069 * The "old" page is under lock_page() until the end of
4070 * migration, so, the old page itself will not be swapped-out.
4071 * If the new page is swapped out before end_migraton, our
4072 * hook to usual swap-out path will catch the event.
4075 SetPageCgroupMigration(pc);
4077 unlock_page_cgroup(pc);
4079 * If the page is not charged at this point,
4087 * We charge new page before it's used/mapped. So, even if unlock_page()
4088 * is called before end_migration, we can catch all events on this new
4089 * page. In the case new page is migrated but not remapped, new page's
4090 * mapcount will be finally 0 and we call uncharge in end_migration().
4093 ctype = MEM_CGROUP_CHARGE_TYPE_ANON;
4095 ctype = MEM_CGROUP_CHARGE_TYPE_CACHE;
4097 * The page is committed to the memcg, but it's not actually
4098 * charged to the res_counter since we plan on replacing the
4099 * old one and only one page is going to be left afterwards.
4101 __mem_cgroup_commit_charge(memcg, newpage, nr_pages, ctype, false);
4104 /* remove redundant charge if migration failed*/
4105 void mem_cgroup_end_migration(struct mem_cgroup *memcg,
4106 struct page *oldpage, struct page *newpage, bool migration_ok)
4108 struct page *used, *unused;
4109 struct page_cgroup *pc;
4115 if (!migration_ok) {
4122 anon = PageAnon(used);
4123 __mem_cgroup_uncharge_common(unused,
4124 anon ? MEM_CGROUP_CHARGE_TYPE_ANON
4125 : MEM_CGROUP_CHARGE_TYPE_CACHE,
4127 css_put(&memcg->css);
4129 * We disallowed uncharge of pages under migration because mapcount
4130 * of the page goes down to zero, temporarly.
4131 * Clear the flag and check the page should be charged.
4133 pc = lookup_page_cgroup(oldpage);
4134 lock_page_cgroup(pc);
4135 ClearPageCgroupMigration(pc);
4136 unlock_page_cgroup(pc);
4139 * If a page is a file cache, radix-tree replacement is very atomic
4140 * and we can skip this check. When it was an Anon page, its mapcount
4141 * goes down to 0. But because we added MIGRATION flage, it's not
4142 * uncharged yet. There are several case but page->mapcount check
4143 * and USED bit check in mem_cgroup_uncharge_page() will do enough
4144 * check. (see prepare_charge() also)
4147 mem_cgroup_uncharge_page(used);
4151 * At replace page cache, newpage is not under any memcg but it's on
4152 * LRU. So, this function doesn't touch res_counter but handles LRU
4153 * in correct way. Both pages are locked so we cannot race with uncharge.
4155 void mem_cgroup_replace_page_cache(struct page *oldpage,
4156 struct page *newpage)
4158 struct mem_cgroup *memcg = NULL;
4159 struct page_cgroup *pc;
4160 enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE;
4162 if (mem_cgroup_disabled())
4165 pc = lookup_page_cgroup(oldpage);
4166 /* fix accounting on old pages */
4167 lock_page_cgroup(pc);
4168 if (PageCgroupUsed(pc)) {
4169 memcg = pc->mem_cgroup;
4170 mem_cgroup_charge_statistics(memcg, false, -1);
4171 ClearPageCgroupUsed(pc);
4173 unlock_page_cgroup(pc);
4176 * When called from shmem_replace_page(), in some cases the
4177 * oldpage has already been charged, and in some cases not.
4182 * Even if newpage->mapping was NULL before starting replacement,
4183 * the newpage may be on LRU(or pagevec for LRU) already. We lock
4184 * LRU while we overwrite pc->mem_cgroup.
4186 __mem_cgroup_commit_charge(memcg, newpage, 1, type, true);
4189 #ifdef CONFIG_DEBUG_VM
4190 static struct page_cgroup *lookup_page_cgroup_used(struct page *page)
4192 struct page_cgroup *pc;
4194 pc = lookup_page_cgroup(page);
4196 * Can be NULL while feeding pages into the page allocator for
4197 * the first time, i.e. during boot or memory hotplug;
4198 * or when mem_cgroup_disabled().
4200 if (likely(pc) && PageCgroupUsed(pc))
4205 bool mem_cgroup_bad_page_check(struct page *page)
4207 if (mem_cgroup_disabled())
4210 return lookup_page_cgroup_used(page) != NULL;
4213 void mem_cgroup_print_bad_page(struct page *page)
4215 struct page_cgroup *pc;
4217 pc = lookup_page_cgroup_used(page);
4219 printk(KERN_ALERT "pc:%p pc->flags:%lx pc->mem_cgroup:%p\n",
4220 pc, pc->flags, pc->mem_cgroup);
4225 static DEFINE_MUTEX(set_limit_mutex);
4227 static int mem_cgroup_resize_limit(struct mem_cgroup *memcg,
4228 unsigned long long val)
4231 u64 memswlimit, memlimit;
4233 int children = mem_cgroup_count_children(memcg);
4234 u64 curusage, oldusage;
4238 * For keeping hierarchical_reclaim simple, how long we should retry
4239 * is depends on callers. We set our retry-count to be function
4240 * of # of children which we should visit in this loop.
4242 retry_count = MEM_CGROUP_RECLAIM_RETRIES * children;
4244 oldusage = res_counter_read_u64(&memcg->res, RES_USAGE);
4247 while (retry_count) {
4248 if (signal_pending(current)) {
4253 * Rather than hide all in some function, I do this in
4254 * open coded manner. You see what this really does.
4255 * We have to guarantee memcg->res.limit <= memcg->memsw.limit.
4257 mutex_lock(&set_limit_mutex);
4258 memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
4259 if (memswlimit < val) {
4261 mutex_unlock(&set_limit_mutex);
4265 memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT);
4269 ret = res_counter_set_limit(&memcg->res, val);
4271 if (memswlimit == val)
4272 memcg->memsw_is_minimum = true;
4274 memcg->memsw_is_minimum = false;
4276 mutex_unlock(&set_limit_mutex);
4281 mem_cgroup_reclaim(memcg, GFP_KERNEL,
4282 MEM_CGROUP_RECLAIM_SHRINK);
4283 curusage = res_counter_read_u64(&memcg->res, RES_USAGE);
4284 /* Usage is reduced ? */
4285 if (curusage >= oldusage)
4288 oldusage = curusage;
4290 if (!ret && enlarge)
4291 memcg_oom_recover(memcg);
4296 static int mem_cgroup_resize_memsw_limit(struct mem_cgroup *memcg,
4297 unsigned long long val)
4300 u64 memlimit, memswlimit, oldusage, curusage;
4301 int children = mem_cgroup_count_children(memcg);
4305 /* see mem_cgroup_resize_res_limit */
4306 retry_count = children * MEM_CGROUP_RECLAIM_RETRIES;
4307 oldusage = res_counter_read_u64(&memcg->memsw, RES_USAGE);
4308 while (retry_count) {
4309 if (signal_pending(current)) {
4314 * Rather than hide all in some function, I do this in
4315 * open coded manner. You see what this really does.
4316 * We have to guarantee memcg->res.limit <= memcg->memsw.limit.
4318 mutex_lock(&set_limit_mutex);
4319 memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT);
4320 if (memlimit > val) {
4322 mutex_unlock(&set_limit_mutex);
4325 memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
4326 if (memswlimit < val)
4328 ret = res_counter_set_limit(&memcg->memsw, val);
4330 if (memlimit == val)
4331 memcg->memsw_is_minimum = true;
4333 memcg->memsw_is_minimum = false;
4335 mutex_unlock(&set_limit_mutex);
4340 mem_cgroup_reclaim(memcg, GFP_KERNEL,
4341 MEM_CGROUP_RECLAIM_NOSWAP |
4342 MEM_CGROUP_RECLAIM_SHRINK);
4343 curusage = res_counter_read_u64(&memcg->memsw, RES_USAGE);
4344 /* Usage is reduced ? */
4345 if (curusage >= oldusage)
4348 oldusage = curusage;
4350 if (!ret && enlarge)
4351 memcg_oom_recover(memcg);
4355 unsigned long mem_cgroup_soft_limit_reclaim(struct zone *zone, int order,
4357 unsigned long *total_scanned)
4359 unsigned long nr_reclaimed = 0;
4360 struct mem_cgroup_per_zone *mz, *next_mz = NULL;
4361 unsigned long reclaimed;
4363 struct mem_cgroup_tree_per_zone *mctz;
4364 unsigned long long excess;
4365 unsigned long nr_scanned;
4370 mctz = soft_limit_tree_node_zone(zone_to_nid(zone), zone_idx(zone));
4372 * This loop can run a while, specially if mem_cgroup's continuously
4373 * keep exceeding their soft limit and putting the system under
4380 mz = mem_cgroup_largest_soft_limit_node(mctz);
4385 reclaimed = mem_cgroup_soft_reclaim(mz->memcg, zone,
4386 gfp_mask, &nr_scanned);
4387 nr_reclaimed += reclaimed;
4388 *total_scanned += nr_scanned;
4389 spin_lock(&mctz->lock);
4392 * If we failed to reclaim anything from this memory cgroup
4393 * it is time to move on to the next cgroup
4399 * Loop until we find yet another one.
4401 * By the time we get the soft_limit lock
4402 * again, someone might have aded the
4403 * group back on the RB tree. Iterate to
4404 * make sure we get a different mem.
4405 * mem_cgroup_largest_soft_limit_node returns
4406 * NULL if no other cgroup is present on
4410 __mem_cgroup_largest_soft_limit_node(mctz);
4412 css_put(&next_mz->memcg->css);
4413 else /* next_mz == NULL or other memcg */
4417 __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz);
4418 excess = res_counter_soft_limit_excess(&mz->memcg->res);
4420 * One school of thought says that we should not add
4421 * back the node to the tree if reclaim returns 0.
4422 * But our reclaim could return 0, simply because due
4423 * to priority we are exposing a smaller subset of
4424 * memory to reclaim from. Consider this as a longer
4427 /* If excess == 0, no tree ops */
4428 __mem_cgroup_insert_exceeded(mz->memcg, mz, mctz, excess);
4429 spin_unlock(&mctz->lock);
4430 css_put(&mz->memcg->css);
4433 * Could not reclaim anything and there are no more
4434 * mem cgroups to try or we seem to be looping without
4435 * reclaiming anything.
4437 if (!nr_reclaimed &&
4439 loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS))
4441 } while (!nr_reclaimed);
4443 css_put(&next_mz->memcg->css);
4444 return nr_reclaimed;
4448 * mem_cgroup_force_empty_list - clears LRU of a group
4449 * @memcg: group to clear
4452 * @lru: lru to to clear
4454 * Traverse a specified page_cgroup list and try to drop them all. This doesn't
4455 * reclaim the pages page themselves - pages are moved to the parent (or root)
4458 static void mem_cgroup_force_empty_list(struct mem_cgroup *memcg,
4459 int node, int zid, enum lru_list lru)
4461 struct lruvec *lruvec;
4462 unsigned long flags;
4463 struct list_head *list;
4467 zone = &NODE_DATA(node)->node_zones[zid];
4468 lruvec = mem_cgroup_zone_lruvec(zone, memcg);
4469 list = &lruvec->lists[lru];
4473 struct page_cgroup *pc;
4476 spin_lock_irqsave(&zone->lru_lock, flags);
4477 if (list_empty(list)) {
4478 spin_unlock_irqrestore(&zone->lru_lock, flags);
4481 page = list_entry(list->prev, struct page, lru);
4483 list_move(&page->lru, list);
4485 spin_unlock_irqrestore(&zone->lru_lock, flags);
4488 spin_unlock_irqrestore(&zone->lru_lock, flags);
4490 pc = lookup_page_cgroup(page);
4492 if (mem_cgroup_move_parent(page, pc, memcg)) {
4493 /* found lock contention or "pc" is obsolete. */
4498 } while (!list_empty(list));
4502 * make mem_cgroup's charge to be 0 if there is no task by moving
4503 * all the charges and pages to the parent.
4504 * This enables deleting this mem_cgroup.
4506 * Caller is responsible for holding css reference on the memcg.
4508 static void mem_cgroup_reparent_charges(struct mem_cgroup *memcg)
4514 /* This is for making all *used* pages to be on LRU. */
4515 lru_add_drain_all();
4516 drain_all_stock_sync(memcg);
4517 mem_cgroup_start_move(memcg);
4518 for_each_node_state(node, N_MEMORY) {
4519 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
4522 mem_cgroup_force_empty_list(memcg,
4527 mem_cgroup_end_move(memcg);
4528 memcg_oom_recover(memcg);
4532 * Kernel memory may not necessarily be trackable to a specific
4533 * process. So they are not migrated, and therefore we can't
4534 * expect their value to drop to 0 here.
4535 * Having res filled up with kmem only is enough.
4537 * This is a safety check because mem_cgroup_force_empty_list
4538 * could have raced with mem_cgroup_replace_page_cache callers
4539 * so the lru seemed empty but the page could have been added
4540 * right after the check. RES_USAGE should be safe as we always
4541 * charge before adding to the LRU.
4543 usage = res_counter_read_u64(&memcg->res, RES_USAGE) -
4544 res_counter_read_u64(&memcg->kmem, RES_USAGE);
4545 } while (usage > 0);
4549 * Reclaims as many pages from the given memcg as possible and moves
4550 * the rest to the parent.
4552 * Caller is responsible for holding css reference for memcg.
4554 static int mem_cgroup_force_empty(struct mem_cgroup *memcg)
4556 int nr_retries = MEM_CGROUP_RECLAIM_RETRIES;
4557 struct cgroup *cgrp = memcg->css.cgroup;
4559 /* returns EBUSY if there is a task or if we come here twice. */
4560 if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children))
4563 /* we call try-to-free pages for make this cgroup empty */
4564 lru_add_drain_all();
4565 /* try to free all pages in this cgroup */
4566 while (nr_retries && res_counter_read_u64(&memcg->res, RES_USAGE) > 0) {
4569 if (signal_pending(current))
4572 progress = try_to_free_mem_cgroup_pages(memcg, GFP_KERNEL,
4576 /* maybe some writeback is necessary */
4577 congestion_wait(BLK_RW_ASYNC, HZ/10);
4582 mem_cgroup_reparent_charges(memcg);
4587 static int mem_cgroup_force_empty_write(struct cgroup *cont, unsigned int event)
4589 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4592 if (mem_cgroup_is_root(memcg))
4594 css_get(&memcg->css);
4595 ret = mem_cgroup_force_empty(memcg);
4596 css_put(&memcg->css);
4602 static u64 mem_cgroup_hierarchy_read(struct cgroup *cont, struct cftype *cft)
4604 return mem_cgroup_from_cont(cont)->use_hierarchy;
4607 static int mem_cgroup_hierarchy_write(struct cgroup *cont, struct cftype *cft,
4611 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4612 struct cgroup *parent = cont->parent;
4613 struct mem_cgroup *parent_memcg = NULL;
4616 parent_memcg = mem_cgroup_from_cont(parent);
4620 if (memcg->use_hierarchy == val)
4624 * If parent's use_hierarchy is set, we can't make any modifications
4625 * in the child subtrees. If it is unset, then the change can
4626 * occur, provided the current cgroup has no children.
4628 * For the root cgroup, parent_mem is NULL, we allow value to be
4629 * set if there are no children.
4631 if ((!parent_memcg || !parent_memcg->use_hierarchy) &&
4632 (val == 1 || val == 0)) {
4633 if (list_empty(&cont->children))
4634 memcg->use_hierarchy = val;
4647 static unsigned long mem_cgroup_recursive_stat(struct mem_cgroup *memcg,
4648 enum mem_cgroup_stat_index idx)
4650 struct mem_cgroup *iter;
4653 /* Per-cpu values can be negative, use a signed accumulator */
4654 for_each_mem_cgroup_tree(iter, memcg)
4655 val += mem_cgroup_read_stat(iter, idx);
4657 if (val < 0) /* race ? */
4662 static inline u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap)
4666 if (!mem_cgroup_is_root(memcg)) {
4668 return res_counter_read_u64(&memcg->res, RES_USAGE);
4670 return res_counter_read_u64(&memcg->memsw, RES_USAGE);
4673 val = mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_CACHE);
4674 val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_RSS);
4677 val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_SWAP);
4679 return val << PAGE_SHIFT;
4682 static ssize_t mem_cgroup_read(struct cgroup *cont, struct cftype *cft,
4683 struct file *file, char __user *buf,
4684 size_t nbytes, loff_t *ppos)
4686 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4692 type = MEMFILE_TYPE(cft->private);
4693 name = MEMFILE_ATTR(cft->private);
4695 if (!do_swap_account && type == _MEMSWAP)
4700 if (name == RES_USAGE)
4701 val = mem_cgroup_usage(memcg, false);
4703 val = res_counter_read_u64(&memcg->res, name);
4706 if (name == RES_USAGE)
4707 val = mem_cgroup_usage(memcg, true);
4709 val = res_counter_read_u64(&memcg->memsw, name);
4712 val = res_counter_read_u64(&memcg->kmem, name);
4718 len = scnprintf(str, sizeof(str), "%llu\n", (unsigned long long)val);
4719 return simple_read_from_buffer(buf, nbytes, ppos, str, len);
4722 static int memcg_update_kmem_limit(struct cgroup *cont, u64 val)
4725 #ifdef CONFIG_MEMCG_KMEM
4726 bool must_inc_static_branch = false;
4728 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4730 * For simplicity, we won't allow this to be disabled. It also can't
4731 * be changed if the cgroup has children already, or if tasks had
4734 * If tasks join before we set the limit, a person looking at
4735 * kmem.usage_in_bytes will have no way to determine when it took
4736 * place, which makes the value quite meaningless.
4738 * After it first became limited, changes in the value of the limit are
4739 * of course permitted.
4741 * Taking the cgroup_lock is really offensive, but it is so far the only
4742 * way to guarantee that no children will appear. There are plenty of
4743 * other offenders, and they should all go away. Fine grained locking
4744 * is probably the way to go here. When we are fully hierarchical, we
4745 * can also get rid of the use_hierarchy check.
4748 mutex_lock(&set_limit_mutex);
4749 if (!memcg->kmem_account_flags && val != RESOURCE_MAX) {
4750 if (cgroup_task_count(cont) || (memcg->use_hierarchy &&
4751 !list_empty(&cont->children))) {
4755 ret = res_counter_set_limit(&memcg->kmem, val);
4758 ret = memcg_update_cache_sizes(memcg);
4760 res_counter_set_limit(&memcg->kmem, RESOURCE_MAX);
4763 must_inc_static_branch = true;
4765 * kmem charges can outlive the cgroup. In the case of slab
4766 * pages, for instance, a page contain objects from various
4767 * processes, so it is unfeasible to migrate them away. We
4768 * need to reference count the memcg because of that.
4770 mem_cgroup_get(memcg);
4772 ret = res_counter_set_limit(&memcg->kmem, val);
4774 mutex_unlock(&set_limit_mutex);
4778 * We are by now familiar with the fact that we can't inc the static
4779 * branch inside cgroup_lock. See disarm functions for details. A
4780 * worker here is overkill, but also wrong: After the limit is set, we
4781 * must start accounting right away. Since this operation can't fail,
4782 * we can safely defer it to here - no rollback will be needed.
4784 * The boolean used to control this is also safe, because
4785 * KMEM_ACCOUNTED_ACTIVATED guarantees that only one process will be
4786 * able to set it to true;
4788 if (must_inc_static_branch) {
4789 static_key_slow_inc(&memcg_kmem_enabled_key);
4791 * setting the active bit after the inc will guarantee no one
4792 * starts accounting before all call sites are patched
4794 memcg_kmem_set_active(memcg);
4801 static int memcg_propagate_kmem(struct mem_cgroup *memcg)
4804 struct mem_cgroup *parent = parent_mem_cgroup(memcg);
4808 memcg->kmem_account_flags = parent->kmem_account_flags;
4809 #ifdef CONFIG_MEMCG_KMEM
4811 * When that happen, we need to disable the static branch only on those
4812 * memcgs that enabled it. To achieve this, we would be forced to
4813 * complicate the code by keeping track of which memcgs were the ones
4814 * that actually enabled limits, and which ones got it from its
4817 * It is a lot simpler just to do static_key_slow_inc() on every child
4818 * that is accounted.
4820 if (!memcg_kmem_is_active(memcg))
4824 * destroy(), called if we fail, will issue static_key_slow_inc() and
4825 * mem_cgroup_put() if kmem is enabled. We have to either call them
4826 * unconditionally, or clear the KMEM_ACTIVE flag. I personally find
4827 * this more consistent, since it always leads to the same destroy path
4829 mem_cgroup_get(memcg);
4830 static_key_slow_inc(&memcg_kmem_enabled_key);
4832 mutex_lock(&set_limit_mutex);
4833 ret = memcg_update_cache_sizes(memcg);
4834 mutex_unlock(&set_limit_mutex);
4841 * The user of this function is...
4844 static int mem_cgroup_write(struct cgroup *cont, struct cftype *cft,
4847 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4850 unsigned long long val;
4853 type = MEMFILE_TYPE(cft->private);
4854 name = MEMFILE_ATTR(cft->private);
4856 if (!do_swap_account && type == _MEMSWAP)
4861 if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */
4865 /* This function does all necessary parse...reuse it */
4866 ret = res_counter_memparse_write_strategy(buffer, &val);
4870 ret = mem_cgroup_resize_limit(memcg, val);
4871 else if (type == _MEMSWAP)
4872 ret = mem_cgroup_resize_memsw_limit(memcg, val);
4873 else if (type == _KMEM)
4874 ret = memcg_update_kmem_limit(cont, val);
4878 case RES_SOFT_LIMIT:
4879 ret = res_counter_memparse_write_strategy(buffer, &val);
4883 * For memsw, soft limits are hard to implement in terms
4884 * of semantics, for now, we support soft limits for
4885 * control without swap
4888 ret = res_counter_set_soft_limit(&memcg->res, val);
4893 ret = -EINVAL; /* should be BUG() ? */
4899 static void memcg_get_hierarchical_limit(struct mem_cgroup *memcg,
4900 unsigned long long *mem_limit, unsigned long long *memsw_limit)
4902 struct cgroup *cgroup;
4903 unsigned long long min_limit, min_memsw_limit, tmp;
4905 min_limit = res_counter_read_u64(&memcg->res, RES_LIMIT);
4906 min_memsw_limit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
4907 cgroup = memcg->css.cgroup;
4908 if (!memcg->use_hierarchy)
4911 while (cgroup->parent) {
4912 cgroup = cgroup->parent;
4913 memcg = mem_cgroup_from_cont(cgroup);
4914 if (!memcg->use_hierarchy)
4916 tmp = res_counter_read_u64(&memcg->res, RES_LIMIT);
4917 min_limit = min(min_limit, tmp);
4918 tmp = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
4919 min_memsw_limit = min(min_memsw_limit, tmp);
4922 *mem_limit = min_limit;
4923 *memsw_limit = min_memsw_limit;
4926 static int mem_cgroup_reset(struct cgroup *cont, unsigned int event)
4928 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4932 type = MEMFILE_TYPE(event);
4933 name = MEMFILE_ATTR(event);
4935 if (!do_swap_account && type == _MEMSWAP)
4941 res_counter_reset_max(&memcg->res);
4942 else if (type == _MEMSWAP)
4943 res_counter_reset_max(&memcg->memsw);
4944 else if (type == _KMEM)
4945 res_counter_reset_max(&memcg->kmem);
4951 res_counter_reset_failcnt(&memcg->res);
4952 else if (type == _MEMSWAP)
4953 res_counter_reset_failcnt(&memcg->memsw);
4954 else if (type == _KMEM)
4955 res_counter_reset_failcnt(&memcg->kmem);
4964 static u64 mem_cgroup_move_charge_read(struct cgroup *cgrp,
4967 return mem_cgroup_from_cont(cgrp)->move_charge_at_immigrate;
4971 static int mem_cgroup_move_charge_write(struct cgroup *cgrp,
4972 struct cftype *cft, u64 val)
4974 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4976 if (val >= (1 << NR_MOVE_TYPE))
4979 * We check this value several times in both in can_attach() and
4980 * attach(), so we need cgroup lock to prevent this value from being
4984 memcg->move_charge_at_immigrate = val;
4990 static int mem_cgroup_move_charge_write(struct cgroup *cgrp,
4991 struct cftype *cft, u64 val)
4998 static int memcg_numa_stat_show(struct cgroup *cont, struct cftype *cft,
5002 unsigned long total_nr, file_nr, anon_nr, unevictable_nr;
5003 unsigned long node_nr;
5004 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
5006 total_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL);
5007 seq_printf(m, "total=%lu", total_nr);
5008 for_each_node_state(nid, N_MEMORY) {
5009 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL);
5010 seq_printf(m, " N%d=%lu", nid, node_nr);
5014 file_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL_FILE);
5015 seq_printf(m, "file=%lu", file_nr);
5016 for_each_node_state(nid, N_MEMORY) {
5017 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
5019 seq_printf(m, " N%d=%lu", nid, node_nr);
5023 anon_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL_ANON);
5024 seq_printf(m, "anon=%lu", anon_nr);
5025 for_each_node_state(nid, N_MEMORY) {
5026 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
5028 seq_printf(m, " N%d=%lu", nid, node_nr);
5032 unevictable_nr = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_UNEVICTABLE));
5033 seq_printf(m, "unevictable=%lu", unevictable_nr);
5034 for_each_node_state(nid, N_MEMORY) {
5035 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
5036 BIT(LRU_UNEVICTABLE));
5037 seq_printf(m, " N%d=%lu", nid, node_nr);
5042 #endif /* CONFIG_NUMA */
5044 static const char * const mem_cgroup_lru_names[] = {
5052 static inline void mem_cgroup_lru_names_not_uptodate(void)
5054 BUILD_BUG_ON(ARRAY_SIZE(mem_cgroup_lru_names) != NR_LRU_LISTS);
5057 static int memcg_stat_show(struct cgroup *cont, struct cftype *cft,
5060 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
5061 struct mem_cgroup *mi;
5064 for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) {
5065 if (i == MEM_CGROUP_STAT_SWAP && !do_swap_account)
5067 seq_printf(m, "%s %ld\n", mem_cgroup_stat_names[i],
5068 mem_cgroup_read_stat(memcg, i) * PAGE_SIZE);
5071 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++)
5072 seq_printf(m, "%s %lu\n", mem_cgroup_events_names[i],
5073 mem_cgroup_read_events(memcg, i));
5075 for (i = 0; i < NR_LRU_LISTS; i++)
5076 seq_printf(m, "%s %lu\n", mem_cgroup_lru_names[i],
5077 mem_cgroup_nr_lru_pages(memcg, BIT(i)) * PAGE_SIZE);
5079 /* Hierarchical information */
5081 unsigned long long limit, memsw_limit;
5082 memcg_get_hierarchical_limit(memcg, &limit, &memsw_limit);
5083 seq_printf(m, "hierarchical_memory_limit %llu\n", limit);
5084 if (do_swap_account)
5085 seq_printf(m, "hierarchical_memsw_limit %llu\n",
5089 for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) {
5092 if (i == MEM_CGROUP_STAT_SWAP && !do_swap_account)
5094 for_each_mem_cgroup_tree(mi, memcg)
5095 val += mem_cgroup_read_stat(mi, i) * PAGE_SIZE;
5096 seq_printf(m, "total_%s %lld\n", mem_cgroup_stat_names[i], val);
5099 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) {
5100 unsigned long long val = 0;
5102 for_each_mem_cgroup_tree(mi, memcg)
5103 val += mem_cgroup_read_events(mi, i);
5104 seq_printf(m, "total_%s %llu\n",
5105 mem_cgroup_events_names[i], val);
5108 for (i = 0; i < NR_LRU_LISTS; i++) {
5109 unsigned long long val = 0;
5111 for_each_mem_cgroup_tree(mi, memcg)
5112 val += mem_cgroup_nr_lru_pages(mi, BIT(i)) * PAGE_SIZE;
5113 seq_printf(m, "total_%s %llu\n", mem_cgroup_lru_names[i], val);
5116 #ifdef CONFIG_DEBUG_VM
5119 struct mem_cgroup_per_zone *mz;
5120 struct zone_reclaim_stat *rstat;
5121 unsigned long recent_rotated[2] = {0, 0};
5122 unsigned long recent_scanned[2] = {0, 0};
5124 for_each_online_node(nid)
5125 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
5126 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
5127 rstat = &mz->lruvec.reclaim_stat;
5129 recent_rotated[0] += rstat->recent_rotated[0];
5130 recent_rotated[1] += rstat->recent_rotated[1];
5131 recent_scanned[0] += rstat->recent_scanned[0];
5132 recent_scanned[1] += rstat->recent_scanned[1];
5134 seq_printf(m, "recent_rotated_anon %lu\n", recent_rotated[0]);
5135 seq_printf(m, "recent_rotated_file %lu\n", recent_rotated[1]);
5136 seq_printf(m, "recent_scanned_anon %lu\n", recent_scanned[0]);
5137 seq_printf(m, "recent_scanned_file %lu\n", recent_scanned[1]);
5144 static u64 mem_cgroup_swappiness_read(struct cgroup *cgrp, struct cftype *cft)
5146 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
5148 return mem_cgroup_swappiness(memcg);
5151 static int mem_cgroup_swappiness_write(struct cgroup *cgrp, struct cftype *cft,
5154 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
5155 struct mem_cgroup *parent;
5160 if (cgrp->parent == NULL)
5163 parent = mem_cgroup_from_cont(cgrp->parent);
5167 /* If under hierarchy, only empty-root can set this value */
5168 if ((parent->use_hierarchy) ||
5169 (memcg->use_hierarchy && !list_empty(&cgrp->children))) {
5174 memcg->swappiness = val;
5181 static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap)
5183 struct mem_cgroup_threshold_ary *t;
5189 t = rcu_dereference(memcg->thresholds.primary);
5191 t = rcu_dereference(memcg->memsw_thresholds.primary);
5196 usage = mem_cgroup_usage(memcg, swap);
5199 * current_threshold points to threshold just below or equal to usage.
5200 * If it's not true, a threshold was crossed after last
5201 * call of __mem_cgroup_threshold().
5203 i = t->current_threshold;
5206 * Iterate backward over array of thresholds starting from
5207 * current_threshold and check if a threshold is crossed.
5208 * If none of thresholds below usage is crossed, we read
5209 * only one element of the array here.
5211 for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)
5212 eventfd_signal(t->entries[i].eventfd, 1);
5214 /* i = current_threshold + 1 */
5218 * Iterate forward over array of thresholds starting from
5219 * current_threshold+1 and check if a threshold is crossed.
5220 * If none of thresholds above usage is crossed, we read
5221 * only one element of the array here.
5223 for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)
5224 eventfd_signal(t->entries[i].eventfd, 1);
5226 /* Update current_threshold */
5227 t->current_threshold = i - 1;
5232 static void mem_cgroup_threshold(struct mem_cgroup *memcg)
5235 __mem_cgroup_threshold(memcg, false);
5236 if (do_swap_account)
5237 __mem_cgroup_threshold(memcg, true);
5239 memcg = parent_mem_cgroup(memcg);
5243 static int compare_thresholds(const void *a, const void *b)
5245 const struct mem_cgroup_threshold *_a = a;
5246 const struct mem_cgroup_threshold *_b = b;
5248 return _a->threshold - _b->threshold;
5251 static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg)
5253 struct mem_cgroup_eventfd_list *ev;
5255 list_for_each_entry(ev, &memcg->oom_notify, list)
5256 eventfd_signal(ev->eventfd, 1);
5260 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg)
5262 struct mem_cgroup *iter;
5264 for_each_mem_cgroup_tree(iter, memcg)
5265 mem_cgroup_oom_notify_cb(iter);
5268 static int mem_cgroup_usage_register_event(struct cgroup *cgrp,
5269 struct cftype *cft, struct eventfd_ctx *eventfd, const char *args)
5271 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
5272 struct mem_cgroup_thresholds *thresholds;
5273 struct mem_cgroup_threshold_ary *new;
5274 enum res_type type = MEMFILE_TYPE(cft->private);
5275 u64 threshold, usage;
5278 ret = res_counter_memparse_write_strategy(args, &threshold);
5282 mutex_lock(&memcg->thresholds_lock);
5285 thresholds = &memcg->thresholds;
5286 else if (type == _MEMSWAP)
5287 thresholds = &memcg->memsw_thresholds;
5291 usage = mem_cgroup_usage(memcg, type == _MEMSWAP);
5293 /* Check if a threshold crossed before adding a new one */
5294 if (thresholds->primary)
5295 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
5297 size = thresholds->primary ? thresholds->primary->size + 1 : 1;
5299 /* Allocate memory for new array of thresholds */
5300 new = kmalloc(sizeof(*new) + size * sizeof(struct mem_cgroup_threshold),
5308 /* Copy thresholds (if any) to new array */
5309 if (thresholds->primary) {
5310 memcpy(new->entries, thresholds->primary->entries, (size - 1) *
5311 sizeof(struct mem_cgroup_threshold));
5314 /* Add new threshold */
5315 new->entries[size - 1].eventfd = eventfd;
5316 new->entries[size - 1].threshold = threshold;
5318 /* Sort thresholds. Registering of new threshold isn't time-critical */
5319 sort(new->entries, size, sizeof(struct mem_cgroup_threshold),
5320 compare_thresholds, NULL);
5322 /* Find current threshold */
5323 new->current_threshold = -1;
5324 for (i = 0; i < size; i++) {
5325 if (new->entries[i].threshold <= usage) {
5327 * new->current_threshold will not be used until
5328 * rcu_assign_pointer(), so it's safe to increment
5331 ++new->current_threshold;
5336 /* Free old spare buffer and save old primary buffer as spare */
5337 kfree(thresholds->spare);
5338 thresholds->spare = thresholds->primary;
5340 rcu_assign_pointer(thresholds->primary, new);
5342 /* To be sure that nobody uses thresholds */
5346 mutex_unlock(&memcg->thresholds_lock);
5351 static void mem_cgroup_usage_unregister_event(struct cgroup *cgrp,
5352 struct cftype *cft, struct eventfd_ctx *eventfd)
5354 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
5355 struct mem_cgroup_thresholds *thresholds;
5356 struct mem_cgroup_threshold_ary *new;
5357 enum res_type type = MEMFILE_TYPE(cft->private);
5361 mutex_lock(&memcg->thresholds_lock);
5363 thresholds = &memcg->thresholds;
5364 else if (type == _MEMSWAP)
5365 thresholds = &memcg->memsw_thresholds;
5369 if (!thresholds->primary)
5372 usage = mem_cgroup_usage(memcg, type == _MEMSWAP);
5374 /* Check if a threshold crossed before removing */
5375 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
5377 /* Calculate new number of threshold */
5379 for (i = 0; i < thresholds->primary->size; i++) {
5380 if (thresholds->primary->entries[i].eventfd != eventfd)
5384 new = thresholds->spare;
5386 /* Set thresholds array to NULL if we don't have thresholds */
5395 /* Copy thresholds and find current threshold */
5396 new->current_threshold = -1;
5397 for (i = 0, j = 0; i < thresholds->primary->size; i++) {
5398 if (thresholds->primary->entries[i].eventfd == eventfd)
5401 new->entries[j] = thresholds->primary->entries[i];
5402 if (new->entries[j].threshold <= usage) {
5404 * new->current_threshold will not be used
5405 * until rcu_assign_pointer(), so it's safe to increment
5408 ++new->current_threshold;
5414 /* Swap primary and spare array */
5415 thresholds->spare = thresholds->primary;
5416 /* If all events are unregistered, free the spare array */
5418 kfree(thresholds->spare);
5419 thresholds->spare = NULL;
5422 rcu_assign_pointer(thresholds->primary, new);
5424 /* To be sure that nobody uses thresholds */
5427 mutex_unlock(&memcg->thresholds_lock);
5430 static int mem_cgroup_oom_register_event(struct cgroup *cgrp,
5431 struct cftype *cft, struct eventfd_ctx *eventfd, const char *args)
5433 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
5434 struct mem_cgroup_eventfd_list *event;
5435 enum res_type type = MEMFILE_TYPE(cft->private);
5437 BUG_ON(type != _OOM_TYPE);
5438 event = kmalloc(sizeof(*event), GFP_KERNEL);
5442 spin_lock(&memcg_oom_lock);
5444 event->eventfd = eventfd;
5445 list_add(&event->list, &memcg->oom_notify);
5447 /* already in OOM ? */
5448 if (atomic_read(&memcg->under_oom))
5449 eventfd_signal(eventfd, 1);
5450 spin_unlock(&memcg_oom_lock);
5455 static void mem_cgroup_oom_unregister_event(struct cgroup *cgrp,
5456 struct cftype *cft, struct eventfd_ctx *eventfd)
5458 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
5459 struct mem_cgroup_eventfd_list *ev, *tmp;
5460 enum res_type type = MEMFILE_TYPE(cft->private);
5462 BUG_ON(type != _OOM_TYPE);
5464 spin_lock(&memcg_oom_lock);
5466 list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) {
5467 if (ev->eventfd == eventfd) {
5468 list_del(&ev->list);
5473 spin_unlock(&memcg_oom_lock);
5476 static int mem_cgroup_oom_control_read(struct cgroup *cgrp,
5477 struct cftype *cft, struct cgroup_map_cb *cb)
5479 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
5481 cb->fill(cb, "oom_kill_disable", memcg->oom_kill_disable);
5483 if (atomic_read(&memcg->under_oom))
5484 cb->fill(cb, "under_oom", 1);
5486 cb->fill(cb, "under_oom", 0);
5490 static int mem_cgroup_oom_control_write(struct cgroup *cgrp,
5491 struct cftype *cft, u64 val)
5493 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
5494 struct mem_cgroup *parent;
5496 /* cannot set to root cgroup and only 0 and 1 are allowed */
5497 if (!cgrp->parent || !((val == 0) || (val == 1)))
5500 parent = mem_cgroup_from_cont(cgrp->parent);
5503 /* oom-kill-disable is a flag for subhierarchy. */
5504 if ((parent->use_hierarchy) ||
5505 (memcg->use_hierarchy && !list_empty(&cgrp->children))) {
5509 memcg->oom_kill_disable = val;
5511 memcg_oom_recover(memcg);
5516 #ifdef CONFIG_MEMCG_KMEM
5517 static int memcg_init_kmem(struct mem_cgroup *memcg, struct cgroup_subsys *ss)
5521 memcg->kmemcg_id = -1;
5522 ret = memcg_propagate_kmem(memcg);
5526 return mem_cgroup_sockets_init(memcg, ss);
5529 static void kmem_cgroup_destroy(struct mem_cgroup *memcg)
5531 mem_cgroup_sockets_destroy(memcg);
5533 memcg_kmem_mark_dead(memcg);
5535 if (res_counter_read_u64(&memcg->kmem, RES_USAGE) != 0)
5539 * Charges already down to 0, undo mem_cgroup_get() done in the charge
5540 * path here, being careful not to race with memcg_uncharge_kmem: it is
5541 * possible that the charges went down to 0 between mark_dead and the
5542 * res_counter read, so in that case, we don't need the put
5544 if (memcg_kmem_test_and_clear_dead(memcg))
5545 mem_cgroup_put(memcg);
5548 static int memcg_init_kmem(struct mem_cgroup *memcg, struct cgroup_subsys *ss)
5553 static void kmem_cgroup_destroy(struct mem_cgroup *memcg)
5558 static struct cftype mem_cgroup_files[] = {
5560 .name = "usage_in_bytes",
5561 .private = MEMFILE_PRIVATE(_MEM, RES_USAGE),
5562 .read = mem_cgroup_read,
5563 .register_event = mem_cgroup_usage_register_event,
5564 .unregister_event = mem_cgroup_usage_unregister_event,
5567 .name = "max_usage_in_bytes",
5568 .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE),
5569 .trigger = mem_cgroup_reset,
5570 .read = mem_cgroup_read,
5573 .name = "limit_in_bytes",
5574 .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT),
5575 .write_string = mem_cgroup_write,
5576 .read = mem_cgroup_read,
5579 .name = "soft_limit_in_bytes",
5580 .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT),
5581 .write_string = mem_cgroup_write,
5582 .read = mem_cgroup_read,
5586 .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT),
5587 .trigger = mem_cgroup_reset,
5588 .read = mem_cgroup_read,
5592 .read_seq_string = memcg_stat_show,
5595 .name = "force_empty",
5596 .trigger = mem_cgroup_force_empty_write,
5599 .name = "use_hierarchy",
5600 .write_u64 = mem_cgroup_hierarchy_write,
5601 .read_u64 = mem_cgroup_hierarchy_read,
5604 .name = "swappiness",
5605 .read_u64 = mem_cgroup_swappiness_read,
5606 .write_u64 = mem_cgroup_swappiness_write,
5609 .name = "move_charge_at_immigrate",
5610 .read_u64 = mem_cgroup_move_charge_read,
5611 .write_u64 = mem_cgroup_move_charge_write,
5614 .name = "oom_control",
5615 .read_map = mem_cgroup_oom_control_read,
5616 .write_u64 = mem_cgroup_oom_control_write,
5617 .register_event = mem_cgroup_oom_register_event,
5618 .unregister_event = mem_cgroup_oom_unregister_event,
5619 .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL),
5623 .name = "numa_stat",
5624 .read_seq_string = memcg_numa_stat_show,
5627 #ifdef CONFIG_MEMCG_SWAP
5629 .name = "memsw.usage_in_bytes",
5630 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE),
5631 .read = mem_cgroup_read,
5632 .register_event = mem_cgroup_usage_register_event,
5633 .unregister_event = mem_cgroup_usage_unregister_event,
5636 .name = "memsw.max_usage_in_bytes",
5637 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE),
5638 .trigger = mem_cgroup_reset,
5639 .read = mem_cgroup_read,
5642 .name = "memsw.limit_in_bytes",
5643 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT),
5644 .write_string = mem_cgroup_write,
5645 .read = mem_cgroup_read,
5648 .name = "memsw.failcnt",
5649 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT),
5650 .trigger = mem_cgroup_reset,
5651 .read = mem_cgroup_read,
5654 #ifdef CONFIG_MEMCG_KMEM
5656 .name = "kmem.limit_in_bytes",
5657 .private = MEMFILE_PRIVATE(_KMEM, RES_LIMIT),
5658 .write_string = mem_cgroup_write,
5659 .read = mem_cgroup_read,
5662 .name = "kmem.usage_in_bytes",
5663 .private = MEMFILE_PRIVATE(_KMEM, RES_USAGE),
5664 .read = mem_cgroup_read,
5667 .name = "kmem.failcnt",
5668 .private = MEMFILE_PRIVATE(_KMEM, RES_FAILCNT),
5669 .trigger = mem_cgroup_reset,
5670 .read = mem_cgroup_read,
5673 .name = "kmem.max_usage_in_bytes",
5674 .private = MEMFILE_PRIVATE(_KMEM, RES_MAX_USAGE),
5675 .trigger = mem_cgroup_reset,
5676 .read = mem_cgroup_read,
5679 { }, /* terminate */
5682 static int alloc_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node)
5684 struct mem_cgroup_per_node *pn;
5685 struct mem_cgroup_per_zone *mz;
5686 int zone, tmp = node;
5688 * This routine is called against possible nodes.
5689 * But it's BUG to call kmalloc() against offline node.
5691 * TODO: this routine can waste much memory for nodes which will
5692 * never be onlined. It's better to use memory hotplug callback
5695 if (!node_state(node, N_NORMAL_MEMORY))
5697 pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp);
5701 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
5702 mz = &pn->zoneinfo[zone];
5703 lruvec_init(&mz->lruvec);
5704 mz->usage_in_excess = 0;
5705 mz->on_tree = false;
5708 memcg->info.nodeinfo[node] = pn;
5712 static void free_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node)
5714 kfree(memcg->info.nodeinfo[node]);
5717 static struct mem_cgroup *mem_cgroup_alloc(void)
5719 struct mem_cgroup *memcg;
5720 int size = sizeof(struct mem_cgroup);
5722 /* Can be very big if MAX_NUMNODES is very big */
5723 if (size < PAGE_SIZE)
5724 memcg = kzalloc(size, GFP_KERNEL);
5726 memcg = vzalloc(size);
5731 memcg->stat = alloc_percpu(struct mem_cgroup_stat_cpu);
5734 spin_lock_init(&memcg->pcp_counter_lock);
5738 if (size < PAGE_SIZE)
5746 * At destroying mem_cgroup, references from swap_cgroup can remain.
5747 * (scanning all at force_empty is too costly...)
5749 * Instead of clearing all references at force_empty, we remember
5750 * the number of reference from swap_cgroup and free mem_cgroup when
5751 * it goes down to 0.
5753 * Removal of cgroup itself succeeds regardless of refs from swap.
5756 static void __mem_cgroup_free(struct mem_cgroup *memcg)
5759 int size = sizeof(struct mem_cgroup);
5761 mem_cgroup_remove_from_trees(memcg);
5762 free_css_id(&mem_cgroup_subsys, &memcg->css);
5765 free_mem_cgroup_per_zone_info(memcg, node);
5767 free_percpu(memcg->stat);
5770 * We need to make sure that (at least for now), the jump label
5771 * destruction code runs outside of the cgroup lock. This is because
5772 * get_online_cpus(), which is called from the static_branch update,
5773 * can't be called inside the cgroup_lock. cpusets are the ones
5774 * enforcing this dependency, so if they ever change, we might as well.
5776 * schedule_work() will guarantee this happens. Be careful if you need
5777 * to move this code around, and make sure it is outside
5780 disarm_static_keys(memcg);
5781 if (size < PAGE_SIZE)
5789 * Helpers for freeing a kmalloc()ed/vzalloc()ed mem_cgroup by RCU,
5790 * but in process context. The work_freeing structure is overlaid
5791 * on the rcu_freeing structure, which itself is overlaid on memsw.
5793 static void free_work(struct work_struct *work)
5795 struct mem_cgroup *memcg;
5797 memcg = container_of(work, struct mem_cgroup, work_freeing);
5798 __mem_cgroup_free(memcg);
5801 static void free_rcu(struct rcu_head *rcu_head)
5803 struct mem_cgroup *memcg;
5805 memcg = container_of(rcu_head, struct mem_cgroup, rcu_freeing);
5806 INIT_WORK(&memcg->work_freeing, free_work);
5807 schedule_work(&memcg->work_freeing);
5810 static void mem_cgroup_get(struct mem_cgroup *memcg)
5812 atomic_inc(&memcg->refcnt);
5815 static void __mem_cgroup_put(struct mem_cgroup *memcg, int count)
5817 if (atomic_sub_and_test(count, &memcg->refcnt)) {
5818 struct mem_cgroup *parent = parent_mem_cgroup(memcg);
5819 call_rcu(&memcg->rcu_freeing, free_rcu);
5821 mem_cgroup_put(parent);
5825 static void mem_cgroup_put(struct mem_cgroup *memcg)
5827 __mem_cgroup_put(memcg, 1);
5831 * Returns the parent mem_cgroup in memcgroup hierarchy with hierarchy enabled.
5833 struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *memcg)
5835 if (!memcg->res.parent)
5837 return mem_cgroup_from_res_counter(memcg->res.parent, res);
5839 EXPORT_SYMBOL(parent_mem_cgroup);
5841 #ifdef CONFIG_MEMCG_SWAP
5842 static void __init enable_swap_cgroup(void)
5844 if (!mem_cgroup_disabled() && really_do_swap_account)
5845 do_swap_account = 1;
5848 static void __init enable_swap_cgroup(void)
5853 static int mem_cgroup_soft_limit_tree_init(void)
5855 struct mem_cgroup_tree_per_node *rtpn;
5856 struct mem_cgroup_tree_per_zone *rtpz;
5857 int tmp, node, zone;
5859 for_each_node(node) {
5861 if (!node_state(node, N_NORMAL_MEMORY))
5863 rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL, tmp);
5867 soft_limit_tree.rb_tree_per_node[node] = rtpn;
5869 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
5870 rtpz = &rtpn->rb_tree_per_zone[zone];
5871 rtpz->rb_root = RB_ROOT;
5872 spin_lock_init(&rtpz->lock);
5878 for_each_node(node) {
5879 if (!soft_limit_tree.rb_tree_per_node[node])
5881 kfree(soft_limit_tree.rb_tree_per_node[node]);
5882 soft_limit_tree.rb_tree_per_node[node] = NULL;
5888 static struct cgroup_subsys_state * __ref
5889 mem_cgroup_css_alloc(struct cgroup *cont)
5891 struct mem_cgroup *memcg, *parent;
5892 long error = -ENOMEM;
5895 memcg = mem_cgroup_alloc();
5897 return ERR_PTR(error);
5900 if (alloc_mem_cgroup_per_zone_info(memcg, node))
5904 if (cont->parent == NULL) {
5906 enable_swap_cgroup();
5908 if (mem_cgroup_soft_limit_tree_init())
5910 root_mem_cgroup = memcg;
5911 for_each_possible_cpu(cpu) {
5912 struct memcg_stock_pcp *stock =
5913 &per_cpu(memcg_stock, cpu);
5914 INIT_WORK(&stock->work, drain_local_stock);
5916 hotcpu_notifier(memcg_cpu_hotplug_callback, 0);
5918 parent = mem_cgroup_from_cont(cont->parent);
5919 memcg->use_hierarchy = parent->use_hierarchy;
5920 memcg->oom_kill_disable = parent->oom_kill_disable;
5923 if (parent && parent->use_hierarchy) {
5924 res_counter_init(&memcg->res, &parent->res);
5925 res_counter_init(&memcg->memsw, &parent->memsw);
5926 res_counter_init(&memcg->kmem, &parent->kmem);
5929 * We increment refcnt of the parent to ensure that we can
5930 * safely access it on res_counter_charge/uncharge.
5931 * This refcnt will be decremented when freeing this
5932 * mem_cgroup(see mem_cgroup_put).
5934 mem_cgroup_get(parent);
5936 res_counter_init(&memcg->res, NULL);
5937 res_counter_init(&memcg->memsw, NULL);
5938 res_counter_init(&memcg->kmem, NULL);
5940 * Deeper hierachy with use_hierarchy == false doesn't make
5941 * much sense so let cgroup subsystem know about this
5942 * unfortunate state in our controller.
5944 if (parent && parent != root_mem_cgroup)
5945 mem_cgroup_subsys.broken_hierarchy = true;
5947 memcg->last_scanned_node = MAX_NUMNODES;
5948 INIT_LIST_HEAD(&memcg->oom_notify);
5951 memcg->swappiness = mem_cgroup_swappiness(parent);
5952 atomic_set(&memcg->refcnt, 1);
5953 memcg->move_charge_at_immigrate = 0;
5954 mutex_init(&memcg->thresholds_lock);
5955 spin_lock_init(&memcg->move_lock);
5957 error = memcg_init_kmem(memcg, &mem_cgroup_subsys);
5960 * We call put now because our (and parent's) refcnts
5961 * are already in place. mem_cgroup_put() will internally
5962 * call __mem_cgroup_free, so return directly
5964 mem_cgroup_put(memcg);
5965 return ERR_PTR(error);
5969 __mem_cgroup_free(memcg);
5970 return ERR_PTR(error);
5973 static void mem_cgroup_css_offline(struct cgroup *cont)
5975 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
5977 mem_cgroup_reparent_charges(memcg);
5980 static void mem_cgroup_css_free(struct cgroup *cont)
5982 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
5984 kmem_cgroup_destroy(memcg);
5986 mem_cgroup_put(memcg);
5990 /* Handlers for move charge at task migration. */
5991 #define PRECHARGE_COUNT_AT_ONCE 256
5992 static int mem_cgroup_do_precharge(unsigned long count)
5995 int batch_count = PRECHARGE_COUNT_AT_ONCE;
5996 struct mem_cgroup *memcg = mc.to;
5998 if (mem_cgroup_is_root(memcg)) {
5999 mc.precharge += count;
6000 /* we don't need css_get for root */
6003 /* try to charge at once */
6005 struct res_counter *dummy;
6007 * "memcg" cannot be under rmdir() because we've already checked
6008 * by cgroup_lock_live_cgroup() that it is not removed and we
6009 * are still under the same cgroup_mutex. So we can postpone
6012 if (res_counter_charge(&memcg->res, PAGE_SIZE * count, &dummy))
6014 if (do_swap_account && res_counter_charge(&memcg->memsw,
6015 PAGE_SIZE * count, &dummy)) {
6016 res_counter_uncharge(&memcg->res, PAGE_SIZE * count);
6019 mc.precharge += count;
6023 /* fall back to one by one charge */
6025 if (signal_pending(current)) {
6029 if (!batch_count--) {
6030 batch_count = PRECHARGE_COUNT_AT_ONCE;
6033 ret = __mem_cgroup_try_charge(NULL,
6034 GFP_KERNEL, 1, &memcg, false);
6036 /* mem_cgroup_clear_mc() will do uncharge later */
6044 * get_mctgt_type - get target type of moving charge
6045 * @vma: the vma the pte to be checked belongs
6046 * @addr: the address corresponding to the pte to be checked
6047 * @ptent: the pte to be checked
6048 * @target: the pointer the target page or swap ent will be stored(can be NULL)
6051 * 0(MC_TARGET_NONE): if the pte is not a target for move charge.
6052 * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for
6053 * move charge. if @target is not NULL, the page is stored in target->page
6054 * with extra refcnt got(Callers should handle it).
6055 * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a
6056 * target for charge migration. if @target is not NULL, the entry is stored
6059 * Called with pte lock held.
6066 enum mc_target_type {
6072 static struct page *mc_handle_present_pte(struct vm_area_struct *vma,
6073 unsigned long addr, pte_t ptent)
6075 struct page *page = vm_normal_page(vma, addr, ptent);
6077 if (!page || !page_mapped(page))
6079 if (PageAnon(page)) {
6080 /* we don't move shared anon */
6083 } else if (!move_file())
6084 /* we ignore mapcount for file pages */
6086 if (!get_page_unless_zero(page))
6093 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
6094 unsigned long addr, pte_t ptent, swp_entry_t *entry)
6096 struct page *page = NULL;
6097 swp_entry_t ent = pte_to_swp_entry(ptent);
6099 if (!move_anon() || non_swap_entry(ent))
6102 * Because lookup_swap_cache() updates some statistics counter,
6103 * we call find_get_page() with swapper_space directly.
6105 page = find_get_page(&swapper_space, ent.val);
6106 if (do_swap_account)
6107 entry->val = ent.val;
6112 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
6113 unsigned long addr, pte_t ptent, swp_entry_t *entry)
6119 static struct page *mc_handle_file_pte(struct vm_area_struct *vma,
6120 unsigned long addr, pte_t ptent, swp_entry_t *entry)
6122 struct page *page = NULL;
6123 struct address_space *mapping;
6126 if (!vma->vm_file) /* anonymous vma */
6131 mapping = vma->vm_file->f_mapping;
6132 if (pte_none(ptent))
6133 pgoff = linear_page_index(vma, addr);
6134 else /* pte_file(ptent) is true */
6135 pgoff = pte_to_pgoff(ptent);
6137 /* page is moved even if it's not RSS of this task(page-faulted). */
6138 page = find_get_page(mapping, pgoff);
6141 /* shmem/tmpfs may report page out on swap: account for that too. */
6142 if (radix_tree_exceptional_entry(page)) {
6143 swp_entry_t swap = radix_to_swp_entry(page);
6144 if (do_swap_account)
6146 page = find_get_page(&swapper_space, swap.val);
6152 static enum mc_target_type get_mctgt_type(struct vm_area_struct *vma,
6153 unsigned long addr, pte_t ptent, union mc_target *target)
6155 struct page *page = NULL;
6156 struct page_cgroup *pc;
6157 enum mc_target_type ret = MC_TARGET_NONE;
6158 swp_entry_t ent = { .val = 0 };
6160 if (pte_present(ptent))
6161 page = mc_handle_present_pte(vma, addr, ptent);
6162 else if (is_swap_pte(ptent))
6163 page = mc_handle_swap_pte(vma, addr, ptent, &ent);
6164 else if (pte_none(ptent) || pte_file(ptent))
6165 page = mc_handle_file_pte(vma, addr, ptent, &ent);
6167 if (!page && !ent.val)
6170 pc = lookup_page_cgroup(page);
6172 * Do only loose check w/o page_cgroup lock.
6173 * mem_cgroup_move_account() checks the pc is valid or not under
6176 if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) {
6177 ret = MC_TARGET_PAGE;
6179 target->page = page;
6181 if (!ret || !target)
6184 /* There is a swap entry and a page doesn't exist or isn't charged */
6185 if (ent.val && !ret &&
6186 css_id(&mc.from->css) == lookup_swap_cgroup_id(ent)) {
6187 ret = MC_TARGET_SWAP;
6194 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
6196 * We don't consider swapping or file mapped pages because THP does not
6197 * support them for now.
6198 * Caller should make sure that pmd_trans_huge(pmd) is true.
6200 static enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
6201 unsigned long addr, pmd_t pmd, union mc_target *target)
6203 struct page *page = NULL;
6204 struct page_cgroup *pc;
6205 enum mc_target_type ret = MC_TARGET_NONE;
6207 page = pmd_page(pmd);
6208 VM_BUG_ON(!page || !PageHead(page));
6211 pc = lookup_page_cgroup(page);
6212 if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) {
6213 ret = MC_TARGET_PAGE;
6216 target->page = page;
6222 static inline enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
6223 unsigned long addr, pmd_t pmd, union mc_target *target)
6225 return MC_TARGET_NONE;
6229 static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd,
6230 unsigned long addr, unsigned long end,
6231 struct mm_walk *walk)
6233 struct vm_area_struct *vma = walk->private;
6237 if (pmd_trans_huge_lock(pmd, vma) == 1) {
6238 if (get_mctgt_type_thp(vma, addr, *pmd, NULL) == MC_TARGET_PAGE)
6239 mc.precharge += HPAGE_PMD_NR;
6240 spin_unlock(&vma->vm_mm->page_table_lock);
6244 if (pmd_trans_unstable(pmd))
6246 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
6247 for (; addr != end; pte++, addr += PAGE_SIZE)
6248 if (get_mctgt_type(vma, addr, *pte, NULL))
6249 mc.precharge++; /* increment precharge temporarily */
6250 pte_unmap_unlock(pte - 1, ptl);
6256 static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm)
6258 unsigned long precharge;
6259 struct vm_area_struct *vma;
6261 down_read(&mm->mmap_sem);
6262 for (vma = mm->mmap; vma; vma = vma->vm_next) {
6263 struct mm_walk mem_cgroup_count_precharge_walk = {
6264 .pmd_entry = mem_cgroup_count_precharge_pte_range,
6268 if (is_vm_hugetlb_page(vma))
6270 walk_page_range(vma->vm_start, vma->vm_end,
6271 &mem_cgroup_count_precharge_walk);
6273 up_read(&mm->mmap_sem);
6275 precharge = mc.precharge;
6281 static int mem_cgroup_precharge_mc(struct mm_struct *mm)
6283 unsigned long precharge = mem_cgroup_count_precharge(mm);
6285 VM_BUG_ON(mc.moving_task);
6286 mc.moving_task = current;
6287 return mem_cgroup_do_precharge(precharge);
6290 /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */
6291 static void __mem_cgroup_clear_mc(void)
6293 struct mem_cgroup *from = mc.from;
6294 struct mem_cgroup *to = mc.to;
6296 /* we must uncharge all the leftover precharges from mc.to */
6298 __mem_cgroup_cancel_charge(mc.to, mc.precharge);
6302 * we didn't uncharge from mc.from at mem_cgroup_move_account(), so
6303 * we must uncharge here.
6305 if (mc.moved_charge) {
6306 __mem_cgroup_cancel_charge(mc.from, mc.moved_charge);
6307 mc.moved_charge = 0;
6309 /* we must fixup refcnts and charges */
6310 if (mc.moved_swap) {
6311 /* uncharge swap account from the old cgroup */
6312 if (!mem_cgroup_is_root(mc.from))
6313 res_counter_uncharge(&mc.from->memsw,
6314 PAGE_SIZE * mc.moved_swap);
6315 __mem_cgroup_put(mc.from, mc.moved_swap);
6317 if (!mem_cgroup_is_root(mc.to)) {
6319 * we charged both to->res and to->memsw, so we should
6322 res_counter_uncharge(&mc.to->res,
6323 PAGE_SIZE * mc.moved_swap);
6325 /* we've already done mem_cgroup_get(mc.to) */
6328 memcg_oom_recover(from);
6329 memcg_oom_recover(to);
6330 wake_up_all(&mc.waitq);
6333 static void mem_cgroup_clear_mc(void)
6335 struct mem_cgroup *from = mc.from;
6338 * we must clear moving_task before waking up waiters at the end of
6341 mc.moving_task = NULL;
6342 __mem_cgroup_clear_mc();
6343 spin_lock(&mc.lock);
6346 spin_unlock(&mc.lock);
6347 mem_cgroup_end_move(from);
6350 static int mem_cgroup_can_attach(struct cgroup *cgroup,
6351 struct cgroup_taskset *tset)
6353 struct task_struct *p = cgroup_taskset_first(tset);
6355 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgroup);
6357 if (memcg->move_charge_at_immigrate) {
6358 struct mm_struct *mm;
6359 struct mem_cgroup *from = mem_cgroup_from_task(p);
6361 VM_BUG_ON(from == memcg);
6363 mm = get_task_mm(p);
6366 /* We move charges only when we move a owner of the mm */
6367 if (mm->owner == p) {
6370 VM_BUG_ON(mc.precharge);
6371 VM_BUG_ON(mc.moved_charge);
6372 VM_BUG_ON(mc.moved_swap);
6373 mem_cgroup_start_move(from);
6374 spin_lock(&mc.lock);
6377 spin_unlock(&mc.lock);
6378 /* We set mc.moving_task later */
6380 ret = mem_cgroup_precharge_mc(mm);
6382 mem_cgroup_clear_mc();
6389 static void mem_cgroup_cancel_attach(struct cgroup *cgroup,
6390 struct cgroup_taskset *tset)
6392 mem_cgroup_clear_mc();
6395 static int mem_cgroup_move_charge_pte_range(pmd_t *pmd,
6396 unsigned long addr, unsigned long end,
6397 struct mm_walk *walk)
6400 struct vm_area_struct *vma = walk->private;
6403 enum mc_target_type target_type;
6404 union mc_target target;
6406 struct page_cgroup *pc;
6409 * We don't take compound_lock() here but no race with splitting thp
6411 * - if pmd_trans_huge_lock() returns 1, the relevant thp is not
6412 * under splitting, which means there's no concurrent thp split,
6413 * - if another thread runs into split_huge_page() just after we
6414 * entered this if-block, the thread must wait for page table lock
6415 * to be unlocked in __split_huge_page_splitting(), where the main
6416 * part of thp split is not executed yet.
6418 if (pmd_trans_huge_lock(pmd, vma) == 1) {
6419 if (mc.precharge < HPAGE_PMD_NR) {
6420 spin_unlock(&vma->vm_mm->page_table_lock);
6423 target_type = get_mctgt_type_thp(vma, addr, *pmd, &target);
6424 if (target_type == MC_TARGET_PAGE) {
6426 if (!isolate_lru_page(page)) {
6427 pc = lookup_page_cgroup(page);
6428 if (!mem_cgroup_move_account(page, HPAGE_PMD_NR,
6429 pc, mc.from, mc.to)) {
6430 mc.precharge -= HPAGE_PMD_NR;
6431 mc.moved_charge += HPAGE_PMD_NR;
6433 putback_lru_page(page);
6437 spin_unlock(&vma->vm_mm->page_table_lock);
6441 if (pmd_trans_unstable(pmd))
6444 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
6445 for (; addr != end; addr += PAGE_SIZE) {
6446 pte_t ptent = *(pte++);
6452 switch (get_mctgt_type(vma, addr, ptent, &target)) {
6453 case MC_TARGET_PAGE:
6455 if (isolate_lru_page(page))
6457 pc = lookup_page_cgroup(page);
6458 if (!mem_cgroup_move_account(page, 1, pc,
6461 /* we uncharge from mc.from later. */
6464 putback_lru_page(page);
6465 put: /* get_mctgt_type() gets the page */
6468 case MC_TARGET_SWAP:
6470 if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to)) {
6472 /* we fixup refcnts and charges later. */
6480 pte_unmap_unlock(pte - 1, ptl);
6485 * We have consumed all precharges we got in can_attach().
6486 * We try charge one by one, but don't do any additional
6487 * charges to mc.to if we have failed in charge once in attach()
6490 ret = mem_cgroup_do_precharge(1);
6498 static void mem_cgroup_move_charge(struct mm_struct *mm)
6500 struct vm_area_struct *vma;
6502 lru_add_drain_all();
6504 if (unlikely(!down_read_trylock(&mm->mmap_sem))) {
6506 * Someone who are holding the mmap_sem might be waiting in
6507 * waitq. So we cancel all extra charges, wake up all waiters,
6508 * and retry. Because we cancel precharges, we might not be able
6509 * to move enough charges, but moving charge is a best-effort
6510 * feature anyway, so it wouldn't be a big problem.
6512 __mem_cgroup_clear_mc();
6516 for (vma = mm->mmap; vma; vma = vma->vm_next) {
6518 struct mm_walk mem_cgroup_move_charge_walk = {
6519 .pmd_entry = mem_cgroup_move_charge_pte_range,
6523 if (is_vm_hugetlb_page(vma))
6525 ret = walk_page_range(vma->vm_start, vma->vm_end,
6526 &mem_cgroup_move_charge_walk);
6529 * means we have consumed all precharges and failed in
6530 * doing additional charge. Just abandon here.
6534 up_read(&mm->mmap_sem);
6537 static void mem_cgroup_move_task(struct cgroup *cont,
6538 struct cgroup_taskset *tset)
6540 struct task_struct *p = cgroup_taskset_first(tset);
6541 struct mm_struct *mm = get_task_mm(p);
6545 mem_cgroup_move_charge(mm);
6549 mem_cgroup_clear_mc();
6551 #else /* !CONFIG_MMU */
6552 static int mem_cgroup_can_attach(struct cgroup *cgroup,
6553 struct cgroup_taskset *tset)
6557 static void mem_cgroup_cancel_attach(struct cgroup *cgroup,
6558 struct cgroup_taskset *tset)
6561 static void mem_cgroup_move_task(struct cgroup *cont,
6562 struct cgroup_taskset *tset)
6567 struct cgroup_subsys mem_cgroup_subsys = {
6569 .subsys_id = mem_cgroup_subsys_id,
6570 .css_alloc = mem_cgroup_css_alloc,
6571 .css_offline = mem_cgroup_css_offline,
6572 .css_free = mem_cgroup_css_free,
6573 .can_attach = mem_cgroup_can_attach,
6574 .cancel_attach = mem_cgroup_cancel_attach,
6575 .attach = mem_cgroup_move_task,
6576 .base_cftypes = mem_cgroup_files,
6581 #ifdef CONFIG_MEMCG_SWAP
6582 static int __init enable_swap_account(char *s)
6584 /* consider enabled if no parameter or 1 is given */
6585 if (!strcmp(s, "1"))
6586 really_do_swap_account = 1;
6587 else if (!strcmp(s, "0"))
6588 really_do_swap_account = 0;
6591 __setup("swapaccount=", enable_swap_account);