[dragonfly.git] / sys / vm / vm_map.h

/*
 * Copyright (c) 1991, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * The Mach Operating System project at Carnegie-Mellon University.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)vm_map.h	8.9 (Berkeley) 5/17/95
 *
 *
 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
 * All rights reserved.
 *
 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
 *
 * Permission to use, copy, modify and distribute this software and
 * its documentation is hereby granted, provided that both the copyright
 * notice and this permission notice appear in all copies of the
 * software, derivative works or modified versions, and any portions
 * thereof, and that both notices appear in supporting documentation.
 *
 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
 * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
 *
 * Carnegie Mellon requests users of this software to return to
 *
 *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
 *  School of Computer Science
 *  Carnegie Mellon University
 *  Pittsburgh PA 15213-3890
 *
 * any improvements or extensions that they make and grant Carnegie the
 * rights to redistribute these changes.
 *
 * $FreeBSD: src/sys/vm/vm_map.h,v 1.54.2.5 2003/01/13 22:51:17 dillon Exp $
 * $DragonFly: src/sys/vm/vm_map.h,v 1.30 2007/04/29 18:25:41 dillon Exp $
 */

/*
 *	Virtual memory map module definitions.
 */

#ifndef	_VM_VM_MAP_H_
#define	_VM_VM_MAP_H_

#ifndef _SYS_TYPES_H_
#include <sys/types.h>
#endif
#ifndef _SYS_TREE_H_
#include <sys/tree.h>
#endif
#ifndef _SYS_SYSREF_H_
#include <sys/sysref.h>
#endif
#ifndef _SYS_LOCK_H_
#include <sys/lock.h>
#endif
#ifndef _SYS_VKERNEL_H_
#include <sys/vkernel.h>
#endif
#ifndef _VM_VM_H_
#include <vm/vm.h>
#endif
#ifndef _MACHINE_PMAP_H_
#include <machine/pmap.h>
#endif
#ifndef _VM_VM_OBJECT_H_
#include <vm/vm_object.h>
#endif
#ifndef _SYS_NULL_H_
#include <sys/_null.h>
#endif

struct vm_map_rb_tree;
RB_PROTOTYPE(vm_map_rb_tree, vm_map_entry, rb_entry, rb_vm_map_compare);

/*
 *	Types defined:
 *
 *	vm_map_t		the high-level address map data structure.
 *	vm_map_entry_t		an entry in an address map.
 */

typedef u_int vm_flags_t;
typedef u_int vm_eflags_t;

/*
 *	Objects which live in maps may be either VM objects, or
 *	another map (called a "sharing map") which denotes read-write
 *	sharing with other maps.
 */
union vm_map_object {
	struct vm_object *vm_object;	/* object object */
	struct vm_map *sub_map;		/* belongs to another map */
};

union vm_map_aux {
	vm_offset_t avail_ssize;	/* amt can grow if this is a stack */
	vpte_t master_pde;		/* virtual page table root */
};

/*
 *	Address map entries consist of start and end addresses,
 *	a VM object (or sharing map) and offset into that object,
 *	and user-exported inheritance and protection information.
 *	Also included is control information for virtual copy operations.
 *
 *	When used with MAP_STACK, avail_ssize is used to determine the
 *	limits of stack growth.
 *
 *	When used with VM_MAPTYPE_VPAGETABLE, avail_ssize stores the
 *	page directory index.
 */
struct vm_map_entry {
	struct vm_map_entry *prev;	/* previous entry */
	struct vm_map_entry *next;	/* next entry */
	RB_ENTRY(vm_map_entry) rb_entry;
	vm_offset_t start;		/* start address */
	vm_offset_t end;		/* end address */
	union vm_map_aux aux;		/* auxillary data */
	union vm_map_object object;	/* object I point to */
	vm_ooffset_t offset;		/* offset into object */
	vm_eflags_t eflags;		/* map entry flags */
	vm_maptype_t maptype;		/* type of VM mapping */
	vm_prot_t protection;		/* protection code */
	vm_prot_t max_protection;	/* maximum protection */
	vm_inherit_t inheritance;	/* inheritance */
	int wired_count;		/* can be paged if = 0 */
};

#define MAP_ENTRY_NOSYNC		0x0001
#define MAP_ENTRY_STACK			0x0002
#define MAP_ENTRY_COW			0x0004
#define MAP_ENTRY_NEEDS_COPY		0x0008
#define MAP_ENTRY_NOFAULT		0x0010
#define MAP_ENTRY_USER_WIRED		0x0020

#define MAP_ENTRY_BEHAV_NORMAL		0x0000	/* default behavior */
#define MAP_ENTRY_BEHAV_SEQUENTIAL	0x0040	/* expect sequential access */
#define MAP_ENTRY_BEHAV_RANDOM		0x0080	/* expect random access */
#define MAP_ENTRY_BEHAV_RESERVED	0x00C0	/* future use */

#define MAP_ENTRY_BEHAV_MASK		0x00C0

#define MAP_ENTRY_IN_TRANSITION		0x0100	/* entry being changed */
#define MAP_ENTRY_NEEDS_WAKEUP		0x0200	/* waiter's in transition */
#define MAP_ENTRY_NOCOREDUMP		0x0400	/* don't include in a core */
#define MAP_ENTRY_KSTACK		0x0800	/* guarded kernel stack */

/*
 * flags for vm_map_[un]clip_range()
 */
#define MAP_CLIP_NO_HOLES		0x0001

/*
 * This reserve count for vm_map_entry_reserve() should cover all nominal
 * single-insertion operations, including any necessary clipping.
 */
#define MAP_RESERVE_COUNT	4
#define MAP_RESERVE_SLOP	32

