1 /* memcontrol.c - Memory Controller
3 * Copyright IBM Corporation, 2007
4 * Author Balbir Singh <balbir@linux.vnet.ibm.com>
6 * Copyright 2007 OpenVZ SWsoft Inc
7 * Author: Pavel Emelianov <xemul@openvz.org>
10 * Copyright (C) 2009 Nokia Corporation
11 * Author: Kirill A. Shutemov
13 * This program is free software; you can redistribute it and/or modify
14 * it under the terms of the GNU General Public License as published by
15 * the Free Software Foundation; either version 2 of the License, or
16 * (at your option) any later version.
18 * This program is distributed in the hope that it will be useful,
19 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 * GNU General Public License for more details.
24 #include <linux/res_counter.h>
25 #include <linux/memcontrol.h>
26 #include <linux/cgroup.h>
28 #include <linux/hugetlb.h>
29 #include <linux/pagemap.h>
30 #include <linux/smp.h>
31 #include <linux/page-flags.h>
32 #include <linux/backing-dev.h>
33 #include <linux/bit_spinlock.h>
34 #include <linux/rcupdate.h>
35 #include <linux/limits.h>
36 #include <linux/export.h>
37 #include <linux/mutex.h>
38 #include <linux/rbtree.h>
39 #include <linux/slab.h>
40 #include <linux/swap.h>
41 #include <linux/swapops.h>
42 #include <linux/spinlock.h>
43 #include <linux/eventfd.h>
44 #include <linux/sort.h>
46 #include <linux/seq_file.h>
47 #include <linux/vmalloc.h>
48 #include <linux/mm_inline.h>
49 #include <linux/page_cgroup.h>
50 #include <linux/cpu.h>
51 #include <linux/oom.h>
54 #include <net/tcp_memcontrol.h>
56 #include <asm/uaccess.h>
58 #include <trace/events/vmscan.h>
60 struct cgroup_subsys mem_cgroup_subsys __read_mostly;
61 #define MEM_CGROUP_RECLAIM_RETRIES 5
62 static struct mem_cgroup *root_mem_cgroup __read_mostly;
64 #ifdef CONFIG_MEMCG_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_MEMCG_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_SWAP, /* # of pages, swapped out */
91 MEM_CGROUP_STAT_NSTATS,
94 static const char * const mem_cgroup_stat_names[] = {
101 enum mem_cgroup_events_index {
102 MEM_CGROUP_EVENTS_PGPGIN, /* # of pages paged in */
103 MEM_CGROUP_EVENTS_PGPGOUT, /* # of pages paged out */
104 MEM_CGROUP_EVENTS_PGFAULT, /* # of page-faults */
105 MEM_CGROUP_EVENTS_PGMAJFAULT, /* # of major page-faults */
106 MEM_CGROUP_EVENTS_NSTATS,
109 static const char * const mem_cgroup_events_names[] = {
117 * Per memcg event counter is incremented at every pagein/pageout. With THP,
118 * it will be incremated by the number of pages. This counter is used for
119 * for trigger some periodic events. This is straightforward and better
120 * than using jiffies etc. to handle periodic memcg event.
122 enum mem_cgroup_events_target {
123 MEM_CGROUP_TARGET_THRESH,
124 MEM_CGROUP_TARGET_SOFTLIMIT,
125 MEM_CGROUP_TARGET_NUMAINFO,
128 #define THRESHOLDS_EVENTS_TARGET 128
129 #define SOFTLIMIT_EVENTS_TARGET 1024
130 #define NUMAINFO_EVENTS_TARGET 1024
132 struct mem_cgroup_stat_cpu {
133 long count[MEM_CGROUP_STAT_NSTATS];
134 unsigned long events[MEM_CGROUP_EVENTS_NSTATS];
135 unsigned long nr_page_events;
136 unsigned long targets[MEM_CGROUP_NTARGETS];
139 struct mem_cgroup_reclaim_iter {
140 /* css_id of the last scanned hierarchy member */
142 /* scan generation, increased every round-trip */
143 unsigned int generation;
147 * per-zone information in memory controller.
149 struct mem_cgroup_per_zone {
150 struct lruvec lruvec;
151 unsigned long lru_size[NR_LRU_LISTS];
153 struct mem_cgroup_reclaim_iter reclaim_iter[DEF_PRIORITY + 1];
155 struct rb_node tree_node; /* RB tree node */
156 unsigned long long usage_in_excess;/* Set to the value by which */
157 /* the soft limit is exceeded*/
159 struct mem_cgroup *memcg; /* Back pointer, we cannot */
160 /* use container_of */
163 struct mem_cgroup_per_node {
164 struct mem_cgroup_per_zone zoneinfo[MAX_NR_ZONES];
167 struct mem_cgroup_lru_info {
168 struct mem_cgroup_per_node *nodeinfo[MAX_NUMNODES];
172 * Cgroups above their limits are maintained in a RB-Tree, independent of
173 * their hierarchy representation
176 struct mem_cgroup_tree_per_zone {
177 struct rb_root rb_root;
181 struct mem_cgroup_tree_per_node {
182 struct mem_cgroup_tree_per_zone rb_tree_per_zone[MAX_NR_ZONES];
185 struct mem_cgroup_tree {
186 struct mem_cgroup_tree_per_node *rb_tree_per_node[MAX_NUMNODES];
189 static struct mem_cgroup_tree soft_limit_tree __read_mostly;
191 struct mem_cgroup_threshold {
192 struct eventfd_ctx *eventfd;
197 struct mem_cgroup_threshold_ary {
198 /* An array index points to threshold just below or equal to usage. */
199 int current_threshold;
200 /* Size of entries[] */
202 /* Array of thresholds */
203 struct mem_cgroup_threshold entries[0];
206 struct mem_cgroup_thresholds {
207 /* Primary thresholds array */
208 struct mem_cgroup_threshold_ary *primary;
210 * Spare threshold array.
211 * This is needed to make mem_cgroup_unregister_event() "never fail".
212 * It must be able to store at least primary->size - 1 entries.
214 struct mem_cgroup_threshold_ary *spare;
218 struct mem_cgroup_eventfd_list {
219 struct list_head list;
220 struct eventfd_ctx *eventfd;
223 static void mem_cgroup_threshold(struct mem_cgroup *memcg);
224 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg);
227 * The memory controller data structure. The memory controller controls both
228 * page cache and RSS per cgroup. We would eventually like to provide
229 * statistics based on the statistics developed by Rik Van Riel for clock-pro,
230 * to help the administrator determine what knobs to tune.
232 * TODO: Add a water mark for the memory controller. Reclaim will begin when
233 * we hit the water mark. May be even add a low water mark, such that
234 * no reclaim occurs from a cgroup at it's low water mark, this is
235 * a feature that will be implemented much later in the future.
238 struct cgroup_subsys_state css;
240 * the counter to account for memory usage
242 struct res_counter res;
246 * the counter to account for mem+swap usage.
248 struct res_counter memsw;
251 * rcu_freeing is used only when freeing struct mem_cgroup,
252 * so put it into a union to avoid wasting more memory.
253 * It must be disjoint from the css field. It could be
254 * in a union with the res field, but res plays a much
255 * larger part in mem_cgroup life than memsw, and might
256 * be of interest, even at time of free, when debugging.
257 * So share rcu_head with the less interesting memsw.
259 struct rcu_head rcu_freeing;
261 * We also need some space for a worker in deferred freeing.
262 * By the time we call it, rcu_freeing is no longer in use.
264 struct work_struct work_freeing;
268 * Per cgroup active and inactive list, similar to the
269 * per zone LRU lists.
271 struct mem_cgroup_lru_info info;
272 int last_scanned_node;
274 nodemask_t scan_nodes;
275 atomic_t numainfo_events;
276 atomic_t numainfo_updating;
279 * Should the accounting and control be hierarchical, per subtree?
289 /* OOM-Killer disable */
290 int oom_kill_disable;
292 /* set when res.limit == memsw.limit */
293 bool memsw_is_minimum;
295 /* protect arrays of thresholds */
296 struct mutex thresholds_lock;
298 /* thresholds for memory usage. RCU-protected */
299 struct mem_cgroup_thresholds thresholds;
301 /* thresholds for mem+swap usage. RCU-protected */
302 struct mem_cgroup_thresholds memsw_thresholds;
304 /* For oom notifier event fd */
305 struct list_head oom_notify;
308 * Should we move charges of a task when a task is moved into this
309 * mem_cgroup ? And what type of charges should we move ?
311 unsigned long move_charge_at_immigrate;
313 * set > 0 if pages under this cgroup are moving to other cgroup.
315 atomic_t moving_account;
316 /* taken only while moving_account > 0 */
317 spinlock_t move_lock;
321 struct mem_cgroup_stat_cpu __percpu *stat;
323 * used when a cpu is offlined or other synchronizations
324 * See mem_cgroup_read_stat().
326 struct mem_cgroup_stat_cpu nocpu_base;
327 spinlock_t pcp_counter_lock;
330 struct tcp_memcontrol tcp_mem;
334 /* Stuffs for move charges at task migration. */
336 * Types of charges to be moved. "move_charge_at_immitgrate" is treated as a
337 * left-shifted bitmap of these types.
340 MOVE_CHARGE_TYPE_ANON, /* private anonymous page and swap of it */
341 MOVE_CHARGE_TYPE_FILE, /* file page(including tmpfs) and swap of it */
345 /* "mc" and its members are protected by cgroup_mutex */
346 static struct move_charge_struct {
347 spinlock_t lock; /* for from, to */
348 struct mem_cgroup *from;
349 struct mem_cgroup *to;
350 unsigned long precharge;
351 unsigned long moved_charge;
352 unsigned long moved_swap;
353 struct task_struct *moving_task; /* a task moving charges */
354 wait_queue_head_t waitq; /* a waitq for other context */
356 .lock = __SPIN_LOCK_UNLOCKED(mc.lock),
357 .waitq = __WAIT_QUEUE_HEAD_INITIALIZER(mc.waitq),
360 static bool move_anon(void)
362 return test_bit(MOVE_CHARGE_TYPE_ANON,
363 &mc.to->move_charge_at_immigrate);
366 static bool move_file(void)
368 return test_bit(MOVE_CHARGE_TYPE_FILE,
369 &mc.to->move_charge_at_immigrate);
373 * Maximum loops in mem_cgroup_hierarchical_reclaim(), used for soft
374 * limit reclaim to prevent infinite loops, if they ever occur.
376 #define MEM_CGROUP_MAX_RECLAIM_LOOPS 100
377 #define MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS 2
380 MEM_CGROUP_CHARGE_TYPE_CACHE = 0,
381 MEM_CGROUP_CHARGE_TYPE_ANON,
382 MEM_CGROUP_CHARGE_TYPE_SHMEM, /* used by page migration of shmem */
383 MEM_CGROUP_CHARGE_TYPE_SWAPOUT, /* for accounting swapcache */
384 MEM_CGROUP_CHARGE_TYPE_DROP, /* a page was unused swap cache */
388 /* for encoding cft->private value on file */
391 #define _OOM_TYPE (2)
392 #define MEMFILE_PRIVATE(x, val) ((x) << 16 | (val))
393 #define MEMFILE_TYPE(val) ((val) >> 16 & 0xffff)
394 #define MEMFILE_ATTR(val) ((val) & 0xffff)
395 /* Used for OOM nofiier */
396 #define OOM_CONTROL (0)
399 * Reclaim flags for mem_cgroup_hierarchical_reclaim
401 #define MEM_CGROUP_RECLAIM_NOSWAP_BIT 0x0
402 #define MEM_CGROUP_RECLAIM_NOSWAP (1 << MEM_CGROUP_RECLAIM_NOSWAP_BIT)
403 #define MEM_CGROUP_RECLAIM_SHRINK_BIT 0x1
404 #define MEM_CGROUP_RECLAIM_SHRINK (1 << MEM_CGROUP_RECLAIM_SHRINK_BIT)
406 static void mem_cgroup_get(struct mem_cgroup *memcg);
407 static void mem_cgroup_put(struct mem_cgroup *memcg);
409 /* Writing them here to avoid exposing memcg's inner layout */
410 #ifdef CONFIG_MEMCG_KMEM
411 #include <net/sock.h>
414 static bool mem_cgroup_is_root(struct mem_cgroup *memcg);
415 void sock_update_memcg(struct sock *sk)
417 if (mem_cgroup_sockets_enabled) {
418 struct mem_cgroup *memcg;
419 struct cg_proto *cg_proto;
421 BUG_ON(!sk->sk_prot->proto_cgroup);
423 /* Socket cloning can throw us here with sk_cgrp already
424 * filled. It won't however, necessarily happen from
425 * process context. So the test for root memcg given
426 * the current task's memcg won't help us in this case.
428 * Respecting the original socket's memcg is a better
429 * decision in this case.
432 BUG_ON(mem_cgroup_is_root(sk->sk_cgrp->memcg));
433 mem_cgroup_get(sk->sk_cgrp->memcg);
438 memcg = mem_cgroup_from_task(current);
439 cg_proto = sk->sk_prot->proto_cgroup(memcg);
440 if (!mem_cgroup_is_root(memcg) && memcg_proto_active(cg_proto)) {
441 mem_cgroup_get(memcg);
442 sk->sk_cgrp = cg_proto;
447 EXPORT_SYMBOL(sock_update_memcg);
449 void sock_release_memcg(struct sock *sk)
451 if (mem_cgroup_sockets_enabled && sk->sk_cgrp) {
452 struct mem_cgroup *memcg;
453 WARN_ON(!sk->sk_cgrp->memcg);
454 memcg = sk->sk_cgrp->memcg;
455 mem_cgroup_put(memcg);
460 struct cg_proto *tcp_proto_cgroup(struct mem_cgroup *memcg)
462 if (!memcg || mem_cgroup_is_root(memcg))
465 return &memcg->tcp_mem.cg_proto;
467 EXPORT_SYMBOL(tcp_proto_cgroup);
468 #endif /* CONFIG_INET */
469 #endif /* CONFIG_MEMCG_KMEM */
471 #if defined(CONFIG_INET) && defined(CONFIG_MEMCG_KMEM)
472 static void disarm_sock_keys(struct mem_cgroup *memcg)
474 if (!memcg_proto_activated(&memcg->tcp_mem.cg_proto))
476 static_key_slow_dec(&memcg_socket_limit_enabled);
479 static void disarm_sock_keys(struct mem_cgroup *memcg)
484 static void drain_all_stock_async(struct mem_cgroup *memcg);
486 static struct mem_cgroup_per_zone *
487 mem_cgroup_zoneinfo(struct mem_cgroup *memcg, int nid, int zid)
489 return &memcg->info.nodeinfo[nid]->zoneinfo[zid];
492 struct cgroup_subsys_state *mem_cgroup_css(struct mem_cgroup *memcg)
497 static struct mem_cgroup_per_zone *
498 page_cgroup_zoneinfo(struct mem_cgroup *memcg, struct page *page)
500 int nid = page_to_nid(page);
501 int zid = page_zonenum(page);
503 return mem_cgroup_zoneinfo(memcg, nid, zid);
506 static struct mem_cgroup_tree_per_zone *
507 soft_limit_tree_node_zone(int nid, int zid)
509 return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid];
512 static struct mem_cgroup_tree_per_zone *
513 soft_limit_tree_from_page(struct page *page)
515 int nid = page_to_nid(page);
516 int zid = page_zonenum(page);
518 return &soft_limit_tree.rb_tree_per_node[nid]->rb_tree_per_zone[zid];
522 __mem_cgroup_insert_exceeded(struct mem_cgroup *memcg,
523 struct mem_cgroup_per_zone *mz,
524 struct mem_cgroup_tree_per_zone *mctz,
525 unsigned long long new_usage_in_excess)
527 struct rb_node **p = &mctz->rb_root.rb_node;
528 struct rb_node *parent = NULL;
529 struct mem_cgroup_per_zone *mz_node;
534 mz->usage_in_excess = new_usage_in_excess;
535 if (!mz->usage_in_excess)
539 mz_node = rb_entry(parent, struct mem_cgroup_per_zone,
541 if (mz->usage_in_excess < mz_node->usage_in_excess)
544 * We can't avoid mem cgroups that are over their soft
545 * limit by the same amount
547 else if (mz->usage_in_excess >= mz_node->usage_in_excess)
550 rb_link_node(&mz->tree_node, parent, p);
551 rb_insert_color(&mz->tree_node, &mctz->rb_root);
556 __mem_cgroup_remove_exceeded(struct mem_cgroup *memcg,
557 struct mem_cgroup_per_zone *mz,
558 struct mem_cgroup_tree_per_zone *mctz)
562 rb_erase(&mz->tree_node, &mctz->rb_root);
567 mem_cgroup_remove_exceeded(struct mem_cgroup *memcg,
568 struct mem_cgroup_per_zone *mz,
569 struct mem_cgroup_tree_per_zone *mctz)
571 spin_lock(&mctz->lock);
572 __mem_cgroup_remove_exceeded(memcg, mz, mctz);
573 spin_unlock(&mctz->lock);
577 static void mem_cgroup_update_tree(struct mem_cgroup *memcg, struct page *page)
579 unsigned long long excess;
580 struct mem_cgroup_per_zone *mz;
581 struct mem_cgroup_tree_per_zone *mctz;
582 int nid = page_to_nid(page);
583 int zid = page_zonenum(page);
584 mctz = soft_limit_tree_from_page(page);
587 * Necessary to update all ancestors when hierarchy is used.
588 * because their event counter is not touched.
590 for (; memcg; memcg = parent_mem_cgroup(memcg)) {
591 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
592 excess = res_counter_soft_limit_excess(&memcg->res);
594 * We have to update the tree if mz is on RB-tree or
595 * mem is over its softlimit.
597 if (excess || mz->on_tree) {
598 spin_lock(&mctz->lock);
599 /* if on-tree, remove it */
601 __mem_cgroup_remove_exceeded(memcg, mz, mctz);
603 * Insert again. mz->usage_in_excess will be updated.
604 * If excess is 0, no tree ops.
606 __mem_cgroup_insert_exceeded(memcg, mz, mctz, excess);
607 spin_unlock(&mctz->lock);
612 static void mem_cgroup_remove_from_trees(struct mem_cgroup *memcg)
615 struct mem_cgroup_per_zone *mz;
616 struct mem_cgroup_tree_per_zone *mctz;
618 for_each_node(node) {
619 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
620 mz = mem_cgroup_zoneinfo(memcg, node, zone);
621 mctz = soft_limit_tree_node_zone(node, zone);
622 mem_cgroup_remove_exceeded(memcg, mz, mctz);
627 static struct mem_cgroup_per_zone *
628 __mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz)
630 struct rb_node *rightmost = NULL;
631 struct mem_cgroup_per_zone *mz;
635 rightmost = rb_last(&mctz->rb_root);
637 goto done; /* Nothing to reclaim from */
639 mz = rb_entry(rightmost, struct mem_cgroup_per_zone, tree_node);
641 * Remove the node now but someone else can add it back,
642 * we will to add it back at the end of reclaim to its correct
643 * position in the tree.
645 __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz);
646 if (!res_counter_soft_limit_excess(&mz->memcg->res) ||
647 !css_tryget(&mz->memcg->css))
653 static struct mem_cgroup_per_zone *
654 mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz)
656 struct mem_cgroup_per_zone *mz;
658 spin_lock(&mctz->lock);
659 mz = __mem_cgroup_largest_soft_limit_node(mctz);
660 spin_unlock(&mctz->lock);
665 * Implementation Note: reading percpu statistics for memcg.
667 * Both of vmstat[] and percpu_counter has threshold and do periodic
668 * synchronization to implement "quick" read. There are trade-off between
669 * reading cost and precision of value. Then, we may have a chance to implement
670 * a periodic synchronizion of counter in memcg's counter.
672 * But this _read() function is used for user interface now. The user accounts
673 * memory usage by memory cgroup and he _always_ requires exact value because
674 * he accounts memory. Even if we provide quick-and-fuzzy read, we always
675 * have to visit all online cpus and make sum. So, for now, unnecessary
676 * synchronization is not implemented. (just implemented for cpu hotplug)
678 * If there are kernel internal actions which can make use of some not-exact
679 * value, and reading all cpu value can be performance bottleneck in some
680 * common workload, threashold and synchonization as vmstat[] should be
683 static long mem_cgroup_read_stat(struct mem_cgroup *memcg,
684 enum mem_cgroup_stat_index idx)
690 for_each_online_cpu(cpu)
691 val += per_cpu(memcg->stat->count[idx], cpu);
692 #ifdef CONFIG_HOTPLUG_CPU
693 spin_lock(&memcg->pcp_counter_lock);
694 val += memcg->nocpu_base.count[idx];
695 spin_unlock(&memcg->pcp_counter_lock);
701 static void mem_cgroup_swap_statistics(struct mem_cgroup *memcg,
704 int val = (charge) ? 1 : -1;
705 this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_SWAP], val);
708 static unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg,
709 enum mem_cgroup_events_index idx)
711 unsigned long val = 0;
714 for_each_online_cpu(cpu)
715 val += per_cpu(memcg->stat->events[idx], cpu);
716 #ifdef CONFIG_HOTPLUG_CPU
717 spin_lock(&memcg->pcp_counter_lock);
718 val += memcg->nocpu_base.events[idx];
719 spin_unlock(&memcg->pcp_counter_lock);
724 static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg,
725 bool anon, int nr_pages)
730 * Here, RSS means 'mapped anon' and anon's SwapCache. Shmem/tmpfs is
731 * counted as CACHE even if it's on ANON LRU.
734 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_RSS],
737 __this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_CACHE],
740 /* pagein of a big page is an event. So, ignore page size */
742 __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGIN]);
744 __this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGPGOUT]);
745 nr_pages = -nr_pages; /* for event */
748 __this_cpu_add(memcg->stat->nr_page_events, nr_pages);
754 mem_cgroup_get_lru_size(struct lruvec *lruvec, enum lru_list lru)
756 struct mem_cgroup_per_zone *mz;
758 mz = container_of(lruvec, struct mem_cgroup_per_zone, lruvec);
759 return mz->lru_size[lru];
763 mem_cgroup_zone_nr_lru_pages(struct mem_cgroup *memcg, int nid, int zid,
764 unsigned int lru_mask)
766 struct mem_cgroup_per_zone *mz;
768 unsigned long ret = 0;
770 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
773 if (BIT(lru) & lru_mask)
774 ret += mz->lru_size[lru];
780 mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg,
781 int nid, unsigned int lru_mask)
786 for (zid = 0; zid < MAX_NR_ZONES; zid++)
787 total += mem_cgroup_zone_nr_lru_pages(memcg,
793 static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg,
794 unsigned int lru_mask)
799 for_each_node_state(nid, N_HIGH_MEMORY)
800 total += mem_cgroup_node_nr_lru_pages(memcg, nid, lru_mask);
804 static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg,
805 enum mem_cgroup_events_target target)
807 unsigned long val, next;
809 val = __this_cpu_read(memcg->stat->nr_page_events);
810 next = __this_cpu_read(memcg->stat->targets[target]);
811 /* from time_after() in jiffies.h */
812 if ((long)next - (long)val < 0) {
814 case MEM_CGROUP_TARGET_THRESH:
815 next = val + THRESHOLDS_EVENTS_TARGET;
817 case MEM_CGROUP_TARGET_SOFTLIMIT:
818 next = val + SOFTLIMIT_EVENTS_TARGET;
820 case MEM_CGROUP_TARGET_NUMAINFO:
821 next = val + NUMAINFO_EVENTS_TARGET;
826 __this_cpu_write(memcg->stat->targets[target], next);
833 * Check events in order.
836 static void memcg_check_events(struct mem_cgroup *memcg, struct page *page)
839 /* threshold event is triggered in finer grain than soft limit */
840 if (unlikely(mem_cgroup_event_ratelimit(memcg,
841 MEM_CGROUP_TARGET_THRESH))) {
843 bool do_numainfo __maybe_unused;
845 do_softlimit = mem_cgroup_event_ratelimit(memcg,
846 MEM_CGROUP_TARGET_SOFTLIMIT);
848 do_numainfo = mem_cgroup_event_ratelimit(memcg,
849 MEM_CGROUP_TARGET_NUMAINFO);
853 mem_cgroup_threshold(memcg);
854 if (unlikely(do_softlimit))
855 mem_cgroup_update_tree(memcg, page);
857 if (unlikely(do_numainfo))
858 atomic_inc(&memcg->numainfo_events);
864 struct mem_cgroup *mem_cgroup_from_cont(struct cgroup *cont)
866 return container_of(cgroup_subsys_state(cont,
867 mem_cgroup_subsys_id), struct mem_cgroup,
871 struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p)
874 * mm_update_next_owner() may clear mm->owner to NULL
875 * if it races with swapoff, page migration, etc.
876 * So this can be called with p == NULL.
881 return container_of(task_subsys_state(p, mem_cgroup_subsys_id),
882 struct mem_cgroup, css);
885 struct mem_cgroup *try_get_mem_cgroup_from_mm(struct mm_struct *mm)
887 struct mem_cgroup *memcg = NULL;
892 * Because we have no locks, mm->owner's may be being moved to other
893 * cgroup. We use css_tryget() here even if this looks
894 * pessimistic (rather than adding locks here).
898 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
899 if (unlikely(!memcg))
901 } while (!css_tryget(&memcg->css));
907 * mem_cgroup_iter - iterate over memory cgroup hierarchy
908 * @root: hierarchy root
909 * @prev: previously returned memcg, NULL on first invocation
910 * @reclaim: cookie for shared reclaim walks, NULL for full walks
912 * Returns references to children of the hierarchy below @root, or
913 * @root itself, or %NULL after a full round-trip.
915 * Caller must pass the return value in @prev on subsequent
916 * invocations for reference counting, or use mem_cgroup_iter_break()
917 * to cancel a hierarchy walk before the round-trip is complete.
919 * Reclaimers can specify a zone and a priority level in @reclaim to
920 * divide up the memcgs in the hierarchy among all concurrent
921 * reclaimers operating on the same zone and priority.
923 struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root,
924 struct mem_cgroup *prev,
925 struct mem_cgroup_reclaim_cookie *reclaim)
927 struct mem_cgroup *memcg = NULL;
930 if (mem_cgroup_disabled())
934 root = root_mem_cgroup;
936 if (prev && !reclaim)
937 id = css_id(&prev->css);
939 if (prev && prev != root)
942 if (!root->use_hierarchy && root != root_mem_cgroup) {
949 struct mem_cgroup_reclaim_iter *uninitialized_var(iter);
950 struct cgroup_subsys_state *css;
953 int nid = zone_to_nid(reclaim->zone);
954 int zid = zone_idx(reclaim->zone);
955 struct mem_cgroup_per_zone *mz;
957 mz = mem_cgroup_zoneinfo(root, nid, zid);
958 iter = &mz->reclaim_iter[reclaim->priority];
959 if (prev && reclaim->generation != iter->generation)
965 css = css_get_next(&mem_cgroup_subsys, id + 1, &root->css, &id);
967 if (css == &root->css || css_tryget(css))
968 memcg = container_of(css,
969 struct mem_cgroup, css);
978 else if (!prev && memcg)
979 reclaim->generation = iter->generation;
989 * mem_cgroup_iter_break - abort a hierarchy walk prematurely
990 * @root: hierarchy root
991 * @prev: last visited hierarchy member as returned by mem_cgroup_iter()
993 void mem_cgroup_iter_break(struct mem_cgroup *root,
994 struct mem_cgroup *prev)
997 root = root_mem_cgroup;
998 if (prev && prev != root)
1003 * Iteration constructs for visiting all cgroups (under a tree). If
1004 * loops are exited prematurely (break), mem_cgroup_iter_break() must
1005 * be used for reference counting.
1007 #define for_each_mem_cgroup_tree(iter, root) \
1008 for (iter = mem_cgroup_iter(root, NULL, NULL); \
1010 iter = mem_cgroup_iter(root, iter, NULL))
1012 #define for_each_mem_cgroup(iter) \
1013 for (iter = mem_cgroup_iter(NULL, NULL, NULL); \
1015 iter = mem_cgroup_iter(NULL, iter, NULL))
1017 static inline bool mem_cgroup_is_root(struct mem_cgroup *memcg)
1019 return (memcg == root_mem_cgroup);
1022 void mem_cgroup_count_vm_event(struct mm_struct *mm, enum vm_event_item idx)
1024 struct mem_cgroup *memcg;
1030 memcg = mem_cgroup_from_task(rcu_dereference(mm->owner));
1031 if (unlikely(!memcg))
1036 this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGFAULT]);
1039 this_cpu_inc(memcg->stat->events[MEM_CGROUP_EVENTS_PGMAJFAULT]);
1047 EXPORT_SYMBOL(mem_cgroup_count_vm_event);
1050 * mem_cgroup_zone_lruvec - get the lru list vector for a zone and memcg
1051 * @zone: zone of the wanted lruvec
1052 * @memcg: memcg of the wanted lruvec
1054 * Returns the lru list vector holding pages for the given @zone and
1055 * @mem. This can be the global zone lruvec, if the memory controller
1058 struct lruvec *mem_cgroup_zone_lruvec(struct zone *zone,
1059 struct mem_cgroup *memcg)
1061 struct mem_cgroup_per_zone *mz;
1063 if (mem_cgroup_disabled())
1064 return &zone->lruvec;
1066 mz = mem_cgroup_zoneinfo(memcg, zone_to_nid(zone), zone_idx(zone));
1071 * Following LRU functions are allowed to be used without PCG_LOCK.
1072 * Operations are called by routine of global LRU independently from memcg.
1073 * What we have to take care of here is validness of pc->mem_cgroup.
1075 * Changes to pc->mem_cgroup happens when
1078 * In typical case, "charge" is done before add-to-lru. Exception is SwapCache.
1079 * It is added to LRU before charge.
1080 * If PCG_USED bit is not set, page_cgroup is not added to this private LRU.
1081 * When moving account, the page is not on LRU. It's isolated.
1085 * mem_cgroup_page_lruvec - return lruvec for adding an lru page
1087 * @zone: zone of the page
1089 struct lruvec *mem_cgroup_page_lruvec(struct page *page, struct zone *zone)
1091 struct mem_cgroup_per_zone *mz;
1092 struct mem_cgroup *memcg;
1093 struct page_cgroup *pc;
1095 if (mem_cgroup_disabled())
1096 return &zone->lruvec;
1098 pc = lookup_page_cgroup(page);
1099 memcg = pc->mem_cgroup;
1102 * Surreptitiously switch any uncharged offlist page to root:
1103 * an uncharged page off lru does nothing to secure
1104 * its former mem_cgroup from sudden removal.
1106 * Our caller holds lru_lock, and PageCgroupUsed is updated
1107 * under page_cgroup lock: between them, they make all uses
1108 * of pc->mem_cgroup safe.
1110 if (!PageLRU(page) && !PageCgroupUsed(pc) && memcg != root_mem_cgroup)
1111 pc->mem_cgroup = memcg = root_mem_cgroup;
1113 mz = page_cgroup_zoneinfo(memcg, page);
1118 * mem_cgroup_update_lru_size - account for adding or removing an lru page
1119 * @lruvec: mem_cgroup per zone lru vector
1120 * @lru: index of lru list the page is sitting on
1121 * @nr_pages: positive when adding or negative when removing
1123 * This function must be called when a page is added to or removed from an
1126 void mem_cgroup_update_lru_size(struct lruvec *lruvec, enum lru_list lru,
1129 struct mem_cgroup_per_zone *mz;
1130 unsigned long *lru_size;
1132 if (mem_cgroup_disabled())
1135 mz = container_of(lruvec, struct mem_cgroup_per_zone, lruvec);
1136 lru_size = mz->lru_size + lru;
1137 *lru_size += nr_pages;
1138 VM_BUG_ON((long)(*lru_size) < 0);
1142 * Checks whether given mem is same or in the root_mem_cgroup's
1145 bool __mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg,
1146 struct mem_cgroup *memcg)
1148 if (root_memcg == memcg)
1150 if (!root_memcg->use_hierarchy || !memcg)
1152 return css_is_ancestor(&memcg->css, &root_memcg->css);
1155 static bool mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg,
1156 struct mem_cgroup *memcg)
1161 ret = __mem_cgroup_same_or_subtree(root_memcg, memcg);
1166 int task_in_mem_cgroup(struct task_struct *task, const struct mem_cgroup *memcg)
1169 struct mem_cgroup *curr = NULL;
1170 struct task_struct *p;
1172 p = find_lock_task_mm(task);
1174 curr = try_get_mem_cgroup_from_mm(p->mm);
1178 * All threads may have already detached their mm's, but the oom
1179 * killer still needs to detect if they have already been oom
1180 * killed to prevent needlessly killing additional tasks.
1183 curr = mem_cgroup_from_task(task);
1185 css_get(&curr->css);
1191 * We should check use_hierarchy of "memcg" not "curr". Because checking
1192 * use_hierarchy of "curr" here make this function true if hierarchy is
1193 * enabled in "curr" and "curr" is a child of "memcg" in *cgroup*
1194 * hierarchy(even if use_hierarchy is disabled in "memcg").
1196 ret = mem_cgroup_same_or_subtree(memcg, curr);
1197 css_put(&curr->css);
1201 int mem_cgroup_inactive_anon_is_low(struct lruvec *lruvec)
1203 unsigned long inactive_ratio;
1204 unsigned long inactive;
1205 unsigned long active;
1208 inactive = mem_cgroup_get_lru_size(lruvec, LRU_INACTIVE_ANON);
1209 active = mem_cgroup_get_lru_size(lruvec, LRU_ACTIVE_ANON);
1211 gb = (inactive + active) >> (30 - PAGE_SHIFT);
1213 inactive_ratio = int_sqrt(10 * gb);
1217 return inactive * inactive_ratio < active;
1220 int mem_cgroup_inactive_file_is_low(struct lruvec *lruvec)
1222 unsigned long active;
1223 unsigned long inactive;
1225 inactive = mem_cgroup_get_lru_size(lruvec, LRU_INACTIVE_FILE);
1226 active = mem_cgroup_get_lru_size(lruvec, LRU_ACTIVE_FILE);
1228 return (active > inactive);
1231 #define mem_cgroup_from_res_counter(counter, member) \
1232 container_of(counter, struct mem_cgroup, member)
1235 * mem_cgroup_margin - calculate chargeable space of a memory cgroup
1236 * @memcg: the memory cgroup
1238 * Returns the maximum amount of memory @mem can be charged with, in
1241 static unsigned long mem_cgroup_margin(struct mem_cgroup *memcg)
1243 unsigned long long margin;
1245 margin = res_counter_margin(&memcg->res);
1246 if (do_swap_account)
1247 margin = min(margin, res_counter_margin(&memcg->memsw));
1248 return margin >> PAGE_SHIFT;
1251 int mem_cgroup_swappiness(struct mem_cgroup *memcg)
1253 struct cgroup *cgrp = memcg->css.cgroup;
1256 if (cgrp->parent == NULL)
1257 return vm_swappiness;
1259 return memcg->swappiness;
1263 * memcg->moving_account is used for checking possibility that some thread is
1264 * calling move_account(). When a thread on CPU-A starts moving pages under
1265 * a memcg, other threads should check memcg->moving_account under
1266 * rcu_read_lock(), like this:
1270 * memcg->moving_account+1 if (memcg->mocing_account)
1272 * synchronize_rcu() update something.
1277 /* for quick checking without looking up memcg */
1278 atomic_t memcg_moving __read_mostly;
1280 static void mem_cgroup_start_move(struct mem_cgroup *memcg)
1282 atomic_inc(&memcg_moving);
1283 atomic_inc(&memcg->moving_account);
1287 static void mem_cgroup_end_move(struct mem_cgroup *memcg)
1290 * Now, mem_cgroup_clear_mc() may call this function with NULL.
1291 * We check NULL in callee rather than caller.
1294 atomic_dec(&memcg_moving);
1295 atomic_dec(&memcg->moving_account);
1300 * 2 routines for checking "mem" is under move_account() or not.
1302 * mem_cgroup_stolen() - checking whether a cgroup is mc.from or not. This
1303 * is used for avoiding races in accounting. If true,
1304 * pc->mem_cgroup may be overwritten.
1306 * mem_cgroup_under_move() - checking a cgroup is mc.from or mc.to or
1307 * under hierarchy of moving cgroups. This is for
1308 * waiting at hith-memory prressure caused by "move".
1311 static bool mem_cgroup_stolen(struct mem_cgroup *memcg)
1313 VM_BUG_ON(!rcu_read_lock_held());
1314 return atomic_read(&memcg->moving_account) > 0;
1317 static bool mem_cgroup_under_move(struct mem_cgroup *memcg)
1319 struct mem_cgroup *from;
1320 struct mem_cgroup *to;
1323 * Unlike task_move routines, we access mc.to, mc.from not under
1324 * mutual exclusion by cgroup_mutex. Here, we take spinlock instead.
1326 spin_lock(&mc.lock);
1332 ret = mem_cgroup_same_or_subtree(memcg, from)
1333 || mem_cgroup_same_or_subtree(memcg, to);
1335 spin_unlock(&mc.lock);
1339 static bool mem_cgroup_wait_acct_move(struct mem_cgroup *memcg)
1341 if (mc.moving_task && current != mc.moving_task) {
1342 if (mem_cgroup_under_move(memcg)) {
1344 prepare_to_wait(&mc.waitq, &wait, TASK_INTERRUPTIBLE);
1345 /* moving charge context might have finished. */
1348 finish_wait(&mc.waitq, &wait);
1356 * Take this lock when
1357 * - a code tries to modify page's memcg while it's USED.
1358 * - a code tries to modify page state accounting in a memcg.
1359 * see mem_cgroup_stolen(), too.
1361 static void move_lock_mem_cgroup(struct mem_cgroup *memcg,
1362 unsigned long *flags)
1364 spin_lock_irqsave(&memcg->move_lock, *flags);
1367 static void move_unlock_mem_cgroup(struct mem_cgroup *memcg,
1368 unsigned long *flags)
1370 spin_unlock_irqrestore(&memcg->move_lock, *flags);
1374 * mem_cgroup_print_oom_info: Called from OOM with tasklist_lock held in read mode.
1375 * @memcg: The memory cgroup that went over limit
1376 * @p: Task that is going to be killed
1378 * NOTE: @memcg and @p's mem_cgroup can be different when hierarchy is
1381 void mem_cgroup_print_oom_info(struct mem_cgroup *memcg, struct task_struct *p)
1383 struct cgroup *task_cgrp;
1384 struct cgroup *mem_cgrp;
1386 * Need a buffer in BSS, can't rely on allocations. The code relies
1387 * on the assumption that OOM is serialized for memory controller.
1388 * If this assumption is broken, revisit this code.
1390 static char memcg_name[PATH_MAX];
1398 mem_cgrp = memcg->css.cgroup;
1399 task_cgrp = task_cgroup(p, mem_cgroup_subsys_id);
1401 ret = cgroup_path(task_cgrp, memcg_name, PATH_MAX);
1404 * Unfortunately, we are unable to convert to a useful name
1405 * But we'll still print out the usage information
1412 printk(KERN_INFO "Task in %s killed", memcg_name);
1415 ret = cgroup_path(mem_cgrp, memcg_name, PATH_MAX);
1423 * Continues from above, so we don't need an KERN_ level
1425 printk(KERN_CONT " as a result of limit of %s\n", memcg_name);
1428 printk(KERN_INFO "memory: usage %llukB, limit %llukB, failcnt %llu\n",
1429 res_counter_read_u64(&memcg->res, RES_USAGE) >> 10,
1430 res_counter_read_u64(&memcg->res, RES_LIMIT) >> 10,
1431 res_counter_read_u64(&memcg->res, RES_FAILCNT));
1432 printk(KERN_INFO "memory+swap: usage %llukB, limit %llukB, "
1434 res_counter_read_u64(&memcg->memsw, RES_USAGE) >> 10,
1435 res_counter_read_u64(&memcg->memsw, RES_LIMIT) >> 10,
1436 res_counter_read_u64(&memcg->memsw, RES_FAILCNT));
1440 * This function returns the number of memcg under hierarchy tree. Returns
1441 * 1(self count) if no children.
1443 static int mem_cgroup_count_children(struct mem_cgroup *memcg)
1446 struct mem_cgroup *iter;
1448 for_each_mem_cgroup_tree(iter, memcg)
1454 * Return the memory (and swap, if configured) limit for a memcg.
1456 static u64 mem_cgroup_get_limit(struct mem_cgroup *memcg)
1461 limit = res_counter_read_u64(&memcg->res, RES_LIMIT);
1462 limit += total_swap_pages << PAGE_SHIFT;
1464 memsw = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
1466 * If memsw is finite and limits the amount of swap space available
1467 * to this memcg, return that limit.
1469 return min(limit, memsw);
1472 void __mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask,
1475 struct mem_cgroup *iter;
1476 unsigned long chosen_points = 0;
1477 unsigned long totalpages;
1478 unsigned int points = 0;
1479 struct task_struct *chosen = NULL;
1481 totalpages = mem_cgroup_get_limit(memcg) >> PAGE_SHIFT ? : 1;
1482 for_each_mem_cgroup_tree(iter, memcg) {
1483 struct cgroup *cgroup = iter->css.cgroup;
1484 struct cgroup_iter it;
1485 struct task_struct *task;
1487 cgroup_iter_start(cgroup, &it);
1488 while ((task = cgroup_iter_next(cgroup, &it))) {
1489 switch (oom_scan_process_thread(task, totalpages, NULL,
1491 case OOM_SCAN_SELECT:
1493 put_task_struct(chosen);
1495 chosen_points = ULONG_MAX;
1496 get_task_struct(chosen);
1498 case OOM_SCAN_CONTINUE:
1500 case OOM_SCAN_ABORT:
1501 cgroup_iter_end(cgroup, &it);
1502 mem_cgroup_iter_break(memcg, iter);
1504 put_task_struct(chosen);
1509 points = oom_badness(task, memcg, NULL, totalpages);
1510 if (points > chosen_points) {
1512 put_task_struct(chosen);
1514 chosen_points = points;
1515 get_task_struct(chosen);
1518 cgroup_iter_end(cgroup, &it);
1523 points = chosen_points * 1000 / totalpages;
1524 read_lock(&tasklist_lock);
1525 oom_kill_process(chosen, gfp_mask, order, points, totalpages, memcg,
1526 NULL, "Memory cgroup out of memory");
1527 read_unlock(&tasklist_lock);
1528 put_task_struct(chosen);
1531 static unsigned long mem_cgroup_reclaim(struct mem_cgroup *memcg,
1533 unsigned long flags)
1535 unsigned long total = 0;
1536 bool noswap = false;
1539 if (flags & MEM_CGROUP_RECLAIM_NOSWAP)
1541 if (!(flags & MEM_CGROUP_RECLAIM_SHRINK) && memcg->memsw_is_minimum)
1544 for (loop = 0; loop < MEM_CGROUP_MAX_RECLAIM_LOOPS; loop++) {
1546 drain_all_stock_async(memcg);
1547 total += try_to_free_mem_cgroup_pages(memcg, gfp_mask, noswap);
1549 * Allow limit shrinkers, which are triggered directly
1550 * by userspace, to catch signals and stop reclaim
1551 * after minimal progress, regardless of the margin.
1553 if (total && (flags & MEM_CGROUP_RECLAIM_SHRINK))
1555 if (mem_cgroup_margin(memcg))
1558 * If nothing was reclaimed after two attempts, there
1559 * may be no reclaimable pages in this hierarchy.
1568 * test_mem_cgroup_node_reclaimable
1569 * @memcg: the target memcg
1570 * @nid: the node ID to be checked.
1571 * @noswap : specify true here if the user wants flle only information.
1573 * This function returns whether the specified memcg contains any
1574 * reclaimable pages on a node. Returns true if there are any reclaimable
1575 * pages in the node.
1577 static bool test_mem_cgroup_node_reclaimable(struct mem_cgroup *memcg,
1578 int nid, bool noswap)
1580 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_FILE))
1582 if (noswap || !total_swap_pages)
1584 if (mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL_ANON))
1589 #if MAX_NUMNODES > 1
1592 * Always updating the nodemask is not very good - even if we have an empty
1593 * list or the wrong list here, we can start from some node and traverse all
1594 * nodes based on the zonelist. So update the list loosely once per 10 secs.
1597 static void mem_cgroup_may_update_nodemask(struct mem_cgroup *memcg)
1601 * numainfo_events > 0 means there was at least NUMAINFO_EVENTS_TARGET
1602 * pagein/pageout changes since the last update.
1604 if (!atomic_read(&memcg->numainfo_events))
1606 if (atomic_inc_return(&memcg->numainfo_updating) > 1)
1609 /* make a nodemask where this memcg uses memory from */
1610 memcg->scan_nodes = node_states[N_HIGH_MEMORY];
1612 for_each_node_mask(nid, node_states[N_HIGH_MEMORY]) {
1614 if (!test_mem_cgroup_node_reclaimable(memcg, nid, false))
1615 node_clear(nid, memcg->scan_nodes);
1618 atomic_set(&memcg->numainfo_events, 0);
1619 atomic_set(&memcg->numainfo_updating, 0);
1623 * Selecting a node where we start reclaim from. Because what we need is just
1624 * reducing usage counter, start from anywhere is O,K. Considering
1625 * memory reclaim from current node, there are pros. and cons.
1627 * Freeing memory from current node means freeing memory from a node which
1628 * we'll use or we've used. So, it may make LRU bad. And if several threads
1629 * hit limits, it will see a contention on a node. But freeing from remote
1630 * node means more costs for memory reclaim because of memory latency.
1632 * Now, we use round-robin. Better algorithm is welcomed.
1634 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1638 mem_cgroup_may_update_nodemask(memcg);
1639 node = memcg->last_scanned_node;
1641 node = next_node(node, memcg->scan_nodes);
1642 if (node == MAX_NUMNODES)
1643 node = first_node(memcg->scan_nodes);
1645 * We call this when we hit limit, not when pages are added to LRU.
1646 * No LRU may hold pages because all pages are UNEVICTABLE or
1647 * memcg is too small and all pages are not on LRU. In that case,
1648 * we use curret node.
1650 if (unlikely(node == MAX_NUMNODES))
1651 node = numa_node_id();
1653 memcg->last_scanned_node = node;
1658 * Check all nodes whether it contains reclaimable pages or not.
1659 * For quick scan, we make use of scan_nodes. This will allow us to skip
1660 * unused nodes. But scan_nodes is lazily updated and may not cotain
1661 * enough new information. We need to do double check.
1663 static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
1668 * quick check...making use of scan_node.
1669 * We can skip unused nodes.
1671 if (!nodes_empty(memcg->scan_nodes)) {
1672 for (nid = first_node(memcg->scan_nodes);
1674 nid = next_node(nid, memcg->scan_nodes)) {
1676 if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
1681 * Check rest of nodes.
1683 for_each_node_state(nid, N_HIGH_MEMORY) {
1684 if (node_isset(nid, memcg->scan_nodes))
1686 if (test_mem_cgroup_node_reclaimable(memcg, nid, noswap))
1693 int mem_cgroup_select_victim_node(struct mem_cgroup *memcg)
1698 static bool mem_cgroup_reclaimable(struct mem_cgroup *memcg, bool noswap)
1700 return test_mem_cgroup_node_reclaimable(memcg, 0, noswap);
1704 static int mem_cgroup_soft_reclaim(struct mem_cgroup *root_memcg,
1707 unsigned long *total_scanned)
1709 struct mem_cgroup *victim = NULL;
1712 unsigned long excess;
1713 unsigned long nr_scanned;
1714 struct mem_cgroup_reclaim_cookie reclaim = {
1719 excess = res_counter_soft_limit_excess(&root_memcg->res) >> PAGE_SHIFT;
1722 victim = mem_cgroup_iter(root_memcg, victim, &reclaim);
1727 * If we have not been able to reclaim
1728 * anything, it might because there are
1729 * no reclaimable pages under this hierarchy
1734 * We want to do more targeted reclaim.
1735 * excess >> 2 is not to excessive so as to
1736 * reclaim too much, nor too less that we keep
1737 * coming back to reclaim from this cgroup
1739 if (total >= (excess >> 2) ||
1740 (loop > MEM_CGROUP_MAX_RECLAIM_LOOPS))
1745 if (!mem_cgroup_reclaimable(victim, false))
1747 total += mem_cgroup_shrink_node_zone(victim, gfp_mask, false,
1749 *total_scanned += nr_scanned;
1750 if (!res_counter_soft_limit_excess(&root_memcg->res))
1753 mem_cgroup_iter_break(root_memcg, victim);
1758 * Check OOM-Killer is already running under our hierarchy.
1759 * If someone is running, return false.
1760 * Has to be called with memcg_oom_lock
1762 static bool mem_cgroup_oom_lock(struct mem_cgroup *memcg)
1764 struct mem_cgroup *iter, *failed = NULL;
1766 for_each_mem_cgroup_tree(iter, memcg) {
1767 if (iter->oom_lock) {
1769 * this subtree of our hierarchy is already locked
1770 * so we cannot give a lock.
1773 mem_cgroup_iter_break(memcg, iter);
1776 iter->oom_lock = true;
1783 * OK, we failed to lock the whole subtree so we have to clean up
1784 * what we set up to the failing subtree
1786 for_each_mem_cgroup_tree(iter, memcg) {
1787 if (iter == failed) {
1788 mem_cgroup_iter_break(memcg, iter);
1791 iter->oom_lock = false;
1797 * Has to be called with memcg_oom_lock
1799 static int mem_cgroup_oom_unlock(struct mem_cgroup *memcg)
1801 struct mem_cgroup *iter;
1803 for_each_mem_cgroup_tree(iter, memcg)
1804 iter->oom_lock = false;
1808 static void mem_cgroup_mark_under_oom(struct mem_cgroup *memcg)
1810 struct mem_cgroup *iter;
1812 for_each_mem_cgroup_tree(iter, memcg)
1813 atomic_inc(&iter->under_oom);
1816 static void mem_cgroup_unmark_under_oom(struct mem_cgroup *memcg)
1818 struct mem_cgroup *iter;
1821 * When a new child is created while the hierarchy is under oom,
1822 * mem_cgroup_oom_lock() may not be called. We have to use
1823 * atomic_add_unless() here.
1825 for_each_mem_cgroup_tree(iter, memcg)
1826 atomic_add_unless(&iter->under_oom, -1, 0);
1829 static DEFINE_SPINLOCK(memcg_oom_lock);
1830 static DECLARE_WAIT_QUEUE_HEAD(memcg_oom_waitq);
1832 struct oom_wait_info {
1833 struct mem_cgroup *memcg;
1837 static int memcg_oom_wake_function(wait_queue_t *wait,
1838 unsigned mode, int sync, void *arg)
1840 struct mem_cgroup *wake_memcg = (struct mem_cgroup *)arg;
1841 struct mem_cgroup *oom_wait_memcg;
1842 struct oom_wait_info *oom_wait_info;
1844 oom_wait_info = container_of(wait, struct oom_wait_info, wait);
1845 oom_wait_memcg = oom_wait_info->memcg;
1848 * Both of oom_wait_info->memcg and wake_memcg are stable under us.
1849 * Then we can use css_is_ancestor without taking care of RCU.
1851 if (!mem_cgroup_same_or_subtree(oom_wait_memcg, wake_memcg)
1852 && !mem_cgroup_same_or_subtree(wake_memcg, oom_wait_memcg))
1854 return autoremove_wake_function(wait, mode, sync, arg);
1857 static void memcg_wakeup_oom(struct mem_cgroup *memcg)
1859 /* for filtering, pass "memcg" as argument. */
1860 __wake_up(&memcg_oom_waitq, TASK_NORMAL, 0, memcg);
1863 static void memcg_oom_recover(struct mem_cgroup *memcg)
1865 if (memcg && atomic_read(&memcg->under_oom))
1866 memcg_wakeup_oom(memcg);
1870 * try to call OOM killer. returns false if we should exit memory-reclaim loop.
1872 static bool mem_cgroup_handle_oom(struct mem_cgroup *memcg, gfp_t mask,
1875 struct oom_wait_info owait;
1876 bool locked, need_to_kill;
1878 owait.memcg = memcg;
1879 owait.wait.flags = 0;
1880 owait.wait.func = memcg_oom_wake_function;
1881 owait.wait.private = current;
1882 INIT_LIST_HEAD(&owait.wait.task_list);
1883 need_to_kill = true;
1884 mem_cgroup_mark_under_oom(memcg);
1886 /* At first, try to OOM lock hierarchy under memcg.*/
1887 spin_lock(&memcg_oom_lock);
1888 locked = mem_cgroup_oom_lock(memcg);
1890 * Even if signal_pending(), we can't quit charge() loop without
1891 * accounting. So, UNINTERRUPTIBLE is appropriate. But SIGKILL
1892 * under OOM is always welcomed, use TASK_KILLABLE here.
1894 prepare_to_wait(&memcg_oom_waitq, &owait.wait, TASK_KILLABLE);
1895 if (!locked || memcg->oom_kill_disable)
1896 need_to_kill = false;
1898 mem_cgroup_oom_notify(memcg);
1899 spin_unlock(&memcg_oom_lock);
1902 finish_wait(&memcg_oom_waitq, &owait.wait);
1903 mem_cgroup_out_of_memory(memcg, mask, order);
1906 finish_wait(&memcg_oom_waitq, &owait.wait);
1908 spin_lock(&memcg_oom_lock);
1910 mem_cgroup_oom_unlock(memcg);
1911 memcg_wakeup_oom(memcg);
1912 spin_unlock(&memcg_oom_lock);
1914 mem_cgroup_unmark_under_oom(memcg);
1916 if (test_thread_flag(TIF_MEMDIE) || fatal_signal_pending(current))
1918 /* Give chance to dying process */
1919 schedule_timeout_uninterruptible(1);
1924 * Currently used to update mapped file statistics, but the routine can be
1925 * generalized to update other statistics as well.
1927 * Notes: Race condition
1929 * We usually use page_cgroup_lock() for accessing page_cgroup member but
1930 * it tends to be costly. But considering some conditions, we doesn't need
1931 * to do so _always_.
1933 * Considering "charge", lock_page_cgroup() is not required because all
1934 * file-stat operations happen after a page is attached to radix-tree. There
1935 * are no race with "charge".
1937 * Considering "uncharge", we know that memcg doesn't clear pc->mem_cgroup
1938 * at "uncharge" intentionally. So, we always see valid pc->mem_cgroup even
1939 * if there are race with "uncharge". Statistics itself is properly handled
1942 * Considering "move", this is an only case we see a race. To make the race
1943 * small, we check mm->moving_account and detect there are possibility of race
1944 * If there is, we take a lock.
1947 void __mem_cgroup_begin_update_page_stat(struct page *page,
1948 bool *locked, unsigned long *flags)
1950 struct mem_cgroup *memcg;
1951 struct page_cgroup *pc;
1953 pc = lookup_page_cgroup(page);
1955 memcg = pc->mem_cgroup;
1956 if (unlikely(!memcg || !PageCgroupUsed(pc)))
1959 * If this memory cgroup is not under account moving, we don't
1960 * need to take move_lock_mem_cgroup(). Because we already hold
1961 * rcu_read_lock(), any calls to move_account will be delayed until
1962 * rcu_read_unlock() if mem_cgroup_stolen() == true.
1964 if (!mem_cgroup_stolen(memcg))
1967 move_lock_mem_cgroup(memcg, flags);
1968 if (memcg != pc->mem_cgroup || !PageCgroupUsed(pc)) {
1969 move_unlock_mem_cgroup(memcg, flags);
1975 void __mem_cgroup_end_update_page_stat(struct page *page, unsigned long *flags)
1977 struct page_cgroup *pc = lookup_page_cgroup(page);
1980 * It's guaranteed that pc->mem_cgroup never changes while
1981 * lock is held because a routine modifies pc->mem_cgroup
1982 * should take move_lock_mem_cgroup().
1984 move_unlock_mem_cgroup(pc->mem_cgroup, flags);
1987 void mem_cgroup_update_page_stat(struct page *page,
1988 enum mem_cgroup_page_stat_item idx, int val)
1990 struct mem_cgroup *memcg;
1991 struct page_cgroup *pc = lookup_page_cgroup(page);
1992 unsigned long uninitialized_var(flags);
1994 if (mem_cgroup_disabled())
1997 memcg = pc->mem_cgroup;
1998 if (unlikely(!memcg || !PageCgroupUsed(pc)))
2002 case MEMCG_NR_FILE_MAPPED:
2003 idx = MEM_CGROUP_STAT_FILE_MAPPED;
2009 this_cpu_add(memcg->stat->count[idx], val);
2013 * size of first charge trial. "32" comes from vmscan.c's magic value.
2014 * TODO: maybe necessary to use big numbers in big irons.
2016 #define CHARGE_BATCH 32U
2017 struct memcg_stock_pcp {
2018 struct mem_cgroup *cached; /* this never be root cgroup */
2019 unsigned int nr_pages;
2020 struct work_struct work;
2021 unsigned long flags;
2022 #define FLUSHING_CACHED_CHARGE 0
2024 static DEFINE_PER_CPU(struct memcg_stock_pcp, memcg_stock);
2025 static DEFINE_MUTEX(percpu_charge_mutex);
2028 * Try to consume stocked charge on this cpu. If success, one page is consumed
2029 * from local stock and true is returned. If the stock is 0 or charges from a
2030 * cgroup which is not current target, returns false. This stock will be
2033 static bool consume_stock(struct mem_cgroup *memcg)
2035 struct memcg_stock_pcp *stock;
2038 stock = &get_cpu_var(memcg_stock);
2039 if (memcg == stock->cached && stock->nr_pages)
2041 else /* need to call res_counter_charge */
2043 put_cpu_var(memcg_stock);
2048 * Returns stocks cached in percpu to res_counter and reset cached information.
2050 static void drain_stock(struct memcg_stock_pcp *stock)
2052 struct mem_cgroup *old = stock->cached;
2054 if (stock->nr_pages) {
2055 unsigned long bytes = stock->nr_pages * PAGE_SIZE;
2057 res_counter_uncharge(&old->res, bytes);
2058 if (do_swap_account)
2059 res_counter_uncharge(&old->memsw, bytes);
2060 stock->nr_pages = 0;
2062 stock->cached = NULL;
2066 * This must be called under preempt disabled or must be called by
2067 * a thread which is pinned to local cpu.
2069 static void drain_local_stock(struct work_struct *dummy)
2071 struct memcg_stock_pcp *stock = &__get_cpu_var(memcg_stock);
2073 clear_bit(FLUSHING_CACHED_CHARGE, &stock->flags);
2077 * Cache charges(val) which is from res_counter, to local per_cpu area.
2078 * This will be consumed by consume_stock() function, later.
2080 static void refill_stock(struct mem_cgroup *memcg, unsigned int nr_pages)
2082 struct memcg_stock_pcp *stock = &get_cpu_var(memcg_stock);
2084 if (stock->cached != memcg) { /* reset if necessary */
2086 stock->cached = memcg;
2088 stock->nr_pages += nr_pages;
2089 put_cpu_var(memcg_stock);
2093 * Drains all per-CPU charge caches for given root_memcg resp. subtree
2094 * of the hierarchy under it. sync flag says whether we should block
2095 * until the work is done.
2097 static void drain_all_stock(struct mem_cgroup *root_memcg, bool sync)
2101 /* Notify other cpus that system-wide "drain" is running */
2104 for_each_online_cpu(cpu) {
2105 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2106 struct mem_cgroup *memcg;
2108 memcg = stock->cached;
2109 if (!memcg || !stock->nr_pages)
2111 if (!mem_cgroup_same_or_subtree(root_memcg, memcg))
2113 if (!test_and_set_bit(FLUSHING_CACHED_CHARGE, &stock->flags)) {
2115 drain_local_stock(&stock->work);
2117 schedule_work_on(cpu, &stock->work);
2125 for_each_online_cpu(cpu) {
2126 struct memcg_stock_pcp *stock = &per_cpu(memcg_stock, cpu);
2127 if (test_bit(FLUSHING_CACHED_CHARGE, &stock->flags))
2128 flush_work(&stock->work);
2135 * Tries to drain stocked charges in other cpus. This function is asynchronous
2136 * and just put a work per cpu for draining localy on each cpu. Caller can
2137 * expects some charges will be back to res_counter later but cannot wait for
2140 static void drain_all_stock_async(struct mem_cgroup *root_memcg)
2143 * If someone calls draining, avoid adding more kworker runs.
2145 if (!mutex_trylock(&percpu_charge_mutex))
2147 drain_all_stock(root_memcg, false);
2148 mutex_unlock(&percpu_charge_mutex);
2151 /* This is a synchronous drain interface. */
2152 static void drain_all_stock_sync(struct mem_cgroup *root_memcg)
2154 /* called when force_empty is called */
2155 mutex_lock(&percpu_charge_mutex);
2156 drain_all_stock(root_memcg, true);
2157 mutex_unlock(&percpu_charge_mutex);
2161 * This function drains percpu counter value from DEAD cpu and
2162 * move it to local cpu. Note that this function can be preempted.
2164 static void mem_cgroup_drain_pcp_counter(struct mem_cgroup *memcg, int cpu)
2168 spin_lock(&memcg->pcp_counter_lock);
2169 for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) {
2170 long x = per_cpu(memcg->stat->count[i], cpu);
2172 per_cpu(memcg->stat->count[i], cpu) = 0;
2173 memcg->nocpu_base.count[i] += x;
2175 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) {
2176 unsigned long x = per_cpu(memcg->stat->events[i], cpu);
2178 per_cpu(memcg->stat->events[i], cpu) = 0;
2179 memcg->nocpu_base.events[i] += x;
2181 spin_unlock(&memcg->pcp_counter_lock);
2184 static int __cpuinit memcg_cpu_hotplug_callback(struct notifier_block *nb,
2185 unsigned long action,
2188 int cpu = (unsigned long)hcpu;
2189 struct memcg_stock_pcp *stock;
2190 struct mem_cgroup *iter;
2192 if (action == CPU_ONLINE)
2195 if (action != CPU_DEAD && action != CPU_DEAD_FROZEN)
2198 for_each_mem_cgroup(iter)
2199 mem_cgroup_drain_pcp_counter(iter, cpu);
2201 stock = &per_cpu(memcg_stock, cpu);
2207 /* See __mem_cgroup_try_charge() for details */
2209 CHARGE_OK, /* success */
2210 CHARGE_RETRY, /* need to retry but retry is not bad */
2211 CHARGE_NOMEM, /* we can't do more. return -ENOMEM */
2212 CHARGE_WOULDBLOCK, /* GFP_WAIT wasn't set and no enough res. */
2213 CHARGE_OOM_DIE, /* the current is killed because of OOM */
2216 static int mem_cgroup_do_charge(struct mem_cgroup *memcg, gfp_t gfp_mask,
2217 unsigned int nr_pages, bool oom_check)
2219 unsigned long csize = nr_pages * PAGE_SIZE;
2220 struct mem_cgroup *mem_over_limit;
2221 struct res_counter *fail_res;
2222 unsigned long flags = 0;
2225 ret = res_counter_charge(&memcg->res, csize, &fail_res);
2228 if (!do_swap_account)
2230 ret = res_counter_charge(&memcg->memsw, csize, &fail_res);
2234 res_counter_uncharge(&memcg->res, csize);
2235 mem_over_limit = mem_cgroup_from_res_counter(fail_res, memsw);
2236 flags |= MEM_CGROUP_RECLAIM_NOSWAP;
2238 mem_over_limit = mem_cgroup_from_res_counter(fail_res, res);
2240 * nr_pages can be either a huge page (HPAGE_PMD_NR), a batch
2241 * of regular pages (CHARGE_BATCH), or a single regular page (1).
2243 * Never reclaim on behalf of optional batching, retry with a
2244 * single page instead.
2246 if (nr_pages == CHARGE_BATCH)
2247 return CHARGE_RETRY;
2249 if (!(gfp_mask & __GFP_WAIT))
2250 return CHARGE_WOULDBLOCK;
2252 ret = mem_cgroup_reclaim(mem_over_limit, gfp_mask, flags);
2253 if (mem_cgroup_margin(mem_over_limit) >= nr_pages)
2254 return CHARGE_RETRY;
2256 * Even though the limit is exceeded at this point, reclaim
2257 * may have been able to free some pages. Retry the charge
2258 * before killing the task.
2260 * Only for regular pages, though: huge pages are rather
2261 * unlikely to succeed so close to the limit, and we fall back
2262 * to regular pages anyway in case of failure.
2264 if (nr_pages == 1 && ret)
2265 return CHARGE_RETRY;
2268 * At task move, charge accounts can be doubly counted. So, it's
2269 * better to wait until the end of task_move if something is going on.
2271 if (mem_cgroup_wait_acct_move(mem_over_limit))
2272 return CHARGE_RETRY;
2274 /* If we don't need to call oom-killer at el, return immediately */
2276 return CHARGE_NOMEM;
2278 if (!mem_cgroup_handle_oom(mem_over_limit, gfp_mask, get_order(csize)))
2279 return CHARGE_OOM_DIE;
2281 return CHARGE_RETRY;
2285 * __mem_cgroup_try_charge() does
2286 * 1. detect memcg to be charged against from passed *mm and *ptr,
2287 * 2. update res_counter
2288 * 3. call memory reclaim if necessary.
2290 * In some special case, if the task is fatal, fatal_signal_pending() or
2291 * has TIF_MEMDIE, this function returns -EINTR while writing root_mem_cgroup
2292 * to *ptr. There are two reasons for this. 1: fatal threads should quit as soon
2293 * as possible without any hazards. 2: all pages should have a valid
2294 * pc->mem_cgroup. If mm is NULL and the caller doesn't pass a valid memcg
2295 * pointer, that is treated as a charge to root_mem_cgroup.
2297 * So __mem_cgroup_try_charge() will return
2298 * 0 ... on success, filling *ptr with a valid memcg pointer.
2299 * -ENOMEM ... charge failure because of resource limits.
2300 * -EINTR ... if thread is fatal. *ptr is filled with root_mem_cgroup.
2302 * Unlike the exported interface, an "oom" parameter is added. if oom==true,
2303 * the oom-killer can be invoked.
2305 static int __mem_cgroup_try_charge(struct mm_struct *mm,
2307 unsigned int nr_pages,
2308 struct mem_cgroup **ptr,
2311 unsigned int batch = max(CHARGE_BATCH, nr_pages);
2312 int nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES;
2313 struct mem_cgroup *memcg = NULL;
2317 * Unlike gloval-vm's OOM-kill, we're not in memory shortage
2318 * in system level. So, allow to go ahead dying process in addition to
2321 if (unlikely(test_thread_flag(TIF_MEMDIE)
2322 || fatal_signal_pending(current)))
2326 * We always charge the cgroup the mm_struct belongs to.
2327 * The mm_struct's mem_cgroup changes on task migration if the
2328 * thread group leader migrates. It's possible that mm is not
2329 * set, if so charge the init_mm (happens for pagecache usage).
2332 *ptr = root_mem_cgroup;
2334 if (*ptr) { /* css should be a valid one */
2336 VM_BUG_ON(css_is_removed(&memcg->css));
2337 if (mem_cgroup_is_root(memcg))
2339 if (nr_pages == 1 && consume_stock(memcg))
2341 css_get(&memcg->css);
2343 struct task_struct *p;
2346 p = rcu_dereference(mm->owner);
2348 * Because we don't have task_lock(), "p" can exit.
2349 * In that case, "memcg" can point to root or p can be NULL with
2350 * race with swapoff. Then, we have small risk of mis-accouning.
2351 * But such kind of mis-account by race always happens because
2352 * we don't have cgroup_mutex(). It's overkill and we allo that
2354 * (*) swapoff at el will charge against mm-struct not against
2355 * task-struct. So, mm->owner can be NULL.
2357 memcg = mem_cgroup_from_task(p);
2359 memcg = root_mem_cgroup;
2360 if (mem_cgroup_is_root(memcg)) {
2364 if (nr_pages == 1 && consume_stock(memcg)) {
2366 * It seems dagerous to access memcg without css_get().
2367 * But considering how consume_stok works, it's not
2368 * necessary. If consume_stock success, some charges
2369 * from this memcg are cached on this cpu. So, we
2370 * don't need to call css_get()/css_tryget() before
2371 * calling consume_stock().
2376 /* after here, we may be blocked. we need to get refcnt */
2377 if (!css_tryget(&memcg->css)) {
2387 /* If killed, bypass charge */
2388 if (fatal_signal_pending(current)) {
2389 css_put(&memcg->css);
2394 if (oom && !nr_oom_retries) {
2396 nr_oom_retries = MEM_CGROUP_RECLAIM_RETRIES;
2399 ret = mem_cgroup_do_charge(memcg, gfp_mask, batch, oom_check);
2403 case CHARGE_RETRY: /* not in OOM situation but retry */
2405 css_put(&memcg->css);
2408 case CHARGE_WOULDBLOCK: /* !__GFP_WAIT */
2409 css_put(&memcg->css);
2411 case CHARGE_NOMEM: /* OOM routine works */
2413 css_put(&memcg->css);
2416 /* If oom, we never return -ENOMEM */
2419 case CHARGE_OOM_DIE: /* Killed by OOM Killer */
2420 css_put(&memcg->css);
2423 } while (ret != CHARGE_OK);
2425 if (batch > nr_pages)
2426 refill_stock(memcg, batch - nr_pages);
2427 css_put(&memcg->css);
2435 *ptr = root_mem_cgroup;
2440 * Somemtimes we have to undo a charge we got by try_charge().
2441 * This function is for that and do uncharge, put css's refcnt.
2442 * gotten by try_charge().
2444 static void __mem_cgroup_cancel_charge(struct mem_cgroup *memcg,
2445 unsigned int nr_pages)
2447 if (!mem_cgroup_is_root(memcg)) {
2448 unsigned long bytes = nr_pages * PAGE_SIZE;
2450 res_counter_uncharge(&memcg->res, bytes);
2451 if (do_swap_account)
2452 res_counter_uncharge(&memcg->memsw, bytes);
2457 * Cancel chrages in this cgroup....doesn't propagate to parent cgroup.
2458 * This is useful when moving usage to parent cgroup.
2460 static void __mem_cgroup_cancel_local_charge(struct mem_cgroup *memcg,
2461 unsigned int nr_pages)
2463 unsigned long bytes = nr_pages * PAGE_SIZE;
2465 if (mem_cgroup_is_root(memcg))
2468 res_counter_uncharge_until(&memcg->res, memcg->res.parent, bytes);
2469 if (do_swap_account)
2470 res_counter_uncharge_until(&memcg->memsw,
2471 memcg->memsw.parent, bytes);
2475 * A helper function to get mem_cgroup from ID. must be called under
2476 * rcu_read_lock(). The caller must check css_is_removed() or some if
2477 * it's concern. (dropping refcnt from swap can be called against removed
2480 static struct mem_cgroup *mem_cgroup_lookup(unsigned short id)
2482 struct cgroup_subsys_state *css;
2484 /* ID 0 is unused ID */
2487 css = css_lookup(&mem_cgroup_subsys, id);
2490 return container_of(css, struct mem_cgroup, css);
2493 struct mem_cgroup *try_get_mem_cgroup_from_page(struct page *page)
2495 struct mem_cgroup *memcg = NULL;
2496 struct page_cgroup *pc;
2500 VM_BUG_ON(!PageLocked(page));
2502 pc = lookup_page_cgroup(page);
2503 lock_page_cgroup(pc);
2504 if (PageCgroupUsed(pc)) {
2505 memcg = pc->mem_cgroup;
2506 if (memcg && !css_tryget(&memcg->css))
2508 } else if (PageSwapCache(page)) {
2509 ent.val = page_private(page);
2510 id = lookup_swap_cgroup_id(ent);
2512 memcg = mem_cgroup_lookup(id);
2513 if (memcg && !css_tryget(&memcg->css))
2517 unlock_page_cgroup(pc);
2521 static void __mem_cgroup_commit_charge(struct mem_cgroup *memcg,
2523 unsigned int nr_pages,
2524 enum charge_type ctype,
2527 struct page_cgroup *pc = lookup_page_cgroup(page);
2528 struct zone *uninitialized_var(zone);
2529 struct lruvec *lruvec;
2530 bool was_on_lru = false;
2533 lock_page_cgroup(pc);
2534 if (unlikely(PageCgroupUsed(pc))) {
2535 unlock_page_cgroup(pc);
2536 __mem_cgroup_cancel_charge(memcg, nr_pages);
2540 * we don't need page_cgroup_lock about tail pages, becase they are not
2541 * accessed by any other context at this point.
2545 * In some cases, SwapCache and FUSE(splice_buf->radixtree), the page
2546 * may already be on some other mem_cgroup's LRU. Take care of it.
2549 zone = page_zone(page);
2550 spin_lock_irq(&zone->lru_lock);
2551 if (PageLRU(page)) {
2552 lruvec = mem_cgroup_zone_lruvec(zone, pc->mem_cgroup);
2554 del_page_from_lru_list(page, lruvec, page_lru(page));
2559 pc->mem_cgroup = memcg;
2561 * We access a page_cgroup asynchronously without lock_page_cgroup().
2562 * Especially when a page_cgroup is taken from a page, pc->mem_cgroup
2563 * is accessed after testing USED bit. To make pc->mem_cgroup visible
2564 * before USED bit, we need memory barrier here.
2565 * See mem_cgroup_add_lru_list(), etc.
2568 SetPageCgroupUsed(pc);
2572 lruvec = mem_cgroup_zone_lruvec(zone, pc->mem_cgroup);
2573 VM_BUG_ON(PageLRU(page));
2575 add_page_to_lru_list(page, lruvec, page_lru(page));
2577 spin_unlock_irq(&zone->lru_lock);
2580 if (ctype == MEM_CGROUP_CHARGE_TYPE_ANON)
2585 mem_cgroup_charge_statistics(memcg, anon, nr_pages);
2586 unlock_page_cgroup(pc);
2589 * "charge_statistics" updated event counter. Then, check it.
2590 * Insert ancestor (and ancestor's ancestors), to softlimit RB-tree.
2591 * if they exceeds softlimit.
2593 memcg_check_events(memcg, page);
2596 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
2598 #define PCGF_NOCOPY_AT_SPLIT (1 << PCG_LOCK | 1 << PCG_MIGRATION)
2600 * Because tail pages are not marked as "used", set it. We're under
2601 * zone->lru_lock, 'splitting on pmd' and compound_lock.
2602 * charge/uncharge will be never happen and move_account() is done under
2603 * compound_lock(), so we don't have to take care of races.
2605 void mem_cgroup_split_huge_fixup(struct page *head)
2607 struct page_cgroup *head_pc = lookup_page_cgroup(head);
2608 struct page_cgroup *pc;
2611 if (mem_cgroup_disabled())
2613 for (i = 1; i < HPAGE_PMD_NR; i++) {
2615 pc->mem_cgroup = head_pc->mem_cgroup;
2616 smp_wmb();/* see __commit_charge() */
2617 pc->flags = head_pc->flags & ~PCGF_NOCOPY_AT_SPLIT;
2620 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
2623 * mem_cgroup_move_account - move account of the page
2625 * @nr_pages: number of regular pages (>1 for huge pages)
2626 * @pc: page_cgroup of the page.
2627 * @from: mem_cgroup which the page is moved from.
2628 * @to: mem_cgroup which the page is moved to. @from != @to.
2630 * The caller must confirm following.
2631 * - page is not on LRU (isolate_page() is useful.)
2632 * - compound_lock is held when nr_pages > 1
2634 * This function doesn't do "charge" to new cgroup and doesn't do "uncharge"
2637 static int mem_cgroup_move_account(struct page *page,
2638 unsigned int nr_pages,
2639 struct page_cgroup *pc,
2640 struct mem_cgroup *from,
2641 struct mem_cgroup *to)
2643 unsigned long flags;
2645 bool anon = PageAnon(page);
2647 VM_BUG_ON(from == to);
2648 VM_BUG_ON(PageLRU(page));
2650 * The page is isolated from LRU. So, collapse function
2651 * will not handle this page. But page splitting can happen.
2652 * Do this check under compound_page_lock(). The caller should
2656 if (nr_pages > 1 && !PageTransHuge(page))
2659 lock_page_cgroup(pc);
2662 if (!PageCgroupUsed(pc) || pc->mem_cgroup != from)
2665 move_lock_mem_cgroup(from, &flags);
2667 if (!anon && page_mapped(page)) {
2668 /* Update mapped_file data for mem_cgroup */
2670 __this_cpu_dec(from->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]);
2671 __this_cpu_inc(to->stat->count[MEM_CGROUP_STAT_FILE_MAPPED]);
2674 mem_cgroup_charge_statistics(from, anon, -nr_pages);
2676 /* caller should have done css_get */
2677 pc->mem_cgroup = to;
2678 mem_cgroup_charge_statistics(to, anon, nr_pages);
2680 * We charges against "to" which may not have any tasks. Then, "to"
2681 * can be under rmdir(). But in current implementation, caller of
2682 * this function is just force_empty() and move charge, so it's
2683 * guaranteed that "to" is never removed. So, we don't check rmdir
2686 move_unlock_mem_cgroup(from, &flags);
2689 unlock_page_cgroup(pc);
2693 memcg_check_events(to, page);
2694 memcg_check_events(from, page);
2700 * move charges to its parent.
2703 static int mem_cgroup_move_parent(struct page *page,
2704 struct page_cgroup *pc,
2705 struct mem_cgroup *child)
2707 struct mem_cgroup *parent;
2708 unsigned int nr_pages;
2709 unsigned long uninitialized_var(flags);
2713 if (mem_cgroup_is_root(child))
2717 if (!get_page_unless_zero(page))
2719 if (isolate_lru_page(page))
2722 nr_pages = hpage_nr_pages(page);
2724 parent = parent_mem_cgroup(child);
2726 * If no parent, move charges to root cgroup.
2729 parent = root_mem_cgroup;
2732 flags = compound_lock_irqsave(page);
2734 ret = mem_cgroup_move_account(page, nr_pages,
2737 __mem_cgroup_cancel_local_charge(child, nr_pages);
2740 compound_unlock_irqrestore(page, flags);
2741 putback_lru_page(page);
2749 * Charge the memory controller for page usage.
2751 * 0 if the charge was successful
2752 * < 0 if the cgroup is over its limit
2754 static int mem_cgroup_charge_common(struct page *page, struct mm_struct *mm,
2755 gfp_t gfp_mask, enum charge_type ctype)
2757 struct mem_cgroup *memcg = NULL;
2758 unsigned int nr_pages = 1;
2762 if (PageTransHuge(page)) {
2763 nr_pages <<= compound_order(page);
2764 VM_BUG_ON(!PageTransHuge(page));
2766 * Never OOM-kill a process for a huge page. The
2767 * fault handler will fall back to regular pages.
2772 ret = __mem_cgroup_try_charge(mm, gfp_mask, nr_pages, &memcg, oom);
2775 __mem_cgroup_commit_charge(memcg, page, nr_pages, ctype, false);
2779 int mem_cgroup_newpage_charge(struct page *page,
2780 struct mm_struct *mm, gfp_t gfp_mask)
2782 if (mem_cgroup_disabled())
2784 VM_BUG_ON(page_mapped(page));
2785 VM_BUG_ON(page->mapping && !PageAnon(page));
2787 return mem_cgroup_charge_common(page, mm, gfp_mask,
2788 MEM_CGROUP_CHARGE_TYPE_ANON);
2792 __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *ptr,
2793 enum charge_type ctype);
2795 int mem_cgroup_cache_charge(struct page *page, struct mm_struct *mm,
2798 struct mem_cgroup *memcg = NULL;
2799 enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE;
2802 if (mem_cgroup_disabled())
2804 if (PageCompound(page))
2809 if (!page_is_file_cache(page))
2810 type = MEM_CGROUP_CHARGE_TYPE_SHMEM;
2812 if (!PageSwapCache(page))
2813 ret = mem_cgroup_charge_common(page, mm, gfp_mask, type);
2814 else { /* page is swapcache/shmem */
2815 ret = mem_cgroup_try_charge_swapin(mm, page, gfp_mask, &memcg);
2817 __mem_cgroup_commit_charge_swapin(page, memcg, type);
2823 * While swap-in, try_charge -> commit or cancel, the page is locked.
2824 * And when try_charge() successfully returns, one refcnt to memcg without
2825 * struct page_cgroup is acquired. This refcnt will be consumed by
2826 * "commit()" or removed by "cancel()"
2828 int mem_cgroup_try_charge_swapin(struct mm_struct *mm,
2830 gfp_t mask, struct mem_cgroup **memcgp)
2832 struct mem_cgroup *memcg;
2837 if (mem_cgroup_disabled())
2840 if (!do_swap_account)
2843 * A racing thread's fault, or swapoff, may have already updated
2844 * the pte, and even removed page from swap cache: in those cases
2845 * do_swap_page()'s pte_same() test will fail; but there's also a
2846 * KSM case which does need to charge the page.
2848 if (!PageSwapCache(page))
2850 memcg = try_get_mem_cgroup_from_page(page);
2854 ret = __mem_cgroup_try_charge(NULL, mask, 1, memcgp, true);
2855 css_put(&memcg->css);
2862 ret = __mem_cgroup_try_charge(mm, mask, 1, memcgp, true);
2869 __mem_cgroup_commit_charge_swapin(struct page *page, struct mem_cgroup *memcg,
2870 enum charge_type ctype)
2872 if (mem_cgroup_disabled())
2876 cgroup_exclude_rmdir(&memcg->css);
2878 __mem_cgroup_commit_charge(memcg, page, 1, ctype, true);
2880 * Now swap is on-memory. This means this page may be
2881 * counted both as mem and swap....double count.
2882 * Fix it by uncharging from memsw. Basically, this SwapCache is stable
2883 * under lock_page(). But in do_swap_page()::memory.c, reuse_swap_page()
2884 * may call delete_from_swap_cache() before reach here.
2886 if (do_swap_account && PageSwapCache(page)) {
2887 swp_entry_t ent = {.val = page_private(page)};
2888 mem_cgroup_uncharge_swap(ent);
2891 * At swapin, we may charge account against cgroup which has no tasks.
2892 * So, rmdir()->pre_destroy() can be called while we do this charge.
2893 * In that case, we need to call pre_destroy() again. check it here.
2895 cgroup_release_and_wakeup_rmdir(&memcg->css);
2898 void mem_cgroup_commit_charge_swapin(struct page *page,
2899 struct mem_cgroup *memcg)
2901 __mem_cgroup_commit_charge_swapin(page, memcg,
2902 MEM_CGROUP_CHARGE_TYPE_ANON);
2905 void mem_cgroup_cancel_charge_swapin(struct mem_cgroup *memcg)
2907 if (mem_cgroup_disabled())
2911 __mem_cgroup_cancel_charge(memcg, 1);
2914 static void mem_cgroup_do_uncharge(struct mem_cgroup *memcg,
2915 unsigned int nr_pages,
2916 const enum charge_type ctype)
2918 struct memcg_batch_info *batch = NULL;
2919 bool uncharge_memsw = true;
2921 /* If swapout, usage of swap doesn't decrease */
2922 if (!do_swap_account || ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT)
2923 uncharge_memsw = false;
2925 batch = ¤t->memcg_batch;
2927 * In usual, we do css_get() when we remember memcg pointer.
2928 * But in this case, we keep res->usage until end of a series of
2929 * uncharges. Then, it's ok to ignore memcg's refcnt.
2932 batch->memcg = memcg;
2934 * do_batch > 0 when unmapping pages or inode invalidate/truncate.
2935 * In those cases, all pages freed continuously can be expected to be in
2936 * the same cgroup and we have chance to coalesce uncharges.
2937 * But we do uncharge one by one if this is killed by OOM(TIF_MEMDIE)
2938 * because we want to do uncharge as soon as possible.
2941 if (!batch->do_batch || test_thread_flag(TIF_MEMDIE))
2942 goto direct_uncharge;
2945 goto direct_uncharge;
2948 * In typical case, batch->memcg == mem. This means we can
2949 * merge a series of uncharges to an uncharge of res_counter.
2950 * If not, we uncharge res_counter ony by one.
2952 if (batch->memcg != memcg)
2953 goto direct_uncharge;
2954 /* remember freed charge and uncharge it later */
2957 batch->memsw_nr_pages++;
2960 res_counter_uncharge(&memcg->res, nr_pages * PAGE_SIZE);
2962 res_counter_uncharge(&memcg->memsw, nr_pages * PAGE_SIZE);
2963 if (unlikely(batch->memcg != memcg))
2964 memcg_oom_recover(memcg);
2968 * uncharge if !page_mapped(page)
2970 static struct mem_cgroup *
2971 __mem_cgroup_uncharge_common(struct page *page, enum charge_type ctype)
2973 struct mem_cgroup *memcg = NULL;
2974 unsigned int nr_pages = 1;
2975 struct page_cgroup *pc;
2978 if (mem_cgroup_disabled())
2981 if (PageSwapCache(page))
2984 if (PageTransHuge(page)) {
2985 nr_pages <<= compound_order(page);
2986 VM_BUG_ON(!PageTransHuge(page));
2989 * Check if our page_cgroup is valid
2991 pc = lookup_page_cgroup(page);
2992 if (unlikely(!PageCgroupUsed(pc)))
2995 lock_page_cgroup(pc);
2997 memcg = pc->mem_cgroup;
2999 if (!PageCgroupUsed(pc))
3002 anon = PageAnon(page);
3005 case MEM_CGROUP_CHARGE_TYPE_ANON:
3007 * Generally PageAnon tells if it's the anon statistics to be
3008 * updated; but sometimes e.g. mem_cgroup_uncharge_page() is
3009 * used before page reached the stage of being marked PageAnon.
3013 case MEM_CGROUP_CHARGE_TYPE_DROP:
3014 /* See mem_cgroup_prepare_migration() */
3015 if (page_mapped(page) || PageCgroupMigration(pc))
3018 case MEM_CGROUP_CHARGE_TYPE_SWAPOUT:
3019 if (!PageAnon(page)) { /* Shared memory */
3020 if (page->mapping && !page_is_file_cache(page))
3022 } else if (page_mapped(page)) /* Anon */
3029 mem_cgroup_charge_statistics(memcg, anon, -nr_pages);
3031 ClearPageCgroupUsed(pc);
3033 * pc->mem_cgroup is not cleared here. It will be accessed when it's
3034 * freed from LRU. This is safe because uncharged page is expected not
3035 * to be reused (freed soon). Exception is SwapCache, it's handled by
3036 * special functions.
3039 unlock_page_cgroup(pc);
3041 * even after unlock, we have memcg->res.usage here and this memcg
3042 * will never be freed.
3044 memcg_check_events(memcg, page);
3045 if (do_swap_account && ctype == MEM_CGROUP_CHARGE_TYPE_SWAPOUT) {
3046 mem_cgroup_swap_statistics(memcg, true);
3047 mem_cgroup_get(memcg);
3049 if (!mem_cgroup_is_root(memcg))
3050 mem_cgroup_do_uncharge(memcg, nr_pages, ctype);
3055 unlock_page_cgroup(pc);
3059 void mem_cgroup_uncharge_page(struct page *page)
3062 if (page_mapped(page))
3064 VM_BUG_ON(page->mapping && !PageAnon(page));
3065 __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_ANON);
3068 void mem_cgroup_uncharge_cache_page(struct page *page)
3070 VM_BUG_ON(page_mapped(page));
3071 VM_BUG_ON(page->mapping);
3072 __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_CACHE);
3076 * Batch_start/batch_end is called in unmap_page_range/invlidate/trucate.
3077 * In that cases, pages are freed continuously and we can expect pages
3078 * are in the same memcg. All these calls itself limits the number of
3079 * pages freed at once, then uncharge_start/end() is called properly.
3080 * This may be called prural(2) times in a context,
3083 void mem_cgroup_uncharge_start(void)
3085 current->memcg_batch.do_batch++;
3086 /* We can do nest. */
3087 if (current->memcg_batch.do_batch == 1) {
3088 current->memcg_batch.memcg = NULL;
3089 current->memcg_batch.nr_pages = 0;
3090 current->memcg_batch.memsw_nr_pages = 0;
3094 void mem_cgroup_uncharge_end(void)
3096 struct memcg_batch_info *batch = ¤t->memcg_batch;
3098 if (!batch->do_batch)
3102 if (batch->do_batch) /* If stacked, do nothing. */
3108 * This "batch->memcg" is valid without any css_get/put etc...
3109 * bacause we hide charges behind us.
3111 if (batch->nr_pages)
3112 res_counter_uncharge(&batch->memcg->res,
3113 batch->nr_pages * PAGE_SIZE);
3114 if (batch->memsw_nr_pages)
3115 res_counter_uncharge(&batch->memcg->memsw,
3116 batch->memsw_nr_pages * PAGE_SIZE);
3117 memcg_oom_recover(batch->memcg);
3118 /* forget this pointer (for sanity check) */
3119 batch->memcg = NULL;
3124 * called after __delete_from_swap_cache() and drop "page" account.
3125 * memcg information is recorded to swap_cgroup of "ent"
3128 mem_cgroup_uncharge_swapcache(struct page *page, swp_entry_t ent, bool swapout)
3130 struct mem_cgroup *memcg;
3131 int ctype = MEM_CGROUP_CHARGE_TYPE_SWAPOUT;
3133 if (!swapout) /* this was a swap cache but the swap is unused ! */
3134 ctype = MEM_CGROUP_CHARGE_TYPE_DROP;
3136 memcg = __mem_cgroup_uncharge_common(page, ctype);
3139 * record memcg information, if swapout && memcg != NULL,
3140 * mem_cgroup_get() was called in uncharge().
3142 if (do_swap_account && swapout && memcg)
3143 swap_cgroup_record(ent, css_id(&memcg->css));
3147 #ifdef CONFIG_MEMCG_SWAP
3149 * called from swap_entry_free(). remove record in swap_cgroup and
3150 * uncharge "memsw" account.
3152 void mem_cgroup_uncharge_swap(swp_entry_t ent)
3154 struct mem_cgroup *memcg;
3157 if (!do_swap_account)
3160 id = swap_cgroup_record(ent, 0);
3162 memcg = mem_cgroup_lookup(id);
3165 * We uncharge this because swap is freed.
3166 * This memcg can be obsolete one. We avoid calling css_tryget
3168 if (!mem_cgroup_is_root(memcg))
3169 res_counter_uncharge(&memcg->memsw, PAGE_SIZE);
3170 mem_cgroup_swap_statistics(memcg, false);
3171 mem_cgroup_put(memcg);
3177 * mem_cgroup_move_swap_account - move swap charge and swap_cgroup's record.
3178 * @entry: swap entry to be moved
3179 * @from: mem_cgroup which the entry is moved from
3180 * @to: mem_cgroup which the entry is moved to
3182 * It succeeds only when the swap_cgroup's record for this entry is the same
3183 * as the mem_cgroup's id of @from.
3185 * Returns 0 on success, -EINVAL on failure.
3187 * The caller must have charged to @to, IOW, called res_counter_charge() about
3188 * both res and memsw, and called css_get().
3190 static int mem_cgroup_move_swap_account(swp_entry_t entry,
3191 struct mem_cgroup *from, struct mem_cgroup *to)
3193 unsigned short old_id, new_id;
3195 old_id = css_id(&from->css);
3196 new_id = css_id(&to->css);
3198 if (swap_cgroup_cmpxchg(entry, old_id, new_id) == old_id) {
3199 mem_cgroup_swap_statistics(from, false);
3200 mem_cgroup_swap_statistics(to, true);
3202 * This function is only called from task migration context now.
3203 * It postpones res_counter and refcount handling till the end
3204 * of task migration(mem_cgroup_clear_mc()) for performance
3205 * improvement. But we cannot postpone mem_cgroup_get(to)
3206 * because if the process that has been moved to @to does
3207 * swap-in, the refcount of @to might be decreased to 0.
3215 static inline int mem_cgroup_move_swap_account(swp_entry_t entry,
3216 struct mem_cgroup *from, struct mem_cgroup *to)
3223 * Before starting migration, account PAGE_SIZE to mem_cgroup that the old
3226 int mem_cgroup_prepare_migration(struct page *page,
3227 struct page *newpage, struct mem_cgroup **memcgp, gfp_t gfp_mask)
3229 struct mem_cgroup *memcg = NULL;
3230 struct page_cgroup *pc;
3231 enum charge_type ctype;
3236 VM_BUG_ON(PageTransHuge(page));
3237 if (mem_cgroup_disabled())
3240 pc = lookup_page_cgroup(page);
3241 lock_page_cgroup(pc);
3242 if (PageCgroupUsed(pc)) {
3243 memcg = pc->mem_cgroup;
3244 css_get(&memcg->css);
3246 * At migrating an anonymous page, its mapcount goes down
3247 * to 0 and uncharge() will be called. But, even if it's fully
3248 * unmapped, migration may fail and this page has to be
3249 * charged again. We set MIGRATION flag here and delay uncharge
3250 * until end_migration() is called
3252 * Corner Case Thinking
3254 * When the old page was mapped as Anon and it's unmap-and-freed
3255 * while migration was ongoing.
3256 * If unmap finds the old page, uncharge() of it will be delayed
3257 * until end_migration(). If unmap finds a new page, it's
3258 * uncharged when it make mapcount to be 1->0. If unmap code
3259 * finds swap_migration_entry, the new page will not be mapped
3260 * and end_migration() will find it(mapcount==0).
3263 * When the old page was mapped but migraion fails, the kernel
3264 * remaps it. A charge for it is kept by MIGRATION flag even
3265 * if mapcount goes down to 0. We can do remap successfully
3266 * without charging it again.
3269 * The "old" page is under lock_page() until the end of
3270 * migration, so, the old page itself will not be swapped-out.
3271 * If the new page is swapped out before end_migraton, our
3272 * hook to usual swap-out path will catch the event.
3275 SetPageCgroupMigration(pc);
3277 unlock_page_cgroup(pc);
3279 * If the page is not charged at this point,
3286 ret = __mem_cgroup_try_charge(NULL, gfp_mask, 1, memcgp, false);
3287 css_put(&memcg->css);/* drop extra refcnt */
3289 if (PageAnon(page)) {
3290 lock_page_cgroup(pc);
3291 ClearPageCgroupMigration(pc);
3292 unlock_page_cgroup(pc);
3294 * The old page may be fully unmapped while we kept it.
3296 mem_cgroup_uncharge_page(page);
3298 /* we'll need to revisit this error code (we have -EINTR) */
3302 * We charge new page before it's used/mapped. So, even if unlock_page()
3303 * is called before end_migration, we can catch all events on this new
3304 * page. In the case new page is migrated but not remapped, new page's
3305 * mapcount will be finally 0 and we call uncharge in end_migration().
3308 ctype = MEM_CGROUP_CHARGE_TYPE_ANON;
3309 else if (page_is_file_cache(page))
3310 ctype = MEM_CGROUP_CHARGE_TYPE_CACHE;
3312 ctype = MEM_CGROUP_CHARGE_TYPE_SHMEM;
3313 __mem_cgroup_commit_charge(memcg, newpage, 1, ctype, false);
3317 /* remove redundant charge if migration failed*/
3318 void mem_cgroup_end_migration(struct mem_cgroup *memcg,
3319 struct page *oldpage, struct page *newpage, bool migration_ok)
3321 struct page *used, *unused;
3322 struct page_cgroup *pc;
3327 /* blocks rmdir() */
3328 cgroup_exclude_rmdir(&memcg->css);
3329 if (!migration_ok) {
3337 * We disallowed uncharge of pages under migration because mapcount
3338 * of the page goes down to zero, temporarly.
3339 * Clear the flag and check the page should be charged.
3341 pc = lookup_page_cgroup(oldpage);
3342 lock_page_cgroup(pc);
3343 ClearPageCgroupMigration(pc);
3344 unlock_page_cgroup(pc);
3345 anon = PageAnon(used);
3346 __mem_cgroup_uncharge_common(unused,
3347 anon ? MEM_CGROUP_CHARGE_TYPE_ANON
3348 : MEM_CGROUP_CHARGE_TYPE_CACHE);
3351 * If a page is a file cache, radix-tree replacement is very atomic
3352 * and we can skip this check. When it was an Anon page, its mapcount
3353 * goes down to 0. But because we added MIGRATION flage, it's not
3354 * uncharged yet. There are several case but page->mapcount check
3355 * and USED bit check in mem_cgroup_uncharge_page() will do enough
3356 * check. (see prepare_charge() also)
3359 mem_cgroup_uncharge_page(used);
3361 * At migration, we may charge account against cgroup which has no
3363 * So, rmdir()->pre_destroy() can be called while we do this charge.
3364 * In that case, we need to call pre_destroy() again. check it here.
3366 cgroup_release_and_wakeup_rmdir(&memcg->css);
3370 * At replace page cache, newpage is not under any memcg but it's on
3371 * LRU. So, this function doesn't touch res_counter but handles LRU
3372 * in correct way. Both pages are locked so we cannot race with uncharge.
3374 void mem_cgroup_replace_page_cache(struct page *oldpage,
3375 struct page *newpage)
3377 struct mem_cgroup *memcg = NULL;
3378 struct page_cgroup *pc;
3379 enum charge_type type = MEM_CGROUP_CHARGE_TYPE_CACHE;
3381 if (mem_cgroup_disabled())
3384 pc = lookup_page_cgroup(oldpage);
3385 /* fix accounting on old pages */
3386 lock_page_cgroup(pc);
3387 if (PageCgroupUsed(pc)) {
3388 memcg = pc->mem_cgroup;
3389 mem_cgroup_charge_statistics(memcg, false, -1);
3390 ClearPageCgroupUsed(pc);
3392 unlock_page_cgroup(pc);
3395 * When called from shmem_replace_page(), in some cases the
3396 * oldpage has already been charged, and in some cases not.
3401 if (PageSwapBacked(oldpage))
3402 type = MEM_CGROUP_CHARGE_TYPE_SHMEM;
3405 * Even if newpage->mapping was NULL before starting replacement,
3406 * the newpage may be on LRU(or pagevec for LRU) already. We lock
3407 * LRU while we overwrite pc->mem_cgroup.
3409 __mem_cgroup_commit_charge(memcg, newpage, 1, type, true);
3412 #ifdef CONFIG_DEBUG_VM
3413 static struct page_cgroup *lookup_page_cgroup_used(struct page *page)
3415 struct page_cgroup *pc;
3417 pc = lookup_page_cgroup(page);
3419 * Can be NULL while feeding pages into the page allocator for
3420 * the first time, i.e. during boot or memory hotplug;
3421 * or when mem_cgroup_disabled().
3423 if (likely(pc) && PageCgroupUsed(pc))
3428 bool mem_cgroup_bad_page_check(struct page *page)
3430 if (mem_cgroup_disabled())
3433 return lookup_page_cgroup_used(page) != NULL;
3436 void mem_cgroup_print_bad_page(struct page *page)
3438 struct page_cgroup *pc;
3440 pc = lookup_page_cgroup_used(page);
3442 printk(KERN_ALERT "pc:%p pc->flags:%lx pc->mem_cgroup:%p\n",
3443 pc, pc->flags, pc->mem_cgroup);
3448 static DEFINE_MUTEX(set_limit_mutex);
3450 static int mem_cgroup_resize_limit(struct mem_cgroup *memcg,
3451 unsigned long long val)
3454 u64 memswlimit, memlimit;
3456 int children = mem_cgroup_count_children(memcg);
3457 u64 curusage, oldusage;
3461 * For keeping hierarchical_reclaim simple, how long we should retry
3462 * is depends on callers. We set our retry-count to be function
3463 * of # of children which we should visit in this loop.
3465 retry_count = MEM_CGROUP_RECLAIM_RETRIES * children;
3467 oldusage = res_counter_read_u64(&memcg->res, RES_USAGE);
3470 while (retry_count) {
3471 if (signal_pending(current)) {
3476 * Rather than hide all in some function, I do this in
3477 * open coded manner. You see what this really does.
3478 * We have to guarantee memcg->res.limit <= memcg->memsw.limit.
3480 mutex_lock(&set_limit_mutex);
3481 memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3482 if (memswlimit < val) {
3484 mutex_unlock(&set_limit_mutex);
3488 memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT);
3492 ret = res_counter_set_limit(&memcg->res, val);
3494 if (memswlimit == val)
3495 memcg->memsw_is_minimum = true;
3497 memcg->memsw_is_minimum = false;
3499 mutex_unlock(&set_limit_mutex);
3504 mem_cgroup_reclaim(memcg, GFP_KERNEL,
3505 MEM_CGROUP_RECLAIM_SHRINK);
3506 curusage = res_counter_read_u64(&memcg->res, RES_USAGE);
3507 /* Usage is reduced ? */
3508 if (curusage >= oldusage)
3511 oldusage = curusage;
3513 if (!ret && enlarge)
3514 memcg_oom_recover(memcg);
3519 static int mem_cgroup_resize_memsw_limit(struct mem_cgroup *memcg,
3520 unsigned long long val)
3523 u64 memlimit, memswlimit, oldusage, curusage;
3524 int children = mem_cgroup_count_children(memcg);
3528 /* see mem_cgroup_resize_res_limit */
3529 retry_count = children * MEM_CGROUP_RECLAIM_RETRIES;
3530 oldusage = res_counter_read_u64(&memcg->memsw, RES_USAGE);
3531 while (retry_count) {
3532 if (signal_pending(current)) {
3537 * Rather than hide all in some function, I do this in
3538 * open coded manner. You see what this really does.
3539 * We have to guarantee memcg->res.limit <= memcg->memsw.limit.
3541 mutex_lock(&set_limit_mutex);
3542 memlimit = res_counter_read_u64(&memcg->res, RES_LIMIT);
3543 if (memlimit > val) {
3545 mutex_unlock(&set_limit_mutex);
3548 memswlimit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3549 if (memswlimit < val)
3551 ret = res_counter_set_limit(&memcg->memsw, val);
3553 if (memlimit == val)
3554 memcg->memsw_is_minimum = true;
3556 memcg->memsw_is_minimum = false;
3558 mutex_unlock(&set_limit_mutex);
3563 mem_cgroup_reclaim(memcg, GFP_KERNEL,
3564 MEM_CGROUP_RECLAIM_NOSWAP |
3565 MEM_CGROUP_RECLAIM_SHRINK);
3566 curusage = res_counter_read_u64(&memcg->memsw, RES_USAGE);
3567 /* Usage is reduced ? */
3568 if (curusage >= oldusage)
3571 oldusage = curusage;
3573 if (!ret && enlarge)
3574 memcg_oom_recover(memcg);
3578 unsigned long mem_cgroup_soft_limit_reclaim(struct zone *zone, int order,
3580 unsigned long *total_scanned)
3582 unsigned long nr_reclaimed = 0;
3583 struct mem_cgroup_per_zone *mz, *next_mz = NULL;
3584 unsigned long reclaimed;
3586 struct mem_cgroup_tree_per_zone *mctz;
3587 unsigned long long excess;
3588 unsigned long nr_scanned;
3593 mctz = soft_limit_tree_node_zone(zone_to_nid(zone), zone_idx(zone));
3595 * This loop can run a while, specially if mem_cgroup's continuously
3596 * keep exceeding their soft limit and putting the system under
3603 mz = mem_cgroup_largest_soft_limit_node(mctz);
3608 reclaimed = mem_cgroup_soft_reclaim(mz->memcg, zone,
3609 gfp_mask, &nr_scanned);
3610 nr_reclaimed += reclaimed;
3611 *total_scanned += nr_scanned;
3612 spin_lock(&mctz->lock);
3615 * If we failed to reclaim anything from this memory cgroup
3616 * it is time to move on to the next cgroup
3622 * Loop until we find yet another one.
3624 * By the time we get the soft_limit lock
3625 * again, someone might have aded the
3626 * group back on the RB tree. Iterate to
3627 * make sure we get a different mem.
3628 * mem_cgroup_largest_soft_limit_node returns
3629 * NULL if no other cgroup is present on
3633 __mem_cgroup_largest_soft_limit_node(mctz);
3635 css_put(&next_mz->memcg->css);
3636 else /* next_mz == NULL or other memcg */
3640 __mem_cgroup_remove_exceeded(mz->memcg, mz, mctz);
3641 excess = res_counter_soft_limit_excess(&mz->memcg->res);
3643 * One school of thought says that we should not add
3644 * back the node to the tree if reclaim returns 0.
3645 * But our reclaim could return 0, simply because due
3646 * to priority we are exposing a smaller subset of
3647 * memory to reclaim from. Consider this as a longer
3650 /* If excess == 0, no tree ops */
3651 __mem_cgroup_insert_exceeded(mz->memcg, mz, mctz, excess);
3652 spin_unlock(&mctz->lock);
3653 css_put(&mz->memcg->css);
3656 * Could not reclaim anything and there are no more
3657 * mem cgroups to try or we seem to be looping without
3658 * reclaiming anything.
3660 if (!nr_reclaimed &&
3662 loop > MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS))
3664 } while (!nr_reclaimed);
3666 css_put(&next_mz->memcg->css);
3667 return nr_reclaimed;
3671 * Traverse a specified page_cgroup list and try to drop them all. This doesn't
3672 * reclaim the pages page themselves - it just removes the page_cgroups.
3673 * Returns true if some page_cgroups were not freed, indicating that the caller
3674 * must retry this operation.
3676 static bool mem_cgroup_force_empty_list(struct mem_cgroup *memcg,
3677 int node, int zid, enum lru_list lru)
3679 struct mem_cgroup_per_zone *mz;
3680 unsigned long flags, loop;
3681 struct list_head *list;
3685 zone = &NODE_DATA(node)->node_zones[zid];
3686 mz = mem_cgroup_zoneinfo(memcg, node, zid);
3687 list = &mz->lruvec.lists[lru];
3689 loop = mz->lru_size[lru];
3690 /* give some margin against EBUSY etc...*/
3694 struct page_cgroup *pc;
3697 spin_lock_irqsave(&zone->lru_lock, flags);
3698 if (list_empty(list)) {
3699 spin_unlock_irqrestore(&zone->lru_lock, flags);
3702 page = list_entry(list->prev, struct page, lru);
3704 list_move(&page->lru, list);
3706 spin_unlock_irqrestore(&zone->lru_lock, flags);
3709 spin_unlock_irqrestore(&zone->lru_lock, flags);
3711 pc = lookup_page_cgroup(page);
3713 if (mem_cgroup_move_parent(page, pc, memcg)) {
3714 /* found lock contention or "pc" is obsolete. */
3720 return !list_empty(list);
3724 * make mem_cgroup's charge to be 0 if there is no task.
3725 * This enables deleting this mem_cgroup.
3727 static int mem_cgroup_force_empty(struct mem_cgroup *memcg, bool free_all)
3730 int node, zid, shrink;
3731 int nr_retries = MEM_CGROUP_RECLAIM_RETRIES;
3732 struct cgroup *cgrp = memcg->css.cgroup;
3734 css_get(&memcg->css);
3737 /* should free all ? */
3743 if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children))
3745 /* This is for making all *used* pages to be on LRU. */
3746 lru_add_drain_all();
3747 drain_all_stock_sync(memcg);
3749 mem_cgroup_start_move(memcg);
3750 for_each_node_state(node, N_HIGH_MEMORY) {
3751 for (zid = 0; !ret && zid < MAX_NR_ZONES; zid++) {
3754 ret = mem_cgroup_force_empty_list(memcg,
3763 mem_cgroup_end_move(memcg);
3764 memcg_oom_recover(memcg);
3766 /* "ret" should also be checked to ensure all lists are empty. */
3767 } while (res_counter_read_u64(&memcg->res, RES_USAGE) > 0 || ret);
3769 css_put(&memcg->css);
3773 /* returns EBUSY if there is a task or if we come here twice. */
3774 if (cgroup_task_count(cgrp) || !list_empty(&cgrp->children) || shrink) {
3778 /* we call try-to-free pages for make this cgroup empty */
3779 lru_add_drain_all();
3780 /* try to free all pages in this cgroup */
3782 while (nr_retries && res_counter_read_u64(&memcg->res, RES_USAGE) > 0) {
3785 if (signal_pending(current)) {
3789 progress = try_to_free_mem_cgroup_pages(memcg, GFP_KERNEL,
3793 /* maybe some writeback is necessary */
3794 congestion_wait(BLK_RW_ASYNC, HZ/10);
3799 /* try move_account...there may be some *locked* pages. */
3803 static int mem_cgroup_force_empty_write(struct cgroup *cont, unsigned int event)
3805 return mem_cgroup_force_empty(mem_cgroup_from_cont(cont), true);
3809 static u64 mem_cgroup_hierarchy_read(struct cgroup *cont, struct cftype *cft)
3811 return mem_cgroup_from_cont(cont)->use_hierarchy;
3814 static int mem_cgroup_hierarchy_write(struct cgroup *cont, struct cftype *cft,
3818 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
3819 struct cgroup *parent = cont->parent;
3820 struct mem_cgroup *parent_memcg = NULL;
3823 parent_memcg = mem_cgroup_from_cont(parent);
3827 if (memcg->use_hierarchy == val)
3831 * If parent's use_hierarchy is set, we can't make any modifications
3832 * in the child subtrees. If it is unset, then the change can
3833 * occur, provided the current cgroup has no children.
3835 * For the root cgroup, parent_mem is NULL, we allow value to be
3836 * set if there are no children.
3838 if ((!parent_memcg || !parent_memcg->use_hierarchy) &&
3839 (val == 1 || val == 0)) {
3840 if (list_empty(&cont->children))
3841 memcg->use_hierarchy = val;
3854 static unsigned long mem_cgroup_recursive_stat(struct mem_cgroup *memcg,
3855 enum mem_cgroup_stat_index idx)
3857 struct mem_cgroup *iter;
3860 /* Per-cpu values can be negative, use a signed accumulator */
3861 for_each_mem_cgroup_tree(iter, memcg)
3862 val += mem_cgroup_read_stat(iter, idx);
3864 if (val < 0) /* race ? */
3869 static inline u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap)
3873 if (!mem_cgroup_is_root(memcg)) {
3875 return res_counter_read_u64(&memcg->res, RES_USAGE);
3877 return res_counter_read_u64(&memcg->memsw, RES_USAGE);
3880 val = mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_CACHE);
3881 val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_RSS);
3884 val += mem_cgroup_recursive_stat(memcg, MEM_CGROUP_STAT_SWAP);
3886 return val << PAGE_SHIFT;
3889 static ssize_t mem_cgroup_read(struct cgroup *cont, struct cftype *cft,
3890 struct file *file, char __user *buf,
3891 size_t nbytes, loff_t *ppos)
3893 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
3896 int type, name, len;
3898 type = MEMFILE_TYPE(cft->private);
3899 name = MEMFILE_ATTR(cft->private);
3901 if (!do_swap_account && type == _MEMSWAP)
3906 if (name == RES_USAGE)
3907 val = mem_cgroup_usage(memcg, false);
3909 val = res_counter_read_u64(&memcg->res, name);
3912 if (name == RES_USAGE)
3913 val = mem_cgroup_usage(memcg, true);
3915 val = res_counter_read_u64(&memcg->memsw, name);
3921 len = scnprintf(str, sizeof(str), "%llu\n", (unsigned long long)val);
3922 return simple_read_from_buffer(buf, nbytes, ppos, str, len);
3925 * The user of this function is...
3928 static int mem_cgroup_write(struct cgroup *cont, struct cftype *cft,
3931 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
3933 unsigned long long val;
3936 type = MEMFILE_TYPE(cft->private);
3937 name = MEMFILE_ATTR(cft->private);
3939 if (!do_swap_account && type == _MEMSWAP)
3944 if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */
3948 /* This function does all necessary parse...reuse it */
3949 ret = res_counter_memparse_write_strategy(buffer, &val);
3953 ret = mem_cgroup_resize_limit(memcg, val);
3955 ret = mem_cgroup_resize_memsw_limit(memcg, val);
3957 case RES_SOFT_LIMIT:
3958 ret = res_counter_memparse_write_strategy(buffer, &val);
3962 * For memsw, soft limits are hard to implement in terms
3963 * of semantics, for now, we support soft limits for
3964 * control without swap
3967 ret = res_counter_set_soft_limit(&memcg->res, val);
3972 ret = -EINVAL; /* should be BUG() ? */
3978 static void memcg_get_hierarchical_limit(struct mem_cgroup *memcg,
3979 unsigned long long *mem_limit, unsigned long long *memsw_limit)
3981 struct cgroup *cgroup;
3982 unsigned long long min_limit, min_memsw_limit, tmp;
3984 min_limit = res_counter_read_u64(&memcg->res, RES_LIMIT);
3985 min_memsw_limit = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3986 cgroup = memcg->css.cgroup;
3987 if (!memcg->use_hierarchy)
3990 while (cgroup->parent) {
3991 cgroup = cgroup->parent;
3992 memcg = mem_cgroup_from_cont(cgroup);
3993 if (!memcg->use_hierarchy)
3995 tmp = res_counter_read_u64(&memcg->res, RES_LIMIT);
3996 min_limit = min(min_limit, tmp);
3997 tmp = res_counter_read_u64(&memcg->memsw, RES_LIMIT);
3998 min_memsw_limit = min(min_memsw_limit, tmp);
4001 *mem_limit = min_limit;
4002 *memsw_limit = min_memsw_limit;
4005 static int mem_cgroup_reset(struct cgroup *cont, unsigned int event)
4007 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4010 type = MEMFILE_TYPE(event);
4011 name = MEMFILE_ATTR(event);
4013 if (!do_swap_account && type == _MEMSWAP)
4019 res_counter_reset_max(&memcg->res);
4021 res_counter_reset_max(&memcg->memsw);
4025 res_counter_reset_failcnt(&memcg->res);
4027 res_counter_reset_failcnt(&memcg->memsw);
4034 static u64 mem_cgroup_move_charge_read(struct cgroup *cgrp,
4037 return mem_cgroup_from_cont(cgrp)->move_charge_at_immigrate;
4041 static int mem_cgroup_move_charge_write(struct cgroup *cgrp,
4042 struct cftype *cft, u64 val)
4044 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4046 if (val >= (1 << NR_MOVE_TYPE))
4049 * We check this value several times in both in can_attach() and
4050 * attach(), so we need cgroup lock to prevent this value from being
4054 memcg->move_charge_at_immigrate = val;
4060 static int mem_cgroup_move_charge_write(struct cgroup *cgrp,
4061 struct cftype *cft, u64 val)
4068 static int memcg_numa_stat_show(struct cgroup *cont, struct cftype *cft,
4072 unsigned long total_nr, file_nr, anon_nr, unevictable_nr;
4073 unsigned long node_nr;
4074 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4076 total_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL);
4077 seq_printf(m, "total=%lu", total_nr);
4078 for_each_node_state(nid, N_HIGH_MEMORY) {
4079 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid, LRU_ALL);
4080 seq_printf(m, " N%d=%lu", nid, node_nr);
4084 file_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL_FILE);
4085 seq_printf(m, "file=%lu", file_nr);
4086 for_each_node_state(nid, N_HIGH_MEMORY) {
4087 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
4089 seq_printf(m, " N%d=%lu", nid, node_nr);
4093 anon_nr = mem_cgroup_nr_lru_pages(memcg, LRU_ALL_ANON);
4094 seq_printf(m, "anon=%lu", anon_nr);
4095 for_each_node_state(nid, N_HIGH_MEMORY) {
4096 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
4098 seq_printf(m, " N%d=%lu", nid, node_nr);
4102 unevictable_nr = mem_cgroup_nr_lru_pages(memcg, BIT(LRU_UNEVICTABLE));
4103 seq_printf(m, "unevictable=%lu", unevictable_nr);
4104 for_each_node_state(nid, N_HIGH_MEMORY) {
4105 node_nr = mem_cgroup_node_nr_lru_pages(memcg, nid,
4106 BIT(LRU_UNEVICTABLE));
4107 seq_printf(m, " N%d=%lu", nid, node_nr);
4112 #endif /* CONFIG_NUMA */
4114 static const char * const mem_cgroup_lru_names[] = {
4122 static inline void mem_cgroup_lru_names_not_uptodate(void)
4124 BUILD_BUG_ON(ARRAY_SIZE(mem_cgroup_lru_names) != NR_LRU_LISTS);
4127 static int memcg_stat_show(struct cgroup *cont, struct cftype *cft,
4130 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4131 struct mem_cgroup *mi;
4134 for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) {
4135 if (i == MEM_CGROUP_STAT_SWAP && !do_swap_account)
4137 seq_printf(m, "%s %ld\n", mem_cgroup_stat_names[i],
4138 mem_cgroup_read_stat(memcg, i) * PAGE_SIZE);
4141 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++)
4142 seq_printf(m, "%s %lu\n", mem_cgroup_events_names[i],
4143 mem_cgroup_read_events(memcg, i));
4145 for (i = 0; i < NR_LRU_LISTS; i++)
4146 seq_printf(m, "%s %lu\n", mem_cgroup_lru_names[i],
4147 mem_cgroup_nr_lru_pages(memcg, BIT(i)) * PAGE_SIZE);
4149 /* Hierarchical information */
4151 unsigned long long limit, memsw_limit;
4152 memcg_get_hierarchical_limit(memcg, &limit, &memsw_limit);
4153 seq_printf(m, "hierarchical_memory_limit %llu\n", limit);
4154 if (do_swap_account)
4155 seq_printf(m, "hierarchical_memsw_limit %llu\n",
4159 for (i = 0; i < MEM_CGROUP_STAT_NSTATS; i++) {
4162 if (i == MEM_CGROUP_STAT_SWAP && !do_swap_account)
4164 for_each_mem_cgroup_tree(mi, memcg)
4165 val += mem_cgroup_read_stat(mi, i) * PAGE_SIZE;
4166 seq_printf(m, "total_%s %lld\n", mem_cgroup_stat_names[i], val);
4169 for (i = 0; i < MEM_CGROUP_EVENTS_NSTATS; i++) {
4170 unsigned long long val = 0;
4172 for_each_mem_cgroup_tree(mi, memcg)
4173 val += mem_cgroup_read_events(mi, i);
4174 seq_printf(m, "total_%s %llu\n",
4175 mem_cgroup_events_names[i], val);
4178 for (i = 0; i < NR_LRU_LISTS; i++) {
4179 unsigned long long val = 0;
4181 for_each_mem_cgroup_tree(mi, memcg)
4182 val += mem_cgroup_nr_lru_pages(mi, BIT(i)) * PAGE_SIZE;
4183 seq_printf(m, "total_%s %llu\n", mem_cgroup_lru_names[i], val);
4186 #ifdef CONFIG_DEBUG_VM
4189 struct mem_cgroup_per_zone *mz;
4190 struct zone_reclaim_stat *rstat;
4191 unsigned long recent_rotated[2] = {0, 0};
4192 unsigned long recent_scanned[2] = {0, 0};
4194 for_each_online_node(nid)
4195 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
4196 mz = mem_cgroup_zoneinfo(memcg, nid, zid);
4197 rstat = &mz->lruvec.reclaim_stat;
4199 recent_rotated[0] += rstat->recent_rotated[0];
4200 recent_rotated[1] += rstat->recent_rotated[1];
4201 recent_scanned[0] += rstat->recent_scanned[0];
4202 recent_scanned[1] += rstat->recent_scanned[1];
4204 seq_printf(m, "recent_rotated_anon %lu\n", recent_rotated[0]);
4205 seq_printf(m, "recent_rotated_file %lu\n", recent_rotated[1]);
4206 seq_printf(m, "recent_scanned_anon %lu\n", recent_scanned[0]);
4207 seq_printf(m, "recent_scanned_file %lu\n", recent_scanned[1]);
4214 static u64 mem_cgroup_swappiness_read(struct cgroup *cgrp, struct cftype *cft)
4216 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4218 return mem_cgroup_swappiness(memcg);
4221 static int mem_cgroup_swappiness_write(struct cgroup *cgrp, struct cftype *cft,
4224 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4225 struct mem_cgroup *parent;
4230 if (cgrp->parent == NULL)
4233 parent = mem_cgroup_from_cont(cgrp->parent);
4237 /* If under hierarchy, only empty-root can set this value */
4238 if ((parent->use_hierarchy) ||
4239 (memcg->use_hierarchy && !list_empty(&cgrp->children))) {
4244 memcg->swappiness = val;
4251 static void __mem_cgroup_threshold(struct mem_cgroup *memcg, bool swap)
4253 struct mem_cgroup_threshold_ary *t;
4259 t = rcu_dereference(memcg->thresholds.primary);
4261 t = rcu_dereference(memcg->memsw_thresholds.primary);
4266 usage = mem_cgroup_usage(memcg, swap);
4269 * current_threshold points to threshold just below or equal to usage.
4270 * If it's not true, a threshold was crossed after last
4271 * call of __mem_cgroup_threshold().
4273 i = t->current_threshold;
4276 * Iterate backward over array of thresholds starting from
4277 * current_threshold and check if a threshold is crossed.
4278 * If none of thresholds below usage is crossed, we read
4279 * only one element of the array here.
4281 for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)
4282 eventfd_signal(t->entries[i].eventfd, 1);
4284 /* i = current_threshold + 1 */
4288 * Iterate forward over array of thresholds starting from
4289 * current_threshold+1 and check if a threshold is crossed.
4290 * If none of thresholds above usage is crossed, we read
4291 * only one element of the array here.
4293 for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)
4294 eventfd_signal(t->entries[i].eventfd, 1);
4296 /* Update current_threshold */
4297 t->current_threshold = i - 1;
4302 static void mem_cgroup_threshold(struct mem_cgroup *memcg)
4305 __mem_cgroup_threshold(memcg, false);
4306 if (do_swap_account)
4307 __mem_cgroup_threshold(memcg, true);
4309 memcg = parent_mem_cgroup(memcg);
4313 static int compare_thresholds(const void *a, const void *b)
4315 const struct mem_cgroup_threshold *_a = a;
4316 const struct mem_cgroup_threshold *_b = b;
4318 return _a->threshold - _b->threshold;
4321 static int mem_cgroup_oom_notify_cb(struct mem_cgroup *memcg)
4323 struct mem_cgroup_eventfd_list *ev;
4325 list_for_each_entry(ev, &memcg->oom_notify, list)
4326 eventfd_signal(ev->eventfd, 1);
4330 static void mem_cgroup_oom_notify(struct mem_cgroup *memcg)
4332 struct mem_cgroup *iter;
4334 for_each_mem_cgroup_tree(iter, memcg)
4335 mem_cgroup_oom_notify_cb(iter);
4338 static int mem_cgroup_usage_register_event(struct cgroup *cgrp,
4339 struct cftype *cft, struct eventfd_ctx *eventfd, const char *args)
4341 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4342 struct mem_cgroup_thresholds *thresholds;
4343 struct mem_cgroup_threshold_ary *new;
4344 int type = MEMFILE_TYPE(cft->private);
4345 u64 threshold, usage;
4348 ret = res_counter_memparse_write_strategy(args, &threshold);
4352 mutex_lock(&memcg->thresholds_lock);
4355 thresholds = &memcg->thresholds;
4356 else if (type == _MEMSWAP)
4357 thresholds = &memcg->memsw_thresholds;
4361 usage = mem_cgroup_usage(memcg, type == _MEMSWAP);
4363 /* Check if a threshold crossed before adding a new one */
4364 if (thresholds->primary)
4365 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
4367 size = thresholds->primary ? thresholds->primary->size + 1 : 1;
4369 /* Allocate memory for new array of thresholds */
4370 new = kmalloc(sizeof(*new) + size * sizeof(struct mem_cgroup_threshold),
4378 /* Copy thresholds (if any) to new array */
4379 if (thresholds->primary) {
4380 memcpy(new->entries, thresholds->primary->entries, (size - 1) *
4381 sizeof(struct mem_cgroup_threshold));
4384 /* Add new threshold */
4385 new->entries[size - 1].eventfd = eventfd;
4386 new->entries[size - 1].threshold = threshold;
4388 /* Sort thresholds. Registering of new threshold isn't time-critical */
4389 sort(new->entries, size, sizeof(struct mem_cgroup_threshold),
4390 compare_thresholds, NULL);
4392 /* Find current threshold */
4393 new->current_threshold = -1;
4394 for (i = 0; i < size; i++) {
4395 if (new->entries[i].threshold <= usage) {
4397 * new->current_threshold will not be used until
4398 * rcu_assign_pointer(), so it's safe to increment
4401 ++new->current_threshold;
4406 /* Free old spare buffer and save old primary buffer as spare */
4407 kfree(thresholds->spare);
4408 thresholds->spare = thresholds->primary;
4410 rcu_assign_pointer(thresholds->primary, new);
4412 /* To be sure that nobody uses thresholds */
4416 mutex_unlock(&memcg->thresholds_lock);
4421 static void mem_cgroup_usage_unregister_event(struct cgroup *cgrp,
4422 struct cftype *cft, struct eventfd_ctx *eventfd)
4424 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4425 struct mem_cgroup_thresholds *thresholds;
4426 struct mem_cgroup_threshold_ary *new;
4427 int type = MEMFILE_TYPE(cft->private);
4431 mutex_lock(&memcg->thresholds_lock);
4433 thresholds = &memcg->thresholds;
4434 else if (type == _MEMSWAP)
4435 thresholds = &memcg->memsw_thresholds;
4439 if (!thresholds->primary)
4442 usage = mem_cgroup_usage(memcg, type == _MEMSWAP);
4444 /* Check if a threshold crossed before removing */
4445 __mem_cgroup_threshold(memcg, type == _MEMSWAP);
4447 /* Calculate new number of threshold */
4449 for (i = 0; i < thresholds->primary->size; i++) {
4450 if (thresholds->primary->entries[i].eventfd != eventfd)
4454 new = thresholds->spare;
4456 /* Set thresholds array to NULL if we don't have thresholds */
4465 /* Copy thresholds and find current threshold */
4466 new->current_threshold = -1;
4467 for (i = 0, j = 0; i < thresholds->primary->size; i++) {
4468 if (thresholds->primary->entries[i].eventfd == eventfd)
4471 new->entries[j] = thresholds->primary->entries[i];
4472 if (new->entries[j].threshold <= usage) {
4474 * new->current_threshold will not be used
4475 * until rcu_assign_pointer(), so it's safe to increment
4478 ++new->current_threshold;
4484 /* Swap primary and spare array */
4485 thresholds->spare = thresholds->primary;
4486 /* If all events are unregistered, free the spare array */
4488 kfree(thresholds->spare);
4489 thresholds->spare = NULL;
4492 rcu_assign_pointer(thresholds->primary, new);
4494 /* To be sure that nobody uses thresholds */
4497 mutex_unlock(&memcg->thresholds_lock);
4500 static int mem_cgroup_oom_register_event(struct cgroup *cgrp,
4501 struct cftype *cft, struct eventfd_ctx *eventfd, const char *args)
4503 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4504 struct mem_cgroup_eventfd_list *event;
4505 int type = MEMFILE_TYPE(cft->private);
4507 BUG_ON(type != _OOM_TYPE);
4508 event = kmalloc(sizeof(*event), GFP_KERNEL);
4512 spin_lock(&memcg_oom_lock);
4514 event->eventfd = eventfd;
4515 list_add(&event->list, &memcg->oom_notify);
4517 /* already in OOM ? */
4518 if (atomic_read(&memcg->under_oom))
4519 eventfd_signal(eventfd, 1);
4520 spin_unlock(&memcg_oom_lock);
4525 static void mem_cgroup_oom_unregister_event(struct cgroup *cgrp,
4526 struct cftype *cft, struct eventfd_ctx *eventfd)
4528 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4529 struct mem_cgroup_eventfd_list *ev, *tmp;
4530 int type = MEMFILE_TYPE(cft->private);
4532 BUG_ON(type != _OOM_TYPE);
4534 spin_lock(&memcg_oom_lock);
4536 list_for_each_entry_safe(ev, tmp, &memcg->oom_notify, list) {
4537 if (ev->eventfd == eventfd) {
4538 list_del(&ev->list);
4543 spin_unlock(&memcg_oom_lock);
4546 static int mem_cgroup_oom_control_read(struct cgroup *cgrp,
4547 struct cftype *cft, struct cgroup_map_cb *cb)
4549 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4551 cb->fill(cb, "oom_kill_disable", memcg->oom_kill_disable);
4553 if (atomic_read(&memcg->under_oom))
4554 cb->fill(cb, "under_oom", 1);
4556 cb->fill(cb, "under_oom", 0);
4560 static int mem_cgroup_oom_control_write(struct cgroup *cgrp,
4561 struct cftype *cft, u64 val)
4563 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgrp);
4564 struct mem_cgroup *parent;
4566 /* cannot set to root cgroup and only 0 and 1 are allowed */
4567 if (!cgrp->parent || !((val == 0) || (val == 1)))
4570 parent = mem_cgroup_from_cont(cgrp->parent);
4573 /* oom-kill-disable is a flag for subhierarchy. */
4574 if ((parent->use_hierarchy) ||
4575 (memcg->use_hierarchy && !list_empty(&cgrp->children))) {
4579 memcg->oom_kill_disable = val;
4581 memcg_oom_recover(memcg);
4586 #ifdef CONFIG_MEMCG_KMEM
4587 static int memcg_init_kmem(struct mem_cgroup *memcg, struct cgroup_subsys *ss)
4589 return mem_cgroup_sockets_init(memcg, ss);
4592 static void kmem_cgroup_destroy(struct mem_cgroup *memcg)
4594 mem_cgroup_sockets_destroy(memcg);
4597 static int memcg_init_kmem(struct mem_cgroup *memcg, struct cgroup_subsys *ss)
4602 static void kmem_cgroup_destroy(struct mem_cgroup *memcg)
4607 static struct cftype mem_cgroup_files[] = {
4609 .name = "usage_in_bytes",
4610 .private = MEMFILE_PRIVATE(_MEM, RES_USAGE),
4611 .read = mem_cgroup_read,
4612 .register_event = mem_cgroup_usage_register_event,
4613 .unregister_event = mem_cgroup_usage_unregister_event,
4616 .name = "max_usage_in_bytes",
4617 .private = MEMFILE_PRIVATE(_MEM, RES_MAX_USAGE),
4618 .trigger = mem_cgroup_reset,
4619 .read = mem_cgroup_read,
4622 .name = "limit_in_bytes",
4623 .private = MEMFILE_PRIVATE(_MEM, RES_LIMIT),
4624 .write_string = mem_cgroup_write,
4625 .read = mem_cgroup_read,
4628 .name = "soft_limit_in_bytes",
4629 .private = MEMFILE_PRIVATE(_MEM, RES_SOFT_LIMIT),
4630 .write_string = mem_cgroup_write,
4631 .read = mem_cgroup_read,
4635 .private = MEMFILE_PRIVATE(_MEM, RES_FAILCNT),
4636 .trigger = mem_cgroup_reset,
4637 .read = mem_cgroup_read,
4641 .read_seq_string = memcg_stat_show,
4644 .name = "force_empty",
4645 .trigger = mem_cgroup_force_empty_write,
4648 .name = "use_hierarchy",
4649 .write_u64 = mem_cgroup_hierarchy_write,
4650 .read_u64 = mem_cgroup_hierarchy_read,
4653 .name = "swappiness",
4654 .read_u64 = mem_cgroup_swappiness_read,
4655 .write_u64 = mem_cgroup_swappiness_write,
4658 .name = "move_charge_at_immigrate",
4659 .read_u64 = mem_cgroup_move_charge_read,
4660 .write_u64 = mem_cgroup_move_charge_write,
4663 .name = "oom_control",
4664 .read_map = mem_cgroup_oom_control_read,
4665 .write_u64 = mem_cgroup_oom_control_write,
4666 .register_event = mem_cgroup_oom_register_event,
4667 .unregister_event = mem_cgroup_oom_unregister_event,
4668 .private = MEMFILE_PRIVATE(_OOM_TYPE, OOM_CONTROL),
4672 .name = "numa_stat",
4673 .read_seq_string = memcg_numa_stat_show,
4676 #ifdef CONFIG_MEMCG_SWAP
4678 .name = "memsw.usage_in_bytes",
4679 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_USAGE),
4680 .read = mem_cgroup_read,
4681 .register_event = mem_cgroup_usage_register_event,
4682 .unregister_event = mem_cgroup_usage_unregister_event,
4685 .name = "memsw.max_usage_in_bytes",
4686 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_MAX_USAGE),
4687 .trigger = mem_cgroup_reset,
4688 .read = mem_cgroup_read,
4691 .name = "memsw.limit_in_bytes",
4692 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_LIMIT),
4693 .write_string = mem_cgroup_write,
4694 .read = mem_cgroup_read,
4697 .name = "memsw.failcnt",
4698 .private = MEMFILE_PRIVATE(_MEMSWAP, RES_FAILCNT),
4699 .trigger = mem_cgroup_reset,
4700 .read = mem_cgroup_read,
4703 { }, /* terminate */
4706 static int alloc_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node)
4708 struct mem_cgroup_per_node *pn;
4709 struct mem_cgroup_per_zone *mz;
4710 int zone, tmp = node;
4712 * This routine is called against possible nodes.
4713 * But it's BUG to call kmalloc() against offline node.
4715 * TODO: this routine can waste much memory for nodes which will
4716 * never be onlined. It's better to use memory hotplug callback
4719 if (!node_state(node, N_NORMAL_MEMORY))
4721 pn = kzalloc_node(sizeof(*pn), GFP_KERNEL, tmp);
4725 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
4726 mz = &pn->zoneinfo[zone];
4727 lruvec_init(&mz->lruvec, &NODE_DATA(node)->node_zones[zone]);
4728 mz->usage_in_excess = 0;
4729 mz->on_tree = false;
4732 memcg->info.nodeinfo[node] = pn;
4736 static void free_mem_cgroup_per_zone_info(struct mem_cgroup *memcg, int node)
4738 kfree(memcg->info.nodeinfo[node]);
4741 static struct mem_cgroup *mem_cgroup_alloc(void)
4743 struct mem_cgroup *memcg;
4744 int size = sizeof(struct mem_cgroup);
4746 /* Can be very big if MAX_NUMNODES is very big */
4747 if (size < PAGE_SIZE)
4748 memcg = kzalloc(size, GFP_KERNEL);
4750 memcg = vzalloc(size);
4755 memcg->stat = alloc_percpu(struct mem_cgroup_stat_cpu);
4758 spin_lock_init(&memcg->pcp_counter_lock);
4762 if (size < PAGE_SIZE)
4770 * Helpers for freeing a kmalloc()ed/vzalloc()ed mem_cgroup by RCU,
4771 * but in process context. The work_freeing structure is overlaid
4772 * on the rcu_freeing structure, which itself is overlaid on memsw.
4774 static void free_work(struct work_struct *work)
4776 struct mem_cgroup *memcg;
4777 int size = sizeof(struct mem_cgroup);
4779 memcg = container_of(work, struct mem_cgroup, work_freeing);
4781 * We need to make sure that (at least for now), the jump label
4782 * destruction code runs outside of the cgroup lock. This is because
4783 * get_online_cpus(), which is called from the static_branch update,
4784 * can't be called inside the cgroup_lock. cpusets are the ones
4785 * enforcing this dependency, so if they ever change, we might as well.
4787 * schedule_work() will guarantee this happens. Be careful if you need
4788 * to move this code around, and make sure it is outside
4791 disarm_sock_keys(memcg);
4792 if (size < PAGE_SIZE)
4798 static void free_rcu(struct rcu_head *rcu_head)
4800 struct mem_cgroup *memcg;
4802 memcg = container_of(rcu_head, struct mem_cgroup, rcu_freeing);
4803 INIT_WORK(&memcg->work_freeing, free_work);
4804 schedule_work(&memcg->work_freeing);
4808 * At destroying mem_cgroup, references from swap_cgroup can remain.
4809 * (scanning all at force_empty is too costly...)
4811 * Instead of clearing all references at force_empty, we remember
4812 * the number of reference from swap_cgroup and free mem_cgroup when
4813 * it goes down to 0.
4815 * Removal of cgroup itself succeeds regardless of refs from swap.
4818 static void __mem_cgroup_free(struct mem_cgroup *memcg)
4822 mem_cgroup_remove_from_trees(memcg);
4823 free_css_id(&mem_cgroup_subsys, &memcg->css);
4826 free_mem_cgroup_per_zone_info(memcg, node);
4828 free_percpu(memcg->stat);
4829 call_rcu(&memcg->rcu_freeing, free_rcu);
4832 static void mem_cgroup_get(struct mem_cgroup *memcg)
4834 atomic_inc(&memcg->refcnt);
4837 static void __mem_cgroup_put(struct mem_cgroup *memcg, int count)
4839 if (atomic_sub_and_test(count, &memcg->refcnt)) {
4840 struct mem_cgroup *parent = parent_mem_cgroup(memcg);
4841 __mem_cgroup_free(memcg);
4843 mem_cgroup_put(parent);
4847 static void mem_cgroup_put(struct mem_cgroup *memcg)
4849 __mem_cgroup_put(memcg, 1);
4853 * Returns the parent mem_cgroup in memcgroup hierarchy with hierarchy enabled.
4855 struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *memcg)
4857 if (!memcg->res.parent)
4859 return mem_cgroup_from_res_counter(memcg->res.parent, res);
4861 EXPORT_SYMBOL(parent_mem_cgroup);
4863 #ifdef CONFIG_MEMCG_SWAP
4864 static void __init enable_swap_cgroup(void)
4866 if (!mem_cgroup_disabled() && really_do_swap_account)
4867 do_swap_account = 1;
4870 static void __init enable_swap_cgroup(void)
4875 static int mem_cgroup_soft_limit_tree_init(void)
4877 struct mem_cgroup_tree_per_node *rtpn;
4878 struct mem_cgroup_tree_per_zone *rtpz;
4879 int tmp, node, zone;
4881 for_each_node(node) {
4883 if (!node_state(node, N_NORMAL_MEMORY))
4885 rtpn = kzalloc_node(sizeof(*rtpn), GFP_KERNEL, tmp);
4889 soft_limit_tree.rb_tree_per_node[node] = rtpn;
4891 for (zone = 0; zone < MAX_NR_ZONES; zone++) {
4892 rtpz = &rtpn->rb_tree_per_zone[zone];
4893 rtpz->rb_root = RB_ROOT;
4894 spin_lock_init(&rtpz->lock);
4900 for_each_node(node) {
4901 if (!soft_limit_tree.rb_tree_per_node[node])
4903 kfree(soft_limit_tree.rb_tree_per_node[node]);
4904 soft_limit_tree.rb_tree_per_node[node] = NULL;
4910 static struct cgroup_subsys_state * __ref
4911 mem_cgroup_create(struct cgroup *cont)
4913 struct mem_cgroup *memcg, *parent;
4914 long error = -ENOMEM;
4917 memcg = mem_cgroup_alloc();
4919 return ERR_PTR(error);
4922 if (alloc_mem_cgroup_per_zone_info(memcg, node))
4926 if (cont->parent == NULL) {
4928 enable_swap_cgroup();
4930 if (mem_cgroup_soft_limit_tree_init())
4932 root_mem_cgroup = memcg;
4933 for_each_possible_cpu(cpu) {
4934 struct memcg_stock_pcp *stock =
4935 &per_cpu(memcg_stock, cpu);
4936 INIT_WORK(&stock->work, drain_local_stock);
4938 hotcpu_notifier(memcg_cpu_hotplug_callback, 0);
4940 parent = mem_cgroup_from_cont(cont->parent);
4941 memcg->use_hierarchy = parent->use_hierarchy;
4942 memcg->oom_kill_disable = parent->oom_kill_disable;
4945 if (parent && parent->use_hierarchy) {
4946 res_counter_init(&memcg->res, &parent->res);
4947 res_counter_init(&memcg->memsw, &parent->memsw);
4949 * We increment refcnt of the parent to ensure that we can
4950 * safely access it on res_counter_charge/uncharge.
4951 * This refcnt will be decremented when freeing this
4952 * mem_cgroup(see mem_cgroup_put).
4954 mem_cgroup_get(parent);
4956 res_counter_init(&memcg->res, NULL);
4957 res_counter_init(&memcg->memsw, NULL);
4959 memcg->last_scanned_node = MAX_NUMNODES;
4960 INIT_LIST_HEAD(&memcg->oom_notify);
4963 memcg->swappiness = mem_cgroup_swappiness(parent);
4964 atomic_set(&memcg->refcnt, 1);
4965 memcg->move_charge_at_immigrate = 0;
4966 mutex_init(&memcg->thresholds_lock);
4967 spin_lock_init(&memcg->move_lock);
4969 error = memcg_init_kmem(memcg, &mem_cgroup_subsys);
4972 * We call put now because our (and parent's) refcnts
4973 * are already in place. mem_cgroup_put() will internally
4974 * call __mem_cgroup_free, so return directly
4976 mem_cgroup_put(memcg);
4977 return ERR_PTR(error);
4981 __mem_cgroup_free(memcg);
4982 return ERR_PTR(error);
4985 static int mem_cgroup_pre_destroy(struct cgroup *cont)
4987 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4989 return mem_cgroup_force_empty(memcg, false);
4992 static void mem_cgroup_destroy(struct cgroup *cont)
4994 struct mem_cgroup *memcg = mem_cgroup_from_cont(cont);
4996 kmem_cgroup_destroy(memcg);
4998 mem_cgroup_put(memcg);
5002 /* Handlers for move charge at task migration. */
5003 #define PRECHARGE_COUNT_AT_ONCE 256
5004 static int mem_cgroup_do_precharge(unsigned long count)
5007 int batch_count = PRECHARGE_COUNT_AT_ONCE;
5008 struct mem_cgroup *memcg = mc.to;
5010 if (mem_cgroup_is_root(memcg)) {
5011 mc.precharge += count;
5012 /* we don't need css_get for root */
5015 /* try to charge at once */
5017 struct res_counter *dummy;
5019 * "memcg" cannot be under rmdir() because we've already checked
5020 * by cgroup_lock_live_cgroup() that it is not removed and we
5021 * are still under the same cgroup_mutex. So we can postpone
5024 if (res_counter_charge(&memcg->res, PAGE_SIZE * count, &dummy))
5026 if (do_swap_account && res_counter_charge(&memcg->memsw,
5027 PAGE_SIZE * count, &dummy)) {
5028 res_counter_uncharge(&memcg->res, PAGE_SIZE * count);
5031 mc.precharge += count;
5035 /* fall back to one by one charge */
5037 if (signal_pending(current)) {
5041 if (!batch_count--) {
5042 batch_count = PRECHARGE_COUNT_AT_ONCE;
5045 ret = __mem_cgroup_try_charge(NULL,
5046 GFP_KERNEL, 1, &memcg, false);
5048 /* mem_cgroup_clear_mc() will do uncharge later */
5056 * get_mctgt_type - get target type of moving charge
5057 * @vma: the vma the pte to be checked belongs
5058 * @addr: the address corresponding to the pte to be checked
5059 * @ptent: the pte to be checked
5060 * @target: the pointer the target page or swap ent will be stored(can be NULL)
5063 * 0(MC_TARGET_NONE): if the pte is not a target for move charge.
5064 * 1(MC_TARGET_PAGE): if the page corresponding to this pte is a target for
5065 * move charge. if @target is not NULL, the page is stored in target->page
5066 * with extra refcnt got(Callers should handle it).
5067 * 2(MC_TARGET_SWAP): if the swap entry corresponding to this pte is a
5068 * target for charge migration. if @target is not NULL, the entry is stored
5071 * Called with pte lock held.
5078 enum mc_target_type {
5084 static struct page *mc_handle_present_pte(struct vm_area_struct *vma,
5085 unsigned long addr, pte_t ptent)
5087 struct page *page = vm_normal_page(vma, addr, ptent);
5089 if (!page || !page_mapped(page))
5091 if (PageAnon(page)) {
5092 /* we don't move shared anon */
5095 } else if (!move_file())
5096 /* we ignore mapcount for file pages */
5098 if (!get_page_unless_zero(page))
5105 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
5106 unsigned long addr, pte_t ptent, swp_entry_t *entry)
5108 struct page *page = NULL;
5109 swp_entry_t ent = pte_to_swp_entry(ptent);
5111 if (!move_anon() || non_swap_entry(ent))
5114 * Because lookup_swap_cache() updates some statistics counter,
5115 * we call find_get_page() with swapper_space directly.
5117 page = find_get_page(&swapper_space, ent.val);
5118 if (do_swap_account)
5119 entry->val = ent.val;
5124 static struct page *mc_handle_swap_pte(struct vm_area_struct *vma,
5125 unsigned long addr, pte_t ptent, swp_entry_t *entry)
5131 static struct page *mc_handle_file_pte(struct vm_area_struct *vma,
5132 unsigned long addr, pte_t ptent, swp_entry_t *entry)
5134 struct page *page = NULL;
5135 struct address_space *mapping;
5138 if (!vma->vm_file) /* anonymous vma */
5143 mapping = vma->vm_file->f_mapping;
5144 if (pte_none(ptent))
5145 pgoff = linear_page_index(vma, addr);
5146 else /* pte_file(ptent) is true */
5147 pgoff = pte_to_pgoff(ptent);
5149 /* page is moved even if it's not RSS of this task(page-faulted). */
5150 page = find_get_page(mapping, pgoff);
5153 /* shmem/tmpfs may report page out on swap: account for that too. */
5154 if (radix_tree_exceptional_entry(page)) {
5155 swp_entry_t swap = radix_to_swp_entry(page);
5156 if (do_swap_account)
5158 page = find_get_page(&swapper_space, swap.val);
5164 static enum mc_target_type get_mctgt_type(struct vm_area_struct *vma,
5165 unsigned long addr, pte_t ptent, union mc_target *target)
5167 struct page *page = NULL;
5168 struct page_cgroup *pc;
5169 enum mc_target_type ret = MC_TARGET_NONE;
5170 swp_entry_t ent = { .val = 0 };
5172 if (pte_present(ptent))
5173 page = mc_handle_present_pte(vma, addr, ptent);
5174 else if (is_swap_pte(ptent))
5175 page = mc_handle_swap_pte(vma, addr, ptent, &ent);
5176 else if (pte_none(ptent) || pte_file(ptent))
5177 page = mc_handle_file_pte(vma, addr, ptent, &ent);
5179 if (!page && !ent.val)
5182 pc = lookup_page_cgroup(page);
5184 * Do only loose check w/o page_cgroup lock.
5185 * mem_cgroup_move_account() checks the pc is valid or not under
5188 if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) {
5189 ret = MC_TARGET_PAGE;
5191 target->page = page;
5193 if (!ret || !target)
5196 /* There is a swap entry and a page doesn't exist or isn't charged */
5197 if (ent.val && !ret &&
5198 css_id(&mc.from->css) == lookup_swap_cgroup_id(ent)) {
5199 ret = MC_TARGET_SWAP;
5206 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5208 * We don't consider swapping or file mapped pages because THP does not
5209 * support them for now.
5210 * Caller should make sure that pmd_trans_huge(pmd) is true.
5212 static enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
5213 unsigned long addr, pmd_t pmd, union mc_target *target)
5215 struct page *page = NULL;
5216 struct page_cgroup *pc;
5217 enum mc_target_type ret = MC_TARGET_NONE;
5219 page = pmd_page(pmd);
5220 VM_BUG_ON(!page || !PageHead(page));
5223 pc = lookup_page_cgroup(page);
5224 if (PageCgroupUsed(pc) && pc->mem_cgroup == mc.from) {
5225 ret = MC_TARGET_PAGE;
5228 target->page = page;
5234 static inline enum mc_target_type get_mctgt_type_thp(struct vm_area_struct *vma,
5235 unsigned long addr, pmd_t pmd, union mc_target *target)
5237 return MC_TARGET_NONE;
5241 static int mem_cgroup_count_precharge_pte_range(pmd_t *pmd,
5242 unsigned long addr, unsigned long end,
5243 struct mm_walk *walk)
5245 struct vm_area_struct *vma = walk->private;
5249 if (pmd_trans_huge_lock(pmd, vma) == 1) {
5250 if (get_mctgt_type_thp(vma, addr, *pmd, NULL) == MC_TARGET_PAGE)
5251 mc.precharge += HPAGE_PMD_NR;
5252 spin_unlock(&vma->vm_mm->page_table_lock);
5256 if (pmd_trans_unstable(pmd))
5258 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
5259 for (; addr != end; pte++, addr += PAGE_SIZE)
5260 if (get_mctgt_type(vma, addr, *pte, NULL))
5261 mc.precharge++; /* increment precharge temporarily */
5262 pte_unmap_unlock(pte - 1, ptl);
5268 static unsigned long mem_cgroup_count_precharge(struct mm_struct *mm)
5270 unsigned long precharge;
5271 struct vm_area_struct *vma;
5273 down_read(&mm->mmap_sem);
5274 for (vma = mm->mmap; vma; vma = vma->vm_next) {
5275 struct mm_walk mem_cgroup_count_precharge_walk = {
5276 .pmd_entry = mem_cgroup_count_precharge_pte_range,
5280 if (is_vm_hugetlb_page(vma))
5282 walk_page_range(vma->vm_start, vma->vm_end,
5283 &mem_cgroup_count_precharge_walk);
5285 up_read(&mm->mmap_sem);
5287 precharge = mc.precharge;
5293 static int mem_cgroup_precharge_mc(struct mm_struct *mm)
5295 unsigned long precharge = mem_cgroup_count_precharge(mm);
5297 VM_BUG_ON(mc.moving_task);
5298 mc.moving_task = current;
5299 return mem_cgroup_do_precharge(precharge);
5302 /* cancels all extra charges on mc.from and mc.to, and wakes up all waiters. */
5303 static void __mem_cgroup_clear_mc(void)
5305 struct mem_cgroup *from = mc.from;
5306 struct mem_cgroup *to = mc.to;
5308 /* we must uncharge all the leftover precharges from mc.to */
5310 __mem_cgroup_cancel_charge(mc.to, mc.precharge);
5314 * we didn't uncharge from mc.from at mem_cgroup_move_account(), so
5315 * we must uncharge here.
5317 if (mc.moved_charge) {
5318 __mem_cgroup_cancel_charge(mc.from, mc.moved_charge);
5319 mc.moved_charge = 0;
5321 /* we must fixup refcnts and charges */
5322 if (mc.moved_swap) {
5323 /* uncharge swap account from the old cgroup */
5324 if (!mem_cgroup_is_root(mc.from))
5325 res_counter_uncharge(&mc.from->memsw,
5326 PAGE_SIZE * mc.moved_swap);
5327 __mem_cgroup_put(mc.from, mc.moved_swap);
5329 if (!mem_cgroup_is_root(mc.to)) {
5331 * we charged both to->res and to->memsw, so we should
5334 res_counter_uncharge(&mc.to->res,
5335 PAGE_SIZE * mc.moved_swap);
5337 /* we've already done mem_cgroup_get(mc.to) */
5340 memcg_oom_recover(from);
5341 memcg_oom_recover(to);
5342 wake_up_all(&mc.waitq);
5345 static void mem_cgroup_clear_mc(void)
5347 struct mem_cgroup *from = mc.from;
5350 * we must clear moving_task before waking up waiters at the end of
5353 mc.moving_task = NULL;
5354 __mem_cgroup_clear_mc();
5355 spin_lock(&mc.lock);
5358 spin_unlock(&mc.lock);
5359 mem_cgroup_end_move(from);
5362 static int mem_cgroup_can_attach(struct cgroup *cgroup,
5363 struct cgroup_taskset *tset)
5365 struct task_struct *p = cgroup_taskset_first(tset);
5367 struct mem_cgroup *memcg = mem_cgroup_from_cont(cgroup);
5369 if (memcg->move_charge_at_immigrate) {
5370 struct mm_struct *mm;
5371 struct mem_cgroup *from = mem_cgroup_from_task(p);
5373 VM_BUG_ON(from == memcg);
5375 mm = get_task_mm(p);
5378 /* We move charges only when we move a owner of the mm */
5379 if (mm->owner == p) {
5382 VM_BUG_ON(mc.precharge);
5383 VM_BUG_ON(mc.moved_charge);
5384 VM_BUG_ON(mc.moved_swap);
5385 mem_cgroup_start_move(from);
5386 spin_lock(&mc.lock);
5389 spin_unlock(&mc.lock);
5390 /* We set mc.moving_task later */
5392 ret = mem_cgroup_precharge_mc(mm);
5394 mem_cgroup_clear_mc();
5401 static void mem_cgroup_cancel_attach(struct cgroup *cgroup,
5402 struct cgroup_taskset *tset)
5404 mem_cgroup_clear_mc();
5407 static int mem_cgroup_move_charge_pte_range(pmd_t *pmd,
5408 unsigned long addr, unsigned long end,
5409 struct mm_walk *walk)
5412 struct vm_area_struct *vma = walk->private;
5415 enum mc_target_type target_type;
5416 union mc_target target;
5418 struct page_cgroup *pc;
5421 * We don't take compound_lock() here but no race with splitting thp
5423 * - if pmd_trans_huge_lock() returns 1, the relevant thp is not
5424 * under splitting, which means there's no concurrent thp split,
5425 * - if another thread runs into split_huge_page() just after we
5426 * entered this if-block, the thread must wait for page table lock
5427 * to be unlocked in __split_huge_page_splitting(), where the main
5428 * part of thp split is not executed yet.
5430 if (pmd_trans_huge_lock(pmd, vma) == 1) {
5431 if (mc.precharge < HPAGE_PMD_NR) {
5432 spin_unlock(&vma->vm_mm->page_table_lock);
5435 target_type = get_mctgt_type_thp(vma, addr, *pmd, &target);
5436 if (target_type == MC_TARGET_PAGE) {
5438 if (!isolate_lru_page(page)) {
5439 pc = lookup_page_cgroup(page);
5440 if (!mem_cgroup_move_account(page, HPAGE_PMD_NR,
5441 pc, mc.from, mc.to)) {
5442 mc.precharge -= HPAGE_PMD_NR;
5443 mc.moved_charge += HPAGE_PMD_NR;
5445 putback_lru_page(page);
5449 spin_unlock(&vma->vm_mm->page_table_lock);
5453 if (pmd_trans_unstable(pmd))
5456 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
5457 for (; addr != end; addr += PAGE_SIZE) {
5458 pte_t ptent = *(pte++);
5464 switch (get_mctgt_type(vma, addr, ptent, &target)) {
5465 case MC_TARGET_PAGE:
5467 if (isolate_lru_page(page))
5469 pc = lookup_page_cgroup(page);
5470 if (!mem_cgroup_move_account(page, 1, pc,
5473 /* we uncharge from mc.from later. */
5476 putback_lru_page(page);
5477 put: /* get_mctgt_type() gets the page */
5480 case MC_TARGET_SWAP:
5482 if (!mem_cgroup_move_swap_account(ent, mc.from, mc.to)) {
5484 /* we fixup refcnts and charges later. */
5492 pte_unmap_unlock(pte - 1, ptl);
5497 * We have consumed all precharges we got in can_attach().
5498 * We try charge one by one, but don't do any additional
5499 * charges to mc.to if we have failed in charge once in attach()
5502 ret = mem_cgroup_do_precharge(1);
5510 static void mem_cgroup_move_charge(struct mm_struct *mm)
5512 struct vm_area_struct *vma;
5514 lru_add_drain_all();
5516 if (unlikely(!down_read_trylock(&mm->mmap_sem))) {
5518 * Someone who are holding the mmap_sem might be waiting in
5519 * waitq. So we cancel all extra charges, wake up all waiters,
5520 * and retry. Because we cancel precharges, we might not be able
5521 * to move enough charges, but moving charge is a best-effort
5522 * feature anyway, so it wouldn't be a big problem.
5524 __mem_cgroup_clear_mc();
5528 for (vma = mm->mmap; vma; vma = vma->vm_next) {
5530 struct mm_walk mem_cgroup_move_charge_walk = {
5531 .pmd_entry = mem_cgroup_move_charge_pte_range,
5535 if (is_vm_hugetlb_page(vma))
5537 ret = walk_page_range(vma->vm_start, vma->vm_end,
5538 &mem_cgroup_move_charge_walk);
5541 * means we have consumed all precharges and failed in
5542 * doing additional charge. Just abandon here.
5546 up_read(&mm->mmap_sem);
5549 static void mem_cgroup_move_task(struct cgroup *cont,
5550 struct cgroup_taskset *tset)
5552 struct task_struct *p = cgroup_taskset_first(tset);
5553 struct mm_struct *mm = get_task_mm(p);
5557 mem_cgroup_move_charge(mm);
5561 mem_cgroup_clear_mc();
5563 #else /* !CONFIG_MMU */
5564 static int mem_cgroup_can_attach(struct cgroup *cgroup,
5565 struct cgroup_taskset *tset)
5569 static void mem_cgroup_cancel_attach(struct cgroup *cgroup,
5570 struct cgroup_taskset *tset)
5573 static void mem_cgroup_move_task(struct cgroup *cont,
5574 struct cgroup_taskset *tset)
5579 struct cgroup_subsys mem_cgroup_subsys = {
5581 .subsys_id = mem_cgroup_subsys_id,
5582 .create = mem_cgroup_create,
5583 .pre_destroy = mem_cgroup_pre_destroy,
5584 .destroy = mem_cgroup_destroy,
5585 .can_attach = mem_cgroup_can_attach,
5586 .cancel_attach = mem_cgroup_cancel_attach,
5587 .attach = mem_cgroup_move_task,
5588 .base_cftypes = mem_cgroup_files,
5591 .__DEPRECATED_clear_css_refs = true,
5594 #ifdef CONFIG_MEMCG_SWAP
5595 static int __init enable_swap_account(char *s)
5597 /* consider enabled if no parameter or 1 is given */
5598 if (!strcmp(s, "1"))
5599 really_do_swap_account = 1;
5600 else if (!strcmp(s, "0"))
5601 really_do_swap_account = 0;
5604 __setup("swapaccount=", enable_swap_account);