1 #ifndef _LINUX_PAGEMAP_H
2 #define _LINUX_PAGEMAP_H
5 * Copyright 1995 Linus Torvalds
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>
14 #include <linux/bitops.h>
15 #include <linux/hardirq.h> /* for in_interrupt() */
16 #include <linux/hugetlb_inline.h>
19 * Bits in mapping->flags. The lower __GFP_BITS_SHIFT bits are the page
20 * allocation mode 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() */
26 AS_UNEVICTABLE = __GFP_BITS_SHIFT + 3, /* e.g., ramdisk, SHM_LOCK */
27 AS_EXITING = __GFP_BITS_SHIFT + 4, /* final truncate in progress */
30 static inline void mapping_set_error(struct address_space *mapping, int error)
32 if (unlikely(error)) {
34 set_bit(AS_ENOSPC, &mapping->flags);
36 set_bit(AS_EIO, &mapping->flags);
40 static inline void mapping_set_unevictable(struct address_space *mapping)
42 set_bit(AS_UNEVICTABLE, &mapping->flags);
45 static inline void mapping_clear_unevictable(struct address_space *mapping)
47 clear_bit(AS_UNEVICTABLE, &mapping->flags);
50 static inline int mapping_unevictable(struct address_space *mapping)
53 return test_bit(AS_UNEVICTABLE, &mapping->flags);
57 static inline void mapping_set_exiting(struct address_space *mapping)
59 set_bit(AS_EXITING, &mapping->flags);
62 static inline int mapping_exiting(struct address_space *mapping)
64 return test_bit(AS_EXITING, &mapping->flags);
67 static inline gfp_t mapping_gfp_mask(struct address_space * mapping)
69 return (__force gfp_t)mapping->flags & __GFP_BITS_MASK;
72 /* Restricts the given gfp_mask to what the mapping allows. */
73 static inline gfp_t mapping_gfp_constraint(struct address_space *mapping,
76 return mapping_gfp_mask(mapping) & gfp_mask;
80 * This is non-atomic. Only to be used before the mapping is activated.
81 * Probably needs a barrier...
83 static inline void mapping_set_gfp_mask(struct address_space *m, gfp_t mask)
85 m->flags = (m->flags & ~(__force unsigned long)__GFP_BITS_MASK) |
86 (__force unsigned long)mask;
90 * The page cache can be done in larger chunks than
91 * one page, because it allows for more efficient
92 * throughput (it can then be mapped into user
93 * space in smaller chunks for same flexibility).
95 * Or rather, it _will_ be done in larger chunks.
97 #define PAGE_CACHE_SHIFT PAGE_SHIFT
98 #define PAGE_CACHE_SIZE PAGE_SIZE
99 #define PAGE_CACHE_MASK PAGE_MASK
100 #define PAGE_CACHE_ALIGN(addr) (((addr)+PAGE_CACHE_SIZE-1)&PAGE_CACHE_MASK)
102 #define page_cache_get(page) get_page(page)
103 #define page_cache_release(page) put_page(page)
104 void release_pages(struct page **pages, int nr, bool cold);
107 * speculatively take a reference to a page.
108 * If the page is free (_count == 0), then _count is untouched, and 0
109 * is returned. Otherwise, _count is incremented by 1 and 1 is returned.
111 * This function must be called inside the same rcu_read_lock() section as has
112 * been used to lookup the page in the pagecache radix-tree (or page table):
113 * this allows allocators to use a synchronize_rcu() to stabilize _count.
115 * Unless an RCU grace period has passed, the count of all pages coming out
116 * of the allocator must be considered unstable. page_count may return higher
117 * than expected, and put_page must be able to do the right thing when the
118 * page has been finished with, no matter what it is subsequently allocated
119 * for (because put_page is what is used here to drop an invalid speculative
122 * This is the interesting part of the lockless pagecache (and lockless
123 * get_user_pages) locking protocol, where the lookup-side (eg. find_get_page)
124 * has the following pattern:
125 * 1. find page in radix tree
126 * 2. conditionally increment refcount
127 * 3. check the page is still in pagecache (if no, goto 1)
129 * Remove-side that cares about stability of _count (eg. reclaim) has the
130 * following (with tree_lock held for write):
131 * A. atomically check refcount is correct and set it to 0 (atomic_cmpxchg)
132 * B. remove page from pagecache
135 * There are 2 critical interleavings that matter:
136 * - 2 runs before A: in this case, A sees elevated refcount and bails out
137 * - A runs before 2: in this case, 2 sees zero refcount and retries;
138 * subsequently, B will complete and 1 will find no page, causing the
139 * lookup to return NULL.
141 * It is possible that between 1 and 2, the page is removed then the exact same
142 * page is inserted into the same position in pagecache. That's OK: the
143 * old find_get_page using tree_lock could equally have run before or after
144 * such a re-insertion, depending on order that locks are granted.
146 * Lookups racing against pagecache insertion isn't a big problem: either 1
147 * will find the page or it will not. Likewise, the old find_get_page could run
148 * either before the insertion or afterwards, depending on timing.
150 static inline int page_cache_get_speculative(struct page *page)
152 VM_BUG_ON(in_interrupt());
154 #ifdef CONFIG_TINY_RCU
155 # ifdef CONFIG_PREEMPT_COUNT
156 VM_BUG_ON(!in_atomic() && !irqs_disabled());
159 * Preempt must be disabled here - we rely on rcu_read_lock doing
162 * Pagecache won't be truncated from interrupt context, so if we have
163 * found a page in the radix tree here, we have pinned its refcount by
164 * disabling preempt, and hence no need for the "speculative get" that
167 VM_BUG_ON_PAGE(page_count(page) == 0, page);
168 atomic_inc(&page->_count);
171 if (unlikely(!get_page_unless_zero(page))) {
173 * Either the page has been freed, or will be freed.
174 * In either case, retry here and the caller should
175 * do the right thing (see comments above).
180 VM_BUG_ON_PAGE(PageTail(page), page);
186 * Same as above, but add instead of inc (could just be merged)
188 static inline int page_cache_add_speculative(struct page *page, int count)
190 VM_BUG_ON(in_interrupt());
192 #if !defined(CONFIG_SMP) && defined(CONFIG_TREE_RCU)
193 # ifdef CONFIG_PREEMPT_COUNT
194 VM_BUG_ON(!in_atomic() && !irqs_disabled());
196 VM_BUG_ON_PAGE(page_count(page) == 0, page);
197 atomic_add(count, &page->_count);
200 if (unlikely(!atomic_add_unless(&page->_count, count, 0)))
203 VM_BUG_ON_PAGE(PageCompound(page) && page != compound_head(page), page);
208 static inline int page_freeze_refs(struct page *page, int count)
210 return likely(atomic_cmpxchg(&page->_count, count, 0) == count);
213 static inline void page_unfreeze_refs(struct page *page, int count)
215 VM_BUG_ON_PAGE(page_count(page) != 0, page);
216 VM_BUG_ON(count == 0);
218 atomic_set(&page->_count, count);
222 extern struct page *__page_cache_alloc(gfp_t gfp);
224 static inline struct page *__page_cache_alloc(gfp_t gfp)
226 return alloc_pages(gfp, 0);
230 static inline struct page *page_cache_alloc(struct address_space *x)
232 return __page_cache_alloc(mapping_gfp_mask(x));
235 static inline struct page *page_cache_alloc_cold(struct address_space *x)
237 return __page_cache_alloc(mapping_gfp_mask(x)|__GFP_COLD);
240 static inline struct page *page_cache_alloc_readahead(struct address_space *x)
242 return __page_cache_alloc(mapping_gfp_mask(x) |
243 __GFP_COLD | __GFP_NORETRY | __GFP_NOWARN);
246 typedef int filler_t(void *, struct page *);
248 pgoff_t page_cache_next_hole(struct address_space *mapping,
249 pgoff_t index, unsigned long max_scan);
250 pgoff_t page_cache_prev_hole(struct address_space *mapping,
251 pgoff_t index, unsigned long max_scan);
253 #define FGP_ACCESSED 0x00000001
254 #define FGP_LOCK 0x00000002
255 #define FGP_CREAT 0x00000004
256 #define FGP_WRITE 0x00000008
257 #define FGP_NOFS 0x00000010
258 #define FGP_NOWAIT 0x00000020
260 struct page *pagecache_get_page(struct address_space *mapping, pgoff_t offset,
261 int fgp_flags, gfp_t cache_gfp_mask);
264 * find_get_page - find and get a page reference
265 * @mapping: the address_space to search
266 * @offset: the page index
268 * Looks up the page cache slot at @mapping & @offset. If there is a
269 * page cache page, it is returned with an increased refcount.
271 * Otherwise, %NULL is returned.
273 static inline struct page *find_get_page(struct address_space *mapping,
276 return pagecache_get_page(mapping, offset, 0, 0);
279 static inline struct page *find_get_page_flags(struct address_space *mapping,
280 pgoff_t offset, int fgp_flags)
282 return pagecache_get_page(mapping, offset, fgp_flags, 0);
286 * find_lock_page - locate, pin and lock a pagecache page
287 * pagecache_get_page - find and get a page reference
288 * @mapping: the address_space to search
289 * @offset: the page index
291 * Looks up the page cache slot at @mapping & @offset. If there is a
292 * page cache page, it is returned locked and with an increased
295 * Otherwise, %NULL is returned.
297 * find_lock_page() may sleep.
299 static inline struct page *find_lock_page(struct address_space *mapping,
302 return pagecache_get_page(mapping, offset, FGP_LOCK, 0);
306 * find_or_create_page - locate or add a pagecache page
307 * @mapping: the page's address_space
308 * @index: the page's index into the mapping
309 * @gfp_mask: page allocation mode
311 * Looks up the page cache slot at @mapping & @offset. If there is a
312 * page cache page, it is returned locked and with an increased
315 * If the page is not present, a new page is allocated using @gfp_mask
316 * and added to the page cache and the VM's LRU list. The page is
317 * returned locked and with an increased refcount.
319 * On memory exhaustion, %NULL is returned.
321 * find_or_create_page() may sleep, even if @gfp_flags specifies an
324 static inline struct page *find_or_create_page(struct address_space *mapping,
325 pgoff_t offset, gfp_t gfp_mask)
327 return pagecache_get_page(mapping, offset,
328 FGP_LOCK|FGP_ACCESSED|FGP_CREAT,
333 * grab_cache_page_nowait - returns locked page at given index in given cache
334 * @mapping: target address_space
335 * @index: the page index
337 * Same as grab_cache_page(), but do not wait if the page is unavailable.
338 * This is intended for speculative data generators, where the data can
339 * be regenerated if the page couldn't be grabbed. This routine should
340 * be safe to call while holding the lock for another page.
342 * Clear __GFP_FS when allocating the page to avoid recursion into the fs
343 * and deadlock against the caller's locked page.
345 static inline struct page *grab_cache_page_nowait(struct address_space *mapping,
348 return pagecache_get_page(mapping, index,
349 FGP_LOCK|FGP_CREAT|FGP_NOFS|FGP_NOWAIT,
350 mapping_gfp_mask(mapping));
353 struct page *find_get_entry(struct address_space *mapping, pgoff_t offset);
354 struct page *find_lock_entry(struct address_space *mapping, pgoff_t offset);
355 unsigned find_get_entries(struct address_space *mapping, pgoff_t start,
356 unsigned int nr_entries, struct page **entries,
358 unsigned find_get_pages(struct address_space *mapping, pgoff_t start,
359 unsigned int nr_pages, struct page **pages);
360 unsigned find_get_pages_contig(struct address_space *mapping, pgoff_t start,
361 unsigned int nr_pages, struct page **pages);
362 unsigned find_get_pages_range_tag(struct address_space *mapping, pgoff_t *index,
363 pgoff_t end, int tag, unsigned int nr_pages,
364 struct page **pages);
365 static inline unsigned find_get_pages_tag(struct address_space *mapping,
366 pgoff_t *index, int tag, unsigned int nr_pages,
369 return find_get_pages_range_tag(mapping, index, (pgoff_t)-1, tag,
373 struct page *grab_cache_page_write_begin(struct address_space *mapping,
374 pgoff_t index, unsigned flags);
377 * Returns locked page at given index in given cache, creating it if needed.
379 static inline struct page *grab_cache_page(struct address_space *mapping,
382 return find_or_create_page(mapping, index, mapping_gfp_mask(mapping));
385 extern struct page * read_cache_page(struct address_space *mapping,
386 pgoff_t index, filler_t *filler, void *data);
387 extern struct page * read_cache_page_gfp(struct address_space *mapping,
388 pgoff_t index, gfp_t gfp_mask);
389 extern int read_cache_pages(struct address_space *mapping,
390 struct list_head *pages, filler_t *filler, void *data);
392 static inline struct page *read_mapping_page(struct address_space *mapping,
393 pgoff_t index, void *data)
395 filler_t *filler = (filler_t *)mapping->a_ops->readpage;
396 return read_cache_page(mapping, index, filler, data);
400 * Get the offset in PAGE_SIZE.
401 * (TODO: hugepage should have ->index in PAGE_SIZE)
403 static inline pgoff_t page_to_pgoff(struct page *page)
405 if (unlikely(PageHeadHuge(page)))
406 return page->index << compound_order(page);
408 return page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
412 * Return byte-offset into filesystem object for page.
414 static inline loff_t page_offset(struct page *page)
416 return ((loff_t)page->index) << PAGE_CACHE_SHIFT;
419 static inline loff_t page_file_offset(struct page *page)
421 return ((loff_t)page_file_index(page)) << PAGE_CACHE_SHIFT;
424 extern pgoff_t linear_hugepage_index(struct vm_area_struct *vma,
425 unsigned long address);
427 static inline pgoff_t linear_page_index(struct vm_area_struct *vma,
428 unsigned long address)
431 if (unlikely(is_vm_hugetlb_page(vma)))
432 return linear_hugepage_index(vma, address);
433 pgoff = (address - vma->vm_start) >> PAGE_SHIFT;
434 pgoff += vma->vm_pgoff;
435 return pgoff >> (PAGE_CACHE_SHIFT - PAGE_SHIFT);
438 extern void __lock_page(struct page *page);
439 extern int __lock_page_killable(struct page *page);
440 extern int __lock_page_or_retry(struct page *page, struct mm_struct *mm,
442 extern void unlock_page(struct page *page);
444 static inline int trylock_page(struct page *page)
446 page = compound_head(page);
447 return (likely(!test_and_set_bit_lock(PG_locked, &page->flags)));
451 * lock_page may only be called if we have the page's inode pinned.
453 static inline void lock_page(struct page *page)
456 if (!trylock_page(page))
461 * lock_page_killable is like lock_page but can be interrupted by fatal
462 * signals. It returns 0 if it locked the page and -EINTR if it was
463 * killed while waiting.
465 static inline int lock_page_killable(struct page *page)
468 if (!trylock_page(page))
469 return __lock_page_killable(page);
474 * lock_page_or_retry - Lock the page, unless this would block and the
475 * caller indicated that it can handle a retry.
477 * Return value and mmap_sem implications depend on flags; see
478 * __lock_page_or_retry().
480 static inline int lock_page_or_retry(struct page *page, struct mm_struct *mm,
484 return trylock_page(page) || __lock_page_or_retry(page, mm, flags);
488 * This is exported only for wait_on_page_locked/wait_on_page_writeback,
489 * and for filesystems which need to wait on PG_private.
491 extern void wait_on_page_bit(struct page *page, int bit_nr);
493 extern int wait_on_page_bit_killable(struct page *page, int bit_nr);
494 extern int wait_on_page_bit_killable_timeout(struct page *page,
495 int bit_nr, unsigned long timeout);
497 static inline int wait_on_page_locked_killable(struct page *page)
499 if (!PageLocked(page))
501 return wait_on_page_bit_killable(compound_head(page), PG_locked);
504 extern wait_queue_head_t *page_waitqueue(struct page *page);
505 static inline void wake_up_page(struct page *page, int bit)
507 __wake_up_bit(page_waitqueue(page), &page->flags, bit);
511 * Wait for a page to be unlocked.
513 * This must be called with the caller "holding" the page,
514 * ie with increased "page->count" so that the page won't
515 * go away during the wait..
517 static inline void wait_on_page_locked(struct page *page)
519 if (PageLocked(page))
520 wait_on_page_bit(compound_head(page), PG_locked);
524 * Wait for a page to complete writeback
526 static inline void wait_on_page_writeback(struct page *page)
528 if (PageWriteback(page))
529 wait_on_page_bit(page, PG_writeback);
532 extern void end_page_writeback(struct page *page);
533 void wait_for_stable_page(struct page *page);
535 void page_endio(struct page *page, int rw, int err);
538 * Add an arbitrary waiter to a page's wait queue
540 extern void add_page_wait_queue(struct page *page, wait_queue_t *waiter);
543 * Fault a userspace page into pagetables. Return non-zero on a fault.
545 * This assumes that two userspace pages are always sufficient. That's
546 * not true if PAGE_CACHE_SIZE > PAGE_SIZE.
548 static inline int fault_in_pages_writeable(char __user *uaddr, int size)
552 if (unlikely(size == 0))
556 * Writing zeroes into userspace here is OK, because we know that if
557 * the zero gets there, we'll be overwriting it.
559 ret = __put_user(0, uaddr);
561 char __user *end = uaddr + size - 1;
564 * If the page was already mapped, this will get a cache miss
565 * for sure, so try to avoid doing it.
567 if (((unsigned long)uaddr & PAGE_MASK) !=
568 ((unsigned long)end & PAGE_MASK))
569 ret = __put_user(0, end);
574 static inline int fault_in_pages_readable(const char __user *uaddr, int size)
579 if (unlikely(size == 0))
582 ret = __get_user(c, uaddr);
584 const char __user *end = uaddr + size - 1;
586 if (((unsigned long)uaddr & PAGE_MASK) !=
587 ((unsigned long)end & PAGE_MASK)) {
588 ret = __get_user(c, end);
596 * Multipage variants of the above prefault helpers, useful if more than
597 * PAGE_SIZE of data needs to be prefaulted. These are separate from the above
598 * functions (which only handle up to PAGE_SIZE) to avoid clobbering the
599 * filemap.c hotpaths.
601 static inline int fault_in_multipages_writeable(char __user *uaddr, int size)
603 char __user *end = uaddr + size - 1;
605 if (unlikely(size == 0))
608 if (unlikely(uaddr > end))
611 * Writing zeroes into userspace here is OK, because we know that if
612 * the zero gets there, we'll be overwriting it.
615 if (unlikely(__put_user(0, uaddr) != 0))
618 } while (uaddr <= end);
620 /* Check whether the range spilled into the next page. */
621 if (((unsigned long)uaddr & PAGE_MASK) ==
622 ((unsigned long)end & PAGE_MASK))
623 return __put_user(0, end);
628 static inline int fault_in_multipages_readable(const char __user *uaddr,
632 const char __user *end = uaddr + size - 1;
634 if (unlikely(size == 0))
637 if (unlikely(uaddr > end))
641 if (unlikely(__get_user(c, uaddr) != 0))
644 } while (uaddr <= end);
646 /* Check whether the range spilled into the next page. */
647 if (((unsigned long)uaddr & PAGE_MASK) ==
648 ((unsigned long)end & PAGE_MASK)) {
649 return __get_user(c, end);
655 int add_to_page_cache_locked(struct page *page, struct address_space *mapping,
656 pgoff_t index, gfp_t gfp_mask);
657 int add_to_page_cache_lru(struct page *page, struct address_space *mapping,
658 pgoff_t index, gfp_t gfp_mask);
659 extern void delete_from_page_cache(struct page *page);
660 extern void __delete_from_page_cache(struct page *page, void *shadow,
661 struct mem_cgroup *memcg);
662 int replace_page_cache_page(struct page *old, struct page *new, gfp_t gfp_mask);
665 * Like add_to_page_cache_locked, but used to add newly allocated pages:
666 * the page is new, so we can just run __SetPageLocked() against it.
668 static inline int add_to_page_cache(struct page *page,
669 struct address_space *mapping, pgoff_t offset, gfp_t gfp_mask)
673 __SetPageLocked(page);
674 error = add_to_page_cache_locked(page, mapping, offset, gfp_mask);
676 __ClearPageLocked(page);
680 static inline unsigned long dir_pages(struct inode *inode)
682 return (unsigned long)(inode->i_size + PAGE_CACHE_SIZE - 1) >>
686 #endif /* _LINUX_PAGEMAP_H */