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 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_ON_MOVE, /* someone is moving account between groups */
93 MEM_CGROUP_STAT_NSTATS,
96 enum mem_cgroup_events_index {
97 MEM_CGROUP_EVENTS_PGPGIN, /* # of pages paged in */
98 MEM_CGROUP_EVENTS_PGPGOUT, /* # of pages paged out */
99 MEM_CGROUP_EVENTS_COUNT, /* # of pages paged in/out */
100 MEM_CGROUP_EVENTS_PGFAULT, /* # of page-faults */
101 MEM_CGROUP_EVENTS_PGMAJFAULT, /* # of major page-faults */
102 MEM_CGROUP_EVENTS_NSTATS,
105 * Per memcg event counter is incremented at every pagein/pageout. With THP,
106 * it will be incremated by the number of pages. This counter is used for
107 * for trigger some periodic events. This is straightforward and better
108 * than using jiffies etc. to handle periodic memcg event.
110 enum mem_cgroup_events_target {
111 MEM_CGROUP_TARGET_THRESH,
112 MEM_CGROUP_TARGET_SOFTLIMIT,
113 MEM_CGROUP_TARGET_NUMAINFO,
116 #define THRESHOLDS_EVENTS_TARGET (128)
117 #define SOFTLIMIT_EVENTS_TARGET (1024)
118 #define NUMAINFO_EVENTS_TARGET (1024)
120 struct mem_cgroup_stat_cpu {
121 long count[MEM_CGROUP_STAT_NSTATS];
122 unsigned long events[MEM_CGROUP_EVENTS_NSTATS];
123 unsigned long targets[MEM_CGROUP_NTARGETS];
126 struct mem_cgroup_reclaim_iter {
127 /* css_id of the last scanned hierarchy member */
129 /* scan generation, increased every round-trip */
130 unsigned int generation;
134 * per-zone information in memory controller.
136 struct mem_cgroup_per_zone {
137 struct lruvec lruvec;
138 unsigned long lru_size[NR_LRU_LISTS];
140 struct mem_cgroup_reclaim_iter reclaim_iter[DEF_PRIORITY + 1];
142 struct zone_reclaim_stat reclaim_stat;
143 struct rb_node tree_node; /* RB tree node */
144 unsigned long long usage_in_excess;/* Set to the value by which */
145 /* the soft limit is exceeded*/
147 struct mem_cgroup *memcg; /* Back pointer, we cannot */
148 /* use container_of */
151 struct mem_cgroup_per_node {
152 struct mem_cgroup_per_zone zoneinfo[MAX_NR_ZONES];
155 struct mem_cgroup_lru_info {
156 struct mem_cgroup_per_node *nodeinfo[MAX_NUMNODES];
160 * Cgroups above their limits are maintained in a RB-Tree, independent of
161 * their hierarchy representation
164 struct mem_cgroup_tree_per_zone {
165 struct rb_root rb_root;
169 struct mem_cgroup_tree_per_node {
170 struct mem_cgroup_tree_per_zone rb_tree_per_zone[MAX_NR_ZONES];
173 struct mem_cgroup_tree {
174 struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES];
177 static struct mem_cgroup_tree soft_limit_tree __read_mostly;
179 struct mem_cgroup_threshold {
180 struct eventfd_ctx *eventfd;
185 struct mem_cgroup_threshold_ary {
186 /* An array index points to threshold just below usage. */
187 int current_threshold;
188 /* Size of entries[] */
190 /* Array of thresholds */
191 struct mem_cgroup_threshold entries[0];
194 struct mem_cgroup_thresholds {
195 /* Primary thresholds array */
196 struct mem_cgroup_threshold_ary *primary;
198 * Spare threshold array.
199 * This is needed to make mem_cgroup_unregister_event() "never fail".
200 * It must be able to store at least primary->size - 1 entries.
202 struct mem_cgroup_threshold_ary *spare;
206 struct mem_cgroup_eventfd_list {
207 struct list_head list;
208 struct eventfd_ctx *eventfd;
211 static void mem_cgroup_threshold(struct mem_cgroup *memcg);
212 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg);
215 * The memory controller data structure. The memory controller controls both
216 * page cache and RSS per cgroup. We would eventually like to provide
217 * statistics based on the statistics developed by Rik Van Riel for clock-pro,
218 * to help the administrator determine what knobs to tune.
220 * TODO: Add a water mark for the memory controller. Reclaim will begin when
221 * we hit the water mark. May be even add a low water mark, such that
222 * no reclaim occurs from a cgroup at it's low water mark, this is
223 * a feature that will be implemented much later in the future.
226 struct cgroup_subsys_state css;
228 * the counter to account for memory usage
230 struct res_counter res;
234 * the counter to account for mem+swap usage.
236 struct res_counter memsw;
239 * rcu_freeing is used only when freeing struct mem_cgroup,
240 * so put it into a union to avoid wasting more memory.
241 * It must be disjoint from the css field. It could be
242 * in a union with the res field, but res plays a much
243 * larger part in mem_cgroup life than memsw, and might
244 * be of interest, even at time of free, when debugging.
245 * So share rcu_head with the less interesting memsw.
247 struct rcu_head rcu_freeing;
249 * But when using vfree(), that cannot be done at
250 * interrupt time, so we must then queue the work.
252 struct work_struct work_freeing;
256 * Per cgroup active and inactive list, similar to the
257 * per zone LRU lists.
259 struct mem_cgroup_lru_info info;
260 int last_scanned_node;
262 nodemask_t scan_nodes;
263 atomic_t numainfo_events;
264 atomic_t numainfo_updating;
267 * Should the accounting and control be hierarchical, per subtree?
277 /* OOM-Killer disable */
278 int oom_kill_disable;
280 /* set when res.limit == memsw.limit */
281 bool memsw_is_minimum;
283 /* protect arrays of thresholds */
284 struct mutex thresholds_lock;
286 /* thresholds for memory usage. RCU-protected */
287 struct mem_cgroup_thresholds thresholds;
289 /* thresholds for mem+swap usage. RCU-protected */
290 struct mem_cgroup_thresholds memsw_thresholds;
292 /* For oom notifier event fd */
293 struct list_head oom_notify;
296 * Should we move charges of a task when a task is moved into this
297 * mem_cgroup ? And what type of charges should we move ?
299 unsigned long move_charge_at_immigrate;
303 struct mem_cgroup_stat_cpu *stat;
305 * used when a cpu is offlined or other synchronizations
306 * See mem_cgroup_read_stat().
308 struct mem_cgroup_stat_cpu nocpu_base;
309 spinlock_t pcp_counter_lock;
312 struct tcp_memcontrol tcp_mem;
316 /* Stuffs for move charges at task migration. */
318 * Types of charges to be moved. "move_charge_at_immitgrate" is treated as a
319 * left-shifted bitmap of these types.
322 MOVE_CHARGE_TYPE_ANON, /* private anonymous page and swap of it */
323 MOVE_CHARGE_TYPE_FILE, /* file page(including tmpfs) and swap of it */
327 /* "mc" and its members are protected by cgroup_mutex */
328 static struct move_charge_struct {
329 spinlock_t lock; /* for from, to */
330 struct mem_cgroup *from;
331 struct mem_cgroup *to;
332 unsigned long precharge;
333 unsigned long moved_charge;
334 unsigned long moved_swap;
335 struct task_struct *moving_task; /* a task moving charges */
336 wait_queue_head_t waitq; /* a waitq for other context */
338 .lock = __SPIN_LOCK_UNLOCKED(mc.lock),
339 .waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq),
342 static bool move_anon(void)
344 return test_bit(MOVE_CHARGE_TYPE_ANON,
345 &mc.to->move_charge_at_immigrate);
348 static bool move_file(void)
350 return test_bit(MOVE_CHARGE_TYPE_FILE,
351 &mc.to->move_charge_at_immigrate);
355 * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft
356 * limit reclaim to prevent infinite loops, if they ever occur.
358 #define MEM_CGROUP_MAX_RECLAIM_LOOPS (100)
359 #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS (2)
362 MEM_CGROUP_CHARGE_TYPE_CACHE = 0,
363 MEM_CGROUP_CHARGE_TYPE_MAPPED,
364 MEM_CGROUP_CHARGE_TYPE_SHMEM, /* used by page migration of shmem */
365 MEM_CGROUP_CHARGE_TYPE_FORCE, /* used by force_empty */
366 MEM_CGROUP_CHARGE_TYPE_SWAPOUT, /* for accounting swapcache */
367 MEM_CGROUP_CHARGE_TYPE_DROP, /* a page was unused swap cache */
371 /* for encoding cft->private value on file */
374 #define _OOM_TYPE (2)
375 #define MEMFILE_PRIVATE(x, val) (((x) << 16) | (val))
376 #define MEMFILE_TYPE(val) (((val) >> 16) & 0xffff)
377 #define MEMFILE_ATTR(val) ((val) & 0xffff)
378 /* Used for OOM nofiier */
379 #define OOM_CONTROL (0)
382 * Reclaim flags for mem_cgroup_hierarchical_reclaim
384 #define MEM_CGROUP_RECLAIM_NOSWAP_BIT 0x0
385 #define MEM_CGROUP_RECLAIM_NOSWAP (1 << MEM_CGROUP_RECLAIM_NOSWAP_BIT)
386 #define MEM_CGROUP_RECLAIM_SHRINK_BIT 0x1
387 #define MEM_CGROUP_RECLAIM_SHRINK (1 << MEM_CGROUP_RECLAIM_SHRINK_BIT)
389 static void mem_cgroup_get(struct mem_cgroup *memcg);
390 static void mem_cgroup_put(struct mem_cgroup *memcg);
392 /* Writing them here to avoid exposing memcg's inner layout */
393 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_KMEM
394 #include <net/sock.h>
397 static bool mem_cgroup_is_root(struct mem_cgroup *memcg);
398 void sock_update_memcg(struct sock *sk)
400 if (mem_cgroup_sockets_enabled) {
401 struct mem_cgroup *memcg;
403 BUG_ON(!sk->sk_prot->proto_cgroup);
405 /* Socket cloning can throw us here with sk_cgrp already
406 * filled. It won't however, necessarily happen from
407 * process context. So the test for root memcg given
408 * the current task's memcg won't help us in this case.
410 * Respecting the original socket's memcg is a better
411 * decision in this case.
414 BUG_ON(mem_cgroup_is_root(sk->sk_cgrp->memcg));
415 mem_cgroup_get(sk->sk_cgrp->memcg);
420 memcg = mem_cgroup_from_task(current);
421 if (!mem_cgroup_is_root(memcg)) {
422 mem_cgroup_get(memcg);
423 sk->sk_cgrp = sk->sk_prot->proto_cgroup(memcg);
428 EXPORT_SYMBOL(sock_update_memcg);
430 void sock_release_memcg(struct sock *sk)
432 if (mem_cgroup_sockets_enabled && sk->sk_cgrp) {
433 struct mem_cgroup *memcg;
434 WARN_ON(!sk->sk_cgrp->memcg);
435 memcg = sk->sk_cgrp->memcg;
436 mem_cgroup_put(memcg);
441 struct cg_proto *tcp_proto_cgroup(struct mem_cgroup *memcg)
443 if (!memcg || mem_cgroup_is_root(memcg))
446 return &memcg->tcp_mem.cg_proto;
448 EXPORT_SYMBOL(tcp_proto_cgroup);
449 #endif /* CONFIG_INET */
450 #endif /* CONFIG_CGROUP_MEM_RES_CTLR_KMEM */
452 static void drain_all_stock_async(struct mem_cgroup *memcg);
454 static struct mem_cgroup_per_zone *
455 mem_cgroup_zoneinfo(struct mem_cgroup *memcg, int nid, int zid)
457 return &memcg->info.nodeinfo[nid]->zoneinfo[zid];
460 struct cgroup_subsys_state *mem_cgroup_css(struct mem_cgroup *memcg)
465 static struct mem_cgroup_per_zone *
466 page_cgroup_zoneinfo(struct mem_cgroup *memcg, struct page *page)
468 int nid = page_to_nid(page);
469 int zid = page_zonenum(page);
471 return mem_cgroup_zoneinfo(memcg, nid, zid);
474 static struct mem_cgroup_tree_per_zone *
475 soft_limit_tree_node_zone(int nid, int zid)
477 return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid];
480 static struct mem_cgroup_tree_per_zone *
481 soft_limit_tree_from_page(struct page *page)
483 int nid = page_to_nid(page);
484 int zid = page_zonenum(page);
486 return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid];
490 __mem_cgroup_insert_exceeded(struct mem_cgroup *memcg,
491 struct mem_cgroup_per_zone *mz,
492 struct mem_cgroup_tree_per_zone *mctz,
493 unsigned long long new_usage_in_excess)
495 struct rb_node **p = &mctz->rb_root.rb_node;
496 struct rb_node *parent = NULL;
497 struct mem_cgroup_per_zone *mz_node;
502 mz->usage_in_excess = new_usage_in_excess;
503 if (!mz->usage_in_excess)
507 mz_node = rb_entry(parent, struct mem_cgroup_per_zone,
509 if (mz->usage_in_excess < mz_node->usage_in_excess)
512 * We can't avoid mem cgroups that are over their soft
513 * limit by the same amount
515 else if (mz->usage_in_excess >= mz_node->usage_in_excess)
518 rb_link_node(&mz->tree_node, parent, p);
519 rb_insert_color(&mz->tree_node, &mctz->rb_root);
524 __mem_cgroup_remove_exceeded(struct mem_cgroup *memcg,
525 struct mem_cgroup_per_zone *mz,
526 struct mem_cgroup_tree_per_zone *mctz)
530 rb_erase(&mz->tree_node, &mctz->rb_root);
535 mem_cgroup_remove_exceeded(struct mem_cgroup *memcg,
536 struct mem_cgroup_per_zone *mz,
537 struct mem_cgroup_tree_per_zone *mctz)
539 spin_lock(&mctz->lock);
540 __mem_cgroup_remove_exceeded(memcg, mz, mctz);
541 spin_unlock(&mctz->lock);
545 static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page)
547 unsigned long long excess;
548 struct mem_cgroup_per_zone *mz;
549 struct mem_cgroup_tree_per_zone *mctz;
550 int nid = page_to_nid(page);
551 int zid = page_zonenum(page);
552 mctz = soft_limit_tree_from_page(page);
555 * Necessary to update all ancestors when hierarchy is used.
556 * because their event counter is not touched.
558 for (; memcg; memcg = parent_mem_cgroup(memcg)) {
559 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
560 excess = res_counter_soft_limit_excess(&memcg->res);
562 * We have to update the tree if mz is on RB-tree or
563 * mem is over its softlimit.
565 if (excess || mz->on_tree) {
566 spin_lock(&mctz->lock);
567 /* if on-tree, remove it */
569 __mem_cgroup_remove_exceeded(memcg, mz, mctz);
571 * Insert again. mz->usage_in_excess will be updated.
572 * If excess is 0, no tree ops.
574 __mem_cgroup_insert_exceeded(memcg, mz, mctz, excess);
575 spin_unlock(&mctz->lock);
580 static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg)
583 struct mem_cgroup_per_zone *mz;
584 struct mem_cgroup_tree_per_zone *mctz;
586 for_each_node(node) {
587 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
588 mz = mem_cgroup_zoneinfo(memcg, node, zone);
589 mctz = soft_limit_tree_node_zone(node, zone);
590 mem_cgroup_remove_exceeded(memcg, mz, mctz);
595 static struct mem_cgroup_per_zone *
596 __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz)
598 struct rb_node *rightmost = NULL;
599 struct mem_cgroup_per_zone *mz;
603 rightmost = rb_last(&mctz->rb_root);
605 goto done; /* Nothing to reclaim from */
607 mz = rb_entry(rightmost, struct mem_cgroup_per_zone, tree_node);
609 * Remove the node now but someone else can add it back,
610 * we will to add it back at the end of reclaim to its correct
611 * position in the tree.
613 __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz);
614 if (!res_counter_soft_limit_excess(&mz->memcg->res) ||
615 !css_tryget(&mz->memcg->css))
621 static struct mem_cgroup_per_zone *
622 mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz)
624 struct mem_cgroup_per_zone *mz;
626 spin_lock(&mctz->lock);
627 mz = __mem_cgroup_largest_soft_limit_node(mctz);
628 spin_unlock(&mctz->lock);
633 * Implementation Note: reading percpu statistics for memcg.
635 * Both of vmstat[] and percpu_counter has threshold and do periodic
636 * synchronization to implement "quick" read. There are trade-off between
637 * reading cost and precision of value. Then, we may have a chance to implement
638 * a periodic synchronizion of counter in memcg's counter.
640 * But this _read() function is used for user interface now. The user accounts
641 * memory usage by memory cgroup and he _always_ requires exact value because
642 * he accounts memory. Even if we provide quick-and-fuzzy read, we always
643 * have to visit all online cpus and make sum. So, for now, unnecessary
644 * synchronization is not implemented. (just implemented for cpu hotplug)
646 * If there are kernel internal actions which can make use of some not-exact
647 * value, and reading all cpu value can be performance bottleneck in some
648 * common workload, threashold and synchonization as vmstat[] should be
651 static long mem_cgroup_read_stat(struct mem_cgroup *memcg,
652 enum mem_cgroup_stat_index idx)
658 for_each_online_cpu(cpu)
659 val += per_cpu(memcg->stat->count[idx], cpu);
660 #ifdef CONFIG_HOTPLUG_CPU
661 spin_lock(&memcg->pcp_counter_lock);
662 val += memcg->nocpu_base.count[idx];
663 spin_unlock(&memcg->pcp_counter_lock);
669 static void mem_cgroup_swap_statistics(struct mem_cgroup *memcg,
672 int val = (charge) ? 1 : -1;
673 this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_SWAPOUT], val);
676 static unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg,
677 enum mem_cgroup_events_index idx)
679 unsigned long val = 0;
682 for_each_online_cpu(cpu)
683 val += per_cpu(memcg->stat->events[idx], cpu);
684 #ifdef CONFIG_HOTPLUG_CPU
685 spin_lock(&memcg->pcp_counter_lock);
686 val += memcg->nocpu_base.events[idx];
687 spin_unlock(&memcg->pcp_counter_lock);
692 static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg,
693 bool file, int nr_pages)
698 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_CACHE],
701 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_RSS],
704 /* pagein of a big page is an event. So, ignore page size */
706 __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGIN]);
708 __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGOUT]);
709 nr_pages = -nr_pages; /* for event */
712 __this_cpu_add(memcg->stat->events[MEM_CGROUP_EVENTS_COUNT], nr_pages);
718 mem_cgroup_zone_nr_lru_pages(struct mem_cgroup *memcg, int nid, int zid,
719 unsigned int lru_mask)
721 struct mem_cgroup_per_zone *mz;
723 unsigned long ret = 0;
725 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
728 if (BIT(l) & lru_mask)
729 ret += mz->lru_size[l];
735 mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg,
736 int nid, unsigned int lru_mask)
741 for (zid = 0; zid < MAX_NR_ZONES; zid++)
742 total += mem_cgroup_zone_nr_lru_pages(memcg,
748 static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg,
749 unsigned int lru_mask)
754 for_each_node_state(nid, N_HIGH_MEMORY)
755 total += mem_cgroup_node_nr_lru_pages(memcg, nid, lru_mask);
759 static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg,
760 enum mem_cgroup_events_target target)
762 unsigned long val, next;
764 val = __this_cpu_read(memcg->stat->events[MEM_CGROUP_EVENTS_COUNT]);
765 next = __this_cpu_read(memcg->stat->targets[target]);
766 /* from time_after() in jiffies.h */
767 if ((long)next - (long)val < 0) {
769 case MEM_CGROUP_TARGET_THRESH:
770 next = val + THRESHOLDS_EVENTS_TARGET;
772 case MEM_CGROUP_TARGET_SOFTLIMIT:
773 next = val + SOFTLIMIT_EVENTS_TARGET;
775 case MEM_CGROUP_TARGET_NUMAINFO:
776 next = val + NUMAINFO_EVENTS_TARGET;
781 __this_cpu_write(memcg->stat->targets[target], next);
788 * Check events in order.
791 static void memcg_check_events(struct mem_cgroup *memcg, struct page *page)
794 /* threshold event is triggered in finer grain than soft limit */
795 if (unlikely(mem_cgroup_event_ratelimit(memcg,
796 MEM_CGROUP_TARGET_THRESH))) {
798 bool do_numainfo __maybe_unused;
800 do_softlimit = mem_cgroup_event_ratelimit(memcg,
801 MEM_CGROUP_TARGET_SOFTLIMIT);
803 do_numainfo = mem_cgroup_event_ratelimit(memcg,
804 MEM_CGROUP_TARGET_NUMAINFO);
808 mem_cgroup_threshold(memcg);
809 if (unlikely(do_softlimit))
810 mem_cgroup_update_tree(memcg, page);
812 if (unlikely(do_numainfo))
813 atomic_inc(&memcg->numainfo_events);
819 struct mem_cgroup *mem_cgroup_from_cont(struct cgroup *cont)
821 return container_of(cgroup_subsys_state(cont,
822 mem_cgroup_subsys_id), struct mem_cgroup,
826 struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p)
829 * mm_update_next_owner() may clear mm->owner to NULL
830 * if it races with swapoff, page migration, etc.
831 * So this can be called with p == NULL.
836 return container_of(task_subsys_state(p, mem_cgroup_subsys_id),
837 struct mem_cgroup, css);
840 struct mem_cgroup *try_get_mem_cgroup_from_mm(struct mm_struct *mm)
842 struct mem_cgroup *memcg = NULL;
847 * Because we have no locks, mm->owner's may be being moved to other
848 * cgroup. We use css_tryget() here even if this looks
849 * pessimistic (rather than adding locks here).
853 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
854 if (unlikely(!memcg))
856 } while (!css_tryget(&memcg->css));
862 * mem_cgroup_iter - iterate over memory cgroup hierarchy
863 * @root: hierarchy root
864 * @prev: previously returned memcg, NULL on first invocation
865 * @reclaim: cookie for shared reclaim walks, NULL for full walks
867 * Returns references to children of the hierarchy below @root, or
868 * @root itself, or %NULL after a full round-trip.
870 * Caller must pass the return value in @prev on subsequent
871 * invocations for reference counting, or use mem_cgroup_iter_break()
872 * to cancel a hierarchy walk before the round-trip is complete.
874 * Reclaimers can specify a zone and a priority level in @reclaim to
875 * divide up the memcgs in the hierarchy among all concurrent
876 * reclaimers operating on the same zone and priority.
878 struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root,
879 struct mem_cgroup *prev,
880 struct mem_cgroup_reclaim_cookie *reclaim)
882 struct mem_cgroup *memcg = NULL;
885 if (mem_cgroup_disabled())
889 root = root_mem_cgroup;
891 if (prev && !reclaim)
892 id = css_id(&prev->css);
894 if (prev && prev != root)
897 if (!root->use_hierarchy && root != root_mem_cgroup) {
904 struct mem_cgroup_reclaim_iter *uninitialized_var(iter);
905 struct cgroup_subsys_state *css;
908 int nid = zone_to_nid(reclaim->zone);
909 int zid = zone_idx(reclaim->zone);
910 struct mem_cgroup_per_zone *mz;
912 mz = mem_cgroup_zoneinfo(root, nid, zid);
913 iter = &mz->reclaim_iter[reclaim->priority];
914 if (prev && reclaim->generation != iter->generation)
920 css = css_get_next(&mem_cgroup_subsys, id + 1, &root->css, &id);
922 if (css == &root->css || css_tryget(css))
923 memcg = container_of(css,
924 struct mem_cgroup, css);
933 else if (!prev && memcg)
934 reclaim->generation = iter->generation;
944 * mem_cgroup_iter_break - abort a hierarchy walk prematurely
945 * @root: hierarchy root
946 * @prev: last visited hierarchy member as returned by mem_cgroup_iter()
948 void mem_cgroup_iter_break(struct mem_cgroup *root,
949 struct mem_cgroup *prev)
952 root = root_mem_cgroup;
953 if (prev && prev != root)
958 * Iteration constructs for visiting all cgroups (under a tree). If
959 * loops are exited prematurely (break), mem_cgroup_iter_break() must
960 * be used for reference counting.
962 #define for_each_mem_cgroup_tree(iter, root) \
963 for (iter = mem_cgroup_iter(root, NULL, NULL); \
965 iter = mem_cgroup_iter(root, iter, NULL))
967 #define for_each_mem_cgroup(iter) \
968 for (iter = mem_cgroup_iter(NULL, NULL, NULL); \
970 iter = mem_cgroup_iter(NULL, iter, NULL))
972 static inline bool mem_cgroup_is_root(struct mem_cgroup *memcg)
974 return (memcg == root_mem_cgroup);
977 void mem_cgroup_count_vm_event(struct mm_struct *mm, enum vm_event_item idx)
979 struct mem_cgroup *memcg;
985 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
986 if (unlikely(!memcg))
991 this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGFAULT]);
994 this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGMAJFAULT]);
1002 EXPORT_SYMBOL(mem_cgroup_count_vm_event);
1005 * mem_cgroup_zone_lruvec - get the lru list vector for a zone and memcg
1006 * @zone: zone of the wanted lruvec
1007 * @mem: memcg of the wanted lruvec
1009 * Returns the lru list vector holding pages for the given @zone and
1010 * @mem. This can be the global zone lruvec, if the memory controller
1013 struct lruvec *mem_cgroup_zone_lruvec(struct zone *zone,
1014 struct mem_cgroup *memcg)
1016 struct mem_cgroup_per_zone *mz;
1018 if (mem_cgroup_disabled())
1019 return &zone->lruvec;
1021 mz = mem_cgroup_zoneinfo(memcg, zone_to_nid(zone), zone_idx(zone));
1026 * Following LRU functions are allowed to be used without PCG_LOCK.
1027 * Operations are called by routine of global LRU independently from memcg.
1028 * What we have to take care of here is validness of pc->mem_cgroup.
1030 * Changes to pc->mem_cgroup happens when
1033 * In typical case, "charge" is done before add-to-lru. Exception is SwapCache.
1034 * It is added to LRU before charge.
1035 * If PCG_USED bit is not set, page_cgroup is not added to this private LRU.
1036 * When moving account, the page is not on LRU. It's isolated.
1040 * mem_cgroup_lru_add_list - account for adding an lru page and return lruvec
1041 * @zone: zone of the page
1045 * This function accounts for @page being added to @lru, and returns
1046 * the lruvec for the given @zone and the memcg @page is charged to.
1048 * The callsite is then responsible for physically linking the page to
1049 * the returned lruvec->lists[@lru].
1051 struct lruvec *mem_cgroup_lru_add_list(struct zone *zone, struct page *page,
1054 struct mem_cgroup_per_zone *mz;
1055 struct mem_cgroup *memcg;
1056 struct page_cgroup *pc;
1058 if (mem_cgroup_disabled())
1059 return &zone->lruvec;
1061 pc = lookup_page_cgroup(page);
1062 memcg = pc->mem_cgroup;
1065 * Surreptitiously switch any uncharged page to root:
1066 * an uncharged page off lru does nothing to secure
1067 * its former mem_cgroup from sudden removal.
1069 * Our caller holds lru_lock, and PageCgroupUsed is updated
1070 * under page_cgroup lock: between them, they make all uses
1071 * of pc->mem_cgroup safe.
1073 if (!PageCgroupUsed(pc) && memcg != root_mem_cgroup)
1074 pc->mem_cgroup = memcg = root_mem_cgroup;
1076 mz = page_cgroup_zoneinfo(memcg, page);
1077 /* compound_order() is stabilized through lru_lock */
1078 mz->lru_size[lru] += 1 << compound_order(page);
1083 * mem_cgroup_lru_del_list - account for removing an lru page
1087 * This function accounts for @page being removed from @lru.
1089 * The callsite is then responsible for physically unlinking
1092 void mem_cgroup_lru_del_list(struct page *page, enum lru_list lru)
1094 struct mem_cgroup_per_zone *mz;
1095 struct mem_cgroup *memcg;
1096 struct page_cgroup *pc;
1098 if (mem_cgroup_disabled())
1101 pc = lookup_page_cgroup(page);
1102 memcg = pc->mem_cgroup;
1104 mz = page_cgroup_zoneinfo(memcg, page);
1105 /* huge page split is done under lru_lock. so, we have no races. */
1106 VM_BUG_ON(mz->lru_size[lru] < (1 << compound_order(page)));
1107 mz->lru_size[lru] -= 1 << compound_order(page);
1110 void mem_cgroup_lru_del(struct page *page)
1112 mem_cgroup_lru_del_list(page, page_lru(page));
1116 * mem_cgroup_lru_move_lists - account for moving a page between lrus
1117 * @zone: zone of the page
1119 * @from: current lru
1122 * This function accounts for @page being moved between the lrus @from
1123 * and @to, and returns the lruvec for the given @zone and the memcg
1124 * @page is charged to.
1126 * The callsite is then responsible for physically relinking
1127 * @page->lru to the returned lruvec->lists[@to].
1129 struct lruvec *mem_cgroup_lru_move_lists(struct zone *zone,
1134 /* XXX: Optimize this, especially for @from == @to */
1135 mem_cgroup_lru_del_list(page, from);
1136 return mem_cgroup_lru_add_list(zone, page, to);
1140 * Checks whether given mem is same or in the root_mem_cgroup's
1143 static bool mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg,
1144 struct mem_cgroup *memcg)
1146 if (root_memcg != memcg) {
1147 return (root_memcg->use_hierarchy &&
1148 css_is_ancestor(&memcg->css, &root_memcg->css));
1154 int task_in_mem_cgroup(struct task_struct *task, const struct mem_cgroup *memcg)
1157 struct mem_cgroup *curr = NULL;
1158 struct task_struct *p;
1160 p = find_lock_task_mm(task);
1162 curr = try_get_mem_cgroup_from_mm(p->mm);
1166 * All threads may have already detached their mm's, but the oom
1167 * killer still needs to detect if they have already been oom
1168 * killed to prevent needlessly killing additional tasks.
1171 curr = mem_cgroup_from_task(task);
1173 css_get(&curr->css);
1179 * We should check use_hierarchy of "memcg" not "curr". Because checking
1180 * use_hierarchy of "curr" here make this function true if hierarchy is
1181 * enabled in "curr" and "curr" is a child of "memcg" in *cgroup*
1182 * hierarchy(even if use_hierarchy is disabled in "memcg").
1184 ret = mem_cgroup_same_or_subtree(memcg, curr);
1185 css_put(&curr->css);
1189 int mem_cgroup_inactive_anon_is_low(struct mem_cgroup *memcg, struct zone *zone)
1191 unsigned long inactive_ratio;
1192 int nid = zone_to_nid(zone);
1193 int zid = zone_idx(zone);
1194 unsigned long inactive;
1195 unsigned long active;
1198 inactive = mem_cgroup_zone_nr_lru_pages(memcg, nid, zid,
1199 BIT(LRU_INACTIVE_ANON));
1200 active = mem_cgroup_zone_nr_lru_pages(memcg, nid, zid,
1201 BIT(LRU_ACTIVE_ANON));
1203 gb = (inactive + active) >> (30 - PAGE_SHIFT);
1205 inactive_ratio = int_sqrt(10 * gb);
1209 return inactive * inactive_ratio < active;
1212 int mem_cgroup_inactive_file_is_low(struct mem_cgroup *memcg, struct zone *zone)
1214 unsigned long active;
1215 unsigned long inactive;
1216 int zid = zone_idx(zone);
1217 int nid = zone_to_nid(zone);
1219 inactive = mem_cgroup_zone_nr_lru_pages(memcg, nid, zid,
1220 BIT(LRU_INACTIVE_FILE));
1221 active = mem_cgroup_zone_nr_lru_pages(memcg, nid, zid,
1222 BIT(LRU_ACTIVE_FILE));
1224 return (active > inactive);
1227 struct zone_reclaim_stat *mem_cgroup_get_reclaim_stat(struct mem_cgroup *memcg,
1230 int nid = zone_to_nid(zone);
1231 int zid = zone_idx(zone);
1232 struct mem_cgroup_per_zone *mz = mem_cgroup_zoneinfo(memcg, nid, zid);
1234 return &mz->reclaim_stat;
1237 struct zone_reclaim_stat *
1238 mem_cgroup_get_reclaim_stat_from_page(struct page *page)
1240 struct page_cgroup *pc;
1241 struct mem_cgroup_per_zone *mz;
1243 if (mem_cgroup_disabled())
1246 pc = lookup_page_cgroup(page);
1247 if (!PageCgroupUsed(pc))
1249 /* Ensure pc->mem_cgroup is visible after reading PCG_USED. */
1251 mz = page_cgroup_zoneinfo(pc->mem_cgroup, page);
1252 return &mz->reclaim_stat;
1255 #define mem_cgroup_from_res_counter(counter, member) \
1256 container_of(counter, struct mem_cgroup, member)
1259 * mem_cgroup_margin - calculate chargeable space of a memory cgroup
1260 * @mem: the memory cgroup
1262 * Returns the maximum amount of memory @mem can be charged with, in
1265 static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg)
1267 unsigned long long margin;
1269 margin = res_counter_margin(&memcg->res);
1270 if (do_swap_account)
1271 margin = min(margin, res_counter_margin(&memcg->memsw));
1272 return margin >> PAGE_SHIFT;
1275 int mem_cgroup_swappiness(struct mem_cgroup *memcg)
1277 struct cgroup *cgrp = memcg->css.cgroup;
1280 if (cgrp->parent == NULL)
1281 return vm_swappiness;
1283 return memcg->swappiness;
1286 static void mem_cgroup_start_move(struct mem_cgroup *memcg)
1291 spin_lock(&memcg->pcp_counter_lock);
1292 for_each_online_cpu(cpu)
1293 per_cpu(memcg->stat->count[MEM_CGROUP_ON_MOVE], cpu) += 1;
1294 memcg->nocpu_base.count[MEM_CGROUP_ON_MOVE] += 1;
1295 spin_unlock(&memcg->pcp_counter_lock);
1301 static void mem_cgroup_end_move(struct mem_cgroup *memcg)
1308 spin_lock(&memcg->pcp_counter_lock);
1309 for_each_online_cpu(cpu)
1310 per_cpu(memcg->stat->count[MEM_CGROUP_ON_MOVE], cpu) -= 1;
1311 memcg->nocpu_base.count[MEM_CGROUP_ON_MOVE] -= 1;
1312 spin_unlock(&memcg->pcp_counter_lock);
1316 * 2 routines for checking "mem" is under move_account() or not.
1318 * mem_cgroup_stealed() - checking a cgroup is mc.from or not. This is used
1319 * for avoiding race in accounting. If true,
1320 * pc->mem_cgroup may be overwritten.
1322 * mem_cgroup_under_move() - checking a cgroup is mc.from or mc.to or
1323 * under hierarchy of moving cgroups. This is for
1324 * waiting at hith-memory prressure caused by "move".
1327 static bool mem_cgroup_stealed(struct mem_cgroup *memcg)
1329 VM_BUG_ON(!rcu_read_lock_held());
1330 return this_cpu_read(memcg->stat->count[MEM_CGROUP_ON_MOVE]) > 0;
1333 static bool mem_cgroup_under_move(struct mem_cgroup *memcg)
1335 struct mem_cgroup *from;
1336 struct mem_cgroup *to;
1339 * Unlike task_move routines, we access mc.to, mc.from not under
1340 * mutual exclusion by cgroup_mutex. Here, we take spinlock instead.
1342 spin_lock(&mc.lock);
1348 ret = mem_cgroup_same_or_subtree(memcg, from)
1349 || mem_cgroup_same_or_subtree(memcg, to);
1351 spin_unlock(&mc.lock);
1355 static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg)
1357 if (mc.moving_task && current != mc.moving_task) {
1358 if (mem_cgroup_under_move(memcg)) {
1360 prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE);
1361 /* moving charge context might have finished. */
1364 finish_wait(&mc.waitq, &wait);
1372 * mem_cgroup_print_oom_info: Called from OOM with tasklist_lock held in read mode.
1373 * @memcg: The memory cgroup that went over limit
1374 * @p: Task that is going to be killed
1376 * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is
1379 void mem_cgroup_print_oom_info(struct mem_cgroup *memcg, struct task_struct *p)
1381 struct cgroup *task_cgrp;
1382 struct cgroup *mem_cgrp;
1384 * Need a buffer in BSS, can't rely on allocations. The code relies
1385 * on the assumption that OOM is serialized for memory controller.
1386 * If this assumption is broken, revisit this code.
1388 static char memcg_name[PATH_MAX];
1397 mem_cgrp = memcg->css.cgroup;
1398 task_cgrp = task_cgroup(p, mem_cgroup_subsys_id);
1400 ret = cgroup_path(task_cgrp, memcg_name, PATH_MAX);
1403 * Unfortunately, we are unable to convert to a useful name
1404 * But we'll still print out the usage information
1411 printk(KERN_INFO "Task in %s killed", memcg_name);
1414 ret = cgroup_path(mem_cgrp, memcg_name, PATH_MAX);
1422 * Continues from above, so we don't need an KERN_ level
1424 printk(KERN_CONT " as a result of limit of %s\n", memcg_name);
1427 printk(KERN_INFO "memory: usage %llukB, limit %llukB, failcnt %llu\n",
1428 res_counter_read_u64(&memcg->res, RES_USAGE) >> 10,
1429 res_counter_read_u64(&memcg->res, RES_LIMIT) >> 10,
1430 res_counter_read_u64(&memcg->res, RES_FAILCNT));
1431 printk(KERN_INFO "memory+swap: usage %llukB, limit %llukB, "
1433 res_counter_read_u64(&memcg->memsw, RES_USAGE) >> 10,
1434 res_counter_read_u64(&memcg->memsw, RES_LIMIT) >> 10,
1435 res_counter_read_u64(&memcg->memsw, RES_FAILCNT));
1439 * This function returns the number of memcg under hierarchy tree. Returns
1440 * 1(self count) if no children.
1442 static int mem_cgroup_count_children(struct mem_cgroup *memcg)
1445 struct mem_cgroup *iter;
1447 for_each_mem_cgroup_tree(iter, memcg)
1453 * Return the memory (and swap, if configured) limit for a memcg.
1455 u64 mem_cgroup_get_limit(struct mem_cgroup *memcg)
1460 limit = res_counter_read_u64(&memcg->res, RES_LIMIT);
1461 limit += total_swap_pages << PAGE_SHIFT;
1463 memsw = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
1465 * If memsw is finite and limits the amount of swap space available
1466 * to this memcg, return that limit.
1468 return min(limit, memsw);
1471 static unsigned long mem_cgroup_reclaim(struct mem_cgroup *memcg,
1473 unsigned long flags)
1475 unsigned long total = 0;
1476 bool noswap = false;
1479 if (flags & MEM_CGROUP_RECLAIM_NOSWAP)
1481 if (!(flags & MEM_CGROUP_RECLAIM_SHRINK) && memcg->memsw_is_minimum)
1484 for (loop = 0; loop < MEM_CGROUP_MAX_RECLAIM_LOOPS; loop++) {
1486 drain_all_stock_async(memcg);
1487 total += try_to_free_mem_cgroup_pages(memcg, gfp_mask, noswap);
1489 * Allow limit shrinkers, which are triggered directly
1490 * by userspace, to catch signals and stop reclaim
1491 * after minimal progress, regardless of the margin.
1493 if (total && (flags & MEM_CGROUP_RECLAIM_SHRINK))
1495 if (mem_cgroup_margin(memcg))
1498 * If nothing was reclaimed after two attempts, there
1499 * may be no reclaimable pages in this hierarchy.
1508 * test_mem_cgroup_node_reclaimable
1509 * @mem: the target memcg
1510 * @nid: the node ID to be checked.
1511 * @noswap : specify true here if the user wants flle only information.
1513 * This function returns whether the specified memcg contains any
1514 * reclaimable pages on a node. Returns true if there are any reclaimable
1515 * pages in the node.
1517 static bool test_mem_cgroup_node_reclaimable(struct mem_cgroup *memcg,
1518 int nid, bool noswap)
1520 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_FILE))
1522 if (noswap || !total_swap_pages)
1524 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_ANON))
1529 #if MAX_NUMNODES > 1
1532 * Always updating the nodemask is not very good - even if we have an empty
1533 * list or the wrong list here, we can start from some node and traverse all
1534 * nodes based on the zonelist. So update the list loosely once per 10 secs.
1537 static void mem_cgroup_may_update_nodemask(struct mem_cgroup *memcg)
1541 * numainfo_events > 0 means there was at least NUMAINFO_EVENTS_TARGET
1542 * pagein/pageout changes since the last update.
1544 if (!atomic_read(&memcg->numainfo_events))
1546 if (atomic_inc_return(&memcg->numainfo_updating) > 1)
1549 /* make a nodemask where this memcg uses memory from */
1550 memcg->scan_nodes = node_states[N_HIGH_MEMORY];
1552 for_each_node_mask(nid, node_states[N_HIGH_MEMORY]) {
1554 if (!test_mem_cgroup_node_reclaimable(memcg, nid, false))
1555 node_clear(nid, memcg->scan_nodes);
1558 atomic_set(&memcg->numainfo_events, 0);
1559 atomic_set(&memcg->numainfo_updating, 0);
1563 * Selecting a node where we start reclaim from. Because what we need is just
1564 * reducing usage counter, start from anywhere is O,K. Considering
1565 * memory reclaim from current node, there are pros. and cons.
1567 * Freeing memory from current node means freeing memory from a node which
1568 * we'll use or we've used. So, it may make LRU bad. And if several threads
1569 * hit limits, it will see a contention on a node. But freeing from remote
1570 * node means more costs for memory reclaim because of memory latency.
1572 * Now, we use round-robin. Better algorithm is welcomed.
1574 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1578 mem_cgroup_may_update_nodemask(memcg);
1579 node = memcg->last_scanned_node;
1581 node = next_node(node, memcg->scan_nodes);
1582 if (node == MAX_NUMNODES)
1583 node = first_node(memcg->scan_nodes);
1585 * We call this when we hit limit, not when pages are added to LRU.
1586 * No LRU may hold pages because all pages are UNEVICTABLE or
1587 * memcg is too small and all pages are not on LRU. In that case,
1588 * we use curret node.
1590 if (unlikely(node == MAX_NUMNODES))
1591 node = numa_node_id();
1593 memcg->last_scanned_node = node;
1598 * Check all nodes whether it contains reclaimable pages or not.
1599 * For quick scan, we make use of scan_nodes. This will allow us to skip
1600 * unused nodes. But scan_nodes is lazily updated and may not cotain
1601 * enough new information. We need to do double check.
1603 bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
1608 * quick check...making use of scan_node.
1609 * We can skip unused nodes.
1611 if (!nodes_empty(memcg->scan_nodes)) {
1612 for (nid = first_node(memcg->scan_nodes);
1614 nid = next_node(nid, memcg->scan_nodes)) {
1616 if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
1621 * Check rest of nodes.
1623 for_each_node_state(nid, N_HIGH_MEMORY) {
1624 if (node_isset(nid, memcg->scan_nodes))
1626 if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
1633 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1638 bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
1640 return test_mem_cgroup_node_reclaimable(memcg, 0, noswap);
1644 static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg,
1647 unsigned long *total_scanned)
1649 struct mem_cgroup *victim = NULL;
1652 unsigned long excess;
1653 unsigned long nr_scanned;
1654 struct mem_cgroup_reclaim_cookie reclaim = {
1659 excess = res_counter_soft_limit_excess(&root_memcg->res) >> PAGE_SHIFT;
1662 victim = mem_cgroup_iter(root_memcg, victim, &reclaim);
1667 * If we have not been able to reclaim
1668 * anything, it might because there are
1669 * no reclaimable pages under this hierarchy
1674 * We want to do more targeted reclaim.
1675 * excess >> 2 is not to excessive so as to
1676 * reclaim too much, nor too less that we keep
1677 * coming back to reclaim from this cgroup
1679 if (total >= (excess >> 2) ||
1680 (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS))
1685 if (!mem_cgroup_reclaimable(victim, false))
1687 total += mem_cgroup_shrink_node_zone(victim, gfp_mask, false,
1689 *total_scanned += nr_scanned;
1690 if (!res_counter_soft_limit_excess(&root_memcg->res))
1693 mem_cgroup_iter_break(root_memcg, victim);
1698 * Check OOM-Killer is already running under our hierarchy.
1699 * If someone is running, return false.
1700 * Has to be called with memcg_oom_lock
1702 static bool mem_cgroup_oom_lock(struct mem_cgroup *memcg)
1704 struct mem_cgroup *iter, *failed = NULL;
1706 for_each_mem_cgroup_tree(iter, memcg) {
1707 if (iter->oom_lock) {
1709 * this subtree of our hierarchy is already locked
1710 * so we cannot give a lock.
1713 mem_cgroup_iter_break(memcg, iter);
1716 iter->oom_lock = true;
1723 * OK, we failed to lock the whole subtree so we have to clean up
1724 * what we set up to the failing subtree
1726 for_each_mem_cgroup_tree(iter, memcg) {
1727 if (iter == failed) {
1728 mem_cgroup_iter_break(memcg, iter);
1731 iter->oom_lock = false;
1737 * Has to be called with memcg_oom_lock
1739 static int mem_cgroup_oom_unlock(struct mem_cgroup *memcg)
1741 struct mem_cgroup *iter;
1743 for_each_mem_cgroup_tree(iter, memcg)
1744 iter->oom_lock = false;
1748 static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg)
1750 struct mem_cgroup *iter;
1752 for_each_mem_cgroup_tree(iter, memcg)
1753 atomic_inc(&iter->under_oom);
1756 static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg)
1758 struct mem_cgroup *iter;
1761 * When a new child is created while the hierarchy is under oom,
1762 * mem_cgroup_oom_lock() may not be called. We have to use
1763 * atomic_add_unless() here.
1765 for_each_mem_cgroup_tree(iter, memcg)
1766 atomic_add_unless(&iter->under_oom, -1, 0);
1769 static DEFINE_SPINLOCK(memcg_oom_lock);
1770 static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq);
1772 struct oom_wait_info {
1773 struct mem_cgroup *memcg;
1777 static int memcg_oom_wake_function(wait_queue_t *wait,
1778 unsigned mode, int sync, void *arg)
1780 struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg;
1781 struct mem_cgroup *oom_wait_memcg;
1782 struct oom_wait_info *oom_wait_info;
1784 oom_wait_info = container_of(wait, struct oom_wait_info, wait);
1785 oom_wait_memcg = oom_wait_info->memcg;
1788 * Both of oom_wait_info->memcg and wake_memcg are stable under us.
1789 * Then we can use css_is_ancestor without taking care of RCU.
1791 if (!mem_cgroup_same_or_subtree(oom_wait_memcg, wake_memcg)
1792 && !mem_cgroup_same_or_subtree(wake_memcg, oom_wait_memcg))
1794 return autoremove_wake_function(wait, mode, sync, arg);
1797 static void memcg_wakeup_oom(struct mem_cgroup *memcg)
1799 /* for filtering, pass "memcg" as argument. */
1800 __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg);
1803 static void memcg_oom_recover(struct mem_cgroup *memcg)
1805 if (memcg && atomic_read(&memcg->under_oom))
1806 memcg_wakeup_oom(memcg);
1810 * try to call OOM killer. returns false if we should exit memory-reclaim loop.
1812 bool mem_cgroup_handle_oom(struct mem_cgroup *memcg, gfp_t mask, int order)
1814 struct oom_wait_info owait;
1815 bool locked, need_to_kill;
1817 owait.memcg = memcg;
1818 owait.wait.flags = 0;
1819 owait.wait.func = memcg_oom_wake_function;
1820 owait.wait.private = current;
1821 INIT_LIST_HEAD(&owait.wait.task_list);
1822 need_to_kill = true;
1823 mem_cgroup_mark_under_oom(memcg);
1825 /* At first, try to OOM lock hierarchy under memcg.*/
1826 spin_lock(&memcg_oom_lock);
1827 locked = mem_cgroup_oom_lock(memcg);
1829 * Even if signal_pending(), we can't quit charge() loop without
1830 * accounting. So, UNINTERRUPTIBLE is appropriate. But SIGKILL
1831 * under OOM is always welcomed, use TASK_KILLABLE here.
1833 prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE);
1834 if (!locked || memcg->oom_kill_disable)
1835 need_to_kill = false;
1837 mem_cgroup_oom_notify(memcg);
1838 spin_unlock(&memcg_oom_lock);
1841 finish_wait(&memcg_oom_waitq, &owait.wait);
1842 mem_cgroup_out_of_memory(memcg, mask, order);
1845 finish_wait(&memcg_oom_waitq, &owait.wait);
1847 spin_lock(&memcg_oom_lock);
1849 mem_cgroup_oom_unlock(memcg);
1850 memcg_wakeup_oom(memcg);
1851 spin_unlock(&memcg_oom_lock);
1853 mem_cgroup_unmark_under_oom(memcg);
1855 if (test_thread_flag(TIF_MEMDIE) || fatal_signal_pending(current))
1857 /* Give chance to dying process */
1858 schedule_timeout_uninterruptible(1);
1863 * Currently used to update mapped file statistics, but the routine can be
1864 * generalized to update other statistics as well.
1866 * Notes: Race condition
1868 * We usually use page_cgroup_lock() for accessing page_cgroup member but
1869 * it tends to be costly. But considering some conditions, we doesn't need
1870 * to do so _always_.
1872 * Considering "charge", lock_page_cgroup() is not required because all
1873 * file-stat operations happen after a page is attached to radix-tree. There
1874 * are no race with "charge".
1876 * Considering "uncharge", we know that memcg doesn't clear pc->mem_cgroup
1877 * at "uncharge" intentionally. So, we always see valid pc->mem_cgroup even
1878 * if there are race with "uncharge". Statistics itself is properly handled
1881 * Considering "move", this is an only case we see a race. To make the race
1882 * small, we check MEM_CGROUP_ON_MOVE percpu value and detect there are
1883 * possibility of race condition. If there is, we take a lock.
1886 void mem_cgroup_update_page_stat(struct page *page,
1887 enum mem_cgroup_page_stat_item idx, int val)
1889 struct mem_cgroup *memcg;
1890 struct page_cgroup *pc = lookup_page_cgroup(page);
1891 bool need_unlock = false;
1892 unsigned long uninitialized_var(flags);
1894 if (mem_cgroup_disabled())
1898 memcg = pc->mem_cgroup;
1899 if (unlikely(!memcg || !PageCgroupUsed(pc)))
1901 /* pc->mem_cgroup is unstable ? */
1902 if (unlikely(mem_cgroup_stealed(memcg)) || PageTransHuge(page)) {
1903 /* take a lock against to access pc->mem_cgroup */
1904 move_lock_page_cgroup(pc, &flags);
1906 memcg = pc->mem_cgroup;
1907 if (!memcg || !PageCgroupUsed(pc))
1912 case MEMCG_NR_FILE_MAPPED:
1914 SetPageCgroupFileMapped(pc);
1915 else if (!page_mapped(page))
1916 ClearPageCgroupFileMapped(pc);
1917 idx = MEM_CGROUP_STAT_FILE_MAPPED;
1923 this_cpu_add(memcg->stat->count[idx], val);
1926 if (unlikely(need_unlock))
1927 move_unlock_page_cgroup(pc, &flags);
1931 EXPORT_SYMBOL(mem_cgroup_update_page_stat);
1934 * size of first charge trial. "32" comes from vmscan.c's magic value.
1935 * TODO: maybe necessary to use big numbers in big irons.
1937 #define CHARGE_BATCH 32U
1938 struct memcg_stock_pcp {
1939 struct mem_cgroup *cached; /* this never be root cgroup */
1940 unsigned int nr_pages;
1941 struct work_struct work;
1942 unsigned long flags;
1943 #define FLUSHING_CACHED_CHARGE (0)
1945 static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock);
1946 static DEFINE_MUTEX(percpu_charge_mutex);
1949 * Try to consume stocked charge on this cpu. If success, one page is consumed
1950 * from local stock and true is returned. If the stock is 0 or charges from a
1951 * cgroup which is not current target, returns false. This stock will be
1954 static bool consume_stock(struct mem_cgroup *memcg)
1956 struct memcg_stock_pcp *stock;
1959 stock = &get_cpu_var(memcg_stock);
1960 if (memcg == stock->cached && stock->nr_pages)
1962 else /* need to call res_counter_charge */
1964 put_cpu_var(memcg_stock);
1969 * Returns stocks cached in percpu to res_counter and reset cached information.
1971 static void drain_stock(struct memcg_stock_pcp *stock)
1973 struct mem_cgroup *old = stock->cached;
1975 if (stock->nr_pages) {
1976 unsigned long bytes = stock->nr_pages * PAGE_SIZE;
1978 res_counter_uncharge(&old->res, bytes);
1979 if (do_swap_account)
1980 res_counter_uncharge(&old->memsw, bytes);
1981 stock->nr_pages = 0;
1983 stock->cached = NULL;
1987 * This must be called under preempt disabled or must be called by
1988 * a thread which is pinned to local cpu.
1990 static void drain_local_stock(struct work_struct *dummy)
1992 struct memcg_stock_pcp *stock = &__get_cpu_var(memcg_stock);
1994 clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags);
1998 * Cache charges(val) which is from res_counter, to local per_cpu area.
1999 * This will be consumed by consume_stock() function, later.
2001 static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2003 struct memcg_stock_pcp *stock = &get_cpu_var(memcg_stock);
2005 if (stock->cached != memcg) { /* reset if necessary */
2007 stock->cached = memcg;
2009 stock->nr_pages += nr_pages;
2010 put_cpu_var(memcg_stock);
2014 * Drains all per-CPU charge caches for given root_memcg resp. subtree
2015 * of the hierarchy under it. sync flag says whether we should block
2016 * until the work is done.
2018 static void drain_all_stock(struct mem_cgroup *root_memcg, bool sync)
2022 /* Notify other cpus that system-wide "drain" is running */
2025 for_each_online_cpu(cpu) {
2026 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2027 struct mem_cgroup *memcg;
2029 memcg = stock->cached;
2030 if (!memcg || !stock->nr_pages)
2032 if (!mem_cgroup_same_or_subtree(root_memcg, memcg))
2034 if (!test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) {
2036 drain_local_stock(&stock->work);
2038 schedule_work_on(cpu, &stock->work);
2046 for_each_online_cpu(cpu) {
2047 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2048 if (test_bit(FLUSHING_CACHED_CHARGE, &stock->flags))
2049 flush_work(&stock->work);
2056 * Tries to drain stocked charges in other cpus. This function is asynchronous
2057 * and just put a work per cpu for draining localy on each cpu. Caller can
2058 * expects some charges will be back to res_counter later but cannot wait for
2061 static void drain_all_stock_async(struct mem_cgroup *root_memcg)
2064 * If someone calls draining, avoid adding more kworker runs.
2066 if (!mutex_trylock(&percpu_charge_mutex))
2068 drain_all_stock(root_memcg, false);
2069 mutex_unlock(&percpu_charge_mutex);
2072 /* This is a synchronous drain interface. */
2073 static void drain_all_stock_sync(struct mem_cgroup *root_memcg)
2075 /* called when force_empty is called */
2076 mutex_lock(&percpu_charge_mutex);
2077 drain_all_stock(root_memcg, true);
2078 mutex_unlock(&percpu_charge_mutex);
2082 * This function drains percpu counter value from DEAD cpu and
2083 * move it to local cpu. Note that this function can be preempted.
2085 static void mem_cgroup_drain_pcp_counter(struct mem_cgroup *memcg, int cpu)
2089 spin_lock(&memcg->pcp_counter_lock);
2090 for (i = 0; i < MEM_CGROUP_STAT_DATA; i++) {
2091 long x = per_cpu(memcg->stat->count[i], cpu);
2093 per_cpu(memcg->stat->count[i], cpu) = 0;
2094 memcg->nocpu_base.count[i] += x;
2096 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) {
2097 unsigned long x = per_cpu(memcg->stat->events[i], cpu);
2099 per_cpu(memcg->stat->events[i], cpu) = 0;
2100 memcg->nocpu_base.events[i] += x;
2102 /* need to clear ON_MOVE value, works as a kind of lock. */
2103 per_cpu(memcg->stat->count[MEM_CGROUP_ON_MOVE], cpu) = 0;
2104 spin_unlock(&memcg->pcp_counter_lock);
2107 static void synchronize_mem_cgroup_on_move(struct mem_cgroup *memcg, int cpu)
2109 int idx = MEM_CGROUP_ON_MOVE;
2111 spin_lock(&memcg->pcp_counter_lock);
2112 per_cpu(memcg->stat->count[idx], cpu) = memcg->nocpu_base.count[idx];
2113 spin_unlock(&memcg->pcp_counter_lock);
2116 static int __cpuinit memcg_cpu_hotplug_callback(struct notifier_block *nb,
2117 unsigned long action,
2120 int cpu = (unsigned long)hcpu;
2121 struct memcg_stock_pcp *stock;
2122 struct mem_cgroup *iter;
2124 if ((action == CPU_ONLINE)) {
2125 for_each_mem_cgroup(iter)
2126 synchronize_mem_cgroup_on_move(iter, cpu);
2130 if ((action != CPU_DEAD) || action != CPU_DEAD_FROZEN)
2133 for_each_mem_cgroup(iter)
2134 mem_cgroup_drain_pcp_counter(iter, cpu);
2136 stock = &per_cpu(memcg_stock, cpu);
2142 /* See __mem_cgroup_try_charge() for details */
2144 CHARGE_OK, /* success */
2145 CHARGE_RETRY, /* need to retry but retry is not bad */
2146 CHARGE_NOMEM, /* we can't do more. return -ENOMEM */
2147 CHARGE_WOULDBLOCK, /* GFP_WAIT wasn't set and no enough res. */
2148 CHARGE_OOM_DIE, /* the current is killed because of OOM */
2151 static int mem_cgroup_do_charge(struct mem_cgroup *memcg, gfp_t gfp_mask,
2152 unsigned int nr_pages, bool oom_check)
2154 unsigned long csize = nr_pages * PAGE_SIZE;
2155 struct mem_cgroup *mem_over_limit;
2156 struct res_counter *fail_res;
2157 unsigned long flags = 0;
2160 ret = res_counter_charge(&memcg->res, csize, &fail_res);
2163 if (!do_swap_account)
2165 ret = res_counter_charge(&memcg->memsw, csize, &fail_res);
2169 res_counter_uncharge(&memcg->res, csize);
2170 mem_over_limit = mem_cgroup_from_res_counter(fail_res, memsw);
2171 flags |= MEM_CGROUP_RECLAIM_NOSWAP;
2173 mem_over_limit = mem_cgroup_from_res_counter(fail_res, res);
2175 * nr_pages can be either a huge page (HPAGE_PMD_NR), a batch
2176 * of regular pages (CHARGE_BATCH), or a single regular page (1).
2178 * Never reclaim on behalf of optional batching, retry with a
2179 * single page instead.
2181 if (nr_pages == CHARGE_BATCH)
2182 return CHARGE_RETRY;
2184 if (!(gfp_mask & __GFP_WAIT))
2185 return CHARGE_WOULDBLOCK;
2187 ret = mem_cgroup_reclaim(mem_over_limit, gfp_mask, flags);
2188 if (mem_cgroup_margin(mem_over_limit) >= nr_pages)
2189 return CHARGE_RETRY;
2191 * Even though the limit is exceeded at this point, reclaim
2192 * may have been able to free some pages. Retry the charge
2193 * before killing the task.
2195 * Only for regular pages, though: huge pages are rather
2196 * unlikely to succeed so close to the limit, and we fall back
2197 * to regular pages anyway in case of failure.
2199 if (nr_pages == 1 && ret)
2200 return CHARGE_RETRY;
2203 * At task move, charge accounts can be doubly counted. So, it's
2204 * better to wait until the end of task_move if something is going on.
2206 if (mem_cgroup_wait_acct_move(mem_over_limit))
2207 return CHARGE_RETRY;
2209 /* If we don't need to call oom-killer at el, return immediately */
2211 return CHARGE_NOMEM;
2213 if (!mem_cgroup_handle_oom(mem_over_limit, gfp_mask, get_order(csize)))
2214 return CHARGE_OOM_DIE;
2216 return CHARGE_RETRY;
2220 * __mem_cgroup_try_charge() does
2221 * 1. detect memcg to be charged against from passed *mm and *ptr,
2222 * 2. update res_counter
2223 * 3. call memory reclaim if necessary.
2225 * In some special case, if the task is fatal, fatal_signal_pending() or
2226 * has TIF_MEMDIE, this function returns -EINTR while writing root_mem_cgroup
2227 * to *ptr. There are two reasons for this. 1: fatal threads should quit as soon
2228 * as possible without any hazards. 2: all pages should have a valid
2229 * pc->mem_cgroup. If mm is NULL and the caller doesn't pass a valid memcg
2230 * pointer, that is treated as a charge to root_mem_cgroup.
2232 * So __mem_cgroup_try_charge() will return
2233 * 0 ... on success, filling *ptr with a valid memcg pointer.
2234 * -ENOMEM ... charge failure because of resource limits.
2235 * -EINTR ... if thread is fatal. *ptr is filled with root_mem_cgroup.
2237 * Unlike the exported interface, an "oom" parameter is added. if oom==true,
2238 * the oom-killer can be invoked.
2240 static int __mem_cgroup_try_charge(struct mm_struct *mm,
2242 unsigned int nr_pages,
2243 struct mem_cgroup **ptr,
2246 unsigned int batch = max(CHARGE_BATCH, nr_pages);
2247 int nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES;
2248 struct mem_cgroup *memcg = NULL;
2252 * Unlike gloval-vm's OOM-kill, we're not in memory shortage
2253 * in system level. So, allow to go ahead dying process in addition to
2256 if (unlikely(test_thread_flag(TIF_MEMDIE)
2257 || fatal_signal_pending(current)))
2261 * We always charge the cgroup the mm_struct belongs to.
2262 * The mm_struct's mem_cgroup changes on task migration if the
2263 * thread group leader migrates. It's possible that mm is not
2264 * set, if so charge the init_mm (happens for pagecache usage).
2267 *ptr = root_mem_cgroup;
2269 if (*ptr) { /* css should be a valid one */
2271 VM_BUG_ON(css_is_removed(&memcg->css));
2272 if (mem_cgroup_is_root(memcg))
2274 if (nr_pages == 1 && consume_stock(memcg))
2276 css_get(&memcg->css);
2278 struct task_struct *p;
2281 p = rcu_dereference(mm->owner);
2283 * Because we don't have task_lock(), "p" can exit.
2284 * In that case, "memcg" can point to root or p can be NULL with
2285 * race with swapoff. Then, we have small risk of mis-accouning.
2286 * But such kind of mis-account by race always happens because
2287 * we don't have cgroup_mutex(). It's overkill and we allo that
2289 * (*) swapoff at el will charge against mm-struct not against
2290 * task-struct. So, mm->owner can be NULL.
2292 memcg = mem_cgroup_from_task(p);
2294 memcg = root_mem_cgroup;
2295 if (mem_cgroup_is_root(memcg)) {
2299 if (nr_pages == 1 && consume_stock(memcg)) {
2301 * It seems dagerous to access memcg without css_get().
2302 * But considering how consume_stok works, it's not
2303 * necessary. If consume_stock success, some charges
2304 * from this memcg are cached on this cpu. So, we
2305 * don't need to call css_get()/css_tryget() before
2306 * calling consume_stock().
2311 /* after here, we may be blocked. we need to get refcnt */
2312 if (!css_tryget(&memcg->css)) {
2322 /* If killed, bypass charge */
2323 if (fatal_signal_pending(current)) {
2324 css_put(&memcg->css);
2329 if (oom && !nr_oom_retries) {
2331 nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES;
2334 ret = mem_cgroup_do_charge(memcg, gfp_mask, batch, oom_check);
2338 case CHARGE_RETRY: /* not in OOM situation but retry */
2340 css_put(&memcg->css);
2343 case CHARGE_WOULDBLOCK: /* !__GFP_WAIT */
2344 css_put(&memcg->css);
2346 case CHARGE_NOMEM: /* OOM routine works */
2348 css_put(&memcg->css);
2351 /* If oom, we never return -ENOMEM */
2354 case CHARGE_OOM_DIE: /* Killed by OOM Killer */
2355 css_put(&memcg->css);
2358 } while (ret != CHARGE_OK);
2360 if (batch > nr_pages)
2361 refill_stock(memcg, batch - nr_pages);
2362 css_put(&memcg->css);
2370 *ptr = root_mem_cgroup;
2375 * Somemtimes we have to undo a charge we got by try_charge().
2376 * This function is for that and do uncharge, put css's refcnt.
2377 * gotten by try_charge().
2379 static void __mem_cgroup_cancel_charge(struct mem_cgroup *memcg,
2380 unsigned int nr_pages)
2382 if (!mem_cgroup_is_root(memcg)) {
2383 unsigned long bytes = nr_pages * PAGE_SIZE;
2385 res_counter_uncharge(&memcg->res, bytes);
2386 if (do_swap_account)
2387 res_counter_uncharge(&memcg->memsw, bytes);
2392 * A helper function to get mem_cgroup from ID. must be called under
2393 * rcu_read_lock(). The caller must check css_is_removed() or some if
2394 * it's concern. (dropping refcnt from swap can be called against removed
2397 static struct mem_cgroup *mem_cgroup_lookup(unsigned short id)
2399 struct cgroup_subsys_state *css;
2401 /* ID 0 is unused ID */
2404 css = css_lookup(&mem_cgroup_subsys, id);
2407 return container_of(css, struct mem_cgroup, css);
2410 struct mem_cgroup *try_get_mem_cgroup_from_page(struct page *page)
2412 struct mem_cgroup *memcg = NULL;
2413 struct page_cgroup *pc;
2417 VM_BUG_ON(!PageLocked(page));
2419 pc = lookup_page_cgroup(page);
2420 lock_page_cgroup(pc);
2421 if (PageCgroupUsed(pc)) {
2422 memcg = pc->mem_cgroup;
2423 if (memcg && !css_tryget(&memcg->css))
2425 } else if (PageSwapCache(page)) {
2426 ent.val = page_private(page);
2427 id = lookup_swap_cgroup_id(ent);
2429 memcg = mem_cgroup_lookup(id);
2430 if (memcg && !css_tryget(&memcg->css))
2434 unlock_page_cgroup(pc);
2438 static void __mem_cgroup_commit_charge(struct mem_cgroup *memcg,
2440 unsigned int nr_pages,
2441 struct page_cgroup *pc,
2442 enum charge_type ctype,
2445 struct zone *uninitialized_var(zone);
2446 bool was_on_lru = false;
2448 lock_page_cgroup(pc);
2449 if (unlikely(PageCgroupUsed(pc))) {
2450 unlock_page_cgroup(pc);
2451 __mem_cgroup_cancel_charge(memcg, nr_pages);
2455 * we don't need page_cgroup_lock about tail pages, becase they are not
2456 * accessed by any other context at this point.
2460 * In some cases, SwapCache and FUSE(splice_buf->radixtree), the page
2461 * may already be on some other mem_cgroup's LRU. Take care of it.
2464 zone = page_zone(page);
2465 spin_lock_irq(&zone->lru_lock);
2466 if (PageLRU(page)) {
2468 del_page_from_lru_list(zone, page, page_lru(page));
2473 pc->mem_cgroup = memcg;
2475 * We access a page_cgroup asynchronously without lock_page_cgroup().
2476 * Especially when a page_cgroup is taken from a page, pc->mem_cgroup
2477 * is accessed after testing USED bit. To make pc->mem_cgroup visible
2478 * before USED bit, we need memory barrier here.
2479 * See mem_cgroup_add_lru_list(), etc.
2483 case MEM_CGROUP_CHARGE_TYPE_CACHE:
2484 case MEM_CGROUP_CHARGE_TYPE_SHMEM:
2485 SetPageCgroupCache(pc);
2486 SetPageCgroupUsed(pc);
2488 case MEM_CGROUP_CHARGE_TYPE_MAPPED:
2489 ClearPageCgroupCache(pc);
2490 SetPageCgroupUsed(pc);
2498 VM_BUG_ON(PageLRU(page));
2500 add_page_to_lru_list(zone, page, page_lru(page));
2502 spin_unlock_irq(&zone->lru_lock);
2505 mem_cgroup_charge_statistics(memcg, PageCgroupCache(pc), nr_pages);
2506 unlock_page_cgroup(pc);
2509 * "charge_statistics" updated event counter. Then, check it.
2510 * Insert ancestor (and ancestor's ancestors), to softlimit RB-tree.
2511 * if they exceeds softlimit.
2513 memcg_check_events(memcg, page);
2516 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
2518 #define PCGF_NOCOPY_AT_SPLIT ((1 << PCG_LOCK) | (1 << PCG_MOVE_LOCK) |\
2519 (1 << PCG_MIGRATION))
2521 * Because tail pages are not marked as "used", set it. We're under
2522 * zone->lru_lock, 'splitting on pmd' and compound_lock.
2523 * charge/uncharge will be never happen and move_account() is done under
2524 * compound_lock(), so we don't have to take care of races.
2526 void mem_cgroup_split_huge_fixup(struct page *head)
2528 struct page_cgroup *head_pc = lookup_page_cgroup(head);
2529 struct page_cgroup *pc;
2532 if (mem_cgroup_disabled())
2534 for (i = 1; i < HPAGE_PMD_NR; i++) {
2536 pc->mem_cgroup = head_pc->mem_cgroup;
2537 smp_wmb();/* see __commit_charge() */
2538 pc->flags = head_pc->flags & ~PCGF_NOCOPY_AT_SPLIT;
2541 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
2544 * mem_cgroup_move_account - move account of the page
2546 * @nr_pages: number of regular pages (>1 for huge pages)
2547 * @pc: page_cgroup of the page.
2548 * @from: mem_cgroup which the page is moved from.
2549 * @to: mem_cgroup which the page is moved to. @from != @to.
2550 * @uncharge: whether we should call uncharge and css_put against @from.
2552 * The caller must confirm following.
2553 * - page is not on LRU (isolate_page() is useful.)
2554 * - compound_lock is held when nr_pages > 1
2556 * This function doesn't do "charge" nor css_get to new cgroup. It should be
2557 * done by a caller(__mem_cgroup_try_charge would be useful). If @uncharge is
2558 * true, this function does "uncharge" from old cgroup, but it doesn't if
2559 * @uncharge is false, so a caller should do "uncharge".
2561 static int mem_cgroup_move_account(struct page *page,
2562 unsigned int nr_pages,
2563 struct page_cgroup *pc,
2564 struct mem_cgroup *from,
2565 struct mem_cgroup *to,
2568 unsigned long flags;
2571 VM_BUG_ON(from == to);
2572 VM_BUG_ON(PageLRU(page));
2574 * The page is isolated from LRU. So, collapse function
2575 * will not handle this page. But page splitting can happen.
2576 * Do this check under compound_page_lock(). The caller should
2580 if (nr_pages > 1 && !PageTransHuge(page))
2583 lock_page_cgroup(pc);
2586 if (!PageCgroupUsed(pc) || pc->mem_cgroup != from)
2589 move_lock_page_cgroup(pc, &flags);
2591 if (PageCgroupFileMapped(pc)) {
2592 /* Update mapped_file data for mem_cgroup */
2594 __this_cpu_dec(from->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]);
2595 __this_cpu_inc(to->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]);
2598 mem_cgroup_charge_statistics(from, PageCgroupCache(pc), -nr_pages);
2600 /* This is not "cancel", but cancel_charge does all we need. */
2601 __mem_cgroup_cancel_charge(from, nr_pages);
2603 /* caller should have done css_get */
2604 pc->mem_cgroup = to;
2605 mem_cgroup_charge_statistics(to, PageCgroupCache(pc), nr_pages);
2607 * We charges against "to" which may not have any tasks. Then, "to"
2608 * can be under rmdir(). But in current implementation, caller of
2609 * this function is just force_empty() and move charge, so it's
2610 * guaranteed that "to" is never removed. So, we don't check rmdir
2613 move_unlock_page_cgroup(pc, &flags);
2616 unlock_page_cgroup(pc);
2620 memcg_check_events(to, page);
2621 memcg_check_events(from, page);
2627 * move charges to its parent.
2630 static int mem_cgroup_move_parent(struct page *page,
2631 struct page_cgroup *pc,
2632 struct mem_cgroup *child,
2635 struct cgroup *cg = child->css.cgroup;
2636 struct cgroup *pcg = cg->parent;
2637 struct mem_cgroup *parent;
2638 unsigned int nr_pages;
2639 unsigned long uninitialized_var(flags);
2647 if (!get_page_unless_zero(page))
2649 if (isolate_lru_page(page))
2652 nr_pages = hpage_nr_pages(page);
2654 parent = mem_cgroup_from_cont(pcg);
2655 ret = __mem_cgroup_try_charge(NULL, gfp_mask, nr_pages, &parent, false);
2660 flags = compound_lock_irqsave(page);
2662 ret = mem_cgroup_move_account(page, nr_pages, pc, child, parent, true);
2664 __mem_cgroup_cancel_charge(parent, nr_pages);
2667 compound_unlock_irqrestore(page, flags);
2669 putback_lru_page(page);
2677 * Charge the memory controller for page usage.
2679 * 0 if the charge was successful
2680 * < 0 if the cgroup is over its limit
2682 static int mem_cgroup_charge_common(struct page *page, struct mm_struct *mm,
2683 gfp_t gfp_mask, enum charge_type ctype)
2685 struct mem_cgroup *memcg = NULL;
2686 unsigned int nr_pages = 1;
2687 struct page_cgroup *pc;
2691 if (PageTransHuge(page)) {
2692 nr_pages <<= compound_order(page);
2693 VM_BUG_ON(!PageTransHuge(page));
2695 * Never OOM-kill a process for a huge page. The
2696 * fault handler will fall back to regular pages.
2701 pc = lookup_page_cgroup(page);
2702 ret = __mem_cgroup_try_charge(mm, gfp_mask, nr_pages, &memcg, oom);
2705 __mem_cgroup_commit_charge(memcg, page, nr_pages, pc, ctype, false);
2709 int mem_cgroup_newpage_charge(struct page *page,
2710 struct mm_struct *mm, gfp_t gfp_mask)
2712 if (mem_cgroup_disabled())
2714 VM_BUG_ON(page_mapped(page));
2715 VM_BUG_ON(page->mapping && !PageAnon(page));
2717 return mem_cgroup_charge_common(page, mm, gfp_mask,
2718 MEM_CGROUP_CHARGE_TYPE_MAPPED);
2722 __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *ptr,
2723 enum charge_type ctype);
2725 int mem_cgroup_cache_charge(struct page *page, struct mm_struct *mm,
2728 struct mem_cgroup *memcg = NULL;
2729 enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE;
2732 if (mem_cgroup_disabled())
2734 if (PageCompound(page))
2739 if (!page_is_file_cache(page))
2740 type = MEM_CGROUP_CHARGE_TYPE_SHMEM;
2742 if (!PageSwapCache(page))
2743 ret = mem_cgroup_charge_common(page, mm, gfp_mask, type);
2744 else { /* page is swapcache/shmem */
2745 ret = mem_cgroup_try_charge_swapin(mm, page, gfp_mask, &memcg);
2747 __mem_cgroup_commit_charge_swapin(page, memcg, type);
2753 * While swap-in, try_charge -> commit or cancel, the page is locked.
2754 * And when try_charge() successfully returns, one refcnt to memcg without
2755 * struct page_cgroup is acquired. This refcnt will be consumed by
2756 * "commit()" or removed by "cancel()"
2758 int mem_cgroup_try_charge_swapin(struct mm_struct *mm,
2760 gfp_t mask, struct mem_cgroup **memcgp)
2762 struct mem_cgroup *memcg;
2767 if (mem_cgroup_disabled())
2770 if (!do_swap_account)
2773 * A racing thread's fault, or swapoff, may have already updated
2774 * the pte, and even removed page from swap cache: in those cases
2775 * do_swap_page()'s pte_same() test will fail; but there's also a
2776 * KSM case which does need to charge the page.
2778 if (!PageSwapCache(page))
2780 memcg = try_get_mem_cgroup_from_page(page);
2784 ret = __mem_cgroup_try_charge(NULL, mask, 1, memcgp, true);
2785 css_put(&memcg->css);
2792 ret = __mem_cgroup_try_charge(mm, mask, 1, memcgp, true);
2799 __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *memcg,
2800 enum charge_type ctype)
2802 struct page_cgroup *pc;
2804 if (mem_cgroup_disabled())
2808 cgroup_exclude_rmdir(&memcg->css);
2810 pc = lookup_page_cgroup(page);
2811 __mem_cgroup_commit_charge(memcg, page, 1, pc, ctype, true);
2813 * Now swap is on-memory. This means this page may be
2814 * counted both as mem and swap....double count.
2815 * Fix it by uncharging from memsw. Basically, this SwapCache is stable
2816 * under lock_page(). But in do_swap_page()::memory.c, reuse_swap_page()
2817 * may call delete_from_swap_cache() before reach here.
2819 if (do_swap_account && PageSwapCache(page)) {
2820 swp_entry_t ent = {.val = page_private(page)};
2821 struct mem_cgroup *swap_memcg;
2824 id = swap_cgroup_record(ent, 0);
2826 swap_memcg = mem_cgroup_lookup(id);
2829 * This recorded memcg can be obsolete one. So, avoid
2830 * calling css_tryget
2832 if (!mem_cgroup_is_root(swap_memcg))
2833 res_counter_uncharge(&swap_memcg->memsw,
2835 mem_cgroup_swap_statistics(swap_memcg, false);
2836 mem_cgroup_put(swap_memcg);
2841 * At swapin, we may charge account against cgroup which has no tasks.
2842 * So, rmdir()->pre_destroy() can be called while we do this charge.
2843 * In that case, we need to call pre_destroy() again. check it here.
2845 cgroup_release_and_wakeup_rmdir(&memcg->css);
2848 void mem_cgroup_commit_charge_swapin(struct page *page,
2849 struct mem_cgroup *memcg)
2851 __mem_cgroup_commit_charge_swapin(page, memcg,
2852 MEM_CGROUP_CHARGE_TYPE_MAPPED);
2855 void mem_cgroup_cancel_charge_swapin(struct mem_cgroup *memcg)
2857 if (mem_cgroup_disabled())
2861 __mem_cgroup_cancel_charge(memcg, 1);
2864 static void mem_cgroup_do_uncharge(struct mem_cgroup *memcg,
2865 unsigned int nr_pages,
2866 const enum charge_type ctype)
2868 struct memcg_batch_info *batch = NULL;
2869 bool uncharge_memsw = true;
2871 /* If swapout, usage of swap doesn't decrease */
2872 if (!do_swap_account || ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT)
2873 uncharge_memsw = false;
2875 batch = ¤t->memcg_batch;
2877 * In usual, we do css_get() when we remember memcg pointer.
2878 * But in this case, we keep res->usage until end of a series of
2879 * uncharges. Then, it's ok to ignore memcg's refcnt.
2882 batch->memcg = memcg;
2884 * do_batch > 0 when unmapping pages or inode invalidate/truncate.
2885 * In those cases, all pages freed continuously can be expected to be in
2886 * the same cgroup and we have chance to coalesce uncharges.
2887 * But we do uncharge one by one if this is killed by OOM(TIF_MEMDIE)
2888 * because we want to do uncharge as soon as possible.
2891 if (!batch->do_batch || test_thread_flag(TIF_MEMDIE))
2892 goto direct_uncharge;
2895 goto direct_uncharge;
2898 * In typical case, batch->memcg == mem. This means we can
2899 * merge a series of uncharges to an uncharge of res_counter.
2900 * If not, we uncharge res_counter ony by one.
2902 if (batch->memcg != memcg)
2903 goto direct_uncharge;
2904 /* remember freed charge and uncharge it later */
2907 batch->memsw_nr_pages++;
2910 res_counter_uncharge(&memcg->res, nr_pages * PAGE_SIZE);
2912 res_counter_uncharge(&memcg->memsw, nr_pages * PAGE_SIZE);
2913 if (unlikely(batch->memcg != memcg))
2914 memcg_oom_recover(memcg);
2919 * uncharge if !page_mapped(page)
2921 static struct mem_cgroup *
2922 __mem_cgroup_uncharge_common(struct page *page, enum charge_type ctype)
2924 struct mem_cgroup *memcg = NULL;
2925 unsigned int nr_pages = 1;
2926 struct page_cgroup *pc;
2928 if (mem_cgroup_disabled())
2931 if (PageSwapCache(page))
2934 if (PageTransHuge(page)) {
2935 nr_pages <<= compound_order(page);
2936 VM_BUG_ON(!PageTransHuge(page));
2939 * Check if our page_cgroup is valid
2941 pc = lookup_page_cgroup(page);
2942 if (unlikely(!PageCgroupUsed(pc)))
2945 lock_page_cgroup(pc);
2947 memcg = pc->mem_cgroup;
2949 if (!PageCgroupUsed(pc))
2953 case MEM_CGROUP_CHARGE_TYPE_MAPPED:
2954 case MEM_CGROUP_CHARGE_TYPE_DROP:
2955 /* See mem_cgroup_prepare_migration() */
2956 if (page_mapped(page) || PageCgroupMigration(pc))
2959 case MEM_CGROUP_CHARGE_TYPE_SWAPOUT:
2960 if (!PageAnon(page)) { /* Shared memory */
2961 if (page->mapping && !page_is_file_cache(page))
2963 } else if (page_mapped(page)) /* Anon */
2970 mem_cgroup_charge_statistics(memcg, PageCgroupCache(pc), -nr_pages);
2972 ClearPageCgroupUsed(pc);
2974 * pc->mem_cgroup is not cleared here. It will be accessed when it's
2975 * freed from LRU. This is safe because uncharged page is expected not
2976 * to be reused (freed soon). Exception is SwapCache, it's handled by
2977 * special functions.
2980 unlock_page_cgroup(pc);
2982 * even after unlock, we have memcg->res.usage here and this memcg
2983 * will never be freed.
2985 memcg_check_events(memcg, page);
2986 if (do_swap_account && ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) {
2987 mem_cgroup_swap_statistics(memcg, true);
2988 mem_cgroup_get(memcg);
2990 if (!mem_cgroup_is_root(memcg))
2991 mem_cgroup_do_uncharge(memcg, nr_pages, ctype);
2996 unlock_page_cgroup(pc);
3000 void mem_cgroup_uncharge_page(struct page *page)
3003 if (page_mapped(page))
3005 VM_BUG_ON(page->mapping && !PageAnon(page));
3006 __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_MAPPED);
3009 void mem_cgroup_uncharge_cache_page(struct page *page)
3011 VM_BUG_ON(page_mapped(page));
3012 VM_BUG_ON(page->mapping);
3013 __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_CACHE);
3017 * Batch_start/batch_end is called in unmap_page_range/invlidate/trucate.
3018 * In that cases, pages are freed continuously and we can expect pages
3019 * are in the same memcg. All these calls itself limits the number of
3020 * pages freed at once, then uncharge_start/end() is called properly.
3021 * This may be called prural(2) times in a context,
3024 void mem_cgroup_uncharge_start(void)
3026 current->memcg_batch.do_batch++;
3027 /* We can do nest. */
3028 if (current->memcg_batch.do_batch == 1) {
3029 current->memcg_batch.memcg = NULL;
3030 current->memcg_batch.nr_pages = 0;
3031 current->memcg_batch.memsw_nr_pages = 0;
3035 void mem_cgroup_uncharge_end(void)
3037 struct memcg_batch_info *batch = ¤t->memcg_batch;
3039 if (!batch->do_batch)
3043 if (batch->do_batch) /* If stacked, do nothing. */
3049 * This "batch->memcg" is valid without any css_get/put etc...
3050 * bacause we hide charges behind us.
3052 if (batch->nr_pages)
3053 res_counter_uncharge(&batch->memcg->res,
3054 batch->nr_pages * PAGE_SIZE);
3055 if (batch->memsw_nr_pages)
3056 res_counter_uncharge(&batch->memcg->memsw,
3057 batch->memsw_nr_pages * PAGE_SIZE);
3058 memcg_oom_recover(batch->memcg);
3059 /* forget this pointer (for sanity check) */
3060 batch->memcg = NULL;
3065 * called after __delete_from_swap_cache() and drop "page" account.
3066 * memcg information is recorded to swap_cgroup of "ent"
3069 mem_cgroup_uncharge_swapcache(struct page *page, swp_entry_t ent, bool swapout)
3071 struct mem_cgroup *memcg;
3072 int ctype = MEM_CGROUP_CHARGE_TYPE_SWAPOUT;
3074 if (!swapout) /* this was a swap cache but the swap is unused ! */
3075 ctype = MEM_CGROUP_CHARGE_TYPE_DROP;
3077 memcg = __mem_cgroup_uncharge_common(page, ctype);
3080 * record memcg information, if swapout && memcg != NULL,
3081 * mem_cgroup_get() was called in uncharge().
3083 if (do_swap_account && swapout && memcg)
3084 swap_cgroup_record(ent, css_id(&memcg->css));
3088 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP
3090 * called from swap_entry_free(). remove record in swap_cgroup and
3091 * uncharge "memsw" account.
3093 void mem_cgroup_uncharge_swap(swp_entry_t ent)
3095 struct mem_cgroup *memcg;
3098 if (!do_swap_account)
3101 id = swap_cgroup_record(ent, 0);
3103 memcg = mem_cgroup_lookup(id);
3106 * We uncharge this because swap is freed.
3107 * This memcg can be obsolete one. We avoid calling css_tryget
3109 if (!mem_cgroup_is_root(memcg))
3110 res_counter_uncharge(&memcg->memsw, PAGE_SIZE);
3111 mem_cgroup_swap_statistics(memcg, false);
3112 mem_cgroup_put(memcg);
3118 * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record.
3119 * @entry: swap entry to be moved
3120 * @from: mem_cgroup which the entry is moved from
3121 * @to: mem_cgroup which the entry is moved to
3122 * @need_fixup: whether we should fixup res_counters and refcounts.
3124 * It succeeds only when the swap_cgroup's record for this entry is the same
3125 * as the mem_cgroup's id of @from.
3127 * Returns 0 on success, -EINVAL on failure.
3129 * The caller must have charged to @to, IOW, called res_counter_charge() about
3130 * both res and memsw, and called css_get().
3132 static int mem_cgroup_move_swap_account(swp_entry_t entry,
3133 struct mem_cgroup *from, struct mem_cgroup *to, bool need_fixup)
3135 unsigned short old_id, new_id;
3137 old_id = css_id(&from->css);
3138 new_id = css_id(&to->css);
3140 if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) {
3141 mem_cgroup_swap_statistics(from, false);
3142 mem_cgroup_swap_statistics(to, true);
3144 * This function is only called from task migration context now.
3145 * It postpones res_counter and refcount handling till the end
3146 * of task migration(mem_cgroup_clear_mc()) for performance
3147 * improvement. But we cannot postpone mem_cgroup_get(to)
3148 * because if the process that has been moved to @to does
3149 * swap-in, the refcount of @to might be decreased to 0.
3153 if (!mem_cgroup_is_root(from))
3154 res_counter_uncharge(&from->memsw, PAGE_SIZE);
3155 mem_cgroup_put(from);
3157 * we charged both to->res and to->memsw, so we should
3160 if (!mem_cgroup_is_root(to))
3161 res_counter_uncharge(&to->res, PAGE_SIZE);
3168 static inline int mem_cgroup_move_swap_account(swp_entry_t entry,
3169 struct mem_cgroup *from, struct mem_cgroup *to, bool need_fixup)
3176 * Before starting migration, account PAGE_SIZE to mem_cgroup that the old
3179 int mem_cgroup_prepare_migration(struct page *page,
3180 struct page *newpage, struct mem_cgroup **memcgp, gfp_t gfp_mask)
3182 struct mem_cgroup *memcg = NULL;
3183 struct page_cgroup *pc;
3184 enum charge_type ctype;
3189 VM_BUG_ON(PageTransHuge(page));
3190 if (mem_cgroup_disabled())
3193 pc = lookup_page_cgroup(page);
3194 lock_page_cgroup(pc);
3195 if (PageCgroupUsed(pc)) {
3196 memcg = pc->mem_cgroup;
3197 css_get(&memcg->css);
3199 * At migrating an anonymous page, its mapcount goes down
3200 * to 0 and uncharge() will be called. But, even if it's fully
3201 * unmapped, migration may fail and this page has to be
3202 * charged again. We set MIGRATION flag here and delay uncharge
3203 * until end_migration() is called
3205 * Corner Case Thinking
3207 * When the old page was mapped as Anon and it's unmap-and-freed
3208 * while migration was ongoing.
3209 * If unmap finds the old page, uncharge() of it will be delayed
3210 * until end_migration(). If unmap finds a new page, it's
3211 * uncharged when it make mapcount to be 1->0. If unmap code
3212 * finds swap_migration_entry, the new page will not be mapped
3213 * and end_migration() will find it(mapcount==0).
3216 * When the old page was mapped but migraion fails, the kernel
3217 * remaps it. A charge for it is kept by MIGRATION flag even
3218 * if mapcount goes down to 0. We can do remap successfully
3219 * without charging it again.
3222 * The "old" page is under lock_page() until the end of
3223 * migration, so, the old page itself will not be swapped-out.
3224 * If the new page is swapped out before end_migraton, our
3225 * hook to usual swap-out path will catch the event.
3228 SetPageCgroupMigration(pc);
3230 unlock_page_cgroup(pc);
3232 * If the page is not charged at this point,
3239 ret = __mem_cgroup_try_charge(NULL, gfp_mask, 1, memcgp, false);
3240 css_put(&memcg->css);/* drop extra refcnt */
3242 if (PageAnon(page)) {
3243 lock_page_cgroup(pc);
3244 ClearPageCgroupMigration(pc);
3245 unlock_page_cgroup(pc);
3247 * The old page may be fully unmapped while we kept it.
3249 mem_cgroup_uncharge_page(page);
3251 /* we'll need to revisit this error code (we have -EINTR) */
3255 * We charge new page before it's used/mapped. So, even if unlock_page()
3256 * is called before end_migration, we can catch all events on this new
3257 * page. In the case new page is migrated but not remapped, new page's
3258 * mapcount will be finally 0 and we call uncharge in end_migration().
3260 pc = lookup_page_cgroup(newpage);
3262 ctype = MEM_CGROUP_CHARGE_TYPE_MAPPED;
3263 else if (page_is_file_cache(page))
3264 ctype = MEM_CGROUP_CHARGE_TYPE_CACHE;
3266 ctype = MEM_CGROUP_CHARGE_TYPE_SHMEM;
3267 __mem_cgroup_commit_charge(memcg, newpage, 1, pc, ctype, false);
3271 /* remove redundant charge if migration failed*/
3272 void mem_cgroup_end_migration(struct mem_cgroup *memcg,
3273 struct page *oldpage, struct page *newpage, bool migration_ok)
3275 struct page *used, *unused;
3276 struct page_cgroup *pc;
3280 /* blocks rmdir() */
3281 cgroup_exclude_rmdir(&memcg->css);
3282 if (!migration_ok) {
3290 * We disallowed uncharge of pages under migration because mapcount
3291 * of the page goes down to zero, temporarly.
3292 * Clear the flag and check the page should be charged.
3294 pc = lookup_page_cgroup(oldpage);
3295 lock_page_cgroup(pc);
3296 ClearPageCgroupMigration(pc);
3297 unlock_page_cgroup(pc);
3299 __mem_cgroup_uncharge_common(unused, MEM_CGROUP_CHARGE_TYPE_FORCE);
3302 * If a page is a file cache, radix-tree replacement is very atomic
3303 * and we can skip this check. When it was an Anon page, its mapcount
3304 * goes down to 0. But because we added MIGRATION flage, it's not
3305 * uncharged yet. There are several case but page->mapcount check
3306 * and USED bit check in mem_cgroup_uncharge_page() will do enough
3307 * check. (see prepare_charge() also)
3310 mem_cgroup_uncharge_page(used);
3312 * At migration, we may charge account against cgroup which has no
3314 * So, rmdir()->pre_destroy() can be called while we do this charge.
3315 * In that case, we need to call pre_destroy() again. check it here.
3317 cgroup_release_and_wakeup_rmdir(&memcg->css);
3321 * At replace page cache, newpage is not under any memcg but it's on
3322 * LRU. So, this function doesn't touch res_counter but handles LRU
3323 * in correct way. Both pages are locked so we cannot race with uncharge.
3325 void mem_cgroup_replace_page_cache(struct page *oldpage,
3326 struct page *newpage)
3328 struct mem_cgroup *memcg;
3329 struct page_cgroup *pc;
3330 enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE;
3332 if (mem_cgroup_disabled())
3335 pc = lookup_page_cgroup(oldpage);
3336 /* fix accounting on old pages */
3337 lock_page_cgroup(pc);
3338 memcg = pc->mem_cgroup;
3339 mem_cgroup_charge_statistics(memcg, PageCgroupCache(pc), -1);
3340 ClearPageCgroupUsed(pc);
3341 unlock_page_cgroup(pc);
3343 if (PageSwapBacked(oldpage))
3344 type = MEM_CGROUP_CHARGE_TYPE_SHMEM;
3347 * Even if newpage->mapping was NULL before starting replacement,
3348 * the newpage may be on LRU(or pagevec for LRU) already. We lock
3349 * LRU while we overwrite pc->mem_cgroup.
3351 __mem_cgroup_commit_charge(memcg, newpage, 1, pc, type, true);
3354 #ifdef CONFIG_DEBUG_VM
3355 static struct page_cgroup *lookup_page_cgroup_used(struct page *page)
3357 struct page_cgroup *pc;
3359 pc = lookup_page_cgroup(page);
3361 * Can be NULL while feeding pages into the page allocator for
3362 * the first time, i.e. during boot or memory hotplug;
3363 * or when mem_cgroup_disabled().
3365 if (likely(pc) && PageCgroupUsed(pc))
3370 bool mem_cgroup_bad_page_check(struct page *page)
3372 if (mem_cgroup_disabled())
3375 return lookup_page_cgroup_used(page) != NULL;
3378 void mem_cgroup_print_bad_page(struct page *page)
3380 struct page_cgroup *pc;
3382 pc = lookup_page_cgroup_used(page);
3384 printk(KERN_ALERT "pc:%p pc->flags:%lx pc->mem_cgroup:%p\n",
3385 pc, pc->flags, pc->mem_cgroup);
3390 static DEFINE_MUTEX(set_limit_mutex);
3392 static int mem_cgroup_resize_limit(struct mem_cgroup *memcg,
3393 unsigned long long val)
3396 u64 memswlimit, memlimit;
3398 int children = mem_cgroup_count_children(memcg);
3399 u64 curusage, oldusage;
3403 * For keeping hierarchical_reclaim simple, how long we should retry
3404 * is depends on callers. We set our retry-count to be function
3405 * of # of children which we should visit in this loop.
3407 retry_count = MEM_CGROUP_RECLAIM_RETRIES * children;
3409 oldusage = res_counter_read_u64(&memcg->res, RES_USAGE);
3412 while (retry_count) {
3413 if (signal_pending(current)) {
3418 * Rather than hide all in some function, I do this in
3419 * open coded manner. You see what this really does.
3420 * We have to guarantee memcg->res.limit < memcg->memsw.limit.
3422 mutex_lock(&set_limit_mutex);
3423 memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3424 if (memswlimit < val) {
3426 mutex_unlock(&set_limit_mutex);
3430 memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT);
3434 ret = res_counter_set_limit(&memcg->res, val);
3436 if (memswlimit == val)
3437 memcg->memsw_is_minimum = true;
3439 memcg->memsw_is_minimum = false;
3441 mutex_unlock(&set_limit_mutex);
3446 mem_cgroup_reclaim(memcg, GFP_KERNEL,
3447 MEM_CGROUP_RECLAIM_SHRINK);
3448 curusage = res_counter_read_u64(&memcg->res, RES_USAGE);
3449 /* Usage is reduced ? */
3450 if (curusage >= oldusage)
3453 oldusage = curusage;
3455 if (!ret && enlarge)
3456 memcg_oom_recover(memcg);
3461 static int mem_cgroup_resize_memsw_limit(struct mem_cgroup *memcg,
3462 unsigned long long val)
3465 u64 memlimit, memswlimit, oldusage, curusage;
3466 int children = mem_cgroup_count_children(memcg);
3470 /* see mem_cgroup_resize_res_limit */
3471 retry_count = children * MEM_CGROUP_RECLAIM_RETRIES;
3472 oldusage = res_counter_read_u64(&memcg->memsw, RES_USAGE);
3473 while (retry_count) {
3474 if (signal_pending(current)) {
3479 * Rather than hide all in some function, I do this in
3480 * open coded manner. You see what this really does.
3481 * We have to guarantee memcg->res.limit < memcg->memsw.limit.
3483 mutex_lock(&set_limit_mutex);
3484 memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT);
3485 if (memlimit > val) {
3487 mutex_unlock(&set_limit_mutex);
3490 memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3491 if (memswlimit < val)
3493 ret = res_counter_set_limit(&memcg->memsw, val);
3495 if (memlimit == val)
3496 memcg->memsw_is_minimum = true;
3498 memcg->memsw_is_minimum = false;
3500 mutex_unlock(&set_limit_mutex);
3505 mem_cgroup_reclaim(memcg, GFP_KERNEL,
3506 MEM_CGROUP_RECLAIM_NOSWAP |
3507 MEM_CGROUP_RECLAIM_SHRINK);
3508 curusage = res_counter_read_u64(&memcg->memsw, RES_USAGE);
3509 /* Usage is reduced ? */
3510 if (curusage >= oldusage)
3513 oldusage = curusage;
3515 if (!ret && enlarge)
3516 memcg_oom_recover(memcg);
3520 unsigned long mem_cgroup_soft_limit_reclaim(struct zone *zone, int order,
3522 unsigned long *total_scanned)
3524 unsigned long nr_reclaimed = 0;
3525 struct mem_cgroup_per_zone *mz, *next_mz = NULL;
3526 unsigned long reclaimed;
3528 struct mem_cgroup_tree_per_zone *mctz;
3529 unsigned long long excess;
3530 unsigned long nr_scanned;
3535 mctz = soft_limit_tree_node_zone(zone_to_nid(zone), zone_idx(zone));
3537 * This loop can run a while, specially if mem_cgroup's continuously
3538 * keep exceeding their soft limit and putting the system under
3545 mz = mem_cgroup_largest_soft_limit_node(mctz);
3550 reclaimed = mem_cgroup_soft_reclaim(mz->memcg, zone,
3551 gfp_mask, &nr_scanned);
3552 nr_reclaimed += reclaimed;
3553 *total_scanned += nr_scanned;
3554 spin_lock(&mctz->lock);
3557 * If we failed to reclaim anything from this memory cgroup
3558 * it is time to move on to the next cgroup
3564 * Loop until we find yet another one.
3566 * By the time we get the soft_limit lock
3567 * again, someone might have aded the
3568 * group back on the RB tree. Iterate to
3569 * make sure we get a different mem.
3570 * mem_cgroup_largest_soft_limit_node returns
3571 * NULL if no other cgroup is present on
3575 __mem_cgroup_largest_soft_limit_node(mctz);
3577 css_put(&next_mz->memcg->css);
3578 else /* next_mz == NULL or other memcg */
3582 __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz);
3583 excess = res_counter_soft_limit_excess(&mz->memcg->res);
3585 * One school of thought says that we should not add
3586 * back the node to the tree if reclaim returns 0.
3587 * But our reclaim could return 0, simply because due
3588 * to priority we are exposing a smaller subset of
3589 * memory to reclaim from. Consider this as a longer
3592 /* If excess == 0, no tree ops */
3593 __mem_cgroup_insert_exceeded(mz->memcg, mz, mctz, excess);
3594 spin_unlock(&mctz->lock);
3595 css_put(&mz->memcg->css);
3598 * Could not reclaim anything and there are no more
3599 * mem cgroups to try or we seem to be looping without
3600 * reclaiming anything.
3602 if (!nr_reclaimed &&
3604 loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS))
3606 } while (!nr_reclaimed);
3608 css_put(&next_mz->memcg->css);
3609 return nr_reclaimed;
3613 * This routine traverse page_cgroup in given list and drop them all.
3614 * *And* this routine doesn't reclaim page itself, just removes page_cgroup.
3616 static int mem_cgroup_force_empty_list(struct mem_cgroup *memcg,
3617 int node, int zid, enum lru_list lru)
3619 struct mem_cgroup_per_zone *mz;
3620 unsigned long flags, loop;
3621 struct list_head *list;
3626 zone = &NODE_DATA(node)->node_zones[zid];
3627 mz = mem_cgroup_zoneinfo(memcg, node, zid);
3628 list = &mz->lruvec.lists[lru];
3630 loop = mz->lru_size[lru];
3631 /* give some margin against EBUSY etc...*/
3635 struct page_cgroup *pc;
3639 spin_lock_irqsave(&zone->lru_lock, flags);
3640 if (list_empty(list)) {
3641 spin_unlock_irqrestore(&zone->lru_lock, flags);
3644 page = list_entry(list->prev, struct page, lru);
3646 list_move(&page->lru, list);
3648 spin_unlock_irqrestore(&zone->lru_lock, flags);
3651 spin_unlock_irqrestore(&zone->lru_lock, flags);
3653 pc = lookup_page_cgroup(page);
3655 ret = mem_cgroup_move_parent(page, pc, memcg, GFP_KERNEL);
3656 if (ret == -ENOMEM || ret == -EINTR)
3659 if (ret == -EBUSY || ret == -EINVAL) {
3660 /* found lock contention or "pc" is obsolete. */
3667 if (!ret && !list_empty(list))
3673 * make mem_cgroup's charge to be 0 if there is no task.
3674 * This enables deleting this mem_cgroup.
3676 static int mem_cgroup_force_empty(struct mem_cgroup *memcg, bool free_all)
3679 int node, zid, shrink;
3680 int nr_retries = MEM_CGROUP_RECLAIM_RETRIES;
3681 struct cgroup *cgrp = memcg->css.cgroup;
3683 css_get(&memcg->css);
3686 /* should free all ? */
3692 if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children))
3695 if (signal_pending(current))
3697 /* This is for making all *used* pages to be on LRU. */
3698 lru_add_drain_all();
3699 drain_all_stock_sync(memcg);
3701 mem_cgroup_start_move(memcg);
3702 for_each_node_state(node, N_HIGH_MEMORY) {
3703 for (zid = 0; !ret && zid < MAX_NR_ZONES; zid++) {
3706 ret = mem_cgroup_force_empty_list(memcg,
3715 mem_cgroup_end_move(memcg);
3716 memcg_oom_recover(memcg);
3717 /* it seems parent cgroup doesn't have enough mem */
3721 /* "ret" should also be checked to ensure all lists are empty. */
3722 } while (memcg->res.usage > 0 || ret);
3724 css_put(&memcg->css);
3728 /* returns EBUSY if there is a task or if we come here twice. */
3729 if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children) || shrink) {
3733 /* we call try-to-free pages for make this cgroup empty */
3734 lru_add_drain_all();
3735 /* try to free all pages in this cgroup */
3737 while (nr_retries && memcg->res.usage > 0) {
3740 if (signal_pending(current)) {
3744 progress = try_to_free_mem_cgroup_pages(memcg, GFP_KERNEL,
3748 /* maybe some writeback is necessary */
3749 congestion_wait(BLK_RW_ASYNC, HZ/10);
3754 /* try move_account...there may be some *locked* pages. */
3758 int mem_cgroup_force_empty_write(struct cgroup *cont, unsigned int event)
3760 return mem_cgroup_force_empty(mem_cgroup_from_cont(cont), true);
3764 static u64 mem_cgroup_hierarchy_read(struct cgroup *cont, struct cftype *cft)
3766 return mem_cgroup_from_cont(cont)->use_hierarchy;
3769 static int mem_cgroup_hierarchy_write(struct cgroup *cont, struct cftype *cft,
3773 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
3774 struct cgroup *parent = cont->parent;
3775 struct mem_cgroup *parent_memcg = NULL;
3778 parent_memcg = mem_cgroup_from_cont(parent);
3782 * If parent's use_hierarchy is set, we can't make any modifications
3783 * in the child subtrees. If it is unset, then the change can
3784 * occur, provided the current cgroup has no children.
3786 * For the root cgroup, parent_mem is NULL, we allow value to be
3787 * set if there are no children.
3789 if ((!parent_memcg || !parent_memcg->use_hierarchy) &&
3790 (val == 1 || val == 0)) {
3791 if (list_empty(&cont->children))
3792 memcg->use_hierarchy = val;
3803 static unsigned long mem_cgroup_recursive_stat(struct mem_cgroup *memcg,
3804 enum mem_cgroup_stat_index idx)
3806 struct mem_cgroup *iter;
3809 /* Per-cpu values can be negative, use a signed accumulator */
3810 for_each_mem_cgroup_tree(iter, memcg)
3811 val += mem_cgroup_read_stat(iter, idx);
3813 if (val < 0) /* race ? */
3818 static inline u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap)
3822 if (!mem_cgroup_is_root(memcg)) {
3824 return res_counter_read_u64(&memcg->res, RES_USAGE);
3826 return res_counter_read_u64(&memcg->memsw, RES_USAGE);
3829 val = mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_CACHE);
3830 val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_RSS);
3833 val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_SWAPOUT);
3835 return val << PAGE_SHIFT;
3838 static u64 mem_cgroup_read(struct cgroup *cont, struct cftype *cft)
3840 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
3844 type = MEMFILE_TYPE(cft->private);
3845 name = MEMFILE_ATTR(cft->private);
3848 if (name == RES_USAGE)
3849 val = mem_cgroup_usage(memcg, false);
3851 val = res_counter_read_u64(&memcg->res, name);
3854 if (name == RES_USAGE)
3855 val = mem_cgroup_usage(memcg, true);
3857 val = res_counter_read_u64(&memcg->memsw, name);
3866 * The user of this function is...
3869 static int mem_cgroup_write(struct cgroup *cont, struct cftype *cft,
3872 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
3874 unsigned long long val;
3877 type = MEMFILE_TYPE(cft->private);
3878 name = MEMFILE_ATTR(cft->private);
3881 if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */
3885 /* This function does all necessary parse...reuse it */
3886 ret = res_counter_memparse_write_strategy(buffer, &val);
3890 ret = mem_cgroup_resize_limit(memcg, val);
3892 ret = mem_cgroup_resize_memsw_limit(memcg, val);
3894 case RES_SOFT_LIMIT:
3895 ret = res_counter_memparse_write_strategy(buffer, &val);
3899 * For memsw, soft limits are hard to implement in terms
3900 * of semantics, for now, we support soft limits for
3901 * control without swap
3904 ret = res_counter_set_soft_limit(&memcg->res, val);
3909 ret = -EINVAL; /* should be BUG() ? */
3915 static void memcg_get_hierarchical_limit(struct mem_cgroup *memcg,
3916 unsigned long long *mem_limit, unsigned long long *memsw_limit)
3918 struct cgroup *cgroup;
3919 unsigned long long min_limit, min_memsw_limit, tmp;
3921 min_limit = res_counter_read_u64(&memcg->res, RES_LIMIT);
3922 min_memsw_limit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3923 cgroup = memcg->css.cgroup;
3924 if (!memcg->use_hierarchy)
3927 while (cgroup->parent) {
3928 cgroup = cgroup->parent;
3929 memcg = mem_cgroup_from_cont(cgroup);
3930 if (!memcg->use_hierarchy)
3932 tmp = res_counter_read_u64(&memcg->res, RES_LIMIT);
3933 min_limit = min(min_limit, tmp);
3934 tmp = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3935 min_memsw_limit = min(min_memsw_limit, tmp);
3938 *mem_limit = min_limit;
3939 *memsw_limit = min_memsw_limit;
3943 static int mem_cgroup_reset(struct cgroup *cont, unsigned int event)
3945 struct mem_cgroup *memcg;
3948 memcg = mem_cgroup_from_cont(cont);
3949 type = MEMFILE_TYPE(event);
3950 name = MEMFILE_ATTR(event);
3954 res_counter_reset_max(&memcg->res);
3956 res_counter_reset_max(&memcg->memsw);
3960 res_counter_reset_failcnt(&memcg->res);
3962 res_counter_reset_failcnt(&memcg->memsw);
3969 static u64 mem_cgroup_move_charge_read(struct cgroup *cgrp,
3972 return mem_cgroup_from_cont(cgrp)->move_charge_at_immigrate;
3976 static int mem_cgroup_move_charge_write(struct cgroup *cgrp,
3977 struct cftype *cft, u64 val)
3979 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
3981 if (val >= (1 << NR_MOVE_TYPE))
3984 * We check this value several times in both in can_attach() and
3985 * attach(), so we need cgroup lock to prevent this value from being
3989 memcg->move_charge_at_immigrate = val;
3995 static int mem_cgroup_move_charge_write(struct cgroup *cgrp,
3996 struct cftype *cft, u64 val)
4003 /* For read statistics */
4021 struct mcs_total_stat {
4022 s64 stat[NR_MCS_STAT];
4028 } memcg_stat_strings[NR_MCS_STAT] = {
4029 {"cache", "total_cache"},
4030 {"rss", "total_rss"},
4031 {"mapped_file", "total_mapped_file"},
4032 {"pgpgin", "total_pgpgin"},
4033 {"pgpgout", "total_pgpgout"},
4034 {"swap", "total_swap"},
4035 {"pgfault", "total_pgfault"},
4036 {"pgmajfault", "total_pgmajfault"},
4037 {"inactive_anon", "total_inactive_anon"},
4038 {"active_anon", "total_active_anon"},
4039 {"inactive_file", "total_inactive_file"},
4040 {"active_file", "total_active_file"},
4041 {"unevictable", "total_unevictable"}
4046 mem_cgroup_get_local_stat(struct mem_cgroup *memcg, struct mcs_total_stat *s)
4051 val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_CACHE);
4052 s->stat[MCS_CACHE] += val * PAGE_SIZE;
4053 val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_RSS);
4054 s->stat[MCS_RSS] += val * PAGE_SIZE;
4055 val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_FILE_MAPPED);
4056 s->stat[MCS_FILE_MAPPED] += val * PAGE_SIZE;
4057 val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGPGIN);
4058 s->stat[MCS_PGPGIN] += val;
4059 val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGPGOUT);
4060 s->stat[MCS_PGPGOUT] += val;
4061 if (do_swap_account) {
4062 val = mem_cgroup_read_stat(memcg, MEM_CGROUP_STAT_SWAPOUT);
4063 s->stat[MCS_SWAP] += val * PAGE_SIZE;
4065 val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGFAULT);
4066 s->stat[MCS_PGFAULT] += val;
4067 val = mem_cgroup_read_events(memcg, MEM_CGROUP_EVENTS_PGMAJFAULT);
4068 s->stat[MCS_PGMAJFAULT] += val;
4071 val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_INACTIVE_ANON));
4072 s->stat[MCS_INACTIVE_ANON] += val * PAGE_SIZE;
4073 val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_ACTIVE_ANON));
4074 s->stat[MCS_ACTIVE_ANON] += val * PAGE_SIZE;
4075 val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_INACTIVE_FILE));
4076 s->stat[MCS_INACTIVE_FILE] += val * PAGE_SIZE;
4077 val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_ACTIVE_FILE));
4078 s->stat[MCS_ACTIVE_FILE] += val * PAGE_SIZE;
4079 val = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_UNEVICTABLE));
4080 s->stat[MCS_UNEVICTABLE] += val * PAGE_SIZE;
4084 mem_cgroup_get_total_stat(struct mem_cgroup *memcg, struct mcs_total_stat *s)
4086 struct mem_cgroup *iter;
4088 for_each_mem_cgroup_tree(iter, memcg)
4089 mem_cgroup_get_local_stat(iter, s);
4093 static int mem_control_numa_stat_show(struct seq_file *m, void *arg)
4096 unsigned long total_nr, file_nr, anon_nr, unevictable_nr;
4097 unsigned long node_nr;
4098 struct cgroup *cont = m->private;
4099 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4101 total_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL);
4102 seq_printf(m, "total=%lu", total_nr);
4103 for_each_node_state(nid, N_HIGH_MEMORY) {
4104 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL);
4105 seq_printf(m, " N%d=%lu", nid, node_nr);
4109 file_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL_FILE);
4110 seq_printf(m, "file=%lu", file_nr);
4111 for_each_node_state(nid, N_HIGH_MEMORY) {
4112 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
4114 seq_printf(m, " N%d=%lu", nid, node_nr);
4118 anon_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL_ANON);
4119 seq_printf(m, "anon=%lu", anon_nr);
4120 for_each_node_state(nid, N_HIGH_MEMORY) {
4121 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
4123 seq_printf(m, " N%d=%lu", nid, node_nr);
4127 unevictable_nr = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_UNEVICTABLE));
4128 seq_printf(m, "unevictable=%lu", unevictable_nr);
4129 for_each_node_state(nid, N_HIGH_MEMORY) {
4130 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
4131 BIT(LRU_UNEVICTABLE));
4132 seq_printf(m, " N%d=%lu", nid, node_nr);
4137 #endif /* CONFIG_NUMA */
4139 static int mem_control_stat_show(struct cgroup *cont, struct cftype *cft,
4140 struct cgroup_map_cb *cb)
4142 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4143 struct mcs_total_stat mystat;
4146 memset(&mystat, 0, sizeof(mystat));
4147 mem_cgroup_get_local_stat(memcg, &mystat);
4150 for (i = 0; i < NR_MCS_STAT; i++) {
4151 if (i == MCS_SWAP && !do_swap_account)
4153 cb->fill(cb, memcg_stat_strings[i].local_name, mystat.stat[i]);
4156 /* Hierarchical information */
4158 unsigned long long limit, memsw_limit;
4159 memcg_get_hierarchical_limit(memcg, &limit, &memsw_limit);
4160 cb->fill(cb, "hierarchical_memory_limit", limit);
4161 if (do_swap_account)
4162 cb->fill(cb, "hierarchical_memsw_limit", memsw_limit);
4165 memset(&mystat, 0, sizeof(mystat));
4166 mem_cgroup_get_total_stat(memcg, &mystat);
4167 for (i = 0; i < NR_MCS_STAT; i++) {
4168 if (i == MCS_SWAP && !do_swap_account)
4170 cb->fill(cb, memcg_stat_strings[i].total_name, mystat.stat[i]);
4173 #ifdef CONFIG_DEBUG_VM
4176 struct mem_cgroup_per_zone *mz;
4177 unsigned long recent_rotated[2] = {0, 0};
4178 unsigned long recent_scanned[2] = {0, 0};
4180 for_each_online_node(nid)
4181 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
4182 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
4184 recent_rotated[0] +=
4185 mz->reclaim_stat.recent_rotated[0];
4186 recent_rotated[1] +=
4187 mz->reclaim_stat.recent_rotated[1];
4188 recent_scanned[0] +=
4189 mz->reclaim_stat.recent_scanned[0];
4190 recent_scanned[1] +=
4191 mz->reclaim_stat.recent_scanned[1];
4193 cb->fill(cb, "recent_rotated_anon", recent_rotated[0]);
4194 cb->fill(cb, "recent_rotated_file", recent_rotated[1]);
4195 cb->fill(cb, "recent_scanned_anon", recent_scanned[0]);
4196 cb->fill(cb, "recent_scanned_file", recent_scanned[1]);
4203 static u64 mem_cgroup_swappiness_read(struct cgroup *cgrp, struct cftype *cft)
4205 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4207 return mem_cgroup_swappiness(memcg);
4210 static int mem_cgroup_swappiness_write(struct cgroup *cgrp, struct cftype *cft,
4213 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4214 struct mem_cgroup *parent;
4219 if (cgrp->parent == NULL)
4222 parent = mem_cgroup_from_cont(cgrp->parent);
4226 /* If under hierarchy, only empty-root can set this value */
4227 if ((parent->use_hierarchy) ||
4228 (memcg->use_hierarchy && !list_empty(&cgrp->children))) {
4233 memcg->swappiness = val;
4240 static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap)
4242 struct mem_cgroup_threshold_ary *t;
4248 t = rcu_dereference(memcg->thresholds.primary);
4250 t = rcu_dereference(memcg->memsw_thresholds.primary);
4255 usage = mem_cgroup_usage(memcg, swap);
4258 * current_threshold points to threshold just below usage.
4259 * If it's not true, a threshold was crossed after last
4260 * call of __mem_cgroup_threshold().
4262 i = t->current_threshold;
4265 * Iterate backward over array of thresholds starting from
4266 * current_threshold and check if a threshold is crossed.
4267 * If none of thresholds below usage is crossed, we read
4268 * only one element of the array here.
4270 for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)
4271 eventfd_signal(t->entries[i].eventfd, 1);
4273 /* i = current_threshold + 1 */
4277 * Iterate forward over array of thresholds starting from
4278 * current_threshold+1 and check if a threshold is crossed.
4279 * If none of thresholds above usage is crossed, we read
4280 * only one element of the array here.
4282 for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)
4283 eventfd_signal(t->entries[i].eventfd, 1);
4285 /* Update current_threshold */
4286 t->current_threshold = i - 1;
4291 static void mem_cgroup_threshold(struct mem_cgroup *memcg)
4294 __mem_cgroup_threshold(memcg, false);
4295 if (do_swap_account)
4296 __mem_cgroup_threshold(memcg, true);
4298 memcg = parent_mem_cgroup(memcg);
4302 static int compare_thresholds(const void *a, const void *b)
4304 const struct mem_cgroup_threshold *_a = a;
4305 const struct mem_cgroup_threshold *_b = b;
4307 return _a->threshold - _b->threshold;
4310 static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg)
4312 struct mem_cgroup_eventfd_list *ev;
4314 list_for_each_entry(ev, &memcg->oom_notify, list)
4315 eventfd_signal(ev->eventfd, 1);
4319 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg)
4321 struct mem_cgroup *iter;
4323 for_each_mem_cgroup_tree(iter, memcg)
4324 mem_cgroup_oom_notify_cb(iter);
4327 static int mem_cgroup_usage_register_event(struct cgroup *cgrp,
4328 struct cftype *cft, struct eventfd_ctx *eventfd, const char *args)
4330 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4331 struct mem_cgroup_thresholds *thresholds;
4332 struct mem_cgroup_threshold_ary *new;
4333 int type = MEMFILE_TYPE(cft->private);
4334 u64 threshold, usage;
4337 ret = res_counter_memparse_write_strategy(args, &threshold);
4341 mutex_lock(&memcg->thresholds_lock);
4344 thresholds = &memcg->thresholds;
4345 else if (type == _MEMSWAP)
4346 thresholds = &memcg->memsw_thresholds;
4350 usage = mem_cgroup_usage(memcg, type == _MEMSWAP);
4352 /* Check if a threshold crossed before adding a new one */
4353 if (thresholds->primary)
4354 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
4356 size = thresholds->primary ? thresholds->primary->size + 1 : 1;
4358 /* Allocate memory for new array of thresholds */
4359 new = kmalloc(sizeof(*new) + size * sizeof(struct mem_cgroup_threshold),
4367 /* Copy thresholds (if any) to new array */
4368 if (thresholds->primary) {
4369 memcpy(new->entries, thresholds->primary->entries, (size - 1) *
4370 sizeof(struct mem_cgroup_threshold));
4373 /* Add new threshold */
4374 new->entries[size - 1].eventfd = eventfd;
4375 new->entries[size - 1].threshold = threshold;
4377 /* Sort thresholds. Registering of new threshold isn't time-critical */
4378 sort(new->entries, size, sizeof(struct mem_cgroup_threshold),
4379 compare_thresholds, NULL);
4381 /* Find current threshold */
4382 new->current_threshold = -1;
4383 for (i = 0; i < size; i++) {
4384 if (new->entries[i].threshold < usage) {
4386 * new->current_threshold will not be used until
4387 * rcu_assign_pointer(), so it's safe to increment
4390 ++new->current_threshold;
4394 /* Free old spare buffer and save old primary buffer as spare */
4395 kfree(thresholds->spare);
4396 thresholds->spare = thresholds->primary;
4398 rcu_assign_pointer(thresholds->primary, new);
4400 /* To be sure that nobody uses thresholds */
4404 mutex_unlock(&memcg->thresholds_lock);
4409 static void mem_cgroup_usage_unregister_event(struct cgroup *cgrp,
4410 struct cftype *cft, struct eventfd_ctx *eventfd)
4412 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4413 struct mem_cgroup_thresholds *thresholds;
4414 struct mem_cgroup_threshold_ary *new;
4415 int type = MEMFILE_TYPE(cft->private);
4419 mutex_lock(&memcg->thresholds_lock);
4421 thresholds = &memcg->thresholds;
4422 else if (type == _MEMSWAP)
4423 thresholds = &memcg->memsw_thresholds;
4428 * Something went wrong if we trying to unregister a threshold
4429 * if we don't have thresholds
4431 BUG_ON(!thresholds);
4433 if (!thresholds->primary)
4436 usage = mem_cgroup_usage(memcg, type == _MEMSWAP);
4438 /* Check if a threshold crossed before removing */
4439 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
4441 /* Calculate new number of threshold */
4443 for (i = 0; i < thresholds->primary->size; i++) {
4444 if (thresholds->primary->entries[i].eventfd != eventfd)
4448 new = thresholds->spare;
4450 /* Set thresholds array to NULL if we don't have thresholds */
4459 /* Copy thresholds and find current threshold */
4460 new->current_threshold = -1;
4461 for (i = 0, j = 0; i < thresholds->primary->size; i++) {
4462 if (thresholds->primary->entries[i].eventfd == eventfd)
4465 new->entries[j] = thresholds->primary->entries[i];
4466 if (new->entries[j].threshold < usage) {
4468 * new->current_threshold will not be used
4469 * until rcu_assign_pointer(), so it's safe to increment
4472 ++new->current_threshold;
4478 /* Swap primary and spare array */
4479 thresholds->spare = thresholds->primary;
4480 rcu_assign_pointer(thresholds->primary, new);
4482 /* To be sure that nobody uses thresholds */
4485 mutex_unlock(&memcg->thresholds_lock);
4488 static int mem_cgroup_oom_register_event(struct cgroup *cgrp,
4489 struct cftype *cft, struct eventfd_ctx *eventfd, const char *args)
4491 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4492 struct mem_cgroup_eventfd_list *event;
4493 int type = MEMFILE_TYPE(cft->private);
4495 BUG_ON(type != _OOM_TYPE);
4496 event = kmalloc(sizeof(*event), GFP_KERNEL);
4500 spin_lock(&memcg_oom_lock);
4502 event->eventfd = eventfd;
4503 list_add(&event->list, &memcg->oom_notify);
4505 /* already in OOM ? */
4506 if (atomic_read(&memcg->under_oom))
4507 eventfd_signal(eventfd, 1);
4508 spin_unlock(&memcg_oom_lock);
4513 static void mem_cgroup_oom_unregister_event(struct cgroup *cgrp,
4514 struct cftype *cft, struct eventfd_ctx *eventfd)
4516 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4517 struct mem_cgroup_eventfd_list *ev, *tmp;
4518 int type = MEMFILE_TYPE(cft->private);
4520 BUG_ON(type != _OOM_TYPE);
4522 spin_lock(&memcg_oom_lock);
4524 list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) {
4525 if (ev->eventfd == eventfd) {
4526 list_del(&ev->list);
4531 spin_unlock(&memcg_oom_lock);
4534 static int mem_cgroup_oom_control_read(struct cgroup *cgrp,
4535 struct cftype *cft, struct cgroup_map_cb *cb)
4537 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4539 cb->fill(cb, "oom_kill_disable", memcg->oom_kill_disable);
4541 if (atomic_read(&memcg->under_oom))
4542 cb->fill(cb, "under_oom", 1);
4544 cb->fill(cb, "under_oom", 0);
4548 static int mem_cgroup_oom_control_write(struct cgroup *cgrp,
4549 struct cftype *cft, u64 val)
4551 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4552 struct mem_cgroup *parent;
4554 /* cannot set to root cgroup and only 0 and 1 are allowed */
4555 if (!cgrp->parent || !((val == 0) || (val == 1)))
4558 parent = mem_cgroup_from_cont(cgrp->parent);
4561 /* oom-kill-disable is a flag for subhierarchy. */
4562 if ((parent->use_hierarchy) ||
4563 (memcg->use_hierarchy && !list_empty(&cgrp->children))) {
4567 memcg->oom_kill_disable = val;
4569 memcg_oom_recover(memcg);
4575 static const struct file_operations mem_control_numa_stat_file_operations = {
4577 .llseek = seq_lseek,
4578 .release = single_release,
4581 static int mem_control_numa_stat_open(struct inode *unused, struct file *file)
4583 struct cgroup *cont = file->f_dentry->d_parent->d_fsdata;
4585 file->f_op = &mem_control_numa_stat_file_operations;
4586 return single_open(file, mem_control_numa_stat_show, cont);
4588 #endif /* CONFIG_NUMA */
4590 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_KMEM
4591 static int register_kmem_files(struct cgroup *cont, struct cgroup_subsys *ss)
4594 * Part of this would be better living in a separate allocation
4595 * function, leaving us with just the cgroup tree population work.
4596 * We, however, depend on state such as network's proto_list that
4597 * is only initialized after cgroup creation. I found the less
4598 * cumbersome way to deal with it to defer it all to populate time
4600 return mem_cgroup_sockets_init(cont, ss);
4603 static void kmem_cgroup_destroy(struct cgroup *cont)
4605 mem_cgroup_sockets_destroy(cont);
4608 static int register_kmem_files(struct cgroup *cont, struct cgroup_subsys *ss)
4613 static void kmem_cgroup_destroy(struct cgroup *cont)
4618 static struct cftype mem_cgroup_files[] = {
4620 .name = "usage_in_bytes",
4621 .private = MEMFILE_PRIVATE(_MEM, RES_USAGE),
4622 .read_u64 = mem_cgroup_read,
4623 .register_event = mem_cgroup_usage_register_event,
4624 .unregister_event = mem_cgroup_usage_unregister_event,
4627 .name = "max_usage_in_bytes",
4628 .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE),
4629 .trigger = mem_cgroup_reset,
4630 .read_u64 = mem_cgroup_read,
4633 .name = "limit_in_bytes",
4634 .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT),
4635 .write_string = mem_cgroup_write,
4636 .read_u64 = mem_cgroup_read,
4639 .name = "soft_limit_in_bytes",
4640 .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT),
4641 .write_string = mem_cgroup_write,
4642 .read_u64 = mem_cgroup_read,
4646 .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT),
4647 .trigger = mem_cgroup_reset,
4648 .read_u64 = mem_cgroup_read,
4652 .read_map = mem_control_stat_show,
4655 .name = "force_empty",
4656 .trigger = mem_cgroup_force_empty_write,
4659 .name = "use_hierarchy",
4660 .write_u64 = mem_cgroup_hierarchy_write,
4661 .read_u64 = mem_cgroup_hierarchy_read,
4664 .name = "swappiness",
4665 .read_u64 = mem_cgroup_swappiness_read,
4666 .write_u64 = mem_cgroup_swappiness_write,
4669 .name = "move_charge_at_immigrate",
4670 .read_u64 = mem_cgroup_move_charge_read,
4671 .write_u64 = mem_cgroup_move_charge_write,
4674 .name = "oom_control",
4675 .read_map = mem_cgroup_oom_control_read,
4676 .write_u64 = mem_cgroup_oom_control_write,
4677 .register_event = mem_cgroup_oom_register_event,
4678 .unregister_event = mem_cgroup_oom_unregister_event,
4679 .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL),
4683 .name = "numa_stat",
4684 .open = mem_control_numa_stat_open,
4690 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP
4691 static struct cftype memsw_cgroup_files[] = {
4693 .name = "memsw.usage_in_bytes",
4694 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE),
4695 .read_u64 = mem_cgroup_read,
4696 .register_event = mem_cgroup_usage_register_event,
4697 .unregister_event = mem_cgroup_usage_unregister_event,
4700 .name = "memsw.max_usage_in_bytes",
4701 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE),
4702 .trigger = mem_cgroup_reset,
4703 .read_u64 = mem_cgroup_read,
4706 .name = "memsw.limit_in_bytes",
4707 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT),
4708 .write_string = mem_cgroup_write,
4709 .read_u64 = mem_cgroup_read,
4712 .name = "memsw.failcnt",
4713 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT),
4714 .trigger = mem_cgroup_reset,
4715 .read_u64 = mem_cgroup_read,
4719 static int register_memsw_files(struct cgroup *cont, struct cgroup_subsys *ss)
4721 if (!do_swap_account)
4723 return cgroup_add_files(cont, ss, memsw_cgroup_files,
4724 ARRAY_SIZE(memsw_cgroup_files));
4727 static int register_memsw_files(struct cgroup *cont, struct cgroup_subsys *ss)
4733 static int alloc_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node)
4735 struct mem_cgroup_per_node *pn;
4736 struct mem_cgroup_per_zone *mz;
4738 int zone, tmp = node;
4740 * This routine is called against possible nodes.
4741 * But it's BUG to call kmalloc() against offline node.
4743 * TODO: this routine can waste much memory for nodes which will
4744 * never be onlined. It's better to use memory hotplug callback
4747 if (!node_state(node, N_NORMAL_MEMORY))
4749 pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp);
4753 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
4754 mz = &pn->zoneinfo[zone];
4756 INIT_LIST_HEAD(&mz->lruvec.lists[l]);
4757 mz->usage_in_excess = 0;
4758 mz->on_tree = false;
4761 memcg->info.nodeinfo[node] = pn;
4765 static void free_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node)
4767 kfree(memcg->info.nodeinfo[node]);
4770 static struct mem_cgroup *mem_cgroup_alloc(void)
4772 struct mem_cgroup *memcg;
4773 int size = sizeof(struct mem_cgroup);
4775 /* Can be very big if MAX_NUMNODES is very big */
4776 if (size < PAGE_SIZE)
4777 memcg = kzalloc(size, GFP_KERNEL);
4779 memcg = vzalloc(size);
4784 memcg->stat = alloc_percpu(struct mem_cgroup_stat_cpu);
4787 spin_lock_init(&memcg->pcp_counter_lock);
4791 if (size < PAGE_SIZE)
4799 * Helpers for freeing a vzalloc()ed mem_cgroup by RCU,
4800 * but in process context. The work_freeing structure is overlaid
4801 * on the rcu_freeing structure, which itself is overlaid on memsw.
4803 static void vfree_work(struct work_struct *work)
4805 struct mem_cgroup *memcg;
4807 memcg = container_of(work, struct mem_cgroup, work_freeing);
4810 static void vfree_rcu(struct rcu_head *rcu_head)
4812 struct mem_cgroup *memcg;
4814 memcg = container_of(rcu_head, struct mem_cgroup, rcu_freeing);
4815 INIT_WORK(&memcg->work_freeing, vfree_work);
4816 schedule_work(&memcg->work_freeing);
4820 * At destroying mem_cgroup, references from swap_cgroup can remain.
4821 * (scanning all at force_empty is too costly...)
4823 * Instead of clearing all references at force_empty, we remember
4824 * the number of reference from swap_cgroup and free mem_cgroup when
4825 * it goes down to 0.
4827 * Removal of cgroup itself succeeds regardless of refs from swap.
4830 static void __mem_cgroup_free(struct mem_cgroup *memcg)
4834 mem_cgroup_remove_from_trees(memcg);
4835 free_css_id(&mem_cgroup_subsys, &memcg->css);
4838 free_mem_cgroup_per_zone_info(memcg, node);
4840 free_percpu(memcg->stat);
4841 if (sizeof(struct mem_cgroup) < PAGE_SIZE)
4842 kfree_rcu(memcg, rcu_freeing);
4844 call_rcu(&memcg->rcu_freeing, vfree_rcu);
4847 static void mem_cgroup_get(struct mem_cgroup *memcg)
4849 atomic_inc(&memcg->refcnt);
4852 static void __mem_cgroup_put(struct mem_cgroup *memcg, int count)
4854 if (atomic_sub_and_test(count, &memcg->refcnt)) {
4855 struct mem_cgroup *parent = parent_mem_cgroup(memcg);
4856 __mem_cgroup_free(memcg);
4858 mem_cgroup_put(parent);
4862 static void mem_cgroup_put(struct mem_cgroup *memcg)
4864 __mem_cgroup_put(memcg, 1);
4868 * Returns the parent mem_cgroup in memcgroup hierarchy with hierarchy enabled.
4870 struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *memcg)
4872 if (!memcg->res.parent)
4874 return mem_cgroup_from_res_counter(memcg->res.parent, res);
4876 EXPORT_SYMBOL(parent_mem_cgroup);
4878 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP
4879 static void __init enable_swap_cgroup(void)
4881 if (!mem_cgroup_disabled() && really_do_swap_account)
4882 do_swap_account = 1;
4885 static void __init enable_swap_cgroup(void)
4890 static int mem_cgroup_soft_limit_tree_init(void)
4892 struct mem_cgroup_tree_per_node *rtpn;
4893 struct mem_cgroup_tree_per_zone *rtpz;
4894 int tmp, node, zone;
4896 for_each_node(node) {
4898 if (!node_state(node, N_NORMAL_MEMORY))
4900 rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL, tmp);
4904 soft_limit_tree.rb_tree_per_node[node] = rtpn;
4906 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
4907 rtpz = &rtpn->rb_tree_per_zone[zone];
4908 rtpz->rb_root = RB_ROOT;
4909 spin_lock_init(&rtpz->lock);
4915 for_each_node(node) {
4916 if (!soft_limit_tree.rb_tree_per_node[node])
4918 kfree(soft_limit_tree.rb_tree_per_node[node]);
4919 soft_limit_tree.rb_tree_per_node[node] = NULL;
4925 static struct cgroup_subsys_state * __ref
4926 mem_cgroup_create(struct cgroup *cont)
4928 struct mem_cgroup *memcg, *parent;
4929 long error = -ENOMEM;
4932 memcg = mem_cgroup_alloc();
4934 return ERR_PTR(error);
4937 if (alloc_mem_cgroup_per_zone_info(memcg, node))
4941 if (cont->parent == NULL) {
4943 enable_swap_cgroup();
4945 if (mem_cgroup_soft_limit_tree_init())
4947 root_mem_cgroup = memcg;
4948 for_each_possible_cpu(cpu) {
4949 struct memcg_stock_pcp *stock =
4950 &per_cpu(memcg_stock, cpu);
4951 INIT_WORK(&stock->work, drain_local_stock);
4953 hotcpu_notifier(memcg_cpu_hotplug_callback, 0);
4955 parent = mem_cgroup_from_cont(cont->parent);
4956 memcg->use_hierarchy = parent->use_hierarchy;
4957 memcg->oom_kill_disable = parent->oom_kill_disable;
4960 if (parent && parent->use_hierarchy) {
4961 res_counter_init(&memcg->res, &parent->res);
4962 res_counter_init(&memcg->memsw, &parent->memsw);
4964 * We increment refcnt of the parent to ensure that we can
4965 * safely access it on res_counter_charge/uncharge.
4966 * This refcnt will be decremented when freeing this
4967 * mem_cgroup(see mem_cgroup_put).
4969 mem_cgroup_get(parent);
4971 res_counter_init(&memcg->res, NULL);
4972 res_counter_init(&memcg->memsw, NULL);
4974 memcg->last_scanned_node = MAX_NUMNODES;
4975 INIT_LIST_HEAD(&memcg->oom_notify);
4978 memcg->swappiness = mem_cgroup_swappiness(parent);
4979 atomic_set(&memcg->refcnt, 1);
4980 memcg->move_charge_at_immigrate = 0;
4981 mutex_init(&memcg->thresholds_lock);
4984 __mem_cgroup_free(memcg);
4985 return ERR_PTR(error);
4988 static int mem_cgroup_pre_destroy(struct cgroup *cont)
4990 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4992 return mem_cgroup_force_empty(memcg, false);
4995 static void mem_cgroup_destroy(struct cgroup *cont)
4997 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4999 kmem_cgroup_destroy(cont);
5001 mem_cgroup_put(memcg);
5004 static int mem_cgroup_populate(struct cgroup_subsys *ss,
5005 struct cgroup *cont)
5009 ret = cgroup_add_files(cont, ss, mem_cgroup_files,
5010 ARRAY_SIZE(mem_cgroup_files));
5013 ret = register_memsw_files(cont, ss);
5016 ret = register_kmem_files(cont, ss);
5022 /* Handlers for move charge at task migration. */
5023 #define PRECHARGE_COUNT_AT_ONCE 256
5024 static int mem_cgroup_do_precharge(unsigned long count)
5027 int batch_count = PRECHARGE_COUNT_AT_ONCE;
5028 struct mem_cgroup *memcg = mc.to;
5030 if (mem_cgroup_is_root(memcg)) {
5031 mc.precharge += count;
5032 /* we don't need css_get for root */
5035 /* try to charge at once */
5037 struct res_counter *dummy;
5039 * "memcg" cannot be under rmdir() because we've already checked
5040 * by cgroup_lock_live_cgroup() that it is not removed and we
5041 * are still under the same cgroup_mutex. So we can postpone
5044 if (res_counter_charge(&memcg->res, PAGE_SIZE * count, &dummy))
5046 if (do_swap_account && res_counter_charge(&memcg->memsw,
5047 PAGE_SIZE * count, &dummy)) {
5048 res_counter_uncharge(&memcg->res, PAGE_SIZE * count);
5051 mc.precharge += count;
5055 /* fall back to one by one charge */
5057 if (signal_pending(current)) {
5061 if (!batch_count--) {
5062 batch_count = PRECHARGE_COUNT_AT_ONCE;
5065 ret = __mem_cgroup_try_charge(NULL,
5066 GFP_KERNEL, 1, &memcg, false);
5068 /* mem_cgroup_clear_mc() will do uncharge later */
5076 * is_target_pte_for_mc - check a pte whether it is valid for move charge
5077 * @vma: the vma the pte to be checked belongs
5078 * @addr: the address corresponding to the pte to be checked
5079 * @ptent: the pte to be checked
5080 * @target: the pointer the target page or swap ent will be stored(can be NULL)
5083 * 0(MC_TARGET_NONE): if the pte is not a target for move charge.
5084 * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for
5085 * move charge. if @target is not NULL, the page is stored in target->page
5086 * with extra refcnt got(Callers should handle it).
5087 * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a
5088 * target for charge migration. if @target is not NULL, the entry is stored
5091 * Called with pte lock held.
5098 enum mc_target_type {
5099 MC_TARGET_NONE, /* not used */
5104 static struct page *mc_handle_present_pte(struct vm_area_struct *vma,
5105 unsigned long addr, pte_t ptent)
5107 struct page *page = vm_normal_page(vma, addr, ptent);
5109 if (!page || !page_mapped(page))
5111 if (PageAnon(page)) {
5112 /* we don't move shared anon */
5113 if (!move_anon() || page_mapcount(page) > 2)
5115 } else if (!move_file())
5116 /* we ignore mapcount for file pages */
5118 if (!get_page_unless_zero(page))
5124 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
5125 unsigned long addr, pte_t ptent, swp_entry_t *entry)
5128 struct page *page = NULL;
5129 swp_entry_t ent = pte_to_swp_entry(ptent);
5131 if (!move_anon() || non_swap_entry(ent))
5133 usage_count = mem_cgroup_count_swap_user(ent, &page);
5134 if (usage_count > 1) { /* we don't move shared anon */
5139 if (do_swap_account)
5140 entry->val = ent.val;
5145 static struct page *mc_handle_file_pte(struct vm_area_struct *vma,
5146 unsigned long addr, pte_t ptent, swp_entry_t *entry)
5148 struct page *page = NULL;
5149 struct inode *inode;
5150 struct address_space *mapping;
5153 if (!vma->vm_file) /* anonymous vma */
5158 inode = vma->vm_file->f_path.dentry->d_inode;
5159 mapping = vma->vm_file->f_mapping;
5160 if (pte_none(ptent))
5161 pgoff = linear_page_index(vma, addr);
5162 else /* pte_file(ptent) is true */
5163 pgoff = pte_to_pgoff(ptent);
5165 /* page is moved even if it's not RSS of this task(page-faulted). */
5166 page = find_get_page(mapping, pgoff);
5169 /* shmem/tmpfs may report page out on swap: account for that too. */
5170 if (radix_tree_exceptional_entry(page)) {
5171 swp_entry_t swap = radix_to_swp_entry(page);
5172 if (do_swap_account)
5174 page = find_get_page(&swapper_space, swap.val);
5180 static int is_target_pte_for_mc(struct vm_area_struct *vma,
5181 unsigned long addr, pte_t ptent, union mc_target *target)
5183 struct page *page = NULL;
5184 struct page_cgroup *pc;
5186 swp_entry_t ent = { .val = 0 };
5188 if (pte_present(ptent))
5189 page = mc_handle_present_pte(vma, addr, ptent);
5190 else if (is_swap_pte(ptent))
5191 page = mc_handle_swap_pte(vma, addr, ptent, &ent);
5192 else if (pte_none(ptent) || pte_file(ptent))
5193 page = mc_handle_file_pte(vma, addr, ptent, &ent);
5195 if (!page && !ent.val)
5198 pc = lookup_page_cgroup(page);
5200 * Do only loose check w/o page_cgroup lock.
5201 * mem_cgroup_move_account() checks the pc is valid or not under
5204 if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) {
5205 ret = MC_TARGET_PAGE;
5207 target->page = page;
5209 if (!ret || !target)
5212 /* There is a swap entry and a page doesn't exist or isn't charged */
5213 if (ent.val && !ret &&
5214 css_id(&mc.from->css) == lookup_swap_cgroup_id(ent)) {
5215 ret = MC_TARGET_SWAP;
5222 static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd,
5223 unsigned long addr, unsigned long end,
5224 struct mm_walk *walk)
5226 struct vm_area_struct *vma = walk->private;
5230 split_huge_page_pmd(walk->mm, pmd);
5231 if (pmd_trans_unstable(pmd))
5234 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
5235 for (; addr != end; pte++, addr += PAGE_SIZE)
5236 if (is_target_pte_for_mc(vma, addr, *pte, NULL))
5237 mc.precharge++; /* increment precharge temporarily */
5238 pte_unmap_unlock(pte - 1, ptl);
5244 static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm)
5246 unsigned long precharge;
5247 struct vm_area_struct *vma;
5249 down_read(&mm->mmap_sem);
5250 for (vma = mm->mmap; vma; vma = vma->vm_next) {
5251 struct mm_walk mem_cgroup_count_precharge_walk = {
5252 .pmd_entry = mem_cgroup_count_precharge_pte_range,
5256 if (is_vm_hugetlb_page(vma))
5258 walk_page_range(vma->vm_start, vma->vm_end,
5259 &mem_cgroup_count_precharge_walk);
5261 up_read(&mm->mmap_sem);
5263 precharge = mc.precharge;
5269 static int mem_cgroup_precharge_mc(struct mm_struct *mm)
5271 unsigned long precharge = mem_cgroup_count_precharge(mm);
5273 VM_BUG_ON(mc.moving_task);
5274 mc.moving_task = current;
5275 return mem_cgroup_do_precharge(precharge);
5278 /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */
5279 static void __mem_cgroup_clear_mc(void)
5281 struct mem_cgroup *from = mc.from;
5282 struct mem_cgroup *to = mc.to;
5284 /* we must uncharge all the leftover precharges from mc.to */
5286 __mem_cgroup_cancel_charge(mc.to, mc.precharge);
5290 * we didn't uncharge from mc.from at mem_cgroup_move_account(), so
5291 * we must uncharge here.
5293 if (mc.moved_charge) {
5294 __mem_cgroup_cancel_charge(mc.from, mc.moved_charge);
5295 mc.moved_charge = 0;
5297 /* we must fixup refcnts and charges */
5298 if (mc.moved_swap) {
5299 /* uncharge swap account from the old cgroup */
5300 if (!mem_cgroup_is_root(mc.from))
5301 res_counter_uncharge(&mc.from->memsw,
5302 PAGE_SIZE * mc.moved_swap);
5303 __mem_cgroup_put(mc.from, mc.moved_swap);
5305 if (!mem_cgroup_is_root(mc.to)) {
5307 * we charged both to->res and to->memsw, so we should
5310 res_counter_uncharge(&mc.to->res,
5311 PAGE_SIZE * mc.moved_swap);
5313 /* we've already done mem_cgroup_get(mc.to) */
5316 memcg_oom_recover(from);
5317 memcg_oom_recover(to);
5318 wake_up_all(&mc.waitq);
5321 static void mem_cgroup_clear_mc(void)
5323 struct mem_cgroup *from = mc.from;
5326 * we must clear moving_task before waking up waiters at the end of
5329 mc.moving_task = NULL;
5330 __mem_cgroup_clear_mc();
5331 spin_lock(&mc.lock);
5334 spin_unlock(&mc.lock);
5335 mem_cgroup_end_move(from);
5338 static int mem_cgroup_can_attach(struct cgroup *cgroup,
5339 struct cgroup_taskset *tset)
5341 struct task_struct *p = cgroup_taskset_first(tset);
5343 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgroup);
5345 if (memcg->move_charge_at_immigrate) {
5346 struct mm_struct *mm;
5347 struct mem_cgroup *from = mem_cgroup_from_task(p);
5349 VM_BUG_ON(from == memcg);
5351 mm = get_task_mm(p);
5354 /* We move charges only when we move a owner of the mm */
5355 if (mm->owner == p) {
5358 VM_BUG_ON(mc.precharge);
5359 VM_BUG_ON(mc.moved_charge);
5360 VM_BUG_ON(mc.moved_swap);
5361 mem_cgroup_start_move(from);
5362 spin_lock(&mc.lock);
5365 spin_unlock(&mc.lock);
5366 /* We set mc.moving_task later */
5368 ret = mem_cgroup_precharge_mc(mm);
5370 mem_cgroup_clear_mc();
5377 static void mem_cgroup_cancel_attach(struct cgroup *cgroup,
5378 struct cgroup_taskset *tset)
5380 mem_cgroup_clear_mc();
5383 static int mem_cgroup_move_charge_pte_range(pmd_t *pmd,
5384 unsigned long addr, unsigned long end,
5385 struct mm_walk *walk)
5388 struct vm_area_struct *vma = walk->private;
5392 split_huge_page_pmd(walk->mm, pmd);
5393 if (pmd_trans_unstable(pmd))
5396 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
5397 for (; addr != end; addr += PAGE_SIZE) {
5398 pte_t ptent = *(pte++);
5399 union mc_target target;
5402 struct page_cgroup *pc;
5408 type = is_target_pte_for_mc(vma, addr, ptent, &target);
5410 case MC_TARGET_PAGE:
5412 if (isolate_lru_page(page))
5414 pc = lookup_page_cgroup(page);
5415 if (!mem_cgroup_move_account(page, 1, pc,
5416 mc.from, mc.to, false)) {
5418 /* we uncharge from mc.from later. */
5421 putback_lru_page(page);
5422 put: /* is_target_pte_for_mc() gets the page */
5425 case MC_TARGET_SWAP:
5427 if (!mem_cgroup_move_swap_account(ent,
5428 mc.from, mc.to, false)) {
5430 /* we fixup refcnts and charges later. */
5438 pte_unmap_unlock(pte - 1, ptl);
5443 * We have consumed all precharges we got in can_attach().
5444 * We try charge one by one, but don't do any additional
5445 * charges to mc.to if we have failed in charge once in attach()
5448 ret = mem_cgroup_do_precharge(1);
5456 static void mem_cgroup_move_charge(struct mm_struct *mm)
5458 struct vm_area_struct *vma;
5460 lru_add_drain_all();
5462 if (unlikely(!down_read_trylock(&mm->mmap_sem))) {
5464 * Someone who are holding the mmap_sem might be waiting in
5465 * waitq. So we cancel all extra charges, wake up all waiters,
5466 * and retry. Because we cancel precharges, we might not be able
5467 * to move enough charges, but moving charge is a best-effort
5468 * feature anyway, so it wouldn't be a big problem.
5470 __mem_cgroup_clear_mc();
5474 for (vma = mm->mmap; vma; vma = vma->vm_next) {
5476 struct mm_walk mem_cgroup_move_charge_walk = {
5477 .pmd_entry = mem_cgroup_move_charge_pte_range,
5481 if (is_vm_hugetlb_page(vma))
5483 ret = walk_page_range(vma->vm_start, vma->vm_end,
5484 &mem_cgroup_move_charge_walk);
5487 * means we have consumed all precharges and failed in
5488 * doing additional charge. Just abandon here.
5492 up_read(&mm->mmap_sem);
5495 static void mem_cgroup_move_task(struct cgroup *cont,
5496 struct cgroup_taskset *tset)
5498 struct task_struct *p = cgroup_taskset_first(tset);
5499 struct mm_struct *mm = get_task_mm(p);
5503 mem_cgroup_move_charge(mm);
5508 mem_cgroup_clear_mc();
5510 #else /* !CONFIG_MMU */
5511 static int mem_cgroup_can_attach(struct cgroup *cgroup,
5512 struct cgroup_taskset *tset)
5516 static void mem_cgroup_cancel_attach(struct cgroup *cgroup,
5517 struct cgroup_taskset *tset)
5520 static void mem_cgroup_move_task(struct cgroup *cont,
5521 struct cgroup_taskset *tset)
5526 struct cgroup_subsys mem_cgroup_subsys = {
5528 .subsys_id = mem_cgroup_subsys_id,
5529 .create = mem_cgroup_create,
5530 .pre_destroy = mem_cgroup_pre_destroy,
5531 .destroy = mem_cgroup_destroy,
5532 .populate = mem_cgroup_populate,
5533 .can_attach = mem_cgroup_can_attach,
5534 .cancel_attach = mem_cgroup_cancel_attach,
5535 .attach = mem_cgroup_move_task,
5540 #ifdef CONFIG_CGROUP_MEM_RES_CTLR_SWAP
5541 static int __init enable_swap_account(char *s)
5543 /* consider enabled if no parameter or 1 is given */
5544 if (!strcmp(s, "1"))
5545 really_do_swap_account = 1;
5546 else if (!strcmp(s, "0"))
5547 really_do_swap_account = 0;
5550 __setup("swapaccount=", enable_swap_account);