Loading...
1/*
2 * linux/mm/mlock.c
3 *
4 * (C) Copyright 1995 Linus Torvalds
5 * (C) Copyright 2002 Christoph Hellwig
6 */
7
8#include <linux/capability.h>
9#include <linux/mman.h>
10#include <linux/mm.h>
11#include <linux/swap.h>
12#include <linux/swapops.h>
13#include <linux/pagemap.h>
14#include <linux/pagevec.h>
15#include <linux/mempolicy.h>
16#include <linux/syscalls.h>
17#include <linux/sched.h>
18#include <linux/export.h>
19#include <linux/rmap.h>
20#include <linux/mmzone.h>
21#include <linux/hugetlb.h>
22#include <linux/memcontrol.h>
23#include <linux/mm_inline.h>
24
25#include "internal.h"
26
27bool can_do_mlock(void)
28{
29 if (rlimit(RLIMIT_MEMLOCK) != 0)
30 return true;
31 if (capable(CAP_IPC_LOCK))
32 return true;
33 return false;
34}
35EXPORT_SYMBOL(can_do_mlock);
36
37/*
38 * Mlocked pages are marked with PageMlocked() flag for efficient testing
39 * in vmscan and, possibly, the fault path; and to support semi-accurate
40 * statistics.
41 *
42 * An mlocked page [PageMlocked(page)] is unevictable. As such, it will
43 * be placed on the LRU "unevictable" list, rather than the [in]active lists.
44 * The unevictable list is an LRU sibling list to the [in]active lists.
45 * PageUnevictable is set to indicate the unevictable state.
46 *
47 * When lazy mlocking via vmscan, it is important to ensure that the
48 * vma's VM_LOCKED status is not concurrently being modified, otherwise we
49 * may have mlocked a page that is being munlocked. So lazy mlock must take
50 * the mmap_sem for read, and verify that the vma really is locked
51 * (see mm/rmap.c).
52 */
53
54/*
55 * LRU accounting for clear_page_mlock()
56 */
57void clear_page_mlock(struct page *page)
58{
59 if (!TestClearPageMlocked(page))
60 return;
61
62 mod_zone_page_state(page_zone(page), NR_MLOCK,
63 -hpage_nr_pages(page));
64 count_vm_event(UNEVICTABLE_PGCLEARED);
65 if (!isolate_lru_page(page)) {
66 putback_lru_page(page);
67 } else {
68 /*
69 * We lost the race. the page already moved to evictable list.
70 */
71 if (PageUnevictable(page))
72 count_vm_event(UNEVICTABLE_PGSTRANDED);
73 }
74}
75
76/*
77 * Mark page as mlocked if not already.
78 * If page on LRU, isolate and putback to move to unevictable list.
79 */
80void mlock_vma_page(struct page *page)
81{
82 /* Serialize with page migration */
83 BUG_ON(!PageLocked(page));
84
85 VM_BUG_ON_PAGE(PageTail(page), page);
86 VM_BUG_ON_PAGE(PageCompound(page) && PageDoubleMap(page), page);
87
88 if (!TestSetPageMlocked(page)) {
89 mod_zone_page_state(page_zone(page), NR_MLOCK,
90 hpage_nr_pages(page));
91 count_vm_event(UNEVICTABLE_PGMLOCKED);
92 if (!isolate_lru_page(page))
93 putback_lru_page(page);
94 }
95}
96
97/*
98 * Isolate a page from LRU with optional get_page() pin.
99 * Assumes lru_lock already held and page already pinned.
100 */
101static bool __munlock_isolate_lru_page(struct page *page, bool getpage)
102{
103 if (PageLRU(page)) {
104 struct lruvec *lruvec;
105
106 lruvec = mem_cgroup_page_lruvec(page, page_zone(page));
107 if (getpage)
108 get_page(page);
109 ClearPageLRU(page);
110 del_page_from_lru_list(page, lruvec, page_lru(page));
111 return true;
112 }
113
114 return false;
115}
116
117/*
118 * Finish munlock after successful page isolation
119 *
120 * Page must be locked. This is a wrapper for try_to_munlock()
121 * and putback_lru_page() with munlock accounting.
122 */
123static void __munlock_isolated_page(struct page *page)
124{
125 int ret = SWAP_AGAIN;
126
127 /*
128 * Optimization: if the page was mapped just once, that's our mapping
129 * and we don't need to check all the other vmas.
130 */
131 if (page_mapcount(page) > 1)
132 ret = try_to_munlock(page);
133
134 /* Did try_to_unlock() succeed or punt? */
135 if (ret != SWAP_MLOCK)
136 count_vm_event(UNEVICTABLE_PGMUNLOCKED);
137
138 putback_lru_page(page);
139}
140
141/*
142 * Accounting for page isolation fail during munlock
143 *
144 * Performs accounting when page isolation fails in munlock. There is nothing
145 * else to do because it means some other task has already removed the page
146 * from the LRU. putback_lru_page() will take care of removing the page from
147 * the unevictable list, if necessary. vmscan [page_referenced()] will move
148 * the page back to the unevictable list if some other vma has it mlocked.
149 */
150static void __munlock_isolation_failed(struct page *page)
151{
152 if (PageUnevictable(page))
153 __count_vm_event(UNEVICTABLE_PGSTRANDED);
154 else
155 __count_vm_event(UNEVICTABLE_PGMUNLOCKED);
156}
157
158/**
159 * munlock_vma_page - munlock a vma page
160 * @page - page to be unlocked, either a normal page or THP page head
161 *
162 * returns the size of the page as a page mask (0 for normal page,
163 * HPAGE_PMD_NR - 1 for THP head page)
164 *
165 * called from munlock()/munmap() path with page supposedly on the LRU.
166 * When we munlock a page, because the vma where we found the page is being
167 * munlock()ed or munmap()ed, we want to check whether other vmas hold the
168 * page locked so that we can leave it on the unevictable lru list and not
169 * bother vmscan with it. However, to walk the page's rmap list in
170 * try_to_munlock() we must isolate the page from the LRU. If some other
171 * task has removed the page from the LRU, we won't be able to do that.
172 * So we clear the PageMlocked as we might not get another chance. If we
173 * can't isolate the page, we leave it for putback_lru_page() and vmscan
174 * [page_referenced()/try_to_unmap()] to deal with.
175 */
176unsigned int munlock_vma_page(struct page *page)
177{
178 int nr_pages;
179 struct zone *zone = page_zone(page);
180
181 /* For try_to_munlock() and to serialize with page migration */
182 BUG_ON(!PageLocked(page));
183
184 VM_BUG_ON_PAGE(PageTail(page), page);
185
186 /*
187 * Serialize with any parallel __split_huge_page_refcount() which
188 * might otherwise copy PageMlocked to part of the tail pages before
189 * we clear it in the head page. It also stabilizes hpage_nr_pages().
190 */
191 spin_lock_irq(&zone->lru_lock);
192
193 nr_pages = hpage_nr_pages(page);
194 if (!TestClearPageMlocked(page))
195 goto unlock_out;
196
197 __mod_zone_page_state(zone, NR_MLOCK, -nr_pages);
198
199 if (__munlock_isolate_lru_page(page, true)) {
200 spin_unlock_irq(&zone->lru_lock);
201 __munlock_isolated_page(page);
202 goto out;
203 }
204 __munlock_isolation_failed(page);
205
206unlock_out:
207 spin_unlock_irq(&zone->lru_lock);
208
209out:
210 return nr_pages - 1;
211}
212
213/*
214 * convert get_user_pages() return value to posix mlock() error
215 */
216static int __mlock_posix_error_return(long retval)
217{
218 if (retval == -EFAULT)
219 retval = -ENOMEM;
220 else if (retval == -ENOMEM)
221 retval = -EAGAIN;
222 return retval;
223}
224
225/*
226 * Prepare page for fast batched LRU putback via putback_lru_evictable_pagevec()
227 *
228 * The fast path is available only for evictable pages with single mapping.
229 * Then we can bypass the per-cpu pvec and get better performance.
230 * when mapcount > 1 we need try_to_munlock() which can fail.
231 * when !page_evictable(), we need the full redo logic of putback_lru_page to
232 * avoid leaving evictable page in unevictable list.
233 *
234 * In case of success, @page is added to @pvec and @pgrescued is incremented
235 * in case that the page was previously unevictable. @page is also unlocked.
236 */
237static bool __putback_lru_fast_prepare(struct page *page, struct pagevec *pvec,
238 int *pgrescued)
239{
240 VM_BUG_ON_PAGE(PageLRU(page), page);
241 VM_BUG_ON_PAGE(!PageLocked(page), page);
242
243 if (page_mapcount(page) <= 1 && page_evictable(page)) {
244 pagevec_add(pvec, page);
245 if (TestClearPageUnevictable(page))
246 (*pgrescued)++;
247 unlock_page(page);
248 return true;
249 }
250
251 return false;
252}
253
254/*
255 * Putback multiple evictable pages to the LRU
256 *
257 * Batched putback of evictable pages that bypasses the per-cpu pvec. Some of
258 * the pages might have meanwhile become unevictable but that is OK.
259 */
260static void __putback_lru_fast(struct pagevec *pvec, int pgrescued)
261{
262 count_vm_events(UNEVICTABLE_PGMUNLOCKED, pagevec_count(pvec));
263 /*
264 *__pagevec_lru_add() calls release_pages() so we don't call
265 * put_page() explicitly
266 */
267 __pagevec_lru_add(pvec);
268 count_vm_events(UNEVICTABLE_PGRESCUED, pgrescued);
269}
270
271/*
272 * Munlock a batch of pages from the same zone
273 *
274 * The work is split to two main phases. First phase clears the Mlocked flag
275 * and attempts to isolate the pages, all under a single zone lru lock.
276 * The second phase finishes the munlock only for pages where isolation
277 * succeeded.
278 *
279 * Note that the pagevec may be modified during the process.
280 */
281static void __munlock_pagevec(struct pagevec *pvec, struct zone *zone)
282{
283 int i;
284 int nr = pagevec_count(pvec);
285 int delta_munlocked;
286 struct pagevec pvec_putback;
287 int pgrescued = 0;
288
289 pagevec_init(&pvec_putback, 0);
290
291 /* Phase 1: page isolation */
292 spin_lock_irq(&zone->lru_lock);
293 for (i = 0; i < nr; i++) {
294 struct page *page = pvec->pages[i];
295
296 if (TestClearPageMlocked(page)) {
297 /*
298 * We already have pin from follow_page_mask()
299 * so we can spare the get_page() here.
300 */
301 if (__munlock_isolate_lru_page(page, false))
302 continue;
303 else
304 __munlock_isolation_failed(page);
305 }
306
307 /*
308 * We won't be munlocking this page in the next phase
309 * but we still need to release the follow_page_mask()
310 * pin. We cannot do it under lru_lock however. If it's
311 * the last pin, __page_cache_release() would deadlock.
312 */
313 pagevec_add(&pvec_putback, pvec->pages[i]);
314 pvec->pages[i] = NULL;
315 }
316 delta_munlocked = -nr + pagevec_count(&pvec_putback);
317 __mod_zone_page_state(zone, NR_MLOCK, delta_munlocked);
318 spin_unlock_irq(&zone->lru_lock);
319
320 /* Now we can release pins of pages that we are not munlocking */
321 pagevec_release(&pvec_putback);
322
323 /* Phase 2: page munlock */
324 for (i = 0; i < nr; i++) {
325 struct page *page = pvec->pages[i];
326
327 if (page) {
328 lock_page(page);
329 if (!__putback_lru_fast_prepare(page, &pvec_putback,
330 &pgrescued)) {
331 /*
332 * Slow path. We don't want to lose the last
333 * pin before unlock_page()
334 */
335 get_page(page); /* for putback_lru_page() */
336 __munlock_isolated_page(page);
337 unlock_page(page);
338 put_page(page); /* from follow_page_mask() */
339 }
340 }
341 }
342
343 /*
344 * Phase 3: page putback for pages that qualified for the fast path
345 * This will also call put_page() to return pin from follow_page_mask()
346 */
347 if (pagevec_count(&pvec_putback))
348 __putback_lru_fast(&pvec_putback, pgrescued);
349}
350
351/*
352 * Fill up pagevec for __munlock_pagevec using pte walk
353 *
354 * The function expects that the struct page corresponding to @start address is
355 * a non-TPH page already pinned and in the @pvec, and that it belongs to @zone.
356 *
357 * The rest of @pvec is filled by subsequent pages within the same pmd and same
358 * zone, as long as the pte's are present and vm_normal_page() succeeds. These
359 * pages also get pinned.
360 *
361 * Returns the address of the next page that should be scanned. This equals
362 * @start + PAGE_SIZE when no page could be added by the pte walk.
363 */
364static unsigned long __munlock_pagevec_fill(struct pagevec *pvec,
365 struct vm_area_struct *vma, int zoneid, unsigned long start,
366 unsigned long end)
367{
368 pte_t *pte;
369 spinlock_t *ptl;
370
371 /*
372 * Initialize pte walk starting at the already pinned page where we
373 * are sure that there is a pte, as it was pinned under the same
374 * mmap_sem write op.
375 */
376 pte = get_locked_pte(vma->vm_mm, start, &ptl);
377 /* Make sure we do not cross the page table boundary */
378 end = pgd_addr_end(start, end);
379 end = pud_addr_end(start, end);
380 end = pmd_addr_end(start, end);
381
382 /* The page next to the pinned page is the first we will try to get */
383 start += PAGE_SIZE;
384 while (start < end) {
385 struct page *page = NULL;
386 pte++;
387 if (pte_present(*pte))
388 page = vm_normal_page(vma, start, *pte);
389 /*
390 * Break if page could not be obtained or the page's node+zone does not
391 * match
392 */
393 if (!page || page_zone_id(page) != zoneid)
394 break;
395
396 /*
397 * Do not use pagevec for PTE-mapped THP,
398 * munlock_vma_pages_range() will handle them.
399 */
400 if (PageTransCompound(page))
401 break;
402
403 get_page(page);
404 /*
405 * Increase the address that will be returned *before* the
406 * eventual break due to pvec becoming full by adding the page
407 */
408 start += PAGE_SIZE;
409 if (pagevec_add(pvec, page) == 0)
410 break;
411 }
412 pte_unmap_unlock(pte, ptl);
413 return start;
414}
415
416/*
417 * munlock_vma_pages_range() - munlock all pages in the vma range.'
418 * @vma - vma containing range to be munlock()ed.
419 * @start - start address in @vma of the range
420 * @end - end of range in @vma.
421 *
422 * For mremap(), munmap() and exit().
423 *
424 * Called with @vma VM_LOCKED.
425 *
426 * Returns with VM_LOCKED cleared. Callers must be prepared to
427 * deal with this.
428 *
429 * We don't save and restore VM_LOCKED here because pages are
430 * still on lru. In unmap path, pages might be scanned by reclaim
431 * and re-mlocked by try_to_{munlock|unmap} before we unmap and
432 * free them. This will result in freeing mlocked pages.
433 */
434void munlock_vma_pages_range(struct vm_area_struct *vma,
435 unsigned long start, unsigned long end)
436{
437 vma->vm_flags &= VM_LOCKED_CLEAR_MASK;
438
439 while (start < end) {
440 struct page *page;
441 unsigned int page_mask;
442 unsigned long page_increm;
443 struct pagevec pvec;
444 struct zone *zone;
445 int zoneid;
446
447 pagevec_init(&pvec, 0);
448 /*
449 * Although FOLL_DUMP is intended for get_dump_page(),
450 * it just so happens that its special treatment of the
451 * ZERO_PAGE (returning an error instead of doing get_page)
452 * suits munlock very well (and if somehow an abnormal page
453 * has sneaked into the range, we won't oops here: great).
454 */
455 page = follow_page_mask(vma, start, FOLL_GET | FOLL_DUMP,
456 &page_mask);
457
458 if (page && !IS_ERR(page)) {
459 if (PageTransTail(page)) {
460 VM_BUG_ON_PAGE(PageMlocked(page), page);
461 put_page(page); /* follow_page_mask() */
462 } else if (PageTransHuge(page)) {
463 lock_page(page);
464 /*
465 * Any THP page found by follow_page_mask() may
466 * have gotten split before reaching
467 * munlock_vma_page(), so we need to recompute
468 * the page_mask here.
469 */
470 page_mask = munlock_vma_page(page);
471 unlock_page(page);
472 put_page(page); /* follow_page_mask() */
473 } else {
474 /*
475 * Non-huge pages are handled in batches via
476 * pagevec. The pin from follow_page_mask()
477 * prevents them from collapsing by THP.
478 */
479 pagevec_add(&pvec, page);
480 zone = page_zone(page);
481 zoneid = page_zone_id(page);
482
483 /*
484 * Try to fill the rest of pagevec using fast
485 * pte walk. This will also update start to
486 * the next page to process. Then munlock the
487 * pagevec.
488 */
489 start = __munlock_pagevec_fill(&pvec, vma,
490 zoneid, start, end);
491 __munlock_pagevec(&pvec, zone);
492 goto next;
493 }
494 }
495 page_increm = 1 + page_mask;
496 start += page_increm * PAGE_SIZE;
497next:
498 cond_resched();
499 }
500}
501
502/*
503 * mlock_fixup - handle mlock[all]/munlock[all] requests.
504 *
505 * Filters out "special" vmas -- VM_LOCKED never gets set for these, and
506 * munlock is a no-op. However, for some special vmas, we go ahead and
507 * populate the ptes.
508 *
509 * For vmas that pass the filters, merge/split as appropriate.
510 */
511static int mlock_fixup(struct vm_area_struct *vma, struct vm_area_struct **prev,
512 unsigned long start, unsigned long end, vm_flags_t newflags)
513{
514 struct mm_struct *mm = vma->vm_mm;
515 pgoff_t pgoff;
516 int nr_pages;
517 int ret = 0;
518 int lock = !!(newflags & VM_LOCKED);
519
520 if (newflags == vma->vm_flags || (vma->vm_flags & VM_SPECIAL) ||
521 is_vm_hugetlb_page(vma) || vma == get_gate_vma(current->mm))
522 /* don't set VM_LOCKED or VM_LOCKONFAULT and don't count */
523 goto out;
524
525 pgoff = vma->vm_pgoff + ((start - vma->vm_start) >> PAGE_SHIFT);
526 *prev = vma_merge(mm, *prev, start, end, newflags, vma->anon_vma,
527 vma->vm_file, pgoff, vma_policy(vma),
528 vma->vm_userfaultfd_ctx);
529 if (*prev) {
530 vma = *prev;
531 goto success;
532 }
533
534 if (start != vma->vm_start) {
535 ret = split_vma(mm, vma, start, 1);
536 if (ret)
537 goto out;
538 }
539
540 if (end != vma->vm_end) {
541 ret = split_vma(mm, vma, end, 0);
542 if (ret)
543 goto out;
544 }
545
546success:
547 /*
548 * Keep track of amount of locked VM.
549 */
550 nr_pages = (end - start) >> PAGE_SHIFT;
551 if (!lock)
552 nr_pages = -nr_pages;
553 mm->locked_vm += nr_pages;
554
555 /*
556 * vm_flags is protected by the mmap_sem held in write mode.
557 * It's okay if try_to_unmap_one unmaps a page just after we
558 * set VM_LOCKED, populate_vma_page_range will bring it back.
559 */
560
561 if (lock)
562 vma->vm_flags = newflags;
563 else
564 munlock_vma_pages_range(vma, start, end);
565
566out:
567 *prev = vma;
568 return ret;
569}
570
571static int apply_vma_lock_flags(unsigned long start, size_t len,
572 vm_flags_t flags)
573{
574 unsigned long nstart, end, tmp;
575 struct vm_area_struct * vma, * prev;
576 int error;
577
578 VM_BUG_ON(offset_in_page(start));
579 VM_BUG_ON(len != PAGE_ALIGN(len));
580 end = start + len;
581 if (end < start)
582 return -EINVAL;
583 if (end == start)
584 return 0;
585 vma = find_vma(current->mm, start);
586 if (!vma || vma->vm_start > start)
587 return -ENOMEM;
588
589 prev = vma->vm_prev;
590 if (start > vma->vm_start)
591 prev = vma;
592
593 for (nstart = start ; ; ) {
594 vm_flags_t newflags = vma->vm_flags & VM_LOCKED_CLEAR_MASK;
595
596 newflags |= flags;
597
598 /* Here we know that vma->vm_start <= nstart < vma->vm_end. */
599 tmp = vma->vm_end;
600 if (tmp > end)
601 tmp = end;
602 error = mlock_fixup(vma, &prev, nstart, tmp, newflags);
603 if (error)
604 break;
605 nstart = tmp;
606 if (nstart < prev->vm_end)
607 nstart = prev->vm_end;
608 if (nstart >= end)
609 break;
610
611 vma = prev->vm_next;
612 if (!vma || vma->vm_start != nstart) {
613 error = -ENOMEM;
614 break;
615 }
616 }
617 return error;
618}
619
620static int do_mlock(unsigned long start, size_t len, vm_flags_t flags)
621{
622 unsigned long locked;
623 unsigned long lock_limit;
624 int error = -ENOMEM;
625
626 if (!can_do_mlock())
627 return -EPERM;
628
629 lru_add_drain_all(); /* flush pagevec */
630
631 len = PAGE_ALIGN(len + (offset_in_page(start)));
632 start &= PAGE_MASK;
633
634 lock_limit = rlimit(RLIMIT_MEMLOCK);
635 lock_limit >>= PAGE_SHIFT;
636 locked = len >> PAGE_SHIFT;
637
638 down_write(¤t->mm->mmap_sem);
639
640 locked += current->mm->locked_vm;
641
642 /* check against resource limits */
643 if ((locked <= lock_limit) || capable(CAP_IPC_LOCK))
644 error = apply_vma_lock_flags(start, len, flags);
645
646 up_write(¤t->mm->mmap_sem);
647 if (error)
648 return error;
649
650 error = __mm_populate(start, len, 0);
651 if (error)
652 return __mlock_posix_error_return(error);
653 return 0;
654}
655
656SYSCALL_DEFINE2(mlock, unsigned long, start, size_t, len)
657{
658 return do_mlock(start, len, VM_LOCKED);
659}
660
661SYSCALL_DEFINE3(mlock2, unsigned long, start, size_t, len, int, flags)
662{
663 vm_flags_t vm_flags = VM_LOCKED;
664
665 if (flags & ~MLOCK_ONFAULT)
666 return -EINVAL;
667
668 if (flags & MLOCK_ONFAULT)
669 vm_flags |= VM_LOCKONFAULT;
670
671 return do_mlock(start, len, vm_flags);
672}
673
674SYSCALL_DEFINE2(munlock, unsigned long, start, size_t, len)
675{
676 int ret;
677
678 len = PAGE_ALIGN(len + (offset_in_page(start)));
679 start &= PAGE_MASK;
680
681 down_write(¤t->mm->mmap_sem);
682 ret = apply_vma_lock_flags(start, len, 0);
683 up_write(¤t->mm->mmap_sem);
684
685 return ret;
686}
687
688/*
689 * Take the MCL_* flags passed into mlockall (or 0 if called from munlockall)
690 * and translate into the appropriate modifications to mm->def_flags and/or the
691 * flags for all current VMAs.
692 *
693 * There are a couple of subtleties with this. If mlockall() is called multiple
694 * times with different flags, the values do not necessarily stack. If mlockall
695 * is called once including the MCL_FUTURE flag and then a second time without
696 * it, VM_LOCKED and VM_LOCKONFAULT will be cleared from mm->def_flags.
697 */
698static int apply_mlockall_flags(int flags)
699{
700 struct vm_area_struct * vma, * prev = NULL;
701 vm_flags_t to_add = 0;
702
703 current->mm->def_flags &= VM_LOCKED_CLEAR_MASK;
704 if (flags & MCL_FUTURE) {
705 current->mm->def_flags |= VM_LOCKED;
706
707 if (flags & MCL_ONFAULT)
708 current->mm->def_flags |= VM_LOCKONFAULT;
709
710 if (!(flags & MCL_CURRENT))
711 goto out;
712 }
713
714 if (flags & MCL_CURRENT) {
715 to_add |= VM_LOCKED;
716 if (flags & MCL_ONFAULT)
717 to_add |= VM_LOCKONFAULT;
718 }
719
720 for (vma = current->mm->mmap; vma ; vma = prev->vm_next) {
721 vm_flags_t newflags;
722
723 newflags = vma->vm_flags & VM_LOCKED_CLEAR_MASK;
724 newflags |= to_add;
725
726 /* Ignore errors */
727 mlock_fixup(vma, &prev, vma->vm_start, vma->vm_end, newflags);
728 cond_resched_rcu_qs();
729 }
730out:
731 return 0;
732}
733
734SYSCALL_DEFINE1(mlockall, int, flags)
735{
736 unsigned long lock_limit;
737 int ret;
738
739 if (!flags || (flags & ~(MCL_CURRENT | MCL_FUTURE | MCL_ONFAULT)))
740 return -EINVAL;
741
742 if (!can_do_mlock())
743 return -EPERM;
744
745 if (flags & MCL_CURRENT)
746 lru_add_drain_all(); /* flush pagevec */
747
748 lock_limit = rlimit(RLIMIT_MEMLOCK);
749 lock_limit >>= PAGE_SHIFT;
750
751 ret = -ENOMEM;
752 down_write(¤t->mm->mmap_sem);
753
754 if (!(flags & MCL_CURRENT) || (current->mm->total_vm <= lock_limit) ||
755 capable(CAP_IPC_LOCK))
756 ret = apply_mlockall_flags(flags);
757 up_write(¤t->mm->mmap_sem);
758 if (!ret && (flags & MCL_CURRENT))
759 mm_populate(0, TASK_SIZE);
760
761 return ret;
762}
763
764SYSCALL_DEFINE0(munlockall)
765{
766 int ret;
767
768 down_write(¤t->mm->mmap_sem);
769 ret = apply_mlockall_flags(0);
770 up_write(¤t->mm->mmap_sem);
771 return ret;
772}
773
774/*
775 * Objects with different lifetime than processes (SHM_LOCK and SHM_HUGETLB
776 * shm segments) get accounted against the user_struct instead.
777 */
778static DEFINE_SPINLOCK(shmlock_user_lock);
779
780int user_shm_lock(size_t size, struct user_struct *user)
781{
782 unsigned long lock_limit, locked;
783 int allowed = 0;
784
785 locked = (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
786 lock_limit = rlimit(RLIMIT_MEMLOCK);
787 if (lock_limit == RLIM_INFINITY)
788 allowed = 1;
789 lock_limit >>= PAGE_SHIFT;
790 spin_lock(&shmlock_user_lock);
791 if (!allowed &&
792 locked + user->locked_shm > lock_limit && !capable(CAP_IPC_LOCK))
793 goto out;
794 get_uid(user);
795 user->locked_shm += locked;
796 allowed = 1;
797out:
798 spin_unlock(&shmlock_user_lock);
799 return allowed;
800}
801
802void user_shm_unlock(size_t size, struct user_struct *user)
803{
804 spin_lock(&shmlock_user_lock);
805 user->locked_shm -= (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
806 spin_unlock(&shmlock_user_lock);
807 free_uid(user);
808}
1/*
2 * linux/mm/mlock.c
3 *
4 * (C) Copyright 1995 Linus Torvalds
5 * (C) Copyright 2002 Christoph Hellwig
6 */
7
8#include <linux/capability.h>
9#include <linux/mman.h>
10#include <linux/mm.h>
11#include <linux/swap.h>
12#include <linux/swapops.h>
13#include <linux/pagemap.h>
14#include <linux/pagevec.h>
15#include <linux/mempolicy.h>
16#include <linux/syscalls.h>
17#include <linux/sched.h>
18#include <linux/export.h>
19#include <linux/rmap.h>
20#include <linux/mmzone.h>
21#include <linux/hugetlb.h>
22#include <linux/memcontrol.h>
23#include <linux/mm_inline.h>
24
25#include "internal.h"
26
27int can_do_mlock(void)
28{
29 if (capable(CAP_IPC_LOCK))
30 return 1;
31 if (rlimit(RLIMIT_MEMLOCK) != 0)
32 return 1;
33 return 0;
34}
35EXPORT_SYMBOL(can_do_mlock);
36
37/*
38 * Mlocked pages are marked with PageMlocked() flag for efficient testing
39 * in vmscan and, possibly, the fault path; and to support semi-accurate
40 * statistics.
41 *
42 * An mlocked page [PageMlocked(page)] is unevictable. As such, it will
43 * be placed on the LRU "unevictable" list, rather than the [in]active lists.
44 * The unevictable list is an LRU sibling list to the [in]active lists.
45 * PageUnevictable is set to indicate the unevictable state.
46 *
47 * When lazy mlocking via vmscan, it is important to ensure that the
48 * vma's VM_LOCKED status is not concurrently being modified, otherwise we
49 * may have mlocked a page that is being munlocked. So lazy mlock must take
50 * the mmap_sem for read, and verify that the vma really is locked
51 * (see mm/rmap.c).
52 */
53
54/*
55 * LRU accounting for clear_page_mlock()
56 */
57void clear_page_mlock(struct page *page)
58{
59 if (!TestClearPageMlocked(page))
60 return;
61
62 mod_zone_page_state(page_zone(page), NR_MLOCK,
63 -hpage_nr_pages(page));
64 count_vm_event(UNEVICTABLE_PGCLEARED);
65 if (!isolate_lru_page(page)) {
66 putback_lru_page(page);
67 } else {
68 /*
69 * We lost the race. the page already moved to evictable list.
70 */
71 if (PageUnevictable(page))
72 count_vm_event(UNEVICTABLE_PGSTRANDED);
73 }
74}
75
76/*
77 * Mark page as mlocked if not already.
78 * If page on LRU, isolate and putback to move to unevictable list.
79 */
80void mlock_vma_page(struct page *page)
81{
82 /* Serialize with page migration */
83 BUG_ON(!PageLocked(page));
84
85 if (!TestSetPageMlocked(page)) {
86 mod_zone_page_state(page_zone(page), NR_MLOCK,
87 hpage_nr_pages(page));
88 count_vm_event(UNEVICTABLE_PGMLOCKED);
89 if (!isolate_lru_page(page))
90 putback_lru_page(page);
91 }
92}
93
94/*
95 * Isolate a page from LRU with optional get_page() pin.
96 * Assumes lru_lock already held and page already pinned.
97 */
98static bool __munlock_isolate_lru_page(struct page *page, bool getpage)
99{
100 if (PageLRU(page)) {
101 struct lruvec *lruvec;
102
103 lruvec = mem_cgroup_page_lruvec(page, page_zone(page));
104 if (getpage)
105 get_page(page);
106 ClearPageLRU(page);
107 del_page_from_lru_list(page, lruvec, page_lru(page));
108 return true;
109 }
110
111 return false;
112}
113
114/*
115 * Finish munlock after successful page isolation
116 *
117 * Page must be locked. This is a wrapper for try_to_munlock()
118 * and putback_lru_page() with munlock accounting.
119 */
120static void __munlock_isolated_page(struct page *page)
121{
122 int ret = SWAP_AGAIN;
123
124 /*
125 * Optimization: if the page was mapped just once, that's our mapping
126 * and we don't need to check all the other vmas.
127 */
128 if (page_mapcount(page) > 1)
129 ret = try_to_munlock(page);
130
131 /* Did try_to_unlock() succeed or punt? */
132 if (ret != SWAP_MLOCK)
133 count_vm_event(UNEVICTABLE_PGMUNLOCKED);
134
135 putback_lru_page(page);
136}
137
138/*
139 * Accounting for page isolation fail during munlock
140 *
141 * Performs accounting when page isolation fails in munlock. There is nothing
142 * else to do because it means some other task has already removed the page
143 * from the LRU. putback_lru_page() will take care of removing the page from
144 * the unevictable list, if necessary. vmscan [page_referenced()] will move
145 * the page back to the unevictable list if some other vma has it mlocked.
146 */
147static void __munlock_isolation_failed(struct page *page)
148{
149 if (PageUnevictable(page))
150 __count_vm_event(UNEVICTABLE_PGSTRANDED);
151 else
152 __count_vm_event(UNEVICTABLE_PGMUNLOCKED);
153}
154
155/**
156 * munlock_vma_page - munlock a vma page
157 * @page - page to be unlocked, either a normal page or THP page head
158 *
159 * returns the size of the page as a page mask (0 for normal page,
160 * HPAGE_PMD_NR - 1 for THP head page)
161 *
162 * called from munlock()/munmap() path with page supposedly on the LRU.
163 * When we munlock a page, because the vma where we found the page is being
164 * munlock()ed or munmap()ed, we want to check whether other vmas hold the
165 * page locked so that we can leave it on the unevictable lru list and not
166 * bother vmscan with it. However, to walk the page's rmap list in
167 * try_to_munlock() we must isolate the page from the LRU. If some other
168 * task has removed the page from the LRU, we won't be able to do that.
169 * So we clear the PageMlocked as we might not get another chance. If we
170 * can't isolate the page, we leave it for putback_lru_page() and vmscan
171 * [page_referenced()/try_to_unmap()] to deal with.
172 */
173unsigned int munlock_vma_page(struct page *page)
174{
175 unsigned int nr_pages;
176 struct zone *zone = page_zone(page);
177
178 /* For try_to_munlock() and to serialize with page migration */
179 BUG_ON(!PageLocked(page));
180
181 /*
182 * Serialize with any parallel __split_huge_page_refcount() which
183 * might otherwise copy PageMlocked to part of the tail pages before
184 * we clear it in the head page. It also stabilizes hpage_nr_pages().
185 */
186 spin_lock_irq(&zone->lru_lock);
187
188 nr_pages = hpage_nr_pages(page);
189 if (!TestClearPageMlocked(page))
190 goto unlock_out;
191
192 __mod_zone_page_state(zone, NR_MLOCK, -nr_pages);
193
194 if (__munlock_isolate_lru_page(page, true)) {
195 spin_unlock_irq(&zone->lru_lock);
196 __munlock_isolated_page(page);
197 goto out;
198 }
199 __munlock_isolation_failed(page);
200
201unlock_out:
202 spin_unlock_irq(&zone->lru_lock);
203
204out:
205 return nr_pages - 1;
206}
207
208/**
209 * __mlock_vma_pages_range() - mlock a range of pages in the vma.
210 * @vma: target vma
211 * @start: start address
212 * @end: end address
213 *
214 * This takes care of making the pages present too.
215 *
216 * return 0 on success, negative error code on error.
217 *
218 * vma->vm_mm->mmap_sem must be held for at least read.
219 */
220long __mlock_vma_pages_range(struct vm_area_struct *vma,
221 unsigned long start, unsigned long end, int *nonblocking)
222{
223 struct mm_struct *mm = vma->vm_mm;
224 unsigned long nr_pages = (end - start) / PAGE_SIZE;
225 int gup_flags;
226
227 VM_BUG_ON(start & ~PAGE_MASK);
228 VM_BUG_ON(end & ~PAGE_MASK);
229 VM_BUG_ON(start < vma->vm_start);
230 VM_BUG_ON(end > vma->vm_end);
231 VM_BUG_ON(!rwsem_is_locked(&mm->mmap_sem));
232
233 gup_flags = FOLL_TOUCH | FOLL_MLOCK;
234 /*
235 * We want to touch writable mappings with a write fault in order
236 * to break COW, except for shared mappings because these don't COW
237 * and we would not want to dirty them for nothing.
238 */
239 if ((vma->vm_flags & (VM_WRITE | VM_SHARED)) == VM_WRITE)
240 gup_flags |= FOLL_WRITE;
241
242 /*
243 * We want mlock to succeed for regions that have any permissions
244 * other than PROT_NONE.
245 */
246 if (vma->vm_flags & (VM_READ | VM_WRITE | VM_EXEC))
247 gup_flags |= FOLL_FORCE;
248
249 /*
250 * We made sure addr is within a VMA, so the following will
251 * not result in a stack expansion that recurses back here.
252 */
253 return __get_user_pages(current, mm, start, nr_pages, gup_flags,
254 NULL, NULL, nonblocking);
255}
256
257/*
258 * convert get_user_pages() return value to posix mlock() error
259 */
260static int __mlock_posix_error_return(long retval)
261{
262 if (retval == -EFAULT)
263 retval = -ENOMEM;
264 else if (retval == -ENOMEM)
265 retval = -EAGAIN;
266 return retval;
267}
268
269/*
270 * Prepare page for fast batched LRU putback via putback_lru_evictable_pagevec()
271 *
272 * The fast path is available only for evictable pages with single mapping.
273 * Then we can bypass the per-cpu pvec and get better performance.
274 * when mapcount > 1 we need try_to_munlock() which can fail.
275 * when !page_evictable(), we need the full redo logic of putback_lru_page to
276 * avoid leaving evictable page in unevictable list.
277 *
278 * In case of success, @page is added to @pvec and @pgrescued is incremented
279 * in case that the page was previously unevictable. @page is also unlocked.
280 */
281static bool __putback_lru_fast_prepare(struct page *page, struct pagevec *pvec,
282 int *pgrescued)
283{
284 VM_BUG_ON_PAGE(PageLRU(page), page);
285 VM_BUG_ON_PAGE(!PageLocked(page), page);
286
287 if (page_mapcount(page) <= 1 && page_evictable(page)) {
288 pagevec_add(pvec, page);
289 if (TestClearPageUnevictable(page))
290 (*pgrescued)++;
291 unlock_page(page);
292 return true;
293 }
294
295 return false;
296}
297
298/*
299 * Putback multiple evictable pages to the LRU
300 *
301 * Batched putback of evictable pages that bypasses the per-cpu pvec. Some of
302 * the pages might have meanwhile become unevictable but that is OK.
303 */
304static void __putback_lru_fast(struct pagevec *pvec, int pgrescued)
305{
306 count_vm_events(UNEVICTABLE_PGMUNLOCKED, pagevec_count(pvec));
307 /*
308 *__pagevec_lru_add() calls release_pages() so we don't call
309 * put_page() explicitly
310 */
311 __pagevec_lru_add(pvec);
312 count_vm_events(UNEVICTABLE_PGRESCUED, pgrescued);
313}
314
315/*
316 * Munlock a batch of pages from the same zone
317 *
318 * The work is split to two main phases. First phase clears the Mlocked flag
319 * and attempts to isolate the pages, all under a single zone lru lock.
320 * The second phase finishes the munlock only for pages where isolation
321 * succeeded.
322 *
323 * Note that the pagevec may be modified during the process.
324 */
325static void __munlock_pagevec(struct pagevec *pvec, struct zone *zone)
326{
327 int i;
328 int nr = pagevec_count(pvec);
329 int delta_munlocked;
330 struct pagevec pvec_putback;
331 int pgrescued = 0;
332
333 pagevec_init(&pvec_putback, 0);
334
335 /* Phase 1: page isolation */
336 spin_lock_irq(&zone->lru_lock);
337 for (i = 0; i < nr; i++) {
338 struct page *page = pvec->pages[i];
339
340 if (TestClearPageMlocked(page)) {
341 /*
342 * We already have pin from follow_page_mask()
343 * so we can spare the get_page() here.
344 */
345 if (__munlock_isolate_lru_page(page, false))
346 continue;
347 else
348 __munlock_isolation_failed(page);
349 }
350
351 /*
352 * We won't be munlocking this page in the next phase
353 * but we still need to release the follow_page_mask()
354 * pin. We cannot do it under lru_lock however. If it's
355 * the last pin, __page_cache_release() would deadlock.
356 */
357 pagevec_add(&pvec_putback, pvec->pages[i]);
358 pvec->pages[i] = NULL;
359 }
360 delta_munlocked = -nr + pagevec_count(&pvec_putback);
361 __mod_zone_page_state(zone, NR_MLOCK, delta_munlocked);
362 spin_unlock_irq(&zone->lru_lock);
363
364 /* Now we can release pins of pages that we are not munlocking */
365 pagevec_release(&pvec_putback);
366
367 /* Phase 2: page munlock */
368 for (i = 0; i < nr; i++) {
369 struct page *page = pvec->pages[i];
370
371 if (page) {
372 lock_page(page);
373 if (!__putback_lru_fast_prepare(page, &pvec_putback,
374 &pgrescued)) {
375 /*
376 * Slow path. We don't want to lose the last
377 * pin before unlock_page()
378 */
379 get_page(page); /* for putback_lru_page() */
380 __munlock_isolated_page(page);
381 unlock_page(page);
382 put_page(page); /* from follow_page_mask() */
383 }
384 }
385 }
386
387 /*
388 * Phase 3: page putback for pages that qualified for the fast path
389 * This will also call put_page() to return pin from follow_page_mask()
390 */
391 if (pagevec_count(&pvec_putback))
392 __putback_lru_fast(&pvec_putback, pgrescued);
393}
394
395/*
396 * Fill up pagevec for __munlock_pagevec using pte walk
397 *
398 * The function expects that the struct page corresponding to @start address is
399 * a non-TPH page already pinned and in the @pvec, and that it belongs to @zone.
400 *
401 * The rest of @pvec is filled by subsequent pages within the same pmd and same
402 * zone, as long as the pte's are present and vm_normal_page() succeeds. These
403 * pages also get pinned.
404 *
405 * Returns the address of the next page that should be scanned. This equals
406 * @start + PAGE_SIZE when no page could be added by the pte walk.
407 */
408static unsigned long __munlock_pagevec_fill(struct pagevec *pvec,
409 struct vm_area_struct *vma, int zoneid, unsigned long start,
410 unsigned long end)
411{
412 pte_t *pte;
413 spinlock_t *ptl;
414
415 /*
416 * Initialize pte walk starting at the already pinned page where we
417 * are sure that there is a pte, as it was pinned under the same
418 * mmap_sem write op.
419 */
420 pte = get_locked_pte(vma->vm_mm, start, &ptl);
421 /* Make sure we do not cross the page table boundary */
422 end = pgd_addr_end(start, end);
423 end = pud_addr_end(start, end);
424 end = pmd_addr_end(start, end);
425
426 /* The page next to the pinned page is the first we will try to get */
427 start += PAGE_SIZE;
428 while (start < end) {
429 struct page *page = NULL;
430 pte++;
431 if (pte_present(*pte))
432 page = vm_normal_page(vma, start, *pte);
433 /*
434 * Break if page could not be obtained or the page's node+zone does not
435 * match
436 */
437 if (!page || page_zone_id(page) != zoneid)
438 break;
439
440 get_page(page);
441 /*
442 * Increase the address that will be returned *before* the
443 * eventual break due to pvec becoming full by adding the page
444 */
445 start += PAGE_SIZE;
446 if (pagevec_add(pvec, page) == 0)
447 break;
448 }
449 pte_unmap_unlock(pte, ptl);
450 return start;
451}
452
453/*
454 * munlock_vma_pages_range() - munlock all pages in the vma range.'
455 * @vma - vma containing range to be munlock()ed.
456 * @start - start address in @vma of the range
457 * @end - end of range in @vma.
458 *
459 * For mremap(), munmap() and exit().
460 *
461 * Called with @vma VM_LOCKED.
462 *
463 * Returns with VM_LOCKED cleared. Callers must be prepared to
464 * deal with this.
465 *
466 * We don't save and restore VM_LOCKED here because pages are
467 * still on lru. In unmap path, pages might be scanned by reclaim
468 * and re-mlocked by try_to_{munlock|unmap} before we unmap and
469 * free them. This will result in freeing mlocked pages.
470 */
471void munlock_vma_pages_range(struct vm_area_struct *vma,
472 unsigned long start, unsigned long end)
473{
474 vma->vm_flags &= ~VM_LOCKED;
475
476 while (start < end) {
477 struct page *page = NULL;
478 unsigned int page_mask;
479 unsigned long page_increm;
480 struct pagevec pvec;
481 struct zone *zone;
482 int zoneid;
483
484 pagevec_init(&pvec, 0);
485 /*
486 * Although FOLL_DUMP is intended for get_dump_page(),
487 * it just so happens that its special treatment of the
488 * ZERO_PAGE (returning an error instead of doing get_page)
489 * suits munlock very well (and if somehow an abnormal page
490 * has sneaked into the range, we won't oops here: great).
491 */
492 page = follow_page_mask(vma, start, FOLL_GET | FOLL_DUMP,
493 &page_mask);
494
495 if (page && !IS_ERR(page)) {
496 if (PageTransHuge(page)) {
497 lock_page(page);
498 /*
499 * Any THP page found by follow_page_mask() may
500 * have gotten split before reaching
501 * munlock_vma_page(), so we need to recompute
502 * the page_mask here.
503 */
504 page_mask = munlock_vma_page(page);
505 unlock_page(page);
506 put_page(page); /* follow_page_mask() */
507 } else {
508 /*
509 * Non-huge pages are handled in batches via
510 * pagevec. The pin from follow_page_mask()
511 * prevents them from collapsing by THP.
512 */
513 pagevec_add(&pvec, page);
514 zone = page_zone(page);
515 zoneid = page_zone_id(page);
516
517 /*
518 * Try to fill the rest of pagevec using fast
519 * pte walk. This will also update start to
520 * the next page to process. Then munlock the
521 * pagevec.
522 */
523 start = __munlock_pagevec_fill(&pvec, vma,
524 zoneid, start, end);
525 __munlock_pagevec(&pvec, zone);
526 goto next;
527 }
528 }
529 /* It's a bug to munlock in the middle of a THP page */
530 VM_BUG_ON((start >> PAGE_SHIFT) & page_mask);
531 page_increm = 1 + page_mask;
532 start += page_increm * PAGE_SIZE;
533next:
534 cond_resched();
535 }
536}
537
538/*
539 * mlock_fixup - handle mlock[all]/munlock[all] requests.
540 *
541 * Filters out "special" vmas -- VM_LOCKED never gets set for these, and
542 * munlock is a no-op. However, for some special vmas, we go ahead and
543 * populate the ptes.
544 *
545 * For vmas that pass the filters, merge/split as appropriate.
546 */
547static int mlock_fixup(struct vm_area_struct *vma, struct vm_area_struct **prev,
548 unsigned long start, unsigned long end, vm_flags_t newflags)
549{
550 struct mm_struct *mm = vma->vm_mm;
551 pgoff_t pgoff;
552 int nr_pages;
553 int ret = 0;
554 int lock = !!(newflags & VM_LOCKED);
555
556 if (newflags == vma->vm_flags || (vma->vm_flags & VM_SPECIAL) ||
557 is_vm_hugetlb_page(vma) || vma == get_gate_vma(current->mm))
558 goto out; /* don't set VM_LOCKED, don't count */
559
560 pgoff = vma->vm_pgoff + ((start - vma->vm_start) >> PAGE_SHIFT);
561 *prev = vma_merge(mm, *prev, start, end, newflags, vma->anon_vma,
562 vma->vm_file, pgoff, vma_policy(vma));
563 if (*prev) {
564 vma = *prev;
565 goto success;
566 }
567
568 if (start != vma->vm_start) {
569 ret = split_vma(mm, vma, start, 1);
570 if (ret)
571 goto out;
572 }
573
574 if (end != vma->vm_end) {
575 ret = split_vma(mm, vma, end, 0);
576 if (ret)
577 goto out;
578 }
579
580success:
581 /*
582 * Keep track of amount of locked VM.
583 */
584 nr_pages = (end - start) >> PAGE_SHIFT;
585 if (!lock)
586 nr_pages = -nr_pages;
587 mm->locked_vm += nr_pages;
588
589 /*
590 * vm_flags is protected by the mmap_sem held in write mode.
591 * It's okay if try_to_unmap_one unmaps a page just after we
592 * set VM_LOCKED, __mlock_vma_pages_range will bring it back.
593 */
594
595 if (lock)
596 vma->vm_flags = newflags;
597 else
598 munlock_vma_pages_range(vma, start, end);
599
600out:
601 *prev = vma;
602 return ret;
603}
604
605static int do_mlock(unsigned long start, size_t len, int on)
606{
607 unsigned long nstart, end, tmp;
608 struct vm_area_struct * vma, * prev;
609 int error;
610
611 VM_BUG_ON(start & ~PAGE_MASK);
612 VM_BUG_ON(len != PAGE_ALIGN(len));
613 end = start + len;
614 if (end < start)
615 return -EINVAL;
616 if (end == start)
617 return 0;
618 vma = find_vma(current->mm, start);
619 if (!vma || vma->vm_start > start)
620 return -ENOMEM;
621
622 prev = vma->vm_prev;
623 if (start > vma->vm_start)
624 prev = vma;
625
626 for (nstart = start ; ; ) {
627 vm_flags_t newflags;
628
629 /* Here we know that vma->vm_start <= nstart < vma->vm_end. */
630
631 newflags = vma->vm_flags & ~VM_LOCKED;
632 if (on)
633 newflags |= VM_LOCKED;
634
635 tmp = vma->vm_end;
636 if (tmp > end)
637 tmp = end;
638 error = mlock_fixup(vma, &prev, nstart, tmp, newflags);
639 if (error)
640 break;
641 nstart = tmp;
642 if (nstart < prev->vm_end)
643 nstart = prev->vm_end;
644 if (nstart >= end)
645 break;
646
647 vma = prev->vm_next;
648 if (!vma || vma->vm_start != nstart) {
649 error = -ENOMEM;
650 break;
651 }
652 }
653 return error;
654}
655
656/*
657 * __mm_populate - populate and/or mlock pages within a range of address space.
658 *
659 * This is used to implement mlock() and the MAP_POPULATE / MAP_LOCKED mmap
660 * flags. VMAs must be already marked with the desired vm_flags, and
661 * mmap_sem must not be held.
662 */
663int __mm_populate(unsigned long start, unsigned long len, int ignore_errors)
664{
665 struct mm_struct *mm = current->mm;
666 unsigned long end, nstart, nend;
667 struct vm_area_struct *vma = NULL;
668 int locked = 0;
669 long ret = 0;
670
671 VM_BUG_ON(start & ~PAGE_MASK);
672 VM_BUG_ON(len != PAGE_ALIGN(len));
673 end = start + len;
674
675 for (nstart = start; nstart < end; nstart = nend) {
676 /*
677 * We want to fault in pages for [nstart; end) address range.
678 * Find first corresponding VMA.
679 */
680 if (!locked) {
681 locked = 1;
682 down_read(&mm->mmap_sem);
683 vma = find_vma(mm, nstart);
684 } else if (nstart >= vma->vm_end)
685 vma = vma->vm_next;
686 if (!vma || vma->vm_start >= end)
687 break;
688 /*
689 * Set [nstart; nend) to intersection of desired address
690 * range with the first VMA. Also, skip undesirable VMA types.
691 */
692 nend = min(end, vma->vm_end);
693 if (vma->vm_flags & (VM_IO | VM_PFNMAP))
694 continue;
695 if (nstart < vma->vm_start)
696 nstart = vma->vm_start;
697 /*
698 * Now fault in a range of pages. __mlock_vma_pages_range()
699 * double checks the vma flags, so that it won't mlock pages
700 * if the vma was already munlocked.
701 */
702 ret = __mlock_vma_pages_range(vma, nstart, nend, &locked);
703 if (ret < 0) {
704 if (ignore_errors) {
705 ret = 0;
706 continue; /* continue at next VMA */
707 }
708 ret = __mlock_posix_error_return(ret);
709 break;
710 }
711 nend = nstart + ret * PAGE_SIZE;
712 ret = 0;
713 }
714 if (locked)
715 up_read(&mm->mmap_sem);
716 return ret; /* 0 or negative error code */
717}
718
719SYSCALL_DEFINE2(mlock, unsigned long, start, size_t, len)
720{
721 unsigned long locked;
722 unsigned long lock_limit;
723 int error = -ENOMEM;
724
725 if (!can_do_mlock())
726 return -EPERM;
727
728 lru_add_drain_all(); /* flush pagevec */
729
730 len = PAGE_ALIGN(len + (start & ~PAGE_MASK));
731 start &= PAGE_MASK;
732
733 lock_limit = rlimit(RLIMIT_MEMLOCK);
734 lock_limit >>= PAGE_SHIFT;
735 locked = len >> PAGE_SHIFT;
736
737 down_write(¤t->mm->mmap_sem);
738
739 locked += current->mm->locked_vm;
740
741 /* check against resource limits */
742 if ((locked <= lock_limit) || capable(CAP_IPC_LOCK))
743 error = do_mlock(start, len, 1);
744
745 up_write(¤t->mm->mmap_sem);
746 if (!error)
747 error = __mm_populate(start, len, 0);
748 return error;
749}
750
751SYSCALL_DEFINE2(munlock, unsigned long, start, size_t, len)
752{
753 int ret;
754
755 len = PAGE_ALIGN(len + (start & ~PAGE_MASK));
756 start &= PAGE_MASK;
757
758 down_write(¤t->mm->mmap_sem);
759 ret = do_mlock(start, len, 0);
760 up_write(¤t->mm->mmap_sem);
761
762 return ret;
763}
764
765static int do_mlockall(int flags)
766{
767 struct vm_area_struct * vma, * prev = NULL;
768
769 if (flags & MCL_FUTURE)
770 current->mm->def_flags |= VM_LOCKED;
771 else
772 current->mm->def_flags &= ~VM_LOCKED;
773 if (flags == MCL_FUTURE)
774 goto out;
775
776 for (vma = current->mm->mmap; vma ; vma = prev->vm_next) {
777 vm_flags_t newflags;
778
779 newflags = vma->vm_flags & ~VM_LOCKED;
780 if (flags & MCL_CURRENT)
781 newflags |= VM_LOCKED;
782
783 /* Ignore errors */
784 mlock_fixup(vma, &prev, vma->vm_start, vma->vm_end, newflags);
785 cond_resched();
786 }
787out:
788 return 0;
789}
790
791SYSCALL_DEFINE1(mlockall, int, flags)
792{
793 unsigned long lock_limit;
794 int ret = -EINVAL;
795
796 if (!flags || (flags & ~(MCL_CURRENT | MCL_FUTURE)))
797 goto out;
798
799 ret = -EPERM;
800 if (!can_do_mlock())
801 goto out;
802
803 if (flags & MCL_CURRENT)
804 lru_add_drain_all(); /* flush pagevec */
805
806 lock_limit = rlimit(RLIMIT_MEMLOCK);
807 lock_limit >>= PAGE_SHIFT;
808
809 ret = -ENOMEM;
810 down_write(¤t->mm->mmap_sem);
811
812 if (!(flags & MCL_CURRENT) || (current->mm->total_vm <= lock_limit) ||
813 capable(CAP_IPC_LOCK))
814 ret = do_mlockall(flags);
815 up_write(¤t->mm->mmap_sem);
816 if (!ret && (flags & MCL_CURRENT))
817 mm_populate(0, TASK_SIZE);
818out:
819 return ret;
820}
821
822SYSCALL_DEFINE0(munlockall)
823{
824 int ret;
825
826 down_write(¤t->mm->mmap_sem);
827 ret = do_mlockall(0);
828 up_write(¤t->mm->mmap_sem);
829 return ret;
830}
831
832/*
833 * Objects with different lifetime than processes (SHM_LOCK and SHM_HUGETLB
834 * shm segments) get accounted against the user_struct instead.
835 */
836static DEFINE_SPINLOCK(shmlock_user_lock);
837
838int user_shm_lock(size_t size, struct user_struct *user)
839{
840 unsigned long lock_limit, locked;
841 int allowed = 0;
842
843 locked = (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
844 lock_limit = rlimit(RLIMIT_MEMLOCK);
845 if (lock_limit == RLIM_INFINITY)
846 allowed = 1;
847 lock_limit >>= PAGE_SHIFT;
848 spin_lock(&shmlock_user_lock);
849 if (!allowed &&
850 locked + user->locked_shm > lock_limit && !capable(CAP_IPC_LOCK))
851 goto out;
852 get_uid(user);
853 user->locked_shm += locked;
854 allowed = 1;
855out:
856 spin_unlock(&shmlock_user_lock);
857 return allowed;
858}
859
860void user_shm_unlock(size_t size, struct user_struct *user)
861{
862 spin_lock(&shmlock_user_lock);
863 user->locked_shm -= (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
864 spin_unlock(&shmlock_user_lock);
865 free_uid(user);
866}