1 .\" $NetBSD: mlock.2,v 1.3 1995/06/24 10:42:03 cgd Exp $
4 .\" The Regents of the University of California. All rights reserved.
6 .\" Redistribution and use in source and binary forms, with or without
7 .\" modification, are permitted provided that the following conditions
9 .\" 1. Redistributions of source code must retain the above copyright
10 .\" notice, this list of conditions and the following disclaimer.
11 .\" 2. Redistributions in binary form must reproduce the above copyright
12 .\" notice, this list of conditions and the following disclaimer in the
13 .\" documentation and/or other materials provided with the distribution.
14 .\" 3. All advertising materials mentioning features or use of this software
15 .\" must display the following acknowledgement:
16 .\" This product includes software developed by the University of
17 .\" California, Berkeley and its contributors.
18 .\" 4. Neither the name of the University nor the names of its contributors
19 .\" may be used to endorse or promote products derived from this software
20 .\" without specific prior written permission.
22 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 .\" @(#)mlock.2 8.2 (Berkeley) 12/11/93
42 .Nd lock (unlock) physical pages in memory
44 .Fd #include <sys/types.h>
45 .Fd #include <sys/mman.h>
47 .Fn mlock "caddr_t addr" "size_t len"
49 .Fn munlock "caddr_t addr" "size_t len"
54 locks into memory the physical pages associated with the virtual address
62 call unlocks pages previously locked by one or more
67 parameter should be aligned to a multiple of the page size.
70 parameter is not a multiple of the page size, it will be rounded up
72 The entire range must be allocated.
76 call, the indicated pages will cause neither a non-resident page
77 nor address-translation fault until they are unlocked.
78 They may still cause protection-violation faults or TLB-miss faults on
79 architectures with software-managed TLBs.
80 The physical pages remain in memory until all locked mappings for the pages
82 Multiple processes may have the same physical pages locked via their own
83 virtual address mappings.
84 A single process may likewise have pages multiply-locked via different virtual
85 mappings of the same pages or via nested
87 calls on the same address range.
88 Unlocking is performed explicitly by
90 or implicitly by a call to
92 which deallocates the unmapped address range.
93 Locked mappings are not inherited by the child process after a
96 Since physical memory is a potentially scarce resource, processes are
97 limited in how much they can lock down.
101 a system-wide ``wired pages'' limit and
106 A return value of 0 indicates that the call
107 succeeded and all pages in the range have either been locked or unlocked.
108 A return value of -1 indicates an error occurred and the locked
109 status of all pages in the range remains unchanged.
110 In this case, the global location
112 is set to indicate the error.
118 The address given is not page aligned or the length is negative.
120 Locking the indicated range would exceed either the system or per-process
121 limit for locked memory.
123 Some portion of the indicated address range is not allocated.
124 There was an error faulting/mapping a page.
130 The address given is not page aligned or the length is negative.
132 Some portion of the indicated address range is not allocated.
133 Some portion of the indicated address range is not locked.
144 Unlike The Sun implementation, multiple
146 calls on the same address range require the corresponding number of
148 calls to actually unlock the pages, i.e.
151 This should be considered a consequence of the implementation
154 The per-process resource limit is a limit on the amount of virtual
155 memory locked, while the system-wide limit is for the number of locked
157 Hence a process with two distinct locked mappings of the same physical page
158 counts as 2 pages against the per-process limit and as only a single page
165 functions first appeared in 4.4BSD.