diff options
author | Daisuke Nishimura <nishimura@mxp.nes.nec.co.jp> | 2009-09-21 20:02:52 -0400 |
---|---|---|
committer | Linus Torvalds <torvalds@linux-foundation.org> | 2009-09-22 10:17:35 -0400 |
commit | 2ca4532a49be92d7b2766c3244b30fa8bfb0114d (patch) | |
tree | 1dc838cebacb10317dff78ceccd50b97e24c4f7f /mm/swap_state.c | |
parent | 31a5639623a487d6db996c8138c9e53fef2e2d91 (diff) |
mm: add_to_swap_cache() does not return -EEXIST
After commit 355cfa73 ("mm: modify swap_map and add SWAP_HAS_CACHE flag"),
only the context which have set SWAP_HAS_CACHE flag by swapcache_prepare()
or get_swap_page() would call add_to_swap_cache(). So add_to_swap_cache()
doesn't return -EEXIST any more.
Even though it doesn't return -EEXIST, it's not good behavior conceptually
to call swapcache_prepare() in the -EEXIST case, because it means clearing
SWAP_HAS_CACHE flag while the entry is on swap cache.
This patch removes redundant codes and comments from callers of it, and
adds VM_BUG_ON() in error path of add_to_swap_cache() and some comments.
Signed-off-by: Daisuke Nishimura <nishimura@mxp.nes.nec.co.jp>
Reviewed-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Balbir Singh <balbir@linux.vnet.ibm.com>
Cc: Hugh Dickins <hugh.dickins@tiscali.co.uk>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'mm/swap_state.c')
-rw-r--r-- | mm/swap_state.c | 73 |
1 files changed, 36 insertions, 37 deletions
diff --git a/mm/swap_state.c b/mm/swap_state.c index b076a1a5a0aa..6d1daeb1cb4a 100644 --- a/mm/swap_state.c +++ b/mm/swap_state.c | |||
@@ -92,6 +92,12 @@ static int __add_to_swap_cache(struct page *page, swp_entry_t entry) | |||
92 | spin_unlock_irq(&swapper_space.tree_lock); | 92 | spin_unlock_irq(&swapper_space.tree_lock); |
93 | 93 | ||
94 | if (unlikely(error)) { | 94 | if (unlikely(error)) { |
95 | /* | ||
96 | * Only the context which have set SWAP_HAS_CACHE flag | ||
97 | * would call add_to_swap_cache(). | ||
98 | * So add_to_swap_cache() doesn't returns -EEXIST. | ||
99 | */ | ||
100 | VM_BUG_ON(error == -EEXIST); | ||
95 | set_page_private(page, 0UL); | 101 | set_page_private(page, 0UL); |
96 | ClearPageSwapCache(page); | 102 | ClearPageSwapCache(page); |
97 | page_cache_release(page); | 103 | page_cache_release(page); |
@@ -146,38 +152,34 @@ int add_to_swap(struct page *page) | |||
146 | VM_BUG_ON(!PageLocked(page)); | 152 | VM_BUG_ON(!PageLocked(page)); |
147 | VM_BUG_ON(!PageUptodate(page)); | 153 | VM_BUG_ON(!PageUptodate(page)); |
148 | 154 | ||
149 | for (;;) { | 155 | entry = get_swap_page(); |
150 | entry = get_swap_page(); | 156 | if (!entry.val) |
151 | if (!entry.val) | 157 | return 0; |
152 | return 0; | ||
153 | 158 | ||
159 | /* | ||
160 | * Radix-tree node allocations from PF_MEMALLOC contexts could | ||
161 | * completely exhaust the page allocator. __GFP_NOMEMALLOC | ||
162 | * stops emergency reserves from being allocated. | ||
163 | * | ||
164 | * TODO: this could cause a theoretical memory reclaim | ||
165 | * deadlock in the swap out path. | ||
166 | */ | ||
167 | /* | ||
168 | * Add it to the swap cache and mark it dirty | ||
169 | */ | ||
170 | err = add_to_swap_cache(page, entry, | ||
171 | __GFP_HIGH|__GFP_NOMEMALLOC|__GFP_NOWARN); | ||
172 | |||
173 | if (!err) { /* Success */ | ||
174 | SetPageDirty(page); | ||
175 | return 1; | ||
176 | } else { /* -ENOMEM radix-tree allocation failure */ | ||
154 | /* | 177 | /* |
155 | * Radix-tree node allocations from PF_MEMALLOC contexts could | 178 | * add_to_swap_cache() doesn't return -EEXIST, so we can safely |
156 | * completely exhaust the page allocator. __GFP_NOMEMALLOC | 179 | * clear SWAP_HAS_CACHE flag. |
157 | * stops emergency reserves from being allocated. | ||
158 | * | ||
159 | * TODO: this could cause a theoretical memory reclaim | ||
160 | * deadlock in the swap out path. | ||
161 | */ | ||
162 | /* | ||
163 | * Add it to the swap cache and mark it dirty | ||
164 | */ | 180 | */ |
165 | err = add_to_swap_cache(page, entry, | 181 | swapcache_free(entry, NULL); |
166 | __GFP_HIGH|__GFP_NOMEMALLOC|__GFP_NOWARN); | 182 | return 0; |
167 | |||
168 | switch (err) { | ||
169 | case 0: /* Success */ | ||
170 | SetPageDirty(page); | ||
171 | return 1; | ||
172 | case -EEXIST: | ||
173 | /* Raced with "speculative" read_swap_cache_async */ | ||
174 | swapcache_free(entry, NULL); | ||
175 | continue; | ||
176 | default: | ||
177 | /* -ENOMEM radix-tree allocation failure */ | ||
178 | swapcache_free(entry, NULL); | ||
179 | return 0; | ||
180 | } | ||
181 | } | 183 | } |
182 | } | 184 | } |
183 | 185 | ||
@@ -318,14 +320,7 @@ struct page *read_swap_cache_async(swp_entry_t entry, gfp_t gfp_mask, | |||
318 | break; | 320 | break; |
319 | } | 321 | } |
320 | 322 | ||
321 | /* | 323 | /* May fail (-ENOMEM) if radix-tree node allocation failed. */ |
322 | * Associate the page with swap entry in the swap cache. | ||
323 | * May fail (-EEXIST) if there is already a page associated | ||
324 | * with this entry in the swap cache: added by a racing | ||
325 | * read_swap_cache_async, or add_to_swap or shmem_writepage | ||
326 | * re-using the just freed swap entry for an existing page. | ||
327 | * May fail (-ENOMEM) if radix-tree node allocation failed. | ||
328 | */ | ||
329 | __set_page_locked(new_page); | 324 | __set_page_locked(new_page); |
330 | SetPageSwapBacked(new_page); | 325 | SetPageSwapBacked(new_page); |
331 | err = __add_to_swap_cache(new_page, entry); | 326 | err = __add_to_swap_cache(new_page, entry); |
@@ -341,6 +336,10 @@ struct page *read_swap_cache_async(swp_entry_t entry, gfp_t gfp_mask, | |||
341 | radix_tree_preload_end(); | 336 | radix_tree_preload_end(); |
342 | ClearPageSwapBacked(new_page); | 337 | ClearPageSwapBacked(new_page); |
343 | __clear_page_locked(new_page); | 338 | __clear_page_locked(new_page); |
339 | /* | ||
340 | * add_to_swap_cache() doesn't return -EEXIST, so we can safely | ||
341 | * clear SWAP_HAS_CACHE flag. | ||
342 | */ | ||
344 | swapcache_free(entry, NULL); | 343 | swapcache_free(entry, NULL); |
345 | } while (err != -ENOMEM); | 344 | } while (err != -ENOMEM); |
346 | 345 | ||