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 * This program is free software; you can redistribute it and/or modify
14 * it under the terms of the GNU General Public License as published by
15 * the Free Software Foundation; either version 2 of the License, or
16 * (at your option) any later version.
18 * This program is distributed in the hope that it will be useful,
19 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 * GNU General Public License for more details.
24 #include <linux/res_counter.h>
25 #include <linux/memcontrol.h>
26 #include <linux/cgroup.h>
28 #include <linux/hugetlb.h>
29 #include <linux/pagemap.h>
30 #include <linux/smp.h>
31 #include <linux/page-flags.h>
32 #include <linux/backing-dev.h>
33 #include <linux/bit_spinlock.h>
34 #include <linux/rcupdate.h>
35 #include <linux/limits.h>
36 #include <linux/export.h>
37 #include <linux/mutex.h>
38 #include <linux/rbtree.h>
39 #include <linux/slab.h>
40 #include <linux/swap.h>
41 #include <linux/swapops.h>
42 #include <linux/spinlock.h>
43 #include <linux/eventfd.h>
44 #include <linux/sort.h>
46 #include <linux/seq_file.h>
47 #include <linux/vmalloc.h>
48 #include <linux/mm_inline.h>
49 #include <linux/page_cgroup.h>
50 #include <linux/cpu.h>
51 #include <linux/oom.h>
54 #include <net/tcp_memcontrol.h>
56 #include <asm/uaccess.h>
58 #include <trace/events/vmscan.h>
60 struct cgroup_subsys mem_cgroup_subsys __read_mostly;
61 #define MEM_CGROUP_RECLAIM_RETRIES 5
62 static struct mem_cgroup *root_mem_cgroup __read_mostly;
64 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP
65 /* Turned on only when memory cgroup is enabled && really_do_swap_account = 1 */
66 int do_swap_account __read_mostly;
68 /* for remember boot option*/
69 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP_ENABLED
70 static int really_do_swap_account __initdata = 1;
72 static int really_do_swap_account __initdata = 0;
76 #define do_swap_account 0
81 * Statistics for memory cgroup.
83 enum mem_cgroup_stat_index {
85 * For MEM_CONTAINER_TYPE_ALL, usage = pagecache + rss.
87 MEM_CGROUP_STAT_CACHE, /* # of pages charged as cache */
88 MEM_CGROUP_STAT_RSS, /* # of pages charged as anon rss */
89 MEM_CGROUP_STAT_FILE_MAPPED, /* # of pages charged as file rss */
90 MEM_CGROUP_STAT_SWAPOUT, /* # of pages, swapped out */
91 MEM_CGROUP_STAT_DATA, /* end of data requires synchronization */
92 MEM_CGROUP_STAT_NSTATS,
95 enum mem_cgroup_events_index {
96 MEM_CGROUP_EVENTS_PGPGIN, /* # of pages paged in */
97 MEM_CGROUP_EVENTS_PGPGOUT, /* # of pages paged out */
98 MEM_CGROUP_EVENTS_COUNT, /* # of pages paged in/out */
99 MEM_CGROUP_EVENTS_PGFAULT, /* # of page-faults */
100 MEM_CGROUP_EVENTS_PGMAJFAULT, /* # of major page-faults */
101 MEM_CGROUP_EVENTS_NSTATS,
104 * Per memcg event counter is incremented at every pagein/pageout. With THP,
105 * it will be incremated by the number of pages. This counter is used for
106 * for trigger some periodic events. This is straightforward and better
107 * than using jiffies etc. to handle periodic memcg event.
109 enum mem_cgroup_events_target {
110 MEM_CGROUP_TARGET_THRESH,
111 MEM_CGROUP_TARGET_SOFTLIMIT,
112 MEM_CGROUP_TARGET_NUMAINFO,
115 #define THRESHOLDS_EVENTS_TARGET 128
116 #define SOFTLIMIT_EVENTS_TARGET 1024
117 #define NUMAINFO_EVENTS_TARGET 1024
119 struct mem_cgroup_stat_cpu {
120 long count[MEM_CGROUP_STAT_NSTATS];
121 unsigned long events[MEM_CGROUP_EVENTS_NSTATS];
122 unsigned long targets[MEM_CGROUP_NTARGETS];
125 struct mem_cgroup_reclaim_iter {
126 /* css_id of the last scanned hierarchy member */
128 /* scan generation, increased every round-trip */
129 unsigned int generation;
133 * per-zone information in memory controller.
135 struct mem_cgroup_per_zone {
136 struct lruvec lruvec;
137 unsigned long lru_size[NR_LRU_LISTS];
139 struct mem_cgroup_reclaim_iter reclaim_iter[DEF_PRIORITY + 1];
141 struct rb_node tree_node; /* RB tree node */
142 unsigned long long usage_in_excess;/* Set to the value by which */
143 /* the soft limit is exceeded*/
145 struct mem_cgroup *memcg; /* Back pointer, we cannot */
146 /* use container_of */
149 struct mem_cgroup_per_node {
150 struct mem_cgroup_per_zone zoneinfo[MAX_NR_ZONES];
153 struct mem_cgroup_lru_info {
154 struct mem_cgroup_per_node *nodeinfo[MAX_NUMNODES];
158 * Cgroups above their limits are maintained in a RB-Tree, independent of
159 * their hierarchy representation
162 struct mem_cgroup_tree_per_zone {
163 struct rb_root rb_root;
167 struct mem_cgroup_tree_per_node {
168 struct mem_cgroup_tree_per_zone rb_tree_per_zone[MAX_NR_ZONES];
171 struct mem_cgroup_tree {
172 struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES];
175 static struct mem_cgroup_tree soft_limit_tree __read_mostly;
177 struct mem_cgroup_threshold {
178 struct eventfd_ctx *eventfd;
183 struct mem_cgroup_threshold_ary {
184 /* An array index points to threshold just below or equal to usage. */
185 int current_threshold;
186 /* Size of entries[] */
188 /* Array of thresholds */
189 struct mem_cgroup_threshold entries[0];
192 struct mem_cgroup_thresholds {
193 /* Primary thresholds array */
194 struct mem_cgroup_threshold_ary *primary;
196 * Spare threshold array.
197 * This is needed to make mem_cgroup_unregister_event() "never fail".
198 * It must be able to store at least primary->size - 1 entries.
200 struct mem_cgroup_threshold_ary *spare;
204 struct mem_cgroup_eventfd_list {
205 struct list_head list;
206 struct eventfd_ctx *eventfd;
209 static void mem_cgroup_threshold(struct mem_cgroup *memcg);
210 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg);
213 * The memory controller data structure. The memory controller controls both
214 * page cache and RSS per cgroup. We would eventually like to provide
215 * statistics based on the statistics developed by Rik Van Riel for clock-pro,
216 * to help the administrator determine what knobs to tune.
218 * TODO: Add a water mark for the memory controller. Reclaim will begin when
219 * we hit the water mark. May be even add a low water mark, such that
220 * no reclaim occurs from a cgroup at it's low water mark, this is
221 * a feature that will be implemented much later in the future.
224 struct cgroup_subsys_state css;
226 * the counter to account for memory usage
228 struct res_counter res;
232 * the counter to account for mem+swap usage.
234 struct res_counter memsw;
237 * rcu_freeing is used only when freeing struct mem_cgroup,
238 * so put it into a union to avoid wasting more memory.
239 * It must be disjoint from the css field. It could be
240 * in a union with the res field, but res plays a much
241 * larger part in mem_cgroup life than memsw, and might
242 * be of interest, even at time of free, when debugging.
243 * So share rcu_head with the less interesting memsw.
245 struct rcu_head rcu_freeing;
247 * But when using vfree(), that cannot be done at
248 * interrupt time, so we must then queue the work.
250 struct work_struct work_freeing;
254 * Per cgroup active and inactive list, similar to the
255 * per zone LRU lists.
257 struct mem_cgroup_lru_info info;
258 int last_scanned_node;
260 nodemask_t scan_nodes;
261 atomic_t numainfo_events;
262 atomic_t numainfo_updating;
265 * Should the accounting and control be hierarchical, per subtree?
275 /* OOM-Killer disable */
276 int oom_kill_disable;
278 /* set when res.limit == memsw.limit */
279 bool memsw_is_minimum;
281 /* protect arrays of thresholds */
282 struct mutex thresholds_lock;
284 /* thresholds for memory usage. RCU-protected */
285 struct mem_cgroup_thresholds thresholds;
287 /* thresholds for mem+swap usage. RCU-protected */
288 struct mem_cgroup_thresholds memsw_thresholds;
290 /* For oom notifier event fd */
291 struct list_head oom_notify;
294 * Should we move charges of a task when a task is moved into this
295 * mem_cgroup ? And what type of charges should we move ?
297 unsigned long move_charge_at_immigrate;
299 * set > 0 if pages under this cgroup are moving to other cgroup.
301 atomic_t moving_account;
302 /* taken only while moving_account > 0 */
303 spinlock_t move_lock;
307 struct mem_cgroup_stat_cpu __percpu *stat;
309 * used when a cpu is offlined or other synchronizations
310 * See mem_cgroup_read_stat().
312 struct mem_cgroup_stat_cpu nocpu_base;
313 spinlock_t pcp_counter_lock;
316 struct tcp_memcontrol tcp_mem;
320 /* Stuffs for move charges at task migration. */
322 * Types of charges to be moved. "move_charge_at_immitgrate" is treated as a
323 * left-shifted bitmap of these types.
326 MOVE_CHARGE_TYPE_ANON, /* private anonymous page and swap of it */
327 MOVE_CHARGE_TYPE_FILE, /* file page(including tmpfs) and swap of it */
331 /* "mc" and its members are protected by cgroup_mutex */
332 static struct move_charge_struct {
333 spinlock_t lock; /* for from, to */
334 struct mem_cgroup *from;
335 struct mem_cgroup *to;
336 unsigned long precharge;
337 unsigned long moved_charge;
338 unsigned long moved_swap;
339 struct task_struct *moving_task; /* a task moving charges */
340 wait_queue_head_t waitq; /* a waitq for other context */
342 .lock = __SPIN_LOCK_UNLOCKED(mc.lock),
343 .waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq),
346 static bool move_anon(void)
348 return test_bit(MOVE_CHARGE_TYPE_ANON,
349 &mc.to->move_charge_at_immigrate);
352 static bool move_file(void)
354 return test_bit(MOVE_CHARGE_TYPE_FILE,
355 &mc.to->move_charge_at_immigrate);
359 * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft
360 * limit reclaim to prevent infinite loops, if they ever occur.
362 #define MEM_CGROUP_MAX_RECLAIM_LOOPS 100
363 #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS 2
366 MEM_CGROUP_CHARGE_TYPE_CACHE = 0,
367 MEM_CGROUP_CHARGE_TYPE_MAPPED,
368 MEM_CGROUP_CHARGE_TYPE_SHMEM, /* used by page migration of shmem */
369 MEM_CGROUP_CHARGE_TYPE_FORCE, /* used by force_empty */
370 MEM_CGROUP_CHARGE_TYPE_SWAPOUT, /* for accounting swapcache */
371 MEM_CGROUP_CHARGE_TYPE_DROP, /* a page was unused swap cache */
375 /* for encoding cft->private value on file */
378 #define _OOM_TYPE (2)
379 #define MEMFILE_PRIVATE(x, val) ((x) << 16 | (val))
380 #define MEMFILE_TYPE(val) ((val) >> 16 & 0xffff)
381 #define MEMFILE_ATTR(val) ((val) & 0xffff)
382 /* Used for OOM nofiier */
383 #define OOM_CONTROL (0)
386 * Reclaim flags for mem_cgroup_hierarchical_reclaim
388 #define MEM_CGROUP_RECLAIM_NOSWAP_BIT 0x0
389 #define MEM_CGROUP_RECLAIM_NOSWAP (1 << MEM_CGROUP_RECLAIM_NOSWAP_BIT)
390 #define MEM_CGROUP_RECLAIM_SHRINK_BIT 0x1
391 #define MEM_CGROUP_RECLAIM_SHRINK (1 << MEM_CGROUP_RECLAIM_SHRINK_BIT)
393 static void mem_cgroup_get(struct mem_cgroup *memcg);
394 static void mem_cgroup_put(struct mem_cgroup *memcg);
396 /* Writing them here to avoid exposing memcg's inner layout */
397 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_KMEM
398 #include <net/sock.h>
401 static bool mem_cgroup_is_root(struct mem_cgroup *memcg);
402 void sock_update_memcg(struct sock *sk)
404 if (mem_cgroup_sockets_enabled) {
405 struct mem_cgroup *memcg;
407 BUG_ON(!sk->sk_prot->proto_cgroup);
409 /* Socket cloning can throw us here with sk_cgrp already
410 * filled. It won't however, necessarily happen from
411 * process context. So the test for root memcg given
412 * the current task's memcg won't help us in this case.
414 * Respecting the original socket's memcg is a better
415 * decision in this case.
418 BUG_ON(mem_cgroup_is_root(sk->sk_cgrp->memcg));
419 mem_cgroup_get(sk->sk_cgrp->memcg);
424 memcg = mem_cgroup_from_task(current);
425 if (!mem_cgroup_is_root(memcg)) {
426 mem_cgroup_get(memcg);
427 sk->sk_cgrp = sk->sk_prot->proto_cgroup(memcg);
432 EXPORT_SYMBOL(sock_update_memcg);
434 void sock_release_memcg(struct sock *sk)
436 if (mem_cgroup_sockets_enabled && sk->sk_cgrp) {
437 struct mem_cgroup *memcg;
438 WARN_ON(!sk->sk_cgrp->memcg);
439 memcg = sk->sk_cgrp->memcg;
440 mem_cgroup_put(memcg);
445 struct cg_proto *tcp_proto_cgroup(struct mem_cgroup *memcg)
447 if (!memcg || mem_cgroup_is_root(memcg))
450 return &memcg->tcp_mem.cg_proto;
452 EXPORT_SYMBOL(tcp_proto_cgroup);
453 #endif /* CONFIG_INET */
454 #endif /* CONFIG_CGROUP_MEM_RES_CTLR_KMEM */
456 static void drain_all_stock_async(struct mem_cgroup *memcg);
458 static struct mem_cgroup_per_zone *
459 mem_cgroup_zoneinfo(struct mem_cgroup *memcg, int nid, int zid)
461 return &memcg->info.nodeinfo[nid]->zoneinfo[zid];
464 struct cgroup_subsys_state *mem_cgroup_css(struct mem_cgroup *memcg)
469 static struct mem_cgroup_per_zone *
470 page_cgroup_zoneinfo(struct mem_cgroup *memcg, struct page *page)
472 int nid = page_to_nid(page);
473 int zid = page_zonenum(page);
475 return mem_cgroup_zoneinfo(memcg, nid, zid);
478 static struct mem_cgroup_tree_per_zone *
479 soft_limit_tree_node_zone(int nid, int zid)
481 return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid];
484 static struct mem_cgroup_tree_per_zone *
485 soft_limit_tree_from_page(struct page *page)
487 int nid = page_to_nid(page);
488 int zid = page_zonenum(page);
490 return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid];
494 __mem_cgroup_insert_exceeded(struct mem_cgroup *memcg,
495 struct mem_cgroup_per_zone *mz,
496 struct mem_cgroup_tree_per_zone *mctz,
497 unsigned long long new_usage_in_excess)
499 struct rb_node **p = &mctz->rb_root.rb_node;
500 struct rb_node *parent = NULL;
501 struct mem_cgroup_per_zone *mz_node;
506 mz->usage_in_excess = new_usage_in_excess;
507 if (!mz->usage_in_excess)
511 mz_node = rb_entry(parent, struct mem_cgroup_per_zone,
513 if (mz->usage_in_excess < mz_node->usage_in_excess)
516 * We can't avoid mem cgroups that are over their soft
517 * limit by the same amount
519 else if (mz->usage_in_excess >= mz_node->usage_in_excess)
522 rb_link_node(&mz->tree_node, parent, p);
523 rb_insert_color(&mz->tree_node, &mctz->rb_root);
528 __mem_cgroup_remove_exceeded(struct mem_cgroup *memcg,
529 struct mem_cgroup_per_zone *mz,
530 struct mem_cgroup_tree_per_zone *mctz)
534 rb_erase(&mz->tree_node, &mctz->rb_root);
539 mem_cgroup_remove_exceeded(struct mem_cgroup *memcg,
540 struct mem_cgroup_per_zone *mz,
541 struct mem_cgroup_tree_per_zone *mctz)
543 spin_lock(&mctz->lock);
544 __mem_cgroup_remove_exceeded(memcg, mz, mctz);
545 spin_unlock(&mctz->lock);
549 static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page)
551 unsigned long long excess;
552 struct mem_cgroup_per_zone *mz;
553 struct mem_cgroup_tree_per_zone *mctz;
554 int nid = page_to_nid(page);
555 int zid = page_zonenum(page);
556 mctz = soft_limit_tree_from_page(page);
559 * Necessary to update all ancestors when hierarchy is used.
560 * because their event counter is not touched.
562 for (; memcg; memcg = parent_mem_cgroup(memcg)) {
563 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
564 excess = res_counter_soft_limit_excess(&memcg->res);
566 * We have to update the tree if mz is on RB-tree or
567 * mem is over its softlimit.
569 if (excess || mz->on_tree) {
570 spin_lock(&mctz->lock);
571 /* if on-tree, remove it */
573 __mem_cgroup_remove_exceeded(memcg, mz, mctz);
575 * Insert again. mz->usage_in_excess will be updated.
576 * If excess is 0, no tree ops.
578 __mem_cgroup_insert_exceeded(memcg, mz, mctz, excess);
579 spin_unlock(&mctz->lock);
584 static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg)
587 struct mem_cgroup_per_zone *mz;
588 struct mem_cgroup_tree_per_zone *mctz;
590 for_each_node(node) {
591 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
592 mz = mem_cgroup_zoneinfo(memcg, node, zone);
593 mctz = soft_limit_tree_node_zone(node, zone);
594 mem_cgroup_remove_exceeded(memcg, mz, mctz);
599 static struct mem_cgroup_per_zone *
600 __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz)
602 struct rb_node *rightmost = NULL;
603 struct mem_cgroup_per_zone *mz;
607 rightmost = rb_last(&mctz->rb_root);
609 goto done; /* Nothing to reclaim from */
611 mz = rb_entry(rightmost, struct mem_cgroup_per_zone, tree_node);
613 * Remove the node now but someone else can add it back,
614 * we will to add it back at the end of reclaim to its correct
615 * position in the tree.
617 __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz);
618 if (!res_counter_soft_limit_excess(&mz->memcg->res) ||
619 !css_tryget(&mz->memcg->css))
625 static struct mem_cgroup_per_zone *
626 mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz)
628 struct mem_cgroup_per_zone *mz;
630 spin_lock(&mctz->lock);
631 mz = __mem_cgroup_largest_soft_limit_node(mctz);
632 spin_unlock(&mctz->lock);
637 * Implementation Note: reading percpu statistics for memcg.
639 * Both of vmstat[] and percpu_counter has threshold and do periodic
640 * synchronization to implement "quick" read. There are trade-off between
641 * reading cost and precision of value. Then, we may have a chance to implement
642 * a periodic synchronizion of counter in memcg's counter.
644 * But this _read() function is used for user interface now. The user accounts
645 * memory usage by memory cgroup and he _always_ requires exact value because
646 * he accounts memory. Even if we provide quick-and-fuzzy read, we always
647 * have to visit all online cpus and make sum. So, for now, unnecessary
648 * synchronization is not implemented. (just implemented for cpu hotplug)
650 * If there are kernel internal actions which can make use of some not-exact
651 * value, and reading all cpu value can be performance bottleneck in some
652 * common workload, threashold and synchonization as vmstat[] should be
655 static long mem_cgroup_read_stat(struct mem_cgroup *memcg,
656 enum mem_cgroup_stat_index idx)
662 for_each_online_cpu(cpu)
663 val += per_cpu(memcg->stat->count[idx], cpu);
664 #ifdef CONFIG_HOTPLUG_CPU
665 spin_lock(&memcg->pcp_counter_lock);
666 val += memcg->nocpu_base.count[idx];
667 spin_unlock(&memcg->pcp_counter_lock);
673 static void mem_cgroup_swap_statistics(struct mem_cgroup *memcg,
676 int val = (charge) ? 1 : -1;
677 this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_SWAPOUT], val);
680 static unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg,
681 enum mem_cgroup_events_index idx)
683 unsigned long val = 0;
686 for_each_online_cpu(cpu)
687 val += per_cpu(memcg->stat->events[idx], cpu);
688 #ifdef CONFIG_HOTPLUG_CPU
689 spin_lock(&memcg->pcp_counter_lock);
690 val += memcg->nocpu_base.events[idx];
691 spin_unlock(&memcg->pcp_counter_lock);
696 static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg,
697 bool anon, int nr_pages)
702 * Here, RSS means 'mapped anon' and anon's SwapCache. Shmem/tmpfs is
703 * counted as CACHE even if it's on ANON LRU.
706 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_RSS],
709 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_CACHE],
712 /* pagein of a big page is an event. So, ignore page size */
714 __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGIN]);
716 __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGOUT]);
717 nr_pages = -nr_pages; /* for event */
720 __this_cpu_add(memcg->stat->events[MEM_CGROUP_EVENTS_COUNT], nr_pages);
726 mem_cgroup_get_lruvec_size(struct lruvec *lruvec, enum lru_list lru)
728 struct mem_cgroup_per_zone *mz;
730 mz = container_of(lruvec, struct mem_cgroup_per_zone, lruvec);
731 return mz->lru_size[lru];
735 mem_cgroup_zone_nr_lru_pages(struct mem_cgroup *memcg, int nid, int zid,
736 unsigned int lru_mask)
738 struct mem_cgroup_per_zone *mz;
740 unsigned long ret = 0;
742 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
745 if (BIT(lru) & lru_mask)
746 ret += mz->lru_size[lru];
752 mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg,
753 int nid, unsigned int lru_mask)
758 for (zid = 0; zid < MAX_NR_ZONES; zid++)
759 total += mem_cgroup_zone_nr_lru_pages(memcg,
765 static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg,
766 unsigned int lru_mask)
771 for_each_node_state(nid, N_HIGH_MEMORY)
772 total += mem_cgroup_node_nr_lru_pages(memcg, nid, lru_mask);
776 static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg,
777 enum mem_cgroup_events_target target)
779 unsigned long val, next;
781 val = __this_cpu_read(memcg->stat->events[MEM_CGROUP_EVENTS_COUNT]);
782 next = __this_cpu_read(memcg->stat->targets[target]);
783 /* from time_after() in jiffies.h */
784 if ((long)next - (long)val < 0) {
786 case MEM_CGROUP_TARGET_THRESH:
787 next = val + THRESHOLDS_EVENTS_TARGET;
789 case MEM_CGROUP_TARGET_SOFTLIMIT:
790 next = val + SOFTLIMIT_EVENTS_TARGET;
792 case MEM_CGROUP_TARGET_NUMAINFO:
793 next = val + NUMAINFO_EVENTS_TARGET;
798 __this_cpu_write(memcg->stat->targets[target], next);
805 * Check events in order.
808 static void memcg_check_events(struct mem_cgroup *memcg, struct page *page)
811 /* threshold event is triggered in finer grain than soft limit */
812 if (unlikely(mem_cgroup_event_ratelimit(memcg,
813 MEM_CGROUP_TARGET_THRESH))) {
815 bool do_numainfo __maybe_unused;
817 do_softlimit = mem_cgroup_event_ratelimit(memcg,
818 MEM_CGROUP_TARGET_SOFTLIMIT);
820 do_numainfo = mem_cgroup_event_ratelimit(memcg,
821 MEM_CGROUP_TARGET_NUMAINFO);
825 mem_cgroup_threshold(memcg);
826 if (unlikely(do_softlimit))
827 mem_cgroup_update_tree(memcg, page);
829 if (unlikely(do_numainfo))
830 atomic_inc(&memcg->numainfo_events);
836 struct mem_cgroup *mem_cgroup_from_cont(struct cgroup *cont)
838 return container_of(cgroup_subsys_state(cont,
839 mem_cgroup_subsys_id), struct mem_cgroup,
843 struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p)
846 * mm_update_next_owner() may clear mm->owner to NULL
847 * if it races with swapoff, page migration, etc.
848 * So this can be called with p == NULL.
853 return container_of(task_subsys_state(p, mem_cgroup_subsys_id),
854 struct mem_cgroup, css);
857 struct mem_cgroup *try_get_mem_cgroup_from_mm(struct mm_struct *mm)
859 struct mem_cgroup *memcg = NULL;
864 * Because we have no locks, mm->owner's may be being moved to other
865 * cgroup. We use css_tryget() here even if this looks
866 * pessimistic (rather than adding locks here).
870 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
871 if (unlikely(!memcg))
873 } while (!css_tryget(&memcg->css));
879 * mem_cgroup_iter - iterate over memory cgroup hierarchy
880 * @root: hierarchy root
881 * @prev: previously returned memcg, NULL on first invocation
882 * @reclaim: cookie for shared reclaim walks, NULL for full walks
884 * Returns references to children of the hierarchy below @root, or
885 * @root itself, or %NULL after a full round-trip.
887 * Caller must pass the return value in @prev on subsequent
888 * invocations for reference counting, or use mem_cgroup_iter_break()
889 * to cancel a hierarchy walk before the round-trip is complete.
891 * Reclaimers can specify a zone and a priority level in @reclaim to
892 * divide up the memcgs in the hierarchy among all concurrent
893 * reclaimers operating on the same zone and priority.
895 struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root,
896 struct mem_cgroup *prev,
897 struct mem_cgroup_reclaim_cookie *reclaim)
899 struct mem_cgroup *memcg = NULL;
902 if (mem_cgroup_disabled())
906 root = root_mem_cgroup;
908 if (prev && !reclaim)
909 id = css_id(&prev->css);
911 if (prev && prev != root)
914 if (!root->use_hierarchy && root != root_mem_cgroup) {
921 struct mem_cgroup_reclaim_iter *uninitialized_var(iter);
922 struct cgroup_subsys_state *css;
925 int nid = zone_to_nid(reclaim->zone);
926 int zid = zone_idx(reclaim->zone);
927 struct mem_cgroup_per_zone *mz;
929 mz = mem_cgroup_zoneinfo(root, nid, zid);
930 iter = &mz->reclaim_iter[reclaim->priority];
931 if (prev && reclaim->generation != iter->generation)
937 css = css_get_next(&mem_cgroup_subsys, id + 1, &root->css, &id);
939 if (css == &root->css || css_tryget(css))
940 memcg = container_of(css,
941 struct mem_cgroup, css);
950 else if (!prev && memcg)
951 reclaim->generation = iter->generation;
961 * mem_cgroup_iter_break - abort a hierarchy walk prematurely
962 * @root: hierarchy root
963 * @prev: last visited hierarchy member as returned by mem_cgroup_iter()
965 void mem_cgroup_iter_break(struct mem_cgroup *root,
966 struct mem_cgroup *prev)
969 root = root_mem_cgroup;
970 if (prev && prev != root)
975 * Iteration constructs for visiting all cgroups (under a tree). If
976 * loops are exited prematurely (break), mem_cgroup_iter_break() must
977 * be used for reference counting.
979 #define for_each_mem_cgroup_tree(iter, root) \
980 for (iter = mem_cgroup_iter(root, NULL, NULL); \
982 iter = mem_cgroup_iter(root, iter, NULL))
984 #define for_each_mem_cgroup(iter) \
985 for (iter = mem_cgroup_iter(NULL, NULL, NULL); \
987 iter = mem_cgroup_iter(NULL, iter, NULL))
989 static inline bool mem_cgroup_is_root(struct mem_cgroup *memcg)
991 return (memcg == root_mem_cgroup);
994 void mem_cgroup_count_vm_event(struct mm_struct *mm, enum vm_event_item idx)
996 struct mem_cgroup *memcg;
1002 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
1003 if (unlikely(!memcg))
1008 this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGFAULT]);
1011 this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGMAJFAULT]);
1019 EXPORT_SYMBOL(mem_cgroup_count_vm_event);
1022 * mem_cgroup_zone_lruvec - get the lru list vector for a zone and memcg
1023 * @zone: zone of the wanted lruvec
1024 * @mem: memcg of the wanted lruvec
1026 * Returns the lru list vector holding pages for the given @zone and
1027 * @mem. This can be the global zone lruvec, if the memory controller
1030 struct lruvec *mem_cgroup_zone_lruvec(struct zone *zone,
1031 struct mem_cgroup *memcg)
1033 struct mem_cgroup_per_zone *mz;
1035 if (mem_cgroup_disabled())
1036 return &zone->lruvec;
1038 mz = mem_cgroup_zoneinfo(memcg, zone_to_nid(zone), zone_idx(zone));
1043 * Following LRU functions are allowed to be used without PCG_LOCK.
1044 * Operations are called by routine of global LRU independently from memcg.
1045 * What we have to take care of here is validness of pc->mem_cgroup.
1047 * Changes to pc->mem_cgroup happens when
1050 * In typical case, "charge" is done before add-to-lru. Exception is SwapCache.
1051 * It is added to LRU before charge.
1052 * If PCG_USED bit is not set, page_cgroup is not added to this private LRU.
1053 * When moving account, the page is not on LRU. It's isolated.
1057 * mem_cgroup_lru_add_list - account for adding an lru page and return lruvec
1058 * @zone: zone of the page
1062 * This function accounts for @page being added to @lru, and returns
1063 * the lruvec for the given @zone and the memcg @page is charged to.
1065 * The callsite is then responsible for physically linking the page to
1066 * the returned lruvec->lists[@lru].
1068 struct lruvec *mem_cgroup_lru_add_list(struct zone *zone, struct page *page,
1071 struct mem_cgroup_per_zone *mz;
1072 struct mem_cgroup *memcg;
1073 struct page_cgroup *pc;
1075 if (mem_cgroup_disabled())
1076 return &zone->lruvec;
1078 pc = lookup_page_cgroup(page);
1079 memcg = pc->mem_cgroup;
1082 * Surreptitiously switch any uncharged page to root:
1083 * an uncharged page off lru does nothing to secure
1084 * its former mem_cgroup from sudden removal.
1086 * Our caller holds lru_lock, and PageCgroupUsed is updated
1087 * under page_cgroup lock: between them, they make all uses
1088 * of pc->mem_cgroup safe.
1090 if (!PageCgroupUsed(pc) && memcg != root_mem_cgroup)
1091 pc->mem_cgroup = memcg = root_mem_cgroup;
1093 mz = page_cgroup_zoneinfo(memcg, page);
1094 /* compound_order() is stabilized through lru_lock */
1095 mz->lru_size[lru] += 1 << compound_order(page);
1100 * mem_cgroup_lru_del_list - account for removing an lru page
1104 * This function accounts for @page being removed from @lru.
1106 * The callsite is then responsible for physically unlinking
1109 void mem_cgroup_lru_del_list(struct page *page, enum lru_list lru)
1111 struct mem_cgroup_per_zone *mz;
1112 struct mem_cgroup *memcg;
1113 struct page_cgroup *pc;
1115 if (mem_cgroup_disabled())
1118 pc = lookup_page_cgroup(page);
1119 memcg = pc->mem_cgroup;
1121 mz = page_cgroup_zoneinfo(memcg, page);
1122 /* huge page split is done under lru_lock. so, we have no races. */
1123 VM_BUG_ON(mz->lru_size[lru] < (1 << compound_order(page)));
1124 mz->lru_size[lru] -= 1 << compound_order(page);
1128 * mem_cgroup_lru_move_lists - account for moving a page between lrus
1129 * @zone: zone of the page
1131 * @from: current lru
1134 * This function accounts for @page being moved between the lrus @from
1135 * and @to, and returns the lruvec for the given @zone and the memcg
1136 * @page is charged to.
1138 * The callsite is then responsible for physically relinking
1139 * @page->lru to the returned lruvec->lists[@to].
1141 struct lruvec *mem_cgroup_lru_move_lists(struct zone *zone,
1146 /* XXX: Optimize this, especially for @from == @to */
1147 mem_cgroup_lru_del_list(page, from);
1148 return mem_cgroup_lru_add_list(zone, page, to);
1152 * Checks whether given mem is same or in the root_mem_cgroup's
1155 bool __mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg,
1156 struct mem_cgroup *memcg)
1158 if (root_memcg == memcg)
1160 if (!root_memcg->use_hierarchy)
1162 return css_is_ancestor(&memcg->css, &root_memcg->css);
1165 static bool mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg,
1166 struct mem_cgroup *memcg)
1171 ret = __mem_cgroup_same_or_subtree(root_memcg, memcg);
1176 int task_in_mem_cgroup(struct task_struct *task, const struct mem_cgroup *memcg)
1179 struct mem_cgroup *curr = NULL;
1180 struct task_struct *p;
1182 p = find_lock_task_mm(task);
1184 curr = try_get_mem_cgroup_from_mm(p->mm);
1188 * All threads may have already detached their mm's, but the oom
1189 * killer still needs to detect if they have already been oom
1190 * killed to prevent needlessly killing additional tasks.
1193 curr = mem_cgroup_from_task(task);
1195 css_get(&curr->css);
1201 * We should check use_hierarchy of "memcg" not "curr". Because checking
1202 * use_hierarchy of "curr" here make this function true if hierarchy is
1203 * enabled in "curr" and "curr" is a child of "memcg" in *cgroup*
1204 * hierarchy(even if use_hierarchy is disabled in "memcg").
1206 ret = mem_cgroup_same_or_subtree(memcg, curr);
1207 css_put(&curr->css);
1211 int mem_cgroup_inactive_anon_is_low(struct lruvec *lruvec)
1213 unsigned long inactive_ratio;
1214 unsigned long inactive;
1215 unsigned long active;
1218 inactive = mem_cgroup_get_lruvec_size(lruvec, LRU_INACTIVE_ANON);
1219 active = mem_cgroup_get_lruvec_size(lruvec, LRU_ACTIVE_ANON);
1221 gb = (inactive + active) >> (30 - PAGE_SHIFT);
1223 inactive_ratio = int_sqrt(10 * gb);
1227 return inactive * inactive_ratio < active;
1230 int mem_cgroup_inactive_file_is_low(struct lruvec *lruvec)
1232 unsigned long active;
1233 unsigned long inactive;
1235 inactive = mem_cgroup_get_lruvec_size(lruvec, LRU_INACTIVE_FILE);
1236 active = mem_cgroup_get_lruvec_size(lruvec, LRU_ACTIVE_FILE);
1238 return (active > inactive);
1241 struct zone_reclaim_stat *
1242 mem_cgroup_get_reclaim_stat_from_page(struct page *page)
1244 struct page_cgroup *pc;
1245 struct mem_cgroup_per_zone *mz;
1247 if (mem_cgroup_disabled())
1250 pc = lookup_page_cgroup(page);
1251 if (!PageCgroupUsed(pc))
1253 /* Ensure pc->mem_cgroup is visible after reading PCG_USED. */
1255 mz = page_cgroup_zoneinfo(pc->mem_cgroup, page);
1256 return &mz->lruvec.reclaim_stat;
1259 #define mem_cgroup_from_res_counter(counter, member) \
1260 container_of(counter, struct mem_cgroup, member)
1263 * mem_cgroup_margin - calculate chargeable space of a memory cgroup
1264 * @mem: the memory cgroup
1266 * Returns the maximum amount of memory @mem can be charged with, in
1269 static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg)
1271 unsigned long long margin;
1273 margin = res_counter_margin(&memcg->res);
1274 if (do_swap_account)
1275 margin = min(margin, res_counter_margin(&memcg->memsw));
1276 return margin >> PAGE_SHIFT;
1279 int mem_cgroup_swappiness(struct mem_cgroup *memcg)
1281 struct cgroup *cgrp = memcg->css.cgroup;
1284 if (cgrp->parent == NULL)
1285 return vm_swappiness;
1287 return memcg->swappiness;
1291 * memcg->moving_account is used for checking possibility that some thread is
1292 * calling move_account(). When a thread on CPU-A starts moving pages under
1293 * a memcg, other threads should check memcg->moving_account under
1294 * rcu_read_lock(), like this:
1298 * memcg->moving_account+1 if (memcg->mocing_account)
1300 * synchronize_rcu() update something.
1305 /* for quick checking without looking up memcg */
1306 atomic_t memcg_moving __read_mostly;
1308 static void mem_cgroup_start_move(struct mem_cgroup *memcg)
1310 atomic_inc(&memcg_moving);
1311 atomic_inc(&memcg->moving_account);
1315 static void mem_cgroup_end_move(struct mem_cgroup *memcg)
1318 * Now, mem_cgroup_clear_mc() may call this function with NULL.
1319 * We check NULL in callee rather than caller.
1322 atomic_dec(&memcg_moving);
1323 atomic_dec(&memcg->moving_account);
1328 * 2 routines for checking "mem" is under move_account() or not.
1330 * mem_cgroup_stolen() - checking whether a cgroup is mc.from or not. This
1331 * is used for avoiding races in accounting. If true,
1332 * pc->mem_cgroup may be overwritten.
1334 * mem_cgroup_under_move() - checking a cgroup is mc.from or mc.to or
1335 * under hierarchy of moving cgroups. This is for
1336 * waiting at hith-memory prressure caused by "move".
1339 static bool mem_cgroup_stolen(struct mem_cgroup *memcg)
1341 VM_BUG_ON(!rcu_read_lock_held());
1342 return atomic_read(&memcg->moving_account) > 0;
1345 static bool mem_cgroup_under_move(struct mem_cgroup *memcg)
1347 struct mem_cgroup *from;
1348 struct mem_cgroup *to;
1351 * Unlike task_move routines, we access mc.to, mc.from not under
1352 * mutual exclusion by cgroup_mutex. Here, we take spinlock instead.
1354 spin_lock(&mc.lock);
1360 ret = mem_cgroup_same_or_subtree(memcg, from)
1361 || mem_cgroup_same_or_subtree(memcg, to);
1363 spin_unlock(&mc.lock);
1367 static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg)
1369 if (mc.moving_task && current != mc.moving_task) {
1370 if (mem_cgroup_under_move(memcg)) {
1372 prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE);
1373 /* moving charge context might have finished. */
1376 finish_wait(&mc.waitq, &wait);
1384 * Take this lock when
1385 * - a code tries to modify page's memcg while it's USED.
1386 * - a code tries to modify page state accounting in a memcg.
1387 * see mem_cgroup_stolen(), too.
1389 static void move_lock_mem_cgroup(struct mem_cgroup *memcg,
1390 unsigned long *flags)
1392 spin_lock_irqsave(&memcg->move_lock, *flags);
1395 static void move_unlock_mem_cgroup(struct mem_cgroup *memcg,
1396 unsigned long *flags)
1398 spin_unlock_irqrestore(&memcg->move_lock, *flags);
1402 * mem_cgroup_print_oom_info: Called from OOM with tasklist_lock held in read mode.
1403 * @memcg: The memory cgroup that went over limit
1404 * @p: Task that is going to be killed
1406 * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is
1409 void mem_cgroup_print_oom_info(struct mem_cgroup *memcg, struct task_struct *p)
1411 struct cgroup *task_cgrp;
1412 struct cgroup *mem_cgrp;
1414 * Need a buffer in BSS, can't rely on allocations. The code relies
1415 * on the assumption that OOM is serialized for memory controller.
1416 * If this assumption is broken, revisit this code.
1418 static char memcg_name[PATH_MAX];
1426 mem_cgrp = memcg->css.cgroup;
1427 task_cgrp = task_cgroup(p, mem_cgroup_subsys_id);
1429 ret = cgroup_path(task_cgrp, memcg_name, PATH_MAX);
1432 * Unfortunately, we are unable to convert to a useful name
1433 * But we'll still print out the usage information
1440 printk(KERN_INFO "Task in %s killed", memcg_name);
1443 ret = cgroup_path(mem_cgrp, memcg_name, PATH_MAX);
1451 * Continues from above, so we don't need an KERN_ level
1453 printk(KERN_CONT " as a result of limit of %s\n", memcg_name);
1456 printk(KERN_INFO "memory: usage %llukB, limit %llukB, failcnt %llu\n",
1457 res_counter_read_u64(&memcg->res, RES_USAGE) >> 10,
1458 res_counter_read_u64(&memcg->res, RES_LIMIT) >> 10,
1459 res_counter_read_u64(&memcg->res, RES_FAILCNT));
1460 printk(KERN_INFO "memory+swap: usage %llukB, limit %llukB, "
1462 res_counter_read_u64(&memcg->memsw, RES_USAGE) >> 10,
1463 res_counter_read_u64(&memcg->memsw, RES_LIMIT) >> 10,
1464 res_counter_read_u64(&memcg->memsw, RES_FAILCNT));
1468 * This function returns the number of memcg under hierarchy tree. Returns
1469 * 1(self count) if no children.
1471 static int mem_cgroup_count_children(struct mem_cgroup *memcg)
1474 struct mem_cgroup *iter;
1476 for_each_mem_cgroup_tree(iter, memcg)
1482 * Return the memory (and swap, if configured) limit for a memcg.
1484 u64 mem_cgroup_get_limit(struct mem_cgroup *memcg)
1489 limit = res_counter_read_u64(&memcg->res, RES_LIMIT);
1490 limit += total_swap_pages << PAGE_SHIFT;
1492 memsw = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
1494 * If memsw is finite and limits the amount of swap space available
1495 * to this memcg, return that limit.
1497 return min(limit, memsw);
1500 static unsigned long mem_cgroup_reclaim(struct mem_cgroup *memcg,
1502 unsigned long flags)
1504 unsigned long total = 0;
1505 bool noswap = false;
1508 if (flags & MEM_CGROUP_RECLAIM_NOSWAP)
1510 if (!(flags & MEM_CGROUP_RECLAIM_SHRINK) && memcg->memsw_is_minimum)
1513 for (loop = 0; loop < MEM_CGROUP_MAX_RECLAIM_LOOPS; loop++) {
1515 drain_all_stock_async(memcg);
1516 total += try_to_free_mem_cgroup_pages(memcg, gfp_mask, noswap);
1518 * Allow limit shrinkers, which are triggered directly
1519 * by userspace, to catch signals and stop reclaim
1520 * after minimal progress, regardless of the margin.
1522 if (total && (flags & MEM_CGROUP_RECLAIM_SHRINK))
1524 if (mem_cgroup_margin(memcg))
1527 * If nothing was reclaimed after two attempts, there
1528 * may be no reclaimable pages in this hierarchy.
1537 * test_mem_cgroup_node_reclaimable
1538 * @mem: the target memcg
1539 * @nid: the node ID to be checked.
1540 * @noswap : specify true here if the user wants flle only information.
1542 * This function returns whether the specified memcg contains any
1543 * reclaimable pages on a node. Returns true if there are any reclaimable
1544 * pages in the node.
1546 static bool test_mem_cgroup_node_reclaimable(struct mem_cgroup *memcg,
1547 int nid, bool noswap)
1549 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_FILE))
1551 if (noswap || !total_swap_pages)
1553 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_ANON))
1558 #if MAX_NUMNODES > 1
1561 * Always updating the nodemask is not very good - even if we have an empty
1562 * list or the wrong list here, we can start from some node and traverse all
1563 * nodes based on the zonelist. So update the list loosely once per 10 secs.
1566 static void mem_cgroup_may_update_nodemask(struct mem_cgroup *memcg)
1570 * numainfo_events > 0 means there was at least NUMAINFO_EVENTS_TARGET
1571 * pagein/pageout changes since the last update.
1573 if (!atomic_read(&memcg->numainfo_events))
1575 if (atomic_inc_return(&memcg->numainfo_updating) > 1)
1578 /* make a nodemask where this memcg uses memory from */
1579 memcg->scan_nodes = node_states[N_HIGH_MEMORY];
1581 for_each_node_mask(nid, node_states[N_HIGH_MEMORY]) {
1583 if (!test_mem_cgroup_node_reclaimable(memcg, nid, false))
1584 node_clear(nid, memcg->scan_nodes);
1587 atomic_set(&memcg->numainfo_events, 0);
1588 atomic_set(&memcg->numainfo_updating, 0);
1592 * Selecting a node where we start reclaim from. Because what we need is just
1593 * reducing usage counter, start from anywhere is O,K. Considering
1594 * memory reclaim from current node, there are pros. and cons.
1596 * Freeing memory from current node means freeing memory from a node which
1597 * we'll use or we've used. So, it may make LRU bad. And if several threads
1598 * hit limits, it will see a contention on a node. But freeing from remote
1599 * node means more costs for memory reclaim because of memory latency.
1601 * Now, we use round-robin. Better algorithm is welcomed.
1603 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1607 mem_cgroup_may_update_nodemask(memcg);
1608 node = memcg->last_scanned_node;
1610 node = next_node(node, memcg->scan_nodes);
1611 if (node == MAX_NUMNODES)
1612 node = first_node(memcg->scan_nodes);
1614 * We call this when we hit limit, not when pages are added to LRU.
1615 * No LRU may hold pages because all pages are UNEVICTABLE or
1616 * memcg is too small and all pages are not on LRU. In that case,
1617 * we use curret node.
1619 if (unlikely(node == MAX_NUMNODES))
1620 node = numa_node_id();
1622 memcg->last_scanned_node = node;
1627 * Check all nodes whether it contains reclaimable pages or not.
1628 * For quick scan, we make use of scan_nodes. This will allow us to skip
1629 * unused nodes. But scan_nodes is lazily updated and may not cotain
1630 * enough new information. We need to do double check.
1632 static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
1637 * quick check...making use of scan_node.
1638 * We can skip unused nodes.
1640 if (!nodes_empty(memcg->scan_nodes)) {
1641 for (nid = first_node(memcg->scan_nodes);
1643 nid = next_node(nid, memcg->scan_nodes)) {
1645 if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
1650 * Check rest of nodes.
1652 for_each_node_state(nid, N_HIGH_MEMORY) {
1653 if (node_isset(nid, memcg->scan_nodes))
1655 if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
1662 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1667 static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
1669 return test_mem_cgroup_node_reclaimable(memcg, 0, noswap);
1673 static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg,
1676 unsigned long *total_scanned)
1678 struct mem_cgroup *victim = NULL;
1681 unsigned long excess;
1682 unsigned long nr_scanned;
1683 struct mem_cgroup_reclaim_cookie reclaim = {
1688 excess = res_counter_soft_limit_excess(&root_memcg->res) >> PAGE_SHIFT;
1691 victim = mem_cgroup_iter(root_memcg, victim, &reclaim);
1696 * If we have not been able to reclaim
1697 * anything, it might because there are
1698 * no reclaimable pages under this hierarchy
1703 * We want to do more targeted reclaim.
1704 * excess >> 2 is not to excessive so as to
1705 * reclaim too much, nor too less that we keep
1706 * coming back to reclaim from this cgroup
1708 if (total >= (excess >> 2) ||
1709 (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS))
1714 if (!mem_cgroup_reclaimable(victim, false))
1716 total += mem_cgroup_shrink_node_zone(victim, gfp_mask, false,
1718 *total_scanned += nr_scanned;
1719 if (!res_counter_soft_limit_excess(&root_memcg->res))
1722 mem_cgroup_iter_break(root_memcg, victim);
1727 * Check OOM-Killer is already running under our hierarchy.
1728 * If someone is running, return false.
1729 * Has to be called with memcg_oom_lock
1731 static bool mem_cgroup_oom_lock(struct mem_cgroup *memcg)
1733 struct mem_cgroup *iter, *failed = NULL;
1735 for_each_mem_cgroup_tree(iter, memcg) {
1736 if (iter->oom_lock) {
1738 * this subtree of our hierarchy is already locked
1739 * so we cannot give a lock.
1742 mem_cgroup_iter_break(memcg, iter);
1745 iter->oom_lock = true;
1752 * OK, we failed to lock the whole subtree so we have to clean up
1753 * what we set up to the failing subtree
1755 for_each_mem_cgroup_tree(iter, memcg) {
1756 if (iter == failed) {
1757 mem_cgroup_iter_break(memcg, iter);
1760 iter->oom_lock = false;
1766 * Has to be called with memcg_oom_lock
1768 static int mem_cgroup_oom_unlock(struct mem_cgroup *memcg)
1770 struct mem_cgroup *iter;
1772 for_each_mem_cgroup_tree(iter, memcg)
1773 iter->oom_lock = false;
1777 static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg)
1779 struct mem_cgroup *iter;
1781 for_each_mem_cgroup_tree(iter, memcg)
1782 atomic_inc(&iter->under_oom);
1785 static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg)
1787 struct mem_cgroup *iter;
1790 * When a new child is created while the hierarchy is under oom,
1791 * mem_cgroup_oom_lock() may not be called. We have to use
1792 * atomic_add_unless() here.
1794 for_each_mem_cgroup_tree(iter, memcg)
1795 atomic_add_unless(&iter->under_oom, -1, 0);
1798 static DEFINE_SPINLOCK(memcg_oom_lock);
1799 static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq);
1801 struct oom_wait_info {
1802 struct mem_cgroup *memcg;
1806 static int memcg_oom_wake_function(wait_queue_t *wait,
1807 unsigned mode, int sync, void *arg)
1809 struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg;
1810 struct mem_cgroup *oom_wait_memcg;
1811 struct oom_wait_info *oom_wait_info;
1813 oom_wait_info = container_of(wait, struct oom_wait_info, wait);
1814 oom_wait_memcg = oom_wait_info->memcg;
1817 * Both of oom_wait_info->memcg and wake_memcg are stable under us.
1818 * Then we can use css_is_ancestor without taking care of RCU.
1820 if (!mem_cgroup_same_or_subtree(oom_wait_memcg, wake_memcg)
1821 && !mem_cgroup_same_or_subtree(wake_memcg, oom_wait_memcg))
1823 return autoremove_wake_function(wait, mode, sync, arg);
1826 static void memcg_wakeup_oom(struct mem_cgroup *memcg)
1828 /* for filtering, pass "memcg" as argument. */
1829 __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg);
1832 static void memcg_oom_recover(struct mem_cgroup *memcg)
1834 if (memcg && atomic_read(&memcg->under_oom))
1835 memcg_wakeup_oom(memcg);
1839 * try to call OOM killer. returns false if we should exit memory-reclaim loop.
1841 static bool mem_cgroup_handle_oom(struct mem_cgroup *memcg, gfp_t mask,
1844 struct oom_wait_info owait;
1845 bool locked, need_to_kill;
1847 owait.memcg = memcg;
1848 owait.wait.flags = 0;
1849 owait.wait.func = memcg_oom_wake_function;
1850 owait.wait.private = current;
1851 INIT_LIST_HEAD(&owait.wait.task_list);
1852 need_to_kill = true;
1853 mem_cgroup_mark_under_oom(memcg);
1855 /* At first, try to OOM lock hierarchy under memcg.*/
1856 spin_lock(&memcg_oom_lock);
1857 locked = mem_cgroup_oom_lock(memcg);
1859 * Even if signal_pending(), we can't quit charge() loop without
1860 * accounting. So, UNINTERRUPTIBLE is appropriate. But SIGKILL
1861 * under OOM is always welcomed, use TASK_KILLABLE here.
1863 prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE);
1864 if (!locked || memcg->oom_kill_disable)
1865 need_to_kill = false;
1867 mem_cgroup_oom_notify(memcg);
1868 spin_unlock(&memcg_oom_lock);
1871 finish_wait(&memcg_oom_waitq, &owait.wait);
1872 mem_cgroup_out_of_memory(memcg, mask, order);
1875 finish_wait(&memcg_oom_waitq, &owait.wait);
1877 spin_lock(&memcg_oom_lock);
1879 mem_cgroup_oom_unlock(memcg);
1880 memcg_wakeup_oom(memcg);
1881 spin_unlock(&memcg_oom_lock);
1883 mem_cgroup_unmark_under_oom(memcg);
1885 if (test_thread_flag(TIF_MEMDIE) || fatal_signal_pending(current))
1887 /* Give chance to dying process */
1888 schedule_timeout_uninterruptible(1);
1893 * Currently used to update mapped file statistics, but the routine can be
1894 * generalized to update other statistics as well.
1896 * Notes: Race condition
1898 * We usually use page_cgroup_lock() for accessing page_cgroup member but
1899 * it tends to be costly. But considering some conditions, we doesn't need
1900 * to do so _always_.
1902 * Considering "charge", lock_page_cgroup() is not required because all
1903 * file-stat operations happen after a page is attached to radix-tree. There
1904 * are no race with "charge".
1906 * Considering "uncharge", we know that memcg doesn't clear pc->mem_cgroup
1907 * at "uncharge" intentionally. So, we always see valid pc->mem_cgroup even
1908 * if there are race with "uncharge". Statistics itself is properly handled
1911 * Considering "move", this is an only case we see a race. To make the race
1912 * small, we check mm->moving_account and detect there are possibility of race
1913 * If there is, we take a lock.
1916 void __mem_cgroup_begin_update_page_stat(struct page *page,
1917 bool *locked, unsigned long *flags)
1919 struct mem_cgroup *memcg;
1920 struct page_cgroup *pc;
1922 pc = lookup_page_cgroup(page);
1924 memcg = pc->mem_cgroup;
1925 if (unlikely(!memcg || !PageCgroupUsed(pc)))
1928 * If this memory cgroup is not under account moving, we don't
1929 * need to take move_lock_page_cgroup(). Because we already hold
1930 * rcu_read_lock(), any calls to move_account will be delayed until
1931 * rcu_read_unlock() if mem_cgroup_stolen() == true.
1933 if (!mem_cgroup_stolen(memcg))
1936 move_lock_mem_cgroup(memcg, flags);
1937 if (memcg != pc->mem_cgroup || !PageCgroupUsed(pc)) {
1938 move_unlock_mem_cgroup(memcg, flags);
1944 void __mem_cgroup_end_update_page_stat(struct page *page, unsigned long *flags)
1946 struct page_cgroup *pc = lookup_page_cgroup(page);
1949 * It's guaranteed that pc->mem_cgroup never changes while
1950 * lock is held because a routine modifies pc->mem_cgroup
1951 * should take move_lock_page_cgroup().
1953 move_unlock_mem_cgroup(pc->mem_cgroup, flags);
1956 void mem_cgroup_update_page_stat(struct page *page,
1957 enum mem_cgroup_page_stat_item idx, int val)
1959 struct mem_cgroup *memcg;
1960 struct page_cgroup *pc = lookup_page_cgroup(page);
1961 unsigned long uninitialized_var(flags);
1963 if (mem_cgroup_disabled())
1966 memcg = pc->mem_cgroup;
1967 if (unlikely(!memcg || !PageCgroupUsed(pc)))
1971 case MEMCG_NR_FILE_MAPPED:
1972 idx = MEM_CGROUP_STAT_FILE_MAPPED;
1978 this_cpu_add(memcg->stat->count[idx], val);
1982 * size of first charge trial. "32" comes from vmscan.c's magic value.
1983 * TODO: maybe necessary to use big numbers in big irons.
1985 #define CHARGE_BATCH 32U
1986 struct memcg_stock_pcp {
1987 struct mem_cgroup *cached; /* this never be root cgroup */
1988 unsigned int nr_pages;
1989 struct work_struct work;
1990 unsigned long flags;
1991 #define FLUSHING_CACHED_CHARGE 0
1993 static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock);
1994 static DEFINE_MUTEX(percpu_charge_mutex);
1997 * Try to consume stocked charge on this cpu. If success, one page is consumed
1998 * from local stock and true is returned. If the stock is 0 or charges from a
1999 * cgroup which is not current target, returns false. This stock will be
2002 static bool consume_stock(struct mem_cgroup *memcg)
2004 struct memcg_stock_pcp *stock;
2007 stock = &get_cpu_var(memcg_stock);
2008 if (memcg == stock->cached && stock->nr_pages)
2010 else /* need to call res_counter_charge */
2012 put_cpu_var(memcg_stock);
2017 * Returns stocks cached in percpu to res_counter and reset cached information.
2019 static void drain_stock(struct memcg_stock_pcp *stock)
2021 struct mem_cgroup *old = stock->cached;
2023 if (stock->nr_pages) {
2024 unsigned long bytes = stock->nr_pages * PAGE_SIZE;
2026 res_counter_uncharge(&old->res, bytes);
2027 if (do_swap_account)
2028 res_counter_uncharge(&old->memsw, bytes);
2029 stock->nr_pages = 0;
2031 stock->cached = NULL;
2035 * This must be called under preempt disabled or must be called by
2036 * a thread which is pinned to local cpu.
2038 static void drain_local_stock(struct work_struct *dummy)
2040 struct memcg_stock_pcp *stock = &__get_cpu_var(memcg_stock);
2042 clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags);
2046 * Cache charges(val) which is from res_counter, to local per_cpu area.
2047 * This will be consumed by consume_stock() function, later.
2049 static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2051 struct memcg_stock_pcp *stock = &get_cpu_var(memcg_stock);
2053 if (stock->cached != memcg) { /* reset if necessary */
2055 stock->cached = memcg;
2057 stock->nr_pages += nr_pages;
2058 put_cpu_var(memcg_stock);
2062 * Drains all per-CPU charge caches for given root_memcg resp. subtree
2063 * of the hierarchy under it. sync flag says whether we should block
2064 * until the work is done.
2066 static void drain_all_stock(struct mem_cgroup *root_memcg, bool sync)
2070 /* Notify other cpus that system-wide "drain" is running */
2073 for_each_online_cpu(cpu) {
2074 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2075 struct mem_cgroup *memcg;
2077 memcg = stock->cached;
2078 if (!memcg || !stock->nr_pages)
2080 if (!mem_cgroup_same_or_subtree(root_memcg, memcg))
2082 if (!test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) {
2084 drain_local_stock(&stock->work);
2086 schedule_work_on(cpu, &stock->work);
2094 for_each_online_cpu(cpu) {
2095 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2096 if (test_bit(FLUSHING_CACHED_CHARGE, &stock->flags))
2097 flush_work(&stock->work);
2104 * Tries to drain stocked charges in other cpus. This function is asynchronous
2105 * and just put a work per cpu for draining localy on each cpu. Caller can
2106 * expects some charges will be back to res_counter later but cannot wait for
2109 static void drain_all_stock_async(struct mem_cgroup *root_memcg)
2112 * If someone calls draining, avoid adding more kworker runs.
2114 if (!mutex_trylock(&percpu_charge_mutex))
2116 drain_all_stock(root_memcg, false);
2117 mutex_unlock(&percpu_charge_mutex);
2120 /* This is a synchronous drain interface. */
2121 static void drain_all_stock_sync(struct mem_cgroup *root_memcg)
2123 /* called when force_empty is called */
2124 mutex_lock(&percpu_charge_mutex);
2125 drain_all_stock(root_memcg, true);
2126 mutex_unlock(&percpu_charge_mutex);
2130 * This function drains percpu counter value from DEAD cpu and
2131 * move it to local cpu. Note that this function can be preempted.
2133 static void mem_cgroup_drain_pcp_counter(struct mem_cgroup *memcg, int cpu)
2137 spin_lock(&memcg->pcp_counter_lock);
2138 for (i = 0; i < MEM_CGROUP_STAT_DATA; i++) {
2139 long x = per_cpu(memcg->stat->count[i], cpu);
2141 per_cpu(memcg->stat->count[i], cpu) = 0;
2142 memcg->nocpu_base.count[i] += x;
2144 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) {
2145 unsigned long x = per_cpu(memcg->stat->events[i], cpu);
2147 per_cpu(memcg->stat->events[i], cpu) = 0;
2148 memcg->nocpu_base.events[i] += x;
2150 spin_unlock(&memcg->pcp_counter_lock);
2153 static int __cpuinit memcg_cpu_hotplug_callback(struct notifier_block *nb,
2154 unsigned long action,
2157 int cpu = (unsigned long)hcpu;
2158 struct memcg_stock_pcp *stock;
2159 struct mem_cgroup *iter;
2161 if (action == CPU_ONLINE)
2164 if (action != CPU_DEAD && action != CPU_DEAD_FROZEN)
2167 for_each_mem_cgroup(iter)
2168 mem_cgroup_drain_pcp_counter(iter, cpu);
2170 stock = &per_cpu(memcg_stock, cpu);
2176 /* See __mem_cgroup_try_charge() for details */
2178 CHARGE_OK, /* success */
2179 CHARGE_RETRY, /* need to retry but retry is not bad */
2180 CHARGE_NOMEM, /* we can't do more. return -ENOMEM */
2181 CHARGE_WOULDBLOCK, /* GFP_WAIT wasn't set and no enough res. */
2182 CHARGE_OOM_DIE, /* the current is killed because of OOM */
2185 static int mem_cgroup_do_charge(struct mem_cgroup *memcg, gfp_t gfp_mask,
2186 unsigned int nr_pages, bool oom_check)
2188 unsigned long csize = nr_pages * PAGE_SIZE;
2189 struct mem_cgroup *mem_over_limit;
2190 struct res_counter *fail_res;
2191 unsigned long flags = 0;
2194 ret = res_counter_charge(&memcg->res, csize, &fail_res);
2197 if (!do_swap_account)
2199 ret = res_counter_charge(&memcg->memsw, csize, &fail_res);
2203 res_counter_uncharge(&memcg->res, csize);
2204 mem_over_limit = mem_cgroup_from_res_counter(fail_res, memsw);
2205 flags |= MEM_CGROUP_RECLAIM_NOSWAP;
2207 mem_over_limit = mem_cgroup_from_res_counter(fail_res, res);
2209 * nr_pages can be either a huge page (HPAGE_PMD_NR), a batch
2210 * of regular pages (CHARGE_BATCH), or a single regular page (1).
2212 * Never reclaim on behalf of optional batching, retry with a
2213 * single page instead.
2215 if (nr_pages == CHARGE_BATCH)
2216 return CHARGE_RETRY;
2218 if (!(gfp_mask & __GFP_WAIT))
2219 return CHARGE_WOULDBLOCK;
2221 ret = mem_cgroup_reclaim(mem_over_limit, gfp_mask, flags);
2222 if (mem_cgroup_margin(mem_over_limit) >= nr_pages)
2223 return CHARGE_RETRY;
2225 * Even though the limit is exceeded at this point, reclaim
2226 * may have been able to free some pages. Retry the charge
2227 * before killing the task.
2229 * Only for regular pages, though: huge pages are rather
2230 * unlikely to succeed so close to the limit, and we fall back
2231 * to regular pages anyway in case of failure.
2233 if (nr_pages == 1 && ret)
2234 return CHARGE_RETRY;
2237 * At task move, charge accounts can be doubly counted. So, it's
2238 * better to wait until the end of task_move if something is going on.
2240 if (mem_cgroup_wait_acct_move(mem_over_limit))
2241 return CHARGE_RETRY;
2243 /* If we don't need to call oom-killer at el, return immediately */
2245 return CHARGE_NOMEM;
2247 if (!mem_cgroup_handle_oom(mem_over_limit, gfp_mask, get_order(csize)))
2248 return CHARGE_OOM_DIE;
2250 return CHARGE_RETRY;
2254 * __mem_cgroup_try_charge() does
2255 * 1. detect memcg to be charged against from passed *mm and *ptr,
2256 * 2. update res_counter
2257 * 3. call memory reclaim if necessary.
2259 * In some special case, if the task is fatal, fatal_signal_pending() or
2260 * has TIF_MEMDIE, this function returns -EINTR while writing root_mem_cgroup
2261 * to *ptr. There are two reasons for this. 1: fatal threads should quit as soon
2262 * as possible without any hazards. 2: all pages should have a valid
2263 * pc->mem_cgroup. If mm is NULL and the caller doesn't pass a valid memcg
2264 * pointer, that is treated as a charge to root_mem_cgroup.
2266 * So __mem_cgroup_try_charge() will return
2267 * 0 ... on success, filling *ptr with a valid memcg pointer.
2268 * -ENOMEM ... charge failure because of resource limits.
2269 * -EINTR ... if thread is fatal. *ptr is filled with root_mem_cgroup.
2271 * Unlike the exported interface, an "oom" parameter is added. if oom==true,
2272 * the oom-killer can be invoked.
2274 static int __mem_cgroup_try_charge(struct mm_struct *mm,
2276 unsigned int nr_pages,
2277 struct mem_cgroup **ptr,
2280 unsigned int batch = max(CHARGE_BATCH, nr_pages);
2281 int nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES;
2282 struct mem_cgroup *memcg = NULL;
2286 * Unlike gloval-vm's OOM-kill, we're not in memory shortage
2287 * in system level. So, allow to go ahead dying process in addition to
2290 if (unlikely(test_thread_flag(TIF_MEMDIE)
2291 || fatal_signal_pending(current)))
2295 * We always charge the cgroup the mm_struct belongs to.
2296 * The mm_struct's mem_cgroup changes on task migration if the
2297 * thread group leader migrates. It's possible that mm is not
2298 * set, if so charge the init_mm (happens for pagecache usage).
2301 *ptr = root_mem_cgroup;
2303 if (*ptr) { /* css should be a valid one */
2305 VM_BUG_ON(css_is_removed(&memcg->css));
2306 if (mem_cgroup_is_root(memcg))
2308 if (nr_pages == 1 && consume_stock(memcg))
2310 css_get(&memcg->css);
2312 struct task_struct *p;
2315 p = rcu_dereference(mm->owner);
2317 * Because we don't have task_lock(), "p" can exit.
2318 * In that case, "memcg" can point to root or p can be NULL with
2319 * race with swapoff. Then, we have small risk of mis-accouning.
2320 * But such kind of mis-account by race always happens because
2321 * we don't have cgroup_mutex(). It's overkill and we allo that
2323 * (*) swapoff at el will charge against mm-struct not against
2324 * task-struct. So, mm->owner can be NULL.
2326 memcg = mem_cgroup_from_task(p);
2328 memcg = root_mem_cgroup;
2329 if (mem_cgroup_is_root(memcg)) {
2333 if (nr_pages == 1 && consume_stock(memcg)) {
2335 * It seems dagerous to access memcg without css_get().
2336 * But considering how consume_stok works, it's not
2337 * necessary. If consume_stock success, some charges
2338 * from this memcg are cached on this cpu. So, we
2339 * don't need to call css_get()/css_tryget() before
2340 * calling consume_stock().
2345 /* after here, we may be blocked. we need to get refcnt */
2346 if (!css_tryget(&memcg->css)) {
2356 /* If killed, bypass charge */
2357 if (fatal_signal_pending(current)) {
2358 css_put(&memcg->css);
2363 if (oom && !nr_oom_retries) {
2365 nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES;
2368 ret = mem_cgroup_do_charge(memcg, gfp_mask, batch, oom_check);
2372 case CHARGE_RETRY: /* not in OOM situation but retry */
2374 css_put(&memcg->css);
2377 case CHARGE_WOULDBLOCK: /* !__GFP_WAIT */
2378 css_put(&memcg->css);
2380 case CHARGE_NOMEM: /* OOM routine works */
2382 css_put(&memcg->css);
2385 /* If oom, we never return -ENOMEM */
2388 case CHARGE_OOM_DIE: /* Killed by OOM Killer */
2389 css_put(&memcg->css);
2392 } while (ret != CHARGE_OK);
2394 if (batch > nr_pages)
2395 refill_stock(memcg, batch - nr_pages);
2396 css_put(&memcg->css);
2404 *ptr = root_mem_cgroup;
2409 * Somemtimes we have to undo a charge we got by try_charge().
2410 * This function is for that and do uncharge, put css's refcnt.
2411 * gotten by try_charge().
2413 static void __mem_cgroup_cancel_charge(struct mem_cgroup *memcg,
2414 unsigned int nr_pages)
2416 if (!mem_cgroup_is_root(memcg)) {
2417 unsigned long bytes = nr_pages * PAGE_SIZE;
2419 res_counter_uncharge(&memcg->res, bytes);
2420 if (do_swap_account)
2421 res_counter_uncharge(&memcg->memsw, bytes);
2426 * A helper function to get mem_cgroup from ID. must be called under
2427 * rcu_read_lock(). The caller must check css_is_removed() or some if
2428 * it's concern. (dropping refcnt from swap can be called against removed
2431 static struct mem_cgroup *mem_cgroup_lookup(unsigned short id)
2433 struct cgroup_subsys_state *css;
2435 /* ID 0 is unused ID */
2438 css = css_lookup(&mem_cgroup_subsys, id);
2441 return container_of(css, struct mem_cgroup, css);
2444 struct mem_cgroup *try_get_mem_cgroup_from_page(struct page *page)
2446 struct mem_cgroup *memcg = NULL;
2447 struct page_cgroup *pc;
2451 VM_BUG_ON(!PageLocked(page));
2453 pc = lookup_page_cgroup(page);
2454 lock_page_cgroup(pc);
2455 if (PageCgroupUsed(pc)) {
2456 memcg = pc->mem_cgroup;
2457 if (memcg && !css_tryget(&memcg->css))
2459 } else if (PageSwapCache(page)) {
2460 ent.val = page_private(page);
2461 id = lookup_swap_cgroup_id(ent);
2463 memcg = mem_cgroup_lookup(id);
2464 if (memcg && !css_tryget(&memcg->css))
2468 unlock_page_cgroup(pc);
2472 static void __mem_cgroup_commit_charge(struct mem_cgroup *memcg,
2474 unsigned int nr_pages,
2475 enum charge_type ctype,
2478 struct page_cgroup *pc = lookup_page_cgroup(page);
2479 struct zone *uninitialized_var(zone);
2480 bool was_on_lru = false;
2483 lock_page_cgroup(pc);
2484 if (unlikely(PageCgroupUsed(pc))) {
2485 unlock_page_cgroup(pc);
2486 __mem_cgroup_cancel_charge(memcg, nr_pages);
2490 * we don't need page_cgroup_lock about tail pages, becase they are not
2491 * accessed by any other context at this point.
2495 * In some cases, SwapCache and FUSE(splice_buf->radixtree), the page
2496 * may already be on some other mem_cgroup's LRU. Take care of it.
2499 zone = page_zone(page);
2500 spin_lock_irq(&zone->lru_lock);
2501 if (PageLRU(page)) {
2503 del_page_from_lru_list(zone, page, page_lru(page));
2508 pc->mem_cgroup = memcg;
2510 * We access a page_cgroup asynchronously without lock_page_cgroup().
2511 * Especially when a page_cgroup is taken from a page, pc->mem_cgroup
2512 * is accessed after testing USED bit. To make pc->mem_cgroup visible
2513 * before USED bit, we need memory barrier here.
2514 * See mem_cgroup_add_lru_list(), etc.
2517 SetPageCgroupUsed(pc);
2521 VM_BUG_ON(PageLRU(page));
2523 add_page_to_lru_list(zone, page, page_lru(page));
2525 spin_unlock_irq(&zone->lru_lock);
2528 if (ctype == MEM_CGROUP_CHARGE_TYPE_MAPPED)
2533 mem_cgroup_charge_statistics(memcg, anon, nr_pages);
2534 unlock_page_cgroup(pc);
2537 * "charge_statistics" updated event counter. Then, check it.
2538 * Insert ancestor (and ancestor's ancestors), to softlimit RB-tree.
2539 * if they exceeds softlimit.
2541 memcg_check_events(memcg, page);
2544 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
2546 #define PCGF_NOCOPY_AT_SPLIT (1 << PCG_LOCK | 1 << PCG_MIGRATION)
2548 * Because tail pages are not marked as "used", set it. We're under
2549 * zone->lru_lock, 'splitting on pmd' and compound_lock.
2550 * charge/uncharge will be never happen and move_account() is done under
2551 * compound_lock(), so we don't have to take care of races.
2553 void mem_cgroup_split_huge_fixup(struct page *head)
2555 struct page_cgroup *head_pc = lookup_page_cgroup(head);
2556 struct page_cgroup *pc;
2559 if (mem_cgroup_disabled())
2561 for (i = 1; i < HPAGE_PMD_NR; i++) {
2563 pc->mem_cgroup = head_pc->mem_cgroup;
2564 smp_wmb();/* see __commit_charge() */
2565 pc->flags = head_pc->flags & ~PCGF_NOCOPY_AT_SPLIT;
2568 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
2571 * mem_cgroup_move_account - move account of the page
2573 * @nr_pages: number of regular pages (>1 for huge pages)
2574 * @pc: page_cgroup of the page.
2575 * @from: mem_cgroup which the page is moved from.
2576 * @to: mem_cgroup which the page is moved to. @from != @to.
2577 * @uncharge: whether we should call uncharge and css_put against @from.
2579 * The caller must confirm following.
2580 * - page is not on LRU (isolate_page() is useful.)
2581 * - compound_lock is held when nr_pages > 1
2583 * This function doesn't do "charge" nor css_get to new cgroup. It should be
2584 * done by a caller(__mem_cgroup_try_charge would be useful). If @uncharge is
2585 * true, this function does "uncharge" from old cgroup, but it doesn't if
2586 * @uncharge is false, so a caller should do "uncharge".
2588 static int mem_cgroup_move_account(struct page *page,
2589 unsigned int nr_pages,
2590 struct page_cgroup *pc,
2591 struct mem_cgroup *from,
2592 struct mem_cgroup *to,
2595 unsigned long flags;
2597 bool anon = PageAnon(page);
2599 VM_BUG_ON(from == to);
2600 VM_BUG_ON(PageLRU(page));
2602 * The page is isolated from LRU. So, collapse function
2603 * will not handle this page. But page splitting can happen.
2604 * Do this check under compound_page_lock(). The caller should
2608 if (nr_pages > 1 && !PageTransHuge(page))
2611 lock_page_cgroup(pc);
2614 if (!PageCgroupUsed(pc) || pc->mem_cgroup != from)
2617 move_lock_mem_cgroup(from, &flags);
2619 if (!anon && page_mapped(page)) {
2620 /* Update mapped_file data for mem_cgroup */
2622 __this_cpu_dec(from->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]);
2623 __this_cpu_inc(to->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]);
2626 mem_cgroup_charge_statistics(from, anon, -nr_pages);
2628 /* This is not "cancel", but cancel_charge does all we need. */
2629 __mem_cgroup_cancel_charge(from, nr_pages);
2631 /* caller should have done css_get */
2632 pc->mem_cgroup = to;
2633 mem_cgroup_charge_statistics(to, anon, nr_pages);
2635 * We charges against "to" which may not have any tasks. Then, "to"
2636 * can be under rmdir(). But in current implementation, caller of
2637 * this function is just force_empty() and move charge, so it's
2638 * guaranteed that "to" is never removed. So, we don't check rmdir
2641 move_unlock_mem_cgroup(from, &flags);
2644 unlock_page_cgroup(pc);
2648 memcg_check_events(to, page);
2649 memcg_check_events(from, page);
2655 * move charges to its parent.
2658 static int mem_cgroup_move_parent(struct page *page,
2659 struct page_cgroup *pc,
2660 struct mem_cgroup *child,
2663 struct cgroup *cg = child->css.cgroup;
2664 struct cgroup *pcg = cg->parent;
2665 struct mem_cgroup *parent;
2666 unsigned int nr_pages;
2667 unsigned long uninitialized_var(flags);
2675 if (!get_page_unless_zero(page))
2677 if (isolate_lru_page(page))
2680 nr_pages = hpage_nr_pages(page);
2682 parent = mem_cgroup_from_cont(pcg);
2683 ret = __mem_cgroup_try_charge(NULL, gfp_mask, nr_pages, &parent, false);
2688 flags = compound_lock_irqsave(page);
2690 ret = mem_cgroup_move_account(page, nr_pages, pc, child, parent, true);
2692 __mem_cgroup_cancel_charge(parent, nr_pages);
2695 compound_unlock_irqrestore(page, flags);
2697 putback_lru_page(page);
2705 * Charge the memory controller for page usage.
2707 * 0 if the charge was successful
2708 * < 0 if the cgroup is over its limit
2710 static int mem_cgroup_charge_common(struct page *page, struct mm_struct *mm,
2711 gfp_t gfp_mask, enum charge_type ctype)
2713 struct mem_cgroup *memcg = NULL;
2714 unsigned int nr_pages = 1;
2718 if (PageTransHuge(page)) {
2719 nr_pages <<= compound_order(page);
2720 VM_BUG_ON(!PageTransHuge(page));
2722 * Never OOM-kill a process for a huge page. The
2723 * fault handler will fall back to regular pages.
2728 ret = __mem_cgroup_try_charge(mm, gfp_mask, nr_pages, &memcg, oom);
2731 __mem_cgroup_commit_charge(memcg, page, nr_pages, ctype, false);
2735 int mem_cgroup_newpage_charge(struct page *page,
2736 struct mm_struct *mm, gfp_t gfp_mask)
2738 if (mem_cgroup_disabled())
2740 VM_BUG_ON(page_mapped(page));
2741 VM_BUG_ON(page->mapping && !PageAnon(page));
2743 return mem_cgroup_charge_common(page, mm, gfp_mask,
2744 MEM_CGROUP_CHARGE_TYPE_MAPPED);
2748 __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *ptr,
2749 enum charge_type ctype);
2751 int mem_cgroup_cache_charge(struct page *page, struct mm_struct *mm,
2754 struct mem_cgroup *memcg = NULL;
2755 enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE;
2758 if (mem_cgroup_disabled())
2760 if (PageCompound(page))
2765 if (!page_is_file_cache(page))
2766 type = MEM_CGROUP_CHARGE_TYPE_SHMEM;
2768 if (!PageSwapCache(page))
2769 ret = mem_cgroup_charge_common(page, mm, gfp_mask, type);
2770 else { /* page is swapcache/shmem */
2771 ret = mem_cgroup_try_charge_swapin(mm, page, gfp_mask, &memcg);
2773 __mem_cgroup_commit_charge_swapin(page, memcg, type);
2779 * While swap-in, try_charge -> commit or cancel, the page is locked.
2780 * And when try_charge() successfully returns, one refcnt to memcg without
2781 * struct page_cgroup is acquired. This refcnt will be consumed by
2782 * "commit()" or removed by "cancel()"
2784 int mem_cgroup_try_charge_swapin(struct mm_struct *mm,
2786 gfp_t mask, struct mem_cgroup **memcgp)
2788 struct mem_cgroup *memcg;
2793 if (mem_cgroup_disabled())
2796 if (!do_swap_account)
2799 * A racing thread's fault, or swapoff, may have already updated
2800 * the pte, and even removed page from swap cache: in those cases
2801 * do_swap_page()'s pte_same() test will fail; but there's also a
2802 * KSM case which does need to charge the page.
2804 if (!PageSwapCache(page))
2806 memcg = try_get_mem_cgroup_from_page(page);
2810 ret = __mem_cgroup_try_charge(NULL, mask, 1, memcgp, true);
2811 css_put(&memcg->css);
2818 ret = __mem_cgroup_try_charge(mm, mask, 1, memcgp, true);
2825 __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *memcg,
2826 enum charge_type ctype)
2828 if (mem_cgroup_disabled())
2832 cgroup_exclude_rmdir(&memcg->css);
2834 __mem_cgroup_commit_charge(memcg, page, 1, ctype, true);
2836 * Now swap is on-memory. This means this page may be
2837 * counted both as mem and swap....double count.
2838 * Fix it by uncharging from memsw. Basically, this SwapCache is stable
2839 * under lock_page(). But in do_swap_page()::memory.c, reuse_swap_page()
2840 * may call delete_from_swap_cache() before reach here.
2842 if (do_swap_account && PageSwapCache(page)) {
2843 swp_entry_t ent = {.val = page_private(page)};
2844 mem_cgroup_uncharge_swap(ent);
2847 * At swapin, we may charge account against cgroup which has no tasks.
2848 * So, rmdir()->pre_destroy() can be called while we do this charge.
2849 * In that case, we need to call pre_destroy() again. check it here.
2851 cgroup_release_and_wakeup_rmdir(&memcg->css);
2854 void mem_cgroup_commit_charge_swapin(struct page *page,
2855 struct mem_cgroup *memcg)
2857 __mem_cgroup_commit_charge_swapin(page, memcg,
2858 MEM_CGROUP_CHARGE_TYPE_MAPPED);
2861 void mem_cgroup_cancel_charge_swapin(struct mem_cgroup *memcg)
2863 if (mem_cgroup_disabled())
2867 __mem_cgroup_cancel_charge(memcg, 1);
2870 static void mem_cgroup_do_uncharge(struct mem_cgroup *memcg,
2871 unsigned int nr_pages,
2872 const enum charge_type ctype)
2874 struct memcg_batch_info *batch = NULL;
2875 bool uncharge_memsw = true;
2877 /* If swapout, usage of swap doesn't decrease */
2878 if (!do_swap_account || ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT)
2879 uncharge_memsw = false;
2881 batch = ¤t->memcg_batch;
2883 * In usual, we do css_get() when we remember memcg pointer.
2884 * But in this case, we keep res->usage until end of a series of
2885 * uncharges. Then, it's ok to ignore memcg's refcnt.
2888 batch->memcg = memcg;
2890 * do_batch > 0 when unmapping pages or inode invalidate/truncate.
2891 * In those cases, all pages freed continuously can be expected to be in
2892 * the same cgroup and we have chance to coalesce uncharges.
2893 * But we do uncharge one by one if this is killed by OOM(TIF_MEMDIE)
2894 * because we want to do uncharge as soon as possible.
2897 if (!batch->do_batch || test_thread_flag(TIF_MEMDIE))
2898 goto direct_uncharge;
2901 goto direct_uncharge;
2904 * In typical case, batch->memcg == mem. This means we can
2905 * merge a series of uncharges to an uncharge of res_counter.
2906 * If not, we uncharge res_counter ony by one.
2908 if (batch->memcg != memcg)
2909 goto direct_uncharge;
2910 /* remember freed charge and uncharge it later */
2913 batch->memsw_nr_pages++;
2916 res_counter_uncharge(&memcg->res, nr_pages * PAGE_SIZE);
2918 res_counter_uncharge(&memcg->memsw, nr_pages * PAGE_SIZE);
2919 if (unlikely(batch->memcg != memcg))
2920 memcg_oom_recover(memcg);
2924 * uncharge if !page_mapped(page)
2926 static struct mem_cgroup *
2927 __mem_cgroup_uncharge_common(struct page *page, enum charge_type ctype)
2929 struct mem_cgroup *memcg = NULL;
2930 unsigned int nr_pages = 1;
2931 struct page_cgroup *pc;
2934 if (mem_cgroup_disabled())
2937 if (PageSwapCache(page))
2940 if (PageTransHuge(page)) {
2941 nr_pages <<= compound_order(page);
2942 VM_BUG_ON(!PageTransHuge(page));
2945 * Check if our page_cgroup is valid
2947 pc = lookup_page_cgroup(page);
2948 if (unlikely(!PageCgroupUsed(pc)))
2951 lock_page_cgroup(pc);
2953 memcg = pc->mem_cgroup;
2955 if (!PageCgroupUsed(pc))
2958 anon = PageAnon(page);
2961 case MEM_CGROUP_CHARGE_TYPE_MAPPED:
2963 * Generally PageAnon tells if it's the anon statistics to be
2964 * updated; but sometimes e.g. mem_cgroup_uncharge_page() is
2965 * used before page reached the stage of being marked PageAnon.
2969 case MEM_CGROUP_CHARGE_TYPE_DROP:
2970 /* See mem_cgroup_prepare_migration() */
2971 if (page_mapped(page) || PageCgroupMigration(pc))
2974 case MEM_CGROUP_CHARGE_TYPE_SWAPOUT:
2975 if (!PageAnon(page)) { /* Shared memory */
2976 if (page->mapping && !page_is_file_cache(page))
2978 } else if (page_mapped(page)) /* Anon */
2985 mem_cgroup_charge_statistics(memcg, anon, -nr_pages);
2987 ClearPageCgroupUsed(pc);
2989 * pc->mem_cgroup is not cleared here. It will be accessed when it's
2990 * freed from LRU. This is safe because uncharged page is expected not
2991 * to be reused (freed soon). Exception is SwapCache, it's handled by
2992 * special functions.
2995 unlock_page_cgroup(pc);
2997 * even after unlock, we have memcg->res.usage here and this memcg
2998 * will never be freed.
3000 memcg_check_events(memcg, page);
3001 if (do_swap_account && ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) {
3002 mem_cgroup_swap_statistics(memcg, true);
3003 mem_cgroup_get(memcg);
3005 if (!mem_cgroup_is_root(memcg))
3006 mem_cgroup_do_uncharge(memcg, nr_pages, ctype);
3011 unlock_page_cgroup(pc);
3015 void mem_cgroup_uncharge_page(struct page *page)
3018 if (page_mapped(page))
3020 VM_BUG_ON(page->mapping && !PageAnon(page));
3021 __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_MAPPED);
3024 void mem_cgroup_uncharge_cache_page(struct page *page)
3026 VM_BUG_ON(page_mapped(page));
3027 VM_BUG_ON(page->mapping);
3028 __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_CACHE);
3032 * Batch_start/batch_end is called in unmap_page_range/invlidate/trucate.
3033 * In that cases, pages are freed continuously and we can expect pages
3034 * are in the same memcg. All these calls itself limits the number of
3035 * pages freed at once, then uncharge_start/end() is called properly.
3036 * This may be called prural(2) times in a context,
3039 void mem_cgroup_uncharge_start(void)
3041 current->memcg_batch.do_batch++;
3042 /* We can do nest. */
3043 if (current->memcg_batch.do_batch == 1) {
3044 current->memcg_batch.memcg = NULL;
3045 current->memcg_batch.nr_pages = 0;
3046 current->memcg_batch.memsw_nr_pages = 0;
3050 void mem_cgroup_uncharge_end(void)
3052 struct memcg_batch_info *batch = ¤t->memcg_batch;
3054 if (!batch->do_batch)
3058 if (batch->do_batch) /* If stacked, do nothing. */
3064 * This "batch->memcg" is valid without any css_get/put etc...
3065 * bacause we hide charges behind us.
3067 if (batch->nr_pages)
3068 res_counter_uncharge(&batch->memcg->res,
3069 batch->nr_pages * PAGE_SIZE);
3070 if (batch->memsw_nr_pages)
3071 res_counter_uncharge(&batch->memcg->memsw,
3072 batch->memsw_nr_pages * PAGE_SIZE);
3073 memcg_oom_recover(batch->memcg);
3074 /* forget this pointer (for sanity check) */
3075 batch->memcg = NULL;
3080 * called after __delete_from_swap_cache() and drop "page" account.
3081 * memcg information is recorded to swap_cgroup of "ent"
3084 mem_cgroup_uncharge_swapcache(struct page *page, swp_entry_t ent, bool swapout)
3086 struct mem_cgroup *memcg;
3087 int ctype = MEM_CGROUP_CHARGE_TYPE_SWAPOUT;
3089 if (!swapout) /* this was a swap cache but the swap is unused ! */
3090 ctype = MEM_CGROUP_CHARGE_TYPE_DROP;
3092 memcg = __mem_cgroup_uncharge_common(page, ctype);
3095 * record memcg information, if swapout && memcg != NULL,
3096 * mem_cgroup_get() was called in uncharge().
3098 if (do_swap_account && swapout && memcg)
3099 swap_cgroup_record(ent, css_id(&memcg->css));
3103 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP
3105 * called from swap_entry_free(). remove record in swap_cgroup and
3106 * uncharge "memsw" account.
3108 void mem_cgroup_uncharge_swap(swp_entry_t ent)
3110 struct mem_cgroup *memcg;
3113 if (!do_swap_account)
3116 id = swap_cgroup_record(ent, 0);
3118 memcg = mem_cgroup_lookup(id);
3121 * We uncharge this because swap is freed.
3122 * This memcg can be obsolete one. We avoid calling css_tryget
3124 if (!mem_cgroup_is_root(memcg))
3125 res_counter_uncharge(&memcg->memsw, PAGE_SIZE);
3126 mem_cgroup_swap_statistics(memcg, false);
3127 mem_cgroup_put(memcg);
3133 * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record.
3134 * @entry: swap entry to be moved
3135 * @from: mem_cgroup which the entry is moved from
3136 * @to: mem_cgroup which the entry is moved to
3138 * It succeeds only when the swap_cgroup's record for this entry is the same
3139 * as the mem_cgroup's id of @from.
3141 * Returns 0 on success, -EINVAL on failure.
3143 * The caller must have charged to @to, IOW, called res_counter_charge() about
3144 * both res and memsw, and called css_get().
3146 static int mem_cgroup_move_swap_account(swp_entry_t entry,
3147 struct mem_cgroup *from, struct mem_cgroup *to)
3149 unsigned short old_id, new_id;
3151 old_id = css_id(&from->css);
3152 new_id = css_id(&to->css);
3154 if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) {
3155 mem_cgroup_swap_statistics(from, false);
3156 mem_cgroup_swap_statistics(to, true);
3158 * This function is only called from task migration context now.
3159 * It postpones res_counter and refcount handling till the end
3160 * of task migration(mem_cgroup_clear_mc()) for performance
3161 * improvement. But we cannot postpone mem_cgroup_get(to)
3162 * because if the process that has been moved to @to does
3163 * swap-in, the refcount of @to might be decreased to 0.
3171 static inline int mem_cgroup_move_swap_account(swp_entry_t entry,
3172 struct mem_cgroup *from, struct mem_cgroup *to)
3179 * Before starting migration, account PAGE_SIZE to mem_cgroup that the old
3182 int mem_cgroup_prepare_migration(struct page *page,
3183 struct page *newpage, struct mem_cgroup **memcgp, gfp_t gfp_mask)
3185 struct mem_cgroup *memcg = NULL;
3186 struct page_cgroup *pc;
3187 enum charge_type ctype;
3192 VM_BUG_ON(PageTransHuge(page));
3193 if (mem_cgroup_disabled())
3196 pc = lookup_page_cgroup(page);
3197 lock_page_cgroup(pc);
3198 if (PageCgroupUsed(pc)) {
3199 memcg = pc->mem_cgroup;
3200 css_get(&memcg->css);
3202 * At migrating an anonymous page, its mapcount goes down
3203 * to 0 and uncharge() will be called. But, even if it's fully
3204 * unmapped, migration may fail and this page has to be
3205 * charged again. We set MIGRATION flag here and delay uncharge
3206 * until end_migration() is called
3208 * Corner Case Thinking
3210 * When the old page was mapped as Anon and it's unmap-and-freed
3211 * while migration was ongoing.
3212 * If unmap finds the old page, uncharge() of it will be delayed
3213 * until end_migration(). If unmap finds a new page, it's
3214 * uncharged when it make mapcount to be 1->0. If unmap code
3215 * finds swap_migration_entry, the new page will not be mapped
3216 * and end_migration() will find it(mapcount==0).
3219 * When the old page was mapped but migraion fails, the kernel
3220 * remaps it. A charge for it is kept by MIGRATION flag even
3221 * if mapcount goes down to 0. We can do remap successfully
3222 * without charging it again.
3225 * The "old" page is under lock_page() until the end of
3226 * migration, so, the old page itself will not be swapped-out.
3227 * If the new page is swapped out before end_migraton, our
3228 * hook to usual swap-out path will catch the event.
3231 SetPageCgroupMigration(pc);
3233 unlock_page_cgroup(pc);
3235 * If the page is not charged at this point,
3242 ret = __mem_cgroup_try_charge(NULL, gfp_mask, 1, memcgp, false);
3243 css_put(&memcg->css);/* drop extra refcnt */
3245 if (PageAnon(page)) {
3246 lock_page_cgroup(pc);
3247 ClearPageCgroupMigration(pc);
3248 unlock_page_cgroup(pc);
3250 * The old page may be fully unmapped while we kept it.
3252 mem_cgroup_uncharge_page(page);
3254 /* we'll need to revisit this error code (we have -EINTR) */
3258 * We charge new page before it's used/mapped. So, even if unlock_page()
3259 * is called before end_migration, we can catch all events on this new
3260 * page. In the case new page is migrated but not remapped, new page's
3261 * mapcount will be finally 0 and we call uncharge in end_migration().
3264 ctype = MEM_CGROUP_CHARGE_TYPE_MAPPED;
3265 else if (page_is_file_cache(page))
3266 ctype = MEM_CGROUP_CHARGE_TYPE_CACHE;
3268 ctype = MEM_CGROUP_CHARGE_TYPE_SHMEM;
3269 __mem_cgroup_commit_charge(memcg, newpage, 1, ctype, false);
3273 /* remove redundant charge if migration failed*/
3274 void mem_cgroup_end_migration(struct mem_cgroup *memcg,
3275 struct page *oldpage, struct page *newpage, bool migration_ok)
3277 struct page *used, *unused;
3278 struct page_cgroup *pc;
3283 /* blocks rmdir() */
3284 cgroup_exclude_rmdir(&memcg->css);
3285 if (!migration_ok) {
3293 * We disallowed uncharge of pages under migration because mapcount
3294 * of the page goes down to zero, temporarly.
3295 * Clear the flag and check the page should be charged.
3297 pc = lookup_page_cgroup(oldpage);
3298 lock_page_cgroup(pc);
3299 ClearPageCgroupMigration(pc);
3300 unlock_page_cgroup(pc);
3301 anon = PageAnon(used);
3302 __mem_cgroup_uncharge_common(unused,
3303 anon ? MEM_CGROUP_CHARGE_TYPE_MAPPED
3304 : MEM_CGROUP_CHARGE_TYPE_CACHE);
3307 * If a page is a file cache, radix-tree replacement is very atomic
3308 * and we can skip this check. When it was an Anon page, its mapcount
3309 * goes down to 0. But because we added MIGRATION flage, it's not
3310 * uncharged yet. There are several case but page->mapcount check
3311 * and USED bit check in mem_cgroup_uncharge_page() will do enough
3312 * check. (see prepare_charge() also)
3315 mem_cgroup_uncharge_page(used);
3317 * At migration, we may charge account against cgroup which has no
3319 * So, rmdir()->pre_destroy() can be called while we do this charge.
3320 * In that case, we need to call pre_destroy() again. check it here.
3322 cgroup_release_and_wakeup_rmdir(&memcg->css);
3326 * At replace page cache, newpage is not under any memcg but it's on
3327 * LRU. So, this function doesn't touch res_counter but handles LRU
3328 * in correct way. Both pages are locked so we cannot race with uncharge.
3330 void mem_cgroup_replace_page_cache(struct page *oldpage,
3331 struct page *newpage)
3333 struct mem_cgroup *memcg = NULL;
3334 struct page_cgroup *pc;
3335 enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE;
3337 if (mem_cgroup_disabled())
3340 pc = lookup_page_cgroup(oldpage);
3341 /* fix accounting on old pages */
3342 lock_page_cgroup(pc);
3343 if (PageCgroupUsed(pc)) {
3344 memcg = pc->mem_cgroup;
3345 mem_cgroup_charge_statistics(memcg, false, -1);
3346 ClearPageCgroupUsed(pc);
3348 unlock_page_cgroup(pc);
3351 * When called from shmem_replace_page(), in some cases the
3352 * oldpage has already been charged, and in some cases not.
3357 if (PageSwapBacked(oldpage))
3358 type = MEM_CGROUP_CHARGE_TYPE_SHMEM;
3361 * Even if newpage->mapping was NULL before starting replacement,
3362 * the newpage may be on LRU(or pagevec for LRU) already. We lock
3363 * LRU while we overwrite pc->mem_cgroup.
3365 __mem_cgroup_commit_charge(memcg, newpage, 1, type, true);
3368 #ifdef CONFIG_DEBUG_VM
3369 static struct page_cgroup *lookup_page_cgroup_used(struct page *page)
3371 struct page_cgroup *pc;
3373 pc = lookup_page_cgroup(page);
3375 * Can be NULL while feeding pages into the page allocator for
3376 * the first time, i.e. during boot or memory hotplug;
3377 * or when mem_cgroup_disabled().
3379 if (likely(pc) && PageCgroupUsed(pc))
3384 bool mem_cgroup_bad_page_check(struct page *page)
3386 if (mem_cgroup_disabled())
3389 return lookup_page_cgroup_used(page) != NULL;
3392 void mem_cgroup_print_bad_page(struct page *page)
3394 struct page_cgroup *pc;
3396 pc = lookup_page_cgroup_used(page);
3398 printk(KERN_ALERT "pc:%p pc->flags:%lx pc->mem_cgroup:%p\n",
3399 pc, pc->flags, pc->mem_cgroup);
3404 static DEFINE_MUTEX(set_limit_mutex);
3406 static int mem_cgroup_resize_limit(struct mem_cgroup *memcg,
3407 unsigned long long val)
3410 u64 memswlimit, memlimit;
3412 int children = mem_cgroup_count_children(memcg);
3413 u64 curusage, oldusage;
3417 * For keeping hierarchical_reclaim simple, how long we should retry
3418 * is depends on callers. We set our retry-count to be function
3419 * of # of children which we should visit in this loop.
3421 retry_count = MEM_CGROUP_RECLAIM_RETRIES * children;
3423 oldusage = res_counter_read_u64(&memcg->res, RES_USAGE);
3426 while (retry_count) {
3427 if (signal_pending(current)) {
3432 * Rather than hide all in some function, I do this in
3433 * open coded manner. You see what this really does.
3434 * We have to guarantee memcg->res.limit < memcg->memsw.limit.
3436 mutex_lock(&set_limit_mutex);
3437 memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3438 if (memswlimit < val) {
3440 mutex_unlock(&set_limit_mutex);
3444 memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT);
3448 ret = res_counter_set_limit(&memcg->res, val);
3450 if (memswlimit == val)
3451 memcg->memsw_is_minimum = true;
3453 memcg->memsw_is_minimum = false;
3455 mutex_unlock(&set_limit_mutex);
3460 mem_cgroup_reclaim(memcg, GFP_KERNEL,
3461 MEM_CGROUP_RECLAIM_SHRINK);
3462 curusage = res_counter_read_u64(&memcg->res, RES_USAGE);
3463 /* Usage is reduced ? */
3464 if (curusage >= oldusage)
3467 oldusage = curusage;
3469 if (!ret && enlarge)
3470 memcg_oom_recover(memcg);
3475 static int mem_cgroup_resize_memsw_limit(struct mem_cgroup *memcg,
3476 unsigned long long val)
3479 u64 memlimit, memswlimit, oldusage, curusage;
3480 int children = mem_cgroup_count_children(memcg);
3484 /* see mem_cgroup_resize_res_limit */
3485 retry_count = children * MEM_CGROUP_RECLAIM_RETRIES;
3486 oldusage = res_counter_read_u64(&memcg->memsw, RES_USAGE);
3487 while (retry_count) {
3488 if (signal_pending(current)) {
3493 * Rather than hide all in some function, I do this in
3494 * open coded manner. You see what this really does.
3495 * We have to guarantee memcg->res.limit < memcg->memsw.limit.
3497 mutex_lock(&set_limit_mutex);
3498 memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT);
3499 if (memlimit > val) {
3501 mutex_unlock(&set_limit_mutex);
3504 memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3505 if (memswlimit < val)
3507 ret = res_counter_set_limit(&memcg->memsw, val);
3509 if (memlimit == val)
3510 memcg->memsw_is_minimum = true;
3512 memcg->memsw_is_minimum = false;
3514 mutex_unlock(&set_limit_mutex);
3519 mem_cgroup_reclaim(memcg, GFP_KERNEL,
3520 MEM_CGROUP_RECLAIM_NOSWAP |
3521 MEM_CGROUP_RECLAIM_SHRINK);
3522 curusage = res_counter_read_u64(&memcg->memsw, RES_USAGE);
3523 /* Usage is reduced ? */
3524 if (curusage >= oldusage)
3527 oldusage = curusage;
3529 if (!ret && enlarge)
3530 memcg_oom_recover(memcg);
3534 unsigned long mem_cgroup_soft_limit_reclaim(struct zone *zone, int order,
3536 unsigned long *total_scanned)
3538 unsigned long nr_reclaimed = 0;
3539 struct mem_cgroup_per_zone *mz, *next_mz = NULL;
3540 unsigned long reclaimed;
3542 struct mem_cgroup_tree_per_zone *mctz;
3543 unsigned long long excess;
3544 unsigned long nr_scanned;
3549 mctz = soft_limit_tree_node_zone(zone_to_nid(zone), zone_idx(zone));
3551 * This loop can run a while, specially if mem_cgroup's continuously
3552 * keep exceeding their soft limit and putting the system under
3559 mz = mem_cgroup_largest_soft_limit_node(mctz);
3564 reclaimed = mem_cgroup_soft_reclaim(mz->memcg, zone,
3565 gfp_mask, &nr_scanned);
3566 nr_reclaimed += reclaimed;
3567 *total_scanned += nr_scanned;
3568 spin_lock(&mctz->lock);
3571 * If we failed to reclaim anything from this memory cgroup
3572 * it is time to move on to the next cgroup
3578 * Loop until we find yet another one.
3580 * By the time we get the soft_limit lock
3581 * again, someone might have aded the
3582 * group back on the RB tree. Iterate to
3583 * make sure we get a different mem.
3584 * mem_cgroup_largest_soft_limit_node returns
3585 * NULL if no other cgroup is present on
3589 __mem_cgroup_largest_soft_limit_node(mctz);
3591 css_put(&next_mz->memcg->css);
3592 else /* next_mz == NULL or other memcg */
3596 __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz);
3597 excess = res_counter_soft_limit_excess(&mz->memcg->res);
3599 * One school of thought says that we should not add
3600 * back the node to the tree if reclaim returns 0.
3601 * But our reclaim could return 0, simply because due
3602 * to priority we are exposing a smaller subset of
3603 * memory to reclaim from. Consider this as a longer
3606 /* If excess == 0, no tree ops */
3607 __mem_cgroup_insert_exceeded(mz->memcg, mz, mctz, excess);
3608 spin_unlock(&mctz->lock);
3609 css_put(&mz->memcg->css);
3612 * Could not reclaim anything and there are no more
3613 * mem cgroups to try or we seem to be looping without
3614 * reclaiming anything.
3616 if (!nr_reclaimed &&
3618 loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS))
3620 } while (!nr_reclaimed);
3622 css_put(&next_mz->memcg->css);
3623 return nr_reclaimed;
3627 * This routine traverse page_cgroup in given list and drop them all.
3628 * *And* this routine doesn't reclaim page itself, just removes page_cgroup.
3630 static int mem_cgroup_force_empty_list(struct mem_cgroup *memcg,
3631 int node, int zid, enum lru_list lru)
3633 struct mem_cgroup_per_zone *mz;
3634 unsigned long flags, loop;
3635 struct list_head *list;
3640 zone = &NODE_DATA(node)->node_zones[zid];
3641 mz = mem_cgroup_zoneinfo(memcg, node, zid);
3642 list = &mz->lruvec.lists[lru];
3644 loop = mz->lru_size[lru];
3645 /* give some margin against EBUSY etc...*/
3649 struct page_cgroup *pc;
3653 spin_lock_irqsave(&zone->lru_lock, flags);
3654 if (list_empty(list)) {
3655 spin_unlock_irqrestore(&zone->lru_lock, flags);
3658 page = list_entry(list->prev, struct page, lru);
3660 list_move(&page->lru, list);
3662 spin_unlock_irqrestore(&zone->lru_lock, flags);
3665 spin_unlock_irqrestore(&zone->lru_lock, flags);
3667 pc = lookup_page_cgroup(page);
3669 ret = mem_cgroup_move_parent(page, pc, memcg, GFP_KERNEL);
3670 if (ret == -ENOMEM || ret == -EINTR)
3673 if (ret == -EBUSY || ret == -EINVAL) {
3674 /* found lock contention or "pc" is obsolete. */
3681 if (!ret && !list_empty(list))
3687 * make mem_cgroup's charge to be 0 if there is no task.
3688 * This enables deleting this mem_cgroup.
3690 static int mem_cgroup_force_empty(struct mem_cgroup *memcg, bool free_all)
3693 int node, zid, shrink;
3694 int nr_retries = MEM_CGROUP_RECLAIM_RETRIES;
3695 struct cgroup *cgrp = memcg->css.cgroup;
3697 css_get(&memcg->css);
3700 /* should free all ? */
3706 if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children))
3709 if (signal_pending(current))
3711 /* This is for making all *used* pages to be on LRU. */
3712 lru_add_drain_all();
3713 drain_all_stock_sync(memcg);
3715 mem_cgroup_start_move(memcg);
3716 for_each_node_state(node, N_HIGH_MEMORY) {
3717 for (zid = 0; !ret && zid < MAX_NR_ZONES; zid++) {
3720 ret = mem_cgroup_force_empty_list(memcg,
3729 mem_cgroup_end_move(memcg);
3730 memcg_oom_recover(memcg);
3731 /* it seems parent cgroup doesn't have enough mem */
3735 /* "ret" should also be checked to ensure all lists are empty. */
3736 } while (res_counter_read_u64(&memcg->res, RES_USAGE) > 0 || ret);
3738 css_put(&memcg->css);
3742 /* returns EBUSY if there is a task or if we come here twice. */
3743 if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children) || shrink) {
3747 /* we call try-to-free pages for make this cgroup empty */
3748 lru_add_drain_all();
3749 /* try to free all pages in this cgroup */
3751 while (nr_retries && res_counter_read_u64(&memcg->res, RES_USAGE) > 0) {
3754 if (signal_pending(current)) {
3758 progress = try_to_free_mem_cgroup_pages(memcg, GFP_KERNEL,
3762 /* maybe some writeback is necessary */
3763 congestion_wait(BLK_RW_ASYNC, HZ/10);
3768 /* try move_account...there may be some *locked* pages. */
3772 static int mem_cgroup_force_empty_write(struct cgroup *cont, unsigned int event)
3774 return mem_cgroup_force_empty(mem_cgroup_from_cont(cont), true);
3778 static u64 mem_cgroup_hierarchy_read(struct cgroup *cont, struct cftype *cft)
3780 return mem_cgroup_from_cont(cont)->use_hierarchy;
3783 static int mem_cgroup_hierarchy_write(struct cgroup *cont, struct cftype *cft,
3787 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
3788 struct cgroup *parent = cont->parent;
3789 struct mem_cgroup *parent_memcg = NULL;
3792 parent_memcg = mem_cgroup_from_cont(parent);
3796 * If parent's use_hierarchy is set, we can't make any modifications
3797 * in the child subtrees. If it is unset, then the change can
3798 * occur, provided the current cgroup has no children.
3800 * For the root cgroup, parent_mem is NULL, we allow value to be
3801 * set if there are no children.
3803 if ((!parent_memcg || !parent_memcg->use_hierarchy) &&
3804 (val == 1 || val == 0)) {
3805 if (list_empty(&cont->children))
3806 memcg->use_hierarchy = val;
3817 static unsigned long mem_cgroup_recursive_stat(struct mem_cgroup *memcg,
3818 enum mem_cgroup_stat_index idx)
3820 struct mem_cgroup *iter;
3823 /* Per-cpu values can be negative, use a signed accumulator */
3824 for_each_mem_cgroup_tree(iter, memcg)
3825 val += mem_cgroup_read_stat(iter, idx);
3827 if (val < 0) /* race ? */
3832 static inline u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap)
3836 if (!mem_cgroup_is_root(memcg)) {
3838 return res_counter_read_u64(&memcg->res, RES_USAGE);
3840 return res_counter_read_u64(&memcg->memsw, RES_USAGE);
3843 val = mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_CACHE);
3844 val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_RSS);
3847 val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_SWAPOUT);
3849 return val << PAGE_SHIFT;
3852 static ssize_t mem_cgroup_read(struct cgroup *cont, struct cftype *cft,
3853 struct file *file, char __user *buf,
3854 size_t nbytes, loff_t *ppos)
3856 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
3859 int type, name, len;
3861 type = MEMFILE_TYPE(cft->private);
3862 name = MEMFILE_ATTR(cft->private);
3864 if (!do_swap_account && type == _MEMSWAP)
3869 if (name == RES_USAGE)
3870 val = mem_cgroup_usage(memcg, false);
3872 val = res_counter_read_u64(&memcg->res, name);
3875 if (name == RES_USAGE)
3876 val = mem_cgroup_usage(memcg, true);
3878 val = res_counter_read_u64(&memcg->memsw, name);
3884 len = scnprintf(str, sizeof(str), "%llu\n", (unsigned long long)val);
3885 return simple_read_from_buffer(buf, nbytes, ppos, str, len);
3888 * The user of this function is...
3891 static int mem_cgroup_write(struct cgroup *cont, struct cftype *cft,
3894 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
3896 unsigned long long val;
3899 type = MEMFILE_TYPE(cft->private);
3900 name = MEMFILE_ATTR(cft->private);
3902 if (!do_swap_account && type == _MEMSWAP)
3907 if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */
3911 /* This function does all necessary parse...reuse it */
3912 ret = res_counter_memparse_write_strategy(buffer, &val);
3916 ret = mem_cgroup_resize_limit(memcg, val);
3918 ret = mem_cgroup_resize_memsw_limit(memcg, val);
3920 case RES_SOFT_LIMIT:
3921 ret = res_counter_memparse_write_strategy(buffer, &val);
3925 * For memsw, soft limits are hard to implement in terms
3926 * of semantics, for now, we support soft limits for
3927 * control without swap
3930 ret = res_counter_set_soft_limit(&memcg->res, val);
3935 ret = -EINVAL; /* should be BUG() ? */
3941 static void memcg_get_hierarchical_limit(struct mem_cgroup *memcg,
3942 unsigned long long *mem_limit, unsigned long long *memsw_limit)
3944 struct cgroup *cgroup;
3945 unsigned long long min_limit, min_memsw_limit, tmp;
3947 min_limit = res_counter_read_u64(&memcg->res, RES_LIMIT);
3948 min_memsw_limit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3949 cgroup = memcg->css.cgroup;
3950 if (!memcg->use_hierarchy)
3953 while (cgroup->parent) {
3954 cgroup = cgroup->parent;
3955 memcg = mem_cgroup_from_cont(cgroup);
3956 if (!memcg->use_hierarchy)
3958 tmp = res_counter_read_u64(&memcg->res, RES_LIMIT);
3959 min_limit = min(min_limit, tmp);
3960 tmp = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3961 min_memsw_limit = min(min_memsw_limit, tmp);
3964 *mem_limit = min_limit;
3965 *memsw_limit = min_memsw_limit;
3968 static int mem_cgroup_reset(struct cgroup *cont, unsigned int event)
3970 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
3973 type = MEMFILE_TYPE(event);
3974 name = MEMFILE_ATTR(event);
3976 if (!do_swap_account && type == _MEMSWAP)
3982 res_counter_reset_max(&memcg->res);
3984 res_counter_reset_max(&memcg->memsw);
3988 res_counter_reset_failcnt(&memcg->res);
3990 res_counter_reset_failcnt(&memcg->memsw);
3997 static u64 mem_cgroup_move_charge_read(struct cgroup *cgrp,
4000 return mem_cgroup_from_cont(cgrp)->move_charge_at_immigrate;
4004 static int mem_cgroup_move_charge_write(struct cgroup *cgrp,
4005 struct cftype *cft, u64 val)
4007 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4009 if (val >= (1 << NR_MOVE_TYPE))
4012 * We check this value several times in both in can_attach() and
4013 * attach(), so we need cgroup lock to prevent this value from being
4017 memcg->move_charge_at_immigrate = val;
4023 static int mem_cgroup_move_charge_write(struct cgroup *cgrp,
4024 struct cftype *cft, u64 val)
4031 /* For read statistics */
4049 struct mcs_total_stat {
4050 s64 stat[NR_MCS_STAT];
4056 } memcg_stat_strings[NR_MCS_STAT] = {
4057 {"cache", "total_cache"},
4058 {"rss", "total_rss"},
4059 {"mapped_file", "total_mapped_file"},
4060 {"pgpgin", "total_pgpgin"},
4061 {"pgpgout", "total_pgpgout"},
4062 {"swap", "total_swap"},
4063 {"pgfault", "total_pgfault"},
4064 {"pgmajfault", "total_pgmajfault"},
4065 {"inactive_anon", "total_inactive_anon"},
4066 {"active_anon", "total_active_anon"},
4067 {"inactive_file", "total_inactive_file"},
4068 {"active_file", "total_active_file"},
4069 {"unevictable", "total_unevictable"}
4074 mem_cgroup_get_local_stat(struct mem_cgroup *memcg, struct mcs_total_stat *s)
4079 val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_CACHE);
4080 s->stat[MCS_CACHE] += val * PAGE_SIZE;
4081 val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_RSS);
4082 s->stat[MCS_RSS] += val * PAGE_SIZE;
4083 val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_FILE_MAPPED);
4084 s->stat[MCS_FILE_MAPPED] += val * PAGE_SIZE;
4085 val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGPGIN);
4086 s->stat[MCS_PGPGIN] += val;
4087 val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGPGOUT);
4088 s->stat[MCS_PGPGOUT] += val;
4089 if (do_swap_account) {
4090 val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_SWAPOUT);
4091 s->stat[MCS_SWAP] += val * PAGE_SIZE;
4093 val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGFAULT);
4094 s->stat[MCS_PGFAULT] += val;
4095 val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGMAJFAULT);
4096 s->stat[MCS_PGMAJFAULT] += val;
4099 val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_INACTIVE_ANON));
4100 s->stat[MCS_INACTIVE_ANON] += val * PAGE_SIZE;
4101 val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_ACTIVE_ANON));
4102 s->stat[MCS_ACTIVE_ANON] += val * PAGE_SIZE;
4103 val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_INACTIVE_FILE));
4104 s->stat[MCS_INACTIVE_FILE] += val * PAGE_SIZE;
4105 val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_ACTIVE_FILE));
4106 s->stat[MCS_ACTIVE_FILE] += val * PAGE_SIZE;
4107 val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_UNEVICTABLE));
4108 s->stat[MCS_UNEVICTABLE] += val * PAGE_SIZE;
4112 mem_cgroup_get_total_stat(struct mem_cgroup *memcg, struct mcs_total_stat *s)
4114 struct mem_cgroup *iter;
4116 for_each_mem_cgroup_tree(iter, memcg)
4117 mem_cgroup_get_local_stat(iter, s);
4121 static int mem_control_numa_stat_show(struct seq_file *m, void *arg)
4124 unsigned long total_nr, file_nr, anon_nr, unevictable_nr;
4125 unsigned long node_nr;
4126 struct cgroup *cont = m->private;
4127 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4129 total_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL);
4130 seq_printf(m, "total=%lu", total_nr);
4131 for_each_node_state(nid, N_HIGH_MEMORY) {
4132 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL);
4133 seq_printf(m, " N%d=%lu", nid, node_nr);
4137 file_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL_FILE);
4138 seq_printf(m, "file=%lu", file_nr);
4139 for_each_node_state(nid, N_HIGH_MEMORY) {
4140 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
4142 seq_printf(m, " N%d=%lu", nid, node_nr);
4146 anon_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL_ANON);
4147 seq_printf(m, "anon=%lu", anon_nr);
4148 for_each_node_state(nid, N_HIGH_MEMORY) {
4149 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
4151 seq_printf(m, " N%d=%lu", nid, node_nr);
4155 unevictable_nr = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_UNEVICTABLE));
4156 seq_printf(m, "unevictable=%lu", unevictable_nr);
4157 for_each_node_state(nid, N_HIGH_MEMORY) {
4158 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
4159 BIT(LRU_UNEVICTABLE));
4160 seq_printf(m, " N%d=%lu", nid, node_nr);
4165 #endif /* CONFIG_NUMA */
4167 static int mem_control_stat_show(struct cgroup *cont, struct cftype *cft,
4168 struct cgroup_map_cb *cb)
4170 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4171 struct mcs_total_stat mystat;
4174 memset(&mystat, 0, sizeof(mystat));
4175 mem_cgroup_get_local_stat(memcg, &mystat);
4178 for (i = 0; i < NR_MCS_STAT; i++) {
4179 if (i == MCS_SWAP && !do_swap_account)
4181 cb->fill(cb, memcg_stat_strings[i].local_name, mystat.stat[i]);
4184 /* Hierarchical information */
4186 unsigned long long limit, memsw_limit;
4187 memcg_get_hierarchical_limit(memcg, &limit, &memsw_limit);
4188 cb->fill(cb, "hierarchical_memory_limit", limit);
4189 if (do_swap_account)
4190 cb->fill(cb, "hierarchical_memsw_limit", memsw_limit);
4193 memset(&mystat, 0, sizeof(mystat));
4194 mem_cgroup_get_total_stat(memcg, &mystat);
4195 for (i = 0; i < NR_MCS_STAT; i++) {
4196 if (i == MCS_SWAP && !do_swap_account)
4198 cb->fill(cb, memcg_stat_strings[i].total_name, mystat.stat[i]);
4201 #ifdef CONFIG_DEBUG_VM
4204 struct mem_cgroup_per_zone *mz;
4205 struct zone_reclaim_stat *rstat;
4206 unsigned long recent_rotated[2] = {0, 0};
4207 unsigned long recent_scanned[2] = {0, 0};
4209 for_each_online_node(nid)
4210 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
4211 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
4212 rstat = &mz->lruvec.reclaim_stat;
4214 recent_rotated[0] += rstat->recent_rotated[0];
4215 recent_rotated[1] += rstat->recent_rotated[1];
4216 recent_scanned[0] += rstat->recent_scanned[0];
4217 recent_scanned[1] += rstat->recent_scanned[1];
4219 cb->fill(cb, "recent_rotated_anon", recent_rotated[0]);
4220 cb->fill(cb, "recent_rotated_file", recent_rotated[1]);
4221 cb->fill(cb, "recent_scanned_anon", recent_scanned[0]);
4222 cb->fill(cb, "recent_scanned_file", recent_scanned[1]);
4229 static u64 mem_cgroup_swappiness_read(struct cgroup *cgrp, struct cftype *cft)
4231 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4233 return mem_cgroup_swappiness(memcg);
4236 static int mem_cgroup_swappiness_write(struct cgroup *cgrp, struct cftype *cft,
4239 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4240 struct mem_cgroup *parent;
4245 if (cgrp->parent == NULL)
4248 parent = mem_cgroup_from_cont(cgrp->parent);
4252 /* If under hierarchy, only empty-root can set this value */
4253 if ((parent->use_hierarchy) ||
4254 (memcg->use_hierarchy && !list_empty(&cgrp->children))) {
4259 memcg->swappiness = val;
4266 static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap)
4268 struct mem_cgroup_threshold_ary *t;
4274 t = rcu_dereference(memcg->thresholds.primary);
4276 t = rcu_dereference(memcg->memsw_thresholds.primary);
4281 usage = mem_cgroup_usage(memcg, swap);
4284 * current_threshold points to threshold just below or equal to usage.
4285 * If it's not true, a threshold was crossed after last
4286 * call of __mem_cgroup_threshold().
4288 i = t->current_threshold;
4291 * Iterate backward over array of thresholds starting from
4292 * current_threshold and check if a threshold is crossed.
4293 * If none of thresholds below usage is crossed, we read
4294 * only one element of the array here.
4296 for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)
4297 eventfd_signal(t->entries[i].eventfd, 1);
4299 /* i = current_threshold + 1 */
4303 * Iterate forward over array of thresholds starting from
4304 * current_threshold+1 and check if a threshold is crossed.
4305 * If none of thresholds above usage is crossed, we read
4306 * only one element of the array here.
4308 for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)
4309 eventfd_signal(t->entries[i].eventfd, 1);
4311 /* Update current_threshold */
4312 t->current_threshold = i - 1;
4317 static void mem_cgroup_threshold(struct mem_cgroup *memcg)
4320 __mem_cgroup_threshold(memcg, false);
4321 if (do_swap_account)
4322 __mem_cgroup_threshold(memcg, true);
4324 memcg = parent_mem_cgroup(memcg);
4328 static int compare_thresholds(const void *a, const void *b)
4330 const struct mem_cgroup_threshold *_a = a;
4331 const struct mem_cgroup_threshold *_b = b;
4333 return _a->threshold - _b->threshold;
4336 static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg)
4338 struct mem_cgroup_eventfd_list *ev;
4340 list_for_each_entry(ev, &memcg->oom_notify, list)
4341 eventfd_signal(ev->eventfd, 1);
4345 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg)
4347 struct mem_cgroup *iter;
4349 for_each_mem_cgroup_tree(iter, memcg)
4350 mem_cgroup_oom_notify_cb(iter);
4353 static int mem_cgroup_usage_register_event(struct cgroup *cgrp,
4354 struct cftype *cft, struct eventfd_ctx *eventfd, const char *args)
4356 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4357 struct mem_cgroup_thresholds *thresholds;
4358 struct mem_cgroup_threshold_ary *new;
4359 int type = MEMFILE_TYPE(cft->private);
4360 u64 threshold, usage;
4363 ret = res_counter_memparse_write_strategy(args, &threshold);
4367 mutex_lock(&memcg->thresholds_lock);
4370 thresholds = &memcg->thresholds;
4371 else if (type == _MEMSWAP)
4372 thresholds = &memcg->memsw_thresholds;
4376 usage = mem_cgroup_usage(memcg, type == _MEMSWAP);
4378 /* Check if a threshold crossed before adding a new one */
4379 if (thresholds->primary)
4380 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
4382 size = thresholds->primary ? thresholds->primary->size + 1 : 1;
4384 /* Allocate memory for new array of thresholds */
4385 new = kmalloc(sizeof(*new) + size * sizeof(struct mem_cgroup_threshold),
4393 /* Copy thresholds (if any) to new array */
4394 if (thresholds->primary) {
4395 memcpy(new->entries, thresholds->primary->entries, (size - 1) *
4396 sizeof(struct mem_cgroup_threshold));
4399 /* Add new threshold */
4400 new->entries[size - 1].eventfd = eventfd;
4401 new->entries[size - 1].threshold = threshold;
4403 /* Sort thresholds. Registering of new threshold isn't time-critical */
4404 sort(new->entries, size, sizeof(struct mem_cgroup_threshold),
4405 compare_thresholds, NULL);
4407 /* Find current threshold */
4408 new->current_threshold = -1;
4409 for (i = 0; i < size; i++) {
4410 if (new->entries[i].threshold <= usage) {
4412 * new->current_threshold will not be used until
4413 * rcu_assign_pointer(), so it's safe to increment
4416 ++new->current_threshold;
4421 /* Free old spare buffer and save old primary buffer as spare */
4422 kfree(thresholds->spare);
4423 thresholds->spare = thresholds->primary;
4425 rcu_assign_pointer(thresholds->primary, new);
4427 /* To be sure that nobody uses thresholds */
4431 mutex_unlock(&memcg->thresholds_lock);
4436 static void mem_cgroup_usage_unregister_event(struct cgroup *cgrp,
4437 struct cftype *cft, struct eventfd_ctx *eventfd)
4439 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4440 struct mem_cgroup_thresholds *thresholds;
4441 struct mem_cgroup_threshold_ary *new;
4442 int type = MEMFILE_TYPE(cft->private);
4446 mutex_lock(&memcg->thresholds_lock);
4448 thresholds = &memcg->thresholds;
4449 else if (type == _MEMSWAP)
4450 thresholds = &memcg->memsw_thresholds;
4454 if (!thresholds->primary)
4457 usage = mem_cgroup_usage(memcg, type == _MEMSWAP);
4459 /* Check if a threshold crossed before removing */
4460 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
4462 /* Calculate new number of threshold */
4464 for (i = 0; i < thresholds->primary->size; i++) {
4465 if (thresholds->primary->entries[i].eventfd != eventfd)
4469 new = thresholds->spare;
4471 /* Set thresholds array to NULL if we don't have thresholds */
4480 /* Copy thresholds and find current threshold */
4481 new->current_threshold = -1;
4482 for (i = 0, j = 0; i < thresholds->primary->size; i++) {
4483 if (thresholds->primary->entries[i].eventfd == eventfd)
4486 new->entries[j] = thresholds->primary->entries[i];
4487 if (new->entries[j].threshold <= usage) {
4489 * new->current_threshold will not be used
4490 * until rcu_assign_pointer(), so it's safe to increment
4493 ++new->current_threshold;
4499 /* Swap primary and spare array */
4500 thresholds->spare = thresholds->primary;
4501 /* If all events are unregistered, free the spare array */
4503 kfree(thresholds->spare);
4504 thresholds->spare = NULL;
4507 rcu_assign_pointer(thresholds->primary, new);
4509 /* To be sure that nobody uses thresholds */
4512 mutex_unlock(&memcg->thresholds_lock);
4515 static int mem_cgroup_oom_register_event(struct cgroup *cgrp,
4516 struct cftype *cft, struct eventfd_ctx *eventfd, const char *args)
4518 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4519 struct mem_cgroup_eventfd_list *event;
4520 int type = MEMFILE_TYPE(cft->private);
4522 BUG_ON(type != _OOM_TYPE);
4523 event = kmalloc(sizeof(*event), GFP_KERNEL);
4527 spin_lock(&memcg_oom_lock);
4529 event->eventfd = eventfd;
4530 list_add(&event->list, &memcg->oom_notify);
4532 /* already in OOM ? */
4533 if (atomic_read(&memcg->under_oom))
4534 eventfd_signal(eventfd, 1);
4535 spin_unlock(&memcg_oom_lock);
4540 static void mem_cgroup_oom_unregister_event(struct cgroup *cgrp,
4541 struct cftype *cft, struct eventfd_ctx *eventfd)
4543 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4544 struct mem_cgroup_eventfd_list *ev, *tmp;
4545 int type = MEMFILE_TYPE(cft->private);
4547 BUG_ON(type != _OOM_TYPE);
4549 spin_lock(&memcg_oom_lock);
4551 list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) {
4552 if (ev->eventfd == eventfd) {
4553 list_del(&ev->list);
4558 spin_unlock(&memcg_oom_lock);
4561 static int mem_cgroup_oom_control_read(struct cgroup *cgrp,
4562 struct cftype *cft, struct cgroup_map_cb *cb)
4564 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4566 cb->fill(cb, "oom_kill_disable", memcg->oom_kill_disable);
4568 if (atomic_read(&memcg->under_oom))
4569 cb->fill(cb, "under_oom", 1);
4571 cb->fill(cb, "under_oom", 0);
4575 static int mem_cgroup_oom_control_write(struct cgroup *cgrp,
4576 struct cftype *cft, u64 val)
4578 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4579 struct mem_cgroup *parent;
4581 /* cannot set to root cgroup and only 0 and 1 are allowed */
4582 if (!cgrp->parent || !((val == 0) || (val == 1)))
4585 parent = mem_cgroup_from_cont(cgrp->parent);
4588 /* oom-kill-disable is a flag for subhierarchy. */
4589 if ((parent->use_hierarchy) ||
4590 (memcg->use_hierarchy && !list_empty(&cgrp->children))) {
4594 memcg->oom_kill_disable = val;
4596 memcg_oom_recover(memcg);
4602 static const struct file_operations mem_control_numa_stat_file_operations = {
4604 .llseek = seq_lseek,
4605 .release = single_release,
4608 static int mem_control_numa_stat_open(struct inode *unused, struct file *file)
4610 struct cgroup *cont = file->f_dentry->d_parent->d_fsdata;
4612 file->f_op = &mem_control_numa_stat_file_operations;
4613 return single_open(file, mem_control_numa_stat_show, cont);
4615 #endif /* CONFIG_NUMA */
4617 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_KMEM
4618 static int memcg_init_kmem(struct mem_cgroup *memcg, struct cgroup_subsys *ss)
4620 return mem_cgroup_sockets_init(memcg, ss);
4623 static void kmem_cgroup_destroy(struct mem_cgroup *memcg)
4625 mem_cgroup_sockets_destroy(memcg);
4628 static int memcg_init_kmem(struct mem_cgroup *memcg, struct cgroup_subsys *ss)
4633 static void kmem_cgroup_destroy(struct mem_cgroup *memcg)
4638 static struct cftype mem_cgroup_files[] = {
4640 .name = "usage_in_bytes",
4641 .private = MEMFILE_PRIVATE(_MEM, RES_USAGE),
4642 .read = mem_cgroup_read,
4643 .register_event = mem_cgroup_usage_register_event,
4644 .unregister_event = mem_cgroup_usage_unregister_event,
4647 .name = "max_usage_in_bytes",
4648 .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE),
4649 .trigger = mem_cgroup_reset,
4650 .read = mem_cgroup_read,
4653 .name = "limit_in_bytes",
4654 .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT),
4655 .write_string = mem_cgroup_write,
4656 .read = mem_cgroup_read,
4659 .name = "soft_limit_in_bytes",
4660 .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT),
4661 .write_string = mem_cgroup_write,
4662 .read = mem_cgroup_read,
4666 .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT),
4667 .trigger = mem_cgroup_reset,
4668 .read = mem_cgroup_read,
4672 .read_map = mem_control_stat_show,
4675 .name = "force_empty",
4676 .trigger = mem_cgroup_force_empty_write,
4679 .name = "use_hierarchy",
4680 .write_u64 = mem_cgroup_hierarchy_write,
4681 .read_u64 = mem_cgroup_hierarchy_read,
4684 .name = "swappiness",
4685 .read_u64 = mem_cgroup_swappiness_read,
4686 .write_u64 = mem_cgroup_swappiness_write,
4689 .name = "move_charge_at_immigrate",
4690 .read_u64 = mem_cgroup_move_charge_read,
4691 .write_u64 = mem_cgroup_move_charge_write,
4694 .name = "oom_control",
4695 .read_map = mem_cgroup_oom_control_read,
4696 .write_u64 = mem_cgroup_oom_control_write,
4697 .register_event = mem_cgroup_oom_register_event,
4698 .unregister_event = mem_cgroup_oom_unregister_event,
4699 .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL),
4703 .name = "numa_stat",
4704 .open = mem_control_numa_stat_open,
4708 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP
4710 .name = "memsw.usage_in_bytes",
4711 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE),
4712 .read = mem_cgroup_read,
4713 .register_event = mem_cgroup_usage_register_event,
4714 .unregister_event = mem_cgroup_usage_unregister_event,
4717 .name = "memsw.max_usage_in_bytes",
4718 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE),
4719 .trigger = mem_cgroup_reset,
4720 .read = mem_cgroup_read,
4723 .name = "memsw.limit_in_bytes",
4724 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT),
4725 .write_string = mem_cgroup_write,
4726 .read = mem_cgroup_read,
4729 .name = "memsw.failcnt",
4730 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT),
4731 .trigger = mem_cgroup_reset,
4732 .read = mem_cgroup_read,
4735 { }, /* terminate */
4738 static int alloc_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node)
4740 struct mem_cgroup_per_node *pn;
4741 struct mem_cgroup_per_zone *mz;
4742 int zone, tmp = node;
4744 * This routine is called against possible nodes.
4745 * But it's BUG to call kmalloc() against offline node.
4747 * TODO: this routine can waste much memory for nodes which will
4748 * never be onlined. It's better to use memory hotplug callback
4751 if (!node_state(node, N_NORMAL_MEMORY))
4753 pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp);
4757 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
4758 mz = &pn->zoneinfo[zone];
4759 lruvec_init(&mz->lruvec, &NODE_DATA(node)->node_zones[zone]);
4760 mz->usage_in_excess = 0;
4761 mz->on_tree = false;
4764 memcg->info.nodeinfo[node] = pn;
4768 static void free_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node)
4770 kfree(memcg->info.nodeinfo[node]);
4773 static struct mem_cgroup *mem_cgroup_alloc(void)
4775 struct mem_cgroup *memcg;
4776 int size = sizeof(struct mem_cgroup);
4778 /* Can be very big if MAX_NUMNODES is very big */
4779 if (size < PAGE_SIZE)
4780 memcg = kzalloc(size, GFP_KERNEL);
4782 memcg = vzalloc(size);
4787 memcg->stat = alloc_percpu(struct mem_cgroup_stat_cpu);
4790 spin_lock_init(&memcg->pcp_counter_lock);
4794 if (size < PAGE_SIZE)
4802 * Helpers for freeing a vzalloc()ed mem_cgroup by RCU,
4803 * but in process context. The work_freeing structure is overlaid
4804 * on the rcu_freeing structure, which itself is overlaid on memsw.
4806 static void vfree_work(struct work_struct *work)
4808 struct mem_cgroup *memcg;
4810 memcg = container_of(work, struct mem_cgroup, work_freeing);
4813 static void vfree_rcu(struct rcu_head *rcu_head)
4815 struct mem_cgroup *memcg;
4817 memcg = container_of(rcu_head, struct mem_cgroup, rcu_freeing);
4818 INIT_WORK(&memcg->work_freeing, vfree_work);
4819 schedule_work(&memcg->work_freeing);
4823 * At destroying mem_cgroup, references from swap_cgroup can remain.
4824 * (scanning all at force_empty is too costly...)
4826 * Instead of clearing all references at force_empty, we remember
4827 * the number of reference from swap_cgroup and free mem_cgroup when
4828 * it goes down to 0.
4830 * Removal of cgroup itself succeeds regardless of refs from swap.
4833 static void __mem_cgroup_free(struct mem_cgroup *memcg)
4837 mem_cgroup_remove_from_trees(memcg);
4838 free_css_id(&mem_cgroup_subsys, &memcg->css);
4841 free_mem_cgroup_per_zone_info(memcg, node);
4843 free_percpu(memcg->stat);
4844 if (sizeof(struct mem_cgroup) < PAGE_SIZE)
4845 kfree_rcu(memcg, rcu_freeing);
4847 call_rcu(&memcg->rcu_freeing, vfree_rcu);
4850 static void mem_cgroup_get(struct mem_cgroup *memcg)
4852 atomic_inc(&memcg->refcnt);
4855 static void __mem_cgroup_put(struct mem_cgroup *memcg, int count)
4857 if (atomic_sub_and_test(count, &memcg->refcnt)) {
4858 struct mem_cgroup *parent = parent_mem_cgroup(memcg);
4859 __mem_cgroup_free(memcg);
4861 mem_cgroup_put(parent);
4865 static void mem_cgroup_put(struct mem_cgroup *memcg)
4867 __mem_cgroup_put(memcg, 1);
4871 * Returns the parent mem_cgroup in memcgroup hierarchy with hierarchy enabled.
4873 struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *memcg)
4875 if (!memcg->res.parent)
4877 return mem_cgroup_from_res_counter(memcg->res.parent, res);
4879 EXPORT_SYMBOL(parent_mem_cgroup);
4881 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP
4882 static void __init enable_swap_cgroup(void)
4884 if (!mem_cgroup_disabled() && really_do_swap_account)
4885 do_swap_account = 1;
4888 static void __init enable_swap_cgroup(void)
4893 static int mem_cgroup_soft_limit_tree_init(void)
4895 struct mem_cgroup_tree_per_node *rtpn;
4896 struct mem_cgroup_tree_per_zone *rtpz;
4897 int tmp, node, zone;
4899 for_each_node(node) {
4901 if (!node_state(node, N_NORMAL_MEMORY))
4903 rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL, tmp);
4907 soft_limit_tree.rb_tree_per_node[node] = rtpn;
4909 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
4910 rtpz = &rtpn->rb_tree_per_zone[zone];
4911 rtpz->rb_root = RB_ROOT;
4912 spin_lock_init(&rtpz->lock);
4918 for_each_node(node) {
4919 if (!soft_limit_tree.rb_tree_per_node[node])
4921 kfree(soft_limit_tree.rb_tree_per_node[node]);
4922 soft_limit_tree.rb_tree_per_node[node] = NULL;
4928 static struct cgroup_subsys_state * __ref
4929 mem_cgroup_create(struct cgroup *cont)
4931 struct mem_cgroup *memcg, *parent;
4932 long error = -ENOMEM;
4935 memcg = mem_cgroup_alloc();
4937 return ERR_PTR(error);
4940 if (alloc_mem_cgroup_per_zone_info(memcg, node))
4944 if (cont->parent == NULL) {
4946 enable_swap_cgroup();
4948 if (mem_cgroup_soft_limit_tree_init())
4950 root_mem_cgroup = memcg;
4951 for_each_possible_cpu(cpu) {
4952 struct memcg_stock_pcp *stock =
4953 &per_cpu(memcg_stock, cpu);
4954 INIT_WORK(&stock->work, drain_local_stock);
4956 hotcpu_notifier(memcg_cpu_hotplug_callback, 0);
4958 parent = mem_cgroup_from_cont(cont->parent);
4959 memcg->use_hierarchy = parent->use_hierarchy;
4960 memcg->oom_kill_disable = parent->oom_kill_disable;
4963 if (parent && parent->use_hierarchy) {
4964 res_counter_init(&memcg->res, &parent->res);
4965 res_counter_init(&memcg->memsw, &parent->memsw);
4967 * We increment refcnt of the parent to ensure that we can
4968 * safely access it on res_counter_charge/uncharge.
4969 * This refcnt will be decremented when freeing this
4970 * mem_cgroup(see mem_cgroup_put).
4972 mem_cgroup_get(parent);
4974 res_counter_init(&memcg->res, NULL);
4975 res_counter_init(&memcg->memsw, NULL);
4977 memcg->last_scanned_node = MAX_NUMNODES;
4978 INIT_LIST_HEAD(&memcg->oom_notify);
4981 memcg->swappiness = mem_cgroup_swappiness(parent);
4982 atomic_set(&memcg->refcnt, 1);
4983 memcg->move_charge_at_immigrate = 0;
4984 mutex_init(&memcg->thresholds_lock);
4985 spin_lock_init(&memcg->move_lock);
4987 error = memcg_init_kmem(memcg, &mem_cgroup_subsys);
4990 * We call put now because our (and parent's) refcnts
4991 * are already in place. mem_cgroup_put() will internally
4992 * call __mem_cgroup_free, so return directly
4994 mem_cgroup_put(memcg);
4995 return ERR_PTR(error);
4999 __mem_cgroup_free(memcg);
5000 return ERR_PTR(error);
5003 static int mem_cgroup_pre_destroy(struct cgroup *cont)
5005 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
5007 return mem_cgroup_force_empty(memcg, false);
5010 static void mem_cgroup_destroy(struct cgroup *cont)
5012 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
5014 kmem_cgroup_destroy(memcg);
5016 mem_cgroup_put(memcg);
5020 /* Handlers for move charge at task migration. */
5021 #define PRECHARGE_COUNT_AT_ONCE 256
5022 static int mem_cgroup_do_precharge(unsigned long count)
5025 int batch_count = PRECHARGE_COUNT_AT_ONCE;
5026 struct mem_cgroup *memcg = mc.to;
5028 if (mem_cgroup_is_root(memcg)) {
5029 mc.precharge += count;
5030 /* we don't need css_get for root */
5033 /* try to charge at once */
5035 struct res_counter *dummy;
5037 * "memcg" cannot be under rmdir() because we've already checked
5038 * by cgroup_lock_live_cgroup() that it is not removed and we
5039 * are still under the same cgroup_mutex. So we can postpone
5042 if (res_counter_charge(&memcg->res, PAGE_SIZE * count, &dummy))
5044 if (do_swap_account && res_counter_charge(&memcg->memsw,
5045 PAGE_SIZE * count, &dummy)) {
5046 res_counter_uncharge(&memcg->res, PAGE_SIZE * count);
5049 mc.precharge += count;
5053 /* fall back to one by one charge */
5055 if (signal_pending(current)) {
5059 if (!batch_count--) {
5060 batch_count = PRECHARGE_COUNT_AT_ONCE;
5063 ret = __mem_cgroup_try_charge(NULL,
5064 GFP_KERNEL, 1, &memcg, false);
5066 /* mem_cgroup_clear_mc() will do uncharge later */
5074 * get_mctgt_type - get target type of moving charge
5075 * @vma: the vma the pte to be checked belongs
5076 * @addr: the address corresponding to the pte to be checked
5077 * @ptent: the pte to be checked
5078 * @target: the pointer the target page or swap ent will be stored(can be NULL)
5081 * 0(MC_TARGET_NONE): if the pte is not a target for move charge.
5082 * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for
5083 * move charge. if @target is not NULL, the page is stored in target->page
5084 * with extra refcnt got(Callers should handle it).
5085 * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a
5086 * target for charge migration. if @target is not NULL, the entry is stored
5089 * Called with pte lock held.
5096 enum mc_target_type {
5102 static struct page *mc_handle_present_pte(struct vm_area_struct *vma,
5103 unsigned long addr, pte_t ptent)
5105 struct page *page = vm_normal_page(vma, addr, ptent);
5107 if (!page || !page_mapped(page))
5109 if (PageAnon(page)) {
5110 /* we don't move shared anon */
5113 } else if (!move_file())
5114 /* we ignore mapcount for file pages */
5116 if (!get_page_unless_zero(page))
5123 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
5124 unsigned long addr, pte_t ptent, swp_entry_t *entry)
5126 struct page *page = NULL;
5127 swp_entry_t ent = pte_to_swp_entry(ptent);
5129 if (!move_anon() || non_swap_entry(ent))
5132 * Because lookup_swap_cache() updates some statistics counter,
5133 * we call find_get_page() with swapper_space directly.
5135 page = find_get_page(&swapper_space, ent.val);
5136 if (do_swap_account)
5137 entry->val = ent.val;
5142 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
5143 unsigned long addr, pte_t ptent, swp_entry_t *entry)
5149 static struct page *mc_handle_file_pte(struct vm_area_struct *vma,
5150 unsigned long addr, pte_t ptent, swp_entry_t *entry)
5152 struct page *page = NULL;
5153 struct address_space *mapping;
5156 if (!vma->vm_file) /* anonymous vma */
5161 mapping = vma->vm_file->f_mapping;
5162 if (pte_none(ptent))
5163 pgoff = linear_page_index(vma, addr);
5164 else /* pte_file(ptent) is true */
5165 pgoff = pte_to_pgoff(ptent);
5167 /* page is moved even if it's not RSS of this task(page-faulted). */
5168 page = find_get_page(mapping, pgoff);
5171 /* shmem/tmpfs may report page out on swap: account for that too. */
5172 if (radix_tree_exceptional_entry(page)) {
5173 swp_entry_t swap = radix_to_swp_entry(page);
5174 if (do_swap_account)
5176 page = find_get_page(&swapper_space, swap.val);
5182 static enum mc_target_type get_mctgt_type(struct vm_area_struct *vma,
5183 unsigned long addr, pte_t ptent, union mc_target *target)
5185 struct page *page = NULL;
5186 struct page_cgroup *pc;
5187 enum mc_target_type ret = MC_TARGET_NONE;
5188 swp_entry_t ent = { .val = 0 };
5190 if (pte_present(ptent))
5191 page = mc_handle_present_pte(vma, addr, ptent);
5192 else if (is_swap_pte(ptent))
5193 page = mc_handle_swap_pte(vma, addr, ptent, &ent);
5194 else if (pte_none(ptent) || pte_file(ptent))
5195 page = mc_handle_file_pte(vma, addr, ptent, &ent);
5197 if (!page && !ent.val)
5200 pc = lookup_page_cgroup(page);
5202 * Do only loose check w/o page_cgroup lock.
5203 * mem_cgroup_move_account() checks the pc is valid or not under
5206 if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) {
5207 ret = MC_TARGET_PAGE;
5209 target->page = page;
5211 if (!ret || !target)
5214 /* There is a swap entry and a page doesn't exist or isn't charged */
5215 if (ent.val && !ret &&
5216 css_id(&mc.from->css) == lookup_swap_cgroup_id(ent)) {
5217 ret = MC_TARGET_SWAP;
5224 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5226 * We don't consider swapping or file mapped pages because THP does not
5227 * support them for now.
5228 * Caller should make sure that pmd_trans_huge(pmd) is true.
5230 static enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
5231 unsigned long addr, pmd_t pmd, union mc_target *target)
5233 struct page *page = NULL;
5234 struct page_cgroup *pc;
5235 enum mc_target_type ret = MC_TARGET_NONE;
5237 page = pmd_page(pmd);
5238 VM_BUG_ON(!page || !PageHead(page));
5241 pc = lookup_page_cgroup(page);
5242 if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) {
5243 ret = MC_TARGET_PAGE;
5246 target->page = page;
5252 static inline enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
5253 unsigned long addr, pmd_t pmd, union mc_target *target)
5255 return MC_TARGET_NONE;
5259 static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd,
5260 unsigned long addr, unsigned long end,
5261 struct mm_walk *walk)
5263 struct vm_area_struct *vma = walk->private;
5267 if (pmd_trans_huge_lock(pmd, vma) == 1) {
5268 if (get_mctgt_type_thp(vma, addr, *pmd, NULL) == MC_TARGET_PAGE)
5269 mc.precharge += HPAGE_PMD_NR;
5270 spin_unlock(&vma->vm_mm->page_table_lock);
5274 if (pmd_trans_unstable(pmd))
5276 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
5277 for (; addr != end; pte++, addr += PAGE_SIZE)
5278 if (get_mctgt_type(vma, addr, *pte, NULL))
5279 mc.precharge++; /* increment precharge temporarily */
5280 pte_unmap_unlock(pte - 1, ptl);
5286 static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm)
5288 unsigned long precharge;
5289 struct vm_area_struct *vma;
5291 down_read(&mm->mmap_sem);
5292 for (vma = mm->mmap; vma; vma = vma->vm_next) {
5293 struct mm_walk mem_cgroup_count_precharge_walk = {
5294 .pmd_entry = mem_cgroup_count_precharge_pte_range,
5298 if (is_vm_hugetlb_page(vma))
5300 walk_page_range(vma->vm_start, vma->vm_end,
5301 &mem_cgroup_count_precharge_walk);
5303 up_read(&mm->mmap_sem);
5305 precharge = mc.precharge;
5311 static int mem_cgroup_precharge_mc(struct mm_struct *mm)
5313 unsigned long precharge = mem_cgroup_count_precharge(mm);
5315 VM_BUG_ON(mc.moving_task);
5316 mc.moving_task = current;
5317 return mem_cgroup_do_precharge(precharge);
5320 /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */
5321 static void __mem_cgroup_clear_mc(void)
5323 struct mem_cgroup *from = mc.from;
5324 struct mem_cgroup *to = mc.to;
5326 /* we must uncharge all the leftover precharges from mc.to */
5328 __mem_cgroup_cancel_charge(mc.to, mc.precharge);
5332 * we didn't uncharge from mc.from at mem_cgroup_move_account(), so
5333 * we must uncharge here.
5335 if (mc.moved_charge) {
5336 __mem_cgroup_cancel_charge(mc.from, mc.moved_charge);
5337 mc.moved_charge = 0;
5339 /* we must fixup refcnts and charges */
5340 if (mc.moved_swap) {
5341 /* uncharge swap account from the old cgroup */
5342 if (!mem_cgroup_is_root(mc.from))
5343 res_counter_uncharge(&mc.from->memsw,
5344 PAGE_SIZE * mc.moved_swap);
5345 __mem_cgroup_put(mc.from, mc.moved_swap);
5347 if (!mem_cgroup_is_root(mc.to)) {
5349 * we charged both to->res and to->memsw, so we should
5352 res_counter_uncharge(&mc.to->res,
5353 PAGE_SIZE * mc.moved_swap);
5355 /* we've already done mem_cgroup_get(mc.to) */
5358 memcg_oom_recover(from);
5359 memcg_oom_recover(to);
5360 wake_up_all(&mc.waitq);
5363 static void mem_cgroup_clear_mc(void)
5365 struct mem_cgroup *from = mc.from;
5368 * we must clear moving_task before waking up waiters at the end of
5371 mc.moving_task = NULL;
5372 __mem_cgroup_clear_mc();
5373 spin_lock(&mc.lock);
5376 spin_unlock(&mc.lock);
5377 mem_cgroup_end_move(from);
5380 static int mem_cgroup_can_attach(struct cgroup *cgroup,
5381 struct cgroup_taskset *tset)
5383 struct task_struct *p = cgroup_taskset_first(tset);
5385 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgroup);
5387 if (memcg->move_charge_at_immigrate) {
5388 struct mm_struct *mm;
5389 struct mem_cgroup *from = mem_cgroup_from_task(p);
5391 VM_BUG_ON(from == memcg);
5393 mm = get_task_mm(p);
5396 /* We move charges only when we move a owner of the mm */
5397 if (mm->owner == p) {
5400 VM_BUG_ON(mc.precharge);
5401 VM_BUG_ON(mc.moved_charge);
5402 VM_BUG_ON(mc.moved_swap);
5403 mem_cgroup_start_move(from);
5404 spin_lock(&mc.lock);
5407 spin_unlock(&mc.lock);
5408 /* We set mc.moving_task later */
5410 ret = mem_cgroup_precharge_mc(mm);
5412 mem_cgroup_clear_mc();
5419 static void mem_cgroup_cancel_attach(struct cgroup *cgroup,
5420 struct cgroup_taskset *tset)
5422 mem_cgroup_clear_mc();
5425 static int mem_cgroup_move_charge_pte_range(pmd_t *pmd,
5426 unsigned long addr, unsigned long end,
5427 struct mm_walk *walk)
5430 struct vm_area_struct *vma = walk->private;
5433 enum mc_target_type target_type;
5434 union mc_target target;
5436 struct page_cgroup *pc;
5439 * We don't take compound_lock() here but no race with splitting thp
5441 * - if pmd_trans_huge_lock() returns 1, the relevant thp is not
5442 * under splitting, which means there's no concurrent thp split,
5443 * - if another thread runs into split_huge_page() just after we
5444 * entered this if-block, the thread must wait for page table lock
5445 * to be unlocked in __split_huge_page_splitting(), where the main
5446 * part of thp split is not executed yet.
5448 if (pmd_trans_huge_lock(pmd, vma) == 1) {
5449 if (mc.precharge < HPAGE_PMD_NR) {
5450 spin_unlock(&vma->vm_mm->page_table_lock);
5453 target_type = get_mctgt_type_thp(vma, addr, *pmd, &target);
5454 if (target_type == MC_TARGET_PAGE) {
5456 if (!isolate_lru_page(page)) {
5457 pc = lookup_page_cgroup(page);
5458 if (!mem_cgroup_move_account(page, HPAGE_PMD_NR,
5461 mc.precharge -= HPAGE_PMD_NR;
5462 mc.moved_charge += HPAGE_PMD_NR;
5464 putback_lru_page(page);
5468 spin_unlock(&vma->vm_mm->page_table_lock);
5472 if (pmd_trans_unstable(pmd))
5475 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
5476 for (; addr != end; addr += PAGE_SIZE) {
5477 pte_t ptent = *(pte++);
5483 switch (get_mctgt_type(vma, addr, ptent, &target)) {
5484 case MC_TARGET_PAGE:
5486 if (isolate_lru_page(page))
5488 pc = lookup_page_cgroup(page);
5489 if (!mem_cgroup_move_account(page, 1, pc,
5490 mc.from, mc.to, false)) {
5492 /* we uncharge from mc.from later. */
5495 putback_lru_page(page);
5496 put: /* get_mctgt_type() gets the page */
5499 case MC_TARGET_SWAP:
5501 if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to)) {
5503 /* we fixup refcnts and charges later. */
5511 pte_unmap_unlock(pte - 1, ptl);
5516 * We have consumed all precharges we got in can_attach().
5517 * We try charge one by one, but don't do any additional
5518 * charges to mc.to if we have failed in charge once in attach()
5521 ret = mem_cgroup_do_precharge(1);
5529 static void mem_cgroup_move_charge(struct mm_struct *mm)
5531 struct vm_area_struct *vma;
5533 lru_add_drain_all();
5535 if (unlikely(!down_read_trylock(&mm->mmap_sem))) {
5537 * Someone who are holding the mmap_sem might be waiting in
5538 * waitq. So we cancel all extra charges, wake up all waiters,
5539 * and retry. Because we cancel precharges, we might not be able
5540 * to move enough charges, but moving charge is a best-effort
5541 * feature anyway, so it wouldn't be a big problem.
5543 __mem_cgroup_clear_mc();
5547 for (vma = mm->mmap; vma; vma = vma->vm_next) {
5549 struct mm_walk mem_cgroup_move_charge_walk = {
5550 .pmd_entry = mem_cgroup_move_charge_pte_range,
5554 if (is_vm_hugetlb_page(vma))
5556 ret = walk_page_range(vma->vm_start, vma->vm_end,
5557 &mem_cgroup_move_charge_walk);
5560 * means we have consumed all precharges and failed in
5561 * doing additional charge. Just abandon here.
5565 up_read(&mm->mmap_sem);
5568 static void mem_cgroup_move_task(struct cgroup *cont,
5569 struct cgroup_taskset *tset)
5571 struct task_struct *p = cgroup_taskset_first(tset);
5572 struct mm_struct *mm = get_task_mm(p);
5576 mem_cgroup_move_charge(mm);
5580 mem_cgroup_clear_mc();
5582 #else /* !CONFIG_MMU */
5583 static int mem_cgroup_can_attach(struct cgroup *cgroup,
5584 struct cgroup_taskset *tset)
5588 static void mem_cgroup_cancel_attach(struct cgroup *cgroup,
5589 struct cgroup_taskset *tset)
5592 static void mem_cgroup_move_task(struct cgroup *cont,
5593 struct cgroup_taskset *tset)
5598 struct cgroup_subsys mem_cgroup_subsys = {
5600 .subsys_id = mem_cgroup_subsys_id,
5601 .create = mem_cgroup_create,
5602 .pre_destroy = mem_cgroup_pre_destroy,
5603 .destroy = mem_cgroup_destroy,
5604 .can_attach = mem_cgroup_can_attach,
5605 .cancel_attach = mem_cgroup_cancel_attach,
5606 .attach = mem_cgroup_move_task,
5607 .base_cftypes = mem_cgroup_files,
5610 .__DEPRECATED_clear_css_refs = true,
5613 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP
5614 static int __init enable_swap_account(char *s)
5616 /* consider enabled if no parameter or 1 is given */
5617 if (!strcmp(s, "1"))
5618 really_do_swap_account = 1;
5619 else if (!strcmp(s, "0"))
5620 really_do_swap_account = 0;
5623 __setup("swapaccount=", enable_swap_account);