madvise.c 8.7 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10
/*
 *	linux/mm/madvise.c
 *
 * Copyright (C) 1999  Linus Torvalds
 * Copyright (C) 2002  Christoph Hellwig
 */

#include <linux/mman.h>
#include <linux/pagemap.h>
#include <linux/syscalls.h>
P
Prasanna Meda 已提交
11
#include <linux/mempolicy.h>
L
Linus Torvalds 已提交
12 13 14 15 16 17
#include <linux/hugetlb.h>

/*
 * We can potentially split a vm area into separate
 * areas, each area with its own behavior.
 */
P
Prasanna Meda 已提交
18 19 20
static long madvise_behavior(struct vm_area_struct * vma,
		     struct vm_area_struct **prev,
		     unsigned long start, unsigned long end, int behavior)
L
Linus Torvalds 已提交
21 22 23
{
	struct mm_struct * mm = vma->vm_mm;
	int error = 0;
P
Prasanna Meda 已提交
24
	pgoff_t pgoff;
25
	int new_flags = vma->vm_flags;
26 27

	switch (behavior) {
28 29 30
	case MADV_NORMAL:
		new_flags = new_flags & ~VM_RAND_READ & ~VM_SEQ_READ;
		break;
31
	case MADV_SEQUENTIAL:
32
		new_flags = (new_flags & ~VM_RAND_READ) | VM_SEQ_READ;
33 34
		break;
	case MADV_RANDOM:
35
		new_flags = (new_flags & ~VM_SEQ_READ) | VM_RAND_READ;
36
		break;
37 38 39 40 41
	case MADV_DONTFORK:
		new_flags |= VM_DONTCOPY;
		break;
	case MADV_DOFORK:
		new_flags &= ~VM_DONTCOPY;
42 43 44
		break;
	}

P
Prasanna Meda 已提交
45 46
	if (new_flags == vma->vm_flags) {
		*prev = vma;
47
		goto out;
P
Prasanna Meda 已提交
48 49 50 51 52 53 54 55 56 57 58
	}

	pgoff = vma->vm_pgoff + ((start - vma->vm_start) >> PAGE_SHIFT);
	*prev = vma_merge(mm, *prev, start, end, new_flags, vma->anon_vma,
				vma->vm_file, pgoff, vma_policy(vma));
	if (*prev) {
		vma = *prev;
		goto success;
	}

	*prev = vma;
L
Linus Torvalds 已提交
59 60 61 62 63 64 65 66 67 68 69 70 71

	if (start != vma->vm_start) {
		error = split_vma(mm, vma, start, 1);
		if (error)
			goto out;
	}

	if (end != vma->vm_end) {
		error = split_vma(mm, vma, end, 0);
		if (error)
			goto out;
	}

72
success:
L
Linus Torvalds 已提交
73 74 75
	/*
	 * vm_flags is protected by the mmap_sem held in write mode.
	 */
76
	vma->vm_flags = new_flags;
L
Linus Torvalds 已提交
77 78 79 80 81 82 83 84 85 86 87

out:
	if (error == -ENOMEM)
		error = -EAGAIN;
	return error;
}

/*
 * Schedule all required I/O operations.  Do not wait for completion.
 */
static long madvise_willneed(struct vm_area_struct * vma,
P
Prasanna Meda 已提交
88
			     struct vm_area_struct ** prev,
L
Linus Torvalds 已提交
89 90 91 92
			     unsigned long start, unsigned long end)
{
	struct file *file = vma->vm_file;

93 94 95
	if (!file)
		return -EBADF;

96 97 98 99 100
	if (file->f_mapping->a_ops->get_xip_page) {
		/* no bad return value, but ignore advice */
		return 0;
	}

P
Prasanna Meda 已提交
101
	*prev = vma;
L
Linus Torvalds 已提交
102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131
	start = ((start - vma->vm_start) >> PAGE_SHIFT) + vma->vm_pgoff;
	if (end > vma->vm_end)
		end = vma->vm_end;
	end = ((end - vma->vm_start) >> PAGE_SHIFT) + vma->vm_pgoff;

	force_page_cache_readahead(file->f_mapping,
			file, start, max_sane_readahead(end - start));
	return 0;
}