static __inline u_char   
vm_map_entry_behavior(struct vm_map_entry *entry)
{                  
	return entry->eflags & MAP_ENTRY_BEHAV_MASK;
}

static __inline void
vm_map_entry_set_behavior(struct vm_map_entry *entry, u_char behavior)
{              
	entry->eflags = (entry->eflags & ~MAP_ENTRY_BEHAV_MASK) |
		(behavior & MAP_ENTRY_BEHAV_MASK);
}                       

/*
 *	Maps are doubly-linked lists of map entries, kept sorted
 *	by address.  A single hint is provided to start
 *	searches again from the last successful search,
 *	insertion, or removal.
 *
 *	Note: the lock structure cannot be the first element of vm_map
 *	because this can result in a running lockup between two or more
 *	system processes trying to kmem_alloc_wait() due to kmem_alloc_wait()
 *	and free tsleep/waking up 'map' and the underlying lockmgr also
 *	sleeping and waking up on 'map'.  The lockup occurs when the map fills
 *	up.  The 'exec' map, for example.
 */
struct vm_map {
	struct vm_map_entry header;	/* List of entries */
	RB_HEAD(vm_map_rb_tree, vm_map_entry) rb_root;
	struct lock lock;		/* Lock for map data */
	int nentries;			/* Number of entries */
	vm_size_t size;			/* virtual size */
	u_char system_map;		/* Am I a system map? */
	vm_map_entry_t hint;		/* hint for quick lookups */
	unsigned int timestamp;		/* Version number */
	vm_map_entry_t first_free;	/* First free space hint */
	vm_flags_t flags;		/* flags for this vm_map */
	struct pmap *pmap;		/* Physical map */
#define	min_offset		header.start
#define max_offset		header.end
};

/*
 * vm_flags_t values
 */
#define MAP_WIREFUTURE		0x01	/* wire all future pages */

/*
 * Registered upcall
 */
struct upcall;

struct vmupcall {
	struct vmupcall	*vu_next;
	void		*vu_func;	/* user upcall function */
	void		*vu_data;	/* user data */
	void		*vu_ctx;	/* user context function */
	struct lwp	*vu_lwp;	/* process that registered upcall */
	int		vu_id;		/* upcall identifier */
	int		vu_pending;	/* upcall request pending */
};

/* 
 * Shareable process virtual address space.
 *
 * Refd pointers from vmresident, proc
 */
struct vmspace {
	struct vm_map vm_map;	/* VM address map */
	struct pmap vm_pmap;	/* private physical map */
	int vm_unused01;
	caddr_t vm_shm;		/* SYS5 shared memory private data XXX */
/* we copy from vm_startcopy to the end of the structure on fork */
#define vm_startcopy vm_rssize
	segsz_t vm_rssize;	/* current resident set size in pages */
	segsz_t vm_swrss;	/* resident set size before last swap */
	segsz_t vm_tsize;	/* text size (pages) XXX */
	segsz_t vm_dsize;	/* data size (pages) XXX */
	segsz_t vm_ssize;	/* stack size (pages) */
	caddr_t vm_taddr;	/* user virtual address of text XXX */
	caddr_t vm_daddr;	/* user virtual address of data XXX */
	caddr_t vm_maxsaddr;	/* user VA at max stack growth */
	caddr_t vm_minsaddr;	/* user VA at max stack growth */
#define vm_endcopy	vm_exitingcnt
	int	vm_exitingcnt;	/* several procsses zombied in exit1 */
	int	vm_upccount;	/* number of registered upcalls */
	int	vm_pagesupply;
	struct vmupcall *vm_upcalls;	/* registered upcalls */
	struct sysref vm_sysref;	/* sysref, refcnt, etc */
};

/*
 * Resident executable holding structure.  A user program can take a snapshot
 * of just its VM address space (typically done just after dynamic link
 * libraries have completed loading) and register it as a resident 
 * executable associated with the program binary's vnode, which is also
 * locked into memory.  Future execs of the vnode will start with a copy
 * of the resident vmspace instead of running the binary from scratch,
 * avoiding both the kernel ELF loader *AND* all shared library mapping and
 * relocation code, and will call a different entry point (the stack pointer
 * is reset to the top of the stack) supplied when the vmspace was registered.
 */
struct vmresident {
	struct vnode	*vr_vnode;		/* associated vnode */
	TAILQ_ENTRY(vmresident) vr_link;	/* linked list of res sts */
	struct vmspace	*vr_vmspace;		/* vmspace to fork */
	intptr_t	vr_entry_addr;		/* registered entry point */
	struct sysentvec *vr_sysent;		/* system call vects */
	int		vr_id;			/* registration id */
	int		vr_refs;		/* temporary refs */
};

#ifdef _KERNEL
/*
 *	Macros:		vm_map_lock, etc.
 *	Function:
 *		Perform locking on the data portion of a map.  Note that
 *		these macros mimic procedure calls returning void.  The
 *		semicolon is supplied by the user of these macros, not
 *		by the macros themselves.  The macros can safely be used
 *		as unbraced elements in a higher level statement.
 */

#define ASSERT_VM_MAP_LOCKED(map)	KKASSERT(lockowned(&(map)->lock))

#ifdef DIAGNOSTIC
/* #define MAP_LOCK_DIAGNOSTIC 1 */
#ifdef MAP_LOCK_DIAGNOSTIC
#define	vm_map_lock(map) \
	do { \
		kprintf ("locking map LK_EXCLUSIVE: 0x%x\n", map); \
		if (lockmgr(&(map)->lock, LK_EXCLUSIVE) != 0) { \
			panic("vm_map_lock: failed to get lock"); \
		} \
		(map)->timestamp++; \
	} while(0)
