blob: e3dea75a078ba67b12408abd743633e3ea0a3995 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef _LINUX_PAGEMAP_H
2#define _LINUX_PAGEMAP_H
3
4/*
5 * Copyright 1995 Linus Torvalds
6 */
7#include <linux/mm.h>
8#include <linux/fs.h>
9#include <linux/list.h>
10#include <linux/highmem.h>
11#include <linux/compiler.h>
12#include <asm/uaccess.h>
13#include <linux/gfp.h>
Guillaume Chazarain3e9f45b2007-05-08 00:23:25 -070014#include <linux/bitops.h>
Nick Piggine2867812008-07-25 19:45:30 -070015#include <linux/hardirq.h> /* for in_interrupt() */
Naoya Horiguchi8edf3442010-05-28 09:29:15 +090016#include <linux/hugetlb_inline.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070017
18/*
19 * Bits in mapping->flags. The lower __GFP_BITS_SHIFT bits are the page
20 * allocation mode flags.
21 */
Lee Schermerhorn9a896c92009-04-02 16:56:45 -070022enum mapping_flags {
23 AS_EIO = __GFP_BITS_SHIFT + 0, /* IO error on async write */
24 AS_ENOSPC = __GFP_BITS_SHIFT + 1, /* ENOSPC on async write */
25 AS_MM_ALL_LOCKS = __GFP_BITS_SHIFT + 2, /* under mm_take_all_locks() */
Lee Schermerhorn9a896c92009-04-02 16:56:45 -070026 AS_UNEVICTABLE = __GFP_BITS_SHIFT + 3, /* e.g., ramdisk, SHM_LOCK */
Rafael Aquini18468d92012-12-11 16:02:38 -080027 AS_BALLOON_MAP = __GFP_BITS_SHIFT + 4, /* balloon page special map */
Lee Schermerhorn9a896c92009-04-02 16:56:45 -070028};
Linus Torvalds1da177e2005-04-16 15:20:36 -070029
Guillaume Chazarain3e9f45b2007-05-08 00:23:25 -070030static inline void mapping_set_error(struct address_space *mapping, int error)
31{
Andrew Morton2185e692008-07-23 21:27:19 -070032 if (unlikely(error)) {
Guillaume Chazarain3e9f45b2007-05-08 00:23:25 -070033 if (error == -ENOSPC)
34 set_bit(AS_ENOSPC, &mapping->flags);
35 else
36 set_bit(AS_EIO, &mapping->flags);
37 }
38}
39
Lee Schermerhornba9ddf42008-10-18 20:26:42 -070040static inline void mapping_set_unevictable(struct address_space *mapping)
41{
42 set_bit(AS_UNEVICTABLE, &mapping->flags);
43}
44
Lee Schermerhorn89e004ea2008-10-18 20:26:43 -070045static inline void mapping_clear_unevictable(struct address_space *mapping)
46{
47 clear_bit(AS_UNEVICTABLE, &mapping->flags);
48}
49
Lee Schermerhornba9ddf42008-10-18 20:26:42 -070050static inline int mapping_unevictable(struct address_space *mapping)
51{
Steven Rostedt088e5462011-01-13 15:46:16 -080052 if (mapping)
Lee Schermerhorn89e004ea2008-10-18 20:26:43 -070053 return test_bit(AS_UNEVICTABLE, &mapping->flags);
54 return !!mapping;
Lee Schermerhornba9ddf42008-10-18 20:26:42 -070055}
Lee Schermerhornba9ddf42008-10-18 20:26:42 -070056
Rafael Aquini18468d92012-12-11 16:02:38 -080057static inline void mapping_set_balloon(struct address_space *mapping)
58{
59 set_bit(AS_BALLOON_MAP, &mapping->flags);
60}
61
62static inline void mapping_clear_balloon(struct address_space *mapping)
63{
64 clear_bit(AS_BALLOON_MAP, &mapping->flags);
65}
66
67static inline int mapping_balloon(struct address_space *mapping)
68{
69 return mapping && test_bit(AS_BALLOON_MAP, &mapping->flags);
70}
71
Al Virodd0fc662005-10-07 07:46:04 +010072static inline gfp_t mapping_gfp_mask(struct address_space * mapping)
Linus Torvalds1da177e2005-04-16 15:20:36 -070073{
Al Viro260b2362005-10-21 03:22:44 -040074 return (__force gfp_t)mapping->flags & __GFP_BITS_MASK;
Linus Torvalds1da177e2005-04-16 15:20:36 -070075}
76
77/*
78 * This is non-atomic. Only to be used before the mapping is activated.
79 * Probably needs a barrier...
80 */
Al Viro260b2362005-10-21 03:22:44 -040081static inline void mapping_set_gfp_mask(struct address_space *m, gfp_t mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -070082{
Al Viro260b2362005-10-21 03:22:44 -040083 m->flags = (m->flags & ~(__force unsigned long)__GFP_BITS_MASK) |
84 (__force unsigned long)mask;
Linus Torvalds1da177e2005-04-16 15:20:36 -070085}
86
87/*
88 * The page cache can done in larger chunks than
89 * one page, because it allows for more efficient
90 * throughput (it can then be mapped into user
91 * space in smaller chunks for same flexibility).
92 *
93 * Or rather, it _will_ be done in larger chunks.
94 */
95#define PAGE_CACHE_SHIFT PAGE_SHIFT
96#define PAGE_CACHE_SIZE PAGE_SIZE
97#define PAGE_CACHE_MASK PAGE_MASK
98#define PAGE_CACHE_ALIGN(addr) (((addr)+PAGE_CACHE_SIZE-1)&PAGE_CACHE_MASK)
99
100#define page_cache_get(page) get_page(page)
101#define page_cache_release(page) put_page(page)
102void release_pages(struct page **pages, int nr, int cold);
103
Nick Piggine2867812008-07-25 19:45:30 -0700104/*
105 * speculatively take a reference to a page.
106 * If the page is free (_count == 0), then _count is untouched, and 0
107 * is returned. Otherwise, _count is incremented by 1 and 1 is returned.
108 *
109 * This function must be called inside the same rcu_read_lock() section as has
110 * been used to lookup the page in the pagecache radix-tree (or page table):
111 * this allows allocators to use a synchronize_rcu() to stabilize _count.
112 *
113 * Unless an RCU grace period has passed, the count of all pages coming out
114 * of the allocator must be considered unstable. page_count may return higher
115 * than expected, and put_page must be able to do the right thing when the
116 * page has been finished with, no matter what it is subsequently allocated
117 * for (because put_page is what is used here to drop an invalid speculative
118 * reference).
119 *
120 * This is the interesting part of the lockless pagecache (and lockless
121 * get_user_pages) locking protocol, where the lookup-side (eg. find_get_page)
122 * has the following pattern:
123 * 1. find page in radix tree
124 * 2. conditionally increment refcount
125 * 3. check the page is still in pagecache (if no, goto 1)
126 *
127 * Remove-side that cares about stability of _count (eg. reclaim) has the
128 * following (with tree_lock held for write):
129 * A. atomically check refcount is correct and set it to 0 (atomic_cmpxchg)
130 * B. remove page from pagecache
131 * C. free the page
132 *
133 * There are 2 critical interleavings that matter:
134 * - 2 runs before A: in this case, A sees elevated refcount and bails out
135 * - A runs before 2: in this case, 2 sees zero refcount and retries;
136 * subsequently, B will complete and 1 will find no page, causing the
137 * lookup to return NULL.
138 *
139 * It is possible that between 1 and 2, the page is removed then the exact same
140 * page is inserted into the same position in pagecache. That's OK: the
141 * old find_get_page using tree_lock could equally have run before or after
142 * such a re-insertion, depending on order that locks are granted.
143 *
144 * Lookups racing against pagecache insertion isn't a big problem: either 1
145 * will find the page or it will not. Likewise, the old find_get_page could run
146 * either before the insertion or afterwards, depending on timing.
147 */
148static inline int page_cache_get_speculative(struct page *page)
149{
150 VM_BUG_ON(in_interrupt());
151
Paul E. McKenney8375ad92013-04-29 15:06:13 -0700152#ifdef CONFIG_TINY_RCU
Frederic Weisbeckerbdd4e852011-06-08 01:13:27 +0200153# ifdef CONFIG_PREEMPT_COUNT
Nick Piggine2867812008-07-25 19:45:30 -0700154 VM_BUG_ON(!in_atomic());
155# endif
156 /*
157 * Preempt must be disabled here - we rely on rcu_read_lock doing
158 * this for us.
159 *
160 * Pagecache won't be truncated from interrupt context, so if we have
161 * found a page in the radix tree here, we have pinned its refcount by
162 * disabling preempt, and hence no need for the "speculative get" that
163 * SMP requires.
164 */
165 VM_BUG_ON(page_count(page) == 0);
166 atomic_inc(&page->_count);
167
168#else
169 if (unlikely(!get_page_unless_zero(page))) {
170 /*
171 * Either the page has been freed, or will be freed.
172 * In either case, retry here and the caller should
173 * do the right thing (see comments above).
174 */
175 return 0;
176 }
177#endif
178 VM_BUG_ON(PageTail(page));
179
180 return 1;
181}
182
Nick Piggince0ad7f2008-07-30 15:23:13 +1000183/*
184 * Same as above, but add instead of inc (could just be merged)
185 */
186static inline int page_cache_add_speculative(struct page *page, int count)
187{
188 VM_BUG_ON(in_interrupt());
189
Paul E. McKenneyb560d8a2009-08-21 22:08:51 -0700190#if !defined(CONFIG_SMP) && defined(CONFIG_TREE_RCU)
Frederic Weisbeckerbdd4e852011-06-08 01:13:27 +0200191# ifdef CONFIG_PREEMPT_COUNT
Nick Piggince0ad7f2008-07-30 15:23:13 +1000192 VM_BUG_ON(!in_atomic());
193# endif
194 VM_BUG_ON(page_count(page) == 0);
195 atomic_add(count, &page->_count);
196
197#else
198 if (unlikely(!atomic_add_unless(&page->_count, count, 0)))
199 return 0;
200#endif
201 VM_BUG_ON(PageCompound(page) && page != compound_head(page));
202
203 return 1;
204}
205
Nick Piggine2867812008-07-25 19:45:30 -0700206static inline int page_freeze_refs(struct page *page, int count)
207{
208 return likely(atomic_cmpxchg(&page->_count, count, 0) == count);
209}
210
211static inline void page_unfreeze_refs(struct page *page, int count)
212{
213 VM_BUG_ON(page_count(page) != 0);
214 VM_BUG_ON(count == 0);
215
216 atomic_set(&page->_count, count);
217}
218
Paul Jackson44110fe2006-03-24 03:16:04 -0800219#ifdef CONFIG_NUMA
Nick Piggin2ae88142006-10-28 10:38:23 -0700220extern struct page *__page_cache_alloc(gfp_t gfp);
Paul Jackson44110fe2006-03-24 03:16:04 -0800221#else
Nick Piggin2ae88142006-10-28 10:38:23 -0700222static inline struct page *__page_cache_alloc(gfp_t gfp)
223{
224 return alloc_pages(gfp, 0);
225}
226#endif
227
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228static inline struct page *page_cache_alloc(struct address_space *x)
229{
Nick Piggin2ae88142006-10-28 10:38:23 -0700230 return __page_cache_alloc(mapping_gfp_mask(x));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231}
232
233static inline struct page *page_cache_alloc_cold(struct address_space *x)
234{
Nick Piggin2ae88142006-10-28 10:38:23 -0700235 return __page_cache_alloc(mapping_gfp_mask(x)|__GFP_COLD);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236}
237
Wu Fengguang7b1de582011-05-24 17:12:25 -0700238static inline struct page *page_cache_alloc_readahead(struct address_space *x)
239{
240 return __page_cache_alloc(mapping_gfp_mask(x) |
241 __GFP_COLD | __GFP_NORETRY | __GFP_NOWARN);
242}
243
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244typedef int filler_t(void *, struct page *);
245
246extern struct page * find_get_page(struct address_space *mapping,
Fengguang Wu57f6b962007-10-16 01:24:37 -0700247 pgoff_t index);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248extern struct page * find_lock_page(struct address_space *mapping,
Fengguang Wu57f6b962007-10-16 01:24:37 -0700249 pgoff_t index);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250extern struct page * find_or_create_page(struct address_space *mapping,
Fengguang Wu57f6b962007-10-16 01:24:37 -0700251 pgoff_t index, gfp_t gfp_mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700252unsigned find_get_pages(struct address_space *mapping, pgoff_t start,
253 unsigned int nr_pages, struct page **pages);
Jens Axboeebf43502006-04-27 08:46:01 +0200254unsigned find_get_pages_contig(struct address_space *mapping, pgoff_t start,
255 unsigned int nr_pages, struct page **pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700256unsigned find_get_pages_tag(struct address_space *mapping, pgoff_t *index,
257 int tag, unsigned int nr_pages, struct page **pages);
258
Nick Piggin54566b22009-01-04 12:00:53 -0800259struct page *grab_cache_page_write_begin(struct address_space *mapping,
260 pgoff_t index, unsigned flags);
Nick Pigginafddba42007-10-16 01:25:01 -0700261
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262/*
263 * Returns locked page at given index in given cache, creating it if needed.
264 */
Fengguang Wu57f6b962007-10-16 01:24:37 -0700265static inline struct page *grab_cache_page(struct address_space *mapping,
266 pgoff_t index)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267{
268 return find_or_create_page(mapping, index, mapping_gfp_mask(mapping));
269}
270
271extern struct page * grab_cache_page_nowait(struct address_space *mapping,
Fengguang Wu57f6b962007-10-16 01:24:37 -0700272 pgoff_t index);
Nick Piggin6fe69002007-05-06 14:49:04 -0700273extern struct page * read_cache_page_async(struct address_space *mapping,
Hugh Dickins5e5358e2011-07-25 17:12:23 -0700274 pgoff_t index, filler_t *filler, void *data);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275extern struct page * read_cache_page(struct address_space *mapping,
Hugh Dickins5e5358e2011-07-25 17:12:23 -0700276 pgoff_t index, filler_t *filler, void *data);
Linus Torvalds0531b2a2010-01-27 09:20:03 -0800277extern struct page * read_cache_page_gfp(struct address_space *mapping,
278 pgoff_t index, gfp_t gfp_mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279extern int read_cache_pages(struct address_space *mapping,
280 struct list_head *pages, filler_t *filler, void *data);
281
Nick Piggin6fe69002007-05-06 14:49:04 -0700282static inline struct page *read_mapping_page_async(
Hugh Dickins5e5358e2011-07-25 17:12:23 -0700283 struct address_space *mapping,
284 pgoff_t index, void *data)
Nick Piggin6fe69002007-05-06 14:49:04 -0700285{
286 filler_t *filler = (filler_t *)mapping->a_ops->readpage;
287 return read_cache_page_async(mapping, index, filler, data);
288}
289
Pekka Enberg090d2b12006-06-23 02:05:08 -0700290static inline struct page *read_mapping_page(struct address_space *mapping,
Hugh Dickins5e5358e2011-07-25 17:12:23 -0700291 pgoff_t index, void *data)
Pekka Enberg090d2b12006-06-23 02:05:08 -0700292{
293 filler_t *filler = (filler_t *)mapping->a_ops->readpage;
294 return read_cache_page(mapping, index, filler, data);
295}
296
Nick Piggine2867812008-07-25 19:45:30 -0700297/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298 * Return byte-offset into filesystem object for page.
299 */
300static inline loff_t page_offset(struct page *page)
301{
302 return ((loff_t)page->index) << PAGE_CACHE_SHIFT;
303}
304
Mel Gormanf981c592012-07-31 16:44:47 -0700305static inline loff_t page_file_offset(struct page *page)
306{
307 return ((loff_t)page_file_index(page)) << PAGE_CACHE_SHIFT;
308}
309
Naoya Horiguchi0fe6e202010-05-28 09:29:16 +0900310extern pgoff_t linear_hugepage_index(struct vm_area_struct *vma,
311 unsigned long address);
312
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313static inline pgoff_t linear_page_index(struct vm_area_struct *vma,
314 unsigned long address)
315{
Naoya Horiguchi0fe6e202010-05-28 09:29:16 +0900316 pgoff_t pgoff;
317 if (unlikely(is_vm_hugetlb_page(vma)))
318 return linear_hugepage_index(vma, address);
319 pgoff = (address - vma->vm_start) >> PAGE_SHIFT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320 pgoff += vma->vm_pgoff;
321 return pgoff >> (PAGE_CACHE_SHIFT - PAGE_SHIFT);
322}
323
Harvey Harrisonb3c97522008-02-13 15:03:15 -0800324extern void __lock_page(struct page *page);
325extern int __lock_page_killable(struct page *page);
Michel Lespinassed065bd82010-10-26 14:21:57 -0700326extern int __lock_page_or_retry(struct page *page, struct mm_struct *mm,
327 unsigned int flags);
Harvey Harrisonb3c97522008-02-13 15:03:15 -0800328extern void unlock_page(struct page *page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329
Nick Pigginf45840b2008-10-18 20:26:57 -0700330static inline void __set_page_locked(struct page *page)
Nick Piggin529ae9a2008-08-02 12:01:03 +0200331{
Nick Pigginf45840b2008-10-18 20:26:57 -0700332 __set_bit(PG_locked, &page->flags);
Nick Piggin529ae9a2008-08-02 12:01:03 +0200333}
334
Nick Pigginf45840b2008-10-18 20:26:57 -0700335static inline void __clear_page_locked(struct page *page)
Nick Piggin529ae9a2008-08-02 12:01:03 +0200336{
Nick Pigginf45840b2008-10-18 20:26:57 -0700337 __clear_bit(PG_locked, &page->flags);
Nick Piggin529ae9a2008-08-02 12:01:03 +0200338}
339
340static inline int trylock_page(struct page *page)
341{
Nick Piggin8413ac92008-10-18 20:26:59 -0700342 return (likely(!test_and_set_bit_lock(PG_locked, &page->flags)));
Nick Piggin529ae9a2008-08-02 12:01:03 +0200343}
344
Nick Piggindb376482006-09-25 23:31:24 -0700345/*
346 * lock_page may only be called if we have the page's inode pinned.
347 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700348static inline void lock_page(struct page *page)
349{
350 might_sleep();
Nick Piggin529ae9a2008-08-02 12:01:03 +0200351 if (!trylock_page(page))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700352 __lock_page(page);
353}
Nick Piggindb376482006-09-25 23:31:24 -0700354
355/*
Matthew Wilcox2687a352007-12-06 11:18:49 -0500356 * lock_page_killable is like lock_page but can be interrupted by fatal
357 * signals. It returns 0 if it locked the page and -EINTR if it was
358 * killed while waiting.
359 */
360static inline int lock_page_killable(struct page *page)
361{
362 might_sleep();
Nick Piggin529ae9a2008-08-02 12:01:03 +0200363 if (!trylock_page(page))
Matthew Wilcox2687a352007-12-06 11:18:49 -0500364 return __lock_page_killable(page);
365 return 0;
366}
367
368/*
Michel Lespinassed065bd82010-10-26 14:21:57 -0700369 * lock_page_or_retry - Lock the page, unless this would block and the
370 * caller indicated that it can handle a retry.
371 */
372static inline int lock_page_or_retry(struct page *page, struct mm_struct *mm,
373 unsigned int flags)
374{
375 might_sleep();
376 return trylock_page(page) || __lock_page_or_retry(page, mm, flags);
377}
378
379/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700380 * This is exported only for wait_on_page_locked/wait_on_page_writeback.
381 * Never use this directly!
382 */
Harvey Harrisonb3c97522008-02-13 15:03:15 -0800383extern void wait_on_page_bit(struct page *page, int bit_nr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384
KOSAKI Motohirof62e00c2011-05-24 17:11:29 -0700385extern int wait_on_page_bit_killable(struct page *page, int bit_nr);
386
387static inline int wait_on_page_locked_killable(struct page *page)
388{
389 if (PageLocked(page))
390 return wait_on_page_bit_killable(page, PG_locked);
391 return 0;
392}
393
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394/*
395 * Wait for a page to be unlocked.
396 *
397 * This must be called with the caller "holding" the page,
398 * ie with increased "page->count" so that the page won't
399 * go away during the wait..
400 */
401static inline void wait_on_page_locked(struct page *page)
402{
403 if (PageLocked(page))
404 wait_on_page_bit(page, PG_locked);
405}
406
407/*
408 * Wait for a page to complete writeback
409 */
410static inline void wait_on_page_writeback(struct page *page)
411{
412 if (PageWriteback(page))
413 wait_on_page_bit(page, PG_writeback);
414}
415
416extern void end_page_writeback(struct page *page);
Darrick J. Wong1d1d1a72013-02-21 16:42:51 -0800417void wait_for_stable_page(struct page *page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418
419/*
David Howells385e1ca5f2009-04-03 16:42:39 +0100420 * Add an arbitrary waiter to a page's wait queue
421 */
422extern void add_page_wait_queue(struct page *page, wait_queue_t *waiter);
423
424/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425 * Fault a userspace page into pagetables. Return non-zero on a fault.
426 *
427 * This assumes that two userspace pages are always sufficient. That's
428 * not true if PAGE_CACHE_SIZE > PAGE_SIZE.
429 */
430static inline int fault_in_pages_writeable(char __user *uaddr, int size)
431{
432 int ret;
433
Nick Piggin08291422007-10-16 01:24:59 -0700434 if (unlikely(size == 0))
435 return 0;
436
Linus Torvalds1da177e2005-04-16 15:20:36 -0700437 /*
438 * Writing zeroes into userspace here is OK, because we know that if
439 * the zero gets there, we'll be overwriting it.
440 */
441 ret = __put_user(0, uaddr);
442 if (ret == 0) {
443 char __user *end = uaddr + size - 1;
444
445 /*
446 * If the page was already mapped, this will get a cache miss
447 * for sure, so try to avoid doing it.
448 */
449 if (((unsigned long)uaddr & PAGE_MASK) !=
450 ((unsigned long)end & PAGE_MASK))
Daniel Vetterf56f8212012-03-25 19:47:41 +0200451 ret = __put_user(0, end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700452 }
453 return ret;
454}
455
Nick Piggin08291422007-10-16 01:24:59 -0700456static inline int fault_in_pages_readable(const char __user *uaddr, int size)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700457{
458 volatile char c;
459 int ret;
460
Nick Piggin08291422007-10-16 01:24:59 -0700461 if (unlikely(size == 0))
462 return 0;
463
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464 ret = __get_user(c, uaddr);
465 if (ret == 0) {
466 const char __user *end = uaddr + size - 1;
467
468 if (((unsigned long)uaddr & PAGE_MASK) !=
Andi Kleen627295e2010-08-09 17:19:02 -0700469 ((unsigned long)end & PAGE_MASK)) {
Daniel Vetterf56f8212012-03-25 19:47:41 +0200470 ret = __get_user(c, end);
Andi Kleen627295e2010-08-09 17:19:02 -0700471 (void)c;
472 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700473 }
Nick Piggin08291422007-10-16 01:24:59 -0700474 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700475}
476
Daniel Vetterf56f8212012-03-25 19:47:41 +0200477/*
478 * Multipage variants of the above prefault helpers, useful if more than
479 * PAGE_SIZE of data needs to be prefaulted. These are separate from the above
480 * functions (which only handle up to PAGE_SIZE) to avoid clobbering the
481 * filemap.c hotpaths.
482 */
483static inline int fault_in_multipages_writeable(char __user *uaddr, int size)
484{
Paul Gortmakeraf2e8402012-05-29 15:06:14 -0700485 int ret = 0;
Daniel Vetter99237772012-04-14 18:03:10 +0200486 char __user *end = uaddr + size - 1;
Daniel Vetterf56f8212012-03-25 19:47:41 +0200487
488 if (unlikely(size == 0))
Paul Gortmakeraf2e8402012-05-29 15:06:14 -0700489 return ret;
Daniel Vetterf56f8212012-03-25 19:47:41 +0200490
491 /*
492 * Writing zeroes into userspace here is OK, because we know that if
493 * the zero gets there, we'll be overwriting it.
494 */
495 while (uaddr <= end) {
496 ret = __put_user(0, uaddr);
497 if (ret != 0)
498 return ret;
499 uaddr += PAGE_SIZE;
500 }
501
502 /* Check whether the range spilled into the next page. */
503 if (((unsigned long)uaddr & PAGE_MASK) ==
504 ((unsigned long)end & PAGE_MASK))
505 ret = __put_user(0, end);
506
507 return ret;
508}
509
510static inline int fault_in_multipages_readable(const char __user *uaddr,
511 int size)
512{
513 volatile char c;
Paul Gortmakeraf2e8402012-05-29 15:06:14 -0700514 int ret = 0;
Daniel Vetterf56f8212012-03-25 19:47:41 +0200515 const char __user *end = uaddr + size - 1;
516
517 if (unlikely(size == 0))
Paul Gortmakeraf2e8402012-05-29 15:06:14 -0700518 return ret;
Daniel Vetterf56f8212012-03-25 19:47:41 +0200519
520 while (uaddr <= end) {
521 ret = __get_user(c, uaddr);
522 if (ret != 0)
523 return ret;
524 uaddr += PAGE_SIZE;
525 }
526
527 /* Check whether the range spilled into the next page. */
528 if (((unsigned long)uaddr & PAGE_MASK) ==
529 ((unsigned long)end & PAGE_MASK)) {
530 ret = __get_user(c, end);
531 (void)c;
532 }
533
534 return ret;
535}
536
Nick Piggin529ae9a2008-08-02 12:01:03 +0200537int add_to_page_cache_locked(struct page *page, struct address_space *mapping,
538 pgoff_t index, gfp_t gfp_mask);
539int add_to_page_cache_lru(struct page *page, struct address_space *mapping,
540 pgoff_t index, gfp_t gfp_mask);
Minchan Kim97cecb52011-03-22 16:30:53 -0700541extern void delete_from_page_cache(struct page *page);
Minchan Kime64a7822011-03-22 16:32:44 -0700542extern void __delete_from_page_cache(struct page *page);
Miklos Szeredief6a3c62011-03-22 16:30:52 -0700543int replace_page_cache_page(struct page *old, struct page *new, gfp_t gfp_mask);
Nick Piggin529ae9a2008-08-02 12:01:03 +0200544
545/*
546 * Like add_to_page_cache_locked, but used to add newly allocated pages:
Nick Pigginf45840b2008-10-18 20:26:57 -0700547 * the page is new, so we can just run __set_page_locked() against it.
Nick Piggin529ae9a2008-08-02 12:01:03 +0200548 */
549static inline int add_to_page_cache(struct page *page,
550 struct address_space *mapping, pgoff_t offset, gfp_t gfp_mask)
551{
552 int error;
553
Nick Pigginf45840b2008-10-18 20:26:57 -0700554 __set_page_locked(page);
Nick Piggin529ae9a2008-08-02 12:01:03 +0200555 error = add_to_page_cache_locked(page, mapping, offset, gfp_mask);
556 if (unlikely(error))
Nick Pigginf45840b2008-10-18 20:26:57 -0700557 __clear_page_locked(page);
Nick Piggin529ae9a2008-08-02 12:01:03 +0200558 return error;
559}
560
Linus Torvalds1da177e2005-04-16 15:20:36 -0700561#endif /* _LINUX_PAGEMAP_H */