2 * memory management system call shims and definitions
4 * Copyright (c) 2013-15 Stacey D. Son
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, see <http://www.gnu.org/licenses/>.
21 * Copyright (c) 1982, 1986, 1993
22 * The Regents of the University of California. All rights reserved.
24 * Redistribution and use in source and binary forms, with or without
25 * modification, are permitted provided that the following conditions
27 * 1. Redistributions of source code must retain the above copyright
28 * notice, this list of conditions and the following disclaimer.
29 * 2. Redistributions in binary form must reproduce the above copyright
30 * notice, this list of conditions and the following disclaimer in the
31 * documentation and/or other materials provided with the distribution.
32 * 4. Neither the name of the University nor the names of its contributors
33 * may be used to endorse or promote products derived from this software
34 * without specific prior written permission.
36 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
37 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
38 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
39 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
40 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
41 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
42 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
43 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
44 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
45 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
49 #ifndef BSD_USER_BSD_MEM_H
50 #define BSD_USER_BSD_MEM_H
52 #include <sys/types.h>
60 extern struct bsd_shm_regions bsd_shm_regions
[];
61 extern abi_ulong target_brk
;
62 extern abi_ulong initial_target_brk
;
65 static inline abi_long
do_bsd_mmap(void *cpu_env
, abi_long arg1
, abi_long arg2
,
66 abi_long arg3
, abi_long arg4
, abi_long arg5
, abi_long arg6
, abi_long arg7
,
69 if (regpairs_aligned(cpu_env
) != 0) {
73 return get_errno(target_mmap(arg1
, arg2
, arg3
,
74 target_to_host_bitmask(arg4
, mmap_flags_tbl
),
75 arg5
, target_arg64(arg6
, arg7
)));
79 static inline abi_long
do_bsd_munmap(abi_long arg1
, abi_long arg2
)
81 return get_errno(target_munmap(arg1
, arg2
));
85 static inline abi_long
do_bsd_mprotect(abi_long arg1
, abi_long arg2
,
88 return get_errno(target_mprotect(arg1
, arg2
, arg3
));
92 static inline abi_long
do_bsd_msync(abi_long addr
, abi_long len
, abi_long flags
)
94 if (!guest_range_valid_untagged(addr
, len
)) {
95 /* It seems odd, but POSIX wants this to be ENOMEM */
96 return -TARGET_ENOMEM
;
99 return get_errno(msync(g2h_untagged(addr
), len
, flags
));
103 static inline abi_long
do_bsd_mlock(abi_long arg1
, abi_long arg2
)
105 if (!guest_range_valid_untagged(arg1
, arg2
)) {
106 return -TARGET_EINVAL
;
108 return get_errno(mlock(g2h_untagged(arg1
), arg2
));
112 static inline abi_long
do_bsd_munlock(abi_long arg1
, abi_long arg2
)
114 if (!guest_range_valid_untagged(arg1
, arg2
)) {
115 return -TARGET_EINVAL
;
117 return get_errno(munlock(g2h_untagged(arg1
), arg2
));
121 static inline abi_long
do_bsd_mlockall(abi_long arg1
)
123 return get_errno(mlockall(arg1
));
127 static inline abi_long
do_bsd_munlockall(void)
129 return get_errno(munlockall());
133 static inline abi_long
do_bsd_madvise(abi_long arg1
, abi_long arg2
,
138 abi_long start
= arg1
;
139 abi_long len_in
= arg2
;
140 abi_long advice
= arg3
;
142 if (start
& ~TARGET_PAGE_MASK
) {
143 return -TARGET_EINVAL
;
148 len
= TARGET_PAGE_ALIGN(len_in
);
149 if (len
== 0 || !guest_range_valid_untagged(start
, len
)) {
150 return -TARGET_EINVAL
;
154 * Most advice values are hints, so ignoring and returning success is ok.
156 * However, some advice values such as MADV_DONTNEED, are not hints and
157 * need to be emulated.
159 * A straight passthrough for those may not be safe because qemu sometimes
160 * turns private file-backed mappings into anonymous mappings.
161 * If all guest pages have PAGE_PASSTHROUGH set, mappings have the
162 * same semantics for the host as for the guest.
164 * MADV_DONTNEED is passed through, if possible.
165 * If passthrough isn't possible, we nevertheless (wrongly!) return
166 * success, which is broken but some userspace programs fail to work
167 * otherwise. Completely implementing such emulation is quite complicated
173 if (page_check_range(start
, len
, PAGE_PASSTHROUGH
)) {
174 ret
= get_errno(madvise(g2h_untagged(start
), len
, advice
));
176 page_reset_target_data(start
, start
+ len
- 1);
186 static inline abi_long
do_bsd_minherit(abi_long addr
, abi_long len
,
189 return get_errno(minherit(g2h_untagged(addr
), len
, inherit
));
193 static inline abi_long
do_bsd_mincore(abi_ulong target_addr
, abi_ulong len
,
194 abi_ulong target_vec
)
198 abi_ulong vec_len
= DIV_ROUND_UP(len
, TARGET_PAGE_SIZE
);
200 if (!guest_range_valid_untagged(target_addr
, len
)
201 || !page_check_range(target_addr
, len
, PAGE_VALID
)) {
202 return -TARGET_EFAULT
;
205 p
= lock_user(VERIFY_WRITE
, target_vec
, vec_len
, 0);
207 return -TARGET_EFAULT
;
209 ret
= get_errno(mincore(g2h_untagged(target_addr
), len
, p
));
210 unlock_user(p
, target_vec
, vec_len
);
215 #endif /* BSD_USER_BSD_MEM_H */