/*
 * Application no longer needs these pages.  If the pages are dirty,
 * it's OK to just throw them away.  The app will be more careful about
 * data it wants to keep.  Be sure to free swap resources too.  The
 * zap_page_range call sets things up for refill_inactive to actually free
 * these pages later if no one else has touched them in the meantime,
 * although we could add these pages to a global reuse list for
 * refill_inactive to pick up before reclaiming other pages.
 *
 * NB: This interface discards data rather than pushes it out to swap,
 * as some implementations do.  This has performance implications for
 * applications like large transactional databases which want to discard
 * pages in anonymous maps after committing to backing store the data
 * that was kept in them.  There is no reason to write this data out to
 * the swap area if the application is discarding it.
 *
 * An interface that causes the system to free clean pages and flush
 * dirty pages is already available as msync(MS_INVALIDATE).
 */
static long madvise_dontneed(struct vm_area_struct * vma,
P
Prasanna Meda 已提交
132
			     struct vm_area_struct ** prev,
L
Linus Torvalds 已提交
133 134
			     unsigned long start, unsigned long end)
{
P
Prasanna Meda 已提交
135
	*prev = vma;
136
	if (vma->vm_flags & (VM_LOCKED|VM_HUGETLB|VM_PFNMAP))
L
Linus Torvalds 已提交
137 138 139 140 141 142 143 144 145 146 147 148 149
		return -EINVAL;

	if (unlikely(vma->vm_flags & VM_NONLINEAR)) {
		struct zap_details details = {
			.nonlinear_vma = vma,
			.last_index = ULONG_MAX,
		};
		zap_page_range(vma, start, end - start, &details);
	} else
		zap_page_range(vma, start, end - start, NULL);
	return 0;
}

150 151 152 153 154 155 156 157
/*
 * Application wants to free up the pages and associated backing store.
 * This is effectively punching a hole into the middle of a file.
 *
 * NOTE: Currently, only shmfs/tmpfs is supported for this operation.
 * Other filesystems return -ENOSYS.
 */
static long madvise_remove(struct vm_area_struct *vma,
158
				struct vm_area_struct **prev,
159 160 161 162 163
				unsigned long start, unsigned long end)
{
	struct address_space *mapping;
        loff_t offset, endoff;

164 165
	*prev = vma;

166 167 168 169 170 171 172 173
	if (vma->vm_flags & (VM_LOCKED|VM_NONLINEAR|VM_HUGETLB))
		return -EINVAL;

	if (!vma->vm_file || !vma->vm_file->f_mapping
		|| !vma->vm_file->f_mapping->host) {
			return -EINVAL;
	}

174 175 176
	if ((vma->vm_flags & (VM_SHARED|VM_WRITE)) != (VM_SHARED|VM_WRITE))
		return -EACCES;

177 178 179 180 181 182 183 184 185
	mapping = vma->vm_file->f_mapping;

	offset = (loff_t)(start - vma->vm_start)
			+ ((loff_t)vma->vm_pgoff << PAGE_SHIFT);
	endoff = (loff_t)(end - vma->vm_start - 1)
			+ ((loff_t)vma->vm_pgoff << PAGE_SHIFT);
	return  vmtruncate_range(mapping->host, offset, endoff);
}

186 187 188
static long
madvise_vma(struct vm_area_struct *vma, struct vm_area_struct **prev,
		unsigned long start, unsigned long end, int behavior)
L
Linus Torvalds 已提交
189
{
190
	long error;
191

L
Linus Torvalds 已提交
192
	switch (behavior) {
193 194 195 196 197 198
	case MADV_DOFORK:
		if (vma->vm_flags & VM_IO) {
			error = -EINVAL;
			break;
		}
	case MADV_DONTFORK:
L
Linus Torvalds 已提交
199 200 201
	case MADV_NORMAL:
	case MADV_SEQUENTIAL:
	case MADV_RANDOM:
P
Prasanna Meda 已提交
202
		error = madvise_behavior(vma, prev, start, end, behavior);
L
Linus Torvalds 已提交
203
		break;
204
	case MADV_REMOVE:
205
		error = madvise_remove(vma, prev, start, end);
206
		break;
L
Linus Torvalds 已提交
207 208

	case MADV_WILLNEED:
P
Prasanna Meda 已提交
209
		error = madvise_willneed(vma, prev, start, end);
L
Linus Torvalds 已提交
210 211 212
		break;

	case MADV_DONTNEED:
P
Prasanna Meda 已提交
213
		error = madvise_dontneed(vma, prev, start, end);
L
Linus Torvalds 已提交
214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244
		break;

	default:
		error = -EINVAL;
		break;
	}
	return error;
}

