]>
Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
a38e4082 DC |
2 | /* |
3 | * Copyright (c) 2013 Red Hat, Inc. and Parallels Inc. All rights reserved. | |
4 | * Authors: David Chinner and Glauber Costa | |
5 | * | |
6 | * Generic LRU infrastructure | |
7 | */ | |
8 | #include <linux/kernel.h> | |
9 | #include <linux/module.h> | |
3b1d58a4 | 10 | #include <linux/mm.h> |
a38e4082 | 11 | #include <linux/list_lru.h> |
5ca302c8 | 12 | #include <linux/slab.h> |
c0a5b560 | 13 | #include <linux/mutex.h> |
60d3fd32 | 14 | #include <linux/memcontrol.h> |
4d96ba35 | 15 | #include "slab.h" |
c0a5b560 | 16 | |
84c07d11 | 17 | #ifdef CONFIG_MEMCG_KMEM |
3eef1127 | 18 | static LIST_HEAD(memcg_list_lrus); |
c0a5b560 VD |
19 | static DEFINE_MUTEX(list_lrus_mutex); |
20 | ||
3eef1127 MS |
21 | static inline bool list_lru_memcg_aware(struct list_lru *lru) |
22 | { | |
23 | return lru->memcg_aware; | |
24 | } | |
25 | ||
c0a5b560 VD |
26 | static void list_lru_register(struct list_lru *lru) |
27 | { | |
3eef1127 MS |
28 | if (!list_lru_memcg_aware(lru)) |
29 | return; | |
30 | ||
c0a5b560 | 31 | mutex_lock(&list_lrus_mutex); |
3eef1127 | 32 | list_add(&lru->list, &memcg_list_lrus); |
c0a5b560 VD |
33 | mutex_unlock(&list_lrus_mutex); |
34 | } | |
35 | ||
36 | static void list_lru_unregister(struct list_lru *lru) | |
37 | { | |
3eef1127 MS |
38 | if (!list_lru_memcg_aware(lru)) |
39 | return; | |
40 | ||
c0a5b560 VD |
41 | mutex_lock(&list_lrus_mutex); |
42 | list_del(&lru->list); | |
43 | mutex_unlock(&list_lrus_mutex); | |
44 | } | |
c0a5b560 | 45 | |
fae91d6d KT |
46 | static int lru_shrinker_id(struct list_lru *lru) |
47 | { | |
48 | return lru->shrinker_id; | |
49 | } | |
50 | ||
60d3fd32 VD |
51 | static inline struct list_lru_one * |
52 | list_lru_from_memcg_idx(struct list_lru_node *nlru, int idx) | |
53 | { | |
0c7c1bed | 54 | struct list_lru_memcg *memcg_lrus; |
60d3fd32 | 55 | /* |
0c7c1bed KT |
56 | * Either lock or RCU protects the array of per cgroup lists |
57 | * from relocation (see memcg_update_list_lru_node). | |
60d3fd32 | 58 | */ |
0c7c1bed KT |
59 | memcg_lrus = rcu_dereference_check(nlru->memcg_lrus, |
60 | lockdep_is_held(&nlru->lock)); | |
61 | if (memcg_lrus && idx >= 0) | |
62 | return memcg_lrus->lru[idx]; | |
60d3fd32 VD |
63 | return &nlru->lru; |
64 | } | |
65 | ||
66 | static inline struct list_lru_one * | |
44bd4a47 KT |
67 | list_lru_from_kmem(struct list_lru_node *nlru, void *ptr, |
68 | struct mem_cgroup **memcg_ptr) | |
60d3fd32 | 69 | { |
44bd4a47 KT |
70 | struct list_lru_one *l = &nlru->lru; |
71 | struct mem_cgroup *memcg = NULL; | |
60d3fd32 VD |
72 | |
73 | if (!nlru->memcg_lrus) | |
44bd4a47 | 74 | goto out; |
60d3fd32 | 75 | |
4f103c63 | 76 | memcg = mem_cgroup_from_obj(ptr); |
60d3fd32 | 77 | if (!memcg) |
44bd4a47 | 78 | goto out; |
60d3fd32 | 79 | |
44bd4a47 KT |
80 | l = list_lru_from_memcg_idx(nlru, memcg_cache_id(memcg)); |
81 | out: | |
82 | if (memcg_ptr) | |
83 | *memcg_ptr = memcg; | |
84 | return l; | |
60d3fd32 VD |
85 | } |
86 | #else | |
e0295238 KT |
87 | static void list_lru_register(struct list_lru *lru) |
88 | { | |
89 | } | |
90 | ||
91 | static void list_lru_unregister(struct list_lru *lru) | |
92 | { | |
93 | } | |
94 | ||
fae91d6d KT |
95 | static int lru_shrinker_id(struct list_lru *lru) |
96 | { | |
97 | return -1; | |
98 | } | |
99 | ||
60d3fd32 VD |
100 | static inline bool list_lru_memcg_aware(struct list_lru *lru) |
101 | { | |
102 | return false; | |
103 | } | |
104 | ||
105 | static inline struct list_lru_one * | |
106 | list_lru_from_memcg_idx(struct list_lru_node *nlru, int idx) | |
107 | { | |
108 | return &nlru->lru; | |
109 | } | |
110 | ||
111 | static inline struct list_lru_one * | |
44bd4a47 KT |
112 | list_lru_from_kmem(struct list_lru_node *nlru, void *ptr, |
113 | struct mem_cgroup **memcg_ptr) | |
60d3fd32 | 114 | { |
44bd4a47 KT |
115 | if (memcg_ptr) |
116 | *memcg_ptr = NULL; | |
60d3fd32 VD |
117 | return &nlru->lru; |
118 | } | |
84c07d11 | 119 | #endif /* CONFIG_MEMCG_KMEM */ |
60d3fd32 | 120 | |
a38e4082 DC |
121 | bool list_lru_add(struct list_lru *lru, struct list_head *item) |
122 | { | |
3b1d58a4 DC |
123 | int nid = page_to_nid(virt_to_page(item)); |
124 | struct list_lru_node *nlru = &lru->node[nid]; | |
fae91d6d | 125 | struct mem_cgroup *memcg; |
60d3fd32 | 126 | struct list_lru_one *l; |
3b1d58a4 DC |
127 | |
128 | spin_lock(&nlru->lock); | |
a38e4082 | 129 | if (list_empty(item)) { |
fae91d6d | 130 | l = list_lru_from_kmem(nlru, item, &memcg); |
60d3fd32 | 131 | list_add_tail(item, &l->list); |
fae91d6d KT |
132 | /* Set shrinker bit if the first element was added */ |
133 | if (!l->nr_items++) | |
2bfd3637 YS |
134 | set_shrinker_bit(memcg, nid, |
135 | lru_shrinker_id(lru)); | |
2c80cd57 | 136 | nlru->nr_items++; |
3b1d58a4 | 137 | spin_unlock(&nlru->lock); |
a38e4082 DC |
138 | return true; |
139 | } | |
3b1d58a4 | 140 | spin_unlock(&nlru->lock); |
a38e4082 DC |
141 | return false; |
142 | } | |
143 | EXPORT_SYMBOL_GPL(list_lru_add); | |
144 | ||
145 | bool list_lru_del(struct list_lru *lru, struct list_head *item) | |
146 | { | |
3b1d58a4 DC |
147 | int nid = page_to_nid(virt_to_page(item)); |
148 | struct list_lru_node *nlru = &lru->node[nid]; | |
60d3fd32 | 149 | struct list_lru_one *l; |
3b1d58a4 DC |
150 | |
151 | spin_lock(&nlru->lock); | |
a38e4082 | 152 | if (!list_empty(item)) { |
44bd4a47 | 153 | l = list_lru_from_kmem(nlru, item, NULL); |
a38e4082 | 154 | list_del_init(item); |
60d3fd32 | 155 | l->nr_items--; |
2c80cd57 | 156 | nlru->nr_items--; |
3b1d58a4 | 157 | spin_unlock(&nlru->lock); |
a38e4082 DC |
158 | return true; |
159 | } | |
3b1d58a4 | 160 | spin_unlock(&nlru->lock); |
a38e4082 DC |
161 | return false; |
162 | } | |
163 | EXPORT_SYMBOL_GPL(list_lru_del); | |
164 | ||
3f97b163 VD |
165 | void list_lru_isolate(struct list_lru_one *list, struct list_head *item) |
166 | { | |
167 | list_del_init(item); | |
168 | list->nr_items--; | |
169 | } | |
170 | EXPORT_SYMBOL_GPL(list_lru_isolate); | |
171 | ||
172 | void list_lru_isolate_move(struct list_lru_one *list, struct list_head *item, | |
173 | struct list_head *head) | |
174 | { | |
175 | list_move(item, head); | |
176 | list->nr_items--; | |
177 | } | |
178 | EXPORT_SYMBOL_GPL(list_lru_isolate_move); | |
179 | ||
930eaac5 AM |
180 | unsigned long list_lru_count_one(struct list_lru *lru, |
181 | int nid, struct mem_cgroup *memcg) | |
a38e4082 | 182 | { |
6a4f496f | 183 | struct list_lru_node *nlru = &lru->node[nid]; |
60d3fd32 | 184 | struct list_lru_one *l; |
41d17431 | 185 | long count; |
3b1d58a4 | 186 | |
0c7c1bed | 187 | rcu_read_lock(); |
930eaac5 | 188 | l = list_lru_from_memcg_idx(nlru, memcg_cache_id(memcg)); |
a1f45935 | 189 | count = READ_ONCE(l->nr_items); |
0c7c1bed | 190 | rcu_read_unlock(); |
3b1d58a4 | 191 | |
41d17431 MS |
192 | if (unlikely(count < 0)) |
193 | count = 0; | |
194 | ||
3b1d58a4 DC |
195 | return count; |
196 | } | |
60d3fd32 VD |
197 | EXPORT_SYMBOL_GPL(list_lru_count_one); |
198 | ||
199 | unsigned long list_lru_count_node(struct list_lru *lru, int nid) | |
200 | { | |
2c80cd57 | 201 | struct list_lru_node *nlru; |
60d3fd32 | 202 | |
2c80cd57 ST |
203 | nlru = &lru->node[nid]; |
204 | return nlru->nr_items; | |
60d3fd32 | 205 | } |
6a4f496f | 206 | EXPORT_SYMBOL_GPL(list_lru_count_node); |
3b1d58a4 | 207 | |
60d3fd32 | 208 | static unsigned long |
6e018968 | 209 | __list_lru_walk_one(struct list_lru_node *nlru, int memcg_idx, |
60d3fd32 VD |
210 | list_lru_walk_cb isolate, void *cb_arg, |
211 | unsigned long *nr_to_walk) | |
3b1d58a4 DC |
212 | { |
213 | ||
60d3fd32 | 214 | struct list_lru_one *l; |
a38e4082 | 215 | struct list_head *item, *n; |
3b1d58a4 | 216 | unsigned long isolated = 0; |
a38e4082 | 217 | |
60d3fd32 | 218 | l = list_lru_from_memcg_idx(nlru, memcg_idx); |
a38e4082 | 219 | restart: |
60d3fd32 | 220 | list_for_each_safe(item, n, &l->list) { |
a38e4082 | 221 | enum lru_status ret; |
5cedf721 DC |
222 | |
223 | /* | |
224 | * decrement nr_to_walk first so that we don't livelock if we | |
3dc5f032 | 225 | * get stuck on large numbers of LRU_RETRY items |
5cedf721 | 226 | */ |
c56b097a | 227 | if (!*nr_to_walk) |
5cedf721 | 228 | break; |
c56b097a | 229 | --*nr_to_walk; |
5cedf721 | 230 | |
3f97b163 | 231 | ret = isolate(item, l, &nlru->lock, cb_arg); |
a38e4082 | 232 | switch (ret) { |
449dd698 JW |
233 | case LRU_REMOVED_RETRY: |
234 | assert_spin_locked(&nlru->lock); | |
e4a9bc58 | 235 | fallthrough; |
a38e4082 | 236 | case LRU_REMOVED: |
3b1d58a4 | 237 | isolated++; |
2c80cd57 | 238 | nlru->nr_items--; |
449dd698 JW |
239 | /* |
240 | * If the lru lock has been dropped, our list | |
241 | * traversal is now invalid and so we have to | |
242 | * restart from scratch. | |
243 | */ | |
244 | if (ret == LRU_REMOVED_RETRY) | |
245 | goto restart; | |
a38e4082 DC |
246 | break; |
247 | case LRU_ROTATE: | |
60d3fd32 | 248 | list_move_tail(item, &l->list); |
a38e4082 DC |
249 | break; |
250 | case LRU_SKIP: | |
251 | break; | |
252 | case LRU_RETRY: | |
5cedf721 DC |
253 | /* |
254 | * The lru lock has been dropped, our list traversal is | |
255 | * now invalid and so we have to restart from scratch. | |
256 | */ | |
449dd698 | 257 | assert_spin_locked(&nlru->lock); |
a38e4082 DC |
258 | goto restart; |
259 | default: | |
260 | BUG(); | |
261 | } | |
a38e4082 | 262 | } |
3b1d58a4 DC |
263 | return isolated; |
264 | } | |
60d3fd32 VD |
265 | |
266 | unsigned long | |
267 | list_lru_walk_one(struct list_lru *lru, int nid, struct mem_cgroup *memcg, | |
268 | list_lru_walk_cb isolate, void *cb_arg, | |
269 | unsigned long *nr_to_walk) | |
270 | { | |
6cfe57a9 SAS |
271 | struct list_lru_node *nlru = &lru->node[nid]; |
272 | unsigned long ret; | |
273 | ||
274 | spin_lock(&nlru->lock); | |
6e018968 SAS |
275 | ret = __list_lru_walk_one(nlru, memcg_cache_id(memcg), isolate, cb_arg, |
276 | nr_to_walk); | |
6cfe57a9 SAS |
277 | spin_unlock(&nlru->lock); |
278 | return ret; | |
60d3fd32 VD |
279 | } |
280 | EXPORT_SYMBOL_GPL(list_lru_walk_one); | |
281 | ||
6b51e881 SAS |
282 | unsigned long |
283 | list_lru_walk_one_irq(struct list_lru *lru, int nid, struct mem_cgroup *memcg, | |
284 | list_lru_walk_cb isolate, void *cb_arg, | |
285 | unsigned long *nr_to_walk) | |
286 | { | |
287 | struct list_lru_node *nlru = &lru->node[nid]; | |
288 | unsigned long ret; | |
289 | ||
290 | spin_lock_irq(&nlru->lock); | |
291 | ret = __list_lru_walk_one(nlru, memcg_cache_id(memcg), isolate, cb_arg, | |
292 | nr_to_walk); | |
293 | spin_unlock_irq(&nlru->lock); | |
294 | return ret; | |
295 | } | |
296 | ||
60d3fd32 VD |
297 | unsigned long list_lru_walk_node(struct list_lru *lru, int nid, |
298 | list_lru_walk_cb isolate, void *cb_arg, | |
299 | unsigned long *nr_to_walk) | |
300 | { | |
301 | long isolated = 0; | |
302 | int memcg_idx; | |
303 | ||
87a5ffc1 SAS |
304 | isolated += list_lru_walk_one(lru, nid, NULL, isolate, cb_arg, |
305 | nr_to_walk); | |
60d3fd32 VD |
306 | if (*nr_to_walk > 0 && list_lru_memcg_aware(lru)) { |
307 | for_each_memcg_cache_index(memcg_idx) { | |
6cfe57a9 SAS |
308 | struct list_lru_node *nlru = &lru->node[nid]; |
309 | ||
310 | spin_lock(&nlru->lock); | |
6e018968 SAS |
311 | isolated += __list_lru_walk_one(nlru, memcg_idx, |
312 | isolate, cb_arg, | |
313 | nr_to_walk); | |
6cfe57a9 SAS |
314 | spin_unlock(&nlru->lock); |
315 | ||
60d3fd32 VD |
316 | if (*nr_to_walk <= 0) |
317 | break; | |
318 | } | |
319 | } | |
320 | return isolated; | |
321 | } | |
3b1d58a4 DC |
322 | EXPORT_SYMBOL_GPL(list_lru_walk_node); |
323 | ||
60d3fd32 VD |
324 | static void init_one_lru(struct list_lru_one *l) |
325 | { | |
326 | INIT_LIST_HEAD(&l->list); | |
327 | l->nr_items = 0; | |
328 | } | |
329 | ||
84c07d11 | 330 | #ifdef CONFIG_MEMCG_KMEM |
60d3fd32 VD |
331 | static void __memcg_destroy_list_lru_node(struct list_lru_memcg *memcg_lrus, |
332 | int begin, int end) | |
333 | { | |
334 | int i; | |
335 | ||
336 | for (i = begin; i < end; i++) | |
337 | kfree(memcg_lrus->lru[i]); | |
338 | } | |
339 | ||
340 | static int __memcg_init_list_lru_node(struct list_lru_memcg *memcg_lrus, | |
341 | int begin, int end) | |
342 | { | |
343 | int i; | |
344 | ||
345 | for (i = begin; i < end; i++) { | |
346 | struct list_lru_one *l; | |
347 | ||
348 | l = kmalloc(sizeof(struct list_lru_one), GFP_KERNEL); | |
349 | if (!l) | |
350 | goto fail; | |
351 | ||
352 | init_one_lru(l); | |
353 | memcg_lrus->lru[i] = l; | |
354 | } | |
355 | return 0; | |
356 | fail: | |
3510955b | 357 | __memcg_destroy_list_lru_node(memcg_lrus, begin, i); |
60d3fd32 VD |
358 | return -ENOMEM; |
359 | } | |
360 | ||
361 | static int memcg_init_list_lru_node(struct list_lru_node *nlru) | |
362 | { | |
0c7c1bed | 363 | struct list_lru_memcg *memcg_lrus; |
60d3fd32 VD |
364 | int size = memcg_nr_cache_ids; |
365 | ||
16f6bf26 | 366 | memcg_lrus = kvmalloc(struct_size(memcg_lrus, lru, size), GFP_KERNEL); |
0c7c1bed | 367 | if (!memcg_lrus) |
60d3fd32 VD |
368 | return -ENOMEM; |
369 | ||
0c7c1bed KT |
370 | if (__memcg_init_list_lru_node(memcg_lrus, 0, size)) { |
371 | kvfree(memcg_lrus); | |
60d3fd32 VD |
372 | return -ENOMEM; |
373 | } | |
0c7c1bed | 374 | RCU_INIT_POINTER(nlru->memcg_lrus, memcg_lrus); |
60d3fd32 VD |
375 | |
376 | return 0; | |
377 | } | |
378 | ||
379 | static void memcg_destroy_list_lru_node(struct list_lru_node *nlru) | |
380 | { | |
0c7c1bed KT |
381 | struct list_lru_memcg *memcg_lrus; |
382 | /* | |
383 | * This is called when shrinker has already been unregistered, | |
a7b7e1df | 384 | * and nobody can use it. So, there is no need to use kvfree_rcu(). |
0c7c1bed KT |
385 | */ |
386 | memcg_lrus = rcu_dereference_protected(nlru->memcg_lrus, true); | |
387 | __memcg_destroy_list_lru_node(memcg_lrus, 0, memcg_nr_cache_ids); | |
388 | kvfree(memcg_lrus); | |
389 | } | |
390 | ||
60d3fd32 VD |
391 | static int memcg_update_list_lru_node(struct list_lru_node *nlru, |
392 | int old_size, int new_size) | |
393 | { | |
394 | struct list_lru_memcg *old, *new; | |
395 | ||
396 | BUG_ON(old_size > new_size); | |
397 | ||
0c7c1bed KT |
398 | old = rcu_dereference_protected(nlru->memcg_lrus, |
399 | lockdep_is_held(&list_lrus_mutex)); | |
16f6bf26 | 400 | new = kvmalloc(struct_size(new, lru, new_size), GFP_KERNEL); |
60d3fd32 VD |
401 | if (!new) |
402 | return -ENOMEM; | |
403 | ||
404 | if (__memcg_init_list_lru_node(new, old_size, new_size)) { | |
f80c7dab | 405 | kvfree(new); |
60d3fd32 VD |
406 | return -ENOMEM; |
407 | } | |
408 | ||
16f6bf26 | 409 | memcpy(&new->lru, &old->lru, flex_array_size(new, lru, old_size)); |
0c7c1bed | 410 | rcu_assign_pointer(nlru->memcg_lrus, new); |
a7b7e1df | 411 | kvfree_rcu(old, rcu); |
60d3fd32 VD |
412 | return 0; |
413 | } | |
414 | ||
415 | static void memcg_cancel_update_list_lru_node(struct list_lru_node *nlru, | |
416 | int old_size, int new_size) | |
417 | { | |
0c7c1bed KT |
418 | struct list_lru_memcg *memcg_lrus; |
419 | ||
420 | memcg_lrus = rcu_dereference_protected(nlru->memcg_lrus, | |
421 | lockdep_is_held(&list_lrus_mutex)); | |
60d3fd32 VD |
422 | /* do not bother shrinking the array back to the old size, because we |
423 | * cannot handle allocation failures here */ | |
0c7c1bed | 424 | __memcg_destroy_list_lru_node(memcg_lrus, old_size, new_size); |
60d3fd32 VD |
425 | } |
426 | ||
427 | static int memcg_init_list_lru(struct list_lru *lru, bool memcg_aware) | |
428 | { | |
429 | int i; | |
430 | ||
3e858996 JS |
431 | lru->memcg_aware = memcg_aware; |
432 | ||
145949a1 R |
433 | if (!memcg_aware) |
434 | return 0; | |
435 | ||
436 | for_each_node(i) { | |
437 | if (memcg_init_list_lru_node(&lru->node[i])) | |
60d3fd32 VD |
438 | goto fail; |
439 | } | |
440 | return 0; | |
441 | fail: | |
145949a1 R |
442 | for (i = i - 1; i >= 0; i--) { |
443 | if (!lru->node[i].memcg_lrus) | |
444 | continue; | |
60d3fd32 | 445 | memcg_destroy_list_lru_node(&lru->node[i]); |
145949a1 | 446 | } |
60d3fd32 VD |
447 | return -ENOMEM; |
448 | } | |
449 | ||
450 | static void memcg_destroy_list_lru(struct list_lru *lru) | |
451 | { | |
452 | int i; | |
453 | ||
454 | if (!list_lru_memcg_aware(lru)) | |
455 | return; | |
456 | ||
145949a1 | 457 | for_each_node(i) |
60d3fd32 VD |
458 | memcg_destroy_list_lru_node(&lru->node[i]); |
459 | } | |
460 | ||
461 | static int memcg_update_list_lru(struct list_lru *lru, | |
462 | int old_size, int new_size) | |
463 | { | |
464 | int i; | |
465 | ||
145949a1 | 466 | for_each_node(i) { |
60d3fd32 VD |
467 | if (memcg_update_list_lru_node(&lru->node[i], |
468 | old_size, new_size)) | |
469 | goto fail; | |
470 | } | |
471 | return 0; | |
472 | fail: | |
145949a1 R |
473 | for (i = i - 1; i >= 0; i--) { |
474 | if (!lru->node[i].memcg_lrus) | |
475 | continue; | |
476 | ||
60d3fd32 VD |
477 | memcg_cancel_update_list_lru_node(&lru->node[i], |
478 | old_size, new_size); | |
145949a1 | 479 | } |
60d3fd32 VD |
480 | return -ENOMEM; |
481 | } | |
482 | ||
483 | static void memcg_cancel_update_list_lru(struct list_lru *lru, | |
484 | int old_size, int new_size) | |
485 | { | |
486 | int i; | |
487 | ||
145949a1 | 488 | for_each_node(i) |
60d3fd32 VD |
489 | memcg_cancel_update_list_lru_node(&lru->node[i], |
490 | old_size, new_size); | |
491 | } | |
492 | ||
493 | int memcg_update_all_list_lrus(int new_size) | |
494 | { | |
495 | int ret = 0; | |
496 | struct list_lru *lru; | |
497 | int old_size = memcg_nr_cache_ids; | |
498 | ||
499 | mutex_lock(&list_lrus_mutex); | |
3eef1127 | 500 | list_for_each_entry(lru, &memcg_list_lrus, list) { |
60d3fd32 VD |
501 | ret = memcg_update_list_lru(lru, old_size, new_size); |
502 | if (ret) | |
503 | goto fail; | |
504 | } | |
505 | out: | |
506 | mutex_unlock(&list_lrus_mutex); | |
507 | return ret; | |
508 | fail: | |
3eef1127 | 509 | list_for_each_entry_continue_reverse(lru, &memcg_list_lrus, list) |
60d3fd32 VD |
510 | memcg_cancel_update_list_lru(lru, old_size, new_size); |
511 | goto out; | |
512 | } | |
2788cf0c | 513 | |
3b82c4dc | 514 | static void memcg_drain_list_lru_node(struct list_lru *lru, int nid, |
9bec5c35 | 515 | int src_idx, struct mem_cgroup *dst_memcg) |
2788cf0c | 516 | { |
3b82c4dc | 517 | struct list_lru_node *nlru = &lru->node[nid]; |
9bec5c35 | 518 | int dst_idx = dst_memcg->kmemcg_id; |
2788cf0c VD |
519 | struct list_lru_one *src, *dst; |
520 | ||
521 | /* | |
522 | * Since list_lru_{add,del} may be called under an IRQ-safe lock, | |
523 | * we have to use IRQ-safe primitives here to avoid deadlock. | |
524 | */ | |
525 | spin_lock_irq(&nlru->lock); | |
526 | ||
527 | src = list_lru_from_memcg_idx(nlru, src_idx); | |
528 | dst = list_lru_from_memcg_idx(nlru, dst_idx); | |
529 | ||
530 | list_splice_init(&src->list, &dst->list); | |
8199be00 YS |
531 | |
532 | if (src->nr_items) { | |
533 | dst->nr_items += src->nr_items; | |
2bfd3637 | 534 | set_shrinker_bit(dst_memcg, nid, lru_shrinker_id(lru)); |
8199be00 YS |
535 | src->nr_items = 0; |
536 | } | |
2788cf0c VD |
537 | |
538 | spin_unlock_irq(&nlru->lock); | |
539 | } | |
540 | ||
541 | static void memcg_drain_list_lru(struct list_lru *lru, | |
9bec5c35 | 542 | int src_idx, struct mem_cgroup *dst_memcg) |
2788cf0c VD |
543 | { |
544 | int i; | |
545 | ||
145949a1 | 546 | for_each_node(i) |
3b82c4dc | 547 | memcg_drain_list_lru_node(lru, i, src_idx, dst_memcg); |
2788cf0c VD |
548 | } |
549 | ||
9bec5c35 | 550 | void memcg_drain_all_list_lrus(int src_idx, struct mem_cgroup *dst_memcg) |
2788cf0c VD |
551 | { |
552 | struct list_lru *lru; | |
553 | ||
554 | mutex_lock(&list_lrus_mutex); | |
3eef1127 | 555 | list_for_each_entry(lru, &memcg_list_lrus, list) |
9bec5c35 | 556 | memcg_drain_list_lru(lru, src_idx, dst_memcg); |
2788cf0c VD |
557 | mutex_unlock(&list_lrus_mutex); |
558 | } | |
60d3fd32 VD |
559 | #else |
560 | static int memcg_init_list_lru(struct list_lru *lru, bool memcg_aware) | |
561 | { | |
562 | return 0; | |
563 | } | |
564 | ||
565 | static void memcg_destroy_list_lru(struct list_lru *lru) | |
566 | { | |
567 | } | |
84c07d11 | 568 | #endif /* CONFIG_MEMCG_KMEM */ |
60d3fd32 VD |
569 | |
570 | int __list_lru_init(struct list_lru *lru, bool memcg_aware, | |
c92e8e10 | 571 | struct lock_class_key *key, struct shrinker *shrinker) |
a38e4082 | 572 | { |
3b1d58a4 | 573 | int i; |
60d3fd32 VD |
574 | int err = -ENOMEM; |
575 | ||
c92e8e10 KT |
576 | #ifdef CONFIG_MEMCG_KMEM |
577 | if (shrinker) | |
578 | lru->shrinker_id = shrinker->id; | |
579 | else | |
580 | lru->shrinker_id = -1; | |
581 | #endif | |
60d3fd32 | 582 | memcg_get_cache_ids(); |
5ca302c8 | 583 | |
b9726c26 | 584 | lru->node = kcalloc(nr_node_ids, sizeof(*lru->node), GFP_KERNEL); |
5ca302c8 | 585 | if (!lru->node) |
60d3fd32 | 586 | goto out; |
a38e4082 | 587 | |
145949a1 | 588 | for_each_node(i) { |
3b1d58a4 | 589 | spin_lock_init(&lru->node[i].lock); |
449dd698 JW |
590 | if (key) |
591 | lockdep_set_class(&lru->node[i].lock, key); | |
60d3fd32 VD |
592 | init_one_lru(&lru->node[i].lru); |
593 | } | |
594 | ||
595 | err = memcg_init_list_lru(lru, memcg_aware); | |
596 | if (err) { | |
597 | kfree(lru->node); | |
1bc11d70 AP |
598 | /* Do this so a list_lru_destroy() doesn't crash: */ |
599 | lru->node = NULL; | |
60d3fd32 | 600 | goto out; |
3b1d58a4 | 601 | } |
60d3fd32 | 602 | |
c0a5b560 | 603 | list_lru_register(lru); |
60d3fd32 VD |
604 | out: |
605 | memcg_put_cache_ids(); | |
606 | return err; | |
a38e4082 | 607 | } |
60d3fd32 | 608 | EXPORT_SYMBOL_GPL(__list_lru_init); |
5ca302c8 GC |
609 | |
610 | void list_lru_destroy(struct list_lru *lru) | |
611 | { | |
c0a5b560 VD |
612 | /* Already destroyed or not yet initialized? */ |
613 | if (!lru->node) | |
614 | return; | |
60d3fd32 VD |
615 | |
616 | memcg_get_cache_ids(); | |
617 | ||
c0a5b560 | 618 | list_lru_unregister(lru); |
60d3fd32 VD |
619 | |
620 | memcg_destroy_list_lru(lru); | |
5ca302c8 | 621 | kfree(lru->node); |
c0a5b560 | 622 | lru->node = NULL; |
60d3fd32 | 623 | |
c92e8e10 KT |
624 | #ifdef CONFIG_MEMCG_KMEM |
625 | lru->shrinker_id = -1; | |
626 | #endif | |
60d3fd32 | 627 | memcg_put_cache_ids(); |
5ca302c8 GC |
628 | } |
629 | EXPORT_SYMBOL_GPL(list_lru_destroy); |