madvise.c 8.2 KB

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