#else
#define	vm_map_lock(map) \
	do { \
		if (lockmgr(&(map)->lock, LK_EXCLUSIVE) != 0) { \
			panic("vm_map_lock: failed to get lock"); \
		} \
		(map)->timestamp++; \
	} while(0)
#endif
#else
#define	vm_map_lock(map) \
	do { \
		lockmgr(&(map)->lock, LK_EXCLUSIVE); \
		(map)->timestamp++; \
	} while(0)
#endif /* DIAGNOSTIC */

#if defined(MAP_LOCK_DIAGNOSTIC)
#define	vm_map_unlock(map) \
	do { \
		kprintf ("locking map LK_RELEASE: 0x%x\n", map); \
		lockmgr(&(map)->lock, LK_RELEASE); \
	} while (0)
#define	vm_map_lock_read(map) \
	do { \
		kprintf ("locking map LK_SHARED: 0x%x\n", map); \
		lockmgr(&(map)->lock, LK_SHARED); \
	} while (0)
#define	vm_map_unlock_read(map) \
	do { \
		kprintf ("locking map LK_RELEASE: 0x%x\n", map); \
		lockmgr(&(map)->lock, LK_RELEASE); \
	} while (0)
#else
#define	vm_map_unlock(map) \
	lockmgr(&(map)->lock, LK_RELEASE)
#define	vm_map_lock_read(map) \
	lockmgr(&(map)->lock, LK_SHARED) 
#define	vm_map_unlock_read(map) \
	lockmgr(&(map)->lock, LK_RELEASE)
#endif

static __inline__ int
vm_map_lock_upgrade(vm_map_t map) {
	int error;
#if defined(MAP_LOCK_DIAGNOSTIC)
	kprintf("locking map LK_EXCLUPGRADE: 0x%x\n", map); 
#endif
	error = lockmgr(&map->lock, LK_EXCLUPGRADE);
	if (error == 0)
		map->timestamp++;
	return error;
}

#if defined(MAP_LOCK_DIAGNOSTIC)
#define vm_map_lock_downgrade(map) \
	do { \
		kprintf ("locking map LK_DOWNGRADE: 0x%x\n", map); \
		lockmgr(&(map)->lock, LK_DOWNGRADE); \
	} while (0)
#else
#define vm_map_lock_downgrade(map) \
	lockmgr(&(map)->lock, LK_DOWNGRADE)
#endif

#endif /* _KERNEL */

/*
 *	Functions implemented as macros
 */
#define		vm_map_min(map)		((map)->min_offset)
#define		vm_map_max(map)		((map)->max_offset)
#define		vm_map_pmap(map)	((map)->pmap)

/*
 * Must not block
 */
static __inline struct pmap *
vmspace_pmap(struct vmspace *vmspace)
{
	return &vmspace->vm_pmap;
}

static __inline long
vmspace_resident_count(struct vmspace *vmspace)
{
	return pmap_resident_count(vmspace_pmap(vmspace));
}

/* Calculates the proportional RSS and returning the
 * accrued result.
 */
static __inline u_int
vmspace_president_count(struct vmspace *vmspace)
{
	vm_map_t map = &vmspace->vm_map;
	vm_map_entry_t cur;
	vm_object_t object;
	u_int count = 0;

	for (cur = map->header.next; cur != &map->header; cur = cur->next) {
		switch(cur->maptype) {
		case VM_MAPTYPE_NORMAL:
		case VM_MAPTYPE_VPAGETABLE:
			if ((object = cur->object.vm_object) == NULL)
				break;
			if (object->type != OBJT_DEFAULT &&
			    object->type != OBJT_SWAP) {
				break;
			}
			if(object->agg_pv_list_count != 0) {
					count += (object->resident_page_count / object->agg_pv_list_count);
			}
			break;
		default:
			break;
		}
	}
	return(count);
}

/*
 * Number of kernel maps and entries to statically allocate, required
 * during boot to bootstrap the VM system.
 */
#define MAX_KMAP	10
#define	MAX_MAPENT	2048	/* required to support up to 64 cpus */

/*
 * Copy-on-write flags for vm_map operations
 */
#define MAP_UNUSED_01		0x0001
#define MAP_COPY_ON_WRITE	0x0002
#define MAP_NOFAULT		0x0004
#define MAP_PREFAULT		0x0008
#define MAP_PREFAULT_PARTIAL	0x0010
#define MAP_DISABLE_SYNCER	0x0020
#define MAP_IS_STACK		0x0040
#define MAP_IS_KSTACK		0x0080
#define MAP_DISABLE_COREDUMP	0x0100
#define MAP_PREFAULT_MADVISE	0x0200	/* from (user) madvise request */

/*
 * vm_fault option flags
 */
#define VM_FAULT_NORMAL		0x00	/* Nothing special */
#define VM_FAULT_CHANGE_WIRING	0x01	/* Change the wiring as appropriate */
#define VM_FAULT_USER_WIRE	0x02	/* Likewise, but for user purposes */
#define VM_FAULT_BURST		0x04	/* Burst fault can be done */
#define VM_FAULT_DIRTY		0x08	/* Dirty the page */
#define VM_FAULT_UNSWAP		0x10	/* Remove backing store from the page */
#define VM_FAULT_WIRE_MASK	(VM_FAULT_CHANGE_WIRING|VM_FAULT_USER_WIRE)

#ifdef _KERNEL

extern struct sysref_class vmspace_sysref_class;

boolean_t vm_map_check_protection (vm_map_t, vm_offset_t, vm_offset_t,
		vm_prot_t, boolean_t);
