1 /* $OpenBSD: uvm_extern.h,v 1.152 2019/12/12 11:12:36 mpi Exp $ */ 2 /* $NetBSD: uvm_extern.h,v 1.57 2001/03/09 01:02:12 chs Exp $ */ 3 4 /* 5 * Copyright (c) 1997 Charles D. Cranor and Washington University. 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 */ 28 29 /*- 30 * Copyright (c) 1991, 1992, 1993 31 * The Regents of the University of California. All rights reserved. 32 * 33 * Redistribution and use in source and binary forms, with or without 34 * modification, are permitted provided that the following conditions 35 * are met: 36 * 1. Redistributions of source code must retain the above copyright 37 * notice, this list of conditions and the following disclaimer. 38 * 2. Redistributions in binary form must reproduce the above copyright 39 * notice, this list of conditions and the following disclaimer in the 40 * documentation and/or other materials provided with the distribution. 41 * 3. Neither the name of the University nor the names of its contributors 42 * may be used to endorse or promote products derived from this software 43 * without specific prior written permission. 44 * 45 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 46 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 47 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 48 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 49 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 50 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 51 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 52 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 53 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 54 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 55 * SUCH DAMAGE. 56 * 57 * @(#)vm_extern.h 8.5 (Berkeley) 5/3/95 58 */ 59 60 #ifndef _UVM_UVM_EXTERN_H_ 61 #define _UVM_UVM_EXTERN_H_ 62 63 typedef int vm_fault_t; 64 65 typedef int vm_inherit_t; /* XXX: inheritance codes */ 66 typedef off_t voff_t; /* XXX: offset within a uvm_object */ 67 68 struct vm_map_entry; 69 typedef struct vm_map_entry *vm_map_entry_t; 70 71 struct vm_map; 72 typedef struct vm_map *vm_map_t; 73 74 struct vm_page; 75 typedef struct vm_page *vm_page_t; 76 77 /* 78 * Bit assignments assigned by UVM_MAPFLAG() and extracted by 79 * UVM_{PROTECTION,INHERIT,MAXPROTECTION,ADVICE}(): 80 * bits 0-2 protection 81 * bit 3 unused 82 * bits 4-5 inheritance 83 * bits 6-7 unused 84 * bits 8-10 max protection 85 * bit 11 unused 86 * bits 12-14 advice 87 * bit 15 unused 88 * bits 16-N flags 89 */ 90 91 /* protections bits */ 92 #define PROT_MASK (PROT_READ | PROT_WRITE | PROT_EXEC) 93 94 /* inherit codes */ 95 #define MAP_INHERIT_MASK 0x3 /* inherit mask */ 96 97 typedef int vm_prot_t; 98 99 #define MADV_MASK 0x7 /* mask */ 100 101 /* mapping flags */ 102 #define UVM_FLAG_FIXED 0x0010000 /* find space */ 103 #define UVM_FLAG_OVERLAY 0x0020000 /* establish overlay */ 104 #define UVM_FLAG_NOMERGE 0x0040000 /* don't merge map entries */ 105 #define UVM_FLAG_COPYONW 0x0080000 /* set copy_on_write flag */ 106 #define UVM_FLAG_TRYLOCK 0x0100000 /* fail if we can not lock map */ 107 #define UVM_FLAG_HOLE 0x0200000 /* no backend */ 108 #define UVM_FLAG_QUERY 0x0400000 /* do everything, except actual execution */ 109 #define UVM_FLAG_NOFAULT 0x0800000 /* don't fault */ 110 #define UVM_FLAG_UNMAP 0x1000000 /* unmap to make space */ 111 #define UVM_FLAG_STACK 0x2000000 /* page may contain a stack */ 112 #define UVM_FLAG_WC 0x4000000 /* write combining */ 113 #define UVM_FLAG_CONCEAL 0x8000000 /* omit from dumps */ 114 #define UVM_FLAG_SYSCALL 0x10000000 /* system calls allowed */ 115 116 /* macros to extract info */ 117 #define UVM_PROTECTION(X) ((X) & PROT_MASK) 118 #define UVM_INHERIT(X) (((X) >> 4) & MAP_INHERIT_MASK) 119 #define UVM_MAXPROTECTION(X) (((X) >> 8) & PROT_MASK) 120 #define UVM_ADVICE(X) (((X) >> 12) & MADV_MASK) 121 122 #define UVM_MAPFLAG(prot, maxprot, inh, advice, flags) \ 123 ((prot) | ((maxprot) << 8) | ((inh) << 4) | ((advice) << 12) | (flags)) 124 125 /* magic offset value */ 126 #define UVM_UNKNOWN_OFFSET ((voff_t) -1) 127 /* offset not known(obj) or don't care(!obj) */ 128 129 /* 130 * the following defines are for uvm_km_kmemalloc's flags 131 */ 132 #define UVM_KMF_NOWAIT 0x1 /* matches M_NOWAIT */ 133 #define UVM_KMF_VALLOC 0x2 /* allocate VA only */ 134 #define UVM_KMF_CANFAIL 0x4 /* caller handles failure */ 135 #define UVM_KMF_ZERO 0x08 /* zero pages */ 136 #define UVM_KMF_TRYLOCK UVM_FLAG_TRYLOCK /* try locking only */ 137 138 /* 139 * flags for uvm_pagealloc() 140 */ 141 #define UVM_PGA_USERESERVE 0x0001 /* ok to use reserve pages */ 142 #define UVM_PGA_ZERO 0x0002 /* returned page must be zeroed */ 143 144 /* 145 * flags for uvm_pglistalloc() 146 */ 147 #define UVM_PLA_WAITOK 0x0001 /* may sleep */ 148 #define UVM_PLA_NOWAIT 0x0002 /* can't sleep (need one of the two) */ 149 #define UVM_PLA_ZERO 0x0004 /* zero all pages before returning */ 150 #define UVM_PLA_TRYCONTIG 0x0008 /* try to allocate contig physmem */ 151 #define UVM_PLA_FAILOK 0x0010 /* caller can handle failure */ 152 #define UVM_PLA_NOWAKE 0x0020 /* don't wake the page daemon on failure */ 153 154 /* 155 * lockflags that control the locking behavior of various functions. 156 */ 157 #define UVM_LK_ENTER 0x00000001 /* map locked on entry */ 158 #define UVM_LK_EXIT 0x00000002 /* leave map locked on exit */ 159 160 /* 161 * flags to uvm_page_physload. 162 */ 163 #define PHYSLOAD_DEVICE 0x01 /* don't add to the page queue */ 164 165 #include <sys/queue.h> 166 #include <sys/tree.h> 167 #include <sys/mman.h> 168 169 #ifdef _KERNEL 170 struct buf; 171 struct mount; 172 struct pglist; 173 struct vmspace; 174 struct pmap; 175 #endif 176 177 #include <uvm/uvm_param.h> 178 179 #include <uvm/uvm_pmap.h> 180 #include <uvm/uvm_object.h> 181 #include <uvm/uvm_page.h> 182 #include <uvm/uvm_map.h> 183 184 #ifdef _KERNEL 185 #include <uvm/uvm_fault.h> 186 #include <uvm/uvm_pager.h> 187 #endif 188 189 /* 190 * Shareable process virtual address space. 191 * May eventually be merged with vm_map. 192 * Several fields are temporary (text, data stuff). 193 * 194 * Locks used to protect struct members in this file: 195 * I immutable after creation 196 */ 197 struct vmspace { 198 struct vm_map vm_map; /* VM address map */ 199 int vm_refcnt; /* number of references */ 200 caddr_t vm_shm; /* SYS5 shared memory private data XXX */ 201 /* we copy from vm_startcopy to the end of the structure on fork */ 202 #define vm_startcopy vm_rssize 203 segsz_t vm_rssize; /* current resident set size in pages */ 204 segsz_t vm_swrss; /* resident set size before last swap */ 205 segsz_t vm_tsize; /* text size (pages) XXX */ 206 segsz_t vm_dsize; /* data size (pages) XXX */ 207 segsz_t vm_dused; /* data segment length (pages) XXX */ 208 segsz_t vm_ssize; /* stack size (pages) */ 209 caddr_t vm_taddr; /* user virtual address of text XXX */ 210 caddr_t vm_daddr; /* user virtual address of data XXX */ 211 caddr_t vm_maxsaddr; /* [I] user VA at max stack growth */ 212 caddr_t vm_minsaddr; /* [I] user VA at top of stack */ 213 }; 214 215 /* 216 * uvm_constraint_range's: 217 * MD code is allowed to setup constraint ranges for memory allocators, the 218 * primary use for this is to keep allocation for certain memory consumers 219 * such as mbuf pools withing address ranges that are reachable by devices 220 * that perform DMA. 221 * 222 * It is also to discourge memory allocations from being satisfied from ranges 223 * such as the ISA memory range, if they can be satisfied with allocation 224 * from other ranges. 225 * 226 * the MD ranges are defined in arch/ARCH/ARCH/machdep.c 227 */ 228 struct uvm_constraint_range { 229 paddr_t ucr_low; 230 paddr_t ucr_high; 231 }; 232 233 #ifdef _KERNEL 234 235 #include <uvm/uvmexp.h> 236 extern struct uvmexp uvmexp; 237 238 /* Constraint ranges, set by MD code. */ 239 extern struct uvm_constraint_range isa_constraint; 240 extern struct uvm_constraint_range dma_constraint; 241 extern struct uvm_constraint_range no_constraint; 242 extern struct uvm_constraint_range *uvm_md_constraints[]; 243 244 extern struct pool *uvm_aiobuf_pool; 245 246 /* 247 * the various kernel maps, owned by MD code 248 */ 249 extern struct vm_map *exec_map; 250 extern struct vm_map *kernel_map; 251 extern struct vm_map *kmem_map; 252 extern struct vm_map *phys_map; 253 254 /* base of kernel virtual memory */ 255 extern vaddr_t vm_min_kernel_address; 256 257 /* zalloc zeros memory, alloc does not */ 258 #define uvm_km_zalloc(MAP,SIZE) uvm_km_alloc1(MAP,SIZE,0,TRUE) 259 #define uvm_km_alloc(MAP,SIZE) uvm_km_alloc1(MAP,SIZE,0,FALSE) 260 261 #define vm_resident_count(vm) (pmap_resident_count((vm)->vm_map.pmap)) 262 263 struct plimit; 264 265 void vmapbuf(struct buf *, vsize_t); 266 void vunmapbuf(struct buf *, vsize_t); 267 struct uvm_object *uao_create(vsize_t, int); 268 void uao_detach(struct uvm_object *); 269 void uao_detach_locked(struct uvm_object *); 270 void uao_reference(struct uvm_object *); 271 void uao_reference_locked(struct uvm_object *); 272 int uvm_fault(vm_map_t, vaddr_t, vm_fault_t, vm_prot_t); 273 274 vaddr_t uvm_uarea_alloc(void); 275 void uvm_uarea_free(struct proc *); 276 void uvm_exit(struct process *); 277 void uvm_init_limits(struct plimit *); 278 boolean_t uvm_kernacc(caddr_t, size_t, int); 279 280 int uvm_vslock(struct proc *, caddr_t, size_t, 281 vm_prot_t); 282 void uvm_vsunlock(struct proc *, caddr_t, size_t); 283 int uvm_vslock_device(struct proc *, void *, size_t, 284 vm_prot_t, void **); 285 void uvm_vsunlock_device(struct proc *, void *, size_t, 286 void *); 287 void uvm_pause(void); 288 void uvm_init(void); 289 int uvm_io(vm_map_t, struct uio *, int); 290 291 #define UVM_IO_FIXPROT 0x01 292 293 vaddr_t uvm_km_alloc1(vm_map_t, vsize_t, vsize_t, boolean_t); 294 void uvm_km_free(vm_map_t, vaddr_t, vsize_t); 295 void uvm_km_free_wakeup(vm_map_t, vaddr_t, vsize_t); 296 vaddr_t uvm_km_kmemalloc_pla(struct vm_map *, 297 struct uvm_object *, vsize_t, vsize_t, int, 298 paddr_t, paddr_t, paddr_t, paddr_t, int); 299 #define uvm_km_kmemalloc(map, obj, sz, flags) \ 300 uvm_km_kmemalloc_pla(map, obj, sz, 0, flags, 0, (paddr_t)-1, 0, 0, 0) 301 vaddr_t uvm_km_valloc(vm_map_t, vsize_t); 302 vaddr_t uvm_km_valloc_try(vm_map_t, vsize_t); 303 vaddr_t uvm_km_valloc_wait(vm_map_t, vsize_t); 304 vaddr_t uvm_km_valloc_align(struct vm_map *, vsize_t, 305 vsize_t, int); 306 vaddr_t uvm_km_valloc_prefer_wait(vm_map_t, vsize_t, voff_t); 307 struct vm_map *uvm_km_suballoc(vm_map_t, vaddr_t *, vaddr_t *, 308 vsize_t, int, boolean_t, vm_map_t); 309 /* 310 * Allocation mode for virtual space. 311 * 312 * kv_map - pointer to the pointer to the map we're allocating from. 313 * kv_align - alignment. 314 * kv_wait - wait for free space in the map if it's full. The default 315 * allocators don't wait since running out of space in kernel_map and 316 * kmem_map is usually fatal. Special maps like exec_map are specifically 317 * limited, so waiting for space in them is necessary. 318 * kv_singlepage - use the single page allocator. 319 * kv_executable - map the physical pages with PROT_EXEC. 320 */ 321 struct kmem_va_mode { 322 struct vm_map **kv_map; 323 vsize_t kv_align; 324 char kv_wait; 325 char kv_singlepage; 326 }; 327 328 /* 329 * Allocation mode for physical pages. 330 * 331 * kp_constraint - allocation constraint for physical pages. 332 * kp_object - if the pages should be allocated from an object. 333 * kp_align - physical alignment of the first page in the allocation. 334 * kp_boundary - boundary that the physical addresses can't cross if 335 * the allocation is contiguous. 336 * kp_nomem - don't allocate any backing pages. 337 * kp_maxseg - maximal amount of contiguous segments. 338 * kp_zero - zero the returned memory. 339 * kp_pageable - allocate pageable memory. 340 */ 341 struct kmem_pa_mode { 342 struct uvm_constraint_range *kp_constraint; 343 struct uvm_object **kp_object; 344 paddr_t kp_align; 345 paddr_t kp_boundary; 346 int kp_maxseg; 347 char kp_nomem; 348 char kp_zero; 349 char kp_pageable; 350 }; 351 352 /* 353 * Dynamic allocation parameters. Stuff that changes too often or too much 354 * to create separate va and pa modes for. 355 * 356 * kd_waitok - is it ok to sleep? 357 * kd_trylock - don't sleep on map locks. 358 * kd_prefer - offset to feed to PMAP_PREFER 359 * kd_slowdown - special parameter for the singlepage va allocator 360 * that tells the caller to sleep if possible to let the singlepage 361 * allocator catch up. 362 */ 363 struct kmem_dyn_mode { 364 voff_t kd_prefer; 365 int *kd_slowdown; 366 char kd_waitok; 367 char kd_trylock; 368 }; 369 370 #define KMEM_DYN_INITIALIZER { UVM_UNKNOWN_OFFSET, NULL, 0, 0 } 371 372 /* 373 * Notice that for kv_ waiting has a different meaning. It's only supposed 374 * to be used for very space constrained maps where waiting is a way 375 * to throttle some other operation. 376 * The exception is kv_page which needs to wait relatively often. 377 * All kv_ except kv_intrsafe will potentially sleep. 378 */ 379 extern const struct kmem_va_mode kv_any; 380 extern const struct kmem_va_mode kv_intrsafe; 381 extern const struct kmem_va_mode kv_page; 382 383 extern const struct kmem_pa_mode kp_dirty; 384 extern const struct kmem_pa_mode kp_zero; 385 extern const struct kmem_pa_mode kp_dma; 386 extern const struct kmem_pa_mode kp_dma_contig; 387 extern const struct kmem_pa_mode kp_dma_zero; 388 extern const struct kmem_pa_mode kp_pageable; 389 extern const struct kmem_pa_mode kp_none; 390 391 extern const struct kmem_dyn_mode kd_waitok; 392 extern const struct kmem_dyn_mode kd_nowait; 393 extern const struct kmem_dyn_mode kd_trylock; 394 395 void *km_alloc(size_t, const struct kmem_va_mode *, 396 const struct kmem_pa_mode *, 397 const struct kmem_dyn_mode *); 398 void km_free(void *, size_t, const struct kmem_va_mode *, 399 const struct kmem_pa_mode *); 400 int uvm_map(vm_map_t, vaddr_t *, vsize_t, 401 struct uvm_object *, voff_t, vsize_t, unsigned int); 402 int uvm_mapanon(vm_map_t, vaddr_t *, vsize_t, vsize_t, unsigned int); 403 int uvm_map_pageable(vm_map_t, vaddr_t, 404 vaddr_t, boolean_t, int); 405 int uvm_map_pageable_all(vm_map_t, int, vsize_t); 406 boolean_t uvm_map_checkprot(vm_map_t, vaddr_t, 407 vaddr_t, vm_prot_t); 408 int uvm_map_protect(vm_map_t, vaddr_t, 409 vaddr_t, vm_prot_t, boolean_t); 410 struct vmspace *uvmspace_alloc(vaddr_t, vaddr_t, 411 boolean_t, boolean_t); 412 void uvmspace_init(struct vmspace *, struct pmap *, 413 vaddr_t, vaddr_t, boolean_t, boolean_t); 414 void uvmspace_exec(struct proc *, vaddr_t, vaddr_t); 415 struct vmspace *uvmspace_fork(struct process *); 416 void uvmspace_free(struct vmspace *); 417 struct vmspace *uvmspace_share(struct process *); 418 int uvm_share(vm_map_t, vaddr_t, vm_prot_t, 419 vm_map_t, vaddr_t, vsize_t); 420 void uvm_meter(void); 421 int uvm_sysctl(int *, u_int, void *, size_t *, 422 void *, size_t, struct proc *); 423 struct vm_page *uvm_pagealloc(struct uvm_object *, 424 voff_t, struct vm_anon *, int); 425 int uvm_pagealloc_multi(struct uvm_object *, voff_t, 426 vsize_t, int); 427 void uvm_pagerealloc(struct vm_page *, 428 struct uvm_object *, voff_t); 429 int uvm_pagerealloc_multi(struct uvm_object *, voff_t, 430 vsize_t, int, struct uvm_constraint_range *); 431 /* Actually, uvm_page_physload takes PF#s which need their own type */ 432 void uvm_page_physload(paddr_t, paddr_t, paddr_t, 433 paddr_t, int); 434 void uvm_setpagesize(void); 435 void uvm_shutdown(void); 436 void uvm_aio_biodone(struct buf *); 437 void uvm_aio_aiodone(struct buf *); 438 void uvm_pageout(void *); 439 void uvm_aiodone_daemon(void *); 440 void uvm_wait(const char *); 441 int uvm_pglistalloc(psize_t, paddr_t, paddr_t, 442 paddr_t, paddr_t, struct pglist *, int, int); 443 void uvm_pglistfree(struct pglist *); 444 void uvm_pmr_use_inc(paddr_t, paddr_t); 445 void uvm_swap_init(void); 446 typedef int uvm_coredump_setup_cb(int _nsegment, void *_cookie); 447 typedef int uvm_coredump_walk_cb(vaddr_t _start, vaddr_t _realend, 448 vaddr_t _end, vm_prot_t _prot, int _nsegment, 449 void *_cookie); 450 int uvm_coredump_walkmap(struct proc *_p, 451 uvm_coredump_setup_cb *_setup, 452 uvm_coredump_walk_cb *_walk, void *_cookie); 453 void uvm_grow(struct proc *, vaddr_t); 454 struct uvm_object *uvn_attach(struct vnode *, vm_prot_t); 455 void uvm_pagezero_thread(void *); 456 void kmeminit_nkmempages(void); 457 void kmeminit(void); 458 extern u_int nkmempages; 459 460 struct process; 461 struct kinfo_vmentry; 462 int fill_vmmap(struct process *, struct kinfo_vmentry *, 463 size_t *); 464 465 #endif /* _KERNEL */ 466 467 #endif /* _UVM_UVM_EXTERN_H_ */ 468