4 * Copyright (C) 1999 Linus Torvalds
5 * Copyright (C) 2002 Christoph Hellwig
8 #include <linux/mman.h>
9 #include <linux/pagemap.h>
10 #include <linux/syscalls.h>
11 #include <linux/mempolicy.h>
12 #include <linux/hugetlb.h>
13 #include <linux/sched.h>
16 * Any behaviour which results in changes to the vma->vm_flags needs to
17 * take mmap_sem for writing. Others, which simply traverse vmas, need
18 * to only take it for reading.
20 static int madvise_need_mmap_write(int behavior
)
28 /* be safe, default to 1. list exceptions explicitly */
34 * We can potentially split a vm area into separate
35 * areas, each area with its own behavior.
37 static long madvise_behavior(struct vm_area_struct
* vma
,
38 struct vm_area_struct
**prev
,
39 unsigned long start
, unsigned long end
, int behavior
)
41 struct mm_struct
* mm
= vma
->vm_mm
;
44 int new_flags
= vma
->vm_flags
;
48 new_flags
= new_flags
& ~VM_RAND_READ
& ~VM_SEQ_READ
;
51 new_flags
= (new_flags
& ~VM_RAND_READ
) | VM_SEQ_READ
;
54 new_flags
= (new_flags
& ~VM_SEQ_READ
) | VM_RAND_READ
;
57 new_flags
|= VM_DONTCOPY
;
60 new_flags
&= ~VM_DONTCOPY
;
64 if (new_flags
== vma
->vm_flags
) {
69 pgoff
= vma
->vm_pgoff
+ ((start
- vma
->vm_start
) >> PAGE_SHIFT
);
70 *prev
= vma_merge(mm
, *prev
, start
, end
, new_flags
, vma
->anon_vma
,
71 vma
->vm_file
, pgoff
, vma_policy(vma
));
79 if (start
!= vma
->vm_start
) {
80 error
= split_vma(mm
, vma
, start
, 1);
85 if (end
!= vma
->vm_end
) {
86 error
= split_vma(mm
, vma
, end
, 0);
93 * vm_flags is protected by the mmap_sem held in write mode.
95 vma
->vm_flags
= new_flags
;
104 * Schedule all required I/O operations. Do not wait for completion.
106 static long madvise_willneed(struct vm_area_struct
* vma
,
107 struct vm_area_struct
** prev
,
108 unsigned long start
, unsigned long end
)
110 struct file
*file
= vma
->vm_file
;
116 * Page cache readahead assumes page cache pages are order-0 which
117 * is not the case for hugetlbfs. Do not give a bad return value
118 * but ignore the advice.
120 if (vma
->vm_flags
& VM_HUGETLB
)
123 if (file
->f_mapping
->a_ops
->get_xip_mem
) {
124 /* no bad return value, but ignore advice */
129 start
= ((start
- vma
->vm_start
) >> PAGE_SHIFT
) + vma
->vm_pgoff
;
130 if (end
> vma
->vm_end
)
132 end
= ((end
- vma
->vm_start
) >> PAGE_SHIFT
) + vma
->vm_pgoff
;
134 force_page_cache_readahead(file
->f_mapping
,
135 file
, start
, max_sane_readahead(end
- start
));
140 * Application no longer needs these pages. If the pages are dirty,
141 * it's OK to just throw them away. The app will be more careful about
142 * data it wants to keep. Be sure to free swap resources too. The
143 * zap_page_range call sets things up for shrink_active_list to actually free
144 * these pages later if no one else has touched them in the meantime,
145 * although we could add these pages to a global reuse list for
146 * shrink_active_list to pick up before reclaiming other pages.
148 * NB: This interface discards data rather than pushes it out to swap,
149 * as some implementations do. This has performance implications for
150 * applications like large transactional databases which want to discard
151 * pages in anonymous maps after committing to backing store the data
152 * that was kept in them. There is no reason to write this data out to
153 * the swap area if the application is discarding it.
155 * An interface that causes the system to free clean pages and flush
156 * dirty pages is already available as msync(MS_INVALIDATE).
158 static long madvise_dontneed(struct vm_area_struct
* vma
,
159 struct vm_area_struct
** prev
,
160 unsigned long start
, unsigned long end
)
163 if (vma
->vm_flags
& (VM_LOCKED
|VM_HUGETLB
|VM_PFNMAP
))
166 if (unlikely(vma
->vm_flags
& VM_NONLINEAR
)) {
167 struct zap_details details
= {
168 .nonlinear_vma
= vma
,
169 .last_index
= ULONG_MAX
,
171 zap_page_range(vma
, start
, end
- start
, &details
);
173 zap_page_range(vma
, start
, end
- start
, NULL
);
178 * Application wants to free up the pages and associated backing store.
179 * This is effectively punching a hole into the middle of a file.
181 * NOTE: Currently, only shmfs/tmpfs is supported for this operation.
182 * Other filesystems return -ENOSYS.
184 static long madvise_remove(struct vm_area_struct
*vma
,
185 struct vm_area_struct
**prev
,
186 unsigned long start
, unsigned long end
)
188 struct address_space
*mapping
;
189 loff_t offset
, endoff
;
192 *prev
= NULL
; /* tell sys_madvise we drop mmap_sem */
194 if (vma
->vm_flags
& (VM_LOCKED
|VM_NONLINEAR
|VM_HUGETLB
))
197 if (!vma
->vm_file
|| !vma
->vm_file
->f_mapping
198 || !vma
->vm_file
->f_mapping
->host
) {
202 if ((vma
->vm_flags
& (VM_SHARED
|VM_WRITE
)) != (VM_SHARED
|VM_WRITE
))
205 mapping
= vma
->vm_file
->f_mapping
;
207 offset
= (loff_t
)(start
- vma
->vm_start
)
208 + ((loff_t
)vma
->vm_pgoff
<< PAGE_SHIFT
);
209 endoff
= (loff_t
)(end
- vma
->vm_start
- 1)
210 + ((loff_t
)vma
->vm_pgoff
<< PAGE_SHIFT
);
212 /* vmtruncate_range needs to take i_mutex and i_alloc_sem */
213 up_read(¤t
->mm
->mmap_sem
);
214 error
= vmtruncate_range(mapping
->host
, offset
, endoff
);
215 down_read(¤t
->mm
->mmap_sem
);
220 madvise_vma(struct vm_area_struct
*vma
, struct vm_area_struct
**prev
,
221 unsigned long start
, unsigned long end
, int behavior
)
227 if (vma
->vm_flags
& VM_IO
) {
233 case MADV_SEQUENTIAL
:
235 error
= madvise_behavior(vma
, prev
, start
, end
, behavior
);
238 error
= madvise_remove(vma
, prev
, start
, end
);
242 error
= madvise_willneed(vma
, prev
, start
, end
);
246 error
= madvise_dontneed(vma
, prev
, start
, end
);
257 * The madvise(2) system call.
259 * Applications can use madvise() to advise the kernel how it should
260 * handle paging I/O in this VM area. The idea is to help the kernel
261 * use appropriate read-ahead and caching techniques. The information
262 * provided is advisory only, and can be safely disregarded by the
263 * kernel without affecting the correct operation of the application.
266 * MADV_NORMAL - the default behavior is to read clusters. This
267 * results in some read-ahead and read-behind.
268 * MADV_RANDOM - the system should read the minimum amount of data
269 * on any access, since it is unlikely that the appli-
270 * cation will need more than what it asks for.
271 * MADV_SEQUENTIAL - pages in the given range will probably be accessed
272 * once, so they can be aggressively read ahead, and
273 * can be freed soon after they are accessed.
274 * MADV_WILLNEED - the application is notifying the system to read
276 * MADV_DONTNEED - the application is finished with the given range,
277 * so the kernel can free resources associated with it.
278 * MADV_REMOVE - the application wants to free up the given range of
279 * pages and associated backing store.
283 * -EINVAL - start + len < 0, start is not page-aligned,
284 * "behavior" is not a valid value, or application
285 * is attempting to release locked or shared pages.
286 * -ENOMEM - addresses in the specified range are not currently
287 * mapped, or are outside the AS of the process.
288 * -EIO - an I/O error occurred while paging in data.
289 * -EBADF - map exists, but area maps something that isn't a file.
290 * -EAGAIN - a kernel resource was temporarily unavailable.
292 SYSCALL_DEFINE3(madvise
, unsigned long, start
, size_t, len_in
, int, behavior
)
294 unsigned long end
, tmp
;
295 struct vm_area_struct
* vma
, *prev
;
296 int unmapped_error
= 0;
301 write
= madvise_need_mmap_write(behavior
);
303 down_write(¤t
->mm
->mmap_sem
);
305 down_read(¤t
->mm
->mmap_sem
);
307 if (start
& ~PAGE_MASK
)
309 len
= (len_in
+ ~PAGE_MASK
) & PAGE_MASK
;
311 /* Check to see whether len was rounded up from small -ve to zero */
324 * If the interval [start,end) covers some unmapped address
325 * ranges, just ignore them, but return -ENOMEM at the end.
326 * - different from the way of handling in mlock etc.
328 vma
= find_vma_prev(current
->mm
, start
, &prev
);
329 if (vma
&& start
> vma
->vm_start
)
333 /* Still start < end. */
338 /* Here start < (end|vma->vm_end). */
339 if (start
< vma
->vm_start
) {
340 unmapped_error
= -ENOMEM
;
341 start
= vma
->vm_start
;
346 /* Here vma->vm_start <= start < (end|vma->vm_end) */
351 /* Here vma->vm_start <= start < tmp <= (end|vma->vm_end). */
352 error
= madvise_vma(vma
, &prev
, start
, tmp
, behavior
);
356 if (prev
&& start
< prev
->vm_end
)
357 start
= prev
->vm_end
;
358 error
= unmapped_error
;
363 else /* madvise_remove dropped mmap_sem */
364 vma
= find_vma(current
->mm
, start
);
368 up_write(¤t
->mm
->mmap_sem
);
370 up_read(¤t
->mm
->mmap_sem
);