struct pmap;
struct globaldata;
void vm_map_entry_allocate_object(vm_map_entry_t);
void vm_map_entry_reserve_cpu_init(struct globaldata *gd);
int vm_map_entry_reserve(int);
int vm_map_entry_kreserve(int);
void vm_map_entry_release(int);
void vm_map_entry_krelease(int);
vm_map_t vm_map_create (vm_map_t, struct pmap *, vm_offset_t, vm_offset_t);
int vm_map_delete (vm_map_t, vm_offset_t, vm_offset_t, int *);
int vm_map_find (vm_map_t, vm_object_t, vm_ooffset_t,
		 vm_offset_t *, vm_size_t, vm_size_t,
		 boolean_t, vm_maptype_t,
		 vm_prot_t, vm_prot_t, 
		 int);
int vm_map_findspace (vm_map_t, vm_offset_t, vm_size_t, vm_size_t,
		      int, vm_offset_t *);
vm_offset_t vm_map_hint(struct proc *, vm_offset_t, vm_prot_t);
int vm_map_inherit (vm_map_t, vm_offset_t, vm_offset_t, vm_inherit_t);
void vm_map_init (struct vm_map *, vm_offset_t, vm_offset_t, pmap_t);
int vm_map_insert (vm_map_t, int *, vm_object_t, vm_ooffset_t,
		   vm_offset_t, vm_offset_t,
		   vm_maptype_t,
		   vm_prot_t, vm_prot_t,
		   int);
int vm_map_lookup (vm_map_t *, vm_offset_t, vm_prot_t, vm_map_entry_t *, vm_object_t *,
    vm_pindex_t *, vm_prot_t *, boolean_t *);
void vm_map_lookup_done (vm_map_t, vm_map_entry_t, int);
boolean_t vm_map_lookup_entry (vm_map_t, vm_offset_t, vm_map_entry_t *);
int vm_map_wire (vm_map_t, vm_offset_t, vm_offset_t, int);
int vm_map_unwire (vm_map_t, vm_offset_t, vm_offset_t, boolean_t);
int vm_map_clean (vm_map_t, vm_offset_t, vm_offset_t, boolean_t, boolean_t);
int vm_map_protect (vm_map_t, vm_offset_t, vm_offset_t, vm_prot_t, boolean_t);
int vm_map_remove (vm_map_t, vm_offset_t, vm_offset_t);
void vm_map_startup (void);
int vm_map_submap (vm_map_t, vm_offset_t, vm_offset_t, vm_map_t);
int vm_map_madvise (vm_map_t, vm_offset_t, vm_offset_t, int, off_t);
void vm_map_simplify_entry (vm_map_t, vm_map_entry_t, int *);
void vm_init2 (void);
int vm_uiomove (vm_map_t, vm_object_t, off_t, int, vm_offset_t, int *);
int vm_map_stack (vm_map_t, vm_offset_t, vm_size_t, int,
		  vm_prot_t, vm_prot_t, int);
int vm_map_growstack (struct proc *p, vm_offset_t addr);
int vmspace_swap_count (struct vmspace *vmspace);
int vmspace_anonymous_count (struct vmspace *vmspace);
void vm_map_set_wired_quick(vm_map_t map, vm_offset_t addr, vm_size_t size, int *);
void vm_map_transition_wait(vm_map_t map);


#endif
#endif				/* _VM_VM_MAP_H_ */
Commit	Line	Data
984263bc MD	1	/*
	2	* Copyright (c) 1991, 1993
	3	* The Regents of the University of California. All rights reserved.
	4	*
	5	* This code is derived from software contributed to Berkeley by
	6	* The Mach Operating System project at Carnegie-Mellon University.
	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	* 3. All advertising materials mentioning features or use of this software
	17	* must display the following acknowledgement:
	18	* This product includes software developed by the University of
	19	* California, Berkeley and its contributors.
	20	* 4. 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	* $FreeBSD: src/sys/vm/vm_map.h,v 1.54.2.5 2003/01/13 22:51:17 dillon Exp $
e3161323	65	* $DragonFly: src/sys/vm/vm_map.h,v 1.30 2007/04/29 18:25:41 dillon Exp $
984263bc MD	66	*/
	67
	68	/*
	69	* Virtual memory map module definitions.
	70	*/
	71
1bd40720 MD	72	#ifndef _VM_VM_MAP_H_
1bd40720 MD	73	#define _VM_VM_MAP_H_
984263bc	74
1bd40720 MD	75	#ifndef _SYS_TYPES_H_
	76	#include <sys/types.h>
	77	#endif
	78	#ifndef _SYS_TREE_H_
686dbf64	79	#include <sys/tree.h>
1bd40720	80	#endif
e3161323 MD	81	#ifndef _SYS_SYSREF_H_
	82	#include <sys/sysref.h>
	83	#endif
1bd40720 MD	84	#ifndef _SYS_LOCK_H_
	85	#include <sys/lock.h>
	86	#endif
afeabdca MD	87	#ifndef _SYS_VKERNEL_H_
	88	#include <sys/vkernel.h>
	89	#endif
1bd40720 MD	90	#ifndef _VM_VM_H_
	91	#include <vm/vm.h>
	92	#endif
	93	#ifndef _MACHINE_PMAP_H_
	94	#include <machine/pmap.h>
	95	#endif
50a55c46 MD	96	#ifndef _VM_VM_OBJECT_H_
	97	#include <vm/vm_object.h>
	98	#endif
	99	#ifndef _SYS_NULL_H_
	100	#include <sys/_null.h>
	101	#endif
1bd40720	102
686dbf64 MD	103	struct vm_map_rb_tree;
	104	RB_PROTOTYPE(vm_map_rb_tree, vm_map_entry, rb_entry, rb_vm_map_compare);
	105
