1 // SPDX-License-Identifier: GPL-2.0
5 * Copyright (C) 2002, Linus Torvalds
7 * 11Jan2003 Andrew Morton
11 #include <linux/kernel.h>
12 #include <linux/file.h>
15 #include <linux/pagemap.h>
16 #include <linux/backing-dev.h>
17 #include <linux/pagevec.h>
18 #include <linux/fadvise.h>
19 #include <linux/writeback.h>
20 #include <linux/syscalls.h>
21 #include <linux/swap.h>
23 #include <asm/unistd.h>
26 * POSIX_FADV_WILLNEED could set PG_Referenced, and POSIX_FADV_NOREUSE could
27 * deactivate the pages and clear PG_Referenced.
29 SYSCALL_DEFINE4(fadvise64_64
, int, fd
, loff_t
, offset
, loff_t
, len
, int, advice
)
31 struct fd f
= fdget(fd
);
33 struct address_space
*mapping
;
34 struct backing_dev_info
*bdi
;
35 loff_t endbyte
; /* inclusive */
38 unsigned long nrpages
;
44 inode
= file_inode(f
.file
);
45 if (S_ISFIFO(inode
->i_mode
)) {
50 mapping
= f
.file
->f_mapping
;
51 if (!mapping
|| len
< 0) {
56 bdi
= inode_to_bdi(mapping
->host
);
58 if (IS_DAX(inode
) || (bdi
== &noop_backing_dev_info
)) {
60 case POSIX_FADV_NORMAL
:
61 case POSIX_FADV_RANDOM
:
62 case POSIX_FADV_SEQUENTIAL
:
63 case POSIX_FADV_WILLNEED
:
64 case POSIX_FADV_NOREUSE
:
65 case POSIX_FADV_DONTNEED
:
66 /* no bad return value, but ignore advice */
74 /* Careful about overflows. Len == 0 means "as much as possible" */
75 endbyte
= offset
+ len
;
76 if (!len
|| endbyte
< len
)
79 endbyte
--; /* inclusive */
82 case POSIX_FADV_NORMAL
:
83 f
.file
->f_ra
.ra_pages
= bdi
->ra_pages
;
84 spin_lock(&f
.file
->f_lock
);
85 f
.file
->f_mode
&= ~FMODE_RANDOM
;
86 spin_unlock(&f
.file
->f_lock
);
88 case POSIX_FADV_RANDOM
:
89 spin_lock(&f
.file
->f_lock
);
90 f
.file
->f_mode
|= FMODE_RANDOM
;
91 spin_unlock(&f
.file
->f_lock
);
93 case POSIX_FADV_SEQUENTIAL
:
94 f
.file
->f_ra
.ra_pages
= bdi
->ra_pages
* 2;
95 spin_lock(&f
.file
->f_lock
);
96 f
.file
->f_mode
&= ~FMODE_RANDOM
;
97 spin_unlock(&f
.file
->f_lock
);
99 case POSIX_FADV_WILLNEED
:
100 /* First and last PARTIAL page! */
101 start_index
= offset
>> PAGE_SHIFT
;
102 end_index
= endbyte
>> PAGE_SHIFT
;
104 /* Careful about overflow on the "+1" */
105 nrpages
= end_index
- start_index
+ 1;
110 * Ignore return value because fadvise() shall return
111 * success even if filesystem can't retrieve a hint,
113 force_page_cache_readahead(mapping
, f
.file
, start_index
,
116 case POSIX_FADV_NOREUSE
:
118 case POSIX_FADV_DONTNEED
:
119 if (!inode_write_congested(mapping
->host
))
120 __filemap_fdatawrite_range(mapping
, offset
, endbyte
,
124 * First and last FULL page! Partial pages are deliberately
125 * preserved on the expectation that it is better to preserve
126 * needed memory than to discard unneeded memory.
128 start_index
= (offset
+(PAGE_SIZE
-1)) >> PAGE_SHIFT
;
129 end_index
= (endbyte
>> PAGE_SHIFT
);
130 if ((endbyte
& ~PAGE_MASK
) != ~PAGE_MASK
) {
131 /* First page is tricky as 0 - 1 = -1, but pgoff_t
132 * is unsigned, so the end_index >= start_index
133 * check below would be true and we'll discard the whole
134 * file cache which is not what was asked.
142 if (end_index
>= start_index
) {
146 * It's common to FADV_DONTNEED right after
147 * the read or write that instantiates the
148 * pages, in which case there will be some
149 * sitting on the local LRU cache. Try to
150 * avoid the expensive remote drain and the
151 * second cache tree walk below by flushing
152 * them out right away.
156 count
= invalidate_mapping_pages(mapping
,
157 start_index
, end_index
);
160 * If fewer pages were invalidated than expected then
161 * it is possible that some of the pages were on
162 * a per-cpu pagevec for a remote CPU. Drain all
163 * pagevecs and try again.
165 if (count
< (end_index
- start_index
+ 1)) {
167 invalidate_mapping_pages(mapping
, start_index
,
180 #ifdef __ARCH_WANT_SYS_FADVISE64
182 SYSCALL_DEFINE4(fadvise64
, int, fd
, loff_t
, offset
, size_t, len
, int, advice
)
184 return sys_fadvise64_64(fd
, offset
, len
, advice
);