Commit | Line | Data |
---|---|---|
8cdea7c0 BS |
1 | /* memcontrol.c - Memory Controller |
2 | * | |
3 | * Copyright IBM Corporation, 2007 | |
4 | * Author Balbir Singh <balbir@linux.vnet.ibm.com> | |
5 | * | |
78fb7466 PE |
6 | * Copyright 2007 OpenVZ SWsoft Inc |
7 | * Author: Pavel Emelianov <xemul@openvz.org> | |
8 | * | |
8cdea7c0 BS |
9 | * This program is free software; you can redistribute it and/or modify |
10 | * it under the terms of the GNU General Public License as published by | |
11 | * the Free Software Foundation; either version 2 of the License, or | |
12 | * (at your option) any later version. | |
13 | * | |
14 | * This program is distributed in the hope that it will be useful, | |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | * GNU General Public License for more details. | |
18 | */ | |
19 | ||
20 | #include <linux/res_counter.h> | |
21 | #include <linux/memcontrol.h> | |
22 | #include <linux/cgroup.h> | |
78fb7466 | 23 | #include <linux/mm.h> |
d52aa412 | 24 | #include <linux/smp.h> |
8a9f3ccd | 25 | #include <linux/page-flags.h> |
66e1707b | 26 | #include <linux/backing-dev.h> |
8a9f3ccd BS |
27 | #include <linux/bit_spinlock.h> |
28 | #include <linux/rcupdate.h> | |
b6ac57d5 | 29 | #include <linux/slab.h> |
66e1707b BS |
30 | #include <linux/swap.h> |
31 | #include <linux/spinlock.h> | |
32 | #include <linux/fs.h> | |
d2ceb9b7 | 33 | #include <linux/seq_file.h> |
33327948 | 34 | #include <linux/vmalloc.h> |
8cdea7c0 | 35 | |
8697d331 BS |
36 | #include <asm/uaccess.h> |
37 | ||
a181b0e8 KH |
38 | struct cgroup_subsys mem_cgroup_subsys __read_mostly; |
39 | static struct kmem_cache *page_cgroup_cache __read_mostly; | |
40 | #define MEM_CGROUP_RECLAIM_RETRIES 5 | |
8cdea7c0 | 41 | |
d52aa412 KH |
42 | /* |
43 | * Statistics for memory cgroup. | |
44 | */ | |
45 | enum mem_cgroup_stat_index { | |
46 | /* | |
47 | * For MEM_CONTAINER_TYPE_ALL, usage = pagecache + rss. | |
48 | */ | |
49 | MEM_CGROUP_STAT_CACHE, /* # of pages charged as cache */ | |
50 | MEM_CGROUP_STAT_RSS, /* # of pages charged as rss */ | |
55e462b0 BR |
51 | MEM_CGROUP_STAT_PGPGIN_COUNT, /* # of pages paged in */ |
52 | MEM_CGROUP_STAT_PGPGOUT_COUNT, /* # of pages paged out */ | |
d52aa412 KH |
53 | |
54 | MEM_CGROUP_STAT_NSTATS, | |
55 | }; | |
56 | ||
57 | struct mem_cgroup_stat_cpu { | |
58 | s64 count[MEM_CGROUP_STAT_NSTATS]; | |
59 | } ____cacheline_aligned_in_smp; | |
60 | ||
61 | struct mem_cgroup_stat { | |
62 | struct mem_cgroup_stat_cpu cpustat[NR_CPUS]; | |
63 | }; | |
64 | ||
65 | /* | |
66 | * For accounting under irq disable, no need for increment preempt count. | |
67 | */ | |
68 | static void __mem_cgroup_stat_add_safe(struct mem_cgroup_stat *stat, | |
69 | enum mem_cgroup_stat_index idx, int val) | |
70 | { | |
71 | int cpu = smp_processor_id(); | |
72 | stat->cpustat[cpu].count[idx] += val; | |
73 | } | |
74 | ||
75 | static s64 mem_cgroup_read_stat(struct mem_cgroup_stat *stat, | |
76 | enum mem_cgroup_stat_index idx) | |
77 | { | |
78 | int cpu; | |
79 | s64 ret = 0; | |
80 | for_each_possible_cpu(cpu) | |
81 | ret += stat->cpustat[cpu].count[idx]; | |
82 | return ret; | |
83 | } | |
84 | ||
6d12e2d8 KH |
85 | /* |
86 | * per-zone information in memory controller. | |
87 | */ | |
88 | ||
89 | enum mem_cgroup_zstat_index { | |
90 | MEM_CGROUP_ZSTAT_ACTIVE, | |
91 | MEM_CGROUP_ZSTAT_INACTIVE, | |
92 | ||
93 | NR_MEM_CGROUP_ZSTAT, | |
94 | }; | |
95 | ||
96 | struct mem_cgroup_per_zone { | |
072c56c1 KH |
97 | /* |
98 | * spin_lock to protect the per cgroup LRU | |
99 | */ | |
100 | spinlock_t lru_lock; | |
1ecaab2b KH |
101 | struct list_head active_list; |
102 | struct list_head inactive_list; | |
6d12e2d8 KH |
103 | unsigned long count[NR_MEM_CGROUP_ZSTAT]; |
104 | }; | |
105 | /* Macro for accessing counter */ | |
106 | #define MEM_CGROUP_ZSTAT(mz, idx) ((mz)->count[(idx)]) | |
107 | ||
108 | struct mem_cgroup_per_node { | |
109 | struct mem_cgroup_per_zone zoneinfo[MAX_NR_ZONES]; | |
110 | }; | |
111 | ||
112 | struct mem_cgroup_lru_info { | |
113 | struct mem_cgroup_per_node *nodeinfo[MAX_NUMNODES]; | |
114 | }; | |
115 | ||
8cdea7c0 BS |
116 | /* |
117 | * The memory controller data structure. The memory controller controls both | |
118 | * page cache and RSS per cgroup. We would eventually like to provide | |
119 | * statistics based on the statistics developed by Rik Van Riel for clock-pro, | |
120 | * to help the administrator determine what knobs to tune. | |
121 | * | |
122 | * TODO: Add a water mark for the memory controller. Reclaim will begin when | |
8a9f3ccd BS |
123 | * we hit the water mark. May be even add a low water mark, such that |
124 | * no reclaim occurs from a cgroup at it's low water mark, this is | |
125 | * a feature that will be implemented much later in the future. | |
8cdea7c0 BS |
126 | */ |
127 | struct mem_cgroup { | |
128 | struct cgroup_subsys_state css; | |
129 | /* | |
130 | * the counter to account for memory usage | |
131 | */ | |
132 | struct res_counter res; | |
78fb7466 PE |
133 | /* |
134 | * Per cgroup active and inactive list, similar to the | |
135 | * per zone LRU lists. | |
78fb7466 | 136 | */ |
6d12e2d8 | 137 | struct mem_cgroup_lru_info info; |
072c56c1 | 138 | |
6c48a1d0 | 139 | int prev_priority; /* for recording reclaim priority */ |
d52aa412 KH |
140 | /* |
141 | * statistics. | |
142 | */ | |
143 | struct mem_cgroup_stat stat; | |
8cdea7c0 | 144 | }; |
8869b8f6 | 145 | static struct mem_cgroup init_mem_cgroup; |
8cdea7c0 | 146 | |
8a9f3ccd BS |
147 | /* |
148 | * We use the lower bit of the page->page_cgroup pointer as a bit spin | |
9442ec9d HD |
149 | * lock. We need to ensure that page->page_cgroup is at least two |
150 | * byte aligned (based on comments from Nick Piggin). But since | |
151 | * bit_spin_lock doesn't actually set that lock bit in a non-debug | |
152 | * uniprocessor kernel, we should avoid setting it here too. | |
8a9f3ccd BS |
153 | */ |
154 | #define PAGE_CGROUP_LOCK_BIT 0x0 | |
9442ec9d HD |
155 | #if defined(CONFIG_SMP) || defined(CONFIG_DEBUG_SPINLOCK) |
156 | #define PAGE_CGROUP_LOCK (1 << PAGE_CGROUP_LOCK_BIT) | |
157 | #else | |
158 | #define PAGE_CGROUP_LOCK 0x0 | |
159 | #endif | |
8a9f3ccd | 160 | |
8cdea7c0 BS |
161 | /* |
162 | * A page_cgroup page is associated with every page descriptor. The | |
163 | * page_cgroup helps us identify information about the cgroup | |
164 | */ | |
165 | struct page_cgroup { | |
166 | struct list_head lru; /* per cgroup LRU list */ | |
167 | struct page *page; | |
168 | struct mem_cgroup *mem_cgroup; | |
8869b8f6 | 169 | int flags; |
8cdea7c0 | 170 | }; |
217bc319 | 171 | #define PAGE_CGROUP_FLAG_CACHE (0x1) /* charged as cache */ |
3564c7c4 | 172 | #define PAGE_CGROUP_FLAG_ACTIVE (0x2) /* page is active in this cgroup */ |
8cdea7c0 | 173 | |
d5b69e38 | 174 | static int page_cgroup_nid(struct page_cgroup *pc) |
c0149530 KH |
175 | { |
176 | return page_to_nid(pc->page); | |
177 | } | |
178 | ||
d5b69e38 | 179 | static enum zone_type page_cgroup_zid(struct page_cgroup *pc) |
c0149530 KH |
180 | { |
181 | return page_zonenum(pc->page); | |
182 | } | |
183 | ||
217bc319 KH |
184 | enum charge_type { |
185 | MEM_CGROUP_CHARGE_TYPE_CACHE = 0, | |
186 | MEM_CGROUP_CHARGE_TYPE_MAPPED, | |
69029cd5 | 187 | MEM_CGROUP_CHARGE_TYPE_FORCE, /* used by force_empty */ |
217bc319 KH |
188 | }; |
189 | ||
d52aa412 KH |
190 | /* |
191 | * Always modified under lru lock. Then, not necessary to preempt_disable() | |
192 | */ | |
193 | static void mem_cgroup_charge_statistics(struct mem_cgroup *mem, int flags, | |
194 | bool charge) | |
195 | { | |
196 | int val = (charge)? 1 : -1; | |
197 | struct mem_cgroup_stat *stat = &mem->stat; | |
d52aa412 | 198 | |
8869b8f6 | 199 | VM_BUG_ON(!irqs_disabled()); |
d52aa412 | 200 | if (flags & PAGE_CGROUP_FLAG_CACHE) |
8869b8f6 | 201 | __mem_cgroup_stat_add_safe(stat, MEM_CGROUP_STAT_CACHE, val); |
d52aa412 KH |
202 | else |
203 | __mem_cgroup_stat_add_safe(stat, MEM_CGROUP_STAT_RSS, val); | |
55e462b0 BR |
204 | |
205 | if (charge) | |
206 | __mem_cgroup_stat_add_safe(stat, | |
207 | MEM_CGROUP_STAT_PGPGIN_COUNT, 1); | |
208 | else | |
209 | __mem_cgroup_stat_add_safe(stat, | |
210 | MEM_CGROUP_STAT_PGPGOUT_COUNT, 1); | |
6d12e2d8 KH |
211 | } |
212 | ||
d5b69e38 | 213 | static struct mem_cgroup_per_zone * |
6d12e2d8 KH |
214 | mem_cgroup_zoneinfo(struct mem_cgroup *mem, int nid, int zid) |
215 | { | |
6d12e2d8 KH |
216 | return &mem->info.nodeinfo[nid]->zoneinfo[zid]; |
217 | } | |
218 | ||
d5b69e38 | 219 | static struct mem_cgroup_per_zone * |
6d12e2d8 KH |
220 | page_cgroup_zoneinfo(struct page_cgroup *pc) |
221 | { | |
222 | struct mem_cgroup *mem = pc->mem_cgroup; | |
223 | int nid = page_cgroup_nid(pc); | |
224 | int zid = page_cgroup_zid(pc); | |
d52aa412 | 225 | |
6d12e2d8 KH |
226 | return mem_cgroup_zoneinfo(mem, nid, zid); |
227 | } | |
228 | ||
229 | static unsigned long mem_cgroup_get_all_zonestat(struct mem_cgroup *mem, | |
230 | enum mem_cgroup_zstat_index idx) | |
231 | { | |
232 | int nid, zid; | |
233 | struct mem_cgroup_per_zone *mz; | |
234 | u64 total = 0; | |
235 | ||
236 | for_each_online_node(nid) | |
237 | for (zid = 0; zid < MAX_NR_ZONES; zid++) { | |
238 | mz = mem_cgroup_zoneinfo(mem, nid, zid); | |
239 | total += MEM_CGROUP_ZSTAT(mz, idx); | |
240 | } | |
241 | return total; | |
d52aa412 KH |
242 | } |
243 | ||
d5b69e38 | 244 | static struct mem_cgroup *mem_cgroup_from_cont(struct cgroup *cont) |
8cdea7c0 BS |
245 | { |
246 | return container_of(cgroup_subsys_state(cont, | |
247 | mem_cgroup_subsys_id), struct mem_cgroup, | |
248 | css); | |
249 | } | |
250 | ||
cf475ad2 | 251 | struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p) |
78fb7466 PE |
252 | { |
253 | return container_of(task_subsys_state(p, mem_cgroup_subsys_id), | |
254 | struct mem_cgroup, css); | |
255 | } | |
256 | ||
8a9f3ccd BS |
257 | static inline int page_cgroup_locked(struct page *page) |
258 | { | |
8869b8f6 | 259 | return bit_spin_is_locked(PAGE_CGROUP_LOCK_BIT, &page->page_cgroup); |
8a9f3ccd BS |
260 | } |
261 | ||
9442ec9d | 262 | static void page_assign_page_cgroup(struct page *page, struct page_cgroup *pc) |
78fb7466 | 263 | { |
9442ec9d HD |
264 | VM_BUG_ON(!page_cgroup_locked(page)); |
265 | page->page_cgroup = ((unsigned long)pc | PAGE_CGROUP_LOCK); | |
78fb7466 PE |
266 | } |
267 | ||
268 | struct page_cgroup *page_get_page_cgroup(struct page *page) | |
269 | { | |
8869b8f6 | 270 | return (struct page_cgroup *) (page->page_cgroup & ~PAGE_CGROUP_LOCK); |
8a9f3ccd BS |
271 | } |
272 | ||
d5b69e38 | 273 | static void lock_page_cgroup(struct page *page) |
8a9f3ccd BS |
274 | { |
275 | bit_spin_lock(PAGE_CGROUP_LOCK_BIT, &page->page_cgroup); | |
8a9f3ccd BS |
276 | } |
277 | ||
2680eed7 HD |
278 | static int try_lock_page_cgroup(struct page *page) |
279 | { | |
280 | return bit_spin_trylock(PAGE_CGROUP_LOCK_BIT, &page->page_cgroup); | |
281 | } | |
282 | ||
d5b69e38 | 283 | static void unlock_page_cgroup(struct page *page) |
8a9f3ccd BS |
284 | { |
285 | bit_spin_unlock(PAGE_CGROUP_LOCK_BIT, &page->page_cgroup); | |
286 | } | |
287 | ||
3eae90c3 KH |
288 | static void __mem_cgroup_remove_list(struct mem_cgroup_per_zone *mz, |
289 | struct page_cgroup *pc) | |
6d12e2d8 KH |
290 | { |
291 | int from = pc->flags & PAGE_CGROUP_FLAG_ACTIVE; | |
6d12e2d8 KH |
292 | |
293 | if (from) | |
294 | MEM_CGROUP_ZSTAT(mz, MEM_CGROUP_ZSTAT_ACTIVE) -= 1; | |
295 | else | |
296 | MEM_CGROUP_ZSTAT(mz, MEM_CGROUP_ZSTAT_INACTIVE) -= 1; | |
297 | ||
298 | mem_cgroup_charge_statistics(pc->mem_cgroup, pc->flags, false); | |
508b7be0 | 299 | list_del(&pc->lru); |
6d12e2d8 KH |
300 | } |
301 | ||
3eae90c3 KH |
302 | static void __mem_cgroup_add_list(struct mem_cgroup_per_zone *mz, |
303 | struct page_cgroup *pc) | |
6d12e2d8 KH |
304 | { |
305 | int to = pc->flags & PAGE_CGROUP_FLAG_ACTIVE; | |
6d12e2d8 KH |
306 | |
307 | if (!to) { | |
308 | MEM_CGROUP_ZSTAT(mz, MEM_CGROUP_ZSTAT_INACTIVE) += 1; | |
1ecaab2b | 309 | list_add(&pc->lru, &mz->inactive_list); |
6d12e2d8 KH |
310 | } else { |
311 | MEM_CGROUP_ZSTAT(mz, MEM_CGROUP_ZSTAT_ACTIVE) += 1; | |
1ecaab2b | 312 | list_add(&pc->lru, &mz->active_list); |
6d12e2d8 KH |
313 | } |
314 | mem_cgroup_charge_statistics(pc->mem_cgroup, pc->flags, true); | |
315 | } | |
316 | ||
8697d331 | 317 | static void __mem_cgroup_move_lists(struct page_cgroup *pc, bool active) |
66e1707b | 318 | { |
6d12e2d8 KH |
319 | int from = pc->flags & PAGE_CGROUP_FLAG_ACTIVE; |
320 | struct mem_cgroup_per_zone *mz = page_cgroup_zoneinfo(pc); | |
321 | ||
322 | if (from) | |
323 | MEM_CGROUP_ZSTAT(mz, MEM_CGROUP_ZSTAT_ACTIVE) -= 1; | |
324 | else | |
325 | MEM_CGROUP_ZSTAT(mz, MEM_CGROUP_ZSTAT_INACTIVE) -= 1; | |
326 | ||
3564c7c4 | 327 | if (active) { |
6d12e2d8 | 328 | MEM_CGROUP_ZSTAT(mz, MEM_CGROUP_ZSTAT_ACTIVE) += 1; |
3564c7c4 | 329 | pc->flags |= PAGE_CGROUP_FLAG_ACTIVE; |
1ecaab2b | 330 | list_move(&pc->lru, &mz->active_list); |
3564c7c4 | 331 | } else { |
6d12e2d8 | 332 | MEM_CGROUP_ZSTAT(mz, MEM_CGROUP_ZSTAT_INACTIVE) += 1; |
3564c7c4 | 333 | pc->flags &= ~PAGE_CGROUP_FLAG_ACTIVE; |
1ecaab2b | 334 | list_move(&pc->lru, &mz->inactive_list); |
3564c7c4 | 335 | } |
66e1707b BS |
336 | } |
337 | ||
4c4a2214 DR |
338 | int task_in_mem_cgroup(struct task_struct *task, const struct mem_cgroup *mem) |
339 | { | |
340 | int ret; | |
341 | ||
342 | task_lock(task); | |
bd845e38 | 343 | ret = task->mm && mm_match_cgroup(task->mm, mem); |
4c4a2214 DR |
344 | task_unlock(task); |
345 | return ret; | |
346 | } | |
347 | ||
66e1707b BS |
348 | /* |
349 | * This routine assumes that the appropriate zone's lru lock is already held | |
350 | */ | |
427d5416 | 351 | void mem_cgroup_move_lists(struct page *page, bool active) |
66e1707b | 352 | { |
427d5416 | 353 | struct page_cgroup *pc; |
072c56c1 KH |
354 | struct mem_cgroup_per_zone *mz; |
355 | unsigned long flags; | |
356 | ||
2680eed7 HD |
357 | /* |
358 | * We cannot lock_page_cgroup while holding zone's lru_lock, | |
359 | * because other holders of lock_page_cgroup can be interrupted | |
360 | * with an attempt to rotate_reclaimable_page. But we cannot | |
361 | * safely get to page_cgroup without it, so just try_lock it: | |
362 | * mem_cgroup_isolate_pages allows for page left on wrong list. | |
363 | */ | |
364 | if (!try_lock_page_cgroup(page)) | |
66e1707b BS |
365 | return; |
366 | ||
2680eed7 HD |
367 | pc = page_get_page_cgroup(page); |
368 | if (pc) { | |
2680eed7 | 369 | mz = page_cgroup_zoneinfo(pc); |
2680eed7 | 370 | spin_lock_irqsave(&mz->lru_lock, flags); |
9b3c0a07 | 371 | __mem_cgroup_move_lists(pc, active); |
2680eed7 | 372 | spin_unlock_irqrestore(&mz->lru_lock, flags); |
9b3c0a07 HT |
373 | } |
374 | unlock_page_cgroup(page); | |
66e1707b BS |
375 | } |
376 | ||
58ae83db KH |
377 | /* |
378 | * Calculate mapped_ratio under memory controller. This will be used in | |
379 | * vmscan.c for deteremining we have to reclaim mapped pages. | |
380 | */ | |
381 | int mem_cgroup_calc_mapped_ratio(struct mem_cgroup *mem) | |
382 | { | |
383 | long total, rss; | |
384 | ||
385 | /* | |
386 | * usage is recorded in bytes. But, here, we assume the number of | |
387 | * physical pages can be represented by "long" on any arch. | |
388 | */ | |
389 | total = (long) (mem->res.usage >> PAGE_SHIFT) + 1L; | |
390 | rss = (long)mem_cgroup_read_stat(&mem->stat, MEM_CGROUP_STAT_RSS); | |
391 | return (int)((rss * 100L) / total); | |
392 | } | |
8869b8f6 | 393 | |
5932f367 KH |
394 | /* |
395 | * This function is called from vmscan.c. In page reclaiming loop. balance | |
396 | * between active and inactive list is calculated. For memory controller | |
397 | * page reclaiming, we should use using mem_cgroup's imbalance rather than | |
398 | * zone's global lru imbalance. | |
399 | */ | |
400 | long mem_cgroup_reclaim_imbalance(struct mem_cgroup *mem) | |
401 | { | |
402 | unsigned long active, inactive; | |
403 | /* active and inactive are the number of pages. 'long' is ok.*/ | |
404 | active = mem_cgroup_get_all_zonestat(mem, MEM_CGROUP_ZSTAT_ACTIVE); | |
405 | inactive = mem_cgroup_get_all_zonestat(mem, MEM_CGROUP_ZSTAT_INACTIVE); | |
406 | return (long) (active / (inactive + 1)); | |
407 | } | |
58ae83db | 408 | |
6c48a1d0 KH |
409 | /* |
410 | * prev_priority control...this will be used in memory reclaim path. | |
411 | */ | |
412 | int mem_cgroup_get_reclaim_priority(struct mem_cgroup *mem) | |
413 | { | |
414 | return mem->prev_priority; | |
415 | } | |
416 | ||
417 | void mem_cgroup_note_reclaim_priority(struct mem_cgroup *mem, int priority) | |
418 | { | |
419 | if (priority < mem->prev_priority) | |
420 | mem->prev_priority = priority; | |
421 | } | |
422 | ||
423 | void mem_cgroup_record_reclaim_priority(struct mem_cgroup *mem, int priority) | |
424 | { | |
425 | mem->prev_priority = priority; | |
426 | } | |
427 | ||
cc38108e KH |
428 | /* |
429 | * Calculate # of pages to be scanned in this priority/zone. | |
430 | * See also vmscan.c | |
431 | * | |
432 | * priority starts from "DEF_PRIORITY" and decremented in each loop. | |
433 | * (see include/linux/mmzone.h) | |
434 | */ | |
435 | ||
436 | long mem_cgroup_calc_reclaim_active(struct mem_cgroup *mem, | |
437 | struct zone *zone, int priority) | |
438 | { | |
439 | long nr_active; | |
440 | int nid = zone->zone_pgdat->node_id; | |
441 | int zid = zone_idx(zone); | |
442 | struct mem_cgroup_per_zone *mz = mem_cgroup_zoneinfo(mem, nid, zid); | |
443 | ||
444 | nr_active = MEM_CGROUP_ZSTAT(mz, MEM_CGROUP_ZSTAT_ACTIVE); | |
445 | return (nr_active >> priority); | |
446 | } | |
447 | ||
448 | long mem_cgroup_calc_reclaim_inactive(struct mem_cgroup *mem, | |
449 | struct zone *zone, int priority) | |
450 | { | |
451 | long nr_inactive; | |
452 | int nid = zone->zone_pgdat->node_id; | |
453 | int zid = zone_idx(zone); | |
454 | struct mem_cgroup_per_zone *mz = mem_cgroup_zoneinfo(mem, nid, zid); | |
455 | ||
456 | nr_inactive = MEM_CGROUP_ZSTAT(mz, MEM_CGROUP_ZSTAT_INACTIVE); | |
cc38108e KH |
457 | return (nr_inactive >> priority); |
458 | } | |
459 | ||
66e1707b BS |
460 | unsigned long mem_cgroup_isolate_pages(unsigned long nr_to_scan, |
461 | struct list_head *dst, | |
462 | unsigned long *scanned, int order, | |
463 | int mode, struct zone *z, | |
464 | struct mem_cgroup *mem_cont, | |
465 | int active) | |
466 | { | |
467 | unsigned long nr_taken = 0; | |
468 | struct page *page; | |
469 | unsigned long scan; | |
470 | LIST_HEAD(pc_list); | |
471 | struct list_head *src; | |
ff7283fa | 472 | struct page_cgroup *pc, *tmp; |
1ecaab2b KH |
473 | int nid = z->zone_pgdat->node_id; |
474 | int zid = zone_idx(z); | |
475 | struct mem_cgroup_per_zone *mz; | |
66e1707b | 476 | |
cf475ad2 | 477 | BUG_ON(!mem_cont); |
1ecaab2b | 478 | mz = mem_cgroup_zoneinfo(mem_cont, nid, zid); |
66e1707b | 479 | if (active) |
1ecaab2b | 480 | src = &mz->active_list; |
66e1707b | 481 | else |
1ecaab2b KH |
482 | src = &mz->inactive_list; |
483 | ||
66e1707b | 484 | |
072c56c1 | 485 | spin_lock(&mz->lru_lock); |
ff7283fa KH |
486 | scan = 0; |
487 | list_for_each_entry_safe_reverse(pc, tmp, src, lru) { | |
436c6541 | 488 | if (scan >= nr_to_scan) |
ff7283fa | 489 | break; |
66e1707b | 490 | page = pc->page; |
66e1707b | 491 | |
436c6541 | 492 | if (unlikely(!PageLRU(page))) |
ff7283fa | 493 | continue; |
ff7283fa | 494 | |
66e1707b BS |
495 | if (PageActive(page) && !active) { |
496 | __mem_cgroup_move_lists(pc, true); | |
66e1707b BS |
497 | continue; |
498 | } | |
499 | if (!PageActive(page) && active) { | |
500 | __mem_cgroup_move_lists(pc, false); | |
66e1707b BS |
501 | continue; |
502 | } | |
503 | ||
436c6541 HD |
504 | scan++; |
505 | list_move(&pc->lru, &pc_list); | |
66e1707b BS |
506 | |
507 | if (__isolate_lru_page(page, mode) == 0) { | |
508 | list_move(&page->lru, dst); | |
509 | nr_taken++; | |
510 | } | |
511 | } | |
512 | ||
513 | list_splice(&pc_list, src); | |
072c56c1 | 514 | spin_unlock(&mz->lru_lock); |
66e1707b BS |
515 | |
516 | *scanned = scan; | |
517 | return nr_taken; | |
518 | } | |
519 | ||
8a9f3ccd BS |
520 | /* |
521 | * Charge the memory controller for page usage. | |
522 | * Return | |
523 | * 0 if the charge was successful | |
524 | * < 0 if the cgroup is over its limit | |
525 | */ | |
217bc319 | 526 | static int mem_cgroup_charge_common(struct page *page, struct mm_struct *mm, |
e8589cc1 KH |
527 | gfp_t gfp_mask, enum charge_type ctype, |
528 | struct mem_cgroup *memcg) | |
8a9f3ccd BS |
529 | { |
530 | struct mem_cgroup *mem; | |
9175e031 | 531 | struct page_cgroup *pc; |
66e1707b BS |
532 | unsigned long flags; |
533 | unsigned long nr_retries = MEM_CGROUP_RECLAIM_RETRIES; | |
072c56c1 | 534 | struct mem_cgroup_per_zone *mz; |
8a9f3ccd | 535 | |
4077960e BS |
536 | if (mem_cgroup_subsys.disabled) |
537 | return 0; | |
538 | ||
508b7be0 | 539 | pc = kmem_cache_alloc(page_cgroup_cache, gfp_mask); |
b76734e5 | 540 | if (unlikely(pc == NULL)) |
8a9f3ccd BS |
541 | goto err; |
542 | ||
8a9f3ccd | 543 | /* |
3be91277 HD |
544 | * We always charge the cgroup the mm_struct belongs to. |
545 | * The mm_struct's mem_cgroup changes on task migration if the | |
8a9f3ccd BS |
546 | * thread group leader migrates. It's possible that mm is not |
547 | * set, if so charge the init_mm (happens for pagecache usage). | |
548 | */ | |
69029cd5 | 549 | if (likely(!memcg)) { |
e8589cc1 KH |
550 | rcu_read_lock(); |
551 | mem = mem_cgroup_from_task(rcu_dereference(mm->owner)); | |
552 | /* | |
553 | * For every charge from the cgroup, increment reference count | |
554 | */ | |
555 | css_get(&mem->css); | |
556 | rcu_read_unlock(); | |
557 | } else { | |
558 | mem = memcg; | |
559 | css_get(&memcg->css); | |
560 | } | |
8a9f3ccd | 561 | |
0eea1030 | 562 | while (res_counter_charge(&mem->res, PAGE_SIZE)) { |
3be91277 HD |
563 | if (!(gfp_mask & __GFP_WAIT)) |
564 | goto out; | |
e1a1cd59 BS |
565 | |
566 | if (try_to_free_mem_cgroup_pages(mem, gfp_mask)) | |
66e1707b BS |
567 | continue; |
568 | ||
569 | /* | |
8869b8f6 HD |
570 | * try_to_free_mem_cgroup_pages() might not give us a full |
571 | * picture of reclaim. Some pages are reclaimed and might be | |
572 | * moved to swap cache or just unmapped from the cgroup. | |
573 | * Check the limit again to see if the reclaim reduced the | |
574 | * current usage of the cgroup before giving up | |
575 | */ | |
66e1707b BS |
576 | if (res_counter_check_under_limit(&mem->res)) |
577 | continue; | |
3be91277 HD |
578 | |
579 | if (!nr_retries--) { | |
580 | mem_cgroup_out_of_memory(mem, gfp_mask); | |
581 | goto out; | |
66e1707b | 582 | } |
8a9f3ccd BS |
583 | } |
584 | ||
8a9f3ccd BS |
585 | pc->mem_cgroup = mem; |
586 | pc->page = page; | |
508b7be0 KH |
587 | /* |
588 | * If a page is accounted as a page cache, insert to inactive list. | |
589 | * If anon, insert to active list. | |
590 | */ | |
217bc319 | 591 | if (ctype == MEM_CGROUP_CHARGE_TYPE_CACHE) |
4a56d02e | 592 | pc->flags = PAGE_CGROUP_FLAG_CACHE; |
508b7be0 KH |
593 | else |
594 | pc->flags = PAGE_CGROUP_FLAG_ACTIVE; | |
3be91277 | 595 | |
7e924aaf | 596 | lock_page_cgroup(page); |
b76734e5 | 597 | if (unlikely(page_get_page_cgroup(page))) { |
7e924aaf | 598 | unlock_page_cgroup(page); |
9175e031 KH |
599 | res_counter_uncharge(&mem->res, PAGE_SIZE); |
600 | css_put(&mem->css); | |
b6ac57d5 | 601 | kmem_cache_free(page_cgroup_cache, pc); |
accf163e | 602 | goto done; |
9175e031 | 603 | } |
7e924aaf | 604 | page_assign_page_cgroup(page, pc); |
8a9f3ccd | 605 | |
072c56c1 KH |
606 | mz = page_cgroup_zoneinfo(pc); |
607 | spin_lock_irqsave(&mz->lru_lock, flags); | |
3eae90c3 | 608 | __mem_cgroup_add_list(mz, pc); |
072c56c1 | 609 | spin_unlock_irqrestore(&mz->lru_lock, flags); |
66e1707b | 610 | |
fb59e9f1 | 611 | unlock_page_cgroup(page); |
8a9f3ccd | 612 | done: |
8a9f3ccd | 613 | return 0; |
3be91277 HD |
614 | out: |
615 | css_put(&mem->css); | |
b6ac57d5 | 616 | kmem_cache_free(page_cgroup_cache, pc); |
8a9f3ccd | 617 | err: |
8a9f3ccd BS |
618 | return -ENOMEM; |
619 | } | |
620 | ||
8869b8f6 | 621 | int mem_cgroup_charge(struct page *page, struct mm_struct *mm, gfp_t gfp_mask) |
217bc319 | 622 | { |
69029cd5 KH |
623 | /* |
624 | * If already mapped, we don't have to account. | |
625 | * If page cache, page->mapping has address_space. | |
626 | * But page->mapping may have out-of-use anon_vma pointer, | |
627 | * detecit it by PageAnon() check. newly-mapped-anon's page->mapping | |
628 | * is NULL. | |
629 | */ | |
630 | if (page_mapped(page) || (page->mapping && !PageAnon(page))) | |
631 | return 0; | |
632 | if (unlikely(!mm)) | |
633 | mm = &init_mm; | |
217bc319 | 634 | return mem_cgroup_charge_common(page, mm, gfp_mask, |
e8589cc1 | 635 | MEM_CGROUP_CHARGE_TYPE_MAPPED, NULL); |
217bc319 KH |
636 | } |
637 | ||
e1a1cd59 BS |
638 | int mem_cgroup_cache_charge(struct page *page, struct mm_struct *mm, |
639 | gfp_t gfp_mask) | |
8697d331 | 640 | { |
accf163e KH |
641 | /* |
642 | * Corner case handling. This is called from add_to_page_cache() | |
643 | * in usual. But some FS (shmem) precharges this page before calling it | |
644 | * and call add_to_page_cache() with GFP_NOWAIT. | |
645 | * | |
646 | * For GFP_NOWAIT case, the page may be pre-charged before calling | |
647 | * add_to_page_cache(). (See shmem.c) check it here and avoid to call | |
648 | * charge twice. (It works but has to pay a bit larger cost.) | |
649 | */ | |
650 | if (!(gfp_mask & __GFP_WAIT)) { | |
651 | struct page_cgroup *pc; | |
652 | ||
653 | lock_page_cgroup(page); | |
654 | pc = page_get_page_cgroup(page); | |
655 | if (pc) { | |
656 | VM_BUG_ON(pc->page != page); | |
657 | VM_BUG_ON(!pc->mem_cgroup); | |
658 | unlock_page_cgroup(page); | |
659 | return 0; | |
660 | } | |
661 | unlock_page_cgroup(page); | |
662 | } | |
663 | ||
69029cd5 | 664 | if (unlikely(!mm)) |
8697d331 | 665 | mm = &init_mm; |
accf163e | 666 | |
8869b8f6 | 667 | return mem_cgroup_charge_common(page, mm, gfp_mask, |
e8589cc1 KH |
668 | MEM_CGROUP_CHARGE_TYPE_CACHE, NULL); |
669 | } | |
670 | ||
8a9f3ccd | 671 | /* |
69029cd5 | 672 | * uncharge if !page_mapped(page) |
8a9f3ccd | 673 | */ |
69029cd5 KH |
674 | static void |
675 | __mem_cgroup_uncharge_common(struct page *page, enum charge_type ctype) | |
8a9f3ccd | 676 | { |
8289546e | 677 | struct page_cgroup *pc; |
8a9f3ccd | 678 | struct mem_cgroup *mem; |
072c56c1 | 679 | struct mem_cgroup_per_zone *mz; |
66e1707b | 680 | unsigned long flags; |
8a9f3ccd | 681 | |
4077960e BS |
682 | if (mem_cgroup_subsys.disabled) |
683 | return; | |
684 | ||
8697d331 | 685 | /* |
3c541e14 | 686 | * Check if our page_cgroup is valid |
8697d331 | 687 | */ |
8289546e HD |
688 | lock_page_cgroup(page); |
689 | pc = page_get_page_cgroup(page); | |
b76734e5 | 690 | if (unlikely(!pc)) |
8289546e | 691 | goto unlock; |
8a9f3ccd | 692 | |
b9c565d5 | 693 | VM_BUG_ON(pc->page != page); |
b9c565d5 | 694 | |
69029cd5 KH |
695 | if ((ctype == MEM_CGROUP_CHARGE_TYPE_MAPPED) |
696 | && ((pc->flags & PAGE_CGROUP_FLAG_CACHE) | |
697 | || page_mapped(page))) | |
698 | goto unlock; | |
b9c565d5 | 699 | |
69029cd5 KH |
700 | mz = page_cgroup_zoneinfo(pc); |
701 | spin_lock_irqsave(&mz->lru_lock, flags); | |
702 | __mem_cgroup_remove_list(mz, pc); | |
703 | spin_unlock_irqrestore(&mz->lru_lock, flags); | |
fb59e9f1 | 704 | |
69029cd5 KH |
705 | page_assign_page_cgroup(page, NULL); |
706 | unlock_page_cgroup(page); | |
6d48ff8b | 707 | |
69029cd5 KH |
708 | mem = pc->mem_cgroup; |
709 | res_counter_uncharge(&mem->res, PAGE_SIZE); | |
710 | css_put(&mem->css); | |
6d12e2d8 | 711 | |
69029cd5 KH |
712 | kmem_cache_free(page_cgroup_cache, pc); |
713 | return; | |
8289546e | 714 | unlock: |
3c541e14 BS |
715 | unlock_page_cgroup(page); |
716 | } | |
717 | ||
69029cd5 KH |
718 | void mem_cgroup_uncharge_page(struct page *page) |
719 | { | |
720 | __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_MAPPED); | |
721 | } | |
722 | ||
723 | void mem_cgroup_uncharge_cache_page(struct page *page) | |
724 | { | |
725 | VM_BUG_ON(page_mapped(page)); | |
726 | __mem_cgroup_uncharge_common(page, MEM_CGROUP_CHARGE_TYPE_CACHE); | |
727 | } | |
728 | ||
ae41be37 | 729 | /* |
e8589cc1 | 730 | * Before starting migration, account against new page. |
ae41be37 | 731 | */ |
e8589cc1 | 732 | int mem_cgroup_prepare_migration(struct page *page, struct page *newpage) |
ae41be37 KH |
733 | { |
734 | struct page_cgroup *pc; | |
e8589cc1 KH |
735 | struct mem_cgroup *mem = NULL; |
736 | enum charge_type ctype = MEM_CGROUP_CHARGE_TYPE_MAPPED; | |
737 | int ret = 0; | |
8869b8f6 | 738 | |
4077960e BS |
739 | if (mem_cgroup_subsys.disabled) |
740 | return 0; | |
741 | ||
ae41be37 KH |
742 | lock_page_cgroup(page); |
743 | pc = page_get_page_cgroup(page); | |
e8589cc1 KH |
744 | if (pc) { |
745 | mem = pc->mem_cgroup; | |
746 | css_get(&mem->css); | |
747 | if (pc->flags & PAGE_CGROUP_FLAG_CACHE) | |
748 | ctype = MEM_CGROUP_CHARGE_TYPE_CACHE; | |
749 | } | |
ae41be37 | 750 | unlock_page_cgroup(page); |
e8589cc1 KH |
751 | if (mem) { |
752 | ret = mem_cgroup_charge_common(newpage, NULL, GFP_KERNEL, | |
753 | ctype, mem); | |
754 | css_put(&mem->css); | |
755 | } | |
756 | return ret; | |
ae41be37 | 757 | } |
8869b8f6 | 758 | |
69029cd5 | 759 | /* remove redundant charge if migration failed*/ |
e8589cc1 | 760 | void mem_cgroup_end_migration(struct page *newpage) |
ae41be37 | 761 | { |
69029cd5 KH |
762 | /* |
763 | * At success, page->mapping is not NULL. | |
764 | * special rollback care is necessary when | |
765 | * 1. at migration failure. (newpage->mapping is cleared in this case) | |
766 | * 2. the newpage was moved but not remapped again because the task | |
767 | * exits and the newpage is obsolete. In this case, the new page | |
768 | * may be a swapcache. So, we just call mem_cgroup_uncharge_page() | |
769 | * always for avoiding mess. The page_cgroup will be removed if | |
770 | * unnecessary. File cache pages is still on radix-tree. Don't | |
771 | * care it. | |
772 | */ | |
773 | if (!newpage->mapping) | |
774 | __mem_cgroup_uncharge_common(newpage, | |
775 | MEM_CGROUP_CHARGE_TYPE_FORCE); | |
776 | else if (PageAnon(newpage)) | |
777 | mem_cgroup_uncharge_page(newpage); | |
ae41be37 | 778 | } |
78fb7466 | 779 | |
c9b0ed51 KH |
780 | /* |
781 | * A call to try to shrink memory usage under specified resource controller. | |
782 | * This is typically used for page reclaiming for shmem for reducing side | |
783 | * effect of page allocation from shmem, which is used by some mem_cgroup. | |
784 | */ | |
785 | int mem_cgroup_shrink_usage(struct mm_struct *mm, gfp_t gfp_mask) | |
786 | { | |
787 | struct mem_cgroup *mem; | |
788 | int progress = 0; | |
789 | int retry = MEM_CGROUP_RECLAIM_RETRIES; | |
790 | ||
791 | rcu_read_lock(); | |
792 | mem = mem_cgroup_from_task(rcu_dereference(mm->owner)); | |
793 | css_get(&mem->css); | |
794 | rcu_read_unlock(); | |
795 | ||
796 | do { | |
797 | progress = try_to_free_mem_cgroup_pages(mem, gfp_mask); | |
798 | } while (!progress && --retry); | |
799 | ||
800 | css_put(&mem->css); | |
801 | if (!retry) | |
802 | return -ENOMEM; | |
803 | return 0; | |
804 | } | |
805 | ||
cc847582 KH |
806 | /* |
807 | * This routine traverse page_cgroup in given list and drop them all. | |
cc847582 KH |
808 | * *And* this routine doesn't reclaim page itself, just removes page_cgroup. |
809 | */ | |
810 | #define FORCE_UNCHARGE_BATCH (128) | |
8869b8f6 | 811 | static void mem_cgroup_force_empty_list(struct mem_cgroup *mem, |
072c56c1 KH |
812 | struct mem_cgroup_per_zone *mz, |
813 | int active) | |
cc847582 KH |
814 | { |
815 | struct page_cgroup *pc; | |
816 | struct page *page; | |
9b3c0a07 | 817 | int count = FORCE_UNCHARGE_BATCH; |
cc847582 | 818 | unsigned long flags; |
072c56c1 KH |
819 | struct list_head *list; |
820 | ||
821 | if (active) | |
822 | list = &mz->active_list; | |
823 | else | |
824 | list = &mz->inactive_list; | |
cc847582 | 825 | |
072c56c1 | 826 | spin_lock_irqsave(&mz->lru_lock, flags); |
9b3c0a07 | 827 | while (!list_empty(list)) { |
cc847582 KH |
828 | pc = list_entry(list->prev, struct page_cgroup, lru); |
829 | page = pc->page; | |
9b3c0a07 HT |
830 | get_page(page); |
831 | spin_unlock_irqrestore(&mz->lru_lock, flags); | |
e8589cc1 KH |
832 | /* |
833 | * Check if this page is on LRU. !LRU page can be found | |
834 | * if it's under page migration. | |
835 | */ | |
836 | if (PageLRU(page)) { | |
69029cd5 KH |
837 | __mem_cgroup_uncharge_common(page, |
838 | MEM_CGROUP_CHARGE_TYPE_FORCE); | |
e8589cc1 KH |
839 | put_page(page); |
840 | if (--count <= 0) { | |
841 | count = FORCE_UNCHARGE_BATCH; | |
842 | cond_resched(); | |
843 | } | |
844 | } else | |
9b3c0a07 | 845 | cond_resched(); |
9b3c0a07 | 846 | spin_lock_irqsave(&mz->lru_lock, flags); |
cc847582 | 847 | } |
072c56c1 | 848 | spin_unlock_irqrestore(&mz->lru_lock, flags); |
cc847582 KH |
849 | } |
850 | ||
851 | /* | |
852 | * make mem_cgroup's charge to be 0 if there is no task. | |
853 | * This enables deleting this mem_cgroup. | |
854 | */ | |
d5b69e38 | 855 | static int mem_cgroup_force_empty(struct mem_cgroup *mem) |
cc847582 KH |
856 | { |
857 | int ret = -EBUSY; | |
1ecaab2b | 858 | int node, zid; |
8869b8f6 | 859 | |
4077960e BS |
860 | if (mem_cgroup_subsys.disabled) |
861 | return 0; | |
862 | ||
cc847582 KH |
863 | css_get(&mem->css); |
864 | /* | |
865 | * page reclaim code (kswapd etc..) will move pages between | |
8869b8f6 | 866 | * active_list <-> inactive_list while we don't take a lock. |
cc847582 KH |
867 | * So, we have to do loop here until all lists are empty. |
868 | */ | |
1ecaab2b | 869 | while (mem->res.usage > 0) { |
cc847582 KH |
870 | if (atomic_read(&mem->css.cgroup->count) > 0) |
871 | goto out; | |
1ecaab2b KH |
872 | for_each_node_state(node, N_POSSIBLE) |
873 | for (zid = 0; zid < MAX_NR_ZONES; zid++) { | |
874 | struct mem_cgroup_per_zone *mz; | |
875 | mz = mem_cgroup_zoneinfo(mem, node, zid); | |
876 | /* drop all page_cgroup in active_list */ | |
072c56c1 | 877 | mem_cgroup_force_empty_list(mem, mz, 1); |
1ecaab2b | 878 | /* drop all page_cgroup in inactive_list */ |
072c56c1 | 879 | mem_cgroup_force_empty_list(mem, mz, 0); |
1ecaab2b | 880 | } |
cc847582 KH |
881 | } |
882 | ret = 0; | |
883 | out: | |
884 | css_put(&mem->css); | |
885 | return ret; | |
886 | } | |
887 | ||
2c3daa72 | 888 | static u64 mem_cgroup_read(struct cgroup *cont, struct cftype *cft) |
8cdea7c0 | 889 | { |
2c3daa72 PM |
890 | return res_counter_read_u64(&mem_cgroup_from_cont(cont)->res, |
891 | cft->private); | |
8cdea7c0 BS |
892 | } |
893 | ||
856c13aa PM |
894 | static int mem_cgroup_write(struct cgroup *cont, struct cftype *cft, |
895 | const char *buffer) | |
8cdea7c0 BS |
896 | { |
897 | return res_counter_write(&mem_cgroup_from_cont(cont)->res, | |
856c13aa PM |
898 | cft->private, buffer, |
899 | res_counter_memparse_write_strategy); | |
8cdea7c0 BS |
900 | } |
901 | ||
29f2a4da | 902 | static int mem_cgroup_reset(struct cgroup *cont, unsigned int event) |
c84872e1 PE |
903 | { |
904 | struct mem_cgroup *mem; | |
905 | ||
906 | mem = mem_cgroup_from_cont(cont); | |
29f2a4da PE |
907 | switch (event) { |
908 | case RES_MAX_USAGE: | |
909 | res_counter_reset_max(&mem->res); | |
910 | break; | |
911 | case RES_FAILCNT: | |
912 | res_counter_reset_failcnt(&mem->res); | |
913 | break; | |
914 | } | |
85cc59db | 915 | return 0; |
c84872e1 PE |
916 | } |
917 | ||
85cc59db | 918 | static int mem_force_empty_write(struct cgroup *cont, unsigned int event) |
cc847582 | 919 | { |
85cc59db | 920 | return mem_cgroup_force_empty(mem_cgroup_from_cont(cont)); |
cc847582 KH |
921 | } |
922 | ||
d2ceb9b7 KH |
923 | static const struct mem_cgroup_stat_desc { |
924 | const char *msg; | |
925 | u64 unit; | |
926 | } mem_cgroup_stat_desc[] = { | |
927 | [MEM_CGROUP_STAT_CACHE] = { "cache", PAGE_SIZE, }, | |
928 | [MEM_CGROUP_STAT_RSS] = { "rss", PAGE_SIZE, }, | |
55e462b0 BR |
929 | [MEM_CGROUP_STAT_PGPGIN_COUNT] = {"pgpgin", 1, }, |
930 | [MEM_CGROUP_STAT_PGPGOUT_COUNT] = {"pgpgout", 1, }, | |
d2ceb9b7 KH |
931 | }; |
932 | ||
c64745cf PM |
933 | static int mem_control_stat_show(struct cgroup *cont, struct cftype *cft, |
934 | struct cgroup_map_cb *cb) | |
d2ceb9b7 | 935 | { |
d2ceb9b7 KH |
936 | struct mem_cgroup *mem_cont = mem_cgroup_from_cont(cont); |
937 | struct mem_cgroup_stat *stat = &mem_cont->stat; | |
938 | int i; | |
939 | ||
940 | for (i = 0; i < ARRAY_SIZE(stat->cpustat[0].count); i++) { | |
941 | s64 val; | |
942 | ||
943 | val = mem_cgroup_read_stat(stat, i); | |
944 | val *= mem_cgroup_stat_desc[i].unit; | |
c64745cf | 945 | cb->fill(cb, mem_cgroup_stat_desc[i].msg, val); |
d2ceb9b7 | 946 | } |
6d12e2d8 KH |
947 | /* showing # of active pages */ |
948 | { | |
949 | unsigned long active, inactive; | |
950 | ||
951 | inactive = mem_cgroup_get_all_zonestat(mem_cont, | |
952 | MEM_CGROUP_ZSTAT_INACTIVE); | |
953 | active = mem_cgroup_get_all_zonestat(mem_cont, | |
954 | MEM_CGROUP_ZSTAT_ACTIVE); | |
c64745cf PM |
955 | cb->fill(cb, "active", (active) * PAGE_SIZE); |
956 | cb->fill(cb, "inactive", (inactive) * PAGE_SIZE); | |
6d12e2d8 | 957 | } |
d2ceb9b7 KH |
958 | return 0; |
959 | } | |
960 | ||
8cdea7c0 BS |
961 | static struct cftype mem_cgroup_files[] = { |
962 | { | |
0eea1030 | 963 | .name = "usage_in_bytes", |
8cdea7c0 | 964 | .private = RES_USAGE, |
2c3daa72 | 965 | .read_u64 = mem_cgroup_read, |
8cdea7c0 | 966 | }, |
c84872e1 PE |
967 | { |
968 | .name = "max_usage_in_bytes", | |
969 | .private = RES_MAX_USAGE, | |
29f2a4da | 970 | .trigger = mem_cgroup_reset, |
c84872e1 PE |
971 | .read_u64 = mem_cgroup_read, |
972 | }, | |
8cdea7c0 | 973 | { |
0eea1030 | 974 | .name = "limit_in_bytes", |
8cdea7c0 | 975 | .private = RES_LIMIT, |
856c13aa | 976 | .write_string = mem_cgroup_write, |
2c3daa72 | 977 | .read_u64 = mem_cgroup_read, |
8cdea7c0 BS |
978 | }, |
979 | { | |
980 | .name = "failcnt", | |
981 | .private = RES_FAILCNT, | |
29f2a4da | 982 | .trigger = mem_cgroup_reset, |
2c3daa72 | 983 | .read_u64 = mem_cgroup_read, |
8cdea7c0 | 984 | }, |
cc847582 KH |
985 | { |
986 | .name = "force_empty", | |
85cc59db | 987 | .trigger = mem_force_empty_write, |
cc847582 | 988 | }, |
d2ceb9b7 KH |
989 | { |
990 | .name = "stat", | |
c64745cf | 991 | .read_map = mem_control_stat_show, |
d2ceb9b7 | 992 | }, |
8cdea7c0 BS |
993 | }; |
994 | ||
6d12e2d8 KH |
995 | static int alloc_mem_cgroup_per_zone_info(struct mem_cgroup *mem, int node) |
996 | { | |
997 | struct mem_cgroup_per_node *pn; | |
1ecaab2b | 998 | struct mem_cgroup_per_zone *mz; |
41e3355d | 999 | int zone, tmp = node; |
1ecaab2b KH |
1000 | /* |
1001 | * This routine is called against possible nodes. | |
1002 | * But it's BUG to call kmalloc() against offline node. | |
1003 | * | |
1004 | * TODO: this routine can waste much memory for nodes which will | |
1005 | * never be onlined. It's better to use memory hotplug callback | |
1006 | * function. | |
1007 | */ | |
41e3355d KH |
1008 | if (!node_state(node, N_NORMAL_MEMORY)) |
1009 | tmp = -1; | |
1010 | pn = kmalloc_node(sizeof(*pn), GFP_KERNEL, tmp); | |
6d12e2d8 KH |
1011 | if (!pn) |
1012 | return 1; | |
1ecaab2b | 1013 | |
6d12e2d8 KH |
1014 | mem->info.nodeinfo[node] = pn; |
1015 | memset(pn, 0, sizeof(*pn)); | |
1ecaab2b KH |
1016 | |
1017 | for (zone = 0; zone < MAX_NR_ZONES; zone++) { | |
1018 | mz = &pn->zoneinfo[zone]; | |
1019 | INIT_LIST_HEAD(&mz->active_list); | |
1020 | INIT_LIST_HEAD(&mz->inactive_list); | |
072c56c1 | 1021 | spin_lock_init(&mz->lru_lock); |
1ecaab2b | 1022 | } |
6d12e2d8 KH |
1023 | return 0; |
1024 | } | |
1025 | ||
1ecaab2b KH |
1026 | static void free_mem_cgroup_per_zone_info(struct mem_cgroup *mem, int node) |
1027 | { | |
1028 | kfree(mem->info.nodeinfo[node]); | |
1029 | } | |
1030 | ||
33327948 KH |
1031 | static struct mem_cgroup *mem_cgroup_alloc(void) |
1032 | { | |
1033 | struct mem_cgroup *mem; | |
1034 | ||
1035 | if (sizeof(*mem) < PAGE_SIZE) | |
1036 | mem = kmalloc(sizeof(*mem), GFP_KERNEL); | |
1037 | else | |
1038 | mem = vmalloc(sizeof(*mem)); | |
1039 | ||
1040 | if (mem) | |
1041 | memset(mem, 0, sizeof(*mem)); | |
1042 | return mem; | |
1043 | } | |
1044 | ||
1045 | static void mem_cgroup_free(struct mem_cgroup *mem) | |
1046 | { | |
1047 | if (sizeof(*mem) < PAGE_SIZE) | |
1048 | kfree(mem); | |
1049 | else | |
1050 | vfree(mem); | |
1051 | } | |
1052 | ||
1053 | ||
8cdea7c0 BS |
1054 | static struct cgroup_subsys_state * |
1055 | mem_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cont) | |
1056 | { | |
1057 | struct mem_cgroup *mem; | |
6d12e2d8 | 1058 | int node; |
8cdea7c0 | 1059 | |
b6ac57d5 | 1060 | if (unlikely((cont->parent) == NULL)) { |
78fb7466 | 1061 | mem = &init_mem_cgroup; |
b6ac57d5 BS |
1062 | page_cgroup_cache = KMEM_CACHE(page_cgroup, SLAB_PANIC); |
1063 | } else { | |
33327948 KH |
1064 | mem = mem_cgroup_alloc(); |
1065 | if (!mem) | |
1066 | return ERR_PTR(-ENOMEM); | |
b6ac57d5 | 1067 | } |
78fb7466 | 1068 | |
8cdea7c0 | 1069 | res_counter_init(&mem->res); |
1ecaab2b | 1070 | |
6d12e2d8 KH |
1071 | for_each_node_state(node, N_POSSIBLE) |
1072 | if (alloc_mem_cgroup_per_zone_info(mem, node)) | |
1073 | goto free_out; | |
1074 | ||
8cdea7c0 | 1075 | return &mem->css; |
6d12e2d8 KH |
1076 | free_out: |
1077 | for_each_node_state(node, N_POSSIBLE) | |
1ecaab2b | 1078 | free_mem_cgroup_per_zone_info(mem, node); |
6d12e2d8 | 1079 | if (cont->parent != NULL) |
33327948 | 1080 | mem_cgroup_free(mem); |
2dda81ca | 1081 | return ERR_PTR(-ENOMEM); |
8cdea7c0 BS |
1082 | } |
1083 | ||
df878fb0 KH |
1084 | static void mem_cgroup_pre_destroy(struct cgroup_subsys *ss, |
1085 | struct cgroup *cont) | |
1086 | { | |
1087 | struct mem_cgroup *mem = mem_cgroup_from_cont(cont); | |
1088 | mem_cgroup_force_empty(mem); | |
1089 | } | |
1090 | ||
8cdea7c0 BS |
1091 | static void mem_cgroup_destroy(struct cgroup_subsys *ss, |
1092 | struct cgroup *cont) | |
1093 | { | |
6d12e2d8 KH |
1094 | int node; |
1095 | struct mem_cgroup *mem = mem_cgroup_from_cont(cont); | |
1096 | ||
1097 | for_each_node_state(node, N_POSSIBLE) | |
1ecaab2b | 1098 | free_mem_cgroup_per_zone_info(mem, node); |
6d12e2d8 | 1099 | |
33327948 | 1100 | mem_cgroup_free(mem_cgroup_from_cont(cont)); |
8cdea7c0 BS |
1101 | } |
1102 | ||
1103 | static int mem_cgroup_populate(struct cgroup_subsys *ss, | |
1104 | struct cgroup *cont) | |
1105 | { | |
4077960e BS |
1106 | if (mem_cgroup_subsys.disabled) |
1107 | return 0; | |
8cdea7c0 BS |
1108 | return cgroup_add_files(cont, ss, mem_cgroup_files, |
1109 | ARRAY_SIZE(mem_cgroup_files)); | |
1110 | } | |
1111 | ||
67e465a7 BS |
1112 | static void mem_cgroup_move_task(struct cgroup_subsys *ss, |
1113 | struct cgroup *cont, | |
1114 | struct cgroup *old_cont, | |
1115 | struct task_struct *p) | |
1116 | { | |
1117 | struct mm_struct *mm; | |
1118 | struct mem_cgroup *mem, *old_mem; | |
1119 | ||
4077960e BS |
1120 | if (mem_cgroup_subsys.disabled) |
1121 | return; | |
1122 | ||
67e465a7 BS |
1123 | mm = get_task_mm(p); |
1124 | if (mm == NULL) | |
1125 | return; | |
1126 | ||
1127 | mem = mem_cgroup_from_cont(cont); | |
1128 | old_mem = mem_cgroup_from_cont(old_cont); | |
1129 | ||
1130 | if (mem == old_mem) | |
1131 | goto out; | |
1132 | ||
1133 | /* | |
1134 | * Only thread group leaders are allowed to migrate, the mm_struct is | |
1135 | * in effect owned by the leader | |
1136 | */ | |
52ea27eb | 1137 | if (!thread_group_leader(p)) |
67e465a7 BS |
1138 | goto out; |
1139 | ||
67e465a7 BS |
1140 | out: |
1141 | mmput(mm); | |
67e465a7 BS |
1142 | } |
1143 | ||
8cdea7c0 BS |
1144 | struct cgroup_subsys mem_cgroup_subsys = { |
1145 | .name = "memory", | |
1146 | .subsys_id = mem_cgroup_subsys_id, | |
1147 | .create = mem_cgroup_create, | |
df878fb0 | 1148 | .pre_destroy = mem_cgroup_pre_destroy, |
8cdea7c0 BS |
1149 | .destroy = mem_cgroup_destroy, |
1150 | .populate = mem_cgroup_populate, | |
67e465a7 | 1151 | .attach = mem_cgroup_move_task, |
6d12e2d8 | 1152 | .early_init = 0, |
8cdea7c0 | 1153 | }; |