984263bc MD	106	/*
	107	* Types defined:
	108	*
	109	* vm_map_t the high-level address map data structure.
	110	* vm_map_entry_t an entry in an address map.
	111	*/
	112
69e16e2a	113	typedef u_int vm_flags_t;
984263bc MD	114	typedef u_int vm_eflags_t;
	115
	116	/*
	117	* Objects which live in maps may be either VM objects, or
	118	* another map (called a "sharing map") which denotes read-write
	119	* sharing with other maps.
	120	*/
984263bc MD	121	union vm_map_object {
	122	struct vm_object vm_object; / object object */
	123	struct vm_map sub_map; / belongs to another map */
	124	};
	125
afeabdca MD	126	union vm_map_aux {
	127	vm_offset_t avail_ssize; /* amt can grow if this is a stack */
	128	vpte_t master_pde; /* virtual page table root */
	129	};
	130
984263bc MD	131	/*
	132	* Address map entries consist of start and end addresses,
	133	* a VM object (or sharing map) and offset into that object,
	134	* and user-exported inheritance and protection information.
	135	* Also included is control information for virtual copy operations.
568e6804 MD	136	*
	137	* When used with MAP_STACK, avail_ssize is used to determine the
	138	* limits of stack growth.
	139	*
	140	* When used with VM_MAPTYPE_VPAGETABLE, avail_ssize stores the
	141	* page directory index.
984263bc MD	142	*/
	143	struct vm_map_entry {
	144	struct vm_map_entry prev; / previous entry */
	145	struct vm_map_entry next; / next entry */
686dbf64	146	RB_ENTRY(vm_map_entry) rb_entry;
984263bc MD	147	vm_offset_t start; /* start address */
984263bc MD	148	vm_offset_t end; /* end address */
afeabdca	149	union vm_map_aux aux; /* auxillary data */
984263bc MD	150	union vm_map_object object; /* object I point to */
	151	vm_ooffset_t offset; /* offset into object */
	152	vm_eflags_t eflags; /* map entry flags */
1b874851	153	vm_maptype_t maptype; /* type of VM mapping */
984263bc MD	154	vm_prot_t protection; /* protection code */
	155	vm_prot_t max_protection; /* maximum protection */
	156	vm_inherit_t inheritance; /* inheritance */
	157	int wired_count; /* can be paged if = 0 */
984263bc MD	158	};
	159
	160	#define MAP_ENTRY_NOSYNC 0x0001
c809941b	161	#define MAP_ENTRY_STACK 0x0002
984263bc MD	162	#define MAP_ENTRY_COW 0x0004
	163	#define MAP_ENTRY_NEEDS_COPY 0x0008
	164	#define MAP_ENTRY_NOFAULT 0x0010
	165	#define MAP_ENTRY_USER_WIRED 0x0020
	166
	167	#define MAP_ENTRY_BEHAV_NORMAL 0x0000 /* default behavior */
	168	#define MAP_ENTRY_BEHAV_SEQUENTIAL 0x0040 /* expect sequential access */
	169	#define MAP_ENTRY_BEHAV_RANDOM 0x0080 /* expect random access */
	170	#define MAP_ENTRY_BEHAV_RESERVED 0x00C0 /* future use */
	171
	172	#define MAP_ENTRY_BEHAV_MASK 0x00C0
	173
	174	#define MAP_ENTRY_IN_TRANSITION 0x0100 /* entry being changed */
	175	#define MAP_ENTRY_NEEDS_WAKEUP 0x0200 /* waiter's in transition */
	176	#define MAP_ENTRY_NOCOREDUMP 0x0400 /* don't include in a core */
e40cfbd7	177	#define MAP_ENTRY_KSTACK 0x0800 /* guarded kernel stack */
984263bc MD	178
	179	/*
	180	* flags for vm_map_[un]clip_range()
	181	*/
	182	#define MAP_CLIP_NO_HOLES 0x0001
	183
a108bf71 MD	184	/*
	185	* This reserve count for vm_map_entry_reserve() should cover all nominal
	186	* single-insertion operations, including any necessary clipping.
	187	*/
	188	#define MAP_RESERVE_COUNT 4
	189	#define MAP_RESERVE_SLOP 32
	190
984263bc MD	191	static __inline u_char
	192	vm_map_entry_behavior(struct vm_map_entry *entry)
	193	{
	194	return entry->eflags & MAP_ENTRY_BEHAV_MASK;
	195	}
	196
	197	static __inline void
	198	vm_map_entry_set_behavior(struct vm_map_entry *entry, u_char behavior)
	199	{
	200	entry->eflags = (entry->eflags & ~MAP_ENTRY_BEHAV_MASK) \|
	201	(behavior & MAP_ENTRY_BEHAV_MASK);
	202	}
	203
	204	/*
	205	* Maps are doubly-linked lists of map entries, kept sorted
	206	* by address. A single hint is provided to start
	207	* searches again from the last successful search,
	208	* insertion, or removal.
	209	*
	210	* Note: the lock structure cannot be the first element of vm_map
	211	* because this can result in a running lockup between two or more
	212	* system processes trying to kmem_alloc_wait() due to kmem_alloc_wait()
	213	* and free tsleep/waking up 'map' and the underlying lockmgr also
	214	* sleeping and waking up on 'map'. The lockup occurs when the map fills
	215	* up. The 'exec' map, for example.
	216	*/
	217	struct vm_map {
	218	struct vm_map_entry header; /* List of entries */
686dbf64	219	RB_HEAD(vm_map_rb_tree, vm_map_entry) rb_root;
984263bc MD	220	struct lock lock; /* Lock for map data */
	221	int nentries; /* Number of entries */
	222	vm_size_t size; /* virtual size */
	223	u_char system_map; /* Am I a system map? */
984263bc MD	224	vm_map_entry_t hint; /* hint for quick lookups */
	225	unsigned int timestamp; /* Version number */
	226	vm_map_entry_t first_free; /* First free space hint */
69e16e2a	227	vm_flags_t flags; /* flags for this vm_map */
984263bc MD	228	struct pmap pmap; / Physical map */
	229	#define min_offset header.start
	230	#define max_offset header.end
	231	};
	232
