mm/madvise.c

   1 /*
   2  *      linux/mm/madvise.c
   3  *
   4  * Copyright (C) 1999  Linus Torvalds
   5  * Copyright (C) 2002  Christoph Hellwig
   6  */
   7
   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>
  14
  15 /*
  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.
  19  */
  20 static int madvise_need_mmap_write(int behavior)
  21 {
  22         switch (behavior) {
  23         case MADV_REMOVE:
  24         case MADV_WILLNEED:
  25         case MADV_DONTNEED:
  26                 return 0;
  27         default:
  28                 /* be safe, default to 1. list exceptions explicitly */
  29                 return 1;
  30         }
  31 }
  32
  33 /*
  34  * We can potentially split a vm area into separate
  35  * areas, each area with its own behavior.
  36  */
  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)
  40 {
  41         struct mm_struct * mm = vma->vm_mm;
  42         int error = 0;
  43         pgoff_t pgoff;
  44         int new_flags = vma->vm_flags;
  45
  46         switch (behavior) {
  47         case MADV_NORMAL:
  48                 new_flags = new_flags & ~VM_RAND_READ & ~VM_SEQ_READ;
  49                 break;
  50         case MADV_SEQUENTIAL:
  51                 new_flags = (new_flags & ~VM_RAND_READ) | VM_SEQ_READ;
  52                 break;
  53         case MADV_RANDOM:
  54                 new_flags = (new_flags & ~VM_SEQ_READ) | VM_RAND_READ;
  55                 break;
  56         case MADV_DONTFORK:
  57                 new_flags |= VM_DONTCOPY;
  58                 break;
  59         case MADV_DOFORK:
  60                 new_flags &= ~VM_DONTCOPY;
  61                 break;
  62         }
  63
  64         if (new_flags == vma->vm_flags) {
  65                 *prev = vma;
  66                 goto out;
  67         }
  68
  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));
  72         if (*prev) {
  73                 vma = *prev;
  74                 goto success;
  75         }
  76
  77         *prev = vma;
  78
  79         if (start != vma->vm_start) {
  80                 error = split_vma(mm, vma, start, 1);
  81                 if (error)
  82                         goto out;
  83         }
  84
  85         if (end != vma->vm_end) {
  86                 error = split_vma(mm, vma, end, 0);
  87                 if (error)
  88                         goto out;
  89         }
  90
  91 success:
  92         /*
  93          * vm_flags is protected by the mmap_sem held in write mode.
  94          */
  95         vma->vm_flags = new_flags;
  96
  97 out:
  98         if (error == -ENOMEM)
  99                 error = -EAGAIN;
 100         return error;
 101 }
 102
 103 /*
 104  * Schedule all required I/O operations.  Do not wait for completion.
 105  */
 106 static long madvise_willneed(struct vm_area_struct * vma,
 107                              struct vm_area_struct ** prev,
 108                              unsigned long start, unsigned long end)
 109 {
 110         struct file *file = vma->vm_file;
 111
 112         if (!file)
 113                 return -EBADF;
 114
 115         if (file->f_mapping->a_ops->get_xip_mem) {
 116                 /* no bad return value, but ignore advice */
 117                 return 0;
 118         }
 119
 120         *prev = vma;
 121         start = ((start - vma->vm_start) >> PAGE_SHIFT) + vma->vm_pgoff;
 122         if (end > vma->vm_end)
 123                 end = vma->vm_end;
 124         end = ((end - vma->vm_start) >> PAGE_SHIFT) + vma->vm_pgoff;
 125
 126         force_page_cache_readahead(file->f_mapping, file, start, end - start);
 127         return 0;
 128 }
 129
 130 /*
 131  * Application no longer needs these pages.  If the pages are dirty,
 132  * it's OK to just throw them away.  The app will be more careful about
 133  * data it wants to keep.  Be sure to free swap resources too.  The
 134  * zap_page_range call sets things up for shrink_active_list to actually free
 135  * these pages later if no one else has touched them in the meantime,
 136  * although we could add these pages to a global reuse list for
 137  * shrink_active_list to pick up before reclaiming other pages.
 138  *
 139  * NB: This interface discards data rather than pushes it out to swap,
 140  * as some implementations do.  This has performance implications for
 141  * applications like large transactional databases which want to discard
 142  * pages in anonymous maps after committing to backing store the data
 143  * that was kept in them.  There is no reason to write this data out to
 144  * the swap area if the application is discarding it.
 145  *
 146  * An interface that causes the system to free clean pages and flush
 147  * dirty pages is already available as msync(MS_INVALIDATE).
 148  */
 149 static long madvise_dontneed(struct vm_area_struct * vma,
 150                              struct vm_area_struct ** prev,
 151                              unsigned long start, unsigned long end)
 152 {
 153         *prev = vma;
 154         if (vma->vm_flags & (VM_LOCKED|VM_HUGETLB|VM_PFNMAP))
 155                 return -EINVAL;
 156
 157         if (unlikely(vma->vm_flags & VM_NONLINEAR)) {
 158                 struct zap_details details = {
 159                         .nonlinear_vma = vma,
 160                         .last_index = ULONG_MAX,
 161                 };
 162                 zap_page_range(vma, start, end - start, &details);
 163         } else
 164                 zap_page_range(vma, start, end - start, NULL);
 165         return 0;
 166 }
 167
 168 /*
 169  * Application wants to free up the pages and associated backing store.
 170  * This is effectively punching a hole into the middle of a file.
 171  *
 172  * NOTE: Currently, only shmfs/tmpfs is supported for this operation.
 173  * Other filesystems return -ENOSYS.
 174  */
 175 static long madvise_remove(struct vm_area_struct *vma,
 176                                 struct vm_area_struct **prev,
 177                                 unsigned long start, unsigned long end)
 178 {
 179         struct address_space *mapping;
 180         loff_t offset, endoff;
 181         int error;
 182
 183         *prev = NULL;   /* tell sys_madvise we drop mmap_sem */
 184
 185         if (vma->vm_flags & (VM_LOCKED|VM_NONLINEAR|VM_HUGETLB))
 186                 return -EINVAL;
 187
 188         if (!vma->vm_file || !vma->vm_file->f_mapping
 189                 || !vma->vm_file->f_mapping->host) {
 190                         return -EINVAL;
 191         }
 192
 193         if ((vma->vm_flags & (VM_SHARED|VM_WRITE)) != (VM_SHARED|VM_WRITE))
 194                 return -EACCES;
 195
 196         mapping = vma->vm_file->f_mapping;
 197
 198         offset = (loff_t)(start - vma->vm_start)
 199                         + ((loff_t)vma->vm_pgoff << PAGE_SHIFT);
 200         endoff = (loff_t)(end - vma->vm_start - 1)
 201                         + ((loff_t)vma->vm_pgoff << PAGE_SHIFT);
 202
 203         /* vmtruncate_range needs to take i_mutex and i_alloc_sem */
 204         up_read(&current->mm->mmap_sem);
 205         error = vmtruncate_range(mapping->host, offset, endoff);
 206         down_read(&current->mm->mmap_sem);
 207         return error;
 208 }
 209
 210 static long
 211 madvise_vma(struct vm_area_struct *vma, struct vm_area_struct **prev,
 212                 unsigned long start, unsigned long end, int behavior)
 213 {
 214         long error;
 215
 216         switch (behavior) {
 217         case MADV_DOFORK:
 218                 if (vma->vm_flags & VM_IO) {
 219                         error = -EINVAL;
 220                         break;
 221                 }
 222         case MADV_DONTFORK:
 223         case MADV_NORMAL:
 224         case MADV_SEQUENTIAL:
 225         case MADV_RANDOM:
 226                 error = madvise_behavior(vma, prev, start, end, behavior);
 227                 break;
 228         case MADV_REMOVE:
 229                 error = madvise_remove(vma, prev, start, end);
 230                 break;
 231
 232         case MADV_WILLNEED:
 233                 error = madvise_willneed(vma, prev, start, end);
 234                 break;
 235
 236         case MADV_DONTNEED:
 237                 error = madvise_dontneed(vma, prev, start, end);
 238                 break;
 239
 240         default:
 241                 error = -EINVAL;
 242                 break;
 243         }
 244         return error;
 245 }
 246
 247 /*
 248  * The madvise(2) system call.
 249  *
 250  * Applications can use madvise() to advise the kernel how it should
 251  * handle paging I/O in this VM area.  The idea is to help the kernel
 252  * use appropriate read-ahead and caching techniques.  The information
 253  * provided is advisory only, and can be safely disregarded by the
 254  * kernel without affecting the correct operation of the application.
 255  *
 256  * behavior values:
 257  *  MADV_NORMAL - the default behavior is to read clusters.  This
 258  *              results in some read-ahead and read-behind.
 259  *  MADV_RANDOM - the system should read the minimum amount of data
 260  *              on any access, since it is unlikely that the appli-
 261  *              cation will need more than what it asks for.
 262  *  MADV_SEQUENTIAL - pages in the given range will probably be accessed
 263  *              once, so they can be aggressively read ahead, and
 264  *              can be freed soon after they are accessed.
 265  *  MADV_WILLNEED - the application is notifying the system to read
 266  *              some pages ahead.
 267  *  MADV_DONTNEED - the application is finished with the given range,
 268  *              so the kernel can free resources associated with it.
 269  *  MADV_REMOVE - the application wants to free up the given range of
 270  *              pages and associated backing store.
 271  *
 272  * return values:
 273  *  zero    - success
 274  *  -EINVAL - start + len < 0, start is not page-aligned,
 275  *              "behavior" is not a valid value, or application
 276  *              is attempting to release locked or shared pages.
 277  *  -ENOMEM - addresses in the specified range are not currently
 278  *              mapped, or are outside the AS of the process.
 279  *  -EIO    - an I/O error occurred while paging in data.
 280  *  -EBADF  - map exists, but area maps something that isn't a file.
 281  *  -EAGAIN - a kernel resource was temporarily unavailable.
 282  */
 283 SYSCALL_DEFINE3(madvise, unsigned long, start, size_t, len_in, int, behavior)
 284 {
 285         unsigned long end, tmp;
 286         struct vm_area_struct * vma, *prev;
 287         int unmapped_error = 0;
 288         int error = -EINVAL;
 289         int write;
 290         size_t len;
 291
 292         write = madvise_need_mmap_write(behavior);
 293         if (write)
 294                 down_write(&current->mm->mmap_sem);
 295         else
 296                 down_read(&current->mm->mmap_sem);
 297
 298         if (start & ~PAGE_MASK)
 299                 goto out;
 300         len = (len_in + ~PAGE_MASK) & PAGE_MASK;
 301
 302         /* Check to see whether len was rounded up from small -ve to zero */
 303         if (len_in && !len)
 304                 goto out;
 305
 306         end = start + len;
 307         if (end < start)
 308                 goto out;
 309
 310         error = 0;
 311         if (end == start)
 312                 goto out;
 313
 314         /*
 315          * If the interval [start,end) covers some unmapped address
 316          * ranges, just ignore them, but return -ENOMEM at the end.
 317          * - different from the way of handling in mlock etc.
 318          */
 319         vma = find_vma_prev(current->mm, start, &prev);
 320         if (vma && start > vma->vm_start)
 321                 prev = vma;
 322
 323         for (;;) {
 324                 /* Still start < end. */
 325                 error = -ENOMEM;
 326                 if (!vma)
 327                         goto out;
 328
 329                 /* Here start < (end|vma->vm_end). */
 330                 if (start < vma->vm_start) {
 331                         unmapped_error = -ENOMEM;
 332                         start = vma->vm_start;
 333                         if (start >= end)
 334                                 goto out;
 335                 }
 336
 337                 /* Here vma->vm_start <= start < (end|vma->vm_end) */
 338                 tmp = vma->vm_end;
 339                 if (end < tmp)
 340                         tmp = end;
 341
 342                 /* Here vma->vm_start <= start < tmp <= (end|vma->vm_end). */
 343                 error = madvise_vma(vma, &prev, start, tmp, behavior);
 344                 if (error)
 345                         goto out;
 346                 start = tmp;
 347                 if (prev && start < prev->vm_end)
 348                         start = prev->vm_end;
 349                 error = unmapped_error;
 350                 if (start >= end)
 351                         goto out;
 352                 if (prev)
 353                         vma = prev->vm_next;
 354                 else    /* madvise_remove dropped mmap_sem */
 355                         vma = find_vma(current->mm, start);
 356         }
 357 out:
 358         if (write)
 359                 up_write(&current->mm->mmap_sem);
 360         else
 361                 up_read(&current->mm->mmap_sem);
 362
 363         return error;
 364 }