aboutsummaryrefslogtreecommitdiffstats
path: root/mm
diff options
context:
space:
mode:
authorDave Chinner <dchinner@redhat.com>2013-08-27 20:18:01 -0400
committerAl Viro <viro@zeniv.linux.org.uk>2013-09-10 18:56:30 -0400
commit5cedf721a7cdb54e9222133516c916210d836470 (patch)
treead88b1e86956e75c173fe70206fa9c40d3d2a86f /mm
parent3b1d58a4c96799eb4c92039e1b851b86f853548a (diff)
list_lru: fix broken LRU_RETRY behaviour
The LRU_RETRY code assumes that the list traversal status after we have dropped and regained the list lock. Unfortunately, this is not a valid assumption, and that can lead to racing traversals isolating objects that the other traversal expects to be the next item on the list. This is causing problems with the inode cache shrinker isolation, with races resulting in an inode on a dispose list being "isolated" because a racing traversal still thinks it is on the LRU. The inode is then never reclaimed and that causes hangs if a subsequent lookup on that inode occurs. Fix it by always restarting the list walk on a LRU_RETRY return from the isolate callback. Avoid the possibility of livelocks the current code was trying to avoid by always decrementing the nr_to_walk counter on retries so that even if we keep hitting the same item on the list we'll eventually stop trying to walk and exit out of the situation causing the problem. Reported-by: Michal Hocko <mhocko@suse.cz> Signed-off-by: Dave Chinner <dchinner@redhat.com> Cc: Glauber Costa <glommer@gmail.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
Diffstat (limited to 'mm')
-rw-r--r--mm/list_lru.c29
1 files changed, 12 insertions, 17 deletions
diff --git a/mm/list_lru.c b/mm/list_lru.c
index 1efe4ecc02b1..e77c29f4c243 100644
--- a/mm/list_lru.c
+++ b/mm/list_lru.c
@@ -73,19 +73,19 @@ list_lru_walk_node(struct list_lru *lru, int nid, list_lru_walk_cb isolate,
73 struct list_lru_node *nlru = &lru->node[nid]; 73 struct list_lru_node *nlru = &lru->node[nid];
74 struct list_head *item, *n; 74 struct list_head *item, *n;
75 unsigned long isolated = 0; 75 unsigned long isolated = 0;
76 /*
77 * If we don't keep state of at which pass we are, we can loop at
78 * LRU_RETRY, since we have no guarantees that the caller will be able
79 * to do something other than retry on the next pass. We handle this by
80 * allowing at most one retry per object. This should not be altered
81 * by any condition other than LRU_RETRY.
82 */
83 bool first_pass = true;
84 76
85 spin_lock(&nlru->lock); 77 spin_lock(&nlru->lock);
86restart: 78restart:
87 list_for_each_safe(item, n, &nlru->list) { 79 list_for_each_safe(item, n, &nlru->list) {
88 enum lru_status ret; 80 enum lru_status ret;
81
82 /*
83 * decrement nr_to_walk first so that we don't livelock if we
84 * get stuck on large numbesr of LRU_RETRY items
85 */
86 if (--(*nr_to_walk) == 0)
87 break;
88
89 ret = isolate(item, &nlru->lock, cb_arg); 89 ret = isolate(item, &nlru->lock, cb_arg);
90 switch (ret) { 90 switch (ret) {
91 case LRU_REMOVED: 91 case LRU_REMOVED:
@@ -100,19 +100,14 @@ restart:
100 case LRU_SKIP: 100 case LRU_SKIP:
101 break; 101 break;
102 case LRU_RETRY: 102 case LRU_RETRY:
103 if (!first_pass) { 103 /*
104 first_pass = true; 104 * The lru lock has been dropped, our list traversal is
105 break; 105 * now invalid and so we have to restart from scratch.
106 } 106 */
107 first_pass = false;
108 goto restart; 107 goto restart;
109 default: 108 default:
110 BUG(); 109 BUG();
111 } 110 }
112
113 if ((*nr_to_walk)-- == 0)
114 break;
115
116 } 111 }
117 112
118 spin_unlock(&nlru->lock); 113 spin_unlock(&nlru->lock);