/*
 * The madvise(2) system call.
 *
 * Applications can use madvise() to advise the kernel how it should
 * handle paging I/O in this VM area.  The idea is to help the kernel
 * use appropriate read-ahead and caching techniques.  The information
 * provided is advisory only, and can be safely disregarded by the
 * kernel without affecting the correct operation of the application.
 *
 * behavior values:
 *  MADV_NORMAL - the default behavior is to read clusters.  This
 *		results in some read-ahead and read-behind.
 *  MADV_RANDOM - the system should read the minimum amount of data
 *		on any access, since it is unlikely that the appli-
 *		cation will need more than what it asks for.
 *  MADV_SEQUENTIAL - pages in the given range will probably be accessed
 *		once, so they can be aggressively read ahead, and
 *		can be freed soon after they are accessed.
 *  MADV_WILLNEED - the application is notifying the system to read
 *		some pages ahead.
 *  MADV_DONTNEED - the application is finished with the given range,
 *		so the kernel can free resources associated with it.
245 246
 *  MADV_REMOVE - the application wants to free up the given range of
 *		pages and associated backing store.
L
Linus Torvalds 已提交
247 248 249 250 251 252 253 254 255 256 257 258 259 260
 *
 * return values:
 *  zero    - success
 *  -EINVAL - start + len < 0, start is not page-aligned,
 *		"behavior" is not a valid value, or application
 *		is attempting to release locked or shared pages.
 *  -ENOMEM - addresses in the specified range are not currently
 *		mapped, or are outside the AS of the process.
 *  -EIO    - an I/O error occurred while paging in data.
 *  -EBADF  - map exists, but area maps something that isn't a file.
 *  -EAGAIN - a kernel resource was temporarily unavailable.
 */
asmlinkage long sys_madvise(unsigned long start, size_t len_in, int behavior)
{
P
Prasanna Meda 已提交
261 262
	unsigned long end, tmp;
	struct vm_area_struct * vma, *prev;
L
Linus Torvalds 已提交
263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287
	int unmapped_error = 0;
	int error = -EINVAL;
	size_t len;

	down_write(&current->mm->mmap_sem);

	if (start & ~PAGE_MASK)
		goto out;
	len = (len_in + ~PAGE_MASK) & PAGE_MASK;

	/* Check to see whether len was rounded up from small -ve to zero */
	if (len_in && !len)
		goto out;

	end = start + len;
	if (end < start)
		goto out;

	error = 0;
	if (end == start)
		goto out;

	/*
	 * If the interval [start,end) covers some unmapped address
	 * ranges, just ignore them, but return -ENOMEM at the end.
P
Prasanna Meda 已提交
288
	 * - different from the way of handling in mlock etc.
L
Linus Torvalds 已提交
289
	 */
P
Prasanna Meda 已提交
290
	vma = find_vma_prev(current->mm, start, &prev);
291 292 293
	if (vma && start > vma->vm_start)
		prev = vma;

L
Linus Torvalds 已提交
294 295 296 297 298 299
	for (;;) {
		/* Still start < end. */
		error = -ENOMEM;
		if (!vma)
			goto out;

P
Prasanna Meda 已提交
300
		/* Here start < (end|vma->vm_end). */
L
Linus Torvalds 已提交
301 302 303
		if (start < vma->vm_start) {
			unmapped_error = -ENOMEM;
			start = vma->vm_start;
P
Prasanna Meda 已提交
304 305
			if (start >= end)
				goto out;
L
Linus Torvalds 已提交
306 307
		}

P
Prasanna Meda 已提交
308 309 310 311
		/* Here vma->vm_start <= start < (end|vma->vm_end) */
		tmp = vma->vm_end;
		if (end < tmp)
			tmp = end;
L
Linus Torvalds 已提交
312

P
Prasanna Meda 已提交
313 314
		/* Here vma->vm_start <= start < tmp <= (end|vma->vm_end). */
		error = madvise_vma(vma, &prev, start, tmp, behavior);
L
Linus Torvalds 已提交
315 316
		if (error)
			goto out;
P
Prasanna Meda 已提交
317 318 319 320 321 322 323
		start = tmp;
		if (start < prev->vm_end)
			start = prev->vm_end;
		error = unmapped_error;
		if (start >= end)
			goto out;
		vma = prev->vm_next;
L
Linus Torvalds 已提交
324 325 326 327 328
	}
out:
	up_write(&current->mm->mmap_sem);
	return error;
}