a722be49	233	/*
69e16e2a VS	234	* vm_flags_t values
	235	*/
	236	#define MAP_WIREFUTURE 0x01 /* wire all future pages */
	237
	238	/*
a722be49 MD	239	* Registered upcall
	240	*/
	241	struct upcall;
	242
	243	struct vmupcall {
	244	struct vmupcall *vu_next;
	245	void vu_func; / user upcall function */
	246	void vu_data; / user data */
	247	void vu_ctx; / user context function */
4170cc8b	248	struct lwp vu_lwp; / process that registered upcall */
a722be49 MD	249	int vu_id; /* upcall identifier */
	250	int vu_pending; /* upcall request pending */
	251	};
	252
984263bc MD	253	/*
984263bc MD	254	* Shareable process virtual address space.
e3161323 MD	255	*
e3161323 MD	256	* Refd pointers from vmresident, proc
984263bc MD	257	*/
	258	struct vmspace {
	259	struct vm_map vm_map; /* VM address map */
	260	struct pmap vm_pmap; /* private physical map */
e3161323	261	int vm_unused01;
984263bc MD	262	caddr_t vm_shm; /* SYS5 shared memory private data XXX */
	263	/* we copy from vm_startcopy to the end of the structure on fork */
	264	#define vm_startcopy vm_rssize
	265	segsz_t vm_rssize; /* current resident set size in pages */
	266	segsz_t vm_swrss; /* resident set size before last swap */
	267	segsz_t vm_tsize; /* text size (pages) XXX */
	268	segsz_t vm_dsize; /* data size (pages) XXX */
	269	segsz_t vm_ssize; /* stack size (pages) */
	270	caddr_t vm_taddr; /* user virtual address of text XXX */
	271	caddr_t vm_daddr; /* user virtual address of data XXX */
	272	caddr_t vm_maxsaddr; /* user VA at max stack growth */
	273	caddr_t vm_minsaddr; /* user VA at max stack growth */
239b4df9	274	#define vm_endcopy vm_exitingcnt
984263bc	275	int vm_exitingcnt; /* several procsses zombied in exit1 */
a722be49	276	int vm_upccount; /* number of registered upcalls */
46311ac2	277	int vm_pagesupply;
e3161323 MD	278	struct vmupcall vm_upcalls; / registered upcalls */
e3161323 MD	279	struct sysref vm_sysref; /* sysref, refcnt, etc */
984263bc MD	280	};
	281
	282	/*
29802dbb MD	283	* Resident executable holding structure. A user program can take a snapshot
	284	* of just its VM address space (typically done just after dynamic link
	285	* libraries have completed loading) and register it as a resident
	286	* executable associated with the program binary's vnode, which is also
	287	* locked into memory. Future execs of the vnode will start with a copy
	288	* of the resident vmspace instead of running the binary from scratch,
	289	* avoiding both the kernel ELF loader AND all shared library mapping and
	290	* relocation code, and will call a different entry point (the stack pointer
	291	* is reset to the top of the stack) supplied when the vmspace was registered.
	292	*/
	293	struct vmresident {
	294	struct vnode vr_vnode; / associated vnode */
	295	TAILQ_ENTRY(vmresident) vr_link; /* linked list of res sts */
	296	struct vmspace vr_vmspace; / vmspace to fork */
	297	intptr_t vr_entry_addr; /* registered entry point */
	298	struct sysentvec vr_sysent; / system call vects */
	299	int vr_id; /* registration id */
dbd1282f	300	int vr_refs; /* temporary refs */
29802dbb MD	301	};
29802dbb MD	302
d5fa53d4	303	#ifdef _KERNEL
29802dbb	304	/*
984263bc MD	305	* Macros: vm_map_lock, etc.
	306	* Function:
	307	* Perform locking on the data portion of a map. Note that
	308	* these macros mimic procedure calls returning void. The
	309	* semicolon is supplied by the user of these macros, not
	310	* by the macros themselves. The macros can safely be used
	311	* as unbraced elements in a higher level statement.
	312	*/
	313
