t_mlock.c revision 1.3 1 1.3 martin /* $NetBSD: t_mlock.c,v 1.3 2012/09/07 20:27:12 martin Exp $ */
2 1.1 jruoho
3 1.1 jruoho /*-
4 1.1 jruoho * Copyright (c) 2012 The NetBSD Foundation, Inc.
5 1.1 jruoho * All rights reserved.
6 1.1 jruoho *
7 1.1 jruoho * This code is derived from software contributed to The NetBSD Foundation
8 1.1 jruoho * by Jukka Ruohonen.
9 1.1 jruoho *
10 1.1 jruoho * Redistribution and use in source and binary forms, with or without
11 1.1 jruoho * modification, are permitted provided that the following conditions
12 1.1 jruoho * are met:
13 1.1 jruoho * 1. Redistributions of source code must retain the above copyright
14 1.1 jruoho * notice, this list of conditions and the following disclaimer.
15 1.1 jruoho * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 jruoho * notice, this list of conditions and the following disclaimer in the
17 1.1 jruoho * documentation and/or other materials provided with the distribution.
18 1.1 jruoho *
19 1.1 jruoho * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 jruoho * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 jruoho * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 jruoho * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 jruoho * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 jruoho * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 jruoho * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 jruoho * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 jruoho * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 jruoho * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 jruoho * POSSIBILITY OF SUCH DAMAGE.
30 1.1 jruoho */
31 1.1 jruoho #include <sys/cdefs.h>
32 1.3 martin __RCSID("$NetBSD: t_mlock.c,v 1.3 2012/09/07 20:27:12 martin Exp $");
33 1.1 jruoho
34 1.1 jruoho #include <sys/mman.h>
35 1.1 jruoho #include <sys/resource.h>
36 1.1 jruoho #include <sys/wait.h>
37 1.3 martin #define _KMEMUSER
38 1.3 martin #include <machine/vmparam.h>
39 1.1 jruoho
40 1.1 jruoho #include <errno.h>
41 1.1 jruoho #include <atf-c.h>
42 1.3 martin #include <stdint.h>
43 1.1 jruoho #include <stdio.h>
44 1.1 jruoho #include <stdlib.h>
45 1.1 jruoho #include <unistd.h>
46 1.1 jruoho
47 1.1 jruoho static long page = 0;
48 1.1 jruoho
49 1.1 jruoho ATF_TC(mlock_clip);
50 1.1 jruoho ATF_TC_HEAD(mlock_clip, tc)
51 1.1 jruoho {
52 1.1 jruoho atf_tc_set_md_var(tc, "descr", "Test with mlock(2) that UVM only "
53 1.1 jruoho "clips if the clip address is within the entry (PR kern/44788)");
54 1.1 jruoho }
55 1.1 jruoho
56 1.1 jruoho ATF_TC_BODY(mlock_clip, tc)
57 1.1 jruoho {
58 1.1 jruoho void *buf;
59 1.1 jruoho
60 1.1 jruoho buf = malloc(page);
61 1.1 jruoho ATF_REQUIRE(buf != NULL);
62 1.1 jruoho
63 1.1 jruoho if (page < 1024)
64 1.1 jruoho atf_tc_skip("page size too small");
65 1.1 jruoho
66 1.1 jruoho for (size_t i = page; i >= 1; i = i - 1024) {
67 1.1 jruoho (void)mlock(buf, page - i);
68 1.1 jruoho (void)munlock(buf, page - i);
69 1.1 jruoho }
70 1.1 jruoho
71 1.1 jruoho free(buf);
72 1.1 jruoho }
73 1.1 jruoho
74 1.1 jruoho ATF_TC(mlock_err);
75 1.1 jruoho ATF_TC_HEAD(mlock_err, tc)
76 1.1 jruoho {
77 1.1 jruoho atf_tc_set_md_var(tc, "descr",
78 1.1 jruoho "Test error conditions in mlock(2) and munlock(2)");
79 1.1 jruoho }
80 1.1 jruoho
81 1.1 jruoho ATF_TC_BODY(mlock_err, tc)
82 1.1 jruoho {
83 1.3 martin void *invalid_ptr;
84 1.3 martin int null_errno = ENOMEM; /* error expected for NULL */
85 1.3 martin
86 1.3 martin if ((uintptr_t)VM_MIN_ADDRESS > 0)
87 1.3 martin null_errno = EINVAL; /* NULL is not inside user VM */
88 1.1 jruoho
89 1.1 jruoho errno = 0;
90 1.3 martin ATF_REQUIRE_ERRNO(null_errno, mlock(NULL, page) == -1);
91 1.1 jruoho
92 1.1 jruoho errno = 0;
93 1.3 martin ATF_REQUIRE_ERRNO(null_errno, mlock((char *)0, page) == -1);
94 1.1 jruoho
95 1.1 jruoho errno = 0;
96 1.1 jruoho ATF_REQUIRE_ERRNO(EINVAL, mlock((char *)-1, page) == -1);
97 1.1 jruoho
98 1.1 jruoho errno = 0;
99 1.3 martin ATF_REQUIRE_ERRNO(null_errno, munlock(NULL, page) == -1);
100 1.1 jruoho
101 1.1 jruoho errno = 0;
102 1.3 martin ATF_REQUIRE_ERRNO(null_errno, munlock((char *)0, page) == -1);
103 1.1 jruoho
104 1.1 jruoho errno = 0;
105 1.1 jruoho ATF_REQUIRE_ERRNO(EINVAL, munlock((char *)-1, page) == -1);
106 1.3 martin
107 1.3 martin /*
108 1.3 martin * Try to create a pointer to an unmapped page - first after current
109 1.3 martin * brk will likely do.
110 1.3 martin */
111 1.3 martin invalid_ptr = (void*)(((uintptr_t)sbrk(0)+page) & ~(page-1));
112 1.3 martin printf("testing with (hopefully) invalid pointer %p\n", invalid_ptr);
113 1.3 martin
114 1.3 martin errno = 0;
115 1.3 martin ATF_REQUIRE_ERRNO(ENOMEM, mlock(invalid_ptr, page) == -1);
116 1.3 martin
117 1.3 martin errno = 0;
118 1.3 martin ATF_REQUIRE_ERRNO(ENOMEM, munlock(invalid_ptr, page) == -1);
119 1.1 jruoho }
120 1.1 jruoho
121 1.1 jruoho ATF_TC(mlock_limits);
122 1.1 jruoho ATF_TC_HEAD(mlock_limits, tc)
123 1.1 jruoho {
124 1.1 jruoho atf_tc_set_md_var(tc, "descr", "Test system limits with mlock(2)");
125 1.1 jruoho }
126 1.1 jruoho
127 1.1 jruoho ATF_TC_BODY(mlock_limits, tc)
128 1.1 jruoho {
129 1.1 jruoho struct rlimit res;
130 1.1 jruoho void *buf;
131 1.1 jruoho pid_t pid;
132 1.1 jruoho int sta;
133 1.1 jruoho
134 1.1 jruoho buf = malloc(page);
135 1.1 jruoho ATF_REQUIRE(buf != NULL);
136 1.1 jruoho
137 1.1 jruoho pid = fork();
138 1.1 jruoho ATF_REQUIRE(pid >= 0);
139 1.1 jruoho
140 1.1 jruoho if (pid == 0) {
141 1.1 jruoho
142 1.1 jruoho for (ssize_t i = page; i >= 2; i -= 100) {
143 1.1 jruoho
144 1.1 jruoho res.rlim_cur = i - 1;
145 1.1 jruoho res.rlim_max = i - 1;
146 1.1 jruoho
147 1.1 jruoho (void)fprintf(stderr, "trying to lock %zd bytes "
148 1.1 jruoho "with %zu byte limit\n", i, (size_t)res.rlim_cur);
149 1.1 jruoho
150 1.1 jruoho if (setrlimit(RLIMIT_MEMLOCK, &res) != 0)
151 1.1 jruoho _exit(EXIT_FAILURE);
152 1.1 jruoho
153 1.1 jruoho errno = 0;
154 1.1 jruoho
155 1.1 jruoho if (mlock(buf, i) != -1 || errno != EAGAIN) {
156 1.1 jruoho (void)munlock(buf, i);
157 1.1 jruoho _exit(EXIT_FAILURE);
158 1.1 jruoho }
159 1.1 jruoho }
160 1.1 jruoho
161 1.1 jruoho _exit(EXIT_SUCCESS);
162 1.1 jruoho }
163 1.1 jruoho
164 1.1 jruoho (void)wait(&sta);
165 1.1 jruoho
166 1.1 jruoho if (WIFEXITED(sta) == 0 || WEXITSTATUS(sta) != EXIT_SUCCESS)
167 1.1 jruoho atf_tc_fail("mlock(2) locked beyond system limits");
168 1.1 jruoho
169 1.1 jruoho free(buf);
170 1.1 jruoho }
171 1.1 jruoho
172 1.1 jruoho ATF_TC(mlock_mmap);
173 1.1 jruoho ATF_TC_HEAD(mlock_mmap, tc)
174 1.1 jruoho {
175 1.1 jruoho atf_tc_set_md_var(tc, "descr", "Test mlock(2)-mmap(2) interaction");
176 1.1 jruoho }
177 1.1 jruoho
178 1.1 jruoho ATF_TC_BODY(mlock_mmap, tc)
179 1.1 jruoho {
180 1.1 jruoho static const int flags = MAP_ANON | MAP_PRIVATE | MAP_WIRED;
181 1.1 jruoho void *buf;
182 1.1 jruoho
183 1.1 jruoho /*
184 1.1 jruoho * Make a wired RW mapping and check that mlock(2)
185 1.1 jruoho * does not fail for the (already locked) mapping.
186 1.1 jruoho */
187 1.1 jruoho buf = mmap(NULL, page, PROT_READ | PROT_WRITE, flags, -1, 0);
188 1.1 jruoho
189 1.1 jruoho ATF_REQUIRE(buf != MAP_FAILED);
190 1.1 jruoho ATF_REQUIRE(mlock(buf, page) == 0);
191 1.1 jruoho ATF_REQUIRE(munlock(buf, page) == 0);
192 1.1 jruoho ATF_REQUIRE(munmap(buf, page) == 0);
193 1.1 jruoho ATF_REQUIRE(munlock(buf, page) != 0);
194 1.1 jruoho
195 1.1 jruoho /*
196 1.1 jruoho * But it should be impossible to mlock(2) a PROT_NONE mapping.
197 1.1 jruoho */
198 1.1 jruoho buf = mmap(NULL, page, PROT_NONE, flags, -1, 0);
199 1.1 jruoho
200 1.1 jruoho ATF_REQUIRE(buf != MAP_FAILED);
201 1.1 jruoho ATF_REQUIRE(mlock(buf, page) != 0);
202 1.1 jruoho ATF_REQUIRE(munmap(buf, page) == 0);
203 1.1 jruoho }
204 1.1 jruoho
205 1.1 jruoho ATF_TC(mlock_nested);
206 1.1 jruoho ATF_TC_HEAD(mlock_nested, tc)
207 1.1 jruoho {
208 1.1 jruoho atf_tc_set_md_var(tc, "descr",
209 1.1 jruoho "Test that consecutive mlock(2) calls succeed");
210 1.1 jruoho }
211 1.1 jruoho
212 1.1 jruoho ATF_TC_BODY(mlock_nested, tc)
213 1.1 jruoho {
214 1.1 jruoho const size_t maxiter = 100;
215 1.1 jruoho void *buf;
216 1.1 jruoho
217 1.1 jruoho buf = malloc(page);
218 1.1 jruoho ATF_REQUIRE(buf != NULL);
219 1.1 jruoho
220 1.1 jruoho for (size_t i = 0; i < maxiter; i++)
221 1.1 jruoho ATF_REQUIRE(mlock(buf, page) == 0);
222 1.1 jruoho
223 1.1 jruoho ATF_REQUIRE(munlock(buf, page) == 0);
224 1.1 jruoho free(buf);
225 1.1 jruoho }
226 1.1 jruoho
227 1.1 jruoho ATF_TP_ADD_TCS(tp)
228 1.1 jruoho {
229 1.1 jruoho
230 1.1 jruoho page = sysconf(_SC_PAGESIZE);
231 1.1 jruoho ATF_REQUIRE(page >= 0);
232 1.1 jruoho
233 1.1 jruoho ATF_TP_ADD_TC(tp, mlock_clip);
234 1.1 jruoho ATF_TP_ADD_TC(tp, mlock_err);
235 1.1 jruoho ATF_TP_ADD_TC(tp, mlock_limits);
236 1.1 jruoho ATF_TP_ADD_TC(tp, mlock_mmap);
237 1.1 jruoho ATF_TP_ADD_TC(tp, mlock_nested);
238 1.1 jruoho
239 1.1 jruoho return atf_no_error();
240 1.1 jruoho }
241