sys/vm/vm_map.h

   1 /*
   2  * Copyright (c) 1991, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  * Copyright (c) 2003-2019 The DragonFly Project.  All rights reserved.
   5  *
   6  * This code is derived from software contributed to Berkeley by
   7  * The Mach Operating System project at Carnegie-Mellon University.
   8  *
   9  * This code is derived from software contributed to The DragonFly Project
  10  * by Matthew Dillon <dillon@backplane.com>
  11  *
  12  * Redistribution and use in source and binary forms, with or without
  13  * modification, are permitted provided that the following conditions
  14  * are met:
  15  * 1. Redistributions of source code must retain the above copyright
  16  *    notice, this list of conditions and the following disclaimer.
  17  * 2. Redistributions in binary form must reproduce the above copyright
  18  *    notice, this list of conditions and the following disclaimer in the
  19  *    documentation and/or other materials provided with the distribution.
  20  * 3. Neither the name of the University nor the names of its contributors
  21  *    may be used to endorse or promote products derived from this software
  22  *    without specific prior written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  34  * SUCH DAMAGE.
  35  *
  36  *      @(#)vm_map.h    8.9 (Berkeley) 5/17/95
  37  *
  38  *
  39  * Copyright (c) 1987, 1990 Carnegie-Mellon University.
  40  * All rights reserved.
  41  *
  42  * Authors: Avadis Tevanian, Jr., Michael Wayne Young
  43  *
  44  * Permission to use, copy, modify and distribute this software and
  45  * its documentation is hereby granted, provided that both the copyright
  46  * notice and this permission notice appear in all copies of the
  47  * software, derivative works or modified versions, and any portions
  48  * thereof, and that both notices appear in supporting documentation.
  49  *
  50  * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
  51  * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
  52  * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
  53  *
  54  * Carnegie Mellon requests users of this software to return to
  55  *
  56  *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
  57  *  School of Computer Science
  58  *  Carnegie Mellon University
  59  *  Pittsburgh PA 15213-3890
  60  *
  61  * any improvements or extensions that they make and grant Carnegie the
  62  * rights to redistribute these changes.
  63  */
  64
  65 /*
  66  * Virtual memory map module definitions.  The vm_map houses the pmap
  67  * structure which controls the mmu context for a process.
  68  */
  69 #ifndef _VM_VM_MAP_H_
  70 #define _VM_VM_MAP_H_
  71
  72 #ifndef _SYS_TYPES_H_
  73 #include <sys/types.h>
  74 #endif
  75 #ifdef _KERNEL
  76 #ifndef _SYS_KERNEL_H_
  77 #include <sys/kernel.h> /* ticks */
  78 #endif
  79 #endif
  80 #ifndef _SYS_TREE_H_
  81 #include <sys/tree.h>
  82 #endif
  83 #ifndef _SYS_LOCK_H_
  84 #include <sys/lock.h>
  85 #endif
  86 #ifndef _SYS_VKERNEL_H_
  87 #include <sys/vkernel.h>
  88 #endif
  89 #ifndef _VM_VM_H_
  90 #include <vm/vm.h>
  91 #endif
  92 #ifndef _MACHINE_PMAP_H_
  93 #include <machine/pmap.h>
  94 #endif
  95 #ifndef _VM_VM_OBJECT_H_
  96 #include <vm/vm_object.h>
  97 #endif
  98 #ifndef _SYS_NULL_H_
  99 #include <sys/_null.h>
 100 #endif
 101
 102 struct vm_map_rb_tree;
 103 RB_PROTOTYPE(vm_map_rb_tree, vm_map_entry, rb_entry, rb_vm_map_compare);
 104
 105 typedef u_int vm_flags_t;
 106 typedef u_int vm_eflags_t;
 107
 108 /*
 109  * Aux structure depends on map type and/or flags.
 110  */
 111 union vm_map_aux {
 112         vm_offset_t avail_ssize;        /* amt can grow if this is a stack */
 113         vpte_t master_pde;              /* virtual page table root */
 114         struct cdev *dev;
 115         void    *map_aux;
 116 };
 117
 118 /*
 119  * vm_map_entry identifiers, used as a debugging aid
 120  */
 121 typedef enum {
 122         VM_SUBSYS_UNKNOWN,
 123         VM_SUBSYS_KMALLOC,
 124         VM_SUBSYS_STACK,
 125         VM_SUBSYS_IMGACT,
 126         VM_SUBSYS_EFI,
 127         VM_SUBSYS_RESERVED,
 128         VM_SUBSYS_INIT,
 129         VM_SUBSYS_PIPE,
 130         VM_SUBSYS_PROC,
 131         VM_SUBSYS_SHMEM,
 132         VM_SUBSYS_SYSMAP,
 133         VM_SUBSYS_MMAP,
 134         VM_SUBSYS_BRK,
 135         VM_SUBSYS_BOGUS,
 136         VM_SUBSYS_BUF,
 137         VM_SUBSYS_BUFDATA,
 138         VM_SUBSYS_GD,
 139         VM_SUBSYS_IPIQ,
 140         VM_SUBSYS_PVENTRY,
 141         VM_SUBSYS_PML4,
 142         VM_SUBSYS_MAPDEV,
 143         VM_SUBSYS_ZALLOC,
 144
 145         VM_SUBSYS_DM,
 146         VM_SUBSYS_CONTIG,
 147         VM_SUBSYS_DRM,
 148         VM_SUBSYS_DRM_GEM,
 149         VM_SUBSYS_DRM_SCAT,
 150         VM_SUBSYS_DRM_VMAP,
 151         VM_SUBSYS_DRM_TTM,
 152         VM_SUBSYS_HAMMER,
 153
 154         VM_SUBSYS_VMPGHASH,
 155
 156         VM_SUBSYS_LIMIT         /* end of list */
 157 } vm_subsys_t;
 158
 159 #define UKSMAPOP_ADD            1
 160 #define UKSMAPOP_REM            2
 161 #define UKSMAPOP_FAULT          3
 162
 163 /*
 164  * vm_map backing structure for specifying multiple backings.  This
 165  * structure is NOT shared across pmaps but may be shared within a pmap.
 166  * The offset is cumulatively added from its parent, allowing easy splits
 167  * and merges.
 168  */
 169 struct vm_map_backing {
 170         vm_offset_t     start;          /* start address in pmap */
 171         vm_offset_t     end;            /* end address in pmap */
 172         struct pmap     *pmap;          /* for vm_object extents */
 173
 174         struct vm_map_backing   *backing_ba;    /* backing store */
 175
 176         /*
 177          * Keep track of extents, typically via a vm_object but for uksmaps
 178          * this can also be based off of a process or lwp.
 179          */
 180         TAILQ_ENTRY(vm_map_backing) entry;
 181
 182         /*
 183          * A vm_map_entry may reference an object, a submap, a uksmap, or a
 184          * direct user-kernel shared map.
 185          */
 186         union {
 187                 struct vm_object *object;       /* vm_object */
 188                 struct vm_map   *sub_map;       /* belongs to another map */
 189                 int             (*uksmap)(struct vm_map_backing *entry,
 190                                           int op,
 191                                           struct cdev *dev,
 192                                           vm_page_t fake);
 193                 void            *map_object;    /* generic */
 194         };
 195         void                    *aux_info;
 196
 197         /*
 198          * The offset field typically represents the absolute offset in the
 199          * object, but can have other meanings for uksmaps.
 200          */
 201         vm_ooffset_t            offset;
 202         uint32_t                flags;
 203         uint32_t                backing_count;  /* #entries backing us */
 204 };
 205
 206 typedef struct vm_map_backing *vm_map_backing_t;
 207
 208 #define VM_MAP_BACK_EXCL_HEUR   0x00000001U
 209
 210 /*
 211  * Address map entries consist of start and end addresses, a VM object
 212  * (or sharing map) and offset into that object, and user-exported
 213  * inheritance and protection information.  Also included is control
 214  * information for virtual copy operations.
 215  *
 216  * The object information is now encapsulated in a vm_map_backing
 217  * structure which contains the backing store chain, if any.  This
 218  * structure is NOT shared.
 219  *
 220  * When used with MAP_STACK, avail_ssize is used to determine the limits
 221  * of stack growth.
 222  *
 223  * When used with VM_MAPTYPE_VPAGETABLE, avail_ssize stores the page
 224  * directory index.
 225  */
 226 struct vm_map_entry {
 227         RB_ENTRY(vm_map_entry) rb_entry;
 228         union vm_map_aux aux;           /* auxillary data */
 229         struct vm_map_backing ba;       /* backing object chain */
 230         vm_eflags_t     eflags;         /* map entry flags */
 231         vm_maptype_t    maptype;        /* type of VM mapping */
 232         vm_prot_t       protection;     /* protection code */
 233         vm_prot_t       max_protection; /* maximum protection */
 234         vm_inherit_t    inheritance;    /* inheritance */
 235         int             wired_count;    /* can be paged if = 0 */
 236         vm_subsys_t     id;             /* subsystem id */
 237 };
 238
 239 typedef struct vm_map_entry *vm_map_entry_t;
 240
 241 #define MAPENT_FREELIST(ent)            (ent)->rb_entry.rbe_left
 242
 243 #define MAP_ENTRY_NOSYNC                0x0001
 244 #define MAP_ENTRY_STACK                 0x0002
 245 #define MAP_ENTRY_COW                   0x0004
 246 #define MAP_ENTRY_NEEDS_COPY            0x0008
 247 #define MAP_ENTRY_NOFAULT               0x0010
 248 #define MAP_ENTRY_USER_WIRED            0x0020
 249
 250 #define MAP_ENTRY_BEHAV_NORMAL          0x0000  /* default behavior */
 251 #define MAP_ENTRY_BEHAV_SEQUENTIAL      0x0040  /* expect sequential access */
 252 #define MAP_ENTRY_BEHAV_RANDOM          0x0080  /* expect random access */
 253 #define MAP_ENTRY_BEHAV_RESERVED        0x00C0  /* future use */
 254
 255 #define MAP_ENTRY_BEHAV_MASK            0x00C0
 256
 257 #define MAP_ENTRY_IN_TRANSITION         0x0100  /* entry being changed */
 258 #define MAP_ENTRY_NEEDS_WAKEUP          0x0200  /* waiter's in transition */
 259 #define MAP_ENTRY_NOCOREDUMP            0x0400  /* don't include in a core */
 260 #define MAP_ENTRY_KSTACK                0x0800  /* guarded kernel stack */
 261
 262 /*
 263  * flags for vm_map_[un]clip_range()
 264  */
 265 #define MAP_CLIP_NO_HOLES               0x0001
 266
 267 /*
 268  * This reserve count for vm_map_entry_reserve() should cover all nominal
 269  * single-insertion operations, including any necessary clipping.
 270  */
 271 #define MAP_RESERVE_COUNT       4
 272 #define MAP_RESERVE_SLOP        512
 273 #define MAP_RESERVE_HYST        (MAP_RESERVE_SLOP - MAP_RESERVE_SLOP / 8)
 274
 275 /*
 276  * vm_map_lookup wflags
 277  */
 278 #define FW_WIRED        0x0001
 279 #define FW_DIDCOW       0x0002
 280
 281 static __inline u_char
 282 vm_map_entry_behavior(struct vm_map_entry *entry)
 283 {
 284         return entry->eflags & MAP_ENTRY_BEHAV_MASK;
 285 }
 286
 287 static __inline void
 288 vm_map_entry_set_behavior(struct vm_map_entry *entry, u_char behavior)
 289 {
 290         entry->eflags = (entry->eflags & ~MAP_ENTRY_BEHAV_MASK) |
 291                 (behavior & MAP_ENTRY_BEHAV_MASK);
 292 }
 293
 294 /*
 295  * VA interlock for map (VPAGETABLE / vkernel support)
 296  */
 297 struct vm_map_ilock {
 298         struct vm_map_ilock *next;
 299         int     flags;
 300         vm_offset_t ran_beg;
 301         vm_offset_t ran_end;    /* non-inclusive */
 302 };
 303
 304 #define ILOCK_WAITING   0x00000001
 305
 306 /*
 307  * Hinting mechanism used by vm_map_findspace() to figure out where to start
 308  * an iteration looking for a hole big enough for the requested allocation.
 309  * This can be important in situations where large amounts of kernel memory
 310  * are being managed.  For example, if the system is managing tens of
 311  * thousands of processes or threads.
 312  *
 313  * If a hint is present it guarantees that no compatible hole exists prior
 314  * to the (start) address.  The (start) address itself is not necessarily
 315  * a hole.
 316  */
 317 #define VM_MAP_FFCOUNT  4
 318 #define VM_MAP_FFMASK   (VM_MAP_FFCOUNT - 1)
 319
 320 struct vm_map_freehint {
 321         vm_offset_t     start;
 322         vm_offset_t     length;
 323         vm_offset_t     align;
 324         int             unused01;
 325 };
 326 typedef struct vm_map_freehint vm_map_freehint_t;
 327
 328 /*
 329  * Maps are doubly-linked lists of map entries, kept sorted by address.
 330  * A single hint is provided to start searches again from the last
 331  * successful search, insertion, or removal.
 332  *
 333  * NOTE: The lock structure cannot be the first element of vm_map
 334  *       because this can result in a running lockup between two or more
 335  *       system processes trying to kmem_alloc_wait() due to kmem_alloc_wait()
 336  *       and free tsleep/waking up 'map' and the underlying lockmgr also
 337  *       sleeping and waking up on 'map'.  The lockup occurs when the map fills
 338  *       up.  The 'exec' map, for example.
 339  *
 340  * NOTE: The vm_map structure can be hard-locked with the lockmgr lock
 341  *       or soft-serialized with the token, or both.
 342  */
 343 RB_HEAD(vm_map_rb_tree, vm_map_entry);
 344
 345 struct vm_map {
 346         struct          lock lock;      /* Lock for map data */
 347         struct vm_map_rb_tree rb_root;  /* Organize map entries */
 348         vm_offset_t     min_addr;       /* min address */
 349         vm_offset_t     max_addr;       /* max address */
 350         int             nentries;       /* Number of entries */
 351         unsigned int    timestamp;      /* Version number */
 352         vm_size_t       size;           /* virtual size */
 353         u_char          system_map;     /* Am I a system map? */
 354         u_char          freehint_newindex;
 355         u_char          unused02;
 356         u_char          unused03;
 357         vm_flags_t      flags;          /* flags for this vm_map */
 358         vm_map_freehint_t freehint[VM_MAP_FFCOUNT];
 359         struct pmap     *pmap;          /* Physical map */
 360         struct vm_map_ilock *ilock_base;/* interlocks */
 361         struct spinlock ilock_spin;     /* interlocks (spinlock for) */
 362         struct lwkt_token token;        /* Soft serializer */
 363         vm_offset_t pgout_offset;       /* for RLIMIT_RSS scans */
 364 };
 365
 366 typedef struct vm_map *vm_map_t;
 367
 368 /*
 369  * vm_flags_t values
 370  */
 371 #define MAP_WIREFUTURE          0x0001  /* wire all future pages */
 372
 373 /*
 374  * Shareable process virtual address space.
 375  *
 376  * Refd pointers from vmresident, proc
 377  */
 378 struct vmspace {
 379         struct vm_map vm_map;   /* VM address map */
 380         struct pmap vm_pmap;    /* private physical map */
 381         int vm_flags;
 382         caddr_t vm_shm;         /* SYS5 shared memory private data XXX */
 383 /* we copy from vm_startcopy to the end of the structure on fork */
 384 #define vm_startcopy vm_rssize
 385         segsz_t vm_rssize;      /* current resident set size in pages */
 386         segsz_t vm_swrss;       /* resident set size before last swap */
 387         segsz_t vm_tsize;       /* text size (bytes) */
 388         segsz_t vm_dsize;       /* data size (bytes) */
 389         segsz_t vm_ssize;       /* stack size (bytes) */
 390         caddr_t vm_taddr;       /* user virtual address of text XXX */
 391         caddr_t vm_daddr;       /* user virtual address of data XXX */
 392         caddr_t vm_maxsaddr;    /* user VA at max stack growth */
 393         caddr_t vm_minsaddr;    /* user VA at max stack growth */
 394 #define vm_endcopy      vm_unused01
 395         int     vm_unused01;
 396         int     vm_unused02;
 397         int     vm_pagesupply;
 398         u_int   vm_holdcnt;     /* temporary hold count and exit sequencing */
 399         u_int   vm_refcnt;      /* normal ref count */
 400 };
 401
 402 #define VM_REF_DELETED          0x80000000U
 403
 404 #define VMSPACE_EXIT1           0x0001  /* partial exit */
 405 #define VMSPACE_EXIT2           0x0002  /* full exit */
 406
 407 #define VMSPACE_HOLDEXIT        0x80000000
 408
 409 /*
 410  * Resident executable holding structure.  A user program can take a snapshot
 411  * of just its VM address space (typically done just after dynamic link
 412  * libraries have completed loading) and register it as a resident
 413  * executable associated with the program binary's vnode, which is also
 414  * locked into memory.  Future execs of the vnode will start with a copy
 415  * of the resident vmspace instead of running the binary from scratch,
 416  * avoiding both the kernel ELF loader *AND* all shared library mapping and
 417  * relocation code, and will call a different entry point (the stack pointer
 418  * is reset to the top of the stack) supplied when the vmspace was registered.
 419  */
 420 struct vmresident {
 421         struct vnode    *vr_vnode;              /* associated vnode */
 422         TAILQ_ENTRY(vmresident) vr_link;        /* linked list of res sts */
 423         struct vmspace  *vr_vmspace;            /* vmspace to fork */
 424         intptr_t        vr_entry_addr;          /* registered entry point */
 425         struct sysentvec *vr_sysent;            /* system call vects */
 426         int             vr_id;                  /* registration id */
 427         int             vr_refs;                /* temporary refs */
 428 };
 429
 430 #ifdef _KERNEL
 431 /*
 432  *      Macros:         vm_map_lock, etc.
 433  *      Function:
 434  *              Perform locking on the data portion of a map.  Note that
 435  *              these macros mimic procedure calls returning void.  The
 436  *              semicolon is supplied by the user of these macros, not
 437  *              by the macros themselves.  The macros can safely be used
 438  *              as unbraced elements in a higher level statement.
 439  */
 440
 441 #define ASSERT_VM_MAP_LOCKED(map)       KKASSERT(lockowned(&(map)->lock))
 442
 443 #ifdef DIAGNOSTIC
 444 /* #define MAP_LOCK_DIAGNOSTIC 1 */
 445 #ifdef MAP_LOCK_DIAGNOSTIC
 446 #define vm_map_lock(map) \
 447         do { \
 448                 kprintf ("locking map LK_EXCLUSIVE: 0x%x\n", map); \
 449                 if (lockmgr(&(map)->lock, LK_EXCLUSIVE) != 0) { \
 450                         panic("vm_map_lock: failed to get lock"); \
 451                 } \
 452                 (map)->timestamp++; \
 453         } while(0)
 454 #else
 455 #define vm_map_lock(map) \
 456         do { \
 457                 if (lockmgr(&(map)->lock, LK_EXCLUSIVE) != 0) { \
 458                         panic("vm_map_lock: failed to get lock"); \
 459                 } \
 460                 (map)->timestamp++; \
 461         } while(0)
 462 #endif
 463 #else
 464 #define vm_map_lock(map) \
 465         do { \
 466                 lockmgr(&(map)->lock, LK_EXCLUSIVE); \
 467                 (map)->timestamp++; \
 468         } while(0)
 469 #endif /* DIAGNOSTIC */
 470
 471 #if defined(MAP_LOCK_DIAGNOSTIC)
 472 #define vm_map_unlock(map) \
 473         do { \
 474                 kprintf ("locking map LK_RELEASE: 0x%x\n", map); \
 475                 lockmgr(&(map)->lock, LK_RELEASE); \
 476         } while (0)
 477 #define vm_map_lock_read(map) \
 478         do { \
 479                 kprintf ("locking map LK_SHARED: 0x%x\n", map); \
 480                 lockmgr(&(map)->lock, LK_SHARED); \
 481         } while (0)
 482 #define vm_map_unlock_read(map) \
 483         do { \
 484                 kprintf ("locking map LK_RELEASE: 0x%x\n", map); \
 485                 lockmgr(&(map)->lock, LK_RELEASE); \
 486         } while (0)
 487 #else
 488 #define vm_map_unlock(map) \
 489         lockmgr(&(map)->lock, LK_RELEASE)
 490 #define vm_map_lock_read(map) \
 491         lockmgr(&(map)->lock, LK_SHARED)
 492 #define vm_map_unlock_read(map) \
 493         lockmgr(&(map)->lock, LK_RELEASE)
 494 #endif
 495
 496 #define vm_map_lock_read_try(map) \
 497         lockmgr(&(map)->lock, LK_SHARED | LK_NOWAIT)
 498
 499 static __inline__ int
 500 vm_map_lock_read_to(vm_map_t map)
 501 {
 502         int error;
 503
 504 #if defined(MAP_LOCK_DIAGNOSTIC)
 505         kprintf ("locking map LK_SHARED: 0x%x\n", map);
 506 #endif
 507         error = lockmgr(&(map)->lock, LK_SHARED | LK_TIMELOCK);
 508         return error;
 509 }
 510
 511 static __inline__ int
 512 vm_map_lock_upgrade(vm_map_t map) {
 513         int error;
 514 #if defined(MAP_LOCK_DIAGNOSTIC)
 515         kprintf("locking map LK_EXCLUPGRADE: 0x%x\n", map);
 516 #endif
 517         error = lockmgr(&map->lock, LK_EXCLUPGRADE);
 518         if (error == 0)
 519                 map->timestamp++;
 520         return error;
 521 }
 522
 523 #if defined(MAP_LOCK_DIAGNOSTIC)
 524 #define vm_map_lock_downgrade(map) \
 525         do { \
 526                 kprintf ("locking map LK_DOWNGRADE: 0x%x\n", map); \
 527                 lockmgr(&(map)->lock, LK_DOWNGRADE); \
 528         } while (0)
 529 #else
 530 #define vm_map_lock_downgrade(map) \
 531         lockmgr(&(map)->lock, LK_DOWNGRADE)
 532 #endif
 533
 534 #endif /* _KERNEL */
 535
 536 /*
 537  *      Functions implemented as macros
 538  */
 539 #define         vm_map_min(map)         ((map)->min_addr)
 540 #define         vm_map_max(map)         ((map)->max_addr)
 541 #define         vm_map_pmap(map)        ((map)->pmap)
 542
 543 /*
 544  * Must not block
 545  */
 546 static __inline struct pmap *
 547 vmspace_pmap(struct vmspace *vmspace)
 548 {
 549         return &vmspace->vm_pmap;
 550 }
 551
 552 /*
 553  * Caller must hold the vmspace->vm_map.token
 554  */
 555 static __inline long
 556 vmspace_resident_count(struct vmspace *vmspace)
 557 {
 558         return pmap_resident_count(vmspace_pmap(vmspace));
 559 }
 560
 561 /*
 562  * Number of kernel maps and entries to statically allocate, required
 563  * during boot to bootstrap the VM system.
 564  */
 565 #define MAX_KMAP        10
 566 #define MAX_MAPENT      (SMP_MAXCPU * 32 + 1024)
 567
 568 /*
 569  * Copy-on-write flags for vm_map operations
 570  */
 571 #define MAP_UNUSED_01           0x0001
 572 #define MAP_COPY_ON_WRITE       0x0002
 573 #define MAP_NOFAULT             0x0004
 574 #define MAP_PREFAULT            0x0008
 575 #define MAP_PREFAULT_PARTIAL    0x0010
 576 #define MAP_DISABLE_SYNCER      0x0020
 577 #define MAP_IS_STACK            0x0040
 578 #define MAP_IS_KSTACK           0x0080
 579 #define MAP_DISABLE_COREDUMP    0x0100
 580 #define MAP_PREFAULT_MADVISE    0x0200  /* from (user) madvise request */
 581 #define MAP_PREFAULT_RELOCK     0x0200
 582
 583 /*
 584  * vm_fault option flags
 585  */
 586 #define VM_FAULT_NORMAL         0x00    /* Nothing special */
 587 #define VM_FAULT_CHANGE_WIRING  0x01    /* Change the wiring as appropriate */
 588 #define VM_FAULT_USER_WIRE      0x02    /* Likewise, but for user purposes */
 589 #define VM_FAULT_BURST          0x04    /* Burst fault can be done */
 590 #define VM_FAULT_DIRTY          0x08    /* Dirty the page */
 591 #define VM_FAULT_UNSWAP         0x10    /* Remove backing store from the page */
 592 #define VM_FAULT_BURST_QUICK    0x20    /* Special case shared vm_object */
 593 #define VM_FAULT_WIRE_MASK      (VM_FAULT_CHANGE_WIRING|VM_FAULT_USER_WIRE)
 594 #define VM_FAULT_USERMODE       0x40
 595
 596 #ifdef _KERNEL
 597
 598 boolean_t vm_map_check_protection (vm_map_t, vm_offset_t, vm_offset_t,
 599                 vm_prot_t, boolean_t);
 600 struct pmap;
 601 struct globaldata;
 602 void vm_map_entry_allocate_object(vm_map_entry_t);
 603 void vm_map_entry_reserve_cpu_init(struct globaldata *gd);
 604 int vm_map_entry_reserve(int);
 605 int vm_map_entry_kreserve(int);
 606 void vm_map_entry_release(int);
 607 void vm_map_entry_krelease(int);
 608 int vm_map_delete (vm_map_t, vm_offset_t, vm_offset_t, int *);
 609 int vm_map_find (vm_map_t, void *, void *,
 610                  vm_ooffset_t, vm_offset_t *, vm_size_t,
 611                  vm_size_t, boolean_t,
 612                  vm_maptype_t, vm_subsys_t id,
 613                  vm_prot_t, vm_prot_t, int);
 614 int vm_map_findspace (vm_map_t, vm_offset_t, vm_size_t, vm_size_t,
 615                       int, vm_offset_t *);
 616 vm_offset_t vm_map_hint(struct proc *, vm_offset_t, vm_prot_t);
 617 int vm_map_inherit (vm_map_t, vm_offset_t, vm_offset_t, vm_inherit_t);
 618 void vm_map_init (struct vm_map *, vm_offset_t, vm_offset_t, pmap_t);
 619 int vm_map_insert (vm_map_t, int *,
 620                    void *, void *,
 621                    vm_ooffset_t, void *,
 622                    vm_offset_t, vm_offset_t,
 623                    vm_maptype_t, vm_subsys_t id,
 624                    vm_prot_t, vm_prot_t, int);
 625 int vm_map_lookup (vm_map_t *, vm_offset_t, vm_prot_t,
 626                 vm_map_entry_t *, struct vm_map_backing **,
 627                 vm_pindex_t *, vm_pindex_t *, vm_prot_t *, int *);
 628 void vm_map_lookup_done (vm_map_t, vm_map_entry_t, int);
 629 boolean_t vm_map_lookup_entry (vm_map_t, vm_offset_t, vm_map_entry_t *);
 630 int vm_map_wire (vm_map_t, vm_offset_t, vm_offset_t, int);
 631 int vm_map_unwire (vm_map_t, vm_offset_t, vm_offset_t, boolean_t);
 632 int vm_map_clean (vm_map_t, vm_offset_t, vm_offset_t, boolean_t, boolean_t);
 633 int vm_map_protect (vm_map_t, vm_offset_t, vm_offset_t, vm_prot_t, boolean_t);
 634 int vm_map_remove (vm_map_t, vm_offset_t, vm_offset_t);
 635 void vm_map_startup (void);
 636 int vm_map_submap (vm_map_t, vm_offset_t, vm_offset_t, vm_map_t);
 637 int vm_map_madvise (vm_map_t, vm_offset_t, vm_offset_t, int, off_t);
 638 void vm_map_simplify_entry (vm_map_t, vm_map_entry_t, int *);
 639 void vm_init2 (void);
 640 int vm_uiomove (vm_map_t, vm_object_t, off_t, int, vm_offset_t, int *);
 641 int vm_map_stack (vm_map_t, vm_offset_t *, vm_size_t, int,
 642                   vm_prot_t, vm_prot_t, int);
 643 int vm_map_growstack (vm_map_t map, vm_offset_t addr);
 644 vm_offset_t vmspace_swap_count (struct vmspace *vmspace);
 645 vm_offset_t vmspace_anonymous_count (struct vmspace *vmspace);
 646 void vm_map_set_wired_quick(vm_map_t map, vm_offset_t addr, vm_size_t size, int *);
 647 void vm_map_transition_wait(vm_map_t map, int relock);
 648
 649 void vm_map_interlock(vm_map_t map, struct vm_map_ilock *ilock,
 650                         vm_offset_t ran_beg, vm_offset_t ran_end);
 651 void vm_map_deinterlock(vm_map_t map, struct vm_map_ilock *ilock);
 652
 653
 654 #if defined(__x86_64__) && defined(_KERNEL_VIRTUAL)
 655 int vkernel_module_memory_alloc(vm_offset_t *, size_t);
 656 void vkernel_module_memory_free(vm_offset_t, size_t);
 657 #endif
 658
 659 #endif
 660 #endif                          /* _VM_VM_MAP_H_ */