46754a20 MD	314	#define ASSERT_VM_MAP_LOCKED(map) KKASSERT(lockowned(&(map)->lock))
46754a20 MD	315
984263bc MD	316	#ifdef DIAGNOSTIC
	317	/* #define MAP_LOCK_DIAGNOSTIC 1 */
	318	#ifdef MAP_LOCK_DIAGNOSTIC
	319	#define vm_map_lock(map) \
	320	do { \
086c1d7e	321	kprintf ("locking map LK_EXCLUSIVE: 0x%x\n", map); \
df4f70a6	322	if (lockmgr(&(map)->lock, LK_EXCLUSIVE) != 0) { \
984263bc MD	323	panic("vm_map_lock: failed to get lock"); \
	324	} \
	325	(map)->timestamp++; \
	326	} while(0)
	327	#else
	328	#define vm_map_lock(map) \
	329	do { \
df4f70a6	330	if (lockmgr(&(map)->lock, LK_EXCLUSIVE) != 0) { \
984263bc MD	331	panic("vm_map_lock: failed to get lock"); \
	332	} \
	333	(map)->timestamp++; \
	334	} while(0)
	335	#endif
	336	#else
	337	#define vm_map_lock(map) \
	338	do { \
df4f70a6	339	lockmgr(&(map)->lock, LK_EXCLUSIVE); \
984263bc MD	340	(map)->timestamp++; \
	341	} while(0)
	342	#endif /* DIAGNOSTIC */
	343
	344	#if defined(MAP_LOCK_DIAGNOSTIC)
	345	#define vm_map_unlock(map) \
	346	do { \
086c1d7e	347	kprintf ("locking map LK_RELEASE: 0x%x\n", map); \
df4f70a6	348	lockmgr(&(map)->lock, LK_RELEASE); \
984263bc MD	349	} while (0)
	350	#define vm_map_lock_read(map) \
	351	do { \
086c1d7e	352	kprintf ("locking map LK_SHARED: 0x%x\n", map); \
df4f70a6	353	lockmgr(&(map)->lock, LK_SHARED); \
984263bc MD	354	} while (0)
	355	#define vm_map_unlock_read(map) \
	356	do { \
086c1d7e	357	kprintf ("locking map LK_RELEASE: 0x%x\n", map); \
df4f70a6	358	lockmgr(&(map)->lock, LK_RELEASE); \
984263bc MD	359	} while (0)
	360	#else
	361	#define vm_map_unlock(map) \
df4f70a6	362	lockmgr(&(map)->lock, LK_RELEASE)
984263bc	363	#define vm_map_lock_read(map) \
df4f70a6	364	lockmgr(&(map)->lock, LK_SHARED)
984263bc	365	#define vm_map_unlock_read(map) \
df4f70a6	366	lockmgr(&(map)->lock, LK_RELEASE)
984263bc MD	367	#endif
	368
	369	static __inline__ int
df4f70a6	370	vm_map_lock_upgrade(vm_map_t map) {
984263bc MD	371	int error;
984263bc MD	372	#if defined(MAP_LOCK_DIAGNOSTIC)
086c1d7e	373	kprintf("locking map LK_EXCLUPGRADE: 0x%x\n", map);
984263bc	374	#endif
df4f70a6	375	error = lockmgr(&map->lock, LK_EXCLUPGRADE);
984263bc MD	376	if (error == 0)
	377	map->timestamp++;
	378	return error;
	379	}
	380
984263bc MD	381	#if defined(MAP_LOCK_DIAGNOSTIC)
	382	#define vm_map_lock_downgrade(map) \
	383	do { \
086c1d7e	384	kprintf ("locking map LK_DOWNGRADE: 0x%x\n", map); \
df4f70a6	385	lockmgr(&(map)->lock, LK_DOWNGRADE); \
984263bc MD	386	} while (0)
	387	#else
	388	#define vm_map_lock_downgrade(map) \
df4f70a6	389	lockmgr(&(map)->lock, LK_DOWNGRADE)
984263bc MD	390	#endif
984263bc MD	391
d5fa53d4 HP	392	#endif /* _KERNEL */
d5fa53d4 HP	393
984263bc MD	394	/*
	395	* Functions implemented as macros
	396	*/
	397	#define vm_map_min(map) ((map)->min_offset)
	398	#define vm_map_max(map) ((map)->max_offset)
	399	#define vm_map_pmap(map) ((map)->pmap)
	400
4a28fe22 MD	401	/*
	402	* Must not block
	403	*/
984263bc MD	404	static __inline struct pmap *
	405	vmspace_pmap(struct vmspace *vmspace)
	406	{
	407	return &vmspace->vm_pmap;
	408	}
	409
	410	static __inline long
	411	vmspace_resident_count(struct vmspace *vmspace)
	412	{
	413	return pmap_resident_count(vmspace_pmap(vmspace));
	414	}
	415
50a55c46 MD	416	/* Calculates the proportional RSS and returning the
	417	* accrued result.
	418	*/
	419	static __inline u_int
	420	vmspace_president_count(struct vmspace *vmspace)
	421	{
	422	vm_map_t map = &vmspace->vm_map;
	423	vm_map_entry_t cur;
	424	vm_object_t object;
	425	u_int count = 0;
	426
	427	for (cur = map->header.next; cur != &map->header; cur = cur->next) {
	428	switch(cur->maptype) {
	429	case VM_MAPTYPE_NORMAL:
	430	case VM_MAPTYPE_VPAGETABLE:
	431	if ((object = cur->object.vm_object) == NULL)
	432	break;
	433	if (object->type != OBJT_DEFAULT &&
	434	object->type != OBJT_SWAP) {
	435	break;
	436	}
	437	if(object->agg_pv_list_count != 0) {
	438	count += (object->resident_page_count / object->agg_pv_list_count);
	439	}
	440	break;
	441	default:
	442	break;
	443	}
	444	}
	445	return(count);
	446	}
	447
a108bf71 MD	448	/*
	449	* Number of kernel maps and entries to statically allocate, required
	450	* during boot to bootstrap the VM system.
	451	*/
984263bc	452	#define MAX_KMAP 10
8e5ea5f7	453	#define MAX_MAPENT 2048 /* required to support up to 64 cpus */
984263bc MD	454
	455	/*
	456	* Copy-on-write flags for vm_map operations
	457	*/
	458	#define MAP_UNUSED_01 0x0001
	459	#define MAP_COPY_ON_WRITE 0x0002
	460	#define MAP_NOFAULT 0x0004
	461	#define MAP_PREFAULT 0x0008
	462	#define MAP_PREFAULT_PARTIAL 0x0010
	463	#define MAP_DISABLE_SYNCER 0x0020
c809941b	464	#define MAP_IS_STACK 0x0040
e40cfbd7	465	#define MAP_IS_KSTACK 0x0080
984263bc MD	466	#define MAP_DISABLE_COREDUMP 0x0100
	467	#define MAP_PREFAULT_MADVISE 0x0200 /* from (user) madvise request */
	468
	469	/*
	470	* vm_fault option flags
	471	*/
0035dca9 MD	472	#define VM_FAULT_NORMAL 0x00 /* Nothing special */
	473	#define VM_FAULT_CHANGE_WIRING 0x01 /* Change the wiring as appropriate */
	474	#define VM_FAULT_USER_WIRE 0x02 /* Likewise, but for user purposes */
1b9d3514	475	#define VM_FAULT_BURST 0x04 /* Burst fault can be done */
0035dca9	476	#define VM_FAULT_DIRTY 0x08 /* Dirty the page */
9f3543c6	477	#define VM_FAULT_UNSWAP 0x10 /* Remove backing store from the page */
0035dca9	478	#define VM_FAULT_WIRE_MASK (VM_FAULT_CHANGE_WIRING\|VM_FAULT_USER_WIRE)
984263bc MD	479
984263bc MD	480	#ifdef _KERNEL
e3161323 MD	481
	482	extern struct sysref_class vmspace_sysref_class;
	483
46754a20 MD	484	boolean_t vm_map_check_protection (vm_map_t, vm_offset_t, vm_offset_t,
46754a20 MD	485	vm_prot_t, boolean_t);
984263bc	486	struct pmap;
41a01a4d	487	struct globaldata;
53025830	488	void vm_map_entry_allocate_object(vm_map_entry_t);
41a01a4d	489	void vm_map_entry_reserve_cpu_init(struct globaldata *gd);
a108bf71 MD	490	int vm_map_entry_reserve(int);
	491	int vm_map_entry_kreserve(int);
	492	void vm_map_entry_release(int);
	493	void vm_map_entry_krelease(int);
e4846942	494	vm_map_t vm_map_create (vm_map_t, struct pmap *, vm_offset_t, vm_offset_t);
a108bf71	495	int vm_map_delete (vm_map_t, vm_offset_t, vm_offset_t, int *);
1b874851	496	int vm_map_find (vm_map_t, vm_object_t, vm_ooffset_t,
9388fcaa MD	497	vm_offset_t *, vm_size_t, vm_size_t,
9388fcaa MD	498	boolean_t, vm_maptype_t,
1b874851 MD	499	vm_prot_t, vm_prot_t,
1b874851 MD	500	int);
9388fcaa	501	int vm_map_findspace (vm_map_t, vm_offset_t, vm_size_t, vm_size_t,
c809941b	502	int, vm_offset_t *);
911e30e2	503	vm_offset_t vm_map_hint(struct proc *, vm_offset_t, vm_prot_t);
1388df65	504	int vm_map_inherit (vm_map_t, vm_offset_t, vm_offset_t, vm_inherit_t);
e4846942	505	void vm_map_init (struct vm_map *, vm_offset_t, vm_offset_t, pmap_t);
1b874851 MD	506	int vm_map_insert (vm_map_t, int *, vm_object_t, vm_ooffset_t,
	507	vm_offset_t, vm_offset_t,
	508	vm_maptype_t,
	509	vm_prot_t, vm_prot_t,
	510	int);
1388df65 RG	511	int vm_map_lookup (vm_map_t , vm_offset_t, vm_prot_t, vm_map_entry_t , vm_object_t *,
1388df65 RG	512	vm_pindex_t , vm_prot_t , boolean_t *);
a108bf71	513	void vm_map_lookup_done (vm_map_t, vm_map_entry_t, int);
1388df65	514	boolean_t vm_map_lookup_entry (vm_map_t, vm_offset_t, vm_map_entry_t *);
e1359933	515	int vm_map_wire (vm_map_t, vm_offset_t, vm_offset_t, int);
cde87949	516	int vm_map_unwire (vm_map_t, vm_offset_t, vm_offset_t, boolean_t);
1388df65 RG	517	int vm_map_clean (vm_map_t, vm_offset_t, vm_offset_t, boolean_t, boolean_t);
	518	int vm_map_protect (vm_map_t, vm_offset_t, vm_offset_t, vm_prot_t, boolean_t);
	519	int vm_map_remove (vm_map_t, vm_offset_t, vm_offset_t);
	520	void vm_map_startup (void);
	521	int vm_map_submap (vm_map_t, vm_offset_t, vm_offset_t, vm_map_t);
afeabdca	522	int vm_map_madvise (vm_map_t, vm_offset_t, vm_offset_t, int, off_t);
a108bf71	523	void vm_map_simplify_entry (vm_map_t, vm_map_entry_t, int *);
1388df65 RG	524	void vm_init2 (void);
1388df65 RG	525	int vm_uiomove (vm_map_t, vm_object_t, off_t, int, vm_offset_t, int *);
c809941b	526	int vm_map_stack (vm_map_t, vm_offset_t, vm_size_t, int,
85d25bcf	527	vm_prot_t, vm_prot_t, int);
1388df65 RG	528	int vm_map_growstack (struct proc *p, vm_offset_t addr);
1388df65 RG	529	int vmspace_swap_count (struct vmspace *vmspace);
20479584	530	int vmspace_anonymous_count (struct vmspace *vmspace);
a108bf71	531	void vm_map_set_wired_quick(vm_map_t map, vm_offset_t addr, vm_size_t size, int *);
ff13bc52 VS	532	void vm_map_transition_wait(vm_map_t map);
ff13bc52 VS	533
984263bc MD	534
984263bc MD	535	#endif
1bd40720	536	#endif /* _VM_VM_MAP_H_ */